grpc 1.71.0 → 1.74.0

data/src/core/lib/promise/map.h

@@ -102,8 +102,34 @@ class FusedFns {
 }  // namespace promise_detail
 
 // Mapping combinator.
-// Takes a promise, and a synchronous function to mutate its result, and
-// returns a promise.
+//
+// Input:
+// 1. The first argument is a promise.
+// 2. The second argument is a synchronous function.
+// 3. The synchronous function MUST be callable with the result type of the
+// promise.
+// 4. If the promise returns void, the synchronous function MUST be callable
+// with Empty.
+//
+// Return:
+// Mapping combinator returns Poll<T> where T is the return type of the
+// synchronous function.
+// Note: If the synchronous function returns void, the result type of the
+// mapping combinator will be Poll<Empty>.
+//
+// Polling the mapping combinator works as follows:
+// 1. Poll the promise.
+// 2. If the promise is pending, return Pending{}.
+// 3. If the promise is ready, return the result of the synchronous function.
+// Note: If the first argument to the Map is a promise factory instead of a
+// promise, Map will pass the promise returned by the promise factory as a
+// parameter to the synchronous function.
+//
+// Example:
+// TEST(MapTest, Works) {
+//   Promise<int> x = Map([]() { return 42; }, [](int i) { return i / 2; });
+//   EXPECT_THAT(x(), IsReady(21));
+// }
 template <typename Promise, typename Fn>
 class Map {
   using PromiseType = promise_detail::PromiseLike<Promise>;
@@ -130,6 +156,18 @@ class Map {
     return Pending();
   }
 
+  void ToProto(grpc_channelz_v2_Promise* promise_proto,
+               upb_Arena* arena) const {
+    auto* map_promise =
+        grpc_channelz_v2_Promise_mutable_map_promise(promise_proto, arena);
+    PromiseAsProto(
+        promise_,
+        grpc_channelz_v2_Promise_Map_mutable_promise(map_promise, arena),
+        arena);
+    grpc_channelz_v2_Promise_Map_set_map_fn(
+        map_promise, StdStringToUpbString(TypeName<Fn>()));
+  }
+
  private:
   template <typename SomeOtherPromise, typename SomeOtherFn>
   friend class Map;
@@ -169,6 +207,18 @@ class Map<Map<Promise, Fn0>, Fn1> {
     return Pending();
   }
 
+  void ToProto(grpc_channelz_v2_Promise* promise_proto,
+               upb_Arena* arena) const {
+    auto* map_promise =
+        grpc_channelz_v2_Promise_mutable_map_promise(promise_proto, arena);
+    PromiseAsProto(
+        promise_,
+        grpc_channelz_v2_Promise_Map_mutable_promise(map_promise, arena),
+        arena);
+    grpc_channelz_v2_Promise_Map_set_map_fn(
+        map_promise, StdStringToUpbString(TypeName<FusedFn>()));
+  }
+
  private:
   template <typename SomeOtherPromise, typename SomeOtherFn>
   friend class Map;
@@ -251,6 +301,60 @@ auto AddErrorPrefix(absl::string_view prefix, Promise promise) {
   });
 }
 
+template <typename Gen, typename Promise>
+auto AddGeneratedErrorPrefix(Gen prefix, Promise promise) {
+  return MapErrors(std::move(promise), [prefix](absl::Status status) {
+    absl::Status out(status.code(), absl::StrCat(prefix(), status.message()));
+    status.ForEachPayload(
+        [&out](absl::string_view name, const absl::Cord& value) {
+          out.SetPayload(name, value);
+        });
+    return out;
+  });
+}
+
+// Input : A promise that resolves to Type T
+// Returns : A Map promise which contains the input promise and then discards
+// the return value of the input promise. the main use case for DiscardResult is
+// when you need to pass a promise as a parameter, and it returns a status or
+// some value which cannot be discarded. If this value is not used, the compiler
+// gives an error. DiscardResult helps to discard the return value of the
+// promise.
+template <typename Promise>
+auto DiscardResult(Promise promise) {
+  return Map(std::move(promise), [](auto) {});
+}
+
+// Given a promise, and N values, return a tuple with the resolved promise
+// first, and then the N values stapled to it.
+template <typename Promise, typename... Values>
+auto Staple(Promise promise, Values&&... values) {
+  return Map(std::move(promise), [values = std::tuple(std::forward<Values>(
+                                      values)...)](auto first_value) mutable {
+    return std::tuple_cat(std::tuple(std::move(first_value)),
+                          std::move(values));
+  });
+}
+
+// Same as Staple, but assumes a StatusOr<X>, and returns X, Values.
+template <typename Promise, typename... Values>
+auto TryStaple(Promise promise, Values&&... values) {
+  return Map(
+      std::move(promise),
+      [values = std::tuple(std::forward<std::remove_reference_t<Values>>(
+           values)...)](auto first_value) mutable
+          -> absl::StatusOr<
+              std::tuple<std::remove_reference_t<decltype(*first_value)>,
+                         std::remove_reference_t<Values>...>> {
+        using FirstValueType = std::remove_reference_t<decltype(*first_value)>;
+        if (!first_value.ok()) return first_value.status();
+        return absl::StatusOr<
+            std::tuple<FirstValueType, std::remove_reference_t<Values>...>>(
+            std::tuple_cat(std::tuple<FirstValueType>(std::move(*first_value)),
+                           std::move(values)));
+      });
+}
+
 }  // namespace grpc_core
 
 #endif  // GRPC_SRC_CORE_LIB_PROMISE_MAP_H

