Lines Matching refs:curlen
710 int curlen; /* length of current code */
720 curlen = nextlen; nextlen = tree[n+1].Len;
721 if (++count < max_count && curlen == nextlen) {
724 s->bl_tree[curlen].Freq += count;
725 } else if (curlen != 0) {
726 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
733 count = 0; prevlen = curlen;
736 } else if (curlen == nextlen) {
755 int curlen; /* length of current code */
765 curlen = nextlen; nextlen = tree[n+1].Len;
766 if (++count < max_count && curlen == nextlen) {
769 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
771 } else if (curlen != 0) {
772 if (curlen != prevlen) {
773 send_code(s, curlen, s->bl_tree); count--;
784 count = 0; prevlen = curlen;
787 } else if (curlen == nextlen) {
