Home
last modified time | relevance | path

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

1234567

/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dallocator_common.h24 memcpy(Blocks, Array, sizeof(Blocks[0]) * Count); in setFromArray()
28 memcpy(Blocks + Count, Array, sizeof(Blocks[0]) * N); in appendFromArray()
36 memcpy(Blocks + Count, B->Blocks + (B->Count - N), sizeof(Blocks[0]) * N); in appendFromBatch()
45 Blocks[Count++] = P; in add()
48 memcpy(Array, Blocks, sizeof(Blocks[0]) * Count); in moveToArray()
54 memcpy(Array, Blocks + Count - N, sizeof(Blocks[0]) * N); in moveNToArray()
61 return Blocks[I]; in get()
67 CompactPtrT Blocks[]; member
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp164 unsigned BasicBlock::topologicalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalSort() argument
169 ID = Block->topologicalSort(Blocks, ID); in topologicalSort()
174 Blocks[BlockID] = this; in topologicalSort()
188 unsigned BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalFinalSort() argument
195 ID = DominatorNode.Parent->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
197 ID = Pred->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
198 assert(static_cast<size_t>(ID) < Blocks.size()); in topologicalFinalSort()
200 Blocks[BlockID] = this; in topologicalFinalSort()
261 for (auto *Block : Blocks) in renumberInstrs()
291 unsigned NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size()); in computeNormalForm()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DJITLink.cpp167 for (auto *B : Blocks) in ~Section()
181 std::vector<Block *> LinkGraph::splitBlockImpl(std::vector<Block *> Blocks, in splitBlockImpl() argument
183 assert(!Blocks.empty() && "Blocks must at least contain the original block"); in splitBlockImpl()
186 ArrayRef<char> Content = Blocks.front()->getContent(); in splitBlockImpl()
187 for (size_t I = 0; I != Blocks.size() - 1; ++I) { in splitBlockImpl()
188 Blocks[I]->setContent( in splitBlockImpl()
189 Content.slice(Blocks[I]->getAddress() - Blocks[0]->getAddress(), in splitBlockImpl()
190 Blocks[I + 1]->getAddress() - Blocks[I]->getAddress())); in splitBlockImpl()
192 Blocks.back()->setContent( in splitBlockImpl()
193 Content.slice(Blocks.back()->getAddress() - Blocks[0]->getAddress())); in splitBlockImpl()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/XRay/
H A DProfile.h90 : Blocks(std::move(O.Blocks)), NodeStorage(std::move(O.NodeStorage)), in Profile()
95 Blocks = std::move(O.Blocks);
108 swap(L.Blocks, R.Blocks); in swap()
126 BlockList Blocks; variable
142 const_iterator begin() const { return Blocks.begin(); } in begin()
143 const_iterator end() const { return Blocks.end(); } in end()
144 bool empty() const { return Blocks.empty(); } in empty()
/freebsd/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 __anon5f812d3b0111::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 __anon5f812d3b0111::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/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLockstepReverseIterator.h47 ArrayRef<BasicBlock *> Blocks; variable
52 LockstepReverseIterator(ArrayRef<BasicBlock *> Blocks) : Blocks(Blocks) { in LockstepReverseIterator() argument
60 this->ActiveBlocks.insert_range(Blocks); in reset()
63 for (BasicBlock *BB : Blocks) { in reset()
94 void restrictToBlocks(SmallSetVector<BasicBlock *, 4> &Blocks) { in restrictToBlocks() argument
97 if (!Blocks.contains((*It)->getParent())) { in restrictToBlocks()
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()
258 Block.Index = Func.Blocks.size(); in createFlowFunction()
259 Func.Blocks.push_back(Block); in createFlowFunction()
275 Func.Blocks[Src].SuccJumps.push_back(&Jump); in createFlowFunction()
276 Func.Blocks[Dst].PredJumps.push_back(&Jump); in createFlowFunction()
283 for (size_t I = 0; I < Func.Blocks.size(); I++) { in createFlowFunction()
284 if (Func.Blocks[I].isEntry()) { in createFlowFunction()
292 auto &EntryBlock = Func.Blocks[Func.Entry]; in createFlowFunction()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCodeExtractor.cpp272 Blocks(buildExtractionBlockSet(BBs, DT, AllowVarArgs, AllowAlloca)), in CodeExtractor()
277 static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInRegion() argument
279 if (Blocks.count(I->getParent())) in definedInRegion()
287 static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInCaller() argument
290 if (!Blocks.count(I->getParent())) in definedInCaller()
295 static BasicBlock *getCommonExitBlock(const SetVector<BasicBlock *> &Blocks) { in getCommonExitBlock() argument
300 if (Blocks.count(Succ)) in getCommonExitBlock()
312 if (any_of(Blocks, hasNonCommonExitSucc)) in getCommonExitBlock()
384 Function *Func = (*Blocks.begin())->getParent(); in isLegalToShrinkwrapLifetimeMarkers()
386 if (Blocks.count(&BB)) in isLegalToShrinkwrapLifetimeMarkers()
[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.size(); } in NumBlocks()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/
H A DLinePrinter.cpp148 ArrayRef<support::ulittle32_t> Blocks = Layout.Blocks; in computeBlockRuns() local
149 assert(!Blocks.empty()); in computeBlockRuns()
151 uint32_t CurrentBlock = Blocks[0]; in computeBlockRuns()
153 while (!Blocks.empty()) { in computeBlockRuns()
155 uint32_t NextBlock = Blocks.front(); in computeBlockRuns()
165 Blocks = Blocks.drop_front(); in computeBlockRuns()
253 auto Blocks = ArrayRef(StreamLayout.Blocks); in formatMsfStreamBlocks() local
258 assert(!Blocks.empty()); in formatMsfStreamBlocks()
259 OS << formatv("Block {0} (\n", uint32_t(Blocks.front())); in formatMsfStreamBlocks()
263 cantFail(File.getBlockData(Blocks.front(), File.getBlockSize())); in formatMsfStreamBlocks()
[all …]
/freebsd/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()
421 Blocks.push_back(BB); in addBlockEntry()
428 std::reverse(Blocks.begin() + from, Blocks.end()); in reverseBlock()
434 Blocks.reserve(size); in reserveBlocks()
441 if (Blocks[0] == BB) in moveToHeader()
444 assert(i != Blocks.size() && "Loop does not contain BB!"); in moveToHeader()
445 if (Blocks[i] == BB) { in moveToHeader()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIOptimizeVGPRLiveRange.cpp120 SmallSetVector<MachineBasicBlock *, 2> &Blocks,
192 SmallSetVector<MachineBasicBlock *, 16> &Blocks) const { in collectElseRegionBlocks()
200 Blocks.insert(Pred); in collectElseRegionBlocks()
203 if (Cur < Blocks.size()) in collectElseRegionBlocks()
204 MBB = Blocks[Cur++]; in collectElseRegionBlocks()
211 for (auto *MBB : Blocks) in collectElseRegionBlocks()
340 SmallSetVector<MachineBasicBlock *, 2> &Blocks, in collectWaterfallCandidateRegisters() argument
346 Blocks.insert(MBB); in collectWaterfallCandidateRegisters()
379 if (!Blocks.contains(DefMBB) && !CandidateRegs.contains(MOReg)) { in collectWaterfallCandidateRegisters()
386 if (!Blocks.contains(Succ) && in collectWaterfallCandidateRegisters()
[all …]
/freebsd/contrib/llvm-project/llvm/tools/bugpoint/
H A DCrashDebugger.cpp470 SmallPtrSet<BasicBlock *, 8> Blocks; in TestBlocks() local
472 Blocks.insert(cast<BasicBlock>(VMap[BB])); in TestBlocks()
475 unsigned NumPrint = Blocks.size(); in TestBlocks()
480 if (NumPrint < Blocks.size()) in TestBlocks()
481 outs() << "... <" << Blocks.size() << " total>"; in TestBlocks()
487 if (!Blocks.count(&BB) && BB.getTerminator()->getNumSuccessors()) { in TestBlocks()
513 for (BasicBlock *BB : Blocks) in TestBlocks()
520 if (!Blocks.count(&BB)) in TestBlocks()
583 SmallPtrSet<const BasicBlock *, 8> Blocks; in TestBlocks() local
585 Blocks.insert(cast<BasicBlock>(VMap[BB])); in TestBlocks()
[all …]
/freebsd/contrib/llvm-project/clang/lib/AST/ByteCode/
H A DEvaluationResult.cpp179 llvm::SetVector<const Block *> &Blocks) { in collectBlocks() argument
188 Blocks.insert(Ptr.block()); in collectBlocks()
198 collectBlocks(FieldPtr, Blocks); in collectBlocks()
202 if (isUsefulPtr(Pointee) && !Blocks.contains(Pointee.block())) in collectBlocks()
203 collectBlocks(Pointee, Blocks); in collectBlocks()
208 if (isUsefulPtr(ElemPointee) && !Blocks.contains(ElemPointee.block())) in collectBlocks()
209 collectBlocks(ElemPointee, Blocks); in collectBlocks()
214 collectBlocks(ElemPtr, Blocks); in collectBlocks()
224 llvm::SetVector<const Block *> Blocks; in checkReturnValue() local
226 collectBlocks(Ptr, Blocks); in checkReturnValue()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVNSink.cpp112 SmallVector<BasicBlock *, 4> Blocks; member
143 SmallVector<BasicBlock *, 4> Blocks; member in __anonac6bc9b30111::ModelledPHI
165 Blocks.push_back(P.first); in ModelledPHI()
181 assert(Values.size() > 1 && Blocks.size() > 1 && in verifyModelledPHI()
187 assert(llvm::is_sorted(Blocks, ComesBefore)); in verifyModelledPHI()
191 assert(cast<Instruction>(V)->getParent() == Blocks[C]); in verifyModelledPHI()
203 llvm::append_range(Blocks, B); in ModelledPHI()
211 llvm::append_range(Blocks, B); in ModelledPHI()
219 auto BI = Blocks.begin(); in restrictToBlocks()
221 while (BI != Blocks.end()) { in restrictToBlocks()
[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.empty() && "a chain should have at least one block"); in BCECmpChain()
480 for (BasicBlock *const Block : Blocks) { in BCECmpChain()
[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/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DPostOrderCFGView.h108 std::vector<const CFGBlock *> Blocks; variable
121 iterator begin() { return Blocks.rbegin(); } in begin()
122 iterator end() { return Blocks.rend(); } in end()
124 const_iterator begin() const { return Blocks.rbegin(); } in begin()
125 const_iterator end() const { return Blocks.rend(); } in end()
/freebsd/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 in createIndexedStream()
[all...]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleInfo.h68 BlockSetVectorT Blocks; variable
83 Blocks.clear(); in clear()
95 Blocks.insert(Block); in appendBlock()
135 bool contains(const BlockT *Block) const { return Blocks.contains(Block); } in contains()
204 return const_block_iterator{Blocks.begin()}; in block_begin()
207 return const_block_iterator{Blocks.end()}; in block_end()
209 size_t getNumBlocks() const { return Blocks.size(); } in getNumBlocks()
247 for (auto *Block : Blocks) { in print()
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/Analysis/
H A DSPIRVConvergenceRegionAnalysis.cpp92 if (Child->Blocks.count(Entry) != 0) { in findParentRegion()
118 Blocks.insert(&B); in ConvergenceRegion()
127 SmallPtrSet<BasicBlock *, 8> &&Blocks, SmallPtrSet<BasicBlock *, 2> &&Exits) in ConvergenceRegion() argument
129 Exits(std::move(Exits)), Blocks(std::move(Blocks)) { in ConvergenceRegion()
131 assert(this->Blocks.count(BB) != 0); in ConvergenceRegion()
132 assert(this->Blocks.count(this->Entry) != 0); in ConvergenceRegion()
171 for (const auto &Block : Blocks) { in dump()
H A DSPIRVConvergenceRegionAnalysis.h57 SmallPtrSet<BasicBlock *, 8> Blocks = {}; variable
66 BasicBlock *Entry, SmallPtrSet<BasicBlock *, 8> &&Blocks,
74 Blocks(std::move(CR.Blocks)) {} in ConvergenceRegion()
80 bool contains(const BasicBlock *BB) const { return Blocks.count(BB) != 0; } in contains()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DEdgeBundles.cpp72 Blocks.clear(); in init()
73 Blocks.resize(getNumBundles()); in init()
78 Blocks[b0].push_back(i); in init()
80 Blocks[b1].push_back(i); in init()
H A DMachinePostDominators.cpp99 ArrayRef<MachineBasicBlock *> Blocks) const { in findNearestCommonDominator()
100 assert(!Blocks.empty()); in findNearestCommonDominator()
102 MachineBasicBlock *NCD = Blocks.consume_front(); in findNearestCommonDominator()
103 for (MachineBasicBlock *BB : Blocks) { in findNearestCommonDominator()

1234567