Home
last modified time | relevance | path

Searched refs:Blocks (Results 1 – 25 of 159) sorted by relevance

1234567

/freebsd-src/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp165 unsigned BasicBlock::topologicalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalSort() argument
170 ID = Block->topologicalSort(Blocks, ID); in topologicalSort()
175 Blocks[BlockID] = this; in topologicalSort()
189 unsigned BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalFinalSort() argument
196 ID = DominatorNode.Parent->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
198 ID = Pred->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
199 assert(static_cast<size_t>(ID) < Blocks.size()); in topologicalFinalSort()
201 Blocks[BlockID] = this; in topologicalFinalSort()
262 for (auto *Block : Blocks) in renumberInstrs()
292 unsigned NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size()); in computeNormalForm()
[all …]
H A DPostOrderCFGView.cpp22 Blocks.reserve(cfg->getNumBlockIDs()); in PostOrderCFGView()
27 BlockOrder[*I] = Blocks.size() + 1; in PostOrderCFGView()
28 Blocks.push_back(*I); in PostOrderCFGView()
/freebsd-src/contrib/llvm-project/llvm/include/llvm/XRay/
H A DProfile.h89 : Blocks(std::move(O.Blocks)), NodeStorage(std::move(O.NodeStorage)), in Profile()
94 Blocks = std::move(O.Blocks);
107 swap(L.Blocks, R.Blocks); in swap()
125 BlockList Blocks; variable
141 const_iterator begin() const { return Blocks.begin(); } in begin()
142 const_iterator end() const { return Blocks.end(); } in end()
143 bool empty() const { return Blocks.empty(); } in empty()
/freebsd-src/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp86 ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks) in ReachabilityGraph() argument
87 : Entry(Entry), Blocks(Blocks) { in ReachabilityGraph()
90 for (auto *MBB : Blocks) { in ReachabilityGraph()
126 const BlockSet &Blocks; member in __anon63cd76cd0111::ReachabilityGraph
131 bool inRegion(MachineBasicBlock *MBB) const { return Blocks.count(MBB); } in inRegion()
143 for (auto *MBB : Blocks) { in calculate()
168 for (auto *MBB : Blocks) { in calculate()
199 BlockSet &getBlocks() { return Blocks; } in getBlocks()
205 BlockSet Blocks; member in __anon63cd76cd0111::LoopBlocks
212 Blocks.insert(Entry); in calculate()
[all …]
H A DWebAssemblyExceptionInfo.h47 std::vector<MachineBasicBlock *> Blocks; variable
73 void addToBlocksVector(MachineBasicBlock *MBB) { Blocks.push_back(MBB); } in addToBlocksVector()
75 Blocks.push_back(MBB); in addBlock()
78 ArrayRef<MachineBasicBlock *> getBlocks() const { return Blocks; } in getBlocks()
85 unsigned getNumBlocks() const { return Blocks.size(); } in getNumBlocks()
86 std::vector<MachineBasicBlock *> &getBlocksVector() { return Blocks; } in getBlocksVector()
103 void reserveBlocks(unsigned Size) { Blocks.reserve(Size); } in reserveBlocks()
105 std::reverse(Blocks.begin() + From, Blocks.end());
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp116 SetVector<BasicBlock *> &Blocks, in INITIALIZE_PASS_DEPENDENCY()
125 return L == NewLoop || !Blocks.contains(L->getHeader()); in INITIALIZE_PASS_DEPENDENCY()
166 SetVector<BasicBlock *> &Blocks, in createNaturalLoopInternal() argument
171 assert(Blocks.count(H)); in createNaturalLoopInternal()
220 for (auto *BB : Blocks) { in createNaturalLoopInternal()
233 reconnectChildLoops(LI, ParentLoop, NewLoop, Blocks, Headers); in createNaturalLoopInternal()
254 SetVector<BasicBlock *> &Blocks, in createNaturalLoop() argument
256 createNaturalLoopInternal(LI, DT, nullptr, Blocks, Headers); in createNaturalLoop()
260 SetVector<BasicBlock *> &Blocks, in createNaturalLoop() argument
262 createNaturalLoopInternal(LI, DT, &L, Blocks, Headers); in createNaturalLoop()
[all …]
H A DCodeExtractor.cpp253 Blocks(buildExtractionBlockSet(BBs, DT, AllowVarArgs, AllowAlloca)), in CodeExtractor()
262 Blocks(buildExtractionBlockSet(L.getBlocks(), &DT, in CodeExtractor()
269 static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInRegion() argument
271 if (Blocks.count(I->getParent())) in definedInRegion()
279 static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInCaller() argument
282 if (!Blocks.count(I->getParent())) in definedInCaller()
287 static BasicBlock *getCommonExitBlock(const SetVector<BasicBlock *> &Blocks) { in getCommonExitBlock() argument
292 if (Blocks.count(Succ)) in getCommonExitBlock()
304 if (any_of(Blocks, hasNonCommonExitSucc)) in getCommonExitBlock()
376 Function *Func = (*Blocks in isLegalToShrinkwrapLifetimeMarkers()
1075 eraseLifetimeMarkersOnInputs(const SetVector<BasicBlock * > & Blocks,const SetVector<Value * > & SunkAllocas,SetVector<Value * > & LifetimesStart) eraseLifetimeMarkersOnInputs() argument
[all...]
H A DSampleProfileInference.cpp626 auto &Block = Func.Blocks[I]; in joinIsolatedComponents()
633 Func.Blocks[Func.Entry].Flow += 1; in joinIsolatedComponents()
636 Func.Blocks[Jump->Target].Flow += 1; in joinIsolatedComponents()
655 for (auto *Jump : Func.Blocks[Src].SuccJumps) { in findReachable()
687 if (Func.Blocks[Source].isExit() && Target == AnyExitBlock) in findShortestPath()
703 (Func.Blocks[Src].isExit() && Target == AnyExitBlock)) in findShortestPath()
706 for (auto *Jump : Func.Blocks[Src].SuccJumps) { in findShortestPath()
722 if (Func.Blocks[I].isExit() && Parent[I] != nullptr) { in findShortestPath()
758 std::min(Func.Blocks[Func.Entry].Flow, in jumpDistance()
765 uint64_t NumBlocks() const { return Func.Blocks
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/
H A DLinePrinter.cpp149 ArrayRef<support::ulittle32_t> Blocks = Layout.Blocks; in computeBlockRuns() local
150 assert(!Blocks.empty()); in computeBlockRuns()
152 uint32_t CurrentBlock = Blocks[0]; in computeBlockRuns()
154 while (!Blocks.empty()) { in computeBlockRuns()
156 uint32_t NextBlock = Blocks.front(); in computeBlockRuns()
166 Blocks = Blocks.drop_front(); in computeBlockRuns()
254 auto Blocks = ArrayRef(StreamLayout.Blocks); in formatMsfStreamBlocks() local
259 assert(!Blocks.empty()); in formatMsfStreamBlocks()
260 OS << formatv("Block {0} (\n", uint32_t(Blocks.front())); in formatMsfStreamBlocks()
264 cantFail(File.getBlockData(Blocks.front(), File.getBlockSize())); in formatMsfStreamBlocks()
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIOptimizeVGPRLiveRange.cpp117 SmallSetVector<MachineBasicBlock *, 2> &Blocks,
185 SmallSetVector<MachineBasicBlock *, 16> &Blocks) const { in collectElseRegionBlocks()
192 if (Pred != Flow && !Blocks.contains(Pred)) in collectElseRegionBlocks()
193 Blocks.insert(Pred); in collectElseRegionBlocks()
196 if (Cur < Blocks.size()) in collectElseRegionBlocks()
197 MBB = Blocks[Cur++]; in collectElseRegionBlocks()
204 for (auto *MBB : Blocks) in collectElseRegionBlocks()
333 SmallSetVector<MachineBasicBlock *, 2> &Blocks, in collectWaterfallCandidateRegisters() argument
339 Blocks.insert(MBB); in collectWaterfallCandidateRegisters()
372 if (!Blocks in collectWaterfallCandidateRegisters()
402 SetVector<MachineBasicBlock *> Blocks; updateLiveRangeInThenRegion() local
554 optimizeWaterfallLiveRange(Register Reg,MachineBasicBlock * LoopHeader,SmallSetVector<MachineBasicBlock *,2> & Blocks,SmallVectorImpl<MachineInstr * > & Instructions) const optimizeWaterfallLiveRange() argument
690 SmallSetVector<MachineBasicBlock *, 2> Blocks; runOnMachineFunction() local
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericLoopInfo.h65 std::vector<BlockT *> Blocks; variable
175 return Blocks; in getBlocks()
189 return Blocks.size(); in getNumBlocks()
196 return Blocks; in getBlocksVector()
417 Blocks.push_back(BB); in addBlockEntry()
424 std::reverse(Blocks.begin() + from, Blocks.end()); in reverseBlock()
430 Blocks.reserve(size); in reserveBlocks()
437 if (Blocks[0] == BB) in moveToHeader()
440 assert(i != Blocks.size() && "Loop does not contain BB!"); in moveToHeader()
441 if (Blocks[i] == BB) { in moveToHeader()
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVNSink.cpp113 ArrayRef<BasicBlock *> Blocks; member in __anon75ccf7c50111::LockstepReverseIterator
119 LockstepReverseIterator(ArrayRef<BasicBlock *> Blocks) : Blocks(Blocks) { in LockstepReverseIterator() argument
126 for (BasicBlock *BB : Blocks) in reset()
129 for (BasicBlock *BB : Blocks) { in reset()
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) { in restrictToBlocks() argument
193 SmallVector<BasicBlock *, 4> Blocks; global() member
224 SmallVector<BasicBlock *, 4> Blocks; global() member in __anon75ccf7c50111::ModelledPHI
833 sinkLastInstruction(ArrayRef<BasicBlock * > Blocks,BasicBlock * BBEnd) sinkLastInstruction() argument
[all...]
H A DMergeICmps.cpp405 BCECmpChain(const std::vector<BasicBlock *> &Blocks, PHINode &Phi,
413 [](const auto &Blocks) { return Blocks.size() > 1; }); in atLeastOneMerged() argument
431 static unsigned getMinOrigOrder(const BCECmpChain::ContiguousBlocks &Blocks) { in getMinOrigOrder() argument
433 for (const BCECmpBlock &Block : Blocks) in getMinOrigOrder()
441 mergeBlocks(std::vector<BCECmpBlock> &&Blocks) { in mergeBlocks() argument
445 llvm::sort(Blocks, in mergeBlocks()
452 for (BCECmpBlock &Block : Blocks) { in mergeBlocks()
473 BCECmpChain::BCECmpChain(const std::vector<BasicBlock *> &Blocks, PHINode &Phi, in BCECmpChain() argument
476 assert(!Blocks in BCECmpChain()
697 for (const auto &Blocks : reverse(MergedBlocks_)) { simplify() local
728 for (const auto &Blocks : MergedBlocks_) { simplify() local
745 std::vector<BasicBlock *> Blocks(NumBlocks); getOrderedBlocks() local
832 const auto Blocks = processPhi() local
[all...]
H A DFlattenCFGPass.cpp51 std::vector<WeakVH> Blocks; in iterativelyFlattenCFG() local
52 Blocks.reserve(F.size()); in iterativelyFlattenCFG()
54 Blocks.push_back(&BB); in iterativelyFlattenCFG()
60 for (WeakVH &BlockHandle : Blocks) { in iterativelyFlattenCFG()
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h55 std::vector<FlowBlock> Blocks; member
219 BlockWeights[BB] = Func.Blocks[BlockIndex[BB]].Flow; in apply()
246 Func.Blocks.reserve(BasicBlocks.size()); in createFlowFunction()
257 Block.Index = Func.Blocks.size(); in createFlowFunction()
258 Func.Blocks.push_back(Block); in createFlowFunction()
274 Func.Blocks[Src].SuccJumps.push_back(&Jump); in createFlowFunction()
275 Func.Blocks[Dst].PredJumps.push_back(&Jump); in createFlowFunction()
282 for (size_t I = 0; I < Func.Blocks.size(); I++) { in createFlowFunction()
283 if (Func.Blocks[I].isEntry()) { in createFlowFunction()
291 auto &EntryBlock = Func.Blocks[Func.Entry]; in createFlowFunction()
/freebsd-src/contrib/llvm-project/llvm/tools/bugpoint/
H A DCrashDebugger.cpp473 SmallPtrSet<BasicBlock *, 8> Blocks; in TestBlocks() local
475 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]])); in TestBlocks()
478 unsigned NumPrint = Blocks.size(); in TestBlocks()
483 if (NumPrint < Blocks.size()) in TestBlocks()
484 outs() << "... <" << Blocks.size() << " total>"; in TestBlocks()
490 if (!Blocks.count(&BB) && BB.getTerminator()->getNumSuccessors()) { in TestBlocks()
516 for (BasicBlock *BB : Blocks) in TestBlocks()
523 if (!Blocks.count(&BB)) in TestBlocks()
586 SmallPtrSet<const BasicBlock *, 8> Blocks; in TestBlocks() local
588 Blocks in TestBlocks()
684 SmallPtrSet<const BasicBlock *, 8> Blocks; TestBlocks() local
1240 std::vector<const BasicBlock *> Blocks; DebugACrash() local
1262 std::vector<const BasicBlock *> Blocks; DebugACrash() local
1275 std::vector<const BasicBlock *> Blocks; DebugACrash() local
[all...]
/freebsd-src/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DPostOrderCFGView.h108 std::vector<const CFGBlock *> Blocks;
121 iterator begin() { return Blocks.rbegin(); }
122 iterator end() { return Blocks.rend(); }
124 const_iterator begin() const { return Blocks.rbegin(); }
125 const_iterator end() const { return Blocks.rend(); }
74 std::vector<const CFGBlock *> Blocks; global() variable
/freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachinePostDominators.cpp96 ArrayRef<MachineBasicBlock *> Blocks) const {
97 assert(!Blocks.empty());
99 MachineBasicBlock *NCD = Blocks.front();
100 for (MachineBasicBlock *BB : Blocks.drop_front()) {
H A DEdgeBundles.cpp57 Blocks.clear(); in runOnMachineFunction()
58 Blocks.resize(getNumBundles()); in runOnMachineFunction()
63 Blocks[b0].push_back(i); in runOnMachineFunction()
65 Blocks[b1].push_back(i); in runOnMachineFunction()
/freebsd-src/contrib/llvm-project/llvm/lib/DebugInfo/MSF/
H A DMappedBlockStream.cpp62 SL.Blocks = Layout.StreamMap[StreamIndex]; in createIndexedStream()
73 SL.Blocks = Layout.DirectoryBlocks; in createDirectoryStream()
174 if (StreamLayout.Blocks[Last] != StreamLayout.Blocks[Last + 1] - 1) in readLongestContiguousChunk()
185 uint64_t MsfOffset = blockToOffset(StreamLayout.Blocks[First], BlockSize); in readLongestContiguousChunk()
214 uint64_t E = StreamLayout.Blocks[BlockNum]; in tryReadContiguously()
216 if (StreamLayout.Blocks[I + BlockNum] != E) in tryReadContiguously()
226 uint64_t FirstBlockAddr = StreamLayout.Blocks[BlockNum]; in tryReadContiguously()
250 uint64_t StreamBlockAddr = StreamLayout.Blocks[BlockNum]; in readBytes()
330 SL.Blocks = Layout.StreamMap[StreamIndex]; in createIndexedStream()
340 SL.Blocks = Layout.DirectoryBlocks; in createDirectoryStream()
[all …]
H A DMSFBuilder.cpp104 MutableArrayRef<uint32_t> Blocks) { in allocateBlocks() argument
139 Blocks[I++] = NextBlock; in allocateBlocks()
157 ArrayRef<uint32_t> Blocks) { in addStream() argument
162 if (ReqBlocks != Blocks.size()) in addStream()
166 for (auto Block : Blocks) { in addStream()
176 for (auto Block : Blocks) { in addStream()
179 StreamData.push_back(std::make_pair(Size, Blocks)); in addStream()
412 for (const auto &Blocks : Layout.StreamMap) { in commit() local
413 if (auto EC = DW.writeArray(Blocks)) in commit()
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleInfo.h68 BlockSetVectorT Blocks; variable
80 Blocks.clear(); in clear()
86 void appendBlock(BlockT *Block) { Blocks.insert(Block); } in appendBlock()
111 bool contains(const BlockT *Block) const { return Blocks.contains(Block); } in contains()
177 return const_block_iterator{Blocks.begin()}; in block_end()
180 return const_block_iterator{Blocks.end()}; in blocks()
182 size_t getNumBlocks() const { return Blocks.size(); }
215 for (auto *Block : Blocks) { in print()
/freebsd-src/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DDebugLinesSubsection.cpp78 Blocks.emplace_back(Offset); in createBlock()
82 Block &B = Blocks.back(); in addLineInfo()
93 Block &B = Blocks.back(); in addLineAndColumnInfo()
113 for (const auto &B : Blocks) { in commit()
139 for (const auto &B : Blocks) { in calculateSerializedSize()
/freebsd-src/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DFunctionSummary.h97 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks; in markVisitedBasicBlock() local
99 if (TotalIDs > Blocks.size()) { in markVisitedBasicBlock()
100 Blocks.resize(TotalIDs); in markVisitedBasicBlock()
103 Blocks.set(ID); in markVisitedBasicBlock()
/freebsd-src/contrib/dialog/samples/install/
H A DFDISK.TEST5 Device Boot Begin Start End Blocks Id System
14 Device Boot Begin Start End Blocks Id System
21 Device Boot Begin Start End Blocks Id System

1234567