malloc/obstack.h

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