space.c 26.8 KB
Newer Older
Pedro Gonnet's avatar
Pedro Gonnet committed
1
/*******************************************************************************
2
 * This file is part of SWIFT.
Pedro Gonnet's avatar
Pedro Gonnet committed
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
 * 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 <http://www.gnu.org/licenses/>.
 * 
 ******************************************************************************/

/* Config parameters. */
#include "../config.h"

/* Some standard headers. */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <pthread.h>
#include <float.h>
#include <limits.h>
#include <math.h>
31
#include <omp.h>
Pedro Gonnet's avatar
Pedro Gonnet committed
32
33
34

/* Local headers. */
#include "cycle.h"
35
#include "atomic.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
36
#include "lock.h"
37
#include "task.h"
38
#include "kernel.h"
39
40
#include "part.h"
#include "cell.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
41
42
#include "space.h"
#include "runner.h"
43
#include "error.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
44
45
46

/* Split size. */
int space_splitsize = space_splitsize_default;
47
int space_subsize = space_subsize_default;
Pedro Gonnet's avatar
Pedro Gonnet committed
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78

/* 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 
    };
79
80
    
    
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
/**
 * @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;

    }


129
/**
130
 * @brief Recursively dismantle a cell tree.
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
 *
 */
 
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;
                }
    
    }

/**
149
 * @brief Re-build the cells as well as the tasks.
150
151
 *
 * @param s The #space in which to update the cells.
152
 * @param cell_max Maximal cell size.
153
154
155
 *
 */
 
156
void space_rebuild ( struct space *s , double cell_max ) {
157

158
    float h_max = s->cell_min / kernel_gamma, dmin;
159
    int i, j, k, cdim[3], nr_parts = s->nr_parts;
160
    struct cell *restrict c;
161
    struct part *restrict finger, *restrict p, *parts = s->parts;
162
    struct xpart *xfinger, *xparts = s->xparts;
163
    int *ind;
Pedro Gonnet's avatar
Pedro Gonnet committed
164
    double ih[3], dim[3];
165
    // ticks tic;
166
    
167
    /* Be verbose about this. */
168
    // printf( "space_rebuild: (re)building space...\n" ); fflush(stdout);
169
    
170
    /* Run through the parts and get the current h_max. */
171
    // tic = getticks();
172
173
174
175
176
177
178
179
180
181
182
183
    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;
184
        }
185
    // printf( "space_rebuild: h_max is %.3e (cell_max=%.3e).\n" , h_max , cell_max );
186
    // printf( "space_rebuild: getting h_min and h_max took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
187
188
189
    
    /* Get the new putative cell dimensions. */
    for ( k = 0 ; k < 3 ; k++ )
190
        cdim[k] = floor( s->dim[k] / fmax( h_max*kernel_gamma*space_stretch , cell_max ) );
191
192
        
    /* Do we need to re-build the upper-level cells? */
193
    // tic = getticks();
Pedro Gonnet's avatar
Pedro Gonnet committed
194
    if ( s->cells == NULL ||
195
         cdim[0] < s->cdim[0] || cdim[1] < s->cdim[1] || cdim[2] < s->cdim[2] ) {
196
197
198
    
        /* Free the old cells, if they were allocated. */
        if ( s->cells != NULL ) {
199
            for ( k = 0 ; k < s->nr_cells ; k++ ) {
200
                space_rebuild_recycle( s , &s->cells[k] );
201
202
203
                if ( s->cells[k].sort != NULL )
                    free( s->cells[k].sort );
                }
204
205
206
207
            free( s->cells );
            s->maxdepth = 0;
            }
            
208
        /* Set the new cell dimensions only if smaller. */
209
210
211
212
213
        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];
            }
214
        dmin = fminf( s->h[0] , fminf( s->h[1] , s->h[2] ) );
215

216
        /* Allocate the highest level of cells. */
Pedro Gonnet's avatar
Pedro Gonnet committed
217
        s->tot_cells = s->nr_cells = cdim[0] * cdim[1] * cdim[2];
218
219
220
221
222
223
224
225
226
227
228
229
230
231
        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];
232
                    c->dmin = dmin;
