1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
|
#include <cctk.h>
#include <cctk_Arguments.h>
#include <cctk_Parameters.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include "vectors.h"
#include "operator_prototypes_3d.hh"
#include "typeprops.hh"
using namespace std;
namespace CarpetLib {
#define SRCIND3(i,j,k) \
index3 (i, j, k, \
srcipadext, srcjpadext, srckpadext, \
srciext, srcjext, srckext)
#define DSTIND3(i,j,k) \
index3 (i, j, k, \
dstipadext, dstjpadext, dstkpadext, \
dstiext, dstjext, dstkext)
#define SRCOFF3(i,j,k) \
offset3 (i, j, k, \
srciext, srcjext, srckext)
#define DSTOFF3(i,j,k) \
offset3 (i, j, k, \
dstiext, dstjext, dstkext)
namespace coeffs_3d_rf2 {
// 1D interpolation coefficients
template<typename RT, int ORDER>
struct coeffs1d {
static const RT coeffs[]
CCTK_ATTRIBUTE_ALIGNED(CCTK_REAL_VEC_SIZE * CCTK_REAL_PRECISION);
static ptrdiff_t const ncoeffs = ORDER+1;
static ptrdiff_t const imin = - ncoeffs/2 + 1;
static ptrdiff_t const imax = imin + ncoeffs;
static inline
RT const&
get (ptrdiff_t const i)
{
static_assert (ncoeffs == sizeof coeffs / sizeof *coeffs,
"coefficient array has wrong size");
#ifdef CARPET_DEBUG
assert (i>=imin and i<imax);
#endif
ptrdiff_t const j = i - imin;
#ifdef CARPET_DEBUG
assert (j>=0 and j<ncoeffs);
#endif
return coeffs[j];
}
// Test coefficients
static
void
test ()
{
static bool tested = false;
if (tested) return;
tested = true;
static_assert (ncoeffs == sizeof coeffs / sizeof *coeffs,
"coefficient array has wrong size");
// Do not test integer operators (they should be disabled
// anyway)
if (fabs (RT(0.5) - 0.5) > 1.0e-5) return;
// Test all orders
bool error = false;
for (int n=0; n<=ORDER; ++n) {
RT res = RT(0.0);
for (ptrdiff_t i=imin; i<imax; ++i) {
RT const x = RT(i) - RT(0.5);
RT const y = ipow (x, n);
res += get(i) * y;
}
RT const x0 = RT(0.0);
RT const y0 = ipow (x0, n);
// Allow losing 3 digits:
CCTK_REAL const eps = RT(1.0e+3) * numeric_limits<RT>::epsilon();
if (not (fabs (res - y0) < eps)) {
RT rt;
ostringstream buf;
buf << "Error in prolongate_3d_rf2::coeffs_3d_rf2\n"
<< " RT=" << typestring(rt) << "\n"
<< " ORDER=" << ORDER << "\n"
<< " n=" << n << "\n"
<< " y0=" << y0 << ", res=" << res;
CCTK_WARN (CCTK_WARN_ALERT, buf.str().c_str());
error = true;
}
} // for n
if (error) {
CCTK_WARN (CCTK_WARN_ABORT, "Aborting.");
}
}
};
#define TYPECASE(N,RT) \
\
template<> \
const RT coeffs1d<RT,1>::coeffs[] = { \
+1 / RT(2.0), \
+1 / RT(2.0) \
}; \
\
template<> \
const RT coeffs1d<RT,3>::coeffs[] = { \
-1 / RT(16.0), \
+9 / RT(16.0), \
+9 / RT(16.0), \
-1 / RT(16.0) \
}; \
\
template<> \
const RT coeffs1d<RT,5>::coeffs[] = { \
+ 3 / RT(256.0), \
- 25 / RT(256.0), \
+150 / RT(256.0), \
+150 / RT(256.0), \
- 25 / RT(256.0), \
+ 3 / RT(256.0) \
}; \
\
template<> \
const RT coeffs1d<RT,7>::coeffs[] = { \
- 5 / RT(2048.0), \
+ 49 / RT(2048.0), \
- 245 / RT(2048.0), \
+1225 / RT(2048.0), \
+1225 / RT(2048.0), \
- 245 / RT(2048.0), \
+ 49 / RT(2048.0), \
- 5 / RT(2048.0) \
}; \
\
template<> \
const RT coeffs1d<RT,9>::coeffs[] = { \
+ 35 / RT(65536.0), \
- 405 / RT(65536.0), \
+ 2268 / RT(65536.0), \
- 8820 / RT(65536.0), \
+39690 / RT(65536.0), \
+39690 / RT(65536.0), \
- 8820 / RT(65536.0), \
+ 2268 / RT(65536.0), \
- 405 / RT(65536.0), \
+ 35 / RT(65536.0) \
}; \
\
template<> \
const RT coeffs1d<RT,11>::coeffs[] = { \
- 63 / RT(524288.0), \
+ 847 / RT(524288.0), \
- 5445 / RT(524288.0), \
+ 22869 / RT(524288.0), \
- 76230 / RT(524288.0), \
+320166 / RT(524288.0), \
+320166 / RT(524288.0), \
- 76230 / RT(524288.0), \
+ 22869 / RT(524288.0), \
- 5445 / RT(524288.0), \
+ 847 / RT(524288.0), \
- 63 / RT(524288.0) \
};
#define CARPET_NO_COMPLEX
#define CARPET_NO_INT
#include "typecase.hh"
#undef TYPECASE
extern "C"
void CarpetLib_test_prolongate_3d_rf2 (CCTK_ARGUMENTS)
{
DECLARE_CCTK_ARGUMENTS;
#ifdef CCTK_REAL_PRECISION_4
# define TYPECASE(N,RT) \
coeffs1d<RT,1>::test(); \
coeffs1d<RT,3>::test(); \
coeffs1d<RT,5>::test(); \
coeffs1d<RT,7>::test(); \
coeffs1d<RT,9>::test();
#else
# define TYPECASE(N,RT) \
coeffs1d<RT,1>::test(); \
coeffs1d<RT,3>::test(); \
coeffs1d<RT,5>::test(); \
coeffs1d<RT,7>::test(); \
coeffs1d<RT,9>::test(); \
coeffs1d<RT,11>::test();
#endif
#define CARPET_NO_COMPLEX
#define CARPET_NO_INT
#include "typecase.hh"
#undef TYPECASE
}
} // namespace coeffs_3d_rf2
using namespace coeffs_3d_rf2;
// 0D "interpolation"
template <typename T, int ORDER>
static inline
T const&
interp0 (T const * restrict const p)
{
return * p;
}
// 1D interpolation
template <typename T, int ORDER, int di>
static inline
T
interp1 (T const * restrict const p,
size_t const d1)
{
typedef typeprops<T> typ;
typedef typename typ::real RT;
typedef coeffs1d<RT,ORDER> coeffs;
if (di == 0) {
return interp0<T,ORDER> (p);
} else {
if (d1 == 1) {
#if 0
T res = typ::fromreal (0);
for (ptrdiff_t i=coeffs::imin; i<coeffs::imax; ++i) {
res += coeffs::get(i) * interp0<T,ORDER> (p + i);
}
return res;
#endif
typedef vecprops<T> VP;
typedef typename VP::vector_t VT;
ptrdiff_t i = coeffs::imin;
T res = typ::fromreal (0);
if (coeffs::ncoeffs >= ptrdiff_t(VP::size())) {
VT vres =
VP::mul(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)));
i += VP::size();
#if defined(__INTEL_COMPILER)
// Unroll the loop manually to help the Intel compiler
// (This manual unrolling hurts with other compilers, e.g. PGI)
assert (coeffs::ncoeffs / VP::size() <= 12);
switch (coeffs::ncoeffs / VP::size()) {
// Note that all case statements fall through
case 12:
vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)),
vres);
i += VP::size();
case 11:
vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)),
vres);
i += VP::size();
case 10:
vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)),
vres);
i += VP::size();
case 9:
vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)),
vres);
i += VP::size();
case 8:
vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)),
vres);
i += VP::size();
case 7:
vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)),
vres);
i += VP::size();
case 6:
vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)),
vres);
i += VP::size();
case 5:
vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)),
vres);
i += VP::size();
case 4:
vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)),
vres);
i += VP::size();
case 3:
vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)),
vres);
i += VP::size();
case 2:
vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)),
vres);
i += VP::size();
}
#else
for (; i + VP::size() <= ptrdiff_t(coeffs::imax); i += VP::size()) {
vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
VP::loadu(interp0<T,ORDER> (p + i)),
vres);
}
#endif
for (int d=0; d<ptrdiff_t(VP::size()); ++d) {
res += VP::elt(vres,d);
}
}
assert (i == (ptrdiff_t(coeffs::imax) -
ptrdiff_t(coeffs::ncoeffs % VP::size())));
for (i = coeffs::imax - coeffs::ncoeffs % VP::size();
i < coeffs::imax;
++ i)
{
res += coeffs::get(i) * interp0<T,ORDER> (p + i*d1);
}
return res;
} else {
assert (0); // why would d1 have a non-unit stride?
T res = typ::fromreal (0);
for (ptrdiff_t i=coeffs::imin; i<coeffs::imax; ++i) {
res += coeffs::get(i) * interp0<T,ORDER> (p + i*d1);
}
return res;
}
}
}
// 2D interpolation
template <typename T, int ORDER, int di, int dj>
static inline
T
interp2 (T const * restrict const p,
size_t const d1,
size_t const d2)
{
typedef typeprops<T> typ;
typedef typename typ::real RT;
typedef coeffs1d<RT,ORDER> coeffs;
if (dj == 0) {
return interp1<T,ORDER,di> (p, d1);
} else {
T res = typeprops<T>::fromreal (0);
for (ptrdiff_t i=coeffs::imin; i<coeffs::imax; ++i) {
res += coeffs::get(i) * interp1<T,ORDER,di> (p + i*d2, d1);
}
return res;
}
}
// 3D interpolation
template <typename T, int ORDER, int di, int dj, int dk>
static inline
T
interp3 (T const * restrict const p,
size_t const d1,
size_t const d2,
size_t const d3)
{
typedef typeprops<T> typ;
typedef typename typ::real RT;
typedef coeffs1d<RT,ORDER> coeffs;
if (dk == 0) {
return interp2<T,ORDER,di,dj> (p, d1, d2);
} else {
T res = typeprops<T>::fromreal (0);
for (ptrdiff_t i=coeffs::imin; i<coeffs::imax; ++i) {
res += coeffs::get(i) * interp2<T,ORDER,di,dj> (p + i*d3, d1, d2);
}
return res;
}
}
// Check interpolation index ranges
template <typename T, int ORDER>
static inline
void
check_indices0 ()
{
}
template <typename T, int ORDER, int di>
static inline
void
check_indices1 (ptrdiff_t const is,
ptrdiff_t const srciext)
{
static_assert (di==0 or di==1, "di must be 0 or 1");
#ifdef CARPET_DEBUG
typedef typename typeprops<T>::real RT;
typedef coeffs1d<RT,ORDER> coeffs;
if (di == 0) {
assert (is >= 0);
assert (is < srciext);
} else {
assert (is + coeffs::imin >= 0);
assert (is + coeffs::imax <= srciext);
}
check_indices0<T,ORDER> ();
#endif
}
template <typename T, int ORDER, int di, int dj>
static inline
void
check_indices2 (ptrdiff_t const is,
ptrdiff_t const js,
ptrdiff_t const srciext,
ptrdiff_t const srcjext)
{
static_assert (dj==0 or dj==1, "dj must be 0 or 1");
#ifdef CARPET_DEBUG
typedef typename typeprops<T>::real RT;
typedef coeffs1d<RT,ORDER> coeffs;
if (dj == 0) {
assert (js >= 0);
assert (js < srcjext);
} else {
assert (js + coeffs::imin >= 0);
assert (js + coeffs::imax <= srcjext);
}
check_indices1<T,ORDER,di> (is, srciext);
#endif
}
template <typename T, int ORDER, int di, int dj, int dk>
static inline
void
check_indices3 (ptrdiff_t const is,
ptrdiff_t const js,
ptrdiff_t const ks,
ptrdiff_t const srciext,
ptrdiff_t const srcjext,
ptrdiff_t const srckext)
{
static_assert (dk==0 or dk==1, "dk must be 0 or 1");
#ifdef CARPET_DEBUG
typedef typename typeprops<T>::real RT;
typedef coeffs1d<RT,ORDER> coeffs;
if (dk == 0) {
assert (ks >= 0);
assert (ks < srckext);
} else {
assert (ks + coeffs::imin >= 0);
assert (ks + coeffs::imax <= srckext);
}
check_indices2<T,ORDER,di,dj> (is,js, srciext,srcjext);
#endif
}
template <typename T, int ORDER>
void
prolongate_3d_rf2 (T const * restrict const src,
ivect3 const & restrict srcpadext,
ivect3 const & restrict srcext,
T * restrict const dst,
ivect3 const & restrict dstpadext,
ivect3 const & restrict dstext,
ibbox3 const & restrict srcbbox,
ibbox3 const & restrict dstbbox,
ibbox3 const & restrict,
ibbox3 const & restrict regbbox,
void * extraargs)
{
assert (not extraargs);
static_assert (ORDER>=0 and ORDER % 2 == 1,
"ORDER must be non-negative and odd");
typedef typename typeprops<T>::real RT;
coeffs1d<RT,ORDER>::test();
if (any (srcbbox.stride() <= regbbox.stride() or
dstbbox.stride() != regbbox.stride()))
{
CCTK_WARN (0, "Internal error: strides disagree");
}
if (any (srcbbox.stride() != reffact2 * dstbbox.stride())) {
CCTK_WARN (0, "Internal error: source strides are not twice the destination strides");
}
if (any (srcbbox.lower() % srcbbox.stride() != 0)) {
CCTK_WARN (0, "Internal error: source bbox is not aligned with vertices");
}
if (any (dstbbox.lower() % dstbbox.stride() != 0)) {
CCTK_WARN (0, "Internal error: destination bbox is not aligned with vertices");
}
if (any (regbbox.lower() % regbbox.stride() != 0)) {
CCTK_WARN (0, "Internal error: prolongation region bbox is not aligned with vertices");
}
// This could be handled, but is likely to point to an error
// elsewhere
if (regbbox.empty()) {
CCTK_WARN (0, "Internal error: region extent is empty");
}
ivect3 const regext = regbbox.shape() / regbbox.stride();
assert (all ((regbbox.lower() - srcbbox.lower()) % regbbox.stride() == 0));
ivect3 const srcoff = (regbbox.lower() - srcbbox.lower()) / regbbox.stride();
assert (all ((regbbox.lower() - dstbbox.lower()) % regbbox.stride() == 0));
ivect3 const dstoff = (regbbox.lower() - dstbbox.lower()) / regbbox.stride();
bvect3 const needoffsetlo = srcoff % reffact2 != 0;
bvect3 const needoffsethi = (srcoff + regext - 1) % reffact2 != 0;
ivect3 const offsetlo =
either (needoffsetlo, ORDER/2+1, either (regext > 1, ORDER/2, 0));
ivect3 const offsethi =
either (needoffsethi, ORDER/2+1, either (regext > 1, ORDER/2, 0));
if (not regbbox.expand(offsetlo, offsethi).is_contained_in(srcbbox) or
not regbbox .is_contained_in(dstbbox))
{
cerr << "ORDER=" << ORDER << "\n"
<< "offsetlo=" << offsetlo << "\n"
<< "offsethi=" << offsethi << "\n"
<< "regbbox=" << regbbox << "\n"
<< "dstbbox=" << dstbbox << "\n"
<< "regbbox.expand=" << regbbox.expand(offsetlo, offsethi) << "\n"
<< "srcbbox=" << srcbbox << "\n";
CCTK_WARN (0, "Internal error: region extent is not contained in array extent");
}
size_t const srcipadext = srcpadext[0];
size_t const srcjpadext = srcpadext[1];
size_t const srckpadext = srcpadext[2];
size_t const dstipadext = dstpadext[0];
size_t const dstjpadext = dstpadext[1];
size_t const dstkpadext = dstpadext[2];
size_t const srciext = srcext[0];
size_t const srcjext = srcext[1];
size_t const srckext = srcext[2];
size_t const dstiext = dstext[0];
size_t const dstjext = dstext[1];
size_t const dstkext = dstext[2];
size_t const regiext = regext[0];
size_t const regjext = regext[1];
size_t const regkext = regext[2];
size_t const srcioff = srcoff[0];
size_t const srcjoff = srcoff[1];
size_t const srckoff = srcoff[2];
size_t const dstioff = dstoff[0];
size_t const dstjoff = dstoff[1];
size_t const dstkoff = dstoff[2];
size_t const fi = srcioff % 2;
size_t const fj = srcjoff % 2;
size_t const fk = srckoff % 2;
size_t const i0 = srcioff / 2;
size_t const j0 = srcjoff / 2;
size_t const k0 = srckoff / 2;
// size_t const srcdi = SRCOFF3(1,0,0) - SRCOFF3(0,0,0);
size_t const srcdi = 1;
assert (srcdi == SRCOFF3(1,0,0) - SRCOFF3(0,0,0));
size_t const srcdj = SRCOFF3(0,1,0) - SRCOFF3(0,0,0);
size_t const srcdk = SRCOFF3(0,0,1) - SRCOFF3(0,0,0);
// Loop over fine region
// Label scheme: l 8 fk fj fi
size_t is, js, ks;
size_t id, jd, kd;
size_t i, j, k;
// begin k loop
k = 0;
ks = k0;
kd = dstkoff;
if (fk == 0) goto l80;
goto l81;
// begin j loop
l80:
j = 0;
js = j0;
jd = dstjoff;
if (fj == 0) goto l800;
goto l801;
// begin i loop
l800:
i = 0;
is = i0;
id = dstioff;
if (fi == 0) goto l8000;
goto l8001;
// kernel
l8000:
check_indices3<T,ORDER,0,0,0> (is,js,ks, srciext, srcjext, srckext);
dst[DSTIND3(id,jd,kd)] =
interp3<T,ORDER,0,0,0> (& src[SRCIND3(is,js,ks)], srcdi,srcdj,srcdk);
i = i+1;
id = id+1;
if (i < regiext) goto l8001;
goto l900;
// kernel
l8001:
check_indices3<T,ORDER,1,0,0> (is,js,ks, srciext, srcjext, srckext);
dst[DSTIND3(id,jd,kd)] =
interp3<T,ORDER,1,0,0> (& src[SRCIND3(is,js,ks)], srcdi,srcdj,srcdk);
i = i+1;
id = id+1;
is = is+1;
if (i < regiext) goto l8000;
goto l900;
// end i loop
l900:
j = j+1;
jd = jd+1;
if (j < regjext) goto l801;
goto l90;
// begin i loop
l801:
i = 0;
is = i0;
id = dstioff;
if (fi == 0) goto l8010;
goto l8011;
// kernel
l8010:
check_indices3<T,ORDER,0,1,0> (is,js,ks, srciext, srcjext, srckext);
dst[DSTIND3(id,jd,kd)] =
interp3<T,ORDER,0,1,0> (& src[SRCIND3(is,js,ks)], srcdi,srcdj,srcdk);
i = i+1;
id = id+1;
if (i < regiext) goto l8011;
goto l901;
// kernel
l8011:
check_indices3<T,ORDER,1,1,0> (is,js,ks, srciext, srcjext, srckext);
dst[DSTIND3(id,jd,kd)] =
interp3<T,ORDER,1,1,0> (& src[SRCIND3(is,js,ks)], srcdi,srcdj,srcdk);
i = i+1;
id = id+1;
is = is+1;
if (i < regiext) goto l8010;
goto l901;
// end i loop
l901:
j = j+1;
jd = jd+1;
js = js+1;
if (j < regjext) goto l800;
goto l90;
// end j loop
l90:
k = k+1;
kd = kd+1;
if (k < regkext) goto l81;
goto l9;
// begin j loop
l81:
j = 0;
js = j0;
jd = dstjoff;
if (fj == 0) goto l810;
goto l811;
// begin i loop
l810:
i = 0;
is = i0;
id = dstioff;
if (fi == 0) goto l8100;
goto l8101;
// kernel
l8100:
check_indices3<T,ORDER,0,0,1> (is,js,ks, srciext, srcjext, srckext);
dst[DSTIND3(id,jd,kd)] =
interp3<T,ORDER,0,0,1> (& src[SRCIND3(is,js,ks)], srcdi,srcdj,srcdk);
i = i+1;
id = id+1;
if (i < regiext) goto l8101;
goto l910;
// kernel
l8101:
check_indices3<T,ORDER,1,0,1> (is,js,ks, srciext, srcjext, srckext);
dst[DSTIND3(id,jd,kd)] =
interp3<T,ORDER,1,0,1> (& src[SRCIND3(is,js,ks)], srcdi,srcdj,srcdk);
i = i+1;
id = id+1;
is = is+1;
if (i < regiext) goto l8100;
goto l910;
// end i loop
l910:
j = j+1;
jd = jd+1;
if (j < regjext) goto l811;
goto l91;
// begin i loop
l811:
i = 0;
is = i0;
id = dstioff;
if (fi == 0) goto l8110;
goto l8111;
// kernel
l8110:
check_indices3<T,ORDER,0,1,1> (is,js,ks, srciext, srcjext, srckext);
dst[DSTIND3(id,jd,kd)] =
interp3<T,ORDER,0,1,1> (& src[SRCIND3(is,js,ks)], srcdi,srcdj,srcdk);
i = i+1;
id = id+1;
if (i < regiext) goto l8111;
goto l911;
// kernel
l8111:
check_indices3<T,ORDER,1,1,1> (is,js,ks, srciext, srcjext, srckext);
dst[DSTIND3(id,jd,kd)] =
interp3<T,ORDER,1,1,1> (& src[SRCIND3(is,js,ks)], srcdi,srcdj,srcdk);
i = i+1;
id = id+1;
is = is+1;
if (i < regiext) goto l8110;
goto l911;
// end i loop
l911:
j = j+1;
jd = jd+1;
js = js+1;
if (j < regjext) goto l810;
goto l91;
// end j loop
l91:
k = k+1;
kd = kd+1;
ks = ks+1;
if (k < regkext) goto l80;
goto l9;
// end k loop
l9:;
}
#define TYPECASE(N,T) \
\
template \
void \
prolongate_3d_rf2<T,1> (T const * restrict const src, \
ivect3 const & restrict srcpadext, \
ivect3 const & restrict srcext, \
T * restrict const dst, \
ivect3 const & restrict dstpadext, \
ivect3 const & restrict dstext, \
ibbox3 const & restrict srcbbox, \
ibbox3 const & restrict dstbbox, \
ibbox3 const & restrict, \
ibbox3 const & restrict regbbox, \
void * extraargs); \
\
template \
void \
prolongate_3d_rf2<T,3> (T const * restrict const src, \
ivect3 const & restrict srcpadext, \
ivect3 const & restrict srcext, \
T * restrict const dst, \
ivect3 const & restrict dstpadext, \
ivect3 const & restrict dstext, \
ibbox3 const & restrict srcbbox, \
ibbox3 const & restrict dstbbox, \
ibbox3 const & restrict, \
ibbox3 const & restrict regbbox, \
void * extraargs); \
\
template \
void \
prolongate_3d_rf2<T,5> (T const * restrict const src, \
ivect3 const & restrict srcpadext, \
ivect3 const & restrict srcext, \
T * restrict const dst, \
ivect3 const & restrict dstpadext, \
ivect3 const & restrict dstext, \
ibbox3 const & restrict srcbbox, \
ibbox3 const & restrict dstbbox, \
ibbox3 const & restrict, \
ibbox3 const & restrict regbbox, \
void * extraargs); \
\
template \
void \
prolongate_3d_rf2<T,7> (T const * restrict const src, \
ivect3 const & restrict srcpadext, \
ivect3 const & restrict srcext, \
T * restrict const dst, \
ivect3 const & restrict dstpadext, \
ivect3 const & restrict dstext, \
ibbox3 const & restrict srcbbox, \
ibbox3 const & restrict dstbbox, \
ibbox3 const & restrict, \
ibbox3 const & restrict regbbox, \
void * extraargs); \
\
template \
void \
prolongate_3d_rf2<T,9> (T const * restrict const src, \
ivect3 const & restrict srcpadext, \
ivect3 const & restrict srcext, \
T * restrict const dst, \
ivect3 const & restrict dstpadext, \
ivect3 const & restrict dstext, \
ibbox3 const & restrict srcbbox, \
ibbox3 const & restrict dstbbox, \
ibbox3 const & restrict, \
ibbox3 const & restrict regbbox, \
void * extraargs); \
\
template \
void \
prolongate_3d_rf2<T,11> (T const * restrict const src, \
ivect3 const & restrict srcpadext, \
ivect3 const & restrict srcext, \
T * restrict const dst, \
ivect3 const & restrict dstpadext, \
ivect3 const & restrict dstext, \
ibbox3 const & restrict srcbbox, \
ibbox3 const & restrict dstbbox, \
ibbox3 const & restrict, \
ibbox3 const & restrict regbbox, \
void * extraargs);
#define CARPET_NO_INT
#include "typecase.hh"
#undef TYPECASE
} // namespace CarpetLib
|
