HomeSort by relevance Sort by last modified time
    Searched refs:HLIT (Results 1 - 6 of 6) sorted by null

  /external/zopfli/src/zopflipng/lodepng/
lodepng_util.cpp 414 size_t HLIT = readBitsFromStream(bp, in, 5) + 257; //number of literal/length codes + 257
417 zlibinfo->back().hlit = HLIT - 257;
426 while(i < HLIT + HDIST)
430 if(code <= 15) { if(i < HLIT) bitlen[i++] = code; else bitlenD[i++ - HLIT] = code; } //a length code
436 if((i - 1) < HLIT) value = bitlen[i - 1];
437 else value = bitlenD[i - HLIT - 1];
440 if(i >= HLIT + HDIST) { error = 13; return; } //error: i is larger than the amount of codes
441 if(i < HLIT) bitlen[i++] = value; else bitlenD[i++ - HLIT] = value
    [all...]
lodepng.cpp 943 unsigned n, HLIT, HDIST, HCLEN, i;
956 HLIT = readBitsFromStream(bp, in, 5) + 257;
    [all...]
  /prebuilts/go/darwin-x86/src/compress/flate/
inflate.go 145 // not the HCLEN and HLIT tree. However, a stream with an empty HCLEN tree
147 // codes for the HLIT and HDIST trees. Similarly, an empty HLIT tree is
367 // HLIT[5], HDIST[5], HCLEN[4].
406 // HLIT + 257 code lengths, HDIST + 1 code lengths,
464 // for the HLIT tree to the length of the EOB marker since we know that
  /prebuilts/go/linux-x86/src/compress/flate/
inflate.go 145 // not the HCLEN and HLIT tree. However, a stream with an empty HCLEN tree
147 // codes for the HLIT and HDIST trees. Similarly, an empty HLIT tree is
367 // HLIT[5], HDIST[5], HCLEN[4].
406 // HLIT + 257 code lengths, HDIST + 1 code lengths,
464 // for the HLIT tree to the length of the EOB marker since we know that