eschnett/cactusamrex - Change PRSJIT75ZEPP53K6V2W2TDLZNZ63JXWRAPIMGFE6N4Z2MU4CF6VQC

Remove outdated, unused prolongation operators

Created by Erik Schnetter on October 13, 2019

PRSJIT75ZEPP53K6V2W2TDLZNZ63JXWRAPIMGFE6N4Z2MU4CF6VQC

Dependencies

In channels

main

master

Change contents

File deletion: prolongate_3d_vc_rf2.cxx, prolongate_3d_rf2.cxx

BF:BFD[5.15096] → [6.4805:4831]

BF:BFD[6.4831] → [7.179:179]

BFD:BFD[5.15096] → [7.155:178]

BF:BFD[7.178] → [7.179:179]

B:BD[7.179] → [6.4832:4868]

∅:D[6.4868] → [7.213:485]

B:BD[7.213] → [7.213:485]

B:BD[7.485] → [6.4869:5138]

B:BD[6.5138] → [3.114:132]

∅:D[6.5158] → [7.790:989]

∅:D[3.132] → [7.790:989]

B:BD[7.790] → [7.790:989]

B:BD[7.989] → [6.5159:5251]

∅:D[6.5251] → [7.1119:1151]

B:BD[7.1119] → [7.1119:1151]

B:BD[7.1151] → [6.5252:5281]

∅:D[6.5281] → [7.1269:1285]

B:BD[7.1269] → [7.1269:1285]

B:BD[7.1285] → [6.5282:5284]

∅:D[6.5284] → [7.1390:1532]

B:BD[7.1390] → [7.1390:1532]

∅:D[6.5300] → [7.1532:3175]

B:BD[7.1532] → [7.1532:3175]

B:BD[7.3175] → [6.5301:5329]

∅:D[6.5329] → [7.3209:3522]

B:BD[7.3209] → [7.3209:3522]

B:BD[7.3522] → [3.133:151]

∅:D[3.151] → [7.3542:3619]

B:BD[7.3542] → [7.3542:3619]

B:BD[7.3619] → [3.152:170]

∅:D[3.170] → [7.3639:13323]

B:BD[7.3639] → [7.3639:13323]

B:BD[7.13323] → [3.171:189]

∅:D[3.189] → [7.13343:13921]

B:BD[7.13343] → [7.13343:13921]

B:BD[7.13921] → [3.190:208]

∅:D[3.208] → [7.13941:14621]

B:BD[7.13941] → [7.13941:14621]

B:BD[7.14621] → [3.209:227]

∅:D[3.227] → [7.14641:15200]

B:BD[7.14641] → [7.14641:15200]

B:BD[7.15200] → [8.0:98]

∅:D[8.98] → [7.15294:15911]

B:BD[7.15294] → [7.15294:15911]

B:BD[7.15911] → [6.5330:5383]

∅:D[6.5383] → [7.15963:16069]

B:BD[7.15963] → [7.15963:16069]

B:BD[7.16069] → [6.5384:5447]

∅:D[6.5447] → [7.16131:16149]

B:BD[7.16131] → [7.16131:16149]

B:BD[7.16149] → [6.5448:5541]

∅:D[6.5541] → [7.16232:16233]

B:BD[7.16232] → [7.16232:16233]

B:BD[7.16233] → [6.5542:5597]

∅:D[6.5597] → [7.16287:16365]

B:BD[7.16287] → [7.16287:16365]

B:BD[7.16365] → [6.5598:5797]

∅:D[6.5797] → [7.16556:16741]

B:BD[7.16556] → [7.16556:16741]

B:BD[7.16741] → [6.5798:5824]

∅:D[6.5824] → [7.16766:16827]

B:BD[7.16766] → [7.16766:16827]

B:BD[7.16827] → [6.5825:6220]

∅:D[6.6220] → [8.159:239]

B:BD[7.17111] → [8.159:239]

∅:D[8.239] → [7.17144:17145]

B:BD[7.17144] → [7.17144:17145]

B:BD[7.17145] → [6.6221:6426]

∅:D[6.6426] → [7.17346:17347]

B:BD[7.17346] → [7.17346:17347]

B:BD[7.17347] → [6.6427:6503]

∅:D[6.6503] → [7.17422:17915]

B:BD[7.17422] → [7.17422:17915]

B:BD[7.17915] → [6.6504:6702]

∅:D[6.6702] → [7.18110:18488]

B:BD[7.18110] → [7.18110:18488]

B:BD[7.18488] → [9.87:264]

∅:D[9.264] → [7.18671:19516]

B:BD[7.18671] → [7.18671:19516]

B:BD[7.19516] → [8.240:473]

∅:D[8.473] → [7.19516:23343]

B:BD[7.19516] → [7.19516:23343]

B:BD[7.23343] → [6.6703:6778]

∅:D[6.6778] → [7.23420:23442]

B:BD[7.23420] → [7.23420:23442]

B:BD[7.23442] → [6.6779:6851]

∅:D[6.6851] → [7.23515:23576]

B:BD[7.23515] → [7.23515:23576]

B:BD[7.23576] → [6.6852:6877]

∅:D[6.6877] → [7.23595:23632]

∅:D[8.495] → [7.23595:23632]

B:BD[7.23595] → [7.23595:23632]

B:BD[7.23632] → [6.6878:7003]

∅:D[6.7003] → [7.23716:23777]

B:BD[7.23716] → [7.23716:23777]

B:BD[7.23777] → [6.7004:7029]

∅:D[6.7029] → [7.23796:23833]

∅:D[8.517] → [7.23796:23833]

B:BD[7.23796] → [7.23796:23833]

B:BD[7.23833] → [6.7030:7518]

∅:D[6.7518] → [7.24703:24704]

B:BD[7.24703] → [7.24703:24704]

B:BD[7.24704] → [6.7519:7579]

∅:D[6.7579] → [7.25710:25711]

