Home | History | Annotate | Download | only in net

Lines Matching defs:curlen

2804     int curlen;                /* length of current code */
2814 curlen = nextlen; nextlen = tree[n+1].Len;
2815 if (++count < max_count && curlen == nextlen) {
2818 s->bl_tree[curlen].Freq += count;
2819 } else if (curlen != 0) {
2820 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2827 count = 0; prevlen = curlen;
2830 } else if (curlen == nextlen) {
2848 int curlen; /* length of current code */
2858 curlen = nextlen; nextlen = tree[n+1].Len;
2859 if (++count < max_count && curlen == nextlen) {
2862 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
2864 } else if (curlen != 0) {
2865 if (curlen != prevlen) {
2866 send_code(s, curlen, s->bl_tree); count--;
2877 count = 0; prevlen = curlen;
2880 } else if (curlen == nextlen) {