2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 2010,2011,2012,2014, by the GROMACS development team, led by
5 * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
6 * and including many others, as listed in the AUTHORS file in the
7 * top-level source directory and at http://www.gromacs.org.
9 * GROMACS is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public License
11 * as published by the Free Software Foundation; either version 2.1
12 * of the License, or (at your option) any later version.
14 * GROMACS is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with GROMACS; if not, see
21 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
22 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 * If you want to redistribute modifications to GROMACS, please
25 * consider that scientific software is very special. Version
26 * control is crucial - bugs must be traceable. We will be happy to
27 * consider code for inclusion in the official distribution, but
28 * derived work must not be called official GROMACS. Details are found
29 * in the README & COPYING files - if they are missing, get the
30 * official version at http://www.gromacs.org.
32 * To help us fund GROMACS development, we humbly ask that you cite
33 * the research papers on the package. Check out http://www.gromacs.org.
37 * Implements functions in mempool.h.
39 * \author Teemu Murtola <teemu.murtola@gmail.com>
40 * \ingroup module_selection
48 #include "gromacs/selection/indexutil.h"
49 #include "gromacs/utility/exceptions.h"
50 #include "gromacs/utility/gmxassert.h"
51 #include "gromacs/utility/smalloc.h"
55 //! Alignment in bytes for all returned blocks.
59 * Describes a single block allocated from the memory pool.
61 typedef struct gmx_sel_mempool_block_t
63 //! Pointer to the start of the block (as returned to the user).
65 //! Size of the block, including padding required to align next block.
67 } gmx_sel_mempool_block_t;
70 * Describes a memory pool.
72 struct gmx_sel_mempool_t
74 //! Number of bytes currently allocated from the pool.
76 //! Number of bytes free in the pool, or 0 if \a buffer is NULL.
78 //! Memory area allocated for the pool, or NULL if not yet reserved.
80 //! Pointer to the first free byte (aligned at ::ALIGN_STEP) in \a buffer.
82 //! Number of blocks allocated from the pool.
84 //! Array describing the allocated blocks.
85 gmx_sel_mempool_block_t *blockstack;
86 //! Number of elements allocated for the \a blockstack array.
87 int blockstack_nalloc;
89 * Maximum number of bytes that have been reserved from the pool
96 _gmx_sel_mempool_create()
98 gmx_sel_mempool_t *mp;
106 mp->blockstack = NULL;
107 mp->blockstack_nalloc = 0;
113 _gmx_sel_mempool_destroy(gmx_sel_mempool_t *mp)
119 for (i = 0; i < mp->nblocks; ++i)
121 sfree(mp->blockstack[i].ptr);
125 sfree(mp->blockstack);
130 _gmx_sel_mempool_alloc(gmx_sel_mempool_t *mp, size_t size)
135 size_walign = ((size + ALIGN_STEP - 1) / ALIGN_STEP) * ALIGN_STEP;
138 if (mp->freesize < size)
140 GMX_THROW(gmx::InternalError("Out of memory pool memory"));
143 mp->freeptr += size_walign;
144 mp->freesize -= size_walign;
145 mp->currsize += size_walign;
152 throw std::bad_alloc();
154 mp->currsize += size_walign;
155 if (mp->currsize > mp->maxsize)
157 mp->maxsize = mp->currsize;
161 if (mp->nblocks >= mp->blockstack_nalloc)
163 mp->blockstack_nalloc = mp->nblocks + 10;
164 srenew(mp->blockstack, mp->blockstack_nalloc);
166 mp->blockstack[mp->nblocks].ptr = ptr;
167 mp->blockstack[mp->nblocks].size = size_walign;
174 _gmx_sel_mempool_free(gmx_sel_mempool_t *mp, void *ptr)
182 GMX_RELEASE_ASSERT(mp->nblocks > 0 && mp->blockstack[mp->nblocks - 1].ptr == ptr,
183 "Invalid order of memory pool free calls");
185 size = mp->blockstack[mp->nblocks].size;
186 mp->currsize -= size;
189 mp->freeptr = (char *)ptr;
190 mp->freesize += size;
199 _gmx_sel_mempool_reserve(gmx_sel_mempool_t *mp, size_t size)
201 GMX_RELEASE_ASSERT(mp->nblocks == 0,
202 "Cannot reserve memory pool when there is something allocated");
203 GMX_RELEASE_ASSERT(!mp->buffer, "Cannot reserve memory pool twice");
208 mp->buffer = (char *)malloc(size);
211 throw std::bad_alloc();
214 mp->freeptr = mp->buffer;
218 _gmx_sel_mempool_alloc_group(gmx_sel_mempool_t *mp, gmx_ana_index_t *g,
221 void *ptr = _gmx_sel_mempool_alloc(mp, sizeof(*g->index)*isize);
222 g->index = static_cast<int *>(ptr);
226 _gmx_sel_mempool_free_group(gmx_sel_mempool_t *mp, gmx_ana_index_t *g)
228 _gmx_sel_mempool_free(mp, g->index);