Home
last modified time | relevance | path

Searched refs:next_callee (Results 1 – 12 of 12) sorted by relevance

/trueos/contrib/gcc/
HDcgraph.c328 for (e = node->callees; e; e= e->next_callee) in cgraph_edge()
337 for (e2 = node->callees; e2; e2 = e2->next_callee) in cgraph_edge()
384 for (e = caller->callees; e; e = e->next_callee) in cgraph_create_edge()
410 edge->next_callee = caller->callees; in cgraph_create_edge()
450 e->prev_callee->next_callee = e->next_callee; in cgraph_edge_remove_caller()
451 if (e->next_callee) in cgraph_edge_remove_caller()
452 e->next_callee->prev_callee = e->prev_callee; in cgraph_edge_remove_caller()
454 e->caller->callees = e->next_callee; in cgraph_edge_remove_caller()
501 for (e = node->callees; e; e = e->next_callee) in cgraph_node_remove_callees()
757 for (edge = node->callees; edge; edge = edge->next_callee) in dump_cgraph_node()
[all …]
HDipa-inline.c146 for (e = e->callee->callees; e; e = e->next_callee) in cgraph_clone_inlined_nodes()
264 for (e = to->callees; e; e = e->next_callee) in cgraph_check_inline_limits()
478 for (e = node->callees; e; e = e->next_callee) in update_callee_keys()
494 for (e = where->callees; e; e = e->next_callee) in lookup_recursive_calls()
505 for (e = where->callees; e; e = e->next_callee) in lookup_recursive_calls()
534 for (e = node->callees; e; e = e->next_callee) in cgraph_find_cycles()
549 for (e = node->callees; e; e = e->next_callee) in cgraph_flatten_node()
610 for (e = master_clone->callees; e; e = e->next_callee) in cgraph_decide_recursive_inlining()
922 for (e = node->callees; e; e = e->next_callee) in cgraph_decide_inlining()
1091 for (e = node->callees; e; e = e->next_callee) in cgraph_decide_inlining_incrementally()
[all …]
HDtree-optimize.c385 for (e = node->callees; e; e = e->next_callee) in update_inlined_to_pointers()
432 for (e = node->callees; e; e = e->next_callee) in tree_rest_of_compilation()
447 for (e = node->callees; e; e = e->next_callee) in tree_rest_of_compilation()
HDcgraphunit.c718 for (e = node->callees; e; e = e->next_callee) in verify_cgraph_node()
833 for (e = node->callees; e; e = e->next_callee) in verify_cgraph_node()
1139 for (edge = node->callees; edge; edge = edge->next_callee) in cgraph_finalize_compilation_unit()
1793 struct cgraph_edge *next_callee; in cgraph_copy_node_for_versioning() local
1809 for (e = old_version->callees;e; e=e->next_callee) in cgraph_copy_node_for_versioning()
1819 for (e = new_version->callees ; e; e = next_callee) in cgraph_copy_node_for_versioning()
1821 next_callee = e->next_callee; in cgraph_copy_node_for_versioning()
1825 if (!next_callee) in cgraph_copy_node_for_versioning()
1914 for (e = first_clone->callees; e; e = e->next_callee) in save_inline_function_body()
HDipa-cp.c530 for (cs = node->callees; cs; cs = cs->next_callee) in ipcp_init_stage()
591 for (cs = mt->callees; cs; cs = cs->next_callee) in ipcp_propagate_stage()
649 for (cs = node->callees; cs; cs = cs->next_callee) in ipcp_callsite_param_print()
718 for (cs = node->callees; cs; cs = cs->next_callee) in ipcp_profile_cs_count_print()
930 for (cs = node->callees; cs; cs = cs->next_callee) in ipcp_update_callgraph()
988 for (cs = node->callees; cs; cs = cs->next_callee) in ipcp_update_profiling()
990 for (cs = orig_node->callees; cs; cs = cs->next_callee) in ipcp_update_profiling()
HDipa-prop.c539 for (cs = node->callees; cs; cs = cs->next_callee) in ipa_edges_create()
564 for (cs = node->callees; cs; cs = cs->next_callee) in ipa_edges_free()
588 for (cs = node->callees; cs; cs = cs->next_callee) in ipa_free()
HDipa.c134 for (e = node->callees; e; e = e->next_callee) in cgraph_remove_unreachable_nodes()
HDipa-utils.c101 for (edge = v->callees; edge; edge = edge->next_callee) in searchc()
HDcgraph.h182 struct cgraph_edge *next_callee; member
HDipa-reference.c619 for (e = x->callees; e; e = e->next_callee) in propagate_bits()
700 for (e = x->callees; e; e = e->next_callee) in merge_callee_local_info()
HDipa-pure-const.c680 for (e = w->callees; e; e = e->next_callee) in static_execute()
HDtree-inline.c2269 for (e = id.dst_node->callees; e; e = e->next_callee) in optimize_inline_calls()