Home | History | Annotate | Line # | Download | only in ADT
      1 //==- llvm/ADT/IntrusiveRefCntPtr.h - Smart Refcounting Pointer --*- C++ -*-==//
      2 //
      3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
      4 // See https://llvm.org/LICENSE.txt for license information.
      5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
      6 //
      7 //===----------------------------------------------------------------------===//
      8 //
      9 // This file defines the RefCountedBase, ThreadSafeRefCountedBase, and
     10 // IntrusiveRefCntPtr classes.
     11 //
     12 // IntrusiveRefCntPtr is a smart pointer to an object which maintains a
     13 // reference count.  (ThreadSafe)RefCountedBase is a mixin class that adds a
     14 // refcount member variable and methods for updating the refcount.  An object
     15 // that inherits from (ThreadSafe)RefCountedBase deletes itself when its
     16 // refcount hits zero.
     17 //
     18 // For example:
     19 //
     20 //   class MyClass : public RefCountedBase<MyClass> {};
     21 //
     22 //   void foo() {
     23 //     // Constructing an IntrusiveRefCntPtr increases the pointee's refcount by
     24 //     // 1 (from 0 in this case).
     25 //     IntrusiveRefCntPtr<MyClass> Ptr1(new MyClass());
     26 //
     27 //     // Copying an IntrusiveRefCntPtr increases the pointee's refcount by 1.
     28 //     IntrusiveRefCntPtr<MyClass> Ptr2(Ptr1);
     29 //
     30 //     // Constructing an IntrusiveRefCntPtr has no effect on the object's
     31 //     // refcount.  After a move, the moved-from pointer is null.
     32 //     IntrusiveRefCntPtr<MyClass> Ptr3(std::move(Ptr1));
     33 //     assert(Ptr1 == nullptr);
     34 //
     35 //     // Clearing an IntrusiveRefCntPtr decreases the pointee's refcount by 1.
     36 //     Ptr2.reset();
     37 //
     38 //     // The object deletes itself when we return from the function, because
     39 //     // Ptr3's destructor decrements its refcount to 0.
     40 //   }
     41 //
     42 // You can use IntrusiveRefCntPtr with isa<T>(), dyn_cast<T>(), etc.:
     43 //
     44 //   IntrusiveRefCntPtr<MyClass> Ptr(new MyClass());
     45 //   OtherClass *Other = dyn_cast<OtherClass>(Ptr);  // Ptr.get() not required
     46 //
     47 // IntrusiveRefCntPtr works with any class that
     48 //
     49 //  - inherits from (ThreadSafe)RefCountedBase,
     50 //  - has Retain() and Release() methods, or
     51 //  - specializes IntrusiveRefCntPtrInfo.
     52 //
     53 //===----------------------------------------------------------------------===//
     54 
     55 #ifndef LLVM_ADT_INTRUSIVEREFCNTPTR_H
     56 #define LLVM_ADT_INTRUSIVEREFCNTPTR_H
     57 
     58 #include <atomic>
     59 #include <cassert>
     60 #include <cstddef>
     61 #include <memory>
     62 
     63 namespace llvm {
     64 
     65 /// A CRTP mixin class that adds reference counting to a type.
     66 ///
     67 /// The lifetime of an object which inherits from RefCountedBase is managed by
     68 /// calls to Release() and Retain(), which increment and decrement the object's
     69 /// refcount, respectively.  When a Release() call decrements the refcount to 0,
     70 /// the object deletes itself.
     71 template <class Derived> class RefCountedBase {
     72   mutable unsigned RefCount = 0;
     73 
     74 protected:
     75   RefCountedBase() = default;
     76   RefCountedBase(const RefCountedBase &) {}
     77   RefCountedBase &operator=(const RefCountedBase &) = delete;
     78 
     79 #ifndef NDEBUG
     80   ~RefCountedBase() {
     81     assert(RefCount == 0 &&
     82            "Destruction occured when there are still references to this.");
     83   }
     84 #else
     85   // Default the destructor in release builds, A trivial destructor may enable
     86   // better codegen.
     87   ~RefCountedBase() = default;
     88 #endif
     89 
     90 public:
     91   void Retain() const { ++RefCount; }
     92 
     93   void Release() const {
     94     assert(RefCount > 0 && "Reference count is already zero.");
     95     if (--RefCount == 0)
     96       delete static_cast<const Derived *>(this);
     97   }
     98 };
     99 
    100 /// A thread-safe version of \c RefCountedBase.
    101 template <class Derived> class ThreadSafeRefCountedBase {
    102   mutable std::atomic<int> RefCount{0};
    103 
    104 protected:
    105   ThreadSafeRefCountedBase() = default;
    106   ThreadSafeRefCountedBase(const ThreadSafeRefCountedBase &) {}
    107   ThreadSafeRefCountedBase &
    108   operator=(const ThreadSafeRefCountedBase &) = delete;
    109 
    110 #ifndef NDEBUG
    111   ~ThreadSafeRefCountedBase() {
    112     assert(RefCount == 0 &&
    113            "Destruction occured when there are still references to this.");
    114   }
    115 #else
    116   // Default the destructor in release builds, A trivial destructor may enable
    117   // better codegen.
    118   ~ThreadSafeRefCountedBase() = default;
    119 #endif
    120 
    121 public:
    122   void Retain() const { RefCount.fetch_add(1, std::memory_order_relaxed); }
    123 
    124   void Release() const {
    125     int NewRefCount = RefCount.fetch_sub(1, std::memory_order_acq_rel) - 1;
    126     assert(NewRefCount >= 0 && "Reference count was already zero.");
    127     if (NewRefCount == 0)
    128       delete static_cast<const Derived *>(this);
    129   }
    130 };
    131 
    132 /// Class you can specialize to provide custom retain/release functionality for
    133 /// a type.
    134 ///
    135 /// Usually specializing this class is not necessary, as IntrusiveRefCntPtr
    136 /// works with any type which defines Retain() and Release() functions -- you
    137 /// can define those functions yourself if RefCountedBase doesn't work for you.
    138 ///
    139 /// One case when you might want to specialize this type is if you have
    140 ///  - Foo.h defines type Foo and includes Bar.h, and
    141 ///  - Bar.h uses IntrusiveRefCntPtr<Foo> in inline functions.
    142 ///
    143 /// Because Foo.h includes Bar.h, Bar.h can't include Foo.h in order to pull in
    144 /// the declaration of Foo.  Without the declaration of Foo, normally Bar.h
    145 /// wouldn't be able to use IntrusiveRefCntPtr<Foo>, which wants to call
    146 /// T::Retain and T::Release.
    147 ///
    148 /// To resolve this, Bar.h could include a third header, FooFwd.h, which
    149 /// forward-declares Foo and specializes IntrusiveRefCntPtrInfo<Foo>.  Then
    150 /// Bar.h could use IntrusiveRefCntPtr<Foo>, although it still couldn't call any
    151 /// functions on Foo itself, because Foo would be an incomplete type.
    152 template <typename T> struct IntrusiveRefCntPtrInfo {
    153   static void retain(T *obj) { obj->Retain(); }
    154   static void release(T *obj) { obj->Release(); }
    155 };
    156 
    157 /// A smart pointer to a reference-counted object that inherits from
    158 /// RefCountedBase or ThreadSafeRefCountedBase.
    159 ///
    160 /// This class increments its pointee's reference count when it is created, and
    161 /// decrements its refcount when it's destroyed (or is changed to point to a
    162 /// different object).
    163 template <typename T> class IntrusiveRefCntPtr {
    164   T *Obj = nullptr;
    165 
    166 public:
    167   using element_type = T;
    168 
    169   explicit IntrusiveRefCntPtr() = default;
    170   IntrusiveRefCntPtr(T *obj) : Obj(obj) { retain(); }
    171   IntrusiveRefCntPtr(const IntrusiveRefCntPtr &S) : Obj(S.Obj) { retain(); }
    172   IntrusiveRefCntPtr(IntrusiveRefCntPtr &&S) : Obj(S.Obj) { S.Obj = nullptr; }
    173 
    174   template <class X,
    175             std::enable_if_t<std::is_convertible<X *, T *>::value, bool> = true>
    176   IntrusiveRefCntPtr(IntrusiveRefCntPtr<X> S) : Obj(S.get()) {
    177     S.Obj = nullptr;
    178   }
    179 
    180   template <class X,
    181             std::enable_if_t<std::is_convertible<X *, T *>::value, bool> = true>
    182   IntrusiveRefCntPtr(std::unique_ptr<X> S) : Obj(S.release()) {
    183     retain();
    184   }
    185 
    186   ~IntrusiveRefCntPtr() { release(); }
    187 
    188   IntrusiveRefCntPtr &operator=(IntrusiveRefCntPtr S) {
    189     swap(S);
    190     return *this;
    191   }
    192 
    193   T &operator*() const { return *Obj; }
    194   T *operator->() const { return Obj; }
    195   T *get() const { return Obj; }
    196   explicit operator bool() const { return Obj; }
    197 
    198   void swap(IntrusiveRefCntPtr &other) {
    199     T *tmp = other.Obj;
    200     other.Obj = Obj;
    201     Obj = tmp;
    202   }
    203 
    204   void reset() {
    205     release();
    206     Obj = nullptr;
    207   }
    208 
    209   void resetWithoutRelease() { Obj = nullptr; }
    210 
    211 private:
    212   void retain() {
    213     if (Obj)
    214       IntrusiveRefCntPtrInfo<T>::retain(Obj);
    215   }
    216 
    217   void release() {
    218     if (Obj)
    219       IntrusiveRefCntPtrInfo<T>::release(Obj);
    220   }
    221 
    222   template <typename X> friend class IntrusiveRefCntPtr;
    223 };
    224 
    225 template <class T, class U>
    226 inline bool operator==(const IntrusiveRefCntPtr<T> &A,
    227                        const IntrusiveRefCntPtr<U> &B) {
    228   return A.get() == B.get();
    229 }
    230 
    231 template <class T, class U>
    232 inline bool operator!=(const IntrusiveRefCntPtr<T> &A,
    233                        const IntrusiveRefCntPtr<U> &B) {
    234   return A.get() != B.get();
    235 }
    236 
    237 template <class T, class U>
    238 inline bool operator==(const IntrusiveRefCntPtr<T> &A, U *B) {
    239   return A.get() == B;
    240 }
    241 
    242 template <class T, class U>
    243 inline bool operator!=(const IntrusiveRefCntPtr<T> &A, U *B) {
    244   return A.get() != B;
    245 }
    246 
    247 template <class T, class U>
    248 inline bool operator==(T *A, const IntrusiveRefCntPtr<U> &B) {
    249   return A == B.get();
    250 }
    251 
    252 template <class T, class U>
    253 inline bool operator!=(T *A, const IntrusiveRefCntPtr<U> &B) {
    254   return A != B.get();
    255 }
    256 
    257 template <class T>
    258 bool operator==(std::nullptr_t, const IntrusiveRefCntPtr<T> &B) {
    259   return !B;
    260 }
    261 
    262 template <class T>
    263 bool operator==(const IntrusiveRefCntPtr<T> &A, std::nullptr_t B) {
    264   return B == A;
    265 }
    266 
    267 template <class T>
    268 bool operator!=(std::nullptr_t A, const IntrusiveRefCntPtr<T> &B) {
    269   return !(A == B);
    270 }
    271 
    272 template <class T>
    273 bool operator!=(const IntrusiveRefCntPtr<T> &A, std::nullptr_t B) {
    274   return !(A == B);
    275 }
    276 
    277 // Make IntrusiveRefCntPtr work with dyn_cast, isa, and the other idioms from
    278 // Casting.h.
    279 template <typename From> struct simplify_type;
    280 
    281 template <class T> struct simplify_type<IntrusiveRefCntPtr<T>> {
    282   using SimpleType = T *;
    283 
    284   static SimpleType getSimplifiedValue(IntrusiveRefCntPtr<T> &Val) {
    285     return Val.get();
    286   }
    287 };
    288 
    289 template <class T> struct simplify_type<const IntrusiveRefCntPtr<T>> {
    290   using SimpleType = /*const*/ T *;
    291 
    292   static SimpleType getSimplifiedValue(const IntrusiveRefCntPtr<T> &Val) {
    293     return Val.get();
    294   }
    295 };
    296 
    297 /// Factory function for creating intrusive ref counted pointers.
    298 template <typename T, typename... Args>
    299 IntrusiveRefCntPtr<T> makeIntrusiveRefCnt(Args &&...A) {
    300   return IntrusiveRefCntPtr<T>(new T(std::forward<Args>(A)...));
    301 }
    302 
    303 } // end namespace llvm
    304 
    305 #endif // LLVM_ADT_INTRUSIVEREFCNTPTR_H
    306