search for: coolypf

Displaying 7 results from an estimated 7 matches for "coolypf".

2011 May 03
2
[LLVMdev] Loop-Unroll optimization
...1/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. >> >> ---------...
2011 May 03
2
[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
2011 May 03
0
[LLVMdev] Loop-Unroll optimization
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 Unversit...
2011 May 03
0
[LLVMdev] Loop-Unroll optimization
...a.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 unrollin...
2011 May 03
3
[LLVMdev] Loop-Unroll optimization
...> >>> 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]; >>>> > } >>>> >>>&g...
2011 May 03
0
[LLVMdev] Loop-Unroll optimization
...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]; >>>>> > }...
2011 May 04
1
[LLVMdev] Loop-Unroll optimization
...p-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];...