Lines Matching defs:hcode
8321 // - for each (uncompressed) symbol, hcode contains the length
8323 // - canonical codes are computed and stored in hcode
8335 static void hufCanonicalCodeTable(long long hcode[HUF_ENCSIZE]) {
8346 for (int i = 0; i < HUF_ENCSIZE; ++i) n[hcode[i]] += 1;
8363 // hcode[i] contains the length, l, of the
8366 // l and the code in hcode[i].
8370 int l = static_cast<int>(hcode[i]);
8372 if (l > 0) hcode[i] = l | (n[l]++ << 6);
8573 const long long *hcode, // i : encoding table [HUF_ENCSIZE]
8574 int im, // i : min hcode index
8575 int iM, // i : max hcode index
8583 int l = hufLength(hcode[im]);
8589 if (hufLength(hcode[im + 1]) > 0) break;
8620 int im, // i : min hcode index
8621 int iM, // i : max hcode index
8622 long long *hcode) // o: encoding table [HUF_ENCSIZE]
8624 memset(hcode, 0, sizeof(long long) * HUF_ENCSIZE);
8635 long long l = hcode[im] = getBits(6, c, lc, p); // code length
8648 while (zerun--) hcode[im++] = 0;
8658 while (zerun--) hcode[im++] = 0;
8666 hufCanonicalCodeTable(hcode);
8691 // Build a decoding hash table based on the encoding table hcode:
8698 static bool hufBuildDecTable(const long long *hcode, // i : encoding table
8699 int im, // i : min index in hcode
8700 int iM, // i : max index in hcode
8710 long long c = hufCode(hcode[im]);
8711 int l = hufLength(hcode[im]);
8823 // Encode (compress) ni values based on the Huffman encoding table hcode:
8827 (const long long *hcode, // i : encoding table
8851 sendCode(hcode[s], cs, hcode[rlc], c, lc, out);
8862 sendCode(hcode[s], cs, hcode[rlc], c, lc, out);
8947 static bool hufDecode(const long long *hcode, // i : encoding table
9004 int l = hufLength(hcode[pl.p[j]]);
9010 if (hufCode(hcode[pl.p[j]]) ==