// This may look like C code, but it is really -*- C++ -*-
Copyright (C) 1988 Free Software Foundation
written by Doug Lea (dl@rocky.oswego.edu)
This file is part of GNU CC.
GNU CC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY. No author or distributor
accepts responsibility to anyone for the consequences of using it
or for whether it serves any particular purpose or works at all,
unless he says so in writing. Refer to the GNU CC General Public
License for full details.
Everyone is granted permission to copy, modify and redistribute
GNU CC, but only under the conditions described in the
GNU CC General Public License. A copy of this license is
supposed to have been given to you along with GNU CC so you
can know your rights and responsibilities. It should be in a
file named COPYING. Among other things, the copyright notice
and this notice must be preserved on all copies.
Obstack(int size
= 4080, int alignment
= 4); // 4080=4096-mallocslop
int contains(void* p
); // does Obstack hold pointer p?
void grow(const void* data
, int size
);
void grow(const void* data
, int size
, char terminator
);
void grow(const char* s
);
void blank_fast(int size
);
void* finish(char terminator
);
void* copy(const void* data
, int size
);
void* copy(const void* data
, int size
, char terminator
);
void* copy(const char* s
);
void shrink(int size
= 1); // suggested by ken@cs.rochester.edu
int OK(); // rep invariant
#if defined(__OPTIMIZE__) || defined(USE_LIBGXX_INLINES)
inline Obstack::~Obstack()
inline void* Obstack::base()
inline void* Obstack::next_free()
inline int Obstack::alignment_mask()
inline int Obstack::chunk_size()
inline int Obstack::size()
return nextfree
- objectbase
;
inline int Obstack::room()
return chunklimit
- nextfree
;
inline void Obstack:: grow(const void* data
, int size
)
if (nextfree
+size
> chunklimit
)
bcopy(data
, nextfree
, size
);
inline void Obstack:: grow(const void* data
, int size
, char terminator
)
if (nextfree
+size
+1 > chunklimit
)
bcopy(data
, nextfree
, size
);
*(nextfree
)++ = terminator
;
inline void Obstack:: grow(const char* s
)
grow((void*)s
, strlen(s
), 0);
inline void Obstack:: grow(char c
)
if (nextfree
+1 > chunklimit
)
inline void Obstack:: blank(int size
)
if (nextfree
+size
> chunklimit
)
inline void* Obstack::finish(char terminator
)
inline void* Obstack::copy(const void* data
, int size
)
inline void* Obstack::copy(const void* data
, int size
, char terminator
)
grow(data
, size
, terminator
);
inline void* Obstack::copy(const char* s
)
grow((void*)s
, strlen(s
), 0);
inline void* Obstack::copy(char c
)
inline void* Obstack::alloc(int size
)
inline void Obstack:: free(void* obj
)
if (obj
>= (void*)chunk
&& obj
<(void*)chunklimit
)
nextfree
= objectbase
= (char *) obj
;
inline void Obstack:: grow_fast(char c
)
inline void Obstack:: blank_fast(int size
)
inline void Obstack:: shrink(int size
) // from ken@cs.rochester.edu
if (nextfree
>= objectbase
+ size
)