∅:D[8.1145] → [7.25710:25711]

B:BD[7.25710] → [7.25710:25711]

B:BD[7.25711] → [6.7580:8598]

∅:D[6.8598] → [8.1213:1646]

B:BD[8.1213] → [8.1213:1646]

B:BD[8.1646] → [6.8599:8603]

∅:D[6.8603] → [7.26187:26258]

∅:D[8.1652] → [7.26187:26258]

B:BD[7.26187] → [7.26187:26258]

B:BD[7.1532] → [6.5285:5300]

#include "prolongate_3d_vc_rf2.hxx"
#include "cctk.h"
#include "typeprops.hh"
#include "vectors.h"
#include <AMReX_Vector.H>
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <limits>
namespace CarpetLib {
using namespace std;
namespace {
inline size_t index3(size_t const i, size_t const j, size_t const k,
                     size_t const padexti, size_t const padextj,
                     size_t const padextk, size_t const exti, size_t const extj,
                     size_t const extk) {
#ifdef CCTK_DEBUG
  assert(i < exti);
  assert(j < extj);
  assert(k < extk);
#endif
  return i + padexti * (j + padextj * k);
}
template <typename T>
inline T ipow_helper(T x, unsigned int y) CCTK_ATTRIBUTE_CONST;
template <typename T> inline T ipow_helper(T x, unsigned int y) {
  T z = y & 1 ? x : T(1);
  while (y >>= 1) {
    x *= x;
    if (y & 1)
      z *= x;
  }
  return z;
}
template <class T> T ipow(T const x, int const y) {
  if (y < 0)
    return T(1) / ipow_helper(x, -y);
  else
    return ipow_helper(x, y);
}
#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)
namespace coeffs_3d_rf2 {
// Names for types
#ifdef HAVE_CCTK_INT1
inline const char *typestring(const CCTK_INT1 &) { return "CCTK_INT1"; }
#endif
#ifdef HAVE_CCTK_INT2
inline const char *typestring(const CCTK_INT2 &) { return "CCTK_INT2"; }
#endif
#ifdef HAVE_CCTK_INT4
inline const char *typestring(const CCTK_INT4 &) { return "CCTK_INT4"; }
#endif
#ifdef HAVE_CCTK_INT8
inline const char *typestring(const CCTK_INT8 &) { return "CCTK_INT8"; }
#endif
#ifdef HAVE_CCTK_INT16
inline const char *typestring(const CCTK_INT16 &) { return "CCTK_INT16"; }
#endif
#ifdef HAVE_CCTK_REAL4
inline const char *typestring(const CCTK_REAL4 &) { return "CCTK_REAL4"; }
#endif
#ifdef HAVE_CCTK_REAL8
inline const char *typestring(const CCTK_REAL8 &) { return "CCTK_REAL8"; }
#endif
#ifdef HAVE_CCTK_REAL16
inline const char *typestring(const CCTK_REAL16 &) { return "CCTK_REAL16"; }
#endif
#ifdef HAVE_CCTK_REAL4
inline const char *typestring(const CCTK_COMPLEX8 &) { return "CCTK_COMPLEX8"; }
#endif
#ifdef HAVE_CCTK_REAL8
inline const char *typestring(const CCTK_COMPLEX16 &) {
  return "CCTK_COMPLEX16";
}
#endif
#ifdef HAVE_CCTK_REAL16
inline const char *typestring(const CCTK_COMPLEX32 &) {
  return "CCTK_COMPLEX32";
}
#endif
// 1D interpolation coefficients
template <typename RT, int ORDER> struct coeffs1d {
  static const RT coeffs[];
  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 CCTK_DEBUG
    assert(i >= imin and i < imax);
#endif
    ptrdiff_t const j = i - imin;
#ifdef CCTK_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 (std::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(std::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_ERROR("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)};
TYPECASE(CCTK_VARIABLE_REAL8, CCTK_REAL8);
#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 const vsize = VP::size();
      ptrdiff_t i = coeffs::imin;
      T res = typ::fromreal(0);
      if (coeffs::ncoeffs >= vsize) {
        VT vres = VP::mul(VP::load(typ::fromreal(coeffs::get(i))),
                          VP::loadu(interp0<T, ORDER>(p + i)));
        i += vsize;
#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 / vsize <= 12);
        switch (coeffs::ncoeffs / vsize) {
        // 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 += vsize;
        case 11:
          vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
                          VP::loadu(interp0<T, ORDER>(p + i)), vres);
          i += vsize;
        case 10:
          vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
                          VP::loadu(interp0<T, ORDER>(p + i)), vres);
          i += vsize;
        case 9:
          vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
                          VP::loadu(interp0<T, ORDER>(p + i)), vres);
          i += vsize;
        case 8:
          vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
                          VP::loadu(interp0<T, ORDER>(p + i)), vres);
          i += vsize;
        case 7:
          vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
                          VP::loadu(interp0<T, ORDER>(p + i)), vres);
          i += vsize;
        case 6:
          vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
                          VP::loadu(interp0<T, ORDER>(p + i)), vres);
          i += vsize;
        case 5:
          vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
                          VP::loadu(interp0<T, ORDER>(p + i)), vres);
          i += vsize;
        case 4:
          vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
                          VP::loadu(interp0<T, ORDER>(p + i)), vres);
          i += vsize;
        case 3:
          vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
                          VP::loadu(interp0<T, ORDER>(p + i)), vres);
          i += vsize;
        case 2:
          vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
                          VP::loadu(interp0<T, ORDER>(p + i)), vres);
          i += vsize;
        }
#else
        for (; i + vsize <= ptrdiff_t(coeffs::imax); i += vsize) {
          vres = VP::madd(VP::load(typ::fromreal(coeffs::get(i))),
                          VP::loadu(interp0<T, ORDER>(p + i)), vres);
        }
