grpc 1.30.2 → 1.32.0

data/src/core/lib/security/transport/target_authority_table.h

@@ -1,40 +0,0 @@
-/*
- *
- * 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_CORE_LIB_SECURITY_TRANSPORT_TARGET_AUTHORITY_TABLE_H
-#define GRPC_CORE_LIB_SECURITY_TRANSPORT_TARGET_AUTHORITY_TABLE_H
-
-#include <grpc/support/port_platform.h>
-
-#include "src/core/lib/slice/slice_hash_table.h"
-
-namespace grpc_core {
-
-/// A hash table mapping target addresses to authorities.
-typedef SliceHashTable<grpc_core::UniquePtr<char>> TargetAuthorityTable;
-
-/// Returns a channel argument containing \a table.
-grpc_arg CreateTargetAuthorityTableChannelArg(TargetAuthorityTable* table);
-
-/// Returns the target authority table from \a args or nullptr.
-TargetAuthorityTable* FindTargetAuthorityTableInArgs(
-    const grpc_channel_args* args);
-
-}  // namespace grpc_core
-
-#endif /* GRPC_CORE_LIB_SECURITY_TRANSPORT_TARGET_AUTHORITY_TABLE_H */

data/src/core/lib/slice/slice_hash_table.h

@@ -1,199 +0,0 @@
-/*
- * Copyright 2016 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_SLICE_SLICE_HASH_TABLE_H
-#define GRPC_CORE_LIB_SLICE_SLICE_HASH_TABLE_H
-
-#include <grpc/support/port_platform.h>
-
-#include <string.h>
-
-#include <grpc/support/alloc.h>
-#include <grpc/support/log.h>
-
-#include "src/core/lib/gpr/useful.h"
-#include "src/core/lib/gprpp/memory.h"
-#include "src/core/lib/gprpp/ref_counted.h"
-#include "src/core/lib/gprpp/ref_counted_ptr.h"
-#include "src/core/lib/slice/slice_internal.h"
-
-/// Hash table implementation.
-///
-/// This implementation uses open addressing
-/// (https://en.wikipedia.org/wiki/Open_addressing) with linear
-/// probing (https://en.wikipedia.org/wiki/Linear_probing).
-///
-/// The keys are \a grpc_slice objects.  The values can be any type.
-///
-/// Hash tables are intentionally immutable, to avoid the need for locking.
-
-namespace grpc_core {
-
-template <typename T>
-class SliceHashTable : public RefCounted<SliceHashTable<T>> {
- public:
-  struct Entry {
-    grpc_slice key;
-    T value;
-    bool is_set;
-  };
-
-  // Function for comparing values.
-  // TODO(roth): Eliminate this and the Cmp() method from this API once
-  // grpc_channel_args is redesigned to require that keys are unique.
-  typedef int (*ValueCmp)(const T&, const T&);
-
-  /// Creates a new hash table containing \a entries, which is an array
-  /// of length \a num_entries.  Takes ownership of all keys and values in \a
-  /// entries.  If not null, \a value_cmp will be used to compare values in
-  /// the context of \a Cmp(). If null, raw pointer (\a GPR_ICMP) comparison
-  /// will be used.
-  static RefCountedPtr<SliceHashTable> Create(size_t num_entries,
-                                              Entry* entries,
-                                              ValueCmp value_cmp);
-
-  // Use Create function instead of using this directly.
-  SliceHashTable(size_t num_entries, Entry* entries, ValueCmp value_cmp);
-  virtual ~SliceHashTable();
-
-  /// Returns the value from the table associated with \a key.
-  /// Returns null if \a key is not found.
-  const T* Get(const grpc_slice& key) const;
-
-  /// Compares \a a vs. \a b.
-  /// A table is considered "smaller" (resp. "greater") if:
-  ///  - GPR_ICMP(a->value_cmp, b->value_cmp) < 1 (resp. > 1),
-  ///  - else, it contains fewer (resp. more) entries,
-  ///  - else, if strcmp(a_key, b_key) < 1 (resp. > 1),
-  ///  - else, if value_cmp(a_value, b_value) < 1 (resp. > 1).
-  static int Cmp(const SliceHashTable& a, const SliceHashTable& b);
-
- private:
-  void Add(const grpc_slice& key, T& value);
-
-  // Default value comparison function, if none specified by caller.
-  static int DefaultValueCmp(const T& a, const T& b) { return GPR_ICMP(a, b); }
-
-  const ValueCmp value_cmp_;
-  const size_t size_;
-  size_t max_num_probes_;
-  Entry* entries_;
-};
-
-//
-// implementation -- no user-serviceable parts below
-//
-
-template <typename T>
-RefCountedPtr<SliceHashTable<T>> SliceHashTable<T>::Create(size_t num_entries,
-                                                           Entry* entries,
-                                                           ValueCmp value_cmp) {
-  return MakeRefCounted<SliceHashTable<T>>(num_entries, entries, value_cmp);
-}
-
-template <typename T>
-SliceHashTable<T>::SliceHashTable(size_t num_entries, Entry* entries,
-                                  ValueCmp value_cmp)
-    : value_cmp_(value_cmp),
-      // Keep load factor low to improve performance of lookups.
-      size_(num_entries * 2),
-      max_num_probes_(0) {
-  entries_ = static_cast<Entry*>(gpr_zalloc(sizeof(Entry) * size_));
-  for (size_t i = 0; i < num_entries; ++i) {
-    Entry* entry = &entries[i];
-    Add(entry->key, entry->value);
-  }
-}
-
-template <typename T>
-SliceHashTable<T>::~SliceHashTable() {
-  for (size_t i = 0; i < size_; ++i) {
-    Entry& entry = entries_[i];
-    if (entry.is_set) {
-      grpc_slice_unref_internal(entry.key);
-      entry.value.~T();
-    }
-  }
-  gpr_free(entries_);
-}
-
-template <typename T>
-void SliceHashTable<T>::Add(const grpc_slice& key, T& value) {
-  const size_t hash = grpc_slice_hash_internal(key);
-  for (size_t offset = 0; offset < size_; ++offset) {
-    const size_t idx = (hash + offset) % size_;
-    if (!entries_[idx].is_set) {
-      entries_[idx].is_set = true;
-      entries_[idx].key = key;
-      entries_[idx].value = std::move(value);
-      // Keep track of the maximum number of probes needed, since this
-      // provides an upper bound for lookups.
-      if (offset > max_num_probes_) max_num_probes_ = offset;
-      return;
-    }
-  }
-  GPR_ASSERT(false);  // Table should never be full.
-}
-
-template <typename T>
-const T* SliceHashTable<T>::Get(const grpc_slice& key) const {
-  const size_t hash = grpc_slice_hash_internal(key);
-  // We cap the number of probes at the max number recorded when
-  // populating the table.
-  for (size_t offset = 0; offset <= max_num_probes_; ++offset) {
-    const size_t idx = (hash + offset) % size_;
-    if (!entries_[idx].is_set) break;
-    if (grpc_slice_eq(entries_[idx].key, key)) {
-      return &entries_[idx].value;
-    }
-  }
-  return nullptr;  // Not found.
-}
-
-template <typename T>
-int SliceHashTable<T>::Cmp(const SliceHashTable& a, const SliceHashTable& b) {
-  ValueCmp value_cmp_a =
-      a.value_cmp_ != nullptr ? a.value_cmp_ : DefaultValueCmp;
-  ValueCmp value_cmp_b =
-      b.value_cmp_ != nullptr ? b.value_cmp_ : DefaultValueCmp;
-  // Compare value_fns
-  const int value_fns_cmp = GPR_ICMP((void*)value_cmp_a, (void*)value_cmp_b);
-  if (value_fns_cmp != 0) return value_fns_cmp;
-  // Compare sizes
-  if (a.size_ < b.size_) return -1;
-  if (a.size_ > b.size_) return 1;
-  // Compare rows.
-  for (size_t i = 0; i < a.size_; ++i) {
-    if (!a.entries_[i].is_set) {
-      if (b.entries_[i].is_set) {
-        return -1;  // a empty but b non-empty
-      }
-      continue;  // both empty, no need to check key or value
-    } else if (!b.entries_[i].is_set) {
-      return 1;  // a non-empty but b empty
-    }
-    // neither entry is empty
-    const int key_cmp = grpc_slice_cmp(a.entries_[i].key, b.entries_[i].key);
-    if (key_cmp != 0) return key_cmp;
-    const int value_cmp = value_cmp_a(a.entries_[i].value, b.entries_[i].value);
-    if (value_cmp != 0) return value_cmp;
-  }
-  return 0;
-}
-
-}  // namespace grpc_core
-
-#endif /* GRPC_CORE_LIB_SLICE_SLICE_HASH_TABLE_H */

