projects / platform / upstream / llvm.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 4a46429) | patch
Clarify HowFarToZero computation when the step is a positive power of two. Functiona...
authorMark Heffernan <meheff@google.com>
Mon, 15 Dec 2014 21:19:53 +0000 (21:19 +0000)
committerMark Heffernan <meheff@google.com>
Mon, 15 Dec 2014 21:19:53 +0000 (21:19 +0000)
commitacbed5e5307a23250f9cea16138c9b3b23eba751
tree1c95f8ba52ea5c73d853c489f3410eefbf891bdetree | snapshot
parent4a46429305a54d4133d02a6f819f5a9fcf9bf152commit | 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.

llvm-svn: 224274
llvm/lib/Analysis/ScalarEvolution.cpp diff | blob | history
Domain: System / Toolchain;