2011-02-23 10:52:22 +00:00
|
|
|
/*
|
2002-10-12 11:37:38 +00:00
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
|
* as published by the Free Software Foundation; either version 2
|
2008-01-07 19:13:47 +00:00
|
|
|
* of the License, or (at your option) any later version.
|
2002-10-12 11:37:38 +00:00
|
|
|
*
|
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
|
*
|
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
|
* along with this program; if not, write to the Free Software Foundation,
|
2010-02-12 13:34:04 +00:00
|
|
|
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
2002-10-12 11:37:38 +00:00
|
|
|
*
|
|
|
|
|
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
|
|
|
|
|
* All rights reserved.
|
|
|
|
|
*/
|
|
|
|
|
|
2019-02-18 08:08:12 +11:00
|
|
|
/** \file
|
|
|
|
|
* \ingroup bli
|
2019-03-02 11:57:39 +11:00
|
|
|
* \brief Efficient memory allocation for many small chunks.
|
2019-02-18 08:08:12 +11:00
|
|
|
* \section aboutmemarena Memory Arena
|
2015-08-05 00:21:50 +10:00
|
|
|
*
|
|
|
|
|
* Memory arena's are commonly used when the program
|
|
|
|
|
* needs to quickly allocate lots of little bits of data,
|
|
|
|
|
* which are all freed at the same moment.
|
|
|
|
|
*
|
|
|
|
|
* \note Memory can't be freed during the arenas lifetime.
|
2011-02-27 20:37:56 +00:00
|
|
|
*/
|
|
|
|
|
|
2013-12-02 17:46:19 +11:00
|
|
|
#include <stdlib.h>
|
2013-08-20 16:56:46 +00:00
|
|
|
#include <string.h>
|
|
|
|
|
|
2002-10-12 11:37:38 +00:00
|
|
|
#include "MEM_guardedalloc.h"
|
|
|
|
|
|
2013-12-02 17:46:19 +11:00
|
|
|
#include "BLI_utildefines.h"
|
2002-10-12 11:37:38 +00:00
|
|
|
#include "BLI_memarena.h"
|
2013-09-01 00:46:04 +00:00
|
|
|
#include "BLI_strict_flags.h"
|
2013-06-22 20:20:06 +00:00
|
|
|
|
2013-10-05 04:38:08 +00:00
|
|
|
#ifdef WITH_MEM_VALGRIND
|
|
|
|
|
# include "valgrind/memcheck.h"
|
2019-03-02 11:22:29 +11:00
|
|
|
#else
|
|
|
|
|
# define VALGRIND_CREATE_MEMPOOL(pool, rzB, is_zeroed) UNUSED_VARS(pool, rzB, is_zeroed)
|
|
|
|
|
# define VALGRIND_DESTROY_MEMPOOL(pool) UNUSED_VARS(pool)
|
|
|
|
|
# define VALGRIND_MEMPOOL_ALLOC(pool, addr, size) UNUSED_VARS(pool, addr, size)
|
2013-10-05 04:38:08 +00:00
|
|
|
#endif
|
|
|
|
|
|
2019-03-02 11:41:55 +11:00
|
|
|
/* Clang defines this. */
|
|
|
|
|
#ifndef __has_feature
|
|
|
|
|
# define __has_feature(x) 0
|
|
|
|
|
#endif
|
|
|
|
|
#if defined(__SANITIZE_ADDRESS__) || __has_feature(address_sanitizer)
|
|
|
|
|
# include "sanitizer/asan_interface.h"
|
|
|
|
|
#else
|
2019-03-02 11:57:39 +11:00
|
|
|
# define ASAN_POISON_MEMORY_REGION(addr, size) UNUSED_VARS(addr, size)
|
|
|
|
|
# define ASAN_UNPOISON_MEMORY_REGION(addr, size) UNUSED_VARS(addr, size)
|
2019-03-02 11:41:55 +11:00
|
|
|
#endif
|
|
|
|
|
|
2019-02-12 16:21:27 +11:00
|
|
|
struct MemBuf {
|
|
|
|
|
struct MemBuf *next;
|
|
|
|
|
uchar data[0];
|
|
|
|
|
};
|
|
|
|
|
|
2002-10-12 11:37:38 +00:00
|
|
|
struct MemArena {
|
|
|
|
|
unsigned char *curbuf;
|
2010-04-15 10:28:32 +00:00
|
|
|
const char *name;
|
2019-02-12 16:21:27 +11:00
|
|
|
struct MemBuf *bufs;
|
2012-03-11 23:47:41 +00:00
|
|
|
|
2013-12-02 17:46:19 +11:00
|
|
|
size_t bufsize, cursize;
|
|
|
|
|
size_t align;
|
2012-03-11 23:47:41 +00:00
|
|
|
|
2013-12-02 17:46:19 +11:00
|
|
|
bool use_calloc;
|
2002-10-12 11:37:38 +00:00
|
|
|
};
|
|
|
|
|
|
2019-02-12 16:21:27 +11:00
|
|
|
static void memarena_buf_free_all(struct MemBuf *mb)
|
|
|
|
|
{
|
|
|
|
|
while (mb != NULL) {
|
|
|
|
|
struct MemBuf *mb_next = mb->next;
|
|
|
|
|
MEM_freeN(mb);
|
|
|
|
|
mb = mb_next;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-02 17:46:19 +11:00
|
|
|
MemArena *BLI_memarena_new(const size_t bufsize, const char *name)
|
2011-12-17 00:52:36 +00:00
|
|
|
{
|
2012-03-11 23:47:41 +00:00
|
|
|
MemArena *ma = MEM_callocN(sizeof(*ma), "memarena");
|
|
|
|
|
ma->bufsize = bufsize;
|
2009-08-07 13:49:15 +00:00
|
|
|
ma->align = 8;
|
2012-03-11 23:47:41 +00:00
|
|
|
ma->name = name;
|
|
|
|
|
|
2013-10-05 04:38:08 +00:00
|
|
|
VALGRIND_CREATE_MEMPOOL(ma, 0, false);
|
|
|
|
|
|
2002-10-12 11:37:38 +00:00
|
|
|
return ma;
|
|
|
|
|
}
|
2006-10-24 15:17:14 +00:00
|
|
|
|
2011-12-17 00:52:36 +00:00
|
|
|
void BLI_memarena_use_calloc(MemArena *ma)
|
|
|
|
|
{
|
2012-03-11 23:47:41 +00:00
|
|
|
ma->use_calloc = 1;
|
2006-10-24 15:17:14 +00:00
|
|
|
}
|
|
|
|
|
|
2011-12-17 00:52:36 +00:00
|
|
|
void BLI_memarena_use_malloc(MemArena *ma)
|
|
|
|
|
{
|
2012-03-11 23:47:41 +00:00
|
|
|
ma->use_calloc = 0;
|
2008-12-14 17:32:24 +00:00
|
|
|
}
|
|
|
|
|
|
2013-12-02 17:46:19 +11:00
|
|
|
void BLI_memarena_use_align(struct MemArena *ma, const size_t align)
|
2011-12-17 00:52:36 +00:00
|
|
|
{
|
2019-03-02 11:57:39 +11:00
|
|
|
/* Align must be a power of two. */
|
|
|
|
|
BLI_assert((align & (align - 1)) == 0);
|
|
|
|
|
|
2009-08-07 13:49:15 +00:00
|
|
|
ma->align = align;
|
|
|
|
|
}
|
|
|
|
|
|
2011-12-17 00:52:36 +00:00
|
|
|
void BLI_memarena_free(MemArena *ma)
|
|
|
|
|
{
|
2019-02-12 16:21:27 +11:00
|
|
|
memarena_buf_free_all(ma->bufs);
|
2019-03-02 11:22:29 +11:00
|
|
|
|
2013-10-05 04:59:43 +00:00
|
|
|
VALGRIND_DESTROY_MEMPOOL(ma);
|
|
|
|
|
|
2002-10-12 11:37:38 +00:00
|
|
|
MEM_freeN(ma);
|
|
|
|
|
}
|
|
|
|
|
|
2019-03-02 11:57:39 +11:00
|
|
|
/** Pad num up by \a amt (must be power of two). */
|
2013-06-22 20:20:06 +00:00
|
|
|
#define PADUP(num, amt) (((num) + ((amt) - 1)) & ~((amt) - 1))
|
2002-10-12 11:37:38 +00:00
|
|
|
|
2019-03-02 11:57:39 +11:00
|
|
|
/** Align alloc'ed memory (needed if `align > 8`). */
|
2013-08-20 16:56:46 +00:00
|
|
|
static void memarena_curbuf_align(MemArena *ma)
|
|
|
|
|
{
|
|
|
|
|
unsigned char *tmp;
|
|
|
|
|
|
2013-12-02 17:46:19 +11:00
|
|
|
tmp = (unsigned char *)PADUP((intptr_t)ma->curbuf, (int)ma->align);
|
|
|
|
|
ma->cursize -= (size_t)(tmp - ma->curbuf);
|
2013-08-20 16:56:46 +00:00
|
|
|
ma->curbuf = tmp;
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-02 17:46:19 +11:00
|
|
|
void *BLI_memarena_alloc(MemArena *ma, size_t size)
|
2011-12-17 00:52:36 +00:00
|
|
|
{
|
2002-10-12 11:37:38 +00:00
|
|
|
void *ptr;
|
|
|
|
|
|
2019-03-02 11:57:39 +11:00
|
|
|
/* Ensure proper alignment by rounding size up to multiple of 8. */
|
2012-03-11 23:47:41 +00:00
|
|
|
size = PADUP(size, ma->align);
|
|
|
|
|
|
2013-12-10 21:17:52 +11:00
|
|
|
if (UNLIKELY(size > ma->cursize)) {
|
2012-03-11 23:47:41 +00:00
|
|
|
if (size > ma->bufsize - (ma->align - 1)) {
|
2012-05-12 15:02:10 +00:00
|
|
|
ma->cursize = PADUP(size + 1, ma->align);
|
2009-08-07 13:49:15 +00:00
|
|
|
}
|
2013-12-02 17:46:19 +11:00
|
|
|
else {
|
2012-03-11 23:47:41 +00:00
|
|
|
ma->cursize = ma->bufsize;
|
2013-12-02 17:46:19 +11:00
|
|
|
}
|
2009-08-07 13:49:15 +00:00
|
|
|
|
2019-02-12 16:21:27 +11:00
|
|
|
struct MemBuf *mb = (ma->use_calloc ? MEM_callocN : MEM_mallocN)(sizeof(*mb) + ma->cursize, ma->name);
|
|
|
|
|
ma->curbuf = mb->data;
|
|
|
|
|
mb->next = ma->bufs;
|
|
|
|
|
ma->bufs = mb;
|
|
|
|
|
|
2019-03-02 11:41:55 +11:00
|
|
|
ASAN_POISON_MEMORY_REGION(ma->curbuf, ma->cursize);
|
|
|
|
|
|
2013-08-20 16:56:46 +00:00
|
|
|
memarena_curbuf_align(ma);
|
2002-10-12 11:37:38 +00:00
|
|
|
}
|
2012-03-11 23:47:41 +00:00
|
|
|
|
|
|
|
|
ptr = ma->curbuf;
|
|
|
|
|
ma->curbuf += size;
|
|
|
|
|
ma->cursize -= size;
|
|
|
|
|
|
2013-10-05 04:38:08 +00:00
|
|
|
VALGRIND_MEMPOOL_ALLOC(ma, ptr, size);
|
|
|
|
|
|
2019-03-02 11:41:55 +11:00
|
|
|
ASAN_UNPOISON_MEMORY_REGION(ptr, size);
|
|
|
|
|
|
2002-10-12 11:37:38 +00:00
|
|
|
return ptr;
|
|
|
|
|
}
|
2013-08-20 16:56:46 +00:00
|
|
|
|
2013-12-02 17:46:19 +11:00
|
|
|
void *BLI_memarena_calloc(MemArena *ma, size_t size)
|
|
|
|
|
{
|
|
|
|
|
void *ptr;
|
|
|
|
|
|
2019-03-02 11:57:39 +11:00
|
|
|
/* No need to use this function call if we're calloc'ing by default. */
|
2013-12-02 17:46:19 +11:00
|
|
|
BLI_assert(ma->use_calloc == false);
|
|
|
|
|
|
|
|
|
|
ptr = BLI_memarena_alloc(ma, size);
|
|
|
|
|
memset(ptr, 0, size);
|
|
|
|
|
|
|
|
|
|
return ptr;
|
|
|
|
|
}
|
|
|
|
|
|
2013-08-20 16:56:46 +00:00
|
|
|
/**
|
|
|
|
|
* Clear for reuse, avoids re-allocation when an arena may
|
|
|
|
|
* otherwise be free'd and recreated.
|
|
|
|
|
*/
|
|
|
|
|
void BLI_memarena_clear(MemArena *ma)
|
|
|
|
|
{
|
|
|
|
|
if (ma->bufs) {
|
|
|
|
|
unsigned char *curbuf_prev;
|
2013-12-02 17:46:19 +11:00
|
|
|
size_t curbuf_used;
|
2013-08-20 16:56:46 +00:00
|
|
|
|
|
|
|
|
if (ma->bufs->next) {
|
2019-02-12 16:21:27 +11:00
|
|
|
memarena_buf_free_all(ma->bufs->next);
|
2013-08-20 16:56:46 +00:00
|
|
|
ma->bufs->next = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
curbuf_prev = ma->curbuf;
|
2019-02-12 16:21:27 +11:00
|
|
|
ma->curbuf = ma->bufs->data;
|
2013-08-20 16:56:46 +00:00
|
|
|
memarena_curbuf_align(ma);
|
|
|
|
|
|
|
|
|
|
/* restore to original size */
|
2013-12-02 17:46:19 +11:00
|
|
|
curbuf_used = (size_t)(curbuf_prev - ma->curbuf);
|
2013-08-20 16:56:46 +00:00
|
|
|
ma->cursize += curbuf_used;
|
|
|
|
|
|
|
|
|
|
if (ma->use_calloc) {
|
2013-12-02 17:46:19 +11:00
|
|
|
memset(ma->curbuf, 0, curbuf_used);
|
2013-08-20 16:56:46 +00:00
|
|
|
}
|
2019-03-02 11:41:55 +11:00
|
|
|
ASAN_POISON_MEMORY_REGION(ma->curbuf, ma->cursize);
|
2013-08-20 16:56:46 +00:00
|
|
|
}
|
2013-10-05 04:38:08 +00:00
|
|
|
|
|
|
|
|
VALGRIND_DESTROY_MEMPOOL(ma);
|
|
|
|
|
VALGRIND_CREATE_MEMPOOL(ma, 0, false);
|
2013-08-20 16:56:46 +00:00
|
|
|
}
|