grpc 1.74.1 → 1.75.0.pre1

data/src/core/util/ring_buffer.h

@@ -1,122 +0,0 @@
-// 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_UTIL_RING_BUFFER_H
-#define GRPC_SRC_CORE_UTIL_RING_BUFFER_H
-
-#include <grpc/support/port_platform.h>
-
-#include <array>
-#include <cstddef>
-#include <iterator>
-#include <optional>
-
-namespace grpc_core {
-
-template <typename T, int kCapacity>
-class RingBuffer {
- public:
-  class RingBufferIterator {
-   public:
-    using iterator_category = std::forward_iterator_tag;
-    using value_type = const T;
-    using pointer = void;
-    using reference = void;
-    using difference_type = std::ptrdiff_t;
-
-    RingBufferIterator& operator++() {
-      if (--size_ <= 0) {
-        head_ = 0;
-        size_ = 0;
-        buffer_ = nullptr;
-      } else {
-        head_ = (head_ + 1) % kCapacity;
-      }
-      return *this;
-    }
-
-    RingBufferIterator operator++(int) {
-      RingBufferIterator tmp(*this);
-      operator++();
-      return tmp;
-    }
-
-    bool operator==(const RingBufferIterator& rhs) const {
-      return (buffer_ == rhs.buffer_ && head_ == rhs.head_ &&
-              size_ == rhs.size_);
-    }
-
-    bool operator!=(const RingBufferIterator& rhs) const {
-      return !operator==(rhs);
-    }
-
-    T operator*() { return buffer_->data_[head_]; }
-
-    RingBufferIterator() : buffer_(nullptr), head_(0), size_(0) {};
-    RingBufferIterator(const RingBufferIterator& other) = default;
-    explicit RingBufferIterator(const RingBuffer<T, kCapacity>* buffer)
-        : buffer_(buffer), head_(buffer->head_), size_(buffer->size_) {
-      if (!size_) {
-        buffer_ = nullptr;
-      }
-    }
-
-   private:
-    friend class RingBuffer<T, kCapacity>;
-    const RingBuffer<T, kCapacity>* buffer_;
-    int head_ = 0;
-    int size_ = 0;
-  };
-
-  RingBuffer() = default;
-
-  void Append(T data) {
-    if (size_ < kCapacity) {
-      data_[size_] = std::move(data);
-      size_++;
-    } else {
-      data_[head_] = std::move(data);
-      head_ = (head_ + 1) % kCapacity;
-    }
-  }
-
-  // Returns the data of the first element in the buffer and removes it from
-  // the buffer. If the buffer is empty, returns std::nullopt.
-  std::optional<T> PopIfNotEmpty() {
-    if (!size_) return std::nullopt;
-    T data = std::move(data_[head_]);
-    --size_;
-    head_ = (head_ + 1) % kCapacity;
-    return data;
-  }
-
-  void Clear() {
-    head_ = 0;
-    size_ = 0;
-  }
-
-  RingBufferIterator begin() const { return RingBufferIterator(this); }
-
-  RingBufferIterator end() const { return RingBufferIterator(); }
-
- private:
-  friend class RingBufferIterator;
-  std::array<T, kCapacity> data_;
-  int head_ = 0;
-  int size_ = 0;
-};
-
-}  // namespace grpc_core
-
-#endif  // GRPC_SRC_CORE_UTIL_RING_BUFFER_H

data/third_party/cares/cares/include/ares_rules.h

