/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/XRay/ |
H A D | Profile.h | 89 : Blocks(std::move(O.Blocks)), NodeStorage(std::move(O.NodeStorage)), 94 Blocks = std::move(O.Blocks); 107 swap(L.Blocks, R.Blocks); 125 BlockList Blocks; member in class:llvm::xray::Profile 141 const_iterator begin() const { return Blocks.begin(); } 142 const_iterator end() const { return Blocks.end(); } 143 bool empty() const { return Blocks [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/ |
H A D | ThreadSafetyTIL.cpp | 162 // Each block will be written into the Blocks array in order, and its BlockID 165 unsigned BasicBlock::topologicalSort(SimpleArray<BasicBlock *> &Blocks, argument 170 ID = Block->topologicalSort(Blocks, ID); 175 Blocks[BlockID] = this; 189 unsigned BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock *> &Blocks, argument 196 ID = DominatorNode.Parent->topologicalFinalSort(Blocks, ID); 198 ID = Pred->topologicalFinalSort(Blocks, ID); 199 assert(static_cast<size_t>(ID) < Blocks.size()); 201 Blocks[BlockID] = this; 262 for (auto *Block : Blocks) [all...] |
H A D | PostOrderCFGView.cpp | 22 Blocks.reserve(cfg->getNumBlockIDs()); 27 BlockOrder[*I] = Blocks.size() + 1; 28 Blocks.push_back(*I);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | EdgeBundles.h | 33 /// Blocks - Map each bundle to a list of basic block numbers. 34 SmallVector<SmallVector<unsigned, 8>, 4> Blocks; member in class:llvm::EdgeBundles 48 ArrayRef<unsigned> getBlocks(unsigned Bundle) const { return Blocks[Bundle]; }
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MachinePostDominators.cpp | 52 ArrayRef<MachineBasicBlock *> Blocks) const { 53 assert(!Blocks.empty()); 55 MachineBasicBlock *NCD = Blocks.front(); 56 for (MachineBasicBlock *BB : Blocks.drop_front()) {
|
H A D | EdgeBundles.cpp | 57 Blocks.clear(); 58 Blocks.resize(getNumBundles()); 63 Blocks[b0].push_back(i); 65 Blocks[b1].push_back(i);
|
H A D | InterferenceCache.h | 94 /// Blocks - Interference for each block in the function. 95 SmallVector<BlockInterference, 8> Blocks; member in class:llvm::InterferenceCache::Entry 97 /// update - Recompute Blocks[MBBNum] 130 if (Blocks[MBBNum].Tag != Tag) 132 return &Blocks[MBBNum];
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | FlattenCFGPass.cpp | 61 std::vector<WeakVH> Blocks; local 62 Blocks.reserve(F.size()); 64 Blocks.push_back(&BB); 70 for (WeakVH &BlockHandle : Blocks) {
|
H A D | GVNSink.cpp | 120 ArrayRef<BasicBlock *> Blocks; member in class:__anon2674::LockstepReverseIterator 126 LockstepReverseIterator(ArrayRef<BasicBlock *> Blocks) : Blocks(Blocks) { argument 133 for (BasicBlock *BB : Blocks) 136 for (BasicBlock *BB : Blocks) { 152 // ActiveBlocks will be later copied to Blocks using std::copy. The 153 // resultant order of elements in Blocks needs to be deterministic. 155 // copying. And we cannot simply sort Blocks as they need to match the 159 void restrictToBlocks(SmallSetVector<BasicBlock *, 4> &Blocks) { argument 201 SmallVector<BasicBlock *, 4> Blocks; member in struct:__anon2674::SinkingInstructionCandidate 232 SmallVector<BasicBlock *, 4> Blocks; member in class:__anon2674::ModelledPHI [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
H A D | PostOrderCFGView.h | 74 std::vector<const CFGBlock *> Blocks; 87 iterator begin() { return Blocks.rbegin(); } 88 iterator end() { return Blocks.rend(); } 90 const_iterator begin() const { return Blocks.rbegin(); } 91 const_iterator end() const { return Blocks.rend(); }
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyExceptionInfo.h | 47 std::vector<MachineBasicBlock *> Blocks; member in class:llvm::WebAssemblyException 73 Blocks.push_back(MBB); 76 ArrayRef<MachineBasicBlock *> getBlocks() const { return Blocks; } 83 unsigned getNumBlocks() const { return Blocks.size(); } 84 std::vector<MachineBasicBlock *> &getBlocksVector() { return Blocks; } 97 void reserveBlocks(unsigned Size) { Blocks.reserve(Size); } 99 std::reverse(Blocks.begin() + From, Blocks.end());
|
H A D | WebAssemblyFixIrreducibleControlFlow.cpp | 74 ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks) argument 75 : Entry(Entry), Blocks(Blocks) { 78 for (auto *MBB : Blocks) { 114 const BlockSet &Blocks; member in class:__anon2438::ReachabilityGraph 119 bool inRegion(MachineBasicBlock *MBB) const { return Blocks.count(MBB); } 131 for (auto *MBB : Blocks) { 155 // Blocks that can return to themselves are in a loop. 156 for (auto *MBB : Blocks) { 187 BlockSet &getBlocks() { return Blocks; } 193 BlockSet Blocks; member in class:__anon2438::LoopBlocks 241 processRegion( MachineBasicBlock *Entry, BlockSet &Blocks, MachineFunction &MF) argument 322 makeSingleEntryLoop( BlockSet &Entries, BlockSet &Blocks, MachineFunction &MF, const ReachabilityGraph &Graph) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | FunctionSummary.h | 98 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks; local 100 if (TotalIDs > Blocks.size()) { 101 Blocks.resize(TotalIDs); 104 Blocks.set(ID); 99 assert(ID < TotalIDs); if (TotalIDs > Blocks.size()) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-pdbutil/ |
H A D | 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); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ProfileData/ |
H A D | GCOV.cpp | 167 Blocks.push_back(std::make_unique<GCOVBlock>(*this, i)); 188 Edges.push_back(std::make_unique<GCOVEdge>(*Blocks[BlockNo], *Blocks[Dst])); 190 Blocks[BlockNo]->addDstEdge(Edge); 191 Blocks[Dst]->addSrcEdge(Edge); 213 GCOVBlock &Block = *Blocks[BlockNo]; 315 if (BlockNo >= Blocks.size()) { 319 if (BlockNo == Blocks.size() - 1) 321 GCOVBlock &Block = *Blocks[BlockNo]; 342 return Blocks [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | CodeExtractor.cpp | 251 Blocks(buildExtractionBlockSet(BBs, DT, AllowVarArgs, AllowAlloca)), 260 Blocks(buildExtractionBlockSet(L.getBlocks(), &DT, 267 static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { argument 269 if (Blocks.count(I->getParent())) 277 static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { argument 280 if (!Blocks.count(I->getParent())) 285 static BasicBlock *getCommonExitBlock(const SetVector<BasicBlock *> &Blocks) { argument 290 if (Blocks.count(Succ)) 302 if (any_of(Blocks, hasNonCommonExitSucc)) 374 Function *Func = (*Blocks 981 eraseLifetimeMarkersOnInputs(const SetVector<BasicBlock *> &Blocks, const SetVector<Value *> &SunkAllocas, SetVector<Value *> &LifetimesStart) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/ |
H A D | DebugLinesSubsection.cpp | 78 Blocks.emplace_back(Offset); 82 Block &B = Blocks.back(); 93 Block &B = Blocks.back(); 113 for (const auto &B : Blocks) { 139 for (const auto &B : Blocks) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericIteratedDominanceFrontier.h | 75 void setDefiningBlocks(const SmallPtrSetImpl<NodeTy *> &Blocks) { argument 76 DefBlocks = &Blocks; 84 void setLiveInBlocks(const SmallPtrSetImpl<NodeTy *> &Blocks) { argument 85 LiveInBlocks = &Blocks;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/MSF/ |
H A D | MSFBuilder.h | 73 Expected<uint32_t> addStream(uint32_t Size, ArrayRef<uint32_t> Blocks); 124 Error allocateBlocks(uint32_t NumBlocks, MutableArrayRef<uint32_t> Blocks);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
H A D | BasicGOTAndStubsBuilder.h | 28 std::vector<Block *> Blocks(G.blocks().begin(), G.blocks().end()); 30 for (auto *B : Blocks)
|
/freebsd-11-stable/contrib/llvm-project/llvm/tools/bugpoint/ |
H A D | CrashDebugger.cpp | 458 SmallPtrSet<BasicBlock *, 8> Blocks; local 460 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]])); 463 unsigned NumPrint = Blocks.size(); 468 if (NumPrint < Blocks.size()) 469 outs() << "... <" << Blocks.size() << " total>"; 475 if (!Blocks.count(&BB) && BB.getTerminator()->getNumSuccessors()) { 501 for (BasicBlock *BB : Blocks) 507 if (!Blocks.count(&BB)) 577 SmallPtrSet<const BasicBlock *, 8> Blocks; local 579 Blocks 681 SmallPtrSet<const BasicBlock *, 8> Blocks; local 1252 std::vector<const BasicBlock *> Blocks; local 1274 std::vector<const BasicBlock *> Blocks; local 1287 std::vector<const BasicBlock *> Blocks; local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/MSF/ |
H A D | MSFBuilder.cpp | 102 MutableArrayRef<uint32_t> Blocks) { 110 "There are no free Blocks in the file"); 134 assert(Block != -1 && "We ran out of Blocks!"); 137 Blocks[I++] = NextBlock; 155 ArrayRef<uint32_t> Blocks) { 160 if (ReqBlocks != Blocks.size()) 164 for (auto Block : Blocks) { 174 for (auto Block : Blocks) { 177 StreamData.push_back(std::make_pair(Size, Blocks)); 201 // If we're growing, we have to allocate new Blocks 101 allocateBlocks(uint32_t NumBlocks, MutableArrayRef<uint32_t> Blocks) argument 154 addStream(uint32_t Size, ArrayRef<uint32_t> Blocks) argument [all...] |
H A D | MappedBlockStream.cpp | 64 SL.Blocks = Layout.StreamMap[StreamIndex]; 75 SL.Blocks = Layout.DirectoryBlocks; 176 if (StreamLayout.Blocks[Last] != StreamLayout.Blocks[Last + 1] - 1) 187 uint32_t MsfOffset = blockToOffset(StreamLayout.Blocks[First], BlockSize); 216 uint32_t E = StreamLayout.Blocks[BlockNum]; 218 if (StreamLayout.Blocks[I + BlockNum] != E) 228 uint32_t FirstBlockAddr = StreamLayout.Blocks[BlockNum]; 252 uint32_t StreamBlockAddr = StreamLayout.Blocks[BlockNum]; 332 SL.Blocks [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ProfileData/ |
H A D | GCOV.h | 287 size_t getNumBlocks() const { return Blocks.size(); } 291 BlockIterator block_begin() const { return Blocks.begin(); } 292 BlockIterator block_end() const { return Blocks.end(); } 308 SmallVector<std::unique_ptr<GCOVBlock>, 16> Blocks; member in class:llvm::GCOVFunction 375 const BlockVector &Blocks, uint64_t &Count); 376 static void getCyclesCount(const BlockVector &Blocks, uint64_t &Count); 377 static uint64_t getLineCount(const BlockVector &Blocks); 404 BlockLines Blocks; member in struct:llvm::FileInfo::LineData 428 LineInfo[Filename].Blocks[Line - 1].push_back(Block);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | LoopInfo.h | 80 std::vector<BlockT *> Blocks; member in class:llvm::LoopBase 156 return Blocks; 170 return Blocks.size(); 177 return Blocks; 405 Blocks.push_back(BB); 409 /// interface to reverse Blocks[from, end of loop] in this loop 412 std::reverse(Blocks.begin() + from, Blocks.end()); 415 /// interface to do reserve() for Blocks 418 Blocks [all...] |