/freebsd-12-stable/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-12-stable/contrib/llvm-project/clang/include/clang/Basic/ |
H A D | TargetBuiltins.h | 27 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 38 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 49 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 59 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 69 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 79 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 89 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 99 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 103 #define BUILTIN(ID, TYPE, ATTRS) BI##ID, 156 #define BUILTIN(ID, TYPE, ATTRS) BI##I [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | InterferenceCache.cpp | 160 BlockInterference *BI = &Blocks[MBBNum]; local 164 BI->Tag = Tag; 165 BI->First = BI->Last = SlotIndex(); 175 if (!BI->First.isValid() || StartI < BI->First) 176 BI->First = StartI; 188 if (!BI->First.isValid() || StartI < BI->First) 189 BI [all...] |
H A D | SplitKit.cpp | 228 BlockInfo BI; local 229 BI.MBB = &*MFI; 231 std::tie(Start, Stop) = LIS.getSlotIndexes()->getMBBRange(BI.MBB); 238 ThroughBlocks.set(BI.MBB->getNumber()); 245 BI.FirstInstr = *UseI; 246 assert(BI.FirstInstr >= Start); 249 BI.LastInstr = UseI[-1]; 250 assert(BI.LastInstr < Stop); 253 BI.LiveIn = LVI->start <= Start; 256 if (!BI 1556 shouldSplitSingleBlock(const BlockInfo &BI, bool SingleInstrs) const argument 1574 splitSingleBlock(const SplitAnalysis::BlockInfo &BI) argument 1703 splitRegInBlock(const SplitAnalysis::BlockInfo &BI, unsigned IntvIn, SlotIndex LeaveBefore) argument 1796 splitRegOutBlock(const SplitAnalysis::BlockInfo &BI, unsigned IntvOut, SlotIndex EnterAfter) argument [all...] |
/freebsd-12-stable/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 | NVPTXImageOptimizer.cpp | 60 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; 61 ++BI) { 62 for (BasicBlock::iterator I = (*BI).begin(), E = (*BI).end(); 153 if (BranchInst *BI = dyn_cast<BranchInst>(*UI)) { 154 if (BI->isUnconditional()) continue; 158 Dest = BI->getSuccessor(1); 161 Dest = BI->getSuccessor(0); 162 BranchInst::Create(Dest, BI); [all...] |
H A D | NVPTXLowerAlloca.cpp | 107 auto BI = dyn_cast<BitCastInst>(AllocaUse.getUser()); local 108 if (BI && BI->getOperand(0) == allocaInst) { 109 BI->setOperand(0, NewASCToGeneric);
|
H A D | NVPTXLowerAggrCopies.cpp | 69 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; ++BI) { 70 for (BasicBlock::iterator II = BI->begin(), IE = BI->end(); II != IE;
|
H A D | NVPTXReplaceImageHandles.cpp | 59 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end(); BI != BE; 60 ++BI) { 61 for (MachineBasicBlock::iterator I = (*BI).begin(), E = (*BI).end();
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LowerExpectIntrinsic.cpp | 171 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); 172 if (BI && BI->isConditional()) 173 return BI; 177 BI = dyn_cast<BranchInst>(BB->getTerminator()); 178 if (!BI || BI->isUnconditional()) 180 return BI; 199 BranchInst *BI = GetDomConditional(i); local 200 if (!BI) 315 handleBranchExpect(BranchInst &BI) argument [all...] |
H A D | LowerConstantIntrinsics.cpp | 57 BranchInst *BI = dyn_cast<BranchInst>(I); local 58 if (!BI) 60 if (BI->isUnconditional()) 64 if (match(BI->getOperand(0), m_Zero())) { 65 Target = BI->getSuccessor(1); 66 Other = BI->getSuccessor(0); 67 } else if (match(BI->getOperand(0), m_One())) { 68 Target = BI->getSuccessor(0); 69 Other = BI->getSuccessor(1); 75 BasicBlock *Source = BI [all...] |
H A D | SimpleLoopUnswitch.cpp | 365 static bool unswitchTrivialBranch(Loop &L, BranchInst &BI, DominatorTree &DT, argument 368 assert(BI.isConditional() && "Can only unswitch a conditional branch!"); 369 LLVM_DEBUG(dbgs() << " Trying to unswitch branch: " << BI << "\n"); 378 if (L.isLoopInvariant(BI.getCondition())) { 379 Invariants.push_back(BI.getCondition()); 382 if (auto *CondInst = dyn_cast<Instruction>(BI.getCondition())) 392 auto *LoopExitBB = BI.getSuccessor(0); 396 LoopExitBB = BI.getSuccessor(1); 400 auto *ContinueBB = BI.getSuccessor(1 - LoopExitSuccIdx); 401 auto *ParentBB = BI 919 auto *BI = dyn_cast<BranchInst>(CurrentBB->getTerminator()); local 927 auto *BI = dyn_cast<BranchInst>(CurrentTerm); local 1924 BranchInst *BI = dyn_cast<BranchInst>(&TI); local 2581 auto *BI = dyn_cast<BranchInst>(BB->getTerminator()); local 2749 BranchInst *BI = dyn_cast<BranchInst>(&TI); local [all...] |
H A D | LoopPredication.cpp | 817 BranchInst *BI, SCEVExpander &Expander) { 818 assert(isGuardAsWidenableBranch(BI) && "Must be!"); 820 LLVM_DEBUG(BI->dump()); 824 unsigned NumWidened = collectChecks(Checks, BI->getCondition(), 825 Expander, BI); 832 IRBuilder<> Builder(findInsertPt(BI, Checks)); 834 auto *OldCond = BI->getCondition(); 835 BI->setCondition(AllChecks); 837 assert(isGuardAsWidenableBranch(BI) && 853 auto *BI local 816 widenWidenableBranchGuardConditions( BranchInst *BI, SCEVExpander &Expander) argument 1090 auto *BI = dyn_cast<BranchInst>(ExitingBB->getTerminator()); local 1137 auto *BI = dyn_cast<BranchInst>(ExitingBB->getTerminator()); local [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | GuardUtils.cpp | 63 auto *BI = dyn_cast<BranchInst>(U); local 64 if (!BI || !BI->isConditional()) 66 auto *Cond = BI->getCondition(); 70 IfTrueBB = BI->getSuccessor(0); 71 IfFalseBB = BI->getSuccessor(1); 74 WC = &BI->getOperandUse(0);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCCTRLoops.cpp | 130 MachineBasicBlock::iterator BI = I; local 154 if (I != BI && clobbersCTR(*I)) { 158 << printMBBReference(*BI->getParent()) << " (" 159 << BI->getParent()->getFullName() << ") instruction " 160 << *BI << "\n"); 175 << printMBBReference(*BI->getParent()) << " (" 176 << BI->getParent()->getFullName() << ") instruction " 177 << *BI << "\n");
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | FlattenCFG.cpp | 190 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI->getIterator(); 191 BI != BE;) { 192 Instruction *CI = &*BI++; 254 auto *BI = cast<BranchInst>(CurrBlock->getTerminator()); local 255 auto *CI = dyn_cast<CmpInst>(BI->getCondition()); 263 BI->swapSuccessors(); 369 for (BasicBlock::iterator BI(PBI2), BE(PTI2); BI != BE; ++BI) { 370 if (BI [all...] |
H A D | SimplifyCFG.cpp | 203 bool SimplifyUncondBranch(BranchInst *BI, IRBuilder<> &Builder); 204 bool SimplifyCondBranch(BranchInst *BI, IRBuilder<> &Builder); 371 BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator()); 372 if (!BI || BI->isConditional() || BI->getSuccessor(0) != BB) 686 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { 687 if (BI->isConditional()) 688 Cond = dyn_cast<Instruction>(BI->getCondition()); 707 } else if (BranchInst *BI 737 BranchInst *BI = cast<BranchInst>(TI); local 1238 HoistThenElseCodeToIf(BranchInst *BI, const TargetTransformInfo &TTI) argument 1962 SpeculativelyExecuteBB(BranchInst *BI, BasicBlock *ThenBB, const TargetTransformInfo &TTI) argument 2180 FoldCondBranchOnPHI(BranchInst *BI, const DataLayout &DL, AssumptionCache *AC) argument 2456 SimplifyCondBranchToTwoReturns(BranchInst *BI, IRBuilder<> &Builder) argument 2561 extractPredSuccWeights(BranchInst *PBI, BranchInst *BI, uint64_t &PredTrueWeight, uint64_t &PredFalseWeight, uint64_t &SuccTrueWeight, uint64_t &SuccFalseWeight) argument 2584 FoldBranchToCommonDest(BranchInst *BI, MemorySSAUpdater *MSSAU, unsigned BonusInstThreshold) argument 3230 tryWidenCondBranchToCondBranch(BranchInst *PBI, BranchInst *BI) argument 3271 SimplifyCondBranchToCondBranch(BranchInst *PBI, BranchInst *BI, const DataLayout &DL, const TargetTransformInfo &TTI) argument 3750 SimplifyBranchOnICmpChain(BranchInst *BI, IRBuilder<> &Builder, const DataLayout &DL) argument 4209 BranchInst *BI = CondBranchPreds.pop_back_val(); local 5801 TryToMergeLandingPad(LandingPadInst *LPad, BranchInst *BI, BasicBlock *BB) argument 5857 SimplifyUncondBranch(BranchInst *BI, IRBuilder<> &Builder) argument 5918 SimplifyCondBranch(BranchInst *BI, IRBuilder<> &Builder) argument [all...] |
H A D | CloneFunction.cpp | 164 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end(); 165 BI != BE; ++BI) { 166 const BasicBlock &BB = *BI; 385 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) { 386 if (BI->isConditional()) { 388 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition()); 391 Value *V = VMap.lookup(BI->getCondition()); 397 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue()); 493 for (const BasicBlock &BI 680 BranchInst *BI = dyn_cast<BranchInst>(I->getTerminator()); local 844 BasicBlock::iterator BI = BB->begin(); local [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | CodeEmitterGen.cpp | 47 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit); 51 void AddCodeToMergeInOperand(Record *R, BitsInit *BI, 67 BitsInit *BI, int bit) { 68 if (VarBitInit *VBI = dyn_cast<VarBitInit>(BI->getBit(bit))) { 72 } else if (VarInit *VI = dyn_cast<VarInit>(BI->getBit(bit))) { 81 AddCodeToMergeInOperand(Record *R, BitsInit *BI, const std::string &VarName, argument 88 int bit = BI->getNumBits()-1; 92 if (getVariableBit(VarName, BI, bit) != -1) 174 int varBit = getVariableBit(VarName, BI, tmpBit); 187 varBit = getVariableBit(VarName, BI, tmpBi 66 getVariableBit(const std::string &VarName, BitsInit *BI, int bit) argument 291 BitsInit *BI = EncodingDef->getValueAsBitsInit("Inst"); local 374 BitsInit *BI = EncodingDef->getValueAsBitsInit("Inst"); local 413 BitsInit *BI = KV.second->getValueAsBitsInit("Inst"); local 420 BitsInit *BI = R->getValueAsBitsInit("Inst"); local [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | R600Packetizer.cpp | 74 MachineBasicBlock::instr_iterator BI = I.getInstrIterator(); 76 BI++; 80 int BISlot = getSlot(*BI); 84 if (TII->isPredicated(*BI)) 86 int OperandIdx = TII->getOperandIdx(BI->getOpcode(), R600::OpName::write); 87 if (OperandIdx > -1 && BI->getOperand(OperandIdx).getImm() == 0) 89 int DstIdx = TII->getOperandIdx(BI->getOpcode(), R600::OpName::dst); 93 Register Dst = BI->getOperand(DstIdx).getReg(); 94 if (isTrans || TII->isTransOnly(*BI)) { 98 if (BI [all...] |
H A D | SIAddIMGInit.cpp | 69 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end(); BI != BE; 70 ++BI) { 71 MachineBasicBlock &MBB = *BI;
|
H A D | SIWholeQuadMode.cpp | 324 for (auto BI = RPOT.begin(), BE = RPOT.end(); BI != BE; ++BI) { 325 MachineBasicBlock &MBB = **BI; 432 BlockInfo &BI = Blocks[MBB]; local 444 BI.Needs |= StateWQM; 445 if (!(BI.InNeeds & StateWQM)) { 446 BI.InNeeds |= StateWQM; 472 BI.Needs |= StateWWM; 477 BlockInfo BI local 698 const BlockInfo &BI = BII->second; local [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/tools/llvm-xray/ |
H A D | xray-fdr-dump.cpp | 94 BlockIndexer BI(Index); 96 if (auto E = Ptr->apply(BI)) 99 if (auto E = BI.flush())
|
/freebsd-12-stable/contrib/llvm-project/clang/utils/TableGen/ |
H A D | ClangSACheckersEmitter.cpp | 78 if (BitsInit *BI = R.getValueAsBitsInit("Documentation")) { 79 uint64_t V = getValueFromBitsInit(BI, R); 98 if (BitsInit *BI = R.getValueAsBitsInit("Type")) { 99 switch(getValueFromBitsInit(BI, R)) { 115 if (BitsInit *BI = R.getValueAsBitsInit("DevelopmentStage")) { 116 switch(getValueFromBitsInit(BI, R)) {
|
/freebsd-12-stable/contrib/llvm-project/llvm/tools/llvm-diff/ |
H A D | DiffConsumer.cpp | 35 for (BasicBlock::iterator BI = FI->begin(), BE = FI->end(); BI != BE; ++BI) 37 if (!BI->hasName() && !BI->getType()->isVoidTy()) 38 Numbering[&*BI] = IN++;
|