]>
Commit | Line | Data |
---|---|---|
e72fcfe8 | 1 | /* Callgraph handling code. |
82f331ff | 2 | Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 |
2bafad93 | 3 | Free Software Foundation, Inc. |
e72fcfe8 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 |
e72fcfe8 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/>. */ | |
e72fcfe8 | 21 | |
8a4a83ed | 22 | /* This file contains basic routines manipulating call graph |
c22cacf3 | 23 | |
18c6ada9 JH |
24 | The callgraph: |
25 | ||
26 | The call-graph is data structure designed for intra-procedural optimization | |
27 | but it is also used in non-unit-at-a-time compilation to allow easier code | |
28 | sharing. | |
29 | ||
30 | The call-graph consist of nodes and edges represented via linked lists. | |
0550e7b7 | 31 | Each function (external or not) corresponds to the unique node. |
18c6ada9 JH |
32 | |
33 | The mapping from declarations to call-graph nodes is done using hash table | |
0550e7b7 JH |
34 | based on DECL_UID. The call-graph nodes are created lazily using |
35 | cgraph_node function when called for unknown declaration. | |
18c6ada9 JH |
36 | |
37 | The callgraph at the moment does not represent indirect calls or calls | |
38 | from other compilation unit. Flag NEEDED is set for each node that may | |
1f838355 | 39 | be accessed in such an invisible way and it shall be considered an |
18c6ada9 JH |
40 | entry point to the callgraph. |
41 | ||
a418679d | 42 | Interprocedural information: |
18c6ada9 | 43 | |
a418679d | 44 | Callgraph is place to store data needed for interprocedural optimization. |
1ae58c30 | 45 | All data structures are divided into three components: local_info that |
18c6ada9 | 46 | is produced while analyzing the function, global_info that is result |
1ae58c30 | 47 | of global walking of the callgraph on the end of compilation and |
18c6ada9 JH |
48 | rtl_info used by RTL backend to propagate data from already compiled |
49 | functions to their callers. | |
50 | ||
51 | Inlining plans: | |
52 | ||
53 | The function inlining information is decided in advance and maintained | |
54 | in the callgraph as so called inline plan. | |
1ae58c30 | 55 | For each inlined call, the callee's node is cloned to represent the |
1ea7e6ad | 56 | new function copy produced by inliner. |
1ae58c30 KH |
57 | Each inlined call gets a unique corresponding clone node of the callee |
58 | and the data structure is updated while inlining is performed, so | |
59 | the clones are eliminated and their callee edges redirected to the | |
c22cacf3 | 60 | caller. |
18c6ada9 JH |
61 | |
62 | Each edge has "inline_failed" field. When the field is set to NULL, | |
2b8a92de | 63 | the call will be inlined. When it is non-NULL it contains a reason |
8a4a83ed | 64 | why inlining wasn't performed. */ |
18c6ada9 | 65 | |
e72fcfe8 JH |
66 | #include "config.h" |
67 | #include "system.h" | |
68 | #include "coretypes.h" | |
69 | #include "tm.h" | |
70 | #include "tree.h" | |
cd9c7bd2 | 71 | #include "tree-inline.h" |
e72fcfe8 JH |
72 | #include "langhooks.h" |
73 | #include "hashtab.h" | |
74 | #include "toplev.h" | |
75 | #include "flags.h" | |
76 | #include "ggc.h" | |
77 | #include "debug.h" | |
78 | #include "target.h" | |
cd9c7bd2 | 79 | #include "basic-block.h" |
1c4a429a | 80 | #include "cgraph.h" |
e69529cd | 81 | #include "output.h" |
dc0bfe6a | 82 | #include "intl.h" |
726a989a | 83 | #include "gimple.h" |
ef330312 | 84 | #include "tree-dump.h" |
7a388ee4 | 85 | #include "tree-flow.h" |
a63f2942 | 86 | #include "value-prof.h" |
f9417da1 | 87 | #include "except.h" |
988d1653 | 88 | |
2563c224 RG |
89 | static void cgraph_node_remove_callers (struct cgraph_node *node); |
90 | static inline void cgraph_edge_remove_caller (struct cgraph_edge *e); | |
91 | static inline void cgraph_edge_remove_callee (struct cgraph_edge *e); | |
92 | ||
e72fcfe8 | 93 | /* Hash table used to convert declarations into nodes. */ |
ed2df68b | 94 | static GTY((param_is (struct cgraph_node))) htab_t cgraph_hash; |
266ad5c8 JH |
95 | /* Hash table used to convert assembler names into nodes. */ |
96 | static GTY((param_is (struct cgraph_node))) htab_t assembler_name_hash; | |
e72fcfe8 JH |
97 | |
98 | /* The linked list of cgraph nodes. */ | |
1c4a429a | 99 | struct cgraph_node *cgraph_nodes; |
e72fcfe8 | 100 | |
1668aabc JH |
101 | /* Queue of cgraph nodes scheduled to be lowered. */ |
102 | struct cgraph_node *cgraph_nodes_queue; | |
103 | ||
f45e0ad1 | 104 | /* Queue of cgraph nodes scheduled to be added into cgraph. This is a |
c0220ea4 | 105 | secondary queue used during optimization to accommodate passes that |
50674e96 | 106 | may generate new functions that need to be optimized and expanded. */ |
f45e0ad1 | 107 | struct cgraph_node *cgraph_new_nodes; |
953ff289 | 108 | |
e72fcfe8 | 109 | /* Number of nodes in existence. */ |
1c4a429a | 110 | int cgraph_n_nodes; |
e72fcfe8 | 111 | |
b58b1157 JH |
112 | /* Maximal uid used in cgraph nodes. */ |
113 | int cgraph_max_uid; | |
114 | ||
9088c1cc MJ |
115 | /* Maximal uid used in cgraph edges. */ |
116 | int cgraph_edge_max_uid; | |
117 | ||
6bad2617 TB |
118 | /* Maximal pid used for profiling */ |
119 | int cgraph_max_pid; | |
120 | ||
dafc5b82 JH |
121 | /* Set when whole unit has been analyzed so we can access global info. */ |
122 | bool cgraph_global_info_ready = false; | |
123 | ||
f45e0ad1 JH |
124 | /* What state callgraph is in right now. */ |
125 | enum cgraph_state cgraph_state = CGRAPH_STATE_CONSTRUCTION; | |
126 | ||
cd9c7bd2 JH |
127 | /* Set when the cgraph is fully build and the basic flags are computed. */ |
128 | bool cgraph_function_flags_ready = false; | |
129 | ||
474eccc6 ILT |
130 | /* Linked list of cgraph asm nodes. */ |
131 | struct cgraph_asm_node *cgraph_asm_nodes; | |
132 | ||
133 | /* Last node in cgraph_asm_nodes. */ | |
134 | static GTY(()) struct cgraph_asm_node *cgraph_asm_last_node; | |
135 | ||
136 | /* The order index of the next cgraph node to be created. This is | |
137 | used so that we can sort the cgraph nodes in order by when we saw | |
138 | them, to support -fno-toplevel-reorder. */ | |
139 | int cgraph_order; | |
140 | ||
9088c1cc MJ |
141 | /* List of hooks trigerred on cgraph_edge events. */ |
142 | struct cgraph_edge_hook_list { | |
143 | cgraph_edge_hook hook; | |
144 | void *data; | |
145 | struct cgraph_edge_hook_list *next; | |
146 | }; | |
147 | ||
148 | /* List of hooks trigerred on cgraph_node events. */ | |
149 | struct cgraph_node_hook_list { | |
150 | cgraph_node_hook hook; | |
151 | void *data; | |
152 | struct cgraph_node_hook_list *next; | |
153 | }; | |
154 | ||
155 | /* List of hooks trigerred on events involving two cgraph_edges. */ | |
156 | struct cgraph_2edge_hook_list { | |
157 | cgraph_2edge_hook hook; | |
158 | void *data; | |
159 | struct cgraph_2edge_hook_list *next; | |
160 | }; | |
161 | ||
162 | /* List of hooks trigerred on events involving two cgraph_nodes. */ | |
163 | struct cgraph_2node_hook_list { | |
164 | cgraph_2node_hook hook; | |
165 | void *data; | |
166 | struct cgraph_2node_hook_list *next; | |
167 | }; | |
168 | ||
169 | /* List of hooks triggered when an edge is removed. */ | |
170 | struct cgraph_edge_hook_list *first_cgraph_edge_removal_hook; | |
171 | /* List of hooks triggered when a node is removed. */ | |
172 | struct cgraph_node_hook_list *first_cgraph_node_removal_hook; | |
173 | /* List of hooks triggered when an edge is duplicated. */ | |
174 | struct cgraph_2edge_hook_list *first_cgraph_edge_duplicated_hook; | |
175 | /* List of hooks triggered when a node is duplicated. */ | |
176 | struct cgraph_2node_hook_list *first_cgraph_node_duplicated_hook; | |
129a37fc JH |
177 | /* List of hooks triggered when an function is inserted. */ |
178 | struct cgraph_node_hook_list *first_cgraph_function_insertion_hook; | |
9088c1cc | 179 | |
2fb16412 MJ |
180 | /* Head of a linked list of unused (freed) call graph nodes. |
181 | Do not GTY((delete)) this list so UIDs gets reliably recycled. */ | |
182 | static GTY(()) struct cgraph_node *free_nodes; | |
934cb78a MJ |
183 | /* Head of a linked list of unused (freed) call graph edges. |
184 | Do not GTY((delete)) this list so UIDs gets reliably recycled. */ | |
185 | static GTY(()) struct cgraph_edge *free_edges; | |
186 | ||
2fb16412 MJ |
187 | /* Macros to access the next item in the list of free cgraph nodes and |
188 | edges. */ | |
189 | #define NEXT_FREE_NODE(NODE) (NODE)->next | |
934cb78a | 190 | #define NEXT_FREE_EDGE(EDGE) (EDGE)->prev_caller |
9088c1cc MJ |
191 | |
192 | /* Register HOOK to be called with DATA on each removed edge. */ | |
193 | struct cgraph_edge_hook_list * | |
194 | cgraph_add_edge_removal_hook (cgraph_edge_hook hook, void *data) | |
195 | { | |
196 | struct cgraph_edge_hook_list *entry; | |
197 | struct cgraph_edge_hook_list **ptr = &first_cgraph_edge_removal_hook; | |
198 | ||
199 | entry = (struct cgraph_edge_hook_list *) xmalloc (sizeof (*entry)); | |
200 | entry->hook = hook; | |
201 | entry->data = data; | |
202 | entry->next = NULL; | |
203 | while (*ptr) | |
204 | ptr = &(*ptr)->next; | |
205 | *ptr = entry; | |
206 | return entry; | |
207 | } | |
208 | ||
209 | /* Remove ENTRY from the list of hooks called on removing edges. */ | |
210 | void | |
211 | cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *entry) | |
212 | { | |
213 | struct cgraph_edge_hook_list **ptr = &first_cgraph_edge_removal_hook; | |
214 | ||
215 | while (*ptr != entry) | |
216 | ptr = &(*ptr)->next; | |
217 | *ptr = entry->next; | |
934cb78a | 218 | free (entry); |
9088c1cc MJ |
219 | } |
220 | ||
221 | /* Call all edge removal hooks. */ | |
222 | static void | |
223 | cgraph_call_edge_removal_hooks (struct cgraph_edge *e) | |
224 | { | |
225 | struct cgraph_edge_hook_list *entry = first_cgraph_edge_removal_hook; | |
226 | while (entry) | |
227 | { | |
228 | entry->hook (e, entry->data); | |
229 | entry = entry->next; | |
230 | } | |
231 | } | |
232 | ||
233 | /* Register HOOK to be called with DATA on each removed node. */ | |
234 | struct cgraph_node_hook_list * | |
235 | cgraph_add_node_removal_hook (cgraph_node_hook hook, void *data) | |
236 | { | |
237 | struct cgraph_node_hook_list *entry; | |
238 | struct cgraph_node_hook_list **ptr = &first_cgraph_node_removal_hook; | |
239 | ||
240 | entry = (struct cgraph_node_hook_list *) xmalloc (sizeof (*entry)); | |
241 | entry->hook = hook; | |
242 | entry->data = data; | |
243 | entry->next = NULL; | |
244 | while (*ptr) | |
245 | ptr = &(*ptr)->next; | |
246 | *ptr = entry; | |
247 | return entry; | |
248 | } | |
249 | ||
250 | /* Remove ENTRY from the list of hooks called on removing nodes. */ | |
251 | void | |
252 | cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *entry) | |
253 | { | |
254 | struct cgraph_node_hook_list **ptr = &first_cgraph_node_removal_hook; | |
255 | ||
256 | while (*ptr != entry) | |
257 | ptr = &(*ptr)->next; | |
258 | *ptr = entry->next; | |
934cb78a | 259 | free (entry); |
9088c1cc MJ |
260 | } |
261 | ||
262 | /* Call all node removal hooks. */ | |
263 | static void | |
264 | cgraph_call_node_removal_hooks (struct cgraph_node *node) | |
265 | { | |
266 | struct cgraph_node_hook_list *entry = first_cgraph_node_removal_hook; | |
267 | while (entry) | |
268 | { | |
269 | entry->hook (node, entry->data); | |
270 | entry = entry->next; | |
271 | } | |
272 | } | |
273 | ||
129a37fc JH |
274 | /* Register HOOK to be called with DATA on each removed node. */ |
275 | struct cgraph_node_hook_list * | |
276 | cgraph_add_function_insertion_hook (cgraph_node_hook hook, void *data) | |
277 | { | |
278 | struct cgraph_node_hook_list *entry; | |
279 | struct cgraph_node_hook_list **ptr = &first_cgraph_function_insertion_hook; | |
280 | ||
281 | entry = (struct cgraph_node_hook_list *) xmalloc (sizeof (*entry)); | |
282 | entry->hook = hook; | |
283 | entry->data = data; | |
284 | entry->next = NULL; | |
285 | while (*ptr) | |
286 | ptr = &(*ptr)->next; | |
287 | *ptr = entry; | |
288 | return entry; | |
289 | } | |
290 | ||
291 | /* Remove ENTRY from the list of hooks called on removing nodes. */ | |
292 | void | |
293 | cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *entry) | |
294 | { | |
295 | struct cgraph_node_hook_list **ptr = &first_cgraph_function_insertion_hook; | |
296 | ||
297 | while (*ptr != entry) | |
298 | ptr = &(*ptr)->next; | |
299 | *ptr = entry->next; | |
934cb78a | 300 | free (entry); |
129a37fc JH |
301 | } |
302 | ||
303 | /* Call all node removal hooks. */ | |
304 | void | |
305 | cgraph_call_function_insertion_hooks (struct cgraph_node *node) | |
306 | { | |
307 | struct cgraph_node_hook_list *entry = first_cgraph_function_insertion_hook; | |
308 | while (entry) | |
309 | { | |
310 | entry->hook (node, entry->data); | |
311 | entry = entry->next; | |
312 | } | |
313 | } | |
314 | ||
9088c1cc MJ |
315 | /* Register HOOK to be called with DATA on each duplicated edge. */ |
316 | struct cgraph_2edge_hook_list * | |
317 | cgraph_add_edge_duplication_hook (cgraph_2edge_hook hook, void *data) | |
318 | { | |
319 | struct cgraph_2edge_hook_list *entry; | |
320 | struct cgraph_2edge_hook_list **ptr = &first_cgraph_edge_duplicated_hook; | |
321 | ||
322 | entry = (struct cgraph_2edge_hook_list *) xmalloc (sizeof (*entry)); | |
323 | entry->hook = hook; | |
324 | entry->data = data; | |
325 | entry->next = NULL; | |
326 | while (*ptr) | |
327 | ptr = &(*ptr)->next; | |
328 | *ptr = entry; | |
329 | return entry; | |
330 | } | |
331 | ||
332 | /* Remove ENTRY from the list of hooks called on duplicating edges. */ | |
333 | void | |
334 | cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *entry) | |
335 | { | |
336 | struct cgraph_2edge_hook_list **ptr = &first_cgraph_edge_duplicated_hook; | |
337 | ||
338 | while (*ptr != entry) | |
339 | ptr = &(*ptr)->next; | |
340 | *ptr = entry->next; | |
934cb78a | 341 | free (entry); |
9088c1cc MJ |
342 | } |
343 | ||
344 | /* Call all edge duplication hooks. */ | |
345 | static void | |
346 | cgraph_call_edge_duplication_hooks (struct cgraph_edge *cs1, | |
347 | struct cgraph_edge *cs2) | |
348 | { | |
349 | struct cgraph_2edge_hook_list *entry = first_cgraph_edge_duplicated_hook; | |
350 | while (entry) | |
351 | { | |
352 | entry->hook (cs1, cs2, entry->data); | |
353 | entry = entry->next; | |
354 | } | |
355 | } | |
356 | ||
357 | /* Register HOOK to be called with DATA on each duplicated node. */ | |
358 | struct cgraph_2node_hook_list * | |
359 | cgraph_add_node_duplication_hook (cgraph_2node_hook hook, void *data) | |
360 | { | |
361 | struct cgraph_2node_hook_list *entry; | |
362 | struct cgraph_2node_hook_list **ptr = &first_cgraph_node_duplicated_hook; | |
363 | ||
364 | entry = (struct cgraph_2node_hook_list *) xmalloc (sizeof (*entry)); | |
365 | entry->hook = hook; | |
366 | entry->data = data; | |
367 | entry->next = NULL; | |
368 | while (*ptr) | |
369 | ptr = &(*ptr)->next; | |
370 | *ptr = entry; | |
371 | return entry; | |
372 | } | |
373 | ||
374 | /* Remove ENTRY from the list of hooks called on duplicating nodes. */ | |
375 | void | |
376 | cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *entry) | |
377 | { | |
378 | struct cgraph_2node_hook_list **ptr = &first_cgraph_node_duplicated_hook; | |
379 | ||
380 | while (*ptr != entry) | |
381 | ptr = &(*ptr)->next; | |
382 | *ptr = entry->next; | |
934cb78a | 383 | free (entry); |
9088c1cc MJ |
384 | } |
385 | ||
386 | /* Call all node duplication hooks. */ | |
387 | static void | |
388 | cgraph_call_node_duplication_hooks (struct cgraph_node *node1, | |
389 | struct cgraph_node *node2) | |
390 | { | |
391 | struct cgraph_2node_hook_list *entry = first_cgraph_node_duplicated_hook; | |
392 | while (entry) | |
393 | { | |
394 | entry->hook (node1, node2, entry->data); | |
395 | entry = entry->next; | |
396 | } | |
397 | } | |
398 | ||
e72fcfe8 JH |
399 | /* Returns a hash code for P. */ |
400 | ||
401 | static hashval_t | |
439f7bc3 | 402 | hash_node (const void *p) |
e72fcfe8 | 403 | { |
cceb1885 | 404 | const struct cgraph_node *n = (const struct cgraph_node *) p; |
6f312d18 | 405 | return (hashval_t) DECL_UID (n->decl); |
e72fcfe8 JH |
406 | } |
407 | ||
4537ec0c DN |
408 | |
409 | /* Return the cgraph node associated with function DECL. If none | |
410 | exists, return NULL. */ | |
411 | ||
412 | struct cgraph_node * | |
413 | cgraph_node_for_decl (tree decl) | |
414 | { | |
415 | struct cgraph_node *node; | |
416 | void **slot; | |
417 | ||
418 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); | |
419 | ||
420 | node = NULL; | |
421 | if (cgraph_hash) | |
422 | { | |
423 | struct cgraph_node key; | |
424 | ||
425 | key.decl = decl; | |
426 | slot = htab_find_slot (cgraph_hash, &key, NO_INSERT); | |
427 | if (slot && *slot) | |
428 | node = (struct cgraph_node *) *slot; | |
429 | } | |
430 | ||
431 | return node; | |
432 | } | |
433 | ||
434 | ||
6356f892 | 435 | /* Returns nonzero if P1 and P2 are equal. */ |
e72fcfe8 JH |
436 | |
437 | static int | |
439f7bc3 | 438 | eq_node (const void *p1, const void *p2) |
e72fcfe8 | 439 | { |
cceb1885 GDR |
440 | const struct cgraph_node *n1 = (const struct cgraph_node *) p1; |
441 | const struct cgraph_node *n2 = (const struct cgraph_node *) p2; | |
6f312d18 | 442 | return DECL_UID (n1->decl) == DECL_UID (n2->decl); |
e72fcfe8 JH |
443 | } |
444 | ||
1ae58c30 | 445 | /* Allocate new callgraph node and insert it into basic data structures. */ |
0550e7b7 | 446 | |
18c6ada9 JH |
447 | static struct cgraph_node * |
448 | cgraph_create_node (void) | |
449 | { | |
450 | struct cgraph_node *node; | |
451 | ||
2fb16412 MJ |
452 | if (free_nodes) |
453 | { | |
454 | node = free_nodes; | |
455 | free_nodes = NEXT_FREE_NODE (node); | |
456 | } | |
457 | else | |
458 | { | |
459 | node = GGC_CNEW (struct cgraph_node); | |
460 | node->uid = cgraph_max_uid++; | |
461 | } | |
462 | ||
18c6ada9 | 463 | node->next = cgraph_nodes; |
6bad2617 | 464 | node->pid = -1; |
474eccc6 | 465 | node->order = cgraph_order++; |
18c6ada9 JH |
466 | if (cgraph_nodes) |
467 | cgraph_nodes->previous = node; | |
468 | node->previous = NULL; | |
670cd5c5 | 469 | node->global.estimated_growth = INT_MIN; |
18c6ada9 JH |
470 | cgraph_nodes = node; |
471 | cgraph_n_nodes++; | |
472 | return node; | |
473 | } | |
474 | ||
e72fcfe8 | 475 | /* Return cgraph node assigned to DECL. Create new one when needed. */ |
0550e7b7 | 476 | |
1c4a429a | 477 | struct cgraph_node * |
439f7bc3 | 478 | cgraph_node (tree decl) |
e72fcfe8 | 479 | { |
6f312d18 | 480 | struct cgraph_node key, *node, **slot; |
e72fcfe8 | 481 | |
341c100f | 482 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
988d1653 | 483 | |
e72fcfe8 | 484 | if (!cgraph_hash) |
ed2df68b | 485 | cgraph_hash = htab_create_ggc (10, hash_node, eq_node, NULL); |
e72fcfe8 | 486 | |
6f312d18 ZW |
487 | key.decl = decl; |
488 | ||
489 | slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, &key, INSERT); | |
490 | ||
e72fcfe8 | 491 | if (*slot) |
6b02a499 JH |
492 | { |
493 | node = *slot; | |
6b02a499 JH |
494 | return node; |
495 | } | |
18c6ada9 JH |
496 | |
497 | node = cgraph_create_node (); | |
e72fcfe8 | 498 | node->decl = decl; |
e72fcfe8 | 499 | *slot = node; |
5c2e00ee | 500 | if (DECL_CONTEXT (decl) && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL) |
e72fcfe8 JH |
501 | { |
502 | node->origin = cgraph_node (DECL_CONTEXT (decl)); | |
503 | node->next_nested = node->origin->nested; | |
504 | node->origin->nested = node; | |
505 | } | |
1aeaf0f7 JJ |
506 | if (assembler_name_hash) |
507 | { | |
508 | void **aslot; | |
509 | tree name = DECL_ASSEMBLER_NAME (decl); | |
510 | ||
511 | aslot = htab_find_slot_with_hash (assembler_name_hash, name, | |
512 | decl_assembler_name_hash (name), | |
513 | INSERT); | |
514 | /* We can have multiple declarations with same assembler name. For C++ | |
515 | it is __builtin_strlen and strlen, for instance. Do we need to | |
516 | record them all? Original implementation marked just first one | |
517 | so lets hope for the best. */ | |
518 | if (*aslot == NULL) | |
519 | *aslot = node; | |
520 | } | |
e72fcfe8 JH |
521 | return node; |
522 | } | |
523 | ||
f9329c35 DS |
524 | /* Returns the cgraph node assigned to DECL or NULL if no cgraph node |
525 | is assigned. */ | |
526 | ||
527 | struct cgraph_node * | |
528 | cgraph_get_node (tree decl) | |
529 | { | |
530 | struct cgraph_node key, *node = NULL, **slot; | |
531 | ||
532 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); | |
533 | ||
534 | if (!cgraph_hash) | |
535 | cgraph_hash = htab_create_ggc (10, hash_node, eq_node, NULL); | |
536 | ||
537 | key.decl = decl; | |
538 | ||
539 | slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, &key, | |
540 | NO_INSERT); | |
541 | ||
542 | if (slot && *slot) | |
543 | node = *slot; | |
544 | return node; | |
545 | } | |
546 | ||
ea99e0be JH |
547 | /* Insert already constructed node into hashtable. */ |
548 | ||
549 | void | |
550 | cgraph_insert_node_to_hashtable (struct cgraph_node *node) | |
551 | { | |
552 | struct cgraph_node **slot; | |
553 | ||
554 | slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, node, INSERT); | |
555 | ||
556 | gcc_assert (!*slot); | |
557 | *slot = node; | |
558 | } | |
559 | ||
266ad5c8 JH |
560 | /* Returns a hash code for P. */ |
561 | ||
562 | static hashval_t | |
563 | hash_node_by_assembler_name (const void *p) | |
564 | { | |
565 | const struct cgraph_node *n = (const struct cgraph_node *) p; | |
566 | return (hashval_t) decl_assembler_name_hash (DECL_ASSEMBLER_NAME (n->decl)); | |
567 | } | |
568 | ||
569 | /* Returns nonzero if P1 and P2 are equal. */ | |
570 | ||
571 | static int | |
572 | eq_assembler_name (const void *p1, const void *p2) | |
573 | { | |
574 | const struct cgraph_node *n1 = (const struct cgraph_node *) p1; | |
575 | const_tree name = (const_tree)p2; | |
576 | return (decl_assembler_name_equal (n1->decl, name)); | |
577 | } | |
bedb9fc0 RH |
578 | |
579 | /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME. | |
580 | Return NULL if there's no such node. */ | |
581 | ||
582 | struct cgraph_node * | |
583 | cgraph_node_for_asm (tree asmname) | |
584 | { | |
585 | struct cgraph_node *node; | |
266ad5c8 | 586 | void **slot; |
bedb9fc0 | 587 | |
266ad5c8 JH |
588 | if (!assembler_name_hash) |
589 | { | |
590 | assembler_name_hash = | |
591 | htab_create_ggc (10, hash_node_by_assembler_name, eq_assembler_name, | |
592 | NULL); | |
593 | for (node = cgraph_nodes; node; node = node->next) | |
594 | if (!node->global.inlined_to) | |
595 | { | |
596 | tree name = DECL_ASSEMBLER_NAME (node->decl); | |
597 | slot = htab_find_slot_with_hash (assembler_name_hash, name, | |
598 | decl_assembler_name_hash (name), | |
599 | INSERT); | |
600 | /* We can have multiple declarations with same assembler name. For C++ | |
601 | it is __builtin_strlen and strlen, for instance. Do we need to | |
602 | record them all? Original implementation marked just first one | |
603 | so lets hope for the best. */ | |
604 | if (*slot) | |
605 | continue; | |
606 | *slot = node; | |
607 | } | |
608 | } | |
609 | ||
610 | slot = htab_find_slot_with_hash (assembler_name_hash, asmname, | |
611 | decl_assembler_name_hash (asmname), | |
612 | NO_INSERT); | |
bedb9fc0 | 613 | |
266ad5c8 JH |
614 | if (slot) |
615 | return (struct cgraph_node *) *slot; | |
bedb9fc0 RH |
616 | return NULL; |
617 | } | |
618 | ||
70d539ce JH |
619 | /* Returns a hash value for X (which really is a die_struct). */ |
620 | ||
621 | static hashval_t | |
622 | edge_hash (const void *x) | |
623 | { | |
741ac903 | 624 | return htab_hash_pointer (((const struct cgraph_edge *) x)->call_stmt); |
70d539ce JH |
625 | } |
626 | ||
627 | /* Return nonzero if decl_id of die_struct X is the same as UID of decl *Y. */ | |
628 | ||
629 | static int | |
630 | edge_eq (const void *x, const void *y) | |
631 | { | |
741ac903 | 632 | return ((const struct cgraph_edge *) x)->call_stmt == y; |
70d539ce JH |
633 | } |
634 | ||
726a989a RB |
635 | |
636 | /* Return the callgraph edge representing the GIMPLE_CALL statement | |
637 | CALL_STMT. */ | |
638 | ||
18c6ada9 | 639 | struct cgraph_edge * |
726a989a | 640 | cgraph_edge (struct cgraph_node *node, gimple call_stmt) |
18c6ada9 | 641 | { |
70d539ce JH |
642 | struct cgraph_edge *e, *e2; |
643 | int n = 0; | |
644 | ||
645 | if (node->call_site_hash) | |
f883e0a7 KG |
646 | return (struct cgraph_edge *) |
647 | htab_find_with_hash (node->call_site_hash, call_stmt, | |
52c76998 | 648 | htab_hash_pointer (call_stmt)); |
18c6ada9 JH |
649 | |
650 | /* This loop may turn out to be performance problem. In such case adding | |
651 | hashtables into call nodes with very many edges is probably best | |
2b8a92de | 652 | solution. It is not good idea to add pointer into CALL_EXPR itself |
18c6ada9 JH |
653 | because we want to make possible having multiple cgraph nodes representing |
654 | different clones of the same body before the body is actually cloned. */ | |
655 | for (e = node->callees; e; e= e->next_callee) | |
70d539ce JH |
656 | { |
657 | if (e->call_stmt == call_stmt) | |
658 | break; | |
659 | n++; | |
660 | } | |
726a989a | 661 | |
70d539ce JH |
662 | if (n > 100) |
663 | { | |
664 | node->call_site_hash = htab_create_ggc (120, edge_hash, edge_eq, NULL); | |
665 | for (e2 = node->callees; e2; e2 = e2->next_callee) | |
666 | { | |
667 | void **slot; | |
668 | slot = htab_find_slot_with_hash (node->call_site_hash, | |
669 | e2->call_stmt, | |
670 | htab_hash_pointer (e2->call_stmt), | |
671 | INSERT); | |
672 | gcc_assert (!*slot); | |
673 | *slot = e2; | |
674 | } | |
675 | } | |
726a989a | 676 | |
18c6ada9 JH |
677 | return e; |
678 | } | |
679 | ||
726a989a | 680 | |
9187e02d | 681 | /* Change field call_stmt of edge E to NEW_STMT. */ |
0550e7b7 | 682 | |
70d539ce | 683 | void |
726a989a | 684 | cgraph_set_call_stmt (struct cgraph_edge *e, gimple new_stmt) |
70d539ce JH |
685 | { |
686 | if (e->caller->call_site_hash) | |
687 | { | |
688 | htab_remove_elt_with_hash (e->caller->call_site_hash, | |
689 | e->call_stmt, | |
690 | htab_hash_pointer (e->call_stmt)); | |
691 | } | |
692 | e->call_stmt = new_stmt; | |
b6fa5b01 | 693 | push_cfun (DECL_STRUCT_FUNCTION (e->caller->decl)); |
2505c5ed | 694 | e->can_throw_external = stmt_can_throw_external (new_stmt); |
b6fa5b01 | 695 | pop_cfun (); |
70d539ce JH |
696 | if (e->caller->call_site_hash) |
697 | { | |
698 | void **slot; | |
699 | slot = htab_find_slot_with_hash (e->caller->call_site_hash, | |
700 | e->call_stmt, | |
701 | htab_hash_pointer | |
702 | (e->call_stmt), INSERT); | |
703 | gcc_assert (!*slot); | |
704 | *slot = e; | |
705 | } | |
706 | } | |
707 | ||
9b2a5ef7 RH |
708 | /* Like cgraph_set_call_stmt but walk the clone tree and update all |
709 | clones sharing the same function body. */ | |
9187e02d JH |
710 | |
711 | void | |
712 | cgraph_set_call_stmt_including_clones (struct cgraph_node *orig, | |
713 | gimple old_stmt, gimple new_stmt) | |
714 | { | |
715 | struct cgraph_node *node; | |
716 | struct cgraph_edge *edge = cgraph_edge (orig, old_stmt); | |
717 | ||
718 | if (edge) | |
719 | cgraph_set_call_stmt (edge, new_stmt); | |
9b2a5ef7 RH |
720 | |
721 | node = orig->clones; | |
722 | if (node) | |
723 | while (node != orig) | |
9187e02d JH |
724 | { |
725 | struct cgraph_edge *edge = cgraph_edge (node, old_stmt); | |
726 | if (edge) | |
727 | cgraph_set_call_stmt (edge, new_stmt); | |
728 | if (node->clones) | |
729 | node = node->clones; | |
730 | else if (node->next_sibling_clone) | |
731 | node = node->next_sibling_clone; | |
732 | else | |
733 | { | |
734 | while (node != orig && !node->next_sibling_clone) | |
735 | node = node->clone_of; | |
736 | if (node != orig) | |
737 | node = node->next_sibling_clone; | |
738 | } | |
739 | } | |
740 | } | |
741 | ||
742 | /* Like cgraph_create_edge walk the clone tree and update all clones sharing | |
743 | same function body. | |
744 | ||
745 | TODO: COUNT and LOOP_DEPTH should be properly distributed based on relative | |
9b2a5ef7 | 746 | frequencies of the clones. */ |
9187e02d JH |
747 | |
748 | void | |
9b2a5ef7 RH |
749 | cgraph_create_edge_including_clones (struct cgraph_node *orig, |
750 | struct cgraph_node *callee, | |
751 | gimple stmt, gcov_type count, | |
752 | int freq, int loop_depth, | |
9187e02d JH |
753 | cgraph_inline_failed_t reason) |
754 | { | |
755 | struct cgraph_node *node; | |
9b2a5ef7 | 756 | struct cgraph_edge *edge; |
9187e02d | 757 | |
6ce2002b | 758 | if (!cgraph_edge (orig, stmt)) |
9b2a5ef7 RH |
759 | { |
760 | edge = cgraph_create_edge (orig, callee, stmt, count, freq, loop_depth); | |
761 | edge->inline_failed = reason; | |
762 | } | |
9187e02d | 763 | |
9b2a5ef7 RH |
764 | node = orig->clones; |
765 | if (node) | |
766 | while (node != orig) | |
9187e02d JH |
767 | { |
768 | /* It is possible that we already constant propagated into the clone | |
769 | and turned indirect call into dirrect call. */ | |
770 | if (!cgraph_edge (node, stmt)) | |
9b2a5ef7 RH |
771 | { |
772 | edge = cgraph_create_edge (node, callee, stmt, count, | |
773 | freq, loop_depth); | |
774 | edge->inline_failed = reason; | |
775 | } | |
9187e02d JH |
776 | |
777 | if (node->clones) | |
778 | node = node->clones; | |
779 | else if (node->next_sibling_clone) | |
780 | node = node->next_sibling_clone; | |
781 | else | |
782 | { | |
783 | while (node != orig && !node->next_sibling_clone) | |
784 | node = node->clone_of; | |
785 | if (node != orig) | |
786 | node = node->next_sibling_clone; | |
787 | } | |
788 | } | |
789 | } | |
790 | ||
3dc9eaa6 AN |
791 | /* Give initial reasons why inlining would fail on EDGE. This gets either |
792 | nullified or usually overwritten by more precise reasons later. */ | |
793 | ||
794 | static void | |
795 | initialize_inline_failed (struct cgraph_edge *e) | |
796 | { | |
797 | struct cgraph_node *callee = e->callee; | |
798 | ||
799 | if (!callee->analyzed) | |
800 | e->inline_failed = CIF_BODY_NOT_AVAILABLE; | |
801 | else if (callee->local.redefined_extern_inline) | |
802 | e->inline_failed = CIF_REDEFINED_EXTERN_INLINE; | |
803 | else if (!callee->local.inlinable) | |
804 | e->inline_failed = CIF_FUNCTION_NOT_INLINABLE; | |
d7f09764 | 805 | else if (e->call_stmt && gimple_call_cannot_inline_p (e->call_stmt)) |
3dc9eaa6 AN |
806 | e->inline_failed = CIF_MISMATCHED_ARGUMENTS; |
807 | else | |
808 | e->inline_failed = CIF_FUNCTION_NOT_CONSIDERED; | |
809 | } | |
810 | ||
e72fcfe8 JH |
811 | /* Create edge from CALLER to CALLEE in the cgraph. */ |
812 | ||
18c6ada9 JH |
813 | struct cgraph_edge * |
814 | cgraph_create_edge (struct cgraph_node *caller, struct cgraph_node *callee, | |
726a989a | 815 | gimple call_stmt, gcov_type count, int freq, int nest) |
e72fcfe8 | 816 | { |
934cb78a | 817 | struct cgraph_edge *edge; |
18c6ada9 | 818 | |
d7f09764 DN |
819 | |
820 | /* LTO does not actually have access to the call_stmt since these | |
821 | have not been loaded yet. */ | |
822 | if (call_stmt) | |
823 | { | |
b1d0a338 JH |
824 | #ifdef ENABLE_CHECKING |
825 | /* This is rather pricely check possibly trigerring construction of call stmt | |
826 | hashtable. */ | |
827 | gcc_assert (!cgraph_edge (caller, call_stmt)); | |
18c6ada9 JH |
828 | #endif |
829 | ||
d7f09764 DN |
830 | gcc_assert (is_gimple_call (call_stmt)); |
831 | } | |
b58b1157 | 832 | |
934cb78a MJ |
833 | if (free_edges) |
834 | { | |
835 | edge = free_edges; | |
836 | free_edges = NEXT_FREE_EDGE (edge); | |
837 | } | |
838 | else | |
839 | { | |
840 | edge = GGC_NEW (struct cgraph_edge); | |
841 | edge->uid = cgraph_edge_max_uid++; | |
842 | } | |
843 | ||
18c6ada9 | 844 | edge->aux = NULL; |
e72fcfe8 JH |
845 | |
846 | edge->caller = caller; | |
847 | edge->callee = callee; | |
e0704a46 | 848 | edge->call_stmt = call_stmt; |
b6fa5b01 | 849 | push_cfun (DECL_STRUCT_FUNCTION (caller->decl)); |
2505c5ed | 850 | edge->can_throw_external = stmt_can_throw_external (call_stmt); |
b6fa5b01 | 851 | pop_cfun (); |
2563c224 | 852 | edge->prev_caller = NULL; |
e72fcfe8 | 853 | edge->next_caller = callee->callers; |
2563c224 RG |
854 | if (callee->callers) |
855 | callee->callers->prev_caller = edge; | |
856 | edge->prev_callee = NULL; | |
e72fcfe8 | 857 | edge->next_callee = caller->callees; |
2563c224 RG |
858 | if (caller->callees) |
859 | caller->callees->prev_callee = edge; | |
e72fcfe8 JH |
860 | caller->callees = edge; |
861 | callee->callers = edge; | |
e42922b1 | 862 | edge->count = count; |
45a80bb9 JH |
863 | gcc_assert (count >= 0); |
864 | edge->frequency = freq; | |
865 | gcc_assert (freq >= 0); | |
866 | gcc_assert (freq <= CGRAPH_FREQ_MAX); | |
e42922b1 | 867 | edge->loop_nest = nest; |
3e293154 | 868 | edge->indirect_call = 0; |
d7f09764 DN |
869 | edge->call_stmt_cannot_inline_p = |
870 | (call_stmt ? gimple_call_cannot_inline_p (call_stmt) : false); | |
871 | if (call_stmt && caller->call_site_hash) | |
70d539ce JH |
872 | { |
873 | void **slot; | |
874 | slot = htab_find_slot_with_hash (caller->call_site_hash, | |
875 | edge->call_stmt, | |
876 | htab_hash_pointer | |
877 | (edge->call_stmt), | |
878 | INSERT); | |
879 | gcc_assert (!*slot); | |
880 | *slot = edge; | |
881 | } | |
3dc9eaa6 AN |
882 | |
883 | initialize_inline_failed (edge); | |
884 | ||
e72fcfe8 JH |
885 | return edge; |
886 | } | |
887 | ||
2563c224 RG |
888 | /* Remove the edge E from the list of the callers of the callee. */ |
889 | ||
890 | static inline void | |
891 | cgraph_edge_remove_callee (struct cgraph_edge *e) | |
892 | { | |
893 | if (e->prev_caller) | |
894 | e->prev_caller->next_caller = e->next_caller; | |
895 | if (e->next_caller) | |
896 | e->next_caller->prev_caller = e->prev_caller; | |
897 | if (!e->prev_caller) | |
898 | e->callee->callers = e->next_caller; | |
899 | } | |
900 | ||
901 | /* Remove the edge E from the list of the callees of the caller. */ | |
902 | ||
903 | static inline void | |
904 | cgraph_edge_remove_caller (struct cgraph_edge *e) | |
905 | { | |
906 | if (e->prev_callee) | |
907 | e->prev_callee->next_callee = e->next_callee; | |
908 | if (e->next_callee) | |
909 | e->next_callee->prev_callee = e->prev_callee; | |
910 | if (!e->prev_callee) | |
911 | e->caller->callees = e->next_callee; | |
70d539ce JH |
912 | if (e->caller->call_site_hash) |
913 | htab_remove_elt_with_hash (e->caller->call_site_hash, | |
914 | e->call_stmt, | |
915 | htab_hash_pointer (e->call_stmt)); | |
2563c224 RG |
916 | } |
917 | ||
934cb78a MJ |
918 | /* Put the edge onto the free list. */ |
919 | ||
920 | static void | |
921 | cgraph_free_edge (struct cgraph_edge *e) | |
922 | { | |
923 | int uid = e->uid; | |
924 | ||
925 | /* Clear out the edge so we do not dangle pointers. */ | |
5c0466b5 | 926 | memset (e, 0, sizeof (*e)); |
934cb78a MJ |
927 | e->uid = uid; |
928 | NEXT_FREE_EDGE (e) = free_edges; | |
929 | free_edges = e; | |
930 | } | |
931 | ||
2563c224 | 932 | /* Remove the edge E in the cgraph. */ |
e72fcfe8 | 933 | |
cb967da5 | 934 | void |
18c6ada9 | 935 | cgraph_remove_edge (struct cgraph_edge *e) |
e72fcfe8 | 936 | { |
934cb78a | 937 | /* Call all edge removal hooks. */ |
9088c1cc | 938 | cgraph_call_edge_removal_hooks (e); |
934cb78a | 939 | |
2563c224 RG |
940 | /* Remove from callers list of the callee. */ |
941 | cgraph_edge_remove_callee (e); | |
942 | ||
943 | /* Remove from callees list of the callers. */ | |
944 | cgraph_edge_remove_caller (e); | |
934cb78a MJ |
945 | |
946 | /* Put the edge onto the free list. */ | |
947 | cgraph_free_edge (e); | |
e72fcfe8 JH |
948 | } |
949 | ||
18c6ada9 JH |
950 | /* Redirect callee of E to N. The function does not update underlying |
951 | call expression. */ | |
952 | ||
953 | void | |
954 | cgraph_redirect_edge_callee (struct cgraph_edge *e, struct cgraph_node *n) | |
955 | { | |
2563c224 RG |
956 | /* Remove from callers list of the current callee. */ |
957 | cgraph_edge_remove_callee (e); | |
18c6ada9 | 958 | |
2563c224 RG |
959 | /* Insert to callers list of the new callee. */ |
960 | e->prev_caller = NULL; | |
961 | if (n->callers) | |
962 | n->callers->prev_caller = e; | |
18c6ada9 JH |
963 | e->next_caller = n->callers; |
964 | n->callers = e; | |
2563c224 RG |
965 | e->callee = n; |
966 | } | |
967 | ||
726a989a RB |
968 | |
969 | /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL | |
4b685e14 JH |
970 | OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl |
971 | of OLD_STMT if it was previously call statement. */ | |
2bafad93 | 972 | |
9187e02d JH |
973 | static void |
974 | cgraph_update_edges_for_call_stmt_node (struct cgraph_node *node, | |
4b685e14 | 975 | gimple old_stmt, tree old_call, gimple new_stmt) |
2bafad93 | 976 | { |
4b685e14 | 977 | tree new_call = (is_gimple_call (new_stmt)) ? gimple_call_fndecl (new_stmt) : 0; |
2bafad93 | 978 | |
4b685e14 JH |
979 | /* We are seeing indirect calls, then there is nothing to update. */ |
980 | if (!new_call && !old_call) | |
981 | return; | |
982 | /* See if we turned indirect call into direct call or folded call to one builtin | |
983 | into different bultin. */ | |
2bafad93 JJ |
984 | if (old_call != new_call) |
985 | { | |
986 | struct cgraph_edge *e = cgraph_edge (node, old_stmt); | |
987 | struct cgraph_edge *ne = NULL; | |
4b685e14 JH |
988 | gcov_type count; |
989 | int frequency; | |
990 | int loop_nest; | |
2bafad93 JJ |
991 | |
992 | if (e) | |
993 | { | |
4b685e14 JH |
994 | /* See if the call is already there. It might be because of indirect |
995 | inlining already found it. */ | |
996 | if (new_call && e->callee->decl == new_call) | |
997 | return; | |
998 | ||
999 | /* Otherwise remove edge and create new one; we can't simply redirect | |
1000 | since function has changed, so inline plan and other information | |
1001 | attached to edge is invalid. */ | |
2bafad93 | 1002 | cgraph_remove_edge (e); |
4b685e14 JH |
1003 | count = e->count; |
1004 | frequency = e->frequency; | |
1005 | loop_nest = e->loop_nest; | |
1006 | } | |
1007 | else | |
1008 | { | |
1009 | /* We are seeing new direct call; compute profile info based on BB. */ | |
1010 | basic_block bb = gimple_bb (new_stmt); | |
1011 | count = bb->count; | |
1012 | frequency = compute_call_stmt_bb_frequency (current_function_decl, | |
1013 | bb); | |
1014 | loop_nest = bb->loop_depth; | |
2bafad93 | 1015 | } |
2bafad93 | 1016 | |
4b685e14 JH |
1017 | if (new_call) |
1018 | { | |
1019 | ne = cgraph_create_edge (node, cgraph_node (new_call), | |
1020 | new_stmt, count, frequency, | |
1021 | loop_nest); | |
1022 | gcc_assert (ne->inline_failed); | |
1023 | } | |
2bafad93 | 1024 | } |
4b685e14 JH |
1025 | /* We only updated the call stmt; update pointer in cgraph edge.. */ |
1026 | else if (old_stmt != new_stmt) | |
1027 | cgraph_set_call_stmt (cgraph_edge (node, old_stmt), new_stmt); | |
2bafad93 JJ |
1028 | } |
1029 | ||
9187e02d | 1030 | /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL |
4b685e14 JH |
1031 | OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl |
1032 | of OLD_STMT before it was updated (updating can happen inplace). */ | |
9187e02d JH |
1033 | |
1034 | void | |
4b685e14 | 1035 | cgraph_update_edges_for_call_stmt (gimple old_stmt, tree old_decl, gimple new_stmt) |
9187e02d JH |
1036 | { |
1037 | struct cgraph_node *orig = cgraph_node (cfun->decl); | |
1038 | struct cgraph_node *node; | |
1039 | ||
4b685e14 | 1040 | cgraph_update_edges_for_call_stmt_node (orig, old_stmt, old_decl, new_stmt); |
9187e02d JH |
1041 | if (orig->clones) |
1042 | for (node = orig->clones; node != orig;) | |
1043 | { | |
4b685e14 | 1044 | cgraph_update_edges_for_call_stmt_node (node, old_stmt, old_decl, new_stmt); |
9187e02d JH |
1045 | if (node->clones) |
1046 | node = node->clones; | |
1047 | else if (node->next_sibling_clone) | |
1048 | node = node->next_sibling_clone; | |
1049 | else | |
1050 | { | |
1051 | while (node != orig && !node->next_sibling_clone) | |
1052 | node = node->clone_of; | |
1053 | if (node != orig) | |
1054 | node = node->next_sibling_clone; | |
1055 | } | |
1056 | } | |
1057 | } | |
1058 | ||
726a989a | 1059 | |
2563c224 RG |
1060 | /* Remove all callees from the node. */ |
1061 | ||
1062 | void | |
1063 | cgraph_node_remove_callees (struct cgraph_node *node) | |
1064 | { | |
5c0466b5 | 1065 | struct cgraph_edge *e, *f; |
2563c224 RG |
1066 | |
1067 | /* It is sufficient to remove the edges from the lists of callers of | |
1068 | the callees. The callee list of the node can be zapped with one | |
1069 | assignment. */ | |
5c0466b5 | 1070 | for (e = node->callees; e; e = f) |
9088c1cc | 1071 | { |
5c0466b5 | 1072 | f = e->next_callee; |
9088c1cc MJ |
1073 | cgraph_call_edge_removal_hooks (e); |
1074 | cgraph_edge_remove_callee (e); | |
934cb78a | 1075 | cgraph_free_edge (e); |
9088c1cc | 1076 | } |
2563c224 | 1077 | node->callees = NULL; |
70d539ce JH |
1078 | if (node->call_site_hash) |
1079 | { | |
1080 | htab_delete (node->call_site_hash); | |
1081 | node->call_site_hash = NULL; | |
1082 | } | |
2563c224 RG |
1083 | } |
1084 | ||
1085 | /* Remove all callers from the node. */ | |
1086 | ||
1087 | static void | |
1088 | cgraph_node_remove_callers (struct cgraph_node *node) | |
1089 | { | |
5c0466b5 | 1090 | struct cgraph_edge *e, *f; |
2563c224 RG |
1091 | |
1092 | /* It is sufficient to remove the edges from the lists of callees of | |
1093 | the callers. The caller list of the node can be zapped with one | |
1094 | assignment. */ | |
5c0466b5 | 1095 | for (e = node->callers; e; e = f) |
9088c1cc | 1096 | { |
5c0466b5 | 1097 | f = e->next_caller; |
9088c1cc MJ |
1098 | cgraph_call_edge_removal_hooks (e); |
1099 | cgraph_edge_remove_caller (e); | |
934cb78a | 1100 | cgraph_free_edge (e); |
9088c1cc | 1101 | } |
2563c224 | 1102 | node->callers = NULL; |
18c6ada9 JH |
1103 | } |
1104 | ||
3a40c18a JH |
1105 | /* Release memory used to represent body of function NODE. */ |
1106 | ||
1107 | void | |
1108 | cgraph_release_function_body (struct cgraph_node *node) | |
1109 | { | |
936fc9ba | 1110 | if (DECL_STRUCT_FUNCTION (node->decl)) |
3a40c18a JH |
1111 | { |
1112 | tree old_decl = current_function_decl; | |
1113 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); | |
936fc9ba JH |
1114 | if (cfun->gimple_df) |
1115 | { | |
1116 | current_function_decl = node->decl; | |
1117 | delete_tree_ssa (); | |
1118 | delete_tree_cfg_annotations (); | |
1119 | cfun->eh = NULL; | |
1120 | current_function_decl = old_decl; | |
1121 | } | |
1122 | if (cfun->cfg) | |
1123 | { | |
1124 | gcc_assert (dom_computed[0] == DOM_NONE); | |
1125 | gcc_assert (dom_computed[1] == DOM_NONE); | |
1126 | clear_edges (); | |
1127 | } | |
a63f2942 JH |
1128 | if (cfun->value_histograms) |
1129 | free_histograms (); | |
1130 | gcc_assert (!current_loops); | |
3a40c18a | 1131 | pop_cfun(); |
936fc9ba JH |
1132 | gimple_set_body (node->decl, NULL); |
1133 | VEC_free (ipa_opt_pass, heap, | |
1134 | DECL_STRUCT_FUNCTION (node->decl)->ipa_transforms_to_apply); | |
1135 | /* Struct function hangs a lot of data that would leak if we didn't | |
1136 | removed all pointers to it. */ | |
1137 | ggc_free (DECL_STRUCT_FUNCTION (node->decl)); | |
1138 | DECL_STRUCT_FUNCTION (node->decl) = NULL; | |
3a40c18a JH |
1139 | } |
1140 | DECL_SAVED_TREE (node->decl) = NULL; | |
6b20f353 DS |
1141 | /* If the node is abstract and needed, then do not clear DECL_INITIAL |
1142 | of its associated function function declaration because it's | |
1143 | needed to emit debug info later. */ | |
1144 | if (!node->abstract_and_needed) | |
1145 | DECL_INITIAL (node->decl) = error_mark_node; | |
3a40c18a JH |
1146 | } |
1147 | ||
18d13f34 JH |
1148 | /* Remove the node from cgraph. */ |
1149 | ||
1150 | void | |
439f7bc3 | 1151 | cgraph_remove_node (struct cgraph_node *node) |
18d13f34 | 1152 | { |
2ee1067b | 1153 | void **slot; |
4a76d91a | 1154 | bool kill_body = false; |
ca30a539 | 1155 | struct cgraph_node *n; |
2fb16412 | 1156 | int uid = node->uid; |
18c6ada9 | 1157 | |
9088c1cc | 1158 | cgraph_call_node_removal_hooks (node); |
2563c224 RG |
1159 | cgraph_node_remove_callers (node); |
1160 | cgraph_node_remove_callees (node); | |
266ad5c8 | 1161 | |
96fc428c JH |
1162 | /* Incremental inlining access removed nodes stored in the postorder list. |
1163 | */ | |
1164 | node->needed = node->reachable = false; | |
ca30a539 JH |
1165 | for (n = node->nested; n; n = n->next_nested) |
1166 | n->origin = NULL; | |
1167 | node->nested = NULL; | |
18d13f34 JH |
1168 | if (node->origin) |
1169 | { | |
1170 | struct cgraph_node **node2 = &node->origin->nested; | |
1171 | ||
1172 | while (*node2 != node) | |
1173 | node2 = &(*node2)->next_nested; | |
1174 | *node2 = node->next_nested; | |
1175 | } | |
1176 | if (node->previous) | |
1177 | node->previous->next = node->next; | |
1178 | else | |
9b0436b7 | 1179 | cgraph_nodes = node->next; |
18d13f34 JH |
1180 | if (node->next) |
1181 | node->next->previous = node->previous; | |
96fc428c JH |
1182 | node->next = NULL; |
1183 | node->previous = NULL; | |
6f312d18 | 1184 | slot = htab_find_slot (cgraph_hash, node, NO_INSERT); |
18c6ada9 JH |
1185 | if (*slot == node) |
1186 | { | |
9187e02d | 1187 | struct cgraph_node *next_inline_clone; |
c22cacf3 | 1188 | |
9187e02d JH |
1189 | for (next_inline_clone = node->clones; |
1190 | next_inline_clone && next_inline_clone->decl != node->decl; | |
1191 | next_inline_clone = next_inline_clone->next_sibling_clone) | |
1192 | ; | |
1193 | ||
1194 | /* If there is inline clone of the node being removed, we need | |
1195 | to put it into the position of removed node and reorganize all | |
1196 | other clones to be based on it. */ | |
1197 | if (next_inline_clone) | |
1198 | { | |
1199 | struct cgraph_node *n; | |
1200 | struct cgraph_node *new_clones; | |
1201 | ||
1202 | *slot = next_inline_clone; | |
1203 | ||
1204 | /* Unlink inline clone from the list of clones of removed node. */ | |
1205 | if (next_inline_clone->next_sibling_clone) | |
1206 | next_inline_clone->next_sibling_clone->prev_sibling_clone | |
1207 | = next_inline_clone->prev_sibling_clone; | |
1208 | if (next_inline_clone->prev_sibling_clone) | |
1209 | { | |
1210 | next_inline_clone->prev_sibling_clone->next_sibling_clone | |
1211 | = next_inline_clone->next_sibling_clone; | |
1212 | } | |
1213 | else | |
1214 | node->clones = next_inline_clone->next_sibling_clone; | |
1215 | ||
1216 | new_clones = node->clones; | |
1217 | node->clones = NULL; | |
1218 | ||
1219 | /* Copy clone info. */ | |
1220 | next_inline_clone->clone = node->clone; | |
1221 | ||
1222 | /* Now place it into clone tree at same level at NODE. */ | |
1223 | next_inline_clone->clone_of = node->clone_of; | |
1224 | next_inline_clone->prev_sibling_clone = NULL; | |
1225 | next_inline_clone->next_sibling_clone = NULL; | |
1226 | if (node->clone_of) | |
1227 | { | |
1228 | next_inline_clone->next_sibling_clone = node->clone_of->clones; | |
1229 | node->clone_of->clones = next_inline_clone; | |
1230 | } | |
1231 | ||
1232 | /* Merge the clone list. */ | |
1233 | if (new_clones) | |
1234 | { | |
1235 | if (!next_inline_clone->clones) | |
1236 | next_inline_clone->clones = new_clones; | |
1237 | else | |
1238 | { | |
1239 | n = next_inline_clone->clones; | |
1240 | while (n->next_sibling_clone) | |
1241 | n = n->next_sibling_clone; | |
1242 | n->next_sibling_clone = new_clones; | |
1243 | new_clones->prev_sibling_clone = n; | |
1244 | } | |
1245 | } | |
1246 | ||
1247 | /* Update clone_of pointers. */ | |
1248 | n = new_clones; | |
1249 | while (n) | |
1250 | { | |
1251 | n->clone_of = next_inline_clone; | |
1252 | n = n->next_sibling_clone; | |
1253 | } | |
1254 | } | |
18c6ada9 JH |
1255 | else |
1256 | { | |
c22cacf3 | 1257 | htab_clear_slot (cgraph_hash, slot); |
4a76d91a | 1258 | kill_body = true; |
18c6ada9 | 1259 | } |
9187e02d | 1260 | |
18c6ada9 JH |
1261 | } |
1262 | else | |
9187e02d JH |
1263 | gcc_assert (node->clone_of); |
1264 | if (node->prev_sibling_clone) | |
1265 | node->prev_sibling_clone->next_sibling_clone = node->next_sibling_clone; | |
1266 | else if (node->clone_of) | |
1267 | node->clone_of->clones = node->next_sibling_clone; | |
1268 | if (node->next_sibling_clone) | |
1269 | node->next_sibling_clone->prev_sibling_clone = node->prev_sibling_clone; | |
1270 | if (node->clones) | |
18c6ada9 | 1271 | { |
9187e02d JH |
1272 | struct cgraph_node *n; |
1273 | ||
1274 | for (n = node->clones; n->next_sibling_clone; n = n->next_sibling_clone) | |
1275 | n->clone_of = node->clone_of; | |
1276 | n->clone_of = node->clone_of; | |
1277 | n->next_sibling_clone = node->clone_of->clones; | |
1278 | if (node->clone_of->clones) | |
1279 | node->clone_of->clones->prev_sibling_clone = n; | |
1280 | node->clone_of->clones = node->clones; | |
18c6ada9 JH |
1281 | } |
1282 | ||
c22cacf3 | 1283 | /* While all the clones are removed after being proceeded, the function |
4a76d91a JH |
1284 | itself is kept in the cgraph even after it is compiled. Check whether |
1285 | we are done with this body and reclaim it proactively if this is the case. | |
1286 | */ | |
1287 | if (!kill_body && *slot) | |
18c6ada9 | 1288 | { |
cceb1885 | 1289 | struct cgraph_node *n = (struct cgraph_node *) *slot; |
9187e02d | 1290 | if (!n->clones && !n->clone_of && !n->global.inlined_to |
d63db217 JH |
1291 | && (cgraph_global_info_ready |
1292 | && (TREE_ASM_WRITTEN (n->decl) || DECL_EXTERNAL (n->decl)))) | |
4a76d91a JH |
1293 | kill_body = true; |
1294 | } | |
266ad5c8 JH |
1295 | if (assembler_name_hash) |
1296 | { | |
1297 | tree name = DECL_ASSEMBLER_NAME (node->decl); | |
1298 | slot = htab_find_slot_with_hash (assembler_name_hash, name, | |
1299 | decl_assembler_name_hash (name), | |
1300 | NO_INSERT); | |
1301 | /* Inline clones are not hashed. */ | |
1302 | if (slot && *slot == node) | |
1303 | htab_clear_slot (assembler_name_hash, slot); | |
1304 | } | |
18c6ada9 | 1305 | |
7e8b322a | 1306 | if (kill_body) |
3a40c18a | 1307 | cgraph_release_function_body (node); |
96fc428c | 1308 | node->decl = NULL; |
70d539ce JH |
1309 | if (node->call_site_hash) |
1310 | { | |
1311 | htab_delete (node->call_site_hash); | |
1312 | node->call_site_hash = NULL; | |
1313 | } | |
18c6ada9 | 1314 | cgraph_n_nodes--; |
2fb16412 MJ |
1315 | |
1316 | /* Clear out the node to NULL all pointers and add the node to the free | |
1317 | list. */ | |
1318 | memset (node, 0, sizeof(*node)); | |
1319 | node->uid = uid; | |
1320 | NEXT_FREE_NODE (node) = free_nodes; | |
1321 | free_nodes = node; | |
18d13f34 JH |
1322 | } |
1323 | ||
9187e02d JH |
1324 | /* Remove the node from cgraph. */ |
1325 | ||
1326 | void | |
1327 | cgraph_remove_node_and_inline_clones (struct cgraph_node *node) | |
1328 | { | |
1329 | struct cgraph_edge *e, *next; | |
1330 | for (e = node->callees; e; e = next) | |
1331 | { | |
1332 | next = e->next_callee; | |
1333 | if (!e->inline_failed) | |
1334 | cgraph_remove_node_and_inline_clones (e->callee); | |
1335 | } | |
1336 | cgraph_remove_node (node); | |
1337 | } | |
1338 | ||
8dafba3c RH |
1339 | /* Notify finalize_compilation_unit that given node is reachable. */ |
1340 | ||
1668aabc | 1341 | void |
8dafba3c | 1342 | cgraph_mark_reachable_node (struct cgraph_node *node) |
1668aabc | 1343 | { |
ba245151 | 1344 | if (!node->reachable && node->local.finalized) |
1668aabc | 1345 | { |
ba245151 | 1346 | notice_global_symbol (node->decl); |
1668aabc | 1347 | node->reachable = 1; |
45676d2b | 1348 | gcc_assert (!cgraph_global_info_ready); |
e767b5be JH |
1349 | |
1350 | node->next_needed = cgraph_nodes_queue; | |
1351 | cgraph_nodes_queue = node; | |
1668aabc JH |
1352 | } |
1353 | } | |
1354 | ||
8dafba3c RH |
1355 | /* Likewise indicate that a node is needed, i.e. reachable via some |
1356 | external means. */ | |
1357 | ||
1358 | void | |
1359 | cgraph_mark_needed_node (struct cgraph_node *node) | |
1360 | { | |
1361 | node->needed = 1; | |
b20996ff | 1362 | gcc_assert (!node->global.inlined_to); |
8dafba3c RH |
1363 | cgraph_mark_reachable_node (node); |
1364 | } | |
18d13f34 | 1365 | |
39ff5a96 JH |
1366 | /* Likewise indicate that a node is having address taken. */ |
1367 | ||
1368 | void | |
1369 | cgraph_mark_address_taken_node (struct cgraph_node *node) | |
1370 | { | |
1371 | node->address_taken = 1; | |
1372 | cgraph_mark_needed_node (node); | |
1373 | } | |
1374 | ||
dafc5b82 JH |
1375 | /* Return local info for the compiled function. */ |
1376 | ||
1377 | struct cgraph_local_info * | |
439f7bc3 | 1378 | cgraph_local_info (tree decl) |
dafc5b82 JH |
1379 | { |
1380 | struct cgraph_node *node; | |
c22cacf3 | 1381 | |
341c100f | 1382 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
dafc5b82 JH |
1383 | node = cgraph_node (decl); |
1384 | return &node->local; | |
1385 | } | |
1386 | ||
1387 | /* Return local info for the compiled function. */ | |
1388 | ||
1389 | struct cgraph_global_info * | |
439f7bc3 | 1390 | cgraph_global_info (tree decl) |
dafc5b82 JH |
1391 | { |
1392 | struct cgraph_node *node; | |
c22cacf3 | 1393 | |
341c100f | 1394 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL && cgraph_global_info_ready); |
dafc5b82 JH |
1395 | node = cgraph_node (decl); |
1396 | return &node->global; | |
1397 | } | |
1398 | ||
b255a036 JH |
1399 | /* Return local info for the compiled function. */ |
1400 | ||
1401 | struct cgraph_rtl_info * | |
439f7bc3 | 1402 | cgraph_rtl_info (tree decl) |
b255a036 JH |
1403 | { |
1404 | struct cgraph_node *node; | |
c22cacf3 | 1405 | |
341c100f | 1406 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); |
b255a036 JH |
1407 | node = cgraph_node (decl); |
1408 | if (decl != current_function_decl | |
1409 | && !TREE_ASM_WRITTEN (node->decl)) | |
1410 | return NULL; | |
1411 | return &node->rtl; | |
1412 | } | |
1413 | ||
61a05df1 JH |
1414 | /* Return a string describing the failure REASON. */ |
1415 | ||
1416 | const char* | |
1417 | cgraph_inline_failed_string (cgraph_inline_failed_t reason) | |
1418 | { | |
1419 | #undef DEFCIFCODE | |
1420 | #define DEFCIFCODE(code, string) string, | |
1421 | ||
1422 | static const char *cif_string_table[CIF_N_REASONS] = { | |
1423 | #include "cif-code.def" | |
1424 | }; | |
1425 | ||
1426 | /* Signedness of an enum type is implementation defined, so cast it | |
1427 | to unsigned before testing. */ | |
1428 | gcc_assert ((unsigned) reason < CIF_N_REASONS); | |
1429 | return cif_string_table[reason]; | |
1430 | } | |
1431 | ||
a194aa56 JH |
1432 | /* Return name of the node used in debug output. */ |
1433 | const char * | |
439f7bc3 | 1434 | cgraph_node_name (struct cgraph_node *node) |
a194aa56 | 1435 | { |
ae2bcd98 | 1436 | return lang_hooks.decl_printable_name (node->decl, 2); |
a194aa56 | 1437 | } |
dafc5b82 | 1438 | |
6b02a499 | 1439 | /* Names used to print out the availability enum. */ |
8a4a83ed | 1440 | const char * const cgraph_availability_names[] = |
fa10beec | 1441 | {"unset", "not_available", "overwritable", "available", "local"}; |
6b02a499 | 1442 | |
c4e622b6 DN |
1443 | |
1444 | /* Dump call graph node NODE to file F. */ | |
1445 | ||
18c6ada9 JH |
1446 | void |
1447 | dump_cgraph_node (FILE *f, struct cgraph_node *node) | |
1448 | { | |
1449 | struct cgraph_edge *edge; | |
82f331ff AO |
1450 | fprintf (f, "%s/%i(%i)", cgraph_node_name (node), node->uid, |
1451 | node->pid); | |
1452 | dump_addr (f, " @", (void *)node); | |
18c6ada9 JH |
1453 | if (node->global.inlined_to) |
1454 | fprintf (f, " (inline copy in %s/%i)", | |
1455 | cgraph_node_name (node->global.inlined_to), | |
1456 | node->global.inlined_to->uid); | |
9187e02d JH |
1457 | if (node->clone_of) |
1458 | fprintf (f, " (clone of %s/%i)", | |
1459 | cgraph_node_name (node->clone_of), | |
1460 | node->clone_of->uid); | |
6b02a499 | 1461 | if (cgraph_function_flags_ready) |
c22cacf3 | 1462 | fprintf (f, " availability:%s", |
8a4a83ed | 1463 | cgraph_availability_names [cgraph_function_body_availability (node)]); |
e42922b1 JH |
1464 | if (node->count) |
1465 | fprintf (f, " executed "HOST_WIDEST_INT_PRINT_DEC"x", | |
1466 | (HOST_WIDEST_INT)node->count); | |
85057983 JH |
1467 | if (node->local.inline_summary.self_time) |
1468 | fprintf (f, " %i time, %i benefit", node->local.inline_summary.self_time, | |
1469 | node->local.inline_summary.time_inlining_benefit); | |
1470 | if (node->global.time && node->global.time | |
1471 | != node->local.inline_summary.self_time) | |
1472 | fprintf (f, " (%i after inlining)", node->global.time); | |
1473 | if (node->local.inline_summary.self_size) | |
1474 | fprintf (f, " %i size, %i benefit", node->local.inline_summary.self_size, | |
1475 | node->local.inline_summary.size_inlining_benefit); | |
1476 | if (node->global.size && node->global.size | |
1477 | != node->local.inline_summary.self_size) | |
1478 | fprintf (f, " (%i after inlining)", node->global.size); | |
95622280 JH |
1479 | if (node->local.inline_summary.estimated_self_stack_size) |
1480 | fprintf (f, " %i bytes stack usage", (int)node->local.inline_summary.estimated_self_stack_size); | |
1481 | if (node->global.estimated_stack_size != node->local.inline_summary.estimated_self_stack_size) | |
ff28a94d | 1482 | fprintf (f, " %i bytes after inlining", (int)node->global.estimated_stack_size); |
18c6ada9 JH |
1483 | if (node->origin) |
1484 | fprintf (f, " nested in: %s", cgraph_node_name (node->origin)); | |
1485 | if (node->needed) | |
1486 | fprintf (f, " needed"); | |
39ff5a96 JH |
1487 | if (node->address_taken) |
1488 | fprintf (f, " address_taken"); | |
18c6ada9 JH |
1489 | else if (node->reachable) |
1490 | fprintf (f, " reachable"); | |
39ecc018 | 1491 | if (gimple_has_body_p (node->decl)) |
726a989a | 1492 | fprintf (f, " body"); |
257eb6e3 JH |
1493 | if (node->process) |
1494 | fprintf (f, " process"); | |
18c6ada9 JH |
1495 | if (node->local.local) |
1496 | fprintf (f, " local"); | |
e7d6beb0 JH |
1497 | if (node->local.externally_visible) |
1498 | fprintf (f, " externally_visible"); | |
1499 | if (node->local.finalized) | |
1500 | fprintf (f, " finalized"); | |
18c6ada9 JH |
1501 | if (node->local.disregard_inline_limits) |
1502 | fprintf (f, " always_inline"); | |
1503 | else if (node->local.inlinable) | |
1504 | fprintf (f, " inlinable"); | |
e7d6beb0 JH |
1505 | if (node->local.redefined_extern_inline) |
1506 | fprintf (f, " redefined_extern_inline"); | |
18c6ada9 JH |
1507 | if (TREE_ASM_WRITTEN (node->decl)) |
1508 | fprintf (f, " asm_written"); | |
1509 | ||
1510 | fprintf (f, "\n called by: "); | |
1511 | for (edge = node->callers; edge; edge = edge->next_caller) | |
1512 | { | |
1513 | fprintf (f, "%s/%i ", cgraph_node_name (edge->caller), | |
1514 | edge->caller->uid); | |
e42922b1 JH |
1515 | if (edge->count) |
1516 | fprintf (f, "("HOST_WIDEST_INT_PRINT_DEC"x) ", | |
1517 | (HOST_WIDEST_INT)edge->count); | |
45a80bb9 JH |
1518 | if (edge->frequency) |
1519 | fprintf (f, "(%.2f per call) ", | |
1520 | edge->frequency / (double)CGRAPH_FREQ_BASE); | |
18c6ada9 JH |
1521 | if (!edge->inline_failed) |
1522 | fprintf(f, "(inlined) "); | |
3e293154 MJ |
1523 | if (edge->indirect_call) |
1524 | fprintf(f, "(indirect) "); | |
2505c5ed JH |
1525 | if (edge->can_throw_external) |
1526 | fprintf(f, "(can throw external) "); | |
18c6ada9 JH |
1527 | } |
1528 | ||
1529 | fprintf (f, "\n calls: "); | |
1530 | for (edge = node->callees; edge; edge = edge->next_callee) | |
1531 | { | |
1532 | fprintf (f, "%s/%i ", cgraph_node_name (edge->callee), | |
1533 | edge->callee->uid); | |
1534 | if (!edge->inline_failed) | |
1535 | fprintf(f, "(inlined) "); | |
3e293154 MJ |
1536 | if (edge->indirect_call) |
1537 | fprintf(f, "(indirect) "); | |
6b02a499 JH |
1538 | if (edge->count) |
1539 | fprintf (f, "("HOST_WIDEST_INT_PRINT_DEC"x) ", | |
1540 | (HOST_WIDEST_INT)edge->count); | |
45a80bb9 JH |
1541 | if (edge->frequency) |
1542 | fprintf (f, "(%.2f per call) ", | |
1543 | edge->frequency / (double)CGRAPH_FREQ_BASE); | |
6b02a499 JH |
1544 | if (edge->loop_nest) |
1545 | fprintf (f, "(nested in %i loops) ", edge->loop_nest); | |
b6fa5b01 JH |
1546 | if (edge->can_throw_external) |
1547 | fprintf(f, "(can throw external) "); | |
18c6ada9 JH |
1548 | } |
1549 | fprintf (f, "\n"); | |
1550 | } | |
1551 | ||
c4e622b6 DN |
1552 | |
1553 | /* Dump call graph node NODE to stderr. */ | |
1554 | ||
1555 | void | |
1556 | debug_cgraph_node (struct cgraph_node *node) | |
1557 | { | |
1558 | dump_cgraph_node (stderr, node); | |
1559 | } | |
1560 | ||
1561 | ||
1562 | /* Dump the callgraph to file F. */ | |
e72fcfe8 JH |
1563 | |
1564 | void | |
439f7bc3 | 1565 | dump_cgraph (FILE *f) |
e72fcfe8 JH |
1566 | { |
1567 | struct cgraph_node *node; | |
1568 | ||
7d82fe7c | 1569 | fprintf (f, "callgraph:\n\n"); |
e72fcfe8 | 1570 | for (node = cgraph_nodes; node; node = node->next) |
18c6ada9 | 1571 | dump_cgraph_node (f, node); |
e72fcfe8 | 1572 | } |
988d1653 | 1573 | |
c4e622b6 DN |
1574 | |
1575 | /* Dump the call graph to stderr. */ | |
1576 | ||
1577 | void | |
1578 | debug_cgraph (void) | |
1579 | { | |
1580 | dump_cgraph (stderr); | |
1581 | } | |
1582 | ||
1583 | ||
fccc4eb2 | 1584 | /* Set the DECL_ASSEMBLER_NAME and update cgraph hashtables. */ |
c4e622b6 | 1585 | |
fccc4eb2 JH |
1586 | void |
1587 | change_decl_assembler_name (tree decl, tree name) | |
1588 | { | |
266ad5c8 | 1589 | gcc_assert (!assembler_name_hash); |
fccc4eb2 JH |
1590 | if (!DECL_ASSEMBLER_NAME_SET_P (decl)) |
1591 | { | |
1592 | SET_DECL_ASSEMBLER_NAME (decl, name); | |
1593 | return; | |
1594 | } | |
1595 | if (name == DECL_ASSEMBLER_NAME (decl)) | |
1596 | return; | |
1597 | ||
df964a18 JH |
1598 | if (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)) |
1599 | && DECL_RTL_SET_P (decl)) | |
d4ee4d25 | 1600 | warning (0, "%D renamed after being referenced in assembly", decl); |
fccc4eb2 | 1601 | |
fccc4eb2 | 1602 | SET_DECL_ASSEMBLER_NAME (decl, name); |
e69529cd JH |
1603 | } |
1604 | ||
474eccc6 ILT |
1605 | /* Add a top-level asm statement to the list. */ |
1606 | ||
1607 | struct cgraph_asm_node * | |
1608 | cgraph_add_asm_node (tree asm_str) | |
1609 | { | |
1610 | struct cgraph_asm_node *node; | |
1611 | ||
1612 | node = GGC_CNEW (struct cgraph_asm_node); | |
1613 | node->asm_str = asm_str; | |
1614 | node->order = cgraph_order++; | |
1615 | node->next = NULL; | |
1616 | if (cgraph_asm_nodes == NULL) | |
1617 | cgraph_asm_nodes = node; | |
1618 | else | |
1619 | cgraph_asm_last_node->next = node; | |
1620 | cgraph_asm_last_node = node; | |
1621 | return node; | |
1622 | } | |
1623 | ||
1bb17c21 JH |
1624 | /* Return true when the DECL can possibly be inlined. */ |
1625 | bool | |
1626 | cgraph_function_possibly_inlined_p (tree decl) | |
1627 | { | |
1bb17c21 | 1628 | if (!cgraph_global_info_ready) |
e90acd93 | 1629 | return !DECL_UNINLINABLE (decl); |
6f312d18 | 1630 | return DECL_POSSIBLY_INLINED (decl); |
18c6ada9 JH |
1631 | } |
1632 | ||
1633 | /* Create clone of E in the node N represented by CALL_EXPR the callgraph. */ | |
1634 | struct cgraph_edge * | |
e42922b1 | 1635 | cgraph_clone_edge (struct cgraph_edge *e, struct cgraph_node *n, |
d7f09764 DN |
1636 | gimple call_stmt, unsigned stmt_uid, gcov_type count_scale, |
1637 | int freq_scale, int loop_nest, bool update_original) | |
18c6ada9 | 1638 | { |
82d6e6fc | 1639 | struct cgraph_edge *new_edge; |
45a80bb9 JH |
1640 | gcov_type count = e->count * count_scale / REG_BR_PROB_BASE; |
1641 | gcov_type freq = e->frequency * (gcov_type) freq_scale / CGRAPH_FREQ_BASE; | |
e42922b1 | 1642 | |
45a80bb9 JH |
1643 | if (freq > CGRAPH_FREQ_MAX) |
1644 | freq = CGRAPH_FREQ_MAX; | |
82d6e6fc | 1645 | new_edge = cgraph_create_edge (n, e->callee, call_stmt, count, freq, |
c22cacf3 | 1646 | e->loop_nest + loop_nest); |
18c6ada9 | 1647 | |
82d6e6fc KG |
1648 | new_edge->inline_failed = e->inline_failed; |
1649 | new_edge->indirect_call = e->indirect_call; | |
d7f09764 | 1650 | new_edge->lto_stmt_uid = stmt_uid; |
c5a4444c | 1651 | if (update_original) |
d63f0fe5 | 1652 | { |
82d6e6fc | 1653 | e->count -= new_edge->count; |
d63f0fe5 JH |
1654 | if (e->count < 0) |
1655 | e->count = 0; | |
1656 | } | |
82d6e6fc KG |
1657 | cgraph_call_edge_duplication_hooks (e, new_edge); |
1658 | return new_edge; | |
1bb17c21 | 1659 | } |
e69529cd | 1660 | |
e42922b1 | 1661 | /* Create node representing clone of N executed COUNT times. Decrease |
c22cacf3 | 1662 | the execution counts from original node too. |
c5a4444c JH |
1663 | |
1664 | When UPDATE_ORIGINAL is true, the counts are subtracted from the original | |
1665 | function's profile to reflect the fact that part of execution is handled | |
1666 | by node. */ | |
18c6ada9 | 1667 | struct cgraph_node * |
726a989a | 1668 | cgraph_clone_node (struct cgraph_node *n, gcov_type count, int freq, |
03ec7d01 JH |
1669 | int loop_nest, bool update_original, |
1670 | VEC(cgraph_edge_p,heap) *redirect_callers) | |
18c6ada9 | 1671 | { |
82d6e6fc | 1672 | struct cgraph_node *new_node = cgraph_create_node (); |
18c6ada9 | 1673 | struct cgraph_edge *e; |
06191a23 | 1674 | gcov_type count_scale; |
03ec7d01 | 1675 | unsigned i; |
18c6ada9 | 1676 | |
82d6e6fc KG |
1677 | new_node->decl = n->decl; |
1678 | new_node->origin = n->origin; | |
1679 | if (new_node->origin) | |
18c6ada9 | 1680 | { |
82d6e6fc KG |
1681 | new_node->next_nested = new_node->origin->nested; |
1682 | new_node->origin->nested = new_node; | |
18c6ada9 | 1683 | } |
82d6e6fc KG |
1684 | new_node->analyzed = n->analyzed; |
1685 | new_node->local = n->local; | |
b20996ff | 1686 | new_node->local.externally_visible = false; |
82d6e6fc KG |
1687 | new_node->global = n->global; |
1688 | new_node->rtl = n->rtl; | |
82d6e6fc | 1689 | new_node->count = count; |
9187e02d | 1690 | new_node->clone = n->clone; |
e42922b1 | 1691 | if (n->count) |
52c76998 PY |
1692 | { |
1693 | if (new_node->count > n->count) | |
1694 | count_scale = REG_BR_PROB_BASE; | |
1695 | else | |
1696 | count_scale = new_node->count * REG_BR_PROB_BASE / n->count; | |
1697 | } | |
e42922b1 JH |
1698 | else |
1699 | count_scale = 0; | |
c5a4444c | 1700 | if (update_original) |
d63f0fe5 JH |
1701 | { |
1702 | n->count -= count; | |
1703 | if (n->count < 0) | |
1704 | n->count = 0; | |
1705 | } | |
18c6ada9 | 1706 | |
03ec7d01 JH |
1707 | for (i = 0; VEC_iterate (cgraph_edge_p, redirect_callers, i, e); i++) |
1708 | { | |
1709 | /* Redirect calls to the old version node to point to its new | |
1710 | version. */ | |
1711 | cgraph_redirect_edge_callee (e, new_node); | |
1712 | } | |
1713 | ||
1714 | ||
18c6ada9 | 1715 | for (e = n->callees;e; e=e->next_callee) |
d7f09764 DN |
1716 | cgraph_clone_edge (e, new_node, e->call_stmt, e->lto_stmt_uid, |
1717 | count_scale, freq, loop_nest, update_original); | |
18c6ada9 | 1718 | |
9187e02d JH |
1719 | new_node->next_sibling_clone = n->clones; |
1720 | if (n->clones) | |
1721 | n->clones->prev_sibling_clone = new_node; | |
1722 | n->clones = new_node; | |
1723 | new_node->clone_of = n; | |
18c6ada9 | 1724 | |
82d6e6fc KG |
1725 | cgraph_call_node_duplication_hooks (n, new_node); |
1726 | return new_node; | |
18c6ada9 | 1727 | } |
8f235343 | 1728 | |
9187e02d JH |
1729 | /* Create a new name for omp child function. Returns an identifier. */ |
1730 | ||
1731 | static GTY(()) unsigned int clone_fn_id_num; | |
1732 | ||
1733 | static tree | |
1734 | clone_function_name (tree decl) | |
1735 | { | |
1736 | tree name = DECL_ASSEMBLER_NAME (decl); | |
1737 | size_t len = IDENTIFIER_LENGTH (name); | |
1738 | char *tmp_name, *prefix; | |
1739 | ||
1740 | prefix = XALLOCAVEC (char, len + strlen ("_clone") + 1); | |
1741 | memcpy (prefix, IDENTIFIER_POINTER (name), len); | |
1742 | strcpy (prefix + len, "_clone"); | |
1743 | #ifndef NO_DOT_IN_LABEL | |
1744 | prefix[len] = '.'; | |
1745 | #elif !defined NO_DOLLAR_IN_LABEL | |
1746 | prefix[len] = '$'; | |
1747 | #endif | |
1748 | ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix, clone_fn_id_num++); | |
1749 | return get_identifier (tmp_name); | |
1750 | } | |
1751 | ||
1752 | /* Create callgraph node clone with new declaration. The actual body will | |
1753 | be copied later at compilation stage. | |
1754 | ||
1755 | TODO: after merging in ipa-sra use function call notes instead of args_to_skip | |
1756 | bitmap interface. | |
1757 | */ | |
1758 | struct cgraph_node * | |
1759 | cgraph_create_virtual_clone (struct cgraph_node *old_node, | |
1760 | VEC(cgraph_edge_p,heap) *redirect_callers, | |
1761 | VEC(ipa_replace_map_p,gc) *tree_map, | |
1762 | bitmap args_to_skip) | |
1763 | { | |
1764 | tree old_decl = old_node->decl; | |
1765 | struct cgraph_node *new_node = NULL; | |
1766 | tree new_decl; | |
1767 | struct cgraph_node key, **slot; | |
9187e02d JH |
1768 | |
1769 | gcc_assert (tree_versionable_function_p (old_decl)); | |
1770 | ||
1771 | /* Make a new FUNCTION_DECL tree node */ | |
1772 | if (!args_to_skip) | |
1773 | new_decl = copy_node (old_decl); | |
1774 | else | |
1775 | new_decl = build_function_decl_skip_args (old_decl, args_to_skip); | |
1776 | DECL_STRUCT_FUNCTION (new_decl) = NULL; | |
1777 | ||
1778 | /* Generate a new name for the new version. */ | |
1779 | DECL_NAME (new_decl) = clone_function_name (old_decl); | |
1780 | SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl)); | |
1781 | SET_DECL_RTL (new_decl, NULL); | |
1782 | ||
1783 | new_node = cgraph_clone_node (old_node, old_node->count, | |
03ec7d01 JH |
1784 | CGRAPH_FREQ_BASE, 0, false, |
1785 | redirect_callers); | |
9187e02d JH |
1786 | new_node->decl = new_decl; |
1787 | /* Update the properties. | |
1788 | Make clone visible only within this translation unit. Make sure | |
1789 | that is not weak also. | |
1790 | ??? We cannot use COMDAT linkage because there is no | |
1791 | ABI support for this. */ | |
1792 | DECL_EXTERNAL (new_node->decl) = 0; | |
fc26fae3 | 1793 | DECL_COMDAT_GROUP (new_node->decl) = 0; |
9187e02d JH |
1794 | TREE_PUBLIC (new_node->decl) = 0; |
1795 | DECL_COMDAT (new_node->decl) = 0; | |
1796 | DECL_WEAK (new_node->decl) = 0; | |
1797 | new_node->clone.tree_map = tree_map; | |
1798 | new_node->clone.args_to_skip = args_to_skip; | |
08ad1d6d JH |
1799 | if (!args_to_skip) |
1800 | new_node->clone.combined_args_to_skip = old_node->clone.combined_args_to_skip; | |
1801 | else if (old_node->clone.combined_args_to_skip) | |
1802 | { | |
1803 | int newi = 0, oldi = 0; | |
1804 | tree arg; | |
1805 | bitmap new_args_to_skip = BITMAP_GGC_ALLOC (); | |
1806 | struct cgraph_node *orig_node; | |
1807 | for (orig_node = old_node; orig_node->clone_of; orig_node = orig_node->clone_of) | |
1808 | ; | |
1809 | for (arg = DECL_ARGUMENTS (orig_node->decl); arg; arg = TREE_CHAIN (arg), oldi++) | |
1810 | { | |
1811 | if (bitmap_bit_p (old_node->clone.combined_args_to_skip, oldi)) | |
1812 | { | |
1813 | bitmap_set_bit (new_args_to_skip, oldi); | |
1814 | continue; | |
1815 | } | |
1816 | if (bitmap_bit_p (args_to_skip, newi)) | |
1817 | bitmap_set_bit (new_args_to_skip, oldi); | |
1818 | newi++; | |
1819 | } | |
1820 | new_node->clone.combined_args_to_skip = new_args_to_skip; | |
1821 | } | |
1822 | else | |
1823 | new_node->clone.combined_args_to_skip = args_to_skip; | |
9187e02d JH |
1824 | new_node->local.externally_visible = 0; |
1825 | new_node->local.local = 1; | |
1826 | new_node->lowered = true; | |
1827 | new_node->reachable = true; | |
1828 | ||
1829 | key.decl = new_decl; | |
1830 | slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, &key, INSERT); | |
1831 | gcc_assert (!*slot); | |
1832 | *slot = new_node; | |
1833 | if (assembler_name_hash) | |
1834 | { | |
1835 | void **aslot; | |
1836 | tree name = DECL_ASSEMBLER_NAME (new_decl); | |
1837 | ||
1838 | aslot = htab_find_slot_with_hash (assembler_name_hash, name, | |
1839 | decl_assembler_name_hash (name), | |
1840 | INSERT); | |
1841 | gcc_assert (!*aslot); | |
1842 | *aslot = new_node; | |
1843 | } | |
03ec7d01 | 1844 | |
9187e02d JH |
1845 | return new_node; |
1846 | } | |
1847 | ||
8f235343 JH |
1848 | /* NODE is no longer nested function; update cgraph accordingly. */ |
1849 | void | |
1850 | cgraph_unnest_node (struct cgraph_node *node) | |
1851 | { | |
1852 | struct cgraph_node **node2 = &node->origin->nested; | |
1853 | gcc_assert (node->origin); | |
1854 | ||
1855 | while (*node2 != node) | |
1856 | node2 = &(*node2)->next_nested; | |
1857 | *node2 = node->next_nested; | |
1858 | node->origin = NULL; | |
1859 | } | |
6b02a499 JH |
1860 | |
1861 | /* Return function availability. See cgraph.h for description of individual | |
1862 | return values. */ | |
1863 | enum availability | |
1864 | cgraph_function_body_availability (struct cgraph_node *node) | |
1865 | { | |
1866 | enum availability avail; | |
1867 | gcc_assert (cgraph_function_flags_ready); | |
093c2329 | 1868 | if (!node->analyzed) |
6b02a499 JH |
1869 | avail = AVAIL_NOT_AVAILABLE; |
1870 | else if (node->local.local) | |
1871 | avail = AVAIL_LOCAL; | |
d3ea650c | 1872 | else if (!node->local.externally_visible) |
6b02a499 | 1873 | avail = AVAIL_AVAILABLE; |
4a371c8d JH |
1874 | /* Inline functions are safe to be analyzed even if their sybol can |
1875 | be overwritten at runtime. It is not meaningful to enfore any sane | |
1876 | behaviour on replacing inline function by different body. */ | |
1877 | else if (DECL_DECLARED_INLINE_P (node->decl)) | |
1878 | avail = AVAIL_AVAILABLE; | |
6b02a499 JH |
1879 | |
1880 | /* If the function can be overwritten, return OVERWRITABLE. Take | |
1881 | care at least of two notable extensions - the COMDAT functions | |
1882 | used to share template instantiations in C++ (this is symmetric | |
1883 | to code cp_cannot_inline_tree_fn and probably shall be shared and | |
ff5c4582 | 1884 | the inlinability hooks completely eliminated). |
6b02a499 JH |
1885 | |
1886 | ??? Does the C++ one definition rule allow us to always return | |
1887 | AVAIL_AVAILABLE here? That would be good reason to preserve this | |
4a371c8d JH |
1888 | bit. */ |
1889 | ||
1890 | else if (DECL_REPLACEABLE_P (node->decl) && !DECL_EXTERNAL (node->decl)) | |
6b02a499 JH |
1891 | avail = AVAIL_OVERWRITABLE; |
1892 | else avail = AVAIL_AVAILABLE; | |
1893 | ||
1894 | return avail; | |
1895 | } | |
1896 | ||
f45e0ad1 JH |
1897 | /* Add the function FNDECL to the call graph. |
1898 | Unlike cgraph_finalize_function, this function is intended to be used | |
1899 | by middle end and allows insertion of new function at arbitrary point | |
1900 | of compilation. The function can be either in high, low or SSA form | |
1901 | GIMPLE. | |
50674e96 | 1902 | |
f45e0ad1 JH |
1903 | The function is assumed to be reachable and have address taken (so no |
1904 | API breaking optimizations are performed on it). | |
50674e96 | 1905 | |
f45e0ad1 JH |
1906 | Main work done by this function is to enqueue the function for later |
1907 | processing to avoid need the passes to be re-entrant. */ | |
953ff289 DN |
1908 | |
1909 | void | |
f45e0ad1 | 1910 | cgraph_add_new_function (tree fndecl, bool lowered) |
953ff289 | 1911 | { |
f45e0ad1 JH |
1912 | struct cgraph_node *node; |
1913 | switch (cgraph_state) | |
1914 | { | |
1915 | case CGRAPH_STATE_CONSTRUCTION: | |
fa10beec | 1916 | /* Just enqueue function to be processed at nearest occurrence. */ |
f45e0ad1 JH |
1917 | node = cgraph_node (fndecl); |
1918 | node->next_needed = cgraph_new_nodes; | |
1919 | if (lowered) | |
1920 | node->lowered = true; | |
1921 | cgraph_new_nodes = node; | |
1922 | break; | |
1923 | ||
1924 | case CGRAPH_STATE_IPA: | |
7a388ee4 | 1925 | case CGRAPH_STATE_IPA_SSA: |
f45e0ad1 JH |
1926 | case CGRAPH_STATE_EXPANSION: |
1927 | /* Bring the function into finalized state and enqueue for later | |
1928 | analyzing and compilation. */ | |
1929 | node = cgraph_node (fndecl); | |
1930 | node->local.local = false; | |
1931 | node->local.finalized = true; | |
1932 | node->reachable = node->needed = true; | |
ff2c88a5 JH |
1933 | if (!lowered && cgraph_state == CGRAPH_STATE_EXPANSION) |
1934 | { | |
1935 | push_cfun (DECL_STRUCT_FUNCTION (fndecl)); | |
1936 | current_function_decl = fndecl; | |
726a989a RB |
1937 | gimple_register_cfg_hooks (); |
1938 | tree_lowering_passes (fndecl); | |
ff2c88a5 JH |
1939 | bitmap_obstack_initialize (NULL); |
1940 | if (!gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl))) | |
1941 | execute_pass_list (pass_early_local_passes.pass.sub); | |
1942 | bitmap_obstack_release (NULL); | |
1943 | pop_cfun (); | |
1944 | current_function_decl = NULL; | |
1945 | ||
1946 | lowered = true; | |
1947 | } | |
f45e0ad1 JH |
1948 | if (lowered) |
1949 | node->lowered = true; | |
1950 | node->next_needed = cgraph_new_nodes; | |
1951 | cgraph_new_nodes = node; | |
1952 | break; | |
1953 | ||
1954 | case CGRAPH_STATE_FINISHED: | |
1955 | /* At the very end of compilation we have to do all the work up | |
1956 | to expansion. */ | |
1957 | push_cfun (DECL_STRUCT_FUNCTION (fndecl)); | |
1958 | current_function_decl = fndecl; | |
726a989a | 1959 | gimple_register_cfg_hooks (); |
f45e0ad1 JH |
1960 | if (!lowered) |
1961 | tree_lowering_passes (fndecl); | |
7a388ee4 | 1962 | bitmap_obstack_initialize (NULL); |
c72321c9 | 1963 | if (!gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl))) |
8ddbbcae | 1964 | execute_pass_list (pass_early_local_passes.pass.sub); |
7a388ee4 | 1965 | bitmap_obstack_release (NULL); |
f45e0ad1 JH |
1966 | tree_rest_of_compilation (fndecl); |
1967 | pop_cfun (); | |
1968 | current_function_decl = NULL; | |
1969 | break; | |
1970 | } | |
f9417da1 RG |
1971 | |
1972 | /* Set a personality if required and we already passed EH lowering. */ | |
1973 | if (lowered | |
1974 | && (function_needs_eh_personality (DECL_STRUCT_FUNCTION (fndecl)) | |
1975 | == eh_personality_lang)) | |
1976 | DECL_FUNCTION_PERSONALITY (fndecl) = lang_hooks.eh_personality (); | |
953ff289 DN |
1977 | } |
1978 | ||
a550d677 MJ |
1979 | /* Return true if NODE can be made local for API change. |
1980 | Extern inline functions and C++ COMDAT functions can be made local | |
1981 | at the expense of possible code size growth if function is used in multiple | |
1982 | compilation units. */ | |
1983 | bool | |
1984 | cgraph_node_can_be_local_p (struct cgraph_node *node) | |
1985 | { | |
3621d5ec JH |
1986 | return (!node->needed |
1987 | && (DECL_COMDAT (node->decl) || !node->local.externally_visible)); | |
a550d677 MJ |
1988 | } |
1989 | ||
1990 | /* Bring NODE local. */ | |
1991 | void | |
1992 | cgraph_make_node_local (struct cgraph_node *node) | |
1993 | { | |
1994 | gcc_assert (cgraph_node_can_be_local_p (node)); | |
1995 | if (DECL_COMDAT (node->decl) || DECL_EXTERNAL (node->decl)) | |
1996 | { | |
1997 | DECL_COMDAT (node->decl) = 0; | |
19751f1f | 1998 | DECL_COMDAT_GROUP (node->decl) = 0; |
a550d677 MJ |
1999 | TREE_PUBLIC (node->decl) = 0; |
2000 | DECL_WEAK (node->decl) = 0; | |
2001 | DECL_EXTERNAL (node->decl) = 0; | |
2002 | node->local.externally_visible = false; | |
2003 | node->local.local = true; | |
2004 | gcc_assert (cgraph_function_body_availability (node) == AVAIL_LOCAL); | |
2005 | } | |
2006 | } | |
2007 | ||
988d1653 | 2008 | #include "gt-cgraph.h" |