runner.c 24.5 KB
Newer Older
1
/*******************************************************************************
2
 * This file is part of SWIFT.
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
 * 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/>.
 * 
 ******************************************************************************/
Pedro Gonnet's avatar
Pedro Gonnet committed
19

Pedro Gonnet's avatar
Pedro Gonnet committed
20
21
/* Config parameters. */
#include "../config.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
22
23
24
25
26
27
28
29
30
31

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

/* Local headers. */
#include "cycle.h"
36
#include "timers.h"
37
#include "const.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
38
#include "lock.h"
39
40
41
#include "task.h"
#include "part.h"
#include "cell.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
42
#include "space.h"
43
#include "queue.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
44
#include "engine.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
45
#include "runner.h"
46
#include "runner_iact.h"
47
#include "error.h"
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

/* Convert cell location to ID. */
#define cell_getid( cdim , i , j , k ) ( (int)(k) + (cdim)[2]*( (int)(j) + (cdim)[1]*(int)(i) ) )

/* The counters. */
int runner_counter[ runner_counter_count ];

        

const float runner_shift[13*3] = {
     5.773502691896258e-01 ,  5.773502691896258e-01 ,  5.773502691896258e-01 ,
     7.071067811865475e-01 ,  7.071067811865475e-01 ,  0.0                   ,
     5.773502691896258e-01 ,  5.773502691896258e-01 , -5.773502691896258e-01 ,
     7.071067811865475e-01 ,  0.0                   ,  7.071067811865475e-01 ,
     1.0                   ,  0.0                   ,  0.0                   ,
     7.071067811865475e-01 ,  0.0                   , -7.071067811865475e-01 ,
     5.773502691896258e-01 , -5.773502691896258e-01 ,  5.773502691896258e-01 ,
     7.071067811865475e-01 , -7.071067811865475e-01 ,  0.0                   ,
     5.773502691896258e-01 , -5.773502691896258e-01 , -5.773502691896258e-01 ,
     0.0                   ,  7.071067811865475e-01 ,  7.071067811865475e-01 ,
     0.0                   ,  1.0                   ,  0.0                   ,
     0.0                   ,  7.071067811865475e-01 , -7.071067811865475e-01 ,
     0.0                   ,  0.0                   ,  1.0                   ,
    };
const char runner_flip[27] = { 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 0 ,
                               0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 }; 


76
77
78
79
80
81
82
83
84
/* Import the density functions. */
#define FUNCTION density
#include "runner_doiact.h"

#undef FUNCTION
#define FUNCTION force
#include "runner_doiact.h"


Pedro Gonnet's avatar
Pedro Gonnet committed
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
/**
 * @brief Sort the entries in ascending order using QuickSort.
 *
 * @param sort The entries
 * @param N The number of entries.
 */
 
void runner_dosort_ascending ( struct entry *sort , int N ) {

    struct {
        short int lo, hi;
        } qstack[10];
    int qpos, i, j, lo, hi, imin;
    struct entry temp;
    float pivot;
        
    /* Sort parts in cell_i in decreasing order with quicksort */
    qstack[0].lo = 0; qstack[0].hi = N - 1; qpos = 0;
    while ( qpos >= 0 ) {
        lo = qstack[qpos].lo; hi = qstack[qpos].hi;
        qpos -= 1;
        if ( hi - lo < 15 ) {
            for ( i = lo ; i < hi ; i++ ) {
                imin = i;
                for ( j = i+1 ; j <= hi ; j++ )
                    if ( sort[j].d < sort[imin].d )
                        imin = j;
                if ( imin != i ) {
                    temp = sort[imin]; sort[imin] = sort[i]; sort[i] = temp;
                    }
                }
            }
        else {
            pivot = sort[ ( lo + hi ) / 2 ].d;
            i = lo; j = hi;
            while ( i <= j ) {
                while ( sort[i].d < pivot ) i++;
                while ( sort[j].d > pivot ) j--;
                if ( i <= j ) {
                    if ( i < j ) {
                        temp = sort[i]; sort[i] = sort[j]; sort[j] = temp;
                        }
                    i += 1; j -= 1;
                    }
                }
            if ( j > ( lo + hi ) / 2 ) {
                if ( lo < j ) {
                    qpos += 1;
                    qstack[qpos].lo = lo;
                    qstack[qpos].hi = j;
                    }
                if ( i < hi ) {
                    qpos += 1;
                    qstack[qpos].lo = i;
                    qstack[qpos].hi = hi;
                    }
                }
            else {
                if ( i < hi ) {
                    qpos += 1;
                    qstack[qpos].lo = i;
                    qstack[qpos].hi = hi;
                    }
                if ( lo < j ) {
                    qpos += 1;
                    qstack[qpos].lo = lo;
                    qstack[qpos].hi = j;
                    }
                }
            }
        }
                
    }
    
    
