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 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247
|
// Copyright (c) 1996 James Clark
// See the file copying.txt for copying permission.
#ifndef Collector_INCLUDED
#define Collector_INCLUDED 1
#include <stddef.h>
#include <OpenSP/Boolean.h>
// A garbage collector.
class Collector {
public:
struct Block;
class Object {
friend struct Block;
friend class Collector;
public:
bool readOnly() const { return readOnly_; }
bool permanent() const { return color_ == permanentColor; }
protected:
Object() : readOnly_(0) { }
virtual ~Object() { }
// If we copy an object, don't copy inappropriate info.
Object(const Object &obj) { hasSubObjects_ = obj.hasSubObjects_; }
// For objects with subobjects, this must be overriden
// to call Collector::trace for each direct subobject.
virtual void traceSubObjects(Collector &) const { }
private:
enum Color {
someColor,
anotherColor,
permanentColor
};
Object *next() const { return next_; }
Object *prev() const { return prev_; }
void makeHead() { prev_ = next_ = this; }
Color color() const { return Color(color_); }
void setColor(Color color) { color_ = color; }
void moveAfter(Object *tail);
bool hasSubObjects() const { return hasSubObjects_; }
void finalize() { this->~Object(); }
private:
Object *prev_;
Object *next_;
char color_;
char hasFinalizer_;
protected:
char hasSubObjects_;
char readOnly_;
};
class DynamicRoot {
public:
DynamicRoot(Collector &);
virtual ~DynamicRoot();
virtual void trace(Collector &) const { }
DynamicRoot(const DynamicRoot &);
void operator=(const DynamicRoot &);
private:
DynamicRoot();
void link(const DynamicRoot *);
void unlink();
DynamicRoot *next_;
DynamicRoot *prev_;
friend class Collector;
};
class ObjectDynamicRoot : public DynamicRoot {
public:
ObjectDynamicRoot(Collector &, Object * = 0);
ObjectDynamicRoot &operator=(Object *obj);
void trace(Collector &) const;
operator Object *() const { return obj_; }
private:
Object *obj_;
};
struct Block {
Block(Block *, size_t, size_t, Object *);
~Block();
Block *next;
Object *firstObj;
};
Collector(size_t maxSize);
virtual ~Collector();
void *allocateObject(bool hasFinalizer);
// This is called only when the constructor throws an exception.
void unallocateObject(void *);
void trace(const Object *obj);
// Permanent objects must not be altered in such a way that
// they contain pointers to non-permanent objects.
void makePermanent(Object *);
// Returns the number of live objects.
unsigned long collect();
void makeReadOnly(Object *);
bool objectMaybeLive(Object *);
protected:
virtual void traceStaticRoots() const { }
private:
Collector(const Collector &); // undefined
void operator=(const Collector &); // undefined
Object *freePtr_;
Object allObjectsList_; // doubly-linked circular list of all objects
Object permanentFinalizersList_;
Object *lastTraced_;
DynamicRoot dynRootList_; // doubly-linked circular list
Object::Color currentColor_;
Block *blocks_;
unsigned long totalObjects_;
size_t maxSize_;
void makeSpace();
void traceDynamicRoots();
void check();
void makeReadOnly1(Object *);
friend class DynamicRoot;
friend class Object;
};
inline
void Collector::Object::moveAfter(Object *tail)
{
// unlink from old position
next_->prev_ = prev_;
prev_->next_ = next_;
// link in following tail
next_ = tail->next_;
tail->next_->prev_ = this;
prev_ = tail;
tail->next_ = this;
}
inline
void *Collector::allocateObject(bool hasFinalizer)
{
if (freePtr_ == &allObjectsList_)
makeSpace();
Object *tem = freePtr_;
freePtr_ = freePtr_->next();
tem->setColor(currentColor_);
tem->hasFinalizer_ = hasFinalizer;
if (hasFinalizer)
tem->moveAfter(&allObjectsList_);
return tem;
}
inline
void Collector::trace(const Object *obj)
{
if (obj && obj->color() != currentColor_
&& obj->color() != Object::permanentColor) {
((Object *)obj)->setColor(currentColor_);
((Object *)obj)->moveAfter(lastTraced_);
lastTraced_ = (Object *)obj;
}
}
inline
void Collector::DynamicRoot::link(const DynamicRoot *root)
{
DynamicRoot *list = (DynamicRoot *)root;
// link in just after list
prev_ = list;
next_ = list->next_;
list->next_->prev_ = this;
list->next_ = this;
}
inline
void Collector::DynamicRoot::unlink()
{
next_->prev_ = prev_;
prev_->next_ = next_;
}
inline
Collector::DynamicRoot::DynamicRoot(Collector &c)
{
link(&c.dynRootList_);
}
inline
Collector::DynamicRoot::DynamicRoot()
: next_(this), prev_(this)
{
}
inline
Collector::DynamicRoot::DynamicRoot(const DynamicRoot &root)
{
link(&root);
}
inline
void Collector::DynamicRoot::operator=(const DynamicRoot &root)
{
unlink();
link(&root);
}
inline
Collector::ObjectDynamicRoot::ObjectDynamicRoot(Collector &c, Object *obj)
: Collector::DynamicRoot(c), obj_(obj)
{
}
inline
Collector::ObjectDynamicRoot &
Collector::ObjectDynamicRoot::operator=(Object *obj)
{
obj_ = obj;
return *this;
}
inline
void Collector::ObjectDynamicRoot::trace(Collector &c) const
{
c.trace(obj_);
}
inline
Collector::Block::~Block()
{
::operator delete(firstObj);
}
inline
bool Collector::objectMaybeLive(Object *obj)
{
return obj->color() == currentColor_ || obj->color() == Object::permanentColor;
}
inline
void Collector::makeReadOnly(Object *obj)
{
if (!obj->hasSubObjects())
obj->readOnly_ = 1;
else if (!obj->readOnly())
makeReadOnly1(obj);
}
#endif /* not Collector_INCLUDED */
|