grpc 1.42.0 → 1.43.1

data/src/core/lib/avl/avl.cc

@@ -1,306 +0,0 @@
-/*
- *
- * Copyright 2015 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 <grpc/support/port_platform.h>
-
-#include "src/core/lib/avl/avl.h"
-
-#include <assert.h>
-#include <stdlib.h>
-
-#include <algorithm>
-
-#include <grpc/support/alloc.h>
-#include <grpc/support/string_util.h>
-
-grpc_avl grpc_avl_create(const grpc_avl_vtable* vtable) {
-  grpc_avl out;
-  out.vtable = vtable;
-  out.root = nullptr;
-  return out;
-}
-
-static grpc_avl_node* ref_node(grpc_avl_node* node) {
-  if (node) {
-    gpr_ref(&node->refs);
-  }
-  return node;
-}
-
-static void unref_node(const grpc_avl_vtable* vtable, grpc_avl_node* node,
-                       void* user_data) {
-  if (node == nullptr) {
-    return;
-  }
-  if (gpr_unref(&node->refs)) {
-    vtable->destroy_key(node->key, user_data);
-    vtable->destroy_value(node->value, user_data);
-    unref_node(vtable, node->left, user_data);
-    unref_node(vtable, node->right, user_data);
-    gpr_free(node);
-  }
-}
-
-static long node_height(grpc_avl_node* node) {
-  return node == nullptr ? 0 : node->height;
-}
-
-#ifndef NDEBUG
-static long calculate_height(grpc_avl_node* node) {
-  return node == nullptr ? 0
-                         : 1 + std::max(calculate_height(node->left),
-                                        calculate_height(node->right));
-}
-
-static grpc_avl_node* assert_invariants(grpc_avl_node* n) {
-  if (n == nullptr) return nullptr;
-  assert_invariants(n->left);
-  assert_invariants(n->right);
-  assert(calculate_height(n) == n->height);
-  assert(labs(node_height(n->left) - node_height(n->right)) <= 1);
-  return n;
-}
-#else
-static grpc_avl_node* assert_invariants(grpc_avl_node* n) { return n; }
-#endif
-
-grpc_avl_node* new_node(void* key, void* value, grpc_avl_node* left,
-                        grpc_avl_node* right) {
-  grpc_avl_node* node = static_cast<grpc_avl_node*>(gpr_malloc(sizeof(*node)));
-  gpr_ref_init(&node->refs, 1);
-  node->key = key;
-  node->value = value;
-  node->left = assert_invariants(left);
-  node->right = assert_invariants(right);
-  node->height = 1 + std::max(node_height(left), node_height(right));
-  return node;
-}
-
-static grpc_avl_node* get(const grpc_avl_vtable* vtable, grpc_avl_node* node,
-                          void* key, void* user_data) {
-  long cmp;
-
-  if (node == nullptr) {
-    return nullptr;
-  }
-
-  cmp = vtable->compare_keys(node->key, key, user_data);
-  if (cmp == 0) {
-    return node;
-  } else if (cmp > 0) {
-    return get(vtable, node->left, key, user_data);
-  } else {
-    return get(vtable, node->right, key, user_data);
-  }
-}
-
-void* grpc_avl_get(grpc_avl avl, void* key, void* user_data) {
-  grpc_avl_node* node = get(avl.vtable, avl.root, key, user_data);
-  return node ? node->value : nullptr;
-}
-
-int grpc_avl_maybe_get(grpc_avl avl, void* key, void** value, void* user_data) {
-  grpc_avl_node* node = get(avl.vtable, avl.root, key, user_data);
-  if (node != nullptr) {
-    *value = node->value;
-    return 1;
-  }
-  return 0;
-}
-
-static grpc_avl_node* rotate_left(const grpc_avl_vtable* vtable, void* key,
-                                  void* value, grpc_avl_node* left,
-                                  grpc_avl_node* right, void* user_data) {
-  grpc_avl_node* n = new_node(vtable->copy_key(right->key, user_data),
-                              vtable->copy_value(right->value, user_data),
-                              new_node(key, value, left, ref_node(right->left)),
-                              ref_node(right->right));
-  unref_node(vtable, right, user_data);
-  return n;
-}
-
-static grpc_avl_node* rotate_right(const grpc_avl_vtable* vtable, void* key,
-                                   void* value, grpc_avl_node* left,
-                                   grpc_avl_node* right, void* user_data) {
-  grpc_avl_node* n =
-      new_node(vtable->copy_key(left->key, user_data),
-               vtable->copy_value(left->value, user_data), ref_node(left->left),
-               new_node(key, value, ref_node(left->right), right));
-  unref_node(vtable, left, user_data);
-  return n;
-}
-
-static grpc_avl_node* rotate_left_right(const grpc_avl_vtable* vtable,
-                                        void* key, void* value,
-                                        grpc_avl_node* left,
-                                        grpc_avl_node* right, void* user_data) {
-  /* rotate_right(..., rotate_left(left), right) */
-  grpc_avl_node* n =
-      new_node(vtable->copy_key(left->right->key, user_data),
-               vtable->copy_value(left->right->value, user_data),
-               new_node(vtable->copy_key(left->key, user_data),
-                        vtable->copy_value(left->value, user_data),
-                        ref_node(left->left), ref_node(left->right->left)),
-               new_node(key, value, ref_node(left->right->right), right));
-  unref_node(vtable, left, user_data);
-  return n;
-}
-
-static grpc_avl_node* rotate_right_left(const grpc_avl_vtable* vtable,
-                                        void* key, void* value,
-                                        grpc_avl_node* left,
-                                        grpc_avl_node* right, void* user_data) {
-  /* rotate_left(..., left, rotate_right(right)) */
-  grpc_avl_node* n =
-      new_node(vtable->copy_key(right->left->key, user_data),
-               vtable->copy_value(right->left->value, user_data),
-               new_node(key, value, left, ref_node(right->left->left)),
-               new_node(vtable->copy_key(right->key, user_data),
-                        vtable->copy_value(right->value, user_data),
-                        ref_node(right->left->right), ref_node(right->right)));
-  unref_node(vtable, right, user_data);
-  return n;
-}
-
-static grpc_avl_node* rebalance(const grpc_avl_vtable* vtable, void* key,
-                                void* value, grpc_avl_node* left,
-                                grpc_avl_node* right, void* user_data) {
-  switch (node_height(left) - node_height(right)) {
-    case 2:
-      if (node_height(left->left) - node_height(left->right) == -1) {
-        return assert_invariants(
-            rotate_left_right(vtable, key, value, left, right, user_data));
-      } else {
-        return assert_invariants(
-            rotate_right(vtable, key, value, left, right, user_data));
-      }
-    case -2:
-      if (node_height(right->left) - node_height(right->right) == 1) {
-        return assert_invariants(
-            rotate_right_left(vtable, key, value, left, right, user_data));
-      } else {
-        return assert_invariants(
-            rotate_left(vtable, key, value, left, right, user_data));
-      }
-    default:
-      return assert_invariants(new_node(key, value, left, right));
-  }
-}
-
-static grpc_avl_node* add_key(const grpc_avl_vtable* vtable,
-                              grpc_avl_node* node, void* key, void* value,
-                              void* user_data) {
-  long cmp;
-  if (node == nullptr) {
-    return new_node(key, value, nullptr, nullptr);
-  }
-  cmp = vtable->compare_keys(node->key, key, user_data);
-  if (cmp == 0) {
-    return new_node(key, value, ref_node(node->left), ref_node(node->right));
-  } else if (cmp > 0) {
-    return rebalance(vtable, vtable->copy_key(node->key, user_data),
-                     vtable->copy_value(node->value, user_data),
-                     add_key(vtable, node->left, key, value, user_data),
-                     ref_node(node->right), user_data);
-  } else {
-    return rebalance(
-        vtable, vtable->copy_key(node->key, user_data),
-        vtable->copy_value(node->value, user_data), ref_node(node->left),
-        add_key(vtable, node->right, key, value, user_data), user_data);
-  }
-}
-
-grpc_avl grpc_avl_add(grpc_avl avl, void* key, void* value, void* user_data) {
-  grpc_avl_node* old_root = avl.root;
-  avl.root = add_key(avl.vtable, avl.root, key, value, user_data);
-  assert_invariants(avl.root);
-  unref_node(avl.vtable, old_root, user_data);
-  return avl;
-}
-
-static grpc_avl_node* in_order_head(grpc_avl_node* node) {
-  while (node->left != nullptr) {
-    node = node->left;
-  }
-  return node;
-}
-
-static grpc_avl_node* in_order_tail(grpc_avl_node* node) {
-  while (node->right != nullptr) {
-    node = node->right;
-  }
-  return node;
-}
-
-static grpc_avl_node* remove_key(const grpc_avl_vtable* vtable,
-                                 grpc_avl_node* node, void* key,
-                                 void* user_data) {
-  long cmp;
-  if (node == nullptr) {
-    return nullptr;
-  }
-  cmp = vtable->compare_keys(node->key, key, user_data);
-  if (cmp == 0) {
-    if (node->left == nullptr) {
-      return ref_node(node->right);
-    } else if (node->right == nullptr) {
-      return ref_node(node->left);
-    } else if (node->left->height < node->right->height) {
-      grpc_avl_node* h = in_order_head(node->right);
-      return rebalance(
-          vtable, vtable->copy_key(h->key, user_data),
-          vtable->copy_value(h->value, user_data), ref_node(node->left),
-          remove_key(vtable, node->right, h->key, user_data), user_data);
-    } else {
-      grpc_avl_node* h = in_order_tail(node->left);
-      return rebalance(vtable, vtable->copy_key(h->key, user_data),
-                       vtable->copy_value(h->value, user_data),
-                       remove_key(vtable, node->left, h->key, user_data),
-                       ref_node(node->right), user_data);
-    }
-  } else if (cmp > 0) {
-    return rebalance(vtable, vtable->copy_key(node->key, user_data),
-                     vtable->copy_value(node->value, user_data),
-                     remove_key(vtable, node->left, key, user_data),
-                     ref_node(node->right), user_data);
-  } else {
-    return rebalance(
-        vtable, vtable->copy_key(node->key, user_data),
-        vtable->copy_value(node->value, user_data), ref_node(node->left),
-        remove_key(vtable, node->right, key, user_data), user_data);
-  }
-}
-
-grpc_avl grpc_avl_remove(grpc_avl avl, void* key, void* user_data) {
-  grpc_avl_node* old_root = avl.root;
-  avl.root = remove_key(avl.vtable, avl.root, key, user_data);
-  assert_invariants(avl.root);
-  unref_node(avl.vtable, old_root, user_data);
-  return avl;
-}
-
-grpc_avl grpc_avl_ref(grpc_avl avl, void* /*user_data*/) {
-  ref_node(avl.root);
-  return avl;
-}
-
-void grpc_avl_unref(grpc_avl avl, void* user_data) {
-  unref_node(avl.vtable, avl.root, user_data);
-}
-
-int grpc_avl_is_empty(grpc_avl avl) { return avl.root == nullptr; }

