Lines Matching defs:length
706 greedy parsing, match length filtering, RLE-only, and Huffman-only streams.
7693 // Compress an array of bytes, using run-length encoding,
7694 // and return the length of the compressed data.
7744 // Returns the length of the oncompressed data, or 0 if the
7745 // length of the uncompressed data would be more than maxLength.
8277 const int HUF_ENCBITS = 16; // literal (value) bit length
8286 int len : 8; // code length 0
8321 // - for each (uncompressed) symbol, hcode contains the length
8327 // * for codes with the same length, numerical values
8340 // number of different codes of length i, and
8350 // numerically lowest code with length i, and
8363 // hcode[i] contains the length, l, of the
8365 // code of length l to the symbol and store both
8378 // - code structure is : [63:lsb - 6:msb] | [5-0: bit length];
8379 // - max code length is 58 bits;
8380 // - codes outside the range [im-iM] have a null length (unused values);
8437 // hufEncode() uses the pseudo-symbol for run-length encoding.
8462 // leaf node, the distance between the root and the leaf is the length
8501 // For each element visited, increment the length of the
8544 // lengths in scode with (code, code length) pairs. Copy the
8635 long long l = hcode[im] = getBits(6, c, lc, p); // code length
8951 int rlc, // i : run-length code
9346 // length header(4byte), then huff data. Initialize length header with zero,
9347 // then later fill it by `length`.
9353 int length =
9355 memcpy(lengthPtr, &length, sizeof(int));
9359 static_cast<unsigned int>(length));
9417 int length;
9419 // length = *(reinterpret_cast<const int *>(ptr));
9420 tinyexr::cpy4(&length, reinterpret_cast<const int *>(ptr));
9423 if (size_t((ptr - inPtr) + length) > inLen) {
9428 hufUncompress(reinterpret_cast<const char *>(ptr), length, &tmpBuffer);
10964 (*err) += "Insufficient data length.\n";