FM / include

/usr/include

Name	Size	Mode	Actions
arpa/	-	0755	rm
asm/	-	0755	rm
asm-generic/	-	0755	rm
bind9/	-	0755	rm
bits/	-	0755	rm
bsock/	-	0755	rm
c++/	-	0755	rm
db4/	-	0755	rm
db4.2.52/	-	0755	rm
db4.3.29/	-	0755	rm
dns/	-	0755	rm
drm/	-	0755	rm
dst/	-	0755	rm
e2p/	-	0755	rm
et/	-	0755	rm
ext2fs/	-	0755	rm
fontconfig/	-	0755	rm
freetype2/	-	0755	rm
gdbm/	-	0755	rm
GL/	-	0755	rm
gnu/	-	0755	rm
gssapi/	-	0755	rm
gssrpc/	-	0755	rm
isc/	-	0755	rm
isccc/	-	0755	rm
isccfg/	-	0755	rm
kadm5/	-	0755	rm
krb5/	-	0755	rm
layout/	-	0755	rm
libexslt/	-	0755	rm
libltdl/	-	0755	rm
libpng12/	-	0755	rm
libxml2/	-	0755	rm
libxslt/	-	0755	rm
linux/	-	0755	rm
lve/	-	0755	rm
lwres/	-	0755	rm
lzma/	-	0755	rm
mtd/	-	0755	rm
mysql/	-	0755	rm
ncurses/	-	0755	rm
ncursesw/	-	0755	rm
net/	-	0755	rm
netash/	-	0755	rm
netatalk/	-	0755	rm
netax25/	-	0755	rm
neteconet/	-	0755	rm
netinet/	-	0755	rm
netipx/	-	0755	rm
netiucv/	-	0755	rm
netpacket/	-	0755	rm
netrom/	-	0755	rm
netrose/	-	0755	rm
nfs/	-	0755	rm
numpy/	-	0755	rm
openssl/	-	0755	rm
PCSC/	-	0755	rm
protocols/	-	0755	rm
python2.6/	-	0755	rm
rdma/	-	0755	rm
readline/	-	0755	rm
rpc/	-	0755	rm
rpcsvc/	-	0755	rm
sasl/	-	0755	rm
scsi/	-	0755	rm
security/	-	0755	rm
selinux/	-	0755	rm
sepol/	-	0755	rm
sound/	-	0755	rm
sys/	-	0755	rm
uapi/	-	0755	rm
unicode/	-	0755	rm
video/	-	0755	rm
X11/	-	0755	rm
xcb/	-	0755	rm
xen/	-	0755	rm
yaz/	-	0755	rm
a.out.h	4351	0644	edit dl rm
aio.h	7502	0644	edit dl rm
aliases.h	2115	0644	edit dl rm
alloca.h	1289	0644	edit dl rm
ar.h	1792	0644	edit dl rm
argp.h	26521	0644	edit dl rm
argz.h	7308	0644	edit dl rm
assert.h	3506	0644	edit dl rm
autosprintf.h	2284	0644	edit dl rm
byteswap.h	1489	0644	edit dl rm
complex.h	3557	0644	edit dl rm
cpio.h	2335	0644	edit dl rm
crypt.h	2341	0644	edit dl rm
ctype.h	11287	0644	edit dl rm
curses.h	79831	0644	edit dl rm
cursesapp.h	6582	0644	edit dl rm
cursesf.h	27630	0644	edit dl rm
cursesm.h	19486	0644	edit dl rm
cursesp.h	8473	0644	edit dl rm
cursesw.h	49264	0644	edit dl rm
cursslk.h	7304	0644	edit dl rm
db.h	99427	0444	edit dl rm
db_185.h	6010	0444	edit dl rm
db_cxx.h	38638	0444	edit dl rm
dirent.h	11318	0644	edit dl rm
dlfcn.h	7117	0644	edit dl rm
elf.h	117539	0644	edit dl rm
endian.h	2991	0644	edit dl rm
entities.h	4673	0644	edit dl rm
envz.h	2962	0644	edit dl rm
err.h	2313	0644	edit dl rm
errno.h	2452	0644	edit dl rm
error.h	2132	0644	edit dl rm
eti.h	2891	0644	edit dl rm
etip.h	9207	0644	edit dl rm
execinfo.h	1606	0644	edit dl rm
expat.h	40849	0644	edit dl rm
expat_external.h	3364	0644	edit dl rm
fam.h	6875	0644	edit dl rm
fcntl.h	9133	0644	edit dl rm
features.h	12877	0644	edit dl rm
fenv.h	4670	0644	edit dl rm
FlexLexer.h	6217	0644	edit dl rm
fmtmsg.h	3329	0644	edit dl rm
fnmatch.h	2530	0644	edit dl rm
form.h	17190	0644	edit dl rm
fpu_control.h	3163	0644	edit dl rm
fstab.h	3115	0644	edit dl rm
ft2build.h	3890	0644	edit dl rm
fts.h	5290	0644	edit dl rm
ftw.h	5360	0644	edit dl rm
gconv.h	5339	0644	edit dl rm
gcrypt-module.h	7184	0644	edit dl rm
gcrypt.h	70572	0644	edit dl rm
gd.h	32790	0644	edit dl rm
gdbm.h	4744	0644	edit dl rm
gdcache.h	2812	0644	edit dl rm
gdfontg.h	623	0644	edit dl rm
gdfontl.h	621	0644	edit dl rm
gdfontmb.h	590	0644	edit dl rm
gdfonts.h	585	0644	edit dl rm
gdfontt.h	617	0644	edit dl rm
gdfx.h	2396	0644	edit dl rm
gd_io.h	1154	0644	edit dl rm
getopt.h	6740	0644	edit dl rm
gettext-po.h	14835	0644	edit dl rm
glob.h	7007	0644	edit dl rm
gnu-versions.h	2416	0644	edit dl rm
gpg-error.h	22689	0644	edit dl rm
grp.h	6991	0644	edit dl rm
gshadow.h	4611	0644	edit dl rm
gssapi.h	181	0644	edit dl rm
iconv.h	1949	0644	edit dl rm
idn-free.h	2299	0644	edit dl rm
idn-int.h	20	0644	edit dl rm
idna.h	3436	0644	edit dl rm
ieee754.h	4990	0644	edit dl rm
ifaddrs.h	2902	0644	edit dl rm
inttypes.h	12202	0644	edit dl rm
jconfig.h	1653	0644	edit dl rm
jerror.h	14748	0644	edit dl rm
jmorecfg.h	13774	0644	edit dl rm
jpeglib.h	50207	0644	edit dl rm
kdb.h	58384	0644	edit dl rm
keyutils.h	6092	0644	edit dl rm
krb5.h	402	0644	edit dl rm
langinfo.h	16007	0644	edit dl rm
lastlog.h	126	0644	edit dl rm
lauxlib.h	5777	0644	edit dl rm
libaio.h	7252	0644	edit dl rm
libgen.h	1465	0644	edit dl rm
libintl.h	4702	0644	edit dl rm
libio.h	17790	0644	edit dl rm
libssh2.h	48356	0644	edit dl rm
libssh2_publickey.h	4910	0644	edit dl rm
libssh2_sftp.h	15651	0644	edit dl rm
limits.h	4596	0644	edit dl rm
link.h	7221	0644	edit dl rm
locale.h	8032	0644	edit dl rm
ltdl.h	5715	0644	edit dl rm
lua.h	11688	0644	edit dl rm
lua.hpp	191	0644	edit dl rm
luaconf.h	22128	0644	edit dl rm
lualib.h	1026	0644	edit dl rm
lzma.h	9306	0644	edit dl rm
malloc.h	6297	0644	edit dl rm
math.h	15987	0644	edit dl rm
mcheck.h	2521	0644	edit dl rm
memory.h	1029	0644	edit dl rm
menu.h	11845	0644	edit dl rm
mntent.h	3465	0644	edit dl rm
monetary.h	1835	0644	edit dl rm
mqueue.h	3872	0644	edit dl rm
ncurses.h	79831	0644	edit dl rm
ncurses_dll.h	3898	0644	edit dl rm
nc_tparm.h	3947	0644	edit dl rm
netdb.h	28267	0644	edit dl rm
nl_types.h	1842	0644	edit dl rm
nss.h	1962	0644	edit dl rm
obstack.h	19673	0644	edit dl rm
panel.h	3770	0644	edit dl rm
paths.h	2973	0644	edit dl rm
png.h	161982	0644	edit dl rm
pngconf.h	50992	0644	edit dl rm
poll.h	22	0644	edit dl rm
pr29.h	1974	0644	edit dl rm
printf.h	6805	0644	edit dl rm
profile.h	12154	0644	edit dl rm
pthread.h	40491	0644	edit dl rm
pty.h	1610	0644	edit dl rm
punycode.h	9425	0644	edit dl rm
pwd.h	6079	0644	edit dl rm
regex.h	21871	0644	edit dl rm
regexp.h	7123	0644	edit dl rm
resolv.h	14765	0644	edit dl rm
re_comp.h	1024	0644	edit dl rm
sched.h	4730	0644	edit dl rm
search.h	5318	0644	edit dl rm
semaphore.h	2472	0644	edit dl rm
setjmp.h	4112	0644	edit dl rm
sgtty.h	1431	0644	edit dl rm
shadow.h	5302	0644	edit dl rm
signal.h	13662	0644	edit dl rm
spawn.h	6763	0644	edit dl rm
stab.h	264	0644	edit dl rm
stdint.h	8536	0644	edit dl rm
stdio.h	31568	0644	edit dl rm
stdio_ext.h	2873	0644	edit dl rm
stdlib.h	34254	0644	edit dl rm
string.h	22612	0644	edit dl rm
stringprep.h	8044	0644	edit dl rm
strings.h	4763	0644	edit dl rm
syscall.h	25	0644	edit dl rm
sysexits.h	5232	0644	edit dl rm
syslog.h	24	0644	edit dl rm
tar.h	3771	0644	edit dl rm
tcpd.h	9546	0644	edit dl rm
term.h	38205	0644	edit dl rm
termcap.h	3479	0644	edit dl rm
termio.h	214	0644	edit dl rm
termios.h	3640	0644	edit dl rm
term_entry.h	7056	0644	edit dl rm
tgmath.h	18610	0644	edit dl rm
thread_db.h	16092	0644	edit dl rm
tic.h	12181	0644	edit dl rm
tiff.h	33813	0644	edit dl rm
tiffconf-64.h	2969	0644	edit dl rm
tiffconf.h	250	0644	edit dl rm
tiffio.h	20514	0644	edit dl rm
tiffio.hxx	1706	0644	edit dl rm
tiffvers.h	410	0644	edit dl rm
time.h	13534	0644	edit dl rm
tld.h	4503	0644	edit dl rm
ttyent.h	2496	0644	edit dl rm
ucontext.h	2015	0644	edit dl rm
ulimit.h	1657	0644	edit dl rm
unctrl.h	3005	0644	edit dl rm
unistd.h	42551	0644	edit dl rm
ustat.h	23	0644	edit dl rm
utime.h	1603	0644	edit dl rm
utmp.h	3334	0644	edit dl rm
utmpx.h	4203	0644	edit dl rm
values.h	2029	0644	edit dl rm
verto-module.h	6019	0644	edit dl rm
verto.h	16829	0644	edit dl rm
wait.h	22	0644	edit dl rm
wchar.h	32383	0644	edit dl rm
wctype.h	11227	0644	edit dl rm
wordexp.h	2592	0644	edit dl rm
xlocale.h	1771	0644	edit dl rm
yaml.h	54224	0644	edit dl rm
zconf.h	9544	0644	edit dl rm
zlib.h	66188	0644	edit dl rm
_G_config.h	2526	0644	edit dl rm

