/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 | 64 // Only check non-dead blocks. Dead blocks may have strange pointer 639 /// Find all blocks that will unconditionally lead to the block BB and append 641 static void FindUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks, 651 Blocks.push_back(Pred); 661 SmallVector<BasicBlock *, 16> Blocks; 662 Blocks.push_back(F->getParent()); 664 while (!Blocks.empty()) { 665 BasicBlock *BB = Blocks.pop_back_val(); 698 FindUnconditionalPreds(Blocks, BB, DT) [all...] |
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
FunctionSummary.h | 34 /// Marks the IDs of the basic blocks visited during the analyzes. 37 /// Total number of blocks in the function. 96 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks; 98 if (TotalIDs > Blocks.size()) { 99 Blocks.resize(TotalIDs); 102 Blocks.set(ID); 124 /// Get the percentage of the reachable blocks.
|
/external/llvm/include/llvm/MC/ |
MCFunction.h | 84 BasicBlockListTy Blocks; 99 /// \name Access to the function's basic blocks. No ordering is enforced. 108 const_iterator begin() const { return Blocks.begin(); } 109 iterator begin() { return Blocks.begin(); } 110 const_iterator end() const { return Blocks.end(); } 111 iterator end() { return Blocks.end(); } 113 const MCBasicBlock* front() const { return Blocks.front(); } 114 MCBasicBlock* front() { return Blocks.front(); } 115 const MCBasicBlock* back() const { return Blocks.back(); } 116 MCBasicBlock* back() { return Blocks.back(); [all...] |
/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 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/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 56 static cl::opt<unsigned> AlignAllBlock("align-all-blocks", 58 "blocks in the function."), 68 /// \brief A chain of blocks which will be laid out contiguously. 70 /// This is the datastructure representing a chain of consecutive blocks that 73 /// a sequence of basic blocks which have some external (correctness [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 | 244 /// all terminators except the specified basic blocks to a 'ret' instruction, 276 SmallPtrSet<BasicBlock*, 8> Blocks; 278 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]])); 280 outs() << "Checking for crash with only these blocks:"; 281 unsigned NumPrint = Blocks.size(); 285 if (NumPrint < Blocks.size()) 286 outs() << "... <" << Blocks.size() << " total>"; 289 // Loop over and delete any hack up any blocks that are not listed... 292 if (!Blocks.count(BB) && BB->getTerminator()->getNumSuccessors()) { 308 // 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 69 // Blocks - The list of blocks in this loop. First entry is the header node. 70 std::vector<BlockT*> Blocks; 85 /// blocks, where depth 0 is used for blocks not inside any loops. 93 BlockT *getHeader() const { return Blocks.front(); } 134 /// getBlocks - Get a list of the basic blocks which make up this loop. 136 const std::vector<BlockT*> &getBlocks() const { return Blocks; } [all...] |
/external/llvm/tools/llvm-diff/ |
DifferenceEngine.cpp | 121 /// The current mapping from old blocks to new blocks. 122 DenseMap<BasicBlock*, BasicBlock*> Blocks; 129 if (!Blocks.count(*I)) Count++; 136 /// predecessor blocks it has remaining. 149 /// A queue of unified blocks to process. 152 /// Try to unify the given two blocks. Enqueues them for processing 157 BasicBlock *&Ref = Blocks[L]; 392 return Blocks[cast<BlockAddress>(L)->getBasicBlock()] 448 return Blocks[cast<BasicBlock>(L)] != R [all...] |
/external/clang/lib/AST/ |
CommentParser.cpp | 743 SmallVector<BlockContentComment *, 8> Blocks; 745 Blocks.push_back(parseBlockContent()); 751 return S.actOnFullComment(S.copyArray(llvm::makeArrayRef(Blocks)));
|
/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/chromium_org/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 | 1077 ArrayRef<BlockContentComment *> Blocks; 1081 FullComment(ArrayRef<BlockContentComment *> Blocks, DeclInfo *D) : 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.end()); [all...] |
/external/clang/include/clang/Analysis/ |
CFG.h | 354 /// LoopTarget - Some blocks are used to represent the "loop edge" to 356 /// refer to the loop statement for such blocks (and be null otherwise). 364 /// CFG blocks. 371 /// control cannot technically ever proceed past this block. All such blocks 706 CFGBlock & front() { return *Blocks.front(); } 707 CFGBlock & back() { return *Blocks.back(); } 709 iterator begin() { return Blocks.begin(); } 710 iterator end() { return Blocks.end(); } 711 const_iterator begin() const { return Blocks.begin(); } 712 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" 172 // Returns the length measured in 4-byte blocks that will be used to 244 // other blocks. 300 // set of blocks and a map of edges between blocks. This is the only GCOV 301 // object users can construct, the blocks and lines will be rooted here. 312 Blocks[BB] = new GCOVBlock(i++, os); 332 DeleteContainerSeconds(Blocks); 337 return *Blocks[BB]; 345 // Emit count of blocks [all...] |
/external/v8/src/ |
lithium.h | 227 bool Blocks(LOperand* operand) const {
|
/external/chromium_org/v8/src/ |
lithium.h | 293 bool Blocks(LOperand* operand) const {
|
/external/llvm/lib/Target/Hexagon/ |
HexagonHardwareLoops.cpp | 874 const std::vector<MachineBasicBlock*> Blocks = L->getBlocks(); 875 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) { 876 MachineBasicBlock *MBB = Blocks[i]; [all...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/preprocs/nasm/ |
nasm-pp.c | 54 typedef struct Blocks Blocks; 75 * store the interiors of `%rep...%endrep' blocks, which are 78 * blocks are signified by having a NULL `name' field. 453 * Tokens are allocated in blocks to improve speed 457 struct Blocks { 458 Blocks *next; 462 static Blocks blocks = { NULL, NULL }; variable [all...] |