Searched refs:next_caller (Results 1 - 6 of 6) sorted by relevance

/freebsd-10.1-release/contrib/gcc/
H A Dipa.c60 if (edge->next_caller)
61 node2->aux = edge->next_caller;
176 for (e = node->callers; e; e = e->next_caller)
H A Dipa-inline.c122 if (!e->callee->callers->next_caller
207 next = e->next_caller;
230 for (e = node->callers; e; e = e->next_caller)
438 for (edge = node->callers; edge; edge = edge->next_caller)
449 for (edge = node->callers; edge; edge = edge->next_caller)
704 for (e = node->callers; e; e = e->next_caller)
745 for (edge = node->callers; edge; edge = edge->next_caller)
984 next = e->next_caller;
1018 if (node->callers && !node->callers->next_caller && !node->needed
1029 if (node1->callers->next_caller || node
[all...]
H A Dcgraph.c406 edge->next_caller = callee->callers;
437 e->prev_caller->next_caller = e->next_caller;
438 if (e->next_caller)
439 e->next_caller->prev_caller = e->prev_caller;
441 e->callee->callers = e->next_caller;
486 e->next_caller = n->callers;
521 for (e = node->callers; e; e = e->next_caller)
745 for (edge = node->callers; edge; edge = edge->next_caller)
H A Dcgraph.h175 struct cgraph_edge GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller")))
180 struct cgraph_edge *next_caller; local
H A Dcgraphunit.c642 for (e = node->callers; e; e = e->next_caller)
730 for (e = node->callers; e; e = e->next_caller)
746 if (node->callers->next_caller)
1209 for (e = node->callers; e; e = e->next_caller)
1772 for (e = new_version->callers; e; e = e->next_caller)
H A Dipa-cp.c501 for (cs = node->callers; cs != NULL; cs = cs->next_caller)
1047 for (cs = node->callers; cs != NULL; cs = cs->next_caller)
1050 for (cs = node->callers; cs != NULL; cs = cs->next_caller)

Completed in 167 milliseconds