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-2009, The GROMACS development team,
6 * check out http://www.gromacs.org for more information.
7 * Copyright (c) 2012, by the GROMACS development team, led by
8 * David van der Spoel, Berk Hess, Erik Lindahl, and including many
9 * others, as listed in the AUTHORS file in the top-level source
10 * directory and at http://www.gromacs.org.
12 * GROMACS is free software; you can redistribute it and/or
13 * modify it under the terms of the GNU Lesser General Public License
14 * as published by the Free Software Foundation; either version 2.1
15 * of the License, or (at your option) any later version.
17 * GROMACS is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20 * Lesser General Public License for more details.
22 * You should have received a copy of the GNU Lesser General Public
23 * License along with GROMACS; if not, see
24 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
25 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
27 * If you want to redistribute modifications to GROMACS, please
28 * consider that scientific software is very special. Version
29 * control is crucial - bugs must be traceable. We will be happy to
30 * consider code for inclusion in the official distribution, but
31 * derived work must not be called official GROMACS. Details are found
32 * in the README & COPYING files - if they are missing, get the
33 * official version at http://www.gromacs.org.
35 * To help us fund GROMACS development, we humbly ask that you cite
36 * the research papers on the package. Check out http://www.gromacs.org.
39 * \brief Memory pooling for selection evaluation.
42 * Document these functions.
51 #include <gmx_fatal.h>
54 #include <indexutil.h>
60 typedef struct gmx_sel_mempool_block_t
64 } gmx_sel_mempool_block_t;
66 struct gmx_sel_mempool_t
73 gmx_sel_mempool_block_t *blockstack;
74 int blockstack_nalloc;
79 _gmx_sel_mempool_create(gmx_sel_mempool_t **mpp)
81 gmx_sel_mempool_t *mp;
89 mp->blockstack = NULL;
90 mp->blockstack_nalloc = 0;
97 _gmx_sel_mempool_destroy(gmx_sel_mempool_t *mp)
103 for (i = 0; i < mp->nblocks; ++i)
105 sfree(mp->blockstack[i].ptr);
109 sfree(mp->blockstack);
114 _gmx_sel_mempool_alloc(gmx_sel_mempool_t *mp, void **ptrp, size_t size)
120 size_walign = ((size + ALIGN_STEP - 1) / ALIGN_STEP) * ALIGN_STEP;
123 if (mp->freesize < size)
125 gmx_bug("out of memory pool memory");
129 mp->freeptr += size_walign;
130 mp->freesize -= size_walign;
131 mp->currsize += size_walign;
138 gmx_mem("out of memory");
141 mp->currsize += size_walign;
142 if (mp->currsize > mp->maxsize)
144 mp->maxsize = mp->currsize;
148 if (mp->nblocks >= mp->blockstack_nalloc)
150 mp->blockstack_nalloc = mp->nblocks + 10;
151 srenew(mp->blockstack, mp->blockstack_nalloc);
153 mp->blockstack[mp->nblocks].ptr = ptr;
154 mp->blockstack[mp->nblocks].size = size_walign;
162 _gmx_sel_mempool_free(gmx_sel_mempool_t *mp, void *ptr)
170 assert(mp->nblocks > 0 && mp->blockstack[mp->nblocks - 1].ptr == ptr);
172 size = mp->blockstack[mp->nblocks].size;
173 mp->currsize -= size;
176 mp->freeptr = (char *)ptr;
177 mp->freesize += size;
186 _gmx_sel_mempool_reserve(gmx_sel_mempool_t *mp, size_t size)
188 assert(mp->nblocks == 0 && !mp->buffer);
193 mp->buffer = (char *)malloc(size);
196 gmx_mem("out of memory");
200 mp->freeptr = mp->buffer;
205 _gmx_sel_mempool_alloc_group(gmx_sel_mempool_t *mp, gmx_ana_index_t *g,
208 return _gmx_sel_mempool_alloc(mp, (void **)&g->index,
209 sizeof(*g->index)*isize);
213 _gmx_sel_mempool_free_group(gmx_sel_mempool_t *mp, gmx_ana_index_t *g)
215 _gmx_sel_mempool_free(mp, g->index);