runner.c 41.1 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 "cell.h"
44
#include "const.h"
Stefan Arridge's avatar
Stefan Arridge committed
45
#include "cooling.h"
46
#include "debug.h"
Matthieu Schaller's avatar
Matthieu Schaller committed
47
#include "drift.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
48
#include "engine.h"
49
#include "error.h"
50
51
#include "gravity.h"
#include "hydro.h"
Matthieu Schaller's avatar
Matthieu Schaller committed
52
#include "hydro_properties.h"
53
#include "kick.h"
54
#include "minmax.h"
55
#include "scheduler.h"
56
#include "sourceterms.h"
57
58
59
#include "space.h"
#include "task.h"
#include "timers.h"
60
#include "timestep.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
61

62
63
64
65
66
67
68
69
70
71
72
73
/**
 * @brief  Entry in a list of sorted indices.
 */
struct entry {

  /*! Distance on the axis */
  float d;

  /*! Particle index */
  int i;
};

74
/* Orientation of the cell pairs */
Matthieu Schaller's avatar
Matthieu Schaller committed
75
76
const double runner_shift[13][3] = {
    {5.773502691896258e-01, 5.773502691896258e-01, 5.773502691896258e-01},
77
    {7.071067811865475e-01, 7.071067811865475e-01, 0.0},
Matthieu Schaller's avatar
Matthieu Schaller committed
78
79
80
81
82
83
84
85
86
87
88
    {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},
Matthieu Schaller's avatar
Matthieu Schaller committed
89
};
90
91

/* Does the axis need flipping ? */
92
93
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
94

95
/* Import the density loop functions. */
96
97
98
#define FUNCTION density
#include "runner_doiact.h"

99
/* Import the gradient loop functions (if required). */
100
101
102
103
104
105
#ifdef EXTRA_HYDRO_LOOP
#undef FUNCTION
#define FUNCTION gradient
#include "runner_doiact.h"
#endif

106
/* Import the force loop functions. */
107
108
109
110
#undef FUNCTION
#define FUNCTION force
#include "runner_doiact.h"

111
/* Import the gravity loop functions. */
112
#include "runner_doiact_fft.h"
Matthieu Schaller's avatar
Matthieu Schaller committed
113
#include "runner_doiact_grav.h"
114

Tom Theuns's avatar
Tom Theuns committed
115
/**
Tom Theuns's avatar
Tom Theuns committed
116
 * @brief Perform source terms
Tom Theuns's avatar
Tom Theuns committed
117
118
119
120
121
122
123
124
 *
 * @param r runner task
 * @param c cell
 * @param timer 1 if the time is to be recorded.
 */