data/src/core/lib/gprpp/match.h

@@ -1,73 +0,0 @@
-// Copyright 2021 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_CORE_LIB_GPRPP_MATCH_H
-#define GRPC_CORE_LIB_GPRPP_MATCH_H
-
-#include <grpc/support/port_platform.h>
-
-#include "absl/types/variant.h"
-
-#include "src/core/lib/gprpp/overload.h"
-
-namespace grpc_core {
-
-namespace detail {
-
-template <typename... Cases>
-struct MatchPointerExtractor {
-  OverloadType<Cases...> cases;
-  template <typename T>
-  auto operator()(T& value) -> decltype(cases(&value)) {
-    return cases(&value);
-  }
-};
-
-}  // namespace detail
-
-/// Match on a variant.
-/// Given variant \a value, and a set of callables \a fs, call the appropriate
-/// callable based on the type contained in \a value.
-///
-/// Example (prints "hoorah"):
-///   variant<int, string> v = 42;
-///   Match(v,
-///         [](int i) { puts("hoorah"); },
-///         [](string s) { puts("boo"); });
-template <typename... Fs, typename T0, typename... Ts>
-auto Match(const absl::variant<T0, Ts...>& value, Fs... fs)
-    -> decltype(std::declval<OverloadType<Fs...>>()(std::declval<T0>())) {
-  return absl::visit(Overload(std::move(fs)...), value);
-}
-
-/// A version of Match that takes a mutable pointer to a variant and calls its
-/// overload callables with a mutable pointer to the current variant value.
-///
-/// Example:
-///   variant<int, string> v = 42;
-///   MatchMutable(&v,
-///                [](int* i) { *i = 1; },
-///                [](string* s) { *s = "foo"; });
-///   // v now contains 1.
-template <typename... Fs, typename T0, typename... Ts>
-auto MatchMutable(absl::variant<T0, Ts...>* value, Fs... fs)
-    -> decltype(std::declval<OverloadType<Fs...>>()(std::declval<T0*>())) {
-  return absl::visit(detail::MatchPointerExtractor<Fs...>{OverloadType<Fs...>(
-                         std::move(fs)...)},
-                     *value);
-}
-
-}  // namespace grpc_core
-
-#endif  // GRPC_CORE_LIB_GPRPP_MATCH_H