#endif
        for (int d = 0; d < vsize; ++d) {
          res += VP::elt(vres, d);
        }
      }
      assert(i == ptrdiff_t(coeffs::imax) - ptrdiff_t(coeffs::ncoeffs % vsize));
      for (i = coeffs::imax - ptrdiff_t(coeffs::ncoeffs % vsize);
           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 CCTK_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 CCTK_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 CCTK_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 *restrict const dst,
                       int const *restrict flo, int const *restrict fhi, //dstpadext,
                       int const *restrict fblo, int const *restrict fbhi, //dstext,
                       /*int const ncomp, int const ratioX, int const ratioY, int const ratioZ,*/
                       T const *restrict const src,
                       int const *restrict clo, int const *restrict chi//, //srcpadext,
                       //int const *restrict cblo, int const *restrict cbhi, //srcext,
                       /*ibbox3 const &restrict srcbbox,
                       ibbox3 const &restrict dstbbox, ibbox3 const &restrict,
                       ibbox3 const &restrict regbbox, void *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_ERROR("Internal error: strides disagree");
  // if (any(srcbbox.stride() != reffact2 * dstbbox.stride()))
  //  CCTK_ERROR(
  //      "Internal error: source strides are not twice the destination
  //      strides");
  // if (any(srcbbox.lower() % srcbbox.stride() != 0))
  //  CCTK_ERROR("Internal error: source bbox is not aligned with vertices");
  // if (any(dstbbox.lower() % dstbbox.stride() != 0))
  //  CCTK_ERROR("Internal error: destination bbox is not aligned with
  //  vertices");
  // if (any(regbbox.lower() % regbbox.stride() != 0))
  //  CCTK_ERROR("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_ERROR("Internal error: region extent is empty");
  int const regext[3] = {fbhi[0] - fblo[0] + 1, fbhi[1] - fblo[1] + 1,
                         fbhi[2] - fblo[2] + 1};
  // assert(all((regbbox.lower() - srcbbox.lower()) % regbbox.stride() == 0));
  int const srcoff[3] = {fblo[0] - 2 * clo[0], fblo[1] - 2 * clo[1],
                         fblo[2] - 2 * clo[2]};
  // assert(all((regbbox.lower() - dstbbox.lower()) % regbbox.stride() == 0));
  int const dstoff[3] = {fblo[0] - flo[0], fblo[1] - flo[1], fblo[2] - flo[2]};
  // bvect3 const needoffsetlo = srcoff % reffact2 != 0;
  // bvect3 const needoffsethi = (srcoff + regext - 1) % reffact2 != 0;
  // int const offsetlo[3] = {0,0,0};
  // int const offsethi[3] = {0,0,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_ERROR(
  //      "Internal error: region extent is not contained in array extent");
  //}
  size_t const srcipadext = chi[0] - clo[0] + 1; // srcpadext[0];
  size_t const srcjpadext = chi[1] - clo[1] + 1; // srcpadext[1];
  size_t const srckpadext = chi[2] - clo[2] + 1; // srcpadext[2];
  size_t const dstipadext = fhi[0] - flo[0] + 1; // dstpadext[0];
  size_t const dstjpadext = fhi[1] - flo[1] + 1; // dstpadext[1];
  size_t const dstkpadext = fhi[2] - flo[2] + 1; // dstpadext[2];
  size_t const srciext = chi[0] - clo[0] + 1; // rcext[0];
  size_t const srcjext = chi[1] - clo[1] + 1; // rcext[1];
  size_t const srckext = chi[2] - clo[2] + 1; // rcext[2];
  size_t const dstiext = fhi[0] - flo[0] + 1; // stext[0];
  size_t const dstjext = fhi[1] - flo[1] + 1; // stext[1];
  size_t const dstkext = fhi[2] - flo[2] + 1; // stext[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 = SRCIND3(1,0,0) - SRCIND3(0,0,0);
  size_t const srcdi = 1;
  assert(srcdi == (srciext > 1 ? SRCIND3(1, 0, 0) - SRCIND3(0, 0, 0) : 1));
  size_t const srcdj = srcjext > 1 ? SRCIND3(0, 1, 0) - SRCIND3(0, 0, 0) : 0;
  size_t const srcdk = srckext > 1 ? SRCIND3(0, 0, 1) - SRCIND3(0, 0, 0) : 0;
#if 0
  for(size_t k = 0 ; k < regkext ; k++)
  for(size_t j = 0 ; j < regjext ; j++)
  for(size_t i = 0 ; i < regiext ; i++)
    dst[DSTIND3(i+dstioff, j+dstjoff, k+dstkoff)] = src[SRCIND3(i/2+srcioff, j/2, k/2)];
  return;
#endif
  // 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:;
}
} // namespace CarpetLib
namespace amrex {
template <int ORDER> Prolongate3D_VC_RF2<ORDER>::~Prolongate3D_VC_RF2() {}
template <int ORDER>
Box Prolongate3D_VC_RF2<ORDER>::CoarseBox(const Box &fine, int ratio) {
  assert(ORDER % 2);
  Box b = amrex::coarsen(fine, ratio);
  b.grow(ORDER / 2 + 1);
  return b;
}
template <int ORDER>
Box Prolongate3D_VC_RF2<ORDER>::CoarseBox(const Box &fine,
                                          const IntVect &ratio) {
  assert(ORDER % 2);
  Box b = amrex::coarsen(fine, ratio);
  b.grow(ORDER / 2 + 1);
  return b;
}
template <int ORDER>
void Prolongate3D_VC_RF2<ORDER>::interp(
    const FArrayBox &crse, int crse_comp, FArrayBox &fine, int fine_comp,
    int ncomp, const Box &fine_region, const IntVect &ratio,
    const Geometry &crse_geom, const Geometry &fine_geom,
    Vector<BCRec> const &bcr, int actual_comp, int actual_state,
    RunOn gpu_or_cpu) {
  assert(bcr.size() >= ncomp);
  //
  // Make box which is intersection of fine_region and domain of fine.
  //
  Box target_fine_region = fine_region & fine.box();
  // Box crse_bx(amrex::coarsen(target_fine_region,ratio));
  //
  // Get coarse and fine edge-centered volume coordinates.
  //
  // TODO: do not use AMREX macro
  /*
  Vector<CCTK_REAL> fvc[AMREX_SPACEDIM];
  Vector<CCTK_REAL> cvc[AMREX_SPACEDIM];
  for (int dir = 0; dir < AMREX_SPACEDIM; dir++)
  {
      fine_geom.GetEdgeVolCoord(fvc[dir],target_fine_region,dir);
      crse_geom.GetEdgeVolCoord(cvc[dir],crse_bx,dir);
  }
  */
  for (int var = 0; var < ncomp; ++var) {
    CCTK_REAL *fdat = fine.dataPtr(fine_comp + var);
    const CCTK_REAL *cdat = crse.dataPtr(crse_comp + var);
    const int *flo = fine.loVect();
    const int *fhi = fine.hiVect();
    const int *fblo = target_fine_region.loVect();
    const int *fbhi = target_fine_region.hiVect();
    const int *clo = crse.loVect();
    const int *chi = crse.hiVect();
    // const int* cblo   = crse_bx.loVect();
    // const int* cbhi   = crse_bx.hiVect();
    // Vector<int> bc     = GetBCArray(bcr);
    // const int* ratioV = ratio.getVect();
    CarpetLib::prolongate_3d_rf2<CCTK_REAL, ORDER>(fdat,flo,fhi,
                     fblo, fbhi,
                     /*ncomp,ratioV[0],ratioV[1],ratioV[2],*/
                     cdat,clo,chi//,
                     //cblo, cbhi,
                     /*fslo,fshi,
                     bc.dataPtr(), 
                     fvc[0].dataPtr(),fvc[1].dataPtr(),fvc[2].dataPtr(),
                     cvc[0].dataPtr(),cvc[1].dataPtr(),cvc[2].dataPtr(),
                     actual_comp,actual_state*/);
  }
}
Prolongate3D_VC_RF2<5> prolongate3d_vc_rf2_o5;
} // namespace amrex
} // namespace

