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) 2013,2014,2015,2017,2018,2019, 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.
45 #include "gromacs/utility/smalloc.h"
46 #include "gromacs/utility/txtdump.h"
48 void gmx::RangePartitioning::setAllBlocksSizeOne(int numBlocksToSet)
50 if (!allBlocksHaveSizeOne())
54 if (numBlocksToSet < numBlocks())
56 index_.resize(numBlocksToSet + 1);
58 else if (numBlocksToSet > numBlocks())
60 for (int b = numBlocks(); b < numBlocksToSet; b++)
67 void init_block(t_block* block)
70 block->nalloc_index = 1;
71 snew(block->index, block->nalloc_index);
75 void init_block_null(t_block* block)
78 block->nalloc_index = 0;
79 block->index = nullptr;
82 void init_blocka(t_blocka* block)
86 block->nalloc_index = 1;
87 snew(block->index, block->nalloc_index);
93 void init_blocka_null(t_blocka* block)
97 block->nalloc_index = 0;
98 block->index = nullptr;
103 t_blocka* new_blocka()
108 snew(block->index, 1);
113 void done_block(t_block* block)
117 block->index = nullptr;
118 block->nalloc_index = 0;
121 void done_blocka(t_blocka* block)
127 block->index = nullptr;
129 block->nalloc_index = 0;
133 void stupid_fill_block(t_block* grp, int natom, gmx_bool bOneIndexGroup)
137 grp->nalloc_index = 2;
138 srenew(grp->index, grp->nalloc_index);
140 grp->index[1] = natom;
145 grp->nalloc_index = natom + 1;
146 srenew(grp->index, grp->nalloc_index);
147 for (int i = 0; i <= natom; ++i)
155 void stupid_fill_blocka(t_blocka* grp, int natom)
157 grp->nalloc_a = natom;
158 snew(grp->a, grp->nalloc_a);
159 for (int i = 0; i < natom; ++i)
165 grp->nalloc_index = natom + 1;
166 snew(grp->index, grp->nalloc_index);
167 for (int i = 0; i <= natom; ++i)
174 void copy_blocka(const t_blocka* src, t_blocka* dest)
177 /* Workaround for inconsistent handling of nalloc_index in
178 * other parts of the code. Often nalloc_index and nalloc_a
181 dest->nalloc_index = std::max(src->nalloc_index, dest->nr + 1);
182 snew(dest->index, dest->nalloc_index);
183 for (int i = 0; i < dest->nr + 1; ++i)
185 dest->index[i] = src->index[i];
187 dest->nra = src->nra;
189 dest->nalloc_a = std::max(src->nalloc_a, dest->nra);
190 snew(dest->a, dest->nalloc_a);
191 for (int i = 0; i < dest->nra; ++i)
193 dest->a[i] = src->a[i];
197 static int pr_block_title(FILE* fp, int indent, const char* title, const t_block* block)
199 if (available(fp, block, indent, title))
201 indent = pr_title(fp, indent, title);
202 pr_indent(fp, indent);
203 fprintf(fp, "nr=%d\n", block->nr);
208 static int pr_blocka_title(FILE* fp, int indent, const char* title, const t_blocka* block)
210 if (available(fp, block, indent, title))
212 indent = pr_title(fp, indent, title);
213 pr_indent(fp, indent);
214 fprintf(fp, "nr=%d\n", block->nr);
215 pr_indent(fp, indent);
216 fprintf(fp, "nra=%d\n", block->nra);
221 static void low_pr_blocka(FILE* fp, int indent, const char* title, const t_blocka* block, gmx_bool bShowNumbers)
225 if (available(fp, block, indent, title))
227 indent = pr_blocka_title(fp, indent, title, block);
228 for (i = 0; i <= block->nr; i++)
230 pr_indent(fp, indent + INDENT);
231 fprintf(fp, "%s->index[%d]=%d\n", title, bShowNumbers ? i : -1, block->index[i]);
233 for (i = 0; i < block->nra; i++)
235 pr_indent(fp, indent + INDENT);
236 fprintf(fp, "%s->a[%d]=%d\n", title, bShowNumbers ? i : -1, block->a[i]);
241 void pr_block(FILE* fp, int indent, const char* title, const t_block* block, gmx_bool bShowNumbers)
245 if (available(fp, block, indent, title))
247 indent = pr_block_title(fp, indent, title, block);
249 if (block->index[start] != 0)
251 fprintf(fp, "block->index[%d] should be 0\n", start);
255 for (i = 0; i < block->nr; i++)
257 int end = block->index[i + 1];
258 pr_indent(fp, indent);
261 fprintf(fp, "%s[%d]={}\n", title, i);
265 fprintf(fp, "%s[%d]={%d..%d}\n", title, bShowNumbers ? i : -1,
266 bShowNumbers ? start : -1, bShowNumbers ? end - 1 : -1);
274 void pr_blocka(FILE* fp, int indent, const char* title, const t_blocka* block, gmx_bool bShowNumbers)
276 int i, j, ok, size, start, end;
278 if (available(fp, block, indent, title))
280 indent = pr_blocka_title(fp, indent, title, block);
283 if ((ok = static_cast<int>(block->index[start] == 0)) == 0)
285 fprintf(fp, "block->index[%d] should be 0\n", start);
289 for (i = 0; i < block->nr; i++)
291 end = block->index[i + 1];
292 size = pr_indent(fp, indent);
295 size += fprintf(fp, "%s[%d]={", title, i);
299 size += fprintf(fp, "%s[%d][%d..%d]={", title, bShowNumbers ? i : -1,
300 bShowNumbers ? start : -1, bShowNumbers ? end - 1 : -1);
302 for (j = start; j < end; j++)
306 size += fprintf(fp, ", ");
308 if ((size) > (USE_WIDTH))
311 size = pr_indent(fp, indent + INDENT);
313 size += fprintf(fp, "%d", block->a[j]);
319 if ((end != block->nra) || (!ok))
321 pr_indent(fp, indent);
322 fprintf(fp, "tables inconsistent, dumping complete tables:\n");
323 low_pr_blocka(fp, indent, title, block, bShowNumbers);
328 void copy_block(const t_block* src, t_block* dst)
331 /* Workaround for inconsistent handling of nalloc_index in
332 * other parts of the code. Often nalloc_index and nalloc_a
335 dst->nalloc_index = std::max(src->nalloc_index, dst->nr + 1);
336 snew(dst->index, dst->nalloc_index);
337 for (int i = 0; i < dst->nr + 1; ++i)
339 dst->index[i] = src->index[i];