void runner_do_sourceterms(struct runner *r, struct cell *c, int timer) {

  struct part *restrict parts = c->parts;
Tom Theuns's avatar
Tom Theuns committed
125
  struct xpart *restrict xparts = c->xparts;
Tom Theuns's avatar
Tom Theuns committed
126
  const int count = c->count;
127
  const double cell_min[3] = {c->loc[0], c->loc[1], c->loc[2]};
Tom Theuns's avatar
Tom Theuns committed
128
129
  const double cell_width[3] = {c->width[0], c->width[1], c->width[2]};
  const int ti_current = r->e->ti_current;
Tom Theuns's avatar
Tom Theuns committed
130
  struct sourceterms *sourceterms = r->e->sourceterms;
131
132
133
134
  const double location[3] = {sourceterms->supernova.x,
                              sourceterms->supernova.y,
                              sourceterms->supernova.z};
  const int dimen = 3;
Tom Theuns's avatar
Tom Theuns committed
135
136
137
138
139
140
141
142
143
144
145
  const double timeBase = r->e->timeBase;

  TIMER_TIC;

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

Tom Theuns's avatar
Tom Theuns committed
146
  /* is supernova still active? */
Tom Theuns's avatar
Tom Theuns committed
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
173
174
175
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
  if (sourceterms->supernova.status == supernova_is_not_done) {
    /* does cell contain explosion? */
    if (count > 0) {
      const int incell = is_in_cell(cell_min, cell_width, location, dimen);
      if (incell == 1) {

        /* inject SN energy into particle with highest id, if it is active */
        int imax = 0;
        struct part *restrict p_sn = NULL;
        struct xpart *restrict xp_sn = NULL;

        for (int i = 0; i < count; i++) {

          /* Get a direct pointer on the part. */
          struct part *restrict p = &parts[i];
          if (p->id > imax) {
            imax = p->id;
            p_sn = p;
            xp_sn = &xparts[i];
          }
        }

        /* Is this part within the time step? */
        if (p_sn->ti_begin == ti_current) {

          /* Does this time step straddle the feedback injection time? */
          const float t_begin = p_sn->ti_begin * timeBase;
          const float t_end = p_sn->ti_end * timeBase;
          if (t_begin <= sourceterms->supernova.time &&
              t_end > sourceterms->supernova.time) {

            /* store old time step */
            const int dti_old = p_sn->ti_end - p_sn->ti_begin;

            /* add supernova feedback */
            do_supernova_feedback(sourceterms, p_sn);

            /* label supernova as done */
            sourceterms->supernova.status = supernova_is_done;
            message(" applied super nova, time = %d, location= %e %e %e",
                    ti_current, p_sn->x[0], p_sn->x[1], p_sn->x[2]);
            message(" applied super nova, velocity = %e %e %e", p_sn->v[0],
                    p_sn->v[1], p_sn->v[2]);

            /* update timestep if new time step shorter than old time step */
            const int dti = get_part_timestep(p_sn, xp_sn, r->e);
            if (dti < dti_old) {
              p_sn->ti_end = p_sn->ti_begin + dti;
              message(" changed timestep from %d to %d", dti_old, dti);

              /* apply simple time-step limiter on all particles in same cell:
               */
              int i_limit = 0;
              for (int i = 0; i < count; i++) {
                struct part *restrict p = &parts[i];
                const int dti_old = p->ti_end - p->ti_begin;
                if (dti_old > 2 * dti) {
                  i_limit++;
                  const int dti_new = 2 * dti;
                  p->ti_end = p->ti_begin + dti_new;
                  message(" old step = %d new step = %d", dti_old, dti_new);
                } else
                  message(" old step = %d", dti_old);
              }
              message(" count= %d limited timestep of %d particles ", count,
                      i_limit);
            }
            //				  error(" check! ");
          }
        }
      }
    }
  }
Tom Theuns's avatar
Tom Theuns committed
220
221
222
223

  if (timer) TIMER_TOC(timer_dosource);
}

Tom Theuns's avatar
Tom Theuns committed
224
225
226
/**
 * @brief Calculate gravity acceleration from external potential
 *
Matthieu Schaller's avatar
Matthieu Schaller committed
227
228
229
 * @param r runner task
 * @param c cell
 * @param timer 1 if the time is to be recorded.
Tom Theuns's avatar
Tom Theuns committed
230
 */
