// Copyright 2019 The Abseil 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 // // https://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. #include "absl/strings/internal/cordz_handle.h" #include #include "absl/base/internal/raw_logging.h" // For ABSL_RAW_CHECK namespace absl { ABSL_NAMESPACE_BEGIN namespace cord_internal { ABSL_CONST_INIT absl::Mutex CordzHandle::mutex_(absl::kConstInit); ABSL_CONST_INIT std::atomic CordzHandle::dq_tail_{nullptr}; CordzHandle::CordzHandle(bool is_snapshot) : is_snapshot_(is_snapshot) { if (is_snapshot) { MutexLock lock(&mutex_); CordzHandle* dq_tail = dq_tail_.load(std::memory_order_acquire); if (dq_tail != nullptr) { dq_prev_ = dq_tail; dq_tail->dq_next_ = this; } dq_tail_.store(this, std::memory_order_release); } } CordzHandle::~CordzHandle() { if (is_snapshot_) { std::vector to_delete; { absl::MutexLock lock(&mutex_); CordzHandle* next = dq_next_; if (dq_prev_ == nullptr) { // We were head of the queue, delete every CordzHandle until we reach // either the end of the list, or a snapshot handle. while (next && !next->is_snapshot_) { to_delete.push_back(next); next = next->dq_next_; } } else { // Another CordzHandle existed before this one, don't delete anything. dq_prev_->dq_next_ = next; } if (next) { next->dq_prev_ = dq_prev_; } else { dq_tail_.store(dq_prev_, std::memory_order_release); } } for (CordzHandle* handle : to_delete) { delete handle; } } } void CordzHandle::Delete(CordzHandle* handle) { if (handle) { if (!handle->is_snapshot_ && !UnsafeDeleteQueueEmpty()) { MutexLock lock(&mutex_); CordzHandle* dq_tail = dq_tail_.load(std::memory_order_acquire); if (dq_tail != nullptr) { handle->dq_prev_ = dq_tail; dq_tail->dq_next_ = handle; dq_tail_.store(handle, std::memory_order_release); return; } } delete handle; } } std::vector CordzHandle::DiagnosticsGetDeleteQueue() { std::vector handles; MutexLock lock(&mutex_); CordzHandle* dq_tail = dq_tail_.load(std::memory_order_acquire); for (const CordzHandle* p = dq_tail; p; p = p->dq_prev_) { handles.push_back(p); } return handles; } bool CordzHandle::DiagnosticsHandleIsSafeToInspect( const CordzHandle* handle) const { if (!is_snapshot_) return false; if (handle == nullptr) return true; if (handle->is_snapshot_) return false; bool snapshot_found = false; MutexLock lock(&mutex_); for (const CordzHandle* p = dq_tail_; p; p = p->dq_prev_) { if (p == handle) return !snapshot_found; if (p == this) snapshot_found = true; } ABSL_ASSERT(snapshot_found); // Assert that 'this' is in delete queue. return true; } std::vector CordzHandle::DiagnosticsGetSafeToInspectDeletedHandles() { std::vector handles; if (!is_snapshot()) { return handles; } MutexLock lock(&mutex_); for (const CordzHandle* p = dq_next_; p != nullptr; p = p->dq_next_) { if (!p->is_snapshot()) { handles.push_back(p); } } return handles; } } // namespace cord_internal ABSL_NAMESPACE_END } // namespace absl