]>
Commit | Line | Data |
---|---|---|
2dee695b | 1 | /* Callgraph construction. |
d1e082c2 | 2 | Copyright (C) 2003-2013 Free Software Foundation, Inc. |
2dee695b JH |
3 | Contributed by Jan Hubicka |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 9 | Software Foundation; either version 3, or (at your option) any later |
2dee695b JH |
10 | version. |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
2dee695b JH |
20 | |
21 | #include "config.h" | |
22 | #include "system.h" | |
23 | #include "coretypes.h" | |
24 | #include "tm.h" | |
25 | #include "tree.h" | |
2fb9a547 AM |
26 | #include "pointer-set.h" |
27 | #include "basic-block.h" | |
28 | #include "tree-ssa-alias.h" | |
29 | #include "internal-fn.h" | |
30 | #include "gimple-fold.h" | |
31 | #include "gimple-expr.h" | |
32 | #include "is-a.h" | |
8e9055ae | 33 | #include "gimple.h" |
5be5c238 AM |
34 | #include "gimple-iterator.h" |
35 | #include "gimple-walk.h" | |
2dee695b | 36 | #include "langhooks.h" |
2dee695b | 37 | #include "intl.h" |
2dee695b | 38 | #include "tree-pass.h" |
85912441 | 39 | #include "ipa-utils.h" |
de61f467 | 40 | #include "except.h" |
e7f23018 | 41 | #include "ipa-inline.h" |
85912441 JH |
42 | |
43 | /* Context of record_reference. */ | |
44 | struct record_reference_ctx | |
45 | { | |
46 | bool only_vars; | |
369451ec | 47 | struct varpool_node *varpool_node; |
85912441 | 48 | }; |
2dee695b JH |
49 | |
50 | /* Walk tree and record all calls and references to functions/variables. | |
b8698a0f | 51 | Called via walk_tree: TP is pointer to tree to be examined. |
625f802c JH |
52 | When DATA is non-null, record references to callgraph. |
53 | */ | |
2dee695b JH |
54 | |
55 | static tree | |
625f802c | 56 | record_reference (tree *tp, int *walk_subtrees, void *data) |
2dee695b JH |
57 | { |
58 | tree t = *tp; | |
7e8b322a | 59 | tree decl; |
85912441 | 60 | struct record_reference_ctx *ctx = (struct record_reference_ctx *)data; |
2dee695b | 61 | |
c44c2088 | 62 | t = canonicalize_constructor_val (t, NULL); |
0038d4e0 MM |
63 | if (!t) |
64 | t = *tp; | |
65 | else if (t != *tp) | |
66 | *tp = t; | |
67 | ||
2dee695b JH |
68 | switch (TREE_CODE (t)) |
69 | { | |
70 | case VAR_DECL: | |
85912441 JH |
71 | case FUNCTION_DECL: |
72 | gcc_unreachable (); | |
2dee695b JH |
73 | break; |
74 | ||
75 | case FDESC_EXPR: | |
76 | case ADDR_EXPR: | |
7e8b322a JH |
77 | /* Record dereferences to the functions. This makes the |
78 | functions reachable unconditionally. */ | |
85912441 | 79 | decl = get_base_var (*tp); |
369451ec JH |
80 | if (TREE_CODE (decl) == FUNCTION_DECL) |
81 | { | |
6f99e449 | 82 | struct cgraph_node *node = cgraph_get_create_node (decl); |
369451ec | 83 | if (!ctx->only_vars) |
a358e188 | 84 | cgraph_mark_address_taken_node (node); |
67348ccc DM |
85 | ipa_record_reference (ctx->varpool_node, |
86 | node, | |
369451ec JH |
87 | IPA_REF_ADDR, NULL); |
88 | } | |
85912441 JH |
89 | |
90 | if (TREE_CODE (decl) == VAR_DECL) | |
91 | { | |
5d59b5e1 | 92 | struct varpool_node *vnode = varpool_node_for_decl (decl); |
67348ccc DM |
93 | ipa_record_reference (ctx->varpool_node, |
94 | vnode, | |
369451ec | 95 | IPA_REF_ADDR, NULL); |
85912441 JH |
96 | } |
97 | *walk_subtrees = 0; | |
2dee695b JH |
98 | break; |
99 | ||
100 | default: | |
101 | /* Save some cycles by not walking types and declaration as we | |
102 | won't find anything useful there anyway. */ | |
103 | if (IS_TYPE_OR_DECL_P (*tp)) | |
104 | { | |
105 | *walk_subtrees = 0; | |
106 | break; | |
107 | } | |
2dee695b JH |
108 | break; |
109 | } | |
110 | ||
111 | return NULL_TREE; | |
112 | } | |
113 | ||
de61f467 JH |
114 | /* Record references to typeinfos in the type list LIST. */ |
115 | ||
116 | static void | |
117 | record_type_list (struct cgraph_node *node, tree list) | |
118 | { | |
119 | for (; list; list = TREE_CHAIN (list)) | |
120 | { | |
121 | tree type = TREE_VALUE (list); | |
122 | ||
123 | if (TYPE_P (type)) | |
124 | type = lookup_type_for_runtime (type); | |
125 | STRIP_NOPS (type); | |
126 | if (TREE_CODE (type) == ADDR_EXPR) | |
127 | { | |
128 | type = TREE_OPERAND (type, 0); | |
129 | if (TREE_CODE (type) == VAR_DECL) | |
130 | { | |
5d59b5e1 | 131 | struct varpool_node *vnode = varpool_node_for_decl (type); |
67348ccc DM |
132 | ipa_record_reference (node, |
133 | vnode, | |
de61f467 JH |
134 | IPA_REF_ADDR, NULL); |
135 | } | |
136 | } | |
137 | } | |
138 | } | |
139 | ||
140 | /* Record all references we will introduce by producing EH tables | |
141 | for NODE. */ | |
142 | ||
143 | static void | |
144 | record_eh_tables (struct cgraph_node *node, struct function *fun) | |
145 | { | |
146 | eh_region i; | |
147 | ||
67348ccc | 148 | if (DECL_FUNCTION_PERSONALITY (node->decl)) |
9cf4fb5a | 149 | { |
6f99e449 MJ |
150 | tree per_decl = DECL_FUNCTION_PERSONALITY (node->decl); |
151 | struct cgraph_node *per_node = cgraph_get_create_node (per_decl); | |
9cf4fb5a | 152 | |
67348ccc | 153 | ipa_record_reference (node, per_node, IPA_REF_ADDR, NULL); |
9cf4fb5a JH |
154 | cgraph_mark_address_taken_node (per_node); |
155 | } | |
21d6a1c7 | 156 | |
de61f467 JH |
157 | i = fun->eh->region_tree; |
158 | if (!i) | |
159 | return; | |
160 | ||
161 | while (1) | |
162 | { | |
163 | switch (i->type) | |
164 | { | |
165 | case ERT_CLEANUP: | |
166 | case ERT_MUST_NOT_THROW: | |
167 | break; | |
168 | ||
169 | case ERT_TRY: | |
170 | { | |
171 | eh_catch c; | |
172 | for (c = i->u.eh_try.first_catch; c; c = c->next_catch) | |
173 | record_type_list (node, c->type_list); | |
174 | } | |
175 | break; | |
176 | ||
177 | case ERT_ALLOWED_EXCEPTIONS: | |
178 | record_type_list (node, i->u.allowed.type_list); | |
179 | break; | |
180 | } | |
181 | /* If there are sub-regions, process them. */ | |
182 | if (i->inner) | |
183 | i = i->inner; | |
184 | /* If there are peers, process them. */ | |
185 | else if (i->next_peer) | |
186 | i = i->next_peer; | |
187 | /* Otherwise, step back up the tree to the next peer. */ | |
188 | else | |
189 | { | |
190 | do | |
191 | { | |
192 | i = i->outer; | |
193 | if (i == NULL) | |
194 | return; | |
195 | } | |
196 | while (i->next_peer == NULL); | |
197 | i = i->next_peer; | |
198 | } | |
199 | } | |
200 | } | |
201 | ||
3e293154 MJ |
202 | /* Computes the frequency of the call statement so that it can be stored in |
203 | cgraph_edge. BB is the basic block of the call statement. */ | |
204 | int | |
9187e02d | 205 | compute_call_stmt_bb_frequency (tree decl, basic_block bb) |
3e293154 | 206 | { |
fefa31b5 | 207 | int entry_freq = ENTRY_BLOCK_PTR_FOR_FN |
0d63a740 | 208 | (DECL_STRUCT_FUNCTION (decl))->frequency; |
c0ee0021 | 209 | int freq = bb->frequency; |
3e293154 | 210 | |
9187e02d JH |
211 | if (profile_status_for_function (DECL_STRUCT_FUNCTION (decl)) == PROFILE_ABSENT) |
212 | return CGRAPH_FREQ_BASE; | |
213 | ||
3e293154 | 214 | if (!entry_freq) |
c0ee0021 | 215 | entry_freq = 1, freq++; |
3e293154 | 216 | |
c0ee0021 | 217 | freq = freq * CGRAPH_FREQ_BASE / entry_freq; |
3e293154 MJ |
218 | if (freq > CGRAPH_FREQ_MAX) |
219 | freq = CGRAPH_FREQ_MAX; | |
220 | ||
221 | return freq; | |
222 | } | |
223 | ||
85912441 JH |
224 | /* Mark address taken in STMT. */ |
225 | ||
226 | static bool | |
3ebb5ca6 | 227 | mark_address (gimple stmt, tree addr, void *data) |
85912441 | 228 | { |
e9615971 | 229 | addr = get_base_address (addr); |
85912441 JH |
230 | if (TREE_CODE (addr) == FUNCTION_DECL) |
231 | { | |
6f99e449 | 232 | struct cgraph_node *node = cgraph_get_create_node (addr); |
85912441 | 233 | cgraph_mark_address_taken_node (node); |
5e20cdc9 | 234 | ipa_record_reference ((symtab_node *)data, |
67348ccc | 235 | node, |
369451ec | 236 | IPA_REF_ADDR, stmt); |
85912441 | 237 | } |
e9615971 RG |
238 | else if (addr && TREE_CODE (addr) == VAR_DECL |
239 | && (TREE_STATIC (addr) || DECL_EXTERNAL (addr))) | |
85912441 | 240 | { |
5d59b5e1 | 241 | struct varpool_node *vnode = varpool_node_for_decl (addr); |
85912441 | 242 | |
5e20cdc9 | 243 | ipa_record_reference ((symtab_node *)data, |
67348ccc | 244 | vnode, |
e9615971 | 245 | IPA_REF_ADDR, stmt); |
85912441 JH |
246 | } |
247 | ||
248 | return false; | |
249 | } | |
250 | ||
251 | /* Mark load of T. */ | |
252 | ||
253 | static bool | |
3ebb5ca6 | 254 | mark_load (gimple stmt, tree t, void *data) |
85912441 JH |
255 | { |
256 | t = get_base_address (t); | |
3ebb5ca6 EB |
257 | if (t && TREE_CODE (t) == FUNCTION_DECL) |
258 | { | |
259 | /* ??? This can happen on platforms with descriptors when these are | |
260 | directly manipulated in the code. Pretend that it's an address. */ | |
6f99e449 | 261 | struct cgraph_node *node = cgraph_get_create_node (t); |
3ebb5ca6 | 262 | cgraph_mark_address_taken_node (node); |
5e20cdc9 | 263 | ipa_record_reference ((symtab_node *)data, |
67348ccc | 264 | node, |
3ebb5ca6 EB |
265 | IPA_REF_ADDR, stmt); |
266 | } | |
267 | else if (t && TREE_CODE (t) == VAR_DECL | |
268 | && (TREE_STATIC (t) || DECL_EXTERNAL (t))) | |
85912441 | 269 | { |
5d59b5e1 | 270 | struct varpool_node *vnode = varpool_node_for_decl (t); |
85912441 | 271 | |
5e20cdc9 | 272 | ipa_record_reference ((symtab_node *)data, |
67348ccc | 273 | vnode, |
369451ec | 274 | IPA_REF_LOAD, stmt); |
85912441 JH |
275 | } |
276 | return false; | |
277 | } | |
278 | ||
279 | /* Mark store of T. */ | |
280 | ||
281 | static bool | |
3ebb5ca6 | 282 | mark_store (gimple stmt, tree t, void *data) |
85912441 JH |
283 | { |
284 | t = get_base_address (t); | |
70f34814 | 285 | if (t && TREE_CODE (t) == VAR_DECL |
85912441 JH |
286 | && (TREE_STATIC (t) || DECL_EXTERNAL (t))) |
287 | { | |
5d59b5e1 | 288 | struct varpool_node *vnode = varpool_node_for_decl (t); |
85912441 | 289 | |
5e20cdc9 | 290 | ipa_record_reference ((symtab_node *)data, |
67348ccc | 291 | vnode, |
3ebb5ca6 | 292 | IPA_REF_STORE, stmt); |
85912441 JH |
293 | } |
294 | return false; | |
295 | } | |
296 | ||
82338059 MJ |
297 | /* Record all references from NODE that are taken in statement STMT. */ |
298 | void | |
299 | ipa_record_stmt_references (struct cgraph_node *node, gimple stmt) | |
300 | { | |
301 | walk_stmt_load_store_addr_ops (stmt, node, mark_load, mark_store, | |
302 | mark_address); | |
303 | } | |
304 | ||
2dee695b JH |
305 | /* Create cgraph edges for function calls. |
306 | Also look for functions and variables having addresses taken. */ | |
307 | ||
308 | static unsigned int | |
309 | build_cgraph_edges (void) | |
310 | { | |
311 | basic_block bb; | |
581985d7 | 312 | struct cgraph_node *node = cgraph_get_node (current_function_decl); |
2dee695b | 313 | struct pointer_set_t *visited_nodes = pointer_set_create (); |
726a989a | 314 | gimple_stmt_iterator gsi; |
c021f10b NF |
315 | tree decl; |
316 | unsigned ix; | |
2dee695b JH |
317 | |
318 | /* Create the callgraph edges and record the nodes referenced by the function. | |
319 | body. */ | |
320 | FOR_EACH_BB (bb) | |
85912441 JH |
321 | { |
322 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
323 | { | |
324 | gimple stmt = gsi_stmt (gsi); | |
325 | tree decl; | |
326 | ||
71cafea9 JH |
327 | if (is_gimple_debug (stmt)) |
328 | continue; | |
329 | ||
5f902d76 JH |
330 | if (is_gimple_call (stmt)) |
331 | { | |
332 | int freq = compute_call_stmt_bb_frequency (current_function_decl, | |
333 | bb); | |
334 | decl = gimple_call_fndecl (stmt); | |
335 | if (decl) | |
a358e188 | 336 | cgraph_create_edge (node, cgraph_get_create_node (decl), |
898b8927 | 337 | stmt, bb->count, freq); |
5f902d76 JH |
338 | else |
339 | cgraph_create_indirect_edge (node, stmt, | |
340 | gimple_call_flags (stmt), | |
898b8927 | 341 | bb->count, freq); |
5f902d76 | 342 | } |
82338059 | 343 | ipa_record_stmt_references (node, stmt); |
85912441 JH |
344 | if (gimple_code (stmt) == GIMPLE_OMP_PARALLEL |
345 | && gimple_omp_parallel_child_fn (stmt)) | |
346 | { | |
347 | tree fn = gimple_omp_parallel_child_fn (stmt); | |
67348ccc | 348 | ipa_record_reference (node, |
6f99e449 | 349 | cgraph_get_create_node (fn), |
5932a4d4 | 350 | IPA_REF_ADDR, stmt); |
85912441 JH |
351 | } |
352 | if (gimple_code (stmt) == GIMPLE_OMP_TASK) | |
353 | { | |
354 | tree fn = gimple_omp_task_child_fn (stmt); | |
355 | if (fn) | |
67348ccc | 356 | ipa_record_reference (node, |
6f99e449 | 357 | cgraph_get_create_node (fn), |
5932a4d4 | 358 | IPA_REF_ADDR, stmt); |
85912441 JH |
359 | fn = gimple_omp_task_copy_fn (stmt); |
360 | if (fn) | |
67348ccc | 361 | ipa_record_reference (node, |
6f99e449 | 362 | cgraph_get_create_node (fn), |
5932a4d4 | 363 | IPA_REF_ADDR, stmt); |
85912441 JH |
364 | } |
365 | } | |
355a7673 | 366 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
82338059 | 367 | ipa_record_stmt_references (node, gsi_stmt (gsi)); |
85912441 | 368 | } |
2dee695b JH |
369 | |
370 | /* Look for initializers of constant variables and private statics. */ | |
c021f10b NF |
371 | FOR_EACH_LOCAL_DECL (cfun, ix, decl) |
372 | if (TREE_CODE (decl) == VAR_DECL | |
0d6bf48c JH |
373 | && (TREE_STATIC (decl) && !DECL_EXTERNAL (decl)) |
374 | && !DECL_HAS_VALUE_EXPR_P (decl)) | |
c021f10b | 375 | varpool_finalize_decl (decl); |
de61f467 | 376 | record_eh_tables (node, cfun); |
2dee695b JH |
377 | |
378 | pointer_set_destroy (visited_nodes); | |
2dee695b JH |
379 | return 0; |
380 | } | |
381 | ||
27a4cd48 DM |
382 | namespace { |
383 | ||
384 | const pass_data pass_data_build_cgraph_edges = | |
2dee695b | 385 | { |
27a4cd48 DM |
386 | GIMPLE_PASS, /* type */ |
387 | "*build_cgraph_edges", /* name */ | |
388 | OPTGROUP_NONE, /* optinfo_flags */ | |
389 | false, /* has_gate */ | |
390 | true, /* has_execute */ | |
391 | TV_NONE, /* tv_id */ | |
392 | PROP_cfg, /* properties_required */ | |
393 | 0, /* properties_provided */ | |
394 | 0, /* properties_destroyed */ | |
395 | 0, /* todo_flags_start */ | |
396 | 0, /* todo_flags_finish */ | |
2dee695b JH |
397 | }; |
398 | ||
27a4cd48 DM |
399 | class pass_build_cgraph_edges : public gimple_opt_pass |
400 | { | |
401 | public: | |
c3284718 RS |
402 | pass_build_cgraph_edges (gcc::context *ctxt) |
403 | : gimple_opt_pass (pass_data_build_cgraph_edges, ctxt) | |
27a4cd48 DM |
404 | {} |
405 | ||
406 | /* opt_pass methods: */ | |
407 | unsigned int execute () { return build_cgraph_edges (); } | |
408 | ||
409 | }; // class pass_build_cgraph_edges | |
410 | ||
411 | } // anon namespace | |
412 | ||
413 | gimple_opt_pass * | |
414 | make_pass_build_cgraph_edges (gcc::context *ctxt) | |
415 | { | |
416 | return new pass_build_cgraph_edges (ctxt); | |
417 | } | |
418 | ||
2dee695b | 419 | /* Record references to functions and other variables present in the |
b8698a0f | 420 | initial value of DECL, a variable. |
625f802c | 421 | When ONLY_VARS is true, we mark needed only variables, not functions. */ |
2dee695b JH |
422 | |
423 | void | |
625f802c | 424 | record_references_in_initializer (tree decl, bool only_vars) |
2dee695b JH |
425 | { |
426 | struct pointer_set_t *visited_nodes = pointer_set_create (); | |
5d59b5e1 | 427 | struct varpool_node *node = varpool_node_for_decl (decl); |
369451ec | 428 | struct record_reference_ctx ctx = {false, NULL}; |
85912441 | 429 | |
369451ec | 430 | ctx.varpool_node = node; |
85912441 | 431 | ctx.only_vars = only_vars; |
b8698a0f | 432 | walk_tree (&DECL_INITIAL (decl), record_reference, |
85912441 | 433 | &ctx, visited_nodes); |
2dee695b JH |
434 | pointer_set_destroy (visited_nodes); |
435 | } | |
436 | ||
437 | /* Rebuild cgraph edges for current function node. This needs to be run after | |
438 | passes that don't update the cgraph. */ | |
439 | ||
917948d3 | 440 | unsigned int |
2dee695b JH |
441 | rebuild_cgraph_edges (void) |
442 | { | |
443 | basic_block bb; | |
581985d7 | 444 | struct cgraph_node *node = cgraph_get_node (current_function_decl); |
726a989a | 445 | gimple_stmt_iterator gsi; |
2dee695b JH |
446 | |
447 | cgraph_node_remove_callees (node); | |
67348ccc | 448 | ipa_remove_all_references (&node->ref_list); |
2dee695b | 449 | |
fefa31b5 | 450 | node->count = ENTRY_BLOCK_PTR_FOR_FN (cfun)->count; |
2dee695b JH |
451 | |
452 | FOR_EACH_BB (bb) | |
85912441 JH |
453 | { |
454 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
455 | { | |
456 | gimple stmt = gsi_stmt (gsi); | |
457 | tree decl; | |
458 | ||
5f902d76 JH |
459 | if (is_gimple_call (stmt)) |
460 | { | |
461 | int freq = compute_call_stmt_bb_frequency (current_function_decl, | |
462 | bb); | |
463 | decl = gimple_call_fndecl (stmt); | |
464 | if (decl) | |
a358e188 | 465 | cgraph_create_edge (node, cgraph_get_create_node (decl), stmt, |
898b8927 | 466 | bb->count, freq); |
5f902d76 JH |
467 | else |
468 | cgraph_create_indirect_edge (node, stmt, | |
469 | gimple_call_flags (stmt), | |
898b8927 | 470 | bb->count, freq); |
5f902d76 | 471 | } |
82338059 | 472 | ipa_record_stmt_references (node, stmt); |
85912441 | 473 | } |
355a7673 | 474 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
82338059 | 475 | ipa_record_stmt_references (node, gsi_stmt (gsi)); |
85912441 | 476 | } |
de61f467 | 477 | record_eh_tables (node, cfun); |
2dee695b | 478 | gcc_assert (!node->global.inlined_to); |
3dc9eaa6 | 479 | |
2dee695b JH |
480 | return 0; |
481 | } | |
482 | ||
99b766fc JH |
483 | /* Rebuild cgraph edges for current function node. This needs to be run after |
484 | passes that don't update the cgraph. */ | |
485 | ||
486 | void | |
487 | cgraph_rebuild_references (void) | |
488 | { | |
489 | basic_block bb; | |
581985d7 | 490 | struct cgraph_node *node = cgraph_get_node (current_function_decl); |
99b766fc | 491 | gimple_stmt_iterator gsi; |
042ae7d2 JH |
492 | struct ipa_ref *ref; |
493 | int i; | |
494 | ||
495 | /* Keep speculative references for further cgraph edge expansion. */ | |
67348ccc | 496 | for (i = 0; ipa_ref_list_reference_iterate (&node->ref_list, i, ref);) |
042ae7d2 JH |
497 | if (!ref->speculative) |
498 | ipa_remove_reference (ref); | |
499 | else | |
500 | i++; | |
99b766fc | 501 | |
fefa31b5 | 502 | node->count = ENTRY_BLOCK_PTR_FOR_FN (cfun)->count; |
99b766fc JH |
503 | |
504 | FOR_EACH_BB (bb) | |
505 | { | |
506 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
82338059 | 507 | ipa_record_stmt_references (node, gsi_stmt (gsi)); |
355a7673 | 508 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
82338059 | 509 | ipa_record_stmt_references (node, gsi_stmt (gsi)); |
99b766fc JH |
510 | } |
511 | record_eh_tables (node, cfun); | |
512 | } | |
513 | ||
27a4cd48 DM |
514 | namespace { |
515 | ||
516 | const pass_data pass_data_rebuild_cgraph_edges = | |
2dee695b | 517 | { |
27a4cd48 DM |
518 | GIMPLE_PASS, /* type */ |
519 | "*rebuild_cgraph_edges", /* name */ | |
520 | OPTGROUP_NONE, /* optinfo_flags */ | |
521 | false, /* has_gate */ | |
522 | true, /* has_execute */ | |
523 | TV_CGRAPH, /* tv_id */ | |
524 | PROP_cfg, /* properties_required */ | |
525 | 0, /* properties_provided */ | |
526 | 0, /* properties_destroyed */ | |
527 | 0, /* todo_flags_start */ | |
528 | 0, /* todo_flags_finish */ | |
2dee695b | 529 | }; |
133f9369 | 530 | |
27a4cd48 DM |
531 | class pass_rebuild_cgraph_edges : public gimple_opt_pass |
532 | { | |
533 | public: | |
c3284718 RS |
534 | pass_rebuild_cgraph_edges (gcc::context *ctxt) |
535 | : gimple_opt_pass (pass_data_rebuild_cgraph_edges, ctxt) | |
27a4cd48 DM |
536 | {} |
537 | ||
538 | /* opt_pass methods: */ | |
65d3284b | 539 | opt_pass * clone () { return new pass_rebuild_cgraph_edges (m_ctxt); } |
27a4cd48 DM |
540 | unsigned int execute () { return rebuild_cgraph_edges (); } |
541 | ||
542 | }; // class pass_rebuild_cgraph_edges | |
543 | ||
544 | } // anon namespace | |
545 | ||
546 | gimple_opt_pass * | |
547 | make_pass_rebuild_cgraph_edges (gcc::context *ctxt) | |
548 | { | |
549 | return new pass_rebuild_cgraph_edges (ctxt); | |
550 | } | |
551 | ||
133f9369 MJ |
552 | |
553 | static unsigned int | |
554 | remove_cgraph_callee_edges (void) | |
555 | { | |
71cafea9 JH |
556 | struct cgraph_node *node = cgraph_get_node (current_function_decl); |
557 | cgraph_node_remove_callees (node); | |
67348ccc | 558 | ipa_remove_all_references (&node->ref_list); |
133f9369 MJ |
559 | return 0; |
560 | } | |
561 | ||
27a4cd48 DM |
562 | namespace { |
563 | ||
564 | const pass_data pass_data_remove_cgraph_callee_edges = | |
133f9369 | 565 | { |
27a4cd48 DM |
566 | GIMPLE_PASS, /* type */ |
567 | "*remove_cgraph_callee_edges", /* name */ | |
568 | OPTGROUP_NONE, /* optinfo_flags */ | |
569 | false, /* has_gate */ | |
570 | true, /* has_execute */ | |
571 | TV_NONE, /* tv_id */ | |
572 | 0, /* properties_required */ | |
573 | 0, /* properties_provided */ | |
574 | 0, /* properties_destroyed */ | |
575 | 0, /* todo_flags_start */ | |
576 | 0, /* todo_flags_finish */ | |
133f9369 | 577 | }; |
27a4cd48 DM |
578 | |
579 | class pass_remove_cgraph_callee_edges : public gimple_opt_pass | |
580 | { | |
581 | public: | |
c3284718 RS |
582 | pass_remove_cgraph_callee_edges (gcc::context *ctxt) |
583 | : gimple_opt_pass (pass_data_remove_cgraph_callee_edges, ctxt) | |
27a4cd48 DM |
584 | {} |
585 | ||
586 | /* opt_pass methods: */ | |
587 | opt_pass * clone () { | |
65d3284b | 588 | return new pass_remove_cgraph_callee_edges (m_ctxt); |
27a4cd48 DM |
589 | } |
590 | unsigned int execute () { return remove_cgraph_callee_edges (); } | |
591 | ||
592 | }; // class pass_remove_cgraph_callee_edges | |
593 | ||
594 | } // anon namespace | |
595 | ||
596 | gimple_opt_pass * | |
597 | make_pass_remove_cgraph_callee_edges (gcc::context *ctxt) | |
598 | { | |
599 | return new pass_remove_cgraph_callee_edges (ctxt); | |
600 | } |