113 lines · plain
1; RUN: llc < %s 2%struct.CUMULATIVE_ARGS = type { i32, i32, i32, i32, i32, i32, i32, i32, i32, i32, i32, i32, i32, i32 }3 %struct.VEC_edge = type { i32, i32, [1 x ptr] }4 %struct._obstack_chunk = type { ptr, ptr, [4 x i8] }5 %struct.basic_block_def = type { ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, [2 x ptr], ptr, ptr, ptr, ptr, i64, i32, i32, i32, i32 }6 %struct.bb_ann_d = type { ptr, i8, ptr }7 %struct.bitmap_element_def = type { ptr, ptr, i32, [4 x i32] }8 %struct.bitmap_head_def = type { ptr, ptr, i32, ptr }9 %struct.bitmap_obstack = type { ptr, ptr, %struct.obstack }10 %struct.cost_pair = type { ptr, i32, ptr }11 %struct.dataflow_d = type { ptr, [2 x ptr] }12 %struct.def_operand_ptr = type { ptr }13 %struct.def_optype_d = type { i32, [1 x %struct.def_operand_ptr] }14 %struct.edge_def = type { ptr, ptr, %struct.edge_def_insns, ptr, ptr, i32, i32, i64, i32 }15 %struct.edge_def_insns = type { ptr }16 %struct.edge_prediction = type { ptr, ptr, i32, i32 }17 %struct.eh_status = type opaque18 %struct.emit_status = type { i32, i32, ptr, ptr, ptr, i32, %struct.location_t, i32, ptr, ptr }19 %struct.et_node = type opaque20 %struct.expr_status = type { i32, i32, i32, ptr, ptr, ptr }21 %struct.function = type { ptr, ptr, 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, i32, ptr, i32, i32, ptr, ptr, i32, i32, i32, ptr, i32, i32, i1, i1, ptr, ptr, i32, i32, i32, i32, %struct.location_t, ptr, ptr, i8, i8, i8 }22 %struct.htab = type { ptr, ptr, ptr, ptr, i32, i32, i32, i32, i32, ptr, ptr, ptr, ptr, ptr, i32 }23 %struct.initial_value_struct = type opaque24 %struct.iv = type { ptr, ptr, ptr, ptr, i1, i1, i32 }25 %struct.iv_cand = type { i32, i1, i32, ptr, ptr, ptr, ptr, i32 }26 %struct.iv_use = type { i32, i32, ptr, ptr, ptr, ptr, i32, ptr, ptr }27 %struct.ivopts_data = type { ptr, ptr, i32, ptr, ptr, i32, ptr, ptr, ptr, i1 }28 %struct.lang_decl = type opaque29 %struct.language_function = type opaque30 %struct.location_t = type { ptr, i32 }31 %struct.loop = type { i32, ptr, ptr, ptr, %struct.lpt_decision, i32, i32, ptr, i32, ptr, ptr, i32, ptr, i32, ptr, i32, ptr, i32, ptr, i32, ptr, ptr, ptr, ptr, i32, ptr, ptr, ptr, ptr, ptr, ptr, ptr, i32, ptr, ptr, ptr, ptr, i1 }32 %struct.lpt_decision = type { i32, i32 }33 %struct.machine_function = type { ptr, ptr, ptr, i32, i32, i32, i32, i32 }34 %struct.nb_iter_bound = type { ptr, ptr, ptr, ptr }35 %struct.obstack = type { i32, ptr, ptr, ptr, ptr, i32, i32, ptr, ptr, ptr, i8 }36 %struct.reorder_block_def = type { ptr, ptr, ptr, ptr, ptr, i32, i32, i32 }37 %struct.rtvec_def = type { i32, [1 x ptr] }38 %struct.rtx_def = type { i16, i8, i8, %struct.u }39 %struct.sequence_stack = type { ptr, ptr, ptr }40 %struct.simple_bitmap_def = type { i32, i32, i32, [1 x i64] }41 %struct.stack_local_entry = type opaque42 %struct.stmt_ann_d = type { %struct.tree_ann_common_d, i8, ptr, %struct.stmt_operands_d, ptr, ptr, i32 }43 %struct.stmt_operands_d = type { ptr, ptr, ptr, ptr, ptr }44 %struct.temp_slot = type opaque45 %struct.tree_ann_common_d = type { i32, ptr, ptr }46 %struct.tree_ann_d = type { %struct.stmt_ann_d }47 %struct.tree_common = type { ptr, ptr, ptr, i8, i8, i8, i8, i8 }48 %struct.tree_decl = type { %struct.tree_common, %struct.location_t, i32, ptr, i8, i8, i8, i8, i8, i8, i8, i32, %struct.tree_decl_u1, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, i32, %struct.tree_decl_u2, ptr, ptr, i64, ptr }49 %struct.tree_decl_u1 = type { i64 }50 %struct.tree_decl_u2 = type { ptr }51 %struct.tree_node = type { %struct.tree_decl }52 %struct.u = type { [1 x i64] }53 %struct.v_def_use_operand_type_t = type { ptr, ptr }54 %struct.v_may_def_optype_d = type { i32, [1 x %struct.v_def_use_operand_type_t] }55 %struct.var_refs_queue = type { ptr, i32, i32, ptr }56 %struct.varasm_status = type opaque57 %struct.varray_head_tag = type { i32, i32, i32, ptr, %struct.u }58 %struct.version_info = type { ptr, ptr, i1, i32, i1 }59 %struct.vuse_optype_d = type { i32, [1 x ptr] }60 61define i1 @determine_use_iv_cost(ptr %data, ptr %use, ptr %cand) {62entry:63 switch i32 0, label %bb91 [64 i32 0, label %bb65 i32 1, label %bb666 i32 3, label %cond_next13567 ]68 69bb: ; preds = %entry70 ret i1 false71 72bb6: ; preds = %entry73 br i1 false, label %bb87, label %cond_next2774 75cond_next27: ; preds = %bb676 br i1 false, label %cond_true30, label %cond_next5577 78cond_true30: ; preds = %cond_next2779 br i1 false, label %cond_next41, label %cond_true3580 81cond_true35: ; preds = %cond_true3082 ret i1 false83 84cond_next41: ; preds = %cond_true3085 %tmp44 = call i32 @force_var_cost( ptr %data, ptr null, ptr null ) ; <i32> [#uses=2]86 %tmp46 = udiv i32 %tmp44, 5 ; <i32> [#uses=1]87 call void @set_use_iv_cost( ptr %data, ptr %use, ptr %cand, i32 %tmp46, ptr null )88 %tmp44.off = add i32 %tmp44, -50000000 ; <i32> [#uses=1]89 %tmp52 = icmp ugt i32 %tmp44.off, 4 ; <i1> [#uses=1]90 %tmp52.upgrd.1 = zext i1 %tmp52 to i32 ; <i32> [#uses=1]91 br label %bb8792 93cond_next55: ; preds = %cond_next2794 ret i1 false95 96bb87: ; preds = %cond_next41, %bb697 %tmp2.0 = phi i32 [ %tmp52.upgrd.1, %cond_next41 ], [ 1, %bb6 ] ; <i32> [#uses=0]98 ret i1 false99 100bb91: ; preds = %entry101 ret i1 false102 103cond_next135: ; preds = %entry104 %tmp193 = call i1 @determine_use_iv_cost_generic( ptr %data, ptr %use, ptr %cand ) ; <i1> [#uses=0]105 ret i1 false106}107 108declare void @set_use_iv_cost(ptr, ptr, ptr, i32, ptr)109 110declare i32 @force_var_cost(ptr, ptr, ptr)111 112declare i1 @determine_use_iv_cost_generic(ptr, ptr, ptr)113