Lines Matching refs:curlen
741 int curlen; /* length of current code */
751 curlen = nextlen; nextlen = tree[n+1].Len;
752 if (++count < max_count && curlen == nextlen) {
755 s->bl_tree[curlen].Freq += count;
756 } else if (curlen != 0) {
757 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
764 count = 0; prevlen = curlen;
767 } else if (curlen == nextlen) {
786 int curlen; /* length of current code */
796 curlen = nextlen; nextlen = tree[n+1].Len;
797 if (++count < max_count && curlen == nextlen) {
800 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
802 } else if (curlen != 0) {
803 if (curlen != prevlen) {
804 send_code(s, curlen, s->bl_tree); count--;
815 count = 0; prevlen = curlen;
818 } else if (curlen == nextlen) {