714     int nextlen = tree[0].Len; /* length of next code */  in scan_tree()  local
719     if (nextlen == 0) max_count = 138, min_count = 3;  in scan_tree()
723         curlen = nextlen; nextlen = tree[n + 1].Len;  in scan_tree()
724         if (++count < max_count && curlen == nextlen) {  in scan_tree()
737         if (nextlen == 0) {  in scan_tree()
739         } else if (curlen == nextlen) {  in scan_tree()
755     int nextlen = tree[0].Len; /* length of next code */  in send_tree()  local
761     if (nextlen == 0) max_count = 138, min_count = 3;  in send_tree()
764         curlen = nextlen; nextlen = tree[n + 1].Len;  in send_tree()
765         if (++count < max_count && curlen == nextlen) {  in send_tree()
784         if (nextlen == 0) {  in send_tree()
786         } else if (curlen == nextlen) {  in send_tree()