233
                    c->depth = 0;
Pedro Gonnet's avatar
Pedro Gonnet committed
234
                    c->count = 0;
235
                    lock_init( &c->lock );
236
                    }
237
238
239
           
        /* Be verbose about the change. */         
        printf( "space_rebuild: set cell dimensions to [ %i %i %i ].\n" , cdim[0] , cdim[1] , cdim[2] ); fflush(stdout);
240
241
                    
        } /* re-build upper-level cells? */
242
    // printf( "space_rebuild: rebuilding upper-level cells took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
243
        
Pedro Gonnet's avatar
Pedro Gonnet committed
244
245
246
247
248
249
250
251
252
253
    /* 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;
254
            s->cells[k].sorted = 0;
Pedro Gonnet's avatar
Pedro Gonnet committed
255
            s->cells[k].count = 0;
256
            s->cells[k].kick1 = NULL;
Pedro Gonnet's avatar
Pedro Gonnet committed
257
            s->cells[k].kick2 = NULL;
Pedro Gonnet's avatar
Pedro Gonnet committed
258
259
260
261
            }
        s->maxdepth = 0;
    
        }
262
263
        
    /* Run through the particles and get their cell index. */
264
    // tic = getticks();
265
266
    if ( ( ind = (int *)malloc( sizeof(int) * s->nr_parts ) ) == NULL )
        error( "Failed to allocate temporary particle indices." );
Pedro Gonnet's avatar
Pedro Gonnet committed
267
268
    ih[0] = s->ih[0]; ih[1] = s->ih[1]; ih[2] = s->ih[2];
    dim[0] = s->dim[0]; dim[1] = s->dim[1]; dim[2] = s->dim[2];
Pedro Gonnet's avatar
Pedro Gonnet committed
269
    cdim[0] = s->cdim[0]; cdim[1] = s->cdim[1]; cdim[2] = s->cdim[2];
270
    #pragma omp parallel for private(p,j)
271
272
    for ( k = 0 ; k < nr_parts ; k++ )  {
        p = &parts[k];
273
274
        for ( j = 0 ; j < 3 ; j++ )
            if ( p->x[j] < 0.0 )
Pedro Gonnet's avatar
Pedro Gonnet committed
275
276
277
278
                p->x[j] += dim[j];
            else if ( p->x[j] >= dim[j] )
                p->x[j] -= dim[j];
        ind[k] = cell_getid( cdim , p->x[0]*ih[0] , p->x[1]*ih[1] , p->x[2]*ih[2] );
279
        atomic_inc( &s->cells[ ind[k] ].count );
280
        }
281
    // printf( "space_rebuild: getting particle indices took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
282
283

    /* Sort the parts according to their cells. */
284
    // tic = getticks();
285
    parts_sort( parts , xparts , ind , s->nr_parts , 0 , s->nr_cells-1 );
286
    // printf( "space_rebuild: parts_sort took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
287
    
Pedro Gonnet's avatar
Pedro Gonnet committed
288
289
290
291
292
293
294
295
296
    /* Verify sort. */
    /* for ( k = 1 ; k < nr_parts ; k++ ) {
        if ( ind[k-1] > ind[k] ) {
            error( "Sort failed!" );
            }
        else if ( ind[k] != cell_getid( cdim , parts[k].x[0]*ih[0] , parts[k].x[1]*ih[1] , parts[k].x[2]*ih[2] ) )
            error( "Incorrect indices!" );
        } */
    
297
298
    /* We no longer need the indices as of here. */
    free( ind );    
299
300

    /* Hook the cells up to the parts. */
301
    // tic = getticks();
302
303
    finger = parts;
    xfinger = xparts;
304
    for ( k = 0 ; k < s->nr_cells ; k++ ) {
305
306
        c = &s->cells[ k ];
        c->parts = finger;
307
        c->xparts = xfinger;
308
        finger = &finger[ c->count ];
309
        xfinger = &xfinger[ c->count ];
310
        }
311
    // printf( "space_rebuild: hooking up cells took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
312
        
313
314
    /* At this point, we have the upper-level cells, old or new. Now make
       sure that the parts in each cell are ok. */
