/external/llvm/lib/Target/ARM/ |
H A D | ARMLoadStoreOptimizer.cpp | 2145 DenseMap<unsigned, SmallVector<MachineInstr*, 4> >::iterator BI = local 2147 if (BI != Base2LdsMap.end()) { 2148 for (unsigned i = 0, e = BI->second.size(); i != e; ++i) { 2149 if (Offset == getMemoryOpOffset(BI->second[i])) { 2155 BI->second.push_back(MI); 2161 DenseMap<unsigned, SmallVector<MachineInstr*, 4> >::iterator BI = local 2163 if (BI != Base2StsMap.end()) { 2164 for (unsigned i = 0, e = BI->second.size(); i != e; ++i) { 2165 if (Offset == getMemoryOpOffset(BI->second[i])) { 2171 BI [all...] |
H A D | ARMFastISel.cpp | 1248 const BranchInst *BI = cast<BranchInst>(I); local 1249 MachineBasicBlock *TBB = FuncInfo.MBBMap[BI->getSuccessor(0)]; 1250 MachineBasicBlock *FBB = FuncInfo.MBBMap[BI->getSuccessor(1)]; 1256 if (const CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition())) { 1283 } else if (TruncInst *TI = dyn_cast<TruncInst>(BI->getCondition())) { 1309 dyn_cast<ConstantInt>(BI->getCondition())) { 1316 unsigned CmpReg = getRegForValue(BI->getCondition());
|
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCFastISel.cpp | 683 const BranchInst *BI = cast<BranchInst>(I); local 685 MachineBasicBlock *TBB = FuncInfo.MBBMap[BI->getSuccessor(0)]; 686 MachineBasicBlock *FBB = FuncInfo.MBBMap[BI->getSuccessor(1)]; 689 if (const CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition())) { 715 dyn_cast<ConstantInt>(BI->getCondition())) {
|
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineCalls.cpp | 959 BasicBlock::iterator BI = SS; local 960 if (&*++BI == II) 967 BasicBlock::iterator BI = II; local 970 for (++BI; &*BI != TI; ++BI) { 971 if (isa<AllocaInst>(BI)) { 975 if (CallInst *BCI = dyn_cast<CallInst>(BI)) {
|
H A D | InstructionCombining.cpp | 777 BranchInst *BI = dyn_cast<BranchInst>(NonConstBB->getTerminator()); local 778 if (!BI || !BI->isUnconditional()) return nullptr; 1930 Instruction *InstCombiner::visitBranchInst(BranchInst &BI) { argument 1935 if (match(&BI, m_Br(m_Not(m_Value(X)), TrueDest, FalseDest)) && 1938 BI.setCondition(X); 1939 BI.swapSuccessors(); 1940 return &BI; 1945 if (match(&BI, m_Br(m_FCmp(FPred, m_Value(X), m_Value(Y)), 1947 BI [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | DataFlowSanitizer.cpp | 786 BranchInst *BI = cast<BranchInst>(SplitBlockAndInsertIfThen( local 788 IRBuilder<> ThenIRB(BI); 887 BranchInst *BI = cast<BranchInst>(SplitBlockAndInsertIfThen( local 889 IRBuilder<> ThenIRB(BI); 895 BasicBlock *Tail = BI->getSuccessor(0);
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | IndVarSimplify.cpp | 1202 static bool isHighCostExpansion(const SCEV *S, BranchInst *BI, argument 1214 ICmpInst *OrigCond = dyn_cast<ICmpInst>(BI->getCondition()); 1232 if (isHighCostExpansion(*I, BI, Processed, SE)) 1271 BranchInst *BI = dyn_cast<BranchInst>(L->getExitingBlock()->getTerminator()); 1272 if (!BI) 1276 if (isHighCostExpansion(BackedgeTakenCount, BI, Processed, SE)) 1328 BranchInst *BI = dyn_cast<BranchInst>(L->getExitingBlock()->getTerminator()); 1329 assert(BI && "expected exit branch"); 1331 return dyn_cast<ICmpInst>(BI->getCondition()); 1550 BranchInst *BI local 1593 BranchInst *BI = cast<BranchInst>(L->getExitingBlock()->getTerminator()); local 1642 BranchInst *BI = cast<BranchInst>(L->getExitingBlock()->getTerminator()); local [all...] |
H A D | GVN.cpp | 716 bool processFoldableCondBr(BranchInst *BI); 2242 if (BranchInst *BI = dyn_cast<BranchInst>(I)) { 2243 if (!BI->isConditional()) 2246 if (isa<Constant>(BI->getCondition())) 2247 return processFoldableCondBr(BI); 2249 Value *BranchCond = BI->getCondition(); 2250 BasicBlock *TrueSucc = BI->getSuccessor(0); 2251 BasicBlock *FalseSucc = BI->getSuccessor(1); 2256 BasicBlock *Parent = BI->getParent(); 2396 // (and incrementing BI befor 2785 processFoldableCondBr(BranchInst *BI) argument [all...] |
/external/opencv/cvaux/include/ |
H A D | cvvidsurv.hpp | 821 int BI = GetBlobIndexByID(pB->ID); local 822 W *= GetConfidence(BI,pB,pImg,pImgFG);
|
/external/chromium_org/third_party/libaddressinput/src/java/src/com/android/i18n/addressinput/ |
H A D | RegionDataConstants.java | 154 BI(new String[]{ enum constant in enum:RegionDataConstants.RegionDataEnum
|
/external/llvm/lib/CodeGen/ |
H A D | CodeGenPrepare.cpp | 307 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); local 308 if (!BI || !BI->isUnconditional()) 313 BasicBlock::iterator BBI = BI; 326 BasicBlock *DestBB = BI->getSuccessor(0); 411 BranchInst *BI = cast<BranchInst>(BB->getTerminator()); local 412 BasicBlock *DestBB = BI->getSuccessor(0); 953 BasicBlock::iterator BI = BB->begin(); local 954 do { ++BI; } while (isa<DbgInfoIntrinsic>(BI)); 961 BasicBlock::iterator BI = BB->begin(); local 1014 BranchInst *BI = dyn_cast<BranchInst>(CallBB->getTerminator()); local [all...] |
/external/llvm/lib/IR/ |
H A D | Instructions.cpp | 773 BranchInst::BranchInst(const BranchInst &BI) : argument 774 TerminatorInst(Type::getVoidTy(BI.getContext()), Instruction::Br, 775 OperandTraits<BranchInst>::op_end(this) - BI.getNumOperands(), 776 BI.getNumOperands()) { 777 Op<-1>() = BI.Op<-1>(); 778 if (BI.getNumOperands() != 1) { 779 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!"); 780 Op<-3>() = BI.Op<-3>(); 781 Op<-2>() = BI.Op<-2>(); 783 SubclassOptionalData = BI [all...] |
/external/llvm/lib/Target/X86/ |
H A D | X86FastISel.cpp | 1332 const BranchInst *BI = cast<BranchInst>(I); local 1333 MachineBasicBlock *TrueMBB = FuncInfo.MBBMap[BI->getSuccessor(0)]; 1334 MachineBasicBlock *FalseMBB = FuncInfo.MBBMap[BI->getSuccessor(1)]; 1340 if (const CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition())) { 1413 BranchWeight = FuncInfo.BPI->getEdgeWeight(BI->getParent(), 1423 } else if (TruncInst *TI = dyn_cast<TruncInst>(BI->getCondition())) { 1454 BranchWeight = FuncInfo.BPI->getEdgeWeight(BI->getParent(), 1460 } else if (foldX86XALUIntrinsic(CC, BI, BI->getCondition())) { 1463 unsigned TmpReg = getRegForValue(BI [all...] |
/external/llvm/lib/Transforms/IPO/ |
H A D | GlobalOpt.cpp | 1365 Instruction *BI = BranchInst::Create(FreeBlock, NextBlock, local 1369 CallInst::CreateFree(GVVal, BI); 2560 if (BranchInst *BI = dyn_cast<BranchInst>(CurInst)) { 2561 if (BI->isUnconditional()) { 2562 NextBB = BI->getSuccessor(0); 2565 dyn_cast<ConstantInt>(getVal(BI->getCondition())); 2568 NextBB = BI->getSuccessor(!Cond->getZExtValue());
|
/external/clang/lib/CodeGen/ |
H A D | CodeGenModule.cpp | 1296 const Builtin::Context &BI; member in struct:__anon17855::FunctionIsDirectlyRecursive 1299 Name(N), BI(C), Result(false) { 1315 StringRef BuiltinName = BI.GetName(BuiltinID);
|
/external/llvm/lib/Transforms/Utils/ |
H A D | 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 510 BranchInst *BI = cast<BranchInst>(TI); local 1001 HoistThenElseCodeToIf(BranchInst *BI, const DataLayout *DL) argument 1394 SpeculativelyExecuteBB(BranchInst *BI, BasicBlock *ThenBB, const DataLayout *DL) argument 1581 BranchInst *BI = cast<BranchInst>(BB->getTerminator()); local 1607 FoldCondBranchOnPHI(BranchInst *BI, const DataLayout *DL) argument 1842 SimplifyCondBranchToTwoReturns(BranchInst *BI, IRBuilder<> &Builder) argument 1931 ExtractBranchMetadata(BranchInst *BI, uint64_t &ProbTrue, uint64_t &ProbFalse) argument 1966 FoldBranchToCommonDest(BranchInst *BI, const DataLayout *DL) argument 2297 SimplifyCondBranchToCondBranch(BranchInst *PBI, BranchInst *BI) argument 2757 SimplifyBranchOnICmpChain(BranchInst *BI, const DataLayout *DL, IRBuilder<> &Builder) argument 2968 BranchInst *BI = CondBranchPreds.pop_back_val(); local 3111 BranchInst *BI = Builder.CreateBr(II->getNormalDest()); local 3994 SimplifyUncondBranch(BranchInst *BI, IRBuilder<> &Builder) argument 4027 SimplifyCondBranch(BranchInst *BI, IRBuilder<> &Builder) argument [all...] |
/external/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 2958 BinaryOperator *BI = dyn_cast_or_null<BinaryOperator>(Rdx); local 2959 if (!BI) 2965 HorRdx.matchAssociativeReduction(P, BI, DL) && 2973 Value *Inst = BI->getOperand(0); 2975 Inst = BI->getOperand(1); 3017 if (BinaryOperator *BI = dyn_cast<BinaryOperator>(CI->getOperand(i))) { 3018 if (tryToVectorizePair(BI->getOperand(0), BI->getOperand(1), R)) {
|
H A D | LoopVectorize.cpp | 2857 BranchInst *BI = dyn_cast<BranchInst>(Src->getTerminator()); local 2858 assert(BI && "Unexpected terminator found"); 2860 if (BI->isConditional()) { 2861 VectorParts EdgeMask = getVectorValue(BI->getCondition()); 2863 if (BI->getSuccessor(0) != Dst) 3321 for (Loop::block_iterator BI = TheLoop->block_begin(), 3322 BE = TheLoop->block_end(); BI != BE; ++BI) { 3323 BasicBlock *BB = *BI; 3338 for (Loop::block_iterator BI [all...] |
/external/valgrind/main/VEX/priv/ |
H A D | host_ppc_defs.c | 3283 static UChar* mkFormB ( UChar* p, UInt BO, UInt BI, argument 3288 vassert(BI < 0x20); 3292 theInstr = ((16<<26) | (BO<<21) | (BI<<16) |
|
H A D | guest_ppc_toIR.c | 1701 Hence in IBM's notation, BI=0 is CR7[SO], BI=1 is CR7[==], etc. 1703 Indexing from BI to guest state: 1705 let n = BI / 4 1706 off = BI % 4 5506 Branch helper function cond_ok = BO[4] | (CR[BI] == BO[3]) 5510 static IRExpr* /* :: Ity_I32 */ branch_cond_ok( UInt BO, UInt BI ) 5519 // ok = (CR[BI] == BO[3]) Note, the following relies on 5522 assign( cr_bi, getCRbit_anywhere( BI, &where ) ); 5550 UChar BI local [all...] |
/external/qemu/disas/ |
H A D | ppc.c | 440 /* The BI field in a B form or XL form instruction. */ 441 #define BI BA 531 /* The condition register number portion of the BI field in a B form 534 BI field. This field is optional. */ 964 in BO field, the "a" bit is 00010 for branch on CR(BI) and 01000 1646 the BI field. */ 1656 /* A BBOYCB_MASK in which the BI field is fixed. */ 1840 bits of the BI field. */ 1856 /* An XL_MASK with the BO, BI and BB fields fixed. */ 1929 /* The BI conditio 437 #define BI macro [all...] |