1
/* obstack.c - subroutines used implicitly by object stack macros
2
Copyright (C) 1988-1994, 1996-1999, 2000-2002 Free Software Foundation, Inc.
3
This file is part of the GNU C Library. Its master source is NOT part of
4
the C library, however. The master source lives in /gd/gnu/lib.
6
The GNU C Library is free software; you can redistribute it and/or
7
modify it under the terms of the GNU Lesser General Public
8
License as published by the Free Software Foundation; either
9
version 2.1 of the License, or (at your option) any later version.
11
The GNU C Library is distributed in the hope that it will be useful,
12
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14
Lesser General Public License for more details.
16
You should have received a copy of the GNU Lesser General Public
17
License along with the GNU C Library; if not, write to the Free
18
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
27
/* NOTE BEFORE MODIFYING THIS FILE: This version number must be
28
incremented whenever callers compiled using an old obstack.h can no
29
longer properly call the functions in this obstack.c. */
30
#define OBSTACK_INTERFACE_VERSION 1
32
/* Comment out all this code if we are using the GNU C Library, and are not
33
actually compiling the library itself, and the installed library
34
supports the same library interface we do. This code is part of the GNU
35
C Library, but also included in many other GNU distributions. Compiling
36
and linking in this code is a waste when using the GNU C library
37
(especially if it is a shared library). Rather than having every GNU
38
program understand `configure --with-gnu-libc' and omit the object
39
files, it is simpler to just do this in the source for each such file. */
41
#include <stdio.h> /* Random thing to get __GNU_LIBRARY__. */
42
#if !defined _LIBC && defined __GNU_LIBRARY__ && __GNU_LIBRARY__ > 1
43
# include <gnu-versions.h>
44
# if _GNU_OBSTACK_INTERFACE_VERSION == OBSTACK_INTERFACE_VERSION
49
#if defined _LIBC && defined USE_IN_LIBIO
56
# if defined __STDC__ && __STDC__
57
# define POINTER void *
59
# define POINTER char *
62
/* Determine default alignment. */
63
struct fooalign {char x; double d;};
64
# define DEFAULT_ALIGNMENT \
65
((PTR_INT_TYPE) ((char *) &((struct fooalign *) 0)->d - (char *) 0))
66
/* If malloc were really smart, it would round addresses to DEFAULT_ALIGNMENT.
67
But in fact it might be less smart and round addresses to as much as
68
DEFAULT_ROUNDING. So we prepare for it to do that. */
69
union fooround {long x; double d;};
70
# define DEFAULT_ROUNDING (sizeof (union fooround))
72
/* When we copy a long block of data, this is the unit to do it with.
73
On some machines, copying successive ints does not work;
74
in such a case, redefine COPYING_UNIT to `long' (if that works)
75
or `char' as a last resort. */
77
# define COPYING_UNIT int
81
/* The functions allocating more room by calling `obstack_chunk_alloc'
82
jump to the handler pointed to by `obstack_alloc_failed_handler'.
83
This can be set to a user defined function which should either
84
abort gracefully or use longjump - but shouldn't return. This
85
variable by default points to the internal function
87
# if defined __STDC__ && __STDC__
88
static void print_and_abort (void);
89
void (*obstack_alloc_failed_handler) (void) = print_and_abort;
91
static void print_and_abort ();
92
void (*obstack_alloc_failed_handler) () = print_and_abort;
95
/* Exit value used when `print_and_abort' is used. */
96
# if defined __GNU_LIBRARY__ || defined HAVE_STDLIB_H
100
# define EXIT_FAILURE 1
102
int obstack_exit_failure = EXIT_FAILURE;
104
/* The non-GNU-C macros copy the obstack into this global variable
105
to avoid multiple evaluation. */
107
struct obstack *_obstack;
109
/* Define a macro that either calls functions with the traditional malloc/free
110
calling interface, or calls functions with the mmalloc/mfree interface
111
(that adds an extra first argument), based on the state of use_extra_arg.
112
For free, do not use ?:, since some compilers, like the MIPS compilers,
113
do not allow (expr) ? void : void. */
115
# if defined __STDC__ && __STDC__
116
# define CALL_CHUNKFUN(h, size) \
117
(((h) -> use_extra_arg) \
118
? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
119
: (*(struct _obstack_chunk *(*) (long)) (h)->chunkfun) ((size)))
121
# define CALL_FREEFUN(h, old_chunk) \
123
if ((h) -> use_extra_arg) \
124
(*(h)->freefun) ((h)->extra_arg, (old_chunk)); \
126
(*(void (*) (void *)) (h)->freefun) ((old_chunk)); \
129
# define CALL_CHUNKFUN(h, size) \
130
(((h) -> use_extra_arg) \
131
? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
132
: (*(struct _obstack_chunk *(*) ()) (h)->chunkfun) ((size)))
134
# define CALL_FREEFUN(h, old_chunk) \
136
if ((h) -> use_extra_arg) \
137
(*(h)->freefun) ((h)->extra_arg, (old_chunk)); \
139
(*(void (*) ()) (h)->freefun) ((old_chunk)); \
144
/* Initialize an obstack H for use. Specify chunk size SIZE (0 means default).
145
Objects start on multiples of ALIGNMENT (0 means use default).
146
CHUNKFUN is the function to use to allocate chunks,
147
and FREEFUN the function to free them.
149
Return nonzero if successful, calls obstack_alloc_failed_handler if
153
_obstack_begin (h, size, alignment, chunkfun, freefun)
157
# if defined __STDC__ && __STDC__
158
POINTER (*chunkfun) (long);
159
void (*freefun) (void *);
161
POINTER (*chunkfun) ();
165
register struct _obstack_chunk *chunk; /* points to new chunk */
168
alignment = (int) DEFAULT_ALIGNMENT;
170
/* Default size is what GNU malloc can fit in a 4096-byte block. */
172
/* 12 is sizeof (mhead) and 4 is EXTRA from GNU malloc.
173
Use the values for range checking, because if range checking is off,
174
the extra bytes won't be missed terribly, but if range checking is on
175
and we used a larger request, a whole extra 4096 bytes would be
178
These number are irrelevant to the new GNU malloc. I suspect it is
179
less sensitive to the size of the request. */
180
int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1))
181
+ 4 + DEFAULT_ROUNDING - 1)
182
& ~(DEFAULT_ROUNDING - 1));
186
# if defined __STDC__ && __STDC__
187
h->chunkfun = (struct _obstack_chunk * (*)(void *, long)) chunkfun;
188
h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun;
190
h->chunkfun = (struct _obstack_chunk * (*)()) chunkfun;
191
h->freefun = freefun;
193
h->chunk_size = size;
194
h->alignment_mask = alignment - 1;
195
h->use_extra_arg = 0;
197
chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
199
(*obstack_alloc_failed_handler) ();
200
h->next_free = h->object_base = chunk->contents;
201
h->chunk_limit = chunk->limit
202
= (char *) chunk + h->chunk_size;
204
/* The initial chunk now contains no empty object. */
205
h->maybe_empty_object = 0;
211
_obstack_begin_1 (h, size, alignment, chunkfun, freefun, arg)
215
# if defined __STDC__ && __STDC__
216
POINTER (*chunkfun) (POINTER, long);
217
void (*freefun) (POINTER, POINTER);
219
POINTER (*chunkfun) ();
224
register struct _obstack_chunk *chunk; /* points to new chunk */
227
alignment = (int) DEFAULT_ALIGNMENT;
229
/* Default size is what GNU malloc can fit in a 4096-byte block. */
231
/* 12 is sizeof (mhead) and 4 is EXTRA from GNU malloc.
232
Use the values for range checking, because if range checking is off,
233
the extra bytes won't be missed terribly, but if range checking is on
234
and we used a larger request, a whole extra 4096 bytes would be
237
These number are irrelevant to the new GNU malloc. I suspect it is
238
less sensitive to the size of the request. */
239
int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1))
240
+ 4 + DEFAULT_ROUNDING - 1)
241
& ~(DEFAULT_ROUNDING - 1));
245
# if defined __STDC__ && __STDC__
246
h->chunkfun = (struct _obstack_chunk * (*)(void *,long)) chunkfun;
247
h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun;
249
h->chunkfun = (struct _obstack_chunk * (*)()) chunkfun;
250
h->freefun = freefun;
252
h->chunk_size = size;
253
h->alignment_mask = alignment - 1;
255
h->use_extra_arg = 1;
257
chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
259
(*obstack_alloc_failed_handler) ();
260
h->next_free = h->object_base = chunk->contents;
261
h->chunk_limit = chunk->limit
262
= (char *) chunk + h->chunk_size;
264
/* The initial chunk now contains no empty object. */
265
h->maybe_empty_object = 0;
270
/* Allocate a new current chunk for the obstack *H
271
on the assumption that LENGTH bytes need to be added
272
to the current object, or a new object of length LENGTH allocated.
273
Copies any partial object from the end of the old chunk
274
to the beginning of the new one. */
277
_obstack_newchunk (h, length)
281
register struct _obstack_chunk *old_chunk = h->chunk;
282
register struct _obstack_chunk *new_chunk;
283
register long new_size;
284
register long obj_size = h->next_free - h->object_base;
289
/* Compute size for new chunk. */
290
new_size = (obj_size + length) + (obj_size >> 3) + h->alignment_mask + 100;
291
if (new_size < h->chunk_size)
292
new_size = h->chunk_size;
294
/* Allocate and initialize the new chunk. */
295
new_chunk = CALL_CHUNKFUN (h, new_size);
297
(*obstack_alloc_failed_handler) ();
298
h->chunk = new_chunk;
299
new_chunk->prev = old_chunk;
300
new_chunk->limit = h->chunk_limit = (char *) new_chunk + new_size;
302
/* Compute an aligned object_base in the new chunk */
304
__INT_TO_PTR ((__PTR_TO_INT (new_chunk->contents) + h->alignment_mask)
305
& ~ (h->alignment_mask));
307
/* Move the existing object to the new chunk.
308
Word at a time is fast and is safe if the object
309
is sufficiently aligned. */
310
if (h->alignment_mask + 1 >= DEFAULT_ALIGNMENT)
312
for (i = obj_size / sizeof (COPYING_UNIT) - 1;
314
((COPYING_UNIT *)object_base)[i]
315
= ((COPYING_UNIT *)h->object_base)[i];
316
/* We used to copy the odd few remaining bytes as one extra COPYING_UNIT,
317
but that can cross a page boundary on a machine
318
which does not do strict alignment for COPYING_UNITS. */
319
already = obj_size / sizeof (COPYING_UNIT) * sizeof (COPYING_UNIT);
323
/* Copy remaining bytes one by one. */
324
for (i = already; i < obj_size; i++)
325
object_base[i] = h->object_base[i];
327
/* If the object just copied was the only data in OLD_CHUNK,
328
free that chunk and remove it from the chain.
329
But not if that chunk might contain an empty object. */
330
if (h->object_base == old_chunk->contents && ! h->maybe_empty_object)
332
new_chunk->prev = old_chunk->prev;
333
CALL_FREEFUN (h, old_chunk);
336
h->object_base = object_base;
337
h->next_free = h->object_base + obj_size;
338
/* The new chunk certainly contains no empty object yet. */
339
h->maybe_empty_object = 0;
342
/* Return nonzero if object OBJ has been allocated from obstack H.
343
This is here for debugging.
344
If you use it in a program, you are probably losing. */
346
# if defined __STDC__ && __STDC__
347
/* Suppress -Wmissing-prototypes warning. We don't want to declare this in
348
obstack.h because it is just for debugging. */
349
int _obstack_allocated_p (struct obstack *h, POINTER obj);
353
_obstack_allocated_p (h, obj)
357
register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
358
register struct _obstack_chunk *plp; /* point to previous chunk if any */
361
/* We use >= rather than > since the object cannot be exactly at
362
the beginning of the chunk but might be an empty object exactly
363
at the end of an adjacent chunk. */
364
while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
372
/* Free objects in obstack H, including OBJ and everything allocate
373
more recently than OBJ. If OBJ is zero, free everything in H. */
377
/* This function has two names with identical definitions.
378
This is the first one, called from non-ANSI code. */
381
_obstack_free (h, obj)
385
register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
386
register struct _obstack_chunk *plp; /* point to previous chunk if any */
389
/* We use >= because there cannot be an object at the beginning of a chunk.
390
But there can be an empty object at that address
391
at the end of another chunk. */
392
while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
395
CALL_FREEFUN (h, lp);
397
/* If we switch chunks, we can't tell whether the new current
398
chunk contains an empty object, so assume that it may. */
399
h->maybe_empty_object = 1;
403
h->object_base = h->next_free = (char *) (obj);
404
h->chunk_limit = lp->limit;
408
/* obj is not in any of the chunks! */
412
/* This function is used from ANSI code. */
415
obstack_free (h, obj)
419
register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
420
register struct _obstack_chunk *plp; /* point to previous chunk if any */
423
/* We use >= because there cannot be an object at the beginning of a chunk.
424
But there can be an empty object at that address
425
at the end of another chunk. */
426
while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
429
CALL_FREEFUN (h, lp);
431
/* If we switch chunks, we can't tell whether the new current
432
chunk contains an empty object, so assume that it may. */
433
h->maybe_empty_object = 1;
437
h->object_base = h->next_free = (char *) (obj);
438
h->chunk_limit = lp->limit;
442
/* obj is not in any of the chunks! */
447
_obstack_memory_used (h)
450
register struct _obstack_chunk* lp;
451
register int nbytes = 0;
453
for (lp = h->chunk; lp != 0; lp = lp->prev)
455
nbytes += lp->limit - (char *) lp;
460
/* Define the error handler. */
462
# include <libintl.h>
464
# include "gettext.h"
466
# define _(msgid) gettext (msgid)
468
# if defined _LIBC && defined USE_IN_LIBIO
469
# include <libio/iolibio.h>
470
# define fputs(s, f) _IO_fputs (s, f)
473
# ifndef __attribute__
474
/* This feature is available in gcc versions 2.5 and later. */
475
# if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 5)
476
# define __attribute__(Spec) /* empty */
481
__attribute__ ((noreturn))
484
/* Don't change any of these strings. Yes, it would be possible to add
485
the newline to the string and use fputs or so. But this must not
486
happen because the "memory exhausted" message appears in other places
487
like this and the translation should be reused instead of creating
488
a very similar string which requires a separate translation. */
489
# if defined _LIBC && defined USE_IN_LIBIO
490
if (_IO_fwide (stderr, 0) > 0)
491
__fwprintf (stderr, L"%s\n", _("memory exhausted"));
494
fprintf (stderr, "%s\n", _("memory exhausted"));
495
exit (obstack_exit_failure);
499
/* These are now turned off because the applications do not use it
500
and it uses bcopy via obstack_grow, which causes trouble on sysV. */
502
/* Now define the functional versions of the obstack macros.
503
Define them to simply use the corresponding macros to do the job. */
505
# if defined __STDC__ && __STDC__
506
/* These function definitions do not work with non-ANSI preprocessors;
507
they won't pass through the macro names in parentheses. */
509
/* The function names appear in parentheses in order to prevent
510
the macro-definitions of the names from being expanded there. */
512
POINTER (obstack_base) (obstack)
513
struct obstack *obstack;
515
return obstack_base (obstack);
518
POINTER (obstack_next_free) (obstack)
519
struct obstack *obstack;
521
return obstack_next_free (obstack);
524
int (obstack_object_size) (obstack)
525
struct obstack *obstack;
527
return obstack_object_size (obstack);
530
int (obstack_room) (obstack)
531
struct obstack *obstack;
533
return obstack_room (obstack);
536
int (obstack_make_room) (obstack, length)
537
struct obstack *obstack;
540
return obstack_make_room (obstack, length);
543
void (obstack_grow) (obstack, data, length)
544
struct obstack *obstack;
548
obstack_grow (obstack, data, length);
551
void (obstack_grow0) (obstack, data, length)
552
struct obstack *obstack;
556
obstack_grow0 (obstack, data, length);
559
void (obstack_1grow) (obstack, character)
560
struct obstack *obstack;
563
obstack_1grow (obstack, character);
566
void (obstack_blank) (obstack, length)
567
struct obstack *obstack;
570
obstack_blank (obstack, length);
573
void (obstack_1grow_fast) (obstack, character)
574
struct obstack *obstack;
577
obstack_1grow_fast (obstack, character);
580
void (obstack_blank_fast) (obstack, length)
581
struct obstack *obstack;
584
obstack_blank_fast (obstack, length);
587
POINTER (obstack_finish) (obstack)
588
struct obstack *obstack;
590
return obstack_finish (obstack);
593
POINTER (obstack_alloc) (obstack, length)
594
struct obstack *obstack;
597
return obstack_alloc (obstack, length);
600
POINTER (obstack_copy) (obstack, address, length)
601
struct obstack *obstack;
602
const POINTER address;
605
return obstack_copy (obstack, address, length);
608
POINTER (obstack_copy0) (obstack, address, length)
609
struct obstack *obstack;
610
const POINTER address;
613
return obstack_copy0 (obstack, address, length);
616
# endif /* __STDC__ */
620
#endif /* !ELIDE_CODE */
added
removed
gettext-tools/lib/obstack.c
