diff options
Diffstat (limited to 'llvm/test/Transforms')
4 files changed, 40 insertions, 40 deletions
diff --git a/llvm/test/Transforms/LoopUnswitch/2015-06-17-Metadata.ll b/llvm/test/Transforms/LoopUnswitch/2015-06-17-Metadata.ll index a215be9d487..d536da1e8b6 100644 --- a/llvm/test/Transforms/LoopUnswitch/2015-06-17-Metadata.ll +++ b/llvm/test/Transforms/LoopUnswitch/2015-06-17-Metadata.ll @@ -16,23 +16,23 @@ for.body: ; preds = %for.inc, %for.body. %cmp1 = icmp eq i32 %a, 12345 br i1 %cmp1, label %if.then, label %if.else, !prof !0 ; CHECK: %cmp1 = icmp eq i32 %a, 12345 -; CHECK-NEXT: br i1 %cmp1, label %for.body.us, label %for.body, !prof !0 +; CHECK-NEXT: br i1 %cmp1, label %if.then.us, label %if.else, !prof !0 if.then: ; preds = %for.body -; CHECK: for.body.us: +; CHECK: if.then.us: ; CHECK: add nsw i32 %{{.*}}, 123 ; CHECK: %exitcond.us = icmp eq i32 %inc.us, %b -; CHECK: br i1 %exitcond.us, label %for.cond.cleanup, label %for.body.us +; CHECK: br i1 %exitcond.us, label %for.cond.cleanup, label %if.then.us %add = add nsw i32 %add.i, 123 br label %for.inc if.else: ; preds = %for.body %mul = mul nsw i32 %mul.i, %b br label %for.inc -; CHECK: for.body: +; CHECK: if.else: ; CHECK: %mul = mul nsw i32 %mul.i, %b ; CHECK: %inc = add nuw nsw i32 %inc.i, 1 ; CHECK: %exitcond = icmp eq i32 %inc, %b -; CHECK: br i1 %exitcond, label %for.cond.cleanup, label %for.body +; CHECK: br i1 %exitcond, label %for.cond.cleanup, label %if.else for.inc: ; preds = %if.then, %if.else %mul.p = phi i32 [ %b, %if.then ], [ %mul, %if.else ] %add.p = phi i32 [ %add, %if.then ], [ %a, %if.else ] diff --git a/llvm/test/Transforms/LoopUnswitch/infinite-loop.ll b/llvm/test/Transforms/LoopUnswitch/infinite-loop.ll index 0aef9092a1f..3d1c895edec 100644 --- a/llvm/test/Transforms/LoopUnswitch/infinite-loop.ll +++ b/llvm/test/Transforms/LoopUnswitch/infinite-loop.ll @@ -16,10 +16,10 @@ ; CHECK-NEXT: br i1 %a, label %entry.split, label %abort0.split ; CHECK: entry.split: -; CHECK-NEXT: br i1 %b, label %for.body, label %abort1.split +; CHECK-NEXT: br i1 %b, label %cond.end, label %abort1.split -; CHECK: for.body: -; CHECK-NEXT: br label %for.body +; CHECK: cond.end: +; CHECK-NEXT: br label %cond.end ; CHECK: abort0.split: ; CHECK-NEXT: call void @end0() [[NOR_NUW:#[0-9]+]] diff --git a/llvm/test/Transforms/SimplifyCFG/2008-05-16-PHIBlockMerge.ll b/llvm/test/Transforms/SimplifyCFG/2008-05-16-PHIBlockMerge.ll index 21e9bc7b7f4..13ccad6a1ee 100644 --- a/llvm/test/Transforms/SimplifyCFG/2008-05-16-PHIBlockMerge.ll +++ b/llvm/test/Transforms/SimplifyCFG/2008-05-16-PHIBlockMerge.ll @@ -1,6 +1,6 @@ ; RUN: opt < %s -simplifycfg -S > %t ; RUN: not grep "^BB.tomerge" %t -; RUN: grep "^BB.nomerge" %t | count 4 +; RUN: grep "^BB.nomerge" %t | count 2 ; ModuleID = '<stdin>' declare i1 @foo() @@ -54,24 +54,24 @@ Exit: ; preds = %Succ ret void } -; This function can't be merged (for keeping canonical loop structures) +; This function can be merged define void @c() { entry: - br label %BB.nomerge + br label %BB.tomerge -BB.nomerge: ; preds = %Common, %entry +BB.tomerge: ; preds = %Common, %entry br label %Succ Succ: ; preds = %Common, %BB.tomerge, %Pre-Exit ; This phi has identical values for Common and (through BB) Common, ; blocks can't be merged - %b = phi i32 [ 1, %BB.nomerge ], [ 1, %Common ], [ 2, %Pre-Exit ] + %b = phi i32 [ 1, %BB.tomerge ], [ 1, %Common ], [ 2, %Pre-Exit ] %conde = call i1 @foo( ) ; <i1> [#uses=1] br i1 %conde, label %Common, label %Pre-Exit Common: ; preds = %Succ %cond = call i1 @foo( ) ; <i1> [#uses=1] - br i1 %cond, label %BB.nomerge, label %Succ + br i1 %cond, label %BB.tomerge, label %Succ Pre-Exit: ; preds = %Succ ; This adds a backedge, so the %b phi node gets a third branch and is @@ -83,25 +83,25 @@ Exit: ; preds = %Pre-Exit ret void } -; This function can't be merged (for keeping canonical loop structures) +; This function can be merged define void @d() { entry: - br label %BB.nomerge + br label %BB.tomerge -BB.nomerge: ; preds = %Common, %entry +BB.tomerge: ; preds = %Common, %entry ; This phi has a matching value (0) with below phi (0), so blocks ; can be merged. %a = phi i32 [ 1, %entry ], [ 0, %Common ] ; <i32> [#uses=1] br label %Succ Succ: ; preds = %Common, %BB.tomerge - %b = phi i32 [ %a, %BB.nomerge ], [ 0, %Common ] ; <i32> [#uses=0] + %b = phi i32 [ %a, %BB.tomerge ], [ 0, %Common ] ; <i32> [#uses=0] %conde = call i1 @foo( ) ; <i1> [#uses=1] br i1 %conde, label %Common, label %Exit Common: ; preds = %Succ %cond = call i1 @foo( ) ; <i1> [#uses=1] - br i1 %cond, label %BB.nomerge, label %Succ + br i1 %cond, label %BB.tomerge, label %Succ Exit: ; preds = %Succ ret void @@ -110,21 +110,21 @@ Exit: ; preds = %Succ ; This function can be merged define void @e() { entry: - br label %Succ + br label %BB.tomerge -Succ: ; preds = %Use, %entry +BB.tomerge: ; preds = %Use, %entry ; This phi is used somewhere else than Succ, but this should not prevent ; merging this block %a = phi i32 [ 1, %entry ], [ 0, %Use ] ; <i32> [#uses=1] - br label %BB.tomerge + br label %Succ -BB.tomerge: ; preds = %BB.tomerge +Succ: ; preds = %BB.tomerge %conde = call i1 @foo( ) ; <i1> [#uses=1] br i1 %conde, label %Use, label %Exit Use: ; preds = %Succ %cond = call i1 @bar( i32 %a ) ; <i1> [#uses=1] - br i1 %cond, label %Succ, label %Exit + br i1 %cond, label %BB.tomerge, label %Exit Exit: ; preds = %Use, %Succ ret void diff --git a/llvm/test/Transforms/SimplifyCFG/EqualPHIEdgeBlockMerge.ll b/llvm/test/Transforms/SimplifyCFG/EqualPHIEdgeBlockMerge.ll index 6e8593755c7..b07ef970a20 100644 --- a/llvm/test/Transforms/SimplifyCFG/EqualPHIEdgeBlockMerge.ll +++ b/llvm/test/Transforms/SimplifyCFG/EqualPHIEdgeBlockMerge.ll @@ -5,7 +5,7 @@ ; RUN: not grep X: %t ; RUN: not grep 'switch i32[^U]+%U' %t ; RUN: not grep "^BB.tomerge" %t -; RUN: grep "^BB.nomerge" %t | count 4 +; RUN: grep "^BB.nomerge" %t | count 2 ; ; ModuleID = '<stdin>' @@ -179,24 +179,24 @@ Exit: ; preds = %Succ ret void } -; This function can't be merged (for keeping canonical loop structures) +; This function can be merged define void @c() { entry: - br label %BB.nomerge + br label %BB.tomerge -BB.nomerge: ; preds = %Common, %entry +BB.tomerge: ; preds = %Common, %entry br label %Succ Succ: ; preds = %Common, %BB.tomerge, %Pre-Exit ; This phi has identical values for Common and (through BB) Common, ; blocks can't be merged - %b = phi i32 [ 1, %BB.nomerge ], [ 1, %Common ], [ 2, %Pre-Exit ] + %b = phi i32 [ 1, %BB.tomerge ], [ 1, %Common ], [ 2, %Pre-Exit ] %conde = call i1 @foo( ) ; <i1> [#uses=1] br i1 %conde, label %Common, label %Pre-Exit Common: ; preds = %Succ %cond = call i1 @foo( ) ; <i1> [#uses=1] - br i1 %cond, label %BB.nomerge, label %Succ + br i1 %cond, label %BB.tomerge, label %Succ Pre-Exit: ; preds = %Succ ; This adds a backedge, so the %b phi node gets a third branch and is @@ -208,25 +208,25 @@ Exit: ; preds = %Pre-Exit ret void } -; This function can't be merged (for keeping canonical loop structures) +; This function can be merged define void @d() { entry: - br label %BB.nomerge + br label %BB.tomerge -BB.nomerge: ; preds = %Common, %entry +BB.tomerge: ; preds = %Common, %entry ; This phi has a matching value (0) with below phi (0), so blocks ; can be merged. %a = phi i32 [ 1, %entry ], [ 0, %Common ] ; <i32> [#uses=1] br label %Succ Succ: ; preds = %Common, %BB.tomerge - %b = phi i32 [ %a, %BB.nomerge ], [ 0, %Common ] ; <i32> [#uses=0] + %b = phi i32 [ %a, %BB.tomerge ], [ 0, %Common ] ; <i32> [#uses=0] %conde = call i1 @foo( ) ; <i1> [#uses=1] br i1 %conde, label %Common, label %Exit Common: ; preds = %Succ %cond = call i1 @foo( ) ; <i1> [#uses=1] - br i1 %cond, label %BB.nomerge, label %Succ + br i1 %cond, label %BB.tomerge, label %Succ Exit: ; preds = %Succ ret void @@ -235,21 +235,21 @@ Exit: ; preds = %Succ ; This function can be merged define void @e() { entry: - br label %Succ + br label %BB.tomerge -Succ: ; preds = %Use, %entry +BB.tomerge: ; preds = %Use, %entry ; This phi is used somewhere else than Succ, but this should not prevent ; merging this block %a = phi i32 [ 1, %entry ], [ 0, %Use ] ; <i32> [#uses=1] - br label %BB.tomerge + br label %Succ -BB.tomerge: ; preds = %Succ +Succ: ; preds = %BB.tomerge %conde = call i1 @foo( ) ; <i1> [#uses=1] br i1 %conde, label %Use, label %Exit Use: ; preds = %Succ %cond = call i1 @bar( i32 %a ) ; <i1> [#uses=1] - br i1 %cond, label %Succ, label %Exit + br i1 %cond, label %BB.tomerge, label %Exit Exit: ; preds = %Use, %Succ ret void |