data/src/core/lib/slice/slice_weak_hash_table.h

@@ -1,102 +0,0 @@
-/*
- * Copyright 2016 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_SLICE_SLICE_WEAK_HASH_TABLE_H
-#define GRPC_CORE_LIB_SLICE_SLICE_WEAK_HASH_TABLE_H
-
-#include <grpc/support/port_platform.h>
-
-#include "src/core/lib/gprpp/memory.h"
-#include "src/core/lib/gprpp/ref_counted.h"
-#include "src/core/lib/gprpp/ref_counted_ptr.h"
-#include "src/core/lib/slice/slice_internal.h"
-
-/// Weak hash table implementation.
-///
-/// This entries in this table are weak: an entry may be removed at any time due
-/// to a number of reasons: memory pressure, hash collisions, etc.
-///
-/// The keys are \a grpc_slice objects. The values are of arbitrary type.
-///
-/// This class is thread unsafe. It's the caller's responsibility to ensure
-/// proper locking when accessing its methods.
-
-namespace grpc_core {
-
-template <typename T, size_t Size>
-class SliceWeakHashTable : public RefCounted<SliceWeakHashTable<T, Size>> {
- public:
-  /// Creates a new table of at most \a size entries.
-  static RefCountedPtr<SliceWeakHashTable> Create() {
-    return MakeRefCounted<SliceWeakHashTable<T, Size>>();
-  }
-
-  /// Use Create function instead of using this directly.
-  SliceWeakHashTable() = default;
-  ~SliceWeakHashTable() = default;
-
-  /// Add a mapping from \a key to \a value, taking ownership of \a key. This
-  /// operation will always succeed. It may discard older entries.
-  void Add(const grpc_slice& key, T value) {
-    const size_t idx = grpc_slice_hash_internal(key) % Size;
-    entries_[idx].Set(key, std::move(value));
-    return;
-  }
-
-  /// Returns the value from the table associated with / \a key or null if not
-  /// found.
-  const T* Get(const grpc_slice& key) const {
-    const size_t idx = grpc_slice_hash_internal(key) % Size;
-    const auto& entry = entries_[idx];
-    return grpc_slice_eq(entry.key(), key) ? entry.value() : nullptr;
-  }
-
- private:
-  /// The type of the table "rows".
-  class Entry {
-   public:
-    Entry() = default;
-    ~Entry() {
-      if (is_set_) grpc_slice_unref_internal(key_);
-    }
-    const grpc_slice& key() const { return key_; }
-
-    /// Return the entry's value, or null if unset.
-    const T* value() const {
-      if (!is_set_) return nullptr;
-      return &value_;
-    }
-
-    /// Set the \a key and \a value (which is moved) for the entry.
-    void Set(const grpc_slice& key, T&& value) {
-      if (is_set_) grpc_slice_unref_internal(key_);
-      key_ = key;
-      value_ = std::move(value);
-      is_set_ = true;
-    }
-
-   private:
-    grpc_slice key_;
-    T value_;
-    bool is_set_ = false;
-  };
-
-  Entry entries_[Size];
-};
-
-}  // namespace grpc_core
-
-#endif /* GRPC_CORE_LIB_SLICE_SLICE_WEAK_HASH_TABLE_H */

