Lines Matching refs:curlen
634 int curlen; /* length of current code */
644 curlen = nextlen; nextlen = tree[n+1].Len;
645 if (++count < max_count && curlen == nextlen) {
648 s->bl_tree[curlen].Freq += count;
649 } else if (curlen != 0) {
650 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
657 count = 0; prevlen = curlen;
660 } else if (curlen == nextlen) {
680 int curlen; /* length of current code */
690 curlen = nextlen; nextlen = tree[n+1].Len;
691 if (++count < max_count && curlen == nextlen) {
694 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
696 } else if (curlen != 0) {
697 if (curlen != prevlen) {
698 send_code(s, curlen, s->bl_tree); count--;
709 count = 0; prevlen = curlen;
712 } else if (curlen == nextlen) {