#include "config.h"#include "system.h"#include "coretypes.h"#include "backend.h"#include "target.h"#include "rtl.h"#include "tree.h"#include "cfghooks.h"#include "tree-pass.h"#include "memmodel.h"#include "tm_p.h"#include "insn-config.h"#include "regs.h"#include "emit-rtl.h"#include "recog.h"#include "cfgrtl.h"#include "rtl-iter.h"
Function Documentation
◆ any_condjump_p()
Return true when insn is a conditional jump. This function works for instructions containing PC sets in PARALLELs, UNSPECs or UNSPEC_VOLATILEs. The instruction may have various other effects so before removing the jump you must verify onlyjump_p. Note that unlike condjump_p it returns false for unconditional jumps.
References a, b, GET_CODE, ggc_alloc(), pc_set(), SET_SRC, and XEXP.
Referenced by bypass_conditional_jumps(), can_predict_insn_p(), cfg_layout_redirect_edge_and_branch(), check_simple_exit(), cond_exec_get_condition(), constprop_register(), cse_extended_basic_block(), cse_find_path(), dead_or_predicable(), emit_cmp_and_jump_insn_1(), expand_addsub_overflow(), expand_mul_overflow(), expand_neg_overflow(), find_dead_or_set_registers(), find_jump_block(), find_many_sub_basic_blocks(), fix_crossing_conditional_branches(), fix_crossing_unconditional_branches(), fixup_reorder_chain(), force_nonfallthru_and_redirect(), get_condition(), maybe_cleanup_end_of_block(), noce_get_condition(), outgoing_edges_match(), predict_insn(), purge_dead_edges(), record_jump_equiv(), relax_delay_slots(), reload_cse_move2add_invalidate(), reorder_basic_blocks_simple(), rotate_loop(), rtl_block_ends_with_condjump_p(), rtl_predict_edge(), rtl_split_block_before_cond_jump(), rtl_verify_edges(), set_edge_can_fallthru_flag(), simplify_using_initial_values(), thread_jump(), try_optimize_cfg(), try_shrink_wrapping(), try_simplify_condjump(), and try_split().
◆ any_uncondjump_p()
Return true when insn is an unconditional direct jump, possibly bundled inside a PARALLEL, UNSPEC or UNSPEC_VOLATILE. The instruction may have various other effects so before removing the jump you must verify onlyjump_p.
References find_reg_note(), GET_CODE, ggc_alloc(), NULL_RTX, pc_set(), and SET_SRC.
Referenced by add_test(), emit(), find_dead_or_set_registers(), follow_jumps(), rtl_block_empty_p(), rtl_tidy_fallthru_edge(), rtl_verify_edges(), and try_combine().
◆ cleanup_barriers()
Some old code expects exactly one BARRIER as the NEXT_INSN of a non-fallthru insn. This is not generally true, as multiple barriers may have crept in, or the BARRIER may be separated from the last real insn by one or more NOTEs. This simple pass moves barriers and removes duplicates so that the old code is happy.
References BARRIER_P, BB_END, BLOCK_FOR_INSN(), delete_insn(), end(), get_insns(), NEXT_INSN(), NULL, PREV_INSN(), prev_nonnote_nondebug_insn(), and reorder_insns_nobb().
◆ comparison_dominates_p()
Return true if CODE1 is more strict than CODE2, i.e., if the truth of CODE1 implies the truth of CODE2.
References ggc_alloc().
Referenced by condition_dominates_p(), fold_rtx(), known_cond(), and thread_jump().
◆ condjump_in_parallel_p()
Return true if INSN is a (possibly) conditional jump inside a PARALLEL. Use this function is deprecated, since we need to support combined branch and compare insns. Use any_condjump_p instead whenever possible.
References ANY_RETURN_P, GET_CODE, ggc_alloc(), PATTERN(), pc_rtx, SET, SET_DEST, SET_SRC, XEXP, and XVECEXP.
Referenced by dbr_schedule(), fill_eager_delay_slots(), fill_simple_delay_slots(), get_branch_condition(), get_jump_flags(), relax_delay_slots(), and reload_combine().
◆ condjump_label()
◆ condjump_p()
Return true if INSN is a (possibly) conditional jump and nothing more. Use of this function is deprecated, since we need to support combined branch and compare insns. Use any_condjump_p instead whenever possible.
References ANY_RETURN_P, GET_CODE, ggc_alloc(), PATTERN(), SET, SET_DEST, SET_SRC, and XEXP.
Referenced by cse_insn(), dbr_schedule(), fill_eager_delay_slots(), fill_simple_delay_slots(), get_jump_flags(), relax_delay_slots(), reload_combine(), and rtl_verify_bb_layout().
◆ delete_for_peephole()
Delete a range of insns from FROM to TO, inclusive. This is for the sake of peephole optimization, so assume that whatever these insns do will still be done by a new peephole insn that will replace them.
References NEXT_INSN(), NOTE_P, PREV_INSN(), rtx_insn::set_deleted(), SET_NEXT_INSN(), and SET_PREV_INSN().
◆ delete_related_insns()
Delete insn INSN from the chain of insns and update label ref counts and delete insns now unreachable. Returns the first insn after INSN that was not deleted. Usage of this instruction is deprecated. Use delete_insn instead and subsequent cfg_cleanup pass to delete unreachable code if needed.
References BARRIER_P, delete_insn(), delete_related_insns(), rtx_insn::deleted(), GET_CODE, GET_NUM_ELEM, ggc_alloc(), i, INSN_P, JUMP_LABEL, JUMP_TABLE_DATA_P, jump_to_label_p(), LABEL_NUSES, LABEL_P, NEXT_INSN(), NOTE_P, NULL, PATTERN(), PREV_INSN(), REG_NOTE_KIND, REG_NOTES, RTVEC_ELT, table, tablejump_p(), and XEXP.
Referenced by dbr_schedule(), delete_address_reloads(), delete_computation(), delete_from_delay_slot(), delete_related_insns(), delete_scheduled_jump(), fill_simple_delay_slots(), fill_slots_from_thread(), make_return_insns(), optimize_skip(), redirect_jump_2(), relax_delay_slots(), and try_merge_delay_insns().
◆ eh_returnjump_p()
Return true if INSN is a (possibly conditional) return insn.
References FOR_EACH_SUBRTX, GET_CODE, ggc_alloc(), JUMP_P, and PATTERN().
Referenced by thread_prologue_and_epilogue_insns().
◆ init_label_info()
Optimize jump instructions, for GNU compiler. Copyright (C) 1987-2024 Free Software Foundation, Inc. This file is part of GCC. GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3, or (at your option) any later version. GCC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GCC; see the file COPYING3. If not see <http://www.gnu.org/licenses/>.
This is the pathetic reminder of old fame of the jump-optimization pass of the compiler. Now it contains basically a set of utility functions to operate with jumps. Each CODE_LABEL has a count of the times it is used stored in the LABEL_NUSES internal field, and each JUMP_INSN has one label that it refers to stored in the JUMP_LABEL internal field. With this we can detect labels that become unused because of the deletion of all the jumps that formerly used them. The JUMP_LABEL info is sometimes looked at by later passes. For return insns, it contains either a RETURN or a SIMPLE_RETURN rtx. The subroutines redirect_jump and invert_jump are used from other passes as well.
Optimize jump y; x: ... y: jumpif... x? Don't know if it is worth bothering with.
Optimize two cases of conditional jump to conditional jump? This can never delete any instruction or make anything dead, or even change what is live at any point. So perhaps let combiner do it.
Initialize LABEL_NUSES and JUMP_LABEL fields, add REG_LABEL_TARGET for remaining targets for JUMP_P. Delete any REG_LABEL_OPERAND notes whose labels don't occur in the insn any more.
References ggc_alloc(), INSN_P, LABEL_NUSES, LABEL_P, LABEL_PRESERVE_P, NEXT_INSN(), PATTERN(), reg_mentioned_p(), REG_NOTE_KIND, REG_NOTES, remove_note(), and XEXP.
Referenced by rebuild_jump_labels_1().
◆ invert_exp_1()
Invert the jump condition X contained in jump insn INSN. Accrue the modifications into the change group. Return true for success.
References comp, GET_CODE, GET_MODE, ggc_alloc(), reversed_comparison_code(), RTX_CODE, validate_change(), and XEXP.
Referenced by invert_jump_1(), and redirect_jump_2().
◆ invert_jump()
| bool invert_jump | ( | rtx_jump_insn * | jump, |
| rtx | nlabel, | ||
| int | delete_unused ) |
Invert the condition of the jump JUMP, and make it jump to label NLABEL instead of where it jumps now. Return true if successful.
References apply_change_group(), cancel_changes(), ggc_alloc(), invert_jump_1(), JUMP_LABEL, and redirect_jump_2().
Referenced by fix_up_fall_thru_edges(), fixup_reorder_chain(), optimize_skip(), relax_delay_slots(), set_edge_can_fallthru_flag(), try_optimize_cfg(), and try_simplify_condjump().
◆ invert_jump_1()
| bool invert_jump_1 | ( | rtx_jump_insn * | jump, |
| rtx | nlabel ) |
Invert the condition of the jump JUMP, and make it jump to label NLABEL instead of where it jumps now. Accrue changes into the change group. Return false if we didn't see how to perform the inversion and redirection.
References gcc_assert, ggc_alloc(), invert_exp_1(), JUMP_LABEL, NULL, num_validated_changes(), pc_set(), redirect_jump_1(), and SET_SRC.
Referenced by dead_or_predicable(), and invert_jump().
◆ jump_to_label_p()
Return true iff INSN is a jump and its JUMP_LABEL is a label, not NULL or a return.
References ANY_RETURN_P, JUMP_LABEL, JUMP_P, and NULL.
Referenced by delete_related_insns(), fill_simple_delay_slots(), fill_slots_from_thread(), insn_current_reference_address(), and make_return_insns().
◆ make_pass_cleanup_barriers()
| rtl_opt_pass * make_pass_cleanup_barriers | ( | gcc::context * | ctxt | ) |
References ggc_alloc().
◆ mark_all_labels()
Mark the label each jump jumps to. Combine consecutive labels, and count uses of labels.
References BB_FOOTER, BB_HEADER, cfun, current_ir_type(), rtx_insn::deleted(), FOR_BB_INSNS, FOR_EACH_BB_FN, gcc_assert, ggc_alloc(), IR_RTL_CFGLAYOUT, JUMP_LABEL, JUMP_P, JUMP_TABLE_DATA_P, LABEL_P, mark_jump_label(), maybe_propagate_label_ref(), NEXT_INSN(), NONDEBUG_INSN_P, NULL, and PATTERN().
Referenced by rebuild_jump_labels_1().
◆ mark_jump_label()
Find all CODE_LABELs referred to in X, and increment their use counts. If INSN is a JUMP_INSN and there is at least one CODE_LABEL referenced in INSN as a jump target, then store the last one in JUMP_LABEL (INSN). For a tablejump, this must be the label for the ADDR_VEC. Store any other jump targets as REG_LABEL_TARGET notes. If INSN is an INSN or a CALL_INSN or non-target operands of a JUMP_INSN, and there is at least one CODE_LABEL referenced in INSN, add a REG_LABEL_OPERAND note containing that label to INSN. For returnjumps, the JUMP_LABEL will also be set as appropriate. Note that two labels separated by a loop-beginning note must be kept distinct if we have not yet done loop-optimization, because the gap between them is where loop-optimize will want to move invariant code to. CROSS_JUMP tells us that loop-optimization is done with.
References extract_asm_operands(), ggc_alloc(), JUMP_P, mark_jump_label_1(), mark_jump_label_asm(), NULL, and PATTERN().
Referenced by emit_copy_of_insn_after(), gen_reload(), mark_all_labels(), mark_jump_label_1(), move_insn_for_shrink_wrap(), try_combine(), and try_split().
◆ mark_jump_label_1()
Worker function for mark_jump_label. IN_MEM is TRUE when X occurs within a (MEM ...). IS_TARGET is TRUE when X is to be treated as a jump-target; when the JUMP_LABEL field of INSN should be set or a REG_LABEL_TARGET note should be added, not a REG_LABEL_OPERAND note.
References add_reg_note(), CONSTANT_POOL_ADDRESS_P, rtx_insn::deleted(), find_reg_note(), gcc_assert, GET_CODE, get_pool_constant(), GET_RTX_FORMAT, GET_RTX_LENGTH, ggc_alloc(), i, rtx_sequence::insn(), JUMP_LABEL, LABEL_NUSES, LABEL_P, label_ref_label(), LABEL_REF_NONLOCAL_P, rtx_sequence::len(), mark_jump_label(), mark_jump_label_1(), NOTE_KIND, NOTE_P, NULL, PATTERN(), RTX_CODE, set_label_ref_label(), XEXP, XVECEXP, and XVECLEN.
Referenced by mark_jump_label(), mark_jump_label_1(), mark_jump_label_asm(), and maybe_propagate_label_ref().
◆ mark_jump_label_asm()
Worker function for mark_jump_label. Handle asm insns specially. In particular, output operands need not be considered so we can avoid re-scanning the replicated asm_operand. Also, the asm_labels need to be considered targets.
References ASM_OPERANDS_INPUT, ASM_OPERANDS_INPUT_LENGTH, ASM_OPERANDS_LABEL, ASM_OPERANDS_LABEL_LENGTH, ggc_alloc(), i, and mark_jump_label_1().
Referenced by mark_jump_label().
◆ maybe_propagate_label_ref()
A subroutine of mark_all_labels. Trivially propagate a simple label load into a jump_insn that uses it.
References find_reg_note(), gcc_assert, GET_CODE, ggc_alloc(), JUMP_LABEL, label_ref_label(), mark_jump_label_1(), NULL, pc_set(), rtx_equal_p(), SET_DEST, SET_SRC, single_set(), and XEXP.
Referenced by mark_all_labels().
◆ onlyjump_p()
Return true if INSN is a jump that only transfers control and nothing more.
References GET_CODE, ggc_alloc(), JUMP_P, NULL, SET_DEST, SET_SRC, side_effects_p(), and single_set().
Referenced by add_test(), bb_valid_for_noce_process_p(), bypass_conditional_jumps(), cfg_layout_can_merge_blocks_p(), cfg_layout_redirect_edge_and_branch(), check_cond_move_block(), check_simple_exit(), cond_exec_process_if_block(), constprop_register(), dead_or_predicable(), find_cond_trap(), find_if_case_1(), find_if_case_2(), fixup_reorder_chain(), flow_find_cross_jump(), follow_jumps(), noce_find_if_block(), outgoing_edges_match(), rtl_block_empty_p(), rtl_can_merge_blocks(), rtl_can_remove_branch_p(), rtl_tidy_fallthru_edge(), simplify_using_initial_values(), thread_jump(), try_optimize_cfg(), and try_redirect_by_replacing_jump().
◆ pc_set()
Return set of PC, otherwise NULL.
References GET_CODE, ggc_alloc(), JUMP_P, NULL_RTX, PATTERN(), SET, SET_DEST, and XVECEXP.
Referenced by any_condjump_p(), any_uncondjump_p(), bypass_block(), compare_and_jump_seq(), cond_exec_get_condition(), condjump_label(), cprop_jump(), get_condition(), indirect_jump_optimize(), invert_jump_1(), maybe_propagate_label_ref(), noce_emit_store_flag(), noce_get_alt_condition(), noce_get_condition(), outgoing_edges_match(), record_jump_equiv(), and thread_jump().
◆ rebuild_jump_labels()
This function rebuilds the JUMP_LABEL field and REG_LABEL_TARGET notes in jumping insns and REG_LABEL_OPERAND notes in non-jumping instructions and jumping insns that have labels as operands (e.g. cbranchsi4).
References rebuild_jump_labels_1().
Referenced by break_superblocks(), cfg_layout_finalize(), indirect_jump_optimize(), function_reader::parse_function(), peephole2_optimize(), rest_of_handle_combine(), rest_of_handle_cse(), rest_of_handle_cse2(), rest_of_handle_cse_after_global_opts(), and rest_of_handle_gcse2().
◆ rebuild_jump_labels_1()
Worker for rebuild_jump_labels and rebuild_jump_labels_chain.
References FOR_EACH_VEC_SAFE_ELT, forced_labels, ggc_alloc(), i, init_label_info(), LABEL_NUSES, LABEL_P, mark_all_labels(), timevar_pop(), and timevar_push().
Referenced by rebuild_jump_labels(), and rebuild_jump_labels_chain().
◆ rebuild_jump_labels_chain()
This function is like rebuild_jump_labels, but doesn't run over forced_labels. It can be used on insn chains that aren't the main function chain.
References rebuild_jump_labels_1().
Referenced by commit_edge_insertions(), and commit_one_edge_insertion().
◆ redirect_exp_1()
Throughout LOC, redirect OLABEL to NLABEL. Treat null OLABEL or NLABEL as a return. Accrue modifications into the change group.
References ANY_RETURN_P, GET_CODE, GET_RTX_FORMAT, GET_RTX_LENGTH, ggc_alloc(), i, label_ref_label(), PATTERN(), pc_rtx, redirect_exp_1(), redirect_target(), RTX_CODE, SET, SET_DEST, SET_SRC, validate_change(), XEXP, XVECEXP, and XVECLEN.
Referenced by redirect_exp_1(), redirect_jump_1(), and redirect_jump_2().
◆ redirect_jump()
| bool redirect_jump | ( | rtx_jump_insn * | jump, |
| rtx | nlabel, | ||
| int | delete_unused ) |
Make JUMP go to NLABEL instead of where it jumps now. If the old jump target label is unused as a result, it and the code following it may be deleted. Normally, NLABEL will be a label, but it may also be a RETURN rtx; in that case we are to turn the jump into a (possibly conditional) return insn. The return value will be true if the change was made, false if it wasn't (this can only occur when trying to produce return insns).
References apply_change_group(), epilogue_completed, gcc_unreachable, ggc_alloc(), rtx_jump_insn::jump_label(), redirect_jump_1(), and redirect_jump_2().
Referenced by compare_and_jump_seq(), dbr_schedule(), fix_crossing_conditional_branches(), force_nonfallthru_and_redirect(), patch_jump_insn(), reorg_redirect_jump(), try_optimize_cfg(), and try_redirect_by_replacing_jump().
◆ redirect_jump_1()
Make JUMP go to NLABEL instead of where it jumps now. Accrue the modifications into the change group. Return false if we did not see how to do that.
References ASM_OPERANDS_LABEL, ASM_OPERANDS_LABEL_LENGTH, extract_asm_operands(), gcc_assert, GET_CODE, ggc_alloc(), JUMP_LABEL, NULL, NULL_RTX, num_validated_changes(), PATTERN(), redirect_exp_1(), and XVECEXP.
Referenced by dead_or_predicable(), invert_jump_1(), and redirect_jump().
◆ redirect_jump_2()
| void redirect_jump_2 | ( | rtx_jump_insn * | jump, |
| rtx | olabel, | ||
| rtx | nlabel, | ||
| int | delete_unused, | ||
| int | invert ) |
Fix up JUMP_LABEL and label ref counts after OLABEL has been replaced with NLABEL in JUMP. If DELETE_UNUSED is positive, delete related insn to OLABEL if its ref count has dropped to zero.
References ANY_RETURN_P, confirm_change_group(), CROSSING_JUMP_P, delete_related_insns(), find_reg_note(), gcc_assert, ggc_alloc(), INSN_UID(), invert_br_probabilities(), invert_exp_1(), JUMP_LABEL, LABEL_NUSES, NULL_RTX, redirect_exp_1(), remove_note(), and XEXP.
Referenced by dead_or_predicable(), invert_jump(), and redirect_jump().
◆ redirect_target()
A helper function for redirect_exp_1; examines its input X and returns either a LABEL_REF around a label, or a RETURN if X was NULL.
References ANY_RETURN_P, ggc_alloc(), NULL_RTX, and ret_rtx.
Referenced by redirect_exp_1().
◆ reg_or_subregno()
Return regno of the register REG and handle subregs too.
References gcc_assert, GET_CODE, ggc_alloc(), REG_P, REGNO, and SUBREG_REG.
Referenced by gen_reload(), ira_get_dup_out_num(), push_reload(), and try_combine().
◆ returnjump_p()
Return TRUE if INSN is a return jump.
References FOR_EACH_SUBRTX, GET_CODE, ggc_alloc(), JUMP_P, PATTERN(), SET, and SET_IS_RETURN_P.
Referenced by commit_one_edge_insertion(), create_trace_edges(), find_cond_trap(), fixup_reorder_chain(), flow_find_cross_jump(), make_edges(), make_insn_raw(), patch_jump_insn(), purge_dead_edges(), rtl_verify_bb_layout(), thread_prologue_and_epilogue_insns(), and try_combine().
◆ reverse_condition()
Given an rtx-code for a comparison, return the code for the negated comparison. If no such code exists, return UNKNOWN. WATCH OUT! reverse_condition is not safe to use on a jump that might be acting on the results of an IEEE floating point comparison, because of the special treatment of non-signaling nans in comparisons. Use reversed_comparison_code instead.
References gcc_unreachable, and ggc_alloc().
Referenced by do_compare_rtx_and_jump(), emit_store_flag_force(), emit_store_flag_int(), fold_rtx(), iv_number_of_iterations(), known_cond(), noce_get_condition(), reversed_comparison_code_parts(), and simplify_comparison().
◆ reverse_condition_maybe_unordered()
Similar, but we're allowed to generate unordered comparisons, which makes it safe for IEEE floating-point. Of course, we have to recognize that the target will support them too...
References gcc_unreachable, and ggc_alloc().
Referenced by do_compare_rtx_and_jump(), emit_store_flag(), emit_store_flag_force(), prepare_float_lib_cmp(), and reversed_comparison_code_parts().
◆ reversed_comparison()
Return comparison with reversed code of EXP. Return NULL_RTX in case we fail to do the reversal.
References exp(), ggc_alloc(), NULL, NULL_RTX, reversed_comparison_code(), simplify_gen_relational(), and XEXP.
Referenced by simplify_context::simplify_binary_operation_1(), simplify_if_then_else(), and simplify_context::simplify_unary_operation_1().
◆ reversed_comparison_code()
A wrapper around the previous function to take COMPARISON as rtx expression. This simplifies many callers.
References COMPARISON_P, GET_CODE, ggc_alloc(), reversed_comparison_code_parts(), and XEXP.
Referenced by canonicalize_condition(), cond_exec_get_condition(), cond_exec_process_if_block(), dead_or_predicable(), find_comparison_args(), get_branch_condition(), if_then_else_cond(), invert_exp_1(), known_cond(), noce_emit_store_flag(), noce_reversed_cond_code(), noce_try_addcc(), noce_try_cmove_arith(), outgoing_edges_match(), reversed_comparison(), reversed_condition(), simplify_comparison(), simplify_if_then_else(), simplify_context::simplify_relational_operation_1(), simplify_context::simplify_ternary_operation(), simplify_context::simplify_unary_operation_1(), and thread_jump().
◆ reversed_comparison_code_parts()
| enum rtx_code reversed_comparison_code_parts | ( | enum rtx_code | code, |
| const_rtx | arg0, | ||
| const_rtx | arg1, | ||
| const rtx_insn * | insn ) |
Given a comparison (CODE ARG0 ARG1), inside an insn, INSN, return a code of reversed comparison if it is possible to do so. Otherwise return UNKNOWN. UNKNOWN may be returned in case we are having CC_MODE compare and we don't know whether it's source is floating point or integer comparison. Machine description should define REVERSIBLE_CC_MODE and REVERSE_CONDITION macros to help this function avoid overhead in these cases.
References CONST_INT_P, GET_CODE, GET_MODE, GET_MODE_CLASS, GET_RTX_CLASS, ggc_alloc(), HONOR_NANS(), LABEL_P, prev_nonnote_insn(), REG_P, REVERSE_CONDITION, reverse_condition(), reverse_condition_maybe_unordered(), REVERSIBLE_CC_MODE, RTX_COMM_COMPARE, RTX_COMPARE, rtx_equal_p(), SET, SET_DEST, set_of(), SET_SRC, and XEXP.
Referenced by combine_simplify_rtx(), emit_conditional_move(), record_jump_equiv(), and reversed_comparison_code().
◆ rtx_renumbered_equal_p()
Like rtx_equal_p except that it considers two REGs as equal if they renumber to the same value and considers two commutative operations to be the same if the order of the operands has been reversed.
References CASE_CONST_UNIQUE, gcc_unreachable, GET_CODE, GET_MODE, GET_RTX_FORMAT, GET_RTX_LENGTH, ggc_alloc(), i, known_eq, LABEL_P, label_ref_label(), LABEL_REF_NONLOCAL_P, MEM_ADDR_SPACE, next_nonnote_nondebug_insn(), NON_COMMUTATIVE_P, subreg_info::offset, REG_P, reg_renumber, REGNO, subreg_info::representable_p, rtx_equal_p(), rtx_renumbered_equal_p(), same_vector_encodings_p(), SUBREG_BYTE, subreg_get_info(), SUBREG_REG, targetm, UNARY_P, XEXP, XINT, XSTR, XTREE, XVECEXP, XVECLEN, XWINT, and y.
Referenced by can_replace_by(), equal_different_set_p(), find_equiv_reg(), insns_have_identical_cfa_notes(), old_insns_match_p(), outgoing_edges_match(), and rtx_renumbered_equal_p().
◆ signed_condition()
Similarly, return the signed version of a comparison.
References gcc_unreachable, and ggc_alloc().
Referenced by simplify_const_relational_operation().
◆ simplejump_p()
Return true if INSN is an unconditional jump and nothing else.
References GET_CODE, ggc_alloc(), JUMP_P, PATTERN(), SET, SET_DEST, and SET_SRC.
Referenced by cfg_layout_can_merge_blocks_p(), cfg_layout_redirect_edge_and_branch(), commit_one_edge_insertion(), cond_exec_find_if_block(), contains_no_active_insn_p(), cprop_jump(), emit_common_tails_for_components(), fill_simple_delay_slots(), fixup_reorder_chain(), flow_find_cross_jump(), maybe_duplicate_computed_goto(), outgoing_edges_match(), purge_dead_edges(), relax_delay_slots(), rtl_can_merge_blocks(), simplejump_or_return_p(), try_optimize_cfg(), and try_redirect_by_replacing_jump().
◆ swap_condition()
Similar, but return the code when two operands of a comparison are swapped. This IS safe for IEEE floating-point.
References gcc_unreachable, and ggc_alloc().
Referenced by canon_condition(), canonicalize_condition(), canonicalize_iv_subregs(), do_compare_rtx_and_jump(), do_store_flag(), emit_cmp_and_jump_insns(), emit_conditional_add(), emit_conditional_move(), emit_store_flag_1(), emit_store_flag_force(), if_then_else_cond(), iv_number_of_iterations(), known_cond(), noce_get_alt_condition(), noce_try_minmax(), outgoing_edges_match(), prepare_float_lib_cmp(), simplify_comparison(), simplify_const_relational_operation(), simplify_context::simplify_relational_operation(), and simplify_while_replacing().
◆ true_regnum()
| int true_regnum | ( | const_rtx | x | ) |
If X is a hard register or equivalent to one or a subregister of one, return the hard register number. If X is a pseudo register that was not assigned a hard register, return the pseudo register number. Otherwise, return -1. Any rtx is valid for X.
References GET_CODE, GET_MODE, ggc_alloc(), lra_in_progress, subreg_info::offset, REG_P, reg_renumber, REGNO, subreg_info::representable_p, SUBREG_BYTE, subreg_get_info(), SUBREG_REG, and true_regnum().
Referenced by choose_reload_regs(), clear_reload_reg_in_use(), deallocate_reload_reg(), decompose(), find_equiv_reg(), find_reusable_reload(), reload_cse_simplify_operands(), reload_cse_simplify_set(), reload_reg_free_for_value_p(), set_reload_reg(), and true_regnum().
◆ unsigned_condition()
Given a comparison CODE, return the corresponding unsigned comparison. If CODE is an equality comparison or already an unsigned comparison, CODE is returned.
References gcc_unreachable, and ggc_alloc().
Referenced by do_compare_rtx_and_jump(), emit_cmp_and_jump_insns(), emit_conditional_add(), emit_conditional_move(), emit_store_flag_1(), simplify_comparison(), and unsigned_condition_p().
