runner.c 43.9 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
 *                    Matthieu Schaller (matthieu.schaller@durham.ac.uk)
 *               2015 Peter W. Draper (p.w.draper@durham.ac.uk)
 *               2016 John A. Regan (john.a.regan@durham.ac.uk)
 *                    Tom Theuns (tom.theuns@durham.ac.uk)
8
 *
9
10
11
12
 * 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.
13
 *
14
15
16
17
 * 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.
18
 *
19
20
 * 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/>.
21
 *
22
 ******************************************************************************/
Pedro Gonnet's avatar
Pedro Gonnet committed
23

Pedro Gonnet's avatar
Pedro Gonnet committed
24
25
/* Config parameters. */
#include "../config.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
26
27
28
29

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

32
33
/* MPI headers. */
#ifdef WITH_MPI
34
#include <mpi.h>
35
36
#endif

37
38
39
/* This object's header. */
#include "runner.h"

Pedro Gonnet's avatar
Pedro Gonnet committed
40
/* Local headers. */
Matthieu Schaller's avatar
Matthieu Schaller committed
41
#include "approx_math.h"
42
#include "atomic.h"
43
#include "const.h"
44
#include "debug.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
45
#include "engine.h"
46
#include "error.h"
47
#include "gravity.h"
48
#include "hydro_properties.h"
49
#include "hydro.h"
50
#include "kick.h"
51
#include "minmax.h"
52
53
54
55
#include "scheduler.h"
#include "space.h"
#include "task.h"
#include "timers.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
56

57
/* Orientation of the cell pairs */
58
59
60
61
62
63
64
65
66
67
68
69
70
71
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, };
72
73

/* Does the axis need flipping ? */
74
75
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

Matthieu Schaller's avatar
Matthieu Schaller committed
77
78
79
80
81
82
/* #define MY_CELL 428428428 */
/* #define DX 0.1 */
/* #define NX 1000 */
/* #define CELL_ID                                                  \ */
/*   ((int)(c->loc[0] / DX) * NX *NX + (int)(c->loc[1] / DX) * NX + \ */
/*    (int)(c->loc[2] / DX)) */
83
84
85
86
/* #define OUT \ */
/*   if (CELL_ID == MY_CELL) { \ */
/*     message(" cell= %d gcount=%d time=%f \n", CELL_ID, c->gcount,
 * r->e->time); \ */
Matthieu Schaller's avatar
Matthieu Schaller committed
87
88
89
90
/*   } */
/* #define OUT  message(" cell %d %d %f \n",CELL_ID, c->count, r->e->time); */
/* #define OUT  if(CELL_ID == MY_CELL) message("\n cell %f %f %f %d %d */
/* %f\n",c->loc[0],c->loc[1],c->loc[2], CELL_ID, c->count, r->e->time); */
Tom Theuns's avatar
Tom Theuns committed
91

92
/* Import the density loop functions. */
93
94
95
#define FUNCTION density
#include "runner_doiact.h"

96
/* Import the force loop functions. */
97
98
99
100
#undef FUNCTION
#define FUNCTION force
#include "runner_doiact.h"

101
102
103
/* Import the gravity loop functions. */
#include "runner_doiact_grav.h"

Tom Theuns's avatar
Tom Theuns committed
104
105
106
/**
 * @brief Calculate gravity acceleration from external potential
 *
Matthieu Schaller's avatar
Matthieu Schaller committed
107
108
109
 * @param r runner task
 * @param c cell
 * @param timer 1 if the time is to be recorded.
Tom Theuns's avatar
Tom Theuns committed
110
 */
