llvm-6502/test/Transforms/TailCallElim/inf-recursion.ll

; RUN: opt < %s -tailcallelim -S | grep call
; Don't turn this into an infinite loop, this is probably the implementation
; of fabs and we expect the codegen to lower fabs.

define double @fabs(double %f) {
entry:
        %tmp2 = call double @fabs( double %f )          ; <double> [#uses=1]
        ret double %tmp2
}
Change tests from "opt %s" to "opt < %s" so that opt doesn't see the input filename so that opt doesn't print the input filename in the output so that grep lines in the tests don't unintentionally match strings in the input filename. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@81537 91177308-0d34-0410-b5e6-96231b3b80d8 2009-09-11 18:01:28 +00:00			`; RUN: opt < %s -tailcallelim -S \| grep call`
Prevent tailcallelim from breaking "recursive" calls to builtins. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41804 91177308-0d34-0410-b5e6-96231b3b80d8 2007-09-10 20:58:55 +00:00			`; Don't turn this into an infinite loop, this is probably the implementation`
			`; of fabs and we expect the codegen to lower fabs.`

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