Home
last modified time | relevance | path

Searched full:rhs (Results 1 – 25 of 3377) sorted by relevance

12345678910>>...136

/llvm-project/openmp/runtime/src/
H A Dkmp_atomic.h27 // if the rhs is cmplx80 or cmplx128 typedef'ed datatype.
54 const std::complex<type_rhs> &rhs) { in __kmp_lhs_div_rhs() argument
57 type_rhs c = rhs.real(); in __kmp_lhs_div_rhs()
58 type_rhs d = rhs.imag(); in __kmp_lhs_div_rhs()
73 void operator/=(const __kmp_cmplx64_t &rhs) {
75 *this = __kmp_lhs_div_rhs(lhs, rhs);
78 __kmp_cmplx64_t operator/(const __kmp_cmplx64_t &rhs) {
80 return __kmp_lhs_div_rhs(lhs, rhs);
94 std::complex<float> rhs = b; member
95 return (lhs + rhs);
[all …]
/llvm-project/libcxx/test/std/utilities/any/any.class/any.assign/
H A Dvalue.pass.cpp25 template <class LHS, class RHS>
28 assert(RHS::count == 0); in test_assign_value()
30 RHS::reset(); in test_assign_value()
33 const std::any rhs = RHS(2); in test_assign_value() local
36 assert(RHS::count == 1); in test_assign_value()
37 assert(RHS::copied == 0); in test_assign_value()
39 lhs = rhs; in test_assign_value()
41 assert(RHS::copied == 1); in test_assign_value()
43 assert(RHS::count == 2); in test_assign_value()
45 assertContains<RHS>(lhs, 2); in test_assign_value()
[all …]
/llvm-project/libcxx/test/std/ranges/range.factories/range.iota.view/
H A Dtypes.h22 friend constexpr SomeInt& operator+=(SomeInt &lhs, const SomeInt& rhs) {
23 lhs.value_ += rhs.value_; return lhs;
25 friend constexpr SomeInt& operator-=(SomeInt &lhs, const SomeInt& rhs) {
26 lhs.value_ -= rhs.value_; return lhs;
29 friend constexpr SomeInt& operator+=(SomeInt &lhs, difference_type rhs) {
30 lhs.value_ += rhs; return lhs;
32 friend constexpr SomeInt& operator-=(SomeInt &lhs, difference_type rhs) {
33 lhs.value_ -= rhs; return lhs;
36 friend constexpr SomeInt operator+(SomeInt lhs, SomeInt rhs) {
37 return SomeInt{lhs.value_ + rhs.value_};
[all …]
/llvm-project/llvm/lib/Support/
H A DSmallPtrSet.cpp163 const SmallPtrSetImplBase &RHS) { in CopyFrom()
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 CopyHelper()
177 } else if (CurArraySize != RHS.CurArraySize) { in CopyHelper()
179 CurArray = (const void**)safe_malloc(sizeof(void*) * RHS.CurArraySize); in CopyHelper()
182 sizeof(void*) * RHS.CurArraySize); in MoveFrom() argument
188 copyHelper(RHS); in MoveHelper()
191 void SmallPtrSetImplBase::copyHelper(const SmallPtrSetImplBase &RHS) { in MoveHelper()
144 CopyFrom(const SmallPtrSetImplBase & RHS) CopyFrom() argument
170 CopyHelper(const SmallPtrSetImplBase & RHS) CopyHelper() argument
189 MoveHelper(unsigned SmallSize,SmallPtrSetImplBase && RHS) MoveHelper() argument
213 swap(SmallPtrSetImplBase & RHS) swap() argument
[all...]
H A DKnownBits.cpp30 static KnownBits computeForAddCarry(const KnownBits &LHS, const KnownBits &RHS, in computeForAddCarry()
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 computeForAddSub()
57 LHS, RHS, Carry.Zero.getBoolValue(), Carry.One.getBoolValue()); in computeForAddSub()
62 const KnownBits &RHS) { in computeForAddSub()
21 computeForAddCarry(const KnownBits & LHS,const KnownBits & RHS,bool CarryZero,bool CarryOne) computeForAddCarry() argument
45 computeForAddCarry(const KnownBits & LHS,const KnownBits & RHS,const KnownBits & Carry) computeForAddCarry() argument
53 computeForAddSub(bool Add,bool NSW,bool NUW,const KnownBits & LHS,const KnownBits & RHS) computeForAddSub() argument
137 computeForSubBorrow(const KnownBits & LHS,KnownBits RHS,const KnownBits & Borrow) computeForSubBorrow() argument
178 umax(const KnownBits & LHS,const KnownBits & RHS) umax() argument
196 umin(const KnownBits & LHS,const KnownBits & RHS) umin() argument
202 smax(const KnownBits & LHS,const KnownBits & RHS) smax() argument
215 smin(const KnownBits & LHS,const KnownBits & RHS) smin() argument
228 abdu(const KnownBits & LHS,const KnownBits & RHS) abdu() argument
247 abds(KnownBits LHS,KnownBits RHS) abds() argument
285 shl(const KnownBits & LHS,const KnownBits & RHS,bool NUW,bool NSW,bool ShAmtNonZero) shl() argument
370 lshr(const KnownBits & LHS,const KnownBits & RHS,bool ShAmtNonZero,bool Exact) lshr() argument
428 ashr(const KnownBits & LHS,const KnownBits & RHS,bool ShAmtNonZero,bool Exact) ashr() argument
488 eq(const KnownBits & LHS,const KnownBits & RHS) eq() argument
496 ne(const KnownBits & LHS,const KnownBits & RHS) ne() argument
502 ugt(const KnownBits & LHS,const KnownBits & RHS) ugt() argument
512 uge(const KnownBits & LHS,const KnownBits & RHS) uge() argument
518 ult(const KnownBits & LHS,const KnownBits & RHS) ult() argument
522 ule(const KnownBits & LHS,const KnownBits & RHS) ule() argument
526 sgt(const KnownBits & LHS,const KnownBits & RHS) sgt() argument
536 sge(const KnownBits & LHS,const KnownBits & RHS) sge() argument
542 slt(const KnownBits & LHS,const KnownBits & RHS) slt() argument
546 sle(const KnownBits & LHS,const KnownBits & RHS) sle() argument
610 computeForSatAddSub(bool Add,bool Signed,const KnownBits & LHS,const KnownBits & RHS) computeForSatAddSub() argument
753 sadd_sat(const KnownBits & LHS,const KnownBits & RHS) sadd_sat() argument
756 ssub_sat(const KnownBits & LHS,const KnownBits & RHS) ssub_sat() argument
759 uadd_sat(const KnownBits & LHS,const KnownBits & RHS) uadd_sat() argument
762 usub_sat(const KnownBits & LHS,const KnownBits & RHS) usub_sat() argument
766 avgCompute(KnownBits LHS,KnownBits RHS,bool IsCeil,bool IsSigned) avgCompute() argument
777 avgFloorS(const KnownBits & LHS,const KnownBits & RHS) avgFloorS() argument
782 avgFloorU(const KnownBits & LHS,const KnownBits & RHS) avgFloorU() argument
787 avgCeilS(const KnownBits & LHS,const KnownBits & RHS) avgCeilS() argument
792 avgCeilU(const KnownBits & LHS,const KnownBits & RHS) avgCeilU() argument
797 mul(const KnownBits & LHS,const KnownBits & RHS,bool NoUndefSelfMultiply) mul() argument
894 mulhs(const KnownBits & LHS,const KnownBits & RHS) mulhs() argument
902 mulhu(const KnownBits & LHS,const KnownBits & RHS) mulhu() argument
911 divComputeLowBit(KnownBits Known,const KnownBits & LHS,const KnownBits & RHS,bool Exact) divComputeLowBit() argument
946 sdiv(const KnownBits & LHS,const KnownBits & RHS,bool Exact) sdiv() argument
1002 udiv(const KnownBits & LHS,const KnownBits & RHS,bool Exact) udiv() argument
1029 remGetLowBits(const KnownBits & LHS,const KnownBits & RHS) remGetLowBits() argument
1042 urem(const KnownBits & LHS,const KnownBits & RHS) urem() argument
1059 srem(const KnownBits & LHS,const KnownBits & RHS) srem() argument
1084 operator &=(const KnownBits & RHS) operator &=() argument
1092 operator |=(const KnownBits & RHS) operator |=() argument
1100 operator ^=(const KnownBits & RHS) operator ^=() argument
[all...]
/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()
95 /// invalid, and it also inherits any invalid state from the RHS.
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) {
[all...]
H A DKnownBits.h298 /// RHS.
303 KnownBits intersectWith(const KnownBits &RHS) const {
304 return KnownBits(Zero & RHS.Zero, One & RHS.One);
308 /// RHS or both.
313 KnownBits unionWith(const KnownBits &RHS) const {
314 return KnownBits(Zero | RHS.Zero, One | RHS.One);
317 /// Return true if LHS and RHS have no common bits set. in haveNoCommonBitsSet()
318 static bool haveNoCommonBitsSet(const KnownBits &LHS, const KnownBits &RHS) {
[all...]
H A DAlignment.h46 friend bool operator==(Align Lhs, Align Rhs);
47 friend bool operator!=(Align Lhs, Align Rhs);
48 friend bool operator<=(Align Lhs, Align Rhs);
49 friend bool operator>=(Align Lhs, Align Rhs);
50 friend bool operator<(Align Lhs, Align Rhs);
51 friend bool operator>(Align Lhs, Align Rhs);
232 /// Comparisons between Align and scalars. Rhs must be positive.
233 inline bool operator==(Align Lhs, uint64_t Rhs) {
234 ALIGN_CHECK_ISPOSITIVE(Rhs);
235 return Lhs.value() == 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 …]
/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 …]
/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
[all...]
/llvm-project/polly/test/ScopInfo/
H A Dcfg_consequences.ll3 ; void consequences(int *A, int bool_cond, int lhs, int rhs) {
16 ; if (lhs < rhs)
21 ; if (lhs <= rhs)
26 ; if (lhs > rhs)
31 ; if (lhs >= rhs)
36 ; if (lhs == rhs)
41 ; if (lhs != rhs)
49 ; CHECK-NEXT: [bool_cond, lhs, rhs] -> { Stmt_BC[] };
51 ; CHECK-NEXT: [bool_cond, lhs, rhs] -> { Stmt_BC[] -> [0] };
53 ; CHECK-NEXT: [bool_cond, lhs, rhs] -> { Stmt_BC[] -> MemRef_A[0] };
[all …]
/llvm-project/lldb/bindings/python/
H A Dpython-extensions.swig3 def __eq__(self, rhs):
4 if not isinstance(rhs, type(self)):
7 return getattr(_lldb,self.__class__.__name__+"___eq__")(self, rhs)
9 def __ne__(self, rhs):
10 if not isinstance(rhs, type(self)):
13 return getattr(_lldb,self.__class__.__name__+"___ne__")(self, rhs)
19 def __eq__(self, rhs):
20 if not isinstance(rhs, type(self)):
23 return getattr(_lldb,self.__class__.__name__+"___eq__")(self, rhs)
25 def __ne__(self, rhs):
[all …]
/llvm-project/libcxx/src/
H A Dios.cpp245 void ios_base::copyfmt(const ios_base& rhs) { in copyfmt() argument
252 if (__event_cap_ < rhs.__event_size_) { in copyfmt()
253 size_t newesize = sizeof(event_callback) * rhs.__event_size_; in copyfmt()
258 size_t newisize = sizeof(int) * rhs.__event_size_; in copyfmt()
263 if (__iarray_cap_ < rhs.__iarray_size_) { in copyfmt()
264 size_t newsize = sizeof(long) * rhs.__iarray_size_; in copyfmt()
269 if (__parray_cap_ < rhs.__parray_size_) { in copyfmt()
270 size_t newsize = sizeof(void*) * rhs.__parray_size_; in copyfmt()
276 __fmtflags_ = rhs.__fmtflags_; in copyfmt()
277 __precision_ = rhs in copyfmt()
309 move(ios_base & rhs) move() argument
341 swap(ios_base & rhs) swap() argument
[all...]
/llvm-project/flang/test/Semantics/
H A Dcollectives05.f9019 pure function derived_type_op(lhs, rhs) result(lhs_op_rhs)
20 class(foo_t), intent(in) :: lhs, rhs local
22 lhs_op_rhs%n = lhs%n + rhs%n
187 pure function left(lhs, rhs) result(lhs_op_rhs)
188 type(foo_t), intent(in) :: lhs, rhs local
193 pure function char_op(lhs, rhs) result(lhs_op_rhs)
194 character(len=1), intent(in) :: lhs, rhs local
196 lhs_op_rhs = min(lhs, rhs)
199 pure function real_op(lhs, rhs) result(lhs_op_rhs)
200 real, intent(in) :: lhs, rhs local
[all …]
/llvm-project/libcxx/test/std/algorithms/
H A Drobust_against_proxy_iterators_lifetime_bugs.pass.cpp63 Value(const Value& rhs) : i_(rhs.i_) { in Value()
64 assert(lifetime_cache.contains(&rhs)); in Value()
65 assert(!rhs.moved_from_); in Value()
70 Value(Value&& rhs) noexcept : i_(rhs.i_) { in Value()
71 assert(lifetime_cache.contains(&rhs)); in Value()
73 assert(!rhs.moved_from_); in Value()
74 rhs.moved_from_ = true; in Value()
80 Value& operator=(const Value& rhs) { in operator =()
100 operator <(const Value & lhs,const Value & rhs) operator <() argument
107 operator ==(const Value & lhs,const Value & rhs) operator ==() argument
183 operator <(const Reference & lhs,const Reference & rhs) operator <() argument
190 operator ==(const Reference & lhs,const Reference & rhs) operator ==() argument
197 swap(Reference lhs,Reference rhs) swap() argument
217 LifetimeIterator(const LifetimeIterator & rhs) LifetimeIterator() argument
221 operator =(const LifetimeIterator & rhs) operator =() argument
230 LifetimeIterator(LifetimeIterator && rhs) LifetimeIterator() argument
236 operator =(LifetimeIterator && rhs) operator =() argument
267 operator ==(const LifetimeIterator & lhs,const LifetimeIterator & rhs) operator ==() argument
271 operator !=(const LifetimeIterator & lhs,const LifetimeIterator & rhs) operator !=() argument
310 operator <(const LifetimeIterator & lhs,const LifetimeIterator & rhs) operator <() argument
315 operator >(const LifetimeIterator & lhs,const LifetimeIterator & rhs) operator >() argument
320 operator <=(const LifetimeIterator & lhs,const LifetimeIterator & rhs) operator <=() argument
325 operator >=(const LifetimeIterator & lhs,const LifetimeIterator & rhs) operator >=() argument
345 operator -(LifetimeIterator lhs,LifetimeIterator rhs) operator -() argument
401 operator <(const Reference & lhs,const Reference & rhs) operator <() argument
406 operator ==(const Reference & lhs,const Reference & rhs) operator ==() argument
411 swap(Reference lhs,Reference rhs) swap() argument
429 ConstexprIterator(const ConstexprIterator & rhs) ConstexprIterator() argument
433 operator =(const ConstexprIterator & rhs) operator =() argument
442 ConstexprIterator(ConstexprIterator && rhs) ConstexprIterator() argument
448 operator =(ConstexprIterator && rhs) operator =() argument
479 operator ==(const ConstexprIterator & lhs,const ConstexprIterator & rhs) operator ==() argument
484 operator !=(const ConstexprIterator & lhs,const ConstexprIterator & rhs) operator !=() argument
522 operator <=>(const ConstexprIterator & lhs,const ConstexprIterator & rhs) operator <=>() argument
542 operator -(ConstexprIterator lhs,ConstexprIterator rhs) operator -() argument
[all...]
/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/
H A Dmismatch.pass.cpp46 TEST_CONSTEXPR_CXX20 void check(Container1 lhs, Container2 rhs, size_t offset) { in check()
47 if (lhs.size() == rhs.size()) { in check()
48 assert(std::mismatch(Iter(lhs.data()), Iter(lhs.data() + lhs.size()), Iter(rhs.data())) == in check()
49 std::make_pair(Iter(lhs.data() + offset), Iter(rhs.data() + offset))); in check()
53 Iter(rhs.data()), in check()
55 std::make_pair(Iter(lhs.data() + offset), Iter(rhs.data() + offset))); in check()
60 std::mismatch(Iter(lhs.data()), Iter(lhs.data() + lhs.size()), Iter(rhs.data()), Iter(rhs.data() + rhs.size())) == in check()
61 std::make_pair(Iter(lhs.data() + offset), Iter(rhs in check()
43 check(Container1 lhs,Container2 rhs,size_t offset) check() argument
76 operator ==(const NonTrivialMod4Comp & lhs,const NonTrivialMod4Comp & rhs) operator ==() argument
99 std::array<int, 0> rhs = {}; test() local
105 std::array<int, 8> rhs = {0, 1, 2, 3, 0, 1, 2, 3}; test() local
111 std::array<int, 8> rhs = {0, 1, 2, 3, 0, 1, 2, 3}; test() local
117 std::array<int, 2> rhs = {0, 1}; test() local
123 std::array<int, 8> rhs = {0, 1, 2, 2, 0, 1, 2, 3}; test() local
129 std::array<int, 4> rhs = {0, 0, 4, 4}; test() local
153 std::array<NonTrivialMod4Comp, 8> rhs = {1, 2, 3, 4, 1, 6, 7, 8}; test() local
159 std::array<NonTrivialMod4Comp, 8> rhs = {1, 2, 3, 4, 5, 6, 7, 8}; test() local
166 std::array<TriviallyEqualityComparable, 8> rhs = {1, 2, 3, 4, 5, 6, 7, 8}; test() local
172 std::array<TriviallyEqualityComparable, 8> rhs = {1, 2, 3, 4, 5, 6, 7, 8}; test() local
189 std::vector<char> rhs(256); main() local
202 std::vector<int> rhs(256); main() local
218 std::vector<char> rhs(vec_size); main() local
230 std::vector<int> rhs(vec_size); main() local
[all...]
/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
[all...]
/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyInstrFloat.td27 defm _F32 : I<(outs F32:$dst), (ins F32:$lhs, F32:$rhs), (outs), (ins),
28 [(set F32:$dst, (node F32:$lhs, F32:$rhs))],
29 !strconcat("f32.", !strconcat(name, "\t$dst, $lhs, $rhs")),
31 defm _F64 : I<(outs F64:$dst), (ins F64:$lhs, F64:$rhs), (outs), (ins),
32 [(set F64:$dst, (node F64:$lhs, F64:$rhs))],
33 !strconcat("f64.", !strconcat(name, "\t$dst, $lhs, $rhs")),
37 defm _F32 : I<(outs I32:$dst), (ins F32:$lhs, F32:$rhs), (outs), (ins),
38 [(set I32:$dst, (setcc F32:$lhs, F32:$rhs, cond))],
39 !strconcat("f32.", !strconcat(name, "\t$dst, $lhs, $rhs")),
41 defm _F64 : I<(outs I32:$dst), (ins F64:$lhs, F64:$rhs), (outs), (ins),
[all …]
/llvm-project/clang/test/CodeGen/
H A Daarch64-neon-vcmla.c
/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 …]
/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DMIPatternMatch.h426 BinaryOp_match(const LHS_P &LHS, const RHS_P &RHS) : L(LHS), R(RHS) {}
436 // the LHS sub-pattern (i.e. `L`) before the RHS sub-pattern
454 BinaryOpc_match(unsigned Opcode, const LHS_P &LHS, const RHS_P &RHS)
455 : Opc(Opcode), L(LHS), R(RHS) {}
466 // the LHS sub-pattern (i.e. `L`) before the RHS sub-pattern
477 template <typename LHS, typename RHS>
478 inline BinaryOpc_match<LHS, RHS, false> m_BinOp(unsigned Opcode, const LHS &L,
479 const RHS &R) {
480 return BinaryOpc_match<LHS, RHS, fals
[all...]
/llvm-project/llvm/include/llvm/CodeGen/
H A DSDPatternMatch.h489 m_SetCC(const T0_P &LHS, const T1_P &RHS, const T2_P &CC) {
490 return TernaryOpc_match<T0_P, T1_P, T2_P>(ISD::SETCC, LHS, RHS, CC);
495 m_c_SetCC(const T0_P &LHS, const T1_P &RHS, const T2_P &CC) {
496 return TernaryOpc_match<T0_P, T1_P, T2_P, true, false>(ISD::SETCC, LHS, RHS,
519 template <typename LHS, typename RHS, typename IDX>
520 inline TernaryOpc_match<LHS, RHS, IDX>
521 m_InsertSubvector(const LHS &Base, const RHS &Sub, const IDX &Idx) {
522 return TernaryOpc_match<LHS, RHS, IDX>(ISD::INSERT_SUBVECTOR, Base, Sub, Idx);
531 RHS_P RHS;
535 : Opcode(Opc), LHS(L), RHS(
[all...]
/llvm-project/llvm/include/llvm/IR/
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()
49 "RHS Assumed to be fixed width"); in splatScalarOperandIfNeeded()
51 cast<VectorType>(RHS->getType())->getElementCount(), LHS, in splatScalarOperandIfNeeded()
54 return {LHS, RHS}; in splatScalarOperandIfNeeded()
157 CreateAdd(Value * LHS,Value * RHS) CreateAdd() argument
182 CreateSub(Value * LHS,Value * RHS) CreateSub() argument
207 CreateScalarMultiply(Value * LHS,Value * RHS) CreateScalarMultiply() argument
216 CreateScalarDiv(Value * LHS,Value * RHS,bool IsUnsigned) CreateScalarDiv() argument
[all...]

12345678910>>...136