Home | History | Annotate | Download | only in gcc

Lines Matching defs:inlinable

74 	 algorithm ordering all inlinable cgraph edges by their badness and
233 " not inlinable: %C -> %C, %s\n",
333 bool inlinable = true;
342 inlinable = false;
348 inlinable = false;
353 inlinable = false;
358 inlinable = false;
371 inlinable = false;
378 inlinable = false;
385 inlinable = false;
388 || !ipa_fn_summaries->get (callee)->inlinable)
391 inlinable = false;
397 inlinable = false;
400 if (!inlinable && report)
402 return inlinable;
468 bool inlinable = true;
482 inlinable = false;
488 inlinable = false;
547 inlinable = false;
557 inlinable = false;
577 inlinable = false;
593 inlinable = false;
607 inlinable = false;
613 if (!inlinable && report)
615 return inlinable;
619 /* Return true if the edge E is inlinable during early inlining. */
646 " edge not inlinable: not in SSA form\n");
1168 metrics may accurately depend on values such as number of inlinable callers
1296 && caller_info->inlinable
1486 it is inlinable. Otherwise check all edges. */
1496 if ((!node->alias && !ipa_fn_summaries->get (node)->inlinable)
1532 are inlinable (typically UPDATE_SINCE is the inline clone we introduced
1576 && ipa_fn_summaries->get (callee)->inlinable
2296 such as number of inlinable calls and size of the function body.
2299 called by function we inlined (since number of it inlinable callers
2873 is not inlinable. This will allow flagging an error later in
2911 if (s == NULL || !s->inlinable || !e->inline_failed)