runner.c 37.8 KB
Newer Older
1
/*******************************************************************************
2
 * This file is part of SWIFT.
3
 * Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
4
 *
5
6
7
8
 * 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.
9
 *
10
11
12
13
 * 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.
14
 *
15
16
 * 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/>.
17
 *
18
 ******************************************************************************/
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

/* Some standard headers. */
#include <float.h>
#include <limits.h>
26
#include <stdlib.h>
Pedro Gonnet's avatar
Pedro Gonnet committed
27

28
29
/* MPI headers. */
#ifdef WITH_MPI
30
#include <mpi.h>
31
32
#endif

33
34
35
/* This object's header. */
#include "runner.h"

Pedro Gonnet's avatar
Pedro Gonnet committed
36
/* Local headers. */
37
#include "const.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
38
#include "engine.h"
39
#include "error.h"
40
41
42
43
#include "scheduler.h"
#include "space.h"
#include "task.h"
#include "timers.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
44

45
46
47
48
49
50
/* Include the right variant of the SPH interactions */
#ifdef LEGACY_GADGET2_SPH
#include "runner_iact_legacy.h"
#else
#include "runner_iact.h"
#endif
51
#include "runner_iact_grav.h"
52

Pedro Gonnet's avatar
Pedro Gonnet committed
53
/* Convert cell location to ID. */
54
55
#define cell_getid(cdim, i, j, k) \
  ((int)(k) + (cdim)[2] * ((int)(j) + (cdim)[1] * (int)(i)))
Pedro Gonnet's avatar
Pedro Gonnet committed
56
57

/* The counters. */
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
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};
Pedro Gonnet's avatar
Pedro Gonnet committed
76

77
/* Import the density loop functions. */
78
79
80
#define FUNCTION density
#include "runner_doiact.h"

81
/* Import the force loop functions. */
82
83
84
85
#undef FUNCTION
#define FUNCTION force
#include "runner_doiact.h"

86
87
88
/* Import the gravity loop functions. */
#include "runner_doiact_grav.h"

Pedro Gonnet's avatar
Pedro Gonnet committed
89
90
91
92
93
94
/**
 * @brief Sort the entries in ascending order using QuickSort.
 *
 * @param sort The entries
 * @param N The number of entries.
 */
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

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;
Pedro Gonnet's avatar
Pedro Gonnet committed
151
        }
152
153
154
155
156
157
158
159
160
161
162
163
      } 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;
        }
      }
Pedro Gonnet's avatar
Pedro Gonnet committed
164
    }
165
166
167
  }
}

Pedro Gonnet's avatar
Pedro Gonnet committed
168
169
170
171
172
/**
 * @brief Sort the particles in the given cell along all cardinal directions.
 *
 * @param r The #runner.
 * @param c The #cell.
173
 * @param flags Cell flag.
174
175
 * @param clock Flag indicating whether to record the timing or not, needed
 *      for recursive calls.
Pedro Gonnet's avatar
Pedro Gonnet committed
176
 */
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264

