maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/llvm/test/Transforms/LoopSimplify/preserve-scev.ll

139 lines
4.8 KiB
LLVM
Raw Normal View History

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 20:47:22 +08:00
; RUN: opt -S < %s -indvars | opt -analyze -iv-users | grep "%cmp = icmp slt i32" | grep "= {%\.ph,+,1}<%for.cond>"
Fix LoopSimplify to notify ScalarEvolution when splitting a loop backedge into an inner loop, as the new loop iteration may differ substantially. This fixes PR8078. llvm-svn: 113057
2010-09-04 10:42:48 +08:00
; PR8079
; LoopSimplify should invalidate indvars when splitting out the
; inner loop.
@maxStat = external global i32
define i32 @test() nounwind {
entry:
br label %for.cond
for.cond: ; preds = %if.then5, %if.end, %entry
%cuts.1 = phi i32 [ 0, %entry ], [ %inc, %if.then5 ], [ %cuts.1, %if.end ]
%0 = phi i32 [ 0, %entry ], [ %add, %if.end ], [ %add, %if.then5 ]
%add = add i32 %0, 1
%cmp = icmp slt i32 %0, 1
[opaque pointer type] Add textual IR support for explicit type parameter to load instruction Essentially the same as the GEP change in r230786. A similar migration script can be used to update test cases, though a few more test case improvements/changes were required this time around: (r229269-r229278) import fileinput import sys import re pat = re.compile(r"((?:=|:|^)\s*load (?:atomic )?(?:volatile )?(.*?))(| addrspace\(\d+\) *)\*($| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$)") for line in sys.stdin: sys.stdout.write(re.sub(pat, r"\1, \2\3*\4", line)) Reviewers: rafael, dexonsmith, grosser Differential Revision: http://reviews.llvm.org/D7649 llvm-svn: 230794
2015-02-28 05:17:42 +08:00
%tmp1 = load i32, i32* @maxStat, align 4
Fix LoopSimplify to notify ScalarEvolution when splitting a loop backedge into an inner loop, as the new loop iteration may differ substantially. This fixes PR8078. llvm-svn: 113057
2010-09-04 10:42:48 +08:00
br i1 %cmp, label %for.body, label %for.cond14.preheader
for.cond14.preheader: ; preds = %for.cond
%cmp1726 = icmp sgt i32 %tmp1, 0
br i1 %cmp1726, label %for.body18, label %return
for.body: ; preds = %for.cond
%cmp2 = icmp sgt i32 %tmp1, 100
br i1 %cmp2, label %return, label %if.end
if.end: ; preds = %for.body
%cmp4 = icmp sgt i32 %tmp1, -1
br i1 %cmp4, label %if.then5, label %for.cond
if.then5: ; preds = %if.end
call void @foo() nounwind
%inc = add i32 %cuts.1, 1
br label %for.cond
for.body18: ; preds = %for.body18, %for.cond14.preheader
%i13.027 = phi i32 [ %1, %for.body18 ], [ 0, %for.cond14.preheader ]
call void @foo() nounwind
%1 = add nsw i32 %i13.027, 1
[opaque pointer type] Add textual IR support for explicit type parameter to load instruction Essentially the same as the GEP change in r230786. A similar migration script can be used to update test cases, though a few more test case improvements/changes were required this time around: (r229269-r229278) import fileinput import sys import re pat = re.compile(r"((?:=|:|^)\s*load (?:atomic )?(?:volatile )?(.*?))(| addrspace\(\d+\) *)\*($| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$)") for line in sys.stdin: sys.stdout.write(re.sub(pat, r"\1, \2\3*\4", line)) Reviewers: rafael, dexonsmith, grosser Differential Revision: http://reviews.llvm.org/D7649 llvm-svn: 230794
2015-02-28 05:17:42 +08:00
%tmp16 = load i32, i32* @maxStat, align 4
Fix LoopSimplify to notify ScalarEvolution when splitting a loop backedge into an inner loop, as the new loop iteration may differ substantially. This fixes PR8078. llvm-svn: 113057
2010-09-04 10:42:48 +08:00
%cmp17 = icmp slt i32 %1, %tmp16
br i1 %cmp17, label %for.body18, label %return
return: ; preds = %for.body18, %for.body, %for.cond14.preheader
ret i32 0
}
declare void @foo() nounwind
SCEV: Use AssertingVH to catch dangling BasicBlock* when passes forget to notify SCEV of a change. Add forgetLoop in a couple of those places. llvm-svn: 136797
2011-08-04 02:32:11 +08:00
; Notify SCEV when removing an ExitingBlock.
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @mergeExit(
SCEV: Use AssertingVH to catch dangling BasicBlock* when passes forget to notify SCEV of a change. Add forgetLoop in a couple of those places. llvm-svn: 136797
2011-08-04 02:32:11 +08:00
; CHECK: while.cond191:
; CHECK: br i1 %or.cond, label %while.body197
; CHECK-NOT: land.rhs:
; CHECK: ret
define void @mergeExit(i32 %MapAttrCount) nounwind uwtable ssp {
entry:
br i1 undef, label %if.then124, label %if.end126
if.then124: ; preds = %entry
unreachable
if.end126: ; preds = %entry
br i1 undef, label %while.body.lr.ph, label %if.end591
while.body.lr.ph: ; preds = %if.end126
br i1 undef, label %if.end140, label %if.then137
if.then137: ; preds = %while.body.lr.ph
unreachable
if.end140: ; preds = %while.body.lr.ph
br i1 undef, label %while.cond191.outer, label %if.then148
if.then148: ; preds = %if.end140
unreachable
while.cond191.outer: ; preds = %if.then205, %if.end140
br label %while.cond191
while.cond191: ; preds = %while.body197, %while.cond191.outer
%CppIndex.0 = phi i32 [ %inc, %while.body197 ], [ undef, %while.cond191.outer ]
br i1 undef, label %land.rhs, label %if.then216
land.rhs: ; preds = %while.cond191
%inc = add i32 %CppIndex.0, 1
%cmp196 = icmp ult i32 %inc, %MapAttrCount
br i1 %cmp196, label %while.body197, label %if.then216
while.body197: ; preds = %land.rhs
br i1 undef, label %if.then205, label %while.cond191
if.then205: ; preds = %while.body197
br label %while.cond191.outer
if.then216: ; preds = %land.rhs, %while.cond191
br i1 undef, label %if.else, label %if.then221
if.then221: ; preds = %if.then216
unreachable
if.else: ; preds = %if.then216
br i1 undef, label %if.then266, label %if.end340
if.then266: ; preds = %if.else
switch i32 undef, label %if.else329 [
i32 17, label %if.then285
i32 19, label %if.then285
i32 18, label %if.then285
i32 15, label %if.then285
]
if.then285: ; preds = %if.then266, %if.then266, %if.then266, %if.then266
br i1 undef, label %if.then317, label %if.else324
if.then317: ; preds = %if.then285
br label %if.end340
if.else324: ; preds = %if.then285
unreachable
if.else329: ; preds = %if.then266
unreachable
if.end340: ; preds = %if.then317, %if.else
unreachable
if.end591: ; preds = %if.end126
br i1 undef, label %cond.end, label %cond.false
cond.false: ; preds = %if.end591
unreachable
cond.end: ; preds = %if.end591
ret void
}