/freebsd-current/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | InstIterator.h | 39 BI_t BI; // BasicBlock::iterator member in class:llvm::InstIterator 54 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} 58 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} 63 BI = BB->begin(); 74 inline BIty &getInstructionIterator() { return BI; } 76 inline reference operator*() const { return *BI; } 80 return BB == y.BB && (BB == BBs->end() || BI == y.BI); [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AVR/ |
H A D | AVRShiftExpand.cpp | 36 void expand(BinaryOperator *BI); 77 void AVRShiftExpand::expand(BinaryOperator *BI) { argument 78 auto &Ctx = BI->getContext(); 79 IRBuilder<> Builder(BI); 80 Type *InputTy = cast<Instruction>(BI)->getType(); 86 BasicBlock *BB = BI->getParent(); 88 BasicBlock *EndBB = BB->splitBasicBlock(BI, "shift.done"); 94 Value *ShiftAmount = Builder.CreateTrunc(BI->getOperand(1), Int8Ty); 107 ValuePHI->addIncoming(BI->getOperand(0), BB); 119 switch (BI [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DomConditionCache.cpp | 58 void DomConditionCache::registerBranch(BranchInst *BI) { argument 59 assert(BI->isConditional() && "Must be conditional branch"); 61 findAffectedValues(BI->getCondition(), Affected); 64 if (!is_contained(AV, BI)) 65 AV.push_back(BI);
|
H A D | GuardUtils.cpp | 72 auto *BI = dyn_cast<BranchInst>(U); local 73 if (!BI || !BI->isConditional()) 75 auto *Cond = BI->getCondition(); 79 IfTrueBB = BI->getSuccessor(0); 80 IfFalseBB = BI->getSuccessor(1); 83 WC = &BI->getOperandUse(0); 152 auto *BI = dyn_cast<BranchInst>(U); local 153 if (!BI || !BI [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | InterferenceCache.cpp | 157 BlockInterference *BI = &Blocks[MBBNum]; local 161 BI->Tag = Tag; 162 BI->First = BI->Last = SlotIndex(); 172 if (!BI->First.isValid() || StartI < BI->First) 173 BI->First = StartI; 185 if (!BI->First.isValid() || StartI < BI->First) 186 BI [all...] |
H A D | SplitKit.cpp | 218 BlockInfo BI; local 219 BI.MBB = &*MFI; 221 std::tie(Start, Stop) = LIS.getSlotIndexes()->getMBBRange(BI.MBB); 228 ThroughBlocks.set(BI.MBB->getNumber()); 234 BI.FirstInstr = *UseI; 235 assert(BI.FirstInstr >= Start); 238 BI.LastInstr = UseI[-1]; 239 assert(BI.LastInstr < Stop); 242 BI.LiveIn = LVI->start <= Start; 245 if (!BI [all...] |
H A D | InterleavedAccessPass.cpp | 296 if (auto *BI = dyn_cast<BinaryOperator>(User)) { 297 if (!BI->user_empty() && all_of(BI->users(), [](auto *U) { 301 for (auto *SVI : BI->users()) 384 BinaryOperator *BI = cast<BinaryOperator>(SVI->getOperand(0)); local 385 Type *BIOp0Ty = BI->getOperand(0)->getType(); 392 new ShuffleVectorInst(BI->getOperand(0), PoisonValue::get(BIOp0Ty), 395 BI->getOperand(1), PoisonValue::get(BI->getOperand(1)->getType()), Mask, 398 BI [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
H A D | NVPTXAllocaHoisting.cpp | 46 for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE;) { 47 AllocaInst *allocaInst = dyn_cast<AllocaInst>(BI++);
|
H A D | NVPTXLowerAlloca.cpp | 104 auto BI = dyn_cast<BitCastInst>(AllocaUse.getUser()); local 105 if (BI && BI->getOperand(0) == allocaInst) { 106 BI->setOperand(0, NewASCToGeneric);
|
H A D | NVPTXImageOptimizer.cpp | 151 if (BranchInst *BI = dyn_cast<BranchInst>(U)) { 152 if (BI->isUnconditional()) continue; 156 Dest = BI->getSuccessor(1); 159 Dest = BI->getSuccessor(0); 160 BranchInst::Create(Dest, BI); 161 InstrToDelete.push_back(BI);
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCCTRLoopsVerify.cpp | 97 MachineBasicBlock::iterator BI = I; local 121 if (I != BI && clobbersCTR(*I)) { 125 << printMBBReference(*BI->getParent()) << " (" 126 << BI->getParent()->getFullName() << ") instruction " 127 << *BI << "\n"); 142 << printMBBReference(*BI->getParent()) << " (" 143 << BI->getParent()->getFullName() << ") instruction " 144 << *BI << "\n");
|
/freebsd-current/contrib/llvm-project/clang/include/clang/Basic/ |
H A D | TargetBuiltins.h | 29 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 30 #define TARGET_BUILTIN(ID, TYPE, ATTRS, FEATURE) BI##ID, 41 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 50 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 51 #define TARGET_BUILTIN(ID, TYPE, ATTRS, FEATURE) BI##ID, 60 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 61 #define TARGET_BUILTIN(ID, TYPE, ATTRS, FEATURE) BI##ID, 76 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 86 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 96 #define BUILTIN(ID, TYPE, ATTRS) BI##I [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LowerConstantIntrinsics.cpp | 68 BranchInst *BI = dyn_cast_or_null<BranchInst>(VH); local 69 if (!BI) 71 if (BI->isUnconditional()) 75 if (match(BI->getOperand(0), m_Zero())) { 76 Target = BI->getSuccessor(1); 77 Other = BI->getSuccessor(0); 78 } else if (match(BI->getOperand(0), m_One())) { 79 Target = BI->getSuccessor(0); 80 Other = BI->getSuccessor(1); 86 BasicBlock *Source = BI [all...] |
H A D | LowerExpectIntrinsic.cpp | 198 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); 199 if (BI && BI->isConditional()) 200 return BI; 204 BI = dyn_cast<BranchInst>(BB->getTerminator()); 205 if (!BI || BI->isUnconditional()) 207 return BI; 229 BranchInst *BI = GetDomConditional(i); local 230 if (!BI) 355 handleBranchExpect(BranchInst &BI) argument [all...] |
H A D | LoopBoundSplit.cpp | 31 BranchInst *BI = nullptr; member in struct:llvm::__anon2919::ConditionInfo 160 const BranchInst *BI) { 165 if (!match(BI, m_Br(m_ICmp(Pred, m_Value(LHS), m_Value(RHS)), 219 Cond.BI = ExitingBI; 223 static bool isProfitableToTransform(const Loop &L, const BranchInst *BI) { argument 230 BasicBlock *Succ0 = BI->getSuccessor(0); 231 BasicBlock *Succ1 = BI->getSuccessor(1); 251 auto *BI = dyn_cast<BranchInst>(BB->getTerminator()); local 252 if (!BI) 256 if (!isProcessableCondBI(SE, BI)) 159 isProcessableCondBI(const ScalarEvolution &SE, const BranchInst *BI) argument [all...] |
H A D | LoopPredication.cpp | 759 BranchInst *BI, SCEVExpander &Expander) { 760 assert(isGuardAsWidenableBranch(BI) && "Must be!"); 762 LLVM_DEBUG(BI->dump()); 767 parseWidenableGuard(BI, Checks); 770 auto WC = extractWidenableCondition(BI); 772 widenChecks(Checks, WidenedChecks, Expander, BI); 779 IRBuilder<> Builder(findInsertPt(BI, Checks)); 781 auto *OldCond = BI->getCondition(); 782 BI->setCondition(AllChecks); 784 BasicBlock *IfTrueBB = BI 758 widenWidenableBranchGuardConditions( BranchInst *BI, SCEVExpander &Expander) argument 817 auto *BI = dyn_cast<BranchInst>(LoopLatch->getTerminator()); local 1080 auto *BI = dyn_cast<BranchInst>(ExitingBB->getTerminator()); local 1125 auto *BI = dyn_cast<BranchInst>(ExitingBB->getTerminator()); local [all...] |
H A D | IndVarSimplify.cpp | 457 if (auto *BI = dyn_cast<BranchInst>(TermInst)) { 460 Cond = BI->getCondition(); 691 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); local 692 ICmpInst *ICmp = dyn_cast<ICmpInst>(BI->getCondition()); 710 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); local 711 if (L->isLoopInvariant(BI->getCondition())) 715 ICmpInst *Cond = dyn_cast<ICmpInst>(BI->getCondition()); 996 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); local 998 if (L->contains(BI->getSuccessor(0))) 1003 IRBuilder<> Builder(BI); 1169 replaceExitCond(BranchInst *BI, Value *NewCond, SmallVectorImpl<WeakTrackingVH> &DeadInsts) argument 1181 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); local 1190 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); local 1247 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); local 1261 auto *BI = cast<BranchInst>(ExitingBB->getTerminator()); local 1310 optimizeLoopExitWithUnknownExitCount( const Loop *L, BranchInst *BI, BasicBlock *ExitingBB, const SCEV *MaxIter, bool SkipLastIter, ScalarEvolution *SE, SCEVExpander &Rewriter, SmallVectorImpl<WeakTrackingVH> &DeadInsts) argument 1428 auto *BI = dyn_cast<BranchInst>(ExitingBB->getTerminator()); local 1474 auto *BI = dyn_cast<BranchInst>(ExitingBB->getTerminator()); local 1634 auto *BI = cast<BranchInst>(ExitingBB->getTerminator()); local 1852 auto *BI = cast<BranchInst>(ExitingBB->getTerminator()); local [all...] |
/freebsd-current/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | InfoByHwMode.h | 47 auto BI = B.begin(); local 55 if (BI != B.end() && BI->first == DefaultMode) { 57 ++BI; 62 if (BI == B.end()) { 68 if (BI->first < AI->first) { 69 Modes.push_back(BI->first); 70 ++BI; 73 if (AI->first == BI->first) 74 ++BI; [all...] |
H A D | CodeEmitterGen.cpp | 58 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit); 64 bool addCodeToMergeInOperand(Record *R, BitsInit *BI, 82 BitsInit *BI, int bit) { 83 if (VarBitInit *VBI = dyn_cast<VarBitInit>(BI->getBit(bit))) { 87 } else if (VarInit *VI = dyn_cast<VarInit>(BI->getBit(bit))) { 96 bool CodeEmitterGen::addCodeToMergeInOperand(Record *R, BitsInit *BI, argument 104 int bit = BI->getNumBits()-1; 108 if (getVariableBit(VarName, BI, bit) != -1) 173 int varBit = getVariableBit(VarName, BI, tmpBit); 186 varBit = getVariableBit(VarName, BI, tmpBi 81 getVariableBit(const std::string &VarName, BitsInit *BI, int bit) argument 308 BitsInit *BI = EncodingDef->getValueAsBitsInit("Inst"); local 383 BitsInit *BI = EncodingDef->getValueAsBitsInit("Inst"); local 450 BitsInit *BI = KV.second->getValueAsBitsInit("Inst"); local 457 BitsInit *BI = R->getValueAsBitsInit("Inst"); local [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | FlattenCFG.cpp | 188 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI->getIterator(); 189 BI != BE;) { 190 Instruction *CI = &*BI++; 252 auto *BI = cast<BranchInst>(CurrBlock->getTerminator()); local 253 auto *CI = dyn_cast<CmpInst>(BI->getCondition()); 261 BI->swapSuccessors(); 357 for (BasicBlock::iterator BI(PBI2), BE(PTI2); BI != BE; ++BI) { 358 if (BI [all...] |
H A D | SimplifyCFG.cpp | 267 bool simplifyUncondBranch(BranchInst *BI, IRBuilder<> &Builder); 268 bool simplifyCondBranch(BranchInst *BI, IRBuilder<> &Builder); 277 bool SpeculativelyExecuteBB(BranchInst *BI, BasicBlock *ThenBB); 281 bool SimplifyBranchOnICmpChain(BranchInst *BI, IRBuilder<> &Builder, 440 BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator()); 441 if (!BI || BI->isConditional() || BI->getSuccessor(0) != BB) 760 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { 761 if (BI [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | DomConditionCache.h | 39 void registerBranch(BranchInst *BI);
|
/freebsd-current/contrib/llvm-project/clang/utils/TableGen/ |
H A D | ClangSACheckersEmitter.cpp | 78 const BitsInit *BI = R.getValueAsBitsInit("Documentation"); local 79 if (!BI) 84 if (getValueFromBitsInit(BI, R) == 0) 97 if (BitsInit *BI = R.getValueAsBitsInit("Type")) { 98 switch(getValueFromBitsInit(BI, R)) { 114 if (BitsInit *BI = R.getValueAsBitsInit("DevelopmentStage")) { 115 switch(getValueFromBitsInit(BI, R)) {
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/BPF/ |
H A D | BPFAdjustOpt.cpp | 222 auto *BI = dyn_cast<BranchInst>(TI); local 223 if (!BI || !BI->isConditional()) 225 auto *Cond = dyn_cast<ICmpInst>(BI->getCondition()); 232 BI = dyn_cast<BranchInst>(TI); 233 if (!BI || !BI->isConditional()) 235 Cond = dyn_cast<ICmpInst>(BI->getCondition()); 260 PassThroughInfo Info(Cond, BI, 0);
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | R600Packetizer.cpp | 69 MachineBasicBlock::instr_iterator BI = I.getInstrIterator(); 71 BI++; 75 int BISlot = getSlot(*BI); 79 if (TII->isPredicated(*BI)) 81 int OperandIdx = TII->getOperandIdx(BI->getOpcode(), R600::OpName::write); 82 if (OperandIdx > -1 && BI->getOperand(OperandIdx).getImm() == 0) 84 int DstIdx = TII->getOperandIdx(BI->getOpcode(), R600::OpName::dst); 88 Register Dst = BI->getOperand(DstIdx).getReg(); 89 if (isTrans || TII->isTransOnly(*BI)) { 93 if (BI [all...] |