void runner_dosort(struct runner *r, struct cell *c, int flags, int clock) {

  struct entry *finger;
  struct entry *fingers[8];
  struct part *parts = c->parts;
  struct entry *sort;
  int j, k, count = c->count;
  int i, ind, off[8], inds[8], temp_i, missing;
  // float shift[3];
  float buff[8], px[3];

  TIMER_TIC

  /* Clean-up the flags, i.e. filter out what's already been sorted. */
  flags &= ~c->sorted;
  if (flags == 0) return;

  /* start by allocating the entry arrays. */
  if (c->sort == NULL || c->sortsize < count) {
    if (c->sort != NULL) free(c->sort);
    c->sortsize = count * 1.1;
    if ((c->sort = (struct entry *)malloc(sizeof(struct entry) *
                                          (c->sortsize + 1) * 13)) == NULL)
      error("Failed to allocate sort memory.");
  }
  sort = c->sort;

  /* Does this cell have any progeny? */
  if (c->split) {

    /* Fill in the gaps within the progeny. */
    for (k = 0; k < 8; k++) {
      if (c->progeny[k] == NULL) continue;
      missing = flags & ~c->progeny[k]->sorted;
      if (missing) runner_dosort(r, c->progeny[k], missing, 0);
    }

    /* Loop over the 13 different sort arrays. */
    for (j = 0; j < 13; j++) {

      /* Has this sort array been flagged? */
      if (!(flags & (1 << j))) continue;

      /* 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];
        } else
          buff[k] = FLT_MAX;
      }

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

      /* For each entry in the new sort list. */
      finger = &sort[j * (count + 1)];
      for (ind = 0; ind < count; ind++) {

        /* Copy the minimum into the new sort array. */
        finger[ind].d = buff[inds[0]];
        finger[ind].i = fingers[inds[0]]->i + off[inds[0]];

        /* Update the buffer. */
        fingers[inds[0]] += 1;
        buff[inds[0]] = fingers[inds[0]]->d;

        /* 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
265
        }
266

267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
      } /* Merge. */

      /* Add a sentinel. */
      sort[j * (count + 1) + count].d = FLT_MAX;
      sort[j * (count + 1) + count].i = 0;

      /* Mark as sorted. */
      c->sorted |= (1 << j);

    } /* loop over sort arrays. */

  } /* progeny? */

  /* Otherwise, just sort. */
  else {

    /* Fill the sort array. */
    for (k = 0; k < count; k++) {
      px[0] = parts[k].x[0];
      px[1] = parts[k].x[1];
      px[2] = parts[k].x[2];
      for (j = 0; j < 13; j++)
        if (flags & (1 << j)) {
          sort[j * (count + 1) + k].i = k;
          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];
        }
295
    }
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316

    /* Add the sentinel and sort. */
    for (j = 0; j < 13; j++)
      if (flags & (1 << j)) {
        sort[j * (count + 1) + count].d = FLT_MAX;
        sort[j * (count + 1) + count].i = 0;
        runner_dosort_ascending(&sort[j * (count + 1)], count);
        c->sorted |= (1 << j);
      }
  }

/* Verify the sorting. */
/* for ( j = 0 ; j < 13 ; j++ ) {
    if ( !( flags & (1 << j) ) )
        continue;
    finger = &sort[ j*(count + 1) ];
    for ( k = 1 ; k < count ; k++ ) {
        if ( finger[k].d < finger[k-1].d )
            error( "Sorting failed, ascending array." );
        if ( finger[k].i >= count )
            error( "Sorting failed, indices borked." );
317
        }
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
    } */

#ifdef TIMER_VERBOSE
  message(
      "runner %02i: %i parts at depth %i (flags = %i%i%i%i%i%i%i%i%i%i%i%i%i) "
      "took %.3f ms.",
      r->id, count, c->depth, (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,
      ((double)TIMER_TOC(timer_dosort)) / CPU_TPS * 1000);
  fflush(stdout);
#else
  if (clock) TIMER_TOC(timer_dosort);
#endif
}

void runner_dogsort(struct runner *r, struct cell *c, int flags, int clock) {

  struct entry *finger;
  struct entry *fingers[8];
  struct gpart *gparts = c->gparts;
  struct entry *gsort;
  int j, k, count = c->gcount;
  int i, ind, off[8], inds[8], temp_i, missing;
  // float shift[3];
  float buff[8], px[3];

  TIMER_TIC

  /* Clean-up the flags, i.e. filter out what's already been sorted. */
  flags &= ~c->gsorted;
  if (flags == 0) return;

  /* start by allocating the entry arrays. */
  if (c->gsort == NULL || c->gsortsize < count) {
    if (c->gsort != NULL) free(c->gsort);
    c->gsortsize = count * 1.1;
    if ((c->gsort = (struct entry *)malloc(sizeof(struct entry) *
                                           (c->gsortsize + 1) * 13)) == NULL)
      error("Failed to allocate sort memory.");
  }
  gsort = c->gsort;

  /* Does this cell have any progeny? */
  if (c->split) {

    /* Fill in the gaps within the progeny. */
    for (k = 0; k < 8; k++) {
      if (c->progeny[k] == NULL) continue;
      missing = flags & ~c->progeny[k]->gsorted;
      if (missing) runner_dogsort(r, c->progeny[k], missing, 0);
    }

    /* Loop over the 13 different sort arrays. */
    for (j = 0; j < 13; j++) {

      /* Has this sort array been flagged? */
      if (!(flags & (1 << j))) continue;

      /* 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]->gcount;
        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]->gcount > 0) {
          fingers[k] = &c->progeny[k]->gsort[j * (c->progeny[k]->gcount + 1)];
          buff[k] = fingers[k]->d;
          off[k] = off[k];
        } else
          buff[k] = FLT_MAX;
      }

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

      /* For each entry in the new sort list. */
      finger = &gsort[j * (count + 1)];
      for (ind = 0; ind < count; ind++) {

        /* Copy the minimum into the new sort array. */
        finger[ind].d = buff[inds[0]];
        finger[ind].i = fingers[inds[0]]->i + off[inds[0]];

        /* Update the buffer. */
        fingers[inds[0]] += 1;
        buff[inds[0]] = fingers[inds[0]]->d;

        /* 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;
423
        }
Pedro Gonnet's avatar
Pedro Gonnet committed
424

425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
      } /* Merge. */

      /* Add a sentinel. */
      gsort[j * (count + 1) + count].d = FLT_MAX;
      gsort[j * (count + 1) + count].i = 0;

      /* Mark as sorted. */
      c->gsorted |= (1 << j);

    } /* loop over sort arrays. */

  } /* progeny? */

  /* Otherwise, just sort. */
  else {

    /* Fill the sort array. */
    for (k = 0; k < count; k++) {
      px[0] = gparts[k].x[0];
      px[1] = gparts[k].x[1];
      px[2] = gparts[k].x[2];
      for (j = 0; j < 13; j++)
        if (flags & (1 << j)) {
          gsort[j * (count + 1) + k].i = k;
          gsort[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];
        }
Pedro Gonnet's avatar
Pedro Gonnet committed
453
    }
454
455
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
482
483
484
485
486
487
488
489
490
491
492
493

    /* Add the sentinel and sort. */
    for (j = 0; j < 13; j++)
      if (flags & (1 << j)) {
        gsort[j * (count + 1) + count].d = FLT_MAX;
        gsort[j * (count + 1) + count].i = 0;
        runner_dosort_ascending(&gsort[j * (count + 1)], count);
        c->gsorted |= (1 << j);
      }
  }

/* Verify the sorting. */
/* for ( j = 0 ; j < 13 ; j++ ) {
    if ( !( flags & (1 << j) ) )
        continue;
    finger = &c->gsort[ j*(count + 1) ];
    for ( k = 1 ; k < count ; k++ ) {
        if ( finger[k].d < finger[k-1].d )
            error( "Sorting failed, ascending array." );
        if ( finger[k].i < 0 || finger[k].i >= count )
            error( "Sorting failed, indices borked." );
        }
    } */

#ifdef TIMER_VERBOSE
  message(
      "runner %02i: %i parts at depth %i (flags = %i%i%i%i%i%i%i%i%i%i%i%i%i) "
      "took %.3f ms.",
      r->id, count, c->depth, (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,
      ((double)TIMER_TOC(timer_dosort)) / CPU_TPS * 1000);
  fflush(stdout);
#else
  if (clock) TIMER_TOC(timer_dosort);
#endif
}

494
495
496
/**
 * @brief Intermediate task between density and force
 *
Pedro Gonnet's avatar
Pedro Gonnet committed
497
 * @param r The runner thread.
498
 * @param c The cell.
499
 */
500
501
502
503
504
505
506
507
508

void runner_doghost(struct runner *r, struct cell *c) {

  struct part *p, *parts = c->parts;
  struct cell *finger;
  int i, k, redo, count = c->count;
  int *pid;
  float h, ih, ih2, ih4, h_corr, rho, wcount, rho_dh, wcount_dh, u, fc;
  float normDiv_v, normCurl_v;
509
#ifndef LEGACY_GADGET2_SPH
510
  float alpha_dot, tau, S;
511
#endif
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
  float dt_step = r->e->dt_step;
  TIMER_TIC

  /* Recurse? */
  if (c->split) {
    for (k = 0; k < 8; k++)
      if (c->progeny[k] != NULL) runner_doghost(r, c->progeny[k]);
    return;
  }

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

    /* Reset the redo-count. */
    redo = 0;

    /* Loop over the parts in this cell. */
    for (i = 0; i < count; i++) {

      /* Get a direct pointer on the part. */
      p = &parts[pid[i]];

539
      /* Is this part within the time step? */
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
      if (p->dt <= dt_step) {

        /* Some smoothing length multiples. */
        h = p->h;
        ih = 1.0f / h;
        ih2 = ih * ih;
        ih4 = ih2 * ih2;

        /* Final operation on the density. */
        p->rho = rho = ih * ih2 * (p->rho + p->mass * kernel_root);
        p->rho_dh = rho_dh = (p->rho_dh - 3.0f * p->mass * kernel_root) * ih4;
        wcount = (p->density.wcount + kernel_root) *
                 (4.0f / 3.0 * M_PI * kernel_gamma3);
        wcount_dh =
            p->density.wcount_dh * ih * (4.0f / 3.0 * M_PI * kernel_gamma3);

        /* If no derivative, double the smoothing length. */
        if (wcount_dh == 0.0f) h_corr = p->h;

        /* Otherwise, compute the smoothing length update (Newton step). */
        else {
          h_corr = (kernel_nwneigh - wcount) / wcount_dh;

          /* Truncate to the range [ -p->h/2 , p->h ]. */
          h_corr = fminf(h_corr, h);
          h_corr = fmaxf(h_corr, -h / 2.f);
Pedro Gonnet's avatar
Pedro Gonnet committed
566
        }
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586

        /* Apply the correction to p->h and to the compact part. */
        p->h += h_corr;

        /* Did we get the right number density? */
        if (wcount > kernel_nwneigh + const_delta_nwneigh ||
            wcount < kernel_nwneigh - const_delta_nwneigh) {
          // message( "particle %lli (h=%e,depth=%i) has bad wcount=%.3f." ,
          // p->id , p->h , c->depth , wcount ); fflush(stdout);
          // p->h += ( p->density.wcount + kernel_root - kernel_nwneigh ) /
          // p->density.wcount_dh;
          pid[redo] = pid[i];
          redo += 1;
          p->density.wcount = 0.0;
          p->density.wcount_dh = 0.0;
          p->rho = 0.0;
          p->rho_dh = 0.0;
          p->density.div_v = 0.0;
          for (k = 0; k < 3; k++) p->density.curl_v[k] = 0.0;
          continue;
587
588
        }

589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
        /* Pre-compute some stuff for the balsara switch. */
        normDiv_v = fabs(p->density.div_v / rho * ih4);
        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]) /
                     rho * ih4;

        /* As of here, particle force variables will be set. Do _NOT_
           try to read any particle density variables! */

        /* Compute this particle's sound speed. */
        u = p->u;
        p->force.c = fc =
            sqrtf(const_hydro_gamma * (const_hydro_gamma - 1.0f) * u);

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

        /* Balsara switch */
        p->force.balsara =
            normDiv_v / (normDiv_v + normCurl_v + 0.0001f * fc * ih);

#ifndef LEGACY_GADGET2_SPH
        /* Viscosity parameter decay time */
        tau = h / (2.f * const_viscosity_length * p->force.c);

        /* Viscosity source term */
        S = fmaxf(-normDiv_v, 0.f);

        /* Compute the particle's viscosity parameter time derivative */
        alpha_dot = (const_viscosity_alpha_min - p->alpha) / tau +
                    (const_viscosity_alpha_max - p->alpha) * S;

623
        /* Update particle's viscosity parameter */
624
625
626
627
628
629
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
        p->alpha += alpha_dot * p->dt;
#endif

        /* Reset the acceleration. */
        for (k = 0; k < 3; k++) p->a[k] = 0.0f;

        /* Reset the time derivatives. */
        p->force.u_dt = 0.0f;
        p->force.h_dt = 0.0f;
        p->force.v_sig = 0.0f;
      }
    }

    /* Re-set the counter for the next loop (potentially). */
    count = redo;
    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 (struct link *l = finger->density; l != NULL; l = l->next) {

          /* Self-interaction? */
          if (l->t->type == task_type_self)
            runner_doself_subset_density(r, finger, parts, pid, count);

          /* Otherwise, pair interaction? */
          else if (l->t->type == task_type_pair) {

            /* Left or right? */
            if (l->t->ci == finger)
              runner_dopair_subset_density(r, finger, parts, pid, count,
                                           l->t->cj);
            else
              runner_dopair_subset_density(r, finger, parts, pid, count,
                                           l->t->ci);

          }

          /* Otherwise, sub interaction? */
          else if (l->t->type == task_type_sub) {

            /* Left or right? */
            if (l->t->ci == finger)
              runner_dosub_subset_density(r, finger, parts, pid, count,
                                          l->t->cj, -1, 1);
            else
              runner_dosub_subset_density(r, finger, parts, pid, count,
                                          l->t->ci, -1, 1);
          }
        }
      }
679
    }
