Lines Matching refs:Len

194 #  define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
200 send_bits(s, tree[c].Code, tree[c].Len); }
325 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
326 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
327 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
328 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
337 static_dtree[n].Len = 5; in tr_static_init()
373 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
379 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
544 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()
548 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
553 tree[n].Len = (ush)bits; in gen_bitlen()
563 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits); in gen_bitlen()
593 if ((unsigned) tree[m].Len != (unsigned) bits) { in gen_bitlen()
594 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); in gen_bitlen()
595 s->opt_len += ((long)bits - (long)tree[m].Len) in gen_bitlen()
597 tree[m].Len = (ush)bits; in gen_bitlen()
638 int len = tree[n].Len; in gen_codes()
680 tree[n].Len = 0; in build_tree()
693 s->opt_len--; if (stree) s->static_len -= stree[node].Len; in build_tree()
755 int nextlen = tree[0].Len; /* length of next code */ in scan_tree()
764 tree[max_code+1].Len = (ush)0xffff; /* guard */ in scan_tree()
767 curlen = nextlen; nextlen = tree[n+1].Len; in scan_tree()
807 int nextlen = tree[0].Len; /* length of next code */ in send_tree()
819 curlen = nextlen; nextlen = tree[n+1].Len; in send_tree()
876 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break; in build_bl_tree()
909 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); in send_all_trees()
1186 s->last_eob_len = ltree[END_BLOCK].Len;