2011-02-23 10:52:22 +00:00
|
|
|
/*
|
2008-01-07 19:13:47 +00:00
|
|
|
* ***** 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
|
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.
|
|
|
|
|
*
|
|
|
|
|
* The Original Code is: all of this file.
|
|
|
|
|
*
|
|
|
|
|
* Contributor(s): none yet.
|
|
|
|
|
*
|
2008-01-07 19:13:47 +00:00
|
|
|
* ***** 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
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
2005-03-21 00:48:19 +00:00
|
|
|
|
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;
|
2010-04-15 10:28:32 +00:00
|
|
|
const char *name;
|
2002-10-12 11:37:38 +00:00
|
|
|
|
2006-10-24 15:17:14 +00:00
|
|
|
int use_calloc;
|
2009-08-07 13:49:15 +00:00
|
|
|
int align;
|
2006-10-24 15:17:14 +00:00
|
|
|
|
2002-10-12 11:37:38 +00:00
|
|
|
LinkNode *bufs;
|
|
|
|
|
};
|
|
|
|
|
|
2011-12-17 00:52:36 +00:00
|
|
|
MemArena *BLI_memarena_new(int bufsize, const char *name)
|
|
|
|
|
{
|
2002-10-12 11:37:38 +00:00
|
|
|
MemArena *ma= MEM_callocN(sizeof(*ma), "memarena");
|
|
|
|
|
ma->bufsize= bufsize;
|
2009-08-07 13:49:15 +00:00
|
|
|
ma->align = 8;
|
2010-04-15 10:28:32 +00:00
|
|
|
ma->name= name;
|
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)
|
|
|
|
|
{
|
2006-10-24 15:17:14 +00:00
|
|
|
ma->use_calloc= 1;
|
|
|
|
|
}
|
|
|
|
|
|
2011-12-17 00:52:36 +00:00
|
|
|
void BLI_memarena_use_malloc(MemArena *ma)
|
|
|
|
|
{
|
2008-12-14 17:32:24 +00:00
|
|
|
ma->use_calloc= 0;
|
|
|
|
|
}
|
|
|
|
|
|
2011-12-17 00:52:36 +00:00
|
|
|
void BLI_memarena_use_align(struct MemArena *ma, int align)
|
|
|
|
|
{
|
2009-08-07 13:49:15 +00:00
|
|
|
/* align should be a power of two */
|
|
|
|
|
ma->align = align;
|
|
|
|
|
}
|
|
|
|
|
|
2011-12-17 00:52:36 +00:00
|
|
|
void BLI_memarena_free(MemArena *ma)
|
|
|
|
|
{
|
2006-10-24 15:17:14 +00:00
|
|
|
BLI_linklist_free(ma->bufs, (void(*)(void*)) MEM_freeN);
|
2002-10-12 11:37:38 +00:00
|
|
|
MEM_freeN(ma);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* amt must be power of two */
|
|
|
|
|
#define PADUP(num, amt) ((num+(amt-1))&~(amt-1))
|
|
|
|
|
|
2011-12-17 00:52:36 +00:00
|
|
|
void *BLI_memarena_alloc(MemArena *ma, int size)
|
|
|
|
|
{
|
2002-10-12 11:37:38 +00:00
|
|
|
void *ptr;
|
|
|
|
|
|
|
|
|
|
/* ensure proper alignment by rounding
|
|
|
|
|
* size up to multiple of 8 */
|
2009-08-07 13:49:15 +00:00
|
|
|
size= PADUP(size, ma->align);
|
2002-10-12 11:37:38 +00:00
|
|
|
|
2005-03-21 00:48:19 +00:00
|
|
|
if (size>ma->cursize) {
|
2009-08-07 13:49:15 +00:00
|
|
|
unsigned char *tmp;
|
|
|
|
|
|
2012-03-06 18:40:15 +00:00
|
|
|
if(size > ma->bufsize - (ma->align - 1)) {
|
2009-08-07 13:49:15 +00:00
|
|
|
ma->cursize = PADUP(size+1, ma->align);
|
|
|
|
|
}
|
|
|
|
|
else ma->cursize = ma->bufsize;
|
|
|
|
|
|
2006-10-24 15:17:14 +00:00
|
|
|
if(ma->use_calloc)
|
2010-04-15 10:28:32 +00:00
|
|
|
ma->curbuf= MEM_callocN(ma->cursize, ma->name);
|
2006-10-24 15:17:14 +00:00
|
|
|
else
|
2010-04-15 10:28:32 +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);
|
2009-08-07 13:49:15 +00:00
|
|
|
|
|
|
|
|
/* align alloc'ed memory (needed if align > 8) */
|
|
|
|
|
tmp = (unsigned char*)PADUP( (intptr_t) ma->curbuf, ma->align);
|
|
|
|
|
ma->cursize -= (tmp - ma->curbuf);
|
|
|
|
|
ma->curbuf = tmp;
|
2002-10-12 11:37:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
ptr= ma->curbuf;
|
|
|
|
|
ma->curbuf+= size;
|
|
|
|
|
ma->cursize-= size;
|
|
|
|
|
|
|
|
|
|
return ptr;
|
|
|
|
|
}
|
2009-07-14 23:08:55 +00:00
|
|
|
|