File: inf-recursion.ll

package info (click to toggle)
llvm-3.0 3.0-10
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 75,412 kB
  • sloc: cpp: 468,043; asm: 109,345; ansic: 13,782; sh: 12,935; ml: 4,716; python: 4,351; perl: 2,096; makefile: 1,905; pascal: 1,578; exp: 389; xml: 283; lisp: 187; csh: 117
file content (33 lines) | stat: -rw-r--r-- 773 bytes parent folder | download | duplicates (3)
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
; RUN: opt < %s -tailcallelim -S | FileCheck %s

; Don't turn this into an infinite loop, this is probably the implementation
; of fabs and we expect the codegen to lower fabs.
; CHECK: @fabs(double %f)
; CHECK: call
; CHECK: ret

define double @fabs(double %f) {
entry:
        %tmp2 = call double @fabs( double %f )          ; <double> [#uses=1]
        ret double %tmp2
}

; Do turn other calls into infinite loops though.

; CHECK: define double @foo
; CHECK-NOT: call
; CHECK: }
define double @foo(double %f) {
        %t= call double @foo(double %f)
        ret double %t
}

; CHECK: define float @fabsf
; CHECK-NOT: call
; CHECK: }
define float @fabsf(float %f) {
        %t= call float @fabsf(float 2.0)
        ret float %t
}

declare x86_fp80 @fabsl(x86_fp80 %f)