Home
last modified time | relevance | path

Searched refs:BI (Results 1 – 25 of 249) sorted by relevance

12345678910

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DInterferenceCache.cpp161 BI->Tag = Tag; in update()
162 BI->First = BI->Last = SlotIndex(); in update()
172 if (!BI->First.isValid() || StartI < BI->First) in update()
185 if (!BI->First.isValid() || StartI < BI->First) in update()
192 SlotIndex Limit = BI->First.isValid() ? BI->First : Stop; in update()
210 if (BI->Tag == Tag) in update()
225 if (!BI->Last.isValid() || StopI > BI->Last) in update()
226 BI->Last = StopI; in update()
242 if (!BI->Last.isValid() || StopI > BI->Last) in update()
243 BI->Last = StopI; in update()
[all …]
H A DSplitKit.cpp218 BlockInfo BI; in calcLiveBlockInfo() local
219 BI.MBB = &*MFI; in calcLiveBlockInfo()
245 if (!BI.LiveIn) { in calcLiveBlockInfo()
248 BI.FirstDef = BI.FirstInstr; in calcLiveBlockInfo()
274 BI.FirstInstr = BI.FirstDef = LVI->start; in calcLiveBlockInfo()
304 return BI.LiveIn && BI.LiveOut && BI.FirstDef && L && in calcLiveBlockInfo()
1598 if (BI.LiveIn && BI.LiveOut) in shouldSplitSingleBlock()
1614 if (!BI.LiveOut || BI.LastInstr < LastSplitPoint) { in splitSingleBlock()
1753 if (!BI.LiveOut && (!LeaveBefore || LeaveBefore >= BI.LastInstr)) { in splitRegInBlock()
1802 if (!BI.LiveOut || BI.LastInstr < LSP) { in splitRegInBlock()
[all …]
H A DInterleavedAccessPass.cpp296 if (auto *BI = dyn_cast<BinaryOperator>(User)) { in lowerInterleavedLoad() local
297 if (!BI->user_empty() && all_of(BI->users(), [](auto *U) { in lowerInterleavedLoad()
301 for (auto *SVI : BI->users()) in lowerInterleavedLoad()
384 BinaryOperator *BI = cast<BinaryOperator>(SVI->getOperand(0)); in replaceBinOpShuffles() local
385 Type *BIOp0Ty = BI->getOperand(0)->getType(); in replaceBinOpShuffles()
392 new ShuffleVectorInst(BI->getOperand(0), PoisonValue::get(BIOp0Ty), in replaceBinOpShuffles()
395 BI->getOperand(1), PoisonValue::get(BI->getOperand(1)->getType()), Mask, in replaceBinOpShuffles()
398 BI->getOpcode(), NewSVI1, NewSVI2, BI, BI->getName(), SVI); in replaceBinOpShuffles()
400 LLVM_DEBUG(dbgs() << " Replaced: " << *BI << "\n And : " << *SVI in replaceBinOpShuffles()
/freebsd/contrib/llvm-project/llvm/lib/Target/AVR/
H A DAVRShiftExpand.cpp36 void expand(BinaryOperator *BI);
77 void AVRShiftExpand::expand(BinaryOperator *BI) { in expand() argument
78 auto &Ctx = BI->getContext(); in expand()
79 IRBuilder<> Builder(BI); in expand()
86 BasicBlock *BB = BI->getParent(); in expand()
107 ValuePHI->addIncoming(BI->getOperand(0), BB); in expand()
119 switch (BI->getOpcode()) { in expand()
141 Builder.SetInsertPoint(BI); in expand()
143 Result->addIncoming(BI->getOperand(0), BB); in expand()
147 BI->replaceAllUsesWith(Result); in expand()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Basic/
H A DTargetBuiltins.h29 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
41 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
50 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
60 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
96 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
106 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
126 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
130 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
140 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
149 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DInstIterator.h39 BI_t BI; // BasicBlock::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()
63 BI = BB->begin(); in InstIterator()
80 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
87 ++BI;
96 while (BB == BBs->end() || BI == BB->begin()) {
98 BI = BB->end();
100 --BI;
113 while (BI == BB->end()) { in advanceToNextBB()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLowerExpectIntrinsic.cpp199 if (BI && BI->isConditional()) in handlePhiDef()
200 return BI; in handlePhiDef()
205 if (!BI || BI->isUnconditional()) in handlePhiDef()
207 return BI; in handlePhiDef()
229 BranchInst *BI = GetDomConditional(i); in handlePhiDef() local
230 if (!BI) in handlePhiDef()
263 BI->setMetadata(LLVMContext::MD_prof, in handlePhiDef()
267 BI->setMetadata(LLVMContext::MD_prof, in handlePhiDef()
356 if (BI.isUnconditional()) in handleBranchExpect()
359 return handleBrSelExpect<BranchInst>(BI); in handleBranchExpect()
[all …]
H A DLowerConstantIntrinsics.cpp68 BranchInst *BI = dyn_cast_or_null<BranchInst>(VH); in replaceConditionalBranchesOnConstant() local
69 if (!BI) in replaceConditionalBranchesOnConstant()
71 if (BI->isUnconditional()) in replaceConditionalBranchesOnConstant()
75 if (match(BI->getOperand(0), m_Zero())) { in replaceConditionalBranchesOnConstant()
76 Target = BI->getSuccessor(1); in replaceConditionalBranchesOnConstant()
77 Other = BI->getSuccessor(0); in replaceConditionalBranchesOnConstant()
78 } else if (match(BI->getOperand(0), m_One())) { in replaceConditionalBranchesOnConstant()
79 Target = BI->getSuccessor(0); in replaceConditionalBranchesOnConstant()
80 Other = BI->getSuccessor(1); in replaceConditionalBranchesOnConstant()
86 BasicBlock *Source = BI->getParent(); in replaceConditionalBranchesOnConstant()
[all …]
H A DLoopBoundSplit.cpp31 BranchInst *BI = nullptr; member
160 const BranchInst *BI) { in isProcessableCondBI() argument
219 Cond.BI = ExitingBI; in canSplitLoopBound()
230 BasicBlock *Succ0 = BI->getSuccessor(0); in isProfitableToTransform()
231 BasicBlock *Succ1 = BI->getSuccessor(1); in isProfitableToTransform()
252 if (!BI) in findSplitCandidate()
256 if (!isProcessableCondBI(SE, BI)) in findSplitCandidate()
260 if (L.isLoopInvariant(BI->getCondition())) in findSplitCandidate()
281 SplitCandidateCond.BI = BI; in findSplitCandidate()
282 return BI; in findSplitCandidate()
[all …]
H A DIndVarSimplify.cpp460 Cond = BI->getCondition(); in rewriteFirstIterationLoopExitValues()
1003 IRBuilder<> Builder(BI); in linearFunctionTestReplace()
1068 BI->setCondition(Cond); in linearFunctionTestReplace()
1174 BI->setCondition(NewCond); in replaceExitCond()
1315 (L->contains(BI->getSuccessor(0)) != L->contains(BI->getSuccessor(1))) && in optimizeLoopExitWithUnknownExitCount()
1429 if (!BI) in canonicalizeExitCondition()
1475 if (!BI) in canonicalizeExitCondition()
1563 if (!BI) in optimizeLoopExits()
1753 if (!BI) in predicateLoopExits()
1764 BI->getSuccessor(L->contains(BI->getSuccessor(0)) ? 1 : 0); in predicateLoopExits()
[all …]
H A DLoopPredication.cpp762 LLVM_DEBUG(BI->dump()); in widenWidenableBranchGuardConditions()
767 parseWidenableGuard(BI, Checks); in widenWidenableBranchGuardConditions()
781 auto *OldCond = BI->getCondition(); in widenWidenableBranchGuardConditions()
782 BI->setCondition(AllChecks); in widenWidenableBranchGuardConditions()
791 auto *GuardBB = BI->getParent(); in widenWidenableBranchGuardConditions()
801 assert(isGuardAsWidenableBranch(BI) && in widenWidenableBranchGuardConditions()
818 if (!BI || !BI->isConditional()) { in parseLoopLatchICmp()
995 if (BI->getSuccessor(0) == BB && isWidenableBranch(BI)) in FindWidenableTerminatorAboveLoop()
996 return BI; in FindWidenableTerminatorAboveLoop()
1081 if (!BI) in predicateLoopExits()
[all …]
H A DSimpleLoopUnswitch.cpp1091 if (!BI || BI->isConditional()) in unswitchAllTrivialConditions()
1099 if (!BI) in unswitchAllTrivialConditions()
2178 assert((SI || (BI && BI->isConditional())) && in unswitchNontrivialInvariants()
2219 BI ? BI->getSuccessor(1 - ClonedSucc) : SI->getDefaultDest(); in unswitchNontrivialInvariants()
2221 if (BI) in unswitchNontrivialInvariants()
2344 if (BI) { in unswitchNontrivialInvariants()
2403 if (BI) { in unswitchNontrivialInvariants()
2629 if (BI) in unswitchNontrivialInvariants()
2938 if (!BI || !BI->isConditional() || in collectUnswitchCandidates()
2939 BI->getSuccessor(0) == BI->getSuccessor(1)) in collectUnswitchCandidates()
[all …]
H A DJumpThreading.cpp362 if (BI && BI->isUnconditional()) { in runImpl()
1161 if (!BI || !BI->isConditional()) in processImpliedCondition()
1208 BI->eraseFromParent(); in processImpliedCondition()
2070 for (; PHINode *PN = dyn_cast<PHINode>(BI); ++BI) { in cloneInstructions()
2094 for (; BI != BE; ++BI) { in cloneInstructions()
2685 for (; PHINode *PN = dyn_cast<PHINode>(BI); ++BI) in duplicateCondBranchOnPHIIntoPred()
2689 for (; BI != BB->end(); ++BI) { in duplicateCondBranchOnPHIIntoPred()
2817 PHINode *Phi = dyn_cast<PHINode>(BI); ++BI) in unfoldSelectInstr()
2933 PHINode *PN = dyn_cast<PHINode>(BI); ++BI) { in tryToUnfoldSelectInCurrBB()
3110 for (auto BI = BB->begin(); &*BI != AfterGuard; ++BI) in threadGuard() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DGuardUtils.cpp72 auto *BI = dyn_cast<BranchInst>(U); in parseWidenableBranch() local
73 if (!BI || !BI->isConditional()) in parseWidenableBranch()
75 auto *Cond = BI->getCondition(); in parseWidenableBranch()
79 IfTrueBB = BI->getSuccessor(0); in parseWidenableBranch()
80 IfFalseBB = BI->getSuccessor(1); in parseWidenableBranch()
83 WC = &BI->getOperandUse(0); in parseWidenableBranch()
152 auto *BI = dyn_cast<BranchInst>(U); in extractWidenableCondition() local
153 if (!BI || !BI->isConditional()) in extractWidenableCondition()
156 auto Condition = BI->getCondition(); in extractWidenableCondition()
H A DDomConditionCache.cpp58 void DomConditionCache::registerBranch(BranchInst *BI) { in registerBranch() argument
59 assert(BI->isConditional() && "Must be conditional branch"); in registerBranch()
61 findAffectedValues(BI->getCondition(), Affected); in registerBranch()
64 if (!is_contained(AV, BI)) in registerBranch()
65 AV.push_back(BI); in registerBranch()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DInfoByHwMode.h47 auto BI = B.begin(); in union_modes() local
55 if (BI != B.end() && BI->first == DefaultMode) { in union_modes()
57 ++BI; in union_modes()
62 if (BI == B.end()) { in union_modes()
68 if (BI->first < AI->first) { in union_modes()
69 Modes.push_back(BI->first); in union_modes()
70 ++BI; in union_modes()
73 if (AI->first == BI->first) in union_modes()
74 ++BI; in union_modes()
80 for (; BI != B.end(); ++BI) in union_modes()
[all …]
H A DCodeEmitterGen.cpp64 bool addCodeToMergeInOperand(Record *R, BitsInit *BI,
82 BitsInit *BI, int bit) { in getVariableBit() argument
104 int bit = BI->getNumBits()-1; in addCodeToMergeInOperand()
108 if (getVariableBit(VarName, BI, bit) != -1) in addCodeToMergeInOperand()
173 int varBit = getVariableBit(VarName, BI, tmpBit); in addCodeToMergeInOperand()
186 varBit = getVariableBit(VarName, BI, tmpBit); in addCodeToMergeInOperand()
197 int varBit = getVariableBit(VarName, BI, bit); in addCodeToMergeInOperand()
211 varBit = getVariableBit(VarName, BI, bit); in addCodeToMergeInOperand()
308 BitsInit *BI = EncodingDef->getValueAsBitsInit("Inst"); in addInstructionCasesForEncoding() local
457 BitsInit *BI = R->getValueAsBitsInit("Inst"); in run() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DFlattenCFG.cpp188 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI->getIterator(); in FlattenParallelAndOr() local
189 BI != BE;) { in FlattenParallelAndOr()
190 Instruction *CI = &*BI++; in FlattenParallelAndOr()
252 auto *BI = cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr() local
253 auto *CI = dyn_cast<CmpInst>(BI->getCondition()); in FlattenParallelAndOr()
261 BI->swapSuccessors(); in FlattenParallelAndOr()
357 for (BasicBlock::iterator BI(PBI2), BE(PTI2); BI != BE; ++BI) { in CompareIfRegionBlock() local
358 if (BI->mayReadFromMemory() || BI->mayWriteToMemory()) { in CompareIfRegionBlock()
360 if (!AA || !AA->isNoAlias(&*iter1, &*BI)) in CompareIfRegionBlock()
478 for (BasicBlock::iterator BI(PBI2), BE(PTI2); BI != BE; ++BI) { in MergeIfRegion() local
[all …]
H A DSimplifyCFG.cpp441 if (!BI || BI->isConditional() || BI->getSuccessor(0) != BB) in dominatesMergePoint()
782 if (BI->isConditional() && BI->getCondition()->hasOneUse()) in isValueEqualityComparison()
1720 if (BI) { in hoistSuccIdenticalTerminatorToSwitchOrIf()
1788 if (BI) { in hoistSuccIdenticalTerminatorToSwitchOrIf()
3231 if (BI && BI->isConditional() && BI->getCondition() == V && in getKnownValueOnEdge()
3232 BI->getSuccessor(0) != BI->getSuccessor(1)) in getKnownValueOnEdge()
3651 assert(BI && PBI && BI->isConditional() && PBI->isConditional() && in shouldFoldCondBranchesToCommonDestination()
5293 assert(BI->getSuccessor(0) != BI->getSuccessor(1) && in simplifyUnreachable()
7263 BI->getSuccessor(0) != BI->getSuccessor(1) && in simplifyCondBranch()
7333 if (SpeculativelyExecuteBB(BI, BI->getSuccessor(0))) in simplifyCondBranch()
[all …]
H A DLoopRotationUtils.cpp216 assert(BI && BI->isConditional() && "need header with conditional exit"); in profitableToRotateLoopExitingLatch()
217 BasicBlock *HeaderExit = BI->getSuccessor(0); in profitableToRotateLoopExitingLatch()
219 HeaderExit = BI->getSuccessor(1); in profitableToRotateLoopExitingLatch()
243 if (!BI || !BI->isConditional()) in canRotateDeoptimizingLatchExit()
246 BasicBlock *Exit = BI->getSuccessor(1); in canRotateDeoptimizingLatchExit()
248 Exit = BI->getSuccessor(0); in canRotateDeoptimizingLatchExit()
417 if (!BI || BI->isUnconditional()) in rotateLoop()
510 BasicBlock *Exit = BI->getSuccessor(0); in rotateLoop()
511 BasicBlock *NewHeader = BI->getSuccessor(1); in rotateLoop()
757 PHINode *PN = dyn_cast<PHINode>(BI); ++BI) in rotateLoop()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCCTRLoopsVerify.cpp97 MachineBasicBlock::iterator BI = I; in verifyCTRBranch() local
121 if (I != BI && clobbersCTR(*I)) { in verifyCTRBranch()
125 << printMBBReference(*BI->getParent()) << " (" in verifyCTRBranch()
126 << BI->getParent()->getFullName() << ") instruction " in verifyCTRBranch()
127 << *BI << "\n"); in verifyCTRBranch()
142 << printMBBReference(*BI->getParent()) << " (" in verifyCTRBranch()
143 << BI->getParent()->getFullName() << ") instruction " in verifyCTRBranch()
144 << *BI << "\n"); in verifyCTRBranch()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DR600Packetizer.cpp69 MachineBasicBlock::instr_iterator BI = I.getInstrIterator(); in getPreviousVector() local
71 BI++; in getPreviousVector()
75 int BISlot = getSlot(*BI); in getPreviousVector()
79 if (TII->isPredicated(*BI)) in getPreviousVector()
82 if (OperandIdx > -1 && BI->getOperand(OperandIdx).getImm() == 0) in getPreviousVector()
84 int DstIdx = TII->getOperandIdx(BI->getOpcode(), R600::OpName::dst); in getPreviousVector()
88 Register Dst = BI->getOperand(DstIdx).getReg(); in getPreviousVector()
89 if (isTrans || TII->isTransOnly(*BI)) { in getPreviousVector()
93 if (BI->getOpcode() == R600::DOT4_r600 || in getPreviousVector()
94 BI->getOpcode() == R600::DOT4_eg) { in getPreviousVector()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXImageOptimizer.cpp151 if (BranchInst *BI = dyn_cast<BranchInst>(U)) { in replaceWith() local
152 if (BI->isUnconditional()) continue; in replaceWith()
156 Dest = BI->getSuccessor(1); in replaceWith()
159 Dest = BI->getSuccessor(0); in replaceWith()
160 BranchInst::Create(Dest, BI); in replaceWith()
161 InstrToDelete.push_back(BI); in replaceWith()
/freebsd/contrib/llvm-project/llvm/lib/Target/BPF/
H A DBPFAdjustOpt.cpp222 auto *BI = dyn_cast<BranchInst>(TI); in serializeICMPCrossBB() local
223 if (!BI || !BI->isConditional()) in serializeICMPCrossBB()
225 auto *Cond = dyn_cast<ICmpInst>(BI->getCondition()); in serializeICMPCrossBB()
232 BI = dyn_cast<BranchInst>(TI); in serializeICMPCrossBB()
233 if (!BI || !BI->isConditional()) in serializeICMPCrossBB()
235 Cond = dyn_cast<ICmpInst>(BI->getCondition()); in serializeICMPCrossBB()
260 PassThroughInfo Info(Cond, BI, 0); in serializeICMPCrossBB()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMergeFunctions.cpp553 BI != BIE; ++BI) { in filterInstsUnrelatedToPDI()
556 LLVM_DEBUG(BI->print(dbgs())); in filterInstsUnrelatedToPDI()
561 LLVM_DEBUG(BI->print(dbgs())); in filterInstsUnrelatedToPDI()
563 PDIRelated.insert(&*BI); in filterInstsUnrelatedToPDI()
566 LLVM_DEBUG(BI->print(dbgs())); in filterInstsUnrelatedToPDI()
571 LLVM_DEBUG(BI->print(dbgs())); in filterInstsUnrelatedToPDI()
616 LLVM_DEBUG(BI->print(dbgs())); in filterInstsUnrelatedToPDI()
619 } else if (BI->isTerminator() && &*BI == GEntryBlock->getTerminator()) { in filterInstsUnrelatedToPDI()
621 LLVM_DEBUG(BI->print(dbgs())); in filterInstsUnrelatedToPDI()
623 PDIRelated.insert(&*BI); in filterInstsUnrelatedToPDI()
[all …]

12345678910