HomeSort by: relevance | last modified time | path
    Searched refs:bl_tree (Results 1 - 4 of 4) sorted by relevancy

  /src/common/dist/zlib/
trees.c 447 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
466 s->bl_desc.dyn_tree = s->bl_tree;
686 if (tree == s->bl_tree) {
729 s->bl_tree[curlen].Freq += count;
731 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
732 s->bl_tree[REP_3_6].Freq++;
734 s->bl_tree[REPZ_3_10].Freq++;
736 s->bl_tree[REPZ_11_138].Freq++;
751 * bl_tree.
770 do { send_code(s, curlen, s->bl_tree); } while (--count != 0)
    [all...]
deflate.h 206 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member in struct:internal_state
deflate.c 1334 ds->bl_desc.dyn_tree = ds->bl_tree;
  /src/sys/net/
zlib.c 467 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member in struct:deflate_state
1261 ds->bl_desc.dyn_tree = ds->bl_tree;
2490 s->bl_desc.dyn_tree = s->bl_tree;
2515 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
2772 if (tree == s->bl_tree) {
2818 s->bl_tree[curlen].Freq += count;
2820 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2821 s->bl_tree[REP_3_6].Freq++;
2823 s->bl_tree[REPZ_3_10].Freq++;
2825 s->bl_tree[REPZ_11_138].Freq++
    [all...]

Completed in 17 milliseconds