search for: foo_int

...ent optimizer. So I cannot run my pass just after LoopRotate and before InstCombine. I can still use ScalarEvolution, but the instruction combiner can in some cases simplify the entry guard condition. A small example is the following: ///////////////////////////////////// extern void x(int); int foo_int(int a, int b) { int i; for (i = 0; i < b/2; ++i) { x(i); } return 0; } ///////////////////////////////////// the correspondent optimized IR is: /////////////////////////////////////////////////////////////////////////////// define i32 @foo_int(i32 %a, i32 %b) nounwind uwtable { en...

On Feb 4, 2013, at 10:48 AM, Michele Scandale <michele.scandale at gmail.com> wrote: > Dear all, > > I'm working on a late IR target dependent optimization on loops. A part of this > optimization requires to derive "by hand" the trip-count expression of a given > loop. In order to handle correctly these cases I need to check if the loop has > an entry guard

...fter LoopRotate and before InstCombine. > I can still use ScalarEvolution, but the instruction combiner can in some cases > simplify the entry guard condition. > > A small example is the following: > > ///////////////////////////////////// > extern void x(int); > > int foo_int(int a, int b) { > int i; > for (i = 0; i < b/2; ++i) { > x(i); > } > > return 0; > } > ///////////////////////////////////// > > the correspondent optimized IR is: > > /////////////////////////////////////////////////////////////////////////////// &g...

Dear all, I'm working on a late IR target dependent optimization on loops. A part of this optimization requires to derive "by hand" the trip-count expression of a given loop. In order to handle correctly these cases I need to check if the loop has an entry guard or not. The problem I have is that starting from the information I derive during my analysis (initial IV value, last IV