contrib/gcc/ipa-inline.c

122       if (!e->callee->callers->next_caller
123 	  && !e->callee->needed
126 	  gcc_assert (!e->callee->global.inlined_to);
127 	  if (DECL_SAVED_TREE (e->callee->decl))
128 	    overall_insns -= e->callee->global.insns, nfunctions_inlined++;
134 	  n = cgraph_clone_node (e->callee, e->count, e->loop_nest,
141     e->callee->global.inlined_to = e->caller->global.inlined_to;
143     e->callee->global.inlined_to = e->caller;
146   for (e = e->callee->callees; e; e = e->next_callee)
161   if (e->callee->inline_decl)
162     cgraph_redirect_edge_callee (e, cgraph_node (e->callee->inline_decl));
167   if (!e->callee->global.inlined && flag_unit_at_a_time)
168     DECL_POSSIBLY_INLINED (e->callee->decl) = true;
169   e->callee->global.inlined = true;
173   what = e->callee;
199   struct cgraph_node *what = edge->callee;
265       if (e->callee == what)
389 	cgraph_estimate_size_after_inlining (1, edge->caller, edge->callee);
400     int badness = cgraph_estimate_growth (edge->callee) * 256;
409     if (cgraph_recursive_inlining_p (edge->caller, edge->callee, NULL))
480       update_caller_keys (heap, e->callee, updated_nodes);
482       update_callee_keys (heap, e->callee, updated_nodes);
495     if (e->callee == node)
507       lookup_recursive_calls (node, e->callee, heap);
535     cgraph_find_cycles (e->callee, cycles);
554 	  && e->callee->local.inlinable
555 	  && !cgraph_recursive_inlining_p (node, e->callee,
557 	  && !htab_find (cycles, e->callee))
560     	    fprintf (dump_file, " inlining %s", cgraph_node_name (e->callee));
562 	  cgraph_flatten_node (e->callee, cycles);
565 	fprintf (dump_file, " !inlining %s", cgraph_node_name (e->callee));
625 	if (node->decl == curr->callee->decl)
665       lookup_recursive_calls (node, curr->callee, heap);
757 	cgraph_estimate_size_after_inlining (1, edge->caller, edge->callee);
765 		   cgraph_node_name (edge->callee),
766 		   edge->callee->global.insns);
772 		   cgraph_estimate_growth (edge->callee),
796 	      if (where->decl == edge->callee->decl)
803 		= (edge->callee->local.disregard_inline_limits ? N_("recursive inlining") : "");
812           if (!cgraph_recursive_inlining_p (edge->caller, edge->callee,
822       if (!cgraph_default_inline_p (edge->callee, &edge->inline_failed))
824           if (!cgraph_recursive_inlining_p (edge->caller, edge->callee,
832       if (cgraph_recursive_inlining_p (edge->caller, edge->callee,
844 	  struct cgraph_node *callee;
845 	  if (!cgraph_check_inline_limits (edge->caller, edge->callee,
853 	  callee = edge->callee;
855 	  update_callee_keys (heap, callee, updated_nodes);
884       if (!edge->callee->local.disregard_inline_limits && edge->inline_failed
885           && !cgraph_recursive_inlining_p (edge->caller, edge->callee,
987 	  if (cgraph_recursive_inlining_p (e->caller, e->callee,
1092     if (e->callee->local.disregard_inline_limits
1094         && !cgraph_recursive_inlining_p (node, e->callee, &e->inline_failed)
1097 	&& (DECL_SAVED_TREE (e->callee->decl) || e->callee->inline_decl))
1102 		     cgraph_node_name (e->callee));
1112       if (e->callee->local.inlinable
1114 	  && !e->callee->local.disregard_inline_limits
1115 	  && !cgraph_recursive_inlining_p (node, e->callee, &e->inline_failed)
1117 	      || (cgraph_estimate_size_after_inlining (1, e->caller, e->callee)
1119 	  && cgraph_check_inline_limits (node, e->callee, &e->inline_failed,
1121 	  && (DECL_SAVED_TREE (e->callee->decl) || e->callee->inline_decl))
1123 	  if (cgraph_default_inline_p (e->callee, &failed_reason))
1128 			   cgraph_node_name (e->callee));