Lines Matching defs:curlen
580 int curlen; /* length of current code */
590 curlen = nextlen; nextlen = tree[n+1].Len;
591 if (++count < max_count && curlen == nextlen) {
594 s->bl_tree[curlen].Freq += count;
595 } else if (curlen != 0) {
596 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
603 count = 0; prevlen = curlen;
606 } else if (curlen == nextlen) {
626 int curlen; /* length of current code */
636 curlen = nextlen; nextlen = tree[n+1].Len;
637 if (++count < max_count && curlen == nextlen) {
640 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
642 } else if (curlen != 0) {
643 if (curlen != prevlen) {
644 send_code(s, curlen, s->bl_tree); count--;
655 count = 0; prevlen = curlen;
658 } else if (curlen == nextlen) {