Edit: /usr/include/obstack.h (19673B)

/* obstack.h - object stack macros
   Copyright (C) 1988-1994,1996-1999,2003,2004,2005,2009
	Free Software Foundation, Inc.
   This file is part of the GNU C Library.

The GNU C Library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Lesser General Public
   License as published by the Free Software Foundation; either
   version 2.1 of the License, or (at your option) any later version.

The GNU C Library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public
   License along with the GNU C Library; if not, write to the Free
   Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
   Boston, MA 02110-1301, USA.  */

/* Summary:

All the apparent functions defined here are macros. The idea
is that you would use these pre-tested macros to solve a
very specific set of problems, and they would run fast.
Caution: no side-effects in arguments please!! They may be
evaluated MANY times!!

These macros operate a stack of objects.  Each object starts life
small, and may grow to maturity.  (Consider building a word syllable
by syllable.)  An object can move while it is growing.  Once it has
been "finished" it never changes address again.  So the "top of the
stack" is typically an immature growing object, while the rest of the
stack is of mature, fixed size and fixed address objects.

These routines grab large chunks of memory, using a function you
supply, called `obstack_chunk_alloc'.  On occasion, they free chunks,
by calling `obstack_chunk_free'.  You must define them and declare
them before using any obstack macros.

Each independent stack is represented by a `struct obstack'.
Each of the obstack macros expects a pointer to such a structure
as the first argument.

One motivation for this package is the problem of growing char strings
in symbol tables.  Unless you are "fascist pig with a read-only mind"
--Gosper's immortal quote from HAKMEM item 154, out of context--you
would not like to put any arbitrary upper limit on the length of your
symbols.

In practice this often means you will build many short symbols and a
few long symbols.  At the time you are reading a symbol you don't know
how long it is.  One traditional method is to read a symbol into a
buffer, realloc()ating the buffer every time you try to read a symbol
that is longer than the buffer.  This is beaut, but you still will
want to copy the symbol from the buffer to a more permanent
symbol-table entry say about half the time.

With obstacks, you can work differently.  Use one obstack for all symbol
names.  As you read a symbol, grow the name in the obstack gradually.
When the name is complete, finalize it.  Then, if the symbol exists already,
free the newly read name.

The way we do this is to take a large chunk, allocating memory from
low addresses.  When you want to build a symbol in the chunk you just
add chars above the current "high water mark" in the chunk.  When you
have finished adding chars, because you got to the end of the symbol,
you know how long the chars are, and you can create a new object.
Mostly the chars will not burst over the highest address of the chunk,
because you would typically expect a chunk to be (say) 100 times as
long as an average object.

In case that isn't clear, when we have enough chars to make up
the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
so we just point to it where it lies.  No moving of chars is
needed and this is the second win: potentially long strings need
never be explicitly shuffled. Once an object is formed, it does not
change its address during its lifetime.

When the chars burst over a chunk boundary, we allocate a larger
chunk, and then copy the partly formed object from the end of the old
chunk to the beginning of the new larger chunk.  We then carry on
accreting characters to the end of the object as we normally would.

A special macro is provided to add a single char at a time to a
growing object.  This allows the use of register variables, which
break the ordinary 'growth' macro.

Summary:
	We allocate large chunks.
	We carve out one object at a time from the current chunk.
	Once carved, an object never moves.
	We are free to append data of any size to the currently
	  growing object.
	Exactly one object is growing in an obstack at any one time.
	You can run one obstack per control block.
	You may have as many control blocks as you dare.
	Because of the way we do it, you can `unwind' an obstack
	  back to a previous state. (You may remove objects much
	  as you would with a stack.)
*/

