Home
last modified time | relevance | path

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

12345678910>>...37

/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DTypeSize.h56 StackOffset operator+(const StackOffset &RHS) const {
57 return {Fixed + RHS.Fixed, Scalable + RHS.Scalable};
59 StackOffset operator-(const StackOffset &RHS) const {
60 return {Fixed - RHS.Fixed, Scalable - RHS.Scalable};
62 StackOffset &operator+=(const StackOffset &RHS) {
63 Fixed += RHS.Fixed;
64 Scalable += RHS.Scalable;
67 StackOffset &operator-=(const StackOffset &RHS) {
68 Fixed -= RHS.Fixed;
69 Scalable -= RHS.Scalable;
[all …]
H A DInstructionCost.h57 void propagateState(const InstructionCost &RHS) { in propagateState() argument
58 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.h100 BranchProbability &operator+=(BranchProbability RHS) {
101 assert(N != UnknownN && RHS.N != UnknownN &&
104 N = (uint64_t(N) + RHS.N > D) ? D : N + RHS.N;
108 BranchProbability &operator-=(BranchProbability RHS) {
109 assert(N != UnknownN && RHS.N != UnknownN &&
112 N = N < RHS.N ? 0 : N - RHS.N;
116 BranchProbability &operator*=(BranchProbability RHS) {
117 assert(N != UnknownN && RHS.N != UnknownN &&
119 N = (static_cast<uint64_t>(N) * RHS.N + D / 2) / D;
123 BranchProbability &operator*=(uint32_t RHS) {
[all …]
H A DKnownBits.h304 KnownBits intersectWith(const KnownBits &RHS) const { in intersectWith()
305 return KnownBits(Zero & RHS.Zero, One & RHS.One); in intersectWith()
314 KnownBits unionWith(const KnownBits &RHS) const { in unionWith()
315 return KnownBits(Zero | RHS.Zero, One | RHS.One); in unionWith()
319 static bool haveNoCommonBitsSet(const KnownBits &LHS, const KnownBits &RHS) { in haveNoCommonBitsSet()
320 return (LHS.Zero | RHS.Zero).isAllOnes(); in haveNoCommonBitsSet()
325 const KnownBits &RHS,
331 const KnownBits &RHS);
336 KnownBits RHS,
340 static KnownBits add(const KnownBits &LHS, const KnownBits &RHS,
[all …]
H A DSMTAPI.h68 friend bool operator==(SMTSort const &LHS, SMTSort const &RHS) {
69 return LHS.equal_to(RHS);
117 friend bool operator==(SMTExpr const &LHS, SMTExpr const &RHS) {
118 return LHS.equal_to(RHS);
206 virtual SMTExprRef mkBVAdd(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
209 virtual SMTExprRef mkBVSub(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
212 virtual SMTExprRef mkBVMul(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
215 virtual SMTExprRef mkBVSRem(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
218 virtual SMTExprRef mkBVURem(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
221 virtual SMTExprRef mkBVSDiv(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DSmallPtrSet.cpp163 const SmallPtrSetImplBase &RHS) { in copyFrom() argument
164 assert(&RHS != this && "Self-copy should be handled by the caller."); in copyFrom()
166 if (isSmall() && RHS.isSmall()) in copyFrom()
167 assert(CurArraySize == RHS.CurArraySize && in copyFrom()
171 if (RHS.isSmall()) { in copyFrom()
177 } else if (CurArraySize != RHS.CurArraySize) { in copyFrom()
179 CurArray = (const void**)safe_malloc(sizeof(void*) * RHS.CurArraySize); in copyFrom()
182 sizeof(void*) * RHS.CurArraySize); in copyFrom()
188 copyHelper(RHS); in copyFrom()
191 void SmallPtrSetImplBase::copyHelper(const SmallPtrSetImplBase &RHS) { in copyHelper() argument
[all …]
H A DKnownBits.cpp30 static KnownBits computeForAddCarry(const KnownBits &LHS, const KnownBits &RHS, in computeForAddCarry() argument
33 APInt PossibleSumZero = LHS.getMaxValue() + RHS.getMaxValue() + !CarryZero; in computeForAddCarry()
34 APInt PossibleSumOne = LHS.getMinValue() + RHS.getMinValue() + CarryOne; in computeForAddCarry()
37 APInt CarryKnownZero = ~(PossibleSumZero ^ LHS.Zero ^ RHS.Zero); in computeForAddCarry()
38 APInt CarryKnownOne = PossibleSumOne ^ LHS.One ^ RHS.One; in computeForAddCarry()
42 APInt RHSKnownUnion = RHS.Zero | RHS.One; in computeForAddCarry()
54 const KnownBits &LHS, const KnownBits &RHS, const KnownBits &Carry) { in computeForAddCarry() argument
57 LHS, RHS, Carry.Zero.getBoolValue(), Carry.One.getBoolValue()); in computeForAddCarry()
62 const KnownBits &RHS) { in computeForAddSub() argument
67 if (LHS.isUnknown() && RHS.isUnknown()) in computeForAddSub()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DAPSInt.h65 APSInt &operator=(APInt RHS) {
67 APInt::operator=(std::move(RHS));
71 APSInt &operator=(uint64_t RHS) {
73 APInt::operator=(RHS);
127 const APSInt &operator%=(const APSInt &RHS) {
128 assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
130 *this = urem(RHS);
132 *this = srem(RHS);
135 const APSInt &operator/=(const APSInt &RHS) {
136 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()
490 bool anyCommon(const SmallBitVector &RHS) const { in anyCommon() argument
491 if (isSmall() && RHS.isSmall()) in anyCommon()
492 return (getSmallBits() & RHS.getSmallBits()) != 0; in anyCommon()
493 if (!isSmall() && !RHS.isSmall()) in anyCommon()
[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...]
H A DAPInt.h618 APInt &operator=(const APInt &RHS) {
621 if (isSingleWord() && RHS.isSingleWord()) {
622 U.VAL = RHS.U.VAL;
623 BitWidth = RHS.BitWidth;
627 assignSlowCase(RHS);
658 APInt &operator=(uint64_t RHS) {
660 U.VAL = RHS;
663 U.pVal[0] = RHS;
674 APInt &operator&=(const APInt &RHS) {
675 assert(BitWidth == RHS.BitWidth && "Bit widths must be the same");
[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.h149 bool operator<(const std::optional<T> &LHS, const std::optional<T> &RHS) {
153 if (!LHS && !RHS)
155 if (!LHS && RHS)
157 if (LHS && !RHS)
159 return *LHS < *RHS;
162 inline bool operator==(const RemarkLocation &LHS, const RemarkLocation &RHS) {
163 return LHS.SourceFilePath == RHS.SourceFilePath &&
164 LHS.SourceLine == RHS.SourceLine &&
165 LHS.SourceColumn == RHS.SourceColumn;
168 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);
129 static bool isEqual(const KeyTy &LHS, const StructType *RHS) {
130 if (RHS == getEmptyKey() || RHS == getTombstoneKey())
132 return LHS == KeyTy(RHS);
135 static bool isEqual(const StructType *LHS, const StructType *RHS) {
136 return LHS == RHS;
181 static bool isEqual(const KeyTy &LHS, const FunctionType *RHS) {
182 if (RHS == getEmptyKey() || RHS == getTombstoneKey())
184 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.cpp27 const LVObject *RHS) { in compareKind() argument
28 return std::string(LHS->kind()) < std::string(RHS->kind()); in compareKind()
33 const LVObject *RHS) { in compareLine() argument
34 return LHS->getLineNumber() < RHS->getLineNumber(); in compareLine()
39 const LVObject *RHS) { in compareName() argument
40 return LHS->getName() < RHS->getName(); in compareName()
45 const LVObject *RHS) { in compareOffset() argument
46 return LHS->getOffset() < RHS->getOffset(); in compareOffset()
51 const LVObject *RHS) { in compareRange() argument
52 if (LHS->getLowerAddress() < RHS->getLowerAddress()) in compareRange()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DPatternMatch.h1075 AnyBinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} in AnyBinaryOp_match()
1086 template <typename LHS, typename RHS>
1087 inline AnyBinaryOp_match<LHS, RHS> m_BinOp(const LHS &L, const RHS &R) { in m_BinOp()
1088 return AnyBinaryOp_match<LHS, RHS>(L, R); in m_BinOp()
1123 BinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} in BinaryOp_match()
1140 template <typename LHS, typename RHS>
1141 inline BinaryOp_match<LHS, RHS, Instruction::Add> m_Add(const LHS &L, in m_Add()
1142 const RHS &R) { in m_Add()
1143 return BinaryOp_match<LHS, RHS, Instruction::Add>(L, R); in m_Add()
1146 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.h40 ValueHandleBase(const ValueHandleBase &RHS) in ValueHandleBase() argument
41 : ValueHandleBase(RHS.PrevPair.getInt(), RHS) {} in ValueHandleBase()
43 ValueHandleBase(HandleBaseKind Kind, const ValueHandleBase &RHS) in ValueHandleBase() argument
44 : PrevPair(nullptr, Kind), Val(RHS.getValPtr()) { in ValueHandleBase()
46 AddToExistingUseList(RHS.getPrevPtr()); in ValueHandleBase()
70 Value *operator=(Value *RHS) {
71 if (getValPtr() == RHS)
72 return RHS;
75 setValPtr(RHS);
78 return RHS;
[all …]
/freebsd/contrib/llvm-project/llvm/tools/llvm-cov/
H A DCoverageSummaryInfo.h38 RegionCoverageInfo &operator+=(const RegionCoverageInfo &RHS) {
39 Covered += RHS.Covered;
40 NumRegions += RHS.NumRegions;
44 void merge(const RegionCoverageInfo &RHS) { in merge() argument
45 Covered = std::max(Covered, RHS.Covered); in merge()
46 NumRegions = std::max(NumRegions, RHS.NumRegions); in merge()
79 LineCoverageInfo &operator+=(const LineCoverageInfo &RHS) {
80 Covered += RHS.Covered;
81 NumLines += RHS.NumLines;
85 void merge(const LineCoverageInfo &RHS) { in merge() argument
[all …]
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DArena.cpp18 canonicalFormulaPair(const Formula &LHS, const Formula &RHS) { in canonicalFormulaPair() argument
19 auto Res = std::make_pair(&LHS, &RHS); in canonicalFormulaPair()
20 if (&RHS < &LHS) // FIXME: use a deterministic order instead in canonicalFormulaPair()
41 const Formula &Arena::makeAnd(const Formula &LHS, const Formula &RHS) { in makeAnd() argument
42 return cached(Ands, canonicalFormulaPair(LHS, RHS), [&] { in makeAnd()
43 if (&LHS == &RHS) in makeAnd()
46 return LHS.literal() ? &RHS : &LHS; in makeAnd()
47 if (RHS.kind() == Formula::Literal) in makeAnd()
48 return RHS.literal() ? &LHS : &RHS; in makeAnd()
50 return &Formula::create(Alloc, Formula::And, {&LHS, &RHS}); in makeAnd()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DMIPatternMatch.h452 BinaryOp_match(const LHS_P &LHS, const RHS_P &RHS) : L(LHS), R(RHS) {}
482 BinaryOpc_match(unsigned Opcode, const LHS_P &LHS, const RHS_P &RHS)
483 : Opc(Opcode), L(LHS), R(RHS) {}
505 template <typename LHS, typename RHS>
506 inline BinaryOpc_match<LHS, RHS, false> m_BinOp(unsigned Opcode, const LHS &L,
507 const RHS &R) {
508 return BinaryOpc_match<LHS, RHS, false>(Opcode, L, R);
511 template <typename LHS, typename RHS>
512 inline BinaryOpc_match<LHS, RHS, true>
513 m_CommutativeBinOp(unsigned Opcode, const LHS &L, const RHS &R) {
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFAddressRange.h44 bool intersects(const DWARFAddressRange &RHS) const { in intersects()
45 assert(valid() && RHS.valid()); in intersects()
46 if (SectionIndex != RHS.SectionIndex) in intersects()
49 if (LowPC == HighPC || RHS.LowPC == RHS.HighPC) in intersects()
51 return LowPC < RHS.HighPC && RHS.LowPC < HighPC; in intersects()
64 bool merge(const DWARFAddressRange &RHS) { in merge()
65 if (!intersects(RHS)) in merge()
67 LowPC = std::min<uint64_t>(LowPC, RHS.LowPC); in merge()
68 HighPC = std::max<uint64_t>(HighPC, RHS.HighPC); in merge()
78 const DWARFAddressRange &RHS) {
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/Shared/
H A DExecutorAddress.h142 friend bool operator==(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
143 return LHS.Addr == RHS.Addr;
146 friend bool operator!=(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
147 return LHS.Addr != RHS.Addr;
150 friend bool operator<(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
151 return LHS.Addr < RHS.Addr;
154 friend bool operator<=(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
155 return LHS.Addr <= RHS.Addr;
158 friend bool operator>(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
159 return LHS.Addr > RHS.Addr;
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DSDPatternMatch.h538 m_SetCC(const T0_P &LHS, const T1_P &RHS, const T2_P &CC) {
539 return TernaryOpc_match<T0_P, T1_P, T2_P>(ISD::SETCC, LHS, RHS, CC);
544 m_c_SetCC(const T0_P &LHS, const T1_P &RHS, const T2_P &CC) {
545 return TernaryOpc_match<T0_P, T1_P, T2_P, true, false>(ISD::SETCC, LHS, RHS,
575 template <typename LHS, typename RHS, typename IDX>
576 inline TernaryOpc_match<LHS, RHS, IDX>
577 m_InsertSubvector(const LHS &Base, const RHS &Sub, const IDX &Idx) {
578 return TernaryOpc_match<LHS, RHS, IDX>(ISD::INSERT_SUBVECTOR, Base, Sub, Idx);
587 RHS_P RHS;
591 : Opcode(Opc), LHS(L), RHS(R), Flags(Flgs) {}
[all …]

12345678910>>...37