Go to the source code of this file.
◆ expr_hash_elt_t
Structure for entries in the expression hash table.
◆ expr_kind
Header file for SSA dominator optimizations.
Copyright (C) 2013-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/>.
Representation of a "naked" right-hand-side expression, to be used
in recording available expressions in the expression hash table.
Enumerator |
---|
EXPR_SINGLE | |
EXPR_UNARY | |
EXPR_BINARY | |
EXPR_TERNARY | |
EXPR_CALL | |
EXPR_PHI | |
◆ initialize_expr_from_cond()
◆ record_conditions()
Record that COND is true and INVERTED is false into the edge information
structure. Also record that any conditions dominated by COND are true
as well.
For example, if a < b is true, then a <= b must also be true.
References boolean_false_node, boolean_true_node, build_and_record_new_cond(), COMPARISON_CLASS_P, cond_equivalence::cond, FLOAT_TYPE_P, initialize_expr_from_cond(), TREE_CODE, TREE_OPERAND, TREE_TYPE, and cond_equivalence::value.
Referenced by edge_info::derive_equivalences(), and record_edge_info().