data/src/core/lib/gprpp/overload.h

@@ -1,59 +0,0 @@
-// Copyright 2021 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_CORE_LIB_GPRPP_OVERLOAD_H
-#define GRPC_CORE_LIB_GPRPP_OVERLOAD_H
-
-#include <grpc/support/port_platform.h>
-
-#include <utility>
-
-namespace grpc_core {
-
-template <typename... Cases>
-struct OverloadType;
-// Compose one overload with N more -- use inheritance to leverage using and the
-// empty base class optimization.
-template <typename Case, typename... Cases>
-struct OverloadType<Case, Cases...> : public Case,
-                                      public OverloadType<Cases...> {
-  explicit OverloadType(Case&& c, Cases&&... cases)
-      : Case(std::forward<Case>(c)),
-        OverloadType<Cases...>(std::forward<Cases>(cases)...) {}
-  using Case::operator();
-  using OverloadType<Cases...>::operator();
-};
-// Overload of a single case is just that case itself
-template <typename Case>
-struct OverloadType<Case> : public Case {
-  explicit OverloadType(Case&& c) : Case(std::forward<Case>(c)) {}
-  using Case::operator();
-};
-
-/// Compose callables into a single callable.
-/// e.g. given [](int i) { puts("a"); } and [](double d) { puts("b"); },
-/// return a callable object like:
-/// struct {
-///   void operator()(int i) { puts("a"); }
-///   void operator()(double i) { puts("b"); }
-/// };
-/// Preserves all captures.
-template <typename... Cases>
-OverloadType<Cases...> Overload(Cases... cases) {
-  return OverloadType<Cases...>(std::move(cases)...);
-}
-
-}  // namespace grpc_core
-
-#endif  // GRPC_CORE_LIB_GPRPP_OVERLOAD_H

