Lines Matching refs:Len
343 #define Len dl.len
2378 #define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
2384 send_bits(s, tree[c].Code, tree[c].Len); }
2517 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
2518 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
2519 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
2520 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
2530 static_dtree[n].Len = 5;
2680 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
2684 bits = tree[tree[n].Dad].Len + 1;
2686 tree[n].Len = (ush)bits;
2696 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
2732 if (tree[m].Len != (unsigned)bits) {
2734 tree[m].Len, bits));
2735 s->opt_len += ((long)bits - (long)tree[m].Len)
2737 tree[m].Len = (ush)bits;
2781 int len = tree[n].Len;
2826 tree[n].Len = 0;
2841 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
2908 int nextlen = tree[0].Len; /* length of next code */
2914 tree[max_code+1].Len = (ush)0xffff; /* guard */
2917 curlen = nextlen; nextlen = tree[n+1].Len;
2955 int nextlen = tree[0].Len; /* length of next code */
2960 /* tree[max_code+1].Len = -1; */ /* guard already set */
2964 curlen = nextlen; nextlen = tree[n+1].Len;
3031 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
3064 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
3413 s->last_eob_len = ltree[END_BLOCK].Len;