| /external/llvm/lib/Target/NVPTX/ |
| NVPTXAllocaHoisting.cpp | 27 for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE;) {
28 AllocaInst *allocaInst = dyn_cast<AllocaInst>(BI++);
|
| NVPTXSplitBBatBar.cpp | 34 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; ++BI) {
35 BasicBlock::iterator IB = BI->begin();
37 BasicBlock::iterator IE = BI->end();
|
| /external/llvm/include/llvm/Support/ |
| InstIterator.h | 38 _BI_t BI; // BasicBlock::iterator
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/ |
| TargetBuiltins.h | 28 #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,
119 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
129 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
|
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.cpp | 130 BlockInterference *BI = &Blocks[MBBNum];
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->First = StartI
[all...] |
| SplitKit.cpp | 188 BlockInfo BI;
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.LiveIn)
[all...] |
| MachineBlockPlacement.cpp | 138 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;
[all...] |
| RegAllocGreedy.cpp | 765 const SplitAnalysis::BlockInfo &BI = UseBlocks[i];
768 BC.Number = BI.MBB->getNumber();
770 BC.Entry = BI.LiveIn ? SpillPlacement::PrefReg : SpillPlacement::DontCare;
771 BC.Exit = BI.LiveOut ? SpillPlacement::PrefReg : SpillPlacement::DontCare;
772 BC.ChangesValue = BI.FirstDef.isValid();
781 if (BI.LiveIn) {
784 else if (Intf.first() < BI.FirstInstr)
786 else if (Intf.first() < BI.LastInstr)
791 if (BI.LiveOut) {
794 else if (Intf.last() > BI.LastInstr
[all...] |
| SplitKit.h | 189 /// live range for the instructions in BI. There is normally no benefit to
194 /// @param BI The block to be isolated.
196 bool shouldSplitSingleBlock(const BlockInfo &BI, bool SingleInstrs) const;
430 void splitSingleBlock(const SplitAnalysis::BlockInfo &BI);
450 /// @param BI Block descriptor.
453 void splitRegInBlock(const SplitAnalysis::BlockInfo &BI,
462 /// @param BI Block descriptor.
465 void splitRegOutBlock(const SplitAnalysis::BlockInfo &BI,
|
| /external/llvm/lib/Transforms/Utils/ |
| LowerExpectIntrinsic.cpp | 47 bool HandleIfExpect(BranchInst *BI);
92 bool LowerExpectIntrinsic::HandleIfExpect(BranchInst *BI) {
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...] |
| FlattenCFG.cpp | 178 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI; BI != BE;) {
179 Instruction *CI = BI++;
240 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator());
241 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition());
246 BI->swapSuccessors();
358 for (BasicBlock::iterator BI = PBI2, BE = PTI2; BI != BE; ++BI) {
359 if (BI->mayReadFromMemory() || BI->mayWriteToMemory())
[all...] |
| SimplifyCFG.cpp | 107 bool SimplifyUncondBranch(BranchInst *BI, IRBuilder <> &Builder);
108 bool SimplifyCondBranch(BranchInst *BI, IRBuilder <>&Builder);
272 BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator());
273 if (BI == 0 || BI->isConditional() || BI->getSuccessor(0) != BB)
450 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
451 if (BI->isConditional())
452 Cond = dyn_cast<Instruction>(BI->getCondition());
471 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)
[all...] |
| SimplifyInstructions.cpp | 57 for (BasicBlock::iterator BI = DI->begin(), BE = DI->end(); BI != BE;) {
58 Instruction *I = BI++;
|
| CloneFunction.cpp | 116 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end();
117 BI != BE; ++BI) {
118 const BasicBlock &BB = *BI;
303 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) {
304 if (BI->isConditional()) {
306 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition());
309 Value *V = VMap[BI->getCondition()];
315 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue());
399 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end()
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeEmitterGen.cpp | 47 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit);
49 void AddCodeToMergeInOperand(Record *R, BitsInit *BI,
64 BitsInit *BI = R->getValueAsBitsInit("Inst");
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->getBit(bit)))
[all...] |
| /external/llvm/lib/Target/R600/ |
| SIFixSGPRCopies.cpp | 134 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end();
135 BI != BE; ++BI) {
137 MachineBasicBlock &MBB = *BI;
|
| R600Packetizer.cpp | 74 MachineBasicBlock::instr_iterator BI = I.getInstrIterator();
76 BI++;
78 if (TII->isPredicated(BI))
80 int OperandIdx = TII->getOperandIdx(BI->getOpcode(), AMDGPU::OpName::write);
81 if (OperandIdx > -1 && BI->getOperand(OperandIdx).getImm() == 0)
83 int DstIdx = TII->getOperandIdx(BI->getOpcode(), AMDGPU::OpName::dst);
87 unsigned Dst = BI->getOperand(DstIdx).getReg();
88 if (TII->isTransOnly(BI)) {
92 if (BI->getOpcode() == AMDGPU::DOT4_r600 ||
93 BI->getOpcode() == AMDGPU::DOT4_eg)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 90 BasicBlock::iterator BI = exitBlock->begin();
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();
194 while (PHINode *P = dyn_cast<PHINode>(BI)) {
200 ++BI;
[all...] |
| LoopRotation.cpp | 229 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());
279 if (BI == 0 || BI->isUnconditional())
330 BasicBlock *Exit = BI->getSuccessor(0);
331 BasicBlock *NewHeader = BI->getSuccessor(1)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 40 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), E = BlockTraits::child_end(*BI)
[all...] |
| /external/llvm/lib/Analysis/ |
| AliasDebugger.cpp | 66 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)
|
| RegionPrinter.cpp | 124 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))
|
| LoopInfo.cpp | 184 for (block_iterator BI = block_begin(), E = block_end(); BI != E; ++BI) {
185 BasicBlock *BB = *BI;
230 for (BasicBlock::iterator BI = (*I)->begin(), BE = (*I)->end(); BI != BE; ++BI) {
231 if (const CallInst *CI = dyn_cast<CallInst>(BI)) {
372 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI)
[all...] |
| BranchProbabilityInfo.cpp | 274 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
275 if (!BI || !BI->isConditional())
278 Value *Cond = BI->getCondition();
361 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
362 if (!BI || !BI->isConditional())
365 Value *Cond = BI->getCondition();
421 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator());
422 if (!BI || !BI->isConditional()
[all...] |
| /external/llvm/lib/Target/SystemZ/ |
| SystemZLongBranch.cpp | 329 for (SmallVectorImpl<MBBInfo>::iterator BI = MBBs.begin(), BE = MBBs.end();
330 BI != BE; ++BI) {
331 skipNonTerminators(Position, *BI);
332 for (unsigned BTI = 0, BTE = BI->NumTerminators; BTI != BTE; ++BTI) {
419 for (SmallVectorImpl<MBBInfo>::iterator BI = MBBs.begin(), BE = MBBs.end();
420 BI != BE; ++BI) {
421 skipNonTerminators(Position, *BI);
422 for (unsigned BTI = 0, BTE = BI->NumTerminators; BTI != BTE; ++BTI)
[all...] |
