/freebsd-current/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-current/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-current/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | EdgeBundles.h | 32 /// Blocks - Map each bundle to a list of basic block numbers. 33 SmallVector<SmallVector<unsigned, 8>, 4> Blocks; member in class:llvm::EdgeBundles 47 ArrayRef<unsigned> getBlocks(unsigned Bundle) const { return Blocks[Bundle]; }
|
/freebsd-current/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);
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | FlattenCFGPass.cpp | 51 std::vector<WeakVH> Blocks; local 52 Blocks.reserve(F.size()); 54 Blocks.push_back(&BB); 60 for (WeakVH &BlockHandle : Blocks) {
|
H A D | GVNSink.cpp | 113 ArrayRef<BasicBlock *> Blocks; member in class:__anon2907::LockstepReverseIterator 119 LockstepReverseIterator(ArrayRef<BasicBlock *> Blocks) : Blocks(Blocks) { argument 126 for (BasicBlock *BB : Blocks) 129 for (BasicBlock *BB : Blocks) { 145 // ActiveBlocks will be later copied to Blocks using std::copy. The 146 // resultant order of elements in Blocks needs to be deterministic. 148 // copying. And we cannot simply sort Blocks as they need to match the 152 void restrictToBlocks(SmallSetVector<BasicBlock *, 4> &Blocks) { argument 193 SmallVector<BasicBlock *, 4> Blocks; member in struct:__anon2907::SinkingInstructionCandidate 224 SmallVector<BasicBlock *, 4> Blocks; member in class:__anon2907::ModelledPHI [all...] |
/freebsd-current/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-current/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | FixIrreducible.cpp | 116 SetVector<BasicBlock *> &Blocks, 125 return L == NewLoop || !Blocks.contains(L->getHeader()); 166 SetVector<BasicBlock *> &Blocks, 171 assert(Blocks.count(H)); 220 for (auto *BB : Blocks) { 233 reconnectChildLoops(LI, ParentLoop, NewLoop, Blocks, Headers); 254 SetVector<BasicBlock *> &Blocks, 256 createNaturalLoopInternal(LI, DT, nullptr, Blocks, Headers); 260 SetVector<BasicBlock *> &Blocks, 262 createNaturalLoopInternal(LI, DT, &L, Blocks, Header 115 reconnectChildLoops(LoopInfo &LI, Loop *ParentLoop, Loop *NewLoop, SetVector<BasicBlock *> &Blocks, SetVector<BasicBlock *> &Headers) argument 164 createNaturalLoopInternal(LoopInfo &LI, DominatorTree &DT, Loop *ParentLoop, SetVector<BasicBlock *> &Blocks, SetVector<BasicBlock *> &Headers) argument 253 createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Function *F, SetVector<BasicBlock *> &Blocks, SetVector<BasicBlock *> &Headers) argument 259 createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Loop &L, SetVector<BasicBlock *> &Blocks, SetVector<BasicBlock *> &Headers) argument 272 SetVector<BasicBlock *> Blocks; local [all...] |
H A D | CodeExtractor.cpp | 253 Blocks(buildExtractionBlockSet(BBs, DT, AllowVarArgs, AllowAlloca)), 262 Blocks(buildExtractionBlockSet(L.getBlocks(), &DT, 269 static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { argument 271 if (Blocks.count(I->getParent())) 279 static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { argument 282 if (!Blocks.count(I->getParent())) 287 static BasicBlock *getCommonExitBlock(const SetVector<BasicBlock *> &Blocks) { argument 292 if (Blocks.count(Succ)) 304 if (any_of(Blocks, hasNonCommonExitSucc)) 376 Function *Func = (*Blocks 1075 eraseLifetimeMarkersOnInputs(const SetVector<BasicBlock *> &Blocks, const SetVector<Value *> &SunkAllocas, SetVector<Value *> &LifetimesStart) argument [all...] |
H A D | SampleProfileInference.cpp | 626 auto &Block = Func.Blocks[I]; 633 Func.Blocks[Func.Entry].Flow += 1; 636 Func.Blocks[Jump->Target].Flow += 1; 655 for (auto *Jump : Func.Blocks[Src].SuccJumps) { 687 if (Func.Blocks[Source].isExit() && Target == AnyExitBlock) 703 (Func.Blocks[Src].isExit() && Target == AnyExitBlock)) 706 for (auto *Jump : Func.Blocks[Src].SuccJumps) { 722 if (Func.Blocks[I].isExit() && Parent[I] != nullptr) { 758 std::min(Func.Blocks[Func.Entry].Flow, 765 uint64_t NumBlocks() const { return Func.Blocks [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyExceptionInfo.h | 47 std::vector<MachineBasicBlock *> Blocks; member in class:llvm::WebAssemblyException 73 void addToBlocksVector(MachineBasicBlock *MBB) { Blocks.push_back(MBB); } 75 Blocks.push_back(MBB); 78 ArrayRef<MachineBasicBlock *> getBlocks() const { return Blocks; } 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());
|
H A D | WebAssemblyFixIrreducibleControlFlow.cpp | 86 ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks) argument 87 : Entry(Entry), Blocks(Blocks) { 90 for (auto *MBB : Blocks) { 126 const BlockSet &Blocks; member in class:__anon2815::ReachabilityGraph 131 bool inRegion(MachineBasicBlock *MBB) const { return Blocks.count(MBB); } 143 for (auto *MBB : Blocks) { 167 // Blocks that can return to themselves are in a loop. 168 for (auto *MBB : Blocks) { 199 BlockSet &getBlocks() { return Blocks; } 205 BlockSet Blocks; member in class:__anon2815::LoopBlocks 251 processRegion( MachineBasicBlock *Entry, BlockSet &Blocks, MachineFunction &MF) argument 337 makeSingleEntryLoop( BlockSet &Entries, BlockSet &Blocks, MachineFunction &MF, const ReachabilityGraph &Graph) argument [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/ |
H A D | LinePrinter.cpp | 149 ArrayRef<support::ulittle32_t> Blocks = Layout.Blocks; 150 assert(!Blocks.empty()); 152 uint32_t CurrentBlock = Blocks[0]; 154 while (!Blocks.empty()) { 156 uint32_t NextBlock = Blocks.front(); 166 Blocks = Blocks.drop_front(); 254 auto Blocks = ArrayRef(StreamLayout.Blocks); local [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | SampleProfileInference.h | 55 std::vector<FlowBlock> Blocks; member in struct:llvm::FlowFunction 219 BlockWeights[BB] = Func.Blocks[BlockIndex[BB]].Flow; 246 Func.Blocks.reserve(BasicBlocks.size()); 257 Block.Index = Func.Blocks.size(); 258 Func.Blocks.push_back(Block); 274 Func.Blocks[Src].SuccJumps.push_back(&Jump); 275 Func.Blocks[Dst].PredJumps.push_back(&Jump); 282 for (size_t I = 0; I < Func.Blocks.size(); I++) { 283 if (Func.Blocks[I].isEntry()) { 291 auto &EntryBlock = Func.Blocks[Fun [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIOptimizeVGPRLiveRange.cpp | 117 SmallSetVector<MachineBasicBlock *, 2> &Blocks, 185 SmallSetVector<MachineBasicBlock *, 16> &Blocks) const { 192 if (Pred != Flow && !Blocks.contains(Pred)) 193 Blocks.insert(Pred); 196 if (Cur < Blocks.size()) 197 MBB = Blocks[Cur++]; 204 for (auto *MBB : Blocks) 333 SmallSetVector<MachineBasicBlock *, 2> &Blocks, 339 Blocks.insert(MBB); 372 if (!Blocks 330 collectWaterfallCandidateRegisters( MachineBasicBlock *LoopHeader, MachineBasicBlock *LoopEnd, SmallSetVector<Register, 16> &CandidateRegs, SmallSetVector<MachineBasicBlock *, 2> &Blocks, SmallVectorImpl<MachineInstr *> &Instructions) const argument 402 SetVector<MachineBasicBlock *> Blocks; local 552 optimizeWaterfallLiveRange( Register Reg, MachineBasicBlock *LoopHeader, SmallSetVector<MachineBasicBlock *, 2> &Blocks, SmallVectorImpl<MachineInstr *> &Instructions) const argument 690 SmallSetVector<MachineBasicBlock *, 2> Blocks; local [all...] |
/freebsd-current/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-current/contrib/llvm-project/llvm/tools/bugpoint/ |
H A D | CrashDebugger.cpp | 473 SmallPtrSet<BasicBlock *, 8> Blocks; local 475 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]])); 478 unsigned NumPrint = Blocks.size(); 483 if (NumPrint < Blocks.size()) 484 outs() << "... <" << Blocks.size() << " total>"; 490 if (!Blocks.count(&BB) && BB.getTerminator()->getNumSuccessors()) { 516 for (BasicBlock *BB : Blocks) 523 if (!Blocks.count(&BB)) 586 SmallPtrSet<const BasicBlock *, 8> Blocks; local 588 Blocks 684 SmallPtrSet<const BasicBlock *, 8> Blocks; local 1240 std::vector<const BasicBlock *> Blocks; local 1262 std::vector<const BasicBlock *> Blocks; local 1275 std::vector<const BasicBlock *> Blocks; local [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericLoopInfo.h | 65 std::vector<BlockT *> Blocks; member in class:llvm::LoopBase 175 return Blocks; 189 return Blocks.size(); 196 return Blocks; 417 Blocks.push_back(BB); 421 /// interface to reverse Blocks[from, end of loop] in this loop 424 std::reverse(Blocks.begin() + from, Blocks.end()); 427 /// interface to do reserve() for Blocks 430 Blocks [all...] |
H A D | GenericIteratedDominanceFrontier.h | 74 void setDefiningBlocks(const SmallPtrSetImpl<NodeTy *> &Blocks) { argument 75 DefBlocks = &Blocks; 83 void setLiveInBlocks(const SmallPtrSetImpl<NodeTy *> &Blocks) { argument 84 LiveInBlocks = &Blocks;
|
/freebsd-current/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/ |
H A D | Logger.cpp | 52 unsigned Blocks = 0, Steps = 0; variable 54 ++Blocks; 57 llvm::errs() << "=== Finished analysis: " << Blocks << " blocks in "
|
/freebsd-current/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | FunctionSummary.h | 97 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks; local 99 if (TotalIDs > Blocks.size()) { 100 Blocks.resize(TotalIDs); 103 Blocks.set(ID); 98 assert(ID < TotalIDs); if (TotalIDs > Blocks.size()) argument
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/DebugInfo/MSF/ |
H A D | MSFBuilder.h | 74 Expected<uint32_t> addStream(uint32_t Size, ArrayRef<uint32_t> Blocks); 125 Error allocateBlocks(uint32_t NumBlocks, MutableArrayRef<uint32_t> Blocks);
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | GenericCycleInfo.h | 68 BlockSetVectorT Blocks; 80 Blocks.clear(); 86 void appendBlock(BlockT *Block) { Blocks.insert(Block); } 111 bool contains(const BlockT *Block) const { return Blocks.contains(Block); } 173 return const_block_iterator{Blocks.begin()}; 176 return const_block_iterator{Blocks.end()}; 178 size_t getNumBlocks() const { return Blocks.size(); } 211 for (auto *Block : Blocks) {
|