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 # define _obstack_memcpy(To, From, N) memcpy ((To), (From), (N))
 147 #else
 148 # ifdef memcpy
 149 #  define _obstack_memcpy(To, From, N) memcpy ((To), (From), (N))
 150 # else
 151 #  define _obstack_memcpy(To, From, N) bcopy ((From), (To), (N))
 152 # endif
 153 #endif
 154
 155 struct _obstack_chunk           /* Lives at front of each chunk. */
 156 {
 157   char  *limit;                 /* 1 past end of this chunk */
 158   struct _obstack_chunk *prev;  /* address of prior chunk or NULL */
 159   char  contents[4];            /* objects begin here */
 160 };
 161
 162 struct obstack          /* control current object in current chunk */
 163 {
 164   long  chunk_size;             /* preferred size to allocate chunks in */
 165   struct _obstack_chunk *chunk; /* address of current struct obstack_chunk */
 166   char  *object_base;           /* address of object we are building */
 167   char  *next_free;             /* where to add next char to current object */
 168   char  *chunk_limit;           /* address of char after current chunk */
 169   PTR_INT_TYPE temp;            /* Temporary for some macros.  */
 170   int   alignment_mask;         /* Mask of alignment for each object. */
 171 #if defined __STDC__ && __STDC__
 172   /* These prototypes vary based on `use_extra_arg', and we use
 173      casts to the prototypeless function type in all assignments,
 174      but having prototypes here quiets -Wstrict-prototypes.  */
 175   struct _obstack_chunk *(*chunkfun) (void *, long);
 176   void (*freefun) (void *, struct _obstack_chunk *);
 177   void *extra_arg;              /* first arg for chunk alloc/dealloc funcs */
 178 #else
 179   struct _obstack_chunk *(*chunkfun) (); /* User's fcn to allocate a chunk.  */
 180   void (*freefun) ();           /* User's function to free a chunk.  */
 181   char *extra_arg;              /* first arg for chunk alloc/dealloc funcs */
 182 #endif
 183   unsigned use_extra_arg:1;     /* chunk alloc/dealloc funcs take extra arg */
 184   unsigned maybe_empty_object:1;/* There is a possibility that the current
 185                                    chunk contains a zero-length object.  This
 186                                    prevents freeing the chunk if we allocate
 187                                    a bigger chunk to replace it. */
 188   unsigned alloc_failed:1;      /* No longer used, as we now call the failed
 189                                    handler on error, but retained for binary
 190                                    compatibility.  */
 191 };
 192
 193 /* Declare the external functions we use; they are in obstack.c.  */
 194
 195 #if defined __STDC__ && __STDC__
 196 extern void _obstack_newchunk (struct obstack *, int);
 197 extern void _obstack_free (struct obstack *, void *);
 198 extern int _obstack_begin (struct obstack *, int, int,
 199                             void *(*) (long), void (*) (void *));
 200 extern int _obstack_begin_1 (struct obstack *, int, int,
 201                              void *(*) (void *, long),
 202                              void (*) (void *, void *), void *);
 203 extern int _obstack_memory_used (struct obstack *);
 204 #else
 205 extern void _obstack_newchunk ();
 206 extern void _obstack_free ();
 207 extern int _obstack_begin ();
 208 extern int _obstack_begin_1 ();
 209 extern int _obstack_memory_used ();
 210 #endif
 211 \f
 212 #if defined __STDC__ && __STDC__
 213
 214 /* Do the function-declarations after the structs
 215    but before defining the macros.  */
 216
 217 void obstack_init (struct obstack *obstack);
 218
 219 void * obstack_alloc (struct obstack *obstack, int size);
 220
 221 void * obstack_copy (struct obstack *obstack, void *address, int size);
 222 void * obstack_copy0 (struct obstack *obstack, void *address, int size);
 223
 224 void obstack_free (struct obstack *obstack, void *block);
 225
 226 void obstack_blank (struct obstack *obstack, int size);
 227
 228 void obstack_grow (struct obstack *obstack, void *data, int size);
 229 void obstack_grow0 (struct obstack *obstack, void *data, int size);
 230
 231 void obstack_1grow (struct obstack *obstack, int data_char);
 232 void obstack_ptr_grow (struct obstack *obstack, void *data);
 233 void obstack_int_grow (struct obstack *obstack, int data);
 234
 235 void * obstack_finish (struct obstack *obstack);
 236
 237 int obstack_object_size (struct obstack *obstack);
 238
 239 int obstack_room (struct obstack *obstack);
 240 void obstack_make_room (struct obstack *obstack, int size);
 241 void obstack_1grow_fast (struct obstack *obstack, int data_char);
 242 void obstack_ptr_grow_fast (struct obstack *obstack, void *data);
 243 void obstack_int_grow_fast (struct obstack *obstack, int data);
 244 void obstack_blank_fast (struct obstack *obstack, int size);
 245
 246 void * obstack_base (struct obstack *obstack);
 247 void * obstack_next_free (struct obstack *obstack);
 248 int obstack_alignment_mask (struct obstack *obstack);
 249 int obstack_chunk_size (struct obstack *obstack);
 250 int obstack_memory_used (struct obstack *obstack);
 251
 252 #endif /* __STDC__ */
 253
 254 /* Non-ANSI C cannot really support alternative functions for these macros,
 255    so we do not declare them.  */
 256
 257 /* Error handler called when `obstack_chunk_alloc' failed to allocate
 258    more memory.  This can be set to a user defined function.  The
 259    default action is to print a message and abort.  */
 260 #if defined __STDC__ && __STDC__
 261 extern void (*obstack_alloc_failed_handler) (void);
 262 #else
 263 extern void (*obstack_alloc_failed_handler) ();
 264 #endif
 265
 266 /* Exit value used when `print_and_abort' is used.  */
 267 extern int obstack_exit_failure;
 268 \f
 269 /* Pointer to beginning of object being allocated or to be allocated next.
 270    Note that this might not be the final address of the object
 271    because a new chunk might be needed to hold the final size.  */
 272
 273 #define obstack_base(h) ((h)->object_base)
 274
 275 /* Size for allocating ordinary chunks.  */
 276
 277 #define obstack_chunk_size(h) ((h)->chunk_size)
 278
 279 /* Pointer to next byte not yet allocated in current chunk.  */
 280
 281 #define obstack_next_free(h)    ((h)->next_free)
 282
 283 /* Mask specifying low bits that should be clear in address of an object.  */
 284
 285 #define obstack_alignment_mask(h) ((h)->alignment_mask)
 286
 287 /* To prevent prototype warnings provide complete argument list in
 288    standard C version.  */
 289 #if defined __STDC__ && __STDC__
 290
 291 # define obstack_init(h) \
 292   _obstack_begin ((h), 0, 0, \
 293                   (void *(*) (long)) obstack_chunk_alloc, (void (*) (void *)) obstack_chunk_free)
 294
 295 # define obstack_begin(h, size) \
 296   _obstack_begin ((h), (size), 0, \
 297                   (void *(*) (long)) obstack_chunk_alloc, (void (*) (void *)) obstack_chunk_free)
 298
 299 # define obstack_specify_allocation(h, size, alignment, chunkfun, freefun) \
 300   _obstack_begin ((h), (size), (alignment), \
 301                     (void *(*) (long)) (chunkfun), (void (*) (void *)) (freefun))
 302
 303 # define obstack_specify_allocation_with_arg(h, size, alignment, chunkfun, freefun, arg) \
 304   _obstack_begin_1 ((h), (size), (alignment), \
 305                     (void *(*) (void *, long)) (chunkfun), \
 306                     (void (*) (void *, void *)) (freefun), (arg))
 307
 308 # define obstack_chunkfun(h, newchunkfun) \
 309   ((h) -> chunkfun = (struct _obstack_chunk *(*)(void *, long)) (newchunkfun))
 310
 311 # define obstack_freefun(h, newfreefun) \
 312   ((h) -> freefun = (void (*)(void *, struct _obstack_chunk *)) (newfreefun))
 313
 314 #else
 315
 316 # define obstack_init(h) \
 317   _obstack_begin ((h), 0, 0, \
 318                   (void *(*) ()) obstack_chunk_alloc, (void (*) ()) obstack_chunk_free)
 319
 320 # define obstack_begin(h, size) \
 321   _obstack_begin ((h), (size), 0, \
 322                   (void *(*) ()) obstack_chunk_alloc, (void (*) ()) obstack_chunk_free)
 323
 324 # define obstack_specify_allocation(h, size, alignment, chunkfun, freefun) \
 325   _obstack_begin ((h), (size), (alignment), \
 326                     (void *(*) ()) (chunkfun), (void (*) ()) (freefun))
 327
 328 # define obstack_specify_allocation_with_arg(h, size, alignment, chunkfun, freefun, arg) \
 329   _obstack_begin_1 ((h), (size), (alignment), \
 330                     (void *(*) ()) (chunkfun), (void (*) ()) (freefun), (arg))
 331
 332 # define obstack_chunkfun(h, newchunkfun) \
 333   ((h) -> chunkfun = (struct _obstack_chunk *(*)()) (newchunkfun))
 334
 335 # define obstack_freefun(h, newfreefun) \
 336   ((h) -> freefun = (void (*)()) (newfreefun))
 337
 338 #endif
 339
 340 #define obstack_1grow_fast(h,achar) (*((h)->next_free)++ = achar)
 341
 342 #define obstack_blank_fast(h,n) ((h)->next_free += (n))
 343
 344 #define obstack_memory_used(h) _obstack_memory_used (h)
 345 \f
 346 #if defined __GNUC__ && defined __STDC__ && __STDC__
 347 /* NextStep 2.0 cc is really gcc 1.93 but it defines __GNUC__ = 2 and
 348    does not implement __extension__.  But that compiler doesn't define
 349    __GNUC_MINOR__.  */
 350 # if __GNUC__ < 2 || (__NeXT__ && !__GNUC_MINOR__)
 351 #  define __extension__
 352 # endif
 353
 354 /* For GNU C, if not -traditional,
 355    we can define these macros to compute all args only once
 356    without using a global variable.
 357    Also, we can avoid using the `temp' slot, to make faster code.  */
 358
 359 # define obstack_object_size(OBSTACK)                                   \
 360   __extension__                                                         \
 361   ({ struct obstack *__o = (OBSTACK);                                   \
 362      (unsigned) (__o->next_free - __o->object_base); })
 363
 364 # define obstack_room(OBSTACK)                                          \
 365   __extension__                                                         \
 366   ({ struct obstack *__o = (OBSTACK);                                   \
 367      (unsigned) (__o->chunk_limit - __o->next_free); })
 368
 369 # define obstack_make_room(OBSTACK,length)                              \
 370 __extension__                                                           \
 371 ({ struct obstack *__o = (OBSTACK);                                     \
 372    int __len = (length);                                                \
 373    if (__o->chunk_limit - __o->next_free < __len)                       \
 374      _obstack_newchunk (__o, __len);                                    \
 375    (void) 0; })
 376
 377 # define obstack_empty_p(OBSTACK)                                       \
 378   __extension__                                                         \
 379   ({ struct obstack *__o = (OBSTACK);                                   \
 380      (__o->chunk->prev == 0 && __o->next_free - __o->chunk->contents == 0); })
 381
 382 # define obstack_grow(OBSTACK,where,length)                             \
 383 __extension__                                                           \
 384 ({ struct obstack *__o = (OBSTACK);                                     \
 385    int __len = (length);                                                \
 386    if (__o->next_free + __len > __o->chunk_limit)                       \
 387      _obstack_newchunk (__o, __len);                                    \
 388    _obstack_memcpy (__o->next_free, (char *) (where), __len);           \
 389    __o->next_free += __len;                                             \
 390    (void) 0; })
 391
 392 # define obstack_grow0(OBSTACK,where,length)                            \
 393 __extension__                                                           \
 394 ({ struct obstack *__o = (OBSTACK);                                     \
 395    int __len = (length);                                                \
 396    if (__o->next_free + __len + 1 > __o->chunk_limit)                   \
 397      _obstack_newchunk (__o, __len + 1);                                \
 398    _obstack_memcpy (__o->next_free, (char *) (where), __len);           \
 399    __o->next_free += __len;                                             \
 400    *(__o->next_free)++ = 0;                                             \
 401    (void) 0; })
 402
 403 # define obstack_1grow(OBSTACK,datum)                                   \
 404 __extension__                                                           \
 405 ({ struct obstack *__o = (OBSTACK);                                     \
 406    if (__o->next_free + 1 > __o->chunk_limit)                           \
 407      _obstack_newchunk (__o, 1);                                        \
 408    *(__o->next_free)++ = (datum);                                       \
 409    (void) 0; })
 410
 411 /* These assume that the obstack alignment is good enough for pointers or ints,
 412    and that the data added so far to the current object
 413    shares that much alignment.  */
 414
 415 # define obstack_ptr_grow(OBSTACK,datum)                                \
 416 __extension__                                                           \
 417 ({ struct obstack *__o = (OBSTACK);                                     \
 418    if (__o->next_free + sizeof (void *) > __o->chunk_limit)             \
 419      _obstack_newchunk (__o, sizeof (void *));                          \
 420    *((void **)__o->next_free)++ = ((void *)datum);                      \
 421    (void) 0; })
 422
 423 # define obstack_int_grow(OBSTACK,datum)                                \
 424 __extension__                                                           \
 425 ({ struct obstack *__o = (OBSTACK);                                     \
 426    if (__o->next_free + sizeof (int) > __o->chunk_limit)                \
 427      _obstack_newchunk (__o, sizeof (int));                             \
 428    *((int *)__o->next_free)++ = ((int)datum);                           \
 429    (void) 0; })
 430
 431 # define obstack_ptr_grow_fast(h,aptr) (*((void **) (h)->next_free)++ = (void *)aptr)
 432 # define obstack_int_grow_fast(h,aint) (*((int *) (h)->next_free)++ = (int) aint)
 433
 434 # define obstack_blank(OBSTACK,length)                                  \
 435 __extension__                                                           \
 436 ({ struct obstack *__o = (OBSTACK);                                     \
 437    int __len = (length);                                                \
 438    if (__o->chunk_limit - __o->next_free < __len)                       \
 439      _obstack_newchunk (__o, __len);                                    \
 440    __o->next_free += __len;                                             \
 441    (void) 0; })
 442
 443 # define obstack_alloc(OBSTACK,length)                                  \
 444 __extension__                                                           \
 445 ({ struct obstack *__h = (OBSTACK);                                     \
 446    obstack_blank (__h, (length));                                       \
 447    obstack_finish (__h); })
 448
 449 # define obstack_copy(OBSTACK,where,length)                             \
 450 __extension__                                                           \
 451 ({ struct obstack *__h = (OBSTACK);                                     \
 452    obstack_grow (__h, (where), (length));                               \
 453    obstack_finish (__h); })
 454
 455 # define obstack_copy0(OBSTACK,where,length)                            \
 456 __extension__                                                           \
 457 ({ struct obstack *__h = (OBSTACK);                                     \
 458    obstack_grow0 (__h, (where), (length));                              \
 459    obstack_finish (__h); })
 460
 461 /* The local variable is named __o1 to avoid a name conflict
 462    when obstack_blank is called.  */
 463 # define obstack_finish(OBSTACK)                                        \
 464 __extension__                                                           \
 465 ({ struct obstack *__o1 = (OBSTACK);                                    \
 466    void *value;                                                         \
 467    value = (void *) __o1->object_base;                                  \
 468    if (__o1->next_free == value)                                        \
 469      __o1->maybe_empty_object = 1;                                      \
 470    __o1->next_free                                                      \
 471      = __INT_TO_PTR ((__PTR_TO_INT (__o1->next_free)+__o1->alignment_mask)\
 472                      & ~ (__o1->alignment_mask));                       \
 473    if (__o1->next_free - (char *)__o1->chunk                            \
 474        > __o1->chunk_limit - (char *)__o1->chunk)                       \
 475      __o1->next_free = __o1->chunk_limit;                               \
 476    __o1->object_base = __o1->next_free;                                 \
 477    value; })
 478
 479 # define obstack_free(OBSTACK, OBJ)                                     \
 480 __extension__                                                           \
 481 ({ struct obstack *__o = (OBSTACK);                                     \
 482    void *__obj = (OBJ);                                                 \
 483    if (__obj > (void *)__o->chunk && __obj < (void *)__o->chunk_limit)  \
 484      __o->next_free = __o->object_base = __obj;                         \
 485    else (obstack_free) (__o, __obj); })
 486 \f
 487 #else /* not __GNUC__ or not __STDC__ */
 488
 489 # define obstack_object_size(h) \
 490  (unsigned) ((h)->next_free - (h)->object_base)
 491
 492 # define obstack_room(h)                \
 493  (unsigned) ((h)->chunk_limit - (h)->next_free)
 494
 495 # define obstack_empty_p(h) \
 496  ((h)->chunk->prev == 0 && (h)->next_free - (h)->chunk->contents == 0)
 497
 498 /* Note that the call to _obstack_newchunk is enclosed in (..., 0)
 499    so that we can avoid having void expressions
 500    in the arms of the conditional expression.
 501    Casting the third operand to void was tried before,
 502    but some compilers won't accept it.  */
 503
 504 # define obstack_make_room(h,length)                                    \
 505 ( (h)->temp = (length),                                                 \
 506   (((h)->next_free + (h)->temp > (h)->chunk_limit)                      \
 507    ? (_obstack_newchunk ((h), (h)->temp), 0) : 0))
 508
 509 # define obstack_grow(h,where,length)                                   \
 510 ( (h)->temp = (length),                                                 \
 511   (((h)->next_free + (h)->temp > (h)->chunk_limit)                      \
 512    ? (_obstack_newchunk ((h), (h)->temp), 0) : 0),                      \
 513   _obstack_memcpy ((h)->next_free, (char *) (where), (h)->temp),        \
 514   (h)->next_free += (h)->temp)
 515
 516 # define obstack_grow0(h,where,length)                                  \
 517 ( (h)->temp = (length),                                                 \
 518   (((h)->next_free + (h)->temp + 1 > (h)->chunk_limit)                  \
 519    ? (_obstack_newchunk ((h), (h)->temp + 1), 0) : 0),                  \
 520   _obstack_memcpy ((h)->next_free, (char *) (where), (h)->temp),        \
 521   (h)->next_free += (h)->temp,                                          \
 522   *((h)->next_free)++ = 0)
 523
 524 # define obstack_1grow(h,datum)                                         \
 525 ( (((h)->next_free + 1 > (h)->chunk_limit)                              \
 526    ? (_obstack_newchunk ((h), 1), 0) : 0),                              \
 527   (*((h)->next_free)++ = (datum)))
 528
 529 # define obstack_ptr_grow(h,datum)                                      \
 530 ( (((h)->next_free + sizeof (char *) > (h)->chunk_limit)                \
 531    ? (_obstack_newchunk ((h), sizeof (char *)), 0) : 0),                \
 532   (*((char **) (((h)->next_free+=sizeof(char *))-sizeof(char *))) = ((char *) datum)))
 533
 534 # define obstack_int_grow(h,datum)                                      \
 535 ( (((h)->next_free + sizeof (int) > (h)->chunk_limit)                   \
 536    ? (_obstack_newchunk ((h), sizeof (int)), 0) : 0),                   \
 537   (*((int *) (((h)->next_free+=sizeof(int))-sizeof(int))) = ((int) datum)))
 538
 539 # define obstack_ptr_grow_fast(h,aptr) (*((char **) (h)->next_free)++ = (char *) aptr)
 540 # define obstack_int_grow_fast(h,aint) (*((int *) (h)->next_free)++ = (int) aint)
 541
 542 # define obstack_blank(h,length)                                        \
 543 ( (h)->temp = (length),                                                 \
 544   (((h)->chunk_limit - (h)->next_free < (h)->temp)                      \
 545    ? (_obstack_newchunk ((h), (h)->temp), 0) : 0),                      \
 546   ((h)->next_free += (h)->temp))
 547
 548 # define obstack_alloc(h,length)                                        \
 549  (obstack_blank ((h), (length)), obstack_finish ((h)))
 550
 551 # define obstack_copy(h,where,length)                                   \
 552  (obstack_grow ((h), (where), (length)), obstack_finish ((h)))
 553
 554 # define obstack_copy0(h,where,length)                                  \
 555  (obstack_grow0 ((h), (where), (length)), obstack_finish ((h)))
 556
 557 # define obstack_finish(h)                                              \
 558 ( ((h)->next_free == (h)->object_base                                   \
 559    ? (((h)->maybe_empty_object = 1), 0)                                 \
 560    : 0),                                                                \
 561   (h)->temp = __PTR_TO_INT ((h)->object_base),                          \
 562   (h)->next_free                                                        \
 563     = __INT_TO_PTR ((__PTR_TO_INT ((h)->next_free)+(h)->alignment_mask) \
 564                     & ~ ((h)->alignment_mask)),                         \
 565   (((h)->next_free - (char *) (h)->chunk                                \
 566     > (h)->chunk_limit - (char *) (h)->chunk)                           \
 567    ? ((h)->next_free = (h)->chunk_limit) : 0),                          \
 568   (h)->object_base = (h)->next_free,                                    \
 569   __INT_TO_PTR ((h)->temp))
 570
 571 # if defined __STDC__ && __STDC__
 572 #  define obstack_free(h,obj)                                           \
 573 ( (h)->temp = (char *) (obj) - (char *) (h)->chunk,                     \
 574   (((h)->temp > 0 && (h)->temp < (h)->chunk_limit - (char *) (h)->chunk)\
 575    ? (int) ((h)->next_free = (h)->object_base                           \
 576             = (h)->temp + (char *) (h)->chunk)                          \
 577    : (((obstack_free) ((h), (h)->temp + (char *) (h)->chunk), 0), 0)))
 578 # else
 579 #  define obstack_free(h,obj)                                           \
 580 ( (h)->temp = (char *) (obj) - (char *) (h)->chunk,                     \
 581   (((h)->temp > 0 && (h)->temp < (h)->chunk_limit - (char *) (h)->chunk)\
 582    ? (int) ((h)->next_free = (h)->object_base                           \
 583             = (h)->temp + (char *) (h)->chunk)                          \
 584    : (_obstack_free ((h), (h)->temp + (char *) (h)->chunk), 0)))
 585 # endif
 586
 587 #endif /* not __GNUC__ or not __STDC__ */
 588
 589 #ifdef __cplusplus
 590 }       /* C++ */
 591 #endif
 592
 593 #endif /* obstack.h */