data/src/core/lib/promise/match_promise.h

@@ -0,0 +1,103 @@
+// Copyright 2024 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_LIB_PROMISE_MATCH_PROMISE_H
+#define GRPC_SRC_CORE_LIB_PROMISE_MATCH_PROMISE_H
+
+#include <variant>
+
+#include "src/core/lib/promise/detail/promise_factory.h"
+#include "src/core/lib/promise/detail/promise_like.h"
+#include "src/core/lib/promise/detail/promise_variant.h"
+#include "src/core/util/overload.h"
+
+namespace grpc_core {
+
+namespace promise_detail {
+
+// Match Promise Combinator
+//
+// Input:
+// The first input is an std::variant<...> object.
+// The remaining inputs are either
+// 1. Promises which take one of the variant types as input parameter and return
+//    Poll<T>
+// 2. Functors that take one of the variant types as input parameter and return
+//    a Promise with return type Poll<T>
+// 3. There MUST be one input promise/functor corresponding to each type in the
+//    std::variant<...> input
+// 4. The return type of all promises must be the same.
+//
+// Returns:
+// Match promise combinator returns Poll<T>
+//
+// Polling the Match combinator works in the following way :
+// The Match combinator selects which of the input promises to execute based on
+// the value of the std::variant. Only 1 of the input promises will be executed
+// on polling the Match combinator. Like all other promises, the Match
+// combinator can be polled till it resolves.
+//
+// Example : Refer to match_promise_test.cc
+
+// This types job is to visit a supplied variant, and apply a mapping
+// Constructor from input types to promises, returning a variant full of
+// promises.
+template <typename Constructor, typename... Ts>
+struct ConstructPromiseVariantVisitor {
+  // Factory functions supplied to the top level `Match` object, wrapped by
+  // OverloadType to become overloaded members.
+  Constructor constructor;
+
+  // Helper function... only callable once.
+  // Given a value, construct a Promise Factory that accepts that value type,
+  // and uses the constructor type above to map from that type to a promise
+  // returned by the factory.
+  // We use the Promise Factory infrastructure to deal with all the common
+  // variants of factory signatures that we've found to be convenient.
+  template <typename T>
+  auto CallConstructorThenFactory(T x) {
+    OncePromiseFactory<T, Constructor> factory(std::move(constructor));
+    return factory.Make(std::move(x));
+  }
+
+  // Polling operator.
+  // Given a visited type T, construct a Promise Factory, use it, and then cast
+  // the result into a variant type that covers ALL of the possible return types
+  // given the input types listed in Ts...
+  template <typename T>
+  auto operator()(T x) -> std::variant<promise_detail::PromiseLike<
+      decltype(CallConstructorThenFactory(std::declval<Ts>()))>...> {
+    return CallConstructorThenFactory(std::move(x));
+  }
+};
+
+}  // namespace promise_detail
+
+template <typename... Fs, typename... Ts>
+auto MatchPromise(std::variant<Ts...> value, Fs... fs) {
+  // Construct a variant of promises using the factory functions fs, selected by
+  // the type held by value.
+  auto body = std::visit(
+      promise_detail::ConstructPromiseVariantVisitor<OverloadType<Fs...>,
+                                                     Ts...>{
+          OverloadType<Fs...>(std::move(fs)...)},
+      std::move(value));
+  // Wrap that in a PromiseVariant that provides the promise API on the wrapped
+  // variant.
+  return promise_detail::PromiseVariant<decltype(body)>(std::move(body));
+}
+
+}  // namespace grpc_core
+
+#endif  // GRPC_SRC_CORE_LIB_PROMISE_MATCH_PROMISE_H

