/freebsd-10.2-release/contrib/llvm/include/llvm/MC/ |
H A D | MCFunction.h | 92 BasicBlockListTy Blocks; member in class:llvm::MCFunction 120 bool empty() const { return Blocks.empty(); } 124 const_iterator begin() const { return Blocks.begin(); } 125 iterator begin() { return Blocks.begin(); } 126 const_iterator end() const { return Blocks.end(); } 127 iterator end() { return Blocks.end(); } 129 const MCBasicBlock* front() const { return Blocks.front(); } 130 MCBasicBlock* front() { return Blocks.front(); } 131 const MCBasicBlock* back() const { return Blocks.back(); } 132 MCBasicBlock* back() { return Blocks [all...] |
/freebsd-10.2-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | EdgeBundles.h | 34 /// Blocks - Map each bundle to a list of basic block numbers. 35 SmallVector<SmallVector<unsigned, 8>, 4> Blocks; member in class:llvm::EdgeBundles 49 ArrayRef<unsigned> getBlocks(unsigned Bundle) const { return Blocks[Bundle]; }
|
/freebsd-10.2-release/contrib/llvm/lib/CodeGen/ |
H A D | EdgeBundles.cpp | 58 Blocks.clear(); 59 Blocks.resize(getNumBundles()); 64 Blocks[b0].push_back(i); 66 Blocks[b1].push_back(i);
|
H A D | InterferenceCache.h | 89 /// Blocks - Interference for each block in the function. 90 SmallVector<BlockInterference, 8> Blocks; member in class:llvm::InterferenceCache::Entry 92 /// update - Recompute Blocks[MBBNum] 125 if (Blocks[MBBNum].Tag != Tag) 127 return &Blocks[MBBNum];
|
H A D | SpillPlacement.h | 110 /// @param Blocks Array of block numbers that prefer to spill in and out. 112 void addPrefSpill(ArrayRef<unsigned> Blocks, bool Strong);
|
H A D | InterferenceCache.cpp | 83 Blocks.resize(MF->getNumBlockIDs()); 130 BlockInterference *BI = &Blocks[MBBNum]; 182 BI = &Blocks[MBBNum];
|
H A D | SpillPlacement.cpp | 253 void SpillPlacement::addPrefSpill(ArrayRef<unsigned> Blocks, bool Strong) { argument 254 for (ArrayRef<unsigned>::iterator I = Blocks.begin(), E = Blocks.end();
|
H A D | MachineBlockPlacement.cpp | 84 SmallVector<MachineBasicBlock *, 4> Blocks; member in class:__anon2273::BlockChain 101 : Blocks(1, BB), BlockToChain(BlockToChain), LoopPredecessors(0) { 110 iterator begin() { return Blocks.begin(); } 113 iterator end() { return Blocks.end(); } 123 assert(!Blocks.empty()); 128 Blocks.push_back(BB); 140 Blocks.push_back(*BI);
|
/freebsd-10.2-release/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/ |
H A D | PostOrderCFGView.h | 73 std::vector<const CFGBlock*> Blocks; member in class:clang::PostOrderCFGView 83 iterator begin() { return Blocks.rbegin(); } 84 iterator end() { return Blocks.rend(); }
|
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | PostOrderCFGView.cpp | 21 Blocks.reserve(cfg->getNumBlockIDs()); 26 BlockOrder[*I] = Blocks.size() + 1; 27 Blocks.push_back(*I);
|
/freebsd-10.2-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | FunctionSummary.h | 96 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks; local 98 if (TotalIDs > Blocks.size()) { 99 Blocks.resize(TotalIDs); 102 Blocks.set(ID); 97 assert(ID < TotalIDs); if (TotalIDs > Blocks.size()) argument
|
/freebsd-10.2-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | CodeExtractor.cpp | 122 Blocks(buildExtractionBlockSet(BB)), NumExitBlocks(~0U) {} 127 Blocks(buildExtractionBlockSet(BBs)), NumExitBlocks(~0U) {} 131 Blocks(buildExtractionBlockSet(L.getBlocks())), NumExitBlocks(~0U) {} 136 Blocks(buildExtractionBlockSet(RN)), NumExitBlocks(~0U) {} 140 static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { argument 142 if (Blocks.count(I->getParent())) 150 static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { argument 153 if (!Blocks.count(I->getParent())) 160 for (SetVector<BasicBlock *>::const_iterator I = Blocks.begin(), 161 E = Blocks [all...] |
/freebsd-10.2-release/contrib/llvm/include/llvm/Transforms/Utils/ |
H A D | CodeExtractor.h | 52 SetVector<BasicBlock *> Blocks; member in class:llvm::CodeExtractor 95 bool isEligible() const { return !Blocks.empty(); }
|
/freebsd-10.2-release/contrib/llvm/lib/IR/ |
H A D | GCOV.cpp | 108 DeleteContainerPointers(Blocks); 138 if (Line >= Blocks.size()) { 142 GCOVBlock &Block = *Blocks[Line]; 168 Blocks.push_back(new GCOVBlock(*this, i)); 185 Blocks[BlockNo]->addEdge(Dst); 201 GCOVBlock *Block = Blocks[BlockNo]; 226 for (SmallVectorImpl<GCOVBlock *>::iterator I = Blocks.begin(), 227 E = Blocks.end(); I != E; ++I) 234 for (SmallVectorImpl<GCOVBlock *>::iterator I = Blocks.begin(), 235 E = Blocks [all...] |
/freebsd-10.2-release/contrib/llvm/include/llvm/Analysis/ |
H A D | LoopInfo.h | 69 // Blocks - The list of blocks in this loop. First entry is the header node. 70 std::vector<BlockT*> Blocks; member in class:llvm::LoopBase 95 BlockT *getHeader() const { return Blocks.front(); } 138 const std::vector<BlockT*> &getBlocks() const { return Blocks; } 140 block_iterator block_begin() const { return Blocks.begin(); } 141 block_iterator block_end() const { return Blocks.end(); } 145 return Blocks.size(); 274 Blocks.push_back(BB); 278 /// reverseBlocks - interface to reverse Blocks[from, end of loop] in this loop 280 std::reverse(Blocks [all...] |
/freebsd-10.2-release/contrib/llvm/tools/bugpoint/ |
H A D | CrashDebugger.cpp | 276 SmallPtrSet<BasicBlock*, 8> Blocks; local 278 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]])); 281 unsigned NumPrint = Blocks.size(); 285 if (NumPrint < Blocks.size()) 286 outs() << "... <" << Blocks.size() << " total>"; 292 if (!Blocks.count(BB) && BB->getTerminator()->getNumSuccessors()) { 315 for (SmallPtrSet<BasicBlock*, 8>::iterator I = Blocks.begin(), 316 E = Blocks.end(); I != E; ++I) 514 std::vector<const BasicBlock*> Blocks; local 518 Blocks [all...] |
H A D | Miscompilation.cpp | 561 std::vector<BasicBlock*> Blocks; 565 Blocks.push_back(I); 568 // obscuring the bug. The Blocks list will end up containing blocks that must 570 unsigned OldSize = Blocks.size(); 578 Blocks.clear(); 581 MiscompiledFunctions).reduceList(Blocks, Error); 584 if (Blocks.size() == OldSize) 593 Module *Extracted = BD.ExtractMappedBlocksFromModule(Blocks, ToExtract);
|
/freebsd-10.2-release/contrib/llvm/tools/clang/include/clang/Analysis/ |
H A D | CFG.h | 738 CFGBlock & front() { return *Blocks.front(); } 739 CFGBlock & back() { return *Blocks.back(); } 741 iterator begin() { return Blocks.begin(); } 742 iterator end() { return Blocks.end(); } 743 const_iterator begin() const { return Blocks.begin(); } 744 const_iterator end() const { return Blocks.end(); } 746 graph_iterator nodes_begin() { return graph_iterator(Blocks.begin()); } 747 graph_iterator nodes_end() { return graph_iterator(Blocks.end()); } 749 return const_graph_iterator(Blocks.begin()); 752 return const_graph_iterator(Blocks 868 CFGBlockListTy Blocks; member in class:clang::CFGBlock::CFG [all...] |
/freebsd-10.2-release/contrib/llvm/lib/MC/ |
H A D | MCFunction.cpp | 30 Blocks.push_back(MCBB);
|
/freebsd-10.2-release/contrib/llvm/include/llvm/ADT/ |
H A D | PostOrderIterator.h | 261 std::vector<NodeType*> Blocks; // Block list in normal PO order member in class:llvm::ReversePostOrderTraversal 263 std::copy(po_begin(BB), po_end(BB), std::back_inserter(Blocks)); 273 inline rpo_iterator begin() { return Blocks.rbegin(); } 274 inline rpo_iterator end() { return Blocks.rend(); }
|
/freebsd-10.2-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | Comment.h | 1077 ArrayRef<BlockContentComment *> Blocks; member in class:clang::comments::ParamCommandComment::FullComment 1081 FullComment(ArrayRef<BlockContentComment *> Blocks, DeclInfo *D) : argument 1083 Blocks(Blocks), ThisDeclInfo(D) { 1084 if (Blocks.empty()) 1087 setSourceRange(SourceRange(Blocks.front()->getLocStart(), 1088 Blocks.back()->getLocEnd())); 1089 setLocation(Blocks.front()->getLocStart()); 1097 return reinterpret_cast<child_iterator>(Blocks.begin()); 1101 return reinterpret_cast<child_iterator>(Blocks [all...] |
/freebsd-10.2-release/contrib/llvm/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 312 Blocks[BB] = new GCOVBlock(i++, os); 332 DeleteContainerSeconds(Blocks); 337 return *Blocks[BB]; 347 write(Blocks.size() + 1); 348 for (int i = 0, e = Blocks.size() + 1; i != e; ++i) { 351 DEBUG(dbgs() << Blocks.size() << " blocks.\n"); 354 if (Blocks.empty()) return; 355 Function *F = Blocks.begin()->first->getParent(); 357 GCOVBlock &Block = *Blocks[I]; 373 Blocks[ 378 DenseMap<BasicBlock *, GCOVBlock *> Blocks; member in class:__anon2743::GCOVFunction [all...] |
/freebsd-10.2-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | DeadStoreElimination.cpp | 641 static void FindUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks, argument 651 Blocks.push_back(Pred); 661 SmallVector<BasicBlock *, 16> Blocks; local 662 Blocks.push_back(F->getParent()); 664 while (!Blocks.empty()) { 665 BasicBlock *BB = Blocks.pop_back_val(); 698 FindUnconditionalPreds(Blocks, BB, DT);
|
/freebsd-10.2-release/contrib/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 122 DenseMap<BasicBlock*, BasicBlock*> Blocks; member in class:__anon3827::FunctionDifferenceEngine 129 if (!Blocks.count(*I)) Count++; 157 BasicBlock *&Ref = Blocks[L]; 390 return Blocks[cast<BlockAddress>(L)->getBasicBlock()] 446 return Blocks[cast<BasicBlock>(L)] != R;
|
/freebsd-10.2-release/contrib/llvm/tools/lldb/include/lldb/Symbol/ |
H A D | SymbolFile.h | 38 Blocks = (1u << 3), enumerator in enum:lldb_private::SymbolFile::Abilities
|