runner_doiact_vec.c 35.4 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
/*******************************************************************************
 * This file is part of SWIFT.
 * Copyright (c) 2016 James Willis (james.s.willis@durham.ac.uk)
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published
 * by the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 *
 ******************************************************************************/

/* Config parameters. */
#include "../config.h"

/* This object's header. */
#include "runner_doiact_vec.h"

26
27
28
/* Local headers. */
#include "active.h"

James Willis's avatar
James Willis committed
29
#ifdef WITH_VECTORIZATION
James Willis's avatar
James Willis committed
30
31
32
/**
 * @brief Compute the vector remainder interactions from the secondary cache.
 *
Matthieu Schaller's avatar
Matthieu Schaller committed
33
 * @param int_cache (return) secondary #cache of interactions between two
James Willis's avatar
James Willis committed
34
 * particles.
James Willis's avatar
James Willis committed
35
 * @param icount Interaction count.
Matthieu Schaller's avatar
Matthieu Schaller committed
36
 * @param rhoSum (return) #vector holding the cumulative sum of the density
James Willis's avatar
James Willis committed
37
 * update on pi.
Matthieu Schaller's avatar
Matthieu Schaller committed
38
 * @param rho_dhSum (return) #vector holding the cumulative sum of the density
James Willis's avatar
James Willis committed
39
 * gradient update on pi.
Matthieu Schaller's avatar
Matthieu Schaller committed
40
 * @param wcountSum (return) #vector holding the cumulative sum of the wcount
James Willis's avatar
James Willis committed
41
 * update on pi.
Matthieu Schaller's avatar
Matthieu Schaller committed
42
 * @param wcount_dhSum (return) #vector holding the cumulative sum of the wcount
James Willis's avatar
James Willis committed
43
 * gradient update on pi.
Matthieu Schaller's avatar
Matthieu Schaller committed
44
 * @param div_vSum (return) #vector holding the cumulative sum of the divergence
James Willis's avatar
James Willis committed
45
 * update on pi.
Matthieu Schaller's avatar
Matthieu Schaller committed
46
 * @param curlvxSum (return) #vector holding the cumulative sum of the curl of
James Willis's avatar
James Willis committed
47
 * vx update on pi.
Matthieu Schaller's avatar
Matthieu Schaller committed
48
 * @param curlvySum (return) #vector holding the cumulative sum of the curl of
James Willis's avatar
James Willis committed
49
 * vy update on pi.
Matthieu Schaller's avatar
Matthieu Schaller committed
50
 * @param curlvzSum (return) #vector holding the cumulative sum of the curl of
James Willis's avatar
James Willis committed
51
 * vz update on pi.
James Willis's avatar
James Willis committed
52
53
54
55
 * @param v_hi_inv #vector of 1/h for pi.
 * @param v_vix #vector of x velocity of pi.
 * @param v_viy #vector of y velocity of pi.
 * @param v_viz #vector of z velocity of pi.
Matthieu Schaller's avatar
Matthieu Schaller committed
56
 * @param icount_align (return) Interaction count after the remainder
James Willis's avatar
James Willis committed
57
 * interactions have been performed, should be a multiple of the vector length.
James Willis's avatar
James Willis committed
58
 */
James Willis's avatar
James Willis committed
59
__attribute__((always_inline)) INLINE static void calcRemInteractions(
Matthieu Schaller's avatar
Matthieu Schaller committed
60
61
62
63
64
    struct c2_cache *const int_cache, const int icount, vector *rhoSum,
    vector *rho_dhSum, vector *wcountSum, vector *wcount_dhSum,
    vector *div_vSum, vector *curlvxSum, vector *curlvySum, vector *curlvzSum,
    vector v_hi_inv, vector v_vix, vector v_viy, vector v_viz,
    int *icount_align) {
65

66
  mask_t int_mask, int_mask2;
James Willis's avatar
James Willis committed
67

James Willis's avatar
James Willis committed
68
  /* Work out the number of remainder interactions and pad secondary cache. */
69
70
71
72
73
74
  *icount_align = icount;
  int rem = icount % (NUM_VEC_PROC * VEC_SIZE);
  if (rem != 0) {
    int pad = (NUM_VEC_PROC * VEC_SIZE) - rem;
    *icount_align += pad;

James Willis's avatar
James Willis committed
75
    /* Initialise masks to true. */
76
77
    vec_init_mask_true(int_mask);
    vec_init_mask_true(int_mask2);
78

James Willis's avatar
James Willis committed
79
80
81
    /* Pad secondary cache so that there are no contributions in the interaction
     * function. */
    for (int i = icount; i < *icount_align; i++) {
82
83
84
85
86
87
88
89
      int_cache->mq[i] = 0.f;
      int_cache->r2q[i] = 1.f;
      int_cache->dxq[i] = 0.f;
      int_cache->dyq[i] = 0.f;
      int_cache->dzq[i] = 0.f;
      int_cache->vxq[i] = 0.f;
      int_cache->vyq[i] = 0.f;
      int_cache->vzq[i] = 0.f;
90
91
92
93
    }

    /* Zero parts of mask that represent the padded values.*/
    if (pad < VEC_SIZE) {
94
      vec_pad_mask(int_mask2, pad);
James Willis's avatar
James Willis committed
95
    } else {
96
97
      vec_pad_mask(int_mask, VEC_SIZE - rem);
      vec_zero_mask(int_mask2);
98
99
    }

James Willis's avatar
James Willis committed
100
101
    /* Perform remainder interaction and remove remainder from aligned
     * interaction count. */
102
    *icount_align = icount - rem;
James Willis's avatar
James Willis committed
103
104
105
106
107
108
109
    runner_iact_nonsym_2_vec_density(
        &int_cache->r2q[*icount_align], &int_cache->dxq[*icount_align],
        &int_cache->dyq[*icount_align], &int_cache->dzq[*icount_align],
        v_hi_inv, v_vix, v_viy, v_viz, &int_cache->vxq[*icount_align],
        &int_cache->vyq[*icount_align], &int_cache->vzq[*icount_align],
        &int_cache->mq[*icount_align], rhoSum, rho_dhSum, wcountSum,
        wcount_dhSum, div_vSum, curlvxSum, curlvySum, curlvzSum, int_mask,
110
        int_mask2, 1);
111
112
113
  }
}

