NetBSD/bin/ksh/alloc.c

126 lines
2.8 KiB
C
Raw Normal View History

/* $NetBSD: alloc.c,v 1.9 2006/04/01 23:36:28 christos Exp $ */
1997-01-12 22:11:37 +03:00
1996-09-22 03:35:13 +04:00
/*
* Copyright (c) 2002 Marc Espie.
*
* 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.
*
* THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT AND CONTRIBUTORS
* ``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 OPENBSD
* PROJECT OR CONTRIBUTORS 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.
1999-10-20 19:09:58 +04:00
*/
1996-09-22 03:35:13 +04:00
/*
* area-based allocation built on malloc/free
1996-09-22 03:35:13 +04:00
*/
#include "sh.h"
1996-09-22 03:35:13 +04:00
struct link {
struct link *prev;
struct link *next;
1996-09-22 03:35:13 +04:00
};
Area *
ainit(Area *ap)
1996-09-22 03:35:13 +04:00
{
ap->freelist = NULL;
1996-09-22 03:35:13 +04:00
return ap;
}
void
afreeall(Area *ap)
1996-09-22 03:35:13 +04:00
{
struct link *l, *l2;
1996-09-22 03:35:13 +04:00
for (l = ap->freelist; l != NULL; l = l2) {
l2 = l->next;
free(l);
1996-09-22 03:35:13 +04:00
}
ap->freelist = NULL;
1996-09-22 03:35:13 +04:00
}
#define L2P(l) ( (void *)(((char *)(l)) + sizeof(struct link)) )
#define P2L(p) ( (struct link *)(((char *)(p)) - sizeof(struct link)) )
1996-09-22 03:35:13 +04:00
2006-03-22 02:40:49 +03:00
/* coverity[+alloc] */
1996-09-22 03:35:13 +04:00
void *
alloc(size_t size, Area *ap)
1996-09-22 03:35:13 +04:00
{
struct link *l;
1999-10-20 19:09:58 +04:00
l = malloc(sizeof(struct link) + size);
if (l == NULL)
internal_errorf(1, "unable to allocate memory");
l->next = ap->freelist;
l->prev = NULL;
if (ap->freelist)
ap->freelist->prev = l;
ap->freelist = l;
1999-10-20 19:09:58 +04:00
return L2P(l);
1996-09-22 03:35:13 +04:00
}
/* coverity[+alloc] */
/* coverity[+free : arg-0] */
void *
aresize(void *ptr, size_t size, Area *ap)
1996-09-22 03:35:13 +04:00
{
struct link *l, *l2, *lprev, *lnext;
1999-10-20 19:09:58 +04:00
if (ptr == NULL)
return alloc(size, ap);
1996-09-22 03:35:13 +04:00
l = P2L(ptr);
lprev = l->prev;
lnext = l->next;
1996-09-22 03:35:13 +04:00
l2 = realloc(l, sizeof(struct link) + size);
if (l2 == NULL)
internal_errorf(1, "unable to allocate memory");
if (lprev)
lprev->next = l2;
else
ap->freelist = l2;
if (lnext)
lnext->prev = l2;
1999-10-20 19:09:58 +04:00
return L2P(l2);
1999-10-20 19:09:58 +04:00
}
2006-03-27 01:36:13 +04:00
/* coverity[+free : arg-0] */
1999-10-20 19:09:58 +04:00
void
afree(void *ptr, Area *ap)
1999-10-20 19:09:58 +04:00
{
struct link *l;
1999-10-20 19:09:58 +04:00
if (!ptr)
1999-10-20 19:09:58 +04:00
return;
l = P2L(ptr);
1996-09-22 03:35:13 +04:00
if (l->prev)
l->prev->next = l->next;
else
ap->freelist = l->next;
if (l->next)
l->next->prev = l->prev;
1996-09-22 03:35:13 +04:00
free(l);
1996-09-22 03:35:13 +04:00
}