/freebsd/contrib/llvm-project/llvm/lib/Support/ |
H A D | SmallPtrSet.cpp | 152 if (RHS.isSmall()) { in CopyFrom() 167 CopyHelper(RHS); in CopyFrom() 175 std::copy(RHS.CurArray, RHS.EndPointer(), CurArray); in CopyHelper() 192 if (RHS.isSmall()) { in MoveHelper() 195 std::copy(RHS.CurArray, RHS.CurArray + RHS.NumNonEmpty, CurArray); in MoveHelper() 198 RHS.CurArray = RHS.SmallArray; in MoveHelper() 208 assert(RHS.CurArray == RHS.SmallArray); in MoveHelper() 230 assert(RHS.CurArray == RHS.SmallArray); in swap() 231 std::copy(RHS.CurArray, RHS.CurArray + RHS.NumNonEmpty, this->SmallArray); in swap() 250 RHS.CurArray = RHS.SmallArray; in swap() [all …]
|
H A D | KnownBits.cpp | 36 APInt RHSKnownUnion = RHS.Zero | RHS.One; in computeForAddCarry() 66 std::swap(RHS.Zero, RHS.One); in computeForAddSub() 94 std::swap(RHS.Zero, RHS.One); in computeForSubBorrow() 137 return RHS; in umax() 717 unsigned TrailBitsKnown1 = (RHS.Zero | RHS.One).countr_one(); in mul() 889 if (!RHS.isZero() && RHS.Zero[0]) { in remGetLowBits() 904 if (RHS.isConstant() && RHS.getConstant().isPowerOf2()) { in urem() 923 if (RHS.isConstant() && RHS.getConstant().isPowerOf2()) { in srem() 950 One &= RHS.One; in operator &=() 964 APInt Z = (Zero & RHS.Zero) | (One & RHS.One); in operator ^=() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | InstructionCost.h | 100 propagateState(RHS); 118 propagateState(RHS); 140 if ((Value > 0 && RHS.Value > 0) || (Value < 0 && RHS.Value < 0)) 158 Value /= RHS.Value; 204 return !(*this < RHS) && !(RHS < *this); 214 bool operator!=(const CostType RHS) const { return !(*this == RHS); } 216 bool operator>(const InstructionCost &RHS) const { return RHS < *this; } 255 LHS2 += RHS; 262 LHS2 -= RHS; 269 LHS2 *= RHS; [all …]
|
H A D | TypeSize.h | 56 return {Fixed + RHS.Fixed, Scalable + RHS.Scalable}; 59 return {Fixed - RHS.Fixed, Scalable - RHS.Scalable}; 62 Fixed += RHS.Fixed; 67 Fixed -= RHS.Fixed; 75 return Fixed == RHS.Fixed && Scalable == RHS.Scalable; 78 return Fixed != RHS.Fixed || Scalable != RHS.Scalable; 105 if (!RHS.isZero()) 115 if (!RHS.isZero()) 127 return Copy += RHS; 149 return Quantity == RHS.Quantity && Scalable == RHS.Scalable; [all …]
|
H A D | BranchProbability.h | 95 N = (uint64_t(N) + RHS.N > D) ? D : N + RHS.N; 103 N = N < RHS.N ? 0 : N - RHS.N; 117 N = (uint64_t(N) * RHS > D) ? D : N * RHS; 124 N = (static_cast<uint64_t>(N) * D + RHS.N / 2) / RHS.N; 132 N /= RHS; 138 Prob += RHS; 144 Prob -= RHS; 150 Prob *= RHS; 156 Prob *= RHS; 162 Prob /= RHS; [all …]
|
H A D | KnownBits.h | 303 return KnownBits(Zero & RHS.Zero, One & RHS.One); in intersectWith() 313 return KnownBits(Zero | RHS.Zero, One | RHS.One); in unionWith() 478 LHS &= RHS; 483 RHS &= LHS; 484 return std::move(RHS); 488 LHS |= RHS; 493 RHS |= LHS; 494 return std::move(RHS); 498 LHS ^= RHS; 503 RHS ^= LHS; [all …]
|
H A D | SMTAPI.h | 67 friend bool operator==(SMTSort const &LHS, SMTSort const &RHS) { 68 return LHS.equal_to(RHS); 114 friend bool operator==(SMTExpr const &LHS, SMTExpr const &RHS) { 115 return LHS.equal_to(RHS); 280 const SMTExprRef &RHS) = 0; 285 const SMTExprRef &RHS, 291 const SMTExprRef &RHS) = 0; 296 const SMTExprRef &RHS) = 0; 301 const SMTExprRef &RHS, 316 const SMTExprRef &RHS, [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | APSInt.h | 129 *this = urem(RHS); 131 *this = srem(RHS); 137 *this = udiv(RHS); 144 return IsUnsigned ? APSInt(urem(RHS), true) : APSInt(srem(RHS), false); 148 return IsUnsigned ? APSInt(udiv(RHS), true) : APSInt(sdiv(RHS), false); 168 return IsUnsigned ? ult(RHS) : slt(RHS); 172 return IsUnsigned ? ugt(RHS) : sgt(RHS); 176 return IsUnsigned ? ule(RHS) : sle(RHS); 180 return IsUnsigned ? uge(RHS) : sge(RHS); 184 return eq(RHS); [all …]
|
H A D | SmallBitVector.h | 157 if (RHS.isSmall()) in SmallBitVector() 158 X = RHS.X; in SmallBitVector() 163 SmallBitVector(SmallBitVector &&RHS) : X(RHS.X) { in SmallBitVector() argument 164 RHS.X = 1; in SmallBitVector() 618 X = RHS.X; 626 X = RHS.X; 635 swap(RHS); 712 Result &= RHS; 719 Result |= RHS; 726 Result ^= RHS; [all …]
|
H A D | APInt.h | 1130 bool ule(uint64_t RHS) const { return !ugt(RHS); } in ule() argument 1146 bool sle(uint64_t RHS) const { return !sgt(RHS); } in sle() argument 1154 bool ugt(const APInt &RHS) const { return !ule(RHS); } in ugt() argument 1201 bool uge(uint64_t RHS) const { return !ult(RHS); } in uge() argument 1217 bool sge(int64_t RHS) const { return !slt(RHS); } in sge() argument 2057 a &= RHS; 2077 a |= RHS; 2097 a ^= RHS; 2127 a += RHS; 2148 a -= RHS; [all …]
|
H A D | SparseBitVector.h | 79 return !(*this == RHS); 433 return AtEnd == RHS.AtEnd && RHS.BitNumber == BitNumber; 458 if (this == &RHS) 559 if (this == &RHS) 589 if (this == &RHS) 638 if (this == &RHS) { in intersectWithComplement() 775 Result &= RHS; in contains() 825 return LHS |= *RHS; 843 return LHS &= *RHS; 853 Result |= RHS; [all …]
|
/freebsd/contrib/llvm-project/clang/include/clang/APINotes/ |
H A D | Types.h | 92 if (RHS.Unavailable) { 122 LHS.SwiftPrivate == RHS.SwiftPrivate && LHS.SwiftName == RHS.SwiftName; 127 return !(LHS == RHS); 188 return !(LHS == RHS); 295 return !(LHS == RHS); 335 Type = RHS.Type; 346 LHS.Nullable == RHS.Nullable && LHS.Type == RHS.Type; 350 return !(LHS == RHS); 406 return !(LHS == RHS); 474 return !(LHS == RHS); [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Remarks/ |
H A D | Remark.h | 152 if (!LHS && !RHS) 154 if (!LHS && RHS) 156 if (LHS && !RHS) 158 return *LHS < *RHS; 173 std::make_tuple(RHS.SourceFilePath, RHS.SourceLine, RHS.SourceColumn); 177 return LHS.Key == RHS.Key && LHS.Val == RHS.Val && LHS.Loc == RHS.Loc; 186 std::make_tuple(RHS.Key, RHS.Val, RHS.Loc); 192 LHS.FunctionName == RHS.FunctionName && LHS.Loc == RHS.Loc && 193 LHS.Hotness == RHS.Hotness && LHS.Args == RHS.Args; 203 std::make_tuple(RHS.RemarkType, RHS.PassName, RHS.RemarkName, [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/IR/ |
H A D | LLVMContextImpl.h | 129 if (RHS == getEmptyKey() || RHS == getTombstoneKey()) 182 if (RHS == getEmptyKey() || RHS == getTombstoneKey()) 231 if (RHS == getEmptyKey() || RHS == getTombstoneKey()) 478 return Tag == RHS->getTag() && Name == RHS->getRawName() && 514 return Tag == RHS->getTag() && Name == RHS->getRawName() && 564 return Tag == RHS->getTag() && Name == RHS->getRawName() && 618 return Tag == RHS->getTag() && Name == RHS->getRawName() && 716 return Flags == RHS->getFlags() && CC == RHS->getCC() && 1343 if (RHS == getEmptyKey() || RHS == getTombstoneKey()) 1373 if (RHS == getEmptyKey() || RHS == getTombstoneKey()) [all …]
|
/freebsd/contrib/llvm-project/clang/include/clang/Basic/ |
H A D | Thunk.h | 63 return memcmp(this, &RHS, sizeof(RHS)) < 0; in Less() 73 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Equals(RHS.Virtual); 78 return !(LHS == RHS); 83 if (LHS.NonVirtual < RHS.NonVirtual) 86 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual); 130 return memcmp(this, &RHS, sizeof(RHS)) < 0; in Less() 139 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Equals(RHS.Virtual); 143 return !(LHS == RHS); 150 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual); 177 return LHS.This == RHS.This && LHS.Return == RHS.Return && [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/ |
H A D | LVSort.cpp | 28 const LVObject *RHS) { in compareKind() argument 29 return std::string(LHS->kind()) < std::string(RHS->kind()); in compareKind() 35 return LHS->getLineNumber() < RHS->getLineNumber(); in compareLine() 41 return LHS->getName() < RHS->getName(); in compareName() 47 return LHS->getOffset() < RHS->getOffset(); in compareOffset() 53 if (LHS->getLowerAddress() < RHS->getLowerAddress()) in compareRange() 58 if (LHS->getLowerAddress() == RHS->getLowerAddress()) in compareRange() 59 return LHS->getUpperAddress() < RHS->getUpperAddress(); in compareRange() 72 RHS->kind(), RHS->getName(), RHS->getLineNumber(), RHS->getOffset()); in sortByKind() 84 RHS->getLineNumber(), RHS->getName(), RHS->kind(), RHS->getOffset()); in sortByLine() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/Shared/ |
H A D | ExecutorAddress.h | 112 return LHS.Addr == RHS.Addr; 116 return LHS.Addr != RHS.Addr; 120 return LHS.Addr < RHS.Addr; 124 return LHS.Addr <= RHS.Addr; 128 return LHS.Addr > RHS.Addr; 203 return LHS.Start == RHS.Start && LHS.End == RHS.End; 207 return !(LHS == RHS); 212 (LHS.Start == RHS.Start && LHS.End < RHS.End); 217 (LHS.Start == RHS.Start && LHS.End <= RHS.End); 222 (LHS.Start == RHS.Start && LHS.End > RHS.End); [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | MatrixBuilder.h | 44 RHS = B.CreateVectorSplat( in splatScalarOperandIfNeeded() 54 return {LHS, RHS}; in splatScalarOperandIfNeeded() 162 RHS = B.CreateVectorSplat( in CreateAdd() 176 ? B.CreateFAdd(LHS, RHS) in CreateAdd() 177 : B.CreateAdd(LHS, RHS); in CreateAdd() 187 RHS = B.CreateVectorSplat( in CreateSub() 208 std::tie(LHS, RHS) = splatScalarOperandIfNeeded(LHS, RHS); in CreateScalarMultiply() 210 return B.CreateFMul(LHS, RHS); in CreateScalarMultiply() 211 return B.CreateMul(LHS, RHS); in CreateScalarMultiply() 220 RHS = in CreateScalarDiv() [all …]
|
H A D | ValueHandle.h | 40 : ValueHandleBase(RHS.PrevPair.getInt(), RHS) {} in ValueHandleBase() 70 if (getValPtr() == RHS) 71 return RHS; 74 setValPtr(RHS); 77 return RHS; 82 return RHS.getValPtr(); 148 WeakVH(const WeakVH &RHS) in WeakVH() argument 286 AssertingVH(const AssertingVH &RHS) : ValueHandleBase(Assert, RHS) {} 298 setValPtr(RHS); 368 setValPtr(RHS); [all …]
|
H A D | PatternMatch.h | 918 AnyBinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} in AnyBinaryOp_match() 930 inline AnyBinaryOp_match<LHS, RHS> m_BinOp(const LHS &L, const RHS &R) { in m_BinOp() 966 BinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} in BinaryOp_match() 1041 template <typename RHS> 1043 m_FNegNSZ(const RHS &X) { in m_FNegNSZ() 1138 : L(LHS), R(RHS) {} in OverflowingBinaryOp_match() 1245 RHS R; 1263 inline DisjointOr_match<LHS, RHS> m_DisjointOr(const LHS &L, const RHS &R) { in m_DisjointOr() 1289 BinOpPred_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} in BinOpPred_match() 1895 MaxMin_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} in MaxMin_match() [all …]
|
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/ |
H A D | Arena.cpp | 19 auto Res = std::make_pair(&LHS, &RHS); in canonicalFormulaPair() 43 if (&LHS == &RHS) in makeAnd() 47 if (RHS.kind() == Formula::Literal) in makeAnd() 48 return RHS.literal() ? &LHS : &RHS; in makeAnd() 56 if (&LHS == &RHS) in makeOr() 60 if (RHS.kind() == Formula::Literal) in makeOr() 61 return RHS.literal() ? &RHS : &LHS; in makeOr() 80 if (&LHS == &RHS) in makeImplies() 85 return RHS.literal() ? &RHS : &makeNot(LHS); in makeImplies() 93 if (&LHS == &RHS) in makeEquals() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/ |
H A D | DWARFAddressRange.h | 44 assert(valid() && RHS.valid()); in intersects() 45 if (SectionIndex != RHS.SectionIndex) in intersects() 48 if (LowPC == HighPC || RHS.LowPC == RHS.HighPC) in intersects() 50 return LowPC < RHS.HighPC && RHS.LowPC < HighPC; in intersects() 63 bool merge(const DWARFAddressRange &RHS) { in merge() 64 if (!intersects(RHS)) in merge() 66 LowPC = std::min<uint64_t>(LowPC, RHS.LowPC); in merge() 67 HighPC = std::max<uint64_t>(HighPC, RHS.HighPC); in merge() 76 const DWARFAddressRange &RHS) { 77 …td::tie(LHS.SectionIndex, LHS.LowPC, LHS.HighPC) < std::tie(RHS.SectionIndex, RHS.LowPC, RHS.HighP… [all …]
|
/freebsd/contrib/llvm-project/llvm/tools/llvm-cov/ |
H A D | CoverageSummaryInfo.h | 39 Covered += RHS.Covered; 40 NumRegions += RHS.NumRegions; 80 Covered += RHS.Covered; 81 NumLines += RHS.NumLines; 121 Covered += RHS.Covered; 122 NumBranches += RHS.NumBranches; 162 CoveredPairs += RHS.CoveredPairs; 163 NumPairs += RHS.NumPairs; 201 Executed += RHS.Executed; 202 NumFunctions += RHS.NumFunctions; [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
H A D | MIPatternMatch.h | 396 BinaryOp_match(const LHS_P &LHS, const RHS_P &RHS) : L(LHS), R(RHS) {} 437 template <typename LHS, typename RHS> 443 template <typename LHS, typename RHS> 449 template <typename LHS, typename RHS> 451 m_GAdd(const LHS &L, const RHS &R) { 455 template <typename LHS, typename RHS> 482 m_GMul(const LHS &L, const RHS &R) { 506 m_GAnd(const LHS &L, const RHS &R) { 512 m_GXor(const LHS &L, const RHS &R) { 524 m_GShl(const LHS &L, const RHS &R) { [all …]
|
/freebsd/contrib/llvm-project/clang/lib/Tooling/ |
H A D | NodeIntrospection.cpp | 47 if (!LHS && !RHS) in locationCallLessThan() 49 if (LHS && !RHS) in locationCallLessThan() 51 if (!LHS && RHS) in locationCallLessThan() 53 auto compareResult = LHS->name().compare(RHS->name()); in locationCallLessThan() 58 return locationCallLessThan(LHS->on(), RHS->on()); in locationCallLessThan() 64 if (LHS.first.getBegin() < RHS.first.getBegin()) in operator ()() 66 else if (LHS.first.getBegin() != RHS.first.getBegin()) in operator ()() 69 if (LHS.first.getEnd() < RHS.first.getEnd()) in operator ()() 71 else if (LHS.first.getEnd() != RHS.first.getEnd()) in operator ()() 79 if (LHS.first == RHS.first) in operator ()() [all …]
|