Lines Matching refs:curlen
2471 int curlen; /* length of current code */
2481 curlen = nextlen; nextlen = tree[n+1].Len;
2482 if (++count < max_count && curlen == nextlen) {
2485 s->bl_tree[curlen].Freq += count;
2486 } else if (curlen != 0) {
2487 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2494 count = 0; prevlen = curlen;
2497 } else if (curlen == nextlen) {
2516 int curlen; /* length of current code */
2526 curlen = nextlen; nextlen = tree[n+1].Len;
2527 if (++count < max_count && curlen == nextlen) {
2530 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
2532 } else if (curlen != 0) {
2533 if (curlen != prevlen) {
2534 send_code(s, curlen, s->bl_tree); count--;
2545 count = 0; prevlen = curlen;
2548 } else if (curlen == nextlen) {