| /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;
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/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/lldb/include/lldb/Symbol/ |
| SymbolFile.h | 38 Blocks = (1u << 3),
|
| /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/MC/MCAnalysis/ |
| MCFunction.h | 93 BasicBlockListTy Blocks;
113 /// \name Access to the function's basic blocks. No ordering is enforced,
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();
[all...] |
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.h | 39 /// of PhysReg in all basic blocks.
90 /// Blocks - Interference for each block in the function.
91 SmallVector<BlockInterference, 8> Blocks;
93 /// update - Recompute Blocks[MBBNum]
126 if (Blocks[MBBNum].Tag != Tag)
128 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
57 static cl::opt<unsigned> AlignAllBlock("align-all-blocks",
59 "blocks in the function."),
76 /// \brief A chain of blocks which will be laid out contiguously.
78 /// This is the datastructure representing a chain of consecutive blocks that
81 /// a sequence of basic blocks which have some external (correctness
[all...] |
| MachineLICM.cpp | 84 // Exit blocks for CurLoop.
112 // If a MBB does not dominate loop exiting blocks then it may not safe
236 /// blocks dominated by the specified header block, and that are in the
509 const std::vector<MachineBasicBlock *> &Blocks = CurLoop->getBlocks();
510 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) {
511 MachineBasicBlock *BB = Blocks[i];
591 const std::vector<MachineBasicBlock *> &Blocks = CurLoop->getBlocks();
592 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) {
593 MachineBasicBlock *BB = Blocks[i];
640 // Check loop exiting blocks
[all...] |
| RegAllocGreedy.cpp | 242 /// All basic blocks where the current register has uses.
530 // large blocks on targets with many physical registers.
[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
72 // Blocks - The list of blocks in this loop. First entry is the header node.
73 std::vector<BlockT*> Blocks;
90 /// blocks, where depth 0 is used for blocks not inside any loops.
98 BlockT *getHeader() const { return Blocks.front(); }
139 /// getBlocks - Get a list of the basic blocks which make up this loop.
141 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 68 // Only check non-dead blocks. Dead blocks may have strange pointer
641 /// Find all blocks that will unconditionally lead to the block BB and append
643 static void FindUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks,
653 Blocks.push_back(Pred);
663 SmallVector<BasicBlock *, 16> Blocks;
664 Blocks.push_back(F->getParent());
666 while (!Blocks.empty()) {
667 BasicBlock *BB = Blocks.pop_back_val();
700 FindUnconditionalPreds(Blocks, BB, DT)
[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];
390 return Blocks[cast<BlockAddress>(L)->getBasicBlock()]
446 return Blocks[cast<BasicBlock>(L)] != R
[all...] |
| /external/clang/lib/AST/ |
| CommentParser.cpp | 764 SmallVector<BlockContentComment *, 8> Blocks;
766 Blocks.push_back(parseBlockContent());
772 return S.actOnFullComment(S.copyArray(llvm::makeArrayRef(Blocks)));
|
| /external/llvm/include/llvm/Support/ |
| 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;
360 BlockLines Blocks;
386 LineInfo[Filename].Blocks[Line-1].push_back(Block);
|
| /external/chromium_org/net/tools/balsa/ |
| 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/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 12 // to records the edges between blocks that run and emit a complementary "gcda"
178 // Returns the length measured in 4-byte blocks that will be used to
243 // other blocks.
302 // set of blocks and a map of edges between blocks. This is the only GCOV
303 // object users can construct, the blocks and lines will be rooted here.
315 Blocks[BB] = new GCOVBlock(i++, os);
327 DeleteContainerSeconds(Blocks);
332 return *Blocks[BB];
342 Function *F = Blocks.begin()->first->getParent()
[all...] |
| /external/chromium_org/v8/src/compiler/ |
| instruction.h | 286 bool Blocks(InstructionOperand* operand) const {
|
| /external/chromium_org/v8/src/ |
| lithium.h | 277 bool Blocks(LOperand* operand) const {
|
| /external/clang/include/clang/AST/ |
| Comment.h | 1096 ArrayRef<BlockContentComment *> Blocks;
1100 FullComment(ArrayRef<BlockContentComment *> Blocks, DeclInfo *D) :
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.end());
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 407 /// LoopTarget - Some blocks are used to represent the "loop edge" to
409 /// refer to the loop statement for such blocks (and be null otherwise).
472 /// CFG blocks.
479 /// control cannot technically ever proceed past this block. All such blocks
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();
[all...] |
| /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...] |
| /art/compiler/optimizing/ |
| nodes.h | 70 // Control-flow graph of a method. Contains a list of basic blocks.
163 // List of blocks in insertion order.
166 // List of blocks to perform a reverse post order tree traversal.
230 // Find blocks that are part of this loop. Returns whether the loop is a natural loop,
606 // order of blocks where this instruction's live interval start.
[all...] |
