| /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]; }
|
| MIRYamlMapping.h | 298 std::vector<FlowStringValue> Blocks;
308 YamlIO.mapOptional("blocks", Entry.Blocks);
|
| /external/v8/src/compiler/ |
| gap-resolver.cc | 17 inline bool Blocks(MoveOperands* move, InstructionOperand destination) {
18 return move->Blocks(destination);
55 // destination blocks this one so recursively perform all such moves.
57 if (other->Blocks(destination) && !other->IsPending()) {
87 std::bind2nd(std::ptr_fun(&Blocks), destination));
107 if (other->Blocks(source)) {
109 } else if (other->Blocks(destination)) {
|
| move-optimizer.cc | 30 bool Blocks(const OperandSet& set, const InstructionOperand& operand) {
101 // blocks, and the closest common successor is not deferred, we lose the
102 // optimization of just spilling/filling in deferred blocks, when the
197 if (!Blocks(dst_cant_be, move->destination())) {
212 if (Blocks(src_cant_be, src)) {
326 // Ensure that the last instruction in all incoming blocks don't contain
|
| /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(); }
|
| ThreadSafetyTIL.h | [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/ADT/ |
| PostOrderIterator.h | 42 // confine a CFG traversal to blocks in a specific loop.
262 // This is used to visit basic blocks in a method in reverse post order. This
284 std::vector<NodeType*> Blocks; // Block list in normal PO order
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/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
60 static cl::opt<unsigned> AlignAllBlock("align-all-blocks",
62 "blocks in the function."),
86 cl::desc("Outline loop blocks from loop chain if (frequency of loop) / "
114 /// \brief A chain of blocks which will be laid out contiguously.
116 /// This is the datastructure representing a chain of consecutive blocks tha
[all...] |
| MachineLICM.cpp | 91 // Exit blocks for CurLoop.
119 // If a MBB does not dominate loop exiting blocks then it may not safe
450 const std::vector<MachineBasicBlock *> &Blocks = CurLoop->getBlocks();
451 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) {
452 MachineBasicBlock *BB = Blocks[i];
530 const std::vector<MachineBasicBlock *> &Blocks = CurLoop->getBlocks();
531 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) {
532 MachineBasicBlock *BB = Blocks[i];
578 // Check loop exiting blocks.
626 /// Walk the specified loop in the CFG (defined by all blocks dominated by th
[all...] |
| RegAllocGreedy.cpp | 255 /// All basic blocks where the current register has uses.
578 // large blocks on targets with many physical registers.
[all...] |
| /external/llvm/lib/CodeGen/MIRParser/ |
| MIRParser.cpp | 616 std::vector<MachineBasicBlock *> Blocks;
617 for (const auto &MBBSource : Entry.Blocks) {
621 Blocks.push_back(MBB);
623 unsigned Index = JTI->createJumpTableIndex(Blocks);
|
| /external/llvm/tools/bugpoint/ |
| CrashDebugger.cpp | 320 /// all terminators except the specified basic blocks to a 'ret' instruction,
352 SmallPtrSet<BasicBlock*, 8> Blocks;
354 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]]));
356 outs() << "Checking for crash with only these blocks:";
357 unsigned NumPrint = Blocks.size();
361 if (NumPrint < Blocks.size())
362 outs() << "... <" << Blocks.size() << " total>";
365 // Loop over and delete any hack up any blocks that are not listed...
368 if (!Blocks.count(&*BB) && BB->getTerminator()->getNumSuccessors()) {
386 // The CFG Simplifier pass may delete one of the basic blocks we ar
[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/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
71 // Blocks - The list of blocks in this loop. First entry is the header node.
72 std::vector<BlockT*> Blocks;
93 /// blocks, where depth 0 is used for blocks not inside any loops.
101 BlockT *getHeader() const { return Blocks.front(); }
142 /// getBlocks - Get a list of the basic blocks which make up this loop.
144 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
148 inline iterator_range<block_iterator> blocks() const { function in class:llvm::LoopBase
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 71 // Only check non-dead blocks. Dead blocks may have strange pointer
680 // Check all blocks going backward until we reach the load-block.
719 /// Find all blocks that will unconditionally lead to the block BB and append
721 static void FindUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks,
731 Blocks.push_back(Pred);
741 SmallVector<BasicBlock *, 16> Blocks;
742 Blocks.push_back(F->getParent());
745 while (!Blocks.empty()) {
746 BasicBlock *BB = Blocks.pop_back_val()
[all...] |
| /external/llvm/include/llvm/Support/ |
| GCOV.h | 272 size_t getNumBlocks() const { return Blocks.size(); }
276 BlockIterator block_begin() const { return Blocks.begin(); }
277 BlockIterator block_end() const { return Blocks.end(); }
278 iterator_range<BlockIterator> blocks() const { function in class:llvm::GCOVFunction
292 SmallVector<std::unique_ptr<GCOVBlock>, 16> Blocks;
377 BlockLines Blocks;
404 LineInfo[Filename].Blocks[Line - 1].push_back(Block);
|
| /external/llvm/lib/Target/WebAssembly/ |
| Relooper.cpp | 66 /// Implements the relooper algorithm for a function's blocks.
69 /// ownership of the blocks and shapes, and frees them when done.
72 std::deque<Block *> Blocks;
125 for (Block *B : R.Blocks) {
191 for (auto Curr : Blocks)
199 Blocks.push_back(New);
249 // Split the node (for simplicity, we replace all the blocks, even
284 // Add incoming branches from live blocks, ignoring dead code
285 for (unsigned i = 0; i < Blocks.size(); i++) {
286 Block *Curr = Blocks[i]
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 12 // to records the edges between blocks that run and emit a complementary "gcda"
177 // Returns the length measured in 4-byte blocks that will be used to
242 // other blocks.
290 // blocks being copied or moved around.
309 // set of blocks and a map of edges between blocks. This is the only GCOV
310 // object users can construct, the blocks and lines will be rooted here.
326 Blocks.insert(std::make_pair(&BB, GCOVBlock(i++, os)));
339 return Blocks.find(BB)->second;
349 Function *F = Blocks.begin()->first->getParent()
[all...] |
| /external/clang/include/clang/AST/ |
| Comment.h | 1098 ArrayRef<BlockContentComment *> Blocks;
1102 FullComment(ArrayRef<BlockContentComment *> Blocks, DeclInfo *D) :
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.end());
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 406 /// LoopTarget - Some blocks are used to represent the "loop edge" to
408 /// refer to the loop statement for such blocks (and be null otherwise).
471 /// CFG blocks.
478 /// control cannot technically ever proceed past this block. All such blocks
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();
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonHardwareLoops.cpp | 367 /// \brief Return the latch block if it's one of the exiting blocks. Otherwise,
368 /// return the exiting block. Return 'null' when multiple exiting blocks are
[all...] |
