3 * This source code is part of
7 * GROningen MAchine for Chemical Simulations
9 * Written by David van der Spoel, Erik Lindahl, Berk Hess, and others.
10 * Copyright (c) 1991-2000, University of Groningen, The Netherlands.
11 * Copyright (c) 2001-2009, The GROMACS development team,
12 * check out http://www.gromacs.org for more information.
14 * This program is free software; you can redistribute it and/or
15 * modify it under the terms of the GNU General Public License
16 * as published by the Free Software Foundation; either version 2
17 * of the License, or (at your option) any later version.
19 * If you want to redistribute modifications, please consider that
20 * scientific software is very special. Version control is crucial -
21 * bugs must be traceable. We will be happy to consider code for
22 * inclusion in the official distribution, but derived work must not
23 * be called official GROMACS. Details are found in the README & COPYING
24 * files - if they are missing, get the official version at www.gromacs.org.
26 * To help us fund GROMACS development, we humbly ask that you cite
27 * the papers on the package - you can find them in the top README file.
29 * For more info, check our website at http://www.gromacs.org
32 * \brief Memory pooling for selection evaluation.
35 * Document these functions.
44 #include <gmx_fatal.h>
47 #include <indexutil.h>
53 typedef struct gmx_sel_mempool_block_t
57 } gmx_sel_mempool_block_t;
59 struct gmx_sel_mempool_t
66 gmx_sel_mempool_block_t *blockstack;
67 int blockstack_nalloc;
72 _gmx_sel_mempool_create(gmx_sel_mempool_t **mpp)
74 gmx_sel_mempool_t *mp;
82 mp->blockstack = NULL;
83 mp->blockstack_nalloc = 0;
90 _gmx_sel_mempool_destroy(gmx_sel_mempool_t *mp)
96 for (i = 0; i < mp->nblocks; ++i)
98 sfree(mp->blockstack[i].ptr);
102 sfree(mp->blockstack);
107 _gmx_sel_mempool_alloc(gmx_sel_mempool_t *mp, void **ptrp, size_t size)
113 size_walign = ((size + ALIGN_STEP - 1) / ALIGN_STEP) * ALIGN_STEP;
116 if (mp->freesize < size)
118 gmx_bug("out of memory pool memory");
122 mp->freeptr += size_walign;
123 mp->freesize -= size_walign;
124 mp->currsize += size_walign;
131 gmx_mem("out of memory");
134 mp->currsize += size_walign;
135 if (mp->currsize > mp->maxsize)
137 mp->maxsize = mp->currsize;
141 if (mp->nblocks >= mp->blockstack_nalloc)
143 mp->blockstack_nalloc = mp->nblocks + 10;
144 srenew(mp->blockstack, mp->blockstack_nalloc);
146 mp->blockstack[mp->nblocks].ptr = ptr;
147 mp->blockstack[mp->nblocks].size = size_walign;
155 _gmx_sel_mempool_free(gmx_sel_mempool_t *mp, void *ptr)
163 assert(mp->nblocks > 0 && mp->blockstack[mp->nblocks - 1].ptr == ptr);
165 size = mp->blockstack[mp->nblocks].size;
166 mp->currsize -= size;
169 mp->freeptr = (char *)ptr;
170 mp->freesize += size;
179 _gmx_sel_mempool_reserve(gmx_sel_mempool_t *mp, size_t size)
181 assert(mp->nblocks == 0 && !mp->buffer);
186 mp->buffer = (char *)malloc(size);
189 gmx_mem("out of memory");
193 mp->freeptr = mp->buffer;
198 _gmx_sel_mempool_alloc_group(gmx_sel_mempool_t *mp, gmx_ana_index_t *g,
201 return _gmx_sel_mempool_alloc(mp, (void **)&g->index,
202 sizeof(*g->index)*isize);
206 _gmx_sel_mempool_free_group(gmx_sel_mempool_t *mp, gmx_ana_index_t *g)
208 _gmx_sel_mempool_free(mp, g->index);