126 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py2; RUN: llc < %s -mtriple=i686-- -O0 -fast-isel=false -optimize-regalloc -regalloc=basic | FileCheck %s3; PR23434 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 ptr] }8 %struct.VEC_basic_block_gc = type { %struct.VEC_basic_block_base }9 %struct.VEC_edge_base = type { i32, i32, [1 x ptr] }10 %struct.VEC_edge_gc = type { %struct.VEC_edge_base }11 %struct.VEC_rtx_base = type { i32, i32, [1 x ptr] }12 %struct.VEC_rtx_gc = type { %struct.VEC_rtx_base }13 %struct.VEC_temp_slot_p_base = type { i32, i32, [1 x ptr] }14 %struct.VEC_temp_slot_p_gc = type { %struct.VEC_temp_slot_p_base }15 %struct.VEC_tree_base = type { i32, i32, [1 x ptr] }16 %struct.VEC_tree_gc = type { %struct.VEC_tree_base }17 %struct.__sbuf = type { ptr, i32 }18 %struct._obstack_chunk = type { ptr, ptr, [4 x i8] }19 %struct.basic_block_def = type { ptr, ptr, ptr, ptr, ptr, [2 x ptr], ptr, ptr, %struct.basic_block_il_dependent, ptr, ptr, i64, i32, i32, i32, i32 }20 %struct.basic_block_il_dependent = type { ptr }21 %struct.bitmap_element_def = type { ptr, ptr, i32, [4 x i32] }22 %struct.bitmap_head_def = type { ptr, ptr, i32, ptr }23 %struct.bitmap_obstack = type { ptr, ptr, %struct.obstack }24 %struct.block_symbol = type { [3 x %struct.cfg_stats_d], ptr, i64 }25 %struct.cfg_stats_d = type { i32 }26 %struct.control_flow_graph = type { ptr, ptr, ptr, i32, i32, i32, ptr, i32 }27 %struct.def_optype_d = type { ptr, ptr }28 %struct.edge_def = type { ptr, ptr, %struct.edge_def_insns, ptr, ptr, i32, i32, i64, i32 }29 %struct.edge_def_insns = type { ptr }30 %struct.edge_prediction = type { ptr, ptr, i32, i32 }31 %struct.eh_status = type opaque32 %struct.emit_status = type { i32, i32, ptr, ptr, ptr, i32, %struct.__sbuf, i32, ptr, ptr }33 %struct.et_node = type opaque34 %struct.expr_status = type { i32, i32, i32, ptr, ptr, ptr }35 %struct.function = type { ptr, ptr, ptr, ptr, ptr, ptr, ptr, i32, i32, i32, i32, ptr, %struct.CUMULATIVE_ARGS, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, i8, i32, i64, ptr, ptr, ptr, ptr, ptr, ptr, i32, i32, i32, i32, ptr, i32, i32, ptr, ptr, ptr, i32, i32, i32, %struct.__sbuf, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, i8, i8, i8, i8, i8, i8 }36 %struct.htab = type { ptr, ptr, ptr, ptr, i32, i32, i32, i32, i32, ptr, ptr, ptr, ptr, ptr, i32 }37 %struct.initial_value_struct = type opaque38 %struct.lang_decl = type opaque39 %struct.language_function = type opaque40 %struct.loop = type { i32, ptr, ptr, %llvm.dbg.anchor.type, i32, i32, i32, i32, ptr, i32, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, i32 }41 %struct.machine_function = type opaque42 %struct.maydef_optype_d = type { ptr, ptr, ptr, %struct.ssa_use_operand_d }43 %struct.nb_iter_bound = type { ptr, ptr, ptr }44 %struct.object_block = type { ptr, i32, i64, ptr, ptr }45 %struct.obstack = type { i32, ptr, ptr, ptr, ptr, i32, i32, ptr, ptr, ptr, i8 }46 %struct.rtl_bb_info = type { ptr, ptr, ptr, ptr, ptr, ptr, i32 }47 %struct.rtx_def = type { i16, i8, i8, %struct.u }48 %struct.section = type { %struct.unnamed_section }49 %struct.sequence_stack = type { ptr, ptr, ptr }50 %struct.ssa_use_operand_d = type { ptr, ptr, ptr, ptr }51 %struct.stmt_ann_d = type { %struct.tree_ann_common_d, i8, ptr, %struct.stmt_operands_d, ptr, i32, ptr }52 %struct.stmt_operands_d = type { ptr, ptr, ptr, ptr, ptr }53 %struct.temp_slot = type opaque54 %struct.tree_ann_common_d = type { i32, ptr, ptr }55 %struct.tree_ann_d = type { %struct.stmt_ann_d }56 %struct.tree_common = type { ptr, ptr, ptr, i8, i8, i8, i8, i8 }57 %struct.tree_decl_common = type { %struct.tree_decl_minimal, ptr, i8, i8, i8, i8, i8, i32, %struct.tree_decl_u1, ptr, ptr, ptr, ptr, i64, ptr }58 %struct.tree_decl_minimal = type { %struct.tree_common, %struct.__sbuf, i32, ptr, ptr }59 %struct.tree_decl_non_common = type { %struct.tree_decl_with_vis, ptr, ptr, ptr, ptr }60 %struct.tree_decl_u1 = type { i64 }61 %struct.tree_decl_with_rtl = type { %struct.tree_decl_common, ptr, i32 }62 %struct.tree_decl_with_vis = type { %struct.tree_decl_with_rtl, ptr, ptr, i8, i8, i8 }63 %struct.tree_function_decl = type { %struct.tree_decl_non_common, i8, i8, i64, ptr }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, ptr, ptr, ptr }67 %struct.use_optype_d = type { ptr, %struct.ssa_use_operand_d }68 %struct.var_refs_queue = type { ptr, i32, i32, ptr }69 %struct.varasm_status = type opaque70 %struct.vuse_optype_d = type { ptr, ptr, %struct.ssa_use_operand_d }71@llvm.used = appending global [1 x ptr] [ ptr @tree_redirect_edge_and_branch ], section "llvm.metadata" ; <ptr> [#uses=0]72 73define ptr @tree_redirect_edge_and_branch(ptr %e1, ptr %dest2) nounwind {74; CHECK-LABEL: tree_redirect_edge_and_branch:75; CHECK: # %bb.0: # %entry76; CHECK-NEXT: pushl %esi77; CHECK-NEXT: movb $1, %cl78; CHECK-NEXT: xorl %edx, %edx79; CHECK-NEXT: # implicit-def: $esi80; CHECK-NEXT: jmp .LBB0_281; CHECK-NEXT: .LBB0_1: # %bb48382; CHECK-NEXT: # in Loop: Header=BB0_2 Depth=183; CHECK-NEXT: movl 0, %edx84; CHECK-NEXT: xorl %ecx, %ecx85; CHECK-NEXT: movl %eax, %esi86; CHECK-NEXT: jmp .LBB0_287; CHECK-NEXT: .LBB0_2: # %bb49788; CHECK-NEXT: # =>This Inner Loop Header: Depth=189; CHECK-NEXT: movl %edx, %eax90; CHECK-NEXT: testb $1, %cl91; CHECK-NEXT: jne .LBB0_192; CHECK-NEXT: jmp .LBB0_393; CHECK-NEXT: .LBB0_3: # %bb50294; CHECK-NEXT: testb $1, %cl95; CHECK-NEXT: je .LBB0_596; CHECK-NEXT: jmp .LBB0_497; CHECK-NEXT: .LBB0_4: # %bb50798; CHECK-NEXT: movl $0, (%esi)99; CHECK-NEXT: jmp .LBB0_5100; CHECK-NEXT: .LBB0_5: # %bb841101entry:102 br label %bb497103 104bb483: ; preds = %bb497105 %tmp496 = load ptr, ptr null, align 4 ; <ptr> [#uses=1]106 br label %bb497107 108bb497: ; preds = %bb483, %entry109 %cases.0 = phi ptr [ %tmp496, %bb483 ], [ null, %entry ] ; <ptr> [#uses=1]110 %last.0 = phi ptr [ %cases.0, %bb483 ], [ undef, %entry ] ; <ptr> [#uses=1]111 %foo = phi i1 [ 0, %bb483 ], [ 1, %entry ]112 br i1 %foo, label %bb483, label %bb502113 114bb502: ; preds = %bb497115 br i1 %foo, label %bb507, label %bb841116 117bb507: ; preds = %bb502118 %tmp517 = getelementptr %struct.tree_node, ptr %last.0, i32 0, i32 0 ; <ptr> [#uses=1]119 %tmp519 = getelementptr %struct.tree_common, ptr %tmp517, i32 0, i32 0 ; <ptr> [#uses=1]120 store ptr null, ptr %tmp519, align 4121 br label %bb841122 123bb841: ; preds = %bb507, %bb502124 unreachable125}126