/* obstack.c - subroutines used implicitly by object stack macros
|
/* obstack.c - subroutines used implicitly by object stack macros
|
Copyright (C) 1988,89,90,91,92,93,94,96,97 Free Software Foundation, Inc.
|
Copyright (C) 1988,89,90,91,92,93,94,96,97 Free Software Foundation, Inc.
|
|
|
|
|
NOTE: This source is derived from an old version taken from the GNU C
|
NOTE: This source is derived from an old version taken from the GNU C
|
Library (glibc).
|
Library (glibc).
|
|
|
This program is free software; you can redistribute it and/or modify it
|
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
|
under the terms of the GNU General Public License as published by the
|
Free Software Foundation; either version 2, or (at your option) any
|
Free Software Foundation; either version 2, or (at your option) any
|
later version.
|
later version.
|
|
|
This program is distributed in the hope that it will be useful,
|
This program is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with this program; if not, write to the Free Software
|
along with this program; if not, write to the Free Software
|
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301,
|
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301,
|
USA. */
|
USA. */
|
|
|
#ifdef HAVE_CONFIG_H
|
#ifdef HAVE_CONFIG_H
|
#include <config.h>
|
#include <config.h>
|
#endif
|
#endif
|
|
|
#include "obstack.h"
|
#include "obstack.h"
|
|
|
/* NOTE BEFORE MODIFYING THIS FILE: This version number must be
|
/* NOTE BEFORE MODIFYING THIS FILE: This version number must be
|
incremented whenever callers compiled using an old obstack.h can no
|
incremented whenever callers compiled using an old obstack.h can no
|
longer properly call the functions in this obstack.c. */
|
longer properly call the functions in this obstack.c. */
|
#define OBSTACK_INTERFACE_VERSION 1
|
#define OBSTACK_INTERFACE_VERSION 1
|
|
|
/* Comment out all this code if we are using the GNU C Library, and are not
|
/* Comment out all this code if we are using the GNU C Library, and are not
|
actually compiling the library itself, and the installed library
|
actually compiling the library itself, and the installed library
|
supports the same library interface we do. This code is part of the GNU
|
supports the same library interface we do. This code is part of the GNU
|
C Library, but also included in many other GNU distributions. Compiling
|
C Library, but also included in many other GNU distributions. Compiling
|
and linking in this code is a waste when using the GNU C library
|
and linking in this code is a waste when using the GNU C library
|
(especially if it is a shared library). Rather than having every GNU
|
(especially if it is a shared library). Rather than having every GNU
|
program understand `configure --with-gnu-libc' and omit the object
|
program understand `configure --with-gnu-libc' and omit the object
|
files, it is simpler to just do this in the source for each such file. */
|
files, it is simpler to just do this in the source for each such file. */
|
|
|
#include <stdio.h> /* Random thing to get __GNU_LIBRARY__. */
|
#include <stdio.h> /* Random thing to get __GNU_LIBRARY__. */
|
#if !defined (_LIBC) && defined (__GNU_LIBRARY__) && __GNU_LIBRARY__ > 1
|
#if !defined (_LIBC) && defined (__GNU_LIBRARY__) && __GNU_LIBRARY__ > 1
|
#include <gnu-versions.h>
|
#include <gnu-versions.h>
|
#if _GNU_OBSTACK_INTERFACE_VERSION == OBSTACK_INTERFACE_VERSION
|
#if _GNU_OBSTACK_INTERFACE_VERSION == OBSTACK_INTERFACE_VERSION
|
#define ELIDE_CODE
|
#define ELIDE_CODE
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
|
|
#ifndef ELIDE_CODE
|
#ifndef ELIDE_CODE
|
|
|
|
|
#define POINTER void *
|
#define POINTER void *
|
|
|
/* Determine default alignment. */
|
/* Determine default alignment. */
|
struct fooalign {char x; double d;};
|
struct fooalign {char x; double d;};
|
#define DEFAULT_ALIGNMENT \
|
#define DEFAULT_ALIGNMENT \
|
((PTR_INT_TYPE) ((char *) &((struct fooalign *) 0)->d - (char *) 0))
|
((PTR_INT_TYPE) ((char *) &((struct fooalign *) 0)->d - (char *) 0))
|
/* If malloc were really smart, it would round addresses to DEFAULT_ALIGNMENT.
|
/* If malloc were really smart, it would round addresses to DEFAULT_ALIGNMENT.
|
But in fact it might be less smart and round addresses to as much as
|
But in fact it might be less smart and round addresses to as much as
|
DEFAULT_ROUNDING. So we prepare for it to do that. */
|
DEFAULT_ROUNDING. So we prepare for it to do that. */
|
union fooround {long x; double d;};
|
union fooround {long x; double d;};
|
#define DEFAULT_ROUNDING (sizeof (union fooround))
|
#define DEFAULT_ROUNDING (sizeof (union fooround))
|
|
|
/* When we copy a long block of data, this is the unit to do it with.
|
/* When we copy a long block of data, this is the unit to do it with.
|
On some machines, copying successive ints does not work;
|
On some machines, copying successive ints does not work;
|
in such a case, redefine COPYING_UNIT to `long' (if that works)
|
in such a case, redefine COPYING_UNIT to `long' (if that works)
|
or `char' as a last resort. */
|
or `char' as a last resort. */
|
#ifndef COPYING_UNIT
|
#ifndef COPYING_UNIT
|
#define COPYING_UNIT int
|
#define COPYING_UNIT int
|
#endif
|
#endif
|
|
|
|
|
/* The functions allocating more room by calling `obstack_chunk_alloc'
|
/* The functions allocating more room by calling `obstack_chunk_alloc'
|
jump to the handler pointed to by `obstack_alloc_failed_handler'.
|
jump to the handler pointed to by `obstack_alloc_failed_handler'.
|
This variable by default points to the internal function
|
This variable by default points to the internal function
|
`print_and_abort'. */
|
`print_and_abort'. */
|
static void print_and_abort (void);
|
static void print_and_abort (void);
|
void (*obstack_alloc_failed_handler) (void) = print_and_abort;
|
void (*obstack_alloc_failed_handler) (void) = print_and_abort;
|
|
|
/* Exit value used when `print_and_abort' is used. */
|
/* Exit value used when `print_and_abort' is used. */
|
#if defined __GNU_LIBRARY__ || defined HAVE_STDLIB_H
|
#if defined __GNU_LIBRARY__ || defined HAVE_STDLIB_H
|
#include <stdlib.h>
|
#include <stdlib.h>
|
#endif
|
#endif
|
#ifndef EXIT_FAILURE
|
#ifndef EXIT_FAILURE
|
#define EXIT_FAILURE 1
|
#define EXIT_FAILURE 1
|
#endif
|
#endif
|
int obstack_exit_failure = EXIT_FAILURE;
|
int obstack_exit_failure = EXIT_FAILURE;
|
|
|
/* The non-GNU-C macros copy the obstack into this global variable
|
/* The non-GNU-C macros copy the obstack into this global variable
|
to avoid multiple evaluation. */
|
to avoid multiple evaluation. */
|
|
|
struct obstack *_obstack;
|
struct obstack *_obstack;
|
|
|
/* Define a macro that either calls functions with the traditional malloc/free
|
/* Define a macro that either calls functions with the traditional malloc/free
|
calling interface, or calls functions with the mmalloc/mfree interface
|
calling interface, or calls functions with the mmalloc/mfree interface
|
(that adds an extra first argument), based on the state of use_extra_arg.
|
(that adds an extra first argument), based on the state of use_extra_arg.
|
For free, do not use ?:, since some compilers, like the MIPS compilers,
|
For free, do not use ?:, since some compilers, like the MIPS compilers,
|
do not allow (expr) ? void : void. */
|
do not allow (expr) ? void : void. */
|
|
|
#if defined (__STDC__) && __STDC__
|
#if defined (__STDC__) && __STDC__
|
#define CALL_CHUNKFUN(h, size) \
|
#define CALL_CHUNKFUN(h, size) \
|
(((h) -> use_extra_arg) \
|
(((h) -> use_extra_arg) \
|
? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
|
? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
|
: (*(struct _obstack_chunk *(*) (long)) (h)->chunkfun) ((size)))
|
: (*(struct _obstack_chunk *(*) (long)) (h)->chunkfun) ((size)))
|
|
|
#define CALL_FREEFUN(h, old_chunk) \
|
#define CALL_FREEFUN(h, old_chunk) \
|
do { \
|
do { \
|
if ((h) -> use_extra_arg) \
|
if ((h) -> use_extra_arg) \
|
(*(h)->freefun) ((h)->extra_arg, (old_chunk)); \
|
(*(h)->freefun) ((h)->extra_arg, (old_chunk)); \
|
else \
|
else \
|
(*(void (*) (void *)) (h)->freefun) ((old_chunk)); \
|
(*(void (*) (void *)) (h)->freefun) ((old_chunk)); \
|
} while (0)
|
} while (0)
|
#else
|
#else
|
#define CALL_CHUNKFUN(h, size) \
|
#define CALL_CHUNKFUN(h, size) \
|
(((h) -> use_extra_arg) \
|
(((h) -> use_extra_arg) \
|
? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
|
? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
|
: (*(struct _obstack_chunk *(*) ()) (h)->chunkfun) ((size)))
|
: (*(struct _obstack_chunk *(*) ()) (h)->chunkfun) ((size)))
|
|
|
#define CALL_FREEFUN(h, old_chunk) \
|
#define CALL_FREEFUN(h, old_chunk) \
|
do { \
|
do { \
|
if ((h) -> use_extra_arg) \
|
if ((h) -> use_extra_arg) \
|
(*(h)->freefun) ((h)->extra_arg, (old_chunk)); \
|
(*(h)->freefun) ((h)->extra_arg, (old_chunk)); \
|
else \
|
else \
|
(*(void (*) ()) (h)->freefun) ((old_chunk)); \
|
(*(void (*) ()) (h)->freefun) ((old_chunk)); \
|
} while (0)
|
} while (0)
|
#endif
|
#endif
|
|
|
|
|
/* Initialize an obstack H for use. Specify chunk size SIZE (0 means default).
|
/* Initialize an obstack H for use. Specify chunk size SIZE (0 means default).
|
Objects start on multiples of ALIGNMENT (0 means use default).
|
Objects start on multiples of ALIGNMENT (0 means use default).
|
CHUNKFUN is the function to use to allocate chunks,
|
CHUNKFUN is the function to use to allocate chunks,
|
and FREEFUN the function to free them.
|
and FREEFUN the function to free them.
|
|
|
Return nonzero if successful, zero if out of memory.
|
Return nonzero if successful, zero if out of memory.
|
To recover from an out of memory error,
|
To recover from an out of memory error,
|
free up some memory, then call this again. */
|
free up some memory, then call this again. */
|
|
|
int
|
int
|
_obstack_begin (struct obstack *h, int size, int alignment,
|
_obstack_begin (struct obstack *h, int size, int alignment,
|
POINTER (*chunkfun) (long), void (*freefun) (void *))
|
POINTER (*chunkfun) (long), void (*freefun) (void *))
|
{
|
{
|
register struct _obstack_chunk *chunk; /* points to new chunk */
|
register struct _obstack_chunk *chunk; /* points to new chunk */
|
|
|
if (alignment == 0)
|
if (alignment == 0)
|
alignment = (int) DEFAULT_ALIGNMENT;
|
alignment = (int) DEFAULT_ALIGNMENT;
|
if (size == 0)
|
if (size == 0)
|
/* Default size is what GNU malloc can fit in a 4096-byte block. */
|
/* Default size is what GNU malloc can fit in a 4096-byte block. */
|
{
|
{
|
/* 12 is sizeof (mhead) and 4 is EXTRA from GNU malloc.
|
/* 12 is sizeof (mhead) and 4 is EXTRA from GNU malloc.
|
Use the values for range checking, because if range checking is off,
|
Use the values for range checking, because if range checking is off,
|
the extra bytes won't be missed terribly, but if range checking is on
|
the extra bytes won't be missed terribly, but if range checking is on
|
and we used a larger request, a whole extra 4096 bytes would be
|
and we used a larger request, a whole extra 4096 bytes would be
|
allocated.
|
allocated.
|
|
|
These number are irrelevant to the new GNU malloc. I suspect it is
|
These number are irrelevant to the new GNU malloc. I suspect it is
|
less sensitive to the size of the request. */
|
less sensitive to the size of the request. */
|
int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1))
|
int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1))
|
+ 4 + DEFAULT_ROUNDING - 1)
|
+ 4 + DEFAULT_ROUNDING - 1)
|
& ~(DEFAULT_ROUNDING - 1));
|
& ~(DEFAULT_ROUNDING - 1));
|
size = 4096 - extra;
|
size = 4096 - extra;
|
}
|
}
|
|
|
h->chunkfun = (struct _obstack_chunk * (*)(void *, long)) chunkfun;
|
h->chunkfun = (struct _obstack_chunk * (*)(void *, long)) chunkfun;
|
h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun;
|
h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun;
|
h->chunk_size = size;
|
h->chunk_size = size;
|
h->alignment_mask = alignment - 1;
|
h->alignment_mask = alignment - 1;
|
h->use_extra_arg = 0;
|
h->use_extra_arg = 0;
|
|
|
chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
|
chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
|
if (!chunk)
|
if (!chunk)
|
(*obstack_alloc_failed_handler) ();
|
(*obstack_alloc_failed_handler) ();
|
h->next_free = h->object_base = chunk->contents;
|
h->next_free = h->object_base = chunk->contents;
|
h->chunk_limit = chunk->limit
|
h->chunk_limit = chunk->limit
|
= (char *) chunk + h->chunk_size;
|
= (char *) chunk + h->chunk_size;
|
chunk->prev = 0;
|
chunk->prev = 0;
|
/* The initial chunk now contains no empty object. */
|
/* The initial chunk now contains no empty object. */
|
h->maybe_empty_object = 0;
|
h->maybe_empty_object = 0;
|
h->alloc_failed = 0;
|
h->alloc_failed = 0;
|
return 1;
|
return 1;
|
}
|
}
|
|
|
int
|
int
|
_obstack_begin_1 (struct obstack *h, int size, int alignment,
|
_obstack_begin_1 (struct obstack *h, int size, int alignment,
|
POINTER (*chunkfun) (POINTER, long),
|
POINTER (*chunkfun) (POINTER, long),
|
void (*freefun) (POINTER, POINTER), POINTER arg)
|
void (*freefun) (POINTER, POINTER), POINTER arg)
|
{
|
{
|
register struct _obstack_chunk *chunk; /* points to new chunk */
|
register struct _obstack_chunk *chunk; /* points to new chunk */
|
|
|
if (alignment == 0)
|
if (alignment == 0)
|
alignment = (int) DEFAULT_ALIGNMENT;
|
alignment = (int) DEFAULT_ALIGNMENT;
|
if (size == 0)
|
if (size == 0)
|
/* Default size is what GNU malloc can fit in a 4096-byte block. */
|
/* Default size is what GNU malloc can fit in a 4096-byte block. */
|
{
|
{
|
/* 12 is sizeof (mhead) and 4 is EXTRA from GNU malloc.
|
/* 12 is sizeof (mhead) and 4 is EXTRA from GNU malloc.
|
Use the values for range checking, because if range checking is off,
|
Use the values for range checking, because if range checking is off,
|
the extra bytes won't be missed terribly, but if range checking is on
|
the extra bytes won't be missed terribly, but if range checking is on
|
and we used a larger request, a whole extra 4096 bytes would be
|
and we used a larger request, a whole extra 4096 bytes would be
|
allocated.
|
allocated.
|
|
|
These number are irrelevant to the new GNU malloc. I suspect it is
|
These number are irrelevant to the new GNU malloc. I suspect it is
|
less sensitive to the size of the request. */
|
less sensitive to the size of the request. */
|
int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1))
|
int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1))
|
+ 4 + DEFAULT_ROUNDING - 1)
|
+ 4 + DEFAULT_ROUNDING - 1)
|
& ~(DEFAULT_ROUNDING - 1));
|
& ~(DEFAULT_ROUNDING - 1));
|
size = 4096 - extra;
|
size = 4096 - extra;
|
}
|
}
|
|
|
h->chunkfun = (struct _obstack_chunk * (*)(void *,long)) chunkfun;
|
h->chunkfun = (struct _obstack_chunk * (*)(void *,long)) chunkfun;
|
h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun;
|
h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun;
|
h->chunk_size = size;
|
h->chunk_size = size;
|
h->alignment_mask = alignment - 1;
|
h->alignment_mask = alignment - 1;
|
h->extra_arg = arg;
|
h->extra_arg = arg;
|
h->use_extra_arg = 1;
|
h->use_extra_arg = 1;
|
|
|
chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
|
chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
|
if (!chunk)
|
if (!chunk)
|
(*obstack_alloc_failed_handler) ();
|
(*obstack_alloc_failed_handler) ();
|
h->next_free = h->object_base = chunk->contents;
|
h->next_free = h->object_base = chunk->contents;
|
h->chunk_limit = chunk->limit
|
h->chunk_limit = chunk->limit
|
= (char *) chunk + h->chunk_size;
|
= (char *) chunk + h->chunk_size;
|
chunk->prev = 0;
|
chunk->prev = 0;
|
/* The initial chunk now contains no empty object. */
|
/* The initial chunk now contains no empty object. */
|
h->maybe_empty_object = 0;
|
h->maybe_empty_object = 0;
|
h->alloc_failed = 0;
|
h->alloc_failed = 0;
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* Allocate a new current chunk for the obstack *H
|
/* Allocate a new current chunk for the obstack *H
|
on the assumption that LENGTH bytes need to be added
|
on the assumption that LENGTH bytes need to be added
|
to the current object, or a new object of length LENGTH allocated.
|
to the current object, or a new object of length LENGTH allocated.
|
Copies any partial object from the end of the old chunk
|
Copies any partial object from the end of the old chunk
|
to the beginning of the new one. */
|
to the beginning of the new one. */
|
|
|
void
|
void
|
_obstack_newchunk (struct obstack *h, int length)
|
_obstack_newchunk (struct obstack *h, int length)
|
{
|
{
|
register struct _obstack_chunk *old_chunk = h->chunk;
|
register struct _obstack_chunk *old_chunk = h->chunk;
|
register struct _obstack_chunk *new_chunk;
|
register struct _obstack_chunk *new_chunk;
|
register long new_size;
|
register long new_size;
|
register long obj_size = h->next_free - h->object_base;
|
register long obj_size = h->next_free - h->object_base;
|
register long i;
|
register long i;
|
long already;
|
long already;
|
|
|
/* Compute size for new chunk. */
|
/* Compute size for new chunk. */
|
new_size = (obj_size + length) + (obj_size >> 3) + 100;
|
new_size = (obj_size + length) + (obj_size >> 3) + 100;
|
if (new_size < h->chunk_size)
|
if (new_size < h->chunk_size)
|
new_size = h->chunk_size;
|
new_size = h->chunk_size;
|
|
|
/* Allocate and initialize the new chunk. */
|
/* Allocate and initialize the new chunk. */
|
new_chunk = CALL_CHUNKFUN (h, new_size);
|
new_chunk = CALL_CHUNKFUN (h, new_size);
|
if (!new_chunk)
|
if (!new_chunk)
|
(*obstack_alloc_failed_handler) ();
|
(*obstack_alloc_failed_handler) ();
|
h->chunk = new_chunk;
|
h->chunk = new_chunk;
|
new_chunk->prev = old_chunk;
|
new_chunk->prev = old_chunk;
|
new_chunk->limit = h->chunk_limit = (char *) new_chunk + new_size;
|
new_chunk->limit = h->chunk_limit = (char *) new_chunk + new_size;
|
|
|
/* Move the existing object to the new chunk.
|
/* Move the existing object to the new chunk.
|
Word at a time is fast and is safe if the object
|
Word at a time is fast and is safe if the object
|
is sufficiently aligned. */
|
is sufficiently aligned. */
|
if (h->alignment_mask + 1 >= DEFAULT_ALIGNMENT)
|
if (h->alignment_mask + 1 >= DEFAULT_ALIGNMENT)
|
{
|
{
|
for (i = obj_size / sizeof (COPYING_UNIT) - 1;
|
for (i = obj_size / sizeof (COPYING_UNIT) - 1;
|
i >= 0; i--)
|
i >= 0; i--)
|
((COPYING_UNIT *)new_chunk->contents)[i]
|
((COPYING_UNIT *)new_chunk->contents)[i]
|
= ((COPYING_UNIT *)h->object_base)[i];
|
= ((COPYING_UNIT *)h->object_base)[i];
|
/* We used to copy the odd few remaining bytes as one extra COPYING_UNIT,
|
/* We used to copy the odd few remaining bytes as one extra COPYING_UNIT,
|
but that can cross a page boundary on a machine
|
but that can cross a page boundary on a machine
|
which does not do strict alignment for COPYING_UNITS. */
|
which does not do strict alignment for COPYING_UNITS. */
|
already = obj_size / sizeof (COPYING_UNIT) * sizeof (COPYING_UNIT);
|
already = obj_size / sizeof (COPYING_UNIT) * sizeof (COPYING_UNIT);
|
}
|
}
|
else
|
else
|
already = 0;
|
already = 0;
|
/* Copy remaining bytes one by one. */
|
/* Copy remaining bytes one by one. */
|
for (i = already; i < obj_size; i++)
|
for (i = already; i < obj_size; i++)
|
new_chunk->contents[i] = h->object_base[i];
|
new_chunk->contents[i] = h->object_base[i];
|
|
|
/* If the object just copied was the only data in OLD_CHUNK,
|
/* If the object just copied was the only data in OLD_CHUNK,
|
free that chunk and remove it from the chain.
|
free that chunk and remove it from the chain.
|
But not if that chunk might contain an empty object. */
|
But not if that chunk might contain an empty object. */
|
if (h->object_base == old_chunk->contents && ! h->maybe_empty_object)
|
if (h->object_base == old_chunk->contents && ! h->maybe_empty_object)
|
{
|
{
|
new_chunk->prev = old_chunk->prev;
|
new_chunk->prev = old_chunk->prev;
|
CALL_FREEFUN (h, old_chunk);
|
CALL_FREEFUN (h, old_chunk);
|
}
|
}
|
|
|
h->object_base = new_chunk->contents;
|
h->object_base = new_chunk->contents;
|
h->next_free = h->object_base + obj_size;
|
h->next_free = h->object_base + obj_size;
|
/* The new chunk certainly contains no empty object yet. */
|
/* The new chunk certainly contains no empty object yet. */
|
h->maybe_empty_object = 0;
|
h->maybe_empty_object = 0;
|
}
|
}
|
|
|
/* Return nonzero if object OBJ has been allocated from obstack H.
|
/* Return nonzero if object OBJ has been allocated from obstack H.
|
This is here for debugging.
|
This is here for debugging.
|
If you use it in a program, you are probably losing. */
|
If you use it in a program, you are probably losing. */
|
|
|
/* Suppress -Wmissing-prototypes warning. We don't want to declare this in
|
/* Suppress -Wmissing-prototypes warning. We don't want to declare this in
|
obstack.h because it is just for debugging. */
|
obstack.h because it is just for debugging. */
|
int _obstack_allocated_p (struct obstack *h, POINTER obj);
|
int _obstack_allocated_p (struct obstack *h, POINTER obj);
|
|
|
int
|
int
|
_obstack_allocated_p (struct obstack *h, POINTER obj)
|
_obstack_allocated_p (struct obstack *h, POINTER obj)
|
{
|
{
|
register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
|
register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
|
register struct _obstack_chunk *plp; /* point to previous chunk if any */
|
register struct _obstack_chunk *plp; /* point to previous chunk if any */
|
|
|
lp = (h)->chunk;
|
lp = (h)->chunk;
|
/* We use >= rather than > since the object cannot be exactly at
|
/* We use >= rather than > since the object cannot be exactly at
|
the beginning of the chunk but might be an empty object exactly
|
the beginning of the chunk but might be an empty object exactly
|
at the end of an adjacent chunk. */
|
at the end of an adjacent chunk. */
|
while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
|
while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
|
{
|
{
|
plp = lp->prev;
|
plp = lp->prev;
|
lp = plp;
|
lp = plp;
|
}
|
}
|
return lp != 0;
|
return lp != 0;
|
}
|
}
|
|
|
/* Free objects in obstack H, including OBJ and everything allocate
|
/* Free objects in obstack H, including OBJ and everything allocate
|
more recently than OBJ. If OBJ is zero, free everything in H. */
|
more recently than OBJ. If OBJ is zero, free everything in H. */
|
|
|
#undef obstack_free
|
#undef obstack_free
|
|
|
/* This function has two names with identical definitions.
|
/* This function has two names with identical definitions.
|
This is the first one, called from non-ANSI code. */
|
This is the first one, called from non-ANSI code. */
|
|
|
void
|
void
|
_obstack_free (struct obstack *h, POINTER obj)
|
_obstack_free (struct obstack *h, POINTER obj)
|
{
|
{
|
register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
|
register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
|
register struct _obstack_chunk *plp; /* point to previous chunk if any */
|
register struct _obstack_chunk *plp; /* point to previous chunk if any */
|
|
|
lp = h->chunk;
|
lp = h->chunk;
|
/* We use >= because there cannot be an object at the beginning of a chunk.
|
/* We use >= because there cannot be an object at the beginning of a chunk.
|
But there can be an empty object at that address
|
But there can be an empty object at that address
|
at the end of another chunk. */
|
at the end of another chunk. */
|
while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
|
while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
|
{
|
{
|
plp = lp->prev;
|
plp = lp->prev;
|
CALL_FREEFUN (h, lp);
|
CALL_FREEFUN (h, lp);
|
lp = plp;
|
lp = plp;
|
/* If we switch chunks, we can't tell whether the new current
|
/* If we switch chunks, we can't tell whether the new current
|
chunk contains an empty object, so assume that it may. */
|
chunk contains an empty object, so assume that it may. */
|
h->maybe_empty_object = 1;
|
h->maybe_empty_object = 1;
|
}
|
}
|
if (lp)
|
if (lp)
|
{
|
{
|
h->object_base = h->next_free = (char *) (obj);
|
h->object_base = h->next_free = (char *) (obj);
|
h->chunk_limit = lp->limit;
|
h->chunk_limit = lp->limit;
|
h->chunk = lp;
|
h->chunk = lp;
|
}
|
}
|
else if (obj != 0)
|
else if (obj != 0)
|
/* obj is not in any of the chunks! */
|
/* obj is not in any of the chunks! */
|
abort ();
|
abort ();
|
}
|
}
|
|
|
/* This function is used from ANSI code. */
|
/* This function is used from ANSI code. */
|
|
|
void
|
void
|
obstack_free (struct obstack *h, POINTER obj)
|
obstack_free (struct obstack *h, POINTER obj)
|
{
|
{
|
register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
|
register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
|
register struct _obstack_chunk *plp; /* point to previous chunk if any */
|
register struct _obstack_chunk *plp; /* point to previous chunk if any */
|
|
|
lp = h->chunk;
|
lp = h->chunk;
|
/* We use >= because there cannot be an object at the beginning of a chunk.
|
/* We use >= because there cannot be an object at the beginning of a chunk.
|
But there can be an empty object at that address
|
But there can be an empty object at that address
|
at the end of another chunk. */
|
at the end of another chunk. */
|
while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
|
while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
|
{
|
{
|
plp = lp->prev;
|
plp = lp->prev;
|
CALL_FREEFUN (h, lp);
|
CALL_FREEFUN (h, lp);
|
lp = plp;
|
lp = plp;
|
/* If we switch chunks, we can't tell whether the new current
|
/* If we switch chunks, we can't tell whether the new current
|
chunk contains an empty object, so assume that it may. */
|
chunk contains an empty object, so assume that it may. */
|
h->maybe_empty_object = 1;
|
h->maybe_empty_object = 1;
|
}
|
}
|
if (lp)
|
if (lp)
|
{
|
{
|
h->object_base = h->next_free = (char *) (obj);
|
h->object_base = h->next_free = (char *) (obj);
|
h->chunk_limit = lp->limit;
|
h->chunk_limit = lp->limit;
|
h->chunk = lp;
|
h->chunk = lp;
|
}
|
}
|
else if (obj != 0)
|
else if (obj != 0)
|
/* obj is not in any of the chunks! */
|
/* obj is not in any of the chunks! */
|
abort ();
|
abort ();
|
}
|
}
|
|
|
int
|
int
|
_obstack_memory_used (struct obstack *h)
|
_obstack_memory_used (struct obstack *h)
|
{
|
{
|
register struct _obstack_chunk* lp;
|
register struct _obstack_chunk* lp;
|
register int nbytes = 0;
|
register int nbytes = 0;
|
|
|
for (lp = h->chunk; lp != 0; lp = lp->prev)
|
for (lp = h->chunk; lp != 0; lp = lp->prev)
|
{
|
{
|
nbytes += lp->limit - (char *) lp;
|
nbytes += lp->limit - (char *) lp;
|
}
|
}
|
return nbytes;
|
return nbytes;
|
}
|
}
|
|
|
/* Define the error handler. */
|
/* Define the error handler. */
|
#ifndef _
|
#ifndef _
|
# if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC
|
# if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC
|
# include <libintl.h>
|
# include <libintl.h>
|
# ifndef _
|
# ifndef _
|
# define _(Str) gettext (Str)
|
# define _(Str) gettext (Str)
|
# endif
|
# endif
|
# else
|
# else
|
# define _(Str) (Str)
|
# define _(Str) (Str)
|
# endif
|
# endif
|
#endif
|
#endif
|
|
|
static void
|
static void
|
print_and_abort (void)
|
print_and_abort (void)
|
{
|
{
|
fputs (_("memory exhausted\n"), stderr);
|
fputs (_("memory exhausted\n"), stderr);
|
exit (obstack_exit_failure);
|
exit (obstack_exit_failure);
|
}
|
}
|
|
|
#if 0
|
#if 0
|
/* These are now turned off because the applications do not use it
|
/* These are now turned off because the applications do not use it
|
and it uses bcopy via obstack_grow, which causes trouble on sysV. */
|
and it uses bcopy via obstack_grow, which causes trouble on sysV. */
|
|
|
/* Now define the functional versions of the obstack macros.
|
/* Now define the functional versions of the obstack macros.
|
Define them to simply use the corresponding macros to do the job. */
|
Define them to simply use the corresponding macros to do the job. */
|
|
|
/* The function names appear in parentheses in order to prevent
|
/* The function names appear in parentheses in order to prevent
|
the macro-definitions of the names from being expanded there. */
|
the macro-definitions of the names from being expanded there. */
|
|
|
POINTER (obstack_base) (struct obstack *obstack)
|
POINTER (obstack_base) (struct obstack *obstack)
|
{
|
{
|
return obstack_base (obstack);
|
return obstack_base (obstack);
|
}
|
}
|
|
|
POINTER (obstack_next_free) (struct obstack *obstack)
|
POINTER (obstack_next_free) (struct obstack *obstack)
|
{
|
{
|
return obstack_next_free (obstack);
|
return obstack_next_free (obstack);
|
}
|
}
|
|
|
int (obstack_object_size) (struct obstack *obstack)
|
int (obstack_object_size) (struct obstack *obstack)
|
{
|
{
|
return obstack_object_size (obstack);
|
return obstack_object_size (obstack);
|
}
|
}
|
|
|
int (obstack_room) (struct obstack *obstack)
|
int (obstack_room) (struct obstack *obstack)
|
{
|
{
|
return obstack_room (obstack);
|
return obstack_room (obstack);
|
}
|
}
|
|
|
int (obstack_make_room) (struct obstack *obstack, int length)
|
int (obstack_make_room) (struct obstack *obstack, int length)
|
{
|
{
|
return obstack_make_room (obstack, length);
|
return obstack_make_room (obstack, length);
|
}
|
}
|
|
|
void (obstack_grow) (struct obstack *obstack, POINTER pointer, int length)
|
void (obstack_grow) (struct obstack *obstack, POINTER pointer, int length)
|
{
|
{
|
obstack_grow (obstack, pointer, length);
|
obstack_grow (obstack, pointer, length);
|
}
|
}
|
|
|
void (obstack_grow0) (struct obstack *obstack, POINTER pointer, int length)
|
void (obstack_grow0) (struct obstack *obstack, POINTER pointer, int length)
|
{
|
{
|
obstack_grow0 (obstack, pointer, length);
|
obstack_grow0 (obstack, pointer, length);
|
}
|
}
|
|
|
void (obstack_1grow) (struct obstack *obstack, int character)
|
void (obstack_1grow) (struct obstack *obstack, int character)
|
{
|
{
|
obstack_1grow (obstack, character);
|
obstack_1grow (obstack, character);
|
}
|
}
|
|
|
void (obstack_blank) (struct obstack *obstack, int length)
|
void (obstack_blank) (struct obstack *obstack, int length)
|
{
|
{
|
obstack_blank (obstack, length);
|
obstack_blank (obstack, length);
|
}
|
}
|
|
|
void (obstack_1grow_fast) (struct obstack *obstack, int character)
|
void (obstack_1grow_fast) (struct obstack *obstack, int character)
|
{
|
{
|
obstack_1grow_fast (obstack, character);
|
obstack_1grow_fast (obstack, character);
|
}
|
}
|
|
|
void (obstack_blank_fast) (struct obstack *obstack, int length)
|
void (obstack_blank_fast) (struct obstack *obstack, int length)
|
{
|
{
|
obstack_blank_fast (obstack, length);
|
obstack_blank_fast (obstack, length);
|
}
|
}
|
|
|
POINTER (obstack_finish) (struct obstack *obstack)
|
POINTER (obstack_finish) (struct obstack *obstack)
|
{
|
{
|
return obstack_finish (obstack);
|
return obstack_finish (obstack);
|
}
|
}
|
|
|
POINTER (obstack_alloc) (struct obstack *obstack, int length)
|
POINTER (obstack_alloc) (struct obstack *obstack, int length)
|
{
|
{
|
return obstack_alloc (obstack, length);
|
return obstack_alloc (obstack, length);
|
}
|
}
|
|
|
POINTER (obstack_copy) (struct obstack *obstack, POINTER pointer, int length)
|
POINTER (obstack_copy) (struct obstack *obstack, POINTER pointer, int length)
|
{
|
{
|
return obstack_copy (obstack, pointer, length);
|
return obstack_copy (obstack, pointer, length);
|
}
|
}
|
|
|
POINTER (obstack_copy0) (struct obstack *obstack, POINTER pointer, int length)
|
POINTER (obstack_copy0) (struct obstack *obstack, POINTER pointer, int length)
|
{
|
{
|
return obstack_copy0 (obstack, pointer, length);
|
return obstack_copy0 (obstack, pointer, length);
|
}
|
}
|
|
|
#endif /* 0 */
|
#endif /* 0 */
|
|
|
#endif /* !ELIDE_CODE */
|
#endif /* !ELIDE_CODE */
|
|
|
