| /external/llvm/unittests/VMCore/ |
| VerifierTest.cpp | 37 BranchInst *BI = BranchInst::Create(Exit, Exit, False, Entry);
42 BI->setOperand(0, Zero32);
|
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.cpp | 123 BlockInterference *BI = &Blocks[MBBNum];
125 BI->Tag = Tag;
126 BI->First = BI->Last = SlotIndex();
136 if (!BI->First.isValid() || StartI < BI->First)
137 BI->First = StartI;
141 if (BI->First.isValid())
148 BI = &Blocks[MBBNum];
149 if (BI->Tag == Tag
[all...] |
| RegAllocGreedy.cpp | 680 const SplitAnalysis::BlockInfo &BI = UseBlocks[i];
683 BC.Number = BI.MBB->getNumber();
685 BC.Entry = BI.LiveIn ? SpillPlacement::PrefReg : SpillPlacement::DontCare;
686 BC.Exit = BI.LiveOut ? SpillPlacement::PrefReg : SpillPlacement::DontCare;
687 BC.ChangesValue = BI.FirstDef;
696 if (BI.LiveIn) {
699 else if (Intf.first() < BI.FirstInstr)
701 else if (Intf.first() < BI.LastInstr)
706 if (BI.LiveOut) {
709 else if (Intf.last() > BI.LastInstr
[all...] |
| SplitKit.cpp | 165 BlockInfo BI;
166 BI.MBB = MFI;
168 tie(Start, Stop) = LIS.getSlotIndexes()->getMBBRange(BI.MBB);
175 ThroughBlocks.set(BI.MBB->getNumber());
182 BI.FirstInstr = *UseI;
183 assert(BI.FirstInstr >= Start);
186 BI.LastInstr = UseI[-1];
187 assert(BI.LastInstr < Stop);
190 BI.LiveIn = LVI->start <= Start;
193 if (!BI.LiveIn)
[all...] |
| /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 | 157 BranchInst *BI = dyn_cast<BranchInst>(OrigHeader->getTerminator());
158 if (BI == 0 || BI->isUnconditional())
201 BasicBlock *Exit = BI->getSuccessor(0);
202 BasicBlock *NewHeader = BI->getSuccessor(1);
273 for (BasicBlock::iterator BI = TI->getSuccessor(i)->begin();
274 PHINode *PN = dyn_cast<PHINode>(BI); ++BI)
299 assert(PHBI->isConditional() && "Should be clone of BI condbr!");
|
| TailRecursionElimination.cpp | 601 if (BranchInst *BI = dyn_cast<BranchInst>(PTI))
602 if (BI->isUnconditional())
603 UncondBranchPreds.push_back(BI);
607 BranchInst *BI = UncondBranchPreds.pop_back_val();
608 BasicBlock *Pred = BI->getParent();
609 if (CallInst *CI = FindTRECandidate(BI, CannotTailCallElimCallsMarkedTail)){
|
| CodeGenPrepare.cpp | 182 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator());
183 if (!BI || !BI->isUnconditional())
188 BasicBlock::iterator BBI = BI;
201 BasicBlock *DestBB = BI->getSuccessor(0);
287 BranchInst *BI = cast<BranchInst>(BB->getTerminator());
288 BasicBlock *DestBB = BI->getSuccessor(0);
622 BasicBlock::iterator BI = BB->begin();
623 do { ++BI; } while (isa<DbgInfoIntrinsic>(BI));
[all...] |
| /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/Transforms/Utils/ |
| LoopUnroll.cpp | 152 BranchInst *BI = dyn_cast<BranchInst>(LatchBlock->getTerminator());
154 if (!BI || BI->isUnconditional()) {
218 bool ContinueOnTrue = L->contains(BI->getSuccessor(0));
219 BasicBlock *LoopExit = BI->getSuccessor(ContinueOnTrue);
|
| 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...] |
| CloneFunction.cpp | 110 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end();
111 BI != BE; ++BI) {
112 const BasicBlock &BB = *BI;
258 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) {
259 if (BI->isConditional()) {
261 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition());
264 Value *V = VMap[BI->getCondition()];
270 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue());
381 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end()
[all...] |
| LoopSimplify.cpp | 187 if (BranchInst *BI = dyn_cast<BranchInst>((*I)->getTerminator()))
188 if (BI->isConditional()) {
189 if (UndefValue *Cond = dyn_cast<UndefValue>(BI->getCondition())) {
194 BI->setCondition(ConstantInt::get(Cond->getType(),
195 !L->contains(BI->getSuccessor(0))));
295 BranchInst *BI = dyn_cast<BranchInst>(ExitingBlock->getTerminator());
296 if (!BI || !BI->isConditional()) continue;
297 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition());
303 for (BasicBlock::iterator I = ExitingBlock->begin(); &*I != BI; ) {
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeEmitterGen.cpp | 41 BitsInit *BI = R->getValueAsBitsInit("Inst");
43 unsigned numBits = BI->getNumBits();
49 Init *OrigBit = BI->getBit(bit);
50 Init *BitSwap = BI->getBit(bitSwapIdx);
56 NewBits[middle] = BI->getBit(middle);
70 BitsInit *BI, int bit) {
71 if (VarBitInit *VBI = dynamic_cast<VarBitInit*>(BI->getBit(bit))) {
75 } else if (VarInit *VI = dynamic_cast<VarInit*>(BI->getBit(bit))) {
84 AddCodeToMergeInOperand(Record *R, BitsInit *BI, const std::string &VarName,
90 int bit = BI->getNumBits()-1
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/lang/ |
| StringTest.java | 71 public void test_Constructor$BI() {
|
| String2Test.java | 67 public void test_Constructor$BI() {
428 public void test_getBytesII$BI() {
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/net/ |
| DatagramPacketTest.java | 36 public void test_Constructor$BI() {
|
| Inet6AddressTest.java | [all...] |
| /external/clang/include/clang/Analysis/FlowSensitive/ |
| DataflowSolver.h | 257 typename BlockDataMapTy::iterator BI = D.getBlockDataMap().find(B);
258 if(BI == D.getBlockDataMap().end()) {
260 BI = D.getBlockDataMap().insert( std::make_pair(B,ValTy()) ).first;
266 Merge(V, BI->second);
269 BI->second.copyValues(V);
|
| /frameworks/compile/slang/ |
| slang_rs.cpp | 122 // Type(ai) = Type(bi) must hold;
124 // Name(ai) = Name(bi) must hold;
135 BI = ERT->fields_begin();
138 if ((*AI)->getName() != (*BI)->getName())
141 BI++;
|
| /libcore/luni/src/test/java/org/apache/harmony/crypto/tests/javax/crypto/ |
| ExemptionMechanismTest.java | 313 public void test_genExemptionBlob$BI() throws InvalidKeyException,
|
| KeyAgreementTest.java | 610 public void test_generateSecret$BI() throws Exception {
|
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 222 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
223 if (!BI || !BI->isConditional())
226 Value *Cond = BI->getCondition();
238 BasicBlock *Taken = BI->getSuccessor(0);
239 BasicBlock *NonTaken = BI->getSuccessor(1);
321 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
322 if (!BI || !BI->isConditional())
325 Value *Cond = BI->getCondition()
[all...] |
| /libcore/luni/src/test/java/libcore/java/lang/ |
| OldStringTest.java | 92 public void test_getBytesII$BI() {
|
| /external/clang/lib/CodeGen/ |
| CodeGenFunction.cpp | 120 llvm::BranchInst *BI =
122 if (BI && BI->isUnconditional() &&
123 BI->getSuccessor(0) == ReturnBlock.getBlock()) {
125 Builder.SetCurrentDebugLocation(BI->getDebugLoc());
126 Builder.SetInsertPoint(BI->getParent());
127 BI->eraseFromParent();
375 BI = FI->begin(), BE = FI->end(); BI != BE; ++BI)
[all...] |
