@@ -139,8 +139,8 @@ unsigned MLInlineAdvisor::getInitialFunctionLevel(const Function &F) const {
139
139
return CG.lookup (F) ? FunctionLevels.at (CG.lookup (F)) : 0 ;
140
140
}
141
141
142
- void MLInlineAdvisor::onPassEntry (LazyCallGraph::SCC *LastSCC ) {
143
- if (!LastSCC || ForceStop)
142
+ void MLInlineAdvisor::onPassEntry (LazyCallGraph::SCC *CurSCC ) {
143
+ if (!CurSCC || ForceStop)
144
144
return ;
145
145
FPICache.clear ();
146
146
// Function passes executed between InlinerPass runs may have changed the
@@ -182,15 +182,15 @@ void MLInlineAdvisor::onPassEntry(LazyCallGraph::SCC *LastSCC) {
182
182
// (Re)use NodesInLastSCC to remember the nodes in the SCC right now,
183
183
// in case the SCC is split before onPassExit and some nodes are split out
184
184
assert (NodesInLastSCC.empty ());
185
- for (const auto &N : *LastSCC )
185
+ for (const auto &N : *CurSCC )
186
186
NodesInLastSCC.insert (&N);
187
187
}
188
188
189
- void MLInlineAdvisor::onPassExit (LazyCallGraph::SCC *LastSCC ) {
189
+ void MLInlineAdvisor::onPassExit (LazyCallGraph::SCC *CurSCC ) {
190
190
// No need to keep this around - function passes will invalidate it.
191
191
if (!KeepFPICache)
192
192
FPICache.clear ();
193
- if (!LastSCC || ForceStop)
193
+ if (!CurSCC || ForceStop)
194
194
return ;
195
195
// Keep track of the nodes and edges we last saw. Then, in onPassEntry,
196
196
// we update the node count and edge count from the subset of these nodes that
@@ -206,7 +206,7 @@ void MLInlineAdvisor::onPassExit(LazyCallGraph::SCC *LastSCC) {
206
206
}
207
207
208
208
// Check on nodes that may have got added to SCC
209
- for (const auto &N : *LastSCC ) {
209
+ for (const auto &N : *CurSCC ) {
210
210
assert (!N.isDead ());
211
211
auto I = NodesInLastSCC.insert (&N);
212
212
if (I.second )
0 commit comments