Cross Reference: /src/sys/net/zlib.c

Lines Matching defs:Len
350 #define Len  dl.len
2267 #  define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
2273        send_bits(s, tree[c].Code, tree[c].Len); }
2393     while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
2394     while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
2395     while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
2396     while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
2405         static_dtree[n].Len = 5;
2440 		static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
2446 		static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
2606     tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
2610         bits = tree[tree[n].Dad].Len + 1;
2612         tree[n].Len = (ush)bits;
2622         if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
2652             if (tree[m].Len != (unsigned) bits) {
2653                 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
2654                 s->opt_len += ((long)bits - (long)tree[m].Len)
2656                 tree[m].Len = (ush)bits;
2694         int len = tree[n].Len;
2733             tree[n].Len = 0;
2746         s->opt_len--; if (stree) s->static_len -= stree[node].Len;
2805     int nextlen = tree[0].Len; /* length of next code */
2811     tree[max_code+1].Len = (ush)0xffff; /* guard */
2814         curlen = nextlen; nextlen = tree[n+1].Len;
2849     int nextlen = tree[0].Len; /* length of next code */
2854     /* tree[max_code+1].Len = -1; */  /* guard already set */
2858         curlen = nextlen; nextlen = tree[n+1].Len;
2911         if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
2940         send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
3210     s->last_eob_len = ltree[END_BLOCK].Len;