maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/llvm/test/Analysis/RegionInfo/paper.ll

59 lines
1.4 KiB
LLVM
Raw Normal View History

Revert the test moves from 176733. Use "REQUIRES: asserts" instead. llvm-svn: 176873
2013-03-13 00:27:52 +08:00
; REQUIRES: asserts
Add new RegionInfo pass. The RegionInfo pass detects single entry single exit regions in a function, where a region is defined as any subgraph that is connected to the remaining graph at only two spots. Furthermore an hierarchical region tree is built. Use it by calling "opt -regions analyze" or "opt -view-regions". llvm-svn: 109089
2010-07-22 15:46:31 +08:00
; RUN: opt -regions -analyze < %s | FileCheck %s
Convert the uses of '|&' to use '2>&1 |' instead, which works on old versions of Bash. In addition, I can back out the change to the lit built-in shell test runner to support this. This should fix the majority of fallout on Darwin, but I suspect there will be a few straggling issues. llvm-svn: 159544
2012-07-03 02:37:59 +08:00
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
Add new RegionInfo pass. The RegionInfo pass detects single entry single exit regions in a function, where a region is defined as any subgraph that is connected to the remaining graph at only two spots. Furthermore an hierarchical region tree is built. Use it by calling "opt -regions analyze" or "opt -view-regions". llvm-svn: 109089
2010-07-22 15:46:31 +08:00
Introduce RegionInfoAnalysis, which compute Region Tree in the new PassManager. NFC Differential Revision: http://reviews.llvm.org/D17571 llvm-svn: 261904
2016-02-26 01:54:25 +08:00
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
Add new RegionInfo pass. The RegionInfo pass detects single entry single exit regions in a function, where a region is defined as any subgraph that is connected to the remaining graph at only two spots. Furthermore an hierarchical region tree is built. Use it by calling "opt -regions analyze" or "opt -view-regions". llvm-svn: 109089
2010-07-22 15:46:31 +08:00
define void @a_linear_impl_fig_1() nounwind {
0:
br label %"1"
1:
br label %"2"
2:
br label %"3"
3:
br i1 1, label %"13", label %"4"
4:
br i1 1, label %"5", label %"1"
5:
br i1 1, label %"8", label %"6"
6:
br i1 1, label %"7", label %"4"
7:
ret void
8:
br i1 1, label %"9", label %"1"
9:
br label %"10"
10:
br i1 1, label %"12", label %"11"
11:
br i1 1, label %"9", label %"8"
13:
br i1 1, label %"2", label %"1"
12:
switch i32 0, label %"1" [ i32 0, label %"9"
i32 1, label %"8"]
}
; CHECK-NOT: =>
; CHECK: [0] 0 => <Function Return>
; CHECK-NEXT: [1] 1 => 7
; CHECK-NEXT: [2] 1 => 4
; CHECK-NEXT: [2] 8 => 1
; STAT: 4 region - The # of regions
; STAT: 1 region - The # of simple regions
; BBIT: 0, 1, 2, 3, 13, 4, 5, 8, 9, 10, 12, 11, 6, 7,
; BBIT: 1, 2, 3, 13, 4, 5, 8, 9, 10, 12, 11, 6,
; BBIT: 1, 2, 3, 13,
; BBIT: 8, 9, 10, 12, 11,
; RNIT: 0, 1 => 7, 7,
; RNIT: 1 => 4, 4, 5, 8 => 1, 6,
; RNIT: 1, 2, 3, 13,
; RNIT: 8, 9, 10, 12, 11,