Home
last modified time | relevance | path

Searched refs:RHS (Results 1 – 25 of 830) sorted by relevance

12345678910>>...34

/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DSmallPtrSet.cpp144 void SmallPtrSetImplBase::CopyFrom(const SmallPtrSetImplBase &RHS) { in CopyFrom() argument
145 assert(&RHS != this && "Self-copy should be handled by the caller."); in CopyFrom()
147 if (isSmall() && RHS.isSmall()) in CopyFrom()
148 assert(CurArraySize == RHS.CurArraySize && in CopyFrom()
152 if (RHS.isSmall()) { in CopyFrom()
157 } else if (CurArraySize != RHS.CurArraySize) { in CopyFrom()
159 CurArray = (const void**)safe_malloc(sizeof(void*) * RHS.CurArraySize); in CopyFrom()
162 sizeof(void*) * RHS.CurArraySize); in CopyFrom()
167 CopyHelper(RHS); in CopyFrom()
170 void SmallPtrSetImplBase::CopyHelper(const SmallPtrSetImplBase &RHS) { in CopyHelper() argument
[all …]
H A DKnownBits.cpp21 static KnownBits computeForAddCarry(const KnownBits &LHS, const KnownBits &RHS, in computeForAddCarry() argument
24 APInt PossibleSumZero = LHS.getMaxValue() + RHS.getMaxValue() + !CarryZero; in computeForAddCarry()
25 APInt PossibleSumOne = LHS.getMinValue() + RHS.getMinValue() + CarryOne; in computeForAddCarry()
28 APInt CarryKnownZero = ~(PossibleSumZero ^ LHS.Zero ^ RHS.Zero); in computeForAddCarry()
29 APInt CarryKnownOne = PossibleSumOne ^ LHS.One ^ RHS.One; in computeForAddCarry()
33 APInt RHSKnownUnion = RHS.Zero | RHS.One; in computeForAddCarry()
45 const KnownBits &LHS, const KnownBits &RHS, const KnownBits &Carry) { in computeForAddCarry() argument
48 LHS, RHS, Carry.Zero.getBoolValue(), Carry.One.getBoolValue()); in computeForAddCarry()
53 const KnownBits &RHS) { in computeForAddSub() argument
58 if (LHS.isUnknown() && RHS.isUnknown()) in computeForAddSub()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DTypeSize.h55 StackOffset operator+(const StackOffset &RHS) const {
56 return {Fixed + RHS.Fixed, Scalable + RHS.Scalable};
58 StackOffset operator-(const StackOffset &RHS) const {
59 return {Fixed - RHS.Fixed, Scalable - RHS.Scalable};
61 StackOffset &operator+=(const StackOffset &RHS) {
62 Fixed += RHS.Fixed;
63 Scalable += RHS.Scalable;
66 StackOffset &operator-=(const StackOffset &RHS) {
67 Fixed -= RHS.Fixed;
68 Scalable -= RHS.Scalable;
[all …]
H A DInstructionCost.h56 void propagateState(const InstructionCost &RHS) { in propagateState() argument
57 if (RHS.State == Invalid) in propagateState()
99 InstructionCost &operator+=(const InstructionCost &RHS) {
100 propagateState(RHS);
104 if (AddOverflow(Value, RHS.Value, Result))
105 Result = RHS.Value > 0 ? getMaxValue() : getMinValue();
111 InstructionCost &operator+=(const CostType RHS) {
112 InstructionCost RHS2(RHS);
117 InstructionCost &operator-=(const InstructionCost &RHS) {
118 propagateState(RHS);
[all …]
H A DBranchProbability.h91 BranchProbability &operator+=(BranchProbability RHS) {
92 assert(N != UnknownN && RHS.N != UnknownN &&
95 N = (uint64_t(N) + RHS.N > D) ? D : N + RHS.N;
99 BranchProbability &operator-=(BranchProbability RHS) {
100 assert(N != UnknownN && RHS.N != UnknownN &&
103 N = N < RHS.N ? 0 : N - RHS.N;
107 BranchProbability &operator*=(BranchProbability RHS) {
108 assert(N != UnknownN && RHS.N != UnknownN &&
110 N = (static_cast<uint64_t>(N) * RHS.N + D / 2) / D;
114 BranchProbability &operator*=(uint32_t RHS) {
[all …]
H A DKnownBits.h300 KnownBits intersectWith(const KnownBits &RHS) const { in intersectWith()
301 return KnownBits(Zero & RHS.Zero, One & RHS.One); in intersectWith()
310 KnownBits unionWith(const KnownBits &RHS) const { in unionWith()
311 return KnownBits(Zero | RHS.Zero, One | RHS.One); in unionWith()
315 static bool haveNoCommonBitsSet(const KnownBits &LHS, const KnownBits &RHS) { in haveNoCommonBitsSet()
316 return (LHS.Zero | RHS.Zero).isAllOnes(); in haveNoCommonBitsSet()
321 const KnownBits &LHS, const KnownBits &RHS, const KnownBits &Carry);
325 const KnownBits &LHS, const KnownBits &RHS);
329 static KnownBits computeForSubBorrow(const KnownBits &LHS, KnownBits RHS,
333 static KnownBits sadd_sat(const KnownBits &LHS, const KnownBits &RHS);
[all …]
H A DSMTAPI.h67 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);
197 virtual SMTExprRef mkBVAdd(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
200 virtual SMTExprRef mkBVSub(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
203 virtual SMTExprRef mkBVMul(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
206 virtual SMTExprRef mkBVSRem(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
209 virtual SMTExprRef mkBVURem(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
212 virtual SMTExprRef mkBVSDiv(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DAPSInt.h64 APSInt &operator=(APInt RHS) {
66 APInt::operator=(std::move(RHS));
70 APSInt &operator=(uint64_t RHS) {
72 APInt::operator=(RHS);
126 const APSInt &operator%=(const APSInt &RHS) {
127 assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
129 *this = urem(RHS);
131 *this = srem(RHS);
134 const APSInt &operator/=(const APSInt &RHS) {
135 assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
[all …]
H A DSmallBitVector.h156 SmallBitVector(const SmallBitVector &RHS) { in SmallBitVector() argument
157 if (RHS.isSmall()) in SmallBitVector()
158 X = RHS.X; in SmallBitVector()
160 switchToLarge(new BitVector(*RHS.getPointer())); in SmallBitVector()
163 SmallBitVector(SmallBitVector &&RHS) : X(RHS.X) { in SmallBitVector() argument
164 RHS.X = 1; in SmallBitVector()
488 bool anyCommon(const SmallBitVector &RHS) const { in anyCommon() argument
489 if (isSmall() && RHS.isSmall()) in anyCommon()
490 return (getSmallBits() & RHS.getSmallBits()) != 0; in anyCommon()
491 if (!isSmall() && !RHS.isSmall()) in anyCommon()
[all …]
H A DAPInt.h598 APInt &operator=(const APInt &RHS) {
601 if (isSingleWord() && RHS.isSingleWord()) {
602 U.VAL = RHS.U.VAL;
603 BitWidth = RHS.BitWidth;
607 assignSlowCase(RHS);
638 APInt &operator=(uint64_t RHS) {
640 U.VAL = RHS;
643 U.pVal[0] = RHS;
654 APInt &operator&=(const APInt &RHS) {
655 assert(BitWidth == RHS.BitWidth && "Bit widths must be the same");
[all …]
H A DSparseBitVector.h69 bool operator==(const SparseBitVectorElement &RHS) const {
70 if (ElementIndex != RHS.ElementIndex)
73 if (Bits[i] != RHS.Bits[i])
78 bool operator!=(const SparseBitVectorElement &RHS) const {
79 return !(*this == RHS);
171 // Union this element with RHS and return true if this one changed.
172 bool unionWith(const SparseBitVectorElement &RHS) { in unionWith()
177 Bits[i] |= RHS.Bits[i]; in unionWith()
184 // Return true if we have any bits in common with RHS
185 bool intersects(const SparseBitVectorElement &RHS) cons
398 BitVector(RHS) BitVector() argument
446 SparseBitVector(const SparseBitVector & RHS) SparseBitVector() argument
448 SparseBitVector(SparseBitVector && RHS) SparseBitVector() argument
637 intersectWithComplement(const SparseBitVector & RHS) intersectWithComplement() argument
682 intersectWithComplement(const SparseBitVector<ElementSize> * RHS) intersectWithComplement() argument
739 intersects(const SparseBitVector<ElementSize> * RHS) intersects() argument
744 intersects(const SparseBitVector<ElementSize> & RHS) intersects() argument
773 contains(const SparseBitVector<ElementSize> & RHS) contains() argument
[all...]
/freebsd/contrib/llvm-project/clang/include/clang/APINotes/
H A DTypes.h94 CommonEntityInfo &operator|=(const CommonEntityInfo &RHS) {
96 if (RHS.Unavailable) {
99 UnavailableMsg = RHS.UnavailableMsg;
102 if (RHS.UnavailableInSwift) {
105 UnavailableMsg = RHS.UnavailableMsg;
109 setSwiftPrivate(RHS.isSwiftPrivate());
112 SwiftName = RHS.SwiftName;
121 const CommonEntityInfo &RHS) {
122 return LHS.UnavailableMsg == RHS.UnavailableMsg &&
123 LHS.Unavailable == RHS.Unavailable &&
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Remarks/
H A DRemark.h148 bool operator<(const std::optional<T> &LHS, const std::optional<T> &RHS) {
152 if (!LHS && !RHS)
154 if (!LHS && RHS)
156 if (LHS && !RHS)
158 return *LHS < *RHS;
161 inline bool operator==(const RemarkLocation &LHS, const RemarkLocation &RHS) {
162 return LHS.SourceFilePath == RHS.SourceFilePath &&
163 LHS.SourceLine == RHS.SourceLine &&
164 LHS.SourceColumn == RHS.SourceColumn;
167 inline bool operator!=(const RemarkLocation &LHS, const RemarkLocation &RHS) {
[all...]
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DLLVMContextImpl.h88 static bool isEqual(const APFloat &LHS, const APFloat &RHS) {
89 return LHS.bitwiseIsEqual(RHS);
130 static bool isEqual(const KeyTy &LHS, const StructType *RHS) {
131 if (RHS == getEmptyKey() || RHS == getTombstoneKey())
133 return LHS == KeyTy(RHS);
136 static bool isEqual(const StructType *LHS, const StructType *RHS) {
137 return LHS == RHS;
183 static bool isEqual(const KeyTy &LHS, const FunctionType *RHS) {
184 if (RHS == getEmptyKey() || RHS == getTombstoneKey())
186 return LHS == KeyTy(RHS);
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Basic/
H A DThunk.h63 bool Less(const VirtualAdjustment &RHS) const { in Less() argument
64 return memcmp(this, &RHS, sizeof(RHS)) < 0; in Less()
73 const ReturnAdjustment &RHS) {
74 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Equals(RHS.Virtual);
78 const ReturnAdjustment &RHS) {
79 return !(LHS == RHS);
83 const ReturnAdjustment &RHS) {
84 if (LHS.NonVirtual < RHS.NonVirtual)
87 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual);
130 bool Less(const VirtualAdjustment &RHS) const { in Less() argument
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVSort.cpp28 const LVObject *RHS) { in compareKind() argument
29 return std::string(LHS->kind()) < std::string(RHS->kind()); in compareKind()
34 const LVObject *RHS) { in compareLine() argument
35 return LHS->getLineNumber() < RHS->getLineNumber(); in compareLine()
40 const LVObject *RHS) { in compareName() argument
41 return LHS->getName() < RHS->getName(); in compareName()
46 const LVObject *RHS) { in compareOffset() argument
47 return LHS->getOffset() < RHS->getOffset(); in compareOffset()
52 const LVObject *RHS) { in compareRange() argument
53 if (LHS->getLowerAddress() < RHS->getLowerAddress()) in compareRange()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DPatternMatch.h1028 AnyBinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} in AnyBinaryOp_match()
1039 template <typename LHS, typename RHS>
1040 inline AnyBinaryOp_match<LHS, RHS> m_BinOp(const LHS &L, const RHS &R) { in m_BinOp()
1041 return AnyBinaryOp_match<LHS, RHS>(L, R); in m_BinOp()
1076 BinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} in BinaryOp_match()
1091 template <typename LHS, typename RHS>
1092 inline BinaryOp_match<LHS, RHS, Instruction::Add> m_Add(const LHS &L, in m_Add()
1093 const RHS &R) { in m_Add()
1094 return BinaryOp_match<LHS, RHS, Instruction::Add>(L, R); in m_Add()
1097 template <typename LHS, typename RHS>
[all …]
H A DMatrixBuilder.h38 Value *RHS) { in splatScalarOperandIfNeeded() argument
39 assert((LHS->getType()->isVectorTy() || RHS->getType()->isVectorTy()) && in splatScalarOperandIfNeeded()
41 if (LHS->getType()->isVectorTy() && !RHS->getType()->isVectorTy()) { in splatScalarOperandIfNeeded()
44 RHS = B.CreateVectorSplat( in splatScalarOperandIfNeeded()
45 cast<VectorType>(LHS->getType())->getElementCount(), RHS, in splatScalarOperandIfNeeded()
47 } else if (!LHS->getType()->isVectorTy() && RHS->getType()->isVectorTy()) { in splatScalarOperandIfNeeded()
48 assert(!isa<ScalableVectorType>(RHS->getType()) && in splatScalarOperandIfNeeded()
51 cast<VectorType>(RHS->getType())->getElementCount(), LHS, in splatScalarOperandIfNeeded()
54 return {LHS, RHS}; in splatScalarOperandIfNeeded()
126 CallInst *CreateMatrixMultiply(Value *LHS, Value *RHS, unsigned LHSRows,
[all …]
H A DValueHandle.h39 ValueHandleBase(const ValueHandleBase &RHS) in ValueHandleBase() argument
40 : ValueHandleBase(RHS.PrevPair.getInt(), RHS) {} in ValueHandleBase()
42 ValueHandleBase(HandleBaseKind Kind, const ValueHandleBase &RHS) in ValueHandleBase() argument
43 : PrevPair(nullptr, Kind), Val(RHS.getValPtr()) { in ValueHandleBase()
45 AddToExistingUseList(RHS.getPrevPtr()); in ValueHandleBase()
69 Value *operator=(Value *RHS) {
70 if (getValPtr() == RHS)
71 return RHS;
74 setValPtr(RHS);
77 return RHS;
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/Shared/
H A DExecutorAddress.h111 friend bool operator==(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
112 return LHS.Addr == RHS.Addr;
115 friend bool operator!=(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
116 return LHS.Addr != RHS.Addr;
119 friend bool operator<(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
120 return LHS.Addr < RHS.Addr;
123 friend bool operator<=(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
124 return LHS.Addr <= RHS.Addr;
127 friend bool operator>(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
128 return LHS.Addr > RHS.Addr;
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFAddressRange.h43 bool intersects(const DWARFAddressRange &RHS) const { in intersects()
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) {
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DMIPatternMatch.h396 BinaryOp_match(const LHS_P &LHS, const RHS_P &RHS) : L(LHS), R(RHS) {}
419 BinaryOpc_match(unsigned Opcode, const LHS_P &LHS, const RHS_P &RHS)
420 : Opc(Opcode), L(LHS), R(RHS) {}
437 template <typename LHS, typename RHS>
438 inline BinaryOpc_match<LHS, RHS, false> m_BinOp(unsigned Opcode, const LHS &L,
439 const RHS &R) {
440 return BinaryOpc_match<LHS, RHS, false>(Opcode, L, R);
443 template <typename LHS, typename RHS>
444 inline BinaryOpc_match<LHS, RHS, true>
445 m_CommutativeBinOp(unsigned Opcode, const LHS &L, const RHS &R) {
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DSDPatternMatch.h481 m_SetCC(const T0_P &LHS, const T1_P &RHS, const T2_P &CC) {
482 return TernaryOpc_match<T0_P, T1_P, T2_P, false, false>(ISD::SETCC, LHS, RHS,
488 m_c_SetCC(const T0_P &LHS, const T1_P &RHS, const T2_P &CC) {
489 return TernaryOpc_match<T0_P, T1_P, T2_P, true, false>(ISD::SETCC, LHS, RHS,
499 RHS_P RHS;
502 : Opcode(Opc), LHS(L), RHS(R) {}
510 RHS.match(Ctx, N->getOperand(EO.FirstIndex + 1))) ||
512 RHS.match(Ctx, N->getOperand(EO.FirstIndex)));
519 template <typename LHS, typename RHS>
520 inline BinaryOpc_match<LHS, RHS, false> m_BinOp(unsigned Opc, const LHS &L,
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DDXILResource.h24 bool operator==(const ResourceBinding &RHS) const {
26 std::tie(RHS.Space, RHS.LowerBound, RHS.Size);
28 bool operator!=(const ResourceBinding &RHS) const { return !(*this == RHS); }
37 bool operator==(const UAVInfo &RHS) const {
39 std::tie(RHS.GloballyCoherent, RHS.HasCounter, RHS.IsROV);
41 bool operator!=(const UAVInfo &RHS) const { return !(*this == RHS); }
48 bool operator==(const StructInfo &RHS) const {
49 return std::tie(Stride, Alignment) == std::tie(RHS.Stride, RHS.Alignment);
51 bool operator!=(const StructInfo &RHS) const { return !(*this == RHS); }
58 bool operator==(const TypedInfo &RHS) const {
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DDeclID.h135 friend bool operator==(const DeclIDBase &LHS, const DeclID &RHS) {
136 return LHS.ID == RHS;
138 friend bool operator!=(const DeclIDBase &LHS, const DeclID &RHS) {
139 return !operator==(LHS, RHS);
141 friend bool operator<(const DeclIDBase &LHS, const DeclID &RHS) {
142 return LHS.ID < RHS;
144 friend bool operator<=(const DeclIDBase &LHS, const DeclID &RHS) {
145 return LHS.ID <= RHS;
147 friend bool operator>(const DeclIDBase &LHS, const DeclID &RHS) {
148 return LHS.ID > RHS;
[all …]

12345678910>>...34