/**
 * @brief Sort the particles in the given cell along all cardinal directions.
 *
 * @param r The #runner.
 * @param c The #cell.
165
 * @param flags Cell flag.
166
167
 * @param clock Flag indicating whether to record the timing or not, needed
 *      for recursive calls.
Pedro Gonnet's avatar
Pedro Gonnet committed
168
169
 */
 
170
void runner_dosort ( struct runner *r , struct cell *c , int flags , int clock ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
171
172
173

    struct entry *finger;
    struct entry *fingers[8];
174
    struct cpart *cparts = c->cparts;
Pedro Gonnet's avatar
Pedro Gonnet committed
175
    int j, k, count = c->count;
Pedro Gonnet's avatar
Pedro Gonnet committed
176
    int i, ind, off[8], inds[8], temp_i, missing;
177
    // float shift[3];
Pedro Gonnet's avatar
Pedro Gonnet committed
178
    float buff[8], px[3];
179
    
Pedro Gonnet's avatar
Pedro Gonnet committed
180
181
    TIMER_TIC
    
182
183
184
185
186
    /* Clean-up the flags, i.e. filter out what's already been sorted. */
    flags &= ~c->sorted;
    if ( flags == 0 )
        return;
    
Pedro Gonnet's avatar
Pedro Gonnet committed
187
188
189
    /* start by allocating the entry arrays. */
    if ( lock_lock( &c->lock ) != 0 )
        error( "Failed to lock cell." );
190
191
192
193
194
    if ( c->sort == NULL || c->sortsize < c->count ) {
        if ( c->sort != NULL )
            free( c->sort );
        c->sortsize = c->count * 1.1;
        if ( ( c->sort = (struct entry *)malloc( sizeof(struct entry) * (c->sortsize + 1) * 13 ) ) == NULL )
Pedro Gonnet's avatar
Pedro Gonnet committed
195
            error( "Failed to allocate sort memory." );
196
        }
Pedro Gonnet's avatar
Pedro Gonnet committed
197
198
199
200
201
202
    if ( lock_unlock( &c->lock ) != 0 )
        error( "Failed to unlock cell." );
        
    /* Does this cell have any progeny? */
    if ( c->split ) {
    
Pedro Gonnet's avatar
Pedro Gonnet committed
203
204
205
206
        /* Fill in the gaps within the progeny. */
        for ( k = 0 ; k < 8 ; k++ ) {
            if ( c->progeny[k] == NULL )
                continue;
207
            if ( c->progeny[k]->sorts == NULL )
Pedro Gonnet's avatar
Pedro Gonnet committed
208
209
                missing = flags;
            else
210
                missing = ( c->progeny[k]->sorts->flags ^ flags ) & flags;
Pedro Gonnet's avatar
Pedro Gonnet committed
211
            if ( missing )
212
                runner_dosort( r , c->progeny[k] , missing , 0 );
Pedro Gonnet's avatar
Pedro Gonnet committed
213
214
215
216
            }
    
        /* Loop over the 13 different sort arrays. */
        for ( j = 0 ; j < 13 ; j++ ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
217
218
219
220
221
        
            /* Has this sort array been flagged? */
            if ( !( flags & (1 << j) ) )
                continue;
                
222
223
224
225
226
227
228
229
230
231
232
233
234
235
            /* Init the particle index offsets. */
            for ( off[0] = 0 , k = 1 ; k < 8 ; k++ )
                if ( c->progeny[k-1] != NULL )
                    off[k] = off[k-1] + c->progeny[k-1]->count;
                else
                    off[k] = off[k-1];

            /* Init the entries and indices. */
            for ( k = 0 ; k < 8 ; k++ ) {
                inds[k] = k;
                if ( c->progeny[k] != NULL && c->progeny[k]->count > 0 ) {
                    fingers[k] = &c->progeny[k]->sort[ j*(c->progeny[k]->count + 1) ];
                    buff[k] = fingers[k]->d;
                    off[k] = off[k];
Pedro Gonnet's avatar
Pedro Gonnet committed
236
                    }
237
238
                else
                    buff[k] = FLT_MAX;
Pedro Gonnet's avatar
Pedro Gonnet committed
239
240
                }

241
242
243
244
245
246
            /* Sort the buffer. */
            for ( i = 0 ; i < 7 ; i++ )
                for ( k = i+1 ; k < 8 ; k++ )
                    if ( buff[ inds[k] ] < buff[ inds[i] ] ) {
                        temp_i = inds[i]; inds[i] = inds[k]; inds[k] = temp_i;
                        }
Pedro Gonnet's avatar
Pedro Gonnet committed
247

248
249
250
            /* For each entry in the new sort list. */
            finger = &c->sort[ j*(count + 1) ];
            for ( ind = 0 ; ind < count ; ind++ ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
251

252
253
254
                /* Copy the minimum into the new sort array. */
                finger[ind].d = buff[inds[0]];
                finger[ind].i = fingers[inds[0]]->i + off[inds[0]];
Pedro Gonnet's avatar
Pedro Gonnet committed
255

256
257
258
                /* Update the buffer. */
                fingers[inds[0]] += 1;
                buff[inds[0]] = fingers[inds[0]]->d;
Pedro Gonnet's avatar
Pedro Gonnet committed
259

260
261
262
263
                /* Find the smallest entry. */
                for ( k = 1 ; k < 8 && buff[inds[k]] < buff[inds[k-1]] ; k++ ) {
                    temp_i = inds[k-1]; inds[k-1] = inds[k]; inds[k] = temp_i;
                    }
Pedro Gonnet's avatar
Pedro Gonnet committed
264

265
                } /* Merge. */
Pedro Gonnet's avatar
Pedro Gonnet committed
266
267
268
269
270
            
            /* Add a sentinel. */
            c->sort[ j*(c->count + 1) + c->count ].d = FLT_MAX;
            c->sort[ j*(c->count + 1) + c->count ].i = 0;
            
271
272
273
            /* Mark as sorted. */
            c->sorted |= ( 1 << j );
            
Pedro Gonnet's avatar
Pedro Gonnet committed
274
275
276
277
278
279
280
            } /* loop over sort arrays. */
    
        } /* progeny? */
        
    /* Otherwise, just sort. */
    else {
    
281
        /* Fill the sort array. */
Pedro Gonnet's avatar
Pedro Gonnet committed
282
        for ( k = 0 ; k < count ; k++ ) {
283
284
285
            px[0] = cparts[k].x[0];
            px[1] = cparts[k].x[1];
            px[2] = cparts[k].x[2];
286
287
288
            for ( j = 0 ; j < 13 ; j++ )
                if ( flags & (1 << j) ) {
                    c->sort[ j*(count + 1) + k].i = k;
Pedro Gonnet's avatar
Pedro Gonnet committed
289
                    c->sort[ j*(count + 1) + k].d = px[0]*runner_shift[ 3*j + 0 ] + px[1]*runner_shift[ 3*j + 1 ] + px[2]*runner_shift[ 3*j + 2 ];
290
                    }
Pedro Gonnet's avatar
Pedro Gonnet committed
291
            }
292
293

        /* Add the sentinel and sort. */
Pedro Gonnet's avatar
Pedro Gonnet committed
294
        for ( j = 0 ; j < 13 ; j++ )
295
296
297
298
            if ( flags & (1 << j) ) {
                c->sort[ j*(count + 1) + c->count ].d = FLT_MAX;
                c->sort[ j*(count + 1) + c->count ].i = 0;
                runner_dosort_ascending( &c->sort[ j*(count + 1) ] , c->count );
299
                c->sorted |= ( 1 << j );
Pedro Gonnet's avatar
Pedro Gonnet committed
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
                }
            
        }
        
    /* Verify the sorting. */
    /* for ( j = 0 ; j < 13 ; j++ ) {
        if ( !( flags & (1 << j) ) )
            continue;
        finger = &c->sort[ j*(c->count + 1) ];
        for ( k = 1 ; k < c->count ; k++ ) {
            if ( finger[k].d < finger[k-1].d )
                error( "Sorting failed, ascending array." );
            if ( finger[k].i >= c->count )
                error( "Sorting failed, indices borked." );
            }
        } */
316
        
Pedro Gonnet's avatar
Pedro Gonnet committed
317
318
    #ifdef TIMER_VERBOSE
        printf( "runner_dosort[%02i]: %i parts at depth %i (flags = %i%i%i%i%i%i%i%i%i%i%i%i%i) took %.3f ms.\n" ,
Pedro Gonnet's avatar
Pedro Gonnet committed
319
            r->id , c->count , c->depth ,
Pedro Gonnet's avatar
Pedro Gonnet committed
320
            (flags & 0x1000) >> 12 , (flags & 0x800) >> 11 , (flags & 0x400) >> 10 , (flags & 0x200) >> 9 , (flags & 0x100) >> 8 , (flags & 0x80) >> 7 , (flags & 0x40) >> 6 , (flags & 0x20) >> 5 , (flags & 0x10) >> 4 , (flags & 0x8) >> 3 , (flags & 0x4) >> 2 , (flags & 0x2) >> 1 , (flags & 0x1) >> 0 , 
321
            ((double)TIMER_TOC(timer_dosort)) / CPU_TPS * 1000 ); fflush(stdout);
Pedro Gonnet's avatar
Pedro Gonnet committed
322
    #else
323
324
        if ( clock )
            TIMER_TOC(timer_dosort);
Pedro Gonnet's avatar
Pedro Gonnet committed
325
326
327
    #endif

    }
