636     int count = 0;             /* repeat count of the current code */  in scan_tree()  local
645         if (++count < max_count && curlen == nextlen) {  in scan_tree()
647         } else if (count < min_count) {  in scan_tree()
648             s->bl_tree[curlen].Freq += count;  in scan_tree()
652         } else if (count <= 10) {  in scan_tree()
657         count = 0; prevlen = curlen;  in scan_tree()
682     int count = 0;             /* repeat count of the current code */  in send_tree()  local
691         if (++count < max_count && curlen == nextlen) {  in send_tree()
693         } else if (count < min_count) {  in send_tree()
694             do { send_code(s, curlen, s->bl_tree); } while (--count != 0);  in send_tree()
698                 send_code(s, curlen, s->bl_tree); count--;  in send_tree()
700             Assert(count >= 3 && count <= 6, " 3_6?");  in send_tree()
701             send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);  in send_tree()
703         } else if (count <= 10) {  in send_tree()
704             send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);  in send_tree()
707             send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);  in send_tree()
709         count = 0; prevlen = curlen;  in send_tree()