116 lines
3 KiB
C
116 lines
3 KiB
C
|
/*
|
||
|
|
* This file is a part of Pcompress, a chunked parallel multi-
|
||
|
|
* algorithm lossless compression and decompression program.
|
||
|
|
*
|
||
|
|
* Copyright (C) 2012-2013 Moinak Ghosh. All rights reserved.
|
||
|
|
* Use is subject to license terms.
|
||
|
|
*
|
||
|
|
* This program is free software; you can redistribute it and/or
|
||
|
|
* modify it under the terms of the GNU Lesser General Public
|
||
|
|
* License as published by the Free Software Foundation; either
|
||
|
|
* version 3 of the License, or (at your option) any later version.
|
||
|
|
*
|
||
|
|
* 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
|
||
|
|
* Lesser General Public License for more details.
|
||
|
|
*
|
||
|
|
* You should have received a copy of the GNU Lesser General Public
|
||
|
|
* License along with this program.
|
||
|
|
* If not, see <http://www.gnu.org/licenses/>.
|
||
|
|
*
|
||
|
|
* moinakg@belenix.org, http://moinakg.wordpress.com/
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
|
||
|
|
/*
|
||
|
|
--------------------------------------------------------------------
|
||
|
|
By Bob Jenkins, September 1996. recycle.c
|
||
|
|
You may use this code in any way you wish, and it is free. No warranty.
|
||
|
|
|
||
|
|
This manages memory for commonly-allocated structures.
|
||
|
|
It allocates RESTART to REMAX items at a time.
|
||
|
|
Timings have shown that, if malloc is used for every new structure,
|
||
|
|
malloc will consume about 90% of the time in a program. This
|
||
|
|
module cuts down the number of mallocs by an order of magnitude.
|
||
|
|
This also decreases memory fragmentation, and freeing structures
|
||
|
|
only requires freeing the root.
|
||
|
|
--------------------------------------------------------------------
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <string.h>
|
||
|
|
|
||
|
|
#ifndef STANDARD
|
||
|
|
# include "standard.h"
|
||
|
|
#endif
|
||
|
|
#ifndef RECYCLE
|
||
|
|
# include "recycle.h"
|
||
|
|
#endif
|
||
|
|
|
||
|
|
reroot *
|
||
|
|
remkroot(size_t size)
|
||
|
|
{
|
||
|
|
reroot *r = (reroot *)remalloc(sizeof(reroot), "recycle.c, root");
|
||
|
|
r->list = (recycle *)0;
|
||
|
|
r->trash = (recycle *)0;
|
||
|
|
r->size = align(size);
|
||
|
|
r->logsize = RESTART;
|
||
|
|
r->numleft = 0;
|
||
|
|
return r;
|
||
|
|
}
|
||
|
|
|
||
|
|
void
|
||
|
|
refree(struct reroot *r)
|
||
|
|
{
|
||
|
|
recycle *temp;
|
||
|
|
if ((temp = r->list) != NULL)
|
||
|
|
while (r->list)
|
||
|
|
{
|
||
|
|
temp = r->list->next;
|
||
|
|
free((char *)r->list);
|
||
|
|
r->list = temp;
|
||
|
|
}
|
||
|
|
free((char *)r);
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* to be called from the macro renew only */
|
||
|
|
char *
|
||
|
|
renewx(struct reroot *r)
|
||
|
|
{
|
||
|
|
recycle *temp;
|
||
|
|
if (r->trash)
|
||
|
|
{ /* pull a node off the trash heap */
|
||
|
|
temp = r->trash;
|
||
|
|
r->trash = temp->next;
|
||
|
|
(void)memset((void *)temp, 0, r->size);
|
||
|
|
}
|
||
|
|
else
|
||
|
|
{ /* allocate a new block of nodes */
|
||
|
|
r->numleft = r->size*((ub4)1<<r->logsize);
|
||
|
|
if (r->numleft < REMAX) ++r->logsize;
|
||
|
|
temp = (recycle *)remalloc(sizeof(recycle) + r->numleft,
|
||
|
|
"recycle.c, data");
|
||
|
|
temp->next = r->list;
|
||
|
|
r->list = temp;
|
||
|
|
r->numleft-=r->size;
|
||
|
|
temp = (recycle *)((char *)(r->list+1)+r->numleft);
|
||
|
|
}
|
||
|
|
return (char *)temp;
|
||
|
|
}
|
||
|
|
|
||
|
|
char *
|
||
|
|
remalloc(size_t len, char *purpose)
|
||
|
|
{
|
||
|
|
char *x = (char *)malloc(len);
|
||
|
|
if (!x)
|
||
|
|
{
|
||
|
|
fprintf(stderr, "malloc of %zu failed for %s\n",
|
||
|
|
len, purpose);
|
||
|
|
exit(SUCCESS);
|
||
|
|
}
|
||
|
|
return x;
|
||
|
|
}
|
||
|
|
|