231
void runner_do_grav_external(struct runner *r, struct cell *c, int timer) {
Tom Theuns's avatar
Tom Theuns committed
232

Matthieu Schaller's avatar
Matthieu Schaller committed
233
234
  struct gpart *restrict gparts = c->gparts;
  const int gcount = c->gcount;
235
  const int ti_current = r->e->ti_current;
Matthieu Schaller's avatar
Matthieu Schaller committed
236
  const struct external_potential *potential = r->e->external_potential;
237
  const struct phys_const *constants = r->e->physical_constants;
238
  const double time = r->e->time;
Matthieu Schaller's avatar
Matthieu Schaller committed
239

240
  TIMER_TIC;
Tom Theuns's avatar
Tom Theuns committed
241

242
243
244
  /* Anything to do here? */
  if (c->ti_end_min > ti_current) return;

Tom Theuns's avatar
Tom Theuns committed
245
246
  /* Recurse? */
  if (c->split) {
Matthieu Schaller's avatar
Matthieu Schaller committed
247
    for (int k = 0; k < 8; k++)
248
      if (c->progeny[k] != NULL) runner_do_grav_external(r, c->progeny[k], 0);
Tom Theuns's avatar
Tom Theuns committed
249
250
251
252
    return;
  }

#ifdef TASK_VERBOSE
Matthieu Schaller's avatar
Matthieu Schaller committed
253
  OUT;
Tom Theuns's avatar
Tom Theuns committed
254
#endif
Matthieu Schaller's avatar
Matthieu Schaller committed
255

256
  /* Loop over the gparts in this cell. */
Matthieu Schaller's avatar
Matthieu Schaller committed
257
  for (int i = 0; i < gcount; i++) {
258

259
    /* Get a direct pointer on the part. */
Matthieu Schaller's avatar
Matthieu Schaller committed
260
    struct gpart *restrict g = &gparts[i];
261
262
263

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

265
      external_gravity_acceleration(time, potential, constants, g);
266
    }
267
  }
Matthieu Schaller's avatar
Matthieu Schaller committed
268

269
  if (timer) TIMER_TOC(timer_dograv_external);
Tom Theuns's avatar
Tom Theuns committed
270
271
}

Stefan Arridge's avatar
Stefan Arridge committed
272
/**
273
274
 * @brief Calculate change in thermal state of particles induced
 * by radiative cooling and heating.
Stefan Arridge's avatar
Stefan Arridge committed
275
276
277
278
279
280
281
282
 *
 * @param r runner task
 * @param c cell
 * @param timer 1 if the time is to be recorded.
 */
void runner_do_cooling(struct runner *r, struct cell *c, int timer) {

  struct part *restrict parts = c->parts;
283
  struct xpart *restrict xparts = c->xparts;
Stefan Arridge's avatar
Stefan Arridge committed
284
285
  const int count = c->count;
  const int ti_current = r->e->ti_current;
286
  const struct cooling_function_data *cooling_func = r->e->cooling_func;
Stefan Arridge's avatar
Stefan Arridge committed
287
  const struct phys_const *constants = r->e->physical_constants;
288
  const struct UnitSystem *us = r->e->internalUnits;
Stefan Arridge's avatar
Stefan Arridge committed
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
  const double timeBase = r->e->timeBase;

  TIMER_TIC;

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

#ifdef TASK_VERBOSE
  OUT;
#endif

Stefan Arridge's avatar
Stefan Arridge committed
304
  /* Loop over the parts in this cell. */
Stefan Arridge's avatar
Stefan Arridge committed
305
306
307
308
  for (int i = 0; i < count; i++) {

    /* Get a direct pointer on the part. */
    struct part *restrict p = &parts[i];
309
    struct xpart *restrict xp = &xparts[i];
Stefan Arridge's avatar
Stefan Arridge committed
310

Stefan Arridge's avatar
Stefan Arridge committed
311
312
    /* Kick has already updated ti_end, so need to check ti_begin */
    if (p->ti_begin == ti_current) {
313
314
315

      const double dt = (p->ti_end - p->ti_begin) * timeBase;

316
      cooling_cool_part(constants, us, cooling_func, p, xp, dt);
Stefan Arridge's avatar
Stefan Arridge committed
317
318
319
320
321
322
    }
  }

  if (timer) TIMER_TOC(timer_do_cooling);
}

Pedro Gonnet's avatar
Pedro Gonnet committed
323
324
325
326
327
328
/**
 * @brief Sort the entries in ascending order using QuickSort.
 *
 * @param sort The entries
 * @param N The number of entries.
 */
329
void runner_do_sort_ascending(struct entry *sort, int N) {
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

  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
384
        }
385
386
387
388
389
390
391
392
393
394
395
396
      } 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
397
    }
398
399
400
  }
}

