Searched refs:BB (Results 51 - 75 of 550) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSizeOpts.h67 bool shouldOptimizeForSizeImpl(const BlockT *BB, ProfileSummaryInfo *PSI, argument
69 assert(BB);
84 return AdapterT::isColdBlock(BB, PSI, BFI);
88 BB, PSI, BFI);
97 /// Returns true if basic block \p BB is suggested to be size-optimized based on
99 bool shouldOptimizeForSize(const BasicBlock *BB, ProfileSummaryInfo *PSI,
H A DSSAUpdaterImpl.h45 BlkT *BB; member in class:llvm::SSAUpdaterImpl::BBInfo
69 : BB(ThisBB), AvailableVal(V), DefBB(V ? this : nullptr) {}
90 /// BB and if so, return it. If not, construct SSA form by first
93 ValT GetValue(BlkT *BB) { argument
95 BBInfo *PseudoEntry = BuildBlockList(BB, &BlockList);
97 // Special case: bail out if BB is unreachable.
99 ValT V = Traits::GetUndefVal(BB, Updater);
100 (*AvailableVals)[BB] = V;
108 return BBMap[BB]->DefBB->AvailableVal;
115 BBInfo *BuildBlockList(BlkT *BB, BlockListT argument
389 FindExistingPHI(BlkT *BB, BlockListTy *BlockList) argument
455 BlkT *BB = PHI->getParent(); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DFlattenCFG.cpp40 bool FlattenParallelAndOr(BasicBlock *BB, IRBuilder<> &Builder);
42 /// If \param BB is the merge block of an if-region, attempt to merge
45 bool MergeIfRegion(BasicBlock *BB, IRBuilder<> &Builder);
58 bool run(BasicBlock *BB);
63 /// If \param [in] BB has more than one predecessor that is a conditional
100 /// Case 1: \param BB is on the else-path.
108 /// \ | / BB4 corresponds to \param BB which is also the merge.
109 /// BB => BB4
117 /// Case 2: \param BB BB i
136 FlattenParallelAndOr(BasicBlock *BB, IRBuilder<> &Builder) argument
398 MergeIfRegion(BasicBlock *BB, IRBuilder<> &Builder) argument
485 run(BasicBlock *BB) argument
499 FlattenCFG(BasicBlock *BB, AliasAnalysis *AA) argument
[all...]
H A DLocal.cpp109 bool llvm::ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions, argument
112 Instruction *T = BB->getTerminator();
129 OldDest->removePredecessor(BB);
135 DTU->applyUpdatesPermissive({{DominatorTree::Delete, BB, OldDest}});
202 MDBuilder(BB->getContext()).
237 BasicBlock *BB = SI->getParent(); local
248 Succ->removePredecessor(BB);
250 Updates.push_back({DominatorTree::Delete, BB, Succ});
284 MDBuilder(BB->getContext()).
302 // indirectbr blockaddress(@F, @BB)
602 SimplifyInstructionsInBlock(BasicBlock *BB, const TargetLibraryInfo *TLI) argument
642 RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred, DomTreeUpdater *DTU) argument
759 CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) argument
831 selectIncomingValueForBlock(Value *OldVal, BasicBlock *BB, IncomingValueMap &IncomingValues) argument
859 BasicBlock *BB = PN->getIncomingBlock(i); local
879 BasicBlock *BB = PN->getIncomingBlock(i); local
894 redirectValuesFromPredecessorsToPhi(BasicBlock *BB, const PredBlockVector &BBPreds, PHINode *PN) argument
949 TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB, DomTreeUpdater *DTU) argument
1076 EliminateDuplicatePHINodes(BasicBlock *BB) argument
1366 BasicBlock *BB = APN->getParent(); local
1458 insertDebugValuesForPHIs(BasicBlock *BB, SmallVectorImpl<PHINode *> &InsertedPHIs) argument
1894 removeAllNonTerminatorAndEHPadInstructions(BasicBlock *BB) argument
1918 BasicBlock *BB = I->getParent(); local
1983 BasicBlock *BB = II->getParent(); local
1993 BasicBlock *BB = CI->getParent(); local
2033 BasicBlock *BB = &F.front(); local
2192 removeUnwindEdge(BasicBlock *BB, DomTreeUpdater *DTU) argument
2498 auto *BB = From->getParent(); local
2522 replaceDominatedUsesWith(Value *From, Value *To, DominatorTree &DT, const BasicBlock *BB) argument
2608 hoistAllInstructionsInto(BasicBlock *DomBlock, Instruction *InsertPt, BasicBlock *BB) argument
[all...]
H A DSimplifyCFG.cpp215 bool run(BasicBlock *BB);
216 bool simplifyOnce(BasicBlock *BB);
328 /// If AggressiveInsts is non-null, and if V does not dominate BB, we check to
330 /// that do not dominate BB have a combined cost lower than CostRemaining and
340 static bool DominatesMergePoint(Value *V, BasicBlock *BB, argument
365 if (PBB == BB)
369 // branch to BB, then it must be in the 'conditional' part of the "if
372 if (!BI || BI->isConditional() || BI->getSuccessor(0) != BB)
400 if (!DominatesMergePoint(*i, BB, AggressiveInsts, BudgetRemaining, TTI,
748 EliminateBlockCases(BasicBlock *BB, argument
1005 BasicBlock *BB = TI->getParent(); local
1710 SinkCommonCodeFromPredecessors(BasicBlock *BB) argument
2155 BlockIsSimpleEnoughToThreadThrough(BasicBlock *BB) argument
2182 BasicBlock *BB = BI->getParent(); local
2307 BasicBlock *BB = PN->getParent(); local
2586 BasicBlock *BB = BI->getParent(); local
2716 LLVM_DEBUG(dbgs() << "FOLDING BRANCH TO COMMON DEST:\\n" << *PBI << *BB); local
2907 ensureValueAvailableInSuccessor(Value *V, BasicBlock *BB, Value *AlternativeV = nullptr) argument
3275 BasicBlock *BB = BI->getParent(); local
3650 BasicBlock *BB = ICI->getParent(); local
3797 BasicBlock *BB = BI->getParent(); local
3830 << "\\nEXTRABB = " << *BB); local
3878 BasicBlock *BB = RI->getParent(); local
3957 BasicBlock *BB = RI->getParent(); local
3990 BasicBlock *BB = RI->getParent(); local
4167 BasicBlock *BB = RI->getParent(); local
4221 BasicBlock *BB = UI->getParent(); local
4575 FindPHIForConditionForwarding(ConstantInt *CaseValue, BasicBlock *BB, int *PhiIndex) argument
5692 BasicBlock *BB = SI->getParent(); local
5743 BasicBlock *BB = IBI->getParent(); local
5801 TryToMergeLandingPad(LandingPadInst *LPad, BranchInst *BI, BasicBlock *BB) argument
5859 BasicBlock *BB = BI->getParent(); local
5907 allPredecessorsComeFromSameSource(BasicBlock *BB) argument
5919 BasicBlock *BB = BI->getParent(); local
6075 removeUndefIntroducingPredecessor(BasicBlock *BB) argument
6099 simplifyOnce(BasicBlock *BB) argument
6173 run(BasicBlock *BB) argument
6188 simplifyCFG(BasicBlock *BB, const TargetTransformInfo &TTI, const SimplifyCFGOptions &Options, SmallPtrSetImpl<BasicBlock *> *LoopHeaders) argument
[all...]
H A DCloneFunction.cpp40 BasicBlock *llvm::CloneBasicBlock(const BasicBlock *BB, ValueToValueMapTy &VMap, argument
45 BasicBlock *NewBB = BasicBlock::Create(BB->getContext(), "", F);
46 if (BB->hasName())
47 NewBB->setName(BB->getName() + NameSuffix);
53 for (const Instruction &I : *BB) {
76 BB != &BB->getParent()->getEntryBlock();
166 const BasicBlock &BB = *BI; local
169 BasicBlock *CBB = CloneBasicBlock(&BB, VMap, NameSuffix, NewFunc, CodeInfo,
173 VMap[&BB]
301 CloneBlock(const BasicBlock *BB, BasicBlock::const_iterator StartingInst, std::vector<const BasicBlock*> &ToClone) argument
482 const BasicBlock *BB = CloneWorklist.back(); local
835 DuplicateInstructionsInSplitBetween( BasicBlock *BB, BasicBlock *PredBB, Instruction *StopAt, ValueToValueMapTy &ValueMapping, DomTreeUpdater &DTU) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DTailRecursionElimination.cpp201 for (auto &BB : F) {
202 for (auto &I : BB)
233 BasicBlock *BB = &F.getEntryBlock();
236 for (auto &I : *BB) {
283 for (auto *SuccBB : make_range(succ_begin(BB), succ_end(BB))) {
295 BB = WorklistEscaped.pop_back_val();
298 BB = nullptr;
302 BB = NextBB;
308 } while (BB);
[all...]
H A DStructurizeCFG.cpp93 /// For every BB you add to the set, you can specify whether we "remember" the
101 /// Add BB to the resulting dominator.
102 void addBlock(BasicBlock *BB, bool Remember) { argument
104 Result = BB;
109 BasicBlock *NewResult = DT->findNearestCommonDominator(Result, BB);
112 if (NewResult == BB)
120 void addBlock(BasicBlock *BB) { argument
121 addBlock(BB, /* Remember = */ false);
124 void addAndRememberBlock(BasicBlock *BB) { argument
125 addBlock(BB, /* Remembe
395 BasicBlock *BB = N->getNodeAs<BasicBlock>(); local
453 BasicBlock *BB = N->getEntry(); local
561 BasicBlock *BB = BBAndPred.first; local
663 killTerminator(BasicBlock *BB) argument
688 BasicBlock *BB = *BBI++; local
714 BasicBlock *BB = Node->getNodeAs<BasicBlock>(); local
767 setPrevNode(BasicBlock *BB) argument
773 dominatesPredicates(BasicBlock *BB, RegionNode *Node) argument
[all...]
H A DSimplifyCFGPass.cpp80 BasicBlock &BB = *BBI++; local
83 ReturnInst *Ret = dyn_cast<ReturnInst>(BB.getTerminator());
88 if (Ret != &BB.front()) {
93 while (isa<DbgInfoIntrinsic>(I) && I != BB.begin())
96 (!isa<PHINode>(I) || I != BB.begin() || Ret->getNumOperands() == 0 ||
103 RetBlock = &BB;
110 for (pred_iterator PI = pred_begin(&BB), E = pred_end(&BB);
131 BB.replaceAllUsesWith(RetBlock);
132 BB
[all...]
H A DGVNHoist.cpp108 cl::desc("Hoist instructions from the beginning of the BB up to the "
271 for (const BasicBlock *BB : depth_first(&F.getEntryBlock())) {
272 DFSNumber[BB] = ++BBI;
274 for (auto &Inst : *BB)
346 // Return true when there are exception handling in BB.
347 bool hasEH(const BasicBlock *BB) { argument
348 auto It = BBSideEffects.find(BB);
352 if (BB->isEHPad() || BB->hasAddressTaken()) {
353 BBSideEffects[BB]
367 successorDominate(const BasicBlock *BB, const BasicBlock *A) argument
385 hasMemoryUse(const Instruction *NewPt, MemoryDef *Def, const BasicBlock *BB) argument
419 hasEHhelper(const BasicBlock *BB, const BasicBlock *SrcBB, int &NBBsOnAllPaths) argument
458 const BasicBlock *BB = *I; local
496 const BasicBlock *BB = *I; local
561 safeToHoistScalar(const BasicBlock *HoistBB, const BasicBlock *BB, int &NBBsOnAllPaths) argument
597 checkSafety(CHIArgs C, BasicBlock *BB, InsKind K, SmallVectorImpl<CHIArg> &Safe) argument
618 fillRenameStack(BasicBlock *BB, InValuesType &ValueBBs, RenameStackType &RenameStack) argument
631 fillChiArgs(BasicBlock *BB, OutValuesType &CHIBBs, RenameStackType &RenameStack) argument
678 BasicBlock *BB = Node->getBlock(); local
701 BasicBlock *BB = A.first; local
720 checkSafety(make_range(PrevIt, PHIIt), BB, K, Safe); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DGVN.h121 uint32_t phiTranslateImpl(const BasicBlock *BB, const BasicBlock *PhiBlock,
126 bool areAllValsInBB(uint32_t num, const BasicBlock *BB, GVN &Gvn);
139 uint32_t phiTranslate(const BasicBlock *BB, const BasicBlock *PhiBlock,
173 const BasicBlock *BB; member in struct:llvm::GVN::LeaderTableEntry
204 void addToLeaderTable(uint32_t N, Value *V, const BasicBlock *BB) { argument
208 Curr.BB = BB;
214 Node->BB = BB;
221 void removeFromLeaderTable(uint32_t N, Instruction *I, BasicBlock *BB) { argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DIndirectBrExpandPass.cpp94 for (BasicBlock &BB : F)
95 if (auto *IBr = dyn_cast<IndirectBrInst>(BB.getTerminator())) {
118 for (BasicBlock &BB : F) {
121 if (!IndirectBrSuccs.count(&BB))
127 auto BlockAddressUseIt = llvm::find_if(BB.uses(), IsBlockAddressUse);
128 if (BlockAddressUseIt == BB.use_end())
131 assert(std::find_if(std::next(BlockAddressUseIt), BB.use_end(),
132 IsBlockAddressUse) == BB.use_end() &&
146 BBs.push_back(&BB);
H A DMachineModuleInfo.cpp53 void setPtr(BasicBlock *BB) { argument
54 ValueHandleBase::operator=(BB);
93 ArrayRef<MCSymbol *> getAddrLabelSymbolToEmit(BasicBlock *BB);
98 void UpdateForDeletedBlock(BasicBlock *BB);
104 ArrayRef<MCSymbol *> MMIAddrLabelMap::getAddrLabelSymbolToEmit(BasicBlock *BB) { argument
105 assert(BB->hasAddressTaken() &&
107 AddrLabelSymEntry &Entry = AddrLabelSymbols[BB];
111 assert(BB->getParent() == Entry.Fn && "Parent changed");
116 // entry to BBCallbacks so we can be notified if the BB is deleted or RAUWd.
117 BBCallbacks.emplace_back(BB);
149 UpdateForDeletedBlock(BasicBlock *BB) argument
248 getAddrLabelSymbolToEmit(const BasicBlock *BB) argument
[all...]
H A DMachineBlockPlacement.cpp239 BlockChain(BlockToChainMapType &BlockToChain, MachineBasicBlock *BB) argument
240 : Blocks(1, BB), BlockToChain(BlockToChain) {
241 assert(BB && "Cannot create a chain with a null basic block");
242 BlockToChain[BB] = this;
257 bool remove(MachineBasicBlock* BB) { argument
259 if (*i == BB) {
273 void merge(MachineBasicBlock *BB, BlockChain *Chain) { argument
274 assert(BB && "Can't merge a null block.");
279 assert(!BlockToChain[BB] &&
280 "Passed chain is null, but BB ha
324 MachineBasicBlock *BB; member in struct:__anon1747::MachineBlockPlacement::BlockAndTailDupResult
571 getBlockName(const MachineBasicBlock *BB) argument
636 collectViableSuccessors( const MachineBasicBlock *BB, const BlockChain &Chain, const BlockFilterSet *BlockFilter, SmallVector<MachineBasicBlock *, 4> &Successors) argument
698 hasSameSuccessors(MachineBasicBlock &BB, SmallPtrSetImpl<const MachineBasicBlock *> &Successors) argument
714 shouldTailDuplicate(MachineBasicBlock *BB) argument
743 isProfitableToTailDup( const MachineBasicBlock *BB, const MachineBasicBlock *Succ, BranchProbability QProb, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument
897 isTrellis( const MachineBasicBlock *BB, const SmallVectorImpl<MachineBasicBlock *> &ViableSuccs, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument
948 getBestNonConflictingEdges( const MachineBasicBlock *BB, MutableArrayRef<SmallVector<MachineBlockPlacement::WeightedEdge, 8>> Edges) argument
992 getBestTrellisSuccessor( const MachineBasicBlock *BB, const SmallVectorImpl<MachineBasicBlock *> &ViableSuccs, BranchProbability AdjustedSumProb, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument
1077 canTailDuplicateUnplacedPreds( const MachineBasicBlock *BB, MachineBasicBlock *Succ, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument
1310 getLayoutSuccessorProbThreshold( const MachineBasicBlock *BB) argument
1342 hasBetterLayoutPredecessor( const MachineBasicBlock *BB, const MachineBasicBlock *Succ, const BlockChain &SuccChain, BranchProbability SuccProb, BranchProbability RealSuccProb, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument
1523 selectBestSuccessor( const MachineBasicBlock *BB, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument
1765 MachineBasicBlock *BB = *std::prev(Chain.end()); local
2622 MachineBasicBlock *BB = &*FI; local
2887 repeatedlyTailDuplicateBlock( MachineBasicBlock *BB, MachineBasicBlock *&LPred, const MachineBasicBlock *LoopHeaderBB, BlockChain &Chain, BlockFilterSet *BlockFilter, MachineFunction::iterator &PrevUnplacedBlockIt) argument
2949 maybeTailDuplicateBlock( MachineBasicBlock *BB, MachineBasicBlock *LPred, BlockChain &Chain, BlockFilterSet *BlockFilter, MachineFunction::iterator &PrevUnplacedBlockIt, bool &DuplicatedToLPred) argument
[all...]
H A DSafeStackColoring.cpp102 // * the sets of allocas whose lifetime starts or ends in this BB
105 for (BasicBlock *BB : depth_first(&F)) {
106 LLVM_DEBUG(dbgs() << " " << InstNo << ": BB " << BB->getName() << "\n");
109 BlockLifetimeInfo &BlockInfo = BlockLiveness[BB];
115 auto &BlockMarkerSet = BBMarkerSet[BB];
118 BlockInstRange[BB] = std::make_pair(BBStart, BBEnd);
127 BBMarkers[BB].push_back({InstNo, M});
146 // Scan the BB to determine the marker order.
147 for (Instruction &I : *BB) {
207 BasicBlock *BB = IT.getFirst(); local
264 BasicBlock *BB = IT.getFirst(); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DProfileSummaryInfo.cpp155 for (const auto &BB : *F)
156 for (const auto &I : BB)
163 for (const auto &BB : *F)
164 if (isHotBlock(&BB, &BFI))
184 for (const auto &BB : *F)
185 for (const auto &I : BB)
192 for (const auto &BB : *F)
193 if (!isColdBlock(&BB, &BFI))
209 for (const auto &BB : *F)
210 for (const auto &I : BB)
319 isHotBlock(const BasicBlock *BB, BlockFrequencyInfo *BFI) argument
324 isColdBlock(const BasicBlock *BB, BlockFrequencyInfo *BFI) argument
330 isHotBlockNthPercentile(int PercentileCutoff, const BasicBlock *BB, BlockFrequencyInfo *BFI) argument
[all...]
H A DLazyValueInfo.cpp184 void insertResult(Value *Val, BasicBlock *BB, argument
186 SeenBlocks.insert(BB);
191 OverDefinedCache[BB].insert(Val);
199 It->second->BlockVals[BB] = Result;
203 bool isOverdefined(Value *V, BasicBlock *BB) const {
204 auto ODI = OverDefinedCache.find(BB);
212 bool hasCachedValueInfo(Value *V, BasicBlock *BB) const {
213 if (isOverdefined(V, BB))
220 return I->second->BlockVals.count(BB);
223 ValueLatticeElement getCachedValueInfo(Value *V, BasicBlock *BB) cons
279 eraseBlock(BasicBlock *BB) argument
481 eraseBlock(BasicBlock *BB) argument
564 hasBlockValue(Value *Val, BasicBlock *BB) argument
572 getBlockValue(Value *Val, BasicBlock *BB) argument
598 solveBlockValue(Value *Val, BasicBlock *BB) argument
624 solveBlockValueImpl(ValueLatticeElement &Res, Value *Val, BasicBlock *BB) argument
706 isObjectDereferencedInBlock(Value *Val, BasicBlock *BB) argument
720 solveBlockValueNonLocal(ValueLatticeElement &BBLV, Value *Val, BasicBlock *BB) argument
784 solveBlockValuePHINode(ValueLatticeElement &BBLV, PHINode *PN, BasicBlock *BB) argument
858 solveBlockValueSelect(ValueLatticeElement &BBLV, SelectInst *SI, BasicBlock *BB) argument
1000 getRangeForOperand(unsigned Op, Instruction *I, BasicBlock *BB) argument
1019 solveBlockValueCast(ValueLatticeElement &BBLV, CastInst *CI, BasicBlock *BB) argument
1065 solveBlockValueBinaryOpImpl( ValueLatticeElement &BBLV, Instruction *I, BasicBlock *BB, std::function<ConstantRange(const ConstantRange &, const ConstantRange &)> OpFn) argument
1085 solveBlockValueBinaryOp(ValueLatticeElement &BBLV, BinaryOperator *BO, BasicBlock *BB) argument
[all...]
H A DMustExecute.cpp42 bool SimpleLoopSafetyInfo::blockMayThrow(const BasicBlock *BB) const {
43 (void)BB;
62 for (Loop::block_iterator BB = std::next(CurLoop->block_begin()),
64 (BB != BBE) && !MayThrow; ++BB)
65 MayThrow |= !isGuaranteedToTransferExecutionToSuccessor(*BB);
70 bool ICFLoopSafetyInfo::blockMayThrow(const BasicBlock *BB) const {
71 return ICF.hasICF(BB);
84 for (auto &BB : CurLoop->blocks())
85 if (ICF.hasICF(&*BB)) {
92 insertInstructionTo(const Instruction *Inst, const BasicBlock *BB) argument
159 collectTransitivePredecessors( const Loop *CurLoop, const BasicBlock *BB, SmallPtrSetImpl<const BasicBlock *> &Predecessors) argument
189 allLoopPathsLeadToBlock(const Loop *CurLoop, const BasicBlock *BB, const DominatorTree *DT) const argument
274 doesNotWriteMemoryBefore(const BasicBlock *BB, const Loop *CurLoop) const argument
296 auto *BB = I.getParent(); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineInstrBuilder.h332 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, argument
336 MachineFunction &MF = *BB.getParent();
338 BB.insert(I, MI);
348 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, argument
352 MachineFunction &MF = *BB.getParent();
354 BB.insert(I, MI);
358 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, MachineInstr &I, argument
364 return BuildMI(BB, MachineBasicBlock::instr_iterator(I), DL, MCID, DestReg);
365 return BuildMI(BB, MachineBasicBlock::iterator(I), DL, MCID, DestReg);
368 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, MachineInst argument
377 BuildMI(MachineBasicBlock &BB, MachineBasicBlock::iterator I, const DebugLoc &DL, const MCInstrDesc &MCID) argument
387 BuildMI(MachineBasicBlock &BB, MachineBasicBlock::instr_iterator I, const DebugLoc &DL, const MCInstrDesc &MCID) argument
397 BuildMI(MachineBasicBlock &BB, MachineInstr &I, const DebugLoc &DL, const MCInstrDesc &MCID) argument
407 BuildMI(MachineBasicBlock &BB, MachineInstr *I, const DebugLoc &DL, const MCInstrDesc &MCID) argument
415 BuildMI(MachineBasicBlock *BB, const DebugLoc &DL, const MCInstrDesc &MCID) argument
423 BuildMI(MachineBasicBlock *BB, const DebugLoc &DL, const MCInstrDesc &MCID, Register DestReg) argument
520 MIBundleBuilder(MachineBasicBlock &BB, MachineBasicBlock::iterator Pos) argument
524 MIBundleBuilder(MachineBasicBlock &BB, MachineBasicBlock::iterator B, MachineBasicBlock::iterator E) argument
[all...]
H A DMachineDominanceFrontier.h77 iterator addBasicBlock(MachineBasicBlock *BB, const DomSetType &frontier) { argument
78 return Base.addBasicBlock(BB, frontier);
81 void removeBlock(MachineBasicBlock *BB) { argument
82 return Base.removeBlock(BB);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DObjCARCAPElim.cpp45 static bool OptimizeBB(BasicBlock *BB);
75 for (const BasicBlock &BB : *Callee) {
76 for (const Instruction &I : BB)
91 bool ObjCARCAPElim::OptimizeBB(BasicBlock *BB) { argument
95 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DPostOrderIterator.h67 // Called after all children of BB have been visited.
68 template <typename NodeRef> void finishPostorder(NodeRef BB) {} argument
87 // Called after all children of BB have been visited.
88 template <class NodeRef> void finishPostorder(NodeRef BB) {} argument
106 po_iterator(NodeRef BB) { argument
107 this->insertEdge(Optional<NodeRef>(), BB); local
108 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
114 po_iterator(NodeRef BB, SetType &S) argument
116 if (this->insertEdge(Optional<NodeRef>(), BB)) {
128 NodeRef BB = *VisitStack.back().second++; local
292 Initialize(NodeRef BB) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/FuzzMutate/
H A DIRMutator.cpp31 BasicBlock *BB = BasicBlock::Create(Context, "BB", F); local
32 ReturnInst::Create(Context, BB);
50 void IRMutationStrategy::mutate(BasicBlock &BB, RandomIRBuilder &IB) { argument
51 mutate(*makeSampler(IB.Rand, make_pointer_range(BB)).getSelection(), IB);
106 void InjectorIRStrategy::mutate(BasicBlock &BB, RandomIRBuilder &IB) { argument
108 for (auto I = BB.getFirstInsertionPt(), E = BB.end(); I != E; ++I)
121 Srcs.push_back(IB.findOrCreateSource(BB, InstsBefore));
131 Srcs.push_back(IB.findOrCreateSource(BB, InstsBefor
187 BasicBlock *BB = Inst.getParent(); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DSLPVectorizer.h93 void collectSeedInstructions(BasicBlock *BB);
113 bool vectorizeGEPIndices(BasicBlock *BB, slpvectorizer::BoUpSLP &R);
117 bool vectorizeRootInstruction(PHINode *P, Value *V, BasicBlock *BB,
122 bool vectorizeInsertValueInst(InsertValueInst *IVI, BasicBlock *BB,
126 bool vectorizeInsertElementInst(InsertElementInst *IEI, BasicBlock *BB,
130 bool vectorizeCmpInst(CmpInst *CI, BasicBlock *BB, slpvectorizer::BoUpSLP &R);
135 BasicBlock *BB, slpvectorizer::BoUpSLP &R);
139 bool vectorizeChainsInBlock(BasicBlock *BB, slpvectorizer::BoUpSLP &R);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXProxyRegErasure.cpp69 for (auto &BB : MF) {
70 for (auto &MI : BB) {
102 for (auto &BB : MF) {
103 for (auto &I : BB) {

Completed in 204 milliseconds

1234567891011>>