@@ -187,8 +187,8 @@ unsigned MLInlineAdvisor::getInitialFunctionLevel(const Function &F) const {
187
187
return CG.lookup (F) ? FunctionLevels.at (CG.lookup (F)) : 0 ;
188
188
}
189
189
190
- void MLInlineAdvisor::onPassEntry (LazyCallGraph::SCC *LastSCC ) {
191
- if (!LastSCC || ForceStop)
190
+ void MLInlineAdvisor::onPassEntry (LazyCallGraph::SCC *CurSCC ) {
191
+ if (!CurSCC || ForceStop)
192
192
return ;
193
193
FPICache.clear ();
194
194
// Function passes executed between InlinerPass runs may have changed the
@@ -235,15 +235,15 @@ void MLInlineAdvisor::onPassEntry(LazyCallGraph::SCC *LastSCC) {
235
235
// (Re)use NodesInLastSCC to remember the nodes in the SCC right now,
236
236
// in case the SCC is split before onPassExit and some nodes are split out
237
237
assert (NodesInLastSCC.empty ());
238
- for (const auto &N : *LastSCC )
238
+ for (const auto &N : *CurSCC )
239
239
NodesInLastSCC.insert (&N);
240
240
}
241
241
242
- void MLInlineAdvisor::onPassExit (LazyCallGraph::SCC *LastSCC ) {
242
+ void MLInlineAdvisor::onPassExit (LazyCallGraph::SCC *CurSCC ) {
243
243
// No need to keep this around - function passes will invalidate it.
244
244
if (!KeepFPICache)
245
245
FPICache.clear ();
246
- if (!LastSCC || ForceStop)
246
+ if (!CurSCC || ForceStop)
247
247
return ;
248
248
// Keep track of the nodes and edges we last saw. Then, in onPassEntry,
249
249
// we update the node count and edge count from the subset of these nodes that
@@ -259,7 +259,7 @@ void MLInlineAdvisor::onPassExit(LazyCallGraph::SCC *LastSCC) {
259
259
}
260
260
261
261
// Check on nodes that may have got added to SCC
262
- for (const auto &N : *LastSCC ) {
262
+ for (const auto &N : *CurSCC ) {
263
263
assert (!N.isDead ());
264
264
auto I = NodesInLastSCC.insert (&N);
265
265
if (I.second )
0 commit comments