]>
Commit | Line | Data |
---|---|---|
8f6fa493 | 1 | /* Header file for routines that straddle the border between GIMPLE and |
2 | SSA in gimple. | |
d353bf18 | 3 | Copyright (C) 2009-2015 Free Software Foundation, Inc. |
8f6fa493 | 4 | |
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 3, or (at your option) | |
10 | any later version. | |
11 | ||
12 | GCC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GCC; see the file COPYING3. If not see | |
19 | <http://www.gnu.org/licenses/>. */ | |
20 | ||
21 | #ifndef GCC_GIMPLE_SSA_H | |
22 | #define GCC_GIMPLE_SSA_H | |
23 | ||
2ef51f0e | 24 | #include "tree-hasher.h" |
dd9784d4 | 25 | #include "tree-ssa-operands.h" |
26 | ||
582791b0 | 27 | /* This structure is used to map a gimple statement to a label, |
28 | or list of labels to represent transaction restart. */ | |
29 | ||
b7aa58e4 | 30 | struct GTY((for_user)) tm_restart_node { |
582791b0 | 31 | gimple stmt; |
32 | tree label_or_list; | |
33 | }; | |
34 | ||
b7aa58e4 | 35 | /* Hasher for tm_restart_node. */ |
36 | ||
b594087e | 37 | struct tm_restart_hasher : ggc_ptr_hash<tm_restart_node> |
b7aa58e4 | 38 | { |
39 | static hashval_t hash (tm_restart_node *n) { return htab_hash_pointer (n); } | |
40 | ||
41 | static bool | |
42 | equal (tm_restart_node *a, tm_restart_node *b) | |
43 | { | |
44 | return a == b; | |
45 | } | |
46 | }; | |
47 | ||
b594087e | 48 | struct ssa_name_hasher : ggc_ptr_hash<tree_node> |
2ef51f0e | 49 | { |
50 | /* Hash a tree in a uid_decl_map. */ | |
51 | ||
52 | static hashval_t | |
53 | hash (tree item) | |
54 | { | |
55 | return item->ssa_name.var->decl_minimal.uid; | |
56 | } | |
57 | ||
58 | /* Return true if the DECL_UID in both trees are equal. */ | |
59 | ||
60 | static bool | |
61 | equal (tree a, tree b) | |
62 | { | |
63 | return (a->ssa_name.var->decl_minimal.uid == b->ssa_name.var->decl_minimal.uid); | |
64 | } | |
65 | }; | |
66 | ||
582791b0 | 67 | /* Gimple dataflow datastructure. All publicly available fields shall have |
68 | gimple_ accessor defined, all publicly modifiable fields should have | |
69 | gimple_set accessor. */ | |
70 | struct GTY(()) gimple_df { | |
71 | /* A vector of all the noreturn calls passed to modify_stmt. | |
72 | cleanup_control_flow uses it to detect cases where a mid-block | |
73 | indirect call has been turned into a noreturn call. When this | |
74 | happens, all the instructions after the call are no longer | |
75 | reachable and must be deleted as dead. */ | |
76 | vec<gimple, va_gc> *modified_noreturn_calls; | |
77 | ||
78 | /* Array of all SSA_NAMEs used in the function. */ | |
79 | vec<tree, va_gc> *ssa_names; | |
80 | ||
81 | /* Artificial variable used for the virtual operand FUD chain. */ | |
82 | tree vop; | |
83 | ||
84 | /* The PTA solution for the ESCAPED artificial variable. */ | |
85 | struct pt_solution escaped; | |
86 | ||
87 | /* A map of decls to artificial ssa-names that point to the partition | |
88 | of the decl. */ | |
5f8841a5 | 89 | hash_map<tree, tree> * GTY((skip(""))) decls_to_pointers; |
582791b0 | 90 | |
91 | /* Free list of SSA_NAMEs. */ | |
92 | vec<tree, va_gc> *free_ssanames; | |
93 | ||
94 | /* Hashtable holding definition for symbol. If this field is not NULL, it | |
95 | means that the first reference to this variable in the function is a | |
96 | USE or a VUSE. In those cases, the SSA renamer creates an SSA name | |
97 | for this variable with an empty defining statement. */ | |
2ef51f0e | 98 | hash_table<ssa_name_hasher> *default_defs; |
582791b0 | 99 | |
100 | /* True if there are any symbols that need to be renamed. */ | |
101 | unsigned int ssa_renaming_needed : 1; | |
102 | ||
103 | /* True if all virtual operands need to be renamed. */ | |
104 | unsigned int rename_vops : 1; | |
105 | ||
106 | /* True if the code is in ssa form. */ | |
107 | unsigned int in_ssa_p : 1; | |
108 | ||
109 | /* True if IPA points-to information was computed for this function. */ | |
110 | unsigned int ipa_pta : 1; | |
111 | ||
112 | struct ssa_operands ssa_operands; | |
113 | ||
114 | /* Map gimple stmt to tree label (or list of labels) for transaction | |
115 | restart and abort. */ | |
b7aa58e4 | 116 | hash_table<tm_restart_hasher> *tm_restart; |
582791b0 | 117 | }; |
118 | ||
119 | ||
120 | /* Return true when gimple SSA form was built. | |
121 | gimple_in_ssa_p is queried by gimplifier in various early stages before SSA | |
122 | infrastructure is initialized. Check for presence of the datastructures | |
123 | at first place. */ | |
124 | static inline bool | |
125 | gimple_in_ssa_p (const struct function *fun) | |
126 | { | |
127 | return fun && fun->gimple_df && fun->gimple_df->in_ssa_p; | |
128 | } | |
129 | ||
582791b0 | 130 | /* Artificial variable used for the virtual operand FUD chain. */ |
131 | static inline tree | |
132 | gimple_vop (const struct function *fun) | |
133 | { | |
134 | gcc_checking_assert (fun && fun->gimple_df); | |
135 | return fun->gimple_df->vop; | |
136 | } | |
137 | ||
8f6fa493 | 138 | /* Return the set of VUSE operand for statement G. */ |
139 | ||
140 | static inline use_operand_p | |
141 | gimple_vuse_op (const_gimple g) | |
142 | { | |
143 | struct use_optype_d *ops; | |
de6bd75e | 144 | const gimple_statement_with_memory_ops *mem_ops_stmt = |
13cbeaac | 145 | dyn_cast <const gimple_statement_with_memory_ops *> (g); |
de6bd75e | 146 | if (!mem_ops_stmt) |
8f6fa493 | 147 | return NULL_USE_OPERAND_P; |
de6bd75e | 148 | ops = mem_ops_stmt->use_ops; |
8f6fa493 | 149 | if (ops |
de6bd75e | 150 | && USE_OP_PTR (ops)->use == &mem_ops_stmt->vuse) |
8f6fa493 | 151 | return USE_OP_PTR (ops); |
152 | return NULL_USE_OPERAND_P; | |
153 | } | |
154 | ||
155 | /* Return the set of VDEF operand for statement G. */ | |
156 | ||
157 | static inline def_operand_p | |
158 | gimple_vdef_op (gimple g) | |
159 | { | |
de6bd75e | 160 | gimple_statement_with_memory_ops *mem_ops_stmt = |
13cbeaac | 161 | dyn_cast <gimple_statement_with_memory_ops *> (g); |
de6bd75e | 162 | if (!mem_ops_stmt) |
8f6fa493 | 163 | return NULL_DEF_OPERAND_P; |
de6bd75e | 164 | if (mem_ops_stmt->vdef) |
165 | return &mem_ops_stmt->vdef; | |
8f6fa493 | 166 | return NULL_DEF_OPERAND_P; |
167 | } | |
168 | ||
169 | /* Mark statement S as modified, and update it. */ | |
170 | ||
171 | static inline void | |
172 | update_stmt (gimple s) | |
173 | { | |
174 | if (gimple_has_ops (s)) | |
175 | { | |
176 | gimple_set_modified (s, true); | |
861b4e39 | 177 | update_stmt_operands (cfun, s); |
8f6fa493 | 178 | } |
179 | } | |
180 | ||
181 | /* Update statement S if it has been optimized. */ | |
182 | ||
183 | static inline void | |
184 | update_stmt_if_modified (gimple s) | |
185 | { | |
186 | if (gimple_modified_p (s)) | |
861b4e39 | 187 | update_stmt_operands (cfun, s); |
188 | } | |
189 | ||
190 | /* Mark statement S as modified, and update it. */ | |
191 | ||
192 | static inline void | |
193 | update_stmt_fn (struct function *fn, gimple s) | |
194 | { | |
195 | if (gimple_has_ops (s)) | |
196 | { | |
197 | gimple_set_modified (s, true); | |
198 | update_stmt_operands (fn, s); | |
199 | } | |
8f6fa493 | 200 | } |
201 | ||
202 | ||
203 | #endif /* GCC_GIMPLE_SSA_H */ |