Lines Matching full:inlining
10 // This file implements the mechanics required to implement inlining without
47 cl::desc("Control the amount of inlining to perform (default = 225)"));
51 cl::desc("Threshold for inlining functions with inline hint"));
137 // don't want to hurt is SRoA: once inlining happens, often allocas are no
161 // reuse and makes a callsite (C) available for inlining. When we process
289 DEBUG(dbgs() << " Inlining: cost=always"
295 DEBUG(dbgs() << " NOT Inlining: cost=never"
302 DEBUG(dbgs() << " NOT Inlining: cost=" << IC.getCost()
308 // Try to detect the case where the current inlining candidate caller (call
309 // it B) is a static or linkonce-ODR function and is an inlining candidate
311 // that inlining it into B would make B too big to inline later. In these
316 // expected to be available for inlining in the translation units where they
317 // are used. Thus we will always have the opportunity to make local inlining
354 // See if inlining or original callsite would erase the cost delta of
370 DEBUG(dbgs() << " NOT Inlining: " << *CS.getInstruction() <<
377 DEBUG(dbgs() << " Inlining: cost=" << IC.getCost()
412 // from inlining other functions.
415 // When inlining a callee produces new call sites, we want to keep track of
417 // infinite inlining in some obscure cases. To represent this, we use an
434 // it. If it is an indirect call, inlining may resolve it to be a
467 // Iterate over the outer loop because inlining functions can cause indirect
490 // If this call site was obtained by inlining another function, verify
492 // itself. If so, we'd be recursively inlining the same function,
512 // If inlining this function gave us any new call sites, throw them
516 // that these new callsites came about due to inlining Callee.
