1 ; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
2 ; RUN: llc < %s -mtriple=i686-- -O0 -fast-isel=false -optimize-regalloc -regalloc=basic | FileCheck %s
5 %llvm.dbg.anchor.type = type { i32, i32 }
6 %struct.CUMULATIVE_ARGS = type { i32, i32, i32, i32, i32, i32, i32, i32, i32, i32, i32, i32 }
7 %struct.VEC_basic_block_base = type { i32, i32, [1 x %struct.basic_block_def*] }
8 %struct.VEC_basic_block_gc = type { %struct.VEC_basic_block_base }
9 %struct.VEC_edge_base = type { i32, i32, [1 x %struct.edge_def*] }
10 %struct.VEC_edge_gc = type { %struct.VEC_edge_base }
11 %struct.VEC_rtx_base = type { i32, i32, [1 x %struct.rtx_def*] }
12 %struct.VEC_rtx_gc = type { %struct.VEC_rtx_base }
13 %struct.VEC_temp_slot_p_base = type { i32, i32, [1 x %struct.temp_slot*] }
14 %struct.VEC_temp_slot_p_gc = type { %struct.VEC_temp_slot_p_base }
15 %struct.VEC_tree_base = type { i32, i32, [1 x %struct.tree_node*] }
16 %struct.VEC_tree_gc = type { %struct.VEC_tree_base }
17 %struct.__sbuf = type { i8*, i32 }
18 %struct._obstack_chunk = type { i8*, %struct._obstack_chunk*, [4 x i8] }
19 %struct.basic_block_def = type { %struct.tree_node*, %struct.VEC_edge_gc*, %struct.VEC_edge_gc*, i8*, %struct.loop*, [2 x %struct.et_node*], %struct.basic_block_def*, %struct.basic_block_def*, %struct.basic_block_il_dependent, %struct.tree_node*, %struct.edge_prediction*, i64, i32, i32, i32, i32 }
20 %struct.basic_block_il_dependent = type { %struct.rtl_bb_info* }
21 %struct.bitmap_element_def = type { %struct.bitmap_element_def*, %struct.bitmap_element_def*, i32, [4 x i32] }
22 %struct.bitmap_head_def = type { %struct.bitmap_element_def*, %struct.bitmap_element_def*, i32, %struct.bitmap_obstack* }
23 %struct.bitmap_obstack = type { %struct.bitmap_element_def*, %struct.bitmap_head_def*, %struct.obstack }
24 %struct.block_symbol = type { [3 x %struct.cfg_stats_d], %struct.object_block*, i64 }
25 %struct.cfg_stats_d = type { i32 }
26 %struct.control_flow_graph = type { %struct.basic_block_def*, %struct.basic_block_def*, %struct.VEC_basic_block_gc*, i32, i32, i32, %struct.VEC_basic_block_gc*, i32 }
27 %struct.def_optype_d = type { %struct.def_optype_d*, %struct.tree_node** }
28 %struct.edge_def = type { %struct.basic_block_def*, %struct.basic_block_def*, %struct.edge_def_insns, i8*, %struct.__sbuf*, i32, i32, i64, i32 }
29 %struct.edge_def_insns = type { %struct.rtx_def* }
30 %struct.edge_prediction = type { %struct.edge_prediction*, %struct.edge_def*, i32, i32 }
31 %struct.eh_status = type opaque
32 %struct.emit_status = type { i32, i32, %struct.rtx_def*, %struct.rtx_def*, %struct.sequence_stack*, i32, %struct.__sbuf, i32, i8*, %struct.rtx_def** }
33 %struct.et_node = type opaque
34 %struct.expr_status = type { i32, i32, i32, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def* }
35 %struct.function = type { %struct.eh_status*, %struct.expr_status*, %struct.emit_status*, %struct.varasm_status*, %struct.control_flow_graph*, %struct.tree_node*, %struct.function*, i32, i32, i32, i32, %struct.rtx_def*, %struct.CUMULATIVE_ARGS, %struct.rtx_def*, %struct.rtx_def*, %struct.initial_value_struct*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, i8, i32, i64, %struct.tree_node*, %struct.tree_node*, %struct.rtx_def*, %struct.VEC_temp_slot_p_gc*, %struct.temp_slot*, %struct.var_refs_queue*, i32, i32, i32, i32, %struct.machine_function*, i32, i32, %struct.language_function*, %struct.htab*, %struct.rtx_def*, i32, i32, i32, %struct.__sbuf, %struct.VEC_tree_gc*, %struct.tree_node*, i8*, i8*, i8*, i8*, i8*, %struct.tree_node*, i8, i8, i8, i8, i8, i8 }
36 %struct.htab = type { i32 (i8*)*, i32 (i8*, i8*)*, void (i8*)*, i8**, i32, i32, i32, i32, i32, i8* (i32, i32)*, void (i8*)*, i8*, i8* (i8*, i32, i32)*, void (i8*, i8*)*, i32 }
37 %struct.initial_value_struct = type opaque
38 %struct.lang_decl = type opaque
39 %struct.language_function = type opaque
40 %struct.loop = type { i32, %struct.basic_block_def*, %struct.basic_block_def*, %llvm.dbg.anchor.type, i32, i32, i32, i32, %struct.loop**, i32, %struct.loop*, %struct.loop*, %struct.loop*, %struct.loop*, i8*, %struct.tree_node*, %struct.tree_node*, %struct.nb_iter_bound*, %struct.edge_def*, i32 }
41 %struct.machine_function = type opaque
42 %struct.maydef_optype_d = type { %struct.maydef_optype_d*, %struct.tree_node*, %struct.tree_node*, %struct.ssa_use_operand_d }
43 %struct.nb_iter_bound = type { %struct.tree_node*, %struct.tree_node*, %struct.nb_iter_bound* }
44 %struct.object_block = type { %struct.section*, i32, i64, %struct.VEC_rtx_gc*, %struct.VEC_rtx_gc* }
45 %struct.obstack = type { i32, %struct._obstack_chunk*, i8*, i8*, i8*, i32, i32, %struct._obstack_chunk* (i8*, i32)*, void (i8*, %struct._obstack_chunk*)*, i8*, i8 }
46 %struct.rtl_bb_info = type { %struct.rtx_def*, %struct.rtx_def*, %struct.bitmap_head_def*, %struct.bitmap_head_def*, %struct.rtx_def*, %struct.rtx_def*, i32 }
47 %struct.rtx_def = type { i16, i8, i8, %struct.u }
48 %struct.section = type { %struct.unnamed_section }
49 %struct.sequence_stack = type { %struct.rtx_def*, %struct.rtx_def*, %struct.sequence_stack* }
50 %struct.ssa_use_operand_d = type { %struct.ssa_use_operand_d*, %struct.ssa_use_operand_d*, %struct.tree_node*, %struct.tree_node** }
51 %struct.stmt_ann_d = type { %struct.tree_ann_common_d, i8, %struct.basic_block_def*, %struct.stmt_operands_d, %struct.bitmap_head_def*, i32, i8* }
52 %struct.stmt_operands_d = type { %struct.def_optype_d*, %struct.use_optype_d*, %struct.maydef_optype_d*, %struct.vuse_optype_d*, %struct.maydef_optype_d* }
53 %struct.temp_slot = type opaque
54 %struct.tree_ann_common_d = type { i32, i8*, %struct.tree_node* }
55 %struct.tree_ann_d = type { %struct.stmt_ann_d }
56 %struct.tree_common = type { %struct.tree_node*, %struct.tree_node*, %struct.tree_ann_d*, i8, i8, i8, i8, i8 }
57 %struct.tree_decl_common = type { %struct.tree_decl_minimal, %struct.tree_node*, i8, i8, i8, i8, i8, i32, %struct.tree_decl_u1, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, i64, %struct.lang_decl* }
58 %struct.tree_decl_minimal = type { %struct.tree_common, %struct.__sbuf, i32, %struct.tree_node*, %struct.tree_node* }
59 %struct.tree_decl_non_common = type { %struct.tree_decl_with_vis, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node* }
60 %struct.tree_decl_u1 = type { i64 }
61 %struct.tree_decl_with_rtl = type { %struct.tree_decl_common, %struct.rtx_def*, i32 }
62 %struct.tree_decl_with_vis = type { %struct.tree_decl_with_rtl, %struct.tree_node*, %struct.tree_node*, i8, i8, i8 }
63 %struct.tree_function_decl = type { %struct.tree_decl_non_common, i8, i8, i64, %struct.function* }
64 %struct.tree_node = type { %struct.tree_function_decl }
65 %struct.u = type { %struct.block_symbol }
66 %struct.unnamed_section = type { %struct.cfg_stats_d, void (i8*)*, i8*, %struct.section* }
67 %struct.use_optype_d = type { %struct.use_optype_d*, %struct.ssa_use_operand_d }
68 %struct.var_refs_queue = type { %struct.rtx_def*, i32, i32, %struct.var_refs_queue* }
69 %struct.varasm_status = type opaque
70 %struct.vuse_optype_d = type { %struct.vuse_optype_d*, %struct.tree_node*, %struct.ssa_use_operand_d }
71 @llvm.used = appending global [1 x i8*] [ i8* bitcast (%struct.edge_def* (%struct.edge_def*, %struct.basic_block_def*)* @tree_redirect_edge_and_branch to i8*) ], section "llvm.metadata" ; <[1 x i8*]*> [#uses=0]
73 define %struct.edge_def* @tree_redirect_edge_and_branch(%struct.edge_def* %e1, %struct.basic_block_def* %dest2) nounwind {
74 ; CHECK-LABEL: tree_redirect_edge_and_branch:
75 ; CHECK: # %bb.0: # %entry
76 ; CHECK-NEXT: pushl %esi
77 ; CHECK-NEXT: movb $1, %cl
78 ; CHECK-NEXT: xorl %edx, %edx
79 ; CHECK-NEXT: # implicit-def: $esi
80 ; CHECK-NEXT: jmp .LBB0_2
81 ; CHECK-NEXT: .LBB0_1: # %bb483
82 ; CHECK-NEXT: # in Loop: Header=BB0_2 Depth=1
83 ; CHECK-NEXT: movl 0, %edx
84 ; CHECK-NEXT: xorl %ecx, %ecx
85 ; CHECK-NEXT: movl %eax, %esi
86 ; CHECK-NEXT: jmp .LBB0_2
87 ; CHECK-NEXT: .LBB0_2: # %bb497
88 ; CHECK-NEXT: # =>This Inner Loop Header: Depth=1
89 ; CHECK-NEXT: movl %edx, %eax
90 ; CHECK-NEXT: testb $1, %cl
91 ; CHECK-NEXT: jne .LBB0_1
92 ; CHECK-NEXT: jmp .LBB0_3
93 ; CHECK-NEXT: .LBB0_3: # %bb502
94 ; CHECK-NEXT: testb $1, %cl
95 ; CHECK-NEXT: je .LBB0_5
96 ; CHECK-NEXT: jmp .LBB0_4
97 ; CHECK-NEXT: .LBB0_4: # %bb507
98 ; CHECK-NEXT: movl $0, (%esi)
99 ; CHECK-NEXT: jmp .LBB0_5
100 ; CHECK-NEXT: .LBB0_5: # %bb841
104 bb483: ; preds = %bb497
105 %tmp496 = load %struct.tree_node*, %struct.tree_node** null, align 4 ; <%struct.tree_node*> [#uses=1]
108 bb497: ; preds = %bb483, %entry
109 %cases.0 = phi %struct.tree_node* [ %tmp496, %bb483 ], [ null, %entry ] ; <%struct.tree_node*> [#uses=1]
110 %last.0 = phi %struct.tree_node* [ %cases.0, %bb483 ], [ undef, %entry ] ; <%struct.tree_node*> [#uses=1]
111 %foo = phi i1 [ 0, %bb483 ], [ 1, %entry ]
112 br i1 %foo, label %bb483, label %bb502
114 bb502: ; preds = %bb497
115 br i1 %foo, label %bb507, label %bb841
117 bb507: ; preds = %bb502
118 %tmp517 = getelementptr %struct.tree_node, %struct.tree_node* %last.0, i32 0, i32 0 ; <%struct.tree_function_decl*> [#uses=1]
119 %tmp517518 = bitcast %struct.tree_function_decl* %tmp517 to %struct.tree_common* ; <%struct.tree_common*> [#uses=1]
120 %tmp519 = getelementptr %struct.tree_common, %struct.tree_common* %tmp517518, i32 0, i32 0 ; <%struct.tree_node**> [#uses=1]
121 store %struct.tree_node* null, %struct.tree_node** %tmp519, align 4
124 bb841: ; preds = %bb507, %bb502