Searched refs:BI (Results 1 - 25 of 132) sorted by relevance

123456

/freebsd-10.0-release/contrib/llvm/lib/Target/NVPTX/
H A DNVPTXAllocaHoisting.cpp27 for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE;) {
28 AllocaInst *allocaInst = dyn_cast<AllocaInst>(BI++);
H A DNVPTXSplitBBatBar.cpp34 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; ++BI) {
35 BasicBlock::iterator IB = BI->begin();
37 BasicBlock::iterator IE = BI->end();
/freebsd-10.0-release/contrib/llvm/include/llvm/Support/
H A DInstIterator.h38 _BI_t BI; // BasicBlock::iterator member in class:llvm::InstIterator
52 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
56 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
61 BI = BB->begin();
72 inline BIty &getInstructionIterator() { return BI; }
74 inline reference operator*() const { return *BI; }
78 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
[all...]
/freebsd-10.0-release/gnu/usr.bin/groff/font/devhtml/
H A DMakefile4 FONTS= R I B BI CR CI CB CBI S
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Basic/
H A DTargetBuiltins.h28 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
37 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
47 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
57 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
68 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
118 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
128 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DInterferenceCache.cpp130 BlockInterference *BI = &Blocks[MBBNum]; local
134 BI->Tag = Tag;
135 BI->First = BI->Last = SlotIndex();
145 if (!BI->First.isValid() || StartI < BI->First)
146 BI->First = StartI;
158 if (!BI->First.isValid() || StartI < BI->First)
159 BI
[all...]
H A DSplitKit.cpp188 BlockInfo BI; local
189 BI.MBB = MFI;
191 tie(Start, Stop) = LIS.getSlotIndexes()->getMBBRange(BI.MBB);
198 ThroughBlocks.set(BI.MBB->getNumber());
205 BI.FirstInstr = *UseI;
206 assert(BI.FirstInstr >= Start);
209 BI.LastInstr = UseI[-1];
210 assert(BI.LastInstr < Stop);
213 BI.LiveIn = LVI->start <= Start;
216 if (!BI
1132 shouldSplitSingleBlock(const BlockInfo &BI, bool SingleInstrs) const argument
1150 splitSingleBlock(const SplitAnalysis::BlockInfo &BI) argument
1281 splitRegInBlock(const SplitAnalysis::BlockInfo &BI, unsigned IntvIn, SlotIndex LeaveBefore) argument
1373 splitRegOutBlock(const SplitAnalysis::BlockInfo &BI, unsigned IntvOut, SlotIndex EnterAfter) argument
[all...]
H A DMachineBlockPlacement.cpp138 for (BlockChain::iterator BI = Chain->begin(), BE = Chain->end();
139 BI != BE; ++BI) {
140 Blocks.push_back(*BI);
141 assert(BlockToChain[*BI] == Chain && "Incoming blocks not in chain");
142 BlockToChain[*BI] = this;
814 for (MachineLoop::block_iterator BI = L.block_begin(),
816 BI != BE; ++BI) {
817 BlockChain &Chain = *BlockToChain[*BI];
[all...]
H A DRegAllocGreedy.cpp709 const SplitAnalysis::BlockInfo &BI = UseBlocks[i]; local
712 BC.Number = BI.MBB->getNumber();
714 BC.Entry = BI.LiveIn ? SpillPlacement::PrefReg : SpillPlacement::DontCare;
715 BC.Exit = BI.LiveOut ? SpillPlacement::PrefReg : SpillPlacement::DontCare;
716 BC.ChangesValue = BI.FirstDef;
725 if (BI.LiveIn) {
728 else if (Intf.first() < BI.FirstInstr)
730 else if (Intf.first() < BI.LastInstr)
735 if (BI.LiveOut) {
738 else if (Intf.last() > BI
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Utils/
H A DLowerExpectIntrinsic.cpp47 bool HandleIfExpect(BranchInst *BI);
92 bool LowerExpectIntrinsic::HandleIfExpect(BranchInst *BI) { argument
93 if (BI->isUnconditional())
101 ICmpInst *CmpI = dyn_cast<ICmpInst>(BI->getCondition());
128 BI->setMetadata(LLVMContext::MD_prof, Node);
140 if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) {
141 if (HandleIfExpect(BI))
149 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end();
150 BI != BE; ) {
151 CallInst *CI = dyn_cast<CallInst>(BI
[all...]
H A DSimplifyCFG.cpp106 bool SimplifyUncondBranch(BranchInst *BI, IRBuilder <> &Builder);
107 bool SimplifyCondBranch(BranchInst *BI, IRBuilder <>&Builder);
270 BranchInst *BI = dyn_cast<BranchInst>(CommonPred->getTerminator());
271 if (BI == 0) return 0;
273 assert(BI->isConditional() && "Two successors but not conditional?");
274 if (BI->getSuccessor(0) == Pred1) {
281 return BI->getCondition();
358 BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator());
359 if (BI == 0 || BI
562 BranchInst *BI = cast<BranchInst>(TI); local
1060 HoistThenElseCodeToIf(BranchInst *BI) argument
1436 SpeculativelyExecuteBB(BranchInst *BI, BasicBlock *ThenBB) argument
1604 BranchInst *BI = cast<BranchInst>(BB->getTerminator()); local
1631 FoldCondBranchOnPHI(BranchInst *BI, const DataLayout *TD) argument
1864 SimplifyCondBranchToTwoReturns(BranchInst *BI, IRBuilder<> &Builder) argument
1953 ExtractBranchMetadata(BranchInst *BI, uint64_t &ProbTrue, uint64_t &ProbFalse) argument
1988 FoldBranchToCommonDest(BranchInst *BI) argument
2306 SimplifyCondBranchToCondBranch(BranchInst *PBI, BranchInst *BI) argument
2749 SimplifyBranchOnICmpChain(BranchInst *BI, const DataLayout *TD, IRBuilder<> &Builder) argument
2960 BranchInst *BI = CondBranchPreds.pop_back_val(); local
3103 BranchInst *BI = Builder.CreateBr(II->getNormalDest()); local
3904 SimplifyUncondBranch(BranchInst *BI, IRBuilder<> &Builder) argument
3937 SimplifyCondBranch(BranchInst *BI, IRBuilder<> &Builder) argument
[all...]
H A DSimplifyInstructions.cpp57 for (BasicBlock::iterator BI = DI->begin(), BE = DI->end(); BI != BE;) {
58 Instruction *I = BI++;
H A DCloneFunction.cpp115 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end();
116 BI != BE; ++BI) {
117 const BasicBlock &BB = *BI;
302 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) {
303 if (BI->isConditional()) {
305 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition());
308 Value *V = VMap[BI->getCondition()];
314 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue());
398 for (Function::const_iterator BI
537 BranchInst *BI = dyn_cast<BranchInst>(I->getTerminator()); local
[all...]
H A DBasicBlockUtils.cpp140 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE; ++BI) {
141 if (PHINode *PN = dyn_cast<PHINode>(BI)) {
193 /// ReplaceInstWithValue - Replace all uses of an instruction (specified by BI)
197 BasicBlock::iterator &BI, Value *V) {
198 Instruction &I = *BI;
207 BI = BIL.erase(BI);
211 /// ReplaceInstWithInst - Replace the instruction specified by BI wit
196 ReplaceInstWithValue(BasicBlock::InstListType &BIL, BasicBlock::iterator &BI, Value *V) argument
215 ReplaceInstWithInst(BasicBlock::InstListType &BIL, BasicBlock::iterator &BI, Instruction *I) argument
395 UpdatePHINodes(BasicBlock *OrigBB, BasicBlock *NewBB, ArrayRef<BasicBlock*> Preds, BranchInst *BI, Pass *P, bool HasLoopExit) argument
462 BranchInst *BI = BranchInst::Create(BB, NewBB); local
[all...]
/freebsd-10.0-release/contrib/llvm/utils/TableGen/
H A DCodeEmitterGen.cpp47 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit);
49 void AddCodeToMergeInOperand(Record *R, BitsInit *BI,
64 BitsInit *BI = R->getValueAsBitsInit("Inst"); local
66 unsigned numBits = BI->getNumBits();
72 Init *OrigBit = BI->getBit(bit);
73 Init *BitSwap = BI->getBit(bitSwapIdx);
79 NewBits[middle] = BI->getBit(middle);
93 BitsInit *BI, int bit) {
94 if (VarBitInit *VBI = dyn_cast<VarBitInit>(BI->getBit(bit))) {
98 } else if (VarInit *VI = dyn_cast<VarInit>(BI
92 getVariableBit(const std::string &VarName, BitsInit *BI, int bit) argument
107 AddCodeToMergeInOperand(Record *R, BitsInit *BI, const std::string &VarName, unsigned &NumberedOp, std::string &Case, CodeGenTarget &Target) argument
214 BitsInit *BI = R->getValueAsBitsInit("Inst"); local
270 BitsInit *BI = R->getValueAsBitsInit("Inst"); local
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp199 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator()); local
200 if (!BI || !BI->isConditional())
203 Value *Cond = BI->getCondition();
286 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator()); local
287 if (!BI || !BI->isConditional())
290 Value *Cond = BI->getCondition();
346 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); local
347 if (!BI || !B
[all...]
H A DAliasDebugger.cpp66 for (BasicBlock::const_iterator BI = FI->begin(), BE = FI->end();
67 BI != BE; ++BI) {
68 Vals.insert(&*BI);
69 for (User::const_op_iterator OI = BI->op_begin(),
70 OE = BI->op_end(); OI != OE; ++OI)
H A DRegionPrinter.cpp124 for (Region::const_block_iterator BI = R->block_begin(),
125 BE = R->block_end(); BI != BE; ++BI)
126 if (RI->getRegionFor(*BI) == R)
128 << static_cast<const void*>(RI->getTopLevelRegion()->getBBNode(*BI))
H A DLoopInfo.cpp181 for (block_iterator BI = block_begin(), E = block_end(); BI != E; ++BI) {
182 BasicBlock *BB = *BI;
227 for (BasicBlock::iterator BI = (*I)->begin(), BE = (*I)->end(); BI != BE; ++BI) {
228 if (const CallInst *CI = dyn_cast<CallInst>(BI)) {
321 for (block_iterator BI = block_begin(), BE = block_end(); BI !
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopDeletion.cpp90 BasicBlock::iterator BI = exitBlock->begin(); local
91 while (PHINode *P = dyn_cast<PHINode>(BI)) {
107 ++BI;
116 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end();
117 BI != BE; ++BI) {
118 if (BI->mayHaveSideEffects())
193 BasicBlock::iterator BI = exitBlock->begin(); local
194 while (PHINode *P = dyn_cast<PHINode>(BI)) {
200 ++BI;
[all...]
H A DLoopRotation.cpp229 BranchInst *BI = dyn_cast<BranchInst>(LastExit->getTerminator());
230 if (!BI)
240 LastExit->getInstList().splice(BI, Latch->getInstList(), Latch->begin(), Jmp);
242 unsigned FallThruPath = BI->getSuccessor(0) == Latch ? 0 : 1;
247 BI->setSuccessor(FallThruPath, Header);
278 BranchInst *BI = dyn_cast<BranchInst>(OrigHeader->getTerminator()); local
279 if (BI == 0 || BI->isUnconditional())
330 BasicBlock *Exit = BI->getSuccessor(0);
331 BasicBlock *NewHeader = BI
[all...]
H A DLoopUnswitch.cpp439 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
442 if (BI->isConditional()) {
445 Value *LoopCond = FindLIVLoopCondition(BI->getCondition(),
569 if (BranchInst *BI = dyn_cast<BranchInst>(HeaderTerm)) {
572 if (!BI->isConditional() || BI->getCondition() != Cond)
580 BI->getSuccessor(0)))) {
583 BI->getSuccessor(1)))) {
698 BranchInst *BI = BranchInst::Create(TrueDest, FalseDest, BranchVal, InsertPt); local
702 SplitCriticalEdge(BI,
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h40 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI)
42 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);
46 ExitingBlocks.push_back(*BI);
74 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI)
76 BlockTraits::child_begin(*BI),
247 BI = df_ext_begin(getHeader(), VisitSet), local
[all...]
/freebsd-10.0-release/contrib/gcc/
H A Dmachmode.def157 FRACTIONAL_INT_MODE (BI, 1, 1);
/freebsd-10.0-release/contrib/llvm/tools/llvm-diff/
H A DDiffConsumer.cpp36 for (BasicBlock::iterator BI = FI->begin(), BE = FI->end(); BI != BE; ++BI)
38 if (!BI->hasName() && !BI->getType()->isVoidTy())
39 Numbering[&*BI] = IN++;

Completed in 233 milliseconds

123456