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

123456

/external/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 DNVPTXImageOptimizer.cpp57 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE;
58 ++BI) {
59 for (BasicBlock::iterator I = (*BI).begin(), E = (*BI).end();
152 if (BranchInst *BI = dyn_cast<BranchInst>(*UI)) {
153 if (BI->isUnconditional()) continue;
157 Dest = BI->getSuccessor(1);
160 Dest = BI->getSuccessor(0);
161 BranchInst::Create(Dest, BI);
[all...]
/external/llvm/include/llvm/IR/
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...]
/external/clang/include/clang/Basic/
H A DTargetBuiltins.h27 #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,
142 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
152 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
162 #define BUILTIN(ID, TYPE, ATTRS) BI##I
[all...]
/external/llvm/lib/CodeGen/
H A DInterferenceCache.cpp147 BlockInterference *BI = &Blocks[MBBNum]; local
151 BI->Tag = Tag;
152 BI->First = BI->Last = SlotIndex();
162 if (!BI->First.isValid() || StartI < BI->First)
163 BI->First = StartI;
175 if (!BI->First.isValid() || StartI < BI->First)
176 BI
[all...]
H A DSplitKit.cpp187 BlockInfo BI; local
188 BI.MBB = MFI;
190 std::tie(Start, Stop) = LIS.getSlotIndexes()->getMBBRange(BI.MBB);
197 ThroughBlocks.set(BI.MBB->getNumber());
204 BI.FirstInstr = *UseI;
205 assert(BI.FirstInstr >= Start);
208 BI.LastInstr = UseI[-1];
209 assert(BI.LastInstr < Stop);
212 BI.LiveIn = LVI->start <= Start;
215 if (!BI
1136 shouldSplitSingleBlock(const BlockInfo &BI, bool SingleInstrs) const argument
1154 splitSingleBlock(const SplitAnalysis::BlockInfo &BI) argument
1285 splitRegInBlock(const SplitAnalysis::BlockInfo &BI, unsigned IntvIn, SlotIndex LeaveBefore) argument
1377 splitRegOutBlock(const SplitAnalysis::BlockInfo &BI, unsigned IntvOut, SlotIndex EnterAfter) argument
[all...]
H A DMachineBlockPlacement.cpp146 for (BlockChain::iterator BI = Chain->begin(), BE = Chain->end();
147 BI != BE; ++BI) {
148 Blocks.push_back(*BI);
149 assert(BlockToChain[*BI] == Chain && "Incoming blocks not in chain");
150 BlockToChain[*BI] = this;
811 for (MachineLoop::block_iterator BI = L.block_begin(),
813 BI != BE; ++BI) {
814 BlockChain &Chain = *BlockToChain[*BI];
[all...]
/external/llvm/lib/Transforms/Utils/
H A DLowerExpectIntrinsic.cpp48 bool HandleIfExpect(BranchInst *BI);
93 bool LowerExpectIntrinsic::HandleIfExpect(BranchInst *BI) { argument
94 if (BI->isUnconditional())
108 ICmpInst *CmpI = dyn_cast<ICmpInst>(BI->getCondition());
110 CI = dyn_cast<CallInst>(BI->getCondition());
139 BI->setMetadata(LLVMContext::MD_prof, Node);
144 BI->setCondition(ArgValue);
154 if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) {
155 if (HandleIfExpect(BI))
163 for (BasicBlock::iterator BI
[all...]
H A DFlattenCFG.cpp180 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI; BI != BE;) {
181 Instruction *CI = BI++;
242 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator()); local
243 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition());
248 BI->swapSuccessors();
358 for (BasicBlock::iterator BI = PBI2, BE = PTI2; BI != BE; ++BI) {
359 if (BI
[all...]
H A DSimplifyInstructions.cpp62 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE;) {
63 Instruction *I = BI++;
85 BI = BB->begin(); BE = BB->end();
H A DSimplifyCFG.cpp110 bool SimplifyUncondBranch(BranchInst *BI, IRBuilder <> &Builder);
111 bool SimplifyCondBranch(BranchInst *BI, IRBuilder <>&Builder);
280 BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator());
281 if (!BI || BI->isConditional() || BI->getSuccessor(0) != BB)
458 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
459 if (BI->isConditional())
460 Cond = dyn_cast<Instruction>(BI->getCondition());
479 } else if (BranchInst *BI
510 BranchInst *BI = cast<BranchInst>(TI); local
1001 HoistThenElseCodeToIf(BranchInst *BI, const DataLayout *DL) argument
1394 SpeculativelyExecuteBB(BranchInst *BI, BasicBlock *ThenBB, const DataLayout *DL) argument
1581 BranchInst *BI = cast<BranchInst>(BB->getTerminator()); local
1607 FoldCondBranchOnPHI(BranchInst *BI, const DataLayout *DL) argument
1842 SimplifyCondBranchToTwoReturns(BranchInst *BI, IRBuilder<> &Builder) argument
1931 ExtractBranchMetadata(BranchInst *BI, uint64_t &ProbTrue, uint64_t &ProbFalse) argument
1966 FoldBranchToCommonDest(BranchInst *BI, const DataLayout *DL) argument
2297 SimplifyCondBranchToCondBranch(BranchInst *PBI, BranchInst *BI) argument
2757 SimplifyBranchOnICmpChain(BranchInst *BI, const DataLayout *DL, IRBuilder<> &Builder) argument
2968 BranchInst *BI = CondBranchPreds.pop_back_val(); local
3111 BranchInst *BI = Builder.CreateBr(II->getNormalDest()); local
3994 SimplifyUncondBranch(BranchInst *BI, IRBuilder<> &Builder) argument
4027 SimplifyCondBranch(BranchInst *BI, IRBuilder<> &Builder) argument
[all...]
H A DCloneFunction.cpp119 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end();
120 BI != BE; ++BI) {
121 const BasicBlock &BB = *BI;
357 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) {
358 if (BI->isConditional()) {
360 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition());
363 Value *V = VMap[BI->getCondition()];
369 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue());
453 for (Function::const_iterator BI
592 BranchInst *BI = dyn_cast<BranchInst>(I->getTerminator()); local
[all...]
/external/llvm/lib/Target/R600/
H A DAMDGPUTargetTransformInfo.cpp98 for (Loop::block_iterator BI = L->block_begin(), BE = L->block_end();
99 BI != BE; ++BI) {
100 BasicBlock *BB = *BI;
H A DSIFixSGPRLiveRanges.cpp80 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end();
81 BI != BE; ++BI) {
83 MachineBasicBlock &MBB = *BI;
H A DR600Packetizer.cpp78 MachineBasicBlock::instr_iterator BI = I.getInstrIterator();
80 BI++;
84 int BISlot = getSlot(BI);
88 if (TII->isPredicated(BI))
90 int OperandIdx = TII->getOperandIdx(BI->getOpcode(), AMDGPU::OpName::write);
91 if (OperandIdx > -1 && BI->getOperand(OperandIdx).getImm() == 0)
93 int DstIdx = TII->getOperandIdx(BI->getOpcode(), AMDGPU::OpName::dst);
97 unsigned Dst = BI->getOperand(DstIdx).getReg();
98 if (isTrans || TII->isTransOnly(BI)) {
102 if (BI
[all...]
H A DSILowerI1Copies.cpp78 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end();
79 BI != BE; ++BI) {
81 MachineBasicBlock &MBB = *BI;
/external/llvm/utils/TableGen/
H A DCodeEmitterGen.cpp44 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit);
46 void AddCodeToMergeInOperand(Record *R, BitsInit *BI,
57 BitsInit *BI, int bit) {
58 if (VarBitInit *VBI = dyn_cast<VarBitInit>(BI->getBit(bit))) {
62 } else if (VarInit *VI = dyn_cast<VarInit>(BI->getBit(bit))) {
71 AddCodeToMergeInOperand(Record *R, BitsInit *BI, const std::string &VarName, argument
78 int bit = BI->getNumBits()-1;
82 if (getVariableBit(VarName, BI, bit) != -1)
150 int varBit = getVariableBit(VarName, BI, bit);
164 varBit = getVariableBit(VarName, BI, bi
56 getVariableBit(const std::string &VarName, BitsInit *BI, int bit) argument
192 BitsInit *BI = R->getValueAsBitsInit("Inst"); local
268 BitsInit *BI = R->getValueAsBitsInit("Inst"); local
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DLoopDeletion.cpp91 BasicBlock::iterator BI = exitBlock->begin(); local
92 while (PHINode *P = dyn_cast<PHINode>(BI)) {
108 ++BI;
117 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end();
118 BI != BE; ++BI) {
119 if (BI->mayHaveSideEffects())
197 BasicBlock::iterator BI = exitBlock->begin(); local
198 while (PHINode *P = dyn_cast<PHINode>(BI)) {
204 ++BI;
[all...]
H A DLoopRotation.cpp253 BranchInst *BI = dyn_cast<BranchInst>(LastExit->getTerminator());
254 if (!BI)
264 LastExit->getInstList().splice(BI, Latch->getInstList(), Latch->begin(), Jmp);
266 unsigned FallThruPath = BI->getSuccessor(0) == Latch ? 0 : 1;
271 BI->setSuccessor(FallThruPath, Header);
303 BranchInst *BI = dyn_cast<BranchInst>(OrigHeader->getTerminator()); local
304 if (!BI || BI->isUnconditional())
355 BasicBlock *Exit = BI->getSuccessor(0);
356 BasicBlock *NewHeader = BI
[all...]
/external/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h37 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI)
39 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);
43 ExitingBlocks.push_back(*BI);
66 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI)
68 BlockTraits::child_begin(*BI),
234 BI = df_ext_begin(getHeader(), VisitSet), local
[all...]
/external/llvm/lib/Analysis/
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 DLoopInfo.cpp179 for (block_iterator BI = block_begin(), E = block_end(); BI != E; ++BI) {
180 BasicBlock *BB = *BI;
224 for (BasicBlock::iterator BI = (*I)->begin(), BE = (*I)->end(); BI != BE; ++BI) {
225 if (const CallInst *CI = dyn_cast<CallInst>(BI)) {
358 for (block_iterator BI = block_begin(), BE = block_end(); BI !
[all...]
H A DBranchProbabilityInfo.cpp276 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator()); local
277 if (!BI || !BI->isConditional())
280 Value *Cond = BI->getCondition();
366 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator()); local
367 if (!BI || !BI->isConditional())
370 Value *Cond = BI->getCondition();
440 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); local
441 if (!BI || !B
[all...]
/external/llvm/unittests/IR/
H A DVerifierTest.cpp37 BranchInst *BI = BranchInst::Create(Exit, Exit, False, Entry); local
42 BI->setOperand(0, Zero32);
/external/clang/include/clang/Analysis/Analyses/
H A DConsumed.h209 for (PostOrderCFGView::iterator BI = SortedGraph->begin(),
210 BE = SortedGraph->end(); BI != BE; ++BI) {
211 VisitOrder[(*BI)->getBlockID()] = VisitOrderCounter++;

Completed in 5524 milliseconds

123456