Hold state where both the targets and sources are tree walked. More...
#include <State.h>
Public Attributes | |
CheckList * | chklists |
UndecidedLists | undlists |
CkVec< CkVec< OffsetNode > > | clists |
Lists of cells to be computed. One list for each level. | |
CkVec< CkVec< LocalPartInfo > > | lplists |
Lists of local particles to be computed. One list for each level. | |
CkVec< CkVec< RemotePartInfo > > | rplists |
Lists of remote particles to be computed. One list for each level. | |
bool * | placedRoots |
bool | resume |
GenericTreeNode * | lowestNode |
int | level |
![]() | |
int | bWalkDonePending |
int | currentBucket |
The bucket we have started to walk. | |
int | myNumParticlesPending |
Keep track of how many buckets are unfinished. XXX note the misnomer. | |
int | numPendingChunks |
Number of pending chunks. More... | |
int * | counterArrays [2] |
counters to keep track of outstanding remote processor | |
Hold state where both the targets and sources are tree walked.
CheckList* DoubleWalkState::chklists |
Lists of cells to be checked for the opening criterion. One list for each level in the tree.
GenericTreeNode* DoubleWalkState::lowestNode |
The lowest nodes reached on paths to each bucket Used to find numBuckets completed when walk returns. Also used to find at which bucket computation should start, and which level of cell lists should be used.
bool* DoubleWalkState::placedRoots |
set once before the first TreePiece::calculateGravityRemote() is called for a chunk the idea is to place the chunkRoot (along with replicas) on the remote compute chklist only once per chunk
one for each chunk
UndecidedLists DoubleWalkState::undlists |
Lists of cells which need to go to the next local level before deciding if to open them.