source: trunk/grep/lib/obstack.h@ 2815

Last change on this file since 2815 was 2557, checked in by bird, 19 years ago

grep 2.5.1a
File size: 22.3 KB
Line 
1/* obstack.h - object stack macros
2 Copyright (C) 1988,89,90,91,92,93,94,96,97,98,99 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
24All the apparent functions defined here are macros. The idea
25is that you would use these pre-tested macros to solve a
26very specific set of problems, and they would run fast.
27Caution: no side-effects in arguments please!! They may be
28evaluated MANY times!!
29
30These macros operate a stack of objects. Each object starts life
31small, and may grow to maturity. (Consider building a word syllable
32by syllable.) An object can move while it is growing. Once it has
33been "finished" it never changes address again. So the "top of the
34stack" is typically an immature growing object, while the rest of the
35stack is of mature, fixed size and fixed address objects.
36
37These routines grab large chunks of memory, using a function you
38supply, called `obstack_chunk_alloc'. On occasion, they free chunks,
39by calling `obstack_chunk_free'. You must define them and declare
40them before using any obstack macros.
41
42Each independent stack is represented by a `struct obstack'.
43Each of the obstack macros expects a pointer to such a structure
44as the first argument.
45
46One motivation for this package is the problem of growing char strings
47in 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
49would not like to put any arbitrary upper limit on the length of your
50symbols.
51
52In practice this often means you will build many short symbols and a
53few long symbols. At the time you are reading a symbol you don't know
54how long it is. One traditional method is to read a symbol into a
55buffer, realloc()ating the buffer every time you try to read a symbol
56that is longer than the buffer. This is beaut, but you still will
57want to copy the symbol from the buffer to a more permanent
58symbol-table entry say about half the time.
59
60With obstacks, you can work differently. Use one obstack for all symbol
61names. As you read a symbol, grow the name in the obstack gradually.
62When the name is complete, finalize it. Then, if the symbol exists already,
63free the newly read name.
64
65The way we do this is to take a large chunk, allocating memory from
66low addresses. When you want to build a symbol in the chunk you just
67add chars above the current "high water mark" in the chunk. When you
68have finished adding chars, because you got to the end of the symbol,
69you know how long the chars are, and you can create a new object.
70Mostly the chars will not burst over the highest address of the chunk,
71because you would typically expect a chunk to be (say) 100 times as
72long as an average object.
73
74In case that isn't clear, when we have enough chars to make up
75the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
76so we just point to it where it lies. No moving of chars is
77needed and this is the second win: potentially long strings need
78never be explicitly shuffled. Once an object is formed, it does not
79change its address during its lifetime.
80
81When the chars burst over a chunk boundary, we allocate a larger
82chunk, and then copy the partly formed object from the end of the old
83chunk to the beginning of the new larger chunk. We then carry on
84accreting characters to the end of the object as we normally would.
85
86A special macro is provided to add a single char at a time to a
87growing object. This allows the use of register variables, which
88break the ordinary 'growth' macro.
89
90Summary:
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 1
109
110#ifdef __cplusplus
111extern "C" {
112#endif
113
114
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
155struct _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
162struct 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__
196extern void _obstack_newchunk (struct obstack *, int);
197extern void _obstack_free (struct obstack *, void *);
198extern int _obstack_begin (struct obstack *, int, int,
199 void *(*) (long), void (*) (void *));
200extern int _obstack_begin_1 (struct obstack *, int, int,
201 void *(*) (void *, long),
202 void (*) (void *, void *), void *);
203extern int _obstack_memory_used (struct obstack *);
204#else
205extern void _obstack_newchunk ();
206extern void _obstack_free ();
207extern int _obstack_begin ();
208extern int _obstack_begin_1 ();
209extern int _obstack_memory_used ();
210#endif
211
212
213#if defined __STDC__ && __STDC__
214
215/* Do the function-declarations after the structs
216 but before defining the macros. */
217
218void obstack_init (struct obstack *obstack);
219
220void * obstack_alloc (struct obstack *obstack, int size);
221
222void * obstack_copy (struct obstack *obstack, void *address, int size);
223void * obstack_copy0 (struct obstack *obstack, void *address, int size);
224
225void obstack_free (struct obstack *obstack, void *block);
226
227void obstack_blank (struct obstack *obstack, int size);
228
229void obstack_grow (struct obstack *obstack, void *data, int size);
230void obstack_grow0 (struct obstack *obstack, void *data, int size);
231
232void obstack_1grow (struct obstack *obstack, int data_char);
233void obstack_ptr_grow (struct obstack *obstack, void *data);
234void obstack_int_grow (struct obstack *obstack, int data);
235
236void * obstack_finish (struct obstack *obstack);
237
238int obstack_object_size (struct obstack *obstack);
239
240int obstack_room (struct obstack *obstack);
241void obstack_make_room (struct obstack *obstack, int size);
242void obstack_1grow_fast (struct obstack *obstack, int data_char);
243void obstack_ptr_grow_fast (struct obstack *obstack, void *data);
244void obstack_int_grow_fast (struct obstack *obstack, int data);
245void obstack_blank_fast (struct obstack *obstack, int size);
246
247void * obstack_base (struct obstack *obstack);
248void * obstack_next_free (struct obstack *obstack);
249int obstack_alignment_mask (struct obstack *obstack);
250int obstack_chunk_size (struct obstack *obstack);
251int obstack_memory_used (struct obstack *obstack);
252
253#endif /* __STDC__ */
254
255/* Non-ANSI C cannot really support alternative functions for these macros,
256 so we do not declare them. */
257
258/* Error handler called when `obstack_chunk_alloc' failed to allocate
259 more memory. This can be set to a user defined function which
260 should either abort gracefully or use longjump - but shouldn't
261 return. The default action is to print a message and abort. */
262#if defined __STDC__ && __STDC__
263extern void (*obstack_alloc_failed_handler) (void);
264#else
265extern void (*obstack_alloc_failed_handler) ();
266#endif
267
268/* Exit value used when `print_and_abort' is used. */
269extern int obstack_exit_failure;
270
271
272/* Pointer to beginning of object being allocated or to be allocated next.
273 Note that this might not be the final address of the object
274 because a new chunk might be needed to hold the final size. */
275
276#define obstack_base(h) ((h)->object_base)
277
278/* Size for allocating ordinary chunks. */
279
280#define obstack_chunk_size(h) ((h)->chunk_size)
281
282/* Pointer to next byte not yet allocated in current chunk. */
283
284#define obstack_next_free(h) ((h)->next_free)
285
286/* Mask specifying low bits that should be clear in address of an object. */
287
288#define obstack_alignment_mask(h) ((h)->alignment_mask)
289
290/* To prevent prototype warnings provide complete argument list in
291 standard C version. */
292#if defined __STDC__ && __STDC__
293
294# define obstack_init(h) \
295 _obstack_begin ((h), 0, 0, \
296 (void *(*) (long)) obstack_chunk_alloc, (void (*) (void *)) obstack_chunk_free)
297
298# define obstack_begin(h, size) \
299 _obstack_begin ((h), (size), 0, \
300 (void *(*) (long)) obstack_chunk_alloc, (void (*) (void *)) obstack_chunk_free)
301
302# define obstack_specify_allocation(h, size, alignment, chunkfun, freefun) \
303 _obstack_begin ((h), (size), (alignment), \
304 (void *(*) (long)) (chunkfun), (void (*) (void *)) (freefun))
305
306# define obstack_specify_allocation_with_arg(h, size, alignment, chunkfun, freefun, arg) \
307 _obstack_begin_1 ((h), (size), (alignment), \
308 (void *(*) (void *, long)) (chunkfun), \
309 (void (*) (void *, void *)) (freefun), (arg))
310
311# define obstack_chunkfun(h, newchunkfun) \
312 ((h) -> chunkfun = (struct _obstack_chunk *(*)(void *, long)) (newchunkfun))
313
314# define obstack_freefun(h, newfreefun) \
315 ((h) -> freefun = (void (*)(void *, struct _obstack_chunk *)) (newfreefun))
316
317#else
318
319# define obstack_init(h) \
320 _obstack_begin ((h), 0, 0, \
321 (void *(*) ()) obstack_chunk_alloc, (void (*) ()) obstack_chunk_free)
322
323# define obstack_begin(h, size) \
324 _obstack_begin ((h), (size), 0, \
325 (void *(*) ()) obstack_chunk_alloc, (void (*) ()) obstack_chunk_free)
326
327# define obstack_specify_allocation(h, size, alignment, chunkfun, freefun) \
328 _obstack_begin ((h), (size), (alignment), \
329 (void *(*) ()) (chunkfun), (void (*) ()) (freefun))
330
331# define obstack_specify_allocation_with_arg(h, size, alignment, chunkfun, freefun, arg) \
332 _obstack_begin_1 ((h), (size), (alignment), \
333 (void *(*) ()) (chunkfun), (void (*) ()) (freefun), (arg))
334
335# define obstack_chunkfun(h, newchunkfun) \
336 ((h) -> chunkfun = (struct _obstack_chunk *(*)()) (newchunkfun))
337
338# define obstack_freefun(h, newfreefun) \
339 ((h) -> freefun = (void (*)()) (newfreefun))
340
341#endif
342
343#define obstack_1grow_fast(h,achar) (*((h)->next_free)++ = achar)
344
345#define obstack_blank_fast(h,n) ((h)->next_free += (n))
346
347#define obstack_memory_used(h) _obstack_memory_used (h)
348
349
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, (char *) (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, (char *) (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 = (char *)__obj; \
489 else (obstack_free) (__o, __obj); })
490
491
492#else /* not __GNUC__ or not __STDC__ */
493
494# define obstack_object_size(h) \
495 (unsigned) ((h)->next_free - (h)->object_base)
496
497# define obstack_room(h) \
498 (unsigned) ((h)->chunk_limit - (h)->next_free)
499
500# define obstack_empty_p(h) \
501 ((h)->chunk->prev == 0 && (h)->next_free - (h)->chunk->contents == 0)
502
503/* Note that the call to _obstack_newchunk is enclosed in (..., 0)
504 so that we can avoid having void expressions
505 in the arms of the conditional expression.
506 Casting the third operand to void was tried before,
507 but some compilers won't accept it. */
508
509# define obstack_make_room(h,length) \
510( (h)->temp = (length), \
511 (((h)->next_free + (h)->temp > (h)->chunk_limit) \
512 ? (_obstack_newchunk ((h), (h)->temp), 0) : 0))
513
514# define obstack_grow(h,where,length) \
515( (h)->temp = (length), \
516 (((h)->next_free + (h)->temp > (h)->chunk_limit) \
517 ? (_obstack_newchunk ((h), (h)->temp), 0) : 0), \
518 _obstack_memcpy ((h)->next_free, (char *) (where), (h)->temp), \
519 (h)->next_free += (h)->temp)
520
521# define obstack_grow0(h,where,length) \
522( (h)->temp = (length), \
523 (((h)->next_free + (h)->temp + 1 > (h)->chunk_limit) \
524 ? (_obstack_newchunk ((h), (h)->temp + 1), 0) : 0), \
525 _obstack_memcpy ((h)->next_free, (char *) (where), (h)->temp), \
526 (h)->next_free += (h)->temp, \
527 *((h)->next_free)++ = 0)
528
529# define obstack_1grow(h,datum) \
530( (((h)->next_free + 1 > (h)->chunk_limit) \
531 ? (_obstack_newchunk ((h), 1), 0) : 0), \
532 (*((h)->next_free)++ = (datum)))
533
534# define obstack_ptr_grow(h,datum) \
535( (((h)->next_free + sizeof (char *) > (h)->chunk_limit) \
536 ? (_obstack_newchunk ((h), sizeof (char *)), 0) : 0), \
537 (*((char **) (((h)->next_free+=sizeof(char *))-sizeof(char *))) = ((char *) datum)))
538
539# define obstack_int_grow(h,datum) \
540( (((h)->next_free + sizeof (int) > (h)->chunk_limit) \
541 ? (_obstack_newchunk ((h), sizeof (int)), 0) : 0), \
542 (*((int *) (((h)->next_free+=sizeof(int))-sizeof(int))) = ((int) datum)))
543
544# define obstack_ptr_grow_fast(h,aptr) (*((char **) (h)->next_free)++ = (char *) aptr)
545# define obstack_int_grow_fast(h,aint) (*((int *) (h)->next_free)++ = (int) aint)
546
547# define obstack_blank(h,length) \
548( (h)->temp = (length), \
549 (((h)->chunk_limit - (h)->next_free < (h)->temp) \
550 ? (_obstack_newchunk ((h), (h)->temp), 0) : 0), \
551 ((h)->next_free += (h)->temp))
552
553# define obstack_alloc(h,length) \
554 (obstack_blank ((h), (length)), obstack_finish ((h)))
555
556# define obstack_copy(h,where,length) \
557 (obstack_grow ((h), (where), (length)), obstack_finish ((h)))
558
559# define obstack_copy0(h,where,length) \
560 (obstack_grow0 ((h), (where), (length)), obstack_finish ((h)))
561
562# define obstack_finish(h) \
563( ((h)->next_free == (h)->object_base \
564 ? (((h)->maybe_empty_object = 1), 0) \
565 : 0), \
566 (h)->temp = __PTR_TO_INT ((h)->object_base), \
567 (h)->next_free \
568 = __INT_TO_PTR ((__PTR_TO_INT ((h)->next_free)+(h)->alignment_mask) \
569 & ~ ((h)->alignment_mask)), \
570 (((h)->next_free - (char *) (h)->chunk \
571 > (h)->chunk_limit - (char *) (h)->chunk) \
572 ? ((h)->next_free = (h)->chunk_limit) : 0), \
573 (h)->object_base = (h)->next_free, \
574 __INT_TO_PTR ((h)->temp))
575
576# if defined __STDC__ && __STDC__
577# define obstack_free(h,obj) \
578( (h)->temp = (char *) (obj) - (char *) (h)->chunk, \
579 (((h)->temp > 0 && (h)->temp < (h)->chunk_limit - (char *) (h)->chunk)\
580 ? (int) ((h)->next_free = (h)->object_base \
581 = (h)->temp + (char *) (h)->chunk) \
582 : (((obstack_free) ((h), (h)->temp + (char *) (h)->chunk), 0), 0)))
583# else
584# define obstack_free(h,obj) \
585( (h)->temp = (char *) (obj) - (char *) (h)->chunk, \
586 (((h)->temp > 0 && (h)->temp < (h)->chunk_limit - (char *) (h)->chunk)\
587 ? (int) ((h)->next_free = (h)->object_base \
588 = (h)->temp + (char *) (h)->chunk) \
589 : (_obstack_free ((h), (h)->temp + (char *) (h)->chunk), 0)))
590# endif
591
592#endif /* not __GNUC__ or not __STDC__ */
593
594#ifdef __cplusplus
595} /* C++ */
596#endif
597
598#endif /* obstack.h */
Note: See TracBrowser for help on using the repository browser.