@@ -1,125 +0,0 @@
-#ifndef __CARES_RULES_H
-#define __CARES_RULES_H
-
-
-/* Copyright (C) 2009 - 2021 by Daniel Stenberg et al
- *
- * Permission to use, copy, modify, and distribute this software and its
- * documentation for any purpose and without fee is hereby granted, provided
- * that the above copyright notice appear in all copies and that both that
- * copyright notice and this permission notice appear in supporting
- * documentation, and that the name of M.I.T. not be used in advertising or
- * publicity pertaining to distribution of the software without specific,
- * written prior permission.  M.I.T. makes no representations about the
- * suitability of this software for any purpose.  It is provided "as is"
- * without express or implied warranty.
- */
-
-/* ================================================================ */
-/*                    COMPILE TIME SANITY CHECKS                    */
-/* ================================================================ */
-
-/*
- * NOTE 1:
- * -------
- *
- * All checks done in this file are intentionally placed in a public
- * header file which is pulled by ares.h when an application is
- * being built using an already built c-ares library. Additionally
- * this file is also included and used when building the library.
- *
- * If compilation fails on this file it is certainly sure that the
- * problem is elsewhere. It could be a problem in the ares_build.h
- * header file, or simply that you are using different compilation
- * settings than those used to build the library.
- *
- * Nothing in this file is intended to be modified or adjusted by the
- * c-ares library user nor by the c-ares library builder.
- *
- * Do not deactivate any check, these are done to make sure that the
- * library is properly built and used.
- *
- * You can find further help on the c-ares development mailing list:
- * http://lists.haxx.se/listinfo/c-ares/
- *
- * NOTE 2
- * ------
- *
- * Some of the following compile time checks are based on the fact
- * that the dimension of a constant array can not be a negative one.
- * In this way if the compile time verification fails, the compilation
- * will fail issuing an error. The error description wording is compiler
- * dependent but it will be quite similar to one of the following:
- *
- *   "negative subscript or subscript is too large"
- *   "array must have at least one element"
- *   "-1 is an illegal array size"
- *   "size of array is negative"
- *
- * If you are building an application which tries to use an already
- * built c-ares library and you are getting this kind of errors on
- * this file, it is a clear indication that there is a mismatch between
- * how the library was built and how you are trying to use it for your
- * application. Your already compiled or binary library provider is the
- * only one who can give you the details you need to properly use it.
- */
-
-/*
- * Verify that some macros are actually defined.
- */
-
-#ifndef CARES_TYPEOF_ARES_SOCKLEN_T
-#  error "CARES_TYPEOF_ARES_SOCKLEN_T definition is missing!"
-   Error Compilation_aborted_CARES_TYPEOF_ARES_SOCKLEN_T_is_missing
-#endif
-
-/*
- * Macros private to this header file.
- */
-
-#define CareschkszEQ(t, s) sizeof(t) == s ? 1 : -1
-
-#define CareschkszGE(t1, t2) sizeof(t1) >= sizeof(t2) ? 1 : -1
-
-/*
- * Verify that the size previously defined and expected for
- * ares_socklen_t is actually the same as the one reported
- * by sizeof() at compile time.
- */
-
-typedef char
-  __cares_rule_02__
-    [CareschkszEQ(ares_socklen_t, sizeof(CARES_TYPEOF_ARES_SOCKLEN_T))];
-
-/*
- * Verify at compile time that the size of ares_socklen_t as reported
- * by sizeof() is greater or equal than the one reported for int for
- * the current compilation.
- */
-
-typedef char
-  __cares_rule_03__
-    [CareschkszGE(ares_socklen_t, int)];
-
-/* ================================================================ */
-/*          EXTERNALLY AND INTERNALLY VISIBLE DEFINITIONS           */
-/* ================================================================ */
-
-/*
- * Get rid of macros private to this header file.
- */
-
-#undef CareschkszEQ
-#undef CareschkszGE
-
-/*
- * Get rid of macros not intended to exist beyond this point.
- */
-
-#undef CARES_PULL_WS2TCPIP_H
-#undef CARES_PULL_SYS_TYPES_H
-#undef CARES_PULL_SYS_SOCKET_H
-
-#undef CARES_TYPEOF_ARES_SOCKLEN_T
-
-#endif /* __CARES_RULES_H */

data/third_party/cares/cares/src/lib/ares__addrinfo2hostent.c