File deletion: prolongate_3d_vc_rf2.hxx, prolongate_3d_rf2.hxx

BF:BFD[5.15096] → [6.8604:8630]

BF:BFD[6.8630] → [7.26284:26284]

BFD:BFD[5.15096] → [7.26260:26283]

BF:BFD[7.26283] → [7.26284:26284]

B:BD[7.26284] → [7.26285:28250]

B:BD[7.28250] → [2.0:54]

∅:D[2.54] → [7.28250:28291]

B:BD[7.28250] → [7.28250:28291]

#ifndef CARPET_PROLONGATE_3D_RF2_H_
#define CARPET_PROLONGATE_3D_RF2_H_
#include <AMReX_Geometry.H>
#include <AMReX_FArrayBox.H>
#include <AMReX_Interpolater.H>
/**
* \brief Vertex centered sampling interpolation.
*
* Vertex centered interpolation copied from CarpetLib.
*/
namespace amrex {
template <int ORDER>
class Prolongate3D_VC_RF2
    :
    public Interpolater
{
public:
    /**
    * \brief The destructor.
    */
    virtual ~Prolongate3D_VC_RF2 () override;
    /**
    * \brief Returns coarsened box given fine box and refinement ratio.
    *
    * \param fine
    * \param ratio
    */
    virtual Box CoarseBox (const Box& fine,
                           int        ratio) override;
    /**
    * \brief Returns coarsened box given fine box and refinement ratio.
    *
    * \param fine
    * \param ratio
    */
    virtual Box CoarseBox (const Box&     fine,
                           const IntVect& ratio) override;
    /**
    * \brief Coarse to fine interpolation in space.
    *
    * \param crse
    * \param crse_comp
    * \param fine
    * \param fine_comp
    * \param ncomp
    * \param fine_region
    * \param ratio
    * \param crse_geom
    * \param fine_geom
    * \param bcr
    * \param actual_comp
    * \param actual_state
    */
    virtual void interp (const FArrayBox& crse,
                         int              crse_comp,
                         FArrayBox&       fine,
                         int              fine_comp,
                         int              ncomp,
                         const Box&       fine_region,
                         const IntVect&   ratio,
                         const Geometry&  crse_geom,
                         const Geometry&  fine_geom,
                         Vector<BCRec> const& bcr,
                         int              actual_comp,
                         int              actual_state,
                         RunOn            gpu_or_cpu) override;
};
extern Prolongate3D_VC_RF2<5> prolongate3d_vc_rf2_o5;
}
#endif // CARPET_PROLONGATE_3D_RF2_H_

File deletion: prolongate_3d_cc_rf2.cxx

BF:BFD[5.15096] → [10.300:326]

BF:BFD[10.326] → [10.327:327]

B:BD[10.327] → [10.328:636]

B:BD[10.636] → [6.1018:1287]

B:BD[6.1287] → [3.0:18]

∅:D[6.1307] → [10.941:1140]

∅:D[3.18] → [10.941:1140]

B:BD[10.941] → [10.941:1140]

B:BD[10.1140] → [6.1308:1400]

∅:D[6.1400] → [10.1270:1302]

B:BD[10.1270] → [10.1270:1302]

B:BD[10.1302] → [6.1401:1430]

∅:D[6.1430] → [10.1420:1436]

B:BD[10.1420] → [10.1420:1436]

B:BD[10.1436] → [6.1431:1433]

∅:D[6.1433] → [10.1541:1683]

B:BD[10.1541] → [10.1541:1683]

∅:D[6.1449] → [10.1683:4109]

B:BD[10.1683] → [10.1683:4109]

B:BD[10.4110] → [10.4110:4740]

B:BD[10.4740] → [3.19:37]

