summaryrefslogtreecommitdiff
path: root/ace/Obstack.h
blob: a65c4ef1a8c23c93eebc03d39f1314af85b554e5 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
/* -*- C++ -*- */
// $Id$

// ============================================================================
//
// = LIBRARY
//    ace
//
// = FILENAME
//    Obstack.h
//
// = AUTHOR
//    Doug Schmidt
//
// ============================================================================

#ifndef ACE_OBSTACK_H
#define ACE_OBSTACK_H

#include "ace/Malloc.h"

#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */

class ACE_Export ACE_Obchunk
{
  // = TITLE
  //     Defines the state that represents a "chunk" of memory.
public:
  friend class ACE_Obstack;

  ACE_Obchunk (size_t size);
  // Constructor.

  ~ACE_Obchunk (void);
  // dtor.

  void dump (void) const;
  // Dump the state of an object.

  ACE_ALLOC_HOOK_DECLARE;
  // Declare the dynamic allocation hooks.

private:
  char *end_;
  // Pointer to the end of the chunk.

  char *cur_;
  // Pointer to the current location in the chunk.

  ACE_Obchunk *next_;
  // Next chunk in the chain.

  char contents_[4];
  // Pointer to the beginning contents of this chunk.  This field is
  // actually overlayed by the memory allocated by
  // <ACE_Obstack::new_chunk>.  Therefore, it *must* come last.
};

class ACE_Export ACE_Obstack
{
  // = TITLE
  //     Define a simple "mark and release" memory allocation utility.
  //
  // = DESCRIPTION
  //     The implementation is similar to the GNU obstack utility,
  //     which is used extensively in the GCC compiler.
public:
  // = Initialization and termination methods.
  ACE_Obstack (size_t size = 4096 - sizeof (ACE_Obchunk),
               ACE_Allocator *allocator_strategy = 0);
  ~ACE_Obstack (void);

  char *copy (const char *data,
              size_t len);
  // Copy the data into the current Obchunk.

  void release (void);
  // "Release" the entire stack of Obchunks, putting it back on the
  // free list.

  void dump (void) const;
  // Dump the state of an object.

  ACE_ALLOC_HOOK_DECLARE;
  // Declare the dynamic allocation hooks.

protected:
  class ACE_Obchunk *new_chunk (void);

  ACE_Allocator *allocator_strategy_;
  // Pointer to the allocator used by this Obstack.

  size_t size_;
  // Current size of the Obstack;

  // = Don't change the order of the following two fields.
  class ACE_Obchunk *head_;
  // Head of the Obchunk chain.

  class ACE_Obchunk *curr_;
  // Pointer to the current Obchunk.
};

#if defined (__ACE_INLINE__)
#include "ace/Obstack.i"
#endif /* __ACE_INLINE__ */

#endif /* ACE_OBSTACK_H */