Lines Matching defs:curlen
2071 int curlen; /* length of current code */
2081 curlen = nextlen; nextlen = tree[n+1].Len;
2082 if (++count < max_count && curlen == nextlen) {
2085 s->bl_tree[curlen].Freq += count;
2086 } else if (curlen != 0) {
2087 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2094 count = 0; prevlen = curlen;
2097 } else if (curlen == nextlen) {
2116 int curlen; /* length of current code */
2126 curlen = nextlen; nextlen = tree[n+1].Len;
2127 if (++count < max_count && curlen == nextlen) {
2130 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
2132 } else if (curlen != 0) {
2133 if (curlen != prevlen) {
2134 send_code(s, curlen, s->bl_tree); count--;
2145 count = 0; prevlen = curlen;
2148 } else if (curlen == nextlen) {