111
void runner_do_grav_external(struct runner *r, struct cell *c, int timer) {
Tom Theuns's avatar
Tom Theuns committed
112

113
114
115
  struct gpart *g, *gparts = c->gparts;
  int i, k, gcount = c->gcount;
  const int ti_current = r->e->ti_current;
Matthieu Schaller's avatar
Matthieu Schaller committed
116
  const struct external_potential *potential = r->e->external_potential;
117
  const struct phys_const *constants = r->e->physical_constants;
Matthieu Schaller's avatar
Matthieu Schaller committed
118

119
  TIMER_TIC;
Tom Theuns's avatar
Tom Theuns committed
120
121
122
123

  /* Recurse? */
  if (c->split) {
    for (k = 0; k < 8; k++)
124
      if (c->progeny[k] != NULL) runner_do_grav_external(r, c->progeny[k], 0);
Tom Theuns's avatar
Tom Theuns committed
125
126
127
128
    return;
  }

#ifdef TASK_VERBOSE
Matthieu Schaller's avatar
Matthieu Schaller committed
129
  OUT;
Tom Theuns's avatar
Tom Theuns committed
130
#endif
Matthieu Schaller's avatar
Matthieu Schaller committed
131

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

135
136
137
138
139
    /* Get a direct pointer on the part. */
    g = &gparts[i];

    /* Is this part within the time step? */
    if (g->ti_end <= ti_current) {
Matthieu Schaller's avatar
Matthieu Schaller committed
140

141
      external_gravity(potential, constants, g);
Matthieu Schaller's avatar
Matthieu Schaller committed
142

Matthieu Schaller's avatar
Matthieu Schaller committed
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
169
170
171
172
      /* /\* check for energy and angular momentum conservation - begin by */
      /*  * synchronizing velocity*\/ */
      /* const float dx = g->x[0] - r->e->potential->point_mass.x; */
      /* const float dy = g->x[1] - r->e->potential->point_mass.y; */
      /* const float dz = g->x[2] - r->e->potential->point_mass.z; */
      /* const float dr = sqrtf((dx * dx) + (dy * dy) + (dz * dz)); */
      /* const float rinv = 1.f / sqrtf(dx * dx + dy * dy + dz * dz); */

      /* const int current_dti = g->ti_end - g->ti_begin; */
      /* const float dt = 0.5f * current_dti * r->e->timeBase; */
      /* const float vx = g->v_full[0] + dt * g->a_grav[0]; */
      /* const float vy = g->v_full[1] + dt * g->a_grav[1]; */
      /* const float vz = g->v_full[2] + dt * g->a_grav[2]; */

      /* /\* E/L *\/ */
      /* float L[3], E; */
      /* E = 0.5 * ((vx * vx) + (vy * vy) + (vz * vz)) - */
      /*     r->e->physical_constants->newton_gravity * */
      /*         r->e->potential->point_mass.mass * rinv; */
      /* L[0] = dy * vz - dz * vy; */
      /* L[1] = dz * vx - dx * vz; */
      /* L[2] = dx * vy - dy * vx; */
      /* if (abs(g->id) == 1) { */
      /*   float v2 = vx * vx + vy * vy + vz * vz; */
      /*   float fg = r->e->physical_constants->newton_gravity * */
      /*              r->e->potential->point_mass.mass * rinv; */
      /*   float fga = sqrtf((g->a_grav[0] * g->a_grav[0]) + */
      /*                     (g->a_grav[1] * g->a_grav[1]) + */
      /*                     (g->a_grav[2] * g->a_grav[2])) * */
      /*               dr; */
173
174
175
176
      /*   // message("grav_external time= %f\t V_c^2= %f GM/r= %f E= %f L[2]=
       * %f */
      /*   // x= %f y= %f vx= %f vy= %f\n", r->e->time, v2, fg, E, L[2],
       * g->x[0], */
Matthieu Schaller's avatar
Matthieu Schaller committed
177
      /*   // g->x[1], vx, vy); */
178
179
180
181
      /*   message("%f\t %f %f %f %f %f %f %f %f %f %f %f %f %f\n", r->e->time,
       */
      /*           g->tx, g->tv, dt, v2, fg, fga, dr, E, L[2], g->x[0], g->x[1],
       */
Matthieu Schaller's avatar
Matthieu Schaller committed
182
      /*           vx, vy); */
183
184
      /*   /\* message(" G=%e M=%e\n", r->e->physical_constants->newton_gravity,
       */
Matthieu Schaller's avatar
Matthieu Schaller committed
185
186
187
      /*    * r->e->potential->point_mass.mass); *\/ */
      /*   /\* exit(-1); *\/ */
      /* } */
188
    }
189
  }