data/src/core/lib/promise/mpsc.cc

@@ -0,0 +1,425 @@
+// Copyright 2025 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.
+
+#include "src/core/lib/promise/mpsc.h"
+
+#include <atomic>
+#include <cstdint>
+
+#include "absl/log/check.h"
+#include "src/core/channelz/property_list.h"
+#include "src/core/lib/promise/activity.h"
+#include "src/core/util/sync.h"
+
+namespace grpc_core::mpscpipe_detail {
+
+Mpsc::~Mpsc() { Close(false); }
+
+void Mpsc::Enqueue(Node* node) {
+  GRPC_LATENT_SEE_INNER_SCOPE("Mpsc::Enqueue");
+  auto actors = actors_.load(std::memory_order_relaxed);
+  while (true) {
+    if (actors == 0) {
+      // Queue closed - node not yet added to queue.
+      node->state_.store(1 /*ref*/ | Node::kClosedState,
+                         std::memory_order_relaxed);
+      return;
+    }
+    if (actors_.compare_exchange_weak(actors, actors + 1,
+                                      std::memory_order_relaxed)) {
+      break;
+    }
+  }
+  const auto tokens = node->tokens_;
+  if (tokens > 0 &&
+      queued_tokens_.fetch_add(tokens, std::memory_order_relaxed) + tokens >
+          max_queued_) {
+    node->waker_ = GetContext<Activity>()->MakeOwningWaker();
+    node->state_.store(2 /*refs*/ | Node::kBlockedState,
+                       std::memory_order_release);
+  } else {
+    node->state_.store(2 /*refs*/, std::memory_order_release);
+  }
+  DCHECK_EQ(node->next_.load(std::memory_order_relaxed), 0u);
+  Node* prev = head_.exchange(node, std::memory_order_acq_rel);
+  uintptr_t prev_next = prev->next_.exchange(reinterpret_cast<uintptr_t>(node),
+                                             std::memory_order_acq_rel);
+  if (1 == actors_.fetch_sub(1, std::memory_order_acq_rel)) {
+    DrainMpsc();
+  }
+  if (prev_next == 0) return;
+  DCHECK_NE(prev_next & Node::kWakerPtr, 0u);
+  Waker* waker = reinterpret_cast<Waker*>(prev_next & ~Node::kWakerPtr);
+  DCHECK_NE(waker, nullptr);
+  waker->Wakeup();
+  delete waker;
+}
+
+StatusFlag Mpsc::UnbufferedImmediateSend(Node* node) {
+  GRPC_LATENT_SEE_INNER_SCOPE("Mpsc::UnbufferedImmediateSend");
+  auto actors = actors_.load(std::memory_order_relaxed);
+  while (true) {
+    if (actors == 0) {
+      // Queue closed - node not yet added to queue.
+      delete node;
+      return Failure{};
+    }
+    if (actors_.compare_exchange_weak(actors, actors + 1,
+                                      std::memory_order_relaxed)) {
+      break;
+    }
+  }
+  queued_tokens_.fetch_add(node->tokens_, std::memory_order_relaxed);
+  node->state_.store(1, std::memory_order_relaxed);
+  Node* prev = head_.exchange(node, std::memory_order_acq_rel);
+  uintptr_t prev_next = prev->next_.exchange(reinterpret_cast<uintptr_t>(node),
+                                             std::memory_order_acq_rel);
+  if (1 == actors_.fetch_sub(1, std::memory_order_acq_rel)) {
+    DrainMpsc();
+  }
+  if (prev_next == 0) return Success{};
+  DCHECK_NE(prev_next & Node::kWakerPtr, 0u);
+  Waker* waker = reinterpret_cast<Waker*>(prev_next & ~Node::kWakerPtr);
+  DCHECK_NE(waker, nullptr);
+  waker->Wakeup();
+  delete waker;
+  return Success{};
+}
+
+channelz::PropertyList Mpsc::PollNextChannelzProperties() const {
+  return channelz::PropertyList()
+      .Set("accepted",
+           [this]() {
+             channelz::PropertyTable properties;
+             for (Node* n = accepted_head_; n != nullptr; n = n->spsc_next_) {
+               properties.AppendRow(n->ChannelzProperties());
+             }
+             return properties;
+           }())
+      .Set("closed", tail_ == nullptr)
+      .Set("queued_tokens", queued_tokens_.load(std::memory_order_relaxed))
+      .Set("active_tokens",
+           active_tokens_.load(std::memory_order_relaxed) & kActiveTokensMask)
+      .Set("active_tokens_waker_bit",
+           active_tokens_.load(std::memory_order_relaxed) &
+               kActiveTokensWakerBit)
+      .Set("active_tokens_waking_bit",
+           active_tokens_.load(std::memory_order_relaxed) &
+               kActiveTokensWakingBit);
+}
+
+Poll<ValueOrFailure<Mpsc::Node*>> Mpsc::PollNext() {
+  GRPC_LATENT_SEE_INNER_SCOPE("Mpsc::Next");
+  Node* accepted_head = accepted_head_;
+  if (accepted_head != nullptr) {
+    accepted_head_ = accepted_head->spsc_next_;
+    return accepted_head;
+  }
+  if (tail_ == nullptr) return Failure{};
+  if (!CheckActiveTokens()) return Pending{};
+  auto r = Dequeue();
+  if (r.pending()) return Pending{};
+  accepted_head = r.value();
+  DCHECK_NE(accepted_head, &stub_);
+  accepted_head->spsc_next_ = nullptr;
+  if (AcceptNode(accepted_head)) {
+    Node* accepted_tail = accepted_head;
+    while (true) {
+      Node* node = DequeueImmediate();
+      DCHECK_NE(node, &stub_);
+      if (node == nullptr) break;
+      node->spsc_next_ = nullptr;
+      accepted_tail->spsc_next_ = node;
+      accepted_tail = node;
+      if (!AcceptNode(node)) break;
+    }
+  }
+  accepted_head_ = accepted_head->spsc_next_;
+  return accepted_head;
+}
+
+bool Mpsc::AcceptNode(Node* node) {
+  GRPC_LATENT_SEE_INNER_SCOPE("Mpsc::AcceptNode");
+  DCHECK_NE(node, nullptr);
+  if (node->state_.fetch_and(255 - Node::kBlockedState,
+                             std::memory_order_relaxed) &
+      Node::kBlockedState) {
+    node->waker_.Wakeup();
+  }
+  const auto prev_active =
+      active_tokens_.fetch_add(node->tokens_, std::memory_order_relaxed);
+  return (prev_active & kActiveTokensMask) + node->tokens_ <= max_queued_;
+}
+
+bool Mpsc::CheckActiveTokens() {
+  GRPC_LATENT_SEE_INNER_SCOPE("Mpsc::CheckActiveTokens");
+  // First step: see if the active token count is lower than max_queued_.
+  // If it's not, we do not supply any nodes.
+  auto active_tokens = active_tokens_.load(std::memory_order_relaxed);
+  while (true) {
+    if ((active_tokens & kActiveTokensMask) > max_queued_) {
+      if (active_tokens & (kActiveTokensWakerBit | kActiveTokensWakingBit)) {
+        return false;
+      }
+      active_tokens_waker_ = GetContext<Activity>()->MakeNonOwningWaker();
+      if (!active_tokens_.compare_exchange_weak(
+              active_tokens, active_tokens | kActiveTokensWakerBit,
+              std::memory_order_release, std::memory_order_relaxed)) {
+        continue;
+      }
+      return false;
+    } else {
+      // Observed active tokens less than max_queued_.
+      // This must continue for the duration of this code path since it is the
+      // only incrementer.
+      return true;
+    }
+  }
+}
+
+void Mpsc::DrainMpsc() {
+  GRPC_LATENT_SEE_INNER_SCOPE("Mpsc::DrainMpsc");
+#ifndef NDEBUG
+  DCHECK(!drained);
+  drained = true;
+#endif
+  while (true) {
+    Node* node = tail_;
+    if (node == nullptr) return;
+    auto next = node->next_.load(std::memory_order_acquire);
+    if (next == 0) {
+      tail_ = nullptr;
+    } else if (next & Node::kWakerPtr) {
+      Waker* waker = reinterpret_cast<Waker*>(next & ~Node::kWakerPtr);
+      waker->Wakeup();
+      delete waker;
+      tail_ = nullptr;
+    } else {
+      tail_ = reinterpret_cast<Node*>(next);
+    }
+    if (node != &stub_) ReleaseTokensAndClose(node);
+  }
+}
+
+Poll<Mpsc::Node*> Mpsc::Dequeue() {
+  GRPC_LATENT_SEE_INNER_SCOPE("Mpsc::Dequeue");
+  Node* tail = tail_;
+  uintptr_t next = tail->next_.load(std::memory_order_acquire);
+retry_all:
+  if (tail == &stub_) {
+    if (next == 0) {
+      // List is (ephemerally) empty - create a waker so we get woken up
+      // when the queue is not empty.
+      Waker* waker = new Waker(GetContext<Activity>()->MakeNonOwningWaker());
+      if (!tail->next_.compare_exchange_weak(
+              next, reinterpret_cast<uintptr_t>(waker) | Node::kWakerPtr,
+              std::memory_order_acq_rel)) {
+        delete waker;
+        goto retry_all;
+      }
+      return Pending{};  // pending
+    }
+    if (next & Node::kWakerPtr) {
+      // null next waker => list closed
+      DCHECK_NE(next, Node::kWakerPtr);
+      // List is (ephemerally) empty - but we've already asked to be notified
+      // when non-empty.
+      return Pending{};  // pending
+    }
+    tail = reinterpret_cast<Node*>(next);
+    tail_ = tail;
+    next = tail->next_.load(std::memory_order_acquire);
+  }
+  if (next != 0 && (next & Node::kWakerPtr) == 0) {
+    tail_ = reinterpret_cast<Node*>(next);
+    return tail;
+  }
+  Node* head = head_.load(std::memory_order_acquire);
+  DCHECK_NE(head, nullptr);
+  if (tail != head) {
+    auto tail_next = tail->next_.load(std::memory_order_acquire);
+    while (true) {
+      if (tail_next != 0 && (tail_next & Node::kWakerPtr) == 0) {
+        // Finished adding, retry.
+        next = tail->next_.load(std::memory_order_acquire);
+        goto retry_all;
+      }
+      if (tail_next & Node::kWakerPtr) {
+        // null next waker => list closed
+        DCHECK_NE(tail_next, Node::kWakerPtr);
+        // Node still being added, and we've already asked to be notified.
+        return Pending{};  // pending
+      }
+      DCHECK_EQ(tail_next, 0u);
+      Waker* waker = new Waker(GetContext<Activity>()->MakeNonOwningWaker());
+      // Inform the adder we'd like to be woken up.
+      if (!tail->next_.compare_exchange_weak(
+              tail_next, reinterpret_cast<uintptr_t>(waker) | Node::kWakerPtr,
+              std::memory_order_acq_rel)) {
+        delete waker;
+        continue;
+      }
+      return Pending{};  // pending
+    }
+  }
+  // add stub to queue
+  PushStub();
+  next = tail->next_.load(std::memory_order_acquire);
+  if (next != 0 && (next & Node::kWakerPtr) == 0) {
+    tail_ = reinterpret_cast<Node*>(next);
+    return tail;
+  }
+  if (next & Node::kWakerPtr) {
+    // Node still being added, and we've already asked to be notified.
+    return Pending{};  // pending
+  }
+  DCHECK_EQ(next, 0u);
+  Waker* waker = new Waker(GetContext<Activity>()->MakeNonOwningWaker());
+  if (!tail->next_.compare_exchange_weak(
+          next, reinterpret_cast<uintptr_t>(waker) | Node::kWakerPtr,
+          std::memory_order_acq_rel)) {
+    delete waker;
+    goto retry_all;
+  }
+  return Pending{};  // pending
+}
+
+void Mpsc::PushStub() {
+  stub_.next_.store(0, std::memory_order_relaxed);
+  Node* prev = head_.exchange(&stub_, std::memory_order_acq_rel);
+  DCHECK_NE(prev, nullptr);
+  prev->next_.store(reinterpret_cast<uintptr_t>(&stub_),
+                    std::memory_order_release);
+}
+
+Mpsc::Node* Mpsc::DequeueImmediate() {
+  GRPC_LATENT_SEE_INNER_SCOPE("Mpsc::DequeueImmediate");
+  Node* tail = tail_;
+  uintptr_t next = tail->next_.load(std::memory_order_acquire);
+  if (tail == &stub_) {
+    if (next == 0) {
+      // List is (ephemerally) empty.
+      return nullptr;  // pending
+    }
+    if (next & Node::kWakerPtr) {
+      // null next waker => list closed
+      DCHECK_NE(next, Node::kWakerPtr);
+      // List is (ephemerally) empty - but we've already asked to be notified
+      // when non-empty.
+      return nullptr;  // pending
+    }
+    tail = reinterpret_cast<Node*>(next);
+    tail_ = tail;
+    next = tail->next_.load(std::memory_order_acquire);
+  }
+  if (next != 0 && (next & Node::kWakerPtr) == 0) {
+    tail_ = reinterpret_cast<Node*>(next);
+    return tail;
+  }
+  Node* head = head_.load(std::memory_order_acquire);
+  if (tail != head) {
+    return nullptr;  // pending
+  }
+  // add stub to queue
+  PushStub();
+  next = tail->next_.load(std::memory_order_acquire);
+  if (next & Node::kWakerPtr) {
+    // Node still being added, and we've already asked to be notified.
+    return nullptr;  // pending
+  }
+  if (next == 0) {
+    return nullptr;  // pending
+  }
+  tail_ = reinterpret_cast<Node*>(next);
+  return tail;
+}
+
+void Mpsc::Close(bool wake_reader) {
+  Node* accepted_head = accepted_head_;
+  while (accepted_head != nullptr) {
+    auto* next = accepted_head->spsc_next_;
+    ReleaseActiveTokens(wake_reader, accepted_head->tokens_);
+    ReleaseTokensAndClose(accepted_head);
+    accepted_head = next;
+  }
+  accepted_head_ = nullptr;
+  if (1 == actors_.fetch_sub(1, std::memory_order_acq_rel)) {
+    DrainMpsc();
+  }
+}
+
+void Mpsc::ReleaseTokens(Node* node) {
+  auto prev_queued =
+      queued_tokens_.fetch_sub(node->tokens_, std::memory_order_relaxed);
+  DCHECK_GE(prev_queued, node->tokens_);
+  ReleaseActiveTokens(true, node->tokens_);
+  node->Unref();
+}
+
+void Mpsc::ReleaseTokensAndClose(Node* node) {
+  DCHECK_NE(node, &stub_);
+  auto prev_queued =
+      queued_tokens_.fetch_sub(node->tokens_, std::memory_order_relaxed);
+  DCHECK_GE(prev_queued, node->tokens_);
+  // Called when the node has not yet been dequeued -- so we don't need to
+  // decrement active tokens_.
+  uint8_t state = node->state_.load(std::memory_order_relaxed);
+  while (true) {
+    DCHECK_EQ(state & Node::kClosedState, 0) << int(state);
+    uint8_t new_state = state;
+    new_state &= ~Node::kBlockedState;
+    new_state |= Node::kClosedState;
+    if (!node->state_.compare_exchange_weak(state, new_state,
+                                            std::memory_order_acq_rel)) {
+      continue;
+    }
+    break;
+  }
+  node->waker_.Wakeup();
+  node->Unref();
+}
+
+void Mpsc::ReleaseActiveTokens(bool wake_reader, uint64_t tokens) {
+  DCHECK_EQ(tokens & kActiveTokensMask, tokens);
+  auto prev_active =
+      active_tokens_.fetch_sub(tokens, std::memory_order_relaxed);
+  DCHECK_GE(prev_active & kActiveTokensMask, tokens);
+  while ((prev_active & kActiveTokensWakerBit) != 0 &&
+         (prev_active & kActiveTokensMask) - tokens <= max_queued_) {
+    if (active_tokens_.compare_exchange_weak(
+            prev_active,
+            (prev_active & kActiveTokensMask) | kActiveTokensWakingBit,
+            std::memory_order_acquire, std::memory_order_relaxed)) {
+      auto waker = std::move(active_tokens_waker_);
+      DCHECK(!waker.is_unwakeable());
+      auto prev = active_tokens_.fetch_and(kActiveTokensMask,
+                                           std::memory_order_release);
+      DCHECK_EQ(prev & (kActiveTokensWakerBit | kActiveTokensWakingBit),
+                kActiveTokensWakingBit)
+          << prev;
+      if (wake_reader) waker.Wakeup();
+      return;
+    }
+  }
+}
+
+channelz::PropertyList Mpsc::ChannelzProperties() const {
+  return channelz::PropertyList()
+      .Set("max_queued", max_queued_)
+      .Set("active_tokens",
+           active_tokens_.load(std::memory_order_relaxed) & kActiveTokensMask)
+      .Set("queued_tokens", queued_tokens_.load(std::memory_order_relaxed));
+}
+
+}  // namespace grpc_core::mpscpipe_detail