1992-11-01 05:44:29 +00:00
|
|
|
/* xmalloc.c -- malloc with out of memory checking
|
2003-06-18 06:14:01 +00:00
|
|
|
|
2004-08-09 18:44:46 +00:00
|
|
|
Copyright (C) 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
|
2005-06-22 11:55:38 +00:00
|
|
|
1999, 2000, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
|
1992-11-01 05:44:29 +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, 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 General Public License for more details.
|
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
1996-07-15 02:41:49 +00:00
|
|
|
along with this program; if not, write to the Free Software Foundation,
|
2005-05-14 07:58:06 +00:00
|
|
|
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
|
1992-11-01 05:44:29 +00:00
|
|
|
|
2005-09-22 06:05:39 +00:00
|
|
|
#ifdef HAVE_CONFIG_H
|
1996-07-15 03:56:06 +00:00
|
|
|
# include <config.h>
|
1995-03-20 15:09:56 +00:00
|
|
|
#endif
|
|
|
|
|
|
2003-09-13 10:23:46 +00:00
|
|
|
#include "xalloc.h"
|
|
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
2003-10-16 07:07:33 +00:00
|
|
|
#include <string.h>
|
1992-11-01 05:44:29 +00:00
|
|
|
|
2003-10-13 15:26:45 +00:00
|
|
|
#ifndef SIZE_MAX
|
|
|
|
|
# define SIZE_MAX ((size_t) -1)
|
|
|
|
|
#endif
|
2002-11-22 10:28:44 +00:00
|
|
|
|
2005-06-22 11:55:38 +00:00
|
|
|
/* 1 if calloc is known to be compatible with GNU calloc. This
|
|
|
|
|
matters if we are not also using the calloc module, which defines
|
|
|
|
|
HAVE_CALLOC and supports the GNU API even on non-GNU platforms. */
|
|
|
|
|
#if defined HAVE_CALLOC || defined __GLIBC__
|
|
|
|
|
enum { HAVE_GNU_CALLOC = 1 };
|
|
|
|
|
#else
|
|
|
|
|
enum { HAVE_GNU_CALLOC = 0 };
|
|
|
|
|
#endif
|
|
|
|
|
|
2003-10-13 15:26:45 +00:00
|
|
|
/* Allocate an array of N objects, each with S bytes of memory,
|
|
|
|
|
dynamically, with error checking. S must be nonzero. */
|
|
|
|
|
|
2003-10-31 13:41:44 +00:00
|
|
|
static inline void *
|
|
|
|
|
xnmalloc_inline (size_t n, size_t s)
|
2003-10-13 15:26:45 +00:00
|
|
|
{
|
|
|
|
|
void *p;
|
2004-06-01 08:51:23 +00:00
|
|
|
if (xalloc_oversized (n, s) || (! (p = malloc (n * s)) && n != 0))
|
2003-10-13 15:26:45 +00:00
|
|
|
xalloc_die ();
|
|
|
|
|
return p;
|
1995-03-20 15:09:56 +00:00
|
|
|
}
|
1992-11-01 05:44:29 +00:00
|
|
|
|
2003-10-31 13:41:44 +00:00
|
|
|
void *
|
|
|
|
|
xnmalloc (size_t n, size_t s)
|
|
|
|
|
{
|
|
|
|
|
return xnmalloc_inline (n, s);
|
|
|
|
|
}
|
|
|
|
|
|
1992-11-01 05:44:29 +00:00
|
|
|
/* Allocate N bytes of memory dynamically, with error checking. */
|
|
|
|
|
|
1997-10-25 21:51:21 +00:00
|
|
|
void *
|
1998-12-07 03:12:10 +00:00
|
|
|
xmalloc (size_t n)
|
1992-11-01 05:44:29 +00:00
|
|
|
{
|
2003-10-31 13:41:44 +00:00
|
|
|
return xnmalloc_inline (n, 1);
|
2003-10-13 15:26:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Change the size of an allocated block of memory P to an array of N
|
|
|
|
|
objects each of S bytes, with error checking. S must be nonzero. */
|
1992-11-01 05:44:29 +00:00
|
|
|
|
2003-10-31 13:41:44 +00:00
|
|
|
static inline void *
|
|
|
|
|
xnrealloc_inline (void *p, size_t n, size_t s)
|
2003-10-13 15:26:45 +00:00
|
|
|
{
|
2004-06-01 08:51:23 +00:00
|
|
|
if (xalloc_oversized (n, s) || (! (p = realloc (p, n * s)) && n != 0))
|
1999-09-26 19:05:39 +00:00
|
|
|
xalloc_die ();
|
1996-10-17 01:58:19 +00:00
|
|
|
return p;
|
|
|
|
|
}
|
|
|
|
|
|
2003-10-31 13:41:44 +00:00
|
|
|
void *
|
|
|
|
|
xnrealloc (void *p, size_t n, size_t s)
|
|
|
|
|
{
|
|
|
|
|
return xnrealloc_inline (p, n, s);
|
|
|
|
|
}
|
|
|
|
|
|
1992-11-01 05:44:29 +00:00
|
|
|
/* Change the size of an allocated block of memory P to N bytes,
|
2000-08-07 17:06:38 +00:00
|
|
|
with error checking. */
|
1992-11-01 05:44:29 +00:00
|
|
|
|
1997-10-25 21:51:21 +00:00
|
|
|
void *
|
1998-12-07 03:12:10 +00:00
|
|
|
xrealloc (void *p, size_t n)
|
1992-11-01 05:44:29 +00:00
|
|
|
{
|
2003-10-31 13:41:44 +00:00
|
|
|
return xnrealloc_inline (p, n, 1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* If P is null, allocate a block of at least *PN such objects;
|
|
|
|
|
otherwise, reallocate P so that it contains more than *PN objects
|
|
|
|
|
each of S bytes. *PN must be nonzero unless P is null, and S must
|
|
|
|
|
be nonzero. Set *PN to the new number of objects, and return the
|
|
|
|
|
pointer to the new block. *PN is never set to zero, and the
|
|
|
|
|
returned pointer is never null.
|
|
|
|
|
|
|
|
|
|
Repeated reallocations are guaranteed to make progress, either by
|
|
|
|
|
allocating an initial block with a nonzero size, or by allocating a
|
|
|
|
|
larger block.
|
|
|
|
|
|
|
|
|
|
In the following implementation, nonzero sizes are doubled so that
|
|
|
|
|
repeated reallocations have O(N log N) overall cost rather than
|
|
|
|
|
O(N**2) cost, but the specification for this function does not
|
|
|
|
|
guarantee that sizes are doubled.
|
|
|
|
|
|
|
|
|
|
Here is an example of use:
|
|
|
|
|
|
|
|
|
|
int *p = NULL;
|
2003-11-22 15:08:19 +00:00
|
|
|
size_t used = 0;
|
|
|
|
|
size_t allocated = 0;
|
2003-10-31 13:41:44 +00:00
|
|
|
|
|
|
|
|
void
|
|
|
|
|
append_int (int value)
|
|
|
|
|
{
|
|
|
|
|
if (used == allocated)
|
|
|
|
|
p = x2nrealloc (p, &allocated, sizeof *p);
|
|
|
|
|
p[used++] = value;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
This causes x2nrealloc to allocate a block of some nonzero size the
|
|
|
|
|
first time it is called.
|
|
|
|
|
|
|
|
|
|
To have finer-grained control over the initial size, set *PN to a
|
|
|
|
|
nonzero value before calling this function with P == NULL. For
|
|
|
|
|
example:
|
|
|
|
|
|
|
|
|
|
int *p = NULL;
|
2003-11-22 15:08:19 +00:00
|
|
|
size_t used = 0;
|
|
|
|
|
size_t allocated = 0;
|
|
|
|
|
size_t allocated1 = 1000;
|
2003-10-31 13:41:44 +00:00
|
|
|
|
|
|
|
|
void
|
|
|
|
|
append_int (int value)
|
|
|
|
|
{
|
|
|
|
|
if (used == allocated)
|
|
|
|
|
{
|
|
|
|
|
p = x2nrealloc (p, &allocated1, sizeof *p);
|
|
|
|
|
allocated = allocated1;
|
|
|
|
|
}
|
|
|
|
|
p[used++] = value;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
static inline void *
|
|
|
|
|
x2nrealloc_inline (void *p, size_t *pn, size_t s)
|
|
|
|
|
{
|
|
|
|
|
size_t n = *pn;
|
|
|
|
|
|
|
|
|
|
if (! p)
|
|
|
|
|
{
|
|
|
|
|
if (! n)
|
|
|
|
|
{
|
|
|
|
|
/* The approximate size to use for initial small allocation
|
|
|
|
|
requests, when the invoking code specifies an old size of
|
|
|
|
|
zero. 64 bytes is the largest "small" request for the
|
|
|
|
|
GNU C library malloc. */
|
|
|
|
|
enum { DEFAULT_MXFAST = 64 };
|
|
|
|
|
|
|
|
|
|
n = DEFAULT_MXFAST / s;
|
|
|
|
|
n += !n;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
if (SIZE_MAX / 2 / s < n)
|
|
|
|
|
xalloc_die ();
|
|
|
|
|
n *= 2;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
*pn = n;
|
|
|
|
|
return xrealloc (p, n * s);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void *
|
|
|
|
|
x2nrealloc (void *p, size_t *pn, size_t s)
|
|
|
|
|
{
|
|
|
|
|
return x2nrealloc_inline (p, pn, s);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If P is null, allocate a block of at least *PN bytes; otherwise,
|
|
|
|
|
reallocate P so that it contains more than *PN bytes. *PN must be
|
|
|
|
|
nonzero unless P is null. Set *PN to the new block's size, and
|
|
|
|
|
return the pointer to the new block. *PN is never set to zero, and
|
|
|
|
|
the returned pointer is never null. */
|
|
|
|
|
|
|
|
|
|
void *
|
|
|
|
|
x2realloc (void *p, size_t *pn)
|
|
|
|
|
{
|
|
|
|
|
return x2nrealloc_inline (p, pn, 1);
|
2003-10-13 15:26:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Allocate S bytes of zeroed memory dynamically, with error checking.
|
|
|
|
|
There's no need for xnzalloc (N, S), since it would be equivalent
|
|
|
|
|
to xcalloc (N, S). */
|
|
|
|
|
|
|
|
|
|
void *
|
|
|
|
|
xzalloc (size_t s)
|
|
|
|
|
{
|
|
|
|
|
return memset (xmalloc (s), 0, s);
|
1997-11-03 05:25:44 +00:00
|
|
|
}
|
|
|
|
|
|
2003-10-13 15:26:45 +00:00
|
|
|
/* Allocate zeroed memory for N elements of S bytes, with error
|
|
|
|
|
checking. S must be nonzero. */
|
1997-11-03 05:25:44 +00:00
|
|
|
|
|
|
|
|
void *
|
1998-12-07 03:12:10 +00:00
|
|
|
xcalloc (size_t n, size_t s)
|
1997-11-03 05:25:44 +00:00
|
|
|
{
|
|
|
|
|
void *p;
|
2003-10-13 15:26:45 +00:00
|
|
|
/* Test for overflow, since some calloc implementations don't have
|
2005-06-22 11:55:38 +00:00
|
|
|
proper overflow checks. But omit overflow and size-zero tests if
|
|
|
|
|
HAVE_GNU_CALLOC, since GNU calloc catches overflow and never
|
|
|
|
|
returns NULL if successful. */
|
|
|
|
|
if ((! HAVE_GNU_CALLOC && xalloc_oversized (n, s))
|
|
|
|
|
|| (! (p = calloc (n, s)) && (HAVE_GNU_CALLOC || n != 0)))
|
1999-09-26 19:05:39 +00:00
|
|
|
xalloc_die ();
|
1992-11-01 05:44:29 +00:00
|
|
|
return p;
|
|
|
|
|
}
|
2003-10-13 15:26:45 +00:00
|
|
|
|
|
|
|
|
/* Clone an object P of size S, with error checking. There's no need
|
2004-10-05 06:52:09 +00:00
|
|
|
for xnmemdup (P, N, S), since xmemdup (P, N * S) works without any
|
2003-10-13 15:26:45 +00:00
|
|
|
need for an arithmetic overflow check. */
|
|
|
|
|
|
|
|
|
|
void *
|
2004-10-05 06:52:09 +00:00
|
|
|
xmemdup (void const *p, size_t s)
|
2003-10-13 15:26:45 +00:00
|
|
|
{
|
|
|
|
|
return memcpy (xmalloc (s), p, s);
|
|
|
|
|
}
|
2004-10-05 06:52:09 +00:00
|
|
|
|
|
|
|
|
/* Clone STRING. */
|
|
|
|
|
|
|
|
|
|
char *
|
|
|
|
|
xstrdup (char const *string)
|
|
|
|
|
{
|
|
|
|
|
return xmemdup (string, strlen (string) + 1);
|
|
|
|
|
}
|