315
    // tic = getticks();
Pedro Gonnet's avatar
Pedro Gonnet committed
316
    k = 0;
317
    #pragma omp parallel shared(s,k)
Pedro Gonnet's avatar
Pedro Gonnet committed
318
    {
319
320
321
322
323
324
325
326
        if ( omp_get_thread_num() < 8 )
            while ( 1 ) {
                int myk = atomic_inc( &k );
                if ( myk < s->nr_cells )
                    space_split( s , &s->cells[myk] );
                else
                    break;
                }
Pedro Gonnet's avatar
Pedro Gonnet committed
327
        }
328
    // printf( "space_rebuild: space_split took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
329
330
331
332
        
    }


333
/**
334
 * @brief Sort the particles and condensed particles according to the given indices.
335
336
337
338
339
340
341
342
 *
 * @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.
 */
 
343
void parts_sort ( struct part *parts , struct xpart *xparts , int *ind , int N , int min , int max ) {
344

345
    struct {
346
347
        int i, j, min, max;
        volatile int ready;
348
        } qstack[space_qstack];
349
    volatile unsigned int first, last, waiting;
350
351
352
    
    int pivot;
    int i, ii, j, jj, temp_i, qid;
353
    struct part temp_p;
354
    struct xpart temp_xp;
355
    
356
357
358
359
360
    /* Init the interval stack. */
    qstack[0].i = 0;
    qstack[0].j = N-1;
    qstack[0].min = min;
    qstack[0].max = max;
361
362
363
364
    qstack[0].ready = 1;
    for ( i = 1 ; i < space_qstack ; i++ )
        qstack[i].ready = 0;
    first = 0; last = 1; waiting = 1;
365
366
    
    /* Parallel bit. */
367
    #pragma omp parallel default(none) shared(first,last,waiting,qstack,parts,xparts,ind) private(pivot,i,ii,j,jj,min,max,temp_i,qid,temp_xp,temp_p)
368
    {
369
    
370
        /* Main loop. */
371
        if ( omp_get_thread_num() < 8 )
372
373
        while ( waiting > 0 ) {
        
374
375
            /* Grab an interval off the queue. */
            qid = atomic_inc( &first ) % space_qstack;
376
            
377
            /* Wait for the interval to be ready. */
378
            while ( waiting > 0 && atomic_cas( &qstack[qid].ready , 1 , 1 ) != 1 );
379
380
381
382
383
            
            /* Broke loop for all the wrong reasons? */
            if ( waiting == 0 )
                break;
        
384
385
386
387
388
            /* Get the stack entry. */
            i = qstack[qid].i;
            j = qstack[qid].j;
            min = qstack[qid].min;
            max = qstack[qid].max;
389
            qstack[qid].ready = 0;
390
391
            // printf( "parts_sort_par: thread %i got interval [%i,%i] with values in [%i,%i].\n" , omp_get_thread_num() , i , j , min , max );
            
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
            /* Loop over sub-intervals. */
            while ( 1 ) {
            
                /* Bring beer. */
                pivot = (min + max) / 2;
                
                /* One pass of QuickSort's partitioning. */
                ii = i; jj = j;
                while ( ii < jj ) {
                    while ( ii <= j && ind[ii] <= pivot )
                        ii++;
                    while ( jj >= i && ind[jj] > pivot )
                        jj--;
                    if ( ii < jj ) {
                        temp_i = ind[ii]; ind[ii] = ind[jj]; ind[jj] = temp_i;
                        temp_p = parts[ii]; parts[ii] = parts[jj]; parts[jj] = temp_p;
408
                        temp_xp = xparts[ii]; xparts[ii] = xparts[jj]; xparts[jj] = temp_xp;
409
                        }
410
                    }
411

412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
                /* Verify sort. */
                /* for ( int k = i ; k <= jj ; 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( "Partition failed (<=pivot)." );
                        }
                for ( int k = jj+1 ; 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( "Partition failed (>pivot)." );
                        } */
                        
                /* Split-off largest interval. */
                if ( jj - i > j - jj+1 ) {

                    /* Recurse on the left? */
                    if ( jj > i  && pivot > min ) {
                        qid = atomic_inc( &last ) % space_qstack;
430
                        while ( atomic_cas( &qstack[qid].ready , 0 , 0 ) != 0 );
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
                        qstack[qid].i = i;
                        qstack[qid].j = jj;
                        qstack[qid].min = min;
                        qstack[qid].max = pivot;
                        qstack[qid].ready = 1;
                        atomic_inc( &waiting );
                        }

                    /* Recurse on the right? */
                    if ( jj+1 < j && pivot+1 < max ) {
                        i = jj+1;
                        min = pivot+1;
                        }
                    else
                        break;
                        
447
                    }
448
449
450
451
452
453
                    
                else {
                
                    /* Recurse on the right? */
                    if ( jj+1 < j && pivot+1 < max ) {
                        qid = atomic_inc( &last ) % space_qstack;
454
                        while ( atomic_cas( &qstack[qid].ready , 0 , 0 ) != 0 );
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
                        qstack[qid].i = jj+1;
                        qstack[qid].j = j;
                        qstack[qid].min = pivot+1;
                        qstack[qid].max = max;
                        qstack[qid].ready = 1;
                        atomic_inc( &waiting );
                        }
                        
                    /* Recurse on the left? */
                    if ( jj > i  && pivot > min ) {
                        j = jj;
                        max = pivot;
                        }
                    else
                        break;
470

471
472
473
                    }
                    
                } /* loop over sub-intervals. */
474
    
475
            atomic_dec( &waiting );
476

477
478
479
            } /* main loop. */
    
        } /* parallel bit. */
480
    
481
    /* Verify sort. */
482
    /* for ( i = 1 ; i < N ; i++ )
483
        if ( ind[i-1] > ind[i] )
484
            error( "Sorting failed!" ); */
485

486
487
488
    }


