|
| 1 | +//=== reciprocal.hpp - Unary function RECIPROCAL ------ |
| 2 | +//*-C++-*--/===// |
| 3 | +// |
| 4 | +// Data Parallel Control (dpctl) |
| 5 | +// |
| 6 | +// Copyright 2020-2023 Intel Corporation |
| 7 | +// |
| 8 | +// Licensed under the Apache License, Version 2.0 (the "License"); |
| 9 | +// you may not use this file except in compliance with the License. |
| 10 | +// You may obtain a copy of the License at |
| 11 | +// |
| 12 | +// http://www.apache.org/licenses/LICENSE-2.0 |
| 13 | +// |
| 14 | +// Unless required by applicable law or agreed to in writing, software |
| 15 | +// distributed under the License is distributed on an "AS IS" BASIS, |
| 16 | +// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 17 | +// See the License for the specific language governing permissions and |
| 18 | +// limitations under the License. |
| 19 | +// |
| 20 | +//===---------------------------------------------------------------------===// |
| 21 | +/// |
| 22 | +/// \file |
| 23 | +/// This file defines kernels for elementwise evaluation of RECIPROCAL(x) |
| 24 | +/// function. |
| 25 | +//===---------------------------------------------------------------------===// |
| 26 | + |
| 27 | +#pragma once |
| 28 | +#include <cmath> |
| 29 | +#include <complex> |
| 30 | +#include <cstddef> |
| 31 | +#include <cstdint> |
| 32 | +#include <sycl/sycl.hpp> |
| 33 | +#include <type_traits> |
| 34 | + |
| 35 | +#include "sycl_complex.hpp" |
| 36 | +#include "utils/offset_utils.hpp" |
| 37 | +#include "utils/type_dispatch.hpp" |
| 38 | +#include "utils/type_utils.hpp" |
| 39 | + |
| 40 | +#include "kernels/elementwise_functions/common.hpp" |
| 41 | +#include <pybind11/pybind11.h> |
| 42 | + |
| 43 | +namespace dpctl |
| 44 | +{ |
| 45 | +namespace tensor |
| 46 | +{ |
| 47 | +namespace kernels |
| 48 | +{ |
| 49 | +namespace reciprocal |
| 50 | +{ |
| 51 | + |
| 52 | +namespace py = pybind11; |
| 53 | +namespace td_ns = dpctl::tensor::type_dispatch; |
| 54 | + |
| 55 | +using dpctl::tensor::type_utils::is_complex; |
| 56 | + |
| 57 | +template <typename argT, typename resT> struct ReciprocalFunctor |
| 58 | +{ |
| 59 | + // is function constant for given argT |
| 60 | + using is_constant = typename std::false_type; |
| 61 | + // constant value, if constant |
| 62 | + // constexpr resT constant_value = resT{}; |
| 63 | + // is function defined for sycl::vec |
| 64 | + using supports_vec = typename std::false_type; |
| 65 | + // do both argTy and resTy support sugroup store/load operation |
| 66 | + using supports_sg_loadstore = typename std::negation< |
| 67 | + std::disjunction<is_complex<resT>, is_complex<argT>>>; |
| 68 | + |
| 69 | + resT operator()(const argT &in) const |
| 70 | + { |
| 71 | + if constexpr (is_complex<argT>::value) { |
| 72 | + |
| 73 | + using realT = typename argT::value_type; |
| 74 | +#ifdef USE_SYCL_FOR_COMPLEX_TYPES |
| 75 | + |
| 76 | + return realT(1) / exprm_ns::complex<realT>(in); |
| 77 | +#else |
| 78 | + return realT(1) / in; |
| 79 | +#endif |
| 80 | + } |
| 81 | + else { |
| 82 | + return argT(1) / in; |
| 83 | + } |
| 84 | + } |
| 85 | +}; |
| 86 | + |
| 87 | +template <typename argTy, |
| 88 | + typename resTy = argTy, |
| 89 | + unsigned int vec_sz = 4, |
| 90 | + unsigned int n_vecs = 2> |
| 91 | +using ReciprocalContigFunctor = |
| 92 | + elementwise_common::UnaryContigFunctor<argTy, |
| 93 | + resTy, |
| 94 | + ReciprocalFunctor<argTy, resTy>, |
| 95 | + vec_sz, |
| 96 | + n_vecs>; |
| 97 | + |
| 98 | +template <typename argTy, typename resTy, typename IndexerT> |
| 99 | +using ReciprocalStridedFunctor = |
| 100 | + elementwise_common::UnaryStridedFunctor<argTy, |
| 101 | + resTy, |
| 102 | + IndexerT, |
| 103 | + ReciprocalFunctor<argTy, resTy>>; |
| 104 | + |
| 105 | +template <typename T> struct ReciprocalOutputType |
| 106 | +{ |
| 107 | + using value_type = typename std::disjunction< // disjunction is C++17 |
| 108 | + // feature, supported by DPC++ |
| 109 | + td_ns::TypeMapResultEntry<T, sycl::half>, |
| 110 | + td_ns::TypeMapResultEntry<T, float>, |
| 111 | + td_ns::TypeMapResultEntry<T, double>, |
| 112 | + td_ns::TypeMapResultEntry<T, std::complex<float>>, |
| 113 | + td_ns::TypeMapResultEntry<T, std::complex<double>>, |
| 114 | + td_ns::DefaultResultEntry<void>>::result_type; |
| 115 | +}; |
| 116 | + |
| 117 | +template <typename T1, typename T2, unsigned int vec_sz, unsigned int n_vecs> |
| 118 | +class reciprocal_contig_kernel; |
| 119 | + |
| 120 | +template <typename argTy> |
| 121 | +sycl::event reciprocal_contig_impl(sycl::queue &exec_q, |
| 122 | + size_t nelems, |
| 123 | + const char *arg_p, |
| 124 | + char *res_p, |
| 125 | + const std::vector<sycl::event> &depends = {}) |
| 126 | +{ |
| 127 | + return elementwise_common::unary_contig_impl<argTy, ReciprocalOutputType, |
| 128 | + ReciprocalContigFunctor, |
| 129 | + reciprocal_contig_kernel>( |
| 130 | + exec_q, nelems, arg_p, res_p, depends); |
| 131 | +} |
| 132 | + |
| 133 | +template <typename fnT, typename T> struct ReciprocalContigFactory |
| 134 | +{ |
| 135 | + fnT get() |
| 136 | + { |
| 137 | + if constexpr (std::is_same_v< |
| 138 | + typename ReciprocalOutputType<T>::value_type, void>) |
| 139 | + { |
| 140 | + fnT fn = nullptr; |
| 141 | + return fn; |
| 142 | + } |
| 143 | + else { |
| 144 | + fnT fn = reciprocal_contig_impl<T>; |
| 145 | + return fn; |
| 146 | + } |
| 147 | + } |
| 148 | +}; |
| 149 | + |
| 150 | +template <typename fnT, typename T> struct ReciprocalTypeMapFactory |
| 151 | +{ |
| 152 | + /*! @brief get typeid for output type of 1 / x */ |
| 153 | + std::enable_if_t<std::is_same<fnT, int>::value, int> get() |
| 154 | + { |
| 155 | + using rT = typename ReciprocalOutputType<T>::value_type; |
| 156 | + return td_ns::GetTypeid<rT>{}.get(); |
| 157 | + } |
| 158 | +}; |
| 159 | + |
| 160 | +template <typename T1, typename T2, typename T3> |
| 161 | +class reciprocal_strided_kernel; |
| 162 | + |
| 163 | +template <typename argTy> |
| 164 | +sycl::event |
| 165 | +reciprocal_strided_impl(sycl::queue &exec_q, |
| 166 | + size_t nelems, |
| 167 | + int nd, |
| 168 | + const py::ssize_t *shape_and_strides, |
| 169 | + const char *arg_p, |
| 170 | + py::ssize_t arg_offset, |
| 171 | + char *res_p, |
| 172 | + py::ssize_t res_offset, |
| 173 | + const std::vector<sycl::event> &depends, |
| 174 | + const std::vector<sycl::event> &additional_depends) |
| 175 | +{ |
| 176 | + return elementwise_common::unary_strided_impl<argTy, ReciprocalOutputType, |
| 177 | + ReciprocalStridedFunctor, |
| 178 | + reciprocal_strided_kernel>( |
| 179 | + exec_q, nelems, nd, shape_and_strides, arg_p, arg_offset, res_p, |
| 180 | + res_offset, depends, additional_depends); |
| 181 | +} |
| 182 | + |
| 183 | +template <typename fnT, typename T> struct ReciprocalStridedFactory |
| 184 | +{ |
| 185 | + fnT get() |
| 186 | + { |
| 187 | + if constexpr (std::is_same_v< |
| 188 | + typename ReciprocalOutputType<T>::value_type, void>) |
| 189 | + { |
| 190 | + fnT fn = nullptr; |
| 191 | + return fn; |
| 192 | + } |
| 193 | + else { |
| 194 | + fnT fn = reciprocal_strided_impl<T>; |
| 195 | + return fn; |
| 196 | + } |
| 197 | + } |
| 198 | +}; |
| 199 | + |
| 200 | +} // namespace reciprocal |
| 201 | +} // namespace kernels |
| 202 | +} // namespace tensor |
| 203 | +} // namespace dpctl |
0 commit comments