Cross Reference: /external/zopfli/src/zopflipng/lodepng/lodepng.cpp

Lines Matching refs:distance
451 /*the distance codes have their own symbols, 30 used, 2 unused*/
466 /*the base backwards distances (the bits of distance codes appear after length codes and use their own huffman tree)*/
881 /*get the distance code tree of a deflated block with fixed tree, as specified in the deflate specification*/
888   /*there are 32 distance codes, but 30-31 are unused*/
957   /*number of distance codes. Unlike the spec, the value 1 is added to it here already*/
1091   HuffmanTree tree_d; /*the huffman tree for distance codes*/
1116       unsigned code_d, distance;
1117       unsigned numextrabits_l, numextrabits_d; /*extra bits for length and distance*/
1128       /*part 3: get distance code*/
1138         else error = 18; /*error: invalid distance code (30-31 are never used)*/
1141       distance = DISTANCEBASE[code_d];
1143       /*part 4: get extra bits from distance*/
1147       distance += readBitsFromStream(bp, in, numextrabits_d);
1151       if(distance > start) ERROR_BREAK(52); /*too long backward distance*/
1152       backward = start - distance;
1164         if(backward >= start) backward = start - distance;
1314 static void addLengthDistance(uivector* values, size_t length, size_t distance)
1319   257-285: length/distance pair (length code, followed by extra length bits, distance code, extra distance bits)
1324   unsigned dist_code = (unsigned)searchCodeIndex(DISTANCEBASE, 30, distance);
1325   unsigned extra_distance = (unsigned)(distance - DISTANCEBASE[dist_code]);
1425 length/distance pairs.
1443   unsigned offset; /*the offset represents the distance in LZ77 terminology*/
1561     /*encode it as length/distance pair or literal value*/
1562     if(length < 3) /*only lengths of 3 or higher are supported as length/distance pair*/
1640 tree_d: the tree for distance codes.
1679   literal bytes and length/distance pairs. This is then huffman compressed with
1688   /*The lz77 encoded data, represented with integers since there will also be length and distance codes in it*/
1691   HuffmanTree tree_d; /*tree for distance codes*/
1855     - HDIST + 1 code lengths of distance alphabet (encoded using the code length
1922   HuffmanTree tree_d; /*tree for distance codes*/
5939     case 18: return "invalid distance code while inflating";