modules/up/src/gnug++/Obstack.h

/* [<][>]
[^][v][top][bottom][index][help] */

FUNCTIONS

This source file includes following functions.
  1. Obstack
  2. Obstack
  3. base
  4. next_free
  5. alignment_mask
  6. chunk_size
  7. size
  8. room
  9. grow
  10. grow
  11. grow
  12. grow
  13. blank
  14. finish
  15. copy
  16. copy
  17. copy
  18. copy
  19. alloc
  20. free
  21. grow_fast
  22. blank_fast
  23. shrink

// 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 the GNU C++ Library.  This library is free
software; you can redistribute it and/or modify it under the terms of
the GNU Library General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your
option) any later version.  This 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 Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this library; if not, write to the Free Software
Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/


#ifndef _Obstack_h
#ifdef __GNUG__
#pragma interface
#endif
#define _Obstack_h 1

#include <std.h>

#undef OK

class Obstack
/* [<][>][^][v][top][bottom][index][help] */
{
  struct _obstack_chunk
  {
    char*           limit;
    _obstack_chunk* prev;
    char            contents[4];
  };

protected:
  long            chunksize;
  _obstack_chunk* chunk;
  char*           objectbase;
  char*           nextfree;
  char*           chunklimit;
  int             alignmentmask;

  void  _free(void* obj);
  void  newchunk(int size);

public:
        Obstack(int size = 4080, int alignment = 4); // 4080=4096-mallocslop

        ~Obstack();

  void* base();
  void* next_free();
  int   alignment_mask();
  int   chunk_size();
  int   size();
  int   room();
  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  grow(char c);
  void  grow_fast(char c);
  void  blank(int size);
  void  blank_fast(int size);

  void* finish();
  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* copy(char c);
  void* alloc(int size);

  void  free(void* obj);
  void  shrink(int size = 1); // suggested by ken@cs.rochester.edu

  int   OK();                   // rep invariant
};


inline Obstack::~Obstack()
/* [<][>][^][v][top][bottom][index][help] */
{
  _free(0); 
}

inline void* Obstack::base()
/* [<][>][^][v][top][bottom][index][help] */
{
  return objectbase; 
}

inline void* Obstack::next_free()
/* [<][>][^][v][top][bottom][index][help] */
{
  return nextfree; 
}

inline int Obstack::alignment_mask()
/* [<][>][^][v][top][bottom][index][help] */
{
  return alignmentmask; 
}

inline int Obstack::chunk_size()
/* [<][>][^][v][top][bottom][index][help] */
{
  return chunksize; 
}

inline int Obstack::size()
/* [<][>][^][v][top][bottom][index][help] */
{
  return nextfree - objectbase; 
}

inline int Obstack::room()
/* [<][>][^][v][top][bottom][index][help] */
{
  return chunklimit - nextfree; 
}

inline void Obstack:: grow(const void* data, int size)
/* [<][>][^][v][top][bottom][index][help] */
{
  if (nextfree+size > chunklimit) 
    newchunk(size);
  memcpy(nextfree, data, size);
  nextfree += size; 
}

inline void Obstack:: grow(const void* data, int size, char terminator)
/* [<][>][^][v][top][bottom][index][help] */
{
  if (nextfree+size+1 > chunklimit) 
    newchunk(size+1);
  memcpy(nextfree, data, size);
  nextfree += size; 
  *(nextfree)++ = terminator; 
}

inline void Obstack:: grow(const char* s)
/* [<][>][^][v][top][bottom][index][help] */
{
  grow((const void*)s, strlen(s), 0); 
}

inline void Obstack:: grow(char c)
/* [<][>][^][v][top][bottom][index][help] */
{
  if (nextfree+1 > chunklimit) 
    newchunk(1); 
  *(nextfree)++ = c; 
}

inline void Obstack:: blank(int size)
/* [<][>][^][v][top][bottom][index][help] */
{
  if (nextfree+size > chunklimit) 
    newchunk(size);
  nextfree += size; 
}

inline void* Obstack::finish(char terminator)
/* [<][>][^][v][top][bottom][index][help] */
{
  grow(terminator); 
  return finish(); 
}

inline void* Obstack::copy(const void* data, int size)
/* [<][>][^][v][top][bottom][index][help] */
{
  grow (data, size);
  return finish(); 
}

inline void* Obstack::copy(const void* data, int size, char terminator)
/* [<][>][^][v][top][bottom][index][help] */
{
  grow(data, size, terminator); 
  return finish(); 
}

inline void* Obstack::copy(const char* s)
/* [<][>][^][v][top][bottom][index][help] */
{
  grow((const void*)s, strlen(s), 0); 
  return finish(); 
}

inline void* Obstack::copy(char c)
/* [<][>][^][v][top][bottom][index][help] */
{
  grow(c);
  return finish(); 
}

inline void* Obstack::alloc(int size)
/* [<][>][^][v][top][bottom][index][help] */
{
  blank(size);
  return finish(); 
}

inline void Obstack:: free(void* obj)     
/* [<][>][^][v][top][bottom][index][help] */
{
  if (obj >= (void*)chunk && obj<(void*)chunklimit)
    nextfree = objectbase = (char *) obj;
  else 
    _free(obj); 
}

inline void Obstack:: grow_fast(char c)
/* [<][>][^][v][top][bottom][index][help] */
{
  *(nextfree)++ = c; 
}

inline void Obstack:: blank_fast(int size)
/* [<][>][^][v][top][bottom][index][help] */
{
  nextfree += size; 
}

inline void Obstack:: shrink(int size) // from ken@cs.rochester.edu
/* [<][>][^][v][top][bottom][index][help] */
{
  if (nextfree >= objectbase + size)
    nextfree -= size;
}

#endif

/* [<][>][^][v][top][bottom][index][help] */