diff options
author | miyuki <miyuki@138bc75d-0d04-0410-961f-82ee72b054a4> | 2015-05-20 19:39:42 +0000 |
---|---|---|
committer | miyuki <miyuki@138bc75d-0d04-0410-961f-82ee72b054a4> | 2015-05-20 19:39:42 +0000 |
commit | f9a00e9e5f0f056b558f8615e3c030d37923ee72 (patch) | |
tree | 710f2e790c32c989e13feab254c623d98b5f103d /gcc/internal-fn.c | |
parent | 39cf4264705f24407d560f8481f167358a038daf (diff) | |
download | gcc-f9a00e9e5f0f056b558f8615e3c030d37923ee72.tar.gz |
Promote types of RTL expressions to more derived ones.
* bb-reorder.c (set_edge_can_fallthru_flag): Use rtx_jump_insn where
feasible.
(fix_up_fall_thru_edges): Likewise.
(fix_crossing_conditional_branches): Likewise. Promote jump targets
from to rtx_insn to rtx_code_label where feasible.
* bt-load.c (move_btr_def): Remove as-a cast of the value returned by
gen_move_insn (returned type changed to rtx_insn).
* builtins.c (expand_errno_check): Fix arguments of
do_compare_rtx_and_jump (now expects rtx_code_label).
(expand_builtin_acc_on_device): Likewise.
* cfgcleanup.c (try_simplify_condjump): Add cast when calling
invert_jump (now exprects rtx_jump_insn).
* cfgexpand.c (label_rtx_for_bb): Promote return type to rtx_code_label.
(construct_init_block): Use rtx_code_label.
* cfgrtl.c (block_label): Promote return type to rtx_code_label.
(try_redirect_by_replacing_jump): Use cast to rtx_jump_insn when
calling redirect_jump.
(patch_jump_insn): Likewise.
(redirect_branch_edge): Likewise.
(force_nonfallthru_and_redirect): Likewise.
(fixup_reorder_chain): Explicitly use rtx_jump_insn instead of rtx_insn
when suitable.
(rtl_lv_add_condition_to_bb): Update call of do_compare_rtx_and_jump.
* cfgrtl.h: Promote return type of block_label to rtx_code_label.
* config/bfin/bfin.c (hwloop_optimize): Fix call of emit_label_before.
* config/i386/i386.c (ix86_emit_cmove): Explicitly use rtx_code_label
to store the value retured by gen_label_rtx.
* config/mips/mips.c (mips16_split_long_branches): Promote rtx_insn to
rtx_jump_insn.
* config/sh/sh.c (gen_far_branch): Likewise. Fix call of invert_jump.
(split_branches): Fix calls of redirect_jump.
* dojump.c (jumpifnot): Promote argument type from rtx to rtx_code_label.
(jumpifnot_1): Likewise.
(jumpif): Likewise.
(jumpif_1): Likewise.
(do_jump_1): Likewise.
(do_jump): Likewise. Use rtx_code_label when feasible.
(do_jump_by_parts_greater_rtx): Likewise.
(do_jump_by_parts_zero_rtx): Likewise.
(do_jump_by_parts_equality_rtx): Likewise.
(do_compare_rtx_and_jump): Likewise.
* dojump.h: Update function prototypes.
* dse.c (emit_inc_dec_insn_before): Remove case (gen_move_insn now
returns rtx_insn).
* emit-rtl.c (emit_jump_insn_before_noloc): Promote return type to
rtx_jump_insn.
(emit_label_before): Likewise.
(emit_jump_insn_after_noloc): Likewise.
(emit_jump_insn_after_setloc): Likewise.
(emit_jump_insn_after): Likewise
(emit_jump_insn_before_setloc): Likewise.
(emit_jump_insn_before): Likewise.
(emit_label_before): Promote return type to rtx_code_label.
(emit_label): Likewise.
* except.c (sjlj_emit_dispatch_table): Use jump_target_rtx.
* explow.c (emit_stack_save): Use gen_move_insn_uncast instead of
gen_move_insn.
(emit_stack_restore): Likewise.
* expmed.c (emit_store_flag_force): Fix calls of do_compare_rtx_and_jump.
(do_cmp_and_jump): Likewise.
* expr.c (expand_expr_real_2): Likewise. Promote some local variables
from rtx to rtx_code_label.
(gen_move_insn_uncast): New function.
* expr.h: Update return type of gen_move_insn (promote to rtx_insn).
* function.c (convert_jumps_to_returns): Fix call of redirect_jump.
* gcse.c (pre_insert_copy_insn): Use rtx_insn instead of rtx.
* ifcvt.c (dead_or_predicable): Use rtx_jump_insn when calling
invert_jump_1 and redirect_jump_1.
* internal-fn.c (expand_arith_overflow_result_store): Fix call of
do_compare_rtx_and_jump.
(expand_addsub_overflow): Likewise.
(expand_neg_overflow): Likewise.
(expand_mul_overflow): Likewise.
* ira.c (split_live_ranges_for_shrink_wrap): Use rtx_insn for
return value of gen_move_insn.
* jump.c (redirect_jump): Promote argument from rtx to rtx_jump_insn.
* loop-doloop.c (add_test): Use rtx_code_label.
(doloop_modify): Likewise.
(doloop_optimize): Likewise.
* loop-unroll.c (compare_and_jump_seq): Promote rtx to rtx_code_label.
* lra-constraints.c (emit_spill_move): Remove cast of value returned
by gen_move_insn.
(inherit_reload_reg): Add cast when calling dump_insn_slim.
(split_reg): Likewise.
* modulo-sched.c (schedule_reg_moves): Remove cast of value returned by
gen_move_insn.
* optabs.c (expand_binop_directly): Remove casts of values returned by
maybe_gen_insn.
(expand_unop_direct): Likewise.
(expand_abs): Likewise.
(maybe_emit_unop_insn): Likewise.
(maybe_gen_insn): Promote return type to rtx_insn.
* optabs.h: Update prototype of maybe_gen_insn.
* postreload-gcse.c (eliminate_partially_redundant_load): Remove
redundant cast.
* recog.c (struct peep2_insn_data): Promote type of insn field to
rtx_insn.
(peep2_reinit_state): Use NULL instead of NULL_RTX.
(peep2_attempt): Remove casts of insn in peep2_insn_data.
(peep2_fill_buffer): Promote argument from rtx to rtx_insn
* recog.h (struct insn_gen_fn): Promote return types of function
pointers and operator ().from rtx to rtx_insn.
* reorg.c (fill_simple_delay_slots): Promote rtx_insn to rtx_jump_insn.
(fill_eager_delay_slots): Likewise.
(relax_delay_slots): Likewise.
(make_return_insns): Likewise.
(dbr_schedule): Likewise.
(optimize_skips): Likewise.
(reorg_redirect_jump): Likewise.
(fill_slots_from_thread): Likewise.
* reorg.h: Update prototypes.
* resource.c (find_dead_or_set_registers): Use dyn_cast to
rtx_jump_insn instead of check. Use it's jump_target method.
* rtl.h (rtx_jump_insn::jump_label): Define new method.
(rtx_jump_insn::jump_target): Define new method.
(rtx_jump_insn::set_jump_target): Define new method.
* rtlanal.c (tablejump_p): Promote type of one local variable.
* sched-deps.c (sched_analyze_2): Promote rtx to rtx_insn_list.
(sched_analyze_insn): Likewise.
* sched-vis.c (print_insn_with_notes): Promote rtx to rtx_insn.
(print_insn): Likewise.
* stmt.c (label_rtx): Promote return type to rtx_insn.
(force_label_rtx): Likewise.
(jump_target_rtx): Define new function.
(expand_label): Use it, get rid of one cast.
(expand_naked_return): Promote rtx to rtx_code_label.
(do_jump_if_equal): Fix do_compare_rtx_and_jump call.
(expand_case): Use rtx_code_label instread of rtx where feasible.
(expand_sjlj_dispatch_table): Likewise.
(emit_case_nodes): Likewise.
* stmt.h: Declare jump_target_rtx. Update prototypes. Fix comments.
* store-motion.c (insert_store): Make use of new return type of
gen_move_insn and remove a cast.
(replace_store_insn): Likewise.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@223454 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/internal-fn.c')
-rw-r--r-- | gcc/internal-fn.c | 97 |
1 files changed, 48 insertions, 49 deletions
diff --git a/gcc/internal-fn.c b/gcc/internal-fn.c index 4eeb68133a7..2a64d9a5aff 100644 --- a/gcc/internal-fn.c +++ b/gcc/internal-fn.c @@ -422,7 +422,7 @@ expand_arith_overflow_result_store (tree lhs, rtx target, lres = convert_modes (tgtmode, mode, res, uns); gcc_assert (GET_MODE_PRECISION (tgtmode) < GET_MODE_PRECISION (mode)); do_compare_rtx_and_jump (res, convert_modes (mode, tgtmode, lres, uns), - EQ, true, mode, NULL_RTX, NULL_RTX, done_label, + EQ, true, mode, NULL_RTX, NULL, done_label, PROB_VERY_LIKELY); write_complex_part (target, const1_rtx, true); emit_label (done_label); @@ -569,7 +569,7 @@ expand_addsub_overflow (location_t loc, tree_code code, tree lhs, : CONST_SCALAR_INT_P (op1))) tem = op1; do_compare_rtx_and_jump (res, tem, code == PLUS_EXPR ? GEU : LEU, - true, mode, NULL_RTX, NULL_RTX, done_label, + true, mode, NULL_RTX, NULL, done_label, PROB_VERY_LIKELY); goto do_error_label; } @@ -584,7 +584,7 @@ expand_addsub_overflow (location_t loc, tree_code code, tree lhs, rtx tem = expand_binop (mode, add_optab, code == PLUS_EXPR ? res : op0, sgn, NULL_RTX, false, OPTAB_LIB_WIDEN); - do_compare_rtx_and_jump (tem, op1, GEU, true, mode, NULL_RTX, NULL_RTX, + do_compare_rtx_and_jump (tem, op1, GEU, true, mode, NULL_RTX, NULL, done_label, PROB_VERY_LIKELY); goto do_error_label; } @@ -627,8 +627,8 @@ expand_addsub_overflow (location_t loc, tree_code code, tree lhs, else if (pos_neg == 3) /* If ARG0 is not known to be always positive, check at runtime. */ do_compare_rtx_and_jump (op0, const0_rtx, LT, false, mode, NULL_RTX, - NULL_RTX, do_error, PROB_VERY_UNLIKELY); - do_compare_rtx_and_jump (op1, op0, LEU, true, mode, NULL_RTX, NULL_RTX, + NULL, do_error, PROB_VERY_UNLIKELY); + do_compare_rtx_and_jump (op1, op0, LEU, true, mode, NULL_RTX, NULL, done_label, PROB_VERY_LIKELY); goto do_error_label; } @@ -642,7 +642,7 @@ expand_addsub_overflow (location_t loc, tree_code code, tree lhs, OPTAB_LIB_WIDEN); rtx tem = expand_binop (mode, add_optab, op1, sgn, NULL_RTX, false, OPTAB_LIB_WIDEN); - do_compare_rtx_and_jump (op0, tem, LTU, true, mode, NULL_RTX, NULL_RTX, + do_compare_rtx_and_jump (op0, tem, LTU, true, mode, NULL_RTX, NULL, done_label, PROB_VERY_LIKELY); goto do_error_label; } @@ -655,7 +655,7 @@ expand_addsub_overflow (location_t loc, tree_code code, tree lhs, res = expand_binop (mode, add_optab, op0, op1, NULL_RTX, false, OPTAB_LIB_WIDEN); do_compare_rtx_and_jump (res, const0_rtx, LT, false, mode, NULL_RTX, - NULL_RTX, do_error, PROB_VERY_UNLIKELY); + NULL, do_error, PROB_VERY_UNLIKELY); rtx tem = op1; /* The operation is commutative, so we can pick operand to compare against. For prec <= BITS_PER_WORD, I think preferring REG operand @@ -668,7 +668,7 @@ expand_addsub_overflow (location_t loc, tree_code code, tree lhs, ? (CONST_SCALAR_INT_P (op1) && REG_P (op0)) : CONST_SCALAR_INT_P (op0)) tem = op0; - do_compare_rtx_and_jump (res, tem, GEU, true, mode, NULL_RTX, NULL_RTX, + do_compare_rtx_and_jump (res, tem, GEU, true, mode, NULL_RTX, NULL, done_label, PROB_VERY_LIKELY); goto do_error_label; } @@ -698,26 +698,26 @@ expand_addsub_overflow (location_t loc, tree_code code, tree lhs, tem = expand_binop (mode, ((pos_neg == 1) ^ (code == MINUS_EXPR)) ? and_optab : ior_optab, op0, res, NULL_RTX, false, OPTAB_LIB_WIDEN); - do_compare_rtx_and_jump (tem, const0_rtx, GE, false, mode, NULL_RTX, - NULL_RTX, done_label, PROB_VERY_LIKELY); + do_compare_rtx_and_jump (tem, const0_rtx, GE, false, mode, NULL, + NULL, done_label, PROB_VERY_LIKELY); } else { rtx_code_label *do_ior_label = gen_label_rtx (); do_compare_rtx_and_jump (op1, const0_rtx, code == MINUS_EXPR ? GE : LT, false, mode, - NULL_RTX, NULL_RTX, do_ior_label, + NULL_RTX, NULL, do_ior_label, PROB_EVEN); tem = expand_binop (mode, and_optab, op0, res, NULL_RTX, false, OPTAB_LIB_WIDEN); do_compare_rtx_and_jump (tem, const0_rtx, GE, false, mode, NULL_RTX, - NULL_RTX, done_label, PROB_VERY_LIKELY); + NULL, done_label, PROB_VERY_LIKELY); emit_jump (do_error); emit_label (do_ior_label); tem = expand_binop (mode, ior_optab, op0, res, NULL_RTX, false, OPTAB_LIB_WIDEN); do_compare_rtx_and_jump (tem, const0_rtx, GE, false, mode, NULL_RTX, - NULL_RTX, done_label, PROB_VERY_LIKELY); + NULL, done_label, PROB_VERY_LIKELY); } goto do_error_label; } @@ -730,14 +730,14 @@ expand_addsub_overflow (location_t loc, tree_code code, tree lhs, res = expand_binop (mode, sub_optab, op0, op1, NULL_RTX, false, OPTAB_LIB_WIDEN); rtx_code_label *op0_geu_op1 = gen_label_rtx (); - do_compare_rtx_and_jump (op0, op1, GEU, true, mode, NULL_RTX, NULL_RTX, + do_compare_rtx_and_jump (op0, op1, GEU, true, mode, NULL_RTX, NULL, op0_geu_op1, PROB_EVEN); do_compare_rtx_and_jump (res, const0_rtx, LT, false, mode, NULL_RTX, - NULL_RTX, done_label, PROB_VERY_LIKELY); + NULL, done_label, PROB_VERY_LIKELY); emit_jump (do_error); emit_label (op0_geu_op1); do_compare_rtx_and_jump (res, const0_rtx, GE, false, mode, NULL_RTX, - NULL_RTX, done_label, PROB_VERY_LIKELY); + NULL, done_label, PROB_VERY_LIKELY); goto do_error_label; } @@ -816,12 +816,12 @@ expand_addsub_overflow (location_t loc, tree_code code, tree lhs, /* If the op1 is negative, we have to use a different check. */ if (pos_neg == 3) do_compare_rtx_and_jump (op1, const0_rtx, LT, false, mode, NULL_RTX, - NULL_RTX, sub_check, PROB_EVEN); + NULL, sub_check, PROB_EVEN); /* Compare the result of the operation with one of the operands. */ if (pos_neg & 1) do_compare_rtx_and_jump (res, op0, code == PLUS_EXPR ? GE : LE, - false, mode, NULL_RTX, NULL_RTX, done_label, + false, mode, NULL_RTX, NULL, done_label, PROB_VERY_LIKELY); /* If we get here, we have to print the error. */ @@ -835,7 +835,7 @@ expand_addsub_overflow (location_t loc, tree_code code, tree lhs, /* We have k = a + b for b < 0 here. k <= a must hold. */ if (pos_neg & 2) do_compare_rtx_and_jump (res, op0, code == PLUS_EXPR ? LE : GE, - false, mode, NULL_RTX, NULL_RTX, done_label, + false, mode, NULL_RTX, NULL, done_label, PROB_VERY_LIKELY); } @@ -931,7 +931,7 @@ expand_neg_overflow (location_t loc, tree lhs, tree arg1, bool is_ubsan) /* Compare the operand with the most negative value. */ rtx minv = expand_normal (TYPE_MIN_VALUE (TREE_TYPE (arg1))); - do_compare_rtx_and_jump (op1, minv, NE, true, mode, NULL_RTX, NULL_RTX, + do_compare_rtx_and_jump (op1, minv, NE, true, mode, NULL_RTX, NULL, done_label, PROB_VERY_LIKELY); } @@ -1068,15 +1068,15 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, ops.location = loc; res = expand_expr_real_2 (&ops, NULL_RTX, mode, EXPAND_NORMAL); do_compare_rtx_and_jump (op1, const0_rtx, EQ, true, mode, NULL_RTX, - NULL_RTX, done_label, PROB_VERY_LIKELY); + NULL, done_label, PROB_VERY_LIKELY); goto do_error_label; case 3: rtx_code_label *do_main_label; do_main_label = gen_label_rtx (); do_compare_rtx_and_jump (op0, const0_rtx, GE, false, mode, NULL_RTX, - NULL_RTX, do_main_label, PROB_VERY_LIKELY); + NULL, do_main_label, PROB_VERY_LIKELY); do_compare_rtx_and_jump (op1, const0_rtx, EQ, true, mode, NULL_RTX, - NULL_RTX, do_main_label, PROB_VERY_LIKELY); + NULL, do_main_label, PROB_VERY_LIKELY); write_complex_part (target, const1_rtx, true); emit_label (do_main_label); goto do_main; @@ -1113,15 +1113,15 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, ops.location = loc; res = expand_expr_real_2 (&ops, NULL_RTX, mode, EXPAND_NORMAL); do_compare_rtx_and_jump (op0, const0_rtx, EQ, true, mode, NULL_RTX, - NULL_RTX, done_label, PROB_VERY_LIKELY); + NULL, done_label, PROB_VERY_LIKELY); do_compare_rtx_and_jump (op0, constm1_rtx, NE, true, mode, NULL_RTX, - NULL_RTX, do_error, PROB_VERY_UNLIKELY); + NULL, do_error, PROB_VERY_UNLIKELY); int prec; prec = GET_MODE_PRECISION (mode); rtx sgn; sgn = immed_wide_int_const (wi::min_value (prec, SIGNED), mode); do_compare_rtx_and_jump (op1, sgn, EQ, true, mode, NULL_RTX, - NULL_RTX, done_label, PROB_VERY_LIKELY); + NULL, done_label, PROB_VERY_LIKELY); goto do_error_label; case 3: /* Rest of handling of this case after res is computed. */ @@ -1167,7 +1167,7 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, tem = expand_binop (mode, and_optab, op0, op1, NULL_RTX, false, OPTAB_LIB_WIDEN); do_compare_rtx_and_jump (tem, const0_rtx, EQ, true, mode, - NULL_RTX, NULL_RTX, done_label, + NULL_RTX, NULL, done_label, PROB_VERY_LIKELY); goto do_error_label; } @@ -1185,8 +1185,7 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, tem = expand_binop (mode, and_optab, op0, op1, NULL_RTX, false, OPTAB_LIB_WIDEN); do_compare_rtx_and_jump (tem, const0_rtx, GE, false, mode, NULL_RTX, - NULL_RTX, after_negate_label, - PROB_VERY_LIKELY); + NULL, after_negate_label, PROB_VERY_LIKELY); /* Both arguments negative here, negate them and continue with normal unsigned overflow checking multiplication. */ emit_move_insn (op0, expand_unop (mode, neg_optab, op0, @@ -1202,13 +1201,13 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, tem2 = expand_binop (mode, xor_optab, op0, op1, NULL_RTX, false, OPTAB_LIB_WIDEN); do_compare_rtx_and_jump (tem2, const0_rtx, GE, false, mode, NULL_RTX, - NULL_RTX, do_main_label, PROB_VERY_LIKELY); + NULL, do_main_label, PROB_VERY_LIKELY); /* One argument is negative here, the other positive. This overflows always, unless one of the arguments is 0. But if e.g. s2 is 0, (U) s1 * 0 doesn't overflow, whatever s1 is, thus we can keep do_main code oring in overflow as is. */ do_compare_rtx_and_jump (tem, const0_rtx, EQ, true, mode, NULL_RTX, - NULL_RTX, do_main_label, PROB_VERY_LIKELY); + NULL, do_main_label, PROB_VERY_LIKELY); write_complex_part (target, const1_rtx, true); emit_label (do_main_label); goto do_main; @@ -1274,7 +1273,7 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, /* For the unsigned multiplication, there was overflow if HIPART is non-zero. */ do_compare_rtx_and_jump (hipart, const0_rtx, EQ, true, mode, - NULL_RTX, NULL_RTX, done_label, + NULL_RTX, NULL, done_label, PROB_VERY_LIKELY); else { @@ -1284,7 +1283,7 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, the high half. There was overflow if HIPART is different from RES < 0 ? -1 : 0. */ do_compare_rtx_and_jump (signbit, hipart, EQ, true, mode, - NULL_RTX, NULL_RTX, done_label, + NULL_RTX, NULL, done_label, PROB_VERY_LIKELY); } } @@ -1377,12 +1376,12 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, if (!op0_small_p) do_compare_rtx_and_jump (signbit0, hipart0, NE, true, hmode, - NULL_RTX, NULL_RTX, large_op0, + NULL_RTX, NULL, large_op0, PROB_UNLIKELY); if (!op1_small_p) do_compare_rtx_and_jump (signbit1, hipart1, NE, true, hmode, - NULL_RTX, NULL_RTX, small_op0_large_op1, + NULL_RTX, NULL, small_op0_large_op1, PROB_UNLIKELY); /* If both op0 and op1 are sign (!uns) or zero (uns) extended from @@ -1428,7 +1427,7 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, if (!op1_small_p) do_compare_rtx_and_jump (signbit1, hipart1, NE, true, hmode, - NULL_RTX, NULL_RTX, both_ops_large, + NULL_RTX, NULL, both_ops_large, PROB_UNLIKELY); /* If op1 is sign (!uns) or zero (uns) extended from hmode to mode, @@ -1465,7 +1464,7 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, emit_jump (after_hipart_neg); else if (larger_sign != -1) do_compare_rtx_and_jump (hipart, const0_rtx, GE, false, hmode, - NULL_RTX, NULL_RTX, after_hipart_neg, + NULL_RTX, NULL, after_hipart_neg, PROB_EVEN); tem = convert_modes (mode, hmode, lopart, 1); @@ -1481,7 +1480,7 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, emit_jump (after_lopart_neg); else if (smaller_sign != -1) do_compare_rtx_and_jump (lopart, const0_rtx, GE, false, hmode, - NULL_RTX, NULL_RTX, after_lopart_neg, + NULL_RTX, NULL, after_lopart_neg, PROB_EVEN); tem = expand_simple_binop (mode, MINUS, loxhi, larger, NULL_RTX, @@ -1510,7 +1509,7 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, hprec - 1, NULL_RTX, 0); do_compare_rtx_and_jump (signbitloxhi, hipartloxhi, NE, true, hmode, - NULL_RTX, NULL_RTX, do_overflow, + NULL_RTX, NULL, do_overflow, PROB_VERY_UNLIKELY); /* res = (loxhi << (bitsize / 2)) | (hmode) lo0xlo1; */ @@ -1546,7 +1545,7 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, tem = expand_simple_binop (hmode, PLUS, hipart0, const1_rtx, NULL_RTX, 1, OPTAB_DIRECT); do_compare_rtx_and_jump (tem, const1_rtx, GTU, true, hmode, - NULL_RTX, NULL_RTX, do_error, + NULL_RTX, NULL, do_error, PROB_VERY_UNLIKELY); } @@ -1555,7 +1554,7 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, tem = expand_simple_binop (hmode, PLUS, hipart1, const1_rtx, NULL_RTX, 1, OPTAB_DIRECT); do_compare_rtx_and_jump (tem, const1_rtx, GTU, true, hmode, - NULL_RTX, NULL_RTX, do_error, + NULL_RTX, NULL, do_error, PROB_VERY_UNLIKELY); } @@ -1566,18 +1565,18 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, emit_jump (hipart_different); else if (op0_sign == 1 || op1_sign == 1) do_compare_rtx_and_jump (hipart0, hipart1, NE, true, hmode, - NULL_RTX, NULL_RTX, hipart_different, + NULL_RTX, NULL, hipart_different, PROB_EVEN); do_compare_rtx_and_jump (res, const0_rtx, LT, false, mode, - NULL_RTX, NULL_RTX, do_error, + NULL_RTX, NULL, do_error, PROB_VERY_UNLIKELY); emit_jump (done_label); emit_label (hipart_different); do_compare_rtx_and_jump (res, const0_rtx, GE, false, mode, - NULL_RTX, NULL_RTX, do_error, + NULL_RTX, NULL, do_error, PROB_VERY_UNLIKELY); emit_jump (done_label); } @@ -1623,7 +1622,7 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, { rtx_code_label *all_done_label = gen_label_rtx (); do_compare_rtx_and_jump (res, const0_rtx, GE, false, mode, NULL_RTX, - NULL_RTX, all_done_label, PROB_VERY_LIKELY); + NULL, all_done_label, PROB_VERY_LIKELY); write_complex_part (target, const1_rtx, true); emit_label (all_done_label); } @@ -1634,13 +1633,13 @@ expand_mul_overflow (location_t loc, tree lhs, tree arg0, tree arg1, rtx_code_label *all_done_label = gen_label_rtx (); rtx_code_label *set_noovf = gen_label_rtx (); do_compare_rtx_and_jump (op1, const0_rtx, GE, false, mode, NULL_RTX, - NULL_RTX, all_done_label, PROB_VERY_LIKELY); + NULL, all_done_label, PROB_VERY_LIKELY); write_complex_part (target, const1_rtx, true); do_compare_rtx_and_jump (op0, const0_rtx, EQ, true, mode, NULL_RTX, - NULL_RTX, set_noovf, PROB_VERY_LIKELY); + NULL, set_noovf, PROB_VERY_LIKELY); do_compare_rtx_and_jump (op0, constm1_rtx, NE, true, mode, NULL_RTX, - NULL_RTX, all_done_label, PROB_VERY_UNLIKELY); - do_compare_rtx_and_jump (op1, res, NE, true, mode, NULL_RTX, NULL_RTX, + NULL, all_done_label, PROB_VERY_UNLIKELY); + do_compare_rtx_and_jump (op1, res, NE, true, mode, NULL_RTX, NULL, all_done_label, PROB_VERY_UNLIKELY); emit_label (set_noovf); write_complex_part (target, const0_rtx, true); |