/freebsd-12-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | SafepointIRVerifier.cpp | 142 const BranchInst *BI = dyn_cast<BranchInst>(TI); local 143 if (!BI || !BI->isConditional() || !isa<Constant>(BI->getCondition())) 147 if (BI->getSuccessor(0) == BI->getSuccessor(1)) 150 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition()); 154 addDeadEdge(BI->getOperandUse(Cond->getZExtValue() ? 1 : 2));
|
H A D | BasicBlock.cpp | 166 if (auto *BI = dyn_cast<BitCastInst>(Prev)) { 167 RV = BI->getOperand(0); 168 Prev = BI->getPrevNode(); 429 BranchInst *BI = BranchInst::Create(New, this); local 430 BI->setDebugLoc(Loc);
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | CFGPrinter.h | 130 if (const BranchInst *BI = dyn_cast<BranchInst>(Node->getTerminator())) 131 if (BI->isConditional())
|
H A D | SparsePropagation.h | 293 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) { 294 if (BI->isUnconditional()) { 302 getValueState(KeyInfo::getLatticeKeyFromValue(BI->getCondition())); 305 KeyInfo::getLatticeKeyFromValue(BI->getCondition())); 320 std::move(BCValue), BI->getCondition()->getType()));
|
H A D | LoopInfoImpl.h | 290 BI = df_ext_begin(getHeader(), VisitSet), local 297 for (; BI != BE; ++BI) { 298 BlockT *BB = *BI; 349 for (block_iterator BI = (*I)->block_begin(), BE = (*I)->block_end(); 350 BI != BE; ++BI) { 351 assert(contains(*BI) &&
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | JumpThreading.h | 115 DenseMap<Instruction *, Value *> CloneInstructions(BasicBlock::iterator BI, 159 bool ThreadGuard(BasicBlock *BB, IntrinsicInst *Guard, BranchInst *BI);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIInsertSkips.cpp | 445 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end(); 446 BI != BE; BI = NextBB) { 447 NextBB = std::next(BI); 448 MachineBasicBlock &MBB = *BI; 495 NextBB = std::next(BI); 511 if (BI != --MF.end() || I != MBB.getFirstTerminator()) { 520 BuildMI(*BI, I, MI.getDebugLoc(), TII->get(AMDGPU::S_BRANCH))
|
H A D | R600ControlFlowFinalizer.cpp | 425 MachineBasicBlock::instr_iterator BI = I.getInstrIterator(); local 426 while (++BI != E && BI->isBundledWithPred()) { 427 BI->unbundleFromPred(); 428 for (MachineOperand &MO : BI->operands()) { 432 getLiteral(*BI, Literals); 433 ClauseContent.push_back(&*BI); 435 I = BI;
|
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
H A D | Consumed.h | 217 for (const auto BI : *SortedGraph) 218 VisitOrder[BI->getBlockID()] = VisitOrderCounter++;
|
H A D | ThreadSafetyCommon.h | 204 for (const auto &BI : *CurrBlock) { 205 switch (BI.getKind()) { 207 V.handleStatement(BI.castAs<CFGStmt>().getStmt()); 211 CFGAutomaticObjDtor AD = BI.castAs<CFGAutomaticObjDtor>();
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopSimplifyCFG.cpp | 60 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { 61 if (BI->isUnconditional()) 63 if (BI->getSuccessor(0) == BI->getSuccessor(1)) 64 return BI->getSuccessor(0); 65 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition()); 68 return Cond->isZero() ? BI->getSuccessor(1) : BI->getSuccessor(0);
|
H A D | TailRecursionElimination.cpp | 576 BranchInst *BI = BranchInst::Create(OldEntry, NewEntry); 577 BI->setDebugLoc(CI->getDebugLoc()); 706 if (BranchInst *BI = dyn_cast<BranchInst>(PTI)) 707 if (BI->isUnconditional()) 708 UncondBranchPreds.push_back(BI); 712 BranchInst *BI = UncondBranchPreds.pop_back_val(); 713 BasicBlock *Pred = BI->getParent(); 714 if (CallInst *CI = findTRECandidate(BI, CannotTailCallElimCallsMarkedTail, TTI)){
|
H A D | GVN.cpp | 2014 if (BranchInst *BI = dyn_cast<BranchInst>(I)) { 2015 if (!BI->isConditional()) 2018 if (isa<Constant>(BI->getCondition())) 2019 return processFoldableCondBr(BI); 2021 Value *BranchCond = BI->getCondition(); 2022 BasicBlock *TrueSucc = BI->getSuccessor(0); 2023 BasicBlock *FalseSucc = BI->getSuccessor(1); 2028 BasicBlock *Parent = BI->getParent(); 2177 // (and incrementing BI before processing an instruction). 2187 for (BasicBlock::iterator BI 2644 processFoldableCondBr(BranchInst *BI) argument [all...] |
H A D | EarlyCSE.cpp | 736 bool handleBranchCondition(Instruction *CondInst, const BranchInst *BI, 850 const BranchInst *BI, const BasicBlock *BB, 852 assert(BI->isConditional() && "Should be a conditional branch!"); 853 assert(BI->getCondition() == CondInst && "Wrong condition?"); 854 assert(BI->getSuccessor(0) == BB || BI->getSuccessor(1) == BB); 855 auto *TorF = (BI->getSuccessor(0) == BB) 867 (BI->getSuccessor(0) == BB) ? Instruction::And : Instruction::Or; 921 auto *BI = dyn_cast<BranchInst>(Pred->getTerminator()); local 922 if (BI 849 handleBranchCondition(Instruction *CondInst, const BranchInst *BI, const BasicBlock *BB, const BasicBlock *Pred) argument [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LoopUnrollPeel.cpp | 178 auto *BI = dyn_cast<BranchInst>(BB->getTerminator()); 179 if (!BI || BI->isUnconditional()) 186 Value *Condition = BI->getCondition(); 333 for (auto BI = L->getHeader()->begin(); isa<PHINode>(&*BI); ++BI) { 334 PHINode *Phi = cast<PHINode>(&*BI);
|
H A D | Local.cpp | 116 if (auto *BI = dyn_cast<BranchInst>(T)) { 117 if (BI->isUnconditional()) return false; // Can't optimize uncond branch 118 BasicBlock *Dest1 = BI->getSuccessor(0); 119 BasicBlock *Dest2 = BI->getSuccessor(1); 121 if (auto *Cond = dyn_cast<ConstantInt>(BI->getCondition())) { 133 BI->eraseFromParent(); 145 assert(BI->getParent() && "Terminator not inserted in block!"); 146 Dest1->removePredecessor(BI->getParent()); 150 Value *Cond = BI->getCondition(); 151 BI [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | LegacyDivergenceAnalysis.cpp | 400 for (auto BI = F->begin(), BE = F->end(); BI != BE; ++BI) { 401 auto &BB = *BI;
|
H A D | InlineCost.cpp | 330 bool visitBranchInst(BranchInst &BI); 1561 bool CallAnalyzer::visitBranchInst(BranchInst &BI) { argument 1566 return BI.isUnconditional() || isa<ConstantInt>(BI.getCondition()) || 1568 SimplifiedValues.lookup(BI.getCondition())); 1998 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { 1999 if (BI->isConditional()) { 2000 Value *Cond = BI->getCondition(); 2003 BasicBlock *NextBB = BI->getSuccessor(SimpleCond->isZero() ? 1 : 0); 2195 for (Function::iterator BI [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonBitTracker.h | 36 bool evaluate(const MachineInstr &BI, const CellMapType &Inputs,
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | CFGMST.h | 238 for (auto &BI : BBInfos) { 239 const BasicBlock *BB = BI.first; 241 << BI.second->infoString() << "\n";
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/DebugInfo/MSF/ |
H A D | MSFBuilder.cpp | 322 uint32_t BI = 0; local 324 while (BI < Layout.SB->NumBlocks) { 328 (BI < Layout.SB->NumBlocks) ? Layout.FreePageMap.test(BI) : true; 331 ++BI;
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64StackTagging.cpp | 339 BasicBlock::iterator BI(StartInst); 342 for (; Count < ClScanLimit && !BI->isTerminator(); ++BI) { 343 if (!isa<DbgInfoIntrinsic>(*BI)) 346 if (isNoModRef(AA->getModRefInfo(&*BI, AllocaLoc))) 349 if (!isa<StoreInst>(BI) && !isa<MemSetInst>(BI)) { 353 if (BI->mayWriteToMemory() || BI->mayReadFromMemory()) 358 if (StoreInst *NextStore = dyn_cast<StoreInst>(BI)) { [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Bitstream/ |
H A D | BitstreamReader.h | 67 if (const BlockInfo *BI = getBlockInfo(BlockID)) 68 return *const_cast<BlockInfo*>(BI); 553 void setBlockInfo(BitstreamBlockInfo *BI) { BlockInfo = BI; } argument
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | BasicBlockUtils.h | 101 /// Replace all uses of an instruction (specified by BI) with a value, then 104 BasicBlock::iterator &BI, Value *V); 106 /// Replace the instruction specified by BI with the instruction specified by I. 107 /// Copies DebugLoc from BI to I, if I doesn't already have a DebugLoc. The 108 /// original instruction is deleted and BI is updated to point to the new 111 BasicBlock::iterator &BI, Instruction *I); 114 /// To. Copies DebugLoc from BI to I, if I doesn't already have a DebugLoc.
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | CrossDSOCFI.cpp | 152 BranchInst *BI = IRBTest.CreateCondBr(Test, ExitBB, TrapBB); local 153 BI->setMetadata(LLVMContext::MD_prof, VeryLikelyWeights);
|