Lines Matching defs:depth
24 int p0, HuffmanTree* pool, uint8_t* depth, int max_depth) {
38 depth[pool[p].index_right_or_value_] = (uint8_t)level;
59 Brotli specifies a maximum depth of 15 bits for "code trees"
75 uint8_t* depth) {
97 depth[tree[0].index_right_or_value_] = 1; /* Only one element. */
144 if (BrotliSetDepth((int)(2 * n - 1), &tree[0], depth, tree_limit)) {
375 static void DecideOverRleUse(const uint8_t* depth, const size_t length,
384 const uint8_t value = depth[i];
387 for (k = i + 1; k < length && depth[k] == value; ++k) {
405 void BrotliWriteHuffmanTree(const uint8_t* depth,
418 if (depth[length - i - 1] == 0) {
429 DecideOverRleUse(depth, new_length,
435 const uint8_t value = depth[i];
440 for (k = i + 1; k < new_length && depth[k] == value; ++k) {
476 void BrotliConvertBitDepthsToSymbols(const uint8_t* depth,
480 0 bit depth means that the symbol does not exist. */
486 ++bl_count[depth[i]];
495 if (depth[i]) {
496 bits[i] = BrotliReverseBits(depth[i], next_code[depth[i]]++);