Pedro Gonnet's avatar
Pedro Gonnet committed
401
402
403
404
405
/**
 * @brief Sort the particles in the given cell along all cardinal directions.
 *
 * @param r The #runner.
 * @param c The #cell.
406
 * @param flags Cell flag.
407
408
 * @param clock Flag indicating whether to record the timing or not, needed
 *      for recursive calls.
Pedro Gonnet's avatar
Pedro Gonnet committed
409
 */
410
void runner_do_sort(struct runner *r, struct cell *c, int flags, int clock) {
411
412
413
414
415
416
417

  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;
Matthieu Schaller's avatar
Matthieu Schaller committed
418
419
  float buff[8];
  double px[3];
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443

  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;
444
      if (missing) runner_do_sort(r, c->progeny[k], missing, 0);
445
446
447
448
449
450
451
452
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
494
495
496
    }

    /* 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
497
        }
498

499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
      } /* 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;
Matthieu Schaller's avatar
Matthieu Schaller committed
523
524
525
          sort[j * (count + 1) + k].d = px[0] * runner_shift[j][0] +
                                        px[1] * runner_shift[j][1] +
                                        px[2] * runner_shift[j][2];
526
        }
527
    }
528
529
530
531
532
533

    /* 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;
534
        runner_do_sort_ascending(&sort[j * (count + 1)], count);
535
536
537
538
        c->sorted |= (1 << j);
      }
  }

539
#ifdef SWIFT_DEBUG_CHECKS
Matthieu Schaller's avatar
Matthieu Schaller committed
540
  /* Verify the sorting. */
541
542
543
544
545
546
547
548
549
550
  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.");
    }
  }
#endif
551
552
553
554

  if (clock) TIMER_TOC(timer_dosort);
}

555
556
557
558
559
/**
 * @brief Initialize the particles before the density calculation
 *
 * @param r The runner thread.
 * @param c The cell.
Matthieu Schaller's avatar
Matthieu Schaller committed
560
 * @param timer 1 if the time is to be recorded.
561
 */
562
void runner_do_init(struct runner *r, struct cell *c, int timer) {
563

Matthieu Schaller's avatar
Matthieu Schaller committed
564
565
  struct part *restrict parts = c->parts;
  struct gpart *restrict gparts = c->gparts;
Matthieu Schaller's avatar
Matthieu Schaller committed
566
  const int count = c->count;
567
  const int gcount = c->gcount;
568
  const int ti_current = r->e->ti_current;
569
570

  TIMER_TIC;
571

572
573
574
  /* Anything to do here? */
  if (c->ti_end_min > ti_current) return;

575
576
  /* Recurse? */
  if (c->split) {
Matthieu Schaller's avatar
Matthieu Schaller committed
577
    for (int k = 0; k < 8; k++)
578
      if (c->progeny[k] != NULL) runner_do_init(r, c->progeny[k], 0);
579
    return;
580
581
  } else {

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

585
      /* Get a direct pointer on the part. */
586
      struct part *restrict p = &parts[i];
587

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

590
591
        /* Get ready for a density calculation */
        hydro_init_part(p);
592
      }
593
    }
594
595
596
597
598

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

      /* Get a direct pointer on the part. */
599
      struct gpart *restrict gp = &gparts[i];
600
601
602
603

      if (gp->ti_end <= ti_current) {

        /* Get ready for a density calculation */
604
        gravity_init_gpart(gp);
605
606
      }
    }
607
  }
608

Peter W. Draper's avatar
Peter W. Draper committed
609
  if (timer) TIMER_TOC(timer_init);
610
611
}

612
/**
613
614
615
616
617
618
619
 * @brief Intermediate task after the gradient loop that does final operations
 * on the gradient quantities and optionally slope limits the gradients
 *
 * @param r The runner thread.
 * @param c The cell.
 */
