pNbody/src/streelib6fbb9ed07f94master
streelib
Readme
plus de topnodes plus de pseudo particles pas d'unequal softenning pas de periodic box pas de gravite adaptatif
treelib.c : on essaye d'ajouter le nombre de particules permises par noeuds
see end of the file...
but : avoir un tree minimal
domain_Decomposition
domain_findExtent ok domain_determineTopTree self->TopNodes[0] domain_topsplit_local
domain_walktoptree
force_treeallocate
self->Nodes
force_treebuild
force_treebuild_single *force_create_empty_nodes (no longer necessary) * -- insert particles -- self->last = -1; /* pointe sur le dernier noeud fait */ *force_update_node_recursive
TOUT OK
implementation de la suite:
la suite :
- regarder un peu force_tree
- stoquer plusieurs particules par noeuds...
- construction
--> ok, on peut utiliser Nextnode pour cela a) on pointe sur Node => fin de la liste
- construction
how to remove topNodes ?
---> ok,done :-)
....> j'ai un treecode minmal...
- # ##############
TopNodes[no].Daughter == -1 --> pas cde cellules filles
struct topnode_data {
int Daughter; /*!< index of first daughter cell (out of 8) of top-level node */ int Pstart; /*!< for the present top-level node, this gives the index of the first node in the concatenated list of topnodes collected from all processors */ int Blocks; /*!< for the present top-level node, this gives the number of corresponding nodes in the concatenated list of topnodes collected from all processors */ int Leaf; /*!< if the node is a leaf, this gives its number when all leaves are traversed in Peano-Hilbert order */ peanokey Size; /*!< number of Peano-Hilbert mesh-cells represented by top-level node */ peanokey StartKey; /*!< first Peano-Hilbert key in top-level node */ long long Count; /*!< counts the number of particles in this top-level node */
};
si une cellule contiend plus que self->All.TotNumPart / (TOPNODEFACTOR * self->NTask * self->NTask) (dans topsplit local) particules, on l'ouvre.
extern int *DomainNodeIndex; /*!< this table gives for each leaf of the top-level tree the corresponding node of the gravitational tree */
???? quand est que DomainNodeIndex est remplis ?
- count the number of part in a node ##############
struct NODE
int count[8]; /* number of particles contained by each daughter node*/ int first[8]; /* index of first particle inside the daughter node*/ int last[8]; /* index of last particle inside the daughter node*/ !!! this requires a lot of memory !!! !!! should do this only if a daugher contains a list of particle !!! !!! .first[subnode] should be equal to .u.suns[subnode] !!! count is not necessary, can check if first=last
struct particle_data
int next;
actuellement:
Thu Oct 28 23:31:53 CEST 2010
need to test
if (self->Nodes[parent].count[subnode]>=1) --> if (self->Nodes[parent].count[subnode]>=2)