/external/clang/include/clang/Edit/ |
H A D | FileOffset.h | 37 friend bool operator==(FileOffset LHS, FileOffset RHS) { argument 38 return LHS.FID == RHS.FID && LHS.Offs == RHS.Offs; 40 friend bool operator!=(FileOffset LHS, FileOffset RHS) { argument 41 return !(LHS == RHS); 43 friend bool operator<(FileOffset LHS, FileOffset RHS) { argument 44 if (LHS.FID != RHS.FID) 45 return LHS.FID < RHS.FID; 46 return LHS.Offs < RHS.Offs; 48 friend bool operator>(FileOffset LHS, FileOffse argument 53 operator >=(FileOffset LHS, FileOffset RHS) argument 56 operator <=(FileOffset LHS, FileOffset RHS) argument [all...] |
/external/clang/include/clang/Basic/ |
H A D | ABI.h | 51 friend bool operator==(const ReturnAdjustment &LHS, argument 53 return LHS.NonVirtual == RHS.NonVirtual && 54 LHS.VBaseOffsetOffset == RHS.VBaseOffsetOffset; 57 friend bool operator<(const ReturnAdjustment &LHS, argument 59 if (LHS.NonVirtual < RHS.NonVirtual) 62 return LHS.NonVirtual == RHS.NonVirtual && 63 LHS.VBaseOffsetOffset < RHS.VBaseOffsetOffset; 81 friend bool operator==(const ThisAdjustment &LHS, argument 83 return LHS.NonVirtual == RHS.NonVirtual && 84 LHS 87 operator <(const ThisAdjustment &LHS, const ThisAdjustment &RHS) argument 111 operator ==(const ThunkInfo &LHS, const ThunkInfo &RHS) argument 115 operator <(const ThunkInfo &LHS, const ThunkInfo &RHS) argument [all...] |
H A D | SourceLocation.h | 177 inline bool operator==(const SourceLocation &LHS, const SourceLocation &RHS) { argument 178 return LHS.getRawEncoding() == RHS.getRawEncoding(); 181 inline bool operator!=(const SourceLocation &LHS, const SourceLocation &RHS) { argument 182 return !(LHS == RHS); 185 inline bool operator<(const SourceLocation &LHS, const SourceLocation &RHS) { argument 186 return LHS.getRawEncoding() < RHS.getRawEncoding(); 341 operator==(const FullSourceLoc &LHS, const FullSourceLoc &RHS) { argument 342 return LHS.getRawEncoding() == RHS.getRawEncoding() && 343 LHS.SrcMgr == RHS.SrcMgr; 347 operator!=(const FullSourceLoc &LHS, cons argument 417 isEqual(clang::FileID LHS, clang::FileID RHS) argument [all...] |
/external/llvm/include/llvm/Support/ |
H A D | PatternMatch.h | 297 BinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} argument 312 template<typename LHS, typename RHS> 313 inline BinaryOp_match<LHS, RHS, Instruction::Add> 314 m_Add(const LHS &L, const RHS &R) { 315 return BinaryOp_match<LHS, RHS, Instruction::Add>(L, R); 318 template<typename LHS, typename RHS> 319 inline BinaryOp_match<LHS, RHS, Instruction::FAdd> 320 m_FAdd(const LHS &L, const RHS &R) { 321 return BinaryOp_match<LHS, RH 428 BinOp2_match(const LHS_t &LHS, const RHS_t &RHS) argument 495 CmpClass_match(PredicateTy &Pred, const LHS_t &LHS, const RHS_t &RHS) argument 533 SelectClass_match(const Cond_t &Cond, const LHS_t &LHS, const RHS_t &RHS) argument 624 not_match(const LHS_t &LHS) argument 634 matchIfNot(Value *LHS, Value *RHS) argument 651 neg_match(const LHS_t &LHS) argument 661 matchIfNeg(Value *LHS, Value *RHS) argument 677 fneg_match(const LHS_t &LHS) argument 687 matchIfFNeg(Value *LHS, Value *RHS) argument 738 MaxMin_match(const LHS_t &LHS, const RHS_t &RHS) argument 754 Value *LHS = Cmp->getOperand(0); local [all...] |
H A D | NoFolder.h | 40 Instruction *CreateAdd(Constant *LHS, Constant *RHS, argument 42 BinaryOperator *BO = BinaryOperator::CreateAdd(LHS, RHS); 47 Instruction *CreateNSWAdd(Constant *LHS, Constant *RHS) const { argument 48 return BinaryOperator::CreateNSWAdd(LHS, RHS); 50 Instruction *CreateNUWAdd(Constant *LHS, Constant *RHS) const { argument 51 return BinaryOperator::CreateNUWAdd(LHS, RHS); 53 Instruction *CreateFAdd(Constant *LHS, Constant *RHS) const { argument 54 return BinaryOperator::CreateFAdd(LHS, RHS); 56 Instruction *CreateSub(Constant *LHS, Constant *RHS, argument 58 BinaryOperator *BO = BinaryOperator::CreateSub(LHS, RH 63 CreateNSWSub(Constant *LHS, Constant *RHS) const argument 66 CreateNUWSub(Constant *LHS, Constant *RHS) const argument 69 CreateFSub(Constant *LHS, Constant *RHS) const argument 72 CreateMul(Constant *LHS, Constant *RHS, bool HasNUW = false, bool HasNSW = false) const argument 79 CreateNSWMul(Constant *LHS, Constant *RHS) const argument 82 CreateNUWMul(Constant *LHS, Constant *RHS) const argument 85 CreateFMul(Constant *LHS, Constant *RHS) const argument 88 CreateUDiv(Constant *LHS, Constant *RHS, bool isExact = false) const argument 94 CreateExactUDiv(Constant *LHS, Constant *RHS) const argument 97 CreateSDiv(Constant *LHS, Constant *RHS, bool isExact = false) const argument 103 CreateExactSDiv(Constant *LHS, Constant *RHS) const argument 106 CreateFDiv(Constant *LHS, Constant *RHS) const argument 109 CreateURem(Constant *LHS, Constant *RHS) const argument 112 CreateSRem(Constant *LHS, Constant *RHS) const argument 115 CreateFRem(Constant *LHS, Constant *RHS) const argument 118 CreateShl(Constant *LHS, Constant *RHS, bool HasNUW = false, bool HasNSW = false) const argument 125 CreateLShr(Constant *LHS, Constant *RHS, bool isExact = false) const argument 131 CreateAShr(Constant *LHS, Constant *RHS, bool isExact = false) const argument 137 CreateAnd(Constant *LHS, Constant *RHS) const argument 140 CreateOr(Constant *LHS, Constant *RHS) const argument 143 CreateXor(Constant *LHS, Constant *RHS) const argument 147 CreateBinOp(Instruction::BinaryOps Opc, Constant *LHS, Constant *RHS) const argument 253 CreateICmp(CmpInst::Predicate P, Constant *LHS, Constant *RHS) const argument 257 CreateFCmp(CmpInst::Predicate P, Constant *LHS, Constant *RHS) const argument [all...] |
H A D | ConstantFolder.h | 34 Constant *CreateAdd(Constant *LHS, Constant *RHS, argument 36 return ConstantExpr::getAdd(LHS, RHS, HasNUW, HasNSW); 38 Constant *CreateFAdd(Constant *LHS, Constant *RHS) const { argument 39 return ConstantExpr::getFAdd(LHS, RHS); 41 Constant *CreateSub(Constant *LHS, Constant *RHS, argument 43 return ConstantExpr::getSub(LHS, RHS, HasNUW, HasNSW); 45 Constant *CreateFSub(Constant *LHS, Constant *RHS) const { argument 46 return ConstantExpr::getFSub(LHS, RHS); 48 Constant *CreateMul(Constant *LHS, Constant *RHS, argument 50 return ConstantExpr::getMul(LHS, RH 52 CreateFMul(Constant *LHS, Constant *RHS) const argument 55 CreateUDiv(Constant *LHS, Constant *RHS, bool isExact = false) const argument 59 CreateSDiv(Constant *LHS, Constant *RHS, bool isExact = false) const argument 63 CreateFDiv(Constant *LHS, Constant *RHS) const argument 66 CreateURem(Constant *LHS, Constant *RHS) const argument 69 CreateSRem(Constant *LHS, Constant *RHS) const argument 72 CreateFRem(Constant *LHS, Constant *RHS) const argument 75 CreateShl(Constant *LHS, Constant *RHS, bool HasNUW = false, bool HasNSW = false) const argument 79 CreateLShr(Constant *LHS, Constant *RHS, bool isExact = false) const argument 83 CreateAShr(Constant *LHS, Constant *RHS, bool isExact = false) const argument 87 CreateAnd(Constant *LHS, Constant *RHS) const argument 90 CreateOr(Constant *LHS, Constant *RHS) const argument 93 CreateXor(Constant *LHS, Constant *RHS) const argument 97 CreateBinOp(Instruction::BinaryOps Opc, Constant *LHS, Constant *RHS) const argument 194 CreateICmp(CmpInst::Predicate P, Constant *LHS, Constant *RHS) const argument 198 CreateFCmp(CmpInst::Predicate P, Constant *LHS, Constant *RHS) const argument [all...] |
H A D | TargetFolder.h | 50 Constant *CreateAdd(Constant *LHS, Constant *RHS, argument 52 return Fold(ConstantExpr::getAdd(LHS, RHS, HasNUW, HasNSW)); 54 Constant *CreateFAdd(Constant *LHS, Constant *RHS) const { argument 55 return Fold(ConstantExpr::getFAdd(LHS, RHS)); 57 Constant *CreateSub(Constant *LHS, Constant *RHS, argument 59 return Fold(ConstantExpr::getSub(LHS, RHS, HasNUW, HasNSW)); 61 Constant *CreateFSub(Constant *LHS, Constant *RHS) const { argument 62 return Fold(ConstantExpr::getFSub(LHS, RHS)); 64 Constant *CreateMul(Constant *LHS, Constant *RHS, argument 66 return Fold(ConstantExpr::getMul(LHS, RH 68 CreateFMul(Constant *LHS, Constant *RHS) const argument 71 CreateUDiv(Constant *LHS, Constant *RHS, bool isExact = false) const argument 74 CreateSDiv(Constant *LHS, Constant *RHS, bool isExact = false) const argument 77 CreateFDiv(Constant *LHS, Constant *RHS) const argument 80 CreateURem(Constant *LHS, Constant *RHS) const argument 83 CreateSRem(Constant *LHS, Constant *RHS) const argument 86 CreateFRem(Constant *LHS, Constant *RHS) const argument 89 CreateShl(Constant *LHS, Constant *RHS, bool HasNUW = false, bool HasNSW = false) const argument 93 CreateLShr(Constant *LHS, Constant *RHS, bool isExact = false) const argument 96 CreateAShr(Constant *LHS, Constant *RHS, bool isExact = false) const argument 99 CreateAnd(Constant *LHS, Constant *RHS) const argument 102 CreateOr(Constant *LHS, Constant *RHS) const argument 105 CreateXor(Constant *LHS, Constant *RHS) const argument 109 CreateBinOp(Instruction::BinaryOps Opc, Constant *LHS, Constant *RHS) const argument 211 CreateICmp(CmpInst::Predicate P, Constant *LHS, Constant *RHS) const argument 215 CreateFCmp(CmpInst::Predicate P, Constant *LHS, Constant *RHS) const argument [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | Twine.h | 150 /// LHS - The prefix in the concatenation, which may be uninitialized for 152 Child LHS; member in class:llvm::Twine 173 LHS.twine = &_LHS; 181 : LHS(_LHS), RHS(_RHS), LHSKind(_LHSKind), RHSKind(_RHSKind) { 221 // The RHS cannot be non-empty if the LHS is empty. 227 !LHS.twine->isBinary()) 266 LHS.cString = Str; 277 LHS.stdString = &Str; 284 LHS.stringRef = &Str; 291 LHS 375 Child LHS, RHS; local 498 operator +(const Twine &LHS, const Twine &RHS) argument 505 operator +(const char *LHS, const StringRef &RHS) argument 512 operator +(const StringRef &LHS, const char *RHS) argument [all...] |
H A D | DenseMapInfo.h | 27 //static bool isEqual(const T &LHS, const T &RHS); 47 static bool isEqual(const T *LHS, const T *RHS) { return LHS == RHS; } argument 55 static bool isEqual(const char &LHS, const char &RHS) { argument 56 return LHS == RHS; 65 static bool isEqual(const unsigned& LHS, const unsigned& RHS) { argument 66 return LHS == RHS; 77 static bool isEqual(const unsigned long& LHS, const unsigned long& RHS) { argument 78 return LHS == RHS; 89 static bool isEqual(const unsigned long long& LHS, argument 100 isEqual(const int& LHS, const int& RHS) argument 114 isEqual(const long& LHS, const long& RHS) argument 126 isEqual(const long long& LHS, const long long& RHS) argument 160 isEqual(const Pair &LHS, const Pair &RHS) argument [all...] |
H A D | Triple.h | 259 unsigned LHS[3]; local 260 getOSVersion(LHS[0], LHS[1], LHS[2]); 262 if (LHS[0] != Major) 263 return LHS[0] < Major; 264 if (LHS[1] != Minor) 265 return LHS[1] < Minor; 266 if (LHS[2] != Micro) 267 return LHS[ [all...] |
/external/clang/test/SemaCXX/ |
H A D | warn-self-assign.cpp | 18 #define LHS a macro 23 LHS = a; 25 LHS OP RHS; 27 #undef LHS macro
|
/external/llvm/include/llvm/MC/ |
H A D | MCExpr.h | 338 const MCExpr *LHS, *RHS; member in class:llvm::MCBinaryExpr 341 : MCExpr(MCExpr::Binary), Op(_Op), LHS(_LHS), RHS(_RHS) {} 347 static const MCBinaryExpr *Create(Opcode Op, const MCExpr *LHS, 349 static const MCBinaryExpr *CreateAdd(const MCExpr *LHS, const MCExpr *RHS, argument 351 return Create(Add, LHS, RHS, Ctx); 353 static const MCBinaryExpr *CreateAnd(const MCExpr *LHS, const MCExpr *RHS, argument 355 return Create(And, LHS, RHS, Ctx); 357 static const MCBinaryExpr *CreateDiv(const MCExpr *LHS, const MCExpr *RHS, argument 359 return Create(Div, LHS, RHS, Ctx); 361 static const MCBinaryExpr *CreateEQ(const MCExpr *LHS, cons argument 365 CreateGT(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 369 CreateGTE(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 373 CreateLAnd(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 377 CreateLOr(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 381 CreateLT(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 385 CreateLTE(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 389 CreateMod(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 393 CreateMul(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 397 CreateNE(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 401 CreateOr(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 405 CreateShl(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 409 CreateShr(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 413 CreateSub(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 417 CreateXor(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument [all...] |
/external/clang/include/clang/AST/ |
H A D | BaseSubobject.h | 46 friend bool operator==(const BaseSubobject &LHS, const BaseSubobject &RHS) { argument 47 return LHS.Base == RHS.Base && LHS.BaseOffset == RHS.BaseOffset; 74 static bool isEqual(const clang::BaseSubobject &LHS, argument 76 return LHS == RHS;
|
H A D | TypeOrdering.h | 51 static bool isEqual(clang::QualType LHS, clang::QualType RHS) { argument 52 return LHS == RHS; 71 static bool isEqual(clang::CanQualType LHS, clang::CanQualType RHS) { argument 72 return LHS == RHS;
|
/external/llvm/lib/CodeGen/ |
H A D | MachineModuleInfoImpls.cpp | 27 static int SortSymbolPair(const void *LHS, const void *RHS) { argument 29 const MCSymbol *LHSS = ((const PairTy *)LHS)->first;
|
/external/llvm/include/llvm/ |
H A D | IRBuilder.h | 521 Value *LHS, Value *RHS, 524 BinaryOperator *BO = Insert(BinaryOperator::Create(Opc, LHS, RHS), Name); 538 Value *CreateAdd(Value *LHS, Value *RHS, const Twine &Name = "", argument 540 if (Constant *LC = dyn_cast<Constant>(LHS)) 543 return CreateInsertNUWNSWBinOp(Instruction::Add, LHS, RHS, Name, 546 Value *CreateNSWAdd(Value *LHS, Value *RHS, const Twine &Name = "") { argument 547 return CreateAdd(LHS, RHS, Name, false, true); 549 Value *CreateNUWAdd(Value *LHS, Value *RHS, const Twine &Name = "") { argument 550 return CreateAdd(LHS, RHS, Name, true, false); 552 Value *CreateFAdd(Value *LHS, Valu argument 520 CreateInsertNUWNSWBinOp(BinaryOperator::BinaryOps Opc, Value *LHS, Value *RHS, const Twine &Name, bool HasNUW, bool HasNSW) argument 560 CreateSub(Value *LHS, Value *RHS, const Twine &Name = Ó, bool HasNUW = false, bool HasNSW = false) argument 568 CreateNSWSub(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 571 CreateNUWSub(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 574 CreateFSub(Value *LHS, Value *RHS, const Twine &Name = Ó, MDNode *FPMathTag = 0) argument 582 CreateMul(Value *LHS, Value *RHS, const Twine &Name = Ó, bool HasNUW = false, bool HasNSW = false) argument 590 CreateNSWMul(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 593 CreateNUWMul(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 596 CreateFMul(Value *LHS, Value *RHS, const Twine &Name = Ó, MDNode *FPMathTag = 0) argument 604 CreateUDiv(Value *LHS, Value *RHS, const Twine &Name = Ó, bool isExact = false) argument 613 CreateExactUDiv(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 616 CreateSDiv(Value *LHS, Value *RHS, const Twine &Name = Ó, bool isExact = false) argument 625 CreateExactSDiv(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 628 CreateFDiv(Value *LHS, Value *RHS, const Twine &Name = Ó, MDNode *FPMathTag = 0) argument 636 CreateURem(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 642 CreateSRem(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 648 CreateFRem(Value *LHS, Value *RHS, const Twine &Name = Ó, MDNode *FPMathTag = 0) argument 657 CreateShl(Value *LHS, Value *RHS, const Twine &Name = Ó, bool HasNUW = false, bool HasNSW = false) argument 665 CreateShl(Value *LHS, const APInt &RHS, const Twine &Name = Ó, bool HasNUW = false, bool HasNSW = false) argument 670 CreateShl(Value *LHS, uint64_t RHS, const Twine &Name = Ó, bool HasNUW = false, bool HasNSW = false) argument 676 CreateLShr(Value *LHS, Value *RHS, const Twine &Name = Ó, bool isExact = false) argument 685 CreateLShr(Value *LHS, const APInt &RHS, const Twine &Name = Ó, bool isExact = false) argument 689 CreateLShr(Value *LHS, uint64_t RHS, const Twine &Name = Ó, bool isExact = false) argument 694 CreateAShr(Value *LHS, Value *RHS, const Twine &Name = Ó, bool isExact = false) argument 703 CreateAShr(Value *LHS, const APInt &RHS, const Twine &Name = Ó, bool isExact = false) argument 707 CreateAShr(Value *LHS, uint64_t RHS, const Twine &Name = Ó, bool isExact = false) argument 712 CreateAnd(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 721 CreateAnd(Value *LHS, const APInt &RHS, const Twine &Name = Ó) argument 724 CreateAnd(Value *LHS, uint64_t RHS, const Twine &Name = Ó) argument 728 CreateOr(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 737 CreateOr(Value *LHS, const APInt &RHS, const Twine &Name = Ó) argument 740 CreateOr(Value *LHS, uint64_t RHS, const Twine &Name = Ó) argument 744 CreateXor(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 750 CreateXor(Value *LHS, const APInt &RHS, const Twine &Name = Ó) argument 753 CreateXor(Value *LHS, uint64_t RHS, const Twine &Name = Ó) argument 757 CreateBinOp(Instruction::BinaryOps Opc, Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1069 CreateICmpEQ(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1072 CreateICmpNE(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1075 CreateICmpUGT(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1078 CreateICmpUGE(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1081 CreateICmpULT(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1084 CreateICmpULE(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1087 CreateICmpSGT(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1090 CreateICmpSGE(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1093 CreateICmpSLT(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1096 CreateICmpSLE(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1100 CreateFCmpOEQ(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1103 CreateFCmpOGT(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1106 CreateFCmpOGE(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1109 CreateFCmpOLT(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1112 CreateFCmpOLE(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1115 CreateFCmpONE(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1118 CreateFCmpORD(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1121 CreateFCmpUNO(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1124 CreateFCmpUEQ(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1127 CreateFCmpUGT(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1130 CreateFCmpUGE(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1133 CreateFCmpULT(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1136 CreateFCmpULE(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1139 CreateFCmpUNE(Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1143 CreateICmp(CmpInst::Predicate P, Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1150 CreateFCmp(CmpInst::Predicate P, Value *LHS, Value *RHS, const Twine &Name = Ó) argument 1281 CreatePtrDiff(Value *LHS, Value *RHS, const Twine &Name = Ó) argument [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | InstructionSimplify.h | 34 Value *SimplifyAddInst(Value *LHS, Value *RHS, bool isNSW, bool isNUW, 41 Value *SimplifySubInst(Value *LHS, Value *RHS, bool isNSW, bool isNUW, 48 Value *SimplifyMulInst(Value *LHS, Value *RHS, const TargetData *TD = 0, 54 Value *SimplifySDivInst(Value *LHS, Value *RHS, const TargetData *TD = 0, 60 Value *SimplifyUDivInst(Value *LHS, Value *RHS, const TargetData *TD = 0, 66 Value *SimplifyFDivInst(Value *LHS, Value *RHS, const TargetData *TD = 0, 72 Value *SimplifySRemInst(Value *LHS, Value *RHS, const TargetData *TD = 0, 78 Value *SimplifyURemInst(Value *LHS, Value *RHS, const TargetData *TD = 0, 84 Value *SimplifyFRemInst(Value *LHS, Value *RHS, const TargetData *TD = 0, 111 Value *SimplifyAndInst(Value *LHS, Valu [all...] |
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | CmpInstAnalysis.h | 56 Value *getICmpValue(bool Sign, unsigned Code, Value *LHS, Value *RHS,
|
/external/llvm/unittests/Support/ |
H A D | IntegersSubsetTest.cpp | 187 const unsigned_ranges LHS, 201 Ranges.push_back(Range(Int(LHS[i][0]), Int(LHS[i][1]))); 256 unsigned_ranges LHS = { { 0, 4 }, { 7, 10 }, { 13, 17 } }; local 261 TestDiff(LHS, 3, RHS, 1, ExcludeRes, 2, IntersectRes, 3); 265 unsigned_ranges LHS = { { 0, 4 }, { 7, 10 }, { 13, 17 } }; local 270 TestDiff(LHS, 3, RHS, 2, ExcludeRes, 1, IntersectRes, 2); 274 unsigned_ranges LHS = { { 0, 17 } }; local 280 TestDiff(LHS, 1, RHS, 3, ExcludeRes, 4, IntersectRes, 3); 284 unsigned_ranges LHS local 186 TestDiff( const unsigned_ranges LHS, unsigned LSize, const unsigned_ranges RHS, unsigned RSize, const unsigned_ranges ExcludeRes, unsigned ExcludeResSize, const unsigned_ranges IntersectRes, unsigned IntersectResSize ) argument 293 unsigned_ranges LHS = { { 2, 4 } }; local 302 unsigned_ranges LHS = { { 3, 7 } }; local 311 unsigned_ranges LHS = { { 0, 7 } }; local 320 unsigned_ranges LHS = { { 17, 17 } }; local [all...] |
/external/clang/lib/Lex/ |
H A D | PPExpressions.cpp | 56 static bool EvaluateDirectiveSubExpr(PPValue &LHS, unsigned MinPrec, 434 /// PeekTok, and whose precedence is PeekPrec. This returns the result in LHS. 439 static bool EvaluateDirectiveSubExpr(PPValue &LHS, unsigned MinPrec, argument 446 << LHS.getRange(); 464 if (Operator == tok::ampamp && LHS.Val == 0) 466 else if (Operator == tok::pipepipe && LHS.Val != 0) 468 else if (Operator == tok::question && LHS.Val == 0) 477 PPValue RHS(LHS.getBitWidth()); 499 // the LHS of the '?'. The grammar rule is: 520 llvm::APSInt Res(LHS [all...] |
/external/llvm/utils/TableGen/ |
H A D | DAGISelEmitter.cpp | 73 // PatternSortingPredicate - return true if we prefer to match LHS before RHS. 80 bool operator()(const PatternToMatch *LHS, const PatternToMatch *RHS) { argument 81 const TreePatternNode *LHSSrc = LHS->getSrcPattern(); 97 unsigned LHSSize = LHS->getPatternComplexity(CGP); 99 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost 103 unsigned LHSCost = getResultPatternCost(LHS->getDstPattern(), CGP); 108 unsigned LHSPatSize = getResultPatternSize(LHS->getDstPattern(), CGP); 115 assert(LHS == RHS || LHS->ID != RHS->ID); 116 return LHS [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | CmpInstAnalysis.cpp | 72 Value *llvm::getICmpValue(bool Sign, unsigned Code, Value *LHS, Value *RHS, argument 77 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 0); 85 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 1);
|
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineAndOrXor.cpp | 97 static Value *getNewICmpValue(bool Sign, unsigned Code, Value *LHS, Value *RHS, argument 100 if (Value *NewConstant = getICmpValue(Sign, Code, LHS, RHS, NewPred)) 102 return Builder->CreateICmp(NewPred, LHS, RHS); 109 Value *LHS, Value *RHS, 122 if (!isordered) return ConstantInt::getTrue(LHS->getContext()); 125 return Builder->CreateFCmp(Pred, LHS, RHS); 334 /// FoldLogicalPlusAnd - This is part of an expression (LHS +/- RHS) & Mask, 344 Value *InstCombiner::FoldLogicalPlusAnd(Value *LHS, Value *RHS, argument 347 Instruction *LHSI = dyn_cast<Instruction>(LHS); 533 /// that both LHS an 108 getFCmpValue(bool isordered, unsigned code, Value *LHS, Value *RHS, InstCombiner::BuilderTy *Builder) argument 534 foldLogOpOfMaskedICmpsHelper(Value*& A, Value*& B, Value*& C, Value*& D, Value*& E, ICmpInst *LHS, ICmpInst *RHS, ICmpInst::Predicate &LHSCC, ICmpInst::Predicate &RHSCC) argument 631 foldLogOpOfMaskedICmps(ICmpInst *LHS, ICmpInst *RHS, ICmpInst::Predicate NEWCC, llvm::InstCombiner::BuilderTy* Builder) argument 710 FoldAndOfICmps(ICmpInst *LHS, ICmpInst *RHS) argument 942 FoldAndOfFCmps(FCmpInst *LHS, FCmpInst *RHS) argument 1438 FoldOrOfICmps(ICmpInst *LHS, ICmpInst *RHS) argument 1633 FoldOrOfFCmps(FCmpInst *LHS, FCmpInst *RHS) argument [all...] |
H A D | InstCombineAddSub.cpp | 61 /// (sext (add LHS, RHS)) === (add (sext LHS), (sext RHS)) 64 bool InstCombiner::WillNotOverflowSignedAdd(Value *LHS, Value *RHS) { argument 69 // have one carry bit which can change a sign. As such, if LHS and RHS each 72 if (ComputeNumSignBits(LHS) > 1 && ComputeNumSignBits(RHS) > 1) 88 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local 90 if (Value *V = SimplifyAddInst(LHS, RHS, I.hasNoSignedWrap(), 102 return BinaryOperator::CreateXor(LHS, RHS); 110 if (ZExtInst *ZI = dyn_cast<ZExtInst>(LHS)) 115 if (match(LHS, m_Xo 352 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local 428 OptimizePointerDifference(Value *LHS, Value *RHS, Type *Ty) 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, * 189 FactorizeBinOp(unsigned Opcode, Value *LHS, Value *RHS, unsigned OpcToExtract, const Query &Q, unsigned MaxRecurse) argument 259 SimplifyAssociativeBinOp(unsigned Opc, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 358 ThreadBinOpOverSelect(unsigned Opcode, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 430 ThreadCmpOverSelect(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 512 ThreadBinOpOverPHI(unsigned Opcode, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 555 ThreadCmpOverPHI(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 734 computePointerDifference(const TargetData &TD, Value *LHS, Value *RHS) argument 1577 ExtractEquivalentCondition(Value *V, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 1594 computePointerICmp(const TargetData &TD, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 1636 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 2401 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD, const TargetLibraryInfo *TLI, const DominatorTree *DT) argument 2411 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 2498 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD, const TargetLibraryInfo *TLI, const DominatorTree *DT) argument 2677 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 2732 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const TargetData *TD, const TargetLibraryInfo *TLI, const DominatorTree *DT) argument 2740 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 2747 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD, const TargetLibraryInfo *TLI, const DominatorTree *DT) argument [all...] |