commit | b10837d169180082d4114685838db57ffa26f78d | [log] [tgz] |
---|---|---|
author | Mark Heffernan <meheff@google.com> | Mon Dec 15 21:19:53 2014 +0000 |
committer | Mark Heffernan <meheff@google.com> | Mon Dec 15 21:19:53 2014 +0000 |
tree | fe175fd845b501e57465b1d3b380da121b87e4d4 | |
parent | 1eb5ad1ecda739264a8f383ff65c20f6e259c466 [diff] |
Clarify HowFarToZero computation when the step is a positive power of two. Functionally this should be identical to the existing code except for the case where Step is maximally negative (eg, INT_MIN). We now punt in that one corner case to make reasoning about the code easier. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@224274 91177308-0d34-0410-b5e6-96231b3b80d8