-/* Do transform 1) on INSN if applicable. */
-static bool
-rtl_divmod_fixed_value_transform (rtx insn)
-{
- rtx set, set_src, set_dest, op1, op2, value, histogram;
- enum rtx_code code;
- enum machine_mode mode;
- gcov_type val, count, all;
- edge e;
- int prob;
-
- set = single_set (insn);
- if (!set)
- return false;
-
- set_src = SET_SRC (set);
- set_dest = SET_DEST (set);
- code = GET_CODE (set_src);
- mode = GET_MODE (set_dest);
-
- if (code != DIV && code != MOD && code != UDIV && code != UMOD)
- return false;
- op1 = XEXP (set_src, false);
- op2 = XEXP (set_src, 1);
-
- for (histogram = REG_NOTES (insn);
- histogram;
- histogram = XEXP (histogram, 1))
- if (REG_NOTE_KIND (histogram) == REG_VALUE_PROFILE
- && XEXP (XEXP (histogram, 0), 0) == GEN_INT (HIST_TYPE_SINGLE_VALUE))
- break;
-
- if (!histogram)
- return false;
-
- histogram = XEXP (XEXP (histogram, 0), 1);
- value = XEXP (histogram, 0);
- histogram = XEXP (histogram, 1);
- val = INTVAL (XEXP (histogram, 0));
- histogram = XEXP (histogram, 1);
- count = INTVAL (XEXP (histogram, 0));
- histogram = XEXP (histogram, 1);
- all = INTVAL (XEXP (histogram, 0));
-
- /* We require that count be at least half of all; this means
- that for the transformation to fire the value must be constant
- at least 50% of time (and 75% gives the guarantee of usage). */
- if (!rtx_equal_p (op2, value) || 2 * count < all)
- return false;
-
- if (dump_file)
- fprintf (dump_file, "Div/mod by constant transformation on insn %d\n",
- INSN_UID (insn));
-
- /* Compute probability of taking the optimal path. */
- prob = (count * REG_BR_PROB_BASE + all / 2) / all;
-
- e = split_block (BLOCK_FOR_INSN (insn), PREV_INSN (insn));
- delete_insn (insn);
-
- insert_insn_on_edge (
- rtl_divmod_fixed_value (mode, code, set_dest,
- op1, op2, val, prob), e);
-
- return true;
-}
-
-/* Generate code for transformation 2 (with MODE and OPERATION, operands OP1
- and OP2, result TARGET and probability of taking the optimal path PROB). */
-static rtx
-rtl_mod_pow2 (enum machine_mode mode, enum rtx_code operation, rtx target,
- rtx op1, rtx op2, int prob)
-{
- rtx tmp, tmp1, tmp2, tmp3, jump;
- rtx neq_label = gen_label_rtx ();
- rtx end_label = gen_label_rtx ();
- rtx sequence;
-
- start_sequence ();
-
- if (!REG_P (op2))
- {
- tmp = gen_reg_rtx (mode);
- emit_move_insn (tmp, copy_rtx (op2));
- }
- else
- tmp = op2;
-
- tmp1 = expand_simple_binop (mode, PLUS, tmp, constm1_rtx, NULL_RTX,
- 0, OPTAB_WIDEN);
- tmp2 = expand_simple_binop (mode, AND, tmp, tmp1, NULL_RTX,
- 0, OPTAB_WIDEN);
- do_compare_rtx_and_jump (tmp2, const0_rtx, NE, 0, mode, NULL_RTX,
- NULL_RTX, neq_label);
-
- /* Add branch probability to jump we just created. */
- jump = get_last_insn ();
- REG_NOTES (jump) = gen_rtx_EXPR_LIST (REG_BR_PROB,
- GEN_INT (REG_BR_PROB_BASE - prob),
- REG_NOTES (jump));
-
- tmp3 = expand_simple_binop (mode, AND, op1, tmp1, target,
- 0, OPTAB_WIDEN);
- if (tmp3 != target)
- emit_move_insn (copy_rtx (target), tmp3);
- emit_jump_insn (gen_jump (end_label));
- emit_barrier ();
-
- emit_label (neq_label);
- tmp1 = simplify_gen_binary (operation, mode, copy_rtx (op1), copy_rtx (tmp));
- tmp1 = force_operand (tmp1, target);
- if (tmp1 != target)
- emit_move_insn (target, tmp1);
-
- emit_label (end_label);
-
- sequence = get_insns ();
- end_sequence ();
- rebuild_jump_labels (sequence);
- return sequence;
-}
-
-/* Do transform 2) on INSN if applicable. */
-static bool
-rtl_mod_pow2_value_transform (rtx insn)
-{
- rtx set, set_src, set_dest, op1, op2, value, histogram;
- enum rtx_code code;
- enum machine_mode mode;
- gcov_type wrong_values, count;
- edge e;
- int all, prob;
-
- set = single_set (insn);
- if (!set)
- return false;
-
- set_src = SET_SRC (set);
- set_dest = SET_DEST (set);
- code = GET_CODE (set_src);
- mode = GET_MODE (set_dest);
-
- if (code != UMOD)
- return false;
- op1 = XEXP (set_src, 0);
- op2 = XEXP (set_src, 1);
-
- for (histogram = REG_NOTES (insn);
- histogram;
- histogram = XEXP (histogram, 1))
- if (REG_NOTE_KIND (histogram) == REG_VALUE_PROFILE
- && XEXP (XEXP (histogram, 0), 0) == GEN_INT (HIST_TYPE_POW2))
- break;
-
- if (!histogram)
- return false;
-
- histogram = XEXP (XEXP (histogram, 0), 1);
- value = XEXP (histogram, 0);
- histogram = XEXP (histogram, 1);
- wrong_values = INTVAL (XEXP (histogram, 0));
- histogram = XEXP (histogram, 1);
- count = INTVAL (XEXP (histogram, 0));
-
- if (!rtx_equal_p (op2, value))
- return false;
-
- /* We require that we hit a power of two at least half of all evaluations. */
- if (count < wrong_values)
- return false;
-
- if (dump_file)
- fprintf (dump_file, "Mod power of 2 transformation on insn %d\n",
- INSN_UID (insn));
-
- /* Compute probability of taking the optimal path. */
- all = count + wrong_values;
- prob = (count * REG_BR_PROB_BASE + all / 2) / all;
-
- e = split_block (BLOCK_FOR_INSN (insn), PREV_INSN (insn));
- delete_insn (insn);
-
- insert_insn_on_edge (
- rtl_mod_pow2 (mode, code, set_dest, op1, op2, prob), e);
-
- return true;
-}
-
-/* Generate code for transformations 3 and 4 (with MODE and OPERATION,
- operands OP1 and OP2, result TARGET, at most SUB subtractions, and
- probability of taking the optimal path(s) PROB1 and PROB2). */
-static rtx
-rtl_mod_subtract (enum machine_mode mode, enum rtx_code operation,
- rtx target, rtx op1, rtx op2, int sub, int prob1, int prob2)
-{
- rtx tmp, tmp1, jump;
- rtx end_label = gen_label_rtx ();
- rtx sequence;
- int i;
-
- start_sequence ();
-
- if (!REG_P (op2))
- {
- tmp = gen_reg_rtx (mode);
- emit_move_insn (tmp, copy_rtx (op2));
- }
- else
- tmp = op2;
-
- emit_move_insn (target, copy_rtx (op1));
- do_compare_rtx_and_jump (target, tmp, LTU, 0, mode, NULL_RTX,
- NULL_RTX, end_label);
-
- /* Add branch probability to jump we just created. */
- jump = get_last_insn ();
- REG_NOTES (jump) = gen_rtx_EXPR_LIST (REG_BR_PROB,
- GEN_INT (prob1), REG_NOTES (jump));
-
- for (i = 0; i < sub; i++)
- {
- tmp1 = expand_simple_binop (mode, MINUS, target, tmp, target,
- 0, OPTAB_WIDEN);
- if (tmp1 != target)
- emit_move_insn (target, tmp1);
- do_compare_rtx_and_jump (target, tmp, LTU, 0, mode, NULL_RTX,
- NULL_RTX, end_label);
-
- /* Add branch probability to jump we just created. */
- jump = get_last_insn ();
- REG_NOTES (jump) = gen_rtx_EXPR_LIST (REG_BR_PROB,
- GEN_INT (prob2), REG_NOTES (jump));
- }
-
- tmp1 = simplify_gen_binary (operation, mode, copy_rtx (target), copy_rtx (tmp));
- tmp1 = force_operand (tmp1, target);
- if (tmp1 != target)
- emit_move_insn (target, tmp1);
-
- emit_label (end_label);
-
- sequence = get_insns ();
- end_sequence ();
- rebuild_jump_labels (sequence);
- return sequence;
-}
-
-/* Do transforms 3) and 4) on INSN if applicable. */
-static bool
-rtl_mod_subtract_transform (rtx insn)
-{
- rtx set, set_src, set_dest, op1, op2, histogram;
- enum rtx_code code;
- enum machine_mode mode;
- gcov_type wrong_values, counts[2], count, all;
- edge e;
- int i, prob1, prob2;
-
- set = single_set (insn);
- if (!set)
- return false;
-
- set_src = SET_SRC (set);
- set_dest = SET_DEST (set);
- code = GET_CODE (set_src);
- mode = GET_MODE (set_dest);
-
- if (code != UMOD)
- return false;
- op1 = XEXP (set_src, 0);
- op2 = XEXP (set_src, 1);
-
- for (histogram = REG_NOTES (insn);
- histogram;
- histogram = XEXP (histogram, 1))
- if (REG_NOTE_KIND (histogram) == REG_VALUE_PROFILE
- && XEXP (XEXP (histogram, 0), 0) == GEN_INT (HIST_TYPE_INTERVAL))
- break;
-
- if (!histogram)
- return false;
-
- histogram = XEXP (XEXP (histogram, 0), 1);
- histogram = XEXP (histogram, 1);
-
- all = 0;
- for (i = 0; i < 2; i++)
- {
- counts[i] = INTVAL (XEXP (histogram, 0));
- all += counts[i];
- histogram = XEXP (histogram, 1);
- }
- wrong_values = INTVAL (XEXP (histogram, 0));
- histogram = XEXP (histogram, 1);
- wrong_values += INTVAL (XEXP (histogram, 0));
- all += wrong_values;
-
- /* We require that we use just subtractions in at least 50% of all
- evaluations. */
- count = 0;
- for (i = 0; i < 2; i++)
- {
- count += counts[i];
- if (count * 2 >= all)
- break;
- }
-
- if (i == 2)
- return false;
-
- if (dump_file)
- fprintf (dump_file, "Mod subtract transformation on insn %d\n",
- INSN_UID (insn));
-
- /* Compute probability of taking the optimal path(s). */
- prob1 = (counts[0] * REG_BR_PROB_BASE + all / 2) / all;
- prob2 = (counts[1] * REG_BR_PROB_BASE + all / 2) / all;
-
- e = split_block (BLOCK_FOR_INSN (insn), PREV_INSN (insn));
- delete_insn (insn);
-
- insert_insn_on_edge (
- rtl_mod_subtract (mode, code, set_dest,
- op1, op2, i, prob1, prob2), e);
-
- return true;
-}
-
-#ifdef HAVE_prefetch
-/* Generate code for transformation 5 for mem with ADDRESS and a constant
- step DELTA. WRITE is true if the reference is a store to mem. */
-
-static rtx
-gen_speculative_prefetch (rtx address, gcov_type delta, int write)
-{
- rtx tmp;
- rtx sequence;
-
- /* TODO: we do the prefetching for just one iteration ahead, which
- often is not enough. */
- start_sequence ();
- if (offsettable_address_p (0, VOIDmode, address))
- tmp = plus_constant (copy_rtx (address), delta);
- else
- {
- tmp = simplify_gen_binary (PLUS, Pmode,
- copy_rtx (address), GEN_INT (delta));
- tmp = force_operand (tmp, NULL);
- }
- if (! (*insn_data[(int)CODE_FOR_prefetch].operand[0].predicate)
- (tmp, insn_data[(int)CODE_FOR_prefetch].operand[0].mode))
- tmp = force_reg (Pmode, tmp);
- emit_insn (gen_prefetch (tmp, GEN_INT (write), GEN_INT (3)));
- sequence = get_insns ();
- end_sequence ();
-
- return sequence;
-}
-
-/* Do transform 5) on INSN if applicable. */
-
-static bool
-speculative_prefetching_transform (rtx insn)
-{
- rtx histogram, value;
- gcov_type val, count, all;
- edge e;
- rtx mem, address;
- int write;
-
- if (!maybe_hot_bb_p (BLOCK_FOR_INSN (insn)))
- return false;
-
- if (!find_mem_reference (insn, &mem, &write))
- return false;
-
- address = XEXP (mem, 0);
- if (side_effects_p (address))
- return false;
-
- if (CONSTANT_P (address))
- return false;
-
- for (histogram = REG_NOTES (insn);
- histogram;
- histogram = XEXP (histogram, 1))
- if (REG_NOTE_KIND (histogram) == REG_VALUE_PROFILE
- && XEXP (XEXP (histogram, 0), 0) == GEN_INT (HIST_TYPE_CONST_DELTA))
- break;
-
- if (!histogram)
- return false;
-
- histogram = XEXP (XEXP (histogram, 0), 1);
- value = XEXP (histogram, 0);
- histogram = XEXP (histogram, 1);
- /* Skip last value referenced. */
- histogram = XEXP (histogram, 1);
- val = INTVAL (XEXP (histogram, 0));
- histogram = XEXP (histogram, 1);
- count = INTVAL (XEXP (histogram, 0));
- histogram = XEXP (histogram, 1);
- all = INTVAL (XEXP (histogram, 0));
-
- /* With that few executions we do not really have a reason to optimize the
- statement, and more importantly, the data about differences of addresses
- are spoiled by the first item that had no previous value to compare
- with. */
- if (all < 4)
- return false;
-
- /* We require that count be at least half of all; this means
- that for the transformation to fire the value must be constant
- at least 50% of time (and 75% gives the guarantee of usage). */
- if (!rtx_equal_p (address, value) || 2 * count < all)
- return false;
-
- /* If the difference is too small, it does not make too much sense to
- prefetch, as the memory is probably already in cache. */
- if (val >= NOPREFETCH_RANGE_MIN && val <= NOPREFETCH_RANGE_MAX)
- return false;
-
- if (dump_file)
- fprintf (dump_file, "Speculative prefetching for insn %d\n",
- INSN_UID (insn));
-
- e = split_block (BLOCK_FOR_INSN (insn), PREV_INSN (insn));
-
- insert_insn_on_edge (gen_speculative_prefetch (address, val, write), e);
-
- return true;
-}
-#endif /* HAVE_prefetch */
-