[SCEV] Bound the max BE count by the range of End - Start. (#222752)
In same cases, like A < A + N, End - Start can give a tighter maximum
bound due to folding that gets missed when just subtracting the ranges.
This improves results in a few cases:
https://github.com/dtcxzyw/llvm-opt-benchmark-nightly/pull/1256.
Found while working on unifying howManyLessThans & howManyGreaterThans.
The latter uses a hand-rolled variant of computeMaxBECountForLT for GT,
which computes the delta like that.
Compile-time increase is in the noise
https://llvm-compile-time-tracker.com/compare.php?from=28f36e6d3912e3f9c50fbf57113f84cd336b7862&to=dfbe4dec46620effd87fe913b26b2f656f4b2750&stat=instructions:u
PR: https://github.com/llvm/llvm-project/pull/222752