data/third_party/upb/upb/generated_util.h

@@ -1,105 +0,0 @@
-/*
-** Functions for use by generated code.  These are not public and users must
-** not call them directly.
-*/
-
-#ifndef UPB_GENERATED_UTIL_H_
-#define UPB_GENERATED_UTIL_H_
-
-#include <stdint.h>
-#include "upb/msg.h"
-
-#include "upb/port_def.inc"
-
-#define PTR_AT(msg, ofs, type) (type*)((const char*)msg + ofs)
-
-UPB_INLINE const void *_upb_array_accessor(const void *msg, size_t ofs,
-                                           size_t *size) {
-  const upb_array *arr = *PTR_AT(msg, ofs, const upb_array*);
-  if (arr) {
-    if (size) *size = arr->len;
-    return arr->data;
-  } else {
-    if (size) *size = 0;
-    return NULL;
-  }
-}
-
-UPB_INLINE void *_upb_array_mutable_accessor(void *msg, size_t ofs,
-                                             size_t *size) {
-  upb_array *arr = *PTR_AT(msg, ofs, upb_array*);
-  if (arr) {
-    if (size) *size = arr->len;
-    return arr->data;
-  } else {
-    if (size) *size = 0;
-    return NULL;
-  }
-}
-
-/* TODO(haberman): this is a mess.  It will improve when upb_array no longer
- * carries reflective state (type, elem_size). */
-UPB_INLINE void *_upb_array_resize_accessor(void *msg, size_t ofs, size_t size,
-                                            size_t elem_size,
-                                            upb_fieldtype_t type,
-                                            upb_arena *arena) {
-  upb_array *arr = *PTR_AT(msg, ofs, upb_array*);
-
-  if (!arr) {
-    arr = upb_array_new(arena);
-    if (!arr) return NULL;
-    *PTR_AT(msg, ofs, upb_array*) = arr;
-  }
-
-  if (size > arr->size) {
-    size_t new_size = UPB_MAX(arr->size, 4);
-    size_t old_bytes = arr->size * elem_size;
-    size_t new_bytes;
-    while (new_size < size) new_size *= 2;
-    new_bytes = new_size * elem_size;
-    arr->data = upb_arena_realloc(arena, arr->data, old_bytes, new_bytes);
-    if (!arr->data) {
-      return NULL;
-    }
-    arr->size = new_size;
-  }
-
-  arr->len = size;
-  return arr->data;
-}
-
-UPB_INLINE bool _upb_array_append_accessor(void *msg, size_t ofs,
-                                           size_t elem_size,
-                                           upb_fieldtype_t type,
-                                           const void *value,
-                                           upb_arena *arena) {
-  upb_array *arr = *PTR_AT(msg, ofs, upb_array*);
-  size_t i = arr ? arr->len : 0;
-  void *data =
-      _upb_array_resize_accessor(msg, ofs, i + 1, elem_size, type, arena);
-  if (!data) return false;
-  memcpy(PTR_AT(data, i * elem_size, char), value, elem_size);
-  return true;
-}
-
-UPB_INLINE bool _upb_has_field(const void *msg, size_t idx) {
-  return (*PTR_AT(msg, idx / 8, const char) & (1 << (idx % 8))) != 0;
-}
-
-UPB_INLINE bool _upb_sethas(const void *msg, size_t idx) {
-  return (*PTR_AT(msg, idx / 8, char)) |= (char)(1 << (idx % 8));
-}
-
-UPB_INLINE bool _upb_clearhas(const void *msg, size_t idx) {
-  return (*PTR_AT(msg, idx / 8, char)) &= (char)(~(1 << (idx % 8)));
-}
-
-UPB_INLINE bool _upb_has_oneof_field(const void *msg, size_t case_ofs, int32_t num) {
-  return *PTR_AT(msg, case_ofs, int32_t) == num;
-}
-
-#undef PTR_AT
-
-#include "upb/port_undef.inc"
-
-#endif  /* UPB_GENERATED_UTIL_H_ */