/usr/local/lib64/python3.6/site-packages/torch/include/ATen/cpu/vec/vec256
Edit: /usr/local/lib64/python3.6/site-packages/torch/include/ATen/cpu/vec/vec256/vec256_double.h (13764B)
#pragma once
// DO NOT DEFINE STATIC DATA IN THIS HEADER!
// See Note [Do not compile initializers with AVX]
#include
#include
#if defined(CPU_CAPABILITY_AVX2) && !defined(_MSC_VER)
#include
#endif
namespace at {
namespace vec {
// See Note [Acceptable use of anonymous namespace in header]
namespace {
#if defined(CPU_CAPABILITY_AVX2) && !defined(_MSC_VER)
template <> class Vectorized {
private:
__m256d values;
public:
using value_type = double;
using size_type = int;
static constexpr size_type size() {
return 4;
}
Vectorized() {}
Vectorized(__m256d v) : values(v) {}
Vectorized(double val) {
values = _mm256_set1_pd(val);
}
Vectorized(double val1, double val2, double val3, double val4) {
values = _mm256_setr_pd(val1, val2, val3, val4);
}
operator __m256d() const {
return values;
}
template
static Vectorized blend(const Vectorized& a, const Vectorized& b) {
return _mm256_blend_pd(a.values, b.values, mask);
}
static Vectorized blendv(const Vectorized& a, const Vectorized& b,
const Vectorized& mask) {
return _mm256_blendv_pd(a.values, b.values, mask.values);
}
template
static Vectorized arange(double base = 0., step_t step = static_cast(1)) {
return Vectorized(base, base + step, base + 2 * step, base + 3 * step);
}
static Vectorized set(const Vectorized& a, const Vectorized& b,
int64_t count = size()) {
switch (count) {
case 0:
return a;
case 1:
return blend<1>(a, b);
case 2:
return blend<3>(a, b);
case 3:
return blend<7>(a, b);
}
return b;
}
static Vectorized loadu(const void* ptr, int64_t count = size()) {
if (count == size())
return _mm256_loadu_pd(reinterpret_cast(ptr));
__at_align__ double tmp_values[size()];
// Ensure uninitialized memory does not change the output value See https://github.com/pytorch/pytorch/issues/32502
// for more details. We do not initialize arrays to zero using "={0}" because gcc would compile it to two
// instructions while a loop would be compiled to one instruction.
for (auto i = 0; i < size(); ++i) {
tmp_values[i] = 0.0;
}
std::memcpy(
tmp_values,
reinterpret_cast(ptr),
count * sizeof(double));
return _mm256_load_pd(tmp_values);
}
void store(void* ptr, int count = size()) const {
if (count == size()) {
_mm256_storeu_pd(reinterpret_cast(ptr), values);
} else if (count > 0) {
double tmp_values[size()];
_mm256_storeu_pd(reinterpret_cast(tmp_values), values);
std::memcpy(ptr, tmp_values, count * sizeof(double));
}
}
const double& operator[](int idx) const = delete;
double& operator[](int idx) = delete;
int zero_mask() const {
// returns an integer mask where all zero elements are translated to 1-bit and others are translated to 0-bit
__m256d cmp = _mm256_cmp_pd(values, _mm256_set1_pd(0.0), _CMP_EQ_OQ);
return _mm256_movemask_pd(cmp);
}
Vectorized isnan() const {
return _mm256_cmp_pd(values, _mm256_set1_pd(0.0), _CMP_UNORD_Q);
}
Vectorized map(double (*const f)(double)) const {
__at_align__ double tmp[size()];
store(tmp);
for (int64_t i = 0; i < size(); i++) {
tmp[i] = f(tmp[i]);
}
return loadu(tmp);
}
Vectorized abs() const {
auto mask = _mm256_set1_pd(-0.f);
return _mm256_andnot_pd(mask, values);
}
Vectorized angle() const {
const auto zero_vec = _mm256_set1_pd(0.f);
const auto nan_vec = _mm256_set1_pd(NAN);
const auto not_nan_mask = _mm256_cmp_pd(values, values, _CMP_EQ_OQ);
const auto nan_mask = _mm256_cmp_pd(not_nan_mask, zero_vec, _CMP_EQ_OQ);
const auto pi = _mm256_set1_pd(c10::pi);
const auto neg_mask = _mm256_cmp_pd(values, zero_vec, _CMP_LT_OQ);
auto angle = _mm256_blendv_pd(zero_vec, pi, neg_mask);
angle = _mm256_blendv_pd(angle, nan_vec, nan_mask);
return angle;
}
Vectorized real() const {
return *this;
}
Vectorized imag() const {
return _mm256_set1_pd(0);
}
Vectorized conj() const {
return *this;
}
Vectorized acos() const {
return Vectorized(Sleef_acosd4_u10(values));
}
Vectorized asin() const {
return Vectorized(Sleef_asind4_u10(values));
}
Vectorized atan() const {
return Vectorized(Sleef_atand4_u10(values));
}
Vectorized atan2(const Vectorized &b) const {
return Vectorized(Sleef_atan2d4_u10(values, b));
}
Vectorized copysign(const Vectorized &sign) const {
return Vectorized(Sleef_copysignd4(values, sign));
}
Vectorized erf() const {
return Vectorized(Sleef_erfd4_u10(values));
}
Vectorized erfc() const {
return Vectorized(Sleef_erfcd4_u15(values));
}
Vectorized erfinv() const {
return map(calc_erfinv);
}
Vectorized exp() const {
return Vectorized(Sleef_expd4_u10(values));
}
Vectorized expm1() const {
return Vectorized(Sleef_expm1d4_u10(values));
}
Vectorized fmod(const Vectorized& q) const {
return Vectorized(Sleef_fmodd4(values, q));
}
Vectorized hypot(const Vectorized &b) const {
return Vectorized(Sleef_hypotd4_u05(values, b));
}
Vectorized i0() const {
return map(calc_i0);
}
Vectorized i0e() const {
return map(calc_i0e);
}
Vectorized igamma(const Vectorized &x) const {
__at_align__ double tmp[size()];
__at_align__ double tmp_x[size()];
store(tmp);
x.store(tmp_x);
for (int64_t i = 0; i < size(); i++) {
tmp[i] = calc_igamma(tmp[i], tmp_x[i]);
}
return loadu(tmp);
}
Vectorized igammac(const Vectorized &x) const {
__at_align__ double tmp[size()];
__at_align__ double tmp_x[size()];
store(tmp);
x.store(tmp_x);
for (int64_t i = 0; i < size(); i++) {
tmp[i] = calc_igammac(tmp[i], tmp_x[i]);
}
return loadu(tmp);
}
Vectorized log() const {
return Vectorized(Sleef_logd4_u10(values));
}
Vectorized log2() const {
return Vectorized(Sleef_log2d4_u10(values));
}
Vectorized log10() const {
return Vectorized(Sleef_log10d4_u10(values));
}
Vectorized log1p() const {
return Vectorized(Sleef_log1pd4_u10(values));
}
Vectorized sin() const {
return Vectorized(Sleef_sind4_u10(values));
}
Vectorized sinh() const {
return Vectorized(Sleef_sinhd4_u10(values));
}
Vectorized cos() const {
return Vectorized(Sleef_cosd4_u10(values));
}
Vectorized cosh() const {
return Vectorized(Sleef_coshd4_u10(values));
}
Vectorized ceil() const {
return _mm256_ceil_pd(values);
}
Vectorized floor() const {
return _mm256_floor_pd(values);
}
Vectorized frac() const;
Vectorized neg() const {
return _mm256_xor_pd(_mm256_set1_pd(-0.), values);
}
Vectorized nextafter(const Vectorized &b) const {
return Vectorized(Sleef_nextafterd4(values, b));
}
Vectorized round() const {
return _mm256_round_pd(values, (_MM_FROUND_TO_NEAREST_INT | _MM_FROUND_NO_EXC));
}
Vectorized tan() const {
return Vectorized(Sleef_tand4_u10(values));
}
Vectorized tanh() const {
return Vectorized(Sleef_tanhd4_u10(values));
}
Vectorized trunc() const {
return _mm256_round_pd(values, (_MM_FROUND_TO_ZERO | _MM_FROUND_NO_EXC));
}
Vectorized lgamma() const {
return Vectorized(Sleef_lgammad4_u10(values));
}
Vectorized sqrt() const {
return _mm256_sqrt_pd(values);
}
Vectorized reciprocal() const {
return _mm256_div_pd(_mm256_set1_pd(1), values);
}
Vectorized rsqrt() const {
return _mm256_div_pd(_mm256_set1_pd(1), _mm256_sqrt_pd(values));
}
Vectorized pow(const Vectorized &b) const {
return Vectorized(Sleef_powd4_u10(values, b));
}
// Comparison using the _CMP_**_OQ predicate.
// `O`: get false if an operand is NaN
// `Q`: do not raise if an operand is NaN
Vectorized operator==(const Vectorized& other) const {
return _mm256_cmp_pd(values, other.values, _CMP_EQ_OQ);
}
Vectorized operator!=(const Vectorized& other) const {
return _mm256_cmp_pd(values, other.values, _CMP_NEQ_UQ);
}
Vectorized operator<(const Vectorized& other) const {
return _mm256_cmp_pd(values, other.values, _CMP_LT_OQ);
}
Vectorized operator<=(const Vectorized& other) const {
return _mm256_cmp_pd(values, other.values, _CMP_LE_OQ);
}
Vectorized operator>(const Vectorized& other) const {
return _mm256_cmp_pd(values, other.values, _CMP_GT_OQ);
}
Vectorized operator>=(const Vectorized& other) const {
return _mm256_cmp_pd(values, other.values, _CMP_GE_OQ);
}
Vectorized eq(const Vectorized& other) const;
Vectorized ne(const Vectorized& other) const;
Vectorized lt(const Vectorized& other) const;
Vectorized le(const Vectorized& other) const;
Vectorized gt(const Vectorized& other) const;
Vectorized ge(const Vectorized& other) const;
};
template <>
Vectorized inline operator+(const Vectorized& a, const Vectorized& b) {
return _mm256_add_pd(a, b);
}
template <>
Vectorized inline operator-(const Vectorized& a, const Vectorized& b) {
return _mm256_sub_pd(a, b);
}
template <>
Vectorized inline operator*(const Vectorized& a, const Vectorized& b) {
return _mm256_mul_pd(a, b);
}
template <>
Vectorized inline operator/(const Vectorized& a, const Vectorized& b) {
return _mm256_div_pd(a, b);
}
// frac. Implement this here so we can use subtraction.
Vectorized Vectorized::frac() const {
return *this - this->trunc();
}
// Implements the IEEE 754 201X `maximum` operation, which propagates NaN if
// either input is a NaN.
template <>
Vectorized inline maximum(const Vectorized& a, const Vectorized& b) {
Vectorized max = _mm256_max_pd(a, b);
Vectorized isnan = _mm256_cmp_pd(a, b, _CMP_UNORD_Q);
// Exploit the fact that all-ones is a NaN.
return _mm256_or_pd(max, isnan);
}
// Implements the IEEE 754 201X `minimum` operation, which propagates NaN if
// either input is a NaN.
template <>
Vectorized inline minimum(const Vectorized& a, const Vectorized& b) {
Vectorized min = _mm256_min_pd(a, b);
Vectorized isnan = _mm256_cmp_pd(a, b, _CMP_UNORD_Q);
// Exploit the fact that all-ones is a NaN.
return _mm256_or_pd(min, isnan);
}
template <>
Vectorized inline clamp(const Vectorized& a, const Vectorized& min, const Vectorized& max) {
return _mm256_min_pd(max, _mm256_max_pd(min, a));
}
template <>
Vectorized inline clamp_min(const Vectorized& a, const Vectorized& min) {
return _mm256_max_pd(min, a);
}
template <>
Vectorized inline clamp_max(const Vectorized& a, const Vectorized& max) {
return _mm256_min_pd(max, a);
}
template <>
Vectorized inline operator&(const Vectorized& a, const Vectorized& b) {
return _mm256_and_pd(a, b);
}
template <>
Vectorized inline operator|(const Vectorized& a, const Vectorized& b) {
return _mm256_or_pd(a, b);
}
template <>
Vectorized inline operator^(const Vectorized& a, const Vectorized& b) {
return _mm256_xor_pd(a, b);
}
Vectorized Vectorized::eq(const Vectorized& other) const {
return (*this == other) & Vectorized(1.0);
}
Vectorized Vectorized::ne(const Vectorized& other) const {
return (*this != other) & Vectorized(1.0);
}
Vectorized Vectorized::gt(const Vectorized& other) const {
return (*this > other) & Vectorized(1.0);
}
Vectorized Vectorized::ge(const Vectorized& other) const {
return (*this >= other) & Vectorized(1.0);
}
Vectorized Vectorized::lt(const Vectorized& other) const {
return (*this < other) & Vectorized(1.0);
}
Vectorized Vectorized::le(const Vectorized& other) const {
return (*this <= other) & Vectorized(1.0);
}
template <>
inline void convert(const double* src, double* dst, int64_t n) {
int64_t i;
#pragma unroll
for (i = 0; i <= (n - Vectorized::size()); i += Vectorized::size()) {
_mm256_storeu_pd(dst + i, _mm256_loadu_pd(src + i));
}
#pragma unroll
for (; i < n; i++) {
dst[i] = src[i];
}
}
#ifdef CPU_CAPABILITY_AVX2
template <>
Vectorized inline fmadd(const Vectorized& a, const Vectorized& b, const Vectorized& c) {
return _mm256_fmadd_pd(a, b, c);
}
#endif
#endif
}}}