| /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 | 36 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; ++BI) {
37 BasicBlock::iterator IB = BI->begin();
39 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/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 | 132 for (BlockChain::iterator BI = Chain->begin(), BE = Chain->end();
133 BI != BE; ++BI) {
134 Blocks.push_back(*BI);
135 assert(BlockToChain[*BI] == Chain && "Incoming blocks not in chain");
136 BlockToChain[*BI] = this;
[all...] |
| RegAllocGreedy.cpp | 694 const SplitAnalysis::BlockInfo &BI = UseBlocks[i];
697 BC.Number = BI.MBB->getNumber();
699 BC.Entry = BI.LiveIn ? SpillPlacement::PrefReg : SpillPlacement::DontCare;
700 BC.Exit = BI.LiveOut ? SpillPlacement::PrefReg : SpillPlacement::DontCare;
701 BC.ChangesValue = BI.FirstDef;
710 if (BI.LiveIn) {
713 else if (Intf.first() < BI.FirstInstr)
715 else if (Intf.first() < BI.LastInstr)
720 if (BI.LiveOut) {
723 else if (Intf.last() > BI.LastInstr
[all...] |
| /external/clang/include/clang/Basic/ |
| TargetBuiltins.h | 28 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
38 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
48 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
59 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
109 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
119 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
|
| /external/llvm/lib/Transforms/IPO/ |
| InlineAlways.cpp | 69 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; ++BI) {
71 if (isa<IndirectBrInst>(BI->getTerminator()))
74 for (BasicBlock::iterator II = BI->begin(), IE = BI->end(); II != IE;
|
| /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...] |
| SimplifyCFG.cpp | 92 bool SimplifyUncondBranch(BranchInst *BI, IRBuilder <> &Builder);
93 bool SimplifyCondBranch(BranchInst *BI, IRBuilder <>&Builder);
255 BranchInst *BI = dyn_cast<BranchInst>(CommonPred->getTerminator());
256 if (BI == 0) return 0;
258 assert(BI->isConditional() && "Two successors but not conditional?");
259 if (BI->getSuccessor(0) == Pred1) {
266 return BI->getCondition();
343 BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator());
344 if (BI == 0 || BI->isConditional() || BI->getSuccessor(0) != BB
[all...] |
| SimplifyInstructions.cpp | 57 for (BasicBlock::iterator BI = DI->begin(), BE = DI->end(); BI != BE;) {
58 Instruction *I = BI++;
|
| CloneFunction.cpp | 113 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end();
114 BI != BE; ++BI) {
115 const BasicBlock &BB = *BI;
300 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) {
301 if (BI->isConditional()) {
303 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition());
306 Value *V = VMap[BI->getCondition()];
312 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue());
396 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end()
[all...] |
| BasicBlockUtils.cpp | 140 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 with th
[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 = dynamic_cast<VarBitInit*>(BI->getBit(bit))) {
98 } else if (VarInit *VI = dynamic_cast<VarInit*>(BI->getBit(bit)))
[all...] |
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 199 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
200 if (!BI || !BI->isConditional())
203 Value *Cond = BI->getCondition();
286 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
287 if (!BI || !BI->isConditional())
290 Value *Cond = BI->getCondition();
346 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator());
347 if (!BI || !BI->isConditional()
[all...] |
| 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)
|
| LoopInfo.cpp | 180 for (block_iterator BI = block_begin(), E = block_end(); BI != E; ++BI) {
181 BasicBlock *BB = *BI;
259 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) {
261 BasicBlock *current = *BI;
264 for (succ_iterator I = succ_begin(*BI), E = succ_end(*BI); I != E; ++I)
[all...] |
| 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))
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 88 BasicBlock::iterator BI = exitBlock->begin();
89 while (PHINode* P = dyn_cast<PHINode>(BI)) {
105 ++BI;
114 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end();
115 BI != BE; ++BI) {
116 if (BI->mayHaveSideEffects())
191 BasicBlock::iterator BI = exitBlock->begin();
192 while (PHINode* P = dyn_cast<PHINode>(BI)) {
198 ++BI;
[all...] |
| LoopRotation.cpp | 223 BranchInst *BI = dyn_cast<BranchInst>(LastExit->getTerminator());
224 if (!BI)
234 LastExit->getInstList().splice(BI, Latch->getInstList(), Latch->begin(), Jmp);
236 unsigned FallThruPath = BI->getSuccessor(0) == Latch ? 0 : 1;
241 BI->setSuccessor(FallThruPath, Header);
262 BranchInst *BI = dyn_cast<BranchInst>(OrigHeader->getTerminator());
263 if (BI == 0 || BI->isUnconditional())
303 BasicBlock *Exit = BI->getSuccessor(0);
304 BasicBlock *NewHeader = BI->getSuccessor(1)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 39 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI)
41 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);
45 ExitingBlocks.push_back(*BI);
73 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI)
75 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI)
[all...] |
| /external/llvm/unittests/VMCore/ |
| VerifierTest.cpp | 37 BranchInst *BI = BranchInst::Create(Exit, Exit, False, Entry);
42 BI->setOperand(0, Zero32);
|
| IRBuilderTest.cpp | 81 BranchInst *BI = Builder.CreateCondBr(Builder.getTrue(), TBB, FBB);
83 EXPECT_EQ(BI, TI);
88 BI->eraseFromParent();
90 BI = Builder.CreateCondBr(Builder.getTrue(), TBB, FBB, Weights);
92 EXPECT_EQ(BI, TI);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| ThreadSanitizer.cpp | 266 for (BasicBlock::iterator BI = BB.begin(), BE = BB.end();
267 BI != BE; ++BI) {
268 if (isAtomic(BI))
269 AtomicAccesses.push_back(BI);
270 else if (isa<LoadInst>(BI) || isa<StoreInst>(BI))
271 LocalLoadsAndStores.push_back(BI);
272 else if (isa<ReturnInst>(BI))
273 RetVec.push_back(BI);
[all...] |
