1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py 2; RUN: opt -O1 -S < %s | FileCheck %s --check-prefix=OLDPM 3; RUN: opt -passes='default<O1>' -S < %s | FileCheck %s --check-prefix=NEWPM 4 5; Don't simplify unconditional branches from empty blocks in simplifyCFG 6; until late in the pipeline because it can destroy canonical loop structure. 7 8; FIXME: The new pass manager is not limiting simplifycfg at any point in the pipeline, 9; so it performs a transformation before loop optimizations that is avoided in the old PM. 10 11define i1 @PR33605(i32 %a, i32 %b, i32* %c) { 12; OLDPM-LABEL: @PR33605( 13; OLDPM-NEXT: for.body: 14; OLDPM-NEXT: [[OR:%.*]] = or i32 [[B:%.*]], [[A:%.*]] 15; OLDPM-NEXT: [[ARRAYIDX:%.*]] = getelementptr inbounds i32, i32* [[C:%.*]], i64 1 16; OLDPM-NEXT: [[TMP0:%.*]] = load i32, i32* [[ARRAYIDX]], align 4 17; OLDPM-NEXT: [[CMP:%.*]] = icmp eq i32 [[OR]], [[TMP0]] 18; OLDPM-NEXT: br i1 [[CMP]], label [[IF_END:%.*]], label [[IF_THEN:%.*]] 19; OLDPM: if.then: 20; OLDPM-NEXT: store i32 [[OR]], i32* [[ARRAYIDX]], align 4 21; OLDPM-NEXT: tail call void @foo() 22; OLDPM-NEXT: br label [[IF_END]] 23; OLDPM: if.end: 24; OLDPM-NEXT: [[CHANGED_1_OFF0:%.*]] = phi i1 [ true, [[IF_THEN]] ], [ false, [[FOR_BODY:%.*]] ] 25; OLDPM-NEXT: [[TMP1:%.*]] = load i32, i32* [[C]], align 4 26; OLDPM-NEXT: [[CMP_1:%.*]] = icmp eq i32 [[OR]], [[TMP1]] 27; OLDPM-NEXT: br i1 [[CMP_1]], label [[IF_END_1:%.*]], label [[IF_THEN_1:%.*]] 28; OLDPM: if.then.1: 29; OLDPM-NEXT: store i32 [[OR]], i32* [[C]], align 4 30; OLDPM-NEXT: tail call void @foo() 31; OLDPM-NEXT: br label [[IF_END_1]] 32; OLDPM: if.end.1: 33; OLDPM-NEXT: [[CHANGED_1_OFF0_1:%.*]] = phi i1 [ true, [[IF_THEN_1]] ], [ [[CHANGED_1_OFF0]], [[IF_END]] ] 34; OLDPM-NEXT: ret i1 [[CHANGED_1_OFF0_1]] 35; 36; NEWPM-LABEL: @PR33605( 37; NEWPM-NEXT: entry: 38; NEWPM-NEXT: [[OR:%.*]] = or i32 [[B:%.*]], [[A:%.*]] 39; NEWPM-NEXT: br label [[FOR_COND_OUTER:%.*]] 40; NEWPM: for.cond.outer: 41; NEWPM-NEXT: [[I_0_PH:%.*]] = phi i32 [ [[DEC:%.*]], [[IF_THEN:%.*]] ], [ 2, [[ENTRY:%.*]] ] 42; NEWPM-NEXT: [[CHANGED_0_OFF0_PH:%.*]] = phi i1 [ true, [[IF_THEN]] ], [ false, [[ENTRY]] ] 43; NEWPM-NEXT: br label [[FOR_COND:%.*]] 44; NEWPM: for.cond: 45; NEWPM-NEXT: [[I_0:%.*]] = phi i32 [ [[DEC]], [[FOR_BODY:%.*]] ], [ [[I_0_PH]], [[FOR_COND_OUTER]] ] 46; NEWPM-NEXT: [[DEC]] = add nsw i32 [[I_0]], -1 47; NEWPM-NEXT: [[TOBOOL:%.*]] = icmp eq i32 [[I_0]], 0 48; NEWPM-NEXT: br i1 [[TOBOOL]], label [[FOR_COND_CLEANUP:%.*]], label [[FOR_BODY]] 49; NEWPM: for.cond.cleanup: 50; NEWPM-NEXT: ret i1 [[CHANGED_0_OFF0_PH]] 51; NEWPM: for.body: 52; NEWPM-NEXT: [[IDXPROM:%.*]] = sext i32 [[DEC]] to i64 53; NEWPM-NEXT: [[ARRAYIDX:%.*]] = getelementptr inbounds i32, i32* [[C:%.*]], i64 [[IDXPROM]] 54; NEWPM-NEXT: [[TMP0:%.*]] = load i32, i32* [[ARRAYIDX]], align 4 55; NEWPM-NEXT: [[CMP:%.*]] = icmp eq i32 [[OR]], [[TMP0]] 56; NEWPM-NEXT: br i1 [[CMP]], label [[FOR_COND]], label [[IF_THEN]] 57; NEWPM: if.then: 58; NEWPM-NEXT: store i32 [[OR]], i32* [[ARRAYIDX]], align 4 59; NEWPM-NEXT: tail call void @foo() 60; NEWPM-NEXT: br label [[FOR_COND_OUTER]] 61; 62entry: 63 br label %for.cond 64 65for.cond: 66 %i.0 = phi i32 [ 2, %entry ], [ %dec, %if.end ] 67 %changed.0.off0 = phi i1 [ false, %entry ], [ %changed.1.off0, %if.end ] 68 %dec = add nsw i32 %i.0, -1 69 %tobool = icmp eq i32 %i.0, 0 70 br i1 %tobool, label %for.cond.cleanup, label %for.body 71 72for.cond.cleanup: 73 %changed.0.off0.lcssa = phi i1 [ %changed.0.off0, %for.cond ] 74 ret i1 %changed.0.off0.lcssa 75 76for.body: 77 %or = or i32 %a, %b 78 %idxprom = sext i32 %dec to i64 79 %arrayidx = getelementptr inbounds i32, i32* %c, i64 %idxprom 80 %0 = load i32, i32* %arrayidx, align 4 81 %cmp = icmp eq i32 %or, %0 82 br i1 %cmp, label %if.end, label %if.then 83 84if.then: 85 store i32 %or, i32* %arrayidx, align 4 86 call void @foo() 87 br label %if.end 88 89if.end: 90 %changed.1.off0 = phi i1 [ true, %if.then ], [ %changed.0.off0, %for.body ] 91 br label %for.cond 92} 93 94declare void @foo() 95 96