Searched refs:BB (Results 151 - 175 of 550) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DCGProfile.cpp47 for (auto &BB : F) {
48 Optional<uint64_t> BBCount = BFI.getBlockProfileCount(&BB);
51 for (auto &I : BB) {
H A DMaximumSpanningTree.h41 const BasicBlock *BB = dyn_cast_or_null<BasicBlock>(X); local
42 return BB ? BB->size() : 0;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DSparsePropagation.h171 bool isBlockExecutable(BasicBlock *BB) const {
172 return BBExecutable.count(BB);
177 void MarkBlockExecutable(BasicBlock *BB);
185 /// markEdgeExecutable - Mark a basic block as executable, adding it to the BB
259 BasicBlock *BB) {
260 if (!BBExecutable.insert(BB).second)
262 LLVM_DEBUG(dbgs() << "Marking Block Executable: " << BB->getName() << "\n");
263 BBWorkList.push_back(BB); // Add the block to the work list!
388 BasicBlock *BB = TI.getParent(); local
393 markEdgeExecutable(BB, T
258 MarkBlockExecutable( BasicBlock *BB) argument
488 BasicBlock *BB = BBWorkList.back(); local
[all...]
H A DRegionInfo.h100 static unsigned getNumSuccessors(BasicBlock *BB) { argument
101 return BB->getTerminator()->getNumSuccessors();
130 /// In the BBtoRegionNode map of the parent of this node, BB will always map
291 /// Check if a BB is in this Region. This check also works
293 void verifyBBInRegion(BlockT *BB) const;
295 /// Walk over all the BBs of the region starting from BB and
298 void verifyWalk(BlockT *BB, std::set<BlockT *> *visitedBB) const;
330 /// @param BB The new entry basic block of the region.
331 void replaceEntry(BlockT *BB);
336 /// @param BB Th
[all...]
H A DSyncDependenceAnalysis.h44 bool inRegion(const BasicBlock &BB) const;
H A DCodeMetrics.h79 void analyzeBasicBlock(const BasicBlock *BB, const TargetTransformInfo &TTI,
H A DDominanceFrontier.h87 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier) { argument
88 assert(find(BB) == end() && "Block already in DominanceFrontier!");
89 return Frontiers.insert(std::make_pair(BB, frontier)).first;
92 /// removeBlock - Remove basic block BB's frontier.
93 void removeBlock(BlockT *BB);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/BPF/
H A DBPFISelLowering.h55 MachineBasicBlock *BB) const override;
126 unsigned EmitSubregExt(MachineInstr &MI, MachineBasicBlock *BB, unsigned Reg,
130 MachineBasicBlock *BB)
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInstSimplifyPass.cpp37 for (BasicBlock &BB : F) {
40 if (!SQ.DT->isReachableFromEntry(&BB))
44 for (Instruction &I : BB) {
H A DLICM.cpp135 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI);
355 for (auto *BB : L->getBlocks()) {
356 if (auto *Accesses = MSSA->getBlockAccesses(BB)) {
519 BasicBlock *BB = DTN->getBlock(); local
522 if (inSubLoop(BB, CurLoop, LI))
525 for (BasicBlock::iterator II = BB->end(); II != BB->begin();) {
631 auto IsSucc = [&](BasicBlock &BB) { return TrueDestSucc.count(&BB); };
656 BasicBlock *BB local
687 getOrCreateHoistedBlock(BasicBlock *BB) argument
1314 const BasicBlock *BB = GEP->getParent(); local
1341 const BasicBlock *BB = PN->getParent(); local
1484 BasicBlock *BB = PN->getParent(); local
1612 BasicBlock *BB = PN->getIncomingBlock(U); local
2346 inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI) argument
[all...]
H A DSCCP.cpp280 bool MarkBlockExecutable(BasicBlock *BB) { argument
281 if (!BBExecutable.insert(BB).second)
283 LLVM_DEBUG(dbgs() << "Marking Block Executable: " << BB->getName() << '\n');
284 BBWorkList.push_back(BB); // Add the block to the work list!
347 bool isBlockExecutable(BasicBlock *BB) const {
348 return BBExecutable.count(BB);
553 /// markEdgeExecutable - Mark a basic block as executable, adding it to the BB
865 BasicBlock *BB = TI.getParent(); local
870 markEdgeExecutable(BB, TI.getSuccessor(i));
1406 BasicBlock *BB local
[all...]
H A DLoopDataPrefetch.cpp225 for (const auto BB : L->blocks()) {
228 for (auto &I : *BB)
234 Metrics.analyzeBasicBlock(BB, *TTI, EphValues);
252 for (const auto BB : L->blocks()) {
253 for (auto &I : *BB) {
309 Type *I8Ptr = Type::getInt8PtrTy(BB->getContext(), PtrAddrSpace);
314 Module *M = BB->getParent()->getParent();
315 Type *I32 = Type::getInt32Ty(BB->getContext());
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DMetaRenamer.cpp150 for (auto &BB : F) {
151 BB.setName("bb");
153 for (auto &I : BB)
H A DDebugify.cpp47 Instruction *findTerminatingInstruction(BasicBlock &BB) { argument
48 if (auto *I = BB.getTerminatingMustTailCall())
50 if (auto *I = BB.getTerminatingDeoptimizeCall())
52 return BB.getTerminator();
98 for (BasicBlock &BB : F) {
100 for (Instruction &I : BB)
104 if (BB.isEHPad())
109 Instruction *LastInst = findTerminatingInstruction(BB);
114 BasicBlock::iterator InsertPt = BB.getFirstInsertionPt();
115 assert(InsertPt != BB
[all...]
H A DLCSSA.cpp70 static bool isExitBlock(BasicBlock *BB, argument
72 return is_contained(ExitBlocks, BB);
98 assert(L && "Instruction belongs to a BB that's not part of a loop");
151 // If we already inserted something for this BB, don't reprocess it.
283 for (BasicBlock *BB : ExitBlocks)
284 BBWorklist.push_back(BB);
287 BasicBlock *BB = BBWorklist.pop_back_val(); local
290 if (L.getHeader() == BB)
295 BasicBlock *IDomBB = DT.getNode(BB)->getIDom()->getBlock();
349 for (BasicBlock *BB
[all...]
H A DEscapeEnumerator.cpp57 for (BasicBlock &BB : F)
58 for (Instruction &II : BB)
85 // cleanup block. Go in reverse order to make prettier BB names.
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorizationLegality.cpp359 static bool canIfConvertPHINodes(BasicBlock *BB) { argument
360 for (PHINode &Phi : BB->phis()) {
396 // Check that all of the users of the loop are inside the BB.
430 for (BasicBlock *BB : TheLoop->blocks()) {
431 // Check whether the BB terminator is a BranchInst. Any other terminator is
433 auto *Br = dyn_cast<BranchInst>(BB->getTerminator());
578 for (BasicBlock *BB : TheLoop->blocks()) {
580 for (Instruction &I : *BB) {
595 if (BB != Header) {
885 bool LoopVectorizationLegality::blockNeedsPredication(BasicBlock *BB) { argument
889 blockCanBePredicated( BasicBlock *BB, SmallPtrSetImpl<Value *> &SafePtrs, bool PreserveGuards) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonVectorLoopCarriedReuse.cpp299 Value *findValueInBlock(Value *Op, BasicBlock *BB);
463 BasicBlock *BB = PN->getParent(); local
472 if (User->getParent() != BB)
502 if (BEUser->getParent() != BB)
595 BasicBlock *BB) {
598 Value *ValueInBlock = PN->getIncomingValueForBlock(BB);
635 BasicBlock *BB = BEInst->getParent(); local
636 IRBuilder<> IRB(BB);
637 IRB.SetInsertPoint(BB->getFirstNonPHI());
644 NewPhi->addIncoming(BEVal, BB);
594 findValueInBlock(Value *Op, BasicBlock *BB) argument
696 BasicBlock *BB = PN->getParent(); local
730 BasicBlock *BB = CurLoop->getHeader(); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DMemoryDependenceAnalysis.cpp186 BasicBlock *BB) {
190 while (ScanIt != BB->begin()) {
236 if (BB != &BB->getParent()->getEntryBlock())
330 BasicBlock *BB, Instruction *QueryInst, unsigned *Limit,
335 InvariantGroupDependency = getInvariantGroupPointerDependency(LI, BB);
342 MemLoc, isLoad, ScanIt, BB, QueryInst, Limit, OBB);
358 BasicBlock *BB) {
428 if (ClosestDependency->getParent() == BB)
443 BasicBlock *BB, Instructio
184 getCallDependencyFrom( CallBase *Call, bool isReadOnlyCall, BasicBlock::iterator ScanIt, BasicBlock *BB) argument
328 getPointerDependencyFrom( const MemoryLocation &MemLoc, bool isLoad, BasicBlock::iterator ScanIt, BasicBlock *BB, Instruction *QueryInst, unsigned *Limit, OrderedBasicBlock *OBB) argument
357 getInvariantGroupPointerDependency(LoadInst *LI, BasicBlock *BB) argument
441 getSimplePointerDependencyFrom( const MemoryLocation &MemLoc, bool isLoad, BasicBlock::iterator ScanIt, BasicBlock *BB, Instruction *QueryInst, unsigned *Limit, OrderedBasicBlock *OBB) argument
978 GetNonLocalInfoForBlock( Instruction *QueryInst, const MemoryLocation &Loc, bool isLoad, BasicBlock *BB, NonLocalDepInfo *Cache, unsigned NumSortedEntries) argument
1235 BasicBlock *BB = Worklist.pop_back_val(); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.cpp153 for (const BasicBlock &BB : F)
154 orderValue(&BB, OM);
157 for (const BasicBlock &BB : F)
158 for (const Instruction &I : BB)
163 for (const BasicBlock &BB : F)
164 for (const Instruction &I : BB)
277 for (const BasicBlock &BB : F)
278 predictValueUseListOrder(&BB, &F, OM, Stack);
281 for (const BasicBlock &BB : F)
282 for (const Instruction &I : BB)
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h69 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase *iDom) argument
70 : TheBB(BB), IDom(iDom), Level(IDom ? IDom->Level + 1 : 0) {}
306 NodeT *BB = DomTreeNode.first; local
308 OtherDomTreeNodes.find(BB);
328 DomTreeNodeBase<NodeT> *getNode(const NodeT *BB) const {
329 auto I = DomTreeNodes.find(BB);
336 DomTreeNodeBase<NodeT> *operator[](const NodeT *BB) const {
337 return getNode(BB);
564 /// \param BB New node in CFG.
565 /// \param DomBB CFG node that is dominator for BB
568 addNewBlock(NodeT *BB, NodeT *DomBB) argument
582 setNewRoot(NodeT *BB) argument
613 changeImmediateDominator(NodeT *BB, NodeT *NewBB) argument
620 eraseNode(NodeT *BB) argument
758 addRoot(NodeT *BB) argument
[all...]
H A DGenericIteratedDominanceFrontier.h147 for (NodeTy *BB : *DefBlocks) {
148 if (DomTreeNodeBase<NodeTy> *Node = DT.getNode(BB))
173 NodeTy *BB = Node->getBlock(); local
196 for (auto Succ : ChildrenGetter.get(BB))
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUAnnotateUniformValues.cpp107 for (auto &BB : Checklist) {
108 BasicBlock::iterator StartIt = (!L && (BB == Load->getParent())) ?
109 BasicBlock::iterator(Load) : BB->end();
111 StartIt, BB, Load);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Frontend/OpenMP/
H A DOMPIRBuilder.cpp274 BasicBlock *BB = Builder.GetInsertBlock(); local
276 if (Builder.GetInsertPoint() == BB->end()) {
280 BB->getContext(), BB->getName() + ".cont", BB->getParent());
282 NonCancellationBlock = SplitBlock(BB, &*Builder.GetInsertPoint());
283 BB->getTerminator()->eraseFromParent();
284 Builder.SetInsertPoint(BB);
287 BB->getContext(), BB
435 BasicBlock *BB = Worklist.pop_back_val(); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXLowerAlloca.cpp69 for (auto &BB : F)
70 for (auto &I : BB) {

Completed in 213 milliseconds

1234567891011>>