1 ; RUN: llvm-as < %s | llc -march=x86 -mattr=+sse2 -stats |& \
2 ; RUN: grep {1 .*folded into instructions}
3 ; Increment in loop bb.128.i adjusted to 2, to prevent loop reversal from
6 declare fastcc void @rdft(i32, i32, double*, i32*, double*)
8 define fastcc void @mp_sqrt(i32 %n, i32 %radix, i32* %in, i32* %out, i32* %tmp1, i32* %tmp2, i32 %nfft, double* %tmp1fft, double* %tmp2fft, i32* %ip, double* %w) nounwind {
12 bb.i5: ; preds = %bb.i5, %entry
13 %nfft_init.0.i = phi i32 [ 1, %entry ], [ %tmp7.i3, %bb.i5 ] ; <i32> [#uses=1]
14 %foo = phi i1 [1, %entry], [0, %bb.i5]
15 %tmp7.i3 = shl i32 %nfft_init.0.i, 1 ; <i32> [#uses=2]
16 br i1 %foo, label %bb.i5, label %mp_unexp_mp2d.exit.i
18 mp_unexp_mp2d.exit.i: ; preds = %bb.i5
19 br i1 %foo, label %cond_next.i, label %cond_true.i
21 cond_true.i: ; preds = %mp_unexp_mp2d.exit.i
24 cond_next.i: ; preds = %mp_unexp_mp2d.exit.i
25 %tmp22.i = sdiv i32 0, 2 ; <i32> [#uses=2]
26 br i1 %foo, label %cond_true29.i, label %cond_next36.i
28 cond_true29.i: ; preds = %cond_next.i
31 cond_next36.i: ; preds = %cond_next.i
32 store i32 %tmp22.i, i32* null, align 4
33 %tmp8.i14.i = select i1 %foo, i32 1, i32 0 ; <i32> [#uses=1]
36 bb.i28.i: ; preds = %bb.i28.i, %cond_next36.i
37 %j.0.reg2mem.0.i16.i = phi i32 [ 0, %cond_next36.i ], [ %indvar.next39.i, %bb.i28.i ] ; <i32> [#uses=2]
38 %din_addr.1.reg2mem.0.i17.i = phi double [ 0.000000e+00, %cond_next36.i ], [ %tmp16.i25.i, %bb.i28.i ] ; <double> [#uses=1]
39 %tmp1.i18.i = fptosi double %din_addr.1.reg2mem.0.i17.i to i32 ; <i32> [#uses=2]
40 %tmp4.i19.i = icmp slt i32 %tmp1.i18.i, %radix ; <i1> [#uses=1]
41 %x.0.i21.i = select i1 %tmp4.i19.i, i32 %tmp1.i18.i, i32 0 ; <i32> [#uses=1]
42 %tmp41.sum.i = add i32 %j.0.reg2mem.0.i16.i, 2 ; <i32> [#uses=0]
43 %tmp1213.i23.i = sitofp i32 %x.0.i21.i to double ; <double> [#uses=1]
44 %tmp15.i24.i = fsub double 0.000000e+00, %tmp1213.i23.i ; <double> [#uses=1]
45 %tmp16.i25.i = fmul double 0.000000e+00, %tmp15.i24.i ; <double> [#uses=1]
46 %indvar.next39.i = add i32 %j.0.reg2mem.0.i16.i, 2 ; <i32> [#uses=2]
47 %exitcond40.i = icmp eq i32 %indvar.next39.i, %tmp8.i14.i ; <i1> [#uses=1]
48 br i1 %exitcond40.i, label %mp_unexp_d2mp.exit29.i, label %bb.i28.i
50 mp_unexp_d2mp.exit29.i: ; preds = %bb.i28.i
51 %tmp46.i = sub i32 0, %tmp22.i ; <i32> [#uses=1]
52 store i32 %tmp46.i, i32* null, align 4
53 br i1 %exitcond40.i, label %bb.i.i, label %mp_sqrt_init.exit
55 bb.i.i: ; preds = %bb.i.i, %mp_unexp_d2mp.exit29.i
58 mp_sqrt_init.exit: ; preds = %mp_unexp_d2mp.exit29.i
59 tail call fastcc void @mp_mul_csqu( i32 0, double* %tmp1fft )
60 tail call fastcc void @rdft( i32 0, i32 -1, double* null, i32* %ip, double* %w )
61 tail call fastcc void @mp_mul_d2i( i32 0, i32 %radix, i32 0, double* %tmp1fft, i32* %tmp2 )
62 br i1 %exitcond40.i, label %cond_false.i, label %cond_true36.i
64 cond_true36.i: ; preds = %mp_sqrt_init.exit
67 cond_false.i: ; preds = %mp_sqrt_init.exit
68 tail call fastcc void @mp_round( i32 0, i32 %radix, i32 0, i32* %out )
69 tail call fastcc void @mp_add( i32 0, i32 %radix, i32* %tmp1, i32* %tmp2, i32* %tmp1 )
70 tail call fastcc void @mp_sub( i32 0, i32 %radix, i32* %in, i32* %tmp2, i32* %tmp2 )
71 tail call fastcc void @mp_round( i32 0, i32 %radix, i32 0, i32* %tmp1 )
72 tail call fastcc void @mp_mul_d2i( i32 0, i32 %radix, i32 %tmp7.i3, double* %tmp2fft, i32* %tmp2 )
76 declare fastcc void @mp_add(i32, i32, i32*, i32*, i32*)
78 declare fastcc void @mp_sub(i32, i32, i32*, i32*, i32*)
80 declare fastcc void @mp_round(i32, i32, i32, i32*)
82 declare fastcc void @mp_mul_csqu(i32, double*)
84 declare fastcc void @mp_mul_d2i(i32, i32, i32, double*, i32*)