1; RUN: opt < %s -licm -S | FileCheck %s 2; RUN: opt -lcssa %s | opt -aa-pipeline=basic-aa -passes='require<aa>,require<targetir>,require<scalar-evolution>,require<opt-remark-emit>,loop(licm)' -S | FileCheck %s 3 4@X = global i32 0 ; <i32*> [#uses=1] 5 6declare void @foo() 7 8declare i32 @llvm.bitreverse.i32(i32) 9 10; This testcase tests for a problem where LICM hoists 11; potentially trapping instructions when they are not guaranteed to execute. 12define i32 @test1(i1 %c) { 13; CHECK-LABEL: @test1( 14 %A = load i32, i32* @X ; <i32> [#uses=2] 15 br label %Loop 16Loop: ; preds = %LoopTail, %0 17 call void @foo( ) 18 br i1 %c, label %LoopTail, label %IfUnEqual 19 20IfUnEqual: ; preds = %Loop 21; CHECK: IfUnEqual: 22; CHECK-NEXT: sdiv i32 4, %A 23 %B1 = sdiv i32 4, %A ; <i32> [#uses=1] 24 br label %LoopTail 25 26LoopTail: ; preds = %IfUnEqual, %Loop 27 %B = phi i32 [ 0, %Loop ], [ %B1, %IfUnEqual ] ; <i32> [#uses=1] 28 br i1 %c, label %Loop, label %Out 29Out: ; preds = %LoopTail 30 %C = sub i32 %A, %B ; <i32> [#uses=1] 31 ret i32 %C 32} 33 34 35declare void @foo2(i32) nounwind 36 37 38;; It is ok and desirable to hoist this potentially trapping instruction. 39define i32 @test2(i1 %c) { 40; CHECK-LABEL: @test2( 41; CHECK-NEXT: load i32, i32* @X 42; CHECK-NEXT: %B = sdiv i32 4, %A 43 %A = load i32, i32* @X 44 br label %Loop 45 46Loop: 47 ;; Should have hoisted this div! 48 %B = sdiv i32 4, %A 49 br label %loop2 50 51loop2: 52 call void @foo2( i32 %B ) 53 br i1 %c, label %Loop, label %Out 54 55Out: 56 %C = sub i32 %A, %B 57 ret i32 %C 58} 59 60 61; This loop invariant instruction should be constant folded, not hoisted. 62define i32 @test3(i1 %c) { 63; CHECK-LABEL: define i32 @test3( 64; CHECK: call void @foo2(i32 6) 65 %A = load i32, i32* @X ; <i32> [#uses=2] 66 br label %Loop 67Loop: 68 %B = add i32 4, 2 ; <i32> [#uses=2] 69 call void @foo2( i32 %B ) 70 br i1 %c, label %Loop, label %Out 71Out: ; preds = %Loop 72 %C = sub i32 %A, %B ; <i32> [#uses=1] 73 ret i32 %C 74} 75 76; CHECK-LABEL: @test4( 77; CHECK: call 78; CHECK: sdiv 79; CHECK: ret 80define i32 @test4(i32 %x, i32 %y) nounwind uwtable ssp { 81entry: 82 br label %for.body 83 84for.body: ; preds = %entry, %for.body 85 %i.02 = phi i32 [ 0, %entry ], [ %inc, %for.body ] 86 %n.01 = phi i32 [ 0, %entry ], [ %add, %for.body ] 87 call void @foo_may_call_exit(i32 0) 88 %div = sdiv i32 %x, %y 89 %add = add nsw i32 %n.01, %div 90 %inc = add nsw i32 %i.02, 1 91 %cmp = icmp slt i32 %inc, 10000 92 br i1 %cmp, label %for.body, label %for.end 93 94for.end: ; preds = %for.body 95 %n.0.lcssa = phi i32 [ %add, %for.body ] 96 ret i32 %n.0.lcssa 97} 98 99declare void @foo_may_call_exit(i32) 100 101; PR14854 102; CHECK-LABEL: @test5( 103; CHECK: extractvalue 104; CHECK: br label %tailrecurse 105; CHECK: tailrecurse: 106; CHECK: ifend: 107; CHECK: insertvalue 108define { i32*, i32 } @test5(i32 %i, { i32*, i32 } %e) { 109entry: 110 br label %tailrecurse 111 112tailrecurse: ; preds = %then, %entry 113 %i.tr = phi i32 [ %i, %entry ], [ %cmp2, %then ] 114 %out = extractvalue { i32*, i32 } %e, 1 115 %d = insertvalue { i32*, i32 } %e, i32* null, 0 116 %cmp1 = icmp sgt i32 %out, %i.tr 117 br i1 %cmp1, label %then, label %ifend 118 119then: ; preds = %tailrecurse 120 call void @foo() 121 %cmp2 = add i32 %i.tr, 1 122 br label %tailrecurse 123 124ifend: ; preds = %tailrecurse 125 ret { i32*, i32 } %d 126} 127 128; CHECK: define i32 @hoist_bitreverse(i32) 129; CHECK: bitreverse 130; CHECK: br label %header 131define i32 @hoist_bitreverse(i32) { 132 br label %header 133 134header: 135 %sum = phi i32 [ 0, %1 ], [ %5, %latch ] 136 %2 = phi i32 [ 0, %1 ], [ %6, %latch ] 137 %3 = icmp slt i32 %2, 1024 138 br i1 %3, label %body, label %return 139 140body: 141 %4 = call i32 @llvm.bitreverse.i32(i32 %0) 142 %5 = add i32 %sum, %4 143 br label %latch 144 145latch: 146 %6 = add nsw i32 %2, 1 147 br label %header 148 149return: 150 ret i32 %sum 151} 152