2 * Copyright (c) 2002-2005 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 * Authors: Nathan Binkert
31 #ifndef __BASE_REFCNT_HH__
32 #define __BASE_REFCNT_HH__
40 RefCounted(const RefCounted &);
43 RefCounted() : count(0) {}
44 virtual ~RefCounted() {}
46 void incref() { ++count; }
47 void decref() { if (--count <= 0) delete this; }
78 RefCountingPtr() : data(0) {}
79 RefCountingPtr(T *data) { copy(data); }
80 RefCountingPtr(const RefCountingPtr &r) { copy(r.data); }
81 ~RefCountingPtr() { del(); }
83 T *operator->() { return data; }
84 T &operator*() { return *data; }
85 T *get() { return data; }
87 const T *operator->() const { return data; }
88 const T &operator*() const { return *data; }
89 const T *get() const { return data; }
91 const RefCountingPtr &operator=(T *p) { set(p); return *this; }
92 const RefCountingPtr &operator=(const RefCountingPtr &r)
93 { return operator=(r.data); }
95 bool operator!() const { return data == 0; }
96 operator bool() const { return data != 0; }
100 bool operator==(const RefCountingPtr<T> &l, const RefCountingPtr<T> &r)
101 { return l.get() == r.get(); }
104 bool operator==(const RefCountingPtr<T> &l, const T *r)
105 { return l.get() == r; }
108 bool operator==(const T &l, const RefCountingPtr<T> &r)
109 { return l == r.get(); }
112 bool operator!=(const RefCountingPtr<T> &l, const RefCountingPtr<T> &r)
113 { return l.get() != r.get(); }
116 bool operator!=(const RefCountingPtr<T> &l, const T *r)
117 { return l.get() != r; }
120 bool operator!=(const T &l, const RefCountingPtr<T> &r)
121 { return l != r.get(); }
123 #endif // __BASE_REFCNT_HH__