llvm-6502/test/Analysis/RegionInfo/block_sort.ll
Tobias Grosser f96b006367 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".

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@109089 91177308-0d34-0410-b5e6-96231b3b80d8
2010-07-22 07:46:31 +00:00

43 lines
1.1 KiB
LLVM

; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats -analyze < %s |& FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s |& FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s |& FileCheck -check-prefix=RNIT %s
define void @BZ2_blockSort() nounwind {
start:
br label %while
while:
br label %while.body134.i.i
while.body134.i.i:
br i1 1, label %end, label %w
w:
br label %if.end140.i.i
if.end140.i.i:
br i1 1, label %while.end186.i.i, label %if.end183.i.i
if.end183.i.i:
br label %while.body134.i.i
while.end186.i.i:
br label %while
end:
ret void
}
; CHECK-NOT: =>
; CHECK: [0] start => <Function Return>
; CHECK: [1] while => end
; STAT: 2 region - The # of regions
; STAT: 1 region - The # of simple regions
; BBIT: start, while, while.body134.i.i, end, w, if.end140.i.i, while.end186.i.i, if.end183.i.i,
; BBIT: while, while.body134.i.i, w, if.end140.i.i, while.end186.i.i, if.end183.i.i,
; RNIT: start, while => end, end,
; RNIT: while, while.body134.i.i, w, if.end140.i.i, while.end186.i.i, if.end183.i.i,