755     int nextlen = tree[0].Len; /* length of next code */  in scan_tree()  local
760     if (nextlen == 0) {  in scan_tree()
767         curlen = nextlen; nextlen = tree[n+1].Len;  in scan_tree()
768         if (++count < max_count && curlen == nextlen) {  in scan_tree()
781         if (nextlen == 0) {  in scan_tree()
784         } else if (curlen == nextlen) {  in scan_tree()
807     int nextlen = tree[0].Len; /* length of next code */  in send_tree()  local
813     if (nextlen == 0) {  in send_tree()
819         curlen = nextlen; nextlen = tree[n+1].Len;  in send_tree()
820         if (++count < max_count && curlen == nextlen) {  in send_tree()
839         if (nextlen == 0) {  in send_tree()
842         } else if (curlen == nextlen) {  in send_tree()