Displaying 2 results from an estimated 2 matches for "backedgetakeninfo".
2010 May 06
2
[LLVMdev] Back-edge taken count of loops
...t; will try to convert other conditions to the
conditions listed above, by doing something like "i <= n" to "i < n+1", but
it refuse to do that unless it could prove "n + 1" will not cause a
overflow.
So, could us just set "n + 1" to the Exact field of BackedgeTakenInfo, and
set something like SCEVInfinite to the Max field of BackedgeTakenInfo?
thanks
ether
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20100506/af11583b/attachment.html>
2010 May 06
0
[LLVMdev] Back-edge taken count of loops
...y to convert other conditions to the conditions listed above, by doing something like "i <= n" to "i < n+1", but it refuse to do that unless it could prove "n + 1" will not cause a overflow.
>
> So, could us just set "n + 1" to the Exact field of BackedgeTakenInfo, and set something like SCEVInfinite to the Max field of BackedgeTakenInfo?
>
> thanks
> ether
> _______________________________________________
> LLVM Developers mailing list
> LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo...