c++: Implement C++26 P2573R2 - = delete("should have a reason"); [PR114458]
[official-gcc.git] / gcc / tree-ssa.h
blobb8cfbc28f701fe8dde51eb415db3ba15cf158083
1 /* Header file for any pass which requires SSA routines.
2 Copyright (C) 2013-2024 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 #ifndef GCC_TREE_SSA_H
21 #define GCC_TREE_SSA_H
23 /* Mapping for redirected edges. */
24 struct edge_var_map {
25 tree result; /* PHI result. */
26 tree def; /* PHI arg definition. */
27 location_t locus; /* PHI arg location. */
30 /* A vector of var maps. */
31 typedef vec<edge_var_map, va_heap, vl_embed> edge_var_map_vector;
34 extern void redirect_edge_var_map_add (edge, tree, tree, location_t);
35 extern void redirect_edge_var_map_clear (edge);
36 extern void redirect_edge_var_map_dup (edge, edge);
37 extern vec<edge_var_map> *redirect_edge_var_map_vector (edge);
38 extern void redirect_edge_var_map_empty (void);
39 extern edge ssa_redirect_edge (edge, basic_block);
40 extern void flush_pending_stmts (edge);
41 extern void gimple_replace_ssa_lhs (gimple *, tree);
42 extern tree target_for_debug_bind (tree);
43 extern void insert_debug_temp_for_var_def (gimple_stmt_iterator *, tree);
44 extern void insert_debug_temps_for_defs (gimple_stmt_iterator *);
45 extern void reset_debug_uses (gimple *);
46 extern void release_defs_bitset (bitmap toremove);
47 extern void verify_ssa (bool, bool);
48 extern void init_tree_ssa (function *, int size = 0);
49 extern void delete_tree_ssa (function *);
50 extern bool tree_ssa_useless_type_conversion (tree);
51 extern tree tree_ssa_strip_useless_type_conversions (tree);
52 extern tree find_released_ssa_name (tree *, int *, void *);
55 extern bool ssa_defined_default_def_p (tree t);
56 extern bool ssa_undefined_value_p (tree, bool = true);
59 bool ssa_name_any_use_dominates_bb_p (tree var, basic_block bb);
60 extern void mark_ssa_maybe_undefs (void);
62 /* Return TRUE iff VAR is marked as maybe-undefined. See
63 mark_ssa_maybe_undefs. */
65 inline bool
66 ssa_name_maybe_undef_p (tree var)
68 gcc_checking_assert (TREE_CODE (var) == SSA_NAME);
69 return TREE_VISITED (var);
72 /* Set (or clear, depending on VALUE) VAR's maybe-undefined mark. */
74 inline void
75 ssa_name_set_maybe_undef (tree var, bool value = true)
77 gcc_checking_assert (TREE_CODE (var) == SSA_NAME);
78 TREE_VISITED (var) = value;
82 extern void execute_update_addresses_taken (void);
84 /* Given an edge_var_map V, return the PHI arg definition. */
86 inline tree
87 redirect_edge_var_map_def (edge_var_map *v)
89 return v->def;
92 /* Given an edge_var_map V, return the PHI result. */
94 inline tree
95 redirect_edge_var_map_result (edge_var_map *v)
97 return v->result;
100 /* Given an edge_var_map V, return the PHI arg location. */
102 inline location_t
103 redirect_edge_var_map_location (edge_var_map *v)
105 return v->locus;
108 /* Verify SSA invariants, if internal consistency checks are enabled. */
110 inline void
111 checking_verify_ssa (bool check_modified_stmt, bool check_ssa_operands)
113 if (flag_checking)
114 verify_ssa (check_modified_stmt, check_ssa_operands);
117 #endif /* GCC_TREE_SSA_H */