2011-02-11 00:38:10 +01:00
|
|
|
; RUN: opt < %s -loop-simplify -lcssa -verify-loop-info -verify-dom-info -S \
|
Convert all tests using TCL-style quoting to use shell-style quoting.
This was done through the aid of a terrible Perl creation. I will not
paste any of the horrors here. Suffice to say, it require multiple
staged rounds of replacements, state carried between, and a few
nested-construct-parsing hacks that I'm not proud of. It happens, by
luck, to be able to deal with all the TCL-quoting patterns in evidence
in the LLVM test suite.
If anyone is maintaining large out-of-tree test trees, feel free to poke
me and I'll send you the steps I used to convert things, as well as
answer any painful questions etc. IRC works best for this type of thing
I find.
Once converted, switch the LLVM lit config to use ShTests the same as
Clang. In addition to being able to delete large amounts of Python code
from 'lit', this will also simplify the entire test suite and some of
lit's architecture.
Finally, the test suite runs 33% faster on Linux now. ;]
For my 16-hardware-thread (2x 4-core xeon e5520): 36s -> 24s
llvm-svn: 159525
2012-07-02 14:47:22 +02:00
|
|
|
; RUN: | grep -F "indirectbr i8* %x, [label %L0, label %L1]" \
|
2009-11-05 22:14:46 +01:00
|
|
|
; RUN: | count 6
|
|
|
|
|
|
|
|
|
|
; LoopSimplify should not try to transform loops when indirectbr is involved.
|
|
|
|
|
|
|
|
|
|
define void @entry(i8* %x) {
|
|
|
|
|
entry:
|
|
|
|
|
indirectbr i8* %x, [ label %L0, label %L1 ]
|
|
|
|
|
|
|
|
|
|
L0:
|
|
|
|
|
br label %L0
|
|
|
|
|
|
|
|
|
|
L1:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define void @backedge(i8* %x) {
|
|
|
|
|
entry:
|
|
|
|
|
br label %L0
|
|
|
|
|
|
|
|
|
|
L0:
|
|
|
|
|
br label %L1
|
|
|
|
|
|
|
|
|
|
L1:
|
|
|
|
|
indirectbr i8* %x, [ label %L0, label %L1 ]
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @exit(i8* %x) {
|
|
|
|
|
entry:
|
|
|
|
|
br label %L2
|
|
|
|
|
|
|
|
|
|
L2:
|
|
|
|
|
%z = bitcast i64 0 to i64
|
|
|
|
|
indirectbr i8* %x, [ label %L0, label %L1 ]
|
|
|
|
|
|
|
|
|
|
L0:
|
|
|
|
|
br label %L2
|
|
|
|
|
|
|
|
|
|
L1:
|
|
|
|
|
ret i64 %z
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @criticalexit(i8* %x, i1 %a) {
|
|
|
|
|
entry:
|
|
|
|
|
br i1 %a, label %L1, label %L2
|
|
|
|
|
|
|
|
|
|
L2:
|
|
|
|
|
%z = bitcast i64 0 to i64
|
|
|
|
|
indirectbr i8* %x, [ label %L0, label %L1 ]
|
|
|
|
|
|
|
|
|
|
L0:
|
|
|
|
|
br label %L2
|
|
|
|
|
|
|
|
|
|
L1:
|
|
|
|
|
%y = phi i64 [ %z, %L2 ], [ 1, %entry ]
|
|
|
|
|
ret i64 %y
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @exit_backedge(i8* %x) {
|
|
|
|
|
entry:
|
|
|
|
|
br label %L0
|
|
|
|
|
|
|
|
|
|
L0:
|
|
|
|
|
%z = bitcast i64 0 to i64
|
|
|
|
|
indirectbr i8* %x, [ label %L0, label %L1 ]
|
|
|
|
|
|
|
|
|
|
L1:
|
|
|
|
|
ret i64 %z
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @criticalexit_backedge(i8* %x, i1 %a) {
|
|
|
|
|
entry:
|
|
|
|
|
br i1 %a, label %L0, label %L1
|
|
|
|
|
|
|
|
|
|
L0:
|
|
|
|
|
%z = bitcast i64 0 to i64
|
|
|
|
|
indirectbr i8* %x, [ label %L0, label %L1 ]
|
|
|
|
|
|
|
|
|
|
L1:
|
|
|
|
|
%y = phi i64 [ %z, %L0 ], [ 1, %entry ]
|
|
|
|
|
ret i64 %y
|
|
|
|
|
}
|
2009-11-20 21:51:18 +01:00
|
|
|
|
|
|
|
|
define void @pr5502() nounwind {
|
|
|
|
|
entry:
|
|
|
|
|
br label %while.cond
|
|
|
|
|
|
|
|
|
|
while.cond:
|
|
|
|
|
br i1 undef, label %while.body, label %while.end
|
|
|
|
|
|
|
|
|
|
while.body:
|
|
|
|
|
indirectbr i8* undef, [label %end_opcode, label %end_opcode]
|
|
|
|
|
|
|
|
|
|
end_opcode:
|
|
|
|
|
br i1 false, label %end_opcode, label %while.cond
|
|
|
|
|
|
|
|
|
|
while.end:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