∅:D[3.37] → [10.4760:4874]

B:BD[10.4760] → [10.4760:4874]

B:BD[10.4874] → [3.38:56]

∅:D[3.56] → [10.4894:10142]

B:BD[10.4894] → [10.4894:10142]

B:BD[10.10142] → [3.57:75]

∅:D[3.75] → [10.10162:10603]

B:BD[10.10162] → [10.10162:10603]

B:BD[10.10603] → [3.76:94]

∅:D[3.94] → [10.10623:11166]

B:BD[10.10623] → [10.10623:11166]

B:BD[10.11166] → [3.95:113]

∅:D[3.113] → [10.11186:11476]

B:BD[10.11186] → [10.11186:11476]

B:BD[10.11476] → [6.1450:1639]

∅:D[6.1639] → [10.11636:11715]

B:BD[10.11636] → [10.11636:11715]

B:BD[10.11715] → [6.1640:1729]

∅:D[6.1729] → [10.11804:11976]

B:BD[10.11804] → [10.11804:11976]

B:BD[10.11976] → [6.1730:1783]

∅:D[6.1783] → [10.12028:12144]

B:BD[10.12028] → [10.12028:12144]

B:BD[10.12144] → [6.1784:1849]

∅:D[6.1849] → [10.12208:12238]

B:BD[10.12208] → [10.12208:12238]

B:BD[10.12238] → [6.1850:1943]

∅:D[6.1943] → [10.12321:12328]

B:BD[10.12321] → [10.12321:12328]

B:BD[10.12328] → [6.1944:1987]

∅:D[6.1987] → [10.12370:12527]

B:BD[10.12370] → [10.12370:12527]

B:BD[10.12527] → [6.1988:2016]

∅:D[6.2016] → [10.12554:12623]

B:BD[10.12554] → [10.12554:12623]

B:BD[10.12623] → [6.2017:2214]

∅:D[6.2214] → [10.12794:12853]

B:BD[10.12794] → [10.12794:12853]

B:BD[10.12853] → [6.2215:2411]

∅:D[6.2411] → [10.13012:13107]

B:BD[10.13012] → [10.13012:13107]

B:BD[10.13107] → [6.2412:2491]

∅:D[6.2491] → [10.13185:13343]

B:BD[10.13185] → [10.13185:13343]

B:BD[10.13343] → [6.2492:2524]

∅:D[6.2524] → [10.13374:14139]

B:BD[10.13374] → [10.13374:14139]

B:BD[10.14139] → [6.2525:2601]

∅:D[6.2601] → [10.14214:14624]

B:BD[10.14214] → [10.14214:14624]

B:BD[10.14624] → [6.2602:2701]

∅:D[6.2701] → [10.14707:14714]

B:BD[10.14707] → [10.14707:14714]

B:BD[10.14714] → [6.2702:2900]

∅:D[6.2900] → [10.14909:20091]

B:BD[10.14909] → [10.14909:20091]

B:BD[10.20092] → [10.20092:20137]

B:BD[10.20137] → [6.2901:2976]

∅:D[6.2976] → [10.20214:20236]

B:BD[10.20214] → [10.20214:20236]

B:BD[10.20236] → [6.2977:3049]

∅:D[6.3049] → [10.20309:20375]

B:BD[10.20309] → [10.20309:20375]

B:BD[10.20375] → [6.3050:3075]

∅:D[6.3075] → [10.20396:20433]

B:BD[10.20396] → [10.20396:20433]

B:BD[10.20433] → [6.3076:3201]

∅:D[6.3201] → [10.20517:20583]

B:BD[10.20517] → [10.20517:20583]

B:BD[10.20583] → [6.3202:3227]

∅:D[6.3227] → [10.20604:20641]

B:BD[10.20604] → [10.20604:20641]

B:BD[10.20641] → [6.3228:3716]

∅:D[6.3716] → [10.21511:21512]

B:BD[10.21511] → [10.21511:21512]

B:BD[10.21512] → [6.3717:3777]

∅:D[6.3777] → [10.22604:22605]

B:BD[10.22604] → [10.22604:22605]

B:BD[10.22605] → [6.3778:4799]

∅:D[6.4799] → [10.22675:23108]

B:BD[10.22675] → [10.22675:23108]

B:BD[10.23108] → [6.4800:4804]

∅:D[6.4804] → [10.23114:23185]

B:BD[10.23114] → [10.23114:23185]

B:BD[10.1683] → [6.1434:1449]

