| 1 | /*
|
|---|
| 2 | * Copyright (c) 2010-2015 Centre National de la Recherche Scientifique.
|
|---|
| 3 | * written by Nathanael Schaeffer (CNRS, ISTerre, Grenoble, France).
|
|---|
| 4 | *
|
|---|
| 5 | * nathanael.schaeffer@ujf-grenoble.fr
|
|---|
| 6 | *
|
|---|
| 7 | * This software is governed by the CeCILL license under French law and
|
|---|
| 8 | * abiding by the rules of distribution of free software. You can use,
|
|---|
| 9 | * modify and/or redistribute the software under the terms of the CeCILL
|
|---|
| 10 | * license as circulated by CEA, CNRS and INRIA at the following URL
|
|---|
| 11 | * "http://www.cecill.info".
|
|---|
| 12 | *
|
|---|
| 13 | * The fact that you are presently reading this means that you have had
|
|---|
| 14 | * knowledge of the CeCILL license and that you accept its terms.
|
|---|
| 15 | *
|
|---|
| 16 | */
|
|---|
| 17 |
|
|---|
| 18 | # This file is meta-code for SHT.c (spherical harmonic transform).
|
|---|
| 19 | # it is intended for "make" to generate C code for similar SHT functions,
|
|---|
| 20 | # from one generic function + tags.
|
|---|
| 21 | # > See Makefile and SHT.c
|
|---|
| 22 | # Basically, there are tags at the beginning of lines that are information
|
|---|
| 23 | # to keep or remove the line depending on the function to build.
|
|---|
| 24 | # tags :
|
|---|
| 25 | # Q : line for scalar transform
|
|---|
| 26 | # V : line for vector transform (both spheroidal and toroidal)
|
|---|
| 27 | # S : line for vector transfrom, spheroidal component
|
|---|
| 28 | # T : line for vector transform, toroidal component.
|
|---|
| 29 |
|
|---|
| 30 | /////////////////////////////////////////////////////
|
|---|
| 31 | #ifdef SHT_AXISYM
|
|---|
| 32 | /// Only the \b axisymmetric (m=0) component is transformed, and the resulting spatial fields have size NLAT.
|
|---|
| 33 | #endif
|
|---|
| 34 |
|
|---|
| 35 | /// Truncation and spatial discretization are defined by \ref shtns_create and \ref shtns_set_grid_*
|
|---|
| 36 | /// \param[in] shtns = a configuration created by \ref shtns_create with a grid set by shtns_set_grid_*
|
|---|
| 37 | Q/// \param[in] Qlm = spherical harmonics coefficients :
|
|---|
| 38 | Q/// complex double arrays of size shtns->nlm [unmodified].
|
|---|
| 39 | S/// \param[in] Slm = spherical harmonics coefficients of \b Spheroidal scalar :
|
|---|
| 40 | S/// complex double array of size shtns->nlm [unmodified].
|
|---|
| 41 | T/// \param[in] Tlm = spherical harmonics coefficients of \b Toroidal scalar :
|
|---|
| 42 | T/// complex double array of size shtns->nlm [unmodified].
|
|---|
| 43 | Q/// \param[out] Vr = spatial scalar field : double array.
|
|---|
| 44 | #ifndef SHT_AXISYM
|
|---|
| 45 | V/// \param[out] Vt, Vp = (theta,phi)-components of spatial vector : double arrays.
|
|---|
| 46 | #else
|
|---|
| 47 | S/// \param[out] Vt = theta-component of spatial vector : double array.
|
|---|
| 48 | T/// \param[out] Vp = phi-component of spatial vector : double array.
|
|---|
| 49 | #endif
|
|---|
| 50 | #ifdef SHT_VAR_LTR
|
|---|
| 51 | /// \param[in] llim = specify maximum degree of spherical harmonic. llim must be at most LMAX, and all spherical harmonic degree higher than llim are ignored.
|
|---|
| 52 | #else
|
|---|
| 53 | /// \param[in] llim MUST be shtns->lmax.
|
|---|
| 54 | #endif
|
|---|
| 55 |
|
|---|
| 56 | // MTR_DCT : <0 => SHT_NO_DCT must be defined !!! mem only transform
|
|---|
| 57 | // 0 => dct for m=0 only
|
|---|
| 58 | // m => dct up to m, (!!! MTR_DCT <= MTR !!!)
|
|---|
| 59 |
|
|---|
| 60 | 3 static void GEN3(SHqst_to_spat_,ID_NME,SUFFIX)(shtns_cfg shtns, cplx *Qlm, cplx *Slm, cplx *Tlm, double *Vr, double *Vt, double *Vp, long int llim) {
|
|---|
| 61 | QX static void GEN3(SH_to_spat_,ID_NME,SUFFIX)(shtns_cfg shtns, cplx *Qlm, double *Vr, long int llim) {
|
|---|
| 62 | #ifndef SHT_GRAD
|
|---|
| 63 | VX static void GEN3(SHsphtor_to_spat_,ID_NME,SUFFIX)(shtns_cfg shtns, cplx *Slm, cplx *Tlm, double *Vt, double *Vp, long int llim) {
|
|---|
| 64 | #else
|
|---|
| 65 | S static void GEN3(SHsph_to_spat_,ID_NME,SUFFIX)(shtns_cfg shtns, cplx *Slm, double *Vt, double *Vp, long int llim) {
|
|---|
| 66 | T static void GEN3(SHtor_to_spat_,ID_NME,SUFFIX)(shtns_cfg shtns, cplx *Tlm, double *Vt, double *Vp, long int llim) {
|
|---|
| 67 | #endif
|
|---|
| 68 |
|
|---|
| 69 | Q v2d *BrF;
|
|---|
| 70 | #ifndef SHT_AXISYM
|
|---|
| 71 | // with m>0, 3 components not possible with DCT acceleration
|
|---|
| 72 | 3 #define SHT_NO_DCT
|
|---|
| 73 | V v2d *BtF, *BpF;
|
|---|
| 74 | V struct DtDp *dyl;
|
|---|
| 75 | Q cplx re,ro;
|
|---|
| 76 | V cplx te,to, pe,po;
|
|---|
| 77 | V cplx dte,dto, dpe,dpo;
|
|---|
| 78 | Q #define BR0(i) ((double *)BrF)[2*(i)]
|
|---|
| 79 | V #define BT0(i) ((double *)BtF)[2*(i)]
|
|---|
| 80 | V #define BP0(i) ((double *)BpF)[2*(i)]
|
|---|
| 81 | unsigned im, imlim;
|
|---|
| 82 | int imlim_dct;
|
|---|
| 83 | #else
|
|---|
| 84 | S v2d *BtF;
|
|---|
| 85 | T v2d *BpF;
|
|---|
| 86 | Q double re,ro;
|
|---|
| 87 | S double te,to;
|
|---|
| 88 | T double pe,po;
|
|---|
| 89 | Q #define BR0(i) ((double *)BrF)[i]
|
|---|
| 90 | S #define BT0(i) ((double *)BtF)[i]
|
|---|
| 91 | T #define BP0(i) ((double *)BpF)[i]
|
|---|
| 92 | #endif
|
|---|
| 93 | long int k,m,l;
|
|---|
| 94 | #ifdef _GCC_VEC_
|
|---|
| 95 | QX s2d Ql0[(llim+5)>>1]; // we need some zero-padding (icc 14 bug: needs 1 more for SHT_AXISYM only!)
|
|---|
| 96 | 3 s2d Ql0[(llim+4)>>1]; // we need some zero-padding (icc 14 bug: needs 1 more for SHT_AXISYM only!).
|
|---|
| 97 | S s2d Sl0[(llim+3)>>1]; // we need some zero-padding (icc 14 bug: needs 1 more for SHT_AXISYM only!).
|
|---|
| 98 | T s2d Tl0[(llim+3)>>1]; // we need some zero-padding (icc 14 bug: needs 1 more for SHT_AXISYM only!).
|
|---|
| 99 | #endif
|
|---|
| 100 |
|
|---|
| 101 | #ifndef SHT_AXISYM
|
|---|
| 102 | Q BrF = (v2d *) Vr;
|
|---|
| 103 | V BtF = (v2d *) Vt; BpF = (v2d *) Vp;
|
|---|
| 104 | if (shtns->ncplx_fft > 0) { // alloc memory for the FFT
|
|---|
| 105 | QX BrF = VMALLOC( shtns->ncplx_fft * sizeof(cplx) );
|
|---|
| 106 | VX BtF = VMALLOC( 2* shtns->ncplx_fft * sizeof(cplx) );
|
|---|
| 107 | VX BpF = BtF + shtns->ncplx_fft;
|
|---|
| 108 | 3 BrF = VMALLOC( 3* shtns->ncplx_fft * sizeof(cplx) );
|
|---|
| 109 | 3 BtF = BrF + shtns->ncplx_fft; BpF = BtF + shtns->ncplx_fft;
|
|---|
| 110 | }
|
|---|
| 111 | imlim = MTR;
|
|---|
| 112 | #ifdef SHT_VAR_LTR
|
|---|
| 113 | if (imlim*MRES > (unsigned) llim) imlim = ((unsigned) llim)/MRES; // 32bit mul and div should be faster
|
|---|
| 114 | #endif
|
|---|
| 115 | #ifndef SHT_NO_DCT
|
|---|
| 116 | imlim_dct = MTR_DCT;
|
|---|
| 117 | #ifdef SHT_VAR_LTR
|
|---|
| 118 | if (imlim_dct > imlim) imlim_dct = imlim;
|
|---|
| 119 | #endif
|
|---|
| 120 | #endif
|
|---|
| 121 | #else
|
|---|
| 122 | #ifdef SHT_GRAD
|
|---|
| 123 | S if (Vp != NULL) { k=0; do { ((s2d*)Vp)[k]=vdup(0.0); } while(++k<NLAT/2); Vp[NLAT-1]=0.0; }
|
|---|
| 124 | T if (Vt != NULL) { k=0; do { ((s2d*)Vt)[k]=vdup(0.0); } while(++k<NLAT/2); Vt[NLAT-1]=0.0; }
|
|---|
| 125 | #endif
|
|---|
| 126 | Q BrF = (v2d*) Vr;
|
|---|
| 127 | S BtF = (v2d*) Vt;
|
|---|
| 128 | T BpF = (v2d*) Vp;
|
|---|
| 129 | #endif
|
|---|
| 130 |
|
|---|
| 131 | // im=0;
|
|---|
| 132 | #ifdef _GCC_VEC_
|
|---|
| 133 | { // store the m=0 coefficients in an efficient & vectorizable way.
|
|---|
| 134 | Q double* Ql = (double*) &Ql0;
|
|---|
| 135 | S double* Sl = (double*) &Sl0;
|
|---|
| 136 | T double* Tl = (double*) &Tl0;
|
|---|
| 137 | Q Ql[0] = (double) Qlm[0]; // l=0
|
|---|
| 138 | l=1;
|
|---|
| 139 | do { // for m=0, compress the complex Q,S,T to double
|
|---|
| 140 | S Sl[l-1] = (double) Slm[l];
|
|---|
| 141 | T Tl[l-1] = (double) Tlm[l];
|
|---|
| 142 | Q Ql[l] = (double) Qlm[l];
|
|---|
| 143 | } while(++l<=llim); // l=llim+1
|
|---|
| 144 | S Sl[l-1] = 0.0;
|
|---|
| 145 | T Tl[l-1] = 0.0;
|
|---|
| 146 | 3 Sl[l] = 0.0; Tl[l] = 0.0; Ql[l] = 0.0; Ql[l+1] = 0.0;
|
|---|
| 147 | QX Ql[l] = 0.0; Ql[l+1] = 0.0; Ql[l+2] = 0.0;
|
|---|
| 148 | }
|
|---|
| 149 | #endif
|
|---|
| 150 | #ifndef SHT_NO_DCT
|
|---|
| 151 | { // m=0 dct
|
|---|
| 152 | Q s2d* yl = (s2d*) shtns->ykm_dct[0];
|
|---|
| 153 | V s2d* dyl0 = (s2d*) shtns->dykm_dct[0]; // only theta derivative (d/dphi = 0 for m=0)
|
|---|
| 154 | #ifndef _GCC_VEC_
|
|---|
| 155 | Q double* Ql = (double*) Qlm;
|
|---|
| 156 | S double* Sl = (double*) Slm;
|
|---|
| 157 | T double* Tl = (double*) Tlm;
|
|---|
| 158 | Q re = 0.0; ro = 0.0;
|
|---|
| 159 | QE re = yl[0] * Ql[0];
|
|---|
| 160 | QO ro = yl[1] * Ql[2];
|
|---|
| 161 | Q yl+=2;
|
|---|
| 162 | k=0; l = 2;
|
|---|
| 163 | do {
|
|---|
| 164 | S te = 0.0; to = 0.0;
|
|---|
| 165 | T pe = 0.0; po = 0.0;
|
|---|
| 166 | SO te = dyl0[0] * Sl[2*l-2]; // l-1
|
|---|
| 167 | TE pe = -dyl0[0] * Tl[2*l-2]; // l-1
|
|---|
| 168 | V ++dyl0;
|
|---|
| 169 | while(l<llim) {
|
|---|
| 170 | QE re += yl[0] * Ql[2*l];
|
|---|
| 171 | QO ro += yl[1] * Ql[2*l+2];
|
|---|
| 172 | SE to += dyl0[0] * Sl[2*l];
|
|---|
| 173 | TO po -= dyl0[0] * Tl[2*l];
|
|---|
| 174 | SO te += dyl0[1] * Sl[2*l+2];
|
|---|
| 175 | TE pe -= dyl0[1] * Tl[2*l+2];
|
|---|
| 176 | l+=2;
|
|---|
| 177 | Q yl+=2;
|
|---|
| 178 | V dyl0+=2;
|
|---|
| 179 | }
|
|---|
| 180 | if (l==llim) {
|
|---|
| 181 | QE re += yl[0] * Ql[2*l];
|
|---|
| 182 | SE to += dyl0[0] * Sl[2*l];
|
|---|
| 183 | TO po -= dyl0[0] * Tl[2*l];
|
|---|
| 184 | Q yl+=2;
|
|---|
| 185 | }
|
|---|
| 186 | V ++dyl0;
|
|---|
| 187 | Q BR0(k) = re; BR0(k+1) = ro;
|
|---|
| 188 | VX #ifndef SHT_AXISYM
|
|---|
| 189 | VX BT0(k) = 0.0; BT0(k+1) = 0.0; // required for tor or sph only transform
|
|---|
| 190 | VX BP0(k) = 0.0; BP0(k+1) = 0.0;
|
|---|
| 191 | VX #endif
|
|---|
| 192 | S BT0(k) = te; BT0(k+1) = to;
|
|---|
| 193 | T BP0(k) = pe; BP0(k+1) = po;
|
|---|
| 194 | Q re = 0.0; ro = 0.0;
|
|---|
| 195 | #ifdef SHT_VAR_LTR
|
|---|
| 196 | Q yl += ((LMAX>>1) - (llim>>1))*2;
|
|---|
| 197 | V dyl0 += (((LMAX+1)>>1) - ((llim+1)>>1))*2;
|
|---|
| 198 | #endif
|
|---|
| 199 | k+=2;
|
|---|
| 200 | l = k;
|
|---|
| 201 | } while (k<=llim+1);
|
|---|
| 202 | #else
|
|---|
| 203 | Q s2d r = yl[0] * Ql0[0]; // first Q [l=0 and 1]
|
|---|
| 204 | l=0; k=0;
|
|---|
| 205 | do {
|
|---|
| 206 | l >>= 1; // l = l/2;
|
|---|
| 207 | S s2d t = vdup(0.0);
|
|---|
| 208 | T s2d p = vdup(0.0);
|
|---|
| 209 | QX s2d r1 = vdup(0.0);
|
|---|
| 210 | do {
|
|---|
| 211 | Q r += yl[l+1] * Ql0[l+1]; // { re, ro }
|
|---|
| 212 | S t += dyl0[l] * Sl0[l]; // { te, to }
|
|---|
| 213 | T p -= dyl0[l] * Tl0[l]; // { pe, po }
|
|---|
| 214 | V ++l;
|
|---|
| 215 | QX r1 += yl[l+2] * Ql0[l+2]; // { re, ro }
|
|---|
| 216 | QX l+=2;
|
|---|
| 217 | QX } while(2*l < llim-1); // 2*(l+1) <= llim
|
|---|
| 218 | V } while(2*l < llim);
|
|---|
| 219 | QX r += r1;
|
|---|
| 220 | Q yl += (LMAX -k)>>1;
|
|---|
| 221 | V dyl0 += (LMAX+1 -k)>>1;
|
|---|
| 222 | #ifndef SHT_AXISYM
|
|---|
| 223 | Q BR0(k) = vlo_to_dbl(r); BR0(k+1) = vhi_to_dbl(r);
|
|---|
| 224 | VX BT0(k) = 0.0; BT0(k+1) = 0.0;
|
|---|
| 225 | S BT0(k) = vlo_to_dbl(t); BT0(k+1) = vhi_to_dbl(t);
|
|---|
| 226 | VX BP0(k) = 0.0; BP0(k+1) = 0.0;
|
|---|
| 227 | T BP0(k) = vlo_to_dbl(p); BP0(k+1) = vhi_to_dbl(p);
|
|---|
| 228 | #else
|
|---|
| 229 | Q *((s2d*)(((double*)BrF)+k)) = r;
|
|---|
| 230 | S *((s2d*)(((double*)BtF)+k)) = t;
|
|---|
| 231 | T *((s2d*)(((double*)BpF)+k)) = p;
|
|---|
| 232 | #endif
|
|---|
| 233 | l = k+1;
|
|---|
| 234 | k+=2;
|
|---|
| 235 | Q r = vdup(0.0);
|
|---|
| 236 | QX } while (l<llim); // (k<=llim);
|
|---|
| 237 | V } while (l<=llim); // (k<=llim+1);
|
|---|
| 238 | #endif
|
|---|
| 239 | while (k<NLAT) { // dct padding (NLAT is even)
|
|---|
| 240 | Q BR0(k) = 0.0; BR0(k+1) = 0.0;
|
|---|
| 241 | #ifndef SHT_AXISYM
|
|---|
| 242 | V BT0(k) = 0.0; BT0(k+1) = 0.0; // required for tor or sph only transform
|
|---|
| 243 | V BP0(k) = 0.0; BP0(k+1) = 0.0;
|
|---|
| 244 | #else
|
|---|
| 245 | S BT0(k) = 0.0; BT0(k+1) = 0.0;
|
|---|
| 246 | T BP0(k) = 0.0; BP0(k+1) = 0.0;
|
|---|
| 247 | #endif
|
|---|
| 248 | k+=2;
|
|---|
| 249 | }
|
|---|
| 250 | #ifdef SHT_AXISYM
|
|---|
| 251 | Q fftw_execute_r2r(shtns->idct,Vr, Vr); // iDCT m=0
|
|---|
| 252 | S fftw_execute_r2r(shtns->idct,Vt, Vt); // iDCT m=0
|
|---|
| 253 | T fftw_execute_r2r(shtns->idct,Vp, Vp); // iDCT m=0
|
|---|
| 254 | V double* st_1 = shtns->st_1;
|
|---|
| 255 | V k=0; do {
|
|---|
| 256 | V #ifdef _GCC_VEC_
|
|---|
| 257 | V v2d sin_1 = ((v2d *)st_1)[k];
|
|---|
| 258 | S ((v2d *)Vt)[k] *= sin_1;
|
|---|
| 259 | T ((v2d *)Vp)[k] *= sin_1;
|
|---|
| 260 | V #else
|
|---|
| 261 | V double sin_1 = st_1[2*k]; double sin_2 = st_1[2*k+1];
|
|---|
| 262 | S Vt[2*k] *= sin_1; Vt[2*k+1] *= sin_2;
|
|---|
| 263 | T Vp[2*k] *= sin_1; Vp[2*k+1] *= sin_2;
|
|---|
| 264 | V #endif
|
|---|
| 265 | V } while (++k<NLAT_2);
|
|---|
| 266 | #endif
|
|---|
| 267 | }
|
|---|
| 268 | #else // ifndef SHT_NO_DCT
|
|---|
| 269 | { // m=0 no dct
|
|---|
| 270 | #ifndef _GCC_VEC_
|
|---|
| 271 | Q double* Ql = (double*) Qlm;
|
|---|
| 272 | S double* Sl = (double*) Slm;
|
|---|
| 273 | T double* Tl = (double*) Tlm;
|
|---|
| 274 | #endif
|
|---|
| 275 | k=0;
|
|---|
| 276 | Q s2d* yl = (s2d*) shtns->ylm[0];
|
|---|
| 277 | V s2d* dyl0 = (s2d*) shtns->dylm[0]; // only theta derivative (d/dphi = 0 for m=0)
|
|---|
| 278 | do { // ops : NLAT_2 * [ (lmax-m+1) + 4] : almost twice as fast.
|
|---|
| 279 | #ifndef _GCC_VEC_
|
|---|
| 280 | l=1;
|
|---|
| 281 | Q re = yl[0] * Ql[0]; // re += ylm[im][k*(LMAX-m+1) + (l-m)] * Qlm[LiM(l,im)];
|
|---|
| 282 | Q ++yl;
|
|---|
| 283 | Q ro = 0.0;
|
|---|
| 284 | S te = 0.0; to = 0.0;
|
|---|
| 285 | T pe = 0.0; po = 0.0;
|
|---|
| 286 | while (l<llim) { // compute even and odd parts
|
|---|
| 287 | Q ro += yl[0] * Ql[2*l]; // re += ylm[im][k*(LMAX-m+1) + (l-m)] * Qlm[LiM(l,im)];
|
|---|
| 288 | QB re += yl[1] * Ql[2*l+2]; // ro += ylm[im][k*(LMAX-m+1) + (l+1-m)] * Qlm[LiM(l+1,im)];
|
|---|
| 289 | T pe -= dyl0[0] * Tl[2*l]; // m=0 : everything is real.
|
|---|
| 290 | SB te += dyl0[0] * Sl[2*l];
|
|---|
| 291 | TB po -= dyl0[1] * Tl[2*l+2];
|
|---|
| 292 | S to += dyl0[1] * Sl[2*l+2];
|
|---|
| 293 | l+=2;
|
|---|
| 294 | Q yl+=2;
|
|---|
| 295 | V dyl0+=2;
|
|---|
| 296 | }
|
|---|
| 297 | if (l==llim) {
|
|---|
| 298 | Q ro += yl[0] * Ql[2*l];
|
|---|
| 299 | TB pe -= dyl0[0] * Tl[2*l];
|
|---|
| 300 | S te += dyl0[0] * Sl[2*l];
|
|---|
| 301 | V dyl0+=2;
|
|---|
| 302 | }
|
|---|
| 303 | Q ++yl;
|
|---|
| 304 | #ifdef SHT_VAR_LTR
|
|---|
| 305 | Q yl += ((LMAX>>1) - (llim>>1))*2;
|
|---|
| 306 | V dyl0 += (((LMAX+1)>>1) - ((llim+1)>>1))*2;
|
|---|
| 307 | #endif
|
|---|
| 308 | Q BR0(k) = re + ro;
|
|---|
| 309 | V #ifndef SHT_AXISYM
|
|---|
| 310 | V BT0(k) = 0.0; BP0(k) = 0.0; // required for partial tor or sph transform
|
|---|
| 311 | V #endif
|
|---|
| 312 | S BT0(k) = te + to; // Bt = dS/dt
|
|---|
| 313 | T BP0(k) = pe + po; // Bp = - dT/dt
|
|---|
| 314 | QB BR0(NLAT-1-k) = re - ro;
|
|---|
| 315 | VB #ifndef SHT_AXISYM
|
|---|
| 316 | VB BT0(NLAT-1-k) = 0.0; BP0(NLAT-1-k) = 0.0; // required for partial tor or sph transform
|
|---|
| 317 | VB #endif
|
|---|
| 318 | SB BT0(NLAT-1-k) = te - to;
|
|---|
| 319 | TB BP0(NLAT-1-k) = pe - po;
|
|---|
| 320 | #else
|
|---|
| 321 | l=0;
|
|---|
| 322 | S s2d t = vdup(0.0);
|
|---|
| 323 | T s2d p = vdup(0.0);
|
|---|
| 324 | Q s2d r = vdup(0.0);
|
|---|
| 325 | QX s2d r1 = vdup(0.0);
|
|---|
| 326 | do {
|
|---|
| 327 | S t += dyl0[l] * Sl0[l]; // { te, to }
|
|---|
| 328 | T p -= dyl0[l] * Tl0[l]; // { pe, po }
|
|---|
| 329 | Q r += yl[l] * Ql0[l]; // { re, ro }
|
|---|
| 330 | ++l;
|
|---|
| 331 | QX r1 += yl[l] * Ql0[l]; // reduce dependency
|
|---|
| 332 | QX ++l;
|
|---|
| 333 | Q } while (2*l <= llim);
|
|---|
| 334 | VX } while (2*l < llim);
|
|---|
| 335 | QX r += r1;
|
|---|
| 336 | Q yl += (LMAX+2)>>1;
|
|---|
| 337 | V dyl0 += (LMAX+1)>>1;
|
|---|
| 338 | #if __SSE3__
|
|---|
| 339 | /* alternate code, which may be faster (slightly) on SSE3. */
|
|---|
| 340 | Q r = addi(r,r); // { re-ro , re+ro }
|
|---|
| 341 | S t = addi(t,t); // { te-to , te+to }
|
|---|
| 342 | T p = addi(p,p); // { pe-po , pe+po }
|
|---|
| 343 | Q BR0(k) = vhi_to_dbl(r);
|
|---|
| 344 | V #ifndef SHT_AXISYM
|
|---|
| 345 | V BT0(k) = 0.0; BP0(k) = 0.0; // required for partial tor or sph transform
|
|---|
| 346 | V #endif
|
|---|
| 347 | S BT0(k) = vhi_to_dbl(t); // Bt = dS/dt
|
|---|
| 348 | T BP0(k) = vhi_to_dbl(p); // Bp = - dT/dt
|
|---|
| 349 | QB BR0(NLAT-1-k) = vlo_to_dbl(r);
|
|---|
| 350 | VB #ifndef SHT_AXISYM
|
|---|
| 351 | VB BT0(NLAT-1-k) = 0.0; BP0(NLAT-1-k) = 0.0; // required for partial tor or sph transform
|
|---|
| 352 | VB #endif
|
|---|
| 353 | SB BT0(NLAT-1-k) = vlo_to_dbl(t);
|
|---|
| 354 | TB BP0(NLAT-1-k) = vlo_to_dbl(p);
|
|---|
| 355 | #else
|
|---|
| 356 | Q BR0(k) = vhi_to_dbl(r) + vlo_to_dbl(r);
|
|---|
| 357 | V #ifndef SHT_AXISYM
|
|---|
| 358 | V BT0(k) = 0.0; BP0(k) = 0.0; // required for partial tor or sph transform
|
|---|
| 359 | V #endif
|
|---|
| 360 | S BT0(k) = vhi_to_dbl(t) + vlo_to_dbl(t); // Bt = dS/dt
|
|---|
| 361 | T BP0(k) = vhi_to_dbl(p) + vlo_to_dbl(p); // Bp = - dT/dt
|
|---|
| 362 | QB BR0(NLAT-1-k) = vlo_to_dbl(r) - vhi_to_dbl(r);
|
|---|
| 363 | VB #ifndef SHT_AXISYM
|
|---|
| 364 | VB BT0(NLAT-1-k) = 0.0; BP0(NLAT-1-k) = 0.0; // required for partial tor or sph transform
|
|---|
| 365 | VB #endif
|
|---|
| 366 | SB BT0(NLAT-1-k) = vlo_to_dbl(t) - vhi_to_dbl(t);
|
|---|
| 367 | TB BP0(NLAT-1-k) = vlo_to_dbl(p) - vhi_to_dbl(p);
|
|---|
| 368 | #endif
|
|---|
| 369 | #endif
|
|---|
| 370 | } while (++k < NLAT_2);
|
|---|
| 371 | }
|
|---|
| 372 | #endif // ifndef SHT_NO_DCT
|
|---|
| 373 |
|
|---|
| 374 | #ifndef SHT_AXISYM
|
|---|
| 375 | im=1;
|
|---|
| 376 | Q BrF += NLAT;
|
|---|
| 377 | V BtF += NLAT; BpF += NLAT;
|
|---|
| 378 | #ifndef SHT_NO_DCT
|
|---|
| 379 | while(im<=imlim_dct) { // dct for im <= MTR_DCT
|
|---|
| 380 | m=im*MRES;
|
|---|
| 381 | l = LiM(shtns, 0,im);
|
|---|
| 382 | Q v2d* Ql = (v2d*) &Qlm[l]; // virtual pointer for l=0 and im
|
|---|
| 383 | S v2d* Sl = (v2d*) &Slm[l];
|
|---|
| 384 | T v2d* Tl = (v2d*) &Tlm[l];
|
|---|
| 385 | Q double* yl = shtns->ykm_dct[im];
|
|---|
| 386 | V dyl = shtns->dykm_dct[im];
|
|---|
| 387 | k=0; l=m;
|
|---|
| 388 | do {
|
|---|
| 389 | Q v2d re = vdup(0.0); v2d ro = vdup(0.0);
|
|---|
| 390 | V v2d te = vdup(0.0); v2d to = vdup(0.0); v2d pe = vdup(0.0); v2d po = vdup(0.0);
|
|---|
| 391 | V v2d dte = vdup(0.0); v2d dto = vdup(0.0); v2d dpe = vdup(0.0); v2d dpo = vdup(0.0);
|
|---|
| 392 | while(l<llim) {
|
|---|
| 393 | QE re += vdup(yl[0]) * Ql[l];
|
|---|
| 394 | QO ro += vdup(yl[1]) * Ql[l+1];
|
|---|
| 395 | TO dte += vdup(dyl[0].p) * Tl[l];
|
|---|
| 396 | TO po -= vdup(dyl[0].t) * Tl[l];
|
|---|
| 397 | SE dpe += vdup(dyl[0].p) * Sl[l];
|
|---|
| 398 | SE to += vdup(dyl[0].t) * Sl[l];
|
|---|
| 399 | SO dpo += vdup(dyl[1].p) * Sl[l+1];
|
|---|
| 400 | SO te += vdup(dyl[1].t) * Sl[l+1];
|
|---|
| 401 | TE dto += vdup(dyl[1].p) * Tl[l+1];
|
|---|
| 402 | TE pe -= vdup(dyl[1].t) * Tl[l+1];
|
|---|
| 403 | l+=2;
|
|---|
| 404 | Q yl+=2;
|
|---|
| 405 | V dyl+=2;
|
|---|
| 406 | }
|
|---|
| 407 | if (l==llim) {
|
|---|
| 408 | QE re += vdup(yl[0]) * Ql[l];
|
|---|
| 409 | TO dte += vdup(dyl[0].p) * Tl[l];
|
|---|
| 410 | TO po -= vdup(dyl[0].t) * Tl[l];
|
|---|
| 411 | SE dpe += vdup(dyl[0].p) * Sl[l];
|
|---|
| 412 | SE to += vdup(dyl[0].t) * Sl[l];
|
|---|
| 413 | Q ++yl;
|
|---|
| 414 | V ++dyl;
|
|---|
| 415 | }
|
|---|
| 416 | Q BrF[k] = re; BrF[k+1] = ro;
|
|---|
| 417 | V BtF[k] = addi(te, dte); BtF[k+1] = addi(to, dto);
|
|---|
| 418 | V BpF[k] = addi(pe, dpe); BpF[k+1] = addi(po, dpo);
|
|---|
| 419 | V l = (k < m) ? m : k+(m&1);
|
|---|
| 420 | k+=2;
|
|---|
| 421 | #ifdef SHT_VAR_LTR
|
|---|
| 422 | Q yl+= (LMAX-llim);
|
|---|
| 423 | V dyl+= (LMAX-llim);
|
|---|
| 424 | #endif
|
|---|
| 425 | Q l = (k < m) ? m : k-(m&1);
|
|---|
| 426 | V } while (k<=llim+1-(m&1));
|
|---|
| 427 | Q } while (k<=llim);
|
|---|
| 428 | QE if (l==llim) {
|
|---|
| 429 | QE BrF[k] = vdup(yl[0]) * Ql[l];
|
|---|
| 430 | QE BrF[k+1] = vdup(0.0);
|
|---|
| 431 | QE k+=2;
|
|---|
| 432 | QE }
|
|---|
| 433 | while (k<NLAT) { // NLAT even
|
|---|
| 434 | Q BrF[k] = vdup(0.0); BrF[k+1] = vdup(0.0);
|
|---|
| 435 | V BtF[k] = vdup(0.0); BpF[k] = vdup(0.0);
|
|---|
| 436 | V BtF[k+1] = vdup(0.0); BpF[k+1] = vdup(0.0);
|
|---|
| 437 | k+=2;
|
|---|
| 438 | }
|
|---|
| 439 | ++im;
|
|---|
| 440 | Q BrF += NLAT;
|
|---|
| 441 | V BtF += NLAT; BpF += NLAT;
|
|---|
| 442 | }
|
|---|
| 443 | #endif
|
|---|
| 444 |
|
|---|
| 445 | while(im<=imlim) { // regular for MTR_DCT < im <= MTR
|
|---|
| 446 | m = im*MRES;
|
|---|
| 447 | 3 double m_1 = 1.0/m;
|
|---|
| 448 | l = LiM(shtns, 0,im);
|
|---|
| 449 | Q v2d* Ql = (v2d*) &Qlm[l]; // virtual pointer for l=0 and im
|
|---|
| 450 | S v2d* Sl = (v2d*) &Slm[l]; // virtual pointer for l=0 and im
|
|---|
| 451 | T v2d* Tl = (v2d*) &Tlm[l];
|
|---|
| 452 | k=0; l=shtns->tm[im];
|
|---|
| 453 | while (k<l) { // polar optimization
|
|---|
| 454 | Q BrF[k] = vdup(0.0);
|
|---|
| 455 | QB BrF[NLAT-l + k] = vdup(0.0); // south pole zeroes <=> BrF[im*NLAT + NLAT-(k+1)] = 0.0;
|
|---|
| 456 | V BtF[k] = vdup(0.0); BpF[k] = vdup(0.0);
|
|---|
| 457 | VB BtF[NLAT-l + k] = vdup(0.0); BpF[NLAT-l + k] = vdup(0.0); // south pole zeroes
|
|---|
| 458 | ++k;
|
|---|
| 459 | }
|
|---|
| 460 | Q double* yl = shtns->ylm[im];
|
|---|
| 461 | V dyl = shtns->dylm[im];
|
|---|
| 462 | do { // ops : NLAT_2 * [ (lmax-m+1)*2 + 4] : almost twice as fast.
|
|---|
| 463 | l=m;
|
|---|
| 464 | Q v2d re = vdup(0.0); v2d ro = vdup(0.0);
|
|---|
| 465 | V v2d dte = vdup(0.0); v2d dto = vdup(0.0); v2d pe = vdup(0.0); v2d po = vdup(0.0);
|
|---|
| 466 | V v2d dpe = vdup(0.0); v2d dpo = vdup(0.0); v2d te = vdup(0.0); v2d to = vdup(0.0);
|
|---|
| 467 | while (l<llim) { // compute even and odd parts
|
|---|
| 468 | QX re += vdup(yl[0]) * Ql[l]; // re += ylm[im][k*(LMAX-m+1) + (l-m)] * Qlm[LiM(l,im)];
|
|---|
| 469 | QX ro += vdup(yl[1]) * Ql[l+1]; // ro += ylm[im][k*(LMAX-m+1) + (l+1-m)] * Qlm[LiM(l+1,im)];
|
|---|
| 470 | TB dpo -= vdup(dyl[0].t) * Tl[l];
|
|---|
| 471 | S dto += vdup(dyl[0].t) * Sl[l];
|
|---|
| 472 | TB te += vdup(dyl[0].p) * Tl[l];
|
|---|
| 473 | S pe += vdup(dyl[0].p) * Sl[l];
|
|---|
| 474 | 3 re += vdup(dyl[0].p) * Ql[l];
|
|---|
| 475 | T dpe -= vdup(dyl[1].t) * Tl[l+1];
|
|---|
| 476 | SB dte += vdup(dyl[1].t) * Sl[l+1];
|
|---|
| 477 | T to += vdup(dyl[1].p) * Tl[l+1];
|
|---|
| 478 | SB po += vdup(dyl[1].p) * Sl[l+1];
|
|---|
| 479 | 3 ro += vdup(dyl[1].p) * Ql[l+1];
|
|---|
| 480 | l+=2;
|
|---|
| 481 | Q yl+=2;
|
|---|
| 482 | V dyl+=2;
|
|---|
| 483 | }
|
|---|
| 484 | if (l==llim) {
|
|---|
| 485 | QX re += vdup(yl[0]) * Ql[l]; // re += ylm[im][k*(LMAX-m+1) + (l-m)] * Qlm[LiM(l,im)];
|
|---|
| 486 | TO dpo -= vdup(dyl[0].t) * Tl[l];
|
|---|
| 487 | SE dto += vdup(dyl[0].t) * Sl[l];
|
|---|
| 488 | TO te += vdup(dyl[0].p) * Tl[l];
|
|---|
| 489 | SE pe += vdup(dyl[0].p) * Sl[l];
|
|---|
| 490 | 3 re += vdup(dyl[0].p) * Ql[l];
|
|---|
| 491 | Q ++yl;
|
|---|
| 492 | V ++dyl;
|
|---|
| 493 | }
|
|---|
| 494 | 3 s2d qv = vdup(shtns->st[k]*m_1);
|
|---|
| 495 | V BtF[k] = addi(dte+dto, te+to); // Bt = dS/dt + I.m/sint *T
|
|---|
| 496 | VB BtF[NLAT-1-k] = addi(dte-dto, te-to);
|
|---|
| 497 | 3 re *= qv; ro *= qv;
|
|---|
| 498 | V BpF[k] = addi(dpe+dpo, pe+po); // Bp = I.m/sint * S - dT/dt
|
|---|
| 499 | VB BpF[NLAT-1-k] = addi(dpe-dpo, pe-po);
|
|---|
| 500 | Q BrF[k] = re + ro;
|
|---|
| 501 | QB BrF[NLAT-1-k] = re - ro;
|
|---|
| 502 | #ifdef SHT_VAR_LTR
|
|---|
| 503 | Q yl += (LMAX-llim);
|
|---|
| 504 | V dyl += (LMAX-llim);
|
|---|
| 505 | #endif
|
|---|
| 506 | } while (++k < NLAT_2);
|
|---|
| 507 | ++im;
|
|---|
| 508 | Q BrF += NLAT;
|
|---|
| 509 | V BtF += NLAT; BpF += NLAT;
|
|---|
| 510 | }
|
|---|
| 511 | for (k=0; k < NLAT*((NPHI>>1) -imlim); ++k) { // padding for high m's
|
|---|
| 512 | Q BrF[k] = vdup(0.0);
|
|---|
| 513 | V BtF[k] = vdup(0.0); BpF[k] = vdup(0.0);
|
|---|
| 514 | }
|
|---|
| 515 | Q BrF -= NLAT*(imlim+1); // restore original pointer
|
|---|
| 516 | V BtF -= NLAT*(imlim+1); BpF -= NLAT*(imlim+1); // restore original pointer
|
|---|
| 517 |
|
|---|
| 518 | // NPHI > 1 as SHT_AXISYM is not defined.
|
|---|
| 519 | #ifndef SHT_NO_DCT
|
|---|
| 520 | Q fftw_execute_r2r(shtns->idct,(double *) BrF, (double *) BrF); // iDCT
|
|---|
| 521 | V fftw_execute_r2r(shtns->idct,(double *) BtF, (double *) BtF); // iDCT
|
|---|
| 522 | V fftw_execute_r2r(shtns->idct,(double *) BpF, (double *) BpF); // iDCT
|
|---|
| 523 | V double* st_1 = shtns->st_1;
|
|---|
| 524 | V k=0; do { // m=0
|
|---|
| 525 | V double sin_1 = st_1[k]; double sin_2 = st_1[k+1];
|
|---|
| 526 | V ((double *)BtF)[2*k] *= sin_1; ((double *)BpF)[2*k] *= sin_1;
|
|---|
| 527 | V ((double *)BtF)[2*k+2] *= sin_2; ((double *)BpF)[2*k+2] *= sin_2;
|
|---|
| 528 | V k+=2;
|
|---|
| 529 | V } while(k<NLAT);
|
|---|
| 530 | Q if (MRES & 1) { // odd m's must be divided by sin(theta)
|
|---|
| 531 | Q double* st_1 = shtns->st_1;
|
|---|
| 532 | Q for (im=1; im<=MTR_DCT; im+=2) { // odd m's
|
|---|
| 533 | Q k=0; do {
|
|---|
| 534 | Q ((v2d *)BrF)[im*NLAT + k] *= vdup(st_1[k]); ((v2d *)BrF)[im*NLAT + k+1] *= vdup(st_1[k+1]);
|
|---|
| 535 | Q k+=2;
|
|---|
| 536 | Q } while(k<NLAT);
|
|---|
| 537 | Q }
|
|---|
| 538 | Q }
|
|---|
| 539 | V l = (MRES & 1) + 1; // im-stride (l=1 if MRES even, l=2 if MRES odd)
|
|---|
| 540 | V for (im=l; im<=MTR_DCT; im+=l) { //even m's must be divided by sin(theta)
|
|---|
| 541 | V k=0; do {
|
|---|
| 542 | V s2d sin_1 = vdup(st_1[k]); s2d sin_2 = vdup(st_1[k+1]);
|
|---|
| 543 | V ((v2d *)BtF)[im*NLAT + k] *= sin_1; ((v2d *)BpF)[im*NLAT + k] *= sin_1;
|
|---|
| 544 | V ((v2d *)BtF)[im*NLAT + k+1] *= sin_2; ((v2d *)BpF)[im*NLAT + k+1] *= sin_2;
|
|---|
| 545 | V k+=2;
|
|---|
| 546 | V } while(k<NLAT);
|
|---|
| 547 | V }
|
|---|
| 548 | #endif
|
|---|
| 549 | if (shtns->ncplx_fft >= 0) {
|
|---|
| 550 | Q fftw_execute_dft_c2r(shtns->ifft, (cplx *) BrF, Vr);
|
|---|
| 551 | V fftw_execute_dft_c2r(shtns->ifft, (cplx *) BtF, Vt);
|
|---|
| 552 | V fftw_execute_dft_c2r(shtns->ifft, (cplx *) BpF, Vp);
|
|---|
| 553 | if (shtns->ncplx_fft > 0) { // free memory
|
|---|
| 554 | Q VFREE(BrF);
|
|---|
| 555 | VX VFREE(BtF); // this frees also BpF.
|
|---|
| 556 | }
|
|---|
| 557 | }
|
|---|
| 558 | #endif
|
|---|
| 559 |
|
|---|
| 560 | Q #undef BR0
|
|---|
| 561 | V #undef BT0
|
|---|
| 562 | V #undef BP0
|
|---|
| 563 | }
|
|---|