| Commit message (Collapse) | Author | Age |
|
|
|
|
| |
some routines assume that elements in gfs are sorted by variable index
when traversing the container (eg recompose_allocate does)
|
|
|
|
|
| |
Provide "forall" based on Boost's FOREACH.
Provide shared_ptr based on Boost's shared_ptr.
|
|
|
|
| |
Change from CARPET_NO_BBOXSET2 and CARPET_BBOXSET2 to CARPET_ENABLE_BBOXSET2 (build it) and CARPET_USE_BBOXSET2 (use it).
|
|
|
|
|
|
|
|
|
|
| |
Rename bboxset to bboxset1.
Implement new class bboxset2, which uses a different internal datastructure than bboxset1.
Make bboxset a typedef for either bboxset1 (default) or bboxset2, as selected by the compile-time macro CARPET_BBOXSET2.
Disable all bboxset2 code if CARPET_NO_BBOXSET2 is given, since bboxset2 uses newer C++ constructs not available on some older compilers.
|
|
|
|
|
| |
Remove CarpetLib's "equals" method.
Implement equal_to, less, greater, greater_equal, less_equal, not_equal for vect and bbox classes.
|
|
|
|
| |
Standard integer division truncates, which can lead to problems if an intermediat result is negative.
|
| |
|
|
|
|
| |
This should now be done by the flesh, using autoconf.
|
|
|
|
| |
This is done by cctk.h automatically.
|
|
|
|
|
| |
Obtain cache information from thorn hwloc.
Align allocated memory manually if operator new returns unaligned memory.
|
|
|
|
| |
Remove Carpet's mechanisms to deal with how to call isnan. Instead, expect isnan in std::, and rely on Cactus to correct things if this is not the case.
|
| |
|
|
|
|
|
| |
Remove definitions for memoryof(T*) sinfc there is already
memoryof(T const*). xlC does not like having both.
|
|
|
|
|
|
| |
Rename buffer2 zones to overlap zones.
Complete implementing overlap zones in the dh class.
|
| |
|
| |
|
|
|
|
|
| |
Capture the system's nan functions into the namespace CarpetLib::good,
then offer #defines to access these.
|
| |
|
|
|
|
|
| |
Find the system's implementations of isnan etc., and provide them in
the CarpetLib::good namespace.
|
| |
|
|
|
|
| |
Ignore-this: 61f2463f98afdefa755881082782b627
|
|
|
|
| |
Ignore-this: 309b4dd613f4af2b84aa5d6743fdb6b3
|
|
|
|
|
|
| |
The new macro check(expr) evaluates the expression expr, and then asserts
that it is true. If assertions are disabled the expression is still
evaluated.
|
|
|
|
| |
Remove include file defines.hh in Carpet.
|
|
|
|
|
|
|
|
|
| |
Introduce a tree data structure "fulltree", which decomposes a single,
rectangular region into a tree of non-overlapping, rectangular sub-regions.
Move the processor decomposition from the regridding thorns into Carpet.
Create such trees during processor decomposition.
Store these trees with the grid hierarchy.
|
|
|
|
|
|
|
| |
Add an overloaded function memoryof which measures the size in bytes
of CarpetLib's data structures.
darcs-hash:20080202154302-dae7b-de41c79cb04617327695fae27928c05c5d431ee8.gz
|
|
|
|
| |
darcs-hash:20070419014930-dae7b-3584da98807f38935aa636d7608c1baf3fa51336.gz
|
|
|
|
|
|
|
|
|
| |
Use CARPET_DEBUG and CARPET_OPTIMISE (instead of NDEBUG) to decide
whether to perform or omit somewhat expensive self checks. When
CARPET_DEBUG is defined, even expensive checks are performed. When
CARPET_OPTIMISE is defined, even cheap checks are omitted.
darcs-hash:20070304211311-dae7b-ae917b0f40496fedf4bb5d1c2a70ad31a5167ca3.gz
|
|
|
|
|
|
|
| |
Change static_assert to have a second arguments, which is supposed to
be a string containing a description of the test.
darcs-hash:20070228022658-dae7b-3fb68ea0e0f557f2268cb95546ba0d70c58cda7a.gz
|
|
|
|
|
|
|
|
|
| |
Add namespace CarpetLib::good containing overloaded abs functions for
all Cactus datatypes. Some C++ compilers do not have long long
support for abs, i.e., either std::abs or llabs does not exist. This
circumvents this problem.
darcs-hash:20070228022422-dae7b-a4cafbbad3f8b9cf9ae56edcc2f30c72c0d8de05.gz
|
|
|
|
| |
darcs-hash:20070204191635-dae7b-3ff04866f9ba7ebe272bfd61ec8900d013420432.gz
|
|
|
|
|
|
|
|
|
| |
CarpetLib contained special code that used std::complex instead of
Cactus's CCTK_COMPLEX for complex variables. A very similar feature
is now supposed to go into the flesh, and hence this (unused) code is
being removed.
darcs-hash:20070204172854-dae7b-af7b7aca42988195846220dd7f45827549f5caf9.gz
|
|
|
|
|
|
|
|
| |
Define a macro AT() to index into std::vector. Depending on the macro
NDEBUG, AT() is defined either as at(), providing index checking, or
as operator[], providing no checking.
darcs-hash:20070203205854-dae7b-a1999c88c95ba12b1ee66505f712aefdd67d7e6f.gz
|
|
|
|
|
|
|
| |
Define a constant eol containing a newline character. Unlike endl, it
does not flush the I/O stream.
darcs-hash:20070203185434-dae7b-1f057e593cc45b3d5cf1b067b247b6de071230da.gz
|
|
|
|
| |
darcs-hash:20070115175330-dae7b-ae3dd3c47931ad57b3a5cca9429b3f223c9e834c.gz
|
|
|
|
|
|
|
| |
Add a routine consume() which reads a whole string, not only a single
character.
darcs-hash:20070112210808-dae7b-dc1e0be61cefe8af390d9f598bfdac314dd7aeac.gz
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Reorganise prolongation and restriction operators. This is a major
implementation change.
Most operators are now written as C++ templates instead of as Fortran
77 code. This simplifies the code, since C++ routines can be called
more easily, and they also have access to CarpetLib's high-level data
structures.
Previously, the operators combined temporal and spatial interpolation.
Now, time interpolation and space interpolation are handled
separately. This may be less efficient, but simplifies the code
significantly, since there are now N+M instead of N*M routines, for N
time interpolation and M space interpolation methods.
Remove the minmod prolongation operator, which was previously
disabled.
Add support for cell centering, using a method described by Simon
Hern, and suggested for Carpet by Ian Hawke.
darcs-hash:20070112205812-dae7b-5329795aa698e7bbc3671b1504134885dd830238.gz
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
The new datatype region_t combines an extent (a bbox), an outer
boundary descriptor, a refinement descriptor, and a processor number:
struct region_t {
ibbox extent; // extent
b2vect outer_boundaries; // outer boundaries
b2vect refinement_boundaries; // refinement boundaries
int map; // map to which this
// region belongs
int processor; // processor number
};
These quantities are often used together, and combining them into a
single datatype simplifies the code significantly.
Adapt gh, dh, etc. to use this new datatype.
This is a major API change.
darcs-hash:20070112204130-dae7b-92cad546187b0fe499e8cfc38b2e26614a4f608c.gz
|
|
|
|
| |
darcs-hash:20060613170802-dae7b-9f69116a70acbac95c7b7b4afa4282330b065602.gz
|
|
|
|
| |
darcs-hash:20060413201623-dae7b-da2878c0520c3f35626e7201241037de38000cbc.gz
|
|
|
|
|
|
|
| |
This macro checks the assertion at compile time instead of at run
time.
darcs-hash:20051119203134-dae7b-36ab53fbcd87acbd1ebca930e61db47448f4a979.gz
|
|
|
|
| |
darcs-hash:20050808132424-891bb-e352aafd9745fb66df45212a4a28e3175a7b58f0.gz
|
|
|
|
|
|
|
|
|
|
|
|
| |
These types are
typedef vect<vect<bool,dim>,2> b2vect;
typedef vect<vect<int,dim>,2> i2vect;
They are similar to bbvect and iivect, but have the order reversed.
They are useful if you need one element per face of a grid variable.
darcs-hash:20050808132221-891bb-fa40b6d4fb8e760c7005adf7e526dd0a6597f0ec.gz
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Turn most of the templates in CarpetLib, which used to have the form
template<int D> class XXX
into classes, i.e., into something like
class XXX
by setting D to the new global integer constant dim, which in turn is set to 3.
The templates gf and data, which used to be of the form
template<typename T, int D> class XXX
are now of the form
template<typename T> class XXX
The templates vect, bbox, and bboxset remain templates.
This change simplifies the code somewhat.
darcs-hash:20050101182234-891bb-c3063528841f0d078b12cc506309ea27d8ce730d.gz
|
|
|
|
| |
darcs-hash:20050118180403-776a0-eb91906a7335386c49a03ae70f5caaf20a5441c3.gz
|
|
|
|
| |
darcs-hash:20050101162121-891bb-ac9d070faecc19f91b4b57389d3507bfc6c6e5ee.gz
|
|
|
|
|
|
| |
That is, say e.g. <cmath> instead of <math.h>.
darcs-hash:20041225182902-891bb-2a4502d6a76ed830ab978030fc4e4765b183509f.gz
|
|
|
|
|
|
| |
Replace all CVS header tags with the standard "$Header:$".
darcs-hash:20040918132147-891bb-dea889bdd94a479ec412d14d08e9efca63e5c24d.gz
|
|
|
|
|
|
|
| |
Remove macros STR and FORTRAN_NAME.
Make typestring return Cactus type names instead of C++ type names.
darcs-hash:20040301174308-07bb3-5c39e39ac39e4e9e552e3f61b843988b09efbf98.gz
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Import the recently announced changes:
1. Carpet has now an infrastructure for multiple maps (aka "grid
patches"). Instead of a single grid hierarchy there can now be
several. This is largely untested, because the remainder of Cactus
cannot handle multiple coordinate systems.
2. The order in which the schedule bins are called has changed. As Ian
Hawke pointed out, the previous order during time evolution was
inconsistent. The initial data ordering did not allow for recovering
and was not usable for progressively solving elliptic equations for
initial data.
3. Carpet now supports convergence levels. The convergence level
specifies by how many factors of two the resolution in the parameter
file should be coarsened (or refined, if negative). This should make
convergence tests and test runs much easier. It is, in principle, also
possible to run several convergence levels at once. This has not been
tested because the remainder of Cactus cannot handle multiple
resolutions. This will be necessary for a multigrid solver, and also
for having a shadow hierarchy to determine where to refine adaptively.
4. Carpet works together with the new CoordBase domain specification
parameters. Without these, using convergence levels will lead to very
strange results.
5. The "modes" have changed. There are now:
meta mode: the whole simulation
global mode: one convergence level
level mode: one refinement level
singlemap mode: one map on one refinement level
local mode: as previously
The whole mode handling has been cleaned up.
6. The regridding thorn has been cleaned up.
7. The kind of prolongation stencil is now determined in Carpet, i.e. at
a fairly hight level, instead of in CarpetLib.
8. The low-order prolongation operators have been made much more
efficient (as have previously the higher-order ones).
9. Assorted smaller changes.
For Carpet users, there should be no major incompatibilities. The major
improvements are 3 and 4 combined. Here is an example:
CoordBase::domainsize = extent
CoordBase::spacing = gridspacing
CoordBase::zero_origin_x = yes
CoordBase::zero_origin_y = yes
CoordBase::zero_origin_z = yes
CoordBase::xextent = 20.0
CoordBase::yextent = 20.0
CoordBase::zextent = 20.0
CoordBase::dx = 1.0
CoordBase::dy = 1.0
CoordBase::dz = 1.0
CoordBase::boundary_shiftout_x_lower = 1
CoordBase::boundary_shiftout_y_lower = 1
CoordBase::boundary_shiftout_z_lower = 1
Carpet::domain_from_coordbase = yes
Carpet::convergence_level = 0
grid::type = coordbase
grid::domain = octant
grid::avoid_origin = no
This gives you a grid that extends from the origin ("zero_origin") up to
20.0 with a grid spacing of 1.0. Symmetry zones and boundary zones are
added automatically. The "shiftout" says that there is no boundary
point on the origin. The staggering parameters (not shown) default to
"no". In order to change the resolution, only the convergence level
has to be adjusted. Note that the old way of specifying the domain
extent still works.
For Carpet developers, one major change is the new mode handling. As
described in 5, the looping macros (that loop over all refinement
levels, or all components) have changed.
darcs-hash:20040125135727-07bb3-51c9647c1b5080e7e180b52a1b81fa155cfd19e9.gz
|