Lines Matching refs:curlen
417 int curlen; /* length of current code */ in scan_tree() local
429 curlen = nextlen; in scan_tree()
431 if (++count < max_count && curlen == nextlen) { in scan_tree()
434 s->bl_tree[curlen].Freq += count; in scan_tree()
435 } else if (curlen != 0) { in scan_tree()
436 if (curlen != prevlen) in scan_tree()
437 s->bl_tree[curlen].Freq++; in scan_tree()
445 prevlen = curlen; in scan_tree()
448 } else if (curlen == nextlen) { in scan_tree()
465 int curlen; /* length of current code */ in send_tree() local
480 curlen = nextlen; in send_tree()
482 if (++count < max_count && curlen == nextlen) { in send_tree()
486 send_code(s, curlen, s->bl_tree, bi_buf, bi_valid); in send_tree()
489 } else if (curlen != 0) { in send_tree()
490 if (curlen != prevlen) { in send_tree()
491 send_code(s, curlen, s->bl_tree, bi_buf, bi_valid); in send_tree()
507 prevlen = curlen; in send_tree()
510 } else if (curlen == nextlen) { in send_tree()