/* Don't do the contents of this file more than once.  */

#ifndef _OBSTACK_H
#define _OBSTACK_H 1

#ifdef __cplusplus
extern "C" {
#endif

/* We need the type of a pointer subtraction.  If __PTRDIFF_TYPE__ is
   defined, as with GNU C, use that; that way we don't pollute the
   namespace with <stddef.h>'s symbols.  Otherwise, include <stddef.h>
   and use ptrdiff_t.  */

#ifdef __PTRDIFF_TYPE__
# define PTR_INT_TYPE __PTRDIFF_TYPE__
#else
# include <stddef.h>
# define PTR_INT_TYPE ptrdiff_t
#endif

/* If B is the base of an object addressed by P, return the result of
   aligning P to the next multiple of A + 1.  B and P must be of type
   char *.  A + 1 must be a power of 2.  */

#define __BPTR_ALIGN(B, P, A) ((B) + (((P) - (B) + (A)) & ~(A)))

/* Similiar to _BPTR_ALIGN (B, P, A), except optimize the common case
   where pointers can be converted to integers, aligned as integers,
   and converted back again.  If PTR_INT_TYPE is narrower than a
   pointer (e.g., the AS/400), play it safe and compute the alignment
   relative to B.  Otherwise, use the faster strategy of computing the
   alignment relative to 0.  */

#define __PTR_ALIGN(B, P, A)						    \
  __BPTR_ALIGN (sizeof (PTR_INT_TYPE) < sizeof (void *) ? (B) : (char *) 0, \
		P, A)

#include <string.h>

struct _obstack_chunk		/* Lives at front of each chunk. */
{
  char  *limit;			/* 1 past end of this chunk */
  struct _obstack_chunk *prev;	/* address of prior chunk or NULL */
  char	contents[4];		/* objects begin here */
};

struct obstack		/* control current object in current chunk */
{
  long	chunk_size;		/* preferred size to allocate chunks in */
  struct _obstack_chunk *chunk;	/* address of current struct obstack_chunk */
  char	*object_base;		/* address of object we are building */
  char	*next_free;		/* where to add next char to current object */
  char	*chunk_limit;		/* address of char after current chunk */
  union
  {
    PTR_INT_TYPE tempint;
    void *tempptr;
  } temp;			/* Temporary for some macros.  */
  int   alignment_mask;		/* Mask of alignment for each object. */
  /* These prototypes vary based on `use_extra_arg', and we use
     casts to the prototypeless function type in all assignments,
     but having prototypes here quiets -Wstrict-prototypes.  */
  struct _obstack_chunk *(*chunkfun) (void *, long);
  void (*freefun) (void *, struct _obstack_chunk *);
  void *extra_arg;		/* first arg for chunk alloc/dealloc funcs */
  unsigned use_extra_arg:1;	/* chunk alloc/dealloc funcs take extra arg */
  unsigned maybe_empty_object:1;/* There is a possibility that the current
				   chunk contains a zero-length object.  This
				   prevents freeing the chunk if we allocate
				   a bigger chunk to replace it. */
  unsigned alloc_failed:1;	/* No longer used, as we now call the failed
				   handler on error, but retained for binary
				   compatibility.  */
};

/* Declare the external functions we use; they are in obstack.c.  */

extern void _obstack_newchunk (struct obstack *, int);
extern int _obstack_begin (struct obstack *, int, int,
			    void *(*) (long), void (*) (void *));
extern int _obstack_begin_1 (struct obstack *, int, int,
			     void *(*) (void *, long),
			     void (*) (void *, void *), void *);
extern int _obstack_memory_used (struct obstack *);

void obstack_free (struct obstack *__obstack, void *__block);

/* Error handler called when `obstack_chunk_alloc' failed to allocate
   more memory.  This can be set to a user defined function which
   should either abort gracefully or use longjump - but shouldn't
   return.  The default action is to print a message and abort.  */
extern void (*obstack_alloc_failed_handler) (void);

/* Exit value used when `print_and_abort' is used.  */
extern int obstack_exit_failure;

/* Pointer to beginning of object being allocated or to be allocated next.
   Note that this might not be the final address of the object
   because a new chunk might be needed to hold the final size.  */

#define obstack_base(h) ((void *) (h)->object_base)

/* Size for allocating ordinary chunks.  */

#define obstack_chunk_size(h) ((h)->chunk_size)

/* Pointer to next byte not yet allocated in current chunk.  */

#define obstack_next_free(h)	((h)->next_free)

/* Mask specifying low bits that should be clear in address of an object.  */

#define obstack_alignment_mask(h) ((h)->alignment_mask)

/* To prevent prototype warnings provide complete argument list.  */
#define obstack_init(h)						\
  _obstack_begin ((h), 0, 0,					\
		  (void *(*) (long)) obstack_chunk_alloc,	\
		  (void (*) (void *)) obstack_chunk_free)

#define obstack_begin(h, size)					\
  _obstack_begin ((h), (size), 0,				\
		  (void *(*) (long)) obstack_chunk_alloc,	\
		  (void (*) (void *)) obstack_chunk_free)

#define obstack_specify_allocation(h, size, alignment, chunkfun, freefun)  \
  _obstack_begin ((h), (size), (alignment),				   \
		  (void *(*) (long)) (chunkfun),			   \
		  (void (*) (void *)) (freefun))

#define obstack_specify_allocation_with_arg(h, size, alignment, chunkfun, freefun, arg) \
  _obstack_begin_1 ((h), (size), (alignment),				\
		    (void *(*) (void *, long)) (chunkfun),		\
		    (void (*) (void *, void *)) (freefun), (arg))

#define obstack_chunkfun(h, newchunkfun) \
  ((h) -> chunkfun = (struct _obstack_chunk *(*)(void *, long)) (newchunkfun))

#define obstack_freefun(h, newfreefun) \
  ((h) -> freefun = (void (*)(void *, struct _obstack_chunk *)) (newfreefun))

#define obstack_1grow_fast(h,achar) (*((h)->next_free)++ = (achar))

#define obstack_blank_fast(h,n) ((h)->next_free += (n))

#define obstack_memory_used(h) _obstack_memory_used (h)

#if defined __GNUC__ && defined __STDC__ && __STDC__
/* NextStep 2.0 cc is really gcc 1.93 but it defines __GNUC__ = 2 and
   does not implement __extension__.  But that compiler doesn't define
   __GNUC_MINOR__.  */
# if __GNUC__ < 2 || (__NeXT__ && !__GNUC_MINOR__)
#  define __extension__
# endif

/* For GNU C, if not -traditional,
   we can define these macros to compute all args only once
   without using a global variable.
   Also, we can avoid using the `temp' slot, to make faster code.  */

# define obstack_object_size(OBSTACK)					\
  __extension__								\
  ({ struct obstack const *__o = (OBSTACK);				\
     (unsigned) (__o->next_free - __o->object_base); })

# define obstack_room(OBSTACK)						\
  __extension__								\
  ({ struct obstack const *__o = (OBSTACK);				\
     (unsigned) (__o->chunk_limit - __o->next_free); })

# define obstack_make_room(OBSTACK,length)				\
__extension__								\
({ struct obstack *__o = (OBSTACK);					\
   int __len = (length);						\
   if (__o->chunk_limit - __o->next_free < __len)			\
     _obstack_newchunk (__o, __len);					\
   (void) 0; })

# define obstack_empty_p(OBSTACK)					\
  __extension__								\
  ({ struct obstack const *__o = (OBSTACK);				\
     (__o->chunk->prev == 0						\
      && __o->next_free == __PTR_ALIGN ((char *) __o->chunk,		\
					__o->chunk->contents,		\
					__o->alignment_mask)); })

# define obstack_grow(OBSTACK,where,length)				\
__extension__								\
({ struct obstack *__o = (OBSTACK);					\
   int __len = (length);						\
   if (__o->next_free + __len > __o->chunk_limit)			\
     _obstack_newchunk (__o, __len);					\
   memcpy (__o->next_free, where, __len);				\
   __o->next_free += __len;						\
   (void) 0; })

# define obstack_grow0(OBSTACK,where,length)				\
__extension__								\
({ struct obstack *__o = (OBSTACK);					\
   int __len = (length);						\
   if (__o->next_free + __len + 1 > __o->chunk_limit)			\
     _obstack_newchunk (__o, __len + 1);				\
   memcpy (__o->next_free, where, __len);				\
   __o->next_free += __len;						\
   *(__o->next_free)++ = 0;						\
   (void) 0; })

# define obstack_1grow(OBSTACK,datum)					\
__extension__								\
({ struct obstack *__o = (OBSTACK);					\
   if (__o->next_free + 1 > __o->chunk_limit)				\
     _obstack_newchunk (__o, 1);					\
   obstack_1grow_fast (__o, datum);					\
   (void) 0; })

/* These assume that the obstack alignment is good enough for pointers
   or ints, and that the data added so far to the current object
   shares that much alignment.  */

# define obstack_ptr_grow(OBSTACK,datum)				\
__extension__								\
({ struct obstack *__o = (OBSTACK);					\
   if (__o->next_free + sizeof (void *) > __o->chunk_limit)		\
     _obstack_newchunk (__o, sizeof (void *));				\
   obstack_ptr_grow_fast (__o, datum); })				\

# define obstack_int_grow(OBSTACK,datum)				\
__extension__								\
({ struct obstack *__o = (OBSTACK);					\
   if (__o->next_free + sizeof (int) > __o->chunk_limit)		\
     _obstack_newchunk (__o, sizeof (int));				\
   obstack_int_grow_fast (__o, datum); })

# define obstack_ptr_grow_fast(OBSTACK,aptr)				\
__extension__								\
({ struct obstack *__o1 = (OBSTACK);					\
   *(const void **) __o1->next_free = (aptr);				\
   __o1->next_free += sizeof (const void *);				\
   (void) 0; })

# define obstack_int_grow_fast(OBSTACK,aint)				\
__extension__								\
({ struct obstack *__o1 = (OBSTACK);					\
   *(int *) __o1->next_free = (aint);					\
   __o1->next_free += sizeof (int);					\
   (void) 0; })

# define obstack_blank(OBSTACK,length)					\
__extension__								\
({ struct obstack *__o = (OBSTACK);					\
   int __len = (length);						\
   if (__o->chunk_limit - __o->next_free < __len)			\
     _obstack_newchunk (__o, __len);					\
   obstack_blank_fast (__o, __len);					\
   (void) 0; })

# define obstack_alloc(OBSTACK,length)					\
__extension__								\
({ struct obstack *__h = (OBSTACK);					\
   obstack_blank (__h, (length));					\
   obstack_finish (__h); })

# define obstack_copy(OBSTACK,where,length)				\
__extension__								\
({ struct obstack *__h = (OBSTACK);					\
   obstack_grow (__h, (where), (length));				\
   obstack_finish (__h); })

# define obstack_copy0(OBSTACK,where,length)				\
__extension__								\
({ struct obstack *__h = (OBSTACK);					\
   obstack_grow0 (__h, (where), (length));				\
   obstack_finish (__h); })

/* The local variable is named __o1 to avoid a name conflict
   when obstack_blank is called.  */
# define obstack_finish(OBSTACK)					\
__extension__								\
({ struct obstack *__o1 = (OBSTACK);					\
   void *__value = (void *) __o1->object_base;				\
   if (__o1->next_free == __value)					\
     __o1->maybe_empty_object = 1;					\
   __o1->next_free							\
     = __PTR_ALIGN (__o1->object_base, __o1->next_free,			\
		    __o1->alignment_mask);				\
   if (__o1->next_free - (char *)__o1->chunk				\
       > __o1->chunk_limit - (char *)__o1->chunk)			\
     __o1->next_free = __o1->chunk_limit;				\
   __o1->object_base = __o1->next_free;					\
   __value; })

# define obstack_free(OBSTACK, OBJ)					\
__extension__								\
({ struct obstack *__o = (OBSTACK);					\
   void *__obj = (OBJ);							\
   if (__obj > (void *)__o->chunk && __obj < (void *)__o->chunk_limit)  \
     __o->next_free = __o->object_base = (char *)__obj;			\
   else (obstack_free) (__o, __obj); })

#else /* not __GNUC__ or not __STDC__ */

# define obstack_object_size(h) \
 (unsigned) ((h)->next_free - (h)->object_base)

# define obstack_room(h)		\
 (unsigned) ((h)->chunk_limit - (h)->next_free)

# define obstack_empty_p(h) \
 ((h)->chunk->prev == 0							\
  && (h)->next_free == __PTR_ALIGN ((char *) (h)->chunk,		\
				    (h)->chunk->contents,		\
				    (h)->alignment_mask))

/* Note that the call to _obstack_newchunk is enclosed in (..., 0)
   so that we can avoid having void expressions
   in the arms of the conditional expression.
   Casting the third operand to void was tried before,
   but some compilers won't accept it.  */

# define obstack_make_room(h,length)					\
( (h)->temp.tempint = (length),						\
  (((h)->next_free + (h)->temp.tempint > (h)->chunk_limit)		\
   ? (_obstack_newchunk ((h), (h)->temp.tempint), 0) : 0))

# define obstack_grow(h,where,length)					\
( (h)->temp.tempint = (length),						\
  (((h)->next_free + (h)->temp.tempint > (h)->chunk_limit)		\
   ? (_obstack_newchunk ((h), (h)->temp.tempint), 0) : 0),		\
  memcpy ((h)->next_free, where, (h)->temp.tempint),			\
  (h)->next_free += (h)->temp.tempint)

# define obstack_grow0(h,where,length)					\
( (h)->temp.tempint = (length),						\
  (((h)->next_free + (h)->temp.tempint + 1 > (h)->chunk_limit)		\
   ? (_obstack_newchunk ((h), (h)->temp.tempint + 1), 0) : 0),		\
  memcpy ((h)->next_free, where, (h)->temp.tempint),			\
  (h)->next_free += (h)->temp.tempint,					\
  *((h)->next_free)++ = 0)

# define obstack_1grow(h,datum)						\
( (((h)->next_free + 1 > (h)->chunk_limit)				\
   ? (_obstack_newchunk ((h), 1), 0) : 0),				\
  obstack_1grow_fast (h, datum))

# define obstack_ptr_grow(h,datum)					\
( (((h)->next_free + sizeof (char *) > (h)->chunk_limit)		\
   ? (_obstack_newchunk ((h), sizeof (char *)), 0) : 0),		\
  obstack_ptr_grow_fast (h, datum))

# define obstack_int_grow(h,datum)					\
( (((h)->next_free + sizeof (int) > (h)->chunk_limit)			\
   ? (_obstack_newchunk ((h), sizeof (int)), 0) : 0),			\
  obstack_int_grow_fast (h, datum))

# define obstack_ptr_grow_fast(h,aptr)					\
  (((const void **) ((h)->next_free += sizeof (void *)))[-1] = (aptr))

# define obstack_int_grow_fast(h,aint)					\
  (((int *) ((h)->next_free += sizeof (int)))[-1] = (aint))

# define obstack_blank(h,length)					\
( (h)->temp.tempint = (length),						\
  (((h)->chunk_limit - (h)->next_free < (h)->temp.tempint)		\
   ? (_obstack_newchunk ((h), (h)->temp.tempint), 0) : 0),		\
  obstack_blank_fast (h, (h)->temp.tempint))

# define obstack_alloc(h,length)					\
 (obstack_blank ((h), (length)), obstack_finish ((h)))

# define obstack_copy(h,where,length)					\
 (obstack_grow ((h), (where), (length)), obstack_finish ((h)))

# define obstack_copy0(h,where,length)					\
 (obstack_grow0 ((h), (where), (length)), obstack_finish ((h)))

# define obstack_finish(h)						\
( ((h)->next_free == (h)->object_base					\
   ? (((h)->maybe_empty_object = 1), 0)					\
   : 0),								\
  (h)->temp.tempptr = (h)->object_base,					\
  (h)->next_free							\
    = __PTR_ALIGN ((h)->object_base, (h)->next_free,			\
		   (h)->alignment_mask),				\
  (((h)->next_free - (char *) (h)->chunk				\
    > (h)->chunk_limit - (char *) (h)->chunk)				\
   ? ((h)->next_free = (h)->chunk_limit) : 0),				\
  (h)->object_base = (h)->next_free,					\
  (h)->temp.tempptr)

# define obstack_free(h,obj)						\
( (h)->temp.tempint = (char *) (obj) - (char *) (h)->chunk,		\
  ((((h)->temp.tempint > 0						\
    && (h)->temp.tempint < (h)->chunk_limit - (char *) (h)->chunk))	\
   ? (int) ((h)->next_free = (h)->object_base				\
	    = (h)->temp.tempint + (char *) (h)->chunk)			\
   : (((obstack_free) ((h), (h)->temp.tempint + (char *) (h)->chunk), 0), 0)))

#endif /* not __GNUC__ or not __STDC__ */

#ifdef __cplusplus
}	/* C++ */
#endif

#endif /* obstack.h */

cmd: