Home
last modified time | relevance | path

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

12345678910>>...12

/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DInterferenceCache.cpp160 BI->Tag = Tag; in update()
161 BI->First = BI->Last = SlotIndex(); in update()
171 if (!BI->First.isValid() || StartI < BI->First) in update()
184 if (!BI->First.isValid() || StartI < BI->First) in update()
191 SlotIndex Limit = BI->First.isValid() ? BI->First : Stop; in update()
209 if (BI->Tag == Tag) in update()
224 if (!BI->Last.isValid() || StopI > BI->Last) in update()
225 BI->Last = StopI; in update()
241 if (!BI->Last.isValid() || StopI > BI->Last) in update()
242 BI->Last = StopI; in update()
[all …]
H A DSplitKit.cpp215 BlockInfo BI; in calcLiveBlockInfo() local
216 BI.MBB = &*MFI; in calcLiveBlockInfo()
242 if (!BI.LiveIn) { in calcLiveBlockInfo()
245 BI.FirstDef = BI.FirstInstr; in calcLiveBlockInfo()
249 BI.LiveOut = true; in calcLiveBlockInfo()
271 BI.FirstInstr = BI.FirstDef = LVI->start; in calcLiveBlockInfo()
1585 if (BI.LiveIn && BI.LiveOut) in shouldSplitSingleBlock()
1599 if (!BI.LiveOut || BI.LastInstr < LastSplitPoint) { in splitSingleBlock()
1738 if (!BI.LiveOut && (!LeaveBefore || LeaveBefore >= BI.LastInstr)) { in splitRegInBlock()
1787 if (!BI.LiveOut || BI.LastInstr < LSP) { in splitRegInBlock()
[all …]
/llvm-project-15.0.7/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 …]
/llvm-project-15.0.7/bolt/lib/Profile/
H A DDataReader.cpp396 if (BI.From.Name != BI.To.Name) in readProfile()
399 if (!recordBranch(BF, BI.From.Offset, BI.To.Offset, BI.Branches, in readProfile()
522 if (BI.From.Name == BI.To.Name) { in evaluateProfileData()
636 if (BI.To.IsSymbol && BI.To.Name == BI.From.Name && BI.To.Offset != 0) in convertBranchData()
1209 if (!BI.From.IsSymbol && !BI.To.IsSymbol) in parse()
1218 (!BI.From.Name.equals(BI.To.Name) || BI.To.Offset == 0)) { in parse()
1226 if (BI.To.IsSymbol && BI.To.Offset == 0) { in parse()
1396 Diag << BI.From.Name << " " << BI.From.Offset << " " << BI.To.Name << " " in dump()
1397 << BI.To.Offset << " " << BI.Mispreds << " " << BI.Branches << "\n"; in dump()
1400 Diag << BI.From.Name << " " << BI.From.Offset << " " << BI.To.Name << " " in dump()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/AVR/
H A DAVRShiftExpand.cpp35 void expand(BinaryOperator *BI);
75 void AVRShiftExpand::expand(BinaryOperator *BI) { in expand() argument
76 auto &Ctx = BI->getContext(); in expand()
77 IRBuilder<> Builder(BI); in expand()
84 BasicBlock *BB = BI->getParent(); in expand()
105 ValuePHI->addIncoming(BI->getOperand(0), BB); in expand()
117 switch (BI->getOpcode()) { in expand()
139 Builder.SetInsertPoint(BI); in expand()
141 Result->addIncoming(BI->getOperand(0), BB); in expand()
145 BI->replaceAllUsesWith(Result); in expand()
[all …]
/llvm-project-15.0.7/bolt/lib/Core/
H A DBinaryBasicBlock.cpp279 ++BI; in replaceSuccessor()
304 ++BI; in removeSuccessor()
396 BI.Count = adjustedCount(BI.Count); in adjustExecutionCount()
398 BI.MispredictedCount = adjustedCount(BI.MispredictedCount); in adjustExecutionCount()
550 if (BI.Count && BI.Count != COUNT_NO_PROFILE) { in getBranchStats()
587 return *BI; in getBranchInfo()
588 ++BI; in getBranchInfo()
592 return *BI; in getBranchInfo()
600 return *BI; in getBranchInfo()
601 ++BI; in getBranchInfo()
[all …]
/llvm-project-15.0.7/clang/include/clang/Basic/
H A DTargetBuiltins.h29 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
40 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
49 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
62 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
82 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
92 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
112 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
116 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
126 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
135 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/
H A Dfind_first_of.pass.cpp28 typedef bidirectional_iterator<int*> BI; in test_constexpr() typedef
33 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)))… in test_constexpr()
34 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)))… in test_constexpr()
H A Dfind_first_of_pred.pass.cpp30 typedef bidirectional_iterator<int*> BI; in test_constexpr() typedef
35 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)),… in test_constexpr()
36 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)),… in test_constexpr()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DLowerExpectIntrinsic.cpp192 if (BI && BI->isConditional()) in handlePhiDef()
193 return BI; in handlePhiDef()
198 if (!BI || BI->isUnconditional()) in handlePhiDef()
200 return BI; in handlePhiDef()
219 BranchInst *BI = GetDomConditional(i); in handlePhiDef() local
220 if (!BI) in handlePhiDef()
251 BI->setMetadata(LLVMContext::MD_prof, in handlePhiDef()
255 BI->setMetadata(LLVMContext::MD_prof, in handlePhiDef()
344 if (BI.isUnconditional()) in handleBranchExpect()
347 return handleBrSelExpect<BranchInst>(BI); in handleBranchExpect()
[all …]
H A DLowerConstantIntrinsics.cpp66 BranchInst *BI = dyn_cast_or_null<BranchInst>(VH); in replaceConditionalBranchesOnConstant() local
67 if (!BI) in replaceConditionalBranchesOnConstant()
69 if (BI->isUnconditional()) in replaceConditionalBranchesOnConstant()
73 if (match(BI->getOperand(0), m_Zero())) { in replaceConditionalBranchesOnConstant()
74 Target = BI->getSuccessor(1); in replaceConditionalBranchesOnConstant()
75 Other = BI->getSuccessor(0); in replaceConditionalBranchesOnConstant()
76 } else if (match(BI->getOperand(0), m_One())) { in replaceConditionalBranchesOnConstant()
77 Target = BI->getSuccessor(0); in replaceConditionalBranchesOnConstant()
78 Other = BI->getSuccessor(1); in replaceConditionalBranchesOnConstant()
84 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.cpp1125 IRBuilder<> Builder(BI); in linearFunctionTestReplace()
1191 BI->setCondition(Cond); in linearFunctionTestReplace()
1294 BI->setCondition(NewCond); in replaceExitCond()
1350 Rewriter.setInsertPoint(BI); in replaceWithInvariantCond()
1356 IRBuilder<> Builder(BI); in replaceWithInvariantCond()
1444 if (!BI) in canonicalizeExitCondition()
1490 if (!BI) in canonicalizeExitCondition()
1578 if (!BI) in optimizeLoopExits()
1756 if (!BI) in predicateLoopExits()
1767 BI->getSuccessor(L->contains(BI->getSuccessor(0)) ? 1 : 0); in predicateLoopExits()
[all …]
H A DSimpleLoopUnswitch.cpp567 BI.setCondition(Cond); in unswitchTrivialBranch()
1027 if (!BI || BI->isConditional()) in unswitchAllTrivialConditions()
1035 if (!BI) in unswitchAllTrivialConditions()
2062 assert((SI || (BI && BI->isConditional())) && in unswitchNontrivialInvariants()
2103 BI ? BI->getSuccessor(1 - ClonedSucc) : SI->getDefaultDest(); in unswitchNontrivialInvariants()
2105 if (BI) in unswitchNontrivialInvariants()
2230 if (BI) { in unswitchNontrivialInvariants()
2291 if (BI) { in unswitchNontrivialInvariants()
2515 if (BI) in unswitchNontrivialInvariants()
2769 if (!BI || !BI->isConditional() || isa<Constant>(BI->getCondition()) || in unswitchBestCondition()
[all …]
/llvm-project-15.0.7/llvm/examples/IRTransforms/
H A DSimplifyCFG.cpp145 BranchInst *BI = dyn_cast<BranchInst>(BB.getTerminator()); in eliminateCondBranches_v1() local
146 if (!BI || !BI->isConditional()) in eliminateCondBranches_v1()
150 ConstantInt *CI = dyn_cast<ConstantInt>(BI->getCondition()); in eliminateCondBranches_v1()
156 BasicBlock *RemovedSucc = BI->getSuccessor(CI->isOne()); in eliminateCondBranches_v1()
163 BranchInst::Create(BI->getSuccessor(CI->isZero()), BI); in eliminateCondBranches_v1()
164 BI->eraseFromParent(); in eliminateCondBranches_v1()
181 BranchInst *BI = dyn_cast<BranchInst>(BB.getTerminator()); in eliminateCondBranches_v2() local
182 if (!BI || !BI->isConditional()) in eliminateCondBranches_v2()
192 BasicBlock *RemovedSucc = BI->getSuccessor(CI->isOne()); in eliminateCondBranches_v2()
200 BranchInst::Create(BI->getSuccessor(CI->isZero()), BI); in eliminateCondBranches_v2()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/
H A Dfind_end.pass.cpp28 typedef bidirectional_iterator<int*> BI; in test_constexpr() typedef
33 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == B… in test_constexpr()
34 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == B… in test_constexpr()
H A Dfind_end_pred.pass.cpp38 typedef bidirectional_iterator<int*> BI; in test_constexpr() typedef
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
44 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), eq) … in test_constexpr()
/llvm-project-15.0.7/llvm/test/CodeGen/SPIRV/instructions/
H A Dptrcmp.ll46 ; CHECK-NEXT: [[BI:%.*]] = OpConvertPtrToU {{%.+}} [[B]]
47 ; CHECK: [[R:%.*]] = OpSLessThan {{%.+}} [[AI]] [[BI]]
60 ; CHECK-NEXT: [[BI:%.*]] = OpConvertPtrToU {{%.+}} [[B]]
61 ; CHECK: [[R:%.*]] = OpULessThan {{%.+}} [[AI]] [[BI]]
74 ; CHECK-NEXT: [[BI:%.*]] = OpConvertPtrToU {{%.+}} [[B]]
88 ; CHECK-NEXT: [[BI:%.*]] = OpConvertPtrToU {{%.+}} [[B]]
102 ; CHECK-NEXT: [[BI:%.*]] = OpConvertPtrToU {{%.+}} [[B]]
103 ; CHECK: [[R:%.*]] = OpUGreaterThan {{%.+}} [[AI]] [[BI]]
116 ; CHECK-NEXT: [[BI:%.*]] = OpConvertPtrToU {{%.+}} [[B]]
130 ; CHECK-NEXT: [[BI:%.*]] = OpConvertPtrToU {{%.+}} [[B]]
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DMCF.cpp195 TotalSuccsEWeight += BI.Count; in recalculateBBCounts()
230 ++BI; in guessEdgeByRelHotness()
282 auto BI = BB->branch_info_begin(); in guessSuccEdgeCounts() local
286 TotalSuccCount += BI->Count; in guessSuccEdgeCounts()
287 ++BI; in guessSuccEdgeCounts()
298 BI = BB->branch_info_begin(); in guessSuccEdgeCounts()
301 ++BI; in guessSuccEdgeCounts()
305 BI->Count = Guessed; in guessSuccEdgeCounts()
336 BI.Count = in guessEdgeByIterativeApproach()
343 ++BI; in guessEdgeByIterativeApproach()
[all …]
/llvm-project-15.0.7/llvm/utils/TableGen/
H A DCodeEmitterGen.cpp53 void AddCodeToMergeInOperand(Record *R, BitsInit *BI,
69 BitsInit *BI, int bit) { in getVariableBit() argument
90 int bit = BI->getNumBits()-1; in AddCodeToMergeInOperand()
94 if (getVariableBit(VarName, BI, bit) != -1) in AddCodeToMergeInOperand()
176 int varBit = getVariableBit(VarName, BI, tmpBit); in AddCodeToMergeInOperand()
189 varBit = getVariableBit(VarName, BI, tmpBit); in AddCodeToMergeInOperand()
199 int varBit = getVariableBit(VarName, BI, bit); in AddCodeToMergeInOperand()
213 varBit = getVariableBit(VarName, BI, bit); in AddCodeToMergeInOperand()
293 BitsInit *BI = EncodingDef->getValueAsBitsInit("Inst"); in getInstructionCaseForEncoding() local
420 BitsInit *BI = R->getValueAsBitsInit("Inst"); in run() local
[all …]
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/llvm/
H A DIncludeOrderCheck.cpp128 for (unsigned BI = 0, BE = Blocks.size() - 1; BI != BE; ++BI) in EndOfMainFile() local
129 llvm::sort(IncludeIndices.begin() + Blocks[BI], in EndOfMainFile()
130 IncludeIndices.begin() + Blocks[BI + 1], in EndOfMainFile()
146 for (unsigned BI = 0, BE = Blocks.size() - 1; BI != BE; ++BI) { in EndOfMainFile() local
149 for (I = Blocks[BI], E = Blocks[BI + 1]; I != E; ++I) in EndOfMainFile()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DFlattenCFG.cpp190 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI->getIterator(); in FlattenParallelAndOr() local
191 BI != BE;) { in FlattenParallelAndOr()
192 Instruction *CI = &*BI++; in FlattenParallelAndOr()
254 auto *BI = cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr() local
255 auto *CI = dyn_cast<CmpInst>(BI->getCondition()); in FlattenParallelAndOr()
263 BI->swapSuccessors(); in FlattenParallelAndOr()
360 for (BasicBlock::iterator BI(PBI2), BE(PTI2); BI != BE; ++BI) { in CompareIfRegionBlock() local
361 if (BI->mayReadFromMemory() || BI->mayWriteToMemory()) { in CompareIfRegionBlock()
363 if (!AA || !AA->isNoAlias(&*iter1, &*BI)) in CompareIfRegionBlock()
474 for (BasicBlock::iterator BI(PBI2), BE(PTI2); BI != BE; ++BI) { in MergeIfRegion() local
[all …]
H A DSimplifyCFG.cpp433 if (!BI || BI->isConditional() || BI->getSuccessor(0) != BB) in dominatesMergePoint()
773 if (BI->isConditional() && BI->getCondition()->hasOneUse()) in isValueEqualityComparison()
2975 if (BI && BI->isConditional() && BI->getCondition() == V && in getKnownValueOnEdge()
2976 BI->getSuccessor(0) != BI->getSuccessor(1)) in getKnownValueOnEdge()
3377 assert(BI && PBI && BI->isConditional() && PBI->isConditional() && in shouldFoldCondBranchesToCommonDestination()
4988 assert(BI->getSuccessor(0) != BI->getSuccessor(1) && in simplifyUnreachable()
6824 BI->getSuccessor(0) != BI->getSuccessor(1) && in simplifyCondBranch()
6843 if (&*I == BI) { in simplifyCondBranch()
6848 if (&*I == BI && FoldValueComparisonIntoPredecessors(BI, Builder)) in simplifyCondBranch()
6892 if (SpeculativelyExecuteBB(BI, BI->getSuccessor(0), TTI)) in simplifyCondBranch()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/PowerPC/
H A DPPCCTRLoopsVerify.cpp99 MachineBasicBlock::iterator BI = I; in verifyCTRBranch() local
123 if (I != BI && clobbersCTR(*I)) { in verifyCTRBranch()
127 << printMBBReference(*BI->getParent()) << " (" in verifyCTRBranch()
128 << BI->getParent()->getFullName() << ") instruction " in verifyCTRBranch()
129 << *BI << "\n"); in verifyCTRBranch()
144 << printMBBReference(*BI->getParent()) << " (" in verifyCTRBranch()
145 << BI->getParent()->getFullName() << ") instruction " in verifyCTRBranch()
146 << *BI << "\n"); in verifyCTRBranch()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DGuardUtils.cpp63 auto *BI = dyn_cast<BranchInst>(U); in parseWidenableBranch() local
64 if (!BI || !BI->isConditional()) in parseWidenableBranch()
66 auto *Cond = BI->getCondition(); in parseWidenableBranch()
70 IfTrueBB = BI->getSuccessor(0); in parseWidenableBranch()
71 IfFalseBB = BI->getSuccessor(1); in parseWidenableBranch()
74 WC = &BI->getOperandUse(0); in parseWidenableBranch()

12345678910>>...12