Home
last modified time | relevance | path

Searched refs:BBI (Results 1 – 25 of 65) sorted by relevance

123

/openbsd/src/gnu/llvm/llvm/lib/CodeGen/
DIfConversion.cpp173 BBInfo &BBI; member
183 : BBI(b), Kind(k), NumDups(d), NumDups2(d2), NeedSubsumption(s), in IfcvtToken()
228 bool reverseBranchCondition(BBInfo &BBI) const;
246 void AnalyzeBranches(BBInfo &BBI);
247 void ScanInstructions(BBInfo &BBI,
257 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Pred,
263 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind);
264 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind);
265 bool IfConvertDiamondCommon(BBInfo &BBI, BBInfo &TrueBBI, BBInfo &FalseBBI,
269 bool IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind,
[all …]
DLiveVariables.cpp780 for (const auto &BBI : MBB) { in analyzePHINodes() local
781 if (!BBI.isPHI()) in analyzePHINodes()
783 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2) in analyzePHINodes()
784 if (BBI.getOperand(i).readsReg()) in analyzePHINodes()
785 PHIVarInfo[BBI.getOperand(i + 1).getMBB()->getNumber()] in analyzePHINodes()
786 .push_back(BBI.getOperand(i).getReg()); in analyzePHINodes()
839 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); in addNewBlock() local
840 for (; BBI != BBE && BBI->isPHI(); ++BBI) { in addNewBlock()
842 Defs.insert(BBI->getOperand(0).getReg()); in addNewBlock()
845 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) in addNewBlock()
[all …]
DPHIElimination.cpp637 for (const auto &BBI : MBB) { in analyzePHINodes() local
638 if (!BBI.isPHI()) in analyzePHINodes()
640 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2) { in analyzePHINodes()
641 if (!BBI.getOperand(i).isUndef()) { in analyzePHINodes()
643 BBI.getOperand(i + 1).getMBB()->getNumber(), in analyzePHINodes()
644 BBI.getOperand(i).getReg())]; in analyzePHINodes()
662 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end(); in SplitPHIEdges() local
663 BBI != BBE && BBI->isPHI(); ++BBI) { in SplitPHIEdges()
664 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) { in SplitPHIEdges()
665 Register Reg = BBI->getOperand(i).getReg(); in SplitPHIEdges()
[all …]
DMIRCanonicalizerPass.cpp232 for (auto BBI = MBB->instr_begin(); BBI != BBE; ++BBI) { in rescheduleCanonically() local
237 if (&*BBI == Def) { in rescheduleCanonically()
238 DefI = BBI; in rescheduleCanonically()
242 if (&*BBI == UseToBringDefCloserTo) { in rescheduleCanonically()
243 UseI = BBI; in rescheduleCanonically()
DModuloSchedule.cpp216 for (MachineBasicBlock::iterator BBI = BB->instr_begin(), in generateProlog() local
218 BBI != BBE; ++BBI) { in generateProlog()
219 if (Schedule.getStage(&*BBI) == StageNum) { in generateProlog()
220 if (BBI->isPHI()) in generateProlog()
223 cloneAndChangeInstr(&*BBI, i, (unsigned)StageNum); in generateProlog()
226 InstrMap[NewMI] = &*BBI; in generateProlog()
292 for (auto &BBI : *BB) { in generateEpilog()
293 if (BBI.isPHI()) in generateEpilog()
295 MachineInstr *In = &BBI; in generateEpilog()
383 for (MachineBasicBlock::iterator BBI = BB->instr_begin(), in generateExistingPhis() local
[all …]
DAnalysis.cpp545 for (BasicBlock::const_iterator BBI = std::prev(ExitBB->end(), 2);; --BBI) { in isInTailCallPosition() local
546 if (&*BBI == &Call) in isInTailCallPosition()
550 if (BBI->isDebugOrPseudoInst()) in isInTailCallPosition()
554 if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(BBI)) in isInTailCallPosition()
559 if (BBI->mayHaveSideEffects() || BBI->mayReadFromMemory() || in isInTailCallPosition()
560 !isSafeToSpeculativelyExecute(&*BBI)) in isInTailCallPosition()
DCodeGenCommonISel.cpp35 MachineFunction::iterator BBI(ParentMBB); in addSuccessorMBB() local
37 MF->insert(++BBI, SuccMBB); in addSuccessorMBB()
DBranchRelaxation.cpp142 const BasicBlockInfo &BBI = BlockInfo[MBB.getNumber()]; in dumpBBs() local
143 dbgs() << format("%%bb.%u\toffset=%08x\t", MBB.getNumber(), BBI.Offset) in dumpBBs()
144 << format("size=%#x\n", BBI.Size); in dumpBBs()
/openbsd/src/gnu/llvm/llvm/lib/Target/PowerPC/
DPPCPreEmitPeephole.cpp128 for (auto BBI = MBB.instr_begin(); BBI != MBB.instr_end(); ++BBI) { in removeRedundantLIs() local
131 if (InstrsToErase.contains(&*BBI)) in removeRedundantLIs()
134 unsigned Opc = BBI->getOpcode(); in removeRedundantLIs()
140 if (!BBI->getOperand(1).isImm()) in removeRedundantLIs()
142 assert(BBI->getOperand(0).isReg() && in removeRedundantLIs()
145 LLVM_DEBUG(dbgs() << "Scanning after load immediate: "; BBI->dump();); in removeRedundantLIs()
147 Register Reg = BBI->getOperand(0).getReg(); in removeRedundantLIs()
148 int64_t Imm = BBI->getOperand(1).getImm(); in removeRedundantLIs()
150 if (BBI->getOperand(0).isDead()) { in removeRedundantLIs()
151 DeadOrKillToUnset = &BBI->getOperand(0); in removeRedundantLIs()
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Target/ARM/
DARMBasicBlockInfo.cpp49 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; in computeBlockSize() local
50 BBI.Size = 0; in computeBlockSize()
51 BBI.Unalign = 0; in computeBlockSize()
52 BBI.PostAlign = Align(1); in computeBlockSize()
55 BBI.Size += TII->getInstSizeInBytes(I); in computeBlockSize()
59 BBI.Unalign = isThumb ? 1 : 2; in computeBlockSize()
62 BBI.Unalign = 1; in computeBlockSize()
67 BBI.PostAlign = Align(4); in computeBlockSize()
DARMBasicBlockInfo.h147 void insert(unsigned BBNum, BasicBlockInfo BBI) { in insert() argument
148 BBInfo.insert(BBInfo.begin() + BBNum, BBI); in insert()
/openbsd/src/gnu/llvm/llvm/include/llvm/Transforms/Scalar/
DMemCpyOptimizer.h59 bool processStore(StoreInst *SI, BasicBlock::iterator &BBI);
61 BasicBlock::iterator &BBI);
62 bool processMemSet(MemSetInst *SI, BasicBlock::iterator &BBI);
63 bool processMemCpy(MemCpyInst *M, BasicBlock::iterator &BBI);
/openbsd/src/gnu/llvm/llvm/lib/Transforms/InstCombine/
DInstCombineLoadStoreAlloca.cpp1477 BasicBlock::iterator BBI(SI); in visitStoreInst() local
1478 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts; in visitStoreInst()
1480 --BBI; in visitStoreInst()
1483 if (BBI->isDebugOrPseudoInst() || in visitStoreInst()
1484 (isa<BitCastInst>(BBI) && BBI->getType()->isPointerTy())) { in visitStoreInst()
1489 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) { in visitStoreInst()
1509 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) { in visitStoreInst()
1521 if (BBI->mayWriteToMemory() || BBI->mayReadFromMemory() || BBI->mayThrow()) in visitStoreInst()
1569 BasicBlock::iterator BBI(OtherBB->getTerminator()); in mergeStoreIntoSuccessor() local
1570 BranchInst *OtherBr = dyn_cast<BranchInst>(BBI); in mergeStoreIntoSuccessor()
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Transforms/Scalar/
DPlaceSafepoints.cpp272 for (BasicBlock::iterator BBI(Start), BBE0 = Start->getParent()->end(), in scanOneBB() local
274 BBI != BBE0 && BBI != BBE1; BBI++) { in scanOneBB()
275 if (CallInst *CI = dyn_cast<CallInst>(&*BBI)) in scanOneBB()
279 assert(!isa<InvokeInst>(&*BBI) && in scanOneBB()
284 if (BBI->isTerminator()) { in scanOneBB()
285 BasicBlock *BB = BBI->getParent(); in scanOneBB()
DTailRecursionElimination.cpp464 BasicBlock::iterator BBI(TI); in findTRECandidate() local
466 CI = dyn_cast<CallInst>(BBI); in findTRECandidate()
470 if (BBI == BB->begin()) in findTRECandidate()
472 --BBI; in findTRECandidate()
636 BasicBlock::iterator BBI(CI); in eliminateCall() local
637 for (++BBI; &*BBI != Ret; ++BBI) { in eliminateCall()
638 if (canMoveAboveCall(&*BBI, CI, AA)) in eliminateCall()
645 if (AccPN || !canTransformAccumulatorRecursion(&*BBI, CI)) in eliminateCall()
650 AccRecInstr = &*BBI; in eliminateCall()
DMemCpyOptimizer.cpp679 BasicBlock::iterator &BBI) { in processStoreOfLoad() argument
754 BBI = M->getIterator(); in processStoreOfLoad()
787 bool MemCpyOptPass::processStore(StoreInst *SI, BasicBlock::iterator &BBI) { in processStore() argument
810 return processStoreOfLoad(SI, LI, DL, BBI); in processStore()
829 BBI = I->getIterator(); // Don't invalidate iterator. in processStore()
857 BBI = M->getIterator(); in processStore()
865 bool MemCpyOptPass::processMemSet(MemSetInst *MSI, BasicBlock::iterator &BBI) { in processMemSet() argument
871 BBI = I->getIterator(); // Don't invalidate iterator. in processMemSet()
1448 bool MemCpyOptPass::processMemCpy(MemCpyInst *M, BasicBlock::iterator &BBI) { in processMemCpy() argument
1454 ++BBI; in processMemCpy()
/openbsd/src/gnu/llvm/llvm/lib/Analysis/
DLazyValueInfo.cpp422 solveBlockValueBinaryOp(BinaryOperator *BBI, BasicBlock *BB);
434 Instruction *BBI);
559 static ValueLatticeElement getFromRangeMetadata(Instruction *BBI) { in getFromRangeMetadata() argument
560 switch (BBI->getOpcode()) { in getFromRangeMetadata()
565 if (MDNode *Ranges = BBI->getMetadata(LLVMContext::MD_range)) in getFromRangeMetadata()
566 if (isa<IntegerType>(BBI->getType())) { in getFromRangeMetadata()
594 Instruction *BBI = dyn_cast<Instruction>(Val); in solveBlockValueImpl() local
595 if (!BBI || BBI->getParent() != BB) in solveBlockValueImpl()
598 if (PHINode *PN = dyn_cast<PHINode>(BBI)) in solveBlockValueImpl()
601 if (auto *SI = dyn_cast<SelectInst>(BBI)) in solveBlockValueImpl()
[all …]
DLoads.cpp349 BasicBlock::iterator BBI = ScanFrom->getIterator(), in isSafeToLoadUnconditionally() local
356 while (BBI != E) { in isSafeToLoadUnconditionally()
357 --BBI; in isSafeToLoadUnconditionally()
361 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() && in isSafeToLoadUnconditionally()
362 !isa<LifetimeIntrinsic>(BBI) && !isa<DbgInfoIntrinsic>(BBI)) in isSafeToLoadUnconditionally()
368 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) { in isSafeToLoadUnconditionally()
377 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) { in isSafeToLoadUnconditionally()
DLoopPass.cpp50 auto BBI = llvm::find_if(L->blocks(), [](BasicBlock *BB) { return BB; }); in runOnLoop() local
51 if (BBI != L->blocks().end() && in runOnLoop()
52 isFunctionInPrintList((*BBI)->getParent()->getName())) { in runOnLoop()
/openbsd/src/gnu/llvm/llvm/lib/IR/
DSafepointIRVerifier.cpp560 for (auto &BBI : BlockMap) { in GCPtrTracker() local
561 gatherDominatingDefs(BBI.first, BBI.second->AvailableIn, DT); in GCPtrTracker()
562 transferBlock(BBI.first, *BBI.second, true); in GCPtrTracker()
618 for (auto &BBI : BlockMap) in recalculateBBsStates() local
619 Worklist.insert(BBI.first); in recalculateBBsStates()
/openbsd/src/gnu/llvm/llvm/lib/Transforms/ObjCARC/
DObjCARCContract.cpp448 BasicBlock::iterator BBI = Inst->getIterator(); in tryToPeepholeInstruction() local
455 if (BBI == InstParent->begin()) { in tryToPeepholeInstruction()
459 BBI = Pred->getTerminator()->getIterator(); in tryToPeepholeInstruction()
462 --BBI; in tryToPeepholeInstruction()
463 } while (IsNoopInstruction(&*BBI)); in tryToPeepholeInstruction()
465 if (GetRCIdentityRoot(&*BBI) == GetArgRCIdentityRoot(Inst)) { in tryToPeepholeInstruction()
/openbsd/src/gnu/llvm/llvm/lib/Transforms/Utils/
DLoopSimplify.cpp85 Function::iterator BBI = --NewBB->getIterator(); in placeSplitBlockCarefully() local
87 if (&*BBI == SplitPreds[i]) in placeSplitBlockCarefully()
99 Function::iterator BBI = SplitPreds[i]->getIterator(); in placeSplitBlockCarefully() local
100 if (++BBI != NewBB->getParent()->end() && L->contains(&*BBI)) { in placeSplitBlockCarefully()
DPromoteMemoryToRegister.cpp278 for (const Instruction &BBI : *BB) in getInstructionIndex()
279 if (isInterestingInstruction(&BBI)) in getInstructionIndex()
280 InstNumbers[&BBI] = InstNo++; in getInstructionIndex()
862 BasicBlock::iterator BBI = BB->begin(); in run() local
863 while ((SomePHI = dyn_cast<PHINode>(BBI++)) && in run()
DSimplifyCFG.cpp3220 for (BasicBlock::iterator BBI = BB->begin(); &*BBI != BI; ++BBI) { in FoldCondBranchOnValueKnownInPredecessorImpl() local
3221 if (PHINode *PN = dyn_cast<PHINode>(BBI)) { in FoldCondBranchOnValueKnownInPredecessorImpl()
3226 Instruction *N = BBI->clone(); in FoldCondBranchOnValueKnownInPredecessorImpl()
3227 if (BBI->hasName()) in FoldCondBranchOnValueKnownInPredecessorImpl()
3228 N->setName(BBI->getName() + ".c"); in FoldCondBranchOnValueKnownInPredecessorImpl()
3239 if (!BBI->use_empty()) in FoldCondBranchOnValueKnownInPredecessorImpl()
3240 TranslateMap[&*BBI] = V; in FoldCondBranchOnValueKnownInPredecessorImpl()
3246 if (!BBI->use_empty()) in FoldCondBranchOnValueKnownInPredecessorImpl()
3247 TranslateMap[&*BBI] = N; in FoldCondBranchOnValueKnownInPredecessorImpl()
4797 for (BasicBlock::iterator BBI = EdgeBB->begin(); isa<PHINode>(BBI); ++BBI) { in SimplifyBranchOnICmpChain() local
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Target/Mips/
DMipsConstantIslandPass.cpp427 const BasicBlockInfo &BBI = BBInfo[J]; in dumpBBs() local
428 dbgs() << format("%08x %bb.%u\t", BBI.Offset, J) in dumpBBs()
785 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; in computeBlockSize() local
786 BBI.Size = 0; in computeBlockSize()
789 BBI.Size += TII->getInstSizeInBytes(MI); in computeBlockSize()
977 const BasicBlockInfo &BBI = BBInfo[Block]; in isCPEntryInRange()
982 << format("%#x-%x\t", BBI.Offset, BBI.postOffset()) << *MI in isCPEntryInRange()

123