James Willis's avatar
James Willis committed
114
/**
James Willis's avatar
James Willis committed
115
116
 * @brief Left-packs the values needed by an interaction into the secondary
 * cache (Supports AVX, AVX2 and AVX512 instruction sets).
James Willis's avatar
James Willis committed
117
118
 *
 * @param mask Contains which particles need to interact.
Matthieu Schaller's avatar
Matthieu Schaller committed
119
 * @param pjd Index of the particle to store into.
James Willis's avatar
James Willis committed
120
121
122
123
124
 * @param v_r2 #vector of the separation between two particles squared.
 * @param v_dx #vector of the x separation between two particles.
 * @param v_dy #vector of the y separation between two particles.
 * @param v_dz #vector of the z separation between two particles.
 * @param cell_cache #cache of all particles in the cell.
Matthieu Schaller's avatar
Matthieu Schaller committed
125
 * @param int_cache (return) secondary #cache of interactions between two
James Willis's avatar
James Willis committed
126
 * particles.
James Willis's avatar
James Willis committed
127
128
 * @param icount Interaction count.
 * @param rhoSum #vector holding the cumulative sum of the density update on pi.
James Willis's avatar
James Willis committed
129
130
131
132
133
134
135
136
137
138
139
140
141
142
 * @param rho_dhSum #vector holding the cumulative sum of the density gradient
 * update on pi.
 * @param wcountSum #vector holding the cumulative sum of the wcount update on
 * pi.
 * @param wcount_dhSum #vector holding the cumulative sum of the wcount gradient
 * update on pi.
 * @param div_vSum #vector holding the cumulative sum of the divergence update
 * on pi.
 * @param curlvxSum #vector holding the cumulative sum of the curl of vx update
 * on pi.
 * @param curlvySum #vector holding the cumulative sum of the curl of vy update
 * on pi.
 * @param curlvzSum #vector holding the cumulative sum of the curl of vz update
 * on pi.
James Willis's avatar
James Willis committed
143
144
145
146
147
 * @param v_hi_inv #vector of 1/h for pi.
 * @param v_vix #vector of x velocity of pi.
 * @param v_viy #vector of y velocity of pi.
 * @param v_viz #vector of z velocity of pi.
 */
James Willis's avatar
James Willis committed
148
149
__attribute__((always_inline)) INLINE static void storeInteractions(
    const int mask, const int pjd, vector *v_r2, vector *v_dx, vector *v_dy,
150
151
152
153
154
    vector *v_dz, const struct cache *const cell_cache,
    struct c2_cache *const int_cache, int *icount, vector *rhoSum,
    vector *rho_dhSum, vector *wcountSum, vector *wcount_dhSum,
    vector *div_vSum, vector *curlvxSum, vector *curlvySum, vector *curlvzSum,
    vector v_hi_inv, vector v_vix, vector v_viy, vector v_viz) {
James Willis's avatar
James Willis committed
155
156
157

/* Left-pack values needed into the secondary cache using the interaction mask.
 */
158
#if defined(HAVE_AVX2) || defined(HAVE_AVX512_F)
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
  mask_t packed_mask;
  VEC_FORM_PACKED_MASK(mask, packed_mask);

  VEC_LEFT_PACK(v_r2->v, packed_mask, &int_cache->r2q[*icount]);
  VEC_LEFT_PACK(v_dx->v, packed_mask, &int_cache->dxq[*icount]);
  VEC_LEFT_PACK(v_dy->v, packed_mask, &int_cache->dyq[*icount]);
  VEC_LEFT_PACK(v_dz->v, packed_mask, &int_cache->dzq[*icount]);
  VEC_LEFT_PACK(vec_load(&cell_cache->m[pjd]), packed_mask,
                &int_cache->mq[*icount]);
  VEC_LEFT_PACK(vec_load(&cell_cache->vx[pjd]), packed_mask,
                &int_cache->vxq[*icount]);
  VEC_LEFT_PACK(vec_load(&cell_cache->vy[pjd]), packed_mask,
                &int_cache->vyq[*icount]);
  VEC_LEFT_PACK(vec_load(&cell_cache->vz[pjd]), packed_mask,
                &int_cache->vzq[*icount]);

  /* Increment interaction count by number of bits set in mask. */
  (*icount) += __builtin_popcount(mask);
177
#else
James Willis's avatar
James Willis committed
178
  /* Quicker to do it serially in AVX rather than use intrinsics. */
James Willis's avatar
James Willis committed
179
  for (int bit_index = 0; bit_index < VEC_SIZE; bit_index++) {
180
181
    if (mask & (1 << bit_index)) {
      /* Add this interaction to the queue. */
182
183
184
185
186
187
188
189
      int_cache->r2q[*icount] = v_r2->f[bit_index];
      int_cache->dxq[*icount] = v_dx->f[bit_index];
      int_cache->dyq[*icount] = v_dy->f[bit_index];
      int_cache->dzq[*icount] = v_dz->f[bit_index];
      int_cache->mq[*icount] = cell_cache->m[pjd + bit_index];
      int_cache->vxq[*icount] = cell_cache->vx[pjd + bit_index];
      int_cache->vyq[*icount] = cell_cache->vy[pjd + bit_index];
      int_cache->vzq[*icount] = cell_cache->vz[pjd + bit_index];
190
191
192
193

      (*icount)++;
    }
  }
194

James Willis's avatar
James Willis committed
195
196
#endif /* defined(HAVE_AVX2) || defined(HAVE_AVX512_F) */

James Willis's avatar
James Willis committed
197
  /* Flush the c2 cache if it has reached capacity. */
James Willis's avatar
James Willis committed
198
  if (*icount >= (C2_CACHE_SIZE - (NUM_VEC_PROC * VEC_SIZE))) {
199
200

    int icount_align = *icount;
James Willis's avatar
James Willis committed
201

James Willis's avatar
James Willis committed
202
    /* Peform remainder interactions. */
Matthieu Schaller's avatar
Matthieu Schaller committed
203
204
205
    calcRemInteractions(int_cache, *icount, rhoSum, rho_dhSum, wcountSum,
                        wcount_dhSum, div_vSum, curlvxSum, curlvySum, curlvzSum,
                        v_hi_inv, v_vix, v_viy, v_viz, &icount_align);
206

207
    mask_t int_mask, int_mask2;
208
209
    vec_init_mask_true(int_mask);
    vec_init_mask_true(int_mask2);
James Willis's avatar
James Willis committed
210
211

    /* Perform interactions. */
James Willis's avatar
James Willis committed
212
213
214
215
216
217
    for (int pjd = 0; pjd < icount_align; pjd += (NUM_VEC_PROC * VEC_SIZE)) {
      runner_iact_nonsym_2_vec_density(
          &int_cache->r2q[pjd], &int_cache->dxq[pjd], &int_cache->dyq[pjd],
          &int_cache->dzq[pjd], v_hi_inv, v_vix, v_viy, v_viz,
          &int_cache->vxq[pjd], &int_cache->vyq[pjd], &int_cache->vzq[pjd],
          &int_cache->mq[pjd], rhoSum, rho_dhSum, wcountSum, wcount_dhSum,
218
          div_vSum, curlvxSum, curlvySum, curlvzSum, int_mask, int_mask2, 0);
219
    }
James Willis's avatar
James Willis committed
220
221

    /* Reset interaction count. */
222
223
224
    *icount = 0;
  }
}
225