190
  if (timer) TIMER_TOC(timer_dograv_external);
Tom Theuns's avatar
Tom Theuns committed
191
192
}

Pedro Gonnet's avatar
Pedro Gonnet committed
193
194
195
196
197
198
/**
 * @brief Sort the entries in ascending order using QuickSort.
 *
 * @param sort The entries
 * @param N The number of entries.
 */
199

200
void runner_do_sort_ascending(struct entry *sort, int N) {
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

  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
255
        }
256
257
258
259
260
261
262
263
264
265
266
267
      } 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
268
    }
269
270
271
  }
}

Pedro Gonnet's avatar
Pedro Gonnet committed
272
273
274
275
276
/**
 * @brief Sort the particles in the given cell along all cardinal directions.
 *
 * @param r The #runner.
 * @param c The #cell.
277
 * @param flags Cell flag.
278
279
 * @param clock Flag indicating whether to record the timing or not, needed
 *      for recursive calls.
Pedro Gonnet's avatar
Pedro Gonnet committed
280
 */
281

282
void runner_do_sort(struct runner *r, struct cell *c, int flags, int clock) {
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315

  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;
316
      if (missing) runner_do_sort(r, c->progeny[k], missing, 0);
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
    }

    /* 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
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
      } /* 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];
        }
399
    }
400
401
402
403
404
405

    /* 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;
406
        runner_do_sort_ascending(&sort[j * (count + 1)], count);
407
408
409
410
        c->sorted |= (1 << j);
      }
  }

Matthieu Schaller's avatar
Matthieu Schaller committed
411
412
413
414
415
416
417
418
419
420
421
422
  /* 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." );
          }
      } */
423
424
425
426

  if (clock) TIMER_TOC(timer_dosort);
}

427
void runner_do_gsort(struct runner *r, struct cell *c, int flags, int clock) {
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
453
454
455
456
457
458
459
460

  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;
461
      if (missing) runner_do_gsort(r, c->progeny[k], missing, 0);
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
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
    }

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

516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
      } /* 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
544
    }
545
546
547
548
549
550

    /* 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;
551
        runner_do_sort_ascending(&gsort[j * (count + 1)], count);
552
553
554
555
        c->gsorted |= (1 << j);
      }
  }

Matthieu Schaller's avatar
Matthieu Schaller committed
556
557
558
559
560
561
562
563
564
565
566
567
  /* 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." );
          }
      } */
568
569
570
571

  if (clock) TIMER_TOC(timer_dosort);
}

572
573
574
575
576
/**
 * @brief Initialize the particles before the density calculation
 *
 * @param r The runner thread.
 * @param c The cell.
Matthieu Schaller's avatar
Matthieu Schaller committed
577
 * @param timer 1 if the time is to be recorded.
578
 */
579
void runner_do_init(struct runner *r, struct cell *c, int timer) {
580

581
582
  struct part *const parts = c->parts;
  struct gpart *const gparts = c->gparts;
Matthieu Schaller's avatar
Matthieu Schaller committed
583
  const int count = c->count;
584
  const int gcount = c->gcount;
585
  const int ti_current = r->e->ti_current;
586
587

  TIMER_TIC;
588

589
590
  /* Recurse? */
  if (c->split) {
Matthieu Schaller's avatar
Matthieu Schaller committed
591
    for (int k = 0; k < 8; k++)
592
      if (c->progeny[k] != NULL) runner_do_init(r, c->progeny[k], 0);
593
    return;
594
595
  } else {

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

599
      /* Get a direct pointer on the part. */
600
      struct part *const p = &parts[i];
601

602
      if (p->ti_end <= ti_current) {
Matthieu Schaller's avatar
Matthieu Schaller committed
603

604
605
        /* Get ready for a density calculation */
        hydro_init_part(p);
606
      }
607
    }
608
609
610
611
612
613
614
615
616
617
618
619
620

    /* Loop over the gparts in this cell. */
    for (int i = 0; i < gcount; i++) {

      /* Get a direct pointer on the part. */
      struct gpart *const gp = &gparts[i];

      if (gp->ti_end <= ti_current) {

        /* Get ready for a density calculation */
        gravity_init_part(gp);
      }
    }
621
  }
