search for: zakk0610

On Oct 15, 2013, at 9:28 PM, Zakk <zakk0610 at gmail.com> wrote: > Hi Andy, thanks for your help!! > The scheduled code by method A is same as B when using the new machine model. > it's make sense, but there is the another problem, the scheduled code is badly. > > load/store instruction always reuse the same register...

...B0_1 bx lr this is just because A9's per-operand machine model is not implemented well? By the way, why do you want to use the new machine model for mi-sched? Thanks, Kind regards Kuan-Hsu 2013/10/15 Andrew Trick <atrick at apple.com> > > On Oct 14, 2013, at 3:27 AM, Zakk <zakk0610 at gmail.com> wrote: > > Hi all, > I meet this problem when compiling the TREAM benchmark ( > http://www.cs.virginia.edu/stream/FTP/Code/) with enable-misched > > The small function will be scheduled as good code, but if opt inline this > function, the inline part will be sc...

...1>; def WB: ProcResource<1>; } def : WriteRes<WriteALU, [IF, ID, EX1, WB]> ; or define each stage as SchedWrite type and use WriteSequence to define this sequence? Thanks, Kuan-Hsu 2013/10/16 Andrew Trick <atrick at apple.com> > > On Oct 15, 2013, at 9:28 PM, Zakk <zakk0610 at gmail.com> wrote: > > Hi Andy, thanks for your help!! > The scheduled code by method A is same as B when using the new machine > model. > it's make sense, but there is the another problem, the scheduled code is > badly. > > load/store instruction always reuse the s...

You mean like *llvm-gcc-4.2 -O2 -emit-llvm Hello.c -c -o Hello.bc* But still i am not able to observe any effect on bit code by running *opt-2.8 -loop-unroll Hello.bc -o Hello_unroll.bc* On Tue, May 3, 2011 at 3:58 AM, Zakk <zakk0610 at gmail.com> wrote: > 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...

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: >

...r at gmail.com> wrote: > You mean like > > *llvm-gcc-4.2 -O2 -emit-llvm Hello.c -c -o Hello.bc* > > But still i am not able to observe any effect on bit code by running > > *opt-2.8 -loop-unroll Hello.bc -o Hello_unroll.bc* > > On Tue, May 3, 2011 at 3:58 AM, Zakk <zakk0610 at gmail.com> wrote: > >> 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...

> On Jan 6, 2020, at 14:29, David Blaikie via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > > > On Mon, Jan 6, 2020 at 5:58 AM Zakk <zakk0610 at gmail.com <mailto:zakk0610 at gmail.com>> wrote: > > > David Blaikie <dblaikie at gmail.com <mailto:dblaikie at gmail.com>> 於 2020年1月6日 週一 下午2:23寫道： > If this is something that can vary per file in a compilation and resolve correctly when one object file is bui...

David Blaikie <dblaikie at gmail.com> 於 2020年1月6日 週一 下午2:23寫道： > If this is something that can vary per file in a compilation and resolve > correctly when one object file is built with one ABI and another object > file is built with a different ABI (that seems to be antithetical to the > concept of "ABI" Though) - then it should be a subtarget feature. > > ABI is

...as: tmp_var = foo(a,b,c); dumpInfo(...) for (int i=0; i<tmp_var; i++) { ... tmp_var=foo(a,b,c); } This looks quite complicated! Does anyone has any ideal about how easy to insert some basic blocks and to rewrite the loop header in LLVM? Cheers, Zheng On 6 April 2010 17:27, Zakk <zakk0610 at gmail.com> wrote: > Hi, you should run some loop transformation passes(loop rotate, loop > simplify, -indvar), and then get TripCount. > loopinfo.h > /// getTripCount - Return a loop-invariant LLVM value indicating the number > of > /// times the loop will be executed. Note...

...You mean like >> >> *llvm-gcc-4.2 -O2 -emit-llvm Hello.c -c -o Hello.bc* >> >> But still i am not able to observe any effect on bit code by running >> >> *opt-2.8 -loop-unroll Hello.bc -o Hello_unroll.bc* >> >> On Tue, May 3, 2011 at 3:58 AM, Zakk <zakk0610 at gmail.com> wrote: >> >>> 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 >>&gt...

...gt;> *llvm-gcc-4.2 -O2 -emit-llvm Hello.c -c -o Hello.bc* >>> >>> But still i am not able to observe any effect on bit code by running >>> >>> *opt-2.8 -loop-unroll Hello.bc -o Hello_unroll.bc* >>> >>> On Tue, May 3, 2011 at 3:58 AM, Zakk <zakk0610 at gmail.com> wrote: >>> >>>> 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 ch...

