_ZN5Botan17ct_expand_top_bitITkNSt3__117unsigned_integralEmEET_S2_:
   28|  5.17M|BOTAN_FORCE_INLINE constexpr T ct_expand_top_bit(T a) {
   29|  5.17M|   const T top = CT::value_barrier<T>(a >> (sizeof(T) * 8 - 1));
   30|  5.17M|   return static_cast<T>(0) - top;
   31|  5.17M|}
_ZN5Botan6chooseITkNSt3__117unsigned_integralEmEET_S2_S2_S2_:
  216|  26.8M|BOTAN_FORCE_INLINE constexpr T choose(T mask, T a, T b) {
  217|       |   //return (mask & a) | (~mask & b);
  218|  26.8M|   return (b ^ (mask & (a ^ b)));
  219|  26.8M|}
_ZN5Botan10ct_is_zeroITkNSt3__117unsigned_integralEmEET_S2_:
   37|  3.58M|BOTAN_FORCE_INLINE constexpr T ct_is_zero(T x) {
   38|  3.58M|   return ct_expand_top_bit<T>(~x & (x - 1));
   39|  3.58M|}
_ZN5Botan8high_bitITkNSt3__117unsigned_integralEmEEmT_:
   73|  6.54k|BOTAN_FORCE_INLINE constexpr size_t high_bit(T n) {
   74|  6.54k|   size_t hb = 0;
   75|       |
   76|  45.8k|   for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) {
  ------------------
  |  Branch (76:38): [True: 39.2k, False: 6.54k]
  ------------------
   77|       |      // Equivalent to: ((n >> s) == 0) ? 0 : s;
   78|  39.2k|      const size_t z = s - ct_if_is_zero_ret<T>(n >> s, s);
   79|  39.2k|      hb += z;
   80|  39.2k|      n >>= z;
   81|  39.2k|   }
   82|       |
   83|  6.54k|   hb += n;
   84|       |
   85|  6.54k|   return hb;
   86|  6.54k|}
_ZN5Botan17ct_if_is_zero_retITkNSt3__117unsigned_integralEmEEmT_m:
   45|  39.2k|BOTAN_FORCE_INLINE constexpr size_t ct_if_is_zero_ret(T x, size_t s) {
   46|       |   /*
   47|       |   Similar to `return ct_is_zero(x) & s` but has to account for possibility that
   48|       |   sizeof(T) is smaller than sizeof(size_t) which would lead to incomplete masking
   49|       |   */
   50|  39.2k|   const T a = ~x & (x - 1);
   51|  39.2k|   const size_t a_top = static_cast<size_t>(CT::value_barrier<T>(a >> (sizeof(T) * 8 - 1)));
   52|  39.2k|   const size_t mask = static_cast<size_t>(0) - a_top;
   53|  39.2k|   return mask & s;
   54|  39.2k|}
_ZN5Botan10ct_is_zeroITkNSt3__117unsigned_integralEhEET_S2_:
   37|  8.29k|BOTAN_FORCE_INLINE constexpr T ct_is_zero(T x) {
   38|  8.29k|   return ct_expand_top_bit<T>(~x & (x - 1));
   39|  8.29k|}
_ZN5Botan17ct_expand_top_bitITkNSt3__117unsigned_integralEhEET_S2_:
   28|  8.29k|BOTAN_FORCE_INLINE constexpr T ct_expand_top_bit(T a) {
   29|  8.29k|   const T top = CT::value_barrier<T>(a >> (sizeof(T) * 8 - 1));
   30|  8.29k|   return static_cast<T>(0) - top;
   31|  8.29k|}
_ZN5Botan6chooseITkNSt3__117unsigned_integralEhEET_S2_S2_S2_:
  216|  8.29k|BOTAN_FORCE_INLINE constexpr T choose(T mask, T a, T b) {
  217|       |   //return (mask & a) | (~mask & b);
  218|  8.29k|   return (b ^ (mask & (a ^ b)));
  219|  8.29k|}

_ZN5Botan13reverse_bytesITkNSt3__117unsigned_integralEmQooooooeqstT_Li1EeqstS2_Li2EeqstS2_Li4EeqstS2_Li8EEES2_S2_:
   27|  23.6k|inline constexpr T reverse_bytes(T x) {
   28|       |   if constexpr(sizeof(T) == 1) {
   29|       |      return x;
   30|       |   } else if constexpr(sizeof(T) == 2) {
   31|       |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap16)
   32|       |      return static_cast<T>(__builtin_bswap16(x));
   33|       |#else
   34|       |      return static_cast<T>((x << 8) | (x >> 8));
   35|       |#endif
   36|       |   } else if constexpr(sizeof(T) == 4) {
   37|       |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap32)
   38|       |      return static_cast<T>(__builtin_bswap32(x));
   39|       |#else
   40|       |      // MSVC at least recognizes this as a bswap
   41|       |      return static_cast<T>(((x & 0x000000FF) << 24) | ((x & 0x0000FF00) << 8) | ((x & 0x00FF0000) >> 8) |
   42|       |                            ((x & 0xFF000000) >> 24));
   43|       |#endif
   44|  23.6k|   } else if constexpr(sizeof(T) == 8) {
   45|  23.6k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap64)
   46|  23.6k|      return static_cast<T>(__builtin_bswap64(x));
   47|       |#else
   48|       |      uint32_t hi = static_cast<uint32_t>(x >> 32);
   49|       |      uint32_t lo = static_cast<uint32_t>(x);
   50|       |
   51|       |      hi = reverse_bytes(hi);
   52|       |      lo = reverse_bytes(lo);
   53|       |
   54|       |      return (static_cast<T>(lo) << 32) | hi;
   55|       |#endif
   56|  23.6k|   }
   57|  23.6k|}

_ZN5Botan2CT4MaskImE8is_equalEmm:
  442|   309k|      static constexpr Mask<T> is_equal(T x, T y) {
  443|   309k|         const T diff = value_barrier(x) ^ value_barrier(y);
  444|   309k|         return Mask<T>::is_zero(diff);
  445|   309k|      }
_ZN5Botan2CT4MaskImE5is_ltEmm:
  450|   951k|      static constexpr Mask<T> is_lt(T x, T y) {
  451|   951k|         T u = x ^ ((x ^ y) | ((x - y) ^ x));
  452|   951k|         return Mask<T>::expand_top_bit(u);
  453|   951k|      }
_ZN5Botan2CT4MaskImE14expand_top_bitEm:
  415|  1.59M|      static constexpr Mask<T> expand_top_bit(T v) { return Mask<T>(ct_expand_top_bit<T>(v)); }
_ZN5Botan2CT4MaskImEC2Em:
  637|  5.95M|      constexpr explicit Mask(T m) : m_mask(m) {}
_ZNK5Botan2CT4MaskImE6selectEmm:
  548|  26.8M|      constexpr T select(T x, T y) const { return choose(value(), x, y); }
_ZNK5Botan2CT4MaskImE5valueEv:
  630|  45.1M|      constexpr T value() const { return value_barrier<T>(m_mask); }
_ZN5Botan2CT4MaskImE7is_zeroEm:
  437|  1.67M|      static constexpr Mask<T> is_zero(T x) { return Mask<T>(ct_is_zero<T>(value_barrier<T>(x))); }
_ZN5Botan2CT8unpoisonITkNSt3__18integralEmEEvRKT_:
  112|   745k|constexpr void unpoison(const T& p) {
  113|   745k|   unpoison(&p, 1);
  114|   745k|}
_ZN5Botan2CT8unpoisonImEEvPKT_m:
   67|   791k|constexpr inline void unpoison(const T* p, size_t n) {
   68|       |#if defined(BOTAN_HAS_VALGRIND)
   69|       |   if(!std::is_constant_evaluated()) {
   70|       |      VALGRIND_MAKE_MEM_DEFINED(p, n * sizeof(T));
   71|       |   }
   72|       |#endif
   73|       |
   74|   791k|   BOTAN_UNUSED(p, n);
  ------------------
  |  |  144|   791k|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
   75|   791k|}
_ZN5Botan2CT4MaskImE6expandEm:
  392|  1.36M|      static constexpr Mask<T> expand(T v) { return ~Mask<T>::is_zero(value_barrier<T>(v)); }
_ZNK5Botan2CT4MaskImEcoEv:
  533|  2.00M|      constexpr Mask<T> operator~() const { return Mask<T>(~value()); }
_ZNK5Botan2CT4MaskImE13if_set_returnEm:
  538|  14.2M|      constexpr T if_set_return(T x) const { return value() & x; }
_ZNK5Botan2CT4MaskImE7as_boolEv:
  614|   653k|      constexpr bool as_bool() const { return unpoisoned_value() != 0; }
_ZNK5Botan2CT4MaskImE16unpoisoned_valueEv:
  598|   653k|      constexpr T unpoisoned_value() const {
  599|   653k|         T r = value();
  600|   653k|         CT::unpoison(r);
  601|   653k|         return r;
  602|   653k|      }
_ZNK5Botan2CT4MaskImE11select_maskES2_S2_:
  559|  33.7k|      Mask<T> select_mask(Mask<T> x, Mask<T> y) const { return Mask<T>(select(x.value(), y.value())); }
_ZN5Botan2CT4MaskImEoRES2_:
  510|    120|      Mask<T>& operator|=(Mask<T> o) {
  511|    120|         m_mask |= o.value();
  512|    120|         return (*this);
  513|    120|      }
_ZN5Botan2CT4MaskImEaNES2_:
  494|    460|      Mask<T>& operator&=(Mask<T> o) {
  495|    460|         m_mask &= o.value();
  496|    460|         return (*this);
  497|    460|      }
_ZNK5Botan2CT4MaskImE8select_nEPmPKmS5_m:
  565|     14|      constexpr void select_n(T output[], const T x[], const T y[], size_t len) const {
  566|     14|         const T mask = value();
  567|    254|         for(size_t i = 0; i != len; ++i) {
  ------------------
  |  Branch (567:28): [True: 240, False: 14]
  ------------------
  568|    240|            output[i] = choose(mask, x[i], y[i]);
  569|    240|         }
  570|     14|      }
_ZN5Botan2CT4MaskIhE11expand_boolEb:
  397|  8.29k|      static constexpr Mask<T> expand_bool(bool v) { return Mask<T>::expand(static_cast<T>(v)); }
_ZN5Botan2CT4MaskIhE6expandEh:
  392|  8.29k|      static constexpr Mask<T> expand(T v) { return ~Mask<T>::is_zero(value_barrier<T>(v)); }
_ZN5Botan2CT4MaskIhE7is_zeroEh:
  437|  8.29k|      static constexpr Mask<T> is_zero(T x) { return Mask<T>(ct_is_zero<T>(value_barrier<T>(x))); }
_ZN5Botan2CT4MaskIhEC2Eh:
  637|  16.5k|      constexpr explicit Mask(T m) : m_mask(m) {}
_ZNK5Botan2CT4MaskIhEcoEv:
  533|  8.29k|      constexpr Mask<T> operator~() const { return Mask<T>(~value()); }
_ZNK5Botan2CT4MaskIhE5valueEv:
  630|  16.5k|      constexpr T value() const { return value_barrier<T>(m_mask); }
_ZNK5Botan2CT4MaskIhE6selectEhh:
  548|  8.29k|      constexpr T select(T x, T y) const { return choose(value(), x, y); }
_ZN5Botan2CT4MaskImE6is_gteEmm:
  468|   642k|      static constexpr Mask<T> is_gte(T x, T y) { return ~Mask<T>::is_lt(x, y); }
_ZN5Botan2CTorENS0_4MaskImEES2_:
  528|   642k|      friend Mask<T> operator|(Mask<T> x, Mask<T> y) { return Mask<T>(x.value() | y.value()); }
_ZN5Botan2CT20conditional_copy_memImEENS0_4MaskIT_EES3_PS3_PKS3_S7_m:
  738|     14|constexpr inline Mask<T> conditional_copy_mem(T cnd, T* dest, const T* if_set, const T* if_unset, size_t elems) {
  739|     14|   const auto mask = CT::Mask<T>::expand(cnd);
  740|     14|   return CT::conditional_copy_mem(mask, dest, if_set, if_unset, elems);
  741|     14|}
_ZN5Botan2CT20conditional_copy_memImEENS0_4MaskIT_EES4_PS3_PKS3_S7_m:
  732|     14|constexpr inline Mask<T> conditional_copy_mem(Mask<T> mask, T* dest, const T* if_set, const T* if_unset, size_t elems) {
  733|     14|   mask.select_n(dest, if_set, if_unset, elems);
  734|     14|   return mask;
  735|     14|}
_ZN5Botan2CTeoENS0_4MaskImEES2_:
  523|      7|      friend Mask<T> operator^(Mask<T> x, Mask<T> y) { return Mask<T>(x.value() ^ y.value()); }

_ZN5Botan11checked_mulITkNSt3__117unsigned_integralEmEENS1_8optionalIT_EES3_S3_:
   46|  49.2k|constexpr inline std::optional<T> checked_mul(T a, T b) {
   47|       |   // Multiplication by 1U is a hack to work around C's insane
   48|       |   // integer promotion rules.
   49|       |   // https://stackoverflow.com/questions/24795651
   50|  49.2k|   const T r = (1U * a) * b;
   51|       |   // If a == 0 then the multiply certainly did not overflow
   52|       |   // Otherwise r / a == b unless overflow occurred
   53|  49.2k|   if(a != 0 && r / a != b) {
  ------------------
  |  Branch (53:7): [True: 49.2k, False: 0]
  |  Branch (53:17): [True: 0, False: 49.2k]
  ------------------
   54|      0|      return {};
   55|      0|   }
   56|  49.2k|   return r;
   57|  49.2k|}

_ZN5Botan7load_beImJNSt3__14spanIKhLm8EEEEEEDaDpOT0_:
  504|  20.9k|inline constexpr auto load_be(ParamTs&&... params) {
  505|  20.9k|   return detail::load_any<std::endian::big, OutT>(std::forward<ParamTs>(params)...);
  506|  20.9k|}
_ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_:
  278|  20.9k|inline constexpr WrappedOutT load_any(InR&& in_range) {
  279|  20.9k|   using OutT = detail::wrapped_type<WrappedOutT>;
  280|  20.9k|   ranges::assert_exact_byte_length<sizeof(OutT)>(in_range);
  281|       |
  282|  20.9k|   return detail::wrap_strong_type_or_enum<WrappedOutT>([&]() -> OutT {
  283|       |      // At compile time we cannot use `typecast_copy` as it uses `std::memcpy`
  284|       |      // internally to copy ranges on a byte-by-byte basis, which is not allowed
  285|       |      // in a `constexpr` context.
  286|  20.9k|      if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  287|  20.9k|         return fallback_load_any<endianness, OutT>(std::forward<InR>(in_range));
  288|  20.9k|      } else {
  289|  20.9k|         const std::span in{in_range};
  290|  20.9k|         if constexpr(sizeof(OutT) == 1) {
  291|  20.9k|            return static_cast<OutT>(in[0]);
  292|  20.9k|         } else if constexpr(endianness == std::endian::native) {
  293|  20.9k|            return typecast_copy<OutT>(in);
  294|  20.9k|         } else {
  295|  20.9k|            static_assert(opposite(endianness) == std::endian::native);
  296|  20.9k|            return reverse_bytes(typecast_copy<OutT>(in));
  297|  20.9k|         }
  298|  20.9k|      }
  299|  20.9k|   }());
  300|  20.9k|}
_ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEmTkNSt3__117unsigned_integralEmEEDaT0_:
  200|  23.6k|constexpr auto wrap_strong_type_or_enum(T t) {
  201|       |   if constexpr(std::is_enum_v<OutT>) {
  202|       |      return static_cast<OutT>(t);
  203|  23.6k|   } else {
  204|  23.6k|      return Botan::wrap_strong_type<OutT>(t);
  205|  23.6k|   }
  206|  23.6k|}
_ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv:
  282|  20.9k|   return detail::wrap_strong_type_or_enum<WrappedOutT>([&]() -> OutT {
  283|       |      // At compile time we cannot use `typecast_copy` as it uses `std::memcpy`
  284|       |      // internally to copy ranges on a byte-by-byte basis, which is not allowed
  285|       |      // in a `constexpr` context.
  286|  20.9k|      if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  ------------------
  |  Branch (286:10): [Folded, False: 20.9k]
  ------------------
  287|      0|         return fallback_load_any<endianness, OutT>(std::forward<InR>(in_range));
  288|  20.9k|      } else {
  289|  20.9k|         const std::span in{in_range};
  290|       |         if constexpr(sizeof(OutT) == 1) {
  291|       |            return static_cast<OutT>(in[0]);
  292|       |         } else if constexpr(endianness == std::endian::native) {
  293|       |            return typecast_copy<OutT>(in);
  294|  20.9k|         } else {
  295|  20.9k|            static_assert(opposite(endianness) == std::endian::native);
  296|  20.9k|            return reverse_bytes(typecast_copy<OutT>(in));
  297|  20.9k|         }
  298|  20.9k|      }
  299|  20.9k|   }());
_ZN5Botan7load_beImJRNSt3__15arrayIhLm8EEEEEEDaDpOT0_:
  504|  2.70k|inline constexpr auto load_be(ParamTs&&... params) {
  505|  2.70k|   return detail::load_any<std::endian::big, OutT>(std::forward<ParamTs>(params)...);
  506|  2.70k|}
_ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEERNS2_5arrayIhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_:
  278|  2.70k|inline constexpr WrappedOutT load_any(InR&& in_range) {
  279|  2.70k|   using OutT = detail::wrapped_type<WrappedOutT>;
  280|  2.70k|   ranges::assert_exact_byte_length<sizeof(OutT)>(in_range);
  281|       |
  282|  2.70k|   return detail::wrap_strong_type_or_enum<WrappedOutT>([&]() -> OutT {
  283|       |      // At compile time we cannot use `typecast_copy` as it uses `std::memcpy`
  284|       |      // internally to copy ranges on a byte-by-byte basis, which is not allowed
  285|       |      // in a `constexpr` context.
  286|  2.70k|      if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  287|  2.70k|         return fallback_load_any<endianness, OutT>(std::forward<InR>(in_range));
  288|  2.70k|      } else {
  289|  2.70k|         const std::span in{in_range};
  290|  2.70k|         if constexpr(sizeof(OutT) == 1) {
  291|  2.70k|            return static_cast<OutT>(in[0]);
  292|  2.70k|         } else if constexpr(endianness == std::endian::native) {
  293|  2.70k|            return typecast_copy<OutT>(in);
  294|  2.70k|         } else {
  295|  2.70k|            static_assert(opposite(endianness) == std::endian::native);
  296|  2.70k|            return reverse_bytes(typecast_copy<OutT>(in));
  297|  2.70k|         }
  298|  2.70k|      }
  299|  2.70k|   }());
  300|  2.70k|}
_ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEERNS2_5arrayIhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv:
  282|  2.70k|   return detail::wrap_strong_type_or_enum<WrappedOutT>([&]() -> OutT {
  283|       |      // At compile time we cannot use `typecast_copy` as it uses `std::memcpy`
  284|       |      // internally to copy ranges on a byte-by-byte basis, which is not allowed
  285|       |      // in a `constexpr` context.
  286|  2.70k|      if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  ------------------
  |  Branch (286:10): [Folded, False: 2.70k]
  ------------------
  287|      0|         return fallback_load_any<endianness, OutT>(std::forward<InR>(in_range));
  288|  2.70k|      } else {
  289|  2.70k|         const std::span in{in_range};
  290|       |         if constexpr(sizeof(OutT) == 1) {
  291|       |            return static_cast<OutT>(in[0]);
  292|       |         } else if constexpr(endianness == std::endian::native) {
  293|       |            return typecast_copy<OutT>(in);
  294|  2.70k|         } else {
  295|  2.70k|            static_assert(opposite(endianness) == std::endian::native);
  296|  2.70k|            return reverse_bytes(typecast_copy<OutT>(in));
  297|  2.70k|         }
  298|  2.70k|      }
  299|  2.70k|   }());

_ZN5Botan21unchecked_copy_memoryITkNSt3__117unsigned_integralEmEEvPT_PKS2_m:
   44|   692k|inline void unchecked_copy_memory(T* out, const T* in, size_t n) {
   45|   692k|   if(in != nullptr && out != nullptr && n > 0) {
  ------------------
  |  Branch (45:7): [True: 692k, False: 0]
  |  Branch (45:24): [True: 692k, False: 0]
  |  Branch (45:42): [True: 692k, False: 58]
  ------------------
   46|   692k|      std::memmove(out, in, sizeof(T) * n);
   47|   692k|   }
   48|   692k|}
_ZN5Botan14zeroize_bufferITkNSt3__117unsigned_integralEmEEvPT_m:
   37|   696k|inline void zeroize_buffer(T buf[], size_t n) {
   38|   696k|   if(n > 0) {
  ------------------
  |  Branch (38:7): [True: 22.0k, False: 674k]
  ------------------
   39|  22.0k|      std::memset(buf, 0, sizeof(T) * n);
   40|  22.0k|   }
   41|   696k|}

_ZN5Botan10word8_add3ITkNS_8WordTypeEmEET_PS1_PKS1_S4_S1_:
  294|    364|inline constexpr auto word8_add3(W z[8], const W x[8], const W y[8], W carry) -> W {
  295|    364|#if defined(BOTAN_MP_USE_X86_64_ASM)
  296|    364|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (296:7): [True: 0, Folded]
  |  Branch (296:36): [True: 0, Folded]
  ------------------
  297|    364|      asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "adcq"))
  298|    364|                   : [carry] "=r"(carry)
  299|    364|                   : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry)
  300|    364|                   : "cc", "memory");
  301|    364|      return carry;
  302|    364|   }
  303|      0|#endif
  304|       |
  305|      0|   z[0] = word_add(x[0], y[0], &carry);
  306|      0|   z[1] = word_add(x[1], y[1], &carry);
  307|      0|   z[2] = word_add(x[2], y[2], &carry);
  308|      0|   z[3] = word_add(x[3], y[3], &carry);
  309|      0|   z[4] = word_add(x[4], y[4], &carry);
  310|      0|   z[5] = word_add(x[5], y[5], &carry);
  311|      0|   z[6] = word_add(x[6], y[6], &carry);
  312|      0|   z[7] = word_add(x[7], y[7], &carry);
  313|      0|   return carry;
  314|    364|}
_ZN5Botan8word_addITkNS_8WordTypeEmEET_S1_S1_PS1_:
  231|  20.1k|inline constexpr auto word_add(W x, W y, W* carry) -> W {
  232|  20.1k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_addc)
  233|  20.1k|   if(!std::is_constant_evaluated()) {
  ------------------
  |  Branch (233:7): [True: 20.1k, Folded]
  ------------------
  234|       |      if constexpr(std::same_as<W, unsigned int>) {
  235|       |         return __builtin_addc(x, y, *carry & 1, carry);
  236|  20.1k|      } else if constexpr(std::same_as<W, unsigned long>) {
  237|  20.1k|         return __builtin_addcl(x, y, *carry & 1, carry);
  238|       |      } else if constexpr(std::same_as<W, unsigned long long>) {
  239|       |         return __builtin_addcll(x, y, *carry & 1, carry);
  240|       |      }
  241|  20.1k|   }
  242|      0|#endif
  243|       |
  244|       |   if constexpr(WordInfo<W>::dword_is_native && use_dword_for_word_add) {
  245|       |      /*
  246|       |      TODO(Botan4) this is largely a performance hack for GCCs that don't
  247|       |      support __builtin_addc, if we increase the minimum supported version of
  248|       |      GCC to GCC 14 then we can remove this and not worry about it
  249|       |      */
  250|       |      const W cb = *carry & 1;
  251|       |      const auto s = typename WordInfo<W>::dword(x) + y + cb;
  252|       |      *carry = static_cast<W>(s >> WordInfo<W>::bits);
  253|       |      return static_cast<W>(s);
  254|  20.1k|   } else {
  255|  20.1k|      const W cb = *carry & 1;
  256|  20.1k|      W z = x + y;
  257|  20.1k|      W c1 = (z < x);
  258|  20.1k|      z += cb;
  259|  20.1k|      *carry = c1 | (z < cb);
  260|  20.1k|      return z;
  261|  20.1k|   }
  262|  20.1k|}
_ZN5Botan10word8_sub3ITkNS_8WordTypeEmEET_PS1_PKS1_S4_S1_:
  371|  1.31M|inline constexpr auto word8_sub3(W z[8], const W x[8], const W y[8], W carry) -> W {
  372|  1.31M|#if defined(BOTAN_MP_USE_X86_64_ASM)
  373|  1.31M|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (373:7): [True: 0, Folded]
  |  Branch (373:36): [True: 0, Folded]
  ------------------
  374|  1.31M|      asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "sbbq"))
  375|  1.31M|                   : [carry] "=r"(carry)
  376|  1.31M|                   : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry)
  377|  1.31M|                   : "cc", "memory");
  378|  1.31M|      return carry;
  379|  1.31M|   }
  380|      0|#endif
  381|       |
  382|      0|   z[0] = word_sub(x[0], y[0], &carry);
  383|      0|   z[1] = word_sub(x[1], y[1], &carry);
  384|      0|   z[2] = word_sub(x[2], y[2], &carry);
  385|      0|   z[3] = word_sub(x[3], y[3], &carry);
  386|      0|   z[4] = word_sub(x[4], y[4], &carry);
  387|      0|   z[5] = word_sub(x[5], y[5], &carry);
  388|      0|   z[6] = word_sub(x[6], y[6], &carry);
  389|      0|   z[7] = word_sub(x[7], y[7], &carry);
  390|      0|   return carry;
  391|  1.31M|}
_ZN5Botan8word_subITkNS_8WordTypeEmEET_S1_S1_PS1_:
  320|  2.39M|inline constexpr auto word_sub(W x, W y, W* carry) -> W {
  321|  2.39M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_subc)
  322|  2.39M|   if(!std::is_constant_evaluated()) {
  ------------------
  |  Branch (322:7): [True: 2.39M, Folded]
  ------------------
  323|       |      if constexpr(std::same_as<W, unsigned int>) {
  324|       |         return __builtin_subc(x, y, *carry & 1, carry);
  325|  2.39M|      } else if constexpr(std::same_as<W, unsigned long>) {
  326|  2.39M|         return __builtin_subcl(x, y, *carry & 1, carry);
  327|       |      } else if constexpr(std::same_as<W, unsigned long long>) {
  328|       |         return __builtin_subcll(x, y, *carry & 1, carry);
  329|       |      }
  330|  2.39M|   }
  331|      0|#endif
  332|       |
  333|      0|   const W cb = *carry & 1;
  334|  2.39M|   W t0 = x - y;
  335|  2.39M|   W c1 = (t0 > x);
  336|  2.39M|   W z = t0 - cb;
  337|  2.39M|   *carry = c1 | (z > t0);
  338|  2.39M|   return z;
  339|  2.39M|}
_ZN5Botan13word8_linmul3ITkNS_8WordTypeEmEET_PS1_PKS1_S1_S1_:
  397|  27.3k|inline constexpr auto word8_linmul3(W z[8], const W x[8], W y, W carry) -> W {
  398|  27.3k|#if defined(BOTAN_MP_USE_X86_64_ASM)
  399|  27.3k|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (399:7): [True: 0, Folded]
  |  Branch (399:36): [True: 0, Folded]
  ------------------
  400|  27.3k|      asm(DO_8_TIMES(LINMUL_OP, "z")
  401|  27.3k|          : [carry] "=r"(carry)
  402|  27.3k|          : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry)
  403|  27.3k|          : "cc", "%rax", "%rdx", "memory");
  404|  27.3k|      return carry;
  405|  27.3k|   }
  406|      0|#endif
  407|       |
  408|      0|   z[0] = word_madd2(x[0], y, &carry);
  409|      0|   z[1] = word_madd2(x[1], y, &carry);
  410|      0|   z[2] = word_madd2(x[2], y, &carry);
  411|      0|   z[3] = word_madd2(x[3], y, &carry);
  412|      0|   z[4] = word_madd2(x[4], y, &carry);
  413|      0|   z[5] = word_madd2(x[5], y, &carry);
  414|      0|   z[6] = word_madd2(x[6], y, &carry);
  415|      0|   z[7] = word_madd2(x[7], y, &carry);
  416|      0|   return carry;
  417|  27.3k|}
