HomeSort by relevance Sort by last modified time
    Searched defs:BI (Results 26 - 50 of 87) sorted by null

12 3 4

  /external/llvm/lib/Transforms/Scalar/
LoopRotation.cpp 135 BranchInst *BI = dyn_cast<BranchInst>(OrigHeader->getTerminator());
136 if (!BI || BI->isUnconditional())
190 BasicBlock *Exit = BI->getSuccessor(0);
191 BasicBlock *NewHeader = BI->getSuccessor(1);
266 for (BasicBlock::iterator BI = SuccBB->begin();
267 PHINode *PN = dyn_cast<PHINode>(BI); ++BI)
292 assert(PHBI->isConditional() && "Should be clone of BI condbr!");
498 BranchInst *BI = dyn_cast<BranchInst>(LastExit->getTerminator())
    [all...]
MergedLoadStoreMotion.cpp 201 BranchInst *BI = (BranchInst *)(BB->getTerminator());
202 BasicBlock *Succ0 = BI->getSuccessor(0);
218 BranchInst *BI = (BranchInst *)(BB->getTerminator());
219 BasicBlock *Succ0 = BI->getSuccessor(0);
220 BasicBlock *Succ1 = BI->getSuccessor(1);
361 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator());
362 BasicBlock *Succ0 = BI->getSuccessor(0);
363 BasicBlock *Succ1 = BI->getSuccessor(1);
TailRecursionElimination.cpp     [all...]
  /external/llvm/lib/Transforms/Utils/
