include/obstack.h

   1 /* obstack.h - object stack macros
   2    Copyright (C) 1988,89,90,91,92,93,94,96,97,98 Free Software Foundation, Inc.
   3
   4
   5    NOTE: The canonical source of this file is maintained with the GNU C Library.
   6    Bugs can be reported to bug-glibc@gnu.org.
   7
   8    This program is free software; you can redistribute it and/or modify it
   9    under the terms of the GNU General Public License as published by the
  10    Free Software Foundation; either version 2, or (at your option) any
  11    later version.
  12
  13    This program is distributed in the hope that it will be useful,
  14    but WITHOUT ANY WARRANTY; without even the implied warranty of
  15    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16    GNU General Public License for more details.
  17
  18    You should have received a copy of the GNU General Public License
  19    along with this program; if not, write to the Free Software
  20    Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
  21    USA.  */
  22
  23 /* Summary:
  24
  25 All the apparent functions defined here are macros. The idea
  26 is that you would use these pre-tested macros to solve a
  27 very specific set of problems, and they would run fast.
  28 Caution: no side-effects in arguments please!! They may be
  29 evaluated MANY times!!
  30
  31 These macros operate a stack of objects.  Each object starts life
  32 small, and may grow to maturity.  (Consider building a word syllable
  33 by syllable.)  An object can move while it is growing.  Once it has
  34 been "finished" it never changes address again.  So the "top of the
  35 stack" is typically an immature growing object, while the rest of the
  36 stack is of mature, fixed size and fixed address objects.
  37
  38 These routines grab large chunks of memory, using a function you
  39 supply, called `obstack_chunk_alloc'.  On occasion, they free chunks,
  40 by calling `obstack_chunk_free'.  You must define them and declare
  41 them before using any obstack macros.
  42
  43 Each independent stack is represented by a `struct obstack'.
  44 Each of the obstack macros expects a pointer to such a structure
  45 as the first argument.
  46
  47 One motivation for this package is the problem of growing char strings
  48 in symbol tables.  Unless you are "fascist pig with a read-only mind"
  49 --Gosper's immortal quote from HAKMEM item 154, out of context--you
  50 would not like to put any arbitrary upper limit on the length of your
  51 symbols.
  52
  53 In practice this often means you will build many short symbols and a
  54 few long symbols.  At the time you are reading a symbol you don't know
  55 how long it is.  One traditional method is to read a symbol into a
  56 buffer, realloc()ating the buffer every time you try to read a symbol
  57 that is longer than the buffer.  This is beaut, but you still will
  58 want to copy the symbol from the buffer to a more permanent
  59 symbol-table entry say about half the time.
  60
  61 With obstacks, you can work differently.  Use one obstack for all symbol
  62 names.  As you read a symbol, grow the name in the obstack gradually.
  63 When the name is complete, finalize it.  Then, if the symbol exists already,
  64 free the newly read name.
  65
  66 The way we do this is to take a large chunk, allocating memory from
  67 low addresses.  When you want to build a symbol in the chunk you just
  68 add chars above the current "high water mark" in the chunk.  When you
  69 have finished adding chars, because you got to the end of the symbol,
  70 you know how long the chars are, and you can create a new object.
  71 Mostly the chars will not burst over the highest address of the chunk,
  72 because you would typically expect a chunk to be (say) 100 times as
  73 long as an average object.
  74
  75 In case that isn't clear, when we have enough chars to make up
  76 the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
  77 so we just point to it where it lies.  No moving of chars is
  78 needed and this is the second win: potentially long strings need
  79 never be explicitly shuffled. Once an object is formed, it does not
  80 change its address during its lifetime.
  81
  82 When the chars burst over a chunk boundary, we allocate a larger
  83 chunk, and then copy the partly formed object from the end of the old
  84 chunk to the beginning of the new larger chunk.  We then carry on
  85 accreting characters to the end of the object as we normally would.
  86
  87 A special macro is provided to add a single char at a time to a
  88 growing object.  This allows the use of register variables, which
  89 break the ordinary 'growth' macro.
  90
  91 Summary:
  92         We allocate large chunks.
  93         We carve out one object at a time from the current chunk.
  94         Once carved, an object never moves.
  95         We are free to append data of any size to the currently
  96           growing object.
  97         Exactly one object is growing in an obstack at any one time.
  98         You can run one obstack per control block.
  99         You may have as many control blocks as you dare.
 100         Because of the way we do it, you can `unwind' an obstack
 101           back to a previous state. (You may remove objects much
 102           as you would with a stack.)
 103 */
 104
 105
 106 /* Don't do the contents of this file more than once.  */
 107
 108 #ifndef _OBSTACK_H
 109 #define _OBSTACK_H 1
 110
 111 #ifdef __cplusplus
 112 extern "C" {
 113 #endif
 114 \f
 115 /* We use subtraction of (char *) 0 instead of casting to int
 116    because on word-addressable machines a simple cast to int
 117    may ignore the byte-within-word field of the pointer.  */
 118
 119 #ifndef __PTR_TO_INT
 120 # define __PTR_TO_INT(P) ((P) - (char *) 0)
 121 #endif
 122
 123 #ifndef __INT_TO_PTR
 124 # define __INT_TO_PTR(P) ((P) + (char *) 0)
 125 #endif
 126
 127 /* We need the type of the resulting object.  If __PTRDIFF_TYPE__ is
 128    defined, as with GNU C, use that; that way we don't pollute the
 129    namespace with <stddef.h>'s symbols.  Otherwise, if <stddef.h> is
 130    available, include it and use ptrdiff_t.  In traditional C, long is
 131    the best that we can do.  */
 132
 133 #ifdef __PTRDIFF_TYPE__
 134 # define PTR_INT_TYPE __PTRDIFF_TYPE__
 135 #else
 136 # ifdef HAVE_STDDEF_H
 137 #  include <stddef.h>
 138 #  define PTR_INT_TYPE ptrdiff_t
 139 # else
 140 #  define PTR_INT_TYPE long
 141 # endif
 142 #endif
 143
 144 #if defined _LIBC || defined HAVE_STRING_H
 145 # include <string.h>
 146 # if defined __STDC__ && __STDC__
 147 #  define _obstack_memcpy(To, From, N) memcpy ((To), (From), (N))
 148 # else
 149 #  define _obstack_memcpy(To, From, N) memcpy ((To), (char *)(From), (N))
 150 # endif
 151 #else
 152 # ifdef memcpy
 153 #  define _obstack_memcpy(To, From, N) memcpy ((To), (char *)(From), (N))
 154 # else
 155 #  define _obstack_memcpy(To, From, N) bcopy ((char *)(From), (To), (N))
 156 # endif
 157 #endif
 158
 159 struct _obstack_chunk           /* Lives at front of each chunk. */
 160 {
 161   char  *limit;                 /* 1 past end of this chunk */
 162   struct _obstack_chunk *prev;  /* address of prior chunk or NULL */
 163   char  contents[4];            /* objects begin here */
 164 };
 165
 166 struct obstack          /* control current object in current chunk */
 167 {
 168   long  chunk_size;             /* preferred size to allocate chunks in */
 169   struct _obstack_chunk *chunk; /* address of current struct obstack_chunk */
 170   char  *object_base;           /* address of object we are building */
 171   char  *next_free;             /* where to add next char to current object */
 172   char  *chunk_limit;           /* address of char after current chunk */
 173   PTR_INT_TYPE temp;            /* Temporary for some macros.  */
 174   int   alignment_mask;         /* Mask of alignment for each object. */
 175 #if defined __STDC__ && __STDC__
 176   /* These prototypes vary based on `use_extra_arg', and we use
 177      casts to the prototypeless function type in all assignments,
 178      but having prototypes here quiets -Wstrict-prototypes.  */
 179   struct _obstack_chunk *(*chunkfun) (void *, long);
 180   void (*freefun) (void *, struct _obstack_chunk *);
 181   void *extra_arg;              /* first arg for chunk alloc/dealloc funcs */
 182 #else
 183   struct _obstack_chunk *(*chunkfun) (); /* User's fcn to allocate a chunk.  */
 184   void (*freefun) ();           /* User's function to free a chunk.  */
 185   char *extra_arg;              /* first arg for chunk alloc/dealloc funcs */
 186 #endif
 187   unsigned use_extra_arg:1;     /* chunk alloc/dealloc funcs take extra arg */
 188   unsigned maybe_empty_object:1;/* There is a possibility that the current
 189                                    chunk contains a zero-length object.  This
 190                                    prevents freeing the chunk if we allocate
 191                                    a bigger chunk to replace it. */
 192   unsigned alloc_failed:1;      /* No longer used, as we now call the failed
 193                                    handler on error, but retained for binary
 194                                    compatibility.  */
 195 };
 196
 197 /* Declare the external functions we use; they are in obstack.c.  */
 198
 199 #if defined __STDC__ && __STDC__
 200 extern void _obstack_newchunk (struct obstack *, int);
 201 extern void _obstack_free (struct obstack *, void *);
 202 extern int _obstack_begin (struct obstack *, int, int,
 203                             void *(*) (long), void (*) (void *));
 204 extern int _obstack_begin_1 (struct obstack *, int, int,
 205                              void *(*) (void *, long),
 206                              void (*) (void *, void *), void *);
 207 extern int _obstack_memory_used (struct obstack *);
 208 #else
 209 extern void _obstack_newchunk ();
 210 extern void _obstack_free ();
 211 extern int _obstack_begin ();
 212 extern int _obstack_begin_1 ();
 213 extern int _obstack_memory_used ();
 214 #endif
 215 \f
 216 #if defined __STDC__ && __STDC__
 217
 218 /* Do the function-declarations after the structs
 219    but before defining the macros.  */
 220
 221 void obstack_init (struct obstack *obstack);
 222
 223 void * obstack_alloc (struct obstack *obstack, int size);
 224
 225 void * obstack_copy (struct obstack *obstack, void *address, int size);
 226 void * obstack_copy0 (struct obstack *obstack, void *address, int size);
 227
 228 void obstack_free (struct obstack *obstack, void *block);
 229
 230 void obstack_blank (struct obstack *obstack, int size);
 231
 232 void obstack_grow (struct obstack *obstack, void *data, int size);
 233 void obstack_grow0 (struct obstack *obstack, void *data, int size);
 234
 235 void obstack_1grow (struct obstack *obstack, int data_char);
 236 void obstack_ptr_grow (struct obstack *obstack, void *data);
 237 void obstack_int_grow (struct obstack *obstack, int data);
 238
 239 void * obstack_finish (struct obstack *obstack);
 240
 241 int obstack_object_size (struct obstack *obstack);
 242
 243 int obstack_room (struct obstack *obstack);
 244 void obstack_make_room (struct obstack *obstack, int size);
 245 void obstack_1grow_fast (struct obstack *obstack, int data_char);
 246 void obstack_ptr_grow_fast (struct obstack *obstack, void *data);
 247 void obstack_int_grow_fast (struct obstack *obstack, int data);
 248 void obstack_blank_fast (struct obstack *obstack, int size);
 249
 250 void * obstack_base (struct obstack *obstack);
 251 void * obstack_next_free (struct obstack *obstack);
 252 int obstack_alignment_mask (struct obstack *obstack);
 253 int obstack_chunk_size (struct obstack *obstack);
 254 int obstack_memory_used (struct obstack *obstack);
 255
 256 #endif /* __STDC__ */
 257
 258 /* Non-ANSI C cannot really support alternative functions for these macros,
 259    so we do not declare them.  */
 260
 261 /* Error handler called when `obstack_chunk_alloc' failed to allocate
 262    more memory.  This can be set to a user defined function.  The
 263    default action is to print a message and abort.  */
 264 #if defined __STDC__ && __STDC__
 265 extern void (*obstack_alloc_failed_handler) (void);
 266 #else
 267 extern void (*obstack_alloc_failed_handler) ();
 268 #endif
 269
 270 /* Exit value used when `print_and_abort' is used.  */
 271 extern int obstack_exit_failure;
 272 \f
 273 /* Pointer to beginning of object being allocated or to be allocated next.
 274    Note that this might not be the final address of the object
 275    because a new chunk might be needed to hold the final size.  */
 276
 277 #define obstack_base(h) ((h)->object_base)
 278
 279 /* Size for allocating ordinary chunks.  */
 280
 281 #define obstack_chunk_size(h) ((h)->chunk_size)
 282
 283 /* Pointer to next byte not yet allocated in current chunk.  */
 284
 285 #define obstack_next_free(h)    ((h)->next_free)
 286
 287 /* Mask specifying low bits that should be clear in address of an object.  */
 288
 289 #define obstack_alignment_mask(h) ((h)->alignment_mask)
 290
 291 /* To prevent prototype warnings provide complete argument list in
 292    standard C version.  */
 293 #if defined __STDC__ && __STDC__
 294
 295 # define obstack_init(h) \
 296   _obstack_begin ((h), 0, 0, \
 297                   (void *(*) (long)) obstack_chunk_alloc, (void (*) (void *)) obstack_chunk_free)
 298
 299 # define obstack_begin(h, size) \
 300   _obstack_begin ((h), (size), 0, \
 301                   (void *(*) (long)) obstack_chunk_alloc, (void (*) (void *)) obstack_chunk_free)
 302
 303 # define obstack_specify_allocation(h, size, alignment, chunkfun, freefun) \
 304   _obstack_begin ((h), (size), (alignment), \
 305                     (void *(*) (long)) (chunkfun), (void (*) (void *)) (freefun))
 306
 307 # define obstack_specify_allocation_with_arg(h, size, alignment, chunkfun, freefun, arg) \
 308   _obstack_begin_1 ((h), (size), (alignment), \
 309                     (void *(*) (void *, long)) (chunkfun), \
 310                     (void (*) (void *, void *)) (freefun), (arg))
 311
 312 # define obstack_chunkfun(h, newchunkfun) \
 313   ((h) -> chunkfun = (struct _obstack_chunk *(*)(void *, long)) (newchunkfun))
 314
 315 # define obstack_freefun(h, newfreefun) \
 316   ((h) -> freefun = (void (*)(void *, struct _obstack_chunk *)) (newfreefun))
 317
 318 #else
 319
 320 # define obstack_init(h) \
 321   _obstack_begin ((h), 0, 0, \
 322                   (void *(*) ()) obstack_chunk_alloc, (void (*) ()) obstack_chunk_free)
 323
 324 # define obstack_begin(h, size) \
 325   _obstack_begin ((h), (size), 0, \
 326                   (void *(*) ()) obstack_chunk_alloc, (void (*) ()) obstack_chunk_free)
 327
 328 # define obstack_specify_allocation(h, size, alignment, chunkfun, freefun) \
 329   _obstack_begin ((h), (size), (alignment), \
 330                     (void *(*) ()) (chunkfun), (void (*) ()) (freefun))
 331
 332 # define obstack_specify_allocation_with_arg(h, size, alignment, chunkfun, freefun, arg) \
 333   _obstack_begin_1 ((h), (size), (alignment), \
 334                     (void *(*) ()) (chunkfun), (void (*) ()) (freefun), (arg))
 335
 336 # define obstack_chunkfun(h, newchunkfun) \
 337   ((h) -> chunkfun = (struct _obstack_chunk *(*)()) (newchunkfun))
 338
 339 # define obstack_freefun(h, newfreefun) \
 340   ((h) -> freefun = (void (*)()) (newfreefun))
 341
 342 #endif
 343
 344 #define obstack_1grow_fast(h,achar) (*((h)->next_free)++ = achar)
 345
 346 #define obstack_blank_fast(h,n) ((h)->next_free += (n))
 347
 348 #define obstack_memory_used(h) _obstack_memory_used (h)
 349 \f
 350 #if defined __GNUC__ && defined __STDC__ && __STDC__
 351 /* NextStep 2.0 cc is really gcc 1.93 but it defines __GNUC__ = 2 and
 352    does not implement __extension__.  But that compiler doesn't define
 353    __GNUC_MINOR__.  */
 354 # if __GNUC__ < 2 || (__NeXT__ && !__GNUC_MINOR__)
 355 #  define __extension__
 356 # endif
 357
 358 /* For GNU C, if not -traditional,
 359    we can define these macros to compute all args only once
 360    without using a global variable.
 361    Also, we can avoid using the `temp' slot, to make faster code.  */
 362
 363 # define obstack_object_size(OBSTACK)                                   \
 364   __extension__                                                         \
 365   ({ struct obstack *__o = (OBSTACK);                                   \
 366      (unsigned) (__o->next_free - __o->object_base); })
 367
 368 # define obstack_room(OBSTACK)                                          \
 369   __extension__                                                         \
 370   ({ struct obstack *__o = (OBSTACK);                                   \
 371      (unsigned) (__o->chunk_limit - __o->next_free); })
 372
 373 # define obstack_make_room(OBSTACK,length)                              \
 374 __extension__                                                           \
 375 ({ struct obstack *__o = (OBSTACK);                                     \
 376    int __len = (length);                                                \
 377    if (__o->chunk_limit - __o->next_free < __len)                       \
 378      _obstack_newchunk (__o, __len);                                    \
 379    (void) 0; })
 380
 381 # define obstack_empty_p(OBSTACK)                                       \
 382   __extension__                                                         \
 383   ({ struct obstack *__o = (OBSTACK);                                   \
 384      (__o->chunk->prev == 0 && __o->next_free - __o->chunk->contents == 0); })
 385
 386 # define obstack_grow(OBSTACK,where,length)                             \
 387 __extension__                                                           \
 388 ({ struct obstack *__o = (OBSTACK);                                     \
 389    int __len = (length);                                                \
 390    if (__o->next_free + __len > __o->chunk_limit)                       \
 391      _obstack_newchunk (__o, __len);                                    \
 392    _obstack_memcpy (__o->next_free, (where), __len);                    \
 393    __o->next_free += __len;                                             \
 394    (void) 0; })
 395
 396 # define obstack_grow0(OBSTACK,where,length)                            \
 397 __extension__                                                           \
 398 ({ struct obstack *__o = (OBSTACK);                                     \
 399    int __len = (length);                                                \
 400    if (__o->next_free + __len + 1 > __o->chunk_limit)                   \
 401      _obstack_newchunk (__o, __len + 1);                                \
 402    _obstack_memcpy (__o->next_free, (where), __len);                    \
 403    __o->next_free += __len;                                             \
 404    *(__o->next_free)++ = 0;                                             \
 405    (void) 0; })
 406
 407 # define obstack_1grow(OBSTACK,datum)                                   \
 408 __extension__                                                           \
 409 ({ struct obstack *__o = (OBSTACK);                                     \
 410    if (__o->next_free + 1 > __o->chunk_limit)                           \
 411      _obstack_newchunk (__o, 1);                                        \
 412    *(__o->next_free)++ = (datum);                                       \
 413    (void) 0; })
 414
 415 /* These assume that the obstack alignment is good enough for pointers or ints,
 416    and that the data added so far to the current object
 417    shares that much alignment.  */
 418
 419 # define obstack_ptr_grow(OBSTACK,datum)                                \
 420 __extension__                                                           \
 421 ({ struct obstack *__o = (OBSTACK);                                     \
 422    if (__o->next_free + sizeof (void *) > __o->chunk_limit)             \
 423      _obstack_newchunk (__o, sizeof (void *));                          \
 424    *((void **)__o->next_free)++ = ((void *)datum);                      \
 425    (void) 0; })
 426
 427 # define obstack_int_grow(OBSTACK,datum)                                \
 428 __extension__                                                           \
 429 ({ struct obstack *__o = (OBSTACK);                                     \
 430    if (__o->next_free + sizeof (int) > __o->chunk_limit)                \
 431      _obstack_newchunk (__o, sizeof (int));                             \
 432    *((int *)__o->next_free)++ = ((int)datum);                           \
 433    (void) 0; })
 434
 435 # define obstack_ptr_grow_fast(h,aptr) (*((void **) (h)->next_free)++ = (void *)aptr)
 436 # define obstack_int_grow_fast(h,aint) (*((int *) (h)->next_free)++ = (int) aint)
 437
 438 # define obstack_blank(OBSTACK,length)                                  \
 439 __extension__                                                           \
 440 ({ struct obstack *__o = (OBSTACK);                                     \
 441    int __len = (length);                                                \
 442    if (__o->chunk_limit - __o->next_free < __len)                       \
 443      _obstack_newchunk (__o, __len);                                    \
 444    __o->next_free += __len;                                             \
 445    (void) 0; })
 446
 447 # define obstack_alloc(OBSTACK,length)                                  \
 448 __extension__                                                           \
 449 ({ struct obstack *__h = (OBSTACK);                                     \
 450    obstack_blank (__h, (length));                                       \
 451    obstack_finish (__h); })
 452
 453 # define obstack_copy(OBSTACK,where,length)                             \
 454 __extension__                                                           \
 455 ({ struct obstack *__h = (OBSTACK);                                     \
 456    obstack_grow (__h, (where), (length));                               \
 457    obstack_finish (__h); })
 458
 459 # define obstack_copy0(OBSTACK,where,length)                            \
 460 __extension__                                                           \
 461 ({ struct obstack *__h = (OBSTACK);                                     \
 462    obstack_grow0 (__h, (where), (length));                              \
 463    obstack_finish (__h); })
 464
 465 /* The local variable is named __o1 to avoid a name conflict
 466    when obstack_blank is called.  */
 467 # define obstack_finish(OBSTACK)                                        \
 468 __extension__                                                           \
 469 ({ struct obstack *__o1 = (OBSTACK);                                    \
 470    void *value;                                                         \
 471    value = (void *) __o1->object_base;                                  \
 472    if (__o1->next_free == value)                                        \
 473      __o1->maybe_empty_object = 1;                                      \
 474    __o1->next_free                                                      \
 475      = __INT_TO_PTR ((__PTR_TO_INT (__o1->next_free)+__o1->alignment_mask)\
 476                      & ~ (__o1->alignment_mask));                       \
 477    if (__o1->next_free - (char *)__o1->chunk                            \
 478        > __o1->chunk_limit - (char *)__o1->chunk)                       \
 479      __o1->next_free = __o1->chunk_limit;                               \
 480    __o1->object_base = __o1->next_free;                                 \
 481    value; })
 482
 483 # define obstack_free(OBSTACK, OBJ)                                     \
 484 __extension__                                                           \
 485 ({ struct obstack *__o = (OBSTACK);                                     \
 486    void *__obj = (OBJ);                                                 \
 487    if (__obj > (void *)__o->chunk && __obj < (void *)__o->chunk_limit)  \
 488      __o->next_free = __o->object_base = __obj;                         \
 489    else (obstack_free) (__o, __obj); })
 490 \f
 491 #else /* not __GNUC__ or not __STDC__ */
 492
 493 # define obstack_object_size(h) \
 494  (unsigned) ((h)->next_free - (h)->object_base)
 495
 496 # define obstack_room(h)                \
 497  (unsigned) ((h)->chunk_limit - (h)->next_free)
 498
 499 # define obstack_empty_p(h) \
 500  ((h)->chunk->prev == 0 && (h)->next_free - (h)->chunk->contents == 0)
 501
 502 /* Note that the call to _obstack_newchunk is enclosed in (..., 0)
 503    so that we can avoid having void expressions
 504    in the arms of the conditional expression.
 505    Casting the third operand to void was tried before,
 506    but some compilers won't accept it.  */
 507
 508 # define obstack_make_room(h,length)                                    \
 509 ( (h)->temp = (length),                                                 \
 510   (((h)->next_free + (h)->temp > (h)->chunk_limit)                      \
 511    ? (_obstack_newchunk ((h), (h)->temp), 0) : 0))
 512
 513 # define obstack_grow(h,where,length)                                   \
 514 ( (h)->temp = (length),                                                 \
 515   (((h)->next_free + (h)->temp > (h)->chunk_limit)                      \
 516    ? (_obstack_newchunk ((h), (h)->temp), 0) : 0),                      \
 517   _obstack_memcpy ((h)->next_free, (where), (h)->temp),                 \
 518   (h)->next_free += (h)->temp)
 519
 520 # define obstack_grow0(h,where,length)                                  \
 521 ( (h)->temp = (length),                                                 \
 522   (((h)->next_free + (h)->temp + 1 > (h)->chunk_limit)                  \
 523    ? (_obstack_newchunk ((h), (h)->temp + 1), 0) : 0),                  \
 524   _obstack_memcpy ((h)->next_free, (where), (h)->temp),                 \
 525   (h)->next_free += (h)->temp,                                          \
 526   *((h)->next_free)++ = 0)
 527
 528 # define obstack_1grow(h,datum)                                         \
 529 ( (((h)->next_free + 1 > (h)->chunk_limit)                              \
 530    ? (_obstack_newchunk ((h), 1), 0) : 0),                              \
 531   (*((h)->next_free)++ = (datum)))
 532
 533 # define obstack_ptr_grow(h,datum)                                      \
 534 ( (((h)->next_free + sizeof (char *) > (h)->chunk_limit)                \
 535    ? (_obstack_newchunk ((h), sizeof (char *)), 0) : 0),                \
 536   (*((char **) (((h)->next_free+=sizeof(char *))-sizeof(char *))) = ((char *) datum)))
 537
 538 # define obstack_int_grow(h,datum)                                      \
 539 ( (((h)->next_free + sizeof (int) > (h)->chunk_limit)                   \
 540    ? (_obstack_newchunk ((h), sizeof (int)), 0) : 0),                   \
 541   (*((int *) (((h)->next_free+=sizeof(int))-sizeof(int))) = ((int) datum)))
 542
 543 # define obstack_ptr_grow_fast(h,aptr) (*((char **) (h)->next_free)++ = (char *) aptr)
 544 # define obstack_int_grow_fast(h,aint) (*((int *) (h)->next_free)++ = (int) aint)
 545
 546 # define obstack_blank(h,length)                                        \
 547 ( (h)->temp = (length),                                                 \
 548   (((h)->chunk_limit - (h)->next_free < (h)->temp)                      \
 549    ? (_obstack_newchunk ((h), (h)->temp), 0) : 0),                      \
 550   ((h)->next_free += (h)->temp))
 551
 552 # define obstack_alloc(h,length)                                        \
 553  (obstack_blank ((h), (length)), obstack_finish ((h)))
 554
 555 # define obstack_copy(h,where,length)                                   \
 556  (obstack_grow ((h), (where), (length)), obstack_finish ((h)))
 557
 558 # define obstack_copy0(h,where,length)                                  \
 559  (obstack_grow0 ((h), (where), (length)), obstack_finish ((h)))
 560
 561 # define obstack_finish(h)                                              \
 562 ( ((h)->next_free == (h)->object_base                                   \
 563    ? (((h)->maybe_empty_object = 1), 0)                                 \
 564    : 0),                                                                \
 565   (h)->temp = __PTR_TO_INT ((h)->object_base),                          \
 566   (h)->next_free                                                        \
 567     = __INT_TO_PTR ((__PTR_TO_INT ((h)->next_free)+(h)->alignment_mask) \
 568                     & ~ ((h)->alignment_mask)),                         \
 569   (((h)->next_free - (char *) (h)->chunk                                \
 570     > (h)->chunk_limit - (char *) (h)->chunk)                           \
 571    ? ((h)->next_free = (h)->chunk_limit) : 0),                          \
 572   (h)->object_base = (h)->next_free,                                    \
 573   __INT_TO_PTR ((h)->temp))
 574
 575 # if defined __STDC__ && __STDC__
 576 #  define obstack_free(h,obj)                                           \
 577 ( (h)->temp = (char *) (obj) - (char *) (h)->chunk,                     \
 578   (((h)->temp > 0 && (h)->temp < (h)->chunk_limit - (char *) (h)->chunk)\
 579    ? (int) ((h)->next_free = (h)->object_base                           \
 580             = (h)->temp + (char *) (h)->chunk)                          \
 581    : (((obstack_free) ((h), (h)->temp + (char *) (h)->chunk), 0), 0)))
 582 # else
 583 #  define obstack_free(h,obj)                                           \
 584 ( (h)->temp = (char *) (obj) - (char *) (h)->chunk,                     \
 585   (((h)->temp > 0 && (h)->temp < (h)->chunk_limit - (char *) (h)->chunk)\
 586    ? (int) ((h)->next_free = (h)->object_base                           \
 587             = (h)->temp + (char *) (h)->chunk)                          \
 588    : (_obstack_free ((h), (h)->temp + (char *) (h)->chunk), 0)))
 589 # endif
 590
 591 #endif /* not __GNUC__ or not __STDC__ */
 592
 593 #ifdef __cplusplus
 594 }       /* C++ */
 595 #endif
 596
 597 #endif /* obstack.h */