| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | ipa-inline-transform.cc | 255 check_speculations_1 (cgraph_node *n, vec<cgraph_edge *> *new_edges, in check_speculations_1() argument
266 while (new_edges && !new_edges->is_empty ()) in check_speculations_1()
267 edge_set->add (new_edges->pop ()); in check_speculations_1()
274 speculation_removed |= check_speculations_1 (e->callee, new_edges, in check_speculations_1()
286 vec<cgraph_edge *> *new_edges) in push_all_edges_in_set_to_vec() argument
288 new_edges->safe_push (e); in push_all_edges_in_set_to_vec()
296 check_speculations (cgraph_node *n, vec<cgraph_edge *> *new_edges) in check_speculations() argument
299 bool res = check_speculations_1 (n, new_edges, &edge_set); in check_speculations()
302 push_all_edges_in_set_to_vec> (new_edges); in check_speculations()
336 vec<cgraph_edge *> *new_edges, in inline_call() argument
[all …]
|
| H A D | cfghooks.cc | 1357 edge *edges, unsigned num_edges, edge *new_edges, in copy_bbs() argument
1423 new_edges[j] = NULL; in copy_bbs()
1432 new_edges[j] = find_edge (src, dest); in copy_bbs()
|
| H A D | ipa-inline.cc | 1646 vec<cgraph_edge *> *new_edges) in recursive_inlining() argument
1746 inline_call (curr, false, new_edges, &overall_size, true); in recursive_inlining()
1800 add_new_edges_to_heap (edge_heap_t *heap, vec<cgraph_edge *> &new_edges) in add_new_edges_to_heap() argument
1802 while (new_edges.length () > 0) in add_new_edges_to_heap()
1804 struct cgraph_edge *edge = new_edges.pop (); in add_new_edges_to_heap()
|
| H A D | ipa-prop.cc | 3964 vec<cgraph_edge *> *new_edges) in update_indirect_edges_after_inlining() argument
4038 if (new_edges) in update_indirect_edges_after_inlining()
4040 new_edges->safe_push (new_direct_edge); in update_indirect_edges_after_inlining()
4107 vec<cgraph_edge *> *new_edges) in propagate_info_to_inlined_callees() argument
4112 res = update_indirect_edges_after_inlining (cs, node, new_edges); in propagate_info_to_inlined_callees()
4116 res |= propagate_info_to_inlined_callees (cs, e->callee, new_edges); in propagate_info_to_inlined_callees()
4284 vec<cgraph_edge *> *new_edges) in ipa_propagate_indirect_call_infos() argument
4294 changed = propagate_info_to_inlined_callees (cs, cs->callee, new_edges); in ipa_propagate_indirect_call_infos()
|
| H A D | ipa-prop.h | 1154 vec<cgraph_edge *> *new_edges);
|
| H A D | ChangeLog-2008 | 5976 * ipa-inline.c (cgraph_mark_inline_edge): New parameter new_edges,
5982 ipa_propagate_indirect_call_infos, pass new_edges to
5985 ipa_propagate_indirect_call_infos, pass new_edges to
6244 to *new_edges instead of new_edges. Reread IPA_EDGE_REF after
12950 pass a new parameter new_edges to it.
|
| H A D | ChangeLog-2019 | 19829 new_edges.
19830 (inline_call): Pass new_edges to check_speculations.
|
| H A D | ChangeLog-2020 | 8723 * cfghooks.c (copy_bbs): Split out loop computing new_edges.
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | ipa-inline-transform.c | 246 check_speculations_1 (cgraph_node *n, vec<cgraph_edge *> *new_edges, in check_speculations_1() argument
257 while (new_edges && !new_edges->is_empty ()) in check_speculations_1()
258 edge_set->add (new_edges->pop ()); in check_speculations_1()
265 speculation_removed |= check_speculations_1 (e->callee, new_edges, in check_speculations_1()
277 vec<cgraph_edge *> *new_edges) in push_all_edges_in_set_to_vec() argument
279 new_edges->safe_push (e); in push_all_edges_in_set_to_vec()
287 check_speculations (cgraph_node *n, vec<cgraph_edge *> *new_edges) in check_speculations() argument
290 bool res = check_speculations_1 (n, new_edges, &edge_set); in check_speculations()
293 push_all_edges_in_set_to_vec> (new_edges); in check_speculations()
327 vec<cgraph_edge *> *new_edges, in inline_call() argument
[all …]
|
| H A D | cfghooks.c | 1338 edge *edges, unsigned num_edges, edge *new_edges, in copy_bbs() argument
1389 new_edges[j] = NULL; in copy_bbs()
1400 new_edges[j] = e; in copy_bbs()
|
| H A D | ipa-inline.c | 1586 vec<cgraph_edge *> *new_edges) in recursive_inlining() argument
1686 inline_call (curr, false, new_edges, &overall_size, true); in recursive_inlining()
1740 add_new_edges_to_heap (edge_heap_t *heap, vec<cgraph_edge *> new_edges) in add_new_edges_to_heap() argument
1742 while (new_edges.length () > 0) in add_new_edges_to_heap()
1744 struct cgraph_edge *edge = new_edges.pop (); in add_new_edges_to_heap()
|
| H A D | ipa-prop.c | 3767 vec<cgraph_edge *> *new_edges) in update_indirect_edges_after_inlining() argument
3842 if (new_edges) in update_indirect_edges_after_inlining()
3844 new_edges->safe_push (new_direct_edge); in update_indirect_edges_after_inlining()
3912 vec<cgraph_edge *> *new_edges) in propagate_info_to_inlined_callees() argument
3917 res = update_indirect_edges_after_inlining (cs, node, new_edges); in propagate_info_to_inlined_callees()
3921 res |= propagate_info_to_inlined_callees (cs, e->callee, new_edges); in propagate_info_to_inlined_callees()
4069 vec<cgraph_edge *> *new_edges) in ipa_propagate_indirect_call_infos() argument
4079 changed = propagate_info_to_inlined_callees (cs, cs->callee, new_edges); in ipa_propagate_indirect_call_infos()
|
| H A D | ipa-prop.h | 984 vec<cgraph_edge *> *new_edges);
|
| H A D | hsa-gen.c | 6322 auto_vec <edge> new_edges; in convert_switch_statements() local
6422 new_edges.safe_push (new_edge); in convert_switch_statements()
6445 new_edges.safe_insert (0, e); in convert_switch_statements()
6453 edge new_edge = new_edges[phi_def->label_index]; in convert_switch_statements()
|