/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 | RawCommentList.h | 171 bool operator()(const RawComment &LHS, const RawComment &RHS) { argument 172 return SM.isBeforeInTranslationUnit(LHS.getLocStart(), RHS.getLocStart()); 175 bool operator()(const RawComment *LHS, const RawComment *RHS) { argument 176 return operator()(*LHS, *RHS);
|
H A D | CharUnits.h | 210 static bool isEqual(const clang::CharUnits &LHS, argument 212 return LHS == RHS;
|
/external/clang/include/clang/Basic/ |
H A D | ABI.h | 85 friend bool operator==(const ReturnAdjustment &LHS, argument 87 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Equals(RHS.Virtual); 90 friend bool operator!=(const ReturnAdjustment &LHS, const ReturnAdjustment &RHS) { argument 91 return !(LHS == RHS); 94 friend bool operator<(const ReturnAdjustment &LHS, argument 96 if (LHS.NonVirtual < RHS.NonVirtual) 99 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual); 153 friend bool operator==(const ThisAdjustment &LHS, argument 158 operator !=(const ThisAdjustment &LHS, const ThisAdjustment &RHS) argument 162 operator <(const ThisAdjustment &LHS, const ThisAdjustment &RHS) argument 195 operator ==(const ThunkInfo &LHS, const ThunkInfo &RHS) argument [all...] |
/external/clang/lib/CodeGen/ |
H A D | CodeGenTBAA.h | 150 static bool isEqual(const clang::CodeGen::TBAAPathTag &LHS, argument 152 return LHS.BaseT == RHS.BaseT && 153 LHS.AccessN == RHS.AccessN && 154 LHS.Offset == RHS.Offset;
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | DebugCheckers.cpp | 164 static int compareEntry(const Table::MapEntryTy *const *LHS, argument 166 return (*LHS)->getKey().compare((*RHS)->getKey());
|
/external/llvm/include/llvm/ADT/ |
H A D | ArrayRef.h | 321 inline bool operator==(ArrayRef<T> LHS, ArrayRef<T> RHS) { argument 322 return LHS.equals(RHS); 326 inline bool operator!=(ArrayRef<T> LHS, ArrayRef<T> RHS) { argument 327 return !(LHS == RHS);
|
H A D | PointerUnion.h | 495 static bool isEqual(const Pair &LHS, const Pair &RHS) { argument 496 return LHS.template is<T>() == RHS.template is<T>() && 497 (LHS.template is<T>() ? 498 FirstInfo::isEqual(LHS.template get<T>(), 500 SecondInfo::isEqual(LHS.template get<U>(),
|
H A D | SmallPtrSet.h | 335 inline void swap(llvm::SmallPtrSet<T, N> &LHS, llvm::SmallPtrSet<T, N> &RHS) { argument 336 LHS.swap(RHS);
|
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) { 225 // The RHS cannot be non-empty if the LHS is empty. 231 !LHS.twine->isBinary()) 270 LHS.cString = Str; 281 LHS.stdString = &Str; 288 LHS.stringRef = &Str; 295 LHS 379 Child LHS, RHS; local 502 operator +(const Twine &LHS, const Twine &RHS) argument 509 operator +(const char *LHS, const StringRef &RHS) argument 516 operator +(const StringRef &LHS, const char *RHS) argument [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/Analysis/ |
H A D | PHITransAddr.cpp | 262 // PHI translate the LHS. 267 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT); local 268 if (!LHS) return nullptr; 270 // If the PHI translated LHS is an add of a constant, fold the immediates. 271 if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(LHS)) 274 LHS = BOp->getOperand(0); 278 // If the old 'LHS' was an input, add the new 'LHS' as an input. 281 AddAsInput(LHS); 286 if (Value *Res = SimplifyAddInst(LHS, RH [all...] |
/external/llvm/lib/Support/ |
H A D | ScaledNumber.cpp | 22 std::pair<uint64_t, int16_t> ScaledNumbers::multiply64(uint64_t LHS, argument 27 uint64_t UL = getU(LHS), LL = getL(LHS), UR = getU(RHS), LR = getL(RHS);
|
/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/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
H A D | R600ISelLowering.cpp | 336 SDValue LHS = Op.getOperand(2); local 345 LHS, RHS, 392 SDValue LHS = Op.getOperand(0); local 400 // LHS and RHS are guaranteed to be the same value type 401 EVT CompareVT = LHS.getValueType(); 404 // necessary we need to convert LHS and RHS to be the same type True and 422 // XXX Check the value of LHS and RHS and avoid creating sequences like 424 LHS = DAG.getNode(ConversionOp, DL, VT, LHS); 431 return DAG.getNode(ISD::SELECT_CC, DL, VT, LHS, RH 502 SDValue LHS = Op.getOperand(0); local [all...] |
H A D | SIISelLowering.cpp | 312 SDValue LHS = Op.getOperand(2); local 321 LHS, RHS, 376 SDValue LHS = Op.getOperand(0); local 384 SDValue Cond = DAG.getNode(ISD::SETCC, DL, MVT::i1, LHS, RHS, CC);
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExprEngine.h | 471 SVal LHS, SVal RHS, QualType T) { 472 return svalBuilder.evalBinOp(ST, Op, LHS, RHS, T); 470 evalBinOp(ProgramStateRef ST, BinaryOperator::Opcode Op, SVal LHS, SVal RHS, QualType T) argument
|
/external/clang/lib/Analysis/ |
H A D | BodyFarm.cpp | 50 BinaryOperator *makeAssignment(const Expr *LHS, const Expr *RHS, QualType Ty); 53 BinaryOperator *makeComparison(const Expr *LHS, const Expr *RHS, 88 BinaryOperator *ASTMaker::makeAssignment(const Expr *LHS, const Expr *RHS, argument 90 return new (C) BinaryOperator(const_cast<Expr*>(LHS), const_cast<Expr*>(RHS), 95 BinaryOperator *ASTMaker::makeComparison(const Expr *LHS, const Expr *RHS, argument 99 return new (C) BinaryOperator(const_cast<Expr*>(LHS),
|
/external/clang/lib/Lex/ |
H A D | PPExpressions.cpp | 57 static bool EvaluateDirectiveSubExpr(PPValue &LHS, unsigned MinPrec, 452 /// PeekTok, and whose precedence is PeekPrec. This returns the result in LHS. 457 static bool EvaluateDirectiveSubExpr(PPValue &LHS, unsigned MinPrec, argument 464 << LHS.getRange(); 482 if (Operator == tok::ampamp && LHS.Val == 0) 484 else if (Operator == tok::pipepipe && LHS.Val != 0) 486 else if (Operator == tok::question && LHS.Val == 0) 495 PPValue RHS(LHS.getBitWidth()); 517 // the LHS of the '?'. The grammar rule is: 538 llvm::APSInt Res(LHS [all...] |
/external/clang/lib/Rewrite/Core/ |
H A D | DeltaTree.cpp | 56 DeltaTreeNode *LHS, *RHS; member in struct:__anon17962::DeltaTreeNode::InsertResult 134 Children[0] = IR.LHS; 137 FullDelta = IR.LHS->getFullDelta()+IR.RHS->getFullDelta()+IR.Split.Delta; 219 InsertRes->LHS->DoInsertion(FileIndex, Delta, nullptr /*can't fail*/); 239 IN->Children[i] = InsertRes->LHS; 252 IN->Children[i] = InsertRes->LHS; 262 InsertSide = cast<DeltaTreeInteriorNode>(InsertRes->LHS); 297 // the first 'WidthFactor-1' values to the LHS child (which we leave in this 326 InsertRes.LHS = this;
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | SimpleConstraintManager.cpp | 211 const SymExpr *LHS, 219 APSIntType WraparoundType = BVF.getAPSIntType(LHS->getType()); 228 SymbolRef Sym = LHS; 210 assumeSymRel(ProgramStateRef state, const SymExpr *LHS, BinaryOperator::Opcode op, const llvm::APSInt& Int) argument
|
/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...] |
/external/compiler-rt/lib/ubsan/ |
H A D | ubsan_handlers.cc | 66 ValueHandle LHS, 76 << Value(Data->Type, LHS) << Operator << RHS << Data->Type; 80 ValueHandle LHS, ValueHandle RHS) { 81 HandleIntegerOverflow(Data, LHS, "+", Value(Data->Type, RHS)); 84 ValueHandle LHS, 86 __ubsan_handle_add_overflow(Data, LHS, RHS); 91 ValueHandle LHS, ValueHandle RHS) { 92 HandleIntegerOverflow(Data, LHS, "-", Value(Data->Type, RHS)); 95 ValueHandle LHS, 97 __ubsan_handle_sub_overflow(Data, LHS, RH 65 HandleIntegerOverflow(OverflowData *Data, ValueHandle LHS, const char *Operator, T RHS) argument 79 __ubsan_handle_add_overflow(OverflowData *Data, ValueHandle LHS, ValueHandle RHS) argument 83 __ubsan_handle_add_overflow_abort(OverflowData *Data, ValueHandle LHS, ValueHandle RHS) argument 90 __ubsan_handle_sub_overflow(OverflowData *Data, ValueHandle LHS, ValueHandle RHS) argument 94 __ubsan_handle_sub_overflow_abort(OverflowData *Data, ValueHandle LHS, ValueHandle RHS) argument 101 __ubsan_handle_mul_overflow(OverflowData *Data, ValueHandle LHS, ValueHandle RHS) argument 105 __ubsan_handle_mul_overflow_abort(OverflowData *Data, ValueHandle LHS, ValueHandle RHS) argument 134 __ubsan_handle_divrem_overflow(OverflowData *Data, ValueHandle LHS, ValueHandle RHS) argument 149 __ubsan_handle_divrem_overflow_abort(OverflowData *Data, ValueHandle LHS, ValueHandle RHS) argument 156 __ubsan_handle_shift_out_of_bounds(ShiftOutOfBoundsData *Data, ValueHandle LHS, ValueHandle RHS) argument 178 __ubsan_handle_shift_out_of_bounds_abort( ShiftOutOfBoundsData *Data, ValueHandle LHS, ValueHandle RHS) argument [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | CGSCCPassManager.h | 314 friend void swap(ModuleToPostOrderCGSCCPassAdaptor &LHS, argument 317 swap(LHS.Pass, RHS.Pass); 534 friend void swap(CGSCCToFunctionPassAdaptor &LHS, CGSCCToFunctionPassAdaptor &RHS) { argument 536 swap(LHS.Pass, RHS.Pass);
|
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 218 CreateICmp(CmpInst::Predicate P, Constant *LHS, Constant *RHS) const argument 222 CreateFCmp(CmpInst::Predicate P, Constant *LHS, Constant *RHS) const argument [all...] |