713     int curlen;                /* length of current code */  in scan_tree()  local
723         curlen = nextlen; nextlen = tree[n + 1].Len;  in scan_tree()
724         if (++count < max_count && curlen == nextlen) {  in scan_tree()
727             s->bl_tree[curlen].Freq += count;  in scan_tree()
728         } else if (curlen != 0) {  in scan_tree()
729             if (curlen != prevlen) s->bl_tree[curlen].Freq++;  in scan_tree()
736         count = 0; prevlen = curlen;  in scan_tree()
739         } else if (curlen == nextlen) {  in scan_tree()
754     int curlen;                /* length of current code */  in send_tree()  local
764         curlen = nextlen; nextlen = tree[n + 1].Len;  in send_tree()
765         if (++count < max_count && curlen == nextlen) {  in send_tree()
768             do { send_code(s, curlen, s->bl_tree); } while (--count != 0);  in send_tree()
770         } else if (curlen != 0) {  in send_tree()
771             if (curlen != prevlen) {  in send_tree()
772                 send_code(s, curlen, s->bl_tree); count--;  in send_tree()
783         count = 0; prevlen = curlen;  in send_tree()
786         } else if (curlen == nextlen) {  in send_tree()