Pedro Gonnet's avatar
Pedro Gonnet committed
489
/**
490
 * @brief Mapping function to free the sorted indices buffers.
Pedro Gonnet's avatar
Pedro Gonnet committed
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
 */

void space_map_clearsort ( struct cell *c , void *data ) {

    if ( c->sort != NULL ) {
        free( c->sort );
        c->sort = NULL;
        }

    }


/**
 * @brief Map a function to all particles in a aspace.
 *
 * @param s The #space we are working in.
507
508
 * @param fun Function pointer to apply on the cells.
 * @param data Data passed to the function fun.
Pedro Gonnet's avatar
Pedro Gonnet committed
509
510
511
512
 */
 
void space_map_parts ( struct space *s , void (*fun)( struct part *p , struct cell *c , void *data ) , void *data ) {

Pedro Gonnet's avatar
bug.    
Pedro Gonnet committed
513
    int cid = 0;
Pedro Gonnet's avatar
Pedro Gonnet committed
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532

    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. */
533
534
535
536
537
538
539
    #pragma omp parallel shared(cid)
    {
        int mycid;
        while ( 1 ) {
            #pragma omp critical
            mycid = cid++;
            if ( mycid < s->nr_cells )
Pedro Gonnet's avatar
bug.    
Pedro Gonnet committed
540
                rec_map( &s->cells[mycid] );
541
542
543
544
            else
                break;
            }
        }
Pedro Gonnet's avatar
Pedro Gonnet committed
545
546
547
548
549
550
551
552

    }


/**
 * @brief Map a function to all particles in a aspace.
 *
 * @param s The #space we are working in.
553
 * @param full Map to all cells, including cells with sub-cells.
554
555
 * @param fun Function pointer to apply on the cells.
 * @param data Data passed to the function fun.
Pedro Gonnet's avatar
Pedro Gonnet committed
556
557
 */
 
558
559
void space_map_cells_post ( struct space *s , int full , void (*fun)( struct cell *c , void *data ) , void *data ) {

Pedro Gonnet's avatar
bug.    
Pedro Gonnet committed
560
    int cid = 0;
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578

    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. */
579
    // #pragma omp parallel shared(s,cid)
580
581
582
    {
        int mycid;
        while ( 1 ) {
583
            // #pragma omp critical
584
585
            mycid = cid++;
            if ( mycid < s->nr_cells )
Pedro Gonnet's avatar
bug.    
Pedro Gonnet committed
586
                rec_map( &s->cells[mycid] );
587
588
589
590
            else
                break;
            }
        }
591
592
593
594
595

    }


