Lines Matching defs:growth
40 by the limits specified by user (allowed function growth, overall unit
41 growth and so on).
52 on code size growth fits.
59 all functions by their "profitability" (estimated by code size growth)
220 /* Estimate the growth caused by inlining NODE into all callees. */
225 int growth = 0;
232 growth += (cgraph_estimate_size_after_inlining (1, e->caller, node)
239 growth -= node->global.insns;
241 node->global.estimated_growth = growth;
242 return growth;
246 as it would cause too large growth of function bodies.
272 take the inlined function as base for limiting the growth. */
288 *reason = N_("--param large-function-growth limit reached");
388 int growth =
390 growth -= edge->caller->global.insns;
393 if (growth <= 0)
394 return INT_MIN - growth;
395 return ((int)((double)edge->count * INT_MIN / max_count)) / growth;
669 fprintf (dump_file, " Recursive inlining growth limit met.\n");
711 growth of the overall number of instructions and then update the estimates.
756 int growth =
759 growth -= edge->caller->global.insns;
769 " Estimated growth after inlined into all callees is %+i insns.\n"
786 and we end up inlining until reaching maximal function growth. This
810 if (!cgraph_maybe_hot_edge_p (edge) && growth > 0)
887 edge->inline_failed = N_("--param inline-unit-growth limit reached");