contrib/gcc/cgraph.c

41     When built, there is one edge for each direct call.  It is possible that
70       Each edge has "inline_failed" field.  When the field is set to NULL,
312 /* Return callgraph edge representing CALL_EXPR statement.  */
351 /* Change call_smtt of edge E to NEW_STMT.  */
374 /* Create edge from CALLER to CALLEE in the cgraph.  */
380   struct cgraph_edge *edge = GGC_NEW (struct cgraph_edge);
391     edge->inline_failed = N_("function body not available");
393     edge->inline_failed = N_("redefined extern inline functions are not "
396     edge->inline_failed = N_("function not considered for inlining");
398     edge->inline_failed = N_("function not inlinable");
400   edge->aux = NULL;
402   edge->caller = caller;
403   edge->callee = callee;
404   edge->call_stmt = call_stmt;
405   edge->prev_caller = NULL;
406   edge->next_caller = callee->callers;
408     callee->callers->prev_caller = edge;
409   edge->prev_callee = NULL;
410   edge->next_callee = caller->callees;
412     caller->callees->prev_callee = edge;
413   caller->callees = edge;
414   callee->callers = edge;
415   edge->count = count;
416   edge->loop_nest = nest;
421 				       edge->call_stmt,
423 					 (edge->call_stmt),
426       *slot = edge;
428   return edge;
431 /* Remove the edge E from the list of the callers of the callee.  */
444 /* Remove the edge E from the list of the callees of the caller.  */
461 /* Remove the edge E in the cgraph.  */
701   struct cgraph_edge *edge;
745   for (edge = node->callers; edge; edge = edge->next_caller)
747       fprintf (f, "%s/%i ", cgraph_node_name (edge->caller),
748 	       edge->caller->uid);
749       if (edge->count)
751 		 (HOST_WIDEST_INT)edge->count);
752       if (!edge->inline_failed)
757   for (edge = node->callees; edge; edge = edge->next_callee)
759       fprintf (f, "%s/%i ", cgraph_node_name (edge->callee),
760 	       edge->callee->uid);
761       if (!edge->inline_failed)
763       if (edge->count)
765 		 (HOST_WIDEST_INT)edge->count);
766       if (edge->loop_nest)
767 	fprintf (f, "(nested in %i loops) ", edge->loop_nest);