| 1 |
/* |
| 2 |
* (C) Copyright 2025- ECMWF. |
| 3 |
* |
| 4 |
* This software is licensed under the terms of the Apache Licence Version 2.0 |
| 5 |
* which can be obtained at http://www.apache.org/licenses/LICENSE-2.0. |
| 6 |
* In applying this licence, ECMWF does not waive the privileges and immunities |
| 7 |
* granted to it by virtue of its status as an intergovernmental organisation |
| 8 |
* nor does it submit to any jurisdiction. |
| 9 |
*/ |
| 10 |
#pragma once |
| 11 |
|
| 12 |
#include <cstdint> |
| 13 |
#include <complex> |
| 14 |
#include <string> |
| 15 |
#include <map> |
| 16 |
#include <memory> |
| 17 |
|
| 18 |
#include "atlas/mdspan.h" |
| 19 |
|
| 20 |
namespace atlas::linalg { |
| 21 |
|
| 22 |
class FFT { |
| 23 |
public: |
| 24 |
virtual ~FFT() {} |
| 25 |
virtual const std::string& type() const = 0; |
| 26 |
|
| 27 |
void plan_inverse_c2r_many(size_t howmany, size_t size_in, size_t size_out, size_t dist_in, size_t dist_out, std::complex<double>* in, double* out) const { |
| 28 |
do_plan_inverse_c2r_many(howmany, size_in, size_out, dist_in, dist_out, in, out); |
| 29 |
} |
| 30 |
void plan_inverse_c2r_many( |
| 31 |
mdspan<std::complex<double>,dims<2>,layout_stride> in, |
| 32 |
mdspan<double,dims<2>,layout_stride> out) { |
| 33 |
auto howmany = in.extent(0); |
| 34 |
auto size_in = in.extent(1); |
| 35 |
auto size_out = out.extent(1); |
| 36 |
auto dist_in = in.stride(0); |
| 37 |
auto dist_out = out.stride(0); |
| 38 |
do_plan_inverse_c2r_many(howmany, size_in, size_out, dist_in, dist_out, in.data_handle(), out.data_handle()); |
| 39 |
} |
| 40 |
void plan_inverse_c2r_many(size_t howmany, size_t size_out, std::complex<double>* in, double* out) const { |
| 41 |
auto size_in = (size_out / 2 ) + 1; |
| 42 |
auto dist_in = size_in; |
| 43 |
auto dist_out = size_out; |
| 44 |
do_plan_inverse_c2r_many(howmany, size_in, size_out, dist_in, dist_out, in, out); |
| 45 |
} |
| 46 |
|
| 47 |
void inverse_c2r_many(size_t howmany, size_t size_in, size_t size_out, size_t dist_in, size_t dist_out, std::complex<double>* in, double* out) const { |
| 48 |
do_inverse_c2r_many(howmany, size_in, size_out, dist_in, dist_out, in, out); |
| 49 |
} |
| 50 |
void inverse_c2r_many( |
| 51 |
mdspan<std::complex<double>,dims<2>,layout_stride> in, |
| 52 |
mdspan<double,dims<2>,layout_stride> out) { |
| 53 |
auto howmany = in.extent(0); |
| 54 |
auto size_in = in.extent(1); |
| 55 |
auto size_out = out.extent(1); |
| 56 |
auto dist_in = in.stride(0); |
| 57 |
auto dist_out = out.stride(0); |
| 58 |
do_inverse_c2r_many(howmany, size_in, size_out, dist_in, dist_out, in.data_handle(), out.data_handle()); |
| 59 |
} |
| 60 |
void inverse_c2r_many(size_t howmany, size_t size_out, std::complex<double>* in, double* out) const { |
| 61 |
auto size_in = (size_out / 2 ) + 1; |
| 62 |
auto dist_in = size_in; |
| 63 |
auto dist_out = size_out; |
| 64 |
inverse_c2r_many(howmany, size_in, size_out, dist_in, dist_out, in, out); |
| 65 |
} |
| 66 |
|
| 67 |
void plan_inverse_c2r(size_t size_out, std::complex<double>* in, double* out) { |
| 68 |
do_plan_inverse_c2r(size_out, in, out); |
| 69 |
} |
| 70 |
|
| 71 |
void inverse_c2r(size_t size_out, std::complex<double>* in, double* out) { |
| 72 |
do_inverse_c2r(size_out, in, out); |
| 73 |
} |
| 74 |
|
| 75 |
private: |
| 76 |
|
| 77 |
virtual void do_plan_inverse_c2r_many(size_t howmany, size_t size_in, size_t size_out, size_t dist_in, size_t dist_out, std::complex<double>* in, double* out) const = 0; |
| 78 |
virtual void do_inverse_c2r_many(size_t howmany, size_t size_in, size_t size_out, size_t dist_in, size_t dist_out, std::complex<double>* in, double* out) const = 0; |
| 79 |
virtual void do_plan_inverse_c2r(size_t size_out, std::complex<double>* in, double* out) const = 0; |
| 80 |
virtual void do_inverse_c2r(size_t size_out, std::complex<double>* in, double* out) const = 0; |
| 81 |
|
| 82 |
}; |
| 83 |
|
| 84 |
class FFTW : public FFT { |
| 85 |
public: |
| 86 |
static const std::string& static_type() { |
| 87 |
static std::string _static_type{"FFTW"}; |
| 88 |
return _static_type; |
| 89 |
} |
| 90 |
const std::string& type() const override { return static_type(); } |
| 91 |
FFTW(); |
| 92 |
virtual ~FFTW(); |
| 93 |
|
| 94 |
private: |
| 95 |
void do_plan_inverse_c2r_many(size_t howmany, size_t size_in, size_t size_out, size_t dist_in, size_t dist_out, std::complex<double>* in, double* out) const override; |
| 96 |
void do_inverse_c2r_many(size_t howmany, size_t size_in, size_t size_out, size_t dist_in, size_t dist_out, std::complex<double>* in, double* out) const override; |
| 97 |
void do_plan_inverse_c2r(size_t size_out, std::complex<double>* in, double* out) const override; |
| 98 |
void do_inverse_c2r(size_t size_out, std::complex<double>* in, double* out) const override; |
| 99 |
|
| 100 |
private: |
| 101 |
struct FFTW_Plans; |
| 102 |
mutable FFTW_Plans* plans_; |
| 103 |
}; |
| 104 |
|
| 105 |
class pocketfft : public FFT { |
| 106 |
public: |
| 107 |
static const std::string& static_type() { |
| 108 |
static std::string _static_type{"pocketfft"}; |
| 109 |
return _static_type; |
| 110 |
} |
| 111 |
const std::string& type() const override { return static_type(); } |
| 112 |
virtual ~pocketfft() {} |
| 113 |
|
| 114 |
private: |
| 115 |
void do_plan_inverse_c2r_many(size_t howmany, size_t size_in, size_t size_out, size_t dist_in, size_t dist_out, std::complex<double>* in, double* out) const override; |
| 116 |
void do_inverse_c2r_many(size_t howmany, size_t size_in, size_t size_out, size_t dist_in, size_t dist_out, std::complex<double>* in, double* out) const override; |
| 117 |
void do_plan_inverse_c2r(size_t size_out, std::complex<double>* in, double* out) const override; |
| 118 |
void do_inverse_c2r(size_t size_out, std::complex<double>* in, double* out) const override; |
| 119 |
}; |
| 120 |
|
| 121 |
} // namespace atlas::linalg |