diff --git a/tests/testVectorize.c b/tests/testVectorize.c new file mode 100644 index 0000000000000000000000000000000000000000..fd4ef8ecabc88572605fc5a21c2a876ad7adea49 --- /dev/null +++ b/tests/testVectorize.c @@ -0,0 +1,119 @@ +#include <fenv.h> +#include <stdlib.h> +#include <string.h> +#include <stdio.h> +#include <unistd.h> +#include "swift.h" + +/* n is both particles per axis and box size: + * particles are generated on a mesh with unit spacing + */ +struct cell *make_cell(size_t n, double *offset, double h, unsigned long long *partId) { + size_t count = n*n*n; + struct cell *cell = malloc(sizeof *cell); + struct part *part; + size_t x, y, z, i, size; + + size = count*sizeof(*cell->parts); + if (posix_memalign((void**)&cell->parts, 32, size) != 0) { + error("couldn't allocate particles, no. of particles: %d",(int)count); + } + + part = cell->parts; + for (x = 0; x < n; ++x) { + for (y = 0; y < n; ++y) { + for (z = 0; z < n; ++z) { + // Add .5 for symmetry: 0.5, 1.5, 2.5 vs. 0, 1, 2 + part->x[0] = x + offset[0] + 0.5; + part->x[1] = y + offset[1] + 0.5; + part->x[2] = z + offset[2] + 0.5; + part->dt = 0.01; + part->h = h; + part->id = ++(*partId); + part->mass = 1.0f; + ++part; + } + } + } + + cell->split = 0; + cell->h_max = h; + cell->count = count; + + cell->sort = malloc(13*count*sizeof *cell->sort); + runner_dosort(NULL, cell, 0x1FFF, 0); + + return cell; +} + +void runner_dopair1_density(struct runner *r, struct cell *ci, struct cell *cj); + +int main(int argc, char *argv[]) { + size_t particles = 0, runs = 0, volume, type = 0; + double offset[3] = { 0, 0, 0 }, h = 1.1255; // * DIM/PARTS_PER_AXIS == * 1 + struct cell *ci, *cj; + struct space space; + struct engine engine; + struct runner runner; + char c; + static unsigned long long partId = 0; + + while ((c = getopt(argc, argv, "h:p:r:t:")) != -1) { + switch (c) { + case 'h': + sscanf(optarg, "%lf", &h); + break; + case 'p': + sscanf(optarg, "%zu", &particles); + break; + case 'r': + sscanf(optarg, "%zu", &runs); + break; + case 't': + sscanf(optarg, "%zu", &type); + break; + } + } + + if (h < 0 || particles == 0 || runs == 0 || type > 2) { + printf("\nUsage: %s -p PARTICLES_PER_AXIS -r NUMBER_OF_RUNS [OPTIONS...]\n" + "\nGenerates a cell pair, filled with particles on a Cartesian grid." + "\nThese are then interacted using runner_dopair1_density." + "\n\nOptions:" + "\n-t TYPE=0 - cells share face (0), edge (1) or corner (2)" + "\n-h DISTANCE=1.1255 - smoothing length", argv[0]); + exit(1); + } + + volume = particles*particles*particles; + message("particles: %zu B\npositions: 0 B", + 2*volume*sizeof(struct part)); + + ci = make_cell(particles, offset, h, &partId); + for (size_t i = 0; i < type+1; ++i) offset[i] = particles; + cj = make_cell(particles, offset, h, &partId); + + for (int i = 0; i < 3; ++i) { + space.h_max = h; + space.dt_step = 0.1; + } + + engine.s = &space; + engine.dt_step = 0.1; + runner.e = &engine; + + printf("#ID, rho, rho_dh, density.wcount, density.wcount_dh, div_v, curl_v:[x,y,z]\n"); + + for (size_t i = 0; i < runs; ++i) { + if(i%50 == 0) { + for (size_t pid = 0; pid < ci->count; pid++) { + printf("%lu,%f,%f,%f,%f,%f,[%f,%f,%f]\n",ci->parts[pid].id,ci->parts[pid].rho,ci->parts[pid].rho_dh,ci->parts[pid].density.wcount,ci->parts[pid].density.wcount_dh,ci->parts[pid].density.div_v,ci->parts[pid].density.curl_v[0],ci->parts[pid].density.curl_v[1],ci->parts[pid].density.curl_v[2]); + } + for (size_t pid = 0; pid < cj->count; pid++) { + printf("%lu,%f,%f,%f,%f,%f,[%f,%f,%f]\n",cj->parts[pid].id,cj->parts[pid].rho,cj->parts[pid].rho_dh,cj->parts[pid].density.wcount,cj->parts[pid].density.wcount_dh,cj->parts[pid].density.div_v,cj->parts[pid].density.curl_v[0],cj->parts[pid].density.curl_v[1],cj->parts[pid].density.curl_v[2]); + } + } + runner_dopair1_density(&runner, ci, cj); + } + +}