226
/**
227
228
 * @brief Populates the arrays max_index_i and max_index_j with the maximum
 * indices of
James Willis's avatar
James Willis committed
229
230
231
 * particles into their neighbouring cells. Also finds the first pi that
 * interacts with any particle in cj and the last pj that interacts with any
 * particle in ci.
232
 *
James Willis's avatar
James Willis committed
233
234
235
236
237
238
 * @param ci #cell pointer to ci
 * @param cj #cell pointer to cj
 * @param sort_i #entry array for particle distance in ci
 * @param sort_j #entry array for particle distance in cj
 * @param dx_max maximum particle movement allowed in cell
 * @param rshift cutoff shift
239
240
241
242
 * @param hi_max Maximal smoothing length in cell ci
 * @param hj_max Maximal smoothing length in cell cj
 * @param di_max Maximal position on the axis that can interact in cell ci
 * @param dj_min Minimal position on the axis that can interact in cell ci
243
244
 * @param max_index_i array to hold the maximum distances of pi particles into
 * cell
James Willis's avatar
James Willis committed
245
 * cj
246
247
 * @param max_index_j array to hold the maximum distances of pj particles into
 * cell
James Willis's avatar
James Willis committed
248
 * cj
James Willis's avatar
James Willis committed
249
250
 * @param init_pi first pi to interact with a pj particle
 * @param init_pj last pj to interact with a pi particle
251
 * @param e The #engine.
James Willis's avatar
James Willis committed
252
 */
253
__attribute__((always_inline)) INLINE static void populate_max_index_no_cache(
James Willis's avatar
James Willis committed
254
255
    const struct cell *ci, const struct cell *cj,
    const struct entry *restrict sort_i, const struct entry *restrict sort_j,
256
257
    const float dx_max, const float rshift, const double hi_max,
    const double hj_max, const double di_max, const double dj_min,
258
    int *max_index_i, int *max_index_j, int *init_pi, int *init_pj,
259
    const struct engine *e) {
260

261
262
  const struct part *restrict parts_i = ci->parts;
  const struct part *restrict parts_j = cj->parts;
James Willis's avatar
James Willis committed
263

264
  int first_pi = 0, last_pj = cj->count - 1;
265
  int temp;
266

James Willis's avatar
James Willis committed
267
268
  /* Find the leftmost active particle in cell i that interacts with any
   * particle in cell j. */
269
  first_pi = ci->count;
270
  int active_id = first_pi - 1;
271
  while (first_pi > 0 && sort_i[first_pi - 1].d + dx_max + hi_max > dj_min) {
272
    first_pi--;
273
274
275
276
277
278
    /* Store the index of the particle if it is active. */
    if (part_is_active(&parts_i[sort_i[first_pi].i], e)) active_id = first_pi;
  }

  /* Set the first active pi in range of any particle in cell j. */
  first_pi = active_id;
279

280
  /* Find the maximum index into cell j for each particle in range in cell i. */
James Willis's avatar
James Willis committed
281
  if (first_pi < ci->count) {
282

283
284
    /* Start from the first particle in cell j. */
    temp = 0;
285

286
    const struct part *pi = &parts_i[sort_i[first_pi].i];
287

288
    /* Loop through particles in cell j until they are not in range of pi. */
James Willis's avatar
James Willis committed
289
290
291
    while (temp <= cj->count &&
           (sort_i[first_pi].d + (pi->h * kernel_gamma + dx_max - rshift) >
            sort_j[temp].d))
292
      temp++;
293

294
    max_index_i[first_pi] = temp;
295

296
    /* Populate max_index_i for remaining particles that are within range. */
James Willis's avatar
James Willis committed
297
    for (int i = first_pi + 1; i < ci->count; i++) {
298
      temp = max_index_i[i - 1];
299
      pi = &parts_i[sort_i[i].i];
300

James Willis's avatar
James Willis committed
301
302
303
      while (temp <= cj->count &&
             (sort_i[i].d + (pi->h * kernel_gamma + dx_max - rshift) >
              sort_j[temp].d))
304
        temp++;
305

306
307
      max_index_i[i] = temp;
    }
James Willis's avatar
James Willis committed
308
  } else {
309
310
311
    /* Make sure that max index is set to first particle in cj.*/
    max_index_i[ci->count - 1] = 0;
  }
312

James Willis's avatar
James Willis committed
313
314
  /* Find the rightmost active particle in cell j that interacts with any
   * particle in cell i. */
315
  last_pj = -1;
316
  active_id = last_pj;
James Willis's avatar
James Willis committed
317
318
  while (last_pj < cj->count &&
         sort_j[last_pj + 1].d - hj_max - dx_max < di_max) {
319
    last_pj++;
320
    /* Store the index of the particle if it is active. */
321
    if (part_is_active(&parts_j[sort_j[last_pj].i], e)) active_id = last_pj;
322
323
324
  }

  /* Set the last active pj in range of any particle in cell i. */
325
  last_pj = active_id;
326

327
  /* Find the maximum index into cell i for each particle in range in cell j. */
328
  if (last_pj > 0) {
329

330
331
    /* Start from the last particle in cell i. */
    temp = ci->count - 1;
332

333
334
335
    const struct part *pj = &parts_j[sort_j[last_pj].i];

    /* Loop through particles in cell i until they are not in range of pj. */
James Willis's avatar
James Willis committed
336
337
338
    while (temp > 0 &&
           sort_j[last_pj].d - dx_max - (pj->h * kernel_gamma) <
               sort_i[temp].d - rshift)
339
      temp--;
340

341
    max_index_j[last_pj] = temp;
342

343
    /* Populate max_index_j for remaining particles that are within range. */
James Willis's avatar
James Willis committed
344
    for (int i = last_pj - 1; i >= 0; i--) {
345
      temp = max_index_j[i + 1];
346
      pj = &parts_j[sort_j[i].i];
347

James Willis's avatar
James Willis committed
348
349
350
      while (temp > 0 &&
             sort_j[i].d - dx_max - (pj->h * kernel_gamma) <
                 sort_i[temp].d - rshift)
351
        temp--;
352

353
354
      max_index_j[i] = temp;
    }
James Willis's avatar
James Willis committed
355
  } else {
356
    /* Make sure that max index is set to last particle in ci.*/
James Willis's avatar
James Willis committed
357
    max_index_j[0] = ci->count - 1;
358
  }
359

James Willis's avatar
James Willis committed
360
361
  *init_pi = first_pi;
  *init_pj = last_pj;
362
}
James Willis's avatar
James Willis committed
363
#endif /* WITH_VECTORIZATION */
364
365

