1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
; RUN: llvm-upgrade < %s | llvm-as | llc
;; 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 sbyte] c"true\0A\00"
%.str_2 = internal constant [7 x sbyte] c"false\0A\00"
implementation ; Functions:
declare int %printf(sbyte*, ...)
internal void %__main() {
entry: ; No predecessors!
ret void
}
internal void %CheckOutside(int %x.1, int %y.1) {
entry: ; No predecessors!
%tmp.2 = mul int %x.1, %x.1 ; <int> [#uses=1]
%tmp.5 = mul int %y.1, %y.1 ; <int> [#uses=1]
%tmp.6 = add int %tmp.2, %tmp.5 ; <int> [#uses=1]
%tmp.8 = setle int %tmp.6, 4194304 ; <bool> [#uses=1]
br bool %tmp.8, label %then, label %else
then: ; preds = %entry
%tmp.11 = call int (sbyte*, ...)* %printf( sbyte* getelementptr ([6 x sbyte]* %.str_1, long 0, long 0) ) ; <int> [#uses=0]
br label %UnifiedExitNode
else: ; preds = %entry
%tmp.13 = call int (sbyte*, ...)* %printf( sbyte* getelementptr ([7 x sbyte]* %.str_2, long 0, long 0) ) ; <int> [#uses=0]
br label %UnifiedExitNode
UnifiedExitNode: ; preds = %then, %else
ret void
}
int %main() {
entry: ; No predecessors!
call void %__main( )
call void %CheckOutside( int 2097152, int 2097152 )
ret int 0
}
|