680
681
682
683
684
685
686
687
688
689
690
  }

#ifdef TIMER_VERBOSE
  message("runner %02i: %i parts at depth %i took %.3f ms.", r->id, c->count,
          c->depth, ((double)TIMER_TOC(timer_doghost)) / CPU_TPS * 1000);
  fflush(stdout);
#else
  TIMER_TOC(timer_doghost);
#endif
}

691
692
693
694
695
696
697
/**
 * @brief Compute the second kick of the given cell.
 *
 * @param r The runner thread.
 * @param c The cell.
 */

698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
void runner_dokick2(struct runner *r, struct cell *c) {

  int j, k, count = 0, nr_parts = c->count;
  float dt_min = FLT_MAX, dt_max = 0.0f;
  double ekin = 0.0, epot = 0.0;
  float mom[3] = {0.0f, 0.0f, 0.0f}, ang[3] = {0.0f, 0.0f, 0.0f};
  float x[3], v_hdt[3], u_hdt, h, pdt, m;
  float dt_step = r->e->dt_step, dt = r->e->dt, hdt, idt;
  float dt_cfl, dt_h_change, dt_u_change, dt_new;
  float h_dt, u_dt;
  struct part *restrict p, *restrict parts = c->parts;
  struct xpart *restrict xp, *restrict xparts = c->xparts;

  TIMER_TIC

  /* Init idt to avoid compiler stupidity. */
  idt = (dt > 0) ? 1.0f / dt : 0.0f;
  hdt = dt / 2;

  /* Loop over the particles and kick them. */
  for (k = 0; k < nr_parts; k++) {

    /* Get a handle on the part. */
    p = &parts[k];
    xp = &xparts[k];

    /* Get local copies of particle data. */
    pdt = p->dt;
    m = p->mass;
    x[0] = p->x[0];
    x[1] = p->x[1];
    x[2] = p->x[2];
    v_hdt[0] = xp->v_hdt[0];
    v_hdt[1] = xp->v_hdt[1];
    v_hdt[2] = xp->v_hdt[2];
    u_hdt = xp->u_hdt;

    /* Update the particle's data (if active). */
    if (pdt <= dt_step) {

      /* Increase the number of particles updated. */
      count += 1;

      /* Scale the derivatives as they're freshly computed. */
      h = p->h;
      h_dt = p->force.h_dt *= h * 0.333333333f;
      xp->omega = 1.0f + h * p->rho_dh / p->rho * 0.3333333333f;

      /* Compute the new time step. */
      u_dt = p->force.u_dt;
      dt_cfl = const_cfl * h / p->force.v_sig;
      dt_h_change =
          (h_dt != 0.0f) ? fabsf(const_ln_max_h_change * h / h_dt) : FLT_MAX;
      dt_u_change =
          (u_dt != 0.0f) ? fabsf(const_max_u_change * p->u / u_dt) : FLT_MAX;
      dt_new = fminf(dt_cfl, fminf(dt_h_change, dt_u_change));
      if (pdt == 0.0f)
        p->dt = pdt = dt_new;
      else
        p->dt = pdt = fminf(dt_new, 2.0f * pdt);

      /* Update positions and energies at the full step. */
      p->v[0] = v_hdt[0] + hdt * p->a[0];
      p->v[1] = v_hdt[1] + hdt * p->a[1];
      p->v[2] = v_hdt[2] + hdt * p->a[2];
      p->u = u_hdt + hdt * u_dt;

      /* Set the new particle-specific time step. */
      if (dt > 0.0f) {
        float dt_curr = dt;
        j = (int)(pdt * idt);
        while (j > 1) {
          dt_curr *= 2.0f;
          j >>= 1;
772
        }
773
774
        xp->dt_curr = dt_curr;
      }
775
    }
Pedro Gonnet's avatar
Pedro Gonnet committed
776

777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
    /* Get the smallest/largest dt. */
    dt_min = fminf(dt_min, pdt);
    dt_max = fmaxf(dt_max, pdt);

    /* Collect total energy. */
    ekin += 0.5 * m *
            (v_hdt[0] * v_hdt[0] + v_hdt[1] * v_hdt[1] + v_hdt[2] * v_hdt[2]);
    epot += m * u_hdt;

    /* Collect momentum */
    mom[0] += m * v_hdt[0];
    mom[1] += m * v_hdt[1];
    mom[2] += m * v_hdt[2];

    /* Collect angular momentum */
    ang[0] += m * (x[1] * v_hdt[2] - x[2] * v_hdt[1]);
    ang[1] += m * (x[2] * v_hdt[0] - x[0] * v_hdt[2]);
    ang[2] += m * (x[0] * v_hdt[1] - x[1] * v_hdt[0]);

    /* Collect entropic function */
    // lent += u * pow( p->rho, 1.f-const_gamma );
  }

#ifdef TIMER_VERBOSE
  message("runner %02i: %i parts at depth %i took %.3f ms.", r->id, c->count,
          c->depth, ((double)TIMER_TOC(timer_kick2)) / CPU_TPS * 1000);
  fflush(stdout);
#else
  TIMER_TOC(timer_kick2);
#endif

  /* Store the computed values in the cell. */
  c->dt_min = dt_min;
  c->dt_max = dt_max;
  c->updated = count;
  c->ekin = ekin;
  c->epot = epot;
  c->mom[0] = mom[0];
  c->mom[1] = mom[1];
  c->mom[2] = mom[2];
  c->ang[0] = ang[0];
  c->ang[1] = ang[1];
  c->ang[2] = ang[2];
}
Pedro Gonnet's avatar
Pedro Gonnet committed
821