/**
James Willis's avatar
James Willis committed
366
367
 * @brief Compute the cell self-interaction (non-symmetric) using vector
 * intrinsics with one particle pi at a time.
368
369
370
371
 *
 * @param r The #runner.
 * @param c The #cell.
 */
James Willis's avatar
James Willis committed
372
373
__attribute__((always_inline)) INLINE void runner_doself1_density_vec(
    struct runner *r, struct cell *restrict c) {
374
375

#ifdef WITH_VECTORIZATION
376
  const struct engine *e = r->e;
377
378
379
380
381
382
  struct part *restrict pi;
  int count_align;
  int num_vec_proc = NUM_VEC_PROC;

  struct part *restrict parts = c->parts;
  const int count = c->count;
James Willis's avatar
James Willis committed
383

384
385
  vector v_hi, v_vix, v_viy, v_viz, v_hig2, v_r2;

James Willis's avatar
James Willis committed
386
  TIMER_TIC
387

388
389
  if (!cell_is_active(c, e)) return;

390
  if (!cell_are_part_drifted(c, e)) error("Interacting undrifted cell.");
391

James Willis's avatar
James Willis committed
392
  /* Get the particle cache from the runner and re-allocate
393
   * the cache if it is not big enough for the cell. */
394
  struct cache *restrict cell_cache = &r->ci_cache;
James Willis's avatar
James Willis committed
395
396
397

  if (cell_cache->count < count) {
    cache_init(cell_cache, count);
398
399
  }

James Willis's avatar
James Willis committed
400
  /* Read the particles from the cell and store them locally in the cache. */
James Willis's avatar
James Willis committed
401
  cache_read_particles(c, cell_cache);
402
403
404
405

  /* Create secondary cache to store particle interactions. */
  struct c2_cache int_cache;
  int icount = 0, icount_align = 0;
406
407
408
409
410
411
412
413

  /* Loop over the particles in the cell. */
  for (int pid = 0; pid < count; pid++) {

    /* Get a pointer to the ith particle. */
    pi = &parts[pid];

    /* Is the ith particle active? */
414
    if (!part_is_active(pi, e)) continue;
415
416
417
418
419

    vector pix, piy, piz;

    const float hi = cell_cache->h[pid];

James Willis's avatar
James Willis committed
420
    /* Fill particle pi vectors. */
421
422
423
424
425
426
427
428
429
430
431
    pix.v = vec_set1(cell_cache->x[pid]);
    piy.v = vec_set1(cell_cache->y[pid]);
    piz.v = vec_set1(cell_cache->z[pid]);
    v_hi.v = vec_set1(hi);
    v_vix.v = vec_set1(cell_cache->vx[pid]);
    v_viy.v = vec_set1(cell_cache->vy[pid]);
    v_viz.v = vec_set1(cell_cache->vz[pid]);

    const float hig2 = hi * hi * kernel_gamma2;
    v_hig2.v = vec_set1(hig2);

James Willis's avatar
James Willis committed
432
    /* Reset cumulative sums of update vectors. */
James Willis's avatar
James Willis committed
433
434
435
    vector rhoSum, rho_dhSum, wcountSum, wcount_dhSum, div_vSum, curlvxSum,
        curlvySum, curlvzSum;

James Willis's avatar
James Willis committed
436
    /* Get the inverse of hi. */
437
    vector v_hi_inv;
James Willis's avatar
James Willis committed
438

439
    v_hi_inv = vec_reciprocal(v_hi);
James Willis's avatar
James Willis committed
440

441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
    rhoSum.v = vec_setzero();
    rho_dhSum.v = vec_setzero();
    wcountSum.v = vec_setzero();
    wcount_dhSum.v = vec_setzero();
    div_vSum.v = vec_setzero();
    curlvxSum.v = vec_setzero();
    curlvySum.v = vec_setzero();
    curlvzSum.v = vec_setzero();

    /* Pad cache if there is a serial remainder. */
    count_align = count;
    int rem = count % (num_vec_proc * VEC_SIZE);
    if (rem != 0) {
      int pad = (num_vec_proc * VEC_SIZE) - rem;

      count_align += pad;
457
458
459
460
461
462
463
464

      /* Set positions to the same as particle pi so when the r2 > 0 mask is
       * applied these extra contributions are masked out.*/
      for (int i = count; i < count_align; i++) {
        cell_cache->x[i] = pix.f[0];
        cell_cache->y[i] = piy.f[0];
        cell_cache->z[i] = piz.f[0];
      }
465
466
467
468
469
    }

    vector pjx, pjy, pjz;
    vector pjx2, pjy2, pjz2;

James Willis's avatar
James Willis committed
470
471
    /* Find all of particle pi's interacions and store needed values in the
     * secondary cache.*/
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
    for (int pjd = 0; pjd < count_align; pjd += (num_vec_proc * VEC_SIZE)) {

      /* Load 2 sets of vectors from the particle cache. */
      pjx.v = vec_load(&cell_cache->x[pjd]);
      pjy.v = vec_load(&cell_cache->y[pjd]);
      pjz.v = vec_load(&cell_cache->z[pjd]);

      pjx2.v = vec_load(&cell_cache->x[pjd + VEC_SIZE]);
      pjy2.v = vec_load(&cell_cache->y[pjd + VEC_SIZE]);
      pjz2.v = vec_load(&cell_cache->z[pjd + VEC_SIZE]);

      /* Compute the pairwise distance. */
      vector v_dx_tmp, v_dy_tmp, v_dz_tmp;
      vector v_dx_tmp2, v_dy_tmp2, v_dz_tmp2, v_r2_2;

James Willis's avatar
James Willis committed
487
488
      v_dx_tmp.v = vec_sub(pix.v, pjx.v);
      v_dx_tmp2.v = vec_sub(pix.v, pjx2.v);
489
      v_dy_tmp.v = vec_sub(piy.v, pjy.v);
James Willis's avatar
James Willis committed
490
      v_dy_tmp2.v = vec_sub(piy.v, pjy2.v);
491
      v_dz_tmp.v = vec_sub(piz.v, pjz.v);
James Willis's avatar
James Willis committed
492
493
494
495
      v_dz_tmp2.v = vec_sub(piz.v, pjz2.v);

      v_r2.v = vec_mul(v_dx_tmp.v, v_dx_tmp.v);
      v_r2_2.v = vec_mul(v_dx_tmp2.v, v_dx_tmp2.v);
496
      v_r2.v = vec_fma(v_dy_tmp.v, v_dy_tmp.v, v_r2.v);
James Willis's avatar
James Willis committed
497
      v_r2_2.v = vec_fma(v_dy_tmp2.v, v_dy_tmp2.v, v_r2_2.v);
498
      v_r2.v = vec_fma(v_dz_tmp.v, v_dz_tmp.v, v_r2.v);
James Willis's avatar
James Willis committed
499
500
      v_r2_2.v = vec_fma(v_dz_tmp2.v, v_dz_tmp2.v, v_r2_2.v);

501
      /* Form a mask from r2 < hig2 and r2 > 0.*/
James Willis's avatar
James Willis committed
502
503
      mask_t v_doi_mask, v_doi_mask_self_check, v_doi_mask2,
          v_doi_mask2_self_check;
504
      int doi_mask, doi_mask_self_check, doi_mask2, doi_mask2_self_check;
505

James Willis's avatar
James Willis committed
506
      /* Form r2 > 0 mask and r2 < hig2 mask. */
507
508
      vec_create_mask(v_doi_mask_self_check, vec_cmp_gt(v_r2.v, vec_setzero()));
      vec_create_mask(v_doi_mask, vec_cmp_lt(v_r2.v, v_hig2.v));
509

James Willis's avatar
James Willis committed
510
      /* Form r2 > 0 mask and r2 < hig2 mask. */
James Willis's avatar
James Willis committed
511
512
      vec_create_mask(v_doi_mask2_self_check,
                      vec_cmp_gt(v_r2_2.v, vec_setzero()));
513
514
515
516
517
      vec_create_mask(v_doi_mask2, vec_cmp_lt(v_r2_2.v, v_hig2.v));

      /* Form integer masks. */
      doi_mask_self_check = vec_form_int_mask(v_doi_mask_self_check);
      doi_mask = vec_form_int_mask(v_doi_mask);
518

519
520
      doi_mask2_self_check = vec_form_int_mask(v_doi_mask2_self_check);
      doi_mask2 = vec_form_int_mask(v_doi_mask2);
James Willis's avatar
James Willis committed
521

522
523
524
      /* Combine the two masks. */
      doi_mask = doi_mask & doi_mask_self_check;
      doi_mask2 = doi_mask2 & doi_mask2_self_check;
525

James Willis's avatar
James Willis committed
526
527
      /* If there are any interactions left pack interaction values into c2
       * cache. */
528
      if (doi_mask) {
James Willis's avatar
James Willis committed
529
        storeInteractions(doi_mask, pjd, &v_r2, &v_dx_tmp, &v_dy_tmp, &v_dz_tmp,
530
531
532
533
534
535
536
537
                          cell_cache, &int_cache, &icount, &rhoSum, &rho_dhSum,
                          &wcountSum, &wcount_dhSum, &div_vSum, &curlvxSum,
                          &curlvySum, &curlvzSum, v_hi_inv, v_vix, v_viy,
                          v_viz);
      }
      if (doi_mask2) {
        storeInteractions(doi_mask2, pjd + VEC_SIZE, &v_r2_2, &v_dx_tmp2,
                          &v_dy_tmp2, &v_dz_tmp2, cell_cache, &int_cache,
James Willis's avatar
James Willis committed
538
539
540
                          &icount, &rhoSum, &rho_dhSum, &wcountSum,
                          &wcount_dhSum, &div_vSum, &curlvxSum, &curlvySum,
                          &curlvzSum, v_hi_inv, v_vix, v_viy, v_viz);
541
542
543
      }
    }

James Willis's avatar
James Willis committed
544
    /* Perform padded vector remainder interactions if any are present. */
Matthieu Schaller's avatar
Matthieu Schaller committed
545
546
547
    calcRemInteractions(&int_cache, icount, &rhoSum, &rho_dhSum, &wcountSum,
                        &wcount_dhSum, &div_vSum, &curlvxSum, &curlvySum,
                        &curlvzSum, v_hi_inv, v_vix, v_viy, v_viz,
James Willis's avatar
James Willis committed
548
549
550
551
                        &icount_align);

    /* Initialise masks to true in case remainder interactions have been
     * performed. */
552
    mask_t int_mask, int_mask2;
553
554
    vec_init_mask_true(int_mask);
    vec_init_mask_true(int_mask2);
555
556

    /* Perform interaction with 2 vectors. */
James Willis's avatar
James Willis committed
557
558
559
560
561
562
563
    for (int pjd = 0; pjd < icount_align; pjd += (num_vec_proc * VEC_SIZE)) {
      runner_iact_nonsym_2_vec_density(
          &int_cache.r2q[pjd], &int_cache.dxq[pjd], &int_cache.dyq[pjd],
          &int_cache.dzq[pjd], v_hi_inv, v_vix, v_viy, v_viz,
          &int_cache.vxq[pjd], &int_cache.vyq[pjd], &int_cache.vzq[pjd],
          &int_cache.mq[pjd], &rhoSum, &rho_dhSum, &wcountSum, &wcount_dhSum,
          &div_vSum, &curlvxSum, &curlvySum, &curlvzSum, int_mask, int_mask2,
564
          0);
565
566
    }

James Willis's avatar
James Willis committed
567
568
569
570
571
572
573
574
575
576
    /* Perform horizontal adds on vector sums and store result in particle pi.
     */
    VEC_HADD(rhoSum, pi->rho);
    VEC_HADD(rho_dhSum, pi->density.rho_dh);
    VEC_HADD(wcountSum, pi->density.wcount);
    VEC_HADD(wcount_dhSum, pi->density.wcount_dh);
    VEC_HADD(div_vSum, pi->density.div_v);
    VEC_HADD(curlvxSum, pi->density.rot_v[0]);
    VEC_HADD(curlvySum, pi->density.rot_v[1]);
    VEC_HADD(curlvzSum, pi->density.rot_v[2]);
577
578
579
580
581

    /* Reset interaction count. */
    icount = 0;
  } /* loop over all particles. */

James Willis's avatar
James Willis committed
582
  TIMER_TOC(timer_doself_density);
583
#endif /* WITH_VECTORIZATION */
584
585
}

