/external/llvm/include/llvm/IR/ |
H A D | PatternMatch.h | 378 BinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} argument 393 template<typename LHS, typename RHS> 394 inline BinaryOp_match<LHS, RHS, Instruction::Add> 395 m_Add(const LHS &L, const RHS &R) { 396 return BinaryOp_match<LHS, RHS, Instruction::Add>(L, R); 399 template<typename LHS, typename RHS> 400 inline BinaryOp_match<LHS, RHS, Instruction::FAdd> 401 m_FAdd(const LHS &L, const RHS &R) { 402 return BinaryOp_match<LHS, RH 506 OverflowingBinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) argument 599 BinOp2_match(const LHS_t &LHS, const RHS_t &RHS) argument 666 CmpClass_match(PredicateTy &Pred, const LHS_t &LHS, const RHS_t &RHS) argument 704 SelectClass_match(const Cond_t &Cond, const LHS_t &LHS, const RHS_t &RHS) argument 808 not_match(const LHS_t &LHS) argument 818 matchIfNot(Value *LHS, Value *RHS) argument 835 neg_match(const LHS_t &LHS) argument 845 matchIfNeg(Value *LHS, Value *RHS) argument 861 fneg_match(const LHS_t &LHS) argument 871 matchIfFNeg(Value *LHS, Value *RHS) argument 941 MaxMin_match(const LHS_t &LHS, const RHS_t &RHS) argument 957 Value *LHS = Cmp->getOperand(0); local [all...] |
/external/llvm/include/llvm/MC/ |
H A D | MCExpr.h | 409 const MCExpr *LHS, *RHS; member in class:llvm::MCBinaryExpr 412 : MCExpr(MCExpr::Binary), Op(_Op), LHS(_LHS), RHS(_RHS) {} 418 static const MCBinaryExpr *Create(Opcode Op, const MCExpr *LHS, 420 static const MCBinaryExpr *CreateAdd(const MCExpr *LHS, const MCExpr *RHS, argument 422 return Create(Add, LHS, RHS, Ctx); 424 static const MCBinaryExpr *CreateAnd(const MCExpr *LHS, const MCExpr *RHS, argument 426 return Create(And, LHS, RHS, Ctx); 428 static const MCBinaryExpr *CreateDiv(const MCExpr *LHS, const MCExpr *RHS, argument 430 return Create(Div, LHS, RHS, Ctx); 432 static const MCBinaryExpr *CreateEQ(const MCExpr *LHS, cons argument 436 CreateGT(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 440 CreateGTE(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 444 CreateLAnd(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 448 CreateLOr(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 452 CreateLT(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 456 CreateLTE(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 460 CreateMod(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 464 CreateMul(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 468 CreateNE(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 472 CreateOr(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 476 CreateShl(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 480 CreateShr(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 484 CreateSub(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 488 CreateXor(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument [all...] |
/external/llvm/include/llvm/TableGen/ |
H A D | Record.h | 888 Init *LHS; member in class:llvm::UnOpInit 891 : OpInit(IK_UnOpInit, Type), Opc(opc), LHS(lhs) {} 916 Init *getOperand() const { return LHS; } 935 Init *LHS, *RHS; member in class:llvm::BinOpInit 938 OpInit(IK_BinOpInit, Type), Opc(opc), LHS(lhs), RHS(rhs) {} 968 Init *getLHS() const { return LHS; } 988 Init *LHS, *MHS, *RHS; member in class:llvm::TernOpInit 992 OpInit(IK_TernOpInit, Type), Opc(opc), LHS(lhs), MHS(mhs), RHS(rhs) {} 1027 Init *getLHS() const { return LHS; } 1716 bool operator()(const Record *LHS, cons argument [all...] |
/external/llvm/lib/Analysis/ |
H A D | InstructionSimplify.cpp | 78 /// isSameCompare - Is V equivalent to the comparison "LHS Pred RHS"? 79 static bool isSameCompare(Value *V, CmpInst::Predicate Pred, Value *LHS, argument 86 if (CPred == Pred && CLHS == LHS && CRHS == RHS) 89 CRHS == LHS; 125 /// given by OpcodeToExpand, while "A" corresponds to LHS and "B op' C" to RHS. 128 static Value *ExpandBinOp(unsigned Opcode, Value *LHS, Value *RHS, argument 137 if (BinaryOperator *Op0 = dyn_cast<BinaryOperator>(LHS)) 145 // If "L op' R" equals "A op' B" then "L op' R" is just the LHS. 149 return LHS; 163 Value *A = LHS, * 187 SimplifyAssociativeBinOp(unsigned Opc, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 286 ThreadBinOpOverSelect(unsigned Opcode, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 358 ThreadCmpOverSelect(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 440 ThreadBinOpOverPHI(unsigned Opcode, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 483 ThreadCmpOverPHI(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 638 computePointerDifference(const DataLayout *DL, Value *LHS, Value *RHS) argument 1637 ExtractEquivalentCondition(Value *V, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 1682 computePointerICmp(const DataLayout *DL, const TargetLibraryInfo *TLI, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 1810 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 2610 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const DataLayout *DL, const TargetLibraryInfo *TLI, const DominatorTree *DT) argument 2620 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 2707 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const DataLayout *DL, const TargetLibraryInfo *TLI, const DominatorTree *DT) argument 2888 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 2951 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const DataLayout *DL, const TargetLibraryInfo *TLI, const DominatorTree *DT) argument 2959 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 2966 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const DataLayout *DL, const TargetLibraryInfo *TLI, const DominatorTree *DT) argument [all...] |
H A D | ScalarEvolution.cpp | 454 /// SCEVComplexityCompare - Return true if the complexity of the LHS is less 462 // Return true or false if LHS is less than, or at least RHS, respectively. 463 bool operator()(const SCEV *LHS, const SCEV *RHS) const { argument 464 return compare(LHS, RHS) < 0; 467 // Return negative, zero, or positive, if LHS is less than, equal to, or 470 int compare(const SCEV *LHS, const SCEV *RHS) const { argument 472 if (LHS == RHS) 476 unsigned LType = LHS->getSCEVType(), RType = RHS->getSCEVType(); 485 const SCEVUnknown *LU = cast<SCEVUnknown>(LHS); 537 const SCEVConstant *LC = cast<SCEVConstant>(LHS); 644 const SCEV *&LHS = Ops[0], *&RHS = Ops[1]; local 1483 operator ()(const APInt &LHS, const APInt &RHS) const argument [all...] |
H A D | ScalarEvolutionExpander.cpp | 153 Value *LHS, Value *RHS) { 155 if (Constant *CLHS = dyn_cast<Constant>(LHS)) 171 if (IP->getOpcode() == (unsigned)Opcode && IP->getOperand(0) == LHS && 184 if (!L->isLoopInvariant(LHS) || !L->isLoopInvariant(RHS)) break; 193 Instruction *BO = cast<Instruction>(Builder.CreateBinOp(Opcode, LHS, RHS)); 675 bool operator()(std::pair<const Loop *, const SCEV *> LHS, argument 678 if (LHS.second->getType()->isPointerTy() != 680 return LHS.second->getType()->isPointerTy(); 683 if (LHS.first != RHS.first) 684 return PickMostRelevantLoop(LHS 152 InsertBinop(Instruction::BinaryOps Opcode, Value *LHS, Value *RHS) argument 818 Value *LHS = expandCodeFor(S->getLHS(), Ty); local 1531 Value *LHS = expand(S->getOperand(S->getNumOperands()-1)); local 1555 Value *LHS = expand(S->getOperand(S->getNumOperands()-1)); local [all...] |
/external/llvm/lib/Bitcode/Reader/ |
H A D | BitcodeReader.cpp | 1366 Constant *LHS = ValueList.getConstantFwdRef(Record[1], CurTy); local 1386 V = ConstantExpr::get(Opc, LHS, RHS, Flags); 2364 Value *LHS, *RHS; local 2365 if (getValueTypePair(Record, OpNum, NextValueNo, LHS) || 2366 popValue(Record, OpNum, NextValueNo, LHS->getType(), RHS) || 2370 int Opc = GetDecodedBinaryOpcode(Record[OpNum++], LHS->getType()); 2373 I = BinaryOperator::Create((Instruction::BinaryOps)Opc, LHS, RHS); 2587 Value *LHS, *RHS; local 2588 if (getValueTypePair(Record, OpNum, NextValueNo, LHS) || 2589 popValue(Record, OpNum, NextValueNo, LHS [all...] |
/external/llvm/lib/CodeGen/ |
H A D | RegisterCoalescer.cpp | 1983 LiveInterval &LHS = LIS->getInterval(CP.getDstReg()); local 1985 JoinVals LHSVals(LHS, CP.getDstIdx(), NewVNInfo, CP, LIS, TRI); 1988 << "\n\t\tLHS = " << LHS local 2018 // Join RHS into LHS. 2019 LHS.join(RHS, LHSVals.getAssignments(), RHSVals.getAssignments(), NewVNInfo); 2024 MRI->clearKillFlags(LHS.reg); 2033 << " points: " << LHS << '\n'); 2034 LIS->extendToIndices(LHS, EndPoints); 2060 static int compareMBBPriority(const MBBPriorityInfo *LHS, argument 2063 if (LHS [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGISel.cpp | 1609 bool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, argument 1612 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1625 if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 1638 bool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, argument 1641 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1656 CurDAG->computeKnownBits(LHS, KnownZero, KnownOne);
|
/external/llvm/lib/IR/ |
H A D | DebugInfo.cpp | 658 static void VerifySubsetOf(const MDNode *LHS, const MDNode *RHS) { argument 659 for (unsigned i = 0; i != LHS->getNumOperands(); ++i) { 661 if (i == 0 && isa<ConstantInt>(LHS->getOperand(i))) 663 const MDNode *E = cast<MDNode>(LHS->getOperand(i));
|
/external/llvm/lib/MC/ |
H A D | MCDwarf.cpp | 1559 static bool isEqual(const CIEKey &LHS, argument 1561 return LHS.Personality == RHS.Personality && 1562 LHS.PersonalityEncoding == RHS.PersonalityEncoding && 1563 LHS.LsdaEncoding == RHS.LsdaEncoding && 1564 LHS.IsSignalFrame == RHS.IsSignalFrame && 1565 LHS.IsSimple == RHS.IsSimple;
|
/external/llvm/lib/Support/ |
H A D | CommandLine.cpp | 238 StringRef &LHS = SplitArg.first; // LHS == Arg when no '=' is present. local 253 StringRef Flag = PermitValue ? LHS : Arg; 1401 static int OptNameCompare(const void *LHS, const void *RHS) { argument 1404 return strcmp(((const pair_ty*)LHS)->first, ((const pair_ty*)RHS)->first);
|
/external/llvm/lib/TableGen/ |
H A D | Record.cpp | 72 static bool isEqual(const TableGenStringKey& LHS, argument 74 return LHS.str() == RHS.str(); 755 if (StringInit *LHSs = dyn_cast<StringInit>(LHS)) 758 if (DefInit *LHSd = dyn_cast<DefInit>(LHS)) 761 if (IntInit *LHSi = dyn_cast<IntInit>(LHS)) 764 if (StringInit *LHSs = dyn_cast<StringInit>(LHS)) { 813 if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) { 820 if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) { 834 if (ListInit *LHSl = dyn_cast<ListInit>(LHS)) { 841 if (StringInit *LHSs = dyn_cast<StringInit>(LHS)) { 1030 EvaluateOperation(OpInit *RHSo, Init *LHS, Init *Arg, RecTy *Type, Record *CurRec, MultiClass *CurMultiClass) argument 1068 ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type, Record *CurRec, MultiClass *CurMultiClass) argument [all...] |
H A D | TGParser.cpp | 836 Init *LHS = ParseValue(CurRec); local 837 if (!LHS) return nullptr; 842 ListInit *LHSl = dyn_cast<ListInit>(LHS); 843 StringInit *LHSs = dyn_cast<StringInit>(LHS); 844 TypedInit *LHSt = dyn_cast<TypedInit>(LHS); 902 return (UnOpInit::get(Code, LHS, Type))->Fold(CurRec, CurMultiClass); 1020 Init *LHS = ParseValue(CurRec); local 1021 if (!LHS) return nullptr; 1109 return (TernOpInit::get(Code, LHS, MHS, RHS, Type))->Fold(CurRec, 1539 TypedInit *LHS local [all...] |
/external/llvm/lib/Target/ARM/ |
H A D | ARMConstantIslandPass.cpp | 845 static bool CompareMBBNumbers(const MachineBasicBlock *LHS, argument 847 return LHS->getNumber() < RHS->getNumber();
|
/external/llvm/lib/Target/Mips/ |
H A D | MipsConstantIslandPass.cpp | 847 static bool CompareMBBNumbers(const MachineBasicBlock *LHS, argument 849 return LHS->getNumber() < RHS->getNumber();
|
/external/llvm/lib/Target/NVPTX/ |
H A D | NVPTXAsmPrinter.cpp | 239 const MCExpr *LHS = LowerConstant(CE->getOperand(0), AP); local 245 return MCBinaryExpr::CreateAdd(LHS, RHS, Ctx); 247 return MCBinaryExpr::CreateSub(LHS, RHS, Ctx); 249 return MCBinaryExpr::CreateMul(LHS, RHS, Ctx); 251 return MCBinaryExpr::CreateDiv(LHS, RHS, Ctx); 253 return MCBinaryExpr::CreateMod(LHS, RHS, Ctx); 255 return MCBinaryExpr::CreateShl(LHS, RHS, Ctx); 257 return MCBinaryExpr::CreateAnd(LHS, RHS, Ctx); 259 return MCBinaryExpr::CreateOr(LHS, RHS, Ctx); 261 return MCBinaryExpr::CreateXor(LHS, RH [all...] |
/external/llvm/lib/Target/PowerPC/AsmParser/ |
H A D | PPCAsmParser.cpp | 1072 const MCExpr *LHS = ExtractModifierFromExpr(BE->getLHS(), LHSVariant); local 1075 if (!LHS && !RHS) 1078 if (!LHS) LHS = BE->getLHS(); 1090 return MCBinaryExpr::Create(BE->getOpcode(), LHS, RHS, Context); 1137 const MCExpr *LHS = FixupVariantKind(BE->getLHS()); local 1139 if (LHS == BE->getLHS() && RHS == BE->getRHS()) 1141 return MCBinaryExpr::Create(BE->getOpcode(), LHS, RHS, Context);
|
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCISelDAGToDAG.cpp | 121 SDValue SelectCC(SDValue LHS, SDValue RHS, ISD::CondCode CC, SDLoc dl); 433 // If the LHS has a foldable shift and the RHS does not, then swap it to the 492 SDValue PPCDAGToDAGISel::SelectCC(SDValue LHS, SDValue RHS, argument 494 // Always select the LHS. 497 if (LHS.getValueType() == MVT::i32) { 503 return SDValue(CurDAG->getMachineNode(PPC::CMPLWI, dl, MVT::i32, LHS, 507 return SDValue(CurDAG->getMachineNode(PPC::CMPWI, dl, MVT::i32, LHS, 519 SDValue Xor(CurDAG->getMachineNode(PPC::XORIS, dl, MVT::i32, LHS, 527 return SDValue(CurDAG->getMachineNode(PPC::CMPLWI, dl, MVT::i32, LHS, 533 return SDValue(CurDAG->getMachineNode(PPC::CMPWI, dl, MVT::i32, LHS, 825 SDValue LHS = N->getOperand(0); local [all...] |
/external/llvm/lib/Target/R600/ |
H A D | R600ISelLowering.cpp | 897 SDValue LHS = N->getOperand(0); local 898 SDValue LHS_Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, DL, HalfVT, LHS, zero); 899 SDValue LHS_Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, DL, HalfVT, LHS, one); 1157 SDValue LHS = Op.getOperand(0); local 1164 // LHS and RHS are guaranteed to be the same value type 1165 EVT CompareVT = LHS.getValueType(); 1190 std::swap(LHS, RHS); 1199 return DAG.getNode(ISD::SELECT_CC, DL, VT, LHS, RHS, True, False, CC); 1213 if (isZero(LHS)) { 1218 std::swap(LHS, RH [all...] |
H A D | SIISelLowering.cpp | 912 SDValue LHS = DAG.getNode(ISD::BITCAST, DL, MVT::v2i32, Op.getOperand(1)); local 915 SDValue Lo0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::i32, LHS, Zero); 920 SDValue Hi0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::i32, LHS, One);
|
/external/llvm/lib/Target/XCore/ |
H A D | XCoreISelLowering.cpp | 566 SDValue LHS = Op.getOperand(0); local 571 LHS, RHS); 583 SDValue LHS = Op.getOperand(0); local 587 DAG.getVTList(MVT::i32, MVT::i32), LHS, RHS,
|
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineAddSub.cpp | 894 /// (sext (add LHS, RHS)) === (add (sext LHS), (sext RHS)) 898 bool InstCombiner::WillNotOverflowSignedAdd(Value *LHS, Value *RHS) { argument 902 // If LHS and RHS each have at least two sign bits, the addition will look 916 if (ComputeNumSignBits(LHS) > 1 && ComputeNumSignBits(RHS) > 1) 919 if (IntegerType *IT = dyn_cast<IntegerType>(LHS->getType())) { 923 computeKnownBits(LHS, LHSKnownZero, LHSKnownOne); 945 /// (zext (add LHS, RHS)) === (add (zext LHS), (zext RHS)) 946 bool InstCombiner::WillNotOverflowUnsignedAdd(Value *LHS, Valu argument 966 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local 1022 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local 1274 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local 1384 OptimizePointerDifference(Value *LHS, Value *RHS, Type *Ty) argument [all...] |
H A D | InstCombineAndOrXor.cpp | 89 static Value *getNewICmpValue(bool Sign, unsigned Code, Value *LHS, Value *RHS, argument 92 if (Value *NewConstant = getICmpValue(Sign, Code, LHS, RHS, NewPred)) 94 return Builder->CreateICmp(NewPred, LHS, RHS); 101 Value *LHS, Value *RHS, 114 if (!isordered) return ConstantInt::getTrue(LHS->getContext()); 117 return Builder->CreateFCmp(Pred, LHS, RHS); 322 /// FoldLogicalPlusAnd - This is part of an expression (LHS +/- RHS) & Mask, 332 Value *InstCombiner::FoldLogicalPlusAnd(Value *LHS, Value *RHS, argument 335 Instruction *LHSI = dyn_cast<Instruction>(LHS); 553 /// that both LHS an 100 getFCmpValue(bool isordered, unsigned code, Value *LHS, Value *RHS, InstCombiner::BuilderTy *Builder) argument 554 foldLogOpOfMaskedICmpsHelper(Value*& A, Value*& B, Value*& C, Value*& D, Value*& E, ICmpInst *LHS, ICmpInst *RHS, ICmpInst::Predicate &LHSCC, ICmpInst::Predicate &RHSCC) argument 668 foldLogOpOfMaskedICmps(ICmpInst *LHS, ICmpInst *RHS, bool IsAnd, llvm::InstCombiner::BuilderTy* Builder) argument 791 FoldAndOfICmps(ICmpInst *LHS, ICmpInst *RHS) argument 1027 FoldAndOfFCmps(FCmpInst *LHS, FCmpInst *RHS) argument 1557 FoldOrOfICmps(ICmpInst *LHS, ICmpInst *RHS) argument 1823 FoldOrOfFCmps(FCmpInst *LHS, FCmpInst *RHS) argument [all...] |
H A D | InstCombineCalls.cpp | 353 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1); local 358 computeKnownBits(LHS, LHSKnownZero, LHSKnownOne); 371 Value *Add = Builder->CreateAdd(LHS, RHS); 374 UndefValue::get(LHS->getType()), 385 Value *Add = Builder->CreateNUWAdd(LHS, RHS); 388 UndefValue::get(LHS->getType()), 402 Value *LHS = II->getArgOperand(0); local 404 II->setArgOperand(1, LHS); 428 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1); local 429 if (WillNotOverflowSignedAdd(LHS, RH 462 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1); local 494 Value *LHS = II->getArgOperand(0); local [all...] |