void space_map_cells_pre ( struct space *s , int full , void (*fun)( struct cell *c , void *data ) , void *data ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
596

Pedro Gonnet's avatar
bug.    
Pedro Gonnet committed
597
    int cid = 0;
Pedro Gonnet's avatar
Pedro Gonnet committed
598
599
600
601
602
603

    void rec_map ( struct cell *c ) {
    
        int k;
        
        /* No progeny? */
604
        if ( full || !c->split )
Pedro Gonnet's avatar
Pedro Gonnet committed
605
606
            fun( c , data );
                
607
608
        /* Recurse. */
        if ( c->split )
Pedro Gonnet's avatar
Pedro Gonnet committed
609
610
611
612
613
614
615
            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. */
616
    // #pragma omp parallel shared(s,cid)
Pedro Gonnet's avatar
Pedro Gonnet committed
617
618
619
    {
        int mycid;
        while ( 1 ) {
620
            // #pragma omp critical
Pedro Gonnet's avatar
Pedro Gonnet committed
621
622
            mycid = cid++;
            if ( mycid < s->nr_cells )
Pedro Gonnet's avatar
bug.    
Pedro Gonnet committed
623
                rec_map( &s->cells[mycid] );
Pedro Gonnet's avatar
Pedro Gonnet committed
624
625
626
627
            else
                break;
            }
        }
Pedro Gonnet's avatar
Pedro Gonnet committed
628
629
630
631
632
633
634
635
636
637
638
639
640

    }


/**
 * @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 ) {

Pedro Gonnet's avatar
Pedro Gonnet committed
641
    int k, count = c->count, maxdepth = 0;
642
643
644
    float h, h_max = 0.0f, dt, dt_min = c->parts[0].dt, dt_max = dt_min;
    struct cell *temp;
    struct part *p, *parts = c->parts;
645
    struct xpart *xp, *xparts = c->xparts;
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
    
    /* 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 );
            
        /* 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] );
Pedro Gonnet's avatar
Pedro Gonnet committed
693
694
695
696
697
                h_max = fmaxf( h_max , c->progeny[k]->h_max );
                dt_min = fminf( dt_min , c->progeny[k]->dt_min );
                dt_max = fmaxf( dt_max , c->progeny[k]->dt_max );
                if ( c->progeny[k]->maxdepth > maxdepth )
                    maxdepth = c->progeny[k]->maxdepth;
698
                }
699
700
701
702
703
704
                
        /* Set the values for this cell. */
        c->h_max = h_max;
        c->dt_min = dt_min;
        c->dt_max = dt_max;
        c->maxdepth = maxdepth;
705
706
707
708
709
710
711
712
713
                
        }
        
    /* Otherwise, collect the data for this cell. */
    else {
    
        /* Clear the progeny. */
        bzero( c->progeny , sizeof(struct cell *) * 8 );
        c->split = 0;
Pedro Gonnet's avatar
Pedro Gonnet committed
714
        c->maxdepth = c->depth;
715
716
717
718
719
        
        /* Get dt_min/dt_max. */
        
        for ( k = 0 ; k < count ; k++ ) {
            p = &parts[k];
720
            xp = &xparts[k];
Pedro Gonnet's avatar
Pedro Gonnet committed
721
722
723
            xp->x_old[0] = p->x[0];
            xp->x_old[1] = p->x[1];
            xp->x_old[2] = p->x[2];
Pedro Gonnet's avatar
Pedro Gonnet committed
724
            dt = p->dt;
725
            h = p->h;
726
727
728
729
730
731
732
733
734
735
736
737
            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;
            
        }
738
739
740
        
    /* Set ownership accorind to the start of the parts array. */
    c->owner = ( c->parts - s->parts ) * s->nr_queues / s->nr_parts;
741
742
743
744

    }


