Build Packages / build:portable:linux-x86_64:nocuda (push) Successful in 16m43s
Build Packages / build:jfjoch:ubuntu2404:nocuda (push) Successful in 28m46s
Build Packages / build:jfjoch:rocky8:cuda-sls9 (push) Successful in 32m5s
Build Packages / build:jfjoch:rocky9:cuda (push) Successful in 39m44s
Build Packages / build:portable:macos-arm64:nocuda (push) Successful in 5m7s
Build Packages / Create release (push) Successful in 8s
Build Packages / Build documentation (push) Successful in 49s
Build Packages / build:portable:linux-x86_64:cuda (push) Successful in 22m30s
Build Packages / build:jfjoch:rocky8:nocuda (push) Successful in 31m54s
Build Packages / build:rugnux:linux-aarch64:cuda (push) Successful in 11m29s
Build Packages / build:portable:windows-x86_64:nocuda (push) Successful in 23m51s
Build Packages / build:jfjoch:ubuntu2204:nocuda (push) Successful in 26m7s
Build Packages / build:jfjoch:ubuntu2204:cuda (push) Successful in 29m38s
Build Packages / build:portable:windows-x86_64:cuda (push) Successful in 28m6s
Build Packages / HDF5 consumer tests (DIALS, XDS) (push) Successful in 29m44s
Build Packages / build:jfjoch:rocky9:nocuda (push) Successful in 33m22s
Build Packages / Generate python client (push) Successful in 47s
Build Packages / build:jfjoch:rocky9:cuda-sls9 (push) Successful in 34m6s
Build Packages / Unit tests (push) Successful in 1h2m47s
Build Packages / build:jfjoch:rocky8:cuda (push) Successful in 35m59s
Build Packages / build:jfjoch:ubuntu2404:cuda (push) Successful in 34m8s
Build Packages / Validation Battery (push) Successful in 38m31s
* Rugnux: Refinement several times faster, one protocol on the CPU and the GPU, parts of it on the Apple GPU; its random draws are the same on every platform. * Rugnux: Refinement follows common practice: the free set decides only the restraint weights and the displacement model (isotropic, TLS or anisotropic, by Hamilton's test), everything else is decided on the working set; lower R-free for placed and predicted models. * Rugnux: Restraint dictionaries via `--restraints` (or among the inputs) and more built-in ligands; a model whose space group is a subgroup of the data's is refined in its own group; reflections plus a model select `--mode refine` on their own. * Rugnux: `-C` fixes the crystal system on the axes as typed; `-S` alone fixes the space group only, the cell is still found and reduced; a space group or cell stored in the input file is ignored, with a line in the log. * Rugnux: More reliable multi-sweep merging; `--mode scale` merges several stills runs as one; `_plot.txt` and the report name each input; a second crystal form is reported for stills given a cell. * jfjoch_broker (experimental): Live Rugnux on FPGA detectors (JUNGFRAU) takes the same path as a DECTRIS stream, rotation and serial alike, model step included, with analysis threads per GPU; frames waiting for the analysis can be viewed; no host stage drops a frame - a source faster than the analysis is held at the card. * jfjoch_broker: Summation of more than 256 frames per image is split between the card and the host (`summation_mode` is then `hybrid`), and live Rugnux runs on such collections; pedestal runs take a receiver of their own. * jfjoch_broker (experimental): `stills_downsample` analyses 1 of every N serial images (chosen by a hash; the first 2000 all; the others written without analysis; reset to 1 by `/initialize`); `max_spot_count` left out means 250 for per-image indexing and up to 1000 for live stills; the live status gives the merge before the model work, the fitted resolution and the anomalous peak height of each unexplained blob. * jfjoch_broker: Without a `pcie` entry the broker runs on a mock of the card instead of the HLS simulation; its spot, ROI and azimuthal results are zero then. * Web frontend: Redesigned Rugnux live page; Vite 8, TypeScript 6, Mol* 5.13 and dependency security updates. * Tools: `jfjoch_fpga_stills_test` measures live stills on the cards with a stored dataset; `jfjoch_fpga_test` loses the HLS-simulation option. * Other: FFTW no longer fetched or linked (the CPU FFT indexer keeps the name `FFTW`); PCIe driver now GPL-2.0-or-later and third-party notices complete; several crash fixes. Reviewed-on: #98 Co-authored-by: Filip Leonarski <filip.leonarski@psi.ch>
120 lines
5.4 KiB
C++
120 lines
5.4 KiB
C++
// SPDX-FileCopyrightText: 2026 Filip Leonarski, Paul Scherrer Institute <filip.leonarski@psi.ch>
|
|
// SPDX-License-Identifier: GPL-3.0-only
|
|
|
|
#include "ModelFFT.h"
|
|
|
|
#include <algorithm>
|
|
#include <array>
|
|
#include <cmath>
|
|
#include <complex>
|
|
#include <vector>
|
|
|
|
#include "gemmi/fail.hpp"
|
|
|
|
#include "../../common/CpuFFT.h"
|
|
#include "../../common/ParallelFor.h"
|
|
|
|
// An (nu, nv, nw) map is stored u fastest - row-major (nw, nv, nu) - and its half-l coefficients
|
|
// likewise as (nw/2 + 1, nv, nu): the layout gemmi's own transforms read and write. The real transform
|
|
// halves w, so w is the last axis transformed.
|
|
static const cpu_fft::Shape kUVW{2, 1, 0};
|
|
|
|
static cpu_fft::Shape MapShape(int nu, int nv, int nw) {
|
|
return {static_cast<size_t>(nw), static_cast<size_t>(nv), static_cast<size_t>(nu)};
|
|
}
|
|
|
|
gemmi::FPhiGrid<float> MapToFPhi(const gemmi::Grid<float> &map, size_t nthreads) {
|
|
if (map.axis_order == gemmi::AxisOrder::ZYX)
|
|
gemmi::fail("MapToFPhi(): ZYX order is not supported");
|
|
gemmi::FPhiGrid<float> hkl;
|
|
hkl.unit_cell = map.unit_cell;
|
|
hkl.spacegroup = map.spacegroup;
|
|
hkl.axis_order = map.axis_order;
|
|
hkl.half_l = true;
|
|
hkl.set_size_without_checking(map.nu, map.nv, map.nw / 2 + 1);
|
|
const float norm = static_cast<float>(map.unit_cell.volume / map.point_count());
|
|
|
|
cpu_fft::R2C(MapShape(map.nu, map.nv, map.nw), kUVW, map.data.data(), hkl.data.data(), nthreads);
|
|
// Conjugated, as gemmi does: the forward transform carries exp(-2 pi i h.x), and a structure
|
|
// factor is the sum over exp(+2 pi i h.x).
|
|
const int n = static_cast<int>(hkl.data.size());
|
|
ParallelChunks(n, nthreads, [&](int lo, int hi) {
|
|
for (int i = lo; i < hi; i++)
|
|
hkl.data[i] = std::conj(hkl.data[i]) * norm;
|
|
});
|
|
return hkl;
|
|
}
|
|
|
|
void MapFromFPhiExecute(int nu, int nv, int nw, std::complex<float> *in, float *out, size_t nthreads) {
|
|
cpu_fft::C2R(MapShape(nu, nv, nw), kUVW, in, out, nthreads);
|
|
}
|
|
|
|
gemmi::FPhiGrid<float> MapToFPhiInParallel(const gemmi::Grid<float> &map, int reach, size_t nthreads) {
|
|
if (map.axis_order == gemmi::AxisOrder::ZYX)
|
|
gemmi::fail("MapToFPhiInParallel(): ZYX order is not supported");
|
|
const int nu = map.nu, nv = map.nv, nw = map.nw, nwh = nw / 2 + 1, nk = 2 * reach + 1;
|
|
const size_t plane = static_cast<size_t>(nu) * nv;
|
|
std::vector<std::complex<float>> half(plane * nwh);
|
|
// The r2c along w of every (u, v) column, then the 2D transform of the planes l <= reach only - the
|
|
// rest are never read. Each is one call split over the threads by lines.
|
|
cpu_fft::R2C({static_cast<size_t>(nw), plane}, {0}, map.data.data(), half.data(), nthreads);
|
|
cpu_fft::C2C({static_cast<size_t>(reach) + 1, static_cast<size_t>(nv), static_cast<size_t>(nu)}, {1, 2}, true,
|
|
half.data(), nthreads);
|
|
|
|
gemmi::FPhiGrid<float> hkl;
|
|
hkl.unit_cell = map.unit_cell;
|
|
hkl.spacegroup = map.spacegroup;
|
|
hkl.axis_order = map.axis_order;
|
|
hkl.half_l = true;
|
|
hkl.set_size_without_checking(nu, nk, reach + 1);
|
|
const float norm = static_cast<float>(map.unit_cell.volume / map.point_count());
|
|
// Conjugated and scaled as MapToFPhi does it, and cropped as CropHalfL crops it.
|
|
ParallelFor(reach + 1, nthreads, [&](int l) {
|
|
for (int k = -reach; k <= reach; k++) {
|
|
const std::complex<float> *row = &half[l * plane + static_cast<size_t>(nu) * gemmi::modulo(k, nv)];
|
|
std::complex<float> *out = &hkl.data[static_cast<size_t>(nu) * (gemmi::modulo(k, nk) + static_cast<size_t>(nk) * l)];
|
|
for (int u = 0; u < nu; u++)
|
|
out[u] = std::conj(row[u]) * norm;
|
|
}
|
|
});
|
|
return hkl;
|
|
}
|
|
|
|
gemmi::Grid<float> MapFromFPhi(const gemmi::FPhiGrid<float> &hkl) {
|
|
if (hkl.axis_order == gemmi::AxisOrder::ZYX || !hkl.half_l)
|
|
gemmi::fail("MapFromFPhi(): only an XYZ half-l grid is supported");
|
|
gemmi::Grid<float> map;
|
|
map.spacegroup = hkl.spacegroup;
|
|
map.unit_cell = hkl.unit_cell;
|
|
map.set_size(hkl.nu, hkl.nv, 2 * (hkl.nw - 1));
|
|
map.axis_order = hkl.axis_order;
|
|
const float norm = static_cast<float>(1.0 / hkl.unit_cell.volume);
|
|
|
|
// Conjugated, as gemmi does: rho(x) = 1/V sum F exp(-2 pi i h.x), and the backward transform
|
|
// carries exp(+2 pi i h.x). A missing coefficient (NaN) counts as zero, also as gemmi does.
|
|
std::vector<std::complex<float>> in(hkl.data.size());
|
|
for (size_t i = 0; i < in.size(); ++i)
|
|
in[i] = std::isnan(hkl.data[i].imag()) ? 0.0f : std::conj(hkl.data[i]);
|
|
cpu_fft::C2R(MapShape(map.nu, map.nv, map.nw), kUVW, in.data(), map.data.data());
|
|
for (auto &x : map.data)
|
|
x *= norm;
|
|
return map;
|
|
}
|
|
|
|
// The rows keep their length: cut to 2 reach + 1 as well, the rotation function read them 15% slower on the
|
|
// GPU (measured on a large cell).
|
|
gemmi::FPhiGrid<float> CropHalfL(const gemmi::FPhiGrid<float> &full, int reach) {
|
|
gemmi::FPhiGrid<float> out;
|
|
out.unit_cell = full.unit_cell;
|
|
out.spacegroup = full.spacegroup;
|
|
out.axis_order = full.axis_order;
|
|
out.half_l = true;
|
|
const int nu = full.nu, n = 2 * reach + 1;
|
|
out.set_size_without_checking(nu, n, reach + 1);
|
|
for (int l = 0; l <= reach; l++)
|
|
for (int k = -reach; k <= reach; k++)
|
|
std::copy_n(&full.data[static_cast<size_t>(nu) * (gemmi::modulo(k, full.nv) + static_cast<size_t>(full.nv) * l)],
|
|
nu, &out.data[static_cast<size_t>(nu) * (gemmi::modulo(k, n) + static_cast<size_t>(n) * l)]);
|
|
return out;
|
|
}
|