1 files changed, 0 insertions, 237 deletions
diff --git a/src/libs/3rdparty/botan/src/lib/math/bigint/big_ops3.cpp b/src/libs/3rdparty/botan/src/lib/math/bigint/big_ops3.cpp
deleted file mode 100644
index 3f34e0bf15..0000000000
--- a/src/libs/3rdparty/botan/src/lib/math/bigint/big_ops3.cpp
+++ /dev/null
@@ -1,237 +0,0 @@
-/*
-* BigInt Binary Operators
-* (C) 1999-2007 Jack Lloyd
-*     2016 Matthias Gierlings
-*
-* Botan is released under the Simplified BSD License (see license.txt)
-*/
-
-#include <botan/bigint.h>
-#include <botan/divide.h>
-#include <botan/internal/mp_core.h>
-#include <botan/internal/bit_ops.h>
-#include <algorithm>
-
-namespace Botan {
-
-namespace {
-
-BigInt bigint_add(const BigInt& x, const word y[], size_t y_sw, BigInt::Sign y_sign)
-   {
-   const size_t x_sw = x.sig_words();
-
-   BigInt z(x.sign(), std::max(x_sw, y_sw) + 1);
-
-   if(x.sign() == y_sign)
-      bigint_add3(z.mutable_data(), x.data(), x_sw, y, y_sw);
-   else
-      {
-      int32_t relative_size = bigint_cmp(x.data(), x_sw, y, y_sw);
-
-      if(relative_size < 0)
-         {
-         bigint_sub3(z.mutable_data(), y, y_sw, x.data(), x_sw);
-         z.set_sign(y_sign);
-         }
-      else if(relative_size == 0)
-         z.set_sign(BigInt::Positive);
-      else if(relative_size > 0)
-         bigint_sub3(z.mutable_data(), x.data(), x_sw, y, y_sw);
-      }
-
-   return z;
-   }
-
-BigInt bigint_sub(const BigInt& x, const word y[], size_t y_sw, BigInt::Sign y_sign)
-   {
-   const size_t x_sw = x.sig_words();
-
-   int32_t relative_size = bigint_cmp(x.data(), x_sw, y, y_sw);
-
-   BigInt z(BigInt::Positive, std::max(x_sw, y_sw) + 1);
-
-   if(relative_size < 0)
-      {
-      if(x.sign() == y_sign)
-         bigint_sub3(z.mutable_data(), y, y_sw, x.data(), x_sw);
-      else
-         bigint_add3(z.mutable_data(), x.data(), x_sw, y, y_sw);
-      z.set_sign(y_sign == BigInt::Positive ? BigInt::Negative : BigInt::Positive);
-      }
-   else if(relative_size == 0)
-      {
-      if(x.sign() != y_sign)
-         bigint_shl2(z.mutable_data(), x.data(), x_sw, 0, 1);
-      z.set_sign(y_sign == BigInt::Positive ? BigInt::Negative : BigInt::Positive);
-      }
-   else if(relative_size > 0)
-      {
-      if(x.sign() == y_sign)
-         bigint_sub3(z.mutable_data(), x.data(), x_sw, y, y_sw);
-      else
-         bigint_add3(z.mutable_data(), x.data(), x_sw, y, y_sw);
-      z.set_sign(x.sign());
-      }
-   return z;
-   }
-
-}
-
-BigInt operator+(const BigInt& x, const BigInt& y)
-   {
-   return bigint_add(x, y.data(), y.sig_words(), y.sign());
-   }
-
-BigInt operator+(const BigInt& x, word y)
-   {
-   return bigint_add(x, &y, 1, BigInt::Positive);
-   }
-
-BigInt operator-(const BigInt& x, const BigInt& y)
-   {
-   return bigint_sub(x, y.data(), y.sig_words(), y.sign());
-   }
-
-BigInt operator-(const BigInt& x, word y)
-   {
-   return bigint_sub(x, &y, 1, BigInt::Positive);
-   }
-
-/*
-* Multiplication Operator
-*/
-BigInt operator*(const BigInt& x, const BigInt& y)
-   {
-   const size_t x_sw = x.sig_words(), y_sw = y.sig_words();
-
-   BigInt z(BigInt::Positive, x.size() + y.size());
-
-   if(x_sw == 1 && y_sw)
-      bigint_linmul3(z.mutable_data(), y.data(), y_sw, x.word_at(0));
-   else if(y_sw == 1 && x_sw)
-      bigint_linmul3(z.mutable_data(), x.data(), x_sw, y.word_at(0));
-   else if(x_sw && y_sw)
-      {
-      secure_vector<word> workspace(z.size());
-
-      bigint_mul(z.mutable_data(), z.size(),
-                 x.data(), x.size(), x_sw,
-                 y.data(), y.size(), y_sw,
-                 workspace.data(), workspace.size());
-      }
-
-   if(x_sw && y_sw && x.sign() != y.sign())
-      z.flip_sign();
-   return z;
-   }
-
-/*
-* Multiplication Operator
-*/
-BigInt operator*(const BigInt& x, word y)
-   {
-   const size_t x_sw = x.sig_words();
-
-   BigInt z(BigInt::Positive, x_sw + 1);
-
-   if(x_sw && y)
-      {
-      bigint_linmul3(z.mutable_data(), x.data(), x_sw, y);
-      z.set_sign(x.sign());
-      }
-
-   return z;
-   }
-
-/*
-* Division Operator
-*/
-BigInt operator/(const BigInt& x, const BigInt& y)
-   {
-   if(y.sig_words() == 1 && is_power_of_2(y.word_at(0)))
-      return (x >> (y.bits() - 1));
-
-   BigInt q, r;
-   divide(x, y, q, r);
-   return q;
-   }
-
-/*
-* Modulo Operator
-*/
-BigInt operator%(const BigInt& n, const BigInt& mod)
-   {
-   if(mod.is_zero())
-      throw BigInt::DivideByZero();
-   if(mod.is_negative())
-      throw Invalid_Argument("BigInt::operator%: modulus must be > 0");
-   if(n.is_positive() && mod.is_positive() && n < mod)
-      return n;
-
-   BigInt q, r;
-   divide(n, mod, q, r);
-   return r;
-   }
-
-/*
-* Modulo Operator
-*/
-word operator%(const BigInt& n, word mod)
-   {
-   if(mod == 0)
-      throw BigInt::DivideByZero();
-
-   if(mod == 1)
-      return 0;
-
-   if(is_power_of_2(mod))
-      return (n.word_at(0) & (mod - 1));
-
-   word remainder = 0;
-
-   for(size_t j = n.sig_words(); j > 0; --j)
-      remainder = bigint_modop(remainder, n.word_at(j-1), mod);
-
-   if(remainder && n.sign() == BigInt::Negative)
-      return mod - remainder;
-   return remainder;
-   }
-
-/*
-* Left Shift Operator
-*/
-BigInt operator<<(const BigInt& x, size_t shift)
-   {
-   if(shift == 0)
-      return x;
-
-   const size_t shift_words = shift / BOTAN_MP_WORD_BITS,
-                shift_bits  = shift % BOTAN_MP_WORD_BITS;
-
-   const size_t x_sw = x.sig_words();
-
-   BigInt y(x.sign(), x_sw + shift_words + (shift_bits ? 1 : 0));
-   bigint_shl2(y.mutable_data(), x.data(), x_sw, shift_words, shift_bits);
-   return y;
-   }
-
-/*
-* Right Shift Operator
-*/
-BigInt operator>>(const BigInt& x, size_t shift)
-   {
-   if(shift == 0)
-      return x;
-   if(x.bits() <= shift)
-      return 0;
-
-   const size_t shift_words = shift / BOTAN_MP_WORD_BITS,
-                shift_bits  = shift % BOTAN_MP_WORD_BITS,
-                x_sw = x.sig_words();
-
-   BigInt y(x.sign(), x_sw - shift_words);
-   bigint_shr2(y.mutable_data(), x.data(), x_sw, shift_words, shift_bits);
-   return y;
-   }
-
-}