622

Peter W. Draper's avatar
Peter W. Draper committed
623
  if (timer) TIMER_TOC(timer_init);
624
625
}

626
627
628
/**
 * @brief Intermediate task between density and force
 *
Pedro Gonnet's avatar
Pedro Gonnet committed
629
 * @param r The runner thread.
630
 * @param c The cell.
631
 */
632

Matthieu Schaller's avatar
Matthieu Schaller committed
633
void runner_do_ghost(struct runner *r, struct cell *c) {
634
635

  struct part *p, *parts = c->parts;
636
  struct xpart *xp, *xparts = c->xparts;
637
  struct cell *finger;
Matthieu Schaller's avatar
Matthieu Schaller committed
638
  int redo, count = c->count;
639
  int *pid;
640
  float h_corr;
641
642
  const int ti_current = r->e->ti_current;
  const double timeBase = r->e->timeBase;
643
644
645
646
647
648
649
  const float target_wcount = r->e->hydro_properties->target_neighbours;
  const float max_wcount =
      target_wcount + r->e->hydro_properties->delta_neighbours;
  const float min_wcount =
      target_wcount - r->e->hydro_properties->delta_neighbours;
  const int max_smoothing_iter =
      r->e->hydro_properties->max_smoothing_iterations;
650

651
652
  TIMER_TIC;

653
654
  /* Recurse? */
  if (c->split) {
Matthieu Schaller's avatar
Matthieu Schaller committed
655
    for (int k = 0; k < 8; k++)
Matthieu Schaller's avatar
Matthieu Schaller committed
656
      if (c->progeny[k] != NULL) runner_do_ghost(r, c->progeny[k]);
657
658
659
660
661
662
    return;
  }

  /* Init the IDs that have to be updated. */
  if ((pid = (int *)alloca(sizeof(int) * count)) == NULL)
    error("Call to alloca failed.");
Matthieu Schaller's avatar
Matthieu Schaller committed
663
  for (int k = 0; k < count; k++) pid[k] = k;
664
665

  /* While there are particles that need to be updated... */
666
  for (int num_reruns = 0; count > 0 && num_reruns < max_smoothing_iter;
Matthieu Schaller's avatar
Matthieu Schaller committed
667
       num_reruns++) {
668
669
670

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

672
    /* Loop over the parts in this cell. */
Matthieu Schaller's avatar
Matthieu Schaller committed
673
    for (int i = 0; i < count; i++) {
674
675
676

      /* Get a direct pointer on the part. */
      p = &parts[pid[i]];
677
      xp = &xparts[pid[i]];
678
679

      /* Is this part within the timestep? */
680
      if (p->ti_end <= ti_current) {
681

682
        /* Finish the density calculation */
683
        hydro_end_density(p, ti_current);
684
685

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

        /* Otherwise, compute the smoothing length update (Newton step). */
        else {
690
          h_corr = (target_wcount - p->density.wcount) / p->density.wcount_dh;
691
692

          /* Truncate to the range [ -p->h/2 , p->h ]. */
693
694
          h_corr = fminf(h_corr, p->h);
          h_corr = fmaxf(h_corr, -p->h * 0.5f);
Pedro Gonnet's avatar
Pedro Gonnet committed
695
        }
696
697

        /* Did we get the right number density? */
698
        if (p->density.wcount > max_wcount || p->density.wcount < min_wcount) {
699
700
701
702

          /* Ok, correct then */
          p->h += h_corr;

703
          /* Flag for another round of fun */
704
705
          pid[redo] = pid[i];
          redo += 1;
706

707
708
          /* Re-initialise everything */
          hydro_init_part(p);
709

710
          /* Off we go ! */
711
          continue;
712
713
        }

Matthieu Schaller's avatar
Matthieu Schaller committed
714
        /* We now have a particle whose smoothing length has converged */
Matthieu Schaller's avatar
Matthieu Schaller committed
715

716
        /* As of here, particle force variables will be set. */
717

718
        /* Compute variables required for the force loop */
719
        hydro_prepare_force(p, xp, ti_current, timeBase);
720

Matthieu Schaller's avatar
Matthieu Schaller committed
721
        /* The particle force values are now set.  Do _NOT_
722
           try to read any particle density variables! */
Matthieu Schaller's avatar
Matthieu Schaller committed
723

724
725
        /* Prepare the particle for the force loop over neighbours */
        hydro_reset_acceleration(p);
726
727
728
      }
    }

729
730
731
    /* We now need to treat the particles whose smoothing length had not
     * converged again */

732
733
734
735
736
737
    /* Re-set the counter for the next loop (potentially). */
    count = redo;
    if (count > 0) {

      /* Climb up the cell hierarchy. */
      for (finger = c; finger != NULL; finger = finger->parent) {
Matthieu Schaller's avatar
Matthieu Schaller committed
738

739
740
        /* Run through this cell's density interactions. */
        for (struct link *l = finger->density; l != NULL; l = l->next) {
Matthieu Schaller's avatar
Matthieu Schaller committed
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
          /* 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);
          }
        }
      }
772
    }
773
  }
774

Matthieu Schaller's avatar
Matthieu Schaller committed
775
776
  if (count)
    message("Smoothing length failed to converge on %i particles.", count);
777

Matthieu Schaller's avatar
Matthieu Schaller committed
778
  TIMER_TOC(timer_do_ghost);
779
780
}

781
/**
782
 * @brief Drift particles and g-particles forward in time
783
784
785
 *
 * @param r The runner thread.
 * @param c The cell.
786
 * @param timer Are we timing this ?
787
 */
788
void runner_do_drift(struct runner *r, struct cell *c, int timer) {
789

790
791
  const double timeBase = r->e->timeBase;
  const double dt = (r->e->ti_current - r->e->ti_old) * timeBase;
792
793
794
795
796
  const int ti_old = r->e->ti_old;
  const int ti_current = r->e->ti_current;
  struct part *const parts = c->parts;
  struct xpart *const xparts = c->xparts;
  struct gpart *const gparts = c->gparts;
797
  float dx_max = 0.f, dx2_max = 0.f, h_max = 0.f;
798

799
  TIMER_TIC
Tom Theuns's avatar
Tom Theuns committed
800
#ifdef TASK_VERBOSE
Matthieu Schaller's avatar
Matthieu Schaller committed
801
  OUT;
Tom Theuns's avatar
Tom Theuns committed
802
#endif
803

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

807
    /* Loop over all the g-particles in the cell */
Peter W. Draper's avatar
Peter W. Draper committed
808
809
810
    const int nr_gparts = c->gcount;
    for (size_t k = 0; k < nr_gparts; k++) {

811
812
813
814
815
816
817
      /* Get a handle on the gpart. */
      struct gpart *const gp = &gparts[k];

      /* Drift... */
      gp->x[0] += gp->v_full[0] * dt;
      gp->x[1] += gp->v_full[1] * dt;
      gp->x[2] += gp->v_full[2] * dt;
818
819
820
821
822
823
824
825
826
827
828

      /* Compute offset since last cell construction */
      gp->x_diff[0] -= gp->v_full[0] * dt;
      gp->x_diff[1] -= gp->v_full[1] * dt;
      gp->x_diff[2] -= gp->v_full[2] * dt;

      /* Compute (square of) motion since last cell construction */
      const float dx2 = gp->x_diff[0] * gp->x_diff[0] +
                        gp->x_diff[1] * gp->x_diff[1] +
                        gp->x_diff[2] * gp->x_diff[2];
      dx2_max = fmaxf(dx2_max, dx2);
829
830
831
    }

    /* Loop over all the particles in the cell (more work for these !) */
Peter W. Draper's avatar
Peter W. Draper committed
832
833
    const size_t nr_parts = c->count;
    for (size_t k = 0; k < nr_parts; k++) {
834

835
      /* Get a handle on the part. */
836
837
      struct part *const p = &parts[k];
      struct xpart *const xp = &xparts[k];
838

Matthieu Schaller's avatar
Matthieu Schaller committed
839
840
841
      /* Useful quantity */
      const float h_inv = 1.0f / p->h;

842
843
844
845
      /* Drift... */
      p->x[0] += xp->v_full[0] * dt;
      p->x[1] += xp->v_full[1] * dt;
      p->x[2] += xp->v_full[2] * dt;
846

Matthieu Schaller's avatar
Matthieu Schaller committed
847
      /* Predict velocities (for hydro terms) */
Matthieu Schaller's avatar
Matthieu Schaller committed
848
849
850
      p->v[0] += p->a_hydro[0] * dt;
      p->v[1] += p->a_hydro[1] * dt;
      p->v[2] += p->a_hydro[2] * dt;
851

Matthieu Schaller's avatar
Matthieu Schaller committed
852
      /* Predict smoothing length */
853
854
855
      const float w1 = p->h_dt * h_inv * dt;
      if (fabsf(w1) < 0.2f)
        p->h *= approx_expf(w1); /* 4th order expansion of exp(w) */
Matthieu Schaller's avatar
Matthieu Schaller committed
856
      else
857
        p->h *= expf(w1);
Matthieu Schaller's avatar
Matthieu Schaller committed
858
859

      /* Predict density */
860
861
862
      const float w2 = -3.0f * p->h_dt * h_inv * dt;
      if (fabsf(w2) < 0.2f)
        p->rho *= approx_expf(w2); /* 4th order expansion of exp(w) */
Matthieu Schaller's avatar
Matthieu Schaller committed
863
      else
864
        p->rho *= expf(w2);
865

866
      /* Predict the values of the extra fields */
867
      hydro_predict_extra(p, xp, ti_old, ti_current, timeBase);
868

869
870
871
872
873
      /* Compute offset since last cell construction */
      xp->x_diff[0] -= xp->v_full[0] * dt;
      xp->x_diff[1] -= xp->v_full[1] * dt;
      xp->x_diff[2] -= xp->v_full[2] * dt;

874
      /* Compute (square of) motion since last cell construction */
875
876
877
      const float dx2 = xp->x_diff[0] * xp->x_diff[0] +
                        xp->x_diff[1] * xp->x_diff[1] +
                        xp->x_diff[2] * xp->x_diff[2];
878
      dx2_max = fmaxf(dx2_max, dx2);
Matthieu Schaller's avatar
Matthieu Schaller committed
879
880
881

      /* Maximal smoothing length */
      h_max = fmaxf(p->h, h_max);
882
    }
883
884

    /* Now, get the maximal particle motion from its square */
885
    dx_max = sqrtf(dx2_max);
886
  }
887

Matthieu Schaller's avatar
Matthieu Schaller committed
888
889
890
891
892
893
894
  /* Otherwise, aggregate data from children. */
  else {

    /* Loop over the progeny. */
    for (int k = 0; k < 8; k++)
      if (c->progeny[k] != NULL) {
        struct cell *cp = c->progeny[k];
895
        runner_do_drift(r, cp, 0);
Matthieu Schaller's avatar
Matthieu Schaller committed
896

897
898
        dx_max = fmaxf(dx_max, cp->dx_max);
        h_max = fmaxf(h_max, cp->h_max);
Matthieu Schaller's avatar
Matthieu Schaller committed
899
900
901
902
903
904
      }
  }

  /* Store the values */
  c->h_max = h_max;
  c->dx_max = dx_max;
905

Peter W. Draper's avatar
Peter W. Draper committed
906
  if (timer) TIMER_TOC(timer_drift);
907
}
908

909
/**
Matthieu Schaller's avatar
Matthieu Schaller committed
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
 * @brief Kick particles in momentum space and collect statistics (fixed
 * time-step case)
 *
 * @param r The runner thread.
 * @param c The cell.
 * @param timer Are we timing this ?
 */
void runner_do_kick_fixdt(struct runner *r, struct cell *c, int timer) {

  const double global_dt = r->e->dt_max;
  const double timeBase = r->e->timeBase;
  const int count = c->count;
  const int gcount = c->gcount;
  struct part *const parts = c->parts;
  struct xpart *const xparts = c->xparts;
  struct gpart *const gparts = c->gparts;

  int updated = 0, g_updated = 0;
  int ti_end_min = max_nr_timesteps, ti_end_max = 0;
  double e_kin = 0.0, e_int = 0.0, e_pot = 0.0, mass = 0.0;
  float mom[3] = {0.0f, 0.0f, 0.0f};
  float ang[3] = {0.0f, 0.0f, 0.0f};

  TIMER_TIC

#ifdef TASK_VERBOSE
  OUT;
#endif

  /* The new time-step */
  const int new_dti = global_dt / timeBase;

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

945
    /* Loop over the g-particles and kick everyone. */
Matthieu Schaller's avatar
Matthieu Schaller committed
946
947
948
949
950
    for (int k = 0; k < gcount; k++) {

      /* Get a handle on the part. */
      struct gpart *const gp = &gparts[k];

951
      /* If the g-particle has no counterpart */
Matthieu Schaller's avatar
Matthieu Schaller committed
952
953
954
955
956
      if (gp->id < 0) {

        /* First, finish the force calculation */
        gravity_end_force(gp);

957
958
        /* Kick the g-particle forward */
        kick_gpart(gp, new_dti, timeBase);
Matthieu Schaller's avatar
Matthieu Schaller committed
959
960
961
962
963
964
965
966
967
968
969
970

        /* Number of updated g-particles */
        g_updated++;

        /* Minimal time for next end of time-step */
        ti_end_min = min(gp->ti_end, ti_end_min);
        ti_end_max = max(gp->ti_end, ti_end_max);
      }
    }

    /* Now do the hydro ones... */

971
    /* Loop over the particles and kick everyone. */
Matthieu Schaller's avatar
Matthieu Schaller committed
972
973
974
975
976
977
978
979
980
981
982
983
984
    for (int k = 0; k < count; k++) {

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

      /* First, finish the force loop */
      p->h_dt *= p->h * 0.333333333f;

      /* And do the same of the extra variable */
      hydro_end_force(p);
      if (p->gpart != NULL) gravity_end_force(p->gpart);

985
986
      /* Kick the particle forward */
      kick_part(p, xp, new_dti, timeBase);
Matthieu Schaller's avatar
Matthieu Schaller committed
987
988
989
990
991

      /* Number of updated particles */
      updated++;
      if (p->gpart != NULL) g_updated++;

Matthieu Schaller's avatar
Matthieu Schaller committed
992
993
994
995
      /* Minimal time for next end of time-step */
      ti_end_min = min(p->ti_end, ti_end_min);
      ti_end_max = max(p->ti_end, ti_end_max);

Matthieu Schaller's avatar
Matthieu Schaller committed
996
997
998
999
1000
      /* Now collect quantities for statistics */

      const double x[3] = {p->x[0], p->x[1], p->x[2]};
      const float v_full[3] = {xp->v_full[0], xp->v_full[1], xp->v_full[2]};
      const float m = p->mass;
For faster browsing, not all history is shown. View entire blame