754     int curlen;                /* length of current code */  in scan_tree()  local
767         curlen = nextlen; nextlen = tree[n+1].Len;  in scan_tree()
768         if (++count < max_count && curlen == nextlen) {  in scan_tree()
771             s->bl_tree[curlen].Freq += count;  in scan_tree()
772         } else if (curlen != 0) {  in scan_tree()
773             if (curlen != prevlen) s->bl_tree[curlen].Freq++;  in scan_tree()
780         count = 0; prevlen = curlen;  in scan_tree()
784         } else if (curlen == nextlen) {  in scan_tree()
806     int curlen;                /* length of current code */  in send_tree()  local
819         curlen = nextlen; nextlen = tree[n+1].Len;  in send_tree()
820         if (++count < max_count && curlen == nextlen) {  in send_tree()
823             do { send_code(s, curlen, s->bl_tree); } while (--count != 0);  in send_tree()
825         } else if (curlen != 0) {  in send_tree()
826             if (curlen != prevlen) {  in send_tree()
827                 send_code(s, curlen, s->bl_tree); count--;  in send_tree()
838         count = 0; prevlen = curlen;  in send_tree()
842         } else if (curlen == nextlen) {  in send_tree()