Merge commit '86cc97e55fe346502462284d2e636a2b3708163e' as 'Sources/OpenVPN3'

2026-04-24 00:00:05 +08:00 · 2020-02-24 14:43:11 +03:00
parent 133b3756e6 86cc97e55f
commit 32f1555929
655 changed files with 146468 additions and 0 deletions
@@ -0,0 +1,122 @@
+//    OpenVPN -- An application to securely tunnel IP networks
+//               over a single port, with support for SSL/TLS-based
+//               session authentication and key exchange,
+//               packet encryption, packet authentication, and
+//               packet compression.
+//
+//    Copyright (C) 2012-2017 OpenVPN Inc.
+//
+//    This program is free software: you can redistribute it and/or modify
+//    it under the terms of the GNU Affero General Public License Version 3
+//    as published by the Free Software Foundation.
+//
+//    This program is distributed in the hope that it will be useful,
+//    but WITHOUT ANY WARRANTY; without even the implied warranty of
+//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+//    GNU Affero General Public License for more details.
+//
+//    You should have received a copy of the GNU Affero General Public License
+//    along with this program in the COPYING file.
+//    If not, see <http://www.gnu.org/licenses/>.
+
+#ifndef OPENVPN_BUFFER_BUFLIST_H
+#define OPENVPN_BUFFER_BUFLIST_H
+
+#include <list>
+#include <utility>
+
+#include <openvpn/buffer/buffer.hpp>
+#include <openvpn/buffer/bufstr.hpp>
+
+namespace openvpn {
+
+  template <template <typename...> class COLLECTION>
+  struct BufferCollection : public COLLECTION<BufferPtr>
+  {
+    using COLLECTION<BufferPtr>::size;
+    using COLLECTION<BufferPtr>::front;
+    using COLLECTION<BufferPtr>::empty;
+    using COLLECTION<BufferPtr>::back;
+    using COLLECTION<BufferPtr>::emplace_back;
+
+    BufferPtr join(const size_t headroom,
+		   const size_t tailroom,
+		   const bool size_1_optim) const
+    {
+      // special optimization if list contains
+      // a single element that satisfies our
+      // headroom/tailroom constraints.
+      if (size_1_optim
+	  && size() == 1
+	  && front()->offset() >= headroom
+	  && front()->remaining() >= tailroom)
+	return front();
+
+      // first pass -- measure total size
+      const size_t size = join_size();
+
+      // allocate buffer
+      BufferPtr big = new BufferAllocated(size + headroom + tailroom, 0);
+      big->init_headroom(headroom);
+
+      // second pass -- copy data
+      for (auto &b : *this)
+	big->write(b->c_data(), b->size());
+
+      return big;
+    }
+
+    BufferPtr join() const
+    {
+      return join(0, 0, true);
+    }
+
+    size_t join_size() const
+    {
+      size_t size = 0;
+      for (auto &b : *this)
+	size += b->size();
+      return size;
+    }
+
+    std::string to_string() const
+    {
+      BufferPtr bp = join();
+      return buf_to_string(*bp);
+    }
+
+    BufferCollection copy() const
+    {
+      BufferCollection ret;
+      for (auto &b : *this)
+	ret.emplace_back(new BufferAllocated(*b));
+      return ret;
+    }
+
+    void put_consume(BufferAllocated& buf, const size_t tailroom = 0)
+    {
+      const size_t s = buf.size();
+      if (!s)
+	return;
+      if (!empty())
+	{
+	  // special optimization if buf data fits in
+	  // back() unused tail capacity -- if so, append
+	  // buf to existing back().
+	  BufferPtr& b = back();
+	  const size_t r = b->remaining(tailroom);
+	  if (s < r)
+	    {
+	      b->write(buf.read_alloc(s), s);
+	      return;
+	    }
+	}
+      emplace_back(new BufferAllocated(std::move(buf)));
+    }
+  };
+
+  typedef BufferCollection<std::list> BufferList;
+  typedef BufferCollection<std::vector> BufferVector;
+}
+
+#endif