Searched refs:BBI (Results 1 - 25 of 57) sorted by relevance

123

/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DIfConversion.cpp163 /// BBI - Corresponding BBInfo.
174 BBInfo &BBI; member in struct:__anon1726::IfConverter::IfcvtToken
184 : BBI(b), Kind(k), NumDups(d), NumDups2(d2), NeedSubsumption(s),
229 bool reverseBranchCondition(BBInfo &BBI) const;
247 void AnalyzeBranches(BBInfo &BBI);
248 void ScanInstructions(BBInfo &BBI,
258 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Pred,
264 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind);
265 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind);
266 bool IfConvertDiamondCommon(BBInfo &BBI, BBInf
495 BBInfo &BBI = Token->BBI; local
1024 AnalyzeBranches(BBInfo &BBI) argument
1060 ScanInstructions(BBInfo &BBI, MachineBasicBlock::iterator &Begin, MachineBasicBlock::iterator &End, bool BranchUnpredicable) const argument
1168 FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Pred, bool isTriangle, bool RevBranch, bool hasCommonTail) argument
1227 BBInfo &BBI = BBAnalysis[BB->getNumber()]; local
1534 IfConvertSimple(BBInfo &BBI, IfcvtKind Kind) argument
1619 IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind) argument
1773 IfConvertDiamondCommon( BBInfo &BBI, BBInfo &TrueBBI, BBInfo &FalseBBI, unsigned NumDups1, unsigned NumDups2, bool TClobbersPred, bool FClobbersPred, bool RemoveBranch, bool MergeAddEdges) argument
2009 IfConvertForkedDiamond( BBInfo &BBI, IfcvtKind Kind, unsigned NumDups1, unsigned NumDups2, bool TClobbersPred, bool FClobbersPred) argument
2045 IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind, unsigned NumDups1, unsigned NumDups2, bool TClobbersPred, bool FClobbersPred) argument
2135 PredicateBlock(BBInfo &BBI, MachineBasicBlock::iterator E, SmallVectorImpl<MachineOperand> &Cond, SmallSet<MCPhysReg, 4> *LaterRedefs) argument
[all...]
H A DMIRCanonicalizerPass.cpp245 for (auto BBI = MBB->instr_begin(); BBI != BBE; ++BBI) {
250 if (&*BBI == Def) {
251 DefI = BBI;
255 if (&*BBI == UseToBringDefCloserTo) {
256 UseI = BBI;
H A DPHIElimination.cpp553 for (const auto &BBI : MBB) {
554 if (!BBI.isPHI())
556 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2)
557 ++VRegPHIUseCount[BBVRegPair(BBI.getOperand(i+1).getMBB()->getNumber(),
558 BBI.getOperand(i).getReg())];
572 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end();
573 BBI != BBE && BBI->isPHI(); ++BBI) {
574 for (unsigned i = 1, e = BBI
[all...]
H A DLiveVariables.cpp710 for (const auto &BBI : MBB) {
711 if (!BBI.isPHI())
713 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2)
714 if (BBI.getOperand(i).readsReg())
715 PHIVarInfo[BBI.getOperand(i + 1).getMBB()->getNumber()]
716 .push_back(BBI.getOperand(i).getReg());
770 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); local
771 for (; BBI != BBE && BBI->isPHI(); ++BBI) {
[all...]
H A DModuloSchedule.cpp214 for (MachineBasicBlock::iterator BBI = BB->instr_begin(),
216 BBI != BBE; ++BBI) {
217 if (Schedule.getStage(&*BBI) == StageNum) {
218 if (BBI->isPHI())
221 cloneAndChangeInstr(&*BBI, i, (unsigned)StageNum);
224 InstrMap[NewMI] = &*BBI;
291 for (auto &BBI : *BB) {
292 if (BBI.isPHI())
294 MachineInstr *In = &BBI;
[all...]
H A DAnalysis.cpp535 for (BasicBlock::const_iterator BBI = std::prev(ExitBB->end(), 2);; --BBI) {
536 if (&*BBI == I)
539 if (isa<DbgInfoIntrinsic>(BBI))
543 if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(BBI))
547 if (BBI->mayHaveSideEffects() || BBI->mayReadFromMemory() ||
548 !isSafeToSpeculativelyExecute(&*BBI))
H A DBranchRelaxation.cpp144 const BasicBlockInfo &BBI = BlockInfo[MBB.getNumber()]; local
145 dbgs() << format("%%bb.%u\toffset=%08x\t", MBB.getNumber(), BBI.Offset)
146 << format("size=%#x\n", BBI.Size);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMBasicBlockInfo.cpp49 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; local
50 BBI.Size = 0;
51 BBI.Unalign = 0;
52 BBI.PostAlign = Align::None();
55 BBI.Size += TII->getInstSizeInBytes(I);
59 BBI.Unalign = isThumb ? 1 : 2;
62 BBI.Unalign = 1;
67 BBI.PostAlign = Align(4);
H A DARMBasicBlockInfo.h147 void insert(unsigned BBNum, BasicBlockInfo BBI) { argument
148 BBInfo.insert(BBInfo.begin() + BBNum, BBI);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCPreEmitPeephole.cpp63 // loops - The outer loop finds the load immediates BBI that could be used
65 // after BBI to find redundancy and update kill/dead flags accordingly. If
66 // AfterBBI is the same as BBI, it is redundant, otherwise any instructions
67 // that modify the def register of BBI would break the scanning.
69 // kill/dead flag set. It keeps track of the def register of BBI, the use
77 for (auto BBI = MBB.instr_begin(); BBI != MBB.instr_end(); ++BBI) {
80 if (InstrsToErase.find(&*BBI) != InstrsToErase.end())
83 unsigned Opc = BBI
102 << " from load immediate " << *BBI local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DDeadStoreElimination.cpp101 deleteDeadInstruction(Instruction *I, BasicBlock::iterator *BBI, argument
113 BasicBlock::iterator NewIter = *BBI;
153 *BBI = NewIter;
706 BasicBlock::iterator BBI(Dependency);
707 deleteDeadInstruction(Dependency, &BBI, *MD, *TLI, IOL, OBB,
717 Dep = MD->getPointerDependencyFrom(Loc, false, BBI, BB);
794 for (BasicBlock::iterator BBI = BB.end(); BBI != BB.begin(); ){
795 --BBI;
798 if (hasAnalyzableMemoryWrite(&*BBI, *TL
1041 eliminateNoopStore(Instruction *Inst, BasicBlock::iterator &BBI, AliasAnalysis *AA, MemoryDependenceResults *MD, const DataLayout &DL, const TargetLibraryInfo *TLI, InstOverlapIntervalsTy &IOL, OrderedBasicBlock &OBB, MapVector<Instruction *, bool> &ThrowableInst) argument
[all...]
H A DTailRecursionElimination.cpp401 for (BasicBlock &BBI : *F) {
402 ReturnInst *RI = dyn_cast<ReturnInst>(BBI.getTerminator());
461 BasicBlock::iterator BBI(TI);
463 CI = dyn_cast<CallInst>(BBI);
467 if (BBI == BB->begin())
469 --BBI;
521 BasicBlock::iterator BBI(CI);
522 for (++BBI; &*BBI != Ret; ++BBI) {
[all...]
H A DPlaceSafepoints.cpp270 for (BasicBlock::iterator BBI(Start), BBE0 = Start->getParent()->end(),
272 BBI != BBE0 && BBI != BBE1; BBI++) {
273 if (CallInst *CI = dyn_cast<CallInst>(&*BBI))
277 assert(!isa<InvokeInst>(&*BBI) &&
282 if (BBI->isTerminator()) {
283 BasicBlock *BB = BBI->getParent();
H A DSimplifyCFGPass.cpp79 for (Function::iterator BBI = F.begin(), E = F.end(); BBI != E; ) {
80 BasicBlock &BB = *BBI++;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DMemCpyOptimizer.h60 bool processStore(StoreInst *SI, BasicBlock::iterator &BBI);
61 bool processMemSet(MemSetInst *SI, BasicBlock::iterator &BBI);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineLoadStoreAlloca.cpp990 BasicBlock::iterator BBI(LI);
993 &LI, LI.getParent(), BBI, DefMaxInstsToScan, AA, &IsLoadCSE)) {
1430 BasicBlock::iterator BBI(SI);
1431 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts;
1433 --BBI;
1436 if (isa<DbgInfoIntrinsic>(BBI) ||
1437 (isa<BitCastInst>(BBI) && BBI->getType()->isPointerTy())) {
1442 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) {
1460 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
[all...]
H A DInstCombineMulDivRem.cpp610 BasicBlock::iterator BBI = I.getIterator(), BBFront = I.getParent()->begin();
612 while (BBI != BBFront) {
613 --BBI;
616 if (!isGuaranteedToTransferExecutionToSuccessor(&*BBI))
620 for (Instruction::op_iterator I = BBI->op_begin(), E = BBI->op_end();
624 Worklist.Add(&*BBI);
628 Worklist.Add(&*BBI);
633 if (&*BBI == SI)
635 if (&*BBI
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLoads.cpp287 BasicBlock::iterator BBI = ScanFrom->getIterator(), local
294 while (BBI != E) {
295 --BBI;
299 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() &&
300 !isa<DbgInfoIntrinsic>(BBI))
305 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
313 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
H A DLazyValueInfo.cpp230 auto BBI = I->second->BlockVals.find(BB);
231 if (BBI == I->second->BlockVals.end())
233 return BBI->second;
433 bool solveBlockValueBinaryOp(ValueLatticeElement &BBLV, BinaryOperator *BBI,
447 Instruction *BBI);
581 static ValueLatticeElement getFromRangeMetadata(Instruction *BBI) { argument
582 switch (BBI->getOpcode()) {
587 if (MDNode *Ranges = BBI->getMetadata(LLVMContext::MD_range))
588 if (isa<IntegerType>(BBI->getType())) {
627 Instruction *BBI local
826 intersectAssumeOrGuardBlockValueConstantRange( Value *Val, ValueLatticeElement &BBLV, Instruction *BBI) argument
[all...]
H A DLoopPass.cpp51 auto BBI = llvm::find_if(L->blocks(), [](BasicBlock *BB) { return BB; }); variable
52 if (BBI != L->blocks().end() &&
53 isFunctionInPrintList((*BBI)->getParent()->getName())) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXGenericToNVVM.cpp107 for (Function::iterator BBI = I->begin(), BBE = I->end(); BBI != BBE;
108 ++BBI) {
109 for (BasicBlock::iterator II = BBI->begin(), IE = BBI->end(); II != IE;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/
H A DSafepointIRVerifier.cpp551 for (auto &BBI : BlockMap) {
552 gatherDominatingDefs(BBI.first, BBI.second->AvailableIn, DT);
553 transferBlock(BBI.first, *BBI.second, true);
610 for (auto &BBI : BlockMap)
611 Worklist.insert(BBI.first);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp245 for (BasicBlock::iterator BBI = Succ->begin(); isa<PHINode>(BBI); ++BBI) {
246 PHINode *PN = cast<PHINode>(BBI);
288 for (BasicBlock::iterator BBI = Succ->begin(); isa<PHINode>(BBI); ++BBI) {
289 PHINode *PN = cast<PHINode>(BBI);
1993 for (BasicBlock::iterator BBI = ThenBB->begin(),
1995 BBI !
4228 BasicBlock::iterator BBI = UI->getIterator(); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DObjCARCContract.cpp475 BasicBlock::iterator BBI = Inst->getIterator();
482 if (BBI == InstParent->begin()) {
486 BBI = Pred->getTerminator()->getIterator();
489 --BBI;
490 } while (IsNoopInstruction(&*BBI));
492 if (&*BBI == GetArgRCIdentityRoot(Inst)) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsConstantIslandPass.cpp427 const BasicBlockInfo &BBI = BBInfo[J]; local
428 dbgs() << format("%08x %bb.%u\t", BBI.Offset, J)
791 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; local
792 BBI.Size = 0;
795 BBI.Size += TII->getInstSizeInBytes(MI);
983 const BasicBlockInfo &BBI = BBInfo[Block];
988 << format("%#x-%x\t", BBI.Offset, BBI.postOffset()) << *MI

Completed in 156 milliseconds

123