Lines Matching defs:length
60 and 7 bits for "code length code trees."
64 maximum length requirement.
72 const size_t length,
88 for (i = length; i != 0;) {
244 void BrotliOptimizeHuffmanCountsForRle(size_t length, uint32_t* counts,
253 for (i = 0; i < length; i++) {
261 while (length != 0 && counts[length - 1] == 0) {
262 --length;
264 if (length == 0) {
267 /* Now counts[0..length - 1] does not have trailing zeros. */
271 for (i = 0; i < length; ++i) {
284 size_t zeros = length - nonzeros;
286 for (i = 1; i < length - 1; ++i) {
299 memset(good_for_rle, 0, length);
306 for (i = 0; i <= length; ++i) {
307 if (i == length || counts[i] != symbol) {
316 if (i != length) {
329 for (i = 0; i <= length; ++i) {
330 if (i == length || good_for_rle[i] ||
352 if (i < length - 2) {
356 } else if (i < length) {
363 if (i != length) {
375 static void DecideOverRleUse(const uint8_t* depth, const size_t length,
383 for (i = 0; i < length;) {
387 for (k = i + 1; k < length && depth[k] == value; ++k) {
406 size_t length,
416 size_t new_length = length;
417 for (i = 0; i < length; ++i) {
418 if (depth[length - i - 1] == 0) {
426 if (length > 50) {