source: trunk/src/gcc/include/obstack.h@ 2410

Last change on this file since 2410 was 1475, checked in by bird, 21 years ago

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