Lines Matching defs:curlen
715 int curlen; /* length of current code */
725 curlen = nextlen; nextlen = tree[n + 1].Len;
726 if (++count < max_count && curlen == nextlen) {
729 s->bl_tree[curlen].Freq += count;
730 } else if (curlen != 0) {
731 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
738 count = 0; prevlen = curlen;
741 } else if (curlen == nextlen) {
756 int curlen; /* length of current code */
766 curlen = nextlen; nextlen = tree[n + 1].Len;
767 if (++count < max_count && curlen == nextlen) {
770 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
772 } else if (curlen != 0) {
773 if (curlen != prevlen) {
774 send_code(s, curlen, s->bl_tree); count--;
785 count = 0; prevlen = curlen;
788 } else if (curlen == nextlen) {