HomeSort by relevance Sort by last modified time
    Searched refs:RHS (Results 1 - 25 of 374) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/clang/include/clang/Edit/
FileOffset.h 37 friend bool operator==(FileOffset LHS, FileOffset RHS) {
38 return LHS.FID == RHS.FID && LHS.Offs == RHS.Offs;
40 friend bool operator!=(FileOffset LHS, FileOffset RHS) {
41 return !(LHS == RHS);
43 friend bool operator<(FileOffset LHS, FileOffset RHS) {
44 if (LHS.FID != RHS.FID)
45 return LHS.FID < RHS.FID;
46 return LHS.Offs < RHS.Offs;
48 friend bool operator>(FileOffset LHS, FileOffset RHS) {
    [all...]
  /external/llvm/include/llvm/ADT/
APSInt.h 36 APSInt &operator=(const APSInt &RHS) {
37 APInt::operator=(RHS);
38 IsUnsigned = RHS.IsUnsigned;
42 APSInt &operator=(const APInt &RHS) {
44 APInt::operator=(RHS);
48 APSInt &operator=(uint64_t RHS) {
50 APInt::operator=(RHS);
89 const APSInt &operator%=(const APSInt &RHS) {
90 assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
92 *this = urem(RHS);
    [all...]
SmallString.h 38 SmallString(const SmallString &RHS) : SmallVector<char, InternalLen>(RHS) {}
60 void assign(StringRef RHS) {
62 SmallVectorImpl<char>::append(RHS.begin(), RHS.end());
66 void assign(const SmallVectorImpl<char> &RHS) {
68 SmallVectorImpl<char>::append(RHS.begin(), RHS.end());
87 void append(StringRef RHS) {
88 SmallVectorImpl<char>::append(RHS.begin(), RHS.end())
    [all...]
SmallBitVector.h 149 SmallBitVector(const SmallBitVector &RHS) {
150 if (RHS.isSmall())
151 X = RHS.X;
153 switchToLarge(new BitVector(*RHS.getPointer()));
157 SmallBitVector(SmallBitVector &&RHS) : X(RHS.X) {
158 RHS.X = 1;
388 bool anyCommon(const SmallBitVector &RHS) const {
389 if (isSmall() && RHS.isSmall())
390 return (getSmallBits() & RHS.getSmallBits()) != 0
    [all...]
APInt.h 180 static void divide(const APInt LHS, unsigned lhsWords, const APInt &RHS,
196 APInt AndSlowCase(const APInt &RHS) const;
199 APInt OrSlowCase(const APInt &RHS) const;
202 APInt XorSlowCase(const APInt &RHS) const;
205 APInt &AssignSlowCase(const APInt &RHS);
208 bool EqualSlowCase(const APInt &RHS) const;
647 /// \returns *this after assignment of RHS.
648 APInt &operator=(const APInt &RHS) {
650 if (isSingleWord() && RHS.isSingleWord()) {
651 VAL = RHS.VAL
    [all...]
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; }
55 static bool isEqual(const char &LHS, const char &RHS) {
56 return LHS == RHS;
65 static bool isEqual(const unsigned& LHS, const unsigned& RHS) {
66 return LHS == RHS;
77 static bool isEqual(const unsigned long& LHS, const unsigned long& RHS) {
78 return LHS == RHS;
90 const unsigned long long& RHS) {
    [all...]
SparseBitVector.h 72 bool operator==(const SparseBitVectorElement &RHS) const {
73 if (ElementIndex != RHS.ElementIndex)
76 if (Bits[i] != RHS.Bits[i])
81 bool operator!=(const SparseBitVectorElement &RHS) const {
82 return !(*this == RHS);
183 // Union this element with RHS and return true if this one changed.
184 bool unionWith(const SparseBitVectorElement &RHS) {
189 Bits[i] |= RHS.Bits[i];
196 // Return true if we have any bits in common with RHS
197 bool intersects(const SparseBitVectorElement &RHS) const
    [all...]
  /external/clang/include/clang/Basic/
ABI.h 52 const ReturnAdjustment &RHS) {
53 return LHS.NonVirtual == RHS.NonVirtual &&
54 LHS.VBaseOffsetOffset == RHS.VBaseOffsetOffset;
58 const ReturnAdjustment &RHS) {
59 if (LHS.NonVirtual < RHS.NonVirtual)
62 return LHS.NonVirtual == RHS.NonVirtual &&
63 LHS.VBaseOffsetOffset < RHS.VBaseOffsetOffset;
82 const ThisAdjustment &RHS) {
83 return LHS.NonVirtual == RHS.NonVirtual &&
84 LHS.VCallOffsetOffset == RHS.VCallOffsetOffset
    [all...]
  /external/llvm/include/llvm/Support/
BranchProbability.h 53 bool operator==(BranchProbability RHS) const {
54 return (uint64_t)N * RHS.D == (uint64_t)D * RHS.N;
56 bool operator!=(BranchProbability RHS) const {
57 return !(*this == RHS);
59 bool operator<(BranchProbability RHS) const {
60 return (uint64_t)N * RHS.D < (uint64_t)D * RHS.N;
62 bool operator>(BranchProbability RHS) const {
63 return RHS < *this
    [all...]
BlockFrequency.h 60 bool operator<(const BlockFrequency &RHS) const {
61 return Frequency < RHS.Frequency;
64 bool operator<=(const BlockFrequency &RHS) const {
65 return Frequency <= RHS.Frequency;
68 bool operator>(const BlockFrequency &RHS) const {
69 return Frequency > RHS.Frequency;
72 bool operator>=(const BlockFrequency &RHS) const {
73 return Frequency >= RHS.Frequency;
NoFolder.h 40 Instruction *CreateAdd(Constant *LHS, Constant *RHS,
42 BinaryOperator *BO = BinaryOperator::CreateAdd(LHS, RHS);
47 Instruction *CreateNSWAdd(Constant *LHS, Constant *RHS) const {
48 return BinaryOperator::CreateNSWAdd(LHS, RHS);
50 Instruction *CreateNUWAdd(Constant *LHS, Constant *RHS) const {
51 return BinaryOperator::CreateNUWAdd(LHS, RHS);
53 Instruction *CreateFAdd(Constant *LHS, Constant *RHS) const {
54 return BinaryOperator::CreateFAdd(LHS, RHS);
56 Instruction *CreateSub(Constant *LHS, Constant *RHS,
58 BinaryOperator *BO = BinaryOperator::CreateSub(LHS, RHS);
    [all...]
SMLoc.h 30 bool operator==(const SMLoc &RHS) const { return RHS.Ptr == Ptr; }
31 bool operator!=(const SMLoc &RHS) const { return RHS.Ptr != Ptr; }
ValueHandle.h 73 ValueHandleBase(HandleBaseKind Kind, const ValueHandleBase &RHS)
74 : PrevPair(0, Kind), Next(0), VP(RHS.VP) {
76 AddToExistingUseList(RHS.getPrevPtr());
83 Value *operator=(Value *RHS) {
84 if (VP.getPointer() == RHS) return RHS;
86 VP.setPointer(RHS);
88 return RHS;
91 Value *operator=(const ValueHandleBase &RHS) {
92 if (VP.getPointer() == RHS.VP.getPointer()) return RHS.VP.getPointer()
    [all...]
ConstantFolder.h 34 Constant *CreateAdd(Constant *LHS, Constant *RHS,
36 return ConstantExpr::getAdd(LHS, RHS, HasNUW, HasNSW);
38 Constant *CreateFAdd(Constant *LHS, Constant *RHS) const {
39 return ConstantExpr::getFAdd(LHS, RHS);
41 Constant *CreateSub(Constant *LHS, Constant *RHS,
43 return ConstantExpr::getSub(LHS, RHS, HasNUW, HasNSW);
45 Constant *CreateFSub(Constant *LHS, Constant *RHS) const {
46 return ConstantExpr::getFSub(LHS, RHS);
48 Constant *CreateMul(Constant *LHS, Constant *RHS,
50 return ConstantExpr::getMul(LHS, RHS, HasNUW, HasNSW)
    [all...]
TargetFolder.h 50 Constant *CreateAdd(Constant *LHS, Constant *RHS,
52 return Fold(ConstantExpr::getAdd(LHS, RHS, HasNUW, HasNSW));
54 Constant *CreateFAdd(Constant *LHS, Constant *RHS) const {
55 return Fold(ConstantExpr::getFAdd(LHS, RHS));
57 Constant *CreateSub(Constant *LHS, Constant *RHS,
59 return Fold(ConstantExpr::getSub(LHS, RHS, HasNUW, HasNSW));
61 Constant *CreateFSub(Constant *LHS, Constant *RHS) const {
62 return Fold(ConstantExpr::getFSub(LHS, RHS));
64 Constant *CreateMul(Constant *LHS, Constant *RHS,
66 return Fold(ConstantExpr::getMul(LHS, RHS, HasNUW, HasNSW))
    [all...]
PatternMatch.h 378 BinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {}
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, RHS, Instruction::FAdd>(L, R)
    [all...]
  /system/core/include/utils/
Debug.h 38 template<bool C, typename LSH, typename RHS> struct CompileTimeIfElse;
39 template<typename LHS, typename RHS>
40 struct CompileTimeIfElse<true, LHS, RHS> { typedef LHS TYPE; };
41 template<typename LHS, typename RHS>
42 struct CompileTimeIfElse<false, LHS, RHS> { typedef RHS TYPE; };
  /external/clang/test/Index/
cxx-operator-overload.cpp 5 Cls operator +(const Cls &RHS);
13 Cls Cls::operator +(const Cls &RHS) { while (1) {} }
  /prebuilts/python/darwin-x86/2.7.5/include/python2.7/
metagrammar.h 10 #define RHS 258
  /prebuilts/python/linux-x86/2.7.5/include/python2.7/
metagrammar.h 10 #define RHS 258
  /external/clang/include/clang/Sema/
Weak.h 38 bool operator==(WeakInfo RHS) const {
39 return alias == RHS.getAlias() && loc == RHS.getLocation();
41 bool operator!=(WeakInfo RHS) const { return !(*this == RHS); }
  /external/llvm/lib/Support/
SmallPtrSet.cpp 191 void SmallPtrSetImpl::CopyFrom(const SmallPtrSetImpl &RHS) {
192 if (isSmall() && RHS.isSmall())
193 assert(CurArraySize == RHS.CurArraySize &&
197 if (RHS.isSmall()) {
202 } else if (CurArraySize != RHS.CurArraySize) {
204 CurArray = (const void**)malloc(sizeof(void*) * RHS.CurArraySize);
206 CurArray = (const void**)realloc(CurArray, sizeof(void*)*RHS.CurArraySize);
211 CurArraySize = RHS.CurArraySize;
214 memcpy(CurArray, RHS.CurArray, sizeof(void*)*CurArraySize);
216 NumElements = RHS.NumElements
    [all...]
  /external/clang/test/SemaCXX/
unused.cpp 11 APSInt &operator=(const APSInt &RHS);
14 APSInt& APSInt::operator=(const APSInt &RHS) {
15 APInt::operator=(RHS);
warn-self-assign.cpp 19 #define RHS a
24 a = RHS;
25 LHS OP RHS;
28 #undef RHS
  /external/clang/include/clang/Rewrite/Core/
DeltaTree.h 34 // Note: Currently we only support copying when the RHS is empty.
35 DeltaTree(const DeltaTree &RHS);

Completed in 395 milliseconds

1 2 3 4 5 6 7 8 91011>>