如何为 Ogg 构建 CRC32 table?
How to build CRC32 table for Ogg?
来自 this answer 我改编了下面的代码:
function _makeCRCTable() {
const CRCTable = new Uint32Array(256);
for (let i = 256; i--;) {
let char = i;
for (let j = 8; j--;) {
char = char & 1 ? 3988292384 ^ char >>> 1 : char >>> 1;
}
CRCTable[i] = char;
}
return CRCTable;
}
此代码生成 table as here, but for Ogg I need another table - as here。
32 bit CRC value (direct algorithm, initial val and final XOR = 0,
generator polynomial=0x04c11db7)
parseInt('04c11db7', 16)
return 79764919
- 我尝试了这个多项式,但结果 table 不正确。
我是 CRC 领域的新手,因为我发现 there are a few variations of CRC32 algorithm。
我不确定 javascript 优先级,但异或需要在移位后发生:
char = char & 1 ? 3988292384 ^ (char >>> 1) : char >>> 1;
然而,您显示的第一个 table 似乎是正确的,因为 table[128] = table[0x80] = 3988292384 = 0xEDB88320 这是 0x104c11db7 位反转,然后右移一位位.
您拥有的第二个 table 用于左移 CRC,其中 table[1] = x04c11db7。在这种情况下,内部循环将包含如下内容:
let char = i << 24;
for (let j = 8; j--;) {
char = char & 0x80000000 ? 0x04c11db7 ^ char << 1 : char << 1;
}
用于比较的示例 C 代码,为模式 {0x01}、{0x01,0x00}、{0x01,0x00,0x00}、{0x01,0x00,0x00,0x00} 生成 crc。
#include <stdio.h>
typedef unsigned char uint8_t;
typedef unsigned int uint32_t;
uint32_t crctbl[256];
void gentbl(void)
{
uint32_t crc;
uint32_t b;
uint32_t c;
uint32_t i;
for(c = 0; c < 0x100; c++){
crc = c<<24;
for(i = 0; i < 8; i++){
b = crc>>31;
crc <<= 1;
crc ^= (0 - b) & 0x04c11db7;
}
crctbl[c] = crc;
}
}
uint32_t crc32(uint8_t * bfr, size_t size)
{
uint32_t crc = 0;
while(size--)
crc = (crc << 8) ^ crctbl[(crc >> 24)^*bfr++];
return(crc);
}
int main(int argc, char** argv)
{
uint32_t crc;
uint8_t bfr[4] = {0x01,0x00,0x00,0x00};
gentbl();
crc = crc32(bfr, 1); /* 0x04c11db7 */
printf("%08x\n", crc);
crc = crc32(bfr, 2); /* 0xd219c1dc */
printf("%08x\n", crc);
crc = crc32(bfr, 3); /* 0x01d8ac87 */
printf("%08x\n", crc);
crc = crc32(bfr, 4); /* 0xdc6d9ab7 */
printf("%08x\n", crc);
return(0);
}
对于 JS:
function _makeCRC32Table() {
const polynomial = 79764919;
const mask = 2147483648;
const CRCTable = new Uint32Array(256);
for (let i = 256; i--;) {
let char = i << 24;
for (let j = 8; j--;) {
char = char & mask ? polynomial ^ char << 1 : char << 1;
}
CRCTable[i] = char;
}
return CRCTable;
}
如何使用这个table:
[1, 0].reduce((crc, byte) => crc << 8 >>> 0 ^ CRCTable[crc >>> 24 ^ byte], 0) >>> 0
这里我们添加了>>> 0
取数的模数——因为JS中没有unsigned int——JavaScript doesn't have integers. It only has double precision floating-point numbers.
请注意,对于 Ogg,您必须以相反的顺序设置生成的 CRC。
来自 this answer 我改编了下面的代码:
function _makeCRCTable() {
const CRCTable = new Uint32Array(256);
for (let i = 256; i--;) {
let char = i;
for (let j = 8; j--;) {
char = char & 1 ? 3988292384 ^ char >>> 1 : char >>> 1;
}
CRCTable[i] = char;
}
return CRCTable;
}
此代码生成 table as here, but for Ogg I need another table - as here。
32 bit CRC value (direct algorithm, initial val and final XOR = 0, generator polynomial=0x04c11db7)
parseInt('04c11db7', 16)
return 79764919
- 我尝试了这个多项式,但结果 table 不正确。
我是 CRC 领域的新手,因为我发现 there are a few variations of CRC32 algorithm。
我不确定 javascript 优先级,但异或需要在移位后发生:
char = char & 1 ? 3988292384 ^ (char >>> 1) : char >>> 1;
然而,您显示的第一个 table 似乎是正确的,因为 table[128] = table[0x80] = 3988292384 = 0xEDB88320 这是 0x104c11db7 位反转,然后右移一位位.
您拥有的第二个 table 用于左移 CRC,其中 table[1] = x04c11db7。在这种情况下,内部循环将包含如下内容:
let char = i << 24;
for (let j = 8; j--;) {
char = char & 0x80000000 ? 0x04c11db7 ^ char << 1 : char << 1;
}
用于比较的示例 C 代码,为模式 {0x01}、{0x01,0x00}、{0x01,0x00,0x00}、{0x01,0x00,0x00,0x00} 生成 crc。
#include <stdio.h>
typedef unsigned char uint8_t;
typedef unsigned int uint32_t;
uint32_t crctbl[256];
void gentbl(void)
{
uint32_t crc;
uint32_t b;
uint32_t c;
uint32_t i;
for(c = 0; c < 0x100; c++){
crc = c<<24;
for(i = 0; i < 8; i++){
b = crc>>31;
crc <<= 1;
crc ^= (0 - b) & 0x04c11db7;
}
crctbl[c] = crc;
}
}
uint32_t crc32(uint8_t * bfr, size_t size)
{
uint32_t crc = 0;
while(size--)
crc = (crc << 8) ^ crctbl[(crc >> 24)^*bfr++];
return(crc);
}
int main(int argc, char** argv)
{
uint32_t crc;
uint8_t bfr[4] = {0x01,0x00,0x00,0x00};
gentbl();
crc = crc32(bfr, 1); /* 0x04c11db7 */
printf("%08x\n", crc);
crc = crc32(bfr, 2); /* 0xd219c1dc */
printf("%08x\n", crc);
crc = crc32(bfr, 3); /* 0x01d8ac87 */
printf("%08x\n", crc);
crc = crc32(bfr, 4); /* 0xdc6d9ab7 */
printf("%08x\n", crc);
return(0);
}
对于 JS:
function _makeCRC32Table() {
const polynomial = 79764919;
const mask = 2147483648;
const CRCTable = new Uint32Array(256);
for (let i = 256; i--;) {
let char = i << 24;
for (let j = 8; j--;) {
char = char & mask ? polynomial ^ char << 1 : char << 1;
}
CRCTable[i] = char;
}
return CRCTable;
}
如何使用这个table:
[1, 0].reduce((crc, byte) => crc << 8 >>> 0 ^ CRCTable[crc >>> 24 ^ byte], 0) >>> 0
这里我们添加了>>> 0
取数的模数——因为JS中没有unsigned int——JavaScript doesn't have integers. It only has double precision floating-point numbers.
请注意,对于 Ogg,您必须以相反的顺序设置生成的 CRC。