/llvm-project/flang/test/HLFIR/ |
H A D | product.fir | 1 // Test hlfir.product operation parse, verify (no errors), and unparse 13 …%0 = hlfir.product %arg0 dim %c_1 mask %mask_box : (!hlfir.expr<42xi32>, index, !fir.box<!fir.logi… 23 // CHECK-NEXT: hlfir.product %[[ARRAY]] dim %[[C1]] mask %[[BOX]] : (!hlfir.expr<42xi32>, index, … 35 …%0 = hlfir.product %arg0 dim %c_1 mask %mask_box : (!hlfir.expr<?xi32>, index, !fir.box<!fir.logic… 45 // CHECK-NEXT: hlfir.product %[[ARRAY:.*]] dim %[[C1]] mask %[[BOX]] : (!hlfir.expr<?xi32>, index… 57 …%0 = hlfir.product %arg0 dim %c_1 mask %mask_box : (!fir.box<!fir.array<42xi32>>, index, !fir.box<… 67 // CHECK-NEXT: hlfir.product %[[ARRAY:.*]] dim %[[C1]] mask %[[BOX]] : (!fir.box<!fir.array<42xi3… 79 …%0 = hlfir.product %arg0 dim %c_1 mask %mask_box : (!fir.box<!fir.array<?xi32>>, index, !fir.box<!… 89 // CHECK-NEXT: hlfir.product %[[ARRAY:.*]] dim %[[C1]] mask %[[BOX]] : (!fir.box<!fir.array<?xi32… 96 …%0 = hlfir.product %arg0 dim %c_1 mask %arg1 : (!fir.box<!fir.array<?xi32>>, index, !hlfir.expr<42… [all …]
|
/llvm-project/flang/test/Lower/HLFIR/ |
H A D | product.f90 | 1 ! Test lowering of PRODUCT intrinsic to HLFIR 4 ! simple 1 argument PRODUCT 7 s = PRODUCT(a) 13 ! CHECK-NEXT: %[[EXPR:.*]] = hlfir.product %[[ARRAY]]#0 {fastmath = #arith.fastmath<contract>} :… 18 ! product with by-ref DIM argument 21 s = PRODUCT(a, d) 29 ! CHECK-NEXT: %[[EXPR:.*]] = hlfir.product %[[ARRAY]]#0 dim %[[DIM]] {fastmath = #arith.fastmath… 35 ! product with scalar mask argument 39 s = PRODUCT(a, m) 46 ! CHECK-NEXT: %[[EXPR:.*]] = hlfir.product %[[ARRAY]]#0 mask %[[MASK]]#0 {fastmath = #arith.fast… [all …]
|
/llvm-project/flang/runtime/ |
H A D | product.cpp | 1 //===-- runtime/product.cpp -----------------------------------------------===// 9 // Implements PRODUCT for all required operand types and shapes. 68 "PRODUCT"); 74 "PRODUCT"); 80 "PRODUCT"); 86 "PRODUCT"); 95 "PRODUCT"); 105 "PRODUCT"); 113 "PRODUCT"); 121 "PRODUCT"); [all...] |
H A D | matmul.cpp | 79 CppTypeFor<RCAT, RKIND> *RESTRICT product, SubscriptValue rows, 84 std::memset(product, 0, rows * cols * sizeof *product); in MatrixTimesMatrix() argument 87 ResultType *RESTRICT p{product}; in MatrixTimesMatrix() 112 CppTypeFor<RCAT, RKIND> *RESTRICT product, SubscriptValue rows, in MatrixTimesMatrix() 119 product, rows, cols, x, y, n); in MatrixTimesMatrixHelper() argument 122 product, rows, cols, x, y, n, 0, *yColumnByteStride); in MatrixTimesMatrixHelper() 127 product, rows, cols, x, y, n, *xColumnByteStride); in MatrixTimesMatrixHelper() 130 product, rows, cols, x, y, n, *xColumnByteStride, *yColumnByteStride); in MatrixTimesMatrixHelper() 152 CppTypeFor<RCAT, RKIND> *RESTRICT product, SubscriptValu 162 MatrixTimesVector(CppTypeFor<RCAT,RKIND> * RESTRICT product,SubscriptValue rows,SubscriptValue n,const XT * RESTRICT x,const YT * RESTRICT y,std::size_t xColumnByteStride=0) MatrixTimesVector() argument 186 MatrixTimesVectorHelper(CppTypeFor<RCAT,RKIND> * RESTRICT product,SubscriptValue rows,SubscriptValue n,const XT * RESTRICT x,const YT * RESTRICT y,Fortran::common::optional<std::size_t> xColumnByteStride) MatrixTimesVectorHelper() argument 217 VectorTimesMatrix(CppTypeFor<RCAT,RKIND> * RESTRICT product,SubscriptValue n,SubscriptValue cols,const XT * RESTRICT x,const YT * RESTRICT y,std::size_t yColumnByteStride=0) VectorTimesMatrix() argument 243 VectorTimesMatrixHelper(CppTypeFor<RCAT,RKIND> * RESTRICT product,SubscriptValue n,SubscriptValue cols,const XT * RESTRICT x,const YT * RESTRICT y,Fortran::common::optional<std::size_t> yColumnByteStride) VectorTimesMatrixHelper() argument [all...] |
H A D | matmul-transpose.cpp | 59 CppTypeFor<RCAT, RKIND> *RESTRICT product, SubscriptValue rows, 65 std::memset(product, 0, rows * cols * sizeof *product); in MatrixTransposedTimesMatrix() 83 product[j * rows + i] += x_ki * y_kj; in MatrixTransposedTimesMatrix() 91 CppTypeFor<RCAT, RKIND> *RESTRICT product, SubscriptValue rows, in MatrixTransposedTimesMatrix() 98 product, rows, cols, x, y, n); in MatrixTransposedTimesMatrixHelper() argument 101 product, rows, cols, x, y, n, 0, *yColumnByteStride); in MatrixTransposedTimesMatrixHelper() 106 product, rows, cols, x, y, n, *xColumnByteStride); in MatrixTransposedTimesMatrixHelper() 109 product, rows, cols, x, y, n, *xColumnByteStride, *yColumnByteStride); in MatrixTransposedTimesMatrixHelper() 131 CppTypeFor<RCAT, RKIND> *RESTRICT product, SubscriptValu 64 MatrixTransposedTimesMatrix(CppTypeFor<RCAT,RKIND> * RESTRICT product,SubscriptValue rows,SubscriptValue cols,const XT * RESTRICT x,const YT * RESTRICT y,SubscriptValue n,std::size_t xColumnByteStride=0,std::size_t yColumnByteStride=0) MatrixTransposedTimesMatrix() argument 141 MatrixTransposedTimesVector(CppTypeFor<RCAT,RKIND> * RESTRICT product,SubscriptValue rows,SubscriptValue n,const XT * RESTRICT x,const YT * RESTRICT y,std::size_t xColumnByteStride=0) MatrixTransposedTimesVector() argument 165 MatrixTransposedTimesVectorHelper(CppTypeFor<RCAT,RKIND> * RESTRICT product,SubscriptValue rows,SubscriptValue n,const XT * RESTRICT x,const YT * RESTRICT y,Fortran::common::optional<std::size_t> xColumnByteStride) MatrixTransposedTimesVectorHelper() argument [all...] |
/llvm-project/llvm/include/llvm/WindowsDriver/ |
H A D | MSVCSetupApi.h | 63 /// A product is registered to the instance. 136 /// Information about an instance of a product. 173 /// Gets the path to the installation root of the product. 176 /// the product.</param> 183 /// Gets the version of the product installed in this instance. 185 /// <param name="pbstrInstallationVersion">The version of the product 193 /// Gets the display name (title) of the product installed in this instance. 196 /// <param name="pbstrDisplayName">The display name (title) of the product 204 /// Gets the description of the product installed in this instance. 207 /// <param name="pbstrDescription">The description of the product installed in [all …]
|
/llvm-project/clang/test/CodeGenCXX/ |
H A D | temp-order.cpp | 13 unsigned Product, Index; member 15 TempTracker() : Product(1), Index(0) {} in TempTracker() 30 TT.Product *= pow(P, ++TT.Index); in ~A() 53 return tt.Product; in f0() 65 return tt.Product; in f1() 77 return tt.Product; in f2() 91 return tt.Product; in f3() 103 return tt.Product; in f4() 117 return tt.Product; in f5() 129 return tt.Product; in f6() [all …]
|
/llvm-project/openmp/runtime/test/atomic/ |
H A D | omp_atomic.c | 17 int product; in test_omp_atomic() local 38 product = 1; in test_omp_atomic() 124 // product of integers test in test_omp_atomic() 131 product *= i; in test_omp_atomic() 135 if (known_product != product) { in test_omp_atomic() 137 "Error in product with integers: Result was %d instead of %d\n", in test_omp_atomic() 138 product, known_product); in test_omp_atomic() 143 product = KNOWN_PRODUCT; in test_omp_atomic() 150 product /= i; in test_omp_atomic() 153 if (product != 1) { in test_omp_atomic() [all …]
|
/llvm-project/flang/lib/Evaluate/ |
H A D | real.cpp | 155 auto product{GetFraction().MultiplyUnsigned(y.GetFraction())}; in Multiply() local 161 if (rshift >= product.upper.bits + product.lower.bits) { in Multiply() 162 sticky = !product.lower.IsZero() || !product.upper.IsZero(); in Multiply() 163 } else if (rshift >= product.lower.bits) { in Multiply() 164 sticky = !product.lower.IsZero() || in Multiply() 165 !product.upper in Multiply() 166 .IAND(product.upper.MASKR(rshift - product in Multiply() [all...] |
H A D | fold-matmul.h | 61 auto product{aElt.Multiply(bElt)}; in FoldMatmul() 62 overflow |= product.flags.test(RealFlag::Overflow); in FoldMatmul() 64 auto next{product.value.Subtract(correction, rounding)}; in FoldMatmul() 73 auto added{sum.Add(product.value)}; in FoldMatmul() 78 auto product{aElt.MultiplySigned(bElt)}; in FoldMatmul() 79 overflow |= product.SignedMultiplicationOverflowed(); in FoldMatmul() 80 auto added{sum.AddSigned(product.lower)}; in FoldMatmul()
|
/llvm-project/llvm/include/llvm/Support/ |
H A D | CheckedArithmetic.h | 61 /// \return Optional of product if no signed overflow occurred, 69 /// Multiply A and B, and add C to the resulting product. 75 if (auto Product = checkedMul(A, B)) in checkedMulAdd() local 76 return checkedAdd(*Product, C); in checkedMulAdd() 90 /// \return Optional of product if no unsigned overflow occurred, 98 /// Multiply unsigned integers A and B, and add C to the resulting product. 104 if (auto Product = checkedMulUnsigned(A, B)) in checkedMulAddUnsigned() local 105 return checkedAddUnsigned(*Product, C); in checkedMulAddUnsigned()
|
/llvm-project/flang/test/Evaluate/ |
H A D | folding20.f90 | 64 logical, parameter :: test_iproductidentity = product([integer::]) == 1 65 logical, parameter :: test_iproduct = product(intmatrix) == 720 66 logical, parameter :: test_iproduct_masked = product(intmatrix,odds) == 15 67 logical, parameter :: test_productdim1 = all(product(intmatrix,dim=1) == [2, 12, 30]) 68 logical, parameter :: test_productdim2 = all(product(intmatrix,dim=2) == [15, 48]) 69 logical, parameter :: test_rproductidentity = product([real::]) == 1. 70 logical, parameter :: test_rproduct = product(real(intmatrix)) == 720. 71 logical, parameter :: test_cproductidentity = product([complex::]) == (1.,0.) 72 logical, parameter :: test_cproduct = product(cmplx(intmatrix,-intmatrix)) == (0.,5760.)
|
/llvm-project/mlir/lib/Analysis/Presburger/ |
H A D | QuasiPolynomial.cpp | 76 std::vector<SmallVector<Fraction>> product; in operator *() local 81 product.clear(); in operator *() 82 product.insert(product.end(), term.begin(), term.end()); in operator *() 83 product.insert(product.end(), xterm.begin(), xterm.end()); in operator *() 84 aff.emplace_back(product); in operator *() 116 // if any of the affine functions in the product in simplify()
|
/llvm-project/compiler-rt/lib/scudo/standalone/ |
H A D | wrappers_c_checks.h | 46 inline bool checkForCallocOverflow(uptr Size, uptr N, uptr *Product) { in checkForCallocOverflow() argument 49 reinterpret_cast<unsigned long *>(Product)); in checkForCallocOverflow() 53 reinterpret_cast<unsigned int *>(Product)); in checkForCallocOverflow() 55 *Product = Size * N; in checkForCallocOverflow() 58 return (*Product / Size) != N; in checkForCallocOverflow()
|
/llvm-project/openmp/runtime/test/parallel/ |
H A D | omp_parallel_reduction.c | 20 int product; in test_omp_parallel_reduction() local 34 product=1; in test_omp_parallel_reduction() 99 /* Tests for product of integers */ in test_omp_parallel_reduction() 100 #pragma omp parallel for schedule(dynamic,1) private(i) reduction(*:product) in test_omp_parallel_reduction() 102 product *= i; in test_omp_parallel_reduction() 106 if(known_product != product) { in test_omp_parallel_reduction() 108 …fprintf(stderr,"Error in Product with integers: Result was %d instead of %d\n\n",product,known_pro… in test_omp_parallel_reduction()
|
/llvm-project/clang/lib/Headers/ |
H A D | avx512vlbf16intrin.h | 262 /// Dot Product of BF16 Pairs Accumulated into Packed Single Precision. 274 /// \returns A 128-bit vector of [4 x float] comes from Dot Product of 283 /// Dot Product of BF16 Pairs Accumulated into Packed Single Precision. 297 /// A 1 means __A and __B's dot product accumulated with __D. A 0 means __D. 298 /// \returns A 128-bit vector of [4 x float] comes from Dot Product of 307 /// Dot Product of BF16 Pairs Accumulated into Packed Single Precision. 321 /// A 1 means __A and __B's dot product accumulated with __D. A 0 means 0. 322 /// \returns A 128-bit vector of [4 x float] comes from Dot Product of 331 /// Dot Product of BF16 Pairs Accumulated into Packed Single Precision. 343 /// \returns A 256-bit vector of [8 x float] comes from Dot Product of [all …]
|
H A D | bmi2intrin.h | 110 /// 64-bit product. Stores the upper 32 bits of the product in the 127 /// A pointer to memory for storing the upper half of the product. in _mulx_u32() 128 /// \returns The lower half of the product. in _mulx_u32() 222 /// 128-bit product. Stores the upper 64 bits of the product to the 239 /// A pointer to memory for storing the upper half of the product. 240 /// \returns The lower half of the product.
|
H A D | avx512bf16intrin.h | 163 /// Dot Product of BF16 Pairs Accumulated into Packed Single Precision. 175 /// \returns A 512-bit vector of [16 x float] comes from Dot Product of 184 /// Dot Product of BF16 Pairs Accumulated into Packed Single Precision. 198 /// A 1 means __A and __B's dot product accumulated with __D. A 0 means __D. 199 /// \returns A 512-bit vector of [16 x float] comes from Dot Product of 208 /// Dot Product of BF16 Pairs Accumulated into Packed Single Precision. 222 /// A 1 means __A and __B's dot product accumulated with __D. A 0 means 0. 223 /// \returns A 512-bit vector of [16 x float] comes from Dot Product of
|
/llvm-project/flang/include/flang/Evaluate/ |
H A D | integer.h | 106 struct Product { 278 Product shifted{result.MultiplyUnsigned(radix)}; 828 constexpr Product MultiplyUnsigned(const Integer &y) const { in MultiplyUnsigned() 829 Part product[2 * parts]{}; // little-endian full product in MultiplyUnsigned() 843 xy += product[to]; in MultiplyUnsigned() 844 product[to] = xy & partMask; in MultiplyUnsigned() 853 lower.LEPart(j) = product[j]; in MultiplyUnsigned() 854 upper.LEPart(j) = product[j + parts]; in MultiplyUnsigned() 864 constexpr Product MultiplySigne in MultiplyUnsigned() 100 struct Product { global() struct 101 SignedMultiplicationOverflowedProduct SignedMultiplicationOverflowed() argument 104 lowerProduct global() argument [all...] |
/llvm-project/openmp/runtime/test/worksharing/sections/ |
H A D | omp_parallel_sections_reduction.c | 17 int product; in test_omp_parallel_sections_reduction() local 30 product =1; in test_omp_parallel_sections_reduction() 166 // Test product of integers in test_omp_parallel_sections_reduction() 168 #pragma omp parallel sections private(i) reduction(*:product) in test_omp_parallel_sections_reduction() 173 product *= i; in test_omp_parallel_sections_reduction() 179 product *= i; in test_omp_parallel_sections_reduction() 185 product *= i; in test_omp_parallel_sections_reduction() 189 if(known_product != product) { in test_omp_parallel_sections_reduction() 191 fprintf(stderr,"Error in Product with integers: Result was %d" in test_omp_parallel_sections_reduction() 192 " instead of %d\n",product,known_product); in test_omp_parallel_sections_reduction()
|
H A D | omp_sections_reduction.c | 16 int product; in test_omp_sections_reduction() local 31 product =1; in test_omp_sections_reduction() 177 #pragma omp sections private(i) reduction(*:product) in test_omp_sections_reduction() 182 product *= i; in test_omp_sections_reduction() 188 product *= i; in test_omp_sections_reduction() 194 product *= i; in test_omp_sections_reduction() 199 if(known_product != product) { in test_omp_sections_reduction() 201 fprintf(stderr,"Error in Product with integers: Result was %d" in test_omp_sections_reduction() 202 " instead of %d\n",product,known_product); in test_omp_sections_reduction()
|
/llvm-project/polly/lib/External/isl/ |
H A D | isl_farkas.c | 461 /* Clear an entry in the product, given that there is a "total" number 567 /* Move to the next vertex in the product. 592 /* Add a vertex to the product "bset" combining the currently selected 659 * This means that the number of rays and lines in the product 661 * while the number of vertices is the product 666 * In this case, return a universe dual for the product as well. 681 isl_basic_set *product; in construct_product() local 700 product = isl_basic_set_alloc_space(space, 0, n_line, n_ray + n_vertex); in construct_product() 701 product = isl_basic_set_set_rational(product); in construct_product() 704 product = add_lines(product, &data->factors[i], total); in construct_product() [all …]
|
/llvm-project/openmp/runtime/test/worksharing/for/ |
H A D | omp_parallel_for_reduction.c | 20 int product; in test_omp_parallel_for_reduction() local 36 product = 1; in test_omp_parallel_for_reduction() 102 #pragma omp parallel for schedule(dynamic,1) private(i) reduction(*:product) in test_omp_parallel_for_reduction() 104 product *= i; in test_omp_parallel_for_reduction() 107 if(known_product != product) { in test_omp_parallel_for_reduction() 109 fprintf(stderr,"Error in Product with integers: Result was %d" in test_omp_parallel_for_reduction() 110 " instead of %d\n\n",product,known_product); in test_omp_parallel_for_reduction()
|
/llvm-project/lldb/test/API/commands/log/basic/ |
H A D | main.cpp | 7 product (int x, int y) in product() function 35 return product (i, j); in foo() 39 return product (sum (i, i), sum (j, j)); in foo()
|
/llvm-project/lldb/test/API/functionalities/breakpoint/breakpoint_ids/ |
H A D | main.cpp | 10 product (int x, int y) in product() function 38 return product (i, j); in foo() 42 return product (sum (i, i), sum (j, j)); in foo()
|