_ZN5Botan10word_madd2ITkNS_8WordTypeEmEET_S1_S1_PS1_:
   90|  82.9k|inline constexpr auto word_madd2(W a, W b, W* c) -> W {
   91|  82.9k|#if defined(BOTAN_MP_USE_X86_64_ASM)
   92|  82.9k|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (92:7): [True: 0, Folded]
  |  Branch (92:36): [True: 0, Folded]
  ------------------
   93|  82.9k|      asm(R"(
   94|  82.9k|         mulq %[b]
   95|  82.9k|         addq %[c],%[a]
   96|  82.9k|         adcq $0,%[carry]
   97|  82.9k|         )"
   98|  82.9k|          : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*c)
   99|  82.9k|          : "0"(a), "1"(b), [c] "g"(*c)
  100|  82.9k|          : "cc");
  101|       |
  102|  82.9k|      return a;
  103|  82.9k|   }
  104|       |#elif defined(BOTAN_MP_USE_AARCH64_ASM)
  105|       |   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  106|       |      W lo = 0;
  107|       |      W hi = 0;
  108|       |      asm(R"(
  109|       |         mul  %[lo], %[a], %[b]
  110|       |         umulh %[hi], %[a], %[b]
  111|       |         adds %[lo], %[lo], %[c]
  112|       |         adc  %[hi], %[hi], xzr
  113|       |         )"
  114|       |          : [lo] "=&r"(lo), [hi] "=&r"(hi)
  115|       |          : [a] "r"(a), [b] "r"(b), [c] "r"(*c)
  116|       |          : "cc");
  117|       |
  118|       |      *c = hi;
  119|       |      return lo;
  120|       |   }
  121|       |#endif
  122|       |
  123|      0|   typedef typename WordInfo<W>::dword dword;
  124|      0|   const dword s = dword(a) * b + *c;
  125|      0|   *c = static_cast<W>(s >> WordInfo<W>::bits);
  126|      0|   return static_cast<W>(s);
  127|  82.9k|}
_ZN5Botan11word8_madd3ITkNS_8WordTypeEmEET_PS1_PKS1_S1_S1_:
  423|  2.33k|inline constexpr auto word8_madd3(W z[8], const W x[8], W y, W carry) -> W {
  424|  2.33k|#if defined(BOTAN_MP_USE_X86_64_ASM)
  425|  2.33k|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (425:7): [True: 0, Folded]
  |  Branch (425:36): [True: 0, Folded]
  ------------------
  426|  2.33k|      asm(DO_8_TIMES(MULADD_OP, "")
  427|  2.33k|          : [carry] "=r"(carry)
  428|  2.33k|          : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry)
  429|  2.33k|          : "cc", "%rax", "%rdx", "memory");
  430|  2.33k|      return carry;
  431|  2.33k|   }
  432|      0|#endif
  433|       |
  434|      0|   z[0] = word_madd3(x[0], y, z[0], &carry);
  435|      0|   z[1] = word_madd3(x[1], y, z[1], &carry);
  436|      0|   z[2] = word_madd3(x[2], y, z[2], &carry);
  437|      0|   z[3] = word_madd3(x[3], y, z[3], &carry);
  438|      0|   z[4] = word_madd3(x[4], y, z[4], &carry);
  439|      0|   z[5] = word_madd3(x[5], y, z[5], &carry);
  440|      0|   z[6] = word_madd3(x[6], y, z[6], &carry);
  441|      0|   z[7] = word_madd3(x[7], y, z[7], &carry);
  442|      0|   return carry;
  443|  2.33k|}
_ZN5Botan10word_madd3ITkNS_8WordTypeEmEET_S1_S1_S1_PS1_:
  133|  5.27k|inline constexpr auto word_madd3(W a, W b, W c, W* d) -> W {
  134|  5.27k|#if defined(BOTAN_MP_USE_X86_64_ASM)
  135|  5.27k|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (135:7): [True: 0, Folded]
  |  Branch (135:36): [True: 0, Folded]
  ------------------
  136|  5.27k|      asm(R"(
  137|  5.27k|         mulq %[b]
  138|  5.27k|
  139|  5.27k|         addq %[c],%[a]
  140|  5.27k|         adcq $0,%[carry]
  141|  5.27k|
  142|  5.27k|         addq %[d],%[a]
  143|  5.27k|         adcq $0,%[carry]
  144|  5.27k|         )"
  145|  5.27k|          : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*d)
  146|  5.27k|          : "0"(a), "1"(b), [c] "g"(c), [d] "g"(*d)
  147|  5.27k|          : "cc");
  148|       |
  149|  5.27k|      return a;
  150|  5.27k|   }
  151|       |#elif defined(BOTAN_MP_USE_AARCH64_ASM)
  152|       |   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  153|       |      W lo = 0;
  154|       |      W hi = 0;
  155|       |      asm(R"(
  156|       |         mul  %[lo], %[a], %[b]
  157|       |         umulh %[hi], %[a], %[b]
  158|       |         adds %[lo], %[lo], %[c]
  159|       |         adc  %[hi], %[hi], xzr
  160|       |         adds %[lo], %[lo], %[d]
  161|       |         adc  %[hi], %[hi], xzr
  162|       |         )"
  163|       |          : [lo] "=&r"(lo), [hi] "=&r"(hi)
  164|       |          : [a] "r"(a), [b] "r"(b), [c] "r"(c), [d] "r"(*d)
  165|       |          : "cc");
  166|       |
  167|       |      *d = hi;
  168|       |      return lo;
  169|       |   }
  170|       |#endif
  171|       |
  172|      0|   typedef typename WordInfo<W>::dword dword;
  173|      0|   const dword s = dword(a) * b + c + *d;
  174|      0|   *d = static_cast<W>(s >> WordInfo<W>::bits);
  175|      0|   return static_cast<W>(s);
  176|  5.27k|}
_ZN5Botan10word8_add2ITkNS_8WordTypeEmEET_PS1_PKS1_S1_:
  268|     28|inline constexpr auto word8_add2(W x[8], const W y[8], W carry) -> W {
  269|     28|#if defined(BOTAN_MP_USE_X86_64_ASM)
  270|     28|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (270:7): [True: 0, Folded]
  |  Branch (270:36): [True: 0, Folded]
  ------------------
  271|     28|      asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "adcq"))
  272|     28|                   : [carry] "=r"(carry)
  273|     28|                   : [x] "r"(x), [y] "r"(y), "0"(carry)
  274|     28|                   : "cc", "memory");
  275|     28|      return carry;
  276|     28|   }
  277|      0|#endif
  278|       |
  279|      0|   x[0] = word_add(x[0], y[0], &carry);
  280|      0|   x[1] = word_add(x[1], y[1], &carry);
  281|      0|   x[2] = word_add(x[2], y[2], &carry);
  282|      0|   x[3] = word_add(x[3], y[3], &carry);
  283|      0|   x[4] = word_add(x[4], y[4], &carry);
  284|      0|   x[5] = word_add(x[5], y[5], &carry);
  285|      0|   x[6] = word_add(x[6], y[6], &carry);
  286|      0|   x[7] = word_add(x[7], y[7], &carry);
  287|      0|   return carry;
  288|     28|}
_ZN5Botan10word8_sub2ITkNS_8WordTypeEmEET_PS1_PKS1_S1_:
  345|  26.9k|inline constexpr auto word8_sub2(W x[8], const W y[8], W carry) -> W {
  346|  26.9k|#if defined(BOTAN_MP_USE_X86_64_ASM)
  347|  26.9k|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (347:7): [True: 0, Folded]
  |  Branch (347:36): [True: 0, Folded]
  ------------------
  348|  26.9k|      asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "sbbq"))
  349|  26.9k|                   : [carry] "=r"(carry)
  350|  26.9k|                   : [x] "r"(x), [y] "r"(y), "0"(carry)
  351|  26.9k|                   : "cc", "memory");
  352|  26.9k|      return carry;
  353|  26.9k|   }
  354|      0|#endif
  355|       |
  356|      0|   x[0] = word_sub(x[0], y[0], &carry);
  357|      0|   x[1] = word_sub(x[1], y[1], &carry);
  358|      0|   x[2] = word_sub(x[2], y[2], &carry);
  359|      0|   x[3] = word_sub(x[3], y[3], &carry);
  360|      0|   x[4] = word_sub(x[4], y[4], &carry);
  361|      0|   x[5] = word_sub(x[5], y[5], &carry);
  362|      0|   x[6] = word_sub(x[6], y[6], &carry);
  363|      0|   x[7] = word_sub(x[7], y[7], &carry);
  364|      0|   return carry;
  365|  26.9k|}
_ZN5Botan5word3ImEC2Ev:
  458|    131|      constexpr word3() : m_w(0) {}
_ZN5Botan5word3ImE3mulEmm:
  460|  23.0k|      inline constexpr void mul(W x, W y) { m_w += static_cast<W3>(x) * y; }
_ZN5Botan5word3ImE7extractEv:
  466|  2.90k|      inline constexpr W extract() {
  467|  2.90k|         W r = static_cast<W>(m_w);
  468|  2.90k|         m_w >>= WordInfo<W>::bits;
  469|  2.90k|         return r;
  470|  2.90k|      }

_ZN5Botan11bigint_add3ITkNS_8WordTypeEmEET_PS1_PKS1_mS4_m:
  120|  3.98k|inline constexpr auto bigint_add3(W z[], const W x[], size_t x_size, const W y[], size_t y_size) -> W {
  121|  3.98k|   if(x_size < y_size) {
  ------------------
  |  Branch (121:7): [True: 670, False: 3.31k]
  ------------------
  122|    670|      return bigint_add3(z, y, y_size, x, x_size);
  123|    670|   }
  124|       |
  125|  3.31k|   W carry = 0;
  126|       |
  127|  3.31k|   const size_t blocks = y_size - (y_size % 8);
  128|       |
  129|  3.68k|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (129:22): [True: 364, False: 3.31k]
  ------------------
  130|    364|      carry = word8_add3(z + i, x + i, y + i, carry);
  131|    364|   }
  132|       |
  133|  6.30k|   for(size_t i = blocks; i != y_size; ++i) {
  ------------------
  |  Branch (133:27): [True: 2.99k, False: 3.31k]
  ------------------
  134|  2.99k|      z[i] = word_add(x[i], y[i], &carry);
  135|  2.99k|   }
  136|       |
  137|  19.8k|   for(size_t i = y_size; i != x_size; ++i) {
  ------------------
  |  Branch (137:27): [True: 16.5k, False: 3.31k]
  ------------------
  138|  16.5k|      z[i] = word_add(x[i], static_cast<W>(0), &carry);
  139|  16.5k|   }
  140|       |
  141|  3.31k|   return carry;
  142|  3.98k|}
_ZN5Botan10bigint_cmpITkNS_8WordTypeEmEEiPKT_mS3_m:
  439|  16.7k|inline constexpr int32_t bigint_cmp(const W x[], size_t x_size, const W y[], size_t y_size) {
  440|  16.7k|   static_assert(sizeof(W) >= sizeof(uint32_t), "Size assumption");
  441|       |
  442|  16.7k|   const W LT = static_cast<W>(-1);
  443|  16.7k|   const W EQ = 0;
  444|  16.7k|   const W GT = 1;
  445|       |
  446|  16.7k|   const size_t common_elems = std::min(x_size, y_size);
  447|       |
  448|  16.7k|   W result = EQ;  // until found otherwise
  449|       |
  450|   292k|   for(size_t i = 0; i != common_elems; i++) {
  ------------------
  |  Branch (450:22): [True: 275k, False: 16.7k]
  ------------------
  451|   275k|      const auto is_eq = CT::Mask<W>::is_equal(x[i], y[i]);
  452|   275k|      const auto is_lt = CT::Mask<W>::is_lt(x[i], y[i]);
  453|       |
  454|   275k|      result = is_eq.select(result, is_lt.select(LT, GT));
  455|   275k|   }
  456|       |
  457|  16.7k|   if(x_size < y_size) {
  ------------------
  |  Branch (457:7): [True: 392, False: 16.3k]
  ------------------
  458|    392|      W mask = 0;
  459|    949|      for(size_t i = x_size; i != y_size; i++) {
  ------------------
  |  Branch (459:30): [True: 557, False: 392]
  ------------------
  460|    557|         mask |= y[i];
  461|    557|      }
  462|       |
  463|       |      // If any bits were set in high part of y, then x < y
  464|    392|      result = CT::Mask<W>::is_zero(mask).select(result, LT);
  465|  16.3k|   } else if(y_size < x_size) {
  ------------------
  |  Branch (465:14): [True: 231, False: 16.1k]
  ------------------
  466|    231|      W mask = 0;
  467|    462|      for(size_t i = y_size; i != x_size; i++) {
  ------------------
  |  Branch (467:30): [True: 231, False: 231]
  ------------------
  468|    231|         mask |= x[i];
  469|    231|      }
  470|       |
  471|       |      // If any bits were set in high part of x, then x > y
  472|    231|      result = CT::Mask<W>::is_zero(mask).select(result, GT);
  473|    231|   }
  474|       |
  475|  16.7k|   CT::unpoison(result);
  476|  16.7k|   BOTAN_DEBUG_ASSERT(result == LT || result == GT || result == EQ);
  ------------------
  |  |  130|  16.7k|      do { /* NOLINT(*-avoid-do-while) */ \
  |  |  131|  16.7k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (131:15): [Folded, False: 16.7k]
  |  |  ------------------
  ------------------
  477|  16.7k|   return static_cast<int32_t>(result);
  478|  16.7k|}
_ZN5Botan11bigint_sub3ITkNS_8WordTypeEmEET_PS1_PKS1_mS4_m:
  192|   668k|inline constexpr auto bigint_sub3(W z[], const W x[], size_t x_size, const W y[], size_t y_size) -> W {
  193|   668k|   W borrow = 0;
  194|       |
  195|   668k|   BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
  ------------------
  |  |   64|   668k|   do {                                                                                 \
  |  |   65|   668k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                     \
  |  |   66|   668k|      if(!(expr)) {                                                                     \
  |  |  ------------------
  |  |  |  Branch (66:10): [True: 0, False: 668k]
  |  |  ------------------
  |  |   67|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                            \
  |  |   68|      0|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   69|      0|      }                                                                                 \
  |  |   70|   668k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (70:12): [Folded, False: 668k]
  |  |  ------------------
  ------------------
  196|       |
  197|   668k|   const size_t blocks = y_size - (y_size % 8);
  198|       |
  199|  1.98M|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (199:22): [True: 1.31M, False: 668k]
  ------------------
  200|  1.31M|      borrow = word8_sub3(z + i, x + i, y + i, borrow);
  201|  1.31M|   }
  202|       |
  203|  2.33M|   for(size_t i = blocks; i != y_size; ++i) {
  ------------------
  |  Branch (203:27): [True: 1.66M, False: 668k]
  ------------------
  204|  1.66M|      z[i] = word_sub(x[i], y[i], &borrow);
  205|  1.66M|   }
  206|       |
  207|  1.33M|   for(size_t i = y_size; i != x_size; ++i) {
  ------------------
  |  Branch (207:27): [True: 668k, False: 668k]
  ------------------
  208|   668k|      z[i] = word_sub(x[i], static_cast<W>(0), &borrow);
  209|   668k|   }
  210|       |
  211|   668k|   return borrow;
  212|   668k|}
_ZN5Botan14bigint_linmul3ITkNS_8WordTypeEmEEvPT_PKS1_mS1_:
  416|  16.2k|inline constexpr void bigint_linmul3(W z[], const W x[], size_t x_size, W y) {
  417|  16.2k|   const size_t blocks = x_size - (x_size % 8);
  418|       |
  419|  16.2k|   W carry = 0;
  420|       |
  421|  43.6k|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (421:22): [True: 27.3k, False: 16.2k]
  ------------------
  422|  27.3k|      carry = word8_linmul3(z + i, x + i, y, carry);
  423|  27.3k|   }
  424|       |
  425|  65.0k|   for(size_t i = blocks; i != x_size; ++i) {
  ------------------
  |  Branch (425:27): [True: 48.7k, False: 16.2k]
  ------------------
  426|  48.7k|      z[i] = word_madd2(x[i], y, &carry);
  427|  48.7k|   }
  428|       |
  429|  16.2k|   z[x_size] = carry;
  430|  16.2k|}
_ZN5Botan14divide_precompImEC2Em:
  574|  3.31k|      explicit constexpr divide_precomp(W divisor) : m_divisor(divisor) {
  575|  3.31k|         BOTAN_ARG_CHECK(m_divisor != 0, "Division by zero");
  ------------------
  |  |   35|  3.31k|   do {                                                          \
  |  |   36|  3.31k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|  3.31k|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 3.31k]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|  3.31k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 3.31k]
  |  |  ------------------
  ------------------
  576|  3.31k|      }
_ZNK5Botan14divide_precompImE16vartime_div_2to1Emm:
  581|  15.5k|      inline constexpr W vartime_div_2to1(W n1, W n0) const {
  582|  15.5k|         BOTAN_ASSERT_NOMSG(n1 < m_divisor);
  ------------------
  |  |   77|  15.5k|   do {                                                                     \
  |  |   78|  15.5k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|  15.5k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 15.5k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|  15.5k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 15.5k]
  |  |  ------------------
  ------------------
  583|       |
  584|  15.5k|         if(m_divisor == WordInfo<W>::max) {
  ------------------
  |  Branch (584:13): [True: 2.50k, False: 13.0k]
  ------------------
  585|  2.50k|            return vartime_div_2to1_max_d(n1, n0);
  586|  2.50k|         }
  587|       |
  588|  13.0k|         if(m_divisor == WordInfo<W>::top_bit) {
  ------------------
  |  Branch (588:13): [True: 3.49k, False: 9.52k]
  ------------------
  589|       |            // Simply a shift by N-1 bits
  590|  3.49k|            return (n1 << 1) | (n0 >> (WordInfo<W>::bits - 1));
  591|  3.49k|         }
  592|       |
  593|  9.52k|         if(!std::is_constant_evaluated()) {
  ------------------
  |  Branch (593:13): [True: 9.52k, Folded]
  ------------------
  594|  9.52k|#if defined(BOTAN_MP_USE_X86_64_ASM)
  595|  9.52k|            if constexpr(std::same_as<W, uint64_t>) {
  596|  9.52k|               W quotient = 0;
  597|  9.52k|               W remainder = 0;
  598|       |               // NOLINTNEXTLINE(*-no-assembler)
  599|  9.52k|               asm("divq %[v]" : "=a"(quotient), "=d"(remainder) : [v] "r"(m_divisor), "a"(n0), "d"(n1) : "cc");
  600|  9.52k|               return quotient;
  601|  9.52k|            }
  602|      0|#endif
  603|       |
  604|      0|#if !defined(BOTAN_BUILD_COMPILER_IS_CLANGCL)
  605|       |
  606|       |            /* clang-cl has a bug where on encountering a 128/64 division it emits
  607|       |            * a call to __udivti3() but then fails to link the relevant builtin into
  608|       |            * the binary, causing a link failure. Work around this by simply omitting
  609|       |            * such code for clang-cl
  610|       |            *
  611|       |            * See https://github.com/llvm/llvm-project/issues/25679
  612|       |            */
  613|  9.52k|            if constexpr(WordInfo<W>::dword_is_native) {
  614|  9.52k|               typename WordInfo<W>::dword n = n1;
  615|  9.52k|               n <<= WordInfo<W>::bits;
  616|  9.52k|               n |= n0;
  617|  9.52k|               return static_cast<W>(n / m_divisor);
  618|  9.52k|            }
  619|  9.52k|#endif
  620|  9.52k|         }
  621|       |
  622|      0|         W high = n1;
  623|  9.52k|         W quotient = 0;
  624|       |
  625|  9.52k|         for(size_t i = 0; i != WordInfo<W>::bits; ++i) {
  ------------------
  |  Branch (625:28): [True: 0, False: 9.52k]
  ------------------
  626|      0|            const W high_top_bit = high >> (WordInfo<W>::bits - 1);
  627|       |
  628|      0|            high <<= 1;
  629|      0|            high |= (n0 >> (WordInfo<W>::bits - 1 - i)) & 1;
  630|      0|            quotient <<= 1;
  631|       |
  632|      0|            if(high_top_bit || high >= m_divisor) {
  ------------------
  |  Branch (632:16): [True: 0, False: 0]
  |  Branch (632:32): [True: 0, False: 0]
  ------------------
  633|      0|               high -= m_divisor;
  634|      0|               quotient |= 1;
  635|      0|            }
  636|      0|         }
  637|       |
  638|  9.52k|         return quotient;
  639|  13.0k|      }
_ZN5Botan14divide_precompImE22vartime_div_2to1_max_dEmm:
  657|  2.50k|      static inline constexpr W vartime_div_2to1_max_d(W n1, W n0) {
  658|       |         /*
  659|       |         Use k to refer to WordInfo<W>::bits
  660|       |
  661|       |         We are dividing n = (n1 * 2^k) + n0 by 2^k - 1
  662|       |
  663|       |         Recall that 2^k = 1 (mod 2^k - 1)
  664|       |
  665|       |         Rewrite n = n1*2^k + n0 as n1*(2^k - 1) + n1 + n0
  666|       |
  667|       |         The result of dividing n by (2^k - 1) will be equal to
  668|       |         (n1*(2^k-1) + n1 + n0) / (2^k-1) =
  669|       |         n1 + ((n1 + n0) / (2^k-1)
  670|       |
  671|       |         Use c to refer to ((n1 + n0) / (2^k-1))
  672|       |
  673|       |         If (n1 + n0) < (2^k - 1) then c is 0
  674|       |         If (n1 + n0) >= (2^k - 1) then c is 1
  675|       |
  676|       |         Since n1 < 2^k - 1 [*] and n0 <= 2^k - 1 it is impossible for (n1 + n0) / (2^k -1)
  677|       |         to be greater than 1.
  678|       |
  679|       |         [*] We require n1 be strictly less than the divisor to ensure that the
  680|       |         output fits in a single word; this is checked at the start of vartime_div_2to1.
  681|       |         */
  682|       |
  683|  2.50k|         const W s = n0 + n1;
  684|       |         // did n0 + n1 overflow? or does (n0 + n1) == 2^k - 1? if either, c == 1
  685|  2.50k|         if(s < n0 || s == WordInfo<W>::max) {
  ------------------
  |  Branch (685:13): [True: 771, False: 1.73k]
  |  Branch (685:23): [True: 112, False: 1.62k]
  ------------------
  686|    883|            n1 += 1;
  687|    883|         }
  688|       |
  689|  2.50k|         return n1;
  690|  2.50k|      }
_ZN5Botan11bigint_shl2ITkNS_8WordTypeEmEEvPT_mPKS1_mm:
  355|  3.31k|inline constexpr void bigint_shl2(W y[], size_t y_size, const W x[], size_t x_size, size_t shift) {
  356|  3.31k|   const size_t word_shift = shift / WordInfo<W>::bits;
  357|  3.31k|   const size_t bit_shift = shift % WordInfo<W>::bits;
  358|       |
  359|  3.31k|   BOTAN_ASSERT_NOMSG(word_shift <= y_size);
  ------------------
  |  |   77|  3.31k|   do {                                                                     \
  |  |   78|  3.31k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|  3.31k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 3.31k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|  3.31k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 3.31k]
  |  |  ------------------
  ------------------
  360|  3.31k|   BOTAN_ASSERT_NOMSG(x_size < y_size - word_shift);
  ------------------
  |  |   77|  3.31k|   do {                                                                     \
  |  |   78|  3.31k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|  3.31k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 3.31k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|  3.31k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 3.31k]
  |  |  ------------------
  ------------------
  361|       |
  362|  3.31k|   unchecked_copy_memory(y + word_shift, x, x_size);
  363|  3.31k|   zeroize_buffer(y, word_shift);
  364|  3.31k|   zeroize_buffer(y + word_shift + x_size, y_size - word_shift - x_size);
  365|       |
  366|  3.31k|   const auto carry_mask = CT::Mask<W>::expand(bit_shift);
  367|  3.31k|   const W carry_shift = carry_mask.if_set_return(WordInfo<W>::bits - bit_shift);
  368|       |
  369|  3.31k|   W carry = 0;
  370|  15.1k|   for(size_t i = word_shift; i != x_size + word_shift + 1; ++i) {
  ------------------
  |  Branch (370:31): [True: 11.8k, False: 3.31k]
  ------------------
  371|  11.8k|      const W w = y[i];
  372|  11.8k|      y[i] = (w << bit_shift) | carry;
  373|  11.8k|      carry = carry_mask.if_set_return(w >> carry_shift);
  374|  11.8k|   }
  375|  3.31k|}
_ZN5Botan15bigint_ct_is_eqITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPKS3_mS6_m:
  519|  8.29k|inline constexpr auto bigint_ct_is_eq(const W x[], size_t x_size, const W y[], size_t y_size) -> CT::Mask<W> {
  520|  8.29k|   const size_t common_elems = std::min(x_size, y_size);
  521|       |
  522|  8.29k|   W diff = 0;
  523|       |
  524|   103k|   for(size_t i = 0; i != common_elems; i++) {
  ------------------
  |  Branch (524:22): [True: 95.6k, False: 8.29k]
  ------------------
  525|  95.6k|      diff |= (x[i] ^ y[i]);
  526|  95.6k|   }
  527|       |
  528|       |   // If any bits were set in high part of x/y, then they are not equal
  529|  8.29k|   if(x_size < y_size) {
  ------------------
  |  Branch (529:7): [True: 371, False: 7.91k]
  ------------------
  530|  5.82k|      for(size_t i = x_size; i != y_size; i++) {
  ------------------
  |  Branch (530:30): [True: 5.45k, False: 371]
  ------------------
  531|  5.45k|         diff |= y[i];
  532|  5.45k|      }
  533|  7.91k|   } else if(y_size < x_size) {
  ------------------
  |  Branch (533:14): [True: 610, False: 7.30k]
  ------------------
  534|  8.41k|      for(size_t i = y_size; i != x_size; i++) {
  ------------------
  |  Branch (534:30): [True: 7.80k, False: 610]
  ------------------
  535|  7.80k|         diff |= x[i];
  536|  7.80k|      }
  537|    610|   }
  538|       |
  539|  8.29k|   return CT::Mask<W>::is_zero(diff);
  540|  8.29k|}
_ZN5Botan15bigint_ct_is_ltITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPKS3_mS6_mb:
  487|  3.31k|   -> CT::Mask<W> {
  488|  3.31k|   const size_t common_elems = std::min(x_size, y_size);
  489|       |
  490|  3.31k|   auto is_lt = CT::Mask<W>::expand(lt_or_equal);
  491|       |
  492|  37.0k|   for(size_t i = 0; i != common_elems; i++) {
  ------------------
  |  Branch (492:22): [True: 33.7k, False: 3.31k]
  ------------------
  493|  33.7k|      const auto eq = CT::Mask<W>::is_equal(x[i], y[i]);
  494|  33.7k|      const auto lt = CT::Mask<W>::is_lt(x[i], y[i]);
  495|  33.7k|      is_lt = eq.select_mask(is_lt, lt);
  496|  33.7k|   }
  497|       |
  498|  3.31k|   if(x_size < y_size) {
  ------------------
  |  Branch (498:7): [True: 120, False: 3.19k]
  ------------------
  499|    120|      W mask = 0;
  500|    728|      for(size_t i = x_size; i != y_size; i++) {
  ------------------
  |  Branch (500:30): [True: 608, False: 120]
  ------------------
  501|    608|         mask |= y[i];
  502|    608|      }
  503|       |      // If any bits were set in high part of y, then is_lt should be forced true
  504|    120|      is_lt |= CT::Mask<W>::expand(mask);
  505|  3.19k|   } else if(y_size < x_size) {
  ------------------
  |  Branch (505:14): [True: 460, False: 2.73k]
  ------------------
  506|    460|      W mask = 0;
  507|  9.70k|      for(size_t i = y_size; i != x_size; i++) {
  ------------------
  |  Branch (507:30): [True: 9.24k, False: 460]
  ------------------
  508|  9.24k|         mask |= x[i];
  509|  9.24k|      }
  510|       |
  511|       |      // If any bits were set in high part of x, then is_lt should be false
  512|    460|      is_lt &= CT::Mask<W>::is_zero(mask);
  513|    460|   }
  514|       |
  515|  3.31k|   return is_lt;
  516|  3.31k|}
