llvm dev - May 2011 - [LLVMdev] Loop-Unroll optimization

Hi,
> The loop that I am trying it on is:
> for(i=0; i< 1000; i++)
> {
> c[i] = a[i] + b[i];
> }
I can't find any benefit unrolling this loop.

------------------
Yuan Pengfei
Peking Unversity, China

I just want to try loop-unroll and see corresponding changes in the bitcode
file. For that any loop will do. Have you been able to test llvm loop-unroll
successfully?

On Mon, May 2, 2011 at 10:04 PM, Yuan Pengfei <coolypf at qq.com> wrote:
> Hi,
>
> > The loop that I am trying it on is:
> > for(i=0; i< 1000; i++)
> > {
> > c[i] = a[i] + b[i];
> > }
>
> I can't find any benefit unrolling this loop.
>
> ------------------
> Yuan Pengfei
> Peking Unversity, China
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://lists.llvm.org/pipermail/llvm-dev/attachments/20110502/8419c331/attachment.html>

Hi, you need to run some optimization passes first. (like -O2)

2011/5/3 Manish Gupta <mgupta.iitr at gmail.com>
> I just want to try loop-unroll and see corresponding changes in the bitcode
> file. For that any loop will do. Have you been able to test llvm
loop-unroll
> successfully?
>
>
> On Mon, May 2, 2011 at 10:04 PM, Yuan Pengfei <coolypf at qq.com>
wrote:
>
>> Hi,
>>
>> > The loop that I am trying it on is:
>> > for(i=0; i< 1000; i++)
>> > {
>> > c[i] = a[i] + b[i];
>> > }
>>
>> I can't find any benefit unrolling this loop.
>>
>> ------------------
>> Yuan Pengfei
>> Peking Unversity, China
>
>
>
> _______________________________________________
> LLVM Developers mailing list
> LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev
>
>

-- 
Best regards,
Kuan-Hsu
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://lists.llvm.org/pipermail/llvm-dev/attachments/20110503/95b6bc89/attachment.html>