@@ -1,266 +0,0 @@
-/* Copyright 1998 by the Massachusetts Institute of Technology.
- * Copyright 2005 Dominick Meglio
- * Copyright (C) 2019 by Andrew Selivanov
- * Copyright (C) 2021 by Brad House
- *
- * Permission to use, copy, modify, and distribute this
- * software and its documentation for any purpose and without
- * fee is hereby granted, provided that the above copyright
- * notice appear in all copies and that both that copyright
- * notice and this permission notice appear in supporting
- * documentation, and that the name of M.I.T. not be used in
- * advertising or publicity pertaining to distribution of the
- * software without specific, written prior permission.
- * M.I.T. makes no representations about the suitability of
- * this software for any purpose.  It is provided "as is"
- * without express or implied warranty.
- */
-
-#include "ares_setup.h"
-
-#ifdef HAVE_NETINET_IN_H
-#  include <netinet/in.h>
-#endif
-#ifdef HAVE_NETDB_H
-#  include <netdb.h>
-#endif
-#ifdef HAVE_ARPA_INET_H
-#  include <arpa/inet.h>
-#endif
-
-#include "ares_nameser.h"
-
-#ifdef HAVE_STRINGS_H
-#  include <strings.h>
-#endif
-
-#ifdef HAVE_LIMITS_H
-#  include <limits.h>
-#endif
-
-#include "ares.h"
-#include "ares_dns.h"
-#include "ares_inet_net_pton.h"
-#include "ares_private.h"
-
-int ares__addrinfo2hostent(const struct ares_addrinfo *ai, int family,
-                           struct hostent **host)
-{
-  struct ares_addrinfo_node *next;
-  struct ares_addrinfo_cname *next_cname;
-  char **aliases = NULL;
-  char *addrs = NULL;
-  int naliases = 0, naddrs = 0, alias = 0, i;
-
-  if (ai == NULL || host == NULL)
-    return ARES_EBADQUERY;
-
-  *host = ares_malloc(sizeof(**host));
-  if (!(*host))
-    {
-      goto enomem;
-    }
-  memset(*host, 0, sizeof(**host));
-
-  /* Use the first node of the response as the family, since hostent can only
-   * represent one family.  We assume getaddrinfo() returned a sorted list if
-   * the user requested AF_UNSPEC. */
-  if (family == AF_UNSPEC && ai->nodes)
-    family = ai->nodes->ai_family;
-
-  next = ai->nodes;
-  while (next)
-    {
-      if(next->ai_family == family)
-        {
-          ++naddrs;
-        }
-      next = next->ai_next;
-    }
-
-  next_cname = ai->cnames;
-  while (next_cname)
-    {
-      if(next_cname->alias)
-        ++naliases;
-      next_cname = next_cname->next;
-    }
-
-  aliases = ares_malloc((naliases + 1) * sizeof(char *));
-  if (!aliases)
-    {
-      goto enomem;
-    }
-  (*host)->h_aliases = aliases;
-  memset(aliases, 0, (naliases + 1) * sizeof(char *));
-
-  if (naliases)
-    {
-      next_cname = ai->cnames;
-      while (next_cname)
-        {
-          if(next_cname->alias) {
-            aliases[alias] = ares_strdup(next_cname->alias);
-            if (!aliases[alias]) {
-              goto enomem;
-            }
-            alias++;
-          }
-          next_cname = next_cname->next;
-        }
-    }
-
-
-  (*host)->h_addr_list = ares_malloc((naddrs + 1) * sizeof(char *));
-  if (!(*host)->h_addr_list)
-    {
-      goto enomem;
-    }
-
-  memset((*host)->h_addr_list, 0, (naddrs + 1) * sizeof(char *));
-
-  if (ai->cnames)
-    {
-      (*host)->h_name = ares_strdup(ai->cnames->name);
-      if ((*host)->h_name == NULL && ai->cnames->name)
-        {
-          goto enomem;
-        }
-    }
-  else
-    {
-      (*host)->h_name = ares_strdup(ai->name);
-      if ((*host)->h_name == NULL && ai->name)
-        {
-          goto enomem;
-        }
-    }
-
-  (*host)->h_addrtype = family;
-  (*host)->h_length = (family == AF_INET)?
-     sizeof(struct in_addr):sizeof(struct ares_in6_addr);
-
-  if (naddrs)
-    {
-      addrs = ares_malloc(naddrs * (*host)->h_length);
-      if (!addrs)
-        {
-          goto enomem;
-        }
-
-      i = 0;
-      next = ai->nodes;
-      while (next)
-        {
-          if(next->ai_family == family)
-            {
-              (*host)->h_addr_list[i] = addrs + (i * (*host)->h_length);
-              if (family == AF_INET6)
-                {
-                  memcpy((*host)->h_addr_list[i],
-                     &(CARES_INADDR_CAST(struct sockaddr_in6 *, next->ai_addr)->sin6_addr),
-                     (*host)->h_length);
-                }
-              else
-                {
-                  memcpy((*host)->h_addr_list[i],
-                     &(CARES_INADDR_CAST(struct sockaddr_in *, next->ai_addr)->sin_addr),
-                     (*host)->h_length);
-                }
-              ++i;
-            }
-          next = next->ai_next;
-        }
-
-      if (i == 0)
-        {
-          ares_free(addrs);
-        }
-    }
-
-  if (naddrs == 0 && naliases == 0)
-    {
-      ares_free_hostent(*host);
-      *host = NULL;
-      return ARES_ENODATA;
-    }
-
-  return ARES_SUCCESS;
-
-enomem:
-  ares_free_hostent(*host);
-  *host = NULL;
-  return ARES_ENOMEM;
-}
-
-
-int ares__addrinfo2addrttl(const struct ares_addrinfo *ai, int family,
-                           int req_naddrttls, struct ares_addrttl *addrttls,
-                           struct ares_addr6ttl *addr6ttls, int *naddrttls)
-{
-  struct ares_addrinfo_node *next;
-  struct ares_addrinfo_cname *next_cname;
-  int cname_ttl = INT_MAX;
-
-  if (family != AF_INET && family != AF_INET6)
-    return ARES_EBADQUERY;
-
-  if (ai == NULL || naddrttls == NULL)
-    return ARES_EBADQUERY;
-
-  if (family == AF_INET && addrttls == NULL)
-    return ARES_EBADQUERY;
-
-  if (family == AF_INET6 && addr6ttls == NULL)
-    return ARES_EBADQUERY;
-
-  if (req_naddrttls == 0)
-    return ARES_EBADQUERY;
-
-  *naddrttls = 0;
-
-  next_cname = ai->cnames;
-  while (next_cname)
-    {
-      if(next_cname->ttl < cname_ttl)
-        cname_ttl = next_cname->ttl;
-      next_cname = next_cname->next;
-    }
-
-  next = ai->nodes;
-  while (next)
-    {
-      if(next->ai_family == family)
-        {
-          if (*naddrttls < req_naddrttls)
-            {
-                if (family == AF_INET6)
-                  {
-                    if(next->ai_ttl > cname_ttl)
-                      addr6ttls[*naddrttls].ttl = cname_ttl;
-                    else
-                      addr6ttls[*naddrttls].ttl = next->ai_ttl;
-
-                    memcpy(&addr6ttls[*naddrttls].ip6addr,
-                           &(CARES_INADDR_CAST(struct sockaddr_in6 *, next->ai_addr)->sin6_addr),
-                           sizeof(struct ares_in6_addr));
-                  }
-                else
-                  {
-                    if(next->ai_ttl > cname_ttl)
-                      addrttls[*naddrttls].ttl = cname_ttl;
-                    else
-                      addrttls[*naddrttls].ttl = next->ai_ttl;
-                    memcpy(&addrttls[*naddrttls].ipaddr,
-                           &(CARES_INADDR_CAST(struct sockaddr_in *, next->ai_addr)->sin_addr),
-                           sizeof(struct in_addr));
-                  }
-                (*naddrttls)++;
-             }
-        }
-      next = next->ai_next;
-    }
-
-  return ARES_SUCCESS;
-}
-