This repository has been archived on 2023-10-09. You can view files and clone it, but cannot push or open issues or pull requests.
Files
blender-archive/source/blender/blenlib/intern/BLI_memarena.c

121 lines
2.7 KiB
C
Raw Normal View History

/*
* ***** BEGIN GPL LICENSE BLOCK *****
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
* 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.
*
* The Original Code is: all of this file.
*
* Contributor(s): none yet.
*
* ***** END GPL LICENSE BLOCK *****
2002-10-12 11:37:38 +00:00
* Efficient memory allocation for lots of similar small chunks.
*/
2011-02-27 20:37:56 +00:00
/** \file blender/blenlib/intern/BLI_memarena.c
* \ingroup bli
*/
2002-10-12 11:37:38 +00:00
#include "MEM_guardedalloc.h"
#include "BLI_memarena.h"
#include "BLI_linklist.h"
struct MemArena {
unsigned char *curbuf;
int bufsize, cursize;
const char *name;
2012-03-11 23:47:41 +00:00
int use_calloc;
int align;
2012-03-11 23:47:41 +00:00
2002-10-12 11:37:38 +00:00
LinkNode *bufs;
};
MemArena *BLI_memarena_new(const int bufsize, const char *name)
{
2012-03-11 23:47:41 +00:00
MemArena *ma = MEM_callocN(sizeof(*ma), "memarena");
ma->bufsize = bufsize;
ma->align = 8;
2012-03-11 23:47:41 +00:00
ma->name = name;
2002-10-12 11:37:38 +00:00
return ma;
}
void BLI_memarena_use_calloc(MemArena *ma)
{
2012-03-11 23:47:41 +00:00
ma->use_calloc = 1;
}
void BLI_memarena_use_malloc(MemArena *ma)
{
2012-03-11 23:47:41 +00:00
ma->use_calloc = 0;
}
void BLI_memarena_use_align(struct MemArena *ma, const int align)
{
/* align should be a power of two */
ma->align = align;
}
void BLI_memarena_free(MemArena *ma)
{
BLI_linklist_freeN(ma->bufs);
2002-10-12 11:37:38 +00:00
MEM_freeN(ma);
}
2012-03-11 23:47:41 +00:00
/* amt must be power of two */
#define PADUP(num, amt) ((num + (amt - 1)) & ~(amt - 1))
2002-10-12 11:37:38 +00:00
void *BLI_memarena_alloc(MemArena *ma, int size)
{
2002-10-12 11:37:38 +00:00
void *ptr;
2012-03-11 23:47:41 +00:00
/* ensure proper alignment by rounding
* size up to multiple of 8 */
size = PADUP(size, ma->align);
if (size > ma->cursize) {
unsigned char *tmp;
2012-03-11 23:47:41 +00:00
if (size > ma->bufsize - (ma->align - 1)) {
ma->cursize = PADUP(size + 1, ma->align);
}
2012-03-11 23:47:41 +00:00
else
ma->cursize = ma->bufsize;
2012-03-11 23:47:41 +00:00
if (ma->use_calloc)
ma->curbuf = MEM_callocN(ma->cursize, ma->name);
else
2012-03-11 23:47:41 +00:00
ma->curbuf = MEM_mallocN(ma->cursize, ma->name);
2002-10-12 11:37:38 +00:00
BLI_linklist_prepend(&ma->bufs, ma->curbuf);
/* align alloc'ed memory (needed if align > 8) */
tmp = (unsigned char *)PADUP( (intptr_t) ma->curbuf, ma->align);
ma->cursize -= (tmp - ma->curbuf);
2012-03-11 23:47:41 +00:00
ma->curbuf = tmp;
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;
2002-10-12 11:37:38 +00:00
return ptr;
}