search for: phitmp

...; [#uses=1] %3 = add i32 %2, %sum.04 ; <i32> [#uses=2] %4 = getelementptr %struct.node2* %list2_addr.05, i32 0, i32 0 ; <%struct.node2**> [#uses=1] %5 = load %struct.node2** %4, align 4 ; <%struct.node2*> [#uses=2] %phitmp = icmp eq %struct.node2* %5, null ; <i1> [#uses=1] br i1 %phitmp, label %bb2, label %bb bb2: ; preds = %bb, %entry %sum.0.lcssa = phi i32 [ 0, %entry ], [ %3, %bb ] ; <i32> [#uses=1] ret i32 %sum.0.lcssa } -----------------...

...label %bb5.loopexit, label %bb3 bb5.loopexit: ; preds = %bb3 %tmp14 = add i32 %parami, 1 ; <i32> [#uses=1] %tmp15 = mul i32 %indvar, %tmp14 ; <i32> [#uses=1] %varx.111 = add i32 %tmp15, %varx.110 ; <i32> [#uses=1] %4 = add i32 %varx.111, %parami ; <i32> [#uses=1] %phitmp = add i32 %4, 1 ; <i32> [#uses=1] br label %bb5 bb5: ; preds = %bb5.loopexit, %entry %varx.1.lcssa = phi i32 [ %varx.110, %entry ], [ %phitmp, %bb5.loopexit ] ; <i32> [#uses=1] %5 = add i32 %paraml, 5 ; <i32> [#uses=1] %6 = add i32 %5, %varx.1.lcssa ; <i32> [#uses=...

...ol3, %tobool24 ; <i1> [#uses=1] br i1 %or.cond5, label %bb.nph, label %whileexit bb.nph: ; preds = %entry br i1 %tobool24, label %whilebody.us, label %whilebody whilebody.us: ; preds = %whilebody.us, %bb.nph ...code here... br i1 %phitmp, label %whilebody.us, label %whileexit whilebody: ; preds = %bb.nph ...code here... br label %whileexit whileexit: ; preds = %whilebody, %whilebody.us, %entry %z.0.lcssa = phi float [ 0.000000e+000, %entry ], [ %add, %whilebody ], [ %add.us, %whi...

...br i1 %or.cond5, label %bb.nph, label %whileexit > > > > bb.nph: ; preds = %entry > > br i1 %tobool24, label %whilebody.us, label %whilebody > > > > whilebody.us: ; preds = %whilebody.us, %bb.nph > > …code here… > > br i1 %phitmp, label %whilebody.us, label %whileexit > > > > whilebody: ; preds = %bb.nph > > …code here… > > br label %whileexit > > > > whileexit: ; preds = %whilebody, %whilebody.us, %entry > > %z.0.lcssa = phi float [ 0.00000...

...] %r_icmpsgt = icmp sgt i32 %r_srem10, 10 ; <i1> [#uses=1] br i1 %r_icmpsgt, label %then11, label %endif.endif15_crit_edge endif.endif15_crit_edge: ; preds = %endif br label %endif15 then11: ; preds = %endif %phitmp = sitofp i32 %r_srem10 to double ; <double> [#uses=1] br label %endif15 endif15: ; preds = %endif.endif15_crit_edge, %then11 %storemerge26 = phi double [ %phitmp, %then11 ], [ 1.000000e+01, %endif.endif15_crit_edge ] ; <double> [#uses...

On Thu, Jul 6, 2017 at 7:00 AM, Davide Italiano <davide at freebsd.org> wrote: > On Wed, Jul 5, 2017 at 3:59 PM, Johan Engelen via llvm-dev > <llvm-dev at lists.llvm.org> wrote: > > Hi all, > > I just found an optimization regression regarding simple > > dataflow/constprop analysis: > > https://godbolt.org/g/Uz8P7t > > > > This code >

...em10, 10 ; <i1> [#uses=1] > br i1 %r_icmpsgt, label %then11, label %endif.endif15_crit_edge > > endif.endif15_crit_edge: ; preds = %endif > br label %endif15 > > then11: ; preds = %endif > %phitmp = sitofp i32 %r_srem10 to double ; <double> [#uses=1] > br label %endif15 > > endif15: ; preds = %endif.endif15_crit_edge, %then11 > %storemerge26 = phi double [ %phitmp, %then11 ], [ 1.000000e+01, %endif.endif15_crit_edge ] ; &...

----- Original Message ----- > From: "Chandler Carruth" <chandlerc at google.com> > To: "Zinovy Nis" <zinovy.nis at gmail.com> > Cc: "Hal Finkel" <hfinkel at anl.gov>, "James Molloy" <james at jamesmolloy.co.uk>, "LLVM Developers Mailing List" > <llvmdev at cs.uiuc.edu> > Sent: Thursday, October 16, 2014

...eep between how aggressive SimplifyCFG gets VS what other passes > should/could do. > > Without the last commit you have, after SimplifyCFG: > > define i32 @dataflow(i32 %b) local_unnamed_addr #0 { > entry: > %cmp = icmp eq i32 %b, 4 > %mul = mul nsw i32 %b, 3 > %phitmp = icmp eq i32 %mul, 4 > %a.0 = select i1 %cmp, i1 %phitmp, i1 false > %. = select i1 %a.0, i32 0, i32 1 > ret i32 %. > } > > but just before: > > define i32 @dataflow(i32 %b) local_unnamed_addr #0 { > entry: > %cmp = icmp eq i32 %b, 4 > br i1 %cmp, la...

Hi, My pass heavily relies on llvm::Loop's getSmallConstantTripCount method. However, I found that it doesn't work for some simple cases. In the following example, I can get the constant trip count of the outermost loop if statement "a[l] = a[l] + 1" is there. After commenting out this line, the returned constant trip count for that loop is 0. In my pass, I traverse the nested

...%12 = load i16* %incdec.ptr.7.i.i, align 2, !tbaa !5 %not.cmp5.8.i.i = icmp eq i16 %12, 0 br i1 %not.cmp5.8.i.i, label %if.end.i, label %eisneg.exit if.end.i: ; preds = %if.end, %eisnan.exit.i %.pre = phi i16 [ 0, %eisnan.exit.i ], [ %4, %if.end ] %phitmp = icmp sgt i16 %3, -1 br label %eisneg.exit eisneg.exit: ; preds = %eisnan.exit.i, %for.inc.6.i.i, %for.inc.5.i.i, %for.inc.4.i.i, %for.inc.3.i.i, %for.inc.2.i.i, %for.inc.1.i.i, %for.inc.i.i, %for.cond.preheader.i.i, %if.end.i %13 = phi i16 [ %.pre, %if.en...