586
/**
James Willis's avatar
James Willis committed
587
588
 * @brief Compute the density interactions between a cell pair (non-symmetric)
 * using vector intrinsics.
589
590
591
592
 *
 * @param r The #runner.
 * @param ci The first #cell.
 * @param cj The second #cell.
593
594
 * @param sid The direction of the pair
 * @param shift The shift vector to apply to the particles in ci.
595
 */
James Willis's avatar
James Willis committed
596
void runner_dopair1_density_vec(struct runner *r, struct cell *ci,
597
598
                                struct cell *cj, const int sid,
                                const double *shift) {
599
600
601
602

#ifdef WITH_VECTORIZATION
  const struct engine *restrict e = r->e;

James Willis's avatar
James Willis committed
603
  vector v_hi, v_vix, v_viy, v_viz, v_hig2;
604
605
606

  TIMER_TIC;

607
608
609
610
611
  /* Get the cutoff shift. */
  double rshift = 0.0;
  for (int k = 0; k < 3; k++) rshift += shift[k] * runner_shift[sid][k];

  /* Pick-out the sorted lists. */
Peter W. Draper's avatar
Peter W. Draper committed
612
613
  const struct entry *restrict sort_i = ci->sort[sid];
  const struct entry *restrict sort_j = cj->sort[sid];
614

615
616
617
618
619
620
621
622
623
#ifdef SWIFT_DEBUG_CHECKS
  /* Check that the dx_max_sort values in the cell are indeed an upper
     bound on particle movement. */
  for (int pid = 0; pid < ci->count; pid++) {
    const struct part *p = &ci->parts[sort_i[pid].i];
    const float d = p->x[0] * runner_shift[sid][0] +
                    p->x[1] * runner_shift[sid][1] +
                    p->x[2] * runner_shift[sid][2];
    if (fabsf(d - sort_i[pid].d) - ci->dx_max_sort >
624
        1.0e-4 * max(fabsf(d), ci->dx_max_sort_old))
625
626
627
628
629
630
      error(
          "particle shift diff exceeds dx_max_sort in cell ci. ci->nodeID=%d "
          "cj->nodeID=%d d=%e sort_i[pid].d=%e ci->dx_max_sort=%e "
          "ci->dx_max_sort_old=%e",
          ci->nodeID, cj->nodeID, d, sort_i[pid].d, ci->dx_max_sort,
          ci->dx_max_sort_old);
631
632
633
634
635
636
637
  }
  for (int pjd = 0; pjd < cj->count; pjd++) {
    const struct part *p = &cj->parts[sort_j[pjd].i];
    const float d = p->x[0] * runner_shift[sid][0] +
                    p->x[1] * runner_shift[sid][1] +
                    p->x[2] * runner_shift[sid][2];
    if (fabsf(d - sort_j[pjd].d) - cj->dx_max_sort >
638
        1.0e-4 * max(fabsf(d), cj->dx_max_sort_old))
639
640
641
642
643
644
      error(
          "particle shift diff exceeds dx_max_sort in cell cj. cj->nodeID=%d "
          "ci->nodeID=%d d=%e sort_j[pjd].d=%e cj->dx_max_sort=%e "
          "cj->dx_max_sort_old=%e",
          cj->nodeID, ci->nodeID, d, sort_j[pjd].d, cj->dx_max_sort,
          cj->dx_max_sort_old);
645
646
647
  }
#endif /* SWIFT_DEBUG_CHECKS */

648
649
650
651
652
653
654
655
656
  /* Get some other useful values. */
  const int count_i = ci->count;
  const int count_j = cj->count;
  const double hi_max = ci->h_max * kernel_gamma - rshift;
  const double hj_max = cj->h_max * kernel_gamma;
  struct part *restrict parts_i = ci->parts;
  struct part *restrict parts_j = cj->parts;
  const double di_max = sort_i[count_i - 1].d - rshift;
  const double dj_min = sort_j[0].d;
657
  const float dx_max = (ci->dx_max_sort + cj->dx_max_sort);
658
659
  const int active_ci = cell_is_active(ci, e);
  const int active_cj = cell_is_active(cj, e);
660
661

  /* Check if any particles are active and return if there are not. */
Matthieu Schaller's avatar
Matthieu Schaller committed
662
  int numActive = 0;
663
664
665
666
667
668
669
670
671

  if(active_ci) {
    for (int pid = count_i - 1;
        pid >= 0 && sort_i[pid].d + hi_max + dx_max > dj_min; pid--) {
      struct part *restrict pi = &parts_i[sort_i[pid].i];
      if (part_is_active(pi, e)) {
        numActive++;
        break;
      }
Matthieu Schaller's avatar
Matthieu Schaller committed
672
    }
673
  }
674

675
  if (!numActive && active_cj) {
676
    for (int pjd = 0; pjd < count_j && sort_j[pjd].d - hj_max - dx_max < di_max;
677
        pjd++) {
678
679
      struct part *restrict pj = &parts_j[sort_j[pjd].i];
      if (part_is_active(pj, e)) {
680
681
        numActive++;
        break;
Matthieu Schaller's avatar
Matthieu Schaller committed
682
683
      }
    }
684
  }
685

Matthieu Schaller's avatar
Matthieu Schaller committed
686
  if (numActive == 0) return;
687

688
689
690
691
  /* Get both particle caches from the runner and re-allocate
   * them if they are not big enough for the cells. */
  struct cache *restrict ci_cache = &r->ci_cache;
  struct cache *restrict cj_cache = &r->cj_cache;
692

693
694
695
696
697
698
  if (ci_cache->count < count_i) {
    cache_init(ci_cache, count_i);
  }
  if (cj_cache->count < count_j) {
    cache_init(cj_cache, count_j);
  }
699

700
  int first_pi, last_pj;
701
702
  int *max_index_i __attribute__((aligned(sizeof(int) * VEC_SIZE)));
  int *max_index_j __attribute__((aligned(sizeof(int) * VEC_SIZE)));
703

704
705
  max_index_i = r->ci_cache.max_index;
  max_index_j = r->cj_cache.max_index;
706

707
708
  /* Find particles maximum index into cj, max_index_i[] and ci, max_index_j[].
   */
709
710
  /* Also find the first pi that interacts with any particle in cj and the last
   * pj that interacts with any particle in ci. */
711
  populate_max_index_no_cache(ci, cj, sort_i, sort_j, dx_max, rshift, hi_max,
712
713
                              hj_max, di_max, dj_min, max_index_i, max_index_j,
                              &first_pi, &last_pj, e);
714

715
716
717
718
  /* Limits of the outer loops. */
  int first_pi_loop = first_pi;
  int last_pj_loop = last_pj;

719
720
  /* Take the max/min of both values calculated to work out how many particles
   * to read into the cache. */
721
722
  last_pj = max(last_pj, max_index_i[count_i - 1]);
  first_pi = min(first_pi, max_index_j[0]);
723

724
725
726
727
  /* Read the needed particles into the two caches. */
  int first_pi_align = first_pi;
  int last_pj_align = last_pj;
  cache_read_two_partial_cells_sorted(ci, cj, ci_cache, cj_cache, sort_i,
Matthieu Schaller's avatar
Matthieu Schaller committed
728
729
                                      sort_j, shift, &first_pi_align,
                                      &last_pj_align, 1);
730

731
732
  /* Get the number of particles read into the ci cache. */
  int ci_cache_count = count_i - first_pi_align;
733

734
  if (active_ci) {
735

James Willis's avatar
James Willis committed
736
    /* Loop over the parts in ci until nothing is within range in cj. */
737
    for (int pid = count_i - 1; pid >= first_pi_loop; pid--) {
738

739
740
741
      /* Get a hold of the ith part in ci. */
      struct part *restrict pi = &parts_i[sort_i[pid].i];
      if (!part_is_active(pi, e)) continue;
742

743
744
745
      /* Set the cache index. */
      int ci_cache_idx = pid - first_pi_align;

James Willis's avatar
James Willis committed
746
      /* Skip this particle if no particle in cj is within range of it. */
747
      const float hi = ci_cache->h[ci_cache_idx];
748
749
      const double di_test =
          sort_i[pid].d + hi * kernel_gamma + dx_max - rshift;
750
751
      if (di_test < dj_min) continue;

752
      /* Determine the exit iteration of the interaction loop. */
753
      int exit_iteration = max_index_i[pid];
754

755
      const float hig2 = hi * hi * kernel_gamma2;
756

757
      vector pix, piy, piz;
758

759
760
761
762
763
764
765
766
      /* Fill particle pi vectors. */
      pix.v = vec_set1(ci_cache->x[ci_cache_idx]);
      piy.v = vec_set1(ci_cache->y[ci_cache_idx]);
      piz.v = vec_set1(ci_cache->z[ci_cache_idx]);
      v_hi.v = vec_set1(hi);
      v_vix.v = vec_set1(ci_cache->vx[ci_cache_idx]);
      v_viy.v = vec_set1(ci_cache->vy[ci_cache_idx]);
      v_viz.v = vec_set1(ci_cache->vz[ci_cache_idx]);
767

768
      v_hig2.v = vec_set1(hig2);
769

770
771
      /* Reset cumulative sums of update vectors. */
      vector rhoSum, rho_dhSum, wcountSum, wcount_dhSum, div_vSum, curlvxSum,
Matthieu Schaller's avatar
Matthieu Schaller committed
772
          curlvySum, curlvzSum;
773

774
775
      /* Get the inverse of hi. */
      vector v_hi_inv;
776

777
      v_hi_inv = vec_reciprocal(v_hi);
778

779
780
781
782
783
784
785
786
      rhoSum.v = vec_setzero();
      rho_dhSum.v = vec_setzero();
      wcountSum.v = vec_setzero();
      wcount_dhSum.v = vec_setzero();
      div_vSum.v = vec_setzero();
      curlvxSum.v = vec_setzero();
      curlvySum.v = vec_setzero();
      curlvzSum.v = vec_setzero();
787

788
789
790
791
792
      /* Pad the exit iteration if there is a serial remainder. */
      int exit_iteration_align = exit_iteration;
      int rem = exit_iteration % VEC_SIZE;
      if (rem != 0) {
        int pad = VEC_SIZE - rem;
793

794
795
796
        if (exit_iteration_align + pad <= last_pj_align + 1)
          exit_iteration_align += pad;
      }
797

798
      vector pjx, pjy, pjz;
799

800
801
      /* Loop over the parts in cj. */
      for (int pjd = 0; pjd < exit_iteration_align; pjd += VEC_SIZE) {
802

803
804
        /* Get the cache index to the jth particle. */
        int cj_cache_idx = pjd;
805

806
        vector v_dx, v_dy, v_dz, v_r2;
807

808
#ifdef SWIFT_DEBUG_CHECKS
Matthieu Schaller's avatar
Matthieu Schaller committed
809
810
        if (cj_cache_idx % VEC_SIZE != 0 || cj_cache_idx < 0) {
          error("Unaligned read!!! cj_cache_idx=%d", cj_cache_idx);
811
812
        }
#endif
813

814
815
816
817
818
819
820
821
822
823
824
825
826
827
        /* Load 2 sets of vectors from the particle cache. */
        pjx.v = vec_load(&cj_cache->x[cj_cache_idx]);
        pjy.v = vec_load(&cj_cache->y[cj_cache_idx]);
        pjz.v = vec_load(&cj_cache->z[cj_cache_idx]);

        /* Compute the pairwise distance. */
        v_dx.v = vec_sub(pix.v, pjx.v);
        v_dy.v = vec_sub(piy.v, pjy.v);
        v_dz.v = vec_sub(piz.v, pjz.v);

        v_r2.v = vec_mul(v_dx.v, v_dx.v);
        v_r2.v = vec_fma(v_dy.v, v_dy.v, v_r2.v);
        v_r2.v = vec_fma(v_dz.v, v_dz.v, v_r2.v);

828
        mask_t v_doi_mask;
829
830
831
        int doi_mask;

        /* Form r2 < hig2 mask. */
832
        vec_create_mask(v_doi_mask, vec_cmp_lt(v_r2.v, v_hig2.v));
833
834

        /* Form integer mask. */
835
        doi_mask = vec_form_int_mask(v_doi_mask);
836
837
838
839
840
841
842
843

        /* If there are any interactions perform them. */
        if (doi_mask)
          runner_iact_nonsym_1_vec_density(
              &v_r2, &v_dx, &v_dy, &v_dz, v_hi_inv, v_vix, v_viy, v_viz,
              &cj_cache->vx[cj_cache_idx], &cj_cache->vy[cj_cache_idx],
              &cj_cache->vz[cj_cache_idx], &cj_cache->m[cj_cache_idx], &rhoSum,
              &rho_dhSum, &wcountSum, &wcount_dhSum, &div_vSum, &curlvxSum,
844
              &curlvySum, &curlvzSum, v_doi_mask);
James Willis's avatar
James Willis committed
845

846
      } /* loop over the parts in cj. */
847

848
849
850
851
852
853
854
855
856
857
858
859
860
      /* Perform horizontal adds on vector sums and store result in particle pi.
      */
      VEC_HADD(rhoSum, pi->rho);
      VEC_HADD(rho_dhSum, pi->density.rho_dh);
      VEC_HADD(wcountSum, pi->density.wcount);
      VEC_HADD(wcount_dhSum, pi->density.wcount_dh);
      VEC_HADD(div_vSum, pi->density.div_v);
      VEC_HADD(curlvxSum, pi->density.rot_v[0]);
      VEC_HADD(curlvySum, pi->density.rot_v[1]);
      VEC_HADD(curlvzSum, pi->density.rot_v[2]);

    } /* loop over the parts in ci. */
  }
861

862
  if (active_cj) {
863

James Willis's avatar
James Willis committed
864
    /* Loop over the parts in cj until nothing is within range in ci. */
865
    for (int pjd = 0; pjd <= last_pj_loop; pjd++) {
866

867
868
869
      /* Get a hold of the jth part in cj. */
      struct part *restrict pj = &parts_j[sort_j[pjd].i];
      if (!part_is_active(pj, e)) continue;
870

871
872
873
      /* Set the cache index. */
      int cj_cache_idx = pjd;

James Willis's avatar
James Willis committed
874
      /* Skip this particle if no particle in ci is within range of it. */
875
      const float hj = cj_cache->h[cj_cache_idx];
876
      const double dj_test =
877
          sort_j[pjd].d - hj * kernel_gamma - dx_max;
878
      if (dj_test > di_max) continue;
879

880
      /* Determine the exit iteration of the interaction loop. */
881
      int exit_iteration = max_index_j[pjd];
882

883
      const float hjg2 = hj * hj * kernel_gamma2;
884

885
886
      vector pjx, pjy, pjz;
      vector v_hj, v_vjx, v_vjy, v_vjz, v_hjg2;
887

888
889
890
891
892
893
894
895
      /* Fill particle pi vectors. */
      pjx.v = vec_set1(cj_cache->x[cj_cache_idx]);
      pjy.v = vec_set1(cj_cache->y[cj_cache_idx]);
      pjz.v = vec_set1(cj_cache->z[cj_cache_idx]);
      v_hj.v = vec_set1(hj);
      v_vjx.v = vec_set1(cj_cache->vx[cj_cache_idx]);
      v_vjy.v = vec_set1(cj_cache->vy[cj_cache_idx]);
      v_vjz.v = vec_set1(cj_cache->vz[cj_cache_idx]);
896

897
      v_hjg2.v = vec_set1(hjg2);
898

899
900
      /* Reset cumulative sums of update vectors. */
      vector rhoSum, rho_dhSum, wcountSum, wcount_dhSum, div_vSum, curlvxSum,
Matthieu Schaller's avatar
Matthieu Schaller committed
901
          curlvySum, curlvzSum;
902

903
904
      /* Get the inverse of hj. */
      vector v_hj_inv;
905

906
      v_hj_inv = vec_reciprocal(v_hj);
907

908
909
910
911
912
913
914
915
      rhoSum.v = vec_setzero();
      rho_dhSum.v = vec_setzero();
      wcountSum.v = vec_setzero();
      wcount_dhSum.v = vec_setzero();
      div_vSum.v = vec_setzero();
      curlvxSum.v = vec_setzero();
      curlvySum.v = vec_setzero();
      curlvzSum.v = vec_setzero();
916

917
      vector pix, piy, piz;
918

919
920
      /* Convert exit iteration to cache indices. */
      int exit_iteration_align = exit_iteration - first_pi_align;
James Willis's avatar
James Willis committed
921

922
923
      /* Pad the exit iteration align so cache reads are aligned. */
      int rem = exit_iteration_align % VEC_SIZE;
Matthieu Schaller's avatar
Matthieu Schaller committed
924
      if (exit_iteration_align < VEC_SIZE) {
925
        exit_iteration_align = 0;
Matthieu Schaller's avatar
Matthieu Schaller committed
926
927
      } else
        exit_iteration_align -= rem;
James Willis's avatar
James Willis committed
928

929
      /* Loop over the parts in ci. */
Matthieu Schaller's avatar
Matthieu Schaller committed
930
931
      for (int ci_cache_idx = exit_iteration_align;
           ci_cache_idx < ci_cache_count; ci_cache_idx += VEC_SIZE) {
James Willis's avatar
James Willis committed
932

933
#ifdef SWIFT_DEBUG_CHECKS
Matthieu Schaller's avatar
Matthieu Schaller committed
934
935
        if (ci_cache_idx % VEC_SIZE != 0 || ci_cache_idx < 0) {
          error("Unaligned read!!! ci_cache_idx=%d", ci_cache_idx);
936
937
        }
#endif
James Willis's avatar
James Willis committed
938

939
        vector v_dx, v_dy, v_dz, v_r2;
James Willis's avatar
James Willis committed
940