v1.0.0-rc.178 (#88)

* Rugnux: Processes serial crystallography data from XFELs - SACLA (MPCCD), PAL-XFEL and European XFEL (CXI), LCLS (XTC) and SwissFEL Alvra (JUNGFRAU with a CrystFEL module geometry) - with several files or Jungfraujoch master files merged in one run (`rugnux *_master.h5`).
* Rugnux: Stills processing takes a known unit cell and space group as a starting point, finds the beam centre (and, with a cell, the detector distance) from the images, detects the saturation level in other facilities' files and refines the placement of individual detector panels.
* Rugnux: The stills report gives R_split and CC1/2 from frame half-sets, comparable with CrystFEL.
* jfjoch_viewer: Opens the same XFEL file formats.
* Validation: A stills battery checks Rugnux against deposited structures from SACLA, PAL-XFEL, LCLS, European XFEL and SwissFEL.
* Rugnux: More reliable convergence of rotation scaling, and live molecular replacement starts as soon as the model is uploaded.
* jfjoch_broker: Initialize clears the previous dataset's bearer tokens, image buffer and live Rugnux status, and a slow CUDA JIT cache is reported at start.

Reviewed-on: #88
Co-authored-by: Filip Leonarski <filip.leonarski@psi.ch>

image_analysis/indexing/IndexerThreadPool.cpp

@@ -3,6 +3,9 @@
 
 #include "IndexerThreadPool.h"
 
+#include <algorithm>
+#include <chrono>
+#include <cmath>
 #include <map>
 #include <tuple>
 
@@ -18,13 +21,27 @@
 #include "FFTIndexerCPU.h"
 #endif
 
-void WarmUpCuFFT() {
+double WarmUpCuFFT() {
 #ifdef JFJOCH_USE_CUDA
     if (get_gpu_count() == 0)
-        return;
-    cufftHandle plan = 0;
-    if (cufftPlan1d(&plan, 1024, CUFFT_C2C, 1) == CUFFT_SUCCESS)
+        return NAN;
+    // The first plan pays the initialisation, and compiles its kernels if the JIT cache does not have them
+    // yet; the next ones show what a plan costs from then on. The fastest of three, so that a stall
+    // beside (another card's context being made) is not taken for a slow plan.
+    double fastest_ms = INFINITY;
+    for (int i = 0; i < 4; i++) {
+        const auto t0 = std::chrono::steady_clock::now();
+        cufftHandle plan = 0;
+        if (cufftPlan3d(&plan, 64, 64, 64, CUFFT_R2C) != CUFFT_SUCCESS)
+            return NAN;
         cufftDestroy(plan);
+        const double ms = std::chrono::duration<double, std::milli>(std::chrono::steady_clock::now() - t0).count();
+        if (i > 0)
+            fastest_ms = std::min(fastest_ms, ms);
+    }
+    return fastest_ms;
+#else
+    return NAN;
 #endif
 }