634     int curlen;                /* length of current code */  in scan_tree()  local
644         curlen = nextlen; nextlen = tree[n+1].Len;  in scan_tree()
645         if (++count < max_count && curlen == nextlen) {  in scan_tree()
648             s->bl_tree[curlen].Freq += count;  in scan_tree()
649         } else if (curlen != 0) {  in scan_tree()
650             if (curlen != prevlen) s->bl_tree[curlen].Freq++;  in scan_tree()
657         count = 0; prevlen = curlen;  in scan_tree()
660         } else if (curlen == nextlen) {  in scan_tree()
680     int curlen;                /* length of current code */  in send_tree()  local
690         curlen = nextlen; nextlen = tree[n+1].Len;  in send_tree()
691         if (++count < max_count && curlen == nextlen) {  in send_tree()
694             do { send_code(s, curlen, s->bl_tree); } while (--count != 0);  in send_tree()
696         } else if (curlen != 0) {  in send_tree()
697             if (curlen != prevlen) {  in send_tree()
698                 send_code(s, curlen, s->bl_tree); count--;  in send_tree()
709         count = 0; prevlen = curlen;  in send_tree()
712         } else if (curlen == nextlen) {  in send_tree()