// // // Copyright 2017 gRPC authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // #ifndef GRPC_SRC_CORE_UTIL_REF_COUNTED_PTR_H #define GRPC_SRC_CORE_UTIL_REF_COUNTED_PTR_H #include #include #include #include #include #include "absl/hash/hash.h" #include "src/core/util/debug_location.h" #include "src/core/util/down_cast.h" namespace grpc_core { // A smart pointer class for objects that provide IncrementRefCount() and // Unref() methods, such as those provided by the RefCounted base class. template class RefCountedPtr { public: RefCountedPtr() {} // NOLINTNEXTLINE(google-explicit-constructor) RefCountedPtr(std::nullptr_t) {} // If value is non-null, we take ownership of a ref to it. template ::value, bool> = true> explicit RefCountedPtr(Y* value) : value_(value) {} // Move ctors. RefCountedPtr(RefCountedPtr&& other) noexcept { value_ = other.value_; other.value_ = nullptr; } template ::value, bool> = true> // NOLINTNEXTLINE(google-explicit-constructor) RefCountedPtr(RefCountedPtr&& other) noexcept { value_ = static_cast(other.value_); other.value_ = nullptr; } // Move assignment. RefCountedPtr& operator=(RefCountedPtr&& other) noexcept { reset(std::exchange(other.value_, nullptr)); return *this; } template ::value, bool> = true> RefCountedPtr& operator=(RefCountedPtr&& other) noexcept { reset(std::exchange(other.value_, nullptr)); return *this; } // Copy ctors. RefCountedPtr(const RefCountedPtr& other) { if (other.value_ != nullptr) other.value_->IncrementRefCount(); value_ = other.value_; } template ::value, bool> = true> // NOLINTNEXTLINE(google-explicit-constructor) RefCountedPtr(const RefCountedPtr& other) { static_assert(std::has_virtual_destructor::value, "T does not have a virtual dtor"); if (other.value_ != nullptr) other.value_->IncrementRefCount(); value_ = static_cast(other.value_); } // Copy assignment. // NOLINTNEXTLINE(bugprone-unhandled-self-assignment) RefCountedPtr& operator=(const RefCountedPtr& other) { // Note: Order of reffing and unreffing is important here in case value_ // and other.value_ are the same object. if (other.value_ != nullptr) other.value_->IncrementRefCount(); reset(other.value_); return *this; } template ::value, bool> = true> RefCountedPtr& operator=(const RefCountedPtr& other) { static_assert(std::has_virtual_destructor::value, "T does not have a virtual dtor"); // Note: Order of reffing and unreffing is important here in case value_ // and other.value_ are the same object. if (other.value_ != nullptr) other.value_->IncrementRefCount(); reset(other.value_); return *this; } ~RefCountedPtr() { if (value_ != nullptr) value_->Unref(); } // An explicit copy method that supports ref-count tracing. RefCountedPtr Ref(const DebugLocation& location, const char* reason) { if (value_ != nullptr) value_->IncrementRefCount(location, reason); return RefCountedPtr(value_); } void swap(RefCountedPtr& other) { std::swap(value_, other.value_); } // If value is non-null, we take ownership of a ref to it. void reset(T* value = nullptr) { T* old_value = std::exchange(value_, value); if (old_value != nullptr) old_value->Unref(); } void reset(const DebugLocation& location, const char* reason, T* value = nullptr) { T* old_value = std::exchange(value_, value); if (old_value != nullptr) old_value->Unref(location, reason); } template ::value, bool> = true> void reset(Y* value = nullptr) { static_assert(std::has_virtual_destructor::value, "T does not have a virtual dtor"); reset(static_cast(value)); } template ::value, bool> = true> void reset(const DebugLocation& location, const char* reason, Y* value = nullptr) { static_assert(std::has_virtual_destructor::value, "T does not have a virtual dtor"); reset(location, reason, static_cast(value)); } // This method is mostly useful for interoperating with C code. // Eventually use within core should be banned, except at the surface API // boundaries. T* release() { return std::exchange(value_, nullptr); } T* get() const { return value_; } T& operator*() const { return *value_; } T* operator->() const { return value_; } template ::value, bool> = true> RefCountedPtr TakeAsSubclass() { return RefCountedPtr(DownCast(release())); } template ::value, bool> = true> bool operator==(const RefCountedPtr& other) const { return value_ == other.value_; } template ::value, bool> = true> bool operator==(const Y* other) const { return value_ == other; } bool operator==(std::nullptr_t) const { return value_ == nullptr; } template ::value, bool> = true> bool operator!=(const RefCountedPtr& other) const { return value_ != other.value_; } template ::value, bool> = true> bool operator!=(const Y* other) const { return value_ != other; } bool operator!=(std::nullptr_t) const { return value_ != nullptr; } private: template friend class RefCountedPtr; T* value_ = nullptr; }; // A smart pointer class for objects that provide IncrementWeakRefCount() and // WeakUnref() methods, such as those provided by the DualRefCounted base class. template class WeakRefCountedPtr { public: WeakRefCountedPtr() {} // NOLINTNEXTLINE(google-explicit-constructor) WeakRefCountedPtr(std::nullptr_t) {} // If value is non-null, we take ownership of a ref to it. template ::value, bool> = true> explicit WeakRefCountedPtr(Y* value) { value_ = value; } // Move ctors. WeakRefCountedPtr(WeakRefCountedPtr&& other) noexcept { value_ = other.value_; other.value_ = nullptr; } template ::value, bool> = true> // NOLINTNEXTLINE(google-explicit-constructor) WeakRefCountedPtr(WeakRefCountedPtr&& other) noexcept { value_ = static_cast(other.value_); other.value_ = nullptr; } // Move assignment. WeakRefCountedPtr& operator=(WeakRefCountedPtr&& other) noexcept { reset(std::exchange(other.value_, nullptr)); return *this; } template ::value, bool> = true> WeakRefCountedPtr& operator=(WeakRefCountedPtr&& other) noexcept { reset(std::exchange(other.value_, nullptr)); return *this; } // Copy ctors. WeakRefCountedPtr(const WeakRefCountedPtr& other) { if (other.value_ != nullptr) other.value_->IncrementWeakRefCount(); value_ = other.value_; } template ::value, bool> = true> // NOLINTNEXTLINE(google-explicit-constructor) WeakRefCountedPtr(const WeakRefCountedPtr& other) { static_assert(std::has_virtual_destructor::value, "T does not have a virtual dtor"); if (other.value_ != nullptr) other.value_->IncrementWeakRefCount(); value_ = static_cast(other.value_); } // Copy assignment. // NOLINTNEXTLINE(bugprone-unhandled-self-assignment) WeakRefCountedPtr& operator=(const WeakRefCountedPtr& other) { // Note: Order of reffing and unreffing is important here in case value_ // and other.value_ are the same object. if (other.value_ != nullptr) other.value_->IncrementWeakRefCount(); reset(other.value_); return *this; } template ::value, bool> = true> WeakRefCountedPtr& operator=(const WeakRefCountedPtr& other) { static_assert(std::has_virtual_destructor::value, "T does not have a virtual dtor"); // Note: Order of reffing and unreffing is important here in case value_ // and other.value_ are the same object. if (other.value_ != nullptr) other.value_->IncrementWeakRefCount(); reset(other.value_); return *this; } ~WeakRefCountedPtr() { if (value_ != nullptr) value_->WeakUnref(); } // An explicit copy method that supports ref-count tracing. WeakRefCountedPtr WeakRef(const DebugLocation& location, const char* reason) { if (value_ != nullptr) value_->IncrementWeakRefCount(location, reason); return WeakRefCountedPtr(value_); } void swap(WeakRefCountedPtr& other) { std::swap(value_, other.value_); } // If value is non-null, we take ownership of a ref to it. void reset(T* value = nullptr) { T* old_value = std::exchange(value_, value); if (old_value != nullptr) old_value->WeakUnref(); } void reset(const DebugLocation& location, const char* reason, T* value = nullptr) { T* old_value = std::exchange(value_, value); if (old_value != nullptr) old_value->WeakUnref(location, reason); } template ::value, bool> = true> void reset(Y* value = nullptr) { static_assert(std::has_virtual_destructor::value, "T does not have a virtual dtor"); reset(static_cast(value)); } template ::value, bool> = true> void reset(const DebugLocation& location, const char* reason, Y* value = nullptr) { static_assert(std::has_virtual_destructor::value, "T does not have a virtual dtor"); reset(location, reason, static_cast(value)); } // TODO(roth): This method exists solely as a transition mechanism to allow // us to pass a ref to idiomatic C code that does not use WeakRefCountedPtr<>. // Once all of our code has been converted to idiomatic C++, this // method should go away. T* release() { return std::exchange(value_, nullptr); } T* get() const { return value_; } T& operator*() const { return *value_; } T* operator->() const { return value_; } template ::value, bool> = true> WeakRefCountedPtr TakeAsSubclass() { return WeakRefCountedPtr(static_cast(release())); } template ::value, bool> = true> bool operator==(const WeakRefCountedPtr& other) const { return value_ == other.value_; } template ::value, bool> = true> bool operator==(const Y* other) const { return value_ == other; } bool operator==(std::nullptr_t) const { return value_ == nullptr; } template ::value, bool> = true> bool operator!=(const WeakRefCountedPtr& other) const { return value_ != other.value_; } template ::value, bool> = true> bool operator!=(const Y* other) const { return value_ != other; } bool operator!=(std::nullptr_t) const { return value_ != nullptr; } private: template friend class WeakRefCountedPtr; T* value_ = nullptr; }; template inline RefCountedPtr MakeRefCounted(Args&&... args) { return RefCountedPtr(new T(std::forward(args)...)); } template bool operator<(const RefCountedPtr& p1, const RefCountedPtr& p2) { return p1.get() < p2.get(); } template bool operator<(const WeakRefCountedPtr& p1, const WeakRefCountedPtr& p2) { return p1.get() < p2.get(); } // // absl::Hash integration // template H AbslHashValue(H h, const RefCountedPtr& p) { return H::combine(std::move(h), p.get()); } template H AbslHashValue(H h, const WeakRefCountedPtr& p) { return H::combine(std::move(h), p.get()); } // Heterogenous lookup support. template struct RefCountedPtrHash { using is_transparent = void; size_t operator()(const RefCountedPtr& p) const { return absl::Hash>{}(p); } size_t operator()(const WeakRefCountedPtr& p) const { return absl::Hash>{}(p); } size_t operator()(T* p) const { return absl::Hash{}(p); } }; template struct RefCountedPtrEq { using is_transparent = void; bool operator()(const RefCountedPtr& p1, const RefCountedPtr& p2) const { return p1 == p2; } bool operator()(const WeakRefCountedPtr& p1, const WeakRefCountedPtr& p2) const { return p1 == p2; } bool operator()(const RefCountedPtr& p1, const WeakRefCountedPtr& p2) const { return p1 == p2.get(); } bool operator()(const WeakRefCountedPtr& p1, const RefCountedPtr& p2) const { return p1 == p2.get(); } bool operator()(const RefCountedPtr& p1, const T* p2) const { return p1 == p2; } bool operator()(const WeakRefCountedPtr& p1, const T* p2) const { return p1 == p2; } bool operator()(const T* p1, const RefCountedPtr& p2) const { return p2 == p1; } bool operator()(const T* p1, const WeakRefCountedPtr& p2) const { return p2 == p1; } }; } // namespace grpc_core #endif // GRPC_SRC_CORE_UTIL_REF_COUNTED_PTR_H