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

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

    /* Sort the parts according to their cells. */
283
    // tic = getticks();
Pedro Gonnet's avatar
Pedro Gonnet committed
284
    parts_sort( parts , ind , s->nr_parts , 0 , s->nr_cells-1 );
285
    // printf( "space_rebuild: parts_sort took %.3f ms.\n" , (double)(getticks() - tic) / CPU_TPS * 1000 );
286
    
Pedro Gonnet's avatar
Pedro Gonnet committed
287
288
289
290
291
292
293
294
295
    /* 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!" );
        } */
    
296
297
    /* We no longer need the indices as of here. */
    free( ind );    
298
299

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


328
/**
329
 * @brief Sort the particles and condensed particles according to the given indices.
330
331
332
333
334
335
336
337
 *
 * @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.
 */
 
338
void parts_sort ( struct part *parts , int *ind , int N , int min , int max ) {
339

340
    struct {
341
        int i, j, min, max, ready;
342
        } qstack[space_qstack];
343
    volatile int first, last, waiting;
344
345
346
    
    int pivot;
    int i, ii, j, jj, temp_i, qid;
347
348
    struct part temp_p;
    
349
350
351
352
353
    /* Init the interval stack. */
    qstack[0].i = 0;
    qstack[0].j = N-1;
    qstack[0].min = min;
    qstack[0].max = max;
354
355
356
357
    qstack[0].ready = 1;
    for ( i = 1 ; i < space_qstack ; i++ )
        qstack[i].ready = 0;
    first = 0; last = 1; waiting = 1;
358
359
    
    /* Parallel bit. */
360
    #pragma omp parallel num_threads(8) default(shared) private(pivot,i,ii,j,jj,min,max,temp_i,qid,temp_p)
361
    {
362
    
363
364
365
        /* Main loop. */
        while ( waiting > 0 ) {
        
366
367
            /* Grab an interval off the queue. */
            qid = atomic_inc( &first ) % space_qstack;
368
            
369
370
371
372
373
374
375
            /* Wait for the interval to be ready. */
            while ( waiting > 0 && atomic_cas( &qstack[qid].ready , 1 , 0 ) != 1 );
            
            /* Broke loop for all the wrong reasons? */
            if ( waiting == 0 )
                break;
        
376
377
378
379
380
381
382
            /* Get the stack entry. */
            i = qstack[qid].i;
            j = qstack[qid].j;
            min = qstack[qid].min;
            max = qstack[qid].max;
            // printf( "parts_sort_par: thread %i got interval [%i,%i] with values in [%i,%i].\n" , omp_get_thread_num() , i , j , min , max );
            
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
            /* 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;
                        }
400
                    }
401

402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
                /* 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;
                        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;
                        
436
                    }
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
                    
                else {
                
                    /* Recurse on the right? */
                    if ( jj+1 < j && pivot+1 < max ) {
                        qid = atomic_inc( &last ) % space_qstack;
                        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;
458

459
460
461
                    }
                    
                } /* loop over sub-intervals. */
462
    
463
            atomic_dec( &waiting );
464

465
466
467
            } /* main loop. */
    
        } /* parallel bit. */
468
    
469
    /* Verify sort. */
470
    /* for ( i = 1 ; i < N ; i++ )
471
        if ( ind[i-1] > ind[i] )
472
            error( "Sorting failed!" ); */
473

474
475
476
    }


Pedro Gonnet's avatar
Pedro Gonnet committed
477
/**
478
 * @brief Mapping function to free the sorted indices buffers.
Pedro Gonnet's avatar
Pedro Gonnet committed
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
 */

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.
495
496
 * @param fun Function pointer to apply on the cells.
 * @param data Data passed to the function fun.
Pedro Gonnet's avatar
Pedro Gonnet committed
497
498
499
500
 */
 
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
501
    int cid = 0;
Pedro Gonnet's avatar
Pedro Gonnet committed
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520

    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. */
521
522
523
524
525
526
527
    #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
528
                rec_map( &s->cells[mycid] );
529
530
531
532
            else
                break;
            }
        }
Pedro Gonnet's avatar
Pedro Gonnet committed
533
534
535
536
537
538
539
540

    }


/**
 * @brief Map a function to all particles in a aspace.
 *
 * @param s The #space we are working in.
541
 * @param full Map to all cells, including cells with sub-cells.
542
543
 * @param fun Function pointer to apply on the cells.
 * @param data Data passed to the function fun.
Pedro Gonnet's avatar
Pedro Gonnet committed
544
545
 */
 
546
547
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
548
    int cid = 0;
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566

    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. */
567
    // #pragma omp parallel shared(s,cid)
568
569
570
    {
        int mycid;
        while ( 1 ) {
571
            // #pragma omp critical
572
573
            mycid = cid++;
            if ( mycid < s->nr_cells )
Pedro Gonnet's avatar
bug.    
Pedro Gonnet committed
574
                rec_map( &s->cells[mycid] );
575
576
577
578
            else
                break;
            }
        }
579
580
581
582
583

    }


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
584

Pedro Gonnet's avatar
bug.    
Pedro Gonnet committed
585
    int cid = 0;
