OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Copy gnulib obstack files 

This copies obstack.[ch] from gnulib, and updates the docs.  The next
patch should be applied if someone repeats the import at a later date.

include/
	* obstack.h: Import current gnulib file.
libiberty/
	* obstack.c: Import current gnulib file.
	* obstacks.texi: Updated doc, from glibc's manual/memory.texi.

From-SVN: r229987
This commit is contained in:
Alan Modra 2015-11-09 14:56:32 +10:30 committed by Alan Modra
parent 62c0f0a637
commit c9f265c945
5 changed files with 756 additions and 901 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
include/ChangeLog
View File

@ -1,3 +1,8 @@
2015-11-09 Alan Modra <amodra@gmail.com>
PR gdb/17133
* obstack.h: Import current gnulib file.
2015-11-05 Jakub Jelinek <jakub@redhat.com> 2015-11-05 Jakub Jelinek <jakub@redhat.com>
Ilya Verbin <ilya.verbin@intel.com> Ilya Verbin <ilya.verbin@intel.com>

828
include/obstack.h
View File

@ -1,106 +1,102 @@
/* obstack.h - object stack macros /* obstack.h - object stack macros
Copyright (C) 1988-2015 Free Software Foundation, Inc. Copyright (C) 1988-2015 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library 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 2.1 of the License, or (at your option) any later version.
NOTE: The canonical source of this file is maintained with the GNU C Library. The GNU C Library is distributed in the hope that it will be useful,
Bugs can be reported to bug-glibc@gnu.org.
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 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
GNU General Public License for more details. Lesser 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 Lesser General Public
along with this program; if not, write to the Free Software License along with the GNU C Library; if not, see
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, <http://www.gnu.org/licenses/>. */
USA. */
/* Summary: /* Summary:
All the apparent functions defined here are macros. The idea All the apparent functions defined here are macros. The idea
is that you would use these pre-tested macros to solve a is that you would use these pre-tested macros to solve a
very specific set of problems, and they would run fast. very specific set of problems, and they would run fast.
Caution: no side-effects in arguments please!! They may be Caution: no side-effects in arguments please!! They may be
evaluated MANY times!! evaluated MANY times!!
These macros operate a stack of objects. Each object starts life These macros operate a stack of objects. Each object starts life
small, and may grow to maturity. (Consider building a word syllable small, and may grow to maturity. (Consider building a word syllable
by syllable.) An object can move while it is growing. Once it has by syllable.) An object can move while it is growing. Once it has
been "finished" it never changes address again. So the "top of the been "finished" it never changes address again. So the "top of the
stack" is typically an immature growing object, while the rest of the stack" is typically an immature growing object, while the rest of the
stack is of mature, fixed size and fixed address objects. stack is of mature, fixed size and fixed address objects.
These routines grab large chunks of memory, using a function you These routines grab large chunks of memory, using a function you
supply, called `obstack_chunk_alloc'. On occasion, they free chunks, supply, called 'obstack_chunk_alloc'. On occasion, they free chunks,
by calling `obstack_chunk_free'. You must define them and declare by calling 'obstack_chunk_free'. You must define them and declare
them before using any obstack macros. them before using any obstack macros.
Each independent stack is represented by a `struct obstack'. Each independent stack is represented by a 'struct obstack'.
Each of the obstack macros expects a pointer to such a structure Each of the obstack macros expects a pointer to such a structure
as the first argument. as the first argument.
One motivation for this package is the problem of growing char strings One motivation for this package is the problem of growing char strings
in symbol tables. Unless you are "fascist pig with a read-only mind" in symbol tables. Unless you are "fascist pig with a read-only mind"
--Gosper's immortal quote from HAKMEM item 154, out of context--you --Gosper's immortal quote from HAKMEM item 154, out of context--you
would not like to put any arbitrary upper limit on the length of your would not like to put any arbitrary upper limit on the length of your
symbols. symbols.
In practice this often means you will build many short symbols and a In practice this often means you will build many short symbols and a
few long symbols. At the time you are reading a symbol you don't know few long symbols. At the time you are reading a symbol you don't know
how long it is. One traditional method is to read a symbol into a how long it is. One traditional method is to read a symbol into a
buffer, realloc()ating the buffer every time you try to read a symbol buffer, realloc()ating the buffer every time you try to read a symbol
that is longer than the buffer. This is beaut, but you still will that is longer than the buffer. This is beaut, but you still will
want to copy the symbol from the buffer to a more permanent want to copy the symbol from the buffer to a more permanent
symbol-table entry say about half the time. symbol-table entry say about half the time.
With obstacks, you can work differently. Use one obstack for all symbol With obstacks, you can work differently. Use one obstack for all symbol
names. As you read a symbol, grow the name in the obstack gradually. names. As you read a symbol, grow the name in the obstack gradually.
When the name is complete, finalize it. Then, if the symbol exists already, When the name is complete, finalize it. Then, if the symbol exists already,
free the newly read name. free the newly read name.
The way we do this is to take a large chunk, allocating memory from The way we do this is to take a large chunk, allocating memory from
low addresses. When you want to build a symbol in the chunk you just low addresses. When you want to build a symbol in the chunk you just
add chars above the current "high water mark" in the chunk. When you add chars above the current "high water mark" in the chunk. When you
have finished adding chars, because you got to the end of the symbol, have finished adding chars, because you got to the end of the symbol,
you know how long the chars are, and you can create a new object. you know how long the chars are, and you can create a new object.
Mostly the chars will not burst over the highest address of the chunk, Mostly the chars will not burst over the highest address of the chunk,
because you would typically expect a chunk to be (say) 100 times as because you would typically expect a chunk to be (say) 100 times as
long as an average object. long as an average object.
In case that isn't clear, when we have enough chars to make up In case that isn't clear, when we have enough chars to make up
the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed) the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
so we just point to it where it lies. No moving of chars is so we just point to it where it lies. No moving of chars is
needed and this is the second win: potentially long strings need needed and this is the second win: potentially long strings need
never be explicitly shuffled. Once an object is formed, it does not never be explicitly shuffled. Once an object is formed, it does not
change its address during its lifetime. change its address during its lifetime.
When the chars burst over a chunk boundary, we allocate a larger When the chars burst over a chunk boundary, we allocate a larger
chunk, and then copy the partly formed object from the end of the old chunk, and then copy the partly formed object from the end of the old
chunk to the beginning of the new larger chunk. We then carry on chunk to the beginning of the new larger chunk. We then carry on
accreting characters to the end of the object as we normally would. accreting characters to the end of the object as we normally would.
A special macro is provided to add a single char at a time to a A special macro is provided to add a single char at a time to a
growing object. This allows the use of register variables, which growing object. This allows the use of register variables, which
break the ordinary 'growth' macro. break the ordinary 'growth' macro.
Summary: Summary:
We allocate large chunks. We allocate large chunks.
We carve out one object at a time from the current chunk. We carve out one object at a time from the current chunk.
Once carved, an object never moves. Once carved, an object never moves.
We are free to append data of any size to the currently We are free to append data of any size to the currently
growing object. growing object.
Exactly one object is growing in an obstack at any one time. Exactly one object is growing in an obstack at any one time.
You can run one obstack per control block. You can run one obstack per control block.
You may have as many control blocks as you dare. You may have as many control blocks as you dare.
Because of the way we do it, you can `unwind' an obstack Because of the way we do it, you can "unwind" an obstack
back to a previous state. (You may remove objects much back to a previous state. (You may remove objects much
as you would with a stack.) as you would with a stack.)
*/ */
/* Don't do the contents of this file more than once. */ /* Don't do the contents of this file more than once. */
@ -108,144 +104,124 @@ Summary:
#ifndef _OBSTACK_H #ifndef _OBSTACK_H
#define _OBSTACK_H 1 #define _OBSTACK_H 1
#ifndef _OBSTACK_INTERFACE_VERSION
# define _OBSTACK_INTERFACE_VERSION 2
#endif
#include <stddef.h> /* For size_t and ptrdiff_t. */
#include <string.h> /* For __GNU_LIBRARY__, and memcpy. */
#if _OBSTACK_INTERFACE_VERSION == 1
/* For binary compatibility with obstack version 1, which used "int"
and "long" for these two types. */
# define _OBSTACK_SIZE_T unsigned int
# define _CHUNK_SIZE_T unsigned long
# define _OBSTACK_CAST(type, expr) ((type) (expr))
#else
/* Version 2 with sane types, especially for 64-bit hosts. */
# define _OBSTACK_SIZE_T size_t
# define _CHUNK_SIZE_T size_t
# define _OBSTACK_CAST(type, expr) (expr)
#endif
/* If B is the base of an object addressed by P, return the result of
aligning P to the next multiple of A + 1. B and P must be of type
char *. A + 1 must be a power of 2. */
#define __BPTR_ALIGN(B, P, A) ((B) + (((P) - (B) + (A)) & ~(A)))
/* Similar to __BPTR_ALIGN (B, P, A), except optimize the common case
where pointers can be converted to integers, aligned as integers,
and converted back again. If ptrdiff_t is narrower than a
pointer (e.g., the AS/400), play it safe and compute the alignment
relative to B. Otherwise, use the faster strategy of computing the
alignment relative to 0. */
#define __PTR_ALIGN(B, P, A) \
__BPTR_ALIGN (sizeof (ptrdiff_t) < sizeof (void *) ? (B) : (char *) 0, \
P, A)
#ifndef __attribute_pure__
# define __attribute_pure__ _GL_ATTRIBUTE_PURE
#endif
#ifdef __cplusplus #ifdef __cplusplus
extern "C" { extern "C" {
#endif #endif
/* We use subtraction of (char *) 0 instead of casting to int
because on word-addressable machines a simple cast to int
may ignore the byte-within-word field of the pointer. */
#ifndef __PTR_TO_INT struct _obstack_chunk /* Lives at front of each chunk. */
# define __PTR_TO_INT(P) ((P) - (char *) 0)
#endif
#ifndef __INT_TO_PTR
# define __INT_TO_PTR(P) ((P) + (char *) 0)
#endif
/* We need the type of the resulting object. If __PTRDIFF_TYPE__ is
defined, as with GNU C, use that; that way we don't pollute the
namespace with <stddef.h>'s symbols. Otherwise, if <stddef.h> is
available, include it and use ptrdiff_t. In traditional C, long is
the best that we can do. */
#ifdef __PTRDIFF_TYPE__
# define PTR_INT_TYPE __PTRDIFF_TYPE__
#else
# ifdef HAVE_STDDEF_H
# include <stddef.h>
# define PTR_INT_TYPE ptrdiff_t
# else
# define PTR_INT_TYPE long
# endif
#endif
#if defined _LIBC || defined HAVE_STRING_H
# include <string.h>
# define _obstack_memcpy(To, From, N) memcpy ((To), (From), (N))
#else
# ifdef memcpy
# define _obstack_memcpy(To, From, N) memcpy ((To), (char *)(From), (N))
# else
# define _obstack_memcpy(To, From, N) bcopy ((char *)(From), (To), (N))
# endif
#endif
struct _obstack_chunk /* Lives at front of each chunk. */
{ {
char *limit; /* 1 past end of this chunk */ char *limit; /* 1 past end of this chunk */
struct _obstack_chunk *prev; /* address of prior chunk or NULL */ struct _obstack_chunk *prev; /* address of prior chunk or NULL */
char contents[4]; /* objects begin here */ char contents[4]; /* objects begin here */
}; };
struct obstack /* control current object in current chunk */ struct obstack /* control current object in current chunk */
{ {
long chunk_size; /* preferred size to allocate chunks in */ _CHUNK_SIZE_T chunk_size; /* preferred size to allocate chunks in */
struct _obstack_chunk *chunk; /* address of current struct obstack_chunk */ struct _obstack_chunk *chunk; /* address of current struct obstack_chunk */
char *object_base; /* address of object we are building */ char *object_base; /* address of object we are building */
char *next_free; /* where to add next char to current object */ char *next_free; /* where to add next char to current object */
char *chunk_limit; /* address of char after current chunk */ char *chunk_limit; /* address of char after current chunk */
PTR_INT_TYPE temp; /* Temporary for some macros. */ union
int alignment_mask; /* Mask of alignment for each object. */ {
/* These prototypes vary based on `use_extra_arg', and we use _OBSTACK_SIZE_T i;
casts to the prototypeless function type in all assignments, void *p;
but having prototypes here quiets -Wstrict-prototypes. */ } temp; /* Temporary for some macros. */
struct _obstack_chunk *(*chunkfun) (void *, long); _OBSTACK_SIZE_T alignment_mask; /* Mask of alignment for each object. */
void (*freefun) (void *, struct _obstack_chunk *);
void *extra_arg; /* first arg for chunk alloc/dealloc funcs */ /* These prototypes vary based on 'use_extra_arg'. */
unsigned use_extra_arg:1; /* chunk alloc/dealloc funcs take extra arg */ union
unsigned maybe_empty_object:1;/* There is a possibility that the current {
chunk contains a zero-length object. This void *(*plain) (size_t);
prevents freeing the chunk if we allocate void *(*extra) (void *, size_t);
a bigger chunk to replace it. */ } chunkfun;
unsigned alloc_failed:1; /* No longer used, as we now call the failed union
handler on error, but retained for binary {
compatibility. */ void (*plain) (void *);
void (*extra) (void *, void *);
} freefun;
void *extra_arg; /* first arg for chunk alloc/dealloc funcs */
unsigned use_extra_arg : 1; /* chunk alloc/dealloc funcs take extra arg */
unsigned maybe_empty_object : 1; /* There is a possibility that the current
chunk contains a zero-length object. This
prevents freeing the chunk if we allocate
a bigger chunk to replace it. */
unsigned alloc_failed : 1; /* No longer used, as we now call the failed
handler on error, but retained for binary
compatibility. */
}; };
/* Declare the external functions we use; they are in obstack.c. */ /* Declare the external functions we use; they are in obstack.c. */
extern void _obstack_newchunk (struct obstack *, int); extern void _obstack_newchunk (struct obstack *, _OBSTACK_SIZE_T);
extern void _obstack_free (struct obstack *, void *); extern void _obstack_free (struct obstack *, void *);
extern int _obstack_begin (struct obstack *, int, int, extern int _obstack_begin (struct obstack *,
void *(*) (long), void (*) (void *)); _OBSTACK_SIZE_T, _OBSTACK_SIZE_T,
extern int _obstack_begin_1 (struct obstack *, int, int, void *(*) (size_t), void (*) (void *));
void *(*) (void *, long), extern int _obstack_begin_1 (struct obstack *,
void (*) (void *, void *), void *); _OBSTACK_SIZE_T, _OBSTACK_SIZE_T,
extern int _obstack_memory_used (struct obstack *); void *(*) (void *, size_t),
void (*) (void *, void *), void *);
/* Do the function-declarations after the structs extern _OBSTACK_SIZE_T _obstack_memory_used (struct obstack *)
but before defining the macros. */ __attribute_pure__;
void obstack_init (struct obstack *obstack);
void * obstack_alloc (struct obstack *obstack, int size); /* Error handler called when 'obstack_chunk_alloc' failed to allocate
more memory. This can be set to a user defined function which
void * obstack_copy (struct obstack *obstack, void *address, int size); should either abort gracefully or use longjump - but shouldn't
void * obstack_copy0 (struct obstack *obstack, void *address, int size); return. The default action is to print a message and abort. */
void obstack_free (struct obstack *obstack, void *block);
void obstack_blank (struct obstack *obstack, int size);
void obstack_grow (struct obstack *obstack, void *data, int size);
void obstack_grow0 (struct obstack *obstack, void *data, int size);
void obstack_1grow (struct obstack *obstack, int data_char);
void obstack_ptr_grow (struct obstack *obstack, void *data);
void obstack_int_grow (struct obstack *obstack, int data);
void * obstack_finish (struct obstack *obstack);
int obstack_object_size (struct obstack *obstack);
int obstack_room (struct obstack *obstack);
void obstack_make_room (struct obstack *obstack, int size);
void obstack_1grow_fast (struct obstack *obstack, int data_char);
void obstack_ptr_grow_fast (struct obstack *obstack, void *data);
void obstack_int_grow_fast (struct obstack *obstack, int data);
void obstack_blank_fast (struct obstack *obstack, int size);
void * obstack_base (struct obstack *obstack);
void * obstack_next_free (struct obstack *obstack);
int obstack_alignment_mask (struct obstack *obstack);
int obstack_chunk_size (struct obstack *obstack);
int obstack_memory_used (struct obstack *obstack);
/* Error handler called when `obstack_chunk_alloc' failed to allocate
more memory. This can be set to a user defined function. The
default action is to print a message and abort. */
extern void (*obstack_alloc_failed_handler) (void); extern void (*obstack_alloc_failed_handler) (void);
/* Exit value used when `print_and_abort' is used. */ /* Exit value used when 'print_and_abort' is used. */
extern int obstack_exit_failure; extern int obstack_exit_failure;
/* Pointer to beginning of object being allocated or to be allocated next. /* Pointer to beginning of object being allocated or to be allocated next.
Note that this might not be the final address of the object Note that this might not be the final address of the object
because a new chunk might be needed to hold the final size. */ because a new chunk might be needed to hold the final size. */
#define obstack_base(h) ((h)->object_base) #define obstack_base(h) ((void *) (h)->object_base)
/* Size for allocating ordinary chunks. */ /* Size for allocating ordinary chunks. */
@ -253,203 +229,210 @@ extern int obstack_exit_failure;
/* Pointer to next byte not yet allocated in current chunk. */ /* Pointer to next byte not yet allocated in current chunk. */
#define obstack_next_free(h) ((h)->next_free) #define obstack_next_free(h) ((void *) (h)->next_free)
/* Mask specifying low bits that should be clear in address of an object. */ /* Mask specifying low bits that should be clear in address of an object. */
#define obstack_alignment_mask(h) ((h)->alignment_mask) #define obstack_alignment_mask(h) ((h)->alignment_mask)
/* To prevent prototype warnings provide complete argument list in /* To prevent prototype warnings provide complete argument list. */
standard C version. */ #define obstack_init(h) \
# define obstack_init(h) \ _obstack_begin ((h), 0, 0, \
_obstack_begin ((h), 0, 0, \ _OBSTACK_CAST (void *(*) (size_t), obstack_chunk_alloc), \
(void *(*) (long)) obstack_chunk_alloc, (void (*) (void *)) obstack_chunk_free) _OBSTACK_CAST (void (*) (void *), obstack_chunk_free))
# define obstack_begin(h, size) \ #define obstack_begin(h, size) \
_obstack_begin ((h), (size), 0, \ _obstack_begin ((h), (size), 0, \
(void *(*) (long)) obstack_chunk_alloc, (void (*) (void *)) obstack_chunk_free) _OBSTACK_CAST (void *(*) (size_t), obstack_chunk_alloc), \
_OBSTACK_CAST (void (*) (void *), obstack_chunk_free))
# define obstack_specify_allocation(h, size, alignment, chunkfun, freefun) \ #define obstack_specify_allocation(h, size, alignment, chunkfun, freefun) \
_obstack_begin ((h), (size), (alignment), \ _obstack_begin ((h), (size), (alignment), \
(void *(*) (long)) (chunkfun), (void (*) (void *)) (freefun)) _OBSTACK_CAST (void *(*) (size_t), chunkfun), \
_OBSTACK_CAST (void (*) (void *), freefun))
# define obstack_specify_allocation_with_arg(h, size, alignment, chunkfun, freefun, arg) \ #define obstack_specify_allocation_with_arg(h, size, alignment, chunkfun, freefun, arg) \
_obstack_begin_1 ((h), (size), (alignment), \ _obstack_begin_1 ((h), (size), (alignment), \
(void *(*) (void *, long)) (chunkfun), \ _OBSTACK_CAST (void *(*) (void *, size_t), chunkfun), \
(void (*) (void *, void *)) (freefun), (arg)) _OBSTACK_CAST (void (*) (void *, void *), freefun), arg)
# define obstack_chunkfun(h, newchunkfun) \ #define obstack_chunkfun(h, newchunkfun) \
((h) -> chunkfun = (struct _obstack_chunk *(*)(void *, long)) (newchunkfun)) ((void) ((h)->chunkfun.extra = (void *(*) (void *, size_t)) (newchunkfun)))
# define obstack_freefun(h, newfreefun) \ #define obstack_freefun(h, newfreefun) \
((h) -> freefun = (void (*)(void *, struct _obstack_chunk *)) (newfreefun)) ((void) ((h)->freefun.extra = (void *(*) (void *, void *)) (newfreefun)))
#define obstack_1grow_fast(h,achar) (*((h)->next_free)++ = (achar)) #define obstack_1grow_fast(h, achar) ((void) (*((h)->next_free)++ = (achar)))
#define obstack_blank_fast(h,n) ((h)->next_free += (n)) #define obstack_blank_fast(h, n) ((void) ((h)->next_free += (n)))
#define obstack_memory_used(h) _obstack_memory_used (h) #define obstack_memory_used(h) _obstack_memory_used (h)
#if defined __GNUC__ && defined __STDC__ && __STDC__ #if defined __GNUC__
/* NextStep 2.0 cc is really gcc 1.93 but it defines __GNUC__ = 2 and # if !defined __GNUC_MINOR__ || __GNUC__ * 1000 + __GNUC_MINOR__ < 2008
does not implement __extension__. But that compiler doesn't define
__GNUC_MINOR__. */
# if __GNUC__ < 2 || (__NeXT__ && !__GNUC_MINOR__)
# define __extension__ # define __extension__
# endif # endif
/* For GNU C, if not -traditional, /* For GNU C, if not -traditional,
we can define these macros to compute all args only once we can define these macros to compute all args only once
without using a global variable. without using a global variable.
Also, we can avoid using the `temp' slot, to make faster code. */ Also, we can avoid using the 'temp' slot, to make faster code. */
# define obstack_object_size(OBSTACK) \ # define obstack_object_size(OBSTACK) \
__extension__ \ __extension__ \
({ struct obstack *__o = (OBSTACK); \ ({ struct obstack const *__o = (OBSTACK); \
(unsigned) (__o->next_free - __o->object_base); }) (_OBSTACK_SIZE_T) (__o->next_free - __o->object_base); })
# define obstack_room(OBSTACK) \ /* The local variable is named __o1 to avoid a shadowed variable
__extension__ \ warning when invoked from other obstack macros. */
({ struct obstack *__o = (OBSTACK); \ # define obstack_room(OBSTACK) \
(unsigned) (__o->chunk_limit - __o->next_free); }) __extension__ \
({ struct obstack const *__o1 = (OBSTACK); \
(_OBSTACK_SIZE_T) (__o1->chunk_limit - __o1->next_free); })
# define obstack_make_room(OBSTACK,length) \ # define obstack_make_room(OBSTACK, length) \
__extension__ \ __extension__ \
({ struct obstack *__o = (OBSTACK); \ ({ struct obstack *__o = (OBSTACK); \
int __len = (length); \ _OBSTACK_SIZE_T __len = (length); \
if (__o->chunk_limit - __o->next_free < __len) \ if (obstack_room (__o) < __len) \
_obstack_newchunk (__o, __len); \ _obstack_newchunk (__o, __len); \
(void) 0; }) (void) 0; })
# define obstack_empty_p(OBSTACK) \ # define obstack_empty_p(OBSTACK) \
__extension__ \ __extension__ \
({ struct obstack *__o = (OBSTACK); \ ({ struct obstack const *__o = (OBSTACK); \
(__o->chunk->prev == 0 && __o->next_free - __o->chunk->contents == 0); }) (__o->chunk->prev == 0 \
&& __o->next_free == __PTR_ALIGN ((char *) __o->chunk, \
__o->chunk->contents, \
__o->alignment_mask)); })
# define obstack_grow(OBSTACK,where,length) \ # define obstack_grow(OBSTACK, where, length) \
__extension__ \ __extension__ \
({ struct obstack *__o = (OBSTACK); \ ({ struct obstack *__o = (OBSTACK); \
int __len = (length); \ _OBSTACK_SIZE_T __len = (length); \
if (__o->next_free + __len > __o->chunk_limit) \ if (obstack_room (__o) < __len) \
_obstack_newchunk (__o, __len); \ _obstack_newchunk (__o, __len); \
_obstack_memcpy (__o->next_free, (where), __len); \ memcpy (__o->next_free, where, __len); \
__o->next_free += __len; \ __o->next_free += __len; \
(void) 0; }) (void) 0; })
# define obstack_grow0(OBSTACK,where,length) \ # define obstack_grow0(OBSTACK, where, length) \
__extension__ \ __extension__ \
({ struct obstack *__o = (OBSTACK); \ ({ struct obstack *__o = (OBSTACK); \
int __len = (length); \ _OBSTACK_SIZE_T __len = (length); \
if (__o->next_free + __len + 1 > __o->chunk_limit) \ if (obstack_room (__o) < __len + 1) \
_obstack_newchunk (__o, __len + 1); \ _obstack_newchunk (__o, __len + 1); \
_obstack_memcpy (__o->next_free, (where), __len); \ memcpy (__o->next_free, where, __len); \
__o->next_free += __len; \ __o->next_free += __len; \
*(__o->next_free)++ = 0; \ *(__o->next_free)++ = 0; \
(void) 0; }) (void) 0; })
# define obstack_1grow(OBSTACK,datum) \ # define obstack_1grow(OBSTACK, datum) \
__extension__ \ __extension__ \
({ struct obstack *__o = (OBSTACK); \ ({ struct obstack *__o = (OBSTACK); \
if (__o->next_free + 1 > __o->chunk_limit) \ if (obstack_room (__o) < 1) \
_obstack_newchunk (__o, 1); \ _obstack_newchunk (__o, 1); \
obstack_1grow_fast (__o, datum); \ obstack_1grow_fast (__o, datum); })
(void) 0; })
/* These assume that the obstack alignment is good enough for pointers or ints, /* These assume that the obstack alignment is good enough for pointers
and that the data added so far to the current object or ints, and that the data added so far to the current object
shares that much alignment. */ shares that much alignment. */
# define obstack_ptr_grow(OBSTACK,datum) \ # define obstack_ptr_grow(OBSTACK, datum) \
__extension__ \ __extension__ \
({ struct obstack *__o = (OBSTACK); \ ({ struct obstack *__o = (OBSTACK); \
if (__o->next_free + sizeof (void *) > __o->chunk_limit) \ if (obstack_room (__o) < sizeof (void *)) \
_obstack_newchunk (__o, sizeof (void *)); \ _obstack_newchunk (__o, sizeof (void *)); \
obstack_ptr_grow_fast (__o, datum); }) obstack_ptr_grow_fast (__o, datum); })
# define obstack_int_grow(OBSTACK,datum) \ # define obstack_int_grow(OBSTACK, datum) \
__extension__ \ __extension__ \
({ struct obstack *__o = (OBSTACK); \ ({ struct obstack *__o = (OBSTACK); \
if (__o->next_free + sizeof (int) > __o->chunk_limit) \ if (obstack_room (__o) < sizeof (int)) \
_obstack_newchunk (__o, sizeof (int)); \ _obstack_newchunk (__o, sizeof (int)); \
obstack_int_grow_fast (__o, datum); }) obstack_int_grow_fast (__o, datum); })
# define obstack_ptr_grow_fast(OBSTACK,aptr) \ # define obstack_ptr_grow_fast(OBSTACK, aptr) \
__extension__ \ __extension__ \
({ struct obstack *__o1 = (OBSTACK); \ ({ struct obstack *__o1 = (OBSTACK); \
*(const void **) __o1->next_free = (aptr); \ void *__p1 = __o1->next_free; \
__o1->next_free += sizeof (const void *); \ *(const void **) __p1 = (aptr); \
(void) 0; }) __o1->next_free += sizeof (const void *); \
(void) 0; })
# define obstack_int_grow_fast(OBSTACK,aint) \ # define obstack_int_grow_fast(OBSTACK, aint) \
__extension__ \ __extension__ \
({ struct obstack *__o1 = (OBSTACK); \ ({ struct obstack *__o1 = (OBSTACK); \
*(int *) __o1->next_free = (aint); \ void *__p1 = __o1->next_free; \
__o1->next_free += sizeof (int); \ *(int *) __p1 = (aint); \
(void) 0; }) __o1->next_free += sizeof (int); \
(void) 0; })
# define obstack_blank(OBSTACK,length) \ # define obstack_blank(OBSTACK, length) \
__extension__ \ __extension__ \
({ struct obstack *__o = (OBSTACK); \ ({ struct obstack *__o = (OBSTACK); \
int __len = (length); \ _OBSTACK_SIZE_T __len = (length); \
if (__o->chunk_limit - __o->next_free < __len) \ if (obstack_room (__o) < __len) \
_obstack_newchunk (__o, __len); \ _obstack_newchunk (__o, __len); \
obstack_blank_fast (__o, __len); \ obstack_blank_fast (__o, __len); })
(void) 0; })
# define obstack_alloc(OBSTACK,length) \ # define obstack_alloc(OBSTACK, length) \
__extension__ \ __extension__ \
({ struct obstack *__h = (OBSTACK); \ ({ struct obstack *__h = (OBSTACK); \
obstack_blank (__h, (length)); \ obstack_blank (__h, (length)); \
obstack_finish (__h); }) obstack_finish (__h); })
# define obstack_copy(OBSTACK,where,length) \ # define obstack_copy(OBSTACK, where, length) \
__extension__ \ __extension__ \
({ struct obstack *__h = (OBSTACK); \ ({ struct obstack *__h = (OBSTACK); \
obstack_grow (__h, (where), (length)); \ obstack_grow (__h, (where), (length)); \
obstack_finish (__h); }) obstack_finish (__h); })
# define obstack_copy0(OBSTACK,where,length) \ # define obstack_copy0(OBSTACK, where, length) \
__extension__ \ __extension__ \
({ struct obstack *__h = (OBSTACK); \ ({ struct obstack *__h = (OBSTACK); \
obstack_grow0 (__h, (where), (length)); \ obstack_grow0 (__h, (where), (length)); \
obstack_finish (__h); }) obstack_finish (__h); })
/* The local variable is named __o1 to avoid a name conflict /* The local variable is named __o1 to avoid a shadowed variable
when obstack_blank is called. */ warning when invoked from other obstack macros, typically obstack_free. */
# define obstack_finish(OBSTACK) \ # define obstack_finish(OBSTACK) \
__extension__ \ __extension__ \
({ struct obstack *__o1 = (OBSTACK); \ ({ struct obstack *__o1 = (OBSTACK); \
void *value; \ void *__value = (void *) __o1->object_base; \
value = (void *) __o1->object_base; \ if (__o1->next_free == __value) \
if (__o1->next_free == value) \ __o1->maybe_empty_object = 1; \
__o1->maybe_empty_object = 1; \ __o1->next_free \
__o1->next_free \ = __PTR_ALIGN (__o1->object_base, __o1->next_free, \
= __INT_TO_PTR ((__PTR_TO_INT (__o1->next_free)+__o1->alignment_mask)\ __o1->alignment_mask); \
& ~ (__o1->alignment_mask)); \ if ((size_t) (__o1->next_free - (char *) __o1->chunk) \
if (__o1->next_free - (char *)__o1->chunk \ > (size_t) (__o1->chunk_limit - (char *) __o1->chunk)) \
> __o1->chunk_limit - (char *)__o1->chunk) \ __o1->next_free = __o1->chunk_limit; \
__o1->next_free = __o1->chunk_limit; \ __o1->object_base = __o1->next_free; \
__o1->object_base = __o1->next_free; \ __value; })
value; })
# define obstack_free(OBSTACK, OBJ) \ # define obstack_free(OBSTACK, OBJ) \
__extension__ \ __extension__ \
({ struct obstack *__o = (OBSTACK); \ ({ struct obstack *__o = (OBSTACK); \
void *__obj = (void *) (OBJ); \ void *__obj = (void *) (OBJ); \
if (__obj > (void *)__o->chunk && __obj < (void *)__o->chunk_limit) \ if (__obj > (void *) __o->chunk && __obj < (void *) __o->chunk_limit) \
__o->next_free = __o->object_base = (char *) __obj; \ __o->next_free = __o->object_base = (char *) __obj; \
else (obstack_free) (__o, __obj); }) else \
_obstack_free (__o, __obj); })
#else /* not __GNUC__ or not __STDC__ */
# define obstack_object_size(h) \ #else /* not __GNUC__ */
(unsigned) ((h)->next_free - (h)->object_base)
# define obstack_room(h) \ # define obstack_object_size(h) \
(unsigned) ((h)->chunk_limit - (h)->next_free) ((_OBSTACK_SIZE_T) ((h)->next_free - (h)->object_base))
# define obstack_empty_p(h) \ # define obstack_room(h) \
((h)->chunk->prev == 0 && (h)->next_free - (h)->chunk->contents == 0) ((_OBSTACK_SIZE_T) ((h)->chunk_limit - (h)->next_free))
# define obstack_empty_p(h) \
((h)->chunk->prev == 0 \
&& (h)->next_free == __PTR_ALIGN ((char *) (h)->chunk, \
(h)->chunk->contents, \
(h)->alignment_mask))
/* Note that the call to _obstack_newchunk is enclosed in (..., 0) /* Note that the call to _obstack_newchunk is enclosed in (..., 0)
so that we can avoid having void expressions so that we can avoid having void expressions
@ -457,87 +440,92 @@ __extension__ \
Casting the third operand to void was tried before, Casting the third operand to void was tried before,
but some compilers won't accept it. */ but some compilers won't accept it. */
# define obstack_make_room(h,length) \ # define obstack_make_room(h, length) \
( (h)->temp = (length), \ ((h)->temp.i = (length), \
(((h)->next_free + (h)->temp > (h)->chunk_limit) \ ((obstack_room (h) < (h)->temp.i) \
? (_obstack_newchunk ((h), (h)->temp), 0) : 0)) ? (_obstack_newchunk (h, (h)->temp.i), 0) : 0), \
(void) 0)
# define obstack_grow(h,where,length) \ # define obstack_grow(h, where, length) \
( (h)->temp = (length), \ ((h)->temp.i = (length), \
(((h)->next_free + (h)->temp > (h)->chunk_limit) \ ((obstack_room (h) < (h)->temp.i) \
? (_obstack_newchunk ((h), (h)->temp), 0) : 0), \ ? (_obstack_newchunk ((h), (h)->temp.i), 0) : 0), \
_obstack_memcpy ((h)->next_free, (where), (h)->temp), \ memcpy ((h)->next_free, where, (h)->temp.i), \
(h)->next_free += (h)->temp) (h)->next_free += (h)->temp.i, \
(void) 0)
# define obstack_grow0(h,where,length) \ # define obstack_grow0(h, where, length) \
( (h)->temp = (length), \ ((h)->temp.i = (length), \
(((h)->next_free + (h)->temp + 1 > (h)->chunk_limit) \ ((obstack_room (h) < (h)->temp.i + 1) \
? (_obstack_newchunk ((h), (h)->temp + 1), 0) : 0), \ ? (_obstack_newchunk ((h), (h)->temp.i + 1), 0) : 0), \
_obstack_memcpy ((h)->next_free, (where), (h)->temp), \ memcpy ((h)->next_free, where, (h)->temp.i), \
(h)->next_free += (h)->temp, \ (h)->next_free += (h)->temp.i, \
*((h)->next_free)++ = 0) *((h)->next_free)++ = 0, \
(void) 0)
# define obstack_1grow(h,datum) \ # define obstack_1grow(h, datum) \
( (((h)->next_free + 1 > (h)->chunk_limit) \ (((obstack_room (h) < 1) \
? (_obstack_newchunk ((h), 1), 0) : 0), \ ? (_obstack_newchunk ((h), 1), 0) : 0), \
obstack_1grow_fast (h, datum)) obstack_1grow_fast (h, datum))
# define obstack_ptr_grow(h,datum) \ # define obstack_ptr_grow(h, datum) \
( (((h)->next_free + sizeof (char *) > (h)->chunk_limit) \ (((obstack_room (h) < sizeof (char *)) \
? (_obstack_newchunk ((h), sizeof (char *)), 0) : 0), \ ? (_obstack_newchunk ((h), sizeof (char *)), 0) : 0), \
obstack_ptr_grow_fast (h, datum)) obstack_ptr_grow_fast (h, datum))
# define obstack_int_grow(h,datum) \ # define obstack_int_grow(h, datum) \
( (((h)->next_free + sizeof (int) > (h)->chunk_limit) \ (((obstack_room (h) < sizeof (int)) \
? (_obstack_newchunk ((h), sizeof (int)), 0) : 0), \ ? (_obstack_newchunk ((h), sizeof (int)), 0) : 0), \
obstack_int_grow_fast (h, datum)) obstack_int_grow_fast (h, datum))
# define obstack_ptr_grow_fast(h,aptr) \ # define obstack_ptr_grow_fast(h, aptr) \
(((const void **) ((h)->next_free += sizeof (void *)))[-1] = (aptr)) (((const void **) ((h)->next_free += sizeof (void *)))[-1] = (aptr), \
(void) 0)
# define obstack_int_grow_fast(h,aint) \ # define obstack_int_grow_fast(h, aint) \
(((int *) ((h)->next_free += sizeof (int)))[-1] = (aptr)) (((int *) ((h)->next_free += sizeof (int)))[-1] = (aint), \
(void) 0)
# define obstack_blank(h,length) \ # define obstack_blank(h, length) \
( (h)->temp = (length), \ ((h)->temp.i = (length), \
(((h)->chunk_limit - (h)->next_free < (h)->temp) \ ((obstack_room (h) < (h)->temp.i) \
? (_obstack_newchunk ((h), (h)->temp), 0) : 0), \ ? (_obstack_newchunk ((h), (h)->temp.i), 0) : 0), \
obstack_blank_fast (h, (h)->temp)) obstack_blank_fast (h, (h)->temp.i))
# define obstack_alloc(h,length) \ # define obstack_alloc(h, length) \
(obstack_blank ((h), (length)), obstack_finish ((h))) (obstack_blank ((h), (length)), obstack_finish ((h)))
# define obstack_copy(h,where,length) \ # define obstack_copy(h, where, length) \
(obstack_grow ((h), (where), (length)), obstack_finish ((h))) (obstack_grow ((h), (where), (length)), obstack_finish ((h)))
# define obstack_copy0(h,where,length) \ # define obstack_copy0(h, where, length) \
(obstack_grow0 ((h), (where), (length)), obstack_finish ((h))) (obstack_grow0 ((h), (where), (length)), obstack_finish ((h)))
# define obstack_finish(h) \ # define obstack_finish(h) \
( ((h)->next_free == (h)->object_base \ (((h)->next_free == (h)->object_base \
? (((h)->maybe_empty_object = 1), 0) \ ? (((h)->maybe_empty_object = 1), 0) \
: 0), \ : 0), \
(h)->temp = __PTR_TO_INT ((h)->object_base), \ (h)->temp.p = (h)->object_base, \
(h)->next_free \ (h)->next_free \
= __INT_TO_PTR ((__PTR_TO_INT ((h)->next_free)+(h)->alignment_mask) \ = __PTR_ALIGN ((h)->object_base, (h)->next_free, \
& ~ ((h)->alignment_mask)), \ (h)->alignment_mask), \
(((h)->next_free - (char *) (h)->chunk \ (((size_t) ((h)->next_free - (char *) (h)->chunk) \
> (h)->chunk_limit - (char *) (h)->chunk) \ > (size_t) ((h)->chunk_limit - (char *) (h)->chunk)) \
? ((h)->next_free = (h)->chunk_limit) : 0), \ ? ((h)->next_free = (h)->chunk_limit) : 0), \
(h)->object_base = (h)->next_free, \ (h)->object_base = (h)->next_free, \
(void *) __INT_TO_PTR ((h)->temp)) (h)->temp.p)
# define obstack_free(h,obj) \ # define obstack_free(h, obj) \
( (h)->temp = (char *) (obj) - (char *) (h)->chunk, \ ((h)->temp.p = (void *) (obj), \
(((h)->temp > 0 && (h)->temp < (h)->chunk_limit - (char *) (h)->chunk)\ (((h)->temp.p > (void *) (h)->chunk \
? (((h)->next_free = (h)->object_base \ && (h)->temp.p < (void *) (h)->chunk_limit) \
= (h)->temp + (char *) (h)->chunk), 0) \ ? (void) ((h)->next_free = (h)->object_base = (char *) (h)->temp.p) \
: ((obstack_free) ((h), (h)->temp + (char *) (h)->chunk), 0))) : _obstack_free ((h), (h)->temp.p)))
#endif /* not __GNUC__ or not __STDC__ */ #endif /* not __GNUC__ */
#ifdef __cplusplus #ifdef __cplusplus
} /* C++ */ } /* C++ */
#endif #endif
#endif /* obstack.h */ #endif /* _OBSTACK_H */

