Avoid numerical overflow with overlapping atoms
[gromacs.git] / src / gromacs / mdlib / ebin.cpp
blob9777c3e14241177f0c044d96a22de4a99fcb390e
1 /*
2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 1991-2000, University of Groningen, The Netherlands.
5 * Copyright (c) 2001-2004, The GROMACS development team.
6 * Copyright (c) 2012,2014,2015, by the GROMACS development team, led by
7 * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
8 * and including many others, as listed in the AUTHORS file in the
9 * top-level source directory and at http://www.gromacs.org.
11 * GROMACS is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU Lesser General Public License
13 * as published by the Free Software Foundation; either version 2.1
14 * of the License, or (at your option) any later version.
16 * GROMACS is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 * Lesser General Public License for more details.
21 * You should have received a copy of the GNU Lesser General Public
22 * License along with GROMACS; if not, see
23 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
24 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
26 * If you want to redistribute modifications to GROMACS, please
27 * consider that scientific software is very special. Version
28 * control is crucial - bugs must be traceable. We will be happy to
29 * consider code for inclusion in the official distribution, but
30 * derived work must not be called official GROMACS. Details are found
31 * in the README & COPYING files - if they are missing, get the
32 * official version at http://www.gromacs.org.
34 * To help us fund GROMACS development, we humbly ask that you cite
35 * the research papers on the package. Check out http://www.gromacs.org.
37 /* This file is completely threadsafe - keep it that way! */
38 #include "gmxpre.h"
40 #include "ebin.h"
42 #include <math.h>
43 #include <string.h>
45 #include "gromacs/math/units.h"
46 #include "gromacs/math/utilities.h"
47 #include "gromacs/math/vec.h"
48 #include "gromacs/topology/ifunc.h"
49 #include "gromacs/utility/cstringutil.h"
50 #include "gromacs/utility/fatalerror.h"
51 #include "gromacs/utility/smalloc.h"
53 t_ebin *mk_ebin(void)
55 t_ebin *eb;
57 snew(eb, 1);
59 return eb;
62 int get_ebin_space(t_ebin *eb, int nener, const char *enm[], const char *unit)
64 int index;
65 int i, f;
66 const char *u;
68 index = eb->nener;
69 eb->nener += nener;
70 srenew(eb->e, eb->nener);
71 srenew(eb->e_sim, eb->nener);
72 srenew(eb->enm, eb->nener);
73 for (i = index; (i < eb->nener); i++)
75 eb->e[i].e = 0;
76 eb->e[i].eav = 0;
77 eb->e[i].esum = 0;
78 eb->e_sim[i].e = 0;
79 eb->e_sim[i].eav = 0;
80 eb->e_sim[i].esum = 0;
81 eb->enm[i].name = gmx_strdup(enm[i-index]);
82 if (unit != NULL)
84 eb->enm[i].unit = gmx_strdup(unit);
86 else
88 /* Determine the unit from the longname.
89 * These units should have been defined in ifunc.c
90 * But even better would be if all interactions functions
91 * return energies and all non-interaction function
92 * entries would be removed from the ifunc array.
94 u = unit_energy;
95 for (f = 0; f < F_NRE; f++)
97 if (strcmp(eb->enm[i].name,
98 interaction_function[f].longname) == 0)
100 /* Only the terms in this list are not energies */
101 switch (f)
103 case F_DISRESVIOL: u = unit_length; break;
104 case F_ORIRESDEV: u = "obs"; break;
105 case F_TEMP: u = unit_temp_K; break;
106 case F_PDISPCORR:
107 case F_PRES: u = unit_pres_bar; break;
111 eb->enm[i].unit = gmx_strdup(u);
115 return index;
118 void add_ebin(t_ebin *eb, int index, int nener, real ener[], gmx_bool bSum)
120 int i, m;
121 double e, invmm, diff;
122 t_energy *eg, *egs;
124 if ((index+nener > eb->nener) || (index < 0))
126 gmx_fatal(FARGS, "%s-%d: Energies out of range: index=%d nener=%d maxener=%d",
127 __FILE__, __LINE__, index, nener, eb->nener);
130 eg = &(eb->e[index]);
132 for (i = 0; (i < nener); i++)
134 eg[i].e = ener[i];
137 if (bSum)
139 egs = &(eb->e_sim[index]);
141 m = eb->nsum;
143 if (m == 0)
145 for (i = 0; (i < nener); i++)
147 eg[i].eav = 0;
148 eg[i].esum = ener[i];
149 egs[i].esum += ener[i];
152 else
154 invmm = (1.0/(double)m)/((double)m+1.0);
156 for (i = 0; (i < nener); i++)
158 /* Value for this component */
159 e = ener[i];
161 /* first update sigma, then sum */
162 diff = eg[i].esum - m*e;
163 eg[i].eav += diff*diff*invmm;
164 eg[i].esum += e;
165 egs[i].esum += e;
171 void ebin_increase_count(t_ebin *eb, gmx_bool bSum)
173 eb->nsteps++;
174 eb->nsteps_sim++;
176 if (bSum)
178 eb->nsum++;
179 eb->nsum_sim++;
183 void reset_ebin_sums(t_ebin *eb)
185 eb->nsteps = 0;
186 eb->nsum = 0;
187 /* The actual sums are cleared when the next frame is stored */
190 void pr_ebin(FILE *fp, t_ebin *eb, int index, int nener, int nperline,
191 int prmode, gmx_bool bPrHead)
193 int i, j, i0;
194 real ee = 0;
195 int rc;
196 char buf[30];
198 rc = 0;
200 if (index < 0)
202 gmx_fatal(FARGS, "Invalid index in pr_ebin: %d", index);
204 if (nener == -1)
206 nener = eb->nener;
208 else
210 nener = index + nener;
212 for (i = index; (i < nener) && rc >= 0; )
214 if (bPrHead)
216 i0 = i;
217 for (j = 0; (j < nperline) && (i < nener) && rc >= 0; j++, i++)
219 if (strncmp(eb->enm[i].name, "Pres", 4) == 0)
221 /* Print the pressure unit to avoid confusion */
222 sprintf(buf, "%s (%s)", eb->enm[i].name, unit_pres_bar);
223 rc = fprintf(fp, "%15s", buf);
225 else
227 rc = fprintf(fp, "%15s", eb->enm[i].name);
231 if (rc >= 0)
233 rc = fprintf(fp, "\n");
236 i = i0;
238 for (j = 0; (j < nperline) && (i < nener) && rc >= 0; j++, i++)
240 switch (prmode)
242 case eprNORMAL: ee = eb->e[i].e; break;
243 case eprAVER: ee = eb->e_sim[i].esum/eb->nsum_sim; break;
244 default: gmx_fatal(FARGS, "Invalid print mode %d in pr_ebin",
245 prmode);
248 rc = fprintf(fp, " %12.5e", ee);
250 if (rc >= 0)
252 rc = fprintf(fp, "\n");
255 if (rc < 0)
257 gmx_fatal(FARGS, "Cannot write to logfile; maybe you are out of disk space?");
261 #ifdef DEBUGEBIN
262 int main(int argc, char *argv[])
264 #define NE 12
265 #define NT 7
266 #define NS 5
268 t_ebin *eb;
269 int i;
270 char buf[25];
271 char *ce[NE], *ct[NT], *cs[NS];
272 real e[NE], t[NT], s[NS];
273 int ie, it, is;
275 eb = mk_ebin();
276 for (i = 0; (i < NE); i++)
278 e[i] = i;
279 sprintf(buf, "e%d", i);
280 ce[i] = gmx_strdup(buf);
282 ie = get_ebin_space(eb, NE, ce);
283 add_ebin(eb, ie, NE, e, 0);
284 for (i = 0; (i < NS); i++)
286 s[i] = i;
287 sprintf(buf, "s%d", i);
288 cs[i] = gmx_strdup(buf);
290 is = get_ebin_space(eb, NS, cs);
291 add_ebin(eb, is, NS, s, 0);
292 for (i = 0; (i < NT); i++)
294 t[i] = i;
295 sprintf(buf, "t%d", i);
296 ct[i] = gmx_strdup(buf);
298 it = get_ebin_space(eb, NT, ct);
299 add_ebin(eb, it, NT, t, 0);
301 printf("Normal:\n");
302 pr_ebin(stdout, eb, 0, -1, 5, eprNORMAL, 1);
304 printf("Average:\n");
305 pr_ebin(stdout, eb, ie, NE, 5, eprAVER, 1);
306 pr_ebin(stdout, eb, is, NS, 3, eprAVER, 1);
307 pr_ebin(stdout, eb, it, NT, 4, eprAVER, 1);
309 #endif