]>
Commit | Line | Data |
---|---|---|
1c4a429a | 1 | /* Callgraph handling code. |
d1e082c2 | 2 | Copyright (C) 2003-2013 Free Software Foundation, Inc. |
1c4a429a JH |
3 | Contributed by Jan Hubicka |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 9 | Software Foundation; either version 3, or (at your option) any later |
1c4a429a JH |
10 | version. |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
1c4a429a JH |
20 | |
21 | #ifndef GCC_CGRAPH_H | |
22 | #define GCC_CGRAPH_H | |
7a8cba34 | 23 | |
5d59b5e1 | 24 | #include "is-a.h" |
051f8cc6 | 25 | #include "plugin-api.h" |
7a8cba34 | 26 | #include "vec.h" |
6674a6ce | 27 | #include "tree.h" |
e42922b1 | 28 | #include "basic-block.h" |
7a8cba34 | 29 | #include "function.h" |
1f00098b JH |
30 | #include "ipa-ref.h" |
31 | ||
32 | /* Symbol table consists of functions and variables. | |
e70670cf | 33 | TODO: add labels and CONST_DECLs. */ |
1f00098b JH |
34 | enum symtab_type |
35 | { | |
960bfb69 | 36 | SYMTAB_SYMBOL, |
1f00098b JH |
37 | SYMTAB_FUNCTION, |
38 | SYMTAB_VARIABLE | |
39 | }; | |
40 | ||
41 | /* Base of all entries in the symbol table. | |
42 | The symtab_node is inherited by cgraph and varpol nodes. */ | |
960bfb69 | 43 | struct GTY(()) symtab_node_base |
1f00098b JH |
44 | { |
45 | /* Type of the symbol. */ | |
b8dbdb12 RG |
46 | ENUM_BITFIELD (symtab_type) type : 8; |
47 | ||
48 | /* The symbols resolution. */ | |
49 | ENUM_BITFIELD (ld_plugin_symbol_resolution) resolution : 8; | |
50 | ||
e70670cf JH |
51 | /*** Flags representing the symbol type. ***/ |
52 | ||
53 | /* True when symbol corresponds to a definition in current unit. | |
54 | set via cgraph_finalize_function or varpool_finalize_decl */ | |
55 | unsigned definition : 1; | |
56 | /* True when symbol is an alias. | |
57 | Set by assemble_alias. */ | |
58 | unsigned alias : 1; | |
08346abd JH |
59 | /* True when alias is a weakref. */ |
60 | unsigned weakref : 1; | |
40a7fe1e | 61 | /* C++ frontend produce same body aliases and extra name aliases for |
688010ba | 62 | virtual functions and vtables that are obviously equivalent. |
40a7fe1e JH |
63 | Those aliases are bit special, especially because C++ frontend |
64 | visibility code is so ugly it can not get them right at first time | |
65 | and their visibility needs to be copied from their "masters" at | |
66 | the end of parsing. */ | |
67 | unsigned cpp_implicit_alias : 1; | |
e70670cf JH |
68 | /* Set once the definition was analyzed. The list of references and |
69 | other properties are built during analysis. */ | |
70 | unsigned analyzed : 1; | |
71 | ||
72 | ||
73 | /*** Visibility and linkage flags. ***/ | |
74 | ||
b8dbdb12 RG |
75 | /* Set when function is visible by other units. */ |
76 | unsigned externally_visible : 1; | |
edb983b2 JH |
77 | /* The symbol will be assumed to be used in an invisiable way (like |
78 | by an toplevel asm statement). */ | |
b8dbdb12 | 79 | unsigned force_output : 1; |
edb983b2 JH |
80 | /* Like FORCE_OUTPUT, but in the case it is ABI requiring the symbol to be |
81 | exported. Unlike FORCE_OUTPUT this flag gets cleared to symbols promoted | |
82 | to static and it does not inhibit optimization. */ | |
83 | unsigned forced_by_abi : 1; | |
702d8703 JH |
84 | /* True when the name is known to be unique and thus it does not need mangling. */ |
85 | unsigned unique_name : 1; | |
b8dbdb12 | 86 | |
b8dbdb12 | 87 | |
e70670cf JH |
88 | /*** WHOPR Partitioning flags. |
89 | These flags are used at ltrans stage when only part of the callgraph is | |
90 | available. ***/ | |
b8dbdb12 | 91 | |
e70670cf JH |
92 | /* Set when variable is used from other LTRANS partition. */ |
93 | unsigned used_from_other_partition : 1; | |
94 | /* Set when function is available in the other LTRANS partition. | |
95 | During WPA output it is used to mark nodes that are present in | |
96 | multiple partitions. */ | |
97 | unsigned in_other_partition : 1; | |
b8dbdb12 | 98 | |
b8dbdb12 | 99 | |
e70670cf JH |
100 | |
101 | /*** other flags. ***/ | |
102 | ||
103 | /* Set when symbol has address taken. */ | |
104 | unsigned address_taken : 1; | |
105 | ||
106 | ||
107 | /* Ordering of all symtab entries. */ | |
108 | int order; | |
109 | ||
110 | /* Declaration representing the symbol. */ | |
111 | tree decl; | |
960bfb69 | 112 | |
2aae7680 JH |
113 | /* Linked list of symbol table entries starting with symtab_nodes. */ |
114 | symtab_node next; | |
115 | symtab_node previous; | |
e70670cf | 116 | |
1ab24192 | 117 | /* Linked list of symbols with the same asm name. There may be multiple |
e70670cf JH |
118 | entries for single symbol name during LTO, because symbols are renamed |
119 | only after partitioning. | |
120 | ||
121 | Because inline clones are kept in the assembler name has, they also produce | |
122 | duplicate entries. | |
123 | ||
124 | There are also several long standing bugs where frontends and builtin | |
125 | code produce duplicated decls. */ | |
1ab24192 JH |
126 | symtab_node next_sharing_asm_name; |
127 | symtab_node previous_sharing_asm_name; | |
2aae7680 | 128 | |
e70670cf JH |
129 | /* Circular list of nodes in the same comdat group if non-NULL. */ |
130 | symtab_node same_comdat_group; | |
131 | ||
132 | /* Vectors of referring and referenced entities. */ | |
133 | struct ipa_ref_list ref_list; | |
134 | ||
40a7fe1e JH |
135 | /* Alias target. May be either DECL pointer or ASSEMBLER_NAME pointer |
136 | depending to what was known to frontend on the creation time. | |
137 | Once alias is resolved, this pointer become NULL. */ | |
138 | tree alias_target; | |
139 | ||
e70670cf JH |
140 | /* File stream where this node is being written to. */ |
141 | struct lto_file_decl_data * lto_file_data; | |
142 | ||
960bfb69 | 143 | PTR GTY ((skip)) aux; |
1f00098b | 144 | }; |
1c4a429a | 145 | |
6b02a499 JH |
146 | enum availability |
147 | { | |
148 | /* Not yet set by cgraph_function_body_availability. */ | |
149 | AVAIL_UNSET, | |
150 | /* Function body/variable initializer is unknown. */ | |
151 | AVAIL_NOT_AVAILABLE, | |
152 | /* Function body/variable initializer is known but might be replaced | |
153 | by a different one from other compilation unit and thus needs to | |
154 | be dealt with a care. Like AVAIL_NOT_AVAILABLE it can have | |
155 | arbitrary side effects on escaping variables and functions, while | |
156 | like AVAILABLE it might access static variables. */ | |
157 | AVAIL_OVERWRITABLE, | |
158 | /* Function body/variable initializer is known and will be used in final | |
159 | program. */ | |
160 | AVAIL_AVAILABLE, | |
161 | /* Function body/variable initializer is known and all it's uses are explicitly | |
162 | visible within current unit (ie it's address is never taken and it is not | |
163 | exported to other units). | |
164 | Currently used only for functions. */ | |
165 | AVAIL_LOCAL | |
166 | }; | |
167 | ||
d7f09764 DN |
168 | /* This is the information that is put into the cgraph local structure |
169 | to recover a function. */ | |
170 | struct lto_file_decl_data; | |
171 | ||
8a4a83ed | 172 | extern const char * const cgraph_availability_names[]; |
430c6ceb | 173 | extern const char * const ld_plugin_symbol_resolution_names[]; |
8a4a83ed | 174 | |
6744a6ab JH |
175 | /* Information about thunk, used only for same body aliases. */ |
176 | ||
177 | struct GTY(()) cgraph_thunk_info { | |
178 | /* Information about the thunk. */ | |
179 | HOST_WIDE_INT fixed_offset; | |
180 | HOST_WIDE_INT virtual_value; | |
181 | tree alias; | |
182 | bool this_adjusting; | |
183 | bool virtual_offset_p; | |
184 | /* Set to true when alias node is thunk. */ | |
185 | bool thunk_p; | |
186 | }; | |
187 | ||
dafc5b82 | 188 | /* Information about the function collected locally. |
25c84396 | 189 | Available after function is analyzed. */ |
dafc5b82 | 190 | |
d1b38208 | 191 | struct GTY(()) cgraph_local_info { |
e0bb17a8 | 192 | /* Set when function function is visible in current compilation unit only |
e2209b03 | 193 | and its address is never taken. */ |
b4e19405 | 194 | unsigned local : 1; |
6674a6ce | 195 | |
124f1be6 MJ |
196 | /* False when there is something makes versioning impossible. */ |
197 | unsigned versionable : 1; | |
198 | ||
61e03ffc JH |
199 | /* False when function calling convention and signature can not be changed. |
200 | This is the case when __builtin_apply_args is used. */ | |
201 | unsigned can_change_signature : 1; | |
202 | ||
95c755e9 JH |
203 | /* True when the function has been originally extern inline, but it is |
204 | redefined now. */ | |
b4e19405 | 205 | unsigned redefined_extern_inline : 1; |
0a35513e AH |
206 | |
207 | /* True if the function may enter serial irrevocable mode. */ | |
208 | unsigned tm_may_enter_irr : 1; | |
dafc5b82 JH |
209 | }; |
210 | ||
211 | /* Information about the function that needs to be computed globally | |
726a989a | 212 | once compilation is finished. Available only with -funit-at-a-time. */ |
dafc5b82 | 213 | |
d1b38208 | 214 | struct GTY(()) cgraph_global_info { |
726a989a RB |
215 | /* For inline clones this points to the function they will be |
216 | inlined into. */ | |
18c6ada9 | 217 | struct cgraph_node *inlined_to; |
dafc5b82 JH |
218 | }; |
219 | ||
b255a036 JH |
220 | /* Information about the function that is propagated by the RTL backend. |
221 | Available only for functions that has been already assembled. */ | |
222 | ||
d1b38208 | 223 | struct GTY(()) cgraph_rtl_info { |
17b29c0a | 224 | unsigned int preferred_incoming_stack_boundary; |
b255a036 JH |
225 | }; |
226 | ||
9187e02d JH |
227 | /* Represent which DECL tree (or reference to such tree) |
228 | will be replaced by another tree while versioning. */ | |
229 | struct GTY(()) ipa_replace_map | |
230 | { | |
231 | /* The tree that will be replaced. */ | |
232 | tree old_tree; | |
233 | /* The new (replacing) tree. */ | |
234 | tree new_tree; | |
922f15c2 JH |
235 | /* Parameter number to replace, when old_tree is NULL. */ |
236 | int parm_num; | |
9187e02d JH |
237 | /* True when a substitution should be done, false otherwise. */ |
238 | bool replace_p; | |
239 | /* True when we replace a reference to old_tree. */ | |
240 | bool ref_p; | |
241 | }; | |
242 | typedef struct ipa_replace_map *ipa_replace_map_p; | |
9187e02d JH |
243 | |
244 | struct GTY(()) cgraph_clone_info | |
245 | { | |
9771b263 | 246 | vec<ipa_replace_map_p, va_gc> *tree_map; |
9187e02d | 247 | bitmap args_to_skip; |
08ad1d6d | 248 | bitmap combined_args_to_skip; |
9187e02d JH |
249 | }; |
250 | ||
5fefcf92 | 251 | |
ba228239 | 252 | /* The cgraph data structure. |
e0bb17a8 | 253 | Each function decl has assigned cgraph_node listing callees and callers. */ |
1c4a429a | 254 | |
960bfb69 JH |
255 | struct GTY(()) cgraph_node { |
256 | struct symtab_node_base symbol; | |
1c4a429a JH |
257 | struct cgraph_edge *callees; |
258 | struct cgraph_edge *callers; | |
e33c6cd6 MJ |
259 | /* List of edges representing indirect calls with a yet undetermined |
260 | callee. */ | |
261 | struct cgraph_edge *indirect_calls; | |
1c4a429a | 262 | /* For nested functions points to function the node is nested in. */ |
960bfb69 JH |
263 | struct cgraph_node * |
264 | GTY ((nested_ptr (union symtab_node_def, "(struct cgraph_node *)(%h)", "(symtab_node)%h"))) | |
265 | origin; | |
1c4a429a | 266 | /* Points to first nested function, if any. */ |
960bfb69 JH |
267 | struct cgraph_node * |
268 | GTY ((nested_ptr (union symtab_node_def, "(struct cgraph_node *)(%h)", "(symtab_node)%h"))) | |
269 | nested; | |
1c4a429a | 270 | /* Pointer to the next function with same origin, if any. */ |
960bfb69 JH |
271 | struct cgraph_node * |
272 | GTY ((nested_ptr (union symtab_node_def, "(struct cgraph_node *)(%h)", "(symtab_node)%h"))) | |
273 | next_nested; | |
18c6ada9 | 274 | /* Pointer to the next clone. */ |
9187e02d JH |
275 | struct cgraph_node *next_sibling_clone; |
276 | struct cgraph_node *prev_sibling_clone; | |
277 | struct cgraph_node *clones; | |
278 | struct cgraph_node *clone_of; | |
70d539ce JH |
279 | /* For functions with many calls sites it holds map from call expression |
280 | to the edge to speed up cgraph_edge function. */ | |
281 | htab_t GTY((param_is (struct cgraph_edge))) call_site_hash; | |
97ba0040 JH |
282 | /* Declaration node used to be clone of. */ |
283 | tree former_clone_of; | |
c22cacf3 | 284 | |
0e3776db JH |
285 | /* Interprocedural passes scheduled to have their transform functions |
286 | applied next time we execute local pass on them. We maintain it | |
287 | per-function in order to allow IPA passes to introduce new functions. */ | |
9771b263 | 288 | vec<ipa_opt_pass> GTY((skip)) ipa_transforms_to_apply; |
0e3776db | 289 | |
95c755e9 JH |
290 | struct cgraph_local_info local; |
291 | struct cgraph_global_info global; | |
292 | struct cgraph_rtl_info rtl; | |
9187e02d | 293 | struct cgraph_clone_info clone; |
6744a6ab | 294 | struct cgraph_thunk_info thunk; |
c22cacf3 | 295 | |
e42922b1 JH |
296 | /* Expected number of executions: calculated in profile.c. */ |
297 | gcov_type count; | |
db0bf14f JH |
298 | /* How to scale counts at materialization time; used to merge |
299 | LTO units with different number of profile runs. */ | |
300 | int count_materialization_scale; | |
95c755e9 JH |
301 | /* Unique id of the node. */ |
302 | int uid; | |
3691626c | 303 | |
6b20f353 DS |
304 | /* Set when decl is an abstract function pointed to by the |
305 | ABSTRACT_DECL_ORIGIN of a reachable function. */ | |
306 | unsigned abstract_and_needed : 1; | |
50674e96 | 307 | /* Set once the function is lowered (i.e. its CFG is built). */ |
b4e19405 | 308 | unsigned lowered : 1; |
25c84396 RH |
309 | /* Set once the function has been instantiated and its callee |
310 | lists created. */ | |
257eb6e3 | 311 | unsigned process : 1; |
5fefcf92 JH |
312 | /* How commonly executed the node is. Initialized during branch |
313 | probabilities pass. */ | |
314 | ENUM_BITFIELD (node_frequency) frequency : 2; | |
844db5d0 JH |
315 | /* True when function can only be called at startup (from static ctor). */ |
316 | unsigned only_called_at_startup : 1; | |
317 | /* True when function can only be called at startup (from static dtor). */ | |
318 | unsigned only_called_at_exit : 1; | |
0a35513e AH |
319 | /* True when function is the transactional clone of a function which |
320 | is called only from inside transactions. */ | |
321 | /* ?? We should be able to remove this. We have enough bits in | |
322 | cgraph to calculate it. */ | |
323 | unsigned tm_clone : 1; | |
3649b9b7 ST |
324 | /* True if this decl is a dispatcher for function versions. */ |
325 | unsigned dispatcher_function : 1; | |
1c4a429a JH |
326 | }; |
327 | ||
7380e6ef | 328 | |
fed5ae11 DK |
329 | typedef struct cgraph_node *cgraph_node_ptr; |
330 | ||
fed5ae11 | 331 | |
3649b9b7 ST |
332 | /* Function Multiversioning info. */ |
333 | struct GTY(()) cgraph_function_version_info { | |
334 | /* The cgraph_node for which the function version info is stored. */ | |
335 | struct cgraph_node *this_node; | |
336 | /* Chains all the semantically identical function versions. The | |
337 | first function in this chain is the version_info node of the | |
338 | default function. */ | |
339 | struct cgraph_function_version_info *prev; | |
340 | /* If this version node corresponds to a dispatcher for function | |
341 | versions, this points to the version info node of the default | |
342 | function, the first node in the chain. */ | |
343 | struct cgraph_function_version_info *next; | |
344 | /* If this node corresponds to a function version, this points | |
345 | to the dispatcher function decl, which is the function that must | |
346 | be called to execute the right function version at run-time. | |
347 | ||
348 | If this cgraph node is a dispatcher (if dispatcher_function is | |
349 | true, in the cgraph_node struct) for function versions, this | |
350 | points to resolver function, which holds the function body of the | |
351 | dispatcher. The dispatcher decl is an alias to the resolver | |
352 | function decl. */ | |
353 | tree dispatcher_resolver; | |
354 | }; | |
355 | ||
356 | /* Get the cgraph_function_version_info node corresponding to node. */ | |
357 | struct cgraph_function_version_info * | |
358 | get_cgraph_node_version (struct cgraph_node *node); | |
359 | ||
360 | /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab | |
361 | corresponding to cgraph_node NODE. */ | |
362 | struct cgraph_function_version_info * | |
363 | insert_new_cgraph_node_version (struct cgraph_node *node); | |
364 | ||
365 | /* Record that DECL1 and DECL2 are semantically identical function | |
366 | versions. */ | |
367 | void record_function_versions (tree decl1, tree decl2); | |
368 | ||
369 | /* Remove the cgraph_function_version_info and cgraph_node for DECL. This | |
370 | DECL is a duplicate declaration. */ | |
371 | void delete_function_version (tree decl); | |
372 | ||
fed5ae11 DK |
373 | /* A cgraph node set is a collection of cgraph nodes. A cgraph node |
374 | can appear in multiple sets. */ | |
1cb1a99f | 375 | struct cgraph_node_set_def |
fed5ae11 | 376 | { |
1cb1a99f | 377 | struct pointer_map_t *map; |
9771b263 | 378 | vec<cgraph_node_ptr> nodes; |
fed5ae11 DK |
379 | }; |
380 | ||
2942c502 JH |
381 | typedef struct varpool_node *varpool_node_ptr; |
382 | ||
2942c502 JH |
383 | |
384 | /* A varpool node set is a collection of varpool nodes. A varpool node | |
385 | can appear in multiple sets. */ | |
1cb1a99f | 386 | struct varpool_node_set_def |
2942c502 | 387 | { |
1cb1a99f | 388 | struct pointer_map_t * map; |
9771b263 | 389 | vec<varpool_node_ptr> nodes; |
2942c502 JH |
390 | }; |
391 | ||
fed5ae11 DK |
392 | typedef struct cgraph_node_set_def *cgraph_node_set; |
393 | ||
fed5ae11 | 394 | |
2942c502 JH |
395 | typedef struct varpool_node_set_def *varpool_node_set; |
396 | ||
2942c502 | 397 | |
fed5ae11 DK |
398 | /* Iterator structure for cgraph node sets. */ |
399 | typedef struct | |
400 | { | |
401 | cgraph_node_set set; | |
402 | unsigned index; | |
403 | } cgraph_node_set_iterator; | |
404 | ||
2942c502 JH |
405 | /* Iterator structure for varpool node sets. */ |
406 | typedef struct | |
407 | { | |
408 | varpool_node_set set; | |
409 | unsigned index; | |
410 | } varpool_node_set_iterator; | |
411 | ||
61a05df1 JH |
412 | #define DEFCIFCODE(code, string) CIF_ ## code, |
413 | /* Reasons for inlining failures. */ | |
533c07c5 | 414 | typedef enum cgraph_inline_failed_enum { |
61a05df1 JH |
415 | #include "cif-code.def" |
416 | CIF_N_REASONS | |
417 | } cgraph_inline_failed_t; | |
418 | ||
e33c6cd6 MJ |
419 | /* Structure containing additional information about an indirect call. */ |
420 | ||
421 | struct GTY(()) cgraph_indirect_call_info | |
422 | { | |
8b7773a4 MJ |
423 | /* When polymorphic is set, this field contains offset where the object which |
424 | was actually used in the polymorphic resides within a larger structure. | |
425 | If agg_contents is set, the field contains the offset within the aggregate | |
426 | from which the address to call was loaded. */ | |
427 | HOST_WIDE_INT offset; | |
b258210c MJ |
428 | /* OBJ_TYPE_REF_TOKEN of a polymorphic call (if polymorphic is set). */ |
429 | HOST_WIDE_INT otr_token; | |
430 | /* Type of the object from OBJ_TYPE_REF_OBJECT. */ | |
431 | tree otr_type; | |
e33c6cd6 MJ |
432 | /* Index of the parameter that is called. */ |
433 | int param_index; | |
5f902d76 JH |
434 | /* ECF flags determined from the caller. */ |
435 | int ecf_flags; | |
b258210c MJ |
436 | |
437 | /* Set when the call is a virtual call with the parameter being the | |
438 | associated object pointer rather than a simple direct call. */ | |
439 | unsigned polymorphic : 1; | |
8b7773a4 MJ |
440 | /* Set when the call is a call of a pointer loaded from contents of an |
441 | aggregate at offset. */ | |
442 | unsigned agg_contents : 1; | |
c13bc3d9 MJ |
443 | /* Set when this is a call through a member pointer. */ |
444 | unsigned member_ptr : 1; | |
8b7773a4 MJ |
445 | /* When the previous bit is set, this one determines whether the destination |
446 | is loaded from a parameter passed by reference. */ | |
447 | unsigned by_ref : 1; | |
e33c6cd6 MJ |
448 | }; |
449 | ||
d1b38208 | 450 | struct GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"))) cgraph_edge { |
6009ee7b MJ |
451 | /* Expected number of executions: calculated in profile.c. */ |
452 | gcov_type count; | |
ed2df68b JH |
453 | struct cgraph_node *caller; |
454 | struct cgraph_node *callee; | |
2563c224 | 455 | struct cgraph_edge *prev_caller; |
1c4a429a | 456 | struct cgraph_edge *next_caller; |
2563c224 | 457 | struct cgraph_edge *prev_callee; |
1c4a429a | 458 | struct cgraph_edge *next_callee; |
726a989a | 459 | gimple call_stmt; |
e33c6cd6 MJ |
460 | /* Additional information about an indirect call. Not cleared when an edge |
461 | becomes direct. */ | |
462 | struct cgraph_indirect_call_info *indirect_info; | |
18c6ada9 | 463 | PTR GTY ((skip (""))) aux; |
61a05df1 JH |
464 | /* When equal to CIF_OK, inline this call. Otherwise, points to the |
465 | explanation why function was not inlined. */ | |
466 | cgraph_inline_failed_t inline_failed; | |
6009ee7b MJ |
467 | /* The stmt_uid of call_stmt. This is used by LTO to recover the call_stmt |
468 | when the function is serialized in. */ | |
469 | unsigned int lto_stmt_uid; | |
b8698a0f | 470 | /* Expected frequency of executions within the function. |
45a80bb9 JH |
471 | When set to CGRAPH_FREQ_BASE, the edge is expected to be called once |
472 | per function call. The range is 0 to CGRAPH_FREQ_MAX. */ | |
473 | int frequency; | |
6009ee7b MJ |
474 | /* Unique id of the edge. */ |
475 | int uid; | |
e33c6cd6 MJ |
476 | /* Whether this edge was made direct by indirect inlining. */ |
477 | unsigned int indirect_inlining_edge : 1; | |
478 | /* Whether this edge describes an indirect call with an undetermined | |
479 | callee. */ | |
480 | unsigned int indirect_unknown_callee : 1; | |
481 | /* Whether this edge is still a dangling */ | |
d7f09764 DN |
482 | /* True if the corresponding CALL stmt cannot be inlined. */ |
483 | unsigned int call_stmt_cannot_inline_p : 1; | |
2505c5ed JH |
484 | /* Can this call throw externally? */ |
485 | unsigned int can_throw_external : 1; | |
1c4a429a JH |
486 | }; |
487 | ||
45a80bb9 JH |
488 | #define CGRAPH_FREQ_BASE 1000 |
489 | #define CGRAPH_FREQ_MAX 100000 | |
490 | ||
b2c0ad40 KH |
491 | typedef struct cgraph_edge *cgraph_edge_p; |
492 | ||
b2c0ad40 | 493 | |
8a4a83ed JH |
494 | /* The varpool data structure. |
495 | Each static variable decl has assigned varpool_node. */ | |
e69529cd | 496 | |
2aae7680 | 497 | struct GTY(()) varpool_node { |
960bfb69 | 498 | struct symtab_node_base symbol; |
e69529cd | 499 | |
6b02a499 | 500 | /* Set when variable is scheduled to be assembled. */ |
b4e19405 | 501 | unsigned output : 1; |
e69529cd JH |
502 | }; |
503 | ||
65d630d4 | 504 | /* Every top level asm statement is put into a asm_node. */ |
474eccc6 | 505 | |
65d630d4 | 506 | struct GTY(()) asm_node { |
474eccc6 | 507 | /* Next asm node. */ |
65d630d4 | 508 | struct asm_node *next; |
474eccc6 ILT |
509 | /* String for this asm node. */ |
510 | tree asm_str; | |
511 | /* Ordering of all cgraph nodes. */ | |
512 | int order; | |
513 | }; | |
514 | ||
960bfb69 | 515 | /* Symbol table entry. */ |
2aae7680 JH |
516 | union GTY((desc ("%h.symbol.type"), chain_next ("%h.symbol.next"), |
517 | chain_prev ("%h.symbol.previous"))) symtab_node_def { | |
960bfb69 | 518 | struct symtab_node_base GTY ((tag ("SYMTAB_SYMBOL"))) symbol; |
5d59b5e1 LC |
519 | /* To access the following fields, |
520 | use the use dyn_cast or as_a to obtain the concrete type. */ | |
960bfb69 | 521 | struct cgraph_node GTY ((tag ("SYMTAB_FUNCTION"))) x_function; |
960bfb69 JH |
522 | struct varpool_node GTY ((tag ("SYMTAB_VARIABLE"))) x_variable; |
523 | }; | |
524 | ||
5d59b5e1 LC |
525 | /* Report whether or not THIS symtab node is a function, aka cgraph_node. */ |
526 | ||
527 | template <> | |
528 | template <> | |
529 | inline bool | |
530 | is_a_helper <cgraph_node>::test (symtab_node_def *p) | |
531 | { | |
532 | return p->symbol.type == SYMTAB_FUNCTION; | |
533 | } | |
534 | ||
535 | /* Report whether or not THIS symtab node is a vriable, aka varpool_node. */ | |
536 | ||
537 | template <> | |
538 | template <> | |
539 | inline bool | |
540 | is_a_helper <varpool_node>::test (symtab_node_def *p) | |
541 | { | |
542 | return p->symbol.type == SYMTAB_VARIABLE; | |
543 | } | |
544 | ||
2aae7680 | 545 | extern GTY(()) symtab_node symtab_nodes; |
ed2df68b | 546 | extern GTY(()) int cgraph_n_nodes; |
b58b1157 | 547 | extern GTY(()) int cgraph_max_uid; |
9088c1cc | 548 | extern GTY(()) int cgraph_edge_max_uid; |
dafc5b82 | 549 | extern bool cgraph_global_info_ready; |
f45e0ad1 JH |
550 | enum cgraph_state |
551 | { | |
66058468 JH |
552 | /* Frontend is parsing and finalizing functions. */ |
553 | CGRAPH_STATE_PARSING, | |
f45e0ad1 JH |
554 | /* Callgraph is being constructed. It is safe to add new functions. */ |
555 | CGRAPH_STATE_CONSTRUCTION, | |
ca0f62a8 JH |
556 | /* Callgraph is being at LTO time. */ |
557 | CGRAPH_LTO_STREAMING, | |
f45e0ad1 JH |
558 | /* Callgraph is built and IPA passes are being run. */ |
559 | CGRAPH_STATE_IPA, | |
7a388ee4 JH |
560 | /* Callgraph is built and all functions are transformed to SSA form. */ |
561 | CGRAPH_STATE_IPA_SSA, | |
f45e0ad1 JH |
562 | /* Functions are now ordered and being passed to RTL expanders. */ |
563 | CGRAPH_STATE_EXPANSION, | |
564 | /* All cgraph expansion is done. */ | |
565 | CGRAPH_STATE_FINISHED | |
566 | }; | |
567 | extern enum cgraph_state cgraph_state; | |
e7d6beb0 | 568 | extern bool cgraph_function_flags_ready; |
66058468 | 569 | extern cgraph_node_set cgraph_new_nodes; |
1c4a429a | 570 | |
65d630d4 | 571 | extern GTY(()) struct asm_node *asm_nodes; |
2aae7680 | 572 | extern GTY(()) int symtab_order; |
40a7fe1e | 573 | extern bool cpp_implicit_aliases_done; |
e69529cd | 574 | |
2aae7680 JH |
575 | /* In symtab.c */ |
576 | void symtab_register_node (symtab_node); | |
577 | void symtab_unregister_node (symtab_node); | |
578 | void symtab_remove_node (symtab_node); | |
1ab24192 JH |
579 | symtab_node symtab_get_node (const_tree); |
580 | symtab_node symtab_node_for_asm (const_tree asmname); | |
8f940ee6 JH |
581 | const char * symtab_node_asm_name (symtab_node); |
582 | const char * symtab_node_name (symtab_node); | |
1ab24192 | 583 | void symtab_insert_node_to_hashtable (symtab_node); |
65d630d4 JH |
584 | void symtab_add_to_same_comdat_group (symtab_node, symtab_node); |
585 | void symtab_dissolve_same_comdat_group_list (symtab_node node); | |
8f940ee6 JH |
586 | void dump_symtab (FILE *); |
587 | void debug_symtab (void); | |
588 | void dump_symtab_node (FILE *, symtab_node); | |
589 | void debug_symtab_node (symtab_node); | |
590 | void dump_symtab_base (FILE *, symtab_node); | |
474ffc72 JH |
591 | void verify_symtab (void); |
592 | void verify_symtab_node (symtab_node); | |
593 | bool verify_symtab_base (symtab_node); | |
65d630d4 JH |
594 | bool symtab_used_from_object_file_p (symtab_node); |
595 | void symtab_make_decl_local (tree); | |
40a7fe1e JH |
596 | symtab_node symtab_alias_ultimate_target (symtab_node, |
597 | enum availability *avail = NULL); | |
598 | bool symtab_resolve_alias (symtab_node node, symtab_node target); | |
599 | void fixup_same_cpp_alias_visibility (symtab_node node, symtab_node target); | |
2aae7680 | 600 | |
1c4a429a | 601 | /* In cgraph.c */ |
439f7bc3 | 602 | void dump_cgraph (FILE *); |
c4e622b6 | 603 | void debug_cgraph (void); |
18c6ada9 | 604 | void dump_cgraph_node (FILE *, struct cgraph_node *); |
c4e622b6 | 605 | void debug_cgraph_node (struct cgraph_node *); |
18c6ada9 | 606 | void cgraph_remove_edge (struct cgraph_edge *); |
439f7bc3 | 607 | void cgraph_remove_node (struct cgraph_node *); |
3a40c18a | 608 | void cgraph_release_function_body (struct cgraph_node *); |
2563c224 | 609 | void cgraph_node_remove_callees (struct cgraph_node *node); |
18c6ada9 JH |
610 | struct cgraph_edge *cgraph_create_edge (struct cgraph_node *, |
611 | struct cgraph_node *, | |
898b8927 | 612 | gimple, gcov_type, int); |
ce47fda3 | 613 | struct cgraph_edge *cgraph_create_indirect_edge (struct cgraph_node *, gimple, |
898b8927 | 614 | int, gcov_type, int); |
ce47fda3 | 615 | struct cgraph_indirect_call_info *cgraph_allocate_init_indirect_info (void); |
a358e188 | 616 | struct cgraph_node * cgraph_create_node (tree); |
66a20fc2 | 617 | struct cgraph_node * cgraph_create_empty_node (void); |
a358e188 | 618 | struct cgraph_node * cgraph_get_create_node (tree); |
48f4a6fa | 619 | struct cgraph_node * cgraph_get_create_real_symbol_node (tree); |
87e7b310 JH |
620 | struct cgraph_node * cgraph_same_body_alias (struct cgraph_node *, tree, tree); |
621 | struct cgraph_node * cgraph_add_thunk (struct cgraph_node *, tree, tree, bool, HOST_WIDE_INT, | |
051f8cc6 | 622 | HOST_WIDE_INT, tree, tree); |
4537ec0c | 623 | struct cgraph_node *cgraph_node_for_asm (tree); |
726a989a RB |
624 | struct cgraph_edge *cgraph_edge (struct cgraph_node *, gimple); |
625 | void cgraph_set_call_stmt (struct cgraph_edge *, gimple); | |
4b685e14 | 626 | void cgraph_update_edges_for_call_stmt (gimple, tree, gimple); |
439f7bc3 AJ |
627 | struct cgraph_local_info *cgraph_local_info (tree); |
628 | struct cgraph_global_info *cgraph_global_info (tree); | |
629 | struct cgraph_rtl_info *cgraph_rtl_info (tree); | |
39e2db00 | 630 | struct cgraph_node *cgraph_create_function_alias (tree, tree); |
66a20fc2 JH |
631 | void cgraph_call_node_duplication_hooks (struct cgraph_node *, |
632 | struct cgraph_node *); | |
633 | void cgraph_call_edge_duplication_hooks (struct cgraph_edge *, | |
634 | struct cgraph_edge *); | |
1c4a429a | 635 | |
18c6ada9 | 636 | void cgraph_redirect_edge_callee (struct cgraph_edge *, struct cgraph_node *); |
81fa35bd | 637 | void cgraph_make_edge_direct (struct cgraph_edge *, struct cgraph_node *); |
be330ed4 | 638 | bool cgraph_only_called_directly_p (struct cgraph_node *); |
e69529cd | 639 | |
1bb17c21 | 640 | bool cgraph_function_possibly_inlined_p (tree); |
e42922b1 | 641 | void cgraph_unnest_node (struct cgraph_node *); |
1bb17c21 | 642 | |
6b02a499 | 643 | enum availability cgraph_function_body_availability (struct cgraph_node *); |
f45e0ad1 | 644 | void cgraph_add_new_function (tree, bool); |
61a05df1 | 645 | const char* cgraph_inline_failed_string (cgraph_inline_failed_t); |
6b02a499 | 646 | |
20cdc2be | 647 | void cgraph_set_nothrow_flag (struct cgraph_node *, bool); |
530f3a1b JH |
648 | void cgraph_set_const_flag (struct cgraph_node *, bool, bool); |
649 | void cgraph_set_pure_flag (struct cgraph_node *, bool, bool); | |
d56026c2 JH |
650 | bool cgraph_node_cannot_return (struct cgraph_node *); |
651 | bool cgraph_edge_cannot_lead_to_return (struct cgraph_edge *); | |
508e4757 JH |
652 | bool cgraph_will_be_removed_from_program_if_no_direct_calls |
653 | (struct cgraph_node *node); | |
654 | bool cgraph_can_remove_if_no_direct_calls_and_refs_p | |
655 | (struct cgraph_node *node); | |
9aa3f5c5 | 656 | bool cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node *node); |
be330ed4 | 657 | bool resolution_used_from_other_file_p (enum ld_plugin_symbol_resolution); |
be330ed4 JH |
658 | bool cgraph_for_node_thunks_and_aliases (struct cgraph_node *, |
659 | bool (*) (struct cgraph_node *, void *), | |
660 | void *, | |
661 | bool); | |
662 | bool cgraph_for_node_and_aliases (struct cgraph_node *, | |
663 | bool (*) (struct cgraph_node *, void *), | |
664 | void *, bool); | |
9771b263 | 665 | vec<cgraph_edge_p> collect_callers_of_node (struct cgraph_node *node); |
18c6ada9 JH |
666 | void verify_cgraph (void); |
667 | void verify_cgraph_node (struct cgraph_node *); | |
9c8305f8 | 668 | void cgraph_mark_address_taken_node (struct cgraph_node *); |
d7f09764 | 669 | |
9088c1cc MJ |
670 | typedef void (*cgraph_edge_hook)(struct cgraph_edge *, void *); |
671 | typedef void (*cgraph_node_hook)(struct cgraph_node *, void *); | |
672 | typedef void (*cgraph_2edge_hook)(struct cgraph_edge *, struct cgraph_edge *, | |
673 | void *); | |
674 | typedef void (*cgraph_2node_hook)(struct cgraph_node *, struct cgraph_node *, | |
675 | void *); | |
676 | struct cgraph_edge_hook_list; | |
677 | struct cgraph_node_hook_list; | |
678 | struct cgraph_2edge_hook_list; | |
679 | struct cgraph_2node_hook_list; | |
680 | struct cgraph_edge_hook_list *cgraph_add_edge_removal_hook (cgraph_edge_hook, void *); | |
681 | void cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *); | |
682 | struct cgraph_node_hook_list *cgraph_add_node_removal_hook (cgraph_node_hook, | |
683 | void *); | |
684 | void cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *); | |
129a37fc JH |
685 | struct cgraph_node_hook_list *cgraph_add_function_insertion_hook (cgraph_node_hook, |
686 | void *); | |
687 | void cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *); | |
688 | void cgraph_call_function_insertion_hooks (struct cgraph_node *node); | |
9088c1cc MJ |
689 | struct cgraph_2edge_hook_list *cgraph_add_edge_duplication_hook (cgraph_2edge_hook, void *); |
690 | void cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *); | |
691 | struct cgraph_2node_hook_list *cgraph_add_node_duplication_hook (cgraph_2node_hook, void *); | |
692 | void cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *); | |
8132a837 | 693 | gimple cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge *); |
fa5f5e27 | 694 | bool cgraph_propagate_frequency (struct cgraph_node *node); |
40a7fe1e JH |
695 | struct cgraph_node * cgraph_function_node (struct cgraph_node *, |
696 | enum availability *avail = NULL); | |
9c8305f8 JH |
697 | |
698 | /* In cgraphunit.c */ | |
65d630d4 | 699 | struct asm_node *add_asm_node (tree); |
9c8305f8 JH |
700 | extern FILE *cgraph_dump_file; |
701 | void cgraph_finalize_function (tree, bool); | |
65d630d4 JH |
702 | void finalize_compilation_unit (void); |
703 | void compile (void); | |
9c8305f8 | 704 | void init_cgraph (void); |
66a20fc2 JH |
705 | bool cgraph_process_new_functions (void); |
706 | void cgraph_process_same_body_aliases (void); | |
e70670cf | 707 | void fixup_same_cpp_alias_visibility (symtab_node, symtab_node target, tree); |
3649b9b7 ST |
708 | /* Initialize datastructures so DECL is a function in lowered gimple form. |
709 | IN_SSA is true if the gimple is in SSA. */ | |
e70670cf JH |
710 | basic_block init_lowered_empty_function (tree, bool); |
711 | void cgraph_reset_node (struct cgraph_node *); | |
66a20fc2 JH |
712 | |
713 | /* In cgraphclones.c */ | |
714 | ||
715 | struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *, | |
716 | struct cgraph_node *, gimple, | |
717 | unsigned, gcov_type, int, bool); | |
718 | struct cgraph_node * cgraph_clone_node (struct cgraph_node *, tree, gcov_type, | |
9771b263 | 719 | int, bool, vec<cgraph_edge_p>, |
44a60244 | 720 | bool, struct cgraph_node *); |
66a20fc2 JH |
721 | tree clone_function_name (tree decl, const char *); |
722 | struct cgraph_node * cgraph_create_virtual_clone (struct cgraph_node *old_node, | |
9771b263 DN |
723 | vec<cgraph_edge_p>, |
724 | vec<ipa_replace_map_p, va_gc> *tree_map, | |
66a20fc2 JH |
725 | bitmap args_to_skip, |
726 | const char *clone_name); | |
727 | struct cgraph_node *cgraph_find_replacement_node (struct cgraph_node *); | |
728 | bool cgraph_remove_node_and_inline_clones (struct cgraph_node *, struct cgraph_node *); | |
729 | void cgraph_set_call_stmt_including_clones (struct cgraph_node *, gimple, gimple); | |
730 | void cgraph_create_edge_including_clones (struct cgraph_node *, | |
731 | struct cgraph_node *, | |
732 | gimple, gimple, gcov_type, int, | |
733 | cgraph_inline_failed_t); | |
734 | void cgraph_materialize_all_clones (void); | |
9c8305f8 | 735 | struct cgraph_node * cgraph_copy_node_for_versioning (struct cgraph_node *, |
9771b263 | 736 | tree, vec<cgraph_edge_p>, bitmap); |
9c8305f8 | 737 | struct cgraph_node *cgraph_function_versioning (struct cgraph_node *, |
9771b263 DN |
738 | vec<cgraph_edge_p>, |
739 | vec<ipa_replace_map_p, va_gc> *, | |
9c8305f8 JH |
740 | bitmap, bool, bitmap, |
741 | basic_block, const char *); | |
9771b263 | 742 | void tree_function_versioning (tree, tree, vec<ipa_replace_map_p, va_gc> *, |
9c8305f8 | 743 | bool, bitmap, bool, bitmap, basic_block); |
9c8305f8 | 744 | |
917948d3 ZD |
745 | /* In cgraphbuild.c */ |
746 | unsigned int rebuild_cgraph_edges (void); | |
99b766fc | 747 | void cgraph_rebuild_references (void); |
9187e02d | 748 | int compute_call_stmt_bb_frequency (tree, basic_block bb); |
9c8305f8 | 749 | void record_references_in_initializer (tree, bool); |
82338059 | 750 | void ipa_record_stmt_references (struct cgraph_node *, gimple); |
917948d3 | 751 | |
ca31b95f | 752 | /* In ipa.c */ |
04142cc3 | 753 | bool symtab_remove_unreachable_nodes (bool, FILE *); |
fed5ae11 DK |
754 | cgraph_node_set cgraph_node_set_new (void); |
755 | cgraph_node_set_iterator cgraph_node_set_find (cgraph_node_set, | |
756 | struct cgraph_node *); | |
757 | void cgraph_node_set_add (cgraph_node_set, struct cgraph_node *); | |
758 | void cgraph_node_set_remove (cgraph_node_set, struct cgraph_node *); | |
759 | void dump_cgraph_node_set (FILE *, cgraph_node_set); | |
760 | void debug_cgraph_node_set (cgraph_node_set); | |
1cb1a99f | 761 | void free_cgraph_node_set (cgraph_node_set); |
9c8305f8 | 762 | void cgraph_build_static_cdtor (char which, tree body, int priority); |
fed5ae11 | 763 | |
2942c502 JH |
764 | varpool_node_set varpool_node_set_new (void); |
765 | varpool_node_set_iterator varpool_node_set_find (varpool_node_set, | |
766 | struct varpool_node *); | |
767 | void varpool_node_set_add (varpool_node_set, struct varpool_node *); | |
768 | void varpool_node_set_remove (varpool_node_set, struct varpool_node *); | |
769 | void dump_varpool_node_set (FILE *, varpool_node_set); | |
770 | void debug_varpool_node_set (varpool_node_set); | |
1cb1a99f | 771 | void free_varpool_node_set (varpool_node_set); |
4a444e58 | 772 | void ipa_discover_readonly_nonaddressable_vars (void); |
5ac42672 | 773 | bool varpool_externally_visible_p (struct varpool_node *); |
ca31b95f | 774 | |
fed5ae11 | 775 | /* In predict.c */ |
ca30a539 | 776 | bool cgraph_maybe_hot_edge_p (struct cgraph_edge *e); |
e6416b30 | 777 | bool cgraph_optimize_for_size_p (struct cgraph_node *); |
ca30a539 | 778 | |
8a4a83ed | 779 | /* In varpool.c */ |
bbf9ad07 | 780 | struct varpool_node *varpool_create_empty_node (void); |
5d59b5e1 | 781 | struct varpool_node *varpool_node_for_decl (tree); |
8a4a83ed JH |
782 | struct varpool_node *varpool_node_for_asm (tree asmname); |
783 | void varpool_mark_needed_node (struct varpool_node *); | |
d85478c2 | 784 | void debug_varpool (void); |
8a4a83ed JH |
785 | void dump_varpool (FILE *); |
786 | void dump_varpool_node (FILE *, struct varpool_node *); | |
787 | ||
788 | void varpool_finalize_decl (tree); | |
8a4a83ed | 789 | enum availability cgraph_variable_initializer_availability (struct varpool_node *); |
a550d677 MJ |
790 | void cgraph_make_node_local (struct cgraph_node *); |
791 | bool cgraph_node_can_be_local_p (struct cgraph_node *); | |
8a4a83ed | 792 | |
2942c502 | 793 | |
2942c502 | 794 | void varpool_remove_node (struct varpool_node *node); |
7fece979 | 795 | void varpool_finalize_named_section_flags (struct varpool_node *node); |
65d630d4 | 796 | bool varpool_output_variables (void); |
8a4a83ed | 797 | bool varpool_assemble_decl (struct varpool_node *node); |
66058468 | 798 | void varpool_analyze_node (struct varpool_node *); |
051f8cc6 | 799 | struct varpool_node * varpool_extra_name_alias (tree, tree); |
cd35bcf7 | 800 | struct varpool_node * varpool_create_variable_alias (tree, tree); |
b34fd25c | 801 | void varpool_reset_queue (void); |
6a6dac52 | 802 | tree ctor_for_folding (tree); |
cd35bcf7 JH |
803 | bool varpool_for_node_and_aliases (struct varpool_node *, |
804 | bool (*) (struct varpool_node *, void *), | |
805 | void *, bool); | |
38877e98 | 806 | void varpool_add_new_variable (tree); |
b5493fb2 JH |
807 | void symtab_initialize_asm_name_hash (void); |
808 | void symtab_prevail_in_asm_name_hash (symtab_node node); | |
e70670cf | 809 | void varpool_remove_initializer (struct varpool_node *); |
8a4a83ed | 810 | |
68e56cc4 | 811 | |
1f00098b JH |
812 | /* Return callgraph node for given symbol and check it is a function. */ |
813 | static inline struct cgraph_node * | |
960bfb69 | 814 | cgraph (symtab_node node) |
1f00098b | 815 | { |
960bfb69 | 816 | gcc_checking_assert (!node || node->symbol.type == SYMTAB_FUNCTION); |
1ab24192 | 817 | return (struct cgraph_node *)node; |
1f00098b JH |
818 | } |
819 | ||
820 | /* Return varpool node for given symbol and check it is a variable. */ | |
821 | static inline struct varpool_node * | |
960bfb69 | 822 | varpool (symtab_node node) |
1f00098b | 823 | { |
960bfb69 | 824 | gcc_checking_assert (!node || node->symbol.type == SYMTAB_VARIABLE); |
1ab24192 | 825 | return (struct varpool_node *)node; |
1f00098b JH |
826 | } |
827 | ||
1ab24192 JH |
828 | /* Return callgraph node for given symbol and check it is a function. */ |
829 | static inline struct cgraph_node * | |
830 | cgraph_get_node (const_tree decl) | |
831 | { | |
832 | gcc_checking_assert (TREE_CODE (decl) == FUNCTION_DECL); | |
833 | return cgraph (symtab_get_node (decl)); | |
834 | } | |
835 | ||
836 | /* Return varpool node for given symbol and check it is a function. */ | |
837 | static inline struct varpool_node * | |
838 | varpool_get_node (const_tree decl) | |
839 | { | |
840 | gcc_checking_assert (TREE_CODE (decl) == VAR_DECL); | |
841 | return varpool (symtab_get_node (decl)); | |
842 | } | |
843 | ||
8f940ee6 JH |
844 | /* Return asm name of cgraph node. */ |
845 | static inline const char * | |
40a7fe1e | 846 | cgraph_node_asm_name (struct cgraph_node *node) |
8f940ee6 JH |
847 | { |
848 | return symtab_node_asm_name ((symtab_node)node); | |
849 | } | |
850 | ||
851 | /* Return asm name of varpool node. */ | |
852 | static inline const char * | |
853 | varpool_node_asm_name(struct varpool_node *node) | |
854 | { | |
855 | return symtab_node_asm_name ((symtab_node)node); | |
856 | } | |
857 | ||
858 | /* Return name of cgraph node. */ | |
859 | static inline const char * | |
860 | cgraph_node_name(struct cgraph_node *node) | |
861 | { | |
862 | return symtab_node_name ((symtab_node)node); | |
863 | } | |
864 | ||
865 | /* Return name of varpool node. */ | |
866 | static inline const char * | |
867 | varpool_node_name(struct varpool_node *node) | |
868 | { | |
869 | return symtab_node_name ((symtab_node)node); | |
870 | } | |
871 | ||
1ab24192 JH |
872 | /* Walk all symbols. */ |
873 | #define FOR_EACH_SYMBOL(node) \ | |
874 | for ((node) = symtab_nodes; (node); (node) = (node)->symbol.next) | |
1f00098b | 875 | |
66058468 JH |
876 | |
877 | /* Return first variable. */ | |
878 | static inline struct varpool_node * | |
879 | varpool_first_variable (void) | |
880 | { | |
881 | symtab_node node; | |
882 | for (node = symtab_nodes; node; node = node->symbol.next) | |
5d59b5e1 LC |
883 | if (varpool_node *vnode = dyn_cast <varpool_node> (node)) |
884 | return vnode; | |
66058468 JH |
885 | return NULL; |
886 | } | |
887 | ||
888 | /* Return next variable after NODE. */ | |
889 | static inline struct varpool_node * | |
890 | varpool_next_variable (struct varpool_node *node) | |
891 | { | |
892 | symtab_node node1 = (symtab_node) node->symbol.next; | |
893 | for (; node1; node1 = node1->symbol.next) | |
5d59b5e1 LC |
894 | if (varpool_node *vnode1 = dyn_cast <varpool_node> (node1)) |
895 | return vnode1; | |
66058468 JH |
896 | return NULL; |
897 | } | |
898 | /* Walk all variables. */ | |
899 | #define FOR_EACH_VARIABLE(node) \ | |
900 | for ((node) = varpool_first_variable (); \ | |
901 | (node); \ | |
902 | (node) = varpool_next_variable ((node))) | |
903 | ||
68e56cc4 JH |
904 | /* Return first reachable static variable with initializer. */ |
905 | static inline struct varpool_node * | |
906 | varpool_first_static_initializer (void) | |
907 | { | |
66058468 JH |
908 | symtab_node node; |
909 | for (node = symtab_nodes; node; node = node->symbol.next) | |
68e56cc4 | 910 | { |
5d59b5e1 LC |
911 | varpool_node *vnode = dyn_cast <varpool_node> (node); |
912 | if (vnode && DECL_INITIAL (node->symbol.decl)) | |
913 | return vnode; | |
68e56cc4 JH |
914 | } |
915 | return NULL; | |
916 | } | |
917 | ||
918 | /* Return next reachable static variable with initializer after NODE. */ | |
919 | static inline struct varpool_node * | |
920 | varpool_next_static_initializer (struct varpool_node *node) | |
921 | { | |
66058468 JH |
922 | symtab_node node1 = (symtab_node) node->symbol.next; |
923 | for (; node1; node1 = node1->symbol.next) | |
68e56cc4 | 924 | { |
5d59b5e1 LC |
925 | varpool_node *vnode1 = dyn_cast <varpool_node> (node1); |
926 | if (vnode1 && DECL_INITIAL (node1->symbol.decl)) | |
927 | return vnode1; | |
68e56cc4 JH |
928 | } |
929 | return NULL; | |
930 | } | |
931 | ||
932 | /* Walk all static variables with initializer set. */ | |
933 | #define FOR_EACH_STATIC_INITIALIZER(node) \ | |
934 | for ((node) = varpool_first_static_initializer (); (node); \ | |
935 | (node) = varpool_next_static_initializer (node)) | |
2aae7680 | 936 | |
66058468 | 937 | /* Return first reachable static variable with initializer. */ |
2aae7680 | 938 | static inline struct varpool_node * |
66058468 | 939 | varpool_first_defined_variable (void) |
2aae7680 JH |
940 | { |
941 | symtab_node node; | |
942 | for (node = symtab_nodes; node; node = node->symbol.next) | |
943 | { | |
5d59b5e1 | 944 | varpool_node *vnode = dyn_cast <varpool_node> (node); |
e70670cf | 945 | if (vnode && vnode->symbol.definition) |
5d59b5e1 | 946 | return vnode; |
2aae7680 JH |
947 | } |
948 | return NULL; | |
949 | } | |
950 | ||
66058468 | 951 | /* Return next reachable static variable with initializer after NODE. */ |
2aae7680 | 952 | static inline struct varpool_node * |
66058468 | 953 | varpool_next_defined_variable (struct varpool_node *node) |
2aae7680 JH |
954 | { |
955 | symtab_node node1 = (symtab_node) node->symbol.next; | |
956 | for (; node1; node1 = node1->symbol.next) | |
957 | { | |
5d59b5e1 | 958 | varpool_node *vnode1 = dyn_cast <varpool_node> (node1); |
e70670cf | 959 | if (vnode1 && vnode1->symbol.definition) |
5d59b5e1 | 960 | return vnode1; |
2aae7680 JH |
961 | } |
962 | return NULL; | |
963 | } | |
65c70e6b JH |
964 | /* Walk all variables with definitions in current unit. */ |
965 | #define FOR_EACH_DEFINED_VARIABLE(node) \ | |
66058468 JH |
966 | for ((node) = varpool_first_defined_variable (); (node); \ |
967 | (node) = varpool_next_defined_variable (node)) | |
68e56cc4 | 968 | |
c47d0034 JH |
969 | /* Return first function with body defined. */ |
970 | static inline struct cgraph_node * | |
971 | cgraph_first_defined_function (void) | |
972 | { | |
2aae7680 JH |
973 | symtab_node node; |
974 | for (node = symtab_nodes; node; node = node->symbol.next) | |
c47d0034 | 975 | { |
5d59b5e1 | 976 | cgraph_node *cn = dyn_cast <cgraph_node> (node); |
e70670cf | 977 | if (cn && cn->symbol.definition) |
5d59b5e1 | 978 | return cn; |
c47d0034 JH |
979 | } |
980 | return NULL; | |
981 | } | |
982 | ||
45896127 | 983 | /* Return next function with body defined after NODE. */ |
c47d0034 JH |
984 | static inline struct cgraph_node * |
985 | cgraph_next_defined_function (struct cgraph_node *node) | |
986 | { | |
2aae7680 JH |
987 | symtab_node node1 = (symtab_node) node->symbol.next; |
988 | for (; node1; node1 = node1->symbol.next) | |
c47d0034 | 989 | { |
5d59b5e1 | 990 | cgraph_node *cn1 = dyn_cast <cgraph_node> (node1); |
e70670cf | 991 | if (cn1 && cn1->symbol.definition) |
5d59b5e1 | 992 | return cn1; |
c47d0034 JH |
993 | } |
994 | return NULL; | |
995 | } | |
996 | ||
997 | /* Walk all functions with body defined. */ | |
998 | #define FOR_EACH_DEFINED_FUNCTION(node) \ | |
999 | for ((node) = cgraph_first_defined_function (); (node); \ | |
2aae7680 JH |
1000 | (node) = cgraph_next_defined_function ((node))) |
1001 | ||
1002 | /* Return first function. */ | |
1003 | static inline struct cgraph_node * | |
1004 | cgraph_first_function (void) | |
1005 | { | |
1006 | symtab_node node; | |
1007 | for (node = symtab_nodes; node; node = node->symbol.next) | |
5d59b5e1 LC |
1008 | if (cgraph_node *cn = dyn_cast <cgraph_node> (node)) |
1009 | return cn; | |
2aae7680 JH |
1010 | return NULL; |
1011 | } | |
1012 | ||
1013 | /* Return next function. */ | |
1014 | static inline struct cgraph_node * | |
1015 | cgraph_next_function (struct cgraph_node *node) | |
1016 | { | |
1017 | symtab_node node1 = (symtab_node) node->symbol.next; | |
1018 | for (; node1; node1 = node1->symbol.next) | |
5d59b5e1 LC |
1019 | if (cgraph_node *cn1 = dyn_cast <cgraph_node> (node1)) |
1020 | return cn1; | |
2aae7680 JH |
1021 | return NULL; |
1022 | } | |
65c70e6b JH |
1023 | /* Walk all functions. */ |
1024 | #define FOR_EACH_FUNCTION(node) \ | |
2aae7680 JH |
1025 | for ((node) = cgraph_first_function (); (node); \ |
1026 | (node) = cgraph_next_function ((node))) | |
c47d0034 JH |
1027 | |
1028 | /* Return true when NODE is a function with Gimple body defined | |
1029 | in current unit. Functions can also be define externally or they | |
1030 | can be thunks with no Gimple representation. | |
1031 | ||
1032 | Note that at WPA stage, the function body may not be present in memory. */ | |
1033 | ||
1034 | static inline bool | |
1035 | cgraph_function_with_gimple_body_p (struct cgraph_node *node) | |
1036 | { | |
e70670cf | 1037 | return node->symbol.definition && !node->thunk.thunk_p && !node->symbol.alias; |
c47d0034 JH |
1038 | } |
1039 | ||
1040 | /* Return first function with body defined. */ | |
1041 | static inline struct cgraph_node * | |
1042 | cgraph_first_function_with_gimple_body (void) | |
1043 | { | |
2aae7680 JH |
1044 | symtab_node node; |
1045 | for (node = symtab_nodes; node; node = node->symbol.next) | |
c47d0034 | 1046 | { |
5d59b5e1 LC |
1047 | cgraph_node *cn = dyn_cast <cgraph_node> (node); |
1048 | if (cn && cgraph_function_with_gimple_body_p (cn)) | |
1049 | return cn; | |
c47d0034 JH |
1050 | } |
1051 | return NULL; | |
1052 | } | |
1053 | ||
1054 | /* Return next reachable static variable with initializer after NODE. */ | |
1055 | static inline struct cgraph_node * | |
1056 | cgraph_next_function_with_gimple_body (struct cgraph_node *node) | |
1057 | { | |
2aae7680 JH |
1058 | symtab_node node1 = node->symbol.next; |
1059 | for (; node1; node1 = node1->symbol.next) | |
c47d0034 | 1060 | { |
5d59b5e1 LC |
1061 | cgraph_node *cn1 = dyn_cast <cgraph_node> (node1); |
1062 | if (cn1 && cgraph_function_with_gimple_body_p (cn1)) | |
1063 | return cn1; | |
c47d0034 JH |
1064 | } |
1065 | return NULL; | |
1066 | } | |
1067 | ||
1068 | /* Walk all functions with body defined. */ | |
1069 | #define FOR_EACH_FUNCTION_WITH_GIMPLE_BODY(node) \ | |
1070 | for ((node) = cgraph_first_function_with_gimple_body (); (node); \ | |
1071 | (node) = cgraph_next_function_with_gimple_body (node)) | |
1072 | ||
43d861a5 RL |
1073 | /* Create a new static variable of type TYPE. */ |
1074 | tree add_new_static_var (tree type); | |
1075 | ||
fed5ae11 DK |
1076 | /* Return true if iterator CSI points to nothing. */ |
1077 | static inline bool | |
1078 | csi_end_p (cgraph_node_set_iterator csi) | |
1079 | { | |
9771b263 | 1080 | return csi.index >= csi.set->nodes.length (); |
fed5ae11 DK |
1081 | } |
1082 | ||
1083 | /* Advance iterator CSI. */ | |
1084 | static inline void | |
1085 | csi_next (cgraph_node_set_iterator *csi) | |
1086 | { | |
1087 | csi->index++; | |
1088 | } | |
1089 | ||
1090 | /* Return the node pointed to by CSI. */ | |
1091 | static inline struct cgraph_node * | |
1092 | csi_node (cgraph_node_set_iterator csi) | |
1093 | { | |
9771b263 | 1094 | return csi.set->nodes[csi.index]; |
fed5ae11 DK |
1095 | } |
1096 | ||
1097 | /* Return an iterator to the first node in SET. */ | |
1098 | static inline cgraph_node_set_iterator | |
1099 | csi_start (cgraph_node_set set) | |
1100 | { | |
1101 | cgraph_node_set_iterator csi; | |
1102 | ||
1103 | csi.set = set; | |
1104 | csi.index = 0; | |
1105 | return csi; | |
1106 | } | |
1107 | ||
1108 | /* Return true if SET contains NODE. */ | |
1109 | static inline bool | |
1110 | cgraph_node_in_set_p (struct cgraph_node *node, cgraph_node_set set) | |
1111 | { | |
1112 | cgraph_node_set_iterator csi; | |
1113 | csi = cgraph_node_set_find (set, node); | |
1114 | return !csi_end_p (csi); | |
1115 | } | |
1116 | ||
1117 | /* Return number of nodes in SET. */ | |
1118 | static inline size_t | |
1119 | cgraph_node_set_size (cgraph_node_set set) | |
1120 | { | |
9771b263 | 1121 | return set->nodes.length (); |
fed5ae11 DK |
1122 | } |
1123 | ||
2942c502 JH |
1124 | /* Return true if iterator VSI points to nothing. */ |
1125 | static inline bool | |
1126 | vsi_end_p (varpool_node_set_iterator vsi) | |
1127 | { | |
9771b263 | 1128 | return vsi.index >= vsi.set->nodes.length (); |
2942c502 JH |
1129 | } |
1130 | ||
1131 | /* Advance iterator VSI. */ | |
1132 | static inline void | |
1133 | vsi_next (varpool_node_set_iterator *vsi) | |
1134 | { | |
1135 | vsi->index++; | |
1136 | } | |
1137 | ||
1138 | /* Return the node pointed to by VSI. */ | |
1139 | static inline struct varpool_node * | |
1140 | vsi_node (varpool_node_set_iterator vsi) | |
1141 | { | |
9771b263 | 1142 | return vsi.set->nodes[vsi.index]; |
2942c502 JH |
1143 | } |
1144 | ||
1145 | /* Return an iterator to the first node in SET. */ | |
1146 | static inline varpool_node_set_iterator | |
1147 | vsi_start (varpool_node_set set) | |
1148 | { | |
1149 | varpool_node_set_iterator vsi; | |
1150 | ||
1151 | vsi.set = set; | |
1152 | vsi.index = 0; | |
1153 | return vsi; | |
1154 | } | |
1155 | ||
1156 | /* Return true if SET contains NODE. */ | |
1157 | static inline bool | |
1158 | varpool_node_in_set_p (struct varpool_node *node, varpool_node_set set) | |
1159 | { | |
1160 | varpool_node_set_iterator vsi; | |
1161 | vsi = varpool_node_set_find (set, node); | |
1162 | return !vsi_end_p (vsi); | |
1163 | } | |
1164 | ||
1165 | /* Return number of nodes in SET. */ | |
1166 | static inline size_t | |
1167 | varpool_node_set_size (varpool_node_set set) | |
1168 | { | |
9771b263 | 1169 | return set->nodes.length (); |
2942c502 JH |
1170 | } |
1171 | ||
d48e9cea OR |
1172 | /* Uniquize all constants that appear in memory. |
1173 | Each constant in memory thus far output is recorded | |
1174 | in `const_desc_table'. */ | |
1175 | ||
1176 | struct GTY(()) constant_descriptor_tree { | |
1177 | /* A MEM for the constant. */ | |
1178 | rtx rtl; | |
b8698a0f | 1179 | |
d48e9cea OR |
1180 | /* The value of the constant. */ |
1181 | tree value; | |
1182 | ||
1183 | /* Hash of value. Computing the hash from value each time | |
1184 | hashfn is called can't work properly, as that means recursive | |
1185 | use of the hash table during hash table expansion. */ | |
1186 | hashval_t hash; | |
1187 | }; | |
1188 | ||
ace72c88 JH |
1189 | /* Return true if set is nonempty. */ |
1190 | static inline bool | |
1191 | cgraph_node_set_nonempty_p (cgraph_node_set set) | |
1192 | { | |
9771b263 | 1193 | return !set->nodes.is_empty (); |
ace72c88 JH |
1194 | } |
1195 | ||
1196 | /* Return true if set is nonempty. */ | |
1197 | static inline bool | |
1198 | varpool_node_set_nonempty_p (varpool_node_set set) | |
1199 | { | |
9771b263 | 1200 | return !set->nodes.is_empty (); |
ace72c88 JH |
1201 | } |
1202 | ||
be330ed4 | 1203 | /* Return true when function NODE is only called directly or it has alias. |
b20996ff JH |
1204 | i.e. it is not externally visible, address was not taken and |
1205 | it is not used in any other non-standard way. */ | |
1206 | ||
1207 | static inline bool | |
be330ed4 | 1208 | cgraph_only_called_directly_or_aliased_p (struct cgraph_node *node) |
b20996ff | 1209 | { |
530f3a1b | 1210 | gcc_assert (!node->global.inlined_to); |
ead84f73 | 1211 | return (!node->symbol.force_output && !node->symbol.address_taken |
960bfb69 | 1212 | && !node->symbol.used_from_other_partition |
8222c37e | 1213 | && !DECL_VIRTUAL_P (node->symbol.decl) |
960bfb69 JH |
1214 | && !DECL_STATIC_CONSTRUCTOR (node->symbol.decl) |
1215 | && !DECL_STATIC_DESTRUCTOR (node->symbol.decl) | |
1216 | && !node->symbol.externally_visible); | |
b20996ff JH |
1217 | } |
1218 | ||
df7705b1 JH |
1219 | /* Return true when function NODE can be removed from callgraph |
1220 | if all direct calls are eliminated. */ | |
1221 | ||
1222 | static inline bool | |
1223 | varpool_can_remove_if_no_refs (struct varpool_node *node) | |
1224 | { | |
6649df51 JH |
1225 | if (DECL_EXTERNAL (node->symbol.decl)) |
1226 | return true; | |
ead84f73 | 1227 | return (!node->symbol.force_output && !node->symbol.used_from_other_partition |
3d2e04fd | 1228 | && ((DECL_COMDAT (node->symbol.decl) |
edb983b2 | 1229 | && !node->symbol.forced_by_abi |
3d2e04fd | 1230 | && !symtab_used_from_object_file_p ((symtab_node) node)) |
6649df51 JH |
1231 | || !node->symbol.externally_visible |
1232 | || DECL_HAS_VALUE_EXPR_P (node->symbol.decl))); | |
df7705b1 JH |
1233 | } |
1234 | ||
4a444e58 JH |
1235 | /* Return true when all references to VNODE must be visible in ipa_ref_list. |
1236 | i.e. if the variable is not externally visible or not used in some magic | |
1237 | way (asm statement or such). | |
61502ca8 | 1238 | The magic uses are all summarized in force_output flag. */ |
4a444e58 JH |
1239 | |
1240 | static inline bool | |
1241 | varpool_all_refs_explicit_p (struct varpool_node *vnode) | |
1242 | { | |
e70670cf | 1243 | return (vnode->symbol.definition |
960bfb69 JH |
1244 | && !vnode->symbol.externally_visible |
1245 | && !vnode->symbol.used_from_other_partition | |
ead84f73 | 1246 | && !vnode->symbol.force_output); |
4a444e58 JH |
1247 | } |
1248 | ||
d48e9cea OR |
1249 | /* Constant pool accessor function. */ |
1250 | htab_t constant_pool_htab (void); | |
fed5ae11 | 1251 | |
be330ed4 JH |
1252 | /* FIXME: inappropriate dependency of cgraph on IPA. */ |
1253 | #include "ipa-ref-inline.h" | |
1254 | ||
39e2db00 JH |
1255 | /* Return node that alias N is aliasing. */ |
1256 | ||
e70670cf JH |
1257 | static inline symtab_node |
1258 | symtab_alias_target (symtab_node n) | |
39e2db00 JH |
1259 | { |
1260 | struct ipa_ref *ref; | |
960bfb69 | 1261 | ipa_ref_list_reference_iterate (&n->symbol.ref_list, 0, ref); |
39e2db00 | 1262 | gcc_checking_assert (ref->use == IPA_REF_ALIAS); |
e70670cf | 1263 | return ref->referred; |
39e2db00 JH |
1264 | } |
1265 | ||
e70670cf JH |
1266 | static inline struct cgraph_node * |
1267 | cgraph_alias_target (struct cgraph_node *n) | |
cd35bcf7 | 1268 | { |
e70670cf | 1269 | return dyn_cast <cgraph_node> (symtab_alias_target ((symtab_node) n)); |
cd35bcf7 JH |
1270 | } |
1271 | ||
e70670cf JH |
1272 | static inline struct varpool_node * |
1273 | varpool_alias_target (struct varpool_node *n) | |
be330ed4 | 1274 | { |
e70670cf | 1275 | return dyn_cast <varpool_node> (symtab_alias_target ((symtab_node) n)); |
be330ed4 JH |
1276 | } |
1277 | ||
1278 | /* Given NODE, walk the alias chain to return the function NODE is alias of. | |
1279 | Do not walk through thunks. | |
073a8998 | 1280 | When AVAILABILITY is non-NULL, get minimal availability in the chain. */ |
be330ed4 JH |
1281 | |
1282 | static inline struct cgraph_node * | |
40a7fe1e JH |
1283 | cgraph_function_or_thunk_node (struct cgraph_node *node, |
1284 | enum availability *availability = NULL) | |
be330ed4 | 1285 | { |
e70670cf JH |
1286 | struct cgraph_node *n; |
1287 | ||
40a7fe1e JH |
1288 | n = dyn_cast <cgraph_node> (symtab_alias_ultimate_target ((symtab_node)node, |
1289 | availability)); | |
1290 | if (!n && availability) | |
39e2db00 | 1291 | *availability = AVAIL_NOT_AVAILABLE; |
e70670cf | 1292 | return n; |
be330ed4 | 1293 | } |
cd35bcf7 JH |
1294 | /* Given NODE, walk the alias chain to return the function NODE is alias of. |
1295 | Do not walk through thunks. | |
073a8998 | 1296 | When AVAILABILITY is non-NULL, get minimal availability in the chain. */ |
cd35bcf7 JH |
1297 | |
1298 | static inline struct varpool_node * | |
40a7fe1e JH |
1299 | varpool_variable_node (struct varpool_node *node, |
1300 | enum availability *availability = NULL) | |
cd35bcf7 | 1301 | { |
e70670cf JH |
1302 | struct varpool_node *n; |
1303 | ||
40a7fe1e JH |
1304 | n = dyn_cast <varpool_node> (symtab_alias_ultimate_target ((symtab_node)node, |
1305 | availability)); | |
1306 | if (!n && availability) | |
cd35bcf7 | 1307 | *availability = AVAIL_NOT_AVAILABLE; |
e70670cf | 1308 | return n; |
cd35bcf7 JH |
1309 | } |
1310 | ||
d7d1d041 RG |
1311 | /* Return true when the edge E represents a direct recursion. */ |
1312 | static inline bool | |
1313 | cgraph_edge_recursive_p (struct cgraph_edge *e) | |
1314 | { | |
be330ed4 | 1315 | struct cgraph_node *callee = cgraph_function_or_thunk_node (e->callee, NULL); |
d7d1d041 | 1316 | if (e->caller->global.inlined_to) |
960bfb69 | 1317 | return e->caller->global.inlined_to->symbol.decl == callee->symbol.decl; |
d7d1d041 | 1318 | else |
960bfb69 | 1319 | return e->caller->symbol.decl == callee->symbol.decl; |
d7d1d041 | 1320 | } |
0a35513e AH |
1321 | |
1322 | /* Return true if the TM_CLONE bit is set for a given FNDECL. */ | |
1323 | static inline bool | |
1324 | decl_is_tm_clone (const_tree fndecl) | |
1325 | { | |
1326 | struct cgraph_node *n = cgraph_get_node (fndecl); | |
1327 | if (n) | |
1328 | return n->tm_clone; | |
1329 | return false; | |
1330 | } | |
9c8305f8 JH |
1331 | |
1332 | /* Likewise indicate that a node is needed, i.e. reachable via some | |
1333 | external means. */ | |
1334 | ||
1335 | static inline void | |
1336 | cgraph_mark_force_output_node (struct cgraph_node *node) | |
1337 | { | |
1338 | node->symbol.force_output = 1; | |
1339 | gcc_checking_assert (!node->global.inlined_to); | |
1340 | } | |
65d630d4 | 1341 | |
b5493fb2 | 1342 | /* Return true when the symbol is real symbol, i.e. it is not inline clone |
e70670cf | 1343 | or abstract function kept for debug info purposes only. */ |
b5493fb2 JH |
1344 | |
1345 | static inline bool | |
1346 | symtab_real_symbol_p (symtab_node node) | |
1347 | { | |
1348 | struct cgraph_node *cnode; | |
b5493fb2 | 1349 | |
5d59b5e1 | 1350 | if (!is_a <cgraph_node> (node)) |
b5493fb2 JH |
1351 | return true; |
1352 | cnode = cgraph (node); | |
1353 | if (cnode->global.inlined_to) | |
1354 | return false; | |
1355 | if (cnode->abstract_and_needed) | |
1356 | return false; | |
b5493fb2 JH |
1357 | return true; |
1358 | } | |
1c4a429a | 1359 | #endif /* GCC_CGRAPH_H */ |