Searched refs:BBMap (Results 1 - 4 of 4) sorted by relevance

/external/llvm/include/llvm/Analysis/
H A DLoopInfo.h507 // BBMap - Mapping of basic blocks to the inner most loop they occur in
508 DenseMap<const BlockT *, LoopT *> BBMap; member in class:llvm::LoopInfoBase
520 : BBMap(std::move(Arg.BBMap)),
526 BBMap = std::move(RHS.BBMap);
536 BBMap.clear();
558 LoopT *getLoopFor(const BlockT *BB) const { return BBMap.lookup(BB); }
596 BBMap.erase(BB);
599 BBMap[B
[all...]
H A DLoopInfoImpl.h196 LIB.BBMap[NewBB] = L;
512 for (DenseMap<BasicBlock*, LoopT*>::const_iterator I = BBMap.begin(),
513 E = BBMap.end(); I != E; ++I)
529 for (auto &Entry : BBMap) {
/external/llvm/lib/Transforms/Utils/
H A DAddDiscriminators.cpp190 auto &BBMap = LBM[L]; local
191 auto R = BBMap.insert(std::make_pair(&B, (Metadata *)nullptr));
192 if (BBMap.size() == 1)
/external/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h68 BBMapTy BBMap; member in class:llvm::SSAUpdaterImpl
95 return BBMap[BB]->DefBB->AvailableVal;
107 BBMap[BB] = Info;
128 // Check if BBMap already has a BBInfo for the predecessor block.
130 BBMap.FindAndConstruct(Pred);
187 BBInfo *SuccInfo = BBMap[*SI];
396 /// in the BBMap.
402 BBMap[PHI->getParent()]->PHITag = PHI;
411 BBInfo *PredInfo = BBMap[I.getIncomingBlock()];
443 /// the BBMap an
[all...]

Completed in 143 milliseconds