_ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EED2Ev:
   64|      1|      ~AlignmentBuffer() { secure_zeroize_buffer(m_buffer.data(), sizeof(T) * m_buffer.size()); }
_ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EEC2Ev:
   62|      1|      AlignmentBuffer() = default;
_ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE5clearEv:
   71|      7|      void clear() {
   72|      7|         zeroize_buffer(m_buffer.data(), m_buffer.size());
   73|      7|         m_position = 0;
   74|      7|      }
_ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE21handle_unaligned_dataERNS_12BufferSlicerE:
  166|      9|      [[nodiscard]] std::optional<std::span<const T>> handle_unaligned_data(BufferSlicer& slicer) {
  167|       |         // When the final block is to be deferred, we would need to store and
  168|       |         // hold a buffer that contains exactly one block until more data is
  169|       |         // passed or it is explicitly consumed.
  170|      9|         const size_t defer = (defers_final_block()) ? 1 : 0;
  ------------------
  |  Branch (170:31): [True: 0, False: 9]
  ------------------
  171|       |
  172|      9|         if(in_alignment() && slicer.remaining() >= m_buffer.size() + defer) {
  ------------------
  |  Branch (172:13): [True: 9, False: 0]
  |  Branch (172:31): [True: 6, False: 3]
  ------------------
  173|       |            // We are currently in alignment and the passed-in data source
  174|       |            // contains enough data to benefit from aligned processing.
  175|       |            // Therefore, we don't copy anything into the intermittent buffer.
  176|      6|            return std::nullopt;
  177|      6|         }
  178|       |
  179|       |         // Fill the buffer with as much input data as needed to reach alignment
  180|       |         // or until the input source is depleted.
  181|      3|         const auto elements_to_consume = std::min(m_buffer.size() - m_position, slicer.remaining());
  182|      3|         append(slicer.take(elements_to_consume));
  183|       |
  184|       |         // If we collected enough data, we push out one full block. When
  185|       |         // deferring the final block is enabled, we additionally check that
  186|       |         // more input data is available to continue processing a consecutive
  187|       |         // block.
  188|      3|         if(ready_to_consume() && (!defers_final_block() || !slicer.empty())) {
  ------------------
  |  Branch (188:13): [True: 0, False: 3]
  |  Branch (188:36): [True: 0, False: 0]
  |  Branch (188:61): [True: 0, False: 0]
  ------------------
  189|      0|            return consume();
  190|      3|         } else {
  191|      3|            return std::nullopt;
  192|      3|         }
  193|      3|      }
_ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE18defers_final_blockEv:
  233|     15|      constexpr bool defers_final_block() const {
  234|     15|         return FINAL_BLOCK_STRATEGY == AlignmentBufferFinalBlock::must_be_deferred;
  235|     15|      }
_ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE6appendENSt3__14spanIKhLm18446744073709551615EEE:
   90|      7|      void append(std::span<const T> elements) {
   91|      7|         BOTAN_ASSERT_NOMSG(elements.size() <= elements_until_alignment());
  ------------------
  |  |   77|      7|   do {                                                                     \
  |  |   78|      7|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      7|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 7]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      7|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 7]
  |  |  ------------------
  ------------------
   92|      7|         std::copy(elements.begin(), elements.end(), m_buffer.begin() + m_position);
   93|      7|         m_position += elements.size();
   94|      7|      }
_ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE24elements_until_alignmentEv:
  221|     19|      size_t elements_until_alignment() const { return m_buffer.size() - m_position; }
_ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE16ready_to_consumeEv:
  231|     15|      bool ready_to_consume() const { return m_position == m_buffer.size(); }
_ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE7consumeEv:
  200|      4|      [[nodiscard]] std::span<const T> consume() {
  201|      4|         BOTAN_ASSERT_NOMSG(ready_to_consume());
  ------------------
  |  |   77|      4|   do {                                                                     \
  |  |   78|      4|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      4|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 4]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      4|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 4]
  |  |  ------------------
  ------------------
  202|      4|         m_position = 0;
  203|      4|         return m_buffer;
  204|      4|      }
_ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE12in_alignmentEv:
  226|     24|      bool in_alignment() const { return m_position == 0; }
_ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE23aligned_data_to_processERNS_12BufferSlicerE:
  126|      6|      [[nodiscard]] std::tuple<std::span<const uint8_t>, size_t> aligned_data_to_process(BufferSlicer& slicer) const {
  127|      6|         BOTAN_ASSERT_NOMSG(in_alignment());
  ------------------
  |  |   77|      6|   do {                                                                     \
  |  |   78|      6|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      6|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 6]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      6|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 6]
  |  |  ------------------
  ------------------
  128|       |
  129|       |         // When the final block is to be deferred, the last block must not be
  130|       |         // selected for processing if there is no (unaligned) extra input data.
  131|      6|         const size_t defer = (defers_final_block()) ? 1 : 0;
  ------------------
  |  Branch (131:31): [True: 0, False: 6]
  ------------------
  132|      6|         const size_t full_blocks_to_process = (slicer.remaining() - defer) / m_buffer.size();
  133|      6|         return {slicer.take(full_blocks_to_process * m_buffer.size()), full_blocks_to_process};
  134|      6|      }
_ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE18fill_up_with_zerosEv:
   79|      4|      void fill_up_with_zeros() {
   80|      4|         if(!ready_to_consume()) {
  ------------------
  |  Branch (80:13): [True: 4, False: 0]
  ------------------
   81|      4|            zeroize_buffer(&m_buffer[m_position], elements_until_alignment());
   82|      4|            m_position = m_buffer.size();
   83|      4|         }
   84|      4|      }
_ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE20directly_modify_lastEm:
  113|      4|      std::span<T> directly_modify_last(size_t elements) {
  114|      4|         BOTAN_ASSERT_NOMSG(size() >= elements);
  ------------------
  |  |   77|      4|   do {                                                                     \
  |  |   78|      4|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      4|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 4]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      4|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 4]
  |  |  ------------------
  ------------------
  115|      4|         return std::span(m_buffer).last(elements);
  116|      4|      }
_ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE4sizeEv:
  217|      4|      constexpr size_t size() const { return m_buffer.size(); }

_ZNK5Botan17Barrett_Reduction4cubeERKNS_6BigIntE:
   66|      1|      BigInt cube(const BigInt& x) const { return this->multiply(x, this->square(x)); }

_ZN5Botan17ct_expand_top_bitITkNSt3__117unsigned_integralEmEET_S2_:
   28|  28.3M|BOTAN_FORCE_INLINE constexpr T ct_expand_top_bit(T a) {
   29|  28.3M|   const T top = CT::value_barrier<T>(a >> (sizeof(T) * 8 - 1));
   30|  28.3M|   return static_cast<T>(0) - top;
   31|  28.3M|}
_ZN5Botan10ct_is_zeroITkNSt3__117unsigned_integralEmEET_S2_:
   37|  28.3M|BOTAN_FORCE_INLINE constexpr T ct_is_zero(T x) {
   38|  28.3M|   return ct_expand_top_bit<T>(~x & (x - 1));
   39|  28.3M|}
_ZN5Botan8high_bitITkNSt3__117unsigned_integralEmEEmT_:
   73|    834|BOTAN_FORCE_INLINE constexpr size_t high_bit(T n) {
   74|    834|   size_t hb = 0;
   75|       |
   76|  5.83k|   for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) {
  ------------------
  |  Branch (76:38): [True: 5.00k, False: 834]
  ------------------
   77|       |      // Equivalent to: ((n >> s) == 0) ? 0 : s;
   78|  5.00k|      const size_t z = s - ct_if_is_zero_ret<T>(n >> s, s);
   79|  5.00k|      hb += z;
   80|  5.00k|      n >>= z;
   81|  5.00k|   }
   82|       |
   83|    834|   hb += n;
   84|       |
   85|    834|   return hb;
   86|    834|}
_ZN5Botan17ct_if_is_zero_retITkNSt3__117unsigned_integralEmEEmT_m:
   45|  5.00k|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|  5.00k|   const T a = ~x & (x - 1);
   51|  5.00k|   const size_t a_top = static_cast<size_t>(CT::value_barrier<T>(a >> (sizeof(T) * 8 - 1)));
   52|  5.00k|   const size_t mask = static_cast<size_t>(0) - a_top;
   53|  5.00k|   return mask & s;
   54|  5.00k|}
_ZN5Botan6chooseITkNSt3__117unsigned_integralEmEET_S2_S2_S2_:
  216|   237M|BOTAN_FORCE_INLINE constexpr T choose(T mask, T a, T b) {
  217|       |   //return (mask & a) | (~mask & b);
  218|   237M|   return (b ^ (mask & (a ^ b)));
  219|   237M|}
_ZN5Botan10ct_is_zeroITkNSt3__117unsigned_integralEhEET_S2_:
   37|  1.65k|BOTAN_FORCE_INLINE constexpr T ct_is_zero(T x) {
   38|  1.65k|   return ct_expand_top_bit<T>(~x & (x - 1));
   39|  1.65k|}
_ZN5Botan17ct_expand_top_bitITkNSt3__117unsigned_integralEhEET_S2_:
   28|  1.65k|BOTAN_FORCE_INLINE constexpr T ct_expand_top_bit(T a) {
   29|  1.65k|   const T top = CT::value_barrier<T>(a >> (sizeof(T) * 8 - 1));
   30|  1.65k|   return static_cast<T>(0) - top;
   31|  1.65k|}
_ZN5Botan8high_bitITkNSt3__117unsigned_integralEjEEmT_:
   73|      1|BOTAN_FORCE_INLINE constexpr size_t high_bit(T n) {
   74|      1|   size_t hb = 0;
   75|       |
   76|      6|   for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) {
  ------------------
  |  Branch (76:38): [True: 5, False: 1]
  ------------------
   77|       |      // Equivalent to: ((n >> s) == 0) ? 0 : s;
   78|      5|      const size_t z = s - ct_if_is_zero_ret<T>(n >> s, s);
   79|      5|      hb += z;
   80|      5|      n >>= z;
   81|      5|   }
   82|       |
   83|      1|   hb += n;
   84|       |
   85|      1|   return hb;
   86|      1|}
_ZN5Botan17ct_if_is_zero_retITkNSt3__117unsigned_integralEjEEmT_m:
   45|      5|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|      5|   const T a = ~x & (x - 1);
   51|      5|   const size_t a_top = static_cast<size_t>(CT::value_barrier<T>(a >> (sizeof(T) * 8 - 1)));
   52|      5|   const size_t mask = static_cast<size_t>(0) - a_top;
   53|      5|   return mask & s;
   54|      5|}

_ZN5Botan13reverse_bytesITkNSt3__117unsigned_integralEmQooooooeqstT_Li1EeqstS2_Li2EeqstS2_Li4EeqstS2_Li8EEES2_S2_:
   27|   224k|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|   224k|   } else if constexpr(sizeof(T) == 8) {
   45|   224k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap64)
   46|   224k|      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|   224k|   }
   57|   224k|}
_ZN5Botan13reverse_bytesITkNSt3__117unsigned_integralEjQooooooeqstT_Li1EeqstS2_Li2EeqstS2_Li4EeqstS2_Li8EEES2_S2_:
   27|     32|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|     32|   } else if constexpr(sizeof(T) == 4) {
   37|     32|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap32)
   38|     32|      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|       |   } else if constexpr(sizeof(T) == 8) {
   45|       |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap64)
   46|       |      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|       |   }
   57|     32|}

_ZN5Botan12BufferSlicerC2ENSt3__14spanIKhLm18446744073709551615EEE:
   25|      9|      explicit BufferSlicer(std::span<const uint8_t> buffer) : m_remaining(buffer) {}
_ZNK5Botan12BufferSlicer5emptyEv:
   68|     18|      bool empty() const { return m_remaining.empty(); }
_ZN5Botan12BufferSlicer4takeEm:
   37|      9|      std::span<const uint8_t> take(const size_t count) {
   38|      9|         BOTAN_STATE_CHECK(remaining() >= count);
  ------------------
  |  |   51|      9|   do {                                                         \
  |  |   52|      9|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */             \
  |  |   53|      9|      if(!(expr)) {                                             \
  |  |  ------------------
  |  |  |  Branch (53:10): [True: 0, False: 9]
  |  |  ------------------
  |  |   54|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */    \
  |  |   55|      0|         Botan::throw_invalid_state(#expr, __func__, __FILE__); \
  |  |   56|      0|      }                                                         \
  |  |   57|      9|   } while(0)
  |  |  ------------------
  |  |  |  Branch (57:12): [Folded, False: 9]
  |  |  ------------------
  ------------------
   39|      9|         auto result = m_remaining.first(count);
   40|      9|         m_remaining = m_remaining.subspan(count);
   41|      9|         return result;
   42|      9|      }
_ZNK5Botan12BufferSlicer9remainingEv:
   66|     27|      size_t remaining() const { return m_remaining.size(); }

_ZN5Botan13BufferStufferC2ENSt3__14spanIhLm18446744073709551615EEE:
   26|  4.95k|      constexpr explicit BufferStuffer(std::span<uint8_t> buffer) : m_buffer(buffer) {}
_ZN5Botan13BufferStuffer6appendEhm:
   64|  4.95k|      constexpr void append(uint8_t b, size_t repeat = 1) {
   65|  4.95k|         auto sink = next(repeat);
   66|  4.95k|         std::fill(sink.begin(), sink.end(), b);
   67|  4.95k|      }
_ZN5Botan13BufferStuffer4nextEm:
   32|  4.95k|      constexpr std::span<uint8_t> next(size_t bytes) {
   33|  4.95k|         BOTAN_STATE_CHECK(m_buffer.size() >= bytes);
  ------------------
  |  |   51|  4.95k|   do {                                                         \
  |  |   52|  4.95k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */             \
  |  |   53|  4.95k|      if(!(expr)) {                                             \
  |  |  ------------------
  |  |  |  Branch (53:10): [True: 0, False: 4.95k]
  |  |  ------------------
  |  |   54|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */    \
  |  |   55|      0|         Botan::throw_invalid_state(#expr, __func__, __FILE__); \
  |  |   56|      0|      }                                                         \
  |  |   57|  4.95k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (57:12): [Folded, False: 4.95k]
  |  |  ------------------
  ------------------
   34|       |
   35|  4.95k|         auto result = m_buffer.first(bytes);
   36|  4.95k|         m_buffer = m_buffer.subspan(bytes);
   37|  4.95k|         return result;
   38|  4.95k|      }
_ZN5Botan13BufferStuffer4nextILm64EEENSt3__14spanIhXT_EEEv:
   41|  9.91k|      constexpr std::span<uint8_t, bytes> next() {
   42|  9.91k|         BOTAN_STATE_CHECK(m_buffer.size() >= bytes);
  ------------------
  |  |   51|  9.91k|   do {                                                         \
  |  |   52|  9.91k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */             \
  |  |   53|  9.91k|      if(!(expr)) {                                             \
  |  |  ------------------
  |  |  |  Branch (53:10): [True: 0, False: 9.91k]
  |  |  ------------------
  |  |   54|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */    \
  |  |   55|      0|         Botan::throw_invalid_state(#expr, __func__, __FILE__); \
  |  |   56|      0|      }                                                         \
  |  |   57|  9.91k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (57:12): [Folded, False: 9.91k]
  |  |  ------------------
  ------------------
   43|       |
   44|  9.91k|         auto result = m_buffer.first<bytes>();
   45|  9.91k|         m_buffer = m_buffer.subspan(bytes);
   46|  9.91k|         return result;
   47|  9.91k|      }

_ZN5Botan5CPUID3hasENS_10CPUFeatureE:
   94|  3.85k|      static bool has(CPUID::Feature feat) { return state().has_bit(feat.as_u32()); }
_ZN5Botan5CPUID6is_setEjNS_10CPUFeatureE:
  127|      4|      static inline bool is_set(uint32_t allowed, CPUID::Feature bit) {
  128|      4|         const uint32_t feat_bit = bit.as_u32();
  129|      4|         return ((allowed & feat_bit) == feat_bit);
  130|      4|      }
_ZNK5Botan5CPUID10CPUID_Data7has_bitEj:
  144|  3.85k|            bool has_bit(uint32_t bit) const { return (m_processor_features & bit) == bit; }
_ZN5Botan5CPUID5stateEv:
  156|  3.85k|      static CPUID_Data& state() {
  157|  3.85k|         static CPUID::CPUID_Data g_cpuid;
  158|  3.85k|         return g_cpuid;
  159|  3.85k|      }
cpuid_x86.cpp:_ZN5Botan5CPUID6if_setIZNS0_10CPUID_Data19detect_cpu_featuresEjE16x86_CPUID_1_bitsEEjmT_NS_10CPUFeatureEj:
  117|      6|      static inline uint32_t if_set(uint64_t cpuid, T flag, CPUID::Feature bit, uint32_t allowed) {
  118|      6|         const uint64_t flag64 = static_cast<uint64_t>(flag);
  119|      6|         if((cpuid & flag64) == flag64) {
  ------------------
  |  Branch (119:13): [True: 6, False: 0]
  ------------------
  120|      6|            return (bit.as_u32() & allowed);
  121|      6|         } else {
  122|      0|            return 0;
  123|      0|         }
  124|      6|      }
cpuid_x86.cpp:_ZN5Botan5CPUID6if_setIZNS0_10CPUID_Data19detect_cpu_featuresEjE16x86_CPUID_7_bitsEEjmT_NS_10CPUFeatureEj:
  117|      8|      static inline uint32_t if_set(uint64_t cpuid, T flag, CPUID::Feature bit, uint32_t allowed) {
  118|      8|         const uint64_t flag64 = static_cast<uint64_t>(flag);
  119|      8|         if((cpuid & flag64) == flag64) {
  ------------------
  |  Branch (119:13): [True: 5, False: 3]
  ------------------
  120|      5|            return (bit.as_u32() & allowed);
  121|      5|         } else {
  122|      3|            return 0;
  123|      3|         }
  124|      8|      }
cpuid_x86.cpp:_ZN5Botan5CPUID6if_setIZNS0_10CPUID_Data19detect_cpu_featuresEjE18x86_CPUID_7_1_bitsEEjmT_NS_10CPUFeatureEj:
  117|      3|      static inline uint32_t if_set(uint64_t cpuid, T flag, CPUID::Feature bit, uint32_t allowed) {
  118|      3|         const uint64_t flag64 = static_cast<uint64_t>(flag);
  119|      3|         if((cpuid & flag64) == flag64) {
  ------------------
  |  Branch (119:13): [True: 0, False: 3]
  ------------------
  120|      0|            return (bit.as_u32() & allowed);
  121|      3|         } else {
  122|      3|            return 0;
  123|      3|         }
  124|      3|      }

_ZN5Botan10CPUFeatureC2ENS0_3BitE:
   51|  3.87k|      CPUFeature(Bit b) : m_bit(b) {}  // NOLINT(*-explicit-conversions)
_ZNK5Botan10CPUFeature6as_u32Ev:
   53|  3.86k|      uint32_t as_u32() const { return static_cast<uint32_t>(m_bit); }

_ZN5Botan2CT4MaskImE5is_ltEmm:
  450|  92.7k|      static constexpr Mask<T> is_lt(T x, T y) {
  451|  92.7k|         T u = x ^ ((x ^ y) | ((x - y) ^ x));
  452|  92.7k|         return Mask<T>::expand_top_bit(u);
  453|  92.7k|      }
_ZN5Botan2CT4MaskImE14expand_top_bitEm:
  415|  92.7k|      static constexpr Mask<T> expand_top_bit(T v) { return Mask<T>(ct_expand_top_bit<T>(v)); }
_ZN5Botan2CT4MaskImEC2Em:
  637|  48.8M|      constexpr explicit Mask(T m) : m_mask(m) {}
_ZNK5Botan2CT4MaskImE7as_boolEv:
  614|  10.7k|      constexpr bool as_bool() const { return unpoisoned_value() != 0; }
_ZNK5Botan2CT4MaskImE16unpoisoned_valueEv:
  598|  7.86M|      constexpr T unpoisoned_value() const {
  599|  7.86M|         T r = value();
  600|  7.86M|         CT::unpoison(r);
  601|  7.86M|         return r;
  602|  7.86M|      }
_ZNK5Botan2CT4MaskImE11select_maskES2_S2_:
  559|  85.9k|      Mask<T> select_mask(Mask<T> x, Mask<T> y) const { return Mask<T>(select(x.value(), y.value())); }
_ZN5Botan2CT4MaskImEaNES2_:
  494|      4|      Mask<T>& operator&=(Mask<T> o) {
  495|      4|         m_mask &= o.value();
  496|      4|         return (*this);
  497|      4|      }
_ZN5Botan2CT8unpoisonITkNSt3__18integralEmEEvRKT_:
  112|  7.86M|constexpr void unpoison(const T& p) {
  113|  7.86M|   unpoison(&p, 1);
  114|  7.86M|}
_ZN5Botan2CT4MaskImE7is_zeroEm:
  437|  28.3M|      static constexpr Mask<T> is_zero(T x) { return Mask<T>(ct_is_zero<T>(value_barrier<T>(x))); }
_ZNK5Botan2CT4MaskImE8select_nEPmPKmS5_m:
  565|  15.4M|      constexpr void select_n(T output[], const T x[], const T y[], size_t len) const {
  566|  15.4M|         const T mask = value();
  567|   138M|         for(size_t i = 0; i != len; ++i) {
  ------------------
  |  Branch (567:28): [True: 123M, False: 15.4M]
  ------------------
  568|   123M|            output[i] = choose(mask, x[i], y[i]);
  569|   123M|         }
  570|  15.4M|      }
_ZN5Botan2CT4MaskImE6expandEm:
  392|  20.3M|      static constexpr Mask<T> expand(T v) { return ~Mask<T>::is_zero(value_barrier<T>(v)); }
_ZNK5Botan2CT4MaskImEcoEv:
  533|  20.3M|      constexpr Mask<T> operator~() const { return Mask<T>(~value()); }
_ZNK5Botan2CT4MaskImE5valueEv:
  630|  49.1M|      constexpr T value() const { return value_barrier<T>(m_mask); }
_ZNK5Botan2CT4MaskImE13if_set_returnEm:
  538|    678|      constexpr T if_set_return(T x) const { return value() & x; }
_ZNK5Botan2CT4MaskImE6selectEmm:
  548|   363k|      constexpr T select(T x, T y) const { return choose(value(), x, y); }
_ZN5Botan2CT4MaskIhE7is_zeroEh:
  437|  1.65k|      static constexpr Mask<T> is_zero(T x) { return Mask<T>(ct_is_zero<T>(value_barrier<T>(x))); }
_ZN5Botan2CT4MaskIhEC2Eh:
  637|  1.65k|      constexpr explicit Mask(T m) : m_mask(m) {}
_ZNK5Botan2CT4MaskIhE5valueEv:
  630|  1.65k|      constexpr T value() const { return value_barrier<T>(m_mask); }
_ZN5Botan2CT4MaskImE8is_equalEmm:
  442|  6.23M|      static constexpr Mask<T> is_equal(T x, T y) {
  443|  6.23M|         const T diff = value_barrier(x) ^ value_barrier(y);
  444|  6.23M|         return Mask<T>::is_zero(diff);
  445|  6.23M|      }
_ZNK5Botan2CT4MaskImE9as_choiceEv:
  619|  7.85M|      constexpr CT::Choice as_choice() const {
  620|  7.85M|         if constexpr(sizeof(T) >= sizeof(Choice::underlying_type)) {
  621|  7.85M|            return CT::Choice::from_mask(static_cast<Choice::underlying_type>(unpoisoned_value()));
  622|       |         } else {
  623|       |            return CT::Choice::from_int(unpoisoned_value());
  624|       |         }
  625|  7.85M|      }
_ZN5Botan2CT6Choice9from_maskEm:
  303|  7.85M|      constexpr static Choice from_mask(underlying_type v) { return Choice(v); }
_ZN5Botan2CT6ChoiceC2Em:
  341|  9.27M|      constexpr explicit Choice(underlying_type v) : m_value(CT::value_barrier<underlying_type>(v)) {}
_ZNK5Botan2CT6ChoiceaaERKS1_:
  311|  1.11M|      constexpr Choice operator&&(const Choice& other) const { return Choice(value() & other.value()); }
_ZNK5Botan2CT6Choice5valueEv:
  332|  9.51M|      constexpr underlying_type value() const { return value_barrier(m_value); }
_ZNK5Botan2CT6ChoicentEv:
  309|   283k|      constexpr Choice operator!() const { return Choice(~value()); }
_ZNK5Botan2CT6Choice7as_boolEv:
  329|   300k|      constexpr bool as_bool() const { return m_value != 0; }
_ZN5Botan2CT6poisonImEEvPKT_m:
   56|  7.44k|constexpr inline void poison(const T* p, size_t n) {
   57|       |#if defined(BOTAN_HAS_VALGRIND)
   58|       |   if(!std::is_constant_evaluated()) {
   59|       |      VALGRIND_MAKE_MEM_UNDEFINED(p, n * sizeof(T));
   60|       |   }
   61|       |#endif
   62|       |
   63|  7.44k|   BOTAN_UNUSED(p, n);
  ------------------
  |  |  144|  7.44k|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
   64|  7.44k|}
_ZN5Botan2CT8unpoisonImEEvPKT_m:
   67|  7.87M|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|  7.87M|   BOTAN_UNUSED(p, n);
  ------------------
  |  |  144|  7.87M|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
   75|  7.87M|}
_ZN5Botan2CT6Choice2noEv:
  307|  1.24k|      constexpr static Choice no() { return Choice(0); }
_ZNK5Botan2CT6ChoiceooERKS1_:
  313|  27.0k|      constexpr Choice operator||(const Choice& other) const { return Choice(value() | other.value()); }
_ZN5Botan2CT8is_equalIhEENS0_4MaskIT_EEPKS3_S6_m:
  798|  1.65k|constexpr inline CT::Mask<T> is_equal(const T x[], const T y[], size_t len) {
  799|  1.65k|   if(std::is_constant_evaluated()) {
  ------------------
  |  Branch (799:7): [Folded, False: 1.65k]
  ------------------
  800|      0|      T difference = 0;
  801|       |
  802|      0|      for(size_t i = 0; i != len; ++i) {
  ------------------
  |  Branch (802:25): [True: 0, False: 0]
  ------------------
  803|      0|         difference = difference | (x[i] ^ y[i]);
  804|      0|      }
  805|       |
  806|      0|      return CT::Mask<T>::is_zero(difference);
  807|  1.65k|   } else {
  808|  1.65k|      volatile T difference = 0;
  809|       |
  810|   214k|      for(size_t i = 0; i != len; ++i) {
  ------------------
  |  Branch (810:25): [True: 213k, False: 1.65k]
  ------------------
  811|   213k|         difference = difference | (x[i] ^ y[i]);
  812|   213k|      }
  813|       |
  814|  1.65k|      return CT::Mask<T>::is_zero(difference);
  815|  1.65k|   }
  816|  1.65k|}
_ZNK5Botan2CT4MaskIhE7as_boolEv:
  614|  1.65k|      constexpr bool as_bool() const { return unpoisoned_value() != 0; }
_ZNK5Botan2CT4MaskIhE16unpoisoned_valueEv:
  598|  1.65k|      constexpr T unpoisoned_value() const {
  599|  1.65k|         T r = value();
  600|  1.65k|         CT::unpoison(r);
  601|  1.65k|         return r;
  602|  1.65k|      }
_ZN5Botan2CT8unpoisonITkNSt3__18integralEhEEvRKT_:
  112|  1.65k|constexpr void unpoison(const T& p) {
  113|  1.65k|   unpoison(&p, 1);
  114|  1.65k|}
_ZN5Botan2CT8unpoisonIhEEvPKT_m:
   67|  4.13k|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|  4.13k|   BOTAN_UNUSED(p, n);
  ------------------
  |  |  144|  4.13k|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
   75|  4.13k|}
_ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__16vectorImNS_16secure_allocatorImEEEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEnt19custom_unpoisonableISC_EEEvRKSC_:
  128|     24|constexpr void unpoison(const R& r) {
  129|     24|   const std::span s{r};
  130|     24|   unpoison(s.data(), s.size());
  131|     24|}
_ZN5Botan2CT9all_zerosImEENS0_4MaskIT_EEPKS3_m:
  785|  1.70M|constexpr inline CT::Mask<T> all_zeros(const T elem[], size_t len) {
  786|  1.70M|   T sum = 0;
  787|  15.3M|   for(size_t i = 0; i != len; ++i) {
  ------------------
  |  Branch (787:22): [True: 13.6M, False: 1.70M]
  ------------------
  788|  13.6M|      sum |= elem[i];
  789|  13.6M|   }
  790|  1.70M|   return CT::Mask<T>::is_zero(sum);
  791|  1.70M|}
_ZN5Botan2CT6poisonIhEEvPKT_m:
   56|  2.47k|constexpr inline void poison(const T* p, size_t n) {
   57|       |#if defined(BOTAN_HAS_VALGRIND)
   58|       |   if(!std::is_constant_evaluated()) {
   59|       |      VALGRIND_MAKE_MEM_UNDEFINED(p, n * sizeof(T));
   60|       |   }
   61|       |#endif
   62|       |
   63|  2.47k|   BOTAN_UNUSED(p, n);
  ------------------
  |  |  144|  2.47k|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
   64|  2.47k|}
_ZN5Botan2CT20conditional_copy_memImEENS0_4MaskIT_EES3_PS3_PKS3_S7_m:
  738|      8|constexpr inline Mask<T> conditional_copy_mem(T cnd, T* dest, const T* if_set, const T* if_unset, size_t elems) {
  739|      8|   const auto mask = CT::Mask<T>::expand(cnd);
  740|      8|   return CT::conditional_copy_mem(mask, dest, if_set, if_unset, elems);
  741|      8|}
_ZN5Botan2CT20conditional_copy_memImEENS0_4MaskIT_EES4_PS3_PKS3_S7_m:
  732|      8|constexpr inline Mask<T> conditional_copy_mem(Mask<T> mask, T* dest, const T* if_set, const T* if_unset, size_t elems) {
  733|      8|   mask.select_n(dest, if_set, if_unset, elems);
  734|      8|   return mask;
  735|      8|}
_ZN5Botan2CT6Choice8from_intIjQaasr3stdE17unsigned_integralIT_Entsr3stdE7same_asIbS3_EEES1_S3_:
  268|      9|      constexpr static Choice from_int(T v) {
  269|      9|         if constexpr(sizeof(T) <= sizeof(underlying_type)) {
  270|      9|            return !Choice(ct_is_zero<underlying_type>(v));
  271|       |         } else {
  272|       |            // Mask of T that is either |0| or |1|
  273|       |            const T v_is_0 = ct_is_zero<T>(value_barrier<T>(v));
  274|       |
  275|       |            // We want the mask to be set if v != 0 so we must check that
  276|       |            // v_is_0 is itself zero.
  277|       |            //
  278|       |            // Also sizeof(T) may not equal sizeof(underlying_type) so we must
  279|       |            // use ct_is_zero<underlying_type>. It's ok to either truncate or
  280|       |            // zero extend v_is_0 to 32 bits since we know it is |0| or |1|
  281|       |            // so even just the low bit is sufficient.
  282|       |            return Choice(ct_is_zero<underlying_type>(static_cast<underlying_type>(v_is_0)));
  283|       |         }
  284|      9|      }
_ZN5Botan2CT6poisonITkNS_6ranges14spanable_rangeENSt3__14spanIKmLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEnt17custom_poisonableISB_EEEvRKSB_:
  121|      8|constexpr void poison(const R& r) {
  122|      8|   const std::span s{r};
  123|      8|   poison(s.data(), s.size());
  124|      8|}
_ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__14spanIKmLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEnt19custom_unpoisonableISB_EEEvRKSB_:
  128|      8|constexpr void unpoison(const R& r) {
  129|      8|   const std::span s{r};
  130|      8|   unpoison(s.data(), s.size());
  131|      8|}
_ZN5Botan2CT22conditional_assign_memImEENS0_4MaskIT_EES3_PS3_PKS3_m:
  749|  15.4M|constexpr inline Mask<T> conditional_assign_mem(T cnd, T* dest, const T* src, size_t elems) {
  750|  15.4M|   const auto mask = CT::Mask<T>::expand(cnd);
  751|  15.4M|   mask.select_n(dest, src, dest, elems);
  752|  15.4M|   return mask;
  753|  15.4M|}
_ZNK5Botan2CT6Choice12into_bitmaskImQaasr3stdE17unsigned_integralIT_Entsr3stdE7same_asIbS3_EEES3_v:
  291|  6.96M|      constexpr T into_bitmask() const {
  292|  6.96M|         if constexpr(sizeof(T) <= sizeof(underlying_type)) {
  293|       |            // The inner mask is already |0| or |1| so just truncate
  294|  6.96M|            return static_cast<T>(value());
  295|       |         } else {
  296|       |            return ~ct_is_zero<T>(value());
  297|       |         }
  298|  6.96M|      }
_ZN5Botan2CT8is_equalImEENS0_4MaskIT_EEPKS3_S6_m:
  798|  4.54k|constexpr inline CT::Mask<T> is_equal(const T x[], const T y[], size_t len) {
  799|  4.54k|   if(std::is_constant_evaluated()) {
  ------------------
  |  Branch (799:7): [Folded, False: 4.54k]
  ------------------
  800|      0|      T difference = 0;
  801|       |
  802|      0|      for(size_t i = 0; i != len; ++i) {
  ------------------
  |  Branch (802:25): [True: 0, False: 0]
  ------------------
  803|      0|         difference = difference | (x[i] ^ y[i]);
  804|      0|      }
  805|       |
  806|      0|      return CT::Mask<T>::is_zero(difference);
  807|  4.54k|   } else {
  808|  4.54k|      volatile T difference = 0;
  809|       |
  810|  40.8k|      for(size_t i = 0; i != len; ++i) {
  ------------------
  |  Branch (810:25): [True: 36.3k, False: 4.54k]
  ------------------
  811|  36.3k|         difference = difference | (x[i] ^ y[i]);
  812|  36.3k|      }
  813|       |
  814|  4.54k|      return CT::Mask<T>::is_zero(difference);
  815|  4.54k|   }
  816|  4.54k|}
_ZN5Botan2CT6poisonITkNS_6ranges14spanable_rangeENSt3__15arrayImLm8EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt17custom_poisonableISA_EEEvRKSA_:
  121|  7.43k|constexpr void poison(const R& r) {
  122|  7.43k|   const std::span s{r};
  123|  7.43k|   poison(s.data(), s.size());
  124|  7.43k|}
_ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__15arrayImLm8EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt19custom_unpoisonableISA_EEEvRKSA_:
  128|  7.43k|constexpr void unpoison(const R& r) {
  129|  7.43k|   const std::span s{r};
  130|  7.43k|   unpoison(s.data(), s.size());
  131|  7.43k|}
pcurves_numsp512d1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS6_6ParamsES7_E11FieldParamsEEEEES9_EEEEvRKT_:
  138|  2.47k|constexpr void poison(const T& x) {
  139|  2.47k|   x._const_time_poison();
  140|  2.47k|}
pcurves_numsp512d1.cpp:_ZN5Botan2CT10poison_allITpTkNS0_10poisonableEJNS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_:
  201|  2.47k|constexpr void poison_all(const Ts&... ts) {
  202|  2.47k|   (poison(ts), ...);
  203|  2.47k|}
pcurves_numsp512d1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEEEEvRKT_:
  138|  7.43k|constexpr void poison(const T& x) {
  139|  7.43k|   x._const_time_poison();
  140|  7.43k|}
pcurves_numsp512d1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS6_6ParamsES7_E11FieldParamsEEEEES9_EEEEvRKT_:
  143|  2.47k|constexpr void unpoison(const T& x) {
  144|  2.47k|   x._const_time_unpoison();
  145|  2.47k|}
pcurves_numsp512d1.cpp:_ZN5Botan2CT12unpoison_allITpTkNS0_12unpoisonableEJNS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_:
  207|  2.47k|constexpr void unpoison_all(const Ts&... ts) {
  208|  2.47k|   (unpoison(ts), ...);
  209|  2.47k|}
pcurves_numsp512d1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEEEEvRKT_:
  143|  7.43k|constexpr void unpoison(const T& x) {
  144|  7.43k|   x._const_time_unpoison();
  145|  7.43k|}

_ZNK5Botan13EC_Group_Data3oidEv:
  165|      1|      const OID& oid() const { return m_oid; }
_ZNK5Botan13EC_Group_Data1pEv:
  169|    828|      const BigInt& p() const { return m_p; }
_ZNK5Botan13EC_Group_Data5montyEv:
  184|      5|      const Montgomery_Params& monty() const { return m_monty; }
_ZNK5Botan13EC_Group_Data3g_xEv:
  197|    413|      const BigInt& g_x() const { return m_g_x; }
_ZNK5Botan13EC_Group_Data3g_yEv:
  199|    413|      const BigInt& g_y() const { return m_g_y; }
_ZNK5Botan13EC_Group_Data7p_wordsEv:
  201|      1|      size_t p_words() const { return m_p_words; }
_ZNK5Botan13EC_Group_Data7p_bytesEv:
  205|    413|      size_t p_bytes() const { return (m_p_bits + 7) / 8; }
_ZNK5Botan13EC_Group_Data11order_bytesEv:
  209|    832|      size_t order_bytes() const { return m_order_bytes; }
_ZNK5Botan13EC_Group_Data6pcurveEv:
  282|  19.4k|      const PCurve::PrimeOrderCurve& pcurve() const {
  283|  19.4k|         BOTAN_ASSERT_NONNULL(m_pcurve);
  ------------------
  |  |  116|  19.4k|   do {                                                                                   \
  |  |  117|  19.4k|      if((ptr) == nullptr) {                                                              \
  |  |  ------------------
  |  |  |  Branch (117:10): [True: 0, False: 19.4k]
  |  |  ------------------
  |  |  118|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                              \
  |  |  119|      0|         Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \
  |  |  120|      0|      }                                                                                   \
  |  |  121|  19.4k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (121:12): [Folded, False: 19.4k]
  |  |  ------------------
  ------------------
  284|  19.4k|         return *m_pcurve;
  285|  19.4k|      }
_ZN5Botan19EC_AffinePoint_DataD2Ev:
   73|  4.95k|      virtual ~EC_AffinePoint_Data() = default;
_ZN5Botan14EC_Scalar_DataD2Ev:
   38|  1.24k|      virtual ~EC_Scalar_Data() = default;

_ZNK5Botan17EC_Scalar_Data_PC5valueEv:
   53|  2.47k|      const auto& value() const { return m_v; }
_ZNK5Botan22EC_AffinePoint_Data_PC5valueEv:
   88|  3.30k|      const PCurve::PrimeOrderCurve::AffinePoint& value() const { return m_pt; }
_ZN5Botan17EC_Scalar_Data_PCC2ENSt3__110shared_ptrIKNS_13EC_Group_DataEEENS_6PCurve15PrimeOrderCurve6ScalarE:
   19|  1.24k|            m_group(std::move(group)), m_v(std::move(v)) {}

_ZN5Botan13swar_in_rangeITkNSt3__117unsigned_integralEmEET_S2_S2_S2_:
  114|    520|constexpr T swar_in_range(T v, T lower, T upper) {
  115|       |   // The constant 0x808080... as a T
  116|    520|   constexpr T hi1 = (static_cast<T>(-1) / 255) << 7;
  117|       |   // The constant 0x7F7F7F... as a T
  118|    520|   constexpr T lo7 = ~hi1;
  119|       |
  120|    520|   const T sub = ((v | hi1) - (lower & lo7)) ^ ((v ^ (~lower)) & hi1);
  121|    520|   const T a_lo = sub & lo7;
  122|    520|   const T a_hi = sub & hi1;
  123|    520|   return (lo7 - a_lo + upper) & hi1 & ~a_hi;
  124|    520|}
_ZN5Botan23index_of_first_set_byteITkNSt3__117unsigned_integralEmEEmT_:
  130|    520|constexpr size_t index_of_first_set_byte(T v) {
  131|       |   // The constant 0x010101... as a T
  132|    520|   constexpr T lo1 = (static_cast<T>(-1) / 255);
  133|       |   // The constant 0x808080... as a T
  134|    520|   constexpr T hi1 = lo1 << 7;
  135|       |   // How many bits to shift in order to get the top byte
  136|    520|   constexpr size_t bits = (sizeof(T) * 8) - 8;
  137|       |
  138|    520|   return static_cast<size_t>((((((v & hi1) - 1) & lo1) * lo1) >> bits) - 1);
  139|    520|}
_ZN5Botan11checked_mulITkNSt3__117unsigned_integralEmEENS1_8optionalIT_EES3_S3_:
   46|  5.06k|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|  5.06k|   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|  5.06k|   if(a != 0 && r / a != b) {
  ------------------
  |  Branch (53:7): [True: 5.06k, False: 0]
  |  Branch (53:17): [True: 0, False: 5.06k]
  ------------------
   54|      0|      return {};
   55|      0|   }
   56|  5.06k|   return r;
   57|  5.06k|}
_ZN5Botan11checked_addITkNSt3__117unsigned_integralEjEENS1_8optionalIT_EES3_S3_:
   19|      1|constexpr inline std::optional<T> checked_add(T a, T b) {
   20|      1|   const T r = a + b;
   21|      1|   if(r < a || r < b) {
  ------------------
  |  Branch (21:7): [True: 0, False: 1]
  |  Branch (21:16): [True: 0, False: 1]
  ------------------
   22|      0|      return {};
   23|      0|   }
   24|      1|   return r;
   25|      1|}

_ZN5Botan8store_beINS_6detail10AutoDetectEJRKmPhEEEDaDpOT0_:
  745|  6.61k|inline constexpr auto store_be(ParamTs&&... params) {
  746|  6.61k|   return detail::store_any<std::endian::big, ModifierT>(std::forward<ParamTs>(params)...);
  747|  6.61k|}
_ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEmQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvS6_Ph:
  711|  6.61k|inline constexpr void store_any(T in, uint8_t out[]) {
  712|       |   // asserts that *out points to enough bytes to write into
  713|  6.61k|   store_any<endianness, InT>(in, std::span<uint8_t, sizeof(T)>(out, sizeof(T)));
  714|  6.61k|}
_ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEEQsr3stdE7same_asIS4_T0_EEEvT1_OT2_:
  646|  6.61k|inline constexpr void store_any(T in, OutR&& out_range) {
  647|  6.61k|   store_any<endianness, T>(in, std::forward<OutR>(out_range));
  648|  6.61k|}
_ZN5Botan6detail9store_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvS9_OT1_:
  525|   125k|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) {
  526|   125k|   const auto in = detail::unwrap_strong_type_or_enum(wrapped_in);
  527|   125k|   using InT = decltype(in);
  528|   125k|   ranges::assert_exact_byte_length<sizeof(in)>(out_range);
  529|   125k|   const std::span out{out_range};
  530|       |
  531|       |   // At compile time we cannot use `typecast_copy` as it uses `std::memcpy`
  532|       |   // internally to copy ranges on a byte-by-byte basis, which is not allowed
  533|       |   // in a `constexpr` context.
  534|   125k|   if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  ------------------
  |  Branch (534:7): [Folded, False: 125k]
  ------------------
  535|      0|      return fallback_store_any<endianness, InT>(in, std::forward<OutR>(out_range));
  536|   125k|   } else {
  537|       |      if constexpr(sizeof(InT) == 1) {
  538|       |         out[0] = static_cast<uint8_t>(in);
  539|       |      } else if constexpr(endianness == std::endian::native) {
  540|       |         typecast_copy(out, in);
  541|   125k|      } else {
  542|   125k|         static_assert(opposite(endianness) == std::endian::native);
  543|   125k|         typecast_copy(out, reverse_bytes(in));
  544|   125k|      }
  545|   125k|   }
  546|   125k|}
_ZN5Botan6detail26unwrap_strong_type_or_enumITkNS0_20unsigned_integralishEmEEDaT_:
  190|   125k|constexpr auto unwrap_strong_type_or_enum(InT t) {
  191|       |   if constexpr(std::is_enum_v<InT>) {
  192|       |      // TODO: C++23: use std::to_underlying(in) instead
  193|       |      return static_cast<std::underlying_type_t<InT>>(t);
  194|   125k|   } else {
  195|   125k|      return Botan::unwrap_strong_type(t);
  196|   125k|   }
  197|   125k|}
_ZN5Botan7load_beImJNSt3__14spanIKhLm8EEEEEEDaDpOT0_:
  504|     32|inline constexpr auto load_be(ParamTs&&... params) {
  505|     32|   return detail::load_any<std::endian::big, OutT>(std::forward<ParamTs>(params)...);
  506|     32|}
_ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_:
  278|  99.2k|inline constexpr WrappedOutT load_any(InR&& in_range) {
  279|  99.2k|   using OutT = detail::wrapped_type<WrappedOutT>;
  280|  99.2k|   ranges::assert_exact_byte_length<sizeof(OutT)>(in_range);
  281|       |
  282|  99.2k|   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|  99.2k|      if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  287|  99.2k|         return fallback_load_any<endianness, OutT>(std::forward<InR>(in_range));
  288|  99.2k|      } else {
  289|  99.2k|         const std::span in{in_range};
  290|  99.2k|         if constexpr(sizeof(OutT) == 1) {
  291|  99.2k|            return static_cast<OutT>(in[0]);
  292|  99.2k|         } else if constexpr(endianness == std::endian::native) {
  293|  99.2k|            return typecast_copy<OutT>(in);
  294|  99.2k|         } else {
  295|  99.2k|            static_assert(opposite(endianness) == std::endian::native);
  296|  99.2k|            return reverse_bytes(typecast_copy<OutT>(in));
  297|  99.2k|         }
  298|  99.2k|      }
  299|  99.2k|   }());
  300|  99.2k|}
_ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEmTkNSt3__117unsigned_integralEmEEDaT0_:
  200|  99.2k|constexpr auto wrap_strong_type_or_enum(T t) {
  201|       |   if constexpr(std::is_enum_v<OutT>) {
  202|       |      return static_cast<OutT>(t);
  203|  99.2k|   } else {
  204|  99.2k|      return Botan::wrap_strong_type<OutT>(t);
  205|  99.2k|   }
  206|  99.2k|}
_ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv:
  282|  99.2k|   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|  99.2k|      if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  ------------------
  |  Branch (286:10): [Folded, False: 99.2k]
  ------------------
  287|      0|         return fallback_load_any<endianness, OutT>(std::forward<InR>(in_range));
  288|  99.2k|      } else {
  289|  99.2k|         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|  99.2k|         } else {
  295|  99.2k|            static_assert(opposite(endianness) == std::endian::native);
  296|  99.2k|            return reverse_bytes(typecast_copy<OutT>(in));
  297|  99.2k|         }
  298|  99.2k|      }
  299|  99.2k|   }());
_ZN5Botan7load_beImJRNSt3__15arrayIhLm8EEEEEEDaDpOT0_:
  504|      2|inline constexpr auto load_be(ParamTs&&... params) {
  505|      2|   return detail::load_any<std::endian::big, OutT>(std::forward<ParamTs>(params)...);
  506|      2|}
_ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEERNS2_5arrayIhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_:
  278|      2|inline constexpr WrappedOutT load_any(InR&& in_range) {
  279|      2|   using OutT = detail::wrapped_type<WrappedOutT>;
  280|      2|   ranges::assert_exact_byte_length<sizeof(OutT)>(in_range);
  281|       |
  282|      2|   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|      if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  287|      2|         return fallback_load_any<endianness, OutT>(std::forward<InR>(in_range));
  288|      2|      } else {
  289|      2|         const std::span in{in_range};
  290|      2|         if constexpr(sizeof(OutT) == 1) {
  291|      2|            return static_cast<OutT>(in[0]);
  292|      2|         } else if constexpr(endianness == std::endian::native) {
  293|      2|            return typecast_copy<OutT>(in);
  294|      2|         } else {
  295|      2|            static_assert(opposite(endianness) == std::endian::native);
  296|      2|            return reverse_bytes(typecast_copy<OutT>(in));
  297|      2|         }
  298|      2|      }
  299|      2|   }());
  300|      2|}
_ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEERNS2_5arrayIhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv:
  282|      2|   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|      if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  ------------------
  |  Branch (286:10): [Folded, False: 2]
  ------------------
  287|      0|         return fallback_load_any<endianness, OutT>(std::forward<InR>(in_range));
  288|      2|      } else {
  289|      2|         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|         } else {
  295|      2|            static_assert(opposite(endianness) == std::endian::native);
  296|      2|            return reverse_bytes(typecast_copy<OutT>(in));
  297|      2|         }
  298|      2|      }
  299|      2|   }());
_ZN5Botan6detail9store_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvS9_OT1_:
  525|     32|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) {
  526|     32|   const auto in = detail::unwrap_strong_type_or_enum(wrapped_in);
  527|     32|   using InT = decltype(in);
  528|     32|   ranges::assert_exact_byte_length<sizeof(in)>(out_range);
  529|     32|   const std::span out{out_range};
  530|       |
  531|       |   // At compile time we cannot use `typecast_copy` as it uses `std::memcpy`
  532|       |   // internally to copy ranges on a byte-by-byte basis, which is not allowed
  533|       |   // in a `constexpr` context.
  534|     32|   if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  ------------------
  |  Branch (534:7): [Folded, False: 32]
  ------------------
  535|      0|      return fallback_store_any<endianness, InT>(in, std::forward<OutR>(out_range));
  536|     32|   } else {
  537|       |      if constexpr(sizeof(InT) == 1) {
  538|       |         out[0] = static_cast<uint8_t>(in);
  539|       |      } else if constexpr(endianness == std::endian::native) {
  540|       |         typecast_copy(out, in);
  541|     32|      } else {
  542|     32|         static_assert(opposite(endianness) == std::endian::native);
  543|     32|         typecast_copy(out, reverse_bytes(in));
  544|     32|      }
  545|     32|   }
  546|     32|}
_ZN5Botan6detail26unwrap_strong_type_or_enumITkNS0_20unsigned_integralishEjEEDaT_:
  190|     32|constexpr auto unwrap_strong_type_or_enum(InT t) {
  191|       |   if constexpr(std::is_enum_v<InT>) {
  192|       |      // TODO: C++23: use std::to_underlying(in) instead
  193|       |      return static_cast<std::underlying_type_t<InT>>(t);
  194|     32|   } else {
  195|     32|      return Botan::unwrap_strong_type(t);
  196|     32|   }
  197|     32|}
_ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmEET0_PKhm:
  454|  99.2k|inline constexpr OutT load_any(const uint8_t in[], size_t off) {
  455|       |   // asserts that *in points to enough bytes to read at offset off
  456|  99.2k|   constexpr size_t out_size = sizeof(OutT);
  457|  99.2k|   return load_any<endianness, OutT>(std::span<const uint8_t, out_size>(in + off * out_size, out_size));
  458|  99.2k|}
_ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEETpTkNS0_20unsigned_integralishEJmEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_:
  582|   118k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, Ts... ins) {
  583|   118k|   ranges::assert_exact_byte_length<(sizeof(Ts) + ...)>(out);
  584|   118k|   auto store_one = [off = 0]<typename T>(auto o, T i) mutable {
  585|   118k|      store_any<endianness, T>(i, o.subspan(off).template first<sizeof(T)>());
  586|   118k|      off += sizeof(T);
  587|   118k|   };
  588|       |
  589|   118k|   (store_one(std::span{out}, ins), ...);
  590|   118k|}
_ZZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEETpTkNS0_20unsigned_integralishEJmEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_ENUlTyS9_T_E_clImS7_EEDaS9_SE_:
  584|   118k|   auto store_one = [off = 0]<typename T>(auto o, T i) mutable {
  585|   118k|      store_any<endianness, T>(i, o.subspan(off).template first<sizeof(T)>());
  586|   118k|      off += sizeof(T);
  587|   118k|   };
_ZN5Botan11copy_out_beITkNS_6ranges14spanable_rangeENSt3__16vectorIjNS_16secure_allocatorIjEEEEEEvNS2_4spanIhLm18446744073709551615EEERKT_:
  773|      4|inline void copy_out_be(std::span<uint8_t> out, const InR& in) {
  774|      4|   using T = std::ranges::range_value_t<InR>;
  775|      4|   std::span<const T> in_s{in};
  776|      4|   const auto remaining_bytes = detail::copy_out_any_word_aligned_portion<std::endian::big>(out, in_s);
  777|       |
  778|       |   // copy remaining bytes as a partial word
  779|      4|   for(size_t i = 0; i < remaining_bytes; ++i) {
  ------------------
  |  Branch (779:22): [True: 0, False: 4]
  ------------------
  780|      0|      out[i] = get_byte_var(i, in_s.front());
  781|      0|   }
  782|      4|}
_ZN5Botan6detail33copy_out_any_word_aligned_portionILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjEEmRNS2_4spanIhLm18446744073709551615EEERNS4_IKT0_Lm18446744073709551615EEE:
  752|      4|inline size_t copy_out_any_word_aligned_portion(std::span<uint8_t>& out, std::span<const T>& in) {
  753|      4|   const size_t full_words = out.size() / sizeof(T);
  754|      4|   const size_t full_word_bytes = full_words * sizeof(T);
  755|      4|   const size_t remaining_bytes = out.size() - full_word_bytes;
  756|      4|   BOTAN_ASSERT_NOMSG(in.size_bytes() >= full_word_bytes + remaining_bytes);
  ------------------
  |  |   77|      4|   do {                                                                     \
  |  |   78|      4|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      4|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 4]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      4|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 4]
  |  |  ------------------
  ------------------
  757|       |
  758|       |   // copy full words
  759|      4|   store_any<endianness, T>(out.first(full_word_bytes), in.first(full_words));
  760|      4|   out = out.subspan(full_word_bytes);
  761|      4|   in = in.subspan(full_words);
  762|       |
  763|      4|   return remaining_bytes;
  764|      4|}
_ZN5Botan6detail9store_anyILNSt3__16endianE64206EjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm18446744073709551615EEETkNS4_14spanable_rangeENS6_IKjLm18446744073709551615EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_:
  603|      4|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) {
  604|      4|   ranges::assert_equal_byte_lengths(out, in);
  605|      4|   using element_type = std::ranges::range_value_t<InR>;
  606|       |
  607|      4|   auto store_elementwise = [&] {
  608|      4|      constexpr size_t bytes_per_element = sizeof(element_type);
  609|      4|      std::span<uint8_t> out_s(out);
  610|      4|      for(auto in_elem : in) {
  611|      4|         store_any<endianness, element_type>(out_s.template first<bytes_per_element>(), in_elem);
  612|      4|         out_s = out_s.subspan(bytes_per_element);
  613|      4|      }
  614|      4|   };
  615|       |
  616|       |   // At compile time we cannot use `typecast_copy` as it uses `std::memcpy`
  617|       |   // internally to copy ranges on a byte-by-byte basis, which is not allowed
  618|       |   // in a `constexpr` context.
  619|      4|   if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  ------------------
  |  Branch (619:7): [Folded, False: 4]
  ------------------
  620|      0|      store_elementwise();
  621|      4|   } else {
  622|       |      if constexpr(endianness == std::endian::native && !custom_storable<element_type>) {
  623|       |         typecast_copy(out, in);
  624|      4|      } else {
  625|      4|         store_elementwise();
  626|      4|      }
  627|      4|   }
  628|      4|}
_ZZN5Botan6detail9store_anyILNSt3__16endianE64206EjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm18446744073709551615EEETkNS4_14spanable_rangeENS6_IKjLm18446744073709551615EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_ENKUlvE_clEv:
  607|      4|   auto store_elementwise = [&] {
  608|      4|      constexpr size_t bytes_per_element = sizeof(element_type);
  609|      4|      std::span<uint8_t> out_s(out);
  610|     32|      for(auto in_elem : in) {
  ------------------
  |  Branch (610:24): [True: 32, False: 4]
  ------------------
  611|     32|         store_any<endianness, element_type>(out_s.template first<bytes_per_element>(), in_elem);
  612|     32|         out_s = out_s.subspan(bytes_per_element);
  613|     32|      }
  614|      4|   };
_ZN5Botan6detail9store_anyILNSt3__16endianE64206EjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEETpTkNS0_20unsigned_integralishEJjEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_:
  582|     32|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, Ts... ins) {
  583|     32|   ranges::assert_exact_byte_length<(sizeof(Ts) + ...)>(out);
  584|     32|   auto store_one = [off = 0]<typename T>(auto o, T i) mutable {
  585|     32|      store_any<endianness, T>(i, o.subspan(off).template first<sizeof(T)>());
  586|     32|      off += sizeof(T);
  587|     32|   };
  588|       |
  589|     32|   (store_one(std::span{out}, ins), ...);
  590|     32|}
_ZZN5Botan6detail9store_anyILNSt3__16endianE64206EjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEETpTkNS0_20unsigned_integralishEJjEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_ENUlTyS9_T_E_clIjS7_EEDaS9_SE_:
  584|     32|   auto store_one = [off = 0]<typename T>(auto o, T i) mutable {
  585|     32|      store_any<endianness, T>(i, o.subspan(off).template first<sizeof(T)>());
  586|     32|      off += sizeof(T);
  587|     32|   };
_ZN5Botan6detail8load_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS0_20unsigned_integralishEmQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvPS6_PKhm:
  483|  2.47k|inline constexpr void load_any(T out[], const uint8_t in[], size_t count) {
  484|       |   // asserts that *in and *out point to the correct amount of memory
  485|  2.47k|   load_any<endianness, OutT>(std::span<T>(out, count), std::span<const uint8_t>(in, count * sizeof(T)));
  486|  2.47k|}
_ZN5Botan6detail8load_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeENS2_4spanImLm18446744073709551615EEETkNS5_16contiguous_rangeIhEENS6_IKhLm18446744073709551615EEEQaa20unsigned_integralishINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT1_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISI_EESJ_E4type10value_typeEEoosr3stdE7same_asIS4_T0_Esr3stdE7same_asISP_SO_EEEvOSF_RKT2_:
  355|  2.47k|inline constexpr void load_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) {
  356|  2.47k|   ranges::assert_equal_byte_lengths(out, in);
  357|  2.47k|   using element_type = std::ranges::range_value_t<OutR>;
  358|       |
  359|  2.47k|   auto load_elementwise = [&] {
  360|  2.47k|      constexpr size_t bytes_per_element = sizeof(element_type);
  361|  2.47k|      std::span<const uint8_t> in_s(in);
  362|  2.47k|      for(auto& out_elem : out) {
  363|  2.47k|         out_elem = load_any<endianness, element_type>(in_s.template first<bytes_per_element>());
  364|  2.47k|         in_s = in_s.subspan(bytes_per_element);
  365|  2.47k|      }
  366|  2.47k|   };
  367|       |
  368|       |   // At compile time we cannot use `typecast_copy` as it uses `std::memcpy`
  369|       |   // internally to copy ranges on a byte-by-byte basis, which is not allowed
  370|       |   // in a `constexpr` context.
  371|  2.47k|   if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  ------------------
  |  Branch (371:7): [Folded, False: 2.47k]
  ------------------
  372|      0|      load_elementwise();
  373|  2.47k|   } else {
  374|  2.47k|      if constexpr(endianness == std::endian::native && !custom_loadable<element_type>) {
  375|  2.47k|         typecast_copy(out, in);
  376|       |      } else {
  377|       |         load_elementwise();
  378|       |      }
  379|  2.47k|   }
  380|  2.47k|}
_ZN5Botan7load_beImJPKhmEEEDaDpOT0_:
  504|  99.2k|inline constexpr auto load_be(ParamTs&&... params) {
  505|  99.2k|   return detail::load_any<std::endian::big, OutT>(std::forward<ParamTs>(params)...);
  506|  99.2k|}
_ZN5Botan7load_leINS_6detail10AutoDetectEJRA8_mRA8_hRKmEEEDaDpOT0_:
  495|  2.47k|inline constexpr auto load_le(ParamTs&&... params) {
  496|  2.47k|   return detail::load_any<std::endian::little, OutT>(std::forward<ParamTs>(params)...);
  497|  2.47k|}
_ZN5Botan8store_beINSt3__16vectorIhNS1_9allocatorIhEEEEJRA16_mEEEDaDpOT0_:
  745|  2.47k|inline constexpr auto store_be(ParamTs&&... params) {
  746|  2.47k|   return detail::store_any<std::endian::big, ModifierT>(std::forward<ParamTs>(params)...);
  747|  2.47k|}
_ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS2_6vectorIhNS2_9allocatorIhEEEETkNS_6ranges14spanable_rangeERA16_mQoooosr3stdE7same_asINS0_10AutoDetectET0_Eaasr6rangesE25statically_spanable_rangeISC_Esr3stdE21default_initializableISC_Esr8conceptsE21resizable_byte_bufferISC_EEEDaOT1_:
  663|  2.47k|inline constexpr auto store_any(InR&& in_range) {
  664|  2.47k|   auto out = []([[maybe_unused]] const auto& in) {
  665|  2.47k|      if constexpr(std::same_as<AutoDetect, OutR>) {
  666|  2.47k|         if constexpr(ranges::statically_spanable_range<InR>) {
  667|  2.47k|            constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t<InR>);
  668|  2.47k|            return std::array<uint8_t, bytes>();
  669|  2.47k|         } else {
  670|  2.47k|            static_assert(
  671|  2.47k|               !std::same_as<AutoDetect, OutR>,
  672|  2.47k|               "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly");
  673|  2.47k|         }
  674|  2.47k|      } else if constexpr(concepts::resizable_byte_buffer<OutR>) {
  675|  2.47k|         return OutR(std::span{in}.size_bytes());
  676|  2.47k|      } else {
  677|  2.47k|         return OutR{};
  678|  2.47k|      }
  679|  2.47k|   }(in_range);
  680|       |
  681|  2.47k|   store_any<endianness, std::ranges::range_value_t<InR>>(out, std::forward<InR>(in_range));
  682|  2.47k|   return out;
  683|  2.47k|}
_ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS2_6vectorIhNS2_9allocatorIhEEEETkNS_6ranges14spanable_rangeERA16_mQoooosr3stdE7same_asINS0_10AutoDetectET0_Eaasr6rangesE25statically_spanable_rangeISC_Esr3stdE21default_initializableISC_Esr8conceptsE21resizable_byte_bufferISC_EEEDaOT1_ENKUlRKT_E_clIS9_EEDaSH_:
  664|  2.47k|   auto out = []([[maybe_unused]] const auto& in) {
  665|       |      if constexpr(std::same_as<AutoDetect, OutR>) {
  666|       |         if constexpr(ranges::statically_spanable_range<InR>) {
  667|       |            constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t<InR>);
  668|       |            return std::array<uint8_t, bytes>();
  669|       |         } else {
  670|       |            static_assert(
  671|       |               !std::same_as<AutoDetect, OutR>,
  672|       |               "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly");
  673|       |         }
  674|  2.47k|      } else if constexpr(concepts::resizable_byte_buffer<OutR>) {
  675|  2.47k|         return OutR(std::span{in}.size_bytes());
  676|       |      } else {
  677|       |         return OutR{};
  678|       |      }
  679|  2.47k|   }(in_range);
_ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_6vectorIhNS2_9allocatorIhEEEETkNS4_14spanable_rangeEA16_mQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISD_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISL_EESM_E4type10value_typeEEEEvOT1_RKSI_:
  603|  2.47k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) {
  604|  2.47k|   ranges::assert_equal_byte_lengths(out, in);
  605|  2.47k|   using element_type = std::ranges::range_value_t<InR>;
  606|       |
  607|  2.47k|   auto store_elementwise = [&] {
  608|  2.47k|      constexpr size_t bytes_per_element = sizeof(element_type);
  609|  2.47k|      std::span<uint8_t> out_s(out);
  610|  2.47k|      for(auto in_elem : in) {
  611|  2.47k|         store_any<endianness, element_type>(out_s.template first<bytes_per_element>(), in_elem);
  612|  2.47k|         out_s = out_s.subspan(bytes_per_element);
  613|  2.47k|      }
  614|  2.47k|   };
  615|       |
  616|       |   // At compile time we cannot use `typecast_copy` as it uses `std::memcpy`
  617|       |   // internally to copy ranges on a byte-by-byte basis, which is not allowed
  618|       |   // in a `constexpr` context.
  619|  2.47k|   if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  ------------------
  |  Branch (619:7): [Folded, False: 2.47k]
  ------------------
  620|      0|      store_elementwise();
  621|  2.47k|   } else {
  622|       |      if constexpr(endianness == std::endian::native && !custom_storable<element_type>) {
  623|       |         typecast_copy(out, in);
  624|  2.47k|      } else {
  625|  2.47k|         store_elementwise();
  626|  2.47k|      }
  627|  2.47k|   }
  628|  2.47k|}
_ZZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_6vectorIhNS2_9allocatorIhEEEETkNS4_14spanable_rangeEA16_mQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISD_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISL_EESM_E4type10value_typeEEEEvOT1_RKSI_ENKUlvE_clEv:
  607|  2.47k|   auto store_elementwise = [&] {
  608|  2.47k|      constexpr size_t bytes_per_element = sizeof(element_type);
  609|  2.47k|      std::span<uint8_t> out_s(out);
  610|  39.6k|      for(auto in_elem : in) {
  ------------------
  |  Branch (610:24): [True: 39.6k, False: 2.47k]
  ------------------
  611|  39.6k|         store_any<endianness, element_type>(out_s.template first<bytes_per_element>(), in_elem);
  612|  39.6k|         out_s = out_s.subspan(bytes_per_element);
  613|  39.6k|      }
  614|  2.47k|   };
_ZN5Botan8store_beINS_6detail10AutoDetectEJRNSt3__14spanIhLm64EEERNS3_5arrayImLm8EEEEEEDaDpOT0_:
  745|  9.91k|inline constexpr auto store_be(ParamTs&&... params) {
  746|  9.91k|   return detail::store_any<std::endian::big, ModifierT>(std::forward<ParamTs>(params)...);
  747|  9.91k|}
_ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeIhEERNS2_4spanIhLm64EEETkNS5_14spanable_rangeENS2_5arrayImLm8EEEQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asISC_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISK_EESL_E4type10value_typeEEEEvOT1_RKSH_:
  603|  9.91k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) {
  604|  9.91k|   ranges::assert_equal_byte_lengths(out, in);
  605|  9.91k|   using element_type = std::ranges::range_value_t<InR>;
  606|       |
  607|  9.91k|   auto store_elementwise = [&] {
  608|  9.91k|      constexpr size_t bytes_per_element = sizeof(element_type);
  609|  9.91k|      std::span<uint8_t> out_s(out);
  610|  9.91k|      for(auto in_elem : in) {
  611|  9.91k|         store_any<endianness, element_type>(out_s.template first<bytes_per_element>(), in_elem);
  612|  9.91k|         out_s = out_s.subspan(bytes_per_element);
  613|  9.91k|      }
  614|  9.91k|   };
  615|       |
  616|       |   // At compile time we cannot use `typecast_copy` as it uses `std::memcpy`
  617|       |   // internally to copy ranges on a byte-by-byte basis, which is not allowed
  618|       |   // in a `constexpr` context.
  619|  9.91k|   if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  ------------------
  |  Branch (619:7): [Folded, False: 9.91k]
  ------------------
  620|      0|      store_elementwise();
  621|  9.91k|   } else {
  622|       |      if constexpr(endianness == std::endian::native && !custom_storable<element_type>) {
  623|       |         typecast_copy(out, in);
  624|  9.91k|      } else {
  625|  9.91k|         store_elementwise();
  626|  9.91k|      }
  627|  9.91k|   }
  628|  9.91k|}
_ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeIhEERNS2_4spanIhLm64EEETkNS5_14spanable_rangeENS2_5arrayImLm8EEEQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asISC_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISK_EESL_E4type10value_typeEEEEvOT1_RKSH_ENKUlvE_clEv:
  607|  9.91k|   auto store_elementwise = [&] {
  608|  9.91k|      constexpr size_t bytes_per_element = sizeof(element_type);
  609|  9.91k|      std::span<uint8_t> out_s(out);
  610|  79.2k|      for(auto in_elem : in) {
  ------------------
  |  Branch (610:24): [True: 79.2k, False: 9.91k]
  ------------------
  611|  79.2k|         store_any<endianness, element_type>(out_s.template first<bytes_per_element>(), in_elem);
  612|  79.2k|         out_s = out_s.subspan(bytes_per_element);
  613|  79.2k|      }
  614|  9.91k|   };
_ZN5Botan7load_leIjJPjPKhmEEEDaDpOT0_:
  495|      2|inline constexpr auto load_le(ParamTs&&... params) {
  496|      2|   return detail::load_any<std::endian::little, OutT>(std::forward<ParamTs>(params)...);
  497|      2|}
_ZN5Botan6detail8load_anyILNSt3__16endianE57005EjTkNS0_20unsigned_integralishEjQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asIT1_S5_EEEvPS6_PKhm:
  483|      2|inline constexpr void load_any(T out[], const uint8_t in[], size_t count) {
  484|       |   // asserts that *in and *out point to the correct amount of memory
  485|      2|   load_any<endianness, OutT>(std::span<T>(out, count), std::span<const uint8_t>(in, count * sizeof(T)));
  486|      2|}
_ZN5Botan6detail8load_anyILNSt3__16endianE57005EjTkNS_6ranges23contiguous_output_rangeENS2_4spanIjLm18446744073709551615EEETkNS4_16contiguous_rangeIhEENS5_IKhLm18446744073709551615EEEQaa20unsigned_integralishINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT1_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISH_EESI_E4type10value_typeEEoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISP_SN_EEEvOSE_RKT2_:
  355|      2|inline constexpr void load_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) {
  356|      2|   ranges::assert_equal_byte_lengths(out, in);
  357|      2|   using element_type = std::ranges::range_value_t<OutR>;
  358|       |
  359|      2|   auto load_elementwise = [&] {
  360|      2|      constexpr size_t bytes_per_element = sizeof(element_type);
  361|      2|      std::span<const uint8_t> in_s(in);
  362|      2|      for(auto& out_elem : out) {
  363|      2|         out_elem = load_any<endianness, element_type>(in_s.template first<bytes_per_element>());
  364|      2|         in_s = in_s.subspan(bytes_per_element);
  365|      2|      }
  366|      2|   };
  367|       |
  368|       |   // At compile time we cannot use `typecast_copy` as it uses `std::memcpy`
  369|       |   // internally to copy ranges on a byte-by-byte basis, which is not allowed
  370|       |   // in a `constexpr` context.
  371|      2|   if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ {
  ------------------
  |  Branch (371:7): [Folded, False: 2]
  ------------------
  372|      0|      load_elementwise();
  373|      2|   } else {
  374|      2|      if constexpr(endianness == std::endian::native && !custom_loadable<element_type>) {
  375|      2|         typecast_copy(out, in);
  376|       |      } else {
  377|       |         load_elementwise();
  378|       |      }
  379|      2|   }
  380|      2|}

_ZN5Botan18MerkleDamgard_HashINS_7SHA_256EEC2Ev:
   42|      1|      MerkleDamgard_Hash() { clear(); }
_ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE5clearEv:
   70|      7|      void clear() {
   71|      7|         MD::init(m_digest);
   72|      7|         m_buffer.clear();
   73|      7|         m_count = 0;
   74|      7|      }
_ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE6updateENSt3__14spanIKhLm18446744073709551615EEE:
   44|      9|      void update(std::span<const uint8_t> input) {
   45|      9|         BufferSlicer in(input);
   46|       |
   47|     18|         while(!in.empty()) {
  ------------------
  |  Branch (47:16): [True: 9, False: 9]
  ------------------
   48|      9|            if(const auto one_block = m_buffer.handle_unaligned_data(in)) {
  ------------------
  |  Branch (48:27): [True: 0, False: 9]
  ------------------
   49|      0|               MD::compress_n(m_digest, one_block.value(), 1);
   50|      0|            }
   51|       |
   52|      9|            if(m_buffer.in_alignment()) {
  ------------------
  |  Branch (52:16): [True: 6, False: 3]
  ------------------
   53|      6|               const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in);
   54|      6|               if(full_blocks > 0) {
  ------------------
  |  Branch (54:19): [True: 6, False: 0]
  ------------------
   55|      6|                  MD::compress_n(m_digest, aligned_data, full_blocks);
   56|      6|               }
   57|      6|            }
   58|      9|         }
   59|       |
   60|      9|         m_count += input.size();
   61|      9|      }
_ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE5finalENSt3__14spanIhLm18446744073709551615EEE:
   63|      4|      void final(std::span<uint8_t> output) {
   64|      4|         append_padding_bit();
   65|      4|         append_counter_and_finalize();
   66|      4|         copy_output(output);
   67|      4|         clear();
   68|      4|      }
_ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE18append_padding_bitEv:
   77|      4|      void append_padding_bit() {
   78|      4|         BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume());
  ------------------
  |  |   77|      4|   do {                                                                     \
  |  |   78|      4|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      4|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 4]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      4|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 4]
  |  |  ------------------
  ------------------
   79|      4|         if constexpr(MD::bit_endianness == MD_Endian::Big) {
   80|      4|            const uint8_t final_byte = 0x80;
   81|      4|            m_buffer.append({&final_byte, 1});
   82|       |         } else {
   83|       |            const uint8_t final_byte = 0x01;
   84|       |            m_buffer.append({&final_byte, 1});
   85|       |         }
   86|      4|      }
_ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE27append_counter_and_finalizeEv:
   88|      4|      void append_counter_and_finalize() {
   89|       |         // Compress the remaining data if the final data block does not provide
   90|       |         // enough space for the counter bytes.
   91|      4|         if(m_buffer.elements_until_alignment() < MD::ctr_bytes) {
  ------------------
  |  Branch (91:13): [True: 0, False: 4]
  ------------------
   92|      0|            m_buffer.fill_up_with_zeros();
   93|      0|            MD::compress_n(m_digest, m_buffer.consume(), 1);
   94|      0|         }
   95|       |
   96|       |         // Make sure that any remaining bytes in the very last block are zero.
   97|      4|         BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes);
  ------------------
  |  |   77|      4|   do {                                                                     \
  |  |   78|      4|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      4|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 4]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      4|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 4]
  |  |  ------------------
  ------------------
   98|      4|         m_buffer.fill_up_with_zeros();
   99|       |
  100|       |         // Replace a bunch of the right-most zero-padding with the counter bytes.
  101|      4|         const uint64_t bit_count = m_count * 8;
  102|      4|         auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count));
  103|      4|         if constexpr(MD::byte_endianness == MD_Endian::Big) {
  104|      4|            store_be(bit_count, last_bytes.data());
  105|       |         } else {
  106|       |            store_le(bit_count, last_bytes.data());
  107|       |         }
  108|       |
  109|       |         // Compress the very last block.
  110|      4|         MD::compress_n(m_digest, m_buffer.consume(), 1);
  111|      4|      }
_ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE:
  113|      4|      void copy_output(std::span<uint8_t> output) {
  114|      4|         BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes);
  ------------------
  |  |   77|      4|   do {                                                                     \
  |  |   78|      4|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      4|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 4]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      4|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 4]
  |  |  ------------------
  ------------------
  115|       |
  116|      4|         if constexpr(MD::byte_endianness == MD_Endian::Big) {
  117|      4|            copy_out_be(output.first(MD::output_bytes), m_digest);
  118|       |         } else {
  119|       |            copy_out_le(output.first(MD::output_bytes), m_digest);
  120|       |         }
  121|      4|      }

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

_ZNK5Botan17Montgomery_Params1pEv:
   41|      4|      const BigInt& p() const { return m_data->p(); }
_ZNK5Botan17Montgomery_Params2R1Ev:
   43|      1|      const BigInt& R1() const { return m_data->r1(); }
_ZNK5Botan17Montgomery_Params2R2Ev:
   45|      4|      const BigInt& R2() const { return m_data->r2(); }
_ZNK5Botan17Montgomery_Params6p_dashEv:
   49|      4|      word p_dash() const { return m_data->p_dash(); }
_ZNK5Botan17Montgomery_Params7p_wordsEv:
   51|      6|      size_t p_words() const { return m_data->p_size(); }
_ZNK5Botan17Montgomery_Params4Data1pEv:
   76|      4|            const BigInt& p() const { return m_p; }
_ZNK5Botan17Montgomery_Params4Data2r1Ev:
   78|      1|            const BigInt& r1() const { return m_r1; }
_ZNK5Botan17Montgomery_Params4Data2r2Ev:
   80|      4|            const BigInt& r2() const { return m_r2; }
_ZNK5Botan17Montgomery_Params4Data6p_dashEv:
   84|      4|            word p_dash() const { return m_p_dash; }
_ZNK5Botan17Montgomery_Params4Data6p_sizeEv:
   86|      6|            size_t p_size() const { return m_p_words; }

_ZN5Botan10word8_sub3ITkNS_8WordTypeEmEET_PS1_PKS1_S4_S1_:
  371|    609|inline constexpr auto word8_sub3(W z[8], const W x[8], const W y[8], W carry) -> W {
  372|    609|#if defined(BOTAN_MP_USE_X86_64_ASM)
  373|    609|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (373:7): [True: 0, Folded]
  |  Branch (373:36): [True: 0, Folded]
  ------------------
  374|    609|      asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "sbbq"))
  375|    609|                   : [carry] "=r"(carry)
  376|    609|                   : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry)
  377|    609|                   : "cc", "memory");
  378|    609|      return carry;
  379|    609|   }
  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|    609|}
_ZN5Botan8word_subITkNS_8WordTypeEmEET_S1_S1_PS1_:
  320|   161M|inline constexpr auto word_sub(W x, W y, W* carry) -> W {
  321|   161M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_subc)
  322|   161M|   if(!std::is_constant_evaluated()) {
  ------------------
  |  Branch (322:7): [True: 161M, Folded]
  ------------------
  323|       |      if constexpr(std::same_as<W, unsigned int>) {
  324|       |         return __builtin_subc(x, y, *carry & 1, carry);
  325|   161M|      } else if constexpr(std::same_as<W, unsigned long>) {
  326|   161M|         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|   161M|   }
  331|      0|#endif
  332|       |
  333|      0|   const W cb = *carry & 1;
  334|   161M|   W t0 = x - y;
  335|   161M|   W c1 = (t0 > x);
  336|   161M|   W z = t0 - cb;
  337|   161M|   *carry = c1 | (z > t0);
  338|   161M|   return z;
  339|   161M|}
_ZN5Botan8word_addITkNS_8WordTypeEmEET_S1_S1_PS1_:
  231|   141M|inline constexpr auto word_add(W x, W y, W* carry) -> W {
  232|   141M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_addc)
  233|   141M|   if(!std::is_constant_evaluated()) {
  ------------------
  |  Branch (233:7): [True: 141M, Folded]
  ------------------
  234|       |      if constexpr(std::same_as<W, unsigned int>) {
  235|       |         return __builtin_addc(x, y, *carry & 1, carry);
  236|   141M|      } else if constexpr(std::same_as<W, unsigned long>) {
  237|   141M|         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|   141M|   }
  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|   141M|   } else {
  255|   141M|      const W cb = *carry & 1;
  256|   141M|      W z = x + y;
  257|   141M|      W c1 = (z < x);
  258|   141M|      z += cb;
  259|   141M|      *carry = c1 | (z < cb);
  260|   141M|      return z;
  261|   141M|   }
  262|   141M|}
_ZN5Botan10word8_add2ITkNS_8WordTypeEmEET_PS1_PKS1_S1_:
  268|  2.84k|inline constexpr auto word8_add2(W x[8], const W y[8], W carry) -> W {
  269|  2.84k|#if defined(BOTAN_MP_USE_X86_64_ASM)
  270|  2.84k|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (270:7): [True: 0, Folded]
  |  Branch (270:36): [True: 0, Folded]
  ------------------
  271|  2.84k|      asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "adcq"))
  272|  2.84k|                   : [carry] "=r"(carry)
  273|  2.84k|                   : [x] "r"(x), [y] "r"(y), "0"(carry)
  274|  2.84k|                   : "cc", "memory");
  275|  2.84k|      return carry;
  276|  2.84k|   }
  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|  2.84k|}
_ZN5Botan10word8_sub2ITkNS_8WordTypeEmEET_PS1_PKS1_S1_:
  345|     20|inline constexpr auto word8_sub2(W x[8], const W y[8], W carry) -> W {
  346|     20|#if defined(BOTAN_MP_USE_X86_64_ASM)
  347|     20|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (347:7): [True: 0, Folded]
  |  Branch (347:36): [True: 0, Folded]
  ------------------
  348|     20|      asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "sbbq"))
  349|     20|                   : [carry] "=r"(carry)
  350|     20|                   : [x] "r"(x), [y] "r"(y), "0"(carry)
  351|     20|                   : "cc", "memory");
  352|     20|      return carry;
  353|     20|   }
  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|     20|}
_ZN5Botan13word8_linmul3ITkNS_8WordTypeEmEET_PS1_PKS1_S1_S1_:
  397|      6|inline constexpr auto word8_linmul3(W z[8], const W x[8], W y, W carry) -> W {
  398|      6|#if defined(BOTAN_MP_USE_X86_64_ASM)
  399|      6|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (399:7): [True: 0, Folded]
  |  Branch (399:36): [True: 0, Folded]
  ------------------
  400|      6|      asm(DO_8_TIMES(LINMUL_OP, "z")
  401|      6|          : [carry] "=r"(carry)
  402|      6|          : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry)
  403|      6|          : "cc", "%rax", "%rdx", "memory");
  404|      6|      return carry;
  405|      6|   }
  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|      6|}
_ZN5Botan10word_madd2ITkNS_8WordTypeEmEET_S1_S1_PS1_:
   90|  12.0M|inline constexpr auto word_madd2(W a, W b, W* c) -> W {
   91|  12.0M|#if defined(BOTAN_MP_USE_X86_64_ASM)
   92|  12.0M|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (92:7): [True: 0, Folded]
  |  Branch (92:36): [True: 0, Folded]
  ------------------
   93|  12.0M|      asm(R"(
   94|  12.0M|         mulq %[b]
   95|  12.0M|         addq %[c],%[a]
   96|  12.0M|         adcq $0,%[carry]
   97|  12.0M|         )"
   98|  12.0M|          : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*c)
   99|  12.0M|          : "0"(a), "1"(b), [c] "g"(*c)
  100|  12.0M|          : "cc");
  101|       |
  102|  12.0M|      return a;
  103|  12.0M|   }
  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|  12.0M|}
_ZN5Botan10word_madd3ITkNS_8WordTypeEmEET_S1_S1_S1_PS1_:
  133|  96.0M|inline constexpr auto word_madd3(W a, W b, W c, W* d) -> W {
  134|  96.0M|#if defined(BOTAN_MP_USE_X86_64_ASM)
  135|  96.0M|   if(std::same_as<W, uint64_t> && !std::is_constant_evaluated()) {
  ------------------
  |  Branch (135:7): [True: 0, Folded]
  |  Branch (135:36): [True: 0, Folded]
  ------------------
  136|  96.0M|      asm(R"(
  137|  96.0M|         mulq %[b]
  138|  96.0M|
  139|  96.0M|         addq %[c],%[a]
  140|  96.0M|         adcq $0,%[carry]
  141|  96.0M|
  142|  96.0M|         addq %[d],%[a]
  143|  96.0M|         adcq $0,%[carry]
  144|  96.0M|         )"
  145|  96.0M|          : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*d)
  146|  96.0M|          : "0"(a), "1"(b), [c] "g"(c), [d] "g"(*d)
  147|  96.0M|          : "cc");
  148|       |
  149|  96.0M|      return a;
  150|  96.0M|   }
  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|  96.0M|}
_ZN5Botan5word3ImE3mulEmm:
  460|   388M|      inline constexpr void mul(W x, W y) { m_w += static_cast<W3>(x) * y; }
_ZN5Botan5word3ImE7extractEv:
  466|   192M|      inline constexpr W extract() {
  467|   192M|         W r = static_cast<W>(m_w);
  468|   192M|         m_w >>= WordInfo<W>::bits;
  469|   192M|         return r;
  470|   192M|      }
_ZN5Botan5word3ImE3addEm:
  464|  66.3k|      inline constexpr void add(W x) { m_w += x; }
_ZN5Botan5word3ImE10monty_stepEmm:
  472|  33.1k|      inline constexpr W monty_step(W p0, W p_dash) {
  473|  33.1k|         const W w0 = static_cast<W>(m_w);
  474|  33.1k|         const W r = w0 * p_dash;
  475|  33.1k|         mul(r, p0);
  476|  33.1k|         m_w >>= WordInfo<W>::bits;
  477|  33.1k|         return r;
  478|  33.1k|      }
_ZN5Botan5word3ImEC2Ev:
  458|  12.0M|      constexpr word3() : m_w(0) {}
_ZN5Botan5word3ImE6mul_x2Emm:
  462|   190M|      inline constexpr void mul_x2(W x, W y) { m_w += static_cast<W3>(x) * y * 2; }

_ZN5Botan10bigint_cmpITkNS_8WordTypeEmEEiPKT_mS3_m:
  439|    848|inline constexpr int32_t bigint_cmp(const W x[], size_t x_size, const W y[], size_t y_size) {
  440|    848|   static_assert(sizeof(W) >= sizeof(uint32_t), "Size assumption");
  441|       |
  442|    848|   const W LT = static_cast<W>(-1);
  443|    848|   const W EQ = 0;
  444|    848|   const W GT = 1;
  445|       |
  446|    848|   const size_t common_elems = std::min(x_size, y_size);
  447|       |
  448|    848|   W result = EQ;  // until found otherwise
  449|       |
  450|  7.65k|   for(size_t i = 0; i != common_elems; i++) {
  ------------------
  |  Branch (450:22): [True: 6.80k, False: 848]
  ------------------
  451|  6.80k|      const auto is_eq = CT::Mask<W>::is_equal(x[i], y[i]);
  452|  6.80k|      const auto is_lt = CT::Mask<W>::is_lt(x[i], y[i]);
  453|       |
  454|  6.80k|      result = is_eq.select(result, is_lt.select(LT, GT));
  455|  6.80k|   }
  456|       |
  457|    848|   if(x_size < y_size) {
  ------------------
  |  Branch (457:7): [True: 0, False: 848]
  ------------------
  458|      0|      W mask = 0;
  459|      0|      for(size_t i = x_size; i != y_size; i++) {
  ------------------
  |  Branch (459:30): [True: 0, False: 0]
  ------------------
  460|      0|         mask |= y[i];
  461|      0|      }
  462|       |
  463|       |      // If any bits were set in high part of y, then x < y
  464|      0|      result = CT::Mask<W>::is_zero(mask).select(result, LT);
  465|    848|   } else if(y_size < x_size) {
  ------------------
  |  Branch (465:14): [True: 4, False: 844]
  ------------------
  466|      4|      W mask = 0;
  467|     14|      for(size_t i = y_size; i != x_size; i++) {
  ------------------
  |  Branch (467:30): [True: 10, False: 4]
  ------------------
  468|     10|         mask |= x[i];
  469|     10|      }
  470|       |
  471|       |      // If any bits were set in high part of x, then x > y
  472|      4|      result = CT::Mask<W>::is_zero(mask).select(result, GT);
  473|      4|   }
  474|       |
  475|    848|   CT::unpoison(result);
  476|    848|   BOTAN_DEBUG_ASSERT(result == LT || result == GT || result == EQ);
  ------------------
  |  |  130|    848|      do { /* NOLINT(*-avoid-do-while) */ \
  |  |  131|    848|      } while(0)
  |  |  ------------------
  |  |  |  Branch (131:15): [Folded, False: 848]
  |  |  ------------------
  ------------------
  477|    848|   return static_cast<int32_t>(result);
  478|    848|}
_ZN5Botan15bigint_ct_is_eqITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPKS3_mS6_m:
  519|      2|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|      2|   const size_t common_elems = std::min(x_size, y_size);
  521|       |
  522|      2|   W diff = 0;
  523|       |
  524|     30|   for(size_t i = 0; i != common_elems; i++) {
  ------------------
  |  Branch (524:22): [True: 28, False: 2]
  ------------------
  525|     28|      diff |= (x[i] ^ y[i]);
  526|     28|   }
  527|       |
  528|       |   // If any bits were set in high part of x/y, then they are not equal
  529|      2|   if(x_size < y_size) {
  ------------------
  |  Branch (529:7): [True: 1, False: 1]
  ------------------
  530|      9|      for(size_t i = x_size; i != y_size; i++) {
  ------------------
  |  Branch (530:30): [True: 8, False: 1]
  ------------------
  531|      8|         diff |= y[i];
  532|      8|      }
  533|      1|   } else if(y_size < x_size) {
  ------------------
  |  Branch (533:14): [True: 0, False: 1]
  ------------------
  534|      0|      for(size_t i = y_size; i != x_size; i++) {
  ------------------
  |  Branch (534:30): [True: 0, False: 0]
  ------------------
  535|      0|         diff |= x[i];
  536|      0|      }
  537|      0|   }
  538|       |
  539|      2|   return CT::Mask<W>::is_zero(diff);
  540|      2|}
_ZN5Botan15bigint_ct_is_ltITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPKS3_mS6_mb:
  487|  10.7k|   -> CT::Mask<W> {
  488|  10.7k|   const size_t common_elems = std::min(x_size, y_size);
  489|       |
  490|  10.7k|   auto is_lt = CT::Mask<W>::expand(lt_or_equal);
  491|       |
  492|  96.7k|   for(size_t i = 0; i != common_elems; i++) {
  ------------------
  |  Branch (492:22): [True: 85.9k, False: 10.7k]
  ------------------
  493|  85.9k|      const auto eq = CT::Mask<W>::is_equal(x[i], y[i]);
  494|  85.9k|      const auto lt = CT::Mask<W>::is_lt(x[i], y[i]);
  495|  85.9k|      is_lt = eq.select_mask(is_lt, lt);
  496|  85.9k|   }
  497|       |
  498|  10.7k|   if(x_size < y_size) {
  ------------------
  |  Branch (498:7): [True: 0, False: 10.7k]
  ------------------
  499|      0|      W mask = 0;
  500|      0|      for(size_t i = x_size; i != y_size; i++) {
  ------------------
  |  Branch (500:30): [True: 0, False: 0]
  ------------------
  501|      0|         mask |= y[i];
  502|      0|      }
  503|       |      // If any bits were set in high part of y, then is_lt should be forced true
  504|      0|      is_lt |= CT::Mask<W>::expand(mask);
  505|  10.7k|   } else if(y_size < x_size) {
  ------------------
  |  Branch (505:14): [True: 4, False: 10.7k]
  ------------------
  506|      4|      W mask = 0;
  507|     52|      for(size_t i = y_size; i != x_size; i++) {
  ------------------
  |  Branch (507:30): [True: 48, False: 4]
  ------------------
  508|     48|         mask |= x[i];
  509|     48|      }
  510|       |
  511|       |      // If any bits were set in high part of x, then is_lt should be false
  512|      4|      is_lt &= CT::Mask<W>::is_zero(mask);
  513|      4|   }
  514|       |
  515|  10.7k|   return is_lt;
  516|  10.7k|}
_ZN5Botan11bigint_sub3ITkNS_8WordTypeEmEET_PS1_PKS1_mS4_m:
  192|    591|inline constexpr auto bigint_sub3(W z[], const W x[], size_t x_size, const W y[], size_t y_size) -> W {
  193|    591|   W borrow = 0;
  194|       |
  195|    591|   BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
  ------------------
  |  |   64|    591|   do {                                                                                 \
  |  |   65|    591|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                     \
  |  |   66|    591|      if(!(expr)) {                                                                     \
  |  |  ------------------
  |  |  |  Branch (66:10): [True: 0, False: 591]
  |  |  ------------------
  |  |   67|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                            \
  |  |   68|      0|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   69|      0|      }                                                                                 \
  |  |   70|    591|   } while(0)
  |  |  ------------------
  |  |  |  Branch (70:12): [Folded, False: 591]
  |  |  ------------------
  ------------------
  196|       |
  197|    591|   const size_t blocks = y_size - (y_size % 8);
  198|       |
  199|  1.18k|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (199:22): [True: 593, False: 591]
  ------------------
  200|    593|      borrow = word8_sub3(z + i, x + i, y + i, borrow);
  201|    593|   }
  202|       |
  203|    595|   for(size_t i = blocks; i != y_size; ++i) {
  ------------------
  |  Branch (203:27): [True: 4, False: 591]
  ------------------
  204|      4|      z[i] = word_sub(x[i], y[i], &borrow);
  205|      4|   }
  206|       |
  207|    617|   for(size_t i = y_size; i != x_size; ++i) {
  ------------------
  |  Branch (207:27): [True: 26, False: 591]
  ------------------
  208|     26|      z[i] = word_sub(x[i], static_cast<W>(0), &borrow);
  209|     26|   }
  210|       |
  211|    591|   return borrow;
  212|    591|}
_ZN5Botan11bigint_shl2ITkNS_8WordTypeEmEEvPT_mPKS1_mm:
  355|      3|inline constexpr void bigint_shl2(W y[], size_t y_size, const W x[], size_t x_size, size_t shift) {
  356|      3|   const size_t word_shift = shift / WordInfo<W>::bits;
  357|      3|   const size_t bit_shift = shift % WordInfo<W>::bits;
  358|       |
  359|      3|   BOTAN_ASSERT_NOMSG(word_shift <= y_size);
  ------------------
  |  |   77|      3|   do {                                                                     \
  |  |   78|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      3|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
  360|      3|   BOTAN_ASSERT_NOMSG(x_size < y_size - word_shift);
  ------------------
  |  |   77|      3|   do {                                                                     \
  |  |   78|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      3|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
  361|       |
  362|      3|   unchecked_copy_memory(y + word_shift, x, x_size);
  363|      3|   zeroize_buffer(y, word_shift);
  364|      3|   zeroize_buffer(y + word_shift + x_size, y_size - word_shift - x_size);
  365|       |
  366|      3|   const auto carry_mask = CT::Mask<W>::expand(bit_shift);
  367|      3|   const W carry_shift = carry_mask.if_set_return(WordInfo<W>::bits - bit_shift);
  368|       |
  369|      3|   W carry = 0;
  370|     30|   for(size_t i = word_shift; i != x_size + word_shift + 1; ++i) {
  ------------------
  |  Branch (370:31): [True: 27, False: 3]
  ------------------
  371|     27|      const W w = y[i];
  372|     27|      y[i] = (w << bit_shift) | carry;
  373|     27|      carry = carry_mask.if_set_return(w >> carry_shift);
  374|     27|   }
  375|      3|}
_ZN5Botan17bigint_monty_redcEPmPKmS2_mmS0_m:
  924|      4|   word r[], const word z[], const word p[], size_t p_size, word p_dash, word ws[], size_t ws_size) {
  925|      4|   const size_t z_size = 2 * p_size;
  926|       |
  927|      4|   BOTAN_ARG_CHECK(ws_size >= p_size, "Montgomery reduction workspace too small");
  ------------------
  |  |   35|      4|   do {                                                          \
  |  |   36|      4|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      4|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 4]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      4|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 4]
  |  |  ------------------
  ------------------
  928|       |
  929|      4|   if(p_size == 4) {
  ------------------
  |  Branch (929:7): [True: 0, False: 4]
  ------------------
  930|      0|      bigint_monty_redc_4(r, z, p, p_dash, ws);
  931|      4|   } else if(p_size == 6) {
  ------------------
  |  Branch (931:14): [True: 0, False: 4]
  ------------------
  932|      0|      bigint_monty_redc_6(r, z, p, p_dash, ws);
  933|      4|   } else if(p_size == 8) {
  ------------------
  |  Branch (933:14): [True: 4, False: 0]
  ------------------
  934|      4|      bigint_monty_redc_8(r, z, p, p_dash, ws);
  935|      4|   } else if(p_size == 12) {
  ------------------
  |  Branch (935:14): [True: 0, False: 0]
  ------------------
  936|      0|      bigint_monty_redc_12(r, z, p, p_dash, ws);
  937|      0|   } else if(p_size == 16) {
  ------------------
  |  Branch (937:14): [True: 0, False: 0]
  ------------------
  938|      0|      bigint_monty_redc_16(r, z, p, p_dash, ws);
  939|      0|   } else if(p_size == 24) {
  ------------------
  |  Branch (939:14): [True: 0, False: 0]
  ------------------
  940|      0|      bigint_monty_redc_24(r, z, p, p_dash, ws);
  941|      0|   } else if(p_size == 32) {
  ------------------
  |  Branch (941:14): [True: 0, False: 0]
  ------------------
  942|      0|      bigint_monty_redc_32(r, z, p, p_dash, ws);
  943|      0|   } else {
  944|      0|      bigint_monty_redc_generic(r, z, z_size, p, p_size, p_dash, ws);
  945|      0|   }
  946|      4|}
_ZN5Botan25bigint_monty_redc_inplaceEPmPKmmmS0_m:
  948|      4|inline void bigint_monty_redc_inplace(word z[], const word p[], size_t p_size, word p_dash, word ws[], size_t ws_size) {
  949|      4|   bigint_monty_redc(z, z, p, p_size, p_dash, ws, ws_size);
  950|      4|   zeroize_buffer(z + p_size, p_size);
  951|      4|}
_ZN5Botan11bigint_add2ITkNS_8WordTypeEmEET_PS1_mPKS1_m:
   94|  12.0M|inline constexpr auto bigint_add2(W x[], size_t x_size, const W y[], size_t y_size) -> W {
   95|  12.0M|   W carry = 0;
   96|       |
   97|  12.0M|   BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
  ------------------
  |  |   64|  12.0M|   do {                                                                                 \
  |  |   65|  12.0M|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                     \
  |  |   66|  12.0M|      if(!(expr)) {                                                                     \
  |  |  ------------------
  |  |  |  Branch (66:10): [True: 0, False: 12.0M]
  |  |  ------------------
  |  |   67|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                            \
  |  |   68|      0|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   69|      0|      }                                                                                 \
  |  |   70|  12.0M|   } while(0)
  |  |  ------------------
  |  |  |  Branch (70:12): [Folded, False: 12.0M]
  |  |  ------------------
  ------------------
   98|       |
   99|  12.0M|   const size_t blocks = y_size - (y_size % 8);
  100|       |
  101|  12.0M|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (101:22): [True: 2.84k, False: 12.0M]
  ------------------
  102|  2.84k|      carry = word8_add2(x + i, y + i, carry);
  103|  2.84k|   }
  104|       |
  105|  36.0M|   for(size_t i = blocks; i != y_size; ++i) {
  ------------------
  |  Branch (105:27): [True: 24.0M, False: 12.0M]
  ------------------
  106|  24.0M|      x[i] = word_add(x[i], y[i], &carry);
  107|  24.0M|   }
  108|       |
  109|  84.0M|   for(size_t i = y_size; i != x_size; ++i) {
  ------------------
  |  Branch (109:27): [True: 72.0M, False: 12.0M]
  ------------------
  110|  72.0M|      x[i] = word_add(x[i], static_cast<W>(0), &carry);
  111|  72.0M|   }
  112|       |
  113|  12.0M|   return carry;
  114|  12.0M|}
_ZN5Botan11bigint_sub2ITkNS_8WordTypeEmEET_PS1_mPKS1_m:
  148|     17|inline constexpr auto bigint_sub2(W x[], size_t x_size, const W y[], size_t y_size) -> W {
  149|     17|   W borrow = 0;
  150|       |
  151|     17|   BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
  ------------------
  |  |   64|     17|   do {                                                                                 \
  |  |   65|     17|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                     \
  |  |   66|     17|      if(!(expr)) {                                                                     \
  |  |  ------------------
  |  |  |  Branch (66:10): [True: 0, False: 17]
  |  |  ------------------
  |  |   67|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                            \
  |  |   68|      0|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   69|      0|      }                                                                                 \
  |  |   70|     17|   } while(0)
  |  |  ------------------
  |  |  |  Branch (70:12): [Folded, False: 17]
  |  |  ------------------
  ------------------
  152|       |
  153|     17|   const size_t blocks = y_size - (y_size % 8);
  154|       |
  155|     37|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (155:22): [True: 20, False: 17]
  ------------------
  156|     20|      borrow = word8_sub2(x + i, y + i, borrow);
  157|     20|   }
  158|       |
  159|     45|   for(size_t i = blocks; i != y_size; ++i) {
  ------------------
  |  Branch (159:27): [True: 28, False: 17]
  ------------------
  160|     28|      x[i] = word_sub(x[i], y[i], &borrow);
  161|     28|   }
  162|       |
  163|     20|   for(size_t i = y_size; i != x_size; ++i) {
  ------------------
  |  Branch (163:27): [True: 3, False: 17]
  ------------------
  164|      3|      x[i] = word_sub(x[i], static_cast<W>(0), &borrow);
  165|      3|   }
  166|       |
  167|     17|   return borrow;
  168|     17|}
_ZN5Botan11bigint_add3ITkNS_8WordTypeEmEET_PS1_PKS1_mS4_m:
  120|      3|inline constexpr auto bigint_add3(W z[], const W x[], size_t x_size, const W y[], size_t y_size) -> W {
  121|      3|   if(x_size < y_size) {
  ------------------
  |  Branch (121:7): [True: 1, False: 2]
  ------------------
  122|      1|      return bigint_add3(z, y, y_size, x, x_size);
  123|      1|   }
  124|       |
  125|      2|   W carry = 0;
  126|       |
  127|      2|   const size_t blocks = y_size - (y_size % 8);
  128|       |
  129|      2|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (129:22): [True: 0, False: 2]
  ------------------
  130|      0|      carry = word8_add3(z + i, x + i, y + i, carry);
  131|      0|   }
  132|       |
  133|      4|   for(size_t i = blocks; i != y_size; ++i) {
  ------------------
  |  Branch (133:27): [True: 2, False: 2]
  ------------------
  134|      2|      z[i] = word_add(x[i], y[i], &carry);
  135|      2|   }
  136|       |
  137|     16|   for(size_t i = y_size; i != x_size; ++i) {
  ------------------
  |  Branch (137:27): [True: 14, False: 2]
  ------------------
  138|     14|      z[i] = word_add(x[i], static_cast<W>(0), &carry);
  139|     14|   }
  140|       |
  141|      2|   return carry;
  142|      3|}
_ZN5Botan14bigint_linmul3ITkNS_8WordTypeEmEEvPT_PKS1_mS1_:
  416|      6|inline constexpr void bigint_linmul3(W z[], const W x[], size_t x_size, W y) {
  417|      6|   const size_t blocks = x_size - (x_size % 8);
  418|       |
  419|      6|   W carry = 0;
  420|       |
  421|     12|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (421:22): [True: 6, False: 6]
  ------------------
  422|      6|      carry = word8_linmul3(z + i, x + i, y, carry);
  423|      6|   }
  424|       |
  425|     12|   for(size_t i = blocks; i != x_size; ++i) {
  ------------------
  |  Branch (425:27): [True: 6, False: 6]
  ------------------
  426|      6|      z[i] = word_madd2(x[i], y, &carry);
  427|      6|   }
  428|       |
  429|      6|   z[x_size] = carry;
  430|      6|}
_ZN5Botan14divide_precompImEC2Em:
  574|      3|      explicit constexpr divide_precomp(W divisor) : m_divisor(divisor) {
  575|      3|         BOTAN_ARG_CHECK(m_divisor != 0, "Division by zero");
  ------------------
  |  |   35|      3|   do {                                                          \
  |  |   36|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      3|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
  576|      3|      }
_ZNK5Botan14divide_precompImE16vartime_div_2to1Emm:
  581|     27|      inline constexpr W vartime_div_2to1(W n1, W n0) const {
  582|     27|         BOTAN_ASSERT_NOMSG(n1 < m_divisor);
  ------------------
  |  |   77|     27|   do {                                                                     \
  |  |   78|     27|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|     27|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 27]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|     27|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 27]
  |  |  ------------------
  ------------------
  583|       |
  584|     27|         if(m_divisor == WordInfo<W>::max) {
  ------------------
  |  Branch (584:13): [True: 27, False: 0]
  ------------------
  585|     27|            return vartime_div_2to1_max_d(n1, n0);
  586|     27|         }
  587|       |
  588|      0|         if(m_divisor == WordInfo<W>::top_bit) {
  ------------------
  |  Branch (588:13): [True: 0, False: 0]
  ------------------
  589|       |            // Simply a shift by N-1 bits
  590|      0|            return (n1 << 1) | (n0 >> (WordInfo<W>::bits - 1));
  591|      0|         }
  592|       |
  593|      0|         if(!std::is_constant_evaluated()) {
  ------------------
  |  Branch (593:13): [True: 0, Folded]
  ------------------
  594|      0|#if defined(BOTAN_MP_USE_X86_64_ASM)
  595|      0|            if constexpr(std::same_as<W, uint64_t>) {
  596|      0|               W quotient = 0;
  597|      0|               W remainder = 0;
  598|       |               // NOLINTNEXTLINE(*-no-assembler)
  599|      0|               asm("divq %[v]" : "=a"(quotient), "=d"(remainder) : [v] "r"(m_divisor), "a"(n0), "d"(n1) : "cc");
  600|      0|               return quotient;
  601|      0|            }
  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|      0|            if constexpr(WordInfo<W>::dword_is_native) {
  614|      0|               typename WordInfo<W>::dword n = n1;
  615|      0|               n <<= WordInfo<W>::bits;
  616|      0|               n |= n0;
  617|      0|               return static_cast<W>(n / m_divisor);
  618|      0|            }
  619|      0|#endif
  620|      0|         }
  621|       |
  622|      0|         W high = n1;
  623|      0|         W quotient = 0;
  624|       |
  625|      0|         for(size_t i = 0; i != WordInfo<W>::bits; ++i) {
  ------------------
  |  Branch (625:28): [True: 0, False: 0]
  ------------------
  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|      0|         return quotient;
  639|      0|      }
_ZN5Botan14divide_precompImE22vartime_div_2to1_max_dEmm:
  657|     27|      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|     27|         const W s = n0 + n1;
  684|       |         // did n0 + n1 overflow? or does (n0 + n1) == 2^k - 1? if either, c == 1
  685|     27|         if(s < n0 || s == WordInfo<W>::max) {
  ------------------
  |  Branch (685:13): [True: 2, False: 25]
  |  Branch (685:23): [True: 0, False: 25]
  ------------------
  686|      2|            n1 += 1;
  687|      2|         }
  688|       |
  689|     27|         return n1;
  690|     27|      }
_ZN5Botan11bigint_shr1ITkNS_8WordTypeEmEEvPT_mm:
  331|     27|inline constexpr void bigint_shr1(W x[], size_t x_size, size_t shift) {
  332|     27|   const size_t word_shift = shift / WordInfo<W>::bits;
  333|     27|   const size_t bit_shift = shift % WordInfo<W>::bits;
  334|       |
  335|     27|   const size_t top = x_size >= word_shift ? (x_size - word_shift) : 0;
  ------------------
  |  Branch (335:23): [True: 27, False: 0]
  ------------------
  336|       |
  337|     27|   if(top > 0) {
  ------------------
  |  Branch (337:7): [True: 27, False: 0]
  ------------------
  338|     27|      unchecked_copy_memory(x, x + word_shift, top);
  339|     27|   }
  340|     27|   zeroize_buffer(x + top, std::min(word_shift, x_size));
  341|       |
  342|     27|   const auto carry_mask = CT::Mask<W>::expand(bit_shift);
  343|     27|   const W carry_shift = carry_mask.if_set_return(WordInfo<W>::bits - bit_shift);
  344|       |
  345|     27|   W carry = 0;
  346|       |
  347|    648|   for(size_t i = 0; i != top; ++i) {
  ------------------
  |  Branch (347:22): [True: 621, False: 27]
  ------------------
  348|    621|      const W w = x[top - i - 1];
  349|    621|      x[top - i - 1] = (w >> bit_shift) | carry;
  350|    621|      carry = carry_mask.if_set_return(w << carry_shift);
  351|    621|   }
  352|     27|}
_ZN5Botan14bigint_sub_absITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPS3_PKS3_S7_mS5_:
  279|      8|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|      8|   W* ws0 = ws;
  283|      8|   W* ws1 = ws + N;
  284|       |
  285|      8|   W borrow0 = 0;
  286|      8|   W borrow1 = 0;
  287|       |
  288|      8|   const size_t blocks = N - (N % 8);
  289|       |
  290|     16|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (290:22): [True: 8, False: 8]
  ------------------
  291|      8|      borrow0 = word8_sub3(ws0 + i, x + i, y + i, borrow0);
  292|      8|      borrow1 = word8_sub3(ws1 + i, y + i, x + i, borrow1);
  293|      8|   }
  294|       |
  295|     16|   for(size_t i = blocks; i != N; ++i) {
  ------------------
  |  Branch (295:27): [True: 8, False: 8]
  ------------------
  296|      8|      ws0[i] = word_sub(x[i], y[i], &borrow0);
  297|      8|      ws1[i] = word_sub(y[i], x[i], &borrow1);
  298|      8|   }
  299|       |
  300|      8|   return CT::conditional_copy_mem(borrow0, z, ws1, ws0, N);
  301|      8|}
_ZN5Botan13monty_inverseITkNS_8WordTypeEmEET_S1_:
  703|      1|inline constexpr auto monty_inverse(W a) -> W {
  704|      1|   BOTAN_ARG_CHECK(a % 2 == 1, "Cannot compute Montgomery inverse of an even integer");
  ------------------
  |  |   35|      1|   do {                                                          \
  |  |   36|      1|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      1|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 1]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      1|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 1]
  |  |  ------------------
  ------------------
  705|       |
  706|       |   // Newton's Method, following https://lemire.me/blog/2017/09/18/computing-the-inverse-of-odd-integers/
  707|       |
  708|      1|   constexpr size_t iter = WordInfo<W>::bits == 64 ? 4 : 3;
  ------------------
  |  Branch (708:28): [True: 0, Folded]
  ------------------
  709|       |
  710|       |   // Initial guess provides 5 bits of accuracy
  711|      1|   W r = (3 * a) ^ 2;
  712|       |
  713|       |   // Each iteration doubles the accuracy
  714|      5|   for(size_t i = 0; i != iter; ++i) {
  ------------------
  |  Branch (714:22): [True: 4, False: 1]
  ------------------
  715|      4|      r = r * (2 - r * a);
  716|      4|   }
  717|       |
  718|       |   // Now invert in addition space
  719|      1|   r = (WordInfo<W>::max - r) + 1;
  720|       |
  721|      1|   return r;
  722|      1|}
_ZN5Botan16read_window_bitsILm7EhLm18446744073709551615EEEmNSt3__14spanIKT0_XT1_EEEm:
 1071|   120k|constexpr size_t read_window_bits(std::span<const W, N> words, size_t offset) {
 1072|   120k|   static_assert(WindowBits >= 1 && WindowBits <= 7);
 1073|       |
 1074|   120k|   constexpr uint8_t WindowMask = static_cast<uint8_t>(1 << WindowBits) - 1;
 1075|       |
 1076|   120k|   constexpr size_t W_bits = sizeof(W) * 8;
 1077|   120k|   const auto bit_shift = offset % W_bits;
 1078|   120k|   const auto word_offset = words.size() - 1 - (offset / W_bits);
 1079|       |
 1080|   120k|   const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0;
  ------------------
  |  Branch (1080:36): [True: 30.9k, False: 89.2k]
  |  Branch (1080:74): [True: 0, False: 89.2k]
  ------------------
 1081|       |
 1082|   120k|   const auto w0 = words[word_offset];
 1083|       |
 1084|   120k|   if(single_byte_window) {
  ------------------
  |  Branch (1084:7): [True: 30.9k, False: 89.2k]
  ------------------
 1085|  30.9k|      return (w0 >> bit_shift) & WindowMask;
 1086|  89.2k|   } else {
 1087|       |      // Otherwise we must join two words and extract the result
 1088|  89.2k|      const auto w1 = words[word_offset - 1];
 1089|  89.2k|      const auto combined = ((w0 >> bit_shift) | (w1 << (W_bits - bit_shift)));
 1090|  89.2k|      return combined & WindowMask;
 1091|  89.2k|   }
 1092|   120k|}
_ZN5Botan16read_window_bitsILm6EhLm18446744073709551615EEEmNSt3__14spanIKT0_XT1_EEEm:
 1071|   143k|constexpr size_t read_window_bits(std::span<const W, N> words, size_t offset) {
 1072|   143k|   static_assert(WindowBits >= 1 && WindowBits <= 7);
 1073|       |
 1074|   143k|   constexpr uint8_t WindowMask = static_cast<uint8_t>(1 << WindowBits) - 1;
 1075|       |
 1076|   143k|   constexpr size_t W_bits = sizeof(W) * 8;
 1077|   143k|   const auto bit_shift = offset % W_bits;
 1078|   143k|   const auto word_offset = words.size() - 1 - (offset / W_bits);
 1079|       |
 1080|   143k|   const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0;
  ------------------
  |  Branch (1080:36): [True: 54.5k, False: 89.2k]
  |  Branch (1080:74): [True: 0, False: 89.2k]
  ------------------
 1081|       |
 1082|   143k|   const auto w0 = words[word_offset];
 1083|       |
 1084|   143k|   if(single_byte_window) {
  ------------------
  |  Branch (1084:7): [True: 54.5k, False: 89.2k]
  ------------------
 1085|  54.5k|      return (w0 >> bit_shift) & WindowMask;
 1086|  89.2k|   } else {
 1087|       |      // Otherwise we must join two words and extract the result
 1088|  89.2k|      const auto w1 = words[word_offset - 1];
 1089|  89.2k|      const auto combined = ((w0 >> bit_shift) | (w1 << (W_bits - bit_shift)));
 1090|  89.2k|      return combined & WindowMask;
 1091|  89.2k|   }
 1092|   143k|}
_ZN5Botan9comba_sqrILm8ETkNS_8WordTypeEmEEvPT0_PKS1_:
  854|  6.79M|constexpr inline void comba_sqr(W z[2 * N], const W x[N]) {
  855|  6.79M|   if(!std::is_constant_evaluated()) {
  ------------------
  |  Branch (855:7): [True: 6.79M, Folded]
  ------------------
  856|       |      if constexpr(std::same_as<W, word> && N == 4) {
  857|       |         return bigint_comba_sqr4(z, x);
  858|       |      }
  859|       |      if constexpr(std::same_as<W, word> && N == 6) {
  860|       |         return bigint_comba_sqr6(z, x);
  861|       |      }
  862|       |      if constexpr(std::same_as<W, word> && N == 7) {
  863|       |         return bigint_comba_sqr7(z, x);
  864|       |      }
  865|  6.79M|      if constexpr(std::same_as<W, word> && N == 8) {
  866|  6.79M|         return bigint_comba_sqr8(z, x);
  867|  6.79M|      }
  868|       |      if constexpr(std::same_as<W, word> && N == 9) {
  869|       |         return bigint_comba_sqr9(z, x);
  870|       |      }
  871|       |      if constexpr(std::same_as<W, word> && N == 16) {
  872|       |         return bigint_comba_sqr16(z, x);
  873|       |      }
  874|  6.79M|   }
  875|       |
  876|      0|   word3<W> accum;
  877|       |
  878|  6.79M|   for(size_t i = 0; i != 2 * N; ++i) {
  ------------------
  |  Branch (878:22): [True: 0, False: 6.79M]
  ------------------
  879|      0|      const size_t start = i + 1 < N ? 0 : i + 1 - N;
  ------------------
  |  Branch (879:28): [True: 0, False: 0]
  ------------------
  880|      0|      const size_t end = std::min(N, i + 1);
  881|       |
  882|      0|      for(size_t j = start; j != end; ++j) {
  ------------------
  |  Branch (882:29): [True: 0, False: 0]
  ------------------
  883|      0|         accum.mul(x[j], x[i - j]);
  884|      0|      }
  885|      0|      z[i] = accum.extract();
  886|      0|   }
  887|  6.79M|}
_ZN5Botan22bigint_monty_maybe_subILm8ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_:
  254|  3.39M|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) {
  255|  3.39M|   W borrow = 0;
  256|       |
  257|  30.5M|   for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (257:22): [True: 27.1M, False: 3.39M]
  ------------------
  258|  27.1M|      z[i] = word_sub(x[i], y[i], &borrow);
  259|  27.1M|   }
  260|       |
  261|  3.39M|   borrow = (x0 - borrow) > x0;
  262|       |
  263|  3.39M|   CT::conditional_assign_mem(borrow, z, x, N);
  264|  3.39M|}
_ZN5Botan9comba_mulILm8ETkNS_8WordTypeEmEEvPT0_PKS1_S4_:
  818|  5.22M|constexpr inline void comba_mul(W z[2 * N], const W x[N], const W y[N]) {
  819|  5.22M|   if(!std::is_constant_evaluated()) {
  ------------------
  |  Branch (819:7): [True: 5.22M, Folded]
  ------------------
  820|       |      if constexpr(std::same_as<W, word> && N == 4) {
  821|       |         return bigint_comba_mul4(z, x, y);
  822|       |      }
  823|       |      if constexpr(std::same_as<W, word> && N == 6) {
  824|       |         return bigint_comba_mul6(z, x, y);
  825|       |      }
  826|       |      if constexpr(std::same_as<W, word> && N == 7) {
  827|       |         return bigint_comba_mul7(z, x, y);
  828|       |      }
  829|  5.22M|      if constexpr(std::same_as<W, word> && N == 8) {
  830|  5.22M|         return bigint_comba_mul8(z, x, y);
  831|  5.22M|      }
  832|       |      if constexpr(std::same_as<W, word> && N == 9) {
  833|       |         return bigint_comba_mul9(z, x, y);
  834|       |      }
  835|       |      if constexpr(std::same_as<W, word> && N == 16) {
  836|       |         return bigint_comba_mul16(z, x, y);
  837|       |      }
  838|  5.22M|   }
  839|       |
  840|      0|   word3<W> accum;
  841|       |
  842|  5.22M|   for(size_t i = 0; i != 2 * N; ++i) {
  ------------------
  |  Branch (842:22): [True: 0, False: 5.22M]
  ------------------
  843|      0|      const size_t start = i + 1 < N ? 0 : i + 1 - N;
  ------------------
  |  Branch (843:28): [True: 0, False: 0]
  ------------------
  844|      0|      const size_t end = std::min(N, i + 1);
  845|       |
  846|      0|      for(size_t j = start; j != end; ++j) {
  ------------------
  |  Branch (846:29): [True: 0, False: 0]
  ------------------
  847|      0|         accum.mul(x[j], y[i - j]);
  848|      0|      }
  849|      0|      z[i] = accum.extract();
  850|      0|   }
  851|  5.22M|}
_ZN5Botan10shift_leftILm1ETkNS_8WordTypeEmLm8EEET0_RNSt3__15arrayIS1_XT1_EEE:
  725|  2.37M|inline constexpr W shift_left(std::array<W, N>& x) {
  726|  2.37M|   static_assert(N >= 1, "Invalid input size");
  727|  2.37M|   static_assert(S > 0, "Zero shift not supported");
  728|  2.37M|   static_assert(S < WordInfo<W>::bits, "Shift too large");
  729|       |
  730|  2.37M|   const W carry = x[N - 1] >> (WordInfo<W>::bits - S);
  731|       |
  732|  19.0M|   for(size_t i = N - 1; i != 0; --i) {
  ------------------
  |  Branch (732:26): [True: 16.6M, False: 2.37M]
  ------------------
  733|  16.6M|      x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo<W>::bits - S));
  734|  16.6M|   }
  735|  2.37M|   x[0] <<= S;
  736|       |
  737|  2.37M|   return carry;
  738|  2.37M|}
_ZN5Botan11shift_rightILm1ETkNS_8WordTypeEmLm8EEET0_RNSt3__15arrayIS1_XT1_EEE:
  741|   143k|inline constexpr W shift_right(std::array<W, N>& x) {
  742|   143k|   static_assert(N >= 1, "Invalid input size");
  743|   143k|   static_assert(S > 0, "Zero shift not supported");
  744|   143k|   static_assert(S < WordInfo<W>::bits, "Shift too large");
  745|       |
  746|   143k|   const W carry = x[0] << (WordInfo<W>::bits - S);
  747|       |
  748|  1.15M|   for(size_t i = 0; i != N - 1; ++i) {
  ------------------
  |  Branch (748:22): [True: 1.00M, False: 143k]
  ------------------
  749|  1.00M|      x[i] = (x[i] >> S) | (x[i + 1] << (WordInfo<W>::bits - S));
  750|  1.00M|   }
  751|   143k|   x[N - 1] >>= S;
  752|       |
  753|   143k|   return carry;
  754|   143k|}
_ZN5Botan13redc_crandallITkNS_8WordTypeEmLm8ETnT_Lm569EEENSt3__15arrayIS1_XT0_EEENS2_4spanIKS1_XmlLi2ET0_EEE:
  992|  12.0M|constexpr std::array<W, N> redc_crandall(std::span<const W, 2 * N> z) {
  993|  12.0M|   static_assert(N >= 2);
  994|       |
  995|  12.0M|   std::array<W, N> hi = {};
  996|       |
  997|       |   // hi = hi * c + lo
  998|       |
  999|  12.0M|   W carry = 0;
 1000|   108M|   for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (1000:22): [True: 96.0M, False: 12.0M]
  ------------------
 1001|  96.0M|      hi[i] = word_madd3(z[i + N], C, z[i], &carry);
 1002|  96.0M|   }
 1003|       |
 1004|       |   // hi += carry * C
 1005|  12.0M|   word carry_c[2] = {0};
 1006|  12.0M|   carry_c[0] = word_madd2(carry, C, &carry_c[1]);
 1007|       |
 1008|  12.0M|   carry = bigint_add2(hi.data(), N, carry_c, 2);
 1009|       |
 1010|  12.0M|   constexpr W P0 = WordInfo<W>::max - (C - 1);
 1011|       |
 1012|  12.0M|   std::array<W, N> r = {};
 1013|       |
 1014|  12.0M|   W borrow = 0;
 1015|       |
 1016|       |   /*
 1017|       |   * For undetermined reasons, on GCC (only) removing this asm block causes
 1018|       |   * massive (up to 20%) performance regressions in secp256k1.
 1019|       |   *
 1020|       |   * The generated code without the asm seems quite reasonable, and timing
 1021|       |   * repeated calls to redc_crandall with the cycle counter show that GCC
 1022|       |   * computes it in about the same number of cycles with or without the asm.
 1023|       |   *
 1024|       |   * So the cause of the regression is unclear. But it is reproducible across
 1025|       |   * machines and GCC versions.
 1026|       |   */
 1027|       |#if defined(BOTAN_MP_USE_X86_64_ASM) && defined(__GNUC__) && !defined(__clang__)
 1028|       |   if constexpr(N == 4 && std::same_as<W, uint64_t>) {
 1029|       |      if(!std::is_constant_evaluated()) {
 1030|       |         asm volatile(R"(
 1031|       |                      movq 0(%[x]), %[borrow]
 1032|       |                      subq %[p0], %[borrow]
 1033|       |                      movq %[borrow], 0(%[r])
 1034|       |                      movq 8(%[x]), %[borrow]
 1035|       |                      sbbq $-1, %[borrow]
 1036|       |                      movq %[borrow], 8(%[r])
 1037|       |                      movq 16(%[x]), %[borrow]
 1038|       |                      sbbq $-1, %[borrow]
 1039|       |                      movq %[borrow], 16(%[r])
 1040|       |                      movq 24(%[x]), %[borrow]
 1041|       |                      sbbq $-1, %[borrow]
 1042|       |                      movq %[borrow], 24(%[r])
 1043|       |                      sbbq %[borrow],%[borrow]
 1044|       |                      negq %[borrow]
 1045|       |                      )"
 1046|       |                      : [borrow] "=r"(borrow)
 1047|       |                      : [x] "r"(hi.data()), [p0] "r"(P0), [r] "r"(r.data()), "0"(borrow)
 1048|       |                      : "cc", "memory");
 1049|       |
 1050|       |         borrow = (carry - borrow) > carry;
 1051|       |         CT::conditional_assign_mem(borrow, r.data(), hi.data(), N);
 1052|       |         return r;
 1053|       |      }
 1054|       |   }
 1055|       |#endif
 1056|       |
 1057|  12.0M|   r[0] = word_sub(hi[0], P0, &borrow);
 1058|  96.0M|   for(size_t i = 1; i != N; ++i) {
  ------------------
  |  Branch (1058:22): [True: 84.0M, False: 12.0M]
  ------------------
 1059|  84.0M|      r[i] = word_sub(hi[i], WordInfo<W>::max, &borrow);
 1060|  84.0M|   }
 1061|       |
 1062|  12.0M|   borrow = (carry - borrow) > carry;
 1063|       |
 1064|  12.0M|   CT::conditional_assign_mem(borrow, r.data(), hi.data(), N);
 1065|       |
 1066|  12.0M|   return r;
 1067|  12.0M|}

_ZN5Botan6PCurve15PrimeOrderCurve6ScalarD2Ev:
   72|  4.57k|            ~Scalar() = default;
_ZN5Botan6PCurve15PrimeOrderCurve11AffinePointD2Ev:
  100|  14.8k|            ~AffinePoint() = default;
_ZN5Botan6PCurve15PrimeOrderCurve15ProjectivePointD2Ev:
  134|  4.13k|            ~ProjectivePoint() = default;
_ZN5Botan6PCurve15PrimeOrderCurve6ScalarC2EOS2_:
   69|  3.32k|            Scalar(Scalar&& other) = default;
_ZN5Botan6PCurve15PrimeOrderCurve11AffinePointC2EOS2_:
   97|  9.91k|            AffinePoint(AffinePoint&& other) = default;
_ZN5Botan6PCurve15PrimeOrderCurve11AffinePointC2ERKS2_:
   96|    413|            AffinePoint(const AffinePoint& other) = default;
_ZNK5Botan6PCurve15PrimeOrderCurve6Scalar6_curveEv:
   76|  4.55k|            const auto& _curve() const { return m_curve; }
_ZNK5Botan6PCurve15PrimeOrderCurve6Scalar6_valueEv:
   78|  4.55k|            const auto& _value() const { return m_value; }
_ZN5Botan6PCurve15PrimeOrderCurve6Scalar7_createENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEE:
   80|  1.24k|            static Scalar _create(CurvePtr curve, StorageUnit v) { return Scalar(std::move(curve), v); }
_ZN5Botan6PCurve15PrimeOrderCurve6ScalarC2ENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEE:
   83|  1.24k|            Scalar(CurvePtr curve, StorageUnit v) : m_curve(std::move(curve)), m_value(v) {}
_ZNK5Botan6PCurve15PrimeOrderCurve11AffinePoint6_curveEv:
  104|  14.4k|            const auto& _curve() const { return m_curve; }
_ZNK5Botan6PCurve15PrimeOrderCurve11AffinePoint2_xEv:
  106|  14.4k|            const auto& _x() const { return m_x; }
_ZNK5Botan6PCurve15PrimeOrderCurve11AffinePoint2_yEv:
  108|  14.4k|            const auto& _y() const { return m_y; }
_ZN5Botan6PCurve15PrimeOrderCurve11AffinePoint7_createENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEES8_:
  110|  4.54k|            static AffinePoint _create(CurvePtr curve, StorageUnit x, StorageUnit y) {
  111|  4.54k|               return AffinePoint(std::move(curve), x, y);
  112|  4.54k|            }
_ZN5Botan6PCurve15PrimeOrderCurve11AffinePointC2ENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEES8_:
  115|  4.54k|            AffinePoint(CurvePtr curve, StorageUnit x, StorageUnit y) : m_curve(std::move(curve)), m_x(x), m_y(y) {}
_ZNK5Botan6PCurve15PrimeOrderCurve15ProjectivePoint6_curveEv:
  136|  4.13k|            const auto& _curve() const { return m_curve; }
_ZNK5Botan6PCurve15PrimeOrderCurve15ProjectivePoint2_xEv:
  138|  4.13k|            const auto& _x() const { return m_x; }
_ZNK5Botan6PCurve15PrimeOrderCurve15ProjectivePoint2_yEv:
  140|  4.13k|            const auto& _y() const { return m_y; }
_ZNK5Botan6PCurve15PrimeOrderCurve15ProjectivePoint2_zEv:
  142|  4.13k|            const auto& _z() const { return m_z; }
_ZN5Botan6PCurve15PrimeOrderCurve15ProjectivePoint7_createENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEES8_S8_:
  144|  4.13k|            static ProjectivePoint _create(CurvePtr curve, StorageUnit x, StorageUnit y, StorageUnit z) {
  145|  4.13k|               return ProjectivePoint(std::move(curve), x, y, z);
  146|  4.13k|            }
_ZN5Botan6PCurve15PrimeOrderCurve15ProjectivePointC2ENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEES8_S8_:
  150|  4.13k|                  m_curve(std::move(curve)), m_x(x), m_y(y), m_z(z) {}
_ZN5Botan6PCurve15PrimeOrderCurveD2Ev:
  163|      1|      virtual ~PrimeOrderCurve() = default;

pcurves_numsp512d1.cpp:_ZN5Botan13dbl_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EEEET_RKSE_:
  362|  11.9k|inline constexpr ProjectivePoint dbl_a_minus_3(const ProjectivePoint& pt) {
  363|       |   /*
  364|       |   if a == -3 then
  365|       |   3*x^2 + a*z^4 == 3*x^2 - 3*z^4 == 3*(x^2-z^4) == 3*(x-z^2)*(x+z^2)
  366|       |   */
  367|  11.9k|   const auto z2 = pt.z().square();
  368|  11.9k|   const auto m = (pt.x() - z2).mul3() * (pt.x() + z2);
  369|       |
  370|       |   // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8
  371|  11.9k|   const auto y2 = pt.y().square();
  372|  11.9k|   const auto s = pt.x().mul4() * y2;
  373|  11.9k|   const auto nx = m.square() - s.mul2();
  374|  11.9k|   const auto ny = m * (s - nx) - y2.square().mul8();
  375|  11.9k|   const auto nz = pt.y().mul2() * pt.z();
  376|       |
  377|  11.9k|   return ProjectivePoint(nx, ny, nz);
  378|  11.9k|}
pcurves_numsp512d1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_:
  187|  1.45k|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) {
  188|  1.45k|   const auto a_is_identity = a.is_identity();
  189|  1.45k|   const auto b_is_identity = b.is_identity();
  190|       |
  191|  1.45k|   const auto Z1Z1 = a.z().square();
  192|  1.45k|   const auto Z2Z2 = b.z().square();
  193|  1.45k|   const auto U1 = a.x() * Z2Z2;
  194|  1.45k|   const auto U2 = b.x() * Z1Z1;
  195|  1.45k|   const auto S1 = a.y() * b.z() * Z2Z2;
  196|  1.45k|   const auto S2 = b.y() * a.z() * Z1Z1;
  197|  1.45k|   const auto H = U2 - U1;
  198|  1.45k|   const auto r = S2 - S1;
  199|       |
  200|       |   /* Risky conditional
  201|       |   *
  202|       |   * This implementation uses projective coordinates, which do not have an efficient complete
  203|       |   * addition formula. We rely on the design of the multiplication algorithms to avoid doublings.
  204|       |   *
  205|       |   * This conditional only comes into play for the actual doubling case, not x + (-x) which
  206|       |   * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0,
  207|       |   * in which case at the end we'll set z to a.z * b.z * H = 0, resulting in the correct
  208|       |   * output (the identity element)
  209|       |   */
  210|  1.45k|   if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) {
  ------------------
  |  Branch (210:7): [True: 0, False: 1.45k]
  ------------------
  211|      0|      return a.dbl();
  212|      0|   }
  213|       |
  214|  1.45k|   const auto HH = H.square();
  215|  1.45k|   const auto HHH = H * HH;
  216|  1.45k|   const auto V = U1 * HH;
  217|  1.45k|   const auto t2 = r.square();
  218|  1.45k|   const auto t3 = V + V;
  219|  1.45k|   const auto t4 = t2 - HHH;
  220|  1.45k|   auto X3 = t4 - t3;
  221|  1.45k|   const auto t5 = V - X3;
  222|  1.45k|   const auto t6 = S1 * HHH;
  223|  1.45k|   const auto t7 = r * t5;
  224|  1.45k|   auto Y3 = t7 - t6;
  225|  1.45k|   const auto t8 = b.z() * H;
  226|  1.45k|   auto Z3 = a.z() * t8;
  227|       |
  228|       |   // if a is identity then return b
  229|  1.45k|   FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), b.z());
  230|       |
  231|       |   // if b is identity then return a
  232|  1.45k|   FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z());
  233|       |
  234|  1.45k|   return ProjectivePoint(X3, Y3, Z3);
  235|  1.45k|}
pcurves_numsp512d1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEE:
  107|      1|auto to_affine_batch(std::span<const typename C::ProjectivePoint> projective) {
  108|      1|   using AffinePoint = typename C::AffinePoint;
  109|       |
  110|      1|   const size_t N = projective.size();
  111|      1|   std::vector<AffinePoint> affine;
  112|      1|   affine.reserve(N);
  113|       |
  114|      1|   CT::Choice any_identity = CT::Choice::no();
  115|       |
  116|  3.10k|   for(const auto& pt : projective) {
  ------------------
  |  Branch (116:23): [True: 3.10k, False: 1]
  ------------------
  117|  3.10k|      any_identity = any_identity || pt.is_identity();
  118|  3.10k|   }
  119|       |
  120|       |   // Conditional acceptable: N is public. State of points is not necessarily
  121|       |   // public, but we don't leak which point was the identity. In practice with
  122|       |   // the algorithms currently in use, the only time an identity can occur is
  123|       |   // during mul2 where the two points g/h have a small relation (ie h = g*k for
  124|       |   // some k < 16)
  125|       |
  126|      1|   if(N <= 2 || any_identity.as_bool()) {
  ------------------
  |  Branch (126:7): [True: 0, False: 1]
  |  Branch (126:17): [True: 0, False: 1]
  ------------------
  127|       |      // If there are identity elements, using the batch inversion gets
  128|       |      // tricky. It can be done, but this should be a rare situation so
  129|       |      // just punt to the serial conversion if it occurs
  130|      0|      for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (130:25): [True: 0, False: 0]
  ------------------
  131|      0|         affine.push_back(to_affine<C>(projective[i]));
  132|      0|      }
  133|      1|   } else {
  134|      1|      std::vector<typename C::FieldElement> c;
  135|      1|      c.reserve(N);
  136|       |
  137|       |      /*
  138|       |      Batch projective->affine using Montgomery's trick
  139|       |
  140|       |      See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography"
  141|       |      (Hankerson, Menezes, Vanstone)
  142|       |      */
  143|       |
  144|      1|      c.push_back(projective[0].z());
  145|  3.10k|      for(size_t i = 1; i != N; ++i) {
  ------------------
  |  Branch (145:25): [True: 3.10k, False: 1]
  ------------------
  146|  3.10k|         c.push_back(c[i - 1] * projective[i].z());
  147|  3.10k|      }
  148|       |
  149|      1|      auto s_inv = [&]() {
  150|      1|         if constexpr(VariableTime) {
  151|      1|            return c[N - 1].invert_vartime();
  152|      1|         } else {
  153|      1|            return invert_field_element<C>(c[N - 1]);
  154|      1|         }
  155|      1|      }();
  156|       |
  157|  3.10k|      for(size_t i = N - 1; i > 0; --i) {
  ------------------
  |  Branch (157:29): [True: 3.10k, False: 1]
  ------------------
  158|  3.10k|         const auto& p = projective[i];
  159|       |
  160|  3.10k|         const auto z_inv = s_inv * c[i - 1];
  161|  3.10k|         const auto z2_inv = z_inv.square();
  162|  3.10k|         const auto z3_inv = z_inv * z2_inv;
  163|       |
  164|  3.10k|         s_inv = s_inv * p.z();
  165|       |
  166|  3.10k|         affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv));
  167|  3.10k|      }
  168|       |
  169|      1|      const auto z2_inv = s_inv.square();
  170|      1|      const auto z3_inv = s_inv * z2_inv;
  171|      1|      affine.push_back(AffinePoint(projective[0].x() * z2_inv, projective[0].y() * z3_inv));
  172|      1|      std::reverse(affine.begin(), affine.end());
  173|      1|      return affine;
  174|      1|   }
  175|       |
  176|      0|   return affine;
  177|      1|}
pcurves_numsp512d1.cpp:_ZN5Botan9to_affineINS_6PCurve12_GLOBAL__N_110numsp512d15CurveEEEDaRKNT_15ProjectivePointE:
   76|  4.13k|inline constexpr auto to_affine(const typename C::ProjectivePoint& pt) {
   77|       |   // Not strictly required right? - default should work as long
   78|       |   // as (0,0) is identity and invert returns 0 on 0
   79|       |
   80|  4.13k|   if constexpr(curve_supports_fe_invert2<C>) {
   81|  4.13k|      const auto z2_inv = C::fe_invert2(pt.z());
   82|  4.13k|      const auto z3_inv = z2_inv.square() * pt.z();
   83|  4.13k|      return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv);
   84|       |   } else {
   85|       |      const auto z_inv = invert_field_element<C>(pt.z());
   86|       |      const auto z2_inv = z_inv.square();
   87|       |      const auto z3_inv = z_inv * z2_inv;
   88|       |      return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv);
   89|       |   }
   90|  4.13k|}
pcurves_numsp512d1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEEENKUlvE_clEv:
  149|      1|      auto s_inv = [&]() {
  150|      1|         if constexpr(VariableTime) {
  151|      1|            return c[N - 1].invert_vartime();
  152|       |         } else {
  153|       |            return invert_field_element<C>(c[N - 1]);
  154|       |         }
  155|      1|      }();
pcurves_numsp512d1.cpp:_ZN5Botan22point_add_or_sub_mixedINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EET_RKSG_RKT0_NS_2CT6ChoiceERKT1_:
  296|   261k|                                                        const FieldElement& one) {
  297|   261k|   const auto a_is_identity = a.is_identity();
  298|   261k|   const auto b_is_identity = b.is_identity();
  299|       |
  300|       |   /*
  301|       |   https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addition-add-1998-cmo-2
  302|       |
  303|       |   Cost: 8M + 3S + 6add + 1*2
  304|       |   */
  305|       |
  306|   261k|   auto by = b.y();
  307|   261k|   by.conditional_assign(sub, by.negate());
  308|       |
  309|   261k|   const auto Z1Z1 = a.z().square();
  310|   261k|   const auto U2 = b.x() * Z1Z1;
  311|   261k|   const auto S2 = by * a.z() * Z1Z1;
  312|   261k|   const auto H = U2 - a.x();
  313|   261k|   const auto r = S2 - a.y();
  314|       |
  315|       |   /* Risky conditional
  316|       |   *
  317|       |   * This implementation uses projective coordinates, which do not have an efficient complete
  318|       |   * addition formula. We rely on the design of the multiplication algorithms to avoid doublings.
  319|       |   *
  320|       |   * This conditional only comes into play for the actual doubling case, not x + (-x) which
  321|       |   * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0,
  322|       |   * in which case at the end we'll set z to a.z * H = 0, resulting in the correct output
  323|       |   * (the identity element)
  324|       |   */
  325|   261k|   if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) {
  ------------------
  |  Branch (325:7): [True: 5, False: 261k]
  ------------------
  326|      5|      return a.dbl();
  327|      5|   }
  328|       |
  329|   261k|   const auto HH = H.square();
  330|   261k|   const auto HHH = H * HH;
  331|   261k|   const auto V = a.x() * HH;
  332|   261k|   const auto t2 = r.square();
  333|   261k|   const auto t3 = V + V;
  334|   261k|   const auto t4 = t2 - HHH;
  335|   261k|   auto X3 = t4 - t3;
  336|   261k|   const auto t5 = V - X3;
  337|   261k|   const auto t6 = a.y() * HHH;
  338|   261k|   const auto t7 = r * t5;
  339|   261k|   auto Y3 = t7 - t6;
  340|   261k|   auto Z3 = a.z() * H;
  341|       |
  342|       |   // if a is identity then return b
  343|   261k|   FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), by, one);
  344|       |
  345|       |   // if b is identity then return a
  346|   261k|   FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z());
  347|       |
  348|   261k|   return ProjectivePoint(X3, Y3, Z3);
  349|   261k|}
pcurves_numsp512d1.cpp:_ZN5Botan15point_add_mixedINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EET_RKSG_RKT0_RKT1_:
  240|  10.3k|                                                 const FieldElement& one) {
  241|  10.3k|   const auto a_is_identity = a.is_identity();
  242|  10.3k|   const auto b_is_identity = b.is_identity();
  243|       |
  244|       |   /*
  245|       |   https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addition-add-1998-cmo-2
  246|       |
  247|       |   Cost: 8M + 3S + 6add + 1*2
  248|       |   */
  249|       |
  250|  10.3k|   const auto Z1Z1 = a.z().square();
  251|  10.3k|   const auto U2 = b.x() * Z1Z1;
  252|  10.3k|   const auto S2 = b.y() * a.z() * Z1Z1;
  253|  10.3k|   const auto H = U2 - a.x();
  254|  10.3k|   const auto r = S2 - a.y();
  255|       |
  256|       |   /* Risky conditional
  257|       |   *
  258|       |   * This implementation uses projective coordinates, which do not have an efficient complete
  259|       |   * addition formula. We rely on the design of the multiplication algorithms to avoid doublings.
  260|       |   *
  261|       |   * This conditional only comes into play for the actual doubling case, not x + (-x) which
  262|       |   * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0,
  263|       |   * in which case at the end we'll set z to a.z * H = 0, resulting in the correct output
  264|       |   * (the identity element)
  265|       |   */
  266|  10.3k|   if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) {
  ------------------
  |  Branch (266:7): [True: 396, False: 9.92k]
  ------------------
  267|    396|      return a.dbl();
  268|    396|   }
  269|       |
  270|  9.92k|   const auto HH = H.square();
  271|  9.92k|   const auto HHH = H * HH;
  272|  9.92k|   const auto V = a.x() * HH;
  273|  9.92k|   const auto t2 = r.square();
  274|  9.92k|   const auto t3 = V + V;
  275|  9.92k|   const auto t4 = t2 - HHH;
  276|  9.92k|   auto X3 = t4 - t3;
  277|  9.92k|   const auto t5 = V - X3;
  278|  9.92k|   const auto t6 = a.y() * HHH;
  279|  9.92k|   const auto t7 = r * t5;
  280|  9.92k|   auto Y3 = t7 - t6;
  281|  9.92k|   auto Z3 = a.z() * H;
  282|       |
  283|       |   // if a is identity then return b
  284|  9.92k|   FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), one);
  285|       |
  286|       |   // if b is identity then return a
  287|  9.92k|   FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z());
  288|       |
  289|  9.92k|   return ProjectivePoint(X3, Y3, Z3);
  290|  10.3k|}
pcurves_numsp512d1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELb0EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEE:
  107|  1.23k|auto to_affine_batch(std::span<const typename C::ProjectivePoint> projective) {
  108|  1.23k|   using AffinePoint = typename C::AffinePoint;
  109|       |
  110|  1.23k|   const size_t N = projective.size();
  111|  1.23k|   std::vector<AffinePoint> affine;
  112|  1.23k|   affine.reserve(N);
  113|       |
  114|  1.23k|   CT::Choice any_identity = CT::Choice::no();
  115|       |
  116|  19.8k|   for(const auto& pt : projective) {
  ------------------
  |  Branch (116:23): [True: 19.8k, False: 1.23k]
  ------------------
  117|  19.8k|      any_identity = any_identity || pt.is_identity();
  118|  19.8k|   }
  119|       |
  120|       |   // Conditional acceptable: N is public. State of points is not necessarily
  121|       |   // public, but we don't leak which point was the identity. In practice with
  122|       |   // the algorithms currently in use, the only time an identity can occur is
  123|       |   // during mul2 where the two points g/h have a small relation (ie h = g*k for
  124|       |   // some k < 16)
  125|       |
  126|  1.23k|   if(N <= 2 || any_identity.as_bool()) {
  ------------------
  |  Branch (126:7): [True: 0, False: 1.23k]
  |  Branch (126:17): [True: 0, False: 1.23k]
  ------------------
  127|       |      // If there are identity elements, using the batch inversion gets
  128|       |      // tricky. It can be done, but this should be a rare situation so
  129|       |      // just punt to the serial conversion if it occurs
  130|      0|      for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (130:25): [True: 0, False: 0]
  ------------------
  131|      0|         affine.push_back(to_affine<C>(projective[i]));
  132|      0|      }
  133|  1.23k|   } else {
  134|  1.23k|      std::vector<typename C::FieldElement> c;
  135|  1.23k|      c.reserve(N);
  136|       |
  137|       |      /*
  138|       |      Batch projective->affine using Montgomery's trick
  139|       |
  140|       |      See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography"
  141|       |      (Hankerson, Menezes, Vanstone)
  142|       |      */
  143|       |
  144|  1.23k|      c.push_back(projective[0].z());
  145|  19.8k|      for(size_t i = 1; i != N; ++i) {
  ------------------
  |  Branch (145:25): [True: 18.5k, False: 1.23k]
  ------------------
  146|  18.5k|         c.push_back(c[i - 1] * projective[i].z());
  147|  18.5k|      }
  148|       |
  149|  1.23k|      auto s_inv = [&]() {
  150|  1.23k|         if constexpr(VariableTime) {
  151|  1.23k|            return c[N - 1].invert_vartime();
  152|  1.23k|         } else {
  153|  1.23k|            return invert_field_element<C>(c[N - 1]);
  154|  1.23k|         }
  155|  1.23k|      }();
  156|       |
  157|  19.8k|      for(size_t i = N - 1; i > 0; --i) {
  ------------------
  |  Branch (157:29): [True: 18.5k, False: 1.23k]
  ------------------
  158|  18.5k|         const auto& p = projective[i];
  159|       |
  160|  18.5k|         const auto z_inv = s_inv * c[i - 1];
  161|  18.5k|         const auto z2_inv = z_inv.square();
  162|  18.5k|         const auto z3_inv = z_inv * z2_inv;
  163|       |
  164|  18.5k|         s_inv = s_inv * p.z();
  165|       |
  166|  18.5k|         affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv));
  167|  18.5k|      }
  168|       |
  169|  1.23k|      const auto z2_inv = s_inv.square();
  170|  1.23k|      const auto z3_inv = s_inv * z2_inv;
  171|  1.23k|      affine.push_back(AffinePoint(projective[0].x() * z2_inv, projective[0].y() * z3_inv));
  172|  1.23k|      std::reverse(affine.begin(), affine.end());
  173|  1.23k|      return affine;
  174|  1.23k|   }
  175|       |
  176|      0|   return affine;
  177|  1.23k|}
pcurves_numsp512d1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELb0EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEEENKUlvE_clEv:
  149|  1.23k|      auto s_inv = [&]() {
  150|       |         if constexpr(VariableTime) {
  151|       |            return c[N - 1].invert_vartime();
  152|  1.23k|         } else {
  153|  1.23k|            return invert_field_element<C>(c[N - 1]);
  154|  1.23k|         }
  155|  1.23k|      }();
pcurves_numsp512d1.cpp:_ZN5Botan20invert_field_elementINS_6PCurve12_GLOBAL__N_110numsp512d15CurveEEEDaRKNT_12FieldElementE:
   35|  1.23k|inline constexpr auto invert_field_element(const typename C::FieldElement& fe) {
   36|  1.23k|   if constexpr(curve_supports_fe_invert2<C>) {
   37|  1.23k|      return C::fe_invert2(fe) * fe;
   38|       |   } else {
   39|       |      return fe.invert();
   40|       |   }
   41|  1.23k|}
pcurves_numsp512d1.cpp:_ZN5Botan15dbl_n_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EEEET_RKSE_m:
  432|   142k|inline constexpr ProjectivePoint dbl_n_a_minus_3(const ProjectivePoint& pt, size_t n) {
  433|   142k|   auto nx = pt.x();
  434|   142k|   auto ny = pt.y().mul2();
  435|   142k|   auto nz = pt.z();
  436|   142k|   auto w = nz.square().square();
  437|       |
  438|       |   // Conditional ok: loop iteration count is public
  439|   854k|   while(n > 0) {
  ------------------
  |  Branch (439:10): [True: 712k, False: 142k]
  ------------------
  440|   712k|      const auto ny2 = ny.square();
  441|   712k|      const auto ny4 = ny2.square();
  442|   712k|      const auto t1 = (nx.square() - w).mul3();
  443|   712k|      const auto t2 = nx * ny2;
  444|   712k|      nx = t1.square() - t2.mul2();
  445|   712k|      nz *= ny;
  446|   712k|      ny = t1 * (t2 - nx).mul2() - ny4;
  447|   712k|      n--;
  448|       |      // Conditional ok: loop iteration count is public
  449|   712k|      if(n > 0) {
  ------------------
  |  Branch (449:10): [True: 569k, False: 142k]
  ------------------
  450|   569k|         w *= ny4;
  451|   569k|      }
  452|   712k|   }
  453|   142k|   return ProjectivePoint(nx, ny.div2(), nz);
  454|   142k|}

pcurves_numsp512d1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS3_13Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE:
 1405|      1|            m_table(basemul_booth_setup<C, WindowBits>(p, BlindedScalar::Bits + 1)) {}
pcurves_numsp512d1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11from_affineERKNS_16AffineCurvePointISB_EE:
 1016|  5.37k|      static constexpr Self from_affine(const AffinePoint& pt) {
 1017|       |         /*
 1018|       |         * If the point is the identity element (x=0, y=0) then instead of
 1019|       |         * creating (x, y, 1) = (0, 0, 1) we want our projective identity
 1020|       |         * encoding of (0, 1, 0)
 1021|       |         *
 1022|       |         * Which we can achieve by a conditional swap of y and z if the
 1023|       |         * affine point is the identity.
 1024|       |         */
 1025|       |
 1026|  5.37k|         auto x = pt.x();
 1027|  5.37k|         auto y = pt.y();
 1028|  5.37k|         auto z = FieldElement::one();
 1029|       |
 1030|  5.37k|         FieldElement::conditional_swap(pt.is_identity(), y, z);
 1031|       |
 1032|  5.37k|         return ProjectiveCurvePoint(x, y, z);
 1033|  5.37k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1xEv:
  971|  6.99M|      constexpr const FieldElement& x() const { return m_x; }
pcurves_numsp512d1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1yEv:
  976|  6.73M|      constexpr const FieldElement& y() const { return m_y; }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE3oneEv:
  200|   278k|      static constexpr Self one() { return Self(Rep::one()); }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEC2ENSt3__15arrayImLm8EEE:
  898|  17.0M|      explicit constexpr IntMod(std::array<W, N> v) : m_val(v) {}
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_:
  410|  5.37k|      static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) {
  411|  5.37k|         const W mask = cond.into_bitmask<W>();
  412|       |
  413|  48.3k|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (413:28): [True: 42.9k, False: 5.37k]
  ------------------
  414|  42.9k|            auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]);
  415|  42.9k|            auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]);
  416|  42.9k|            x.m_val[i] = nx;
  417|  42.9k|            y.m_val[i] = ny;
  418|  42.9k|         }
  419|  5.37k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE11is_identityEv:
  928|   291k|      constexpr CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE7is_zeroEv:
  225|  1.43M|      constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); }
pcurves_numsp512d1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EC2ERKSB_SE_SE_:
 1056|   440k|            m_x(x), m_y(y), m_z(z) {}
pcurves_numsp512d1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3dblEv:
 1121|  11.9k|      constexpr Self dbl() const {
 1122|  11.9k|         if constexpr(Self::A_is_minus_3) {
 1123|  11.9k|            return dbl_a_minus_3(*this);
 1124|       |         } else if constexpr(Self::A_is_zero) {
 1125|       |            return dbl_a_zero(*this);
 1126|       |         } else {
 1127|       |            return dbl_generic(*this, A);
 1128|       |         }
 1129|  11.9k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1zEv:
 1172|  1.62M|      constexpr const FieldElement& z() const { return m_z; }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6squareEv:
  426|  4.06M|      constexpr BOTAN_FORCE_INLINE Self square() const {
  427|  4.06M|         std::array<W, 2 * N> z;  // NOLINT(*-member-init)
  428|  4.06M|         comba_sqr<N>(z.data(), this->data());
  429|  4.06M|         return Self(Rep::redc(z));
  430|  4.06M|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4dataEv:
  896|  17.5M|      constexpr const W* data() const { return m_val.data(); }
pcurves_numsp512d1.cpp:_ZN5BotanmlERKNS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_:
  346|  3.82M|      friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) {
  347|  3.82M|         std::array<W, 2 * N> z;  // NOLINT(*-member-init)
  348|  3.82M|         comba_mul<N>(z.data(), a.data(), b.data());
  349|  3.82M|         return Self(Rep::redc(z));
  350|  3.82M|      }
pcurves_numsp512d1.cpp:_ZN5BotanmiERKNS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_:
  281|  4.53M|      friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) {
  282|  4.53M|         std::array<W, N> r;  // NOLINT(*-member-init)
  283|  4.53M|         W carry = 0;
  284|  40.8M|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (284:28): [True: 36.2M, False: 4.53M]
  ------------------
  285|  36.2M|            r[i] = word_sub(a.m_val[i], b.m_val[i], &carry);
  286|  36.2M|         }
  287|       |
  288|  4.53M|         const auto mask = CT::Mask<W>::expand(carry).value();
  289|       |
  290|  4.53M|         carry = 0;
  291|       |
  292|  40.8M|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (292:28): [True: 36.2M, False: 4.53M]
  ------------------
  293|  36.2M|            r[i] = word_add(r[i], P[i] & mask, &carry);
  294|  36.2M|         }
  295|       |
  296|  4.53M|         return Self(r);
  297|  4.53M|      }
pcurves_numsp512d1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1xEv:
 1162|  1.03M|      constexpr const FieldElement& x() const { return m_x; }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul3Ev:
  335|   724k|      constexpr inline Self mul3() const { return mul2() + (*this); }
pcurves_numsp512d1.cpp:_ZN5BotanplERKNS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_:
  265|  1.01M|      friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) {
  266|  1.01M|         std::array<W, N> t;  // NOLINT(*-member-init)
  267|       |
  268|  1.01M|         W carry = 0;
  269|  9.16M|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (269:28): [True: 8.14M, False: 1.01M]
  ------------------
  270|  8.14M|            t[i] = word_add(a.m_val[i], b.m_val[i], &carry);
  271|  8.14M|         }
  272|       |
  273|  1.01M|         std::array<W, N> r;  // NOLINT(*-member-init)
  274|  1.01M|         bigint_monty_maybe_sub<N>(r.data(), carry, t.data(), P.data());
  275|  1.01M|         return Self(r);
  276|  1.01M|      }
pcurves_numsp512d1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1yEv:
 1167|  1.02M|      constexpr const FieldElement& y() const { return m_y; }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul4Ev:
  338|  11.9k|      constexpr inline Self mul4() const { return mul2().mul2(); }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul2Ev:
  325|  2.37M|      constexpr BOTAN_FORCE_INLINE Self mul2() const {
  326|  2.37M|         std::array<W, N> t = value();
  327|  2.37M|         const W carry = shift_left<1>(t);
  328|       |
  329|  2.37M|         std::array<W, N> r;  // NOLINT(*-member-init)
  330|  2.37M|         bigint_monty_maybe_sub<N>(r.data(), carry, t.data(), P.data());
  331|  2.37M|         return Self(r);
  332|  2.37M|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE5valueEv:
  894|  2.51M|      constexpr const std::array<W, N>& value() const { return m_val; }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul8Ev:
  341|  11.9k|      constexpr inline Self mul8() const { return mul2().mul2().mul2(); }
pcurves_numsp512d1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EESE_:
 1064|  1.45k|      friend constexpr Self operator+(const Self& a, const Self& b) { return Self::add(a, b); }
pcurves_numsp512d1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3addERKSC_SE_:
 1103|  1.45k|      constexpr static Self add(const Self& a, const Self& b) { return point_add<Self, FieldElement>(a, b); }
pcurves_numsp512d1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11is_identityEv:
 1082|   297k|      constexpr CT::Choice is_identity() const { return z().is_zero(); }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18conditional_assignERSA_SB_SB_NS_2CT6ChoiceERKSA_SF_SF_:
  395|   548k|         Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) {
  396|   548k|         const W mask = cond.into_bitmask<W>();
  397|       |
  398|  4.93M|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (398:28): [True: 4.38M, False: 548k]
  ------------------
  399|  4.38M|            x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]);
  400|  4.38M|            y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]);
  401|  4.38M|            z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]);
  402|  4.38M|         }
  403|   548k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEmLERKSA_:
  355|  1.38M|      constexpr BOTAN_FORCE_INLINE Self& operator*=(const Self& other) {
  356|  1.38M|         std::array<W, 2 * N> z;  // NOLINT(*-member-init)
  357|  1.38M|         comba_mul<N>(z.data(), data(), other.data());
  358|  1.38M|         m_val = Rep::redc(z);
  359|  1.38M|         return (*this);
  360|  1.38M|      }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE8square_nEm:
  439|  69.7k|      constexpr void square_n(size_t n) {
  440|  69.7k|         std::array<W, 2 * N> z;  // NOLINT(*-member-init)
  441|  2.79M|         for(size_t i = 0; i != n; ++i) {
  ------------------
  |  Branch (441:28): [True: 2.72M, False: 69.7k]
  ------------------
  442|  2.72M|            comba_sqr<N>(z.data(), this->data());
  443|  2.72M|            m_val = Rep::redc(z);
  444|  2.72M|         }
  445|  69.7k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE14invert_vartimeEv:
  598|      1|      constexpr Self invert_vartime() const {
  599|       |         // Conditional ok: this function is variable time
  600|      1|         if(this->is_zero().as_bool()) {
  ------------------
  |  Branch (600:13): [True: 0, False: 1]
  ------------------
  601|      0|            return Self::zero();
  602|      0|         }
  603|       |
  604|      1|         auto x = Self(std::array<W, N>{1});  // 1 in standard domain
  605|      1|         auto b = Self(this->to_words());     // *this in standard domain
  606|       |
  607|       |         // First loop iteration
  608|      1|         Self::_invert_vartime_div2_helper(b, x);
  609|       |
  610|      1|         auto a = b.negate();
  611|       |         // y += x but y is zero at the outset
  612|      1|         auto y = x;
  613|       |
  614|       |         // First half of second loop iteration
  615|      1|         Self::_invert_vartime_div2_helper(a, y);
  616|       |
  617|    375|         for(;;) {
  618|       |            // Conditional ok: this function is variable time
  619|    375|            if(a.m_val == b.m_val) {
  ------------------
  |  Branch (619:16): [True: 1, False: 374]
  ------------------
  620|       |               // At this point it should be that a == b == 1
  621|      1|               auto r = y.negate();
  622|       |
  623|       |               // Convert back to Montgomery if required
  624|      1|               r.m_val = Rep::to_rep(r.m_val);
  625|      1|               return r;
  626|      1|            }
  627|       |
  628|    374|            auto nx = x + y;
  629|       |
  630|       |            /*
  631|       |            * Otherwise either b > a or a > b
  632|       |            *
  633|       |            * If b > a we want to set b to b - a
  634|       |            * Otherwise we want to set a to a - b
  635|       |            *
  636|       |            * Compute r = b - a and check if it underflowed
  637|       |            * If it did not then we are in the b > a path
  638|       |            */
  639|    374|            std::array<W, N> r;  // NOLINT(*-member-init)
  640|    374|            const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N);
  641|       |
  642|       |            // Conditional ok: this function is variable time
  643|    374|            if(carry == 0) {
  ------------------
  |  Branch (643:16): [True: 177, False: 197]
  ------------------
  644|       |               // b > a
  645|    177|               b.m_val = r;
  646|    177|               x = nx;
  647|    177|               Self::_invert_vartime_div2_helper(b, x);
  648|    197|            } else {
  649|       |               // We know this can't underflow because a > b
  650|    197|               bigint_sub3(r.data(), a.data(), N, b.data(), N);
  651|    197|               a.m_val = r;
  652|    197|               y = nx;
  653|    197|               Self::_invert_vartime_div2_helper(a, y);
  654|    197|            }
  655|    374|         }
  656|      1|      }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4zeroEv:
  195|   530k|      static constexpr Self zero() { return Self(std::array<W, N>{0}); }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE8to_wordsEv:
  734|      1|      constexpr std::array<W, Self::N> to_words() const { return Rep::from_rep(m_val); }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE27_invert_vartime_div2_helperERSA_SB_:
  547|    376|      static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) {
  548|    376|         constexpr auto INV_2 = p_div_2_plus_1(Rep::P);
  549|       |
  550|       |         // Conditional ok: this function is variable time
  551|  1.09k|         while((a.m_val[0] & 1) != 1) {
  ------------------
  |  Branch (551:16): [True: 715, False: 376]
  ------------------
  552|    715|            shift_right<1>(a.m_val);
  553|       |
  554|    715|            const W borrow = shift_right<1>(x.m_val);
  555|       |
  556|       |            // Conditional ok: this function is variable time
  557|    715|            if(borrow) {
  ------------------
  |  Branch (557:16): [True: 363, False: 352]
  ------------------
  558|    363|               bigint_add2(x.m_val.data(), N, INV_2.data(), N);
  559|    363|            }
  560|    715|         }
  561|    376|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6negateEv:
  452|   263k|      constexpr Self negate() const {
  453|   263k|         const W x_is_zero = ~CT::all_zeros(this->data(), N).value();
  454|       |
  455|   263k|         std::array<W, N> r;  // NOLINT(*-member-init)
  456|   263k|         W carry = 0;
  457|  2.37M|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (457:28): [True: 2.11M, False: 263k]
  ------------------
  458|  2.11M|            r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry);
  459|  2.11M|         }
  460|       |
  461|   263k|         return Self(r);
  462|   263k|      }
pcurves_numsp512d1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEEC2ERKSB_SE_:
  917|   305k|      constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {}
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv:
  759|  21.4k|      std::array<W, L> stash_value() const {
  760|  21.4k|         static_assert(L >= N);
  761|  21.4k|         std::array<W, L> stash = {};
  762|   193k|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (762:28): [True: 171k, False: 21.4k]
  ------------------
  763|   171k|            stash[i] = m_val[i];
  764|   171k|         }
  765|  21.4k|         return stash;
  766|  21.4k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm6EE3mulERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_13Numsp512d1RepEE12ScalarParamsEEEEERNS_21RandomNumberGeneratorE:
 1407|  1.23k|      ProjectivePoint mul(const Scalar& s, RandomNumberGenerator& rng) const {
 1408|  1.23k|         const BlindedScalar scalar(s, rng);
 1409|  1.23k|         return basemul_booth_exec<C, WindowBits>(m_table, scalar, rng);
 1410|  1.23k|      }
pcurves_numsp512d1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm7EEC2ERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_13Numsp512d1RepEE12ScalarParamsEEEEERNS_21RandomNumberGeneratorE:
 1307|  1.23k|      BlindedScalarBits(const typename C::Scalar& scalar, RandomNumberGenerator& rng) {
 1308|  1.23k|         if(BlindingBits > 0 && rng.is_seeded()) {
  ------------------
  |  Branch (1308:13): [True: 1.23k, Folded]
  |  Branch (1308:33): [True: 1.23k, False: 0]
  ------------------
 1309|  1.23k|            constexpr size_t MaskWords = (BlindingBits + WordInfo<W>::bits - 1) / WordInfo<W>::bits;
 1310|  1.23k|            constexpr size_t MaskBytes = MaskWords * WordInfo<W>::bytes;
 1311|       |
 1312|  1.23k|            constexpr size_t n_words = C::Words;
 1313|       |
 1314|  1.23k|            uint8_t maskb[MaskBytes + (BlindingBits == 0 ? 1 : 0)] = {0};
 1315|  1.23k|            rng.randomize(maskb, MaskBytes);
 1316|       |
 1317|  1.23k|            W mask[n_words] = {0};
 1318|  1.23k|            load_le(mask, maskb, MaskWords);
 1319|       |
 1320|       |            // Mask to exactly BlindingBits
 1321|  1.23k|            constexpr size_t ExcessBits = MaskWords * WordInfo<W>::bits - BlindingBits;
 1322|       |            if constexpr(ExcessBits > 0) {
 1323|       |               constexpr W ExcessMask = (static_cast<W>(1) << (WordInfo<W>::bits - ExcessBits)) - 1;
 1324|       |               mask[MaskWords - 1] &= ExcessMask;
 1325|       |            }
 1326|       |
 1327|       |            // Set top and bottom bits of mask
 1328|  1.23k|            constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo<W>::bits;
 1329|  1.23k|            mask[(BlindingBits - 1) / WordInfo<W>::bits] |= static_cast<W>(1) << TopMaskBit;
 1330|  1.23k|            mask[0] |= 1;
 1331|       |
 1332|  1.23k|            W mask_n[2 * n_words] = {0};
 1333|       |
 1334|  1.23k|            const auto sw = scalar.to_words();
 1335|       |
 1336|       |            // Compute masked scalar s + k*n
 1337|  1.23k|            comba_mul<n_words>(mask_n, mask, C::NW.data());
 1338|  1.23k|            bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size());
 1339|       |
 1340|  1.23k|            std::reverse(mask_n, mask_n + 2 * n_words);
 1341|  1.23k|            m_bytes = store_be<std::vector<uint8_t>>(mask_n);
 1342|  1.23k|            m_bits = C::Scalar::BITS + BlindingBits;
 1343|  1.23k|         } else {
 1344|       |            // No RNG available, skip blinding
 1345|      0|            m_bytes.resize(C::Scalar::BYTES);
 1346|      0|            scalar.serialize_to(std::span{m_bytes}.template first<C::Scalar::BYTES>());
 1347|      0|            m_bits = C::Scalar::BITS;
 1348|      0|         }
 1349|       |
 1350|  1.23k|         CT::poison(m_bytes.data(), m_bytes.size());
 1351|  1.23k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_110numsp512d16ParamsENS5_13Numsp512d1RepEE12ScalarParamsEEEE8to_wordsEv:
  734|  2.47k|      constexpr std::array<W, Self::N> to_words() const { return Rep::from_rep(m_val); }
pcurves_numsp512d1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_110numsp512d16ParamsENS4_13Numsp512d1RepEE12ScalarParamsEE8from_repERKNSt3__15arrayImLm8EEE:
  137|  2.47k|      constexpr static std::array<W, N> from_rep(const std::array<W, N>& z) {
  138|  2.47k|         std::array<W, 2 * N> ze = {};
  139|  2.47k|         copy_mem(std::span{ze}.template first<N>(), z);
  140|  2.47k|         return Self::redc(ze);
  141|  2.47k|      }
pcurves_numsp512d1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_110numsp512d16ParamsENS4_13Numsp512d1RepEE12ScalarParamsEE4redcERKNSt3__15arrayImLm16EEE:
  104|  4.14k|      constexpr static std::array<W, N> redc(const std::array<W, 2 * N>& z) {
  105|       |         if constexpr(P_dash == 1) {
  106|       |            return monty_redc_pdash1(z, P);
  107|  4.14k|         } else {
  108|  4.14k|            return monty_redc(z, P, P_dash);
  109|  4.14k|         }
  110|  4.14k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm7EE4bitsEv:
 1305|  1.23k|      size_t bits() const { return m_bits; }
pcurves_numsp512d1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E18conditional_assignENS_2CT6ChoiceERKSC_:
 1084|  2.47k|      constexpr void conditional_assign(CT::Choice cond, const Self& pt) {
 1085|  2.47k|         FieldElement::conditional_assign(m_x, m_y, m_z, cond, pt.x(), pt.y(), pt.z());
 1086|  2.47k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E6negateEv:
 1134|  2.47k|      constexpr Self negate() const { return Self(x(), y().negate(), z()); }
pcurves_numsp512d1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E18_const_time_poisonEv:
 1174|  2.47k|      constexpr void _const_time_poison() const { CT::poison_all(m_x, m_y, m_z); }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18_const_time_poisonEv:
  889|  7.43k|      constexpr void _const_time_poison() const { CT::poison(m_val); }
pcurves_numsp512d1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm7EE10get_windowEm:
 1353|   120k|      size_t get_window(size_t offset) const {
 1354|       |         // Extract a WindowBits sized window out of s, depending on offset.
 1355|   120k|         return read_window_bits<WindowBits>(std::span{m_bytes}, offset);
 1356|   120k|      }
pcurves_numsp512d1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E10add_or_subERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceE:
 1096|   261k|      constexpr static Self add_or_sub(const Self& a, const AffinePoint& b, CT::Choice sub) {
 1097|   261k|         return point_add_or_sub_mixed<Self, AffinePoint, FieldElement>(a, b, sub, FieldElement::one());
 1098|   261k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18conditional_assignENS_2CT6ChoiceERKSA_:
  367|   261k|      constexpr void conditional_assign(CT::Choice cond, const Self& nx) {
  368|   261k|         const W mask = cond.into_bitmask<W>();
  369|       |
  370|  2.35M|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (370:28): [True: 2.09M, False: 261k]
  ------------------
  371|  2.09M|            m_val[i] = Botan::choose(mask, nx.m_val[i], m_val[i]);
  372|  2.09M|         }
  373|   261k|      }
pcurves_numsp512d1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE9ct_selectENSt3__14spanIKSC_Lm18446744073709551615EEEm:
  955|   120k|      static constexpr auto ct_select(std::span<const Self> pts, size_t idx) {
  956|   120k|         auto result = Self::identity(pts[0]);
  957|       |
  958|       |         // Intentionally wrapping; set to maximum size_t if idx == 0
  959|   120k|         const size_t idx1 = static_cast<size_t>(idx - 1);
  960|  3.96M|         for(size_t i = 0; i != pts.size(); ++i) {
  ------------------
  |  Branch (960:28): [True: 3.84M, False: 120k]
  ------------------
  961|  3.84M|            const auto found = CT::Mask<size_t>::is_equal(idx1, i).as_choice();
  962|  3.84M|            result.conditional_assign(found, pts[i]);
  963|  3.84M|         }
  964|       |
  965|   120k|         return result;
  966|   120k|      }
pcurves_numsp512d1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE8identityERKSC_:
  924|   263k|      static constexpr Self identity(const Self& /*unused*/) {
  925|   263k|         return Self(FieldElement::zero(), FieldElement::zero());
  926|   263k|      }
pcurves_numsp512d1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE18conditional_assignENS_2CT6ChoiceERKSC_:
  981|  6.14M|      constexpr void conditional_assign(CT::Choice cond, const Self& pt) {
  982|  6.14M|         FieldElement::conditional_assign(m_x, m_y, cond, pt.x(), pt.y());
  983|  6.14M|      }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18conditional_assignERSA_SB_NS_2CT6ChoiceERKSA_SF_:
  380|  6.14M|      static constexpr void conditional_assign(Self& x, Self& y, CT::Choice cond, const Self& nx, const Self& ny) {
  381|  6.14M|         const W mask = cond.into_bitmask<W>();
  382|       |
  383|  55.3M|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (383:28): [True: 49.1M, False: 6.14M]
  ------------------
  384|  49.1M|            x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]);
  385|  49.1M|            y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]);
  386|  49.1M|         }
  387|  6.14M|      }
pcurves_numsp512d1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E13randomize_repERNS_21RandomNumberGeneratorE:
 1142|  9.91k|      void randomize_rep(RandomNumberGenerator& rng) {
 1143|       |         // In certain contexts we may be called with a Null_RNG; in that case the
 1144|       |         // caller is accepting that randomization will not occur
 1145|       |
 1146|       |         // Conditional ok: caller's RNG state (seeded vs not) is presumed public
 1147|  9.91k|         if(rng.is_seeded()) {
  ------------------
  |  Branch (1147:13): [True: 9.91k, False: 0]
  ------------------
 1148|  9.91k|            auto r = FieldElement::random(rng);
 1149|       |
 1150|  9.91k|            auto r2 = r.square();
 1151|  9.91k|            auto r3 = r2 * r;
 1152|       |
 1153|  9.91k|            m_x *= r2;
 1154|  9.91k|            m_y *= r3;
 1155|  9.91k|            m_z *= r;
 1156|  9.91k|         }
 1157|  9.91k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6randomERNS_21RandomNumberGeneratorE:
  851|  9.91k|      static Self random(RandomNumberGenerator& rng) {
  852|  9.91k|         constexpr size_t MAX_ATTEMPTS = 1000;
  853|       |
  854|  9.91k|         std::array<uint8_t, Self::BYTES> buf{};
  855|       |
  856|  9.91k|         for(size_t i = 0; i != MAX_ATTEMPTS; ++i) {
  ------------------
  |  Branch (856:28): [True: 9.91k, False: 0]
  ------------------
  857|  9.91k|            rng.randomize(buf);
  858|       |
  859|       |            // Zero off high bits that if set would certainly cause us
  860|       |            // to be out of range
  861|       |            if constexpr(Self::BITS % 8 != 0) {
  862|       |               constexpr uint8_t mask = 0xFF >> (8 - (Self::BITS % 8));
  863|       |               buf[0] &= mask;
  864|       |            }
  865|       |
  866|       |            // Conditionals ok: rejection sampling reveals only values we didn't use
  867|  9.91k|            if(auto s = Self::deserialize(buf)) {
  ------------------
  |  Branch (867:21): [True: 9.91k, False: 0]
  ------------------
  868|  9.91k|               if(s.value().is_nonzero().as_bool()) {
  ------------------
  |  Branch (868:19): [True: 9.91k, False: 0]
  ------------------
  869|  9.91k|                  return s.value();
  870|  9.91k|               }
  871|  9.91k|            }
  872|  9.91k|         }
  873|       |
  874|      0|         throw Internal_Error("Failed to generate random Scalar within bounded number of attempts");
  875|  9.91k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE:
  792|  10.7k|      static std::optional<Self> deserialize(std::span<const uint8_t> bytes) {
  793|       |         // Conditional ok: input length is public
  794|  10.7k|         if(bytes.size() != Self::BYTES) {
  ------------------
  |  Branch (794:13): [True: 0, False: 10.7k]
  ------------------
  795|      0|            return {};
  796|      0|         }
  797|       |
  798|  10.7k|         const auto words = bytes_to_words<W, N, BYTES>(bytes.first<Self::BYTES>());
  799|       |
  800|       |         // Conditional acceptable: std::optional is implicitly not constant time
  801|  10.7k|         if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) {
  ------------------
  |  Branch (801:13): [True: 0, False: 10.7k]
  ------------------
  802|      0|            return {};
  803|      0|         }
  804|       |
  805|       |         // Safe because we checked above that words is an integer < P
  806|  10.7k|         return Self::from_words(words);
  807|  10.7k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE10from_wordsILm8EEESA_NSt3__15arrayImXT_EEE:
  211|  10.7k|      static constexpr Self from_words(std::array<W, L> w) {
  212|  10.7k|         if constexpr(L == N) {
  213|  10.7k|            return Self(Rep::to_rep(w));
  214|       |         } else {
  215|       |            static_assert(L < N);
  216|       |            std::array<W, N> ew = {};
  217|       |            copy_mem(std::span{ew}.template first<L>(), w);
  218|       |            return Self(Rep::to_rep(ew));
  219|       |         }
  220|  10.7k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE10is_nonzeroEv:
  230|  9.91k|      constexpr CT::Choice is_nonzero() const { return !is_zero(); }
pcurves_numsp512d1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E20_const_time_unpoisonEv:
 1176|  2.47k|      constexpr void _const_time_unpoison() const { CT::unpoison_all(m_x, m_y, m_z); }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE20_const_time_unpoisonEv:
  891|  7.43k|      constexpr void _const_time_unpoison() const { CT::unpoison(m_val); }
pcurves_numsp512d1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm7EED2Ev:
 1358|  1.23k|      ~BlindedScalarBits() {
 1359|  1.23k|         secure_zeroize_buffer(m_bytes.data(), m_bytes.size());
 1360|  1.23k|         CT::unpoison(m_bytes.data(), m_bytes.size());
 1361|  1.23k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_110numsp512d16ParamsENS5_13Numsp512d1RepEE12ScalarParamsEEEE10from_stashILm9EEESB_RKNSt3__15arrayImXT_EEE:
  774|  4.55k|      static Self from_stash(const std::array<W, L>& stash) {
  775|  4.55k|         static_assert(L >= N);
  776|  4.55k|         std::array<W, N> val = {};
  777|  40.9k|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (777:28): [True: 36.4k, False: 4.55k]
  ------------------
  778|  36.4k|            val[i] = stash[i];
  779|  36.4k|         }
  780|  4.55k|         return Self(val);
  781|  4.55k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_110numsp512d16ParamsENS5_13Numsp512d1RepEE12ScalarParamsEEEEC2ENSt3__15arrayImLm8EEE:
  898|  5.80k|      explicit constexpr IntMod(std::array<W, N> v) : m_val(v) {}
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE12serialize_toENSt3__14spanIhLm64EEE:
  739|  9.91k|      constexpr void serialize_to(std::span<uint8_t, Self::BYTES> bytes) const {
  740|  9.91k|         auto v = Rep::from_rep(m_val);
  741|  9.91k|         std::reverse(v.begin(), v.end());
  742|       |
  743|  9.91k|         if constexpr(Self::BYTES == N * WordInfo<W>::bytes) {
  744|  9.91k|            store_be(bytes, v);
  745|       |         } else {
  746|       |            // Remove leading zero bytes
  747|       |            const auto padded_bytes = store_be(v);
  748|       |            constexpr size_t extra = N * WordInfo<W>::bytes - Self::BYTES;
  749|       |            copy_mem(bytes, std::span{padded_bytes}.template subspan<extra, Self::BYTES>());
  750|       |         }
  751|  9.91k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_110numsp512d16ParamsENS5_13Numsp512d1RepEE12ScalarParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv:
  759|  1.24k|      std::array<W, L> stash_value() const {
  760|  1.24k|         static_assert(L >= N);
  761|  1.24k|         std::array<W, L> stash = {};
  762|  11.2k|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (762:28): [True: 9.98k, False: 1.24k]
  ------------------
  763|  9.98k|            stash[i] = m_val[i];
  764|  9.98k|         }
  765|  1.24k|         return stash;
  766|  1.24k|      }
pcurves_numsp512d1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_110numsp512d16ParamsENS4_13Numsp512d1RepEE12ScalarParamsEE11wide_to_repERKNSt3__15arrayImLm16EEE:
  127|    832|      constexpr static std::array<W, N> wide_to_rep(const std::array<W, 2 * N>& x) {
  128|    832|         auto redc_x = Self::redc(x);
  129|    832|         std::array<W, 2 * N> z;  // NOLINT(*-member-init)
  130|    832|         comba_mul<N>(z.data(), redc_x.data(), R3.data());
  131|    832|         return Self::redc(z);
  132|    832|      }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE:
  774|  41.3k|      static Self from_stash(const std::array<W, L>& stash) {
  775|  41.3k|         static_assert(L >= N);
  776|  41.3k|         std::array<W, N> val = {};
  777|   371k|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (777:28): [True: 330k, False: 41.3k]
  ------------------
  778|   330k|            val[i] = stash[i];
  779|   330k|         }
  780|  41.3k|         return Self(val);
  781|  41.3k|      }
pcurves_numsp512d1.cpp:_ZN5Botan21WindowedBoothMulTableINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm4EEC2ERKNS_16AffineCurvePointINS_6IntModINS3_13Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE:
 1487|  1.23k|      explicit WindowedBoothMulTable(const AffinePoint& p) : m_table(varpoint_setup<C, TableSize>(p)) {}
pcurves_numsp512d1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EERKNS_16AffineCurvePointISB_EE:
 1066|  10.3k|      friend constexpr Self operator+(const Self& a, const AffinePoint& b) { return Self::add_mixed(a, b); }
pcurves_numsp512d1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E9add_mixedERKSC_RKNS_16AffineCurvePointISB_EE:
 1091|  10.3k|      constexpr static Self add_mixed(const Self& a, const AffinePoint& b) {
 1092|  10.3k|         return point_add_mixed<Self, AffinePoint, FieldElement>(a, b, FieldElement::one());
 1093|  10.3k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan21WindowedBoothMulTableINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm4EE3mulERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_13Numsp512d1RepEE12ScalarParamsEEEEERNS_21RandomNumberGeneratorE:
 1489|  1.23k|      ProjectivePoint mul(const Scalar& s, RandomNumberGenerator& rng) const {
 1490|  1.23k|         const BlindedScalar bits(s, rng);
 1491|       |
 1492|  1.23k|         const size_t scalar_bits = bits.bits();
 1493|  1.23k|         const size_t full_windows = compute_full_windows(scalar_bits + 1, WindowBits);
 1494|  1.23k|         const size_t initial_shift = compute_initial_shift(scalar_bits + 1, WindowBits);
 1495|       |
 1496|  1.23k|         BOTAN_DEBUG_ASSERT(full_windows * WindowBits + initial_shift == scalar_bits + 1);
  ------------------
  |  |  130|  1.23k|      do { /* NOLINT(*-avoid-do-while) */ \
  |  |  131|  1.23k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (131:15): [Folded, False: 1.23k]
  |  |  ------------------
  ------------------
 1497|  1.23k|         BOTAN_DEBUG_ASSERT(initial_shift > 0);
  ------------------
  |  |  130|  1.23k|      do { /* NOLINT(*-avoid-do-while) */ \
  |  |  131|  1.23k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (131:15): [Folded, False: 1.23k]
  |  |  ------------------
  ------------------
 1498|       |
 1499|  1.23k|         auto accum = ProjectivePoint::identity();
 1500|  1.23k|         CT::poison(accum);
 1501|       |
 1502|   143k|         for(size_t i = 0; i != full_windows; ++i) {
  ------------------
  |  Branch (1502:28): [True: 142k, False: 1.23k]
  ------------------
 1503|   142k|            const size_t idx = scalar_bits - initial_shift - WindowBits * i;
 1504|       |
 1505|   142k|            const size_t w_i = bits.get_window(idx);
 1506|   142k|            const auto [tidx, tneg] = booth_recode<WindowBits>(w_i);
 1507|       |
 1508|       |            // Conditional ok: loop iteration count is public
 1509|   142k|            if(i == 0) {
  ------------------
  |  Branch (1509:16): [True: 1.23k, False: 141k]
  ------------------
 1510|  1.23k|               accum = ProjectivePoint::from_affine(m_table.ct_select(tidx));
 1511|  1.23k|               accum.conditional_assign(tneg, accum.negate());
 1512|   141k|            } else {
 1513|   141k|               accum = ProjectivePoint::add_or_sub(accum, m_table.ct_select(tidx), tneg);
 1514|   141k|            }
 1515|       |
 1516|   142k|            accum = accum.dbl_n(WindowBits);
 1517|       |
 1518|       |            // Conditional ok: loop iteration count is public
 1519|   142k|            if(i <= 3) {
  ------------------
  |  Branch (1519:16): [True: 4.95k, False: 137k]
  ------------------
 1520|  4.95k|               accum.randomize_rep(rng);
 1521|  4.95k|            }
 1522|   142k|         }
 1523|       |
 1524|       |         // final window (note one bit shorter than previous reads)
 1525|  1.23k|         const size_t w_l = bits.get_window(0) & ((1 << WindowBits) - 1);
 1526|  1.23k|         const auto [tidx, tneg] = booth_recode<WindowBits>(w_l << 1);
 1527|  1.23k|         accum = ProjectivePoint::add_or_sub(accum, m_table.ct_select(tidx), tneg);
 1528|       |
 1529|  1.23k|         CT::unpoison(accum);
 1530|  1.23k|         return accum;
 1531|  1.23k|      }
pcurves_numsp512d1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm6EEC2ERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_13Numsp512d1RepEE12ScalarParamsEEEEERNS_21RandomNumberGeneratorE:
 1307|  1.23k|      BlindedScalarBits(const typename C::Scalar& scalar, RandomNumberGenerator& rng) {
 1308|  1.23k|         if(BlindingBits > 0 && rng.is_seeded()) {
  ------------------
  |  Branch (1308:13): [True: 1.23k, Folded]
  |  Branch (1308:33): [True: 1.23k, False: 0]
  ------------------
 1309|  1.23k|            constexpr size_t MaskWords = (BlindingBits + WordInfo<W>::bits - 1) / WordInfo<W>::bits;
 1310|  1.23k|            constexpr size_t MaskBytes = MaskWords * WordInfo<W>::bytes;
 1311|       |
 1312|  1.23k|            constexpr size_t n_words = C::Words;
 1313|       |
 1314|  1.23k|            uint8_t maskb[MaskBytes + (BlindingBits == 0 ? 1 : 0)] = {0};
 1315|  1.23k|            rng.randomize(maskb, MaskBytes);
 1316|       |
 1317|  1.23k|            W mask[n_words] = {0};
 1318|  1.23k|            load_le(mask, maskb, MaskWords);
 1319|       |
 1320|       |            // Mask to exactly BlindingBits
 1321|  1.23k|            constexpr size_t ExcessBits = MaskWords * WordInfo<W>::bits - BlindingBits;
 1322|       |            if constexpr(ExcessBits > 0) {
 1323|       |               constexpr W ExcessMask = (static_cast<W>(1) << (WordInfo<W>::bits - ExcessBits)) - 1;
 1324|       |               mask[MaskWords - 1] &= ExcessMask;
 1325|       |            }
 1326|       |
 1327|       |            // Set top and bottom bits of mask
 1328|  1.23k|            constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo<W>::bits;
 1329|  1.23k|            mask[(BlindingBits - 1) / WordInfo<W>::bits] |= static_cast<W>(1) << TopMaskBit;
 1330|  1.23k|            mask[0] |= 1;
 1331|       |
 1332|  1.23k|            W mask_n[2 * n_words] = {0};
 1333|       |
 1334|  1.23k|            const auto sw = scalar.to_words();
 1335|       |
 1336|       |            // Compute masked scalar s + k*n
 1337|  1.23k|            comba_mul<n_words>(mask_n, mask, C::NW.data());
 1338|  1.23k|            bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size());
 1339|       |
 1340|  1.23k|            std::reverse(mask_n, mask_n + 2 * n_words);
 1341|  1.23k|            m_bytes = store_be<std::vector<uint8_t>>(mask_n);
 1342|  1.23k|            m_bits = C::Scalar::BITS + BlindingBits;
 1343|  1.23k|         } else {
 1344|       |            // No RNG available, skip blinding
 1345|      0|            m_bytes.resize(C::Scalar::BYTES);
 1346|      0|            scalar.serialize_to(std::span{m_bytes}.template first<C::Scalar::BYTES>());
 1347|      0|            m_bits = C::Scalar::BITS;
 1348|      0|         }
 1349|       |
 1350|  1.23k|         CT::poison(m_bytes.data(), m_bytes.size());
 1351|  1.23k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm6EE4bitsEv:
 1305|  1.23k|      size_t bits() const { return m_bits; }
pcurves_numsp512d1.cpp:_ZN5Botan21WindowedBoothMulTableINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm4EE20compute_full_windowsEmm:
 1468|  1.23k|      static constexpr size_t compute_full_windows(size_t sb, size_t wb) {
 1469|  1.23k|         if(sb % wb == 0) {
  ------------------
  |  Branch (1469:13): [True: 0, False: 1.23k]
  ------------------
 1470|      0|            return (sb - 1) / wb;
 1471|  1.23k|         } else {
 1472|  1.23k|            return sb / wb;
 1473|  1.23k|         }
 1474|  1.23k|      }
pcurves_numsp512d1.cpp:_ZN5Botan21WindowedBoothMulTableINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm4EE21compute_initial_shiftEmm:
 1476|  1.23k|      static constexpr size_t compute_initial_shift(size_t sb, size_t wb) {
 1477|  1.23k|         if(sb % wb == 0) {
  ------------------
  |  Branch (1477:13): [True: 0, False: 1.23k]
  ------------------
 1478|      0|            return wb;
 1479|  1.23k|         } else {
 1480|  1.23k|            return sb - (sb / wb) * wb;
 1481|  1.23k|         }
 1482|  1.23k|      }
pcurves_numsp512d1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E8identityEv:
 1038|  1.23k|      static constexpr Self identity() { return Self(FieldElement::zero(), FieldElement::one(), FieldElement::zero()); }
pcurves_numsp512d1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm6EE10get_windowEm:
 1353|   143k|      size_t get_window(size_t offset) const {
 1354|       |         // Extract a WindowBits sized window out of s, depending on offset.
 1355|   143k|         return read_window_bits<WindowBits>(std::span{m_bytes}, offset);
 1356|   143k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E5dbl_nEm:
 1108|   142k|      constexpr Self dbl_n(size_t n) const {
 1109|   142k|         if constexpr(Self::A_is_minus_3) {
 1110|   142k|            return dbl_n_a_minus_3(*this, n);
 1111|       |         } else if constexpr(Self::A_is_zero) {
 1112|       |            return dbl_n_a_zero(*this, n);
 1113|       |         } else {
 1114|       |            return dbl_n_generic(*this, A, n);
 1115|       |         }
 1116|   142k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4div2Ev:
  302|   142k|      Self div2() const {
  303|       |         // The inverse of 2 modulo P is (P/2)+1; this avoids a constexpr time
  304|       |         // general inversion, which some compilers can't handle
  305|   142k|         constexpr auto INV_2 = p_div_2_plus_1(Rep::P);
  306|       |
  307|       |         // We could multiply by INV_2 but there is a better way ...
  308|       |
  309|   142k|         std::array<W, N> t = value();
  310|   142k|         const W borrow = shift_right<1>(t);
  311|       |
  312|       |         // If value was odd, add (P/2)+1
  313|   142k|         const auto mask = CT::Mask<W>::expand(borrow).value();
  314|       |
  315|   142k|         W carry = 0;
  316|       |
  317|  1.28M|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (317:28): [True: 1.13M, False: 142k]
  ------------------
  318|  1.13M|            t[i] = word_add(t[i], INV_2[i] & mask, &carry);
  319|  1.13M|         }
  320|       |
  321|   142k|         return Self(t);
  322|   142k|      }
pcurves_numsp512d1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm6EED2Ev:
 1358|  1.23k|      ~BlindedScalarBits() {
 1359|  1.23k|         secure_zeroize_buffer(m_bytes.data(), m_bytes.size());
 1360|  1.23k|         CT::unpoison(m_bytes.data(), m_bytes.size());
 1361|  1.23k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_110numsp512d16ParamsENS5_13Numsp512d1RepEE12ScalarParamsEEEE7is_zeroEv:
  225|  1.24k|      constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); }
pcurves_numsp512d1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEeqERKSA_:
  722|  4.54k|      constexpr CT::Choice operator==(const Self& other) const {
  723|  4.54k|         return CT::is_equal(this->data(), other.data(), N).as_choice();
  724|  4.54k|      }
pcurves_numsp512d1.cpp:_ZN5Botan13EllipticCurveINS_6PCurve12_GLOBAL__N_110numsp512d16ParamsENS3_13Numsp512d1RepEE7x3_ax_bERKNS_6IntModINS5_INS6_11FieldParamsEEEEE:
 1275|  4.54k|      static constexpr FieldElement x3_ax_b(const FieldElement& x) { return (x.square() + A) * x + B; }
pcurves_numsp512d1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_110numsp512d16ParamsENS5_13Numsp512d1RepEE12ScalarParamsEEEE22from_wide_bytes_varlenENSt3__14spanIKhLm18446744073709551615EEE:
  829|    832|      static constexpr std::optional<Self> from_wide_bytes_varlen(std::span<const uint8_t> bytes) {
  830|       |         // Conditional ok: input length is public
  831|    832|         if(bytes.size() > 2 * Self::BYTES) {
  ------------------
  |  Branch (831:13): [True: 0, False: 832]
  ------------------
  832|      0|            return {};
  833|      0|         }
  834|       |
  835|    832|         std::array<uint8_t, 2 * Self::BYTES> padded_bytes = {};
  836|    832|         copy_mem(std::span{padded_bytes}.last(bytes.size()), bytes);
  837|    832|         return Self(Rep::wide_to_rep(bytes_to_words<W, 2 * N, 2 * BYTES>(std::span{padded_bytes})));
  838|    832|      }
pcurves_numsp512d1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE12serialize_toENSt3__14spanIhLm129EEE:
  941|  4.95k|      constexpr void serialize_to(std::span<uint8_t, Self::BYTES> bytes) const {
  942|  4.95k|         BOTAN_STATE_CHECK(this->is_identity().as_bool() == false);
  ------------------
  |  |   51|  4.95k|   do {                                                         \
  |  |   52|  4.95k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */             \
  |  |   53|  4.95k|      if(!(expr)) {                                             \
  |  |  ------------------
  |  |  |  Branch (53:10): [True: 0, False: 4.95k]
  |  |  ------------------
  |  |   54|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */    \
  |  |   55|      0|         Botan::throw_invalid_state(#expr, __func__, __FILE__); \
  |  |   56|      0|      }                                                         \
  |  |   57|  4.95k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (57:12): [Folded, False: 4.95k]
  |  |  ------------------
  ------------------
  943|  4.95k|         BufferStuffer pack(bytes);
  944|  4.95k|         pack.append(0x04);
  945|  4.95k|         x().serialize_to(pack.next<FieldElement::BYTES>());
  946|  4.95k|         y().serialize_to(pack.next<FieldElement::BYTES>());
  947|  4.95k|         BOTAN_DEBUG_ASSERT(pack.full());
  ------------------
  |  |  130|  4.95k|      do { /* NOLINT(*-avoid-do-while) */ \
  |  |  131|  4.95k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (131:15): [Folded, False: 4.95k]
  |  |  ------------------
  ------------------
  948|  4.95k|      }
pcurves_numsp512d1.cpp:_ZN5BotanplERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_110numsp512d16ParamsENS5_13Numsp512d1RepEE12ScalarParamsEEEEESD_:
  265|    416|      friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) {
  266|    416|         std::array<W, N> t;  // NOLINT(*-member-init)
  267|       |
  268|    416|         W carry = 0;
  269|  3.74k|         for(size_t i = 0; i != N; ++i) {
  ------------------
  |  Branch (269:28): [True: 3.32k, False: 416]
  ------------------
  270|  3.32k|            t[i] = word_add(a.m_val[i], b.m_val[i], &carry);
  271|  3.32k|         }
  272|       |
  273|    416|         std::array<W, N> r;  // NOLINT(*-member-init)
  274|    416|         bigint_monty_maybe_sub<N>(r.data(), carry, t.data(), P.data());
  275|    416|         return Self(r);
  276|    416|      }

_ZN5Botan12booth_recodeILm6ETkNSt3__117unsigned_integralEmEENS1_4pairImNS_2CT6ChoiceEEET0_:
  294|   120k|constexpr std::pair<size_t, CT::Choice> booth_recode(T x) {
  295|   120k|   static_assert(WindowBits >= 1 && WindowBits <= 8);
  296|       |
  297|   120k|   auto s_mask = CT::Mask<T>::expand(x >> WindowBits);
  298|   120k|   const T neg_x = (1 << (WindowBits + 1)) - x - 1;
  299|   120k|   T d = s_mask.select(neg_x, x);
  300|   120k|   d = (d >> 1) + (d & 1);
  301|       |
  302|   120k|   return std::make_pair(static_cast<size_t>(d), s_mask.as_choice());
  303|   120k|}
_ZN5Botan12booth_recodeILm5ETkNSt3__117unsigned_integralEmEENS1_4pairImNS_2CT6ChoiceEEET0_:
  294|   143k|constexpr std::pair<size_t, CT::Choice> booth_recode(T x) {
  295|   143k|   static_assert(WindowBits >= 1 && WindowBits <= 8);
  296|       |
  297|   143k|   auto s_mask = CT::Mask<T>::expand(x >> WindowBits);
  298|   143k|   const T neg_x = (1 << (WindowBits + 1)) - x - 1;
  299|   143k|   T d = s_mask.select(neg_x, x);
  300|   143k|   d = (d >> 1) + (d & 1);
  301|       |
  302|   143k|   return std::make_pair(static_cast<size_t>(d), s_mask.as_choice());
  303|   143k|}
pcurves_numsp512d1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm6EEENSt3__16vectorINT_11AffinePointENS5_9allocatorIS8_EEEERKS8_m:
  254|      1|std::vector<typename C::AffinePoint> basemul_booth_setup(const typename C::AffinePoint& p, size_t max_scalar_bits) {
  255|      1|   static_assert(WindowBits >= 1 && WindowBits <= 8);
  256|       |
  257|       |   // 2^(W-1) elements per window [1*base .. 2^(W-1)*base]
  258|      1|   constexpr size_t WindowElements = 1 << (WindowBits - 1);
  259|       |
  260|      1|   const size_t Windows = (max_scalar_bits + WindowBits - 1) / WindowBits;
  261|       |
  262|      1|   const size_t TableSize = Windows * WindowElements;
  263|       |
  264|      1|   std::vector<typename C::ProjectivePoint> table;
  265|      1|   table.reserve(TableSize);
  266|       |
  267|      1|   auto accum = C::ProjectivePoint::from_affine(p);
  268|       |
  269|     98|   for(size_t i = 0; i != TableSize; i += WindowElements) {
  ------------------
  |  Branch (269:22): [True: 97, False: 1]
  ------------------
  270|     97|      table.push_back(accum);
  271|       |
  272|  3.10k|      for(size_t j = 1; j != WindowElements; ++j) {
  ------------------
  |  Branch (272:25): [True: 3.00k, False: 97]
  ------------------
  273|       |         // Conditional ok: loop iteration count is public
  274|  3.00k|         if(j % 2 == 1) {
  ------------------
  |  Branch (274:13): [True: 1.55k, False: 1.45k]
  ------------------
  275|  1.55k|            table.emplace_back(table[i + j / 2].dbl());
  276|  1.55k|         } else {
  277|  1.45k|            table.emplace_back(table[i + j - 1] + table[i]);
  278|  1.45k|         }
  279|  3.00k|      }
  280|       |
  281|       |      // Advance to next window's base: 2^W * current_base
  282|       |      // The last entry is 2^(W-1) * base, so doubling gives 2^W * base
  283|     97|      accum = table[i + WindowElements - 1].dbl();
  284|     97|   }
  285|       |
  286|       |   // Variable time batch conversion is fine since generator is public
  287|      1|   return to_affine_batch<C, true>(table);
  288|      1|}
pcurves_numsp512d1.cpp:_ZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEEEENT_15ProjectivePointENSt3__14spanIKNS7_11AffinePointELm18446744073709551615EEERKT1_RNS_21RandomNumberGeneratorE:
  308|  1.23k|                                               RandomNumberGenerator& rng) {
  309|  1.23k|   static constexpr size_t WindowElements = 1 << (WindowBits - 1);
  310|       |
  311|  1.23k|   const size_t windows = (scalar.bits() + WindowBits) / WindowBits;
  312|       |
  313|  1.23k|   auto accum = [&]() {
  314|       |      // First window: extract W bits, shift left 1 to insert implicit carry in of zero
  315|  1.23k|      const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1);
  316|  1.23k|      const size_t raw = w_bits << 1;
  317|  1.23k|      const auto [tidx, tneg] = booth_recode<WindowBits>(raw);
  318|  1.23k|      const auto tbl_0 = table.first(WindowElements);
  319|       |
  320|  1.23k|      auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx));
  321|  1.23k|      pt.conditional_assign(tneg, pt.negate());
  322|  1.23k|      CT::poison(pt);
  323|  1.23k|      pt.randomize_rep(rng);
  324|  1.23k|      return pt;
  325|  1.23k|   }();
  326|       |
  327|   120k|   for(size_t i = 1; i != windows; ++i) {
  ------------------
  |  Branch (327:22): [True: 118k, False: 1.23k]
  ------------------
  328|       |      // Extract W+1 bits overlapping by 1 with the previous window
  329|   118k|      const size_t bit_pos = WindowBits * i - 1;
  330|   118k|      const size_t raw = scalar.get_window(bit_pos);
  331|   118k|      const auto [tidx, tneg] = booth_recode<WindowBits>(raw);
  332|       |
  333|   118k|      const auto tbl_i = table.subspan(WindowElements * i, WindowElements);
  334|       |
  335|   118k|      accum = C::ProjectivePoint::add_or_sub(accum, C::AffinePoint::ct_select(tbl_i, tidx), tneg);
  336|       |
  337|       |      // Conditional ok: loop iteration count is public
  338|   118k|      if(i <= 3) {
  ------------------
  |  Branch (338:10): [True: 3.71k, False: 115k]
  ------------------
  339|  3.71k|         accum.randomize_rep(rng);
  340|  3.71k|      }
  341|   118k|   }
  342|       |
  343|  1.23k|   CT::unpoison(accum);
  344|  1.23k|   return accum;
  345|  1.23k|}
pcurves_numsp512d1.cpp:_ZZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEEEENT_15ProjectivePointENSt3__14spanIKNS7_11AffinePointELm18446744073709551615EEERKT1_RNS_21RandomNumberGeneratorEENKUlvE_clEv:
  313|  1.23k|   auto accum = [&]() {
  314|       |      // First window: extract W bits, shift left 1 to insert implicit carry in of zero
  315|  1.23k|      const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1);
  316|  1.23k|      const size_t raw = w_bits << 1;
  317|  1.23k|      const auto [tidx, tneg] = booth_recode<WindowBits>(raw);
  318|  1.23k|      const auto tbl_0 = table.first(WindowElements);
  319|       |
  320|  1.23k|      auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx));
  321|  1.23k|      pt.conditional_assign(tneg, pt.negate());
  322|  1.23k|      CT::poison(pt);
  323|  1.23k|      pt.randomize_rep(rng);
  324|  1.23k|      return pt;
  325|  1.23k|   }();
pcurves_numsp512d1.cpp:_ZN5Botan14varpoint_setupINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm16EEENS_16AffinePointTableIT_Lm0EEERKNS6_11AffinePointE:
  351|  1.23k|AffinePointTable<C> varpoint_setup(const typename C::AffinePoint& p) {
  352|  1.23k|   static_assert(TableSize > 2);
  353|       |
  354|  1.23k|   std::vector<typename C::ProjectivePoint> table;
  355|  1.23k|   table.reserve(TableSize);
  356|  1.23k|   table.push_back(C::ProjectivePoint::from_affine(p));
  357|       |
  358|  19.8k|   for(size_t i = 1; i != TableSize; ++i) {
  ------------------
  |  Branch (358:22): [True: 18.5k, False: 1.23k]
  ------------------
  359|       |      // Conditional ok: loop iteration count is public
  360|  18.5k|      if(i % 2 == 1) {
  ------------------
  |  Branch (360:10): [True: 9.91k, False: 8.67k]
  ------------------
  361|  9.91k|         table.push_back(table[i / 2].dbl());
  362|  9.91k|      } else {
  363|  8.67k|         table.push_back(table[i - 1] + p);
  364|  8.67k|      }
  365|  18.5k|   }
  366|       |
  367|  1.23k|   return AffinePointTable<C>(table);
  368|  1.23k|}
pcurves_numsp512d1.cpp:_ZN5Botan16AffinePointTableINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm0EEC2ENSt3__14spanIKNS_20ProjectiveCurvePointINS_6IntModINS3_13Numsp512d1RepINS_13EllipticCurveINS3_6ParamsESA_E11FieldParamsEEEEESC_EELm18446744073709551615EEE:
   70|  1.23k|      explicit AffinePointTable(std::span<const ProjectivePoint> pts) {
   71|  1.23k|         BOTAN_ASSERT_NOMSG(pts.size() > 1);
  ------------------
  |  |   77|  1.23k|   do {                                                                     \
  |  |   78|  1.23k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|  1.23k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 1.23k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|  1.23k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1.23k]
  |  |  ------------------
  ------------------
   72|       |
   73|       |         if constexpr(R > 0) {
   74|       |            BOTAN_ASSERT_NOMSG(pts.size() % R == 0);
   75|       |         }
   76|       |
   77|       |         // TODO scatter/gather with SIMD lookup
   78|  1.23k|         m_table = to_affine_batch<C>(pts);
   79|  1.23k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan16AffinePointTableINS_6PCurve12_GLOBAL__N_110numsp512d15CurveELm0EE9ct_selectEmQL_ZNS_16AffinePointTable16WholeRangeSearchEE:
   86|   143k|      {
   87|   143k|         BOTAN_DEBUG_ASSERT(idx < m_table.size() + 1);
  ------------------
  |  |  130|   143k|      do { /* NOLINT(*-avoid-do-while) */ \
  |  |  131|   143k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (131:15): [Folded, False: 143k]
  |  |  ------------------
  ------------------
   88|       |
   89|   143k|         auto result = AffinePoint::identity(m_table[0]);
   90|       |
   91|       |         // Intentionally wrapping; set to maximum size_t if idx == 0
   92|   143k|         const size_t idx1 = static_cast<size_t>(idx - 1);
   93|  2.44M|         for(size_t i = 0; i != m_table.size(); ++i) {
  ------------------
  |  Branch (93:28): [True: 2.29M, False: 143k]
  ------------------
   94|  2.29M|            const auto found = CT::Mask<size_t>::is_equal(idx1, i).as_choice();
   95|  2.29M|            result.conditional_assign(found, m_table[i]);
   96|  2.29M|         }
   97|       |
   98|   143k|         return result;
   99|   143k|      }

_ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm8ELm64EEEDaNSt3__14spanIKhXT1_EEE:
  287|  10.7k|inline constexpr auto bytes_to_words(std::span<const uint8_t, L> bytes) {
  288|  10.7k|   static_assert(L <= WordInfo<W>::bytes * N);
  289|       |
  290|  10.7k|   std::array<W, N> r = {};
  291|       |
  292|  10.7k|   constexpr size_t full_words = L / WordInfo<W>::bytes;
  293|  10.7k|   constexpr size_t extra_bytes = L % WordInfo<W>::bytes;
  294|       |
  295|  10.7k|   static_assert(full_words + (extra_bytes ? 1 : 0) <= N);
  296|       |
  297|  96.6k|   for(size_t i = 0; i != full_words; ++i) {
  ------------------
  |  Branch (297:22): [True: 85.9k, False: 10.7k]
  ------------------
  298|  85.9k|      r[i] = load_be<W>(bytes.data(), full_words - 1 - i);
  299|  85.9k|   }
  300|       |
  301|       |   if constexpr(extra_bytes > 0) {
  302|       |      constexpr size_t shift = extra_bytes * 8;
  303|       |      shift_left<shift>(r);
  304|       |
  305|       |      for(size_t i = 0; i != extra_bytes; ++i) {
  306|       |         const W b0 = bytes[WordInfo<W>::bytes * full_words + i];
  307|       |         r[0] |= (b0 << (8 * (extra_bytes - 1 - i)));
  308|       |      }
  309|       |   }
  310|       |
  311|  10.7k|   return r;
  312|  10.7k|}
_ZN5Botan10monty_redcITkNS_8WordTypeEmLm8EEENSt3__15arrayIT_XT0_EEERKNS2_IS3_XmlLi2ET0_EEERKS4_S3_:
  110|  4.14k|   -> std::array<W, N> {
  111|  4.14k|   static_assert(N >= 1);
  112|       |
  113|  4.14k|   std::array<W, N> ws;  // NOLINT(*-member-init)
  114|  4.14k|   std::array<W, N> r;   // NOLINT(*-member-init)
  115|       |
  116|       |   // Conditional ok: the parameter size is public
  117|  4.14k|   if(!std::is_constant_evaluated()) {
  ------------------
  |  Branch (117:7): [True: 4.14k, Folded]
  ------------------
  118|       |      // This range ensures we cover fields of 256, 384 and 512 bits for both 32 and 64 bit words
  119|       |      if constexpr(N == 4) {
  120|       |         bigint_monty_redc_4(r.data(), z.data(), p.data(), p_dash, ws.data());
  121|       |         return r;
  122|       |      } else if constexpr(N == 6) {
  123|       |         bigint_monty_redc_6(r.data(), z.data(), p.data(), p_dash, ws.data());
  124|       |         return r;
  125|  4.14k|      } else if constexpr(N == 8) {
  126|  4.14k|         bigint_monty_redc_8(r.data(), z.data(), p.data(), p_dash, ws.data());
  127|  4.14k|         return r;
  128|       |      } else if constexpr(N == 12) {
  129|       |         bigint_monty_redc_12(r.data(), z.data(), p.data(), p_dash, ws.data());
  130|       |         return r;
  131|       |      } else if constexpr(N == 16) {
  132|       |         bigint_monty_redc_16(r.data(), z.data(), p.data(), p_dash, ws.data());
  133|       |         return r;
  134|       |      }
  135|  4.14k|   }
  136|       |
  137|      0|   word3<W> accum;
  138|       |
  139|  4.14k|   accum.add(z[0]);
  140|       |
  141|  4.14k|   ws[0] = accum.monty_step(p[0], p_dash);
  142|       |
  143|  4.14k|   for(size_t i = 1; i != N; ++i) {
  ------------------
  |  Branch (143:22): [True: 0, False: 4.14k]
  ------------------
  144|      0|      for(size_t j = 0; j < i; ++j) {
  ------------------
  |  Branch (144:25): [True: 0, False: 0]
  ------------------
  145|      0|         accum.mul(ws[j], p[i - j]);
  146|      0|      }
  147|       |
  148|      0|      accum.add(z[i]);
  149|       |
  150|      0|      ws[i] = accum.monty_step(p[0], p_dash);
  151|      0|   }
  152|       |
  153|  4.14k|   for(size_t i = 0; i != N - 1; ++i) {
  ------------------
  |  Branch (153:22): [True: 0, False: 4.14k]
  ------------------
  154|      0|      for(size_t j = i + 1; j != N; ++j) {
  ------------------
  |  Branch (154:29): [True: 0, False: 0]
  ------------------
  155|      0|         accum.mul(ws[j], p[N + i - j]);
  156|      0|      }
  157|       |
  158|      0|      accum.add(z[N + i]);
  159|       |
  160|      0|      ws[i] = accum.extract();
  161|      0|   }
  162|       |
  163|  4.14k|   accum.add(z[2 * N - 1]);
  164|       |
  165|  4.14k|   ws[N - 1] = accum.extract();
  166|       |   // w1 is the final part, which is not stored in the workspace
  167|  4.14k|   const W w1 = accum.extract();
  168|       |
  169|  4.14k|   bigint_monty_maybe_sub<N>(r.data(), w1, ws.data(), p.data());
  170|       |
  171|  4.14k|   return r;
  172|  4.14k|}
_ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm16ELm128EEEDaNSt3__14spanIKhXT1_EEE:
  287|    832|inline constexpr auto bytes_to_words(std::span<const uint8_t, L> bytes) {
  288|    832|   static_assert(L <= WordInfo<W>::bytes * N);
  289|       |
  290|    832|   std::array<W, N> r = {};
  291|       |
  292|    832|   constexpr size_t full_words = L / WordInfo<W>::bytes;
  293|    832|   constexpr size_t extra_bytes = L % WordInfo<W>::bytes;
  294|       |
  295|    832|   static_assert(full_words + (extra_bytes ? 1 : 0) <= N);
  296|       |
  297|  14.1k|   for(size_t i = 0; i != full_words; ++i) {
  ------------------
  |  Branch (297:22): [True: 13.3k, False: 832]
  ------------------
  298|  13.3k|      r[i] = load_be<W>(bytes.data(), full_words - 1 - i);
  299|  13.3k|   }
  300|       |
  301|       |   if constexpr(extra_bytes > 0) {
  302|       |      constexpr size_t shift = extra_bytes * 8;
  303|       |      shift_left<shift>(r);
  304|       |
  305|       |      for(size_t i = 0; i != extra_bytes; ++i) {
  306|       |         const W b0 = bytes[WordInfo<W>::bytes * full_words + i];
  307|       |         r[0] |= (b0 << (8 * (extra_bytes - 1 - i)));
  308|       |      }
  309|       |   }
  310|       |
  311|    832|   return r;
  312|    832|}

pcurves_numsp512d1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE8instanceEv:
  338|  33.0k|      static std::shared_ptr<const PrimeOrderCurve> instance() {
  339|  33.0k|         static auto g_curve = std::make_shared<const PrimeOrderCurveImpl<C>>();
  340|  33.0k|         return g_curve;
  341|  33.0k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEEC2Ev:
  336|      1|      PrimeOrderCurveImpl() : m_mul_by_g(C::G) {}
pcurves_numsp512d1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE19field_element_bytesEv:
   36|  11.5k|      size_t field_element_bytes() const override { return C::FieldElement::BYTES; }
pcurves_numsp512d1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE8mul_by_gERKNS0_15PrimeOrderCurve6ScalarERNS_21RandomNumberGeneratorE:
   38|  1.23k|      ProjectivePoint mul_by_g(const Scalar& scalar, RandomNumberGenerator& rng) const override {
   39|  1.23k|         return stash(m_mul_by_g.mul(from_stash(scalar), rng));
   40|  1.23k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE5stashERKNS_20ProjectiveCurvePointINS_6IntModINS3_13Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EE:
  370|  4.13k|      static ProjectivePoint stash(const typename C::ProjectivePoint& pt) {
  371|  4.13k|         auto x_w = pt.x().template stash_value<StorageWords>();
  372|  4.13k|         auto y_w = pt.y().template stash_value<StorageWords>();
  373|  4.13k|         auto z_w = pt.z().template stash_value<StorageWords>();
  374|  4.13k|         return ProjectivePoint::_create(instance(), x_w, y_w, z_w);
  375|  4.13k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE10from_stashERKNS0_15PrimeOrderCurve6ScalarE:
  348|  4.55k|      static typename C::Scalar from_stash(const Scalar& s) {
  349|  4.55k|         if(s._curve() != instance()) {
  ------------------
  |  Branch (349:13): [True: 0, False: 4.55k]
  ------------------
  350|      0|            throw Invalid_Argument("Curve mismatch");
  351|      0|         }
  352|  4.55k|         return C::Scalar::from_stash(s._value());
  353|  4.55k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE5stashERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_13Numsp512d1RepEE12ScalarParamsEEEEE:
  344|  1.24k|      static Scalar stash(const typename C::Scalar& s) {
  345|  1.24k|         return Scalar::_create(instance(), s.template stash_value<StorageWords>());
  346|  1.24k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE3mulERKNS0_15PrimeOrderCurve11AffinePointERKNS6_6ScalarERNS_21RandomNumberGeneratorE:
   42|  1.23k|      ProjectivePoint mul(const AffinePoint& pt, const Scalar& scalar, RandomNumberGenerator& rng) const override {
   43|  1.23k|         auto tbl = WindowedBoothMulTable<C, VarPointWindowBits>(from_stash(pt));
   44|  1.23k|         return stash(tbl.mul(from_stash(scalar), rng));
   45|  1.23k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE10from_stashERKNS0_15PrimeOrderCurve11AffinePointE:
  361|  14.4k|      static typename C::AffinePoint from_stash(const AffinePoint& pt) {
  362|  14.4k|         if(pt._curve() != instance()) {
  ------------------
  |  Branch (362:13): [True: 0, False: 14.4k]
  ------------------
  363|      0|            throw Invalid_Argument("Curve mismatch");
  364|      0|         }
  365|  14.4k|         auto x = C::FieldElement::from_stash(pt._x());
  366|  14.4k|         auto y = C::FieldElement::from_stash(pt._y());
  367|  14.4k|         return typename C::AffinePoint(x, y);
  368|  14.4k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE5stashERKNS_16AffineCurvePointINS_6IntModINS3_13Numsp512d1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE:
  355|  4.54k|      static AffinePoint stash(const typename C::AffinePoint& pt) {
  356|  4.54k|         auto x_w = pt.x().template stash_value<StorageWords>();
  357|  4.54k|         auto y_w = pt.y().template stash_value<StorageWords>();
  358|  4.54k|         return AffinePoint::_create(instance(), x_w, y_w);
  359|  4.54k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE17deserialize_pointENSt3__14spanIKhLm18446744073709551615EEE:
  242|    413|      std::optional<AffinePoint> deserialize_point(std::span<const uint8_t> bytes) const override {
  243|       |         // The identity element (see SEC1 section 2.3.4)
  244|       |         // TODO(Botan4) remove this - we should reject the identity encoding
  245|    413|         if(bytes.size() == 1 && bytes[0] == 0x00) {
  ------------------
  |  Branch (245:13): [True: 0, False: 413]
  |  Branch (245:34): [True: 0, False: 0]
  ------------------
  246|      0|            return stash(C::AffinePoint::identity());
  247|      0|         }
  248|       |
  249|    413|         constexpr size_t FieldElementBytes = C::FieldElement::BYTES;
  250|    413|         constexpr size_t CompressedBytes = C::FieldElement::BYTES + 1;
  251|    413|         constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1;
  252|       |
  253|    413|         if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) {
  ------------------
  |  Branch (253:13): [True: 413, False: 0]
  |  Branch (253:50): [True: 413, False: 0]
  ------------------
  254|    413|            const auto encoded_point = bytes.subspan(1);
  255|    413|            auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes));
  256|    413|            auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes));
  257|       |
  258|    413|            if(x && y) {
  ------------------
  |  Branch (258:16): [True: 413, False: 0]
  |  Branch (258:21): [True: 413, False: 0]
  ------------------
  259|       |               // Check that y^2 = x^3 + ax + b
  260|    413|               const auto lhs = (*y).square();
  261|    413|               const auto rhs = C::x3_ax_b(*x);
  262|    413|               const auto valid = (lhs == rhs);
  263|    413|               if(valid.as_bool()) {
  ------------------
  |  Branch (263:19): [True: 413, False: 0]
  ------------------
  264|    413|                  return stash(typename C::AffinePoint(*x, *y));
  265|    413|               }
  266|    413|            }
  267|    413|         } else if(bytes.size() == CompressedBytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) {
  ------------------
  |  Branch (267:20): [True: 0, False: 0]
  |  Branch (267:56): [True: 0, False: 0]
  |  Branch (267:76): [True: 0, False: 0]
  ------------------
  268|      0|            const CT::Choice y_is_even = CT::Mask<uint8_t>::is_equal(bytes[0], 0x02).as_choice();
  269|       |
  270|      0|            if(auto x = C::FieldElement::deserialize(bytes.subspan(1, FieldElementBytes))) {
  ------------------
  |  Branch (270:21): [True: 0, False: 0]
  ------------------
  271|      0|               if(auto y = sqrt_field_element<C>(C::x3_ax_b(*x)).as_optional_vartime()) {
  ------------------
  |  Branch (271:24): [True: 0, False: 0]
  ------------------
  272|      0|                  return stash(typename C::AffinePoint(*x, y->correct_sign(y_is_even)));
  273|      0|               }
  274|      0|            }
  275|      0|         }
  276|       |
  277|      0|         return {};
  278|    413|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE22scalar_from_wide_bytesENSt3__14spanIKhLm18446744073709551615EEE:
  234|    832|      std::optional<Scalar> scalar_from_wide_bytes(std::span<const uint8_t> bytes) const override {
  235|    832|         if(auto s = C::Scalar::from_wide_bytes_varlen(bytes)) {
  ------------------
  |  Branch (235:18): [True: 832, False: 0]
  ------------------
  236|    832|            return stash(*s);
  237|    832|         } else {
  238|      0|            return {};
  239|      0|         }
  240|    832|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE15point_to_affineERKNS0_15PrimeOrderCurve15ProjectivePointE:
  192|  4.13k|      AffinePoint point_to_affine(const ProjectivePoint& pt) const override {
  193|  4.13k|         auto affine = to_affine<C>(from_stash(pt));
  194|       |
  195|  4.13k|         const auto y2 = affine.y().square();
  196|  4.13k|         const auto x3_ax_b = C::x3_ax_b(affine.x());
  197|  4.13k|         const auto valid_point = affine.is_identity() || (y2 == x3_ax_b);
  198|       |
  199|  4.13k|         BOTAN_ASSERT(valid_point.as_bool(), "Computed point is on the curve");
  ------------------
  |  |   64|  4.13k|   do {                                                                                 \
  |  |   65|  4.13k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                     \
  |  |   66|  4.13k|      if(!(expr)) {                                                                     \
  |  |  ------------------
  |  |  |  Branch (66:10): [True: 0, False: 4.13k]
  |  |  ------------------
  |  |   67|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                            \
  |  |   68|      0|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   69|      0|      }                                                                                 \
  |  |   70|  4.13k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (70:12): [Folded, False: 4.13k]
  |  |  ------------------
  ------------------
  200|       |
  201|  4.13k|         return stash(affine);
  202|  4.13k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE10from_stashERKNS0_15PrimeOrderCurve15ProjectivePointE:
  377|  4.13k|      static typename C::ProjectivePoint from_stash(const ProjectivePoint& pt) {
  378|  4.13k|         if(pt._curve() != instance()) {
  ------------------
  |  Branch (378:13): [True: 0, False: 4.13k]
  ------------------
  379|      0|            throw Invalid_Argument("Curve mismatch");
  380|      0|         }
  381|  4.13k|         auto x = C::FieldElement::from_stash(pt._x());
  382|  4.13k|         auto y = C::FieldElement::from_stash(pt._y());
  383|  4.13k|         auto z = C::FieldElement::from_stash(pt._z());
  384|  4.13k|         return typename C::ProjectivePoint(x, y, z);
  385|  4.13k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE24affine_point_is_identityERKNS0_15PrimeOrderCurve11AffinePointE:
  210|  4.95k|      bool affine_point_is_identity(const AffinePoint& pt) const override {
  211|  4.95k|         return from_stash(pt).is_identity().as_bool();
  212|  4.95k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE9point_addERKNS0_15PrimeOrderCurve11AffinePointES9_:
  204|  1.65k|      ProjectivePoint point_add(const AffinePoint& a, const AffinePoint& b) const override {
  205|  1.65k|         return stash(C::ProjectivePoint::from_affine(from_stash(a)) + from_stash(b));
  206|  1.65k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE15serialize_pointENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve11AffinePointE:
  214|  4.95k|      void serialize_point(std::span<uint8_t> bytes, const AffinePoint& pt) const override {
  215|  4.95k|         BOTAN_ARG_CHECK(bytes.size() == C::AffinePoint::BYTES, "Invalid length for serialize_point");
  ------------------
  |  |   35|  4.95k|   do {                                                          \
  |  |   36|  4.95k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|  4.95k|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 4.95k]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|  4.95k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 4.95k]
  |  |  ------------------
  ------------------
  216|  4.95k|         from_stash(pt).serialize_to(bytes.subspan<0, C::AffinePoint::BYTES>());
  217|  4.95k|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE10scalar_addERKNS0_15PrimeOrderCurve6ScalarES9_:
  296|    416|      Scalar scalar_add(const Scalar& a, const Scalar& b) const override {
  297|    416|         return stash(from_stash(a) + from_stash(b));
  298|    416|      }
pcurves_numsp512d1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_110numsp512d15CurveEE14scalar_is_zeroERKNS0_15PrimeOrderCurve6ScalarE:
  326|  1.24k|      bool scalar_is_zero(const Scalar& s) const override { return from_stash(s).is_zero().as_bool(); }

_ZN5Botan8round_upEmm:
   26|    832|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|    832|   BOTAN_ARG_CHECK(align_to != 0, "align_to must not be 0");
  ------------------
  |  |   35|    832|   do {                                                          \
  |  |   36|    832|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|    832|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 832]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|    832|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 832]
  |  |  ------------------
  ------------------
   29|       |
   30|    832|   if(n % align_to > 0) {
  ------------------
  |  Branch (30:7): [True: 828, False: 4]
  ------------------
   31|    828|      const size_t adj = align_to - (n % align_to);
   32|    828|      BOTAN_ARG_CHECK(n + adj >= n, "Integer overflow during rounding");
  ------------------
  |  |   35|    828|   do {                                                          \
  |  |   36|    828|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|    828|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 828]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|    828|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 828]
  |  |  ------------------
  ------------------
   33|    828|      n += adj;
   34|    828|   }
   35|    832|   return n;
   36|    832|}

_ZNK5Botan9SCAN_Name9algo_nameEv:
   44|      7|      const std::string& algo_name() const { return m_alg_name; }
_ZNK5Botan9SCAN_Name9arg_countEv:
   49|      3|      size_t arg_count() const { return m_args.size(); }

_ZNK5Botan7SHA_25613output_lengthEv:
   75|      5|      size_t output_length() const override { return output_bytes; }
_ZNK5Botan7SHA_25615hash_block_sizeEv:
   77|      1|      size_t hash_block_size() const override { return block_bytes; }
_ZN5Botan7SHA_2565clearEv:
   83|      2|      void clear() override { m_md.clear(); }

_ZNK5Botan9SIMD_4x323rawEv:
  942|  2.06k|      native_simd_type BOTAN_FN_ISA_SIMD_4X32 raw() const noexcept { return m_simd; }
_ZN5Botan9SIMD_4x32C2EDv2_x:
  944|  1.20k|      explicit BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32(native_simd_type x) noexcept : m_simd(x) {}
_ZN5Botan9SIMD_4x327load_leEPKv:
  162|    220|      static SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 load_le(const void* in) noexcept {
  163|    220|#if defined(BOTAN_SIMD_USE_SSSE3)
  164|    220|         return SIMD_4x32(_mm_loadu_si128(reinterpret_cast<const __m128i*>(in)));
  165|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  166|       |         uint32_t R0 = Botan::load_le<uint32_t>(reinterpret_cast<const uint8_t*>(in), 0);
  167|       |         uint32_t R1 = Botan::load_le<uint32_t>(reinterpret_cast<const uint8_t*>(in), 1);
  168|       |         uint32_t R2 = Botan::load_le<uint32_t>(reinterpret_cast<const uint8_t*>(in), 2);
  169|       |         uint32_t R3 = Botan::load_le<uint32_t>(reinterpret_cast<const uint8_t*>(in), 3);
  170|       |         __vector unsigned int val = {R0, R1, R2, R3};
  171|       |         return SIMD_4x32(val);
  172|       |#elif defined(BOTAN_SIMD_USE_NEON)
  173|       |         SIMD_4x32 l(vld1q_u32(static_cast<const uint32_t*>(in)));
  174|       |         if constexpr(std::endian::native == std::endian::big) {
  175|       |            return l.bswap();
  176|       |         } else {
  177|       |            return l;
  178|       |         }
  179|       |#elif defined(BOTAN_SIMD_USE_LSX)
  180|       |         return SIMD_4x32(__lsx_vld(in, 0));
  181|       |#elif defined(BOTAN_SIMD_USE_SIMD128)
  182|       |         return SIMD_4x32(wasm_v128_load(in));
  183|       |#endif
  184|    220|      }
_ZNK5Botan9SIMD_4x328store_leEPh:
  234|     20|      void BOTAN_FN_ISA_SIMD_4X32 store_le(uint8_t out[]) const noexcept {
  235|     20|#if defined(BOTAN_SIMD_USE_SSSE3)
  236|       |
  237|     20|         _mm_storeu_si128(reinterpret_cast<__m128i*>(out), raw());
  238|       |
  239|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  240|       |
  241|       |         union {
  242|       |               __vector unsigned int V;
  243|       |               uint32_t R[4];
  244|       |         } vec{};
  245|       |
  246|       |         // NOLINTNEXTLINE(*-union-access)
  247|       |         vec.V = raw();
  248|       |         // NOLINTNEXTLINE(*-union-access)
  249|       |         Botan::store_le(out, vec.R[0], vec.R[1], vec.R[2], vec.R[3]);
  250|       |
  251|       |#elif defined(BOTAN_SIMD_USE_NEON)
  252|       |         if constexpr(std::endian::native == std::endian::little) {
  253|       |            vst1q_u8(out, vreinterpretq_u8_u32(m_simd));
  254|       |         } else {
  255|       |            vst1q_u8(out, vreinterpretq_u8_u32(bswap().m_simd));
  256|       |         }
  257|       |#elif defined(BOTAN_SIMD_USE_LSX)
  258|       |         __lsx_vst(raw(), out, 0);
  259|       |#elif defined(BOTAN_SIMD_USE_SIMD128)
  260|       |         wasm_v128_store(out, m_simd);
  261|       |#endif
  262|     20|      }
_ZN5Botan9SIMD_4x327load_beEPKv:
  189|     40|      static SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 load_be(const void* in) noexcept {
  190|     40|#if defined(BOTAN_SIMD_USE_SSSE3) || defined(BOTAN_SIMD_USE_LSX) || defined(BOTAN_SIMD_USE_SIMD128)
  191|     40|         return load_le(in).bswap();
  192|       |
  193|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  194|       |         uint32_t R0 = Botan::load_be<uint32_t>(reinterpret_cast<const uint8_t*>(in), 0);
  195|       |         uint32_t R1 = Botan::load_be<uint32_t>(reinterpret_cast<const uint8_t*>(in), 1);
  196|       |         uint32_t R2 = Botan::load_be<uint32_t>(reinterpret_cast<const uint8_t*>(in), 2);
  197|       |         uint32_t R3 = Botan::load_be<uint32_t>(reinterpret_cast<const uint8_t*>(in), 3);
  198|       |         __vector unsigned int val = {R0, R1, R2, R3};
  199|       |         return SIMD_4x32(val);
  200|       |
  201|       |#elif defined(BOTAN_SIMD_USE_NEON)
  202|       |         SIMD_4x32 l(vld1q_u32(static_cast<const uint32_t*>(in)));
  203|       |         if constexpr(std::endian::native == std::endian::little) {
  204|       |            return l.bswap();
  205|       |         } else {
  206|       |            return l;
  207|       |         }
  208|       |#endif
  209|     40|      }
_ZNK5Botan9SIMD_4x328store_leEPj:
  219|     20|      void BOTAN_FN_ISA_SIMD_4X32 store_le(uint32_t out[4]) const noexcept {
  220|     20|         this->store_le(reinterpret_cast<uint8_t*>(out));
  221|     20|      }
_ZNK5Botan9SIMD_4x32plERKS0_:
  385|    160|      SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 operator+(const SIMD_4x32& other) const noexcept {
  386|    160|         SIMD_4x32 retval(*this);
  387|    160|         retval += other;
  388|    160|         return retval;
  389|    160|      }
_ZN5Botan9SIMD_4x32pLERKS0_:
  427|    300|      void BOTAN_FN_ISA_SIMD_4X32 operator+=(const SIMD_4x32& other) noexcept {
  428|    300|#if defined(BOTAN_SIMD_USE_SSSE3)
  429|    300|         m_simd = _mm_add_epi32(m_simd, other.m_simd);
  430|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  431|       |         m_simd = vec_add(m_simd, other.m_simd);
  432|       |#elif defined(BOTAN_SIMD_USE_NEON)
  433|       |         m_simd = vaddq_u32(m_simd, other.m_simd);
  434|       |#elif defined(BOTAN_SIMD_USE_LSX)
  435|       |         m_simd = __lsx_vadd_w(m_simd, other.m_simd);
  436|       |#elif defined(BOTAN_SIMD_USE_SIMD128)
  437|       |         m_simd = wasm_i32x4_add(m_simd, other.m_simd);
  438|       |#endif
  439|    300|      }
_ZNK5Botan9SIMD_4x325bswapEv:
  576|     40|      BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32 bswap() const noexcept {
  577|     40|#if defined(BOTAN_SIMD_USE_SSSE3)
  578|     40|         const auto idx = _mm_set_epi8(12, 13, 14, 15, 8, 9, 10, 11, 4, 5, 6, 7, 0, 1, 2, 3);
  579|       |
  580|     40|         return SIMD_4x32(_mm_shuffle_epi8(raw(), idx));
  581|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  582|       |   #ifdef BOTAN_SIMD_USE_VSX
  583|       |         return SIMD_4x32(vec_revb(m_simd));
  584|       |   #else
  585|       |         const __vector unsigned char rev[1] = {
  586|       |            {3, 2, 1, 0, 7, 6, 5, 4, 11, 10, 9, 8, 15, 14, 13, 12},
  587|       |         };
  588|       |
  589|       |         return SIMD_4x32(vec_perm(m_simd, m_simd, rev[0]));
  590|       |   #endif
  591|       |
  592|       |#elif defined(BOTAN_SIMD_USE_NEON)
  593|       |         return SIMD_4x32(vreinterpretq_u32_u8(vrev32q_u8(vreinterpretq_u8_u32(m_simd))));
  594|       |#elif defined(BOTAN_SIMD_USE_LSX)
  595|       |         return SIMD_4x32(__lsx_vshuf4i_b(m_simd, 0b00011011));
  596|       |#elif defined(BOTAN_SIMD_USE_SIMD128)
  597|       |         return SIMD_4x32(wasm_i8x16_shuffle(m_simd, m_simd, 3, 2, 1, 0, 7, 6, 5, 4, 11, 10, 9, 8, 15, 14, 13, 12));
  598|       |#endif
  599|     40|      }
_ZN5Botan9SIMD_4x327alignr4ERKS0_S2_:
  869|    120|      static inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 alignr4(const SIMD_4x32& a, const SIMD_4x32& b) {
  870|    120|#if defined(BOTAN_SIMD_USE_SSSE3)
  871|    120|         return SIMD_4x32(_mm_alignr_epi8(a.raw(), b.raw(), 4));
  872|       |#elif defined(BOTAN_SIMD_USE_NEON)
  873|       |         return SIMD_4x32(vextq_u32(b.raw(), a.raw(), 1));
  874|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  875|       |         const __vector unsigned char mask = {4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19};
  876|       |         return SIMD_4x32(vec_perm(b.raw(), a.raw(), mask));
  877|       |#elif defined(BOTAN_SIMD_USE_LSX)
  878|       |         const auto mask = SIMD_4x32(0x07060504, 0x0B0A0908, 0x0F0E0D0C, 0x13121110);
  879|       |         return SIMD_4x32(__lsx_vshuf_b(a.raw(), b.raw(), mask.raw()));
  880|       |#elif defined(BOTAN_SIMD_USE_SIMD128)
  881|       |         return SIMD_4x32(
  882|       |            wasm_i8x16_shuffle(b.raw(), a.raw(), 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19));
  883|       |#endif
  884|    120|      }
_ZN5Botan9SIMD_4x327alignr8ERKS0_S2_:
  886|     20|      static inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 alignr8(const SIMD_4x32& a, const SIMD_4x32& b) {
  887|     20|#if defined(BOTAN_SIMD_USE_SSSE3)
  888|     20|         return SIMD_4x32(_mm_alignr_epi8(a.raw(), b.raw(), 8));
  889|       |#elif defined(BOTAN_SIMD_USE_NEON)
  890|       |         return SIMD_4x32(vextq_u32(b.raw(), a.raw(), 2));
  891|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  892|       |         const __vector unsigned char mask = {8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23};
  893|       |         return SIMD_4x32(vec_perm(b.raw(), a.raw(), mask));
  894|       |#elif defined(BOTAN_SIMD_USE_LSX)
  895|       |         return SIMD_4x32(__lsx_vshuf4i_d(a.raw(), b.raw(), 0b0011));
  896|       |#elif defined(BOTAN_SIMD_USE_SIMD128)
  897|       |         return SIMD_4x32(
  898|       |            wasm_i8x16_shuffle(b.raw(), a.raw(), 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23));
  899|       |#endif
  900|     20|      }
_ZNK5Botan9SIMD_4x3217shift_elems_rightILm2EEES0_vQleT_Li3E:
  641|    160|      {
  642|    160|#if defined(BOTAN_SIMD_USE_SSSE3)
  643|    160|         return SIMD_4x32(_mm_srli_si128(raw(), 4 * I));
  644|       |#elif defined(BOTAN_SIMD_USE_NEON)
  645|       |         return SIMD_4x32(vextq_u32(raw(), vdupq_n_u32(0), I));
  646|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  647|       |         const __vector unsigned int zero = vec_splat_u32(0);
  648|       |
  649|       |         const __vector unsigned char shuf[3] = {
  650|       |            {4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19},
  651|       |            {8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23},
  652|       |            {12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27},
  653|       |         };
  654|       |
  655|       |         return SIMD_4x32(vec_perm(raw(), zero, shuf[I - 1]));
  656|       |#elif defined(BOTAN_SIMD_USE_LSX)
  657|       |         return SIMD_4x32(__lsx_vbsrl_v(raw(), 4 * I));
  658|       |#elif defined(BOTAN_SIMD_USE_SIMD128)
  659|       |         if constexpr(I == 0) {
  660|       |            return SIMD_4x32(m_simd);
  661|       |         }
  662|       |
  663|       |         const auto zero = wasm_u32x4_const_splat(0);
  664|       |         if constexpr(I == 1) {
  665|       |            return SIMD_4x32(
  666|       |               wasm_i8x16_shuffle(m_simd, zero, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 16, 16, 16));
  667|       |         }
  668|       |         if constexpr(I == 2) {
  669|       |            return SIMD_4x32(
  670|       |               wasm_i8x16_shuffle(m_simd, zero, 8, 9, 10, 11, 12, 13, 14, 15, 16, 16, 16, 16, 16, 16, 16, 16));
  671|       |         }
  672|       |
  673|       |         return SIMD_4x32(
  674|       |            wasm_i8x16_shuffle(m_simd, zero, 12, 13, 14, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16));
  675|       |#endif
  676|    160|      }

_ZN5Botan9SIMD_8x32C2Ejjjjjjjj:
   46|  2.55k|                         uint32_t B7) noexcept {
   47|       |         // NOLINTNEXTLINE(*-prefer-member-initializer)
   48|  2.55k|         m_avx2 = _mm256_set_epi32(B7, B6, B5, B4, B3, B2, B1, B0);
   49|  2.55k|      }
_ZN5Botan9SIMD_8x325splatEj:
   58|  40.9k|      static SIMD_8x32 splat(uint32_t B) noexcept { return SIMD_8x32(_mm256_set1_epi32(B)); }
_ZNK5Botan9SIMD_8x328store_leEPh:
   84|  20.4k|      void store_le(uint8_t out[]) const noexcept { _mm256_storeu_si256(reinterpret_cast<__m256i*>(out), m_avx2); }
_ZNK5Botan9SIMD_8x32plERKS0_:
  164|  5.11k|      SIMD_8x32 operator+(const SIMD_8x32& other) const noexcept {
  165|  5.11k|         SIMD_8x32 retval(*this);
  166|  5.11k|         retval += other;
  167|  5.11k|         return retval;
  168|  5.11k|      }
_ZN5Botan9SIMD_8x32pLERKS0_:
  199|   434k|      void operator+=(const SIMD_8x32& other) { m_avx2 = _mm256_add_epi32(m_avx2, other.m_avx2); }
_ZN5Botan9SIMD_8x32eOERKS0_:
  205|   409k|      void operator^=(const SIMD_8x32& other) { m_avx2 = _mm256_xor_si256(m_avx2, other.m_avx2); }
_ZN5Botan9SIMD_8x329transposeERS0_S1_S1_S1_:
  264|  5.11k|      static void transpose(SIMD_8x32& B0, SIMD_8x32& B1, SIMD_8x32& B2, SIMD_8x32& B3) noexcept {
  265|  5.11k|         const __m256i T0 = _mm256_unpacklo_epi32(B0.m_avx2, B1.m_avx2);
  266|  5.11k|         const __m256i T1 = _mm256_unpacklo_epi32(B2.m_avx2, B3.m_avx2);
  267|  5.11k|         const __m256i T2 = _mm256_unpackhi_epi32(B0.m_avx2, B1.m_avx2);
  268|  5.11k|         const __m256i T3 = _mm256_unpackhi_epi32(B2.m_avx2, B3.m_avx2);
  269|       |
  270|  5.11k|         B0.m_avx2 = _mm256_unpacklo_epi64(T0, T1);
  271|  5.11k|         B1.m_avx2 = _mm256_unpackhi_epi64(T0, T1);
  272|  5.11k|         B2.m_avx2 = _mm256_unpacklo_epi64(T2, T3);
  273|  5.11k|         B3.m_avx2 = _mm256_unpackhi_epi64(T2, T3);
  274|  5.11k|      }
_ZN5Botan9SIMD_8x329transposeERS0_S1_S1_S1_S1_S1_S1_S1_:
  302|  2.55k|                            SIMD_8x32& B7) noexcept {
  303|  2.55k|         transpose(B0, B1, B2, B3);
  304|  2.55k|         transpose(B4, B5, B6, B7);
  305|       |
  306|  2.55k|         swap_tops(B0, B4);
  307|  2.55k|         swap_tops(B1, B5);
  308|  2.55k|         swap_tops(B2, B6);
  309|  2.55k|         swap_tops(B3, B7);
  310|  2.55k|      }
_ZN5Botan9SIMD_8x3215reset_registersEv:
  335|  1.27k|      static void reset_registers() noexcept { _mm256_zeroupper(); }
_ZN5Botan9SIMD_8x3214zero_registersEv:
  338|  1.27k|      static void zero_registers() noexcept { _mm256_zeroall(); }
_ZNK5Botan9SIMD_8x323rawEv:
  340|  40.9k|      __m256i BOTAN_FN_ISA_AVX2 raw() const noexcept { return m_avx2; }
_ZN5Botan9SIMD_8x32C2EDv4_x:
  343|   470k|      explicit SIMD_8x32(__m256i x) noexcept : m_avx2(x) {}
_ZN5Botan9SIMD_8x329swap_topsERS0_S1_:
  347|  10.2k|      static void swap_tops(SIMD_8x32& A, SIMD_8x32& B) {
  348|  10.2k|         auto T0 = SIMD_8x32(_mm256_permute2x128_si256(A.raw(), B.raw(), 0 + (2 << 4)));
  349|       |         auto T1 = SIMD_8x32(_mm256_permute2x128_si256(A.raw(), B.raw(), 1 + (3 << 4)));
  350|  10.2k|         A = T0;
  351|  10.2k|         B = T1;
  352|  10.2k|      }
_ZNK5Botan9SIMD_8x324rotlILm7EEES0_vQaagtT_Li0EltT_Li32E:
  118|   102k|      {
  119|       |#if defined(__AVX512VL__)
  120|       |         return SIMD_8x32(_mm256_rol_epi32(m_avx2, ROT));
  121|       |#else
  122|       |         if constexpr(ROT == 8) {
  123|       |            const __m256i shuf_rotl_8 =
  124|       |               _mm256_set_epi64x(0x0e0d0c0f'0a09080b, 0x06050407'02010003, 0x0e0d0c0f'0a09080b, 0x06050407'02010003);
  125|       |
  126|       |            return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_8));
  127|       |         } else if constexpr(ROT == 16) {
  128|       |            const __m256i shuf_rotl_16 =
  129|       |               _mm256_set_epi64x(0x0d0c0f0e'09080b0a, 0x05040706'01000302, 0x0d0c0f0e'09080b0a, 0x05040706'01000302);
  130|       |
  131|       |            return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_16));
  132|       |         } else if constexpr(ROT == 24) {
  133|       |            const __m256i shuf_rotl_24 =
  134|       |               _mm256_set_epi64x(0x0c0f0e0d'080b0a09, 0x04070605'00030201, 0x0c0f0e0d'080b0a09, 0x04070605'00030201);
  135|       |
  136|       |            return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_24));
  137|   102k|         } else {
  138|   102k|            return SIMD_8x32(_mm256_xor_si256(_mm256_slli_epi32(m_avx2, static_cast<int>(ROT)),
  139|   102k|                                              _mm256_srli_epi32(m_avx2, static_cast<int>(32 - ROT))));
  140|   102k|         }
  141|   102k|#endif
  142|   102k|      }
_ZNK5Botan9SIMD_8x324rotlILm16EEES0_vQaagtT_Li0EltT_Li32E:
  118|   102k|      {
  119|       |#if defined(__AVX512VL__)
  120|       |         return SIMD_8x32(_mm256_rol_epi32(m_avx2, ROT));
  121|       |#else
  122|       |         if constexpr(ROT == 8) {
  123|       |            const __m256i shuf_rotl_8 =
  124|       |               _mm256_set_epi64x(0x0e0d0c0f'0a09080b, 0x06050407'02010003, 0x0e0d0c0f'0a09080b, 0x06050407'02010003);
  125|       |
  126|       |            return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_8));
  127|   102k|         } else if constexpr(ROT == 16) {
  128|   102k|            const __m256i shuf_rotl_16 =
  129|   102k|               _mm256_set_epi64x(0x0d0c0f0e'09080b0a, 0x05040706'01000302, 0x0d0c0f0e'09080b0a, 0x05040706'01000302);
  130|       |
  131|   102k|            return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_16));
  132|       |         } else if constexpr(ROT == 24) {
  133|       |            const __m256i shuf_rotl_24 =
  134|       |               _mm256_set_epi64x(0x0c0f0e0d'080b0a09, 0x04070605'00030201, 0x0c0f0e0d'080b0a09, 0x04070605'00030201);
  135|       |
  136|       |            return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_24));
  137|       |         } else {
  138|       |            return SIMD_8x32(_mm256_xor_si256(_mm256_slli_epi32(m_avx2, static_cast<int>(ROT)),
  139|       |                                              _mm256_srli_epi32(m_avx2, static_cast<int>(32 - ROT))));
  140|       |         }
  141|   102k|#endif
  142|   102k|      }
_ZNK5Botan9SIMD_8x324rotlILm12EEES0_vQaagtT_Li0EltT_Li32E:
  118|   102k|      {
  119|       |#if defined(__AVX512VL__)
  120|       |         return SIMD_8x32(_mm256_rol_epi32(m_avx2, ROT));
  121|       |#else
  122|       |         if constexpr(ROT == 8) {
  123|       |            const __m256i shuf_rotl_8 =
  124|       |               _mm256_set_epi64x(0x0e0d0c0f'0a09080b, 0x06050407'02010003, 0x0e0d0c0f'0a09080b, 0x06050407'02010003);
  125|       |
  126|       |            return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_8));
  127|       |         } else if constexpr(ROT == 16) {
  128|       |            const __m256i shuf_rotl_16 =
  129|       |               _mm256_set_epi64x(0x0d0c0f0e'09080b0a, 0x05040706'01000302, 0x0d0c0f0e'09080b0a, 0x05040706'01000302);
  130|       |
  131|       |            return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_16));
  132|       |         } else if constexpr(ROT == 24) {
  133|       |            const __m256i shuf_rotl_24 =
  134|       |               _mm256_set_epi64x(0x0c0f0e0d'080b0a09, 0x04070605'00030201, 0x0c0f0e0d'080b0a09, 0x04070605'00030201);
  135|       |
  136|       |            return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_24));
  137|   102k|         } else {
  138|   102k|            return SIMD_8x32(_mm256_xor_si256(_mm256_slli_epi32(m_avx2, static_cast<int>(ROT)),
  139|   102k|                                              _mm256_srli_epi32(m_avx2, static_cast<int>(32 - ROT))));
  140|   102k|         }
  141|   102k|#endif
  142|   102k|      }
_ZNK5Botan9SIMD_8x324rotlILm8EEES0_vQaagtT_Li0EltT_Li32E:
  118|   102k|      {
  119|       |#if defined(__AVX512VL__)
  120|       |         return SIMD_8x32(_mm256_rol_epi32(m_avx2, ROT));
  121|       |#else
  122|   102k|         if constexpr(ROT == 8) {
  123|   102k|            const __m256i shuf_rotl_8 =
  124|   102k|               _mm256_set_epi64x(0x0e0d0c0f'0a09080b, 0x06050407'02010003, 0x0e0d0c0f'0a09080b, 0x06050407'02010003);
  125|       |
  126|   102k|            return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_8));
  127|       |         } else if constexpr(ROT == 16) {
  128|       |            const __m256i shuf_rotl_16 =
  129|       |               _mm256_set_epi64x(0x0d0c0f0e'09080b0a, 0x05040706'01000302, 0x0d0c0f0e'09080b0a, 0x05040706'01000302);
  130|       |
  131|       |            return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_16));
  132|       |         } else if constexpr(ROT == 24) {
  133|       |            const __m256i shuf_rotl_24 =
  134|       |               _mm256_set_epi64x(0x0c0f0e0d'080b0a09, 0x04070605'00030201, 0x0c0f0e0d'080b0a09, 0x04070605'00030201);
  135|       |
  136|       |            return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_24));
  137|       |         } else {
  138|       |            return SIMD_8x32(_mm256_xor_si256(_mm256_slli_epi32(m_avx2, static_cast<int>(ROT)),
  139|       |                                              _mm256_srli_epi32(m_avx2, static_cast<int>(32 - ROT))));
  140|       |         }
  141|   102k|#endif
  142|   102k|      }

_ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEmQntsr3stdE7same_asIbT_EEES3_S3_:
   43|   157M|constexpr inline T value_barrier(T x) {
   44|   157M|   if(std::is_constant_evaluated()) {
  ------------------
  |  Branch (44:7): [Folded, False: 157M]
  ------------------
   45|      0|      return x;
   46|   157M|   } else {
   47|   157M|#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|   157M|      asm("" : "+r"(x) : /* no input */);  // NOLINT(*-no-assembler)
   56|   157M|      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|   157M|   }
   64|   157M|}
_ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEhQntsr3stdE7same_asIbT_EEES3_S3_:
   43|  4.95k|constexpr inline T value_barrier(T x) {
   44|  4.95k|   if(std::is_constant_evaluated()) {
  ------------------
  |  Branch (44:7): [Folded, False: 4.95k]
  ------------------
   45|      0|      return x;
   46|  4.95k|   } else {
   47|  4.95k|#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|  4.95k|      asm("" : "+r"(x) : /* no input */);  // NOLINT(*-no-assembler)
   56|  4.95k|      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|  4.95k|   }
   64|  4.95k|}
_ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEjQntsr3stdE7same_asIbT_EEES3_S3_:
   43|      5|constexpr inline T value_barrier(T x) {
   44|      5|   if(std::is_constant_evaluated()) {
  ------------------
  |  Branch (44:7): [Folded, False: 5]
  ------------------
   45|      0|      return x;
   46|      5|   } else {
   47|      5|#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|      5|      asm("" : "+r"(x) : /* no input */);  // NOLINT(*-no-assembler)
   56|      5|      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|      5|   }
   64|      5|}

_ZN5Botan21Allocator_InitializerC2Ev:
   50|      1|      Allocator_Initializer() { initialize_allocator(); }

_ZNK5Botan3OID5emptyEv:
  265|      4|      bool empty() const { return m_id.empty(); }
_ZNK5Botan3OID9has_valueEv:
  271|      3|      bool has_value() const { return !empty(); }
_ZNK5Botan3OIDeqERKS0_:
  301|     31|      bool operator==(const OID& other) const { return m_id == other.m_id; }
_ZN5BotanneERKNS_3OIDES2_:
  342|      1|inline bool operator!=(const OID& a, const OID& b) {
  343|      1|   return !(a == b);
  344|      1|}
_ZNKSt3__14hashIN5Botan3OIDEEclERKS2_:
  441|      4|      size_t operator()(const Botan::OID& oid) const noexcept { return static_cast<size_t>(oid.hash_code()); }
_ZN5Botan11ASN1_ObjectC2Ev:
  117|     53|      ASN1_Object() = default;
_ZN5Botan11ASN1_ObjectD2Ev:
  122|    101|      virtual ~ASN1_Object() = default;
_ZN5Botan11ASN1_ObjectC2ERKS0_:
  118|     23|      ASN1_Object(const ASN1_Object&) = default;
_ZN5Botan11ASN1_ObjectC2EOS0_:
  120|     25|      ASN1_Object(ASN1_Object&&) = default;

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

_ZN5Botan6BigIntD2Ev:
  185|     72|      ~BigInt() { _const_time_unpoison(); }
_ZN5Botan6BigInt4zeroEv:
   50|      3|      static BigInt zero() { return BigInt(); }
_ZN5Botan6BigIntC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   98|      6|      explicit BigInt(std::string_view str) { *this = BigInt::from_string(str); }
_ZN5Botan6BigIntC2EOS0_:
  183|      5|      BigInt(BigInt&& other) noexcept { this->swap(other); }
_ZN5Botan6BigIntaSEOS0_:
  190|     11|      BigInt& operator=(BigInt&& other) noexcept {
  191|     11|         if(this != &other) {
  ------------------
  |  Branch (191:13): [True: 11, False: 0]
  ------------------
  192|     11|            this->swap(other);
  193|     11|         }
  194|       |
  195|     11|         return (*this);
  196|     11|      }
_ZN5Botan6BigInt4swapERS0_:
  207|     19|      void swap(BigInt& other) noexcept {
  208|     19|         m_data.swap(other.m_data);
  209|     19|         std::swap(m_signedness, other.m_signedness);
  210|     19|      }
_ZN5Botan6BigInt3subEPKmmNS0_4SignE:
  332|      9|      BigInt& sub(const word y[], size_t y_words, Sign sign) {
  333|      9|         return add(y, y_words, sign == Positive ? Negative : Positive);
  ------------------
  |  Branch (333:33): [True: 9, False: 0]
  ------------------
  334|      9|      }
_ZN5Botan6BigInt5clearEv:
  415|      6|      void clear() {
  416|      6|         m_data.set_to_zero();
  417|      6|         m_signedness = Positive;
  418|      6|      }
_ZNK5Botan6BigInt7is_evenEv:
  455|      1|      bool is_even() const { return !get_bit(0); }
_ZNK5Botan6BigInt6signumEv:
  467|  4.18k|      int signum() const {
  468|  4.18k|         if(sig_words() == 0) {
  ------------------
  |  Branch (468:13): [True: 0, False: 4.18k]
  ------------------
  469|      0|            return 0;
  470|      0|         }
  471|  4.18k|         return (sign() == Negative) ? -1 : 1;
  ------------------
  |  Branch (471:17): [True: 0, False: 4.18k]
  ------------------
  472|  4.18k|      }
_ZNK5Botan6BigInt7is_zeroEv:
  484|      4|      bool is_zero() const { return sig_words() == 0; }
_ZN5Botan6BigInt7set_bitEm:
  490|      4|      void set_bit(size_t n) { conditionally_set_bit(n, true); }
_ZN5Botan6BigInt21conditionally_set_bitEmb:
  500|      4|      void conditionally_set_bit(size_t n, bool set_it) {
  501|      4|         const size_t which = n / (sizeof(word) * 8);
  502|      4|         const word mask = static_cast<word>(set_it) << (n % (sizeof(word) * 8));
  503|      4|         m_data.set_word_at(which, word_at(which) | mask);
  504|      4|      }
_ZNK5Botan6BigInt7get_bitEm:
  523|      1|      bool get_bit(size_t n) const { return ((word_at(n / (sizeof(word) * 8)) >> (n % (sizeof(word) * 8))) & 1) == 1; }
_ZNK5Botan6BigInt7word_atEm:
  574|  7.53k|      word word_at(size_t n) const { return m_data.get_word_at(n); }
_ZNK5Botan6BigInt4signEv:
  604|  4.22k|      Sign sign() const { return (m_signedness); }
_ZN5Botan6BigInt8set_signENS0_4SignE:
  625|     18|      void set_sign(Sign sign) {
  626|     18|         if(sign == Negative && is_zero()) {
  ------------------
  |  Branch (626:13): [True: 0, False: 18]
  |  Branch (626:33): [True: 0, False: 0]
  ------------------
  627|      0|            sign = Positive;
  628|      0|         }
  629|       |
  630|     18|         m_signedness = sign;
  631|     18|      }
_ZNK5Botan6BigInt4sizeEv:
  642|  1.73k|      size_t size() const { return m_data.size(); }
_ZNK5Botan6BigInt9sig_wordsEv:
  648|  5.95k|      size_t sig_words() const { return m_data.sig_words(); }
_ZN5Botan6BigInt12mutable_dataEv:
  673|     32|      BOTAN_DEPRECATED("Deprecated no replacement") word* mutable_data() { return m_data.mutable_data(); }
_ZNK5Botan6BigInt4dataEv:
  679|      2|      BOTAN_DEPRECATED("Deprecated no replacement") const word* data() const { return m_data.const_data(); }
_ZNK5Botan6BigInt7grow_toEm:
  699|     36|      BOTAN_DEPRECATED("Deprecated no replacement") void grow_to(size_t n) const { m_data.grow_to(n); }
_ZN5Botan6BigInt10power_of_2Em:
  856|      1|      static BigInt power_of_2(size_t n) {
  857|      1|         BigInt b;
  858|      1|         b.set_bit(n);
  859|      1|         return b;
  860|      1|      }
_ZNK5Botan6BigInt8_as_spanEv:
  962|      2|      std::span<const word> _as_span() const { return m_data.const_span(); }
_ZNK5Botan6BigInt5_dataEv:
  972|  1.77k|      const word* _data() const { return m_data.const_data(); }
_ZN5Botan6BigInt11_from_wordsERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  991|      8|      static BigInt _from_words(secure_vector<word>& words) {
  992|      8|         BigInt bn;
  993|      8|         bn.m_data.swap(words);
  994|      8|         return bn;
  995|      8|      }
_ZN5Botan6BigInt4Data12mutable_dataEv:
 1022|     59|            word* mutable_data() {
 1023|     59|               invalidate_sig_words();
 1024|     59|               return m_reg.data();
 1025|     59|            }
_ZNK5Botan6BigInt4Data10const_dataEv:
 1027|  1.84k|            const word* const_data() const { return m_reg.data(); }
_ZNK5Botan6BigInt4Data10const_spanEv:
 1029|      2|            std::span<const word> const_span() const { return std::span{m_reg}; }
_ZNK5Botan6BigInt4Data11get_word_atEm:
 1038|  7.53k|            word get_word_at(size_t n) const {
 1039|  7.53k|               if(n < m_reg.size()) {
  ------------------
  |  Branch (1039:19): [True: 7.53k, False: 4]
  ------------------
 1040|  7.53k|                  return m_reg[n];
 1041|  7.53k|               }
 1042|      4|               return 0;
 1043|  7.53k|            }
_ZN5Botan6BigInt4Data11set_word_atEmm:
 1045|      5|            void set_word_at(size_t i, word w) {
 1046|      5|               invalidate_sig_words();
 1047|      5|               if(i >= m_reg.size()) {
  ------------------
  |  Branch (1047:19): [True: 5, False: 0]
  ------------------
 1048|      5|                  if(w == 0) {
  ------------------
  |  Branch (1048:22): [True: 0, False: 5]
  ------------------
 1049|      0|                     return;
 1050|      0|                  }
 1051|      5|                  grow_to(i + 1);
 1052|      5|               }
 1053|      5|               m_reg[i] = w;
 1054|      5|            }
_ZNK5Botan6BigInt4Data7grow_toEm:
 1065|     41|            void grow_to(size_t n) const {
 1066|     41|               if(n > size()) {
  ------------------
  |  Branch (1066:19): [True: 27, False: 14]
  ------------------
 1067|     27|                  if(n <= m_reg.capacity()) {
  ------------------
  |  Branch (1067:22): [True: 0, False: 27]
  ------------------
 1068|      0|                     m_reg.resize(n);
 1069|     27|                  } else {
 1070|     27|                     m_reg.resize(n + (8 - (n % 8)));
 1071|     27|                  }
 1072|     27|               }
 1073|     41|            }
_ZNK5Botan6BigInt4Data4sizeEv:
 1075|  1.87k|            size_t size() const { return m_reg.size(); }
_ZN5Botan6BigInt4Data4swapERS1_:
 1090|     19|            void swap(Data& other) noexcept {
 1091|     19|               m_reg.swap(other.m_reg);
 1092|     19|               std::swap(m_sig_words, other.m_sig_words);
 1093|     19|            }
_ZN5Botan6BigInt4Data4swapERNSt3__16vectorImNS_16secure_allocatorImEEEE:
 1095|     14|            void swap(secure_vector<word>& reg) noexcept {
 1096|     14|               m_reg.swap(reg);
 1097|     14|               invalidate_sig_words();
 1098|     14|            }
_ZNK5Botan6BigInt4Data20invalidate_sig_wordsEv:
 1100|     78|            void invalidate_sig_words() const noexcept { m_sig_words = sig_words_npos; }
_ZNK5Botan6BigInt4Data9sig_wordsEv:
 1102|  5.95k|            size_t sig_words() const {
 1103|  5.95k|               if(m_sig_words == sig_words_npos) {
  ------------------
  |  Branch (1103:19): [True: 69, False: 5.88k]
  ------------------
 1104|     69|                  m_sig_words = calc_sig_words();
 1105|     69|               }
 1106|  5.95k|               return m_sig_words;
 1107|  5.95k|            }
_ZN5BotanplERKNS_6BigIntES2_:
 1125|      2|inline BigInt operator+(const BigInt& x, const BigInt& y) {
 1126|      2|   return BigInt::add2(x, y._data(), y.sig_words(), y.sign());
 1127|      2|}
_ZN5BotanmiERKNS_6BigIntEm:
 1141|      1|inline BigInt operator-(const BigInt& x, word y) {
 1142|      1|   return BigInt::add2(x, &y, 1, BigInt::Negative);
 1143|      1|}
_ZN5BotanmlEmRKNS_6BigIntE:
 1148|      6|inline BigInt operator*(word x, const BigInt& y) {
 1149|      6|   return y * x;
 1150|      6|}
_ZN5BotaneqERKNS_6BigIntES2_:
 1162|      1|inline bool operator==(const BigInt& a, const BigInt& b) {
 1163|      1|   return a.is_equal(b);
 1164|      1|}
_ZN5BotanneERKNS_6BigIntES2_:
 1166|      1|inline bool operator!=(const BigInt& a, const BigInt& b) {
 1167|      1|   return !a.is_equal(b);
 1168|      1|}
_ZN5BotangeERKNS_6BigIntES2_:
 1174|    828|inline bool operator>=(const BigInt& a, const BigInt& b) {
 1175|    828|   return (a.cmp(b) >= 0);
 1176|    828|}
_ZN5BotanltERKNS_6BigIntES2_:
 1178|      1|inline bool operator<(const BigInt& a, const BigInt& b) {
 1179|      1|   return a.is_less_than(b);
 1180|      1|}
_ZN5BotanneERKNS_6BigIntEm:
 1190|      1|inline bool operator!=(const BigInt& a, word b) {
 1191|      1|   return (a.cmp_word(b) != 0);
 1192|      1|}
_ZN5BotanltERKNS_6BigIntEm:
 1202|      3|inline bool operator<(const BigInt& a, word b) {
 1203|      3|   return (a.cmp_word(b) < 0);
 1204|      3|}
_ZN5Botan6BigIntC2Ev:
   45|     44|      BigInt() = default;
_ZN5Botan6BigIntC2ERKS0_:
   88|     16|      BigInt(const BigInt& other) = default;
_ZN5Botan6BigIntaSERKS0_:
  201|      1|      BigInt& operator=(const BigInt&) = default;

_ZN5Botan20Buffered_Computation6updateENSt3__14spanIKhLm18446744073709551615EEE:
   40|     10|      void update(std::span<const uint8_t> in) { add_data(in); }
_ZN5Botan20Buffered_Computation5finalITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_v:
   77|      2|      T final() {
   78|      2|         T output(output_length());
   79|      2|         final_result(output);
   80|      2|         return output;
   81|      2|      }
_ZN5Botan20Buffered_ComputationD2Ev:
  130|      2|      virtual ~Buffered_Computation() = default;

_ZNK5Botan10ChaCha_RNG31max_number_of_bytes_per_requestEv:
  108|  12.3k|      size_t max_number_of_bytes_per_request() const override { return 0; }

_ZN5Botan8CurveGFp4swapERS0_:
   69|      1|      void swap(CurveGFp& other) noexcept { std::swap(m_group, other.m_group); }
_ZN5Botan8CurveGFpC2Ev:
   62|      2|      CurveGFp() = default;

_ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassENSt3__14spanIKhLm18446744073709551615EEE:
  185|      1|      DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, std::span<const uint8_t> rep) {
  186|      1|         return add_object(type_tag, class_tag, rep.data(), rep.size());
  187|      1|      }
_ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassERKNSt3__16vectorIhNS3_9allocatorIhEEEE:
  189|      1|      DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, const std::vector<uint8_t>& rep) {
  190|      1|         return add_object(type_tag, class_tag, std::span{rep});
  191|      1|      }

_ZN5Botan14EC_AffinePoint5g_mulERKNS_9EC_ScalarERNS_21RandomNumberGeneratorERNSt3__16vectorINS_6BigIntENS6_9allocatorIS8_EEEE:
  245|  1.23k|      static EC_AffinePoint g_mul(const EC_Scalar& scalar, RandomNumberGenerator& rng, std::vector<BigInt>& /*ws*/) {
  246|  1.23k|         return EC_AffinePoint::g_mul(scalar, rng);
  247|  1.23k|      }
_ZNK5Botan14EC_AffinePointneERKS0_:
  221|  1.65k|      bool operator!=(const EC_AffinePoint& other) const { return !(*this == other); }
_ZNK5Botan14EC_AffinePoint22serialize_uncompressedITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEEET_v:
  203|  3.30k|      T serialize_uncompressed() const {
  204|  3.30k|         T bytes(1 + 2 * this->field_element_bytes());
  205|  3.30k|         this->serialize_uncompressed_to(bytes);
  206|  3.30k|         return bytes;
  207|  3.30k|      }
_ZNK5Botan14EC_AffinePoint3mulERKNS_9EC_ScalarERNS_21RandomNumberGeneratorERNSt3__16vectorINS_6BigIntENS6_9allocatorIS8_EEEE:
  250|  1.23k|      EC_AffinePoint mul(const EC_Scalar& scalar, RandomNumberGenerator& rng, std::vector<BigInt>& /*ws*/) const {
  251|  1.23k|         return this->mul(scalar, rng);
  252|  1.23k|      }
_ZNK5Botan14EC_AffinePoint6_innerEv:
  263|  4.95k|      const EC_AffinePoint_Data& _inner() const { return inner(); }
_ZNK5Botan14EC_AffinePoint5innerEv:
  274|  19.8k|      const EC_AffinePoint_Data& inner() const { return *m_point; }

_ZNK5Botan8EC_Group5_dataEv:
  458|  1.24k|      const std::shared_ptr<EC_Group_Data>& _data() const { return m_data; }

_ZN5Botan8EC_PointaSEOS0_:
   72|      1|      EC_Point& operator=(EC_Point&& other) noexcept {
   73|      1|         if(this != &other) {
  ------------------
  |  Branch (73:13): [True: 1, False: 0]
  ------------------
   74|      1|            this->swap(other);
   75|      1|         }
   76|      1|         return (*this);
   77|      1|      }
_ZN5Botan8EC_PointD2Ev:
   79|      2|      ~EC_Point() = default;
_ZN5Botan8EC_PointC2Ev:
   46|      1|      EC_Point() = default;

_ZN5BotanplERKNS_9EC_ScalarES2_:
  228|    416|      friend EC_Scalar operator+(const EC_Scalar& x, const EC_Scalar& y) { return x.add(y); }
_ZNK5Botan9EC_Scalar6_innerEv:
  244|  2.47k|      const EC_Scalar_Data& _inner() const { return inner(); }
_ZNK5Botan9EC_Scalar5innerEv:
  253|  5.79k|      const EC_Scalar_Data& inner() const { return *m_scalar; }

_ZN5Botan9clear_memIhEEvPT_m:
  118|     11|inline constexpr void clear_mem(T* ptr, size_t n) {
  119|     11|   clear_bytes(ptr, sizeof(T) * n);
  120|     11|}
_ZN5Botan11clear_bytesEPvm:
  101|     42|inline constexpr void clear_bytes(void* ptr, size_t bytes) {
  102|     42|   if(bytes > 0) {
  ------------------
  |  Branch (102:7): [True: 36, False: 6]
  ------------------
  103|     36|      std::memset(ptr, 0, bytes);
  104|     36|   }
  105|     42|}
_ZN5Botan9clear_memImEEvPT_m:
  118|     17|inline constexpr void clear_mem(T* ptr, size_t n) {
  119|     17|   clear_bytes(ptr, sizeof(T) * n);
  120|     17|}
_ZN5Botan8copy_memImQsr3stdE12is_trivial_vIu7__decayIT_EEEEvPS1_PKS1_m:
  144|     10|inline constexpr void copy_mem(T* out, const T* in, size_t n) {
  145|     10|   BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null");
  ------------------
  |  |  103|     10|   do {                                                                                          \
  |  |  104|     10|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                              \
  |  |  105|     20|      if((expr1) && !(expr2)) {                                                                  \
  |  |  ------------------
  |  |  |  Branch (105:10): [True: 10, False: 0]
  |  |  |  Branch (105:23): [True: 10, False: 0]
  |  |  |  Branch (105:23): [True: 10, False: 0]
  |  |  ------------------
  |  |  106|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                                     \
  |  |  107|      0|         Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \
  |  |  108|      0|      }                                                                                          \
  |  |  109|     10|   } while(0)
  |  |  ------------------
  |  |  |  Branch (109:12): [Folded, False: 10]
  |  |  ------------------
  ------------------
  146|       |
  147|     10|   if(in != nullptr && out != nullptr && n > 0) {
  ------------------
  |  Branch (147:7): [True: 10, False: 0]
  |  Branch (147:24): [True: 10, False: 0]
  |  Branch (147:42): [True: 10, False: 0]
  ------------------
  148|     10|      std::memmove(out, in, sizeof(T) * n);
  149|     10|   }
  150|     10|}
_ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERKNSt3__14spanIhLm8EEEmQaaaasr3stdE23is_trivially_copyable_vIT0_Entsr3std6rangesE5rangeIS7_Esr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEEEvOSC_RKS7_:
  199|   125k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromT& in) {
  200|   125k|   typecast_copy(out, std::span<const FromT, 1>(&in, 1));
  201|   125k|}
_ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERKNSt3__14spanIhLm8EEETkNS1_16contiguous_rangeENS3_IKmLm1EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISG_EESH_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS9_IXsr21__is_primary_templateINSA_Iu14__remove_cvrefIDTclL_ZNSC_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSI_ISQ_EESR_E4type10value_typeEEEEvOSN_RKSD_:
  176|   125k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) {
  177|   125k|   ranges::assert_equal_byte_lengths(out, in);
  178|   125k|   std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out));
  179|   125k|}
_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|  99.2k|inline constexpr ToT typecast_copy(const FromR& src) {
  211|  99.2k|   ToT dst;  // NOLINT(*-member-init)
  212|  99.2k|   typecast_copy(dst, src);
  213|  99.2k|   return dst;
  214|  99.2k|}
_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|  99.2k|inline constexpr void typecast_copy(ToT& out, const FromR& in) {
  189|  99.2k|   typecast_copy(std::span<ToT, 1>(&out, 1), in);
  190|  99.2k|}
_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|  99.2k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) {
  177|  99.2k|   ranges::assert_equal_byte_lengths(out, in);
  178|  99.2k|   std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out));
  179|  99.2k|}
_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|    836|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) {
  161|    836|   ranges::assert_equal_byte_lengths(out, in);
  162|    836|   if(std::is_constant_evaluated()) {
  ------------------
  |  Branch (162:7): [Folded, False: 836]
  ------------------
  163|      0|      std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out));
  164|    836|   } else if(ranges::size_bytes(out) > 0) {
  ------------------
  |  Branch (164:14): [True: 834, False: 2]
  ------------------
  165|    834|      std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out));
  166|    834|   }
  167|    836|}
_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|inline constexpr ToT typecast_copy(const FromR& src) {
  211|      2|   ToT dst;  // NOLINT(*-member-init)
  212|      2|   typecast_copy(dst, src);
  213|      2|   return dst;
  214|      2|}
_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|inline constexpr void typecast_copy(ToT& out, const FromR& in) {
  189|      2|   typecast_copy(std::span<ToT, 1>(&out, 1), in);
  190|      2|}
_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|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) {
  177|      2|   ranges::assert_equal_byte_lengths(out, in);
  178|      2|   std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out));
  179|      2|}
_ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeERNSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeENS2_6vectorIhNS_16secure_allocatorIhEEEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISH_EESI_E4type10value_typeENSA_IXsr21__is_primary_templateINSB_Iu14__remove_cvrefIDTclL_ZNSD_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSJ_ISR_EESS_E4type10value_typeEEsr3stdE23is_trivially_copyable_vISW_EEEvOSE_RKSO_:
  160|  3.30k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) {
  161|  3.30k|   ranges::assert_equal_byte_lengths(out, in);
  162|  3.30k|   if(std::is_constant_evaluated()) {
  ------------------
  |  Branch (162:7): [Folded, False: 3.30k]
  ------------------
  163|      0|      std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out));
  164|  3.30k|   } else if(ranges::size_bytes(out) > 0) {
  ------------------
  |  Branch (164:14): [True: 3.30k, False: 0]
  ------------------
  165|  3.30k|      std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out));
  166|  3.30k|   }
  167|  3.30k|}
_ZN5Botan8copy_memIhQsr3stdE12is_trivial_vIu7__decayIT_EEEEvPS1_PKS1_m:
  144|  13.6k|inline constexpr void copy_mem(T* out, const T* in, size_t n) {
  145|  13.6k|   BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null");
  ------------------
  |  |  103|  13.6k|   do {                                                                                          \
  |  |  104|  13.6k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                              \
  |  |  105|  26.9k|      if((expr1) && !(expr2)) {                                                                  \
  |  |  ------------------
  |  |  |  Branch (105:10): [True: 13.4k, False: 194]
  |  |  |  Branch (105:23): [True: 13.4k, False: 0]
  |  |  |  Branch (105:23): [True: 13.4k, False: 0]
  |  |  ------------------
  |  |  106|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                                     \
  |  |  107|      0|         Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \
  |  |  108|      0|      }                                                                                          \
  |  |  109|  13.6k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (109:12): [Folded, False: 13.6k]
  |  |  ------------------
  ------------------
  146|       |
  147|  13.6k|   if(in != nullptr && out != nullptr && n > 0) {
  ------------------
  |  Branch (147:7): [True: 13.6k, False: 0]
  |  Branch (147:24): [True: 13.6k, False: 0]
  |  Branch (147:42): [True: 13.4k, False: 194]
  ------------------
  148|  13.4k|      std::memmove(out, in, sizeof(T) * n);
  149|  13.4k|   }
  150|  13.6k|}
_ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERKNSt3__14spanIhLm4EEEjQaaaasr3stdE23is_trivially_copyable_vIT0_Entsr3std6rangesE5rangeIS7_Esr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEEEvOSC_RKS7_:
  199|     32|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromT& in) {
  200|     32|   typecast_copy(out, std::span<const FromT, 1>(&in, 1));
  201|     32|}
_ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERKNSt3__14spanIhLm4EEETkNS1_16contiguous_rangeENS3_IKjLm1EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISG_EESH_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS9_IXsr21__is_primary_templateINSA_Iu14__remove_cvrefIDTclL_ZNSC_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSI_ISQ_EESR_E4type10value_typeEEEEvOSN_RKSD_:
  176|     32|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) {
  177|     32|   ranges::assert_equal_byte_lengths(out, in);
  178|     32|   std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out));
  179|     32|}
_ZN5Botan9clear_memIjEEvPT_m:
  118|      6|inline constexpr void clear_mem(T* ptr, size_t n) {
  119|      6|   clear_bytes(ptr, sizeof(T) * n);
  120|      6|}
_ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNSt3__14spanImLm18446744073709551615EEETkNS1_16contiguous_rangeENS3_IKhLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS8_IXsr21__is_primary_templateINS9_Iu14__remove_cvrefIDTclL_ZNSB_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSH_ISP_EESQ_E4type10value_typeEEEEvOSM_RKSC_:
  176|  2.47k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) {
  177|  2.47k|   ranges::assert_equal_byte_lengths(out, in);
  178|  2.47k|   std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out));
  179|  2.47k|}
_ZN5Botan9clear_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm18446744073709551615EEEEEvOT_Qsr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRS5_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISD_EESE_E4type10value_typeEE:
  132|      8|{
  133|      8|   clear_bytes(std::ranges::data(mem), ranges::size_bytes(mem));
  134|      8|}
_ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm8EEETkNS1_16contiguous_rangeENS2_5arrayImLm8EEEQaasr3stdE9is_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.47k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) {
  161|  2.47k|   ranges::assert_equal_byte_lengths(out, in);
  162|  2.47k|   if(std::is_constant_evaluated()) {
  ------------------
  |  Branch (162:7): [Folded, False: 2.47k]
  ------------------
  163|      0|      std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out));
  164|  2.47k|   } else if(ranges::size_bytes(out) > 0) {
  ------------------
  |  Branch (164:14): [True: 2.47k, False: 0]
  ------------------
  165|  2.47k|      std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out));
  166|  2.47k|   }
  167|  2.47k|}
_ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNSt3__14spanIjLm18446744073709551615EEETkNS1_16contiguous_rangeENS3_IKhLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS8_IXsr21__is_primary_templateINS9_Iu14__remove_cvrefIDTclL_ZNSB_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSH_ISP_EESQ_E4type10value_typeEEEEvOSM_RKSC_:
  176|      2|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) {
  177|      2|   ranges::assert_equal_byte_lengths(out, in);
  178|      2|   std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out));
  179|      2|}

_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|    836|{
  101|    836|   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|    836|   } else {
  107|    836|      const size_t expected_size = s0.size_bytes();
  108|    836|      const bool correct_size =
  109|    836|         ((std::span<const std::ranges::range_value_t<Rs>>{rs}.size_bytes() == expected_size) && ...);
  110|       |
  111|    836|      if(!correct_size) {
  ------------------
  |  Branch (111:10): [True: 0, False: 836]
  ------------------
  112|      0|         memory_region_size_violation();
  113|      0|      }
  114|    836|   }
  115|    836|}
_ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIhLm8EEEEEvRKT0_:
   77|   244k|inline constexpr void assert_exact_byte_length(const R& r) {
   78|   244k|   const std::span s{r};
   79|   244k|   if constexpr(statically_spanable_range<R>) {
   80|   244k|      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|   244k|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm8EEETpTkNS0_14spanable_rangeEJNS3_IKmLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|   125k|{
  101|   125k|   const std::span s0{r0};
  102|       |
  103|   125k|   if constexpr(statically_spanable_range<R0>) {
  104|   125k|      constexpr size_t expected_size = s0.size_bytes();
  105|   125k|      (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|   125k|}
_ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIKmLm1EEEEEvRKT0_:
   77|   125k|inline constexpr void assert_exact_byte_length(const R& r) {
   78|   125k|   const std::span s{r};
   79|   125k|   if constexpr(statically_spanable_range<R>) {
   80|   125k|      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|   125k|}
_ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm8EEEEEmRKT_:
   59|   125k|inline constexpr size_t size_bytes(const spanable_range auto& r) {
   60|   125k|   return std::span{r}.size_bytes();
   61|   125k|}
_ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIKhLm8EEEEEvRKT0_:
   77|   198k|inline constexpr void assert_exact_byte_length(const R& r) {
   78|   198k|   const std::span s{r};
   79|   198k|   if constexpr(statically_spanable_range<R>) {
   80|   198k|      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|   198k|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm1EEETpTkNS0_14spanable_rangeEJNS3_IKhLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|  99.2k|{
  101|  99.2k|   const std::span s0{r0};
  102|       |
  103|  99.2k|   if constexpr(statically_spanable_range<R0>) {
  104|  99.2k|      constexpr size_t expected_size = s0.size_bytes();
  105|  99.2k|      (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|  99.2k|}
_ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm1EEEEEmRKT_:
   59|  99.2k|inline constexpr size_t size_bytes(const spanable_range auto& r) {
   60|  99.2k|   return std::span{r}.size_bytes();
   61|  99.2k|}
_ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEEEEmRKT_:
   59|  8.27k|inline constexpr size_t size_bytes(const spanable_range auto& r) {
   60|  8.27k|   return std::span{r}.size_bytes();
   61|  8.27k|}
_ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__15arrayIhLm8EEEEEvRKT0_:
   77|      2|inline constexpr void assert_exact_byte_length(const R& r) {
   78|      2|   const std::span s{r};
   79|      2|   if constexpr(statically_spanable_range<R>) {
   80|      2|      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|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm1EEETpTkNS0_14spanable_rangeEJNS3_IhLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|      2|{
  101|      2|   const std::span s0{r0};
  102|       |
  103|      2|   if constexpr(statically_spanable_range<R0>) {
  104|      2|      constexpr size_t expected_size = s0.size_bytes();
  105|      2|      (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|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS2_6vectorIhNS_16secure_allocatorIhEEEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|  3.30k|{
  101|  3.30k|   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|  3.30k|   } else {
  107|  3.30k|      const size_t expected_size = s0.size_bytes();
  108|  3.30k|      const bool correct_size =
  109|  3.30k|         ((std::span<const std::ranges::range_value_t<Rs>>{rs}.size_bytes() == expected_size) && ...);
  110|       |
  111|  3.30k|      if(!correct_size) {
  ------------------
  |  Branch (111:10): [True: 0, False: 3.30k]
  ------------------
  112|      0|         memory_region_size_violation();
  113|      0|      }
  114|  3.30k|   }
  115|  3.30k|}
_ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__14spanIhLm4EEEEEvRKT0_:
   77|     64|inline constexpr void assert_exact_byte_length(const R& r) {
   78|     64|   const std::span s{r};
   79|     64|   if constexpr(statically_spanable_range<R>) {
   80|     64|      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|     64|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm4EEETpTkNS0_14spanable_rangeEJNS3_IKjLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|     32|{
  101|     32|   const std::span s0{r0};
  102|       |
  103|     32|   if constexpr(statically_spanable_range<R0>) {
  104|     32|      constexpr size_t expected_size = s0.size_bytes();
  105|     32|      (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|     32|}
_ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__14spanIKjLm1EEEEEvRKT0_:
   77|     32|inline constexpr void assert_exact_byte_length(const R& r) {
   78|     32|   const std::span s{r};
   79|     32|   if constexpr(statically_spanable_range<R>) {
   80|     32|      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|     32|}
_ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm4EEEEEmRKT_:
   59|     32|inline constexpr size_t size_bytes(const spanable_range auto& r) {
   60|     32|   return std::span{r}.size_bytes();
   61|     32|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|  4.95k|{
  101|  4.95k|   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|  4.95k|   } else {
  107|  4.95k|      const size_t expected_size = s0.size_bytes();
  108|  4.95k|      const bool correct_size =
  109|  4.95k|         ((std::span<const std::ranges::range_value_t<Rs>>{rs}.size_bytes() == expected_size) && ...);
  110|       |
  111|  4.95k|      if(!correct_size) {
  ------------------
  |  Branch (111:10): [True: 0, False: 4.95k]
  ------------------
  112|      0|         memory_region_size_violation();
  113|      0|      }
  114|  4.95k|   }
  115|  4.95k|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIjLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|      4|{
  101|      4|   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|      4|   } else {
  107|      4|      const size_t expected_size = s0.size_bytes();
  108|      4|      const bool correct_size =
  109|      4|         ((std::span<const std::ranges::range_value_t<Rs>>{rs}.size_bytes() == expected_size) && ...);
  110|       |
  111|      4|      if(!correct_size) {
  ------------------
  |  Branch (111:10): [True: 0, False: 4]
  ------------------
  112|      0|         memory_region_size_violation();
  113|      0|      }
  114|      4|   }
  115|      4|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKjLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|      4|{
  101|      4|   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|      4|   } else {
  107|      4|      const size_t expected_size = s0.size_bytes();
  108|      4|      const bool correct_size =
  109|      4|         ((std::span<const std::ranges::range_value_t<Rs>>{rs}.size_bytes() == expected_size) && ...);
  110|       |
  111|      4|      if(!correct_size) {
  ------------------
  |  Branch (111:10): [True: 0, False: 4]
  ------------------
  112|      0|         memory_region_size_violation();
  113|      0|      }
  114|      4|   }
  115|      4|}
_ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm18446744073709551615EEEEEmRKT_:
   59|  2.48k|inline constexpr size_t size_bytes(const spanable_range auto& r) {
   60|  2.48k|   return std::span{r}.size_bytes();
   61|  2.48k|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm8EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|  2.47k|{
  101|  2.47k|   const std::span s0{r0};
  102|       |
  103|  2.47k|   if constexpr(statically_spanable_range<R0>) {
  104|  2.47k|      constexpr size_t expected_size = s0.size_bytes();
  105|  2.47k|      (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.47k|}
_ZN5Botan6ranges24assert_exact_byte_lengthILm64ETkNS0_14spanable_rangeENSt3__15arrayImLm8EEEEEvRKT0_:
   77|  12.3k|inline constexpr void assert_exact_byte_length(const R& r) {
   78|  12.3k|   const std::span s{r};
   79|  12.3k|   if constexpr(statically_spanable_range<R>) {
   80|  12.3k|      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|  12.3k|}
_ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm8EEEEEmRKT_:
   59|  4.95k|inline constexpr size_t size_bytes(const spanable_range auto& r) {
   60|  4.95k|   return std::span{r}.size_bytes();
   61|  4.95k|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__16vectorIhNS2_9allocatorIhEEEETpTkNS0_14spanable_rangeEJA16_mEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|  2.47k|{
  101|  2.47k|   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.47k|   } else {
  107|  2.47k|      const size_t expected_size = s0.size_bytes();
  108|  2.47k|      const bool correct_size =
  109|  2.47k|         ((std::span<const std::ranges::range_value_t<Rs>>{rs}.size_bytes() == expected_size) && ...);
  110|       |
  111|  2.47k|      if(!correct_size) {
  ------------------
  |  Branch (111:10): [True: 0, False: 2.47k]
  ------------------
  112|      0|         memory_region_size_violation();
  113|      0|      }
  114|  2.47k|   }
  115|  2.47k|}
_ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm64EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E:
  100|  9.91k|{
  101|  9.91k|   const std::span s0{r0};
  102|       |
  103|  9.91k|   if constexpr(statically_spanable_range<R0>) {
  104|  9.91k|      constexpr size_t expected_size = s0.size_bytes();
  105|  9.91k|      (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|  9.91k|}
_ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIjLm18446744073709551615EEEEEmRKT_:
   59|      2|inline constexpr size_t size_bytes(const spanable_range auto& r) {
   60|      2|   return std::span{r}.size_bytes();
   61|      2|}

_ZN5Botan21RandomNumberGeneratorD2Ev:
   52|      1|      virtual ~RandomNumberGenerator() = default;
_ZN5Botan21RandomNumberGenerator9randomizeENSt3__14spanIhLm18446744073709551615EEE:
   75|  12.3k|      void randomize(std::span<uint8_t> output) { this->fill_bytes_with_input(output, {}); }
_ZN5Botan21RandomNumberGenerator9randomizeEPhm:
   77|  2.47k|      void randomize(uint8_t output[], size_t length) { this->randomize(std::span(output, length)); }
_ZN5Botan21RandomNumberGenerator11add_entropyENSt3__14spanIKhLm18446744073709551615EEE:
   98|      1|      void add_entropy(std::span<const uint8_t> input) { this->fill_bytes_with_input({}, input); }
_ZN5Botan21RandomNumberGeneratorC2Ev:
   54|      1|      RandomNumberGenerator() = default;

_ZN5Botan16secure_allocatorIhE8allocateEm:
   52|  4.97k|      T* allocate(std::size_t n) { return static_cast<T*>(allocate_memory(n, sizeof(T))); }
_ZN5Botan16secure_allocatorIhE10deallocateEPhm:
   54|  4.97k|      void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); }
_ZN5Botan16secure_allocatorImE10deallocateEPmm:
   54|     86|      void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); }
_ZN5Botan16secure_allocatorImE8allocateEm:
   52|     86|      T* allocate(std::size_t n) { return static_cast<T*>(allocate_memory(n, sizeof(T))); }
_ZN5BotanneIhhEEbRKNS_16secure_allocatorIT_EERKNS1_IT0_EE:
   63|      6|inline bool operator!=(const secure_allocator<T>& /*a*/, const secure_allocator<U>& /*b*/) {
   64|      6|   return false;
   65|      6|}
_ZN5Botan16secure_allocatorIjE10deallocateEPjm:
   54|      3|      void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); }
_ZN5BotanpLIhNS_16secure_allocatorIhEES2_EERNSt3__16vectorIT_T0_EES8_RKNS4_IS5_T1_EE:
   92|      1|std::vector<T, Alloc>& operator+=(std::vector<T, Alloc>& out, const std::vector<T, Alloc2>& in) {
   93|      1|   out.insert(out.end(), in.begin(), in.end());
   94|      1|   return out;
   95|      1|}
_ZN5Botan16secure_allocatorIjE8allocateEm:
   52|      3|      T* allocate(std::size_t n) { return static_cast<T*>(allocate_memory(n, sizeof(T))); }

_ZN5Botan12Stateful_RNGC2Ev:
   58|      1|      Stateful_RNG() : m_reseed_interval(0) {}

_ZN5Botan12StreamCipher15write_keystreamENSt3__14spanIhLm18446744073709551615EEE:
   86|  12.3k|      void write_keystream(std::span<uint8_t> out) { generate_keystream(out.data(), out.size()); }
_ZN5Botan12StreamCipher6set_ivEPKhm:
  166|      2|      void set_iv(const uint8_t iv[], size_t iv_len) { set_iv_bytes(iv, iv_len); }
_ZN5Botan12StreamCipher15keystream_bytesITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_m:
   96|      1|      T keystream_bytes(size_t bytes) {
   97|      1|         T out(bytes);
   98|      1|         write_keystream(out);
   99|      1|         return out;
  100|      1|      }

_ZN5Botan18unwrap_strong_typeIRmEEDcOT_:
  243|   125k|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) {
  244|   125k|   if constexpr(!concepts::strong_type<std::remove_cvref_t<T>>) {
  245|       |      // If the parameter type isn't a strong type, return it as is.
  246|   125k|      return std::forward<T>(t);
  247|       |   } else {
  248|       |      // Unwrap the strong type and return the underlying value.
  249|       |      return std::forward<T>(t).get();
  250|       |   }
  251|   125k|}
_ZN5Botan16wrap_strong_typeImRmQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_:
  268|  99.2k|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) {
  269|  99.2k|   if constexpr(std::same_as<std::remove_cvref_t<ParamT>, T>) {
  270|       |      // Noop, if the parameter type already is the desired return type.
  271|  99.2k|      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|  99.2k|}
_ZN5Botan18unwrap_strong_typeIRjEEDcOT_:
  243|     32|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) {
  244|     32|   if constexpr(!concepts::strong_type<std::remove_cvref_t<T>>) {
  245|       |      // If the parameter type isn't a strong type, return it as is.
  246|     32|      return std::forward<T>(t);
  247|       |   } else {
  248|       |      // Unwrap the strong type and return the underlying value.
  249|       |      return std::forward<T>(t).get();
  250|       |   }
  251|     32|}

_ZN5Botan24Key_Length_SpecificationC2Emmm:
   37|      4|            m_min_keylen(min_k), m_max_keylen(max_k > 0 ? max_k : min_k), m_keylen_mod(k_mod) {}
  ------------------
  |  Branch (37:47): [True: 4, False: 0]
  ------------------
_ZNK5Botan24Key_Length_Specification15valid_keylengthEm:
   43|      4|      bool valid_keylength(size_t length) const {
   44|      4|         return ((length >= m_min_keylen) && (length <= m_max_keylen) && (length % m_keylen_mod == 0));
  ------------------
  |  Branch (44:18): [True: 4, False: 0]
  |  Branch (44:46): [True: 4, False: 0]
  |  Branch (44:74): [True: 4, False: 0]
  ------------------
   45|      4|      }
_ZNK5Botan18SymmetricAlgorithm15valid_keylengthEm:
  113|      4|      bool valid_keylength(size_t length) const { return key_spec().valid_keylength(length); }
_ZNK5Botan18SymmetricAlgorithm23assert_key_material_setEv:
  145|  12.3k|      void assert_key_material_set() const { assert_key_material_set(has_keying_material()); }
_ZNK5Botan18SymmetricAlgorithm23assert_key_material_setEb:
  147|  12.3k|      void assert_key_material_set(bool predicate) const {
  148|  12.3k|         if(!predicate) {
  ------------------
  |  Branch (148:13): [True: 0, False: 12.3k]
  ------------------
  149|      0|            throw_key_not_set_error();
  150|      0|         }
  151|  12.3k|      }
_ZN5Botan18SymmetricAlgorithmD2Ev:
   81|      2|      virtual ~SymmetricAlgorithm() = default;
_ZN5Botan18SymmetricAlgorithmC2Ev:
   80|      2|      SymmetricAlgorithm() = default;

_Z14check_ecc_mathRKN5Botan8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE:
   47|    416|inline void check_ecc_math(const Botan::EC_Group& group, std::span<const uint8_t> in) {
   48|    416|   const size_t hlen = in.size() / 2;
   49|       |
   50|    416|   const auto a = Botan::EC_Scalar::from_bytes_mod_order(group, in.subspan(0, hlen));
   51|    416|   const auto b = Botan::EC_Scalar::from_bytes_mod_order(group, in.subspan(hlen, in.size() - hlen));
   52|    416|   const auto c = a + b;
   53|       |
   54|    416|   if(a.is_zero() || b.is_zero() || c.is_zero()) {
  ------------------
  |  Branch (54:7): [True: 2, False: 414]
  |  Branch (54:22): [True: 1, False: 413]
  |  Branch (54:37): [True: 0, False: 413]
  ------------------
   55|      3|      return;
   56|      3|   }
   57|       |
   58|    413|   auto& rng = fuzzer_rng();
   59|    413|   std::vector<Botan::BigInt> ws;
   60|       |
   61|    413|   const auto P1 = Botan::EC_AffinePoint::g_mul(a, rng, ws);
   62|    413|   const auto Q1 = Botan::EC_AffinePoint::g_mul(b, rng, ws);
   63|    413|   const auto R1 = Botan::EC_AffinePoint::g_mul(c, rng, ws);
   64|       |
   65|    413|   const auto S1 = P1.add(Q1);
   66|    413|   const auto T1 = Q1.add(P1);
   67|       |
   68|    413|   FUZZER_ASSERT_EQUAL(S1, R1);
  ------------------
  |  |   79|    413|   do {                                                                                      \
  |  |   80|    413|      if((x) != (y)) {                                                                       \
  |  |  ------------------
  |  |  |  Branch (80:10): [True: 0, False: 413]
  |  |  ------------------
  |  |   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|    413|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 413]
  |  |  ------------------
  ------------------
   69|    413|   FUZZER_ASSERT_EQUAL(T1, R1);
  ------------------
  |  |   79|    413|   do {                                                                                      \
  |  |   80|    413|      if((x) != (y)) {                                                                       \
  |  |  ------------------
  |  |  |  Branch (80:10): [True: 0, False: 413]
  |  |  ------------------
  |  |   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|    413|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 413]
  |  |  ------------------
  ------------------
   70|       |
   71|    413|   const auto g = Botan::EC_AffinePoint::generator(group);
   72|       |
   73|    413|   const auto P2 = g.mul(a, rng, ws);
   74|    413|   const auto Q2 = g.mul(b, rng, ws);
   75|    413|   const auto R2 = g.mul(c, rng, ws);
   76|       |
   77|    413|   const auto S2 = P2.add(Q2);
   78|    413|   const auto T2 = Q2.add(P2);
   79|       |
   80|    413|   FUZZER_ASSERT_EQUAL(S2, R2);
  ------------------
  |  |   79|    413|   do {                                                                                      \
  |  |   80|    413|      if((x) != (y)) {                                                                       \
  |  |  ------------------
  |  |  |  Branch (80:10): [True: 0, False: 413]
  |  |  ------------------
  |  |   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|    413|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 413]
  |  |  ------------------
  ------------------
   81|    413|   FUZZER_ASSERT_EQUAL(T2, R2);
  ------------------
  |  |   79|    413|   do {                                                                                      \
  |  |   80|    413|      if((x) != (y)) {                                                                       \
  |  |  ------------------
  |  |  |  Branch (80:10): [True: 0, False: 413]
  |  |  ------------------
  |  |   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|    413|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 413]
  |  |  ------------------
  ------------------
   82|    413|}

_Z4fuzzNSt3__14spanIKhLm18446744073709551615EEE:
   10|    438|void fuzz(std::span<const uint8_t> in) {
   11|    438|   if(in.size() > 2 * 512 / 8) {
  ------------------
  |  Branch (11:7): [True: 22, False: 416]
  ------------------
   12|     22|      return;
   13|     22|   }
   14|    416|   static const Botan::EC_Group numsp512("numsp512d1");
   15|    416|   return check_ecc_math(numsp512, in);
   16|    438|}

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|    446|extern "C" int LLVMFuzzerTestOneInput(const uint8_t in[], size_t len) {
   40|    446|   if(len <= max_fuzzer_input_size) {
  ------------------
  |  Branch (40:7): [True: 438, False: 8]
  ------------------
   41|    438|      try {
   42|    438|         fuzz(std::span<const uint8_t>(in, len));
   43|    438|      } 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|    438|   }
   51|    446|   return 0;
   52|    446|}
_Z10fuzzer_rngv:
   62|    413|inline Botan::RandomNumberGenerator& fuzzer_rng() {
   63|    413|   return *fuzzer_rng_as_shared();
   64|    413|}
_Z20fuzzer_rng_as_sharedv:
   56|    413|inline std::shared_ptr<Botan::RandomNumberGenerator> fuzzer_rng_as_shared() {
   57|    413|   static const std::shared_ptr<Botan::ChaCha_RNG> rng =
   58|    413|      std::make_shared<Botan::ChaCha_RNG>(Botan::secure_vector<uint8_t>(32));
   59|    413|   return rng;
   60|    413|}

_ZN5Botan3OID11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   86|      1|OID OID::from_string(std::string_view str) {
   87|      1|   if(str.empty()) {
  ------------------
  |  Branch (87:7): [True: 0, False: 1]
  ------------------
   88|      0|      throw Invalid_Argument("OID::from_string argument must be non-empty");
   89|      0|   }
   90|       |
   91|      1|   OID o = OID_Map::global_registry().str2oid(str);
   92|      1|   if(o.has_value()) {
  ------------------
  |  Branch (92:7): [True: 1, False: 0]
  ------------------
   93|      1|      return o;
   94|      1|   }
   95|       |
   96|       |   // Try to parse as a dotted decimal
   97|      0|   try {
   98|      0|      return OID(str);
   99|      0|   } catch(...) {}
  100|       |
  101|      0|   throw Lookup_Error(fmt("No OID associated with name '{}'", str));
  102|      0|}
_ZN5Botan3OIDC2ESt16initializer_listIjE:
  104|     53|OID::OID(std::initializer_list<uint32_t> init) : m_id(init) {
  105|     53|   oid_valid_check(m_id);
  106|     53|}
_ZNK5Botan3OID19human_name_or_emptyEv:
  147|      1|std::string OID::human_name_or_empty() const {
  148|      1|   return OID_Map::global_registry().oid2str(*this);
  149|      1|}
_ZNK5Botan3OID7matchesESt16initializer_listIjE:
  155|      1|bool OID::matches(std::initializer_list<uint32_t> other) const {
  156|       |   // TODO: once all target compilers support it, use std::ranges::equal
  157|      1|   return std::equal(m_id.begin(), m_id.end(), other.begin(), other.end());
  158|      1|}
_ZNK5Botan3OID9hash_codeEv:
  160|      5|uint64_t OID::hash_code() const {
  161|       |   // If this is changed also update gen_oids.py to match
  162|      5|   uint64_t hash = 0x621F302327D9A49A;
  163|     41|   for(auto id : m_id) {
  ------------------
  |  Branch (163:16): [True: 41, False: 5]
  ------------------
  164|     41|      hash *= 193;
  165|     41|      hash += id;
  166|     41|   }
  167|      5|   return hash;
  168|      5|}
_ZNK5Botan3OID11encode_intoERNS_11DER_EncoderE:
  183|      1|void OID::encode_into(DER_Encoder& der) const {
  184|      1|   if(m_id.size() < 2) {
  ------------------
  |  Branch (184:7): [True: 0, False: 1]
  ------------------
  185|      0|      throw Invalid_Argument("OID::encode_into: OID is invalid");
  186|      0|   }
  187|       |
  188|      1|   auto append = [](std::vector<uint8_t>& encoding, uint32_t z) {
  189|      1|      if(z <= 0x7F) {
  190|      1|         encoding.push_back(static_cast<uint8_t>(z));
  191|      1|      } else {
  192|      1|         const size_t z7 = (high_bit(z) + 7 - 1) / 7;
  193|       |
  194|      1|         for(size_t j = 0; j != z7; ++j) {
  195|      1|            uint8_t zp = static_cast<uint8_t>(z >> (7 * (z7 - j - 1)) & 0x7F);
  196|       |
  197|      1|            if(j != z7 - 1) {
  198|      1|               zp |= 0x80;
  199|      1|            }
  200|       |
  201|      1|            encoding.push_back(zp);
  202|      1|         }
  203|      1|      }
  204|      1|   };
  205|       |
  206|      1|   std::vector<uint8_t> encoding;
  207|       |
  208|       |   // We know 40 * root can't overflow because root is between 0 and 2
  209|      1|   auto first = checked_add(40 * m_id[0], m_id[1]);
  210|      1|   BOTAN_ASSERT_NOMSG(first.has_value());
  ------------------
  |  |   77|      1|   do {                                                                     \
  |  |   78|      1|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      1|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 1]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      1|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1]
  |  |  ------------------
  ------------------
  211|       |
  212|      1|   append(encoding, *first);
  213|       |
  214|      8|   for(size_t i = 2; i != m_id.size(); ++i) {
  ------------------
  |  Branch (214:22): [True: 7, False: 1]
  ------------------
  215|      7|      append(encoding, m_id[i]);
  216|      7|   }
  217|      1|   der.add_object(ASN1_Type::ObjectId, ASN1_Class::Universal, encoding);
  218|      1|}
asn1_oid.cpp:_ZN5Botan12_GLOBAL__N_115oid_valid_checkENSt3__14spanIKjLm18446744073709551615EEE:
   26|     53|void oid_valid_check(std::span<const uint32_t> oid) {
   27|     53|   BOTAN_ARG_CHECK(oid.size() >= 2, "OID too short to be valid");
  ------------------
  |  |   35|     53|   do {                                                          \
  |  |   36|     53|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|     53|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 53]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|     53|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 53]
  |  |  ------------------
  ------------------
   28|     53|   BOTAN_ARG_CHECK(oid[0] <= 2, "OID root out of range");
  ------------------
  |  |   35|     53|   do {                                                          \
  |  |   36|     53|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|     53|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 53]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|     53|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 53]
  |  |  ------------------
  ------------------
   29|     53|   BOTAN_ARG_CHECK(oid[1] <= 39 || oid[0] == 2, "OID second arc too large");
  ------------------
  |  |   35|     53|   do {                                                          \
  |  |   36|     53|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|     53|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:12): [True: 53, False: 0]
  |  |  |  Branch (37:12): [True: 0, False: 0]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|     53|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 53]
  |  |  ------------------
  ------------------
   30|       |   // This last is a limitation of using 32 bit integers when decoding
   31|       |   // not a limitation of ASN.1 object identifiers in general
   32|     53|   BOTAN_ARG_CHECK(oid[1] <= 0xFFFFFFAF, "OID second arc too large");
  ------------------
  |  |   35|     53|   do {                                                          \
  |  |   36|     53|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|     53|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 53]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|     53|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 53]
  |  |  ------------------
  ------------------
   33|     53|}
asn1_oid.cpp:_ZZNK5Botan3OID11encode_intoERNS_11DER_EncoderEENK3$_0clERNSt3__16vectorIhNS4_9allocatorIhEEEEj:
  188|      8|   auto append = [](std::vector<uint8_t>& encoding, uint32_t z) {
  189|      8|      if(z <= 0x7F) {
  ------------------
  |  Branch (189:10): [True: 7, False: 1]
  ------------------
  190|      7|         encoding.push_back(static_cast<uint8_t>(z));
  191|      7|      } else {
  192|      1|         const size_t z7 = (high_bit(z) + 7 - 1) / 7;
  193|       |
  194|      4|         for(size_t j = 0; j != z7; ++j) {
  ------------------
  |  Branch (194:28): [True: 3, False: 1]
  ------------------
  195|      3|            uint8_t zp = static_cast<uint8_t>(z >> (7 * (z7 - j - 1)) & 0x7F);
  196|       |
  197|      3|            if(j != z7 - 1) {
  ------------------
  |  Branch (197:16): [True: 2, False: 1]
  ------------------
  198|      2|               zp |= 0x80;
  199|      2|            }
  200|       |
  201|      3|            encoding.push_back(zp);
  202|      3|         }
  203|      1|      }
  204|      8|   };

_ZN5Botan11DER_EncoderC2ERNSt3__16vectorIhNS1_9allocatorIhEEEE:
   72|      1|DER_Encoder::DER_Encoder(std::vector<uint8_t>& vec) {
   73|      1|   m_append_output = [&vec](const uint8_t b[], size_t l) { vec.insert(vec.end(), b, b + l); };
   74|      1|}
_ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassEPKhm:
  244|      1|DER_Encoder& DER_Encoder::add_object(ASN1_Type type_tag, ASN1_Class class_tag, const uint8_t rep[], size_t length) {
  245|      1|   std::vector<uint8_t> hdr;
  246|      1|   encode_tag(hdr, type_tag, class_tag);
  247|      1|   encode_length(hdr, length);
  248|       |
  249|      1|   if(!m_subsequences.empty()) {
  ------------------
  |  Branch (249:7): [True: 0, False: 1]
  ------------------
  250|      0|      m_subsequences[m_subsequences.size() - 1].add_bytes(hdr.data(), hdr.size(), rep, length);
  251|      1|   } else if(m_append_output) {
  ------------------
  |  Branch (251:14): [True: 1, False: 0]
  ------------------
  252|      1|      m_append_output(hdr.data(), hdr.size());
  253|      1|      m_append_output(rep, length);
  254|      1|   } else {
  255|      0|      m_default_outbuf += hdr;
  256|      0|      m_default_outbuf += std::make_pair(rep, length);
  257|      0|   }
  258|       |
  259|      1|   return (*this);
  260|      1|}
_ZN5Botan11DER_Encoder6encodeERKNS_11ASN1_ObjectE:
  365|      1|DER_Encoder& DER_Encoder::encode(const ASN1_Object& obj) {
  366|      1|   obj.encode_into(*this);
  367|      1|   return (*this);
  368|      1|}
der_enc.cpp:_ZN5Botan12_GLOBAL__N_110encode_tagERNSt3__16vectorIhNS1_9allocatorIhEEEENS_9ASN1_TypeENS_10ASN1_ClassE:
   25|      1|void encode_tag(std::vector<uint8_t>& encoded_tag, ASN1_Type type_tag_e, ASN1_Class class_tag_e) {
   26|      1|   const uint32_t type_tag = static_cast<uint32_t>(type_tag_e);
   27|      1|   const uint32_t class_tag = static_cast<uint32_t>(class_tag_e);
   28|       |
   29|      1|   if((class_tag | 0xE0) != 0xE0) {
  ------------------
  |  Branch (29:7): [True: 0, False: 1]
  ------------------
   30|      0|      throw Encoding_Error(fmt("DER_Encoder: Invalid class tag {}", std::to_string(class_tag)));
   31|      0|   }
   32|       |
   33|      1|   if(type_tag <= 30) {
  ------------------
  |  Branch (33:7): [True: 1, False: 0]
  ------------------
   34|      1|      encoded_tag.push_back(static_cast<uint8_t>(type_tag | class_tag));
   35|      1|   } else {
   36|      0|      size_t blocks = high_bit(static_cast<uint32_t>(type_tag)) + 6;
   37|      0|      blocks = (blocks - (blocks % 7)) / 7;
   38|       |
   39|      0|      BOTAN_ASSERT_NOMSG(blocks > 0);
  ------------------
  |  |   77|      0|   do {                                                                     \
  |  |   78|      0|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      0|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 0]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      0|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
   40|       |
   41|      0|      encoded_tag.push_back(static_cast<uint8_t>(class_tag | 0x1F));
   42|      0|      for(size_t i = 0; i != blocks - 1; ++i) {
  ------------------
  |  Branch (42:25): [True: 0, False: 0]
  ------------------
   43|      0|         encoded_tag.push_back(0x80 | ((type_tag >> 7 * (blocks - i - 1)) & 0x7F));
   44|      0|      }
   45|      0|      encoded_tag.push_back(type_tag & 0x7F);
   46|      0|   }
   47|      1|}
der_enc.cpp:_ZN5Botan12_GLOBAL__N_113encode_lengthERNSt3__16vectorIhNS1_9allocatorIhEEEEm:
   52|      1|void encode_length(std::vector<uint8_t>& encoded_length, size_t length) {
   53|      1|   if(length <= 127) {
  ------------------
  |  Branch (53:7): [True: 1, False: 0]
  ------------------
   54|      1|      encoded_length.push_back(static_cast<uint8_t>(length));
   55|      1|   } else {
   56|      0|      const size_t bytes_needed = significant_bytes(length);
   57|       |
   58|      0|      encoded_length.push_back(static_cast<uint8_t>(0x80 | bytes_needed));
   59|       |
   60|      0|      for(size_t i = sizeof(length) - bytes_needed; i < sizeof(length); ++i) {
  ------------------
  |  Branch (60:53): [True: 0, False: 0]
  ------------------
   61|      0|         encoded_length.push_back(get_byte_var(i, length));
   62|      0|      }
   63|      0|   }
   64|      1|}
der_enc.cpp:_ZZN5Botan11DER_EncoderC1ERNSt3__16vectorIhNS1_9allocatorIhEEEEENK3$_0clEPKhm:
   73|      2|   m_append_output = [&vec](const uint8_t b[], size_t l) { vec.insert(vec.end(), b, b + l); };

_ZN5Botan7OID_MapC2Ev:
   11|      1|OID_Map::OID_Map() {
   12|      1|   m_str2oid = OID_Map::load_str2oid_map();
   13|      1|   m_oid2str = OID_Map::load_oid2str_map();
   14|      1|}
_ZN5Botan7OID_Map15global_registryEv:
   16|      2|OID_Map& OID_Map::global_registry() {
   17|      2|   static OID_Map g_map;
   18|      2|   return g_map;
   19|      2|}
_ZN5Botan7OID_Map7oid2strERKNS_3OIDE:
   69|      1|std::string OID_Map::oid2str(const OID& oid) {
   70|      1|   if(auto name = lookup_static_oid(oid)) {
  ------------------
  |  Branch (70:12): [True: 1, False: 0]
  ------------------
   71|      1|      return std::string(*name);
   72|      1|   }
   73|       |
   74|      0|   const lock_guard_type<mutex_type> lock(m_mutex);
   75|       |
   76|      0|   auto i = m_oid2str.find(oid);
   77|      0|   if(i != m_oid2str.end()) {
  ------------------
  |  Branch (77:7): [True: 0, False: 0]
  ------------------
   78|      0|      return i->second;
   79|      0|   }
   80|       |
   81|      0|   return "";
   82|      0|}
_ZN5Botan7OID_Map7str2oidENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   84|      1|OID OID_Map::str2oid(std::string_view str) {
   85|      1|   if(auto oid = lookup_static_oid_name(str)) {
  ------------------
  |  Branch (85:12): [True: 1, False: 0]
  ------------------
   86|      1|      return std::move(*oid);
   87|      1|   }
   88|       |
   89|      0|   const lock_guard_type<mutex_type> lock(m_mutex);
   90|      0|   auto i = m_str2oid.find(std::string(str));
   91|      0|   if(i != m_str2oid.end()) {
  ------------------
  |  Branch (91:7): [True: 0, False: 0]
  ------------------
   92|      0|      return i->second;
   93|      0|   }
   94|       |
   95|      0|   return OID();
   96|      0|}

_ZN5Botan7OID_Map17lookup_static_oidERKNS_3OIDE:
   48|      1|std::optional<std::string_view> OID_Map::lookup_static_oid(const OID& oid) {
   49|      1|   const uint32_t hc = static_cast<uint32_t>(oid.hash_code() % 858701);
   50|       |
   51|      1|   switch(hc) {
   52|      0|      case 0x01506:
  ------------------
  |  Branch (52:7): [True: 0, False: 1]
  ------------------
   53|      0|         return if_match(oid, {1, 2, 840, 10045, 4, 3, 1}, "ECDSA/SHA-224");
   54|      0|      case 0x01507:
  ------------------
  |  Branch (54:7): [True: 0, False: 1]
  ------------------
   55|      0|         return if_match(oid, {1, 2, 840, 10045, 4, 3, 2}, "ECDSA/SHA-256");
   56|      0|      case 0x01508:
  ------------------
  |  Branch (56:7): [True: 0, False: 1]
  ------------------
   57|      0|         return if_match(oid, {1, 2, 840, 10045, 4, 3, 3}, "ECDSA/SHA-384");
   58|      0|      case 0x01509:
  ------------------
  |  Branch (58:7): [True: 0, False: 1]
  ------------------
   59|      0|         return if_match(oid, {1, 2, 840, 10045, 4, 3, 4}, "ECDSA/SHA-512");
   60|      0|      case 0x04C1E:
  ------------------
  |  Branch (60:7): [True: 0, False: 1]
  ------------------
   61|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 3029, 1, 2, 1}, "ElGamal");
   62|      0|      case 0x04E61:
  ------------------
  |  Branch (62:7): [True: 0, False: 1]
  ------------------
   63|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 3029, 1, 5, 1}, "OpenPGP.Curve25519");
   64|      0|      case 0x0779B:
  ------------------
  |  Branch (64:7): [True: 0, False: 1]
  ------------------
   65|      0|         return if_match(oid, {1, 2, 840, 113549, 2, 5}, "MD5");
   66|      0|      case 0x0779D:
  ------------------
  |  Branch (66:7): [True: 0, False: 1]
  ------------------
   67|      0|         return if_match(oid, {1, 2, 840, 113549, 2, 7}, "HMAC(SHA-1)");
   68|      0|      case 0x0779E:
  ------------------
  |  Branch (68:7): [True: 0, False: 1]
  ------------------
   69|      0|         return if_match(oid, {1, 2, 840, 113549, 2, 8}, "HMAC(SHA-224)");
   70|      0|      case 0x0779F:
  ------------------
  |  Branch (70:7): [True: 0, False: 1]
  ------------------
   71|      0|         return if_match(oid, {1, 2, 840, 113549, 2, 9}, "HMAC(SHA-256)");
   72|      0|      case 0x077A0:
  ------------------
  |  Branch (72:7): [True: 0, False: 1]
  ------------------
   73|      0|         return if_match(oid, {1, 2, 840, 113549, 2, 10}, "HMAC(SHA-384)");
   74|      0|      case 0x077A1:
  ------------------
  |  Branch (74:7): [True: 0, False: 1]
  ------------------
   75|      0|         return if_match(oid, {1, 2, 840, 113549, 2, 11}, "HMAC(SHA-512)");
   76|      0|      case 0x077A3:
  ------------------
  |  Branch (76:7): [True: 0, False: 1]
  ------------------
   77|      0|         return if_match(oid, {1, 2, 840, 113549, 2, 13}, "HMAC(SHA-512-256)");
   78|      0|      case 0x0785E:
  ------------------
  |  Branch (78:7): [True: 0, False: 1]
  ------------------
   79|      0|         return if_match(oid, {1, 2, 840, 113549, 3, 7}, "TripleDES/CBC");
   80|      0|      case 0x0C904:
  ------------------
  |  Branch (80:7): [True: 0, False: 1]
  ------------------
   81|      0|         return if_match(oid, {1, 0, 14888, 3, 0, 5}, "ECKCDSA");
   82|      0|      case 0x11547:
  ------------------
  |  Branch (82:7): [True: 0, False: 1]
  ------------------
   83|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 1}, "SphincsPlus-shake-128s-r3.1");
   84|      0|      case 0x11548:
  ------------------
  |  Branch (84:7): [True: 0, False: 1]
  ------------------
   85|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 2}, "SphincsPlus-shake-128f-r3.1");
   86|      0|      case 0x11549:
  ------------------
  |  Branch (86:7): [True: 0, False: 1]
  ------------------
   87|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 3}, "SphincsPlus-shake-192s-r3.1");
   88|      0|      case 0x1154A:
  ------------------
  |  Branch (88:7): [True: 0, False: 1]
  ------------------
   89|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 4}, "SphincsPlus-shake-192f-r3.1");
   90|      0|      case 0x1154B:
  ------------------
  |  Branch (90:7): [True: 0, False: 1]
  ------------------
   91|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 5}, "SphincsPlus-shake-256s-r3.1");
   92|      0|      case 0x1154C:
  ------------------
  |  Branch (92:7): [True: 0, False: 1]
  ------------------
   93|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 6}, "SphincsPlus-shake-256f-r3.1");
   94|      0|      case 0x11608:
  ------------------
  |  Branch (94:7): [True: 0, False: 1]
  ------------------
   95|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 1}, "SphincsPlus-sha2-128s-r3.1");
   96|      0|      case 0x11609:
  ------------------
  |  Branch (96:7): [True: 0, False: 1]
  ------------------
   97|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 2}, "SphincsPlus-sha2-128f-r3.1");
   98|      0|      case 0x1160A:
  ------------------
  |  Branch (98:7): [True: 0, False: 1]
  ------------------
   99|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 3}, "SphincsPlus-sha2-192s-r3.1");
  100|      0|      case 0x1160B:
  ------------------
  |  Branch (100:7): [True: 0, False: 1]
  ------------------
  101|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 4}, "SphincsPlus-sha2-192f-r3.1");
  102|      0|      case 0x1160C:
  ------------------
  |  Branch (102:7): [True: 0, False: 1]
  ------------------
  103|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 5}, "SphincsPlus-sha2-256s-r3.1");
  104|      0|      case 0x1160D:
  ------------------
  |  Branch (104:7): [True: 0, False: 1]
  ------------------
  105|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 6}, "SphincsPlus-sha2-256f-r3.1");
  106|      0|      case 0x116C9:
  ------------------
  |  Branch (106:7): [True: 0, False: 1]
  ------------------
  107|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 1}, "SphincsPlus-haraka-128s-r3.1");
  108|      0|      case 0x116CA:
  ------------------
  |  Branch (108:7): [True: 0, False: 1]
  ------------------
  109|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 2}, "SphincsPlus-haraka-128f-r3.1");
  110|      0|      case 0x116CB:
  ------------------
  |  Branch (110:7): [True: 0, False: 1]
  ------------------
  111|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 3}, "SphincsPlus-haraka-192s-r3.1");
  112|      0|      case 0x116CC:
  ------------------
  |  Branch (112:7): [True: 0, False: 1]
  ------------------
  113|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 4}, "SphincsPlus-haraka-192f-r3.1");
  114|      0|      case 0x116CD:
  ------------------
  |  Branch (114:7): [True: 0, False: 1]
  ------------------
  115|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 5}, "SphincsPlus-haraka-256s-r3.1");
  116|      0|      case 0x116CE:
  ------------------
  |  Branch (116:7): [True: 0, False: 1]
  ------------------
  117|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 6}, "SphincsPlus-haraka-256f-r3.1");
  118|      0|      case 0x1533B:
  ------------------
  |  Branch (118:7): [True: 0, False: 1]
  ------------------
  119|      0|         return if_match(oid, {1, 2, 156, 10197, 1, 104, 2}, "SM4/CBC");
  120|      0|      case 0x15341:
  ------------------
  |  Branch (120:7): [True: 0, False: 1]
  ------------------
  121|      0|         return if_match(oid, {1, 2, 156, 10197, 1, 104, 8}, "SM4/GCM");
  122|      0|      case 0x1539D:
  ------------------
  |  Branch (122:7): [True: 0, False: 1]
  ------------------
  123|      0|         return if_match(oid, {1, 2, 156, 10197, 1, 104, 100}, "SM4/OCB");
  124|      0|      case 0x187D7:
  ------------------
  |  Branch (124:7): [True: 0, False: 1]
  ------------------
  125|      0|         return if_match(oid, {1, 3, 14, 3, 2, 7}, "DES/CBC");
  126|      0|      case 0x187EA:
  ------------------
  |  Branch (126:7): [True: 0, False: 1]
  ------------------
  127|      0|         return if_match(oid, {1, 3, 14, 3, 2, 26}, "SHA-1");
  128|      0|      case 0x19933:
  ------------------
  |  Branch (128:7): [True: 0, False: 1]
  ------------------
  129|      0|         return if_match(oid, {1, 3, 132, 0, 8}, "secp160r1");
  130|      0|      case 0x19934:
  ------------------
  |  Branch (130:7): [True: 0, False: 1]
  ------------------
  131|      0|         return if_match(oid, {1, 3, 132, 0, 9}, "secp160k1");
  132|      0|      case 0x19935:
  ------------------
  |  Branch (132:7): [True: 0, False: 1]
  ------------------
  133|      0|         return if_match(oid, {1, 3, 132, 0, 10}, "secp256k1");
  134|      0|      case 0x19949:
  ------------------
  |  Branch (134:7): [True: 0, False: 1]
  ------------------
  135|      0|         return if_match(oid, {1, 3, 132, 0, 30}, "secp160r2");
  136|      0|      case 0x1994A:
  ------------------
  |  Branch (136:7): [True: 0, False: 1]
  ------------------
  137|      0|         return if_match(oid, {1, 3, 132, 0, 31}, "secp192k1");
  138|      0|      case 0x1994B:
  ------------------
  |  Branch (138:7): [True: 0, False: 1]
  ------------------
  139|      0|         return if_match(oid, {1, 3, 132, 0, 32}, "secp224k1");
  140|      0|      case 0x1994C:
  ------------------
  |  Branch (140:7): [True: 0, False: 1]
  ------------------
  141|      0|         return if_match(oid, {1, 3, 132, 0, 33}, "secp224r1");
  142|      0|      case 0x1994D:
  ------------------
  |  Branch (142:7): [True: 0, False: 1]
  ------------------
  143|      0|         return if_match(oid, {1, 3, 132, 0, 34}, "secp384r1");
  144|      0|      case 0x1994E:
  ------------------
  |  Branch (144:7): [True: 0, False: 1]
  ------------------
  145|      0|         return if_match(oid, {1, 3, 132, 0, 35}, "secp521r1");
  146|      0|      case 0x199F8:
  ------------------
  |  Branch (146:7): [True: 0, False: 1]
  ------------------
  147|      0|         return if_match(oid, {1, 3, 132, 1, 12}, "ECDH");
  148|      0|      case 0x1E7BF:
  ------------------
  |  Branch (148:7): [True: 0, False: 1]
  ------------------
  149|      0|         return if_match(oid, {1, 2, 156, 10197, 1, 301, 1}, "SM2");
  150|      0|      case 0x1E7C0:
  ------------------
  |  Branch (150:7): [True: 0, False: 1]
  ------------------
  151|      0|         return if_match(oid, {1, 2, 156, 10197, 1, 301, 2}, "SM2_Kex");
  152|      0|      case 0x1E7C1:
  ------------------
  |  Branch (152:7): [True: 0, False: 1]
  ------------------
  153|      0|         return if_match(oid, {1, 2, 156, 10197, 1, 301, 3}, "SM2_Enc");
  154|      0|      case 0x21960:
  ------------------
  |  Branch (154:7): [True: 0, False: 1]
  ------------------
  155|      0|         return if_match(oid, {1, 3, 36, 3, 3, 1, 2}, "RSA/PKCS1v15(RIPEMD-160)");
  156|      0|      case 0x2198A:
  ------------------
  |  Branch (156:7): [True: 0, False: 1]
  ------------------
  157|      0|         return if_match(oid, {1, 2, 840, 113533, 7, 66, 10}, "CAST-128/CBC");
  158|      0|      case 0x2198F:
  ------------------
  |  Branch (158:7): [True: 0, False: 1]
  ------------------
  159|      0|         return if_match(oid, {1, 2, 840, 113533, 7, 66, 15}, "KeyWrap.CAST-128");
  160|      0|      case 0x227C0:
  ------------------
  |  Branch (160:7): [True: 0, False: 1]
  ------------------
  161|      0|         return if_match(oid, {1, 3, 101, 110}, "X25519");
  162|      0|      case 0x227C1:
  ------------------
  |  Branch (162:7): [True: 0, False: 1]
  ------------------
  163|      0|         return if_match(oid, {1, 3, 101, 111}, "X448");
  164|      0|      case 0x227C2:
  ------------------
  |  Branch (164:7): [True: 0, False: 1]
  ------------------
  165|      0|         return if_match(oid, {1, 3, 101, 112}, "Ed25519");
  166|      0|      case 0x227C3:
  ------------------
  |  Branch (166:7): [True: 0, False: 1]
  ------------------
  167|      0|         return if_match(oid, {1, 3, 101, 113}, "Ed448");
  168|      0|      case 0x27565:
  ------------------
  |  Branch (168:7): [True: 0, False: 1]
  ------------------
  169|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1, 1}, "PKIX.OCSP.BasicResponse");
  170|      0|      case 0x27569:
  ------------------
  |  Branch (170:7): [True: 0, False: 1]
  ------------------
  171|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1, 5}, "PKIX.OCSP.NoCheck");
  172|      0|      case 0x29F7C:
  ------------------
  |  Branch (172:7): [True: 0, False: 1]
  ------------------
  173|      0|         return if_match(oid, {1, 2, 410, 200004, 1, 100, 4, 3}, "ECKCDSA/SHA-1");
  174|      0|      case 0x29F7D:
  ------------------
  |  Branch (174:7): [True: 0, False: 1]
  ------------------
  175|      0|         return if_match(oid, {1, 2, 410, 200004, 1, 100, 4, 4}, "ECKCDSA/SHA-224");
  176|      0|      case 0x29F7E:
  ------------------
  |  Branch (176:7): [True: 0, False: 1]
  ------------------
  177|      0|         return if_match(oid, {1, 2, 410, 200004, 1, 100, 4, 5}, "ECKCDSA/SHA-256");
  178|      0|      case 0x2AC3B:
  ------------------
  |  Branch (178:7): [True: 0, False: 1]
  ------------------
  179|      0|         return if_match(oid, {2, 5, 29, 32, 0}, "X509v3.AnyPolicy");
  180|      0|      case 0x2B000:
  ------------------
  |  Branch (180:7): [True: 0, False: 1]
  ------------------
  181|      0|         return if_match(oid, {2, 5, 29, 37, 0}, "X509v3.AnyExtendedKeyUsage");
  182|      0|      case 0x2B5C9:
  ------------------
  |  Branch (182:7): [True: 0, False: 1]
  ------------------
  183|      0|         return if_match(oid, {1, 2, 840, 10045, 2, 1}, "ECDSA");
  184|      0|      case 0x2B74B:
  ------------------
  |  Branch (184:7): [True: 0, False: 1]
  ------------------
  185|      0|         return if_match(oid, {1, 2, 840, 10045, 4, 1}, "ECDSA/SHA-1");
  186|      0|      case 0x3474A:
  ------------------
  |  Branch (186:7): [True: 0, False: 1]
  ------------------
  187|      0|         return if_match(oid, {1, 2, 840, 10046, 2, 1}, "DH");
  188|      0|      case 0x38D6D:
  ------------------
  |  Branch (188:7): [True: 0, False: 1]
  ------------------
  189|      0|         return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 1, 1}, "gost_256A");
  190|      0|      case 0x38D6E:
  ------------------
  |  Branch (190:7): [True: 0, False: 1]
  ------------------
  191|      0|         return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 1, 2}, "gost_256B");
  192|      0|      case 0x38E2E:
  ------------------
  |  Branch (192:7): [True: 0, False: 1]
  ------------------
  193|      0|         return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 2, 1}, "gost_512A");
  194|      0|      case 0x38E2F:
  ------------------
  |  Branch (194:7): [True: 0, False: 1]
  ------------------
  195|      0|         return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 2, 2}, "gost_512B");
  196|      0|      case 0x38F2C:
  ------------------
  |  Branch (196:7): [True: 0, False: 1]
  ------------------
  197|      0|         return if_match(oid, {1, 2, 643, 2, 2, 3}, "GOST-34.10/GOST-R-34.11-94");
  198|      0|      case 0x38F3C:
  ------------------
  |  Branch (198:7): [True: 0, False: 1]
  ------------------
  199|      0|         return if_match(oid, {1, 2, 643, 2, 2, 19}, "GOST-34.10");
  200|      0|      case 0x3D7B8:
  ------------------
  |  Branch (200:7): [True: 0, False: 1]
  ------------------
  201|      0|         return if_match(oid, {0, 3, 4401, 5, 3, 1, 9, 6}, "Camellia-128/GCM");
  202|      0|      case 0x3D7CC:
  ------------------
  |  Branch (202:7): [True: 0, False: 1]
  ------------------
  203|      0|         return if_match(oid, {0, 3, 4401, 5, 3, 1, 9, 26}, "Camellia-192/GCM");
  204|      0|      case 0x3D7E0:
  ------------------
  |  Branch (204:7): [True: 0, False: 1]
  ------------------
  205|      0|         return if_match(oid, {0, 3, 4401, 5, 3, 1, 9, 46}, "Camellia-256/GCM");
  206|      0|      case 0x3F20F:
  ------------------
  |  Branch (206:7): [True: 0, False: 1]
  ------------------
  207|      0|         return if_match(oid, {1, 3, 36, 3, 2, 1}, "RIPEMD-160");
  208|      0|      case 0x4266E:
  ------------------
  |  Branch (208:7): [True: 0, False: 1]
  ------------------
  209|      0|         return if_match(oid, {0, 4, 0, 127, 0, 15, 1, 1, 13, 0}, "XMSS");
  210|      0|      case 0x478C4:
  ------------------
  |  Branch (210:7): [True: 0, False: 1]
  ------------------
  211|      0|         return if_match(oid, {1, 2, 410, 200004, 1, 4}, "SEED/CBC");
  212|      0|      case 0x47D98:
  ------------------
  |  Branch (212:7): [True: 0, False: 1]
  ------------------
  213|      0|         return if_match(oid, {1, 2, 156, 10197, 1, 301}, "sm2p256v1");
  214|      0|      case 0x47DFC:
  ------------------
  |  Branch (214:7): [True: 0, False: 1]
  ------------------
  215|      0|         return if_match(oid, {1, 2, 156, 10197, 1, 401}, "SM3");
  216|      0|      case 0x47E60:
  ------------------
  |  Branch (216:7): [True: 0, False: 1]
  ------------------
  217|      0|         return if_match(oid, {1, 2, 156, 10197, 1, 501}, "SM2_Sig/SM3");
  218|      0|      case 0x47E63:
  ------------------
  |  Branch (218:7): [True: 0, False: 1]
  ------------------
  219|      0|         return if_match(oid, {1, 2, 156, 10197, 1, 504}, "RSA/PKCS1v15(SM3)");
  220|      0|      case 0x52B13:
  ------------------
  |  Branch (220:7): [True: 0, False: 1]
  ------------------
  221|      0|         return if_match(oid, {1, 2, 643, 3, 131, 1, 1}, "GOST.INN");
  222|      0|      case 0x635AE:
  ------------------
  |  Branch (222:7): [True: 0, False: 1]
  ------------------
  223|      0|         return if_match(oid, {1, 2, 250, 1, 223, 101, 256, 1}, "frp256v1");
  224|      0|      case 0x6A784:
  ------------------
  |  Branch (224:7): [True: 0, False: 1]
  ------------------
  225|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 1}, "PKCS12.KeyBag");
  226|      0|      case 0x6A785:
  ------------------
  |  Branch (226:7): [True: 0, False: 1]
  ------------------
  227|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 2}, "PKCS12.PKCS8ShroudedKeyBag");
  228|      0|      case 0x6A786:
  ------------------
  |  Branch (228:7): [True: 0, False: 1]
  ------------------
  229|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 3}, "PKCS12.CertBag");
  230|      0|      case 0x6A787:
  ------------------
  |  Branch (230:7): [True: 0, False: 1]
  ------------------
  231|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 4}, "PKCS12.CRLBag");
  232|      0|      case 0x6A788:
  ------------------
  |  Branch (232:7): [True: 0, False: 1]
  ------------------
  233|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 5}, "PKCS12.SecretBag");
  234|      0|      case 0x6A789:
  ------------------
  |  Branch (234:7): [True: 0, False: 1]
  ------------------
  235|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 6}, "PKCS12.SafeContentsBag");
  236|      0|      case 0x6EB86:
  ------------------
  |  Branch (236:7): [True: 0, False: 1]
  ------------------
  237|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 6, 1}, "GOST-34.10-2012-256/SHA-256");
  238|      0|      case 0x6EC47:
  ------------------
  |  Branch (238:7): [True: 0, False: 1]
  ------------------
  239|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 7, 1}, "Kyber-512-r3");
  240|      0|      case 0x6EC48:
  ------------------
  |  Branch (240:7): [True: 0, False: 1]
  ------------------
  241|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 7, 2}, "Kyber-768-r3");
  242|      0|      case 0x6EC49:
  ------------------
  |  Branch (242:7): [True: 0, False: 1]
  ------------------
  243|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 7, 3}, "Kyber-1024-r3");
  244|      0|      case 0x6EDC9:
  ------------------
  |  Branch (244:7): [True: 0, False: 1]
  ------------------
  245|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 9, 1}, "Dilithium-4x4-r3");
  246|      0|      case 0x6EDCA:
  ------------------
  |  Branch (246:7): [True: 0, False: 1]
  ------------------
  247|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 9, 2}, "Dilithium-6x5-r3");
  248|      0|      case 0x6EDCB:
  ------------------
  |  Branch (248:7): [True: 0, False: 1]
  ------------------
  249|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 9, 3}, "Dilithium-8x7-r3");
  250|      0|      case 0x6EE8A:
  ------------------
  |  Branch (250:7): [True: 0, False: 1]
  ------------------
  251|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 10, 1}, "Dilithium-4x4-AES-r3");
  252|      0|      case 0x6EE8B:
  ------------------
  |  Branch (252:7): [True: 0, False: 1]
  ------------------
  253|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 10, 2}, "Dilithium-6x5-AES-r3");
  254|      0|      case 0x6EE8C:
  ------------------
  |  Branch (254:7): [True: 0, False: 1]
  ------------------
  255|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 10, 3}, "Dilithium-8x7-AES-r3");
  256|      0|      case 0x6EF4B:
  ------------------
  |  Branch (256:7): [True: 0, False: 1]
  ------------------
  257|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 11, 1}, "Kyber-512-90s-r3");
  258|      0|      case 0x6EF4C:
  ------------------
  |  Branch (258:7): [True: 0, False: 1]
  ------------------
  259|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 11, 2}, "Kyber-768-90s-r3");
  260|      0|      case 0x6EF4D:
  ------------------
  |  Branch (260:7): [True: 0, False: 1]
  ------------------
  261|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 11, 3}, "Kyber-1024-90s-r3");
  262|      0|      case 0x6F18E:
  ------------------
  |  Branch (262:7): [True: 0, False: 1]
  ------------------
  263|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 14, 1}, "FrodoKEM-640-SHAKE");
  264|      0|      case 0x6F18F:
  ------------------
  |  Branch (264:7): [True: 0, False: 1]
  ------------------
  265|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 14, 2}, "FrodoKEM-976-SHAKE");
  266|      0|      case 0x6F190:
  ------------------
  |  Branch (266:7): [True: 0, False: 1]
  ------------------
  267|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 14, 3}, "FrodoKEM-1344-SHAKE");
  268|      0|      case 0x6F24F:
  ------------------
  |  Branch (268:7): [True: 0, False: 1]
  ------------------
  269|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 15, 1}, "FrodoKEM-640-AES");
  270|      0|      case 0x6F250:
  ------------------
  |  Branch (270:7): [True: 0, False: 1]
  ------------------
  271|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 15, 2}, "FrodoKEM-976-AES");
  272|      0|      case 0x6F251:
  ------------------
  |  Branch (272:7): [True: 0, False: 1]
  ------------------
  273|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 15, 3}, "FrodoKEM-1344-AES");
  274|      0|      case 0x6F310:
  ------------------
  |  Branch (274:7): [True: 0, False: 1]
  ------------------
  275|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 16, 1}, "eFrodoKEM-640-SHAKE");
  276|      0|      case 0x6F311:
  ------------------
  |  Branch (276:7): [True: 0, False: 1]
  ------------------
  277|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 16, 2}, "eFrodoKEM-976-SHAKE");
  278|      0|      case 0x6F312:
  ------------------
  |  Branch (278:7): [True: 0, False: 1]
  ------------------
  279|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 16, 3}, "eFrodoKEM-1344-SHAKE");
  280|      0|      case 0x6F3D1:
  ------------------
  |  Branch (280:7): [True: 0, False: 1]
  ------------------
  281|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 17, 1}, "eFrodoKEM-640-AES");
  282|      0|      case 0x6F3D2:
  ------------------
  |  Branch (282:7): [True: 0, False: 1]
  ------------------
  283|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 17, 2}, "eFrodoKEM-976-AES");
  284|      0|      case 0x6F3D3:
  ------------------
  |  Branch (284:7): [True: 0, False: 1]
  ------------------
  285|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 17, 3}, "eFrodoKEM-1344-AES");
  286|      0|      case 0x6F492:
  ------------------
  |  Branch (286:7): [True: 0, False: 1]
  ------------------
  287|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 1}, "ClassicMcEliece_6688128pc");
  288|      0|      case 0x6F493:
  ------------------
  |  Branch (288:7): [True: 0, False: 1]
  ------------------
  289|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 2}, "ClassicMcEliece_6688128pcf");
  290|      0|      case 0x6F494:
  ------------------
  |  Branch (290:7): [True: 0, False: 1]
  ------------------
  291|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 3}, "ClassicMcEliece_6960119pc");
  292|      0|      case 0x6F495:
  ------------------
  |  Branch (292:7): [True: 0, False: 1]
  ------------------
  293|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 4}, "ClassicMcEliece_6960119pcf");
  294|      0|      case 0x6F496:
  ------------------
  |  Branch (294:7): [True: 0, False: 1]
  ------------------
  295|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 5}, "ClassicMcEliece_8192128pc");
  296|      0|      case 0x6F497:
  ------------------
  |  Branch (296:7): [True: 0, False: 1]
  ------------------
  297|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 6}, "ClassicMcEliece_8192128pcf");
  298|      0|      case 0x6F79D:
  ------------------
  |  Branch (298:7): [True: 0, False: 1]
  ------------------
  299|      0|         return if_match(oid, {2, 16, 840, 1, 113730, 1, 13}, "Certificate Comment");
  300|      0|      case 0x701A0:
  ------------------
  |  Branch (300:7): [True: 0, False: 1]
  ------------------
  301|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 2, 1}, "ECGDSA");
  302|      0|      case 0x70322:
  ------------------
  |  Branch (302:7): [True: 0, False: 1]
  ------------------
  303|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 1}, "ECGDSA/RIPEMD-160");
  304|      0|      case 0x70323:
  ------------------
  |  Branch (304:7): [True: 0, False: 1]
  ------------------
  305|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 2}, "ECGDSA/SHA-1");
  306|      0|      case 0x70324:
  ------------------
  |  Branch (306:7): [True: 0, False: 1]
  ------------------
  307|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 3}, "ECGDSA/SHA-224");
  308|      0|      case 0x70325:
  ------------------
  |  Branch (308:7): [True: 0, False: 1]
  ------------------
  309|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 4}, "ECGDSA/SHA-256");
  310|      0|      case 0x70326:
  ------------------
  |  Branch (310:7): [True: 0, False: 1]
  ------------------
  311|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 5}, "ECGDSA/SHA-384");
  312|      0|      case 0x70327:
  ------------------
  |  Branch (312:7): [True: 0, False: 1]
  ------------------
  313|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 6}, "ECGDSA/SHA-512");
  314|      0|      case 0x72B21:
  ------------------
  |  Branch (314:7): [True: 0, False: 1]
  ------------------
  315|      0|         return if_match(oid, {1, 2, 643, 7, 1, 1, 1, 1}, "GOST-34.10-2012-256");
  316|      0|      case 0x72B22:
  ------------------
  |  Branch (316:7): [True: 0, False: 1]
  ------------------
  317|      0|         return if_match(oid, {1, 2, 643, 7, 1, 1, 1, 2}, "GOST-34.10-2012-512");
  318|      0|      case 0x72BE3:
  ------------------
  |  Branch (318:7): [True: 0, False: 1]
  ------------------
  319|      0|         return if_match(oid, {1, 2, 643, 7, 1, 1, 2, 2}, "Streebog-256");
  320|      0|      case 0x72BE4:
  ------------------
  |  Branch (320:7): [True: 0, False: 1]
  ------------------
  321|      0|         return if_match(oid, {1, 2, 643, 7, 1, 1, 2, 3}, "Streebog-512");
  322|      0|      case 0x72CA4:
  ------------------
  |  Branch (322:7): [True: 0, False: 1]
  ------------------
  323|      0|         return if_match(oid, {1, 2, 643, 7, 1, 1, 3, 2}, "GOST-34.10-2012-256/Streebog-256");
  324|      0|      case 0x72CA5:
  ------------------
  |  Branch (324:7): [True: 0, False: 1]
  ------------------
  325|      0|         return if_match(oid, {1, 2, 643, 7, 1, 1, 3, 3}, "GOST-34.10-2012-512/Streebog-512");
  326|      0|      case 0x7C7C7:
  ------------------
  |  Branch (326:7): [True: 0, False: 1]
  ------------------
  327|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 22, 1}, "PKCS9.X509Certificate");
  328|      0|      case 0x7C7C8:
  ------------------
  |  Branch (328:7): [True: 0, False: 1]
  ------------------
  329|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 22, 2}, "PKCS9.SDSICertificate");
  330|      0|      case 0x7C888:
  ------------------
  |  Branch (330:7): [True: 0, False: 1]
  ------------------
  331|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 23, 1}, "PKCS9.X509CRL");
  332|      0|      case 0x7E10F:
  ------------------
  |  Branch (332:7): [True: 0, False: 1]
  ------------------
  333|      0|         return if_match(oid, {2, 5, 4, 3}, "X520.CommonName");
  334|      0|      case 0x7E110:
  ------------------
  |  Branch (334:7): [True: 0, False: 1]
  ------------------
  335|      0|         return if_match(oid, {2, 5, 4, 4}, "X520.Surname");
  336|      0|      case 0x7E111:
  ------------------
  |  Branch (336:7): [True: 0, False: 1]
  ------------------
  337|      0|         return if_match(oid, {2, 5, 4, 5}, "X520.SerialNumber");
  338|      0|      case 0x7E112:
  ------------------
  |  Branch (338:7): [True: 0, False: 1]
  ------------------
  339|      0|         return if_match(oid, {2, 5, 4, 6}, "X520.Country");
  340|      0|      case 0x7E113:
  ------------------
  |  Branch (340:7): [True: 0, False: 1]
  ------------------
  341|      0|         return if_match(oid, {2, 5, 4, 7}, "X520.Locality");
  342|      0|      case 0x7E114:
  ------------------
  |  Branch (342:7): [True: 0, False: 1]
  ------------------
  343|      0|         return if_match(oid, {2, 5, 4, 8}, "X520.State");
  344|      0|      case 0x7E115:
  ------------------
  |  Branch (344:7): [True: 0, False: 1]
  ------------------
  345|      0|         return if_match(oid, {2, 5, 4, 9}, "X520.StreetAddress");
  346|      0|      case 0x7E116:
  ------------------
  |  Branch (346:7): [True: 0, False: 1]
  ------------------
  347|      0|         return if_match(oid, {2, 5, 4, 10}, "X520.Organization");
  348|      0|      case 0x7E117:
  ------------------
  |  Branch (348:7): [True: 0, False: 1]
  ------------------
  349|      0|         return if_match(oid, {2, 5, 4, 11}, "X520.OrganizationalUnit");
  350|      0|      case 0x7E118:
  ------------------
  |  Branch (350:7): [True: 0, False: 1]
  ------------------
  351|      0|         return if_match(oid, {2, 5, 4, 12}, "X520.Title");
  352|      0|      case 0x7E136:
  ------------------
  |  Branch (352:7): [True: 0, False: 1]
  ------------------
  353|      0|         return if_match(oid, {2, 5, 4, 42}, "X520.GivenName");
  354|      0|      case 0x7E137:
  ------------------
  |  Branch (354:7): [True: 0, False: 1]
  ------------------
  355|      0|         return if_match(oid, {2, 5, 4, 43}, "X520.Initials");
  356|      0|      case 0x7E138:
  ------------------
  |  Branch (356:7): [True: 0, False: 1]
  ------------------
  357|      0|         return if_match(oid, {2, 5, 4, 44}, "X520.GenerationalQualifier");
  358|      0|      case 0x7E13A:
  ------------------
  |  Branch (358:7): [True: 0, False: 1]
  ------------------
  359|      0|         return if_match(oid, {2, 5, 4, 46}, "X520.DNQualifier");
  360|      0|      case 0x7E14D:
  ------------------
  |  Branch (360:7): [True: 0, False: 1]
  ------------------
  361|      0|         return if_match(oid, {2, 5, 4, 65}, "X520.Pseudonym");
  362|      0|      case 0x7F3F3:
  ------------------
  |  Branch (362:7): [True: 0, False: 1]
  ------------------
  363|      0|         return if_match(oid, {2, 5, 29, 14}, "X509v3.SubjectKeyIdentifier");
  364|      0|      case 0x7F3F4:
  ------------------
  |  Branch (364:7): [True: 0, False: 1]
  ------------------
  365|      0|         return if_match(oid, {2, 5, 29, 15}, "X509v3.KeyUsage");
  366|      0|      case 0x7F3F5:
  ------------------
  |  Branch (366:7): [True: 0, False: 1]
  ------------------
  367|      0|         return if_match(oid, {2, 5, 29, 16}, "X509v3.PrivateKeyUsagePeriod");
  368|      0|      case 0x7F3F6:
  ------------------
  |  Branch (368:7): [True: 0, False: 1]
  ------------------
  369|      0|         return if_match(oid, {2, 5, 29, 17}, "X509v3.SubjectAlternativeName");
  370|      0|      case 0x7F3F7:
  ------------------
  |  Branch (370:7): [True: 0, False: 1]
  ------------------
  371|      0|         return if_match(oid, {2, 5, 29, 18}, "X509v3.IssuerAlternativeName");
  372|      0|      case 0x7F3F8:
  ------------------
  |  Branch (372:7): [True: 0, False: 1]
  ------------------
  373|      0|         return if_match(oid, {2, 5, 29, 19}, "X509v3.BasicConstraints");
  374|      0|      case 0x7F3F9:
  ------------------
  |  Branch (374:7): [True: 0, False: 1]
  ------------------
  375|      0|         return if_match(oid, {2, 5, 29, 20}, "X509v3.CRLNumber");
  376|      0|      case 0x7F3FA:
  ------------------
  |  Branch (376:7): [True: 0, False: 1]
  ------------------
  377|      0|         return if_match(oid, {2, 5, 29, 21}, "X509v3.ReasonCode");
  378|      0|      case 0x7F3FC:
  ------------------
  |  Branch (378:7): [True: 0, False: 1]
  ------------------
  379|      0|         return if_match(oid, {2, 5, 29, 23}, "X509v3.HoldInstructionCode");
  380|      0|      case 0x7F3FD:
  ------------------
  |  Branch (380:7): [True: 0, False: 1]
  ------------------
  381|      0|         return if_match(oid, {2, 5, 29, 24}, "X509v3.InvalidityDate");
  382|      0|      case 0x7F401:
  ------------------
  |  Branch (382:7): [True: 0, False: 1]
  ------------------
  383|      0|         return if_match(oid, {2, 5, 29, 28}, "X509v3.CRLIssuingDistributionPoint");
  384|      0|      case 0x7F403:
  ------------------
  |  Branch (384:7): [True: 0, False: 1]
  ------------------
  385|      0|         return if_match(oid, {2, 5, 29, 30}, "X509v3.NameConstraints");
  386|      0|      case 0x7F404:
  ------------------
  |  Branch (386:7): [True: 0, False: 1]
  ------------------
  387|      0|         return if_match(oid, {2, 5, 29, 31}, "X509v3.CRLDistributionPoints");
  388|      0|      case 0x7F405:
  ------------------
  |  Branch (388:7): [True: 0, False: 1]
  ------------------
  389|      0|         return if_match(oid, {2, 5, 29, 32}, "X509v3.CertificatePolicies");
  390|      0|      case 0x7F408:
  ------------------
  |  Branch (390:7): [True: 0, False: 1]
  ------------------
  391|      0|         return if_match(oid, {2, 5, 29, 35}, "X509v3.AuthorityKeyIdentifier");
  392|      0|      case 0x7F409:
  ------------------
  |  Branch (392:7): [True: 0, False: 1]
  ------------------
  393|      0|         return if_match(oid, {2, 5, 29, 36}, "X509v3.PolicyConstraints");
  394|      0|      case 0x7F40A:
  ------------------
  |  Branch (394:7): [True: 0, False: 1]
  ------------------
  395|      0|         return if_match(oid, {2, 5, 29, 37}, "X509v3.ExtendedKeyUsage");
  396|      0|      case 0x7F41D:
  ------------------
  |  Branch (396:7): [True: 0, False: 1]
  ------------------
  397|      0|         return if_match(oid, {2, 5, 29, 56}, "X509v3.NoRevocationAvailable");
  398|      0|      case 0x80B84:
  ------------------
  |  Branch (398:7): [True: 0, False: 1]
  ------------------
  399|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 1}, "AES-128/OCB");
  400|      0|      case 0x80B85:
  ------------------
  |  Branch (400:7): [True: 0, False: 1]
  ------------------
  401|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 2}, "AES-192/OCB");
  402|      0|      case 0x80B86:
  ------------------
  |  Branch (402:7): [True: 0, False: 1]
  ------------------
  403|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 3}, "AES-256/OCB");
  404|      0|      case 0x80B87:
  ------------------
  |  Branch (404:7): [True: 0, False: 1]
  ------------------
  405|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 4}, "Serpent/OCB");
  406|      0|      case 0x80B88:
  ------------------
  |  Branch (406:7): [True: 0, False: 1]
  ------------------
  407|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 5}, "Twofish/OCB");
  408|      0|      case 0x80B89:
  ------------------
  |  Branch (408:7): [True: 0, False: 1]
  ------------------
  409|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 6}, "Camellia-128/OCB");
  410|      0|      case 0x80B8A:
  ------------------
  |  Branch (410:7): [True: 0, False: 1]
  ------------------
  411|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 7}, "Camellia-192/OCB");
  412|      0|      case 0x80B8B:
  ------------------
  |  Branch (412:7): [True: 0, False: 1]
  ------------------
  413|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 8}, "Camellia-256/OCB");
  414|      0|      case 0x80D06:
  ------------------
  |  Branch (414:7): [True: 0, False: 1]
  ------------------
  415|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 1}, "AES-128/SIV");
  416|      0|      case 0x80D07:
  ------------------
  |  Branch (416:7): [True: 0, False: 1]
  ------------------
  417|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 2}, "AES-192/SIV");
  418|      0|      case 0x80D08:
  ------------------
  |  Branch (418:7): [True: 0, False: 1]
  ------------------
  419|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 3}, "AES-256/SIV");
  420|      0|      case 0x80D09:
  ------------------
  |  Branch (420:7): [True: 0, False: 1]
  ------------------
  421|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 4}, "Serpent/SIV");
  422|      0|      case 0x80D0A:
  ------------------
  |  Branch (422:7): [True: 0, False: 1]
  ------------------
  423|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 5}, "Twofish/SIV");
  424|      0|      case 0x80D0B:
  ------------------
  |  Branch (424:7): [True: 0, False: 1]
  ------------------
  425|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 6}, "Camellia-128/SIV");
  426|      0|      case 0x80D0C:
  ------------------
  |  Branch (426:7): [True: 0, False: 1]
  ------------------
  427|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 7}, "Camellia-192/SIV");
  428|      0|      case 0x80D0D:
  ------------------
  |  Branch (428:7): [True: 0, False: 1]
  ------------------
  429|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 8}, "Camellia-256/SIV");
  430|      0|      case 0x80D0E:
  ------------------
  |  Branch (430:7): [True: 0, False: 1]
  ------------------
  431|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 9}, "SM4/SIV");
  432|      0|      case 0x84C6A:
  ------------------
  |  Branch (432:7): [True: 0, False: 1]
  ------------------
  433|      0|         return if_match(oid, {1, 2, 392, 200011, 61, 1, 1, 1, 2}, "Camellia-128/CBC");
  434|      0|      case 0x84C6B:
  ------------------
  |  Branch (434:7): [True: 0, False: 1]
  ------------------
  435|      0|         return if_match(oid, {1, 2, 392, 200011, 61, 1, 1, 1, 3}, "Camellia-192/CBC");
  436|      0|      case 0x84C6C:
  ------------------
  |  Branch (436:7): [True: 0, False: 1]
  ------------------
  437|      0|         return if_match(oid, {1, 2, 392, 200011, 61, 1, 1, 1, 4}, "Camellia-256/CBC");
  438|      0|      case 0x88CD3:
  ------------------
  |  Branch (438:7): [True: 0, False: 1]
  ------------------
  439|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 6}, "KeyWrap.TripleDES");
  440|      0|      case 0x88CD5:
  ------------------
  |  Branch (440:7): [True: 0, False: 1]
  ------------------
  441|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 8}, "Compression.Zlib");
  442|      0|      case 0x88CDE:
  ------------------
  |  Branch (442:7): [True: 0, False: 1]
  ------------------
  443|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 17}, "HSS-LMS");
  444|      0|      case 0x88CDF:
  ------------------
  |  Branch (444:7): [True: 0, False: 1]
  ------------------
  445|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 18}, "ChaCha20Poly1305");
  446|      0|      case 0x92296:
  ------------------
  |  Branch (446:7): [True: 0, False: 1]
  ------------------
  447|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 2}, "AES-128/CBC");
  448|      0|      case 0x92299:
  ------------------
  |  Branch (448:7): [True: 0, False: 1]
  ------------------
  449|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 5}, "KeyWrap.AES-128");
  450|      0|      case 0x9229A:
  ------------------
  |  Branch (450:7): [True: 0, False: 1]
  ------------------
  451|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 6}, "AES-128/GCM");
  452|      0|      case 0x9229B:
  ------------------
  |  Branch (452:7): [True: 0, False: 1]
  ------------------
  453|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 7}, "AES-128/CCM");
  454|      0|      case 0x922AA:
  ------------------
  |  Branch (454:7): [True: 0, False: 1]
  ------------------
  455|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 22}, "AES-192/CBC");
  456|      0|      case 0x922AD:
  ------------------
  |  Branch (456:7): [True: 0, False: 1]
  ------------------
  457|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 25}, "KeyWrap.AES-192");
  458|      0|      case 0x922AE:
  ------------------
  |  Branch (458:7): [True: 0, False: 1]
  ------------------
  459|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 26}, "AES-192/GCM");
  460|      0|      case 0x922AF:
  ------------------
  |  Branch (460:7): [True: 0, False: 1]
  ------------------
  461|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 27}, "AES-192/CCM");
  462|      0|      case 0x922BE:
  ------------------
  |  Branch (462:7): [True: 0, False: 1]
  ------------------
  463|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 42}, "AES-256/CBC");
  464|      0|      case 0x922C1:
  ------------------
  |  Branch (464:7): [True: 0, False: 1]
  ------------------
  465|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 45}, "KeyWrap.AES-256");
  466|      0|      case 0x922C2:
  ------------------
  |  Branch (466:7): [True: 0, False: 1]
  ------------------
  467|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 46}, "AES-256/GCM");
  468|      0|      case 0x922C3:
  ------------------
  |  Branch (468:7): [True: 0, False: 1]
  ------------------
  469|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 47}, "AES-256/CCM");
  470|      0|      case 0x92356:
  ------------------
  |  Branch (470:7): [True: 0, False: 1]
  ------------------
  471|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 1}, "SHA-256");
  472|      0|      case 0x92357:
  ------------------
  |  Branch (472:7): [True: 0, False: 1]
  ------------------
  473|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 2}, "SHA-384");
  474|      0|      case 0x92358:
  ------------------
  |  Branch (474:7): [True: 0, False: 1]
  ------------------
  475|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 3}, "SHA-512");
  476|      0|      case 0x92359:
  ------------------
  |  Branch (476:7): [True: 0, False: 1]
  ------------------
  477|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 4}, "SHA-224");
  478|      0|      case 0x9235B:
  ------------------
  |  Branch (478:7): [True: 0, False: 1]
  ------------------
  479|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 6}, "SHA-512-256");
  480|      0|      case 0x9235C:
  ------------------
  |  Branch (480:7): [True: 0, False: 1]
  ------------------
  481|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 7}, "SHA-3(224)");
  482|      0|      case 0x9235D:
  ------------------
  |  Branch (482:7): [True: 0, False: 1]
  ------------------
  483|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 8}, "SHA-3(256)");
  484|      0|      case 0x9235E:
  ------------------
  |  Branch (484:7): [True: 0, False: 1]
  ------------------
  485|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 9}, "SHA-3(384)");
  486|      0|      case 0x9235F:
  ------------------
  |  Branch (486:7): [True: 0, False: 1]
  ------------------
  487|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 10}, "SHA-3(512)");
  488|      0|      case 0x92360:
  ------------------
  |  Branch (488:7): [True: 0, False: 1]
  ------------------
  489|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 11}, "SHAKE-128");
  490|      0|      case 0x92361:
  ------------------
  |  Branch (490:7): [True: 0, False: 1]
  ------------------
  491|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 12}, "SHAKE-256");
  492|      0|      case 0x92417:
  ------------------
  |  Branch (492:7): [True: 0, False: 1]
  ------------------
  493|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 1}, "DSA/SHA-224");
  494|      0|      case 0x92418:
  ------------------
  |  Branch (494:7): [True: 0, False: 1]
  ------------------
  495|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 2}, "DSA/SHA-256");
  496|      0|      case 0x92419:
  ------------------
  |  Branch (496:7): [True: 0, False: 1]
  ------------------
  497|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 3}, "DSA/SHA-384");
  498|      0|      case 0x9241A:
  ------------------
  |  Branch (498:7): [True: 0, False: 1]
  ------------------
  499|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 4}, "DSA/SHA-512");
  500|      0|      case 0x9241B:
  ------------------
  |  Branch (500:7): [True: 0, False: 1]
  ------------------
  501|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 5}, "DSA/SHA-3(224)");
  502|      0|      case 0x9241C:
  ------------------
  |  Branch (502:7): [True: 0, False: 1]
  ------------------
  503|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 6}, "DSA/SHA-3(256)");
  504|      0|      case 0x9241D:
  ------------------
  |  Branch (504:7): [True: 0, False: 1]
  ------------------
  505|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 7}, "DSA/SHA-3(384)");
  506|      0|      case 0x9241E:
  ------------------
  |  Branch (506:7): [True: 0, False: 1]
  ------------------
  507|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 8}, "DSA/SHA-3(512)");
  508|      0|      case 0x9241F:
  ------------------
  |  Branch (508:7): [True: 0, False: 1]
  ------------------
  509|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 9}, "ECDSA/SHA-3(224)");
  510|      0|      case 0x92420:
  ------------------
  |  Branch (510:7): [True: 0, False: 1]
  ------------------
  511|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 10}, "ECDSA/SHA-3(256)");
  512|      0|      case 0x92421:
  ------------------
  |  Branch (512:7): [True: 0, False: 1]
  ------------------
  513|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 11}, "ECDSA/SHA-3(384)");
  514|      0|      case 0x92422:
  ------------------
  |  Branch (514:7): [True: 0, False: 1]
  ------------------
  515|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 12}, "ECDSA/SHA-3(512)");
  516|      0|      case 0x92423:
  ------------------
  |  Branch (516:7): [True: 0, False: 1]
  ------------------
  517|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 13}, "RSA/PKCS1v15(SHA-3(224))");
  518|      0|      case 0x92424:
  ------------------
  |  Branch (518:7): [True: 0, False: 1]
  ------------------
  519|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 14}, "RSA/PKCS1v15(SHA-3(256))");
  520|      0|      case 0x92425:
  ------------------
  |  Branch (520:7): [True: 0, False: 1]
  ------------------
  521|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 15}, "RSA/PKCS1v15(SHA-3(384))");
  522|      0|      case 0x92426:
  ------------------
  |  Branch (522:7): [True: 0, False: 1]
  ------------------
  523|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 16}, "RSA/PKCS1v15(SHA-3(512))");
  524|      0|      case 0x92427:
  ------------------
  |  Branch (524:7): [True: 0, False: 1]
  ------------------
  525|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 17}, "ML-DSA-4x4");
  526|      0|      case 0x92428:
  ------------------
  |  Branch (526:7): [True: 0, False: 1]
  ------------------
  527|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 18}, "ML-DSA-6x5");
  528|      0|      case 0x92429:
  ------------------
  |  Branch (528:7): [True: 0, False: 1]
  ------------------
  529|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 19}, "ML-DSA-8x7");
  530|      0|      case 0x9242A:
  ------------------
  |  Branch (530:7): [True: 0, False: 1]
  ------------------
  531|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 20}, "SLH-DSA-SHA2-128s");
  532|      0|      case 0x9242B:
  ------------------
  |  Branch (532:7): [True: 0, False: 1]
  ------------------
  533|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 21}, "SLH-DSA-SHA2-128f");
  534|      0|      case 0x9242C:
  ------------------
  |  Branch (534:7): [True: 0, False: 1]
  ------------------
  535|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 22}, "SLH-DSA-SHA2-192s");
  536|      0|      case 0x9242D:
  ------------------
  |  Branch (536:7): [True: 0, False: 1]
  ------------------
  537|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 23}, "SLH-DSA-SHA2-192f");
  538|      0|      case 0x9242E:
  ------------------
  |  Branch (538:7): [True: 0, False: 1]
  ------------------
  539|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 24}, "SLH-DSA-SHA2-256s");
  540|      0|      case 0x9242F:
  ------------------
  |  Branch (540:7): [True: 0, False: 1]
  ------------------
  541|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 25}, "SLH-DSA-SHA2-256f");
  542|      0|      case 0x92430:
  ------------------
  |  Branch (542:7): [True: 0, False: 1]
  ------------------
  543|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 26}, "SLH-DSA-SHAKE-128s");
  544|      0|      case 0x92431:
  ------------------
  |  Branch (544:7): [True: 0, False: 1]
  ------------------
  545|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 27}, "SLH-DSA-SHAKE-128f");
  546|      0|      case 0x92432:
  ------------------
  |  Branch (546:7): [True: 0, False: 1]
  ------------------
  547|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 28}, "SLH-DSA-SHAKE-192s");
  548|      0|      case 0x92433:
  ------------------
  |  Branch (548:7): [True: 0, False: 1]
  ------------------
  549|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 29}, "SLH-DSA-SHAKE-192f");
  550|      0|      case 0x92434:
  ------------------
  |  Branch (550:7): [True: 0, False: 1]
  ------------------
  551|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 30}, "SLH-DSA-SHAKE-256s");
  552|      0|      case 0x92435:
  ------------------
  |  Branch (552:7): [True: 0, False: 1]
  ------------------
  553|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 31}, "SLH-DSA-SHAKE-256f");
  554|      0|      case 0x924D8:
  ------------------
  |  Branch (554:7): [True: 0, False: 1]
  ------------------
  555|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 4, 1}, "ML-KEM-512");
  556|      0|      case 0x924D9:
  ------------------
  |  Branch (556:7): [True: 0, False: 1]
  ------------------
  557|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 4, 2}, "ML-KEM-768");
  558|      0|      case 0x924DA:
  ------------------
  |  Branch (558:7): [True: 0, False: 1]
  ------------------
  559|      0|         return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 4, 3}, "ML-KEM-1024");
  560|      0|      case 0x9479F:
  ------------------
  |  Branch (560:7): [True: 0, False: 1]
  ------------------
  561|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 1}, "PKIX.AuthorityInformationAccess");
  562|      0|      case 0x947A5:
  ------------------
  |  Branch (562:7): [True: 0, False: 1]
  ------------------
  563|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 7}, "PKIX.IpAddrBlocks");
  564|      0|      case 0x947A6:
  ------------------
  |  Branch (564:7): [True: 0, False: 1]
  ------------------
  565|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 8}, "PKIX.AutonomousSysIds");
  566|      0|      case 0x947B8:
  ------------------
  |  Branch (566:7): [True: 0, False: 1]
  ------------------
  567|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 26}, "PKIX.TNAuthList");
  568|      0|      case 0x94921:
  ------------------
  |  Branch (568:7): [True: 0, False: 1]
  ------------------
  569|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 1}, "PKIX.ServerAuth");
  570|      0|      case 0x94922:
  ------------------
  |  Branch (570:7): [True: 0, False: 1]
  ------------------
  571|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 2}, "PKIX.ClientAuth");
  572|      0|      case 0x94923:
  ------------------
  |  Branch (572:7): [True: 0, False: 1]
  ------------------
  573|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 3}, "PKIX.CodeSigning");
  574|      0|      case 0x94924:
  ------------------
  |  Branch (574:7): [True: 0, False: 1]
  ------------------
  575|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 4}, "PKIX.EmailProtection");
  576|      0|      case 0x94925:
  ------------------
  |  Branch (576:7): [True: 0, False: 1]
  ------------------
  577|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 5}, "PKIX.IPsecEndSystem");
  578|      0|      case 0x94926:
  ------------------
  |  Branch (578:7): [True: 0, False: 1]
  ------------------
  579|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 6}, "PKIX.IPsecTunnel");
  580|      0|      case 0x94927:
  ------------------
  |  Branch (580:7): [True: 0, False: 1]
  ------------------
  581|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 7}, "PKIX.IPsecUser");
  582|      0|      case 0x94928:
  ------------------
  |  Branch (582:7): [True: 0, False: 1]
  ------------------
  583|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 8}, "PKIX.TimeStamping");
  584|      0|      case 0x94929:
  ------------------
  |  Branch (584:7): [True: 0, False: 1]
  ------------------
  585|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 9}, "PKIX.OCSPSigning");
  586|      0|      case 0x94CEA:
  ------------------
  |  Branch (586:7): [True: 0, False: 1]
  ------------------
  587|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 8, 5}, "PKIX.XMPPAddr");
  588|      0|      case 0x954DB:
  ------------------
  |  Branch (588:7): [True: 0, False: 1]
  ------------------
  589|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 311, 20, 2, 2}, "Microsoft SmartcardLogon");
  590|      0|      case 0x954DC:
  ------------------
  |  Branch (590:7): [True: 0, False: 1]
  ------------------
  591|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 311, 20, 2, 3}, "Microsoft UPN");
  592|      0|      case 0x96B0E:
  ------------------
  |  Branch (592:7): [True: 0, False: 1]
  ------------------
  593|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1}, "PKIX.OCSP");
  594|      0|      case 0x96B0F:
  ------------------
  |  Branch (594:7): [True: 0, False: 1]
  ------------------
  595|      0|         return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 2}, "PKIX.CertificateAuthorityIssuers");
  596|      0|      case 0x96C77:
  ------------------
  |  Branch (596:7): [True: 0, False: 1]
  ------------------
  597|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 12, 1, 3}, "PBE-SHA1-3DES");
  598|      0|      case 0x96C78:
  ------------------
  |  Branch (598:7): [True: 0, False: 1]
  ------------------
  599|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 12, 1, 4}, "PBE-SHA1-2DES");
  600|      0|      case 0x9A008:
  ------------------
  |  Branch (600:7): [True: 0, False: 1]
  ------------------
  601|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 1}, "brainpool160r1");
  602|      0|      case 0x9A00A:
  ------------------
  |  Branch (602:7): [True: 0, False: 1]
  ------------------
  603|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 3}, "brainpool192r1");
  604|      0|      case 0x9A00C:
  ------------------
  |  Branch (604:7): [True: 0, False: 1]
  ------------------
  605|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 5}, "brainpool224r1");
  606|      0|      case 0x9A00E:
  ------------------
  |  Branch (606:7): [True: 0, False: 1]
  ------------------
  607|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 7}, "brainpool256r1");
  608|      0|      case 0x9A010:
  ------------------
  |  Branch (608:7): [True: 0, False: 1]
  ------------------
  609|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 9}, "brainpool320r1");
  610|      0|      case 0x9A012:
  ------------------
  |  Branch (610:7): [True: 0, False: 1]
  ------------------
  611|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 11}, "brainpool384r1");
  612|      0|      case 0x9A014:
  ------------------
  |  Branch (612:7): [True: 0, False: 1]
  ------------------
  613|      0|         return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 13}, "brainpool512r1");
  614|      0|      case 0xA0D61:
  ------------------
  |  Branch (614:7): [True: 0, False: 1]
  ------------------
  615|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 3}, "McEliece");
  616|      0|      case 0xA0D63:
  ------------------
  |  Branch (616:7): [True: 0, False: 1]
  ------------------
  617|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 5}, "XMSS-draft6");
  618|      0|      case 0xA0D66:
  ------------------
  |  Branch (618:7): [True: 0, False: 1]
  ------------------
  619|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 8}, "XMSS-draft12");
  620|      0|      case 0xA0D6B:
  ------------------
  |  Branch (620:7): [True: 0, False: 1]
  ------------------
  621|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 13}, "HSS-LMS-Private-Key");
  622|      0|      case 0xA0EE1:
  ------------------
  |  Branch (622:7): [True: 0, False: 1]
  ------------------
  623|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 1}, "Serpent/CBC");
  624|      0|      case 0xA0EE2:
  ------------------
  |  Branch (624:7): [True: 0, False: 1]
  ------------------
  625|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2}, "Threefish-512/CBC");
  626|      0|      case 0xA0EE3:
  ------------------
  |  Branch (626:7): [True: 0, False: 1]
  ------------------
  627|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 3}, "Twofish/CBC");
  628|      0|      case 0xA0F45:
  ------------------
  |  Branch (628:7): [True: 0, False: 1]
  ------------------
  629|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 101}, "Serpent/GCM");
  630|      0|      case 0xA0F46:
  ------------------
  |  Branch (630:7): [True: 0, False: 1]
  ------------------
  631|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 102}, "Twofish/GCM");
  632|      0|      case 0xA0FA2:
  ------------------
  |  Branch (632:7): [True: 0, False: 1]
  ------------------
  633|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 4, 1}, "numsp256d1");
  634|      0|      case 0xA0FA3:
  ------------------
  |  Branch (634:7): [True: 0, False: 1]
  ------------------
  635|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 4, 2}, "numsp384d1");
  636|      1|      case 0xA0FA4:
  ------------------
  |  Branch (636:7): [True: 1, False: 0]
  ------------------
  637|      1|         return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 4, 3}, "numsp512d1");
  638|      0|      case 0xA244B:
  ------------------
  |  Branch (638:7): [True: 0, False: 1]
  ------------------
  639|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 1}, "ClassicMcEliece_348864");
  640|      0|      case 0xA244C:
  ------------------
  |  Branch (640:7): [True: 0, False: 1]
  ------------------
  641|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 2}, "ClassicMcEliece_348864f");
  642|      0|      case 0xA244D:
  ------------------
  |  Branch (642:7): [True: 0, False: 1]
  ------------------
  643|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 3}, "ClassicMcEliece_460896");
  644|      0|      case 0xA244E:
  ------------------
  |  Branch (644:7): [True: 0, False: 1]
  ------------------
  645|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 4}, "ClassicMcEliece_460896f");
  646|      0|      case 0xA244F:
  ------------------
  |  Branch (646:7): [True: 0, False: 1]
  ------------------
  647|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 5}, "ClassicMcEliece_6688128");
  648|      0|      case 0xA2450:
  ------------------
  |  Branch (648:7): [True: 0, False: 1]
  ------------------
  649|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 6}, "ClassicMcEliece_6688128f");
  650|      0|      case 0xA2451:
  ------------------
  |  Branch (650:7): [True: 0, False: 1]
  ------------------
  651|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 7}, "ClassicMcEliece_6960119");
  652|      0|      case 0xA2452:
  ------------------
  |  Branch (652:7): [True: 0, False: 1]
  ------------------
  653|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 8}, "ClassicMcEliece_6960119f");
  654|      0|      case 0xA2453:
  ------------------
  |  Branch (654:7): [True: 0, False: 1]
  ------------------
  655|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 9}, "ClassicMcEliece_8192128");
  656|      0|      case 0xA2454:
  ------------------
  |  Branch (656:7): [True: 0, False: 1]
  ------------------
  657|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 10}, "ClassicMcEliece_8192128f");
  658|      0|      case 0xAF989:
  ------------------
  |  Branch (658:7): [True: 0, False: 1]
  ------------------
  659|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 1, 1}, "RSA");
  660|      0|      case 0xAF98A:
  ------------------
  |  Branch (660:7): [True: 0, False: 1]
  ------------------
  661|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 1, 2}, "RSA/PKCS1v15(MD2)");
  662|      0|      case 0xAF98C:
  ------------------
  |  Branch (662:7): [True: 0, False: 1]
  ------------------
  663|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 1, 4}, "RSA/PKCS1v15(MD5)");
  664|      0|      case 0xAF98D:
  ------------------
  |  Branch (664:7): [True: 0, False: 1]
  ------------------
  665|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 1, 5}, "RSA/PKCS1v15(SHA-1)");
  666|      0|      case 0xAF98F:
  ------------------
  |  Branch (666:7): [True: 0, False: 1]
  ------------------
  667|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 1, 7}, "RSA/OAEP");
  668|      0|      case 0xAF990:
  ------------------
  |  Branch (668:7): [True: 0, False: 1]
  ------------------
  669|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 1, 8}, "MGF1");
  670|      0|      case 0xAF992:
  ------------------
  |  Branch (670:7): [True: 0, False: 1]
  ------------------
  671|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 1, 10}, "RSA/PSS");
  672|      0|      case 0xAF993:
  ------------------
  |  Branch (672:7): [True: 0, False: 1]
  ------------------
  673|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 1, 11}, "RSA/PKCS1v15(SHA-256)");
  674|      0|      case 0xAF994:
  ------------------
  |  Branch (674:7): [True: 0, False: 1]
  ------------------
  675|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 1, 12}, "RSA/PKCS1v15(SHA-384)");
  676|      0|      case 0xAF995:
  ------------------
  |  Branch (676:7): [True: 0, False: 1]
  ------------------
  677|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 1, 13}, "RSA/PKCS1v15(SHA-512)");
  678|      0|      case 0xAF996:
  ------------------
  |  Branch (678:7): [True: 0, False: 1]
  ------------------
  679|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 1, 14}, "RSA/PKCS1v15(SHA-224)");
  680|      0|      case 0xAF998:
  ------------------
  |  Branch (680:7): [True: 0, False: 1]
  ------------------
  681|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 1, 16}, "RSA/PKCS1v15(SHA-512-256)");
  682|      0|      case 0xAFC98:
  ------------------
  |  Branch (682:7): [True: 0, False: 1]
  ------------------
  683|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 5, 12}, "PKCS5.PBKDF2");
  684|      0|      case 0xAFC99:
  ------------------
  |  Branch (684:7): [True: 0, False: 1]
  ------------------
  685|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 5, 13}, "PBE-PKCS5v20");
  686|      0|      case 0xAFE0F:
  ------------------
  |  Branch (686:7): [True: 0, False: 1]
  ------------------
  687|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 7, 1}, "PKCS7.Data");
  688|      0|      case 0xAFE14:
  ------------------
  |  Branch (688:7): [True: 0, False: 1]
  ------------------
  689|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 7, 6}, "PKCS7.EncryptedData");
  690|      0|      case 0xAFF91:
  ------------------
  |  Branch (690:7): [True: 0, False: 1]
  ------------------
  691|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 1}, "PKCS9.EmailAddress");
  692|      0|      case 0xAFF92:
  ------------------
  |  Branch (692:7): [True: 0, False: 1]
  ------------------
  693|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 2}, "PKCS9.UnstructuredName");
  694|      0|      case 0xAFF93:
  ------------------
  |  Branch (694:7): [True: 0, False: 1]
  ------------------
  695|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 3}, "PKCS9.ContentType");
  696|      0|      case 0xAFF94:
  ------------------
  |  Branch (696:7): [True: 0, False: 1]
  ------------------
  697|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 4}, "PKCS9.MessageDigest");
  698|      0|      case 0xAFF97:
  ------------------
  |  Branch (698:7): [True: 0, False: 1]
  ------------------
  699|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 7}, "PKCS9.ChallengePassword");
  700|      0|      case 0xAFF9E:
  ------------------
  |  Branch (700:7): [True: 0, False: 1]
  ------------------
  701|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 14}, "PKCS9.ExtensionRequest");
  702|      0|      case 0xAFFA4:
  ------------------
  |  Branch (702:7): [True: 0, False: 1]
  ------------------
  703|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 20}, "PKCS9.FriendlyName");
  704|      0|      case 0xAFFA5:
  ------------------
  |  Branch (704:7): [True: 0, False: 1]
  ------------------
  705|      0|         return if_match(oid, {1, 2, 840, 113549, 1, 9, 21}, "PKCS9.LocalKeyId");
  706|      0|      case 0xC0226:
  ------------------
  |  Branch (706:7): [True: 0, False: 1]
  ------------------
  707|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 11591, 4, 11}, "Scrypt");
  708|      0|      case 0xC0A67:
  ------------------
  |  Branch (708:7): [True: 0, False: 1]
  ------------------
  709|      0|         return if_match(oid, {1, 3, 6, 1, 4, 1, 11591, 15, 1}, "OpenPGP.Ed25519");
  710|      0|      case 0xC4CE5:
  ------------------
  |  Branch (710:7): [True: 0, False: 1]
  ------------------
  711|      0|         return if_match(oid, {1, 2, 643, 100, 1}, "GOST.OGRN");
  712|      0|      case 0xC4D53:
  ------------------
  |  Branch (712:7): [True: 0, False: 1]
  ------------------
  713|      0|         return if_match(oid, {1, 2, 643, 100, 111}, "GOST.SubjectSigningTool");
  714|      0|      case 0xC4D54:
  ------------------
  |  Branch (714:7): [True: 0, False: 1]
  ------------------
  715|      0|         return if_match(oid, {1, 2, 643, 100, 112}, "GOST.IssuerSigningTool");
  716|      0|      case 0xC9C50:
  ------------------
  |  Branch (716:7): [True: 0, False: 1]
  ------------------
  717|      0|         return if_match(oid, {1, 2, 840, 10045, 3, 1, 1}, "secp192r1");
  718|      0|      case 0xC9C51:
  ------------------
  |  Branch (718:7): [True: 0, False: 1]
  ------------------
  719|      0|         return if_match(oid, {1, 2, 840, 10045, 3, 1, 2}, "x962_p192v2");
  720|      0|      case 0xC9C52:
  ------------------
  |  Branch (720:7): [True: 0, False: 1]
  ------------------
  721|      0|         return if_match(oid, {1, 2, 840, 10045, 3, 1, 3}, "x962_p192v3");
  722|      0|      case 0xC9C53:
  ------------------
  |  Branch (722:7): [True: 0, False: 1]
  ------------------
  723|      0|         return if_match(oid, {1, 2, 840, 10045, 3, 1, 4}, "x962_p239v1");
  724|      0|      case 0xC9C54:
  ------------------
  |  Branch (724:7): [True: 0, False: 1]
  ------------------
  725|      0|         return if_match(oid, {1, 2, 840, 10045, 3, 1, 5}, "x962_p239v2");
  726|      0|      case 0xC9C55:
  ------------------
  |  Branch (726:7): [True: 0, False: 1]
  ------------------
  727|      0|         return if_match(oid, {1, 2, 840, 10045, 3, 1, 6}, "x962_p239v3");
  728|      0|      case 0xC9C56:
  ------------------
  |  Branch (728:7): [True: 0, False: 1]
  ------------------
  729|      0|         return if_match(oid, {1, 2, 840, 10045, 3, 1, 7}, "secp256r1");
  730|      0|      case 0xCFA13:
  ------------------
  |  Branch (730:7): [True: 0, False: 1]
  ------------------
  731|      0|         return if_match(oid, {1, 2, 840, 10040, 4, 1}, "DSA");
  732|      0|      case 0xCFA15:
  ------------------
  |  Branch (732:7): [True: 0, False: 1]
  ------------------
  733|      0|         return if_match(oid, {1, 2, 840, 10040, 4, 3}, "DSA/SHA-1");
  734|      0|      default:
  ------------------
  |  Branch (734:7): [True: 0, False: 1]
  ------------------
  735|      0|         return {};
  736|      1|   }
  737|      1|}
_ZN5Botan7OID_Map22lookup_static_oid_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  740|      1|std::optional<OID> OID_Map::lookup_static_oid_name(std::string_view req) {
  741|      1|   const uint32_t hc = hash_oid_name(req);
  742|       |
  743|      1|   switch(hc) {
  744|      0|      case 0x00545:
  ------------------
  |  Branch (744:7): [True: 0, False: 1]
  ------------------
  745|      0|         return if_match(req, "Twofish/GCM", {1, 3, 6, 1, 4, 1, 25258, 3, 102});
  746|      0|      case 0x00CF3:
  ------------------
  |  Branch (746:7): [True: 0, False: 1]
  ------------------
  747|      0|         return if_match(req, "SphincsPlus-sha2-192f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 4});
  748|      0|      case 0x015FE:
  ------------------
  |  Branch (748:7): [True: 0, False: 1]
  ------------------
  749|      0|         return if_match(req, "FrodoKEM-640-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 14, 1});
  750|      0|      case 0x01F9E:
  ------------------
  |  Branch (750:7): [True: 0, False: 1]
  ------------------
  751|      0|         return if_match(req, "MD5", {1, 2, 840, 113549, 2, 5});
  752|      0|      case 0x02293:
  ------------------
  |  Branch (752:7): [True: 0, False: 1]
  ------------------
  753|      0|         return if_match(req, "SphincsPlus-shake-192f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 4});
  754|      0|      case 0x02B93:
  ------------------
  |  Branch (754:7): [True: 0, False: 1]
  ------------------
  755|      0|         return if_match(req, "Microsoft SmartcardLogon", {1, 3, 6, 1, 4, 1, 311, 20, 2, 2});
  756|      0|      case 0x041D5:
  ------------------
  |  Branch (756:7): [True: 0, False: 1]
  ------------------
  757|      0|         return if_match(req, "secp160k1", {1, 3, 132, 0, 9});
  758|      0|      case 0x044B3:
  ------------------
  |  Branch (758:7): [True: 0, False: 1]
  ------------------
  759|      0|         return if_match(req, "Camellia-256/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 8});
  760|      0|      case 0x048B2:
  ------------------
  |  Branch (760:7): [True: 0, False: 1]
  ------------------
  761|      0|         return if_match(req, "secp160r1", {1, 3, 132, 0, 8});
  762|      0|      case 0x048B3:
  ------------------
  |  Branch (762:7): [True: 0, False: 1]
  ------------------
  763|      0|         return if_match(req, "secp160r2", {1, 3, 132, 0, 30});
  764|      0|      case 0x05CDA:
  ------------------
  |  Branch (764:7): [True: 0, False: 1]
  ------------------
  765|      0|         return if_match(req, "X520.Country", {2, 5, 4, 6});
  766|      0|      case 0x07783:
  ------------------
  |  Branch (766:7): [True: 0, False: 1]
  ------------------
  767|      0|         return if_match(req, "PKIX.ServerAuth", {1, 3, 6, 1, 5, 5, 7, 3, 1});
  768|      0|      case 0x086C7:
  ------------------
  |  Branch (768:7): [True: 0, False: 1]
  ------------------
  769|      0|         return if_match(req, "numsp384d1", {1, 3, 6, 1, 4, 1, 25258, 4, 2});
  770|      0|      case 0x08A92:
  ------------------
  |  Branch (770:7): [True: 0, False: 1]
  ------------------
  771|      0|         return if_match(req, "RSA/PKCS1v15(SHA-1)", {1, 2, 840, 113549, 1, 1, 5});
  772|      0|      case 0x09EA0:
  ------------------
  |  Branch (772:7): [True: 0, False: 1]
  ------------------
  773|      0|         return if_match(req, "DES/CBC", {1, 3, 14, 3, 2, 7});
  774|      0|      case 0x0B2D6:
  ------------------
  |  Branch (774:7): [True: 0, False: 1]
  ------------------
  775|      0|         return if_match(req, "ECDSA/SHA-3(512)", {2, 16, 840, 1, 101, 3, 4, 3, 12});
  776|      0|      case 0x0BA72:
  ------------------
  |  Branch (776:7): [True: 0, False: 1]
  ------------------
  777|      0|         return if_match(req, "SphincsPlus-sha2-128s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 1});
  778|      0|      case 0x0BE23:
  ------------------
  |  Branch (778:7): [True: 0, False: 1]
  ------------------
  779|      0|         return if_match(req, "ECGDSA", {1, 3, 36, 3, 3, 2, 5, 2, 1});
  780|      0|      case 0x0C109:
  ------------------
  |  Branch (780:7): [True: 0, False: 1]
  ------------------
  781|      0|         return if_match(req, "PKCS9.FriendlyName", {1, 2, 840, 113549, 1, 9, 20});
  782|      0|      case 0x0D012:
  ------------------
  |  Branch (782:7): [True: 0, False: 1]
  ------------------
  783|      0|         return if_match(req, "SphincsPlus-shake-128s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 1});
  784|      0|      case 0x0DCE9:
  ------------------
  |  Branch (784:7): [True: 0, False: 1]
  ------------------
  785|      0|         return if_match(req, "ClassicMcEliece_8192128f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 10});
  786|      1|      case 0x0E52A:
  ------------------
  |  Branch (786:7): [True: 1, False: 0]
  ------------------
  787|      1|         return if_match(req, "numsp512d1", {1, 3, 6, 1, 4, 1, 25258, 4, 3});
  788|      0|      case 0x0F9CC:
  ------------------
  |  Branch (788:7): [True: 0, False: 1]
  ------------------
  789|      0|         return if_match(req, "PKCS9.UnstructuredName", {1, 2, 840, 113549, 1, 9, 2});
  790|      0|      case 0x0FF45:
  ------------------
  |  Branch (790:7): [True: 0, False: 1]
  ------------------
  791|      0|         return if_match(req, "Camellia-256/GCM", {0, 3, 4401, 5, 3, 1, 9, 46});
  792|      0|      case 0x1033D:
  ------------------
  |  Branch (792:7): [True: 0, False: 1]
  ------------------
  793|      0|         return if_match(req, "DSA/SHA-3(384)", {2, 16, 840, 1, 101, 3, 4, 3, 7});
  794|      0|      case 0x1139D:
  ------------------
  |  Branch (794:7): [True: 0, False: 1]
  ------------------
  795|      0|         return if_match(req, "secp192k1", {1, 3, 132, 0, 31});
  796|      0|      case 0x113D6:
  ------------------
  |  Branch (796:7): [True: 0, False: 1]
  ------------------
  797|      0|         return if_match(req, "X520.DNQualifier", {2, 5, 4, 46});
  798|      0|      case 0x11A7A:
  ------------------
  |  Branch (798:7): [True: 0, False: 1]
  ------------------
  799|      0|         return if_match(req, "secp192r1", {1, 2, 840, 10045, 3, 1, 1});
  800|      0|      case 0x12096:
  ------------------
  |  Branch (800:7): [True: 0, False: 1]
  ------------------
  801|      0|         return if_match(req, "SM2_Kex", {1, 2, 156, 10197, 1, 301, 2});
  802|      0|      case 0x13FC1:
  ------------------
  |  Branch (802:7): [True: 0, False: 1]
  ------------------
  803|      0|         return if_match(req, "X520.GenerationalQualifier", {2, 5, 4, 44});
  804|      0|      case 0x1445B:
  ------------------
  |  Branch (804:7): [True: 0, False: 1]
  ------------------
  805|      0|         return if_match(req, "PKCS5.PBKDF2", {1, 2, 840, 113549, 1, 5, 12});
  806|      0|      case 0x1495D:
  ------------------
  |  Branch (806:7): [True: 0, False: 1]
  ------------------
  807|      0|         return if_match(req, "eFrodoKEM-1344-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 17, 3});
  808|      0|      case 0x14E30:
  ------------------
  |  Branch (808:7): [True: 0, False: 1]
  ------------------
  809|      0|         return if_match(req, "ClassicMcEliece_460896", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 3});
  810|      0|      case 0x14FB1:
  ------------------
  |  Branch (810:7): [True: 0, False: 1]
  ------------------
  811|      0|         return if_match(req, "XMSS-draft12", {1, 3, 6, 1, 4, 1, 25258, 1, 8});
  812|      0|      case 0x156E3:
  ------------------
  |  Branch (812:7): [True: 0, False: 1]
  ------------------
  813|      0|         return if_match(req, "Compression.Zlib", {1, 2, 840, 113549, 1, 9, 16, 3, 8});
  814|      0|      case 0x1579E:
  ------------------
  |  Branch (814:7): [True: 0, False: 1]
  ------------------
  815|      0|         return if_match(req, "Streebog-512", {1, 2, 643, 7, 1, 1, 2, 3});
  816|      0|      case 0x1701A:
  ------------------
  |  Branch (816:7): [True: 0, False: 1]
  ------------------
  817|      0|         return if_match(req, "X509v3.AnyExtendedKeyUsage", {2, 5, 29, 37, 0});
  818|      0|      case 0x175EF:
  ------------------
  |  Branch (818:7): [True: 0, False: 1]
  ------------------
  819|      0|         return if_match(req, "Kyber-1024-90s-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 11, 3});
  820|      0|      case 0x17709:
  ------------------
  |  Branch (820:7): [True: 0, False: 1]
  ------------------
  821|      0|         return if_match(req, "X520.GivenName", {2, 5, 4, 42});
  822|      0|      case 0x17AD9:
  ------------------
  |  Branch (822:7): [True: 0, False: 1]
  ------------------
  823|      0|         return if_match(req, "RSA/PKCS1v15(SM3)", {1, 2, 156, 10197, 1, 504});
  824|      0|      case 0x17CE2:
  ------------------
  |  Branch (824:7): [True: 0, False: 1]
  ------------------
  825|      0|         return if_match(req, "SLH-DSA-SHA2-256f", {2, 16, 840, 1, 101, 3, 4, 3, 25});
  826|      0|      case 0x17CEF:
  ------------------
  |  Branch (826:7): [True: 0, False: 1]
  ------------------
  827|      0|         return if_match(req, "SLH-DSA-SHA2-256s", {2, 16, 840, 1, 101, 3, 4, 3, 24});
  828|      0|      case 0x18618:
  ------------------
  |  Branch (828:7): [True: 0, False: 1]
  ------------------
  829|      0|         return if_match(req, "FrodoKEM-976-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 15, 2});
  830|      0|      case 0x19480:
  ------------------
  |  Branch (830:7): [True: 0, False: 1]
  ------------------
  831|      0|         return if_match(req, "eFrodoKEM-1344-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 16, 3});
  832|      0|      case 0x1958A:
  ------------------
  |  Branch (832:7): [True: 0, False: 1]
  ------------------
  833|      0|         return if_match(req, "X509v3.InvalidityDate", {2, 5, 29, 24});
  834|      0|      case 0x19851:
  ------------------
  |  Branch (834:7): [True: 0, False: 1]
  ------------------
  835|      0|         return if_match(req, "DSA/SHA-1", {1, 2, 840, 10040, 4, 3});
  836|      0|      case 0x1B2E7:
  ------------------
  |  Branch (836:7): [True: 0, False: 1]
  ------------------
  837|      0|         return if_match(req, "KeyWrap.AES-128", {2, 16, 840, 1, 101, 3, 4, 1, 5});
  838|      0|      case 0x1B9BE:
  ------------------
  |  Branch (838:7): [True: 0, False: 1]
  ------------------
  839|      0|         return if_match(req, "KeyWrap.AES-192", {2, 16, 840, 1, 101, 3, 4, 1, 25});
  840|      0|      case 0x1D439:
  ------------------
  |  Branch (840:7): [True: 0, False: 1]
  ------------------
  841|      0|         return if_match(req, "SphincsPlus-haraka-192f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 4});
  842|      0|      case 0x2065B:
  ------------------
  |  Branch (842:7): [True: 0, False: 1]
  ------------------
  843|      0|         return if_match(req, "KeyWrap.CAST-128", {1, 2, 840, 113533, 7, 66, 15});
  844|      0|      case 0x216A0:
  ------------------
  |  Branch (844:7): [True: 0, False: 1]
  ------------------
  845|      0|         return if_match(req, "ML-KEM-512", {2, 16, 840, 1, 101, 3, 4, 4, 1});
  846|      0|      case 0x2216B:
  ------------------
  |  Branch (846:7): [True: 0, False: 1]
  ------------------
  847|      0|         return if_match(req, "GOST-34.10-2012-512", {1, 2, 643, 7, 1, 1, 1, 2});
  848|      0|      case 0x22C2C:
  ------------------
  |  Branch (848:7): [True: 0, False: 1]
  ------------------
  849|      0|         return if_match(req, "ElGamal", {1, 3, 6, 1, 4, 1, 3029, 1, 2, 1});
  850|      0|      case 0x2559A:
  ------------------
  |  Branch (850:7): [True: 0, False: 1]
  ------------------
  851|      0|         return if_match(req, "X520.Initials", {2, 5, 4, 43});
  852|      0|      case 0x271AC:
  ------------------
  |  Branch (852:7): [True: 0, False: 1]
  ------------------
  853|      0|         return if_match(req, "PKIX.AutonomousSysIds", {1, 3, 6, 1, 5, 5, 7, 1, 8});
  854|      0|      case 0x2808B:
  ------------------
  |  Branch (854:7): [True: 0, False: 1]
  ------------------
  855|      0|         return if_match(req, "PKCS7.Data", {1, 2, 840, 113549, 1, 7, 1});
  856|      0|      case 0x281B8:
  ------------------
  |  Branch (856:7): [True: 0, False: 1]
  ------------------
  857|      0|         return if_match(req, "SphincsPlus-haraka-128s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 1});
  858|      0|      case 0x29999:
  ------------------
  |  Branch (858:7): [True: 0, False: 1]
  ------------------
  859|      0|         return if_match(req, "DSA/SHA-3(256)", {2, 16, 840, 1, 101, 3, 4, 3, 6});
  860|      0|      case 0x2A83D:
  ------------------
  |  Branch (860:7): [True: 0, False: 1]
  ------------------
  861|      0|         return if_match(req, "SHA-224", {2, 16, 840, 1, 101, 3, 4, 2, 4});
  862|      0|      case 0x2AB30:
  ------------------
  |  Branch (862:7): [True: 0, False: 1]
  ------------------
  863|      0|         return if_match(req, "SHA-256", {2, 16, 840, 1, 101, 3, 4, 2, 1});
  864|      0|      case 0x2ABEF:
  ------------------
  |  Branch (864:7): [True: 0, False: 1]
  ------------------
  865|      0|         return if_match(req, "KeyWrap.AES-256", {2, 16, 840, 1, 101, 3, 4, 1, 45});
  866|      0|      case 0x2BAEF:
  ------------------
  |  Branch (866:7): [True: 0, False: 1]
  ------------------
  867|      0|         return if_match(req, "SM2_Sig/SM3", {1, 2, 156, 10197, 1, 501});
  868|      0|      case 0x2C39A:
  ------------------
  |  Branch (868:7): [True: 0, False: 1]
  ------------------
  869|      0|         return if_match(req, "ECGDSA/RIPEMD-160", {1, 3, 36, 3, 3, 2, 5, 4, 1});
  870|      0|      case 0x2C54F:
  ------------------
  |  Branch (870:7): [True: 0, False: 1]
  ------------------
  871|      0|         return if_match(req, "ECDSA/SHA-3(224)", {2, 16, 840, 1, 101, 3, 4, 3, 9});
  872|      0|      case 0x2EEA6:
  ------------------
  |  Branch (872:7): [True: 0, False: 1]
  ------------------
  873|      0|         return if_match(req, "RSA/PKCS1v15(RIPEMD-160)", {1, 3, 36, 3, 3, 1, 2});
  874|      0|      case 0x2EFBA:
  ------------------
  |  Branch (874:7): [True: 0, False: 1]
  ------------------
  875|      0|         return if_match(req, "Kyber-512-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 7, 1});
  876|      0|      case 0x2F0AD:
  ------------------
  |  Branch (876:7): [True: 0, False: 1]
  ------------------
  877|      0|         return if_match(req, "PKCS7.EncryptedData", {1, 2, 840, 113549, 1, 7, 6});
  878|      0|      case 0x2F219:
  ------------------
  |  Branch (878:7): [True: 0, False: 1]
  ------------------
  879|      0|         return if_match(req, "PBE-SHA1-2DES", {1, 2, 840, 113549, 1, 12, 1, 4});
  880|      0|      case 0x3133E:
  ------------------
  |  Branch (880:7): [True: 0, False: 1]
  ------------------
  881|      0|         return if_match(req, "SLH-DSA-SHA2-128f", {2, 16, 840, 1, 101, 3, 4, 3, 21});
  882|      0|      case 0x3134B:
  ------------------
  |  Branch (882:7): [True: 0, False: 1]
  ------------------
  883|      0|         return if_match(req, "SLH-DSA-SHA2-128s", {2, 16, 840, 1, 101, 3, 4, 3, 20});
  884|      0|      case 0x3160D:
  ------------------
  |  Branch (884:7): [True: 0, False: 1]
  ------------------
  885|      0|         return if_match(req, "RSA/PKCS1v15(SHA-3(224))", {2, 16, 840, 1, 101, 3, 4, 3, 13});
  886|      0|      case 0x319E0:
  ------------------
  |  Branch (886:7): [True: 0, False: 1]
  ------------------
  887|      0|         return if_match(req, "GOST-34.10-2012-256/Streebog-256", {1, 2, 643, 7, 1, 1, 3, 2});
  888|      0|      case 0x31B3D:
  ------------------
  |  Branch (888:7): [True: 0, False: 1]
  ------------------
  889|      0|         return if_match(req, "HMAC(SHA-512)", {1, 2, 840, 113549, 2, 11});
  890|      0|      case 0x31C6D:
  ------------------
  |  Branch (890:7): [True: 0, False: 1]
  ------------------
  891|      0|         return if_match(req, "secp384r1", {1, 3, 132, 0, 34});
  892|      0|      case 0x32899:
  ------------------
  |  Branch (892:7): [True: 0, False: 1]
  ------------------
  893|      0|         return if_match(req, "TripleDES/CBC", {1, 2, 840, 113549, 3, 7});
  894|      0|      case 0x33D04:
  ------------------
  |  Branch (894:7): [True: 0, False: 1]
  ------------------
  895|      0|         return if_match(req, "PKCS12.SecretBag", {1, 2, 840, 113549, 1, 12, 10, 1, 5});
  896|      0|      case 0x3615D:
  ------------------
  |  Branch (896:7): [True: 0, False: 1]
  ------------------
  897|      0|         return if_match(req, "FrodoKEM-976-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 14, 2});
  898|      0|      case 0x361B8:
  ------------------
  |  Branch (898:7): [True: 0, False: 1]
  ------------------
  899|      0|         return if_match(req, "Ed25519", {1, 3, 101, 112});
  900|      0|      case 0x3649D:
  ------------------
  |  Branch (900:7): [True: 0, False: 1]
  ------------------
  901|      0|         return if_match(req, "SHAKE-128", {2, 16, 840, 1, 101, 3, 4, 2, 11});
  902|      0|      case 0x36693:
  ------------------
  |  Branch (902:7): [True: 0, False: 1]
  ------------------
  903|      0|         return if_match(req, "ClassicMcEliece_348864", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 1});
  904|      0|      case 0x373C7:
  ------------------
  |  Branch (904:7): [True: 0, False: 1]
  ------------------
  905|      0|         return if_match(req, "ML-DSA-4x4", {2, 16, 840, 1, 101, 3, 4, 3, 17});
  906|      0|      case 0x3750B:
  ------------------
  |  Branch (906:7): [True: 0, False: 1]
  ------------------
  907|      0|         return if_match(req, "ClassicMcEliece_8192128", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 9});
  908|      0|      case 0x39890:
  ------------------
  |  Branch (908:7): [True: 0, False: 1]
  ------------------
  909|      0|         return if_match(req, "Ed448", {1, 3, 101, 113});
  910|      0|      case 0x3A438:
  ------------------
  |  Branch (910:7): [True: 0, False: 1]
  ------------------
  911|      0|         return if_match(req, "SHA-384", {2, 16, 840, 1, 101, 3, 4, 2, 2});
  912|      0|      case 0x3A963:
  ------------------
  |  Branch (912:7): [True: 0, False: 1]
  ------------------
  913|      0|         return if_match(req, "DH", {1, 2, 840, 10046, 2, 1});
  914|      0|      case 0x3AC83:
  ------------------
  |  Branch (914:7): [True: 0, False: 1]
  ------------------
  915|      0|         return if_match(req, "MGF1", {1, 2, 840, 113549, 1, 1, 8});
  916|      0|      case 0x3ACBA:
  ------------------
  |  Branch (916:7): [True: 0, False: 1]
  ------------------
  917|      0|         return if_match(req, "X509v3.IssuerAlternativeName", {2, 5, 29, 18});
  918|      0|      case 0x3B273:
  ------------------
  |  Branch (918:7): [True: 0, False: 1]
  ------------------
  919|      0|         return if_match(req, "KeyWrap.TripleDES", {1, 2, 840, 113549, 1, 9, 16, 3, 6});
  920|      0|      case 0x3B91E:
  ------------------
  |  Branch (920:7): [True: 0, False: 1]
  ------------------
  921|      0|         return if_match(req, "X509v3.PrivateKeyUsagePeriod", {2, 5, 29, 16});
  922|      0|      case 0x3BC8A:
  ------------------
  |  Branch (922:7): [True: 0, False: 1]
  ------------------
  923|      0|         return if_match(req, "SLH-DSA-SHAKE-192f", {2, 16, 840, 1, 101, 3, 4, 3, 29});
  924|      0|      case 0x3BC97:
  ------------------
  |  Branch (924:7): [True: 0, False: 1]
  ------------------
  925|      0|         return if_match(req, "SLH-DSA-SHAKE-192s", {2, 16, 840, 1, 101, 3, 4, 3, 28});
  926|      0|      case 0x3D127:
  ------------------
  |  Branch (926:7): [True: 0, False: 1]
  ------------------
  927|      0|         return if_match(req, "DSA", {1, 2, 840, 10040, 4, 1});
  928|      0|      case 0x3E249:
  ------------------
  |  Branch (928:7): [True: 0, False: 1]
  ------------------
  929|      0|         return if_match(req, "HSS-LMS", {1, 2, 840, 113549, 1, 9, 16, 3, 17});
  930|      0|      case 0x3E7D5:
  ------------------
  |  Branch (930:7): [True: 0, False: 1]
  ------------------
  931|      0|         return if_match(req, "RSA/PKCS1v15(SHA-3(256))", {2, 16, 840, 1, 101, 3, 4, 3, 14});
  932|      0|      case 0x3F748:
  ------------------
  |  Branch (932:7): [True: 0, False: 1]
  ------------------
  933|      0|         return if_match(req, "GOST.OGRN", {1, 2, 643, 100, 1});
  934|      0|      case 0x3F99F:
  ------------------
  |  Branch (934:7): [True: 0, False: 1]
  ------------------
  935|      0|         return if_match(req, "X509v3.BasicConstraints", {2, 5, 29, 19});
  936|      0|      case 0x40726:
  ------------------
  |  Branch (936:7): [True: 0, False: 1]
  ------------------
  937|      0|         return if_match(req, "SHA-3(512)", {2, 16, 840, 1, 101, 3, 4, 2, 10});
  938|      0|      case 0x407BF:
  ------------------
  |  Branch (938:7): [True: 0, False: 1]
  ------------------
  939|      0|         return if_match(req, "ML-KEM-768", {2, 16, 840, 1, 101, 3, 4, 4, 2});
  940|      0|      case 0x41334:
  ------------------
  |  Branch (940:7): [True: 0, False: 1]
  ------------------
  941|      0|         return if_match(req, "ECDSA/SHA-3(384)", {2, 16, 840, 1, 101, 3, 4, 3, 11});
  942|      0|      case 0x42DF3:
  ------------------
  |  Branch (942:7): [True: 0, False: 1]
  ------------------
  943|      0|         return if_match(req, "X509v3.CRLDistributionPoints", {2, 5, 29, 31});
  944|      0|      case 0x437FB:
  ------------------
  |  Branch (944:7): [True: 0, False: 1]
  ------------------
  945|      0|         return if_match(req, "brainpool160r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 1});
  946|      0|      case 0x441F5:
  ------------------
  |  Branch (946:7): [True: 0, False: 1]
  ------------------
  947|      0|         return if_match(req, "gost_256A", {1, 2, 643, 7, 1, 2, 1, 1, 1});
  948|      0|      case 0x441F6:
  ------------------
  |  Branch (948:7): [True: 0, False: 1]
  ------------------
  949|      0|         return if_match(req, "gost_256B", {1, 2, 643, 7, 1, 2, 1, 1, 2});
  950|      0|      case 0x44221:
  ------------------
  |  Branch (950:7): [True: 0, False: 1]
  ------------------
  951|      0|         return if_match(req, "GOST-34.10-2012-512/Streebog-512", {1, 2, 643, 7, 1, 1, 3, 3});
  952|      0|      case 0x44322:
  ------------------
  |  Branch (952:7): [True: 0, False: 1]
  ------------------
  953|      0|         return if_match(req, "ClassicMcEliece_6960119pc", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 3});
  954|      0|      case 0x44973:
  ------------------
  |  Branch (954:7): [True: 0, False: 1]
  ------------------
  955|      0|         return if_match(req, "Kyber-512-90s-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 11, 1});
  956|      0|      case 0x45C27:
  ------------------
  |  Branch (956:7): [True: 0, False: 1]
  ------------------
  957|      0|         return if_match(req, "RSA/PKCS1v15(SHA-512-256)", {1, 2, 840, 113549, 1, 1, 16});
  958|      0|      case 0x45C85:
  ------------------
  |  Branch (958:7): [True: 0, False: 1]
  ------------------
  959|      0|         return if_match(req, "X509v3.ReasonCode", {2, 5, 29, 21});
  960|      0|      case 0x45DA5:
  ------------------
  |  Branch (960:7): [True: 0, False: 1]
  ------------------
  961|      0|         return if_match(req, "SHAKE-256", {2, 16, 840, 1, 101, 3, 4, 2, 12});
  962|      0|      case 0x4663C:
  ------------------
  |  Branch (962:7): [True: 0, False: 1]
  ------------------
  963|      0|         return if_match(req, "X509v3.PolicyConstraints", {2, 5, 29, 36});
  964|      0|      case 0x480F7:
  ------------------
  |  Branch (964:7): [True: 0, False: 1]
  ------------------
  965|      0|         return if_match(req, "Serpent/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 4});
  966|      0|      case 0x48627:
  ------------------
  |  Branch (966:7): [True: 0, False: 1]
  ------------------
  967|      0|         return if_match(req, "Dilithium-4x4-AES-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 10, 1});
  968|      0|      case 0x48861:
  ------------------
  |  Branch (968:7): [True: 0, False: 1]
  ------------------
  969|      0|         return if_match(req, "ChaCha20Poly1305", {1, 2, 840, 113549, 1, 9, 16, 3, 18});
  970|      0|      case 0x4A292:
  ------------------
  |  Branch (970:7): [True: 0, False: 1]
  ------------------
  971|      0|         return if_match(req, "frp256v1", {1, 2, 250, 1, 223, 101, 256, 1});
  972|      0|      case 0x4A9EE:
  ------------------
  |  Branch (972:7): [True: 0, False: 1]
  ------------------
  973|      0|         return if_match(req, "ClassicMcEliece_6960119f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 8});
  974|      0|      case 0x4BF87:
  ------------------
  |  Branch (974:7): [True: 0, False: 1]
  ------------------
  975|      0|         return if_match(req, "PKIX.TNAuthList", {1, 3, 6, 1, 5, 5, 7, 1, 26});
  976|      0|      case 0x4C088:
  ------------------
  |  Branch (976:7): [True: 0, False: 1]
  ------------------
  977|      0|         return if_match(req, "eFrodoKEM-976-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 17, 2});
  978|      0|      case 0x4C513:
  ------------------
  |  Branch (978:7): [True: 0, False: 1]
  ------------------
  979|      0|         return if_match(req, "DSA/SHA-224", {2, 16, 840, 1, 101, 3, 4, 3, 1});
  980|      0|      case 0x4C806:
  ------------------
  |  Branch (980:7): [True: 0, False: 1]
  ------------------
  981|      0|         return if_match(req, "DSA/SHA-256", {2, 16, 840, 1, 101, 3, 4, 3, 2});
  982|      0|      case 0x4D740:
  ------------------
  |  Branch (982:7): [True: 0, False: 1]
  ------------------
  983|      0|         return if_match(req, "X509v3.AnyPolicy", {2, 5, 29, 32, 0});
  984|      0|      case 0x4DE49:
  ------------------
  |  Branch (984:7): [True: 0, False: 1]
  ------------------
  985|      0|         return if_match(req, "RSA/PKCS1v15(SHA-512)", {1, 2, 840, 113549, 1, 1, 13});
  986|      0|      case 0x4ED5D:
  ------------------
  |  Branch (986:7): [True: 0, False: 1]
  ------------------
  987|      0|         return if_match(req, "CAST-128/CBC", {1, 2, 840, 113533, 7, 66, 10});
  988|      0|      case 0x4FCDC:
  ------------------
  |  Branch (988:7): [True: 0, False: 1]
  ------------------
  989|      0|         return if_match(req, "RSA", {1, 2, 840, 113549, 1, 1, 1});
  990|      0|      case 0x501CB:
  ------------------
  |  Branch (990:7): [True: 0, False: 1]
  ------------------
  991|      0|         return if_match(req, "ECDSA/SHA-224", {1, 2, 840, 10045, 4, 3, 1});
  992|      0|      case 0x50395:
  ------------------
  |  Branch (992:7): [True: 0, False: 1]
  ------------------
  993|      0|         return if_match(req, "GOST-34.10/GOST-R-34.11-94", {1, 2, 643, 2, 2, 3});
  994|      0|      case 0x504BE:
  ------------------
  |  Branch (994:7): [True: 0, False: 1]
  ------------------
  995|      0|         return if_match(req, "ECDSA/SHA-256", {1, 2, 840, 10045, 4, 3, 2});
  996|      0|      case 0x509C3:
  ------------------
  |  Branch (996:7): [True: 0, False: 1]
  ------------------
  997|      0|         return if_match(req, "brainpool192r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 3});
  998|      0|      case 0x509F9:
  ------------------
  |  Branch (998:7): [True: 0, False: 1]
  ------------------
  999|      0|         return if_match(req, "PKCS9.ContentType", {1, 2, 840, 113549, 1, 9, 3});
 1000|      0|      case 0x50B26:
  ------------------
  |  Branch (1000:7): [True: 0, False: 1]
  ------------------
 1001|      0|         return if_match(req, "FrodoKEM-640-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 15, 1});
 1002|      0|      case 0x50D78:
  ------------------
  |  Branch (1002:7): [True: 0, False: 1]
  ------------------
 1003|      0|         return if_match(req, "x962_p192v2", {1, 2, 840, 10045, 3, 1, 2});
 1004|      0|      case 0x50D79:
  ------------------
  |  Branch (1004:7): [True: 0, False: 1]
  ------------------
 1005|      0|         return if_match(req, "x962_p192v3", {1, 2, 840, 10045, 3, 1, 3});
 1006|      0|      case 0x51DC6:
  ------------------
  |  Branch (1006:7): [True: 0, False: 1]
  ------------------
 1007|      0|         return if_match(req, "AES-128/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 1});
 1008|      0|      case 0x52DB6:
  ------------------
  |  Branch (1008:7): [True: 0, False: 1]
  ------------------
 1009|      0|         return if_match(req, "HMAC(SHA-224)", {1, 2, 840, 113549, 2, 8});
 1010|      0|      case 0x53E11:
  ------------------
  |  Branch (1010:7): [True: 0, False: 1]
  ------------------
 1011|      0|         return if_match(req, "FrodoKEM-1344-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 14, 3});
 1012|      0|      case 0x54012:
  ------------------
  |  Branch (1012:7): [True: 0, False: 1]
  ------------------
 1013|      0|         return if_match(req, "PKIX.TimeStamping", {1, 3, 6, 1, 5, 5, 7, 3, 8});
 1014|      0|      case 0x5407A:
  ------------------
  |  Branch (1014:7): [True: 0, False: 1]
  ------------------
 1015|      0|         return if_match(req, "Serpent/CBC", {1, 3, 6, 1, 4, 1, 25258, 3, 1});
 1016|      0|      case 0x5576D:
  ------------------
  |  Branch (1016:7): [True: 0, False: 1]
  ------------------
 1017|      0|         return if_match(req, "SphincsPlus-sha2-128f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 2});
 1018|      0|      case 0x55EF6:
  ------------------
  |  Branch (1018:7): [True: 0, False: 1]
  ------------------
 1019|      0|         return if_match(req, "AES-192/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 2});
 1020|      0|      case 0x55FFA:
  ------------------
  |  Branch (1020:7): [True: 0, False: 1]
  ------------------
 1021|      0|         return if_match(req, "ML-DSA-6x5", {2, 16, 840, 1, 101, 3, 4, 3, 18});
 1022|      0|      case 0x56826:
  ------------------
  |  Branch (1022:7): [True: 0, False: 1]
  ------------------
 1023|      0|         return if_match(req, "brainpool320r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 9});
 1024|      0|      case 0x56D0D:
  ------------------
  |  Branch (1024:7): [True: 0, False: 1]
  ------------------
 1025|      0|         return if_match(req, "SphincsPlus-shake-128f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 2});
 1026|      0|      case 0x57077:
  ------------------
  |  Branch (1026:7): [True: 0, False: 1]
  ------------------
 1027|      0|         return if_match(req, "XMSS-draft6", {1, 3, 6, 1, 4, 1, 25258, 1, 5});
 1028|      0|      case 0x5818B:
  ------------------
  |  Branch (1028:7): [True: 0, False: 1]
  ------------------
 1029|      0|         return if_match(req, "ECGDSA/SHA-224", {1, 3, 36, 3, 3, 2, 5, 4, 3});
 1030|      0|      case 0x5847E:
  ------------------
  |  Branch (1030:7): [True: 0, False: 1]
  ------------------
 1031|      0|         return if_match(req, "ECGDSA/SHA-256", {1, 3, 36, 3, 3, 2, 5, 4, 4});
 1032|      0|      case 0x5898B:
  ------------------
  |  Branch (1032:7): [True: 0, False: 1]
  ------------------
 1033|      0|         return if_match(req, "SHA-512", {2, 16, 840, 1, 101, 3, 4, 2, 3});
 1034|      0|      case 0x58991:
  ------------------
  |  Branch (1034:7): [True: 0, False: 1]
  ------------------
 1035|      0|         return if_match(req, "PKIX.OCSP.NoCheck", {1, 3, 6, 1, 5, 5, 7, 48, 1, 5});
 1036|      0|      case 0x59717:
  ------------------
  |  Branch (1036:7): [True: 0, False: 1]
  ------------------
 1037|      0|         return if_match(req, "X509v3.SubjectKeyIdentifier", {2, 5, 29, 14});
 1038|      0|      case 0x5A1E1:
  ------------------
  |  Branch (1038:7): [True: 0, False: 1]
  ------------------
 1039|      0|         return if_match(req, "PKCS12.KeyBag", {1, 2, 840, 113549, 1, 12, 10, 1, 1});
 1040|      0|      case 0x5A570:
  ------------------
  |  Branch (1040:7): [True: 0, False: 1]
  ------------------
 1041|      0|         return if_match(req, "X520.CommonName", {2, 5, 4, 3});
 1042|      0|      case 0x5A990:
  ------------------
  |  Branch (1042:7): [True: 0, False: 1]
  ------------------
 1043|      0|         return if_match(req, "ECDSA/SHA-3(256)", {2, 16, 840, 1, 101, 3, 4, 3, 10});
 1044|      0|      case 0x5AB0E:
  ------------------
  |  Branch (1044:7): [True: 0, False: 1]
  ------------------
 1045|      0|         return if_match(req, "SphincsPlus-sha2-256s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 5});
 1046|      0|      case 0x5AC4A:
  ------------------
  |  Branch (1046:7): [True: 0, False: 1]
  ------------------
 1047|      0|         return if_match(req, "X520.Surname", {2, 5, 4, 4});
 1048|      0|      case 0x5AF2C:
  ------------------
  |  Branch (1048:7): [True: 0, False: 1]
  ------------------
 1049|      0|         return if_match(req, "ClassicMcEliece_8192128pc", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 5});
 1050|      0|      case 0x5BC39:
  ------------------
  |  Branch (1050:7): [True: 0, False: 1]
  ------------------
 1051|      0|         return if_match(req, "X509v3.KeyUsage", {2, 5, 29, 15});
 1052|      0|      case 0x5BDDB:
  ------------------
  |  Branch (1052:7): [True: 0, False: 1]
  ------------------
 1053|      0|         return if_match(req, "numsp256d1", {1, 3, 6, 1, 4, 1, 25258, 4, 1});
 1054|      0|      case 0x5C0AE:
  ------------------
  |  Branch (1054:7): [True: 0, False: 1]
  ------------------
 1055|      0|         return if_match(req, "SphincsPlus-shake-256s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 5});
 1056|      0|      case 0x5C10E:
  ------------------
  |  Branch (1056:7): [True: 0, False: 1]
  ------------------
 1057|      0|         return if_match(req, "DSA/SHA-384", {2, 16, 840, 1, 101, 3, 4, 3, 3});
 1058|      0|      case 0x5CFE5:
  ------------------
  |  Branch (1058:7): [True: 0, False: 1]
  ------------------
 1059|      0|         return if_match(req, "PKCS9.X509Certificate", {1, 2, 840, 113549, 1, 9, 22, 1});
 1060|      0|      case 0x5D1CF:
  ------------------
  |  Branch (1060:7): [True: 0, False: 1]
  ------------------
 1061|      0|         return if_match(req, "X520.SerialNumber", {2, 5, 4, 5});
 1062|      0|      case 0x5D375:
  ------------------
  |  Branch (1062:7): [True: 0, False: 1]
  ------------------
 1063|      0|         return if_match(req, "SM4/OCB", {1, 2, 156, 10197, 1, 104, 100});
 1064|      0|      case 0x5DD49:
  ------------------
  |  Branch (1064:7): [True: 0, False: 1]
  ------------------
 1065|      0|         return if_match(req, "AES-128/CBC", {2, 16, 840, 1, 101, 3, 4, 1, 2});
 1066|      0|      case 0x5DE4E:
  ------------------
  |  Branch (1066:7): [True: 0, False: 1]
  ------------------
 1067|      0|         return if_match(req, "AES-128/CCM", {2, 16, 840, 1, 101, 3, 4, 1, 7});
 1068|      0|      case 0x5DF23:
  ------------------
  |  Branch (1068:7): [True: 0, False: 1]
  ------------------
 1069|      0|         return if_match(req, "HMAC(SHA-512-256)", {1, 2, 840, 113549, 2, 13});
 1070|      0|      case 0x5ED04:
  ------------------
  |  Branch (1070:7): [True: 0, False: 1]
  ------------------
 1071|      0|         return if_match(req, "SM2", {1, 2, 156, 10197, 1, 301, 1});
 1072|      0|      case 0x5ED05:
  ------------------
  |  Branch (1072:7): [True: 0, False: 1]
  ------------------
 1073|      0|         return if_match(req, "SM3", {1, 2, 156, 10197, 1, 401});
 1074|      0|      case 0x5FDC6:
  ------------------
  |  Branch (1074:7): [True: 0, False: 1]
  ------------------
 1075|      0|         return if_match(req, "ECDSA/SHA-384", {1, 2, 840, 10045, 4, 3, 3});
 1076|      0|      case 0x6199F:
  ------------------
  |  Branch (1076:7): [True: 0, False: 1]
  ------------------
 1077|      0|         return if_match(req, "SHA-3(224)", {2, 16, 840, 1, 101, 3, 4, 2, 7});
 1078|      0|      case 0x61E79:
  ------------------
  |  Branch (1078:7): [True: 0, False: 1]
  ------------------
 1079|      0|         return if_match(req, "AES-192/CBC", {2, 16, 840, 1, 101, 3, 4, 1, 22});
 1080|      0|      case 0x61F7E:
  ------------------
  |  Branch (1080:7): [True: 0, False: 1]
  ------------------
 1081|      0|         return if_match(req, "AES-192/CCM", {2, 16, 840, 1, 101, 3, 4, 1, 27});
 1082|      0|      case 0x64947:
  ------------------
  |  Branch (1082:7): [True: 0, False: 1]
  ------------------
 1083|      0|         return if_match(req, "OpenPGP.Ed25519", {1, 3, 6, 1, 4, 1, 11591, 15, 1});
 1084|      0|      case 0x652E7:
  ------------------
  |  Branch (1084:7): [True: 0, False: 1]
  ------------------
 1085|      0|         return if_match(req, "sm2p256v1", {1, 2, 156, 10197, 1, 301});
 1086|      0|      case 0x6697B:
  ------------------
  |  Branch (1086:7): [True: 0, False: 1]
  ------------------
 1087|      0|         return if_match(req, "FrodoKEM-1344-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 15, 3});
 1088|      0|      case 0x67B2C:
  ------------------
  |  Branch (1088:7): [True: 0, False: 1]
  ------------------
 1089|      0|         return if_match(req, "X520.State", {2, 5, 4, 8});
 1090|      0|      case 0x67B9B:
  ------------------
  |  Branch (1090:7): [True: 0, False: 1]
  ------------------
 1091|      0|         return if_match(req, "HMAC(SHA-384)", {1, 2, 840, 113549, 2, 10});
 1092|      0|      case 0x67D86:
  ------------------
  |  Branch (1092:7): [True: 0, False: 1]
  ------------------
 1093|      0|         return if_match(req, "ECGDSA/SHA-384", {1, 3, 36, 3, 3, 2, 5, 4, 5});
 1094|      0|      case 0x68A0B:
  ------------------
  |  Branch (1094:7): [True: 0, False: 1]
  ------------------
 1095|      0|         return if_match(req, "Camellia-128/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 6});
 1096|      0|      case 0x68E33:
  ------------------
  |  Branch (1096:7): [True: 0, False: 1]
  ------------------
 1097|      0|         return if_match(req, "PKCS9.ExtensionRequest", {1, 2, 840, 113549, 1, 9, 14});
 1098|      0|      case 0x69126:
  ------------------
  |  Branch (1098:7): [True: 0, False: 1]
  ------------------
 1099|      0|         return if_match(req, "X509v3.SubjectAlternativeName", {2, 5, 29, 17});
 1100|      0|      case 0x692F8:
  ------------------
  |  Branch (1100:7): [True: 0, False: 1]
  ------------------
 1101|      0|         return if_match(req, "SM4/CBC", {1, 2, 156, 10197, 1, 104, 2});
 1102|      0|      case 0x695E1:
  ------------------
  |  Branch (1102:7): [True: 0, False: 1]
  ------------------
 1103|      0|         return if_match(req, "Dilithium-4x4-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 9, 1});
 1104|      0|      case 0x696DC:
  ------------------
  |  Branch (1104:7): [True: 0, False: 1]
  ------------------
 1105|      0|         return if_match(req, "PKIX.IpAddrBlocks", {1, 3, 6, 1, 5, 5, 7, 1, 7});
 1106|      0|      case 0x6A7CA:
  ------------------
  |  Branch (1106:7): [True: 0, False: 1]
  ------------------
 1107|      0|         return if_match(req, "ECDSA", {1, 2, 840, 10045, 2, 1});
 1108|      0|      case 0x6BD26:
  ------------------
  |  Branch (1108:7): [True: 0, False: 1]
  ------------------
 1109|      0|         return if_match(req, "GOST.INN", {1, 2, 643, 3, 131, 1, 1});
 1110|      0|      case 0x6CB3B:
  ------------------
  |  Branch (1110:7): [True: 0, False: 1]
  ------------------
 1111|      0|         return if_match(req, "Camellia-192/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 7});
 1112|      0|      case 0x6E602:
  ------------------
  |  Branch (1112:7): [True: 0, False: 1]
  ------------------
 1113|      0|         return if_match(req, "Dilithium-8x7-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 9, 3});
 1114|      0|      case 0x6F0C2:
  ------------------
  |  Branch (1114:7): [True: 0, False: 1]
  ------------------
 1115|      0|         return if_match(req, "RSA/PKCS1v15(SHA-224)", {1, 2, 840, 113549, 1, 1, 14});
 1116|      0|      case 0x6F9F8:
  ------------------
  |  Branch (1116:7): [True: 0, False: 1]
  ------------------
 1117|      0|         return if_match(req, "PKCS12.SafeContentsBag", {1, 2, 840, 113549, 1, 12, 10, 1, 6});
 1118|      0|      case 0x6FB26:
  ------------------
  |  Branch (1118:7): [True: 0, False: 1]
  ------------------
 1119|      0|         return if_match(req, "PKIX.AuthorityInformationAccess", {1, 3, 6, 1, 5, 5, 7, 1, 1});
 1120|      0|      case 0x70BB6:
  ------------------
  |  Branch (1120:7): [True: 0, False: 1]
  ------------------
 1121|      0|         return if_match(req, "brainpool384r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 11});
 1122|      0|      case 0x70EA6:
  ------------------
  |  Branch (1122:7): [True: 0, False: 1]
  ------------------
 1123|      0|         return if_match(req, "PKCS12.PKCS8ShroudedKeyBag", {1, 2, 840, 113549, 1, 12, 10, 1, 2});
 1124|      0|      case 0x71EB3:
  ------------------
  |  Branch (1124:7): [True: 0, False: 1]
  ------------------
 1125|      0|         return if_match(req, "SphincsPlus-haraka-128f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 2});
 1126|      0|      case 0x7382C:
  ------------------
  |  Branch (1126:7): [True: 0, False: 1]
  ------------------
 1127|      0|         return if_match(req, "ML-KEM-1024", {2, 16, 840, 1, 101, 3, 4, 4, 3});
 1128|      0|      case 0x743BD:
  ------------------
  |  Branch (1128:7): [True: 0, False: 1]
  ------------------
 1129|      0|         return if_match(req, "AES-256/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 3});
 1130|      0|      case 0x7498E:
  ------------------
  |  Branch (1130:7): [True: 0, False: 1]
  ------------------
 1131|      0|         return if_match(req, "Camellia-128/CBC", {1, 2, 392, 200011, 61, 1, 1, 1, 2});
 1132|      0|      case 0x74C2E:
  ------------------
  |  Branch (1132:7): [True: 0, False: 1]
  ------------------
 1133|      0|         return if_match(req, "ML-DSA-8x7", {2, 16, 840, 1, 101, 3, 4, 3, 19});
 1134|      0|      case 0x7505F:
  ------------------
  |  Branch (1134:7): [True: 0, False: 1]
  ------------------
 1135|      0|         return if_match(req, "PKIX.XMPPAddr", {1, 3, 6, 1, 5, 5, 7, 8, 5});
 1136|      0|      case 0x7517A:
  ------------------
  |  Branch (1136:7): [True: 0, False: 1]
  ------------------
 1137|      0|         return if_match(req, "RSA/PKCS1v15(MD2)", {1, 2, 840, 113549, 1, 1, 2});
 1138|      0|      case 0x7546B:
  ------------------
  |  Branch (1138:7): [True: 0, False: 1]
  ------------------
 1139|      0|         return if_match(req, "RSA/PKCS1v15(MD5)", {1, 2, 840, 113549, 1, 1, 4});
 1140|      0|      case 0x75921:
  ------------------
  |  Branch (1140:7): [True: 0, False: 1]
  ------------------
 1141|      0|         return if_match(req, "ClassicMcEliece_348864f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 2});
 1142|      0|      case 0x76784:
  ------------------
  |  Branch (1142:7): [True: 0, False: 1]
  ------------------
 1143|      0|         return if_match(req, "SHA-3(384)", {2, 16, 840, 1, 101, 3, 4, 2, 9});
 1144|      0|      case 0x768FD:
  ------------------
  |  Branch (1144:7): [True: 0, False: 1]
  ------------------
 1145|      0|         return if_match(req, "PKCS9.LocalKeyId", {1, 2, 840, 113549, 1, 9, 21});
 1146|      0|      case 0x76A19:
  ------------------
  |  Branch (1146:7): [True: 0, False: 1]
  ------------------
 1147|      0|         return if_match(req, "brainpool512r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 13});
 1148|      0|      case 0x77254:
  ------------------
  |  Branch (1148:7): [True: 0, False: 1]
  ------------------
 1149|      0|         return if_match(req, "SphincsPlus-haraka-256s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 5});
 1150|      0|      case 0x77ADC:
  ------------------
  |  Branch (1150:7): [True: 0, False: 1]
  ------------------
 1151|      0|         return if_match(req, "secp224k1", {1, 3, 132, 0, 32});
 1152|      0|      case 0x781B9:
  ------------------
  |  Branch (1152:7): [True: 0, False: 1]
  ------------------
 1153|      0|         return if_match(req, "secp224r1", {1, 3, 132, 0, 33});
 1154|      0|      case 0x78ABE:
  ------------------
  |  Branch (1154:7): [True: 0, False: 1]
  ------------------
 1155|      0|         return if_match(req, "Camellia-192/CBC", {1, 2, 392, 200011, 61, 1, 1, 1, 3});
 1156|      0|      case 0x792F2:
  ------------------
  |  Branch (1156:7): [True: 0, False: 1]
  ------------------
 1157|      0|         return if_match(req, "ClassicMcEliece_6688128pc", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 1});
 1158|      0|      case 0x7A661:
  ------------------
  |  Branch (1158:7): [True: 0, False: 1]
  ------------------
 1159|      0|         return if_match(req, "DSA/SHA-512", {2, 16, 840, 1, 101, 3, 4, 3, 4});
 1160|      0|      case 0x7A977:
  ------------------
  |  Branch (1160:7): [True: 0, False: 1]
  ------------------
 1161|      0|         return if_match(req, "X509v3.ExtendedKeyUsage", {2, 5, 29, 37});
 1162|      0|      case 0x7AE67:
  ------------------
  |  Branch (1162:7): [True: 0, False: 1]
  ------------------
 1163|      0|         return if_match(req, "SM2_Enc", {1, 2, 156, 10197, 1, 301, 3});
 1164|      0|      case 0x7B602:
  ------------------
  |  Branch (1164:7): [True: 0, False: 1]
  ------------------
 1165|      0|         return if_match(req, "Twofish/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 5});
 1166|      0|      case 0x7B9A1:
  ------------------
  |  Branch (1166:7): [True: 0, False: 1]
  ------------------
 1167|      0|         return if_match(req, "SphincsPlus-sha2-192s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 3});
 1168|      0|      case 0x7BB0A:
  ------------------
  |  Branch (1168:7): [True: 0, False: 1]
  ------------------
 1169|      0|         return if_match(req, "SLH-DSA-SHAKE-256f", {2, 16, 840, 1, 101, 3, 4, 3, 31});
 1170|      0|      case 0x7BB17:
  ------------------
  |  Branch (1170:7): [True: 0, False: 1]
  ------------------
 1171|      0|         return if_match(req, "SLH-DSA-SHAKE-256s", {2, 16, 840, 1, 101, 3, 4, 3, 30});
 1172|      0|      case 0x7BCF3:
  ------------------
  |  Branch (1172:7): [True: 0, False: 1]
  ------------------
 1173|      0|         return if_match(req, "PKIX.EmailProtection", {1, 3, 6, 1, 5, 5, 7, 3, 4});
 1174|      0|      case 0x7CC2C:
  ------------------
  |  Branch (1174:7): [True: 0, False: 1]
  ------------------
 1175|      0|         return if_match(req, "SHA-512-256", {2, 16, 840, 1, 101, 3, 4, 2, 6});
 1176|      0|      case 0x7CF41:
  ------------------
  |  Branch (1176:7): [True: 0, False: 1]
  ------------------
 1177|      0|         return if_match(req, "SphincsPlus-shake-192s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 3});
 1178|      0|      case 0x7DB91:
  ------------------
  |  Branch (1178:7): [True: 0, False: 1]
  ------------------
 1179|      0|         return if_match(req, "GOST-34.10", {1, 2, 643, 2, 2, 19});
 1180|      0|      case 0x7E319:
  ------------------
  |  Branch (1180:7): [True: 0, False: 1]
  ------------------
 1181|      0|         return if_match(req, "ECDSA/SHA-512", {1, 2, 840, 10045, 4, 3, 4});
 1182|      0|      case 0x7E874:
  ------------------
  |  Branch (1182:7): [True: 0, False: 1]
  ------------------
 1183|      0|         return if_match(req, "ClassicMcEliece_6688128f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 6});
 1184|      0|      case 0x7EAAF:
  ------------------
  |  Branch (1184:7): [True: 0, False: 1]
  ------------------
 1185|      0|         return if_match(req, "eFrodoKEM-640-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 16, 1});
 1186|      0|      case 0x7F51F:
  ------------------
  |  Branch (1186:7): [True: 0, False: 1]
  ------------------
 1187|      0|         return if_match(req, "PKIX.IPsecTunnel", {1, 3, 6, 1, 5, 5, 7, 3, 6});
 1188|      0|      case 0x80272:
  ------------------
  |  Branch (1188:7): [True: 0, False: 1]
  ------------------
 1189|      0|         return if_match(req, "X520.Organization", {2, 5, 4, 10});
 1190|      0|      case 0x80340:
  ------------------
  |  Branch (1190:7): [True: 0, False: 1]
  ------------------
 1191|      0|         return if_match(req, "AES-256/CBC", {2, 16, 840, 1, 101, 3, 4, 1, 42});
 1192|      0|      case 0x80445:
  ------------------
  |  Branch (1192:7): [True: 0, False: 1]
  ------------------
 1193|      0|         return if_match(req, "AES-256/CCM", {2, 16, 840, 1, 101, 3, 4, 1, 47});
 1194|      0|      case 0x811F7:
  ------------------
  |  Branch (1194:7): [True: 0, False: 1]
  ------------------
 1195|      0|         return if_match(req, "HMAC(SHA-256)", {1, 2, 840, 113549, 2, 9});
 1196|      0|      case 0x82434:
  ------------------
  |  Branch (1196:7): [True: 0, False: 1]
  ------------------
 1197|      0|         return if_match(req, "PKCS9.X509CRL", {1, 2, 840, 113549, 1, 9, 23, 1});
 1198|      0|      case 0x82B47:
  ------------------
  |  Branch (1198:7): [True: 0, False: 1]
  ------------------
 1199|      0|         return if_match(req, "Threefish-512/CBC", {1, 3, 6, 1, 4, 1, 25258, 3, 2});
 1200|      0|      case 0x83EA7:
  ------------------
  |  Branch (1200:7): [True: 0, False: 1]
  ------------------
 1201|      0|         return if_match(req, "RSA/PKCS1v15(SHA-384)", {1, 2, 840, 113549, 1, 1, 12});
 1202|      0|      case 0x84596:
  ------------------
  |  Branch (1202:7): [True: 0, False: 1]
  ------------------
 1203|      0|         return if_match(req, "eFrodoKEM-640-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 17, 1});
 1204|      0|      case 0x8469F:
  ------------------
  |  Branch (1204:7): [True: 0, False: 1]
  ------------------
 1205|      0|         return if_match(req, "ClassicMcEliece_6960119pcf", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 4});
 1206|      0|      case 0x84CA4:
  ------------------
  |  Branch (1206:7): [True: 0, False: 1]
  ------------------
 1207|      0|         return if_match(req, "secp256k1", {1, 3, 132, 0, 10});
 1208|      0|      case 0x85381:
  ------------------
  |  Branch (1208:7): [True: 0, False: 1]
  ------------------
 1209|      0|         return if_match(req, "secp256r1", {1, 2, 840, 10045, 3, 1, 7});
 1210|      0|      case 0x854FC:
  ------------------
  |  Branch (1210:7): [True: 0, False: 1]
  ------------------
 1211|      0|         return if_match(req, "PKIX.IPsecUser", {1, 3, 6, 1, 5, 5, 7, 3, 7});
 1212|      0|      case 0x85F51:
  ------------------
  |  Branch (1212:7): [True: 0, False: 1]
  ------------------
 1213|      0|         return if_match(req, "Serpent/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 4});
 1214|      0|      case 0x862D9:
  ------------------
  |  Branch (1214:7): [True: 0, False: 1]
  ------------------
 1215|      0|         return if_match(req, "ECGDSA/SHA-512", {1, 3, 36, 3, 3, 2, 5, 4, 6});
 1216|      0|      case 0x87585:
  ------------------
  |  Branch (1216:7): [True: 0, False: 1]
  ------------------
 1217|      0|         return if_match(req, "Twofish/CBC", {1, 3, 6, 1, 4, 1, 25258, 3, 3});
 1218|      0|      case 0x877D1:
  ------------------
  |  Branch (1218:7): [True: 0, False: 1]
  ------------------
 1219|      0|         return if_match(req, "PKCS9.EmailAddress", {1, 2, 840, 113549, 1, 9, 1});
 1220|      0|      case 0x87D27:
  ------------------
  |  Branch (1220:7): [True: 0, False: 1]
  ------------------
 1221|      0|         return if_match(req, "PKIX.CertificateAuthorityIssuers", {1, 3, 6, 1, 5, 5, 7, 48, 2});
 1222|      0|      case 0x87E42:
  ------------------
  |  Branch (1222:7): [True: 0, False: 1]
  ------------------
 1223|      0|         return if_match(req, "X509v3.AuthorityKeyIdentifier", {2, 5, 29, 35});
 1224|      0|      case 0x889B1:
  ------------------
  |  Branch (1224:7): [True: 0, False: 1]
  ------------------
 1225|      0|         return if_match(req, "ECDSA/SHA-1", {1, 2, 840, 10045, 4, 1});
 1226|      0|      case 0x89658:
  ------------------
  |  Branch (1226:7): [True: 0, False: 1]
  ------------------
 1227|      0|         return if_match(req, "PBE-PKCS5v20", {1, 2, 840, 113549, 1, 5, 13});
 1228|      0|      case 0x8976D:
  ------------------
  |  Branch (1228:7): [True: 0, False: 1]
  ------------------
 1229|      0|         return if_match(req, "PKCS9.MessageDigest", {1, 2, 840, 113549, 1, 9, 4});
 1230|      0|      case 0x8B002:
  ------------------
  |  Branch (1230:7): [True: 0, False: 1]
  ------------------
 1231|      0|         return if_match(req, "Camellia-256/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 8});
 1232|      0|      case 0x8B935:
  ------------------
  |  Branch (1232:7): [True: 0, False: 1]
  ------------------
 1233|      0|         return if_match(req, "ClassicMcEliece_6688128", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 5});
 1234|      0|      case 0x8BB11:
  ------------------
  |  Branch (1234:7): [True: 0, False: 1]
  ------------------
 1235|      0|         return if_match(req, "X509v3.NoRevocationAvailable", {2, 5, 29, 56});
 1236|      0|      case 0x8CE3D:
  ------------------
  |  Branch (1236:7): [True: 0, False: 1]
  ------------------
 1237|      0|         return if_match(req, "PKCS9.ChallengePassword", {1, 2, 840, 113549, 1, 9, 7});
 1238|      0|      case 0x8D45C:
  ------------------
  |  Branch (1238:7): [True: 0, False: 1]
  ------------------
 1239|      0|         return if_match(req, "ECKCDSA", {1, 0, 14888, 3, 0, 5});
 1240|      0|      case 0x8E0C1:
  ------------------
  |  Branch (1240:7): [True: 0, False: 1]
  ------------------
 1241|      0|         return if_match(req, "X509v3.CertificatePolicies", {2, 5, 29, 32});
 1242|      0|      case 0x8E39A:
  ------------------
  |  Branch (1242:7): [True: 0, False: 1]
  ------------------
 1243|      0|         return if_match(req, "HSS-LMS-Private-Key", {1, 3, 6, 1, 4, 1, 25258, 1, 13});
 1244|      0|      case 0x8EC51:
  ------------------
  |  Branch (1244:7): [True: 0, False: 1]
  ------------------
 1245|      0|         return if_match(req, "Kyber-768-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 7, 2});
 1246|      0|      case 0x8F94A:
  ------------------
  |  Branch (1246:7): [True: 0, False: 1]
  ------------------
 1247|      0|         return if_match(req, "Dilithium-6x5-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 9, 2});
 1248|      0|      case 0x8FC20:
  ------------------
  |  Branch (1248:7): [True: 0, False: 1]
  ------------------
 1249|      0|         return if_match(req, "AES-128/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 1});
 1250|      0|      case 0x8FDE0:
  ------------------
  |  Branch (1250:7): [True: 0, False: 1]
  ------------------
 1251|      0|         return if_match(req, "SHA-3(256)", {2, 16, 840, 1, 101, 3, 4, 2, 8});
 1252|      0|      case 0x919E3:
  ------------------
  |  Branch (1252:7): [True: 0, False: 1]
  ------------------
 1253|      0|         return if_match(req, "Serpent/GCM", {1, 3, 6, 1, 4, 1, 25258, 3, 101});
 1254|      0|      case 0x91C1A:
  ------------------
  |  Branch (1254:7): [True: 0, False: 1]
  ------------------
 1255|      0|         return if_match(req, "X25519", {1, 3, 101, 110});
 1256|      0|      case 0x91DC4:
  ------------------
  |  Branch (1256:7): [True: 0, False: 1]
  ------------------
 1257|      0|         return if_match(req, "McEliece", {1, 3, 6, 1, 4, 1, 25258, 1, 3});
 1258|      0|      case 0x93467:
  ------------------
  |  Branch (1258:7): [True: 0, False: 1]
  ------------------
 1259|      0|         return if_match(req, "Dilithium-6x5-AES-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 10, 2});
 1260|      0|      case 0x93D50:
  ------------------
  |  Branch (1260:7): [True: 0, False: 1]
  ------------------
 1261|      0|         return if_match(req, "AES-192/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 2});
 1262|      0|      case 0x95166:
  ------------------
  |  Branch (1262:7): [True: 0, False: 1]
  ------------------
 1263|      0|         return if_match(req, "SLH-DSA-SHAKE-128f", {2, 16, 840, 1, 101, 3, 4, 3, 27});
 1264|      0|      case 0x95173:
  ------------------
  |  Branch (1264:7): [True: 0, False: 1]
  ------------------
 1265|      0|         return if_match(req, "SLH-DSA-SHAKE-128s", {2, 16, 840, 1, 101, 3, 4, 3, 26});
 1266|      0|      case 0x952D6:
  ------------------
  |  Branch (1266:7): [True: 0, False: 1]
  ------------------
 1267|      0|         return if_match(req, "PKIX.OCSP", {1, 3, 6, 1, 5, 5, 7, 48, 1});
 1268|      0|      case 0x959B9:
  ------------------
  |  Branch (1268:7): [True: 0, False: 1]
  ------------------
 1269|      0|         return if_match(req, "PKIX.IPsecEndSystem", {1, 3, 6, 1, 5, 5, 7, 3, 5});
 1270|      0|      case 0x96F85:
  ------------------
  |  Branch (1270:7): [True: 0, False: 1]
  ------------------
 1271|      0|         return if_match(req, "Camellia-256/CBC", {1, 2, 392, 200011, 61, 1, 1, 1, 4});
 1272|      0|      case 0x97D5E:
  ------------------
  |  Branch (1272:7): [True: 0, False: 1]
  ------------------
 1273|      0|         return if_match(req, "HMAC(SHA-1)", {1, 2, 840, 113549, 2, 7});
 1274|      0|      case 0x9805C:
  ------------------
  |  Branch (1274:7): [True: 0, False: 1]
  ------------------
 1275|      0|         return if_match(req, "SEED/CBC", {1, 2, 410, 200004, 1, 4});
 1276|      0|      case 0x980E7:
  ------------------
  |  Branch (1276:7): [True: 0, False: 1]
  ------------------
 1277|      0|         return if_match(req, "SphincsPlus-haraka-192s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 3});
 1278|      0|      case 0x980F5:
  ------------------
  |  Branch (1278:7): [True: 0, False: 1]
  ------------------
 1279|      0|         return if_match(req, "GOST.SubjectSigningTool", {1, 2, 643, 100, 111});
 1280|      0|      case 0x98B03:
  ------------------
  |  Branch (1280:7): [True: 0, False: 1]
  ------------------
 1281|      0|         return if_match(req, "XMSS", {0, 4, 0, 127, 0, 15, 1, 1, 13, 0});
 1282|      0|      case 0x9A6B2:
  ------------------
  |  Branch (1282:7): [True: 0, False: 1]
  ------------------
 1283|      0|         return if_match(req, "ECKCDSA/SHA-1", {1, 2, 410, 200004, 1, 100, 4, 3});
 1284|      0|      case 0x9B1CF:
  ------------------
  |  Branch (1284:7): [True: 0, False: 1]
  ------------------
 1285|      0|         return if_match(req, "SM4/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 9});
 1286|      0|      case 0x9B6B2:
  ------------------
  |  Branch (1286:7): [True: 0, False: 1]
  ------------------
 1287|      0|         return if_match(req, "AES-128/GCM", {2, 16, 840, 1, 101, 3, 4, 1, 6});
 1288|      0|      case 0x9B6BB:
  ------------------
  |  Branch (1288:7): [True: 0, False: 1]
  ------------------
 1289|      0|         return if_match(req, "X520.OrganizationalUnit", {2, 5, 4, 11});
 1290|      0|      case 0x9B851:
  ------------------
  |  Branch (1290:7): [True: 0, False: 1]
  ------------------
 1291|      0|         return if_match(req, "OpenPGP.Curve25519", {1, 3, 6, 1, 4, 1, 3029, 1, 5, 1});
 1292|      0|      case 0x9C80B:
  ------------------
  |  Branch (1292:7): [True: 0, False: 1]
  ------------------
 1293|      0|         return if_match(req, "SLH-DSA-SHA2-192f", {2, 16, 840, 1, 101, 3, 4, 3, 23});
 1294|      0|      case 0x9C818:
  ------------------
  |  Branch (1294:7): [True: 0, False: 1]
  ------------------
 1295|      0|         return if_match(req, "SLH-DSA-SHA2-192s", {2, 16, 840, 1, 101, 3, 4, 3, 22});
 1296|      0|      case 0x9CD2B:
  ------------------
  |  Branch (1296:7): [True: 0, False: 1]
  ------------------
 1297|      0|         return if_match(req, "Scrypt", {1, 3, 6, 1, 4, 1, 11591, 4, 11});
 1298|      0|      case 0x9CDE1:
  ------------------
  |  Branch (1298:7): [True: 0, False: 1]
  ------------------
 1299|      0|         return if_match(req, "GOST-34.10-2012-256/SHA-256", {1, 3, 6, 1, 4, 1, 25258, 1, 6, 1});
 1300|      0|      case 0x9CF73:
  ------------------
  |  Branch (1300:7): [True: 0, False: 1]
  ------------------
 1301|      0|         return if_match(req, "ClassicMcEliece_460896f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 4});
 1302|      0|      case 0x9D354:
  ------------------
  |  Branch (1302:7): [True: 0, False: 1]
  ------------------
 1303|      0|         return if_match(req, "RIPEMD-160", {1, 3, 36, 3, 2, 1});
 1304|      0|      case 0x9D503:
  ------------------
  |  Branch (1304:7): [True: 0, False: 1]
  ------------------
 1305|      0|         return if_match(req, "RSA/PKCS1v15(SHA-256)", {1, 2, 840, 113549, 1, 1, 11});
 1306|      0|      case 0x9EC88:
  ------------------
  |  Branch (1306:7): [True: 0, False: 1]
  ------------------
 1307|      0|         return if_match(req, "DSA/SHA-3(512)", {2, 16, 840, 1, 101, 3, 4, 3, 8});
 1308|      0|      case 0x9EF36:
  ------------------
  |  Branch (1308:7): [True: 0, False: 1]
  ------------------
 1309|      0|         return if_match(req, "ClassicMcEliece_6960119", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 7});
 1310|      0|      case 0x9F764:
  ------------------
  |  Branch (1310:7): [True: 0, False: 1]
  ------------------
 1311|      0|         return if_match(req, "X448", {1, 3, 101, 111});
 1312|      0|      case 0x9F7E2:
  ------------------
  |  Branch (1312:7): [True: 0, False: 1]
  ------------------
 1313|      0|         return if_match(req, "AES-192/GCM", {2, 16, 840, 1, 101, 3, 4, 1, 26});
 1314|      0|      case 0x9F9C5:
  ------------------
  |  Branch (1314:7): [True: 0, False: 1]
  ------------------
 1315|      0|         return if_match(req, "ClassicMcEliece_6688128pcf", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 2});
 1316|      0|      case 0xA0805:
  ------------------
  |  Branch (1316:7): [True: 0, False: 1]
  ------------------
 1317|      0|         return if_match(req, "PKCS9.SDSICertificate", {1, 2, 840, 113549, 1, 9, 22, 2});
 1318|      0|      case 0xA2B5B:
  ------------------
  |  Branch (1318:7): [True: 0, False: 1]
  ------------------
 1319|      0|         return if_match(req, "X509v3.CRLNumber", {2, 5, 29, 20});
 1320|      0|      case 0xA3005:
  ------------------
  |  Branch (1320:7): [True: 0, False: 1]
  ------------------
 1321|      0|         return if_match(req, "X520.Title", {2, 5, 4, 12});
 1322|      0|      case 0xA323F:
  ------------------
  |  Branch (1322:7): [True: 0, False: 1]
  ------------------
 1323|      0|         return if_match(req, "X509v3.NameConstraints", {2, 5, 29, 30});
 1324|      0|      case 0xA3C55:
  ------------------
  |  Branch (1324:7): [True: 0, False: 1]
  ------------------
 1325|      0|         return if_match(req, "X520.Pseudonym", {2, 5, 4, 65});
 1326|      0|      case 0xA4809:
  ------------------
  |  Branch (1326:7): [True: 0, False: 1]
  ------------------
 1327|      0|         return if_match(req, "SphincsPlus-sha2-256f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 6});
 1328|      0|      case 0xA57AF:
  ------------------
  |  Branch (1328:7): [True: 0, False: 1]
  ------------------
 1329|      0|         return if_match(req, "secp521r1", {1, 3, 132, 0, 35});
 1330|      0|      case 0xA5DA9:
  ------------------
  |  Branch (1330:7): [True: 0, False: 1]
  ------------------
 1331|      0|         return if_match(req, "SphincsPlus-shake-256f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 6});
 1332|      0|      case 0xA6865:
  ------------------
  |  Branch (1332:7): [True: 0, False: 1]
  ------------------
 1333|      0|         return if_match(req, "Camellia-128/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 6});
 1334|      0|      case 0xA6C61:
  ------------------
  |  Branch (1334:7): [True: 0, False: 1]
  ------------------
 1335|      0|         return if_match(req, "SM4/GCM", {1, 2, 156, 10197, 1, 104, 8});
 1336|      0|      case 0xA8439:
  ------------------
  |  Branch (1336:7): [True: 0, False: 1]
  ------------------
 1337|      0|         return if_match(req, "PKCS12.CertBag", {1, 2, 840, 113549, 1, 12, 10, 1, 3});
 1338|      0|      case 0xA9061:
  ------------------
  |  Branch (1338:7): [True: 0, False: 1]
  ------------------
 1339|      0|         return if_match(req, "Kyber-768-90s-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 11, 2});
 1340|      0|      case 0xAA995:
  ------------------
  |  Branch (1340:7): [True: 0, False: 1]
  ------------------
 1341|      0|         return if_match(req, "Camellia-192/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 7});
 1342|      0|      case 0xAAE2B:
  ------------------
  |  Branch (1342:7): [True: 0, False: 1]
  ------------------
 1343|      0|         return if_match(req, "Dilithium-8x7-AES-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 10, 3});
 1344|      0|      case 0xABCED:
  ------------------
  |  Branch (1344:7): [True: 0, False: 1]
  ------------------
 1345|      0|         return if_match(req, "GOST.IssuerSigningTool", {1, 2, 643, 100, 112});
 1346|      0|      case 0xABD24:
  ------------------
  |  Branch (1346:7): [True: 0, False: 1]
  ------------------
 1347|      0|         return if_match(req, "RSA/OAEP", {1, 2, 840, 113549, 1, 1, 7});
 1348|      0|      case 0xAC2EC:
  ------------------
  |  Branch (1348:7): [True: 0, False: 1]
  ------------------
 1349|      0|         return if_match(req, "Streebog-256", {1, 2, 643, 7, 1, 1, 2, 2});
 1350|      0|      case 0xAC3DD:
  ------------------
  |  Branch (1350:7): [True: 0, False: 1]
  ------------------
 1351|      0|         return if_match(req, "Certificate Comment", {2, 16, 840, 1, 113730, 1, 13});
 1352|      0|      case 0xAC511:
  ------------------
  |  Branch (1352:7): [True: 0, False: 1]
  ------------------
 1353|      0|         return if_match(req, "PBE-SHA1-3DES", {1, 2, 840, 113549, 1, 12, 1, 3});
 1354|      0|      case 0xAE6FE:
  ------------------
  |  Branch (1354:7): [True: 0, False: 1]
  ------------------
 1355|      0|         return if_match(req, "PKIX.ClientAuth", {1, 3, 6, 1, 5, 5, 7, 3, 2});
 1356|      0|      case 0xAE8D3:
  ------------------
  |  Branch (1356:7): [True: 0, False: 1]
  ------------------
 1357|      0|         return if_match(req, "ClassicMcEliece_8192128pcf", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 6});
 1358|      0|      case 0xAF476:
  ------------------
  |  Branch (1358:7): [True: 0, False: 1]
  ------------------
 1359|      0|         return if_match(req, "ECDH", {1, 3, 132, 1, 12});
 1360|      0|      case 0xAFA6A:
  ------------------
  |  Branch (1360:7): [True: 0, False: 1]
  ------------------
 1361|      0|         return if_match(req, "RSA/PKCS1v15(SHA-3(384))", {2, 16, 840, 1, 101, 3, 4, 3, 15});
 1362|      0|      case 0xB2217:
  ------------------
  |  Branch (1362:7): [True: 0, False: 1]
  ------------------
 1363|      0|         return if_match(req, "AES-256/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 3});
 1364|      0|      case 0xB22F7:
  ------------------
  |  Branch (1364:7): [True: 0, False: 1]
  ------------------
 1365|      0|         return if_match(req, "Camellia-128/GCM", {0, 3, 4401, 5, 3, 1, 9, 6});
 1366|      0|      case 0xB23DE:
  ------------------
  |  Branch (1366:7): [True: 0, False: 1]
  ------------------
 1367|      0|         return if_match(req, "X520.Locality", {2, 5, 4, 7});
 1368|      0|      case 0xB2FBD:
  ------------------
  |  Branch (1368:7): [True: 0, False: 1]
  ------------------
 1369|      0|         return if_match(req, "ECKCDSA/SHA-224", {1, 2, 410, 200004, 1, 100, 4, 4});
 1370|      0|      case 0xB32B0:
  ------------------
  |  Branch (1370:7): [True: 0, False: 1]
  ------------------
 1371|      0|         return if_match(req, "ECKCDSA/SHA-256", {1, 2, 410, 200004, 1, 100, 4, 5});
 1372|      0|      case 0xB360E:
  ------------------
  |  Branch (1372:7): [True: 0, False: 1]
  ------------------
 1373|      0|         return if_match(req, "eFrodoKEM-976-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 16, 2});
 1374|      0|      case 0xB4368:
  ------------------
  |  Branch (1374:7): [True: 0, False: 1]
  ------------------
 1375|      0|         return if_match(req, "ECGDSA/SHA-1", {1, 3, 36, 3, 3, 2, 5, 4, 2});
 1376|      0|      case 0xB58CD:
  ------------------
  |  Branch (1376:7): [True: 0, False: 1]
  ------------------
 1377|      0|         return if_match(req, "RSA/PKCS1v15(SHA-3(512))", {2, 16, 840, 1, 101, 3, 4, 3, 16});
 1378|      0|      case 0xB6427:
  ------------------
  |  Branch (1378:7): [True: 0, False: 1]
  ------------------
 1379|      0|         return if_match(req, "Camellia-192/GCM", {0, 3, 4401, 5, 3, 1, 9, 26});
 1380|      0|      case 0xB7102:
  ------------------
  |  Branch (1380:7): [True: 0, False: 1]
  ------------------
 1381|      0|         return if_match(req, "brainpool224r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 5});
 1382|      0|      case 0xB710D:
  ------------------
  |  Branch (1382:7): [True: 0, False: 1]
  ------------------
 1383|      0|         return if_match(req, "X509v3.CRLIssuingDistributionPoint", {2, 5, 29, 28});
 1384|      0|      case 0xB72D4:
  ------------------
  |  Branch (1384:7): [True: 0, False: 1]
  ------------------
 1385|      0|         return if_match(req, "Microsoft UPN", {1, 3, 6, 1, 4, 1, 311, 20, 2, 3});
 1386|      0|      case 0xB73A5:
  ------------------
  |  Branch (1386:7): [True: 0, False: 1]
  ------------------
 1387|      0|         return if_match(req, "RSA/PSS", {1, 2, 840, 113549, 1, 1, 10});
 1388|      0|      case 0xB84B3:
  ------------------
  |  Branch (1388:7): [True: 0, False: 1]
  ------------------
 1389|      0|         return if_match(req, "PKIX.CodeSigning", {1, 3, 6, 1, 5, 5, 7, 3, 3});
 1390|      0|      case 0xB8CB9:
  ------------------
  |  Branch (1390:7): [True: 0, False: 1]
  ------------------
 1391|      0|         return if_match(req, "GOST-34.10-2012-256", {1, 2, 643, 7, 1, 1, 1, 1});
 1392|      0|      case 0xB945C:
  ------------------
  |  Branch (1392:7): [True: 0, False: 1]
  ------------------
 1393|      0|         return if_match(req, "Twofish/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 5});
 1394|      0|      case 0xB94E4:
  ------------------
  |  Branch (1394:7): [True: 0, False: 1]
  ------------------
 1395|      0|         return if_match(req, "gost_512A", {1, 2, 643, 7, 1, 2, 1, 2, 1});
 1396|      0|      case 0xB94E5:
  ------------------
  |  Branch (1396:7): [True: 0, False: 1]
  ------------------
 1397|      0|         return if_match(req, "gost_512B", {1, 2, 643, 7, 1, 2, 1, 2, 2});
 1398|      0|      case 0xBA1D8:
  ------------------
  |  Branch (1398:7): [True: 0, False: 1]
  ------------------
 1399|      0|         return if_match(req, "X520.StreetAddress", {2, 5, 4, 9});
 1400|      0|      case 0xBCB45:
  ------------------
  |  Branch (1400:7): [True: 0, False: 1]
  ------------------
 1401|      0|         return if_match(req, "PKCS12.CRLBag", {1, 2, 840, 113549, 1, 12, 10, 1, 4});
 1402|      0|      case 0xBCC82:
  ------------------
  |  Branch (1402:7): [True: 0, False: 1]
  ------------------
 1403|      0|         return if_match(req, "x962_p239v1", {1, 2, 840, 10045, 3, 1, 4});
 1404|      0|      case 0xBCC83:
  ------------------
  |  Branch (1404:7): [True: 0, False: 1]
  ------------------
 1405|      0|         return if_match(req, "x962_p239v2", {1, 2, 840, 10045, 3, 1, 5});
 1406|      0|      case 0xBCC84:
  ------------------
  |  Branch (1406:7): [True: 0, False: 1]
  ------------------
 1407|      0|         return if_match(req, "x962_p239v3", {1, 2, 840, 10045, 3, 1, 6});
 1408|      0|      case 0xBD92B:
  ------------------
  |  Branch (1408:7): [True: 0, False: 1]
  ------------------
 1409|      0|         return if_match(req, "X509v3.HoldInstructionCode", {2, 5, 29, 23});
 1410|      0|      case 0xBDCA9:
  ------------------
  |  Branch (1410:7): [True: 0, False: 1]
  ------------------
 1411|      0|         return if_match(req, "AES-256/GCM", {2, 16, 840, 1, 101, 3, 4, 1, 46});
 1412|      0|      case 0xBE48D:
  ------------------
  |  Branch (1412:7): [True: 0, False: 1]
  ------------------
 1413|      0|         return if_match(req, "PKIX.OCSP.BasicResponse", {1, 3, 6, 1, 5, 5, 7, 48, 1, 1});
 1414|      0|      case 0xBF71E:
  ------------------
  |  Branch (1414:7): [True: 0, False: 1]
  ------------------
 1415|      0|         return if_match(req, "Kyber-1024-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 7, 3});
 1416|      0|      case 0xBFF01:
  ------------------
  |  Branch (1416:7): [True: 0, False: 1]
  ------------------
 1417|      0|         return if_match(req, "DSA/SHA-3(224)", {2, 16, 840, 1, 101, 3, 4, 3, 5});
 1418|      0|      case 0xC0F4F:
  ------------------
  |  Branch (1418:7): [True: 0, False: 1]
  ------------------
 1419|      0|         return if_match(req, "SphincsPlus-haraka-256f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 6});
 1420|      0|      case 0xC1875:
  ------------------
  |  Branch (1420:7): [True: 0, False: 1]
  ------------------
 1421|      0|         return if_match(req, "SHA-1", {1, 3, 14, 3, 2, 26});
 1422|      0|      case 0xC28D1:
  ------------------
  |  Branch (1422:7): [True: 0, False: 1]
  ------------------
 1423|      0|         return if_match(req, "PKIX.OCSPSigning", {1, 3, 6, 1, 5, 5, 7, 3, 9});
 1424|      0|      case 0xC42CA:
  ------------------
  |  Branch (1424:7): [True: 0, False: 1]
  ------------------
 1425|      0|         return if_match(req, "brainpool256r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 7});
 1426|      0|      default:
  ------------------
  |  Branch (1426:7): [True: 0, False: 1]
  ------------------
 1427|      0|         return {};
 1428|      1|   }
 1429|      1|}
_ZN5Botan7OID_Map16load_oid2str_mapEv:
 1431|      1|std::unordered_map<OID, std::string> OID_Map::load_oid2str_map() {
 1432|      1|   return {
 1433|      1|      {OID{2, 5, 8, 1, 1}, "RSA"},
 1434|      1|      {OID{1, 3, 6, 1, 4, 1, 8301, 3, 1, 2, 9, 0, 38}, "secp521r1"},
 1435|      1|      {OID{1, 2, 643, 2, 2, 35, 1}, "gost_256A"},
 1436|      1|      {OID{1, 2, 643, 2, 2, 36, 0}, "gost_256A"},
 1437|      1|   };
 1438|      1|}
_ZN5Botan7OID_Map16load_str2oid_mapEv:
 1440|      1|std::unordered_map<std::string, OID> OID_Map::load_str2oid_map() {
 1441|      1|   return {
 1442|      1|      {"Curve25519", OID{1, 3, 101, 110}},
 1443|      1|      {"SM2_Sig", OID{1, 2, 156, 10197, 1, 301, 1}},
 1444|      1|      {"RSA/EMSA3(MD2)", OID{1, 2, 840, 113549, 1, 1, 2}},
 1445|      1|      {"RSA/EMSA3(MD5)", OID{1, 2, 840, 113549, 1, 1, 4}},
 1446|      1|      {"RSA/EMSA3(SHA-1)", OID{1, 2, 840, 113549, 1, 1, 5}},
 1447|      1|      {"RSA/EMSA3(SHA-256)", OID{1, 2, 840, 113549, 1, 1, 11}},
 1448|      1|      {"RSA/EMSA3(SHA-384)", OID{1, 2, 840, 113549, 1, 1, 12}},
 1449|      1|      {"RSA/EMSA3(SHA-512)", OID{1, 2, 840, 113549, 1, 1, 13}},
 1450|      1|      {"RSA/EMSA3(SHA-224)", OID{1, 2, 840, 113549, 1, 1, 14}},
 1451|      1|      {"RSA/EMSA3(SHA-512-256)", OID{1, 2, 840, 113549, 1, 1, 16}},
 1452|      1|      {"RSA/EMSA3(SHA-3(224))", OID{2, 16, 840, 1, 101, 3, 4, 3, 13}},
 1453|      1|      {"RSA/EMSA3(SHA-3(256))", OID{2, 16, 840, 1, 101, 3, 4, 3, 14}},
 1454|      1|      {"RSA/EMSA3(SHA-3(384))", OID{2, 16, 840, 1, 101, 3, 4, 3, 15}},
 1455|      1|      {"RSA/EMSA3(SHA-3(512))", OID{2, 16, 840, 1, 101, 3, 4, 3, 16}},
 1456|      1|      {"RSA/EMSA3(SM3)", OID{1, 2, 156, 10197, 1, 504}},
 1457|      1|      {"RSA/EMSA3(RIPEMD-160)", OID{1, 3, 36, 3, 3, 1, 2}},
 1458|      1|      {"RSA/EMSA4", OID{1, 2, 840, 113549, 1, 1, 10}},
 1459|      1|      {"PBES2", OID{1, 2, 840, 113549, 1, 5, 13}},
 1460|      1|   };
 1461|      1|}
static_oids.cpp:_ZN5Botan12_GLOBAL__N_18if_matchERKNS_3OIDESt16initializer_listIjENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEE:
   18|      1|std::optional<std::string_view> if_match(const OID& oid, std::initializer_list<uint32_t> val, std::string_view name) {
   19|      1|   if(oid.matches(val)) {
  ------------------
  |  Branch (19:7): [True: 1, False: 0]
  ------------------
   20|      1|      return name;
   21|      1|   } else {
   22|      0|      return {};
   23|      0|   }
   24|      1|}
static_oids.cpp:_ZN5Botan12_GLOBAL__N_113hash_oid_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   34|      1|uint32_t hash_oid_name(std::string_view s) {
   35|      1|   uint64_t hash = 0x8188B31879A4879A;
   36|       |
   37|     10|   for(const char c : s) {
  ------------------
  |  Branch (37:21): [True: 10, False: 1]
  ------------------
   38|     10|      hash *= 251;
   39|     10|      hash += c;
   40|     10|   }
   41|       |
   42|      1|   return static_cast<uint32_t>(hash % 805289);
   43|      1|}
static_oids.cpp:_ZN5Botan12_GLOBAL__N_18if_matchENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_St16initializer_listIjE:
   26|      1|std::optional<OID> if_match(std::string_view req, std::string_view actual, std::initializer_list<uint32_t> oid) {
   27|      1|   if(req == actual) {
  ------------------
  |  Branch (27:7): [True: 1, False: 0]
  ------------------
   28|      1|      return OID(oid);
   29|      1|   } else {
   30|      0|      return {};
   31|      0|   }
   32|      1|}

_ZN5Botan20Buffered_Computation5finalENSt3__14spanIhLm18446744073709551615EEE:
   54|      4|void Buffered_Computation::final(std::span<uint8_t> out) {
   55|      4|   BOTAN_ARG_CHECK(out.size() >= output_length(), "provided output buffer has insufficient capacity");
  ------------------
  |  |   35|      4|   do {                                                          \
  |  |   36|      4|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      4|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 4]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      4|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 4]
  |  |  ------------------
  ------------------
   56|      4|   final_result(out);
   57|      4|}

_ZN5Botan18SymmetricAlgorithm7set_keyENSt3__14spanIKhLm18446744073709551615EEE:
   22|      4|void SymmetricAlgorithm::set_key(std::span<const uint8_t> key) {
   23|      4|   if(!valid_keylength(key.size())) {
  ------------------
  |  Branch (23:7): [True: 0, False: 4]
  ------------------
   24|      0|      throw Invalid_Key_Length(name(), key.size());
   25|      0|   }
   26|      4|   key_schedule(key);
   27|      4|}

_ZN5Botan10hex_decodeEPhPKcmRmb:
   72|      7|size_t hex_decode(uint8_t output[], const char input[], size_t input_length, size_t& input_consumed, bool ignore_ws) {
   73|      7|   uint8_t* out_ptr = output;
   74|      7|   bool top_nibble = true;
   75|       |
   76|      7|   clear_mem(output, input_length / 2);
   77|       |
   78|    527|   for(size_t i = 0; i != input_length; ++i) {
  ------------------
  |  Branch (78:22): [True: 520, False: 7]
  ------------------
   79|    520|      const uint8_t bin = hex_char_to_bin(input[i]);
   80|       |
   81|    520|      if(bin >= 0x10) {
  ------------------
  |  Branch (81:10): [True: 0, False: 520]
  ------------------
   82|      0|         if(bin == 0x80 && ignore_ws) {
  ------------------
  |  Branch (82:13): [True: 0, False: 0]
  |  Branch (82:28): [True: 0, False: 0]
  ------------------
   83|      0|            continue;
   84|      0|         }
   85|       |
   86|      0|         throw Invalid_Argument(fmt("hex_decode: invalid character '{}'", format_char_for_display(input[i])));
   87|      0|      }
   88|       |
   89|    520|      if(top_nibble) {
  ------------------
  |  Branch (89:10): [True: 260, False: 260]
  ------------------
   90|    260|         *out_ptr |= bin << 4;
   91|    260|      } else {
   92|    260|         *out_ptr |= bin;
   93|    260|      }
   94|       |
   95|    520|      top_nibble = !top_nibble;
   96|    520|      if(top_nibble) {
  ------------------
  |  Branch (96:10): [True: 260, False: 260]
  ------------------
   97|    260|         ++out_ptr;
   98|    260|      }
   99|    520|   }
  100|       |
  101|      7|   input_consumed = input_length;
  102|      7|   const size_t written = (out_ptr - output);
  103|       |
  104|       |   /*
  105|       |   * We only got half of a uint8_t at the end; zap the half-written
  106|       |   * output and mark it as unread
  107|       |   */
  108|      7|   if(!top_nibble) {
  ------------------
  |  Branch (108:7): [True: 0, False: 7]
  ------------------
  109|      0|      *out_ptr = 0;
  110|      0|      input_consumed -= 1;
  111|      0|   }
  112|       |
  113|      7|   return written;
  114|      7|}
_ZN5Botan10hex_decodeEPhPKcmb:
  116|      7|size_t hex_decode(uint8_t output[], const char input[], size_t input_length, bool ignore_ws) {
  117|      7|   size_t consumed = 0;
  118|      7|   const size_t written = hex_decode(output, input, input_length, consumed, ignore_ws);
  119|       |
  120|      7|   if(consumed != input_length) {
  ------------------
  |  Branch (120:7): [True: 0, False: 7]
  ------------------
  121|      0|      throw Invalid_Argument("hex_decode: input did not have full bytes");
  122|      0|   }
  123|       |
  124|      7|   return written;
  125|      7|}
_ZN5Botan17hex_decode_lockedEPKcmb:
  135|      7|secure_vector<uint8_t> hex_decode_locked(const char input[], size_t input_length, bool ignore_ws) {
  136|      7|   secure_vector<uint8_t> bin(1 + input_length / 2);
  137|       |
  138|      7|   const size_t written = hex_decode(bin.data(), input, input_length, ignore_ws);
  139|       |
  140|      7|   bin.resize(written);
  141|      7|   return bin;
  142|      7|}
_ZN5Botan17hex_decode_lockedENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEb:
  144|      4|secure_vector<uint8_t> hex_decode_locked(std::string_view input, bool ignore_ws) {
  145|      4|   return hex_decode_locked(input.data(), input.size(), ignore_ws);
  146|      4|}
hex.cpp:_ZN5Botan12_GLOBAL__N_115hex_char_to_binEc:
   54|    520|uint8_t hex_char_to_bin(char input) {
   55|       |   // Starts of valid value ranges (v_lo) and their lengths (v_range)
   56|    520|   constexpr uint64_t v_lo = make_uint64(0, '0', 'a', 'A', ' ', '\n', '\t', '\r');
   57|    520|   constexpr uint64_t v_range = make_uint64(0, 10, 6, 6, 1, 1, 1, 1);
   58|       |
   59|    520|   const uint8_t x = static_cast<uint8_t>(input);
   60|    520|   const uint64_t x8 = x * 0x0101010101010101;
   61|       |
   62|    520|   const uint64_t v_mask = swar_in_range<uint64_t>(x8, v_lo, v_range) ^ 0x8000000000000000;
   63|       |
   64|       |   // This is the offset added to x to get the value we need
   65|    520|   const uint64_t val_v = 0xd0a9c960767773 ^ static_cast<uint64_t>(0xFF - x) << 56;
   66|       |
   67|    520|   return x + static_cast<uint8_t>(val_v >> (8 * index_of_first_set_byte(v_mask)));
   68|    520|}

_ZN5Botan12HashFunction6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_:
  111|      1|std::unique_ptr<HashFunction> HashFunction::create(std::string_view algo_spec, std::string_view provider) {
  112|       |#if defined(BOTAN_HAS_COMMONCRYPTO)
  113|       |   if(provider.empty() || provider == "commoncrypto") {
  114|       |      if(auto hash = make_commoncrypto_hash(algo_spec))
  115|       |         return hash;
  116|       |
  117|       |      if(!provider.empty())
  118|       |         return nullptr;
  119|       |   }
  120|       |#endif
  121|       |
  122|      1|   if(provider.empty() == false && provider != "base") {
  ------------------
  |  Branch (122:7): [True: 0, False: 1]
  |  Branch (122:36): [True: 0, False: 0]
  ------------------
  123|      0|      return nullptr;  // unknown provider
  124|      0|   }
  125|       |
  126|      1|#if defined(BOTAN_HAS_SHA1)
  127|      1|   if(algo_spec == "SHA-1") {
  ------------------
  |  Branch (127:7): [True: 0, False: 1]
  ------------------
  128|      0|      return std::make_unique<SHA_1>();
  129|      0|   }
  130|      1|#endif
  131|       |
  132|      1|#if defined(BOTAN_HAS_SHA2_32)
  133|      1|   if(algo_spec == "SHA-224") {
  ------------------
  |  Branch (133:7): [True: 0, False: 1]
  ------------------
  134|      0|      return std::make_unique<SHA_224>();
  135|      0|   }
  136|       |
  137|      1|   if(algo_spec == "SHA-256") {
  ------------------
  |  Branch (137:7): [True: 1, False: 0]
  ------------------
  138|      1|      return std::make_unique<SHA_256>();
  139|      1|   }
  140|      0|#endif
  141|       |
  142|      0|#if defined(BOTAN_HAS_SHA2_64)
  143|      0|   if(algo_spec == "SHA-384") {
  ------------------
  |  Branch (143:7): [True: 0, False: 0]
  ------------------
  144|      0|      return std::make_unique<SHA_384>();
  145|      0|   }
  146|       |
  147|      0|   if(algo_spec == "SHA-512") {
  ------------------
  |  Branch (147:7): [True: 0, False: 0]
  ------------------
  148|      0|      return std::make_unique<SHA_512>();
  149|      0|   }
  150|       |
  151|      0|   if(algo_spec == "SHA-512-256") {
  ------------------
  |  Branch (151:7): [True: 0, False: 0]
  ------------------
  152|      0|      return std::make_unique<SHA_512_256>();
  153|      0|   }
  154|      0|#endif
  155|       |
  156|      0|#if defined(BOTAN_HAS_RIPEMD_160)
  157|      0|   if(algo_spec == "RIPEMD-160") {
  ------------------
  |  Branch (157:7): [True: 0, False: 0]
  ------------------
  158|      0|      return std::make_unique<RIPEMD_160>();
  159|      0|   }
  160|      0|#endif
  161|       |
  162|      0|#if defined(BOTAN_HAS_WHIRLPOOL)
  163|      0|   if(algo_spec == "Whirlpool") {
  ------------------
  |  Branch (163:7): [True: 0, False: 0]
  ------------------
  164|      0|      return std::make_unique<Whirlpool>();
  165|      0|   }
  166|      0|#endif
  167|       |
  168|      0|#if defined(BOTAN_HAS_MD5)
  169|      0|   if(algo_spec == "MD5") {
  ------------------
  |  Branch (169:7): [True: 0, False: 0]
  ------------------
  170|      0|      return std::make_unique<MD5>();
  171|      0|   }
  172|      0|#endif
  173|       |
  174|      0|#if defined(BOTAN_HAS_MD4)
  175|      0|   if(algo_spec == "MD4") {
  ------------------
  |  Branch (175:7): [True: 0, False: 0]
  ------------------
  176|      0|      return std::make_unique<MD4>();
  177|      0|   }
  178|      0|#endif
  179|       |
  180|      0|#if defined(BOTAN_HAS_GOST_34_11)
  181|      0|   if(algo_spec == "GOST-R-34.11-94" || algo_spec == "GOST-34.11") {
  ------------------
  |  Branch (181:7): [True: 0, False: 0]
  |  Branch (181:41): [True: 0, False: 0]
  ------------------
  182|      0|      return std::make_unique<GOST_34_11>();
  183|      0|   }
  184|      0|#endif
  185|       |
  186|      0|#if defined(BOTAN_HAS_ADLER32)
  187|      0|   if(algo_spec == "Adler32") {
  ------------------
  |  Branch (187:7): [True: 0, False: 0]
  ------------------
  188|      0|      return std::make_unique<Adler32>();
  189|      0|   }
  190|      0|#endif
  191|       |
  192|      0|#if defined(BOTAN_HAS_ASCON_HASH256)
  193|      0|   if(algo_spec == "Ascon-Hash256") {
  ------------------
  |  Branch (193:7): [True: 0, False: 0]
  ------------------
  194|      0|      return std::make_unique<Ascon_Hash256>();
  195|      0|   }
  196|      0|#endif
  197|       |
  198|      0|#if defined(BOTAN_HAS_CRC24)
  199|      0|   if(algo_spec == "CRC24") {
  ------------------
  |  Branch (199:7): [True: 0, False: 0]
  ------------------
  200|      0|      return std::make_unique<CRC24>();
  201|      0|   }
  202|      0|#endif
  203|       |
  204|      0|#if defined(BOTAN_HAS_CRC32)
  205|      0|   if(algo_spec == "CRC32") {
  ------------------
  |  Branch (205:7): [True: 0, False: 0]
  ------------------
  206|      0|      return std::make_unique<CRC32>();
  207|      0|   }
  208|      0|#endif
  209|       |
  210|      0|#if defined(BOTAN_HAS_STREEBOG)
  211|      0|   if(algo_spec == "Streebog-256") {
  ------------------
  |  Branch (211:7): [True: 0, False: 0]
  ------------------
  212|      0|      return std::make_unique<Streebog>(256);
  213|      0|   }
  214|      0|   if(algo_spec == "Streebog-512") {
  ------------------
  |  Branch (214:7): [True: 0, False: 0]
  ------------------
  215|      0|      return std::make_unique<Streebog>(512);
  216|      0|   }
  217|      0|#endif
  218|       |
  219|      0|#if defined(BOTAN_HAS_SM3)
  220|      0|   if(algo_spec == "SM3") {
  ------------------
  |  Branch (220:7): [True: 0, False: 0]
  ------------------
  221|      0|      return std::make_unique<SM3>();
  222|      0|   }
  223|      0|#endif
  224|       |
  225|      0|   const SCAN_Name req(algo_spec);
  226|       |
  227|      0|#if defined(BOTAN_HAS_SKEIN_512)
  228|      0|   if(req.algo_name() == "Skein-512") {
  ------------------
  |  Branch (228:7): [True: 0, False: 0]
  ------------------
  229|      0|      return std::make_unique<Skein_512>(req.arg_as_integer(0, 512), req.arg(1, ""));
  230|      0|   }
  231|      0|#endif
  232|       |
  233|      0|#if defined(BOTAN_HAS_BLAKE2B)
  234|      0|   if(req.algo_name() == "Blake2b" || req.algo_name() == "BLAKE2b") {
  ------------------
  |  Branch (234:7): [True: 0, False: 0]
  |  Branch (234:39): [True: 0, False: 0]
  ------------------
  235|      0|      return std::make_unique<BLAKE2b>(req.arg_as_integer(0, 512));
  236|      0|   }
  237|      0|#endif
  238|       |
  239|      0|#if defined(BOTAN_HAS_BLAKE2S)
  240|      0|   if(req.algo_name() == "Blake2s" || req.algo_name() == "BLAKE2s") {
  ------------------
  |  Branch (240:7): [True: 0, False: 0]
  |  Branch (240:39): [True: 0, False: 0]
  ------------------
  241|      0|      return std::make_unique<BLAKE2s>(req.arg_as_integer(0, 256));
  242|      0|   }
  243|      0|#endif
  244|       |
  245|      0|#if defined(BOTAN_HAS_KECCAK)
  246|      0|   if(req.algo_name() == "Keccak-1600") {
  ------------------
  |  Branch (246:7): [True: 0, False: 0]
  ------------------
  247|      0|      return std::make_unique<Keccak_1600>(req.arg_as_integer(0, 512));
  248|      0|   }
  249|      0|#endif
  250|       |
  251|      0|#if defined(BOTAN_HAS_SHA3)
  252|      0|   if(req.algo_name() == "SHA-3") {
  ------------------
  |  Branch (252:7): [True: 0, False: 0]
  ------------------
  253|      0|      return std::make_unique<SHA_3>(req.arg_as_integer(0, 512));
  254|      0|   }
  255|      0|#endif
  256|       |
  257|      0|#if defined(BOTAN_HAS_SHAKE)
  258|      0|   if(req.algo_name() == "SHAKE-128" && req.arg_count() == 1) {
  ------------------
  |  Branch (258:7): [True: 0, False: 0]
  |  Branch (258:41): [True: 0, False: 0]
  ------------------
  259|      0|      return std::make_unique<SHAKE_128>(req.arg_as_integer(0));
  260|      0|   }
  261|      0|   if(req.algo_name() == "SHAKE-256" && req.arg_count() == 1) {
  ------------------
  |  Branch (261:7): [True: 0, False: 0]
  |  Branch (261:41): [True: 0, False: 0]
  ------------------
  262|      0|      return std::make_unique<SHAKE_256>(req.arg_as_integer(0));
  263|      0|   }
  264|      0|#endif
  265|       |
  266|      0|#if defined(BOTAN_HAS_PARALLEL_HASH)
  267|      0|   if(req.algo_name() == "Parallel") {
  ------------------
  |  Branch (267:7): [True: 0, False: 0]
  ------------------
  268|      0|      std::vector<std::unique_ptr<HashFunction>> hashes;
  269|       |
  270|      0|      for(size_t i = 0; i != req.arg_count(); ++i) {
  ------------------
  |  Branch (270:25): [True: 0, False: 0]
  ------------------
  271|      0|         auto h = HashFunction::create(req.arg(i));
  272|      0|         if(!h) {
  ------------------
  |  Branch (272:13): [True: 0, False: 0]
  ------------------
  273|      0|            return nullptr;
  274|      0|         }
  275|      0|         hashes.push_back(std::move(h));
  276|      0|      }
  277|       |
  278|      0|      return std::make_unique<Parallel>(hashes);
  279|      0|   }
  280|      0|#endif
  281|       |
  282|      0|#if defined(BOTAN_HAS_TRUNCATED_HASH)
  283|      0|   if(req.algo_name() == "Truncated" && req.arg_count() == 2) {
  ------------------
  |  Branch (283:7): [True: 0, False: 0]
  |  Branch (283:41): [True: 0, False: 0]
  ------------------
  284|      0|      auto hash = HashFunction::create(req.arg(0));
  285|      0|      if(!hash) {
  ------------------
  |  Branch (285:10): [True: 0, False: 0]
  ------------------
  286|      0|         return nullptr;
  287|      0|      }
  288|       |
  289|      0|      return std::make_unique<Truncated_Hash>(std::move(hash), req.arg_as_integer(1));
  290|      0|   }
  291|      0|#endif
  292|       |
  293|      0|#if defined(BOTAN_HAS_COMB4P)
  294|      0|   if(req.algo_name() == "Comb4P" && req.arg_count() == 2) {
  ------------------
  |  Branch (294:7): [True: 0, False: 0]
  |  Branch (294:38): [True: 0, False: 0]
  ------------------
  295|      0|      auto h1 = HashFunction::create(req.arg(0));
  296|      0|      auto h2 = HashFunction::create(req.arg(1));
  297|       |
  298|      0|      if(h1 && h2) {
  ------------------
  |  Branch (298:10): [True: 0, False: 0]
  |  Branch (298:16): [True: 0, False: 0]
  ------------------
  299|      0|         return std::make_unique<Comb4P>(std::move(h1), std::move(h2));
  300|      0|      }
  301|      0|   }
  302|      0|#endif
  303|       |
  304|      0|   return nullptr;
  305|      0|}

_ZN5Botan7SHA_25615compress_digestERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm:
   59|     10|                                                             size_t blocks) {
   60|     10|#if defined(BOTAN_HAS_SHA2_32_X86)
   61|     10|   if(CPUID::has(CPUID::Feature::SHA)) {
  ------------------
  |  Branch (61:7): [True: 10, False: 0]
  ------------------
   62|     10|      return SHA_256::compress_digest_x86(digest, input, blocks);
   63|     10|   }
   64|      0|#endif
   65|       |
   66|       |#if defined(BOTAN_HAS_SHA2_32_ARMV8)
   67|       |   if(CPUID::has(CPUID::Feature::SHA2)) {
   68|       |      return SHA_256::compress_digest_armv8(digest, input, blocks);
   69|       |   }
   70|       |#endif
   71|       |
   72|      0|#if defined(BOTAN_HAS_SHA2_32_X86_AVX2)
   73|      0|   if(CPUID::has(CPUID::Feature::AVX2, CPUID::Feature::BMI)) {
  ------------------
  |  Branch (73:7): [True: 0, False: 0]
  ------------------
   74|      0|      return SHA_256::compress_digest_x86_avx2(digest, input, blocks);
   75|      0|   }
   76|      0|#endif
   77|       |
   78|      0|#if defined(BOTAN_HAS_SHA2_32_SIMD)
   79|      0|   if(CPUID::has(CPUID::Feature::SIMD_4X32)) {
  ------------------
  |  Branch (79:7): [True: 0, False: 0]
  ------------------
   80|      0|      return SHA_256::compress_digest_x86_simd(digest, input, blocks);
   81|      0|   }
   82|      0|#endif
   83|       |
   84|      0|   uint32_t A = digest[0];
   85|      0|   uint32_t B = digest[1];
   86|      0|   uint32_t C = digest[2];
   87|      0|   uint32_t D = digest[3];
   88|      0|   uint32_t E = digest[4];
   89|      0|   uint32_t F = digest[5];
   90|      0|   uint32_t G = digest[6];
   91|      0|   uint32_t H = digest[7];
   92|       |
   93|      0|   std::array<uint32_t, 16> W{};
   94|       |
   95|      0|   BufferSlicer in(input);
   96|       |
   97|      0|   for(size_t i = 0; i != blocks; ++i) {
  ------------------
  |  Branch (97:22): [True: 0, False: 0]
  ------------------
   98|      0|      load_be(W, in.take<block_bytes>());
   99|       |
  100|       |      // clang-format off
  101|       |
  102|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], 0x428A2F98);
  103|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0x71374491);
  104|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0xB5C0FBCF);
  105|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0xE9B5DBA5);
  106|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x3956C25B);
  107|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x59F111F1);
  108|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x923F82A4);
  109|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0xAB1C5ED5);
  110|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0xD807AA98);
  111|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0x12835B01);
  112|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0x243185BE);
  113|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0x550C7DC3);
  114|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0x72BE5D74);
  115|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0x80DEB1FE);
  116|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0x9BDC06A7);
  117|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0xC19BF174);
  118|       |
  119|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], 0xE49B69C1);
  120|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0xEFBE4786);
  121|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0x0FC19DC6);
  122|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0x240CA1CC);
  123|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x2DE92C6F);
  124|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x4A7484AA);
  125|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x5CB0A9DC);
  126|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0x76F988DA);
  127|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0x983E5152);
  128|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0xA831C66D);
  129|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0xB00327C8);
  130|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0xBF597FC7);
  131|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0xC6E00BF3);
  132|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0xD5A79147);
  133|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0x06CA6351);
  134|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0x14292967);
  135|       |
  136|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], 0x27B70A85);
  137|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0x2E1B2138);
  138|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0x4D2C6DFC);
  139|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0x53380D13);
  140|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x650A7354);
  141|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x766A0ABB);
  142|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x81C2C92E);
  143|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0x92722C85);
  144|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0xA2BFE8A1);
  145|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0xA81A664B);
  146|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0xC24B8B70);
  147|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0xC76C51A3);
  148|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0xD192E819);
  149|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0xD6990624);
  150|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0xF40E3585);
  151|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0x106AA070);
  152|       |
  153|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], 0x19A4C116);
  154|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0x1E376C08);
  155|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0x2748774C);
  156|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0x34B0BCB5);
  157|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x391C0CB3);
  158|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x4ED8AA4A);
  159|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x5B9CCA4F);
  160|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0x682E6FF3);
  161|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0x748F82EE);
  162|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0x78A5636F);
  163|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0x84C87814);
  164|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0x8CC70208);
  165|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0x90BEFFFA);
  166|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0xA4506CEB);
  167|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0xBEF9A3F7);
  168|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0xC67178F2);
  169|       |
  170|       |      // clang-format on
  171|       |
  172|      0|      A = (digest[0] += A);
  173|      0|      B = (digest[1] += B);
  174|      0|      C = (digest[2] += C);
  175|      0|      D = (digest[3] += D);
  176|      0|      E = (digest[4] += E);
  177|      0|      F = (digest[5] += F);
  178|      0|      G = (digest[6] += G);
  179|      0|      H = (digest[7] += H);
  180|      0|   }
  181|      0|}
_ZN5Botan7SHA_25610compress_nERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm:
  215|     10|void SHA_256::compress_n(digest_type& digest, std::span<const uint8_t> input, size_t blocks) {
  216|     10|   SHA_256::compress_digest(digest, input, blocks);
  217|     10|}
_ZN5Botan7SHA_2564initERNSt3__16vectorIjNS_16secure_allocatorIjEEEE:
  219|      7|void SHA_256::init(digest_type& digest) {
  220|      7|   digest.assign({0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A, 0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19});
  221|      7|}
_ZN5Botan7SHA_2568add_dataENSt3__14spanIKhLm18446744073709551615EEE:
  231|      9|void SHA_256::add_data(std::span<const uint8_t> input) {
  232|      9|   m_md.update(input);
  233|      9|}
_ZN5Botan7SHA_25612final_resultENSt3__14spanIhLm18446744073709551615EEE:
  235|      4|void SHA_256::final_result(std::span<uint8_t> output) {
  236|      4|   m_md.final(output);
  237|      4|}

_ZN5Botan7SHA_25619compress_digest_x86ERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm:
   58|     10|                                                                                    size_t blocks) {
   59|     10|   alignas(64) static const uint32_t K[] = {
   60|     10|      0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5, 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
   61|     10|      0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3, 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
   62|     10|      0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC, 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
   63|     10|      0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7, 0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
   64|     10|      0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13, 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
   65|     10|      0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3, 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
   66|     10|      0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5, 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
   67|     10|      0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208, 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2,
   68|     10|   };
   69|       |
   70|     10|   const uint8_t* input = input_span.data();
   71|       |
   72|     10|   SIMD_4x32 S0 = SIMD_4x32::load_le(&digest[0]);  // NOLINT(*container-data-pointer)
   73|     10|   SIMD_4x32 S1 = SIMD_4x32::load_le(&digest[4]);
   74|       |
   75|     10|   sha256_permute_state(S0, S1);
   76|       |
   77|     20|   while(blocks > 0) {
  ------------------
  |  Branch (77:10): [True: 10, False: 10]
  ------------------
   78|     10|      const auto S0_SAVE = S0;
   79|     10|      const auto S1_SAVE = S1;
   80|       |
   81|     10|      auto W0 = SIMD_4x32::load_be(input);
   82|     10|      auto W1 = SIMD_4x32::load_be(input + 16);
   83|     10|      auto W2 = SIMD_4x32::load_be(input + 32);
   84|     10|      auto W3 = SIMD_4x32::load_be(input + 48);
   85|       |
   86|     10|      sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&K[0]));
   87|     10|      sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&K[4]));
   88|     10|      sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&K[8]));
   89|     10|      sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&K[12]));
   90|       |
   91|     10|      W0 = SIMD_4x32(_mm_sha256msg1_epu32(W0.raw(), W1.raw()));
   92|     10|      W1 = SIMD_4x32(_mm_sha256msg1_epu32(W1.raw(), W2.raw()));
   93|       |
   94|     10|      sha256_msg_exp(W2, W3, W0, W1);
   95|       |
   96|     10|      sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&K[4 * 4]));
   97|     10|      sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&K[4 * 5]));
   98|       |
   99|     10|      sha256_msg_exp(W0, W1, W2, W3);
  100|       |
  101|     10|      sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&K[4 * 6]));
  102|     10|      sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&K[4 * 7]));
  103|       |
  104|     10|      sha256_msg_exp(W2, W3, W0, W1);
  105|       |
  106|     10|      sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&K[4 * 8]));
  107|     10|      sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&K[4 * 9]));
  108|       |
  109|     10|      sha256_msg_exp(W0, W1, W2, W3);
  110|       |
  111|     10|      sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&K[4 * 10]));
  112|     10|      sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&K[4 * 11]));
  113|       |
  114|     10|      sha256_msg_exp(W2, W3, W0, W1);
  115|       |
  116|     10|      sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&K[4 * 12]));
  117|     10|      sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&K[4 * 13]));
  118|       |
  119|     10|      sha256_msg_exp(W0, W1, W2, W3);
  120|       |
  121|     10|      sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&K[4 * 14]));
  122|     10|      sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&K[4 * 15]));
  123|       |
  124|       |      // Add values back to state
  125|     10|      S0 += S0_SAVE;
  126|     10|      S1 += S1_SAVE;
  127|       |
  128|     10|      input += 64;
  129|     10|      blocks--;
  130|     10|   }
  131|       |
  132|     10|   sha256_permute_state(S1, S0);
  133|       |
  134|     10|   S0.store_le(&digest[0]);  // NOLINT(*container-data-pointer)
  135|     10|   S1.store_le(&digest[4]);
  136|     10|}
sha2_32_x86.cpp:_ZN5Botan12_GLOBAL__N_120sha256_permute_stateERNS_9SIMD_4x32ES2_:
   43|     20|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI void sha256_permute_state(SIMD_4x32& S0, SIMD_4x32& S1) {
   44|     20|   S0 = SIMD_4x32(_mm_shuffle_epi32(S0.raw(), 0b10110001));  // CDAB
   45|     20|   S1 = SIMD_4x32(_mm_shuffle_epi32(S1.raw(), 0b00011011));  // EFGH
   46|       |
   47|     20|   const auto T = SIMD_4x32::alignr8(S0, S1);                  // ABEF
   48|       |   S1 = SIMD_4x32(_mm_blend_epi16(S1.raw(), S0.raw(), 0xF0));  // CDGH
   49|     20|   S0 = T;
   50|     20|}
sha2_32_x86.cpp:_ZN5Botan12_GLOBAL__N_112sha256_rnds4ERNS_9SIMD_4x32ES2_RKS1_S4_:
   27|    160|                                                        const SIMD_4x32& k) {
   28|    160|   const auto mk = msg + k;
   29|    160|   S1 = SIMD_4x32(_mm_sha256rnds2_epu32(S1.raw(), S0.raw(), mk.raw()));
   30|    160|   S0 = SIMD_4x32(_mm_sha256rnds2_epu32(S0.raw(), S1.raw(), mk.shift_elems_right<2>().raw()));
   31|    160|}
sha2_32_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha256_msg_expERNS_9SIMD_4x32ES2_S2_S2_:
   33|     60|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI void sha256_msg_exp(SIMD_4x32& W0, SIMD_4x32& W1, SIMD_4x32& W2, SIMD_4x32& W3) {
   34|     60|   W2 += SIMD_4x32::alignr4(W1, W0);
   35|     60|   W0 = SIMD_4x32(_mm_sha256msg1_epu32(W0.raw(), W1.raw()));
   36|     60|   W2 = SIMD_4x32(_mm_sha256msg2_epu32(W2.raw(), W1.raw()));
   37|       |
   38|     60|   W3 += SIMD_4x32::alignr4(W2, W1);
   39|     60|   W1 = SIMD_4x32(_mm_sha256msg1_epu32(W1.raw(), W2.raw()));
   40|     60|   W3 = SIMD_4x32(_mm_sha256msg2_epu32(W3.raw(), W2.raw()));
   41|     60|}

_ZN5Botan4HMAC8add_dataENSt3__14spanIKhLm18446744073709551615EEE:
   20|      1|void HMAC::add_data(std::span<const uint8_t> input) {
   21|      1|   assert_key_material_set();
   22|      1|   m_hash->update(input);
   23|      1|}
_ZN5Botan4HMAC12final_resultENSt3__14spanIhLm18446744073709551615EEE:
   28|      2|void HMAC::final_result(std::span<uint8_t> mac) {
   29|      2|   assert_key_material_set();
   30|      2|   m_hash->final(mac);
   31|      2|   m_hash->update(m_okey);
   32|      2|   m_hash->update(mac.first(m_hash_output_length));
   33|      2|   m_hash->final(mac);
   34|      2|   m_hash->update(m_ikey);
   35|      2|}
_ZNK5Botan4HMAC8key_specEv:
   37|      2|Key_Length_Specification HMAC::key_spec() const {
   38|       |   // Support very long lengths for things like PBKDF2 and the TLS PRF
   39|      2|   return Key_Length_Specification(0, 8192);
   40|      2|}
_ZNK5Botan4HMAC13output_lengthEv:
   42|      4|size_t HMAC::output_length() const {
   43|      4|   return m_hash_output_length;
   44|      4|}
_ZNK5Botan4HMAC19has_keying_materialEv:
   46|      3|bool HMAC::has_keying_material() const {
   47|      3|   return !m_okey.empty();
   48|      3|}
_ZN5Botan4HMAC12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE:
   53|      2|void HMAC::key_schedule(std::span<const uint8_t> key) {
   54|      2|   const uint8_t ipad = 0x36;
   55|      2|   const uint8_t opad = 0x5C;
   56|       |
   57|      2|   m_hash->clear();
   58|       |
   59|      2|   m_ikey.resize(m_hash_block_size);
   60|      2|   m_okey.resize(m_hash_block_size);
   61|       |
   62|      2|   clear_mem(m_ikey.data(), m_ikey.size());
   63|      2|   clear_mem(m_okey.data(), m_okey.size());
   64|       |
   65|       |   /*
   66|       |   * Sometimes the HMAC key length itself is sensitive, as with PBKDF2 where it
   67|       |   * reveals the length of the passphrase. Make some attempt to hide this to
   68|       |   * side channels. Clearly if the secret is longer than the block size then the
   69|       |   * branch to hash first reveals that. In addition, counting the number of
   70|       |   * compression functions executed reveals the size at the granularity of the
   71|       |   * hash function's block size.
   72|       |   *
   73|       |   * The greater concern is for smaller keys; being able to detect when a
   74|       |   * passphrase is say 4 bytes may assist choosing weaker targets. Even though
   75|       |   * the loop bounds are constant, we can only actually read key[0..length] so
   76|       |   * it doesn't seem possible to make this computation truly constant time.
   77|       |   *
   78|       |   * We don't mind leaking if the length is exactly zero since that's
   79|       |   * trivial to simply check.
   80|       |   */
   81|       |
   82|      2|   if(key.size() > m_hash_block_size) {
  ------------------
  |  Branch (82:7): [True: 0, False: 2]
  ------------------
   83|      0|      m_hash->update(key);
   84|      0|      m_hash->final(m_ikey.data());
   85|      2|   } else if(key.size() >= 20) {
  ------------------
  |  Branch (85:14): [True: 2, False: 0]
  ------------------
   86|       |      // For long keys we just leak the length either it is a cryptovariable
   87|       |      // or a long enough password that just the length is not a useful signal
   88|      2|      copy_mem(std::span{m_ikey}.first(key.size()), key);
   89|      2|   } else if(!key.empty()) {
  ------------------
  |  Branch (89:14): [True: 0, False: 0]
  ------------------
   90|      0|      for(size_t i = 0, i_mod_length = 0; i != m_hash_block_size; ++i) {
  ------------------
  |  Branch (90:43): [True: 0, False: 0]
  ------------------
   91|       |         /*
   92|       |         access key[i % length] but avoiding division due to variable
   93|       |         time computation on some processors.
   94|       |         */
   95|      0|         auto needs_reduction = CT::Mask<size_t>::is_lte(key.size(), i_mod_length);
   96|      0|         i_mod_length = needs_reduction.select(0, i_mod_length);
   97|      0|         const uint8_t kb = key[i_mod_length];
   98|       |
   99|      0|         auto in_range = CT::Mask<size_t>::is_lt(i, key.size());
  100|      0|         m_ikey[i] = static_cast<uint8_t>(in_range.if_set_return(kb));
  101|      0|         i_mod_length += 1;
  102|      0|      }
  103|      0|   }
  104|       |
  105|    130|   for(size_t i = 0; i != m_hash_block_size; ++i) {
  ------------------
  |  Branch (105:22): [True: 128, False: 2]
  ------------------
  106|    128|      m_ikey[i] ^= ipad;
  107|    128|      m_okey[i] = m_ikey[i] ^ ipad ^ opad;
  108|    128|   }
  109|       |
  110|      2|   m_hash->update(m_ikey);
  111|      2|}
_ZN5Botan4HMACC2ENSt3__110unique_ptrINS_12HashFunctionENS1_14default_deleteIS3_EEEE:
  140|      1|      m_hash(std::move(hash)),
  141|      1|      m_hash_output_length(m_hash->output_length()),
  142|      1|      m_hash_block_size(m_hash->hash_block_size()) {
  143|      1|   BOTAN_ARG_CHECK(m_hash_block_size >= m_hash_output_length, "HMAC is not compatible with this hash function");
  ------------------
  |  |   35|      1|   do {                                                          \
  |  |   36|      1|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      1|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 1]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      1|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 1]
  |  |  ------------------
  ------------------
  144|      1|}

_ZN5Botan25MessageAuthenticationCode6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_:
   51|      1|                                                                             std::string_view provider) {
   52|      1|   const SCAN_Name req(algo_spec);
   53|       |
   54|      1|#if defined(BOTAN_HAS_BLAKE2BMAC)
   55|      1|   if(req.algo_name() == "Blake2b" || req.algo_name() == "BLAKE2b") {
  ------------------
  |  Branch (55:7): [True: 0, False: 1]
  |  Branch (55:39): [True: 0, False: 1]
  ------------------
   56|      0|      return std::make_unique<BLAKE2bMAC>(req.arg_as_integer(0, 512));
   57|      0|   }
   58|      1|#endif
   59|       |
   60|      1|#if defined(BOTAN_HAS_GMAC)
   61|      1|   if(req.algo_name() == "GMAC" && req.arg_count() == 1) {
  ------------------
  |  Branch (61:7): [True: 0, False: 1]
  |  Branch (61:36): [True: 0, False: 0]
  ------------------
   62|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (62:10): [True: 0, False: 0]
  |  Branch (62:30): [True: 0, False: 0]
  ------------------
   63|      0|         if(auto bc = BlockCipher::create(req.arg(0))) {
  ------------------
  |  Branch (63:18): [True: 0, False: 0]
  ------------------
   64|      0|            return std::make_unique<GMAC>(std::move(bc));
   65|      0|         }
   66|      0|      }
   67|      0|   }
   68|      1|#endif
   69|       |
   70|      1|#if defined(BOTAN_HAS_HMAC)
   71|      1|   if(req.algo_name() == "HMAC" && req.arg_count() == 1) {
  ------------------
  |  Branch (71:7): [True: 1, False: 0]
  |  Branch (71:36): [True: 1, False: 0]
  ------------------
   72|      1|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (72:10): [True: 1, False: 0]
  |  Branch (72:30): [True: 0, False: 0]
  ------------------
   73|      1|         if(auto hash = HashFunction::create(req.arg(0))) {
  ------------------
  |  Branch (73:18): [True: 1, False: 0]
  ------------------
   74|      1|            return std::make_unique<HMAC>(std::move(hash));
   75|      1|         }
   76|      1|      }
   77|      1|   }
   78|      0|#endif
   79|       |
   80|      0|#if defined(BOTAN_HAS_POLY1305)
   81|      0|   if(req.algo_name() == "Poly1305" && req.arg_count() == 0) {
  ------------------
  |  Branch (81:7): [True: 0, False: 0]
  |  Branch (81:40): [True: 0, False: 0]
  ------------------
   82|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (82:10): [True: 0, False: 0]
  |  Branch (82:30): [True: 0, False: 0]
  ------------------
   83|      0|         return std::make_unique<Poly1305>();
   84|      0|      }
   85|      0|   }
   86|      0|#endif
   87|       |
   88|      0|#if defined(BOTAN_HAS_SIPHASH)
   89|      0|   if(req.algo_name() == "SipHash") {
  ------------------
  |  Branch (89:7): [True: 0, False: 0]
  ------------------
   90|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (90:10): [True: 0, False: 0]
  |  Branch (90:30): [True: 0, False: 0]
  ------------------
   91|      0|         return std::make_unique<SipHash>(req.arg_as_integer(0, 2), req.arg_as_integer(1, 4));
   92|      0|      }
   93|      0|   }
   94|      0|#endif
   95|       |
   96|      0|#if defined(BOTAN_HAS_CMAC)
   97|      0|   if((req.algo_name() == "CMAC" || req.algo_name() == "OMAC") && req.arg_count() == 1) {
  ------------------
  |  Branch (97:8): [True: 0, False: 0]
  |  Branch (97:37): [True: 0, False: 0]
  |  Branch (97:67): [True: 0, False: 0]
  ------------------
   98|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (98:10): [True: 0, False: 0]
  |  Branch (98:30): [True: 0, False: 0]
  ------------------
   99|      0|         if(auto bc = BlockCipher::create(req.arg(0))) {
  ------------------
  |  Branch (99:18): [True: 0, False: 0]
  ------------------
  100|      0|            return std::make_unique<CMAC>(std::move(bc));
  101|      0|         }
  102|      0|      }
  103|      0|   }
  104|      0|#endif
  105|       |
  106|      0|#if defined(BOTAN_HAS_ANSI_X919_MAC)
  107|      0|   if(req.algo_name() == "X9.19-MAC") {
  ------------------
  |  Branch (107:7): [True: 0, False: 0]
  ------------------
  108|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (108:10): [True: 0, False: 0]
  |  Branch (108:30): [True: 0, False: 0]
  ------------------
  109|      0|         return std::make_unique<ANSI_X919_MAC>();
  110|      0|      }
  111|      0|   }
  112|      0|#endif
  113|       |
  114|      0|#if defined(BOTAN_HAS_KMAC)
  115|      0|   if(req.algo_name() == "KMAC-128") {
  ------------------
  |  Branch (115:7): [True: 0, False: 0]
  ------------------
  116|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (116:10): [True: 0, False: 0]
  |  Branch (116:30): [True: 0, False: 0]
  ------------------
  117|      0|         if(req.arg_count() != 1) {
  ------------------
  |  Branch (117:13): [True: 0, False: 0]
  ------------------
  118|      0|            throw Invalid_Argument(
  119|      0|               "invalid algorithm specification for KMAC-128: need exactly one argument for output bit length");
  120|      0|         }
  121|      0|         return std::make_unique<KMAC128>(req.arg_as_integer(0));
  122|      0|      }
  123|      0|   }
  124|       |
  125|      0|   if(req.algo_name() == "KMAC-256") {
  ------------------
  |  Branch (125:7): [True: 0, False: 0]
  ------------------
  126|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (126:10): [True: 0, False: 0]
  |  Branch (126:30): [True: 0, False: 0]
  ------------------
  127|      0|         if(req.arg_count() != 1) {
  ------------------
  |  Branch (127:13): [True: 0, False: 0]
  ------------------
  128|      0|            throw Invalid_Argument(
  129|      0|               "invalid algorithm specification for KMAC-256: need exactly one argument for output bit length");
  130|      0|         }
  131|      0|         return std::make_unique<KMAC256>(req.arg_as_integer(0));
  132|      0|      }
  133|      0|   }
  134|      0|#endif
  135|       |
  136|      0|   BOTAN_UNUSED(req);
  ------------------
  |  |  144|      0|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
  137|      0|   BOTAN_UNUSED(provider);
  ------------------
  |  |  144|      0|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
  138|       |
  139|      0|   return nullptr;
  140|      0|}
_ZN5Botan25MessageAuthenticationCode15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_:
  148|      1|                                                                                      std::string_view provider) {
  149|      1|   if(auto mac = MessageAuthenticationCode::create(algo, provider)) {
  ------------------
  |  Branch (149:12): [True: 1, False: 0]
  ------------------
  150|      1|      return mac;
  151|      1|   }
  152|      0|   throw Lookup_Error("MAC", algo, provider);
  153|      1|}

_ZN5Botan6BigInt17from_radix_digitsENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEm:
  125|      6|BigInt BigInt::from_radix_digits(std::string_view digits, size_t radix) {
  126|      6|   if(radix == 16) {
  ------------------
  |  Branch (126:7): [True: 6, False: 0]
  ------------------
  127|      6|      secure_vector<uint8_t> binary;
  128|       |
  129|      6|      if(digits.size() % 2 == 1) {
  ------------------
  |  Branch (129:10): [True: 2, False: 4]
  ------------------
  130|       |         // Handle lack of leading 0
  131|      2|         const char buf0_with_leading_0[2] = {'0', digits[0]};
  132|       |
  133|      2|         binary = hex_decode_locked(buf0_with_leading_0, 2);
  134|       |
  135|      2|         if(digits.size() > 1) {
  ------------------
  |  Branch (135:13): [True: 1, False: 1]
  ------------------
  136|      1|            binary += hex_decode_locked(&digits[1], digits.size() - 1, false);
  137|      1|         }
  138|      4|      } else {
  139|      4|         binary = hex_decode_locked(digits, false);
  140|      4|      }
  141|       |
  142|      6|      return BigInt::from_bytes(binary);
  143|      6|   } else if(radix == 10) {
  ------------------
  |  Branch (143:14): [True: 0, False: 0]
  ------------------
  144|       |      // Use the largest power of 10 that fits in a word, accumulating
  145|       |      // groups of digits into word-sized chunks to minimize the number
  146|       |      // of multiprecision multiplications.
  147|      0|      constexpr word conversion_radix = decimal_conversion_radix();
  148|      0|      constexpr size_t radix_digits = decimal_conversion_radix_digits();
  149|       |
  150|      0|      BigInt r;
  151|       |
  152|       |      // Handle the initial partial block (if digit count is not a multiple of radix_digits)
  153|      0|      const size_t partial_block = digits.size() % radix_digits;
  154|       |
  155|      0|      if(partial_block > 0) {
  ------------------
  |  Branch (155:10): [True: 0, False: 0]
  ------------------
  156|      0|         word acc = 0;
  157|      0|         for(size_t i = 0; i < partial_block; ++i) {
  ------------------
  |  Branch (157:28): [True: 0, False: 0]
  ------------------
  158|      0|            const char c = digits[i];
  159|      0|            BOTAN_ARG_CHECK(c >= '0' && c <= '9', "Invalid decimal character");
  ------------------
  |  |   35|      0|   do {                                                          \
  |  |   36|      0|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      0|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:12): [True: 0, False: 0]
  |  |  |  Branch (37:12): [True: 0, False: 0]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      0|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  160|      0|            acc = acc * 10 + static_cast<word>(c - '0');
  161|      0|         }
  162|      0|         r += acc;
  163|      0|      }
  164|       |
  165|       |      // Process full blocks of radix_digits
  166|      0|      for(size_t i = partial_block; i != digits.size(); i += radix_digits) {
  ------------------
  |  Branch (166:37): [True: 0, False: 0]
  ------------------
  167|      0|         word acc = 0;
  168|      0|         for(size_t j = 0; j < radix_digits; ++j) {
  ------------------
  |  Branch (168:28): [True: 0, False: 0]
  ------------------
  169|      0|            const char c = digits[i + j];
  170|      0|            BOTAN_ARG_CHECK(c >= '0' && c <= '9', "Invalid decimal character");
  ------------------
  |  |   35|      0|   do {                                                          \
  |  |   36|      0|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      0|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:12): [True: 0, False: 0]
  |  |  |  Branch (37:12): [True: 0, False: 0]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      0|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  171|      0|            acc = acc * 10 + static_cast<word>(c - '0');
  172|      0|         }
  173|      0|         r *= conversion_radix;
  174|      0|         r += acc;
  175|      0|      }
  176|       |
  177|      0|      return r;
  178|      0|   } else {
  179|      0|      throw Invalid_Argument("BigInt::from_radix_digits unknown radix");
  180|      0|   }
  181|      6|}

_ZN5Botan6BigIntmIERKS0_:
   23|      9|BigInt& BigInt::operator-=(const BigInt& y) {
   24|      9|   if(&y == this) {
  ------------------
  |  Branch (24:7): [True: 0, False: 9]
  ------------------
   25|      0|      this->clear();
   26|      0|      this->set_sign(Positive);
   27|      0|      return *this;
   28|      0|   }
   29|      9|   return sub(y._data(), y.sig_words(), y.sign());
   30|      9|}
_ZN5Botan6BigInt3addEPKmmNS0_4SignE:
   32|      9|BigInt& BigInt::add(const word y[], size_t y_words, Sign y_sign) {
   33|      9|   const size_t x_sw = sig_words();
   34|       |
   35|      9|   grow_to(std::max(x_sw, y_words) + 1);
   36|       |
   37|      9|   if(sign() == y_sign) {
  ------------------
  |  Branch (37:7): [True: 0, False: 9]
  ------------------
   38|      0|      const word carry = bigint_add2(mutable_data(), size() - 1, y, y_words);
   39|      0|      mutable_data()[size() - 1] += carry;
   40|      9|   } else {
   41|      9|      const int32_t relative_size = bigint_cmp(_data(), x_sw, y, y_words);
   42|       |
   43|      9|      if(relative_size >= 0) {
  ------------------
  |  Branch (43:10): [True: 9, False: 0]
  ------------------
   44|       |         // *this >= y
   45|      9|         bigint_sub2(mutable_data(), x_sw, y, y_words);
   46|      9|      } else {
   47|       |         // *this < y: compute *this = y - *this
   48|      0|         bigint_sub2_rev(mutable_data(), y, y_words);
   49|      0|      }
   50|       |
   51|      9|      if(relative_size < 0) {
  ------------------
  |  Branch (51:10): [True: 0, False: 9]
  ------------------
   52|      0|         set_sign(y_sign);
   53|      9|      } else if(relative_size == 0) {
  ------------------
  |  Branch (53:17): [True: 0, False: 9]
  ------------------
   54|      0|         set_sign(Positive);
   55|      0|      }
   56|      9|   }
   57|       |
   58|      9|   return (*this);
   59|      9|}
_ZN5Botan6BigIntrSEm:
  287|     27|BigInt& BigInt::operator>>=(size_t shift) {
  288|     27|   bigint_shr1(m_data.mutable_data(), m_data.size(), shift);
  289|       |
  290|     27|   if(sig_words() == 0 && m_signedness == Negative) {
  ------------------
  |  Branch (290:7): [True: 0, False: 27]
  |  Branch (290:27): [True: 0, False: 0]
  ------------------
  291|      0|      m_signedness = Positive;
  292|      0|   }
  293|       |
  294|     27|   return (*this);
  295|     27|}

_ZN5Botan6BigInt4add2ERKS0_PKmmNS0_4SignE:
   20|      3|BigInt BigInt::add2(const BigInt& x, const word y[], size_t y_size, BigInt::Sign y_sign) {
   21|      3|   const size_t x_sw = x.sig_words();
   22|       |
   23|      3|   BigInt z = BigInt::with_capacity(std::max(x_sw, y_size) + 1);
   24|       |
   25|      3|   if(x.sign() == y_sign) {
  ------------------
  |  Branch (25:7): [True: 2, False: 1]
  ------------------
   26|      2|      const word carry = bigint_add3(z.mutable_data(), x._data(), x_sw, y, y_size);
   27|      2|      z.mutable_data()[std::max(x_sw, y_size)] += carry;
   28|      2|      z.set_sign(x.sign());
   29|      2|   } else {
   30|      1|      const int32_t relative_size = bigint_cmp(x.data(), x_sw, y, y_size);
   31|       |
   32|      1|      if(relative_size < 0) {
  ------------------
  |  Branch (32:10): [True: 0, False: 1]
  ------------------
   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|      1|      } else if(relative_size == 0) {
  ------------------
  |  Branch (37:17): [True: 0, False: 1]
  ------------------
   38|       |         // Positive zero (nothing to do in this case)
   39|      1|      } 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|      1|         y_size = std::min(x_sw, y_size);
   46|      1|         bigint_sub3(z.mutable_data(), x.data(), x_sw, y, y_size);
   47|      1|         z.set_sign(x.sign());
   48|      1|      }
   49|      1|   }
   50|       |
   51|      3|   return z;
   52|      3|}
_ZN5BotanmlERKNS_6BigIntEm:
   90|      6|BigInt operator*(const BigInt& x, word y) {
   91|      6|   const size_t x_sw = x.sig_words();
   92|       |
   93|      6|   BigInt z = BigInt::with_capacity(x_sw + 1);
   94|       |
   95|      6|   if(x_sw > 0 && y > 0) {
  ------------------
  |  Branch (95:7): [True: 6, False: 0]
  |  Branch (95:19): [True: 6, False: 0]
  ------------------
   96|      6|      bigint_linmul3(z.mutable_data(), x._data(), x_sw, y);
   97|      6|      z.set_sign(x.sign());
   98|      6|   }
   99|       |
  100|      6|   return z;
  101|      6|}
_ZN5BotanlsERKNS_6BigIntEm:
  188|      3|BigInt operator<<(const BigInt& x, size_t shift) {
  189|      3|   if(shift >= 65536) {
  ------------------
  |  Branch (189:7): [True: 0, False: 3]
  ------------------
  190|      0|      throw Invalid_Argument("BigInt left shift count too large");
  191|      0|   }
  192|       |
  193|      3|   if(x.is_zero()) {
  ------------------
  |  Branch (193:7): [True: 0, False: 3]
  ------------------
  194|      0|      return BigInt::zero();
  195|      0|   }
  196|       |
  197|      3|   const size_t x_sw = x.sig_words();
  198|       |
  199|      3|   const size_t new_size = x_sw + shift / WordInfo<word>::bits + 1;
  200|      3|   BigInt y = BigInt::with_capacity(new_size);
  201|      3|   bigint_shl2(y.mutable_data(), new_size, x._data(), x_sw, shift);
  202|      3|   y.set_sign(x.sign());
  203|      3|   return y;
  204|      3|}

_ZN5Botan6BigIntC2Em:
   20|      1|BigInt::BigInt(uint64_t n) {
   21|      1|   if constexpr(sizeof(word) == 8) {
   22|      1|      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|}
_ZN5Botan6BigInt13with_capacityEm:
   51|     14|BigInt BigInt::with_capacity(size_t size) {
   52|     14|   BigInt bn;
   53|     14|   bn.grow_to(size);
   54|     14|   return bn;
   55|     14|}
_ZN5Botan6BigInt11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   57|      6|BigInt BigInt::from_string(std::string_view str) {
   58|      6|   size_t prefix_bytes = 0;
   59|      6|   bool negative = false;
   60|      6|   size_t radix = 10;
   61|       |
   62|      6|   if(!str.empty() && str[0] == '-') {
  ------------------
  |  Branch (62:7): [True: 6, False: 0]
  |  Branch (62:23): [True: 0, False: 6]
  ------------------
   63|      0|      prefix_bytes += 1;
   64|      0|      negative = true;
   65|      0|   }
   66|       |
   67|      6|   if(str.length() > prefix_bytes + 2 && str[prefix_bytes] == '0' && str[prefix_bytes + 1] == 'x') {
  ------------------
  |  Branch (67:7): [True: 6, False: 0]
  |  Branch (67:42): [True: 6, False: 0]
  |  Branch (67:70): [True: 6, False: 0]
  ------------------
   68|      6|      prefix_bytes += 2;
   69|      6|      radix = 16;
   70|      6|   }
   71|       |
   72|      6|   BigInt r = BigInt::from_radix_digits(str.substr(prefix_bytes), radix);
   73|       |
   74|      6|   if(negative) {
  ------------------
  |  Branch (74:7): [True: 0, False: 6]
  ------------------
   75|      0|      r.set_sign(Negative);
   76|      6|   } else {
   77|      6|      r.set_sign(Positive);
   78|      6|   }
   79|       |
   80|      6|   return r;
   81|      6|}
_ZN5Botan6BigInt10from_bytesENSt3__14spanIKhLm18446744073709551615EEE:
   83|      6|BigInt BigInt::from_bytes(std::span<const uint8_t> input) {
   84|      6|   BigInt r;
   85|      6|   r.assign_from_bytes(input);
   86|      6|   return r;
   87|      6|}
_ZNK5Botan6BigInt8cmp_wordEm:
  122|      4|int32_t BigInt::cmp_word(word other) const {
  123|      4|   if(signum() < 0) {
  ------------------
  |  Branch (123:7): [True: 0, False: 4]
  ------------------
  124|      0|      return -1;  // other is positive ...
  125|      0|   }
  126|       |
  127|      4|   const size_t sw = this->sig_words();
  128|      4|   if(sw > 1) {
  ------------------
  |  Branch (128:7): [True: 2, False: 2]
  ------------------
  129|      2|      return 1;  // must be larger since other is just one word ...
  130|      2|   }
  131|       |
  132|      2|   return bigint_cmp(this->_data(), sw, &other, 1);
  133|      4|}
_ZNK5Botan6BigInt3cmpERKS0_b:
  138|    828|int32_t BigInt::cmp(const BigInt& other, bool check_signs) const {
  139|    828|   if(check_signs) {
  ------------------
  |  Branch (139:7): [True: 828, False: 0]
  ------------------
  140|    828|      if(other.signum() >= 0 && this->signum() < 0) {
  ------------------
  |  Branch (140:10): [True: 828, False: 0]
  |  Branch (140:33): [True: 0, False: 828]
  ------------------
  141|      0|         return -1;
  142|      0|      }
  143|       |
  144|    828|      if(other.signum() < 0 && this->signum() >= 0) {
  ------------------
  |  Branch (144:10): [True: 0, False: 828]
  |  Branch (144:32): [True: 0, False: 0]
  ------------------
  145|      0|         return 1;
  146|      0|      }
  147|       |
  148|    828|      if(other.signum() < 0 && this->signum() < 0) {
  ------------------
  |  Branch (148:10): [True: 0, False: 828]
  |  Branch (148:32): [True: 0, False: 0]
  ------------------
  149|      0|         return (-bigint_cmp(this->_data(), this->size(), other._data(), other.size()));
  150|      0|      }
  151|    828|   }
  152|       |
  153|    828|   return bigint_cmp(this->_data(), this->size(), other._data(), other.size());
  154|    828|}
_ZNK5Botan6BigInt8is_equalERKS0_:
  156|      2|bool BigInt::is_equal(const BigInt& other) const {
  157|      2|   if(this->sign() != other.sign()) {
  ------------------
  |  Branch (157:7): [True: 0, False: 2]
  ------------------
  158|      0|      return false;
  159|      0|   }
  160|       |
  161|      2|   return bigint_ct_is_eq(this->_data(), this->size(), other._data(), other.size()).as_bool();
  162|      2|}
_ZNK5Botan6BigInt12is_less_thanERKS0_:
  164|      1|bool BigInt::is_less_than(const BigInt& other) const {
  165|      1|   if(this->signum() < 0 && other.signum() >= 0) {
  ------------------
  |  Branch (165:7): [True: 0, False: 1]
  |  Branch (165:29): [True: 0, False: 0]
  ------------------
  166|      0|      return true;
  167|      0|   }
  168|       |
  169|      1|   if(this->signum() >= 0 && other.signum() < 0) {
  ------------------
  |  Branch (169:7): [True: 1, False: 0]
  |  Branch (169:30): [True: 0, False: 1]
  ------------------
  170|      0|      return false;
  171|      0|   }
  172|       |
  173|      1|   if(other.signum() < 0 && this->signum() < 0) {
  ------------------
  |  Branch (173:7): [True: 0, False: 1]
  |  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|      1|   return bigint_ct_is_lt(this->_data(), this->size(), other._data(), other.size()).as_bool();
  178|      1|}
_ZN5Botan6BigInt4Data11set_to_zeroEv:
  191|      6|void BigInt::Data::set_to_zero() {
  192|      6|   m_reg.resize(m_reg.capacity());
  193|      6|   clear_mem(m_reg.data(), m_reg.size());
  194|      6|   m_sig_words = 0;
  195|      6|}
_ZNK5Botan6BigInt4Data14calc_sig_wordsEv:
  215|     69|size_t BigInt::Data::calc_sig_words() const {
  216|     69|   const size_t sz = m_reg.size();
  217|     69|   size_t sig = sz;
  218|       |
  219|     69|   word sub = 1;
  220|       |
  221|  1.44k|   for(size_t i = 0; i != sz; ++i) {
  ------------------
  |  Branch (221:22): [True: 1.37k, False: 69]
  ------------------
  222|  1.37k|      const word w = m_reg[sz - i - 1];
  223|  1.37k|      sub &= ct_is_zero(w);
  224|  1.37k|      sig -= sub;
  225|  1.37k|   }
  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|     69|   CT::unpoison(sig);
  232|       |
  233|     69|   return sig;
  234|     69|}
_ZNK5Botan6BigInt5bytesEv:
  294|    826|size_t BigInt::bytes() const {
  295|    826|   return round_up(bits(), 8) / 8;
  296|    826|}
_ZNK5Botan6BigInt13top_bits_freeEv:
  298|    834|size_t BigInt::top_bits_free() const {
  299|    834|   const size_t words = sig_words();
  300|       |
  301|    834|   const word top_word = word_at(words - 1);
  302|    834|   const size_t bits_used = high_bit(CT::value_barrier(top_word));
  303|    834|   CT::unpoison(bits_used);
  304|    834|   return WordInfo<word>::bits - bits_used;
  305|    834|}
_ZNK5Botan6BigInt4bitsEv:
  307|    831|size_t BigInt::bits() const {
  308|    831|   const size_t words = sig_words();
  309|       |
  310|    831|   if(words == 0) {
  ------------------
  |  Branch (310:7): [True: 0, False: 831]
  ------------------
  311|      0|      return 0;
  312|      0|   }
  313|       |
  314|    831|   const size_t full_words = (words - 1) * WordInfo<word>::bits;
  315|    831|   const size_t top_bits = WordInfo<word>::bits - top_bits_free();
  316|       |
  317|    831|   return full_words + top_bits;
  318|    831|}
_ZN5Botan6BigInt12reduce_belowERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  329|      3|size_t BigInt::reduce_below(const BigInt& p, secure_vector<word>& ws) {
  330|      3|   if(p.signum() < 0 || this->signum() < 0) {
  ------------------
  |  Branch (330:7): [True: 0, False: 3]
  |  Branch (330:25): [True: 0, False: 3]
  ------------------
  331|      0|      throw Invalid_Argument("BigInt::reduce_below both values must be positive");
  332|      0|   }
  333|       |
  334|      3|   const size_t p_words = p.sig_words();
  335|       |
  336|      3|   if(size() < p_words + 1) {
  ------------------
  |  Branch (336:7): [True: 0, False: 3]
  ------------------
  337|      0|      grow_to(p_words + 1);
  338|      0|   }
  339|       |
  340|      3|   if(ws.size() < p_words + 1) {
  ------------------
  |  Branch (340:7): [True: 3, False: 0]
  ------------------
  341|      3|      ws.resize(p_words + 1);
  342|      3|   }
  343|       |
  344|      3|   clear_mem(ws.data(), ws.size());
  345|       |
  346|      3|   size_t reductions = 0;
  347|       |
  348|      3|   for(;;) {
  349|      3|      const word borrow = bigint_sub3(ws.data(), _data(), p_words + 1, p._data(), p_words);
  350|      3|      if(borrow > 0) {
  ------------------
  |  Branch (350:10): [True: 3, False: 0]
  ------------------
  351|      3|         break;
  352|      3|      }
  353|       |
  354|      0|      ++reductions;
  355|      0|      swap_reg(ws);
  356|      0|   }
  357|       |
  358|      3|   return reductions;
  359|      3|}
_ZNK5Botan6BigInt12serialize_toENSt3__14spanIhLm18446744073709551615EEE:
  395|    826|void BigInt::serialize_to(std::span<uint8_t> output) const {
  396|    826|   BOTAN_ARG_CHECK(this->bytes() <= output.size(), "Insufficient output space");
  ------------------
  |  |   35|    826|   do {                                                          \
  |  |   36|    826|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|    826|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 826]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|    826|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 826]
  |  |  ------------------
  ------------------
  397|       |
  398|    826|   this->binary_encode(output.data(), output.size());
  399|    826|}
_ZNK5Botan6BigInt13binary_encodeEPhm:
  404|    826|void BigInt::binary_encode(uint8_t output[], size_t len) const {
  405|    826|   const size_t full_words = len / sizeof(word);
  406|    826|   const size_t extra_bytes = len % sizeof(word);
  407|       |
  408|  7.43k|   for(size_t i = 0; i != full_words; ++i) {
  ------------------
  |  Branch (408:22): [True: 6.60k, False: 826]
  ------------------
  409|  6.60k|      const word w = word_at(i);
  410|  6.60k|      store_be(w, output + (len - (i + 1) * sizeof(word)));
  411|  6.60k|   }
  412|       |
  413|    826|   if(extra_bytes > 0) {
  ------------------
  |  Branch (413:7): [True: 0, False: 826]
  ------------------
  414|      0|      const word w = word_at(full_words);
  415|       |
  416|      0|      for(size_t i = 0; i != extra_bytes; ++i) {
  ------------------
  |  Branch (416:25): [True: 0, False: 0]
  ------------------
  417|      0|         output[extra_bytes - i - 1] = get_byte_var(sizeof(word) - i - 1, w);
  418|      0|      }
  419|      0|   }
  420|    826|}
_ZN5Botan6BigInt17assign_from_bytesENSt3__14spanIKhLm18446744073709551615EEE:
  425|      6|void BigInt::assign_from_bytes(std::span<const uint8_t> bytes) {
  426|      6|   clear();
  427|       |
  428|      6|   const size_t length = bytes.size();
  429|      6|   const size_t full_words = length / sizeof(word);
  430|      6|   const size_t extra_bytes = length % sizeof(word);
  431|       |
  432|      6|   secure_vector<word> reg((round_up(full_words + (extra_bytes > 0 ? 1 : 0), 8)));
  ------------------
  |  Branch (432:52): [True: 2, False: 4]
  ------------------
  433|       |
  434|     38|   for(size_t i = 0; i != full_words; ++i) {
  ------------------
  |  Branch (434:22): [True: 32, False: 6]
  ------------------
  435|     32|      reg[i] = load_be<word>(bytes.last<sizeof(word)>());
  436|     32|      bytes = bytes.first(bytes.size() - sizeof(word));
  437|     32|   }
  438|       |
  439|      6|   if(!bytes.empty()) {
  ------------------
  |  Branch (439:7): [True: 2, False: 4]
  ------------------
  440|      2|      BOTAN_ASSERT_NOMSG(extra_bytes == bytes.size());
  ------------------
  |  |   77|      2|   do {                                                                     \
  |  |   78|      2|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      2|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 2]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      2|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 2]
  |  |  ------------------
  ------------------
  441|      2|      std::array<uint8_t, sizeof(word)> last_partial_word = {0};
  442|      2|      copy_mem(std::span{last_partial_word}.last(extra_bytes), bytes);
  443|      2|      reg[full_words] = load_be<word>(last_partial_word);
  444|      2|   }
  445|       |
  446|      6|   m_data.swap(reg);
  447|      6|}
_ZNK5Botan6BigInt20_const_time_unpoisonEv:
  559|     72|void BigInt::_const_time_unpoison() const {
  560|     72|   CT::unpoison(m_data.const_data(), m_data.size());
  561|     72|}

_ZN5Botan20vartime_divide_pow2kEmRKNS_6BigIntE:
  232|      3|BigInt vartime_divide_pow2k(size_t k, const BigInt& y_arg) {
  233|      3|   constexpr size_t WB = WordInfo<word>::bits;
  234|       |
  235|      3|   BOTAN_ARG_CHECK(y_arg.signum() != 0, "Cannot divide by zero");
  ------------------
  |  |   35|      3|   do {                                                          \
  |  |   36|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      3|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
  236|      3|   BOTAN_ARG_CHECK(y_arg.signum() >= 0, "Negative divisor not supported");
  ------------------
  |  |   35|      3|   do {                                                          \
  |  |   36|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      3|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
  237|      3|   BOTAN_ARG_CHECK(k > 1, "Invalid k");
  ------------------
  |  |   35|      3|   do {                                                          \
  |  |   36|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      3|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
  238|       |
  239|      3|   BigInt y = y_arg;
  240|       |
  241|      3|   const size_t y_words = y.sig_words();
  242|       |
  243|      3|   BOTAN_ASSERT_NOMSG(y_words > 0);
  ------------------
  |  |   77|      3|   do {                                                                     \
  |  |   78|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      3|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
  244|       |
  245|       |   // Calculate shifts needed to normalize y with high bit set
  246|      3|   const size_t shifts = y.top_bits_free();
  247|       |
  248|      3|   if(shifts > 0) {
  ------------------
  |  Branch (248:7): [True: 0, False: 3]
  ------------------
  249|      0|      y <<= shifts;
  250|      0|   }
  251|       |
  252|      3|   BigInt r;
  253|      3|   r.set_bit(k + shifts);  // (2^k) << shifts
  254|       |
  255|       |   // we know y has not changed size, since we only shifted up to set high bit
  256|      3|   const size_t t = y_words - 1;
  257|      3|   const size_t n = std::max(y_words, r.sig_words()) - 1;
  258|       |
  259|      3|   BOTAN_ASSERT_NOMSG(n >= t);
  ------------------
  |  |   77|      3|   do {                                                                     \
  |  |   78|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      3|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
  260|       |
  261|      3|   BigInt q = BigInt::zero();
  262|      3|   q.grow_to(n - t + 1);
  263|       |
  264|      3|   word* q_words = q.mutable_data();
  265|       |
  266|      3|   BigInt shifted_y = y << (WB * (n - t));
  267|       |
  268|       |   // Set q_{n-t} to number of times r > shifted_y
  269|      3|   secure_vector<word> ws;
  270|      3|   q_words[n - t] = r.reduce_below(shifted_y, ws);
  271|       |
  272|      3|   const word y_t0 = y.word_at(t);
  273|      3|   const word y_t1 = y.word_at(t - 1);
  274|      3|   BOTAN_DEBUG_ASSERT((y_t0 >> (WB - 1)) == 1);
  ------------------
  |  |  130|      3|      do { /* NOLINT(*-avoid-do-while) */ \
  |  |  131|      3|      } while(0)
  |  |  ------------------
  |  |  |  Branch (131:15): [Folded, False: 3]
  |  |  ------------------
  ------------------
  275|       |
  276|      3|   const divide_precomp div_y_t0(y_t0);
  277|       |
  278|     30|   for(size_t i = n; i != t; --i) {
  ------------------
  |  Branch (278:22): [True: 27, False: 3]
  ------------------
  279|     27|      const word x_i0 = r.word_at(i);
  280|     27|      const word x_i1 = r.word_at(i - 1);
  281|     27|      const word x_i2 = r.word_at(i - 2);
  282|       |
  283|     27|      word qit = (x_i0 == y_t0) ? WordInfo<word>::max : div_y_t0.vartime_div_2to1(x_i0, x_i1);
  ------------------
  |  Branch (283:18): [True: 0, False: 27]
  ------------------
  284|       |
  285|       |      // Per HAC 14.23, this operation is required at most twice
  286|     29|      for(size_t j = 0; j != 2; ++j) {
  ------------------
  |  Branch (286:25): [True: 29, False: 0]
  ------------------
  287|     29|         if(division_check_vartime(qit, y_t0, y_t1, x_i0, x_i1, x_i2)) {
  ------------------
  |  Branch (287:13): [True: 2, False: 27]
  ------------------
  288|      2|            BOTAN_ASSERT_NOMSG(qit > 0);
  ------------------
  |  |   77|      2|   do {                                                                     \
  |  |   78|      2|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      2|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 2]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      2|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 2]
  |  |  ------------------
  ------------------
  289|      2|            qit--;
  290|     27|         } else {
  291|     27|            break;
  292|     27|         }
  293|     29|      }
  294|       |
  295|     27|      shifted_y >>= WB;
  296|       |      // Now shifted_y == y << (WB * (i-t-1))
  297|       |
  298|       |      /*
  299|       |      * Special case qit == 0 and qit == 1 which occurs relatively often here due to a
  300|       |      * combination of the fixed 2^k and in many cases the typical structure of
  301|       |      * public moduli (as this function is called by Barrett_Reduction::for_public_modulus).
  302|       |      *
  303|       |      * Over the test suite, about 5% of loop iterations have qit == 1 and 10% have qit == 0
  304|       |      */
  305|       |
  306|     27|      if(qit != 0) {
  ------------------
  |  Branch (306:10): [True: 9, False: 18]
  ------------------
  307|      9|         if(qit == 1) {
  ------------------
  |  Branch (307:13): [True: 3, False: 6]
  ------------------
  308|      3|            r -= shifted_y;
  309|      6|         } else {
  310|      6|            r -= qit * shifted_y;
  311|      6|         }
  312|       |
  313|      9|         if(r.signum() < 0) {
  ------------------
  |  Branch (313:13): [True: 0, False: 9]
  ------------------
  314|      0|            BOTAN_ASSERT_NOMSG(qit > 0);
  ------------------
  |  |   77|      0|   do {                                                                     \
  |  |   78|      0|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      0|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 0]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      0|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  315|      0|            qit--;
  316|      0|            r += shifted_y;
  317|      0|            BOTAN_ASSERT_NOMSG(r.signum() >= 0);
  ------------------
  |  |   77|      0|   do {                                                                     \
  |  |   78|      0|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      0|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 0]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      0|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  318|      0|         }
  319|      9|      }
  320|       |
  321|     27|      q_words[i - t - 1] = qit;
  322|     27|   }
  323|       |
  324|      3|   return q;
  325|      3|}
divide.cpp:_ZN5Botan12_GLOBAL__N_122division_check_vartimeEmmmmmm:
   34|     29|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|     29|   word y3 = 0;
   41|     29|   y1 = word_madd2(q, y1, &y3);
   42|     29|   y2 = word_madd2(q, y2, &y3);
   43|       |
   44|     29|   if(x3 != y3) {
  ------------------
  |  Branch (44:7): [True: 9, False: 20]
  ------------------
   45|      9|      return (y3 > x3);
   46|      9|   }
   47|     20|   if(x2 != y2) {
  ------------------
  |  Branch (47:7): [True: 5, False: 15]
  ------------------
   48|      5|      return (y2 > x2);
   49|      5|   }
   50|     15|   return (y1 > x1);
   51|     20|}

_ZN5Botan17bigint_comba_sqr8EPmPKm:
  293|  6.79M|void bigint_comba_sqr8(word z[16], const word x[8]) {
  294|  6.79M|   word3<word> accum;
  295|       |
  296|  6.79M|   accum.mul(x[0], x[0]);
  297|  6.79M|   z[0] = accum.extract();
  298|  6.79M|   accum.mul_x2(x[0], x[1]);
  299|  6.79M|   z[1] = accum.extract();
  300|  6.79M|   accum.mul_x2(x[0], x[2]);
  301|  6.79M|   accum.mul(x[1], x[1]);
  302|  6.79M|   z[2] = accum.extract();
  303|  6.79M|   accum.mul_x2(x[0], x[3]);
  304|  6.79M|   accum.mul_x2(x[1], x[2]);
  305|  6.79M|   z[3] = accum.extract();
  306|  6.79M|   accum.mul_x2(x[0], x[4]);
  307|  6.79M|   accum.mul_x2(x[1], x[3]);
  308|  6.79M|   accum.mul(x[2], x[2]);
  309|  6.79M|   z[4] = accum.extract();
  310|  6.79M|   accum.mul_x2(x[0], x[5]);
  311|  6.79M|   accum.mul_x2(x[1], x[4]);
  312|  6.79M|   accum.mul_x2(x[2], x[3]);
  313|  6.79M|   z[5] = accum.extract();
  314|  6.79M|   accum.mul_x2(x[0], x[6]);
  315|  6.79M|   accum.mul_x2(x[1], x[5]);
  316|  6.79M|   accum.mul_x2(x[2], x[4]);
  317|  6.79M|   accum.mul(x[3], x[3]);
  318|  6.79M|   z[6] = accum.extract();
  319|  6.79M|   accum.mul_x2(x[0], x[7]);
  320|  6.79M|   accum.mul_x2(x[1], x[6]);
  321|  6.79M|   accum.mul_x2(x[2], x[5]);
  322|  6.79M|   accum.mul_x2(x[3], x[4]);
  323|  6.79M|   z[7] = accum.extract();
  324|  6.79M|   accum.mul_x2(x[1], x[7]);
  325|  6.79M|   accum.mul_x2(x[2], x[6]);
  326|  6.79M|   accum.mul_x2(x[3], x[5]);
  327|  6.79M|   accum.mul(x[4], x[4]);
  328|  6.79M|   z[8] = accum.extract();
  329|  6.79M|   accum.mul_x2(x[2], x[7]);
  330|  6.79M|   accum.mul_x2(x[3], x[6]);
  331|  6.79M|   accum.mul_x2(x[4], x[5]);
  332|  6.79M|   z[9] = accum.extract();
  333|  6.79M|   accum.mul_x2(x[3], x[7]);
  334|  6.79M|   accum.mul_x2(x[4], x[6]);
  335|  6.79M|   accum.mul(x[5], x[5]);
  336|  6.79M|   z[10] = accum.extract();
  337|  6.79M|   accum.mul_x2(x[4], x[7]);
  338|  6.79M|   accum.mul_x2(x[5], x[6]);
  339|  6.79M|   z[11] = accum.extract();
  340|  6.79M|   accum.mul_x2(x[5], x[7]);
  341|  6.79M|   accum.mul(x[6], x[6]);
  342|  6.79M|   z[12] = accum.extract();
  343|  6.79M|   accum.mul_x2(x[6], x[7]);
  344|  6.79M|   z[13] = accum.extract();
  345|  6.79M|   accum.mul(x[7], x[7]);
  346|  6.79M|   z[14] = accum.extract();
  347|  6.79M|   z[15] = accum.extract();
  348|  6.79M|}
_ZN5Botan17bigint_comba_mul8EPmPKmS2_:
  353|  5.22M|void bigint_comba_mul8(word z[16], const word x[8], const word y[8]) {
  354|  5.22M|   word3<word> accum;
  355|       |
  356|  5.22M|   accum.mul(x[0], y[0]);
  357|  5.22M|   z[0] = accum.extract();
  358|  5.22M|   accum.mul(x[0], y[1]);
  359|  5.22M|   accum.mul(x[1], y[0]);
  360|  5.22M|   z[1] = accum.extract();
  361|  5.22M|   accum.mul(x[0], y[2]);
  362|  5.22M|   accum.mul(x[1], y[1]);
  363|  5.22M|   accum.mul(x[2], y[0]);
  364|  5.22M|   z[2] = accum.extract();
  365|  5.22M|   accum.mul(x[0], y[3]);
  366|  5.22M|   accum.mul(x[1], y[2]);
  367|  5.22M|   accum.mul(x[2], y[1]);
  368|  5.22M|   accum.mul(x[3], y[0]);
  369|  5.22M|   z[3] = accum.extract();
  370|  5.22M|   accum.mul(x[0], y[4]);
  371|  5.22M|   accum.mul(x[1], y[3]);
  372|  5.22M|   accum.mul(x[2], y[2]);
  373|  5.22M|   accum.mul(x[3], y[1]);
  374|  5.22M|   accum.mul(x[4], y[0]);
  375|  5.22M|   z[4] = accum.extract();
  376|  5.22M|   accum.mul(x[0], y[5]);
  377|  5.22M|   accum.mul(x[1], y[4]);
  378|  5.22M|   accum.mul(x[2], y[3]);
  379|  5.22M|   accum.mul(x[3], y[2]);
  380|  5.22M|   accum.mul(x[4], y[1]);
  381|  5.22M|   accum.mul(x[5], y[0]);
  382|  5.22M|   z[5] = accum.extract();
  383|  5.22M|   accum.mul(x[0], y[6]);
  384|  5.22M|   accum.mul(x[1], y[5]);
  385|  5.22M|   accum.mul(x[2], y[4]);
  386|  5.22M|   accum.mul(x[3], y[3]);
  387|  5.22M|   accum.mul(x[4], y[2]);
  388|  5.22M|   accum.mul(x[5], y[1]);
  389|  5.22M|   accum.mul(x[6], y[0]);
  390|  5.22M|   z[6] = accum.extract();
  391|  5.22M|   accum.mul(x[0], y[7]);
  392|  5.22M|   accum.mul(x[1], y[6]);
  393|  5.22M|   accum.mul(x[2], y[5]);
  394|  5.22M|   accum.mul(x[3], y[4]);
  395|  5.22M|   accum.mul(x[4], y[3]);
  396|  5.22M|   accum.mul(x[5], y[2]);
  397|  5.22M|   accum.mul(x[6], y[1]);
  398|  5.22M|   accum.mul(x[7], y[0]);
  399|  5.22M|   z[7] = accum.extract();
  400|  5.22M|   accum.mul(x[1], y[7]);
  401|  5.22M|   accum.mul(x[2], y[6]);
  402|  5.22M|   accum.mul(x[3], y[5]);
  403|  5.22M|   accum.mul(x[4], y[4]);
  404|  5.22M|   accum.mul(x[5], y[3]);
  405|  5.22M|   accum.mul(x[6], y[2]);
  406|  5.22M|   accum.mul(x[7], y[1]);
  407|  5.22M|   z[8] = accum.extract();
  408|  5.22M|   accum.mul(x[2], y[7]);
  409|  5.22M|   accum.mul(x[3], y[6]);
  410|  5.22M|   accum.mul(x[4], y[5]);
  411|  5.22M|   accum.mul(x[5], y[4]);
  412|  5.22M|   accum.mul(x[6], y[3]);
  413|  5.22M|   accum.mul(x[7], y[2]);
  414|  5.22M|   z[9] = accum.extract();
  415|  5.22M|   accum.mul(x[3], y[7]);
  416|  5.22M|   accum.mul(x[4], y[6]);
  417|  5.22M|   accum.mul(x[5], y[5]);
  418|  5.22M|   accum.mul(x[6], y[4]);
  419|  5.22M|   accum.mul(x[7], y[3]);
  420|  5.22M|   z[10] = accum.extract();
  421|  5.22M|   accum.mul(x[4], y[7]);
  422|  5.22M|   accum.mul(x[5], y[6]);
  423|  5.22M|   accum.mul(x[6], y[5]);
  424|  5.22M|   accum.mul(x[7], y[4]);
  425|  5.22M|   z[11] = accum.extract();
  426|  5.22M|   accum.mul(x[5], y[7]);
  427|  5.22M|   accum.mul(x[6], y[6]);
  428|  5.22M|   accum.mul(x[7], y[5]);
  429|  5.22M|   z[12] = accum.extract();
  430|  5.22M|   accum.mul(x[6], y[7]);
  431|  5.22M|   accum.mul(x[7], y[6]);
  432|  5.22M|   z[13] = accum.extract();
  433|  5.22M|   accum.mul(x[7], y[7]);
  434|  5.22M|   z[14] = accum.extract();
  435|  5.22M|   z[15] = accum.extract();
  436|  5.22M|}
_ZN5Botan17bigint_comba_mul9EPmPKmS2_:
  512|     16|void bigint_comba_mul9(word z[18], const word x[9], const word y[9]) {
  513|     16|   word3<word> accum;
  514|       |
  515|     16|   accum.mul(x[0], y[0]);
  516|     16|   z[0] = accum.extract();
  517|     16|   accum.mul(x[0], y[1]);
  518|     16|   accum.mul(x[1], y[0]);
  519|     16|   z[1] = accum.extract();
  520|     16|   accum.mul(x[0], y[2]);
  521|     16|   accum.mul(x[1], y[1]);
  522|     16|   accum.mul(x[2], y[0]);
  523|     16|   z[2] = accum.extract();
  524|     16|   accum.mul(x[0], y[3]);
  525|     16|   accum.mul(x[1], y[2]);
  526|     16|   accum.mul(x[2], y[1]);
  527|     16|   accum.mul(x[3], y[0]);
  528|     16|   z[3] = accum.extract();
  529|     16|   accum.mul(x[0], y[4]);
  530|     16|   accum.mul(x[1], y[3]);
  531|     16|   accum.mul(x[2], y[2]);
  532|     16|   accum.mul(x[3], y[1]);
  533|     16|   accum.mul(x[4], y[0]);
  534|     16|   z[4] = accum.extract();
  535|     16|   accum.mul(x[0], y[5]);
  536|     16|   accum.mul(x[1], y[4]);
  537|     16|   accum.mul(x[2], y[3]);
  538|     16|   accum.mul(x[3], y[2]);
  539|     16|   accum.mul(x[4], y[1]);
  540|     16|   accum.mul(x[5], y[0]);
  541|     16|   z[5] = accum.extract();
  542|     16|   accum.mul(x[0], y[6]);
  543|     16|   accum.mul(x[1], y[5]);
  544|     16|   accum.mul(x[2], y[4]);
  545|     16|   accum.mul(x[3], y[3]);
  546|     16|   accum.mul(x[4], y[2]);
  547|     16|   accum.mul(x[5], y[1]);
  548|     16|   accum.mul(x[6], y[0]);
  549|     16|   z[6] = accum.extract();
  550|     16|   accum.mul(x[0], y[7]);
  551|     16|   accum.mul(x[1], y[6]);
  552|     16|   accum.mul(x[2], y[5]);
  553|     16|   accum.mul(x[3], y[4]);
  554|     16|   accum.mul(x[4], y[3]);
  555|     16|   accum.mul(x[5], y[2]);
  556|     16|   accum.mul(x[6], y[1]);
  557|     16|   accum.mul(x[7], y[0]);
  558|     16|   z[7] = accum.extract();
  559|     16|   accum.mul(x[0], y[8]);
  560|     16|   accum.mul(x[1], y[7]);
  561|     16|   accum.mul(x[2], y[6]);
  562|     16|   accum.mul(x[3], y[5]);
  563|     16|   accum.mul(x[4], y[4]);
  564|     16|   accum.mul(x[5], y[3]);
  565|     16|   accum.mul(x[6], y[2]);
  566|     16|   accum.mul(x[7], y[1]);
  567|     16|   accum.mul(x[8], y[0]);
  568|     16|   z[8] = accum.extract();
  569|     16|   accum.mul(x[1], y[8]);
  570|     16|   accum.mul(x[2], y[7]);
  571|     16|   accum.mul(x[3], y[6]);
  572|     16|   accum.mul(x[4], y[5]);
  573|     16|   accum.mul(x[5], y[4]);
  574|     16|   accum.mul(x[6], y[3]);
  575|     16|   accum.mul(x[7], y[2]);
  576|     16|   accum.mul(x[8], y[1]);
  577|     16|   z[9] = accum.extract();
  578|     16|   accum.mul(x[2], y[8]);
  579|     16|   accum.mul(x[3], y[7]);
  580|     16|   accum.mul(x[4], y[6]);
  581|     16|   accum.mul(x[5], y[5]);
  582|     16|   accum.mul(x[6], y[4]);
  583|     16|   accum.mul(x[7], y[3]);
  584|     16|   accum.mul(x[8], y[2]);
  585|     16|   z[10] = accum.extract();
  586|     16|   accum.mul(x[3], y[8]);
  587|     16|   accum.mul(x[4], y[7]);
  588|     16|   accum.mul(x[5], y[6]);
  589|     16|   accum.mul(x[6], y[5]);
  590|     16|   accum.mul(x[7], y[4]);
  591|     16|   accum.mul(x[8], y[3]);
  592|     16|   z[11] = accum.extract();
  593|     16|   accum.mul(x[4], y[8]);
  594|     16|   accum.mul(x[5], y[7]);
  595|     16|   accum.mul(x[6], y[6]);
  596|     16|   accum.mul(x[7], y[5]);
  597|     16|   accum.mul(x[8], y[4]);
  598|     16|   z[12] = accum.extract();
  599|     16|   accum.mul(x[5], y[8]);
  600|     16|   accum.mul(x[6], y[7]);
  601|     16|   accum.mul(x[7], y[6]);
  602|     16|   accum.mul(x[8], y[5]);
  603|     16|   z[13] = accum.extract();
  604|     16|   accum.mul(x[6], y[8]);
  605|     16|   accum.mul(x[7], y[7]);
  606|     16|   accum.mul(x[8], y[6]);
  607|     16|   z[14] = accum.extract();
  608|     16|   accum.mul(x[7], y[8]);
  609|     16|   accum.mul(x[8], y[7]);
  610|     16|   z[15] = accum.extract();
  611|     16|   accum.mul(x[8], y[8]);
  612|     16|   z[16] = accum.extract();
  613|     16|   z[17] = accum.extract();
  614|     16|}

_ZN5Botan10bigint_mulEPmmPKmmmS2_mmS0_m:
  292|     23|                size_t ws_size) {
  293|     23|   zeroize_buffer(z, z_size);
  294|       |
  295|     23|   if(x_sw == 1) {
  ------------------
  |  Branch (295:7): [True: 0, False: 23]
  ------------------
  296|      0|      bigint_linmul3(z, y, y_sw, x[0]);
  297|     23|   } else if(y_sw == 1) {
  ------------------
  |  Branch (297:14): [True: 0, False: 23]
  ------------------
  298|      0|      bigint_linmul3(z, x, x_sw, y[0]);
  299|     23|   } else if(sized_for_comba_mul<4>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (299:14): [True: 0, False: 23]
  ------------------
  300|      0|      bigint_comba_mul4(z, x, y);
  301|     23|   } else if(sized_for_comba_mul<6>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (301:14): [True: 0, False: 23]
  ------------------
  302|      0|      bigint_comba_mul6(z, x, y);
  303|     23|   } else if(sized_for_comba_mul<8>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (303:14): [True: 7, False: 16]
  ------------------
  304|      7|      bigint_comba_mul8(z, x, y);
  305|     16|   } else if(sized_for_comba_mul<9>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (305:14): [True: 16, False: 0]
  ------------------
  306|     16|      bigint_comba_mul9(z, x, y);
  307|     16|   } else if(sized_for_comba_mul<16>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (307:14): [True: 0, False: 0]
  ------------------
  308|      0|      bigint_comba_mul16(z, x, y);
  309|      0|   } else if(sized_for_comba_mul<24>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (309:14): [True: 0, False: 0]
  ------------------
  310|      0|      bigint_comba_mul24(z, x, y);
  311|      0|   } else if(x_sw < KARATSUBA_MULTIPLY_THRESHOLD || y_sw < KARATSUBA_MULTIPLY_THRESHOLD || workspace == nullptr) {
  ------------------
  |  Branch (311:14): [True: 0, False: 0]
  |  Branch (311:53): [True: 0, False: 0]
  |  Branch (311:92): [True: 0, False: 0]
  ------------------
  312|      0|      basecase_mul(z, z_size, x, x_sw, y, y_sw);
  313|      0|   } else {
  314|      0|      const size_t N = karatsuba_size(z_size, x_size, x_sw, y_size, y_sw);
  315|       |
  316|      0|      if(N > 0 && z_size >= 2 * N && ws_size >= 2 * N) {
  ------------------
  |  Branch (316:10): [True: 0, False: 0]
  |  Branch (316:19): [True: 0, False: 0]
  |  Branch (316:38): [True: 0, False: 0]
  ------------------
  317|      0|         karatsuba_mul(z, x, y, N, workspace);
  318|      0|      } else {
  319|      0|         basecase_mul(z, z_size, x, x_sw, y, y_sw);
  320|      0|      }
  321|      0|   }
  322|     23|}
_ZN5Botan10bigint_sqrEPmmPKmmmS0_m:
  327|      3|void bigint_sqr(word z[], size_t z_size, const word x[], size_t x_size, size_t x_sw, word workspace[], size_t ws_size) {
  328|      3|   zeroize_buffer(z, z_size);
  329|       |
  330|      3|   BOTAN_ASSERT(z_size / 2 >= x_sw, "Output size is sufficient");
  ------------------
  |  |   64|      3|   do {                                                                                 \
  |  |   65|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                     \
  |  |   66|      3|      if(!(expr)) {                                                                     \
  |  |  ------------------
  |  |  |  Branch (66:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   67|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                            \
  |  |   68|      0|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   69|      0|      }                                                                                 \
  |  |   70|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (70:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
  331|       |
  332|      3|   if(x_sw == 1) {
  ------------------
  |  Branch (332:7): [True: 0, False: 3]
  ------------------
  333|      0|      bigint_linmul3(z, x, x_sw, x[0]);
  334|      3|   } else if(sized_for_comba_sqr<4>(x_sw, x_size, z_size)) {
  ------------------
  |  Branch (334:14): [True: 0, False: 3]
  ------------------
  335|      0|      bigint_comba_sqr4(z, x);
  336|      3|   } else if(sized_for_comba_sqr<6>(x_sw, x_size, z_size)) {
  ------------------
  |  Branch (336:14): [True: 0, False: 3]
  ------------------
  337|      0|      bigint_comba_sqr6(z, x);
  338|      3|   } else if(sized_for_comba_sqr<8>(x_sw, x_size, z_size)) {
  ------------------
  |  Branch (338:14): [True: 3, False: 0]
  ------------------
  339|      3|      bigint_comba_sqr8(z, x);
  340|      3|   } else if(sized_for_comba_sqr<9>(x_sw, x_size, z_size)) {
  ------------------
  |  Branch (340:14): [True: 0, False: 0]
  ------------------
  341|      0|      bigint_comba_sqr9(z, x);
  342|      0|   } else if(sized_for_comba_sqr<16>(x_sw, x_size, z_size)) {
  ------------------
  |  Branch (342:14): [True: 0, False: 0]
  ------------------
  343|      0|      bigint_comba_sqr16(z, x);
  344|      0|   } else if(sized_for_comba_sqr<24>(x_sw, x_size, z_size)) {
  ------------------
  |  Branch (344:14): [True: 0, False: 0]
  ------------------
  345|      0|      bigint_comba_sqr24(z, x);
  346|      0|   } else if(x_size < KARATSUBA_SQUARE_THRESHOLD || workspace == nullptr) {
  ------------------
  |  Branch (346:14): [True: 0, False: 0]
  |  Branch (346:53): [True: 0, False: 0]
  ------------------
  347|      0|      basecase_sqr(z, z_size, x, x_sw);
  348|      0|   } else {
  349|      0|      const size_t N = karatsuba_size(z_size, x_size, x_sw);
  350|       |
  351|      0|      if(N > 0 && z_size >= 2 * N && ws_size >= 2 * N) {
  ------------------
  |  Branch (351:10): [True: 0, False: 0]
  |  Branch (351:19): [True: 0, False: 0]
  |  Branch (351:38): [True: 0, False: 0]
  ------------------
  352|      0|         karatsuba_sqr(z, x, N, workspace);
  353|      0|      } else {
  354|      0|         basecase_sqr(z, z_size, x, x_sw);
  355|      0|      }
  356|      0|   }
  357|      3|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm4EEEbmmmmm:
  272|     23|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|     23|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (273:12): [True: 0, False: 23]
  |  Branch (273:26): [True: 0, False: 0]
  |  Branch (273:42): [True: 0, False: 0]
  |  Branch (273:56): [True: 0, False: 0]
  |  Branch (273:72): [True: 0, False: 0]
  ------------------
  274|     23|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm6EEEbmmmmm:
  272|     23|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|     23|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (273:12): [True: 0, False: 23]
  |  Branch (273:26): [True: 0, False: 0]
  |  Branch (273:42): [True: 0, False: 0]
  |  Branch (273:56): [True: 0, False: 0]
  |  Branch (273:72): [True: 0, False: 0]
  ------------------
  274|     23|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm8EEEbmmmmm:
  272|     23|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|     23|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (273:12): [True: 7, False: 16]
  |  Branch (273:26): [True: 7, False: 0]
  |  Branch (273:42): [True: 7, False: 0]
  |  Branch (273:56): [True: 7, False: 0]
  |  Branch (273:72): [True: 7, False: 0]
  ------------------
  274|     23|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm9EEEbmmmmm:
  272|     16|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|     16|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (273:12): [True: 16, False: 0]
  |  Branch (273:26): [True: 16, False: 0]
  |  Branch (273:42): [True: 16, False: 0]
  |  Branch (273:56): [True: 16, False: 0]
  |  Branch (273:72): [True: 16, False: 0]
  ------------------
  274|     16|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm4EEEbmmm:
  277|      3|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) {
  278|      3|   return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (278:12): [True: 0, False: 3]
  |  Branch (278:26): [True: 0, False: 0]
  |  Branch (278:42): [True: 0, False: 0]
  ------------------
  279|      3|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm6EEEbmmm:
  277|      3|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) {
  278|      3|   return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (278:12): [True: 0, False: 3]
  |  Branch (278:26): [True: 0, False: 0]
  |  Branch (278:42): [True: 0, False: 0]
  ------------------
  279|      3|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm8EEEbmmm:
  277|      3|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) {
  278|      3|   return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (278:12): [True: 3, False: 0]
  |  Branch (278:26): [True: 3, False: 0]
  |  Branch (278:42): [True: 3, False: 0]
  ------------------
  279|      3|}

_ZN5Botan19bigint_monty_redc_8EPmPKmS2_mS0_:
  106|  4.14k|void bigint_monty_redc_8(word r[8], const word z[16], const word p[8], word p_dash, word ws[8]) {
  107|  4.14k|   word3<word> accum;
  108|  4.14k|   accum.add(z[0]);
  109|  4.14k|   ws[0] = accum.monty_step(p[0], p_dash);
  110|  4.14k|   accum.mul(ws[0], p[1]);
  111|  4.14k|   accum.add(z[1]);
  112|  4.14k|   ws[1] = accum.monty_step(p[0], p_dash);
  113|  4.14k|   accum.mul(ws[0], p[2]);
  114|  4.14k|   accum.mul(ws[1], p[1]);
  115|  4.14k|   accum.add(z[2]);
  116|  4.14k|   ws[2] = accum.monty_step(p[0], p_dash);
  117|  4.14k|   accum.mul(ws[0], p[3]);
  118|  4.14k|   accum.mul(ws[1], p[2]);
  119|  4.14k|   accum.mul(ws[2], p[1]);
  120|  4.14k|   accum.add(z[3]);
  121|  4.14k|   ws[3] = accum.monty_step(p[0], p_dash);
  122|  4.14k|   accum.mul(ws[0], p[4]);
  123|  4.14k|   accum.mul(ws[1], p[3]);
  124|  4.14k|   accum.mul(ws[2], p[2]);
  125|  4.14k|   accum.mul(ws[3], p[1]);
  126|  4.14k|   accum.add(z[4]);
  127|  4.14k|   ws[4] = accum.monty_step(p[0], p_dash);
  128|  4.14k|   accum.mul(ws[0], p[5]);
  129|  4.14k|   accum.mul(ws[1], p[4]);
  130|  4.14k|   accum.mul(ws[2], p[3]);
  131|  4.14k|   accum.mul(ws[3], p[2]);
  132|  4.14k|   accum.mul(ws[4], p[1]);
  133|  4.14k|   accum.add(z[5]);
  134|  4.14k|   ws[5] = accum.monty_step(p[0], p_dash);
  135|  4.14k|   accum.mul(ws[0], p[6]);
  136|  4.14k|   accum.mul(ws[1], p[5]);
  137|  4.14k|   accum.mul(ws[2], p[4]);
  138|  4.14k|   accum.mul(ws[3], p[3]);
  139|  4.14k|   accum.mul(ws[4], p[2]);
  140|  4.14k|   accum.mul(ws[5], p[1]);
  141|  4.14k|   accum.add(z[6]);
  142|  4.14k|   ws[6] = accum.monty_step(p[0], p_dash);
  143|  4.14k|   accum.mul(ws[0], p[7]);
  144|  4.14k|   accum.mul(ws[1], p[6]);
  145|  4.14k|   accum.mul(ws[2], p[5]);
  146|  4.14k|   accum.mul(ws[3], p[4]);
  147|  4.14k|   accum.mul(ws[4], p[3]);
  148|  4.14k|   accum.mul(ws[5], p[2]);
  149|  4.14k|   accum.mul(ws[6], p[1]);
  150|  4.14k|   accum.add(z[7]);
  151|  4.14k|   ws[7] = accum.monty_step(p[0], p_dash);
  152|  4.14k|   accum.mul(ws[1], p[7]);
  153|  4.14k|   accum.mul(ws[2], p[6]);
  154|  4.14k|   accum.mul(ws[3], p[5]);
  155|  4.14k|   accum.mul(ws[4], p[4]);
  156|  4.14k|   accum.mul(ws[5], p[3]);
  157|  4.14k|   accum.mul(ws[6], p[2]);
  158|  4.14k|   accum.mul(ws[7], p[1]);
  159|  4.14k|   accum.add(z[8]);
  160|  4.14k|   ws[0] = accum.extract();
  161|  4.14k|   accum.mul(ws[2], p[7]);
  162|  4.14k|   accum.mul(ws[3], p[6]);
  163|  4.14k|   accum.mul(ws[4], p[5]);
  164|  4.14k|   accum.mul(ws[5], p[4]);
  165|  4.14k|   accum.mul(ws[6], p[3]);
  166|  4.14k|   accum.mul(ws[7], p[2]);
  167|  4.14k|   accum.add(z[9]);
  168|  4.14k|   ws[1] = accum.extract();
  169|  4.14k|   accum.mul(ws[3], p[7]);
  170|  4.14k|   accum.mul(ws[4], p[6]);
  171|  4.14k|   accum.mul(ws[5], p[5]);
  172|  4.14k|   accum.mul(ws[6], p[4]);
  173|  4.14k|   accum.mul(ws[7], p[3]);
  174|  4.14k|   accum.add(z[10]);
  175|  4.14k|   ws[2] = accum.extract();
  176|  4.14k|   accum.mul(ws[4], p[7]);
  177|  4.14k|   accum.mul(ws[5], p[6]);
  178|  4.14k|   accum.mul(ws[6], p[5]);
  179|  4.14k|   accum.mul(ws[7], p[4]);
  180|  4.14k|   accum.add(z[11]);
  181|  4.14k|   ws[3] = accum.extract();
  182|  4.14k|   accum.mul(ws[5], p[7]);
  183|  4.14k|   accum.mul(ws[6], p[6]);
  184|  4.14k|   accum.mul(ws[7], p[5]);
  185|  4.14k|   accum.add(z[12]);
  186|  4.14k|   ws[4] = accum.extract();
  187|  4.14k|   accum.mul(ws[6], p[7]);
  188|  4.14k|   accum.mul(ws[7], p[6]);
  189|  4.14k|   accum.add(z[13]);
  190|  4.14k|   ws[5] = accum.extract();
  191|  4.14k|   accum.mul(ws[7], p[7]);
  192|  4.14k|   accum.add(z[14]);
  193|  4.14k|   ws[6] = accum.extract();
  194|  4.14k|   accum.add(z[15]);
  195|  4.14k|   ws[7] = accum.extract();
  196|  4.14k|   const word w1 = accum.extract();
  197|  4.14k|   bigint_monty_maybe_sub<8>(r, w1, ws, p);
  198|  4.14k|}

_ZN5Botan17Barrett_ReductionC2ERKNS_6BigIntES1_m:
   17|      3|      m_modulus(m), m_mu(std::move(mu)), m_mod_words(mw), m_modulus_bits(m.bits()) {
   18|       |   // Give some extra space for Karatsuba
   19|      3|   m_modulus.grow_to(m_mod_words + 8);
   20|      3|   m_mu.grow_to(m_mod_words + 8);
   21|      3|}
_ZN5Botan17Barrett_Reduction18for_public_modulusERKNS_6BigIntE:
   33|      3|Barrett_Reduction Barrett_Reduction::for_public_modulus(const BigInt& mod) {
   34|      3|   BOTAN_ARG_CHECK(mod.signum() > 0, "Modulus must be positive");
  ------------------
  |  |   35|      3|   do {                                                          \
  |  |   36|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      3|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
   35|       |
   36|      3|   const size_t mod_words = mod.sig_words();
   37|       |
   38|       |   // Compute mu = floor(2^{2k} / m)
   39|      3|   const size_t mu_bits = 2 * WordInfo<word>::bits * mod_words;
   40|      3|   return Barrett_Reduction(mod, vartime_divide_pow2k(mu_bits, mod), mod_words);
   41|      3|}
_ZNK5Botan17Barrett_Reduction8multiplyERKNS_6BigIntES3_:
  159|      3|BigInt Barrett_Reduction::multiply(const BigInt& x, const BigInt& y) const {
  160|      3|   BOTAN_ARG_CHECK(acceptable_barrett_input(x, m_modulus).as_bool(), "Invalid x param for Barrett multiply");
  ------------------
  |  |   35|      3|   do {                                                          \
  |  |   36|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      3|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
  161|      3|   BOTAN_ARG_CHECK(acceptable_barrett_input(y, m_modulus).as_bool(), "Invalid y param for Barrett multiply");
  ------------------
  |  |   35|      3|   do {                                                          \
  |  |   36|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      3|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
  162|       |
  163|      3|   secure_vector<word> ws(2 * (m_mod_words + 2));
  164|      3|   secure_vector<word> xy(2 * m_mod_words);
  165|       |
  166|      3|   bigint_mul(xy.data(),
  167|      3|              xy.size(),
  168|      3|              x._data(),
  169|      3|              x.size(),
  170|      3|              std::min(x.size(), m_mod_words),
  171|      3|              y._data(),
  172|      3|              y.size(),
  173|      3|              std::min(y.size(), m_mod_words),
  174|      3|              ws.data(),
  175|      3|              ws.size());
  176|       |
  177|      3|   return barrett_reduce(m_mod_words, m_modulus, m_mu, xy, ws);
  178|      3|}
_ZNK5Botan17Barrett_Reduction6squareERKNS_6BigIntE:
  180|      3|BigInt Barrett_Reduction::square(const BigInt& x) const {
  181|      3|   BOTAN_ARG_CHECK(acceptable_barrett_input(x, m_modulus).as_bool(), "Invalid x param for Barrett square");
  ------------------
  |  |   35|      3|   do {                                                          \
  |  |   36|      3|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      3|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 3]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      3|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 3]
  |  |  ------------------
  ------------------
  182|       |
  183|      3|   secure_vector<word> ws(2 * (m_mod_words + 2));
  184|      3|   secure_vector<word> x2(2 * m_mod_words);
  185|       |
  186|      3|   bigint_sqr(x2.data(), x2.size(), x._data(), x.size(), std::min(x.size(), m_mod_words), ws.data(), ws.size());
  187|       |
  188|      3|   return barrett_reduce(m_mod_words, m_modulus, m_mu, x2, ws);
  189|      3|}
_ZNK5Botan17Barrett_Reduction6reduceERKNS_6BigIntE:
  191|      2|BigInt Barrett_Reduction::reduce(const BigInt& x) const {
  192|      2|   BOTAN_ARG_CHECK(x.signum() >= 0, "Argument must be non-negative");
  ------------------
  |  |   35|      2|   do {                                                          \
  |  |   36|      2|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      2|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 2]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      2|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 2]
  |  |  ------------------
  ------------------
  193|       |
  194|      2|   const size_t x_sw = x.sig_words();
  195|      2|   BOTAN_ARG_CHECK(x_sw <= 2 * m_mod_words, "Argument is too large for Barrett reduction");
  ------------------
  |  |   35|      2|   do {                                                          \
  |  |   36|      2|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      2|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 2]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      2|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 2]
  |  |  ------------------
  ------------------
  196|       |
  197|      2|   x.grow_to(2 * m_mod_words);
  198|       |
  199|      2|   secure_vector<word> ws;
  200|      2|   return barrett_reduce(m_mod_words, m_modulus, m_mu, x._as_span(), ws);
  201|      2|}
barrett.cpp:_ZN5Botan12_GLOBAL__N_124acceptable_barrett_inputERKNS_6BigIntES3_:
  151|      9|CT::Choice acceptable_barrett_input(const BigInt& x, const BigInt& modulus) {
  152|      9|   auto x_is_positive = CT::Choice::from_int(static_cast<uint32_t>(x.signum() >= 0));
  153|      9|   auto x_lt_mod = bigint_ct_is_lt(x._data(), x.size(), modulus._data(), modulus.sig_words()).as_choice();
  154|      9|   return x_is_positive && x_lt_mod;
  155|      9|}
barrett.cpp:_ZN5Botan12_GLOBAL__N_114barrett_reduceEmRKNS_6BigIntES3_NSt3__14spanIKmLm18446744073709551615EEERNS4_6vectorImNS_16secure_allocatorImEEEE:
   54|      8|   size_t mod_words, const BigInt& modulus, const BigInt& mu, std::span<const word> x_words, secure_vector<word>& ws) {
   55|      8|   BOTAN_ASSERT_NOMSG(modulus.sig_words() == mod_words);
  ------------------
  |  |   77|      8|   do {                                                                     \
  |  |   78|      8|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      8|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 8]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      8|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 8]
  |  |  ------------------
  ------------------
   56|       |
   57|       |   // Caller must expand input to be at least this size
   58|      8|   BOTAN_ASSERT_NOMSG(x_words.size() >= 2 * mod_words);
  ------------------
  |  |   77|      8|   do {                                                                     \
  |  |   78|      8|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      8|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 8]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      8|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 8]
  |  |  ------------------
  ------------------
   59|       |
   60|       |   // Normally mod_words + 1 but can be + 2 if the modulus is a power of 2
   61|      8|   const size_t mu_words = mu.sig_words();
   62|      8|   BOTAN_ASSERT_NOMSG(mu_words <= mod_words + 2);
  ------------------
  |  |   77|      8|   do {                                                                     \
  |  |   78|      8|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      8|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 8]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      8|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 8]
  |  |  ------------------
  ------------------
   63|       |
   64|      8|   if(ws.size() < 2 * (mod_words + 2)) {
  ------------------
  |  Branch (64:7): [True: 2, False: 6]
  ------------------
   65|      2|      ws.resize(2 * (mod_words + 2));
   66|      2|   }
   67|       |
   68|      8|   CT::poison(x_words);
   69|       |
   70|       |   /*
   71|       |   * Following the notation of Handbook of Applied Cryptography
   72|       |   * Algorithm 14.42 "Barrett modular reduction", page 604
   73|       |   * <https://cacr.uwaterloo.ca/hac/about/chap14.pdf>
   74|       |   *
   75|       |   * Using `mu` for μ in the code
   76|       |   */
   77|       |
   78|       |   // Compute q1 = floor(x / 2^(k - 1)) which is equivalent to ignoring the low (k-1) words
   79|       |
   80|       |   // 2 * mod_words + 1 is sufficient, extra is to enable Karatsuba
   81|      8|   secure_vector<word> r(2 * mu_words + 2);
   82|       |
   83|      8|   copy_mem(r.data(), x_words.data() + (mod_words - 1), mod_words + 1);
   84|       |
   85|       |   // Now compute q2 = q1 * μ
   86|       |
   87|       |   // We allocate more size than required since this allows Karatsuba more often;
   88|       |   // just `mu_words + (mod_words + 1)` is sufficient
   89|      8|   const size_t q2_size = 2 * mu_words + 2;
   90|       |
   91|      8|   secure_vector<word> q2(q2_size);
   92|       |
   93|      8|   bigint_mul(
   94|      8|      q2.data(), q2.size(), r.data(), r.size(), mod_words + 1, mu._data(), mu.size(), mu_words, ws.data(), ws.size());
   95|       |
   96|       |   // Compute r2 = (floor(q2 / b^(k+1)) * m) mod 2^(k+1)
   97|       |   // The division/floor is again effected by just ignoring the low k + 1 words
   98|      8|   bigint_mul(r.data(),
   99|      8|              r.size(),
  100|      8|              &q2[mod_words + 1],  // ignoring the low mod_words + 1 words of the first product
  101|      8|              q2.size() - (mod_words + 1),
  102|      8|              mod_words + 1,
  103|      8|              modulus._data(),
  104|      8|              modulus.size(),
  105|      8|              mod_words,
  106|      8|              ws.data(),
  107|      8|              ws.size());
  108|       |
  109|       |   // Clear the high words of the product, equivalent to computing mod 2^(k+1)
  110|       |   // TODO add masked mul to avoid computing high bits at all
  111|      8|   clear_mem(std::span{r}.subspan(mod_words + 1));
  112|       |
  113|       |   // Compute r = r1 - r2
  114|       |
  115|       |   // The return value of bigint_sub_abs isn't quite right for what we need here so first compare
  116|      8|   const int32_t relative_size = bigint_cmp(r.data(), mod_words + 1, x_words.data(), mod_words + 1);
  117|       |
  118|      8|   bigint_sub_abs(r.data(), r.data(), x_words.data(), mod_words + 1, ws.data());
  119|       |
  120|       |   /*
  121|       |   If r is negative then we have to set r to r + 2^(k+1)
  122|       |
  123|       |   However for r negative computing this sum is equivalent to computing 2^(k+1) - abs(r)
  124|       |   */
  125|      8|   clear_mem(ws.data(), mod_words + 2);
  126|      8|   ws[mod_words + 1] = 1;
  127|      8|   bigint_sub2(ws.data(), mod_words + 2, r.data(), mod_words + 2);
  128|       |
  129|       |   // If relative_size > 0 then assign r to 2^(k+1) - r
  130|      8|   CT::Mask<word>::is_equal(static_cast<word>(relative_size), 1).select_n(r.data(), ws.data(), r.data(), mod_words + 2);
  131|       |
  132|       |   /*
  133|       |   * Per HAC Note 14.44 (ii) "step 4 is repeated at most twice since 0 ≤ r < 3m"
  134|       |   */
  135|      8|   const size_t bound = 2;
  136|       |
  137|      8|   BOTAN_ASSERT_NOMSG(r.size() >= mod_words + 1);
  ------------------
  |  |   77|      8|   do {                                                                     \
  |  |   78|      8|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      8|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 8]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      8|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 8]
  |  |  ------------------
  ------------------
  138|     24|   for(size_t i = 0; i != bound; ++i) {
  ------------------
  |  Branch (138:22): [True: 16, False: 8]
  ------------------
  139|     16|      const word borrow = bigint_sub3(ws.data(), r.data(), mod_words + 1, modulus._data(), mod_words);
  140|     16|      CT::Mask<word>::is_zero(borrow).select_n(r.data(), ws.data(), r.data(), mod_words + 1);
  141|     16|   }
  142|       |
  143|      8|   CT::unpoison(q2);
  144|      8|   CT::unpoison(r);
  145|      8|   CT::unpoison(ws);
  146|      8|   CT::unpoison(x_words);
  147|       |
  148|      8|   return BigInt::_from_words(r);
  149|      8|}

_ZN5Botan17Montgomery_Params4DataC2ERKNS_6BigIntERKNS_17Barrett_ReductionE:
   40|      1|Montgomery_Params::Data::Data(const BigInt& p, const Barrett_Reduction& mod_p) {
   41|      1|   if(p.is_even() || p < 3) {
  ------------------
  |  Branch (41:7): [True: 0, False: 1]
  |  Branch (41:22): [True: 0, False: 1]
  ------------------
   42|      0|      throw Invalid_Argument("Montgomery_Params invalid modulus");
   43|      0|   }
   44|       |
   45|      1|   m_p = p;
   46|      1|   m_p_words = m_p.sig_words();
   47|      1|   m_p_dash = monty_inverse(m_p.word_at(0));
   48|       |
   49|      1|   const BigInt r = BigInt::power_of_2(m_p_words * WordInfo<word>::bits);
   50|       |
   51|      1|   m_r1 = mod_p.reduce(r);
   52|      1|   m_r2 = mod_p.square(m_r1);
   53|      1|   m_r3 = mod_p.multiply(m_r1, m_r2);
   54|       |
   55|       |   // Barrett should be at least zero prefixing up to modulus size
   56|      1|   BOTAN_ASSERT_NOMSG(m_r1.size() >= m_p_words);
  ------------------
  |  |   77|      1|   do {                                                                     \
  |  |   78|      1|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      1|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 1]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      1|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1]
  |  |  ------------------
  ------------------
   57|      1|   BOTAN_ASSERT_NOMSG(m_r2.size() >= m_p_words);
  ------------------
  |  |   77|      1|   do {                                                                     \
  |  |   78|      1|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      1|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 1]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      1|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1]
  |  |  ------------------
  ------------------
   58|      1|   BOTAN_ASSERT_NOMSG(m_r3.size() >= m_p_words);
  ------------------
  |  |   77|      1|   do {                                                                     \
  |  |   78|      1|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|      1|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 1]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|      1|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1]
  |  |  ------------------
  ------------------
   59|      1|}
_ZN5Botan17Montgomery_ParamsC2ERKNS_6BigIntERKNS_17Barrett_ReductionE:
   62|      1|      m_data(std::make_shared<Data>(p, mod_p)) {}
_ZNK5Botan17Montgomery_Params3mulERKNS_6BigIntES3_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
   90|      2|BigInt Montgomery_Params::mul(const BigInt& x, const BigInt& y, secure_vector<word>& ws) const {
   91|      2|   const size_t p_size = this->p_words();
   92|      2|   BigInt z = BigInt::with_capacity(2 * p_size);
   93|      2|   this->mul(z, x, y, ws);
   94|      2|   return z;
   95|      2|}
_ZNK5Botan17Montgomery_Params3mulERNS_6BigIntERKS1_S4_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
   97|      2|void Montgomery_Params::mul(BigInt& z, const BigInt& x, const BigInt& y, secure_vector<word>& ws) const {
   98|      2|   BOTAN_ARG_CHECK(&z != &x && &z != &y, "Montgomery_Params::mul output must not alias inputs");
  ------------------
  |  |   35|      2|   do {                                                          \
  |  |   36|      2|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      4|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:12): [True: 2, False: 0]
  |  |  |  Branch (37:12): [True: 2, False: 0]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      2|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 2]
  |  |  ------------------
  ------------------
   99|       |
  100|      2|   const size_t p_size = this->p_words();
  101|       |
  102|      2|   if(ws.size() < 2 * p_size) {
  ------------------
  |  Branch (102:7): [True: 1, False: 1]
  ------------------
  103|      1|      ws.resize(2 * p_size);
  104|      1|   }
  105|       |
  106|      2|   BOTAN_DEBUG_ASSERT(x.sig_words() <= p_size);
  ------------------
  |  |  130|      2|      do { /* NOLINT(*-avoid-do-while) */ \
  |  |  131|      2|      } while(0)
  |  |  ------------------
  |  |  |  Branch (131:15): [Folded, False: 2]
  |  |  ------------------
  ------------------
  107|      2|   BOTAN_DEBUG_ASSERT(y.sig_words() <= p_size);
  ------------------
  |  |  130|      2|      do { /* NOLINT(*-avoid-do-while) */ \
  |  |  131|      2|      } while(0)
  |  |  ------------------
  |  |  |  Branch (131:15): [Folded, False: 2]
  |  |  ------------------
  ------------------
  108|       |
  109|      2|   if(z.size() < 2 * p_size) {
  ------------------
  |  Branch (109:7): [True: 0, False: 2]
  ------------------
  110|      0|      z.grow_to(2 * p_size);
  111|      0|   }
  112|       |
  113|      2|   bigint_mul(z.mutable_data(),
  114|      2|              z.size(),
  115|      2|              x._data(),
  116|      2|              x.size(),
  117|      2|              std::min(p_size, x.size()),
  118|      2|              y._data(),
  119|      2|              y.size(),
  120|      2|              std::min(p_size, y.size()),
  121|      2|              ws.data(),
  122|      2|              ws.size());
  123|       |
  124|      2|   bigint_monty_redc_inplace(z.mutable_data(), this->p()._data(), p_size, this->p_dash(), ws.data(), ws.size());
  125|      2|}
_ZNK5Botan17Montgomery_Params6mul_byERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  157|      2|void Montgomery_Params::mul_by(BigInt& x, const BigInt& y, secure_vector<word>& ws) const {
  158|      2|   const size_t p_size = this->p_words();
  159|       |
  160|      2|   if(ws.size() < 4 * p_size) {
  ------------------
  |  Branch (160:7): [True: 1, False: 1]
  ------------------
  161|      1|      ws.resize(4 * p_size);
  162|      1|   }
  163|       |
  164|      2|   word* z_data = ws.data();
  165|      2|   word* ws_data = &ws[2 * p_size];
  166|       |
  167|      2|   BOTAN_DEBUG_ASSERT(x.sig_words() <= p_size);
  ------------------
  |  |  130|      2|      do { /* NOLINT(*-avoid-do-while) */ \
  |  |  131|      2|      } while(0)
  |  |  ------------------
  |  |  |  Branch (131:15): [Folded, False: 2]
  |  |  ------------------
  ------------------
  168|       |
  169|      2|   bigint_mul(z_data,
  170|      2|              2 * p_size,
  171|      2|              x._data(),
  172|      2|              x.size(),
  173|      2|              std::min(p_size, x.size()),
  174|      2|              y._data(),
  175|      2|              y.size(),
  176|      2|              std::min(p_size, y.size()),
  177|      2|              ws_data,
  178|      2|              2 * p_size);
  179|       |
  180|      2|   bigint_monty_redc_inplace(z_data, this->p()._data(), p_size, this->p_dash(), ws_data, 2 * p_size);
  181|       |
  182|      2|   if(x.size() < 2 * p_size) {
  ------------------
  |  Branch (182:7): [True: 2, False: 0]
  ------------------
  183|      2|      x.grow_to(2 * p_size);
  184|      2|   }
  185|      2|   copy_mem(x.mutable_data(), z_data, 2 * p_size);
  186|      2|}

_ZN5Botan6PCurve15PrimeOrderCurve15for_named_curveENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
   32|      1|std::shared_ptr<const PrimeOrderCurve> PrimeOrderCurve::for_named_curve(std::string_view name) {
   33|      1|#if defined(BOTAN_HAS_PCURVES_SECP256R1)
   34|      1|   if(name == "secp256r1") {
  ------------------
  |  Branch (34:7): [True: 0, False: 1]
  ------------------
   35|      0|      return PCurveInstance::secp256r1();
   36|      0|   }
   37|      1|#endif
   38|       |
   39|      1|#if defined(BOTAN_HAS_PCURVES_SECP384R1)
   40|      1|   if(name == "secp384r1") {
  ------------------
  |  Branch (40:7): [True: 0, False: 1]
  ------------------
   41|      0|      return PCurveInstance::secp384r1();
   42|      0|   }
   43|      1|#endif
   44|       |
   45|      1|#if defined(BOTAN_HAS_PCURVES_SECP521R1)
   46|      1|   if(name == "secp521r1") {
  ------------------
  |  Branch (46:7): [True: 0, False: 1]
  ------------------
   47|      0|      return PCurveInstance::secp521r1();
   48|      0|   }
   49|      1|#endif
   50|       |
   51|      1|#if defined(BOTAN_HAS_PCURVES_BRAINPOOL256R1)
   52|      1|   if(name == "brainpool256r1") {
  ------------------
  |  Branch (52:7): [True: 0, False: 1]
  ------------------
   53|      0|      return PCurveInstance::brainpool256r1();
   54|      0|   }
   55|      1|#endif
   56|       |
   57|      1|#if defined(BOTAN_HAS_PCURVES_BRAINPOOL384R1)
   58|      1|   if(name == "brainpool384r1") {
  ------------------
  |  Branch (58:7): [True: 0, False: 1]
  ------------------
   59|      0|      return PCurveInstance::brainpool384r1();
   60|      0|   }
   61|      1|#endif
   62|       |
   63|      1|#if defined(BOTAN_HAS_PCURVES_BRAINPOOL512R1)
   64|      1|   if(name == "brainpool512r1") {
  ------------------
  |  Branch (64:7): [True: 0, False: 1]
  ------------------
   65|      0|      return PCurveInstance::brainpool512r1();
   66|      0|   }
   67|      1|#endif
   68|       |
   69|      1|#if defined(BOTAN_HAS_PCURVES_FRP256V1)
   70|      1|   if(name == "frp256v1") {
  ------------------
  |  Branch (70:7): [True: 0, False: 1]
  ------------------
   71|      0|      return PCurveInstance::frp256v1();
   72|      0|   }
   73|      1|#endif
   74|       |
   75|      1|#if defined(BOTAN_HAS_PCURVES_SECP192R1)
   76|      1|   if(name == "secp192r1") {
  ------------------
  |  Branch (76:7): [True: 0, False: 1]
  ------------------
   77|      0|      return PCurveInstance::secp192r1();
   78|      0|   }
   79|      1|#endif
   80|       |
   81|      1|#if defined(BOTAN_HAS_PCURVES_SECP224R1)
   82|      1|   if(name == "secp224r1") {
  ------------------
  |  Branch (82:7): [True: 0, False: 1]
  ------------------
   83|      0|      return PCurveInstance::secp224r1();
   84|      0|   }
   85|      1|#endif
   86|       |
   87|      1|#if defined(BOTAN_HAS_PCURVES_SECP256K1)
   88|      1|   if(name == "secp256k1") {
  ------------------
  |  Branch (88:7): [True: 0, False: 1]
  ------------------
   89|      0|      return PCurveInstance::secp256k1();
   90|      0|   }
   91|      1|#endif
   92|       |
   93|      1|#if defined(BOTAN_HAS_PCURVES_SM2P256V1)
   94|      1|   if(name == "sm2p256v1") {
  ------------------
  |  Branch (94:7): [True: 0, False: 1]
  ------------------
   95|      0|      return PCurveInstance::sm2p256v1();
   96|      0|   }
   97|      1|#endif
   98|       |
   99|      1|#if defined(BOTAN_HAS_PCURVES_NUMSP512D1)
  100|      1|   if(name == "numsp512d1") {
  ------------------
  |  Branch (100:7): [True: 1, False: 0]
  ------------------
  101|      1|      return PCurveInstance::numsp512d1();
  102|      1|   }
  103|      0|#endif
  104|       |
  105|      0|   BOTAN_UNUSED(name);
  ------------------
  |  |  144|      0|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
  106|      0|   return {};
  107|      1|}

_ZN5Botan6PCurve14PCurveInstance10numsp512d1Ev:
  145|      1|std::shared_ptr<const PrimeOrderCurve> PCurveInstance::numsp512d1() {
  146|      1|   return PrimeOrderCurveImpl<numsp512d1::Curve>::instance();
  147|      1|}
pcurves_numsp512d1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE3oneEv:
   26|   278k|      constexpr static std::array<W, N> one() { return std::array<W, N>{1}; }
pcurves_numsp512d1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE4redcERKNSt3__15arrayImLm16EEE:
   28|  12.0M|      constexpr static std::array<W, N> redc(const std::array<W, 2 * N>& z) {
   29|  12.0M|         return redc_crandall<W, N, C>(std::span{z});
   30|  12.0M|      }
pcurves_numsp512d1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_110numsp512d15Curve10fe_invert2ERKNS_6IntModINS2_13Numsp512d1RepINS_13EllipticCurveINS2_6ParamsES5_E11FieldParamsEEEEE:
   54|  5.36k|      static constexpr FieldElement fe_invert2(const FieldElement& x) {
   55|       |         // Generated by https://github.com/mmcloughlin/addchain
   56|  5.36k|         auto z = x.square();
   57|  5.36k|         z *= x;
   58|  5.36k|         z = z.square();
   59|  5.36k|         z *= x;
   60|  5.36k|         auto t0 = z;
   61|  5.36k|         t0.square_n(3);
   62|  5.36k|         t0 *= z;
   63|  5.36k|         t0.square_n(3);
   64|  5.36k|         auto t1 = t0 * z;
   65|  5.36k|         t0 = t1;
   66|  5.36k|         t0.square_n(9);
   67|  5.36k|         t0 *= t1;
   68|  5.36k|         t0.square_n(3);
   69|  5.36k|         t0 *= z;
   70|  5.36k|         auto t2 = t0;
   71|  5.36k|         t2.square_n(9);
   72|  5.36k|         t1 *= t2;
   73|  5.36k|         t2 = t1;
   74|  5.36k|         t2.square_n(30);
   75|  5.36k|         t1 *= t2;
   76|  5.36k|         t2 = t1;
   77|  5.36k|         t2.square_n(60);
   78|  5.36k|         t1 *= t2;
   79|  5.36k|         t2 = t1;
   80|  5.36k|         t2.square_n(120);
   81|  5.36k|         t1 *= t2;
   82|  5.36k|         t2 = t1;
   83|  5.36k|         t2.square_n(240);
   84|  5.36k|         t1 *= t2;
   85|  5.36k|         t1.square_n(21);
   86|  5.36k|         t0 *= t1;
   87|  5.36k|         t0 = t0.square();
   88|  5.36k|         t0 *= x;
   89|  5.36k|         t0.square_n(4);
   90|  5.36k|         z *= t0;
   91|  5.36k|         z.square_n(4);
   92|  5.36k|         z *= x;
   93|  5.36k|         z.square_n(2);
   94|  5.36k|         return z;
   95|  5.36k|      }
pcurves_numsp512d1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE8from_repERKNSt3__15arrayImLm8EEE:
   36|  9.91k|      constexpr static std::array<W, N> from_rep(const std::array<W, N>& z) { return z; }
pcurves_numsp512d1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_110numsp512d113Numsp512d1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE6to_repERKNSt3__15arrayImLm8EEE:
   32|  10.7k|      constexpr static std::array<W, N> to_rep(const std::array<W, N>& x) { return x; }

_ZN5Botan14EC_AffinePointC2ENSt3__110unique_ptrINS_19EC_AffinePoint_DataENS1_14default_deleteIS3_EEEE:
   16|  4.54k|EC_AffinePoint::EC_AffinePoint(std::unique_ptr<EC_AffinePoint_Data> point) : m_point(std::move(point)) {
   17|  4.54k|   BOTAN_ASSERT_NONNULL(m_point);
  ------------------
  |  |  116|  4.54k|   do {                                                                                   \
  |  |  117|  4.54k|      if((ptr) == nullptr) {                                                              \
  |  |  ------------------
  |  |  |  Branch (117:10): [True: 0, False: 4.54k]
  |  |  ------------------
  |  |  118|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                              \
  |  |  119|      0|         Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \
  |  |  120|      0|      }                                                                                   \
  |  |  121|  4.54k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (121:12): [Folded, False: 4.54k]
  |  |  ------------------
  ------------------
   18|  4.54k|}
_ZN5Botan14EC_AffinePointC2ERKS0_:
   20|    413|EC_AffinePoint::EC_AffinePoint(const EC_AffinePoint& other) : m_point(other.inner().clone()) {}
_ZN5Botan14EC_AffinePointC2EOS0_:
   22|    413|EC_AffinePoint::EC_AffinePoint(EC_AffinePoint&& other) noexcept : m_point(std::move(other.m_point)) {}
_ZNK5Botan14EC_AffinePointeqERKS0_:
   54|  1.65k|bool EC_AffinePoint::operator==(const EC_AffinePoint& other) const {
   55|  1.65k|   if(this == &other) {
  ------------------
  |  Branch (55:7): [True: 0, False: 1.65k]
  ------------------
   56|      0|      return true;
   57|      0|   }
   58|       |
   59|       |   // We are relying on EC_Group to ensure there is just a single shared_ptr
   60|       |   // for any set of group params
   61|  1.65k|   if(this->_group() != other._group()) {
  ------------------
  |  Branch (61:7): [True: 0, False: 1.65k]
  ------------------
   62|      0|      return false;
   63|      0|   }
   64|       |
   65|  1.65k|   auto a_is_id = this->is_identity();
   66|  1.65k|   auto b_is_id = other.is_identity();
   67|       |
   68|  1.65k|   if(a_is_id || b_is_id) {
  ------------------
  |  Branch (68:7): [True: 0, False: 1.65k]
  |  Branch (68:18): [True: 0, False: 1.65k]
  ------------------
   69|      0|      return (a_is_id == b_is_id);
   70|      0|   }
   71|       |
   72|  1.65k|   auto a_xy = this->serialize_uncompressed();
   73|  1.65k|   auto b_xy = other.serialize_uncompressed();
   74|  1.65k|   BOTAN_ASSERT_NOMSG(a_xy.size() == b_xy.size());
  ------------------
  |  |   77|  1.65k|   do {                                                                     \
  |  |   78|  1.65k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|  1.65k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 1.65k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|  1.65k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 1.65k]
  |  |  ------------------
  ------------------
   75|       |
   76|  1.65k|   return CT::is_equal(a_xy.data(), b_xy.data(), a_xy.size()).as_bool();
   77|  1.65k|}
_ZN5Botan14EC_AffinePoint9generatorERKNS_8EC_GroupE:
   84|    413|EC_AffinePoint EC_AffinePoint::generator(const EC_Group& group) {
   85|       |   // TODO it would be nice to improve this (pcurves supports returning generator directly)
   86|    413|   if(auto g = EC_AffinePoint::from_bigint_xy(group, group.get_g_x(), group.get_g_y())) {
  ------------------
  |  Branch (86:12): [True: 413, False: 0]
  ------------------
   87|    413|      return *g;
   88|    413|   } else {
   89|      0|      throw Internal_Error("EC_AffinePoint::generator curve rejected generator");
   90|      0|   }
   91|    413|}
_ZN5Botan14EC_AffinePoint14from_bigint_xyERKNS_8EC_GroupERKNS_6BigIntES6_:
   93|    413|std::optional<EC_AffinePoint> EC_AffinePoint::from_bigint_xy(const EC_Group& group, const BigInt& x, const BigInt& y) {
   94|    413|   if(x.signum() < 0 || x >= group.get_p()) {
  ------------------
  |  Branch (94:7): [True: 0, False: 413]
  |  Branch (94:25): [True: 0, False: 413]
  ------------------
   95|      0|      return {};
   96|      0|   }
   97|    413|   if(y.signum() < 0 || y >= group.get_p()) {
  ------------------
  |  Branch (97:7): [True: 0, False: 413]
  |  Branch (97:25): [True: 0, False: 413]
  ------------------
   98|      0|      return {};
   99|      0|   }
  100|       |
  101|    413|   const size_t fe_bytes = group.get_p_bytes();
  102|    413|   std::vector<uint8_t> sec1(1 + 2 * fe_bytes);
  103|    413|   sec1[0] = 0x04;
  104|    413|   x.serialize_to(std::span{sec1}.subspan(1, fe_bytes));
  105|    413|   y.serialize_to(std::span{sec1}.last(fe_bytes));
  106|       |
  107|    413|   return EC_AffinePoint::deserialize(group, sec1);
  108|    413|}
_ZNK5Botan14EC_AffinePoint19field_element_bytesEv:
  110|  3.30k|size_t EC_AffinePoint::field_element_bytes() const {
  111|  3.30k|   return inner().field_element_bytes();
  112|  3.30k|}
_ZNK5Botan14EC_AffinePoint11is_identityEv:
  114|  6.60k|bool EC_AffinePoint::is_identity() const {
  115|  6.60k|   return inner().is_identity();
  116|  6.60k|}
_ZN5Botan14EC_AffinePointD2Ev:
  148|  5.36k|EC_AffinePoint::~EC_AffinePoint() = default;
_ZN5Botan14EC_AffinePoint11deserializeERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE:
  150|    413|std::optional<EC_AffinePoint> EC_AffinePoint::deserialize(const EC_Group& group, std::span<const uint8_t> bytes) {
  151|    413|   if(auto pt = group._data()->point_deserialize(bytes)) {
  ------------------
  |  Branch (151:12): [True: 413, False: 0]
  ------------------
  152|    413|      return EC_AffinePoint(std::move(pt));
  153|    413|   } else {
  154|      0|      return {};
  155|      0|   }
  156|    413|}
_ZN5Botan14EC_AffinePoint5g_mulERKNS_9EC_ScalarERNS_21RandomNumberGeneratorE:
  158|  1.23k|EC_AffinePoint EC_AffinePoint::g_mul(const EC_Scalar& scalar, RandomNumberGenerator& rng) {
  159|  1.23k|   auto pt = scalar._inner().group()->point_g_mul(scalar.inner(), rng);
  160|  1.23k|   return EC_AffinePoint(std::move(pt));
  161|  1.23k|}
_ZNK5Botan14EC_AffinePoint3mulERKNS_9EC_ScalarERNS_21RandomNumberGeneratorE:
  163|  1.23k|EC_AffinePoint EC_AffinePoint::mul(const EC_Scalar& scalar, RandomNumberGenerator& rng) const {
  164|  1.23k|   return EC_AffinePoint(inner().mul(scalar._inner(), rng));
  165|  1.23k|}
_ZNK5Botan14EC_AffinePoint3addERKS0_:
  184|  1.65k|EC_AffinePoint EC_AffinePoint::add(const EC_AffinePoint& q) const {
  185|  1.65k|   auto pt = _inner().group()->affine_add(_inner(), q._inner());
  186|  1.65k|   return EC_AffinePoint(std::move(pt));
  187|  1.65k|}
_ZNK5Botan14EC_AffinePoint25serialize_uncompressed_toENSt3__14spanIhLm18446744073709551615EEE:
  229|  3.30k|void EC_AffinePoint::serialize_uncompressed_to(std::span<uint8_t> bytes) const {
  230|  3.30k|   BOTAN_STATE_CHECK(!this->is_identity());
  ------------------
  |  |   51|  3.30k|   do {                                                         \
  |  |   52|  3.30k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */             \
  |  |   53|  3.30k|      if(!(expr)) {                                             \
  |  |  ------------------
  |  |  |  Branch (53:10): [True: 0, False: 3.30k]
  |  |  ------------------
  |  |   54|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */    \
  |  |   55|      0|         Botan::throw_invalid_state(#expr, __func__, __FILE__); \
  |  |   56|      0|      }                                                         \
  |  |   57|  3.30k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (57:12): [Folded, False: 3.30k]
  |  |  ------------------
  ------------------
  231|  3.30k|   m_point->serialize_uncompressed_to(bytes);
  232|  3.30k|}
_ZNK5Botan14EC_AffinePoint6_groupEv:
  238|  3.30k|const std::shared_ptr<const EC_Group_Data>& EC_AffinePoint::_group() const {
  239|  3.30k|   return inner().group();
  240|  3.30k|}

_ZN5Botan8EC_Group13ec_group_dataEv:
  231|      1|EC_Group_Data_Map& EC_Group::ec_group_data() {
  232|       |   /*
  233|       |   * This exists purely to ensure the allocator is constructed before g_ec_data,
  234|       |   * which ensures that its destructor runs after ~g_ec_data is complete.
  235|       |   */
  236|       |
  237|      1|   static const Allocator_Initializer g_init_allocator;
  238|      1|   static EC_Group_Data_Map g_ec_data;
  239|      1|   return g_ec_data;
  240|      1|}
_ZN5Botan8EC_Group18load_EC_group_infoEPKcS2_S2_S2_S2_S2_RKNS_3OIDE:
  254|      1|                                                            const OID& oid) {
  255|      1|   BOTAN_ARG_CHECK(oid.has_value(), "EC_Group::load_EC_group_info OID must be set");
  ------------------
  |  |   35|      1|   do {                                                          \
  |  |   36|      1|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      1|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 1]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      1|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 1]
  |  |  ------------------
  ------------------
  256|       |
  257|      1|   const BigInt p(p_str);
  258|      1|   const BigInt a(a_str);
  259|      1|   const BigInt b(b_str);
  260|      1|   const BigInt g_x(g_x_str);
  261|      1|   const BigInt g_y(g_y_str);
  262|      1|   const BigInt order(order_str);
  263|      1|   const BigInt cofactor(1);  // implicit
  264|       |
  265|      1|   return EC_Group_Data::create(p, a, b, g_x, g_y, order, cofactor, oid, EC_Group_Source::Builtin);
  266|      1|}
_ZN5Botan8EC_GroupD2Ev:
  412|      1|EC_Group::~EC_Group() = default;
_ZN5Botan8EC_GroupC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  492|      1|EC_Group::EC_Group(std::string_view str) {
  493|      1|   if(str.empty()) {
  ------------------
  |  Branch (493:7): [True: 0, False: 1]
  ------------------
  494|      0|      return;  // no initialization / uninitialized
  495|      0|   }
  496|       |
  497|      1|   try {
  498|      1|      const OID oid = OID::from_string(str);
  499|      1|      if(oid.has_value()) {
  ------------------
  |  Branch (499:10): [True: 1, False: 0]
  ------------------
  500|      1|         m_data = ec_group_data().lookup(oid);
  501|      1|      }
  502|      1|   } catch(...) {}
  503|       |
  504|      1|   if(m_data == nullptr) {
  ------------------
  |  Branch (504:7): [True: 0, False: 1]
  ------------------
  505|      0|      if(str.size() > 30 && str.starts_with("-----BEGIN EC PARAMETERS-----")) {
  ------------------
  |  Branch (505:10): [True: 0, False: 0]
  |  Branch (505:29): [True: 0, False: 0]
  ------------------
  506|       |         // OK try it as PEM ...
  507|      0|         const auto der = PEM_Code::decode_check_label(str, "EC PARAMETERS");
  508|       |
  509|      0|         auto data = DER_decode_EC_group(der, EC_Group_Source::ExternalSource);
  510|      0|         this->m_data = data.first;
  511|      0|         this->m_explicit_encoding = data.second;
  512|      0|      }
  513|      0|   }
  514|       |
  515|      1|   if(m_data == nullptr) {
  ------------------
  |  Branch (515:7): [True: 0, False: 1]
  ------------------
  516|      0|      throw Invalid_Argument(fmt("Unknown ECC group '{}'", str));
  517|      0|   }
  518|      1|}
_ZNK5Botan8EC_Group4dataEv:
  647|  2.06k|const EC_Group_Data& EC_Group::data() const {
  648|  2.06k|   if(m_data == nullptr) {
  ------------------
  |  Branch (648:7): [True: 0, False: 2.06k]
  ------------------
  649|      0|      throw Invalid_State("EC_Group uninitialized");
  650|      0|   }
  651|  2.06k|   return *m_data;
  652|  2.06k|}
_ZNK5Botan8EC_Group11get_p_bytesEv:
  658|    413|size_t EC_Group::get_p_bytes() const {
  659|    413|   return data().p_bytes();
  660|    413|}
_ZNK5Botan8EC_Group5get_pEv:
  670|    826|const BigInt& EC_Group::get_p() const {
  671|    826|   return data().p();
  672|    826|}
_ZNK5Botan8EC_Group7get_g_xEv:
  722|    413|const BigInt& EC_Group::get_g_x() const {
  723|    413|   return data().g_x();
  724|    413|}
_ZNK5Botan8EC_Group7get_g_yEv:
  726|    413|const BigInt& EC_Group::get_g_y() const {
  727|    413|   return data().g_y();
  728|    413|}
_ZN5Botan17EC_Group_Data_Map6lookupERKNS_3OIDE:
   54|      1|      std::shared_ptr<EC_Group_Data> lookup(const OID& oid) {
   55|      1|         const lock_guard_type<mutex_type> lock(m_mutex);
   56|       |
   57|      1|         for(auto i : m_registered_curves) {
  ------------------
  |  Branch (57:21): [True: 0, False: 1]
  ------------------
   58|      0|            if(i->oid() == oid) {
  ------------------
  |  Branch (58:16): [True: 0, False: 0]
  ------------------
   59|      0|               return i;
   60|      0|            }
   61|      0|         }
   62|       |
   63|       |         // Not found, check hardcoded data
   64|      1|         std::shared_ptr<EC_Group_Data> data = EC_Group::EC_group_info(oid);
   65|       |
   66|      1|         if(data) {
  ------------------
  |  Branch (66:13): [True: 1, False: 0]
  ------------------
   67|       |            // The requested OID may be an alias for a curve whose canonical OID differs
   68|       |            // TODO(Botan4) remove this once we require exactly one canonical OID per curve
   69|      1|            if(data->oid() != oid) {
  ------------------
  |  Branch (69:16): [True: 0, False: 1]
  ------------------
   70|      0|               for(const auto& i : m_registered_curves) {
  ------------------
  |  Branch (70:34): [True: 0, False: 0]
  ------------------
   71|      0|                  if(i->oid() == data->oid()) {
  ------------------
  |  Branch (71:22): [True: 0, False: 0]
  ------------------
   72|      0|                     return i;
   73|      0|                  }
   74|      0|               }
   75|      0|            }
   76|       |
   77|      1|            m_registered_curves.push_back(data);
   78|      1|            return data;
   79|      1|         }
   80|       |
   81|       |         // Nope, unknown curve
   82|      0|         return std::shared_ptr<EC_Group_Data>();
   83|      1|      }

_ZN5Botan13EC_Group_DataD2Ev:
   27|      1|EC_Group_Data::~EC_Group_Data() = default;
_ZN5Botan13EC_Group_DataC2ERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceE:
   39|      1|      m_p(p),
   40|      1|      m_a(a),
   41|      1|      m_b(b),
   42|      1|      m_g_x(g_x),
   43|      1|      m_g_y(g_y),
   44|      1|      m_order(order),
   45|      1|      m_cofactor(cofactor),
   46|       |#if defined(BOTAN_HAS_LEGACY_EC_POINT)
   47|      1|      m_mod_field(Barrett_Reduction::for_public_modulus(p)),
   48|      1|      m_mod_order(Barrett_Reduction::for_public_modulus(order)),
   49|      1|      m_monty(m_p, m_mod_field),
   50|       |#endif
   51|      1|      m_oid(oid),
   52|      1|      m_p_words(p.sig_words()),
   53|      1|      m_p_bits(p.bits()),
   54|      1|      m_order_bits(order.bits()),
   55|      1|      m_order_bytes((m_order_bits + 7) / 8),
   56|      1|      m_a_is_minus_3(a == p - 3),
   57|      1|      m_a_is_zero(a.is_zero()),
   58|      1|      m_has_cofactor(m_cofactor != 1),
   59|      1|      m_order_is_less_than_p(m_order < p),
   60|      1|      m_source(source) {
   61|       |   // Verify the generator (x, y) satisfies y^2 = x^3 + a*x + b (mod p)
   62|      1|   auto mod_p = Barrett_Reduction::for_public_modulus(p);
   63|      1|   const BigInt y2 = mod_p.square(g_y);
   64|      1|   const BigInt x3_ax_b = mod_p.reduce(mod_p.cube(g_x) + mod_p.multiply(a, g_x) + b);
   65|      1|   if(y2 != x3_ax_b) {
  ------------------
  |  Branch (65:7): [True: 0, False: 1]
  ------------------
   66|      0|      throw Invalid_Argument("EC_Group generator is not on the curve");
   67|      0|   }
   68|       |
   69|       |   // TODO(Botan4) we can assume/assert the OID is set
   70|      1|   if(!m_oid.empty()) {
  ------------------
  |  Branch (70:7): [True: 1, False: 0]
  ------------------
   71|      1|      DER_Encoder der(m_der_named_curve);
   72|      1|      der.encode(m_oid);
   73|       |
   74|      1|      const std::string name = m_oid.human_name_or_empty();
   75|      1|      if(!name.empty()) {
  ------------------
  |  Branch (75:10): [True: 1, False: 0]
  ------------------
   76|       |         // returns nullptr if unknown or not supported
   77|      1|         m_pcurve = PCurve::PrimeOrderCurve::for_named_curve(name);
   78|      1|      }
   79|      1|      if(m_pcurve) {
  ------------------
  |  Branch (79:10): [True: 1, False: 0]
  ------------------
   80|      1|         m_engine = EC_Group_Engine::Optimized;
   81|      1|      }
   82|      1|   }
   83|       |
   84|       |   // Try a generic pcurves instance
   85|      1|   if(!m_pcurve && !m_has_cofactor) {
  ------------------
  |  Branch (85:7): [True: 0, False: 1]
  |  Branch (85:20): [True: 0, False: 0]
  ------------------
   86|      0|      m_pcurve = PCurve::PrimeOrderCurve::from_params(p, a, b, g_x, g_y, order);
   87|      0|      if(m_pcurve) {
  ------------------
  |  Branch (87:10): [True: 0, False: 0]
  ------------------
   88|      0|         m_engine = EC_Group_Engine::Generic;
   89|      0|      }
   90|       |      // possibly still null here, if parameters unsuitable or if the
   91|       |      // pcurves_generic module wasn't included in the build
   92|      0|   }
   93|       |
   94|      1|#if defined(BOTAN_HAS_LEGACY_EC_POINT)
   95|      1|   secure_vector<word> ws;
   96|      1|   m_a_r = m_monty.mul(a, m_monty.R2(), ws);
   97|      1|   m_b_r = m_monty.mul(b, m_monty.R2(), ws);
   98|      1|   if(!m_pcurve) {
  ------------------
  |  Branch (98:7): [True: 0, False: 1]
  ------------------
   99|      0|      m_engine = EC_Group_Engine::Legacy;
  100|      0|   }
  101|       |#else
  102|       |   if(!m_pcurve) {
  103|       |      if(m_oid.empty()) {
  104|       |         throw Not_Implemented("EC_Group this group is not supported in this build configuration");
  105|       |      } else {
  106|       |         throw Not_Implemented(
  107|       |            fmt("EC_Group the group {} is not supported in this build configuration", oid.to_string()));
  108|       |      }
  109|       |   }
  110|       |#endif
  111|      1|}
_ZN5Botan13EC_Group_Data6createERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceE:
  121|      1|                                                     EC_Group_Source source) {
  122|      1|   auto group = std::make_shared<EC_Group_Data>(p, a, b, g_x, g_y, order, cofactor, oid, source);
  123|       |
  124|      1|#if defined(BOTAN_HAS_LEGACY_EC_POINT)
  125|      1|   group->m_curve = CurveGFp(group.get());
  126|      1|   group->m_base_point = EC_Point(group->m_curve, g_x, g_y);
  127|      1|   if(!group->m_pcurve) {
  ------------------
  |  Branch (127:7): [True: 0, False: 1]
  ------------------
  128|      0|      group->m_base_mult = std::make_unique<EC_Point_Base_Point_Precompute>(group->m_base_point, group->m_mod_order);
  129|      0|   }
  130|      1|#endif
  131|       |
  132|      1|   return group;
  133|      1|}
_ZNK5Botan13EC_Group_Data27scalar_from_bytes_mod_orderENSt3__14spanIKhLm18446744073709551615EEE:
  273|    832|std::unique_ptr<EC_Scalar_Data> EC_Group_Data::scalar_from_bytes_mod_order(std::span<const uint8_t> bytes) const {
  274|    832|   if(bytes.size() > 2 * order_bytes()) {
  ------------------
  |  Branch (274:7): [True: 0, False: 832]
  ------------------
  275|      0|      return {};
  276|      0|   }
  277|       |
  278|    832|   if(m_pcurve) {
  ------------------
  |  Branch (278:7): [True: 832, False: 0]
  ------------------
  279|    832|      if(auto s = m_pcurve->scalar_from_wide_bytes(bytes)) {
  ------------------
  |  Branch (279:15): [True: 832, False: 0]
  ------------------
  280|    832|         return std::make_unique<EC_Scalar_Data_PC>(shared_from_this(), std::move(*s));
  281|    832|      } else {
  282|      0|         return {};
  283|      0|      }
  284|    832|   } else {
  285|      0|#if defined(BOTAN_HAS_LEGACY_EC_POINT)
  286|      0|      return std::make_unique<EC_Scalar_Data_BN>(shared_from_this(), m_mod_order.reduce(BigInt(bytes)));
  287|       |#else
  288|       |      throw Not_Implemented("Legacy EC interfaces disabled in this build configuration");
  289|       |#endif
  290|      0|   }
  291|    832|}
_ZNK5Botan13EC_Group_Data17point_deserializeENSt3__14spanIKhLm18446744073709551615EEE:
  384|    413|std::unique_ptr<EC_AffinePoint_Data> EC_Group_Data::point_deserialize(std::span<const uint8_t> bytes) const {
  385|       |   // The deprecated "hybrid" point format
  386|       |   // TODO(Botan4) remove this
  387|    413|   if(bytes.size() >= 1 + 2 * 4 && (bytes[0] == 0x06 || bytes[0] == 0x07)) {
  ------------------
  |  Branch (387:7): [True: 413, False: 0]
  |  Branch (387:37): [True: 0, False: 413]
  |  Branch (387:57): [True: 0, False: 413]
  ------------------
  388|      0|      const bool hdr_y_is_even = bytes[0] == 0x06;
  389|      0|      const bool y_is_even = (bytes.back() & 0x01) == 0;
  390|       |
  391|      0|      if(hdr_y_is_even == y_is_even) {
  ------------------
  |  Branch (391:10): [True: 0, False: 0]
  ------------------
  392|      0|         std::vector<uint8_t> sec1(bytes.begin(), bytes.end());
  393|      0|         sec1[0] = 0x04;
  394|      0|         return this->point_deserialize(sec1);
  395|      0|      }
  396|      0|   }
  397|       |
  398|    413|   try {
  399|    413|      if(m_pcurve) {
  ------------------
  |  Branch (399:10): [True: 413, False: 0]
  ------------------
  400|    413|         if(auto pt = m_pcurve->deserialize_point(bytes)) {
  ------------------
  |  Branch (400:18): [True: 413, False: 0]
  ------------------
  401|    413|            return std::make_unique<EC_AffinePoint_Data_PC>(shared_from_this(), std::move(*pt));
  402|    413|         } else {
  403|      0|            return {};
  404|      0|         }
  405|    413|      } else {
  406|      0|#if defined(BOTAN_HAS_LEGACY_EC_POINT)
  407|      0|         auto pt = Botan::OS2ECP(bytes, m_curve);
  408|      0|         return std::make_unique<EC_AffinePoint_Data_BN>(shared_from_this(), std::move(pt));
  409|       |#else
  410|       |         throw Not_Implemented("Legacy EC interfaces disabled in this build configuration");
  411|       |#endif
  412|      0|      }
  413|    413|   } catch(...) {
  414|      0|      return {};
  415|      0|   }
  416|    413|}
_ZNK5Botan13EC_Group_Data11point_g_mulERKNS_14EC_Scalar_DataERNS_21RandomNumberGeneratorE:
  466|  1.23k|                                                                RandomNumberGenerator& rng) const {
  467|  1.23k|   if(m_pcurve) {
  ------------------
  |  Branch (467:7): [True: 1.23k, False: 0]
  ------------------
  468|  1.23k|      const auto& k = EC_Scalar_Data_PC::checked_ref(scalar);
  469|  1.23k|      auto pt = m_pcurve->point_to_affine(m_pcurve->mul_by_g(k.value(), rng));
  470|  1.23k|      return std::make_unique<EC_AffinePoint_Data_PC>(shared_from_this(), std::move(pt));
  471|  1.23k|   } else {
  472|      0|#if defined(BOTAN_HAS_LEGACY_EC_POINT)
  473|      0|      const auto& group = scalar.group();
  474|      0|      const auto& bn = EC_Scalar_Data_BN::checked_ref(scalar);
  475|       |
  476|      0|      BOTAN_STATE_CHECK(group->m_base_mult != nullptr);
  ------------------
  |  |   51|      0|   do {                                                         \
  |  |   52|      0|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */             \
  |  |   53|      0|      if(!(expr)) {                                             \
  |  |  ------------------
  |  |  |  Branch (53:10): [True: 0, False: 0]
  |  |  ------------------
  |  |   54|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */    \
  |  |   55|      0|         Botan::throw_invalid_state(#expr, __func__, __FILE__); \
  |  |   56|      0|      }                                                         \
  |  |   57|      0|   } while(0)
  |  |  ------------------
  |  |  |  Branch (57:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  477|      0|      std::vector<BigInt> ws;
  478|      0|      auto pt = group->m_base_mult->mul(bn.value(), rng, m_order, ws);
  479|      0|      return std::make_unique<EC_AffinePoint_Data_BN>(shared_from_this(), std::move(pt));
  480|       |#else
  481|       |      throw Not_Implemented("Legacy EC interfaces disabled in this build configuration");
  482|       |#endif
  483|      0|   }
  484|  1.23k|}
_ZNK5Botan13EC_Group_Data10affine_addERKNS_19EC_AffinePoint_DataES3_:
  532|  1.65k|                                                               const EC_AffinePoint_Data& q) const {
  533|  1.65k|   if(m_pcurve) {
  ------------------
  |  Branch (533:7): [True: 1.65k, False: 0]
  ------------------
  534|  1.65k|      auto pt = m_pcurve->point_add(EC_AffinePoint_Data_PC::checked_ref(p).value(),
  535|  1.65k|                                    EC_AffinePoint_Data_PC::checked_ref(q).value());
  536|       |
  537|  1.65k|      return std::make_unique<EC_AffinePoint_Data_PC>(shared_from_this(), m_pcurve->point_to_affine(pt));
  538|  1.65k|   } else {
  539|      0|#if defined(BOTAN_HAS_LEGACY_EC_POINT)
  540|      0|      auto pt = p.to_legacy_point() + q.to_legacy_point();
  541|      0|      return std::make_unique<EC_AffinePoint_Data_BN>(shared_from_this(), std::move(pt));
  542|       |#else
  543|       |      throw Not_Implemented("Legacy EC interfaces disabled in this build configuration");
  544|       |#endif
  545|      0|   }
  546|  1.65k|}

_ZN5Botan17EC_Scalar_Data_PC11checked_refERKNS_14EC_Scalar_DataE:
   14|  2.89k|const EC_Scalar_Data_PC& EC_Scalar_Data_PC::checked_ref(const EC_Scalar_Data& data) {
   15|  2.89k|   const auto* p = dynamic_cast<const EC_Scalar_Data_PC*>(&data);
   16|  2.89k|   if(p == nullptr) {
  ------------------
  |  Branch (16:7): [True: 0, False: 2.89k]
  ------------------
   17|      0|      throw Invalid_State("Failed conversion to EC_Scalar_Data_PC");
   18|      0|   }
   19|  2.89k|   return *p;
   20|  2.89k|}
_ZNK5Botan17EC_Scalar_Data_PC5groupEv:
   22|  4.13k|const std::shared_ptr<const EC_Group_Data>& EC_Scalar_Data_PC::group() const {
   23|  4.13k|   return m_group;
   24|  4.13k|}
_ZNK5Botan17EC_Scalar_Data_PC7is_zeroEv:
   34|  1.24k|bool EC_Scalar_Data_PC::is_zero() const {
   35|  1.24k|   const auto& pcurve = this->group()->pcurve();
   36|  1.24k|   return pcurve.scalar_is_zero(m_v);
   37|  1.24k|}
_ZNK5Botan17EC_Scalar_Data_PC3addERKNS_14EC_Scalar_DataE:
   69|    416|std::unique_ptr<EC_Scalar_Data> EC_Scalar_Data_PC::add(const EC_Scalar_Data& other) const {
   70|    416|   return std::make_unique<EC_Scalar_Data_PC>(m_group, group()->pcurve().scalar_add(m_v, checked_ref(other).m_v));
   71|    416|}
_ZN5Botan22EC_AffinePoint_Data_PCC2ENSt3__110shared_ptrIKNS_13EC_Group_DataEEENS_6PCurve15PrimeOrderCurve11AffinePointE:
   88|  4.95k|      m_group(std::move(group)), m_pt(std::move(pt)) {
   89|  4.95k|   const auto& pcurve = m_group->pcurve();
   90|       |
   91|  4.95k|   if(!pcurve.affine_point_is_identity(m_pt)) {
  ------------------
  |  Branch (91:7): [True: 4.95k, False: 0]
  ------------------
   92|  4.95k|      m_xy.resize(1 + 2 * field_element_bytes());
   93|  4.95k|      pcurve.serialize_point(m_xy, m_pt);
   94|  4.95k|   }
   95|  4.95k|}
_ZN5Botan22EC_AffinePoint_Data_PC11checked_refERKNS_19EC_AffinePoint_DataE:
   97|  3.30k|const EC_AffinePoint_Data_PC& EC_AffinePoint_Data_PC::checked_ref(const EC_AffinePoint_Data& data) {
   98|  3.30k|   const auto* p = dynamic_cast<const EC_AffinePoint_Data_PC*>(&data);
   99|  3.30k|   if(p == nullptr) {
  ------------------
  |  Branch (99:7): [True: 0, False: 3.30k]
  ------------------
  100|      0|      throw Invalid_State("Failed conversion to EC_AffinePoint_Data_PC");
  101|      0|   }
  102|  3.30k|   return *p;
  103|  3.30k|}
_ZNK5Botan22EC_AffinePoint_Data_PC5cloneEv:
  105|    413|std::unique_ptr<EC_AffinePoint_Data> EC_AffinePoint_Data_PC::clone() const {
  106|    413|   return std::make_unique<EC_AffinePoint_Data_PC>(m_group, m_pt);
  107|    413|}
_ZNK5Botan22EC_AffinePoint_Data_PC5groupEv:
  109|  4.95k|const std::shared_ptr<const EC_Group_Data>& EC_AffinePoint_Data_PC::group() const {
  110|  4.95k|   return m_group;
  111|  4.95k|}
_ZNK5Botan22EC_AffinePoint_Data_PC3mulERKNS_14EC_Scalar_DataERNS_21RandomNumberGeneratorE:
  114|  1.23k|                                                                 RandomNumberGenerator& rng) const {
  115|  1.23k|   BOTAN_ARG_CHECK(scalar.group() == m_group, "Curve mismatch");
  ------------------
  |  |   35|  1.23k|   do {                                                          \
  |  |   36|  1.23k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|  1.23k|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 1.23k]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|  1.23k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 1.23k]
  |  |  ------------------
  ------------------
  116|  1.23k|   const auto& k = EC_Scalar_Data_PC::checked_ref(scalar).value();
  117|  1.23k|   const auto& pcurve = m_group->pcurve();
  118|  1.23k|   auto pt = pcurve.point_to_affine(pcurve.mul(m_pt, k, rng));
  119|  1.23k|   return std::make_unique<EC_AffinePoint_Data_PC>(m_group, std::move(pt));
  120|  1.23k|}
_ZNK5Botan22EC_AffinePoint_Data_PC19field_element_bytesEv:
  129|  11.5k|size_t EC_AffinePoint_Data_PC::field_element_bytes() const {
  130|  11.5k|   return m_group->pcurve().field_element_bytes();
  131|  11.5k|}
_ZNK5Botan22EC_AffinePoint_Data_PC11is_identityEv:
  133|  9.91k|bool EC_AffinePoint_Data_PC::is_identity() const {
  134|  9.91k|   return m_xy.empty();
  135|  9.91k|}
_ZNK5Botan22EC_AffinePoint_Data_PC25serialize_uncompressed_toENSt3__14spanIhLm18446744073709551615EEE:
  169|  3.30k|void EC_AffinePoint_Data_PC::serialize_uncompressed_to(std::span<uint8_t> bytes) const {
  170|  3.30k|   BOTAN_STATE_CHECK(!this->is_identity());
  ------------------
  |  |   51|  3.30k|   do {                                                         \
  |  |   52|  3.30k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */             \
  |  |   53|  3.30k|      if(!(expr)) {                                             \
  |  |  ------------------
  |  |  |  Branch (53:10): [True: 0, False: 3.30k]
  |  |  ------------------
  |  |   54|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */    \
  |  |   55|      0|         Botan::throw_invalid_state(#expr, __func__, __FILE__); \
  |  |   56|      0|      }                                                         \
  |  |   57|  3.30k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (57:12): [Folded, False: 3.30k]
  |  |  ------------------
  ------------------
  171|  3.30k|   const size_t fe_bytes = this->field_element_bytes();
  172|  3.30k|   BOTAN_ARG_CHECK(bytes.size() == 1 + 2 * fe_bytes, "Invalid output size");
  ------------------
  |  |   35|  3.30k|   do {                                                          \
  |  |   36|  3.30k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|  3.30k|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:10): [True: 0, False: 3.30k]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|  3.30k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 3.30k]
  |  |  ------------------
  ------------------
  173|  3.30k|   copy_mem(bytes, m_xy);
  174|  3.30k|}

_ZN5Botan8EC_Group13EC_group_infoERKNS_3OIDE:
   16|      1|std::shared_ptr<EC_Group_Data> EC_Group::EC_group_info(const OID& oid) {
   17|       |   // secp256r1
   18|      1|   if(oid == OID{1, 2, 840, 10045, 3, 1, 7}) {
  ------------------
  |  Branch (18:7): [True: 0, False: 1]
  ------------------
   19|      0|      return load_EC_group_info(
   20|      0|         "0xFFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFF",
   21|      0|         "0xFFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFC",
   22|      0|         "0x5AC635D8AA3A93E7B3EBBD55769886BC651D06B0CC53B0F63BCE3C3E27D2604B",
   23|      0|         "0x6B17D1F2E12C4247F8BCE6E563A440F277037D812DEB33A0F4A13945D898C296",
   24|      0|         "0x4FE342E2FE1A7F9B8EE7EB4A7C0F9E162BCE33576B315ECECBB6406837BF51F5",
   25|      0|         "0xFFFFFFFF00000000FFFFFFFFFFFFFFFFBCE6FAADA7179E84F3B9CAC2FC632551",
   26|      0|         oid);
   27|      0|   }
   28|       |
   29|       |   // secp384r1
   30|      1|   if(oid == OID{1, 3, 132, 0, 34}) {
  ------------------
  |  Branch (30:7): [True: 0, False: 1]
  ------------------
   31|      0|      return load_EC_group_info(
   32|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFF",
   33|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFC",
   34|      0|         "0xB3312FA7E23EE7E4988E056BE3F82D19181D9C6EFE8141120314088F5013875AC656398D8A2ED19D2A85C8EDD3EC2AEF",
   35|      0|         "0xAA87CA22BE8B05378EB1C71EF320AD746E1D3B628BA79B9859F741E082542A385502F25DBF55296C3A545E3872760AB7",
   36|      0|         "0x3617DE4A96262C6F5D9E98BF9292DC29F8F41DBD289A147CE9DA3113B5F0B8C00A60B1CE1D7E819D7A431D7C90EA0E5F",
   37|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFC7634D81F4372DDF581A0DB248B0A77AECEC196ACCC52973",
   38|      0|         oid);
   39|      0|   }
   40|       |
   41|       |   // secp521r1
   42|      1|   if(oid == OID{1, 3, 132, 0, 35}) {
  ------------------
  |  Branch (42:7): [True: 0, False: 1]
  ------------------
   43|      0|      return load_EC_group_info(
   44|      0|         "0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
   45|      0|         "0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFC",
   46|      0|         "0x51953EB9618E1C9A1F929A21A0B68540EEA2DA725B99B315F3B8B489918EF109E156193951EC7E937B1652C0BD3BB1BF073573DF883D2C34F1EF451FD46B503F00",
   47|      0|         "0xC6858E06B70404E9CD9E3ECB662395B4429C648139053FB521F828AF606B4D3DBAA14B5E77EFE75928FE1DC127A2FFA8DE3348B3C1856A429BF97E7E31C2E5BD66",
   48|      0|         "0x11839296A789A3BC0045C8A5FB42C7D1BD998F54449579B446817AFBD17273E662C97EE72995EF42640C550B9013FAD0761353C7086A272C24088BE94769FD16650",
   49|      0|         "0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFA51868783BF2F966B7FCC0148F709A5D03BB5C9B8899C47AEBB6FB71E91386409",
   50|      0|         oid);
   51|      0|   }
   52|       |
   53|       |   // brainpool160r1
   54|      1|   if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 1}) {
  ------------------
  |  Branch (54:7): [True: 0, False: 1]
  ------------------
   55|      0|      return load_EC_group_info(
   56|      0|         "0xE95E4A5F737059DC60DFC7AD95B3D8139515620F",
   57|      0|         "0x340E7BE2A280EB74E2BE61BADA745D97E8F7C300",
   58|      0|         "0x1E589A8595423412134FAA2DBDEC95C8D8675E58",
   59|      0|         "0xBED5AF16EA3F6A4F62938C4631EB5AF7BDBCDBC3",
   60|      0|         "0x1667CB477A1A8EC338F94741669C976316DA6321",
   61|      0|         "0xE95E4A5F737059DC60DF5991D45029409E60FC09",
   62|      0|         oid);
   63|      0|   }
   64|       |
   65|       |   // brainpool192r1
   66|      1|   if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 3}) {
  ------------------
  |  Branch (66:7): [True: 0, False: 1]
  ------------------
   67|      0|      return load_EC_group_info(
   68|      0|         "0xC302F41D932A36CDA7A3463093D18DB78FCE476DE1A86297",
   69|      0|         "0x6A91174076B1E0E19C39C031FE8685C1CAE040E5C69A28EF",
   70|      0|         "0x469A28EF7C28CCA3DC721D044F4496BCCA7EF4146FBF25C9",
   71|      0|         "0xC0A0647EAAB6A48753B033C56CB0F0900A2F5C4853375FD6",
   72|      0|         "0x14B690866ABD5BB88B5F4828C1490002E6773FA2FA299B8F",
   73|      0|         "0xC302F41D932A36CDA7A3462F9E9E916B5BE8F1029AC4ACC1",
   74|      0|         oid);
   75|      0|   }
   76|       |
   77|       |   // brainpool224r1
   78|      1|   if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 5}) {
  ------------------
  |  Branch (78:7): [True: 0, False: 1]
  ------------------
   79|      0|      return load_EC_group_info(
   80|      0|         "0xD7C134AA264366862A18302575D1D787B09F075797DA89F57EC8C0FF",
   81|      0|         "0x68A5E62CA9CE6C1C299803A6C1530B514E182AD8B0042A59CAD29F43",
   82|      0|         "0x2580F63CCFE44138870713B1A92369E33E2135D266DBB372386C400B",
   83|      0|         "0xD9029AD2C7E5CF4340823B2A87DC68C9E4CE3174C1E6EFDEE12C07D",
   84|      0|         "0x58AA56F772C0726F24C6B89E4ECDAC24354B9E99CAA3F6D3761402CD",
   85|      0|         "0xD7C134AA264366862A18302575D0FB98D116BC4B6DDEBCA3A5A7939F",
   86|      0|         oid);
   87|      0|   }
   88|       |
   89|       |   // brainpool256r1
   90|      1|   if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 7}) {
  ------------------
  |  Branch (90:7): [True: 0, False: 1]
  ------------------
   91|      0|      return load_EC_group_info(
   92|      0|         "0xA9FB57DBA1EEA9BC3E660A909D838D726E3BF623D52620282013481D1F6E5377",
   93|      0|         "0x7D5A0975FC2C3057EEF67530417AFFE7FB8055C126DC5C6CE94A4B44F330B5D9",
   94|      0|         "0x26DC5C6CE94A4B44F330B5D9BBD77CBF958416295CF7E1CE6BCCDC18FF8C07B6",
   95|      0|         "0x8BD2AEB9CB7E57CB2C4B482FFC81B7AFB9DE27E1E3BD23C23A4453BD9ACE3262",
   96|      0|         "0x547EF835C3DAC4FD97F8461A14611DC9C27745132DED8E545C1D54C72F046997",
   97|      0|         "0xA9FB57DBA1EEA9BC3E660A909D838D718C397AA3B561A6F7901E0E82974856A7",
   98|      0|         oid);
   99|      0|   }
  100|       |
  101|       |   // brainpool320r1
  102|      1|   if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 9}) {
  ------------------
  |  Branch (102:7): [True: 0, False: 1]
  ------------------
  103|      0|      return load_EC_group_info(
  104|      0|         "0xD35E472036BC4FB7E13C785ED201E065F98FCFA6F6F40DEF4F92B9EC7893EC28FCD412B1F1B32E27",
  105|      0|         "0x3EE30B568FBAB0F883CCEBD46D3F3BB8A2A73513F5EB79DA66190EB085FFA9F492F375A97D860EB4",
  106|      0|         "0x520883949DFDBC42D3AD198640688A6FE13F41349554B49ACC31DCCD884539816F5EB4AC8FB1F1A6",
  107|      0|         "0x43BD7E9AFB53D8B85289BCC48EE5BFE6F20137D10A087EB6E7871E2A10A599C710AF8D0D39E20611",
  108|      0|         "0x14FDD05545EC1CC8AB4093247F77275E0743FFED117182EAA9C77877AAAC6AC7D35245D1692E8EE1",
  109|      0|         "0xD35E472036BC4FB7E13C785ED201E065F98FCFA5B68F12A32D482EC7EE8658E98691555B44C59311",
  110|      0|         oid);
  111|      0|   }
  112|       |
  113|       |   // brainpool384r1
  114|      1|   if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 11}) {
  ------------------
  |  Branch (114:7): [True: 0, False: 1]
  ------------------
  115|      0|      return load_EC_group_info(
  116|      0|         "0x8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B412B1DA197FB71123ACD3A729901D1A71874700133107EC53",
  117|      0|         "0x7BC382C63D8C150C3C72080ACE05AFA0C2BEA28E4FB22787139165EFBA91F90F8AA5814A503AD4EB04A8C7DD22CE2826",
  118|      0|         "0x4A8C7DD22CE28268B39B55416F0447C2FB77DE107DCD2A62E880EA53EEB62D57CB4390295DBC9943AB78696FA504C11",
  119|      0|         "0x1D1C64F068CF45FFA2A63A81B7C13F6B8847A3E77EF14FE3DB7FCAFE0CBD10E8E826E03436D646AAEF87B2E247D4AF1E",
  120|      0|         "0x8ABE1D7520F9C2A45CB1EB8E95CFD55262B70B29FEEC5864E19C054FF99129280E4646217791811142820341263C5315",
  121|      0|         "0x8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B31F166E6CAC0425A7CF3AB6AF6B7FC3103B883202E9046565",
  122|      0|         oid);
  123|      0|   }
  124|       |
  125|       |   // brainpool512r1
  126|      1|   if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 13}) {
  ------------------
  |  Branch (126:7): [True: 0, False: 1]
  ------------------
  127|      0|      return load_EC_group_info(
  128|      0|         "0xAADD9DB8DBE9C48B3FD4E6AE33C9FC07CB308DB3B3C9D20ED6639CCA703308717D4D9B009BC66842AECDA12AE6A380E62881FF2F2D82C68528AA6056583A48F3",
  129|      0|         "0x7830A3318B603B89E2327145AC234CC594CBDD8D3DF91610A83441CAEA9863BC2DED5D5AA8253AA10A2EF1C98B9AC8B57F1117A72BF2C7B9E7C1AC4D77FC94CA",
  130|      0|         "0x3DF91610A83441CAEA9863BC2DED5D5AA8253AA10A2EF1C98B9AC8B57F1117A72BF2C7B9E7C1AC4D77FC94CADC083E67984050B75EBAE5DD2809BD638016F723",
  131|      0|         "0x81AEE4BDD82ED9645A21322E9C4C6A9385ED9F70B5D916C1B43B62EEF4D0098EFF3B1F78E2D0D48D50D1687B93B97D5F7C6D5047406A5E688B352209BCB9F822",
  132|      0|         "0x7DDE385D566332ECC0EABFA9CF7822FDF209F70024A57B1AA000C55B881F8111B2DCDE494A5F485E5BCA4BD88A2763AED1CA2B2FA8F0540678CD1E0F3AD80892",
  133|      0|         "0xAADD9DB8DBE9C48B3FD4E6AE33C9FC07CB308DB3B3C9D20ED6639CCA70330870553E5C414CA92619418661197FAC10471DB1D381085DDADDB58796829CA90069",
  134|      0|         oid);
  135|      0|   }
  136|       |
  137|       |   // frp256v1
  138|      1|   if(oid == OID{1, 2, 250, 1, 223, 101, 256, 1}) {
  ------------------
  |  Branch (138:7): [True: 0, False: 1]
  ------------------
  139|      0|      return load_EC_group_info(
  140|      0|         "0xF1FD178C0B3AD58F10126DE8CE42435B3961ADBCABC8CA6DE8FCF353D86E9C03",
  141|      0|         "0xF1FD178C0B3AD58F10126DE8CE42435B3961ADBCABC8CA6DE8FCF353D86E9C00",
  142|      0|         "0xEE353FCA5428A9300D4ABA754A44C00FDFEC0C9AE4B1A1803075ED967B7BB73F",
  143|      0|         "0xB6B3D4C356C139EB31183D4749D423958C27D2DCAF98B70164C97A2DD98F5CFF",
  144|      0|         "0x6142E0F7C8B204911F9271F0F3ECEF8C2701C307E8E4C9E183115A1554062CFB",
  145|      0|         "0xF1FD178C0B3AD58F10126DE8CE42435B53DC67E140D2BF941FFDD459C6D655E1",
  146|      0|         oid);
  147|      0|   }
  148|       |
  149|       |   // gost_256A
  150|      1|   if(oid == OID{1, 2, 643, 7, 1, 2, 1, 1, 1} || oid == OID{1, 2, 643, 2, 2, 35, 1} || oid == OID{1, 2, 643, 2, 2, 36, 0}) {
  ------------------
  |  Branch (150:7): [True: 0, False: 1]
  |  Branch (150:7): [True: 0, False: 1]
  |  Branch (150:50): [True: 0, False: 1]
  |  Branch (150:88): [True: 0, False: 1]
  ------------------
  151|      0|      return load_EC_group_info(
  152|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFD97",
  153|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFD94",
  154|      0|         "0xA6",
  155|      0|         "0x1",
  156|      0|         "0x8D91E471E0989CDA27DF505A453F2B7635294F2DDF23E3B122ACC99C9E9F1E14",
  157|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF6C611070995AD10045841B09B761B893",
  158|      0|         OID{1, 2, 643, 7, 1, 2, 1, 1, 1});
  159|      0|   }
  160|       |
  161|       |   // gost_512A
  162|      1|   if(oid == OID{1, 2, 643, 7, 1, 2, 1, 2, 1}) {
  ------------------
  |  Branch (162:7): [True: 0, False: 1]
  ------------------
  163|      0|      return load_EC_group_info(
  164|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFDC7",
  165|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFDC4",
  166|      0|         "0xE8C2505DEDFC86DDC1BD0B2B6667F1DA34B82574761CB0E879BD081CFD0B6265EE3CB090F30D27614CB4574010DA90DD862EF9D4EBEE4761503190785A71C760",
  167|      0|         "0x3",
  168|      0|         "0x7503CFE87A836AE3A61B8816E25450E6CE5E1C93ACF1ABC1778064FDCBEFA921DF1626BE4FD036E93D75E6A50E3A41E98028FE5FC235F5B889A589CB5215F2A4",
  169|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF27E69532F48D89116FF22B8D4E0560609B4B38ABFAD2B85DCACDB1411F10B275",
  170|      0|         oid);
  171|      0|   }
  172|       |
  173|       |   // secp160k1
  174|      1|   if(oid == OID{1, 3, 132, 0, 9}) {
  ------------------
  |  Branch (174:7): [True: 0, False: 1]
  ------------------
  175|      0|      return load_EC_group_info(
  176|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC73",
  177|      0|         "0x0",
  178|      0|         "0x7",
  179|      0|         "0x3B4C382CE37AA192A4019E763036F4F5DD4D7EBB",
  180|      0|         "0x938CF935318FDCED6BC28286531733C3F03C4FEE",
  181|      0|         "0x100000000000000000001B8FA16DFAB9ACA16B6B3",
  182|      0|         oid);
  183|      0|   }
  184|       |
  185|       |   // secp160r1
  186|      1|   if(oid == OID{1, 3, 132, 0, 8}) {
  ------------------
  |  Branch (186:7): [True: 0, False: 1]
  ------------------
  187|      0|      return load_EC_group_info(
  188|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFF",
  189|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFC",
  190|      0|         "0x1C97BEFC54BD7A8B65ACF89F81D4D4ADC565FA45",
  191|      0|         "0x4A96B5688EF573284664698968C38BB913CBFC82",
  192|      0|         "0x23A628553168947D59DCC912042351377AC5FB32",
  193|      0|         "0x100000000000000000001F4C8F927AED3CA752257",
  194|      0|         oid);
  195|      0|   }
  196|       |
  197|       |   // secp160r2
  198|      1|   if(oid == OID{1, 3, 132, 0, 30}) {
  ------------------
  |  Branch (198:7): [True: 0, False: 1]
  ------------------
  199|      0|      return load_EC_group_info(
  200|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC73",
  201|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC70",
  202|      0|         "0xB4E134D3FB59EB8BAB57274904664D5AF50388BA",
  203|      0|         "0x52DCB034293A117E1F4FF11B30F7199D3144CE6D",
  204|      0|         "0xFEAFFEF2E331F296E071FA0DF9982CFEA7D43F2E",
  205|      0|         "0x100000000000000000000351EE786A818F3A1A16B",
  206|      0|         oid);
  207|      0|   }
  208|       |
  209|       |   // secp192k1
  210|      1|   if(oid == OID{1, 3, 132, 0, 31}) {
  ------------------
  |  Branch (210:7): [True: 0, False: 1]
  ------------------
  211|      0|      return load_EC_group_info(
  212|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFEE37",
  213|      0|         "0x0",
  214|      0|         "0x3",
  215|      0|         "0xDB4FF10EC057E9AE26B07D0280B7F4341DA5D1B1EAE06C7D",
  216|      0|         "0x9B2F2F6D9C5628A7844163D015BE86344082AA88D95E2F9D",
  217|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFE26F2FC170F69466A74DEFD8D",
  218|      0|         oid);
  219|      0|   }
  220|       |
  221|       |   // secp192r1
  222|      1|   if(oid == OID{1, 2, 840, 10045, 3, 1, 1}) {
  ------------------
  |  Branch (222:7): [True: 0, False: 1]
  ------------------
  223|      0|      return load_EC_group_info(
  224|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFF",
  225|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFC",
  226|      0|         "0x64210519E59C80E70FA7E9AB72243049FEB8DEECC146B9B1",
  227|      0|         "0x188DA80EB03090F67CBF20EB43A18800F4FF0AFD82FF1012",
  228|      0|         "0x7192B95FFC8DA78631011ED6B24CDD573F977A11E794811",
  229|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFF99DEF836146BC9B1B4D22831",
  230|      0|         oid);
  231|      0|   }
  232|       |
  233|       |   // secp224k1
  234|      1|   if(oid == OID{1, 3, 132, 0, 32}) {
  ------------------
  |  Branch (234:7): [True: 0, False: 1]
  ------------------
  235|      0|      return load_EC_group_info(
  236|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFE56D",
  237|      0|         "0x0",
  238|      0|         "0x5",
  239|      0|         "0xA1455B334DF099DF30FC28A169A467E9E47075A90F7E650EB6B7A45C",
  240|      0|         "0x7E089FED7FBA344282CAFBD6F7E319F7C0B0BD59E2CA4BDB556D61A5",
  241|      0|         "0x10000000000000000000000000001DCE8D2EC6184CAF0A971769FB1F7",
  242|      0|         oid);
  243|      0|   }
  244|       |
  245|       |   // secp224r1
  246|      1|   if(oid == OID{1, 3, 132, 0, 33}) {
  ------------------
  |  Branch (246:7): [True: 0, False: 1]
  ------------------
  247|      0|      return load_EC_group_info(
  248|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF000000000000000000000001",
  249|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFE",
  250|      0|         "0xB4050A850C04B3ABF54132565044B0B7D7BFD8BA270B39432355FFB4",
  251|      0|         "0xB70E0CBD6BB4BF7F321390B94A03C1D356C21122343280D6115C1D21",
  252|      0|         "0xBD376388B5F723FB4C22DFE6CD4375A05A07476444D5819985007E34",
  253|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF16A2E0B8F03E13DD29455C5C2A3D",
  254|      0|         oid);
  255|      0|   }
  256|       |
  257|       |   // secp256k1
  258|      1|   if(oid == OID{1, 3, 132, 0, 10}) {
  ------------------
  |  Branch (258:7): [True: 0, False: 1]
  ------------------
  259|      0|      return load_EC_group_info(
  260|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F",
  261|      0|         "0x0",
  262|      0|         "0x7",
  263|      0|         "0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798",
  264|      0|         "0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8",
  265|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141",
  266|      0|         oid);
  267|      0|   }
  268|       |
  269|       |   // sm2p256v1
  270|      1|   if(oid == OID{1, 2, 156, 10197, 1, 301}) {
  ------------------
  |  Branch (270:7): [True: 0, False: 1]
  ------------------
  271|      0|      return load_EC_group_info(
  272|      0|         "0xFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF",
  273|      0|         "0xFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC",
  274|      0|         "0x28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93",
  275|      0|         "0x32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7",
  276|      0|         "0xBC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0",
  277|      0|         "0xFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123",
  278|      0|         oid);
  279|      0|   }
  280|       |
  281|       |   // x962_p192v2
  282|      1|   if(oid == OID{1, 2, 840, 10045, 3, 1, 2}) {
  ------------------
  |  Branch (282:7): [True: 0, False: 1]
  ------------------
  283|      0|      return load_EC_group_info(
  284|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFF",
  285|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFC",
  286|      0|         "0xCC22D6DFB95C6B25E49C0D6364A4E5980C393AA21668D953",
  287|      0|         "0xEEA2BAE7E1497842F2DE7769CFE9C989C072AD696F48034A",
  288|      0|         "0x6574D11D69B6EC7A672BB82A083DF2F2B0847DE970B2DE15",
  289|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFE5FB1A724DC80418648D8DD31",
  290|      0|         oid);
  291|      0|   }
  292|       |
  293|       |   // x962_p192v3
  294|      1|   if(oid == OID{1, 2, 840, 10045, 3, 1, 3}) {
  ------------------
  |  Branch (294:7): [True: 0, False: 1]
  ------------------
  295|      0|      return load_EC_group_info(
  296|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFF",
  297|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFC",
  298|      0|         "0x22123DC2395A05CAA7423DAECCC94760A7D462256BD56916",
  299|      0|         "0x7D29778100C65A1DA1783716588DCE2B8B4AEE8E228F1896",
  300|      0|         "0x38A90F22637337334B49DCB66A6DC8F9978ACA7648A943B0",
  301|      0|         "0xFFFFFFFFFFFFFFFFFFFFFFFF7A62D031C83F4294F640EC13",
  302|      0|         oid);
  303|      0|   }
  304|       |
  305|       |   // x962_p239v1
  306|      1|   if(oid == OID{1, 2, 840, 10045, 3, 1, 4}) {
  ------------------
  |  Branch (306:7): [True: 0, False: 1]
  ------------------
  307|      0|      return load_EC_group_info(
  308|      0|         "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFFFFF8000000000007FFFFFFFFFFF",
  309|      0|         "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFFFFF8000000000007FFFFFFFFFFC",
  310|      0|         "0x6B016C3BDCF18941D0D654921475CA71A9DB2FB27D1D37796185C2942C0A",
  311|      0|         "0xFFA963CDCA8816CCC33B8642BEDF905C3D358573D3F27FBBD3B3CB9AAAF",
  312|      0|         "0x7DEBE8E4E90A5DAE6E4054CA530BA04654B36818CE226B39FCCB7B02F1AE",
  313|      0|         "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFF9E5E9A9F5D9071FBD1522688909D0B",
  314|      0|         oid);
  315|      0|   }
  316|       |
  317|       |   // x962_p239v2
  318|      1|   if(oid == OID{1, 2, 840, 10045, 3, 1, 5}) {
  ------------------
  |  Branch (318:7): [True: 0, False: 1]
  ------------------
  319|      0|      return load_EC_group_info(
  320|      0|         "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFFFFF8000000000007FFFFFFFFFFF",
  321|      0|         "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFFFFF8000000000007FFFFFFFFFFC",
  322|      0|         "0x617FAB6832576CBBFED50D99F0249C3FEE58B94BA0038C7AE84C8C832F2C",
  323|      0|         "0x38AF09D98727705120C921BB5E9E26296A3CDCF2F35757A0EAFD87B830E7",
  324|      0|         "0x5B0125E4DBEA0EC7206DA0FC01D9B081329FB555DE6EF460237DFF8BE4BA",
  325|      0|         "0x7FFFFFFFFFFFFFFFFFFFFFFF800000CFA7E8594377D414C03821BC582063",
  326|      0|         oid);
  327|      0|   }
  328|       |
  329|       |   // x962_p239v3
  330|      1|   if(oid == OID{1, 2, 840, 10045, 3, 1, 6}) {
  ------------------
  |  Branch (330:7): [True: 0, False: 1]
  ------------------
  331|      0|      return load_EC_group_info(
  332|      0|         "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFFFFF8000000000007FFFFFFFFFFF",
  333|      0|         "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFFFFF8000000000007FFFFFFFFFFC",
  334|      0|         "0x255705FA2A306654B1F4CB03D6A750A30C250102D4988717D9BA15AB6D3E",
  335|      0|         "0x6768AE8E18BB92CFCF005C949AA2C6D94853D0E660BBF854B1C9505FE95A",
  336|      0|         "0x1607E6898F390C06BC1D552BAD226F3B6FCFE48B6E818499AF18E3ED6CF3",
  337|      0|         "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFF975DEB41B3A6057C3C432146526551",
  338|      0|         oid);
  339|      0|   }
  340|       |
  341|       |   // numsp512d1
  342|      1|   if(oid == OID{1, 3, 6, 1, 4, 1, 25258, 4, 3}) {
  ------------------
  |  Branch (342:7): [True: 1, False: 0]
  ------------------
  343|      1|      return load_EC_group_info(
  344|      1|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFDC7",
  345|      1|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFDC4",
  346|      1|         "0x1D99B",
  347|      1|         "0x2",
  348|      1|         "0x1C282EB23327F9711952C250EA61AD53FCC13031CF6DD336E0B9328433AFBDD8CC5A1C1F0C716FDC724DDE537C2B0ADB00BB3D08DC83755B205CC30D7F83CF28",
  349|      1|         "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5B3CA4FB94E7831B4FC258ED97D0BDC63B568B36607CD243CE153F390433555D",
  350|      1|         oid);
  351|      1|   }
  352|       |
  353|      0|   return std::shared_ptr<EC_Group_Data>();
  354|      1|}

_ZN5Botan9EC_ScalarC2ENSt3__110unique_ptrINS_14EC_Scalar_DataENS1_14default_deleteIS3_EEEE:
   22|  1.24k|EC_Scalar::EC_Scalar(std::unique_ptr<EC_Scalar_Data> scalar) : m_scalar(std::move(scalar)) {
   23|  1.24k|   BOTAN_ASSERT_NONNULL(m_scalar);
  ------------------
  |  |  116|  1.24k|   do {                                                                                   \
  |  |  117|  1.24k|      if((ptr) == nullptr) {                                                              \
  |  |  ------------------
  |  |  |  Branch (117:10): [True: 0, False: 1.24k]
  |  |  ------------------
  |  |  118|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                              \
  |  |  119|      0|         Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \
  |  |  120|      0|      }                                                                                   \
  |  |  121|  1.24k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (121:12): [Folded, False: 1.24k]
  |  |  ------------------
  ------------------
   24|  1.24k|}
_ZN5Botan9EC_ScalarD2Ev:
   43|  1.24k|EC_Scalar::~EC_Scalar() = default;
_ZN5Botan9EC_Scalar20from_bytes_mod_orderERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE:
   53|    832|EC_Scalar EC_Scalar::from_bytes_mod_order(const EC_Group& group, std::span<const uint8_t> bytes) {
   54|    832|   if(auto s = group._data()->scalar_from_bytes_mod_order(bytes)) {
  ------------------
  |  Branch (54:12): [True: 832, False: 0]
  ------------------
   55|    832|      return EC_Scalar(std::move(s));
   56|    832|   } else {
   57|      0|      throw Decoding_Error("EC_Scalar::from_bytes_mod_order input invalid");
   58|      0|   }
   59|    832|}
_ZNK5Botan9EC_Scalar7is_zeroEv:
  133|  1.24k|bool EC_Scalar::is_zero() const {
  134|  1.24k|   return inner().is_zero();
  135|  1.24k|}
_ZNK5Botan9EC_Scalar3addERKS0_:
  153|    416|EC_Scalar EC_Scalar::add(const EC_Scalar& x) const {
  154|    416|   return EC_Scalar(inner().add(x.inner()));
  155|    416|}

_ZN5Botan8CurveGFpC2EPKNS_13EC_Group_DataE:
   28|      1|CurveGFp::CurveGFp(const EC_Group_Data* group) : m_group(group) {
   29|      1|   BOTAN_ASSERT_NONNULL(m_group);
  ------------------
  |  |  116|      1|   do {                                                                                   \
  |  |  117|      1|      if((ptr) == nullptr) {                                                              \
  |  |  ------------------
  |  |  |  Branch (117:10): [True: 0, False: 1]
  |  |  ------------------
  |  |  118|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                              \
  |  |  119|      0|         Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \
  |  |  120|      0|      }                                                                                   \
  |  |  121|      1|   } while(0)
  |  |  ------------------
  |  |  |  Branch (121:12): [Folded, False: 1]
  |  |  ------------------
  ------------------
   30|      1|}
_ZNK5Botan8CurveGFp5groupEv:
   32|      2|const EC_Group_Data& CurveGFp::group() const {
   33|      2|   BOTAN_ASSERT_NONNULL(m_group);
  ------------------
  |  |  116|      2|   do {                                                                                   \
  |  |  117|      2|      if((ptr) == nullptr) {                                                              \
  |  |  ------------------
  |  |  |  Branch (117:10): [True: 0, False: 2]
  |  |  ------------------
  |  |  118|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                              \
  |  |  119|      0|         Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \
  |  |  120|      0|      }                                                                                   \
  |  |  121|      2|   } while(0)
  |  |  ------------------
  |  |  |  Branch (121:12): [Folded, False: 2]
  |  |  ------------------
  ------------------
   34|      2|   return *m_group;
   35|      2|}
_ZN5Botan8EC_PointC2ERKNS_8CurveGFpENS_6BigIntES4_:
  115|      1|      m_curve(curve), m_x(std::move(x)), m_y(std::move(y)), m_z(m_curve.group().monty().R1()) {
  116|      1|   const auto& group = m_curve.group();
  117|       |
  118|      1|   if(m_x < 0 || m_x >= group.p()) {
  ------------------
  |  Branch (118:7): [True: 0, False: 1]
  |  Branch (118:18): [True: 0, False: 1]
  ------------------
  119|      0|      throw Invalid_Argument("Invalid EC_Point affine x");
  120|      0|   }
  121|      1|   if(m_y < 0 || m_y >= group.p()) {
  ------------------
  |  Branch (121:7): [True: 0, False: 1]
  |  Branch (121:18): [True: 0, False: 1]
  ------------------
  122|      0|      throw Invalid_Argument("Invalid EC_Point affine y");
  123|      0|   }
  124|       |
  125|      1|   secure_vector<word> monty_ws(monty_ws_size(group));
  126|       |
  127|      1|   to_rep(group, m_x, monty_ws);
  128|      1|   to_rep(group, m_y, monty_ws);
  129|      1|}
_ZN5Botan8EC_Point4swapERS0_:
  792|      1|void EC_Point::swap(EC_Point& other) noexcept {
  793|      1|   m_curve.swap(other.m_curve);
  794|      1|   m_x.swap(other.m_x);
  795|      1|   m_y.swap(other.m_y);
  796|      1|   m_z.swap(other.m_z);
  797|      1|}
ec_point.cpp:_ZN5Botan12_GLOBAL__N_113monty_ws_sizeERKNS_13EC_Group_DataE:
  102|      1|size_t monty_ws_size(const EC_Group_Data& group) {
  103|      1|   return 2 * group.p_words();
  104|      1|}
ec_point.cpp:_ZN5Botan12_GLOBAL__N_16to_repERKNS_13EC_Group_DataERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
   55|      2|void to_rep(const EC_Group_Data& group, BigInt& x, secure_vector<word>& ws) {
   56|      2|   group.monty().mul_by(x, group.monty().R2(), ws);
   57|      2|}

_ZN5Botan10ChaCha_RNGC2ENSt3__14spanIKhLm18446744073709551615EEE:
   20|      1|ChaCha_RNG::ChaCha_RNG(std::span<const uint8_t> seed) {
   21|      1|   m_hmac = MessageAuthenticationCode::create_or_throw("HMAC(SHA-256)");
   22|      1|   m_chacha = StreamCipher::create_or_throw("ChaCha(20)");
   23|      1|   clear();
   24|      1|   add_entropy(seed);
   25|      1|}
_ZN5Botan10ChaCha_RNG11clear_stateEv:
   50|      1|void ChaCha_RNG::clear_state() {
   51|      1|   m_hmac->set_key(std::vector<uint8_t>(m_hmac->output_length(), 0x00));
   52|      1|   m_chacha->set_key(m_hmac->final());
   53|      1|}
_ZN5Botan10ChaCha_RNG15generate_outputENSt3__14spanIhLm18446744073709551615EEENS2_IKhLm18446744073709551615EEE:
   55|  12.3k|void ChaCha_RNG::generate_output(std::span<uint8_t> output, std::span<const uint8_t> input) {
   56|  12.3k|   BOTAN_ASSERT_NOMSG(!output.empty());
  ------------------
  |  |   77|  12.3k|   do {                                                                     \
  |  |   78|  12.3k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|  12.3k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 12.3k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|  12.3k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 12.3k]
  |  |  ------------------
  ------------------
   57|       |
   58|  12.3k|   if(!input.empty()) {
  ------------------
  |  Branch (58:7): [True: 0, False: 12.3k]
  ------------------
   59|      0|      update(input);
   60|      0|   }
   61|       |
   62|  12.3k|   m_chacha->write_keystream(output);
   63|  12.3k|}
_ZN5Botan10ChaCha_RNG6updateENSt3__14spanIKhLm18446744073709551615EEE:
   65|      1|void ChaCha_RNG::update(std::span<const uint8_t> input) {
   66|      1|   m_hmac->update(input);
   67|      1|   m_chacha->set_key(m_hmac->final());
   68|      1|   const auto mac_key = m_chacha->keystream_bytes(m_hmac->output_length());
   69|      1|   m_hmac->set_key(mac_key);
   70|      1|}
_ZNK5Botan10ChaCha_RNG14security_levelEv:
   72|      1|size_t ChaCha_RNG::security_level() const {
   73|      1|   return 256;
   74|      1|}

_ZN5Botan12Stateful_RNG5clearEv:
   15|      1|void Stateful_RNG::clear() {
   16|      1|   const lock_guard_type<recursive_mutex_type> lock(m_mutex);
   17|      1|   m_reseed_counter = 0;
   18|      1|   m_last_pid = 0;
   19|      1|   clear_state();
   20|      1|}
_ZNK5Botan12Stateful_RNG9is_seededEv:
   27|  24.7k|bool Stateful_RNG::is_seeded() const {
   28|  24.7k|   const lock_guard_type<recursive_mutex_type> lock(m_mutex);
   29|  24.7k|   return m_reseed_counter > 0;
   30|  24.7k|}
_ZN5Botan12Stateful_RNG23generate_batched_outputENSt3__14spanIhLm18446744073709551615EEENS2_IKhLm18446744073709551615EEE:
   39|  12.3k|void Stateful_RNG::generate_batched_output(std::span<uint8_t> output, std::span<const uint8_t> input) {
   40|  12.3k|   BOTAN_ASSERT_NOMSG(!output.empty());
  ------------------
  |  |   77|  12.3k|   do {                                                                     \
  |  |   78|  12.3k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                         \
  |  |   79|  12.3k|      if(!(expr)) {                                                         \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 0, False: 12.3k]
  |  |  ------------------
  |  |   80|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                \
  |  |   81|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   82|      0|      }                                                                     \
  |  |   83|  12.3k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (83:12): [Folded, False: 12.3k]
  |  |  ------------------
  ------------------
   41|       |
   42|  12.3k|   const size_t max_per_request = max_number_of_bytes_per_request();
   43|       |
   44|  12.3k|   if(max_per_request == 0) {
  ------------------
  |  Branch (44:7): [True: 12.3k, False: 0]
  ------------------
   45|       |      // no limit
   46|  12.3k|      reseed_check();
   47|  12.3k|      this->generate_output(output, input);
   48|  12.3k|   } else {
   49|      0|      while(!output.empty()) {
  ------------------
  |  Branch (49:13): [True: 0, False: 0]
  ------------------
   50|      0|         const size_t this_req = std::min(max_per_request, output.size());
   51|       |
   52|      0|         reseed_check();
   53|      0|         this->generate_output(output.subspan(0, this_req), input);
   54|       |
   55|       |         // only include the input for the first iteration
   56|      0|         input = {};
   57|       |
   58|      0|         output = output.subspan(this_req);
   59|      0|      }
   60|      0|   }
   61|  12.3k|}
_ZN5Botan12Stateful_RNG21fill_bytes_with_inputENSt3__14spanIhLm18446744073709551615EEENS2_IKhLm18446744073709551615EEE:
   63|  12.3k|void Stateful_RNG::fill_bytes_with_input(std::span<uint8_t> output, std::span<const uint8_t> input) {
   64|  12.3k|   const lock_guard_type<recursive_mutex_type> lock(m_mutex);
   65|       |
   66|  12.3k|   if(output.empty()) {
  ------------------
  |  Branch (66:7): [True: 1, False: 12.3k]
  ------------------
   67|       |      // Special case for exclusively adding entropy to the stateful RNG.
   68|      1|      this->update(input);
   69|       |
   70|      1|      if(8 * input.size() >= security_level()) {
  ------------------
  |  Branch (70:10): [True: 1, False: 0]
  ------------------
   71|      1|         reset_reseed_counter();
   72|      1|      }
   73|  12.3k|   } else {
   74|  12.3k|      generate_batched_output(output, input);
   75|  12.3k|   }
   76|  12.3k|}
_ZN5Botan12Stateful_RNG20reset_reseed_counterEv:
  100|      1|void Stateful_RNG::reset_reseed_counter() {
  101|       |   // Lock is held whenever this function is called
  102|      1|   m_reseed_counter = 1;
  103|      1|}
_ZN5Botan12Stateful_RNG12reseed_checkEv:
  105|  12.3k|void Stateful_RNG::reseed_check() {
  106|       |   // Lock is held whenever this function is called
  107|       |
  108|  12.3k|   const uint32_t cur_pid = OS::get_process_id();
  109|       |
  110|  12.3k|   const bool fork_detected = (m_last_pid > 0) && (cur_pid != m_last_pid);
  ------------------
  |  Branch (110:31): [True: 0, False: 12.3k]
  |  Branch (110:51): [True: 0, False: 0]
  ------------------
  111|       |
  112|  12.3k|   if(is_seeded() == false || fork_detected || (m_reseed_interval > 0 && m_reseed_counter >= m_reseed_interval)) {
  ------------------
  |  Branch (112:7): [True: 0, False: 12.3k]
  |  Branch (112:31): [True: 0, False: 12.3k]
  |  Branch (112:49): [True: 0, False: 12.3k]
  |  Branch (112:74): [True: 0, False: 0]
  ------------------
  113|      0|      m_reseed_counter = 0;
  114|      0|      m_last_pid = cur_pid;
  115|       |
  116|      0|      if(m_underlying_rng != nullptr) {
  ------------------
  |  Branch (116:10): [True: 0, False: 0]
  ------------------
  117|      0|         reseed_from_rng(*m_underlying_rng, security_level());
  118|      0|      }
  119|       |
  120|      0|      if(m_entropy_sources != nullptr) {
  ------------------
  |  Branch (120:10): [True: 0, False: 0]
  ------------------
  121|      0|         reseed_from_sources(*m_entropy_sources, security_level());
  122|      0|      }
  123|       |
  124|      0|      if(!is_seeded()) {
  ------------------
  |  Branch (124:10): [True: 0, False: 0]
  ------------------
  125|      0|         if(fork_detected) {
  ------------------
  |  Branch (125:13): [True: 0, False: 0]
  ------------------
  126|      0|            throw Invalid_State("Detected use of fork but cannot reseed DRBG");
  127|      0|         } else {
  128|      0|            throw PRNG_Unseeded(name());
  129|      0|         }
  130|      0|      }
  131|  12.3k|   } else {
  132|  12.3k|      BOTAN_ASSERT(m_reseed_counter != 0, "RNG is seeded");
  ------------------
  |  |   64|  12.3k|   do {                                                                                 \
  |  |   65|  12.3k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                     \
  |  |   66|  12.3k|      if(!(expr)) {                                                                     \
  |  |  ------------------
  |  |  |  Branch (66:10): [True: 0, False: 12.3k]
  |  |  ------------------
  |  |   67|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                            \
  |  |   68|      0|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   69|      0|      }                                                                                 \
  |  |   70|  12.3k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (70:12): [Folded, False: 12.3k]
  |  |  ------------------
  ------------------
  133|  12.3k|      m_reseed_counter += 1;
  134|  12.3k|   }
  135|  12.3k|}

_ZN5Botan6ChaChaC2Em:
   85|      1|ChaCha::ChaCha(size_t rounds) : m_rounds(rounds) {
   86|      1|   BOTAN_ARG_CHECK(m_rounds == 8 || m_rounds == 12 || m_rounds == 20, "ChaCha only supports 8, 12 or 20 rounds");
  ------------------
  |  |   35|      1|   do {                                                          \
  |  |   36|      1|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */              \
  |  |   37|      4|      if(!(expr)) {                                              \
  |  |  ------------------
  |  |  |  Branch (37:12): [True: 0, False: 1]
  |  |  |  Branch (37:12): [True: 0, False: 1]
  |  |  |  Branch (37:12): [True: 1, False: 0]
  |  |  ------------------
  |  |   38|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */     \
  |  |   39|      0|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   40|      0|      }                                                          \
  |  |   41|      1|   } while(0)
  |  |  ------------------
  |  |  |  Branch (41:12): [Folded, False: 1]
  |  |  ------------------
  ------------------
   87|      1|}
_ZN5Botan6ChaCha11parallelismEv:
   89|      2|size_t ChaCha::parallelism() {
   90|      2|#if defined(BOTAN_HAS_CHACHA_AVX512)
   91|      2|   if(CPUID::has(CPUID::Feature::AVX512)) {
  ------------------
  |  Branch (91:7): [True: 0, False: 2]
  ------------------
   92|      0|      return 16;
   93|      0|   }
   94|      2|#endif
   95|       |
   96|      2|#if defined(BOTAN_HAS_CHACHA_AVX2)
   97|      2|   if(CPUID::has(CPUID::Feature::AVX2)) {
  ------------------
  |  Branch (97:7): [True: 2, False: 0]
  ------------------
   98|      2|      return 8;
   99|      2|   }
  100|      0|#endif
  101|       |
  102|      0|   return 4;
  103|      2|}
_ZN5Botan6ChaCha6chachaEPhmPjm:
  127|  1.27k|void ChaCha::chacha(uint8_t output[], size_t output_blocks, uint32_t state[16], size_t rounds) {
  128|  1.27k|   BOTAN_ASSERT(rounds % 2 == 0, "Valid rounds");
  ------------------
  |  |   64|  1.27k|   do {                                                                                 \
  |  |   65|  1.27k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                     \
  |  |   66|  1.27k|      if(!(expr)) {                                                                     \
  |  |  ------------------
  |  |  |  Branch (66:10): [True: 0, False: 1.27k]
  |  |  ------------------
  |  |   67|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                            \
  |  |   68|      0|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   69|      0|      }                                                                                 \
  |  |   70|  1.27k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (70:12): [Folded, False: 1.27k]
  |  |  ------------------
  ------------------
  129|       |
  130|  1.27k|#if defined(BOTAN_HAS_CHACHA_AVX512)
  131|  1.27k|   if(CPUID::has(CPUID::Feature::AVX512)) {
  ------------------
  |  Branch (131:7): [True: 0, False: 1.27k]
  ------------------
  132|      0|      while(output_blocks >= 16) {
  ------------------
  |  Branch (132:13): [True: 0, False: 0]
  ------------------
  133|      0|         ChaCha::chacha_avx512_x16(output, state, rounds);
  134|      0|         output += 16 * 64;
  135|      0|         output_blocks -= 16;
  136|      0|      }
  137|      0|   }
  138|  1.27k|#endif
  139|       |
  140|  1.27k|#if defined(BOTAN_HAS_CHACHA_AVX2)
  141|  1.27k|   if(CPUID::has(CPUID::Feature::AVX2)) {
  ------------------
  |  Branch (141:7): [True: 1.27k, False: 0]
  ------------------
  142|  2.55k|      while(output_blocks >= 8) {
  ------------------
  |  Branch (142:13): [True: 1.27k, False: 1.27k]
  ------------------
  143|  1.27k|         ChaCha::chacha_avx2_x8(output, state, rounds);
  144|  1.27k|         output += 8 * 64;
  145|  1.27k|         output_blocks -= 8;
  146|  1.27k|      }
  147|  1.27k|   }
  148|  1.27k|#endif
  149|       |
  150|  1.27k|#if defined(BOTAN_HAS_CHACHA_SIMD32)
  151|  1.27k|   if(CPUID::has(CPUID::Feature::SIMD_4X32)) {
  ------------------
  |  Branch (151:7): [True: 1.27k, False: 0]
  ------------------
  152|  1.27k|      while(output_blocks >= 4) {
  ------------------
  |  Branch (152:13): [True: 0, False: 1.27k]
  ------------------
  153|      0|         ChaCha::chacha_simd32_x4(output, state, rounds);
  154|      0|         output += 4 * 64;
  155|      0|         output_blocks -= 4;
  156|      0|      }
  157|  1.27k|   }
  158|  1.27k|#endif
  159|       |
  160|       |   // TODO interleave rounds
  161|  1.27k|   for(size_t i = 0; i != output_blocks; ++i) {
  ------------------
  |  Branch (161:22): [True: 0, False: 1.27k]
  ------------------
  162|      0|      uint32_t x00 = state[0];
  163|      0|      uint32_t x01 = state[1];
  164|      0|      uint32_t x02 = state[2];
  165|      0|      uint32_t x03 = state[3];
  166|      0|      uint32_t x04 = state[4];
  167|      0|      uint32_t x05 = state[5];
  168|      0|      uint32_t x06 = state[6];
  169|      0|      uint32_t x07 = state[7];
  170|      0|      uint32_t x08 = state[8];
  171|      0|      uint32_t x09 = state[9];
  172|      0|      uint32_t x10 = state[10];
  173|      0|      uint32_t x11 = state[11];
  174|      0|      uint32_t x12 = state[12];
  175|      0|      uint32_t x13 = state[13];
  176|      0|      uint32_t x14 = state[14];
  177|      0|      uint32_t x15 = state[15];
  178|       |
  179|      0|      for(size_t r = 0; r != rounds / 2; ++r) {
  ------------------
  |  Branch (179:25): [True: 0, False: 0]
  ------------------
  180|      0|         chacha_quarter_round(x00, x04, x08, x12);
  181|      0|         chacha_quarter_round(x01, x05, x09, x13);
  182|      0|         chacha_quarter_round(x02, x06, x10, x14);
  183|      0|         chacha_quarter_round(x03, x07, x11, x15);
  184|       |
  185|      0|         chacha_quarter_round(x00, x05, x10, x15);
  186|      0|         chacha_quarter_round(x01, x06, x11, x12);
  187|      0|         chacha_quarter_round(x02, x07, x08, x13);
  188|      0|         chacha_quarter_round(x03, x04, x09, x14);
  189|      0|      }
  190|       |
  191|      0|      x00 += state[0];
  192|      0|      x01 += state[1];
  193|      0|      x02 += state[2];
  194|      0|      x03 += state[3];
  195|      0|      x04 += state[4];
  196|      0|      x05 += state[5];
  197|      0|      x06 += state[6];
  198|      0|      x07 += state[7];
  199|      0|      x08 += state[8];
  200|      0|      x09 += state[9];
  201|      0|      x10 += state[10];
  202|      0|      x11 += state[11];
  203|      0|      x12 += state[12];
  204|      0|      x13 += state[13];
  205|      0|      x14 += state[14];
  206|      0|      x15 += state[15];
  207|       |
  208|      0|      store_le(x00, output + 64 * i + 4 * 0);
  209|      0|      store_le(x01, output + 64 * i + 4 * 1);
  210|      0|      store_le(x02, output + 64 * i + 4 * 2);
  211|      0|      store_le(x03, output + 64 * i + 4 * 3);
  212|      0|      store_le(x04, output + 64 * i + 4 * 4);
  213|      0|      store_le(x05, output + 64 * i + 4 * 5);
  214|      0|      store_le(x06, output + 64 * i + 4 * 6);
  215|      0|      store_le(x07, output + 64 * i + 4 * 7);
  216|      0|      store_le(x08, output + 64 * i + 4 * 8);
  217|      0|      store_le(x09, output + 64 * i + 4 * 9);
  218|      0|      store_le(x10, output + 64 * i + 4 * 10);
  219|      0|      store_le(x11, output + 64 * i + 4 * 11);
  220|      0|      store_le(x12, output + 64 * i + 4 * 12);
  221|      0|      store_le(x13, output + 64 * i + 4 * 13);
  222|      0|      store_le(x14, output + 64 * i + 4 * 14);
  223|      0|      store_le(x15, output + 64 * i + 4 * 15);
  224|       |
  225|      0|      state[12]++;
  226|      0|      if(state[12] == 0) {
  ------------------
  |  Branch (226:10): [True: 0, False: 0]
  ------------------
  227|      0|         state[13] += 1;
  228|      0|      }
  229|      0|   }
  230|  1.27k|}
_ZN5Botan6ChaCha18generate_keystreamEPhm:
  255|  12.3k|void ChaCha::generate_keystream(uint8_t out[], size_t length) {
  256|  12.3k|   assert_key_material_set();
  257|       |
  258|  13.6k|   while(length >= m_buffer.size() - m_position) {
  ------------------
  |  Branch (258:10): [True: 1.27k, False: 12.3k]
  ------------------
  259|  1.27k|      const size_t available = m_buffer.size() - m_position;
  260|       |
  261|       |      // TODO: this could write directly to the output buffer
  262|       |      // instead of bouncing it through m_buffer first
  263|  1.27k|      copy_mem(out, &m_buffer[m_position], available);
  264|  1.27k|      chacha(m_buffer.data(), m_buffer.size() / 64, m_state.data(), m_rounds);
  265|       |
  266|  1.27k|      length -= available;
  267|  1.27k|      out += available;
  268|  1.27k|      m_position = 0;
  269|  1.27k|   }
  270|       |
  271|  12.3k|   copy_mem(out, &m_buffer[m_position], length);
  272|       |
  273|  12.3k|   m_position += length;
  274|  12.3k|}
_ZN5Botan6ChaCha16initialize_stateEv:
  276|      2|void ChaCha::initialize_state() {
  277|      2|   static const uint32_t TAU[] = {0x61707865, 0x3120646e, 0x79622d36, 0x6b206574};
  278|       |
  279|      2|   static const uint32_t SIGMA[] = {0x61707865, 0x3320646e, 0x79622d32, 0x6b206574};
  280|       |
  281|      2|   m_state[4] = m_key[0];
  282|      2|   m_state[5] = m_key[1];
  283|      2|   m_state[6] = m_key[2];
  284|      2|   m_state[7] = m_key[3];
  285|       |
  286|      2|   if(m_key.size() == 4) {
  ------------------
  |  Branch (286:7): [True: 0, False: 2]
  ------------------
  287|      0|      m_state[0] = TAU[0];
  288|      0|      m_state[1] = TAU[1];
  289|      0|      m_state[2] = TAU[2];
  290|      0|      m_state[3] = TAU[3];
  291|       |
  292|      0|      m_state[8] = m_key[0];
  293|      0|      m_state[9] = m_key[1];
  294|      0|      m_state[10] = m_key[2];
  295|      0|      m_state[11] = m_key[3];
  296|      2|   } else {
  297|      2|      m_state[0] = SIGMA[0];
  298|      2|      m_state[1] = SIGMA[1];
  299|      2|      m_state[2] = SIGMA[2];
  300|      2|      m_state[3] = SIGMA[3];
  301|       |
  302|      2|      m_state[8] = m_key[4];
  303|      2|      m_state[9] = m_key[5];
  304|      2|      m_state[10] = m_key[6];
  305|      2|      m_state[11] = m_key[7];
  306|      2|   }
  307|       |
  308|      2|   m_state[12] = 0;
  309|      2|   m_state[13] = 0;
  310|      2|   m_state[14] = 0;
  311|      2|   m_state[15] = 0;
  312|       |
  313|      2|   m_position = 0;
  314|      2|}
_ZNK5Botan6ChaCha19has_keying_materialEv:
  316|  12.3k|bool ChaCha::has_keying_material() const {
  317|  12.3k|   return !m_state.empty();
  318|  12.3k|}
_ZN5Botan6ChaCha12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE:
  327|      2|void ChaCha::key_schedule(std::span<const uint8_t> key) {
  328|      2|   m_key.resize(key.size() / 4);
  329|      2|   load_le<uint32_t>(m_key.data(), key.data(), m_key.size());
  330|       |
  331|      2|   m_state.resize(16);
  332|       |
  333|      2|   const size_t chacha_block = 64;
  334|      2|   m_buffer.resize(parallelism() * chacha_block);
  335|       |
  336|      2|   set_iv(nullptr, 0);
  337|      2|}
_ZNK5Botan6ChaCha8key_specEv:
  343|      2|Key_Length_Specification ChaCha::key_spec() const {
  344|      2|   return Key_Length_Specification(16, 32, 16);
  345|      2|}
_ZNK5Botan6ChaCha15valid_iv_lengthEm:
  351|      2|bool ChaCha::valid_iv_length(size_t iv_len) const {
  352|      2|   return (iv_len == 0 || iv_len == 8 || iv_len == 12 || iv_len == 24);
  ------------------
  |  Branch (352:12): [True: 2, False: 0]
  |  Branch (352:27): [True: 0, False: 0]
  |  Branch (352:42): [True: 0, False: 0]
  |  Branch (352:58): [True: 0, False: 0]
  ------------------
  353|      2|}
_ZN5Botan6ChaCha12set_iv_bytesEPKhm:
  355|      2|void ChaCha::set_iv_bytes(const uint8_t iv[], size_t length) {
  356|      2|   assert_key_material_set();
  357|       |
  358|      2|   if(!valid_iv_length(length)) {
  ------------------
  |  Branch (358:7): [True: 0, False: 2]
  ------------------
  359|      0|      throw Invalid_IV_Length(name(), length);
  360|      0|   }
  361|       |
  362|      2|   initialize_state();
  363|       |
  364|      2|   if(length == 0) {
  ------------------
  |  Branch (364:7): [True: 2, False: 0]
  ------------------
  365|       |      // Treat zero length IV same as an all-zero IV
  366|      2|      m_state[14] = 0;
  367|      2|      m_state[15] = 0;
  368|      2|   } else if(length == 8) {
  ------------------
  |  Branch (368:14): [True: 0, False: 0]
  ------------------
  369|      0|      m_state[14] = load_le<uint32_t>(iv, 0);
  370|      0|      m_state[15] = load_le<uint32_t>(iv, 1);
  371|      0|   } else if(length == 12) {
  ------------------
  |  Branch (371:14): [True: 0, False: 0]
  ------------------
  372|      0|      m_state[13] = load_le<uint32_t>(iv, 0);
  373|      0|      m_state[14] = load_le<uint32_t>(iv, 1);
  374|      0|      m_state[15] = load_le<uint32_t>(iv, 2);
  375|      0|   } else if(length == 24) {
  ------------------
  |  Branch (375:14): [True: 0, False: 0]
  ------------------
  376|      0|      m_state[12] = load_le<uint32_t>(iv, 0);
  377|      0|      m_state[13] = load_le<uint32_t>(iv, 1);
  378|      0|      m_state[14] = load_le<uint32_t>(iv, 2);
  379|      0|      m_state[15] = load_le<uint32_t>(iv, 3);
  380|       |
  381|      0|      secure_vector<uint32_t> hc(8);
  382|      0|      hchacha(hc.data(), m_state.data(), m_rounds);
  383|       |
  384|      0|      m_state[4] = hc[0];
  385|      0|      m_state[5] = hc[1];
  386|      0|      m_state[6] = hc[2];
  387|      0|      m_state[7] = hc[3];
  388|      0|      m_state[8] = hc[4];
  389|      0|      m_state[9] = hc[5];
  390|      0|      m_state[10] = hc[6];
  391|      0|      m_state[11] = hc[7];
  392|      0|      m_state[12] = 0;
  393|      0|      m_state[13] = 0;
  394|      0|      m_state[14] = load_le<uint32_t>(iv, 4);
  395|      0|      m_state[15] = load_le<uint32_t>(iv, 5);
  396|      0|   }
  397|       |
  398|      2|   chacha(m_buffer.data(), m_buffer.size() / 64, m_state.data(), m_rounds);
  399|      2|   m_position = 0;
  400|      2|}

_ZN5Botan6ChaCha14chacha_avx2_x8EPhPjm:
   15|  1.27k|void BOTAN_FN_ISA_AVX2 ChaCha::chacha_avx2_x8(uint8_t output[64 * 8], uint32_t state[16], size_t rounds) {
   16|  1.27k|   SIMD_8x32::reset_registers();
   17|       |
   18|  1.27k|   BOTAN_ASSERT(rounds % 2 == 0, "Valid rounds");
  ------------------
  |  |   64|  1.27k|   do {                                                                                 \
  |  |   65|  1.27k|      /* NOLINTNEXTLINE(*-simplify-boolean-expr) */                                     \
  |  |   66|  1.27k|      if(!(expr)) {                                                                     \
  |  |  ------------------
  |  |  |  Branch (66:10): [True: 0, False: 1.27k]
  |  |  ------------------
  |  |   67|      0|         /* NOLINTNEXTLINE(bugprone-lambda-function-name) */                            \
  |  |   68|      0|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   69|      0|      }                                                                                 \
  |  |   70|  1.27k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (70:12): [Folded, False: 1.27k]
  |  |  ------------------
  ------------------
   19|  1.27k|   const SIMD_8x32 CTR0 = SIMD_8x32(0, 1, 2, 3, 4, 5, 6, 7);
   20|       |
   21|  1.27k|   const uint32_t C = 0xFFFFFFFF - state[12];
   22|       |   // NOLINTNEXTLINE(*-implicit-bool-conversion)
   23|  1.27k|   const SIMD_8x32 CTR1 = SIMD_8x32(0, C < 1, C < 2, C < 3, C < 4, C < 5, C < 6, C < 7);
   24|       |
   25|  1.27k|   SIMD_8x32 R00 = SIMD_8x32::splat(state[0]);
   26|  1.27k|   SIMD_8x32 R01 = SIMD_8x32::splat(state[1]);
   27|  1.27k|   SIMD_8x32 R02 = SIMD_8x32::splat(state[2]);
   28|  1.27k|   SIMD_8x32 R03 = SIMD_8x32::splat(state[3]);
   29|  1.27k|   SIMD_8x32 R04 = SIMD_8x32::splat(state[4]);
   30|  1.27k|   SIMD_8x32 R05 = SIMD_8x32::splat(state[5]);
   31|  1.27k|   SIMD_8x32 R06 = SIMD_8x32::splat(state[6]);
   32|  1.27k|   SIMD_8x32 R07 = SIMD_8x32::splat(state[7]);
   33|  1.27k|   SIMD_8x32 R08 = SIMD_8x32::splat(state[8]);
   34|  1.27k|   SIMD_8x32 R09 = SIMD_8x32::splat(state[9]);
   35|  1.27k|   SIMD_8x32 R10 = SIMD_8x32::splat(state[10]);
   36|  1.27k|   SIMD_8x32 R11 = SIMD_8x32::splat(state[11]);
   37|  1.27k|   SIMD_8x32 R12 = SIMD_8x32::splat(state[12]) + CTR0;
   38|  1.27k|   SIMD_8x32 R13 = SIMD_8x32::splat(state[13]) + CTR1;
   39|  1.27k|   SIMD_8x32 R14 = SIMD_8x32::splat(state[14]);
   40|  1.27k|   SIMD_8x32 R15 = SIMD_8x32::splat(state[15]);
   41|       |
   42|  14.0k|   for(size_t r = 0; r != rounds / 2; ++r) {
  ------------------
  |  Branch (42:22): [True: 12.7k, False: 1.27k]
  ------------------
   43|  12.7k|      R00 += R04;
   44|  12.7k|      R01 += R05;
   45|  12.7k|      R02 += R06;
   46|  12.7k|      R03 += R07;
   47|       |
   48|  12.7k|      R12 ^= R00;
   49|  12.7k|      R13 ^= R01;
   50|  12.7k|      R14 ^= R02;
   51|  12.7k|      R15 ^= R03;
   52|       |
   53|  12.7k|      R12 = R12.rotl<16>();
   54|  12.7k|      R13 = R13.rotl<16>();
   55|  12.7k|      R14 = R14.rotl<16>();
   56|  12.7k|      R15 = R15.rotl<16>();
   57|       |
   58|  12.7k|      R08 += R12;
   59|  12.7k|      R09 += R13;
   60|  12.7k|      R10 += R14;
   61|  12.7k|      R11 += R15;
   62|       |
   63|  12.7k|      R04 ^= R08;
   64|  12.7k|      R05 ^= R09;
   65|  12.7k|      R06 ^= R10;
   66|  12.7k|      R07 ^= R11;
   67|       |
   68|  12.7k|      R04 = R04.rotl<12>();
   69|  12.7k|      R05 = R05.rotl<12>();
   70|  12.7k|      R06 = R06.rotl<12>();
   71|  12.7k|      R07 = R07.rotl<12>();
   72|       |
   73|  12.7k|      R00 += R04;
   74|  12.7k|      R01 += R05;
   75|  12.7k|      R02 += R06;
   76|  12.7k|      R03 += R07;
   77|       |
   78|  12.7k|      R12 ^= R00;
   79|  12.7k|      R13 ^= R01;
   80|  12.7k|      R14 ^= R02;
   81|  12.7k|      R15 ^= R03;
   82|       |
   83|  12.7k|      R12 = R12.rotl<8>();
   84|  12.7k|      R13 = R13.rotl<8>();
   85|  12.7k|      R14 = R14.rotl<8>();
   86|  12.7k|      R15 = R15.rotl<8>();
   87|       |
   88|  12.7k|      R08 += R12;
   89|  12.7k|      R09 += R13;
   90|  12.7k|      R10 += R14;
   91|  12.7k|      R11 += R15;
   92|       |
   93|  12.7k|      R04 ^= R08;
   94|  12.7k|      R05 ^= R09;
   95|  12.7k|      R06 ^= R10;
   96|  12.7k|      R07 ^= R11;
   97|       |
   98|  12.7k|      R04 = R04.rotl<7>();
   99|  12.7k|      R05 = R05.rotl<7>();
  100|  12.7k|      R06 = R06.rotl<7>();
  101|  12.7k|      R07 = R07.rotl<7>();
  102|       |
  103|  12.7k|      R00 += R05;
  104|  12.7k|      R01 += R06;
  105|  12.7k|      R02 += R07;
  106|  12.7k|      R03 += R04;
  107|       |
  108|  12.7k|      R15 ^= R00;
  109|  12.7k|      R12 ^= R01;
  110|  12.7k|      R13 ^= R02;
  111|  12.7k|      R14 ^= R03;
  112|       |
  113|  12.7k|      R15 = R15.rotl<16>();
  114|  12.7k|      R12 = R12.rotl<16>();
  115|  12.7k|      R13 = R13.rotl<16>();
  116|  12.7k|      R14 = R14.rotl<16>();
  117|       |
  118|  12.7k|      R10 += R15;
  119|  12.7k|      R11 += R12;
  120|  12.7k|      R08 += R13;
  121|  12.7k|      R09 += R14;
  122|       |
  123|  12.7k|      R05 ^= R10;
  124|  12.7k|      R06 ^= R11;
  125|  12.7k|      R07 ^= R08;
  126|  12.7k|      R04 ^= R09;
  127|       |
  128|  12.7k|      R05 = R05.rotl<12>();
  129|  12.7k|      R06 = R06.rotl<12>();
  130|  12.7k|      R07 = R07.rotl<12>();
  131|  12.7k|      R04 = R04.rotl<12>();
  132|       |
  133|  12.7k|      R00 += R05;
  134|  12.7k|      R01 += R06;
  135|  12.7k|      R02 += R07;
  136|  12.7k|      R03 += R04;
  137|       |
  138|  12.7k|      R15 ^= R00;
  139|  12.7k|      R12 ^= R01;
  140|  12.7k|      R13 ^= R02;
  141|  12.7k|      R14 ^= R03;
  142|       |
  143|  12.7k|      R15 = R15.rotl<8>();
  144|  12.7k|      R12 = R12.rotl<8>();
  145|  12.7k|      R13 = R13.rotl<8>();
  146|  12.7k|      R14 = R14.rotl<8>();
  147|       |
  148|  12.7k|      R10 += R15;
  149|  12.7k|      R11 += R12;
  150|  12.7k|      R08 += R13;
  151|  12.7k|      R09 += R14;
  152|       |
  153|  12.7k|      R05 ^= R10;
  154|  12.7k|      R06 ^= R11;
  155|  12.7k|      R07 ^= R08;
  156|  12.7k|      R04 ^= R09;
  157|       |
  158|  12.7k|      R05 = R05.rotl<7>();
  159|  12.7k|      R06 = R06.rotl<7>();
  160|  12.7k|      R07 = R07.rotl<7>();
  161|  12.7k|      R04 = R04.rotl<7>();
  162|  12.7k|   }
  163|       |
  164|  1.27k|   R00 += SIMD_8x32::splat(state[0]);
  165|  1.27k|   R01 += SIMD_8x32::splat(state[1]);
  166|  1.27k|   R02 += SIMD_8x32::splat(state[2]);
  167|  1.27k|   R03 += SIMD_8x32::splat(state[3]);
  168|  1.27k|   R04 += SIMD_8x32::splat(state[4]);
  169|  1.27k|   R05 += SIMD_8x32::splat(state[5]);
  170|  1.27k|   R06 += SIMD_8x32::splat(state[6]);
  171|  1.27k|   R07 += SIMD_8x32::splat(state[7]);
  172|  1.27k|   R08 += SIMD_8x32::splat(state[8]);
  173|  1.27k|   R09 += SIMD_8x32::splat(state[9]);
  174|  1.27k|   R10 += SIMD_8x32::splat(state[10]);
  175|  1.27k|   R11 += SIMD_8x32::splat(state[11]);
  176|  1.27k|   R12 += SIMD_8x32::splat(state[12]) + CTR0;
  177|  1.27k|   R13 += SIMD_8x32::splat(state[13]) + CTR1;
  178|  1.27k|   R14 += SIMD_8x32::splat(state[14]);
  179|  1.27k|   R15 += SIMD_8x32::splat(state[15]);
  180|       |
  181|  1.27k|   SIMD_8x32::transpose(R00, R01, R02, R03, R04, R05, R06, R07);
  182|  1.27k|   SIMD_8x32::transpose(R08, R09, R10, R11, R12, R13, R14, R15);
  183|       |
  184|  1.27k|   R00.store_le(output);
  185|  1.27k|   R08.store_le(output + 32 * 1);
  186|  1.27k|   R01.store_le(output + 32 * 2);
  187|  1.27k|   R09.store_le(output + 32 * 3);
  188|  1.27k|   R02.store_le(output + 32 * 4);
  189|  1.27k|   R10.store_le(output + 32 * 5);
  190|  1.27k|   R03.store_le(output + 32 * 6);
  191|  1.27k|   R11.store_le(output + 32 * 7);
  192|  1.27k|   R04.store_le(output + 32 * 8);
  193|  1.27k|   R12.store_le(output + 32 * 9);
  194|  1.27k|   R05.store_le(output + 32 * 10);
  195|  1.27k|   R13.store_le(output + 32 * 11);
  196|  1.27k|   R06.store_le(output + 32 * 12);
  197|  1.27k|   R14.store_le(output + 32 * 13);
  198|  1.27k|   R07.store_le(output + 32 * 14);
  199|  1.27k|   R15.store_le(output + 32 * 15);
  200|       |
  201|  1.27k|   SIMD_8x32::zero_registers();
  202|       |
  203|  1.27k|   state[12] += 8;
  204|  1.27k|   if(state[12] < 8) {
  ------------------
  |  Branch (204:7): [True: 0, False: 1.27k]
  ------------------
  205|      0|      state[13]++;
  206|      0|   }
  207|  1.27k|}

_ZN5Botan12StreamCipher6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_:
   40|      1|std::unique_ptr<StreamCipher> StreamCipher::create(std::string_view algo_spec, std::string_view provider) {
   41|      1|#if defined(BOTAN_HAS_SHAKE_CIPHER)
   42|      1|   if(algo_spec == "SHAKE-128" || algo_spec == "SHAKE-128-XOF") {
  ------------------
  |  Branch (42:7): [True: 0, False: 1]
  |  Branch (42:35): [True: 0, False: 1]
  ------------------
   43|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (43:10): [True: 0, False: 0]
  |  Branch (43:30): [True: 0, False: 0]
  ------------------
   44|      0|         return std::make_unique<SHAKE_128_Cipher>();
   45|      0|      }
   46|      0|   }
   47|       |
   48|      1|   if(algo_spec == "SHAKE-256" || algo_spec == "SHAKE-256-XOF") {
  ------------------
  |  Branch (48:7): [True: 0, False: 1]
  |  Branch (48:35): [True: 0, False: 1]
  ------------------
   49|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (49:10): [True: 0, False: 0]
  |  Branch (49:30): [True: 0, False: 0]
  ------------------
   50|      0|         return std::make_unique<SHAKE_256_Cipher>();
   51|      0|      }
   52|      0|   }
   53|      1|#endif
   54|       |
   55|      1|#if defined(BOTAN_HAS_CHACHA)
   56|      1|   if(algo_spec == "ChaCha20") {
  ------------------
  |  Branch (56:7): [True: 0, False: 1]
  ------------------
   57|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (57:10): [True: 0, False: 0]
  |  Branch (57:30): [True: 0, False: 0]
  ------------------
   58|      0|         return std::make_unique<ChaCha>(20);
   59|      0|      }
   60|      0|   }
   61|      1|#endif
   62|       |
   63|      1|#if defined(BOTAN_HAS_SALSA20)
   64|      1|   if(algo_spec == "Salsa20") {
  ------------------
  |  Branch (64:7): [True: 0, False: 1]
  ------------------
   65|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (65:10): [True: 0, False: 0]
  |  Branch (65:30): [True: 0, False: 0]
  ------------------
   66|      0|         return std::make_unique<Salsa20>();
   67|      0|      }
   68|      0|   }
   69|      1|#endif
   70|       |
   71|      1|   const SCAN_Name req(algo_spec);
   72|       |
   73|      1|#if defined(BOTAN_HAS_CTR_BE)
   74|      1|   if((req.algo_name() == "CTR-BE" || req.algo_name() == "CTR") && req.arg_count_between(1, 2)) {
  ------------------
  |  Branch (74:8): [True: 0, False: 1]
  |  Branch (74:39): [True: 0, False: 1]
  |  Branch (74:68): [True: 0, False: 0]
  ------------------
   75|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (75:10): [True: 0, False: 0]
  |  Branch (75:30): [True: 0, False: 0]
  ------------------
   76|      0|         auto cipher = BlockCipher::create(req.arg(0));
   77|      0|         if(cipher) {
  ------------------
  |  Branch (77:13): [True: 0, False: 0]
  ------------------
   78|      0|            const size_t ctr_size = req.arg_as_integer(1, cipher->block_size());
   79|      0|            return std::make_unique<CTR_BE>(std::move(cipher), ctr_size);
   80|      0|         }
   81|      0|      }
   82|      0|   }
   83|      1|#endif
   84|       |
   85|      1|#if defined(BOTAN_HAS_CHACHA)
   86|      1|   if(req.algo_name() == "ChaCha") {
  ------------------
  |  Branch (86:7): [True: 1, False: 0]
  ------------------
   87|      1|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (87:10): [True: 1, False: 0]
  |  Branch (87:30): [True: 0, False: 0]
  ------------------
   88|      1|         return std::make_unique<ChaCha>(req.arg_as_integer(0, 20));
   89|      1|      }
   90|      1|   }
   91|      0|#endif
   92|       |
   93|      0|#if defined(BOTAN_HAS_OFB)
   94|      0|   if(req.algo_name() == "OFB" && req.arg_count() == 1) {
  ------------------
  |  Branch (94:7): [True: 0, False: 0]
  |  Branch (94:35): [True: 0, False: 0]
  ------------------
   95|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (95:10): [True: 0, False: 0]
  |  Branch (95:30): [True: 0, False: 0]
  ------------------
   96|      0|         if(auto cipher = BlockCipher::create(req.arg(0))) {
  ------------------
  |  Branch (96:18): [True: 0, False: 0]
  ------------------
   97|      0|            return std::make_unique<OFB>(std::move(cipher));
   98|      0|         }
   99|      0|      }
  100|      0|   }
  101|      0|#endif
  102|       |
  103|      0|#if defined(BOTAN_HAS_RC4)
  104|       |
  105|      0|   if(req.algo_name() == "RC4" || req.algo_name() == "ARC4" || req.algo_name() == "MARK-4") {
  ------------------
  |  Branch (105:7): [True: 0, False: 0]
  |  Branch (105:35): [True: 0, False: 0]
  |  Branch (105:64): [True: 0, False: 0]
  ------------------
  106|      0|      const size_t skip = (req.algo_name() == "MARK-4") ? 256 : req.arg_as_integer(0, 0);
  ------------------
  |  Branch (106:27): [True: 0, False: 0]
  ------------------
  107|       |
  108|      0|      if(provider.empty() || provider == "base") {
  ------------------
  |  Branch (108:10): [True: 0, False: 0]
  |  Branch (108:30): [True: 0, False: 0]
  ------------------
  109|      0|         return std::make_unique<RC4>(skip);
  110|      0|      }
  111|      0|   }
  112|       |
  113|      0|#endif
  114|       |
  115|      0|   BOTAN_UNUSED(req);
  ------------------
  |  |  144|      0|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
  116|      0|   BOTAN_UNUSED(provider);
  ------------------
  |  |  144|      0|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
  117|       |
  118|      0|   return nullptr;
  119|      0|}
_ZN5Botan12StreamCipher15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_:
  122|      1|std::unique_ptr<StreamCipher> StreamCipher::create_or_throw(std::string_view algo, std::string_view provider) {
  123|      1|   if(auto sc = StreamCipher::create(algo, provider)) {
  ------------------
  |  Branch (123:12): [True: 1, False: 0]
  ------------------
  124|      1|      return sc;
  125|      1|   }
  126|      0|   throw Lookup_Error("Stream cipher", algo, provider);
  127|      1|}

_ZN5Botan15allocate_memoryEmm:
   21|  5.06k|BOTAN_MALLOC_FN void* allocate_memory(size_t elems, size_t elem_size) {
   22|  5.06k|   if(elems == 0 || elem_size == 0) {
  ------------------
  |  Branch (22:7): [True: 0, False: 5.06k]
  |  Branch (22:21): [True: 0, False: 5.06k]
  ------------------
   23|      0|      return nullptr;
   24|      0|   }
   25|       |
   26|       |   // Some calloc implementations do not check for overflow (?!?)
   27|  5.06k|   if(!checked_mul(elems, elem_size).has_value()) {
  ------------------
  |  Branch (27:7): [True: 0, False: 5.06k]
  ------------------
   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|  5.06k|   void* ptr = std::calloc(elems, elem_size);  // NOLINT(*-no-malloc,*-owning-memory)
   43|  5.06k|#endif
   44|  5.06k|   if(ptr == nullptr) {
  ------------------
  |  Branch (44:7): [True: 0, False: 5.06k]
  ------------------
   45|      0|      [[unlikely]] throw std::bad_alloc();
   46|      0|   }
   47|  5.06k|   return ptr;
   48|  5.06k|}
_ZN5Botan17deallocate_memoryEPvmm:
   50|  5.06k|void deallocate_memory(void* p, size_t elems, size_t elem_size) {
   51|  5.06k|   if(p == nullptr) {
  ------------------
  |  Branch (51:7): [True: 0, False: 5.06k]
  ------------------
   52|      0|      [[unlikely]] return;
   53|      0|   }
   54|       |
   55|  5.06k|   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|  5.06k|   std::free(p);  // NOLINT(*-no-malloc,*-owning-memory)
   64|  5.06k|}
_ZN5Botan20initialize_allocatorEv:
   66|      1|void initialize_allocator() {
   67|       |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR)
   68|       |   mlock_allocator::instance();
   69|       |#endif
   70|      1|}

_ZN5Botan5CPUID10CPUID_DataC2Ev:
   80|      1|CPUID::CPUID_Data::CPUID_Data() {
   81|       |   // NOLINTBEGIN(*-prefer-member-initializer)
   82|      1|#if defined(BOTAN_HAS_CPUID_DETECTION)
   83|      1|   m_processor_features = detect_cpu_features(~cleared_cpuid_bits());
   84|       |#else
   85|       |   m_processor_features = 0;
   86|       |#endif
   87|       |   // NOLINTEND(*-prefer-member-initializer)
   88|      1|}
cpuid.cpp:_ZN5Botan12_GLOBAL__N_118cleared_cpuid_bitsEv:
   59|      1|uint32_t cleared_cpuid_bits() {
   60|      1|   uint32_t cleared = 0;
   61|       |
   62|      1|   #if defined(BOTAN_HAS_OS_UTILS)
   63|      1|   std::string clear_cpuid_env;
   64|      1|   if(OS::read_env_variable(clear_cpuid_env, "BOTAN_CLEAR_CPUID")) {
  ------------------
  |  Branch (64:7): [True: 0, False: 1]
  ------------------
   65|      0|      for(const auto& cpuid : split_on(clear_cpuid_env, ',')) {
  ------------------
  |  Branch (65:29): [True: 0, False: 0]
  ------------------
   66|      0|         if(auto bit = CPUID::bit_from_string(cpuid)) {
  ------------------
  |  Branch (66:18): [True: 0, False: 0]
  ------------------
   67|      0|            cleared |= bit->as_u32();
   68|      0|         }
   69|      0|      }
   70|      0|   }
   71|      1|   #endif
   72|       |
   73|      1|   return cleared;
   74|      1|}

_ZN5Botan5CPUID10CPUID_Data19detect_cpu_featuresEj:
   62|      1|uint32_t CPUID::CPUID_Data::detect_cpu_features(uint32_t allowed) {
   63|      1|   enum class x86_CPUID_1_bits : uint64_t {
   64|      1|      RDTSC = (1ULL << 4),
   65|      1|      SSE2 = (1ULL << 26),
   66|      1|      CLMUL = (1ULL << 33),
   67|      1|      SSSE3 = (1ULL << 41),
   68|      1|      SSE41 = (1ULL << 51),
   69|      1|      AESNI = (1ULL << 57),
   70|       |      // AVX + OSXSAVE
   71|      1|      OSXSAVE = (1ULL << 59) | (1ULL << 60),
   72|      1|      RDRAND = (1ULL << 62)
   73|      1|   };
   74|       |
   75|      1|   enum class x86_CPUID_7_bits : uint64_t {
   76|      1|      BMI1 = (1ULL << 3),
   77|      1|      AVX2 = (1ULL << 5),
   78|      1|      BMI2 = (1ULL << 8),
   79|      1|      BMI_1_AND_2 = BMI1 | BMI2,
   80|      1|      AVX512_F = (1ULL << 16),
   81|      1|      AVX512_DQ = (1ULL << 17),
   82|      1|      RDSEED = (1ULL << 18),
   83|      1|      ADX = (1ULL << 19),
   84|      1|      AVX512_IFMA = (1ULL << 21),
   85|      1|      SHA = (1ULL << 29),
   86|      1|      AVX512_BW = (1ULL << 30),
   87|      1|      AVX512_VL = (1ULL << 31),
   88|      1|      AVX512_VBMI = (1ULL << 33),
   89|      1|      AVX512_VBMI2 = (1ULL << 38),
   90|      1|      GFNI = (1ULL << 40),
   91|      1|      AVX512_VAES = (1ULL << 41),
   92|      1|      AVX512_VCLMUL = (1ULL << 42),
   93|      1|      AVX512_VBITALG = (1ULL << 44),
   94|       |
   95|       |      /*
   96|       |      We only enable AVX512 support if all of the below flags are available
   97|       |
   98|       |      This is more than we strictly need for most uses, however it also has
   99|       |      the effect of preventing execution of AVX512 codepaths on cores that
  100|       |      have serious downclocking problems when AVX512 code executes,
  101|       |      especially Intel Skylake.
  102|       |
  103|       |      VBMI2/VBITALG are the key flags here as they restrict us to Intel Ice
  104|       |      Lake/Rocket Lake, or AMD Zen4, all of which do not have penalties for
  105|       |      executing AVX512.
  106|       |
  107|       |      There is nothing stopping some future processor from supporting the
  108|       |      above flags and having AVX512 penalties, but maybe you should not have
  109|       |      bought such a processor.
  110|       |      */
  111|      1|      AVX512_PROFILE =
  112|      1|         AVX512_F | AVX512_DQ | AVX512_IFMA | AVX512_BW | AVX512_VL | AVX512_VBMI | AVX512_VBMI2 | AVX512_VBITALG,
  113|      1|   };
  114|       |
  115|       |   // NOLINTNEXTLINE(performance-enum-size)
  116|      1|   enum class x86_CPUID_7_1_bits : uint64_t {
  117|      1|      SHA512 = (1 << 0),
  118|      1|      SM3 = (1 << 1),
  119|      1|      SM4 = (1 << 2),
  120|      1|   };
  121|       |
  122|      1|   uint32_t feat = 0;
  123|      1|   uint32_t cpuid[4] = {0};
  124|      1|   bool has_os_ymm_support = false;
  125|      1|   bool has_os_zmm_support = false;
  126|       |
  127|       |   // CPUID 0: vendor identification, max sublevel
  128|      1|   invoke_cpuid(0, cpuid);
  129|       |
  130|      1|   const uint32_t max_supported_sublevel = cpuid[0];
  131|       |
  132|      1|   if(max_supported_sublevel >= 1) {
  ------------------
  |  Branch (132:7): [True: 1, False: 0]
  ------------------
  133|       |      // CPUID 1: feature bits
  134|      1|      invoke_cpuid(1, cpuid);
  135|      1|      const uint64_t flags0 = (static_cast<uint64_t>(cpuid[2]) << 32) | cpuid[3];
  136|       |
  137|      1|      feat |= if_set(flags0, x86_CPUID_1_bits::RDTSC, CPUFeature::Bit::RDTSC, allowed);
  138|       |
  139|      1|      feat |= if_set(flags0, x86_CPUID_1_bits::RDRAND, CPUFeature::Bit::RDRAND, allowed);
  140|       |
  141|      1|      feat |= if_set(flags0, x86_CPUID_1_bits::SSE2, CPUFeature::Bit::SSE2, allowed);
  142|       |
  143|      1|      if(is_set(feat, CPUFeature::Bit::SSE2)) {
  ------------------
  |  Branch (143:10): [True: 1, False: 0]
  ------------------
  144|      1|         feat |= if_set(flags0, x86_CPUID_1_bits::SSSE3, CPUFeature::Bit::SSSE3, allowed);
  145|       |
  146|      1|         if(is_set(feat, CPUFeature::Bit::SSSE3)) {
  ------------------
  |  Branch (146:13): [True: 1, False: 0]
  ------------------
  147|      1|            feat |= if_set(flags0, x86_CPUID_1_bits::CLMUL, CPUFeature::Bit::CLMUL, allowed);
  148|      1|            feat |= if_set(flags0, x86_CPUID_1_bits::AESNI, CPUFeature::Bit::AESNI, allowed);
  149|      1|         }
  150|       |
  151|      1|         const uint64_t osxsave64 = static_cast<uint64_t>(x86_CPUID_1_bits::OSXSAVE);
  152|      1|         if((flags0 & osxsave64) == osxsave64) {
  ------------------
  |  Branch (152:13): [True: 1, False: 0]
  ------------------
  153|      1|            const uint64_t xcr_flags = xgetbv();
  154|      1|            if((xcr_flags & 0x6) == 0x6) {
  ------------------
  |  Branch (154:16): [True: 1, False: 0]
  ------------------
  155|      1|               has_os_ymm_support = true;
  156|      1|               has_os_zmm_support = (xcr_flags & 0xE0) == 0xE0;
  157|      1|            }
  158|      1|         }
  159|      1|      }
  160|      1|   }
  161|       |
  162|      1|   if(max_supported_sublevel >= 7) {
  ------------------
  |  Branch (162:7): [True: 1, False: 0]
  ------------------
  163|      1|      clear_mem(cpuid, 4);
  164|      1|      invoke_cpuid_sublevel(7, 0, cpuid);
  165|       |
  166|      1|      const uint64_t flags7 = (static_cast<uint64_t>(cpuid[2]) << 32) | cpuid[1];
  167|       |
  168|      1|      clear_mem(cpuid, 4);
  169|      1|      invoke_cpuid_sublevel(7, 1, cpuid);
  170|      1|      const uint32_t flags7_1 = cpuid[0];
  171|       |
  172|      1|      feat |= if_set(flags7, x86_CPUID_7_bits::RDSEED, CPUFeature::Bit::RDSEED, allowed);
  173|      1|      feat |= if_set(flags7, x86_CPUID_7_bits::ADX, CPUFeature::Bit::ADX, allowed);
  174|       |
  175|       |      /*
  176|       |      We only set the BMI bit if both BMI1 and BMI2 are supported, since
  177|       |      typically we want to use both extensions in the same code.
  178|       |      */
  179|      1|      feat |= if_set(flags7, x86_CPUID_7_bits::BMI_1_AND_2, CPUFeature::Bit::BMI, allowed);
  180|       |
  181|      1|      if(is_set(feat, CPUFeature::Bit::SSSE3)) {
  ------------------
  |  Branch (181:10): [True: 1, False: 0]
  ------------------
  182|      1|         feat |= if_set(flags7, x86_CPUID_7_bits::SHA, CPUFeature::Bit::SHA, allowed);
  183|      1|         feat |= if_set(flags7_1, x86_CPUID_7_1_bits::SM3, CPUFeature::Bit::SM3, allowed);
  184|       |
  185|       |         // We only consider AVX2 if SSSE3 is supported
  186|      1|         if(has_os_ymm_support) {
  ------------------
  |  Branch (186:13): [True: 1, False: 0]
  ------------------
  187|      1|            feat |= if_set(flags7, x86_CPUID_7_bits::AVX2, CPUFeature::Bit::AVX2, allowed);
  188|       |
  189|      1|            if(is_set(feat, CPUFeature::Bit::AVX2)) {
  ------------------
  |  Branch (189:16): [True: 1, False: 0]
  ------------------
  190|      1|               feat |= if_set(flags7, x86_CPUID_7_bits::GFNI, CPUFeature::Bit::GFNI, allowed);
  191|      1|               feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_VAES, CPUFeature::Bit::AVX2_AES, allowed);
  192|      1|               feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_VCLMUL, CPUFeature::Bit::AVX2_CLMUL, allowed);
  193|      1|               feat |= if_set(flags7_1, x86_CPUID_7_1_bits::SHA512, CPUFeature::Bit::SHA512, allowed);
  194|      1|               feat |= if_set(flags7_1, x86_CPUID_7_1_bits::SM4, CPUFeature::Bit::SM4, allowed);
  195|       |
  196|       |               // Likewise we only consider AVX-512 if AVX2 is supported
  197|      1|               if(has_os_zmm_support) {
  ------------------
  |  Branch (197:19): [True: 0, False: 1]
  ------------------
  198|      0|                  feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_PROFILE, CPUFeature::Bit::AVX512, allowed);
  199|       |
  200|      0|                  if(is_set(feat, CPUFeature::Bit::AVX512)) {
  ------------------
  |  Branch (200:22): [True: 0, False: 0]
  ------------------
  201|      0|                     feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_VAES, CPUFeature::Bit::AVX512_AES, allowed);
  202|      0|                     feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_VCLMUL, CPUFeature::Bit::AVX512_CLMUL, allowed);
  203|      0|                  }
  204|      0|               }
  205|      1|            }
  206|      1|         }
  207|      1|      }
  208|      1|   }
  209|       |
  210|       |/*
  211|       |   * If we don't have access to CPUID, we can still safely assume that
  212|       |   * any x86-64 processor has SSE2 and RDTSC
  213|       |   */
  214|      1|#if defined(BOTAN_TARGET_ARCH_IS_X86_64)
  215|      1|   if(feat == 0) {
  ------------------
  |  Branch (215:7): [True: 0, False: 1]
  ------------------
  216|      0|      feat |= CPUFeature::Bit::SSE2 & allowed;
  217|      0|      feat |= CPUFeature::Bit::RDTSC & allowed;
  218|      0|   }
  219|      1|#endif
  220|       |
  221|      1|   return feat;
  222|      1|}
cpuid_x86.cpp:_ZN5Botan12_GLOBAL__N_112invoke_cpuidEjPj:
   24|      2|void invoke_cpuid(uint32_t type, uint32_t out[4]) {
   25|      2|   clear_mem(out, 4);
   26|       |
   27|      2|#if defined(BOTAN_USE_GCC_INLINE_ASM)
   28|       |   // NOLINTNEXTLINE(*-no-assembler)
   29|      2|   asm volatile("cpuid\n\t" : "=a"(out[0]), "=b"(out[1]), "=c"(out[2]), "=d"(out[3]) : "0"(type));
   30|       |
   31|       |#elif defined(BOTAN_BUILD_COMPILER_IS_MSVC)
   32|       |   __cpuid((int*)out, type);
   33|       |
   34|       |#else
   35|       |   BOTAN_UNUSED(type);
   36|       |   #warning "No way of calling x86 cpuid instruction for this compiler"
   37|       |#endif
   38|      2|}
cpuid_x86.cpp:_ZN5Botan12_GLOBAL__N_16xgetbvEv:
   56|      1|BOTAN_FUNC_ISA("xsave") uint64_t xgetbv() {
   57|       |   return _xgetbv(0);
   58|      1|}
cpuid_x86.cpp:_ZN5Botan12_GLOBAL__N_121invoke_cpuid_sublevelEjjPj:
   40|      2|void invoke_cpuid_sublevel(uint32_t type, uint32_t level, uint32_t out[4]) {
   41|      2|   clear_mem(out, 4);
   42|       |
   43|      2|#if defined(BOTAN_USE_GCC_INLINE_ASM)
   44|       |   // NOLINTNEXTLINE(*-no-assembler)
   45|      2|   asm volatile("cpuid\n\t" : "=a"(out[0]), "=b"(out[1]), "=c"(out[2]), "=d"(out[3]) : "0"(type), "2"(level));
   46|       |
   47|       |#elif defined(BOTAN_BUILD_COMPILER_IS_MSVC)
   48|       |   __cpuidex((int*)out, type, level);
   49|       |
   50|       |#else
   51|       |   BOTAN_UNUSED(type, level);
   52|       |   #warning "No way of calling x86 cpuid instruction for this compiler"
   53|       |#endif
   54|      2|}

_ZN5Botan19secure_scrub_memoryEPvm:
   25|  5.06k|void secure_scrub_memory(void* ptr, size_t n) {
   26|  5.06k|   return secure_zeroize_buffer(ptr, n);
   27|  5.06k|}
_ZN5Botan21secure_zeroize_bufferEPvm:
   29|  7.53k|void secure_zeroize_buffer(void* ptr, size_t n) {
   30|  7.53k|   if(n == 0) {
  ------------------
  |  Branch (30:7): [True: 0, False: 7.53k]
  ------------------
   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|  7.53k|   ::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|  7.53k|}

_ZN5Botan2OS14get_process_idEv:
   76|  12.3k|uint32_t OS::get_process_id() {
   77|  12.3k|#if defined(BOTAN_TARGET_OS_HAS_POSIX1)
   78|  12.3k|   return ::getpid();
   79|       |#elif defined(BOTAN_TARGET_OS_HAS_WIN32)
   80|       |   return ::GetCurrentProcessId();
   81|       |#elif defined(BOTAN_TARGET_OS_IS_LLVM) || defined(BOTAN_TARGET_OS_IS_NONE)
   82|       |   return 0;  // truly no meaningful value
   83|       |#else
   84|       |   #error "Missing get_process_id"
   85|       |#endif
   86|  12.3k|}
_ZN5Botan2OS17read_env_variableERNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EE:
  448|      1|bool OS::read_env_variable(std::string& value_out, std::string_view name_view) {
  449|      1|   value_out = "";
  450|       |
  451|      1|   if(running_in_privileged_state()) {
  ------------------
  |  Branch (451:7): [True: 0, False: 1]
  ------------------
  452|      0|      return false;
  453|      0|   }
  454|       |
  455|       |#if defined(BOTAN_TARGET_OS_HAS_WIN32) && \
  456|       |   (defined(BOTAN_BUILD_COMPILER_IS_MSVC) || defined(BOTAN_BUILD_COMPILER_IS_CLANGCL))
  457|       |   const std::string name(name_view);
  458|       |   char val[128] = {0};
  459|       |   size_t req_size = 0;
  460|       |   if(getenv_s(&req_size, val, sizeof(val), name.c_str()) == 0) {
  461|       |      // Microsoft's implementation always writes a terminating \0,
  462|       |      // and includes it in the reported length of the environment variable
  463|       |      // if a value exists.
  464|       |      if(req_size > 0 && val[req_size - 1] == '\0') {
  465|       |         value_out = std::string(val);
  466|       |      } else {
  467|       |         value_out = std::string(val, req_size);
  468|       |      }
  469|       |      return true;
  470|       |   }
  471|       |#else
  472|      1|   const std::string name(name_view);
  473|      1|   if(const char* val = std::getenv(name.c_str())) {
  ------------------
  |  Branch (473:19): [True: 0, False: 1]
  ------------------
  474|      0|      value_out = val;
  475|      0|      return true;
  476|      0|   }
  477|      1|#endif
  478|       |
  479|      1|   return false;
  480|      1|}
os_utils.cpp:_ZN5Botan12_GLOBAL__N_110get_auxvalENSt3__18optionalImEE:
  118|      1|std::optional<unsigned long> get_auxval(std::optional<unsigned long> id) {
  119|      1|   if(id) {
  ------------------
  |  Branch (119:7): [True: 1, False: 0]
  ------------------
  120|      1|#if defined(BOTAN_TARGET_OS_HAS_GETAUXVAL)
  121|      1|      return ::getauxval(*id);
  122|       |#elif defined(BOTAN_TARGET_OS_HAS_ELF_AUX_INFO)
  123|       |      unsigned long auxinfo = 0;
  124|       |      if(::elf_aux_info(static_cast<int>(*id), &auxinfo, sizeof(auxinfo)) == 0) {
  125|       |         return auxinfo;
  126|       |      }
  127|       |#endif
  128|      1|   }
  129|       |
  130|      0|   return {};
  131|      1|}
os_utils.cpp:_ZN5Botan12_GLOBAL__N_127running_in_privileged_stateEv:
  152|      1|bool running_in_privileged_state() {
  153|      1|#if defined(AT_SECURE)
  154|      1|   if(auto at_secure = get_auxval(AT_SECURE)) {
  ------------------
  |  Branch (154:12): [True: 1, False: 0]
  ------------------
  155|      1|      return at_secure != 0;
  156|      1|   }
  157|      0|#endif
  158|       |
  159|      0|#if defined(BOTAN_TARGET_OS_HAS_POSIX1)
  160|      0|   return (::getuid() != ::geteuid()) || (::getgid() != ::getegid());
  ------------------
  |  Branch (160:11): [True: 0, False: 0]
  |  Branch (160:42): [True: 0, False: 0]
  ------------------
  161|       |#else
  162|       |   return false;
  163|       |#endif
  164|      1|}

_ZN5Botan9to_u32bitENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE:
   30|      1|uint32_t to_u32bit(std::string_view str_view) {
   31|      1|   const std::string str(str_view);
   32|       |
   33|       |   // std::stoul is not strict enough. Ensure that str is digit only [0-9]*
   34|      2|   for(const char chr : str) {
  ------------------
  |  Branch (34:23): [True: 2, False: 1]
  ------------------
   35|      2|      if(chr < '0' || chr > '9') {
  ------------------
  |  Branch (35:10): [True: 0, False: 2]
  |  Branch (35:23): [True: 0, False: 2]
  ------------------
   36|      0|         throw Invalid_Argument("to_u32bit invalid decimal string '" + str + "'");
   37|      0|      }
   38|      2|   }
   39|       |
   40|      1|   const unsigned long int x = std::stoul(str);
   41|       |
   42|      1|   if constexpr(sizeof(unsigned long int) > 4) {
   43|       |      // x might be uint64
   44|      1|      if(x > std::numeric_limits<uint32_t>::max()) {
  ------------------
  |  Branch (44:10): [True: 0, False: 1]
  ------------------
   45|      0|         throw Invalid_Argument("Integer value of " + str + " exceeds 32 bit range");
   46|      0|      }
   47|      1|   }
   48|       |
   49|      1|   return static_cast<uint32_t>(x);
   50|      1|}

_ZN5Botan9SCAN_NameC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   58|      2|SCAN_Name::SCAN_Name(std::string_view algo_spec) : m_orig_algo_spec(algo_spec) {
   59|      2|   if(algo_spec.empty()) {
  ------------------
  |  Branch (59:7): [True: 0, False: 2]
  ------------------
   60|      0|      throw Invalid_Argument("Expected algorithm name, got empty string");
   61|      0|   }
   62|       |
   63|      2|   std::vector<std::pair<size_t, std::string>> name;
   64|      2|   size_t level = 0;
   65|      2|   std::pair<size_t, std::string> accum = std::make_pair(level, "");
   66|       |
   67|      2|   const std::string decoding_error = "Bad SCAN name '" + m_orig_algo_spec + "': ";
   68|       |
   69|     23|   for(const char c : algo_spec) {
  ------------------
  |  Branch (69:21): [True: 23, False: 2]
  ------------------
   70|     23|      if(c == '/' || c == ',' || c == '(' || c == ')') {
  ------------------
  |  Branch (70:10): [True: 0, False: 23]
  |  Branch (70:22): [True: 0, False: 23]
  |  Branch (70:34): [True: 2, False: 21]
  |  Branch (70:46): [True: 2, False: 19]
  ------------------
   71|      4|         if(c == '(') {
  ------------------
  |  Branch (71:13): [True: 2, False: 2]
  ------------------
   72|      2|            ++level;
   73|      2|         } else if(c == ')') {
  ------------------
  |  Branch (73:20): [True: 2, False: 0]
  ------------------
   74|      2|            if(level == 0) {
  ------------------
  |  Branch (74:16): [True: 0, False: 2]
  ------------------
   75|      0|               throw Decoding_Error(decoding_error + "Mismatched parens");
   76|      0|            }
   77|      2|            --level;
   78|      2|         }
   79|       |
   80|      4|         if(c == '/' && level > 0) {
  ------------------
  |  Branch (80:13): [True: 0, False: 4]
  |  Branch (80:25): [True: 0, False: 0]
  ------------------
   81|      0|            accum.second.push_back(c);
   82|      4|         } else {
   83|      4|            if(!accum.second.empty()) {
  ------------------
  |  Branch (83:16): [True: 4, False: 0]
  ------------------
   84|      4|               name.push_back(accum);
   85|      4|            }
   86|      4|            accum = std::make_pair(level, "");
   87|      4|         }
   88|     19|      } else {
   89|     19|         accum.second.push_back(c);
   90|     19|      }
   91|     23|   }
   92|       |
   93|      2|   if(!accum.second.empty()) {
  ------------------
  |  Branch (93:7): [True: 0, False: 2]
  ------------------
   94|      0|      name.push_back(accum);
   95|      0|   }
   96|       |
   97|      2|   if(level != 0) {
  ------------------
  |  Branch (97:7): [True: 0, False: 2]
  ------------------
   98|      0|      throw Decoding_Error(decoding_error + "Missing close paren");
   99|      0|   }
  100|       |
  101|      2|   if(name.empty()) {
  ------------------
  |  Branch (101:7): [True: 0, False: 2]
  ------------------
  102|      0|      throw Decoding_Error(decoding_error + "Empty name");
  103|      0|   }
  104|       |
  105|      2|   m_alg_name = name[0].second;
  106|       |
  107|      2|   bool in_modes = false;
  108|       |
  109|      4|   for(size_t i = 1; i != name.size(); ++i) {
  ------------------
  |  Branch (109:22): [True: 2, False: 2]
  ------------------
  110|      2|      if(name[i].first == 0) {
  ------------------
  |  Branch (110:10): [True: 0, False: 2]
  ------------------
  111|      0|         m_mode_info.push_back(make_arg(name, i));
  112|      0|         in_modes = true;
  113|      2|      } else if(name[i].first == 1 && !in_modes) {
  ------------------
  |  Branch (113:17): [True: 2, False: 0]
  |  Branch (113:39): [True: 2, False: 0]
  ------------------
  114|      2|         m_args.push_back(make_arg(name, i));
  115|      2|      }
  116|      2|   }
  117|      2|}
_ZNK5Botan9SCAN_Name3argEm:
  119|      1|std::string SCAN_Name::arg(size_t i) const {
  120|      1|   if(i >= arg_count()) {
  ------------------
  |  Branch (120:7): [True: 0, False: 1]
  ------------------
  121|      0|      throw Invalid_Argument("SCAN_Name::arg " + std::to_string(i) + " out of range for '" + to_string() + "'");
  122|      0|   }
  123|      1|   return m_args[i];
  124|      1|}
_ZNK5Botan9SCAN_Name14arg_as_integerEmm:
  133|      1|size_t SCAN_Name::arg_as_integer(size_t i, size_t def_value) const {
  134|      1|   if(i >= arg_count()) {
  ------------------
  |  Branch (134:7): [True: 0, False: 1]
  ------------------
  135|      0|      return def_value;
  136|      0|   }
  137|      1|   return to_u32bit(m_args[i]);
  138|      1|}
scan_name.cpp:_ZN5Botan12_GLOBAL__N_18make_argERKNSt3__16vectorINS1_4pairImNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEENS7_ISA_EEEEm:
   17|      2|std::string make_arg(const std::vector<std::pair<size_t, std::string>>& name, size_t start) {
   18|      2|   std::string output = name[start].second;
   19|      2|   size_t level = name[start].first;
   20|       |
   21|      2|   size_t paren_depth = 0;
   22|       |
   23|      2|   for(size_t i = start + 1; i != name.size(); ++i) {
  ------------------
  |  Branch (23:30): [True: 0, False: 2]
  ------------------
   24|      0|      if(name[i].first <= name[start].first) {
  ------------------
  |  Branch (24:10): [True: 0, False: 0]
  ------------------
   25|      0|         break;
   26|      0|      }
   27|       |
   28|      0|      if(name[i].first > level) {
  ------------------
  |  Branch (28:10): [True: 0, False: 0]
  ------------------
   29|      0|         output += "(" + name[i].second;
   30|      0|         ++paren_depth;
   31|      0|      } else if(name[i].first < level) {
  ------------------
  |  Branch (31:17): [True: 0, False: 0]
  ------------------
   32|      0|         for(size_t j = name[i].first; j < level; j++) {
  ------------------
  |  Branch (32:40): [True: 0, False: 0]
  ------------------
   33|      0|            output += ")";
   34|      0|            --paren_depth;
   35|      0|         }
   36|      0|         output += "," + name[i].second;
   37|      0|      } else {
   38|      0|         if(output[output.size() - 1] != '(') {
  ------------------
  |  Branch (38:13): [True: 0, False: 0]
  ------------------
   39|      0|            output += ",";
   40|      0|         }
   41|      0|         output += name[i].second;
   42|      0|      }
   43|       |
   44|      0|      level = name[i].first;
   45|      0|   }
   46|       |
   47|      2|   for(size_t i = 0; i != paren_depth; ++i) {
  ------------------
  |  Branch (47:22): [True: 0, False: 2]
  ------------------
   48|      0|      output += ")";
   49|      0|   }
   50|       |
   51|      2|   return output;
   52|      2|}