void runner_do_extra_ghost(struct runner *r, struct cell *c) {
620

621
#ifdef EXTRA_HYDRO_LOOP
622

623
624
625
626
  struct part *restrict parts = c->parts;
  const int count = c->count;
  const int ti_current = r->e->ti_current;

627
628
629
  /* Anything to do here? */
  if (c->ti_end_min > ti_current) return;

630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
  /* Recurse? */
  if (c->split) {
    for (int k = 0; k < 8; k++)
      if (c->progeny[k] != NULL) runner_do_extra_ghost(r, c->progeny[k]);
    return;
  } else {

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

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

      if (p->ti_end <= ti_current) {

        /* Get ready for a force calculation */
        hydro_end_gradient(p);
      }
    }
  }
650
651
652

#else
  error("SWIFT was not compiled with the extra hydro loop activated.");
653
#endif
654
}
655

656
/**
657
658
 * @brief Intermediate task after the density to check that the smoothing
 * lengths are correct.
659
 *
Pedro Gonnet's avatar
Pedro Gonnet committed
660
 * @param r The runner thread.
661
 * @param c The cell.
662
 */
Matthieu Schaller's avatar
Matthieu Schaller committed
663
void runner_do_ghost(struct runner *r, struct cell *c) {
664

Matthieu Schaller's avatar
Matthieu Schaller committed
665
666
  struct part *restrict parts = c->parts;
  struct xpart *restrict xparts = c->xparts;
Matthieu Schaller's avatar
Matthieu Schaller committed
667
  int redo, count = c->count;
668
669
  const int ti_current = r->e->ti_current;
  const double timeBase = r->e->timeBase;
670
671
672
673
674
675
676
  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;
677

678
679
  TIMER_TIC;

680
681
682
  /* Anything to do here? */
  if (c->ti_end_min > ti_current) return;

683
684
  /* Recurse? */
  if (c->split) {
Matthieu Schaller's avatar
Matthieu Schaller committed
685
    for (int k = 0; k < 8; k++)
Matthieu Schaller's avatar
Matthieu Schaller committed
686
      if (c->progeny[k] != NULL) runner_do_ghost(r, c->progeny[k]);
687
688
689
690
    return;
  }

  /* Init the IDs that have to be updated. */
691
692
693
  int *pid = NULL;
  if ((pid = malloc(sizeof(int) * count)) == NULL)
    error("Can't allocate memory for pid.");
Matthieu Schaller's avatar
Matthieu Schaller committed
694
  for (int k = 0; k < count; k++) pid[k] = k;
695
696

  /* While there are particles that need to be updated... */
697
  for (int num_reruns = 0; count > 0 && num_reruns < max_smoothing_iter;
Matthieu Schaller's avatar
Matthieu Schaller committed
698
       num_reruns++) {
699
700
701

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

703
    /* Loop over the parts in this cell. */
Matthieu Schaller's avatar
Matthieu Schaller committed
704
    for (int i = 0; i < count; i++) {
705
706

      /* Get a direct pointer on the part. */
707
708
      struct part *restrict p = &parts[pid[i]];
      struct xpart *restrict xp = &xparts[pid[i]];
709
710

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

713
        /* Finish the density calculation */
714
        hydro_end_density(p, ti_current);
715

Matthieu Schaller's avatar
Matthieu Schaller committed
716
717
        float h_corr = 0.f;

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

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

          /* Truncate to the range [ -p->h/2 , p->h ]. */
726
727
          h_corr = (h_corr < p->h) ? h_corr : p->h;
          h_corr = (h_corr > -0.5f * p->h) ? h_corr : -0.5f * p->h;
Pedro Gonnet's avatar
Pedro Gonnet committed
728
        }
729
730

        /* Did we get the right number density? */
731
        if (p->density.wcount > max_wcount || p->density.wcount < min_wcount) {
732
733
734
735

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

736
          /* Flag for another round of fun */
737
738
          pid[redo] = pid[i];
          redo += 1;
739

740
741
          /* Re-initialise everything */
          hydro_init_part(p);
742

743
          /* Off we go ! */
744
          continue;
745
746
        }

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

749
        /* As of here, particle force variables will be set. */
750

751
        /* Compute variables required for the force loop */
752
        hydro_prepare_force(p, xp, ti_current, timeBase);
753

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

757
758
        /* Prepare the particle for the force loop over neighbours */
        hydro_reset_acceleration(p);
759
760
761
      }
    }