data/src/core/lib/iomgr/event_engine/iomgr.h

@@ -1,42 +0,0 @@
-// Copyright 2021 The 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_CORE_LIB_IOMGR_EVENT_ENGINE_IOMGR_H
-#define GRPC_CORE_LIB_IOMGR_EVENT_ENGINE_IOMGR_H
-#include <grpc/support/port_platform.h>
-
-#include <grpc/event_engine/event_engine.h>
-
-/// This can be called anywhere in the EventEngine-based iomgr impl where we
-/// need to access the global EventEngine instance.
-grpc_event_engine::experimental::EventEngine* grpc_iomgr_event_engine();
-
-namespace grpc_core {
-
-/// Set the default \a EventEngine.
-///
-/// The iomgr interfaces conceptually expose a global singleton iomgr instance
-/// that is shared throughout gRPC. To accomodate an EventEngine-based iomgr
-/// implementation, this method sets the default EventEngine that will be used.
-/// The default EventEngine can only be set once during the lifetime of gRPC.
-/// This method must be called before \a grpc_init() (truly, before
-/// \a grpc_iomgr_init()). This engine is shut down along with iomgr.
-///
-/// This is an internal method, not intended for public use. Public APIs are
-/// being planned.
-void SetDefaultEventEngine(
-    std::unique_ptr<grpc_event_engine::experimental::EventEngine> event_engine);
-
-}  // namespace grpc_core
-
-#endif  // GRPC_CORE_LIB_IOMGR_EVENT_ENGINE_IOMGR_H