_ZN5Botan15bigint_cnd_swapITkNS_8WordTypeEmEEvT_PS1_S2_m:
   29|   665k|inline constexpr void bigint_cnd_swap(W cnd, W x[], W y[], size_t size) {
   30|   665k|   const auto mask = CT::Mask<W>::expand(cnd);
   31|       |
   32|  13.4M|   for(size_t i = 0; i != size; ++i) {
  ------------------
  |  Branch (32:22): [True: 12.8M, False: 665k]
  ------------------
   33|  12.8M|      const W a = x[i];
   34|  12.8M|      const W b = y[i];
   35|  12.8M|      x[i] = mask.select(b, a);
   36|  12.8M|      y[i] = mask.select(a, b);
   37|  12.8M|   }
   38|   665k|}
_ZN5Botan11bigint_shl1ITkNS_8WordTypeEmEEvPT_mmm:
  309|   670k|inline constexpr void bigint_shl1(W x[], size_t x_size, size_t x_words, size_t shift) {
  310|   670k|   const size_t word_shift = shift / WordInfo<W>::bits;
  311|   670k|   const size_t bit_shift = shift % WordInfo<W>::bits;
  312|       |
  313|   670k|   BOTAN_ASSERT_NOMSG(word_shift <= x_size);
  ------------------
  |  |   77|   670k|   do {                                                                     \
  |  |   78|   670k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|   670k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 670k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|   670k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 670k]
  |  |  ------------------
  ------------------
  314|   670k|   BOTAN_ASSERT_NOMSG(x_words <= x_size - word_shift);
  ------------------
  |  |   77|   670k|   do {                                                                     \
  |  |   78|   670k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|   670k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 670k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|   670k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 670k]
  |  |  ------------------
  ------------------
  315|       |
  316|   670k|   unchecked_copy_memory(x + word_shift, x, x_words);
  317|   670k|   zeroize_buffer(x, word_shift);
  318|       |
  319|   670k|   const auto carry_mask = CT::Mask<W>::expand(bit_shift);
  320|   670k|   const W carry_shift = carry_mask.if_set_return(WordInfo<W>::bits - bit_shift);
  321|       |
  322|   670k|   W carry = 0;
  323|  13.5M|   for(size_t i = word_shift; i != x_size; ++i) {
  ------------------
  |  Branch (323:31): [True: 12.8M, False: 670k]
  ------------------
  324|  12.8M|      const W w = x[i];
  325|  12.8M|      x[i] = (w << bit_shift) | carry;
  326|  12.8M|      carry = carry_mask.if_set_return(w >> carry_shift);
  327|  12.8M|   }
  328|   670k|}
_ZN5Botan14bigint_sub_absITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPS3_PKS3_S7_mS5_:
  279|     14|inline constexpr auto bigint_sub_abs(W z[], const W x[], const W y[], size_t N, W ws[]) -> CT::Mask<W> {
  280|       |   // Subtract in both direction then conditional copy out the result
  281|       |
  282|     14|   W* ws0 = ws;
  283|     14|   W* ws1 = ws + N;
  284|       |
  285|     14|   W borrow0 = 0;
  286|     14|   W borrow1 = 0;
  287|       |
  288|     14|   const size_t blocks = N - (N % 8);
  289|       |
  290|     42|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (290:22): [True: 28, False: 14]
  ------------------
  291|     28|      borrow0 = word8_sub3(ws0 + i, x + i, y + i, borrow0);
  292|     28|      borrow1 = word8_sub3(ws1 + i, y + i, x + i, borrow1);
  293|     28|   }
  294|       |
  295|     30|   for(size_t i = blocks; i != N; ++i) {
  ------------------
  |  Branch (295:27): [True: 16, False: 14]
  ------------------
  296|     16|      ws0[i] = word_sub(x[i], y[i], &borrow0);
  297|     16|      ws1[i] = word_sub(y[i], x[i], &borrow1);
  298|     16|   }
  299|       |
  300|     14|   return CT::conditional_copy_mem(borrow0, z, ws1, ws0, N);
  301|     14|}
_ZN5Botan11bigint_add2ITkNS_8WordTypeEmEET_PS1_mPKS1_m:
   94|     21|inline constexpr auto bigint_add2(W x[], size_t x_size, const W y[], size_t y_size) -> W {
   95|     21|   W carry = 0;
   96|       |
   97|     21|   BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
  ------------------
  |  |   64|     21|   do {                                                                                 \
  |  |   65|     21|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                     \
  |  |   66|     21|      if(!(expr)) {                                                                     \
  |  |  ------------------
  |  |  |  Branch (66:10): [True: 0, False: 21]
  |  |  ------------------
  |  |   67|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                            \
  |  |   68|      0|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   69|      0|      }                                                                                 \
  |  |   70|     21|   } while(0)
  |  |  ------------------
  |  |  |  Branch (70:12): [Folded, False: 21]
  |  |  ------------------
  ------------------
   98|       |
   99|     21|   const size_t blocks = y_size - (y_size % 8);
  100|       |
  101|     49|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (101:22): [True: 28, False: 21]
  ------------------
  102|     28|      carry = word8_add2(x + i, y + i, carry);
  103|     28|   }
  104|       |
  105|     51|   for(size_t i = blocks; i != y_size; ++i) {
  ------------------
  |  Branch (105:27): [True: 30, False: 21]
  ------------------
  106|     30|      x[i] = word_add(x[i], y[i], &carry);
  107|     30|   }
  108|       |
  109|    247|   for(size_t i = y_size; i != x_size; ++i) {
  ------------------
  |  Branch (109:27): [True: 226, False: 21]
  ------------------
  110|    226|      x[i] = word_add(x[i], static_cast<W>(0), &carry);
  111|    226|   }
  112|       |
  113|     21|   return carry;
  114|     21|}
_ZN5Botan14bigint_cnd_addITkNS_8WordTypeEmEET_S1_PS1_PKS1_m:
   45|      7|inline constexpr W bigint_cnd_add(W cnd, W x[], const W y[], size_t size) {
   46|      7|   const auto mask = CT::Mask<W>::expand(cnd).value();
   47|       |
   48|      7|   W carry = 0;
   49|       |
   50|    367|   for(size_t i = 0; i != size; ++i) {
  ------------------
  |  Branch (50:22): [True: 360, False: 7]
  ------------------
   51|    360|      x[i] = word_add(x[i], y[i] & mask, &carry);
   52|    360|   }
   53|       |
   54|      7|   return (mask & carry);
   55|      7|}
_ZN5Botan14bigint_cnd_subITkNS_8WordTypeEmEET_S1_PS1_PKS1_m:
   62|      7|inline constexpr auto bigint_cnd_sub(W cnd, W x[], const W y[], size_t size) -> W {
   63|      7|   const auto mask = CT::Mask<W>::expand(cnd).value();
   64|       |
   65|      7|   W carry = 0;
   66|       |
   67|    367|   for(size_t i = 0; i != size; ++i) {
  ------------------
  |  Branch (67:22): [True: 360, False: 7]
  ------------------
   68|    360|      x[i] = word_sub(x[i], y[i] & mask, &carry);
   69|    360|   }
   70|       |
   71|      7|   return (mask & carry);
   72|      7|}
_ZN5Botan11bigint_sub2ITkNS_8WordTypeEmEET_PS1_mPKS1_m:
  148|  13.5k|inline constexpr auto bigint_sub2(W x[], size_t x_size, const W y[], size_t y_size) -> W {
  149|  13.5k|   W borrow = 0;
  150|       |
  151|  13.5k|   BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
  ------------------
  |  |   64|  13.5k|   do {                                                                                 \
  |  |   65|  13.5k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                     \
  |  |   66|  13.5k|      if(!(expr)) {                                                                     \
  |  |  ------------------
  |  |  |  Branch (66:10): [True: 0, False: 13.5k]
  |  |  ------------------
  |  |   67|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                            \
  |  |   68|      0|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   69|      0|      }                                                                                 \
  |  |   70|  13.5k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (70:12): [Folded, False: 13.5k]
  |  |  ------------------
  ------------------
  152|       |
  153|  13.5k|   const size_t blocks = y_size - (y_size % 8);
  154|       |
  155|  40.4k|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (155:22): [True: 26.9k, False: 13.5k]
  ------------------
  156|  26.9k|      borrow = word8_sub2(x + i, y + i, borrow);
  157|  26.9k|   }
  158|       |
  159|  59.1k|   for(size_t i = blocks; i != y_size; ++i) {
  ------------------
  |  Branch (159:27): [True: 45.6k, False: 13.5k]
  ------------------
  160|  45.6k|      x[i] = word_sub(x[i], y[i], &borrow);
  161|  45.6k|   }
  162|       |
  163|  13.7k|   for(size_t i = y_size; i != x_size; ++i) {
  ------------------
  |  Branch (163:27): [True: 231, False: 13.5k]
  ------------------
  164|    231|      x[i] = word_sub(x[i], static_cast<W>(0), &borrow);
  165|    231|   }
  166|       |
  167|  13.5k|   return borrow;
  168|  13.5k|}
_ZN5Botan15bigint_sub2_revITkNS_8WordTypeEmEEvPT_PKS1_m:
  174|    730|inline constexpr void bigint_sub2_rev(W x[], const W y[], size_t y_size) {
  175|    730|   W borrow = 0;
  176|       |
  177|  13.0k|   for(size_t i = 0; i != y_size; ++i) {
  ------------------
  |  Branch (177:22): [True: 12.2k, False: 730]
  ------------------
  178|  12.2k|      x[i] = word_sub(y[i], x[i], &borrow);
  179|  12.2k|   }
  180|       |
  181|    730|   BOTAN_ASSERT(borrow == 0, "y must be greater than x");
  ------------------
  |  |   64|    730|   do {                                                                                 \
  |  |   65|    730|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                     \
  |  |   66|    730|      if(!(expr)) {                                                                     \
  |  |  ------------------
  |  |  |  Branch (66:10): [True: 0, False: 730]
  |  |  ------------------
  |  |   67|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                            \
  |  |   68|      0|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   69|      0|      }                                                                                 \
  |  |   70|    730|   } while(0)
  |  |  ------------------
  |  |  |  Branch (70:12): [Folded, False: 730]
  |  |  ------------------
  ------------------
  182|    730|}
_ZN5Botan11bigint_shr1ITkNS_8WordTypeEmEEvPT_mm:
  331|  18.4k|inline constexpr void bigint_shr1(W x[], size_t x_size, size_t shift) {
  332|  18.4k|   const size_t word_shift = shift / WordInfo<W>::bits;
  333|  18.4k|   const size_t bit_shift = shift % WordInfo<W>::bits;
  334|       |
  335|  18.4k|   const size_t top = x_size >= word_shift ? (x_size - word_shift) : 0;
  ------------------
  |  Branch (335:23): [True: 18.4k, False: 0]
  ------------------
  336|       |
  337|  18.4k|   if(top > 0) {
  ------------------
  |  Branch (337:7): [True: 18.4k, False: 0]
  ------------------
  338|  18.4k|      unchecked_copy_memory(x, x + word_shift, top);
  339|  18.4k|   }
  340|  18.4k|   zeroize_buffer(x + top, std::min(word_shift, x_size));
  341|       |
  342|  18.4k|   const auto carry_mask = CT::Mask<W>::expand(bit_shift);
  343|  18.4k|   const W carry_shift = carry_mask.if_set_return(WordInfo<W>::bits - bit_shift);
  344|       |
  345|  18.4k|   W carry = 0;
  346|       |
  347|   687k|   for(size_t i = 0; i != top; ++i) {
  ------------------
  |  Branch (347:22): [True: 669k, False: 18.4k]
  ------------------
  348|   669k|      const W w = x[top - i - 1];
  349|   669k|      x[top - i - 1] = (w >> bit_shift) | carry;
  350|   669k|      carry = carry_mask.if_set_return(w << carry_shift);
  351|   669k|   }
  352|  18.4k|}

_ZN5Botan8round_upEmm:
   26|  3.34k|constexpr inline size_t round_up(size_t n, size_t align_to) {
   27|       |   // Arguably returning n in this case would also be sensible
   28|  3.34k|   BOTAN_ARG_CHECK(align_to != 0, "align_to must not be 0");
  ------------------
  |  |   35|  3.34k|   do {                                                          \
  |  |   36|  3.34k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|  3.34k|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 3.34k]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|  3.34k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 3.34k]
  |  |  ------------------
  ------------------
   29|       |
   30|  3.34k|   if(n % align_to > 0) {
  ------------------
  |  Branch (30:7): [True: 3.10k, False: 232]
  ------------------
   31|  3.10k|      const size_t adj = align_to - (n % align_to);
   32|  3.10k|      BOTAN_ARG_CHECK(n + adj >= n, "Integer overflow during rounding");
  ------------------
  |  |   35|  3.10k|   do {                                                          \
  |  |   36|  3.10k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|  3.10k|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 3.10k]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|  3.10k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 3.10k]
  |  |  ------------------
  ------------------
   33|  3.10k|      n += adj;
   34|  3.10k|   }
   35|  3.34k|   return n;
   36|  3.34k|}

_ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEmQntsr3stdE7same_asIbT_EEES3_S3_:
   43|  54.0M|constexpr inline T value_barrier(T x) {
   44|  54.0M|   if(std::is_constant_evaluated()) {
  ------------------
  |  Branch (44:7): [Folded, False: 54.0M]
  ------------------
   45|      0|      return x;
   46|  54.0M|   } else {
   47|  54.0M|#if defined(BOTAN_CT_VALUE_BARRIER_USE_ASM)
   48|       |      /*
   49|       |      * We may want a "stronger" statement such as
   50|       |      *     asm volatile("" : "+r,m"(x) : : "memory);
   51|       |      * (see https://theunixzoo.co.uk/blog/2021-10-14-preventing-optimisations.html)
   52|       |      * however the current approach seems sufficient with current compilers,
   53|       |      * and is minimally damaging with regards to degrading code generation.
   54|       |      */
   55|  54.0M|      asm("" : "+r"(x) : /* no input */);  // NOLINT(*-no-assembler)
   56|  54.0M|      return x;
   57|       |#elif defined(BOTAN_CT_VALUE_BARRIER_USE_VOLATILE)
   58|       |      volatile T vx = x;
   59|       |      return vx;
   60|       |#else
   61|       |      return x;
   62|       |#endif
   63|  54.0M|   }
   64|  54.0M|}
_ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEhQntsr3stdE7same_asIbT_EEES3_S3_:
   43|  41.4k|constexpr inline T value_barrier(T x) {
   44|  41.4k|   if(std::is_constant_evaluated()) {
  ------------------
  |  Branch (44:7): [Folded, False: 41.4k]
  ------------------
   45|      0|      return x;
   46|  41.4k|   } else {
   47|  41.4k|#if defined(BOTAN_CT_VALUE_BARRIER_USE_ASM)
   48|       |      /*
   49|       |      * We may want a "stronger" statement such as
   50|       |      *     asm volatile("" : "+r,m"(x) : : "memory);
   51|       |      * (see https://theunixzoo.co.uk/blog/2021-10-14-preventing-optimisations.html)
   52|       |      * however the current approach seems sufficient with current compilers,
   53|       |      * and is minimally damaging with regards to degrading code generation.
   54|       |      */
   55|  41.4k|      asm("" : "+r"(x) : /* no input */);  // NOLINT(*-no-assembler)
   56|  41.4k|      return x;
   57|       |#elif defined(BOTAN_CT_VALUE_BARRIER_USE_VOLATILE)
   58|       |      volatile T vx = x;
   59|       |      return vx;
   60|       |#else
   61|       |      return x;
   62|       |#endif
   63|  41.4k|   }
   64|  41.4k|}

_ZN5Botan13ignore_paramsIJPKmmEEEvDpRKT_:
  142|   791k|constexpr void ignore_params([[maybe_unused]] const T&... args) {}

_ZN5Botan6BigIntD2Ev:
  185|  45.4k|      ~BigInt() { _const_time_unpoison(); }
_ZN5Botan6BigIntaSEOS0_:
  190|  8.31k|      BigInt& operator=(BigInt&& other) noexcept {
  191|  8.31k|         if(this != &other) {
  ------------------
  |  Branch (191:13): [True: 8.31k, False: 0]
  ------------------
  192|  8.31k|            this->swap(other);
  193|  8.31k|         }
  194|       |
  195|  8.31k|         return (*this);
  196|  8.31k|      }
_ZN5Botan6BigInt4swapERS0_:
  207|  8.31k|      void swap(BigInt& other) noexcept {
  208|  8.31k|         m_data.swap(other.m_data);
  209|  8.31k|         std::swap(m_signedness, other.m_signedness);
  210|  8.31k|      }
_ZN5Botan6BigInt4Data4swapERS1_:
 1090|  8.31k|            void swap(Data& other) noexcept {
 1091|  8.31k|               m_reg.swap(other.m_reg);
 1092|  8.31k|               std::swap(m_sig_words, other.m_sig_words);
 1093|  8.31k|            }
_ZN5BotaneqERKNS_6BigIntEm:
 1186|  3.33k|inline bool operator==(const BigInt& a, word b) {
 1187|  3.33k|   return (a.cmp_word(b) == 0);
 1188|  3.33k|}
_ZN5BotanltERKNS_6BigIntES2_:
 1178|  3.31k|inline bool operator<(const BigInt& a, const BigInt& b) {
 1179|  3.31k|   return a.is_less_than(b);
 1180|  3.31k|}
_ZN5BotanplERKNS_6BigIntES2_:
 1125|  3.31k|inline BigInt operator+(const BigInt& x, const BigInt& y) {
 1126|  3.31k|   return BigInt::add2(x, y._data(), y.sig_words(), y.sign());
 1127|  3.31k|}
_ZNK5Botan6BigInt5_dataEv:
  972|  1.41M|      const word* _data() const { return m_data.const_data(); }
_ZNK5Botan6BigInt4Data10const_dataEv:
 1027|  1.46M|            const word* const_data() const { return m_reg.data(); }
_ZNK5Botan6BigInt9sig_wordsEv:
  648|   163k|      size_t sig_words() const { return m_data.sig_words(); }
_ZNK5Botan6BigInt4Data9sig_wordsEv:
 1102|   163k|            size_t sig_words() const {
 1103|   163k|               if(m_sig_words == sig_words_npos) {
  ------------------
  |  Branch (1103:19): [True: 68.6k, False: 94.9k]
  ------------------
 1104|  68.6k|                  m_sig_words = calc_sig_words();
 1105|  68.6k|               }
 1106|   163k|               return m_sig_words;
 1107|   163k|            }
_ZNK5Botan6BigInt4signEv:
  604|   137k|      Sign sign() const { return (m_signedness); }
_ZN5BotanneERKNS_6BigIntES2_:
 1166|  8.29k|inline bool operator!=(const BigInt& a, const BigInt& b) {
 1167|  8.29k|   return !a.is_equal(b);
 1168|  8.29k|}
_ZNK5Botan6BigInt7word_atEm:
  574|  3.34M|      word word_at(size_t n) const { return m_data.get_word_at(n); }
_ZNK5Botan6BigInt4Data11get_word_atEm:
 1038|  3.34M|            word get_word_at(size_t n) const {
 1039|  3.34M|               if(n < m_reg.size()) {
  ------------------
  |  Branch (1039:19): [True: 3.34M, False: 4.32k]
  ------------------
 1040|  3.34M|                  return m_reg[n];
 1041|  3.34M|               }
 1042|  4.32k|               return 0;
 1043|  3.34M|            }
_ZN5Botan6BigInt4zeroEv:
   50|  3.31k|      static BigInt zero() { return BigInt(); }
_ZN5Botan6BigInt8swap_regERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  214|    163|      BOTAN_DEPRECATED("Deprecated no replacement") void swap_reg(secure_vector<word>& reg) {
  215|    163|         m_data.swap(reg);
  216|       |         // sign left unchanged
  217|    163|      }
_ZN5Botan6BigInt3subEPKmmNS0_4SignE:
  332|  13.9k|      BigInt& sub(const word y[], size_t y_words, Sign sign) {
  333|  13.9k|         return add(y, y_words, sign == Positive ? Negative : Positive);
  ------------------
  |  Branch (333:33): [True: 13.9k, False: 0]
  ------------------
  334|  13.9k|      }
_ZN5Botan6BigInt5clearEv:
  415|  3.34k|      void clear() {
  416|  3.34k|         m_data.set_to_zero();
  417|  3.34k|         m_signedness = Positive;
  418|  3.34k|      }
_ZNK5Botan6BigInt6signumEv:
  467|  44.0k|      int signum() const {
  468|  44.0k|         if(sig_words() == 0) {
  ------------------
  |  Branch (468:13): [True: 1.92k, False: 42.1k]
  ------------------
  469|  1.92k|            return 0;
  470|  1.92k|         }
  471|  42.1k|         return (sign() == Negative) ? -1 : 1;
  ------------------
  |  Branch (471:17): [True: 365, False: 41.8k]
  ------------------
  472|  44.0k|      }
_ZNK5Botan6BigInt7is_zeroEv:
  484|  8.65k|      bool is_zero() const { return sig_words() == 0; }
_ZN5Botan6BigInt21conditionally_set_bitEmb:
  500|  1.97M|      void conditionally_set_bit(size_t n, bool set_it) {
  501|  1.97M|         const size_t which = n / (sizeof(word) * 8);
  502|  1.97M|         const word mask = static_cast<word>(set_it) << (n % (sizeof(word) * 8));
  503|  1.97M|         m_data.set_word_at(which, word_at(which) | mask);
  504|  1.97M|      }
_ZNK5Botan6BigInt7get_bitEm:
  523|  1.30M|      bool get_bit(size_t n) const { return ((word_at(n / (sizeof(word) * 8)) >> (n % (sizeof(word) * 8))) & 1) == 1; }
_ZN5Botan6BigInt8set_signENS0_4SignE:
  625|  36.6k|      void set_sign(Sign sign) {
  626|  36.6k|         if(sign == Negative && is_zero()) {
  ------------------
  |  Branch (626:13): [True: 365, False: 36.3k]
  |  Branch (626:33): [True: 0, False: 365]
  ------------------
  627|      0|            sign = Positive;
  628|      0|         }
  629|       |
  630|  36.6k|         m_signedness = sign;
  631|  36.6k|      }
_ZNK5Botan6BigInt4sizeEv:
  642|  34.0k|      size_t size() const { return m_data.size(); }
_ZN5Botan6BigInt12mutable_dataEv:
  673|  2.70M|      BOTAN_DEPRECATED("Deprecated no replacement") word* mutable_data() { return m_data.mutable_data(); }
_ZNK5Botan6BigInt7grow_toEm:
  699|  48.2k|      BOTAN_DEPRECATED("Deprecated no replacement") void grow_to(size_t n) const { m_data.grow_to(n); }
_ZN5Botan6BigInt4Data12mutable_dataEv:
 1022|  2.72M|            word* mutable_data() {
 1023|  2.72M|               invalidate_sig_words();
 1024|  2.72M|               return m_reg.data();
 1025|  2.72M|            }
_ZN5Botan6BigInt4Data11set_word_atEmm:
 1045|  1.97M|            void set_word_at(size_t i, word w) {
 1046|  1.97M|               invalidate_sig_words();
 1047|  1.97M|               if(i >= m_reg.size()) {
  ------------------
  |  Branch (1047:19): [True: 1.66k, False: 1.97M]
  ------------------
 1048|  1.66k|                  if(w == 0) {
  ------------------
  |  Branch (1048:22): [True: 25, False: 1.64k]
  ------------------
 1049|     25|                     return;
 1050|     25|                  }
 1051|  1.64k|                  grow_to(i + 1);
 1052|  1.64k|               }
 1053|  1.97M|               m_reg[i] = w;
 1054|  1.97M|            }
_ZNK5Botan6BigInt4Data7grow_toEm:
 1065|  55.0k|            void grow_to(size_t n) const {
 1066|  55.0k|               if(n > size()) {
  ------------------
  |  Branch (1066:19): [True: 35.7k, False: 19.3k]
  ------------------
 1067|  35.7k|                  if(n <= m_reg.capacity()) {
  ------------------
  |  Branch (1067:22): [True: 0, False: 35.7k]
  ------------------
 1068|      0|                     m_reg.resize(n);
 1069|  35.7k|                  } else {
 1070|  35.7k|                     m_reg.resize(n + (8 - (n % 8)));
 1071|  35.7k|                  }
 1072|  35.7k|               }
 1073|  55.0k|            }
_ZNK5Botan6BigInt4Data4sizeEv:
 1075|   153k|            size_t size() const { return m_reg.size(); }
_ZN5Botan6BigInt4Data4swapERNSt3__16vectorImNS_16secure_allocatorImEEEE:
 1095|  3.50k|            void swap(secure_vector<word>& reg) noexcept {
 1096|  3.50k|               m_reg.swap(reg);
 1097|  3.50k|               invalidate_sig_words();
 1098|  3.50k|            }
_ZNK5Botan6BigInt4Data20invalidate_sig_wordsEv:
 1100|  4.70M|            void invalidate_sig_words() const noexcept { m_sig_words = sig_words_npos; }
_ZN5BotanmlEmRKNS_6BigIntE:
 1148|  13.9k|inline BigInt operator*(word x, const BigInt& y) {
 1149|  13.9k|   return y * x;
 1150|  13.9k|}
_ZN5Botan6BigIntC2Ev:
   45|  37.1k|      BigInt() = default;
_ZN5Botan6BigIntC2ERKS0_:
   88|  6.62k|      BigInt(const BigInt& other) = default;
_ZN5Botan6BigIntaSERKS0_:
  201|  11.6k|      BigInt& operator=(const BigInt&) = default;

_ZN5Botan9clear_memImEEvPT_m:
  118|  6.65k|inline constexpr void clear_mem(T* ptr, size_t n) {
  119|  6.65k|   clear_bytes(ptr, sizeof(T) * n);
  120|  6.65k|}
_ZN5Botan11clear_bytesEPvm:
  101|  6.65k|inline constexpr void clear_bytes(void* ptr, size_t bytes) {
  102|  6.65k|   if(bytes > 0) {
  ------------------
  |  Branch (102:7): [True: 3.31k, False: 3.34k]
  ------------------
  103|  3.31k|      std::memset(ptr, 0, bytes);
  104|  3.31k|   }
  105|  6.65k|}
_ZN5Botan13typecast_copyImTkNS_6ranges16contiguous_rangeENSt3__14spanIKhLm8EEEQaaaasr3stdE26is_default_constructible_vIT_Esr3stdE23is_trivially_copyable_vIS6_Esr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEEES6_RKSB_:
  210|  20.9k|inline constexpr ToT typecast_copy(const FromR& src) {
  211|  20.9k|   ToT dst;  // NOLINT(*-member-init)
  212|  20.9k|   typecast_copy(dst, src);
  213|  20.9k|   return dst;
  214|  20.9k|}
_ZN5Botan13typecast_copyImTkNS_6ranges16contiguous_rangeENSt3__14spanIKhLm8EEEQaaaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIT_Entsr3std6rangesE5rangeISK_EEEvRSK_RKSA_:
  188|  20.9k|inline constexpr void typecast_copy(ToT& out, const FromR& in) {
  189|  20.9k|   typecast_copy(std::span<ToT, 1>(&out, 1), in);
  190|  20.9k|}
_ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm1EEETkNS1_16contiguous_rangeENS3_IKhLm8EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEEEvOSL_RKSB_:
  176|  20.9k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) {
  177|  20.9k|   ranges::assert_equal_byte_lengths(out, in);
  178|  20.9k|   std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out));
  179|  20.9k|}
_ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeENS3_IKhLm18446744073709551615EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeENS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIST_EEEvOSB_RKSL_:
  160|  2.70k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) {
  161|  2.70k|   ranges::assert_equal_byte_lengths(out, in);
  162|  2.70k|   if(std::is_constant_evaluated()) {
  ------------------
  |  Branch (162:7): [Folded, False: 2.70k]
  ------------------
  163|      0|      std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out));
  164|  2.70k|   } else if(ranges::size_bytes(out) > 0) {
  ------------------
  |  Branch (164:14): [True: 2.70k, False: 0]
  ------------------
  165|  2.70k|      std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out));
  166|  2.70k|   }
  167|  2.70k|}
_ZN5Botan13typecast_copyImTkNS_6ranges16contiguous_rangeENSt3__14spanIhLm8EEEQaaaasr3stdE26is_default_constructible_vIT_Esr3stdE23is_trivially_copyable_vIS5_Esr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEEES5_RKSA_:
  210|  2.70k|inline constexpr ToT typecast_copy(const FromR& src) {
  211|  2.70k|   ToT dst;  // NOLINT(*-member-init)
  212|  2.70k|   typecast_copy(dst, src);
  213|  2.70k|   return dst;
  214|  2.70k|}
_ZN5Botan13typecast_copyImTkNS_6ranges16contiguous_rangeENSt3__14spanIhLm8EEEQaaaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISC_EESD_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIT_Entsr3std6rangesE5rangeISJ_EEEvRSJ_RKS9_:
  188|  2.70k|inline constexpr void typecast_copy(ToT& out, const FromR& in) {
  189|  2.70k|   typecast_copy(std::span<ToT, 1>(&out, 1), in);
  190|  2.70k|}
_ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm1EEETkNS1_16contiguous_rangeENS3_IhLm8EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS6_IXsr21__is_primary_templateINS7_Iu14__remove_cvrefIDTclL_ZNS9_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSF_ISN_EESO_E4type10value_typeEEEEvOSK_RKSA_:
  176|  2.70k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) {
  177|  2.70k|   ranges::assert_equal_byte_lengths(out, in);
  178|  2.70k|   std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out));
  179|  2.70k|}

_ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIhLm8EEEEEvRKT0_:
   77|  2.70k|inline constexpr void assert_exact_byte_length(const R& r) {
   78|  2.70k|   const std::span s{r};
   79|  2.70k|   if constexpr(statically_spanable_range<R>) {
   80|  2.70k|      static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths");
   81|       |   } else {
   82|       |      if(s.size_bytes() != expected) {
   83|       |         memory_region_size_violation();
   84|       |      }
   85|       |   }
   86|  2.70k|}
_ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIKhLm8EEEEEvRKT0_:
   77|  41.9k|inline constexpr void assert_exact_byte_length(const R& r) {
   78|  41.9k|   const std::span s{r};
   79|  41.9k|   if constexpr(statically_spanable_range<R>) {
   80|  41.9k|      static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths");
   81|       |   } else {
   82|       |      if(s.size_bytes() != expected) {
   83|       |         memory_region_size_violation();
   84|       |      }
   85|       |   }
   86|  41.9k|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm1EEETpTkNS0_14spanable_rangeEJNS3_IKhLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|  20.9k|{
  101|  20.9k|   const std::span s0{r0};
  102|       |
  103|  20.9k|   if constexpr(statically_spanable_range<R0>) {
  104|  20.9k|      constexpr size_t expected_size = s0.size_bytes();
  105|  20.9k|      (assert_exact_byte_length<expected_size>(rs), ...);
  106|       |   } else {
  107|       |      const size_t expected_size = s0.size_bytes();
  108|       |      const bool correct_size =
  109|       |         ((std::span<const std::ranges::range_value_t<Rs>>{rs}.size_bytes() == expected_size) && ...);
  110|       |
  111|       |      if(!correct_size) {
  112|       |         memory_region_size_violation();
  113|       |      }
  114|       |   }
  115|  20.9k|}
_ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm1EEEEEmRKT_:
   59|  23.6k|inline constexpr size_t size_bytes(const spanable_range auto& r) {
   60|  23.6k|   return std::span{r}.size_bytes();
   61|  23.6k|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|  2.70k|{
  101|  2.70k|   const std::span s0{r0};
  102|       |
  103|       |   if constexpr(statically_spanable_range<R0>) {
  104|       |      constexpr size_t expected_size = s0.size_bytes();
  105|       |      (assert_exact_byte_length<expected_size>(rs), ...);
  106|  2.70k|   } else {
  107|  2.70k|      const size_t expected_size = s0.size_bytes();
  108|  2.70k|      const bool correct_size =
  109|  2.70k|         ((std::span<const std::ranges::range_value_t<Rs>>{rs}.size_bytes() == expected_size) && ...);
  110|       |
  111|  2.70k|      if(!correct_size) {
  ------------------
  |  Branch (111:10): [True: 0, False: 2.70k]
  ------------------
  112|      0|         memory_region_size_violation();
  113|      0|      }
  114|  2.70k|   }
  115|  2.70k|}
_ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEEEEmRKT_:
   59|  5.41k|inline constexpr size_t size_bytes(const spanable_range auto& r) {
   60|  5.41k|   return std::span{r}.size_bytes();
   61|  5.41k|}
_ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__15arrayIhLm8EEEEEvRKT0_:
   77|  2.70k|inline constexpr void assert_exact_byte_length(const R& r) {
   78|  2.70k|   const std::span s{r};
   79|  2.70k|   if constexpr(statically_spanable_range<R>) {
   80|  2.70k|      static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths");
   81|       |   } else {
   82|       |      if(s.size_bytes() != expected) {
   83|       |         memory_region_size_violation();
   84|       |      }
   85|       |   }
   86|  2.70k|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm1EEETpTkNS0_14spanable_rangeEJNS3_IhLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|  2.70k|{
  101|  2.70k|   const std::span s0{r0};
  102|       |
  103|  2.70k|   if constexpr(statically_spanable_range<R0>) {
  104|  2.70k|      constexpr size_t expected_size = s0.size_bytes();
  105|  2.70k|      (assert_exact_byte_length<expected_size>(rs), ...);
  106|       |   } else {
  107|       |      const size_t expected_size = s0.size_bytes();
  108|       |      const bool correct_size =
  109|       |         ((std::span<const std::ranges::range_value_t<Rs>>{rs}.size_bytes() == expected_size) && ...);
  110|       |
  111|       |      if(!correct_size) {
  112|       |         memory_region_size_violation();
  113|       |      }
  114|       |   }
  115|  2.70k|}

_ZN5Botan16secure_allocatorImE10deallocateEPmm:
   54|  49.2k|      void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); }
_ZN5Botan16secure_allocatorImE8allocateEm:
   52|  49.2k|      T* allocate(std::size_t n) { return static_cast<T*>(allocate_memory(n, sizeof(T))); }

_ZN5Botan16wrap_strong_typeImRmQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_:
  268|  23.6k|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) {
  269|  23.6k|   if constexpr(std::same_as<std::remove_cvref_t<ParamT>, T>) {
  270|       |      // Noop, if the parameter type already is the desired return type.
  271|  23.6k|      return std::forward<ParamT>(t);
  272|       |   } else if constexpr(std::constructible_from<T, ParamT>) {
  273|       |      // Implicit conversion from the parameter type to the return type.
  274|       |      return T{std::forward<ParamT>(t)};
  275|       |   } else {
  276|       |      // Explicitly calling the wrapped type's constructor to support
  277|       |      // implicit conversions on types that mark their constructors as explicit.
  278|       |      static_assert(concepts::strong_type<T> && std::constructible_from<typename T::wrapped_type, ParamT>);
  279|       |      return T{typename T::wrapped_type{std::forward<ParamT>(t)}};
  280|       |   }
  281|  23.6k|}

