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>
76 lines
2.9 KiB
C++
76 lines
2.9 KiB
C++
// SPDX-FileCopyrightText: 2026 Filip Leonarski, Paul Scherrer Institute <filip.leonarski@psi.ch>
|
|
// SPDX-License-Identifier: GPL-3.0-only
|
|
|
|
#include "CpuFFT.h"
|
|
|
|
// Under a name of its own: gemmi includes the same header with POCKETFFT_NO_MULTITHREADING, and its
|
|
// templates and ours must not be merged by the linker into one (single-threaded or not) copy.
|
|
#define pocketfft jfjoch_pocketfft
|
|
// MSVC: the scalar code (pocketfft vectorises only with the GCC/Clang vector extension, and decides so
|
|
// itself; said here so that it stays so).
|
|
#ifdef _MSC_VER
|
|
#define POCKETFFT_NO_VECTORS
|
|
#endif
|
|
#include "../gemmi_gph/gemmi/third_party/pocketfft_hdronly.h"
|
|
|
|
namespace cpu_fft {
|
|
|
|
namespace {
|
|
|
|
// pocketfft counts strides in bytes.
|
|
pocketfft::stride_t Bytes(const Strides &s, size_t element) {
|
|
pocketfft::stride_t out(s.size());
|
|
for (size_t i = 0; i < s.size(); i++)
|
|
out[i] = s[i] * static_cast<std::ptrdiff_t>(element);
|
|
return out;
|
|
}
|
|
|
|
Strides Contiguous(const Shape &shape) {
|
|
Strides s(shape.size());
|
|
std::ptrdiff_t step = 1;
|
|
for (size_t i = shape.size(); i-- > 0;) {
|
|
s[i] = step;
|
|
step *= static_cast<std::ptrdiff_t>(shape[i]);
|
|
}
|
|
return s;
|
|
}
|
|
|
|
Shape Halved(Shape shape, size_t axis) {
|
|
shape[axis] = shape[axis] / 2 + 1;
|
|
return shape;
|
|
}
|
|
|
|
} // namespace
|
|
|
|
void R2C(const Shape &shape, const Strides &stride_in, const Strides &stride_out, const Shape &axes,
|
|
const float *in, std::complex<float> *out, size_t nthreads) {
|
|
pocketfft::r2c<float>(shape, Bytes(stride_in, sizeof(float)), Bytes(stride_out, sizeof(std::complex<float>)),
|
|
axes, pocketfft::FORWARD, in, out, 1.0f, nthreads);
|
|
}
|
|
|
|
void R2C(const Shape &shape, const Shape &axes, const float *in, std::complex<float> *out, size_t nthreads) {
|
|
R2C(shape, Contiguous(shape), Contiguous(Halved(shape, axes.back())), axes, in, out, nthreads);
|
|
}
|
|
|
|
void C2R(const Shape &shape, const Shape &axes, std::complex<float> *in, float *out, size_t nthreads) {
|
|
const Shape half = Halved(shape, axes.back());
|
|
const pocketfft::stride_t stride_in = Bytes(Contiguous(half), sizeof(std::complex<float>));
|
|
if (axes.size() > 1)
|
|
pocketfft::c2c<float>(half, stride_in, stride_in, Shape(axes.begin(), axes.end() - 1), pocketfft::BACKWARD,
|
|
in, in, 1.0f, nthreads);
|
|
pocketfft::c2r<float>(shape, stride_in, Bytes(Contiguous(shape), sizeof(float)), axes.back(),
|
|
pocketfft::BACKWARD, in, out, 1.0f, nthreads);
|
|
}
|
|
|
|
void C2C(const Shape &shape, const Strides &stride, const Shape &axes, bool forward, std::complex<float> *data,
|
|
size_t nthreads) {
|
|
const pocketfft::stride_t s = Bytes(stride, sizeof(std::complex<float>));
|
|
pocketfft::c2c<float>(shape, s, s, axes, forward, data, data, 1.0f, nthreads);
|
|
}
|
|
|
|
void C2C(const Shape &shape, const Shape &axes, bool forward, std::complex<float> *data, size_t nthreads) {
|
|
C2C(shape, Contiguous(shape), axes, forward, data, nthreads);
|
|
}
|
|
|
|
} // namespace cpu_fft
|