Lines Matching defs:callee
63 For each inlined call, the callee's node is cloned to represent the
65 Each inlined call gets a unique corresponding clone node of the callee
67 the clones are eliminated and their callee edges redirected to the
377 cgraph_create_edge (struct cgraph_node *caller, struct cgraph_node *callee,
390 if (!DECL_SAVED_TREE (callee->decl))
392 else if (callee->local.redefined_extern_inline)
395 else if (callee->local.inlinable)
403 edge->callee = callee;
406 edge->next_caller = callee->callers;
407 if (callee->callers)
408 callee->callers->prev_caller = edge;
414 callee->callers = edge;
431 /* Remove the edge E from the list of the callers of the callee. */
441 e->callee->callers = e->next_caller;
466 /* Remove from callers list of the callee. */
473 /* Redirect callee of E to N. The function does not update underlying
479 /* Remove from callers list of the current callee. */
482 /* Insert to callers list of the new callee. */
488 e->callee = n;
499 the callees. The callee list of the node can be zapped with one
759 fprintf (f, "%s/%i ", cgraph_node_name (edge->callee),
760 edge->callee->uid);
1043 new = cgraph_create_edge (n, e->callee, call_stmt,