1347         const Py_ssize_t maxofs = n - hint;             /* &a[n-1] is highest */  in gallop_left()  local
1348         while (ofs < maxofs) {  in gallop_left()
1357         if (ofs > maxofs)  in gallop_left()
1358             ofs = maxofs;  in gallop_left()
1367         const Py_ssize_t maxofs = hint + 1;             /* &a[0] is lowest */  in gallop_left()  local
1368         while (ofs < maxofs) {  in gallop_left()
1376         if (ofs > maxofs)  in gallop_left()
1377             ofs = maxofs;  in gallop_left()
1436         const Py_ssize_t maxofs = hint + 1;             /* &a[0] is lowest */  in gallop_right()  local
1437         while (ofs < maxofs) {  in gallop_right()
1446         if (ofs > maxofs)  in gallop_right()
1447             ofs = maxofs;  in gallop_right()
1457         const Py_ssize_t maxofs = n - hint;             /* &a[n-1] is highest */  in gallop_right()  local
1458         while (ofs < maxofs) {  in gallop_right()
1466         if (ofs > maxofs)  in gallop_right()
1467             ofs = maxofs;  in gallop_right()