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