2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 2012,2013,2014,2015,2016, The GROMACS development team.
5 * Copyright (c) 2017,2018,2019,2020,2021, by the GROMACS development team, led by
6 * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
7 * and including many others, as listed in the AUTHORS file in the
8 * top-level source directory and at http://www.gromacs.org.
10 * GROMACS is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU Lesser General Public License
12 * as published by the Free Software Foundation; either version 2.1
13 * of the License, or (at your option) any later version.
15 * GROMACS is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * Lesser General Public License for more details.
20 * You should have received a copy of the GNU Lesser General Public
21 * License along with GROMACS; if not, see
22 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
23 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
25 * If you want to redistribute modifications to GROMACS, please
26 * consider that scientific software is very special. Version
27 * control is crucial - bugs must be traceable. We will be happy to
28 * consider code for inclusion in the official distribution, but
29 * derived work must not be called official GROMACS. Details are found
30 * in the README & COPYING files - if they are missing, get the
31 * official version at http://www.gromacs.org.
33 * To help us fund GROMACS development, we humbly ask that you cite
34 * the research papers on the package. Check out http://www.gromacs.org.
45 #include "gromacs/math/vec.h"
46 #include "gromacs/random/threefry.h"
47 #include "gromacs/random/uniformintdistribution.h"
48 #include "gromacs/topology/topology.h"
49 #include "gromacs/utility/basedefinitions.h"
50 #include "gromacs/utility/cstringutil.h"
51 #include "gromacs/utility/exceptions.h"
52 #include "gromacs/utility/fatalerror.h"
53 #include "gromacs/utility/futil.h"
54 #include "gromacs/utility/gmxomp.h"
55 #include "gromacs/utility/smalloc.h"
56 #include "gromacs/utility/strdb.h"
58 void check_binwidth(real binwidth)
60 real smallest_bin = 0.1;
61 if (binwidth < smallest_bin)
64 "Binwidth shouldn't be smaller then smallest bond length (H-H bond ~0.1nm) in a "
69 void check_mcover(real mcover)
73 gmx_fatal(FARGS, "mcover should be -1 or (0,1]");
75 else if ((mcover < 0) && (mcover != -1))
77 gmx_fatal(FARGS, "mcover should be -1 or (0,1]");
85 void normalize_probability(int n, double* a)
89 for (i = 0; i < n; i++)
93 for (i = 0; i < n; i++)
99 gmx_neutron_atomic_structurefactors_t* gmx_neutronstructurefactors_init(const char* datfn)
101 /* read nsfactor.dat */
108 gmx_neutron_atomic_structurefactors_t* gnsf;
110 gmx::FilePtr fp = gmx::openLibraryFile(datfn);
112 /* allocate memory for structure */
114 snew(gnsf->atomnm, nralloc);
115 snew(gnsf->p, nralloc);
116 snew(gnsf->n, nralloc);
117 snew(gnsf->slength, nralloc);
119 gnsf->nratoms = line_no;
121 while (get_a_line(fp.get(), line, STRLEN))
124 if (sscanf(line, "%s %d %d %lf", atomnm, &p, &n, &slength) == 4)
126 gnsf->atomnm[i] = gmx_strdup(atomnm);
129 gnsf->slength[i] = slength;
131 gnsf->nratoms = line_no;
132 if (line_no == nralloc)
135 srenew(gnsf->atomnm, nralloc);
136 srenew(gnsf->p, nralloc);
137 srenew(gnsf->n, nralloc);
138 srenew(gnsf->slength, nralloc);
143 fprintf(stderr, "WARNING: Error in file %s at line %d ignored\n", datfn, line_no);
146 srenew(gnsf->atomnm, gnsf->nratoms);
147 srenew(gnsf->p, gnsf->nratoms);
148 srenew(gnsf->n, gnsf->nratoms);
149 srenew(gnsf->slength, gnsf->nratoms);
154 gmx_sans_t* gmx_sans_init(const t_topology* top, gmx_neutron_atomic_structurefactors_t* gnsf)
156 gmx_sans_t* gsans = nullptr;
158 /* Try to assing scattering length from nsfactor.dat */
160 snew(gsans->slength, top->atoms.nr);
161 /* copy topology data */
163 for (i = 0; i < top->atoms.nr; i++)
165 for (j = 0; j < gnsf->nratoms; j++)
167 if (top->atoms.atom[i].atomnumber == gnsf->p[j])
169 /* we need special case for H and D */
170 if (top->atoms.atom[i].atomnumber == 1)
172 if (top->atoms.atom[i].m == 1.008000)
174 gsans->slength[i] = gnsf->slength[0];
178 gsans->slength[i] = gnsf->slength[1];
183 gsans->slength[i] = gnsf->slength[j];
192 gmx_radial_distribution_histogram_t* calc_radial_distribution_histogram(gmx_sans_t* gsans,
203 gmx_radial_distribution_histogram_t* pr = nullptr;
211 gmx::DefaultRandomEngine* trng = nullptr;
214 gmx::DefaultRandomEngine rng(seed);
216 /* allocate memory for pr */
218 /* set some fields */
219 pr->binwidth = binwidth;
222 * create max dist rvec
223 * dist = box[xx] + box[yy] + box[zz]
225 rvec_add(box[XX], box[YY], dist);
226 rvec_add(box[ZZ], dist, dist);
230 pr->grn = static_cast<int>(std::floor(rmax / pr->binwidth) + 1);
232 snew(pr->gr, pr->grn);
236 /* Special case for setting automaticaly number of mc iterations to 1% of total number of direct iterations */
239 mc_max = static_cast<int64_t>(std::floor(0.5 * 0.01 * isize * (isize - 1)));
243 mc_max = static_cast<int64_t>(std::floor(0.5 * mcover * isize * (isize - 1)));
246 nthreads = gmx_omp_get_max_threads();
248 trng = new gmx::DefaultRandomEngine[nthreads];
249 for (i = 0; i < nthreads; i++)
251 snew(tgr[i], pr->grn);
254 # pragma omp parallel shared(tgr, trng) private(tid, i, j)
256 gmx::UniformIntDistribution<int> tdist(0, isize - 1);
257 tid = gmx_omp_get_thread_num();
258 /* now starting parallel threads */
260 for (int64_t mc = 0; mc < mc_max; mc++)
264 i = tdist(trng[tid]); // [0,isize-1]
265 j = tdist(trng[tid]); // [0,isize-1]
268 tgr[tid][static_cast<int>(std::floor(std::sqrt(distance2(x[index[i]], x[index[j]])) / binwidth))] +=
269 gsans->slength[index[i]] * gsans->slength[index[j]];
272 GMX_CATCH_ALL_AND_EXIT_WITH_FATAL_ERROR
275 /* collecting data from threads */
276 for (i = 0; i < pr->grn; i++)
278 for (j = 0; j < nthreads; j++)
280 pr->gr[i] += tgr[j][i];
283 /* freeing memory for tgr and destroying trng */
284 for (i = 0; i < nthreads; i++)
291 gmx::UniformIntDistribution<int> dist(0, isize - 1);
292 for (int64_t mc = 0; mc < mc_max; mc++)
294 i = dist(rng); // [0,isize-1]
295 j = dist(rng); // [0,isize-1]
298 pr->gr[static_cast<int>(std::floor(std::sqrt(distance2(x[index[i]], x[index[j]])) / binwidth))] +=
299 gsans->slength[index[i]] * gsans->slength[index[j]];
307 nthreads = gmx_omp_get_max_threads();
308 /* Allocating memory for tgr arrays */
310 for (i = 0; i < nthreads; i++)
312 snew(tgr[i], pr->grn);
314 # pragma omp parallel shared(tgr) private(tid, i, j)
316 tid = gmx_omp_get_thread_num();
317 /* starting parallel threads */
319 for (i = 0; i < isize; i++)
323 for (j = 0; j < i; j++)
325 tgr[tid][static_cast<int>(std::floor(std::sqrt(distance2(x[index[i]], x[index[j]])) / binwidth))] +=
326 gsans->slength[index[i]] * gsans->slength[index[j]];
329 GMX_CATCH_ALL_AND_EXIT_WITH_FATAL_ERROR
332 /* collecating data for pr->gr */
333 for (i = 0; i < pr->grn; i++)
335 for (j = 0; j < nthreads; j++)
337 pr->gr[i] += tgr[j][i];
340 /* freeing memory for tgr */
341 for (i = 0; i < nthreads; i++)
347 for (i = 0; i < isize; i++)
349 for (j = 0; j < i; j++)
351 pr->gr[static_cast<int>(std::floor(std::sqrt(distance2(x[index[i]], x[index[j]])) / binwidth))] +=
352 gsans->slength[index[i]] * gsans->slength[index[j]];
358 /* normalize if needed */
361 normalize_probability(pr->grn, pr->gr);
364 snew(pr->r, pr->grn);
365 for (i = 0; i < pr->grn; i++)
367 pr->r[i] = (pr->binwidth * i + pr->binwidth * 0.5);
373 gmx_static_structurefactor_t* convert_histogram_to_intensity_curve(gmx_radial_distribution_histogram_t* pr,
378 gmx_static_structurefactor_t* sq = nullptr;
382 sq->qn = static_cast<int>(std::floor((end_q - start_q) / q_step));
385 for (i = 0; i < sq->qn; i++)
387 sq->q[i] = start_q + i * q_step;
393 for (i = 1; i < sq->qn; i++)
395 for (j = 0; j < pr->grn; j++)
397 sq->s[i] += (pr->gr[j] / pr->r[j]) * std::sin(sq->q[i] * pr->r[j]);
399 sq->s[i] /= sq->q[i];
404 for (i = 0; i < sq->qn; i++)
406 for (j = 0; j < pr->grn; j++)
408 sq->s[i] += (pr->gr[j] / pr->r[j]) * std::sin(sq->q[i] * pr->r[j]);
410 sq->s[i] /= sq->q[i];