diff options
Diffstat (limited to 'gcc/ipa-inline.c')
| -rw-r--r-- | gcc/ipa-inline.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/ipa-inline.c b/gcc/ipa-inline.c index 8addcfb..fbda466 100644 --- a/gcc/ipa-inline.c +++ b/gcc/ipa-inline.c @@ -320,13 +320,13 @@ cgraph_maybe_hot_edge_p (struct cgraph_edge *edge) /* A cost model driving the inlining heuristics in a way so the edges with smallest badness are inlined first. After each inlining is performed - the costs of all caller edges of nodes affected are recompted so the + the costs of all caller edges of nodes affected are recomputed so the metrics may accurately depend on values such as number of inlinable callers of the function or function body size. For the moment we use estimated growth caused by inlining callee into all it's callers for driving the inlining but once we have loop depth or - frequency information readilly available we should do better. + frequency information readily available we should do better. With profiling we use number of executions of each edge to drive the cost. We also should distinguish hot and cold calls where the cold calls are @@ -344,7 +344,7 @@ cgraph_edge_badness (struct cgraph_edge *edge) cgraph_estimate_size_after_inlining (1, edge->caller, edge->callee); growth -= edge->caller->global.insns; - /* Always preffer inlining saving code size. */ + /* Always prefer inlining saving code size. */ if (growth <= 0) return INT_MIN - growth; return ((int)((double)edge->count * INT_MIN / max_count)) / growth; @@ -416,7 +416,7 @@ update_callee_keys (fibheap_t heap, struct cgraph_node *node, } /* Enqueue all recursive calls from NODE into priority queue depending on - how likely we want to recursivly inline the call. */ + how likely we want to recursively inline the call. */ static void lookup_recursive_calls (struct cgraph_node *node, struct cgraph_node *where, @@ -608,7 +608,7 @@ cgraph_decide_inlining_of_small_functions (void) continue; /* When not having profile info ready we don't weight by any way the - possition of call in procedure itself. This means if call of + position of call in procedure itself. This means if call of function A from function B seems profitable to inline, the recursive call of function A in inline copy of A in B will look profitable too and we end up inlining until reaching maximal function growth. This |