55 lines · plain
1; RUN: opt < %s -passes=tailcallelim -verify-dom-info -S | FileCheck %s2 3; Don't turn this into an infinite loop, this is probably the implementation4; of fabs and we expect the codegen to lower fabs.5; CHECK: @fabs(double %f)6; CHECK: call7; CHECK: ret8 9define double @fabs(double %f) {10entry:11 %tmp2 = call double @fabs( double %f ) ; <double> [#uses=1]12 ret double %tmp213}14 15; Do turn other calls into infinite loops though.16 17; CHECK-LABEL: define double @foo(18; CHECK-NOT: call19; CHECK: }20define double @foo(double %f) {21 %t= call double @foo(double %f)22 ret double %t23}24 25; CHECK-LABEL: define float @fabsf(26; CHECK-NOT: call27; CHECK: }28define float @fabsf(float %f) {29 %t= call float @fabsf(float 2.0)30 ret float %t31}32 33declare x86_fp80 @fabsl(x86_fp80 %f)34 35; Don't crash while transforming a function with infinite recursion.36define i32 @PR22704(i1 %bool) {37entry:38 br i1 %bool, label %t, label %f39 40t:41 %call1 = call i32 @PR22704(i1 1)42 br label %return43 44f:45 %call = call i32 @PR22704(i1 1)46 br label %return47 48return:49 ret i32 050 51; CHECK-LABEL: @PR22704(52; CHECK: %bool.tr = phi i1 [ %bool, %entry ], [ true, %t ], [ true, %f ]53; CHECK: br i1 %bool.tr, label %t, label %f54}55