| /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++);
|
| NVPTXImageOptimizer.cpp | 57 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/ |
| 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 | 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,
142 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
152 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
162 #define BUILTIN(ID, TYPE, ATTRS) BI##ID
[all...] |
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.cpp | 147 BlockInterference *BI = &Blocks[MBBNum];
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->First = StartI
[all...] |
| SplitKit.cpp | 187 BlockInfo BI;
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.LiveIn)
[all...] |
| MachineBlockPlacement.cpp | 146 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;
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LowerExpectIntrinsic.cpp | 48 bool HandleIfExpect(BranchInst *BI);
93 bool LowerExpectIntrinsic::HandleIfExpect(BranchInst *BI) {
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 = BB->begin(), BE = BB->end()
[all...] |
| FlattenCFG.cpp | 180 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI; BI != BE;) {
181 Instruction *CI = BI++;
242 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator());
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->mayReadFromMemory() || BI->mayWriteToMemory())
[all...] |
| SimplifyInstructions.cpp | 62 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE;) {
63 Instruction *I = BI++;
85 BI = BB->begin(); BE = BB->end();
|
| SimplifyCFG.cpp | 110 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 = dyn_cast<BranchInst>(TI)
[all...] |
| CloneFunction.cpp | 119 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 = OldFunc->begin(), BE = OldFunc->end()
[all...] |
| /external/llvm/lib/Target/R600/ |
| AMDGPUTargetTransformInfo.cpp | 98 for (Loop::block_iterator BI = L->block_begin(), BE = L->block_end();
99 BI != BE; ++BI) {
100 BasicBlock *BB = *BI;
|
| SIFixSGPRLiveRanges.cpp | 80 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end();
81 BI != BE; ++BI) {
83 MachineBasicBlock &MBB = *BI;
|
| R600Packetizer.cpp | 78 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->getOpcode() == AMDGPU::DOT4_r600 |
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeEmitterGen.cpp | 44 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,
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, bit)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 91 BasicBlock::iterator BI = exitBlock->begin();
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();
198 while (PHINode *P = dyn_cast<PHINode>(BI)) {
204 ++BI;
[all...] |
| LoopRotation.cpp | 253 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());
304 if (!BI || BI->isUnconditional())
355 BasicBlock *Exit = BI->getSuccessor(0);
356 BasicBlock *NewHeader = BI->getSuccessor(1)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 37 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), 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)
|
| LoopInfo.cpp | 179 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 != BE; ++BI)
[all...] |
| BranchProbabilityInfo.cpp | 276 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
277 if (!BI || !BI->isConditional())
280 Value *Cond = BI->getCondition();
366 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
367 if (!BI || !BI->isConditional())
370 Value *Cond = BI->getCondition();
440 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator());
441 if (!BI || !BI->isConditional()
[all...] |
| /external/llvm/unittests/IR/ |
| VerifierTest.cpp | 37 BranchInst *BI = BranchInst::Create(Exit, Exit, False, Entry);
42 BI->setOperand(0, Zero32);
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| ConcurrentHashMapTest.java | 34 static class BI implements Comparable<BI> {
36 BI(int value) { this.value = value; }
37 public int compareTo(BI other) {
41 return (x instanceof BI) && ((BI)x).value == value;
45 static class CI extends BI { CI(int value) { super(value); } }
46 static class DI extends BI { DI(int value) { super(value); } }
88 ConcurrentHashMap<BI, Boolean> m =
89 new ConcurrentHashMap<BI, Boolean>()
107 BI bi = new BI(i); local
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| Consumed.h | 209 for (PostOrderCFGView::iterator BI = SortedGraph->begin(),
210 BE = SortedGraph->end(); BI != BE; ++BI) {
211 VisitOrder[(*BI)->getBlockID()] = VisitOrderCounter++;
|
