Searched refs:callees (Results 1 – 17 of 17) sorted by relevance
328 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()411 if (caller->callees) in cgraph_create_edge()412 caller->callees->prev_callee = edge; in cgraph_create_edge()413 caller->callees = edge; in cgraph_create_edge()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()503 node->callees = NULL; in cgraph_node_remove_callees()[all …]
146 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 …]
385 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()
530 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()
539 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()
718 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()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()1914 for (e = first_clone->callees; e; e = e->next_callee) in save_inline_function_body()
134 for (e = node->callees; e; e = e->next_callee) in cgraph_remove_unreachable_nodes()
101 for (edge = v->callees; edge; edge = edge->next_callee) in searchc()
118 struct cgraph_edge *callees; member
619 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()
680 for (e = w->callees; e; e = e->next_callee) in static_execute()
2269 for (e = id.dst_node->callees; e; e = e->next_callee) in optimize_inline_calls()
18780 Update all callers and callees.18784 Update all callers and callees.18792 Update all callers and callees.
9654 node for the callees. Always allow inlining if it will shrink
9504 even when it has no inline callees.
110 // "normal" call instructions to callees which do not return.
5620 (me_execute_string): xstrdup the argument, so callees could freely