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