/external/clang/lib/Analysis/ |
H A D | ThreadSafetyTIL.cpp | 165 // Each block will be written into the Blocks array in order, and its BlockID 168 int BasicBlock::topologicalSort(SimpleArray<BasicBlock*>& Blocks, int ID) { argument 172 ID = Block->topologicalSort(Blocks, ID); 177 Blocks[BlockID] = this; 191 int BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock*>& Blocks, int ID) { argument 197 ID = DominatorNode.Parent->topologicalFinalSort(Blocks, ID); 199 ID = Pred->topologicalFinalSort(Blocks, ID); 200 assert(static_cast<size_t>(ID) < Blocks.size()); 202 Blocks[BlockID] = this; 264 for (auto *Block : Blocks) [all...] |
H A D | PostOrderCFGView.cpp | 21 Blocks.reserve(cfg->getNumBlockIDs()); 26 BlockOrder[*I] = Blocks.size() + 1; 27 Blocks.push_back(*I);
|
/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/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/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 | 116 /// @param Blocks Array of block numbers that prefer to spill in and out. 118 void addPrefSpill(ArrayRef<unsigned> Blocks, bool Strong);
|
H A D | InterferenceCache.cpp | 101 Blocks.resize(MF->getNumBlockIDs()); 148 BlockInterference *BI = &Blocks[MBBNum]; 200 BI = &Blocks[MBBNum];
|
H A D | SpillPlacement.cpp | 264 void SpillPlacement::addPrefSpill(ArrayRef<unsigned> Blocks, bool Strong) { argument 265 for (ArrayRef<unsigned>::iterator I = Blocks.begin(), E = Blocks.end();
|
/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/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/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 | 77 // Blocks - The list of blocks in this loop. First entry is the header node. 78 std::vector<BlockT*> Blocks; member in class:llvm::LoopBase 103 BlockT *getHeader() const { return Blocks.front(); } 146 const std::vector<BlockT*> &getBlocks() const { return Blocks; } 148 block_iterator block_begin() const { return Blocks.begin(); } 149 block_iterator block_end() const { return Blocks.end(); } 153 return Blocks.size(); 294 Blocks.push_back(BB); 298 /// reverseBlocks - interface to reverse Blocks[from, end of loop] in this loop 300 std::reverse(Blocks [all...] |
/external/llvm/lib/IR/ |
H A D | GCOV.cpp | 162 Blocks.push_back(make_unique<GCOVBlock>(*this, i)); 183 Edges.push_back(make_unique<GCOVEdge>(*Blocks[BlockNo], *Blocks[Dst])); 185 Blocks[BlockNo]->addDstEdge(Edge); 186 Blocks[Dst]->addSrcEdge(Edge); 208 GCOVBlock &Block = *Blocks[BlockNo]; 306 if (BlockNo >= Blocks.size()) { 310 if (BlockNo == Blocks.size() - 1) 312 GCOVBlock &Block = *Blocks[BlockNo]; 333 return Blocks [all...] |
/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 (BasicBlock *BB : Blocks) 512 std::vector<const BasicBlock*> Blocks; local 516 Blocks.push_back(FI); 517 unsigned OldSize = 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 | 840 CFGBlock & front() { return *Blocks.front(); } 841 CFGBlock & back() { return *Blocks.back(); } 843 iterator begin() { return Blocks.begin(); } 844 iterator end() { return Blocks.end(); } 845 const_iterator begin() const { return Blocks.begin(); } 846 const_iterator end() const { return Blocks.end(); } 848 graph_iterator nodes_begin() { return graph_iterator(Blocks.begin()); } 849 graph_iterator nodes_end() { return graph_iterator(Blocks.end()); } 851 return const_graph_iterator(Blocks.begin()); 854 return const_graph_iterator(Blocks 971 CFGBlockListTy Blocks; member in class:clang::CFGBlock::CFG [all...] |
/external/llvm/include/llvm/Support/ |
H A D | GCOV.h | 267 size_t getNumBlocks() const { return Blocks.size(); } 271 BlockIterator block_begin() const { return Blocks.begin(); } 272 BlockIterator block_end() const { return Blocks.end(); } 287 SmallVector<std::unique_ptr<GCOVBlock>, 16> Blocks; member in class:llvm::GCOVFunction 372 BlockLines Blocks; member in struct:llvm::FileInfo::LineData 399 LineInfo[Filename].Blocks[Line - 1].push_back(Block);
|
/external/llvm/include/llvm/ADT/ |
H A D | PostOrderIterator.h | 284 std::vector<NodeType*> Blocks; // Block list in normal PO order member in class:llvm::ReversePostOrderTraversal 286 std::copy(po_begin(BB), po_end(BB), std::back_inserter(Blocks)); 294 rpo_iterator begin() { return Blocks.rbegin(); } 295 rpo_iterator end() { return Blocks.rend(); }
|
/external/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/clang/include/clang/AST/ |
H A D | Comment.h | 1098 ArrayRef<BlockContentComment *> Blocks; member in class:clang::comments::ParamCommandComment::FullComment 1102 FullComment(ArrayRef<BlockContentComment *> Blocks, DeclInfo *D) : argument 1104 Blocks(Blocks), ThisDeclInfo(D) { 1105 if (Blocks.empty()) 1108 setSourceRange(SourceRange(Blocks.front()->getLocStart(), 1109 Blocks.back()->getLocEnd())); 1110 setLocation(Blocks.front()->getLocStart()); 1118 return reinterpret_cast<child_iterator>(Blocks.begin()); 1122 return reinterpret_cast<child_iterator>(Blocks [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | DeadStoreElimination.cpp | 629 static void FindUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks, argument 639 Blocks.push_back(Pred); 649 SmallVector<BasicBlock *, 16> Blocks; local 650 Blocks.push_back(F->getParent()); 653 while (!Blocks.empty()) { 654 BasicBlock *BB = Blocks.pop_back_val(); 687 FindUnconditionalPreds(Blocks, BB, DT);
|
/external/v8/src/x87/ |
H A D | lithium-gap-resolver-x87.cc | 88 if (other_move.Blocks(destination) && !other_move.IsPending()) { 118 if (other_move.Blocks(destination)) { 424 if (other_move.Blocks(source)) { 426 } else if (other_move.Blocks(destination)) {
|
/external/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 122 DenseMap<BasicBlock*, BasicBlock*> Blocks; member in class:__anon11161::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;
|