2010-08-26 07:15:40 +00:00
|
|
|
/*
|
|
|
|
* $Id$
|
|
|
|
*
|
2019-06-06 05:28:23 +00:00
|
|
|
Copyright (c) 2006-2019 Chung, Hyung-Hwan. All rights reserved.
|
2010-08-26 07:15:40 +00:00
|
|
|
|
2014-11-19 14:42:24 +00:00
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
|
|
modification, are permitted provided that the following conditions
|
|
|
|
are met:
|
|
|
|
1. Redistributions of source code must retain the above copyright
|
|
|
|
notice, this list of conditions and the following disclaimer.
|
|
|
|
2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
notice, this list of conditions and the following disclaimer in the
|
|
|
|
documentation and/or other materials provided with the distribution.
|
2010-08-26 07:15:40 +00:00
|
|
|
|
2014-11-19 14:42:24 +00:00
|
|
|
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR
|
|
|
|
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
|
|
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
|
|
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
|
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
|
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
|
|
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
2010-08-26 07:15:40 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <qse/cmn/fma.h>
|
2016-04-29 03:55:42 +00:00
|
|
|
#include "mem-prv.h"
|
2010-08-26 07:15:40 +00:00
|
|
|
|
|
|
|
qse_fma_t* qse_fma_open (
|
|
|
|
qse_mmgr_t* mmgr, qse_size_t xtnsize,
|
|
|
|
qse_size_t blksize, qse_size_t maxblks, qse_size_t maxcnks)
|
|
|
|
{
|
|
|
|
qse_fma_t* fma;
|
|
|
|
|
|
|
|
fma = (qse_fma_t*) QSE_MMGR_ALLOC (mmgr, QSE_SIZEOF(*fma) + xtnsize);
|
|
|
|
if (fma == QSE_NULL) return QSE_NULL;
|
|
|
|
|
2011-09-01 09:43:46 +00:00
|
|
|
if (qse_fma_init (fma, mmgr, blksize, maxblks, maxcnks) <= -1)
|
2010-08-26 07:15:40 +00:00
|
|
|
{
|
|
|
|
QSE_MMGR_FREE (mmgr, fma);
|
|
|
|
return QSE_NULL;
|
|
|
|
}
|
|
|
|
|
2012-09-30 13:56:20 +00:00
|
|
|
QSE_MEMSET (fma + 1, 0, xtnsize);
|
2010-08-26 07:15:40 +00:00
|
|
|
return fma;
|
|
|
|
}
|
|
|
|
|
|
|
|
void qse_fma_close (qse_fma_t* fma)
|
|
|
|
{
|
|
|
|
qse_fma_fini (fma);
|
|
|
|
QSE_MMGR_FREE (fma->mmgr, fma);
|
|
|
|
}
|
|
|
|
|
2011-09-01 09:43:46 +00:00
|
|
|
int qse_fma_init (
|
2010-08-26 07:15:40 +00:00
|
|
|
qse_fma_t* fma, qse_mmgr_t* mmgr,
|
|
|
|
qse_size_t blksize, qse_size_t maxblks, qse_size_t maxcnks)
|
|
|
|
{
|
|
|
|
QSE_MEMSET (fma, 0, QSE_SIZEOF(*fma));
|
|
|
|
fma->mmgr = mmgr;
|
|
|
|
|
2010-08-27 00:26:28 +00:00
|
|
|
if (blksize < QSE_SIZEOF(qse_fma_blk_t))
|
2010-08-26 07:15:40 +00:00
|
|
|
blksize = QSE_SIZEOF(qse_fma_blk_t);
|
|
|
|
if (maxblks <= 0) maxblks = 1;
|
|
|
|
|
|
|
|
fma->blksize = blksize;
|
|
|
|
fma->maxblks = maxblks;
|
|
|
|
fma->maxcnks = maxcnks;
|
|
|
|
|
2011-09-01 09:43:46 +00:00
|
|
|
return 0;
|
2010-08-26 07:15:40 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void qse_fma_fini (qse_fma_t* fma)
|
|
|
|
{
|
2010-08-27 00:26:28 +00:00
|
|
|
/* destroys the chunks allocated */
|
2010-08-26 07:15:40 +00:00
|
|
|
while (fma->cnkhead)
|
|
|
|
{
|
|
|
|
qse_fma_cnk_t* next = fma->cnkhead->next;
|
|
|
|
QSE_MMGR_FREE (fma->mmgr, fma->cnkhead);
|
|
|
|
fma->cnkhead = next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-12-01 13:13:13 +00:00
|
|
|
qse_mmgr_t* qse_fma_getmmgr (qse_fma_t* fma)
|
|
|
|
{
|
|
|
|
return fma->mmgr;
|
|
|
|
}
|
|
|
|
|
|
|
|
void* qse_fma_getxtn (qse_fma_t* fma)
|
|
|
|
{
|
|
|
|
return QSE_XTN (fma);
|
|
|
|
}
|
|
|
|
|
2010-08-26 07:15:40 +00:00
|
|
|
static QSE_INLINE qse_fma_cnk_t* add_chunk (qse_fma_t* fma)
|
|
|
|
{
|
|
|
|
qse_fma_cnk_t* cnk;
|
|
|
|
qse_fma_blk_t* blk;
|
|
|
|
qse_size_t i;
|
|
|
|
|
|
|
|
/* check if there are too many chunks */
|
2010-08-27 00:26:28 +00:00
|
|
|
if (fma->maxcnks && fma->numcnks >= fma->maxcnks) return QSE_NULL;
|
2010-08-26 07:15:40 +00:00
|
|
|
|
|
|
|
/* allocate a chunk */
|
|
|
|
cnk = (qse_fma_cnk_t*) QSE_MMGR_ALLOC (fma->mmgr,
|
|
|
|
QSE_SIZEOF(*cnk) + fma->blksize * fma->maxblks);
|
|
|
|
if (cnk == QSE_NULL) return QSE_NULL;
|
|
|
|
|
|
|
|
/* weave the blocks in the chunk to the free block list */
|
|
|
|
fma->freeblk = (qse_fma_blk_t*)(cnk + 1);
|
|
|
|
blk = fma->freeblk;
|
|
|
|
for (i = 1; i < fma->maxblks; i++)
|
|
|
|
{
|
|
|
|
blk->next = (qse_fma_blk_t*)((qse_byte_t*)blk + fma->blksize);
|
|
|
|
blk = blk->next;
|
|
|
|
}
|
|
|
|
blk->next = QSE_NULL;
|
|
|
|
|
|
|
|
/* weave the chunk to the chunk list */
|
|
|
|
cnk->next = fma->cnkhead;
|
|
|
|
fma->cnkhead = cnk;
|
|
|
|
fma->numcnks++;
|
|
|
|
|
|
|
|
return cnk;
|
|
|
|
}
|
|
|
|
|
2010-08-27 00:26:28 +00:00
|
|
|
void* qse_fma_alloc (qse_fma_t* fma, qse_size_t size)
|
2010-08-26 07:15:40 +00:00
|
|
|
{
|
|
|
|
void* blk;
|
|
|
|
|
2010-08-27 00:26:28 +00:00
|
|
|
QSE_ASSERTX (size <= fma->blksize,
|
|
|
|
"You must not request a block larger than the fixed size set in the allocator. Use a generic allocator instead"
|
|
|
|
);
|
|
|
|
|
|
|
|
if (size > fma->blksize) return QSE_NULL;
|
|
|
|
|
2010-08-26 07:15:40 +00:00
|
|
|
if ((blk = fma->freeblk) == QSE_NULL)
|
|
|
|
{
|
2015-03-11 06:12:48 +00:00
|
|
|
if (add_chunk(fma) == QSE_NULL) return QSE_NULL;
|
2010-08-26 07:15:40 +00:00
|
|
|
blk = fma->freeblk;
|
|
|
|
}
|
2015-03-11 06:12:48 +00:00
|
|
|
|
2010-08-26 07:15:40 +00:00
|
|
|
fma->freeblk = fma->freeblk->next;
|
|
|
|
return blk;
|
|
|
|
}
|
|
|
|
|
2011-08-22 23:26:26 +00:00
|
|
|
void* qse_fma_calloc (qse_fma_t* fma, qse_size_t size)
|
|
|
|
{
|
|
|
|
void* ptr = qse_fma_alloc (fma, size);
|
2012-12-01 13:13:13 +00:00
|
|
|
if (ptr) QSE_MEMSET (ptr, 0, size);
|
2011-08-22 23:26:26 +00:00
|
|
|
return ptr;
|
|
|
|
}
|
|
|
|
|
2010-08-27 00:26:28 +00:00
|
|
|
void* qse_fma_realloc (qse_fma_t* fma, void* blk, qse_size_t size)
|
|
|
|
{
|
|
|
|
if (blk)
|
|
|
|
{
|
|
|
|
QSE_ASSERTX (size <= fma->blksize,
|
|
|
|
"A block can be enlarged with a fixed-size block allocator. Use a generic allocator instead"
|
|
|
|
);
|
|
|
|
|
|
|
|
if (size > fma->blksize) return QSE_NULL;
|
|
|
|
return blk;
|
|
|
|
}
|
|
|
|
|
|
|
|
return qse_fma_alloc (fma, size);
|
|
|
|
}
|
|
|
|
|
2010-08-26 07:15:40 +00:00
|
|
|
void qse_fma_free (qse_fma_t* fma, void* blk)
|
|
|
|
{
|
|
|
|
((qse_fma_blk_t*)blk)->next = fma->freeblk;
|
|
|
|
fma->freeblk = blk;
|
|
|
|
}
|