2002-01-21 07:37:31 +00:00
|
|
|
//===- Pass.cpp - LLVM Pass Infrastructure Impementation ------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the LLVM Pass infrastructure. It is primarily
|
|
|
|
// responsible with ensuring that passes are executed and batched together
|
|
|
|
// optimally.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-01-31 00:45:31 +00:00
|
|
|
#include "llvm/PassManager.h"
|
2002-04-28 20:46:05 +00:00
|
|
|
#include "PassManagerT.h" // PassManagerT implementation
|
2002-01-31 00:45:31 +00:00
|
|
|
#include "llvm/Module.h"
|
2002-01-21 07:37:31 +00:00
|
|
|
#include "Support/STLExtras.h"
|
2002-04-28 20:46:05 +00:00
|
|
|
#include "Support/CommandLine.h"
|
2002-07-23 18:08:00 +00:00
|
|
|
#include "Support/TypeInfo.h"
|
2002-04-28 20:46:05 +00:00
|
|
|
#include <typeinfo>
|
|
|
|
#include <iostream>
|
2002-04-29 04:04:29 +00:00
|
|
|
#include <sys/time.h>
|
|
|
|
#include <stdio.h>
|
2002-01-23 05:49:41 +00:00
|
|
|
|
2002-05-06 19:31:52 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AnalysisID Class Implementation
|
|
|
|
//
|
|
|
|
|
|
|
|
static std::vector<AnalysisID> CFGOnlyAnalyses;
|
|
|
|
|
2002-01-31 00:45:31 +00:00
|
|
|
// Source of unique analysis ID #'s.
|
|
|
|
unsigned AnalysisID::NextID = 0;
|
|
|
|
|
2002-05-06 19:31:52 +00:00
|
|
|
AnalysisID::AnalysisID(const AnalysisID &AID, bool DependsOnlyOnCFG) {
|
|
|
|
ID = AID.ID; // Implement the copy ctor part...
|
|
|
|
Constructor = AID.Constructor;
|
|
|
|
|
|
|
|
// If this analysis only depends on the CFG of the function, add it to the CFG
|
|
|
|
// only list...
|
|
|
|
if (DependsOnlyOnCFG)
|
|
|
|
CFGOnlyAnalyses.push_back(AID);
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AnalysisResolver Class Implementation
|
|
|
|
//
|
|
|
|
|
2002-01-31 00:45:31 +00:00
|
|
|
void AnalysisResolver::setAnalysisResolver(Pass *P, AnalysisResolver *AR) {
|
|
|
|
assert(P->Resolver == 0 && "Pass already in a PassManager!");
|
|
|
|
P->Resolver = AR;
|
|
|
|
}
|
|
|
|
|
2002-05-06 19:31:52 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AnalysisUsage Class Implementation
|
|
|
|
//
|
2002-04-28 21:25:41 +00:00
|
|
|
|
|
|
|
// preservesCFG - This function should be called to by the pass, iff they do
|
|
|
|
// not:
|
|
|
|
//
|
|
|
|
// 1. Add or remove basic blocks from the function
|
|
|
|
// 2. Modify terminator instructions in any way.
|
|
|
|
//
|
|
|
|
// This function annotates the AnalysisUsage info object to say that analyses
|
|
|
|
// that only depend on the CFG are preserved by this pass.
|
|
|
|
//
|
|
|
|
void AnalysisUsage::preservesCFG() {
|
2002-05-06 19:31:52 +00:00
|
|
|
// Since this transformation doesn't modify the CFG, it preserves all analyses
|
|
|
|
// that only depend on the CFG (like dominators, loop info, etc...)
|
|
|
|
//
|
|
|
|
Preserved.insert(Preserved.end(),
|
|
|
|
CFGOnlyAnalyses.begin(), CFGOnlyAnalyses.end());
|
2002-04-28 21:25:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-04-28 20:46:05 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// PassManager implementation - The PassManager class is a simple Pimpl class
|
|
|
|
// that wraps the PassManagerT template.
|
|
|
|
//
|
|
|
|
PassManager::PassManager() : PM(new PassManagerT<Module>()) {}
|
|
|
|
PassManager::~PassManager() { delete PM; }
|
|
|
|
void PassManager::add(Pass *P) { PM->add(P); }
|
2002-06-25 16:13:24 +00:00
|
|
|
bool PassManager::run(Module &M) { return PM->run(M); }
|
2002-01-31 00:45:31 +00:00
|
|
|
|
2002-04-28 20:46:05 +00:00
|
|
|
|
2002-04-29 04:04:29 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// TimingInfo Class - This class is used to calculate information about the
|
|
|
|
// amount of time each pass takes to execute. This only happens with
|
|
|
|
// -time-passes is enabled on the command line.
|
|
|
|
//
|
2002-07-22 02:10:13 +00:00
|
|
|
static cl::opt<bool>
|
|
|
|
EnableTiming("time-passes",
|
|
|
|
cl::desc("Time each pass, printing elapsed time for each on exit"));
|
2002-04-29 04:04:29 +00:00
|
|
|
|
|
|
|
static double getTime() {
|
|
|
|
struct timeval T;
|
|
|
|
gettimeofday(&T, 0);
|
|
|
|
return T.tv_sec + T.tv_usec/1000000.0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Create method. If Timing is enabled, this creates and returns a new timing
|
|
|
|
// object, otherwise it returns null.
|
|
|
|
//
|
|
|
|
TimingInfo *TimingInfo::create() {
|
|
|
|
return EnableTiming ? new TimingInfo() : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void TimingInfo::passStarted(Pass *P) { TimingData[P] -= getTime(); }
|
|
|
|
void TimingInfo::passEnded(Pass *P) { TimingData[P] += getTime(); }
|
|
|
|
|
|
|
|
// TimingDtor - Print out information about timing information
|
|
|
|
TimingInfo::~TimingInfo() {
|
|
|
|
// Iterate over all of the data, converting it into the dual of the data map,
|
|
|
|
// so that the data is sorted by amount of time taken, instead of pointer.
|
|
|
|
//
|
2002-06-25 22:07:38 +00:00
|
|
|
std::vector<std::pair<double, Pass*> > Data;
|
2002-04-29 04:04:29 +00:00
|
|
|
double TotalTime = 0;
|
|
|
|
for (std::map<Pass*, double>::iterator I = TimingData.begin(),
|
|
|
|
E = TimingData.end(); I != E; ++I)
|
|
|
|
// Throw out results for "grouping" pass managers...
|
|
|
|
if (!dynamic_cast<AnalysisResolver*>(I->first)) {
|
|
|
|
Data.push_back(std::make_pair(I->second, I->first));
|
|
|
|
TotalTime += I->second;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Sort the data by time as the primary key, in reverse order...
|
2002-06-25 22:07:38 +00:00
|
|
|
std::sort(Data.begin(), Data.end(), std::greater<std::pair<double, Pass*> >());
|
2002-04-29 04:04:29 +00:00
|
|
|
|
|
|
|
// Print out timing header...
|
2002-06-25 22:07:38 +00:00
|
|
|
std::cerr << std::string(79, '=') << "\n"
|
2002-04-29 04:04:29 +00:00
|
|
|
<< " ... Pass execution timing report ...\n"
|
|
|
|
<< std::string(79, '=') << "\n Total Execution Time: " << TotalTime
|
2002-04-29 14:57:45 +00:00
|
|
|
<< " seconds\n\n % Time: Seconds:\tPass Name:\n";
|
2002-04-29 04:04:29 +00:00
|
|
|
|
|
|
|
// Loop through all of the timing data, printing it out...
|
|
|
|
for (unsigned i = 0, e = Data.size(); i != e; ++i) {
|
|
|
|
fprintf(stderr, " %6.2f%% %fs\t%s\n", Data[i].first*100 / TotalTime,
|
2002-04-29 14:57:45 +00:00
|
|
|
Data[i].first, Data[i].second->getPassName());
|
2002-04-29 04:04:29 +00:00
|
|
|
}
|
2002-06-25 22:07:38 +00:00
|
|
|
std::cerr << " 100.00% " << TotalTime << "s\tTOTAL\n"
|
2002-04-29 04:04:29 +00:00
|
|
|
<< std::string(79, '=') << "\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-04-28 20:46:05 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-01-23 05:49:41 +00:00
|
|
|
// Pass debugging information. Often it is useful to find out what pass is
|
|
|
|
// running when a crash occurs in a utility. When this library is compiled with
|
|
|
|
// debugging on, a command line option (--debug-pass) is enabled that causes the
|
|
|
|
// pass name to be printed before it executes.
|
|
|
|
//
|
|
|
|
|
2002-01-31 00:45:31 +00:00
|
|
|
// Different debug levels that can be enabled...
|
|
|
|
enum PassDebugLevel {
|
2002-07-22 02:10:13 +00:00
|
|
|
None, Structure, Executions, Details
|
2002-01-31 00:45:31 +00:00
|
|
|
};
|
2002-01-23 05:49:41 +00:00
|
|
|
|
2002-07-22 02:10:13 +00:00
|
|
|
static cl::opt<enum PassDebugLevel>
|
|
|
|
PassDebugging("debug-pass", cl::Hidden,
|
|
|
|
cl::desc("Print PassManager debugging information"),
|
|
|
|
cl::values(
|
|
|
|
clEnumVal(None , "disable debug output"),
|
|
|
|
// TODO: add option to print out pass names "PassOptions"
|
|
|
|
clEnumVal(Structure , "print pass structure before run()"),
|
|
|
|
clEnumVal(Executions, "print pass name before it is executed"),
|
|
|
|
clEnumVal(Details , "print pass details when it is executed"),
|
|
|
|
0));
|
2002-01-21 07:37:31 +00:00
|
|
|
|
2002-01-31 00:45:31 +00:00
|
|
|
void PMDebug::PrintPassStructure(Pass *P) {
|
2002-07-22 02:10:13 +00:00
|
|
|
if (PassDebugging >= Structure)
|
2002-01-31 00:45:31 +00:00
|
|
|
P->dumpPassStructure();
|
2002-01-21 07:37:31 +00:00
|
|
|
}
|
|
|
|
|
2002-01-31 00:45:31 +00:00
|
|
|
void PMDebug::PrintPassInformation(unsigned Depth, const char *Action,
|
2002-04-28 05:14:06 +00:00
|
|
|
Pass *P, Annotable *V) {
|
2002-07-22 02:10:13 +00:00
|
|
|
if (PassDebugging >= Executions) {
|
2002-01-31 18:32:27 +00:00
|
|
|
std::cerr << (void*)P << std::string(Depth*2+1, ' ') << Action << " '"
|
2002-04-29 14:57:45 +00:00
|
|
|
<< P->getPassName();
|
2002-01-31 00:45:31 +00:00
|
|
|
if (V) {
|
|
|
|
std::cerr << "' on ";
|
2002-04-28 05:14:06 +00:00
|
|
|
|
|
|
|
if (dynamic_cast<Module*>(V)) {
|
2002-01-31 00:45:31 +00:00
|
|
|
std::cerr << "Module\n"; return;
|
2002-04-28 05:14:06 +00:00
|
|
|
} else if (Function *F = dynamic_cast<Function*>(V))
|
|
|
|
std::cerr << "Function '" << F->getName();
|
|
|
|
else if (BasicBlock *BB = dynamic_cast<BasicBlock*>(V))
|
|
|
|
std::cerr << "BasicBlock '" << BB->getName();
|
|
|
|
else if (Value *Val = dynamic_cast<Value*>(V))
|
|
|
|
std::cerr << typeid(*Val).name() << " '" << Val->getName();
|
2002-01-31 00:45:31 +00:00
|
|
|
}
|
|
|
|
std::cerr << "'...\n";
|
2002-01-21 07:37:31 +00:00
|
|
|
}
|
2002-01-31 00:45:31 +00:00
|
|
|
}
|
2002-01-21 07:37:31 +00:00
|
|
|
|
2002-01-31 00:45:31 +00:00
|
|
|
void PMDebug::PrintAnalysisSetInfo(unsigned Depth, const char *Msg,
|
2002-04-27 06:56:12 +00:00
|
|
|
Pass *P, const std::vector<AnalysisID> &Set){
|
2002-07-22 02:10:13 +00:00
|
|
|
if (PassDebugging >= Details && !Set.empty()) {
|
2002-01-31 18:32:27 +00:00
|
|
|
std::cerr << (void*)P << std::string(Depth*2+3, ' ') << Msg << " Analyses:";
|
2002-04-27 06:56:12 +00:00
|
|
|
for (unsigned i = 0; i != Set.size(); ++i) {
|
2002-01-31 00:45:31 +00:00
|
|
|
Pass *P = Set[i].createPass(); // Good thing this is just debug code...
|
2002-04-29 14:57:45 +00:00
|
|
|
std::cerr << " " << P->getPassName();
|
2002-01-31 00:45:31 +00:00
|
|
|
delete P;
|
2002-01-23 05:49:41 +00:00
|
|
|
}
|
2002-01-31 00:45:31 +00:00
|
|
|
std::cerr << "\n";
|
2002-01-21 07:37:31 +00:00
|
|
|
}
|
2002-01-31 00:45:31 +00:00
|
|
|
}
|
2002-01-21 07:37:31 +00:00
|
|
|
|
2002-07-22 02:10:13 +00:00
|
|
|
// dumpPassStructure - Implement the -debug-passes=Structure option
|
2002-07-24 22:08:53 +00:00
|
|
|
void Pass::dumpPassStructure(unsigned Offset) {
|
2002-04-29 14:57:45 +00:00
|
|
|
std::cerr << std::string(Offset*2, ' ') << getPassName() << "\n";
|
2002-01-31 00:45:31 +00:00
|
|
|
}
|
2002-01-21 07:37:31 +00:00
|
|
|
|
|
|
|
|
2002-01-31 00:45:31 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Pass Implementation
|
|
|
|
//
|
2002-01-23 05:49:41 +00:00
|
|
|
|
2002-04-27 06:56:12 +00:00
|
|
|
void Pass::addToPassManager(PassManagerT<Module> *PM, AnalysisUsage &AU) {
|
|
|
|
PM->addPass(this, AU);
|
2002-01-31 00:45:31 +00:00
|
|
|
}
|
2002-01-21 07:37:31 +00:00
|
|
|
|
2002-04-29 14:57:45 +00:00
|
|
|
|
|
|
|
// getPassName - Use C++ RTTI to get a SOMEWHAT intelligable name for the pass.
|
|
|
|
//
|
|
|
|
const char *Pass::getPassName() const { return typeid(*this).name(); }
|
|
|
|
|
2002-01-31 00:45:31 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-04-27 06:56:12 +00:00
|
|
|
// FunctionPass Implementation
|
2002-01-31 00:45:31 +00:00
|
|
|
//
|
2002-01-22 00:17:48 +00:00
|
|
|
|
2002-04-27 06:56:12 +00:00
|
|
|
// run - On a module, we run this pass by initializing, runOnFunction'ing once
|
|
|
|
// for every function in the module, then by finalizing.
|
2002-01-31 00:45:31 +00:00
|
|
|
//
|
2002-06-25 16:13:24 +00:00
|
|
|
bool FunctionPass::run(Module &M) {
|
2002-01-31 00:45:31 +00:00
|
|
|
bool Changed = doInitialization(M);
|
|
|
|
|
2002-06-25 16:13:24 +00:00
|
|
|
for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
|
|
|
|
if (!I->isExternal()) // Passes are not run on external functions!
|
2002-04-27 06:56:12 +00:00
|
|
|
Changed |= runOnFunction(*I);
|
2002-01-31 00:45:31 +00:00
|
|
|
|
|
|
|
return Changed | doFinalization(M);
|
|
|
|
}
|
2002-01-21 07:37:31 +00:00
|
|
|
|
2002-04-27 06:56:12 +00:00
|
|
|
// run - On a function, we simply initialize, run the function, then finalize.
|
2002-01-31 00:45:31 +00:00
|
|
|
//
|
2002-06-25 16:13:24 +00:00
|
|
|
bool FunctionPass::run(Function &F) {
|
|
|
|
if (F.isExternal()) return false;// Passes are not run on external functions!
|
2002-01-21 07:37:31 +00:00
|
|
|
|
2002-06-25 16:13:24 +00:00
|
|
|
return doInitialization(*F.getParent()) | runOnFunction(F)
|
|
|
|
| doFinalization(*F.getParent());
|
2002-01-31 00:45:31 +00:00
|
|
|
}
|
2002-01-21 07:37:31 +00:00
|
|
|
|
2002-04-27 06:56:12 +00:00
|
|
|
void FunctionPass::addToPassManager(PassManagerT<Module> *PM,
|
|
|
|
AnalysisUsage &AU) {
|
|
|
|
PM->addPass(this, AU);
|
2002-01-31 00:45:31 +00:00
|
|
|
}
|
2002-01-21 07:37:31 +00:00
|
|
|
|
2002-04-27 06:56:12 +00:00
|
|
|
void FunctionPass::addToPassManager(PassManagerT<Function> *PM,
|
|
|
|
AnalysisUsage &AU) {
|
|
|
|
PM->addPass(this, AU);
|
2002-01-22 00:17:48 +00:00
|
|
|
}
|
2002-01-21 07:37:31 +00:00
|
|
|
|
2002-01-31 00:45:31 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// BasicBlockPass Implementation
|
|
|
|
//
|
2002-01-21 07:37:31 +00:00
|
|
|
|
2002-04-27 06:56:12 +00:00
|
|
|
// To run this pass on a function, we simply call runOnBasicBlock once for each
|
|
|
|
// function.
|
2002-01-21 07:37:31 +00:00
|
|
|
//
|
2002-06-25 16:13:24 +00:00
|
|
|
bool BasicBlockPass::runOnFunction(Function &F) {
|
2002-01-31 00:45:31 +00:00
|
|
|
bool Changed = false;
|
2002-06-25 16:13:24 +00:00
|
|
|
for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)
|
2002-01-31 00:45:31 +00:00
|
|
|
Changed |= runOnBasicBlock(*I);
|
|
|
|
return Changed;
|
2002-01-21 07:37:31 +00:00
|
|
|
}
|
|
|
|
|
2002-01-31 00:45:31 +00:00
|
|
|
// To run directly on the basic block, we initialize, runOnBasicBlock, then
|
|
|
|
// finalize.
|
|
|
|
//
|
2002-06-25 16:13:24 +00:00
|
|
|
bool BasicBlockPass::run(BasicBlock &BB) {
|
|
|
|
Module &M = *BB.getParent()->getParent();
|
2002-01-31 00:45:31 +00:00
|
|
|
return doInitialization(M) | runOnBasicBlock(BB) | doFinalization(M);
|
2002-01-21 07:37:31 +00:00
|
|
|
}
|
2002-01-23 05:49:41 +00:00
|
|
|
|
2002-03-26 18:01:55 +00:00
|
|
|
void BasicBlockPass::addToPassManager(PassManagerT<Function> *PM,
|
2002-04-27 06:56:12 +00:00
|
|
|
AnalysisUsage &AU) {
|
|
|
|
PM->addPass(this, AU);
|
2002-01-31 00:45:31 +00:00
|
|
|
}
|
2002-01-23 05:49:41 +00:00
|
|
|
|
2002-01-31 00:45:31 +00:00
|
|
|
void BasicBlockPass::addToPassManager(PassManagerT<BasicBlock> *PM,
|
2002-04-27 06:56:12 +00:00
|
|
|
AnalysisUsage &AU) {
|
|
|
|
PM->addPass(this, AU);
|
2002-01-23 05:49:41 +00:00
|
|
|
}
|
2002-01-31 00:45:31 +00:00
|
|
|
|
2002-07-23 18:08:00 +00:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Pass Registration mechanism
|
|
|
|
//
|
|
|
|
static std::map<TypeInfo, PassInfo*> *PassInfoMap = 0;
|
|
|
|
static std::vector<PassRegistrationListener*> *Listeners = 0;
|
|
|
|
|
|
|
|
// getPassInfo - Return the PassInfo data structure that corresponds to this
|
|
|
|
// pass...
|
|
|
|
const PassInfo *Pass::getPassInfo() const {
|
|
|
|
assert(PassInfoMap && "PassInfoMap not constructed yet??");
|
|
|
|
std::map<TypeInfo, PassInfo*>::iterator I =
|
|
|
|
PassInfoMap->find(typeid(*this));
|
|
|
|
assert(I != PassInfoMap->end() && "Pass has not been registered!");
|
|
|
|
return I->second;
|
|
|
|
}
|
|
|
|
|
|
|
|
void RegisterPassBase::registerPass(PassInfo *PI) {
|
|
|
|
if (PassInfoMap == 0)
|
|
|
|
PassInfoMap = new std::map<TypeInfo, PassInfo*>();
|
|
|
|
|
|
|
|
assert(PassInfoMap->find(PI->getTypeInfo()) == PassInfoMap->end() &&
|
|
|
|
"Pass already registered!");
|
|
|
|
PIObj = PI;
|
|
|
|
PassInfoMap->insert(std::make_pair(TypeInfo(PI->getTypeInfo()), PI));
|
|
|
|
|
|
|
|
// Notify any listeners...
|
|
|
|
if (Listeners)
|
|
|
|
for (std::vector<PassRegistrationListener*>::iterator
|
|
|
|
I = Listeners->begin(), E = Listeners->end(); I != E; ++I)
|
|
|
|
(*I)->passRegistered(PI);
|
|
|
|
}
|
|
|
|
|
|
|
|
RegisterPassBase::~RegisterPassBase() {
|
|
|
|
assert(PassInfoMap && "Pass registered but not in map!");
|
|
|
|
std::map<TypeInfo, PassInfo*>::iterator I =
|
|
|
|
PassInfoMap->find(PIObj->getTypeInfo());
|
|
|
|
assert(I != PassInfoMap->end() && "Pass registered but not in map!");
|
|
|
|
|
|
|
|
// Remove pass from the map...
|
|
|
|
PassInfoMap->erase(I);
|
|
|
|
if (PassInfoMap->empty()) {
|
|
|
|
delete PassInfoMap;
|
|
|
|
PassInfoMap = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Notify any listeners...
|
|
|
|
if (Listeners)
|
|
|
|
for (std::vector<PassRegistrationListener*>::iterator
|
|
|
|
I = Listeners->begin(), E = Listeners->end(); I != E; ++I)
|
|
|
|
(*I)->passUnregistered(PIObj);
|
|
|
|
|
|
|
|
// Delete the PassInfo object itself...
|
|
|
|
delete PIObj;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// PassRegistrationListener implementation
|
|
|
|
//
|
|
|
|
|
|
|
|
// PassRegistrationListener ctor - Add the current object to the list of
|
|
|
|
// PassRegistrationListeners...
|
|
|
|
PassRegistrationListener::PassRegistrationListener() {
|
|
|
|
if (!Listeners) Listeners = new std::vector<PassRegistrationListener*>();
|
|
|
|
Listeners->push_back(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
// dtor - Remove object from list of listeners...
|
|
|
|
PassRegistrationListener::~PassRegistrationListener() {
|
|
|
|
std::vector<PassRegistrationListener*>::iterator I =
|
|
|
|
std::find(Listeners->begin(), Listeners->end(), this);
|
|
|
|
assert(Listeners && I != Listeners->end() &&
|
|
|
|
"PassRegistrationListener not registered!");
|
|
|
|
Listeners->erase(I);
|
|
|
|
|
|
|
|
if (Listeners->empty()) {
|
|
|
|
delete Listeners;
|
|
|
|
Listeners = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// enumeratePasses - Iterate over the registered passes, calling the
|
|
|
|
// passEnumerate callback on each PassInfo object.
|
|
|
|
//
|
|
|
|
void PassRegistrationListener::enumeratePasses() {
|
|
|
|
if (PassInfoMap)
|
|
|
|
for (std::map<TypeInfo, PassInfo*>::iterator I = PassInfoMap->begin(),
|
|
|
|
E = PassInfoMap->end(); I != E; ++I)
|
|
|
|
passEnumerate(I->second);
|
|
|
|
}
|