Computer Club Elmshorn Atari PD/CCE_PD.iso/pc/0400/CCE_0423.ZIP/CCE_0423.PD/GPINCL13.ZOO/xobstack.h

C/C++ Source or Header | 1992-10-01 | 5KB | 220 lines

// This may look like C code, but it is really -*- C++ -*-
/*
Copyright (C) 1988 Free Software Foundation
    written by Doug Lea ([e-mail])

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, 675 Mass Ave, Cambridge, MA 02139, USA.
*/


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

#include <std.h>
#ifdef atarist
# include <compiler.h>
#endif

class Obstack
{
  struct _obstack_chunk
  {
    char*           limit;
    _obstack_chunk* prev;
    char            contents[4];
  };

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

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

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

        ~Obstack();

  void* base();
  void* next_free();
  size_t   alignment_mask();
  size_t   chunk_size();
  size_t   size();
  size_t   room();
  int   contains(void* p);      // does Obstack hold pointer p?

  void  grow(const void* data, size_t size);
  void  grow(const void* data, size_t size, char terminator);
  void  grow(const char* s);
  void  grow(char c);
  void  grow_fast(char c);
  void  blank(size_t size);
  void  blank_fast(size_t size);

  void* finish();
  void* finish(char terminator);

  void* copy(const void* data, size_t size);
  void* copy(const void* data, size_t size, char terminator);
  void* copy(const char* s);
  void* copy(char c);
  void* alloc(size_t size);

  void  free(void* obj);
  void  shrink(size_t size = 1); // suggested by [e-mail]

  int   OK();                   // rep invariant
};


inline Obstack::~Obstack()
{
  _free(0);
}

inline void* Obstack::base()
{
  return objectbase;
}

inline void* Obstack::next_free()
{
  return nextfree;
}

inline size_t Obstack::alignment_mask()
{
  return alignmentmask;
}

inline size_t Obstack::chunk_size()
{
  return chunksize;
}

inline size_t Obstack::size()
{
  return nextfree - objectbase;
}

inline size_t Obstack::room()
{
  return chunklimit - nextfree;
}

inline void Obstack:: grow(const void* data, size_t size)
{
  if (nextfree+size > chunklimit)
    newchunk(size);
  bcopy(data, nextfree, size);
  nextfree += size;
}

inline void Obstack:: grow(const void* data, size_t size, char terminator)
{
  if (nextfree+size+1 > chunklimit)
    newchunk(size+1);
  bcopy(data, nextfree, size);
  nextfree += size;
  *(nextfree)++ = terminator;
}

inline void Obstack:: grow(const char* s)
{
  grow((const void*)s, strlen(s), 0);
}

inline void Obstack:: grow(char c)
{
  if (nextfree+1 > chunklimit)
    newchunk(1);
  *(nextfree)++ = c;
}

inline void Obstack:: blank(size_t size)
{
  if (nextfree+size > chunklimit)
    newchunk(size);
  nextfree += size;
}

inline void* Obstack::finish(char terminator)
{
  grow(terminator);
  return finish();
}

inline void* Obstack::copy(const void* data, size_t size)
{
  grow (data, size);
  return finish();
}

inline void* Obstack::copy(const void* data, size_t size, char terminator)
{
  grow(data, size, terminator);
  return finish();
}

inline void* Obstack::copy(const char* s)
{
  grow((const void*)s, strlen(s), 0);
  return finish();
}

inline void* Obstack::copy(char c)
{
  grow(c);
  return finish();
}

inline void* Obstack::alloc(size_t size)
{
  blank(size);
  return finish();
}

inline void Obstack:: free(void* obj)
{
  if (obj >= (void*)chunk && obj<(void*)chunklimit)
    nextfree = objectbase = (char *) obj;
  else
    _free(obj);
}

inline void Obstack:: grow_fast(char c)
{
  *(nextfree)++ = c;
}

inline void Obstack:: blank_fast(size_t size)
{
  nextfree += size;
}

inline void Obstack:: shrink(size_t size) // from [e-mail]
{
  if (nextfree >= objectbase + size)
    nextfree -= size;
}

#endif