Pedro Gonnet's avatar
Pedro Gonnet committed
745
746
747
748
749
750
751
752
753
/**
 * @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 ) {

754
755
756
    /* Lock the space. */
    lock_lock( &s->lock );
    
Pedro Gonnet's avatar
Pedro Gonnet committed
757
758
759
    /* Clear the cell. */
    if ( lock_destroy( &c->lock ) != 0 )
        error( "Failed to destroy spinlock." );
760
761
762
763
        
    /* Clear this cell's sort arrays. */
    if ( c->sort != NULL )
        free( c->sort );
764
765
766
        
    /* Clear the cell data. */
    bzero( c , sizeof(struct cell) );
Pedro Gonnet's avatar
Pedro Gonnet committed
767
768
769
770
771
772
    
    /* Hook this cell into the buffer. */
    c->next = s->cells_new;
    s->cells_new = c;
    s->tot_cells -= 1;
    
773
774
775
    /* Unlock the space. */
    lock_unlock_blind( &s->lock );
    
Pedro Gonnet's avatar
Pedro Gonnet committed
776
777
778
779
780
781
782
783
784
785
786
787
788
789
    }


/**
 * @brief Get a new empty cell.
 *
 * @param s The #space.
 */
 
struct cell *space_getcell ( struct space *s ) {

    struct cell *c;
    int k;
    
790
791
792
    /* Lock the space. */
    lock_lock( &s->lock );
    
Pedro Gonnet's avatar
Pedro Gonnet committed
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
    /* 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;
    
808
809
810
    /* Unlock the space. */
    lock_unlock_blind( &s->lock );
    
Pedro Gonnet's avatar
Pedro Gonnet committed
811
    /* Init some things in the cell. */
812
813
814
815
816
817
818
819
    c->sorts = NULL;
    c->nr_tasks = 0;
    c->nr_density = 0;
    c->dx_max = 0.0f;
    c->sorted = 0;
    c->count = 0;
    c->kick1 = NULL;
    c->kick2 = NULL;
820
821
    if ( lock_init( &c->lock ) != 0 )
        error( "Failed to initialize cell spinlock." );
822
    c->owner = -1;
Pedro Gonnet's avatar
Pedro Gonnet committed
823
824
825
826
827
828
829
830
831
        
    return c;

    }


/**
 * @brief Split the space into cells given the array of particles.
 *
832
 * @param s The #space to initialize.
Pedro Gonnet's avatar
Pedro Gonnet committed
833
834
835
836
 * @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.
837
 * @param h_max The maximal interaction radius.
Pedro Gonnet's avatar
Pedro Gonnet committed
838
839
840
841
842
843
844
845
 *
 * 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.
 */


Pedro Gonnet's avatar
Pedro Gonnet committed
846
void space_init ( struct space *s , double dim[3] , struct part *parts , int N , int periodic , double h_max ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
847
848
849
850
851

    /* 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;
852
    s->parts = parts;
853
    s->cell_min = h_max;
854
    s->nr_queues = 1;
855
    
856
    /* Allocate the xtra parts array. */
857
858
    if ( posix_memalign( (void *)&s->xparts , 32 , N * sizeof(struct xpart) ) != 0 )
        error( "Failed to allocate xparts." );
859
860
861
862
863
864
865
866
867
868
869
    bzero( s->xparts , N * sizeof(struct xpart) );
    
    /* Initialize the velocities and internal energies. */
    for ( int k = 0 ; k < N ; k++ ) {
        struct part *p = &parts[k];
        struct xpart *xp = &s->xparts[k];
        xp->v_hdt[0] = p->v[0];
        xp->v_hdt[1] = p->v[1];
        xp->v_hdt[2] = p->v[2];
        xp->u_hdt = p->u;
        }
870
        
871
872
873
    /* Init the space lock. */
    if ( lock_init( &s->lock ) != 0 )
        error( "Failed to create space spin-lock." );
Pedro Gonnet's avatar
Pedro Gonnet committed
874
    
875
    /* Build the cells and the tasks. */
876
    space_rebuild( s , h_max );
Pedro Gonnet's avatar
Pedro Gonnet committed
877
878
879
        
    }