BypassSlowDivision.cpp 251 DenseMap<unsigned int, unsigned int>::const_iterator BI = BypassWidths.find(bitwidth);
252 if (BI == BypassWidths.end())
256 IntegerType *BT = IntegerType::get(J->getContext(), BI->second);
FlattenCFG.cpp 178 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI->getIterator();
179 BI != BE;) {
180 Instruction *CI = &*BI++;
242 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator());
243 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition());
251 BI->swapSuccessors();
358 for (BasicBlock::iterator BI(PBI2), BE(PTI2); BI != BE; ++BI) {
359 if (BI->mayReadFromMemory() || BI->mayWriteToMemory())
    [all...]
LoopUnroll.cpp 182 BranchInst *BI = dyn_cast<BranchInst>(LatchBlock->getTerminator());
184 if (!BI || BI->isUnconditional()) {
285 bool ContinueOnTrue = L->contains(BI->getSuccessor(0));
286 BasicBlock *LoopExit = BI->getSuccessor(ContinueOnTrue);
BasicBlockUtils.cpp 136 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE; ++BI) {
137 if (PHINode *PN = dyn_cast<PHINode>(BI)) {
186 /// ReplaceInstWithValue - Replace all uses of an instruction (specified by BI)
190 BasicBlock::iterator &BI, Value *V) {
191 Instruction &I = *BI;
200 BI = BIL.erase(BI);
204 /// ReplaceInstWithInst - Replace the instruction specified by BI with th
    [all...]
CloneFunction.cpp 126 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end();
127 BI != BE; ++BI) {
128 const BasicBlock &BB = *BI;
420 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) {
421 if (BI->isConditional()) {
423 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition());
426 Value *V = VMap[BI->getCondition()];
432 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue());
534 for (const BasicBlock &BI : *OldFunc)
    [all...]
LoopSimplify.cpp 511 if (BranchInst *BI = dyn_cast<BranchInst>((*I)->getTerminator()))
512 if (BI->isConditional()) {
513 if (UndefValue *Cond = dyn_cast<UndefValue>(BI->getCondition())) {
518 BI->setCondition(ConstantInt::get(Cond->getType(),
519 !L->contains(BI->getSuccessor(0))));
631 BranchInst *BI = dyn_cast<BranchInst>(ExitingBlock->getTerminator());
632 if (!BI || !BI->isConditional()) continue;
633 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition());
640 for (BasicBlock::iterator I = ExitingBlock->begin(); &*I != BI; ) {
    [all...]
  /external/llvm/unittests/IR/
IRBuilderTest.cpp 87 BranchInst *BI = Builder.CreateCondBr(Builder.getTrue(), TBB, FBB);
89 EXPECT_EQ(BI, TI);
94 BI->eraseFromParent();
96 BI = Builder.CreateCondBr(Builder.getTrue(), TBB, FBB, Weights);
98 EXPECT_EQ(BI, TI);
  /external/llvm/utils/TableGen/
CodeGenTarget.cpp 357 BitsInit *BI = R->getValueAsBitsInit("Inst");
359 unsigned numBits = BI->getNumBits();
365 Init *OrigBit = BI->getBit(bit);
366 Init *BitSwap = BI->getBit(bitSwapIdx);
372 NewBits[middle] = BI->getBit(middle);
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/net/
DatagramPacketTest.java 36 public void test_Constructor$BI() {
Inet6AddressTest.java 727 public void test_getByAddressLString$BI() throws UnknownHostException {
    [all...]
  /libcore/luni/src/test/java/org/apache/harmony/crypto/tests/javax/crypto/
ExemptionMechanismTest.java 270 public void test_genExemptionBlob$BI() throws InvalidKeyException,
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/lang/
String2Test.java 66 public void test_Constructor$BI() {
427 public void test_getBytesII$BI() {
    [all...]
StringTest.java 94 public void test_Constructor$BI() {
  /external/clang/lib/AST/
APValue.cpp 499 CXXRecordDecl::base_class_const_iterator BI = CD->bases_begin();
500 for (unsigned I = 0; I != N; ++I, ++BI) {
501 assert(BI != CD->bases_end());
504 getStructBase(I).printPretty(Out, Ctx, BI->getType());
  /external/clang/test/Analysis/
derived-to-base.cpp 72 class BI : public virtual Intermediate {
82 class DI : public BI, public CI {};
  /external/llvm/lib/Analysis/
BranchProbabilityInfo.cpp 300 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
301 if (!BI || !BI->isConditional())
304 Value *Cond = BI->getCondition();
391 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
392 if (!BI || !BI->isConditional())
395 Value *Cond = BI->getCondition();
473 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator());
474 if (!BI || !BI->isConditional()
    [all...]
  /external/llvm/lib/IR/
Value.cpp 120 BasicBlock::const_iterator BI = BB->begin(), BE = BB->end();
122 for (; BI != BE && UI != UE; ++BI, ++UI) {
123 // Scan basic block: Check if this Value is used by the instruction at BI.
124 if (std::find(BI->op_begin(), BI->op_end(), this) != BI->op_end())
  /frameworks/compile/slang/
slang.cpp 517 // Type(ai) = Type(bi) must hold;
519 // Name(ai) = Name(bi) must hold;
530 BI = ERT->fields_begin();
533 if ((*AI)->getName() != (*BI)->getName())
536 BI++;
  /libcore/luni/src/test/java/libcore/java/lang/
OldStringTest.java 92 public void test_getBytesII$BI() {
  /external/llvm/lib/CodeGen/
SplitKit.cpp 183 BlockInfo BI;
184 BI.MBB = &*MFI;
186 std::tie(Start, Stop) = LIS.getSlotIndexes()->getMBBRange(BI.MBB);
193 ThroughBlocks.set(BI.MBB->getNumber());
200 BI.FirstInstr = *UseI;
201 assert(BI.FirstInstr >= Start);
204 BI.LastInstr = UseI[-1];
205 assert(BI.LastInstr < Stop);
208 BI.LiveIn = LVI->start <= Start;
211 if (!BI.LiveIn)
    [all...]
StackColoring.cpp 200 LivenessMap::const_iterator BI = BlockLiveness.find(MBB);
201 assert(BI != BlockLiveness.end() && "Block not found");
202 const BlockLifetimeInfo &BlockInfo = BI->second;
304 LivenessMap::iterator BI = BlockLiveness.find(BB);
305 assert(BI != BlockLiveness.end() && "Block not found");
306 BlockLifetimeInfo &BlockInfo = BI->second;
  /external/llvm/lib/Target/AMDGPU/
R600ControlFlowFinalizer.cpp 400 MachineBasicBlock::instr_iterator BI = I.getInstrIterator();
401 while (++BI != E && BI->isBundledWithPred()) {
402 BI->unbundleFromPred();
403 for (unsigned i = 0, e = BI->getNumOperands(); i != e; ++i) {
404 MachineOperand &MO = BI->getOperand(i);
408 getLiteral(&*BI, Literals);
409 ClauseContent.push_back(&*BI);
411 I = BI;

Completed in 726 milliseconds

12 3 4