/external/llvm/include/llvm/Transforms/Utils/ |
CodeExtractor.h | 52 SetVector<BasicBlock *> Blocks; 63 /// \brief Create a code extractor for a sequence of blocks. 65 /// Given a sequence of basic blocks where the first block in the sequence 93 /// Based on the blocks used when constructing the code extractor, 95 bool isEligible() const { return !Blocks.empty(); }
|
/external/llvm/include/llvm/CodeGen/ |
EdgeBundles.h | 34 /// Blocks - Map each bundle to a list of basic block numbers. 35 SmallVector<SmallVector<unsigned, 8>, 4> Blocks; 48 /// getBlocks - Return an array of blocks that are connected to Bundle. 49 ArrayRef<unsigned> getBlocks(unsigned Bundle) const { return Blocks[Bundle]; }
|
/external/clang/include/clang/Analysis/Analyses/ |
PostOrderCFGView.h | 1 //===- PostOrderCFGView.h - Post order view of CFG blocks ---------*- C++ --*-// 10 // This file implements post order view of the blocks in a CFG. 64 /// This method is for tracking visited blocks in the main threadsafety 73 std::vector<const CFGBlock*> Blocks; 83 iterator begin() { return Blocks.rbegin(); } 84 iterator end() { return Blocks.rend(); }
|
/external/llvm/lib/Transforms/Scalar/ |
BasicBlockPlacement.cpp | 11 // algorithm. The idea is to put frequently executed blocks together at the 14 // function, this pass basically orders blocks in depth-first order 22 // placing the most frequently executed successor until we run out of blocks. I 39 STATISTIC(NumMoved, "Number of basic blocks moved"); 72 /// PlaceBlocks - Recursively place the specified blocks and any unplaced 93 // Recursively place all blocks. 102 /// PlaceBlocks - Recursively place the specified blocks and any unplaced 113 Function::BasicBlockListType &Blocks = BB->getParent()->getBasicBlockList(); 114 Blocks.splice(InsertPos, Blocks, BB) [all...] |
DeadStoreElimination.cpp | 61 // Only check non-dead blocks. Dead blocks may have strange pointer 598 /// Find all blocks that will unconditionally lead to the block BB and append 600 static void FindUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks, 610 Blocks.push_back(Pred); 620 SmallVector<BasicBlock *, 16> Blocks; 621 Blocks.push_back(F->getParent()); 623 while (!Blocks.empty()) { 624 BasicBlock *BB = Blocks.pop_back_val(); 657 FindUnconditionalPreds(Blocks, BB, DT) [all...] |
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
FunctionSummary.h | 34 /// Total number of blocks in the function. 37 /// Marks the IDs of the basic blocks visited during the analyzes. 76 llvm::BitVector &Blocks = I->second->VisitedBasicBlocks; 78 if (TotalIDs > Blocks.size()) { 79 Blocks.resize(TotalIDs); 82 Blocks[ID] = true; 92 /// Get the percentage of the reachable blocks.
|
/external/llvm/tools/llvm-objdump/ |
MCFunction.h | 75 MapTy Blocks; 87 iterator begin() const { return Blocks.begin(); } 88 iterator end() const { return Blocks.end(); } 93 Blocks.push_back(std::make_pair(Address, BB)); 94 return Blocks.back().second;
|
/external/llvm/include/llvm/ADT/ |
PostOrderIterator.h | 41 // confine a CFG traversal to blocks in a specific loop. 239 // This is used to visit basic blocks in a method in reverse post order. This 261 std::vector<NodeType*> Blocks; // Block list in normal PO order 263 copy(po_begin(BB), po_end(BB), back_inserter(Blocks)); 273 inline rpo_iterator begin() { return Blocks.rbegin(); } 274 inline rpo_iterator end() { return Blocks.rend(); }
|
/external/llvm/include/llvm/Support/ |
GCOV.h | 183 SmallVector<GCOVBlock *, 16> Blocks;
|
/external/llvm/lib/CodeGen/ |
InterferenceCache.h | 39 /// of PhysReg in all basic blocks. 89 /// Blocks - Interference for each block in the function. 90 SmallVector<BlockInterference, 8> Blocks; 92 /// update - Recompute Blocks[MBBNum] 125 if (Blocks[MBBNum].Tag != Tag) 127 return &Blocks[MBBNum];
|
MachineBlockPlacement.cpp | 14 // a topological ordering of basic blocks) in the absence of a *strong* signal 17 // blocks adjacent to each other. 20 // at each stage walks through the basic blocks, trying to coalesce them into 22 // probabilities). Finally, it walks the blocks in topological order, and the 23 // first time it reaches a chain of basic blocks, it schedules them in the 62 /// \brief A chain of blocks which will be laid out contiguously. 64 /// This is the datastructure representing a chain of consecutive blocks that 67 /// a sequence of basic blocks which have some external (correctness) 74 /// \brief The sequence of blocks belonging to this chain. 76 /// This is the sequence of blocks for a particular chain. These will be lai [all...] |
MachineLICM.cpp | 83 // Exit blocks for CurLoop. 111 // If a MBB does not dominate loop exiting blocks then it may not safe 235 /// blocks dominated by the specified header block, and that are in the 505 const std::vector<MachineBasicBlock*> Blocks = CurLoop->getBlocks(); 506 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) { 507 MachineBasicBlock *BB = Blocks[i]; 587 const std::vector<MachineBasicBlock*> Blocks = CurLoop->getBlocks(); 588 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) { 589 MachineBasicBlock *BB = Blocks[i]; 636 // Check loop exiting blocks [all...] |
/external/llvm/tools/bugpoint/ |
CrashDebugger.cpp | 246 /// all terminators except the specified basic blocks to a 'ret' instruction, 278 SmallPtrSet<BasicBlock*, 8> Blocks; 280 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]])); 282 outs() << "Checking for crash with only these blocks:"; 283 unsigned NumPrint = Blocks.size(); 287 if (NumPrint < Blocks.size()) 288 outs() << "... <" << Blocks.size() << " total>"; 291 // Loop over and delete any hack up any blocks that are not listed... 294 if (!Blocks.count(BB) && BB->getTerminator()->getNumSuccessors()) { 310 // The CFG Simplifier pass may delete one of the basic blocks we ar [all...] |
/external/llvm/include/llvm/Analysis/ |
LoopInfo.h | 17 // contained entirely within the loop and the basic blocks the make up the loop. 24 // * the successor blocks of the loop 72 // Blocks - The list of blocks in this loop. First entry is the header node. 73 std::vector<BlockT*> Blocks; 89 /// blocks, where depth 0 is used for blocks not inside any loops. 97 BlockT *getHeader() const { return Blocks.front(); } 138 /// getBlocks - Get a list of the basic blocks which make up this loop. 140 const std::vector<BlockT*> &getBlocks() const { return Blocks; } [all...] |
/external/llvm/lib/Target/Hexagon/ |
HexagonHardwareLoops.cpp | 408 const std::vector<MachineBasicBlock*> Blocks = L->getBlocks(); 409 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) { 410 MachineBasicBlock *MBB = Blocks[i]; 563 /// This function makes two passes over the basic blocks. The first 586 // Loop over all the basic blocks.
|
/external/llvm/tools/llvm-diff/ |
DifferenceEngine.cpp | 123 /// The current mapping from old blocks to new blocks. 124 DenseMap<BasicBlock*, BasicBlock*> Blocks; 131 if (!Blocks.count(*I)) Count++; 138 /// predecessor blocks it has remaining. 151 /// A queue of unified blocks to process. 154 /// Try to unify the given two blocks. Enqueues them for processing 159 BasicBlock *&Ref = Blocks[L]; 394 return Blocks[cast<BlockAddress>(L)->getBasicBlock()] 450 return Blocks[cast<BasicBlock>(L)] != R [all...] |
/external/clang/lib/AST/ |
CommentParser.cpp | 713 SmallVector<BlockContentComment *, 8> Blocks; 715 Blocks.push_back(parseBlockContent()); 721 return S.actOnFullComment(S.copyArray(llvm::makeArrayRef(Blocks)));
|
/external/llvm/lib/Target/PowerPC/ |
PPCCTRLoops.cpp | 454 const std::vector<MachineBasicBlock*> Blocks = L->getBlocks(); 455 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) { 456 MachineBasicBlock *MBB = Blocks[i]; 689 const std::vector<MachineBasicBlock*> Blocks = L->getBlocks(); 690 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) { 691 MachineBasicBlock *MBB = Blocks[i];
|
/external/chromium/net/tools/flip_server/ |
balsa_headers.h | 97 typedef std::vector<BufferBlock> Blocks; 101 // Returns the total amount of memory used by the buffer blocks. 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(); } 193 // The block at start_idx, and all subsequent blocks 195 void CleanupBlocksStartingFrom(Blocks::size_type start_idx); 198 Blocks blocks_ [all...] |
/external/clang/include/clang/AST/ |
Comment.h | 1038 llvm::ArrayRef<BlockContentComment *> Blocks; 1043 FullComment(llvm::ArrayRef<BlockContentComment *> Blocks, DeclInfo *D) : 1045 Blocks(Blocks), ThisDeclInfo(D) { 1046 if (Blocks.empty()) 1049 setSourceRange(SourceRange(Blocks.front()->getLocStart(), 1050 Blocks.back()->getLocEnd())); 1051 setLocation(Blocks.front()->getLocStart()); 1061 return reinterpret_cast<child_iterator>(Blocks.begin()); 1065 return reinterpret_cast<child_iterator>(Blocks.end()) [all...] |
/external/clang/include/clang/Analysis/ |
CFG.h | 322 /// LoopTarget - Some blocks are used to represent the "loop edge" to 324 /// refer to the loop statement for such blocks (and be null otherwise). 332 /// CFG blocks. 339 /// control cannot technically ever proceed past this block. All such blocks 672 CFGBlock & front() { return *Blocks.front(); } 673 CFGBlock & back() { return *Blocks.back(); } 675 iterator begin() { return Blocks.begin(); } 676 iterator end() { return Blocks.end(); } 677 const_iterator begin() const { return Blocks.begin(); } 678 const_iterator end() const { return Blocks.end(); [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
GCOVProfiling.cpp | 12 // to records the edges between blocks that run and emit a complementary "gcda" 134 // Returns the length measured in 4-byte blocks that will be used to 197 // other blocks. 247 // set of blocks and a map of edges between blocks. This is the only GCOV 248 // object users can construct, the blocks and lines will be rooted here. 259 Blocks[BB] = new GCOVBlock(i++, os); 280 DeleteContainerSeconds(Blocks); 285 return *Blocks[BB]; 293 // Emit count of blocks [all...] |
/external/v8/src/ |
lithium.h | 227 bool Blocks(LOperand* operand) const {
|
/external/clang/lib/Rewrite/Frontend/ |
RewriteModernObjC.cpp | 128 SmallVector<BlockExpr *, 32> Blocks; [all...] |
RewriteObjC.cpp | 120 SmallVector<BlockExpr *, 32> Blocks; [all...] |