1 ; RUN: llvm-as -f %s -o - | llc
4 ;; From: test/Programs/MultiSource/Olden-perimeter/maketree.c
5 ;; Function: int CheckOutside(int x, int y)
7 ;; Note: The .ll code below for this regression test has identical
8 ;; behavior to the above function up to the error, but then prints
9 ;; true/false on the two branches.
11 ;; Error: llc generates a branch-on-xcc instead of branch-on-icc, which
12 ;; is wrong because the value being compared (int euclid = x*x + y*y)
13 ;; overflows, so that the 64-bit and 32-bit compares are not equal.
15 %.str_1 = internal constant [6 x sbyte] c"true\0A\00"
16 %.str_2 = internal constant [7 x sbyte] c"false\0A\00"
18 implementation ; Functions:
20 declare int %printf(sbyte*, ...)
22 internal void %__main() {
23 entry: ; No predecessors!
27 internal void %CheckOutside(int %x.1, int %y.1) {
28 entry: ; No predecessors!
29 %tmp.2 = mul int %x.1, %x.1 ; <int> [#uses=1]
30 %tmp.5 = mul int %y.1, %y.1 ; <int> [#uses=1]
31 %tmp.6 = add int %tmp.2, %tmp.5 ; <int> [#uses=1]
32 %tmp.8 = setle int %tmp.6, 4194304 ; <bool> [#uses=1]
33 br bool %tmp.8, label %then, label %else
35 then: ; preds = %entry
36 %tmp.11 = call int (sbyte*, ...)* %printf( sbyte* getelementptr ([6 x sbyte]* %.str_1, long 0, long 0) ) ; <int> [#uses=0]
37 br label %UnifiedExitNode
39 else: ; preds = %entry
40 %tmp.13 = call int (sbyte*, ...)* %printf( sbyte* getelementptr ([7 x sbyte]* %.str_2, long 0, long 0) ) ; <int> [#uses=0]
41 br label %UnifiedExitNode
43 UnifiedExitNode: ; preds = %then, %else
48 entry: ; No predecessors!
50 call void %CheckOutside( int 2097152, int 2097152 )