Home
last modified time | relevance | path

Searched refs:BB (Results 1 – 25 of 1306) sorted by relevance

12345678910>>...53

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Mips/
DMips16ISelLowering.cpp165 MachineBasicBlock *BB) const { in EmitInstrWithCustomInserter()
168 return MipsTargetLowering::EmitInstrWithCustomInserter(MI, BB); in EmitInstrWithCustomInserter()
170 return emitSel16(Mips::BeqzRxImm16, MI, BB); in EmitInstrWithCustomInserter()
172 return emitSel16(Mips::BnezRxImm16, MI, BB); in EmitInstrWithCustomInserter()
174 return emitSeliT16(Mips::Bteqz16, Mips::CmpiRxImmX16, MI, BB); in EmitInstrWithCustomInserter()
176 return emitSeliT16(Mips::Bteqz16, Mips::SltiRxImmX16, MI, BB); in EmitInstrWithCustomInserter()
178 return emitSeliT16(Mips::Bteqz16, Mips::SltiuRxImmX16, MI, BB); in EmitInstrWithCustomInserter()
180 return emitSeliT16(Mips::Btnez16, Mips::CmpiRxImmX16, MI, BB); in EmitInstrWithCustomInserter()
182 return emitSeliT16(Mips::Btnez16, Mips::SltiRxImmX16, MI, BB); in EmitInstrWithCustomInserter()
184 return emitSeliT16(Mips::Btnez16, Mips::SltiuRxImmX16, MI, BB); in EmitInstrWithCustomInserter()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/
Dcfa.h31 template <class BB>
33 using bb_ptr = BB*;
34 using cbb_ptr = const BB*;
35 using bb_iter = typename std::vector<BB*>::const_iterator;
36 using get_blocks_func = std::function<const std::vector<BB*>*(const BB*)>;
76 const BB* entry, get_blocks_func successor_func,
106 static std::vector<std::pair<BB*, BB*>> CalculateDominators(
114 static std::vector<BB*> TraversalRoots(const std::vector<BB*>& blocks,
119 std::vector<BB*>& ordered_blocks, BB* pseudo_entry_block,
120 BB* pseudo_exit_block,
[all …]
/third_party/skia/third_party/externals/spirv-tools/source/
Dcfa.h31 template <class BB>
33 using bb_ptr = BB*;
34 using cbb_ptr = const BB*;
35 using bb_iter = typename std::vector<BB*>::const_iterator;
36 using get_blocks_func = std::function<const std::vector<BB*>*(const BB*)>;
76 const BB* entry, get_blocks_func successor_func,
106 static std::vector<std::pair<BB*, BB*>> CalculateDominators(
114 static std::vector<BB*> TraversalRoots(const std::vector<BB*>& blocks,
119 std::vector<BB*>& ordered_blocks, BB* pseudo_entry_block,
120 BB* pseudo_exit_block,
[all …]
/third_party/spirv-tools/source/
Dcfa.h31 template <class BB>
33 using bb_ptr = BB*;
34 using cbb_ptr = const BB*;
35 using bb_iter = typename std::vector<BB*>::const_iterator;
36 using get_blocks_func = std::function<const std::vector<BB*>*(const BB*)>;
73 static void DepthFirstTraversal(const BB* entry,
102 const BB* entry, get_blocks_func successor_func,
133 static std::vector<std::pair<BB*, BB*>> CalculateDominators(
141 static std::vector<BB*> TraversalRoots(const std::vector<BB*>& blocks,
146 std::vector<BB*>& ordered_blocks, BB* pseudo_entry_block,
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
DJumpThreading.cpp211 static void updatePredecessorProfileMetadata(PHINode *PN, BasicBlock *BB) { in updatePredecessorProfileMetadata() argument
212 BranchInst *CondBr = dyn_cast<BranchInst>(BB->getTerminator()); in updatePredecessorProfileMetadata()
260 auto PredOutEdge = GetPredOutEdge(PN->getIncomingBlock(i), BB); in updatePredecessorProfileMetadata()
383 for (auto &BB : F) in runImpl() local
384 if (!DT.isReachableFromEntry(&BB)) in runImpl()
385 Unreachable.insert(&BB); in runImpl()
394 for (auto &BB : F) { in runImpl() local
395 if (Unreachable.count(&BB)) in runImpl()
397 while (ProcessBlock(&BB)) // Thread all of the branches we can over BB. in runImpl()
402 if (&BB == &F.getEntryBlock() || DTU->isBBPendingDeletion(&BB)) in runImpl()
[all …]
DADCE.cpp104 BasicBlock *BB = nullptr; member
126 bool isLive(BasicBlock *BB) { return BlockInfo[BB].Live; } in isLive() argument
164 void markLive(BlockInfoType &BB);
165 void markLive(BasicBlock *BB) { markLive(BlockInfo[BB]); } in markLive() argument
192 void makeUnconditional(BasicBlock *BB, BasicBlock *Target);
225 for (auto &BB : F) { in initialize() local
226 NumInsts += BB.size(); in initialize()
227 auto &Info = BlockInfo[&BB]; in initialize()
228 Info.BB = &BB; in initialize()
229 Info.Terminator = BB.getTerminator(); in initialize()
[all …]
DLoopSimplifyCFG.cpp58 static BasicBlock *getOnlyLiveSuccessor(BasicBlock *BB) { in getOnlyLiveSuccessor() argument
59 Instruction *TI = BB->getTerminator(); in getOnlyLiveSuccessor()
85 static void removeBlockFromLoops(BasicBlock *BB, Loop *FirstLoop, in removeBlockFromLoops() argument
89 assert(FirstLoop->contains(BB) && "Must be a loop block!"); in removeBlockFromLoops()
92 Current->removeBlockFromLoop(BB); in removeBlockFromLoops()
100 for (BasicBlock *BB : BBs) { in getInnermostLoopFor()
101 Loop *BBL = LI.getLoopFor(BB); in getInnermostLoopFor()
168 for (const BasicBlock *BB : S) in dump() local
169 dbgs() << "\t" << BB->getName() << "\n"; in dump()
174 for (const BasicBlock *BB : S) in dump() local
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DMachineSSAUpdater.cpp66 bool MachineSSAUpdater::HasValueForBlock(MachineBasicBlock *BB) const { in HasValueForBlock()
67 return getAvailableVals(AV).count(BB); in HasValueForBlock()
72 void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, unsigned V) { in AddAvailableValue() argument
73 getAvailableVals(AV)[BB] = V; in AddAvailableValue()
78 unsigned MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) { in GetValueAtEndOfBlock() argument
79 return GetValueAtEndOfBlockInternal(BB); in GetValueAtEndOfBlock()
83 unsigned LookForIdenticalPHI(MachineBasicBlock *BB, in LookForIdenticalPHI() argument
85 if (BB->empty()) in LookForIdenticalPHI()
88 MachineBasicBlock::iterator I = BB->begin(); in LookForIdenticalPHI()
95 while (I != BB->end() && I->isPHI()) { in LookForIdenticalPHI()
[all …]
DWasmEHPrepare.cpp121 void prepareEHPad(BasicBlock *BB, bool NeedLSDA, unsigned Index = 0);
122 void prepareTerminateCleanupPad(BasicBlock *BB);
159 auto *BB = WL.pop_back_val(); in eraseDeadBBsAndChildren() local
160 if (pred_begin(BB) != pred_end(BB)) in eraseDeadBBsAndChildren()
162 WL.append(succ_begin(BB), succ_end(BB)); in eraseDeadBBsAndChildren()
163 DeleteDeadBlock(BB); in eraseDeadBBsAndChildren()
191 auto *BB = ThrowI->getParent(); in prepareThrows() local
192 SmallVector<BasicBlock *, 4> Succs(succ_begin(BB), succ_end(BB)); in prepareThrows()
193 auto &InstList = BB->getInstList(); in prepareThrows()
195 IRB.SetInsertPoint(BB); in prepareThrows()
[all …]
DIfConversion.cpp149 MachineBasicBlock *BB = nullptr; member
285 bool MeetIfcvtSizeLimit(MachineBasicBlock &BB, in MeetIfcvtSizeLimit() argument
288 return Cycle > 0 && TII->isProfitableToIfCvt(BB, Cycle, Extra, in MeetIfcvtSizeLimit()
295 const MachineFunction &MF = *TBBInfo.BB->getParent(); in MeetIfcvtSizeLimit()
297 MachineBasicBlock::iterator TIB = TBBInfo.BB->begin(); in MeetIfcvtSizeLimit()
298 MachineBasicBlock::iterator FIB = FBBInfo.BB->begin(); in MeetIfcvtSizeLimit()
299 MachineBasicBlock::iterator TIE = TBBInfo.BB->end(); in MeetIfcvtSizeLimit()
300 MachineBasicBlock::iterator FIE = FBBInfo.BB->end(); in MeetIfcvtSizeLimit()
304 *TBBInfo.BB, *FBBInfo.BB, in MeetIfcvtSizeLimit()
312 for (auto &I : make_range(TBBInfo.BB->begin(), TIB)) { in MeetIfcvtSizeLimit()
[all …]
DUnreachableBlockElim.cpp113 for (MachineBasicBlock *BB : depth_first_ext(&F, Reachable)) in runOnMachineFunction()
114 (void)BB/* Mark all reachable blocks */; in runOnMachineFunction()
120 MachineBasicBlock *BB = &*I; in runOnMachineFunction() local
123 if (!Reachable.count(BB)) { in runOnMachineFunction()
124 DeadBlocks.push_back(BB); in runOnMachineFunction()
127 if (MLI) MLI->removeBlock(BB); in runOnMachineFunction()
128 if (MDT && MDT->getNode(BB)) MDT->eraseNode(BB); in runOnMachineFunction()
130 while (BB->succ_begin() != BB->succ_end()) { in runOnMachineFunction()
131 MachineBasicBlock* succ = *BB->succ_begin(); in runOnMachineFunction()
137 start->getOperand(i).getMBB() == BB) { in runOnMachineFunction()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DBranchProbabilityInfo.cpp150 static void UpdatePDTWorklist(const BasicBlock *BB, PostDominatorTree *PDT, in UpdatePDTWorklist() argument
156 PDT->getDescendants(const_cast<BasicBlock *>(BB), Descendants); in UpdatePDTWorklist()
157 for (auto *BB : Descendants) in UpdatePDTWorklist() local
158 if (TargetSet.insert(BB).second) in UpdatePDTWorklist()
159 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in UpdatePDTWorklist()
169 for (auto &BB : F) { in computePostDominatedByUnreachable() local
170 const Instruction *TI = BB.getTerminator(); in computePostDominatedByUnreachable()
177 BB.getTerminatingDeoptimizeCall()) in computePostDominatedByUnreachable()
178 UpdatePDTWorklist(&BB, PDT, WorkList, PostDominatedByUnreachable); in computePostDominatedByUnreachable()
183 const BasicBlock *BB = WorkList.pop_back_val(); in computePostDominatedByUnreachable() local
[all …]
DCFG.cpp29 const BasicBlock *BB = &F.getEntryBlock(); in FindFunctionBackedges() local
30 if (succ_empty(BB)) in FindFunctionBackedges()
37 Visited.insert(BB); in FindFunctionBackedges()
38 VisitStack.push_back(std::make_pair(BB, succ_begin(BB))); in FindFunctionBackedges()
39 InStack.insert(BB); in FindFunctionBackedges()
47 BB = *I++; in FindFunctionBackedges()
48 if (Visited.insert(BB).second) { in FindFunctionBackedges()
53 if (InStack.count(BB)) in FindFunctionBackedges()
54 Result.push_back(std::make_pair(ParentBB, BB)); in FindFunctionBackedges()
59 InStack.insert(BB); in FindFunctionBackedges()
[all …]
DInstructionPrecedenceTracking.cpp36 const BasicBlock *BB) { in getFirstSpecialInstruction() argument
43 validate(BB); in getFirstSpecialInstruction()
46 if (FirstSpecialInsts.find(BB) == FirstSpecialInsts.end()) { in getFirstSpecialInstruction()
47 fill(BB); in getFirstSpecialInstruction()
48 assert(FirstSpecialInsts.find(BB) != FirstSpecialInsts.end() && "Must be!"); in getFirstSpecialInstruction()
50 return FirstSpecialInsts[BB]; in getFirstSpecialInstruction()
54 const BasicBlock *BB) { in hasSpecialInstructions() argument
55 return getFirstSpecialInstruction(BB) != nullptr; in hasSpecialInstructions()
65 void InstructionPrecedenceTracking::fill(const BasicBlock *BB) { in fill() argument
66 FirstSpecialInsts.erase(BB); in fill()
[all …]
DLazyValueInfo.cpp184 void insertResult(Value *Val, BasicBlock *BB, in insertResult() argument
186 SeenBlocks.insert(BB); in insertResult()
191 OverDefinedCache[BB].insert(Val); in insertResult()
199 It->second->BlockVals[BB] = Result; in insertResult()
203 bool isOverdefined(Value *V, BasicBlock *BB) const { in isOverdefined()
204 auto ODI = OverDefinedCache.find(BB); in isOverdefined()
212 bool hasCachedValueInfo(Value *V, BasicBlock *BB) const { in hasCachedValueInfo()
213 if (isOverdefined(V, BB)) in hasCachedValueInfo()
220 return I->second->BlockVals.count(BB); in hasCachedValueInfo()
223 ValueLatticeElement getCachedValueInfo(Value *V, BasicBlock *BB) const { in getCachedValueInfo()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp58 for (auto *BB : BBs) { in DetatchDeadBlocks() local
62 for (BasicBlock *Succ : successors(BB)) { in DetatchDeadBlocks()
63 Succ->removePredecessor(BB, KeepOneInputPHIs); in DetatchDeadBlocks()
65 Updates->push_back({DominatorTree::Delete, BB, Succ}); in DetatchDeadBlocks()
69 while (!BB->empty()) { in DetatchDeadBlocks()
70 Instruction &I = BB->back(); in DetatchDeadBlocks()
78 BB->getInstList().pop_back(); in DetatchDeadBlocks()
80 new UnreachableInst(BB->getContext(), BB); in DetatchDeadBlocks()
81 assert(BB->getInstList().size() == 1 && in DetatchDeadBlocks()
82 isa<UnreachableInst>(BB->getTerminator()) && in DetatchDeadBlocks()
[all …]
DSSAUpdater.cpp62 bool SSAUpdater::HasValueForBlock(BasicBlock *BB) const { in HasValueForBlock()
63 return getAvailableVals(AV).count(BB); in HasValueForBlock()
66 Value *SSAUpdater::FindValueForBlock(BasicBlock *BB) const { in FindValueForBlock()
67 AvailableValsTy::iterator AVI = getAvailableVals(AV).find(BB); in FindValueForBlock()
71 void SSAUpdater::AddAvailableValue(BasicBlock *BB, Value *V) { in AddAvailableValue() argument
75 getAvailableVals(AV)[BB] = V; in AddAvailableValue()
94 Value *SSAUpdater::GetValueAtEndOfBlock(BasicBlock *BB) { in GetValueAtEndOfBlock() argument
95 Value *Res = GetValueAtEndOfBlockInternal(BB); in GetValueAtEndOfBlock()
99 Value *SSAUpdater::GetValueInMiddleOfBlock(BasicBlock *BB) { in GetValueInMiddleOfBlock() argument
102 if (!HasValueForBlock(BB)) in GetValueInMiddleOfBlock()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
DCFG.h108 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } in pred_begin() argument
109 inline const_pred_iterator pred_begin(const BasicBlock *BB) { in pred_begin() argument
110 return const_pred_iterator(BB); in pred_begin()
112 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end() argument
113 inline const_pred_iterator pred_end(const BasicBlock *BB) { in pred_end() argument
114 return const_pred_iterator(BB, true); in pred_end()
116 inline bool pred_empty(const BasicBlock *BB) { in pred_empty() argument
117 return pred_begin(BB) == pred_end(BB); in pred_empty()
121 inline unsigned pred_size(const BasicBlock *BB) { in pred_size() argument
122 return std::distance(pred_begin(BB), pred_end(BB)); in pred_size()
[all …]
DPredIteratorCache.h42 BasicBlock **GetPreds(BasicBlock *BB) { in GetPreds() argument
43 BasicBlock **&Entry = BlockToPredsMap[BB]; in GetPreds()
47 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); in GetPreds()
50 BlockToPredCountMap[BB] = PredCache.size() - 1; in GetPreds()
57 unsigned GetNumPreds(BasicBlock *BB) const { in GetNumPreds() argument
58 auto Result = BlockToPredCountMap.find(BB); in GetNumPreds()
61 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB)); in GetNumPreds()
65 size_t size(BasicBlock *BB) const { return GetNumPreds(BB); } in size() argument
66 ArrayRef<BasicBlock *> get(BasicBlock *BB) { in get() argument
67 return makeArrayRef(GetPreds(BB), GetNumPreds(BB)); in get()
DInstIterator.h38 BB_i_t BB; // BasicBlocksType::iterator variable
54 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
58 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
61 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor in InstIterator()
62 if (BB != BBs->end()) { in InstIterator()
63 BI = BB->begin(); in InstIterator()
69 : BBs(&m.getBasicBlockList()), BB(BBs->end()) { // end ctor in InstIterator()
73 inline BBIty &getBasicBlockIterator() { return BB; } in getBasicBlockIterator()
80 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
96 while (BB == BBs->end() || BI == BB->begin()) {
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/VE/
DVEInstrInfo.cpp77 MachineBasicBlock *BB = &MBB; in expandExtendStackPseudo() local
78 const BasicBlock *LLVM_BB = BB->getBasicBlock(); in expandExtendStackPseudo()
81 MachineFunction::iterator It = ++(BB->getIterator()); in expandExtendStackPseudo()
86 sinkMBB->splice(sinkMBB->begin(), BB, in expandExtendStackPseudo()
88 BB->end()); in expandExtendStackPseudo()
89 sinkMBB->transferSuccessorsAndUpdatePHIs(BB); in expandExtendStackPseudo()
92 BB->addSuccessor(syscallMBB); in expandExtendStackPseudo()
93 BB->addSuccessor(sinkMBB); in expandExtendStackPseudo()
94 BuildMI(BB, dl, TII.get(VE::BCRLrr)) in expandExtendStackPseudo()
100 BB = syscallMBB; in expandExtendStackPseudo()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
DAMDGPUUnifyDivergentExitNodes.cpp100 BasicBlock &BB) { in isUniformlyReached() argument
104 for (BasicBlock *Pred : predecessors(&BB)) in isUniformlyReached()
123 for (BasicBlock &BB : F) { in removeDoneExport()
124 for (Instruction &I : BB) { in removeDoneExport()
177 for (BasicBlock *BB : ReturningBlocks) { in unifyReturnBlockSet()
181 PN->addIncoming(BB->getTerminator()->getOperand(0), BB); in unifyReturnBlockSet()
184 BB->getTerminator()->eraseFromParent(); in unifyReturnBlockSet()
185 BranchInst::Create(NewRetBlock, BB); in unifyReturnBlockSet()
188 for (BasicBlock *BB : ReturningBlocks) { in unifyReturnBlockSet()
190 simplifyCFG(BB, TTI, {2}); in unifyReturnBlockSet()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/
DPruneEH.cpp52 static void DeleteBasicBlock(BasicBlock *BB, CallGraph &CG);
109 for (const BasicBlock &BB : *F) { in runImpl()
110 const Instruction *TI = BB.getTerminator(); in runImpl()
117 for (const Instruction &I : BB) { in runImpl()
191 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) { in SimplifyFunction() local
192 if (InvokeInst *II = dyn_cast<InvokeInst>(BB->getTerminator())) in SimplifyFunction()
195 removeUnwindEdge(&*BB); in SimplifyFunction()
205 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) in SimplifyFunction()
213 BasicBlock *New = BB->splitBasicBlock(I); in SimplifyFunction()
216 BB->getInstList().pop_back(); in SimplifyFunction()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/
DSafepointIRVerifier.cpp86 const BasicBlock* BB = PN->getParent(); in hasLiveIncomingEdge() local
88 for (const_pred_iterator PredIt(BB), End(BB, true); PredIt != End; ++PredIt) { in hasLiveIncomingEdge()
101 bool isDeadBlock(const BasicBlock *BB) const { in isDeadBlock()
102 return DeadBlocks.count(BB); in isDeadBlock()
115 bool hasLiveIncomingEdges(const BasicBlock *BB) const { in hasLiveIncomingEdges()
117 for (const_pred_iterator PredIt(BB), End(BB, true); PredIt != End; ++PredIt) { in hasLiveIncomingEdges()
130 for (const BasicBlock &BB : F) in processFunction() local
131 if (!DT.isReachableFromEntry(&BB)) in processFunction()
132 DeadBlocks.insert(&BB); in processFunction()
136 for (const BasicBlock *BB : RPOT) { in processFunction() local
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Scalar/
DJumpThreading.h111 bool ProcessBlock(BasicBlock *BB);
112 bool MaybeMergeBasicBlockIntoOnlyPred(BasicBlock *BB);
113 void UpdateSSA(BasicBlock *BB, BasicBlock *NewBB,
119 bool TryThreadEdge(BasicBlock *BB,
122 void ThreadEdge(BasicBlock *BB, const SmallVectorImpl<BasicBlock *> &PredBBs,
125 BasicBlock *BB, const SmallVectorImpl<BasicBlock *> &PredBBs);
128 Value *V, BasicBlock *BB, jumpthreading::PredValueInfo &Result,
133 ComputeValueKnownInPredecessors(Value *V, BasicBlock *BB,
138 return ComputeValueKnownInPredecessorsImpl(V, BB, Result, Preference,
142 bool ProcessThreadableEdges(Value *Cond, BasicBlock *BB,
[all …]

12345678910>>...53