/external/llvm/include/llvm/IR/ |
H A D | InstIterator.h | 35 BB_t *BBs; // BasicBlocksType member in class:llvm::InstIterator 51 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} 55 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} 58 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor 59 if (BB != BBs->end()) { 66 : BBs(&m.getBasicBlockList()), BB(BBs [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
H A D | InstIterator.h | 36 _BB_t *BBs; // BasicBlocksType member in class:llvm::InstIterator 52 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} 56 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} 59 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor 60 if (BB != BBs->end()) { 67 : BBs(&m.getBasicBlockList()), BB(BBs [all...] |
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | DominanceFrontier.cpp | 120 const std::set<BasicBlock*> &BBs = I->second; local 122 for (std::set<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end();
|
/external/llvm/include/llvm/Analysis/ |
H A D | DominanceFrontierImpl.h | 131 const std::set<BlockT *> &BBs = I->second; local 133 for (const BlockT *BB : BBs) {
|
/external/llvm/lib/CodeGen/ |
H A D | ShrinkWrap.cpp | 259 MachineBasicBlock *FindIDom(MachineBasicBlock &Block, ListOfBBs BBs, argument 262 for (MachineBasicBlock *BB : BBs) {
|
/external/swiftshader/third_party/LLVM/tools/bugpoint/ |
H A D | CrashDebugger.cpp | 272 bool ReduceCrashingBlocks::TestBlocks(std::vector<const BasicBlock*> &BBs) {
argument 279 for (unsigned i = 0, e = BBs.size(); i != e; ++i)
280 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]]));
286 outs() << " " << BBs[i]->getName();
340 BBs.clear();
347 BBs.push_back(cast<BasicBlock>(V));
|
H A D | ExtractFunction.cpp | 312 /// cloned from the one the BBs are in, so some mapping needs to be performed.
316 std::vector<BasicBlock*> &BBs,
337 for (std::vector<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end();
315 ExtractMappedBlocksFromModule(const std::vector<BasicBlock*> &BBs, Module *M) argument
|
H A D | Miscompilation.cpp | 455 bool TestFuncs(const std::vector<BasicBlock*> &BBs, std::string &Error);
462 bool ReduceMiscompiledBlocks::TestFuncs(const std::vector<BasicBlock*> &BBs,
argument 467 if (!BBs.empty()) {
468 outs() << "but these " << BBs.size() << " blocks are extracted: ";
469 for (unsigned i = 0, e = BBs.size() < 10 ? BBs.size() : 10; i != e; ++i)
470 outs() << BBs[i]->getName() << " ";
471 if (BBs.size() > 10) outs() << "...";
487 for (unsigned i = 0, e = BBs.size(); i != e; ++i) {
488 BasicBlock *BB = cast<BasicBlock>(VMap[BBs[ [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | ConstantHoisting.cpp | 148 SmallPtrSet<BasicBlock *, 8> BBs; local 151 BBs.insert(findMatInsertPt(U.Inst, U.OpndIdx)->getParent()); 153 if (BBs.count(Entry)) 156 while (BBs.size() >= 2) { 158 BB1 = *BBs.begin(); 159 BB2 = *std::next(BBs.begin()); 163 BBs.erase(BB1); 164 BBs.erase(BB2); 165 BBs.insert(BB); 167 assert((BBs [all...] |
H A D | PlaceSafepoints.cpp | 651 DenseSet<BasicBlock *> BBs; // new BBs + insertee local 662 scanInlinedCode(&*Start, &*After, Calls, BBs);
|
H A D | InductiveRangeCheckElimination.cpp | 562 // blocks denoted by BBs to this loops parent loop if required. 563 void addToParentLoopIfNeeded(ArrayRef<BasicBlock *> BBs); 1139 void LoopConstrainer::addToParentLoopIfNeeded(ArrayRef<BasicBlock *> BBs) { argument 1144 for (BasicBlock *BB : BBs)
|
/external/llvm/tools/bugpoint/ |
H A D | CrashDebugger.cpp | 347 bool ReduceCrashingBlocks::TestBlocks(std::vector<const BasicBlock*> &BBs) { argument 354 for (unsigned i = 0, e = BBs.size(); i != e; ++i) 355 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]])); 361 outs() << " " << BBs[i]->getName(); 415 BBs.clear(); 422 BBs.push_back(cast<BasicBlock>(V));
|
H A D | ExtractFunction.cpp | 375 BugDriver::extractMappedBlocksFromModule(const std::vector<BasicBlock *> &BBs, argument 390 for (std::vector<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end();
|
H A D | Miscompilation.cpp | 471 bool TestFuncs(const std::vector<BasicBlock*> &BBs, std::string &Error); 478 bool ReduceMiscompiledBlocks::TestFuncs(const std::vector<BasicBlock*> &BBs, argument 483 if (!BBs.empty()) { 484 outs() << "but these " << BBs.size() << " blocks are extracted: "; 485 for (unsigned i = 0, e = BBs.size() < 10 ? BBs.size() : 10; i != e; ++i) 486 outs() << BBs[i]->getName() << " "; 487 if (BBs.size() > 10) outs() << "..."; 503 for (unsigned i = 0, e = BBs.size(); i != e; ++i) { 504 BasicBlock *BB = cast<BasicBlock>(VMap[BBs[ [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | CodeExtractor.cpp | 106 buildExtractionBlockSet(ArrayRef<BasicBlock *> BBs) { argument 107 return buildExtractionBlockSet(BBs.begin(), BBs.end()); 126 CodeExtractor::CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT, argument 129 Blocks(buildExtractionBlockSet(BBs)), NumExitBlocks(~0U) {}
|
/external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
H A D | CodeExtractor.cpp | 794 Function* llvm::ExtractBasicBlock(ArrayRef<BasicBlock*> BBs, bool AggregateArgs){ argument 795 return CodeExtractor(0, AggregateArgs).ExtractCodeRegion(BBs);
|
/external/llvm/lib/Transforms/IPO/ |
H A D | MergeFunctions.cpp | 429 /// to BBs and other ways of implementation (see below). 437 /// fact BBs are ordered in function. And since cmpValues are called during 438 /// this walk, the numbering depends only on how BBs located inside the CFG. 447 /// could be operands from further BBs we didn't scan yet. 769 // They are BBs in the same function. Order by which comes first in the 1327 // the strategy compare() uses to compare functions by walking the BBs in depth 1338 SmallVector<const BasicBlock *, 8> BBs; local 1343 BBs.push_back(&F.getEntryBlock()); 1344 VisitedBBs.insert(BBs[0]); 1345 while (!BBs [all...] |
/external/clang/lib/CodeGen/ |
H A D | CGBuiltin.cpp | 1443 llvm::BasicBlock *BBs[5] = { local 1456 llvm::SwitchInst *SI = Builder.CreateSwitch(Order, BBs[0]); 1462 Builder.SetInsertPoint(BBs[i]); 1466 Result->addIncoming(RMW, BBs[i]); 1470 SI->addCase(Builder.getInt32(0), BBs[0]); 1471 SI->addCase(Builder.getInt32(1), BBs[1]); 1472 SI->addCase(Builder.getInt32(2), BBs[1]); 1473 SI->addCase(Builder.getInt32(3), BBs[2]); 1474 SI->addCase(Builder.getInt32(4), BBs[3]); 1475 SI->addCase(Builder.getInt32(5), BBs[ 1511 llvm::BasicBlock *BBs[3] = { local [all...] |