6
libiberty/ChangeLog
View File

@ -1,3 +1,9 @@
2015-11-09 Alan Modra <amodra@gmail.com>
PR gdb/17133
* obstack.c: Import current gnulib file.
* obstacks.texi: Updated doc, from glibc's manual/memory.texi.
2015-11-06 Joel Brobecker <brobecker@adacore.com> 2015-11-06 Joel Brobecker <brobecker@adacore.com>
* configure.ac: Set AC_CV_FUNC_GETPAGESIZE to "yes" on * configure.ac: Set AC_CV_FUNC_GETPAGESIZE to "yes" on

553
libiberty/obstack.c
View File

@ -1,35 +1,32 @@
/* 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-2015 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library 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 2.1 of the License, or (at your option) any later version.
NOTE: This source is derived from an old version taken from the GNU C The GNU C Library is distributed in the hope that it will be useful,
Library (glibc).
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 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
GNU General Public License for more details. Lesser 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 Lesser General Public
along with this program; if not, write to the Free Software License along with the GNU C Library; if not, see
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, <http://www.gnu.org/licenses/>. */
USA. */
#ifdef HAVE_CONFIG_H
#include <config.h> #ifdef _LIBC
# include <obstack.h>
#else
# include <config.h>
# include "obstack.h"
#endif #endif
#include "obstack.h" /* NOTE BEFORE MODIFYING THIS FILE: _OBSTACK_INTERFACE_VERSION in
obstack.h must be incremented whenever callers compiled using an old
/* NOTE BEFORE MODIFYING THIS FILE: This version number must be obstack.h can no longer properly call the functions in this file. */
incremented whenever callers compiled using an old obstack.h can no
longer properly call the functions in this obstack.c. */
#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
@ -37,144 +34,111 @@
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. */
#if !defined _LIBC && defined __GNU_LIBRARY__ && __GNU_LIBRARY__ > 1
#include <stdio.h> /* Random thing to get __GNU_LIBRARY__. */ # include <gnu-versions.h>
#if !defined (_LIBC) && defined (__GNU_LIBRARY__) && __GNU_LIBRARY__ > 1 # if (_GNU_OBSTACK_INTERFACE_VERSION == _OBSTACK_INTERFACE_VERSION \
#include <gnu-versions.h> || (_GNU_OBSTACK_INTERFACE_VERSION == 1 \
#if _GNU_OBSTACK_INTERFACE_VERSION == OBSTACK_INTERFACE_VERSION && _OBSTACK_INTERFACE_VERSION == 2 \
#define ELIDE_CODE && defined SIZEOF_INT && defined SIZEOF_SIZE_T \
#endif && SIZEOF_INT == SIZEOF_SIZE_T))
# define _OBSTACK_ELIDE_CODE
# endif
#endif #endif
#ifndef _OBSTACK_ELIDE_CODE
/* If GCC, or if an oddball (testing?) host that #defines __alignof__,
use the already-supplied __alignof__. Otherwise, this must be Gnulib
(as glibc assumes GCC); defer to Gnulib's alignof_type. */
# if !defined __GNUC__ && !defined __alignof__
# include <alignof.h>
# define __alignof__(type) alignof_type (type)
# endif
# include <stdlib.h>
# include <stdint.h>
#ifndef ELIDE_CODE # ifndef MAX
# define MAX(a,b) ((a) > (b) ? (a) : (b))
# endif
#define POINTER void *
/* Determine default alignment. */ /* Determine default alignment. */
struct fooalign {char x; double d;};
#define DEFAULT_ALIGNMENT \
((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;};
#define DEFAULT_ROUNDING (sizeof (union fooround))
/* When we copy a long block of data, this is the unit to do it with. DEFAULT_ALIGNMENT cannot be an enum constant; see gnulib's alignof.h. */
On some machines, copying successive ints does not work; #define DEFAULT_ALIGNMENT MAX (__alignof__ (long double), \
in such a case, redefine COPYING_UNIT to `long' (if that works) MAX (__alignof__ (uintmax_t), \
or `char' as a last resort. */ __alignof__ (void *)))
#ifndef COPYING_UNIT #define DEFAULT_ROUNDING MAX (sizeof (long double), \
#define COPYING_UNIT int MAX (sizeof (uintmax_t), \
#endif sizeof (void *)))
/* Call functions with either the traditional malloc/free calling
interface, or the mmalloc/mfree interface (that adds an extra first
argument), based on the value of use_extra_arg. */
static void *
call_chunkfun (struct obstack *h, size_t size)
{
if (h->use_extra_arg)
return h->chunkfun.extra (h->extra_arg, size);
else
return h->chunkfun.plain (size);
}
static void
call_freefun (struct obstack *h, void *old_chunk)
{
if (h->use_extra_arg)
h->freefun.extra (h->extra_arg, old_chunk);
else
h->freefun.plain (old_chunk);
}
/* The functions allocating more room by calling `obstack_chunk_alloc'
jump to the handler pointed to by `obstack_alloc_failed_handler'.
This variable by default points to the internal function
`print_and_abort'. */
static void print_and_abort (void);
void (*obstack_alloc_failed_handler) (void) = print_and_abort;
/* Exit value used when `print_and_abort' is used. */
#if defined __GNU_LIBRARY__ || defined HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifndef EXIT_FAILURE
#define EXIT_FAILURE 1
#endif
int obstack_exit_failure = EXIT_FAILURE;
/* The non-GNU-C macros copy the obstack into this global variable
to avoid multiple evaluation. */
struct obstack *_obstack;
/* Define a macro that either calls functions with the traditional malloc/free
calling interface, or calls functions with the mmalloc/mfree interface
(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,
do not allow (expr) ? void : void. */
#if defined (__STDC__) && __STDC__
#define CALL_CHUNKFUN(h, size) \
(((h) -> use_extra_arg) \
? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
: (*(struct _obstack_chunk *(*) (long)) (h)->chunkfun) ((size)))
#define CALL_FREEFUN(h, old_chunk) \
do { \
if ((h) -> use_extra_arg) \
(*(h)->freefun) ((h)->extra_arg, (old_chunk)); \
else \
(*(void (*) (void *)) (h)->freefun) ((old_chunk)); \
} while (0)
#else
#define CALL_CHUNKFUN(h, size) \
(((h) -> use_extra_arg) \
? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
: (*(struct _obstack_chunk *(*) ()) (h)->chunkfun) ((size)))
#define CALL_FREEFUN(h, old_chunk) \
do { \
if ((h) -> use_extra_arg) \
(*(h)->freefun) ((h)->extra_arg, (old_chunk)); \
else \
(*(void (*) ()) (h)->freefun) ((old_chunk)); \
} while (0)
#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,
and FREEFUN the function to free them.
Return nonzero if successful, zero if out of memory. Return nonzero if successful, calls obstack_alloc_failed_handler if
To recover from an out of memory error, allocation fails. */
free up some memory, then call this again. */
int static int
_obstack_begin (struct obstack *h, int size, int alignment, _obstack_begin_worker (struct obstack *h,
POINTER (*chunkfun) (long), void (*freefun) (void *)) _OBSTACK_SIZE_T size, _OBSTACK_SIZE_T alignment)
{ {
register struct _obstack_chunk *chunk; /* points to new chunk */ struct _obstack_chunk *chunk; /* points to new chunk */
if (alignment == 0) if (alignment == 0)
alignment = (int) DEFAULT_ALIGNMENT; alignment = 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->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;
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 = __PTR_ALIGN ((char *) chunk, chunk->contents,
h->chunk_limit = chunk->limit alignment - 1);
= (char *) chunk + h->chunk_size; h->chunk_limit = chunk->limit = (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;
@ -183,49 +147,29 @@ _obstack_begin (struct obstack *h, int size, int alignment,
} }
int int
_obstack_begin_1 (struct obstack *h, int size, int alignment, _obstack_begin (struct obstack *h,
POINTER (*chunkfun) (POINTER, long), _OBSTACK_SIZE_T size, _OBSTACK_SIZE_T alignment,
void (*freefun) (POINTER, POINTER), POINTER arg) void *(*chunkfun) (size_t),
void (*freefun) (void *))
{ {
register struct _obstack_chunk *chunk; /* points to new chunk */ h->chunkfun.plain = chunkfun;
h->freefun.plain = freefun;
h->use_extra_arg = 0;
return _obstack_begin_worker (h, size, alignment);
}
if (alignment == 0) int
alignment = (int) DEFAULT_ALIGNMENT; _obstack_begin_1 (struct obstack *h,
if (size == 0) _OBSTACK_SIZE_T size, _OBSTACK_SIZE_T alignment,
/* Default size is what GNU malloc can fit in a 4096-byte block. */ void *(*chunkfun) (void *, size_t),
{ void (*freefun) (void *, void *),
/* 12 is sizeof (mhead) and 4 is EXTRA from GNU malloc. void *arg)
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 h->chunkfun.extra = chunkfun;
and we used a larger request, a whole extra 4096 bytes would be h->freefun.extra = freefun;
allocated.
These number are irrelevant to the new GNU malloc. I suspect it is
less sensitive to the size of the request. */
int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1))
+ 4 + DEFAULT_ROUNDING - 1)
& ~(DEFAULT_ROUNDING - 1));
size = 4096 - extra;
}
h->chunkfun = (struct _obstack_chunk * (*)(void *,long)) chunkfun;
h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun;
h->chunk_size = size;
h->alignment_mask = alignment - 1;
h->extra_arg = arg; h->extra_arg = arg;
h->use_extra_arg = 1; h->use_extra_arg = 1;
return _obstack_begin_worker (h, size, alignment);
chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
if (!chunk)
(*obstack_alloc_failed_handler) ();
h->next_free = h->object_base = chunk->contents;
h->chunk_limit = chunk->limit
= (char *) chunk + h->chunk_size;
chunk->prev = 0;
/* The initial chunk now contains no empty object. */
h->maybe_empty_object = 0;
h->alloc_failed = 0;
return 1;
} }
/* Allocate a new current chunk for the obstack *H /* Allocate a new current chunk for the obstack *H
@ -235,58 +179,51 @@ _obstack_begin_1 (struct obstack *h, int size, int alignment,
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, _OBSTACK_SIZE_T length)
{ {
register struct _obstack_chunk *old_chunk = h->chunk; struct _obstack_chunk *old_chunk = h->chunk;
register struct _obstack_chunk *new_chunk; struct _obstack_chunk *new_chunk = 0;
register long new_size; size_t obj_size = h->next_free - h->object_base;
register long obj_size = h->next_free - h->object_base; char *object_base;
register long i;
long already;
/* Compute size for new chunk. */ /* Compute size for new chunk. */
new_size = (obj_size + length) + (obj_size >> 3) + 100; size_t sum1 = obj_size + length;
size_t sum2 = sum1 + h->alignment_mask;
size_t new_size = sum2 + (obj_size >> 3) + 100;
if (new_size < sum2)
new_size = sum2;
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); if (obj_size <= sum1 && sum1 <= sum2)
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. /* Compute an aligned object_base in the new chunk */
Word at a time is fast and is safe if the object object_base =
is sufficiently aligned. */ __PTR_ALIGN ((char *) new_chunk, new_chunk->contents, h->alignment_mask);
if (h->alignment_mask + 1 >= DEFAULT_ALIGNMENT)
{ /* Move the existing object to the new chunk. */
for (i = obj_size / sizeof (COPYING_UNIT) - 1; memcpy (object_base, h->object_base, obj_size);
i >= 0; i--)
((COPYING_UNIT *)new_chunk->contents)[i]
= ((COPYING_UNIT *)h->object_base)[i];
/* We used to copy the odd few remaining bytes as one extra COPYING_UNIT,
but that can cross a page boundary on a machine
which does not do strict alignment for COPYING_UNITS. */
already = obj_size / sizeof (COPYING_UNIT) * sizeof (COPYING_UNIT);
}
else
already = 0;
/* Copy remaining bytes one by one. */
for (i = already; i < obj_size; 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->maybe_empty_object
&& (h->object_base
== __PTR_ALIGN ((char *) old_chunk, old_chunk->contents,
h->alignment_mask)))
{ {
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 = object_base;
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;
@ -298,51 +235,46 @@ _obstack_newchunk (struct obstack *h, int length)
/* 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, void *obj) __attribute_pure__;
int int
_obstack_allocated_p (struct obstack *h, POINTER obj) _obstack_allocated_p (struct obstack *h, void *obj)
{ {
register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */ struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
register struct _obstack_chunk *plp; /* point to previous chunk if any */ 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 && ((void *) lp >= obj || (void *) (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
/* This function has two names with identical definitions.
This is the first one, called from non-ANSI code. */
void void
_obstack_free (struct obstack *h, POINTER obj) _obstack_free (struct obstack *h, void *obj)
{ {
register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */ struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
register struct _obstack_chunk *plp; /* point to previous chunk if any */ 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 && ((void *) lp >= obj || (void *) (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)
@ -356,43 +288,11 @@ _obstack_free (struct obstack *h, POINTER obj)
abort (); abort ();
} }
/* This function is used from ANSI code. */ _OBSTACK_SIZE_T
void
obstack_free (struct obstack *h, POINTER obj)
{
register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
register struct _obstack_chunk *plp; /* point to previous chunk if any */
lp = h->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
at the end of another chunk. */
while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
{
plp = lp->prev;
CALL_FREEFUN (h, lp);
lp = plp;
/* If we switch chunks, we can't tell whether the new current
chunk contains an empty object, so assume that it may. */
h->maybe_empty_object = 1;
}
if (lp)
{
h->object_base = h->next_free = (char *) (obj);
h->chunk_limit = lp->limit;
h->chunk = lp;
}
else if (obj != 0)
/* obj is not in any of the chunks! */
abort ();
}
int
_obstack_memory_used (struct obstack *h) _obstack_memory_used (struct obstack *h)
{ {
register struct _obstack_chunk* lp; struct _obstack_chunk *lp;
register int nbytes = 0; _OBSTACK_SIZE_T nbytes = 0;
for (lp = h->chunk; lp != 0; lp = lp->prev) for (lp = h->chunk; lp != 0; lp = lp->prev)
{ {
@ -400,111 +300,54 @@ _obstack_memory_used (struct obstack *h)
} }
return nbytes; return nbytes;
} }
/* Define the error handler. */
#ifndef _
# if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC
# include <libintl.h>
# ifndef _
# define _(Str) gettext (Str)
# endif
# else
# define _(Str) (Str)
# endif
#endif
static void # ifndef _OBSTACK_NO_ERROR_HANDLER
/* Define the error handler. */
# include <stdio.h>
/* Exit value used when 'print_and_abort' is used. */
# ifdef _LIBC
int obstack_exit_failure = EXIT_FAILURE;
# else
# include "exitfail.h"
# define obstack_exit_failure exit_failure
# endif
# ifdef _LIBC
# include <libintl.h>
# else
# include "gettext.h"
# endif
# ifndef _
# define _(msgid) gettext (msgid)
# endif
# ifdef _LIBC
# include <libio/iolibio.h>
# endif
static _Noreturn void
print_and_abort (void) print_and_abort (void)
{ {
fputs (_("memory exhausted\n"), stderr); /* Don't change any of these strings. Yes, it would be possible to add
the newline to the string and use fputs or so. But this must not
happen because the "memory exhausted" message appears in other places
like this and the translation should be reused instead of creating
a very similar string which requires a separate translation. */
# ifdef _LIBC
(void) __fxprintf (NULL, "%s\n", _("memory exhausted"));
# else
fprintf (stderr, "%s\n", _("memory exhausted"));
# endif
exit (obstack_exit_failure); exit (obstack_exit_failure);
} }
#if 0
/* These are now turned off because the applications do not use it
and it uses bcopy via obstack_grow, which causes trouble on sysV. */
/* Now define the functional versions of the obstack macros. /* The functions allocating more room by calling 'obstack_chunk_alloc'
Define them to simply use the corresponding macros to do the job. */ jump to the handler pointed to by 'obstack_alloc_failed_handler'.
This can be set to a user defined function which should either
/* The function names appear in parentheses in order to prevent abort gracefully or use longjump - but shouldn't return. This
the macro-definitions of the names from being expanded there. */ variable by default points to the internal function
'print_and_abort'. */
POINTER (obstack_base) (struct obstack *obstack) void (*obstack_alloc_failed_handler) (void) = print_and_abort;
{ # endif /* !_OBSTACK_NO_ERROR_HANDLER */
return obstack_base (obstack); #endif /* !_OBSTACK_ELIDE_CODE */
}
POINTER (obstack_next_free) (struct obstack *obstack)
{
return obstack_next_free (obstack);
}
int (obstack_object_size) (struct obstack *obstack)
{
return obstack_object_size (obstack);
}
int (obstack_room) (struct obstack *obstack)
{
return obstack_room (obstack);
}
int (obstack_make_room) (struct obstack *obstack, int length)
{
return obstack_make_room (obstack, length);
}
void (obstack_grow) (struct obstack *obstack, POINTER pointer, int length)
{
obstack_grow (obstack, pointer, length);
}
void (obstack_grow0) (struct obstack *obstack, POINTER pointer, int length)
{
obstack_grow0 (obstack, pointer, length);
}
void (obstack_1grow) (struct obstack *obstack, int character)
{
obstack_1grow (obstack, character);
}
void (obstack_blank) (struct obstack *obstack, int length)
{
obstack_blank (obstack, length);
}
void (obstack_1grow_fast) (struct obstack *obstack, int character)
{
obstack_1grow_fast (obstack, character);
}
void (obstack_blank_fast) (struct obstack *obstack, int length)
{
obstack_blank_fast (obstack, length);
}
POINTER (obstack_finish) (struct obstack *obstack)
{
return obstack_finish (obstack);
}
POINTER (obstack_alloc) (struct obstack *obstack, int length)
{
return obstack_alloc (obstack, length);
}
POINTER (obstack_copy) (struct obstack *obstack, POINTER pointer, int length)
{
return obstack_copy (obstack, pointer, length);
}
POINTER (obstack_copy0) (struct obstack *obstack, POINTER pointer, int length)
{
return obstack_copy0 (obstack, pointer, length);
}
#endif /* 0 */
#endif /* !ELIDE_CODE */

265
libiberty/obstacks.texi
View File

@ -20,8 +20,7 @@ the padding needed to start each object on a suitable boundary.
use obstacks. use obstacks.
* Allocation in an Obstack:: Allocating objects in an obstack. * Allocation in an Obstack:: Allocating objects in an obstack.
* Freeing Obstack Objects:: Freeing objects in an obstack. * Freeing Obstack Objects:: Freeing objects in an obstack.
* Obstack Functions:: The obstack functions are both * Obstack Functions:: The obstack functions are really macros.
functions and macros.
* Growing Objects:: Making an object bigger by stages. * Growing Objects:: Making an object bigger by stages.
* Extra Fast Growing:: Extra-high-efficiency (though more * Extra Fast Growing:: Extra-high-efficiency (though more
complicated) growing objects. complicated) growing objects.
@ -46,7 +45,7 @@ An obstack is represented by a data structure of type @code{struct
obstack}. This structure has a small fixed size; it records the status obstack}. This structure has a small fixed size; it records the status
of the obstack and how to find the space in which objects are allocated. of the obstack and how to find the space in which objects are allocated.
It does not contain any of the objects themselves. You should not try It does not contain any of the objects themselves. You should not try
to access the contents of the structure directly; use only the functions to access the contents of the structure directly; use only the macros
described in this chapter. described in this chapter.
@end deftp @end deftp
@ -56,7 +55,7 @@ of object. Dynamic allocation of obstacks allows your program to have a
variable number of different stacks. (You can even allocate an variable number of different stacks. (You can even allocate an
obstack structure in another obstack, but this is rarely useful.) obstack structure in another obstack, but this is rarely useful.)
All the functions that work with obstacks require you to specify which All the macros that work with obstacks require you to specify which
obstack to use. You do this with a pointer of type @code{struct obstack obstack to use. You do this with a pointer of type @code{struct obstack
*}. In the following, we often say ``an obstack'' when strictly *}. In the following, we often say ``an obstack'' when strictly
speaking the object at hand is such a pointer. speaking the object at hand is such a pointer.
@ -76,7 +75,7 @@ These matters are described in the following section.
@node Preparing for Obstacks @node Preparing for Obstacks
@subsubsection Preparing for Using Obstacks @subsubsection Preparing for Using Obstacks
Each source file in which you plan to use the obstack functions Each source file in which you plan to use obstacks
must include the header file @file{obstack.h}, like this: must include the header file @file{obstack.h}, like this:
@smallexample @smallexample
@ -86,7 +85,7 @@ must include the header file @file{obstack.h}, like this:
@findex obstack_chunk_alloc @findex obstack_chunk_alloc
@findex obstack_chunk_free @findex obstack_chunk_free
Also, if the source file uses the macro @code{obstack_init}, it must Also, if the source file uses the macro @code{obstack_init}, it must
declare or define two functions or macros that will be called by the declare or define two macros that will be called by the
obstack library. One, @code{obstack_chunk_alloc}, is used to allocate obstack library. One, @code{obstack_chunk_alloc}, is used to allocate
the chunks of memory into which objects are packed. The other, the chunks of memory into which objects are packed. The other,
@code{obstack_chunk_free}, is used to return chunks when the objects in @code{obstack_chunk_free}, is used to return chunks when the objects in
@ -94,7 +93,7 @@ them are freed. These macros should appear before any use of obstacks
in the source file. in the source file.
Usually these are defined to use @code{malloc} via the intermediary Usually these are defined to use @code{malloc} via the intermediary
@code{xmalloc} (@pxref{Unconstrained Allocation, , , libc, The GNU C Library Reference Manual}). This is done with @code{xmalloc} (@pxref{Unconstrained Allocation}). This is done with
the following pair of macro definitions: the following pair of macro definitions:
@smallexample @smallexample
@ -109,16 +108,18 @@ larger blocks of memory. @xref{Obstack Chunks}, for full details.
At run time, before the program can use a @code{struct obstack} object At run time, before the program can use a @code{struct obstack} object
as an obstack, it must initialize the obstack by calling as an obstack, it must initialize the obstack by calling
@code{obstack_init}. @code{obstack_init} or one of its variants, @code{obstack_begin},
@code{obstack_specify_allocation}, or
@code{obstack_specify_allocation_with_arg}.
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun int obstack_init (struct obstack *@var{obstack-ptr}) @deftypefun int obstack_init (struct obstack *@var{obstack-ptr})
Initialize obstack @var{obstack-ptr} for allocation of objects. This Initialize obstack @var{obstack-ptr} for allocation of objects. This
function calls the obstack's @code{obstack_chunk_alloc} function. If macro calls the obstack's @code{obstack_chunk_alloc} function. If
allocation of memory fails, the function pointed to by allocation of memory fails, the function pointed to by
@code{obstack_alloc_failed_handler} is called. The @code{obstack_init} @code{obstack_alloc_failed_handler} is called. The @code{obstack_init}
function always returns 1 (Compatibility notice: Former versions of macro always returns 1 (Compatibility notice: Former versions of
obstack returned 0 if allocation failed). obstack returned 0 if allocation failed).
@end deftypefun @end deftypefun
@ -141,6 +142,29 @@ struct obstack *myobstack_ptr
obstack_init (myobstack_ptr); obstack_init (myobstack_ptr);
@end smallexample @end smallexample
@comment obstack.h
@comment GNU
@deftypefun int obstack_begin (struct obstack *@var{obstack-ptr}, size_t chunk_size)
Like @code{obstack_init}, but specify chunks to be at least
@var{chunk_size} bytes in size.
@end deftypefun
@comment obstack.h
@comment GNU
@deftypefun int obstack_specify_allocation (struct obstack *@var{obstack-ptr}, size_t chunk_size, size_t alignment, void *(*chunkfun) (size_t), void (*freefun) (void *))
Like @code{obstack_init}, specifying chunk size, chunk
alignment, and memory allocation functions. A @var{chunk_size} or
@var{alignment} of zero results in the default size or alignment
respectively being used.
@end deftypefun
@comment obstack.h
@comment GNU
@deftypefun int obstack_specify_allocation_with_arg (struct obstack *@var{obstack-ptr}, size_t chunk_size, size_t alignment, void *(*chunkfun) (void *, size_t), void (*freefun) (void *, void *), void *arg)
Like @code{obstack_specify_allocation}, but specifying memory
allocation functions that take an extra first argument, @var{arg}.
@end deftypefun
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@defvar obstack_alloc_failed_handler @defvar obstack_alloc_failed_handler
@ -148,8 +172,8 @@ The value of this variable is a pointer to a function that
@code{obstack} uses when @code{obstack_chunk_alloc} fails to allocate @code{obstack} uses when @code{obstack_chunk_alloc} fails to allocate
memory. The default action is to print a message and abort. memory. The default action is to print a message and abort.
You should supply a function that either calls @code{exit} You should supply a function that either calls @code{exit}
(@pxref{Program Termination, , , libc, The GNU C Library Reference Manual}) or @code{longjmp} (@pxref{Non-Local (@pxref{Program Termination}) or @code{longjmp} (@pxref{Non-Local
Exits, , , libc, The GNU C Library Reference Manual}) and doesn't return. Exits}) and doesn't return.
@smallexample @smallexample
void my_obstack_alloc_failed (void) void my_obstack_alloc_failed (void)
@ -168,14 +192,14 @@ The most direct way to allocate an object in an obstack is with
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun {void *} obstack_alloc (struct obstack *@var{obstack-ptr}, int @var{size}) @deftypefun {void *} obstack_alloc (struct obstack *@var{obstack-ptr}, size_t @var{size})
This allocates an uninitialized block of @var{size} bytes in an obstack This allocates an uninitialized block of @var{size} bytes in an obstack
and returns its address. Here @var{obstack-ptr} specifies which obstack and returns its address. Here @var{obstack-ptr} specifies which obstack
to allocate the block in; it is the address of the @code{struct obstack} to allocate the block in; it is the address of the @code{struct obstack}
object which represents the obstack. Each obstack function or macro object which represents the obstack. Each obstack macro
requires you to specify an @var{obstack-ptr} as the first argument. requires you to specify an @var{obstack-ptr} as the first argument.
This function calls the obstack's @code{obstack_chunk_alloc} function if This macro calls the obstack's @code{obstack_chunk_alloc} function if
it needs to allocate a new chunk of memory; it calls it needs to allocate a new chunk of memory; it calls
@code{obstack_alloc_failed_handler} if allocation of memory by @code{obstack_alloc_failed_handler} if allocation of memory by
@code{obstack_chunk_alloc} failed. @code{obstack_chunk_alloc} failed.
@ -197,12 +221,11 @@ copystring (char *string)
@} @}
@end smallexample @end smallexample
To allocate a block with specified contents, use the function To allocate a block with specified contents, use the macro @code{obstack_copy}.
@code{obstack_copy}, declared like this:
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun {void *} obstack_copy (struct obstack *@var{obstack-ptr}, void *@var{address}, int @var{size}) @deftypefun {void *} obstack_copy (struct obstack *@var{obstack-ptr}, void *@var{address}, size_t @var{size})
This allocates a block and initializes it by copying @var{size} This allocates a block and initializes it by copying @var{size}
bytes of data starting at @var{address}. It calls bytes of data starting at @var{address}. It calls
@code{obstack_alloc_failed_handler} if allocation of memory by @code{obstack_alloc_failed_handler} if allocation of memory by
@ -211,18 +234,18 @@ bytes of data starting at @var{address}. It calls
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun {void *} obstack_copy0 (struct obstack *@var{obstack-ptr}, void *@var{address}, int @var{size}) @deftypefun {void *} obstack_copy0 (struct obstack *@var{obstack-ptr}, void *@var{address}, size_t @var{size})
Like @code{obstack_copy}, but appends an extra byte containing a null Like @code{obstack_copy}, but appends an extra byte containing a null
character. This extra byte is not counted in the argument @var{size}. character. This extra byte is not counted in the argument @var{size}.
@end deftypefun @end deftypefun
The @code{obstack_copy0} function is convenient for copying a sequence The @code{obstack_copy0} macro is convenient for copying a sequence
of characters into an obstack as a null-terminated string. Here is an of characters into an obstack as a null-terminated string. Here is an
example of its use: example of its use:
@smallexample @smallexample
char * char *
obstack_savestring (char *addr, int size) obstack_savestring (char *addr, size_t size)
@{ @{
return obstack_copy0 (&myobstack, addr, size); return obstack_copy0 (&myobstack, addr, size);
@} @}
@ -230,13 +253,13 @@ obstack_savestring (char *addr, int size)
@noindent @noindent
Contrast this with the previous example of @code{savestring} using Contrast this with the previous example of @code{savestring} using
@code{malloc} (@pxref{Basic Allocation, , , libc, The GNU C Library Reference Manual}). @code{malloc} (@pxref{Basic Allocation}).
@node Freeing Obstack Objects @node Freeing Obstack Objects
@subsubsection Freeing Objects in an Obstack @subsubsection Freeing Objects in an Obstack
@cindex freeing (obstacks) @cindex freeing (obstacks)
To free an object allocated in an obstack, use the function To free an object allocated in an obstack, use the macro
@code{obstack_free}. Since the obstack is a stack of objects, freeing @code{obstack_free}. Since the obstack is a stack of objects, freeing
one object automatically frees all other objects allocated more recently one object automatically frees all other objects allocated more recently
in the same obstack. in the same obstack.
@ -268,15 +291,12 @@ obstacks, or non-obstack allocation, can reuse the space of the chunk.
@subsubsection Obstack Functions and Macros @subsubsection Obstack Functions and Macros
@cindex macros @cindex macros
The interfaces for using obstacks may be defined either as functions or The interfaces for using obstacks are shown here as functions to
as macros, depending on the compiler. The obstack facility works with specify the return type and argument types, but they are really
all C compilers, including both @w{ISO C} and traditional C, but there are defined as macros. This means that the arguments don't actually have
precautions you must take if you plan to use compilers other than GNU C. types, but they generally behave as if they have the types shown.
You can call these macros like functions, but you cannot use them in
If you are using an old-fashioned @w{non-ISO C} compiler, all the obstack any other way (for example, you cannot take their address).
``functions'' are actually defined only as macros. You can call these
macros like functions, but you cannot use them in any other way (for
example, you cannot take their address).
Calling the macros requires a special precaution: namely, the first Calling the macros requires a special precaution: namely, the first
operand (the obstack pointer) may not contain any side effects, because operand (the obstack pointer) may not contain any side effects, because
@ -292,34 +312,18 @@ If you use @code{*obstack_list_ptr++} as the obstack pointer argument,
you will get very strange results since the incrementation may occur you will get very strange results since the incrementation may occur
several times. several times.
In @w{ISO C}, each function has both a macro definition and a function
definition. The function definition is used if you take the address of the
function without calling it. An ordinary call uses the macro definition by
default, but you can request the function definition instead by writing the
function name in parentheses, as shown here:
@smallexample
char *x;
void *(*funcp) ();
/* @r{Use the macro}. */
x = (char *) obstack_alloc (obptr, size);
/* @r{Call the function}. */
x = (char *) (obstack_alloc) (obptr, size);
/* @r{Take the address of the function}. */
funcp = obstack_alloc;
@end smallexample
@noindent
This is the same situation that exists in @w{ISO C} for the standard library
functions. @xref{Macro Definitions, , , libc, The GNU C Library Reference Manual}.
@strong{Warning:} When you do use the macros, you must observe the
precaution of avoiding side effects in the first operand, even in @w{ISO C}.
If you use the GNU C compiler, this precaution is not necessary, because If you use the GNU C compiler, this precaution is not necessary, because
various language extensions in GNU C permit defining the macros so as to various language extensions in GNU C permit defining the macros so as to
compute each argument only once. compute each argument only once.
Note that arguments other than the first will only be evaluated once,
even when not using GNU C.
@code{obstack.h} does declare a number of functions,
@code{_obstack_begin}, @code{_obstack_begin_1},
@code{_obstack_newchunk}, @code{_obstack_free}, and
@code{_obstack_memory_used}. You should not call these directly.
@node Growing Objects @node Growing Objects
@subsubsection Growing Objects @subsubsection Growing Objects
@cindex growing objects (in obstacks) @cindex growing objects (in obstacks)
@ -329,13 +333,13 @@ Because memory in obstack chunks is used sequentially, it is possible to
build up an object step by step, adding one or more bytes at a time to the build up an object step by step, adding one or more bytes at a time to the
end of the object. With this technique, you do not need to know how much end of the object. With this technique, you do not need to know how much
data you will put in the object until you come to the end of it. We call data you will put in the object until you come to the end of it. We call
this the technique of @dfn{growing objects}. The special functions this the technique of @dfn{growing objects}. The special macros
for adding data to the growing object are described in this section. for adding data to the growing object are described in this section.
You don't need to do anything special when you start to grow an object. You don't need to do anything special when you start to grow an object.
Using one of the functions to add data to the object automatically Using one of the macros to add data to the object automatically
starts it. However, it is necessary to say explicitly when the object is starts it. However, it is necessary to say explicitly when the object is
finished. This is done with the function @code{obstack_finish}. finished. This is done with @code{obstack_finish}.
The actual address of the object thus built up is not known until the The actual address of the object thus built up is not known until the
object is finished. Until then, it always remains possible that you will object is finished. Until then, it always remains possible that you will
@ -347,14 +351,14 @@ already added to the growing object will become part of the other object.
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun void obstack_blank (struct obstack *@var{obstack-ptr}, int @var{size}) @deftypefun void obstack_blank (struct obstack *@var{obstack-ptr}, size_t @var{size})
The most basic function for adding to a growing object is The most basic macro for adding to a growing object is
@code{obstack_blank}, which adds space without initializing it. @code{obstack_blank}, which adds space without initializing it.
@end deftypefun @end deftypefun
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun void obstack_grow (struct obstack *@var{obstack-ptr}, void *@var{data}, int @var{size}) @deftypefun void obstack_grow (struct obstack *@var{obstack-ptr}, void *@var{data}, size_t @var{size})
To add a block of initialized space, use @code{obstack_grow}, which is To add a block of initialized space, use @code{obstack_grow}, which is
the growing-object analogue of @code{obstack_copy}. It adds @var{size} the growing-object analogue of @code{obstack_copy}. It adds @var{size}
bytes of data to the growing object, copying the contents from bytes of data to the growing object, copying the contents from
@ -363,7 +367,7 @@ bytes of data to the growing object, copying the contents from
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun void obstack_grow0 (struct obstack *@var{obstack-ptr}, void *@var{data}, int @var{size}) @deftypefun void obstack_grow0 (struct obstack *@var{obstack-ptr}, void *@var{data}, size_t @var{size})
This is the growing-object analogue of @code{obstack_copy0}. It adds This is the growing-object analogue of @code{obstack_copy0}. It adds
@var{size} bytes copied from @var{data}, followed by an additional null @var{size} bytes copied from @var{data}, followed by an additional null
character. character.
@ -372,14 +376,14 @@ character.
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun void obstack_1grow (struct obstack *@var{obstack-ptr}, char @var{c}) @deftypefun void obstack_1grow (struct obstack *@var{obstack-ptr}, char @var{c})
To add one character at a time, use the function @code{obstack_1grow}. To add one character at a time, use @code{obstack_1grow}.
It adds a single byte containing @var{c} to the growing object. It adds a single byte containing @var{c} to the growing object.
@end deftypefun @end deftypefun
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun void obstack_ptr_grow (struct obstack *@var{obstack-ptr}, void *@var{data}) @deftypefun void obstack_ptr_grow (struct obstack *@var{obstack-ptr}, void *@var{data})
Adding the value of a pointer one can use the function Adding the value of a pointer one can use
@code{obstack_ptr_grow}. It adds @code{sizeof (void *)} bytes @code{obstack_ptr_grow}. It adds @code{sizeof (void *)} bytes
containing the value of @var{data}. containing the value of @var{data}.
@end deftypefun @end deftypefun
@ -387,35 +391,31 @@ containing the value of @var{data}.
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun void obstack_int_grow (struct obstack *@var{obstack-ptr}, int @var{data}) @deftypefun void obstack_int_grow (struct obstack *@var{obstack-ptr}, int @var{data})
A single value of type @code{int} can be added by using the A single value of type @code{int} can be added by using
@code{obstack_int_grow} function. It adds @code{sizeof (int)} bytes to @code{obstack_int_grow}. It adds @code{sizeof (int)} bytes to
the growing object and initializes them with the value of @var{data}. the growing object and initializes them with the value of @var{data}.
@end deftypefun @end deftypefun
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun {void *} obstack_finish (struct obstack *@var{obstack-ptr}) @deftypefun {void *} obstack_finish (struct obstack *@var{obstack-ptr})
When you are finished growing the object, use the function When you are finished growing the object, use
@code{obstack_finish} to close it off and return its final address. @code{obstack_finish} to close it off and return its final address.
Once you have finished the object, the obstack is available for ordinary Once you have finished the object, the obstack is available for ordinary
allocation or for growing another object. allocation or for growing another object.
This function can return a null pointer under the same conditions as
@code{obstack_alloc} (@pxref{Allocation in an Obstack}).
@end deftypefun @end deftypefun
When you build an object by growing it, you will probably need to know When you build an object by growing it, you will probably need to know
afterward how long it became. You need not keep track of this as you grow afterward how long it became. You need not keep track of this as you grow
the object, because you can find out the length from the obstack just the object, because you can find out the length from the obstack
before finishing the object with the function @code{obstack_object_size}, with @code{obstack_object_size}, before finishing the object.
declared as follows:
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun int obstack_object_size (struct obstack *@var{obstack-ptr}) @deftypefun size_t obstack_object_size (struct obstack *@var{obstack-ptr})
This function returns the current size of the growing object, in bytes. This macro returns the current size of the growing object, in bytes.
Remember to call this function @emph{before} finishing the object. Remember to call @code{obstack_object_size} @emph{before} finishing the object.
After it is finished, @code{obstack_object_size} will return zero. After it is finished, @code{obstack_object_size} will return zero.
@end deftypefun @end deftypefun
@ -429,53 +429,48 @@ obstack_free (obstack_ptr, obstack_finish (obstack_ptr));
@noindent @noindent
This has no effect if no object was growing. This has no effect if no object was growing.
@cindex shrinking objects
You can use @code{obstack_blank} with a negative size argument to make
the current object smaller. Just don't try to shrink it beyond zero
length---there's no telling what will happen if you do that.
@node Extra Fast Growing @node Extra Fast Growing
@subsubsection Extra Fast Growing Objects @subsubsection Extra Fast Growing Objects
@cindex efficiency and obstacks @cindex efficiency and obstacks
The usual functions for growing objects incur overhead for checking The usual macros for growing objects incur overhead for checking
whether there is room for the new growth in the current chunk. If you whether there is room for the new growth in the current chunk. If you
are frequently constructing objects in small steps of growth, this are frequently constructing objects in small steps of growth, this
overhead can be significant. overhead can be significant.
You can reduce the overhead by using special ``fast growth'' You can reduce the overhead by using special ``fast growth''
functions that grow the object without checking. In order to have a macros that grow the object without checking. In order to have a
robust program, you must do the checking yourself. If you do this checking robust program, you must do the checking yourself. If you do this checking
in the simplest way each time you are about to add data to the object, you in the simplest way each time you are about to add data to the object, you
have not saved anything, because that is what the ordinary growth have not saved anything, because that is what the ordinary growth
functions do. But if you can arrange to check less often, or check macros do. But if you can arrange to check less often, or check
more efficiently, then you make the program faster. more efficiently, then you make the program faster.
The function @code{obstack_room} returns the amount of room available @code{obstack_room} returns the amount of room available
in the current chunk. It is declared as follows: in the current chunk.
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun int obstack_room (struct obstack *@var{obstack-ptr}) @deftypefun size_t obstack_room (struct obstack *@var{obstack-ptr})
This returns the number of bytes that can be added safely to the current This returns the number of bytes that can be added safely to the current
growing object (or to an object about to be started) in obstack growing object (or to an object about to be started) in obstack
@var{obstack} using the fast growth functions. @var{obstack} using the fast growth macros.
@end deftypefun @end deftypefun
While you know there is room, you can use these fast growth functions While you know there is room, you can use these fast growth macros
for adding data to a growing object: for adding data to a growing object:
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun void obstack_1grow_fast (struct obstack *@var{obstack-ptr}, char @var{c}) @deftypefun void obstack_1grow_fast (struct obstack *@var{obstack-ptr}, char @var{c})
The function @code{obstack_1grow_fast} adds one byte containing the @code{obstack_1grow_fast} adds one byte containing the
character @var{c} to the growing object in obstack @var{obstack-ptr}. character @var{c} to the growing object in obstack @var{obstack-ptr}.
@end deftypefun @end deftypefun
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun void obstack_ptr_grow_fast (struct obstack *@var{obstack-ptr}, void *@var{data}) @deftypefun void obstack_ptr_grow_fast (struct obstack *@var{obstack-ptr}, void *@var{data})
The function @code{obstack_ptr_grow_fast} adds @code{sizeof (void *)} @code{obstack_ptr_grow_fast} adds @code{sizeof (void *)}
bytes containing the value of @var{data} to the growing object in bytes containing the value of @var{data} to the growing object in
obstack @var{obstack-ptr}. obstack @var{obstack-ptr}.
@end deftypefun @end deftypefun
@ -483,42 +478,42 @@ obstack @var{obstack-ptr}.
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun void obstack_int_grow_fast (struct obstack *@var{obstack-ptr}, int @var{data}) @deftypefun void obstack_int_grow_fast (struct obstack *@var{obstack-ptr}, int @var{data})
The function @code{obstack_int_grow_fast} adds @code{sizeof (int)} bytes @code{obstack_int_grow_fast} adds @code{sizeof (int)} bytes
containing the value of @var{data} to the growing object in obstack containing the value of @var{data} to the growing object in obstack
@var{obstack-ptr}. @var{obstack-ptr}.
@end deftypefun @end deftypefun
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun void obstack_blank_fast (struct obstack *@var{obstack-ptr}, int @var{size}) @deftypefun void obstack_blank_fast (struct obstack *@var{obstack-ptr}, size_t @var{size})
The function @code{obstack_blank_fast} adds @var{size} bytes to the @code{obstack_blank_fast} adds @var{size} bytes to the
growing object in obstack @var{obstack-ptr} without initializing them. growing object in obstack @var{obstack-ptr} without initializing them.
@end deftypefun @end deftypefun
When you check for space using @code{obstack_room} and there is not When you check for space using @code{obstack_room} and there is not
enough room for what you want to add, the fast growth functions enough room for what you want to add, the fast growth macros
are not safe. In this case, simply use the corresponding ordinary are not safe. In this case, simply use the corresponding ordinary
growth function instead. Very soon this will copy the object to a growth macro instead. Very soon this will copy the object to a
new chunk; then there will be lots of room available again. new chunk; then there will be lots of room available again.
So, each time you use an ordinary growth function, check afterward for So, each time you use an ordinary growth macro, check afterward for
sufficient space using @code{obstack_room}. Once the object is copied sufficient space using @code{obstack_room}. Once the object is copied
to a new chunk, there will be plenty of space again, so the program will to a new chunk, there will be plenty of space again, so the program will
start using the fast growth functions again. start using the fast growth macros again.
Here is an example: Here is an example:
@smallexample @smallexample
@group @group
void void
add_string (struct obstack *obstack, const char *ptr, int len) add_string (struct obstack *obstack, const char *ptr, size_t len)
@{ @{
while (len > 0) while (len > 0)
@{ @{
int room = obstack_room (obstack); size_t room = obstack_room (obstack);
if (room == 0) if (room == 0)
@{ @{
/* @r{Not enough room. Add one character slowly,} /* @r{Not enough room. Add one character slowly,}
@r{which may copy to a new chunk and make room.} */ @r{which may copy to a new chunk and make room.} */
obstack_1grow (obstack, *ptr++); obstack_1grow (obstack, *ptr++);
len--; len--;
@ -537,19 +532,26 @@ add_string (struct obstack *obstack, const char *ptr, int len)
@end group @end group
@end smallexample @end smallexample
@cindex shrinking objects
You can use @code{obstack_blank_fast} with a ``negative'' size
argument to make the current object smaller. Just don't try to shrink
it beyond zero length---there's no telling what will happen if you do
that. Earlier versions of obstacks allowed you to use
@code{obstack_blank} to shrink objects. This will no longer work.
@node Status of an Obstack @node Status of an Obstack
@subsubsection Status of an Obstack @subsubsection Status of an Obstack
@cindex obstack status @cindex obstack status
@cindex status of obstack @cindex status of obstack
Here are functions that provide information on the current status of Here are macros that provide information on the current status of
allocation in an obstack. You can use them to learn about an object while allocation in an obstack. You can use them to learn about an object while
still growing it. still growing it.
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun {void *} obstack_base (struct obstack *@var{obstack-ptr}) @deftypefun {void *} obstack_base (struct obstack *@var{obstack-ptr})
This function returns the tentative address of the beginning of the This macro returns the tentative address of the beginning of the
currently growing object in @var{obstack-ptr}. If you finish the object currently growing object in @var{obstack-ptr}. If you finish the object
immediately, it will have that address. If you make it larger first, it immediately, it will have that address. If you make it larger first, it
may outgrow the current chunk---then its address will change! may outgrow the current chunk---then its address will change!
@ -562,7 +564,7 @@ chunk).
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun {void *} obstack_next_free (struct obstack *@var{obstack-ptr}) @deftypefun {void *} obstack_next_free (struct obstack *@var{obstack-ptr})
This function returns the address of the first free byte in the current This macro returns the address of the first free byte in the current
chunk of obstack @var{obstack-ptr}. This is the end of the currently chunk of obstack @var{obstack-ptr}. This is the end of the currently
growing object. If no object is growing, @code{obstack_next_free} growing object. If no object is growing, @code{obstack_next_free}
returns the same value as @code{obstack_base}. returns the same value as @code{obstack_base}.
@ -570,12 +572,12 @@ returns the same value as @code{obstack_base}.
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefun int obstack_object_size (struct obstack *@var{obstack-ptr}) @deftypefun size_t obstack_object_size (struct obstack *@var{obstack-ptr})
This function returns the size in bytes of the currently growing object. This macro returns the size in bytes of the currently growing object.
This is equivalent to This is equivalent to
@smallexample @smallexample
obstack_next_free (@var{obstack-ptr}) - obstack_base (@var{obstack-ptr}) ((size_t) (obstack_next_free (@var{obstack-ptr}) - obstack_base (@var{obstack-ptr})))
@end smallexample @end smallexample
@end deftypefun @end deftypefun
@ -589,12 +591,11 @@ specified boundary. By default, this boundary is aligned so that
the object can hold any type of data. the object can hold any type of data.
To access an obstack's alignment boundary, use the macro To access an obstack's alignment boundary, use the macro
@code{obstack_alignment_mask}, whose function prototype looks like @code{obstack_alignment_mask}.
this:
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefn Macro int obstack_alignment_mask (struct obstack *@var{obstack-ptr}) @deftypefn Macro size_t obstack_alignment_mask (struct obstack *@var{obstack-ptr})
The value is a bit mask; a bit that is 1 indicates that the corresponding The value is a bit mask; a bit that is 1 indicates that the corresponding
bit in the address of an object should be 0. The mask value should be one bit in the address of an object should be 0. The mask value should be one
less than a power of 2; the effect is that all object addresses are less than a power of 2; the effect is that all object addresses are
@ -661,7 +662,7 @@ not to waste too much memory in the portion of the last chunk not yet used.
@comment obstack.h @comment obstack.h
@comment GNU @comment GNU
@deftypefn Macro int obstack_chunk_size (struct obstack *@var{obstack-ptr}) @deftypefn Macro size_t obstack_chunk_size (struct obstack *@var{obstack-ptr})
This returns the chunk size of the given obstack. This returns the chunk size of the given obstack.
@end deftypefn @end deftypefn
@ -679,25 +680,37 @@ if (obstack_chunk_size (obstack_ptr) < @var{new-chunk-size})
@end smallexample @end smallexample
@node Summary of Obstacks @node Summary of Obstacks
@subsubsection Summary of Obstack Functions @subsubsection Summary of Obstack Macros
Here is a summary of all the functions associated with obstacks. Each Here is a summary of all the macros associated with obstacks. Each
takes the address of an obstack (@code{struct obstack *}) as its first takes the address of an obstack (@code{struct obstack *}) as its first
argument. argument.
@table @code @table @code
@item void obstack_init (struct obstack *@var{obstack-ptr}) @item int obstack_init (struct obstack *@var{obstack-ptr})
Initialize use of an obstack. @xref{Creating Obstacks}. Initialize use of an obstack. @xref{Creating Obstacks}.
@item void *obstack_alloc (struct obstack *@var{obstack-ptr}, int @var{size}) @item int obstack_begin (struct obstack *@var{obstack-ptr}, size_t chunk_size)
Initialize use of an obstack, with an initial chunk of
@var{chunk_size} bytes.
@item int obstack_specify_allocation (struct obstack *@var{obstack-ptr}, size_t chunk_size, size_t alignment, void *(*chunkfun) (size_t), void (*freefun) (void *))
Initialize use of an obstack, specifying intial chunk size, chunk
alignment, and memory allocation functions.
@item int obstack_specify_allocation_with_arg (struct obstack *@var{obstack-ptr}, size_t chunk_size, size_t alignment, void *(*chunkfun) (void *, size_t), void (*freefun) (void *, void *), void *arg)
Like @code{obstack_specify_allocation}, but specifying memory
allocation functions that take an extra first argument, @var{arg}.
@item void *obstack_alloc (struct obstack *@var{obstack-ptr}, size_t @var{size})
Allocate an object of @var{size} uninitialized bytes. Allocate an object of @var{size} uninitialized bytes.
@xref{Allocation in an Obstack}. @xref{Allocation in an Obstack}.
@item void *obstack_copy (struct obstack *@var{obstack-ptr}, void *@var{address}, int @var{size}) @item void *obstack_copy (struct obstack *@var{obstack-ptr}, void *@var{address}, size_t @var{size})
Allocate an object of @var{size} bytes, with contents copied from Allocate an object of @var{size} bytes, with contents copied from
@var{address}. @xref{Allocation in an Obstack}. @var{address}. @xref{Allocation in an Obstack}.
@item void *obstack_copy0 (struct obstack *@var{obstack-ptr}, void *@var{address}, int @var{size}) @item void *obstack_copy0 (struct obstack *@var{obstack-ptr}, void *@var{address}, size_t @var{size})
Allocate an object of @var{size}+1 bytes, with @var{size} of them copied Allocate an object of @var{size}+1 bytes, with @var{size} of them copied
from @var{address}, followed by a null character at the end. from @var{address}, followed by a null character at the end.
@xref{Allocation in an Obstack}. @xref{Allocation in an Obstack}.
@ -706,15 +719,15 @@ from @var{address}, followed by a null character at the end.
Free @var{object} (and everything allocated in the specified obstack Free @var{object} (and everything allocated in the specified obstack
more recently than @var{object}). @xref{Freeing Obstack Objects}. more recently than @var{object}). @xref{Freeing Obstack Objects}.
@item void obstack_blank (struct obstack *@var{obstack-ptr}, int @var{size}) @item void obstack_blank (struct obstack *@var{obstack-ptr}, size_t @var{size})
Add @var{size} uninitialized bytes to a growing object. Add @var{size} uninitialized bytes to a growing object.
@xref{Growing Objects}. @xref{Growing Objects}.
@item void obstack_grow (struct obstack *@var{obstack-ptr}, void *@var{address}, int @var{size}) @item void obstack_grow (struct obstack *@var{obstack-ptr}, void *@var{address}, size_t @var{size})
Add @var{size} bytes, copied from @var{address}, to a growing object. Add @var{size} bytes, copied from @var{address}, to a growing object.
@xref{Growing Objects}. @xref{Growing Objects}.
@item void obstack_grow0 (struct obstack *@var{obstack-ptr}, void *@var{address}, int @var{size}) @item void obstack_grow0 (struct obstack *@var{obstack-ptr}, void *@var{address}, size_t @var{size})
Add @var{size} bytes, copied from @var{address}, to a growing object, Add @var{size} bytes, copied from @var{address}, to a growing object,
and then add another byte containing a null character. @xref{Growing and then add another byte containing a null character. @xref{Growing
Objects}. Objects}.
@ -727,11 +740,11 @@ Add one byte containing @var{data-char} to a growing object.
Finalize the object that is growing and return its permanent address. Finalize the object that is growing and return its permanent address.
@xref{Growing Objects}. @xref{Growing Objects}.
@item int obstack_object_size (struct obstack *@var{obstack-ptr}) @item size_t obstack_object_size (struct obstack *@var{obstack-ptr})
Get the current size of the currently growing object. @xref{Growing Get the current size of the currently growing object. @xref{Growing
Objects}. Objects}.
@item void obstack_blank_fast (struct obstack *@var{obstack-ptr}, int @var{size}) @item void obstack_blank_fast (struct obstack *@var{obstack-ptr}, size_t @var{size})
Add @var{size} uninitialized bytes to a growing object without checking Add @var{size} uninitialized bytes to a growing object without checking
that there is enough room. @xref{Extra Fast Growing}. that there is enough room. @xref{Extra Fast Growing}.
@ -739,15 +752,15 @@ that there is enough room. @xref{Extra Fast Growing}.
Add one byte containing @var{data-char} to a growing object without Add one byte containing @var{data-char} to a growing object without
checking that there is enough room. @xref{Extra Fast Growing}. checking that there is enough room. @xref{Extra Fast Growing}.
@item int obstack_room (struct obstack *@var{obstack-ptr}) @item size_t obstack_room (struct obstack *@var{obstack-ptr})
Get the amount of room now available for growing the current object. Get the amount of room now available for growing the current object.
@xref{Extra Fast Growing}. @xref{Extra Fast Growing}.
@item int obstack_alignment_mask (struct obstack *@var{obstack-ptr}) @item size_t obstack_alignment_mask (struct obstack *@var{obstack-ptr})
The mask used for aligning the beginning of an object. This is an The mask used for aligning the beginning of an object. This is an
lvalue. @xref{Obstacks Data Alignment}. lvalue. @xref{Obstacks Data Alignment}.
@item int obstack_chunk_size (struct obstack *@var{obstack-ptr}) @item size_t obstack_chunk_size (struct obstack *@var{obstack-ptr})
The size for allocating chunks. This is an lvalue. @xref{Obstack Chunks}. The size for allocating chunks. This is an lvalue. @xref{Obstack Chunks}.
@item void *obstack_base (struct obstack *@var{obstack-ptr}) @item void *obstack_base (struct obstack *@var{obstack-ptr})