mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 03:02:36 +01:00
ab043ff680
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
38 lines
790 B
LLVM
38 lines
790 B
LLVM
; RUN: opt < %s -scalar-evolution -analyze | FileCheck %s
|
|
|
|
; CHECK: Loop %bb3: backedge-taken count is (-1 + %n)
|
|
|
|
; We don't want to use a max in the trip count expression in
|
|
; this testcase.
|
|
|
|
define void @foo(i32 %n, i32* %p, i32* %q) nounwind {
|
|
entry:
|
|
icmp sgt i32 %n, 0
|
|
br i1 %0, label %bb, label %return
|
|
|
|
bb:
|
|
load i32, i32* %q, align 4
|
|
icmp eq i32 %1, 0
|
|
br i1 %2, label %return, label %bb3.preheader
|
|
|
|
bb3.preheader:
|
|
br label %bb3
|
|
|
|
bb3:
|
|
%i.0 = phi i32 [ %7, %bb3 ], [ 0, %bb3.preheader ]
|
|
getelementptr i32, i32* %p, i32 %i.0
|
|
load i32, i32* %3, align 4
|
|
add i32 %4, 1
|
|
getelementptr i32, i32* %p, i32 %i.0
|
|
store i32 %5, i32* %6, align 4
|
|
add i32 %i.0, 1
|
|
icmp slt i32 %7, %n
|
|
br i1 %8, label %bb3, label %return.loopexit
|
|
|
|
return.loopexit:
|
|
br label %return
|
|
|
|
return:
|
|
ret void
|
|
}
|