mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-23 13:02:52 +02:00
3ea2df7c7b
Similar to gep (r230786) and load (r230794) changes.
Similar migration script can be used to update test cases, which
successfully migrated all of LLVM and Polly, but about 4 test cases
needed manually changes in Clang.
(this script will read the contents of stdin and massage it into stdout
- wrap it in the 'apply.sh' script shown in previous commits + xargs to
apply it over a large set of test cases)
import fileinput
import sys
import re
rep = re.compile(r"(getelementptr(?:\s+inbounds)?\s*\()((<\d*\s+x\s+)?([^@]*?)(|\s*addrspace\(\d+\))\s*\*(?(3)>)\s*)(?=$|%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|zeroinitializer|<|\[\[[a-zA-Z]|\{\{)", re.MULTILINE | re.DOTALL)
def conv(match):
line = match.group(1)
line += match.group(4)
line += ", "
line += match.group(2)
return line
line = sys.stdin.read()
off = 0
for match in re.finditer(rep, line):
sys.stdout.write(line[off:match.start()])
sys.stdout.write(conv(match))
off = match.end()
sys.stdout.write(line[off:])
llvm-svn: 232184
52 lines
1.8 KiB
LLVM
52 lines
1.8 KiB
LLVM
; RUN: llc < %s
|
|
|
|
;; Date: May 28, 2003.
|
|
;; From: test/Programs/MultiSource/Olden-perimeter/maketree.c
|
|
;; Function: int CheckOutside(int x, int y)
|
|
;;
|
|
;; Note: The .ll code below for this regression test has identical
|
|
;; behavior to the above function up to the error, but then prints
|
|
;; true/false on the two branches.
|
|
;;
|
|
;; Error: llc generates a branch-on-xcc instead of branch-on-icc, which
|
|
;; is wrong because the value being compared (int euclid = x*x + y*y)
|
|
;; overflows, so that the 64-bit and 32-bit compares are not equal.
|
|
|
|
@.str_1 = internal constant [6 x i8] c"true\0A\00" ; <[6 x i8]*> [#uses=1]
|
|
@.str_2 = internal constant [7 x i8] c"false\0A\00" ; <[7 x i8]*> [#uses=1]
|
|
|
|
declare i32 @printf(i8*, ...)
|
|
|
|
define internal void @__main() {
|
|
entry:
|
|
ret void
|
|
}
|
|
|
|
define internal void @CheckOutside(i32 %x.1, i32 %y.1) {
|
|
entry:
|
|
%tmp.2 = mul i32 %x.1, %x.1 ; <i32> [#uses=1]
|
|
%tmp.5 = mul i32 %y.1, %y.1 ; <i32> [#uses=1]
|
|
%tmp.6 = add i32 %tmp.2, %tmp.5 ; <i32> [#uses=1]
|
|
%tmp.8 = icmp sle i32 %tmp.6, 4194304 ; <i1> [#uses=1]
|
|
br i1 %tmp.8, label %then, label %else
|
|
|
|
then: ; preds = %entry
|
|
%tmp.11 = call i32 (i8*, ...)* @printf( i8* getelementptr ([6 x i8], [6 x i8]* @.str_1, i64 0, i64 0) ) ; <i32> [#uses=0]
|
|
br label %UnifiedExitNode
|
|
|
|
else: ; preds = %entry
|
|
%tmp.13 = call i32 (i8*, ...)* @printf( i8* getelementptr ([7 x i8], [7 x i8]* @.str_2, i64 0, i64 0) ) ; <i32> [#uses=0]
|
|
br label %UnifiedExitNode
|
|
|
|
UnifiedExitNode: ; preds = %else, %then
|
|
ret void
|
|
}
|
|
|
|
define i32 @main() {
|
|
entry:
|
|
call void @__main( )
|
|
call void @CheckOutside( i32 2097152, i32 2097152 )
|
|
ret i32 0
|
|
}
|
|
|