Pedro Gonnet's avatar
Pedro Gonnet committed
586
587
588
589
590
591

    void rec_map ( struct cell *c ) {
    
        int k;
        
        /* No progeny? */
592
        if ( full || !c->split )
Pedro Gonnet's avatar
Pedro Gonnet committed
593
594
            fun( c , data );
                
595
596
        /* Recurse. */
        if ( c->split )
Pedro Gonnet's avatar
Pedro Gonnet committed
597
598
599
600
601
602
603
            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. */
604
    // #pragma omp parallel shared(s,cid)
Pedro Gonnet's avatar
Pedro Gonnet committed
605
606
607
    {
        int mycid;
        while ( 1 ) {
608
            // #pragma omp critical
Pedro Gonnet's avatar
Pedro Gonnet committed
609
610
            mycid = cid++;
            if ( mycid < s->nr_cells )
Pedro Gonnet's avatar
bug.    
Pedro Gonnet committed
611
                rec_map( &s->cells[mycid] );
Pedro Gonnet's avatar
Pedro Gonnet committed
612
613
614
615
            else
                break;
            }
        }
Pedro Gonnet's avatar
Pedro Gonnet committed
616
617
618
619
620
621
622
623
624
625
626
627
628

    }


/**
 * @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
629
    int k, count = c->count, maxdepth = 0;
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
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
    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 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 );
            
        /* 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
682
683
684
685
686
                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;
687
688
689
690
                }
            c->h_max = h_max;
            c->dt_min = dt_min;
            c->dt_max = dt_max;
Pedro Gonnet's avatar
Pedro Gonnet committed
691
            c->maxdepth = maxdepth;
692
693
694
695
696
697
698
699
700
                
        }
        
    /* 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
701
        c->maxdepth = c->depth;
702
703
704
705
706
707
708
709
710
        
        /* Get dt_min/dt_max. */
        
        for ( k = 0 ; k < count ; k++ ) {
            p = &parts[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];
Pedro Gonnet's avatar
Pedro Gonnet committed
711
            dt = p->dt;
712
            h = p->h;
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
            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;
            
        }

    }


Pedro Gonnet's avatar
Pedro Gonnet committed
729
730
731
732
733
734
735
736
737
/**
 * @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 ) {

738
739
740
    /* Lock the space. */
    lock_lock( &s->lock );
    
Pedro Gonnet's avatar
Pedro Gonnet committed
741
742
743
    /* Clear the cell. */
    if ( lock_destroy( &c->lock ) != 0 )
        error( "Failed to destroy spinlock." );
744
745
746
747
        
    /* Clear this cell's sort arrays. */
    if ( c->sort != NULL )
        free( c->sort );
748
749
750
        
    /* Clear the cell data. */
    bzero( c , sizeof(struct cell) );
Pedro Gonnet's avatar
Pedro Gonnet committed
751
752
753
754
755
756
    
    /* Hook this cell into the buffer. */
    c->next = s->cells_new;
    s->cells_new = c;
    s->tot_cells -= 1;
    
757
758
759
    /* Unlock the space. */
    lock_unlock_blind( &s->lock );
    
Pedro Gonnet's avatar
Pedro Gonnet committed
760
761
762
763
764
765
766
767
768
769
770
771
772
773
    }


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

    struct cell *c;
    int k;
    
774
775
776
    /* Lock the space. */
    lock_lock( &s->lock );
    
Pedro Gonnet's avatar
Pedro Gonnet committed
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
    /* 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;
    
792
793
794
    /* Unlock the space. */
    lock_unlock_blind( &s->lock );
    
Pedro Gonnet's avatar
Pedro Gonnet committed
795
    /* Init some things in the cell. */
796
797
798
799
800
801
802
803
    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;
804
805
    if ( lock_init( &c->lock ) != 0 )
        error( "Failed to initialize cell spinlock." );
806
    c->owner = -1;
Pedro Gonnet's avatar
Pedro Gonnet committed
807
808
809
810
811
812
813
814
815
        
    return c;

    }


/**
 * @brief Split the space into cells given the array of particles.
 *
816
 * @param s The #space to initialize.
Pedro Gonnet's avatar
Pedro Gonnet committed
817
818
819
820
 * @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.
821
 * @param h_max The maximal interaction radius.
Pedro Gonnet's avatar
Pedro Gonnet committed
822
823
824
825
826
827
828
829
 *
 * 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
830
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
831

832
833
    int k;

Pedro Gonnet's avatar
Pedro Gonnet committed
834
835
836
837
    /* 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;
838
    s->parts = parts;
839
    s->cell_min = h_max;
840
    
841
842
843
844
845
846
    /* 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];
        
847
848
849
    /* Init the space lock. */
    if ( lock_init( &s->lock ) != 0 )
        error( "Failed to create space spin-lock." );
Pedro Gonnet's avatar
Pedro Gonnet committed
850
    
851
    /* Build the cells and the tasks. */
852
    space_rebuild( s , h_max );
Pedro Gonnet's avatar
Pedro Gonnet committed
853
854
855
        
    }