]>
Commit | Line | Data |
---|---|---|
1c4a429a | 1 | /* Callgraph handling code. |
c75c517d | 2 | Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 |
2bafad93 | 3 | Free Software Foundation, Inc. |
1c4a429a JH |
4 | Contributed by Jan Hubicka |
5 | ||
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify it under | |
9 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 10 | Software Foundation; either version 3, or (at your option) any later |
1c4a429a JH |
11 | version. |
12 | ||
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
1c4a429a JH |
21 | |
22 | #ifndef GCC_CGRAPH_H | |
23 | #define GCC_CGRAPH_H | |
7a8cba34 | 24 | |
051f8cc6 | 25 | #include "plugin-api.h" |
7a8cba34 | 26 | #include "vec.h" |
6674a6ce | 27 | #include "tree.h" |
e42922b1 | 28 | #include "basic-block.h" |
7a8cba34 SB |
29 | #include "function.h" |
30 | #include "ipa-ref.h" /* FIXME: inappropriate dependency of cgraph on IPA. */ | |
1c4a429a | 31 | |
6b02a499 JH |
32 | enum availability |
33 | { | |
34 | /* Not yet set by cgraph_function_body_availability. */ | |
35 | AVAIL_UNSET, | |
36 | /* Function body/variable initializer is unknown. */ | |
37 | AVAIL_NOT_AVAILABLE, | |
38 | /* Function body/variable initializer is known but might be replaced | |
39 | by a different one from other compilation unit and thus needs to | |
40 | be dealt with a care. Like AVAIL_NOT_AVAILABLE it can have | |
41 | arbitrary side effects on escaping variables and functions, while | |
42 | like AVAILABLE it might access static variables. */ | |
43 | AVAIL_OVERWRITABLE, | |
44 | /* Function body/variable initializer is known and will be used in final | |
45 | program. */ | |
46 | AVAIL_AVAILABLE, | |
47 | /* Function body/variable initializer is known and all it's uses are explicitly | |
48 | visible within current unit (ie it's address is never taken and it is not | |
49 | exported to other units). | |
50 | Currently used only for functions. */ | |
51 | AVAIL_LOCAL | |
52 | }; | |
53 | ||
d7f09764 DN |
54 | /* This is the information that is put into the cgraph local structure |
55 | to recover a function. */ | |
56 | struct lto_file_decl_data; | |
57 | ||
8a4a83ed JH |
58 | extern const char * const cgraph_availability_names[]; |
59 | ||
24b97832 ILT |
60 | /* Function inlining information. */ |
61 | ||
62 | struct GTY(()) inline_summary | |
63 | { | |
64 | /* Estimated stack frame consumption by the function. */ | |
65 | HOST_WIDE_INT estimated_self_stack_size; | |
66 | ||
85057983 JH |
67 | /* Size of the function body. */ |
68 | int self_size; | |
69 | /* How many instructions are likely going to disappear after inlining. */ | |
70 | int size_inlining_benefit; | |
71 | /* Estimated time spent executing the function body. */ | |
72 | int self_time; | |
73 | /* How much time is going to be saved by inlining. */ | |
74 | int time_inlining_benefit; | |
24b97832 ILT |
75 | }; |
76 | ||
6744a6ab JH |
77 | /* Information about thunk, used only for same body aliases. */ |
78 | ||
79 | struct GTY(()) cgraph_thunk_info { | |
80 | /* Information about the thunk. */ | |
81 | HOST_WIDE_INT fixed_offset; | |
82 | HOST_WIDE_INT virtual_value; | |
83 | tree alias; | |
84 | bool this_adjusting; | |
85 | bool virtual_offset_p; | |
86 | /* Set to true when alias node is thunk. */ | |
87 | bool thunk_p; | |
88 | }; | |
89 | ||
dafc5b82 | 90 | /* Information about the function collected locally. |
25c84396 | 91 | Available after function is analyzed. */ |
dafc5b82 | 92 | |
d1b38208 | 93 | struct GTY(()) cgraph_local_info { |
d7f09764 | 94 | /* File stream where this node is being written to. */ |
49ba8180 | 95 | struct lto_file_decl_data * lto_file_data; |
d7f09764 | 96 | |
24b97832 | 97 | struct inline_summary inline_summary; |
6674a6ce | 98 | |
e0bb17a8 | 99 | /* Set when function function is visible in current compilation unit only |
e2209b03 | 100 | and its address is never taken. */ |
b4e19405 | 101 | unsigned local : 1; |
6674a6ce | 102 | |
e7d6beb0 | 103 | /* Set when function is visible by other units. */ |
b4e19405 | 104 | unsigned externally_visible : 1; |
6d41cd02 | 105 | |
f6981e16 | 106 | /* Set once it has been finalized so we consider it to be output. */ |
b4e19405 | 107 | unsigned finalized : 1; |
b58b1157 | 108 | |
b3c3af2f | 109 | /* False when there something makes inlining impossible (such as va_arg). */ |
b4e19405 | 110 | unsigned inlinable : 1; |
6674a6ce | 111 | |
ccbbf8a2 JH |
112 | /* False when there something makes versioning impossible. |
113 | Currently computed and used only by ipa-cp. */ | |
114 | unsigned versionable : 1; | |
115 | ||
e2209b03 | 116 | /* True when function should be inlined independently on its size. */ |
b4e19405 | 117 | unsigned disregard_inline_limits : 1; |
6674a6ce | 118 | |
95c755e9 JH |
119 | /* True when the function has been originally extern inline, but it is |
120 | redefined now. */ | |
b4e19405 | 121 | unsigned redefined_extern_inline : 1; |
6674a6ce | 122 | |
8634c649 JJ |
123 | /* True if the function is going to be emitted in some other translation |
124 | unit, referenced from vtable. */ | |
b4e19405 | 125 | unsigned vtable_method : 1; |
dafc5b82 JH |
126 | }; |
127 | ||
128 | /* Information about the function that needs to be computed globally | |
726a989a | 129 | once compilation is finished. Available only with -funit-at-a-time. */ |
dafc5b82 | 130 | |
d1b38208 | 131 | struct GTY(()) cgraph_global_info { |
ff28a94d JH |
132 | /* Estimated stack frame consumption by the function. */ |
133 | HOST_WIDE_INT estimated_stack_size; | |
134 | /* Expected offset of the stack frame of inlined function. */ | |
135 | HOST_WIDE_INT stack_frame_offset; | |
136 | ||
726a989a RB |
137 | /* For inline clones this points to the function they will be |
138 | inlined into. */ | |
18c6ada9 JH |
139 | struct cgraph_node *inlined_to; |
140 | ||
b58b1157 | 141 | /* Estimated size of the function after inlining. */ |
85057983 JH |
142 | int time; |
143 | int size; | |
b58b1157 | 144 | |
670cd5c5 JH |
145 | /* Estimated growth after inlining. INT_MIN if not computed. */ |
146 | int estimated_growth; | |
dafc5b82 JH |
147 | }; |
148 | ||
b255a036 JH |
149 | /* Information about the function that is propagated by the RTL backend. |
150 | Available only for functions that has been already assembled. */ | |
151 | ||
d1b38208 | 152 | struct GTY(()) cgraph_rtl_info { |
17b29c0a | 153 | unsigned int preferred_incoming_stack_boundary; |
b255a036 JH |
154 | }; |
155 | ||
9187e02d JH |
156 | /* Represent which DECL tree (or reference to such tree) |
157 | will be replaced by another tree while versioning. */ | |
158 | struct GTY(()) ipa_replace_map | |
159 | { | |
160 | /* The tree that will be replaced. */ | |
161 | tree old_tree; | |
162 | /* The new (replacing) tree. */ | |
163 | tree new_tree; | |
922f15c2 JH |
164 | /* Parameter number to replace, when old_tree is NULL. */ |
165 | int parm_num; | |
9187e02d JH |
166 | /* True when a substitution should be done, false otherwise. */ |
167 | bool replace_p; | |
168 | /* True when we replace a reference to old_tree. */ | |
169 | bool ref_p; | |
170 | }; | |
171 | typedef struct ipa_replace_map *ipa_replace_map_p; | |
172 | DEF_VEC_P(ipa_replace_map_p); | |
173 | DEF_VEC_ALLOC_P(ipa_replace_map_p,gc); | |
174 | ||
175 | struct GTY(()) cgraph_clone_info | |
176 | { | |
177 | VEC(ipa_replace_map_p,gc)* tree_map; | |
178 | bitmap args_to_skip; | |
08ad1d6d | 179 | bitmap combined_args_to_skip; |
9187e02d JH |
180 | }; |
181 | ||
5fefcf92 JH |
182 | enum node_frequency { |
183 | /* This function most likely won't be executed at all. | |
184 | (set only when profile feedback is available or via function attribute). */ | |
185 | NODE_FREQUENCY_UNLIKELY_EXECUTED, | |
186 | /* For functions that are known to be executed once (i.e. constructors, destructors | |
187 | and main function. */ | |
188 | NODE_FREQUENCY_EXECUTED_ONCE, | |
189 | /* The default value. */ | |
190 | NODE_FREQUENCY_NORMAL, | |
191 | /* Optimize this function hard | |
192 | (set only when profile feedback is available or via function attribute). */ | |
193 | NODE_FREQUENCY_HOT | |
194 | }; | |
195 | ||
196 | ||
ba228239 | 197 | /* The cgraph data structure. |
e0bb17a8 | 198 | Each function decl has assigned cgraph_node listing callees and callers. */ |
1c4a429a | 199 | |
d1b38208 | 200 | struct GTY((chain_next ("%h.next"), chain_prev ("%h.previous"))) cgraph_node { |
1c4a429a JH |
201 | tree decl; |
202 | struct cgraph_edge *callees; | |
203 | struct cgraph_edge *callers; | |
ed2df68b JH |
204 | struct cgraph_node *next; |
205 | struct cgraph_node *previous; | |
e33c6cd6 MJ |
206 | /* List of edges representing indirect calls with a yet undetermined |
207 | callee. */ | |
208 | struct cgraph_edge *indirect_calls; | |
1c4a429a JH |
209 | /* For nested functions points to function the node is nested in. */ |
210 | struct cgraph_node *origin; | |
211 | /* Points to first nested function, if any. */ | |
212 | struct cgraph_node *nested; | |
213 | /* Pointer to the next function with same origin, if any. */ | |
214 | struct cgraph_node *next_nested; | |
8bd87c4e JH |
215 | /* Pointer to the next function in cgraph_nodes_queue. */ |
216 | struct cgraph_node *next_needed; | |
18c6ada9 | 217 | /* Pointer to the next clone. */ |
9187e02d JH |
218 | struct cgraph_node *next_sibling_clone; |
219 | struct cgraph_node *prev_sibling_clone; | |
220 | struct cgraph_node *clones; | |
221 | struct cgraph_node *clone_of; | |
6744a6ab JH |
222 | /* For normal nodes pointer to the list of alias and thunk nodes, |
223 | in alias/thunk nodes pointer to the normal node. */ | |
b2583345 | 224 | struct cgraph_node *same_body; |
b66887e4 JJ |
225 | /* Circular list of nodes in the same comdat group if non-NULL. */ |
226 | struct cgraph_node *same_comdat_group; | |
70d539ce JH |
227 | /* For functions with many calls sites it holds map from call expression |
228 | to the edge to speed up cgraph_edge function. */ | |
229 | htab_t GTY((param_is (struct cgraph_edge))) call_site_hash; | |
e466e2ce | 230 | #ifdef ENABLE_CHECKING |
753d358d JH |
231 | /* Declaration node used to be clone of. Used for checking only. |
232 | We must skip it or we get references from release checking GGC files. */ | |
233 | tree GTY ((skip)) former_clone_of; | |
e466e2ce | 234 | #endif |
c22cacf3 | 235 | |
1431042e | 236 | PTR GTY ((skip)) aux; |
1c4a429a | 237 | |
0e3776db JH |
238 | /* Interprocedural passes scheduled to have their transform functions |
239 | applied next time we execute local pass on them. We maintain it | |
240 | per-function in order to allow IPA passes to introduce new functions. */ | |
241 | VEC(ipa_opt_pass,heap) * GTY((skip)) ipa_transforms_to_apply; | |
242 | ||
369451ec | 243 | struct ipa_ref_list ref_list; |
95c755e9 JH |
244 | struct cgraph_local_info local; |
245 | struct cgraph_global_info global; | |
246 | struct cgraph_rtl_info rtl; | |
9187e02d | 247 | struct cgraph_clone_info clone; |
6744a6ab | 248 | struct cgraph_thunk_info thunk; |
c22cacf3 | 249 | |
e42922b1 JH |
250 | /* Expected number of executions: calculated in profile.c. */ |
251 | gcov_type count; | |
95c755e9 JH |
252 | /* Unique id of the node. */ |
253 | int uid; | |
474eccc6 ILT |
254 | /* Ordering of all cgraph nodes. */ |
255 | int order; | |
b4e19405 | 256 | |
3691626c RG |
257 | /* unique id for profiling. pid is not suitable because of different |
258 | number of cfg nodes with -fprofile-generate and -fprofile-use */ | |
259 | int pid; | |
051f8cc6 | 260 | enum ld_plugin_symbol_resolution resolution; |
3691626c | 261 | |
0e3776db JH |
262 | /* Set when function must be output for some reason. The primary |
263 | use of this flag is to mark functions needed to be output for | |
264 | non-standard reason. Functions that are externally visible | |
265 | or reachable from functions needed to be output are marked | |
266 | by specialized flags. */ | |
b4e19405 | 267 | unsigned needed : 1; |
0e3776db JH |
268 | /* Set when function has address taken. |
269 | In current implementation it imply needed flag. */ | |
39ff5a96 | 270 | unsigned address_taken : 1; |
6b20f353 DS |
271 | /* Set when decl is an abstract function pointed to by the |
272 | ABSTRACT_DECL_ORIGIN of a reachable function. */ | |
273 | unsigned abstract_and_needed : 1; | |
1c4a429a | 274 | /* Set when function is reachable by call from other function |
b8698a0f | 275 | that is either reachable or needed. |
0e3776db JH |
276 | This flag is computed at original cgraph construction and then |
277 | updated in cgraph_remove_unreachable_nodes. Note that after | |
278 | cgraph_remove_unreachable_nodes cgraph still can contain unreachable | |
279 | nodes when they are needed for virtual clone instantiation. */ | |
b4e19405 | 280 | unsigned reachable : 1; |
a837268b JH |
281 | /* Set when function is reachable by call from other LTRANS partition. */ |
282 | unsigned reachable_from_other_partition : 1; | |
50674e96 | 283 | /* Set once the function is lowered (i.e. its CFG is built). */ |
b4e19405 | 284 | unsigned lowered : 1; |
25c84396 RH |
285 | /* Set once the function has been instantiated and its callee |
286 | lists created. */ | |
b4e19405 | 287 | unsigned analyzed : 1; |
92eb4438 JH |
288 | /* Set when function is available in the other LTRANS partition. |
289 | During WPA output it is used to mark nodes that are present in | |
290 | multiple partitions. */ | |
a837268b | 291 | unsigned in_other_partition : 1; |
257eb6e3 JH |
292 | /* Set when function is scheduled to be processed by local passes. */ |
293 | unsigned process : 1; | |
12527dce | 294 | /* Set for aliases once they got through assemble_alias. */ |
b4e19405 | 295 | unsigned alias : 1; |
d88e5c37 JH |
296 | /* Set for nodes that was constructed and finalized by frontend. */ |
297 | unsigned finalized_by_frontend : 1; | |
6744a6ab JH |
298 | /* Set for alias and thunk nodes, same_body points to the node they are alias |
299 | of and they are linked through the next/previous pointers. */ | |
b2583345 | 300 | unsigned same_body_alias : 1; |
5fefcf92 JH |
301 | /* How commonly executed the node is. Initialized during branch |
302 | probabilities pass. */ | |
303 | ENUM_BITFIELD (node_frequency) frequency : 2; | |
1c4a429a JH |
304 | }; |
305 | ||
fed5ae11 DK |
306 | typedef struct cgraph_node *cgraph_node_ptr; |
307 | ||
308 | DEF_VEC_P(cgraph_node_ptr); | |
309 | DEF_VEC_ALLOC_P(cgraph_node_ptr,heap); | |
310 | DEF_VEC_ALLOC_P(cgraph_node_ptr,gc); | |
311 | ||
312 | /* A cgraph node set is a collection of cgraph nodes. A cgraph node | |
313 | can appear in multiple sets. */ | |
d1b38208 | 314 | struct GTY(()) cgraph_node_set_def |
fed5ae11 DK |
315 | { |
316 | htab_t GTY((param_is (struct cgraph_node_set_element_def))) hashtab; | |
317 | VEC(cgraph_node_ptr, gc) *nodes; | |
fed5ae11 DK |
318 | }; |
319 | ||
2942c502 JH |
320 | typedef struct varpool_node *varpool_node_ptr; |
321 | ||
322 | DEF_VEC_P(varpool_node_ptr); | |
323 | DEF_VEC_ALLOC_P(varpool_node_ptr,heap); | |
324 | DEF_VEC_ALLOC_P(varpool_node_ptr,gc); | |
325 | ||
326 | /* A varpool node set is a collection of varpool nodes. A varpool node | |
327 | can appear in multiple sets. */ | |
328 | struct GTY(()) varpool_node_set_def | |
329 | { | |
330 | htab_t GTY((param_is (struct varpool_node_set_element_def))) hashtab; | |
331 | VEC(varpool_node_ptr, gc) *nodes; | |
2942c502 JH |
332 | }; |
333 | ||
fed5ae11 DK |
334 | typedef struct cgraph_node_set_def *cgraph_node_set; |
335 | ||
336 | DEF_VEC_P(cgraph_node_set); | |
337 | DEF_VEC_ALLOC_P(cgraph_node_set,gc); | |
338 | DEF_VEC_ALLOC_P(cgraph_node_set,heap); | |
339 | ||
2942c502 JH |
340 | typedef struct varpool_node_set_def *varpool_node_set; |
341 | ||
342 | DEF_VEC_P(varpool_node_set); | |
343 | DEF_VEC_ALLOC_P(varpool_node_set,gc); | |
344 | DEF_VEC_ALLOC_P(varpool_node_set,heap); | |
345 | ||
fed5ae11 DK |
346 | /* A cgraph node set element contains an index in the vector of nodes in |
347 | the set. */ | |
d1b38208 | 348 | struct GTY(()) cgraph_node_set_element_def |
fed5ae11 DK |
349 | { |
350 | struct cgraph_node *node; | |
351 | HOST_WIDE_INT index; | |
352 | }; | |
353 | ||
354 | typedef struct cgraph_node_set_element_def *cgraph_node_set_element; | |
355 | typedef const struct cgraph_node_set_element_def *const_cgraph_node_set_element; | |
356 | ||
357 | /* Iterator structure for cgraph node sets. */ | |
358 | typedef struct | |
359 | { | |
360 | cgraph_node_set set; | |
361 | unsigned index; | |
362 | } cgraph_node_set_iterator; | |
363 | ||
2942c502 JH |
364 | /* A varpool node set element contains an index in the vector of nodes in |
365 | the set. */ | |
366 | struct GTY(()) varpool_node_set_element_def | |
367 | { | |
368 | struct varpool_node *node; | |
369 | HOST_WIDE_INT index; | |
370 | }; | |
371 | ||
372 | typedef struct varpool_node_set_element_def *varpool_node_set_element; | |
373 | typedef const struct varpool_node_set_element_def *const_varpool_node_set_element; | |
374 | ||
375 | /* Iterator structure for varpool node sets. */ | |
376 | typedef struct | |
377 | { | |
378 | varpool_node_set set; | |
379 | unsigned index; | |
380 | } varpool_node_set_iterator; | |
381 | ||
61a05df1 JH |
382 | #define DEFCIFCODE(code, string) CIF_ ## code, |
383 | /* Reasons for inlining failures. */ | |
384 | typedef enum { | |
385 | #include "cif-code.def" | |
386 | CIF_N_REASONS | |
387 | } cgraph_inline_failed_t; | |
388 | ||
e33c6cd6 MJ |
389 | /* Structure containing additional information about an indirect call. */ |
390 | ||
391 | struct GTY(()) cgraph_indirect_call_info | |
392 | { | |
b258210c MJ |
393 | /* Offset accumulated from ancestor jump functions of inlined call graph |
394 | edges. */ | |
395 | HOST_WIDE_INT anc_offset; | |
396 | /* OBJ_TYPE_REF_TOKEN of a polymorphic call (if polymorphic is set). */ | |
397 | HOST_WIDE_INT otr_token; | |
398 | /* Type of the object from OBJ_TYPE_REF_OBJECT. */ | |
399 | tree otr_type; | |
e33c6cd6 MJ |
400 | /* Index of the parameter that is called. */ |
401 | int param_index; | |
5f902d76 JH |
402 | /* ECF flags determined from the caller. */ |
403 | int ecf_flags; | |
b258210c MJ |
404 | |
405 | /* Set when the call is a virtual call with the parameter being the | |
406 | associated object pointer rather than a simple direct call. */ | |
407 | unsigned polymorphic : 1; | |
e33c6cd6 MJ |
408 | }; |
409 | ||
d1b38208 | 410 | struct GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"))) cgraph_edge { |
6009ee7b MJ |
411 | /* Expected number of executions: calculated in profile.c. */ |
412 | gcov_type count; | |
ed2df68b JH |
413 | struct cgraph_node *caller; |
414 | struct cgraph_node *callee; | |
2563c224 | 415 | struct cgraph_edge *prev_caller; |
1c4a429a | 416 | struct cgraph_edge *next_caller; |
2563c224 | 417 | struct cgraph_edge *prev_callee; |
1c4a429a | 418 | struct cgraph_edge *next_callee; |
726a989a | 419 | gimple call_stmt; |
e33c6cd6 MJ |
420 | /* Additional information about an indirect call. Not cleared when an edge |
421 | becomes direct. */ | |
422 | struct cgraph_indirect_call_info *indirect_info; | |
18c6ada9 | 423 | PTR GTY ((skip (""))) aux; |
61a05df1 JH |
424 | /* When equal to CIF_OK, inline this call. Otherwise, points to the |
425 | explanation why function was not inlined. */ | |
426 | cgraph_inline_failed_t inline_failed; | |
6009ee7b MJ |
427 | /* The stmt_uid of call_stmt. This is used by LTO to recover the call_stmt |
428 | when the function is serialized in. */ | |
429 | unsigned int lto_stmt_uid; | |
b8698a0f | 430 | /* Expected frequency of executions within the function. |
45a80bb9 JH |
431 | When set to CGRAPH_FREQ_BASE, the edge is expected to be called once |
432 | per function call. The range is 0 to CGRAPH_FREQ_MAX. */ | |
433 | int frequency; | |
6009ee7b MJ |
434 | /* Unique id of the edge. */ |
435 | int uid; | |
e42922b1 | 436 | /* Depth of loop nest, 1 means no loop nest. */ |
6009ee7b | 437 | unsigned short int loop_nest; |
e33c6cd6 MJ |
438 | /* Whether this edge was made direct by indirect inlining. */ |
439 | unsigned int indirect_inlining_edge : 1; | |
440 | /* Whether this edge describes an indirect call with an undetermined | |
441 | callee. */ | |
442 | unsigned int indirect_unknown_callee : 1; | |
443 | /* Whether this edge is still a dangling */ | |
d7f09764 DN |
444 | /* True if the corresponding CALL stmt cannot be inlined. */ |
445 | unsigned int call_stmt_cannot_inline_p : 1; | |
2505c5ed JH |
446 | /* Can this call throw externally? */ |
447 | unsigned int can_throw_external : 1; | |
1c4a429a JH |
448 | }; |
449 | ||
45a80bb9 JH |
450 | #define CGRAPH_FREQ_BASE 1000 |
451 | #define CGRAPH_FREQ_MAX 100000 | |
452 | ||
b2c0ad40 KH |
453 | typedef struct cgraph_edge *cgraph_edge_p; |
454 | ||
455 | DEF_VEC_P(cgraph_edge_p); | |
456 | DEF_VEC_ALLOC_P(cgraph_edge_p,heap); | |
457 | ||
8a4a83ed JH |
458 | /* The varpool data structure. |
459 | Each static variable decl has assigned varpool_node. */ | |
e69529cd | 460 | |
369451ec | 461 | struct GTY((chain_next ("%h.next"), chain_prev ("%h.prev"))) varpool_node { |
e69529cd | 462 | tree decl; |
8a4a83ed | 463 | /* Pointer to the next function in varpool_nodes. */ |
2942c502 | 464 | struct varpool_node *next, *prev; |
8a4a83ed | 465 | /* Pointer to the next function in varpool_nodes_queue. */ |
2942c502 | 466 | struct varpool_node *next_needed, *prev_needed; |
2c71ac78 JM |
467 | /* For normal nodes a pointer to the first extra name alias. For alias |
468 | nodes a pointer to the normal node. */ | |
469 | struct varpool_node *extra_name; | |
9f90e80a JH |
470 | /* Circular list of nodes in the same comdat group if non-NULL. */ |
471 | struct varpool_node *same_comdat_group; | |
369451ec | 472 | struct ipa_ref_list ref_list; |
d4c0c9f6 RG |
473 | /* File stream where this node is being written to. */ |
474 | struct lto_file_decl_data * lto_file_data; | |
b34fd25c | 475 | PTR GTY ((skip)) aux; |
474eccc6 ILT |
476 | /* Ordering of all cgraph nodes. */ |
477 | int order; | |
051f8cc6 | 478 | enum ld_plugin_symbol_resolution resolution; |
e69529cd JH |
479 | |
480 | /* Set when function must be output - it is externally visible | |
e2209b03 | 481 | or its address is taken. */ |
b4e19405 | 482 | unsigned needed : 1; |
cd9c7bd2 JH |
483 | /* Needed variables might become dead by optimization. This flag |
484 | forces the variable to be output even if it appears dead otherwise. */ | |
b4e19405 | 485 | unsigned force_output : 1; |
cd9c7bd2 JH |
486 | /* Set once the variable has been instantiated and its callee |
487 | lists created. */ | |
b4e19405 | 488 | unsigned analyzed : 1; |
e69529cd | 489 | /* Set once it has been finalized so we consider it to be output. */ |
b4e19405 | 490 | unsigned finalized : 1; |
6b02a499 | 491 | /* Set when variable is scheduled to be assembled. */ |
b4e19405 | 492 | unsigned output : 1; |
e7d6beb0 | 493 | /* Set when function is visible by other units. */ |
b4e19405 | 494 | unsigned externally_visible : 1; |
2c71ac78 JM |
495 | /* Set for aliases once they got through assemble_alias. Also set for |
496 | extra name aliases in varpool_extra_name_alias. */ | |
b4e19405 | 497 | unsigned alias : 1; |
2942c502 JH |
498 | /* Set when variable is used from other LTRANS partition. */ |
499 | unsigned used_from_other_partition : 1; | |
92eb4438 JH |
500 | /* Set when variable is available in the other LTRANS partition. |
501 | During WPA output it is used to mark nodes that are present in | |
502 | multiple partitions. */ | |
2942c502 | 503 | unsigned in_other_partition : 1; |
e69529cd JH |
504 | }; |
505 | ||
474eccc6 ILT |
506 | /* Every top level asm statement is put into a cgraph_asm_node. */ |
507 | ||
d1b38208 | 508 | struct GTY(()) cgraph_asm_node { |
474eccc6 ILT |
509 | /* Next asm node. */ |
510 | struct cgraph_asm_node *next; | |
511 | /* String for this asm node. */ | |
512 | tree asm_str; | |
513 | /* Ordering of all cgraph nodes. */ | |
514 | int order; | |
515 | }; | |
516 | ||
ed2df68b JH |
517 | extern GTY(()) struct cgraph_node *cgraph_nodes; |
518 | extern GTY(()) int cgraph_n_nodes; | |
b58b1157 | 519 | extern GTY(()) int cgraph_max_uid; |
9088c1cc | 520 | extern GTY(()) int cgraph_edge_max_uid; |
6bad2617 | 521 | extern GTY(()) int cgraph_max_pid; |
dafc5b82 | 522 | extern bool cgraph_global_info_ready; |
f45e0ad1 JH |
523 | enum cgraph_state |
524 | { | |
525 | /* Callgraph is being constructed. It is safe to add new functions. */ | |
526 | CGRAPH_STATE_CONSTRUCTION, | |
527 | /* Callgraph is built and IPA passes are being run. */ | |
528 | CGRAPH_STATE_IPA, | |
7a388ee4 JH |
529 | /* Callgraph is built and all functions are transformed to SSA form. */ |
530 | CGRAPH_STATE_IPA_SSA, | |
f45e0ad1 JH |
531 | /* Functions are now ordered and being passed to RTL expanders. */ |
532 | CGRAPH_STATE_EXPANSION, | |
533 | /* All cgraph expansion is done. */ | |
534 | CGRAPH_STATE_FINISHED | |
535 | }; | |
536 | extern enum cgraph_state cgraph_state; | |
e7d6beb0 | 537 | extern bool cgraph_function_flags_ready; |
ed2df68b | 538 | extern GTY(()) struct cgraph_node *cgraph_nodes_queue; |
f45e0ad1 | 539 | extern GTY(()) struct cgraph_node *cgraph_new_nodes; |
1c4a429a | 540 | |
474eccc6 ILT |
541 | extern GTY(()) struct cgraph_asm_node *cgraph_asm_nodes; |
542 | extern GTY(()) int cgraph_order; | |
e69529cd | 543 | |
1c4a429a | 544 | /* In cgraph.c */ |
439f7bc3 | 545 | void dump_cgraph (FILE *); |
c4e622b6 | 546 | void debug_cgraph (void); |
18c6ada9 | 547 | void dump_cgraph_node (FILE *, struct cgraph_node *); |
c4e622b6 | 548 | void debug_cgraph_node (struct cgraph_node *); |
ea99e0be | 549 | void cgraph_insert_node_to_hashtable (struct cgraph_node *node); |
18c6ada9 | 550 | void cgraph_remove_edge (struct cgraph_edge *); |
439f7bc3 | 551 | void cgraph_remove_node (struct cgraph_node *); |
9187e02d | 552 | void cgraph_remove_node_and_inline_clones (struct cgraph_node *); |
3a40c18a | 553 | void cgraph_release_function_body (struct cgraph_node *); |
2563c224 | 554 | void cgraph_node_remove_callees (struct cgraph_node *node); |
18c6ada9 JH |
555 | struct cgraph_edge *cgraph_create_edge (struct cgraph_node *, |
556 | struct cgraph_node *, | |
726a989a | 557 | gimple, gcov_type, int, int); |
5f902d76 | 558 | struct cgraph_edge *cgraph_create_indirect_edge (struct cgraph_node *, gimple, int, |
e33c6cd6 | 559 | gcov_type, int, int); |
051f8cc6 JH |
560 | struct cgraph_node * cgraph_get_node (const_tree); |
561 | struct cgraph_node * cgraph_get_node_or_alias (const_tree); | |
562 | struct cgraph_node * cgraph_node (tree); | |
563 | struct cgraph_node * cgraph_same_body_alias (tree, tree); | |
564 | struct cgraph_node * cgraph_add_thunk (tree, tree, bool, HOST_WIDE_INT, | |
565 | HOST_WIDE_INT, tree, tree); | |
b2583345 | 566 | void cgraph_remove_same_body_alias (struct cgraph_node *); |
4537ec0c | 567 | struct cgraph_node *cgraph_node_for_asm (tree); |
726a989a RB |
568 | struct cgraph_edge *cgraph_edge (struct cgraph_node *, gimple); |
569 | void cgraph_set_call_stmt (struct cgraph_edge *, gimple); | |
9187e02d JH |
570 | void cgraph_set_call_stmt_including_clones (struct cgraph_node *, gimple, gimple); |
571 | void cgraph_create_edge_including_clones (struct cgraph_node *, | |
572 | struct cgraph_node *, | |
47cb0d7d | 573 | gimple, gimple, gcov_type, int, int, |
9187e02d | 574 | cgraph_inline_failed_t); |
4b685e14 | 575 | void cgraph_update_edges_for_call_stmt (gimple, tree, gimple); |
439f7bc3 AJ |
576 | struct cgraph_local_info *cgraph_local_info (tree); |
577 | struct cgraph_global_info *cgraph_global_info (tree); | |
578 | struct cgraph_rtl_info *cgraph_rtl_info (tree); | |
579 | const char * cgraph_node_name (struct cgraph_node *); | |
c5a4444c | 580 | struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *, |
d7f09764 DN |
581 | struct cgraph_node *, gimple, |
582 | unsigned, gcov_type, int, int, bool); | |
91fbf0c7 | 583 | struct cgraph_node * cgraph_clone_node (struct cgraph_node *, tree, gcov_type, int, |
03ec7d01 | 584 | int, bool, VEC(cgraph_edge_p,heap) *); |
1c4a429a | 585 | |
18c6ada9 | 586 | void cgraph_redirect_edge_callee (struct cgraph_edge *, struct cgraph_node *); |
e33c6cd6 | 587 | void cgraph_make_edge_direct (struct cgraph_edge *, struct cgraph_node *); |
e69529cd | 588 | |
474eccc6 ILT |
589 | struct cgraph_asm_node *cgraph_add_asm_node (tree); |
590 | ||
1bb17c21 | 591 | bool cgraph_function_possibly_inlined_p (tree); |
e42922b1 | 592 | void cgraph_unnest_node (struct cgraph_node *); |
1bb17c21 | 593 | |
6b02a499 | 594 | enum availability cgraph_function_body_availability (struct cgraph_node *); |
f45e0ad1 | 595 | void cgraph_add_new_function (tree, bool); |
61a05df1 | 596 | const char* cgraph_inline_failed_string (cgraph_inline_failed_t); |
9187e02d JH |
597 | struct cgraph_node * cgraph_create_virtual_clone (struct cgraph_node *old_node, |
598 | VEC(cgraph_edge_p,heap)*, | |
599 | VEC(ipa_replace_map_p,gc)* tree_map, | |
036546e5 JH |
600 | bitmap args_to_skip, |
601 | const char *clone_name); | |
6b02a499 | 602 | |
20cdc2be JJ |
603 | void cgraph_set_nothrow_flag (struct cgraph_node *, bool); |
604 | void cgraph_set_readonly_flag (struct cgraph_node *, bool); | |
605 | void cgraph_set_pure_flag (struct cgraph_node *, bool); | |
606 | void cgraph_set_looping_const_or_pure_flag (struct cgraph_node *, bool); | |
036546e5 | 607 | tree clone_function_name (tree decl, const char *); |
d56026c2 JH |
608 | bool cgraph_node_cannot_return (struct cgraph_node *); |
609 | bool cgraph_edge_cannot_lead_to_return (struct cgraph_edge *); | |
508e4757 JH |
610 | bool cgraph_will_be_removed_from_program_if_no_direct_calls |
611 | (struct cgraph_node *node); | |
612 | bool cgraph_can_remove_if_no_direct_calls_and_refs_p | |
613 | (struct cgraph_node *node); | |
051f8cc6 JH |
614 | bool resolution_used_from_other_file_p (enum ld_plugin_symbol_resolution resolution); |
615 | bool cgraph_used_from_object_file_p (struct cgraph_node *node); | |
616 | bool varpool_used_from_object_file_p (struct varpool_node *node); | |
20cdc2be | 617 | |
1c4a429a | 618 | /* In cgraphunit.c */ |
0a5fa5a1 | 619 | extern FILE *cgraph_dump_file; |
6b00c969 | 620 | void cgraph_finalize_function (tree, bool); |
f0c882ab | 621 | void cgraph_mark_if_needed (tree); |
439f7bc3 | 622 | void cgraph_finalize_compilation_unit (void); |
d7f09764 | 623 | void cgraph_optimize (void); |
8dafba3c | 624 | void cgraph_mark_needed_node (struct cgraph_node *); |
39ff5a96 | 625 | void cgraph_mark_address_taken_node (struct cgraph_node *); |
8dafba3c | 626 | void cgraph_mark_reachable_node (struct cgraph_node *); |
61a05df1 | 627 | bool cgraph_inline_p (struct cgraph_edge *, cgraph_inline_failed_t *reason); |
18c6ada9 JH |
628 | bool cgraph_preserve_function_body_p (tree); |
629 | void verify_cgraph (void); | |
630 | void verify_cgraph_node (struct cgraph_node *); | |
35b6fdcf | 631 | void cgraph_build_static_cdtor (char which, tree body, int priority); |
6674a6ce | 632 | void cgraph_reset_static_var_maps (void); |
9b3e897d | 633 | void init_cgraph (void); |
57fb5341 | 634 | struct cgraph_node *cgraph_function_versioning (struct cgraph_node *, |
c22cacf3 | 635 | VEC(cgraph_edge_p,heap)*, |
9187e02d | 636 | VEC(ipa_replace_map_p,gc)*, |
91382288 JH |
637 | bitmap, bitmap, basic_block, |
638 | const char *); | |
639 | void tree_function_versioning (tree, tree, VEC (ipa_replace_map_p,gc)*, bool, bitmap, | |
640 | bitmap, basic_block); | |
ea99e0be | 641 | struct cgraph_node *save_inline_function_body (struct cgraph_node *); |
625f802c | 642 | void record_references_in_initializer (tree, bool); |
f45e0ad1 | 643 | bool cgraph_process_new_functions (void); |
1c4a429a | 644 | |
d7f09764 DN |
645 | bool cgraph_decide_is_function_needed (struct cgraph_node *, tree); |
646 | ||
9088c1cc MJ |
647 | typedef void (*cgraph_edge_hook)(struct cgraph_edge *, void *); |
648 | typedef void (*cgraph_node_hook)(struct cgraph_node *, void *); | |
649 | typedef void (*cgraph_2edge_hook)(struct cgraph_edge *, struct cgraph_edge *, | |
650 | void *); | |
651 | typedef void (*cgraph_2node_hook)(struct cgraph_node *, struct cgraph_node *, | |
652 | void *); | |
653 | struct cgraph_edge_hook_list; | |
654 | struct cgraph_node_hook_list; | |
655 | struct cgraph_2edge_hook_list; | |
656 | struct cgraph_2node_hook_list; | |
657 | struct cgraph_edge_hook_list *cgraph_add_edge_removal_hook (cgraph_edge_hook, void *); | |
658 | void cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *); | |
659 | struct cgraph_node_hook_list *cgraph_add_node_removal_hook (cgraph_node_hook, | |
660 | void *); | |
661 | void cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *); | |
129a37fc JH |
662 | struct cgraph_node_hook_list *cgraph_add_function_insertion_hook (cgraph_node_hook, |
663 | void *); | |
664 | void cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *); | |
665 | void cgraph_call_function_insertion_hooks (struct cgraph_node *node); | |
9088c1cc MJ |
666 | struct cgraph_2edge_hook_list *cgraph_add_edge_duplication_hook (cgraph_2edge_hook, void *); |
667 | void cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *); | |
668 | struct cgraph_2node_hook_list *cgraph_add_node_duplication_hook (cgraph_2node_hook, void *); | |
669 | void cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *); | |
9187e02d | 670 | void cgraph_materialize_all_clones (void); |
8132a837 | 671 | gimple cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge *); |
fa5f5e27 | 672 | bool cgraph_propagate_frequency (struct cgraph_node *node); |
917948d3 ZD |
673 | /* In cgraphbuild.c */ |
674 | unsigned int rebuild_cgraph_edges (void); | |
99b766fc | 675 | void cgraph_rebuild_references (void); |
d7f09764 | 676 | void reset_inline_failed (struct cgraph_node *); |
9187e02d | 677 | int compute_call_stmt_bb_frequency (tree, basic_block bb); |
917948d3 | 678 | |
ca31b95f JH |
679 | /* In ipa.c */ |
680 | bool cgraph_remove_unreachable_nodes (bool, FILE *); | |
681 | int cgraph_postorder (struct cgraph_node **); | |
fed5ae11 DK |
682 | cgraph_node_set cgraph_node_set_new (void); |
683 | cgraph_node_set_iterator cgraph_node_set_find (cgraph_node_set, | |
684 | struct cgraph_node *); | |
685 | void cgraph_node_set_add (cgraph_node_set, struct cgraph_node *); | |
686 | void cgraph_node_set_remove (cgraph_node_set, struct cgraph_node *); | |
687 | void dump_cgraph_node_set (FILE *, cgraph_node_set); | |
688 | void debug_cgraph_node_set (cgraph_node_set); | |
689 | ||
2942c502 JH |
690 | varpool_node_set varpool_node_set_new (void); |
691 | varpool_node_set_iterator varpool_node_set_find (varpool_node_set, | |
692 | struct varpool_node *); | |
693 | void varpool_node_set_add (varpool_node_set, struct varpool_node *); | |
694 | void varpool_node_set_remove (varpool_node_set, struct varpool_node *); | |
695 | void dump_varpool_node_set (FILE *, varpool_node_set); | |
696 | void debug_varpool_node_set (varpool_node_set); | |
4a444e58 | 697 | void ipa_discover_readonly_nonaddressable_vars (void); |
ca31b95f | 698 | |
fed5ae11 | 699 | /* In predict.c */ |
ca30a539 JH |
700 | bool cgraph_maybe_hot_edge_p (struct cgraph_edge *e); |
701 | ||
8a4a83ed | 702 | /* In varpool.c */ |
8a4a83ed JH |
703 | extern GTY(()) struct varpool_node *varpool_nodes_queue; |
704 | extern GTY(()) struct varpool_node *varpool_nodes; | |
705 | ||
706 | struct varpool_node *varpool_node (tree); | |
707 | struct varpool_node *varpool_node_for_asm (tree asmname); | |
708 | void varpool_mark_needed_node (struct varpool_node *); | |
d85478c2 | 709 | void debug_varpool (void); |
8a4a83ed JH |
710 | void dump_varpool (FILE *); |
711 | void dump_varpool_node (FILE *, struct varpool_node *); | |
712 | ||
713 | void varpool_finalize_decl (tree); | |
714 | bool decide_is_variable_needed (struct varpool_node *, tree); | |
715 | enum availability cgraph_variable_initializer_availability (struct varpool_node *); | |
715a4e08 | 716 | void cgraph_make_decl_local (tree); |
a550d677 MJ |
717 | void cgraph_make_node_local (struct cgraph_node *); |
718 | bool cgraph_node_can_be_local_p (struct cgraph_node *); | |
8a4a83ed | 719 | |
2942c502 | 720 | |
051f8cc6 | 721 | struct varpool_node * varpool_get_node (const_tree decl); |
2942c502 | 722 | void varpool_remove_node (struct varpool_node *node); |
8a4a83ed JH |
723 | bool varpool_assemble_pending_decls (void); |
724 | bool varpool_assemble_decl (struct varpool_node *node); | |
725 | bool varpool_analyze_pending_decls (void); | |
8a4a83ed | 726 | void varpool_remove_unreferenced_decls (void); |
7386e3ee | 727 | void varpool_empty_needed_queue (void); |
051f8cc6 | 728 | struct varpool_node * varpool_extra_name_alias (tree, tree); |
a8289259 | 729 | const char * varpool_node_name (struct varpool_node *node); |
b34fd25c | 730 | void varpool_reset_queue (void); |
64e0f5ff | 731 | bool const_value_known_p (tree); |
8a4a83ed | 732 | |
68e56cc4 JH |
733 | /* Walk all reachable static variables. */ |
734 | #define FOR_EACH_STATIC_VARIABLE(node) \ | |
735 | for ((node) = varpool_nodes_queue; (node); (node) = (node)->next_needed) | |
736 | ||
737 | /* Return first reachable static variable with initializer. */ | |
738 | static inline struct varpool_node * | |
739 | varpool_first_static_initializer (void) | |
740 | { | |
741 | struct varpool_node *node; | |
742 | for (node = varpool_nodes_queue; node; node = node->next_needed) | |
743 | { | |
06795261 | 744 | gcc_checking_assert (TREE_CODE (node->decl) == VAR_DECL); |
68e56cc4 JH |
745 | if (DECL_INITIAL (node->decl)) |
746 | return node; | |
747 | } | |
748 | return NULL; | |
749 | } | |
750 | ||
751 | /* Return next reachable static variable with initializer after NODE. */ | |
752 | static inline struct varpool_node * | |
753 | varpool_next_static_initializer (struct varpool_node *node) | |
754 | { | |
755 | for (node = node->next_needed; node; node = node->next_needed) | |
756 | { | |
06795261 | 757 | gcc_checking_assert (TREE_CODE (node->decl) == VAR_DECL); |
68e56cc4 JH |
758 | if (DECL_INITIAL (node->decl)) |
759 | return node; | |
760 | } | |
761 | return NULL; | |
762 | } | |
763 | ||
764 | /* Walk all static variables with initializer set. */ | |
765 | #define FOR_EACH_STATIC_INITIALIZER(node) \ | |
766 | for ((node) = varpool_first_static_initializer (); (node); \ | |
767 | (node) = varpool_next_static_initializer (node)) | |
768 | ||
ca31b95f | 769 | /* In ipa-inline.c */ |
06191a23 | 770 | void cgraph_clone_inlined_nodes (struct cgraph_edge *, bool, bool); |
1920df6c | 771 | unsigned int compute_inline_parameters (struct cgraph_node *); |
43d861a5 RL |
772 | |
773 | ||
774 | /* Create a new static variable of type TYPE. */ | |
775 | tree add_new_static_var (tree type); | |
776 | ||
fed5ae11 DK |
777 | /* Return true if iterator CSI points to nothing. */ |
778 | static inline bool | |
779 | csi_end_p (cgraph_node_set_iterator csi) | |
780 | { | |
781 | return csi.index >= VEC_length (cgraph_node_ptr, csi.set->nodes); | |
782 | } | |
783 | ||
784 | /* Advance iterator CSI. */ | |
785 | static inline void | |
786 | csi_next (cgraph_node_set_iterator *csi) | |
787 | { | |
788 | csi->index++; | |
789 | } | |
790 | ||
791 | /* Return the node pointed to by CSI. */ | |
792 | static inline struct cgraph_node * | |
793 | csi_node (cgraph_node_set_iterator csi) | |
794 | { | |
795 | return VEC_index (cgraph_node_ptr, csi.set->nodes, csi.index); | |
796 | } | |
797 | ||
798 | /* Return an iterator to the first node in SET. */ | |
799 | static inline cgraph_node_set_iterator | |
800 | csi_start (cgraph_node_set set) | |
801 | { | |
802 | cgraph_node_set_iterator csi; | |
803 | ||
804 | csi.set = set; | |
805 | csi.index = 0; | |
806 | return csi; | |
807 | } | |
808 | ||
809 | /* Return true if SET contains NODE. */ | |
810 | static inline bool | |
811 | cgraph_node_in_set_p (struct cgraph_node *node, cgraph_node_set set) | |
812 | { | |
813 | cgraph_node_set_iterator csi; | |
814 | csi = cgraph_node_set_find (set, node); | |
815 | return !csi_end_p (csi); | |
816 | } | |
817 | ||
818 | /* Return number of nodes in SET. */ | |
819 | static inline size_t | |
820 | cgraph_node_set_size (cgraph_node_set set) | |
821 | { | |
822 | return htab_elements (set->hashtab); | |
823 | } | |
824 | ||
2942c502 JH |
825 | /* Return true if iterator VSI points to nothing. */ |
826 | static inline bool | |
827 | vsi_end_p (varpool_node_set_iterator vsi) | |
828 | { | |
829 | return vsi.index >= VEC_length (varpool_node_ptr, vsi.set->nodes); | |
830 | } | |
831 | ||
832 | /* Advance iterator VSI. */ | |
833 | static inline void | |
834 | vsi_next (varpool_node_set_iterator *vsi) | |
835 | { | |
836 | vsi->index++; | |
837 | } | |
838 | ||
839 | /* Return the node pointed to by VSI. */ | |
840 | static inline struct varpool_node * | |
841 | vsi_node (varpool_node_set_iterator vsi) | |
842 | { | |
843 | return VEC_index (varpool_node_ptr, vsi.set->nodes, vsi.index); | |
844 | } | |
845 | ||
846 | /* Return an iterator to the first node in SET. */ | |
847 | static inline varpool_node_set_iterator | |
848 | vsi_start (varpool_node_set set) | |
849 | { | |
850 | varpool_node_set_iterator vsi; | |
851 | ||
852 | vsi.set = set; | |
853 | vsi.index = 0; | |
854 | return vsi; | |
855 | } | |
856 | ||
857 | /* Return true if SET contains NODE. */ | |
858 | static inline bool | |
859 | varpool_node_in_set_p (struct varpool_node *node, varpool_node_set set) | |
860 | { | |
861 | varpool_node_set_iterator vsi; | |
862 | vsi = varpool_node_set_find (set, node); | |
863 | return !vsi_end_p (vsi); | |
864 | } | |
865 | ||
866 | /* Return number of nodes in SET. */ | |
867 | static inline size_t | |
868 | varpool_node_set_size (varpool_node_set set) | |
869 | { | |
870 | return htab_elements (set->hashtab); | |
871 | } | |
872 | ||
d48e9cea OR |
873 | /* Uniquize all constants that appear in memory. |
874 | Each constant in memory thus far output is recorded | |
875 | in `const_desc_table'. */ | |
876 | ||
877 | struct GTY(()) constant_descriptor_tree { | |
878 | /* A MEM for the constant. */ | |
879 | rtx rtl; | |
b8698a0f | 880 | |
d48e9cea OR |
881 | /* The value of the constant. */ |
882 | tree value; | |
883 | ||
884 | /* Hash of value. Computing the hash from value each time | |
885 | hashfn is called can't work properly, as that means recursive | |
886 | use of the hash table during hash table expansion. */ | |
887 | hashval_t hash; | |
888 | }; | |
889 | ||
ace72c88 JH |
890 | /* Return true if set is nonempty. */ |
891 | static inline bool | |
892 | cgraph_node_set_nonempty_p (cgraph_node_set set) | |
893 | { | |
9eec9488 | 894 | return !VEC_empty (cgraph_node_ptr, set->nodes); |
ace72c88 JH |
895 | } |
896 | ||
897 | /* Return true if set is nonempty. */ | |
898 | static inline bool | |
899 | varpool_node_set_nonempty_p (varpool_node_set set) | |
900 | { | |
9eec9488 | 901 | return !VEC_empty (varpool_node_ptr, set->nodes); |
ace72c88 JH |
902 | } |
903 | ||
b20996ff JH |
904 | /* Return true when function NODE is only called directly. |
905 | i.e. it is not externally visible, address was not taken and | |
906 | it is not used in any other non-standard way. */ | |
907 | ||
908 | static inline bool | |
909 | cgraph_only_called_directly_p (struct cgraph_node *node) | |
910 | { | |
508e4757 JH |
911 | return (!node->needed && !node->address_taken |
912 | && !node->reachable_from_other_partition | |
913 | && !DECL_STATIC_CONSTRUCTOR (node->decl) | |
914 | && !DECL_STATIC_DESTRUCTOR (node->decl) | |
915 | && !node->local.externally_visible); | |
b20996ff JH |
916 | } |
917 | ||
bd3cdcc0 JH |
918 | /* Return true when function NODE can be removed from callgraph |
919 | if all direct calls are eliminated. */ | |
920 | ||
921 | static inline bool | |
922 | cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node *node) | |
923 | { | |
924 | return !node->address_taken && cgraph_can_remove_if_no_direct_calls_and_refs_p (node); | |
925 | } | |
926 | ||
4a444e58 JH |
927 | /* Return true when all references to VNODE must be visible in ipa_ref_list. |
928 | i.e. if the variable is not externally visible or not used in some magic | |
929 | way (asm statement or such). | |
930 | The magic uses are all sumarized in force_output flag. */ | |
931 | ||
932 | static inline bool | |
933 | varpool_all_refs_explicit_p (struct varpool_node *vnode) | |
934 | { | |
935 | return (!vnode->externally_visible | |
936 | && !vnode->used_from_other_partition | |
937 | && !vnode->force_output); | |
938 | } | |
939 | ||
d48e9cea OR |
940 | /* Constant pool accessor function. */ |
941 | htab_t constant_pool_htab (void); | |
fed5ae11 | 942 | |
7a8cba34 | 943 | /* FIXME: inappropriate dependency of cgraph on IPA. */ |
369451ec JH |
944 | #include "ipa-ref-inline.h" |
945 | ||
1c4a429a | 946 | #endif /* GCC_CGRAPH_H */ |