runner.c 23.8 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"
Pedro Gonnet's avatar
Pedro Gonnet committed
47
48

/* Error macro. */
49
#define error(s) { fprintf( stderr , "%s:%s:%i: %s\n" , __FILE__ , __FUNCTION__ , __LINE__ , s ); abort(); }
Pedro Gonnet's avatar
Pedro Gonnet committed
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

/* 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 }; 


78
79
80
81
82
83
84
85
86
/* 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
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
165
166
167
168
/**
 * @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.
 */
 
Pedro Gonnet's avatar
Pedro Gonnet committed
169
void runner_dosort ( struct runner *r , struct cell *c , int flags ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
170
171
172

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

234
235
236
237
238
239
            /* 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
240

241
242
243
            /* 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
244

245
246
247
                /* 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
248

249
250
251
                /* Update the buffer. */
                fingers[inds[0]] += 1;
                buff[inds[0]] = fingers[inds[0]]->d;
Pedro Gonnet's avatar
Pedro Gonnet committed
252

253
254
255
256
                /* 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
257

258
                } /* Merge. */
Pedro Gonnet's avatar
Pedro Gonnet committed
259
260
261
262
263
264
265
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;
            
            } /* loop over sort arrays. */
    
        } /* progeny? */
        
    /* Otherwise, just sort. */
    else {
    
271
        /* Fill the sort array. */
Pedro Gonnet's avatar
Pedro Gonnet committed
272
        for ( k = 0 ; k < count ; k++ ) {
273
274
275
            px[0] = cparts[k].x[0];
            px[1] = cparts[k].x[1];
            px[2] = cparts[k].x[2];
276
277
278
            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
279
                    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 ];
280
                    }
Pedro Gonnet's avatar
Pedro Gonnet committed
281
            }
282
283

        /* Add the sentinel and sort. */
Pedro Gonnet's avatar
Pedro Gonnet committed
284
        for ( j = 0 ; j < 13 ; j++ )
285
286
287
288
            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 );
Pedro Gonnet's avatar
Pedro Gonnet committed
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
                }
            
        }
        
    /* 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." );
            }
        } */
305
        
Pedro Gonnet's avatar
Pedro Gonnet committed
306
307
    #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
308
            r->id , c->count , c->depth ,
Pedro Gonnet's avatar
Pedro Gonnet committed
309
            (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 , 
310
            ((double)TIMER_TOC(timer_dosort)) / CPU_TPS * 1000 ); fflush(stdout);
Pedro Gonnet's avatar
Pedro Gonnet committed
311
    #else
312
        TIMER_TOC(timer_dosort);
Pedro Gonnet's avatar
Pedro Gonnet committed
313
314
315
    #endif

    }
316
317
318
319
320
    
    
/**
 * @brief Intermediate task between density and force
 *
Pedro Gonnet's avatar
Pedro Gonnet committed
321
 * @param r The runner thread.
322
323
324
 * @param ci THe cell.
 */
 