762
763
764
    /* We now need to treat the particles whose smoothing length had not
     * converged again */

765
766
767
768
769
    /* Re-set the counter for the next loop (potentially). */
    count = redo;
    if (count > 0) {

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

772
773
        /* 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
774

775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
          /* 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);

          }

792
793
794
795
796
797
798
          /* Otherwise, sub-self interaction? */
          else if (l->t->type == task_type_sub_self)
            runner_dosub_subset_density(r, finger, parts, pid, count, NULL, -1,
                                        1);

          /* Otherwise, sub-pair interaction? */
          else if (l->t->type == task_type_sub_pair) {
799
800
801
802
803
804
805
806
807
808
809

            /* 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);
          }
        }
      }
810
    }
811
  }
812

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

816
817
818
  /* Be clean */
  free(pid);

Matthieu Schaller's avatar
Matthieu Schaller committed
819
  TIMER_TOC(timer_do_ghost);
820
821
}

822
/**
823
 * @brief Drift particles and g-particles in a cell forward in time
824
825
 *
 * @param c The cell.
826
 * @param e The engine.
827
 */
828
static void runner_do_drift(struct cell *c, struct engine *e) {
829

830
  const double timeBase = e->timeBase;
831
  const int ti_old = c->ti_old;
832
  const int ti_current = e->ti_current;
833
834
835
  struct part *const parts = c->parts;
  struct xpart *const xparts = c->xparts;
  struct gpart *const gparts = c->gparts;
836

837
838
839
  /* Do we need to drift ? */
  if (!e->drift_all && !cell_is_drift_needed(c, ti_current)) return;

840
841
842
  /* Check that we are actually going to move forward. */
  if (ti_current == ti_old) return;

843
844
845
846
  /* Drift from the last time the cell was drifted to the current time */
  const double dt = (ti_current - ti_old) * timeBase;

  float dx_max = 0.f, dx2_max = 0.f, h_max = 0.f;
847
848
  double e_kin = 0.0, e_int = 0.0, e_pot = 0.0, e_rad = 0.0;
  double entropy = 0.0, mass = 0.0;
849
850
851
  double mom[3] = {0.0, 0.0, 0.0};
  double ang_mom[3] = {0.0, 0.0, 0.0};

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

855
    /* Loop over all the g-particles in the cell */
856
    const size_t nr_gparts = c->gcount;
Peter W. Draper's avatar
Peter W. Draper committed
857
858
    for (size_t k = 0; k < nr_gparts; k++) {

859
      /* Get a handle on the gpart. */
860
      struct gpart *const gp = &gparts[k];
861
862

      /* Drift... */
863
      drift_gpart(gp, dt, timeBase, ti_old, ti_current);
864
865
866
867
868

      /* 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];
869
      dx2_max = (dx2_max > dx2) ? dx2_max : dx2;
870
871
872
    }

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

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

880
      /* Drift... */
881
      drift_part(p, xp, dt, timeBase, ti_old, ti_current);
882

883
      /* Compute (square of) motion since last cell construction */
884
885
886
      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];
887
      dx2_max = (dx2_max > dx2) ? dx2_max : dx2;
Matthieu Schaller's avatar
Matthieu Schaller committed
888
889

      /* Maximal smoothing length */
890
      h_max = (h_max > p->h) ? h_max : p->h;
891
892
893
894
895
896
897
898
899

      /* Now collect quantities for statistics */

      const float half_dt =
          (ti_current - (p->ti_begin + p->ti_end) / 2) * timeBase;
      const double x[3] = {p->x[0], p->x[1], p->x[2]};
      const float v[3] = {xp->v_full[0] + p->a_hydro[0] * half_dt,
                          xp->v_full[1] + p->a_hydro[1] * half_dt,
                          xp->v_full[2] + p->a_hydro[2] * half_dt};
900
901

      const float m = hydro_get_mass(p);
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918

      /* Collect mass */
      mass += m;

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

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

      /* Collect energies. */
      e_kin += 0.5 * m * (v[0] * v[0] + v[1] * v[1] + v[2] * v[2]);
      e_pot += 0.;
919
      e_int += m * hydro_get_internal_energy(p, half_dt);
920
      e_rad += cooling_get_radiated_energy(xp);
921
922

      /* Collect entropy */
923
      entropy += m * hydro_get_entropy(p, half_dt);
924
    }
925
926

    /* Now, get the maximal particle motion from its square */
927
    dx_max = sqrtf(dx2_max);
928
  }
