| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| D | InstIterator.h | 36 _BB_t *BBs; // BasicBlocksType variable
52 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
56 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
59 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor in InstIterator()
60 if (BB != BBs->end()) { in InstIterator()
67 : BBs(&m.getBasicBlockList()), BB(BBs->end()) { // end ctor in InstIterator()
78 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
94 while (BB == BBs->end() || BI == BB->begin()) {
105 inline bool atEnd() const { return BB == BBs->end(); } in atEnd()
113 if (BB == BBs->end()) break; in advanceToNextBB()
|
| /external/llvm/include/llvm/IR/ |
| D | InstIterator.h | 35 BB_t *BBs; // BasicBlocksType variable
51 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
55 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
58 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor in InstIterator()
59 if (BB != BBs->end()) { in InstIterator()
66 : BBs(&m.getBasicBlockList()), BB(BBs->end()) { // end ctor in InstIterator()
77 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
93 while (BB == BBs->end() || BI == BB->begin()) {
104 inline bool atEnd() const { return BB == BBs->end(); } in atEnd()
112 if (BB == BBs->end()) break; in advanceToNextBB()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | ConstantHoisting.cpp | 148 SmallPtrSet<BasicBlock *, 8> BBs; in findConstantInsertionPoint() local
151 BBs.insert(findMatInsertPt(U.Inst, U.OpndIdx)->getParent()); in findConstantInsertionPoint()
153 if (BBs.count(Entry)) in findConstantInsertionPoint()
156 while (BBs.size() >= 2) { in findConstantInsertionPoint()
158 BB1 = *BBs.begin(); in findConstantInsertionPoint()
159 BB2 = *std::next(BBs.begin()); in findConstantInsertionPoint()
163 BBs.erase(BB1); in findConstantInsertionPoint()
164 BBs.erase(BB2); in findConstantInsertionPoint()
165 BBs.insert(BB); in findConstantInsertionPoint()
167 assert((BBs.size() == 1) && "Expected only one element."); in findConstantInsertionPoint()
[all …]
|
| /external/swiftshader/third_party/LLVM/test/CodeGen/ARM/ |
| D | 2011-04-27-IfCvtBug.ll | 3 ; If converter was being too cute. It look for root BBs (which don't have
4 ; successors) and use inverse depth first search to traverse the BBs. However
6 ; traversal of all BBs work just fine.
|
| /external/llvm/test/CodeGen/ARM/ |
| D | 2011-04-27-IfCvtBug.ll | 3 ; If converter was being too cute. It look for root BBs (which don't have
4 ; successors) and use inverse depth first search to traverse the BBs. However
6 ; traversal of all BBs work just fine.
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| D | DominanceFrontier.cpp | 120 const std::set<BasicBlock*> &BBs = I->second; in print() local
122 for (std::set<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end(); in print()
|
| D | RegionInfo.cpp | 808 RegionInfo::getCommonRegion(SmallVectorImpl<BasicBlock*> &BBs) const { in getCommonRegion()
809 Region* ret = getRegionFor(BBs.back()); in getCommonRegion()
810 BBs.pop_back(); in getCommonRegion()
812 for (SmallVectorImpl<BasicBlock*>::const_iterator I = BBs.begin(), in getCommonRegion()
813 E = BBs.end(); I != E; ++I) in getCommonRegion()
|
| /external/swiftshader/third_party/LLVM/tools/bugpoint/ |
| D | Miscompilation.cpp | 455 bool TestFuncs(const std::vector<BasicBlock*> &BBs, std::string &Error);
462 bool ReduceMiscompiledBlocks::TestFuncs(const std::vector<BasicBlock*> &BBs, in TestFuncs() argument
467 if (!BBs.empty()) { in TestFuncs()
468 outs() << "but these " << BBs.size() << " blocks are extracted: "; in TestFuncs()
469 for (unsigned i = 0, e = BBs.size() < 10 ? BBs.size() : 10; i != e; ++i) in TestFuncs()
470 outs() << BBs[i]->getName() << " "; in TestFuncs()
471 if (BBs.size() > 10) outs() << "..."; in TestFuncs()
487 for (unsigned i = 0, e = BBs.size(); i != e; ++i) { in TestFuncs()
488 BasicBlock *BB = cast<BasicBlock>(VMap[BBs[i]]); in TestFuncs()
|
| D | CrashDebugger.cpp | 272 bool ReduceCrashingBlocks::TestBlocks(std::vector<const BasicBlock*> &BBs) { in TestBlocks() argument
279 for (unsigned i = 0, e = BBs.size(); i != e; ++i) in TestBlocks()
280 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]])); in TestBlocks()
286 outs() << " " << BBs[i]->getName(); in TestBlocks()
340 BBs.clear(); in TestBlocks()
347 BBs.push_back(cast<BasicBlock>(V)); in TestBlocks()
|
| D | ExtractFunction.cpp | 316 std::vector<BasicBlock*> &BBs, in ExtractMappedBlocksFromModule() argument
337 for (std::vector<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end(); in ExtractMappedBlocksFromModule()
|
| /external/llvm/tools/bugpoint/ |
| D | Miscompilation.cpp | 471 bool TestFuncs(const std::vector<BasicBlock*> &BBs, std::string &Error);
478 bool ReduceMiscompiledBlocks::TestFuncs(const std::vector<BasicBlock*> &BBs, in TestFuncs() argument
483 if (!BBs.empty()) { in TestFuncs()
484 outs() << "but these " << BBs.size() << " blocks are extracted: "; in TestFuncs()
485 for (unsigned i = 0, e = BBs.size() < 10 ? BBs.size() : 10; i != e; ++i) in TestFuncs()
486 outs() << BBs[i]->getName() << " "; in TestFuncs()
487 if (BBs.size() > 10) outs() << "..."; in TestFuncs()
503 for (unsigned i = 0, e = BBs.size(); i != e; ++i) { in TestFuncs()
504 BasicBlock *BB = cast<BasicBlock>(VMap[BBs[i]]); in TestFuncs()
|
| D | CrashDebugger.cpp | 347 bool ReduceCrashingBlocks::TestBlocks(std::vector<const BasicBlock*> &BBs) { in TestBlocks() argument
354 for (unsigned i = 0, e = BBs.size(); i != e; ++i) in TestBlocks()
355 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]])); in TestBlocks()
361 outs() << " " << BBs[i]->getName(); in TestBlocks()
415 BBs.clear(); in TestBlocks()
422 BBs.push_back(cast<BasicBlock>(V)); in TestBlocks()
|
| D | ExtractFunction.cpp | 375 BugDriver::extractMappedBlocksFromModule(const std::vector<BasicBlock *> &BBs, in extractMappedBlocksFromModule() argument
390 for (std::vector<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end(); in extractMappedBlocksFromModule()
|
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| D | nv50_ir_bb.cpp | 70 for (ArrayList::Iterator BBs = allBBlocks.iterator(); !BBs.end(); BBs.next()) in ~Function() local
71 delete reinterpret_cast<BasicBlock *>(BBs.get()); in ~Function()
|
| /external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/ |
| D | FunctionUtils.h | 41 Function* ExtractBasicBlock(ArrayRef<BasicBlock*> BBs,
|
| /external/llvm/lib/Transforms/Utils/ |
| D | CodeExtractor.cpp | 106 buildExtractionBlockSet(ArrayRef<BasicBlock *> BBs) { in buildExtractionBlockSet() argument
107 return buildExtractionBlockSet(BBs.begin(), BBs.end()); in buildExtractionBlockSet()
126 CodeExtractor::CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT, in CodeExtractor() argument
129 Blocks(buildExtractionBlockSet(BBs)), NumExitBlocks(~0U) {} in CodeExtractor()
|
| /external/llvm/include/llvm/Analysis/ |
| D | DominanceFrontierImpl.h | 131 const std::set<BlockT *> &BBs = I->second; in print() local
133 for (const BlockT *BB : BBs) { in print()
|
| D | RegionInfoImpl.h | 898 RegionInfoBase<Tr>::getCommonRegion(SmallVectorImpl<BlockT *> &BBs) const { in getCommonRegion() argument
899 RegionT *ret = getRegionFor(BBs.back()); in getCommonRegion()
900 BBs.pop_back(); in getCommonRegion()
902 for (BlockT *BB : BBs) in getCommonRegion()
|
| /external/llvm/test/CodeGen/X86/ |
| D | fast-isel-branch_weights.ll | 4 ; Test if the BBs are reordred according to their branch weights.
|
| /external/llvm/test/CodeGen/AArch64/ |
| D | fast-isel-branch_weights.ll | 4 ; Test if the BBs are reordred according to their branch weights.
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | CodeExtractor.h | 69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
|
| /external/swiftshader/third_party/LLVM/docs/HistoricalNotes/ |
| D | 2003-06-25-Reoptimizer1.txt | 41 3) Mark BBs which end in edges that exit the hot region; we need to
55 Find the BBs that total 90% or more of execution, and aggregate them
99 because we might need to put in fixup code for exit BBs.
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2003-06-25-Reoptimizer1.txt | 41 3) Mark BBs which end in edges that exit the hot region; we need to
55 Find the BBs that total 90% or more of execution, and aggregate them
99 because we might need to put in fixup code for exit BBs.
|
| /external/llvm/lib/CodeGen/ |
| D | ShrinkWrap.cpp | 259 MachineBasicBlock *FindIDom(MachineBasicBlock &Block, ListOfBBs BBs, in FindIDom() argument
262 for (MachineBasicBlock *BB : BBs) { in FindIDom()
|
| /external/llvm/test/Transforms/CorrelatedValuePropagation/ |
| D | icmp.ll | 35 ; get %tmp36 from both true and false BBs.
|