/llvm-project/llvm/utils/TableGen/ |
H A D | CodeEmitterGen.cpp | 81 getVariableBit(const std::string & VarName,BitsInit * BI,int bit) getVariableBit() argument 96 addCodeToMergeInOperand(Record * R,BitsInit * BI,const std::string & VarName,std::string & Case,std::string & BitOffsetCase,CodeGenTarget & Target) addCodeToMergeInOperand() argument 347 BitsInit *BI = EncodingDef->getValueAsBitsInit("Inst"); addInstructionCasesForEncoding() local 433 BitsInit *BI = EncodingDef->getValueAsBitsInit("Inst"); emitInstructionBaseValues() local 497 BitsInit *BI = KV.second->getValueAsBitsInit("Inst"); run() local 504 BitsInit *BI = R->getValueAsBitsInit("Inst"); run() local [all...] |
/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | FlattenCFG.cpp | 188 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI->getIterator(); in FlattenParallelAndOr() local 252 auto *BI = cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr() local 357 for (BasicBlock::iterator BI(PBI2), BE(PTI2); BI != BE; ++BI) { in CompareIfRegionBlock() local 478 for (BasicBlock::iterator BI(PBI2), BE(PTI2); BI != BE; ++BI) { in MergeIfRegion() local
|
H A D | LoopRotationUtils.cpp | 215 BranchInst *BI = dyn_cast<BranchInst>(Header->getTerminator()); in profitableToRotateLoopExitingLatch() local 241 BranchInst *BI = dyn_cast<BranchInst>(Latch->getTerminator()); in canRotateDeoptimizingLatchExit() local 426 BranchInst *BI = dyn_cast<BranchInst>(OrigHeader->getTerminator()); rotateLoop() local 785 for (BasicBlock::iterator BI = SuccBB->begin(); rotateLoop() local 1028 BranchInst *BI = dyn_cast<BranchInst>(LastExit->getTerminator()); simplifyLoopLatch() local [all...] |
/llvm-project/bolt/lib/Passes/ |
H A D | MCF.cpp | 207 BinaryBasicBlock::BinaryBranchInfo &BI = Pred->getBranchInfo(BB); in guessEdgeByRelHotness() local 215 auto BI = BB.branch_info_begin(); in guessEdgeByRelHotness() local 274 auto BI = BB->branch_info_begin(); in guessSuccEdgeCounts() local 327 BinaryBasicBlock::BinaryBranchInfo &BI = Pred->getBranchInfo(BB); in guessEdgeByIterativeApproach() local 332 auto BI = BB.branch_info_begin(); in guessEdgeByIterativeApproach() local
|
H A D | ReorderAlgorithm.cpp | 151 auto BI = BB->branch_info_begin(); in clusterBasicBlocks() local 271 auto BI = SrcBB->branch_info_begin(); in calculateWeight() local 292 auto BI = PredBB->branch_info_begin(); in calculateWeight() local 418 auto BI = BB->branch_info_begin(); in reorderBasicBlocks() local 536 auto BI = BB->branch_info_begin(); in reorderBasicBlocks() local
|
/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | IndVarSimplify.cpp | 467 Cond = BI->getCondition(); in rewriteFirstIterationLoopExitValues() local 703 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); isLoopExitTestBasedOn() local 722 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); needsLFTR() local 1008 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); linearFunctionTestReplace() local 1181 replaceExitCond(BranchInst * BI,Value * NewCond,SmallVectorImpl<WeakTrackingVH> & DeadInsts) replaceExitCond() argument 1193 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); createFoldedExitCond() local 1202 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); foldExit() local 1259 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); createInvariantCond() local 1273 auto *BI = cast<BranchInst>(ExitingBB->getTerminator()); createReplacement() local 1323 optimizeLoopExitWithUnknownExitCount(const Loop * L,BranchInst * BI,BasicBlock * ExitingBB,const SCEV * MaxIter,bool SkipLastIter,ScalarEvolution * SE,SCEVExpander & Rewriter,SmallVectorImpl<WeakTrackingVH> & DeadInsts) optimizeLoopExitWithUnknownExitCount() argument 1440 auto *BI = dyn_cast<BranchInst>(ExitingBB->getTerminator()); canonicalizeExitCondition() local 1486 auto *BI = dyn_cast<BranchInst>(ExitingBB->getTerminator()); canonicalizeExitCondition() local 1574 BranchInst *BI = dyn_cast<BranchInst>(ExitingBB->getTerminator()); optimizeLoopExits() local 1646 auto *BI = cast<BranchInst>(ExitingBB->getTerminator()); optimizeLoopExits() local 1764 BranchInst *BI = dyn_cast<BranchInst>(ExitingBB->getTerminator()); predicateLoopExits() local 1864 auto *BI = cast<BranchInst>(ExitingBB->getTerminator()); predicateLoopExits() local [all...] |
H A D | LowerExpectIntrinsic.cpp | 198 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); in handlePhiDef() local 229 BranchInst *BI = GetDomConditional(i); in handlePhiDef() local 357 static bool handleBranchExpect(BranchInst &BI) { in handleBranchExpect() 369 if (BranchInst *BI = dyn_cast<BranchInst>(BB.getTerminator())) { in lowerExpectIntrinsic() local
|
H A D | LoopBoundSplit.cpp | 31 BranchInst *BI = nullptr; member 160 const BranchInst *BI) { in isProcessableCondBI() argument 251 if (!BI) in findSplitCandidate() local 223 isProfitableToTransform(const Loop & L,const BranchInst * BI) isProfitableToTransform() argument [all...] |
/llvm-project/clang/utils/TableGen/ |
H A D | ClangSACheckersEmitter.cpp | 78 const BitsInit *BI = R.getValueAsBitsInit("Documentation"); getCheckerDocs() local 97 if (BitsInit *BI = R.getValueAsBitsInit("Type")) { getCheckerOptionType() local 114 if (BitsInit *BI = R.getValueAsBitsInit("DevelopmentStage")) { getDevelopmentStage() local
|
/llvm-project/llvm/lib/Target/SPIRV/ |
H A D | SPIRVMergeRegionExitTargets.cpp | 54 if (auto *BI = dyn_cast<BranchInst>(T)) { in gatherSuccessors() local 84 if (auto *BI = dyn_cast<BranchInst>(T)) { in createExitVariable() local 114 if (auto *BI in replaceBranchTargets() local [all...] |
/llvm-project/llvm/lib/Analysis/ |
H A D | DomConditionCache.cpp | 19 void DomConditionCache::registerBranch(BranchInst *BI) { in registerBranch()
|
H A D | GuardUtils.cpp | 72 auto *BI = dyn_cast<BranchInst>(U); in parseWidenableBranch() local 152 auto *BI = dyn_cast<BranchInst>(U); in extractWidenableCondition() local
|
/llvm-project/bolt/lib/Profile/ |
H A D | DataReader.cpp | 98 for (const BranchInfo &BI : Data) { in getNumExecutedBranches() local 151 BranchInfo &BI = Data[Iter->second]; in bumpBranchCount() local 164 BranchInfo &BI = Data[Iter->second]; in bumpCallCount() local 178 BranchInfo &BI = EntryData[Iter->second]; in bumpEntryCount() local 183 void BranchInfo::mergeWith(const BranchInfo &BI) { in mergeWith() 375 for (const BranchInfo &BI : FBD->EntryData) { in readProfile() local 385 for (const BranchInfo &BI : FBD->Data) { in readProfile() local 510 for (const BranchInfo &BI : BranchData.Data) { in evaluateProfileData() local 793 BinaryBasicBlock::BinaryBranchInfo &BI = FromBB->getBranchInfo(*ToBB); in recordBranch() local 1196 BranchInfo BI = Res.get(); in parse() local [all …]
|
/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
H A D | find_first_of.pass.cpp | 28 typedef bidirectional_iterator<int*> BI; in test_constexpr() typedef
|
H A D | find_first_of_pred.pass.cpp | 30 typedef bidirectional_iterator<int*> BI; in test_constexpr() typedef
|
/llvm-project/llvm/utils/TableGen/Common/ |
H A D | VarLenCodeEmitterGen.cpp | 146 if (const auto *BI = dyn_cast<BitsInit>(Arg)) { buildRec() local 151 } else if (const auto *BI = dyn_cast<BitInit>(Arg)) { buildRec() local 387 if (const auto *BI = dyn_cast<BitsInit>(SI->Value)) { emitInstructionBaseValues() local 393 if (const auto *BI = dyn_cast<BitInit>(SI->Value)) emitInstructionBaseValues() local [all...] |
/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
H A D | equal_pred.pass.cpp | 40 typedef bidirectional_iterator<int*> BI; in test_constexpr() typedef
|
/llvm-project/llvm/lib/Target/NVPTX/ |
H A D | NVPTXAllocaHoisting.cpp | 46 for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE;) { in runOnFunction() local
|
H A D | NVPTXLowerAlloca.cpp | 104 auto BI = dyn_cast<BitCastInst>(AllocaUse.getUser()); runOnFunction() local
|
H A D | NVPTXImageOptimizer.cpp | 151 if (BI->isUnconditional()) continue; in replaceWith() local
|
/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
H A D | find_end.pass.cpp | 28 typedef bidirectional_iterator<int*> BI; in test_constexpr() typedef
|
H A D | find_end_pred.pass.cpp | 38 typedef bidirectional_iterator<int*> BI; in test_constexpr() typedef
|
/llvm-project/bolt/lib/Core/ |
H A D | BinaryBasicBlock.cpp | 271 auto BI = BranchInfo.begin(); in replaceSuccessor() local 296 auto BI = BranchInfo.begin(); in removeSuccessor() local 497 for (const BinaryBranchInfo &BI : BranchInfo) { in getBranchStats() local 507 const BinaryBranchInfo &BI = BranchInfo[Itr - Successors.begin()]; in getBranchStats() local
|
/llvm-project/llvm/examples/IRTransforms/ |
H A D | SimplifyCFG.cpp | 143 BranchInst *BI = dyn_cast<BranchInst>(BB.getTerminator()); in eliminateCondBranches_v1() local 179 BranchInst *BI = dyn_cast<BranchInst>(BB.getTerminator()); in eliminateCondBranches_v2() local [all...] |
/llvm-project/clang-tools-extra/clang-tidy/llvm/ |
H A D | IncludeOrderCheck.cpp | 127 for (unsigned BI = 0, BE = Blocks.size() - 1; BI != BE; ++BI) in EndOfMainFile() local 145 for (unsigned BI = 0, BE = Blocks.size() - 1; BI != BE; ++BI) { in EndOfMainFile() local
|