418     int nextlen = tree[0].Len; /* length of next code */  in scan_tree()  local
423     if (nextlen == 0)  in scan_tree()
429         curlen = nextlen;  in scan_tree()
430         nextlen = tree[n+1].Len;  in scan_tree()
431         if (++count < max_count && curlen == nextlen) {  in scan_tree()
446         if (nextlen == 0) {  in scan_tree()
448         } else if (curlen == nextlen) {  in scan_tree()
466     int nextlen = tree[0].Len; /* length of next code */  in send_tree()  local
472     if (nextlen == 0)  in send_tree()
480         curlen = nextlen;  in send_tree()
481         nextlen = tree[n+1].Len;  in send_tree()
482         if (++count < max_count && curlen == nextlen) {  in send_tree()
508         if (nextlen == 0) {  in send_tree()
510         } else if (curlen == nextlen) {  in send_tree()