| Commit message (Collapse) | Author | Age |
|
|
|
|
|
|
| |
Set the number of OpenMP threads via an external function call instead
of via a CarpetLib parameter.
darcs-hash:20080114150439-dae7b-a6a6a629162ca195411852823e1ece0a2071d771.gz
|
|
|
|
| |
darcs-hash:20080114075419-dae7b-b59ccf120d369c4ea8715f856a68e63a0c396f63.gz
|
|
|
|
| |
darcs-hash:20071102224528-dae7b-b8ecec8895cd86f40ed667db5db2c4b79ba8b237.gz
|
|
|
|
|
|
| |
Enforce memory limit by calling setrlimit for RLIMIT_AS.
darcs-hash:20070928154922-dae7b-2b3436bfe35452de19b9765279c1bb81997f9497.gz
|
|
|
|
| |
darcs-hash:20070928155050-dae7b-dd2712aec2215d4e79fedac8a1205a4791900d98.gz
|
|
|
|
| |
darcs-hash:20070928155039-dae7b-dfa70c6762076f80954554560ebbd6cd7fbb6495.gz
|
|
|
|
| |
darcs-hash:20070921152348-dae7b-8a3a55574196b28f86afba561d064c89c386c955.gz
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Use CCTK_WARN instead of assert to report errors in the grid
hierarchy.
Continue the consistency checks even if errors are found, so that
multiple errors can be diagnosed at the same time.
Output the grid hierarchy even when it is not consistent, so that
errors can be diagnosed without core dumps.
darcs-hash:20070905000356-dae7b-4f55bff9af10e0a53f4bb1b3702a6f169dda35c2.gz
|
|
|
|
|
|
| |
Use CCTK_WARN instead of assert to test bbox sizes for integer overflow.
darcs-hash:20070905000256-dae7b-6eaab530356ba3dcb1909b75840743bf39f5b20f.gz
|
|
|
|
|
|
|
|
|
|
|
| |
Add #pragma omp statements for loops in reduction and prolongation
operators. Change loop control variables to signed types.
Add functions to determine the number of active threads.
Add a parameter to set the number of threads if desired.
darcs-hash:20070821185237-dae7b-56827b72a69b5fa1b3d1316379a0f155696b4cb2.gz
|
|
|
|
| |
darcs-hash:20070809203347-dae7b-af9e0bcb5bb419bf309d8eef12ed5cc52a9ba2a9.gz
|
|
|
|
|
|
|
|
|
|
| |
Sync 1-tl and prolongation=none GFs
Fix a little bug that prevented the synchronization of
GFs that have only 1 timelevel or have prolongation
turned off explicitely (tag 'prolongation=none').
darcs-hash:20070720053350-fff0f-dd8b80ecbb76ff7f3347ce3a906e537f7e0fd128.gz
|
|
|
|
| |
darcs-hash:20070703100059-dae7b-144bb38c56bea2402ff2708d863148b0ca8cadcb.gz
|
|
|
|
| |
darcs-hash:20070613215011-dae7b-2a0f7fecdc2a95a4f79f2384e73c2acdb35e630d.gz
|
|
|
|
| |
darcs-hash:20070601132426-dae7b-eccfbfc01ba3b102ff0b889b927ffb8f4d026797.gz
|
|
|
|
|
|
|
|
|
| |
Some systems have a function mallinfo which reports malloc statistics.
Output this statistics together with Carpet's statistics. This
reports how much memory the process has allocated in total, and how
much of that memory is unused.
darcs-hash:20070526200455-dae7b-6ad24ac03d382090658f3c165835b795d9f302f1.gz
|
|
|
|
|
|
|
|
|
|
|
| |
A mempool (memory pool) is a large chunk of memory. You can allocate
pieces of it. In order to simplify things there is no way to free a
piece again. If the mempool is destroyed, then all its memory is
freed. This is dangerous: you have to make sure that no one continues
to use that memory afterwards. Using a memory pool for short-lived
objects can reduce memory fragmentation.
darcs-hash:20070526195001-dae7b-b419df094d19b85dbf145debdf62da2dc57823af.gz
|
|
|
|
|
|
|
| |
Add a member gdata::allocsize which calculates the amount of memory
that a data object requires.
darcs-hash:20070526170719-dae7b-622c8d34ced2a5066fbaaf56e9d9b39efeea9022.gz
|
|
|
|
| |
darcs-hash:20070513034420-dae7b-7261b7a902bf7ac39a2c73bd6d762e67e37c9110.gz
|
|
|
|
|
|
| |
Use the correct time when interpolating while regridding.
darcs-hash:20070513034335-dae7b-df3960395af6cd7a8fb75ceb7bb6b6513933bcf2.gz
|
|
|
|
|
|
|
|
| |
Do not require that regridding fills all grid points if the previous
grid hierarchy is completely empty, i.e, if this is the first
regridding.
darcs-hash:20070513034129-dae7b-7c838458c107d6873665eeb3e92d2a4c72565f30.gz
|
|
|
|
|
|
|
| |
Correct a logic error that left newly created refinement levels
uninitialised.
darcs-hash:20070511202803-dae7b-29c68c95feced54dc9d9ac8e027c241bec82e0ee.gz
|
|
|
|
| |
darcs-hash:20070510222457-dae7b-63f0ce31174188709611001c19feb58f3c516862.gz
|
|
|
|
|
|
|
| |
g++ complains about function parameters which aren't used. Such warnings can be
prevented simply by not naming the parameters.
darcs-hash:20070502142321-3fd61-2df310c771be0a6177c7f56d6603e6f571209dea.gz
|
|
|
|
| |
darcs-hash:20070421031755-dae7b-5c3b1adbca478900cae6e98ec7ea792ee7ec976d.gz
|
|
|
|
| |
darcs-hash:20070419024245-dae7b-862947817fa17453aa9996920c3012ff9eda7c20.gz
|
|
|
|
| |
darcs-hash:20070419015013-dae7b-cd2f28ae5fcd8a3cdcb2822eb0c18d0ffe78bc5f.gz
|
|
|
|
| |
darcs-hash:20070419014930-dae7b-3584da98807f38935aa636d7608c1baf3fa51336.gz
|
|
|
|
|
|
| |
Update to use new communication mechanism.
darcs-hash:20070419014851-dae7b-313adb8952e62048a096bba95023c99be48e9658.gz
|
|
|
|
| |
darcs-hash:20070419014743-dae7b-70ae43d6e48270f7149e3f3c3e5b95e5101c0e3b.gz
|
|
|
|
|
|
|
|
|
| |
Define vect<T,D> functions with macros.
Define many vect<T,D> functions also for vect<vect<T,D>,E> and for
combinations with scalars.
darcs-hash:20070419014657-dae7b-b3c62cc55963872a39cd48439c2057918578eda3.gz
|
|
|
|
| |
darcs-hash:20070419014612-dae7b-c3e9a81413ed738a23ac14956fbb48750190a9fd.gz
|
|
|
|
|
|
|
|
|
| |
Redesign storing and calculating the communication schedule in dh
class.
Remove bases from dh class; bases are now stored in gh class.
darcs-hash:20070419014553-dae7b-254c932eac39cf73e538dbfcf5a07470639e6f2c.gz
|
|
|
|
|
|
|
|
| |
Store boundary widths in gh class.
Do not calculate base extents, have them passed in instead.
darcs-hash:20070419014532-dae7b-26e78ee0f9e196337a32df895e9bf54b30db21df.gz
|
|
|
|
|
|
|
|
|
| |
Remove outdated communication mechanisms from data<T> and gdata
classes.
Redesign communication mechanism in data<T> and gdata classes.
darcs-hash:20070419014301-dae7b-ece41543dcb1e23ab81f103b04a75880ac68807f.gz
|
|
|
|
|
|
|
|
|
| |
Always use collective communication buffers in commstate class.
Add functions to reserve space in a commbuf, to get a pointer into the
space, and to commit space. This encapsulates using commbufs.
darcs-hash:20070419013946-dae7b-fce3d05b5e90fb37588939d1b11dce6d48ea2ead.gz
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
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
|