Lines Matching refs:Len
233 #define Len dl.len
448 # define send_code(c, tree) send_bits(tree[c].Code, tree[c].Len)
454 send_bits(tree[c].Code, tree[c].Len); }
490 if (static_dtree[0].Len != 0) return; /* ct_init already called */
536 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
537 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
538 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
539 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
548 static_dtree[n].Len = 5;
660 tree[heap[heap_max]].Len = 0; /* root of the heap */
664 bits = tree[tree[n].Dad].Len + 1;
666 tree[n].Len = (ush)bits;
676 if (stree) static_len += (ulg)f * (stree[n].Len + xbits);
706 if (tree[m].Len != (ush)bits) {
707 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
708 opt_len += ((long)bits-(long)tree[m].Len)*(long)tree[m].Freq;
709 tree[m].Len = (ush)bits;
747 int len = tree[n].Len;
786 tree[n].Len = 0;
799 opt_len--; if (stree) static_len -= stree[new].Len;
859 int nextlen = tree[0].Len; /* length of next code */
865 tree[max_code+1].Len = (ush)-1; /* guard */
868 curlen = nextlen; nextlen = tree[n+1].Len;
903 int nextlen = tree[0].Len; /* length of next code */
908 /* tree[max_code+1].Len = -1; */ /* guard already set */
912 curlen = nextlen; nextlen = tree[n+1].Len;
965 if (bl_tree[bl_order[max_blindex]].Len != 0) break;
994 send_bits(bl_tree[bl_order[rank]].Len, 3);