/external/llvm/include/llvm/MC/MCAnalysis/ |
H A D | MCFunction.h | 93 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().get(); } 130 MCBasicBlock* front() { return Blocks.front().get(); } 131 const MCBasicBlock* back() const { return Blocks.back().get(); } 132 MCBasicBlock* back() { return Blocks [all...] |
/external/clang/include/clang/Analysis/Analyses/ |
H A D | PostOrderCFGView.h | 73 std::vector<const CFGBlock*> Blocks; member in class:clang::PostOrderCFGView 84 iterator begin() { return Blocks.rbegin(); } 85 iterator end() { return Blocks.rend(); } 87 const_iterator begin() const { return Blocks.rbegin(); } 88 const_iterator end() const { return Blocks.rend(); }
|
/external/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]; }
|
/external/llvm/lib/CodeGen/ |
H A D | EdgeBundles.cpp | 56 Blocks.clear(); 57 Blocks.resize(getNumBundles()); 62 Blocks[b0].push_back(i); 64 Blocks[b1].push_back(i);
|
H A D | InterferenceCache.h | 90 /// Blocks - Interference for each block in the function. 91 SmallVector<BlockInterference, 8> Blocks; member in class:llvm::InterferenceCache::Entry 93 /// update - Recompute Blocks[MBBNum] 126 if (Blocks[MBBNum].Tag != Tag) 128 return &Blocks[MBBNum];
|
H A D | SpillPlacement.h | 112 /// @param Blocks Array of block numbers that prefer to spill in and out. 114 void addPrefSpill(ArrayRef<unsigned> Blocks, bool Strong);
|
/external/clang/lib/Analysis/ |
H A D | PostOrderCFGView.cpp | 21 Blocks.reserve(cfg->getNumBlockIDs()); 26 BlockOrder[*I] = Blocks.size() + 1; 27 Blocks.push_back(*I);
|
/external/chromium_org/v8/src/compiler/ |
H A D | gap-resolver.cc | 76 if (other->Blocks(destination) && !other->IsPending()) { 107 std::bind2nd(std::mem_fun_ref(&MoveOperands::Blocks), destination)); 127 if (other->Blocks(source)) { 129 } else if (other->Blocks(destination)) {
|
/external/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
|
/external/llvm/lib/Transforms/Utils/ |
H A D | CodeExtractor.cpp | 124 Blocks(buildExtractionBlockSet(BB)), NumExitBlocks(~0U) {} 129 Blocks(buildExtractionBlockSet(BBs)), NumExitBlocks(~0U) {} 133 Blocks(buildExtractionBlockSet(L.getBlocks())), NumExitBlocks(~0U) {} 138 Blocks(buildExtractionBlockSet(RN)), NumExitBlocks(~0U) {} 142 static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { argument 144 if (Blocks.count(I->getParent())) 152 static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { argument 155 if (!Blocks.count(I->getParent())) 162 for (SetVector<BasicBlock *>::const_iterator I = Blocks.begin(), 163 E = Blocks [all...] |
/external/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(); }
|
/external/llvm/include/llvm/Analysis/ |
H A D | LoopInfo.h | 72 // Blocks - The list of blocks in this loop. First entry is the header node. 73 std::vector<BlockT*> Blocks; member in class:llvm::LoopBase 98 BlockT *getHeader() const { return Blocks.front(); } 141 const std::vector<BlockT*> &getBlocks() const { return Blocks; } 143 block_iterator block_begin() const { return Blocks.begin(); } 144 block_iterator block_end() const { return Blocks.end(); } 148 return Blocks.size(); 289 Blocks.push_back(BB); 293 /// reverseBlocks - interface to reverse Blocks[from, end of loop] in this loop 295 std::reverse(Blocks [all...] |
/external/llvm/lib/MC/MCAnalysis/ |
H A D | MCFunction.cpp | 25 Blocks.push_back(std::move(MCBB)); 26 return *Blocks.back();
|
/external/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) 515 std::vector<const BasicBlock*> Blocks; local 519 Blocks [all...] |
/external/llvm/lib/IR/ |
H A D | GCOV.cpp | 140 Blocks.push_back(make_unique<GCOVBlock>(*this, i)); 158 Edges.push_back(make_unique<GCOVEdge>(*Blocks[BlockNo], *Blocks[Dst])); 160 Blocks[BlockNo]->addDstEdge(Edge); 161 Blocks[Dst]->addSrcEdge(Edge); 180 GCOVBlock &Block = *Blocks[BlockNo]; 266 if (BlockNo >= Blocks.size()-1) { 270 GCOVBlock &Block = *Blocks[BlockNo]; 290 return Blocks.front()->getCount(); 296 return Blocks [all...] |
/external/clang/test/SemaCXX/ |
H A D | nested-name-spec-locations.cpp | 158 void bar(std::vector<int*> &Blocks) { argument 159 foo(Blocks); // expected-note{{in instantiation of}}
|
/external/clang/include/clang/Analysis/ |
H A D | CFG.h | 842 CFGBlock & front() { return *Blocks.front(); } 843 CFGBlock & back() { return *Blocks.back(); } 845 iterator begin() { return Blocks.begin(); } 846 iterator end() { return Blocks.end(); } 847 const_iterator begin() const { return Blocks.begin(); } 848 const_iterator end() const { return Blocks.end(); } 850 graph_iterator nodes_begin() { return graph_iterator(Blocks.begin()); } 851 graph_iterator nodes_end() { return graph_iterator(Blocks.end()); } 853 return const_graph_iterator(Blocks.begin()); 856 return const_graph_iterator(Blocks 973 CFGBlockListTy Blocks; member in class:clang::CFGBlock::CFG [all...] |
/external/llvm/include/llvm/Support/ |
H A D | GCOV.h | 271 size_t getNumBlocks() const { return Blocks.size(); } 275 BlockIterator block_begin() const { return Blocks.begin(); } 276 BlockIterator block_end() const { return Blocks.end(); } 287 SmallVector<std::unique_ptr<GCOVBlock>, 16> Blocks; member in class:llvm::GCOVFunction 360 BlockLines Blocks; member in struct:llvm::FileInfo::LineData 386 LineInfo[Filename].Blocks[Line-1].push_back(Block);
|
/external/chromium_org/v8/src/x64/ |
H A D | lithium-gap-resolver-x64.cc | 84 if (other_move.Blocks(destination) && !other_move.IsPending()) { 114 if (other_move.Blocks(destination)) { 307 if (other_move.Blocks(source)) { 309 } else if (other_move.Blocks(destination)) {
|
/external/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(); }
|
/external/chromium_org/net/tools/balsa/ |
H A D | balsa_headers.h | 97 typedef std::vector<BufferBlock> Blocks; typedef in class:net::BalsaBuffer 104 const char* GetPtr(Blocks::size_type block_idx) const { 110 char* GetPtr(Blocks::size_type block_idx) { 150 Blocks::size_type* block_buffer_idx); 157 char* Reserve(size_t size, Blocks::size_type* block_buffer_idx); 177 Blocks::size_type num_blocks() const { return blocks_.size(); } 195 void CleanupBlocksStartingFrom(Blocks::size_type start_idx); 198 Blocks blocks_; 270 BalsaBuffer::Blocks::size_type buffer_base_idx; 983 char* GetPtr(BalsaBuffer::Blocks [all...] |
H A D | balsa_headers.cc | 107 for (Blocks::const_iterator iter = blocks_.begin(); 145 Blocks::size_type* block_buffer_idx) { 155 Blocks::size_type* block_buffer_idx) { 160 Blocks::size_type block_idx = can_write_to_contiguous_buffer_ ? 1 : 0; 207 for (Blocks::size_type i = 0; i < blocks_.size(); ++i) { 243 void BalsaBuffer::CleanupBlocksStartingFrom(Blocks::size_type start_idx) { 244 for (Blocks::size_type i = start_idx; i < blocks_.size(); ++i) { 330 BalsaBuffer::Blocks::size_type tmp_blk_idx = firstline_buffer_base_idx_; 396 BalsaBuffer::Blocks::size_type block_buffer_idx = 0; 429 BalsaBuffer::Blocks [all...] |
/external/clang/include/clang/AST/ |
H A D | Comment.h | 1096 ArrayRef<BlockContentComment *> Blocks; member in class:clang::comments::ParamCommandComment::FullComment 1100 FullComment(ArrayRef<BlockContentComment *> Blocks, DeclInfo *D) : argument 1102 Blocks(Blocks), ThisDeclInfo(D) { 1103 if (Blocks.empty()) 1106 setSourceRange(SourceRange(Blocks.front()->getLocStart(), 1107 Blocks.back()->getLocEnd())); 1108 setLocation(Blocks.front()->getLocStart()); 1116 return reinterpret_cast<child_iterator>(Blocks.begin()); 1120 return reinterpret_cast<child_iterator>(Blocks [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | DeadStoreElimination.cpp | 643 static void FindUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks, argument 653 Blocks.push_back(Pred); 663 SmallVector<BasicBlock *, 16> Blocks; local 664 Blocks.push_back(F->getParent()); 666 while (!Blocks.empty()) { 667 BasicBlock *BB = Blocks.pop_back_val(); 700 FindUnconditionalPreds(Blocks, BB, DT);
|
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 315 Blocks[BB] = new GCOVBlock(i++, os); 327 DeleteContainerSeconds(Blocks); 332 return *Blocks[BB]; 342 Function *F = Blocks.begin()->first->getParent(); 344 GCOVBlock &Block = *Blocks[I]; 376 write(Blocks.size() + 1); 377 for (int i = 0, e = Blocks.size() + 1; i != e; ++i) { 380 DEBUG(dbgs() << Blocks.size() << " blocks.\n"); 383 if (Blocks.empty()) return; 384 Function *F = Blocks 412 DenseMap<BasicBlock *, GCOVBlock *> Blocks; member in class:__anon26255::GCOVFunction [all...] |