1 ; RUN: llc < %s 2 ; Infinite loop in the dag combiner, reduced from 176.gcc. 3 %struct._obstack_chunk = type { i8*, %struct._obstack_chunk*, [4 x i8] } 4 %struct.anon = type { i32 } 5 %struct.lang_decl = type opaque 6 %struct.lang_type = type { i32, [1 x %struct.tree_node*] } 7 %struct.obstack = type { i32, %struct._obstack_chunk*, i8*, i8*, i8*, i32, i32, %struct._obstack_chunk* (...)*, void (...)*, i8*, i8 } 8 %struct.rtx_def = type { i16, i8, i8, [1 x %struct.anon] } 9 %struct.tree_common = type { %struct.tree_node*, %struct.tree_node*, i8, i8, i8, i8 } 10 %struct.tree_decl = type { [12 x i8], i8*, i32, %struct.tree_node*, i32, i8, i8, i8, i8, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.rtx_def*, %struct.anon, { %struct.rtx_def* }, %struct.tree_node*, %struct.lang_decl* } 11 %struct.tree_list = type { [12 x i8], %struct.tree_node*, %struct.tree_node* } 12 %struct.tree_node = type { %struct.tree_decl } 13 %struct.tree_type = type { [12 x i8], %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, i32, i8, i8, i8, i8, i32, %struct.tree_node*, %struct.tree_node*, %struct.anon, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.obstack*, %struct.lang_type* } 14 @void_type_node = external global %struct.tree_node* ; <%struct.tree_node**> [#uses=1] 15 @char_type_node = external global %struct.tree_node* ; <%struct.tree_node**> [#uses=1] 16 @short_integer_type_node = external global %struct.tree_node* ; <%struct.tree_node**> [#uses=1] 17 @short_unsigned_type_node = external global %struct.tree_node* ; <%struct.tree_node**> [#uses=1] 18 @float_type_node = external global %struct.tree_node* ; <%struct.tree_node**> [#uses=1] 19 @signed_char_type_node = external global %struct.tree_node* ; <%struct.tree_node**> [#uses=1] 20 @unsigned_char_type_node = external global %struct.tree_node* ; <%struct.tree_node**> [#uses=1] 21 22 define fastcc i32 @self_promoting_args_p(%struct.tree_node* %parms) { 23 entry: 24 %tmp915 = icmp eq %struct.tree_node* %parms, null ; <i1> [#uses=1] 25 br i1 %tmp915, label %return, label %cond_true92.preheader 26 27 cond_true: ; preds = %cond_true92 28 %tmp9.not = icmp ne %struct.tree_node* %tmp2, %tmp7 ; <i1> [#uses=1] 29 %tmp14 = icmp eq %struct.tree_node* %tmp2, null ; <i1> [#uses=1] 30 %bothcond = or i1 %tmp9.not, %tmp14 ; <i1> [#uses=1] 31 br i1 %bothcond, label %return, label %cond_next18 32 33 cond_next12: ; preds = %cond_true92 34 %tmp14.old = icmp eq %struct.tree_node* %tmp2, null ; <i1> [#uses=1] 35 br i1 %tmp14.old, label %return, label %cond_next18 36 37 cond_next18: ; preds = %cond_next12, %cond_true 38 %tmp20 = bitcast %struct.tree_node* %tmp2 to %struct.tree_type* ; <%struct.tree_type*> [#uses=1] 39 %tmp21 = getelementptr %struct.tree_type* %tmp20, i32 0, i32 17 ; <%struct.tree_node**> [#uses=1] 40 %tmp22 = load %struct.tree_node** %tmp21 ; <%struct.tree_node*> [#uses=6] 41 %tmp24 = icmp eq %struct.tree_node* %tmp22, %tmp23 ; <i1> [#uses=1] 42 br i1 %tmp24, label %return, label %cond_next28 43 44 cond_next28: ; preds = %cond_next18 45 %tmp30 = bitcast %struct.tree_node* %tmp2 to %struct.tree_common* ; <%struct.tree_common*> [#uses=1] 46 %tmp = getelementptr %struct.tree_common* %tmp30, i32 0, i32 2 ; <i8*> [#uses=1] 47 %tmp.upgrd.1 = bitcast i8* %tmp to i32* ; <i32*> [#uses=1] 48 %tmp.upgrd.2 = load i32* %tmp.upgrd.1 ; <i32> [#uses=1] 49 %tmp32 = trunc i32 %tmp.upgrd.2 to i8 ; <i8> [#uses=1] 50 %tmp33 = icmp eq i8 %tmp32, 7 ; <i1> [#uses=1] 51 br i1 %tmp33, label %cond_true34, label %cond_next84 52 53 cond_true34: ; preds = %cond_next28 54 %tmp40 = icmp eq %struct.tree_node* %tmp22, %tmp39 ; <i1> [#uses=1] 55 %tmp49 = icmp eq %struct.tree_node* %tmp22, %tmp48 ; <i1> [#uses=1] 56 %bothcond6 = or i1 %tmp40, %tmp49 ; <i1> [#uses=1] 57 %tmp58 = icmp eq %struct.tree_node* %tmp22, %tmp57 ; <i1> [#uses=1] 58 %bothcond7 = or i1 %bothcond6, %tmp58 ; <i1> [#uses=1] 59 %tmp67 = icmp eq %struct.tree_node* %tmp22, %tmp66 ; <i1> [#uses=1] 60 %bothcond8 = or i1 %bothcond7, %tmp67 ; <i1> [#uses=1] 61 %tmp76 = icmp eq %struct.tree_node* %tmp22, %tmp75 ; <i1> [#uses=1] 62 %bothcond9 = or i1 %bothcond8, %tmp76 ; <i1> [#uses=2] 63 %brmerge = or i1 %bothcond9, %tmp.upgrd.6 ; <i1> [#uses=1] 64 %bothcond9.upgrd.3 = zext i1 %bothcond9 to i32 ; <i32> [#uses=1] 65 %.mux = xor i32 %bothcond9.upgrd.3, 1 ; <i32> [#uses=1] 66 br i1 %brmerge, label %return, label %cond_true92 67 68 cond_next84: ; preds = %cond_next28 69 br i1 %tmp.upgrd.6, label %return, label %cond_true92 70 71 cond_true92.preheader: ; preds = %entry 72 %tmp7 = load %struct.tree_node** @void_type_node ; <%struct.tree_node*> [#uses=1] 73 %tmp23 = load %struct.tree_node** @float_type_node ; <%struct.tree_node*> [#uses=1] 74 %tmp39 = load %struct.tree_node** @char_type_node ; <%struct.tree_node*> [#uses=1] 75 %tmp48 = load %struct.tree_node** @signed_char_type_node ; <%struct.tree_node*> [#uses=1] 76 %tmp57 = load %struct.tree_node** @unsigned_char_type_node ; <%struct.tree_node*> [#uses=1] 77 %tmp66 = load %struct.tree_node** @short_integer_type_node ; <%struct.tree_node*> [#uses=1] 78 %tmp75 = load %struct.tree_node** @short_unsigned_type_node ; <%struct.tree_node*> [#uses=1] 79 br label %cond_true92 80 81 cond_true92: ; preds = %cond_true92.preheader, %cond_next84, %cond_true34 82 %t.0.0 = phi %struct.tree_node* [ %parms, %cond_true92.preheader ], [ %tmp6, %cond_true34 ], [ %tmp6, %cond_next84 ] ; <%struct.tree_node*> [#uses=2] 83 %tmp.upgrd.4 = bitcast %struct.tree_node* %t.0.0 to %struct.tree_list* ; <%struct.tree_list*> [#uses=1] 84 %tmp.upgrd.5 = getelementptr %struct.tree_list* %tmp.upgrd.4, i32 0, i32 2 ; <%struct.tree_node**> [#uses=1] 85 %tmp2 = load %struct.tree_node** %tmp.upgrd.5 ; <%struct.tree_node*> [#uses=5] 86 %tmp4 = bitcast %struct.tree_node* %t.0.0 to %struct.tree_common* ; <%struct.tree_common*> [#uses=1] 87 %tmp5 = getelementptr %struct.tree_common* %tmp4, i32 0, i32 0 ; <%struct.tree_node**> [#uses=1] 88 %tmp6 = load %struct.tree_node** %tmp5 ; <%struct.tree_node*> [#uses=3] 89 %tmp.upgrd.6 = icmp eq %struct.tree_node* %tmp6, null ; <i1> [#uses=3] 90 br i1 %tmp.upgrd.6, label %cond_true, label %cond_next12 91 92 return: ; preds = %cond_next84, %cond_true34, %cond_next18, %cond_next12, %cond_true, %entry 93 %retval.0 = phi i32 [ 1, %entry ], [ 1, %cond_next84 ], [ %.mux, %cond_true34 ], [ 0, %cond_next18 ], [ 0, %cond_next12 ], [ 0, %cond_true ] ; <i32> [#uses=1] 94 ret i32 %retval.0 95 } 96