On Oct 14, 2013, at 3:27 AM, Zakk <zakk0610 at gmail.com> wrote: > Hi all, > I meet this problem when compiling the TREAM benchmark (http://www.cs.virginia.edu/stream/FTP/Code/) with enable-misched > > The small function will be scheduled as good code, but if opt inline this function, the inline part will be scheduled as ba...

David Blaikie <dblaikie at gmail.com> 於 2020年1月14日 週二 上午2:15寫道： > > > On Mon, Jan 13, 2020 at 6:12 AM Zakk <zakk0610 at gmail.com> wrote: > >> >> >> David Blaikie via llvm-dev <llvm-dev at lists.llvm.org> 於 2020年1月11日 週六 >> 上午2:03寫道： >> >>> Ah, OK - thanks for walking me through that. >>> >>> Fair enough, I think I understand the issue/tradeoff...

...p; yeah, if it paves the way for (2) that's fine by me (pending other people who have more context than I do about any of this). Thanks for summarizing/looping back here! - Dave > > I welcome feedback on this plan. > > Sam > > > > On 15 Jan 2020, at 9:37 am, Zakk <zakk0610 at gmail.com> wrote: > > > > > > > > David Blaikie <dblaikie at gmail.com> 於 2020年1月14日 週二 上午2:15寫道： > > > > > > On Mon, Jan 13, 2020 at 6:12 AM Zakk <zakk0610 at gmail.com> wrote: > > > > > > David Blaikie via llvm-dev <...

Hi all, I meet this problem when compiling the TREAM benchmark ( http://www.cs.virginia.edu/stream/FTP/Code/) with enable-misched The small function will be scheduled as good code, but if opt inline this function, the inline part will be scheduled as bad code. so I rewrite a simple code as attached link (foo.c), and compiled with two different methods: *method A:* *$clang -O3 foo.c -static -S

...t;> about any of this). >> >> Thanks for summarizing/looping back here! >> >> - Dave >> >> >>> >>> I welcome feedback on this plan. >>> >>> Sam >>> >>> >>> > On 15 Jan 2020, at 9:37 am, Zakk <zakk0610 at gmail.com> wrote: >>> > >>> > >>> > >>> > David Blaikie <dblaikie at gmail.com> 於 2020年1月14日 週二 上午2:15寫道： >>> > >>> > >>> > On Mon, Jan 13, 2020 at 6:12 AM Zakk <zakk0610 at gmail.com> wrote: >&...

Thanks for all replies, they have been very helpful! Note: Sorry, i forgot to group reply.... ---------- Forwarded message ---------- From: Duncan Sands <baldrick at free.fr> Date: 2011/9/4 Subject: Re: [LLVMdev] Some questions on SelectionDAG To: Zakk <zakk0610 at gmail.com> Hi Zak, Therefore, after the LegalizeType phase, maybe SelectionDAG have > unsupported > type node? > no. As I tried to explain, there is no node with type MVT:i1 after type legalization. There is a VALUETYPE node with type MVT::Other that contains the type MVT::i1...

...le.com <mailto:daniel_l_sanders at apple.com>> wrote: > > >> On Jan 6, 2020, at 14:29, David Blaikie via llvm-dev <llvm-dev at lists.llvm.org <mailto:llvm-dev at lists.llvm.org>> wrote: >> >> >> >> On Mon, Jan 6, 2020 at 5:58 AM Zakk <zakk0610 at gmail.com <mailto:zakk0610 at gmail.com>> wrote: >> >> >> David Blaikie <dblaikie at gmail.com <mailto:dblaikie at gmail.com>> 於 2020年1月6日 週一 下午2:23寫道： >> If this is something that can vary per file in a compilation and resolve correctly when one ob...

...; i++) > { >   ... >    tmp_var=foo(a,b,c); > } > > This looks quite complicated! > > Does anyone has any ideal about how easy to insert some basic blocks > and to rewrite the loop header in LLVM? > > Cheers, > Zheng > > > On 6 April 2010 17:27, Zakk <zakk0610 at gmail.com> wrote: >> Hi, you should run some loop transformation passes(loop rotate, loop >> simplify, -indvar), and then get TripCount. >> loopinfo.h >> /// getTripCount - Return a loop-invariant LLVM value indicating the number >> of >> /// times the loop...

...; wrote: >> >> >> >> >> >>> On Jan 6, 2020, at 14:29, David Blaikie via llvm-dev < >> llvm-dev at lists.llvm.org> wrote: >> >>> >> >>> >> >>> >> >>> On Mon, Jan 6, 2020 at 5:58 AM Zakk <zakk0610 at gmail.com> wrote: >> >>> >> >>> >> >>> David Blaikie <dblaikie at gmail.com> 於 2020年1月6日 週一 下午2:23寫道： >> >>> If this is something that can vary per file in a compilation and >> resolve correctly when one object file is bu...