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) 2010,2014,2015,2018,2019,2021, 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! */
42 #include "gromacs/gmxlib/network.h"
43 #include "gromacs/utility/arrayref.h"
44 #include "gromacs/utility/smalloc.h"
55 void destroy_bin(t_bin* b)
65 void reset_bin(t_bin* b)
70 int add_binr(t_bin* b, int nr, const real r[])
76 if (b->nreal + nr > b->maxreal)
78 b->maxreal = b->nreal + nr;
79 rest = b->maxreal % MULT;
82 b->maxreal += MULT - rest;
84 srenew(b->rbuf, b->maxreal);
87 rbuf = b->rbuf + b->nreal;
89 for (i = 0; (i < nr); i++)
100 int add_binr(t_bin* b, gmx::ArrayRef<const real> r)
102 return add_binr(b, r.size(), r.data());
105 int add_bind(t_bin* b, int nr, const double r[])
111 if (b->nreal + nr > b->maxreal)
113 b->maxreal = b->nreal + nr;
114 rest = b->maxreal % MULT;
117 b->maxreal += MULT - rest;
119 srenew(b->rbuf, b->maxreal);
122 rbuf = b->rbuf + b->nreal;
123 for (i = 0; (i < nr); i++)
134 void sum_bin(t_bin* b, const t_commrec* cr)
138 for (i = b->nreal; (i < b->maxreal); i++)
142 gmx_sumd(b->maxreal, b->rbuf, cr);
145 void extract_binr(t_bin* b, int index, int nr, real r[])
150 rbuf = b->rbuf + index;
151 for (i = 0; (i < nr); i++)
157 void extract_binr(t_bin* b, int index, gmx::ArrayRef<real> r)
159 extract_binr(b, index, r.size(), r.data());
162 void extract_bind(t_bin* b, int index, int nr, double r[])
167 rbuf = b->rbuf + index;
168 for (i = 0; (i < nr); i++)