_Z4fuzzNSt3__14spanIKhLm18446744073709551615EEE:
   10|  1.68k|void fuzz(std::span<const uint8_t> in) {
   11|  1.68k|   if(in.size() > 2 * 4096 / 8) {
  ------------------
  |  Branch (11:7): [True: 15, False: 1.67k]
  ------------------
   12|     15|      return;
   13|     15|   }
   14|       |
   15|       |   // Save on allocations by making these static
   16|  1.67k|   static Botan::BigInt x;
   17|  1.67k|   static Botan::BigInt y;
   18|  1.67k|   static Botan::BigInt q;
   19|  1.67k|   static Botan::BigInt r;
   20|  1.67k|   static Botan::BigInt ct_q;
   21|  1.67k|   static Botan::BigInt ct_r;
   22|  1.67k|   static Botan::BigInt z;
   23|       |
   24|  1.67k|   x = Botan::BigInt::from_bytes(in.subspan(0, in.size() / 2));
   25|  1.67k|   y = Botan::BigInt::from_bytes(in.subspan(in.size() / 2, in.size() - in.size() / 2));
   26|       |
   27|  1.67k|   if(y == 0) {
  ------------------
  |  Branch (27:7): [True: 2, False: 1.66k]
  ------------------
   28|      2|      return;
   29|      2|   }
   30|       |
   31|  1.66k|   Botan::vartime_divide(x, y, q, r);
   32|       |
   33|  1.66k|   FUZZER_ASSERT_TRUE(r < y);
  ------------------
  |  |   89|  1.66k|   do {                                                               \
  |  |   90|  1.66k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                   \
  |  |   91|  1.66k|      if(!(e)) {                                                      \
  |  |  ------------------
  |  |  |  Branch (91:10): [True: 0, False: 1.66k]
  |  |  ------------------
  |  |   92|      0|         FUZZER_WRITE_AND_CRASH("Expression " << #e << " was false"); \
  |  |  ------------------
  |  |  |  |   70|      0|   do {                                                                                                       \
  |  |  |  |   71|      0|      std::cerr << expr << " @ Line " << __LINE__ << " in " << __FILE__ << "\n"; /* NOLINT(*-macro-paren*) */ \
  |  |  |  |   72|      0|      abort();                                                                                                \
  |  |  |  |   73|      0|   } while(0)
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (73:12): [Folded, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   93|      0|      }                                                               \
  |  |   94|  1.66k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (94:12): [Folded, False: 1.66k]
  |  |  ------------------
  ------------------
   34|       |
   35|  1.66k|   z = q * y + r;
   36|       |
   37|  1.66k|   FUZZER_ASSERT_EQUAL(z, x);
  ------------------
  |  |   79|  1.66k|   do {                                                                                      \
  |  |   80|  1.66k|      if((x) != (y)) {                                                                       \
  |  |  ------------------
  |  |  |  Branch (80:10): [True: 0, False: 1.66k]
  |  |  ------------------
  |  |   81|      0|         FUZZER_WRITE_AND_CRASH(#x << " = " << (x) << " != " << #y << " = " << (y) << "\n"); \
  |  |  ------------------
  |  |  |  |   70|      0|   do {                                                                                                       \
  |  |  |  |   71|      0|      std::cerr << expr << " @ Line " << __LINE__ << " in " << __FILE__ << "\n"; /* NOLINT(*-macro-paren*) */ \
  |  |  |  |   72|      0|      abort();                                                                                                \
  |  |  |  |   73|      0|   } while(0)
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (73:12): [Folded, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   82|      0|      }                                                                                      \
  |  |   83|  1.66k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1.66k]
  |  |  ------------------
  ------------------
   38|       |
   39|  1.66k|   Botan::ct_divide(x, y, ct_q, ct_r);
   40|       |
   41|  1.66k|   FUZZER_ASSERT_EQUAL(q, ct_q);
  ------------------
  |  |   79|  1.66k|   do {                                                                                      \
  |  |   80|  1.66k|      if((x) != (y)) {                                                                       \
  |  |  ------------------
  |  |  |  Branch (80:10): [True: 0, False: 1.66k]
  |  |  ------------------
  |  |   81|      0|         FUZZER_WRITE_AND_CRASH(#x << " = " << (x) << " != " << #y << " = " << (y) << "\n"); \
  |  |  ------------------
  |  |  |  |   70|      0|   do {                                                                                                       \
  |  |  |  |   71|      0|      std::cerr << expr << " @ Line " << __LINE__ << " in " << __FILE__ << "\n"; /* NOLINT(*-macro-paren*) */ \
  |  |  |  |   72|      0|      abort();                                                                                                \
  |  |  |  |   73|      0|   } while(0)
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (73:12): [Folded, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   82|      0|      }                                                                                      \
  |  |   83|  1.66k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1.66k]
  |  |  ------------------
  ------------------
   42|  1.66k|   FUZZER_ASSERT_EQUAL(r, ct_r);
  ------------------
  |  |   79|  1.66k|   do {                                                                                      \
  |  |   80|  1.66k|      if((x) != (y)) {                                                                       \
  |  |  ------------------
  |  |  |  Branch (80:10): [True: 0, False: 1.66k]
  |  |  ------------------
  |  |   81|      0|         FUZZER_WRITE_AND_CRASH(#x << " = " << (x) << " != " << #y << " = " << (y) << "\n"); \
  |  |  ------------------
  |  |  |  |   70|      0|   do {                                                                                                       \
  |  |  |  |   71|      0|      std::cerr << expr << " @ Line " << __LINE__ << " in " << __FILE__ << "\n"; /* NOLINT(*-macro-paren*) */ \
  |  |  |  |   72|      0|      abort();                                                                                                \
  |  |  |  |   73|      0|   } while(0)
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (73:12): [Folded, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   82|      0|      }                                                                                      \
  |  |   83|  1.66k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1.66k]
  |  |  ------------------
  ------------------
   43|       |
   44|       |   // Now divide by just low word of y
   45|       |
   46|  1.66k|   y = y.word_at(0);
   47|  1.66k|   if(y == 0) {
  ------------------
  |  Branch (47:7): [True: 25, False: 1.64k]
  ------------------
   48|     25|      return;
   49|     25|   }
   50|       |
   51|  1.64k|   Botan::vartime_divide(x, y, q, r);
   52|       |
   53|  1.64k|   FUZZER_ASSERT_TRUE(r < y);
  ------------------
  |  |   89|  1.64k|   do {                                                               \
  |  |   90|  1.64k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                   \
  |  |   91|  1.64k|      if(!(e)) {                                                      \
  |  |  ------------------
  |  |  |  Branch (91:10): [True: 0, False: 1.64k]
  |  |  ------------------
  |  |   92|      0|         FUZZER_WRITE_AND_CRASH("Expression " << #e << " was false"); \
  |  |  ------------------
  |  |  |  |   70|      0|   do {                                                                                                       \
  |  |  |  |   71|      0|      std::cerr << expr << " @ Line " << __LINE__ << " in " << __FILE__ << "\n"; /* NOLINT(*-macro-paren*) */ \
  |  |  |  |   72|      0|      abort();                                                                                                \
  |  |  |  |   73|      0|   } while(0)
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (73:12): [Folded, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   93|      0|      }                                                               \
  |  |   94|  1.64k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (94:12): [Folded, False: 1.64k]
  |  |  ------------------
  ------------------
   54|  1.64k|   z = q * y + r;
   55|  1.64k|   FUZZER_ASSERT_EQUAL(z, x);
  ------------------
  |  |   79|  1.64k|   do {                                                                                      \
  |  |   80|  1.64k|      if((x) != (y)) {                                                                       \
  |  |  ------------------
  |  |  |  Branch (80:10): [True: 0, False: 1.64k]
  |  |  ------------------
  |  |   81|      0|         FUZZER_WRITE_AND_CRASH(#x << " = " << (x) << " != " << #y << " = " << (y) << "\n"); \
  |  |  ------------------
  |  |  |  |   70|      0|   do {                                                                                                       \
  |  |  |  |   71|      0|      std::cerr << expr << " @ Line " << __LINE__ << " in " << __FILE__ << "\n"; /* NOLINT(*-macro-paren*) */ \
  |  |  |  |   72|      0|      abort();                                                                                                \
  |  |  |  |   73|      0|   } while(0)
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (73:12): [Folded, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   82|      0|      }                                                                                      \
  |  |   83|  1.64k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1.64k]
  |  |  ------------------
  ------------------
   56|       |
   57|  1.64k|   Botan::word rw = 0;
   58|  1.64k|   Botan::ct_divide_word(x, y.word_at(0), ct_q, rw);
   59|  1.64k|   FUZZER_ASSERT_EQUAL(ct_q, q);
  ------------------
  |  |   79|  1.64k|   do {                                                                                      \
  |  |   80|  1.64k|      if((x) != (y)) {                                                                       \
  |  |  ------------------
  |  |  |  Branch (80:10): [True: 0, False: 1.64k]
  |  |  ------------------
  |  |   81|      0|         FUZZER_WRITE_AND_CRASH(#x << " = " << (x) << " != " << #y << " = " << (y) << "\n"); \
  |  |  ------------------
  |  |  |  |   70|      0|   do {                                                                                                       \
  |  |  |  |   71|      0|      std::cerr << expr << " @ Line " << __LINE__ << " in " << __FILE__ << "\n"; /* NOLINT(*-macro-paren*) */ \
  |  |  |  |   72|      0|      abort();                                                                                                \
  |  |  |  |   73|      0|   } while(0)
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (73:12): [Folded, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   82|      0|      }                                                                                      \
  |  |   83|  1.64k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1.64k]
  |  |  ------------------
  ------------------
   60|  1.64k|   FUZZER_ASSERT_EQUAL(rw, r.word_at(0));
  ------------------
  |  |   79|  1.64k|   do {                                                                                      \
  |  |   80|  1.64k|      if((x) != (y)) {                                                                       \
  |  |  ------------------
  |  |  |  Branch (80:10): [True: 0, False: 1.64k]
  |  |  ------------------
  |  |   81|      0|         FUZZER_WRITE_AND_CRASH(#x << " = " << (x) << " != " << #y << " = " << (y) << "\n"); \
  |  |  ------------------
  |  |  |  |   70|      0|   do {                                                                                                       \
  |  |  |  |   71|      0|      std::cerr << expr << " @ Line " << __LINE__ << " in " << __FILE__ << "\n"; /* NOLINT(*-macro-paren*) */ \
  |  |  |  |   72|      0|      abort();                                                                                                \
  |  |  |  |   73|      0|   } while(0)
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (73:12): [Folded, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   82|      0|      }                                                                                      \
  |  |   83|  1.64k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1.64k]
  |  |  ------------------
  ------------------
   61|  1.64k|}

LLVMFuzzerInitialize:
   28|      2|extern "C" int LLVMFuzzerInitialize(int* /*argc*/, char*** /*argv*/) {
   29|       |   /*
   30|       |   * This disables the mlock pool, as overwrites within the pool are
   31|       |   * opaque to ASan or other instrumentation.
   32|       |   */
   33|      2|   ::setenv("BOTAN_MLOCK_POOL_SIZE", "0", 1);
   34|      2|   return 0;
   35|      2|}
LLVMFuzzerTestOneInput:
   39|  1.69k|extern "C" int LLVMFuzzerTestOneInput(const uint8_t in[], size_t len) {
   40|  1.69k|   if(len <= max_fuzzer_input_size) {
  ------------------
  |  Branch (40:7): [True: 1.68k, False: 10]
  ------------------
   41|  1.68k|      try {
   42|  1.68k|         fuzz(std::span<const uint8_t>(in, len));
   43|  1.68k|      } catch(const std::exception& e) {
   44|      0|         std::cerr << "Uncaught exception from fuzzer driver " << e.what() << "\n";
   45|      0|         abort();
   46|      0|      } catch(...) {
   47|      0|         std::cerr << "Uncaught exception from fuzzer driver (unknown type)\n";
   48|      0|         abort();
   49|      0|      }
   50|  1.68k|   }
   51|  1.69k|   return 0;
   52|  1.69k|}

_ZN5Botan6BigIntpLERKS0_:
   16|    365|BigInt& BigInt::operator+=(const BigInt& y) {
   17|    365|   if(&y == this) {
  ------------------
  |  Branch (17:7): [True: 0, False: 365]
  ------------------
   18|      0|      return *this <<= 1;
   19|      0|   }
   20|    365|   return add(y._data(), y.sig_words(), y.sign());
   21|    365|}
_ZN5Botan6BigIntmIERKS0_:
   23|  13.9k|BigInt& BigInt::operator-=(const BigInt& y) {
   24|  13.9k|   if(&y == this) {
  ------------------
  |  Branch (24:7): [True: 0, False: 13.9k]
  ------------------
   25|      0|      this->clear();
   26|      0|      this->set_sign(Positive);
   27|      0|      return *this;
   28|      0|   }
   29|  13.9k|   return sub(y._data(), y.sig_words(), y.sign());
   30|  13.9k|}
_ZN5Botan6BigInt3addEPKmmNS0_4SignE:
   32|  14.2k|BigInt& BigInt::add(const word y[], size_t y_words, Sign y_sign) {
   33|  14.2k|   const size_t x_sw = sig_words();
   34|       |
   35|  14.2k|   grow_to(std::max(x_sw, y_words) + 1);
   36|       |
   37|  14.2k|   if(sign() == y_sign) {
  ------------------
  |  Branch (37:7): [True: 0, False: 14.2k]
  ------------------
   38|      0|      const word carry = bigint_add2(mutable_data(), size() - 1, y, y_words);
   39|      0|      mutable_data()[size() - 1] += carry;
   40|  14.2k|   } else {
   41|  14.2k|      const int32_t relative_size = bigint_cmp(_data(), x_sw, y, y_words);
   42|       |
   43|  14.2k|      if(relative_size >= 0) {
  ------------------
  |  Branch (43:10): [True: 13.5k, False: 730]
  ------------------
   44|       |         // *this >= y
   45|  13.5k|         bigint_sub2(mutable_data(), x_sw, y, y_words);
   46|  13.5k|      } else {
   47|       |         // *this < y: compute *this = y - *this
   48|    730|         bigint_sub2_rev(mutable_data(), y, y_words);
   49|    730|      }
   50|       |
   51|  14.2k|      if(relative_size < 0) {
  ------------------
  |  Branch (51:10): [True: 730, False: 13.5k]
  ------------------
   52|    730|         set_sign(y_sign);
   53|  13.5k|      } else if(relative_size == 0) {
  ------------------
  |  Branch (53:17): [True: 504, False: 13.0k]
  ------------------
   54|    504|         set_sign(Positive);
   55|    504|      }
   56|  14.2k|   }
   57|       |
   58|  14.2k|   return (*this);
   59|  14.2k|}
_ZN5Botan6BigIntlSEm:
  269|  5.25k|BigInt& BigInt::operator<<=(size_t shift) {
  270|  5.25k|   if(shift >= 65536) {
  ------------------
  |  Branch (270:7): [True: 0, False: 5.25k]
  ------------------
  271|      0|      throw Invalid_Argument("BigInt left shift count too large");
  272|      0|   }
  273|       |
  274|  5.25k|   const size_t sw = sig_words();
  275|  5.25k|   const size_t new_size = sw + (shift + WordInfo<word>::bits - 1) / WordInfo<word>::bits;
  276|       |
  277|  5.25k|   m_data.grow_to(new_size);
  278|       |
  279|  5.25k|   bigint_shl1(m_data.mutable_data(), new_size, sw, shift);
  280|       |
  281|  5.25k|   return (*this);
  282|  5.25k|}
_ZN5Botan6BigIntrSEm:
  287|  18.4k|BigInt& BigInt::operator>>=(size_t shift) {
  288|  18.4k|   bigint_shr1(m_data.mutable_data(), m_data.size(), shift);
  289|       |
  290|  18.4k|   if(sig_words() == 0 && m_signedness == Negative) {
  ------------------
  |  Branch (290:7): [True: 543, False: 17.9k]
  |  Branch (290:27): [True: 0, False: 543]
  ------------------
  291|      0|      m_signedness = Positive;
  292|      0|   }
  293|       |
  294|  18.4k|   return (*this);
  295|  18.4k|}

_ZN5Botan6BigInt4add2ERKS0_PKmmNS0_4SignE:
   20|  3.31k|BigInt BigInt::add2(const BigInt& x, const word y[], size_t y_size, BigInt::Sign y_sign) {
   21|  3.31k|   const size_t x_sw = x.sig_words();
   22|       |
   23|  3.31k|   BigInt z = BigInt::with_capacity(std::max(x_sw, y_size) + 1);
   24|       |
   25|  3.31k|   if(x.sign() == y_sign) {
  ------------------
  |  Branch (25:7): [True: 3.31k, False: 0]
  ------------------
   26|  3.31k|      const word carry = bigint_add3(z.mutable_data(), x._data(), x_sw, y, y_size);
   27|  3.31k|      z.mutable_data()[std::max(x_sw, y_size)] += carry;
   28|  3.31k|      z.set_sign(x.sign());
   29|  3.31k|   } else {
   30|      0|      const int32_t relative_size = bigint_cmp(x.data(), x_sw, y, y_size);
   31|       |
   32|      0|      if(relative_size < 0) {
  ------------------
  |  Branch (32:10): [True: 0, False: 0]
  ------------------
   33|       |         // x < y so z = abs(y - x)
   34|       |         // NOLINTNEXTLINE(*-suspicious-call-argument) intentionally swapping x and y here
   35|      0|         bigint_sub3(z.mutable_data(), y, y_size, x.data(), x_sw);
   36|      0|         z.set_sign(y_sign);
   37|      0|      } else if(relative_size == 0) {
  ------------------
  |  Branch (37:17): [True: 0, False: 0]
  ------------------
   38|       |         // Positive zero (nothing to do in this case)
   39|      0|      } else {
   40|       |         /*
   41|       |         * We know at this point that x >= y so if y_size is larger than
   42|       |         * x_sw, we are guaranteed they are just leading zeros which can
   43|       |         * be ignored
   44|       |         */
   45|      0|         y_size = std::min(x_sw, y_size);
   46|      0|         bigint_sub3(z.mutable_data(), x.data(), x_sw, y, y_size);
   47|      0|         z.set_sign(x.sign());
   48|      0|      }
   49|      0|   }
   50|       |
   51|  3.31k|   return z;
   52|  3.31k|}
_ZN5BotanmlERKNS_6BigIntES2_:
   57|  3.31k|BigInt operator*(const BigInt& x, const BigInt& y) {
   58|  3.31k|   const size_t x_sw = x.sig_words();
   59|  3.31k|   const size_t y_sw = y.sig_words();
   60|       |
   61|  3.31k|   BigInt z = BigInt::with_capacity(x.size() + y.size());
   62|       |
   63|  3.31k|   if(x_sw == 1 && y_sw > 0) {
  ------------------
  |  Branch (63:7): [True: 1.54k, False: 1.76k]
  |  Branch (63:20): [True: 1.54k, False: 0]
  ------------------
   64|  1.54k|      bigint_linmul3(z.mutable_data(), y._data(), y_sw, x.word_at(0));
   65|  1.76k|   } else if(y_sw == 1 && x_sw > 0) {
  ------------------
  |  Branch (65:14): [True: 1.32k, False: 444]
  |  Branch (65:27): [True: 789, False: 536]
  ------------------
   66|    789|      bigint_linmul3(z.mutable_data(), x._data(), x_sw, y.word_at(0));
   67|    980|   } else if(x_sw > 0 && y_sw > 0) {
  ------------------
  |  Branch (67:14): [True: 235, False: 745]
  |  Branch (67:26): [True: 235, False: 0]
  ------------------
   68|    235|      secure_vector<word> workspace(z.size());
   69|       |
   70|    235|      bigint_mul(z.mutable_data(),
   71|    235|                 z.size(),
   72|    235|                 x._data(),
   73|    235|                 x.size(),
   74|    235|                 x_sw,
   75|    235|                 y._data(),
   76|    235|                 y.size(),
   77|    235|                 y_sw,
   78|    235|                 workspace.data(),
   79|    235|                 workspace.size());
   80|    235|   }
   81|       |
   82|  3.31k|   z.cond_flip_sign(x_sw > 0 && y_sw > 0 && x.sign() != y.sign());
  ------------------
  |  Branch (82:21): [True: 2.56k, False: 745]
  |  Branch (82:33): [True: 2.56k, False: 0]
  |  Branch (82:45): [True: 0, False: 2.56k]
  ------------------
   83|       |
   84|  3.31k|   return z;
   85|  3.31k|}
_ZN5BotanmlERKNS_6BigIntEm:
   90|  13.9k|BigInt operator*(const BigInt& x, word y) {
   91|  13.9k|   const size_t x_sw = x.sig_words();
   92|       |
   93|  13.9k|   BigInt z = BigInt::with_capacity(x_sw + 1);
   94|       |
   95|  13.9k|   if(x_sw > 0 && y > 0) {
  ------------------
  |  Branch (95:7): [True: 13.9k, False: 0]
  |  Branch (95:19): [True: 13.9k, False: 0]
  ------------------
   96|  13.9k|      bigint_linmul3(z.mutable_data(), x._data(), x_sw, y);
   97|  13.9k|      z.set_sign(x.sign());
   98|  13.9k|   }
   99|       |
  100|  13.9k|   return z;
  101|  13.9k|}
_ZN5BotanlsERKNS_6BigIntEm:
  188|  3.31k|BigInt operator<<(const BigInt& x, size_t shift) {
  189|  3.31k|   if(shift >= 65536) {
  ------------------
  |  Branch (189:7): [True: 0, False: 3.31k]
  ------------------
  190|      0|      throw Invalid_Argument("BigInt left shift count too large");
  191|      0|   }
  192|       |
  193|  3.31k|   if(x.is_zero()) {
  ------------------
  |  Branch (193:7): [True: 0, False: 3.31k]
  ------------------
  194|      0|      return BigInt::zero();
  195|      0|   }
  196|       |
  197|  3.31k|   const size_t x_sw = x.sig_words();
  198|       |
  199|  3.31k|   const size_t new_size = x_sw + shift / WordInfo<word>::bits + 1;
  200|  3.31k|   BigInt y = BigInt::with_capacity(new_size);
  201|  3.31k|   bigint_shl2(y.mutable_data(), new_size, x._data(), x_sw, shift);
  202|  3.31k|   y.set_sign(x.sign());
  203|  3.31k|   return y;
  204|  3.31k|}

_ZN5Botan6BigIntC2Em:
   20|  1.66k|BigInt::BigInt(uint64_t n) {
   21|  1.66k|   if constexpr(sizeof(word) == 8) {
   22|  1.66k|      m_data.set_word_at(0, static_cast<word>(n));
   23|       |   } else {
   24|       |      m_data.set_word_at(1, static_cast<word>(n >> 32));
   25|       |      m_data.set_word_at(0, static_cast<word>(n));
   26|       |   }
   27|  1.66k|}
_ZN5Botan6BigInt13with_capacityEm:
   51|  30.4k|BigInt BigInt::with_capacity(size_t size) {
   52|  30.4k|   BigInt bn;
   53|  30.4k|   bn.grow_to(size);
   54|  30.4k|   return bn;
   55|  30.4k|}
_ZN5Botan6BigInt10from_bytesENSt3__14spanIKhLm18446744073709551615EEE:
   83|  3.34k|BigInt BigInt::from_bytes(std::span<const uint8_t> input) {
   84|  3.34k|   BigInt r;
   85|  3.34k|   r.assign_from_bytes(input);
   86|  3.34k|   return r;
   87|  3.34k|}
_ZNK5Botan6BigInt8cmp_wordEm:
  122|  3.33k|int32_t BigInt::cmp_word(word other) const {
  123|  3.33k|   if(signum() < 0) {
  ------------------
  |  Branch (123:7): [True: 0, False: 3.33k]
  ------------------
  124|      0|      return -1;  // other is positive ...
  125|      0|   }
  126|       |
  127|  3.33k|   const size_t sw = this->sig_words();
  128|  3.33k|   if(sw > 1) {
  ------------------
  |  Branch (128:7): [True: 871, False: 2.46k]
  ------------------
  129|    871|      return 1;  // must be larger since other is just one word ...
  130|    871|   }
  131|       |
  132|  2.46k|   return bigint_cmp(this->_data(), sw, &other, 1);
  133|  3.33k|}
_ZNK5Botan6BigInt8is_equalERKS0_:
  156|  8.29k|bool BigInt::is_equal(const BigInt& other) const {
  157|  8.29k|   if(this->sign() != other.sign()) {
  ------------------
  |  Branch (157:7): [True: 0, False: 8.29k]
  ------------------
  158|      0|      return false;
  159|      0|   }
  160|       |
  161|  8.29k|   return bigint_ct_is_eq(this->_data(), this->size(), other._data(), other.size()).as_bool();
  162|  8.29k|}
_ZNK5Botan6BigInt12is_less_thanERKS0_:
  164|  3.31k|bool BigInt::is_less_than(const BigInt& other) const {
  165|  3.31k|   if(this->signum() < 0 && other.signum() >= 0) {
  ------------------
  |  Branch (165:7): [True: 0, False: 3.31k]
  |  Branch (165:29): [True: 0, False: 0]
  ------------------
  166|      0|      return true;
  167|      0|   }
  168|       |
  169|  3.31k|   if(this->signum() >= 0 && other.signum() < 0) {
  ------------------
  |  Branch (169:7): [True: 3.31k, False: 0]
  |  Branch (169:30): [True: 0, False: 3.31k]
  ------------------
  170|      0|      return false;
  171|      0|   }
  172|       |
  173|  3.31k|   if(other.signum() < 0 && this->signum() < 0) {
  ------------------
  |  Branch (173:7): [True: 0, False: 3.31k]
  |  Branch (173:29): [True: 0, False: 0]
  ------------------
  174|      0|      return bigint_ct_is_lt(other._data(), other.size(), this->_data(), this->size()).as_bool();
  175|      0|   }
  176|       |
  177|  3.31k|   return bigint_ct_is_lt(this->_data(), this->size(), other._data(), other.size()).as_bool();
  178|  3.31k|}
_ZN5Botan6BigInt4Data11set_to_zeroEv:
  191|  3.34k|void BigInt::Data::set_to_zero() {
  192|  3.34k|   m_reg.resize(m_reg.capacity());
  193|  3.34k|   clear_mem(m_reg.data(), m_reg.size());
  194|  3.34k|   m_sig_words = 0;
  195|  3.34k|}
_ZNK5Botan6BigInt4Data14calc_sig_wordsEv:
  215|  68.6k|size_t BigInt::Data::calc_sig_words() const {
  216|  68.6k|   const size_t sz = m_reg.size();
  217|  68.6k|   size_t sig = sz;
  218|       |
  219|  68.6k|   word sub = 1;
  220|       |
  221|  1.97M|   for(size_t i = 0; i != sz; ++i) {
  ------------------
  |  Branch (221:22): [True: 1.90M, False: 68.6k]
  ------------------
  222|  1.90M|      const word w = m_reg[sz - i - 1];
  223|  1.90M|      sub &= ct_is_zero(w);
  224|  1.90M|      sig -= sub;
  225|  1.90M|   }
  226|       |
  227|       |   /*
  228|       |   * This depends on the data so is poisoned, but unpoison it here as
  229|       |   * later conditionals are made on the size.
  230|       |   */
  231|  68.6k|   CT::unpoison(sig);
  232|       |
  233|  68.6k|   return sig;
  234|  68.6k|}
_ZNK5Botan6BigInt13top_bits_freeEv:
  298|  6.54k|size_t BigInt::top_bits_free() const {
  299|  6.54k|   const size_t words = sig_words();
  300|       |
  301|  6.54k|   const word top_word = word_at(words - 1);
  302|  6.54k|   const size_t bits_used = high_bit(CT::value_barrier(top_word));
  303|  6.54k|   CT::unpoison(bits_used);
  304|  6.54k|   return WordInfo<word>::bits - bits_used;
  305|  6.54k|}
_ZNK5Botan6BigInt4bitsEv:
  307|  3.31k|size_t BigInt::bits() const {
  308|  3.31k|   const size_t words = sig_words();
  309|       |
  310|  3.31k|   if(words == 0) {
  ------------------
  |  Branch (310:7): [True: 75, False: 3.23k]
  ------------------
  311|     75|      return 0;
  312|     75|   }
  313|       |
  314|  3.23k|   const size_t full_words = (words - 1) * WordInfo<word>::bits;
  315|  3.23k|   const size_t top_bits = WordInfo<word>::bits - top_bits_free();
  316|       |
  317|  3.23k|   return full_words + top_bits;
  318|  3.31k|}
_ZN5Botan6BigInt12reduce_belowERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  329|  3.31k|size_t BigInt::reduce_below(const BigInt& p, secure_vector<word>& ws) {
  330|  3.31k|   if(p.signum() < 0 || this->signum() < 0) {
  ------------------
  |  Branch (330:7): [True: 0, False: 3.31k]
  |  Branch (330:25): [True: 0, False: 3.31k]
  ------------------
  331|      0|      throw Invalid_Argument("BigInt::reduce_below both values must be positive");
  332|      0|   }
  333|       |
  334|  3.31k|   const size_t p_words = p.sig_words();
  335|       |
  336|  3.31k|   if(size() < p_words + 1) {
  ------------------
  |  Branch (336:7): [True: 142, False: 3.16k]
  ------------------
  337|    142|      grow_to(p_words + 1);
  338|    142|   }
  339|       |
  340|  3.31k|   if(ws.size() < p_words + 1) {
  ------------------
  |  Branch (340:7): [True: 3.31k, False: 0]
  ------------------
  341|  3.31k|      ws.resize(p_words + 1);
  342|  3.31k|   }
  343|       |
  344|  3.31k|   clear_mem(ws.data(), ws.size());
  345|       |
  346|  3.31k|   size_t reductions = 0;
  347|       |
  348|  3.47k|   for(;;) {
  349|  3.47k|      const word borrow = bigint_sub3(ws.data(), _data(), p_words + 1, p._data(), p_words);
  350|  3.47k|      if(borrow > 0) {
  ------------------
  |  Branch (350:10): [True: 3.31k, False: 163]
  ------------------
  351|  3.31k|         break;
  352|  3.31k|      }
  353|       |
  354|    163|      ++reductions;
  355|    163|      swap_reg(ws);
  356|    163|   }
  357|       |
  358|  3.31k|   return reductions;
  359|  3.31k|}
_ZN5Botan6BigInt17assign_from_bytesENSt3__14spanIKhLm18446744073709551615EEE:
  425|  3.34k|void BigInt::assign_from_bytes(std::span<const uint8_t> bytes) {
  426|  3.34k|   clear();
  427|       |
  428|  3.34k|   const size_t length = bytes.size();
  429|  3.34k|   const size_t full_words = length / sizeof(word);
  430|  3.34k|   const size_t extra_bytes = length % sizeof(word);
  431|       |
  432|  3.34k|   secure_vector<word> reg((round_up(full_words + (extra_bytes > 0 ? 1 : 0), 8)));
  ------------------
  |  Branch (432:52): [True: 2.70k, False: 635]
  ------------------
  433|       |
  434|  24.2k|   for(size_t i = 0; i != full_words; ++i) {
  ------------------
  |  Branch (434:22): [True: 20.9k, False: 3.34k]
  ------------------
  435|  20.9k|      reg[i] = load_be<word>(bytes.last<sizeof(word)>());
  436|  20.9k|      bytes = bytes.first(bytes.size() - sizeof(word));
  437|  20.9k|   }
  438|       |
  439|  3.34k|   if(!bytes.empty()) {
  ------------------
  |  Branch (439:7): [True: 2.70k, False: 635]
  ------------------
  440|  2.70k|      BOTAN_ASSERT_NOMSG(extra_bytes == bytes.size());
  ------------------
  |  |   77|  2.70k|   do {                                                                     \
  |  |   78|  2.70k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|  2.70k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 2.70k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|  2.70k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 2.70k]
  |  |  ------------------
  ------------------
  441|  2.70k|      std::array<uint8_t, sizeof(word)> last_partial_word = {0};
  442|  2.70k|      copy_mem(std::span{last_partial_word}.last(extra_bytes), bytes);
  443|  2.70k|      reg[full_words] = load_be<word>(last_partial_word);
  444|  2.70k|   }
  445|       |
  446|  3.34k|   m_data.swap(reg);
  447|  3.34k|}
_ZN5Botan6BigInt14cond_flip_signEb:
  521|  8.29k|void BigInt::cond_flip_sign(bool predicate) {
  522|       |   // This code is assuming Negative == 0, Positive == 1
  523|       |
  524|  8.29k|   const auto mask = CT::Mask<uint8_t>::expand_bool(predicate);
  525|       |
  526|  8.29k|   const uint8_t current_sign = static_cast<uint8_t>(sign());
  527|       |
  528|  8.29k|   const uint8_t new_sign = mask.select(current_sign ^ 1, current_sign);
  529|       |
  530|  8.29k|   set_sign(static_cast<Sign>(new_sign));
  531|  8.29k|}
_ZNK5Botan6BigInt20_const_time_unpoisonEv:
  559|  45.4k|void BigInt::_const_time_unpoison() const {
  560|  45.4k|   CT::unpoison(m_data.const_data(), m_data.size());
  561|  45.4k|}

_ZN5Botan9ct_divideERKNS_6BigIntES2_RS0_S3_:
   55|  1.66k|void ct_divide(const BigInt& x, const BigInt& y, BigInt& q_out, BigInt& r_out) {
   56|  1.66k|   if(y.is_zero()) {
  ------------------
  |  Branch (56:7): [True: 0, False: 1.66k]
  ------------------
   57|      0|      throw Invalid_Argument("ct_divide: cannot divide by zero");
   58|      0|   }
   59|       |
   60|  1.66k|   const size_t x_words = x.sig_words();
   61|  1.66k|   const size_t y_words = y.sig_words();
   62|       |
   63|  1.66k|   const size_t x_bits = x.bits();
   64|       |
   65|  1.66k|   const size_t r_words = y_words + 1;
   66|       |
   67|  1.66k|   BigInt q = BigInt::with_capacity(x_words);
   68|  1.66k|   BigInt r = BigInt::with_capacity(r_words);
   69|  1.66k|   BigInt t = BigInt::with_capacity(r_words);  // a temporary
   70|       |
   71|   667k|   for(size_t i = 0; i != x_bits; ++i) {
  ------------------
  |  Branch (71:22): [True: 665k, False: 1.66k]
  ------------------
   72|   665k|      const size_t b = x_bits - 1 - i;
   73|   665k|      const bool x_b = x.get_bit(b);
   74|       |
   75|   665k|      bigint_shl1(r.mutable_data(), r_words, r_words, 1);
   76|   665k|      r.conditionally_set_bit(0, x_b);
   77|       |
   78|   665k|      const bool r_gte_y = bigint_sub3(t.mutable_data(), r._data(), r_words, y._data(), y_words) == 0;
   79|       |
   80|   665k|      q.conditionally_set_bit(b, r_gte_y);
   81|   665k|      bigint_cnd_swap(static_cast<word>(r_gte_y), r.mutable_data(), t.mutable_data(), r_words);
   82|   665k|   }
   83|       |
   84|  1.66k|   sign_fixup(x, y, q, r);
   85|  1.66k|   r_out = r;
   86|  1.66k|   q_out = q;
   87|  1.66k|}
_ZN5Botan14ct_divide_wordERKNS_6BigIntEmRS0_Rm:
  129|  1.64k|void ct_divide_word(const BigInt& x, word y, BigInt& q_out, word& r_out) {
  130|  1.64k|   if(y == 0) {
  ------------------
  |  Branch (130:7): [True: 0, False: 1.64k]
  ------------------
  131|      0|      throw Invalid_Argument("ct_divide_word: cannot divide by zero");
  132|      0|   }
  133|       |
  134|  1.64k|   const size_t x_words = x.sig_words();
  135|  1.64k|   const size_t x_bits = x.bits();
  136|       |
  137|  1.64k|   BigInt q = BigInt::with_capacity(x_words);
  138|  1.64k|   word r = 0;
  139|       |
  140|   643k|   for(size_t i = 0; i != x_bits; ++i) {
  ------------------
  |  Branch (140:22): [True: 642k, False: 1.64k]
  ------------------
  141|   642k|      const size_t b = x_bits - 1 - i;
  142|   642k|      const bool x_b = x.get_bit(b);
  143|       |
  144|   642k|      const auto r_carry = CT::Mask<word>::expand_top_bit(r);
  145|       |
  146|   642k|      r <<= 1;
  147|   642k|      r += static_cast<word>(x_b);
  148|       |
  149|   642k|      const auto r_gte_y = CT::Mask<word>::is_gte(r, y) | r_carry;
  150|   642k|      q.conditionally_set_bit(b, r_gte_y.as_bool());
  151|   642k|      r = r_gte_y.select(r - y, r);
  152|   642k|   }
  153|       |
  154|  1.64k|   if(x.signum() < 0) {
  ------------------
  |  Branch (154:7): [True: 0, False: 1.64k]
  ------------------
  155|      0|      q.flip_sign();
  156|      0|      if(r != 0) {
  ------------------
  |  Branch (156:10): [True: 0, False: 0]
  ------------------
  157|      0|         --q;
  158|      0|         r = y - r;
  159|      0|      }
  160|      0|   }
  161|       |
  162|  1.64k|   r_out = r;
  163|  1.64k|   q_out = q;
  164|  1.64k|}
_ZN5Botan14vartime_divideERKNS_6BigIntES2_RS0_S3_:
  332|  3.31k|void vartime_divide(const BigInt& x, const BigInt& y_arg, BigInt& q_out, BigInt& r_out) {
  333|  3.31k|   constexpr size_t WB = WordInfo<word>::bits;
  334|       |
  335|  3.31k|   if(y_arg.is_zero()) {
  ------------------
  |  Branch (335:7): [True: 0, False: 3.31k]
  ------------------
  336|      0|      throw Invalid_Argument("vartime_divide: cannot divide by zero");
  337|      0|   }
  338|       |
  339|  3.31k|   const size_t y_words = y_arg.sig_words();
  340|       |
  341|  3.31k|   BOTAN_ASSERT_NOMSG(y_words > 0);
  ------------------
  |  |   77|  3.31k|   do {                                                                     \
  |  |   78|  3.31k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|  3.31k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 3.31k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|  3.31k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 3.31k]
  |  |  ------------------
  ------------------
  342|       |
  343|  3.31k|   BigInt y = y_arg;
  344|       |
  345|  3.31k|   BigInt r = x;
  346|  3.31k|   BigInt q = BigInt::zero();
  347|  3.31k|   secure_vector<word> ws;
  348|       |
  349|  3.31k|   r.set_sign(BigInt::Positive);
  350|  3.31k|   y.set_sign(BigInt::Positive);
  351|       |
  352|       |   // Calculate shifts needed to normalize y with high bit set
  353|  3.31k|   const size_t shifts = y.top_bits_free();
  354|       |
  355|  3.31k|   if(shifts > 0) {
  ------------------
  |  Branch (355:7): [True: 2.62k, False: 684]
  ------------------
  356|  2.62k|      y <<= shifts;
  357|  2.62k|      r <<= shifts;
  358|  2.62k|   }
  359|       |
  360|       |   // we know y has not changed size, since we only shifted up to set high bit
  361|  3.31k|   const size_t t = y_words - 1;
  362|  3.31k|   const size_t n = std::max(y_words, r.sig_words()) - 1;  // r may have changed size however
  363|       |
  364|  3.31k|   BOTAN_ASSERT_NOMSG(n >= t);
  ------------------
  |  |   77|  3.31k|   do {                                                                     \
  |  |   78|  3.31k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|  3.31k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 3.31k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|  3.31k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 3.31k]
  |  |  ------------------
  ------------------
  365|       |
  366|  3.31k|   q.grow_to(n - t + 1);
  367|       |
  368|  3.31k|   word* q_words = q.mutable_data();
  369|       |
  370|  3.31k|   BigInt shifted_y = y << (WB * (n - t));
  371|       |
  372|       |   // Set q_{n-t} to number of times r > shifted_y
  373|  3.31k|   q_words[n - t] = r.reduce_below(shifted_y, ws);
  374|       |
  375|  3.31k|   const word y_t0 = y.word_at(t);
  376|  3.31k|   const word y_t1 = y.word_at(t - 1);
  377|  3.31k|   BOTAN_DEBUG_ASSERT((y_t0 >> (WB - 1)) == 1);
  ------------------
  |  |  130|  3.31k|      do { /* NOLINT(*-avoid-do-while) */ \
  |  |  131|  3.31k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (131:15): [Folded, False: 3.31k]
  |  |  ------------------
  ------------------
  378|       |
  379|  3.31k|   const divide_precomp div_y_t0(y_t0);
  380|       |
  381|  19.1k|   for(size_t i = n; i != t; --i) {
  ------------------
  |  Branch (381:22): [True: 15.8k, False: 3.31k]
  ------------------
  382|  15.8k|      const word x_i0 = r.word_at(i);
  383|  15.8k|      const word x_i1 = r.word_at(i - 1);
  384|  15.8k|      const word x_i2 = r.word_at(i - 2);
  385|       |
  386|  15.8k|      word qit = (x_i0 == y_t0) ? WordInfo<word>::max : div_y_t0.vartime_div_2to1(x_i0, x_i1);
  ------------------
  |  Branch (386:18): [True: 324, False: 15.5k]
  ------------------
  387|       |
  388|       |      // Per HAC 14.23, this operation is required at most twice
  389|  17.2k|      for(size_t j = 0; j != 2; ++j) {
  ------------------
  |  Branch (389:25): [True: 17.1k, False: 131]
  ------------------
  390|  17.1k|         if(division_check_vartime(qit, y_t0, y_t1, x_i0, x_i1, x_i2)) {
  ------------------
  |  Branch (390:13): [True: 1.37k, False: 15.7k]
  ------------------
  391|  1.37k|            BOTAN_ASSERT_NOMSG(qit > 0);
  ------------------
  |  |   77|  1.37k|   do {                                                                     \
  |  |   78|  1.37k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|  1.37k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 1.37k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|  1.37k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1.37k]
  |  |  ------------------
  ------------------
  392|  1.37k|            qit--;
  393|  15.7k|         } else {
  394|  15.7k|            break;
  395|  15.7k|         }
  396|  17.1k|      }
  397|       |
  398|  15.8k|      shifted_y >>= WB;
  399|       |      // Now shifted_y == y << (WB * (i-t-1))
  400|       |
  401|  15.8k|      if(qit != 0) {
  ------------------
  |  Branch (401:10): [True: 13.9k, False: 1.95k]
  ------------------
  402|  13.9k|         r -= qit * shifted_y;
  403|  13.9k|         if(r.signum() < 0) {
  ------------------
  |  Branch (403:13): [True: 365, False: 13.5k]
  ------------------
  404|    365|            BOTAN_ASSERT_NOMSG(qit > 0);
  ------------------
  |  |   77|    365|   do {                                                                     \
  |  |   78|    365|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|    365|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 365]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|    365|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 365]
  |  |  ------------------
  ------------------
  405|    365|            qit--;
  406|    365|            r += shifted_y;
  407|    365|            BOTAN_ASSERT_NOMSG(r.signum() >= 0);
  ------------------
  |  |   77|    365|   do {                                                                     \
  |  |   78|    365|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|    365|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 365]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|    365|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 365]
  |  |  ------------------
  ------------------
  408|    365|         }
  409|  13.9k|      }
  410|       |
  411|  15.8k|      q_words[i - t - 1] = qit;
  412|  15.8k|   }
  413|       |
  414|  3.31k|   if(shifts > 0) {
  ------------------
  |  Branch (414:7): [True: 2.62k, False: 684]
  ------------------
  415|  2.62k|      r >>= shifts;
  416|  2.62k|   }
  417|       |
  418|  3.31k|   sign_fixup(x, y_arg, q, r);
  419|       |
  420|  3.31k|   r_out = r;
  421|  3.31k|   q_out = q;
  422|  3.31k|}
divide.cpp:_ZN5Botan12_GLOBAL__N_110sign_fixupERKNS_6BigIntES3_RS1_S4_:
   21|  4.97k|void sign_fixup(const BigInt& x, const BigInt& y, BigInt& q, BigInt& r) {
   22|  4.97k|   q.cond_flip_sign(x.sign() != y.sign());
   23|       |
   24|  4.97k|   if(x.signum() < 0 && r.signum() != 0) {
  ------------------
  |  Branch (24:7): [True: 0, False: 4.97k]
  |  Branch (24:25): [True: 0, False: 0]
  ------------------
   25|      0|      if(y.signum() > 0) {
  ------------------
  |  Branch (25:10): [True: 0, False: 0]
  ------------------
   26|      0|         q -= 1;
   27|      0|      } else {
   28|      0|         q += 1;
   29|      0|      }
   30|      0|      r = y.abs() - r;
   31|      0|   }
   32|  4.97k|}
divide.cpp:_ZN5Botan12_GLOBAL__N_122division_check_vartimeEmmmmmm:
   34|  17.1k|inline bool division_check_vartime(word q, word y2, word y1, word x3, word x2, word x1) {
   35|       |   /*
   36|       |   Compute (y3,y2,y1) = (y2,y1) * q
   37|       |   and return true if (y3,y2,y1) > (x3,x2,x1)
   38|       |   */
   39|       |
   40|  17.1k|   word y3 = 0;
   41|  17.1k|   y1 = word_madd2(q, y1, &y3);
   42|  17.1k|   y2 = word_madd2(q, y2, &y3);
   43|       |
   44|  17.1k|   if(x3 != y3) {
  ------------------
  |  Branch (44:7): [True: 8.19k, False: 8.90k]
  ------------------
   45|  8.19k|      return (y3 > x3);
   46|  8.19k|   }
   47|  8.90k|   if(x2 != y2) {
  ------------------
  |  Branch (47:7): [True: 5.93k, False: 2.97k]
  ------------------
   48|  5.93k|      return (y2 > x2);
   49|  5.93k|   }
   50|  2.97k|   return (y1 > x1);
   51|  8.90k|}

_ZN5Botan17bigint_comba_mul4EPmPKmS2_:
   43|     36|void bigint_comba_mul4(word z[8], const word x[4], const word y[4]) {
   44|     36|   word3<word> accum;
   45|       |
   46|     36|   accum.mul(x[0], y[0]);
   47|     36|   z[0] = accum.extract();
   48|     36|   accum.mul(x[0], y[1]);
   49|     36|   accum.mul(x[1], y[0]);
   50|     36|   z[1] = accum.extract();
   51|     36|   accum.mul(x[0], y[2]);
   52|     36|   accum.mul(x[1], y[1]);
   53|     36|   accum.mul(x[2], y[0]);
   54|     36|   z[2] = accum.extract();
   55|     36|   accum.mul(x[0], y[3]);
   56|     36|   accum.mul(x[1], y[2]);
   57|     36|   accum.mul(x[2], y[1]);
   58|     36|   accum.mul(x[3], y[0]);
   59|     36|   z[3] = accum.extract();
   60|     36|   accum.mul(x[1], y[3]);
   61|     36|   accum.mul(x[2], y[2]);
   62|     36|   accum.mul(x[3], y[1]);
   63|     36|   z[4] = accum.extract();
   64|     36|   accum.mul(x[2], y[3]);
   65|     36|   accum.mul(x[3], y[2]);
   66|     36|   z[5] = accum.extract();
   67|     36|   accum.mul(x[3], y[3]);
   68|     36|   z[6] = accum.extract();
   69|     36|   z[7] = accum.extract();
   70|     36|}
_ZN5Botan17bigint_comba_mul6EPmPKmS2_:
  116|     22|void bigint_comba_mul6(word z[12], const word x[6], const word y[6]) {
  117|     22|   word3<word> accum;
  118|       |
  119|     22|   accum.mul(x[0], y[0]);
  120|     22|   z[0] = accum.extract();
  121|     22|   accum.mul(x[0], y[1]);
  122|     22|   accum.mul(x[1], y[0]);
  123|     22|   z[1] = accum.extract();
  124|     22|   accum.mul(x[0], y[2]);
  125|     22|   accum.mul(x[1], y[1]);
  126|     22|   accum.mul(x[2], y[0]);
  127|     22|   z[2] = accum.extract();
  128|     22|   accum.mul(x[0], y[3]);
  129|     22|   accum.mul(x[1], y[2]);
  130|     22|   accum.mul(x[2], y[1]);
  131|     22|   accum.mul(x[3], y[0]);
  132|     22|   z[3] = accum.extract();
  133|     22|   accum.mul(x[0], y[4]);
  134|     22|   accum.mul(x[1], y[3]);
  135|     22|   accum.mul(x[2], y[2]);
  136|     22|   accum.mul(x[3], y[1]);
  137|     22|   accum.mul(x[4], y[0]);
  138|     22|   z[4] = accum.extract();
  139|     22|   accum.mul(x[0], y[5]);
  140|     22|   accum.mul(x[1], y[4]);
  141|     22|   accum.mul(x[2], y[3]);
  142|     22|   accum.mul(x[3], y[2]);
  143|     22|   accum.mul(x[4], y[1]);
  144|     22|   accum.mul(x[5], y[0]);
  145|     22|   z[5] = accum.extract();
  146|     22|   accum.mul(x[1], y[5]);
  147|     22|   accum.mul(x[2], y[4]);
  148|     22|   accum.mul(x[3], y[3]);
  149|     22|   accum.mul(x[4], y[2]);
  150|     22|   accum.mul(x[5], y[1]);
  151|     22|   z[6] = accum.extract();
  152|     22|   accum.mul(x[2], y[5]);
  153|     22|   accum.mul(x[3], y[4]);
  154|     22|   accum.mul(x[4], y[3]);
  155|     22|   accum.mul(x[5], y[2]);
  156|     22|   z[7] = accum.extract();
  157|     22|   accum.mul(x[3], y[5]);
  158|     22|   accum.mul(x[4], y[4]);
  159|     22|   accum.mul(x[5], y[3]);
  160|     22|   z[8] = accum.extract();
  161|     22|   accum.mul(x[4], y[5]);
  162|     22|   accum.mul(x[5], y[4]);
  163|     22|   z[9] = accum.extract();
  164|     22|   accum.mul(x[5], y[5]);
  165|     22|   z[10] = accum.extract();
  166|     22|   z[11] = accum.extract();
  167|     22|}
_ZN5Botan17bigint_comba_mul8EPmPKmS2_:
  353|     14|void bigint_comba_mul8(word z[16], const word x[8], const word y[8]) {
  354|     14|   word3<word> accum;
  355|       |
  356|     14|   accum.mul(x[0], y[0]);
  357|     14|   z[0] = accum.extract();
  358|     14|   accum.mul(x[0], y[1]);
  359|     14|   accum.mul(x[1], y[0]);
  360|     14|   z[1] = accum.extract();
  361|     14|   accum.mul(x[0], y[2]);
  362|     14|   accum.mul(x[1], y[1]);
  363|     14|   accum.mul(x[2], y[0]);
  364|     14|   z[2] = accum.extract();
  365|     14|   accum.mul(x[0], y[3]);
  366|     14|   accum.mul(x[1], y[2]);
  367|     14|   accum.mul(x[2], y[1]);
  368|     14|   accum.mul(x[3], y[0]);
  369|     14|   z[3] = accum.extract();
  370|     14|   accum.mul(x[0], y[4]);
  371|     14|   accum.mul(x[1], y[3]);
  372|     14|   accum.mul(x[2], y[2]);
  373|     14|   accum.mul(x[3], y[1]);
  374|     14|   accum.mul(x[4], y[0]);
  375|     14|   z[4] = accum.extract();
  376|     14|   accum.mul(x[0], y[5]);
  377|     14|   accum.mul(x[1], y[4]);
  378|     14|   accum.mul(x[2], y[3]);
  379|     14|   accum.mul(x[3], y[2]);
  380|     14|   accum.mul(x[4], y[1]);
  381|     14|   accum.mul(x[5], y[0]);
  382|     14|   z[5] = accum.extract();
  383|     14|   accum.mul(x[0], y[6]);
  384|     14|   accum.mul(x[1], y[5]);
  385|     14|   accum.mul(x[2], y[4]);
  386|     14|   accum.mul(x[3], y[3]);
  387|     14|   accum.mul(x[4], y[2]);
  388|     14|   accum.mul(x[5], y[1]);
  389|     14|   accum.mul(x[6], y[0]);
  390|     14|   z[6] = accum.extract();
  391|     14|   accum.mul(x[0], y[7]);
  392|     14|   accum.mul(x[1], y[6]);
  393|     14|   accum.mul(x[2], y[5]);
  394|     14|   accum.mul(x[3], y[4]);
  395|     14|   accum.mul(x[4], y[3]);
  396|     14|   accum.mul(x[5], y[2]);
  397|     14|   accum.mul(x[6], y[1]);
  398|     14|   accum.mul(x[7], y[0]);
  399|     14|   z[7] = accum.extract();
  400|     14|   accum.mul(x[1], y[7]);
  401|     14|   accum.mul(x[2], y[6]);
  402|     14|   accum.mul(x[3], y[5]);
  403|     14|   accum.mul(x[4], y[4]);
  404|     14|   accum.mul(x[5], y[3]);
  405|     14|   accum.mul(x[6], y[2]);
  406|     14|   accum.mul(x[7], y[1]);
  407|     14|   z[8] = accum.extract();
  408|     14|   accum.mul(x[2], y[7]);
  409|     14|   accum.mul(x[3], y[6]);
  410|     14|   accum.mul(x[4], y[5]);
  411|     14|   accum.mul(x[5], y[4]);
  412|     14|   accum.mul(x[6], y[3]);
  413|     14|   accum.mul(x[7], y[2]);
  414|     14|   z[9] = accum.extract();
  415|     14|   accum.mul(x[3], y[7]);
  416|     14|   accum.mul(x[4], y[6]);
  417|     14|   accum.mul(x[5], y[5]);
  418|     14|   accum.mul(x[6], y[4]);
  419|     14|   accum.mul(x[7], y[3]);
  420|     14|   z[10] = accum.extract();
  421|     14|   accum.mul(x[4], y[7]);
  422|     14|   accum.mul(x[5], y[6]);
  423|     14|   accum.mul(x[6], y[5]);
  424|     14|   accum.mul(x[7], y[4]);
  425|     14|   z[11] = accum.extract();
  426|     14|   accum.mul(x[5], y[7]);
  427|     14|   accum.mul(x[6], y[6]);
  428|     14|   accum.mul(x[7], y[5]);
  429|     14|   z[12] = accum.extract();
  430|     14|   accum.mul(x[6], y[7]);
  431|     14|   accum.mul(x[7], y[6]);
  432|     14|   z[13] = accum.extract();
  433|     14|   accum.mul(x[7], y[7]);
  434|     14|   z[14] = accum.extract();
  435|     14|   z[15] = accum.extract();
  436|     14|}
_ZN5Botan17bigint_comba_mul9EPmPKmS2_:
  512|      8|void bigint_comba_mul9(word z[18], const word x[9], const word y[9]) {
  513|      8|   word3<word> accum;
  514|       |
  515|      8|   accum.mul(x[0], y[0]);
  516|      8|   z[0] = accum.extract();
  517|      8|   accum.mul(x[0], y[1]);
  518|      8|   accum.mul(x[1], y[0]);
  519|      8|   z[1] = accum.extract();
  520|      8|   accum.mul(x[0], y[2]);
  521|      8|   accum.mul(x[1], y[1]);
  522|      8|   accum.mul(x[2], y[0]);
  523|      8|   z[2] = accum.extract();
  524|      8|   accum.mul(x[0], y[3]);
  525|      8|   accum.mul(x[1], y[2]);
  526|      8|   accum.mul(x[2], y[1]);
  527|      8|   accum.mul(x[3], y[0]);
  528|      8|   z[3] = accum.extract();
  529|      8|   accum.mul(x[0], y[4]);
  530|      8|   accum.mul(x[1], y[3]);
  531|      8|   accum.mul(x[2], y[2]);
  532|      8|   accum.mul(x[3], y[1]);
  533|      8|   accum.mul(x[4], y[0]);
  534|      8|   z[4] = accum.extract();
  535|      8|   accum.mul(x[0], y[5]);
  536|      8|   accum.mul(x[1], y[4]);
  537|      8|   accum.mul(x[2], y[3]);
  538|      8|   accum.mul(x[3], y[2]);
  539|      8|   accum.mul(x[4], y[1]);
  540|      8|   accum.mul(x[5], y[0]);
  541|      8|   z[5] = accum.extract();
  542|      8|   accum.mul(x[0], y[6]);
  543|      8|   accum.mul(x[1], y[5]);
  544|      8|   accum.mul(x[2], y[4]);
  545|      8|   accum.mul(x[3], y[3]);
  546|      8|   accum.mul(x[4], y[2]);
  547|      8|   accum.mul(x[5], y[1]);
  548|      8|   accum.mul(x[6], y[0]);
  549|      8|   z[6] = accum.extract();
  550|      8|   accum.mul(x[0], y[7]);
  551|      8|   accum.mul(x[1], y[6]);
  552|      8|   accum.mul(x[2], y[5]);
  553|      8|   accum.mul(x[3], y[4]);
  554|      8|   accum.mul(x[4], y[3]);
  555|      8|   accum.mul(x[5], y[2]);
  556|      8|   accum.mul(x[6], y[1]);
  557|      8|   accum.mul(x[7], y[0]);
  558|      8|   z[7] = accum.extract();
  559|      8|   accum.mul(x[0], y[8]);
  560|      8|   accum.mul(x[1], y[7]);
  561|      8|   accum.mul(x[2], y[6]);
  562|      8|   accum.mul(x[3], y[5]);
  563|      8|   accum.mul(x[4], y[4]);
  564|      8|   accum.mul(x[5], y[3]);
  565|      8|   accum.mul(x[6], y[2]);
  566|      8|   accum.mul(x[7], y[1]);
  567|      8|   accum.mul(x[8], y[0]);
  568|      8|   z[8] = accum.extract();
  569|      8|   accum.mul(x[1], y[8]);
  570|      8|   accum.mul(x[2], y[7]);
  571|      8|   accum.mul(x[3], y[6]);
  572|      8|   accum.mul(x[4], y[5]);
  573|      8|   accum.mul(x[5], y[4]);
  574|      8|   accum.mul(x[6], y[3]);
  575|      8|   accum.mul(x[7], y[2]);
  576|      8|   accum.mul(x[8], y[1]);
  577|      8|   z[9] = accum.extract();
  578|      8|   accum.mul(x[2], y[8]);
  579|      8|   accum.mul(x[3], y[7]);
  580|      8|   accum.mul(x[4], y[6]);
  581|      8|   accum.mul(x[5], y[5]);
  582|      8|   accum.mul(x[6], y[4]);
  583|      8|   accum.mul(x[7], y[3]);
  584|      8|   accum.mul(x[8], y[2]);
  585|      8|   z[10] = accum.extract();
  586|      8|   accum.mul(x[3], y[8]);
  587|      8|   accum.mul(x[4], y[7]);
  588|      8|   accum.mul(x[5], y[6]);
  589|      8|   accum.mul(x[6], y[5]);
  590|      8|   accum.mul(x[7], y[4]);
  591|      8|   accum.mul(x[8], y[3]);
  592|      8|   z[11] = accum.extract();
  593|      8|   accum.mul(x[4], y[8]);
  594|      8|   accum.mul(x[5], y[7]);
  595|      8|   accum.mul(x[6], y[6]);
  596|      8|   accum.mul(x[7], y[5]);
  597|      8|   accum.mul(x[8], y[4]);
  598|      8|   z[12] = accum.extract();
  599|      8|   accum.mul(x[5], y[8]);
  600|      8|   accum.mul(x[6], y[7]);
  601|      8|   accum.mul(x[7], y[6]);
  602|      8|   accum.mul(x[8], y[5]);
  603|      8|   z[13] = accum.extract();
  604|      8|   accum.mul(x[6], y[8]);
  605|      8|   accum.mul(x[7], y[7]);
  606|      8|   accum.mul(x[8], y[6]);
  607|      8|   z[14] = accum.extract();
  608|      8|   accum.mul(x[7], y[8]);
  609|      8|   accum.mul(x[8], y[7]);
  610|      8|   z[15] = accum.extract();
  611|      8|   accum.mul(x[8], y[8]);
  612|      8|   z[16] = accum.extract();
  613|      8|   z[17] = accum.extract();
  614|      8|}
_ZN5Botan18bigint_comba_mul16EPmPKmS2_:
  795|     29|void bigint_comba_mul16(word z[32], const word x[16], const word y[16]) {
  796|     29|   word3<word> accum;
  797|       |
  798|     29|   accum.mul(x[0], y[0]);
  799|     29|   z[0] = accum.extract();
  800|     29|   accum.mul(x[0], y[1]);
  801|     29|   accum.mul(x[1], y[0]);
  802|     29|   z[1] = accum.extract();
  803|     29|   accum.mul(x[0], y[2]);
  804|     29|   accum.mul(x[1], y[1]);
  805|     29|   accum.mul(x[2], y[0]);
  806|     29|   z[2] = accum.extract();
  807|     29|   accum.mul(x[0], y[3]);
  808|     29|   accum.mul(x[1], y[2]);
  809|     29|   accum.mul(x[2], y[1]);
  810|     29|   accum.mul(x[3], y[0]);
  811|     29|   z[3] = accum.extract();
  812|     29|   accum.mul(x[0], y[4]);
  813|     29|   accum.mul(x[1], y[3]);
  814|     29|   accum.mul(x[2], y[2]);
  815|     29|   accum.mul(x[3], y[1]);
  816|     29|   accum.mul(x[4], y[0]);
  817|     29|   z[4] = accum.extract();
  818|     29|   accum.mul(x[0], y[5]);
  819|     29|   accum.mul(x[1], y[4]);
  820|     29|   accum.mul(x[2], y[3]);
  821|     29|   accum.mul(x[3], y[2]);
  822|     29|   accum.mul(x[4], y[1]);
  823|     29|   accum.mul(x[5], y[0]);
  824|     29|   z[5] = accum.extract();
  825|     29|   accum.mul(x[0], y[6]);
  826|     29|   accum.mul(x[1], y[5]);
  827|     29|   accum.mul(x[2], y[4]);
  828|     29|   accum.mul(x[3], y[3]);
  829|     29|   accum.mul(x[4], y[2]);
  830|     29|   accum.mul(x[5], y[1]);
  831|     29|   accum.mul(x[6], y[0]);
  832|     29|   z[6] = accum.extract();
  833|     29|   accum.mul(x[0], y[7]);
  834|     29|   accum.mul(x[1], y[6]);
  835|     29|   accum.mul(x[2], y[5]);
  836|     29|   accum.mul(x[3], y[4]);
  837|     29|   accum.mul(x[4], y[3]);
  838|     29|   accum.mul(x[5], y[2]);
  839|     29|   accum.mul(x[6], y[1]);
  840|     29|   accum.mul(x[7], y[0]);
  841|     29|   z[7] = accum.extract();
  842|     29|   accum.mul(x[0], y[8]);
  843|     29|   accum.mul(x[1], y[7]);
  844|     29|   accum.mul(x[2], y[6]);
  845|     29|   accum.mul(x[3], y[5]);
  846|     29|   accum.mul(x[4], y[4]);
  847|     29|   accum.mul(x[5], y[3]);
  848|     29|   accum.mul(x[6], y[2]);
  849|     29|   accum.mul(x[7], y[1]);
  850|     29|   accum.mul(x[8], y[0]);
  851|     29|   z[8] = accum.extract();
  852|     29|   accum.mul(x[0], y[9]);
  853|     29|   accum.mul(x[1], y[8]);
  854|     29|   accum.mul(x[2], y[7]);
  855|     29|   accum.mul(x[3], y[6]);
  856|     29|   accum.mul(x[4], y[5]);
  857|     29|   accum.mul(x[5], y[4]);
  858|     29|   accum.mul(x[6], y[3]);
  859|     29|   accum.mul(x[7], y[2]);
  860|     29|   accum.mul(x[8], y[1]);
  861|     29|   accum.mul(x[9], y[0]);
  862|     29|   z[9] = accum.extract();
  863|     29|   accum.mul(x[0], y[10]);
  864|     29|   accum.mul(x[1], y[9]);
  865|     29|   accum.mul(x[2], y[8]);
  866|     29|   accum.mul(x[3], y[7]);
  867|     29|   accum.mul(x[4], y[6]);
  868|     29|   accum.mul(x[5], y[5]);
  869|     29|   accum.mul(x[6], y[4]);
  870|     29|   accum.mul(x[7], y[3]);
  871|     29|   accum.mul(x[8], y[2]);
  872|     29|   accum.mul(x[9], y[1]);
  873|     29|   accum.mul(x[10], y[0]);
  874|     29|   z[10] = accum.extract();
  875|     29|   accum.mul(x[0], y[11]);
  876|     29|   accum.mul(x[1], y[10]);
  877|     29|   accum.mul(x[2], y[9]);
  878|     29|   accum.mul(x[3], y[8]);
  879|     29|   accum.mul(x[4], y[7]);
  880|     29|   accum.mul(x[5], y[6]);
  881|     29|   accum.mul(x[6], y[5]);
  882|     29|   accum.mul(x[7], y[4]);
  883|     29|   accum.mul(x[8], y[3]);
  884|     29|   accum.mul(x[9], y[2]);
  885|     29|   accum.mul(x[10], y[1]);
  886|     29|   accum.mul(x[11], y[0]);
  887|     29|   z[11] = accum.extract();
  888|     29|   accum.mul(x[0], y[12]);
  889|     29|   accum.mul(x[1], y[11]);
  890|     29|   accum.mul(x[2], y[10]);
  891|     29|   accum.mul(x[3], y[9]);
  892|     29|   accum.mul(x[4], y[8]);
  893|     29|   accum.mul(x[5], y[7]);
  894|     29|   accum.mul(x[6], y[6]);
  895|     29|   accum.mul(x[7], y[5]);
  896|     29|   accum.mul(x[8], y[4]);
  897|     29|   accum.mul(x[9], y[3]);
  898|     29|   accum.mul(x[10], y[2]);
  899|     29|   accum.mul(x[11], y[1]);
  900|     29|   accum.mul(x[12], y[0]);
  901|     29|   z[12] = accum.extract();
  902|     29|   accum.mul(x[0], y[13]);
  903|     29|   accum.mul(x[1], y[12]);
  904|     29|   accum.mul(x[2], y[11]);
  905|     29|   accum.mul(x[3], y[10]);
  906|     29|   accum.mul(x[4], y[9]);
  907|     29|   accum.mul(x[5], y[8]);
  908|     29|   accum.mul(x[6], y[7]);
  909|     29|   accum.mul(x[7], y[6]);
  910|     29|   accum.mul(x[8], y[5]);
  911|     29|   accum.mul(x[9], y[4]);
  912|     29|   accum.mul(x[10], y[3]);
  913|     29|   accum.mul(x[11], y[2]);
  914|     29|   accum.mul(x[12], y[1]);
  915|     29|   accum.mul(x[13], y[0]);
  916|     29|   z[13] = accum.extract();
  917|     29|   accum.mul(x[0], y[14]);
  918|     29|   accum.mul(x[1], y[13]);
  919|     29|   accum.mul(x[2], y[12]);
  920|     29|   accum.mul(x[3], y[11]);
  921|     29|   accum.mul(x[4], y[10]);
  922|     29|   accum.mul(x[5], y[9]);
  923|     29|   accum.mul(x[6], y[8]);
  924|     29|   accum.mul(x[7], y[7]);
  925|     29|   accum.mul(x[8], y[6]);
  926|     29|   accum.mul(x[9], y[5]);
  927|     29|   accum.mul(x[10], y[4]);
  928|     29|   accum.mul(x[11], y[3]);
  929|     29|   accum.mul(x[12], y[2]);
  930|     29|   accum.mul(x[13], y[1]);
  931|     29|   accum.mul(x[14], y[0]);
  932|     29|   z[14] = accum.extract();
  933|     29|   accum.mul(x[0], y[15]);
  934|     29|   accum.mul(x[1], y[14]);
  935|     29|   accum.mul(x[2], y[13]);
  936|     29|   accum.mul(x[3], y[12]);
  937|     29|   accum.mul(x[4], y[11]);
  938|     29|   accum.mul(x[5], y[10]);
  939|     29|   accum.mul(x[6], y[9]);
  940|     29|   accum.mul(x[7], y[8]);
  941|     29|   accum.mul(x[8], y[7]);
  942|     29|   accum.mul(x[9], y[6]);
  943|     29|   accum.mul(x[10], y[5]);
  944|     29|   accum.mul(x[11], y[4]);
  945|     29|   accum.mul(x[12], y[3]);
  946|     29|   accum.mul(x[13], y[2]);
  947|     29|   accum.mul(x[14], y[1]);
  948|     29|   accum.mul(x[15], y[0]);
  949|     29|   z[15] = accum.extract();
  950|     29|   accum.mul(x[1], y[15]);
  951|     29|   accum.mul(x[2], y[14]);
  952|     29|   accum.mul(x[3], y[13]);
  953|     29|   accum.mul(x[4], y[12]);
  954|     29|   accum.mul(x[5], y[11]);
  955|     29|   accum.mul(x[6], y[10]);
  956|     29|   accum.mul(x[7], y[9]);
  957|     29|   accum.mul(x[8], y[8]);
  958|     29|   accum.mul(x[9], y[7]);
  959|     29|   accum.mul(x[10], y[6]);
  960|     29|   accum.mul(x[11], y[5]);
  961|     29|   accum.mul(x[12], y[4]);
  962|     29|   accum.mul(x[13], y[3]);
  963|     29|   accum.mul(x[14], y[2]);
  964|     29|   accum.mul(x[15], y[1]);
  965|     29|   z[16] = accum.extract();
  966|     29|   accum.mul(x[2], y[15]);
  967|     29|   accum.mul(x[3], y[14]);
  968|     29|   accum.mul(x[4], y[13]);
  969|     29|   accum.mul(x[5], y[12]);
  970|     29|   accum.mul(x[6], y[11]);
  971|     29|   accum.mul(x[7], y[10]);
  972|     29|   accum.mul(x[8], y[9]);
  973|     29|   accum.mul(x[9], y[8]);
  974|     29|   accum.mul(x[10], y[7]);
  975|     29|   accum.mul(x[11], y[6]);
  976|     29|   accum.mul(x[12], y[5]);
  977|     29|   accum.mul(x[13], y[4]);
  978|     29|   accum.mul(x[14], y[3]);
  979|     29|   accum.mul(x[15], y[2]);
  980|     29|   z[17] = accum.extract();
  981|     29|   accum.mul(x[3], y[15]);
  982|     29|   accum.mul(x[4], y[14]);
  983|     29|   accum.mul(x[5], y[13]);
  984|     29|   accum.mul(x[6], y[12]);
  985|     29|   accum.mul(x[7], y[11]);
  986|     29|   accum.mul(x[8], y[10]);
  987|     29|   accum.mul(x[9], y[9]);
  988|     29|   accum.mul(x[10], y[8]);
  989|     29|   accum.mul(x[11], y[7]);
  990|     29|   accum.mul(x[12], y[6]);
  991|     29|   accum.mul(x[13], y[5]);
  992|     29|   accum.mul(x[14], y[4]);
  993|     29|   accum.mul(x[15], y[3]);
  994|     29|   z[18] = accum.extract();
  995|     29|   accum.mul(x[4], y[15]);
  996|     29|   accum.mul(x[5], y[14]);
  997|     29|   accum.mul(x[6], y[13]);
  998|     29|   accum.mul(x[7], y[12]);
  999|     29|   accum.mul(x[8], y[11]);
 1000|     29|   accum.mul(x[9], y[10]);
 1001|     29|   accum.mul(x[10], y[9]);
 1002|     29|   accum.mul(x[11], y[8]);
 1003|     29|   accum.mul(x[12], y[7]);
 1004|     29|   accum.mul(x[13], y[6]);
 1005|     29|   accum.mul(x[14], y[5]);
 1006|     29|   accum.mul(x[15], y[4]);
 1007|     29|   z[19] = accum.extract();
 1008|     29|   accum.mul(x[5], y[15]);
 1009|     29|   accum.mul(x[6], y[14]);
 1010|     29|   accum.mul(x[7], y[13]);
 1011|     29|   accum.mul(x[8], y[12]);
 1012|     29|   accum.mul(x[9], y[11]);
 1013|     29|   accum.mul(x[10], y[10]);
 1014|     29|   accum.mul(x[11], y[9]);
 1015|     29|   accum.mul(x[12], y[8]);
 1016|     29|   accum.mul(x[13], y[7]);
 1017|     29|   accum.mul(x[14], y[6]);
 1018|     29|   accum.mul(x[15], y[5]);
 1019|     29|   z[20] = accum.extract();
 1020|     29|   accum.mul(x[6], y[15]);
 1021|     29|   accum.mul(x[7], y[14]);
 1022|     29|   accum.mul(x[8], y[13]);
 1023|     29|   accum.mul(x[9], y[12]);
 1024|     29|   accum.mul(x[10], y[11]);
 1025|     29|   accum.mul(x[11], y[10]);
 1026|     29|   accum.mul(x[12], y[9]);
 1027|     29|   accum.mul(x[13], y[8]);
 1028|     29|   accum.mul(x[14], y[7]);
 1029|     29|   accum.mul(x[15], y[6]);
 1030|     29|   z[21] = accum.extract();
 1031|     29|   accum.mul(x[7], y[15]);
 1032|     29|   accum.mul(x[8], y[14]);
 1033|     29|   accum.mul(x[9], y[13]);
 1034|     29|   accum.mul(x[10], y[12]);
 1035|     29|   accum.mul(x[11], y[11]);
 1036|     29|   accum.mul(x[12], y[10]);
 1037|     29|   accum.mul(x[13], y[9]);
 1038|     29|   accum.mul(x[14], y[8]);
 1039|     29|   accum.mul(x[15], y[7]);
 1040|     29|   z[22] = accum.extract();
 1041|     29|   accum.mul(x[8], y[15]);
 1042|     29|   accum.mul(x[9], y[14]);
 1043|     29|   accum.mul(x[10], y[13]);
 1044|     29|   accum.mul(x[11], y[12]);
 1045|     29|   accum.mul(x[12], y[11]);
 1046|     29|   accum.mul(x[13], y[10]);
 1047|     29|   accum.mul(x[14], y[9]);
 1048|     29|   accum.mul(x[15], y[8]);
 1049|     29|   z[23] = accum.extract();
 1050|     29|   accum.mul(x[9], y[15]);
 1051|     29|   accum.mul(x[10], y[14]);
 1052|     29|   accum.mul(x[11], y[13]);
 1053|     29|   accum.mul(x[12], y[12]);
 1054|     29|   accum.mul(x[13], y[11]);
 1055|     29|   accum.mul(x[14], y[10]);
 1056|     29|   accum.mul(x[15], y[9]);
 1057|     29|   z[24] = accum.extract();
 1058|     29|   accum.mul(x[10], y[15]);
 1059|     29|   accum.mul(x[11], y[14]);
 1060|     29|   accum.mul(x[12], y[13]);
 1061|     29|   accum.mul(x[13], y[12]);
 1062|     29|   accum.mul(x[14], y[11]);
 1063|     29|   accum.mul(x[15], y[10]);
 1064|     29|   z[25] = accum.extract();
 1065|     29|   accum.mul(x[11], y[15]);
 1066|     29|   accum.mul(x[12], y[14]);
 1067|     29|   accum.mul(x[13], y[13]);
 1068|     29|   accum.mul(x[14], y[12]);
 1069|     29|   accum.mul(x[15], y[11]);
 1070|     29|   z[26] = accum.extract();
 1071|     29|   accum.mul(x[12], y[15]);
 1072|     29|   accum.mul(x[13], y[14]);
 1073|     29|   accum.mul(x[14], y[13]);
 1074|     29|   accum.mul(x[15], y[12]);
 1075|     29|   z[27] = accum.extract();
 1076|     29|   accum.mul(x[13], y[15]);
 1077|     29|   accum.mul(x[14], y[14]);
 1078|     29|   accum.mul(x[15], y[13]);
 1079|     29|   z[28] = accum.extract();
 1080|     29|   accum.mul(x[14], y[15]);
 1081|     29|   accum.mul(x[15], y[14]);
 1082|     29|   z[29] = accum.extract();
 1083|     29|   accum.mul(x[15], y[15]);
 1084|     29|   z[30] = accum.extract();
 1085|     29|   z[31] = accum.extract();
 1086|     29|}
_ZN5Botan18bigint_comba_mul24EPmPKmS2_:
 1447|     22|void bigint_comba_mul24(word z[48], const word x[24], const word y[24]) {
 1448|     22|   word3<word> accum;
 1449|       |
 1450|     22|   accum.mul(x[0], y[0]);
 1451|     22|   z[0] = accum.extract();
 1452|     22|   accum.mul(x[0], y[1]);
 1453|     22|   accum.mul(x[1], y[0]);
 1454|     22|   z[1] = accum.extract();
 1455|     22|   accum.mul(x[0], y[2]);
 1456|     22|   accum.mul(x[1], y[1]);
 1457|     22|   accum.mul(x[2], y[0]);
 1458|     22|   z[2] = accum.extract();
 1459|     22|   accum.mul(x[0], y[3]);
 1460|     22|   accum.mul(x[1], y[2]);
 1461|     22|   accum.mul(x[2], y[1]);
 1462|     22|   accum.mul(x[3], y[0]);
 1463|     22|   z[3] = accum.extract();
 1464|     22|   accum.mul(x[0], y[4]);
 1465|     22|   accum.mul(x[1], y[3]);
 1466|     22|   accum.mul(x[2], y[2]);
 1467|     22|   accum.mul(x[3], y[1]);
 1468|     22|   accum.mul(x[4], y[0]);
 1469|     22|   z[4] = accum.extract();
 1470|     22|   accum.mul(x[0], y[5]);
 1471|     22|   accum.mul(x[1], y[4]);
 1472|     22|   accum.mul(x[2], y[3]);
 1473|     22|   accum.mul(x[3], y[2]);
 1474|     22|   accum.mul(x[4], y[1]);
 1475|     22|   accum.mul(x[5], y[0]);
 1476|     22|   z[5] = accum.extract();
 1477|     22|   accum.mul(x[0], y[6]);
 1478|     22|   accum.mul(x[1], y[5]);
 1479|     22|   accum.mul(x[2], y[4]);
 1480|     22|   accum.mul(x[3], y[3]);
 1481|     22|   accum.mul(x[4], y[2]);
 1482|     22|   accum.mul(x[5], y[1]);
 1483|     22|   accum.mul(x[6], y[0]);
 1484|     22|   z[6] = accum.extract();
 1485|     22|   accum.mul(x[0], y[7]);
 1486|     22|   accum.mul(x[1], y[6]);
 1487|     22|   accum.mul(x[2], y[5]);
 1488|     22|   accum.mul(x[3], y[4]);
 1489|     22|   accum.mul(x[4], y[3]);
 1490|     22|   accum.mul(x[5], y[2]);
 1491|     22|   accum.mul(x[6], y[1]);
 1492|     22|   accum.mul(x[7], y[0]);
 1493|     22|   z[7] = accum.extract();
 1494|     22|   accum.mul(x[0], y[8]);
 1495|     22|   accum.mul(x[1], y[7]);
 1496|     22|   accum.mul(x[2], y[6]);
 1497|     22|   accum.mul(x[3], y[5]);
 1498|     22|   accum.mul(x[4], y[4]);
 1499|     22|   accum.mul(x[5], y[3]);
 1500|     22|   accum.mul(x[6], y[2]);
 1501|     22|   accum.mul(x[7], y[1]);
 1502|     22|   accum.mul(x[8], y[0]);
 1503|     22|   z[8] = accum.extract();
 1504|     22|   accum.mul(x[0], y[9]);
 1505|     22|   accum.mul(x[1], y[8]);
 1506|     22|   accum.mul(x[2], y[7]);
 1507|     22|   accum.mul(x[3], y[6]);
 1508|     22|   accum.mul(x[4], y[5]);
 1509|     22|   accum.mul(x[5], y[4]);
 1510|     22|   accum.mul(x[6], y[3]);
 1511|     22|   accum.mul(x[7], y[2]);
 1512|     22|   accum.mul(x[8], y[1]);
 1513|     22|   accum.mul(x[9], y[0]);
 1514|     22|   z[9] = accum.extract();
 1515|     22|   accum.mul(x[0], y[10]);
 1516|     22|   accum.mul(x[1], y[9]);
 1517|     22|   accum.mul(x[2], y[8]);
 1518|     22|   accum.mul(x[3], y[7]);
 1519|     22|   accum.mul(x[4], y[6]);
 1520|     22|   accum.mul(x[5], y[5]);
 1521|     22|   accum.mul(x[6], y[4]);
 1522|     22|   accum.mul(x[7], y[3]);
 1523|     22|   accum.mul(x[8], y[2]);
 1524|     22|   accum.mul(x[9], y[1]);
 1525|     22|   accum.mul(x[10], y[0]);
 1526|     22|   z[10] = accum.extract();
 1527|     22|   accum.mul(x[0], y[11]);
 1528|     22|   accum.mul(x[1], y[10]);
 1529|     22|   accum.mul(x[2], y[9]);
 1530|     22|   accum.mul(x[3], y[8]);
 1531|     22|   accum.mul(x[4], y[7]);
 1532|     22|   accum.mul(x[5], y[6]);
 1533|     22|   accum.mul(x[6], y[5]);
 1534|     22|   accum.mul(x[7], y[4]);
 1535|     22|   accum.mul(x[8], y[3]);
 1536|     22|   accum.mul(x[9], y[2]);
 1537|     22|   accum.mul(x[10], y[1]);
 1538|     22|   accum.mul(x[11], y[0]);
 1539|     22|   z[11] = accum.extract();
 1540|     22|   accum.mul(x[0], y[12]);
 1541|     22|   accum.mul(x[1], y[11]);
 1542|     22|   accum.mul(x[2], y[10]);
 1543|     22|   accum.mul(x[3], y[9]);
 1544|     22|   accum.mul(x[4], y[8]);
 1545|     22|   accum.mul(x[5], y[7]);
 1546|     22|   accum.mul(x[6], y[6]);
 1547|     22|   accum.mul(x[7], y[5]);
 1548|     22|   accum.mul(x[8], y[4]);
 1549|     22|   accum.mul(x[9], y[3]);
 1550|     22|   accum.mul(x[10], y[2]);
 1551|     22|   accum.mul(x[11], y[1]);
 1552|     22|   accum.mul(x[12], y[0]);
 1553|     22|   z[12] = accum.extract();
 1554|     22|   accum.mul(x[0], y[13]);
 1555|     22|   accum.mul(x[1], y[12]);
 1556|     22|   accum.mul(x[2], y[11]);
 1557|     22|   accum.mul(x[3], y[10]);
 1558|     22|   accum.mul(x[4], y[9]);
 1559|     22|   accum.mul(x[5], y[8]);
 1560|     22|   accum.mul(x[6], y[7]);
 1561|     22|   accum.mul(x[7], y[6]);
 1562|     22|   accum.mul(x[8], y[5]);
 1563|     22|   accum.mul(x[9], y[4]);
 1564|     22|   accum.mul(x[10], y[3]);
 1565|     22|   accum.mul(x[11], y[2]);
 1566|     22|   accum.mul(x[12], y[1]);
 1567|     22|   accum.mul(x[13], y[0]);
 1568|     22|   z[13] = accum.extract();
 1569|     22|   accum.mul(x[0], y[14]);
 1570|     22|   accum.mul(x[1], y[13]);
 1571|     22|   accum.mul(x[2], y[12]);
 1572|     22|   accum.mul(x[3], y[11]);
 1573|     22|   accum.mul(x[4], y[10]);
 1574|     22|   accum.mul(x[5], y[9]);
 1575|     22|   accum.mul(x[6], y[8]);
 1576|     22|   accum.mul(x[7], y[7]);
 1577|     22|   accum.mul(x[8], y[6]);
 1578|     22|   accum.mul(x[9], y[5]);
 1579|     22|   accum.mul(x[10], y[4]);
 1580|     22|   accum.mul(x[11], y[3]);
 1581|     22|   accum.mul(x[12], y[2]);
 1582|     22|   accum.mul(x[13], y[1]);
 1583|     22|   accum.mul(x[14], y[0]);
 1584|     22|   z[14] = accum.extract();
 1585|     22|   accum.mul(x[0], y[15]);
 1586|     22|   accum.mul(x[1], y[14]);
 1587|     22|   accum.mul(x[2], y[13]);
 1588|     22|   accum.mul(x[3], y[12]);
 1589|     22|   accum.mul(x[4], y[11]);
 1590|     22|   accum.mul(x[5], y[10]);
 1591|     22|   accum.mul(x[6], y[9]);
 1592|     22|   accum.mul(x[7], y[8]);
 1593|     22|   accum.mul(x[8], y[7]);
 1594|     22|   accum.mul(x[9], y[6]);
 1595|     22|   accum.mul(x[10], y[5]);
 1596|     22|   accum.mul(x[11], y[4]);
 1597|     22|   accum.mul(x[12], y[3]);
 1598|     22|   accum.mul(x[13], y[2]);
 1599|     22|   accum.mul(x[14], y[1]);
 1600|     22|   accum.mul(x[15], y[0]);
 1601|     22|   z[15] = accum.extract();
 1602|     22|   accum.mul(x[0], y[16]);
 1603|     22|   accum.mul(x[1], y[15]);
 1604|     22|   accum.mul(x[2], y[14]);
 1605|     22|   accum.mul(x[3], y[13]);
 1606|     22|   accum.mul(x[4], y[12]);
 1607|     22|   accum.mul(x[5], y[11]);
 1608|     22|   accum.mul(x[6], y[10]);
 1609|     22|   accum.mul(x[7], y[9]);
 1610|     22|   accum.mul(x[8], y[8]);
 1611|     22|   accum.mul(x[9], y[7]);
 1612|     22|   accum.mul(x[10], y[6]);
 1613|     22|   accum.mul(x[11], y[5]);
 1614|     22|   accum.mul(x[12], y[4]);
 1615|     22|   accum.mul(x[13], y[3]);
 1616|     22|   accum.mul(x[14], y[2]);
 1617|     22|   accum.mul(x[15], y[1]);
 1618|     22|   accum.mul(x[16], y[0]);
 1619|     22|   z[16] = accum.extract();
 1620|     22|   accum.mul(x[0], y[17]);
 1621|     22|   accum.mul(x[1], y[16]);
 1622|     22|   accum.mul(x[2], y[15]);
 1623|     22|   accum.mul(x[3], y[14]);
 1624|     22|   accum.mul(x[4], y[13]);
 1625|     22|   accum.mul(x[5], y[12]);
 1626|     22|   accum.mul(x[6], y[11]);
 1627|     22|   accum.mul(x[7], y[10]);
 1628|     22|   accum.mul(x[8], y[9]);
 1629|     22|   accum.mul(x[9], y[8]);
 1630|     22|   accum.mul(x[10], y[7]);
 1631|     22|   accum.mul(x[11], y[6]);
 1632|     22|   accum.mul(x[12], y[5]);
 1633|     22|   accum.mul(x[13], y[4]);
 1634|     22|   accum.mul(x[14], y[3]);
 1635|     22|   accum.mul(x[15], y[2]);
 1636|     22|   accum.mul(x[16], y[1]);
 1637|     22|   accum.mul(x[17], y[0]);
 1638|     22|   z[17] = accum.extract();
 1639|     22|   accum.mul(x[0], y[18]);
 1640|     22|   accum.mul(x[1], y[17]);
 1641|     22|   accum.mul(x[2], y[16]);
 1642|     22|   accum.mul(x[3], y[15]);
 1643|     22|   accum.mul(x[4], y[14]);
 1644|     22|   accum.mul(x[5], y[13]);
 1645|     22|   accum.mul(x[6], y[12]);
 1646|     22|   accum.mul(x[7], y[11]);
 1647|     22|   accum.mul(x[8], y[10]);
 1648|     22|   accum.mul(x[9], y[9]);
 1649|     22|   accum.mul(x[10], y[8]);
 1650|     22|   accum.mul(x[11], y[7]);
 1651|     22|   accum.mul(x[12], y[6]);
 1652|     22|   accum.mul(x[13], y[5]);
 1653|     22|   accum.mul(x[14], y[4]);
 1654|     22|   accum.mul(x[15], y[3]);
 1655|     22|   accum.mul(x[16], y[2]);
 1656|     22|   accum.mul(x[17], y[1]);
 1657|     22|   accum.mul(x[18], y[0]);
 1658|     22|   z[18] = accum.extract();
 1659|     22|   accum.mul(x[0], y[19]);
 1660|     22|   accum.mul(x[1], y[18]);
 1661|     22|   accum.mul(x[2], y[17]);
 1662|     22|   accum.mul(x[3], y[16]);
 1663|     22|   accum.mul(x[4], y[15]);
 1664|     22|   accum.mul(x[5], y[14]);
 1665|     22|   accum.mul(x[6], y[13]);
 1666|     22|   accum.mul(x[7], y[12]);
 1667|     22|   accum.mul(x[8], y[11]);
 1668|     22|   accum.mul(x[9], y[10]);
 1669|     22|   accum.mul(x[10], y[9]);
 1670|     22|   accum.mul(x[11], y[8]);
 1671|     22|   accum.mul(x[12], y[7]);
 1672|     22|   accum.mul(x[13], y[6]);
 1673|     22|   accum.mul(x[14], y[5]);
 1674|     22|   accum.mul(x[15], y[4]);
 1675|     22|   accum.mul(x[16], y[3]);
 1676|     22|   accum.mul(x[17], y[2]);
 1677|     22|   accum.mul(x[18], y[1]);
 1678|     22|   accum.mul(x[19], y[0]);
 1679|     22|   z[19] = accum.extract();
 1680|     22|   accum.mul(x[0], y[20]);
 1681|     22|   accum.mul(x[1], y[19]);
 1682|     22|   accum.mul(x[2], y[18]);
 1683|     22|   accum.mul(x[3], y[17]);
 1684|     22|   accum.mul(x[4], y[16]);
 1685|     22|   accum.mul(x[5], y[15]);
 1686|     22|   accum.mul(x[6], y[14]);
 1687|     22|   accum.mul(x[7], y[13]);
 1688|     22|   accum.mul(x[8], y[12]);
 1689|     22|   accum.mul(x[9], y[11]);
 1690|     22|   accum.mul(x[10], y[10]);
 1691|     22|   accum.mul(x[11], y[9]);
 1692|     22|   accum.mul(x[12], y[8]);
 1693|     22|   accum.mul(x[13], y[7]);
 1694|     22|   accum.mul(x[14], y[6]);
 1695|     22|   accum.mul(x[15], y[5]);
 1696|     22|   accum.mul(x[16], y[4]);
 1697|     22|   accum.mul(x[17], y[3]);
 1698|     22|   accum.mul(x[18], y[2]);
 1699|     22|   accum.mul(x[19], y[1]);
 1700|     22|   accum.mul(x[20], y[0]);
 1701|     22|   z[20] = accum.extract();
 1702|     22|   accum.mul(x[0], y[21]);
 1703|     22|   accum.mul(x[1], y[20]);
 1704|     22|   accum.mul(x[2], y[19]);
 1705|     22|   accum.mul(x[3], y[18]);
 1706|     22|   accum.mul(x[4], y[17]);
 1707|     22|   accum.mul(x[5], y[16]);
 1708|     22|   accum.mul(x[6], y[15]);
 1709|     22|   accum.mul(x[7], y[14]);
 1710|     22|   accum.mul(x[8], y[13]);
 1711|     22|   accum.mul(x[9], y[12]);
 1712|     22|   accum.mul(x[10], y[11]);
 1713|     22|   accum.mul(x[11], y[10]);
 1714|     22|   accum.mul(x[12], y[9]);
 1715|     22|   accum.mul(x[13], y[8]);
 1716|     22|   accum.mul(x[14], y[7]);
 1717|     22|   accum.mul(x[15], y[6]);
 1718|     22|   accum.mul(x[16], y[5]);
 1719|     22|   accum.mul(x[17], y[4]);
 1720|     22|   accum.mul(x[18], y[3]);
 1721|     22|   accum.mul(x[19], y[2]);
 1722|     22|   accum.mul(x[20], y[1]);
 1723|     22|   accum.mul(x[21], y[0]);
 1724|     22|   z[21] = accum.extract();
 1725|     22|   accum.mul(x[0], y[22]);
 1726|     22|   accum.mul(x[1], y[21]);
 1727|     22|   accum.mul(x[2], y[20]);
 1728|     22|   accum.mul(x[3], y[19]);
 1729|     22|   accum.mul(x[4], y[18]);
 1730|     22|   accum.mul(x[5], y[17]);
 1731|     22|   accum.mul(x[6], y[16]);
 1732|     22|   accum.mul(x[7], y[15]);
 1733|     22|   accum.mul(x[8], y[14]);
 1734|     22|   accum.mul(x[9], y[13]);
 1735|     22|   accum.mul(x[10], y[12]);
 1736|     22|   accum.mul(x[11], y[11]);
 1737|     22|   accum.mul(x[12], y[10]);
 1738|     22|   accum.mul(x[13], y[9]);
 1739|     22|   accum.mul(x[14], y[8]);
 1740|     22|   accum.mul(x[15], y[7]);
 1741|     22|   accum.mul(x[16], y[6]);
 1742|     22|   accum.mul(x[17], y[5]);
 1743|     22|   accum.mul(x[18], y[4]);
 1744|     22|   accum.mul(x[19], y[3]);
 1745|     22|   accum.mul(x[20], y[2]);
 1746|     22|   accum.mul(x[21], y[1]);
 1747|     22|   accum.mul(x[22], y[0]);
 1748|     22|   z[22] = accum.extract();
 1749|     22|   accum.mul(x[0], y[23]);
 1750|     22|   accum.mul(x[1], y[22]);
 1751|     22|   accum.mul(x[2], y[21]);
 1752|     22|   accum.mul(x[3], y[20]);
 1753|     22|   accum.mul(x[4], y[19]);
 1754|     22|   accum.mul(x[5], y[18]);
 1755|     22|   accum.mul(x[6], y[17]);
 1756|     22|   accum.mul(x[7], y[16]);
 1757|     22|   accum.mul(x[8], y[15]);
 1758|     22|   accum.mul(x[9], y[14]);
 1759|     22|   accum.mul(x[10], y[13]);
 1760|     22|   accum.mul(x[11], y[12]);
 1761|     22|   accum.mul(x[12], y[11]);
 1762|     22|   accum.mul(x[13], y[10]);
 1763|     22|   accum.mul(x[14], y[9]);
 1764|     22|   accum.mul(x[15], y[8]);
 1765|     22|   accum.mul(x[16], y[7]);
 1766|     22|   accum.mul(x[17], y[6]);
 1767|     22|   accum.mul(x[18], y[5]);
 1768|     22|   accum.mul(x[19], y[4]);
 1769|     22|   accum.mul(x[20], y[3]);
 1770|     22|   accum.mul(x[21], y[2]);
 1771|     22|   accum.mul(x[22], y[1]);
 1772|     22|   accum.mul(x[23], y[0]);
 1773|     22|   z[23] = accum.extract();
 1774|     22|   accum.mul(x[1], y[23]);
 1775|     22|   accum.mul(x[2], y[22]);
 1776|     22|   accum.mul(x[3], y[21]);
 1777|     22|   accum.mul(x[4], y[20]);
 1778|     22|   accum.mul(x[5], y[19]);
 1779|     22|   accum.mul(x[6], y[18]);
 1780|     22|   accum.mul(x[7], y[17]);
 1781|     22|   accum.mul(x[8], y[16]);
 1782|     22|   accum.mul(x[9], y[15]);
 1783|     22|   accum.mul(x[10], y[14]);
 1784|     22|   accum.mul(x[11], y[13]);
 1785|     22|   accum.mul(x[12], y[12]);
 1786|     22|   accum.mul(x[13], y[11]);
 1787|     22|   accum.mul(x[14], y[10]);
 1788|     22|   accum.mul(x[15], y[9]);
 1789|     22|   accum.mul(x[16], y[8]);
 1790|     22|   accum.mul(x[17], y[7]);
 1791|     22|   accum.mul(x[18], y[6]);
 1792|     22|   accum.mul(x[19], y[5]);
 1793|     22|   accum.mul(x[20], y[4]);
 1794|     22|   accum.mul(x[21], y[3]);
 1795|     22|   accum.mul(x[22], y[2]);
 1796|     22|   accum.mul(x[23], y[1]);
 1797|     22|   z[24] = accum.extract();
 1798|     22|   accum.mul(x[2], y[23]);
 1799|     22|   accum.mul(x[3], y[22]);
 1800|     22|   accum.mul(x[4], y[21]);
 1801|     22|   accum.mul(x[5], y[20]);
 1802|     22|   accum.mul(x[6], y[19]);
 1803|     22|   accum.mul(x[7], y[18]);
 1804|     22|   accum.mul(x[8], y[17]);
 1805|     22|   accum.mul(x[9], y[16]);
 1806|     22|   accum.mul(x[10], y[15]);
 1807|     22|   accum.mul(x[11], y[14]);
 1808|     22|   accum.mul(x[12], y[13]);
 1809|     22|   accum.mul(x[13], y[12]);
 1810|     22|   accum.mul(x[14], y[11]);
 1811|     22|   accum.mul(x[15], y[10]);
 1812|     22|   accum.mul(x[16], y[9]);
 1813|     22|   accum.mul(x[17], y[8]);
 1814|     22|   accum.mul(x[18], y[7]);
 1815|     22|   accum.mul(x[19], y[6]);
 1816|     22|   accum.mul(x[20], y[5]);
 1817|     22|   accum.mul(x[21], y[4]);
 1818|     22|   accum.mul(x[22], y[3]);
 1819|     22|   accum.mul(x[23], y[2]);
 1820|     22|   z[25] = accum.extract();
 1821|     22|   accum.mul(x[3], y[23]);
 1822|     22|   accum.mul(x[4], y[22]);
 1823|     22|   accum.mul(x[5], y[21]);
 1824|     22|   accum.mul(x[6], y[20]);
 1825|     22|   accum.mul(x[7], y[19]);
 1826|     22|   accum.mul(x[8], y[18]);
 1827|     22|   accum.mul(x[9], y[17]);
 1828|     22|   accum.mul(x[10], y[16]);
 1829|     22|   accum.mul(x[11], y[15]);
 1830|     22|   accum.mul(x[12], y[14]);
 1831|     22|   accum.mul(x[13], y[13]);
 1832|     22|   accum.mul(x[14], y[12]);
 1833|     22|   accum.mul(x[15], y[11]);
 1834|     22|   accum.mul(x[16], y[10]);
 1835|     22|   accum.mul(x[17], y[9]);
 1836|     22|   accum.mul(x[18], y[8]);
 1837|     22|   accum.mul(x[19], y[7]);
 1838|     22|   accum.mul(x[20], y[6]);
 1839|     22|   accum.mul(x[21], y[5]);
 1840|     22|   accum.mul(x[22], y[4]);
 1841|     22|   accum.mul(x[23], y[3]);
 1842|     22|   z[26] = accum.extract();
 1843|     22|   accum.mul(x[4], y[23]);
 1844|     22|   accum.mul(x[5], y[22]);
 1845|     22|   accum.mul(x[6], y[21]);
 1846|     22|   accum.mul(x[7], y[20]);
 1847|     22|   accum.mul(x[8], y[19]);
 1848|     22|   accum.mul(x[9], y[18]);
 1849|     22|   accum.mul(x[10], y[17]);
 1850|     22|   accum.mul(x[11], y[16]);
 1851|     22|   accum.mul(x[12], y[15]);
 1852|     22|   accum.mul(x[13], y[14]);
 1853|     22|   accum.mul(x[14], y[13]);
 1854|     22|   accum.mul(x[15], y[12]);
 1855|     22|   accum.mul(x[16], y[11]);
 1856|     22|   accum.mul(x[17], y[10]);
 1857|     22|   accum.mul(x[18], y[9]);
 1858|     22|   accum.mul(x[19], y[8]);
 1859|     22|   accum.mul(x[20], y[7]);
 1860|     22|   accum.mul(x[21], y[6]);
 1861|     22|   accum.mul(x[22], y[5]);
 1862|     22|   accum.mul(x[23], y[4]);
 1863|     22|   z[27] = accum.extract();
 1864|     22|   accum.mul(x[5], y[23]);
 1865|     22|   accum.mul(x[6], y[22]);
 1866|     22|   accum.mul(x[7], y[21]);
 1867|     22|   accum.mul(x[8], y[20]);
 1868|     22|   accum.mul(x[9], y[19]);
 1869|     22|   accum.mul(x[10], y[18]);
 1870|     22|   accum.mul(x[11], y[17]);
 1871|     22|   accum.mul(x[12], y[16]);
 1872|     22|   accum.mul(x[13], y[15]);
 1873|     22|   accum.mul(x[14], y[14]);
 1874|     22|   accum.mul(x[15], y[13]);
 1875|     22|   accum.mul(x[16], y[12]);
 1876|     22|   accum.mul(x[17], y[11]);
 1877|     22|   accum.mul(x[18], y[10]);
 1878|     22|   accum.mul(x[19], y[9]);
 1879|     22|   accum.mul(x[20], y[8]);
 1880|     22|   accum.mul(x[21], y[7]);
 1881|     22|   accum.mul(x[22], y[6]);
 1882|     22|   accum.mul(x[23], y[5]);
 1883|     22|   z[28] = accum.extract();
 1884|     22|   accum.mul(x[6], y[23]);
 1885|     22|   accum.mul(x[7], y[22]);
 1886|     22|   accum.mul(x[8], y[21]);
 1887|     22|   accum.mul(x[9], y[20]);
 1888|     22|   accum.mul(x[10], y[19]);
 1889|     22|   accum.mul(x[11], y[18]);
 1890|     22|   accum.mul(x[12], y[17]);
 1891|     22|   accum.mul(x[13], y[16]);
 1892|     22|   accum.mul(x[14], y[15]);
 1893|     22|   accum.mul(x[15], y[14]);
 1894|     22|   accum.mul(x[16], y[13]);
 1895|     22|   accum.mul(x[17], y[12]);
 1896|     22|   accum.mul(x[18], y[11]);
 1897|     22|   accum.mul(x[19], y[10]);
 1898|     22|   accum.mul(x[20], y[9]);
 1899|     22|   accum.mul(x[21], y[8]);
 1900|     22|   accum.mul(x[22], y[7]);
 1901|     22|   accum.mul(x[23], y[6]);
 1902|     22|   z[29] = accum.extract();
 1903|     22|   accum.mul(x[7], y[23]);
 1904|     22|   accum.mul(x[8], y[22]);
 1905|     22|   accum.mul(x[9], y[21]);
 1906|     22|   accum.mul(x[10], y[20]);
 1907|     22|   accum.mul(x[11], y[19]);
 1908|     22|   accum.mul(x[12], y[18]);
 1909|     22|   accum.mul(x[13], y[17]);
 1910|     22|   accum.mul(x[14], y[16]);
 1911|     22|   accum.mul(x[15], y[15]);
 1912|     22|   accum.mul(x[16], y[14]);
 1913|     22|   accum.mul(x[17], y[13]);
 1914|     22|   accum.mul(x[18], y[12]);
 1915|     22|   accum.mul(x[19], y[11]);
 1916|     22|   accum.mul(x[20], y[10]);
 1917|     22|   accum.mul(x[21], y[9]);
 1918|     22|   accum.mul(x[22], y[8]);
 1919|     22|   accum.mul(x[23], y[7]);
 1920|     22|   z[30] = accum.extract();
 1921|     22|   accum.mul(x[8], y[23]);
 1922|     22|   accum.mul(x[9], y[22]);
 1923|     22|   accum.mul(x[10], y[21]);
 1924|     22|   accum.mul(x[11], y[20]);
 1925|     22|   accum.mul(x[12], y[19]);
 1926|     22|   accum.mul(x[13], y[18]);
 1927|     22|   accum.mul(x[14], y[17]);
 1928|     22|   accum.mul(x[15], y[16]);
 1929|     22|   accum.mul(x[16], y[15]);
 1930|     22|   accum.mul(x[17], y[14]);
 1931|     22|   accum.mul(x[18], y[13]);
 1932|     22|   accum.mul(x[19], y[12]);
 1933|     22|   accum.mul(x[20], y[11]);
 1934|     22|   accum.mul(x[21], y[10]);
 1935|     22|   accum.mul(x[22], y[9]);
 1936|     22|   accum.mul(x[23], y[8]);
 1937|     22|   z[31] = accum.extract();
 1938|     22|   accum.mul(x[9], y[23]);
 1939|     22|   accum.mul(x[10], y[22]);
 1940|     22|   accum.mul(x[11], y[21]);
 1941|     22|   accum.mul(x[12], y[20]);
 1942|     22|   accum.mul(x[13], y[19]);
 1943|     22|   accum.mul(x[14], y[18]);
 1944|     22|   accum.mul(x[15], y[17]);
 1945|     22|   accum.mul(x[16], y[16]);
 1946|     22|   accum.mul(x[17], y[15]);
 1947|     22|   accum.mul(x[18], y[14]);
 1948|     22|   accum.mul(x[19], y[13]);
 1949|     22|   accum.mul(x[20], y[12]);
 1950|     22|   accum.mul(x[21], y[11]);
 1951|     22|   accum.mul(x[22], y[10]);
 1952|     22|   accum.mul(x[23], y[9]);
 1953|     22|   z[32] = accum.extract();
 1954|     22|   accum.mul(x[10], y[23]);
 1955|     22|   accum.mul(x[11], y[22]);
 1956|     22|   accum.mul(x[12], y[21]);
 1957|     22|   accum.mul(x[13], y[20]);
 1958|     22|   accum.mul(x[14], y[19]);
 1959|     22|   accum.mul(x[15], y[18]);
 1960|     22|   accum.mul(x[16], y[17]);
 1961|     22|   accum.mul(x[17], y[16]);
 1962|     22|   accum.mul(x[18], y[15]);
 1963|     22|   accum.mul(x[19], y[14]);
 1964|     22|   accum.mul(x[20], y[13]);
 1965|     22|   accum.mul(x[21], y[12]);
 1966|     22|   accum.mul(x[22], y[11]);
 1967|     22|   accum.mul(x[23], y[10]);
 1968|     22|   z[33] = accum.extract();
 1969|     22|   accum.mul(x[11], y[23]);
 1970|     22|   accum.mul(x[12], y[22]);
 1971|     22|   accum.mul(x[13], y[21]);
 1972|     22|   accum.mul(x[14], y[20]);
 1973|     22|   accum.mul(x[15], y[19]);
 1974|     22|   accum.mul(x[16], y[18]);
 1975|     22|   accum.mul(x[17], y[17]);
 1976|     22|   accum.mul(x[18], y[16]);
 1977|     22|   accum.mul(x[19], y[15]);
 1978|     22|   accum.mul(x[20], y[14]);
 1979|     22|   accum.mul(x[21], y[13]);
 1980|     22|   accum.mul(x[22], y[12]);
 1981|     22|   accum.mul(x[23], y[11]);
 1982|     22|   z[34] = accum.extract();
 1983|     22|   accum.mul(x[12], y[23]);
 1984|     22|   accum.mul(x[13], y[22]);
 1985|     22|   accum.mul(x[14], y[21]);
 1986|     22|   accum.mul(x[15], y[20]);
 1987|     22|   accum.mul(x[16], y[19]);
 1988|     22|   accum.mul(x[17], y[18]);
 1989|     22|   accum.mul(x[18], y[17]);
 1990|     22|   accum.mul(x[19], y[16]);
 1991|     22|   accum.mul(x[20], y[15]);
 1992|     22|   accum.mul(x[21], y[14]);
 1993|     22|   accum.mul(x[22], y[13]);
 1994|     22|   accum.mul(x[23], y[12]);
 1995|     22|   z[35] = accum.extract();
 1996|     22|   accum.mul(x[13], y[23]);
 1997|     22|   accum.mul(x[14], y[22]);
 1998|     22|   accum.mul(x[15], y[21]);
 1999|     22|   accum.mul(x[16], y[20]);
 2000|     22|   accum.mul(x[17], y[19]);
 2001|     22|   accum.mul(x[18], y[18]);
 2002|     22|   accum.mul(x[19], y[17]);
 2003|     22|   accum.mul(x[20], y[16]);
 2004|     22|   accum.mul(x[21], y[15]);
 2005|     22|   accum.mul(x[22], y[14]);
 2006|     22|   accum.mul(x[23], y[13]);
 2007|     22|   z[36] = accum.extract();
 2008|     22|   accum.mul(x[14], y[23]);
 2009|     22|   accum.mul(x[15], y[22]);
 2010|     22|   accum.mul(x[16], y[21]);
 2011|     22|   accum.mul(x[17], y[20]);
 2012|     22|   accum.mul(x[18], y[19]);
 2013|     22|   accum.mul(x[19], y[18]);
 2014|     22|   accum.mul(x[20], y[17]);
 2015|     22|   accum.mul(x[21], y[16]);
 2016|     22|   accum.mul(x[22], y[15]);
 2017|     22|   accum.mul(x[23], y[14]);
 2018|     22|   z[37] = accum.extract();
 2019|     22|   accum.mul(x[15], y[23]);
 2020|     22|   accum.mul(x[16], y[22]);
 2021|     22|   accum.mul(x[17], y[21]);
 2022|     22|   accum.mul(x[18], y[20]);
 2023|     22|   accum.mul(x[19], y[19]);
 2024|     22|   accum.mul(x[20], y[18]);
 2025|     22|   accum.mul(x[21], y[17]);
 2026|     22|   accum.mul(x[22], y[16]);
 2027|     22|   accum.mul(x[23], y[15]);
 2028|     22|   z[38] = accum.extract();
 2029|     22|   accum.mul(x[16], y[23]);
 2030|     22|   accum.mul(x[17], y[22]);
 2031|     22|   accum.mul(x[18], y[21]);
 2032|     22|   accum.mul(x[19], y[20]);
 2033|     22|   accum.mul(x[20], y[19]);
 2034|     22|   accum.mul(x[21], y[18]);
 2035|     22|   accum.mul(x[22], y[17]);
 2036|     22|   accum.mul(x[23], y[16]);
 2037|     22|   z[39] = accum.extract();
 2038|     22|   accum.mul(x[17], y[23]);
 2039|     22|   accum.mul(x[18], y[22]);
 2040|     22|   accum.mul(x[19], y[21]);
 2041|     22|   accum.mul(x[20], y[20]);
 2042|     22|   accum.mul(x[21], y[19]);
 2043|     22|   accum.mul(x[22], y[18]);
 2044|     22|   accum.mul(x[23], y[17]);
 2045|     22|   z[40] = accum.extract();
 2046|     22|   accum.mul(x[18], y[23]);
 2047|     22|   accum.mul(x[19], y[22]);
 2048|     22|   accum.mul(x[20], y[21]);
 2049|     22|   accum.mul(x[21], y[20]);
 2050|     22|   accum.mul(x[22], y[19]);
 2051|     22|   accum.mul(x[23], y[18]);
 2052|     22|   z[41] = accum.extract();
 2053|     22|   accum.mul(x[19], y[23]);
 2054|     22|   accum.mul(x[20], y[22]);
 2055|     22|   accum.mul(x[21], y[21]);
 2056|     22|   accum.mul(x[22], y[20]);
 2057|     22|   accum.mul(x[23], y[19]);
 2058|     22|   z[42] = accum.extract();
 2059|     22|   accum.mul(x[20], y[23]);
 2060|     22|   accum.mul(x[21], y[22]);
 2061|     22|   accum.mul(x[22], y[21]);
 2062|     22|   accum.mul(x[23], y[20]);
 2063|     22|   z[43] = accum.extract();
 2064|     22|   accum.mul(x[21], y[23]);
 2065|     22|   accum.mul(x[22], y[22]);
 2066|     22|   accum.mul(x[23], y[21]);
 2067|     22|   z[44] = accum.extract();
 2068|     22|   accum.mul(x[22], y[23]);
 2069|     22|   accum.mul(x[23], y[22]);
 2070|     22|   z[45] = accum.extract();
 2071|     22|   accum.mul(x[23], y[23]);
 2072|     22|   z[46] = accum.extract();
 2073|     22|   z[47] = accum.extract();
 2074|     22|}

_ZN5Botan12basecase_mulEPmmPKmmS2_m:
   20|    118|void basecase_mul(word z[], size_t z_size, const word x[], size_t x_size, const word y[], size_t y_size) {
   21|    118|   if(z_size < x_size + y_size) {
  ------------------
  |  Branch (21:7): [True: 0, False: 118]
  ------------------
   22|      0|      throw Invalid_Argument("basecase_mul z_size too small");
   23|      0|   }
   24|       |
   25|    118|   const size_t x_size_8 = x_size - (x_size % 8);
   26|       |
   27|    118|   zeroize_buffer(z, z_size);
   28|       |
   29|  2.07k|   for(size_t i = 0; i != y_size; ++i) {
  ------------------
  |  Branch (29:22): [True: 1.95k, False: 118]
  ------------------
   30|  1.95k|      const word y_i = y[i];
   31|       |
   32|  1.95k|      word carry = 0;
   33|       |
   34|  4.28k|      for(size_t j = 0; j != x_size_8; j += 8) {
  ------------------
  |  Branch (34:25): [True: 2.33k, False: 1.95k]
  ------------------
   35|  2.33k|         carry = word8_madd3(z + i + j, x + j, y_i, carry);
   36|  2.33k|      }
   37|       |
   38|  7.22k|      for(size_t j = x_size_8; j != x_size; ++j) {
  ------------------
  |  Branch (38:32): [True: 5.27k, False: 1.95k]
  ------------------
   39|  5.27k|         z[i + j] = word_madd3(x[j], y_i, z[i + j], &carry);
   40|  5.27k|      }
   41|       |
   42|  1.95k|      z[x_size + i] = carry;
   43|  1.95k|   }
   44|    118|}
_ZN5Botan10bigint_mulEPmmPKmmmS2_mmS0_m:
  292|    235|                size_t ws_size) {
  293|    235|   zeroize_buffer(z, z_size);
  294|       |
  295|    235|   if(x_sw == 1) {
  ------------------
  |  Branch (295:7): [True: 0, False: 235]
  ------------------
  296|      0|      bigint_linmul3(z, y, y_sw, x[0]);
  297|    235|   } else if(y_sw == 1) {
  ------------------
  |  Branch (297:14): [True: 0, False: 235]
  ------------------
  298|      0|      bigint_linmul3(z, x, x_sw, y[0]);
  299|    235|   } else if(sized_for_comba_mul<4>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (299:14): [True: 36, False: 199]
  ------------------
  300|     36|      bigint_comba_mul4(z, x, y);
  301|    199|   } else if(sized_for_comba_mul<6>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (301:14): [True: 22, False: 177]
  ------------------
  302|     22|      bigint_comba_mul6(z, x, y);
  303|    177|   } else if(sized_for_comba_mul<8>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (303:14): [True: 14, False: 163]
  ------------------
  304|     14|      bigint_comba_mul8(z, x, y);
  305|    163|   } else if(sized_for_comba_mul<9>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (305:14): [True: 8, False: 155]
  ------------------
  306|      8|      bigint_comba_mul9(z, x, y);
  307|    155|   } else if(sized_for_comba_mul<16>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (307:14): [True: 20, False: 135]
  ------------------
  308|     20|      bigint_comba_mul16(z, x, y);
  309|    135|   } else if(sized_for_comba_mul<24>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (309:14): [True: 22, False: 113]
  ------------------
  310|     22|      bigint_comba_mul24(z, x, y);
  311|    113|   } else if(x_sw < KARATSUBA_MULTIPLY_THRESHOLD || y_sw < KARATSUBA_MULTIPLY_THRESHOLD || workspace == nullptr) {
  ------------------
  |  Branch (311:14): [True: 71, False: 42]
  |  Branch (311:53): [True: 35, False: 7]
  |  Branch (311:92): [True: 0, False: 7]
  ------------------
  312|    106|      basecase_mul(z, z_size, x, x_sw, y, y_sw);
  313|    106|   } else {
  314|      7|      const size_t N = karatsuba_size(z_size, x_size, x_sw, y_size, y_sw);
  315|       |
  316|      7|      if(N > 0 && z_size >= 2 * N && ws_size >= 2 * N) {
  ------------------
  |  Branch (316:10): [True: 7, False: 0]
  |  Branch (316:19): [True: 7, False: 0]
  |  Branch (316:38): [True: 7, False: 0]
  ------------------
  317|      7|         karatsuba_mul(z, x, y, N, workspace);
  318|      7|      } else {
  319|      0|         basecase_mul(z, z_size, x, x_sw, y, y_sw);
  320|      0|      }
  321|      7|   }
  322|    235|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_114karatsuba_sizeEmmmmm:
  203|      7|size_t karatsuba_size(size_t z_size, size_t x_size, size_t x_sw, size_t y_size, size_t y_sw) {
  204|      7|   if(x_sw > x_size || x_sw > y_size || y_sw > x_size || y_sw > y_size) {
  ------------------
  |  Branch (204:7): [True: 0, False: 7]
  |  Branch (204:24): [True: 0, False: 7]
  |  Branch (204:41): [True: 0, False: 7]
  |  Branch (204:58): [True: 0, False: 7]
  ------------------
  205|      0|      return 0;
  206|      0|   }
  207|       |
  208|      7|   if(((x_size == x_sw) && (x_size % 2 != 0)) || ((y_size == y_sw) && (y_size % 2 != 0))) {
  ------------------
  |  Branch (208:8): [True: 0, False: 7]
  |  Branch (208:28): [True: 0, False: 0]
  |  Branch (208:51): [True: 0, False: 7]
  |  Branch (208:71): [True: 0, False: 0]
  ------------------
  209|      0|      return 0;
  210|      0|   }
  211|       |
  212|      7|   const size_t start = (x_sw > y_sw) ? x_sw : y_sw;
  ------------------
  |  Branch (212:25): [True: 3, False: 4]
  ------------------
  213|      7|   const size_t end = (x_size < y_size) ? x_size : y_size;
  ------------------
  |  Branch (213:23): [True: 7, False: 0]
  ------------------
  214|       |
  215|      7|   if(start == end) {
  ------------------
  |  Branch (215:7): [True: 0, False: 7]
  ------------------
  216|      0|      if(start % 2 != 0) {
  ------------------
  |  Branch (216:10): [True: 0, False: 0]
  ------------------
  217|      0|         return 0;
  218|      0|      }
  219|      0|      return start;
  220|      0|   }
  221|       |
  222|     11|   for(size_t j = start; j <= end; ++j) {
  ------------------
  |  Branch (222:26): [True: 11, False: 0]
  ------------------
  223|     11|      if(j % 2 != 0) {
  ------------------
  |  Branch (223:10): [True: 4, False: 7]
  ------------------
  224|      4|         continue;
  225|      4|      }
  226|       |
  227|      7|      if(2 * j > z_size) {
  ------------------
  |  Branch (227:10): [True: 0, False: 7]
  ------------------
  228|      0|         return 0;
  229|      0|      }
  230|       |
  231|      7|      if(x_sw <= j && j <= x_size && y_sw <= j && j <= y_size) {
  ------------------
  |  Branch (231:10): [True: 7, False: 0]
  |  Branch (231:23): [True: 7, False: 0]
  |  Branch (231:38): [True: 7, False: 0]
  |  Branch (231:51): [True: 7, False: 0]
  ------------------
  232|      7|         if(j % 4 == 2 && (j + 2) <= x_size && (j + 2) <= y_size && 2 * (j + 2) <= z_size) {
  ------------------
  |  Branch (232:13): [True: 4, False: 3]
  |  Branch (232:27): [True: 4, False: 0]
  |  Branch (232:48): [True: 4, False: 0]
  |  Branch (232:69): [True: 4, False: 0]
  ------------------
  233|      4|            return j + 2;
  234|      4|         }
  235|      3|         return j;
  236|      7|      }
  237|      7|   }
  238|       |
  239|      0|   return 0;
  240|      7|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_113karatsuba_mulEPmPKmS3_mS1_:
   80|     28|void karatsuba_mul(word z[], const word x[], const word y[], size_t N, word workspace[]) {
   81|     28|   if(N < KARATSUBA_MULTIPLY_THRESHOLD || N % 2 != 0) {
  ------------------
  |  Branch (81:7): [True: 21, False: 7]
  |  Branch (81:43): [True: 0, False: 7]
  ------------------
   82|     21|      switch(N) {
   83|      0|         case 6:
  ------------------
  |  Branch (83:10): [True: 0, False: 21]
  ------------------
   84|      0|            return bigint_comba_mul6(z, x, y);
   85|      0|         case 8:
  ------------------
  |  Branch (85:10): [True: 0, False: 21]
  ------------------
   86|      0|            return bigint_comba_mul8(z, x, y);
   87|      0|         case 9:
  ------------------
  |  Branch (87:10): [True: 0, False: 21]
  ------------------
   88|      0|            return bigint_comba_mul9(z, x, y);
   89|      9|         case 16:
  ------------------
  |  Branch (89:10): [True: 9, False: 12]
  ------------------
   90|      9|            return bigint_comba_mul16(z, x, y);
   91|      0|         case 24:
  ------------------
  |  Branch (91:10): [True: 0, False: 21]
  ------------------
   92|      0|            return bigint_comba_mul24(z, x, y);
   93|     12|         default:
  ------------------
  |  Branch (93:10): [True: 12, False: 9]
  ------------------
   94|     12|            return basecase_mul(z, 2 * N, x, N, y, N);
   95|     21|      }
   96|     21|   }
   97|       |
   98|      7|   const size_t N2 = N / 2;
   99|       |
  100|      7|   const word* x0 = x;
  101|      7|   const word* x1 = x + N2;
  102|      7|   const word* y0 = y;
  103|      7|   const word* y1 = y + N2;
  104|      7|   word* z0 = z;
  105|      7|   word* z1 = z + N;
  106|       |
  107|      7|   word* ws0 = workspace;
  108|      7|   word* ws1 = workspace + N;
  109|       |
  110|      7|   zeroize_buffer(workspace, 2 * N);
  111|       |
  112|       |   /*
  113|       |   * If either of cmp0 or cmp1 is zero then z0 or z1 resp is zero here,
  114|       |   * resulting in a no-op - z0*z1 will be equal to zero so we don't need to do
  115|       |   * anything, zeroize_buffer above already set the correct result.
  116|       |   *
  117|       |   * However we ignore the result of the comparisons and always perform the
  118|       |   * subtractions and recursively multiply to avoid the timing channel.
  119|       |   */
  120|       |
  121|       |   // First compute (X_lo - X_hi)*(Y_hi - Y_lo)
  122|      7|   const auto cmp0 = bigint_sub_abs(z0, x0, x1, N2, workspace);
  123|      7|   const auto cmp1 = bigint_sub_abs(z1, y1, y0, N2, workspace);
  124|      7|   const auto neg_mask = ~(cmp0 ^ cmp1);
  125|       |
  126|      7|   karatsuba_mul(ws0, z0, z1, N2, ws1);
  127|       |
  128|       |   // Compute X_lo * Y_lo
  129|      7|   karatsuba_mul(z0, x0, y0, N2, ws1);
  130|       |
  131|       |   // Compute X_hi * Y_hi
  132|      7|   karatsuba_mul(z1, x1, y1, N2, ws1);
  133|       |
  134|      7|   const word ws_carry = bigint_add3(ws1, z0, N, z1, N);
  135|      7|   word z_carry = bigint_add2(z + N2, N, ws1, N);
  136|       |
  137|      7|   z_carry += bigint_add2(z + N + N2, N2, &ws_carry, 1);
  138|      7|   bigint_add2(z + N + N2, N2, &z_carry, 1);
  139|       |
  140|      7|   zeroize_buffer(workspace + N, N2);
  141|       |
  142|      7|   bigint_cnd_add(neg_mask.value(), z + N2, workspace, 2 * N - N2);
  143|      7|   bigint_cnd_sub((~neg_mask).value(), z + N2, workspace, 2 * N - N2);
  144|      7|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm4EEEbmmmmm:
  272|    235|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) {
  273|    235|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (273:12): [True: 74, False: 161]
  |  Branch (273:26): [True: 74, False: 0]
  |  Branch (273:42): [True: 36, False: 38]
  |  Branch (273:56): [True: 36, False: 0]
  |  Branch (273:72): [True: 36, False: 0]
  ------------------
  274|    235|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm6EEEbmmmmm:
  272|    199|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) {
  273|    199|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (273:12): [True: 57, False: 142]
  |  Branch (273:26): [True: 57, False: 0]
  |  Branch (273:42): [True: 22, False: 35]
  |  Branch (273:56): [True: 22, False: 0]
  |  Branch (273:72): [True: 22, False: 0]
  ------------------
  274|    199|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm8EEEbmmmmm:
  272|    177|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) {
  273|    177|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (273:12): [True: 63, False: 114]
  |  Branch (273:26): [True: 63, False: 0]
  |  Branch (273:42): [True: 14, False: 49]
  |  Branch (273:56): [True: 14, False: 0]
  |  Branch (273:72): [True: 14, False: 0]
  ------------------
  274|    177|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm9EEEbmmmmm:
  272|    163|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) {
  273|    163|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (273:12): [True: 55, False: 108]
  |  Branch (273:26): [True: 22, False: 33]
  |  Branch (273:42): [True: 8, False: 14]
  |  Branch (273:56): [True: 8, False: 0]
  |  Branch (273:72): [True: 8, False: 0]
  ------------------
  274|    163|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm16EEEbmmmmm:
  272|    155|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) {
  273|    155|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (273:12): [True: 72, False: 83]
  |  Branch (273:26): [True: 39, False: 33]
  |  Branch (273:42): [True: 20, False: 19]
  |  Branch (273:56): [True: 20, False: 0]
  |  Branch (273:72): [True: 20, False: 0]
  ------------------
  274|    155|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm24EEEbmmmmm:
  272|    135|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) {
  273|    135|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (273:12): [True: 74, False: 61]
  |  Branch (273:26): [True: 28, False: 46]
  |  Branch (273:42): [True: 22, False: 6]
  |  Branch (273:56): [True: 22, False: 0]
  |  Branch (273:72): [True: 22, False: 0]
  ------------------
  274|    135|}

_ZN5Botan15allocate_memoryEmm:
   21|  49.2k|BOTAN_MALLOC_FN void* allocate_memory(size_t elems, size_t elem_size) {
   22|  49.2k|   if(elems == 0 || elem_size == 0) {
  ------------------
  |  Branch (22:7): [True: 0, False: 49.2k]
  |  Branch (22:21): [True: 0, False: 49.2k]
  ------------------
   23|      0|      return nullptr;
   24|      0|   }
   25|       |
   26|       |   // Some calloc implementations do not check for overflow (?!?)
   27|  49.2k|   if(!checked_mul(elems, elem_size).has_value()) {
  ------------------
  |  Branch (27:7): [True: 0, False: 49.2k]
  ------------------
   28|      0|      throw std::bad_alloc();
   29|      0|   }
   30|       |
   31|       |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR)
   32|       |   // NOLINTNEXTLINE(*-const-correctness) bug in clang-tidy
   33|       |   if(void* p = mlock_allocator::instance().allocate(elems, elem_size)) {
   34|       |      return p;
   35|       |   }
   36|       |#endif
   37|       |
   38|       |#if defined(BOTAN_TARGET_OS_HAS_ALLOC_CONCEAL)
   39|       |   void* ptr = ::calloc_conceal(elems, elem_size);
   40|       |#else
   41|       |   // NOLINTNEXTLINE(*-const-correctness) bug in clang-tidy
   42|  49.2k|   void* ptr = std::calloc(elems, elem_size);  // NOLINT(*-no-malloc,*-owning-memory)
   43|  49.2k|#endif
   44|  49.2k|   if(ptr == nullptr) {
  ------------------
  |  Branch (44:7): [True: 0, False: 49.2k]
  ------------------
   45|      0|      [[unlikely]] throw std::bad_alloc();
   46|      0|   }
   47|  49.2k|   return ptr;
   48|  49.2k|}
_ZN5Botan17deallocate_memoryEPvmm:
   50|  49.2k|void deallocate_memory(void* p, size_t elems, size_t elem_size) {
   51|  49.2k|   if(p == nullptr) {
  ------------------
  |  Branch (51:7): [True: 0, False: 49.2k]
  ------------------
   52|      0|      [[unlikely]] return;
   53|      0|   }
   54|       |
   55|  49.2k|   secure_scrub_memory(p, elems * elem_size);
   56|       |
   57|       |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR)
   58|       |   if(mlock_allocator::instance().deallocate(p, elems, elem_size)) {
   59|       |      return;
   60|       |   }
   61|       |#endif
   62|       |
   63|  49.2k|   std::free(p);  // NOLINT(*-no-malloc,*-owning-memory)
   64|  49.2k|}

_ZN5Botan19secure_scrub_memoryEPvm:
   25|  49.2k|void secure_scrub_memory(void* ptr, size_t n) {
   26|  49.2k|   return secure_zeroize_buffer(ptr, n);
   27|  49.2k|}
_ZN5Botan21secure_zeroize_bufferEPvm:
   29|  49.2k|void secure_zeroize_buffer(void* ptr, size_t n) {
   30|  49.2k|   if(n == 0) {
  ------------------
  |  Branch (30:7): [True: 0, False: 49.2k]
  ------------------
   31|      0|      return;
   32|      0|   }
   33|       |
   34|       |#if defined(BOTAN_TARGET_OS_HAS_RTLSECUREZEROMEMORY)
   35|       |   ::RtlSecureZeroMemory(ptr, n);
   36|       |
   37|       |#elif defined(BOTAN_TARGET_OS_HAS_EXPLICIT_BZERO)
   38|  49.2k|   ::explicit_bzero(ptr, n);
   39|       |
   40|       |#elif defined(BOTAN_TARGET_OS_HAS_EXPLICIT_MEMSET)
   41|       |   (void)::explicit_memset(ptr, 0, n);
   42|       |
   43|       |#else
   44|       |   /*
   45|       |   * Call memset through a static volatile pointer, which the compiler should
   46|       |   * not elide. This construct should be safe in conforming compilers, but who
   47|       |   * knows. This has been checked to generate the expected code, which saves the
   48|       |   * memset address in the data segment and unconditionally loads and jumps to
   49|       |   * that address, with the following targets:
   50|       |   *
   51|       |   * x86-64: Clang 19, GCC 6, 11, 13, 14
   52|       |   * riscv64: GCC 14
   53|       |   * aarch64: GCC 14
   54|       |   * armv7: GCC 14
   55|       |   *
   56|       |   * Actually all of them generated the expected jump even without marking the
   57|       |   * function pointer as volatile. However this seems worth including as an
   58|       |   * additional precaution.
   59|       |   */
   60|       |   static void* (*const volatile memset_ptr)(void*, int, size_t) = std::memset;
   61|       |   (memset_ptr)(ptr, 0, n);
   62|       |#endif
   63|  49.2k|}