/llvm-project/openmp/runtime/src/ |
H A D | kmp_atomic.h | 53 std::complex<type_lhs> __kmp_lhs_div_rhs(const std::complex<type_lhs> &lhs, in __kmp_lhs_div_rhs() argument 55 type_lhs a = lhs.real(); in __kmp_lhs_div_rhs() 56 type_lhs b = lhs.imag(); in __kmp_lhs_div_rhs() 74 std::complex<double> lhs = *this; member 75 *this = __kmp_lhs_div_rhs(lhs, rhs); 79 std::complex<double> lhs = *this; member 80 return __kmp_lhs_div_rhs(lhs, rhs); 93 std::complex<float> lhs = *this; member 95 return (lhs + rhs); 98 std::complex<float> lhs = *this; member [all …]
|
/llvm-project/libcxx/test/std/ranges/range.factories/range.iota.view/ |
H A D | types.h | 22 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/libcxx/test/std/input.output/filesystems/class.path/path.member/ |
H A D | path.concat.pass.cpp | 50 MultiStringType lhs; member 82 // 1. Create a path, `LHS`, and reserve enough space to append `RHS`. 83 // This prevents `LHS` from allocating during the actual appending. 86 // 3. Concat `RHS` to `LHS` and check for the expected allocation behavior. 96 const Ptr L = TC.lhs; in doConcatSourceAllocTest() 102 path LHS(L); PathReserve(LHS, ReserveSize); in doConcatSourceAllocTest() local 106 LHS += RHS; in doConcatSourceAllocTest() 108 assert(LHS == E); in doConcatSourceAllocTest() 112 path LHS(L); PathReserve(LHS, ReserveSize); in doConcatSourceAllocTest() local 116 LHS += RHS; in doConcatSourceAllocTest() [all …]
|
H A D | path.append.pass.cpp | 44 MultiStringType lhs; member 120 // 1. Create a path, `LHS`, and reserve enough space to append `RHS`. 121 // This prevents `LHS` from allocating during the actual appending. 124 // 3. Append `RHS` to `LHS` and check for the expected allocation behavior. 134 const Ptr L = TC.lhs; in doAppendSourceAllocTest() 146 path LHS(L); PathReserve(LHS, ReserveSize); in doAppendSourceAllocTest() local 150 LHS /= RHS; in doAppendSourceAllocTest() 152 assert(PathEq(LHS, E)); in doAppendSourceAllocTest() 156 path LHS(L); PathReserve(LHS, ReserveSize); in doAppendSourceAllocTest() local 160 LHS /= RHS; in doAppendSourceAllocTest() [all …]
|
/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
H A D | mismatch.pass.cpp | 46 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() 51 assert(std::mismatch(Iter(lhs.data()), in check() 52 Iter(lhs.data() + lhs.size()), in check() 55 std::make_pair(Iter(lhs in check() 43 check(Container1 lhs,Container2 rhs,size_t offset) check() argument 76 operator ==(const NonTrivialMod4Comp & lhs,const NonTrivialMod4Comp & rhs) operator ==() argument 98 std::array<int, 0> lhs = {}; test() local 104 std::array<int, 8> lhs = {0, 1, 2, 3, 0, 1, 2, 3}; test() local 110 std::array<int, 8> lhs = {0, 1, 2, 2, 0, 1, 2, 3}; test() local 116 std::array<int, 8> lhs = {0, 1, 2, 2, 0, 1, 2, 3}; test() local 122 std::array<int, 2> lhs = {0, 1}; test() local 128 std::array<int, 4> lhs = {0, 2, 3, 4}; test() local 152 std::array<NonTrivialMod4Comp, 8> lhs = {1, 2, 3, 4, 5, 6, 7, 8}; test() local 158 std::array<NonTrivialMod4Comp, 8> lhs = {1, 2, 3, 4, 7, 6, 7, 8}; test() local 165 std::array<TriviallyEqualityComparable, 8> lhs = {1, 2, 3, 4, 5, 6, 7, 8}; test() local 171 std::array<TriviallyEqualityComparable, 8> lhs = {1, 2, 3, 4, 7, 6, 7, 8}; test() local 188 std::vector<char> lhs(256); main() local 201 std::vector<int> lhs(256); main() local 217 std::vector<char> lhs(vec_size); main() local 229 std::vector<int> lhs(vec_size); main() local [all...] |
/llvm-project/llvm/lib/Support/ |
H A D | KnownBits.cpp | 30 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() 41 APInt LHSKnownUnion = LHS.Zero | LHS.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() 61 const KnownBits &LHS, 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 52 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 288 __anon8264ec8e0402(const KnownBits &LHS, unsigned ShiftAmt) shl() argument 370 lshr(const KnownBits & LHS,const KnownBits & RHS,bool ShAmtNonZero,bool Exact) lshr() argument 373 __anon8264ec8e0502(const KnownBits &LHS, unsigned ShiftAmt) lshr() argument 428 ashr(const KnownBits & LHS,const KnownBits & RHS,bool ShAmtNonZero,bool Exact) ashr() argument 431 __anon8264ec8e0602(const KnownBits &LHS, unsigned ShiftAmt) 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 609 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 910 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 [all...] |
/llvm-project/polly/test/ScopInfo/ |
H A D | cfg_consequences.ll | 3 ; 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/libcxx/test/std/utilities/any/any.class/any.assign/ |
H A D | copy.pass.cpp | 24 template <class LHS, class RHS> 26 assert(LHS::count == 0); in test_copy_assign() 28 LHS::reset(); in test_copy_assign() 31 std::any lhs = LHS(1); in test_copy_assign() local 34 assert(LHS::count == 1); in test_copy_assign() 38 lhs = rhs; in test_copy_assign() 41 assert(LHS::count == 0); in test_copy_assign() 44 assertContains<RHS>(lhs, 2); in test_copy_assign() 47 assert(LHS::count == 0); in test_copy_assign() 51 template <class LHS> [all …]
|
H A D | value.pass.cpp | 25 template <class LHS, class RHS> 27 assert(LHS::count == 0); in test_assign_value() 29 LHS::reset(); in test_assign_value() 32 std::any lhs = LHS(1); in test_assign_value() local 35 assert(LHS::count == 1); in test_assign_value() 39 lhs = rhs; in test_assign_value() 42 assert(LHS::count == 0); in test_assign_value() 45 assertContains<RHS>(lhs, 2); in test_assign_value() 48 assert(LHS::count == 0); in test_assign_value() 50 LHS::reset(); in test_assign_value() [all …]
|
/llvm-project/flang/test/Semantics/ |
H A D | collectives05.f90 | 19 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 190 lhs_op_rhs = lhs 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) [all …]
|
/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyInstrFloat.td | 27 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 D | aarch64-neon-vcmla.c |
|
/llvm-project/llvm/include/llvm/Support/ |
H A D | Alignment.h | 46 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); 145 inline bool isAligned(Align Lhs, uint64_t SizeInBytes) { in isAligned() argument 146 return SizeInBytes % Lhs.value() == 0; in isAligned() 150 inline bool isAddrAligned(Align Lhs, const void *Addr) { in isAddrAligned() argument 151 return isAligned(Lhs, reinterpret_cas in isAddrAligned() [all...] |
H A D | KnownBits.h | 317 /// Return true if LHS and RHS have no common bits set. in haveNoCommonBitsSet() 318 static bool haveNoCommonBitsSet(const KnownBits &LHS, const KnownBits &RHS) { 319 return (LHS.Zero | RHS.Zero).isAllOnes(); 322 /// Compute known bits resulting from adding LHS, RHS and a 1-bit Carry. 324 const KnownBits &LHS, const KnownBits &RHS, const KnownBits &Carry); 326 /// Compute known bits resulting from adding LHS and RHS. 328 const KnownBits &LHS, const KnownBits &RHS); 330 /// Compute known bits results from subtracting RHS from LHS with 1-bit 332 static KnownBits computeForSubBorrow(const KnownBits &LHS, KnownBits RHS, 335 /// Compute knownbits resulting from addition of LHS an [all...] |
/llvm-project/llvm/include/llvm/IR/ |
H A D | MatrixBuilder.h | 37 std::pair<Value *, Value *> splatScalarOperandIfNeeded(Value *LHS, in splatScalarOperandIfNeeded() argument 39 assert((LHS->getType()->isVectorTy() || RHS->getType()->isVectorTy()) && in splatScalarOperandIfNeeded() 41 if (LHS->getType()->isVectorTy() && !RHS->getType()->isVectorTy()) { in splatScalarOperandIfNeeded() 42 assert(!isa<ScalableVectorType>(LHS->getType()) && in splatScalarOperandIfNeeded() 43 "LHS Assumed to be fixed width"); in splatScalarOperandIfNeeded() 45 cast<VectorType>(LHS->getType())->getElementCount(), RHS, in splatScalarOperandIfNeeded() 47 } else if (!LHS->getType()->isVectorTy() && RHS->getType()->isVectorTy()) { in splatScalarOperandIfNeeded() 50 LHS = B.CreateVectorSplat( in splatScalarOperandIfNeeded() 51 cast<VectorType>(RHS->getType())->getElementCount(), LHS, in splatScalarOperandIfNeeded() 54 return {LHS, RH 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...] |
H A D | PatternMatch.h | 1037 // The LHS is always matched first. 1038 AnyBinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} 1049 template <typename LHS, typename RHS> 1050 inline AnyBinaryOp_match<LHS, RHS> m_BinOp(const LHS &L, const RHS &R) { 1051 return AnyBinaryOp_match<LHS, RHS>(L, R); in AnyUnaryOp_match() 1085 // The LHS is always matched first. in match() 1086 BinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), in match() 2129 Value *LHS = II->getOperand(0), *RHS = II->getOperand(1); match() local 2145 auto *LHS = Cmp->getOperand(0); match() local [all...] |
/llvm-project/llvm/include/llvm/Remarks/ |
H A D | Remark.h | 148 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 D | MIPatternMatch.h | 426 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, 480 return BinaryOpc_match<LHS, RH [all...] |
/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | SDPatternMatch.h | 489 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); 530 LHS_P LHS; 535 : Opcode(Opc), LHS( [all...] |
/llvm-project/llvm/test/CodeGen/AArch64/ |
H A D | addsub_ext.ll | 5 define i32 @add_z_i8i32(i8 %v, i32 %lhs) minsize { 11 %r = add i32 %lhs, %vz 15 define i32 @add_z_shli8i32(i8 %v, i32 %lhs) minsize { 22 %r = add i32 %lhs, %s 26 define i64 @add_z_i8i64(i8 %v, i64 %lhs) minsize { 33 %r = add i64 %lhs, %vz 37 define i64 @add_z_shli8i64(i8 %v, i64 %lhs) minsize { 45 %r = add i64 %lhs, %s 49 define i32 @add_s_i8i32(i8 %v, i32 %lhs) minsize { 55 %r = add i32 %lhs, %vz [all …]
|
H A D | arm64-fp128.ll | 7 define fp128 @test_add(fp128 %lhs, fp128 %rhs) { 11 %val = fadd fp128 %lhs, %rhs 15 define fp128 @test_sub(fp128 %lhs, fp128 %rhs) { 19 %val = fsub fp128 %lhs, %rhs 23 define fp128 @test_mul(fp128 %lhs, fp128 %rhs) { 27 %val = fmul fp128 %lhs, %rhs 31 define fp128 @test_div(fp128 %lhs, fp128 %rhs) { 35 %val = fdiv fp128 %lhs, %rhs 177 define i1 @test_setcc1(fp128 %lhs, fp128 %rhs) { 188 %val = fcmp ole fp128 %lhs, [all...] |
/llvm-project/llvm/test/CodeGen/Thumb2/ |
H A D | thumb2-mov.ll | 6 define i32 @t2_const_var2_1_ok_1(i32 %lhs) { 9 %ret = add i32 %lhs, 11206827 ; 0x00ab00ab 13 define i32 @t2_const_var2_1_ok_2(i32 %lhs) { 17 %ret = add i32 %lhs, 11206843 ; 0x00ab00bb 21 define i32 @t2_const_var2_1_ok_3(i32 %lhs) { 25 %ret = add i32 %lhs, 27984043 ; 0x01ab00ab 29 define i32 @t2_const_var2_1_ok_4(i32 %lhs) { 33 %ret = add i32 %lhs, 27984299 ; 0x01ab01ab 37 define i32 @t2_const_var2_1_fail_1(i32 %lhs) { 42 %ret = add i32 %lhs, 28027649 ; 0x01abab01 [all …]
|
/llvm-project/llvm/test/CodeGen/AArch64/GlobalISel/ |
H A D | select-neon-vector-fcmp.mir | 13 ; CHECK: %lhs:fpr128 = COPY $q0 15 ; CHECK: %fcmp:fpr128 = nofpexcept FCMEQv2f64 %lhs, %rhs 18 %lhs:fpr(<2 x s64>) = COPY $q0 20 %fcmp:fpr(<2 x s64>) = G_FCMEQ %lhs, %rhs(<2 x s64>) 33 ; CHECK: %lhs:fpr128 = COPY $q0 35 ; CHECK: %fcmp:fpr128 = nofpexcept FCMGEv2f64 %lhs, %rhs 38 %lhs:fpr(<2 x s64>) = COPY $q0 40 %fcmp:fpr(<2 x s64>) = G_FCMGE %lhs, %rhs(<2 x s64>) 53 ; CHECK: %lhs:fpr128 = COPY $q0 55 ; CHECK: %fcmp:fpr128 = nofpexcept FCMGTv2f64 %lhs, %rhs [all …]
|
/llvm-project/polly/lib/External/isl/ |
H A D | isl_int_sioimath.c | 52 extern void isl_sioimath_swap(isl_sioimath_ptr lhs, isl_sioimath_ptr rhs); 53 extern void isl_sioimath_add_ui(isl_sioimath_ptr dst, isl_sioimath lhs, 55 extern void isl_sioimath_sub_ui(isl_sioimath_ptr dst, isl_sioimath lhs, 58 extern void isl_sioimath_add(isl_sioimath_ptr dst, isl_sioimath_src lhs, 60 extern void isl_sioimath_sub(isl_sioimath_ptr dst, isl_sioimath_src lhs, 62 extern void isl_sioimath_mul(isl_sioimath_ptr dst, isl_sioimath_src lhs, 64 extern void isl_sioimath_mul_2exp(isl_sioimath_ptr dst, isl_sioimath lhs, 66 extern void isl_sioimath_mul_si(isl_sioimath_ptr dst, isl_sioimath lhs, 68 extern void isl_sioimath_mul_ui(isl_sioimath_ptr dst, isl_sioimath lhs, 70 extern void isl_sioimath_pow_ui(isl_sioimath_ptr dst, isl_sioimath_src lhs, [all …]
|
/llvm-project/mlir/utils/tree-sitter-mlir/dialect/ |
H A D | arith.js | 10 // operation ::= `arith.addi` $lhs `,` $rhs attr-dict `:` 11 // type($result) operation ::= `arith.subi` $lhs `,` $rhs 13 // $lhs `,` $rhs attr-dict `:` type($result) operation ::= 14 // `arith.divui` $lhs `,` $rhs attr-dict `:` type($result) 15 // operation ::= `arith.ceildivsi` $lhs `,` $rhs attr-dict 16 // `:` type($result) operation ::= `arith.ceildivui` $lhs 18 // `arith.floordivsi` $lhs `,` $rhs attr-dict `:` 19 // type($result) operation ::= `arith.remsi` $lhs `,` $rhs 21 // $lhs `,` $rhs attr-dict `:` type($result) operation ::= 22 // `arith.muli` $lhs `,` $rhs attr-dict `:` type($result) [all …]
|