Pedro Gonnet's avatar
Pedro Gonnet committed
325
void runner_doghost ( struct runner *r , struct cell *c ) {
326
327

    struct part *p;
328
    struct cpart *cp;
329
    struct cell *finger;
Pedro Gonnet's avatar
Pedro Gonnet committed
330
331
    int i, k, redo, count = c->count;
    int *pid;
332
    float ihg, ihg2, h_corr;
333
    float normDiv_v, normCurl_v;
334
    float dt_step = r->e->dt_step;
335
336
    TIMER_TIC
    
Pedro Gonnet's avatar
Pedro Gonnet committed
337
338
339
340
341
342
343
    /* Recurse? */
    if ( c->split ) {
        for ( k = 0 ; k < 8 ; k++ )
            if ( c->progeny[k] != NULL )
                runner_doghost( r , c->progeny[k] );
        return;
        }
344
        
Pedro Gonnet's avatar
Pedro Gonnet committed
345
346
347
348
349
350
351
352
    /* 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 ) {
353
    
Pedro Gonnet's avatar
Pedro Gonnet committed
354
355
        /* Reset the redo-count. */
        redo = 0;
356
    
Pedro Gonnet's avatar
Pedro Gonnet committed
357
358
359
360
361
        /* 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] ];
362
            cp = &c->cparts[ pid[i] ];
363
            
364
            /* Is this part within the timestep? */
365
            if ( cp->dt <= dt_step ) {
366

367
368
  	        /* Some smoothing length multiples*/
	        ihg = kernel_igamma / p->h;
369
                ihg2 = ihg * ihg;
370
371

                /* Adjust the computed weighted number of neighbours. */
372
                p->wcount += kernel_wroot;
373

374
375
376
377
378
379
380
381
382
                /* Compute the smoothing length update (Newton step). */
                h_corr = ( const_nwneigh - p->wcount ) / p->wcount_dh;
                
                /* Truncate to the range [ -p->h/2 , p->h ]. */
                h_corr = fminf( h_corr , p->h );
                h_corr = fmaxf( h_corr , -p->h/2 );
                
                /* Apply the correction to p->h. */
                p->h += h_corr;
383
                cp->h = p->h;
384
385

                /* Did we get the right number density? */
386
387
                if ( p->wcount > const_nwneigh + const_delta_nwneigh ||
                     p->wcount < const_nwneigh - const_delta_nwneigh ) {
388
                    // printf( "runner_doghost: particle %lli (h=%e,h_dt=%e,depth=%i) has bad wcount=%.3f.\n" , p->id , p->h , p->h_dt , c->depth , p->wcount ); fflush(stdout);
389
390
391
392
393
394
395
                    // p->h += ( p->wcount + kernel_root - const_nwneigh ) / p->wcount_dh;
                    pid[redo] = pid[i];
                    redo += 1;
                    p->wcount = 0.0;
                    p->wcount_dh = 0.0;
                    p->rho = 0.0;
                    p->rho_dh = 0.0;
396
397
398
		    p->div_v = 0.0;
		    for ( k=0 ; k < 3 ; k++)
		      p->curl_v[k] = 0.0;
399
400
                    continue;
                    }
401
402
403
404

		/* Final operation on the density */
                p->rho = ihg * ihg2 * ( p->rho + p->mass*kernel_root );
                p->rho_dh *= ihg2 * ihg2;
405
                    
406
                /* Compute this particle's sound speed. */
407
                p->c = sqrtf( const_gamma * ( const_gamma - 1.0f ) * p->u );
408
409
410
411

                /* Compute the P/Omega/rho2. */
                p->POrho2 = p->u * ( const_gamma - 1.0f ) / ( p->rho + p->h * p->rho_dh / 3.0f );

412
		/* Final operation on the velocity divergence */
413
		p->div_v /= p->rho;
414
415
416
417
		p->div_v *= ihg2 * ihg2;

		/* Final operation on the velocity curl */
		for ( k=0 ; k < 3 ; k++ ){
418
		    p->curl_v[k] /= -p->rho;
419
420
421
		    p->curl_v[k] *= ihg2 * ihg2;
		    }

422
423
424
425
426
		/* Balsara switch */
		normDiv_v = fabs( p->div_v );
		normCurl_v = sqrtf( p->curl_v[0] * p->curl_v[0] + p->curl_v[1] * p->curl_v[1] + p->curl_v[2] * p->curl_v[2] );
		p->Balsara = normCurl_v / ( normDiv_v + normCurl_v + 0.0001f * p->c / p->h );

427
428
429
                /* Reset the acceleration. */
                for ( k = 0 ; k < 3 ; k++ )
                    p->a[k] = 0.0f;
Pedro Gonnet's avatar
Pedro Gonnet committed
430

431
432
433
                /* Reset the time derivatives. */
                p->u_dt = 0.0f;
                p->h_dt = 0.0f;
434
                p->v_sig = 0.0f;
Pedro Gonnet's avatar
Pedro Gonnet committed
435

436
                }
Pedro Gonnet's avatar
Pedro Gonnet committed
437
438

            }
439
            
Pedro Gonnet's avatar
Pedro Gonnet committed
440
441
        /* Re-set the counter for the next loop (potentially). */
        count = redo;
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
        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? */
468
469
470
471
472
473
474
475
476
                    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 );
                        
                        }
477
478
                
                    }
Pedro Gonnet's avatar
Pedro Gonnet committed
479
                    
480
481
482
                }
        
            }
483
484
485
486
487
            
        }

    #ifdef TIMER_VERBOSE
        printf( "runner_doghost[%02i]: %i parts at depth %i took %.3f ms.\n" ,
Pedro Gonnet's avatar
Pedro Gonnet committed
488
            r->id , c->count , c->depth ,
489
            ((double)TIMER_TOC(timer_doghost)) / CPU_TPS * 1000 ); fflush(stdout);
490
    #else
491
        TIMER_TOC(timer_doghost);
492
493
494
    #endif
    
    }
Pedro Gonnet's avatar
Pedro Gonnet committed
495
496
497
498
499
500
501
502
503
504


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

    }