| Commit message (Collapse) | Author | Age |
... | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Introduce a special type bbox<T,D>::size_type for the return value of
bbox<T,D>::size(), because the size can easily exceed an int.
Remove ordering from bbox<T,D>. This frees the comparison operators.
Add bbox<T,D> comparison operators to check containment.
Correct error in reading extended bbox information from streams.
Introduce function bbox<T,D>::bounds(), which returns both lower and
upper boundary together.
Add bboxset<T,D> constructors which accept lists and vectors of
bboxes.
Add bboxset<T,D> comparison operators to check containment. Add also
operators to compare bboxsets and single bboxes.
darcs-hash:20070419013547-dae7b-db59f84533e1fe5759a1fb3511f8860571a94c77.gz
|
|
|
|
| |
darcs-hash:20070419013528-dae7b-09f603af91ed987e74f3cb67d417b9745e4070b6.gz
|
|
|
|
| |
darcs-hash:20070319225457-dae7b-05ea19292cd557ac86ea79f2263ecc951ec3c1aa.gz
|
|
|
|
| |
darcs-hash:20070319225404-dae7b-ee7e374b0595d873b5e82b5b7ae457abb6a1a2a5.gz
|
|
|
|
| |
darcs-hash:20070319225327-dae7b-e189114bdb1e915732540fc55d5b2e1e6de0eae5.gz
|
|
|
|
| |
darcs-hash:20070319225244-dae7b-e371c54bfc8ca1126e4060b0cb5697f74a779766.gz
|
|
|
|
|
|
| |
Correct an error in calculating the boundary prolongation bboxes.
darcs-hash:20070319224958-dae7b-a3c5097cc52085c4eacd34dea05b05b85d1a097c.gz
|
|
|
|
|
|
|
| |
Some registers were not marked as clobbered, leading to segmentation
faults.
darcs-hash:20070319150856-dae7b-3294036545456c399bd79bca5f12c806d45172cb.gz
|
|
|
|
|
|
| |
Correct an error in the way the restriction bboxes were calculated.
darcs-hash:20070317160521-dae7b-35b39c6c2034eb6ee235c95ffb08137067ae3a51.gz
|
|
|
|
|
|
|
| |
Output bboxes in class dh before checking them, so that the wrong
bboxes are printed before the programme is aborted.
darcs-hash:20070317160423-dae7b-7ee774f4e46610b73e9f3b06f71dbd778910b37d.gz
|
|
|
|
|
|
| |
Do not copy the grid hierarchy, swap it instead.
darcs-hash:20070312161422-dae7b-df574c2583c94cd81361d6a523c4e678b136f349.gz
|
|
|
|
|
|
|
| |
Regridding when the previous grid hierarchy had fewer levels was not
handled correctly.
darcs-hash:20070312161246-dae7b-f9bdb2990fcbd1bc9f245aaef35398b1a25b60d3.gz
|
|
|
|
|
|
|
|
|
|
|
| |
Remove some parameters which are not necessary:
CarpetLib::print_timestats
CarpetLib::timestat_disable
Allow the value -1 as well as 0 to disable output for timers and
memory statistics.
darcs-hash:20070312160854-dae7b-6c60bf0c64a5cac03da97595bb30bb2b47568165.gz
|
|
|
|
|
|
|
|
|
|
|
|
| |
Calculate the communication schedule for recomposing in advance. This
is the schedule which decides which parts of the old grid hierarchy
are used to fill what parts of the new grid hierarchy. Previously,
this schedule was calculate for every grid function anew.
Omit synchronisation and boundary prolongation after recomposing.
This must now happen by scheduled routines in the postregrid bin.
darcs-hash:20070307231156-dae7b-a9fc9a40a88dc7c5b459de8118fc3d4b6c66ffac.gz
|
|
|
|
|
|
|
| |
Do not assume that a region's owned grid points are disjoint from its
boundary.
darcs-hash:20070306190322-dae7b-57357dcc1bb915b19d9d945eb82d553e88468e14.gz
|
|
|
|
| |
darcs-hash:20070306011837-dae7b-600bdffcf60d6dff9386180543c3dc7ecf9f4028.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
|
|
|
|
|
|
|
|
|
| |
When outputting bboxes, also output their size after dividing by the
stride, and output the number of contained grid points.
Update the bbox reader to ignore this information.
darcs-hash:20070304211114-dae7b-be8be8a5bfdc15edc3ca7e327ba95fa1ce791bed.gz
|
|
|
|
|
|
|
|
|
|
|
| |
Reduce the number of bbox operations while setting up the
communication schedule. Cache some results. Introduce timers
throughout.
Introduce a parameter CarpetLib::check_bboxes, defaulting to "yes",
which can be used to disable the self-checks.
darcs-hash:20070304210744-dae7b-1a2756dc0aa2f30b2f1311a9475c2a35513f2cfc.gz
|
|
|
|
| |
darcs-hash:20070228022758-dae7b-331a83039930f08faff78ab5f732ebd036c1afbb.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
|
|
|
|
|
|
|
| |
Make the template functions min3 and max3 not static to keep the AIX
C++ compiler happy.
darcs-hash:20070223200627-dae7b-d31ff7e7e0741ce3c592b60350deccb3b4f7f9ab.gz
|
|
|
|
| |
darcs-hash:20070222183639-dae7b-4da8856a98e31c7509034f4c623a2f34cd1c7ab8.gz
|
|
|
|
| |
darcs-hash:20070222183614-dae7b-7370334050f2f04e45b53693b252a51a2457a150.gz
|
|
|
|
| |
darcs-hash:20070222183531-dae7b-25786a2e298ad3426ace21e3b428506b68f7e43a.gz
|
|
|
|
| |
darcs-hash:20070219202316-dae7b-441bdad39e75963a86bedbcaea54bbf7ced0f8a7.gz
|
|
|
|
|
|
| |
Instantiate data<T>::operator<< for all T, not only for CCTK_REAL.
darcs-hash:20070214172622-dae7b-c920d63bc92cc6d6a102f3b20a38317c7b642f92.gz
|
|
|
|
|
|
|
| |
Use #include "instantiate" to instantiate the transport operators.
This allows e.g. switching off support for complex numbers.
darcs-hash:20070214172513-dae7b-aef2b83617158679c80ac350c2837f519928ddda.gz
|
|
|
|
| |
darcs-hash:20070209053449-dae7b-3a9c6b25f4c8001110d7040f481f6d981d5ce95c.gz
|
|
|
|
| |
darcs-hash:20070209052313-dae7b-6af38a5ffdd16b5a8fa529533baac8c9f9e7074f.gz
|
|
|
|
| |
darcs-hash:20070207044227-dae7b-0d81f6729bfdc85b8541c6690eaedef7a5f24212.gz
|
|
|
|
| |
darcs-hash:20070204212619-dae7b-f68201db57954ecac2ed7d77dcac9c43f267af64.gz
|
|
|
|
| |
darcs-hash:20070204192255-dae7b-6088220061f07d64a163966855064f5311c1a028.gz
|
|
|
|
| |
darcs-hash:20070204192032-dae7b-10c06e6529291abe5a3dda8ae1d0022a23837ac3.gz
|
|
|
|
| |
darcs-hash:20070204191934-dae7b-8428cc85656d5eb92580f82165ef134c72fc98c9.gz
|
|
|
|
| |
darcs-hash:20070204191733-dae7b-52b09558844a134371169ab0530c3df5b030b739.gz
|
|
|
|
| |
darcs-hash:20070204191635-dae7b-3ff04866f9ba7ebe272bfd61ec8900d013420432.gz
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
A pseudoregion is almost a region; it is a bbox that lives on a
certain processor. Pseudoregions are a compact way to store
information about what processors needs to send data to what other
processor during synchronisation or regridding.
Introduce a class pseudoregion. Add additional pseudoregion fields to
the dh class. Use these fields when communicating; this is faster
than walking the original data structures.
darcs-hash:20070204184339-dae7b-3bd90a48b77cf0623e3df3a7ca4edd9d5c7053f8.gz
|
|
|
|
|
|
| |
Remove code that was commented out.
darcs-hash:20070204181108-dae7b-b732d25bb1ab5e2ffcb3baa916f3bb97c2b5cfb6.gz
|
|
|
|
|
|
|
| |
Rename ggf::recompose_free to ggf::recompose_free_old.
Remove code that was commented out.
darcs-hash:20070204180937-dae7b-0c0c9f5b5007d416ec16da8a6781950a4f1406e5.gz
|
|
|
|
|
|
|
| |
Add a field "void * _storage" to the gdata class to speed up its
storage() member function.
darcs-hash:20070204175843-dae7b-644ade82e1432b82384baf64f55aeb2482032fdf.gz
|
|
|
|
|
|
|
|
|
|
|
|
| |
Remove unused, #ifdef'ed out code from the operators. Since the
operators use now the bbox class, this checking is already performed
there.
Remove unused debugging code in the cell-centered operators.
Use the restrict qualifier in the prototypes.
darcs-hash:20070204174027-dae7b-743583b30d52646219411c98ad99486d10445e52.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
|
|
|
|
|
|
|
|
|
|
|
|
| |
Implement a second timer based on Intel's rdtsc instruction, which is
much faster and much more accurate than MPI_Wtime.
Place the timer classes into the CarpetLib namespace.
Create a TimerSet class. Make the Timer class automatically register
all timers with a singleton object, removing all global variables.
darcs-hash:20070203211128-dae7b-42765e79446eda6a2337ba22cd390869055c555a.gz
|
|
|
|
| |
darcs-hash:20070203204005-dae7b-dc38364001baecd4b7073e6dc92077cf1f756b70.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
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Use std::list instead of std::set to store the bboxes internally.
Define some functions as inline.
Perform some checking only when NDEBUG is not defined.
Optimise the algorithms for normalising bboxsets and for calculating
the set difference.
darcs-hash:20070203172717-dae7b-1e77f0a810f786913cd2a1aaed1ea1a5fde604cf.gz
|
|
|
|
| |
darcs-hash:20070115175330-dae7b-ae3dd3c47931ad57b3a5cca9429b3f223c9e834c.gz
|