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

/freebsd-10.1-release/contrib/gcc/
H A Dcgraph.c328 for (e = node->callees; e; e= e->next_callee)
337 for (e2 = node->callees; e2; e2 = e2->next_callee)
384 for (e = caller->callees; e; e = e->next_callee)
410 edge->next_callee = caller->callees;
450 e->prev_callee->next_callee = e->next_callee;
451 if (e->next_callee)
452 e->next_callee->prev_callee = e->prev_callee;
454 e->caller->callees = e->next_callee;
501 for (e = node->callees; e; e = e->next_callee)
[all...]
H A Dtree-optimize.c385 for (e = node->callees; e; e = e->next_callee)
433 for (e = node->callees; e; e = e->next_callee)
448 for (e = node->callees; e; e = e->next_callee)
H A Dipa-inline.c146 for (e = e->callee->callees; e; e = e->next_callee)
264 for (e = to->callees; e; e = e->next_callee)
478 for (e = node->callees; e; e = e->next_callee)
494 for (e = where->callees; e; e = e->next_callee)
505 for (e = where->callees; e; e = e->next_callee)
534 for (e = node->callees; e; e = e->next_callee)
549 for (e = node->callees; e; e = e->next_callee)
610 for (e = master_clone->callees; e; e = e->next_callee)
922 for (e = node->callees; e; e = e->next_callee)
1091 for (e = node->callees; e; e = e->next_callee)
[all...]
H A Dcgraphunit.c718 for (e = node->callees; e; e = e->next_callee)
833 for (e = node->callees; e; e = e->next_callee)
1139 for (edge = node->callees; edge; edge = edge->next_callee)
1793 struct cgraph_edge *next_callee; local
1809 for (e = old_version->callees;e; e=e->next_callee)
1819 for (e = new_version->callees ; e; e = next_callee)
1821 next_callee = e->next_callee;
1825 if (!next_callee)
1914 for (e = first_clone->callees; e; e = e->next_callee)
[all...]
H A Dipa-cp.c530 for (cs = node->callees; cs; cs = cs->next_callee)
591 for (cs = mt->callees; cs; cs = cs->next_callee)
649 for (cs = node->callees; cs; cs = cs->next_callee)
718 for (cs = node->callees; cs; cs = cs->next_callee)
930 for (cs = node->callees; cs; cs = cs->next_callee)
988 for (cs = node->callees; cs; cs = cs->next_callee)
990 for (cs = orig_node->callees; cs; cs = cs->next_callee)
H A Dipa-prop.c539 for (cs = node->callees; cs; cs = cs->next_callee)
564 for (cs = node->callees; cs; cs = cs->next_callee)
588 for (cs = node->callees; cs; cs = cs->next_callee)
H A Dcgraph.h182 struct cgraph_edge *next_callee; local
H A Dipa-utils.c102 for (edge = v->callees; edge; edge = edge->next_callee)
H A Dipa.c134 for (e = node->callees; e; e = e->next_callee)
H A Dipa-pure-const.c681 for (e = w->callees; e; e = e->next_callee)
H A Dipa-reference.c620 for (e = x->callees; e; e = e->next_callee)
701 for (e = x->callees; e; e = e->next_callee)
H A Dtree-inline.c2269 for (e = id.dst_node->callees; e; e = e->next_callee)

Completed in 175 milliseconds