Lines Matching refs:Len

163 #  define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
169        send_bits(s, tree[c].Code, tree[c].Len); }
293     while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;  in tr_static_init()
294     while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;  in tr_static_init()
295     while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;  in tr_static_init()
296     while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;  in tr_static_init()
305         static_dtree[n].Len = 5;  in tr_static_init()
340                 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));  in gen_trees_header()
346                 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));  in gen_trees_header()
510     tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
514         bits = tree[tree[n].Dad].Len + 1;
516         tree[n].Len = (ush)bits;
526         if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
556             if ((unsigned) tree[m].Len != (unsigned) bits) {
557                 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
558                 s->opt_len += ((long)bits - (long)tree[m].Len)
560                 tree[m].Len = (ush)bits;
599         int len = tree[n].Len;
639             tree[n].Len = 0;
652         s->opt_len--; if (stree) s->static_len -= stree[node].Len;
713     int nextlen = tree[0].Len; /* length of next code */
719     tree[max_code+1].Len = (ush)0xffff; /* guard */
722         curlen = nextlen; nextlen = tree[n+1].Len;
758     int nextlen = tree[0].Len; /* length of next code */
767         curlen = nextlen; nextlen = tree[n+1].Len;
821         if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
851         send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);