Searched refs:BI (Results 76 - 100 of 200) sorted by relevance

12345678

/freebsd-12-stable/contrib/llvm-project/llvm/tools/bugpoint/
H A DCrashDebugger.cpp530 for (const auto &BI : BlockInfo) {
531 Function *F = cast<Function>(GST.lookup(BI.first));
532 Value *V = F->getValueSymbolTable()->lookup(BI.second);
637 for (auto &BI : BlockInfo) {
638 auto *F = cast<Function>(GST.lookup(BI.first));
639 Value *V = F->getValueSymbolTable()->lookup(BI.second);
729 for (auto &BI : BlockInfo) {
730 auto *F = cast<Function>(GST.lookup(BI.first));
731 Value *V = F->getValueSymbolTable()->lookup(BI.second);
1130 for (Function::const_iterator BI
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DHardwareLoops.cpp350 auto *BI = cast<BranchInst>(Pred->getTerminator());
351 if (BI->isUnconditional() || !isa<ICmpInst>(BI->getCondition()))
356 auto ICmp = cast<ICmpInst>(BI->getCondition());
371 if (BI->getSuccessor(SuccIdx) != Preheader)
H A DSafeStackColoring.cpp78 if (auto *BI = dyn_cast<BitCastInst>(U)) {
79 WorkList.push_back(BI);
H A DStackColoring.cpp541 LivenessMap::const_iterator BI = BlockLiveness.find(MBB); local
542 assert(BI != BlockLiveness.end() && "Block not found");
543 const BlockLifetimeInfo &BlockInfo = BI->second;
770 LivenessMap::iterator BI = BlockLiveness.find(BB); local
771 assert(BI != BlockLiveness.end() && "Block not found");
772 BlockLifetimeInfo &BlockInfo = BI->second;
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSILowerControlFlow.cpp528 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end();
529 BI != BE; BI = NextBB) {
530 NextBB = std::next(BI);
531 MachineBasicBlock &MBB = *BI;
H A DSIInsertWaitcnts.cpp1512 for (BlockInfo &BI : BlockInfos) {
1513 if (!BI.Dirty)
1516 unsigned Idx = std::distance(&*BlockInfos.begin(), &BI);
1518 if (BI.Incoming) {
1520 Brackets = std::make_unique<WaitcntBrackets>(*BI.Incoming);
1522 *Brackets = *BI.Incoming;
1530 Modified |= insertWaitcntInBlock(MF, *BI.MBB, *Brackets);
1531 BI.Dirty = false;
1535 for (MachineBasicBlock *Succ : BI.MBB->successors()) {
1563 for (MachineFunction::iterator BI
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DEvaluator.cpp610 if (BranchInst *BI = dyn_cast<BranchInst>(CurInst)) {
611 if (BI->isUnconditional()) {
612 NextBB = BI->getSuccessor(0);
615 dyn_cast<ConstantInt>(getVal(BI->getCondition()));
618 NextBB = BI->getSuccessor(!Cond->getZExtValue());
H A DInlineFunction.cpp1414 for (BasicBlock::iterator BI = FI->begin(), BE = FI->end();
1415 BI != BE; ++BI) {
1418 if (MDNode *LoopID = BI->getMetadata(LLVMContext::MD_loop)) {
1420 inlineLoopID(LoopID, InlinedAtNode, BI->getContext(), IANodes);
1421 BI->setMetadata(LLVMContext::MD_loop, NewLoopID);
1425 if (DebugLoc DL = BI->getDebugLoc()) {
1427 inlineDebugLoc(DL, InlinedAtNode, BI->getContext(), IANodes);
1428 BI->setDebugLoc(IDL);
1442 if (auto *AI = dyn_cast<AllocaInst>(BI))
1451 BasicBlock::iterator BI = FI->begin(); local
2361 BranchInst* BI = BranchInst::Create(AfterCallBB, RI); local
[all...]
H A DBypassSlowDivision.cpp132 auto BI = BypassWidths.find(SlowType->getBitWidth());
133 if (BI == BypassWidths.end())
137 IntegerType *BT = IntegerType::get(I->getContext(), BI->second);
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCTargetTransformInfo.cpp517 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
519 if (!BI->isConditional() ||
520 !BI->extractProfMetadata(TrueWeight, FalseWeight))
525 bool TrueIsExit = !L->contains(BI->getSuccessor(0));
968 bool PPCTTIImpl::canSaveCmp(Loop *L, BranchInst **BI, ScalarEvolution *SE, argument
973 if (canSaveCmp(*I, BI, SE, LI, DT, AC, LibInfo))
987 *BI = HWLoopInfo.ExitBranch;
H A DPPCTargetTransformInfo.h62 bool canSaveCmp(Loop *L, BranchInst **BI, ScalarEvolution *SE, LoopInfo *LI,
/freebsd-12-stable/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/
H A DPDBFile.cpp161 uint32_t BI = 0; local
166 ContainerLayout.FreePageMap[BI] = true;
168 ++BI;
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DMemorySSAUpdater.h254 /// Conditional branch BI is changed or replaced with an unconditional branch
255 /// to `To`. Update Phis in BI's successors to remove BI's BB.
256 void changeCondBranchToUnconditionalTo(const BranchInst *BI,
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/Basic/
H A DBuiltins.h48 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLICM.cpp593 void registerPossiblyHoistableBranch(BranchInst *BI) { argument
595 if (!ControlFlowHoisting || !BI->isConditional() ||
596 !CurLoop->hasLoopInvariantOperands(BI))
602 BasicBlock *TrueDest = BI->getSuccessor(0);
603 BasicBlock *FalseDest = BI->getSuccessor(1);
608 // We can hoist BI if one branch destination is the successor of the other,
645 if (CommonSucc && DT->dominates(BI, CommonSucc))
646 HoistableBranches[BI] = CommonSucc;
712 BranchInst *BI = It->first; local
718 BasicBlock *TrueDest = BI
[all...]
H A DLoopRerollPass.cpp1185 Instruction *BI = dyn_cast<BranchInst>(*UUser->user_begin()); local
1186 if (BI == cast<BranchInst>(Header->getTerminator()))
1187 Uses[BI].set(IL_All);
1454 BranchInst *BI = cast<BranchInst>(Header->getTerminator()); local
1472 new ICmpInst(BI, CmpInst::ICMP_EQ, NewIV, TakenCount, "exitcond");
1473 BI->setCondition(Cond);
1475 if (BI->getSuccessor(1) != Header)
1476 BI->swapSuccessors();
H A DGVNSink.cpp276 auto BI = Blocks.begin(); local
278 while (BI != Blocks.end()) {
280 if (std::find(NewBlocks.begin(), NewBlocks.end(), *BI) ==
282 BI = Blocks.erase(BI);
285 ++BI;
H A DReassociate.cpp809 /// Insert instructions before the instruction pointed to by BI,
811 /// version of the value is returned, and BI is left pointing at the instruction
816 static Value *NegateValue(Value *V, Instruction *BI, argument
834 I->setOperand(0, NegateValue(I->getOperand(0), BI, ToRedo));
835 I->setOperand(1, NegateValue(I->getOperand(1), BI, ToRedo));
846 I->moveBefore(BI);
868 if (TheNeg->getParent()->getParent() != BI->getParent()->getParent())
899 // create the neg before BI, as if we hadn't found an existing
909 TheNeg->andIRFlags(BI);
917 BinaryOperator *NewNeg = CreateNeg(V, V->getName() + ".neg", BI, B
[all...]
H A DLoopIdiomRecognize.cpp820 for (Loop::block_iterator BI = L->block_begin(), E = L->block_end(); BI != E;
821 ++BI)
822 for (Instruction &I : **BI)
1164 static Value *matchCondition(BranchInst *BI, BasicBlock *LoopEntry, argument
1166 if (!BI || !BI->isConditional())
1169 ICmpInst *Cond = dyn_cast<ICmpInst>(BI->getCondition());
1177 BasicBlock *TrueSucc = BI->getSuccessor(0);
1178 BasicBlock *FalseSucc = BI
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLint.cpp271 for (CallSite::arg_iterator BI = CS.arg_begin(); BI != AE;
272 ++BI, ++ArgNo) {
280 if (AI != BI && (*BI)->getType()->isPointerTy()) {
281 AliasResult Result = AA->alias(*AI, *BI);
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/BPF/
H A DBPFAbstractMemberAccess.cpp414 if (auto *BI = dyn_cast<BitCastInst>(Inst)) {
415 traceBitCast(BI, Call, ParentInfo);
446 if (auto *BI = dyn_cast<BitCastInst>(Inst)) {
447 traceBitCast(BI, Parent, ParentInfo);
476 if (auto *BI = dyn_cast<BitCastInst>(Inst)) {
477 traceBitCast(BI, Parent, ParentInfo);
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonCopyToCombine.cpp481 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end(); BI != BE;
482 ++BI) {
484 findPotentialNewifiableTFRs(*BI);
487 for(MachineBasicBlock::iterator MI = BI->begin(), End = BI->end();
/freebsd-12-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DSearchableTableEmitter.cpp112 else if (BitsInit *BI = dyn_cast<BitsInit>(I))
113 return "0x" + utohexstr(getAsInt(BI));
114 else if (BitInit *BI = dyn_cast<BitInit>(I))
115 return BI->getValue() ? "true" : "false";
154 } else if (BitsRecTy *BI = dyn_cast<BitsRecTy>(Field.RecType)) {
155 unsigned NumBits = BI->getNumBits();
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstructionCombining.cpp1013 BranchInst *BI = dyn_cast<BranchInst>(NonConstBB->getTerminator()); local
1014 if (!BI || !BI->isUnconditional()) return nullptr;
2607 Instruction *InstCombiner::visitBranchInst(BranchInst &BI) { argument
2610 if (match(&BI, m_Br(m_Not(m_Value(X)), m_BasicBlock(), m_BasicBlock())) &&
2613 BI.setCondition(X);
2614 BI.swapSuccessors();
2615 return &BI;
2620 if (BI.isConditional() && !isa<ConstantInt>(BI
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp1225 for (auto &BI : F) {
1226 const BasicBlock *BB = &BI;
1272 for (const auto &BI : F) {
1273 const BasicBlock *BB = &BI;
1418 for (auto &BI : F) {
1419 BasicBlock *B1 = &BI;
1476 for (auto &BI : F) {
1477 BasicBlock *BB = &BI;
1521 for (auto &BI : F) {
1522 BasicBlock *BB = &BI;
[all...]

Completed in 487 milliseconds

12345678