Lines Matching defs:curlen
734 int curlen; /* length of current code */
744 curlen = nextlen; nextlen = tree[n + 1].Len;
745 if (++count < max_count && curlen == nextlen) {
748 s->bl_tree[curlen].Freq += count;
749 } else if (curlen != 0) {
750 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
757 count = 0; prevlen = curlen;
760 } else if (curlen == nextlen) {
776 int curlen; /* length of current code */
786 curlen = nextlen; nextlen = tree[n + 1].Len;
787 if (++count < max_count && curlen == nextlen) {
790 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
792 } else if (curlen != 0) {
793 if (curlen != prevlen) {
794 send_code(s, curlen, s->bl_tree); count--;
805 count = 0; prevlen = curlen;
808 } else if (curlen == nextlen) {