Displaying 4 results from an estimated 4 matches for "pr12110".
Did you mean:
pr1210
2012 Mar 07
2
[LLVMdev] How to unroll loop with non-constant boundary
.../llvmdev
>
> _______________________________________________
> LLVM Developers mailing list
> LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev
-------------- next part --------------
A non-text attachment was scrubbed...
Name: pr12110.patch
Type: application/octet-stream
Size: 5358 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120307/61ebd16b/attachment.obj>
2012 Feb 27
2
[LLVMdev] How to unroll loop with non-constant boundary
Hi Benjamin,
> LLVM misses this optimization because ScalarEvolution's ComputeExitLimitFromICmp doesn't handle signed<= (SLE) and thus can't compute the number of times the loop is executed. I wonder if there's a reason for this, it seems like something simple to add.
instsimplify could also be enhanced to clean it up in this particular case, but
it would be better to make
2012 Feb 28
0
[LLVMdev] How to unroll loop with non-constant boundary
On 27.02.2012, at 20:17, Duncan Sands wrote:
> Hi Benjamin,
>
>> LLVM misses this optimization because ScalarEvolution's ComputeExitLimitFromICmp doesn't handle signed<= (SLE) and thus can't compute the number of times the loop is executed. I wonder if there's a reason for this, it seems like something simple to add.
>
> instsimplify could also be enhanced
2012 Mar 07
0
[LLVMdev] How to unroll loop with non-constant boundary
Stepan Dyatkovskiy wrote:
> Hi guys,
> I attached the modified patch that handles cases with low==end and stride!=1.
I don't see how this could be correct. Your patch treats 'X s<= Y' as 'X
s< Y+1', which is incorrect when Y is INT_MAX. Wouldn't that turn an
infinite loop into a zero-trip loop?
To be clear, this is the flaw in Benjamin's patch which you