822
823
824
825
826
/**
 * @brief Mapping function to set dt_min and dt_max, do the first
 * kick.
 */

827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
void runner_dokick1(struct runner *r, struct cell *c) {

  int j, k;
  struct engine *e = r->e;
  float pdt, dt_step = e->dt_step, dt = e->dt, hdt = dt / 2;
  float dt_min, dt_max, h_max, dx, dx_max;
  float a[3], v[3], u, u_dt, h, h_dt, w, rho;
  double x[3], x_old[3];
  struct part *restrict p, *restrict parts = c->parts;
  struct xpart *restrict xp, *restrict xparts = c->xparts;

  /* No children? */
  if (!c->split) {

    /* Init the min/max counters. */
    dt_min = FLT_MAX;
    dt_max = 0.0f;
    h_max = 0.0f;
    dx_max = 0.0f;

    /* Loop over parts. */
    for (k = 0; k < c->count; k++) {

      /* Get a handle on the kth particle. */
      p = &parts[k];
      xp = &xparts[k];

      /* Load the data locally. */
      a[0] = p->a[0];
      a[1] = p->a[1];
      a[2] = p->a[2];
      v[0] = p->v[0];
      v[1] = p->v[1];
      v[2] = p->v[2];
      x[0] = p->x[0];
      x[1] = p->x[1];
      x[2] = p->x[2];
      x_old[0] = xp->x_old[0];
      x_old[1] = xp->x_old[1];
      x_old[2] = xp->x_old[2];
      h = p->h;
      u = p->u;
      h_dt = p->force.h_dt;
      u_dt = p->force.u_dt;
      pdt = p->dt;

      /* Store the min/max dt. */
      dt_min = fminf(dt_min, pdt);
      dt_max = fmaxf(dt_max, pdt);

      /* Update the half-step velocities from the current velocities. */
      xp->v_hdt[0] = v[0] + hdt * a[0];
      xp->v_hdt[1] = v[1] + hdt * a[1];
      xp->v_hdt[2] = v[2] + hdt * a[2];
      xp->u_hdt = u + hdt * u_dt;

      /* Move the particles with the velocities at the half-step. */
      p->x[0] = x[0] += dt * xp->v_hdt[0];
      p->x[1] = x[1] += dt * xp->v_hdt[1];
      p->x[2] = x[2] += dt * xp->v_hdt[2];
      dx = sqrtf((x[0] - x_old[0]) * (x[0] - x_old[0]) +
                 (x[1] - x_old[1]) * (x[1] - x_old[1]) +
                 (x[2] - x_old[2]) * (x[2] - x_old[2]));
      dx_max = fmaxf(dx_max, dx);

      /* Update positions and energies at the half-step. */
      p->v[0] = v[0] + dt * a[0];
      p->v[1] = v[1] + dt * a[1];
      p->v[2] = v[2] + dt * a[2];
      w = u_dt / u * dt;
      if (fabsf(w) < 0.01f)
        p->u = u *=
            1.0f +
            w * (1.0f + w * (0.5f + w * (1.0f / 6.0f + 1.0f / 24.0f * w)));
      else
        p->u = u *= expf(w);
      w = h_dt / h * dt;
      if (fabsf(w) < 0.01f)
        p->h = h *=
            1.0f +
            w * (1.0f + w * (0.5f + w * (1.0f / 6.0f + 1.0f / 24.0f * w)));
      else
        p->h = h *= expf(w);
      h_max = fmaxf(h_max, h);

      /* Integrate other values if this particle will not be updated. */
      /* Init fields for density calculation. */
      if (pdt > dt_step) {
        float w = -3.0f * h_dt / h * dt;
        if (fabsf(w) < 0.1f)
          rho = p->rho *=
              1.0f +
              w * (1.0f + w * (0.5f + w * (1.0f / 6.0f + 1.0f / 24.0f * w)));
        else
          rho = p->rho *= expf(w);
        p->force.POrho2 = u * (const_hydro_gamma - 1.0f) / (rho * xp->omega);
      } else {
        p->density.wcount = 0.0f;
        p->density.wcount_dh = 0.0f;
        p->rho = 0.0f;
        p->rho_dh = 0.0f;
        p->density.div_v = 0.0f;
        for (j = 0; j < 3; ++j) p->density.curl_v[j] = 0.0f;
      }
931
932
    }

933
934
  }

935
  /* Otherwise, aggregate data from children. */
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
  else {

    /* Init with the first non-null child. */
    dt_min = FLT_MAX;
    dt_max = 0.0f;
    h_max = 0.0f;
    dx_max = 0.0f;

    /* Loop over the progeny. */
    for (k = 0; k < 8; k++)
      if (c->progeny[k] != NULL) {
        if (c->count < space_subsize) runner_dokick1(r, c->progeny[k]);
        dt_min = fminf(dt_min, c->progeny[k]->dt_min);
        dt_max = fmaxf(dt_max, c->progeny[k]->dt_max);
        h_max = fmaxf(h_max, c->progeny[k]->h_max);
        dx_max = fmaxf(dx_max, c->progeny[k]->dx_max);
      }
  }

  /* Store the values. */
  c->dt_min = dt_min;
  c->dt_max = dt_max;
  c->h_max = h_max;
  c->dx_max = dx_max;
}
961

