| /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/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/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/llvm/lib/CodeGen/ |
| EdgeBundles.cpp | 56 Blocks.clear();
57 Blocks.resize(getNumBundles());
62 Blocks[b0].push_back(i);
64 Blocks[b1].push_back(i);
|
| 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];
|
| SpillPlacement.h | 10 // This analysis computes the optimal spill code placement between basic blocks.
16 // Given a variable that is live across multiple basic blocks, and given
17 // constraints on the basic blocks where the variable is live, determine which
104 /// @param LiveBlocks Constraints for blocks that have the variable live in or
108 /// addPrefSpill - Add PrefSpill constraints to all blocks listed. This is
112 /// @param Blocks Array of block numbers that prefer to spill in and out.
113 /// @param Strong When true, double the negative bias for these blocks.
114 void addPrefSpill(ArrayRef<unsigned> Blocks, bool Strong);
116 /// addLinks - Add transparent blocks with the given numbers.
|
| /external/clang/lib/Analysis/ |
| PostOrderCFGView.cpp | 1 //===- PostOrderCFGView.cpp - Post order view of CFG blocks -------*- C++ --*-//
10 // This file implements post order view of the blocks in a CFG.
21 Blocks.reserve(cfg->getNumBlockIDs());
26 BlockOrder[*I] = Blocks.size() + 1;
27 Blocks.push_back(*I);
|
| /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/lib/Transforms/Utils/ |
| CodeExtractor.cpp | 70 /// \brief Build a set of blocks to extract if the input blocks are viable.
78 // Loop over the blocks, adding them to our set-vector, and aborting with an
79 // empty set if we encounter invalid blocks.
82 llvm_unreachable("Repeated basic blocks in extraction input");
97 "No blocks in this region may have entries from outside the region"
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) {
[all...] |
| /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(); }
|
| /art/compiler/optimizing/ |
| parallel_move_resolver.cc | 84 // as this one's destination blocks this one so recursively perform all
88 if (other_move.Blocks(destination) && !other_move.IsPending()) {
120 if (other_move.Blocks(destination)) {
137 if (other_move.Blocks(source)) {
139 } else if (other_move.Blocks(destination)) {
152 if (moves_.Get(i)->Blocks(loc)) {
|
| /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/MC/MCAnalysis/ |
| MCFunction.cpp | 25 Blocks.push_back(std::move(MCBB));
26 return *Blocks.back();
69 "Splitting unrelated basic blocks!");
|
| /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/lib/IR/ |
| GCOV.cpp | 131 // read blocks.
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()
[all...] |
| /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...] |
| balsa_headers.cc | 104 // Returns the total amount of memory used by the buffer blocks.
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
[all...] |
| /external/clang/test/SemaCXX/ |
| nested-name-spec-locations.cpp | 158 void bar(std::vector<int*> &Blocks) {
159 foo(Blocks); // expected-note{{in instantiation of}}
|
| /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/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 | 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/v8/src/x64/ |
| lithium-gap-resolver-x64.cc | 80 // as this one's destination blocks this one so recursively perform all
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/ |
| 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/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/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...] |