#include "prolongate_3d_cc_rf2.hxx"
#include "cctk.h"
#include "typeprops.hh"
#include "vectors.h"
#include <AMReX_Vector.H>
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <limits>
namespace CarpetLib {
using namespace std;
namespace {
inline size_t index3(size_t const i, size_t const j, size_t const k,
                     size_t const padexti, size_t const padextj,
                     size_t const padextk, size_t const exti, size_t const extj,
                     size_t const extk) {
#ifdef CCTK_DEBUG
  assert(i < exti);
  assert(j < extj);
  assert(k < extk);
#endif
  return i + padexti * (j + padextj * k);
}
template <typename T>
inline T ipow_helper(T x, unsigned int y) CCTK_ATTRIBUTE_CONST;
template <typename T> inline T ipow_helper(T x, unsigned int y) {
  T z = y & 1 ? x : T(1);
  while (y >>= 1) {
    x *= x;
    if (y & 1)
      z *= x;
  }
  return z;
}
template <class T> T ipow(T const x, int const y) {
  if (y < 0)
    return T(1) / ipow_helper(x, -y);
  else
    return ipow_helper(x, y);
}
//
// Grid point locations and their indices:
//
// global   0   4      12      20      28   |
// local    |   0       1       2       3   |
//          |   C       C       C       C   |
//          | f   f   f   f   f   f   f   f |
// local    | 0   1   2   3   4   5   6   7 |
// global   0 2   6  10  14  18  22  26  30 |
//
// Interpolation with even interpolation order:
//    offset zero (fine index = 2 * coarse index):
//       [1]
//    offset one (fine index = 2 * coarse index + 1):
//       [1]
// Interpolation with odd interpolation order:
//    offset zero:
//       [1 1 0]/2
//    offset one:
//       [0 1 1]/2
// The centres of these stencils are located at the coarse grid point
// corresponding to the fine grid point (the interpolation target)
// minus the offset. Example: fine grid 8 -> coarse grid 8, fine grid
// 12 -> also coarse grid 8.
#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)
namespace coeffs_3d_cc_rf2 {
// Names for types
#ifdef HAVE_CCTK_INT1
inline const char *typestring(const CCTK_INT1 &) { return "CCTK_INT1"; }
#endif
#ifdef HAVE_CCTK_INT2
inline const char *typestring(const CCTK_INT2 &) { return "CCTK_INT2"; }
#endif
#ifdef HAVE_CCTK_INT4
inline const char *typestring(const CCTK_INT4 &) { return "CCTK_INT4"; }
#endif
#ifdef HAVE_CCTK_INT8
inline const char *typestring(const CCTK_INT8 &) { return "CCTK_INT8"; }
#endif
#ifdef HAVE_CCTK_INT16
inline const char *typestring(const CCTK_INT16 &) { return "CCTK_INT16"; }
#endif
#ifdef HAVE_CCTK_REAL4
inline const char *typestring(const CCTK_REAL4 &) { return "CCTK_REAL4"; }
#endif
#ifdef HAVE_CCTK_REAL8
inline const char *typestring(const CCTK_REAL8 &) { return "CCTK_REAL8"; }
#endif
#ifdef HAVE_CCTK_REAL16
inline const char *typestring(const CCTK_REAL16 &) { return "CCTK_REAL16"; }
#endif
#ifdef HAVE_CCTK_REAL4
inline const char *typestring(const CCTK_COMPLEX8 &) { return "CCTK_COMPLEX8"; }
#endif
#ifdef HAVE_CCTK_REAL8
inline const char *typestring(const CCTK_COMPLEX16 &) {
  return "CCTK_COMPLEX16";
}
#endif
#ifdef HAVE_CCTK_REAL16
inline const char *typestring(const CCTK_COMPLEX32 &) {
  return "CCTK_COMPLEX32";
}
#endif
// 1D interpolation coefficients
template <typename RT, int ORDER> struct coeffs1dc {
  static const RT coeffs[];
};
template <typename RT, int ORDER, int di> struct coeffs1d {
  typedef coeffs1dc<RT, ORDER> coeffs_t;
  static ptrdiff_t const ncoeffs = ORDER + 1;
  static ptrdiff_t const imin = -ncoeffs / 2 + (ORDER % 2 != 0 ? di : 0);
  static ptrdiff_t const imax = imin + ncoeffs;
  static inline RT get(ptrdiff_t const i) {
    static_assert(ncoeffs == sizeof coeffs_t::coeffs / sizeof *coeffs_t::coeffs,
                  "coefficient array has wrong size");
    static_assert(di == 0 or di == 1, "di must be 0 or 1");
#ifdef CCTK_DEBUG
    assert(i >= imin and i < imax);
#endif
    ptrdiff_t const j = di == 0 ? i - imin : ncoeffs - 1 - (i - imin);
#ifdef CCTK_DEBUG
    assert(j >= 0 and j < ncoeffs);
#endif
    return coeffs_t::coeffs[j];
  }
  // Test coefficients
  static void test() {
    static bool tested = false;
    if (tested)
      return;
    tested = true;
    static_assert(ncoeffs == sizeof coeffs_t::coeffs / sizeof *coeffs_t::coeffs,
                  "coefficient array has wrong size");
    // 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.25) + di * RT(0.5);
      RT const y0 = ipow(x0, n);
      // Allow losing 3 digits:
      CCTK_REAL const eps = RT(1.0e+3) * numeric_limits<RT>::epsilon();
      if (not(std::fabs(res - y0) < eps)) {
        RT rt;
        ostringstream buf;
        buf << "Error in prolongate_3d_cc_rf2::coeffs_3d_cc_rf2\n"
            << "   RT=" << typestring(rt) << "\n"
            << "   ORDER=" << ORDER << "\n"
            << "   di=" << di << "\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 coeffs1dc<RT, 0>::coeffs[] = {+1 / RT(1.0)};            \
                                                                               \
  template <>                                                                  \
  const RT coeffs1dc<RT, 1>::coeffs[] = {+1 / RT(4.0), +3 / RT(4.0)};          \
                                                                               \
  template <>                                                                  \
  const RT coeffs1dc<RT, 2>::coeffs[] = {+5 / RT(32.0), +30 / RT(32.0),        \
                                         -3 / RT(32.0)};                       \
                                                                               \
  template <>                                                                  \
  const RT coeffs1dc<RT, 3>::coeffs[] = {-5 / RT(128.0), +35 / RT(128.0),      \
                                         +105 / RT(128.0), -7 / RT(128.0)};    \
                                                                               \
  template <>                                                                  \
  const RT coeffs1dc<RT, 4>::coeffs[] = {-45 / RT(2048.0), +420 / RT(2048.0),  \
                                         +1890 / RT(2048.0),                   \
                                         -252 / RT(2048.0), +35 / RT(2048.0)}; \
                                                                               \
  template <>                                                                  \
  const RT coeffs1dc<RT, 5>::coeffs[] = {                                      \
      +63 / RT(8192.0),   -495 / RT(8192.0), +2310 / RT(8192.0),               \
      +6930 / RT(8192.0), -693 / RT(8192.0), +77 / RT(8192.0)};
TYPECASE(CCTK_VARIABLE_REAL8, CCTK_REAL8);
#undef TYPECASE
} // namespace coeffs_3d_cc_rf2
using namespace coeffs_3d_cc_rf2;
// 0D "interpolation"
template <typename T, int ORDER>
static inline T 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) {
  static_assert(di == 0 or di == 1, "di must be 0 or 1");
  typedef typename typeprops<T>::real RT;
  typedef coeffs1d<RT, ORDER, di> coeffs;
  T res = typeprops<T>::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) {
  static_assert(dj == 0 or dj == 1, "dj must be 0 or 1");
  typedef typename typeprops<T>::real RT;
  typedef coeffs1d<RT, ORDER, dj> coeffs;
  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) {
  static_assert(dk == 0 or dk == 1, "dk must be 0 or 1");
  typedef typename typeprops<T>::real RT;
  typedef coeffs1d<RT, ORDER, dk> coeffs;
  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) {
#ifdef CCTK_DEBUG
  typedef typename typeprops<T>::real RT;
  typedef coeffs1d<RT, ORDER, di> coeffs;
  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) {
#ifdef CCTK_DEBUG
  typedef typename typeprops<T>::real RT;
  typedef coeffs1d<RT, ORDER, dj> coeffs;
  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) {
#ifdef CCTK_DEBUG
  typedef typename typeprops<T>::real RT;
  typedef coeffs1d<RT, ORDER, dk> coeffs;
  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_cc_rf2(
    T *restrict const dst, int const *restrict flo,
    int const *restrict fhi,                            // dstpadext,
    int const *restrict fblo, int const *restrict fbhi, // dstext,
    /*int const ncomp, int const ratioX, int const ratioY, int const ratioZ,*/
    T const *restrict const src, int const *restrict clo,
    int const *restrict chi) {
  static_assert(ORDER >= 0, "ORDER must be non-negative");
  typedef typename typeprops<T>::real RT;
  coeffs1d<RT, ORDER, 0>::test();
  coeffs1d<RT, ORDER, 1>::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(dstbbox.stride() % 2 != 0)) {
  //  CCTK_WARN(0, "Internal error: destination strides are not even");
  //}
  // 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");
  //}
  int const regext[3] = {fbhi[0] - fblo[0] + 1, fbhi[1] - fblo[1] + 1,
                         fbhi[2] - fblo[2] + 1};
  // assert(all((regbbox.lower() - srcbbox.lower() + regbbox.stride() / 2) %
  //               regbbox.stride() ==
  //           0));
  int const srcoff[3] = {(2 * fblo[0] - 1 - 4 * clo[0] + 1) / 2,
                         (2 * fblo[1] - 1 - 4 * clo[1] + 1) / 2,
                         (2 * fblo[2] - 1 - 4 * clo[2] + 1) / 2};
  //    (regbbox.lower() - srcbbox.lower() + regbbox.stride() / 2) /
  //    regbbox.stride();
  // assert(all((regbbox.lower() - dstbbox.lower()) % regbbox.stride() == 0));
  int const dstoff[3] = {fblo[0] - flo[0], fblo[1] - flo[1], fblo[2] - flo[2]};
  // Determine the stencil radius (see diagram at the top of this
  // file)
  // ivect3 offsetlo, offsethi;
  //{
  //  assert(all((regbbox.upper() - srcbbox.lower() + regbbox.stride() / 2) %
  //                 regbbox.stride() ==
  //             0));
  //  ivect3 const srcend =
  //      (regbbox.upper() - srcbbox.lower() + regbbox.stride() / 2) /
  //      regbbox.stride();
  //  ivect const needoffsetlo = srcoff % 2;
  //  ivect const needoffsethi = srcend % 2;
  //  for (int d = 0; d < 3; ++d) {
  //    if (not needoffsetlo[d]) {
  //      offsetlo[d] = -coeffs1d<RT, ORDER, 0>::imin;
  //    } else {
  //      offsetlo[d] = -coeffs1d<RT, ORDER, 1>::imin;
  //    }
  //    if (not needoffsethi[d]) {
  //      offsethi[d] = coeffs1d<RT, ORDER, 0>::imax - 1;
  //    } else {
  //      offsethi[d] = coeffs1d<RT, ORDER, 1>::imax - 1;
  //    }
  //  }
  //}
  // 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 = chi[0] - clo[0] + 1; // srcpadext[0];
  size_t const srcjpadext = chi[1] - clo[1] + 1; // srcpadext[1];
  size_t const srckpadext = chi[2] - clo[2] + 1; // srcpadext[2];
  size_t const dstipadext = fhi[0] - flo[0] + 1; // dstpadext[0];
  size_t const dstjpadext = fhi[1] - flo[1] + 1; // dstpadext[1];
  size_t const dstkpadext = fhi[2] - flo[2] + 1; // dstpadext[2];
  size_t const srciext = chi[0] - clo[0] + 1; // rcext[0];
  size_t const srcjext = chi[1] - clo[1] + 1; // rcext[1];
  size_t const srckext = chi[2] - clo[2] + 1; // rcext[2];
  size_t const dstiext = fhi[0] - flo[0] + 1; // stext[0];
  size_t const dstjext = fhi[1] - flo[1] + 1; // stext[1];
  size_t const dstkext = fhi[2] - flo[2] + 1; // stext[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 = SRCIND3(1,0,0) - SRCIND3(0,0,0);
  size_t const srcdi = 1;
  assert(srcdi == (srciext > 1 ? SRCIND3(1, 0, 0) - SRCIND3(0, 0, 0) : 1));
  size_t const srcdj = srcjext > 1 ? SRCIND3(0, 1, 0) - SRCIND3(0, 0, 0) : 0;
  size_t const srcdk = srckext > 1 ? SRCIND3(0, 0, 1) - SRCIND3(0, 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:;
}
} // namespace CarpetLib
namespace amrex {
template <int ORDER> Prolongate3D_CC_RF2<ORDER>::~Prolongate3D_CC_RF2() {}
template <int ORDER>
Box Prolongate3D_CC_RF2<ORDER>::CoarseBox(const Box &fine, int ratio) {
  assert(ORDER % 2 == 0);
  Box b = amrex::coarsen(fine, ratio);
  b.grow(ORDER / 2 + 1);
  return b;
}
template <int ORDER>
Box Prolongate3D_CC_RF2<ORDER>::CoarseBox(const Box &fine,
                                          const IntVect &ratio) {
  assert(ORDER % 2 == 0);
  Box b = amrex::coarsen(fine, ratio);
  b.grow(ORDER / 2 + 1);
  return b;
}
template <int ORDER>
void Prolongate3D_CC_RF2<ORDER>::interp(
    const FArrayBox &crse, int crse_comp, FArrayBox &fine, int fine_comp,
    int ncomp, const Box &fine_region, const IntVect &ratio,
    const Geometry &crse_geom, const Geometry &fine_geom,
    Vector<BCRec> const &bcr, int actual_comp, int actual_state,
    RunOn gpu_or_cpu) {
  assert(bcr.size() >= ncomp);
  //
  // Make box which is intersection of fine_region and domain of fine.
  //
  Box target_fine_region = fine_region & fine.box();
  // Box crse_bx(amrex::coarsen(target_fine_region,ratio));
  //
  // Get coarse and fine edge-centered volume coordinates.
  //
  // TODO: do not use AMREX macro
  /*
  Vector<CCTK_REAL> fvc[AMREX_SPACEDIM];
  Vector<CCTK_REAL> cvc[AMREX_SPACEDIM];
  for (int dir = 0; dir < AMREX_SPACEDIM; dir++)
  {
      fine_geom.GetEdgeVolCoord(fvc[dir],target_fine_region,dir);
      crse_geom.GetEdgeVolCoord(cvc[dir],crse_bx,dir);
  }
  */
  for (int var = 0; var < ncomp; ++var) {
    CCTK_REAL *fdat = fine.dataPtr(fine_comp + var);
    const CCTK_REAL *cdat = crse.dataPtr(crse_comp + var);
    const int *flo = fine.loVect();
    const int *fhi = fine.hiVect();
    const int *fblo = target_fine_region.loVect();
    const int *fbhi = target_fine_region.hiVect();
    const int *clo = crse.loVect();
    const int *chi = crse.hiVect();
    // const int* cblo   = crse_bx.loVect();
    // const int* cbhi   = crse_bx.hiVect();
    // Vector<int> bc     = GetBCArray(bcr);
    // const int* ratioV = ratio.getVect();
    CarpetLib::prolongate_3d_cc_rf2<CCTK_REAL, ORDER>(fdat,flo,fhi,
                     fblo, fbhi,
                     /*ncomp,ratioV[0],ratioV[1],ratioV[2],*/
                     cdat,clo,chi//,
                     //cblo, cbhi,
                     /*fslo,fshi,
                     bc.dataPtr(), 
                     fvc[0].dataPtr(),fvc[1].dataPtr(),fvc[2].dataPtr(),
                     cvc[0].dataPtr(),cvc[1].dataPtr(),cvc[2].dataPtr(),
                     actual_comp,actual_state*/);
  }
}
Prolongate3D_CC_RF2<4> prolongate3d_cc_rf2_o4;
} // namespace amrex
} // namespace

File deletion: prolongate_3d_cc_rf2.hxx

BF:BFD[5.15096] → [10.23186:23212]

BF:BFD[10.23212] → [10.23213:23213]

B:BD[10.23213] → [10.23214:25283]

#ifndef CARPET_PROLONGATE_3D_CC_RF2_H_
#define CARPET_PROLONGATE_3D_CC_RF2_H_
#include <AMReX_Geometry.H>
#include <AMReX_FArrayBox.H>
#include <AMReX_Interpolater.H>
/**
* \brief Vertex centered sampling interpolation.
*
* Vertex centered interpolation copied from CarpetLib.
*/
namespace amrex {
template <int ORDER>
class Prolongate3D_CC_RF2
    :
    public Interpolater
{
public:
    /**
    * \brief The destructor.
    */
    virtual ~Prolongate3D_CC_RF2 () override;
    /**
    * \brief Returns coarsened box given fine box and refinement ratio.
    *
    * \param fine
    * \param ratio
    */
    virtual Box CoarseBox (const Box& fine,
                           int        ratio) override;
    /**
    * \brief Returns coarsened box given fine box and refinement ratio.
    *
    * \param fine
    * \param ratio
    */
    virtual Box CoarseBox (const Box&     fine,
                           const IntVect& ratio) override;
    /**
    * \brief Coarse to fine interpolation in space.
    *
    * \param crse
    * \param crse_comp
    * \param fine
    * \param fine_comp
    * \param ncomp
    * \param fine_region
    * \param ratio
    * \param crse_geom
    * \param fine_geom
    * \param bcr
    * \param actual_comp
    * \param actual_state
    */
    virtual void interp (const FArrayBox& crse,
                         int              crse_comp,
                         FArrayBox&       fine,
                         int              fine_comp,
                         int              ncomp,
                         const Box&       fine_region,
                         const IntVect&   ratio,
                         const Geometry&  crse_geom,
                         const Geometry&  fine_geom,
                         Vector<BCRec> const& bcr,
                         int              actual_comp,
                         int              actual_state,
                         RunOn            gpu_or_cpu) override;
};
extern Prolongate3D_CC_RF2<4> prolongate3d_cc_rf2_o4;
}
#endif // CARPET_PROLONGATE_3D_CC_RF2_H_

Deletion in AMReX/src/make.code.defn at line 8 [5.15114]
B:BD[4.1026] → [4.1026:1055]
```
	prolongate_3d_cc_rf2.cxx		\
```
Deletion in AMReX/src/make.code.defn at line 9 [5.15114]
B:BD[4.1082] → [4.1082:1111]
```
	prolongate_3d_vc_rf2.cxx		\
```