/external/llvm/utils/TableGen/ |
H A D | DAGISelEmitter.cpp | 75 // PatternSortingPredicate - return true if we prefer to match LHS before RHS. 82 bool operator()(const PatternToMatch *LHS, const PatternToMatch *RHS) { argument 83 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/include/llvm/Target/ |
H A D | TargetOptions.h | 230 inline bool operator==(const TargetOptions &LHS, argument 232 #define ARE_EQUAL(X) LHS.X == RHS.X 256 inline bool operator!=(const TargetOptions &LHS, argument 258 return !(LHS == RHS);
|
/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/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...] |
/external/llvm/include/llvm/ADT/ |
H A D | Triple.h | 297 unsigned LHS[3]; local 298 getOSVersion(LHS[0], LHS[1], LHS[2]); 300 if (LHS[0] != Major) 301 return LHS[0] < Major; 302 if (LHS[1] != Minor) 303 return LHS[1] < Minor; 304 if (LHS[2] != Micro) 305 return LHS[ [all...] |
H A D | APInt.h | 180 static void divide(const APInt LHS, unsigned lhsWords, const APInt &RHS, 699 /// the LHS. 925 static void udivrem(const APInt &LHS, const APInt &RHS, APInt &Quotient, 928 static void sdivrem(const APInt &LHS, const APInt &RHS, APInt &Quotient, 1635 /// DST = LHS * RHS, where DST has the same width as the operands and is 1642 /// DST = LHS * RHS, where DST has width the sum of the widths of the 1648 /// If RHS is zero LHS and REMAINDER are left unchanged, return one. 1649 /// Otherwise set LHS to LHS / RHS with the fractional part discarded, set 1652 /// OLD_LHS = RHS * LHS [all...] |
/external/clang/include/clang/Basic/ |
H A D | SourceLocation.h | 179 inline bool operator==(const SourceLocation &LHS, const SourceLocation &RHS) { argument 180 return LHS.getRawEncoding() == RHS.getRawEncoding(); 183 inline bool operator!=(const SourceLocation &LHS, const SourceLocation &RHS) { argument 184 return !(LHS == RHS); 187 inline bool operator<(const SourceLocation &LHS, const SourceLocation &RHS) { argument 188 return LHS.getRawEncoding() < RHS.getRawEncoding(); 337 operator==(const FullSourceLoc &LHS, const FullSourceLoc &RHS) { argument 338 return LHS.getRawEncoding() == RHS.getRawEncoding() && 339 LHS.SrcMgr == RHS.SrcMgr; 343 operator!=(const FullSourceLoc &LHS, cons argument 413 isEqual(clang::FileID LHS, clang::FileID RHS) argument [all...] |
/external/clang/lib/Parse/ |
H A D | ParseExpr.cpp | 39 /// production. C99 specifies that the LHS of an assignment operator should be 42 /// LHS of an assignment has to be an l-value, which productions between 44 /// consistency, we parse the LHS as a conditional-expression, then check for 121 ExprResult LHS(ParseAssignmentExpression(isTypeCast)); 122 return ParseRHSOfBinaryExpression(LHS, prec::Comma); 132 ExprResult LHS(ParseObjCAtExpression(AtLoc)); 133 return ParseRHSOfBinaryExpression(LHS, prec::Comma); 141 ExprResult LHS(true); 146 LHS = ParseCastExpression(false); 149 if (!LHS 222 ParseRHSOfBinaryExpression(ExprResult LHS, prec::Level MinPrec) argument 1199 ParsePostfixExpressionSuffix(ExprResult LHS) argument [all...] |
/external/llvm/utils/PerfectShuffle/ |
H A D | PerfectShuffle.cpp | 56 /// isOnlyLHSMask - Return true if this mask only refers to its LHS, not 62 /// getLHSOnlyMask - Given a mask that refers to its LHS and RHS, modify it to 63 /// refer to the LHS only (for when one argument value is passed into the same 67 return Mask & 0xBBBB; // Keep only LHS and Undefs. 149 return "LHS"; 220 // Seed the table with accesses to the LHS and RHS. 294 for (unsigned LHS = 0; LHS != 0x8889; ++LHS) { 295 if (!isValidMask(LHS)) continu [all...] |
/external/llvm/lib/IR/ |
H A D | LLVMContextImpl.h | 67 static bool isEqual(const KeyTy &LHS, const KeyTy &RHS) { argument 68 return LHS == RHS; 95 static bool isEqual(const KeyTy &LHS, const KeyTy &RHS) { argument 96 return LHS == RHS; 134 static bool isEqual(const KeyTy& LHS, const StructType *RHS) { argument 137 return LHS == KeyTy(RHS); 139 static bool isEqual(const StructType *LHS, const StructType *RHS) { argument 140 return LHS == RHS; 183 static bool isEqual(const KeyTy& LHS, const FunctionType *RHS) { argument 186 return LHS 188 isEqual(const FunctionType *LHS, const FunctionType *RHS) argument [all...] |
/external/clang/include/clang/AST/ |
H A D | GlobalDecl.h | 72 friend bool operator==(const GlobalDecl &LHS, const GlobalDecl &RHS) { argument 73 return LHS.Value == RHS.Value; 110 static bool isEqual(clang::GlobalDecl LHS, argument 112 return LHS == RHS;
|
H A D | DeclarationName.h | 286 friend bool operator==(DeclarationName LHS, DeclarationName RHS) { argument 287 return LHS.Ptr == RHS.Ptr; 291 friend bool operator!=(DeclarationName LHS, DeclarationName RHS) { argument 292 return LHS.Ptr != RHS.Ptr; 303 static int compare(DeclarationName LHS, DeclarationName RHS); 312 inline bool operator<(DeclarationName LHS, DeclarationName RHS) { argument 313 return DeclarationName::compare(LHS, RHS) < 0; 318 inline bool operator>(DeclarationName LHS, DeclarationName RHS) { argument 319 return DeclarationName::compare(LHS, RHS) > 0; 324 inline bool operator<=(DeclarationName LHS, DeclarationNam argument 330 operator >=(DeclarationName LHS, DeclarationName RHS) argument 587 isEqual(clang::DeclarationName LHS, clang::DeclarationName RHS) argument [all...] |
/external/llvm/lib/Support/ |
H A D | DeltaAlgorithm.cpp | 32 changeset_ty LHS, RHS; local 36 ((idx < N) ? LHS : RHS).insert(*it); 37 if (!LHS.empty()) 38 Res.push_back(LHS);
|
H A D | Twine.cpp | 19 return *LHS.stdString; 43 return StringRef(LHS.cString); 45 const std::string *str = LHS.stdString; 153 printOneChild(OS, LHS, getLHSKind()); 159 printOneChildRepr(OS, LHS, getLHSKind());
|
/external/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolution.h | 510 ExitLimit HowManyLessThans(const SCEV *LHS, const SCEV *RHS, 512 ExitLimit HowManyGreaterThans(const SCEV *LHS, const SCEV *RHS, 522 /// isImpliedCond - Test whether the condition described by Pred, LHS, and 525 const SCEV *LHS, const SCEV *RHS, 530 /// LHS, and RHS is true whenever the condition described by Pred, FoundLHS, 533 const SCEV *LHS, const SCEV *RHS, 537 /// Pred, LHS, and RHS is true whenever the condition described by Pred, 540 const SCEV *LHS, const SCEV *RHS, 553 /// of LHS and RHS. 556 const SCEV *LHS, cons 600 getAddExpr(const SCEV *LHS, const SCEV *RHS, SCEV::NoWrapFlags Flags = SCEV::FlagAnyWrap) argument 617 getMulExpr(const SCEV *LHS, const SCEV *RHS, SCEV::NoWrapFlags Flags = SCEV::FlagAnyWrap) argument [all...] |
/external/clang/lib/CodeGen/ |
H A D | CGExprScalar.cpp | 44 Value *LHS; member in struct:__anon17037::BinOpInfo 414 return Builder.CreateMul(Ops.LHS, Ops.RHS, "mul"); 417 return Builder.CreateNSWMul(Ops.LHS, Ops.RHS, "mul"); 427 if (Ops.LHS->getType()->isFPOrFPVectorTy()) 428 return Builder.CreateFMul(Ops.LHS, Ops.RHS, "mul"); 429 return Builder.CreateMul(Ops.LHS, Ops.RHS, "mul"); 438 // Common helper for getting how wide LHS of shift is. 439 static Value *GetWidthMinusOneValue(Value* LHS,Value* RHS); 447 return Builder.CreateAnd(Ops.LHS, Ops.RHS, "and"); 450 return Builder.CreateXor(Ops.LHS, Op 901 Value *LHS = CGF.EmitScalarExpr(E->getExpr(0)); local 1136 Value *LHS = nullptr, *RHS = nullptr; local 2108 LValue LHS = EmitCompoundAssignLValue(E, Func, RHS); local 2577 GetWidthMinusOneValue(Value* LHS,Value* RHS) argument 2700 Value *LHS = CGF.EmitScalarExpr(E->getLHS()); local 2705 Value *LHS = Visit(E->getLHS()); local 2792 CodeGenFunction::ComplexPairTy LHS = CGF.EmitComplexExpr(E->getLHS()); local 2828 LValue LHS; local 2858 CGF.EmitStoreThroughBitfieldLValue(RValue::get(RHS), LHS, &RHS); local 2860 CGF.EmitStoreThroughLValue(RValue::get(RHS), LHS); local 2886 Value *LHS = Visit(E->getLHS()); local 2964 Value *LHS = Visit(E->getLHS()); local 3106 llvm::Value *LHS = Visit(lhsExpr); local 3151 llvm::Value *LHS = Visit(lhsExpr); local 3171 Value *LHS = Visit(lhsExpr); local [all...] |
H A D | CGExprComplex.cpp | 214 ComplexPairTy LHS; member in struct:__anon17034::ComplexExprEmitter::BinOpInfo 529 if (Op.LHS.first->getType()->isFloatingPointTy()) { 530 ResR = Builder.CreateFAdd(Op.LHS.first, Op.RHS.first, "add.r"); 531 ResI = Builder.CreateFAdd(Op.LHS.second, Op.RHS.second, "add.i"); 533 ResR = Builder.CreateAdd(Op.LHS.first, Op.RHS.first, "add.r"); 534 ResI = Builder.CreateAdd(Op.LHS.second, Op.RHS.second, "add.i"); 541 if (Op.LHS.first->getType()->isFloatingPointTy()) { 542 ResR = Builder.CreateFSub(Op.LHS.first, Op.RHS.first, "sub.r"); 543 ResI = Builder.CreateFSub(Op.LHS.second, Op.RHS.second, "sub.i"); 545 ResR = Builder.CreateSub(Op.LHS 657 LValue LHS = CGF.EmitLValue(E->getLHS()); local 716 LValue LHS = CGF.EmitLValue(E->getLHS()); local 762 ComplexPairTy LHS = Visit(E->getTrueExpr()); local [all...] |
/external/llvm/include/llvm/MC/ |
H A D | MachineLocation.h | 77 inline bool operator!=(const MachineLocation &LHS, const MachineLocation &RHS) { argument 78 return !(LHS == RHS);
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | ValueMapper.h | 65 static inline RemapFlags operator|(RemapFlags LHS, RemapFlags RHS) { argument 66 return RemapFlags(unsigned(LHS)|unsigned(RHS));
|
/external/compiler-rt/make/ |
H A D | util.mk | 6 # Function: streq LHS RHS 8 # Return "true" if LHS == RHS, otherwise "". 10 # LHS == RHS <=> (LHS subst RHS is empty) and (RHS subst LHS is empty) 13 # Function: strneq LHS RHS 15 # Return "true" if LHS != RHS, otherwise "".
|
/external/llvm/lib/MC/ |
H A D | MCExternalSymbolizer.cpp | 114 const MCExpr *LHS; local 116 LHS = MCBinaryExpr::CreateSub(Add, Sub, Ctx); 118 LHS = MCUnaryExpr::CreateMinus(Sub, Ctx); 120 Expr = MCBinaryExpr::CreateAdd(LHS, Off, Ctx); 122 Expr = LHS;
|
/external/llvm/examples/Kaleidoscope/Chapter3/ |
H A D | toy.cpp | 110 ExprAST *LHS, *RHS; member in class:__anon24615::BinaryExprAST 113 : Op(op), LHS(lhs), RHS(rhs) {} 254 static ExprAST *ParseBinOpRHS(int ExprPrec, ExprAST *LHS) { argument 262 return LHS; 273 // the pending operator take RHS as its LHS. 280 // Merge LHS/RHS. 281 LHS = new BinaryExprAST(BinOp, LHS, RHS); 289 ExprAST *LHS = ParsePrimary(); local 290 if (!LHS) retur [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
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 | 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...] |
/external/clang/lib/Tooling/ |
H A D | Refactoring.cpp | 86 bool operator<(const Replacement &LHS, const Replacement &RHS) { argument 87 if (LHS.getOffset() != RHS.getOffset()) 88 return LHS.getOffset() < RHS.getOffset(); 89 if (LHS.getLength() != RHS.getLength()) 90 return LHS.getLength() < RHS.getLength(); 91 if (LHS.getFilePath() != RHS.getFilePath()) 92 return LHS.getFilePath() < RHS.getFilePath(); 93 return LHS.getReplacementText() < RHS.getReplacementText(); 96 bool operator==(const Replacement &LHS, const Replacement &RHS) { argument 97 return LHS [all...] |