929

Matthieu Schaller's avatar
Matthieu Schaller committed
930
931
932
  /* Otherwise, aggregate data from children. */
  else {

933
    /* Loop over the progeny and collect their data. */
Matthieu Schaller's avatar
Matthieu Schaller committed
934
935
    for (int k = 0; k < 8; k++)
      if (c->progeny[k] != NULL) {
936
        struct cell *cp = c->progeny[k];
937

938
939
        /* Recurse. */
        runner_do_drift(cp, e);
Matthieu Schaller's avatar
Matthieu Schaller committed
940

941
942
        dx_max = max(dx_max, cp->dx_max);
        h_max = max(h_max, cp->h_max);
943
944
945
946
        mass += cp->mass;
        e_kin += cp->e_kin;
        e_int += cp->e_int;
        e_pot += cp->e_pot;
947
        e_rad += cp->e_rad;
948
        entropy += cp->entropy;
949
950
951
952
953
954
        mom[0] += cp->mom[0];
        mom[1] += cp->mom[1];
        mom[2] += cp->mom[2];
        ang_mom[0] += cp->ang_mom[0];
        ang_mom[1] += cp->ang_mom[1];
        ang_mom[2] += cp->ang_mom[2];
Matthieu Schaller's avatar
Matthieu Schaller committed
955
956
957
958
959
960
      }
  }

  /* Store the values */
  c->h_max = h_max;
  c->dx_max = dx_max;
961
962
963
964
  c->mass = mass;
  c->e_kin = e_kin;
  c->e_int = e_int;
  c->e_pot = e_pot;
965
  c->e_rad = e_rad;
966
  c->entropy = entropy;
967
968
969
970
971
972
  c->mom[0] = mom[0];
  c->mom[1] = mom[1];
  c->mom[2] = mom[2];
  c->ang_mom[0] = ang_mom[0];
  c->ang_mom[1] = ang_mom[1];
  c->ang_mom[2] = ang_mom[2];
973

974
975
  /* Update the time of the last drift */
  c->ti_old = ti_current;
976
}
977

978
979
980
981
982
983
984
985
986
987
/**
 * @brief Mapper function to drift particles and g-particles forward in time.
 *
 * @param map_data An array of #cell%s.
 * @param num_elements Chunk size.
 * @param extra_data Pointer to an #engine.
 */

void runner_do_drift_mapper(void *map_data, int num_elements,
                            void *extra_data) {
988

989
990
991
992
993
  struct engine *e = (struct engine *)extra_data;
  struct cell *cells = (struct cell *)map_data;

  for (int ind = 0; ind < num_elements; ind++) {
    struct cell *c = &cells[ind];
994

995
    /* Only drift local particles. */
Peter W. Draper's avatar
Peter W. Draper committed
996
    if (c != NULL && c->nodeID == e->nodeID) runner_do_drift(c, e);
997
  }
998
}
999

1000
/**
For faster browsing, not all history is shown. View entire blame