mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 02:52:53 +02:00
[PM] Rename lookupPass to lookUpPass.
Summary: "Lookup" is a noun ("lookup table"), "look up" is a verb ("look up 'table' in the dictionary"). Reviewers: chandlerc Subscribers: silvas, llvm-commits, mehdi_amini Differential Revision: https://reviews.llvm.org/D27374 llvm-svn: 288598
This commit is contained in:
parent
a62db213e3
commit
58d9d057cd
@ -638,16 +638,16 @@ public:
|
|||||||
}
|
}
|
||||||
|
|
||||||
private:
|
private:
|
||||||
/// \brief Lookup a registered analysis pass.
|
/// \brief Look up a registered analysis pass.
|
||||||
PassConceptT &lookupPass(AnalysisKey *ID) {
|
PassConceptT &lookUpPass(AnalysisKey *ID) {
|
||||||
typename AnalysisPassMapT::iterator PI = AnalysisPasses.find(ID);
|
typename AnalysisPassMapT::iterator PI = AnalysisPasses.find(ID);
|
||||||
assert(PI != AnalysisPasses.end() &&
|
assert(PI != AnalysisPasses.end() &&
|
||||||
"Analysis passes must be registered prior to being queried!");
|
"Analysis passes must be registered prior to being queried!");
|
||||||
return *PI->second;
|
return *PI->second;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// \brief Lookup a registered analysis pass.
|
/// \brief Look up a registered analysis pass.
|
||||||
const PassConceptT &lookupPass(AnalysisKey *ID) const {
|
const PassConceptT &lookUpPass(AnalysisKey *ID) const {
|
||||||
typename AnalysisPassMapT::const_iterator PI = AnalysisPasses.find(ID);
|
typename AnalysisPassMapT::const_iterator PI = AnalysisPasses.find(ID);
|
||||||
assert(PI != AnalysisPasses.end() &&
|
assert(PI != AnalysisPasses.end() &&
|
||||||
"Analysis passes must be registered prior to being queried!");
|
"Analysis passes must be registered prior to being queried!");
|
||||||
@ -665,7 +665,7 @@ private:
|
|||||||
// If we don't have a cached result for this function, look up the pass and
|
// If we don't have a cached result for this function, look up the pass and
|
||||||
// run it to produce a result, which we then add to the cache.
|
// run it to produce a result, which we then add to the cache.
|
||||||
if (Inserted) {
|
if (Inserted) {
|
||||||
auto &P = this->lookupPass(ID);
|
auto &P = this->lookUpPass(ID);
|
||||||
if (DebugLogging)
|
if (DebugLogging)
|
||||||
dbgs() << "Running analysis: " << P.name() << "\n";
|
dbgs() << "Running analysis: " << P.name() << "\n";
|
||||||
AnalysisResultListT &ResultList = AnalysisResultLists[&IR];
|
AnalysisResultListT &ResultList = AnalysisResultLists[&IR];
|
||||||
@ -697,7 +697,7 @@ private:
|
|||||||
return;
|
return;
|
||||||
|
|
||||||
if (DebugLogging)
|
if (DebugLogging)
|
||||||
dbgs() << "Invalidating analysis: " << this->lookupPass(ID).name()
|
dbgs() << "Invalidating analysis: " << this->lookUpPass(ID).name()
|
||||||
<< "\n";
|
<< "\n";
|
||||||
AnalysisResultLists[&IR].erase(RI->second);
|
AnalysisResultLists[&IR].erase(RI->second);
|
||||||
AnalysisResults.erase(RI);
|
AnalysisResults.erase(RI);
|
||||||
|
Loading…
Reference in New Issue
Block a user