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