328
329
330
331
332
    
    
/**
 * @brief Intermediate task between density and force
 *
Pedro Gonnet's avatar
Pedro Gonnet committed
333
 * @param r The runner thread.
334
 * @param c THe cell.
335
336
 */
 
Pedro Gonnet's avatar
Pedro Gonnet committed
337
void runner_doghost ( struct runner *r , struct cell *c ) {
338
339

    struct part *p;
340
    struct cpart *cp;
341
    struct cell *finger;
Pedro Gonnet's avatar
Pedro Gonnet committed
342
343
    int i, k, redo, count = c->count;
    int *pid;
Pedro Gonnet's avatar
Pedro Gonnet committed
344
    float h, hg, ihg, ihg2, ihg4, h_corr;
345
    float normDiv_v, normCurl_v;
346
    float dt_step = r->e->dt_step;
347
348
    TIMER_TIC
    
Pedro Gonnet's avatar
Pedro Gonnet committed
349
350
351
352
353
354
355
    /* Recurse? */
    if ( c->split ) {
        for ( k = 0 ; k < 8 ; k++ )
            if ( c->progeny[k] != NULL )
                runner_doghost( r , c->progeny[k] );
        return;
        }
356
        
Pedro Gonnet's avatar
Pedro Gonnet committed
357
358
359
360
361
362
363
364
    /* Init the IDs that have to be updated. */
    if ( ( pid = (int *)alloca( sizeof(int) * count ) ) == NULL )
        error( "Call to alloca failed." );
    for ( k = 0 ; k < count ; k++ )
        pid[k] = k;
        
    /* While there are particles that need to be updated... */
    while ( count > 0 ) {
365
    
Pedro Gonnet's avatar
Pedro Gonnet committed
366
367
        /* Reset the redo-count. */
        redo = 0;
368
    
Pedro Gonnet's avatar
Pedro Gonnet committed
369
370
371
372
373
        /* Loop over the parts in this cell. */
        for ( i = 0 ; i < count ; i++ ) {

            /* Get a direct pointer on the part. */
            p = &c->parts[ pid[i] ];
374
            cp = &c->cparts[ pid[i] ];
375
            
376
            /* Is this part within the timestep? */
377
            if ( cp->dt <= dt_step ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
378
            
379
  	            /* Some smoothing length multiples. */
Pedro Gonnet's avatar
Pedro Gonnet committed
380
381
382
	            h = p->h;
                hg = kernel_gamma * h;
                ihg = 1.0f / hg;
383
                ihg2 = ihg * ihg;
384
                ihg4 = ihg2 * ihg2;
385
386

                /* Adjust the computed weighted number of neighbours. */
387
                p->density.wcount += kernel_wroot;
388

Pedro Gonnet's avatar
Pedro Gonnet committed
389
390
391
392
		        /* Final operation on the density. */
                p->rho = ihg * ihg2 * ( p->rho + p->mass*kernel_root );
                p->rho_dh *= ihg4;
                    
393
                /* Compute the smoothing length update (Newton step). */
394
395
396
397
398
399
400
401
402
                if ( p->density.wcount_dh == 0.0f )
                    h_corr = p->h;
                else {
                    h_corr = ( const_nwneigh - p->density.wcount ) / p->density.wcount_dh;

                    /* Truncate to the range [ -p->h/2 , p->h ]. */
                    h_corr = fminf( h_corr , h );
                    h_corr = fmaxf( h_corr , -h/2 );
                    }
403
404
405
                
                /* Apply the correction to p->h. */
                p->h += h_corr;
406
                cp->h = p->h;
407
408

                /* Did we get the right number density? */
409
410
411
412
                if ( p->density.wcount > const_nwneigh + const_delta_nwneigh ||
                     p->density.wcount < const_nwneigh - const_delta_nwneigh ) {
                    // printf( "runner_doghost: particle %lli (h=%e,depth=%i) has bad wcount=%.3f.\n" , p->id , p->h , c->depth , p->density.wcount ); fflush(stdout);
                    // p->h += ( p->density.wcount + kernel_root - const_nwneigh ) / p->density.wcount_dh;
413
414
                    pid[redo] = pid[i];
                    redo += 1;
415
                    p->density.wcount = 0.0;
416
                    p->density.wcount_dh = 0.0;
417
418
                    p->rho = 0.0;
                    p->rho_dh = 0.0;
419
		            p->density.div_v = 0.0;
420
		            for ( k=0 ; k < 3 ; k++)
421
		                p->density.curl_v[k] = 0.0;
422
423
                    continue;
                    }
424

425
426
427
428
                /* Pre-compute some stuff for the balsara switch. */
		        normDiv_v = fabs( p->density.div_v / p->rho * ihg4 );
		        normCurl_v = sqrtf( p->density.curl_v[0] * p->density.curl_v[0] + p->density.curl_v[1] * p->density.curl_v[1] + p->density.curl_v[2] * p->density.curl_v[2] ) / p->rho * ihg4;
                
Pedro Gonnet's avatar
Pedro Gonnet committed
429
430
431
                /* As of here, particle force variables will be set. Do _NOT_
                   try to read any particle density variables! */
                
432
                /* Compute this particle's sound speed. */
433
                p->force.c = sqrtf( const_gamma * ( const_gamma - 1.0f ) * p->u );
434
435

                /* Compute the P/Omega/rho2. */
Pedro Gonnet's avatar
Pedro Gonnet committed
436
                p->force.POrho2 = p->u * ( const_gamma - 1.0f ) / ( p->rho + hg * p->rho_dh / 3.0f );
437

438
		        /* Balsara switch */
Pedro Gonnet's avatar
Pedro Gonnet committed
439
		        p->force.balsara = normCurl_v / ( normDiv_v + normCurl_v + 0.0001f * p->force.c * ihg );
440

441
442
443
                /* Reset the acceleration. */
                for ( k = 0 ; k < 3 ; k++ )
                    p->a[k] = 0.0f;
Pedro Gonnet's avatar
Pedro Gonnet committed
444

445
                /* Reset the time derivatives. */
446
447
448
                p->force.u_dt = 0.0f;
                p->force.h_dt = 0.0f;
                p->force.v_sig = 0.0f;
Pedro Gonnet's avatar
Pedro Gonnet committed
449

450
                }
Pedro Gonnet's avatar
Pedro Gonnet committed
451
452

            }
453
            
Pedro Gonnet's avatar
Pedro Gonnet committed
454
455
        /* Re-set the counter for the next loop (potentially). */
        count = redo;
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
        if ( count > 0 ) {
        
            // error( "Bad smoothing length, fixing this isn't implemented yet." );
            
            /* Climb up the cell hierarchy. */
            for ( finger = c ; finger != NULL ; finger = finger->parent ) {
            
                /* Run through this cell's density interactions. */
                for ( k = 0 ; k < finger->nr_density ; k++ ) {
                
                    /* Self-interaction? */
                    if ( finger->density[k]->type == task_type_self )
                        runner_doself_subset_density( r , finger , c->parts , pid , count );
                        
                    /* Otherwise, pair interaction? */
                    else if ( finger->density[k]->type == task_type_pair ) {
                    
                        /* Left or right? */
                        if ( finger->density[k]->ci == finger )
                            runner_dopair_subset_density( r , finger , c->parts , pid , count , finger->density[k]->cj );
                        else
                            runner_dopair_subset_density( r , finger , c->parts , pid , count , finger->density[k]->ci );
                        
                        }
                
                    /* Otherwise, sub interaction? */
482
483
484
485
486
487
488
489
490
                    else if ( finger->density[k]->type == task_type_sub ) {
                    
                        /* Left or right? */
                        if ( finger->density[k]->ci == finger )
                            runner_dosub_subset_density( r , finger , c->parts , pid , count , finger->density[k]->cj , -1 );
                        else
                            runner_dosub_subset_density( r , finger , c->parts , pid , count , finger->density[k]->ci , -1 );
                        
                        }
491
492
                
                    }
Pedro Gonnet's avatar
Pedro Gonnet committed
493
                    
494
495
496
                }
        
            }
497
498
499
500
501
            
        }

    #ifdef TIMER_VERBOSE
        printf( "runner_doghost[%02i]: %i parts at depth %i took %.3f ms.\n" ,
Pedro Gonnet's avatar
Pedro Gonnet committed
502
            r->id , c->count , c->depth ,
503
            ((double)TIMER_TOC(timer_doghost)) / CPU_TPS * 1000 ); fflush(stdout);
504
    #else
505
        TIMER_TOC(timer_doghost);
506
507
508
    #endif
    
    }
