Home | History | Annotate | Download | only in Thumb2
      1 ; RUN: llc < %s -mtriple=thumbv7-apple-darwin | FileCheck %s
      2 
      3 define void @foo(i32 %X, i32 %Y) {
      4 entry:
      5 ; CHECK: foo:
      6 ; CHECK: it ne
      7 ; CHECK: cmpne
      8 ; CHECK: it hi
      9 ; CHECK: pophi {r7, pc}
     10 	%tmp1 = icmp ult i32 %X, 4		; <i1> [#uses=1]
     11 	%tmp4 = icmp eq i32 %Y, 0		; <i1> [#uses=1]
     12 	%tmp7 = or i1 %tmp4, %tmp1		; <i1> [#uses=1]
     13 	br i1 %tmp7, label %cond_true, label %UnifiedReturnBlock
     14 
     15 cond_true:		; preds = %entry
     16 	%tmp10 = call i32 (...)* @bar( )		; <i32> [#uses=0]
     17 	ret void
     18 
     19 UnifiedReturnBlock:		; preds = %entry
     20 	ret void
     21 }
     22 
     23 declare i32 @bar(...)
     24 
     25 ; FIXME: Need post-ifcvt branch folding to get rid of the extra br at end of BB1.
     26 
     27 	%struct.quad_struct = type { i32, i32, %struct.quad_struct*, %struct.quad_struct*, %struct.quad_struct*, %struct.quad_struct*, %struct.quad_struct* }
     28 
     29 define fastcc i32 @CountTree(%struct.quad_struct* %tree) {
     30 entry:
     31 ; CHECK: CountTree:
     32 ; CHECK: it eq
     33 ; CHECK: cmpeq
     34 ; CHECK: bne
     35 ; CHECK: cmp
     36 ; CHECK: itt eq
     37 ; CHECK: moveq
     38 ; CHECK: popeq
     39 	br label %tailrecurse
     40 
     41 tailrecurse:		; preds = %bb, %entry
     42 	%tmp6 = load %struct.quad_struct** null		; <%struct.quad_struct*> [#uses=1]
     43 	%tmp9 = load %struct.quad_struct** null		; <%struct.quad_struct*> [#uses=2]
     44 	%tmp12 = load %struct.quad_struct** null		; <%struct.quad_struct*> [#uses=1]
     45 	%tmp14 = icmp eq %struct.quad_struct* null, null		; <i1> [#uses=1]
     46 	%tmp17 = icmp eq %struct.quad_struct* %tmp6, null		; <i1> [#uses=1]
     47 	%tmp23 = icmp eq %struct.quad_struct* %tmp9, null		; <i1> [#uses=1]
     48 	%tmp29 = icmp eq %struct.quad_struct* %tmp12, null		; <i1> [#uses=1]
     49 	%bothcond = and i1 %tmp17, %tmp14		; <i1> [#uses=1]
     50 	%bothcond1 = and i1 %bothcond, %tmp23		; <i1> [#uses=1]
     51 	%bothcond2 = and i1 %bothcond1, %tmp29		; <i1> [#uses=1]
     52 	br i1 %bothcond2, label %return, label %bb
     53 
     54 bb:		; preds = %tailrecurse
     55 	%tmp41 = tail call fastcc i32 @CountTree( %struct.quad_struct* %tmp9 )		; <i32> [#uses=0]
     56 	br label %tailrecurse
     57 
     58 return:		; preds = %tailrecurse
     59 	ret i32 0
     60 }
     61 
     62 	%struct.SString = type { i8*, i32, i32 }
     63 
     64 declare void @abort()
     65 
     66 define fastcc void @t1(%struct.SString* %word, i8 signext  %c) {
     67 entry:
     68 ; CHECK: t1:
     69 ; CHECK: it ne
     70 ; CHECK: popne {r7, pc}
     71 	%tmp1 = icmp eq %struct.SString* %word, null		; <i1> [#uses=1]
     72 	br i1 %tmp1, label %cond_true, label %cond_false
     73 
     74 cond_true:		; preds = %entry
     75 	tail call void @abort( )
     76 	unreachable
     77 
     78 cond_false:		; preds = %entry
     79 	ret void
     80 }
     81 
     82 define fastcc void @t2() nounwind {
     83 entry:
     84 ; CHECK: t2:
     85 ; CHECK: cmp r0, #0
     86 ; CHECK: beq
     87 	br i1 undef, label %bb.i.i3, label %growMapping.exit
     88 
     89 bb.i.i3:		; preds = %entry
     90 	unreachable
     91 
     92 growMapping.exit:		; preds = %entry
     93 	unreachable
     94 }
     95