/freebsd-current/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericLoopInfoImpl.h | 375 for (block_iterator BI = (*I)->block_begin(), BE = (*I)->block_end(); 376 BI != BE; ++BI) { 377 assert(contains(*BI) &&
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LoopPeel.cpp | 458 auto *BI = dyn_cast<BranchInst>(BB->getTerminator()); local 459 if (!BI || BI->isUnconditional()) 466 ComputePeelCount(BI->getCondition(), 0);
|
H A D | LoopUnroll.cpp | 362 auto *BI = dyn_cast<BranchInst>(ExitingBlock->getTerminator()); local 363 if (!BI) 376 Info.ExitOnTrue = !L->contains(BI->getSuccessor(0));
|
/freebsd-current/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | TargetTransformInfo.cpp | 182 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { 183 if (!BI->isConditional()) 186 ExitBranch = BI; 432 bool TargetTransformInfo::canSaveCmp(Loop *L, BranchInst **BI, argument 436 return TTIImpl->canSaveCmp(L, BI, SE, LI, DT, AC, LibInfo);
|
H A D | Loads.cpp | 252 if (const Instruction *BI = dyn_cast<Instruction>(B)) 253 if (cast<Instruction>(A)->isIdenticalToWhenDefined(BI))
|
H A D | IRSimilarityIdentifier.cpp | 92 BranchInst *BI = cast<BranchInst>(Inst); local 95 BBNumIt = BasicBlockToInteger.find(BI->getParent()); 117 if (BranchInst *BI = dyn_cast<BranchInst>(Inst)) 119 std::next(OperVals.begin(), BI->isConditional() ? 1 : 0),
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopUnrollPass.cpp | 594 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { 595 if (BI->isConditional()) { 596 if (auto *SimpleCond = getSimplifiedConstant(BI->getCondition())) { 599 KnownSucc = BI->getSuccessor(0); 602 KnownSucc = BI->getSuccessor(SimpleCondVal->isZero() ? 1 : 0);
|
H A D | LoopInterchange.cpp | 1415 // Update BI to jump to NewBB instead of OldBB. Records updates to the 1417 // \p OldBB is exactly once in BI's successor list. 1418 static void updateSuccessor(BranchInst *BI, BasicBlock *OldBB, 1423 llvm::count_if(successors(BI), 1426 }) == 1) && "BI must jump to OldBB exactly once."); 1428 for (Use &Op : BI->operands()) 1436 {DominatorTree::UpdateKind::Insert, BI->getParent(), NewBB}); 1438 {DominatorTree::UpdateKind::Delete, BI->getParent(), OldBB});
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64FastISel.cpp | 222 bool emitCompareAndBranch(const BranchInst *BI); 2258 bool AArch64FastISel::emitCompareAndBranch(const BranchInst *BI) { argument 2266 assert(isa<CmpInst>(BI->getCondition()) && "Expected cmp instruction"); 2267 const CmpInst *CI = cast<CmpInst>(BI->getCondition()); 2281 MachineBasicBlock *TBB = FuncInfo.MBBMap[BI->getSuccessor(0)]; 2282 MachineBasicBlock *FBB = FuncInfo.MBBMap[BI->getSuccessor(1)]; 2379 finishCondBranch(BI->getParent(), TBB, FBB); 2384 const BranchInst *BI = cast<BranchInst>(I); local 2385 if (BI->isUnconditional()) { 2386 MachineBasicBlock *MSucc = FuncInfo.MBBMap[BI 2513 const IndirectBrInst *BI = cast<IndirectBrInst>(I); local [all...] |
/freebsd-current/contrib/ncurses/form/ |
H A D | frm_driver.c | 4365 const Binding_Info *BI = (Binding_Info *)0; local 4401 BI = &(bindings[c - MIN_FORM_COMMAND]); 4404 if (BI) 4420 size_t method = (size_t)((BI->keycode >> ID_Shft) & 0xffff); /* see ID_Mask */ 4422 if ((method >= nMethods) || !(BI->cmd)) 4430 res = fct(BI->cmd, form); 4434 res = (BI->cmd) (form); 4571 const Binding_Info *BI = (Binding_Info *)0; local 4606 BI = &(bindings[c - MIN_FORM_COMMAND]); 4609 if (BI) [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | CodeGenPrepare.cpp | 889 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); local 890 if (!BI || !BI->isUnconditional()) 895 BasicBlock::iterator BBI = BI->getIterator(); 908 BasicBlock *DestBB = BI->getSuccessor(0); 1131 BranchInst *BI = cast<BranchInst>(BB->getTerminator()); local 1132 BasicBlock *DestBB = BI->getSuccessor(0); 1899 if (auto *BI = dyn_cast<BranchInst>(U)) { 1900 assert(BI->isConditional() && "Must be conditional"); 1901 BI 2603 const Instruction *BI = BB->getFirstNonPHI(); local 2645 BranchInst *BI = dyn_cast<BranchInst>(TailCallBB->getTerminator()); local [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCContract.cpp | 667 if (const BitCastInst *BI = dyn_cast<BitCastInst>(Arg)) 668 Arg = BI->getOperand(0);
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCMIPeephole.cpp | 1361 static bool isEqOrNe(MachineInstr *BI) { argument 1362 PPC::Predicate Pred = (PPC::Predicate)BI->getOperand(0).getImm(); 1394 static unsigned getPredicateToDecImm(MachineInstr *BI, MachineInstr *CMPI) { argument 1400 PPC::Predicate Pred = (PPC::Predicate)BI->getOperand(0).getImm(); 1413 static unsigned getPredicateToIncImm(MachineInstr *BI, MachineInstr *CMPI) { argument 1419 PPC::Predicate Pred = (PPC::Predicate)BI->getOperand(0).getImm(); 1544 MachineInstr *BI = &*MBB.getFirstInstrTerminator(); 1545 MachineInstr *CMPI = MRI->getVRegDef(BI->getOperand(1).getReg());
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorize.cpp | 2208 BranchInst &BI = *BranchInst::Create(Bypass, LoopVectorPreHeader, Cond); 2210 setBranchWeights(BI, SCEVCheckBypassWeights); 2211 ReplaceInstWithInst(SCEVCheckBlock->getTerminator(), &BI); 2235 BranchInst &BI = 2238 setBranchWeights(BI, MemCheckBypassWeights); 2240 ReplaceInstWithInst(MemCheckBlock->getTerminator(), &BI); 2952 BranchInst &BI = 2955 setBranchWeights(BI, MinItersBypassWeights); 2956 ReplaceInstWithInst(TCCheckBlock->getTerminator(), &BI); 3187 BranchInst &BI [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/IR/ |
H A D | Verifier.cpp | 560 void visitBranchInst(BranchInst &BI); 563 void visitIndirectBrInst(IndirectBrInst &BI); 2998 void Verifier::visitBranchInst(BranchInst &BI) { argument 2999 if (BI.isConditional()) { 3000 Check(BI.getCondition()->getType()->isIntegerTy(1), 3001 "Branch condition is not 'i1' type!", &BI, BI.getCondition()); 3003 visitTerminator(BI); 3043 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) { argument 3044 Check(BI [all...] |
H A D | Value.cpp | 241 BasicBlock::const_iterator BI = BB->begin(), BE = BB->end(); local 243 for (; BI != BE && UI != UE; ++BI, ++UI) { 244 // Scan basic block: Check if this Value is used by the instruction at BI. 245 if (is_contained(BI->operands(), this))
|
H A D | Instructions.cpp | 488 auto BI = Bundles.begin(); local 492 assert(BI != Bundles.end() && "Incorrect allocation?"); 494 BOI.Tag = ContextImpl->getOrInsertBundleTag(BI->getTag()); 496 BOI.End = CurrentIndex + BI->input_size(); 498 BI++; 501 assert(BI == Bundles.end() && "Incorrect allocation?"); 1264 BranchInst::BranchInst(const BranchInst &BI) argument 1265 : Instruction(Type::getVoidTy(BI.getContext()), Instruction::Br, 1266 OperandTraits<BranchInst>::op_end(this) - BI.getNumOperands(), 1267 BI [all...] |
/freebsd-current/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CGCleanup.cpp | 1106 llvm::BranchInst *BI = Builder.CreateBr(Dest.getBlock()); 1127 Fixup.InitialBranch = BI; 1138 createStoreInstBefore(Index, getNormalCleanupDestSlot(), BI); 1140 // Adjust BI to point to the first cleanup block. 1144 BI->setSuccessor(0, CreateNormalEntry(*this, Scope));
|
/freebsd-current/contrib/llvm-project/clang/lib/AST/ |
H A D | APValue.cpp | 896 CXXRecordDecl::base_class_const_iterator BI = CD->bases_begin(); local 897 for (unsigned I = 0; I != N; ++I, ++BI) { 898 assert(BI != CD->bases_end()); 901 getStructBase(I).printPretty(Out, Policy, BI->getType(), Ctx);
|
/freebsd-current/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | HTMLDiagnostics.cpp | 430 for (auto BI : *Buf) 431 os << BI; local 449 for (auto BI : *Buf) 450 os << BI; local
|
/freebsd-current/contrib/llvm-project/clang/lib/Analysis/ |
H A D | Consumed.cpp | 82 for (CFGBlock::const_reverse_iterator BI = Block->rbegin(), 83 BE = Block->rend(); BI != BE; ++BI) { 84 if (std::optional<CFGStmt> CS = BI->getAs<CFGStmt>())
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | Local.h | 197 bool FoldBranchToCommonDest(BranchInst *BI, llvm::DomTreeUpdater *DTU = nullptr,
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineCalls.cpp | 778 BasicBlock::reverse_iterator BI(EndI), BE(EndI.getParent()->rend()); 779 for (; BI != BE; ++BI) { 780 if (auto *I = dyn_cast<IntrinsicInst>(&*BI)) { 2719 BasicBlock::iterator BI(SS); 2721 for (++BI; &*BI != II; ++BI) { 2722 switch (Classify(&*BI)) { 2730 if (cast<IntrinsicInst>(*BI) [all...] |
H A D | InstCombinePHI.cpp | 1315 if (auto *BI = dyn_cast<BranchInst>(IDom->getTerminator())) { 1316 if (BI->isUnconditional()) 1319 Cond = BI->getCondition(); 1320 AddSucc(ConstantInt::getTrue(Context), BI->getSuccessor(0)); 1321 AddSucc(ConstantInt::getFalse(Context), BI->getSuccessor(1));
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonBitTracker.cpp | 985 bool HexagonEvaluator::evaluate(const MachineInstr &BI, 991 unsigned Opc = BI.getOpcode(); 1010 Targets.insert(BI.getOperand(0).getMBB()); 1022 // BI is a conditional branch if we got here. 1023 RegisterRef PR = BI.getOperand(0); 1038 Targets.insert(BI.getOperand(1).getMBB());
|