962
963
964
965
966
/**
 * @brief Combined second and first kick for fixed dt.
 *
 * @param r The runner thread.
 * @param c The cell.
967
 * @param timer The timer
968
969
 */

970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
void runner_dokick(struct runner *r, struct cell *c, int timer) {

  int k, count = 0, nr_parts = c->count, updated;
  float dt_min = FLT_MAX, dt_max = 0.0f;
  float h_max, dx, dx_max;
  double ekin = 0.0, epot = 0.0;
  float mom[3] = {0.0f, 0.0f, 0.0f}, ang[3] = {0.0f, 0.0f, 0.0f};
  float x[3], x_old[3], v_hdt[3], a[3], u, u_hdt, h, pdt, m, w;
  float dt = r->e->dt, hdt = 0.5f * dt;
  float dt_cfl, dt_h_change, dt_u_change, dt_new;
  float h_dt, u_dt;
  struct part *restrict p, *restrict parts = c->parts;
  struct xpart *restrict xp, *restrict xparts = c->xparts;

  TIMER_TIC

  /* No children? */
  if (!c->split) {

    /* Init the min/max counters. */
    dt_min = FLT_MAX;
    dt_max = 0.0f;
    h_max = 0.0f;
    dx_max = 0.0f;

    /* Loop over the particles and kick them. */
    for (k = 0; k < nr_parts; k++) {

      /* Get a handle on the part. */
      p = &parts[k];
      xp = &xparts[k];
For faster browsing, not all history is shown. View entire blame