/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see .
*
******************************************************************************/
/* Config parameters. */
#include "../config.h"
/* Some standard headers. */
#include
#include
#include
#include
#include
#include
#include
/* Local headers. */
#include "cycle.h"
#include "atomic.h"
#include "lock.h"
#include "task.h"
#include "part.h"
#include "cell.h"
#include "space.h"
#include "runner.h"
/* Error macro. */
#define error(s) { fprintf( stderr , "%s:%s:%i: %s\n" , __FILE__ , __FUNCTION__ , __LINE__ , s ); abort(); }
/* Split size. */
int space_splitsize = space_splitsize_default;
int space_subsize = space_subsize_default;
/* Map shift vector to sortlist. */
const int sortlistID[27] = {
/* ( -1 , -1 , -1 ) */ 0 ,
/* ( -1 , -1 , 0 ) */ 1 ,
/* ( -1 , -1 , 1 ) */ 2 ,
/* ( -1 , 0 , -1 ) */ 3 ,
/* ( -1 , 0 , 0 ) */ 4 ,
/* ( -1 , 0 , 1 ) */ 5 ,
/* ( -1 , 1 , -1 ) */ 6 ,
/* ( -1 , 1 , 0 ) */ 7 ,
/* ( -1 , 1 , 1 ) */ 8 ,
/* ( 0 , -1 , -1 ) */ 9 ,
/* ( 0 , -1 , 0 ) */ 10 ,
/* ( 0 , -1 , 1 ) */ 11 ,
/* ( 0 , 0 , -1 ) */ 12 ,
/* ( 0 , 0 , 0 ) */ 0 ,
/* ( 0 , 0 , 1 ) */ 12 ,
/* ( 0 , 1 , -1 ) */ 11 ,
/* ( 0 , 1 , 0 ) */ 10 ,
/* ( 0 , 1 , 1 ) */ 9 ,
/* ( 1 , -1 , -1 ) */ 8 ,
/* ( 1 , -1 , 0 ) */ 7 ,
/* ( 1 , -1 , 1 ) */ 6 ,
/* ( 1 , 0 , -1 ) */ 5 ,
/* ( 1 , 0 , 0 ) */ 4 ,
/* ( 1 , 0 , 1 ) */ 3 ,
/* ( 1 , 1 , -1 ) */ 2 ,
/* ( 1 , 1 , 0 ) */ 1 ,
/* ( 1 , 1 , 1 ) */ 0
};
/**
* @brief Mark tasks to be skipped and set the sort flags accordingly.
*
* @return 1 if the space has to be rebuilt, 0 otherwise.
*/
int space_marktasks ( struct space *s ) {
int k, nr_tasks = s->nr_tasks, *ind = s->tasks_ind;
struct task *t, *tasks = s->tasks;
float dt_step = s->dt_step;
/* Run through the tasks and mark as skip or not. */
for ( k = 0 ; k < nr_tasks ; k++ ) {
/* Get a handle on the kth task. */
t = &tasks[ ind[k] ];
/* Sort-task? Note that due to the task ranking, the sorts
will all come before the pairs and/or subs. */
if ( t->type == task_type_sort ) {
/* Re-set the flags. */
t->flags = 0;
t->skip = 1;
}
/* Single-cell task? */
else if ( t->type == task_type_self ||
t->type == task_type_ghost ||
( t->type == task_type_sub && t->cj == NULL ) ) {
/* Set this task's skip. */
t->skip = ( t->ci->dt_min > dt_step );
/* Set the sort flags. */
if ( !t->skip && t->type == task_type_sub )
space_addsorts( s , t , t->ci , t->cj , t->flags );
}
/* Pair? */
else if ( t->type == task_type_pair || ( t->type == task_type_sub && t->cj != NULL ) ) {
/* Set this task's skip. */
t->skip = ( t->ci->dt_min > dt_step && t->cj->dt_min > dt_step );
/* Too much particle movement? */
if ( !t->skip && t->tight &&
( t->ci->h2dx_max > t->ci->dmin || t->cj->h2dx_max > t->cj->dmin ) )
return 1;
/* Set the sort flags. */
if ( !t->skip && t->type == task_type_pair ) {
t->ci->sorts->flags |= (1 << t->flags);
t->ci->sorts->skip = 0;
t->cj->sorts->flags |= (1 << t->flags);
t->cj->sorts->skip = 0;
}
}
/* None? */
else if ( t->type == task_type_none )
t->skip = 1;
}
/* All is well... */
return 0;
}
/**
* @brief Check the integrity of the space and rebuild if necessary.
*
* @param s The #space.
*
* Runs through the tasks and marks those as "skip" which have no
* effect for the current @c dt_max. Verifies the integrity of the
* cell tree for those tasks and triggers a rebuild if necessary.
*/
void space_prepare ( struct space *s ) {
int k, rebuild;
// struct task *t;
// float dt_step = s->dt_step;
float dx_max = 0.0f;
// int counts[ task_type_count + 1 ];
ticks tic;
/* Get the maximum displacement in the whole system. */
for ( k = 0 ; k < s->nr_cells ; k++ )
dx_max = fmaxf( dx_max , s->cells[k].dx_max );
// printf( "space_prepare: dx_max is %e.\n" , dx_max );
/* Run through the tasks and mark as skip or not. */
// tic = getticks();
rebuild = space_marktasks( s );
// printf( "space_prepare: space_marktasks took %.3f ms.\n" , (double)(getticks() - tic)/CPU_TPS*1000 );
/* Did this not go through? */
if ( rebuild ) {
/* Re-build the space. */
tic = getticks();
space_rebuild( s , 0.0 );
printf( "space_prepare: space_rebuild took %.3f ms.\n" , (double)(getticks() - tic)/CPU_TPS*1000 );
/* Run through the tasks and mark as skip or not. */
// tic = getticks();
if ( space_marktasks( s ) )
error( "space_marktasks failed after space_rebuild." );
// printf( "space_prepare: space_marktasks took %.3f ms.\n" , (double)(getticks() - tic)/CPU_TPS*1000 );
}
/* Now that we have the cell structre, re-build the tasks. */
// tic = getticks();
// space_maketasks( s , 1 );
// printf( "space_prepare: maketasks took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
/* Count the number of each task type. */
/* tic = getticks();
for ( k = 0 ; k <= task_type_count ; k++ )
counts[k] = 0;
for ( k = 0 ; k < s->nr_tasks ; k++ )
if ( !s->tasks[k].skip )
counts[ (int)s->tasks[k].type ] += 1;
else
counts[ task_type_count ] += 1;
printf( "space_prepare: task counts are [ %s=%i" , taskID_names[0] , counts[0] );
for ( k = 1 ; k < task_type_count ; k++ )
printf( " %s=%i" , taskID_names[k] , counts[k] );
printf( " skipped=%i ]\n" , counts[ task_type_count ] ); fflush(stdout);
printf( "space_prepare: task counting took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 ); */
}
/**
* @brief Sort the tasks in topological order over all queues.
*
* @param s The #space.
*/
void space_ranktasks ( struct space *s ) {
int i, j = 0, k, temp, left = 0, rank;
struct task *t, *tasks = s->tasks;
int *tid = s->tasks_ind, nr_tasks = s->nr_tasks;
/* Run throught the tasks and get all the waits right. */
for ( i = 0 , k = 0 ; k < nr_tasks ; k++ ) {
tid[k] = k;
for ( j = 0 ; j < tasks[k].nr_unlock_tasks ; j++ )
tasks[k].unlock_tasks[j]->wait += 1;
}
/* Main loop. */
for ( j = 0 , rank = 0 ; left < nr_tasks ; rank++ ) {
/* Load the tids of tasks with no waits. */
for ( k = left ; k < nr_tasks ; k++ )
if ( tasks[ tid[k] ].wait == 0 ) {
temp = tid[j]; tid[j] = tid[k]; tid[k] = temp;
j += 1;
}
/* Did we get anything? */
if ( j == left )
error( "Unsatisfiable task dependencies detected." );
/* Unlock the next layer of tasks. */
for ( i = left ; i < j ; i++ ) {
t = &tasks[ tid[i] ];
t->rank = rank;
tid[i] = t - tasks;
if ( tid[i] >= nr_tasks )
error( "Task index overshoot." );
/* printf( "engine_ranktasks: task %i of type %s has rank %i.\n" , i ,
(t->type == task_type_self) ? "self" : (t->type == task_type_pair) ? "pair" : "sort" , rank ); */
for ( k = 0 ; k < t->nr_unlock_tasks ; k++ )
t->unlock_tasks[k]->wait -= 1;
}
/* The new left (no, not tony). */
left = j;
}
}
/**
* @brief Get the shift-id of the given pair of cells, swapping them
* if need be.
*
* @param s The space
* @param ci Pointer to first #cell.
* @param cj Pointer second #cell.
* @param shift Vector from ci to cj.
*
* @return The shift ID and set shift, may or may not swap ci and cj.
*/
int space_getsid ( struct space *s , struct cell **ci , struct cell **cj , double *shift ) {
int k, sid = 0;
struct cell *temp;
double dx[3];
/* Get the relative distance between the pairs, wrapping. */
for ( k = 0 ; k < 3 ; k++ ) {
dx[k] = (*cj)->loc[k] - (*ci)->loc[k];
if ( dx[k] < -s->dim[k]/2 )
shift[k] = s->dim[k];
else if ( dx[k] > s->dim[k]/2 )
shift[k] = -s->dim[k];
else
shift[k] = 0.0;
dx[k] += shift[k];
}
/* Get the sorting index. */
for ( k = 0 ; k < 3 ; k++ )
sid = 3*sid + ( (dx[k] < 0.0) ? 0 : ( (dx[k] > 0.0) ? 2 : 1 ) );
/* Switch the cells around? */
if ( runner_flip[sid] ) {
temp = *ci; *ci = *cj; *cj = temp;
for ( k = 0 ; k < 3 ; k++ )
shift[k] = -shift[k];
}
sid = sortlistID[sid];
/* Return the sort ID. */
return sid;
}
/**
* @brief Recursively dismantle a cell tree.
*
*/
void space_rebuild_recycle ( struct space *s , struct cell *c ) {
int k;
if ( c->split )
for ( k = 0 ; k < 8 ; k++ )
if ( c->progeny[k] != NULL ) {
space_rebuild_recycle( s , c->progeny[k] );
space_recycle( s , c->progeny[k] );
c->progeny[k] = NULL;
}
}
/**
* @brief Recursively rebuild a cell tree.
*
*/
int space_rebuild_recurse ( struct space *s , struct cell *c ) {
int k, count, changes = 0, wasmt[8];
float h, h_limit, h_max = 0.0f, dt_min = c->parts[0].dt, dt_max = dt_min;
struct cell *temp;
/* Clean out the task pointers. */
c->sorts = NULL;
c->nr_tasks = 0;
c->nr_density = 0;
c->dx_max = 0.0;
/* If the cell is already split, check that the split is still ok. */
if ( c->split ) {
/* Check the depth. */
if ( c->depth > s->maxdepth )
s->maxdepth = c->depth;
/* Set the minimum cutoff. */
h_limit = fmin( c->h[0] , fmin( c->h[1] , c->h[2] ) ) / 2;
/* Count the particles below that. */
for ( count = 0 , k = 0 ; k < c->count ; k++ ) {
h = c->parts[k].h;
if ( h <= h_limit )
count += 1;
if ( h > h_max )
h_max = h;
if ( c->parts[k].dt < dt_min )
dt_min = c->parts[k].dt;
if ( c->parts[k].dt > dt_max )
dt_max = c->parts[k].dt;
}
c->h_max = h_max;
c->dt_min = dt_min;
c->dt_max = dt_max;
c->dx_max = 0;
/* Un-split? */
if ( count < c->count*space_splitratio || c->count < space_splitsize ) {
/* Get rid of the progeny. */
space_rebuild_recycle( s , c );
/* Re-set the split flag. */
c->split = 0;
}
/* Otherwise, recurse on the kids. */
else {
/* Populate all progeny. */
for ( k = 0 ; k < 8 ; k++ )
if ( ( wasmt[k] = ( c->progeny[k] == NULL ) ) ) {
temp = space_getcell( s );
temp->count = 0;
temp->loc[0] = c->loc[0];
temp->loc[1] = c->loc[1];
temp->loc[2] = c->loc[2];
temp->h[0] = c->h[0]/2;
temp->h[1] = c->h[1]/2;
temp->h[2] = c->h[2]/2;
temp->dmin = c->dmin/2;
if ( k & 4 )
temp->loc[0] += temp->h[0];
if ( k & 2 )
temp->loc[1] += temp->h[1];
if ( k & 1 )
temp->loc[2] += temp->h[2];
temp->depth = c->depth + 1;
temp->split = 0;
temp->h_max = 0.0;
temp->dx_max = 0.0;
temp->parent = c;
c->progeny[k] = temp;
}
/* Make sure each part is in its place. */
cell_split( c );
/* Remove empty progeny. */
for ( k = 0 ; k < 8 ; k++ )
if ( c->progeny[k]->count == 0 ) {
changes += !wasmt[k];
space_recycle( s , c->progeny[k] );
c->progeny[k] = NULL;
}
else
changes += wasmt[k];
/* Recurse. */
for ( k = 0 ; k < 8 ; k++ )
if ( c->progeny[k] != NULL )
changes += space_rebuild_recurse( s , c->progeny[k] );
}
}
/* Otherwise, try to split it anyway. */
else {
space_split( s , c );
changes += c->split;
}
/* Return the grand total. */
return changes;
}
/**
* @brief Re-build the cells as well as the tasks.
*
* @param s The #space in which to update the cells.
* @param cell_max Maximal cell size.
*
*/
void space_rebuild ( struct space *s , double cell_max ) {
float h_max = s->cell_min, dmin;
int i, j, k, cdim[3], nr_parts = s->nr_parts;
struct cell *restrict c;
struct part *restrict finger, *restrict p, *parts = s->parts;
struct cpart *restrict cfinger;
int *ind;
// ticks tic;
/* Be verbose about this. */
printf( "space_rebuild: (re)building space...\n" ); fflush(stdout);
/* Run through the parts and get the current h_max. */
// tic = getticks();
if ( s->cells != NULL ) {
for ( k = 0 ; k < s->nr_cells ; k++ ) {
if ( s->cells[k].h_max > h_max )
h_max = s->cells[k].h_max;
}
}
else {
for ( k = 0 ; k < nr_parts ; k++ ) {
if ( s->parts[k].h > h_max )
h_max = s->parts[k].h;
}
s->h_max = h_max;
}
// printf( "space_rebuild: h_max is %.3e.\n" , h_max );
// printf( "space_rebuild: getting h_min and h_max took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
/* Get the new putative cell dimensions. */
for ( k = 0 ; k < 3 ; k++ )
cdim[k] = floor( s->dim[k] / fmax( h_max*space_stretch , cell_max ) );
/* Do we need to re-build the upper-level cells? */
// tic = getticks();
if ( s->cells == NULL ||
cdim[0] < s->cdim[0] || cdim[1] < s->cdim[1] || cdim[2] < s->cdim[2] ) {
/* Free the old cells, if they were allocated. */
if ( s->cells != NULL ) {
for ( k = 0 ; k < s->nr_cells ; k++ ) {
space_rebuild_recycle( s , &s->cells[k] );
if ( s->cells[k].sort != NULL )
free( s->cells[k].sort );
}
free( s->cells );
s->maxdepth = 0;
}
/* Set the new cell dimensions only if smaller. */
for ( k = 0 ; k < 3 ; k++ ) {
s->cdim[k] = cdim[k];
s->h[k] = s->dim[k] / cdim[k];
s->ih[k] = 1.0 / s->h[k];
}
dmin = fminf( s->h[0] , fminf( s->h[1] , s->h[2] ) );
/* Allocate the highest level of cells. */
s->tot_cells = s->nr_cells = cdim[0] * cdim[1] * cdim[2];
if ( posix_memalign( (void *)&s->cells , 64 , s->nr_cells * sizeof(struct cell) ) != 0 )
error( "Failed to allocate cells." );
bzero( s->cells , s->nr_cells * sizeof(struct cell) );
for ( k = 0 ; k < s->nr_cells ; k++ )
if ( lock_init( &s->cells[k].lock ) != 0 )
error( "Failed to init spinlock." );
/* Set the cell location and sizes. */
for ( i = 0 ; i < cdim[0] ; i++ )
for ( j = 0 ; j < cdim[1] ; j++ )
for ( k = 0 ; k < cdim[2] ; k++ ) {
c = &s->cells[ cell_getid( cdim , i , j , k ) ];
c->loc[0] = i*s->h[0]; c->loc[1] = j*s->h[1]; c->loc[2] = k*s->h[2];
c->h[0] = s->h[0]; c->h[1] = s->h[1]; c->h[2] = s->h[2];
c->dmin = dmin;
c->depth = 0;
lock_init( &c->lock );
}
/* Be verbose about the change. */
printf( "space_rebuild: set cell dimensions to [ %i %i %i ].\n" , cdim[0] , cdim[1] , cdim[2] ); fflush(stdout);
} /* re-build upper-level cells? */
// printf( "space_rebuild: rebuilding upper-level cells took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
/* Otherwise, just clean up the cells. */
else {
/* Free the old cells, if they were allocated. */
for ( k = 0 ; k < s->nr_cells ; k++ ) {
space_rebuild_recycle( s , &s->cells[k] );
s->cells[k].sorts = NULL;
s->cells[k].nr_tasks = 0;
s->cells[k].nr_density = 0;
s->cells[k].dx_max = 0.0f;
s->cells[k].h2dx_max = 0.0f;
s->cells[k].sorted = 0;
}
s->maxdepth = 0;
}
/* Run through the particles and get their cell index. */
// tic = getticks();
if ( ( ind = (int *)malloc( sizeof(int) * s->nr_parts ) ) == NULL )
error( "Failed to allocate temporary particle indices." );
for ( k = 0 ; k < s->nr_cells ; k++ )
s->cells[ k ].count = 0;
#pragma omp parallel for private(p,j)
for ( k = 0 ; k < nr_parts ; k++ ) {
p = &parts[k];
for ( j = 0 ; j < 3 ; j++ )
if ( p->x[j] < 0.0 )
p->x[j] += s->dim[j];
else if ( p->x[j] >= s->dim[j] )
p->x[j] -= s->dim[j];
ind[k] = cell_getid( s->cdim , p->x[0]*s->ih[0] , p->x[1]*s->ih[1] , p->x[2]*s->ih[2] );
atomic_inc( &s->cells[ ind[k] ].count );
}
// printf( "space_rebuild: getting particle indices took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
/* Sort the parts according to their cells. */
// tic = getticks();
parts_sort( parts , ind , s->nr_parts , 0 , s->nr_cells );
// printf( "space_rebuild: parts_sort took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
/* We no longer need the indices as of here. */
free( ind );
/* Hook the cells up to the parts. */
// tic = getticks();
finger = s->parts;
cfinger = s->cparts;
for ( k = 0 ; k < s->nr_cells ; k++ ) {
c = &s->cells[ k ];
c->parts = finger;
c->cparts = cfinger;
finger = &finger[ c->count ];
cfinger = &cfinger[ c->count ];
}
// printf( "space_rebuild: hooking up cells took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
/* At this point, we have the upper-level cells, old or new. Now make
sure that the parts in each cell are ok. */
// tic = getticks();
#pragma omp parallel for schedule(dynamic,1) shared(s)
for ( k = 0 ; k < s->nr_cells ; k++ )
space_split( s , &s->cells[k] );
// printf( "space_rebuild: space_rebuild_recurse took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
/* Now that we have the cell structre, re-build the tasks. */
// tic = getticks();
space_maketasks( s , 1 );
// printf( "space_rebuild: maketasks took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
}
/**
* @brief Sort the particles and condensed particles according to the given indices.
*
* @param parts The list of #part
* @param ind The indices with respect to which the parts are sorted.
* @param N The number of parts
* @param min Lowest index.
* @param max highest index.
*
* This function calls itself recursively.
*/
void parts_sort_rec ( struct part *parts , int *ind , int N , int min , int max ) {
int pivot = (min + max) / 2;
int i = 0, j = N-1;
int temp_i;
struct part temp_p;
/* If N is small enough, just do insert sort. */
if ( N < 16 ) {
for ( i = 1 ; i < N ; i++ )
if ( ind[i] < ind[i-1] ) {
temp_i = ind[i];
temp_p = parts[i];
for ( j = i ; j > 0 && ind[j-1] > temp_i ; j-- ) {
ind[j] = ind[j-1];
parts[j] = parts[j-1];
}
ind[j] = temp_i;
parts[j] = temp_p;
}
}
/* Otherwise, recurse with Quicksort. */
else {
/* One pass of quicksort. */
while ( i < j ) {
while ( i < N && ind[i] <= pivot )
i++;
while ( j >= 0 && ind[j] > pivot )
j--;
if ( i < j ) {
temp_i = ind[i]; ind[i] = ind[j]; ind[j] = temp_i;
temp_p = parts[i]; parts[i] = parts[j]; parts[j] = temp_p;
}
}
/* Verify sort. */
/* for ( int k = 0 ; k <= j ; k++ )
if ( ind[k] > pivot ) {
printf( "parts_sort: sorting failed at k=%i, ind[k]=%i, pivot=%i, i=%i, j=%i, N=%i.\n" , k , ind[k] , pivot , i , j , N );
error( "Sorting failed (<=pivot)." );
}
for ( int k = j+1 ; k < N ; k++ )
if ( ind[k] <= pivot ) {
printf( "parts_sort: sorting failed at k=%i, ind[k]=%i, pivot=%i, i=%i, j=%i, N=%i.\n" , k , ind[k] , pivot , i , j , N );
error( "Sorting failed (>pivot)." );
} */
/* Recurse on the left? */
if ( j > 0 && pivot > min ) {
#pragma omp task untied
parts_sort( parts , ind , j+1 , min , pivot );
}
/* Recurse on the right? */
if ( i < N && pivot+1 < max ) {
#pragma omp task untied
parts_sort( &parts[i], &ind[i], N-i , pivot+1 , max );
}
}
}
void parts_sort ( struct part *parts , int *ind , int N , int min , int max ) {
/* Call the first sort as an OpenMP task. */
#pragma omp parallel
{
#pragma omp single nowait
parts_sort_rec( parts , ind , N , min , max );
}
}
/**
* @brief Mapping function to free the sorted indices buffers.
*/
void space_map_clearsort ( struct cell *c , void *data ) {
if ( c->sort != NULL ) {
free( c->sort );
c->sort = NULL;
}
}
/**
* @brief Mapping function to append a ghost task to each cell.
*
* Looks for the super cell, e.g. the highest-level cell above each
* cell for which a pair is defined. All ghosts below this cell will
* depend on the ghost of their parents (sounds spooky, but it isn't).
*/
void space_map_mkghosts ( struct cell *c , void *data ) {
struct space *s = (struct space *)data;
struct cell *finger;
/* Find the super cell, i.e. the highest cell hierarchically above
this one to still have at least one task associated with it. */
c->super = c;
for ( finger = c->parent ; finger != NULL ; finger = finger->parent )
if ( finger->nr_tasks > 0 )
c->super = finger;
/* Make the ghost task */
if ( c->super != c || c->nr_tasks > 0 )
c->ghost = space_addtask( s , task_type_ghost , task_subtype_none , 0 , 0 , c , NULL , 0 );
/* If we are not the super cell ourselves, make our ghost depend
on our parent cell. */
if ( c->super != c )
task_addunlock( c->parent->ghost , c->ghost );
}
/**
* @brief Map a function to all particles in a aspace.
*
* @param s The #space we are working in.
* @param fun Function pointer to apply on the cells.
* @param data Data passed to the function fun.
*/
void space_map_parts ( struct space *s , void (*fun)( struct part *p , struct cell *c , void *data ) , void *data ) {
int i;
void rec_map ( struct cell *c ) {
int k;
/* No progeny? */
if ( !c->split )
for ( k = 0 ; k < c->count ; k++ )
fun( &c->parts[k] , c , data );
/* Otherwise, recurse. */
else
for ( k = 0 ; k < 8 ; k++ )
if ( c->progeny[k] != NULL )
rec_map( c->progeny[k] );
}
/* Call the recursive function on all higher-level cells. */
#pragma omp parallel for schedule(dynamic,1)
for ( i = 0 ; i < s->nr_cells ; i++ )
rec_map( &s->cells[i] );
}
/**
* @brief Map a function to all particles in a aspace.
*
* @param s The #space we are working in.
* @param full Map to all cells, including cells with sub-cells.
* @param fun Function pointer to apply on the cells.
* @param data Data passed to the function fun.
*/
void space_map_cells_post ( struct space *s , int full , void (*fun)( struct cell *c , void *data ) , void *data ) {
int i;
void rec_map ( struct cell *c ) {
int k;
/* Recurse. */
if ( c->split )
for ( k = 0 ; k < 8 ; k++ )
if ( c->progeny[k] != NULL )
rec_map( c->progeny[k] );
/* No progeny? */
if ( full || !c->split )
fun( c , data );
}
/* Call the recursive function on all higher-level cells. */
#pragma omp parallel for schedule(dynamic,1)
for ( i = 0 ; i < s->nr_cells ; i++ )
rec_map( &s->cells[i] );
}
void space_map_cells_pre ( struct space *s , int full , void (*fun)( struct cell *c , void *data ) , void *data ) {
int i;
void rec_map ( struct cell *c ) {
int k;
/* No progeny? */
if ( full || !c->split )
fun( c , data );
/* Recurse. */
if ( c->split )
for ( k = 0 ; k < 8 ; k++ )
if ( c->progeny[k] != NULL )
rec_map( c->progeny[k] );
}
/* Call the recursive function on all higher-level cells. */
#pragma omp parallel for schedule(dynamic,1)
for ( i = 0 ; i < s->nr_cells ; i++ )
rec_map( &s->cells[i] );
}
/**
* @brief Add a #task to the #space.
*
* @param s The #space we are working in.
* @param type The type of the task.
* @param subtype The sub-type of the task.
* @param flags The flags of the task.
* @param wait
* @param ci The first cell to interact.
* @param cj The second cell to interact.
* @param tight
*/
struct task *space_addtask ( struct space *s , int type , int subtype , int flags , int wait , struct cell *ci , struct cell *cj , int tight ) {
int ind;
struct task *t;
/* Get the next free task. */
ind = atomic_inc( &s->tasks_next );
t = &s->tasks[ ind ];
/* Copy the data. */
t->type = type;
t->subtype = subtype;
t->flags = flags;
t->wait = wait;
t->ci = ci;
t->cj = cj;
t->skip = 0;
t->tight = tight;
t->nr_unlock_tasks = 0;
/* Init the lock. */
lock_init( &t->lock );
/* Add an index for it. */
lock_lock( &s->lock );
s->tasks_ind[ s->nr_tasks ] = ind;
s->nr_tasks += 1;
lock_unlock_blind( &s->lock );
/* Return a pointer to the new task. */
return t;
}
/**
* @brief Split tasks that may be too large.
*
* @param s The #space we are working in.
*/
void space_splittasks ( struct space *s ) {
int j, k, ind, sid, tid = 0, redo;
struct cell *ci, *cj;
double hi, hj, shift[3];
struct task *t, *t_old;
// float dt_step = s->dt_step;
int pts[7][8] = { { -1 , 12 , 10 , 9 , 4 , 3 , 1 , 0 } ,
{ -1 , -1 , 11 , 10 , 5 , 4 , 2 , 1 } ,
{ -1 , -1 , -1 , 12 , 7 , 6 , 4 , 3 } ,
{ -1 , -1 , -1 , -1 , 8 , 7 , 5 , 4 } ,
{ -1 , -1 , -1 , -1 , -1 , 12 , 10 , 9 } ,
{ -1 , -1 , -1 , -1 , -1 , -1 , 11 , 10 } ,
{ -1 , -1 , -1 , -1 , -1 , -1 , -1 , 12 } };
/* Loop through the tasks... */
#pragma omp parallel shared(s,tid,pts) private(ind,j,k,t,t_old,redo,ci,cj,hi,hj,sid,shift)
{
redo = 0; t_old = t = NULL;
while ( redo || tid < s->nr_tasks ) {
/* Get a pointer on the task. */
if ( redo ) {
redo = 0;
t = t_old;
}
else {
if ( ( ind = atomic_inc( &tid ) ) >= s->nr_tasks )
break;
t_old = t = &s->tasks[ s->tasks_ind[ ind ] ];
}
/* Empty task? */
if ( t->ci == NULL || ( t->type == task_type_pair && t->cj == NULL ) ) {
t->type = task_type_none;
t->skip = 1;
continue;
}
/* Self-interaction? */
if ( t->type == task_type_self ) {
/* Get a handle on the cell involved. */
ci = t->ci;
/* Ingore this task? */
/* if ( ci->dt_min > dt_step ) {
t->skip = 1;
continue;
} */
/* Is this cell even split? */
if ( !ci->split )
continue;
/* Make a sub? */
if ( space_dosub && ci->count < space_subsize ) {
/* convert to a self-subtask. */
t->type = task_type_sub;
/* Wait for this tasks sorts, as we will now have pairwise
components in this sub. */
space_addsorts( s , t , ci , NULL , -1 );
}
/* Otherwise, make tasks explicitly. */
else {
/* Take a step back (we're going to recycle the current task)... */
redo = 1;
/* Add the self taks. */
for ( k = 0 ; ci->progeny[k] == NULL ; k++ );
t->ci = ci->progeny[k];
for ( k += 1 ; k < 8 ; k++ )
if ( ci->progeny[k] != NULL )
space_addtask( s , task_type_self , task_subtype_density , 0 , 0 , ci->progeny[k] , NULL , 0 );
/* Make a task for each pair of progeny. */
for ( j = 0 ; j < 8 ; j++ )
if ( ci->progeny[j] != NULL )
for ( k = j + 1 ; k < 8 ; k++ )
if ( ci->progeny[k] != NULL )
space_addtask( s , task_type_pair , task_subtype_density , pts[j][k] , 0 , ci->progeny[j] , ci->progeny[k] , 0 );
}
}
/* Pair interaction? */
else if ( t->type == task_type_pair ) {
/* Get a handle on the cells involved. */
ci = t->ci;
cj = t->cj;
hi = ci->dmin;
hj = cj->dmin;
/* Ingore this task? */
/* if ( ci->dt_min > dt_step && cj->dt_min > dt_step ) {
t->skip = 1;
continue;
} */
/* Get the sort ID, use space_getsid and not t->flags
to make sure we get ci and cj swapped if needed. */
sid = space_getsid( s , &ci , &cj , shift );
/* Should this task be split-up? */
if ( ci->split && cj->split &&
ci->h_max < hi/2 && cj->h_max < hj/2 ) {
/* Replace by a single sub-task? */
if ( space_dosub &&
ci->count < space_subsize && cj->count < space_subsize &&
sid != 0 && sid != 2 && sid != 6 && sid != 8 ) {
/* Make this task a sub task. */
t->type = task_type_sub;
t->flags = sid;
t->ci = ci; t->cj = cj;
/* Create the sorts recursively. */
// space_addsorts( s , t , ci , cj , sid );
/* Don't go any further. */
continue;
}
/* Take a step back (we're going to recycle the current task)... */
redo = 1;
/* For each different sorting type... */
switch ( sid ) {
case 0: /* ( 1 , 1 , 1 ) */
t->ci = ci->progeny[7]; t->cj = cj->progeny[0]; t->flags = 0;
break;
case 1: /* ( 1 , 1 , 0 ) */
t->ci = ci->progeny[6]; t->cj = cj->progeny[0]; t->flags = 1; t->tight = 1;
t = space_addtask( s , task_type_pair , t->subtype , 1 , 0 , ci->progeny[7] , cj->progeny[1] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 0 , 0 , ci->progeny[6] , cj->progeny[1] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 2 , 0 , ci->progeny[7] , cj->progeny[0] , 1 );
break;
case 2: /* ( 1 , 1 , -1 ) */
t->ci = ci->progeny[6]; t->cj = cj->progeny[1]; t->flags = 2; t->tight = 1;
break;
case 3: /* ( 1 , 0 , 1 ) */
t->ci = ci->progeny[5]; t->cj = cj->progeny[0]; t->flags = 3; t->tight = 1;
t = space_addtask( s , task_type_pair , t->subtype , 3 , 0 , ci->progeny[7] , cj->progeny[2] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 0 , 0 , ci->progeny[5] , cj->progeny[2] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 6 , 0 , ci->progeny[7] , cj->progeny[0] , 1 );
break;
case 4: /* ( 1 , 0 , 0 ) */
t->ci = ci->progeny[4]; t->cj = cj->progeny[0]; t->flags = 4; t->tight = 1;
t = space_addtask( s , task_type_pair , t->subtype , 5 , 0 , ci->progeny[5] , cj->progeny[0] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 7 , 0 , ci->progeny[6] , cj->progeny[0] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 8 , 0 , ci->progeny[7] , cj->progeny[0] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 3 , 0 , ci->progeny[4] , cj->progeny[1] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 4 , 0 , ci->progeny[5] , cj->progeny[1] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 6 , 0 , ci->progeny[6] , cj->progeny[1] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 7 , 0 , ci->progeny[7] , cj->progeny[1] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 1 , 0 , ci->progeny[4] , cj->progeny[2] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 2 , 0 , ci->progeny[5] , cj->progeny[2] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 4 , 0 , ci->progeny[6] , cj->progeny[2] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 5 , 0 , ci->progeny[7] , cj->progeny[2] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 0 , 0 , ci->progeny[4] , cj->progeny[3] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 1 , 0 , ci->progeny[5] , cj->progeny[3] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 3 , 0 , ci->progeny[6] , cj->progeny[3] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 4 , 0 , ci->progeny[7] , cj->progeny[3] , 1 );
break;
case 5: /* ( 1 , 0 , -1 ) */
t->ci = ci->progeny[4]; t->cj = cj->progeny[1]; t->flags = 5; t->tight = 1;
t = space_addtask( s , task_type_pair , t->subtype , 5 , 0 , ci->progeny[6] , cj->progeny[3] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 2 , 0 , ci->progeny[4] , cj->progeny[3] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 8 , 0 , ci->progeny[6] , cj->progeny[1] , 1 );
break;
case 6: /* ( 1 , -1 , 1 ) */
t->ci = ci->progeny[5]; t->cj = cj->progeny[2]; t->flags = 6; t->tight = 1;
break;
case 7: /* ( 1 , -1 , 0 ) */
t->ci = ci->progeny[4]; t->cj = cj->progeny[3]; t->flags = 6; t->tight = 1;
t = space_addtask( s , task_type_pair , t->subtype , 8 , 0 , ci->progeny[5] , cj->progeny[2] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 7 , 0 , ci->progeny[4] , cj->progeny[2] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 7 , 0 , ci->progeny[5] , cj->progeny[3] , 1 );
break;
case 8: /* ( 1 , -1 , -1 ) */
t->ci = ci->progeny[4]; t->cj = cj->progeny[3]; t->flags = 8; t->tight = 1;
break;
case 9: /* ( 0 , 1 , 1 ) */
t->ci = ci->progeny[3]; t->cj = cj->progeny[0]; t->flags = 9; t->tight = 1;
t = space_addtask( s , task_type_pair , t->subtype , 9 , 0 , ci->progeny[7] , cj->progeny[4] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 0 , 0 , ci->progeny[3] , cj->progeny[4] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 8 , 0 , ci->progeny[7] , cj->progeny[0] , 1 );
break;
case 10: /* ( 0 , 1 , 0 ) */
t->ci = ci->progeny[2]; t->cj = cj->progeny[0]; t->flags = 10; t->tight = 1;
t = space_addtask( s , task_type_pair , t->subtype , 11 , 0 , ci->progeny[3] , cj->progeny[0] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 7 , 0 , ci->progeny[6] , cj->progeny[0] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 6 , 0 , ci->progeny[7] , cj->progeny[0] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 9 , 0 , ci->progeny[2] , cj->progeny[1] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 10 , 0 , ci->progeny[3] , cj->progeny[1] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 8 , 0 , ci->progeny[6] , cj->progeny[1] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 7 , 0 , ci->progeny[7] , cj->progeny[1] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 1 , 0 , ci->progeny[2] , cj->progeny[4] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 2 , 0 , ci->progeny[3] , cj->progeny[4] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 10 , 0 , ci->progeny[6] , cj->progeny[4] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 11 , 0 , ci->progeny[7] , cj->progeny[4] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 0 , 0 , ci->progeny[2] , cj->progeny[5] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 1 , 0 , ci->progeny[3] , cj->progeny[5] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 9 , 0 , ci->progeny[6] , cj->progeny[5] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 10 , 0 , ci->progeny[7] , cj->progeny[5] , 1 );
break;
case 11: /* ( 0 , 1 , -1 ) */
t->ci = ci->progeny[2]; t->cj = cj->progeny[1]; t->flags = 11; t->tight = 1;
t = space_addtask( s , task_type_pair , t->subtype , 11 , 0 , ci->progeny[6] , cj->progeny[5] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 2 , 0 , ci->progeny[2] , cj->progeny[5] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 6 , 0 , ci->progeny[6] , cj->progeny[1] , 1 );
break;
case 12: /* ( 0 , 0 , 1 ) */
t->ci = ci->progeny[1]; t->cj = cj->progeny[0]; t->flags = 12; t->tight = 1;
t = space_addtask( s , task_type_pair , t->subtype , 11 , 0 , ci->progeny[3] , cj->progeny[0] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 5 , 0 , ci->progeny[5] , cj->progeny[0] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 2 , 0 , ci->progeny[7] , cj->progeny[0] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 9 , 0 , ci->progeny[1] , cj->progeny[2] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 12 , 0 , ci->progeny[3] , cj->progeny[2] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 8 , 0 , ci->progeny[5] , cj->progeny[2] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 5 , 0 , ci->progeny[7] , cj->progeny[2] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 3 , 0 , ci->progeny[1] , cj->progeny[4] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 6 , 0 , ci->progeny[3] , cj->progeny[4] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 12 , 0 , ci->progeny[5] , cj->progeny[4] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 11 , 0 , ci->progeny[7] , cj->progeny[4] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 0 , 0 , ci->progeny[1] , cj->progeny[6] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 3 , 0 , ci->progeny[3] , cj->progeny[6] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 9 , 0 , ci->progeny[5] , cj->progeny[6] , 1 );
t = space_addtask( s , task_type_pair , t->subtype , 12 , 0 , ci->progeny[7] , cj->progeny[6] , 1 );
break;
}
} /* split this task? */
/* Otherwise, if not spilt, stitch-up the sorting. */
else {
/* Create the sort for ci. */
lock_lock( &ci->lock );
if ( ci->sorts == NULL )
ci->sorts = space_addtask( s , task_type_sort , 0 , 1 << sid , 0 , ci , NULL , 0 );
ci->sorts->flags |= (1 << sid);
lock_unlock_blind( &ci->lock );
task_addunlock( ci->sorts , t );
/* Create the sort for cj. */
lock_lock( &cj->lock );
if ( cj->sorts == NULL )
cj->sorts = space_addtask( s , task_type_sort , 0 , 1 << sid , 0 , cj , NULL , 0 );
cj->sorts->flags |= (1 << sid);
lock_unlock_blind( &cj->lock );
task_addunlock( cj->sorts , t );
}
} /* pair interaction? */
} /* loop over all tasks. */
}
}
/**
* @brief Generate the sorts for a sub recursively.
*
* @param s The #space we are working in.
* @param t The #task.
* @param ci The first cell.
* @param cj The second cell.
* @param sid The sort ID.
*/
void space_addsorts ( struct space *s , struct task *t , struct cell *ci , struct cell *cj , int sid ) {
float dmin = ci->dmin;
double shift[3];
int j, k;
/* Single-cell sub? */
if ( cj == NULL ) {
/* If there is further splitting, add the pairs recursively. */
if ( ci->split ) {
/* Recurse for each progeny. */
for ( j = 0 ; j < 8 ; j++ )
if ( ci->progeny[j] != NULL )
space_addsorts( s , t , ci->progeny[j] , NULL , -1 );
/* Recurse for each pair of progeny. */
for ( j = 0 ; j < 8 ; j++ )
if ( ci->progeny[j] != NULL )
for ( k = j + 1 ; k < 8 ; k++ )
if ( ci->progeny[k] != NULL )
space_addsorts( s , t , ci->progeny[j] , ci->progeny[k] , -1 );
}
}
/* Otherwise, it's a pair. */
else {
/* Get the sort ID if not specified. */
// if ( sid < 0 )
sid = space_getsid( s , &ci , &cj , shift );
/* If there is no further splitting, add the sorts. */
if ( !ci->split || !cj->split ||
ci->h_max*2 >= dmin || cj->h_max*2 >= dmin ) {
/* Create and add the sort for ci. */
if ( ci->sorts == NULL ) {
ci->sorts = space_addtask( s , task_type_sort , 0 , 1 << sid , 0 , ci , NULL , 0 );
if ( ci->parent != NULL && ci->parent->sorts != NULL )
task_addunlock( ci->sorts , ci->parent->sorts );
}
ci->sorts->flags |= (1 << sid);
task_addunlock( ci->sorts , t );
/* Create and add the sort for cj. */
if ( cj->sorts == NULL ) {
cj->sorts = space_addtask( s , task_type_sort , 0 , 1 << sid , 0 , cj , NULL , 0 );
if ( cj->parent != NULL && cj->parent->sorts != NULL )
task_addunlock( cj->sorts , cj->parent->sorts );
}
cj->sorts->flags |= (1 << sid);
task_addunlock( cj->sorts , t );
}
/* Otherwise, recurse. */
else {
/* For each different sorting type... */
switch ( sid ) {
case 0: /* ( 1 , 1 , 1 ) */
if ( ci->progeny[7] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[0] , 0 );
break;
case 1: /* ( 1 , 1 , 0 ) */
if ( ci->progeny[6] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[0] , 1 );
if ( ci->progeny[7] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[1] , 1 );
if ( ci->progeny[6] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[1] , 0 );
if ( ci->progeny[7] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[0] , 2 );
break;
case 2: /* ( 1 , 1 , -1 ) */
if ( ci->progeny[6] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[1] , 2 );
break;
case 3: /* ( 1 , 0 , 1 ) */
if ( ci->progeny[5] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[0] , 3 );
if ( ci->progeny[7] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[2] , 3 );
if ( ci->progeny[5] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[2] , 0 );
if ( ci->progeny[7] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[0] , 6 );
break;
case 4: /* ( 1 , 0 , 0 ) */
if ( ci->progeny[4] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[4] , cj->progeny[0] , 4 );
if ( ci->progeny[5] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[0] , 5 );
if ( ci->progeny[6] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[0] , 7 );
if ( ci->progeny[7] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[0] , 8 );
if ( ci->progeny[4] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[4] , cj->progeny[1] , 3 );
if ( ci->progeny[5] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[1] , 4 );
if ( ci->progeny[6] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[1] , 6 );
if ( ci->progeny[7] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[1] , 7 );
if ( ci->progeny[4] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[4] , cj->progeny[2] , 1 );
if ( ci->progeny[5] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[2] , 2 );
if ( ci->progeny[6] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[2] , 4 );
if ( ci->progeny[7] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[2] , 5 );
if ( ci->progeny[4] != NULL && cj->progeny[3] != NULL )
space_addsorts( s , t , ci->progeny[4] , cj->progeny[3] , 0 );
if ( ci->progeny[5] != NULL && cj->progeny[3] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[3] , 1 );
if ( ci->progeny[6] != NULL && cj->progeny[3] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[3] , 3 );
if ( ci->progeny[7] != NULL && cj->progeny[3] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[3] , 4 );
break;
case 5: /* ( 1 , 0 , -1 ) */
if ( ci->progeny[4] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[4] , cj->progeny[1] , 5 );
if ( ci->progeny[6] != NULL && cj->progeny[3] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[3] , 5 );
if ( ci->progeny[4] != NULL && cj->progeny[3] != NULL )
space_addsorts( s , t , ci->progeny[4] , cj->progeny[3] , 2 );
if ( ci->progeny[6] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[1] , 8 );
break;
case 6: /* ( 1 , -1 , 1 ) */
if ( ci->progeny[5] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[2] , 6 );
break;
case 7: /* ( 1 , -1 , 0 ) */
if ( ci->progeny[4] != NULL && cj->progeny[3] != NULL )
space_addsorts( s , t , ci->progeny[4] , cj->progeny[3] , 6 );
if ( ci->progeny[5] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[2] , 8 );
if ( ci->progeny[4] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[4] , cj->progeny[2] , 7 );
if ( ci->progeny[5] != NULL && cj->progeny[3] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[3] , 7 );
break;
case 8: /* ( 1 , -1 , -1 ) */
if ( ci->progeny[4] != NULL && cj->progeny[3] != NULL )
space_addsorts( s , t , ci->progeny[4] , cj->progeny[3] , 8 );
break;
case 9: /* ( 0 , 1 , 1 ) */
if ( ci->progeny[3] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[3] , cj->progeny[0] , 9 );
if ( ci->progeny[7] != NULL && cj->progeny[4] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[4] , 9 );
if ( ci->progeny[3] != NULL && cj->progeny[4] != NULL )
space_addsorts( s , t , ci->progeny[3] , cj->progeny[4] , 0 );
if ( ci->progeny[7] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[0] , 8 );
break;
case 10: /* ( 0 , 1 , 0 ) */
if ( ci->progeny[2] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[2] , cj->progeny[0] , 10 );
if ( ci->progeny[3] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[3] , cj->progeny[0] , 11 );
if ( ci->progeny[6] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[0] , 7 );
if ( ci->progeny[7] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[0] , 6 );
if ( ci->progeny[2] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[2] , cj->progeny[1] , 9 );
if ( ci->progeny[3] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[3] , cj->progeny[1] , 10 );
if ( ci->progeny[6] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[1] , 8 );
if ( ci->progeny[7] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[1] , 7 );
if ( ci->progeny[2] != NULL && cj->progeny[4] != NULL )
space_addsorts( s , t , ci->progeny[2] , cj->progeny[4] , 1 );
if ( ci->progeny[3] != NULL && cj->progeny[4] != NULL )
space_addsorts( s , t , ci->progeny[3] , cj->progeny[4] , 2 );
if ( ci->progeny[6] != NULL && cj->progeny[4] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[4] , 10 );
if ( ci->progeny[7] != NULL && cj->progeny[4] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[4] , 11 );
if ( ci->progeny[2] != NULL && cj->progeny[5] != NULL )
space_addsorts( s , t , ci->progeny[2] , cj->progeny[5] , 0 );
if ( ci->progeny[3] != NULL && cj->progeny[5] != NULL )
space_addsorts( s , t , ci->progeny[3] , cj->progeny[5] , 1 );
if ( ci->progeny[6] != NULL && cj->progeny[5] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[5] , 9 );
if ( ci->progeny[7] != NULL && cj->progeny[5] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[5] , 10 );
break;
case 11: /* ( 0 , 1 , -1 ) */
if ( ci->progeny[2] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[2] , cj->progeny[1] , 11 );
if ( ci->progeny[6] != NULL && cj->progeny[5] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[5] , 11 );
if ( ci->progeny[2] != NULL && cj->progeny[5] != NULL )
space_addsorts( s , t , ci->progeny[2] , cj->progeny[5] , 2 );
if ( ci->progeny[6] != NULL && cj->progeny[1] != NULL )
space_addsorts( s , t , ci->progeny[6] , cj->progeny[1] , 6 );
break;
case 12: /* ( 0 , 0 , 1 ) */
if ( ci->progeny[1] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[1] , cj->progeny[0] , 12 );
if ( ci->progeny[3] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[3] , cj->progeny[0] , 11 );
if ( ci->progeny[5] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[0] , 5 );
if ( ci->progeny[7] != NULL && cj->progeny[0] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[0] , 2 );
if ( ci->progeny[1] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[1] , cj->progeny[2] , 9 );
if ( ci->progeny[3] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[3] , cj->progeny[2] , 12 );
if ( ci->progeny[5] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[2] , 8 );
if ( ci->progeny[7] != NULL && cj->progeny[2] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[2] , 5 );
if ( ci->progeny[1] != NULL && cj->progeny[4] != NULL )
space_addsorts( s , t , ci->progeny[1] , cj->progeny[4] , 3 );
if ( ci->progeny[3] != NULL && cj->progeny[4] != NULL )
space_addsorts( s , t , ci->progeny[3] , cj->progeny[4] , 6 );
if ( ci->progeny[5] != NULL && cj->progeny[4] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[4] , 12 );
if ( ci->progeny[7] != NULL && cj->progeny[4] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[4] , 11 );
if ( ci->progeny[1] != NULL && cj->progeny[6] != NULL )
space_addsorts( s , t , ci->progeny[1] , cj->progeny[6] , 0 );
if ( ci->progeny[3] != NULL && cj->progeny[6] != NULL )
space_addsorts( s , t , ci->progeny[3] , cj->progeny[6] , 3 );
if ( ci->progeny[5] != NULL && cj->progeny[6] != NULL )
space_addsorts( s , t , ci->progeny[5] , cj->progeny[6] , 9 );
if ( ci->progeny[7] != NULL && cj->progeny[6] != NULL )
space_addsorts( s , t , ci->progeny[7] , cj->progeny[6] , 12 );
break;
} /* switch. */
} /* recurse. */
} /* it's a pair. */
}
/**
* @brief Fill the #space's task list.
*
* @param s The #space we are working in.
* @param do_sort Flag to add sorting tasks to the list.
*/
void space_maketasks ( struct space *s , int do_sort ) {
int i, j, k, ii, jj, kk, iii, jjj, kkk, cid, cjd, sid;
int *cdim = s->cdim;
struct task *t, *t2;
struct cell *ci, *cj;
/* Allocate the task-list, if needed. */
if ( s->tasks == NULL || s->tasks_size < s->tot_cells * space_maxtaskspercell ) {
if ( s->tasks != NULL )
free( s->tasks );
if ( s->tasks_ind != NULL )
free( s->tasks_ind );
s->tasks_size = s->tot_cells * space_maxtaskspercell;
if ( posix_memalign( (void *)&s->tasks , 64 , sizeof(struct task) * s->tasks_size ) != 0 )
error( "Failed to allocate task list." );
if ( ( s->tasks_ind = (int *)malloc( sizeof(int) * s->tasks_size ) ) == NULL )
error( "Failed to allocate task indices." );
}
s->nr_tasks = 0;
s->tasks_next = 0;
/* Run through the highest level of cells and add pairs. */
for ( i = 0 ; i < cdim[0] ; i++ )
for ( j = 0 ; j < cdim[1] ; j++ )
for ( k = 0 ; k < cdim[2] ; k++ ) {
cid = cell_getid( cdim , i , j , k );
if ( s->cells[cid].count == 0 )
continue;
ci = &s->cells[cid];
if ( ci->count == 0 )
continue;
space_addtask( s , task_type_self , task_subtype_density , 0 , 0 , ci , NULL , 0 );
for ( ii = -1 ; ii < 2 ; ii++ ) {
iii = i + ii;
if ( !s->periodic && ( iii < 0 || iii >= cdim[0] ) )
continue;
iii = ( iii + cdim[0] ) % cdim[0];
for ( jj = -1 ; jj < 2 ; jj++ ) {
jjj = j + jj;
if ( !s->periodic && ( jjj < 0 || jjj >= cdim[1] ) )
continue;
jjj = ( jjj + cdim[1] ) % cdim[1];
for ( kk = -1 ; kk < 2 ; kk++ ) {
kkk = k + kk;
if ( !s->periodic && ( kkk < 0 || kkk >= cdim[2] ) )
continue;
kkk = ( kkk + cdim[2] ) % cdim[2];
cjd = cell_getid( cdim , iii , jjj , kkk );
cj = &s->cells[cjd];
if ( cid >= cjd || cj->count == 0 )
continue;
sid = sortlistID[ (kk+1) + 3*( (jj+1) + 3*(ii+1) ) ];
t = space_addtask( s , task_type_pair , task_subtype_density , sid , 0 , ci , cj , 1 );
}
}
}
}
/* Split the tasks. */
space_splittasks( s );
/* Count the number of tasks associated with each cell and
store the density tasks in each cell, and make each sort
depend on the sorts of its progeny. */
#pragma omp parallel for private(t,j)
for ( k = 0 ; k < s->nr_tasks ; k++ ) {
t = &s->tasks[k];
if ( t->skip )
continue;
if ( t->type == task_type_sort && t->ci->split )
for ( j = 0 ; j < 8 ; j++ ) {
if ( t->ci->progeny[j] == NULL )
continue;
if ( t->ci->progeny[j]->sorts == NULL )
t->ci->progeny[j]->sorts = space_addtask( s , task_type_sort , task_subtype_none , 0 /* t->flags? */ , 0 , t->ci , NULL , 0 );
t->ci->progeny[j]->sorts->skip = 0;
task_addunlock( t->ci->progeny[j]->sorts , t );
}
if ( t->type == task_type_self ) {
atomic_inc( &t->ci->nr_tasks );
if ( t->subtype == task_subtype_density ) {
t->ci->density[ atomic_inc( &t->ci->nr_density ) ] = t;
// t->ci->nr_density += 1;
}
}
else if ( t->type == task_type_pair ) {
atomic_inc( &t->ci->nr_tasks );
atomic_inc( &t->cj->nr_tasks );
if ( t->subtype == task_subtype_density ) {
t->ci->density[ atomic_inc( &t->ci->nr_density ) ] = t;
// t->ci->nr_density += 1;
t->cj->density[ atomic_inc( &t->cj->nr_density ) ] = t;
// t->cj->nr_density += 1;
}
}
else if ( t->type == task_type_sub ) {
atomic_inc( &t->ci->nr_tasks );
if ( t->cj != NULL )
atomic_inc( &t->cj->nr_tasks );
if ( t->subtype == task_subtype_density ) {
t->ci->density[ atomic_inc( &t->ci->nr_density ) ] = t;
// t->ci->nr_density += 1;
if ( t->cj != NULL ) {
t->cj->density[ atomic_inc( &t->cj->nr_density ) ] = t;
// t->cj->nr_density += 1;
}
}
}
}
/* Append a ghost task to each cell. */
space_map_cells_pre( s , 1 , &space_map_mkghosts , s );
/* Run through the tasks and make force tasks for each density task. */
kk = s->nr_tasks;
#pragma omp parallel for private(t,t2)
for ( k = 0 ; k < kk ; k++ ) {
/* Get a pointer to the task. */
t = &s->tasks[k];
/* Skip? */
if ( t->skip )
continue;
/* Self-interaction? */
if ( t->type == task_type_self && t->subtype == task_subtype_density ) {
task_addunlock( t , t->ci->super->ghost );
t2 = space_addtask( s , task_type_self , task_subtype_force , 0 , 0 , t->ci , NULL , 0 );
task_addunlock( t->ci->ghost , t2 );
}
/* Otherwise, pair interaction? */
else if ( t->type == task_type_pair && t->subtype == task_subtype_density ) {
task_addunlock( t , t->ci->super->ghost );
if ( t->ci->super != t->cj->super )
task_addunlock( t , t->cj->super->ghost );
t2 = space_addtask( s , task_type_pair , task_subtype_force , 0 , 0 , t->ci , t->cj , 0 );
task_addunlock( t->ci->ghost , t2 );
task_addunlock( t->cj->ghost , t2 );
}
/* Otherwise, sub interaction? */
else if ( t->type == task_type_sub && t->subtype == task_subtype_density ) {
task_addunlock( t , t->ci->super->ghost );
if ( t->cj != NULL )
task_addunlock( t , t->cj->super->ghost );
t2 = space_addtask( s , task_type_sub , task_subtype_force , t->flags , 0 , t->ci , t->cj , 0 );
task_addunlock( t->ci->ghost , t2 );
if ( t->cj != NULL )
task_addunlock( t->cj->ghost , t2 );
}
}
/* Rank the tasks. */
space_ranktasks( s );
}
/**
* @brief Split cells that contain too many particles.
*
* @param s The #space we are working in.
* @param c The #cell under consideration.
*/
void space_split ( struct space *s , struct cell *c ) {
int k, count = c->count;
float h, h_max = 0.0f, dt, dt_min = c->parts[0].dt, dt_max = dt_min;
double x[3];
struct cell *temp;
struct part *p, *parts = c->parts;
struct cpart *cp, *cparts = c->cparts;
struct xpart *xp;
/* Check the depth. */
if ( c->depth > s->maxdepth )
s->maxdepth = c->depth;
/* Split or let it be? */
if ( count > space_splitsize ) {
/* No longer just a leaf. */
c->split = 1;
/* Create the cell's progeny. */
for ( k = 0 ; k < 8 ; k++ ) {
temp = space_getcell( s );
temp->count = 0;
temp->loc[0] = c->loc[0];
temp->loc[1] = c->loc[1];
temp->loc[2] = c->loc[2];
temp->h[0] = c->h[0]/2;
temp->h[1] = c->h[1]/2;
temp->h[2] = c->h[2]/2;
temp->dmin = c->dmin/2;
if ( k & 4 )
temp->loc[0] += temp->h[0];
if ( k & 2 )
temp->loc[1] += temp->h[1];
if ( k & 1 )
temp->loc[2] += temp->h[2];
temp->depth = c->depth + 1;
temp->split = 0;
temp->h_max = 0.0;
temp->dx_max = 0.0;
temp->parent = c;
c->progeny[k] = temp;
}
/* Split the cell data. */
cell_split( c );
/* Recurse? */
// for ( k = 0 ; k < 8 ; k++ )
// space_split( s , c->progeny[k] );
/* Remove any progeny with zero parts. */
for ( k = 0 ; k < 8 ; k++ )
if ( c->progeny[k]->count == 0 ) {
space_recycle( s , c->progeny[k] );
c->progeny[k] = NULL;
}
else {
space_split( s , c->progeny[k] );
if ( c->progeny[k]->h_max > h_max )
h_max = c->progeny[k]->h_max;
if ( c->progeny[k]->dt_min < dt_min )
dt_min = c->progeny[k]->dt_min;
if ( c->progeny[k]->dt_max > dt_max )
dt_max = c->progeny[k]->dt_max;
}
c->h_max = h_max;
c->dt_min = dt_min;
c->dt_max = dt_max;
}
/* Otherwise, collect the data for this cell. */
else {
/* Clear the progeny. */
bzero( c->progeny , sizeof(struct cell *) * 8 );
c->split = 0;
/* Get dt_min/dt_max. */
for ( k = 0 ; k < count ; k++ ) {
p = &parts[k];
cp = &cparts[k];
xp = p->xtras;
xp->x_old[0] = x[0] = p->x[0];
xp->x_old[1] = x[1] = p->x[1];
xp->x_old[2] = x[2] = p->x[2];
cp->x[0] = x[0];
cp->x[1] = x[1];
cp->x[2] = x[2];
cp->h = h = p->h;
cp->dt = dt = p->dt;
if ( h > h_max )
h_max = h;
if ( dt < dt_min )
dt_min = dt;
if ( dt > dt_max )
dt_max = dt;
}
c->h_max = h_max;
c->dt_min = dt_min;
c->dt_max = dt_max;
}
}
void space_split_old ( struct space *s , struct cell *c ) {
int k, count;
double h, h_limit, h_max = 0.0, dt_min = c->parts[0].dt, dt_max = dt_min;
struct cell *temp;
/* Check the depth. */
if ( c->depth > s->maxdepth )
s->maxdepth = c->depth;
/* Set the minimum cutoff. */
h_limit = fmin( c->h[0] , fmin( c->h[1] , c->h[2] ) ) / 2;
/* Count the particles below that. */
for ( count = 0 , k = 0 ; k < c->count ; k++ ) {
h = c->parts[k].h;
if ( h <= h_limit )
count += 1;
if ( h > h_max )
h_max = h;
if ( c->parts[k].dt < dt_min )
dt_min = c->parts[k].dt;
if ( c->parts[k].dt > dt_max )
dt_max = c->parts[k].dt;
}
c->h_max = h_max;
c->dt_min = dt_min;
c->dt_max = dt_max;
/* Split or let it be? */
if ( count > c->count*space_splitratio && c->count > space_splitsize ) {
/* No longer just a leaf. */
c->split = 1;
/* Create the cell's progeny. */
for ( k = 0 ; k < 8 ; k++ ) {
temp = space_getcell( s );
temp->count = 0;
temp->loc[0] = c->loc[0];
temp->loc[1] = c->loc[1];
temp->loc[2] = c->loc[2];
temp->h[0] = c->h[0]/2;
temp->h[1] = c->h[1]/2;
temp->h[2] = c->h[2]/2;
temp->dmin = c->dmin/2;
if ( k & 4 )
temp->loc[0] += temp->h[0];
if ( k & 2 )
temp->loc[1] += temp->h[1];
if ( k & 1 )
temp->loc[2] += temp->h[2];
temp->depth = c->depth + 1;
temp->split = 0;
temp->h_max = 0.0;
temp->dx_max = 0.0;
temp->parent = c;
c->progeny[k] = temp;
}
/* Split the cell data. */
cell_split( c );
/* Recurse? */
// for ( k = 0 ; k < 8 ; k++ )
// space_split( s , c->progeny[k] );
/* Remove any progeny with zero parts. */
for ( k = 0 ; k < 8 ; k++ )
if ( c->progeny[k]->count == 0 ) {
space_recycle( s , c->progeny[k] );
c->progeny[k] = NULL;
}
else
space_split( s , c->progeny[k] );
}
/* Otherwise, set the progeny to null. */
else {
bzero( c->progeny , sizeof(struct cell *) * 8 );
c->split = 0;
}
}
/**
* @brief Return a used cell to the cell buffer.
*
* @param s The #space.
* @param c The #cell.
*/
void space_recycle ( struct space *s , struct cell *c ) {
/* Lock the space. */
lock_lock( &s->lock );
/* Clear the cell. */
if ( lock_destroy( &c->lock ) != 0 )
error( "Failed to destroy spinlock." );
/* Clear this cell's sort arrays. */
if ( c->sort != NULL )
free( c->sort );
/* Clear the cell data. */
bzero( c , sizeof(struct cell) );
/* Hook this cell into the buffer. */
c->next = s->cells_new;
s->cells_new = c;
s->tot_cells -= 1;
/* Unlock the space. */
lock_unlock_blind( &s->lock );
}
/**
* @brief Get a new empty cell.
*
* @param s The #space.
*/
struct cell *space_getcell ( struct space *s ) {
struct cell *c;
int k;
/* Lock the space. */
lock_lock( &s->lock );
/* Is the buffer empty? */
if ( s->cells_new == NULL ) {
if ( posix_memalign( (void *)&s->cells_new , 64 , space_cellallocchunk * sizeof(struct cell) ) != 0 )
error( "Failed to allocate more cells." );
bzero( s->cells_new , space_cellallocchunk * sizeof(struct cell) );
for ( k = 0 ; k < space_cellallocchunk-1 ; k++ )
s->cells_new[k].next = &s->cells_new[k+1];
s->cells_new[ space_cellallocchunk-1 ].next = NULL;
}
/* Pick off the next cell. */
c = s->cells_new;
s->cells_new = c->next;
s->tot_cells += 1;
/* Init some things in the cell. */
bzero( c , sizeof(struct cell) );
if ( lock_init( &c->lock ) != 0 )
error( "Failed to initialize cell spinlock." );
/* Unlock the space. */
lock_unlock_blind( &s->lock );
return c;
}
/**
* @brief Split the space into cells given the array of particles.
*
* @param s The #space to initialize.
* @param dim Spatial dimensions of the domain.
* @param parts Pointer to an array of #part.
* @param N The number of parts in the space.
* @param periodic flag whether the domain is periodic or not.
* @param h_max The maximal interaction radius.
*
* Makes a grid of edge length > r_max and fills the particles
* into the respective cells. Cells containing more than #space_maxppc
* parts with a cutoff below half the cell width are then split
* recursively.
*/
void space_init ( struct space *s , double dim[3] , struct part *parts , int N , int periodic , double h_max ) {
int k;
/* Store eveything in the space. */
s->dim[0] = dim[0]; s->dim[1] = dim[1]; s->dim[2] = dim[2];
s->periodic = periodic;
s->nr_parts = N;
s->parts = parts;
s->cell_min = h_max;
/* Allocate the cparts array. */
if ( posix_memalign( (void *)&s->cparts , 32 , N * sizeof(struct cpart) ) != 0 )
error( "Failed to allocate cparts." );
/* Allocate and link the xtra parts array. */
if ( posix_memalign( (void *)&s->xparts , 32 , N * sizeof(struct xpart) ) != 0 )
error( "Failed to allocate xparts." );
for ( k = 0 ; k < N ; k++ )
s->parts[k].xtras = &s->xparts[k];
/* Init the space lock. */
if ( lock_init( &s->lock ) != 0 )
error( "Failed to create space spin-lock." );
/* Build the cells and the tasks. */
space_rebuild( s , h_max );
}