| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| EdgeBundles.h | 32 /// Blocks - Map each bundle to a list of basic block numbers.
33 SmallVector<SmallVector<unsigned, 8>, 4> Blocks;
46 /// getBlocks - Return an array of blocks that are connected to Bundle.
47 ArrayRef<unsigned> getBlocks(unsigned Bundle) const { return Blocks[Bundle]; }
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| FlattenCFGPass.cpp | 54 /// iterativelyFlattenCFG - Call FlattenCFG on all the blocks in the function,
60 // Use block handles instead of iterating over function blocks directly
61 // to avoid using iterators invalidated by erasing blocks.
62 std::vector<WeakVH> Blocks;
63 Blocks.reserve(F.size());
65 Blocks.push_back(&BB);
70 // Loop over all of the basic blocks and try to flatten them.
71 for (WeakVH &BlockHandle : Blocks) {
72 // Skip blocks erased by FlattenCFG.
85 // iterativelyFlattenCFG can make some blocks dead
[all...] |
| GVNSink.cpp | 107 /// Iterates through instructions in a set of blocks in reverse order from the
108 /// first non-terminator. For example (assume all blocks have size n):
115 /// It continues until all blocks have been exhausted. Use \c getActiveBlocks()
117 /// determine which blocks are still going and the order they appear in the
120 ArrayRef<BasicBlock *> Blocks;
126 LockstepReverseIterator(ArrayRef<BasicBlock *> Blocks) : Blocks(Blocks) {
133 for (BasicBlock *BB : Blocks)
136 for (BasicBlock *BB : Blocks) {
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| FunctionSummary.h | 36 /// Marks the IDs of the basic blocks visited during the analyzes.
39 /// Total number of blocks in the function.
98 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks;
100 if (TotalIDs > Blocks.size()) {
101 Blocks.resize(TotalIDs);
104 Blocks.set(ID);
126 /// Get the percentage of the reachable blocks.
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 53 /// Blocks which contain instructions which may have unknown side-effects
99 SetVector<BasicBlock *> Blocks;
109 /// Create a code extractor for a sequence of blocks.
111 /// Given a sequence of basic blocks where the first block in the sequence
117 /// extraction of blocks containing alloca instructions would be possible,
151 /// Based on the blocks used when constructing the code extractor,
155 /// the outlined blocks.
193 /// successor of blocks inside the region. If there exists a single block
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/XRay/ |
| Profile.h | 40 /// instance, aggregating blocks by Thread ID.
44 /// instance, aggregating blocks by function call stack.
89 : Blocks(std::move(O.Blocks)), NodeStorage(std::move(O.NodeStorage)),
94 Blocks = std::move(O.Blocks);
107 swap(L.Blocks, R.Blocks);
124 // List of blocks associated with a Profile.
125 BlockList Blocks;
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| FixIrreducible.cpp | 9 // An irreducible SCC is one which has multiple "header" blocks, i.e., blocks
22 // INPUT CFG: The blocks A and B form an irreducible loop with two headers.
55 // takes a set of incoming blocks (the predecessors) and outgoing blocks (the
57 // hub. Since the hub dominates all the outgoing blocks, each such PHINode
118 SetVector<BasicBlock *> &Blocks,
127 return L == NewLoop || Blocks.count(L->getHeader()) == 0;
139 for (auto BB : Child->blocks()) {
155 // Given a set of blocks and headers in an irreducible SCC, convert it into
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/CodeView/ |
| DebugLinesSubsection.h | 143 std::vector<Block> Blocks;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/MSF/ |
| MSFCommon.h | 34 // These elements are referred to as blocks. The size of a block may vary
39 // This contains the number of blocks resident in the file system. In
73 /// file as a sequence of (possibly discontiguous) blocks. When we want to read
75 /// reader uses it to determine which blocks in the underlying MSF file contain
80 std::vector<support::ulittle32_t> Blocks;
84 /// stream spans 1 or more blocks, each at equally spaced intervals throughout
120 /// Given an MSF with the specified block size and number of blocks, determine
123 /// \p NumBlocks - the total number of blocks in the MSF
126 /// those FPM blocks are unused (a single FPM block can describe the
127 /// allocation status of up to 32,767 blocks, although one appears onl
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/XRay/ |
| Trace.cpp | 296 // Next we index the records into blocks.
307 // Then we verify the consistency of the blocks.
310 auto &Blocks = PTB.second;
311 for (auto &B : Blocks) {
322 // This is now the meat of the algorithm. Here we sort the blocks according to
323 // the Walltime record in each of the blocks for the same thread. This allows
329 auto &Blocks = PTB.second;
330 llvm::sort(Blocks, [](const BlockIndexer::Block &L,
337 for (auto &B : Blocks) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ObjectYAML/ |
| CodeViewYAMLDebugSections.h | 95 std::vector<SourceLineBlock> Blocks;
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| InlineSizeEstimatorAnalysis.cpp | 56 Blocks,
195 FF[NamedFeatureIndex::Blocks] =
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| InterferenceCache.h | 44 /// of PhysReg in all basic blocks.
94 /// Blocks - Interference for each block in the function.
95 SmallVector<BlockInterference, 8> Blocks;
97 /// update - Recompute Blocks[MBBNum]
128 if (Blocks[MBBNum].Tag != Tag)
130 return &Blocks[MBBNum];
|
| RDFLiveness.cpp | 175 // the the remaining defs into buckets for containing blocks.
177 std::map<MachineBasicBlock*, SmallVector<NodeId,32>> Blocks;
186 Blocks[Block(IA)].push_back(IA.Id);
229 for (auto &Bucket : Blocks) {
236 // Sort the blocks with respect to dominance.
242 auto &Bucket = Blocks[MBB];
470 NodeList Blocks = FA.Addr->members(DFG);
471 for (NodeAddr<BlockNode*> BA : Blocks) {
778 NodeList Blocks = FA.Addr->members(DFG);
781 for (NodeAddr<BlockNode*> BA : Blocks) {
[all...] |
| TypePromotion.cpp | 174 // handle, such as constants and basic blocks.
904 SmallPtrSet<BasicBlock*, 4> Blocks;
907 Blocks.insert(I->getParent());
923 if (ToPromote < 2 || (Blocks.size() == 1 && (NonFreeArgs > SafeWrap.size())))
|
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/ |
| PDBFile.cpp | 143 // allows for a maximum of getBlockSize() * 8 blocks bits in the Fpm, and
144 // thusly an equal number of total blocks in the file. For a block size
145 // of 4KiB (very common), this would yield 32KiB total blocks in file, for a
150 // need to reserve blocks of the form |{1,2} + getBlockSize() * 8 * k|, but
215 ArrayRef<support::ulittle32_t> Blocks;
216 if (auto EC = Reader.readArray(Blocks, NumExpectedStreamBlocks))
218 for (uint32_t Block : Blocks) {
225 ContainerLayout.StreamMap.push_back(Blocks);
248 auto Blocks = getStreamBlockList(StreamIdx);
249 Result.Blocks.assign(Blocks.begin(), Blocks.end())
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyExceptionInfo.h | 47 std::vector<MachineBasicBlock *> Blocks;
73 void addToBlocksVector(MachineBasicBlock *MBB) { Blocks.push_back(MBB); }
75 Blocks.push_back(MBB);
78 ArrayRef<MachineBasicBlock *> getBlocks() const { return Blocks; }
82 inline iterator_range<block_iterator> blocks() const { function in class:llvm::WebAssemblyException
85 unsigned getNumBlocks() const { return Blocks.size(); }
86 std::vector<MachineBasicBlock *> &getBlocksVector() { return Blocks; }
103 void reserveBlocks(unsigned Size) { Blocks.reserve(Size); }
105 std::reverse(Blocks.begin() + From, Blocks.end())
[all...] |
| WebAssemblyFixIrreducibleControlFlow.cpp | 19 /// of blocks with a single entry and no branches back to that entry. A region
37 /// use the "label" helper for the blocks we absolutely must and no others. We
80 // Calculates reachability in a region. Ignores branches to blocks outside of
85 ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks)
86 : Entry(Entry), Blocks(Blocks) {
89 for (auto *MBB : Blocks) {
108 // "Loopers" are blocks that are in a loop. We detect these by finding blocks
112 // Get all blocks that are loop entries
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-pdbutil/ |
| DumpOutputStyle.cpp | 249 P.formatLine("Number of blocks: {0}", getPdb().getBlockCount());
401 auto Blocks = getPdb().getStreamBlockList(StreamIdx);
402 std::vector<uint32_t> BV(Blocks.begin(), Blocks.end());
403 P.formatLine(" {0} Blocks: [{1}]",
|
| LinePrinter.cpp | 144 ArrayRef<support::ulittle32_t> Blocks = Layout.Blocks;
145 assert(!Blocks.empty());
147 uint32_t CurrentBlock = Blocks[0];
149 while (!Blocks.empty()) {
151 uint32_t NextBlock = Blocks.front();
160 Blocks = Blocks.drop_front();
248 auto Blocks = makeArrayRef(StreamLayout.Blocks);
[all...] |
| PdbYaml.h | 47 std::vector<uint32_t> Blocks;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| X86FlagsCopyLowering.cpp | 443 // This copy's def may just be part of a region of blocks covered by
497 // the hoist block. A clobber anywhere in any of these blocks the hoist.
540 // Collect the basic blocks we need to scan. Typically this will just be
541 // a single basic block but we may have to scan multiple blocks if the
543 SmallVector<MachineBasicBlock *, 2> Blocks;
545 Blocks.push_back(&MBB);
548 MachineBasicBlock &UseMBB = *Blocks.pop_back_val();
662 // test basic block dominates all of the use basic blocks. Further, we
690 Blocks.push_back(SuccMBB);
695 } while (!Blocks.empty())
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 119 /// The current mapping from old blocks to new blocks.
120 DenseMap<BasicBlock*, BasicBlock*> Blocks;
127 if (!Blocks.count(*I)) Count++;
134 /// predecessor blocks it has remaining.
147 /// A queue of unified blocks to process.
150 /// Try to unify the given two blocks. Enqueues them for processing
155 BasicBlock *&Ref = Blocks[L];
407 return Blocks[cast<BlockAddress>(L)->getBasicBlock()]
476 return Blocks[cast<BasicBlock>(L)] != R
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| CommentParser.cpp | 768 SmallVector<BlockContentComment *, 8> Blocks;
770 Blocks.push_back(parseBlockContent());
776 return S.actOnFullComment(S.copyArray(llvm::makeArrayRef(Blocks)));
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/MIRParser/ |
| MIRParser.cpp | 897 std::vector<MachineBasicBlock *> Blocks;
898 for (const auto &MBBSource : Entry.Blocks) {
902 Blocks.push_back(MBB);
904 unsigned Index = JTI->createJumpTableIndex(Blocks);
|
