Lines Matching refs:curlen
2469 int curlen; /* length of current code */
2479 curlen = nextlen; nextlen = tree[n+1].Len;
2480 if (++count < max_count && curlen == nextlen) {
2483 s->bl_tree[curlen].Freq += count;
2484 } else if (curlen != 0) {
2485 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2492 count = 0; prevlen = curlen;
2495 } else if (curlen == nextlen) {
2514 int curlen; /* length of current code */
2524 curlen = nextlen; nextlen = tree[n+1].Len;
2525 if (++count < max_count && curlen == nextlen) {
2528 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
2530 } else if (curlen != 0) {
2531 if (curlen != prevlen) {
2532 send_code(s, curlen, s->bl_tree); count--;
2543 count = 0; prevlen = curlen;
2546 } else if (curlen == nextlen) {