Pedro Gonnet's avatar
Pedro Gonnet committed
509
510
511
512
513
514
515
516
517
518


/**
 * @brief The #runner main thread routine.
 *
 * @param data A pointer to this thread's data.
 */
 
void *runner_main ( void *data ) {

Pedro Gonnet's avatar
Pedro Gonnet committed
519
520
521
    struct runner *r = (struct runner *)data;
    struct engine *e = r->e;
    int threadID = r->id;
Pedro Gonnet's avatar
Pedro Gonnet committed
522
    int k, qid, naq, keep, tpq;
Pedro Gonnet's avatar
Pedro Gonnet committed
523
    struct queue *queues[ e->nr_queues ], *myq;
Pedro Gonnet's avatar
Pedro Gonnet committed
524
525
    struct task *t;
    struct cell *ci, *cj;
Pedro Gonnet's avatar
Pedro Gonnet committed
526
    unsigned int myseed = rand() + r->id;
Pedro Gonnet's avatar
Pedro Gonnet committed
527
528
529
530
531
532
533
534
    #ifdef TIMER
        ticks stalled;
    #endif
    
    /* Main loop. */
    while ( 1 ) {
    
        /* Wait at the barrier. */
Pedro Gonnet's avatar
Pedro Gonnet committed
535
        engine_barrier( e );
Pedro Gonnet's avatar
Pedro Gonnet committed
536
537
        
        /* Set some convenient local data. */
Pedro Gonnet's avatar
Pedro Gonnet committed
538
        keep = e->policy & engine_policy_keep;
Pedro Gonnet's avatar
Pedro Gonnet committed
539
        myq = &e->queues[ threadID * e->nr_queues / e->nr_threads ];
Pedro Gonnet's avatar
Pedro Gonnet committed
540
        tpq = ceil( ((double)e->nr_threads) / e->nr_queues );
541
542
543
        #ifdef TIMER
            stalled = 0;
        #endif
Pedro Gonnet's avatar
Pedro Gonnet committed
544
545
        
        /* Set up the local list of active queues. */
Pedro Gonnet's avatar
Pedro Gonnet committed
546
        naq = e->nr_queues;
Pedro Gonnet's avatar
Pedro Gonnet committed
547
        for ( k = 0 ; k < naq ; k++ )
Pedro Gonnet's avatar
Pedro Gonnet committed
548
            queues[k] = &e->queues[k];
Pedro Gonnet's avatar
Pedro Gonnet committed
549
550
    
        /* Set up the local list of active queues. */
Pedro Gonnet's avatar
Pedro Gonnet committed
551
        naq = e->nr_queues;
Pedro Gonnet's avatar
Pedro Gonnet committed
552
        for ( k = 0 ; k < naq ; k++ )
Pedro Gonnet's avatar
Pedro Gonnet committed
553
            queues[k] = &e->queues[k];
Pedro Gonnet's avatar
Pedro Gonnet committed
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
    
        /* Loop while there are tasks... */
        while ( 1 ) {
        
            /* Remove any inactive queues. */
            for ( k = 0 ; k < naq ; k++ )
                if ( queues[k]->next == queues[k]->count ) {
                    naq -= 1;
                    queues[k] = queues[naq];
                    k -= 1;
                    }
            if ( naq == 0 )
                break;
        
            /* Get a task, how and from where depends on the policy. */
            TIMER_TIC
            t = NULL;
Pedro Gonnet's avatar
Pedro Gonnet committed
571
            if ( e->nr_queues == 1 ) {
572
                t = queue_gettask_old( &e->queues[0] , 1 , 0 );
Pedro Gonnet's avatar
Pedro Gonnet committed
573
                }
Pedro Gonnet's avatar
Pedro Gonnet committed
574
            else if ( e->policy & engine_policy_steal ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
575
                if ( ( myq->next == myq->count ) ||
576
                     ( t = queue_gettask( myq , r->id , 0 , 0 ) ) == NULL ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
577
                    TIMER_TIC2
578
                    qid = rand_r( &myseed ) % naq;
Pedro Gonnet's avatar
Pedro Gonnet committed
579
                    keep = ( e->policy & engine_policy_keep ) &&
Pedro Gonnet's avatar
Pedro Gonnet committed
580
581
582
583
584
                           ( myq->count <= myq->size-tpq );
                    if ( myq->next == myq->count )
                        COUNT(runner_counter_steal_empty);
                    else
                        COUNT(runner_counter_steal_stall);
585
                    t = queue_gettask( queues[qid] , r->id , 0 , keep );
Pedro Gonnet's avatar
Pedro Gonnet committed
586
587
                    if ( t != NULL && keep )
                        queue_insert( myq , t );
588
                    TIMER_TOC2(timer_steal);
Pedro Gonnet's avatar
Pedro Gonnet committed
589
590
                    }
                }
Pedro Gonnet's avatar
Pedro Gonnet committed
591
            else if ( e->policy & engine_policy_rand ) {
592
                qid = rand_r( &myseed ) % naq;
593
                t = queue_gettask( queues[qid] , r->id , e->policy & engine_policy_block , 0 );
Pedro Gonnet's avatar
Pedro Gonnet committed
594
595
                }
            else {
596
                t = queue_gettask( &e->queues[threadID] , r->id , e->policy & engine_policy_block , 0 );
Pedro Gonnet's avatar
Pedro Gonnet committed
597
                }
598
            TIMER_TOC(timer_getpair);
Pedro Gonnet's avatar
Pedro Gonnet committed
599
600
601
602
            
            /* Did I get anything? */
            if ( t == NULL ) {
                COUNT(runner_counter_stall);
603
604
605
606
                #ifdef TIMER
                    if ( !stalled )
                        stalled = getticks();
                #endif
Pedro Gonnet's avatar
Pedro Gonnet committed
607
608
609
610
                continue;
                }
            #ifdef TIMER
            else if ( stalled ) {
611
                timers_toc( timer_stalled , stalled );
Pedro Gonnet's avatar
Pedro Gonnet committed
612
                #ifdef TIMER_VERBOSE
Pedro Gonnet's avatar
Pedro Gonnet committed
613
                    printf( "runner_main[%02i]: stalled %.3f ms\n" , r->id , ((double)stalled) / CPU_TPS * 1000 );
Pedro Gonnet's avatar
Pedro Gonnet committed
614
615
616
617
618
619
620
621
622
623
624
625
                    fflush(stdout);
                #endif
                stalled = 0;
                }
            #endif
        
            /* Get the cells. */
            ci = t->ci;
            cj = t->cj;
            
            /* Different types of tasks... */
            switch ( t->type ) {
626
627
                case task_type_self:
                    if ( t->subtype == task_subtype_density )
628
                        runner_doself1_density( r , ci );
629
                    else if ( t->subtype == task_subtype_force )
630
                        runner_doself2_force( r , ci );
631
632
                    else
                        error( "Unknown task subtype." );
Pedro Gonnet's avatar
Pedro Gonnet committed
633
634
                    cell_unlocktree( ci );
                    break;
635
636
                case task_type_pair:
                    if ( t->subtype == task_subtype_density )
637
                        runner_dopair1_density( r , ci , cj );
638
                    else if ( t->subtype == task_subtype_force )
639
                        runner_dopair2_force( r , ci , cj );
640
641
                    else
                        error( "Unknown task subtype." );
Pedro Gonnet's avatar
Pedro Gonnet committed
642
643
644
                    cell_unlocktree( ci );
                    cell_unlocktree( cj );
                    break;
645
                case task_type_sort:
646
                    runner_dosort( r , ci , t->flags , 1 );
Pedro Gonnet's avatar
Pedro Gonnet committed
647
                    break;
648
649
                case task_type_sub:
                    if ( t->subtype == task_subtype_density )
650
                        runner_dosub1_density( r , ci , cj , t->flags );
651
                    else if ( t->subtype == task_subtype_force )
652
                        runner_dosub2_force( r , ci , cj , t->flags );
653
654
                    else
                        error( "Unknown task subtype." );
Pedro Gonnet's avatar
Pedro Gonnet committed
655
656
657
658
                    cell_unlocktree( ci );
                    if ( cj != NULL )
                        cell_unlocktree( cj );
                    break;
659
                case task_type_ghost:
Pedro Gonnet's avatar
Pedro Gonnet committed
660
                    if ( ci->super == ci )
Pedro Gonnet's avatar
Pedro Gonnet committed
661
                        runner_doghost( r , ci );
662
                    break;
Pedro Gonnet's avatar
Pedro Gonnet committed
663
664
665
666
667
668
                default:
                    error( "Unknown task type." );
                }
                
            /* Resolve any dependencies. */
            for ( k = 0 ; k < t->nr_unlock_tasks ; k++ )
Pedro Gonnet's avatar
Pedro Gonnet committed
669
670
                if ( __sync_fetch_and_sub( &t->unlock_tasks[k]->wait , 1 ) == 0 )
                    abort();
Pedro Gonnet's avatar
Pedro Gonnet committed
671
672
673
674
675
676
        
            } /* main loop. */
            
    	/* Any leftover stalls? */    
        #ifdef TIMER
        if ( stalled ) {
677
            timers_toc( timer_stalled , stalled );
Pedro Gonnet's avatar
Pedro Gonnet committed
678
            #ifdef TIMER_VERBOSE
Pedro Gonnet's avatar
Pedro Gonnet committed
679
                printf( "runner_main[%02i]: stalled %.3f ms\n" , r->id , ((double)stalled) / CPU_TPS * 1000 );
Pedro Gonnet's avatar
Pedro Gonnet committed
680
681
682
683
684
685
686
687
688
689
690
691
692
693
                fflush(stdout);
            #endif
            stalled = 0;
            }
        #endif
            
        }
        
    /* Be kind, rewind. */
    return NULL;

    }