_ZN5Botan11ASN1_ObjectD2Ev:
  114|   778k|      virtual ~ASN1_Object() = default;
_ZN5Botan10BER_ObjectC2Ev:
  122|   598k|      BER_Object() : m_type_tag(ASN1_Type::NoObject), m_class_tag(ASN1_Class::Universal) {}
_ZNK5Botan10BER_Object6is_setEv:
  132|   859k|      bool is_set() const { return m_type_tag != ASN1_Type::NoObject; }
_ZNK5Botan10BER_Object7taggingEv:
  134|   444k|      uint32_t tagging() const { return type_tag() | class_tag(); }
_ZNK5Botan10BER_Object8type_tagEv:
  136|   444k|      ASN1_Type type_tag() const { return m_type_tag; }
_ZNK5Botan10BER_Object9class_tagEv:
  138|   444k|      ASN1_Class class_tag() const { return m_class_tag; }
_ZNK5Botan10BER_Object4typeEv:
  140|  84.1k|      ASN1_Type type() const { return m_type_tag; }
_ZNK5Botan10BER_Object9get_classEv:
  142|    704|      ASN1_Class get_class() const { return m_class_tag; }
_ZNK5Botan10BER_Object4bitsEv:
  144|  5.01M|      const uint8_t* bits() const { return m_value.data(); }
_ZNK5Botan10BER_Object6lengthEv:
  146|  10.4M|      size_t length() const { return m_value.size(); }
_ZN5Botan10BER_Object12mutable_bitsEm:
  163|   371k|      uint8_t* mutable_bits(size_t length) {
  164|   371k|         m_value.resize(length);
  165|   371k|         return m_value.data();
  166|   371k|      }
_ZN5Botan3OIDC2Ev:
  212|  78.4k|      explicit OID() {}
_ZN5Botan3OIDC2ESt16initializer_listIjE:
  223|  1.24k|      explicit OID(std::initializer_list<uint32_t> init) : m_id(init) {
  224|  1.24k|         BOTAN_ARG_CHECK(m_id.size() > 2 && m_id[0] <= 2 && (m_id[0] != 2 || m_id[1] <= 39), "Invalid OID");
  ------------------
  |  |   30|  1.24k|   do {                                                          \
  |  |   31|  6.34k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:12): [True: 1.24k, False: 0]
  |  |  |  Branch (31:12): [True: 1.24k, False: 0]
  |  |  |  Branch (31:12): [True: 1.14k, False: 103]
  |  |  |  Branch (31:12): [True: 103, False: 0]
  |  |  ------------------
  |  |   32|  1.24k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  1.24k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  225|  1.24k|      }
_ZNK5Botan3OID5emptyEv:
  259|    581|      bool empty() const { return m_id.empty(); }
_ZNK5Botan3OID9has_valueEv:
  265|    576|      bool has_value() const { return (m_id.empty() == false); }
_ZNK5Botan3OID14get_componentsEv:
  271|   403k|      const std::vector<uint32_t>& get_components() const { return m_id; }
_ZNK5Botan3OIDeqERKS0_:
  303|   177k|      bool operator==(const OID& other) const { return m_id == other.m_id; }
_ZNK5Botan11ASN1_String5valueEv:
  407|  41.0k|      const std::string& value() const { return m_utf8_str; }
_ZNK5Botan11ASN1_String4sizeEv:
  409|  1.27k|      size_t size() const { return value().size(); }
_ZNK5Botan11ASN1_String5emptyEv:
  411|  34.8k|      bool empty() const { return m_utf8_str.empty(); }
_ZNK5Botan19AlgorithmIdentifier3oidEv:
  447|  19.3k|      const OID& oid() const { return m_oid; }
_ZNK5Botan19AlgorithmIdentifier10parametersEv:
  449|  5.78k|      const std::vector<uint8_t>& parameters() const { return m_parameters; }
_ZNK5Botan19AlgorithmIdentifier20parameters_are_emptyEv:
  461|  9.87k|      bool parameters_are_empty() const { return m_parameters.empty(); }
_ZNK5Botan19AlgorithmIdentifier28parameters_are_null_or_emptyEv:
  463|  9.32k|      bool parameters_are_null_or_empty() const { return parameters_are_empty() || parameters_are_null(); }
  ------------------
  |  Branch (463:58): [True: 3.86k, False: 5.46k]
  |  Branch (463:84): [True: 5.24k, False: 220]
  ------------------
_ZN5BotanorENS_10ASN1_ClassES0_:
   76|   206k|inline ASN1_Class operator|(ASN1_Class x, ASN1_Class y) {
   77|   206k|   return static_cast<ASN1_Class>(static_cast<uint32_t>(x) | static_cast<uint32_t>(y));
   78|   206k|}
_ZN5BotanorENS_9ASN1_TypeENS_10ASN1_ClassE:
   80|   444k|inline uint32_t operator|(ASN1_Type x, ASN1_Class y) { return static_cast<uint32_t>(x) | static_cast<uint32_t>(y); }
_ZN5BotanorENS_10ASN1_ClassENS_9ASN1_TypeE:
   82|  72.8k|inline uint32_t operator|(ASN1_Class x, ASN1_Type y) { return static_cast<uint32_t>(x) | static_cast<uint32_t>(y); }
_ZN5BotanneERKNS_3OIDES2_:
  320|  20.6k|inline bool operator!=(const OID& a, const OID& b) { return !(a == b); }
_ZN5Botan11ASN1_ObjectC2ERKS0_:
  112|   386k|      ASN1_Object(const ASN1_Object&) = default;
_ZN5Botan11ASN1_ObjectaSERKS0_:
  113|    347|      ASN1_Object& operator=(const ASN1_Object&) = default;
_ZN5Botan11ASN1_ObjectC2Ev:
  111|   392k|      ASN1_Object() = default;
_ZN5Botan19AlgorithmIdentifierC2Ev:
  439|  24.2k|      AlgorithmIdentifier() = default;
_ZN5Botan9ASN1_TimeC2Ev:
  354|  11.4k|      ASN1_Time() = default;
_ZN5Botan10BER_ObjectaSEOS0_:
  130|  86.3k|      BER_Object& operator=(BER_Object&& other) = default;
_ZN5Botan10BER_ObjectC2EOS0_:
  128|   177k|      BER_Object(BER_Object&& other) = default;
_ZN5Botan10BER_ObjectaSERKS0_:
  126|    510|      BER_Object& operator=(const BER_Object& other) = default;

_ZN5Botan12ignore_paramIRmEEvOT_:
  111|  12.8M|void ignore_param(T&&) {}
_ZN5Botan13ignore_paramsIJRhEEEvDpOT_:
  114|  35.2k|void ignore_params(T&&... args) {
  115|  35.2k|   (ignore_param(args), ...);
  116|  35.2k|}
_ZN5Botan12ignore_paramIRhEEvOT_:
  111|  35.2k|void ignore_param(T&&) {}
_ZN5Botan13ignore_paramsIJRmEEEvDpOT_:
  114|  12.8M|void ignore_params(T&&... args) {
  115|  12.8M|   (ignore_param(args), ...);
  116|  12.8M|}
_ZN5Botan13ignore_paramsIJRKmEEEvDpOT_:
  114|   306k|void ignore_params(T&&... args) {
  115|   306k|   (ignore_param(args), ...);
  116|   306k|}
_ZN5Botan12ignore_paramIRKmEEvOT_:
  111|  1.74M|void ignore_param(T&&) {}
_ZN5Botan13ignore_paramsIJRKmS2_EEEvDpOT_:
  114|   720k|void ignore_params(T&&... args) {
  115|   720k|   (ignore_param(args), ...);
  116|   720k|}
_ZN5Botan13ignore_paramsIJRPKmRmEEEvDpOT_:
  114|    846|void ignore_params(T&&... args) {
  115|    846|   (ignore_param(args), ...);
  116|    846|}
_ZN5Botan12ignore_paramIRPKmEEvOT_:
  111|    846|void ignore_param(T&&) {}
_ZN5Botan13ignore_paramsIJRNSt3__16vectorImNS_16secure_allocatorImEEEEEEEvDpOT_:
  114|  1.44M|void ignore_params(T&&... args) {
  115|  1.44M|   (ignore_param(args), ...);
  116|  1.44M|}
_ZN5Botan12ignore_paramIRNSt3__16vectorImNS_16secure_allocatorImEEEEEEvOT_:
  111|  1.44M|void ignore_param(T&&) {}
_ZN5Botan13ignore_paramsIJRlEEEvDpOT_:
  114|  1.38M|void ignore_params(T&&... args) {
  115|  1.38M|   (ignore_param(args), ...);
  116|  1.38M|}
_ZN5Botan12ignore_paramIRlEEvOT_:
  111|  1.38M|void ignore_param(T&&) {}

_ZN5Botan11BER_Decoder15decode_optionalImEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS3_:
  313|  6.63k|BER_Decoder& BER_Decoder::decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value) {
  314|  6.63k|   BER_Object obj = get_next_object();
  315|       |
  316|  6.63k|   if(obj.is_a(type_tag, class_tag)) {
  ------------------
  |  Branch (316:7): [True: 4.33k, False: 2.29k]
  ------------------
  317|  4.33k|      if(class_tag == ASN1_Class::ExplicitContextSpecific) {
  ------------------
  |  Branch (317:10): [True: 4.26k, False: 73]
  ------------------
  318|  4.26k|         BER_Decoder(std::move(obj)).decode(out).verify_end();
  319|  4.26k|      } else {
  320|     73|         push_back(std::move(obj));
  321|     73|         decode(out, type_tag, class_tag);
  322|     73|      }
  323|  4.33k|   } else {
  324|  2.29k|      out = default_value;
  325|  2.29k|      push_back(std::move(obj));
  326|  2.29k|   }
  327|       |
  328|  6.63k|   return (*this);
  329|  6.63k|}
_ZN5Botan11BER_Decoder6decodeERm:
  178|  4.33k|      BER_Decoder& decode(size_t& out) { return decode(out, ASN1_Type::Integer, ASN1_Class::Universal); }
_ZN5Botan11BER_DecoderC2EONS_10BER_ObjectE:
   56|  4.26k|      BER_Decoder(BER_Object&& obj) : BER_Decoder(std::move(obj), nullptr) {}
_ZN5Botan11BER_DecoderC2ENSt3__14spanIKhLm18446744073709551615EEE:
   31|  1.64k|      BER_Decoder(std::span<const uint8_t> buf) : BER_Decoder(buf.data(), buf.size()) {}
_ZN5Botan11BER_DecoderC2ERKNS_10BER_ObjectE:
   51|  6.23k|      BER_Decoder(const BER_Object& obj) : BER_Decoder(obj.bits(), obj.length()) {}
_ZN5Botan11BER_Decoder8get_nextERNS_10BER_ObjectE:
   68|  9.64k|      BER_Decoder& get_next(BER_Object& ber) {
   69|  9.64k|         ber = get_next_object();
   70|  9.64k|         return (*this);
   71|  9.64k|      }
_ZN5Botan11BER_Decoder14start_sequenceEv:
  112|   113k|      BER_Decoder start_sequence() { return start_cons(ASN1_Type::Sequence, ASN1_Class::Universal); }
_ZN5Botan11BER_Decoder9start_setEv:
  114|  35.2k|      BER_Decoder start_set() { return start_cons(ASN1_Type::Set, ASN1_Class::Universal); }
_ZN5Botan11BER_Decoder22start_context_specificEj:
  116|    557|      BER_Decoder start_context_specific(uint32_t tag) {
  117|    557|         return start_cons(ASN1_Type(tag), ASN1_Class::ContextSpecific);
  118|    557|      }
_ZN5Botan11BER_Decoder6decodeERNS_6BigIntE:
  183|  9.91k|      BER_Decoder& decode(BigInt& out) { return decode(out, ASN1_Type::Integer, ASN1_Class::Universal); }
_ZN5Botan11BER_Decoder6decodeINSt3__19allocatorIhEEEERS0_RNS2_6vectorIhT_EENS_9ASN1_TypeE:
  195|  29.0k|      BER_Decoder& decode(std::vector<uint8_t, Alloc>& out, ASN1_Type real_type) {
  196|  29.0k|         return decode(out, real_type, real_type, ASN1_Class::Universal);
  197|  29.0k|      }
_ZN5Botan11BER_Decoder9raw_bytesINSt3__19allocatorIhEEEERS0_RNS2_6vectorIhT_EE:
  160|  36.5k|      BER_Decoder& raw_bytes(std::vector<uint8_t, Alloc>& out) {
  161|  36.5k|         out.clear();
  162|  36.5k|         uint8_t buf;
  163|  3.90M|         while(m_source->read_byte(buf))
  ------------------
  |  Branch (163:16): [True: 3.87M, False: 36.5k]
  ------------------
  164|  3.87M|            out.push_back(buf);
  165|  36.5k|         return (*this);
  166|  36.5k|      }
_ZN5Botan11BER_Decoder15decode_optionalIbEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS3_:
  313|  15.1k|BER_Decoder& BER_Decoder::decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value) {
  314|  15.1k|   BER_Object obj = get_next_object();
  315|       |
  316|  15.1k|   if(obj.is_a(type_tag, class_tag)) {
  ------------------
  |  Branch (316:7): [True: 2.50k, False: 12.6k]
  ------------------
  317|  2.50k|      if(class_tag == ASN1_Class::ExplicitContextSpecific) {
  ------------------
  |  Branch (317:10): [True: 0, False: 2.50k]
  ------------------
  318|      0|         BER_Decoder(std::move(obj)).decode(out).verify_end();
  319|  2.50k|      } else {
  320|  2.50k|         push_back(std::move(obj));
  321|  2.50k|         decode(out, type_tag, class_tag);
  322|  2.50k|      }
  323|  12.6k|   } else {
  324|  12.6k|      out = default_value;
  325|  12.6k|      push_back(std::move(obj));
  326|  12.6k|   }
  327|       |
  328|  15.1k|   return (*this);
  329|  15.1k|}
_ZN5Botan11BER_Decoder22decode_optional_stringINSt3__19allocatorIhEEEERS0_RNS2_6vectorIhT_EENS_9ASN1_TypeEjNS_10ASN1_ClassE:
  271|  10.0k|                                          ASN1_Class class_tag = ASN1_Class::ContextSpecific) {
  272|  10.0k|         BER_Object obj = get_next_object();
  273|       |
  274|  10.0k|         ASN1_Type type_tag = static_cast<ASN1_Type>(expected_tag);
  275|       |
  276|  10.0k|         if(obj.is_a(type_tag, class_tag)) {
  ------------------
  |  Branch (276:13): [True: 318, False: 9.71k]
  ------------------
  277|    318|            if(class_tag == ASN1_Class::ExplicitContextSpecific) {
  ------------------
  |  Branch (277:16): [True: 0, False: 318]
  ------------------
  278|      0|               BER_Decoder(std::move(obj)).decode(out, real_type).verify_end();
  279|    318|            } else {
  280|    318|               push_back(std::move(obj));
  281|    318|               decode(out, real_type, type_tag, class_tag);
  282|    318|            }
  283|  9.71k|         } else {
  284|  9.71k|            out.clear();
  285|  9.71k|            push_back(std::move(obj));
  286|  9.71k|         }
  287|       |
  288|  10.0k|         return (*this);
  289|  10.0k|      }
_ZN5Botan11BER_Decoder11decode_listINS_3OIDEEERS0_RNSt3__16vectorIT_NS4_9allocatorIS6_EEEENS_9ASN1_TypeENS_10ASN1_ClassE:
  360|    626|BER_Decoder& BER_Decoder::decode_list(std::vector<T>& vec, ASN1_Type type_tag, ASN1_Class class_tag) {
  361|    626|   BER_Decoder list = start_cons(type_tag, class_tag);
  362|       |
  363|  1.71k|   while(list.more_items()) {
  ------------------
  |  Branch (363:10): [True: 1.08k, False: 626]
  ------------------
  364|  1.08k|      T value;
  365|  1.08k|      list.decode(value);
  366|  1.08k|      vec.push_back(std::move(value));
  367|  1.08k|   }
  368|       |
  369|    626|   list.end_cons();
  370|       |
  371|    626|   return (*this);
  372|    626|}
_ZN5Botan11BER_Decoder11decode_listINS_14GeneralSubtreeEEERS0_RNSt3__16vectorIT_NS4_9allocatorIS6_EEEENS_9ASN1_TypeENS_10ASN1_ClassE:
  360|    321|BER_Decoder& BER_Decoder::decode_list(std::vector<T>& vec, ASN1_Type type_tag, ASN1_Class class_tag) {
  361|    321|   BER_Decoder list = start_cons(type_tag, class_tag);
  362|       |
  363|    832|   while(list.more_items()) {
  ------------------
  |  Branch (363:10): [True: 511, False: 321]
  ------------------
  364|    511|      T value;
  365|    511|      list.decode(value);
  366|    511|      vec.push_back(std::move(value));
  367|    511|   }
  368|       |
  369|    321|   list.end_cons();
  370|       |
  371|    321|   return (*this);
  372|    321|}
x509_ext.cpp:_ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension12_GLOBAL__N_118Policy_InformationEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE:
  360|    361|BER_Decoder& BER_Decoder::decode_list(std::vector<T>& vec, ASN1_Type type_tag, ASN1_Class class_tag) {
  361|    361|   BER_Decoder list = start_cons(type_tag, class_tag);
  362|       |
  363|    659|   while(list.more_items()) {
  ------------------
  |  Branch (363:10): [True: 298, False: 361]
  ------------------
  364|    298|      T value;
  365|    298|      list.decode(value);
  366|    298|      vec.push_back(std::move(value));
  367|    298|   }
  368|       |
  369|    361|   list.end_cons();
  370|       |
  371|    361|   return (*this);
  372|    361|}
_ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension23CRL_Distribution_Points18Distribution_PointEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE:
  360|    712|BER_Decoder& BER_Decoder::decode_list(std::vector<T>& vec, ASN1_Type type_tag, ASN1_Class class_tag) {
  361|    712|   BER_Decoder list = start_cons(type_tag, class_tag);
  362|       |
  363|  1.26k|   while(list.more_items()) {
  ------------------
  |  Branch (363:10): [True: 555, False: 712]
  ------------------
  364|    555|      T value;
  365|    555|      list.decode(value);
  366|    555|      vec.push_back(std::move(value));
  367|    555|   }
  368|       |
  369|    712|   list.end_cons();
  370|       |
  371|    712|   return (*this);
  372|    712|}
_ZN5Botan11BER_Decoder24decode_optional_implicitINS_15AlternativeNameEEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassES6_S7_RKS4_:
  340|    443|                                                   const T& default_value) {
  341|    443|   BER_Object obj = get_next_object();
  342|       |
  343|    443|   if(obj.is_a(type_tag, class_tag)) {
  ------------------
  |  Branch (343:7): [True: 336, False: 107]
  ------------------
  344|    336|      obj.set_tagging(real_type, real_class);
  345|    336|      push_back(std::move(obj));
  346|    336|      decode(out, real_type, real_class);
  347|    336|   } else {
  348|       |      // Not what we wanted, push it back on the stream
  349|    107|      out = default_value;
  350|    107|      push_back(std::move(obj));
  351|    107|   }
  352|       |
  353|    443|   return (*this);
  354|    443|}
_ZN5Botan11BER_Decoder16decode_and_checkImEERS0_RKT_NSt3__117basic_string_viewIcNS6_11char_traitsIcEEEE:
  254|      4|      BER_Decoder& decode_and_check(const T& expected, std::string_view error_msg) {
  255|      4|         T actual;
  256|      4|         decode(actual);
  257|       |
  258|      4|         if(actual != expected)
  ------------------
  |  Branch (258:13): [True: 3, False: 1]
  ------------------
  259|      3|            throw Decoding_Error(error_msg);
  260|       |
  261|      1|         return (*this);
  262|      4|      }

_ZN5Botan6BigIntD2Ev:
  147|  1.15M|      ~BigInt() { const_time_unpoison(); }
_ZNK5Botan6BigInt19const_time_unpoisonEv:
  710|  1.15M|      void const_time_unpoison() const {}
_ZN5Botan6BigInt4zeroEv:
   44|  64.6k|      static BigInt zero() { return BigInt(); }
_ZN5Botan6BigIntC2EOS0_:
  145|  82.4k|      BigInt(BigInt&& other) { this->swap(other); }
_ZN5Botan6BigIntaSEOS0_:
  152|   194k|      BigInt& operator=(BigInt&& other) {
  153|   194k|         if(this != &other)
  ------------------
  |  Branch (153:13): [True: 194k, False: 0]
  ------------------
  154|   194k|            this->swap(other);
  155|       |
  156|   194k|         return (*this);
  157|   194k|      }
_ZN5Botan6BigInt4swapERS0_:
  168|   900k|      void swap(BigInt& other) {
  169|   900k|         m_data.swap(other.m_data);
  170|   900k|         std::swap(m_signedness, other.m_signedness);
  171|   900k|      }
_ZN5Botan6BigInt8swap_regERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  173|   549k|      void swap_reg(secure_vector<word>& reg) {
  174|   549k|         m_data.swap(reg);
  175|       |         // sign left unchanged
  176|   549k|      }
_ZN5Botan6BigIntpLERKS0_:
  182|  76.4k|      BigInt& operator+=(const BigInt& y) { return add(y.data(), y.sig_words(), y.sign()); }
_ZN5Botan6BigIntmIERKS0_:
  194|  74.1k|      BigInt& operator-=(const BigInt& y) { return sub(y.data(), y.sig_words(), y.sign()); }
_ZN5Botan6BigInt3subEPKmmNS0_4SignE:
  288|  74.1k|      BigInt& sub(const word y[], size_t y_words, Sign sign) {
  289|  74.1k|         return add(y, y_words, sign == Positive ? Negative : Positive);
  ------------------
  |  Branch (289:33): [True: 74.1k, False: 0]
  ------------------
  290|  74.1k|      }
_ZN5Botan6BigInt5clearEv:
  366|  19.2k|      void clear() {
  367|  19.2k|         m_data.set_to_zero();
  368|  19.2k|         m_signedness = Positive;
  369|  19.2k|      }
_ZNK5Botan6BigInt7is_evenEv:
  406|  7.04k|      bool is_even() const { return (get_bit(0) == 0); }
_ZNK5Botan6BigInt6is_oddEv:
  412|  1.60k|      bool is_odd() const { return (get_bit(0) == 1); }
_ZNK5Botan6BigInt10is_nonzeroEv:
  418|  8.24k|      bool is_nonzero() const { return (!is_zero()); }
_ZNK5Botan6BigInt7is_zeroEv:
  424|   568k|      bool is_zero() const { return (sig_words() == 0); }
_ZN5Botan6BigInt7set_bitEm:
  430|  4.68k|      void set_bit(size_t n) { conditionally_set_bit(n, true); }
_ZN5Botan6BigInt21conditionally_set_bitEmb:
  440|  15.8M|      void conditionally_set_bit(size_t n, bool set_it) {
  441|  15.8M|         const size_t which = n / BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|  15.8M|#define BOTAN_MP_WORD_BITS 64
  ------------------
  442|  15.8M|         const word mask = static_cast<word>(set_it) << (n % BOTAN_MP_WORD_BITS);
  ------------------
  |  |   50|  15.8M|#define BOTAN_MP_WORD_BITS 64
  ------------------
  443|  15.8M|         m_data.set_word_at(which, word_at(which) | mask);
  444|  15.8M|      }
_ZN5Botan6BigInt9mask_bitsEm:
  456|  1.45M|      void mask_bits(size_t n) { m_data.mask_bits(n); }
_ZNK5Botan6BigInt7get_bitEm:
  463|  13.3M|      bool get_bit(size_t n) const { return ((word_at(n / BOTAN_MP_WORD_BITS) >> (n % BOTAN_MP_WORD_BITS)) & 1); }
  ------------------
  |  |   50|  13.3M|#define BOTAN_MP_WORD_BITS 64
  ------------------
                    bool get_bit(size_t n) const { return ((word_at(n / BOTAN_MP_WORD_BITS) >> (n % BOTAN_MP_WORD_BITS)) & 1); }
  ------------------
  |  |   50|  13.3M|#define BOTAN_MP_WORD_BITS 64
  ------------------
_ZNK5Botan6BigInt7word_atEm:
  514|  31.0M|      word word_at(size_t n) const { return m_data.get_word_at(n); }
_ZN5Botan6BigInt11set_word_atEmm:
  516|  2.79M|      void set_word_at(size_t i, word w) { m_data.set_word_at(i, w); }
_ZN5Botan6BigInt9set_wordsEPKmm:
  518|  81.5k|      void set_words(const word w[], size_t len) { m_data.set_words(w, len); }
_ZNK5Botan6BigInt11is_negativeEv:
  524|  4.83M|      bool is_negative() const { return (sign() == Negative); }
_ZNK5Botan6BigInt11is_positiveEv:
  530|   360k|      bool is_positive() const { return (sign() == Positive); }
_ZNK5Botan6BigInt4signEv:
  536|  6.30M|      Sign sign() const { return (m_signedness); }
_ZNK5Botan6BigInt12reverse_signEv:
  541|  40.4k|      Sign reverse_sign() const {
  542|  40.4k|         if(sign() == Positive)
  ------------------
  |  Branch (542:13): [True: 40.4k, False: 0]
  ------------------
  543|  40.4k|            return Negative;
  544|      0|         return Positive;
  545|  40.4k|      }
_ZN5Botan6BigInt9flip_signEv:
  550|  1.16k|      void flip_sign() { set_sign(reverse_sign()); }
_ZN5Botan6BigInt8set_signENS0_4SignE:
  556|   435k|      void set_sign(Sign sign) {
  557|   435k|         if(sign == Negative && is_zero())
  ------------------
  |  Branch (557:13): [True: 1.27k, False: 434k]
  |  Branch (557:33): [True: 0, False: 1.27k]
  ------------------
  558|      0|            sign = Positive;
  559|       |
  560|   435k|         m_signedness = sign;
  561|   435k|      }
_ZNK5Botan6BigInt4sizeEv:
  572|  23.1M|      size_t size() const { return m_data.size(); }
_ZNK5Botan6BigInt9sig_wordsEv:
  578|  3.84M|      size_t sig_words() const { return m_data.sig_words(); }
_ZN5Botan6BigInt12mutable_dataEv:
  603|  17.5M|      word* mutable_data() { return m_data.mutable_data(); }
_ZNK5Botan6BigInt4dataEv:
  609|  12.8M|      const word* data() const { return m_data.const_data(); }
_ZN5Botan6BigInt15get_word_vectorEv:
  614|   259k|      secure_vector<word>& get_word_vector() { return m_data.mutable_vector(); }
_ZNK5Botan6BigInt7grow_toEm:
  625|  8.73M|      void grow_to(size_t n) const { m_data.grow_to(n); }
_ZN5Botan6BigInt10power_of_2Em:
  726|  2.33k|      static BigInt power_of_2(size_t n) {
  727|  2.33k|         BigInt b;
  728|  2.33k|         b.set_bit(n);
  729|  2.33k|         return b;
  730|  2.33k|      }
_ZN5Botan6BigInt6encodeERKS0_:
  737|  5.78k|      static std::vector<uint8_t> encode(const BigInt& n) {
  738|  5.78k|         std::vector<uint8_t> output(n.bytes());
  739|  5.78k|         n.binary_encode(output.data());
  740|  5.78k|         return output;
  741|  5.78k|      }
_ZN5Botan6BigInt6decodeEPKhm:
  760|  1.48k|      static BigInt decode(const uint8_t buf[], size_t length) { return BigInt(buf, length); }
_ZN5Botan6BigInt4Data12mutable_dataEv:
  816|  17.8M|            word* mutable_data() {
  817|  17.8M|               invalidate_sig_words();
  818|  17.8M|               return m_reg.data();
  819|  17.8M|            }
_ZNK5Botan6BigInt4Data10const_dataEv:
  821|  12.8M|            const word* const_data() const { return m_reg.data(); }
_ZN5Botan6BigInt4Data14mutable_vectorEv:
  823|   259k|            secure_vector<word>& mutable_vector() {
  824|   259k|               invalidate_sig_words();
  825|   259k|               return m_reg;
  826|   259k|            }
_ZNK5Botan6BigInt4Data11get_word_atEm:
  830|  31.0M|            word get_word_at(size_t n) const {
  831|  31.0M|               if(n < m_reg.size())
  ------------------
  |  Branch (831:19): [True: 31.0M, False: 5.76k]
  ------------------
  832|  31.0M|                  return m_reg[n];
  833|  5.76k|               return 0;
  834|  31.0M|            }
_ZN5Botan6BigInt4Data11set_word_atEmm:
  836|  18.6M|            void set_word_at(size_t i, word w) {
  837|  18.6M|               invalidate_sig_words();
  838|  18.6M|               if(i >= m_reg.size()) {
  ------------------
  |  Branch (838:19): [True: 2.79M, False: 15.8M]
  ------------------
  839|  2.79M|                  if(w == 0)
  ------------------
  |  Branch (839:22): [True: 2.76M, False: 26.5k]
  ------------------
  840|  2.76M|                     return;
  841|  26.5k|                  grow_to(i + 1);
  842|  26.5k|               }
  843|  15.8M|               m_reg[i] = w;
  844|  15.8M|            }
_ZN5Botan6BigInt4Data9set_wordsEPKmm:
  846|  81.5k|            void set_words(const word w[], size_t len) {
  847|  81.5k|               invalidate_sig_words();
  848|  81.5k|               m_reg.assign(w, w + len);
  849|  81.5k|            }
_ZN5Botan6BigInt4Data11set_to_zeroEv:
  851|  19.2k|            void set_to_zero() {
  852|  19.2k|               m_reg.resize(m_reg.capacity());
  853|  19.2k|               clear_mem(m_reg.data(), m_reg.size());
  854|  19.2k|               m_sig_words = 0;
  855|  19.2k|            }
_ZN5Botan6BigInt4Data9mask_bitsEm:
  863|  1.45M|            void mask_bits(size_t n) {
  864|  1.45M|               if(n == 0) {
  ------------------
  |  Branch (864:19): [True: 0, False: 1.45M]
  ------------------
  865|      0|                  return set_to_zero();
  866|      0|               }
  867|       |
  868|  1.45M|               const size_t top_word = n / BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|  1.45M|#define BOTAN_MP_WORD_BITS 64
  ------------------
  869|       |
  870|       |               // if(top_word < sig_words()) ?
  871|  1.45M|               if(top_word < size()) {
  ------------------
  |  Branch (871:19): [True: 1.45M, False: 78]
  ------------------
  872|  1.45M|                  const word mask = (static_cast<word>(1) << (n % BOTAN_MP_WORD_BITS)) - 1;
  ------------------
  |  |   50|  1.45M|#define BOTAN_MP_WORD_BITS 64
  ------------------
  873|  1.45M|                  const size_t len = size() - (top_word + 1);
  874|  1.45M|                  if(len > 0) {
  ------------------
  |  Branch (874:22): [True: 1.45M, False: 0]
  ------------------
  875|  1.45M|                     clear_mem(&m_reg[top_word + 1], len);
  876|  1.45M|                  }
  877|  1.45M|                  m_reg[top_word] &= mask;
  878|  1.45M|                  invalidate_sig_words();
  879|  1.45M|               }
  880|  1.45M|            }
_ZNK5Botan6BigInt4Data7grow_toEm:
  882|  8.89M|            void grow_to(size_t n) const {
  883|  8.89M|               if(n > size()) {
  ------------------
  |  Branch (883:19): [True: 641k, False: 8.25M]
  ------------------
  884|   641k|                  if(n <= m_reg.capacity())
  ------------------
  |  Branch (884:22): [True: 92.9k, False: 548k]
  ------------------
  885|  92.9k|                     m_reg.resize(n);
  886|   548k|                  else
  887|   548k|                     m_reg.resize(n + (8 - (n % 8)));
  888|   641k|               }
  889|  8.89M|            }
_ZNK5Botan6BigInt4Data4sizeEv:
  891|  35.2M|            size_t size() const { return m_reg.size(); }
_ZN5Botan6BigInt4Data4swapERS1_:
  900|   900k|            void swap(Data& other) {
  901|   900k|               m_reg.swap(other.m_reg);
  902|   900k|               std::swap(m_sig_words, other.m_sig_words);
  903|   900k|            }
_ZN5Botan6BigInt4Data4swapERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  905|   567k|            void swap(secure_vector<word>& reg) {
  906|   567k|               m_reg.swap(reg);
  907|   567k|               invalidate_sig_words();
  908|   567k|            }
_ZNK5Botan6BigInt4Data20invalidate_sig_wordsEv:
  910|  38.8M|            void invalidate_sig_words() const { m_sig_words = sig_words_npos; }
_ZNK5Botan6BigInt4Data9sig_wordsEv:
  912|  3.84M|            size_t sig_words() const {
  913|  3.84M|               if(m_sig_words == sig_words_npos) {
  ------------------
  |  Branch (913:19): [True: 1.19M, False: 2.64M]
  ------------------
  914|  1.19M|                  m_sig_words = calc_sig_words();
  915|  2.64M|               } else {
  916|  2.64M|                  BOTAN_DEBUG_ASSERT(m_sig_words == calc_sig_words());
  ------------------
  |  |   99|  2.64M|      do {                          \
  |  |  100|  2.64M|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  917|  2.64M|               }
  918|  3.84M|               return m_sig_words;
  919|  3.84M|            }
_ZN5BotanplERKNS_6BigIntES2_:
  937|  6.78k|inline BigInt operator+(const BigInt& x, const BigInt& y) { return BigInt::add2(x, y.data(), y.sig_words(), y.sign()); }
_ZN5BotanplERKNS_6BigIntEm:
  939|    908|inline BigInt operator+(const BigInt& x, word y) { return BigInt::add2(x, &y, 1, BigInt::Positive); }
_ZN5BotanmiERKNS_6BigIntES2_:
  943|  39.3k|inline BigInt operator-(const BigInt& x, const BigInt& y) {
  944|  39.3k|   return BigInt::add2(x, y.data(), y.sig_words(), y.reverse_sign());
  945|  39.3k|}
_ZN5BotanmiERKNS_6BigIntEm:
  947|      7|inline BigInt operator-(const BigInt& x, word y) { return BigInt::add2(x, &y, 1, BigInt::Negative); }
_ZN5BotanmlEmRKNS_6BigIntE:
  952|   148k|inline BigInt operator*(word x, const BigInt& y) { return y * x; }
_ZN5BotaneqERKNS_6BigIntES2_:
  964|  2.06k|inline bool operator==(const BigInt& a, const BigInt& b) { return a.is_equal(b); }
_ZN5BotanneERKNS_6BigIntES2_:
  966|  3.51k|inline bool operator!=(const BigInt& a, const BigInt& b) { return !a.is_equal(b); }
_ZN5BotangeERKNS_6BigIntES2_:
  970|  3.20k|inline bool operator>=(const BigInt& a, const BigInt& b) { return (a.cmp(b) >= 0); }
_ZN5BotanltERKNS_6BigIntES2_:
  972|  94.1k|inline bool operator<(const BigInt& a, const BigInt& b) { return a.is_less_than(b); }
_ZN5BotangtERKNS_6BigIntES2_:
  974|  86.2k|inline bool operator>(const BigInt& a, const BigInt& b) { return b.is_less_than(a); }
_ZN5BotaneqERKNS_6BigIntEm:
  976|  2.14k|inline bool operator==(const BigInt& a, word b) { return (a.cmp_word(b) == 0); }
_ZN5BotanleERKNS_6BigIntEm:
  980|  1.18k|inline bool operator<=(const BigInt& a, word b) { return (a.cmp_word(b) <= 0); }
_ZN5BotangeERKNS_6BigIntEm:
  982|  1.18k|inline bool operator>=(const BigInt& a, word b) { return (a.cmp_word(b) >= 0); }
_ZN5BotanltERKNS_6BigIntEm:
  984|  9.18k|inline bool operator<(const BigInt& a, word b) { return (a.cmp_word(b) < 0); }
_ZN5BotangtERKNS_6BigIntEm:
  986|  90.9k|inline bool operator>(const BigInt& a, word b) { return (a.cmp_word(b) > 0); }
_Z4swapIN5Botan6BigIntEENSt3__19enable_ifIXaasr21is_move_constructibleIT_EE5valuesr18is_move_assignableIS4_EE5valueEvE4typeERS4_S7_:
  999|  86.2k|inline void swap<Botan::BigInt>(Botan::BigInt& x, Botan::BigInt& y) {
 1000|  86.2k|   x.swap(y);
 1001|  86.2k|}
_ZN5Botan6BigIntC2Ev:
   39|   861k|      BigInt() = default;
_ZN5Botan6BigIntC2ERKS0_:
   79|   192k|      BigInt(const BigInt& other) = default;
_ZN5Botan6BigIntaSERKS0_:
  162|   352k|      BigInt& operator=(const BigInt&) = default;

_ZN5Botan20Buffered_Computation6updateEPKhm:
   34|  9.66k|      void update(const uint8_t in[], size_t length) { add_data(in, length); }
_ZN5Botan20Buffered_Computation6updateENSt3__14spanIKhLm18446744073709551615EEE:
   40|  12.0k|      void update(std::span<const uint8_t> in) { add_data(in.data(), in.size()); }
_ZN5Botan20Buffered_Computation12final_stdvecEv:
   83|  13.1k|      std::vector<uint8_t> final_stdvec() { return final<std::vector<uint8_t>>(); }
_ZN5Botan20Buffered_Computation5finalINSt3__16vectorIhNS2_9allocatorIhEEEEEET_v:
   77|  13.1k|      T final() {
   78|  13.1k|         T output(output_length());
   79|  13.1k|         final_result(output.data());
   80|  13.1k|         return output;
   81|  13.1k|      }
_ZN5Botan20Buffered_ComputationD2Ev:
  133|  17.6k|      virtual ~Buffered_Computation() = default;
_ZN5Botan20Buffered_Computation5finalINSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_v:
   77|  8.51k|      T final() {
   78|  8.51k|         T output(output_length());
   79|  8.51k|         final_result(output.data());
   80|  8.51k|         return output;
   81|  8.51k|      }
_ZN5Botan20Buffered_Computation7processINSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_PKhm:
  104|  8.00k|      T process(const uint8_t in[], size_t length) {
  105|  8.00k|         update(in, length);
  106|  8.00k|         return final<T>();
  107|  8.00k|      }

_ZN5Botan27Certificate_Store_In_MemoryC2Ev:
   97|  1.44k|      Certificate_Store_In_Memory() = default;

_ZN5Botan8CurveGFpC2Ev:
   90|  11.2k|      CurveGFp() = default;
_ZNK5Botan13CurveGFp_Repr9curve_mulERNS_6BigIntERKS1_S4_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
   60|   711k|      void curve_mul(BigInt& z, const BigInt& x, const BigInt& y, secure_vector<word>& ws) const {
   61|   711k|         BOTAN_DEBUG_ASSERT(x.sig_words() <= get_p_words());
  ------------------
  |  |   99|   711k|      do {                          \
  |  |  100|   711k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
   62|   711k|         curve_mul_words(z, x.data(), x.size(), y, ws);
   63|   711k|      }
_ZNK5Botan13CurveGFp_Repr9curve_sqrERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
   68|   671k|      void curve_sqr(BigInt& z, const BigInt& x, secure_vector<word>& ws) const {
   69|   671k|         BOTAN_DEBUG_ASSERT(x.sig_words() <= get_p_words());
  ------------------
  |  |   99|   671k|      do {                          \
  |  |  100|   671k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
   70|   671k|         curve_sqr_words(z, x.data(), x.size(), ws);
   71|   671k|      }
_ZN5Botan8CurveGFpC2ERKNS_6BigIntES3_S3_:
   98|      7|      CurveGFp(const BigInt& p, const BigInt& a, const BigInt& b) : m_repr(choose_repr(p, a, b)) {}
_ZNK5Botan8CurveGFp5get_aEv:
  107|  1.26k|      const BigInt& get_a() const { return m_repr->get_a(); }
_ZNK5Botan8CurveGFp5get_bEv:
  112|  1.26k|      const BigInt& get_b() const { return m_repr->get_b(); }
_ZNK5Botan8CurveGFp5get_pEv:
  118|   128k|      const BigInt& get_p() const { return m_repr->get_p(); }
_ZNK5Botan8CurveGFp11get_p_wordsEv:
  120|  45.4k|      size_t get_p_words() const { return m_repr->get_p_words(); }
_ZNK5Botan8CurveGFp11get_ws_sizeEv:
  122|   127k|      size_t get_ws_size() const { return m_repr->get_ws_size(); }
_ZNK5Botan8CurveGFp9get_a_repEv:
  124|  1.73k|      const BigInt& get_a_rep() const { return m_repr->get_a_rep(); }
_ZNK5Botan8CurveGFp9get_b_repEv:
  126|  3.39k|      const BigInt& get_b_rep() const { return m_repr->get_b_rep(); }
_ZNK5Botan8CurveGFp9get_1_repEv:
  128|  2.03k|      const BigInt& get_1_rep() const { return m_repr->get_1_rep(); }
_ZNK5Botan8CurveGFp12a_is_minus_3Ev:
  130|  80.8k|      bool a_is_minus_3() const { return m_repr->a_is_minus_3(); }
_ZNK5Botan8CurveGFp9a_is_zeroEv:
  132|  80.8k|      bool a_is_zero() const { return m_repr->a_is_zero(); }
_ZNK5Botan8CurveGFp6is_oneERKNS_6BigIntE:
  134|    306|      bool is_one(const BigInt& x) const { return m_repr->is_one(x); }
_ZNK5Botan8CurveGFp14invert_elementERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  136|    863|      BigInt invert_element(const BigInt& x, secure_vector<word>& ws) const { return m_repr->invert_element(x, ws); }
_ZNK5Botan8CurveGFp6to_repERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  138|  1.27k|      void to_rep(BigInt& x, secure_vector<word>& ws) const { m_repr->to_curve_rep(x, ws); }
_ZNK5Botan8CurveGFp8from_repERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  140|    306|      void from_rep(BigInt& x, secure_vector<word>& ws) const { m_repr->from_curve_rep(x, ws); }
_ZNK5Botan8CurveGFp15from_rep_to_tmpERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  142|  5.12k|      BigInt from_rep_to_tmp(const BigInt& x, secure_vector<word>& ws) const {
  143|  5.12k|         BigInt xt(x);
  144|  5.12k|         m_repr->from_curve_rep(xt, ws);
  145|  5.12k|         return xt;
  146|  5.12k|      }
_ZNK5Botan8CurveGFp3mulERNS_6BigIntERKS1_S4_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  150|   653k|      void mul(BigInt& z, const BigInt& x, const BigInt& y, secure_vector<word>& ws) const {
  151|   653k|         m_repr->curve_mul(z, x, y, ws);
  152|   653k|      }
_ZNK5Botan8CurveGFp3mulERNS_6BigIntEPKmmRKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  154|   108k|      void mul(BigInt& z, const word x_w[], size_t x_size, const BigInt& y, secure_vector<word>& ws) const {
  155|   108k|         m_repr->curve_mul_words(z, x_w, x_size, y, ws);
  156|   108k|      }
_ZNK5Botan8CurveGFp3sqrERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  158|   472k|      void sqr(BigInt& z, const BigInt& x, secure_vector<word>& ws) const { m_repr->curve_sqr(z, x, ws); }
_ZNK5Botan8CurveGFp3sqrERNS_6BigIntEPKmmRNSt3__16vectorImNS_16secure_allocatorImEEEE:
  160|  9.17k|      void sqr(BigInt& z, const word x_w[], size_t x_size, secure_vector<word>& ws) const {
  161|  9.17k|         m_repr->curve_sqr_words(z, x_w, x_size, ws);
  162|  9.17k|      }
_ZNK5Botan8CurveGFp10mul_to_tmpERKNS_6BigIntES3_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  168|  49.0k|      BigInt mul_to_tmp(const BigInt& x, const BigInt& y, secure_vector<word>& ws) const {
  169|  49.0k|         BigInt z;
  170|  49.0k|         m_repr->curve_mul(z, x, y, ws);
  171|  49.0k|         return z;
  172|  49.0k|      }
_ZNK5Botan8CurveGFp10sqr_to_tmpERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  174|  8.81k|      BigInt sqr_to_tmp(const BigInt& x, secure_vector<word>& ws) const {
  175|  8.81k|         BigInt z;
  176|  8.81k|         m_repr->curve_sqr(z, x, ws);
  177|  8.81k|         return z;
  178|  8.81k|      }
_ZN5Botan8CurveGFp4swapERS0_:
  180|  10.4k|      void swap(CurveGFp& other) { std::swap(m_repr, other.m_repr); }
_ZNK5Botan8CurveGFpeqERKS0_:
  187|  45.4k|      inline bool operator==(const CurveGFp& other) const {
  188|  45.4k|         if(m_repr.get() == other.m_repr.get())
  ------------------
  |  Branch (188:13): [True: 45.4k, False: 0]
  ------------------
  189|  45.4k|            return true;
  190|       |
  191|      0|         return (get_p() == other.get_p()) && (get_a() == other.get_a()) && (get_b() == other.get_b());
  ------------------
  |  Branch (191:17): [True: 0, False: 0]
  |  Branch (191:47): [True: 0, False: 0]
  |  Branch (191:77): [True: 0, False: 0]
  ------------------
  192|  45.4k|      }
_ZN5Botan8CurveGFpC2ERKS0_:
  100|  14.7k|      CurveGFp(const CurveGFp&) = default;
_ZN5Botan8CurveGFpaSERKS0_:
  102|  3.12k|      CurveGFp& operator=(const CurveGFp&) = default;
_ZN5Botan13CurveGFp_ReprD2Ev:
   23|      7|      virtual ~CurveGFp_Repr() = default;

_ZN5Botan17DataSource_MemoryC2EPKhm:
  118|  45.1k|      DataSource_Memory(const uint8_t in[], size_t length) : m_source(in, in + length), m_offset(0) {}
_ZN5Botan10DataSourceC2Ev:
   91|   210k|      DataSource() = default;
_ZN5Botan10DataSourceD2Ev:
   92|   210k|      virtual ~DataSource() = default;
_ZN5Botan17DataSource_MemoryC2ENSt3__16vectorIhNS_16secure_allocatorIhEEEE:
  124|  8.66k|      explicit DataSource_Memory(secure_vector<uint8_t> in) : m_source(std::move(in)), m_offset(0) {}
_ZN5Botan17DataSource_MemoryC2ERKNSt3__16vectorIhNS1_9allocatorIhEEEE:
  136|  3.62k|      explicit DataSource_Memory(const std::vector<uint8_t>& in) : m_source(in.begin(), in.end()), m_offset(0) {}

_ZN5Botan11DER_Encoder14start_sequenceEv:
   65|  28.1k|      DER_Encoder& start_sequence() { return start_cons(ASN1_Type::Sequence, ASN1_Class::Universal); }
_ZN5Botan11DER_Encoder9raw_bytesINSt3__19allocatorIhEEEERS0_RKNS2_6vectorIhT_EE:
   88|  8.02k|      DER_Encoder& raw_bytes(const std::vector<uint8_t, Alloc>& val) {
   89|  8.02k|         return raw_bytes(val.data(), val.size());
   90|  8.02k|      }
_ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassERKNSt3__16vectorIhNS3_9allocatorIhEEEE:
  159|  4.00k|      DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, const std::vector<uint8_t>& rep) {
  160|  4.00k|         return add_object(type_tag, class_tag, rep.data(), rep.size());
  161|  4.00k|      }
_ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassERKNSt3__16vectorIhNS_16secure_allocatorIhEEEE:
  163|  4.64k|      DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, const secure_vector<uint8_t>& rep) {
  164|  4.64k|         return add_object(type_tag, class_tag, rep.data(), rep.size());
  165|  4.64k|      }
_ZN5Botan11DER_Encoder12DER_SequenceC2EOS1_:
  188|  56.3k|                  m_set_contents(std::move(seq.m_set_contents)) {}
_ZN5Botan11DER_Encoder6encodeINSt3__19allocatorIhEEEERS0_RKNS2_6vectorIhT_EENS_9ASN1_TypeE:
   99|  4.00k|      DER_Encoder& encode(const std::vector<uint8_t, Alloc>& vec, ASN1_Type real_type) {
  100|  4.00k|         return encode(vec.data(), vec.size(), real_type);
  101|  4.00k|      }
_ZN5Botan11DER_Encoder12DER_SequenceC2ERKS1_:
  198|  4.01k|            DER_Sequence(const DER_Sequence& seq) = default;
_ZN5Botan11DER_Encoder11encode_listINS_6BigIntEEERS0_RKNSt3__16vectorIT_NS4_9allocatorIS6_EEEE:
  131|    327|      DER_Encoder& encode_list(const std::vector<T>& values) {
  132|    981|         for(size_t i = 0; i != values.size(); ++i)
  ------------------
  |  Branch (132:28): [True: 654, False: 327]
  ------------------
  133|    654|            encode(values[i]);
  134|    327|         return (*this);
  135|    327|      }

_ZN5Botan8DL_GroupC2INSt3__19allocatorIhEEEERKNS2_6vectorIhT_EENS_15DL_Group_FormatE:
  124|      6|            DL_Group(ber.data(), ber.size(), format) {}

_ZNK5Botan8EC_Group6OS2ECPENSt3__14spanIKhLm18446744073709551615EEE:
  337|  1.29k|      EC_Point OS2ECP(std::span<const uint8_t> encoded_point) const {
  338|  1.29k|         return this->OS2ECP(encoded_point.data(), encoded_point.size());
  339|  1.29k|      }
_ZN5Botan8EC_GroupC2ERKS0_:
  105|    550|      EC_Group(const EC_Group&) = default;
_ZN5Botan8EC_GroupC2INSt3__19allocatorIhEEEERKNS2_6vectorIhT_EE:
   78|  1.32k|      EC_Group(const std::vector<uint8_t, Alloc>& ber) : EC_Group(ber.data(), ber.size()) {}

_ZN5Botan8EC_PointC2Ev:
   42|  5.47k|      EC_Point() = default;
_ZN5Botan8EC_PointC2EOS0_:
   58|  5.81k|      EC_Point(EC_Point&& other) { this->swap(other); }
_ZN5Botan8EC_PointaSEOS0_:
   68|  3.90k|      EC_Point& operator=(EC_Point&& other) {
   69|  3.90k|         if(this != &other)
  ------------------
  |  Branch (69:13): [True: 3.90k, False: 0]
  ------------------
   70|  3.90k|            this->swap(other);
   71|  3.90k|         return (*this);
   72|  3.90k|      }
_ZNK5Botan8EC_Point5get_xEv:
  137|  5.46k|      const BigInt& get_x() const { return m_coord_x; }
_ZNK5Botan8EC_Point5get_yEv:
  144|  5.46k|      const BigInt& get_y() const { return m_coord_y; }
_ZNK5Botan8EC_Point7is_zeroEv:
  175|   150k|      bool is_zero() const { return m_coord_z.is_zero(); }
_ZN5Botan8EC_Point3addERKS0_RNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE:
  212|  9.17k|      void add(const EC_Point& other, std::vector<BigInt>& workspace) {
  213|  9.17k|         BOTAN_ARG_CHECK(m_curve == other.m_curve, "cannot add points on different curves");
  ------------------
  |  |   30|  9.17k|   do {                                                          \
  |  |   31|  9.17k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 0, False: 9.17k]
  |  |  ------------------
  |  |   32|  9.17k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  9.17k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  214|       |
  215|  9.17k|         const size_t p_words = m_curve.get_p_words();
  216|       |
  217|  9.17k|         add(other.m_coord_x.data(),
  218|  9.17k|             std::min(p_words, other.m_coord_x.size()),
  219|  9.17k|             other.m_coord_y.data(),
  220|  9.17k|             std::min(p_words, other.m_coord_y.size()),
  221|  9.17k|             other.m_coord_z.data(),
  222|  9.17k|             std::min(p_words, other.m_coord_z.size()),
  223|  9.17k|             workspace);
  224|  9.17k|      }
_ZN5Botan8EC_Point10add_affineERKS0_RNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE:
  250|  36.2k|      void add_affine(const EC_Point& other, std::vector<BigInt>& workspace) {
  251|  36.2k|         BOTAN_ASSERT_NOMSG(m_curve == other.m_curve);
  ------------------
  |  |   60|  36.2k|   do {                                                                     \
  |  |   61|  36.2k|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 36.2k]
  |  |  ------------------
  |  |   62|  36.2k|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|  36.2k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  252|  36.2k|         BOTAN_DEBUG_ASSERT(other.is_affine());
  ------------------
  |  |   99|  36.2k|      do {                          \
  |  |  100|  36.2k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  253|       |
  254|  36.2k|         const size_t p_words = m_curve.get_p_words();
  255|  36.2k|         add_affine(other.m_coord_x.data(),
  256|  36.2k|                    std::min(p_words, other.m_coord_x.size()),
  257|  36.2k|                    other.m_coord_y.data(),
  258|  36.2k|                    std::min(p_words, other.m_coord_y.size()),
  259|  36.2k|                    workspace);
  260|  36.2k|      }
_ZNK5Botan8EC_Point4plusERKS0_RNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE:
  293|  9.17k|      EC_Point plus(const EC_Point& other, std::vector<BigInt>& workspace) const {
  294|  9.17k|         EC_Point x = (*this);
  295|  9.17k|         x.add(other, workspace);
  296|  9.17k|         return x;
  297|  9.17k|      }
_ZNK5Botan8EC_Point4zeroEv:
  313|    306|      EC_Point zero() const { return EC_Point(m_curve); }
_ZNK5Botan8EC_Point9get_curveEv:
  321|     14|      const CurveGFp& get_curve() const { return m_curve; }
_ZN5Botan8EC_PointC2ERKS0_:
   53|  13.5k|      EC_Point(const EC_Point&) = default;
_ZN5Botan8EC_PointaSERKS0_:
   63|  3.12k|      EC_Point& operator=(const EC_Point&) = default;

_ZN5Botan12EC_PublicKeyD2Ev:
   32|    560|      virtual ~EC_PublicKey() = default;
_ZNK5Botan12EC_PublicKey12public_pointEv:
   40|    550|      const EC_Point& public_point() const { return m_public_key; }
_ZNK5Botan12EC_PublicKey6domainEv:
   54|  2.39k|      const EC_Group& domain() const { return m_domain_params; }

_ZN5Botan15ECDSA_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE:
   35|  1.32k|            EC_PublicKey(alg_id, key_bits) {}
_ZNK5Botan15ECDSA_PublicKey13message_partsEv:
   55|  1.10k|      size_t message_parts() const override { return 2; }
_ZNK5Botan15ECDSA_PublicKey17message_part_sizeEv:
   57|    550|      size_t message_part_size() const override { return domain().get_order().bytes(); }

_ZNK5Botan9Exception4whatEv:
   93|  4.53k|      const char* what() const noexcept override { return m_msg.c_str(); }
_ZN5Botan13Invalid_StateC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  208|     28|      explicit Invalid_State(std::string_view err) : Exception(err) {}
_ZN5Botan12Lookup_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  237|    291|      explicit Lookup_Error(std::string_view err) : Exception(err) {}

_ZN5Botan10hex_encodeENSt3__14spanIKhLm18446744073709551615EEEb:
   43|  8.00k|inline std::string hex_encode(std::span<const uint8_t> input, bool uppercase = true) {
   44|  8.00k|   return hex_encode(input.data(), input.size(), uppercase);
   45|  8.00k|}

_ZN5Botan10ct_is_zeroIhEET_S1_:
   35|  5.76M|{
   36|  5.76M|   return expand_top_bit<T>(~x & (x - 1));
   37|  5.76M|}
_ZN5Botan14expand_top_bitIhEET_S1_:
   25|  13.7M|{
   26|  13.7M|   return static_cast<T>(0) - (a >> (sizeof(T) * 8 - 1));
   27|  13.7M|}
_ZN5Botan10ct_is_zeroIjEET_S1_:
   35|  88.1k|{
   36|  88.1k|   return expand_top_bit<T>(~x & (x - 1));
   37|  88.1k|}
_ZN5Botan14expand_top_bitIjEET_S1_:
   25|  88.1k|{
   26|  88.1k|   return static_cast<T>(0) - (a >> (sizeof(T) * 8 - 1));
   27|  88.1k|}
_ZN5Botan8high_bitIjEEmT_:
   60|  17.6k|{
   61|  17.6k|   size_t hb = 0;
   62|       |
   63|   105k|   for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) {
  ------------------
  |  Branch (63:38): [True: 88.1k, False: 17.6k]
  ------------------
   64|  88.1k|      const size_t z = s * ((~ct_is_zero(n >> s)) & 1);
   65|  88.1k|      hb += z;
   66|  88.1k|      n >>= z;
   67|  88.1k|   }
   68|       |
   69|  17.6k|   hb += n;
   70|       |
   71|  17.6k|   return hb;
   72|  17.6k|}
_ZN5Botan17significant_bytesImEEmT_:
   82|  13.7k|{
   83|  13.7k|   size_t b = 0;
   84|       |
   85|  55.0k|   for(size_t s = 8 * sizeof(n) / 2; s >= 8; s /= 2) {
  ------------------
  |  Branch (85:38): [True: 41.2k, False: 13.7k]
  ------------------
   86|  41.2k|      const size_t z = s * (~ct_is_zero(n >> s) & 1);
   87|  41.2k|      b += z / 8;
   88|  41.2k|      n >>= z;
   89|  41.2k|   }
   90|       |
   91|  13.7k|   b += (n != 0);
   92|       |
   93|  13.7k|   return b;
   94|  13.7k|}
_ZN5Botan10ct_is_zeroImEET_S1_:
   35|  42.6M|{
   36|  42.6M|   return expand_top_bit<T>(~x & (x - 1));
   37|  42.6M|}
_ZN5Botan14expand_top_bitImEET_S1_:
   25|  57.9M|{
   26|  57.9M|   return static_cast<T>(0) - (a >> (sizeof(T) * 8 - 1));
   27|  57.9M|}
_ZN5Botan6chooseIhEET_S1_S1_S1_:
  168|  13.7M|inline constexpr T choose(T mask, T a, T b) {
  169|       |   //return (mask & a) | (~mask & b);
  170|  13.7M|   return (b ^ (mask & (a ^ b)));
  171|  13.7M|}
_ZN5Botan6chooseIjEET_S1_S1_S1_:
  168|  10.6M|inline constexpr T choose(T mask, T a, T b) {
  169|       |   //return (mask & a) | (~mask & b);
  170|  10.6M|   return (b ^ (mask & (a ^ b)));
  171|  10.6M|}
_ZN5Botan9ceil_log2ImEEhT_:
  124|  17.6k|{
  125|  17.6k|   if(x >> (sizeof(T) * 8 - 1))
  ------------------
  |  Branch (125:7): [True: 0, False: 17.6k]
  ------------------
  126|      0|      return sizeof(T) * 8;
  127|       |
  128|  17.6k|   uint8_t result = 0;
  129|  17.6k|   T compare = 1;
  130|       |
  131|   123k|   while(compare < x) {
  ------------------
  |  Branch (131:10): [True: 106k, False: 17.6k]
  ------------------
  132|   106k|      compare <<= 1;
  133|   106k|      result++;
  134|   106k|   }
  135|       |
  136|  17.6k|   return result;
  137|  17.6k|}
_ZN5Botan13is_power_of_2ImEEbT_:
   47|   234k|{
   48|   234k|   return (arg != 0) && (arg != 1) && ((arg & static_cast<T>(arg - 1)) == 0);
  ------------------
  |  Branch (48:11): [True: 234k, False: 0]
  |  Branch (48:25): [True: 234k, False: 0]
  |  Branch (48:39): [True: 213k, False: 21.5k]
  ------------------
   49|   234k|}
_ZN5Botan8majorityIjEET_S1_S1_S1_:
  174|  5.31M|inline constexpr T majority(T a, T b, T c) {
  175|       |   /*
  176|       |   Considering each bit of a, b, c individually
  177|       |
  178|       |   If a xor b is set, then c is the deciding vote.
  179|       |
  180|       |   If a xor b is not set then either a and b are both set or both unset.
  181|       |   In either case the value of c doesn't matter, and examining b (or a)
  182|       |   allows us to determine which case we are in.
  183|       |   */
  184|  5.31M|   return choose(a ^ b, c, b);
  185|  5.31M|}
_ZN5Botan6chooseImEET_S1_S1_S1_:
  168|   148M|inline constexpr T choose(T mask, T a, T b) {
  169|       |   //return (mask & a) | (~mask & b);
  170|   148M|   return (b ^ (mask & (a ^ b)));
  171|   148M|}
_ZN5Botan8majorityImEET_S1_S1_S1_:
  174|  39.6k|inline constexpr T majority(T a, T b, T c) {
  175|       |   /*
  176|       |   Considering each bit of a, b, c individually
  177|       |
  178|       |   If a xor b is set, then c is the deciding vote.
  179|       |
  180|       |   If a xor b is not set then either a and b are both set or both unset.
  181|       |   In either case the value of c doesn't matter, and examining b (or a)
  182|       |   allows us to determine which case we are in.
  183|       |   */
  184|  39.6k|   return choose(a ^ b, c, b);
  185|  39.6k|}
_ZN5Botan8high_bitImEEmT_:
   60|   306k|{
   61|   306k|   size_t hb = 0;
   62|       |
   63|  2.14M|   for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) {
  ------------------
  |  Branch (63:38): [True: 1.84M, False: 306k]
  ------------------
   64|  1.84M|      const size_t z = s * ((~ct_is_zero(n >> s)) & 1);
   65|  1.84M|      hb += z;
   66|  1.84M|      n >>= z;
   67|  1.84M|   }
   68|       |
   69|   306k|   hb += n;
   70|       |
   71|   306k|   return hb;
   72|   306k|}
_ZN5Botan3ctzImEEmT_:
  104|   717k|{
  105|       |   /*
  106|       |   * If n == 0 then this function will compute 8*sizeof(T)-1, so
  107|       |   * initialize lb to 1 if n == 0 to produce the expected result.
  108|       |   */
  109|   717k|   size_t lb = ct_is_zero(n) & 1;
  110|       |
  111|  5.02M|   for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) {
  ------------------
  |  Branch (111:38): [True: 4.30M, False: 717k]
  ------------------
  112|  4.30M|      const T mask = (static_cast<T>(1) << s) - 1;
  113|  4.30M|      const size_t z = s * (ct_is_zero(n & mask) & 1);
  114|  4.30M|      lb += z;
  115|  4.30M|      n >>= z;
  116|  4.30M|   }
  117|       |
  118|   717k|   return lb;
  119|   717k|}

_ZN5Botan13reverse_bytesEt:
   19|  4.26k|inline constexpr uint16_t reverse_bytes(uint16_t x) {
   20|  4.26k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap16)
   21|  4.26k|   return __builtin_bswap16(x);
   22|       |#else
   23|       |   return static_cast<uint16_t>((x << 8) | (x >> 8));
   24|       |#endif
   25|  4.26k|}
_ZN5Botan13reverse_bytesEj:
   33|  1.22M|inline constexpr uint32_t reverse_bytes(uint32_t x) {
   34|  1.22M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap32)
   35|  1.22M|   return __builtin_bswap32(x);
   36|       |#else
   37|       |   // MSVC at least recognizes this as a bswap
   38|       |   return ((x & 0x000000FF) << 24) | ((x & 0x0000FF00) << 8) | ((x & 0x00FF0000) >> 8) | ((x & 0xFF000000) >> 24);
   39|       |#endif
   40|  1.22M|}
_ZN5Botan13reverse_bytesEm:
   48|   103k|inline constexpr uint64_t reverse_bytes(uint64_t x) {
   49|   103k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap64)
   50|   103k|   return __builtin_bswap64(x);
   51|       |#else
   52|       |   uint32_t hi = static_cast<uint32_t>(x >> 32);
   53|       |   uint32_t lo = static_cast<uint32_t>(x);
   54|       |
   55|       |   hi = reverse_bytes(hi);
   56|       |   lo = reverse_bytes(lo);
   57|       |
   58|       |   return (static_cast<uint64_t>(lo) << 32) | hi;
   59|       |#endif
   60|   103k|}

_ZNK5Botan14calendar_point4yearEv:
   24|    551|      uint32_t year() const { return m_year; }
_ZNK5Botan14calendar_point5monthEv:
   27|    551|      uint32_t month() const { return m_month; }
_ZNK5Botan14calendar_point3dayEv:
   30|    551|      uint32_t day() const { return m_day; }
_ZNK5Botan14calendar_point4hourEv:
   33|    551|      uint32_t hour() const { return m_hour; }
_ZNK5Botan14calendar_point7minutesEv:
   36|    551|      uint32_t minutes() const { return m_minutes; }
_ZNK5Botan14calendar_point7secondsEv:
   41|    551|      uint32_t seconds() const { return m_seconds; }

base64.cpp:_ZN5Botan11base_decodeIRNS_12_GLOBAL__N_16Base64EEEmOT_PhPKcmRmbb:
  118|  1.83k|                   bool ignore_ws = true) {
  119|  1.83k|   const size_t decoding_bytes_in = base.decoding_bytes_in();
  120|  1.83k|   const size_t decoding_bytes_out = base.decoding_bytes_out();
  121|       |
  122|  1.83k|   uint8_t* out_ptr = output;
  123|  1.83k|   std::vector<uint8_t> decode_buf(decoding_bytes_in, 0);
  124|  1.83k|   size_t decode_buf_pos = 0;
  125|  1.83k|   size_t final_truncate = 0;
  126|       |
  127|  1.83k|   clear_mem(output, base.decode_max_output(input_length));
  128|       |
  129|  1.88M|   for(size_t i = 0; i != input_length; ++i) {
  ------------------
  |  Branch (129:22): [True: 1.88M, False: 1.83k]
  ------------------
  130|  1.88M|      const uint8_t bin = base.lookup_binary_value(input[i]);
  131|       |
  132|  1.88M|      if(base.check_bad_char(bin, input[i], ignore_ws))  // May throw Invalid_Argument
  ------------------
  |  Branch (132:10): [True: 1.85M, False: 22.9k]
  ------------------
  133|  1.85M|      {
  134|  1.85M|         decode_buf[decode_buf_pos] = bin;
  135|  1.85M|         ++decode_buf_pos;
  136|  1.85M|      }
  137|       |
  138|       |      /*
  139|       |      * If we're at the end of the input, pad with 0s and truncate
  140|       |      */
  141|  1.88M|      if(final_inputs && (i == input_length - 1)) {
  ------------------
  |  Branch (141:10): [True: 1.88M, False: 39]
  |  Branch (141:26): [True: 1.76k, False: 1.87M]
  ------------------
  142|  1.76k|         if(decode_buf_pos) {
  ------------------
  |  Branch (142:13): [True: 1.71k, False: 55]
  ------------------
  143|  4.45k|            for(size_t j = decode_buf_pos; j < decoding_bytes_in; ++j) {
  ------------------
  |  Branch (143:44): [True: 2.74k, False: 1.71k]
  ------------------
  144|  2.74k|               decode_buf[j] = 0;
  145|  2.74k|            }
  146|       |
  147|  1.71k|            final_truncate = decoding_bytes_in - decode_buf_pos;
  148|  1.71k|            decode_buf_pos = decoding_bytes_in;
  149|  1.71k|         }
  150|  1.76k|      }
  151|       |
  152|  1.88M|      if(decode_buf_pos == decoding_bytes_in) {
  ------------------
  |  Branch (152:10): [True: 465k, False: 1.41M]
  ------------------
  153|   465k|         base.decode(out_ptr, decode_buf.data());
  154|       |
  155|   465k|         out_ptr += decoding_bytes_out;
  156|   465k|         decode_buf_pos = 0;
  157|   465k|         input_consumed = i + 1;
  158|   465k|      }
  159|  1.88M|   }
  160|       |
  161|  12.4k|   while(input_consumed < input_length && base.lookup_binary_value(input[input_consumed]) == 0x80) {
  ------------------
  |  Branch (161:10): [True: 10.6k, False: 1.80k]
  |  Branch (161:43): [True: 10.6k, False: 36]
  ------------------
  162|  10.6k|      ++input_consumed;
  163|  10.6k|   }
  164|       |
  165|  1.83k|   size_t written = (out_ptr - output) - base.bytes_to_remove(final_truncate);
  166|       |
  167|  1.83k|   return written;
  168|  1.83k|}
base64.cpp:_ZN5Botan18base_decode_to_vecINSt3__16vectorIhNS_16secure_allocatorIhEEEENS_12_GLOBAL__N_16Base64EEET_OT0_PKcmb:
  183|  1.83k|Vector base_decode_to_vec(Base&& base, const char input[], size_t input_length, bool ignore_ws) {
  184|  1.83k|   const size_t output_length = base.decode_max_output(input_length);
  185|  1.83k|   Vector bin(output_length);
  186|       |
  187|  1.83k|   const size_t written = base_decode_full(base, bin.data(), input, input_length, ignore_ws);
  188|       |
  189|  1.83k|   bin.resize(written);
  190|  1.83k|   return bin;
  191|  1.83k|}
base64.cpp:_ZN5Botan16base_decode_fullIRNS_12_GLOBAL__N_16Base64EEEmOT_PhPKcmb:
  171|  1.83k|size_t base_decode_full(Base&& base, uint8_t output[], const char input[], size_t input_length, bool ignore_ws) {
  172|  1.83k|   size_t consumed = 0;
  173|  1.83k|   const size_t written = base_decode(base, output, input, input_length, consumed, true, ignore_ws);
  174|       |
  175|  1.83k|   if(consumed != input_length) {
  ------------------
  |  Branch (175:7): [True: 36, False: 1.80k]
  ------------------
  176|     36|      throw Invalid_Argument(base.name() + " decoding failed, input did not have full bytes");
  177|     36|   }
  178|       |
  179|  1.80k|   return written;
  180|  1.83k|}

_ZN5Botan5CPUID13has_cpuid_bitENS0_10CPUID_bitsE:
  333|   115k|      static bool has_cpuid_bit(CPUID_bits elem) {
  334|   115k|         const uint32_t elem32 = static_cast<uint32_t>(elem);
  335|   115k|         return state().has_bit(elem32);
  336|   115k|      }
_ZN5Botan5CPUID5stateEv:
  362|   115k|      static CPUID_Data& state() {
  363|   115k|         static CPUID::CPUID_Data g_cpuid;
  364|   115k|         return g_cpuid;
  365|   115k|      }
_ZNK5Botan5CPUID10CPUID_Data7has_bitEj:
  350|   115k|            bool has_bit(uint32_t bit) const { return (m_processor_features & bit) == bit; }
_ZN5Botan5CPUID8has_sse2Ev:
  208|  54.4k|      static bool has_sse2() { return has_cpuid_bit(CPUID_SSE2_BIT); }
_ZN5Botan5CPUID8has_bmi2Ev:
  240|  22.8k|      static bool has_bmi2() { return has_cpuid_bit(CPUID_BMI_BIT); }
_ZN5Botan5CPUID13has_intel_shaEv:
  255|  38.4k|      static bool has_intel_sha() { return has_sse2() && has_cpuid_bit(CPUID_SHA_BIT); }
  ------------------
  |  Branch (255:44): [True: 38.4k, False: 0]
  |  Branch (255:58): [True: 0, False: 38.4k]
  ------------------

_ZN5Botan2CT4MaskIhE7is_zeroEh:
  123|  5.76M|      static Mask<T> is_zero(T x) { return Mask<T>(ct_is_zero<T>(x)); }
_ZN5Botan2CT4MaskIhEC2Eh:
  279|  19.5M|      Mask(T m) : m_mask(m) {}
_ZNK5Botan2CT4MaskIhE5valueEv:
  276|  19.5M|      T value() const { return m_mask; }
_ZN5Botan2CT4MaskIhE3setEv:
   99|  35.2k|      static Mask<T> set() { return Mask<T>(static_cast<T>(~0)); }
_ZN5Botan2CT4MaskIhE15is_within_rangeEhhh:
  150|  5.68M|      static Mask<T> is_within_range(T v, T l, T u) {
  151|       |         //return Mask<T>::is_gte(v, l) & Mask<T>::is_lte(v, u);
  152|       |
  153|  5.68M|         const T v_lt_l = v ^ ((v ^ l) | ((v - l) ^ v));
  154|  5.68M|         const T v_gt_u = u ^ ((u ^ v) | ((u - v) ^ u));
  155|  5.68M|         const T either = v_lt_l | v_gt_u;
  156|  5.68M|         return ~Mask<T>(expand_top_bit(either));
  157|  5.68M|      }
_ZNK5Botan2CT4MaskIhEcoEv:
  213|  5.77M|      Mask<T> operator~() const { return Mask<T>(~value()); }
_ZN5Botan2CT4MaskIhE9is_any_ofEhSt16initializer_listIhE:
  159|  1.89M|      static Mask<T> is_any_of(T v, std::initializer_list<T> accepted) {
  160|  1.89M|         T accept = 0;
  161|       |
  162|  7.57M|         for(auto a : accepted) {
  ------------------
  |  Branch (162:21): [True: 7.57M, False: 1.89M]
  ------------------
  163|  7.57M|            const T diff = a ^ v;
  164|  7.57M|            const T eq_zero = ~diff & (diff - 1);
  165|  7.57M|            accept |= eq_zero;
  166|  7.57M|         }
  167|       |
  168|  1.89M|         return Mask<T>(expand_top_bit(accept));
  169|  1.89M|      }
_ZNK5Botan2CT4MaskIhE6is_setEv:
  271|  35.2k|      bool is_set() const { return unpoisoned_value() != 0; }
_ZNK5Botan2CT4MaskIhE16unpoisoned_valueEv:
  262|  35.2k|      T unpoisoned_value() const {
  263|  35.2k|         T r = value();
  264|  35.2k|         CT::unpoison(r);
  265|  35.2k|         return r;
  266|  35.2k|      }
_ZN5Botan2CT8unpoisonIhEEvRT_:
   66|  35.2k|inline void unpoison(T& p) {
   67|       |#if defined(BOTAN_HAS_VALGRIND)
   68|       |   VALGRIND_MAKE_MEM_DEFINED(&p, sizeof(T));
   69|       |#else
   70|  35.2k|   BOTAN_UNUSED(p);
  ------------------
  |  |  118|  35.2k|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
   71|  35.2k|#endif
   72|  35.2k|}
_ZN5Botan2CT4MaskIhE5is_ltEhh:
  133|   416k|      static Mask<T> is_lt(T x, T y) { return Mask<T>(expand_top_bit<T>(x ^ ((x ^ y) | ((x - y) ^ x)))); }
_ZNK5Botan2CT4MaskIhE6selectEhh:
  228|  13.7M|      T select(T x, T y) const { return choose(value(), x, y); }
_ZN5Botan2CT4MaskImE8is_equalEmm:
  128|  4.45M|      static Mask<T> is_equal(T x, T y) { return Mask<T>::is_zero(static_cast<T>(x ^ y)); }
_ZN5Botan2CT4MaskImE5is_ltEmm:
  133|  15.3M|      static Mask<T> is_lt(T x, T y) { return Mask<T>(expand_top_bit<T>(x ^ ((x ^ y) | ((x - y) ^ x)))); }
_ZN5Botan2CT4MaskImEC2Em:
  279|  84.6M|      Mask(T m) : m_mask(m) {}
_ZNK5Botan2CT4MaskImE11select_maskES2_S2_:
  239|  3.75M|      Mask<T> select_mask(Mask<T> x, Mask<T> y) const { return Mask<T>(select(x.value(), y.value())); }
_ZNK5Botan2CT4MaskImE5valueEv:
  276|   219M|      T value() const { return m_mask; }
_ZN5Botan2CT4MaskImEoRES2_:
  190|   720k|      Mask<T>& operator|=(Mask<T> o) {
  191|   720k|         m_mask |= o.value();
  192|   720k|         return (*this);
  193|   720k|      }
_ZN5Botan2CT4MaskImEaNES2_:
  174|  8.20k|      Mask<T>& operator&=(Mask<T> o) {
  175|  8.20k|         m_mask &= o.value();
  176|  8.20k|         return (*this);
  177|  8.20k|      }
_ZNK5Botan2CT4MaskImE13if_set_returnEm:
  218|  8.06M|      T if_set_return(T x) const { return m_mask & x; }
_ZN5Botan2CT4MaskImE6expandEm:
  109|  19.4M|      static Mask<T> expand(T v) { return ~Mask<T>::is_zero(v); }
_ZNK5Botan2CT4MaskImEcoEv:
  213|  30.4M|      Mask<T> operator~() const { return Mask<T>(~value()); }
_ZNK5Botan2CT4MaskImE6selectEmm:
  228|   147M|      T select(T x, T y) const { return choose(value(), x, y); }
_ZNK5Botan2CT4MaskImE8select_nEPmPKmS5_m:
  245|   481k|      void select_n(T output[], const T x[], const T y[], size_t len) const {
  246|  2.70M|         for(size_t i = 0; i != len; ++i)
  ------------------
  |  Branch (246:28): [True: 2.22M, False: 481k]
  ------------------
  247|  2.22M|            output[i] = this->select(x[i], y[i]);
  248|   481k|      }
_ZN5Botan2CT4MaskImE7is_zeroEm:
  123|  24.0M|      static Mask<T> is_zero(T x) { return Mask<T>(ct_is_zero<T>(x)); }
_ZN5Botan2CT8unpoisonImEEvRT_:
   66|  12.7M|inline void unpoison(T& p) {
   67|       |#if defined(BOTAN_HAS_VALGRIND)
   68|       |   VALGRIND_MAKE_MEM_DEFINED(&p, sizeof(T));
   69|       |#else
   70|  12.7M|   BOTAN_UNUSED(p);
  ------------------
  |  |  118|  12.7M|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
   71|  12.7M|#endif
   72|  12.7M|}
_ZNK5Botan2CT4MaskImE6is_setEv:
  271|  11.3M|      bool is_set() const { return unpoisoned_value() != 0; }
_ZNK5Botan2CT4MaskImE16unpoisoned_valueEv:
  262|  11.3M|      T unpoisoned_value() const {
  263|  11.3M|         T r = value();
  264|  11.3M|         CT::unpoison(r);
  265|  11.3M|         return r;
  266|  11.3M|      }
_ZN5Botan2CT8unpoisonIKmEEvRT_:
   66|   306k|inline void unpoison(T& p) {
   67|       |#if defined(BOTAN_HAS_VALGRIND)
   68|       |   VALGRIND_MAKE_MEM_DEFINED(&p, sizeof(T));
   69|       |#else
   70|   306k|   BOTAN_UNUSED(p);
  ------------------
  |  |  118|   306k|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
   71|   306k|#endif
   72|   306k|}
_ZN5Botan2CT4MaskIhE6expandEh:
  109|  89.9k|      static Mask<T> expand(T v) { return ~Mask<T>::is_zero(v); }
_ZN5Botan2CT20conditional_copy_memImEENS0_4MaskIT_EES3_PS3_PKS3_S7_m:
  285|  85.7k|inline Mask<T> conditional_copy_mem(T cnd, T* to, const T* from0, const T* from1, size_t elems) {
  286|  85.7k|   const auto mask = CT::Mask<T>::expand(cnd);
  287|  85.7k|   mask.select_n(to, from0, from1, elems);
  288|  85.7k|   return mask;
  289|  85.7k|}
_ZN5Botan2CT20conditional_swap_ptrIPKmEEvbRT_S5_:
  309|  55.8k|inline void conditional_swap_ptr(bool cnd, T& x, T& y) {
  310|  55.8k|   uintptr_t xp = reinterpret_cast<uintptr_t>(x);
  311|  55.8k|   uintptr_t yp = reinterpret_cast<uintptr_t>(y);
  312|       |
  313|  55.8k|   conditional_swap<uintptr_t>(cnd, xp, yp);
  314|       |
  315|  55.8k|   x = reinterpret_cast<T>(xp);
  316|  55.8k|   y = reinterpret_cast<T>(yp);
  317|  55.8k|}
_ZN5Botan2CT16conditional_swapImEEvbRT_S3_:
  299|   111k|inline void conditional_swap(bool cnd, T& x, T& y) {
  300|   111k|   const auto swap = CT::Mask<T>::expand(cnd);
  301|       |
  302|   111k|   T t0 = swap.select(y, x);
  303|   111k|   T t1 = swap.select(x, y);
  304|   111k|   x = t0;
  305|   111k|   y = t1;
  306|   111k|}
_ZN5Botan2CT4MaskIhE8is_equalEhh:
  128|  5.67M|      static Mask<T> is_equal(T x, T y) { return Mask<T>::is_zero(static_cast<T>(x ^ y)); }
_ZN5Botan2CT4MaskImE6is_gteEmm:
  148|  10.9M|      static Mask<T> is_gte(T x, T y) { return ~Mask<T>::is_lt(x, y); }
_ZN5Botan2CTorENS0_4MaskImEES2_:
  208|  10.9M|      friend Mask<T> operator|(Mask<T> x, Mask<T> y) { return Mask<T>(x.value() | y.value()); }
_ZN5Botan2CTeoENS0_4MaskImEES2_:
  203|  1.41k|      friend Mask<T> operator^(Mask<T> x, Mask<T> y) { return Mask<T>(x.value() ^ y.value()); }
_ZN5Botan2CT4MaskImE3setEv:
   99|    423|      static Mask<T> set() { return Mask<T>(static_cast<T>(~0)); }
_ZN5Botan2CT6poisonImEEvPKT_m:
   48|    423|inline void poison(const T* p, size_t n) {
   49|       |#if defined(BOTAN_HAS_VALGRIND)
   50|       |   VALGRIND_MAKE_MEM_UNDEFINED(p, n * sizeof(T));
   51|       |#else
   52|    423|   BOTAN_UNUSED(p, n);
  ------------------
  |  |  118|    423|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
   53|    423|#endif
   54|    423|}
_ZN5Botan2CT4MaskImE15if_set_zero_outEPmm:
  253|    423|      void if_set_zero_out(T buf[], size_t elems) {
  254|  2.04k|         for(size_t i = 0; i != elems; ++i) {
  ------------------
  |  Branch (254:28): [True: 1.61k, False: 423]
  ------------------
  255|  1.61k|            buf[i] = this->if_not_set_return(buf[i]);
  256|  1.61k|         }
  257|    423|      }
_ZNK5Botan2CT4MaskImE17if_not_set_returnEm:
  223|   719k|      T if_not_set_return(T x) const { return ~m_mask & x; }
_ZN5Botan2CT8unpoisonImEEvPKT_m:
   57|    423|inline void unpoison(const T* p, size_t n) {
   58|       |#if defined(BOTAN_HAS_VALGRIND)
   59|       |   VALGRIND_MAKE_MEM_DEFINED(p, n * sizeof(T));
   60|       |#else
   61|    423|   BOTAN_UNUSED(p, n);
  ------------------
  |  |  118|    423|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
   62|    423|#endif
   63|    423|}
_ZN5Botan2CT4MaskImE7clearedEv:
  104|  86.2k|      static Mask<T> cleared() { return Mask<T>(0); }
_ZN5Botan2CT9all_zerosImEENS0_4MaskIT_EEPKS3_m:
  320|  90.9k|inline CT::Mask<T> all_zeros(const T elem[], size_t len) {
  321|  90.9k|   T sum = 0;
  322|   450k|   for(size_t i = 0; i != len; ++i)
  ------------------
  |  Branch (322:22): [True: 359k, False: 90.9k]
  ------------------
  323|   359k|      sum |= elem[i];
  324|  90.9k|   return CT::Mask<T>::is_zero(sum);
  325|  90.9k|}
_ZN5Botan2CTanENS0_4MaskImEES2_:
  198|  45.4k|      friend Mask<T> operator&(Mask<T> x, Mask<T> y) { return Mask<T>(x.value() & y.value()); }
_ZN5Botan2CT22conditional_assign_memImEENS0_4MaskIT_EES3_PS3_PKS3_m:
  292|   379k|inline Mask<T> conditional_assign_mem(T cnd, T* sink, const T* src, size_t elems) {
  293|   379k|   const auto mask = CT::Mask<T>::expand(cnd);
  294|   379k|   mask.select_n(sink, src, sink, elems);
  295|   379k|   return mask;
  296|   379k|}
_ZN5Botan2CT8unpoisonIlEEvRT_:
   66|  1.38M|inline void unpoison(T& p) {
   67|       |#if defined(BOTAN_HAS_VALGRIND)
   68|       |   VALGRIND_MAKE_MEM_DEFINED(&p, sizeof(T));
   69|       |#else
   70|  1.38M|   BOTAN_UNUSED(p);
  ------------------
  |  |  118|  1.38M|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
   71|  1.38M|#endif
   72|  1.38M|}

_ZN5Botan9ct_divideERKNS_6BigIntES2_:
   49|  2.34k|inline BigInt ct_divide(const BigInt& x, const BigInt& y) {
   50|  2.34k|   BigInt q, r;
   51|  2.34k|   ct_divide(x, y, q, r);
   52|  2.34k|   return q;
   53|  2.34k|}

_ZN5Botan8FE_25519C2ESt16initializer_listIiE:
   36|  1.53k|      FE_25519(std::initializer_list<int32_t> x) {
   37|  1.53k|         if(x.size() != 10)
  ------------------
  |  Branch (37:13): [True: 0, False: 1.53k]
  ------------------
   38|      0|            throw Invalid_Argument("Invalid FE_25519 initializer list");
   39|  1.53k|         copy_mem(m_fe, x.begin(), 10);
   40|  1.53k|      }

_ZN5Botan4EMSAD2Ev:
   25|  1.10k|      virtual ~EMSA() = default;

_ZNK5Botan13EMSA_PKCS1v1513hash_functionEv:
   38|     12|      std::string hash_function() const override { return m_hash->name(); }

_ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_:
   51|  15.5k|std::string fmt(std::string_view format, const T&... args) {
   52|  15.5k|   std::ostringstream oss;
   53|  15.5k|   oss.imbue(std::locale::classic());
   54|  15.5k|   fmt_detail::do_fmt(oss, format, args...);
   55|  15.5k|   return oss.str();
   56|  15.5k|}
_ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_:
   23|  18.0k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) {
   24|  18.0k|   size_t i = 0;
   25|       |
   26|   180k|   while(i < format.size()) {
  ------------------
  |  Branch (26:10): [True: 180k, False: 0]
  ------------------
   27|   180k|      if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') {
  ------------------
  |  Branch (27:10): [True: 18.0k, False: 161k]
  |  Branch (27:30): [True: 18.0k, False: 0]
  |  Branch (27:59): [True: 18.0k, False: 0]
  ------------------
   28|  18.0k|         oss << val;
   29|  18.0k|         return do_fmt(oss, format.substr(i + 2), rest...);
   30|   161k|      } else {
   31|   161k|         oss << format[i];
   32|   161k|      }
   33|       |
   34|   161k|      i += 1;
   35|   161k|   }
   36|  18.0k|}
_ZN5Botan10fmt_detail6do_fmtERNSt3__119basic_ostringstreamIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EE:
   20|  25.0k|inline void do_fmt(std::ostringstream& oss, std::string_view format) { oss << format; }
_ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPKcEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_:
   51|  4.53k|std::string fmt(std::string_view format, const T&... args) {
   52|  4.53k|   std::ostringstream oss;
   53|  4.53k|   oss.imbue(std::locale::classic());
   54|  4.53k|   fmt_detail::do_fmt(oss, format, args...);
   55|  4.53k|   return oss.str();
   56|  4.53k|}
_ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJPKcEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_:
   23|  4.53k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) {
   24|  4.53k|   size_t i = 0;
   25|       |
   26|  4.53k|   while(i < format.size()) {
  ------------------
  |  Branch (26:10): [True: 4.53k, False: 0]
  ------------------
   27|  4.53k|      if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') {
  ------------------
  |  Branch (27:10): [True: 4.53k, False: 0]
  |  Branch (27:30): [True: 4.53k, False: 0]
  |  Branch (27:59): [True: 4.53k, False: 0]
  ------------------
   28|  4.53k|         oss << val;
   29|  4.53k|         return do_fmt(oss, format.substr(i + 2), rest...);
   30|  4.53k|      } else {
   31|      0|         oss << format[i];
   32|      0|      }
   33|       |
   34|      0|      i += 1;
   35|      0|   }
   36|  4.53k|}
_ZN5Botan10fmt_detail6do_fmtIPKcJEEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_:
   23|  4.62k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) {
   24|  4.62k|   size_t i = 0;
   25|       |
   26|  63.6k|   while(i < format.size()) {
  ------------------
  |  Branch (26:10): [True: 63.6k, False: 0]
  ------------------
   27|  63.6k|      if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') {
  ------------------
  |  Branch (27:10): [True: 4.62k, False: 58.9k]
  |  Branch (27:30): [True: 4.62k, False: 0]
  |  Branch (27:59): [True: 4.62k, False: 0]
  ------------------
   28|  4.62k|         oss << val;
   29|  4.62k|         return do_fmt(oss, format.substr(i + 2), rest...);
   30|  58.9k|      } else {
   31|  58.9k|         oss << format[i];
   32|  58.9k|      }
   33|       |
   34|  58.9k|      i += 1;
   35|  58.9k|   }
   36|  4.62k|}
_ZN5Botan3fmtIJPKcNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEEEENS3_12basic_stringIcS6_NS3_9allocatorIcEEEES7_DpRKT_:
   51|  2.53k|std::string fmt(std::string_view format, const T&... args) {
   52|  2.53k|   std::ostringstream oss;
   53|  2.53k|   oss.imbue(std::locale::classic());
   54|  2.53k|   fmt_detail::do_fmt(oss, format, args...);
   55|  2.53k|   return oss.str();
   56|  2.53k|}
_ZN5Botan10fmt_detail6do_fmtIPKcJNSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEEEEvRNS4_19basic_ostringstreamIcS7_NS4_9allocatorIcEEEES8_RKT_DpRKT0_:
   23|  2.53k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) {
   24|  2.53k|   size_t i = 0;
   25|       |
   26|  2.53k|   while(i < format.size()) {
  ------------------
  |  Branch (26:10): [True: 2.53k, False: 0]
  ------------------
   27|  2.53k|      if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') {
  ------------------
  |  Branch (27:10): [True: 2.53k, False: 0]
  |  Branch (27:30): [True: 2.53k, False: 0]
  |  Branch (27:59): [True: 2.53k, False: 0]
  ------------------
   28|  2.53k|         oss << val;
   29|  2.53k|         return do_fmt(oss, format.substr(i + 2), rest...);
   30|  2.53k|      } else {
   31|      0|         oss << format[i];
   32|      0|      }
   33|       |
   34|      0|      i += 1;
   35|      0|   }
   36|  2.53k|}
_ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEjEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_:
   51|    329|std::string fmt(std::string_view format, const T&... args) {
   52|    329|   std::ostringstream oss;
   53|    329|   oss.imbue(std::locale::classic());
   54|    329|   fmt_detail::do_fmt(oss, format, args...);
   55|    329|   return oss.str();
   56|    329|}
_ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJjEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_:
   23|    329|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) {
   24|    329|   size_t i = 0;
   25|       |
   26|    329|   while(i < format.size()) {
  ------------------
  |  Branch (26:10): [True: 329, False: 0]
  ------------------
   27|    329|      if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') {
  ------------------
  |  Branch (27:10): [True: 329, False: 0]
  |  Branch (27:30): [True: 329, False: 0]
  |  Branch (27:59): [True: 329, False: 0]
  ------------------
   28|    329|         oss << val;
   29|    329|         return do_fmt(oss, format.substr(i + 2), rest...);
   30|    329|      } else {
   31|      0|         oss << format[i];
   32|      0|      }
   33|       |
   34|      0|      i += 1;
   35|      0|   }
   36|    329|}
_ZN5Botan10fmt_detail6do_fmtIjJEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_:
   23|    410|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) {
   24|    410|   size_t i = 0;
   25|       |
   26|  3.74k|   while(i < format.size()) {
  ------------------
  |  Branch (26:10): [True: 3.74k, False: 0]
  ------------------
   27|  3.74k|      if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') {
  ------------------
  |  Branch (27:10): [True: 410, False: 3.33k]
  |  Branch (27:30): [True: 410, False: 0]
  |  Branch (27:59): [True: 410, False: 0]
  ------------------
   28|    410|         oss << val;
   29|    410|         return do_fmt(oss, format.substr(i + 2), rest...);
   30|  3.33k|      } else {
   31|  3.33k|         oss << format[i];
   32|  3.33k|      }
   33|       |
   34|  3.33k|      i += 1;
   35|  3.33k|   }
   36|    410|}
_ZN5Botan3fmtIJjEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_:
   51|     81|std::string fmt(std::string_view format, const T&... args) {
   52|     81|   std::ostringstream oss;
   53|     81|   oss.imbue(std::locale::classic());
   54|     81|   fmt_detail::do_fmt(oss, format, args...);
   55|     81|   return oss.str();
   56|     81|}
_ZN5Botan3fmtIJNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEES7_NS1_17basic_string_viewIcS4_EEDpRKT_:
   51|  1.96k|std::string fmt(std::string_view format, const T&... args) {
   52|  1.96k|   std::ostringstream oss;
   53|  1.96k|   oss.imbue(std::locale::classic());
   54|  1.96k|   fmt_detail::do_fmt(oss, format, args...);
   55|  1.96k|   return oss.str();
   56|  1.96k|}
_ZN5Botan10fmt_detail6do_fmtINSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEJEEEvRNS2_19basic_ostringstreamIcS5_S7_EENS2_17basic_string_viewIcS5_EERKT_DpRKT0_:
   23|  1.96k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) {
   24|  1.96k|   size_t i = 0;
   25|       |
   26|  20.6k|   while(i < format.size()) {
  ------------------
  |  Branch (26:10): [True: 20.6k, False: 0]
  ------------------
   27|  20.6k|      if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') {
  ------------------
  |  Branch (27:10): [True: 1.96k, False: 18.6k]
  |  Branch (27:30): [True: 1.96k, False: 0]
  |  Branch (27:59): [True: 1.96k, False: 0]
  ------------------
   28|  1.96k|         oss << val;
   29|  1.96k|         return do_fmt(oss, format.substr(i + 2), rest...);
   30|  18.6k|      } else {
   31|  18.6k|         oss << format[i];
   32|  18.6k|      }
   33|       |
   34|  18.6k|      i += 1;
   35|  18.6k|   }
   36|  1.96k|}
_ZN5Botan3fmtIJPKcS2_S2_EEENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS3_17basic_string_viewIcS6_EEDpRKT_:
   51|     91|std::string fmt(std::string_view format, const T&... args) {
   52|     91|   std::ostringstream oss;
   53|     91|   oss.imbue(std::locale::classic());
   54|     91|   fmt_detail::do_fmt(oss, format, args...);
   55|     91|   return oss.str();
   56|     91|}
_ZN5Botan10fmt_detail6do_fmtIPKcJS3_S3_EEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_:
   23|     91|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) {
   24|     91|   size_t i = 0;
   25|       |
   26|     91|   while(i < format.size()) {
  ------------------
  |  Branch (26:10): [True: 91, False: 0]
  ------------------
   27|     91|      if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') {
  ------------------
  |  Branch (27:10): [True: 91, False: 0]
  |  Branch (27:30): [True: 91, False: 0]
  |  Branch (27:59): [True: 91, False: 0]
  ------------------
   28|     91|         oss << val;
   29|     91|         return do_fmt(oss, format.substr(i + 2), rest...);
   30|     91|      } else {
   31|      0|         oss << format[i];
   32|      0|      }
   33|       |
   34|      0|      i += 1;
   35|      0|   }
   36|     91|}
_ZN5Botan10fmt_detail6do_fmtIPKcJS3_EEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_:
   23|     91|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) {
   24|     91|   size_t i = 0;
   25|       |
   26|    455|   while(i < format.size()) {
  ------------------
  |  Branch (26:10): [True: 455, False: 0]
  ------------------
   27|    455|      if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') {
  ------------------
  |  Branch (27:10): [True: 91, False: 364]
  |  Branch (27:30): [True: 91, False: 0]
  |  Branch (27:59): [True: 91, False: 0]
  ------------------
   28|     91|         oss << val;
   29|     91|         return do_fmt(oss, format.substr(i + 2), rest...);
   30|    364|      } else {
   31|    364|         oss << format[i];
   32|    364|      }
   33|       |
   34|    364|      i += 1;
   35|    364|   }
   36|     91|}
_ZN5Botan3fmtIJNS_3OIDENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEEEENS2_12basic_stringIcS5_NS2_9allocatorIcEEEES6_DpRKT_:
   51|     10|std::string fmt(std::string_view format, const T&... args) {
   52|     10|   std::ostringstream oss;
   53|     10|   oss.imbue(std::locale::classic());
   54|     10|   fmt_detail::do_fmt(oss, format, args...);
   55|     10|   return oss.str();
   56|     10|}
_ZN5Botan10fmt_detail6do_fmtINS_3OIDEJNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEEEEvRNS3_19basic_ostringstreamIcS6_NS3_9allocatorIcEEEES7_RKT_DpRKT0_:
   23|     10|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) {
   24|     10|   size_t i = 0;
   25|       |
   26|    360|   while(i < format.size()) {
  ------------------
  |  Branch (26:10): [True: 360, False: 0]
  ------------------
   27|    360|      if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') {
  ------------------
  |  Branch (27:10): [True: 10, False: 350]
  |  Branch (27:30): [True: 10, False: 0]
  |  Branch (27:59): [True: 10, False: 0]
  ------------------
   28|     10|         oss << val;
   29|     10|         return do_fmt(oss, format.substr(i + 2), rest...);
   30|    350|      } else {
   31|    350|         oss << format[i];
   32|    350|      }
   33|       |
   34|    350|      i += 1;
   35|    350|   }
   36|     10|}

_ZN5Botan11make_uint16Ehh:
   63|    437|inline constexpr uint16_t make_uint16(uint8_t i0, uint8_t i1) {
   64|    437|   return static_cast<uint16_t>((static_cast<uint16_t>(i0) << 8) | i1);
   65|    437|}
_ZN5Botan7load_beItEET_PKhm:
  136|  4.26k|inline constexpr uint16_t load_be<uint16_t>(const uint8_t in[], size_t off) {
  137|  4.26k|   in += off * sizeof(uint16_t);
  138|       |
  139|  4.26k|#if defined(BOTAN_ENDIAN_N2B)
  140|  4.26k|   uint16_t x = 0;
  141|  4.26k|   typecast_copy(x, in);
  142|  4.26k|   return BOTAN_ENDIAN_N2B(x);
  ------------------
  |  |   26|  4.26k|   #define BOTAN_ENDIAN_N2B(x) reverse_bytes(x)
  ------------------
  143|       |#else
  144|       |   return make_uint16(in[0], in[1]);
  145|       |#endif
  146|  4.26k|}
_ZN5Botan7load_beIjEET_PKhm:
  174|  1.07M|inline constexpr uint32_t load_be<uint32_t>(const uint8_t in[], size_t off) {
  175|  1.07M|   in += off * sizeof(uint32_t);
  176|  1.07M|#if defined(BOTAN_ENDIAN_N2B)
  177|  1.07M|   uint32_t x = 0;
  178|  1.07M|   typecast_copy(x, in);
  179|  1.07M|   return BOTAN_ENDIAN_N2B(x);
  ------------------
  |  |   26|  1.07M|   #define BOTAN_ENDIAN_N2B(x) reverse_bytes(x)
  ------------------
  180|       |#else
  181|       |   return make_uint32(in[0], in[1], in[2], in[3]);
  182|       |#endif
  183|  1.07M|}
_ZN5Botan7load_beImEET_PKhm:
  210|  59.7k|inline constexpr uint64_t load_be<uint64_t>(const uint8_t in[], size_t off) {
  211|  59.7k|   in += off * sizeof(uint64_t);
  212|  59.7k|#if defined(BOTAN_ENDIAN_N2B)
  213|  59.7k|   uint64_t x = 0;
  214|  59.7k|   typecast_copy(x, in);
  215|  59.7k|   return BOTAN_ENDIAN_N2B(x);
  ------------------
  |  |   26|  59.7k|   #define BOTAN_ENDIAN_N2B(x) reverse_bytes(x)
  ------------------
  216|       |#else
  217|       |   return make_uint64(in[0], in[1], in[2], in[3], in[4], in[5], in[6], in[7]);
  218|       |#endif
  219|  59.7k|}
_ZN5Botan8store_beEjPh:
  437|   150k|inline constexpr void store_be(uint32_t in, uint8_t out[4]) {
  438|   150k|#if defined(BOTAN_ENDIAN_B2N)
  439|   150k|   uint32_t o = BOTAN_ENDIAN_B2N(in);
  ------------------
  |  |   27|   150k|   #define BOTAN_ENDIAN_B2N(x) reverse_bytes(x)
  ------------------
  440|   150k|   typecast_copy(out, o);
  441|       |#else
  442|       |   out[0] = get_byte<0>(in);
  443|       |   out[1] = get_byte<1>(in);
  444|       |   out[2] = get_byte<2>(in);
  445|       |   out[3] = get_byte<3>(in);
  446|       |#endif
  447|   150k|}
_ZN5Botan8store_leEjPh:
  454|    384|inline constexpr void store_le(uint32_t in, uint8_t out[4]) {
  455|    384|#if defined(BOTAN_ENDIAN_L2N)
  456|    384|   uint32_t o = BOTAN_ENDIAN_L2N(in);
  ------------------
  |  |   25|    384|   #define BOTAN_ENDIAN_L2N(x) (x)
  ------------------
  457|    384|   typecast_copy(out, o);
  458|       |#else
  459|       |   out[0] = get_byte<3>(in);
  460|       |   out[1] = get_byte<2>(in);
  461|       |   out[2] = get_byte<1>(in);
  462|       |   out[3] = get_byte<0>(in);
  463|       |#endif
  464|    384|}
_ZN5Botan8store_beEmPh:
  471|  43.3k|inline constexpr void store_be(uint64_t in, uint8_t out[8]) {
  472|  43.3k|#if defined(BOTAN_ENDIAN_B2N)
  473|  43.3k|   uint64_t o = BOTAN_ENDIAN_B2N(in);
  ------------------
  |  |   27|  43.3k|   #define BOTAN_ENDIAN_B2N(x) reverse_bytes(x)
  ------------------
  474|  43.3k|   typecast_copy(out, o);
  475|       |#else
  476|       |   out[0] = get_byte<0>(in);
  477|       |   out[1] = get_byte<1>(in);
  478|       |   out[2] = get_byte<2>(in);
  479|       |   out[3] = get_byte<3>(in);
  480|       |   out[4] = get_byte<4>(in);
  481|       |   out[5] = get_byte<5>(in);
  482|       |   out[6] = get_byte<6>(in);
  483|       |   out[7] = get_byte<7>(in);
  484|       |#endif
  485|  43.3k|}
_ZN5Botan8store_leEmPh:
  492|     96|inline constexpr void store_le(uint64_t in, uint8_t out[8]) {
  493|     96|#if defined(BOTAN_ENDIAN_L2N)
  494|     96|   uint64_t o = BOTAN_ENDIAN_L2N(in);
  ------------------
  |  |   25|     96|   #define BOTAN_ENDIAN_L2N(x) (x)
  ------------------
  495|     96|   typecast_copy(out, o);
  496|       |#else
  497|       |   out[0] = get_byte<7>(in);
  498|       |   out[1] = get_byte<6>(in);
  499|       |   out[2] = get_byte<5>(in);
  500|       |   out[3] = get_byte<4>(in);
  501|       |   out[4] = get_byte<3>(in);
  502|       |   out[5] = get_byte<2>(in);
  503|       |   out[6] = get_byte<1>(in);
  504|       |   out[7] = get_byte<0>(in);
  505|       |#endif
  506|     96|}
_ZN5Botan8get_byteILm0EmEEhT0_:
   52|  44.1k|{
   53|  44.1k|   const size_t shift = ((~B) & (sizeof(T) - 1)) << 3;
   54|  44.1k|   return static_cast<uint8_t>((input >> shift) & 0xFF);
   55|  44.1k|}
_ZN5Botan12get_byte_varImEEhmT_:
   40|  45.6k|inline constexpr uint8_t get_byte_var(size_t byte_num, T input) {
   41|  45.6k|   return static_cast<uint8_t>(input >> (((~byte_num) & (sizeof(T) - 1)) << 3));
   42|  45.6k|}
_ZN5Botan15copy_out_vec_leIjNS_16secure_allocatorIjEEEEvPhmRKNSt3__16vectorIT_T0_EE:
  644|     96|void copy_out_vec_le(uint8_t out[], size_t out_bytes, const std::vector<T, Alloc>& in) {
  645|     96|   copy_out_le(out, out_bytes, in.data());
  646|     96|}
_ZN5Botan11copy_out_leIjEEvPhmPKT_:
  631|     96|void copy_out_le(uint8_t out[], size_t out_bytes, const T in[]) {
  632|    480|   while(out_bytes >= sizeof(T)) {
  ------------------
  |  Branch (632:10): [True: 384, False: 96]
  ------------------
  633|    384|      store_le(in[0], out);
  634|    384|      out += sizeof(T);
  635|    384|      out_bytes -= sizeof(T);
  636|    384|      in += 1;
  637|    384|   }
  638|       |
  639|     96|   for(size_t i = 0; i != out_bytes; ++i)
  ------------------
  |  Branch (639:22): [True: 0, False: 96]
  ------------------
  640|      0|      out[i] = get_byte_var(sizeof(T) - 1 - (i % 8), in[0]);
  641|     96|}
_ZN5Botan7load_leIjEEvPT_PKhm:
  298|    916|inline constexpr void load_le(T out[], const uint8_t in[], size_t count) {
  299|    916|   if(count > 0) {
  ------------------
  |  Branch (299:7): [True: 916, False: 0]
  ------------------
  300|    916|#if defined(BOTAN_TARGET_CPU_IS_LITTLE_ENDIAN)
  301|    916|      typecast_copy(out, in, count);
  302|       |
  303|       |#elif defined(BOTAN_TARGET_CPU_IS_BIG_ENDIAN)
  304|       |      typecast_copy(out, in, count);
  305|       |
  306|       |      const size_t blocks = count - (count % 4);
  307|       |      const size_t left = count - blocks;
  308|       |
  309|       |      for(size_t i = 0; i != blocks; i += 4)
  310|       |         bswap_4(out + i);
  311|       |
  312|       |      for(size_t i = 0; i != left; ++i)
  313|       |         out[blocks + i] = reverse_bytes(out[blocks + i]);
  314|       |#else
  315|       |      for(size_t i = 0; i != count; ++i)
  316|       |         out[i] = load_le<T>(in, i);
  317|       |#endif
  318|    916|   }
  319|    916|}
_ZN5Botan15copy_out_vec_beIjNS_16secure_allocatorIjEEEEvPhmRKNSt3__16vectorIT_T0_EE:
  626|  21.3k|void copy_out_vec_be(uint8_t out[], size_t out_bytes, const std::vector<T, Alloc>& in) {
  627|  21.3k|   copy_out_be(out, out_bytes, in.data());
  628|  21.3k|}
_ZN5Botan11copy_out_beIjEEvPhmPKT_:
  613|  21.3k|void copy_out_be(uint8_t out[], size_t out_bytes, const T in[]) {
  614|   167k|   while(out_bytes >= sizeof(T)) {
  ------------------
  |  Branch (614:10): [True: 146k, False: 21.3k]
  ------------------
  615|   146k|      store_be(in[0], out);
  616|   146k|      out += sizeof(T);
  617|   146k|      out_bytes -= sizeof(T);
  618|   146k|      in += 1;
  619|   146k|   }
  620|       |
  621|  21.3k|   for(size_t i = 0; i != out_bytes; ++i)
  ------------------
  |  Branch (621:22): [True: 0, False: 21.3k]
  ------------------
  622|      0|      out[i] = get_byte_var(i % 8, in[0]);
  623|  21.3k|}
_ZN5Botan15copy_out_vec_beImNS_16secure_allocatorImEEEEvPhmRKNSt3__16vectorIT_T0_EE:
  626|    201|void copy_out_vec_be(uint8_t out[], size_t out_bytes, const std::vector<T, Alloc>& in) {
  627|    201|   copy_out_be(out, out_bytes, in.data());
  628|    201|}
_ZN5Botan11copy_out_beImEEvPhmPKT_:
  613|    201|void copy_out_be(uint8_t out[], size_t out_bytes, const T in[]) {
  614|  1.05k|   while(out_bytes >= sizeof(T)) {
  ------------------
  |  Branch (614:10): [True: 852, False: 201]
  ------------------
  615|    852|      store_be(in[0], out);
  616|    852|      out += sizeof(T);
  617|    852|      out_bytes -= sizeof(T);
  618|    852|      in += 1;
  619|    852|   }
  620|       |
  621|    201|   for(size_t i = 0; i != out_bytes; ++i)
  ------------------
  |  Branch (621:22): [True: 0, False: 201]
  ------------------
  622|      0|      out[i] = get_byte_var(i % 8, in[0]);
  623|    201|}

_ZN5Botan3MD5C2Ev:
   30|     96|      MD5() : MDx_HashFunction(64, false, true), m_M(16), m_digest(4) { clear(); }
_ZNK5Botan3MD54nameEv:
   20|     96|      std::string name() const override { return "MD5"; }
_ZNK5Botan3MD513output_lengthEv:
   22|    374|      size_t output_length() const override { return 16; }

_ZNK5Botan16MDx_HashFunction15hash_block_sizeEv:
   29|    916|      size_t hash_block_size() const override final { return m_buffer.size(); }

_ZNK5Botan14Montgomery_Int19const_time_unpoisonEv:
  124|  1.97k|      void const_time_unpoison() const { return m_v.const_time_unpoison(); }
_ZNK5Botan17Montgomery_Params1pEv:
  148|  3.95k|      const BigInt& p() const { return m_p; }
_ZNK5Botan17Montgomery_Params2R1Ev:
  150|  1.97k|      const BigInt& R1() const { return m_r1; }
_ZNK5Botan17Montgomery_Params2R2Ev:
  152|  1.97k|      const BigInt& R2() const { return m_r2; }
_ZNK5Botan17Montgomery_Params7p_wordsEv:
  158|  16.6k|      size_t p_words() const { return m_p_words; }

_ZN5Botan17monty_exp_vartimeENSt3__110shared_ptrIKNS_17Montgomery_ParamsEEERKNS_6BigIntES7_:
   49|    905|inline BigInt monty_exp_vartime(std::shared_ptr<const Montgomery_Params> params_p, const BigInt& g, const BigInt& k) {
   50|    905|   auto precomputed = monty_precompute(params_p, g, 4, false);
   51|    905|   return monty_execute_vartime(*precomputed, k);
   52|    905|}

_ZN5Botan10word8_sub3EPmPKmS2_m:
  413|  4.63M|inline word word8_sub3(word z[8], const word x[8], const word y[8], word carry) {
  414|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  415|       |   asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "sbbl"))
  416|       |       : [carry] "=r"(carry)
  417|       |       : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry)
  418|       |       : "cc", "memory");
  419|       |
  420|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  421|  4.63M|   asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "sbbq"))
  422|  4.63M|       : [carry] "=r"(carry)
  423|  4.63M|       : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry)
  424|  4.63M|       : "cc", "memory");
  425|       |
  426|       |#else
  427|       |   z[0] = word_sub(x[0], y[0], &carry);
  428|       |   z[1] = word_sub(x[1], y[1], &carry);
  429|       |   z[2] = word_sub(x[2], y[2], &carry);
  430|       |   z[3] = word_sub(x[3], y[3], &carry);
  431|       |   z[4] = word_sub(x[4], y[4], &carry);
  432|       |   z[5] = word_sub(x[5], y[5], &carry);
  433|       |   z[6] = word_sub(x[6], y[6], &carry);
  434|       |   z[7] = word_sub(x[7], y[7], &carry);
  435|       |#endif
  436|       |
  437|  4.63M|   return carry;
  438|  4.63M|}
_ZN5Botan8word_subEmmPm:
  326|  41.7M|inline word word_sub(word x, word y, word* carry) {
  327|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  328|       |   asm(ADD_OR_SUBTRACT(ASM("sbbl %[y],%[x]"))
  329|       |       : [x] "=r"(x), [carry] "=r"(*carry)
  330|       |       : "0"(x), [y] "rm"(y), "1"(*carry)
  331|       |       : "cc");
  332|       |   return x;
  333|       |
  334|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  335|  41.7M|   asm(ADD_OR_SUBTRACT(ASM("sbbq %[y],%[x]"))
  336|  41.7M|       : [x] "=r"(x), [carry] "=r"(*carry)
  337|  41.7M|       : "0"(x), [y] "rm"(y), "1"(*carry)
  338|  41.7M|       : "cc");
  339|  41.7M|   return x;
  340|       |
  341|       |#else
  342|       |   word t0 = x - y;
  343|       |   word c1 = (t0 > x);
  344|       |   word z = t0 - *carry;
  345|       |   *carry = c1 | (z > t0);
  346|       |   return z;
  347|       |#endif
  348|  41.7M|}
_ZN5Botan10word8_add3EPmPKmS2_m:
  296|  22.9k|inline word word8_add3(word z[8], const word x[8], const word y[8], word carry) {
  297|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  298|       |   asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "adcl"))
  299|       |       : [carry] "=r"(carry)
  300|       |       : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry)
  301|       |       : "cc", "memory");
  302|       |
  303|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  304|  22.9k|   asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "adcq"))
  305|  22.9k|       : [carry] "=r"(carry)
  306|  22.9k|       : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry)
  307|  22.9k|       : "cc", "memory");
  308|       |
  309|       |#else
  310|       |   z[0] = word_add(x[0], y[0], &carry);
  311|       |   z[1] = word_add(x[1], y[1], &carry);
  312|       |   z[2] = word_add(x[2], y[2], &carry);
  313|       |   z[3] = word_add(x[3], y[3], &carry);
  314|       |   z[4] = word_add(x[4], y[4], &carry);
  315|       |   z[5] = word_add(x[5], y[5], &carry);
  316|       |   z[6] = word_add(x[6], y[6], &carry);
  317|       |   z[7] = word_add(x[7], y[7], &carry);
  318|       |#endif
  319|       |
  320|  22.9k|   return carry;
  321|  22.9k|}
_ZN5Botan8word_addEmmPm:
  237|  14.5M|inline word word_add(word x, word y, word* carry) {
  238|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  239|       |   asm(ADD_OR_SUBTRACT(ASM("adcl %[y],%[x]"))
  240|       |       : [x] "=r"(x), [carry] "=r"(*carry)
  241|       |       : "0"(x), [y] "rm"(y), "1"(*carry)
  242|       |       : "cc");
  243|       |   return x;
  244|       |
  245|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  246|       |
  247|  14.5M|   asm(ADD_OR_SUBTRACT(ASM("adcq %[y],%[x]"))
  248|  14.5M|       : [x] "=r"(x), [carry] "=r"(*carry)
  249|  14.5M|       : "0"(x), [y] "rm"(y), "1"(*carry)
  250|  14.5M|       : "cc");
  251|  14.5M|   return x;
  252|       |
  253|       |#else
  254|       |   word z = x + y;
  255|       |   word c1 = (z < x);
  256|       |   z += *carry;
  257|       |   *carry = c1 | (z < *carry);
  258|       |   return z;
  259|       |#endif
  260|  14.5M|}
_ZN5Botan10word_madd2EmmPm:
   44|   954k|inline word word_madd2(word a, word b, word* c) {
   45|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
   46|       |   asm(R"(
   47|       |      mull %[b]
   48|       |      addl %[c],%[a]
   49|       |      adcl $0,%[carry]
   50|       |      )"
   51|       |       : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*c)
   52|       |       : "0"(a), "1"(b), [c] "g"(*c)
   53|       |       : "cc");
   54|       |
   55|       |   return a;
   56|       |
   57|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
   58|   954k|   asm(R"(
   59|   954k|      mulq %[b]
   60|   954k|      addq %[c],%[a]
   61|   954k|      adcq $0,%[carry]
   62|   954k|      )"
   63|   954k|       : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*c)
   64|   954k|       : "0"(a), "1"(b), [c] "g"(*c)
   65|   954k|       : "cc");
   66|       |
   67|   954k|   return a;
   68|       |
   69|       |#elif defined(BOTAN_MP_DWORD)
   70|       |   const BOTAN_MP_DWORD s = static_cast<BOTAN_MP_DWORD>(a) * b + *c;
   71|       |   *c = static_cast<word>(s >> BOTAN_MP_WORD_BITS);
   72|       |   return static_cast<word>(s);
   73|       |#else
   74|       |   static_assert(BOTAN_MP_WORD_BITS == 64, "Unexpected word size");
   75|       |
   76|       |   word hi = 0, lo = 0;
   77|       |
   78|       |   mul64x64_128(a, b, &lo, &hi);
   79|       |
   80|       |   lo += *c;
   81|       |   hi += (lo < *c);  // carry?
   82|       |
   83|       |   *c = hi;
   84|       |   return lo;
   85|       |#endif
   86|   954k|}
_ZN5Botan10word_madd3EmmmPm:
   91|  1.92M|inline word word_madd3(word a, word b, word c, word* d) {
   92|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
   93|       |   asm(R"(
   94|       |      mull %[b]
   95|       |
   96|       |      addl %[c],%[a]
   97|       |      adcl $0,%[carry]
   98|       |
   99|       |      addl %[d],%[a]
  100|       |      adcl $0,%[carry]
  101|       |      )"
  102|       |       : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*d)
  103|       |       : "0"(a), "1"(b), [c] "g"(c), [d] "g"(*d)
  104|       |       : "cc");
  105|       |
  106|       |   return a;
  107|       |
  108|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  109|  1.92M|   asm(R"(
  110|  1.92M|      mulq %[b]
  111|  1.92M|
  112|  1.92M|      addq %[c],%[a]
  113|  1.92M|      adcq $0,%[carry]
  114|  1.92M|
  115|  1.92M|      addq %[d],%[a]
  116|  1.92M|      adcq $0,%[carry]
  117|  1.92M|      )"
  118|  1.92M|       : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*d)
  119|  1.92M|       : "0"(a), "1"(b), [c] "g"(c), [d] "g"(*d)
  120|  1.92M|       : "cc");
  121|       |
  122|  1.92M|   return a;
  123|       |
  124|       |#elif defined(BOTAN_MP_DWORD)
  125|       |   const BOTAN_MP_DWORD s = static_cast<BOTAN_MP_DWORD>(a) * b + c + *d;
  126|       |   *d = static_cast<word>(s >> BOTAN_MP_WORD_BITS);
  127|       |   return static_cast<word>(s);
  128|       |#else
  129|       |   static_assert(BOTAN_MP_WORD_BITS == 64, "Unexpected word size");
  130|       |
  131|       |   word hi = 0, lo = 0;
  132|       |
  133|       |   mul64x64_128(a, b, &lo, &hi);
  134|       |
  135|       |   lo += c;
  136|       |   hi += (lo < c);  // carry?
  137|       |
  138|       |   lo += *d;
  139|       |   hi += (lo < *d);  // carry?
  140|       |
  141|       |   *d = hi;
  142|       |   return lo;
  143|       |#endif
  144|  1.92M|}
_ZN5Botan10word8_add2EPmPKmm:
  265|  20.5k|inline word word8_add2(word x[8], const word y[8], word carry) {
  266|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  267|       |   asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "adcl"))
  268|       |       : [carry] "=r"(carry)
  269|       |       : [x] "r"(x), [y] "r"(y), "0"(carry)
  270|       |       : "cc", "memory");
  271|       |
  272|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  273|       |
  274|  20.5k|   asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "adcq"))
  275|  20.5k|       : [carry] "=r"(carry)
  276|  20.5k|       : [x] "r"(x), [y] "r"(y), "0"(carry)
  277|  20.5k|       : "cc", "memory");
  278|       |
  279|       |#else
  280|       |   x[0] = word_add(x[0], y[0], &carry);
  281|       |   x[1] = word_add(x[1], y[1], &carry);
  282|       |   x[2] = word_add(x[2], y[2], &carry);
  283|       |   x[3] = word_add(x[3], y[3], &carry);
  284|       |   x[4] = word_add(x[4], y[4], &carry);
  285|       |   x[5] = word_add(x[5], y[5], &carry);
  286|       |   x[6] = word_add(x[6], y[6], &carry);
  287|       |   x[7] = word_add(x[7], y[7], &carry);
  288|       |#endif
  289|       |
  290|  20.5k|   return carry;
  291|  20.5k|}
_ZN5Botan10word8_sub2EPmPKmm:
  353|  17.3k|inline word word8_sub2(word x[8], const word y[8], word carry) {
  354|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  355|       |   asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "sbbl"))
  356|       |       : [carry] "=r"(carry)
  357|       |       : [x] "r"(x), [y] "r"(y), "0"(carry)
  358|       |       : "cc", "memory");
  359|       |
  360|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  361|  17.3k|   asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "sbbq"))
  362|  17.3k|       : [carry] "=r"(carry)
  363|  17.3k|       : [x] "r"(x), [y] "r"(y), "0"(carry)
  364|  17.3k|       : "cc", "memory");
  365|       |
  366|       |#else
  367|       |   x[0] = word_sub(x[0], y[0], &carry);
  368|       |   x[1] = word_sub(x[1], y[1], &carry);
  369|       |   x[2] = word_sub(x[2], y[2], &carry);
  370|       |   x[3] = word_sub(x[3], y[3], &carry);
  371|       |   x[4] = word_sub(x[4], y[4], &carry);
  372|       |   x[5] = word_sub(x[5], y[5], &carry);
  373|       |   x[6] = word_sub(x[6], y[6], &carry);
  374|       |   x[7] = word_sub(x[7], y[7], &carry);
  375|       |#endif
  376|       |
  377|  17.3k|   return carry;
  378|  17.3k|}
_ZN5Botan14word8_sub2_revEPmPKmm:
  383|    161|inline word word8_sub2_rev(word x[8], const word y[8], word carry) {
  384|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  385|       |   asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "sbbl"))
  386|       |       : [carry] "=r"(carry)
  387|       |       : [x] "r"(y), [y] "r"(x), [z] "r"(x), "0"(carry)
  388|       |       : "cc", "memory");
  389|       |
  390|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  391|    161|   asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "sbbq"))
  392|    161|       : [carry] "=r"(carry)
  393|    161|       : [x] "r"(y), [y] "r"(x), [z] "r"(x), "0"(carry)
  394|    161|       : "cc", "memory");
  395|       |
  396|       |#else
  397|       |   x[0] = word_sub(y[0], x[0], &carry);
  398|       |   x[1] = word_sub(y[1], x[1], &carry);
  399|       |   x[2] = word_sub(y[2], x[2], &carry);
  400|       |   x[3] = word_sub(y[3], x[3], &carry);
  401|       |   x[4] = word_sub(y[4], x[4], &carry);
  402|       |   x[5] = word_sub(y[5], x[5], &carry);
  403|       |   x[6] = word_sub(y[6], x[6], &carry);
  404|       |   x[7] = word_sub(y[7], x[7], &carry);
  405|       |#endif
  406|       |
  407|    161|   return carry;
  408|    161|}
_ZN5Botan13word8_linmul2EPmmm:
  443|  7.32M|inline word word8_linmul2(word x[8], word y, word carry) {
  444|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  445|       |   asm(DO_8_TIMES(LINMUL_OP, "x") : [carry] "=r"(carry) : [x] "r"(x), [y] "rm"(y), "0"(carry) : "cc", "%eax", "%edx");
  446|       |
  447|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  448|  7.32M|   asm(DO_8_TIMES(LINMUL_OP, "x") : [carry] "=r"(carry) : [x] "r"(x), [y] "rm"(y), "0"(carry) : "cc", "%rax", "%rdx");
  449|       |
  450|       |#else
  451|       |   x[0] = word_madd2(x[0], y, &carry);
  452|       |   x[1] = word_madd2(x[1], y, &carry);
  453|       |   x[2] = word_madd2(x[2], y, &carry);
  454|       |   x[3] = word_madd2(x[3], y, &carry);
  455|       |   x[4] = word_madd2(x[4], y, &carry);
  456|       |   x[5] = word_madd2(x[5], y, &carry);
  457|       |   x[6] = word_madd2(x[6], y, &carry);
  458|       |   x[7] = word_madd2(x[7], y, &carry);
  459|       |#endif
  460|       |
  461|  7.32M|   return carry;
  462|  7.32M|}
_ZN5Botan13word8_linmul3EPmPKmmm:
  467|  9.52k|inline word word8_linmul3(word z[8], const word x[8], word y, word carry) {
  468|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  469|       |   asm(DO_8_TIMES(LINMUL_OP, "z")
  470|       |       : [carry] "=r"(carry)
  471|       |       : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry)
  472|       |       : "cc", "%eax", "%edx");
  473|       |
  474|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  475|  9.52k|   asm(DO_8_TIMES(LINMUL_OP, "z")
  476|  9.52k|       : [carry] "=r"(carry)
  477|  9.52k|       : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry)
  478|  9.52k|       : "cc", "%rax", "%rdx");
  479|       |
  480|       |#else
  481|       |   z[0] = word_madd2(x[0], y, &carry);
  482|       |   z[1] = word_madd2(x[1], y, &carry);
  483|       |   z[2] = word_madd2(x[2], y, &carry);
  484|       |   z[3] = word_madd2(x[3], y, &carry);
  485|       |   z[4] = word_madd2(x[4], y, &carry);
  486|       |   z[5] = word_madd2(x[5], y, &carry);
  487|       |   z[6] = word_madd2(x[6], y, &carry);
  488|       |   z[7] = word_madd2(x[7], y, &carry);
  489|       |#endif
  490|       |
  491|  9.52k|   return carry;
  492|  9.52k|}
_ZN5Botan11word8_madd3EPmPKmmm:
  497|   520k|inline word word8_madd3(word z[8], const word x[8], word y, word carry) {
  498|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  499|       |   asm(DO_8_TIMES(MULADD_OP, "")
  500|       |       : [carry] "=r"(carry)
  501|       |       : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry)
  502|       |       : "cc", "%eax", "%edx");
  503|       |
  504|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  505|   520k|   asm(DO_8_TIMES(MULADD_OP, "")
  506|   520k|       : [carry] "=r"(carry)
  507|   520k|       : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry)
  508|   520k|       : "cc", "%rax", "%rdx");
  509|       |
  510|       |#else
  511|       |   z[0] = word_madd3(x[0], y, z[0], &carry);
  512|       |   z[1] = word_madd3(x[1], y, z[1], &carry);
  513|       |   z[2] = word_madd3(x[2], y, z[2], &carry);
  514|       |   z[3] = word_madd3(x[3], y, z[3], &carry);
  515|       |   z[4] = word_madd3(x[4], y, z[4], &carry);
  516|       |   z[5] = word_madd3(x[5], y, z[5], &carry);
  517|       |   z[6] = word_madd3(x[6], y, z[6], &carry);
  518|       |   z[7] = word_madd3(x[7], y, z[7], &carry);
  519|       |#endif
  520|       |
  521|   520k|   return carry;
  522|   520k|}
_ZN5Botan12word3_muladdEPmS0_S0_mm:
  528|  29.8M|inline void word3_muladd(word* w2, word* w1, word* w0, word x, word y) {
  529|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  530|       |   word z0 = 0, z1 = 0;
  531|       |
  532|       |   asm("mull %[y]" : "=a"(z0), "=d"(z1) : "a"(x), [y] "rm"(y) : "cc");
  533|       |
  534|       |   asm(R"(
  535|       |       addl %[z0],%[w0]
  536|       |       adcl %[z1],%[w1]
  537|       |       adcl $0,%[w2]
  538|       |       )"
  539|       |       : [w0] "=r"(*w0), [w1] "=r"(*w1), [w2] "=r"(*w2)
  540|       |       : [z0] "r"(z0), [z1] "r"(z1), "0"(*w0), "1"(*w1), "2"(*w2)
  541|       |       : "cc");
  542|       |
  543|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  544|  29.8M|   word z0 = 0, z1 = 0;
  545|       |
  546|  29.8M|   asm("mulq %[y]" : "=a"(z0), "=d"(z1) : "a"(x), [y] "rm"(y) : "cc");
  547|       |
  548|  29.8M|   asm(R"(
  549|  29.8M|       addq %[z0],%[w0]
  550|  29.8M|       adcq %[z1],%[w1]
  551|  29.8M|       adcq $0,%[w2]
  552|  29.8M|       )"
  553|  29.8M|       : [w0] "=r"(*w0), [w1] "=r"(*w1), [w2] "=r"(*w2)
  554|  29.8M|       : [z0] "r"(z0), [z1] "r"(z1), "0"(*w0), "1"(*w1), "2"(*w2)
  555|  29.8M|       : "cc");
  556|       |
  557|       |#else
  558|       |   word carry = *w0;
  559|       |   *w0 = word_madd2(x, y, &carry);
  560|       |   *w1 += carry;
  561|       |   *w2 += (*w1 < carry);
  562|       |#endif
  563|  29.8M|}
_ZN5Botan9word3_addEPmS0_S0_m:
  569|  2.89M|inline void word3_add(word* w2, word* w1, word* w0, word x) {
  570|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  571|       |   asm(R"(
  572|       |      addl %[x],%[w0]
  573|       |      adcl $0,%[w1]
  574|       |      adcl $0,%[w2]
  575|       |      )"
  576|       |       : [w0] "=r"(*w0), [w1] "=r"(*w1), [w2] "=r"(*w2)
  577|       |       : [x] "r"(x), "0"(*w0), "1"(*w1), "2"(*w2)
  578|       |       : "cc");
  579|       |
  580|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  581|  2.89M|   asm(R"(
  582|  2.89M|      addq %[x],%[w0]
  583|  2.89M|      adcq $0,%[w1]
  584|  2.89M|      adcq $0,%[w2]
  585|  2.89M|      )"
  586|  2.89M|       : [w0] "=r"(*w0), [w1] "=r"(*w1), [w2] "=r"(*w2)
  587|  2.89M|       : [x] "r"(x), "0"(*w0), "1"(*w1), "2"(*w2)
  588|  2.89M|       : "cc");
  589|       |
  590|       |#else
  591|       |   *w0 += x;
  592|       |   word c1 = (*w0 < x);
  593|       |   *w1 += c1;
  594|       |   word c2 = (*w1 < c1);
  595|       |   *w2 += c2;
  596|       |#endif
  597|  2.89M|}
_ZN5Botan14word3_muladd_2EPmS0_S0_mm:
  603|  5.71M|inline void word3_muladd_2(word* w2, word* w1, word* w0, word x, word y) {
  604|       |#if defined(BOTAN_MP_USE_X86_32_ASM)
  605|       |   word z0 = 0, z1 = 0;
  606|       |
  607|       |   asm("mull %[y]" : "=a"(z0), "=d"(z1) : "a"(x), [y] "rm"(y) : "cc");
  608|       |
  609|       |   asm(R"(
  610|       |      addl %[z0],%[w0]
  611|       |      adcl %[z1],%[w1]
  612|       |      adcl $0,%[w2]
  613|       |
  614|       |      addl %[z0],%[w0]
  615|       |      adcl %[z1],%[w1]
  616|       |      adcl $0,%[w2]
  617|       |      )"
  618|       |       : [w0] "=r"(*w0), [w1] "=r"(*w1), [w2] "=r"(*w2)
  619|       |       : [z0] "r"(z0), [z1] "r"(z1), "0"(*w0), "1"(*w1), "2"(*w2)
  620|       |       : "cc");
  621|       |
  622|       |#elif defined(BOTAN_MP_USE_X86_64_ASM)
  623|  5.71M|   word z0 = 0, z1 = 0;
  624|       |
  625|  5.71M|   asm("mulq %[y]" : "=a"(z0), "=d"(z1) : "a"(x), [y] "rm"(y) : "cc");
  626|       |
  627|  5.71M|   asm(R"(
  628|  5.71M|      addq %[z0],%[w0]
  629|  5.71M|      adcq %[z1],%[w1]
  630|  5.71M|      adcq $0,%[w2]
  631|  5.71M|
  632|  5.71M|      addq %[z0],%[w0]
  633|  5.71M|      adcq %[z1],%[w1]
  634|  5.71M|      adcq $0,%[w2]
  635|  5.71M|      )"
  636|  5.71M|       : [w0] "=r"(*w0), [w1] "=r"(*w1), [w2] "=r"(*w2)
  637|  5.71M|       : [z0] "r"(z0), [z1] "r"(z1), "0"(*w0), "1"(*w1), "2"(*w2)
  638|  5.71M|       : "cc");
  639|       |
  640|       |#else
  641|       |   word carry = 0;
  642|       |   x = word_madd2(x, y, &carry);
  643|       |   y = carry;
  644|       |
  645|       |   word top = (y >> (BOTAN_MP_WORD_BITS - 1));
  646|       |   y <<= 1;
  647|       |   y |= (x >> (BOTAN_MP_WORD_BITS - 1));
  648|       |   x <<= 1;
  649|       |
  650|       |   carry = 0;
  651|       |   *w0 = word_add(*w0, x, &carry);
  652|       |   *w1 = word_add(*w1, y, &carry);
  653|       |   *w2 = word_add(*w2, top, &carry);
  654|       |#endif
  655|  5.71M|}

_ZN5Botan10bigint_cmpEPKmmS1_m:
  468|   156k|inline int32_t bigint_cmp(const word x[], size_t x_size, const word y[], size_t y_size) {
  469|   156k|   static_assert(sizeof(word) >= sizeof(uint32_t), "Size assumption");
  470|       |
  471|   156k|   const word LT = static_cast<word>(-1);
  472|   156k|   const word EQ = 0;
  473|   156k|   const word GT = 1;
  474|       |
  475|   156k|   const size_t common_elems = std::min(x_size, y_size);
  476|       |
  477|   156k|   word result = EQ;  // until found otherwise
  478|       |
  479|   784k|   for(size_t i = 0; i != common_elems; i++) {
  ------------------
  |  Branch (479:22): [True: 628k, False: 156k]
  ------------------
  480|   628k|      const auto is_eq = CT::Mask<word>::is_equal(x[i], y[i]);
  481|   628k|      const auto is_lt = CT::Mask<word>::is_lt(x[i], y[i]);
  482|       |
  483|   628k|      result = is_eq.select(result, is_lt.select(LT, GT));
  484|   628k|   }
  485|       |
  486|   156k|   if(x_size < y_size) {
  ------------------
  |  Branch (486:7): [True: 12.7k, False: 143k]
  ------------------
  487|  12.7k|      word mask = 0;
  488|  89.3k|      for(size_t i = x_size; i != y_size; i++)
  ------------------
  |  Branch (488:30): [True: 76.5k, False: 12.7k]
  ------------------
  489|  76.5k|         mask |= y[i];
  490|       |
  491|       |      // If any bits were set in high part of y, then x < y
  492|  12.7k|      result = CT::Mask<word>::is_zero(mask).select(result, LT);
  493|   143k|   } else if(y_size < x_size) {
  ------------------
  |  Branch (493:14): [True: 607, False: 143k]
  ------------------
  494|    607|      word mask = 0;
  495|  4.30k|      for(size_t i = y_size; i != x_size; i++)
  ------------------
  |  Branch (495:30): [True: 3.70k, False: 607]
  ------------------
  496|  3.70k|         mask |= x[i];
  497|       |
  498|       |      // If any bits were set in high part of x, then x > y
  499|    607|      result = CT::Mask<word>::is_zero(mask).select(result, GT);
  500|    607|   }
  501|       |
  502|   156k|   CT::unpoison(result);
  503|   156k|   BOTAN_DEBUG_ASSERT(result == LT || result == GT || result == EQ);
  ------------------
  |  |   99|   156k|      do {                          \
  |  |  100|   156k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  504|   156k|   return static_cast<int32_t>(result);
  505|   156k|}
_ZN5Botan15bigint_ct_is_eqEPKmmS1_m:
  542|  5.58k|inline CT::Mask<word> bigint_ct_is_eq(const word x[], size_t x_size, const word y[], size_t y_size) {
  543|  5.58k|   const size_t common_elems = std::min(x_size, y_size);
  544|       |
  545|  5.58k|   word diff = 0;
  546|       |
  547|  22.4k|   for(size_t i = 0; i != common_elems; i++) {
  ------------------
  |  Branch (547:22): [True: 16.8k, False: 5.58k]
  ------------------
  548|  16.8k|      diff |= (x[i] ^ y[i]);
  549|  16.8k|   }
  550|       |
  551|       |   // If any bits were set in high part of x/y, then they are not equal
  552|  5.58k|   if(x_size < y_size) {
  ------------------
  |  Branch (552:7): [True: 21, False: 5.56k]
  ------------------
  553|     67|      for(size_t i = x_size; i != y_size; i++)
  ------------------
  |  Branch (553:30): [True: 46, False: 21]
  ------------------
  554|     46|         diff |= y[i];
  555|  5.56k|   } else if(y_size < x_size) {
  ------------------
  |  Branch (555:14): [True: 31, False: 5.53k]
  ------------------
  556|     86|      for(size_t i = y_size; i != x_size; i++)
  ------------------
  |  Branch (556:30): [True: 55, False: 31]
  ------------------
  557|     55|         diff |= x[i];
  558|     31|   }
  559|       |
  560|  5.58k|   return CT::Mask<word>::is_zero(diff);
  561|  5.58k|}
_ZN5Botan15bigint_ct_is_ltEPKmmS1_mb:
  513|  1.04M|   const word x[], size_t x_size, const word y[], size_t y_size, bool lt_or_equal = false) {
  514|  1.04M|   const size_t common_elems = std::min(x_size, y_size);
  515|       |
  516|  1.04M|   auto is_lt = CT::Mask<word>::expand(lt_or_equal);
  517|       |
  518|  4.80M|   for(size_t i = 0; i != common_elems; i++) {
  ------------------
  |  Branch (518:22): [True: 3.75M, False: 1.04M]
  ------------------
  519|  3.75M|      const auto eq = CT::Mask<word>::is_equal(x[i], y[i]);
  520|  3.75M|      const auto lt = CT::Mask<word>::is_lt(x[i], y[i]);
  521|  3.75M|      is_lt = eq.select_mask(is_lt, lt);
  522|  3.75M|   }
  523|       |
  524|  1.04M|   if(x_size < y_size) {
  ------------------
  |  Branch (524:7): [True: 3.28k, False: 1.04M]
  ------------------
  525|  3.28k|      word mask = 0;
  526|  29.8k|      for(size_t i = x_size; i != y_size; i++)
  ------------------
  |  Branch (526:30): [True: 26.5k, False: 3.28k]
  ------------------
  527|  26.5k|         mask |= y[i];
  528|       |      // If any bits were set in high part of y, then is_lt should be forced true
  529|  3.28k|      is_lt |= CT::Mask<word>::expand(mask);
  530|  1.04M|   } else if(y_size < x_size) {
  ------------------
  |  Branch (530:14): [True: 5.39k, False: 1.04M]
  ------------------
  531|  5.39k|      word mask = 0;
  532|  20.2k|      for(size_t i = y_size; i != x_size; i++)
  ------------------
  |  Branch (532:30): [True: 14.8k, False: 5.39k]
  ------------------
  533|  14.8k|         mask |= x[i];
  534|       |
  535|       |      // If any bits were set in high part of x, then is_lt should be false
  536|  5.39k|      is_lt &= CT::Mask<word>::is_zero(mask);
  537|  5.39k|   }
  538|       |
  539|  1.04M|   return is_lt;
  540|  1.04M|}
_ZN5Botan11bigint_sub3EPmPKmmS2_m:
  308|  4.69M|inline word bigint_sub3(word z[], const word x[], size_t x_size, const word y[], size_t y_size) {
  309|  4.69M|   word borrow = 0;
  310|       |
  311|  4.69M|   BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
  ------------------
  |  |   51|  4.69M|   do {                                                                                 \
  |  |   52|  4.69M|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 4.69M]
  |  |  ------------------
  |  |   53|  4.69M|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|  4.69M|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  312|       |
  313|  4.69M|   const size_t blocks = y_size - (y_size % 8);
  314|       |
  315|  9.30M|   for(size_t i = 0; i != blocks; i += 8)
  ------------------
  |  Branch (315:22): [True: 4.60M, False: 4.69M]
  ------------------
  316|  4.60M|      borrow = word8_sub3(z + i, x + i, y + i, borrow);
  317|       |
  318|  20.3M|   for(size_t i = blocks; i != y_size; ++i)
  ------------------
  |  Branch (318:27): [True: 15.7M, False: 4.69M]
  ------------------
  319|  15.7M|      z[i] = word_sub(x[i], y[i], &borrow);
  320|       |
  321|  18.7M|   for(size_t i = y_size; i != x_size; ++i)
  ------------------
  |  Branch (321:27): [True: 14.0M, False: 4.69M]
  ------------------
  322|  14.0M|      z[i] = word_sub(x[i], 0, &borrow);
  323|       |
  324|  4.69M|   return borrow;
  325|  4.69M|}
_ZN5Botan14bigint_cnd_addEmPmmPKmm:
   40|  2.06M|inline word bigint_cnd_add(word cnd, word x[], word x_size, const word y[], size_t y_size) {
   41|  2.06M|   BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
  ------------------
  |  |   51|  2.06M|   do {                                                                                 \
  |  |   52|  2.06M|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 2.06M]
  |  |  ------------------
  |  |   53|  2.06M|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|  2.06M|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   42|       |
   43|  2.06M|   const auto mask = CT::Mask<word>::expand(cnd);
   44|       |
   45|  2.06M|   word carry = 0;
   46|       |
   47|  2.06M|   const size_t blocks = y_size - (y_size % 8);
   48|  2.06M|   word z[8] = {0};
   49|       |
   50|  2.06M|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (50:22): [True: 0, False: 2.06M]
  ------------------
   51|      0|      carry = word8_add3(z, x + i, y + i, carry);
   52|      0|      mask.select_n(x + i, z, x + i, 8);
   53|      0|   }
   54|       |
   55|  10.1M|   for(size_t i = blocks; i != y_size; ++i) {
  ------------------
  |  Branch (55:27): [True: 8.09M, False: 2.06M]
  ------------------
   56|  8.09M|      z[0] = word_add(x[i], y[i], &carry);
   57|  8.09M|      x[i] = mask.select(z[0], x[i]);
   58|  8.09M|   }
   59|       |
   60|  3.50M|   for(size_t i = y_size; i != x_size; ++i) {
  ------------------
  |  Branch (60:27): [True: 1.44M, False: 2.06M]
  ------------------
   61|  1.44M|      z[0] = word_add(x[i], 0, &carry);
   62|  1.44M|      x[i] = mask.select(z[0], x[i]);
   63|  1.44M|   }
   64|       |
   65|  2.06M|   return mask.if_set_return(carry);
   66|  2.06M|}
_ZN5Botan15bigint_cnd_swapEmPmS0_m:
   29|  2.65M|inline void bigint_cnd_swap(word cnd, word x[], word y[], size_t size) {
   30|  2.65M|   const auto mask = CT::Mask<word>::expand(cnd);
   31|       |
   32|  59.5M|   for(size_t i = 0; i != size; ++i) {
  ------------------
  |  Branch (32:22): [True: 56.9M, False: 2.65M]
  ------------------
   33|  56.9M|      const word a = x[i];
   34|  56.9M|      const word b = y[i];
   35|  56.9M|      x[i] = mask.select(b, a);
   36|  56.9M|      y[i] = mask.select(a, b);
   37|  56.9M|   }
   38|  2.65M|}
_ZN5Botan14bigint_cnd_addEmPmPKmm:
   72|   616k|inline word bigint_cnd_add(word cnd, word x[], const word y[], size_t size) {
   73|   616k|   return bigint_cnd_add(cnd, x, size, y, size);
   74|   616k|}
_ZN5Botan14bigint_cnd_subEmPmmPKmm:
   80|   411k|inline word bigint_cnd_sub(word cnd, word x[], size_t x_size, const word y[], size_t y_size) {
   81|   411k|   BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
  ------------------
  |  |   51|   411k|   do {                                                                                 \
  |  |   52|   411k|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 411k]
  |  |  ------------------
  |  |   53|   411k|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|   411k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   82|       |
   83|   411k|   const auto mask = CT::Mask<word>::expand(cnd);
   84|       |
   85|   411k|   word carry = 0;
   86|       |
   87|   411k|   const size_t blocks = y_size - (y_size % 8);
   88|   411k|   word z[8] = {0};
   89|       |
   90|   411k|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (90:22): [True: 0, False: 411k]
  ------------------
   91|      0|      carry = word8_sub3(z, x + i, y + i, carry);
   92|      0|      mask.select_n(x + i, z, x + i, 8);
   93|      0|   }
   94|       |
   95|  1.99M|   for(size_t i = blocks; i != y_size; ++i) {
  ------------------
  |  Branch (95:27): [True: 1.58M, False: 411k]
  ------------------
   96|  1.58M|      z[0] = word_sub(x[i], y[i], &carry);
   97|  1.58M|      x[i] = mask.select(z[0], x[i]);
   98|  1.58M|   }
   99|       |
  100|   411k|   for(size_t i = y_size; i != x_size; ++i) {
  ------------------
  |  Branch (100:27): [True: 0, False: 411k]
  ------------------
  101|      0|      z[0] = word_sub(x[i], 0, &carry);
  102|      0|      x[i] = mask.select(z[0], x[i]);
  103|      0|   }
  104|       |
  105|   411k|   return mask.if_set_return(carry);
  106|   411k|}
_ZN5Botan14bigint_cnd_subEmPmPKmm:
  112|   411k|inline word bigint_cnd_sub(word cnd, word x[], const word y[], size_t size) {
  113|   411k|   return bigint_cnd_sub(cnd, x, size, y, size);
  114|   411k|}
_ZN5Botan21bigint_cnd_add_or_subENS_2CT4MaskImEEPmPKmm:
  123|  1.41k|inline void bigint_cnd_add_or_sub(CT::Mask<word> mask, word x[], const word y[], size_t size) {
  124|  1.41k|   const size_t blocks = size - (size % 8);
  125|       |
  126|  1.41k|   word carry = 0;
  127|  1.41k|   word borrow = 0;
  128|       |
  129|  1.41k|   word t0[8] = {0};
  130|  1.41k|   word t1[8] = {0};
  131|       |
  132|  10.5k|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (132:22): [True: 9.10k, False: 1.41k]
  ------------------
  133|  9.10k|      carry = word8_add3(t0, x + i, y + i, carry);
  134|  9.10k|      borrow = word8_sub3(t1, x + i, y + i, borrow);
  135|       |
  136|  81.9k|      for(size_t j = 0; j != 8; ++j)
  ------------------
  |  Branch (136:25): [True: 72.8k, False: 9.10k]
  ------------------
  137|  72.8k|         x[i + j] = mask.select(t0[j], t1[j]);
  138|  9.10k|   }
  139|       |
  140|  4.23k|   for(size_t i = blocks; i != size; ++i) {
  ------------------
  |  Branch (140:27): [True: 2.82k, False: 1.41k]
  ------------------
  141|  2.82k|      const word a = word_add(x[i], y[i], &carry);
  142|  2.82k|      const word s = word_sub(x[i], y[i], &borrow);
  143|       |
  144|  2.82k|      x[i] = mask.select(a, s);
  145|  2.82k|   }
  146|  1.41k|}
_ZN5Botan17bigint_cnd_addsubENS_2CT4MaskImEEPmPKmS5_m:
  157|   720k|inline word bigint_cnd_addsub(CT::Mask<word> mask, word x[], const word y[], const word z[], size_t size) {
  158|   720k|   const size_t blocks = size - (size % 8);
  159|       |
  160|   720k|   word carry = 0;
  161|   720k|   word borrow = 0;
  162|       |
  163|   720k|   word t0[8] = {0};
  164|   720k|   word t1[8] = {0};
  165|       |
  166|   720k|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (166:22): [True: 0, False: 720k]
  ------------------
  167|      0|      carry = word8_add3(t0, x + i, y + i, carry);
  168|      0|      borrow = word8_sub3(t1, x + i, z + i, borrow);
  169|       |
  170|      0|      for(size_t j = 0; j != 8; ++j)
  ------------------
  |  Branch (170:25): [True: 0, False: 0]
  ------------------
  171|      0|         x[i + j] = mask.select(t0[j], t1[j]);
  172|      0|   }
  173|       |
  174|  3.58M|   for(size_t i = blocks; i != size; ++i) {
  ------------------
  |  Branch (174:27): [True: 2.86M, False: 720k]
  ------------------
  175|  2.86M|      t0[0] = word_add(x[i], y[i], &carry);
  176|  2.86M|      t1[0] = word_sub(x[i], z[i], &borrow);
  177|  2.86M|      x[i] = mask.select(t0[0], t1[0]);
  178|  2.86M|   }
  179|       |
  180|   720k|   return mask.select(carry, borrow);
  181|   720k|}
_ZN5Botan14bigint_cnd_absEmPmm:
  188|   205k|inline void bigint_cnd_abs(word cnd, word x[], size_t size) {
  189|   205k|   const auto mask = CT::Mask<word>::expand(cnd);
  190|       |
  191|   205k|   word carry = mask.if_set_return(1);
  192|   998k|   for(size_t i = 0; i != size; ++i) {
  ------------------
  |  Branch (192:22): [True: 793k, False: 205k]
  ------------------
  193|   793k|      const word z = word_add(~x[i], 0, &carry);
  194|   793k|      x[i] = mask.select(z, x[i]);
  195|   793k|   }
  196|   205k|}
_ZN5Botan14bigint_add2_ncEPmmPKmm:
  201|  95.3k|inline word bigint_add2_nc(word x[], size_t x_size, const word y[], size_t y_size) {
  202|  95.3k|   word carry = 0;
  203|       |
  204|  95.3k|   BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
  ------------------
  |  |   51|  95.3k|   do {                                                                                 \
  |  |   52|  95.3k|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 95.3k]
  |  |  ------------------
  |  |   53|  95.3k|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|  95.3k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  205|       |
  206|  95.3k|   const size_t blocks = y_size - (y_size % 8);
  207|       |
  208|   115k|   for(size_t i = 0; i != blocks; i += 8)
  ------------------
  |  Branch (208:22): [True: 20.5k, False: 95.3k]
  ------------------
  209|  20.5k|      carry = word8_add2(x + i, y + i, carry);
  210|       |
  211|   157k|   for(size_t i = blocks; i != y_size; ++i)
  ------------------
  |  Branch (211:27): [True: 62.1k, False: 95.3k]
  ------------------
  212|  62.1k|      x[i] = word_add(x[i], y[i], &carry);
  213|       |
  214|   981k|   for(size_t i = y_size; i != x_size; ++i)
  ------------------
  |  Branch (214:27): [True: 886k, False: 95.3k]
  ------------------
  215|   886k|      x[i] = word_add(x[i], 0, &carry);
  216|       |
  217|  95.3k|   return carry;
  218|  95.3k|}
_ZN5Botan14bigint_add3_ncEPmPKmmS2_m:
  223|  92.3k|inline word bigint_add3_nc(word z[], const word x[], size_t x_size, const word y[], size_t y_size) {
  224|  92.3k|   if(x_size < y_size) {
  ------------------
  |  Branch (224:7): [True: 289, False: 92.0k]
  ------------------
  225|    289|      return bigint_add3_nc(z, y, y_size, x, x_size);
  226|    289|   }
  227|       |
  228|  92.0k|   word carry = 0;
  229|       |
  230|  92.0k|   const size_t blocks = y_size - (y_size % 8);
  231|       |
  232|   105k|   for(size_t i = 0; i != blocks; i += 8)
  ------------------
  |  Branch (232:22): [True: 13.8k, False: 92.0k]
  ------------------
  233|  13.8k|      carry = word8_add3(z + i, x + i, y + i, carry);
  234|       |
  235|   452k|   for(size_t i = blocks; i != y_size; ++i)
  ------------------
  |  Branch (235:27): [True: 360k, False: 92.0k]
  ------------------
  236|   360k|      z[i] = word_add(x[i], y[i], &carry);
  237|       |
  238|  97.0k|   for(size_t i = y_size; i != x_size; ++i)
  ------------------
  |  Branch (238:27): [True: 5.06k, False: 92.0k]
  ------------------
  239|  5.06k|      z[i] = word_add(x[i], 0, &carry);
  240|       |
  241|  92.0k|   return carry;
  242|  92.3k|}
_ZN5Botan11bigint_add2EPmmPKmm:
  251|  84.6k|inline void bigint_add2(word x[], size_t x_size, const word y[], size_t y_size) {
  252|  84.6k|   x[x_size] += bigint_add2_nc(x, x_size, y, y_size);
  253|  84.6k|}
_ZN5Botan11bigint_add3EPmPKmmS2_m:
  258|  7.68k|inline void bigint_add3(word z[], const word x[], size_t x_size, const word y[], size_t y_size) {
  259|  7.68k|   z[x_size > y_size ? x_size : y_size] += bigint_add3_nc(z, x, x_size, y, y_size);
  ------------------
  |  Branch (259:6): [True: 2.86k, False: 4.82k]
  ------------------
  260|  7.68k|}
_ZN5Botan11bigint_sub2EPmmPKmm:
  265|  1.52M|inline word bigint_sub2(word x[], size_t x_size, const word y[], size_t y_size) {
  266|  1.52M|   word borrow = 0;
  267|       |
  268|  1.52M|   BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
  ------------------
  |  |   51|  1.52M|   do {                                                                                 \
  |  |   52|  1.52M|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 1.52M]
  |  |  ------------------
  |  |   53|  1.52M|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|  1.52M|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  269|       |
  270|  1.52M|   const size_t blocks = y_size - (y_size % 8);
  271|       |
  272|  1.53M|   for(size_t i = 0; i != blocks; i += 8)
  ------------------
  |  Branch (272:22): [True: 17.3k, False: 1.52M]
  ------------------
  273|  17.3k|      borrow = word8_sub2(x + i, y + i, borrow);
  274|       |
  275|  7.53M|   for(size_t i = blocks; i != y_size; ++i)
  ------------------
  |  Branch (275:27): [True: 6.01M, False: 1.52M]
  ------------------
  276|  6.01M|      x[i] = word_sub(x[i], y[i], &borrow);
  277|       |
  278|  3.00M|   for(size_t i = y_size; i != x_size; ++i)
  ------------------
  |  Branch (278:27): [True: 1.48M, False: 1.52M]
  ------------------
  279|  1.48M|      x[i] = word_sub(x[i], 0, &borrow);
  280|       |
  281|  1.52M|   return borrow;
  282|  1.52M|}
_ZN5Botan15bigint_sub2_revEPmPKmm:
  287|    109|inline void bigint_sub2_rev(word x[], const word y[], size_t y_size) {
  288|    109|   word borrow = 0;
  289|       |
  290|    109|   const size_t blocks = y_size - (y_size % 8);
  291|       |
  292|    270|   for(size_t i = 0; i != blocks; i += 8)
  ------------------
  |  Branch (292:22): [True: 161, False: 109]
  ------------------
  293|    161|      borrow = word8_sub2_rev(x + i, y + i, borrow);
  294|       |
  295|    403|   for(size_t i = blocks; i != y_size; ++i)
  ------------------
  |  Branch (295:27): [True: 294, False: 109]
  ------------------
  296|    294|      x[i] = word_sub(y[i], x[i], &borrow);
  297|       |
  298|    109|   BOTAN_ASSERT(borrow == 0, "y must be greater than x");
  ------------------
  |  |   51|    109|   do {                                                                                 \
  |  |   52|    109|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 109]
  |  |  ------------------
  |  |   53|    109|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|    109|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  299|    109|}
_ZN5Botan14bigint_sub_absEPmPKmS2_mS0_:
  339|  4.85k|inline CT::Mask<word> bigint_sub_abs(word z[], const word x[], const word y[], size_t N, word ws[]) {
  340|       |   // Subtract in both direction then conditional copy out the result
  341|       |
  342|  4.85k|   word* ws0 = ws;
  343|  4.85k|   word* ws1 = ws + N;
  344|       |
  345|  4.85k|   word borrow0 = 0;
  346|  4.85k|   word borrow1 = 0;
  347|       |
  348|  4.85k|   const size_t blocks = N - (N % 8);
  349|       |
  350|  14.5k|   for(size_t i = 0; i != blocks; i += 8) {
  ------------------
  |  Branch (350:22): [True: 9.71k, False: 4.85k]
  ------------------
  351|  9.71k|      borrow0 = word8_sub3(ws0 + i, x + i, y + i, borrow0);
  352|  9.71k|      borrow1 = word8_sub3(ws1 + i, y + i, x + i, borrow1);
  353|  9.71k|   }
  354|       |
  355|  13.7k|   for(size_t i = blocks; i != N; ++i) {
  ------------------
  |  Branch (355:27): [True: 8.90k, False: 4.85k]
  ------------------
  356|  8.90k|      ws0[i] = word_sub(x[i], y[i], &borrow0);
  357|  8.90k|      ws1[i] = word_sub(y[i], x[i], &borrow1);
  358|  8.90k|   }
  359|       |
  360|  4.85k|   return CT::conditional_copy_mem(borrow0, z, ws1, ws0, N);
  361|  4.85k|}
_ZN5Botan11bigint_shl1EPmmmmm:
  366|   129k|inline void bigint_shl1(word x[], size_t x_size, size_t x_words, size_t word_shift, size_t bit_shift) {
  367|   129k|   copy_mem(x + word_shift, x, x_words);
  368|   129k|   clear_mem(x, word_shift);
  369|       |
  370|   129k|   const auto carry_mask = CT::Mask<word>::expand(bit_shift);
  371|   129k|   const size_t carry_shift = carry_mask.if_set_return(BOTAN_MP_WORD_BITS - bit_shift);
  ------------------
  |  |   50|   129k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  372|       |
  373|   129k|   word carry = 0;
  374|   585k|   for(size_t i = word_shift; i != x_size; ++i) {
  ------------------
  |  Branch (374:31): [True: 456k, False: 129k]
  ------------------
  375|   456k|      const word w = x[i];
  376|   456k|      x[i] = (w << bit_shift) | carry;
  377|   456k|      carry = carry_mask.if_set_return(w >> carry_shift);
  378|   456k|   }
  379|   129k|}
_ZN5Botan11bigint_shr1EPmmmm:
  381|   653k|inline void bigint_shr1(word x[], size_t x_size, size_t word_shift, size_t bit_shift) {
  382|   653k|   const size_t top = x_size >= word_shift ? (x_size - word_shift) : 0;
  ------------------
  |  Branch (382:23): [True: 652k, False: 124]
  ------------------
  383|       |
  384|   653k|   if(top > 0)
  ------------------
  |  Branch (384:7): [True: 652k, False: 136]
  ------------------
  385|   652k|      copy_mem(x, x + word_shift, top);
  386|   653k|   clear_mem(x + top, std::min(word_shift, x_size));
  387|       |
  388|   653k|   const auto carry_mask = CT::Mask<word>::expand(bit_shift);
  389|   653k|   const size_t carry_shift = carry_mask.if_set_return(BOTAN_MP_WORD_BITS - bit_shift);
  ------------------
  |  |   50|   653k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  390|       |
  391|   653k|   word carry = 0;
  392|       |
  393|  4.38M|   for(size_t i = 0; i != top; ++i) {
  ------------------
  |  Branch (393:22): [True: 3.73M, False: 653k]
  ------------------
  394|  3.73M|      const word w = x[top - i - 1];
  395|  3.73M|      x[top - i - 1] = (w >> bit_shift) | carry;
  396|  3.73M|      carry = carry_mask.if_set_return(w << carry_shift);
  397|  3.73M|   }
  398|   653k|}
_ZN5Botan11bigint_shl2EPmPKmmmm:
  400|  64.6k|inline void bigint_shl2(word y[], const word x[], size_t x_size, size_t word_shift, size_t bit_shift) {
  401|  64.6k|   copy_mem(y + word_shift, x, x_size);
  402|       |
  403|  64.6k|   const auto carry_mask = CT::Mask<word>::expand(bit_shift);
  404|  64.6k|   const size_t carry_shift = carry_mask.if_set_return(BOTAN_MP_WORD_BITS - bit_shift);
  ------------------
  |  |   50|  64.6k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  405|       |
  406|  64.6k|   word carry = 0;
  407|   320k|   for(size_t i = word_shift; i != x_size + word_shift + 1; ++i) {
  ------------------
  |  Branch (407:31): [True: 255k, False: 64.6k]
  ------------------
  408|   255k|      const word w = y[i];
  409|   255k|      y[i] = (w << bit_shift) | carry;
  410|   255k|      carry = carry_mask.if_set_return(w >> carry_shift);
  411|   255k|   }
  412|  64.6k|}
_ZN5Botan11bigint_shr2EPmPKmmmm:
  414|    905|inline void bigint_shr2(word y[], const word x[], size_t x_size, size_t word_shift, size_t bit_shift) {
  415|    905|   const size_t new_size = x_size < word_shift ? 0 : (x_size - word_shift);
  ------------------
  |  Branch (415:28): [True: 0, False: 905]
  ------------------
  416|       |
  417|    905|   if(new_size > 0)
  ------------------
  |  Branch (417:7): [True: 905, False: 0]
  ------------------
  418|    905|      copy_mem(y, x + word_shift, new_size);
  419|       |
  420|    905|   const auto carry_mask = CT::Mask<word>::expand(bit_shift);
  421|    905|   const size_t carry_shift = carry_mask.if_set_return(BOTAN_MP_WORD_BITS - bit_shift);
  ------------------
  |  |   50|    905|#define BOTAN_MP_WORD_BITS 64
  ------------------
  422|       |
  423|    905|   word carry = 0;
  424|  4.39k|   for(size_t i = new_size; i > 0; --i) {
  ------------------
  |  Branch (424:29): [True: 3.49k, False: 905]
  ------------------
  425|  3.49k|      word w = y[i - 1];
  426|  3.49k|      y[i - 1] = (w >> bit_shift) | carry;
  427|  3.49k|      carry = carry_mask.if_set_return(w << carry_shift);
  428|  3.49k|   }
  429|    905|}
_ZN5Botan14bigint_linmul2EPmmm:
  434|  2.76M|[[nodiscard]] inline word bigint_linmul2(word x[], size_t x_size, word y) {
  435|  2.76M|   const size_t blocks = x_size - (x_size % 8);
  436|       |
  437|  2.76M|   word carry = 0;
  438|       |
  439|  10.0M|   for(size_t i = 0; i != blocks; i += 8)
  ------------------
  |  Branch (439:22): [True: 7.32M, False: 2.76M]
  ------------------
  440|  7.32M|      carry = word8_linmul2(x + i, y, carry);
  441|       |
  442|  3.17M|   for(size_t i = blocks; i != x_size; ++i)
  ------------------
  |  Branch (442:27): [True: 401k, False: 2.76M]
  ------------------
  443|   401k|      x[i] = word_madd2(x[i], y, &carry);
  444|       |
  445|  2.76M|   return carry;
  446|  2.76M|}
_ZN5Botan14bigint_linmul3EPmPKmmm:
  448|  96.4k|inline void bigint_linmul3(word z[], const word x[], size_t x_size, word y) {
  449|  96.4k|   const size_t blocks = x_size - (x_size % 8);
  450|       |
  451|  96.4k|   word carry = 0;
  452|       |
  453|   105k|   for(size_t i = 0; i != blocks; i += 8)
  ------------------
  |  Branch (453:22): [True: 9.52k, False: 96.4k]
  ------------------
  454|  9.52k|      carry = word8_linmul3(z + i, x + i, y, carry);
  455|       |
  456|   353k|   for(size_t i = blocks; i != x_size; ++i)
  ------------------
  |  Branch (456:27): [True: 256k, False: 96.4k]
  ------------------
  457|   256k|      z[i] = word_madd2(x[i], y, &carry);
  458|       |
  459|  96.4k|   z[x_size] = carry;
  460|  96.4k|}
_ZN5Botan14bigint_sub_absEPmPKmmS2_m:
  576|  55.8k|inline int32_t bigint_sub_abs(word z[], const word x[], size_t x_size, const word y[], size_t y_size) {
  577|  55.8k|   const int32_t relative_size = bigint_cmp(x, x_size, y, y_size);
  578|       |
  579|       |   // Swap if relative_size == -1
  580|  55.8k|   const bool need_swap = relative_size < 0;
  581|  55.8k|   CT::conditional_swap_ptr(need_swap, x, y);
  582|  55.8k|   CT::conditional_swap(need_swap, x_size, y_size);
  583|       |
  584|       |   /*
  585|       |   * We know at this point that x >= y so if y_size is larger than
  586|       |   * x_size, we are guaranteed they are just leading zeros which can
  587|       |   * be ignored
  588|       |   */
  589|  55.8k|   y_size = std::min(x_size, y_size);
  590|       |
  591|  55.8k|   bigint_sub3(z, x, x_size, y, y_size);
  592|       |
  593|  55.8k|   return relative_size;
  594|  55.8k|}
_ZN5Botan14bigint_mod_subEPmPKmS2_mS0_:
  605|  18.7k|inline void bigint_mod_sub(word t[], const word s[], const word mod[], size_t mod_sw, word ws[]) {
  606|       |   // is t < s or not?
  607|  18.7k|   const auto is_lt = bigint_ct_is_lt(t, mod_sw, s, mod_sw);
  608|       |
  609|       |   // ws = p - s
  610|  18.7k|   const word borrow = bigint_sub3(ws, mod, mod_sw, s, mod_sw);
  611|       |
  612|       |   // Compute either (t - s) or (t + (p - s)) depending on mask
  613|  18.7k|   const word carry = bigint_cnd_addsub(is_lt, t, ws, s, mod_sw);
  614|       |
  615|  18.7k|   BOTAN_DEBUG_ASSERT(borrow == 0 && carry == 0);
  ------------------
  |  |   99|  18.7k|      do {                          \
  |  |  100|  18.7k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  616|  18.7k|   BOTAN_UNUSED(carry, borrow);
  ------------------
  |  |  118|  18.7k|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
  617|  18.7k|}
_ZN5Botan12bigint_divopEmmm:
  637|  74.1k|inline word bigint_divop(word n1, word n0, word d) {
  638|  74.1k|   if(d == 0)
  ------------------
  |  Branch (638:7): [True: 0, False: 74.1k]
  ------------------
  639|      0|      throw Invalid_Argument("bigint_divop divide by zero");
  640|       |
  641|  74.1k|#if defined(BOTAN_MP_DWORD)
  642|  74.1k|   return static_cast<word>(((static_cast<BOTAN_MP_DWORD>(n1) << BOTAN_MP_WORD_BITS) | n0) / d);
  ------------------
  |  |   50|  74.1k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  643|       |#else
  644|       |
  645|       |   word high = n1 % d;
  646|       |   word quotient = 0;
  647|       |
  648|       |   for(size_t i = 0; i != BOTAN_MP_WORD_BITS; ++i) {
  649|       |      const word high_top_bit = high >> (BOTAN_MP_WORD_BITS - 1);
  650|       |
  651|       |      high <<= 1;
  652|       |      high |= (n0 >> (BOTAN_MP_WORD_BITS - 1 - i)) & 1;
  653|       |      quotient <<= 1;
  654|       |
  655|       |      if(high_top_bit || high >= d) {
  656|       |         high -= d;
  657|       |         quotient |= 1;
  658|       |      }
  659|       |   }
  660|       |
  661|       |   return quotient;
  662|       |#endif
  663|  74.1k|}
_ZN5Botan12bigint_modopEmmm:
  668|  22.7k|inline word bigint_modop(word n1, word n0, word d) {
  669|  22.7k|   if(d == 0)
  ------------------
  |  Branch (669:7): [True: 0, False: 22.7k]
  ------------------
  670|      0|      throw Invalid_Argument("bigint_modop divide by zero");
  671|       |
  672|  22.7k|#if defined(BOTAN_MP_DWORD)
  673|  22.7k|   return ((static_cast<BOTAN_MP_DWORD>(n1) << BOTAN_MP_WORD_BITS) | n0) % d;
  ------------------
  |  |   50|  22.7k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  674|       |#else
  675|       |   word z = bigint_divop(n1, n0, d);
  676|       |   word dummy = 0;
  677|       |   z = word_madd2(z, d, &dummy);
  678|       |   return (n0 - z);
  679|       |#endif
  680|  22.7k|}
_ZN5Botan17bigint_monty_redcEPmPKmmmS0_m:
  727|   379k|inline void bigint_monty_redc(word z[], const word p[], size_t p_size, word p_dash, word ws[], size_t ws_size) {
  728|   379k|   const size_t z_size = 2 * p_size;
  729|       |
  730|   379k|   BOTAN_ARG_CHECK(ws_size >= p_size + 1, "Montgomery workspace too small");
  ------------------
  |  |   30|   379k|   do {                                                          \
  |  |   31|   379k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 0, False: 379k]
  |  |  ------------------
  |  |   32|   379k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|   379k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  731|       |
  732|   379k|   if(p_size == 4)
  ------------------
  |  Branch (732:7): [True: 286k, False: 92.7k]
  ------------------
  733|   286k|      bigint_monty_redc_4(z, p, p_dash, ws);
  734|  92.7k|   else if(p_size == 6)
  ------------------
  |  Branch (734:12): [True: 2.68k, False: 90.1k]
  ------------------
  735|  2.68k|      bigint_monty_redc_6(z, p, p_dash, ws);
  736|  90.1k|   else if(p_size == 8)
  ------------------
  |  Branch (736:12): [True: 5.61k, False: 84.5k]
  ------------------
  737|  5.61k|      bigint_monty_redc_8(z, p, p_dash, ws);
  738|  84.5k|   else if(p_size == 16)
  ------------------
  |  Branch (738:12): [True: 279, False: 84.2k]
  ------------------
  739|    279|      bigint_monty_redc_16(z, p, p_dash, ws);
  740|  84.2k|   else if(p_size == 24)
  ------------------
  |  Branch (740:12): [True: 355, False: 83.8k]
  ------------------
  741|    355|      bigint_monty_redc_24(z, p, p_dash, ws);
  742|  83.8k|   else if(p_size == 32)
  ------------------
  |  Branch (742:12): [True: 922, False: 82.9k]
  ------------------
  743|    922|      bigint_monty_redc_32(z, p, p_dash, ws);
  744|  82.9k|   else
  745|  82.9k|      bigint_monty_redc_generic(z, z_size, p, p_size, p_dash, ws);
  746|   379k|}
_ZN5Botan16bigint_mod_sub_nILm4EEEvPmPKmS3_S1_:
  620|   701k|inline void bigint_mod_sub_n(word t[], const word s[], const word mod[], word ws[]) {
  621|       |   // is t < s or not?
  622|   701k|   const auto is_lt = bigint_ct_is_lt(t, N, s, N);
  623|       |
  624|       |   // ws = p - s
  625|   701k|   const word borrow = bigint_sub3(ws, mod, N, s, N);
  626|       |
  627|       |   // Compute either (t - s) or (t + (p - s)) depending on mask
  628|   701k|   const word carry = bigint_cnd_addsub(is_lt, t, ws, s, N);
  629|       |
  630|   701k|   BOTAN_DEBUG_ASSERT(borrow == 0 && carry == 0);
  ------------------
  |  |   99|   701k|      do {                          \
  |  |  100|   701k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  631|   701k|   BOTAN_UNUSED(carry, borrow);
  ------------------
  |  |  118|   701k|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
  632|   701k|}

_ZN5Botan6PK_Ops12VerificationD2Ev:
   83|  1.95k|      virtual ~Verification() = default;

_ZN5Botan6PK_Ops22Verification_with_HashD2Ev:
   54|    550|      ~Verification_with_Hash() = default;

_ZN5Botan10PSS_ParamsC2INSt3__19allocatorIhEEEERKNS2_6vectorIhT_EE:
   25|      5|      PSS_Params(const std::vector<uint8_t, Alloc>& vec) : PSS_Params(vec.data(), vec.size()) {}

_ZN5Botan4rotlILm7EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm11EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm5EjEET0_S1_:
   23|  4.10M|{
   24|  4.10M|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  4.10M|}
_ZN5Botan4rotlILm9EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm15EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm12EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm17EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm22EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm14EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm20EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm4EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm16EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm23EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm6EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm10EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm21EjEET0_S1_:
   23|  3.66k|{
   24|  3.66k|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  3.66k|}
_ZN5Botan4rotlILm30EjEET0_S1_:
   23|  4.09M|{
   24|  4.09M|   return static_cast<T>((input << ROT) | (input >> (8 * sizeof(T) - ROT)));
   25|  4.09M|}
_ZN5Botan3rhoILm2ELm13ELm22EjEET2_S1_:
   51|  4.29M|inline constexpr T rho(T x) {
   52|  4.29M|   return rotr<R1>(x) ^ rotr<R2>(x) ^ rotr<R3>(x);
   53|  4.29M|}
_ZN5Botan4rotrILm2EjEET0_S1_:
   35|  4.29M|{
   36|  4.29M|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  4.29M|}
_ZN5Botan4rotrILm13EjEET0_S1_:
   35|  4.29M|{
   36|  4.29M|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  4.29M|}
_ZN5Botan4rotrILm22EjEET0_S1_:
   35|  4.29M|{
   36|  4.29M|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  4.29M|}
_ZN5Botan3rhoILm6ELm11ELm25EjEET2_S1_:
   51|  4.29M|inline constexpr T rho(T x) {
   52|  4.29M|   return rotr<R1>(x) ^ rotr<R2>(x) ^ rotr<R3>(x);
   53|  4.29M|}
_ZN5Botan4rotrILm6EjEET0_S1_:
   35|  4.29M|{
   36|  4.29M|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  4.29M|}
_ZN5Botan4rotrILm11EjEET0_S1_:
   35|  4.29M|{
   36|  4.29M|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  4.29M|}
_ZN5Botan4rotrILm25EjEET0_S1_:
   35|  4.29M|{
   36|  4.29M|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  4.29M|}
_ZN5Botan5sigmaILm17ELm19ELm10EjEET2_S1_:
   43|  4.29M|inline constexpr T sigma(T x) {
   44|  4.29M|   return rotr<R1>(x) ^ rotr<R2>(x) ^ (x >> S);
   45|  4.29M|}
_ZN5Botan4rotrILm17EjEET0_S1_:
   35|  4.29M|{
   36|  4.29M|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  4.29M|}
_ZN5Botan4rotrILm19EjEET0_S1_:
   35|  4.29M|{
   36|  4.29M|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  4.29M|}
_ZN5Botan5sigmaILm7ELm18ELm3EjEET2_S1_:
   43|  4.29M|inline constexpr T sigma(T x) {
   44|  4.29M|   return rotr<R1>(x) ^ rotr<R2>(x) ^ (x >> S);
   45|  4.29M|}
_ZN5Botan4rotrILm7EjEET0_S1_:
   35|  4.29M|{
   36|  4.29M|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  4.29M|}
_ZN5Botan4rotrILm18EjEET0_S1_:
   35|  4.29M|{
   36|  4.29M|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  4.29M|}
_ZN5Botan3rhoILm14ELm18ELm41EmEET2_S1_:
   51|  39.6k|inline constexpr T rho(T x) {
   52|  39.6k|   return rotr<R1>(x) ^ rotr<R2>(x) ^ rotr<R3>(x);
   53|  39.6k|}
_ZN5Botan4rotrILm14EmEET0_S1_:
   35|  39.6k|{
   36|  39.6k|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  39.6k|}
_ZN5Botan4rotrILm18EmEET0_S1_:
   35|  39.6k|{
   36|  39.6k|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  39.6k|}
_ZN5Botan4rotrILm41EmEET0_S1_:
   35|  39.6k|{
   36|  39.6k|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  39.6k|}
_ZN5Botan3rhoILm28ELm34ELm39EmEET2_S1_:
   51|  39.6k|inline constexpr T rho(T x) {
   52|  39.6k|   return rotr<R1>(x) ^ rotr<R2>(x) ^ rotr<R3>(x);
   53|  39.6k|}
_ZN5Botan4rotrILm28EmEET0_S1_:
   35|  39.6k|{
   36|  39.6k|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  39.6k|}
_ZN5Botan4rotrILm34EmEET0_S1_:
   35|  39.6k|{
   36|  39.6k|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  39.6k|}
_ZN5Botan4rotrILm39EmEET0_S1_:
   35|  39.6k|{
   36|  39.6k|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  39.6k|}
_ZN5Botan5sigmaILm19ELm61ELm6EmEET2_S1_:
   43|  39.6k|inline constexpr T sigma(T x) {
   44|  39.6k|   return rotr<R1>(x) ^ rotr<R2>(x) ^ (x >> S);
   45|  39.6k|}
_ZN5Botan4rotrILm19EmEET0_S1_:
   35|  39.6k|{
   36|  39.6k|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  39.6k|}
_ZN5Botan4rotrILm61EmEET0_S1_:
   35|  39.6k|{
   36|  39.6k|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  39.6k|}
_ZN5Botan5sigmaILm1ELm8ELm7EmEET2_S1_:
   43|  39.6k|inline constexpr T sigma(T x) {
   44|  39.6k|   return rotr<R1>(x) ^ rotr<R2>(x) ^ (x >> S);
   45|  39.6k|}
_ZN5Botan4rotrILm1EmEET0_S1_:
   35|  39.6k|{
   36|  39.6k|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  39.6k|}
_ZN5Botan4rotrILm8EmEET0_S1_:
   35|  39.6k|{
   36|  39.6k|   return static_cast<T>((input >> ROT) | (input << (8 * sizeof(T) - ROT)));
   37|  39.6k|}

_ZN5Botan8round_upEmm:
   21|  37.2k|inline size_t round_up(size_t n, size_t align_to) {
   22|  37.2k|   BOTAN_ARG_CHECK(align_to != 0, "align_to must not be 0");
  ------------------
  |  |   30|  37.2k|   do {                                                          \
  |  |   31|  37.2k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 0, False: 37.2k]
  |  |  ------------------
  |  |   32|  37.2k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  37.2k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   23|       |
   24|  37.2k|   if(n % align_to)
  ------------------
  |  Branch (24:7): [True: 28.8k, False: 8.37k]
  ------------------
   25|  28.8k|      n += align_to - (n % align_to);
   26|  37.2k|   return n;
   27|  37.2k|}

_ZN5Botan11checked_mulEmm:
   47|  1.66M|inline std::optional<size_t> checked_mul(size_t x, size_t y) {
   48|  1.66M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_add_overflow)
   49|  1.66M|   size_t z;
   50|  1.66M|   if(__builtin_mul_overflow(x, y, &z)) [[unlikely]]
  ------------------
  |  Branch (50:7): [True: 0, False: 1.66M]
  ------------------
   51|       |#elif defined(_MSC_VER)
   52|       |   size_t z;
   53|       |   if(SizeTMult(x, y, &z) != S_OK) [[unlikely]]
   54|       |#else
   55|       |   size_t z = x * y;
   56|       |   if(y && z / y != x) [[unlikely]]
   57|       |#endif
   58|      0|   {
   59|      0|      return std::nullopt;
   60|      0|   }
   61|  1.66M|   return z;
   62|  1.66M|}
_ZN5Botan11checked_addEmmPKci:
   30|  82.6k|inline size_t checked_add(size_t x, size_t y, const char* file, int line) {
   31|  82.6k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_add_overflow)
   32|  82.6k|   size_t z;
   33|  82.6k|   if(__builtin_add_overflow(x, y, &z)) [[unlikely]]
  ------------------
  |  Branch (33:7): [True: 0, False: 82.6k]
  ------------------
   34|       |#elif defined(_MSC_VER)
   35|       |   size_t z;
   36|       |   if(SizeTAdd(x, y, &z) != S_OK) [[unlikely]]
   37|       |#else
   38|       |   size_t z = x + y;
   39|       |   if(z < x) [[unlikely]]
   40|       |#endif
   41|      0|   {
   42|      0|      throw Integer_Overflow_Detected(file, line);
   43|      0|   }
   44|  82.6k|   return z;
   45|  82.6k|}

_ZNK5Botan9SCAN_Name9algo_nameEv:
   44|  9.35k|      const std::string algo_name() const { return m_alg_name; }
_ZNK5Botan9SCAN_Name9arg_countEv:
   49|  4.41k|      size_t arg_count() const { return m_args.size(); }

_ZN5Botan5SHA_1C2Ev:
   32|  8.07k|      SHA_1() : MDx_HashFunction(64, true, true), m_digest(5) { clear(); }
_ZNK5Botan5SHA_14nameEv:
   20|     80|      std::string name() const override { return "SHA-1"; }
_ZNK5Botan5SHA_113output_lengthEv:
   22|  24.2k|      size_t output_length() const override { return 20; }

_ZN5Botan7SHA_224C2Ev:
   33|      3|      SHA_224() : MDx_HashFunction(64, true, true), m_digest(8) { clear(); }
_ZN5Botan7SHA_256C2Ev:
   59|  9.29k|      SHA_256() : MDx_HashFunction(64, true, true), m_digest(8) { clear(); }
_ZNK5Botan7SHA_2244nameEv:
   21|      3|      std::string name() const override { return "SHA-224"; }
_ZNK5Botan7SHA_22413output_lengthEv:
   23|     12|      size_t output_length() const override { return 28; }
_ZNK5Botan7SHA_2564nameEv:
   47|    735|      std::string name() const override { return "SHA-256"; }
_ZNK5Botan7SHA_25613output_lengthEv:
   49|  40.4k|      size_t output_length() const override { return 32; }

_ZN5Botan9SHA2_32_FEjjjRjjjjS0_S0_jjjj:
   31|  4.29M|                                  uint32_t magic) {
   32|  4.29M|   uint32_t A_rho = rho<2, 13, 22>(A);
   33|  4.29M|   uint32_t E_rho = rho<6, 11, 25>(E);
   34|  4.29M|   uint32_t M2_sigma = sigma<17, 19, 10>(M2);
   35|  4.29M|   uint32_t M4_sigma = sigma<7, 18, 3>(M4);
   36|  4.29M|   H += magic + E_rho + choose(E, F, G) + M1;
   37|  4.29M|   D += H;
   38|  4.29M|   H += A_rho + majority(A, B, C);
   39|  4.29M|   M1 += M2_sigma + M3 + M4_sigma;
   40|  4.29M|}

_ZN5Botan7SHA_384C2Ev:
   31|     18|      SHA_384() : MDx_HashFunction(128, true, true, 16), m_digest(8) { clear(); }
_ZN5Botan7SHA_512C2Ev:
   61|      3|      SHA_512() : MDx_HashFunction(128, true, true, 16), m_digest(8) { clear(); }
_ZN5Botan11SHA_512_256C2Ev:
   92|    180|      SHA_512_256() : MDx_HashFunction(128, true, true, 16), m_digest(8) { clear(); }
_ZNK5Botan7SHA_3844nameEv:
   20|     18|      std::string name() const override { return "SHA-384"; }
_ZNK5Botan7SHA_38413output_lengthEv:
   22|     68|      size_t output_length() const override { return 48; }
_ZNK5Botan7SHA_5124nameEv:
   45|      3|      std::string name() const override { return "SHA-512"; }
_ZNK5Botan7SHA_51213output_lengthEv:
   47|     12|      size_t output_length() const override { return 64; }
_ZNK5Botan11SHA_512_2564nameEv:
   81|    180|      std::string name() const override { return "SHA-512-256"; }
_ZNK5Botan11SHA_512_25613output_lengthEv:
   83|    719|      size_t output_length() const override { return 32; }

_ZN5Botan9SHA2_64_FEmmmRmmmmS0_S0_mmmm:
   31|  39.6k|                                  uint64_t magic) {
   32|  39.6k|   const uint64_t E_rho = rho<14, 18, 41>(E);
   33|  39.6k|   const uint64_t A_rho = rho<28, 34, 39>(A);
   34|  39.6k|   const uint64_t M2_sigma = sigma<19, 61, 6>(M2);
   35|  39.6k|   const uint64_t M4_sigma = sigma<1, 8, 7>(M4);
   36|  39.6k|   H += magic + E_rho + choose(E, F, G) + M1;
   37|  39.6k|   D += H;
   38|  39.6k|   H += A_rho + majority(A, B, C);
   39|  39.6k|   M1 += M2_sigma + M3 + M4_sigma;
   40|  39.6k|}

_ZN5Botan9SIMD_4x325splatEj:
  129|  64.0k|      static SIMD_4x32 splat(uint32_t B) noexcept {
  130|  64.0k|#if defined(BOTAN_SIMD_USE_SSE2)
  131|  64.0k|         return SIMD_4x32(_mm_set1_epi32(B));
  132|       |#elif defined(BOTAN_SIMD_USE_NEON)
  133|       |         return SIMD_4x32(vdupq_n_u32(B));
  134|       |#else
  135|       |         return SIMD_4x32(B, B, B, B);
  136|       |#endif
  137|  64.0k|      }
_ZN5Botan9SIMD_4x32C2EDv2_x:
  605|  5.39M|      explicit SIMD_4x32(native_simd_type x) noexcept : m_simd(x) {}
_ZN5Botan9SIMD_4x327load_beEPKv:
  172|   204k|      static SIMD_4x32 load_be(const void* in) noexcept {
  173|   204k|#if defined(BOTAN_SIMD_USE_SSE2)
  174|   204k|         return load_le(in).bswap();
  175|       |
  176|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  177|       |         uint32_t R[4];
  178|       |         Botan::load_be(R, static_cast<const uint8_t*>(in), 4);
  179|       |         return SIMD_4x32(R);
  180|       |
  181|       |#elif defined(BOTAN_SIMD_USE_NEON)
  182|       |         SIMD_4x32 l(vld1q_u32(static_cast<const uint32_t*>(in)));
  183|       |         return CPUID::is_little_endian() ? l.bswap() : l;
  184|       |#endif
  185|   204k|      }
_ZN5Botan9SIMD_4x327load_leEPKv:
  156|   204k|      static SIMD_4x32 load_le(const void* in) noexcept {
  157|   204k|#if defined(BOTAN_SIMD_USE_SSE2)
  158|   204k|         return SIMD_4x32(_mm_loadu_si128(reinterpret_cast<const __m128i*>(in)));
  159|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  160|       |         uint32_t R[4];
  161|       |         Botan::load_le(R, static_cast<const uint8_t*>(in), 4);
  162|       |         return SIMD_4x32(R);
  163|       |#elif defined(BOTAN_SIMD_USE_NEON)
  164|       |         SIMD_4x32 l(vld1q_u32(static_cast<const uint32_t*>(in)));
  165|       |         return CPUID::is_big_endian() ? l.bswap() : l;
  166|       |#endif
  167|   204k|      }
_ZNK5Botan9SIMD_4x325bswapEv:
  474|   204k|      SIMD_4x32 bswap() const noexcept {
  475|   204k|#if defined(BOTAN_SIMD_USE_SSE2)
  476|       |
  477|   204k|         __m128i T = m_simd;
  478|   204k|         T = _mm_shufflehi_epi16(T, _MM_SHUFFLE(2, 3, 0, 1));
  479|   204k|         T = _mm_shufflelo_epi16(T, _MM_SHUFFLE(2, 3, 0, 1));
  480|   204k|         return SIMD_4x32(_mm_or_si128(_mm_srli_epi16(T, 8), _mm_slli_epi16(T, 8)));
  481|       |
  482|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  483|       |
  484|       |         union {
  485|       |               __vector unsigned int V;
  486|       |               uint32_t R[4];
  487|       |         } vec;
  488|       |
  489|       |         vec.V = m_simd;
  490|       |         bswap_4(vec.R);
  491|       |         return SIMD_4x32(vec.R[0], vec.R[1], vec.R[2], vec.R[3]);
  492|       |
  493|       |#elif defined(BOTAN_SIMD_USE_NEON)
  494|       |         return SIMD_4x32(vreinterpretq_u32_u8(vrev32q_u8(vreinterpretq_u8_u32(m_simd))));
  495|       |#endif
  496|   204k|      }
_ZNK5Botan9SIMD_4x32plERKS0_:
  321|  1.02M|      SIMD_4x32 operator+(const SIMD_4x32& other) const noexcept {
  322|  1.02M|         SIMD_4x32 retval(*this);
  323|  1.02M|         retval += other;
  324|  1.02M|         return retval;
  325|  1.02M|      }
_ZN5Botan9SIMD_4x32pLERKS0_:
  363|  1.02M|      void operator+=(const SIMD_4x32& other) noexcept {
  364|  1.02M|#if defined(BOTAN_SIMD_USE_SSE2)
  365|  1.02M|         m_simd = _mm_add_epi32(m_simd, other.m_simd);
  366|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  367|       |         m_simd = vec_add(m_simd, other.m_simd);
  368|       |#elif defined(BOTAN_SIMD_USE_NEON)
  369|       |         m_simd = vaddq_u32(m_simd, other.m_simd);
  370|       |#endif
  371|  1.02M|      }
_ZNK5Botan9SIMD_4x328store_leEPj:
  187|  1.02M|      void store_le(uint32_t out[4]) const noexcept { this->store_le(reinterpret_cast<uint8_t*>(out)); }
_ZNK5Botan9SIMD_4x328store_leEPh:
  196|  1.02M|      void store_le(uint8_t out[]) const noexcept {
  197|  1.02M|#if defined(BOTAN_SIMD_USE_SSE2)
  198|       |
  199|  1.02M|         _mm_storeu_si128(reinterpret_cast<__m128i*>(out), raw());
  200|       |
  201|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  202|       |
  203|       |         union {
  204|       |               __vector unsigned int V;
  205|       |               uint32_t R[4];
  206|       |         } vec;
  207|       |
  208|       |         vec.V = raw();
  209|       |         Botan::store_le(out, vec.R[0], vec.R[1], vec.R[2], vec.R[3]);
  210|       |
  211|       |#elif defined(BOTAN_SIMD_USE_NEON)
  212|       |         if(CPUID::is_little_endian()) {
  213|       |            vst1q_u8(out, vreinterpretq_u8_u32(m_simd));
  214|       |         } else {
  215|       |            vst1q_u8(out, vreinterpretq_u8_u32(bswap().m_simd));
  216|       |         }
  217|       |#endif
  218|  1.02M|      }
_ZNK5Botan9SIMD_4x323rawEv:
  603|  5.12M|      native_simd_type raw() const noexcept { return m_simd; }
_ZNK5Botan9SIMD_4x3217shift_elems_rightILm1EEES0_v:
  522|   819k|      {
  523|   819k|#if defined(BOTAN_SIMD_USE_SSE2)
  524|   819k|         return SIMD_4x32(_mm_srli_si128(raw(), 4 * I));
  525|       |#elif defined(BOTAN_SIMD_USE_NEON)
  526|       |         return SIMD_4x32(vextq_u32(raw(), vdupq_n_u32(0), I));
  527|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  528|       |         const __vector unsigned int zero = vec_splat_u32(0);
  529|       |
  530|       |         const __vector unsigned char shuf[3] = {
  531|       |            {4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19},
  532|       |            {8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23},
  533|       |            {12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27},
  534|       |         };
  535|       |
  536|       |         return SIMD_4x32(vec_perm(raw(), zero, shuf[I - 1]));
  537|       |#endif
  538|   819k|      }
_ZN5Botan9SIMD_4x32eOERKS0_:
  383|  3.27M|      void operator^=(const SIMD_4x32& other) noexcept {
  384|  3.27M|#if defined(BOTAN_SIMD_USE_SSE2)
  385|  3.27M|         m_simd = _mm_xor_si128(m_simd, other.m_simd);
  386|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  387|       |         m_simd = vec_xor(m_simd, other.m_simd);
  388|       |#elif defined(BOTAN_SIMD_USE_NEON)
  389|       |         m_simd = veorq_u32(m_simd, other.m_simd);
  390|       |#endif
  391|  3.27M|      }
_ZNK5Botan9SIMD_4x3216shift_elems_leftILm3EEES0_v:
  501|   819k|      {
  502|   819k|#if defined(BOTAN_SIMD_USE_SSE2)
  503|   819k|         return SIMD_4x32(_mm_slli_si128(raw(), 4 * I));
  504|       |#elif defined(BOTAN_SIMD_USE_NEON)
  505|       |         return SIMD_4x32(vextq_u32(vdupq_n_u32(0), raw(), 4 - I));
  506|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  507|       |         const __vector unsigned int zero = vec_splat_u32(0);
  508|       |
  509|       |         const __vector unsigned char shuf[3] = {
  510|       |            {16, 17, 18, 19, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11},
  511|       |            {16, 17, 18, 19, 20, 21, 22, 23, 0, 1, 2, 3, 4, 5, 6, 7},
  512|       |            {16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 0, 1, 2, 3},
  513|       |         };
  514|       |
  515|       |         return SIMD_4x32(vec_perm(raw(), zero, shuf[I - 1]));
  516|       |#endif
  517|   819k|      }
_ZNK5Botan9SIMD_4x324rotlILm1EEES0_v:
  281|   819k|      {
  282|   819k|#if defined(BOTAN_SIMD_USE_SSE2)
  283|       |
  284|   819k|         return SIMD_4x32(_mm_or_si128(_mm_slli_epi32(m_simd, static_cast<int>(ROT)),
  285|   819k|                                       _mm_srli_epi32(m_simd, static_cast<int>(32 - ROT))));
  286|       |
  287|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  288|       |
  289|       |         const unsigned int r = static_cast<unsigned int>(ROT);
  290|       |         __vector unsigned int rot = {r, r, r, r};
  291|       |         return SIMD_4x32(vec_rl(m_simd, rot));
  292|       |
  293|       |#elif defined(BOTAN_SIMD_USE_NEON)
  294|       |
  295|       |   #if defined(BOTAN_TARGET_ARCH_IS_ARM64)
  296|       |
  297|       |         if constexpr(ROT == 8) {
  298|       |            const uint8_t maskb[16] = {3, 0, 1, 2, 7, 4, 5, 6, 11, 8, 9, 10, 15, 12, 13, 14};
  299|       |            const uint8x16_t mask = vld1q_u8(maskb);
  300|       |            return SIMD_4x32(vreinterpretq_u32_u8(vqtbl1q_u8(vreinterpretq_u8_u32(m_simd), mask)));
  301|       |         } else if constexpr(ROT == 16) {
  302|       |            return SIMD_4x32(vreinterpretq_u32_u16(vrev32q_u16(vreinterpretq_u16_u32(m_simd))));
  303|       |         }
  304|       |   #endif
  305|       |         return SIMD_4x32(
  306|       |            vorrq_u32(vshlq_n_u32(m_simd, static_cast<int>(ROT)), vshrq_n_u32(m_simd, static_cast<int>(32 - ROT))));
  307|       |#endif
  308|   819k|      }
_ZNK5Botan9SIMD_4x324rotlILm2EEES0_v:
  281|   819k|      {
  282|   819k|#if defined(BOTAN_SIMD_USE_SSE2)
  283|       |
  284|   819k|         return SIMD_4x32(_mm_or_si128(_mm_slli_epi32(m_simd, static_cast<int>(ROT)),
  285|   819k|                                       _mm_srli_epi32(m_simd, static_cast<int>(32 - ROT))));
  286|       |
  287|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  288|       |
  289|       |         const unsigned int r = static_cast<unsigned int>(ROT);
  290|       |         __vector unsigned int rot = {r, r, r, r};
  291|       |         return SIMD_4x32(vec_rl(m_simd, rot));
  292|       |
  293|       |#elif defined(BOTAN_SIMD_USE_NEON)
  294|       |
  295|       |   #if defined(BOTAN_TARGET_ARCH_IS_ARM64)
  296|       |
  297|       |         if constexpr(ROT == 8) {
  298|       |            const uint8_t maskb[16] = {3, 0, 1, 2, 7, 4, 5, 6, 11, 8, 9, 10, 15, 12, 13, 14};
  299|       |            const uint8x16_t mask = vld1q_u8(maskb);
  300|       |            return SIMD_4x32(vreinterpretq_u32_u8(vqtbl1q_u8(vreinterpretq_u8_u32(m_simd), mask)));
  301|       |         } else if constexpr(ROT == 16) {
  302|       |            return SIMD_4x32(vreinterpretq_u32_u16(vrev32q_u16(vreinterpretq_u16_u32(m_simd))));
  303|       |         }
  304|       |   #endif
  305|       |         return SIMD_4x32(
  306|       |            vorrq_u32(vshlq_n_u32(m_simd, static_cast<int>(ROT)), vshrq_n_u32(m_simd, static_cast<int>(32 - ROT))));
  307|       |#endif
  308|   819k|      }
_ZN5Botan9SIMD_4x32C2Ejjjj:
  113|     96|      SIMD_4x32(uint32_t B0, uint32_t B1, uint32_t B2, uint32_t B3) noexcept {
  114|     96|#if defined(BOTAN_SIMD_USE_SSE2)
  115|     96|         m_simd = _mm_set_epi32(B3, B2, B1, B0);
  116|       |#elif defined(BOTAN_SIMD_USE_ALTIVEC)
  117|       |         __vector unsigned int val = {B0, B1, B2, B3};
  118|       |         m_simd = val;
  119|       |#elif defined(BOTAN_SIMD_USE_NEON)
  120|       |         // Better way to do this?
  121|       |         const uint32_t B[4] = {B0, B1, B2, B3};
  122|       |         m_simd = vld1q_u32(B);
  123|       |#endif
  124|     96|      }
_ZN5Botan9SIMD_4x328splat_u8Eh:
  142|      2|      static SIMD_4x32 splat_u8(uint8_t B) noexcept {
  143|      2|#if defined(BOTAN_SIMD_USE_SSE2)
  144|      2|         return SIMD_4x32(_mm_set1_epi8(B));
  145|       |#elif defined(BOTAN_SIMD_USE_NEON)
  146|       |         return SIMD_4x32(vreinterpretq_u32_u8(vdupq_n_u8(B)));
  147|       |#else
  148|       |         const uint32_t B4 = make_uint32(B, B, B, B);
  149|       |         return SIMD_4x32(B4, B4, B4, B4);
  150|       |#endif
  151|      2|      }

_ZN5Botan15multimap_insertINS_3OIDENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEEEvRNS2_8multimapIT_T0_NS2_4lessISA_EENS6_INS2_4pairIKSA_SB_EEEEEERSF_RKSB_:
   81|  37.0k|void multimap_insert(std::multimap<K, V>& multimap, const K& key, const V& value) {
   82|  37.0k|   multimap.insert(std::make_pair(key, value));
   83|  37.0k|}
_ZN5Botan15multimap_insertINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEES7_EEvRNS1_8multimapIT_T0_NS1_4lessIS9_EENS5_INS1_4pairIKS9_SA_EEEEEERSE_RKSA_:
   81|    203|void multimap_insert(std::multimap<K, V>& multimap, const K& key, const V& value) {
   82|    203|   multimap.insert(std::make_pair(key, value));
   83|    203|}
_ZN5Botan15multimap_insertINS_3OIDENS_11ASN1_StringEEEvRNSt3__18multimapIT_T0_NS3_4lessIS5_EENS3_9allocatorINS3_4pairIKS5_S6_EEEEEERSB_RKS6_:
   81|    558|void multimap_insert(std::multimap<K, V>& multimap, const K& key, const V& value) {
   82|    558|   multimap.insert(std::make_pair(key, value));
   83|    558|}

_ZN5Botan21Allocator_InitializerC2Ev:
   44|      1|      Allocator_Initializer() { initialize_allocator(); }
_ZN5Botan13typecast_copyImEEvPT_PKhm:
  140|  59.7k|{
  141|  59.7k|   std::memcpy(out, in, sizeof(T) * N);
  142|  59.7k|}
_ZN5Botan13typecast_copyImEEvPhPT_m:
  133|  43.4k|{
  134|  43.4k|   std::memcpy(out, in, sizeof(T) * N);
  135|  43.4k|}
_ZN5Botan11clear_bytesEPvm:
   92|  5.09M|inline constexpr void clear_bytes(void* ptr, size_t bytes) {
   93|  5.09M|   if(bytes > 0) {
  ------------------
  |  Branch (93:7): [True: 4.36M, False: 726k]
  ------------------
   94|  4.36M|      std::memset(ptr, 0, bytes);
   95|  4.36M|   }
   96|  5.09M|}
_ZN5Botan7set_memEPhmh:
  171|    638|inline constexpr void set_mem(uint8_t* ptr, size_t n, uint8_t val) {
  172|    638|   if(n > 0) {
  ------------------
  |  Branch (172:7): [True: 638, False: 0]
  ------------------
  173|    638|      std::memset(ptr, val, n);
  174|    638|   }
  175|    638|}
_ZN5Botan22cast_char_ptr_to_uint8EPKc:
  177|     47|inline const uint8_t* cast_char_ptr_to_uint8(const char* s) { return reinterpret_cast<const uint8_t*>(s); }
_ZN5Botan22cast_uint8_ptr_to_charEPKh:
  179|  46.9k|inline const char* cast_uint8_ptr_to_char(const uint8_t* b) { return reinterpret_cast<const char*>(b); }
_ZN5Botan9clear_memIhEEvPT_m:
  109|  63.8k|inline constexpr void clear_mem(T* ptr, size_t n) {
  110|  63.8k|   clear_bytes(ptr, sizeof(T) * n);
  111|  63.8k|}
_ZN5Botan9clear_memImEEvPT_m:
  109|  5.01M|inline constexpr void clear_mem(T* ptr, size_t n) {
  110|  5.01M|   clear_bytes(ptr, sizeof(T) * n);
  111|  5.01M|}
_ZN5Botan8copy_memIhEEvPT_PKS1_m:
  122|  7.34M|{
  123|  7.34M|   BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null");
  ------------------
  |  |   78|  7.34M|   do {                                                                                          \
  |  |   79|  14.5M|      if((expr1) && !(expr2))                                                                    \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 7.27M, False: 70.7k]
  |  |  |  Branch (79:23): [True: 7.27M, False: 0]
  |  |  |  Branch (79:23): [True: 7.27M, False: 0]
  |  |  ------------------
  |  |   80|  7.34M|         Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \
  |  |   81|  7.34M|   } while(0)
  |  |  ------------------
  |  |  |  Branch (81:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  124|       |
  125|  7.34M|   if(in != nullptr && out != nullptr && n > 0) {
  ------------------
  |  Branch (125:7): [True: 7.34M, False: 2.82k]
  |  Branch (125:24): [True: 7.32M, False: 18.4k]
  |  Branch (125:42): [True: 7.27M, False: 49.4k]
  ------------------
  126|  7.27M|      std::memmove(out, in, sizeof(T) * n);
  127|  7.27M|   }
  128|  7.34M|}
_ZN5Botan13typecast_copyItEEvPT_PKhm:
  140|  4.26k|{
  141|  4.26k|   std::memcpy(out, in, sizeof(T) * N);
  142|  4.26k|}
_ZN5Botan13typecast_copyItEEvRT_PKh:
  152|  4.26k|{
  153|  4.26k|   typecast_copy(&out, in, 1);
  154|  4.26k|}
_ZN5Botan13typecast_copyIjEEvPT_PKhm:
  140|  1.07M|{
  141|  1.07M|   std::memcpy(out, in, sizeof(T) * N);
  142|  1.07M|}
_ZN5Botan13typecast_copyIjEEvRT_PKh:
  152|  1.07M|{
  153|  1.07M|   typecast_copy(&out, in, 1);
  154|  1.07M|}
_ZN5Botan13typecast_copyImEEvRT_PKh:
  152|  59.7k|{
  153|  59.7k|   typecast_copy(&out, in, 1);
  154|  59.7k|}
_ZN5Botan13typecast_copyIjEEvPhPT_m:
  133|   150k|{
  134|   150k|   std::memcpy(out, in, sizeof(T) * N);
  135|   150k|}
_ZN5Botan13typecast_copyIjEEvPhT_:
  145|   150k|inline constexpr void typecast_copy(uint8_t out[], T in) {
  146|   150k|   typecast_copy(out, &in, 1);
  147|   150k|}
_ZN5Botan13typecast_copyImEEvPhT_:
  145|  43.4k|inline constexpr void typecast_copy(uint8_t out[], T in) {
  146|  43.4k|   typecast_copy(out, &in, 1);
  147|  43.4k|}
_ZN5Botan9clear_memIjEEvPT_m:
  109|  16.3k|inline constexpr void clear_mem(T* ptr, size_t n) {
  110|  16.3k|   clear_bytes(ptr, sizeof(T) * n);
  111|  16.3k|}
_ZN5Botan13buffer_insertIhNS_16secure_allocatorIhEEEEmRNSt3__16vectorIT_T0_EEmPKS5_m:
  203|  21.6k|size_t buffer_insert(std::vector<T, Alloc>& buf, size_t buf_offset, const T input[], size_t input_length) {
  204|  21.6k|   BOTAN_ASSERT_NOMSG(buf_offset <= buf.size());
  ------------------
  |  |   60|  21.6k|   do {                                                                     \
  |  |   61|  21.6k|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 21.6k]
  |  |  ------------------
  |  |   62|  21.6k|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|  21.6k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  205|  21.6k|   const size_t to_copy = std::min(input_length, buf.size() - buf_offset);
  206|  21.6k|   if(to_copy > 0) {
  ------------------
  |  Branch (206:7): [True: 21.4k, False: 256]
  ------------------
  207|  21.4k|      copy_mem(&buf[buf_offset], input, to_copy);
  208|  21.4k|   }
  209|  21.6k|   return to_copy;
  210|  21.6k|}
_ZN5Botan8copy_memImEEvPT_PKS1_m:
  122|  1.16M|{
  123|  1.16M|   BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null");
  ------------------
  |  |   78|  1.16M|   do {                                                                                          \
  |  |   79|  2.32M|      if((expr1) && !(expr2))                                                                    \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 1.16M, False: 0]
  |  |  |  Branch (79:23): [True: 1.16M, False: 0]
  |  |  |  Branch (79:23): [True: 1.16M, False: 0]
  |  |  ------------------
  |  |   80|  1.16M|         Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \
  |  |   81|  1.16M|   } while(0)
  |  |  ------------------
  |  |  |  Branch (81:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  124|       |
  125|  1.16M|   if(in != nullptr && out != nullptr && n > 0) {
  ------------------
  |  Branch (125:7): [True: 1.16M, False: 0]
  |  Branch (125:24): [True: 1.16M, False: 0]
  |  Branch (125:42): [True: 1.16M, False: 0]
  ------------------
  126|  1.16M|      std::memmove(out, in, sizeof(T) * n);
  127|  1.16M|   }
  128|  1.16M|}
_ZN5Botan8same_memIhEEbPKT_S3_m:
  193|    315|inline bool same_mem(const T* p1, const T* p2, size_t n) {
  194|    315|   volatile T difference = 0;
  195|       |
  196|  22.6k|   for(size_t i = 0; i != n; ++i)
  ------------------
  |  Branch (196:22): [True: 22.3k, False: 315]
  ------------------
  197|  22.3k|      difference = difference | (p1[i] ^ p2[i]);
  198|       |
  199|    315|   return difference == 0;
  200|    315|}
_ZN5Botan13buffer_insertIhNSt3__19allocatorIhEEEEmRNS1_6vectorIT_T0_EEmPKS5_m:
  203|  1.27k|size_t buffer_insert(std::vector<T, Alloc>& buf, size_t buf_offset, const T input[], size_t input_length) {
  204|  1.27k|   BOTAN_ASSERT_NOMSG(buf_offset <= buf.size());
  ------------------
  |  |   60|  1.27k|   do {                                                                     \
  |  |   61|  1.27k|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 1.27k]
  |  |  ------------------
  |  |   62|  1.27k|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|  1.27k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  205|  1.27k|   const size_t to_copy = std::min(input_length, buf.size() - buf_offset);
  206|  1.27k|   if(to_copy > 0) {
  ------------------
  |  Branch (206:7): [True: 1.27k, False: 0]
  ------------------
  207|  1.27k|      copy_mem(&buf[buf_offset], input, to_copy);
  208|  1.27k|   }
  209|  1.27k|   return to_copy;
  210|  1.27k|}
_ZN5Botan8copy_memIiEEvPT_PKS1_m:
  122|  1.53k|{
  123|  1.53k|   BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null");
  ------------------
  |  |   78|  1.53k|   do {                                                                                          \
  |  |   79|  3.07k|      if((expr1) && !(expr2))                                                                    \
  |  |  ------------------
  |  |  |  Branch (79:10): [True: 1.53k, False: 0]
  |  |  |  Branch (79:23): [True: 1.53k, False: 0]
  |  |  |  Branch (79:23): [True: 1.53k, False: 0]
  |  |  ------------------
  |  |   80|  1.53k|         Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \
  |  |   81|  1.53k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (81:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  124|       |
  125|  1.53k|   if(in != nullptr && out != nullptr && n > 0) {
  ------------------
  |  Branch (125:7): [True: 1.53k, False: 0]
  |  Branch (125:24): [True: 1.53k, False: 0]
  |  Branch (125:42): [True: 1.53k, False: 0]
  ------------------
  126|  1.53k|      std::memmove(out, in, sizeof(T) * n);
  127|  1.53k|   }
  128|  1.53k|}

_ZNK5Botan10Public_Key13message_partsEv:
  165|  2.20k|      virtual size_t message_parts() const { return 1; }
_ZNK5Botan10Public_Key17message_part_sizeEv:
  176|  1.10k|      virtual size_t message_part_size() const { return 0; }
_ZNK5Botan10Public_Key29default_x509_signature_formatEv:
  178|  1.65k|      virtual Signature_Format default_x509_signature_format() const {
  179|  1.65k|         return (this->message_parts() >= 2) ? Signature_Format::DerSequence : Signature_Format::Standard;
  ------------------
  |  Branch (179:17): [True: 550, False: 1.10k]
  ------------------
  180|  1.65k|      }
_ZN5Botan22create_hex_fingerprintENSt3__14spanIKhLm18446744073709551615EEENS0_17basic_string_viewIcNS0_11char_traitsIcEEEE:
  367|  8.00k|inline std::string create_hex_fingerprint(std::span<const uint8_t> vec, std::string_view hash_name) {
  368|  8.00k|   return create_hex_fingerprint(vec.data(), vec.size(), hash_name);
  369|  8.00k|}
_ZN5Botan14Asymmetric_KeyD2Ev:
   57|  2.97k|      virtual ~Asymmetric_Key() = default;

_ZN5Botan15Key_ConstraintsC2ENS0_4BitsE:
  139|  1.08k|      Key_Constraints(Key_Constraints::Bits bits) : m_value(bits) {}
_ZN5Botan15Key_ConstraintsC2Ej:
  141|    437|      explicit Key_Constraints(uint32_t bits) : m_value(bits) {}
_ZN5Botan15Key_ConstraintsC2Ev:
  143|  5.70k|      Key_Constraints() : m_value(0) {}
_ZNK5Botan15Key_Constraints8includesENS0_4BitsE:
  158|     36|      bool includes(Key_Constraints::Bits other) const { return (m_value & other) == other; }
_ZNK5Botan15Key_Constraints8includesES0_:
  160|    400|      bool includes(Key_Constraints other) const { return (m_value & other.m_value) == other.m_value; }
_ZNK5Botan15Key_Constraints5emptyEv:
  165|    421|      bool empty() const { return m_value == 0; }

_ZNK5Botan7X509_DN8get_bitsEv:
   58|  9.42k|      const std::vector<uint8_t>& get_bits() const { return m_dn_bits; }
_ZNK5Botan7X509_DN7dn_infoEv:
   66|  1.40k|      const std::vector<std::pair<OID, ASN1_String>>& dn_info() const { return m_rdn; }
_ZN5Botan14GeneralSubtreeC2Ev:
  242|    511|      GeneralSubtree() : m_base(), m_minimum(0), m_maximum(std::numeric_limits<std::size_t>::max()) {}
_ZN5Botan15NameConstraintsC2Ev:
  295|  6.24k|      NameConstraints() : m_permitted_subtrees(), m_excluded_subtrees() {}
_ZN5Botan15NameConstraintsC2EONSt3__16vectorINS_14GeneralSubtreeENS1_9allocatorIS3_EEEES7_:
  304|     21|            m_permitted_subtrees(permitted_subtrees), m_excluded_subtrees(excluded_subtrees) {}
_ZNK5Botan10Extensions18get_extension_oidsEv:
  412|    302|      const std::vector<OID>& get_extension_oids() const { return m_extension_oids; }
_ZN5Botan10ExtensionsC2Ev:
  513|  5.70k|      Extensions() {}
_ZN5Botan10Extensions15Extensions_InfoC2EbRKNSt3__16vectorIhNS2_9allocatorIhEEEENS2_10unique_ptrINS_21Certificate_ExtensionENS2_14default_deleteISA_EEEE:
  534|  14.3k|                  m_obj(std::move(ext)), m_bits(encoding), m_critical(critical) {}
_ZNK5Botan10Extensions15Extensions_Info11is_criticalEv:
  536|    535|            bool is_critical() const { return m_critical; }
_ZNK5Botan10Extensions15Extensions_Info3objEv:
  540|  3.14k|            const Certificate_Extension& obj() const {
  541|  3.14k|               BOTAN_ASSERT_NONNULL(m_obj.get());
  ------------------
  |  |   87|  3.14k|   do {                                                                                   \
  |  |   88|  3.14k|      if((ptr) == nullptr)                                                                \
  |  |  ------------------
  |  |  |  Branch (88:10): [True: 0, False: 3.14k]
  |  |  ------------------
  |  |   89|  3.14k|         Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \
  |  |   90|  3.14k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (90:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  542|  3.14k|               return *m_obj.get();
  543|  3.14k|            }
_ZN5Botan7X509_DNC2Ev:
   37|  12.4k|      X509_DN() = default;
_ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension16Authority_Key_IDEEEPKT_RKNS_3OIDE:
  393|  4.01k|      const T* get_extension_object_as(const OID& oid = T::static_oid()) const {
  394|  4.01k|         if(const Certificate_Extension* extn = get_extension_object(oid)) {
  ------------------
  |  Branch (394:42): [True: 226, False: 3.78k]
  ------------------
  395|       |            // Unknown_Extension oid_name is empty
  396|    226|            if(extn->oid_name().empty()) {
  ------------------
  |  Branch (396:16): [True: 66, False: 160]
  ------------------
  397|     66|               return nullptr;
  398|    160|            } else if(const T* extn_as_T = dynamic_cast<const T*>(extn)) {
  ------------------
  |  Branch (398:32): [True: 160, False: 0]
  ------------------
  399|    160|               return extn_as_T;
  400|    160|            } else {
  401|      0|               throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed");
  402|      0|            }
  403|    226|         }
  404|       |
  405|  3.78k|         return nullptr;
  406|  4.01k|      }
_ZN5Botan21Certificate_ExtensionD2Ev:
  367|  18.8k|      virtual ~Certificate_Extension() = default;
_ZN5Botan11GeneralNameC2Ev:
  190|    511|      GeneralName() = default;
_ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension9Key_UsageEEEPKT_RKNS_3OIDE:
  393|  4.01k|      const T* get_extension_object_as(const OID& oid = T::static_oid()) const {
  394|  4.01k|         if(const Certificate_Extension* extn = get_extension_object(oid)) {
  ------------------
  |  Branch (394:42): [True: 288, False: 3.72k]
  ------------------
  395|       |            // Unknown_Extension oid_name is empty
  396|    288|            if(extn->oid_name().empty()) {
  ------------------
  |  Branch (396:16): [True: 119, False: 169]
  ------------------
  397|    119|               return nullptr;
  398|    169|            } else if(const T* extn_as_T = dynamic_cast<const T*>(extn)) {
  ------------------
  |  Branch (398:32): [True: 169, False: 0]
  ------------------
  399|    169|               return extn_as_T;
  400|    169|            } else {
  401|      0|               throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed");
  402|      0|            }
  403|    288|         }
  404|       |
  405|  3.72k|         return nullptr;
  406|  4.01k|      }
_ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension14Subject_Key_IDEEEPKT_RKNS_3OIDE:
  393|  4.01k|      const T* get_extension_object_as(const OID& oid = T::static_oid()) const {
  394|  4.01k|         if(const Certificate_Extension* extn = get_extension_object(oid)) {
  ------------------
  |  Branch (394:42): [True: 301, False: 3.71k]
  ------------------
  395|       |            // Unknown_Extension oid_name is empty
  396|    301|            if(extn->oid_name().empty()) {
  ------------------
  |  Branch (396:16): [True: 98, False: 203]
  ------------------
  397|     98|               return nullptr;
  398|    203|            } else if(const T* extn_as_T = dynamic_cast<const T*>(extn)) {
  ------------------
  |  Branch (398:32): [True: 203, False: 0]
  ------------------
  399|    203|               return extn_as_T;
  400|    203|            } else {
  401|      0|               throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed");
  402|      0|            }
  403|    301|         }
  404|       |
  405|  3.71k|         return nullptr;
  406|  4.01k|      }
_ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension16Name_ConstraintsEEEPKT_RKNS_3OIDE:
  393|  4.01k|      const T* get_extension_object_as(const OID& oid = T::static_oid()) const {
  394|  4.01k|         if(const Certificate_Extension* extn = get_extension_object(oid)) {
  ------------------
  |  Branch (394:42): [True: 77, False: 3.93k]
  ------------------
  395|       |            // Unknown_Extension oid_name is empty
  396|     77|            if(extn->oid_name().empty()) {
  ------------------
  |  Branch (396:16): [True: 71, False: 6]
  ------------------
  397|     71|               return nullptr;
  398|     71|            } else if(const T* extn_as_T = dynamic_cast<const T*>(extn)) {
  ------------------
  |  Branch (398:32): [True: 6, False: 0]
  ------------------
  399|      6|               return extn_as_T;
  400|      6|            } else {
  401|      0|               throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed");
  402|      0|            }
  403|     77|         }
  404|       |
  405|  3.93k|         return nullptr;
  406|  4.01k|      }
_ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension17Basic_ConstraintsEEEPKT_RKNS_3OIDE:
  393|  4.01k|      const T* get_extension_object_as(const OID& oid = T::static_oid()) const {
  394|  4.01k|         if(const Certificate_Extension* extn = get_extension_object(oid)) {
  ------------------
  |  Branch (394:42): [True: 518, False: 3.49k]
  ------------------
  395|       |            // Unknown_Extension oid_name is empty
  396|    518|            if(extn->oid_name().empty()) {
  ------------------
  |  Branch (396:16): [True: 131, False: 387]
  ------------------
  397|    131|               return nullptr;
  398|    387|            } else if(const T* extn_as_T = dynamic_cast<const T*>(extn)) {
  ------------------
  |  Branch (398:32): [True: 387, False: 0]
  ------------------
  399|    387|               return extn_as_T;
  400|    387|            } else {
  401|      0|               throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed");
  402|      0|            }
  403|    518|         }
  404|       |
  405|  3.49k|         return nullptr;
  406|  4.01k|      }
_ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension23Issuer_Alternative_NameEEEPKT_RKNS_3OIDE:
  393|  4.01k|      const T* get_extension_object_as(const OID& oid = T::static_oid()) const {
  394|  4.01k|         if(const Certificate_Extension* extn = get_extension_object(oid)) {
  ------------------
  |  Branch (394:42): [True: 91, False: 3.92k]
  ------------------
  395|       |            // Unknown_Extension oid_name is empty
  396|     91|            if(extn->oid_name().empty()) {
  ------------------
  |  Branch (396:16): [True: 38, False: 53]
  ------------------
  397|     38|               return nullptr;
  398|     53|            } else if(const T* extn_as_T = dynamic_cast<const T*>(extn)) {
  ------------------
  |  Branch (398:32): [True: 53, False: 0]
  ------------------
  399|     53|               return extn_as_T;
  400|     53|            } else {
  401|      0|               throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed");
  402|      0|            }
  403|     91|         }
  404|       |
  405|  3.92k|         return nullptr;
  406|  4.01k|      }
_ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension24Subject_Alternative_NameEEEPKT_RKNS_3OIDE:
  393|  4.01k|      const T* get_extension_object_as(const OID& oid = T::static_oid()) const {
  394|  4.01k|         if(const Certificate_Extension* extn = get_extension_object(oid)) {
  ------------------
  |  Branch (394:42): [True: 357, False: 3.65k]
  ------------------
  395|       |            // Unknown_Extension oid_name is empty
  396|    357|            if(extn->oid_name().empty()) {
  ------------------
  |  Branch (396:16): [True: 157, False: 200]
  ------------------
  397|    157|               return nullptr;
  398|    200|            } else if(const T* extn_as_T = dynamic_cast<const T*>(extn)) {
  ------------------
  |  Branch (398:32): [True: 200, False: 0]
  ------------------
  399|    200|               return extn_as_T;
  400|    200|            } else {
  401|      0|               throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed");
  402|      0|            }
  403|    357|         }
  404|       |
  405|  3.65k|         return nullptr;
  406|  4.01k|      }
_ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension18Extended_Key_UsageEEEPKT_RKNS_3OIDE:
  393|  4.01k|      const T* get_extension_object_as(const OID& oid = T::static_oid()) const {
  394|  4.01k|         if(const Certificate_Extension* extn = get_extension_object(oid)) {
  ------------------
  |  Branch (394:42): [True: 284, False: 3.72k]
  ------------------
  395|       |            // Unknown_Extension oid_name is empty
  396|    284|            if(extn->oid_name().empty()) {
  ------------------
  |  Branch (396:16): [True: 165, False: 119]
  ------------------
  397|    165|               return nullptr;
  398|    165|            } else if(const T* extn_as_T = dynamic_cast<const T*>(extn)) {
  ------------------
  |  Branch (398:32): [True: 119, False: 0]
  ------------------
  399|    119|               return extn_as_T;
  400|    119|            } else {
  401|      0|               throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed");
  402|      0|            }
  403|    284|         }
  404|       |
  405|  3.72k|         return nullptr;
  406|  4.01k|      }
_ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension20Certificate_PoliciesEEEPKT_RKNS_3OIDE:
  393|  4.01k|      const T* get_extension_object_as(const OID& oid = T::static_oid()) const {
  394|  4.01k|         if(const Certificate_Extension* extn = get_extension_object(oid)) {
  ------------------
  |  Branch (394:42): [True: 157, False: 3.85k]
  ------------------
  395|       |            // Unknown_Extension oid_name is empty
  396|    157|            if(extn->oid_name().empty()) {
  ------------------
  |  Branch (396:16): [True: 107, False: 50]
  ------------------
  397|    107|               return nullptr;
  398|    107|            } else if(const T* extn_as_T = dynamic_cast<const T*>(extn)) {
  ------------------
  |  Branch (398:32): [True: 50, False: 0]
  ------------------
  399|     50|               return extn_as_T;
  400|     50|            } else {
  401|      0|               throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed");
  402|      0|            }
  403|    157|         }
  404|       |
  405|  3.85k|         return nullptr;
  406|  4.01k|      }
_ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension28Authority_Information_AccessEEEPKT_RKNS_3OIDE:
  393|  4.01k|      const T* get_extension_object_as(const OID& oid = T::static_oid()) const {
  394|  4.01k|         if(const Certificate_Extension* extn = get_extension_object(oid)) {
  ------------------
  |  Branch (394:42): [True: 111, False: 3.90k]
  ------------------
  395|       |            // Unknown_Extension oid_name is empty
  396|    111|            if(extn->oid_name().empty()) {
  ------------------
  |  Branch (396:16): [True: 60, False: 51]
  ------------------
  397|     60|               return nullptr;
  398|     60|            } else if(const T* extn_as_T = dynamic_cast<const T*>(extn)) {
  ------------------
  |  Branch (398:32): [True: 51, False: 0]
  ------------------
  399|     51|               return extn_as_T;
  400|     51|            } else {
  401|      0|               throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed");
  402|      0|            }
  403|    111|         }
  404|       |
  405|  3.90k|         return nullptr;
  406|  4.01k|      }
_ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension23CRL_Distribution_PointsEEEPKT_RKNS_3OIDE:
  393|  4.01k|      const T* get_extension_object_as(const OID& oid = T::static_oid()) const {
  394|  4.01k|         if(const Certificate_Extension* extn = get_extension_object(oid)) {
  ------------------
  |  Branch (394:42): [True: 203, False: 3.80k]
  ------------------
  395|       |            // Unknown_Extension oid_name is empty
  396|    203|            if(extn->oid_name().empty()) {
  ------------------
  |  Branch (396:16): [True: 124, False: 79]
  ------------------
  397|    124|               return nullptr;
  398|    124|            } else if(const T* extn_as_T = dynamic_cast<const T*>(extn)) {
  ------------------
  |  Branch (398:32): [True: 79, False: 0]
  ------------------
  399|     79|               return extn_as_T;
  400|     79|            } else {
  401|      0|               throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed");
  402|      0|            }
  403|    203|         }
  404|       |
  405|  3.80k|         return nullptr;
  406|  4.01k|      }

_ZN5Botan11PK_Verifier14verify_messageENSt3__14spanIKhLm18446744073709551615EEES4_:
  320|  1.65k|      bool verify_message(std::span<const uint8_t> msg, std::span<const uint8_t> sig) {
  321|  1.65k|         return verify_message(msg.data(), msg.size(), sig.data(), sig.size());
  322|  1.65k|      }

_ZNK5Botan15Modular_Reducer8multiplyERKNS_6BigIntES3_:
   30|  2.95k|      BigInt multiply(const BigInt& x, const BigInt& y) const { return reduce(x * y); }
_ZNK5Botan15Modular_Reducer11get_modulusEv:
   20|      7|      const BigInt& get_modulus() const { return m_modulus; }
_ZNK5Botan15Modular_Reducer6squareERKNS_6BigIntE:
   43|  2.33k|      BigInt square(const BigInt& x) const { return reduce(Botan::square(x)); }

_ZN5Botan16secure_allocatorIhE8allocateEm:
   45|   503k|      T* allocate(std::size_t n) { return static_cast<T*>(allocate_memory(n, sizeof(T))); }
_ZN5Botan16secure_allocatorIhE10deallocateEPhm:
   47|   503k|      void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); }
_ZN5Botan16secure_allocatorImE10deallocateEPmm:
   47|  1.14M|      void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); }
_ZN5Botan16secure_allocatorImE8allocateEm:
   45|  1.14M|      T* allocate(std::size_t n) { return static_cast<T*>(allocate_memory(n, sizeof(T))); }
_ZN5BotanneIhhEEbRKNS_16secure_allocatorIT_EERKNS1_IT0_EE:
   56|  86.4k|inline bool operator!=(const secure_allocator<T>&, const secure_allocator<U>&) {
   57|  86.4k|   return false;
   58|  86.4k|}
_ZN5BotanpLIhNS_16secure_allocatorIhEEmEERNSt3__16vectorIT_T0_EES8_RKNS3_4pairIPS5_T1_EE:
   98|  7.07k|std::vector<T, Alloc>& operator+=(std::vector<T, Alloc>& out, const std::pair<T*, L>& in) {
   99|  7.07k|   out.insert(out.end(), in.first, in.first + in.second);
  100|  7.07k|   return out;
  101|  7.07k|}
_ZN5BotanpLIhNS_16secure_allocatorIhEES2_EERNSt3__16vectorIT_T0_EES8_RKNS4_IS5_T1_EE:
   80|      3|std::vector<T, Alloc>& operator+=(std::vector<T, Alloc>& out, const std::vector<T, Alloc2>& in) {
   81|      3|   out.insert(out.end(), in.begin(), in.end());
   82|      3|   return out;
   83|      3|}
_ZN5BotanpLIhNS_16secure_allocatorIhEEmEERNSt3__16vectorIT_T0_EES8_RKNS3_4pairIPKS5_T1_EE:
   92|  61.1k|std::vector<T, Alloc>& operator+=(std::vector<T, Alloc>& out, const std::pair<const T*, L>& in) {
   93|  61.1k|   out.insert(out.end(), in.first, in.first + in.second);
   94|  61.1k|   return out;
   95|  61.1k|}
_ZN5Botan16secure_allocatorIjE10deallocateEPjm:
   47|  17.5k|      void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); }
_ZN5Botan16secure_allocatorIjE8allocateEm:
   45|  17.5k|      T* allocate(std::size_t n) { return static_cast<T*>(allocate_memory(n, sizeof(T))); }
_ZN5Botan7zeroiseIjNS_16secure_allocatorIjEEEEvRNSt3__16vectorIT_T0_EE:
  108|  16.3k|void zeroise(std::vector<T, Alloc>& vec) {
  109|  16.3k|   clear_mem(vec.data(), vec.size());
  110|  16.3k|}
_ZN5Botan7zeroiseIhNS_16secure_allocatorIhEEEEvRNSt3__16vectorIT_T0_EE:
  108|  40.2k|void zeroise(std::vector<T, Alloc>& vec) {
  109|  40.2k|   clear_mem(vec.data(), vec.size());
  110|  40.2k|}
_ZN5BotanpLIhNSt3__19allocatorIhEENS_16secure_allocatorIhEEEERNS1_6vectorIT_T0_EESA_RKNS6_IS7_T1_EE:
   80|  1.08k|std::vector<T, Alloc>& operator+=(std::vector<T, Alloc>& out, const std::vector<T, Alloc2>& in) {
   81|  1.08k|   out.insert(out.end(), in.begin(), in.end());
   82|  1.08k|   return out;
   83|  1.08k|}

_ZN5Botan14Cert_Extension10CRL_Number10static_oidEv:
  349|  11.0k|      static OID static_oid() { return OID("2.5.29.20"); }
_ZN5Botan14Cert_Extension16Authority_Key_ID10static_oidEv:
  128|  14.9k|      static OID static_oid() { return OID("2.5.29.35"); }
_ZNK5Botan14Cert_Extension16Authority_Key_ID10get_key_idEv:
  126|    160|      const std::vector<uint8_t>& get_key_id() const { return m_key_id; }
_ZN5Botan14Cert_Extension30CRL_Issuing_Distribution_Point10static_oidEv:
  455|  9.13k|      static OID static_oid() { return OID("2.5.29.28"); }
_ZNK5Botan14Cert_Extension23CRL_Distribution_Points18Distribution_Point5pointEv:
  404|    277|            const AlternativeName& point() const { return m_point; }
_ZNK5Botan14Cert_Extension17Basic_Constraints4copyEv:
   27|      5|      std::unique_ptr<Certificate_Extension> copy() const override {
   28|      5|         return std::make_unique<Basic_Constraints>(m_is_ca, m_path_limit);
   29|      5|      }
_ZN5Botan14Cert_Extension17Basic_ConstraintsC2Ebm:
   31|    806|      Basic_Constraints(bool ca = false, size_t limit = 0) : m_is_ca(ca), m_path_limit(limit) {}
_ZNK5Botan14Cert_Extension17Basic_Constraints9get_is_caEv:
   33|    387|      bool get_is_ca() const { return m_is_ca; }
_ZN5Botan14Cert_Extension17Basic_Constraints10static_oidEv:
   37|  15.8k|      static OID static_oid() { return OID("2.5.29.19"); }
_ZNK5Botan14Cert_Extension17Basic_Constraints8oid_nameEv:
   42|    387|      std::string oid_name() const override { return "X509v3.BasicConstraints"; }
_ZNK5Botan14Cert_Extension9Key_Usage4copyEv:
   56|     10|      std::unique_ptr<Certificate_Extension> copy() const override {
   57|     10|         return std::make_unique<Key_Usage>(m_constraints);
   58|     10|      }
_ZN5Botan14Cert_Extension9Key_UsageC2ENS_15Key_ConstraintsE:
   60|     10|      explicit Key_Usage(Key_Constraints c) : m_constraints(c) {}
_ZN5Botan14Cert_Extension9Key_UsageC2Ev:
   62|    684|      explicit Key_Usage() : m_constraints(Key_Constraints::None) {}
_ZNK5Botan14Cert_Extension9Key_Usage15get_constraintsEv:
   64|    169|      Key_Constraints get_constraints() const { return m_constraints; }
_ZN5Botan14Cert_Extension9Key_Usage10static_oidEv:
   66|  17.9k|      static OID static_oid() { return OID("2.5.29.15"); }
_ZNK5Botan14Cert_Extension9Key_Usage8oid_nameEv:
   71|    169|      std::string oid_name() const override { return "X509v3.KeyUsage"; }
_ZN5Botan14Cert_Extension14Subject_Key_IDC2ERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
   88|     35|      explicit Subject_Key_ID(const std::vector<uint8_t>& k) : m_key_id(k) {}
_ZNK5Botan14Cert_Extension14Subject_Key_ID4copyEv:
   92|     35|      std::unique_ptr<Certificate_Extension> copy() const override {
   93|     35|         return std::make_unique<Subject_Key_ID>(m_key_id);
   94|     35|      }
_ZNK5Botan14Cert_Extension14Subject_Key_ID10get_key_idEv:
   96|    203|      const std::vector<uint8_t>& get_key_id() const { return m_key_id; }
_ZN5Botan14Cert_Extension14Subject_Key_ID10static_oidEv:
   98|  18.3k|      static OID static_oid() { return OID("2.5.29.14"); }
_ZNK5Botan14Cert_Extension14Subject_Key_ID8oid_nameEv:
  103|    203|      std::string oid_name() const override { return "X509v3.SubjectKeyIdentifier"; }
_ZNK5Botan14Cert_Extension16Authority_Key_ID4copyEv:
  118|     38|      std::unique_ptr<Certificate_Extension> copy() const override {
  119|     38|         return std::make_unique<Authority_Key_ID>(m_key_id);
  120|     38|      }
_ZN5Botan14Cert_Extension16Authority_Key_IDC2ERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  124|     38|      explicit Authority_Key_ID(const std::vector<uint8_t>& k) : m_key_id(k) {}
_ZNK5Botan14Cert_Extension16Authority_Key_ID8oid_nameEv:
  133|    160|      std::string oid_name() const override { return "X509v3.AuthorityKeyIdentifier"; }
_ZNK5Botan14Cert_Extension24Subject_Alternative_Name12get_alt_nameEv:
  148|    205|      const AlternativeName& get_alt_name() const { return m_alt_name; }
_ZN5Botan14Cert_Extension24Subject_Alternative_Name10static_oidEv:
  150|  17.2k|      static OID static_oid() { return OID("2.5.29.17"); }
_ZNK5Botan14Cert_Extension24Subject_Alternative_Name4copyEv:
  154|      5|      std::unique_ptr<Certificate_Extension> copy() const override {
  155|      5|         return std::make_unique<Subject_Alternative_Name>(get_alt_name());
  156|      5|      }
_ZN5Botan14Cert_Extension24Subject_Alternative_NameC2ERKNS_15AlternativeNameE:
  158|    998|      explicit Subject_Alternative_Name(const AlternativeName& name = AlternativeName()) : m_alt_name(name) {}
_ZNK5Botan14Cert_Extension24Subject_Alternative_Name8oid_nameEv:
  161|    200|      std::string oid_name() const override { return "X509v3.SubjectAlternativeName"; }
_ZNK5Botan14Cert_Extension23Issuer_Alternative_Name12get_alt_nameEv:
  176|     59|      const AlternativeName& get_alt_name() const { return m_alt_name; }
_ZN5Botan14Cert_Extension23Issuer_Alternative_Name10static_oidEv:
  178|  16.2k|      static OID static_oid() { return OID("2.5.29.18"); }
_ZNK5Botan14Cert_Extension23Issuer_Alternative_Name4copyEv:
  182|      6|      std::unique_ptr<Certificate_Extension> copy() const override {
  183|      6|         return std::make_unique<Issuer_Alternative_Name>(get_alt_name());
  184|      6|      }
_ZN5Botan14Cert_Extension23Issuer_Alternative_NameC2ERKNS_15AlternativeNameE:
  186|    368|      explicit Issuer_Alternative_Name(const AlternativeName& name = AlternativeName()) : m_alt_name(name) {}
_ZNK5Botan14Cert_Extension23Issuer_Alternative_Name8oid_nameEv:
  189|     53|      std::string oid_name() const override { return "X509v3.IssuerAlternativeName"; }
_ZNK5Botan14Cert_Extension18Extended_Key_Usage4copyEv:
  204|      7|      std::unique_ptr<Certificate_Extension> copy() const override {
  205|      7|         return std::make_unique<Extended_Key_Usage>(m_oids);
  206|      7|      }
_ZN5Botan14Cert_Extension18Extended_Key_UsageC2ERKNSt3__16vectorINS_3OIDENS2_9allocatorIS4_EEEE:
  210|      7|      explicit Extended_Key_Usage(const std::vector<OID>& o) : m_oids(o) {}
_ZNK5Botan14Cert_Extension18Extended_Key_Usage18object_identifiersEv:
  212|    119|      const std::vector<OID>& object_identifiers() const { return m_oids; }
_ZN5Botan14Cert_Extension18Extended_Key_Usage10static_oidEv:
  214|  12.6k|      static OID static_oid() { return OID("2.5.29.37"); }
_ZNK5Botan14Cert_Extension18Extended_Key_Usage8oid_nameEv:
  219|    119|      std::string oid_name() const override { return "X509v3.ExtendedKeyUsage"; }
_ZNK5Botan14Cert_Extension16Name_Constraints20get_name_constraintsEv:
  248|      6|      const NameConstraints& get_name_constraints() const { return m_name_constraints; }
_ZN5Botan14Cert_Extension16Name_Constraints10static_oidEv:
  250|  14.3k|      static OID static_oid() { return OID("2.5.29.30"); }
_ZNK5Botan14Cert_Extension16Name_Constraints8oid_nameEv:
  255|      6|      std::string oid_name() const override { return "X509v3.NameConstraints"; }
_ZNK5Botan14Cert_Extension20Certificate_Policies4copyEv:
  270|     10|      std::unique_ptr<Certificate_Extension> copy() const override {
  271|     10|         return std::make_unique<Certificate_Policies>(m_oids);
  272|     10|      }
_ZN5Botan14Cert_Extension20Certificate_PoliciesC2ERKNSt3__16vectorINS_3OIDENS2_9allocatorIS4_EEEE:
  276|     10|      explicit Certificate_Policies(const std::vector<OID>& o) : m_oids(o) {}
_ZNK5Botan14Cert_Extension20Certificate_Policies15get_policy_oidsEv:
  278|     50|      const std::vector<OID>& get_policy_oids() const { return m_oids; }
_ZN5Botan14Cert_Extension20Certificate_Policies10static_oidEv:
  280|  12.9k|      static OID static_oid() { return OID("2.5.29.32"); }
_ZNK5Botan14Cert_Extension20Certificate_Policies8oid_nameEv:
  291|     50|      std::string oid_name() const override { return "X509v3.CertificatePolicies"; }
_ZNK5Botan14Cert_Extension28Authority_Information_Access4copyEv:
  306|      6|      std::unique_ptr<Certificate_Extension> copy() const override {
  307|      6|         return std::make_unique<Authority_Information_Access>(m_ocsp_responder, m_ca_issuers);
  308|      6|      }
_ZN5Botan14Cert_Extension28Authority_Information_AccessC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEERKNS2_6vectorINS2_12basic_stringIcS5_NS2_9allocatorIcEEEENS9_ISB_EEEE:
  314|      6|            m_ocsp_responder(ocsp), m_ca_issuers(ca_issuers) {}
_ZNK5Botan14Cert_Extension28Authority_Information_Access14ocsp_responderEv:
  316|     51|      std::string ocsp_responder() const { return m_ocsp_responder; }
_ZN5Botan14Cert_Extension28Authority_Information_Access10static_oidEv:
  318|  11.9k|      static OID static_oid() { return OID("1.3.6.1.5.5.7.1.1"); }
_ZNK5Botan14Cert_Extension28Authority_Information_Access10ca_issuersEv:
  322|     51|      const std::vector<std::string> ca_issuers() const { return m_ca_issuers; }
_ZNK5Botan14Cert_Extension28Authority_Information_Access8oid_nameEv:
  325|     51|      std::string oid_name() const override { return "PKIX.AuthorityInformationAccess"; }
_ZN5Botan14Cert_Extension10CRL_NumberC2Ev:
  343|     66|      CRL_Number() : m_has_value(false), m_crl_number(0) {}
_ZN5Botan14Cert_Extension10CRL_NumberC2Em:
  345|      2|      CRL_Number(size_t n) : m_has_value(true), m_crl_number(n) {}
_ZNK5Botan14Cert_Extension14CRL_ReasonCode4copyEv:
  370|      1|      std::unique_ptr<Certificate_Extension> copy() const override {
  371|      1|         return std::make_unique<CRL_ReasonCode>(m_reason);
  372|      1|      }
_ZN5Botan14Cert_Extension14CRL_ReasonCodeC2ENS_8CRL_CodeE:
  374|    108|      explicit CRL_ReasonCode(CRL_Code r = CRL_Code::Unspecified) : m_reason(r) {}
_ZN5Botan14Cert_Extension14CRL_ReasonCode10static_oidEv:
  378|  11.0k|      static OID static_oid() { return OID("2.5.29.21"); }
_ZNK5Botan14Cert_Extension23CRL_Distribution_Points4copyEv:
  410|      4|      std::unique_ptr<Certificate_Extension> copy() const override {
  411|      4|         return std::make_unique<CRL_Distribution_Points>(m_distribution_points);
  412|      4|      }
_ZN5Botan14Cert_Extension23CRL_Distribution_PointsC2ERKNSt3__16vectorINS1_18Distribution_PointENS2_9allocatorIS4_EEEE:
  416|      4|      explicit CRL_Distribution_Points(const std::vector<Distribution_Point>& points) : m_distribution_points(points) {}
_ZNK5Botan14Cert_Extension23CRL_Distribution_Points21crl_distribution_urlsEv:
  420|     79|      const std::vector<std::string>& crl_distribution_urls() const { return m_crl_distribution_urls; }
_ZN5Botan14Cert_Extension23CRL_Distribution_Points10static_oidEv:
  422|  13.8k|      static OID static_oid() { return OID("2.5.29.31"); }
_ZNK5Botan14Cert_Extension23CRL_Distribution_Points8oid_nameEv:
  427|     79|      std::string oid_name() const override { return "X509v3.CRLDistributionPoints"; }
_ZN5Botan14Cert_Extension17Unknown_ExtensionC2ERKNS_3OIDEb:
  507|  12.0k|      Unknown_Extension(const OID& oid, bool critical) : m_oid(oid), m_critical(critical) {}
_ZNK5Botan14Cert_Extension17Unknown_Extension4copyEv:
  509|    406|      std::unique_ptr<Certificate_Extension> copy() const override {
  510|    406|         return std::make_unique<Unknown_Extension>(m_oid, m_critical);
  511|    406|      }
_ZN5Botan14Cert_Extension17Unknown_Extension8validateERKNS_16X509_CertificateES4_RKNSt3__16vectorIS2_NS5_9allocatorIS2_EEEERNS6_INS5_3setINS_23Certificate_Status_CodeENS5_4lessISD_EENS7_ISD_EEEENS7_ISH_EEEEm:
  534|    406|                    size_t pos) override {
  535|    406|         if(m_critical) {
  ------------------
  |  Branch (535:13): [True: 103, False: 303]
  ------------------
  536|    103|            cert_status.at(pos).insert(Certificate_Status_Code::UNKNOWN_CRITICAL_EXTENSION);
  537|    103|         }
  538|    406|      }
_ZNK5Botan14Cert_Extension17Unknown_Extension8oid_nameEv:
  541|  1.13k|      std::string oid_name() const override { return ""; }
_ZN5Botan14Cert_Extension14Subject_Key_IDC2Ev:
   86|    460|      Subject_Key_ID() = default;
_ZN5Botan14Cert_Extension16Authority_Key_IDC2Ev:
  122|    511|      Authority_Key_ID() = default;
_ZN5Botan14Cert_Extension16Name_ConstraintsC2Ev:
  238|    542|      Name_Constraints() = default;
_ZN5Botan14Cert_Extension23CRL_Distribution_PointsC2Ev:
  414|    712|      CRL_Distribution_Points() = default;
_ZN5Botan14Cert_Extension30CRL_Issuing_Distribution_PointC2Ev:
  444|    158|      CRL_Issuing_Distribution_Point() = default;
_ZN5Botan14Cert_Extension20Certificate_PoliciesC2Ev:
  274|    361|      Certificate_Policies() = default;
_ZN5Botan14Cert_Extension18Extended_Key_UsageC2Ev:
  208|    626|      Extended_Key_Usage() = default;
_ZN5Botan14Cert_Extension28Authority_Information_AccessC2Ev:
  310|    206|      Authority_Information_Access() = default;

_ZN5Botan4X5098load_keyENSt3__16vectorIhNS1_9allocatorIhEEEE:
   61|  3.62k|inline std::unique_ptr<Public_Key> load_key(std::vector<uint8_t> enc) {
   62|  3.62k|   DataSource_Memory source(std::move(enc));
   63|  3.62k|   return X509::load_key(source);
   64|  3.62k|}

_ZN5Botan11X509_ObjectD2Ev:
  103|  21.0k|      virtual ~X509_Object() = default;
_ZNK5Botan11X509_Object9signatureEv:
   37|  5.65k|      const std::vector<uint8_t>& signature() const { return m_sig; }
_ZNK5Botan11X509_Object11signed_bodyEv:
   42|  9.71k|      const std::vector<uint8_t>& signed_body() const { return m_tbs_bits; }
_ZNK5Botan11X509_Object19signature_algorithmEv:
   47|  11.0k|      const AlgorithmIdentifier& signature_algorithm() const { return m_sig_algo; }
_ZN5Botan11X509_ObjectC2ERKS0_:
   96|  11.8k|      X509_Object(const X509_Object&) = default;
_ZN5Botan11X509_ObjectC2Ev:
  121|  9.21k|      X509_Object() = default;

_ZN5Botan16X509_CertificateC2ERKS0_:
  405|  11.8k|      X509_Certificate(const X509_Certificate& other) = default;

_ZNK5Botan28Path_Validation_Restrictions30require_revocation_informationEv:
   93|    151|      bool require_revocation_information() const { return m_require_revocation_information; }
_ZNK5Botan28Path_Validation_Restrictions22ocsp_all_intermediatesEv:
   99|    151|      bool ocsp_all_intermediates() const { return m_ocsp_all_intermediates; }
_ZNK5Botan28Path_Validation_Restrictions14trusted_hashesEv:
  104|      4|      const std::set<std::string>& trusted_hashes() const { return m_trusted_hashes; }
_ZNK5Botan28Path_Validation_Restrictions20minimum_key_strengthEv:
  109|    290|      size_t minimum_key_strength() const { return m_minimum_key_strength; }
_ZNK5Botan22Path_Validation_Result6resultEv:
  165|    453|      Certificate_Status_Code result() const { return m_overall; }
_ZN5Botan22Path_Validation_ResultC2ENS_23Certificate_Status_CodeE:
  204|    375|      explicit Path_Validation_Result(Certificate_Status_Code status) : m_overall(status) {}

LLVMFuzzerInitialize:
   24|      2|extern "C" int LLVMFuzzerInitialize(int*, char***) {
   25|       |   /*
   26|       |   * This disables the mlock pool, as overwrites within the pool are
   27|       |   * opaque to ASan or other instrumentation.
   28|       |   */
   29|      2|   ::setenv("BOTAN_MLOCK_POOL_SIZE", "0", 1);
   30|      2|   return 0;
   31|      2|}
LLVMFuzzerTestOneInput:
   34|  5.99k|extern "C" int LLVMFuzzerTestOneInput(const uint8_t in[], size_t len) {
   35|  5.99k|   if(len <= max_fuzzer_input_size) {
  ------------------
  |  Branch (35:7): [True: 5.98k, False: 8]
  ------------------
   36|  5.98k|      fuzz(in, len);
   37|  5.98k|   }
   38|  5.99k|   return 0;
   39|  5.99k|}

_Z4fuzzPKhm:
   13|  5.98k|void fuzz(const uint8_t in[], size_t len) {
   14|  5.98k|   Botan::DataSource_Memory input(in, len);
   15|       |
   16|  5.98k|   try {
   17|  5.98k|      Botan::X509_Certificate subject(input);
   18|  5.98k|      Botan::X509_Certificate issuer(input);
   19|       |
   20|  5.98k|      std::vector<Botan::Certificate_Store*> roots;
   21|  5.98k|      std::unique_ptr<Botan::Certificate_Store> root_store(new Botan::Certificate_Store_In_Memory(issuer));
   22|  5.98k|      roots.push_back(root_store.get());
   23|       |
   24|  5.98k|      Botan::Path_Validation_Restrictions restrictions;
   25|       |
   26|  5.98k|      x509_path_validate({subject}, restrictions, roots);
   27|  5.98k|   } catch(Botan::Exception& e) {}
   28|  5.98k|}

_ZN5Botan19AlgorithmIdentifierC2ERKNS_3OIDERKNSt3__16vectorIhNS4_9allocatorIhEEEE:
   19|      5|      m_oid(oid), m_parameters(param) {}
_ZN5Botan19AlgorithmIdentifierC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKNS1_6vectorIhNS1_9allocatorIhEEEE:
   25|      5|      AlgorithmIdentifier(OID::from_string(oid), param) {}
_ZN5Botan19AlgorithmIdentifierC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS0_15Encoding_OptionE:
   42|      5|      m_oid(OID::from_string(oid)), m_parameters() {
   43|      5|   const uint8_t DER_NULL[] = {0x05, 0x00};
   44|       |
   45|      5|   if(option == USE_NULL_PARAM) {
  ------------------
  |  Branch (45:7): [True: 5, False: 0]
  ------------------
   46|      5|      m_parameters.assign(DER_NULL, DER_NULL + 2);
   47|      5|   }
   48|      5|}
_ZNK5Botan19AlgorithmIdentifier19parameters_are_nullEv:
   50|  5.46k|bool AlgorithmIdentifier::parameters_are_null() const {
   51|  5.46k|   return (m_parameters.size() == 2 && (m_parameters[0] == 0x05) && (m_parameters[1] == 0x00));
  ------------------
  |  Branch (51:12): [True: 5.29k, False: 170]
  |  Branch (51:40): [True: 5.27k, False: 15]
  |  Branch (51:69): [True: 5.24k, False: 35]
  ------------------
   52|  5.46k|}
_ZN5BotaneqERKNS_19AlgorithmIdentifierES2_:
   54|  4.77k|bool operator==(const AlgorithmIdentifier& a1, const AlgorithmIdentifier& a2) {
   55|  4.77k|   if(a1.oid() != a2.oid()) {
  ------------------
  |  Branch (55:7): [True: 14, False: 4.76k]
  ------------------
   56|     14|      return false;
   57|     14|   }
   58|       |
   59|       |   /*
   60|       |   * Treat NULL and empty as equivalent
   61|       |   */
   62|  4.76k|   if(a1.parameters_are_null_or_empty() && a2.parameters_are_null_or_empty()) {
  ------------------
  |  Branch (62:7): [True: 4.55k, False: 207]
  |  Branch (62:44): [True: 4.54k, False: 13]
  ------------------
   63|  4.54k|      return true;
   64|  4.54k|   }
   65|       |
   66|    220|   return (a1.parameters() == a2.parameters());
   67|  4.76k|}
_ZN5BotanneERKNS_19AlgorithmIdentifierES2_:
   69|  4.77k|bool operator!=(const AlgorithmIdentifier& a1, const AlgorithmIdentifier& a2) { return !(a1 == a2); }
_ZNK5Botan19AlgorithmIdentifier11encode_intoERNS_11DER_EncoderE:
   74|  4.01k|void AlgorithmIdentifier::encode_into(DER_Encoder& codec) const {
   75|  4.01k|   codec.start_sequence().encode(oid()).raw_bytes(parameters()).end_cons();
   76|  4.01k|}
_ZN5Botan19AlgorithmIdentifier11decode_fromERNS_11BER_DecoderE:
   81|  19.7k|void AlgorithmIdentifier::decode_from(BER_Decoder& codec) {
   82|  19.7k|   codec.start_sequence().decode(m_oid).raw_bytes(m_parameters).end_cons();
   83|  19.7k|}

_ZNK5Botan11ASN1_Object10BER_encodeEv:
   18|  4.01k|std::vector<uint8_t> ASN1_Object::BER_encode() const {
   19|  4.01k|   std::vector<uint8_t> output;
   20|  4.01k|   DER_Encoder der(output);
   21|  4.01k|   this->encode_into(der);
   22|  4.01k|   return output;
   23|  4.01k|}
_ZNK5Botan10BER_Object11assert_is_aENS_9ASN1_TypeENS_10ASN1_ClassENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
   28|   202k|void BER_Object::assert_is_a(ASN1_Type expected_type_tag, ASN1_Class expected_class_tag, std::string_view descr) const {
   29|   202k|   if(this->is_a(expected_type_tag, expected_class_tag) == false) {
  ------------------
  |  Branch (29:7): [True: 2.84k, False: 199k]
  ------------------
   30|  2.84k|      std::stringstream msg;
   31|       |
   32|  2.84k|      msg << "Tag mismatch when decoding " << descr << " got ";
   33|       |
   34|  2.84k|      if(m_class_tag == ASN1_Class::NoObject && m_type_tag == ASN1_Type::NoObject) {
  ------------------
  |  Branch (34:10): [True: 593, False: 2.25k]
  |  Branch (34:49): [True: 593, False: 0]
  ------------------
   35|    593|         msg << "EOF";
   36|  2.25k|      } else {
   37|  2.25k|         if(m_class_tag == ASN1_Class::Universal || m_class_tag == ASN1_Class::Constructed) {
  ------------------
  |  Branch (37:13): [True: 807, False: 1.44k]
  |  Branch (37:53): [True: 948, False: 499]
  ------------------
   38|  1.75k|            msg << asn1_tag_to_string(m_type_tag);
   39|  1.75k|         } else {
   40|    499|            msg << std::to_string(static_cast<uint32_t>(m_type_tag));
   41|    499|         }
   42|       |
   43|  2.25k|         msg << "/" << asn1_class_to_string(m_class_tag);
   44|  2.25k|      }
   45|       |
   46|  2.84k|      msg << " expected ";
   47|       |
   48|  2.84k|      if(expected_class_tag == ASN1_Class::Universal || expected_class_tag == ASN1_Class::Constructed) {
  ------------------
  |  Branch (48:10): [True: 705, False: 2.14k]
  |  Branch (48:57): [True: 2.03k, False: 104]
  ------------------
   49|  2.74k|         msg << asn1_tag_to_string(expected_type_tag);
   50|  2.74k|      } else {
   51|    104|         msg << std::to_string(static_cast<uint32_t>(expected_type_tag));
   52|    104|      }
   53|       |
   54|  2.84k|      msg << "/" << asn1_class_to_string(expected_class_tag);
   55|       |
   56|  2.84k|      throw BER_Decoding_Error(msg.str());
   57|  2.84k|   }
   58|   202k|}
_ZNK5Botan10BER_Object4is_aENS_9ASN1_TypeENS_10ASN1_ClassE:
   60|   350k|bool BER_Object::is_a(ASN1_Type expected_type_tag, ASN1_Class expected_class_tag) const {
   61|   350k|   return (m_type_tag == expected_type_tag && m_class_tag == expected_class_tag);
  ------------------
  |  Branch (61:12): [True: 225k, False: 124k]
  |  Branch (61:47): [True: 222k, False: 3.25k]
  ------------------
   62|   350k|}
_ZNK5Botan10BER_Object4is_aEiNS_10ASN1_ClassE:
   64|   116k|bool BER_Object::is_a(int expected_type_tag, ASN1_Class expected_class_tag) const {
   65|   116k|   return is_a(ASN1_Type(expected_type_tag), expected_class_tag);
   66|   116k|}
_ZN5Botan10BER_Object11set_taggingENS_9ASN1_TypeENS_10ASN1_ClassE:
   68|   379k|void BER_Object::set_tagging(ASN1_Type type_tag, ASN1_Class class_tag) {
   69|   379k|   m_type_tag = type_tag;
   70|   379k|   m_class_tag = class_tag;
   71|   379k|}
_ZN5Botan20asn1_class_to_stringENS_10ASN1_ClassE:
   73|  5.10k|std::string asn1_class_to_string(ASN1_Class type) {
   74|  5.10k|   switch(type) {
   75|  1.51k|      case ASN1_Class::Universal:
  ------------------
  |  Branch (75:7): [True: 1.51k, False: 3.58k]
  ------------------
   76|  1.51k|         return "UNIVERSAL";
   77|  2.98k|      case ASN1_Class::Constructed:
  ------------------
  |  Branch (77:7): [True: 2.98k, False: 2.11k]
  ------------------
   78|  2.98k|         return "CONSTRUCTED";
   79|    135|      case ASN1_Class::ContextSpecific:
  ------------------
  |  Branch (79:7): [True: 135, False: 4.96k]
  ------------------
   80|    135|         return "CONTEXT_SPECIFIC";
   81|     74|      case ASN1_Class::Application:
  ------------------
  |  Branch (81:7): [True: 74, False: 5.02k]
  ------------------
   82|     74|         return "APPLICATION";
   83|     72|      case ASN1_Class::Private:
  ------------------
  |  Branch (83:7): [True: 72, False: 5.02k]
  ------------------
   84|     72|         return "PRIVATE";
   85|      0|      case ASN1_Class::NoObject:
  ------------------
  |  Branch (85:7): [True: 0, False: 5.10k]
  ------------------
   86|      0|         return "NO_OBJECT";
   87|    322|      default:
  ------------------
  |  Branch (87:7): [True: 322, False: 4.77k]
  ------------------
   88|    322|         return "CLASS(" + std::to_string(static_cast<size_t>(type)) + ")";
   89|  5.10k|   }
   90|  5.10k|}
_ZN5Botan18asn1_tag_to_stringENS_9ASN1_TypeE:
   92|  4.49k|std::string asn1_tag_to_string(ASN1_Type type) {
   93|  4.49k|   switch(type) {
   94|  2.31k|      case ASN1_Type::Sequence:
  ------------------
  |  Branch (94:7): [True: 2.31k, False: 2.18k]
  ------------------
   95|  2.31k|         return "SEQUENCE";
   96|       |
   97|    251|      case ASN1_Type::Set:
  ------------------
  |  Branch (97:7): [True: 251, False: 4.24k]
  ------------------
   98|    251|         return "SET";
   99|       |
  100|     72|      case ASN1_Type::PrintableString:
  ------------------
  |  Branch (100:7): [True: 72, False: 4.42k]
  ------------------
  101|     72|         return "PRINTABLE STRING";
  102|       |
  103|     55|      case ASN1_Type::NumericString:
  ------------------
  |  Branch (103:7): [True: 55, False: 4.44k]
  ------------------
  104|     55|         return "NUMERIC STRING";
  105|       |
  106|     63|      case ASN1_Type::Ia5String:
  ------------------
  |  Branch (106:7): [True: 63, False: 4.43k]
  ------------------
  107|     63|         return "IA5 STRING";
  108|       |
  109|     36|      case ASN1_Type::TeletexString:
  ------------------
  |  Branch (109:7): [True: 36, False: 4.46k]
  ------------------
  110|     36|         return "T61 STRING";
  111|       |
  112|     62|      case ASN1_Type::Utf8String:
  ------------------
  |  Branch (112:7): [True: 62, False: 4.43k]
  ------------------
  113|     62|         return "UTF8 STRING";
  114|       |
  115|     21|      case ASN1_Type::VisibleString:
  ------------------
  |  Branch (115:7): [True: 21, False: 4.47k]
  ------------------
  116|     21|         return "VISIBLE STRING";
  117|       |
  118|     14|      case ASN1_Type::BmpString:
  ------------------
  |  Branch (118:7): [True: 14, False: 4.48k]
  ------------------
  119|     14|         return "BMP STRING";
  120|       |
  121|     16|      case ASN1_Type::UniversalString:
  ------------------
  |  Branch (121:7): [True: 16, False: 4.48k]
  ------------------
  122|     16|         return "UNIVERSAL STRING";
  123|       |
  124|     23|      case ASN1_Type::UtcTime:
  ------------------
  |  Branch (124:7): [True: 23, False: 4.47k]
  ------------------
  125|     23|         return "UTC TIME";
  126|       |
  127|     53|      case ASN1_Type::GeneralizedTime:
  ------------------
  |  Branch (127:7): [True: 53, False: 4.44k]
  ------------------
  128|     53|         return "GENERALIZED TIME";
  129|       |
  130|    231|      case ASN1_Type::OctetString:
  ------------------
  |  Branch (130:7): [True: 231, False: 4.26k]
  ------------------
  131|    231|         return "OCTET STRING";
  132|       |
  133|    335|      case ASN1_Type::BitString:
  ------------------
  |  Branch (133:7): [True: 335, False: 4.16k]
  ------------------
  134|    335|         return "BIT STRING";
  135|       |
  136|     99|      case ASN1_Type::Enumerated:
  ------------------
  |  Branch (136:7): [True: 99, False: 4.39k]
  ------------------
  137|     99|         return "ENUMERATED";
  138|       |
  139|    326|      case ASN1_Type::Integer:
  ------------------
  |  Branch (139:7): [True: 326, False: 4.17k]
  ------------------
  140|    326|         return "INTEGER";
  141|       |
  142|     35|      case ASN1_Type::Null:
  ------------------
  |  Branch (142:7): [True: 35, False: 4.46k]
  ------------------
  143|     35|         return "NULL";
  144|       |
  145|     41|      case ASN1_Type::ObjectId:
  ------------------
  |  Branch (145:7): [True: 41, False: 4.45k]
  ------------------
  146|     41|         return "OBJECT";
  147|       |
  148|     92|      case ASN1_Type::Boolean:
  ------------------
  |  Branch (148:7): [True: 92, False: 4.40k]
  ------------------
  149|     92|         return "BOOLEAN";
  150|       |
  151|      3|      case ASN1_Type::NoObject:
  ------------------
  |  Branch (151:7): [True: 3, False: 4.49k]
  ------------------
  152|      3|         return "NO_OBJECT";
  153|       |
  154|    359|      default:
  ------------------
  |  Branch (154:7): [True: 359, False: 4.13k]
  ------------------
  155|    359|         return "TAG(" + std::to_string(static_cast<uint32_t>(type)) + ")";
  156|  4.49k|   }
  157|  4.49k|}
_ZN5Botan18BER_Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  162|  5.98k|BER_Decoding_Error::BER_Decoding_Error(std::string_view str) : Decoding_Error(fmt("BER: {}", str)) {}
_ZN5Botan11BER_Bad_TagC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEj:
  164|    329|BER_Bad_Tag::BER_Bad_Tag(std::string_view str, uint32_t tagging) : BER_Decoding_Error(fmt("{}: {}", str, tagging)) {}
_ZN5Botan4ASN115put_in_sequenceERKNSt3__16vectorIhNS1_9allocatorIhEEEE:
  171|  15.7k|std::vector<uint8_t> put_in_sequence(const std::vector<uint8_t>& contents) {
  172|  15.7k|   return ASN1::put_in_sequence(contents.data(), contents.size());
  173|  15.7k|}
_ZN5Botan4ASN115put_in_sequenceEPKhm:
  175|  15.7k|std::vector<uint8_t> put_in_sequence(const uint8_t bits[], size_t len) {
  176|  15.7k|   std::vector<uint8_t> output;
  177|  15.7k|   DER_Encoder(output).start_sequence().raw_bytes(bits, len).end_cons();
  178|  15.7k|   return output;
  179|  15.7k|}
_ZN5Botan4ASN19to_stringERKNS_10BER_ObjectE:
  184|  46.8k|std::string to_string(const BER_Object& obj) { return std::string(cast_uint8_ptr_to_char(obj.bits()), obj.length()); }
_ZN5Botan4ASN19maybe_BERERNS_10DataSourceE:
  189|  12.8k|bool maybe_BER(DataSource& source) {
  190|  12.8k|   uint8_t first_u8;
  191|  12.8k|   if(!source.peek_byte(first_u8)) {
  ------------------
  |  Branch (191:7): [True: 2.03k, False: 10.8k]
  ------------------
  192|  2.03k|      BOTAN_ASSERT_EQUAL(source.read_byte(first_u8), 0, "Expected EOF");
  ------------------
  |  |   69|  2.03k|   do {                                                                                                \
  |  |   70|  2.03k|      if((expr1) != (expr2))                                                                           \
  |  |  ------------------
  |  |  |  Branch (70:10): [True: 0, False: 2.03k]
  |  |  ------------------
  |  |   71|  2.03k|         Botan::assertion_failure(#expr1 " == " #expr2, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   72|  2.03k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (72:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  193|  2.03k|      throw Stream_IO_Error("ASN1::maybe_BER: Source was empty");
  194|  2.03k|   }
  195|       |
  196|  10.8k|   const auto cons_seq = static_cast<uint8_t>(ASN1_Class::Constructed) | static_cast<uint8_t>(ASN1_Type::Sequence);
  197|  10.8k|   if(first_u8 == cons_seq) {
  ------------------
  |  Branch (197:7): [True: 8.73k, False: 2.07k]
  ------------------
  198|  8.73k|      return true;
  199|  8.73k|   }
  200|  2.07k|   return false;
  201|  10.8k|}

_ZN5Botan3OID11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   72|    576|OID OID::from_string(std::string_view str) {
   73|    576|   if(str.empty()) {
  ------------------
  |  Branch (73:7): [True: 0, False: 576]
  ------------------
   74|      0|      throw Invalid_Argument("OID::from_string argument must be non-empty");
   75|      0|   }
   76|       |
   77|    576|   OID o = OID_Map::global_registry().str2oid(str);
   78|    576|   if(o.has_value()) {
  ------------------
  |  Branch (78:7): [True: 576, False: 0]
  ------------------
   79|    576|      return o;
   80|    576|   }
   81|       |
   82|      0|   std::vector<uint32_t> raw = parse_oid_str(str);
   83|       |
   84|      0|   if(!raw.empty()) {
  ------------------
  |  Branch (84:7): [True: 0, False: 0]
  ------------------
   85|      0|      return OID(std::move(raw));
   86|      0|   }
   87|       |
   88|      0|   throw Lookup_Error(fmt("No OID associated with name '{}'", str));
   89|      0|}
_ZN5Botan3OIDC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   94|   197k|OID::OID(std::string_view oid_str) {
   95|   197k|   if(!oid_str.empty()) {
  ------------------
  |  Branch (95:7): [True: 197k, False: 0]
  ------------------
   96|   197k|      m_id = parse_oid_str(oid_str);
   97|   197k|      if(m_id.size() < 2 || m_id[0] > 2 || (m_id[0] < 2 && m_id[1] > 39)) {
  ------------------
  |  Branch (97:10): [True: 0, False: 197k]
  |  Branch (97:29): [True: 0, False: 197k]
  |  Branch (97:45): [True: 11.9k, False: 185k]
  |  Branch (97:60): [True: 0, False: 11.9k]
  ------------------
   98|      0|         throw Decoding_Error(fmt("Invalid OID '{}'", oid_str));
   99|      0|      }
  100|   197k|   }
  101|   197k|}
_ZNK5Botan3OID9to_stringEv:
  106|  25.0k|std::string OID::to_string() const {
  107|  25.0k|   std::ostringstream out;
  108|  25.0k|   out << (*this);
  109|  25.0k|   return out.str();
  110|  25.0k|}
_ZNK5Botan3OID19to_formatted_stringEv:
  112|  8.19k|std::string OID::to_formatted_string() const {
  113|  8.19k|   std::string s = this->human_name_or_empty();
  114|  8.19k|   if(!s.empty()) {
  ------------------
  |  Branch (114:7): [True: 6.04k, False: 2.14k]
  ------------------
  115|  6.04k|      return s;
  116|  6.04k|   }
  117|  2.14k|   return this->to_string();
  118|  8.19k|}
_ZNK5Botan3OID19human_name_or_emptyEv:
  120|  8.49k|std::string OID::human_name_or_empty() const { return OID_Map::global_registry().oid2str(*this); }
_ZNK5Botan3OID14registered_oidEv:
  122|    302|bool OID::registered_oid() const { return !human_name_or_empty().empty(); }
_ZN5BotanltERKNS_3OIDES2_:
  127|   189k|bool operator<(const OID& a, const OID& b) {
  128|   189k|   const std::vector<uint32_t>& oid1 = a.get_components();
  129|   189k|   const std::vector<uint32_t>& oid2 = b.get_components();
  130|       |
  131|   189k|   return std::lexicographical_compare(oid1.begin(), oid1.end(), oid2.begin(), oid2.end());
  132|   189k|}
_ZN5BotanlsERNSt3__113basic_ostreamIcNS0_11char_traitsIcEEEERKNS_3OIDE:
  134|  25.0k|std::ostream& operator<<(std::ostream& out, const OID& oid) {
  135|  25.0k|   const auto& val = oid.get_components();
  136|       |
  137|   169k|   for(size_t i = 0; i != val.size(); ++i) {
  ------------------
  |  Branch (137:22): [True: 144k, False: 25.0k]
  ------------------
  138|       |      // avoid locale issues with integer formatting
  139|   144k|      out << std::to_string(val[i]);
  140|   144k|      if(i != val.size() - 1) {
  ------------------
  |  Branch (140:10): [True: 119k, False: 25.0k]
  ------------------
  141|   119k|         out << ".";
  142|   119k|      }
  143|   144k|   }
  144|       |
  145|  25.0k|   return out;
  146|  25.0k|}
_ZNK5Botan3OID11encode_intoERNS_11DER_EncoderE:
  151|  4.01k|void OID::encode_into(DER_Encoder& der) const {
  152|  4.01k|   if(m_id.size() < 2) {
  ------------------
  |  Branch (152:7): [True: 0, False: 4.01k]
  ------------------
  153|      0|      throw Invalid_Argument("OID::encode_into: OID is invalid");
  154|      0|   }
  155|       |
  156|  4.01k|   std::vector<uint8_t> encoding;
  157|       |
  158|  4.01k|   if(m_id[0] > 2 || m_id[1] >= 40) {
  ------------------
  |  Branch (158:7): [True: 8, False: 4.00k]
  |  Branch (158:22): [True: 0, False: 4.00k]
  ------------------
  159|      8|      throw Encoding_Error("Invalid OID prefix, cannot encode");
  160|      8|   }
  161|       |
  162|  4.00k|   encoding.push_back(static_cast<uint8_t>(40 * m_id[0] + m_id[1]));
  163|       |
  164|  22.0k|   for(size_t i = 2; i != m_id.size(); ++i) {
  ------------------
  |  Branch (164:22): [True: 18.0k, False: 4.00k]
  ------------------
  165|  18.0k|      if(m_id[i] == 0) {
  ------------------
  |  Branch (165:10): [True: 453, False: 17.6k]
  ------------------
  166|    453|         encoding.push_back(0);
  167|  17.6k|      } else {
  168|  17.6k|         size_t blocks = high_bit(m_id[i]) + 6;
  169|  17.6k|         blocks = (blocks - (blocks % 7)) / 7;
  170|       |
  171|  17.6k|         BOTAN_ASSERT(blocks > 0, "Math works");
  ------------------
  |  |   51|  17.6k|   do {                                                                                 \
  |  |   52|  17.6k|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 17.6k]
  |  |  ------------------
  |  |   53|  17.6k|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|  17.6k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  172|       |
  173|  26.9k|         for(size_t j = 0; j != blocks - 1; ++j) {
  ------------------
  |  Branch (173:28): [True: 9.29k, False: 17.6k]
  ------------------
  174|  9.29k|            encoding.push_back(0x80 | ((m_id[i] >> 7 * (blocks - j - 1)) & 0x7F));
  175|  9.29k|         }
  176|  17.6k|         encoding.push_back(m_id[i] & 0x7F);
  177|  17.6k|      }
  178|  18.0k|   }
  179|  4.00k|   der.add_object(ASN1_Type::ObjectId, ASN1_Class::Universal, encoding);
  180|  4.00k|}
_ZN5Botan3OID11decode_fromERNS_11BER_DecoderE:
  185|  73.1k|void OID::decode_from(BER_Decoder& decoder) {
  186|  73.1k|   BER_Object obj = decoder.get_next_object();
  187|  73.1k|   if(obj.tagging() != (ASN1_Class::Universal | ASN1_Type::ObjectId)) {
  ------------------
  |  Branch (187:7): [True: 269, False: 72.9k]
  ------------------
  188|    269|      throw BER_Bad_Tag("Error decoding OID, unknown tag", obj.tagging());
  189|    269|   }
  190|       |
  191|  72.9k|   const size_t length = obj.length();
  192|  72.9k|   const uint8_t* bits = obj.bits();
  193|       |
  194|  72.9k|   if(length < 2 && !(length == 1 && bits[0] == 0)) {
  ------------------
  |  Branch (194:7): [True: 2.17k, False: 70.7k]
  |  Branch (194:23): [True: 2.16k, False: 18]
  |  Branch (194:38): [True: 2.13k, False: 23]
  ------------------
  195|     41|      throw BER_Decoding_Error("OID encoding is too short");
  196|     41|   }
  197|       |
  198|  72.8k|   m_id.clear();
  199|  72.8k|   m_id.push_back(bits[0] / 40);
  200|  72.8k|   m_id.push_back(bits[0] % 40);
  201|       |
  202|  72.8k|   size_t i = 0;
  203|   352k|   while(i != length - 1) {
  ------------------
  |  Branch (203:10): [True: 279k, False: 72.8k]
  ------------------
  204|   279k|      uint32_t component = 0;
  205|   345k|      while(i != length - 1) {
  ------------------
  |  Branch (205:13): [True: 344k, False: 1.52k]
  ------------------
  206|   344k|         ++i;
  207|       |
  208|   344k|         if(component >> (32 - 7)) {
  ------------------
  |  Branch (208:13): [True: 55, False: 344k]
  ------------------
  209|     55|            throw Decoding_Error("OID component overflow");
  210|     55|         }
  211|       |
  212|   344k|         component = (component << 7) + (bits[i] & 0x7F);
  213|       |
  214|   344k|         if(!(bits[i] & 0x80)) {
  ------------------
  |  Branch (214:13): [True: 277k, False: 66.1k]
  ------------------
  215|   277k|            break;
  216|   277k|         }
  217|   344k|      }
  218|   279k|      m_id.push_back(component);
  219|   279k|   }
  220|  72.8k|}
asn1_oid.cpp:_ZN5Botan12_GLOBAL__N_113parse_oid_strENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   24|   197k|std::vector<uint32_t> parse_oid_str(std::string_view oid) {
   25|   197k|   try {
   26|   197k|      std::string elem;
   27|   197k|      std::vector<uint32_t> oid_elems;
   28|       |
   29|  1.87M|      for(char c : oid) {
  ------------------
  |  Branch (29:18): [True: 1.87M, False: 197k]
  ------------------
   30|  1.87M|         if(c == '.') {
  ------------------
  |  Branch (30:13): [True: 652k, False: 1.22M]
  ------------------
   31|   652k|            if(elem.empty()) {
  ------------------
  |  Branch (31:16): [True: 0, False: 652k]
  ------------------
   32|      0|               return std::vector<uint32_t>();
   33|      0|            }
   34|   652k|            oid_elems.push_back(to_u32bit(elem));
   35|   652k|            elem.clear();
   36|  1.22M|         } else {
   37|  1.22M|            elem += c;
   38|  1.22M|         }
   39|  1.87M|      }
   40|       |
   41|   197k|      if(!elem.empty()) {
  ------------------
  |  Branch (41:10): [True: 197k, False: 0]
  ------------------
   42|   197k|         oid_elems.push_back(to_u32bit(elem));
   43|   197k|      }
   44|       |
   45|   197k|      return oid_elems;
   46|   197k|   } catch(Invalid_Argument&)  // thrown by to_u32bit
   47|   197k|   {
   48|      0|      return std::vector<uint32_t>();
   49|      0|   }
   50|   197k|}

_ZN5Botan11ASN1_String14is_string_typeENS_9ASN1_TypeE:
   60|    774|bool ASN1_String::is_string_type(ASN1_Type tag) { return is_asn1_string_type(tag); }
_ZN5Botan11ASN1_StringC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_9ASN1_TypeE:
   62|  35.7k|ASN1_String::ASN1_String(std::string_view str, ASN1_Type t) : m_utf8_str(str), m_tag(t) {
   63|  35.7k|   if(!is_utf8_subset_string_type(m_tag)) {
  ------------------
  |  Branch (63:7): [True: 3, False: 35.7k]
  ------------------
   64|      3|      throw Invalid_Argument("ASN1_String only supports encoding to UTF-8 or a UTF-8 subset");
   65|      3|   }
   66|  35.7k|}
_ZN5Botan11ASN1_StringC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   68|  35.2k|ASN1_String::ASN1_String(std::string_view str) : ASN1_String(str, choose_encoding(str)) {}
_ZN5Botan11ASN1_String11decode_fromERNS_11BER_DecoderE:
   86|  35.0k|void ASN1_String::decode_from(BER_Decoder& source) {
   87|  35.0k|   BER_Object obj = source.get_next_object();
   88|       |
   89|  35.0k|   if(!is_asn1_string_type(obj.type())) {
  ------------------
  |  Branch (89:7): [True: 81, False: 35.0k]
  ------------------
   90|     81|      auto typ = static_cast<uint32_t>(obj.type());
   91|     81|      throw Decoding_Error(fmt("ASN1_String: Unknown string type {}", typ));
   92|     81|   }
   93|       |
   94|  35.0k|   m_tag = obj.type();
   95|  35.0k|   m_data.assign(obj.bits(), obj.bits() + obj.length());
   96|       |
   97|  35.0k|   if(m_tag == ASN1_Type::BmpString) {
  ------------------
  |  Branch (97:7): [True: 3.06k, False: 31.9k]
  ------------------
   98|  3.06k|      m_utf8_str = ucs2_to_utf8(m_data.data(), m_data.size());
   99|  31.9k|   } else if(m_tag == ASN1_Type::UniversalString) {
  ------------------
  |  Branch (99:14): [True: 154, False: 31.8k]
  ------------------
  100|    154|      m_utf8_str = ucs4_to_utf8(m_data.data(), m_data.size());
  101|  31.8k|   } else if(m_tag == ASN1_Type::TeletexString) {
  ------------------
  |  Branch (101:14): [True: 806, False: 30.9k]
  ------------------
  102|       |      /*
  103|       |      TeletexString is nominally ITU T.61 not ISO-8859-1 but it seems
  104|       |      the majority of implementations actually used that charset here.
  105|       |      */
  106|    806|      m_utf8_str = latin1_to_utf8(m_data.data(), m_data.size());
  107|  30.9k|   } else {
  108|       |      // All other supported string types are UTF-8 or some subset thereof
  109|  30.9k|      m_utf8_str = ASN1::to_string(obj);
  110|  30.9k|   }
  111|  35.0k|}
asn1_str.cpp:_ZN5Botan12_GLOBAL__N_119is_asn1_string_typeENS_9ASN1_TypeE:
   52|  35.8k|bool is_asn1_string_type(ASN1_Type tag) {
   53|  35.8k|   return (is_utf8_subset_string_type(tag) || tag == ASN1_Type::TeletexString || tag == ASN1_Type::BmpString ||
  ------------------
  |  Branch (53:12): [True: 31.5k, False: 4.26k]
  |  Branch (53:47): [True: 859, False: 3.40k]
  |  Branch (53:82): [True: 3.09k, False: 311]
  ------------------
   54|  35.8k|           tag == ASN1_Type::UniversalString);
  ------------------
  |  Branch (54:12): [True: 160, False: 151]
  ------------------
   55|  35.8k|}
asn1_str.cpp:_ZN5Botan12_GLOBAL__N_126is_utf8_subset_string_typeENS_9ASN1_TypeE:
   47|  71.6k|bool is_utf8_subset_string_type(ASN1_Type tag) {
   48|  71.6k|   return (tag == ASN1_Type::NumericString || tag == ASN1_Type::PrintableString || tag == ASN1_Type::VisibleString ||
  ------------------
  |  Branch (48:12): [True: 227, False: 71.3k]
  |  Branch (48:47): [True: 48.8k, False: 22.5k]
  |  Branch (48:84): [True: 248, False: 22.3k]
  ------------------
   49|  71.6k|           tag == ASN1_Type::Ia5String || tag == ASN1_Type::Utf8String);
  ------------------
  |  Branch (49:12): [True: 3.63k, False: 18.6k]
  |  Branch (49:43): [True: 14.4k, False: 4.26k]
  ------------------
   50|  71.6k|}
asn1_str.cpp:_ZN5Botan12_GLOBAL__N_115choose_encodingENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   23|  35.2k|ASN1_Type choose_encoding(std::string_view str) {
   24|  35.2k|   auto all_printable = CT::Mask<uint8_t>::set();
   25|       |
   26|  35.2k|   for(size_t i = 0; i != str.size(); ++i) {
  ------------------
  |  Branch (26:22): [True: 0, False: 35.2k]
  ------------------
   27|      0|      const uint8_t c = static_cast<uint8_t>(str[i]);
   28|       |
   29|      0|      auto is_alpha_lower = CT::Mask<uint8_t>::is_within_range(c, 'a', 'z');
   30|      0|      auto is_alpha_upper = CT::Mask<uint8_t>::is_within_range(c, 'A', 'Z');
   31|      0|      auto is_decimal = CT::Mask<uint8_t>::is_within_range(c, '0', '9');
   32|       |
   33|      0|      auto is_print_punc = CT::Mask<uint8_t>::is_any_of(c, {' ', '(', ')', '+', ',', '-', '.', '/', ':', '=', '?'});
   34|       |
   35|      0|      auto is_printable = is_alpha_lower | is_alpha_upper | is_decimal | is_print_punc;
   36|       |
   37|      0|      all_printable &= is_printable;
   38|      0|   }
   39|       |
   40|  35.2k|   if(all_printable.is_set()) {
  ------------------
  |  Branch (40:7): [True: 35.2k, False: 0]
  ------------------
   41|  35.2k|      return ASN1_Type::PrintableString;
   42|  35.2k|   } else {
   43|      0|      return ASN1_Type::Utf8String;
   44|      0|   }
   45|  35.2k|}

_ZN5Botan9ASN1_TimeC2ERKNSt3__16chrono10time_pointINS2_12system_clockENS2_8durationIxNS1_5ratioILl1ELl1000000EEEEEEE:
   20|    551|ASN1_Time::ASN1_Time(const std::chrono::system_clock::time_point& time) {
   21|    551|   calendar_point cal(time);
   22|       |
   23|    551|   m_year = cal.year();
   24|    551|   m_month = cal.month();
   25|    551|   m_day = cal.day();
   26|    551|   m_hour = cal.hour();
   27|    551|   m_minute = cal.minutes();
   28|    551|   m_second = cal.seconds();
   29|       |
   30|    551|   m_tag = (m_year >= 2050) ? ASN1_Type::GeneralizedTime : ASN1_Type::UtcTime;
  ------------------
  |  Branch (30:12): [True: 0, False: 551]
  ------------------
   31|    551|}
_ZN5Botan9ASN1_Time11decode_fromERNS_11BER_DecoderE:
   51|  9.86k|void ASN1_Time::decode_from(BER_Decoder& source) {
   52|  9.86k|   BER_Object ber_time = source.get_next_object();
   53|       |
   54|  9.86k|   set_to(ASN1::to_string(ber_time), ber_time.type());
   55|  9.86k|}
_ZNK5Botan9ASN1_Time11time_is_setEv:
  104|  2.20k|bool ASN1_Time::time_is_set() const { return (m_year != 0); }
_ZNK5Botan9ASN1_Time3cmpERKS0_:
  106|  1.10k|int32_t ASN1_Time::cmp(const ASN1_Time& other) const {
  107|  1.10k|   if(!time_is_set() || !other.time_is_set()) {
  ------------------
  |  Branch (107:7): [True: 0, False: 1.10k]
  |  Branch (107:25): [True: 0, False: 1.10k]
  ------------------
  108|      0|      throw Invalid_State("ASN1_Time::cmp: Cannot compare empty times");
  109|      0|   }
  110|       |
  111|  1.10k|   const int32_t EARLIER = -1, LATER = 1, SAME_TIME = 0;
  112|       |
  113|  1.10k|   if(m_year < other.m_year) {
  ------------------
  |  Branch (113:7): [True: 357, False: 745]
  ------------------
  114|    357|      return EARLIER;
  115|    357|   }
  116|    745|   if(m_year > other.m_year) {
  ------------------
  |  Branch (116:7): [True: 673, False: 72]
  ------------------
  117|    673|      return LATER;
  118|    673|   }
  119|     72|   if(m_month < other.m_month) {
  ------------------
  |  Branch (119:7): [True: 20, False: 52]
  ------------------
  120|     20|      return EARLIER;
  121|     20|   }
  122|     52|   if(m_month > other.m_month) {
  ------------------
  |  Branch (122:7): [True: 29, False: 23]
  ------------------
  123|     29|      return LATER;
  124|     29|   }
  125|     23|   if(m_day < other.m_day) {
  ------------------
  |  Branch (125:7): [True: 4, False: 19]
  ------------------
  126|      4|      return EARLIER;
  127|      4|   }
  128|     19|   if(m_day > other.m_day) {
  ------------------
  |  Branch (128:7): [True: 19, False: 0]
  ------------------
  129|     19|      return LATER;
  130|     19|   }
  131|      0|   if(m_hour < other.m_hour) {
  ------------------
  |  Branch (131:7): [True: 0, False: 0]
  ------------------
  132|      0|      return EARLIER;
  133|      0|   }
  134|      0|   if(m_hour > other.m_hour) {
  ------------------
  |  Branch (134:7): [True: 0, False: 0]
  ------------------
  135|      0|      return LATER;
  136|      0|   }
  137|      0|   if(m_minute < other.m_minute) {
  ------------------
  |  Branch (137:7): [True: 0, False: 0]
  ------------------
  138|      0|      return EARLIER;
  139|      0|   }
  140|      0|   if(m_minute > other.m_minute) {
  ------------------
  |  Branch (140:7): [True: 0, False: 0]
  ------------------
  141|      0|      return LATER;
  142|      0|   }
  143|      0|   if(m_second < other.m_second) {
  ------------------
  |  Branch (143:7): [True: 0, False: 0]
  ------------------
  144|      0|      return EARLIER;
  145|      0|   }
  146|      0|   if(m_second > other.m_second) {
  ------------------
  |  Branch (146:7): [True: 0, False: 0]
  ------------------
  147|      0|      return LATER;
  148|      0|   }
  149|       |
  150|      0|   return SAME_TIME;
  151|      0|}
_ZN5Botan9ASN1_Time6set_toENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_9ASN1_TypeE:
  153|  9.86k|void ASN1_Time::set_to(std::string_view t_spec, ASN1_Type spec_tag) {
  154|  9.86k|   BOTAN_ARG_CHECK(spec_tag == ASN1_Type::UtcTime || spec_tag == ASN1_Type::GeneralizedTime,
  ------------------
  |  |   30|  9.86k|   do {                                                          \
  |  |   31|  9.98k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:12): [True: 9.74k, False: 118]
  |  |  |  Branch (31:12): [True: 60, False: 58]
  |  |  ------------------
  |  |   32|  9.86k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  9.86k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  155|  9.86k|                   "Invalid tag for ASN1_Time");
  156|       |
  157|  9.86k|   if(spec_tag == ASN1_Type::GeneralizedTime) {
  ------------------
  |  Branch (157:7): [True: 60, False: 9.80k]
  ------------------
  158|     60|      BOTAN_ARG_CHECK(t_spec.size() == 15, "Invalid GeneralizedTime input string");
  ------------------
  |  |   30|     60|   do {                                                          \
  |  |   31|     60|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 11, False: 49]
  |  |  ------------------
  |  |   32|     60|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|     60|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  159|  9.80k|   } else if(spec_tag == ASN1_Type::UtcTime) {
  ------------------
  |  Branch (159:14): [True: 9.74k, False: 58]
  ------------------
  160|  9.74k|      BOTAN_ARG_CHECK(t_spec.size() == 13, "Invalid UTCTime input string");
  ------------------
  |  |   30|  9.74k|   do {                                                          \
  |  |   31|  9.74k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 10, False: 9.73k]
  |  |  ------------------
  |  |   32|  9.74k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  9.74k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  161|  9.74k|   }
  162|       |
  163|  9.86k|   BOTAN_ARG_CHECK(t_spec.back() == 'Z', "Botan does not support ASN1 times with timezones other than Z");
  ------------------
  |  |   30|  9.86k|   do {                                                          \
  |  |   31|  9.86k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 12, False: 9.85k]
  |  |  ------------------
  |  |   32|  9.86k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  9.86k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  164|       |
  165|  9.86k|   const size_t field_len = 2;
  166|       |
  167|  9.86k|   const size_t year_start = 0;
  168|  9.86k|   const size_t year_len = (spec_tag == ASN1_Type::UtcTime) ? 2 : 4;
  ------------------
  |  Branch (168:28): [True: 9.72k, False: 139]
  ------------------
  169|  9.86k|   const size_t month_start = year_start + year_len;
  170|  9.86k|   const size_t day_start = month_start + field_len;
  171|  9.86k|   const size_t hour_start = day_start + field_len;
  172|  9.86k|   const size_t min_start = hour_start + field_len;
  173|  9.86k|   const size_t sec_start = min_start + field_len;
  174|       |
  175|  9.86k|   m_year = to_u32bit(t_spec.substr(year_start, year_len));
  176|  9.86k|   m_month = to_u32bit(t_spec.substr(month_start, field_len));
  177|  9.86k|   m_day = to_u32bit(t_spec.substr(day_start, field_len));
  178|  9.86k|   m_hour = to_u32bit(t_spec.substr(hour_start, field_len));
  179|  9.86k|   m_minute = to_u32bit(t_spec.substr(min_start, field_len));
  180|  9.86k|   m_second = to_u32bit(t_spec.substr(sec_start, field_len));
  181|  9.86k|   m_tag = spec_tag;
  182|       |
  183|  9.86k|   if(spec_tag == ASN1_Type::UtcTime) {
  ------------------
  |  Branch (183:7): [True: 9.71k, False: 152]
  ------------------
  184|  9.71k|      if(m_year >= 50) {
  ------------------
  |  Branch (184:10): [True: 559, False: 9.15k]
  ------------------
  185|    559|         m_year += 1900;
  186|  9.15k|      } else {
  187|  9.15k|         m_year += 2000;
  188|  9.15k|      }
  189|  9.71k|   }
  190|       |
  191|  9.86k|   if(!passes_sanity_check()) {
  ------------------
  |  Branch (191:7): [True: 62, False: 9.80k]
  ------------------
  192|     62|      throw Invalid_Argument(fmt("ASN1_Time string '{}' does not seem to be valid", t_spec));
  193|     62|   }
  194|  9.86k|}
_ZNK5Botan9ASN1_Time19passes_sanity_checkEv:
  199|  9.75k|bool ASN1_Time::passes_sanity_check() const {
  200|       |   // AppVeyor's trust store includes a cert with expiration date in 3016 ...
  201|  9.75k|   if(m_year < 1950 || m_year > 3100) {
  ------------------
  |  Branch (201:7): [True: 11, False: 9.74k]
  |  Branch (201:24): [True: 7, False: 9.73k]
  ------------------
  202|     18|      return false;
  203|     18|   }
  204|  9.73k|   if(m_month == 0 || m_month > 12) {
  ------------------
  |  Branch (204:7): [True: 1, False: 9.73k]
  |  Branch (204:23): [True: 9, False: 9.72k]
  ------------------
  205|     10|      return false;
  206|     10|   }
  207|       |
  208|  9.72k|   const uint32_t days_in_month[12] = {31, 28 + 1, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
  209|       |
  210|  9.72k|   if(m_day == 0 || m_day > days_in_month[m_month - 1]) {
  ------------------
  |  Branch (210:7): [True: 1, False: 9.72k]
  |  Branch (210:21): [True: 10, False: 9.71k]
  ------------------
  211|     11|      return false;
  212|     11|   }
  213|       |
  214|  9.71k|   if(m_month == 2 && m_day == 29) {
  ------------------
  |  Branch (214:7): [True: 1.36k, False: 8.35k]
  |  Branch (214:23): [True: 107, False: 1.25k]
  ------------------
  215|    107|      if(m_year % 4 != 0) {
  ------------------
  |  Branch (215:10): [True: 4, False: 103]
  ------------------
  216|      4|         return false;  // not a leap year
  217|      4|      }
  218|       |
  219|    103|      if(m_year % 100 == 0 && m_year % 400 != 0) {
  ------------------
  |  Branch (219:10): [True: 43, False: 60]
  |  Branch (219:31): [True: 2, False: 41]
  ------------------
  220|      2|         return false;
  221|      2|      }
  222|    103|   }
  223|       |
  224|  9.71k|   if(m_hour >= 24 || m_minute >= 60 || m_second > 60) {
  ------------------
  |  Branch (224:7): [True: 7, False: 9.70k]
  |  Branch (224:23): [True: 5, False: 9.69k]
  |  Branch (224:41): [True: 4, False: 9.69k]
  ------------------
  225|     16|      return false;
  226|     16|   }
  227|       |
  228|  9.69k|   if(m_tag == ASN1_Type::UtcTime) {
  ------------------
  |  Branch (228:7): [True: 9.68k, False: 7]
  ------------------
  229|       |      /*
  230|       |      UTCTime limits the value of components such that leap seconds
  231|       |      are not covered. See "UNIVERSAL 23" in "Information technology
  232|       |      Abstract Syntax Notation One (ASN.1): Specification of basic notation"
  233|       |
  234|       |      http://www.itu.int/ITU-T/studygroups/com17/languages/
  235|       |      */
  236|  9.68k|      if(m_second > 59) {
  ------------------
  |  Branch (236:10): [True: 1, False: 9.68k]
  ------------------
  237|      1|         return false;
  238|      1|      }
  239|  9.68k|   }
  240|       |
  241|  9.69k|   return true;
  242|  9.69k|}
_ZN5BotanltERKNS_9ASN1_TimeES2_:
  264|    551|bool operator<(const ASN1_Time& t1, const ASN1_Time& t2) { return (t1.cmp(t2) < 0); }
_ZN5BotangtERKNS_9ASN1_TimeES2_:
  266|    551|bool operator>(const ASN1_Time& t1, const ASN1_Time& t2) { return (t1.cmp(t2) > 0); }

_ZNK5Botan11BER_Decoder10more_itemsEv:
  195|   162k|bool BER_Decoder::more_items() const {
  196|   162k|   if(m_source->end_of_data() && !m_pushed.is_set()) {
  ------------------
  |  Branch (196:7): [True: 50.0k, False: 112k]
  |  Branch (196:34): [True: 50.0k, False: 0]
  ------------------
  197|  50.0k|      return false;
  198|  50.0k|   }
  199|   112k|   return true;
  200|   162k|}
_ZN5Botan11BER_Decoder10verify_endEv:
  205|  11.9k|BER_Decoder& BER_Decoder::verify_end() { return verify_end("BER_Decoder::verify_end called, but data remains"); }
_ZN5Botan11BER_Decoder10verify_endENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  210|  16.7k|BER_Decoder& BER_Decoder::verify_end(std::string_view err) {
  211|  16.7k|   if(!m_source->end_of_data() || m_pushed.is_set()) {
  ------------------
  |  Branch (211:7): [True: 97, False: 16.6k]
  |  Branch (211:35): [True: 0, False: 16.6k]
  ------------------
  212|     97|      throw Decoding_Error(err);
  213|     97|   }
  214|  16.6k|   return (*this);
  215|  16.7k|}
_ZN5Botan11BER_Decoder17discard_remainingEv:
  220|    199|BER_Decoder& BER_Decoder::discard_remaining() {
  221|    199|   uint8_t buf;
  222|  9.05k|   while(m_source->read_byte(buf)) {}
  ------------------
  |  Branch (222:10): [True: 8.85k, False: 199]
  ------------------
  223|    199|   return (*this);
  224|    199|}
_ZN5Botan11BER_Decoder15get_next_objectEv:
  229|   384k|BER_Object BER_Decoder::get_next_object() {
  230|   384k|   BER_Object next;
  231|       |
  232|   384k|   if(m_pushed.is_set()) {
  ------------------
  |  Branch (232:7): [True: 24.4k, False: 360k]
  ------------------
  233|  24.4k|      std::swap(next, m_pushed);
  234|  24.4k|      return next;
  235|  24.4k|   }
  236|       |
  237|   379k|   for(;;) {
  238|   379k|      ASN1_Type type_tag;
  239|   379k|      ASN1_Class class_tag;
  240|   379k|      decode_tag(m_source, type_tag, class_tag);
  241|   379k|      next.set_tagging(type_tag, class_tag);
  242|   379k|      if(next.is_set() == false) {  // no more objects
  ------------------
  |  Branch (242:10): [True: 5.56k, False: 373k]
  ------------------
  243|  5.56k|         return next;
  244|  5.56k|      }
  245|       |
  246|   373k|      size_t field_size;
  247|   373k|      const size_t length = decode_length(m_source, field_size, ALLOWED_EOC_NESTINGS);
  248|   373k|      if(!m_source->check_available(length)) {
  ------------------
  |  Branch (248:10): [True: 1.41k, False: 372k]
  ------------------
  249|  1.41k|         throw BER_Decoding_Error("Value truncated");
  250|  1.41k|      }
  251|       |
  252|   372k|      uint8_t* out = next.mutable_bits(length);
  253|   372k|      if(m_source->read(out, length) != length) {
  ------------------
  |  Branch (253:10): [True: 0, False: 372k]
  ------------------
  254|      0|         throw BER_Decoding_Error("Value truncated");
  255|      0|      }
  256|       |
  257|   372k|      if(next.tagging() == static_cast<uint32_t>(ASN1_Type::Eoc)) {
  ------------------
  |  Branch (257:10): [True: 19.0k, False: 353k]
  ------------------
  258|  19.0k|         continue;
  259|   353k|      } else {
  260|   353k|         break;
  261|   353k|      }
  262|   372k|   }
  263|       |
  264|   353k|   return next;
  265|   360k|}
_ZN5Botan11BER_Decoder9push_backERKNS_10BER_ObjectE:
  270|    510|void BER_Decoder::push_back(const BER_Object& obj) {
  271|    510|   if(m_pushed.is_set()) {
  ------------------
  |  Branch (271:7): [True: 0, False: 510]
  ------------------
  272|      0|      throw Invalid_State("BER_Decoder: Only one push back is allowed");
  273|      0|   }
  274|    510|   m_pushed = obj;
  275|    510|}
_ZN5Botan11BER_Decoder9push_backEONS_10BER_ObjectE:
  277|  27.7k|void BER_Decoder::push_back(BER_Object&& obj) {
  278|  27.7k|   if(m_pushed.is_set()) {
  ------------------
  |  Branch (278:7): [True: 0, False: 27.7k]
  ------------------
  279|      0|      throw Invalid_State("BER_Decoder: Only one push back is allowed");
  280|      0|   }
  281|  27.7k|   m_pushed = std::move(obj);
  282|  27.7k|}
_ZN5Botan11BER_Decoder10start_consENS_9ASN1_TypeENS_10ASN1_ClassE:
  284|   151k|BER_Decoder BER_Decoder::start_cons(ASN1_Type type_tag, ASN1_Class class_tag) {
  285|   151k|   BER_Object obj = get_next_object();
  286|   151k|   obj.assert_is_a(type_tag, class_tag | ASN1_Class::Constructed);
  287|   151k|   return BER_Decoder(std::move(obj), this);
  288|   151k|}
_ZN5Botan11BER_Decoder8end_consEv:
  293|   103k|BER_Decoder& BER_Decoder::end_cons() {
  294|   103k|   if(!m_parent) {
  ------------------
  |  Branch (294:7): [True: 0, False: 103k]
  ------------------
  295|      0|      throw Invalid_State("BER_Decoder::end_cons called with null parent");
  296|      0|   }
  297|   103k|   if(!m_source->end_of_data()) {
  ------------------
  |  Branch (297:7): [True: 330, False: 103k]
  ------------------
  298|    330|      throw Decoding_Error("BER_Decoder::end_cons called with data left");
  299|    330|   }
  300|   103k|   return (*m_parent);
  301|   103k|}
_ZN5Botan11BER_DecoderC2EONS_10BER_ObjectEPS0_:
  303|   152k|BER_Decoder::BER_Decoder(BER_Object&& obj, BER_Decoder* parent) {
  304|   152k|   m_data_src = std::make_unique<DataSource_BERObject>(std::move(obj));
  305|   152k|   m_source = m_data_src.get();
  306|   152k|   m_parent = parent;
  307|   152k|}
_ZN5Botan11BER_DecoderC2ERNS_10DataSourceE:
  312|  10.2k|BER_Decoder::BER_Decoder(DataSource& src) { m_source = &src; }
_ZN5Botan11BER_DecoderC2EPKhm:
  317|  11.0k|BER_Decoder::BER_Decoder(const uint8_t data[], size_t length) {
  318|  11.0k|   m_data_src = std::make_unique<DataSource_Memory>(data, length);
  319|  11.0k|   m_source = m_data_src.get();
  320|  11.0k|}
_ZN5Botan11BER_DecoderC2ERKNSt3__16vectorIhNS1_9allocatorIhEEEE:
  333|  28.1k|BER_Decoder::BER_Decoder(const std::vector<uint8_t>& data) {
  334|  28.1k|   m_data_src = std::make_unique<DataSource_Memory>(data.data(), data.size());
  335|  28.1k|   m_source = m_data_src.get();
  336|  28.1k|}
_ZN5Botan11BER_Decoder6decodeERNS_11ASN1_ObjectENS_9ASN1_TypeENS_10ASN1_ClassE:
  352|   156k|BER_Decoder& BER_Decoder::decode(ASN1_Object& obj, ASN1_Type /*unused*/, ASN1_Class /*unused*/) {
  353|   156k|   obj.decode_from(*this);
  354|   156k|   return (*this);
  355|   156k|}
_ZN5Botan11BER_Decoder6decodeERbNS_9ASN1_TypeENS_10ASN1_ClassE:
  379|  2.50k|BER_Decoder& BER_Decoder::decode(bool& out, ASN1_Type type_tag, ASN1_Class class_tag) {
  380|  2.50k|   BER_Object obj = get_next_object();
  381|  2.50k|   obj.assert_is_a(type_tag, class_tag);
  382|       |
  383|  2.50k|   if(obj.length() != 1) {
  ------------------
  |  Branch (383:7): [True: 10, False: 2.49k]
  ------------------
  384|     10|      throw BER_Decoding_Error("BER boolean value had invalid size");
  385|     10|   }
  386|       |
  387|  2.49k|   out = (obj.bits()[0]) ? true : false;
  ------------------
  |  Branch (387:10): [True: 2.46k, False: 30]
  ------------------
  388|  2.49k|   return (*this);
  389|  2.50k|}
_ZN5Botan11BER_Decoder6decodeERmNS_9ASN1_TypeENS_10ASN1_ClassE:
  394|  4.51k|BER_Decoder& BER_Decoder::decode(size_t& out, ASN1_Type type_tag, ASN1_Class class_tag) {
  395|  4.51k|   BigInt integer;
  396|  4.51k|   decode(integer, type_tag, class_tag);
  397|       |
  398|  4.51k|   if(integer.is_negative()) {
  ------------------
  |  Branch (398:7): [True: 24, False: 4.48k]
  ------------------
  399|     24|      throw BER_Decoding_Error("Decoded small integer value was negative");
  400|     24|   }
  401|       |
  402|  4.48k|   if(integer.bits() > 32) {
  ------------------
  |  Branch (402:7): [True: 119, False: 4.36k]
  ------------------
  403|    119|      throw BER_Decoding_Error("Decoded integer value larger than expected");
  404|    119|   }
  405|       |
  406|  4.36k|   out = 0;
  407|  21.3k|   for(size_t i = 0; i != 4; ++i) {
  ------------------
  |  Branch (407:22): [True: 16.9k, False: 4.36k]
  ------------------
  408|  16.9k|      out = (out << 8) | integer.byte_at(3 - i);
  409|  16.9k|   }
  410|       |
  411|  4.36k|   return (*this);
  412|  4.48k|}
_ZN5Botan11BER_Decoder6decodeERNS_6BigIntENS_9ASN1_TypeENS_10ASN1_ClassE:
  440|  14.4k|BER_Decoder& BER_Decoder::decode(BigInt& out, ASN1_Type type_tag, ASN1_Class class_tag) {
  441|  14.4k|   BER_Object obj = get_next_object();
  442|  14.4k|   obj.assert_is_a(type_tag, class_tag);
  443|       |
  444|  14.4k|   if(obj.length() == 0) {
  ------------------
  |  Branch (444:7): [True: 900, False: 13.5k]
  ------------------
  445|    900|      out.clear();
  446|  13.5k|   } else {
  447|  13.5k|      const bool negative = (obj.bits()[0] & 0x80) ? true : false;
  ------------------
  |  Branch (447:29): [True: 893, False: 12.6k]
  ------------------
  448|       |
  449|  13.5k|      if(negative) {
  ------------------
  |  Branch (449:10): [True: 893, False: 12.6k]
  ------------------
  450|    893|         secure_vector<uint8_t> vec(obj.bits(), obj.bits() + obj.length());
  451|  1.58k|         for(size_t i = obj.length(); i > 0; --i) {
  ------------------
  |  Branch (451:39): [True: 1.58k, False: 0]
  ------------------
  452|  1.58k|            if(vec[i - 1]--) {
  ------------------
  |  Branch (452:16): [True: 893, False: 687]
  ------------------
  453|    893|               break;
  454|    893|            }
  455|  1.58k|         }
  456|  32.3k|         for(size_t i = 0; i != obj.length(); ++i) {
  ------------------
  |  Branch (456:28): [True: 31.5k, False: 893]
  ------------------
  457|  31.5k|            vec[i] = ~vec[i];
  458|  31.5k|         }
  459|    893|         out = BigInt(vec.data(), vec.size());
  460|    893|         out.flip_sign();
  461|  12.6k|      } else {
  462|  12.6k|         out = BigInt(obj.bits(), obj.length());
  463|  12.6k|      }
  464|  13.5k|   }
  465|       |
  466|  14.4k|   return (*this);
  467|  14.4k|}
_ZN5Botan11BER_Decoder6decodeERNSt3__16vectorIhNS1_9allocatorIhEEEENS_9ASN1_TypeES7_NS_10ASN1_ClassE:
  517|  29.3k|                                 ASN1_Class class_tag) {
  518|  29.3k|   if(real_type != ASN1_Type::OctetString && real_type != ASN1_Type::BitString) {
  ------------------
  |  Branch (518:7): [True: 14.2k, False: 15.1k]
  |  Branch (518:46): [True: 0, False: 14.2k]
  ------------------
  519|      0|      throw BER_Bad_Tag("Bad tag for {BIT,OCTET} STRING", static_cast<uint32_t>(real_type));
  520|      0|   }
  521|       |
  522|  29.3k|   asn1_decode_binary_string(buffer, get_next_object(), real_type, type_tag, class_tag);
  523|  29.3k|   return (*this);
  524|  29.3k|}
ber_dec.cpp:_ZN5Botan12_GLOBAL__N_110decode_tagEPNS_10DataSourceERNS_9ASN1_TypeERNS_10ASN1_ClassE:
   29|   411k|size_t decode_tag(DataSource* ber, ASN1_Type& type_tag, ASN1_Class& class_tag) {
   30|   411k|   uint8_t b;
   31|   411k|   if(!ber->read_byte(b)) {
  ------------------
  |  Branch (31:7): [True: 9.46k, False: 401k]
  ------------------
   32|  9.46k|      type_tag = ASN1_Type::NoObject;
   33|  9.46k|      class_tag = ASN1_Class::NoObject;
   34|  9.46k|      return 0;
   35|  9.46k|   }
   36|       |
   37|   401k|   if((b & 0x1F) != 0x1F) {
  ------------------
  |  Branch (37:7): [True: 399k, False: 1.70k]
  ------------------
   38|   399k|      type_tag = ASN1_Type(b & 0x1F);
   39|   399k|      class_tag = ASN1_Class(b & 0xE0);
   40|   399k|      return 1;
   41|   399k|   }
   42|       |
   43|  1.70k|   size_t tag_bytes = 1;
   44|  1.70k|   class_tag = ASN1_Class(b & 0xE0);
   45|       |
   46|  1.70k|   size_t tag_buf = 0;
   47|  12.6k|   while(true) {
  ------------------
  |  Branch (47:10): [Folded - Ignored]
  ------------------
   48|  12.6k|      if(!ber->read_byte(b)) {
  ------------------
  |  Branch (48:10): [True: 50, False: 12.5k]
  ------------------
   49|     50|         throw BER_Decoding_Error("Long-form tag truncated");
   50|     50|      }
   51|  12.5k|      if(tag_buf & 0xFF000000) {
  ------------------
  |  Branch (51:10): [True: 35, False: 12.5k]
  ------------------
   52|     35|         throw BER_Decoding_Error("Long-form tag overflowed 32 bits");
   53|     35|      }
   54|  12.5k|      ++tag_bytes;
   55|  12.5k|      tag_buf = (tag_buf << 7) | (b & 0x7F);
   56|  12.5k|      if((b & 0x80) == 0) {
  ------------------
  |  Branch (56:10): [True: 1.61k, False: 10.9k]
  ------------------
   57|  1.61k|         break;
   58|  1.61k|      }
   59|  12.5k|   }
   60|  1.61k|   type_tag = ASN1_Type(tag_buf);
   61|  1.61k|   return tag_bytes;
   62|  1.70k|}
ber_dec.cpp:_ZN5Botan12_GLOBAL__N_113decode_lengthEPNS_10DataSourceERmm:
   72|   401k|size_t decode_length(DataSource* ber, size_t& field_size, size_t allow_indef) {
   73|   401k|   uint8_t b;
   74|   401k|   if(!ber->read_byte(b)) {
  ------------------
  |  Branch (74:7): [True: 295, False: 401k]
  ------------------
   75|    295|      throw BER_Decoding_Error("Length field not found");
   76|    295|   }
   77|   401k|   field_size = 1;
   78|   401k|   if((b & 0x80) == 0) {
  ------------------
  |  Branch (78:7): [True: 364k, False: 37.1k]
  ------------------
   79|   364k|      return b;
   80|   364k|   }
   81|       |
   82|  37.1k|   field_size += (b & 0x7F);
   83|  37.1k|   if(field_size > 5) {
  ------------------
  |  Branch (83:7): [True: 701, False: 36.4k]
  ------------------
   84|    701|      throw BER_Decoding_Error("Length field is too large");
   85|    701|   }
   86|       |
   87|  36.4k|   if(field_size == 1) {
  ------------------
  |  Branch (87:7): [True: 6.91k, False: 29.5k]
  ------------------
   88|  6.91k|      if(allow_indef == 0) {
  ------------------
  |  Branch (88:10): [True: 9, False: 6.90k]
  ------------------
   89|      9|         throw BER_Decoding_Error("Nested EOC markers too deep, rejecting to avoid stack exhaustion");
   90|  6.90k|      } else {
   91|  6.90k|         return find_eoc(ber, allow_indef - 1);
   92|  6.90k|      }
   93|  6.91k|   }
   94|       |
   95|  29.5k|   size_t length = 0;
   96|       |
   97|  73.6k|   for(size_t i = 0; i != field_size - 1; ++i) {
  ------------------
  |  Branch (97:22): [True: 44.1k, False: 29.4k]
  ------------------
   98|  44.1k|      if(get_byte<0>(length) != 0) {
  ------------------
  |  Branch (98:10): [True: 0, False: 44.1k]
  ------------------
   99|      0|         throw BER_Decoding_Error("Field length overflow");
  100|      0|      }
  101|  44.1k|      if(!ber->read_byte(b)) {
  ------------------
  |  Branch (101:10): [True: 44, False: 44.1k]
  ------------------
  102|     44|         throw BER_Decoding_Error("Corrupted length field");
  103|     44|      }
  104|  44.1k|      length = (length << 8) | b;
  105|  44.1k|   }
  106|  29.4k|   return length;
  107|  29.5k|}
ber_dec.cpp:_ZN5Botan12_GLOBAL__N_18find_eocEPNS_10DataSourceEm:
  112|  6.90k|size_t find_eoc(DataSource* ber, size_t allow_indef) {
  113|  6.90k|   secure_vector<uint8_t> buffer(BOTAN_DEFAULT_BUFFER_SIZE), data;
  ------------------
  |  |  372|  6.90k|#define BOTAN_DEFAULT_BUFFER_SIZE 4096
  ------------------
  114|       |
  115|  13.9k|   while(true) {
  ------------------
  |  Branch (115:10): [Folded - Ignored]
  ------------------
  116|  13.9k|      const size_t got = ber->peek(buffer.data(), buffer.size(), data.size());
  117|  13.9k|      if(got == 0) {
  ------------------
  |  Branch (117:10): [True: 6.90k, False: 7.07k]
  ------------------
  118|  6.90k|         break;
  119|  6.90k|      }
  120|       |
  121|  7.07k|      data += std::make_pair(buffer.data(), got);
  122|  7.07k|   }
  123|       |
  124|  6.90k|   DataSource_Memory source(data);
  125|  6.90k|   data.clear();
  126|       |
  127|  6.90k|   size_t length = 0;
  128|  32.4k|   while(true) {
  ------------------
  |  Branch (128:10): [Folded - Ignored]
  ------------------
  129|  31.9k|      ASN1_Type type_tag;
  130|  31.9k|      ASN1_Class class_tag;
  131|  31.9k|      size_t tag_size = decode_tag(&source, type_tag, class_tag);
  132|  31.9k|      if(type_tag == ASN1_Type::NoObject) {
  ------------------
  |  Branch (132:10): [True: 3.99k, False: 27.9k]
  ------------------
  133|  3.99k|         break;
  134|  3.99k|      }
  135|       |
  136|  27.9k|      size_t length_size = 0;
  137|  27.9k|      size_t item_size = decode_length(&source, length_size, allow_indef);
  138|  27.9k|      source.discard_next(item_size);
  139|       |
  140|  27.9k|      length = BOTAN_CHECKED_ADD(length, item_size);
  ------------------
  |  |   72|  27.9k|#define BOTAN_CHECKED_ADD(x, y) checked_add(x, y, __FILE__, __LINE__)
  ------------------
  141|  27.9k|      length = BOTAN_CHECKED_ADD(length, tag_size);
  ------------------
  |  |   72|  27.9k|#define BOTAN_CHECKED_ADD(x, y) checked_add(x, y, __FILE__, __LINE__)
  ------------------
  142|  27.9k|      length = BOTAN_CHECKED_ADD(length, length_size);
  ------------------
  |  |   72|  27.9k|#define BOTAN_CHECKED_ADD(x, y) checked_add(x, y, __FILE__, __LINE__)
  ------------------
  143|       |
  144|  27.9k|      if(type_tag == ASN1_Type::Eoc && class_tag == ASN1_Class::Universal) {
  ------------------
  |  Branch (144:10): [True: 4.36k, False: 23.6k]
  |  Branch (144:40): [True: 2.47k, False: 1.89k]
  ------------------
  145|  2.47k|         break;
  146|  2.47k|      }
  147|  27.9k|   }
  148|  6.90k|   return length;
  149|  6.90k|}
ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObjectC2EONS_10BER_ObjectE:
  183|   152k|      explicit DataSource_BERObject(BER_Object&& obj) : m_obj(std::move(obj)), m_offset(0) {}
ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObject4readEPhm:
  153|  4.71M|      size_t read(uint8_t out[], size_t length) override {
  154|  4.71M|         BOTAN_ASSERT_NOMSG(m_offset <= m_obj.length());
  ------------------
  |  |   60|  4.71M|   do {                                                                     \
  |  |   61|  4.71M|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 4.71M]
  |  |  ------------------
  |  |   62|  4.71M|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|  4.71M|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  155|  4.71M|         const size_t got = std::min<size_t>(m_obj.length() - m_offset, length);
  156|  4.71M|         copy_mem(out, m_obj.bits() + m_offset, got);
  157|  4.71M|         m_offset += got;
  158|  4.71M|         return got;
  159|  4.71M|      }
ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObject15check_availableEm:
  174|   257k|      bool check_available(size_t n) override {
  175|   257k|         BOTAN_ASSERT_NOMSG(m_offset <= m_obj.length());
  ------------------
  |  |   60|   257k|   do {                                                                     \
  |  |   61|   257k|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 257k]
  |  |  ------------------
  |  |   62|   257k|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|   257k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  176|   257k|         return (n <= (m_obj.length() - m_offset));
  177|   257k|      }
ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_120DataSource_BERObject4peekEPhmm:
  161|  2.00k|      size_t peek(uint8_t out[], size_t length, size_t peek_offset) const override {
  162|  2.00k|         BOTAN_ASSERT_NOMSG(m_offset <= m_obj.length());
  ------------------
  |  |   60|  2.00k|   do {                                                                     \
  |  |   61|  2.00k|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 2.00k]
  |  |  ------------------
  |  |   62|  2.00k|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|  2.00k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  163|  2.00k|         const size_t bytes_left = m_obj.length() - m_offset;
  164|       |
  165|  2.00k|         if(peek_offset >= bytes_left) {
  ------------------
  |  Branch (165:13): [True: 1.00k, False: 1.00k]
  ------------------
  166|  1.00k|            return 0;
  167|  1.00k|         }
  168|       |
  169|  1.00k|         const size_t got = std::min(bytes_left - peek_offset, length);
  170|  1.00k|         copy_mem(out, m_obj.bits() + m_offset + peek_offset, got);
  171|  1.00k|         return got;
  172|  2.00k|      }
ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_120DataSource_BERObject11end_of_dataEv:
  179|   225k|      bool end_of_data() const override { return get_bytes_read() == m_obj.length(); }
ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_120DataSource_BERObject14get_bytes_readEv:
  181|   225k|      size_t get_bytes_read() const override { return m_offset; }
ber_dec.cpp:_ZN5Botan12_GLOBAL__N_125asn1_decode_binary_stringINSt3__19allocatorIhEEEEvRNS2_6vectorIhT_EERKNS_10BER_ObjectENS_9ASN1_TypeESC_NS_10ASN1_ClassE:
  476|  29.2k|                               ASN1_Class class_tag) {
  477|  29.2k|   obj.assert_is_a(type_tag, class_tag);
  478|       |
  479|  29.2k|   if(real_type == ASN1_Type::OctetString) {
  ------------------
  |  Branch (479:7): [True: 14.8k, False: 14.3k]
  ------------------
  480|  14.8k|      buffer.assign(obj.bits(), obj.bits() + obj.length());
  481|  14.8k|   } else {
  482|  14.3k|      if(obj.length() == 0) {
  ------------------
  |  Branch (482:10): [True: 2, False: 14.3k]
  ------------------
  483|      2|         throw BER_Decoding_Error("Invalid BIT STRING");
  484|      2|      }
  485|  14.3k|      if(obj.bits()[0] >= 8) {
  ------------------
  |  Branch (485:10): [True: 11, False: 14.3k]
  ------------------
  486|     11|         throw BER_Decoding_Error("Bad number of unused bits in BIT STRING");
  487|     11|      }
  488|       |
  489|  14.3k|      buffer.resize(obj.length() - 1);
  490|       |
  491|  14.3k|      if(obj.length() > 1) {
  ------------------
  |  Branch (491:10): [True: 11.2k, False: 3.07k]
  ------------------
  492|  11.2k|         copy_mem(buffer.data(), obj.bits() + 1, obj.length() - 1);
  493|  11.2k|      }
  494|  14.3k|   }
  495|  29.2k|}

_ZN5Botan11DER_EncoderC2ERNSt3__16vectorIhNS1_9allocatorIhEEEE:
   71|  20.1k|DER_Encoder::DER_Encoder(std::vector<uint8_t>& vec) {
   72|  20.1k|   m_append_output = [&vec](const uint8_t b[], size_t l) { vec.insert(vec.end(), b, b + l); };
   73|  20.1k|}
_ZN5Botan11DER_Encoder12DER_Sequence13push_contentsERS0_:
   78|  28.1k|void DER_Encoder::DER_Sequence::push_contents(DER_Encoder& der) {
   79|  28.1k|   const auto real_class_tag = m_class_tag | ASN1_Class::Constructed;
   80|       |
   81|  28.1k|   if(m_type_tag == ASN1_Type::Set) {
  ------------------
  |  Branch (81:7): [True: 0, False: 28.1k]
  ------------------
   82|      0|      std::sort(m_set_contents.begin(), m_set_contents.end());
   83|      0|      for(const auto& set_elem : m_set_contents) {
  ------------------
  |  Branch (83:32): [True: 0, False: 0]
  ------------------
   84|      0|         m_contents += set_elem;
   85|      0|      }
   86|      0|      m_set_contents.clear();
   87|      0|   }
   88|       |
   89|  28.1k|   der.add_object(m_type_tag, real_class_tag, m_contents.data(), m_contents.size());
   90|  28.1k|   m_contents.clear();
   91|  28.1k|}
_ZN5Botan11DER_Encoder12DER_Sequence9add_bytesEPKhm:
   96|  23.8k|void DER_Encoder::DER_Sequence::add_bytes(const uint8_t data[], size_t length) {
   97|  23.8k|   if(m_type_tag == ASN1_Type::Set) {
  ------------------
  |  Branch (97:7): [True: 0, False: 23.8k]
  ------------------
   98|      0|      m_set_contents.push_back(secure_vector<uint8_t>(data, data + length));
   99|  23.8k|   } else {
  100|  23.8k|      m_contents += std::make_pair(data, length);
  101|  23.8k|   }
  102|  23.8k|}
_ZN5Botan11DER_Encoder12DER_Sequence9add_bytesEPKhmS3_m:
  104|  16.6k|void DER_Encoder::DER_Sequence::add_bytes(const uint8_t hdr[], size_t hdr_len, const uint8_t val[], size_t val_len) {
  105|  16.6k|   if(m_type_tag == ASN1_Type::Set) {
  ------------------
  |  Branch (105:7): [True: 0, False: 16.6k]
  ------------------
  106|      0|      secure_vector<uint8_t> m;
  107|      0|      m.reserve(hdr_len + val_len);
  108|      0|      m += std::make_pair(hdr, hdr_len);
  109|      0|      m += std::make_pair(val, val_len);
  110|      0|      m_set_contents.push_back(std::move(m));
  111|  16.6k|   } else {
  112|  16.6k|      m_contents += std::make_pair(hdr, hdr_len);
  113|  16.6k|      m_contents += std::make_pair(val, val_len);
  114|  16.6k|   }
  115|  16.6k|}
_ZN5Botan11DER_Encoder12DER_SequenceC2ENS_9ASN1_TypeENS_10ASN1_ClassE:
  125|  28.1k|DER_Encoder::DER_Sequence::DER_Sequence(ASN1_Type t1, ASN1_Class t2) : m_type_tag(t1), m_class_tag(t2) {}
_ZN5Botan11DER_Encoder10start_consENS_9ASN1_TypeENS_10ASN1_ClassE:
  161|  28.1k|DER_Encoder& DER_Encoder::start_cons(ASN1_Type type_tag, ASN1_Class class_tag) {
  162|  28.1k|   m_subsequences.push_back(DER_Sequence(type_tag, class_tag));
  163|  28.1k|   return (*this);
  164|  28.1k|}
_ZN5Botan11DER_Encoder8end_consEv:
  169|  28.1k|DER_Encoder& DER_Encoder::end_cons() {
  170|  28.1k|   if(m_subsequences.empty()) {
  ------------------
  |  Branch (170:7): [True: 0, False: 28.1k]
  ------------------
  171|      0|      throw Invalid_State("DER_Encoder::end_cons: No such sequence");
  172|      0|   }
  173|       |
  174|  28.1k|   DER_Sequence last_seq = std::move(m_subsequences[m_subsequences.size() - 1]);
  175|  28.1k|   m_subsequences.pop_back();
  176|  28.1k|   last_seq.push_contents(*this);
  177|       |
  178|  28.1k|   return (*this);
  179|  28.1k|}
_ZN5Botan11DER_Encoder9raw_bytesEPKhm:
  203|  23.8k|DER_Encoder& DER_Encoder::raw_bytes(const uint8_t bytes[], size_t length) {
  204|  23.8k|   if(!m_subsequences.empty()) {
  ------------------
  |  Branch (204:7): [True: 23.8k, False: 0]
  ------------------
  205|  23.8k|      m_subsequences[m_subsequences.size() - 1].add_bytes(bytes, length);
  206|  23.8k|   } else if(m_append_output) {
  ------------------
  |  Branch (206:14): [True: 0, False: 0]
  ------------------
  207|      0|      m_append_output(bytes, length);
  208|      0|   } else {
  209|      0|      m_default_outbuf += std::make_pair(bytes, length);
  210|      0|   }
  211|       |
  212|  23.8k|   return (*this);
  213|  23.8k|}
_ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassEPKhm:
  218|  36.8k|DER_Encoder& DER_Encoder::add_object(ASN1_Type type_tag, ASN1_Class class_tag, const uint8_t rep[], size_t length) {
  219|  36.8k|   std::vector<uint8_t> hdr;
  220|  36.8k|   encode_tag(hdr, type_tag, class_tag);
  221|  36.8k|   encode_length(hdr, length);
  222|       |
  223|  36.8k|   if(!m_subsequences.empty()) {
  ------------------
  |  Branch (223:7): [True: 16.6k, False: 20.1k]
  ------------------
  224|  16.6k|      m_subsequences[m_subsequences.size() - 1].add_bytes(hdr.data(), hdr.size(), rep, length);
  225|  20.1k|   } else if(m_append_output) {
  ------------------
  |  Branch (225:14): [True: 20.1k, False: 0]
  ------------------
  226|  20.1k|      m_append_output(hdr.data(), hdr.size());
  227|  20.1k|      m_append_output(rep, length);
  228|  20.1k|   } else {
  229|      0|      m_default_outbuf += hdr;
  230|      0|      m_default_outbuf += std::make_pair(rep, length);
  231|      0|   }
  232|       |
  233|  36.8k|   return (*this);
  234|  36.8k|}
_ZN5Botan11DER_Encoder6encodeERKNS_6BigIntE:
  256|    654|DER_Encoder& DER_Encoder::encode(const BigInt& n) { return encode(n, ASN1_Type::Integer, ASN1_Class::Universal); }
_ZN5Botan11DER_Encoder6encodeEPKhmNS_9ASN1_TypeE:
  261|  4.00k|DER_Encoder& DER_Encoder::encode(const uint8_t bytes[], size_t length, ASN1_Type real_type) {
  262|  4.00k|   return encode(bytes, length, real_type, real_type, ASN1_Class::Universal);
  263|  4.00k|}
_ZN5Botan11DER_Encoder6encodeERKNS_6BigIntENS_9ASN1_TypeENS_10ASN1_ClassE:
  283|    654|DER_Encoder& DER_Encoder::encode(const BigInt& n, ASN1_Type type_tag, ASN1_Class class_tag) {
  284|    654|   if(n == 0) {
  ------------------
  |  Branch (284:7): [True: 14, False: 640]
  ------------------
  285|     14|      return add_object(type_tag, class_tag, 0);
  286|     14|   }
  287|       |
  288|    640|   const size_t extra_zero = (n.bits() % 8 == 0) ? 1 : 0;
  ------------------
  |  Branch (288:30): [True: 315, False: 325]
  ------------------
  289|    640|   secure_vector<uint8_t> contents(extra_zero + n.bytes());
  290|    640|   n.binary_encode(&contents[extra_zero]);
  291|    640|   if(n < 0) {
  ------------------
  |  Branch (291:7): [True: 0, False: 640]
  ------------------
  292|      0|      for(unsigned char& content : contents) {
  ------------------
  |  Branch (292:34): [True: 0, False: 0]
  ------------------
  293|      0|         content = ~content;
  294|      0|      }
  295|      0|      for(size_t i = contents.size(); i > 0; --i) {
  ------------------
  |  Branch (295:39): [True: 0, False: 0]
  ------------------
  296|      0|         if(++contents[i - 1]) {
  ------------------
  |  Branch (296:13): [True: 0, False: 0]
  ------------------
  297|      0|            break;
  298|      0|         }
  299|      0|      }
  300|      0|   }
  301|       |
  302|    640|   return add_object(type_tag, class_tag, contents);
  303|    654|}
_ZN5Botan11DER_Encoder6encodeEPKhmNS_9ASN1_TypeES3_NS_10ASN1_ClassE:
  309|  4.00k|   const uint8_t bytes[], size_t length, ASN1_Type real_type, ASN1_Type type_tag, ASN1_Class class_tag) {
  310|  4.00k|   if(real_type != ASN1_Type::OctetString && real_type != ASN1_Type::BitString) {
  ------------------
  |  Branch (310:7): [True: 4.00k, False: 0]
  |  Branch (310:46): [True: 0, False: 4.00k]
  ------------------
  311|      0|      throw Invalid_Argument("DER_Encoder: Invalid tag for byte/bit string");
  312|      0|   }
  313|       |
  314|  4.00k|   if(real_type == ASN1_Type::BitString) {
  ------------------
  |  Branch (314:7): [True: 4.00k, False: 0]
  ------------------
  315|  4.00k|      secure_vector<uint8_t> encoded;
  316|  4.00k|      encoded.push_back(0);
  317|  4.00k|      encoded += std::make_pair(bytes, length);
  318|  4.00k|      return add_object(type_tag, class_tag, encoded);
  319|  4.00k|   } else {
  320|      0|      return add_object(type_tag, class_tag, bytes, length);
  321|      0|   }
  322|  4.00k|}
_ZN5Botan11DER_Encoder6encodeERKNS_11ASN1_ObjectE:
  324|  8.02k|DER_Encoder& DER_Encoder::encode(const ASN1_Object& obj) {
  325|  8.02k|   obj.encode_into(*this);
  326|  8.02k|   return (*this);
  327|  8.02k|}
_ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassEh:
  341|     14|DER_Encoder& DER_Encoder::add_object(ASN1_Type type_tag, ASN1_Class class_tag, uint8_t rep) {
  342|     14|   return add_object(type_tag, class_tag, &rep, 1);
  343|     14|}
der_enc.cpp:_ZN5Botan12_GLOBAL__N_110encode_tagERNSt3__16vectorIhNS1_9allocatorIhEEEENS_9ASN1_TypeENS_10ASN1_ClassE:
   24|  36.8k|void encode_tag(std::vector<uint8_t>& encoded_tag, ASN1_Type type_tag_e, ASN1_Class class_tag_e) {
   25|  36.8k|   const uint32_t type_tag = static_cast<uint32_t>(type_tag_e);
   26|  36.8k|   const uint32_t class_tag = static_cast<uint32_t>(class_tag_e);
   27|       |
   28|  36.8k|   if((class_tag | 0xE0) != 0xE0) {
  ------------------
  |  Branch (28:7): [True: 0, False: 36.8k]
  ------------------
   29|      0|      throw Encoding_Error(fmt("DER_Encoder: Invalid class tag {}", std::to_string(class_tag)));
   30|      0|   }
   31|       |
   32|  36.8k|   if(type_tag <= 30) {
  ------------------
  |  Branch (32:7): [True: 36.8k, False: 0]
  ------------------
   33|  36.8k|      encoded_tag.push_back(static_cast<uint8_t>(type_tag | class_tag));
   34|  36.8k|   } else {
   35|      0|      size_t blocks = high_bit(static_cast<uint32_t>(type_tag)) + 6;
   36|      0|      blocks = (blocks - (blocks % 7)) / 7;
   37|       |
   38|      0|      BOTAN_ASSERT_NOMSG(blocks > 0);
  ------------------
  |  |   60|      0|   do {                                                                     \
  |  |   61|      0|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 0]
  |  |  ------------------
  |  |   62|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|      0|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   39|       |
   40|      0|      encoded_tag.push_back(static_cast<uint8_t>(class_tag | 0x1F));
   41|      0|      for(size_t i = 0; i != blocks - 1; ++i) {
  ------------------
  |  Branch (41:25): [True: 0, False: 0]
  ------------------
   42|      0|         encoded_tag.push_back(0x80 | ((type_tag >> 7 * (blocks - i - 1)) & 0x7F));
   43|      0|      }
   44|      0|      encoded_tag.push_back(type_tag & 0x7F);
   45|      0|   }
   46|  36.8k|}
der_enc.cpp:_ZN5Botan12_GLOBAL__N_113encode_lengthERNSt3__16vectorIhNS1_9allocatorIhEEEEm:
   51|  36.8k|void encode_length(std::vector<uint8_t>& encoded_length, size_t length) {
   52|  36.8k|   if(length <= 127) {
  ------------------
  |  Branch (52:7): [True: 23.0k, False: 13.7k]
  ------------------
   53|  23.0k|      encoded_length.push_back(static_cast<uint8_t>(length));
   54|  23.0k|   } else {
   55|  13.7k|      const size_t bytes_needed = significant_bytes(length);
   56|       |
   57|  13.7k|      encoded_length.push_back(static_cast<uint8_t>(0x80 | bytes_needed));
   58|       |
   59|  35.1k|      for(size_t i = sizeof(length) - bytes_needed; i < sizeof(length); ++i) {
  ------------------
  |  Branch (59:53): [True: 21.3k, False: 13.7k]
  ------------------
   60|  21.3k|         encoded_length.push_back(get_byte_var(i, length));
   61|  21.3k|      }
   62|  13.7k|   }
   63|  36.8k|}
der_enc.cpp:_ZZN5Botan11DER_EncoderC1ERNSt3__16vectorIhNS1_9allocatorIhEEEEENK3$_1clEPKhm:
   72|  40.2k|   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|  9.06k|OID_Map& OID_Map::global_registry() {
   17|  9.06k|   static OID_Map g_map;
   18|  9.06k|   return g_map;
   19|  9.06k|}
_ZN5Botan7OID_Map7oid2strERKNS_3OIDE:
   56|  8.49k|std::string OID_Map::oid2str(const OID& oid) {
   57|  8.49k|   const std::string oid_str = oid.to_string();
   58|       |
   59|  8.49k|   lock_guard_type<mutex_type> lock(m_mutex);
   60|       |
   61|  8.49k|   auto i = m_oid2str.find(oid_str);
   62|  8.49k|   if(i != m_oid2str.end()) {
  ------------------
  |  Branch (62:7): [True: 6.33k, False: 2.16k]
  ------------------
   63|  6.33k|      return i->second;
   64|  6.33k|   }
   65|       |
   66|  2.16k|   return "";
   67|  8.49k|}
_ZN5Botan7OID_Map7str2oidENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   69|    576|OID OID_Map::str2oid(std::string_view str) {
   70|    576|   lock_guard_type<mutex_type> lock(m_mutex);
   71|    576|   auto i = m_str2oid.find(std::string(str));
   72|    576|   if(i != m_str2oid.end()) {
  ------------------
  |  Branch (72:7): [True: 576, False: 0]
  ------------------
   73|    576|      return i->second;
   74|    576|   }
   75|       |
   76|      0|   return OID();
   77|    576|}

_ZN5Botan7OID_Map16load_oid2str_mapEv:
   17|      1|std::unordered_map<std::string, std::string> OID_Map::load_oid2str_map() {
   18|      1|   return std::unordered_map<std::string, std::string>{
   19|       |
   20|      1|      {"0.3.4401.5.3.1.9.26", "Camellia-192/GCM"},
   21|      1|      {"0.3.4401.5.3.1.9.46", "Camellia-256/GCM"},
   22|      1|      {"0.3.4401.5.3.1.9.6", "Camellia-128/GCM"},
   23|      1|      {"0.4.0.127.0.15.1.1.13.0", "XMSS"},
   24|      1|      {"1.0.14888.3.0.5", "ECKCDSA"},
   25|      1|      {"1.2.156.10197.1.104.100", "SM4/OCB"},
   26|      1|      {"1.2.156.10197.1.104.2", "SM4/CBC"},
   27|      1|      {"1.2.156.10197.1.104.8", "SM4/GCM"},
   28|      1|      {"1.2.156.10197.1.301", "sm2p256v1"},
   29|      1|      {"1.2.156.10197.1.301.1", "SM2"},
   30|      1|      {"1.2.156.10197.1.301.2", "SM2_Kex"},
   31|      1|      {"1.2.156.10197.1.301.3", "SM2_Enc"},
   32|      1|      {"1.2.156.10197.1.401", "SM3"},
   33|      1|      {"1.2.156.10197.1.501", "SM2_Sig/SM3"},
   34|      1|      {"1.2.156.10197.1.504", "RSA/EMSA3(SM3)"},
   35|      1|      {"1.2.250.1.223.101.256.1", "frp256v1"},
   36|      1|      {"1.2.392.200011.61.1.1.1.2", "Camellia-128/CBC"},
   37|      1|      {"1.2.392.200011.61.1.1.1.3", "Camellia-192/CBC"},
   38|      1|      {"1.2.392.200011.61.1.1.1.4", "Camellia-256/CBC"},
   39|      1|      {"1.2.410.200004.1.100.4.3", "ECKCDSA/SHA-1"},
   40|      1|      {"1.2.410.200004.1.100.4.4", "ECKCDSA/SHA-224"},
   41|      1|      {"1.2.410.200004.1.100.4.5", "ECKCDSA/SHA-256"},
   42|      1|      {"1.2.410.200004.1.4", "SEED/CBC"},
   43|      1|      {"1.2.643.100.1", "GOST.OGRN"},
   44|      1|      {"1.2.643.100.111", "GOST.SubjectSigningTool"},
   45|      1|      {"1.2.643.100.112", "GOST.IssuerSigningTool"},
   46|      1|      {"1.2.643.2.2.19", "GOST-34.10"},
   47|      1|      {"1.2.643.2.2.3", "GOST-34.10/GOST-R-34.11-94"},
   48|      1|      {"1.2.643.2.2.35.1", "gost_256A"},
   49|      1|      {"1.2.643.2.2.36.0", "gost_256A"},
   50|      1|      {"1.2.643.3.131.1.1", "GOST.INN"},
   51|      1|      {"1.2.643.7.1.1.1.1", "GOST-34.10-2012-256"},
   52|      1|      {"1.2.643.7.1.1.1.2", "GOST-34.10-2012-512"},
   53|      1|      {"1.2.643.7.1.1.2.2", "Streebog-256"},
   54|      1|      {"1.2.643.7.1.1.2.3", "Streebog-512"},
   55|      1|      {"1.2.643.7.1.1.3.2", "GOST-34.10-2012-256/Streebog-256"},
   56|      1|      {"1.2.643.7.1.1.3.3", "GOST-34.10-2012-512/Streebog-512"},
   57|      1|      {"1.2.643.7.1.2.1.1.1", "gost_256A"},
   58|      1|      {"1.2.643.7.1.2.1.1.2", "gost_256B"},
   59|      1|      {"1.2.643.7.1.2.1.2.1", "gost_512A"},
   60|      1|      {"1.2.643.7.1.2.1.2.2", "gost_512B"},
   61|      1|      {"1.2.840.10040.4.1", "DSA"},
   62|      1|      {"1.2.840.10040.4.3", "DSA/SHA-1"},
   63|      1|      {"1.2.840.10045.2.1", "ECDSA"},
   64|      1|      {"1.2.840.10045.3.1.1", "secp192r1"},
   65|      1|      {"1.2.840.10045.3.1.2", "x962_p192v2"},
   66|      1|      {"1.2.840.10045.3.1.3", "x962_p192v3"},
   67|      1|      {"1.2.840.10045.3.1.4", "x962_p239v1"},
   68|      1|      {"1.2.840.10045.3.1.5", "x962_p239v2"},
   69|      1|      {"1.2.840.10045.3.1.6", "x962_p239v3"},
   70|      1|      {"1.2.840.10045.3.1.7", "secp256r1"},
   71|      1|      {"1.2.840.10045.4.1", "ECDSA/SHA-1"},
   72|      1|      {"1.2.840.10045.4.3.1", "ECDSA/SHA-224"},
   73|      1|      {"1.2.840.10045.4.3.2", "ECDSA/SHA-256"},
   74|      1|      {"1.2.840.10045.4.3.3", "ECDSA/SHA-384"},
   75|      1|      {"1.2.840.10045.4.3.4", "ECDSA/SHA-512"},
   76|      1|      {"1.2.840.10046.2.1", "DH"},
   77|      1|      {"1.2.840.113533.7.66.10", "CAST-128/CBC"},
   78|      1|      {"1.2.840.113533.7.66.15", "KeyWrap.CAST-128"},
   79|      1|      {"1.2.840.113549.1.1.1", "RSA"},
   80|      1|      {"1.2.840.113549.1.1.10", "RSA/EMSA4"},
   81|      1|      {"1.2.840.113549.1.1.11", "RSA/EMSA3(SHA-256)"},
   82|      1|      {"1.2.840.113549.1.1.12", "RSA/EMSA3(SHA-384)"},
   83|      1|      {"1.2.840.113549.1.1.13", "RSA/EMSA3(SHA-512)"},
   84|      1|      {"1.2.840.113549.1.1.14", "RSA/EMSA3(SHA-224)"},
   85|      1|      {"1.2.840.113549.1.1.16", "RSA/EMSA3(SHA-512-256)"},
   86|      1|      {"1.2.840.113549.1.1.4", "RSA/EMSA3(MD5)"},
   87|      1|      {"1.2.840.113549.1.1.5", "RSA/EMSA3(SHA-1)"},
   88|      1|      {"1.2.840.113549.1.1.7", "RSA/OAEP"},
   89|      1|      {"1.2.840.113549.1.1.8", "MGF1"},
   90|      1|      {"1.2.840.113549.1.5.12", "PKCS5.PBKDF2"},
   91|      1|      {"1.2.840.113549.1.5.13", "PBE-PKCS5v20"},
   92|      1|      {"1.2.840.113549.1.9.1", "PKCS9.EmailAddress"},
   93|      1|      {"1.2.840.113549.1.9.14", "PKCS9.ExtensionRequest"},
   94|      1|      {"1.2.840.113549.1.9.16.3.18", "ChaCha20Poly1305"},
   95|      1|      {"1.2.840.113549.1.9.16.3.6", "KeyWrap.TripleDES"},
   96|      1|      {"1.2.840.113549.1.9.16.3.8", "Compression.Zlib"},
   97|      1|      {"1.2.840.113549.1.9.2", "PKCS9.UnstructuredName"},
   98|      1|      {"1.2.840.113549.1.9.3", "PKCS9.ContentType"},
   99|      1|      {"1.2.840.113549.1.9.4", "PKCS9.MessageDigest"},
  100|      1|      {"1.2.840.113549.1.9.7", "PKCS9.ChallengePassword"},
  101|      1|      {"1.2.840.113549.2.10", "HMAC(SHA-384)"},
  102|      1|      {"1.2.840.113549.2.11", "HMAC(SHA-512)"},
  103|      1|      {"1.2.840.113549.2.13", "HMAC(SHA-512-256)"},
  104|      1|      {"1.2.840.113549.2.5", "MD5"},
  105|      1|      {"1.2.840.113549.2.7", "HMAC(SHA-1)"},
  106|      1|      {"1.2.840.113549.2.8", "HMAC(SHA-224)"},
  107|      1|      {"1.2.840.113549.2.9", "HMAC(SHA-256)"},
  108|      1|      {"1.2.840.113549.3.7", "TripleDES/CBC"},
  109|      1|      {"1.3.101.110", "Curve25519"},
  110|      1|      {"1.3.101.112", "Ed25519"},
  111|      1|      {"1.3.132.0.10", "secp256k1"},
  112|      1|      {"1.3.132.0.30", "secp160r2"},
  113|      1|      {"1.3.132.0.31", "secp192k1"},
  114|      1|      {"1.3.132.0.32", "secp224k1"},
  115|      1|      {"1.3.132.0.33", "secp224r1"},
  116|      1|      {"1.3.132.0.34", "secp384r1"},
  117|      1|      {"1.3.132.0.35", "secp521r1"},
  118|      1|      {"1.3.132.0.8", "secp160r1"},
  119|      1|      {"1.3.132.0.9", "secp160k1"},
  120|      1|      {"1.3.132.1.12", "ECDH"},
  121|      1|      {"1.3.14.3.2.26", "SHA-1"},
  122|      1|      {"1.3.14.3.2.7", "DES/CBC"},
  123|      1|      {"1.3.36.3.2.1", "RIPEMD-160"},
  124|      1|      {"1.3.36.3.3.1.2", "RSA/EMSA3(RIPEMD-160)"},
  125|      1|      {"1.3.36.3.3.2.5.2.1", "ECGDSA"},
  126|      1|      {"1.3.36.3.3.2.5.4.1", "ECGDSA/RIPEMD-160"},
  127|      1|      {"1.3.36.3.3.2.5.4.2", "ECGDSA/SHA-1"},
  128|      1|      {"1.3.36.3.3.2.5.4.3", "ECGDSA/SHA-224"},
  129|      1|      {"1.3.36.3.3.2.5.4.4", "ECGDSA/SHA-256"},
  130|      1|      {"1.3.36.3.3.2.5.4.5", "ECGDSA/SHA-384"},
  131|      1|      {"1.3.36.3.3.2.5.4.6", "ECGDSA/SHA-512"},
  132|      1|      {"1.3.36.3.3.2.8.1.1.1", "brainpool160r1"},
  133|      1|      {"1.3.36.3.3.2.8.1.1.11", "brainpool384r1"},
  134|      1|      {"1.3.36.3.3.2.8.1.1.13", "brainpool512r1"},
  135|      1|      {"1.3.36.3.3.2.8.1.1.3", "brainpool192r1"},
  136|      1|      {"1.3.36.3.3.2.8.1.1.5", "brainpool224r1"},
  137|      1|      {"1.3.36.3.3.2.8.1.1.7", "brainpool256r1"},
  138|      1|      {"1.3.36.3.3.2.8.1.1.9", "brainpool320r1"},
  139|      1|      {"1.3.6.1.4.1.11591.15.1", "OpenPGP.Ed25519"},
  140|      1|      {"1.3.6.1.4.1.11591.4.11", "Scrypt"},
  141|      1|      {"1.3.6.1.4.1.25258.1.10.1", "Dilithium-4x4-AES-r3"},
  142|      1|      {"1.3.6.1.4.1.25258.1.10.2", "Dilithium-6x5-AES-r3"},
  143|      1|      {"1.3.6.1.4.1.25258.1.10.3", "Dilithium-8x7-AES-r3"},
  144|      1|      {"1.3.6.1.4.1.25258.1.11.1", "Kyber-512-90s-r3"},
  145|      1|      {"1.3.6.1.4.1.25258.1.11.2", "Kyber-768-90s-r3"},
  146|      1|      {"1.3.6.1.4.1.25258.1.11.3", "Kyber-1024-90s-r3"},
  147|      1|      {"1.3.6.1.4.1.25258.1.3", "McEliece"},
  148|      1|      {"1.3.6.1.4.1.25258.1.5", "XMSS-draft6"},
  149|      1|      {"1.3.6.1.4.1.25258.1.6.1", "GOST-34.10-2012-256/SHA-256"},
  150|      1|      {"1.3.6.1.4.1.25258.1.7.1", "Kyber-512-r3"},
  151|      1|      {"1.3.6.1.4.1.25258.1.7.2", "Kyber-768-r3"},
  152|      1|      {"1.3.6.1.4.1.25258.1.7.3", "Kyber-1024-r3"},
  153|      1|      {"1.3.6.1.4.1.25258.1.8", "XMSS-draft12"},
  154|      1|      {"1.3.6.1.4.1.25258.1.9.1", "Dilithium-4x4-r3"},
  155|      1|      {"1.3.6.1.4.1.25258.1.9.2", "Dilithium-6x5-r3"},
  156|      1|      {"1.3.6.1.4.1.25258.1.9.3", "Dilithium-8x7-r3"},
  157|      1|      {"1.3.6.1.4.1.25258.3.1", "Serpent/CBC"},
  158|      1|      {"1.3.6.1.4.1.25258.3.101", "Serpent/GCM"},
  159|      1|      {"1.3.6.1.4.1.25258.3.102", "Twofish/GCM"},
  160|      1|      {"1.3.6.1.4.1.25258.3.2", "Threefish-512/CBC"},
  161|      1|      {"1.3.6.1.4.1.25258.3.2.1", "AES-128/OCB"},
  162|      1|      {"1.3.6.1.4.1.25258.3.2.2", "AES-192/OCB"},
  163|      1|      {"1.3.6.1.4.1.25258.3.2.3", "AES-256/OCB"},
  164|      1|      {"1.3.6.1.4.1.25258.3.2.4", "Serpent/OCB"},
  165|      1|      {"1.3.6.1.4.1.25258.3.2.5", "Twofish/OCB"},
  166|      1|      {"1.3.6.1.4.1.25258.3.2.6", "Camellia-128/OCB"},
  167|      1|      {"1.3.6.1.4.1.25258.3.2.7", "Camellia-192/OCB"},
  168|      1|      {"1.3.6.1.4.1.25258.3.2.8", "Camellia-256/OCB"},
  169|      1|      {"1.3.6.1.4.1.25258.3.3", "Twofish/CBC"},
  170|      1|      {"1.3.6.1.4.1.25258.3.4.1", "AES-128/SIV"},
  171|      1|      {"1.3.6.1.4.1.25258.3.4.2", "AES-192/SIV"},
  172|      1|      {"1.3.6.1.4.1.25258.3.4.3", "AES-256/SIV"},
  173|      1|      {"1.3.6.1.4.1.25258.3.4.4", "Serpent/SIV"},
  174|      1|      {"1.3.6.1.4.1.25258.3.4.5", "Twofish/SIV"},
  175|      1|      {"1.3.6.1.4.1.25258.3.4.6", "Camellia-128/SIV"},
  176|      1|      {"1.3.6.1.4.1.25258.3.4.7", "Camellia-192/SIV"},
  177|      1|      {"1.3.6.1.4.1.25258.3.4.8", "Camellia-256/SIV"},
  178|      1|      {"1.3.6.1.4.1.25258.3.4.9", "SM4/SIV"},
  179|      1|      {"1.3.6.1.4.1.3029.1.2.1", "ElGamal"},
  180|      1|      {"1.3.6.1.4.1.3029.1.5.1", "OpenPGP.Curve25519"},
  181|      1|      {"1.3.6.1.4.1.311.20.2.2", "Microsoft SmartcardLogon"},
  182|      1|      {"1.3.6.1.4.1.311.20.2.3", "Microsoft UPN"},
  183|      1|      {"1.3.6.1.4.1.8301.3.1.2.9.0.38", "secp521r1"},
  184|      1|      {"1.3.6.1.5.5.7.1.1", "PKIX.AuthorityInformationAccess"},
  185|      1|      {"1.3.6.1.5.5.7.3.1", "PKIX.ServerAuth"},
  186|      1|      {"1.3.6.1.5.5.7.3.2", "PKIX.ClientAuth"},
  187|      1|      {"1.3.6.1.5.5.7.3.3", "PKIX.CodeSigning"},
  188|      1|      {"1.3.6.1.5.5.7.3.4", "PKIX.EmailProtection"},
  189|      1|      {"1.3.6.1.5.5.7.3.5", "PKIX.IPsecEndSystem"},
  190|      1|      {"1.3.6.1.5.5.7.3.6", "PKIX.IPsecTunnel"},
  191|      1|      {"1.3.6.1.5.5.7.3.7", "PKIX.IPsecUser"},
  192|      1|      {"1.3.6.1.5.5.7.3.8", "PKIX.TimeStamping"},
  193|      1|      {"1.3.6.1.5.5.7.3.9", "PKIX.OCSPSigning"},
  194|      1|      {"1.3.6.1.5.5.7.48.1", "PKIX.OCSP"},
  195|      1|      {"1.3.6.1.5.5.7.48.1.1", "PKIX.OCSP.BasicResponse"},
  196|      1|      {"1.3.6.1.5.5.7.48.1.5", "PKIX.OCSP.NoCheck"},
  197|      1|      {"1.3.6.1.5.5.7.48.2", "PKIX.CertificateAuthorityIssuers"},
  198|      1|      {"1.3.6.1.5.5.7.8.5", "PKIX.XMPPAddr"},
  199|      1|      {"2.16.840.1.101.3.4.1.2", "AES-128/CBC"},
  200|      1|      {"2.16.840.1.101.3.4.1.22", "AES-192/CBC"},
  201|      1|      {"2.16.840.1.101.3.4.1.25", "KeyWrap.AES-192"},
  202|      1|      {"2.16.840.1.101.3.4.1.26", "AES-192/GCM"},
  203|      1|      {"2.16.840.1.101.3.4.1.27", "AES-192/CCM"},
  204|      1|      {"2.16.840.1.101.3.4.1.42", "AES-256/CBC"},
  205|      1|      {"2.16.840.1.101.3.4.1.45", "KeyWrap.AES-256"},
  206|      1|      {"2.16.840.1.101.3.4.1.46", "AES-256/GCM"},
  207|      1|      {"2.16.840.1.101.3.4.1.47", "AES-256/CCM"},
  208|      1|      {"2.16.840.1.101.3.4.1.5", "KeyWrap.AES-128"},
  209|      1|      {"2.16.840.1.101.3.4.1.6", "AES-128/GCM"},
  210|      1|      {"2.16.840.1.101.3.4.1.7", "AES-128/CCM"},
  211|      1|      {"2.16.840.1.101.3.4.2.1", "SHA-256"},
  212|      1|      {"2.16.840.1.101.3.4.2.10", "SHA-3(512)"},
  213|      1|      {"2.16.840.1.101.3.4.2.11", "SHAKE-128"},
  214|      1|      {"2.16.840.1.101.3.4.2.12", "SHAKE-256"},
  215|      1|      {"2.16.840.1.101.3.4.2.2", "SHA-384"},
  216|      1|      {"2.16.840.1.101.3.4.2.3", "SHA-512"},
  217|      1|      {"2.16.840.1.101.3.4.2.4", "SHA-224"},
  218|      1|      {"2.16.840.1.101.3.4.2.6", "SHA-512-256"},
  219|      1|      {"2.16.840.1.101.3.4.2.7", "SHA-3(224)"},
  220|      1|      {"2.16.840.1.101.3.4.2.8", "SHA-3(256)"},
  221|      1|      {"2.16.840.1.101.3.4.2.9", "SHA-3(384)"},
  222|      1|      {"2.16.840.1.101.3.4.3.1", "DSA/SHA-224"},
  223|      1|      {"2.16.840.1.101.3.4.3.10", "ECDSA/SHA-3(256)"},
  224|      1|      {"2.16.840.1.101.3.4.3.11", "ECDSA/SHA-3(384)"},
  225|      1|      {"2.16.840.1.101.3.4.3.12", "ECDSA/SHA-3(512)"},
  226|      1|      {"2.16.840.1.101.3.4.3.13", "RSA/EMSA3(SHA-3(224))"},
  227|      1|      {"2.16.840.1.101.3.4.3.14", "RSA/EMSA3(SHA-3(256))"},
  228|      1|      {"2.16.840.1.101.3.4.3.15", "RSA/EMSA3(SHA-3(384))"},
  229|      1|      {"2.16.840.1.101.3.4.3.16", "RSA/EMSA3(SHA-3(512))"},
  230|      1|      {"2.16.840.1.101.3.4.3.2", "DSA/SHA-256"},
  231|      1|      {"2.16.840.1.101.3.4.3.3", "DSA/SHA-384"},
  232|      1|      {"2.16.840.1.101.3.4.3.4", "DSA/SHA-512"},
  233|      1|      {"2.16.840.1.101.3.4.3.5", "DSA/SHA-3(224)"},
  234|      1|      {"2.16.840.1.101.3.4.3.6", "DSA/SHA-3(256)"},
  235|      1|      {"2.16.840.1.101.3.4.3.7", "DSA/SHA-3(384)"},
  236|      1|      {"2.16.840.1.101.3.4.3.8", "DSA/SHA-3(512)"},
  237|      1|      {"2.16.840.1.101.3.4.3.9", "ECDSA/SHA-3(224)"},
  238|      1|      {"2.16.840.1.113730.1.13", "Certificate Comment"},
  239|      1|      {"2.5.29.14", "X509v3.SubjectKeyIdentifier"},
  240|      1|      {"2.5.29.15", "X509v3.KeyUsage"},
  241|      1|      {"2.5.29.16", "X509v3.PrivateKeyUsagePeriod"},
  242|      1|      {"2.5.29.17", "X509v3.SubjectAlternativeName"},
  243|      1|      {"2.5.29.18", "X509v3.IssuerAlternativeName"},
  244|      1|      {"2.5.29.19", "X509v3.BasicConstraints"},
  245|      1|      {"2.5.29.20", "X509v3.CRLNumber"},
  246|      1|      {"2.5.29.21", "X509v3.ReasonCode"},
  247|      1|      {"2.5.29.23", "X509v3.HoldInstructionCode"},
  248|      1|      {"2.5.29.24", "X509v3.InvalidityDate"},
  249|      1|      {"2.5.29.28", "X509v3.CRLIssuingDistributionPoint"},
  250|      1|      {"2.5.29.30", "X509v3.NameConstraints"},
  251|      1|      {"2.5.29.31", "X509v3.CRLDistributionPoints"},
  252|      1|      {"2.5.29.32", "X509v3.CertificatePolicies"},
  253|      1|      {"2.5.29.32.0", "X509v3.AnyPolicy"},
  254|      1|      {"2.5.29.35", "X509v3.AuthorityKeyIdentifier"},
  255|      1|      {"2.5.29.36", "X509v3.PolicyConstraints"},
  256|      1|      {"2.5.29.37", "X509v3.ExtendedKeyUsage"},
  257|      1|      {"2.5.4.10", "X520.Organization"},
  258|      1|      {"2.5.4.11", "X520.OrganizationalUnit"},
  259|      1|      {"2.5.4.12", "X520.Title"},
  260|      1|      {"2.5.4.3", "X520.CommonName"},
  261|      1|      {"2.5.4.4", "X520.Surname"},
  262|      1|      {"2.5.4.42", "X520.GivenName"},
  263|      1|      {"2.5.4.43", "X520.Initials"},
  264|      1|      {"2.5.4.44", "X520.GenerationalQualifier"},
  265|      1|      {"2.5.4.46", "X520.DNQualifier"},
  266|      1|      {"2.5.4.5", "X520.SerialNumber"},
  267|      1|      {"2.5.4.6", "X520.Country"},
  268|      1|      {"2.5.4.65", "X520.Pseudonym"},
  269|      1|      {"2.5.4.7", "X520.Locality"},
  270|      1|      {"2.5.4.8", "X520.State"},
  271|      1|      {"2.5.4.9", "X520.StreetAddress"},
  272|      1|      {"2.5.8.1.1", "RSA"}};
  273|      1|}
_ZN5Botan7OID_Map16load_str2oid_mapEv:
  275|      1|std::unordered_map<std::string, OID> OID_Map::load_str2oid_map() {
  276|      1|   return std::unordered_map<std::string, OID>{
  277|       |
  278|      1|      {"AES-128/CBC", OID({2, 16, 840, 1, 101, 3, 4, 1, 2})},
  279|      1|      {"AES-128/CCM", OID({2, 16, 840, 1, 101, 3, 4, 1, 7})},
  280|      1|      {"AES-128/GCM", OID({2, 16, 840, 1, 101, 3, 4, 1, 6})},
  281|      1|      {"AES-128/OCB", OID({1, 3, 6, 1, 4, 1, 25258, 3, 2, 1})},
  282|      1|      {"AES-128/SIV", OID({1, 3, 6, 1, 4, 1, 25258, 3, 4, 1})},
  283|      1|      {"AES-192/CBC", OID({2, 16, 840, 1, 101, 3, 4, 1, 22})},
  284|      1|      {"AES-192/CCM", OID({2, 16, 840, 1, 101, 3, 4, 1, 27})},
  285|      1|      {"AES-192/GCM", OID({2, 16, 840, 1, 101, 3, 4, 1, 26})},
  286|      1|      {"AES-192/OCB", OID({1, 3, 6, 1, 4, 1, 25258, 3, 2, 2})},
  287|      1|      {"AES-192/SIV", OID({1, 3, 6, 1, 4, 1, 25258, 3, 4, 2})},
  288|      1|      {"AES-256/CBC", OID({2, 16, 840, 1, 101, 3, 4, 1, 42})},
  289|      1|      {"AES-256/CCM", OID({2, 16, 840, 1, 101, 3, 4, 1, 47})},
  290|      1|      {"AES-256/GCM", OID({2, 16, 840, 1, 101, 3, 4, 1, 46})},
  291|      1|      {"AES-256/OCB", OID({1, 3, 6, 1, 4, 1, 25258, 3, 2, 3})},
  292|      1|      {"AES-256/SIV", OID({1, 3, 6, 1, 4, 1, 25258, 3, 4, 3})},
  293|      1|      {"CAST-128/CBC", OID({1, 2, 840, 113533, 7, 66, 10})},
  294|      1|      {"Camellia-128/CBC", OID({1, 2, 392, 200011, 61, 1, 1, 1, 2})},
  295|      1|      {"Camellia-128/GCM", OID({0, 3, 4401, 5, 3, 1, 9, 6})},
  296|      1|      {"Camellia-128/OCB", OID({1, 3, 6, 1, 4, 1, 25258, 3, 2, 6})},
  297|      1|      {"Camellia-128/SIV", OID({1, 3, 6, 1, 4, 1, 25258, 3, 4, 6})},
  298|      1|      {"Camellia-192/CBC", OID({1, 2, 392, 200011, 61, 1, 1, 1, 3})},
  299|      1|      {"Camellia-192/GCM", OID({0, 3, 4401, 5, 3, 1, 9, 26})},
  300|      1|      {"Camellia-192/OCB", OID({1, 3, 6, 1, 4, 1, 25258, 3, 2, 7})},
  301|      1|      {"Camellia-192/SIV", OID({1, 3, 6, 1, 4, 1, 25258, 3, 4, 7})},
  302|      1|      {"Camellia-256/CBC", OID({1, 2, 392, 200011, 61, 1, 1, 1, 4})},
  303|      1|      {"Camellia-256/GCM", OID({0, 3, 4401, 5, 3, 1, 9, 46})},
  304|      1|      {"Camellia-256/OCB", OID({1, 3, 6, 1, 4, 1, 25258, 3, 2, 8})},
  305|      1|      {"Camellia-256/SIV", OID({1, 3, 6, 1, 4, 1, 25258, 3, 4, 8})},
  306|      1|      {"Certificate Comment", OID({2, 16, 840, 1, 113730, 1, 13})},
  307|      1|      {"ChaCha20Poly1305", OID({1, 2, 840, 113549, 1, 9, 16, 3, 18})},
  308|      1|      {"Compression.Zlib", OID({1, 2, 840, 113549, 1, 9, 16, 3, 8})},
  309|      1|      {"Curve25519", OID({1, 3, 101, 110})},
  310|      1|      {"DES/CBC", OID({1, 3, 14, 3, 2, 7})},
  311|      1|      {"DH", OID({1, 2, 840, 10046, 2, 1})},
  312|      1|      {"DSA", OID({1, 2, 840, 10040, 4, 1})},
  313|      1|      {"DSA/SHA-1", OID({1, 2, 840, 10040, 4, 3})},
  314|      1|      {"DSA/SHA-224", OID({2, 16, 840, 1, 101, 3, 4, 3, 1})},
  315|      1|      {"DSA/SHA-256", OID({2, 16, 840, 1, 101, 3, 4, 3, 2})},
  316|      1|      {"DSA/SHA-3(224)", OID({2, 16, 840, 1, 101, 3, 4, 3, 5})},
  317|      1|      {"DSA/SHA-3(256)", OID({2, 16, 840, 1, 101, 3, 4, 3, 6})},
  318|      1|      {"DSA/SHA-3(384)", OID({2, 16, 840, 1, 101, 3, 4, 3, 7})},
  319|      1|      {"DSA/SHA-3(512)", OID({2, 16, 840, 1, 101, 3, 4, 3, 8})},
  320|      1|      {"DSA/SHA-384", OID({2, 16, 840, 1, 101, 3, 4, 3, 3})},
  321|      1|      {"DSA/SHA-512", OID({2, 16, 840, 1, 101, 3, 4, 3, 4})},
  322|      1|      {"Dilithium-4x4-AES-r3", OID({1, 3, 6, 1, 4, 1, 25258, 1, 10, 1})},
  323|      1|      {"Dilithium-4x4-r3", OID({1, 3, 6, 1, 4, 1, 25258, 1, 9, 1})},
  324|      1|      {"Dilithium-6x5-AES-r3", OID({1, 3, 6, 1, 4, 1, 25258, 1, 10, 2})},
  325|      1|      {"Dilithium-6x5-r3", OID({1, 3, 6, 1, 4, 1, 25258, 1, 9, 2})},
  326|      1|      {"Dilithium-8x7-AES-r3", OID({1, 3, 6, 1, 4, 1, 25258, 1, 10, 3})},
  327|      1|      {"Dilithium-8x7-r3", OID({1, 3, 6, 1, 4, 1, 25258, 1, 9, 3})},
  328|      1|      {"ECDH", OID({1, 3, 132, 1, 12})},
  329|      1|      {"ECDSA", OID({1, 2, 840, 10045, 2, 1})},
  330|      1|      {"ECDSA/SHA-1", OID({1, 2, 840, 10045, 4, 1})},
  331|      1|      {"ECDSA/SHA-224", OID({1, 2, 840, 10045, 4, 3, 1})},
  332|      1|      {"ECDSA/SHA-256", OID({1, 2, 840, 10045, 4, 3, 2})},
  333|      1|      {"ECDSA/SHA-3(224)", OID({2, 16, 840, 1, 101, 3, 4, 3, 9})},
  334|      1|      {"ECDSA/SHA-3(256)", OID({2, 16, 840, 1, 101, 3, 4, 3, 10})},
  335|      1|      {"ECDSA/SHA-3(384)", OID({2, 16, 840, 1, 101, 3, 4, 3, 11})},
  336|      1|      {"ECDSA/SHA-3(512)", OID({2, 16, 840, 1, 101, 3, 4, 3, 12})},
  337|      1|      {"ECDSA/SHA-384", OID({1, 2, 840, 10045, 4, 3, 3})},
  338|      1|      {"ECDSA/SHA-512", OID({1, 2, 840, 10045, 4, 3, 4})},
  339|      1|      {"ECGDSA", OID({1, 3, 36, 3, 3, 2, 5, 2, 1})},
  340|      1|      {"ECGDSA/RIPEMD-160", OID({1, 3, 36, 3, 3, 2, 5, 4, 1})},
  341|      1|      {"ECGDSA/SHA-1", OID({1, 3, 36, 3, 3, 2, 5, 4, 2})},
  342|      1|      {"ECGDSA/SHA-224", OID({1, 3, 36, 3, 3, 2, 5, 4, 3})},
  343|      1|      {"ECGDSA/SHA-256", OID({1, 3, 36, 3, 3, 2, 5, 4, 4})},
  344|      1|      {"ECGDSA/SHA-384", OID({1, 3, 36, 3, 3, 2, 5, 4, 5})},
  345|      1|      {"ECGDSA/SHA-512", OID({1, 3, 36, 3, 3, 2, 5, 4, 6})},
  346|      1|      {"ECKCDSA", OID({1, 0, 14888, 3, 0, 5})},
  347|      1|      {"ECKCDSA/SHA-1", OID({1, 2, 410, 200004, 1, 100, 4, 3})},
  348|      1|      {"ECKCDSA/SHA-224", OID({1, 2, 410, 200004, 1, 100, 4, 4})},
  349|      1|      {"ECKCDSA/SHA-256", OID({1, 2, 410, 200004, 1, 100, 4, 5})},
  350|      1|      {"Ed25519", OID({1, 3, 101, 112})},
  351|      1|      {"ElGamal", OID({1, 3, 6, 1, 4, 1, 3029, 1, 2, 1})},
  352|      1|      {"GOST-34.10", OID({1, 2, 643, 2, 2, 19})},
  353|      1|      {"GOST-34.10-2012-256", OID({1, 2, 643, 7, 1, 1, 1, 1})},
  354|      1|      {"GOST-34.10-2012-256/SHA-256", OID({1, 3, 6, 1, 4, 1, 25258, 1, 6, 1})},
  355|      1|      {"GOST-34.10-2012-256/Streebog-256", OID({1, 2, 643, 7, 1, 1, 3, 2})},
  356|      1|      {"GOST-34.10-2012-512", OID({1, 2, 643, 7, 1, 1, 1, 2})},
  357|      1|      {"GOST-34.10-2012-512/Streebog-512", OID({1, 2, 643, 7, 1, 1, 3, 3})},
  358|      1|      {"GOST-34.10/GOST-R-34.11-94", OID({1, 2, 643, 2, 2, 3})},
  359|      1|      {"GOST.INN", OID({1, 2, 643, 3, 131, 1, 1})},
  360|      1|      {"GOST.IssuerSigningTool", OID({1, 2, 643, 100, 112})},
  361|      1|      {"GOST.OGRN", OID({1, 2, 643, 100, 1})},
  362|      1|      {"GOST.SubjectSigningTool", OID({1, 2, 643, 100, 111})},
  363|      1|      {"HMAC(SHA-1)", OID({1, 2, 840, 113549, 2, 7})},
  364|      1|      {"HMAC(SHA-224)", OID({1, 2, 840, 113549, 2, 8})},
  365|      1|      {"HMAC(SHA-256)", OID({1, 2, 840, 113549, 2, 9})},
  366|      1|      {"HMAC(SHA-384)", OID({1, 2, 840, 113549, 2, 10})},
  367|      1|      {"HMAC(SHA-512)", OID({1, 2, 840, 113549, 2, 11})},
  368|      1|      {"HMAC(SHA-512-256)", OID({1, 2, 840, 113549, 2, 13})},
  369|      1|      {"KeyWrap.AES-128", OID({2, 16, 840, 1, 101, 3, 4, 1, 5})},
  370|      1|      {"KeyWrap.AES-192", OID({2, 16, 840, 1, 101, 3, 4, 1, 25})},
  371|      1|      {"KeyWrap.AES-256", OID({2, 16, 840, 1, 101, 3, 4, 1, 45})},
  372|      1|      {"KeyWrap.CAST-128", OID({1, 2, 840, 113533, 7, 66, 15})},
  373|      1|      {"KeyWrap.TripleDES", OID({1, 2, 840, 113549, 1, 9, 16, 3, 6})},
  374|      1|      {"Kyber-1024-90s-r3", OID({1, 3, 6, 1, 4, 1, 25258, 1, 11, 3})},
  375|      1|      {"Kyber-1024-r3", OID({1, 3, 6, 1, 4, 1, 25258, 1, 7, 3})},
  376|      1|      {"Kyber-512-90s-r3", OID({1, 3, 6, 1, 4, 1, 25258, 1, 11, 1})},
  377|      1|      {"Kyber-512-r3", OID({1, 3, 6, 1, 4, 1, 25258, 1, 7, 1})},
  378|      1|      {"Kyber-768-90s-r3", OID({1, 3, 6, 1, 4, 1, 25258, 1, 11, 2})},
  379|      1|      {"Kyber-768-r3", OID({1, 3, 6, 1, 4, 1, 25258, 1, 7, 2})},
  380|      1|      {"MD5", OID({1, 2, 840, 113549, 2, 5})},
  381|      1|      {"MGF1", OID({1, 2, 840, 113549, 1, 1, 8})},
  382|      1|      {"McEliece", OID({1, 3, 6, 1, 4, 1, 25258, 1, 3})},
  383|      1|      {"Microsoft SmartcardLogon", OID({1, 3, 6, 1, 4, 1, 311, 20, 2, 2})},
  384|      1|      {"Microsoft UPN", OID({1, 3, 6, 1, 4, 1, 311, 20, 2, 3})},
  385|      1|      {"OpenPGP.Curve25519", OID({1, 3, 6, 1, 4, 1, 3029, 1, 5, 1})},
  386|      1|      {"OpenPGP.Ed25519", OID({1, 3, 6, 1, 4, 1, 11591, 15, 1})},
  387|      1|      {"PBE-PKCS5v20", OID({1, 2, 840, 113549, 1, 5, 13})},
  388|      1|      {"PBES2", OID({1, 2, 840, 113549, 1, 5, 13})},
  389|      1|      {"PKCS5.PBKDF2", OID({1, 2, 840, 113549, 1, 5, 12})},
  390|      1|      {"PKCS9.ChallengePassword", OID({1, 2, 840, 113549, 1, 9, 7})},
  391|      1|      {"PKCS9.ContentType", OID({1, 2, 840, 113549, 1, 9, 3})},
  392|      1|      {"PKCS9.EmailAddress", OID({1, 2, 840, 113549, 1, 9, 1})},
  393|      1|      {"PKCS9.ExtensionRequest", OID({1, 2, 840, 113549, 1, 9, 14})},
  394|      1|      {"PKCS9.MessageDigest", OID({1, 2, 840, 113549, 1, 9, 4})},
  395|      1|      {"PKCS9.UnstructuredName", OID({1, 2, 840, 113549, 1, 9, 2})},
  396|      1|      {"PKIX.AuthorityInformationAccess", OID({1, 3, 6, 1, 5, 5, 7, 1, 1})},
  397|      1|      {"PKIX.CertificateAuthorityIssuers", OID({1, 3, 6, 1, 5, 5, 7, 48, 2})},
  398|      1|      {"PKIX.ClientAuth", OID({1, 3, 6, 1, 5, 5, 7, 3, 2})},
  399|      1|      {"PKIX.CodeSigning", OID({1, 3, 6, 1, 5, 5, 7, 3, 3})},
  400|      1|      {"PKIX.EmailProtection", OID({1, 3, 6, 1, 5, 5, 7, 3, 4})},
  401|      1|      {"PKIX.IPsecEndSystem", OID({1, 3, 6, 1, 5, 5, 7, 3, 5})},
  402|      1|      {"PKIX.IPsecTunnel", OID({1, 3, 6, 1, 5, 5, 7, 3, 6})},
  403|      1|      {"PKIX.IPsecUser", OID({1, 3, 6, 1, 5, 5, 7, 3, 7})},
  404|      1|      {"PKIX.OCSP", OID({1, 3, 6, 1, 5, 5, 7, 48, 1})},
  405|      1|      {"PKIX.OCSP.BasicResponse", OID({1, 3, 6, 1, 5, 5, 7, 48, 1, 1})},
  406|      1|      {"PKIX.OCSP.NoCheck", OID({1, 3, 6, 1, 5, 5, 7, 48, 1, 5})},
  407|      1|      {"PKIX.OCSPSigning", OID({1, 3, 6, 1, 5, 5, 7, 3, 9})},
  408|      1|      {"PKIX.ServerAuth", OID({1, 3, 6, 1, 5, 5, 7, 3, 1})},
  409|      1|      {"PKIX.TimeStamping", OID({1, 3, 6, 1, 5, 5, 7, 3, 8})},
  410|      1|      {"PKIX.XMPPAddr", OID({1, 3, 6, 1, 5, 5, 7, 8, 5})},
  411|      1|      {"RIPEMD-160", OID({1, 3, 36, 3, 2, 1})},
  412|      1|      {"RSA", OID({1, 2, 840, 113549, 1, 1, 1})},
  413|      1|      {"RSA/EMSA3(MD5)", OID({1, 2, 840, 113549, 1, 1, 4})},
  414|      1|      {"RSA/EMSA3(RIPEMD-160)", OID({1, 3, 36, 3, 3, 1, 2})},
  415|      1|      {"RSA/EMSA3(SHA-1)", OID({1, 2, 840, 113549, 1, 1, 5})},
  416|      1|      {"RSA/EMSA3(SHA-224)", OID({1, 2, 840, 113549, 1, 1, 14})},
  417|      1|      {"RSA/EMSA3(SHA-256)", OID({1, 2, 840, 113549, 1, 1, 11})},
  418|      1|      {"RSA/EMSA3(SHA-3(224))", OID({2, 16, 840, 1, 101, 3, 4, 3, 13})},
  419|      1|      {"RSA/EMSA3(SHA-3(256))", OID({2, 16, 840, 1, 101, 3, 4, 3, 14})},
  420|      1|      {"RSA/EMSA3(SHA-3(384))", OID({2, 16, 840, 1, 101, 3, 4, 3, 15})},
  421|      1|      {"RSA/EMSA3(SHA-3(512))", OID({2, 16, 840, 1, 101, 3, 4, 3, 16})},
  422|      1|      {"RSA/EMSA3(SHA-384)", OID({1, 2, 840, 113549, 1, 1, 12})},
  423|      1|      {"RSA/EMSA3(SHA-512)", OID({1, 2, 840, 113549, 1, 1, 13})},
  424|      1|      {"RSA/EMSA3(SHA-512-256)", OID({1, 2, 840, 113549, 1, 1, 16})},
  425|      1|      {"RSA/EMSA3(SM3)", OID({1, 2, 156, 10197, 1, 504})},
  426|      1|      {"RSA/EMSA4", OID({1, 2, 840, 113549, 1, 1, 10})},
  427|      1|      {"RSA/OAEP", OID({1, 2, 840, 113549, 1, 1, 7})},
  428|      1|      {"SEED/CBC", OID({1, 2, 410, 200004, 1, 4})},
  429|      1|      {"SHA-1", OID({1, 3, 14, 3, 2, 26})},
  430|      1|      {"SHA-224", OID({2, 16, 840, 1, 101, 3, 4, 2, 4})},
  431|      1|      {"SHA-256", OID({2, 16, 840, 1, 101, 3, 4, 2, 1})},
  432|      1|      {"SHA-3(224)", OID({2, 16, 840, 1, 101, 3, 4, 2, 7})},
  433|      1|      {"SHA-3(256)", OID({2, 16, 840, 1, 101, 3, 4, 2, 8})},
  434|      1|      {"SHA-3(384)", OID({2, 16, 840, 1, 101, 3, 4, 2, 9})},
  435|      1|      {"SHA-3(512)", OID({2, 16, 840, 1, 101, 3, 4, 2, 10})},
  436|      1|      {"SHA-384", OID({2, 16, 840, 1, 101, 3, 4, 2, 2})},
  437|      1|      {"SHA-512", OID({2, 16, 840, 1, 101, 3, 4, 2, 3})},
  438|      1|      {"SHA-512-256", OID({2, 16, 840, 1, 101, 3, 4, 2, 6})},
  439|      1|      {"SHAKE-128", OID({2, 16, 840, 1, 101, 3, 4, 2, 11})},
  440|      1|      {"SHAKE-256", OID({2, 16, 840, 1, 101, 3, 4, 2, 12})},
  441|      1|      {"SM2", OID({1, 2, 156, 10197, 1, 301, 1})},
  442|      1|      {"SM2_Enc", OID({1, 2, 156, 10197, 1, 301, 3})},
  443|      1|      {"SM2_Kex", OID({1, 2, 156, 10197, 1, 301, 2})},
  444|      1|      {"SM2_Sig", OID({1, 2, 156, 10197, 1, 301, 1})},
  445|      1|      {"SM2_Sig/SM3", OID({1, 2, 156, 10197, 1, 501})},
  446|      1|      {"SM3", OID({1, 2, 156, 10197, 1, 401})},
  447|      1|      {"SM4/CBC", OID({1, 2, 156, 10197, 1, 104, 2})},
  448|      1|      {"SM4/GCM", OID({1, 2, 156, 10197, 1, 104, 8})},
  449|      1|      {"SM4/OCB", OID({1, 2, 156, 10197, 1, 104, 100})},
  450|      1|      {"SM4/SIV", OID({1, 3, 6, 1, 4, 1, 25258, 3, 4, 9})},
  451|      1|      {"Scrypt", OID({1, 3, 6, 1, 4, 1, 11591, 4, 11})},
  452|      1|      {"Serpent/CBC", OID({1, 3, 6, 1, 4, 1, 25258, 3, 1})},
  453|      1|      {"Serpent/GCM", OID({1, 3, 6, 1, 4, 1, 25258, 3, 101})},
  454|      1|      {"Serpent/OCB", OID({1, 3, 6, 1, 4, 1, 25258, 3, 2, 4})},
  455|      1|      {"Serpent/SIV", OID({1, 3, 6, 1, 4, 1, 25258, 3, 4, 4})},
  456|      1|      {"Streebog-256", OID({1, 2, 643, 7, 1, 1, 2, 2})},
  457|      1|      {"Streebog-512", OID({1, 2, 643, 7, 1, 1, 2, 3})},
  458|      1|      {"Threefish-512/CBC", OID({1, 3, 6, 1, 4, 1, 25258, 3, 2})},
  459|      1|      {"TripleDES/CBC", OID({1, 2, 840, 113549, 3, 7})},
  460|      1|      {"Twofish/CBC", OID({1, 3, 6, 1, 4, 1, 25258, 3, 3})},
  461|      1|      {"Twofish/GCM", OID({1, 3, 6, 1, 4, 1, 25258, 3, 102})},
  462|      1|      {"Twofish/OCB", OID({1, 3, 6, 1, 4, 1, 25258, 3, 2, 5})},
  463|      1|      {"Twofish/SIV", OID({1, 3, 6, 1, 4, 1, 25258, 3, 4, 5})},
  464|      1|      {"X509v3.AnyPolicy", OID({2, 5, 29, 32, 0})},
  465|      1|      {"X509v3.AuthorityKeyIdentifier", OID({2, 5, 29, 35})},
  466|      1|      {"X509v3.BasicConstraints", OID({2, 5, 29, 19})},
  467|      1|      {"X509v3.CRLDistributionPoints", OID({2, 5, 29, 31})},
  468|      1|      {"X509v3.CRLIssuingDistributionPoint", OID({2, 5, 29, 28})},
  469|      1|      {"X509v3.CRLNumber", OID({2, 5, 29, 20})},
  470|      1|      {"X509v3.CertificatePolicies", OID({2, 5, 29, 32})},
  471|      1|      {"X509v3.ExtendedKeyUsage", OID({2, 5, 29, 37})},
  472|      1|      {"X509v3.HoldInstructionCode", OID({2, 5, 29, 23})},
  473|      1|      {"X509v3.InvalidityDate", OID({2, 5, 29, 24})},
  474|      1|      {"X509v3.IssuerAlternativeName", OID({2, 5, 29, 18})},
  475|      1|      {"X509v3.KeyUsage", OID({2, 5, 29, 15})},
  476|      1|      {"X509v3.NameConstraints", OID({2, 5, 29, 30})},
  477|      1|      {"X509v3.PolicyConstraints", OID({2, 5, 29, 36})},
  478|      1|      {"X509v3.PrivateKeyUsagePeriod", OID({2, 5, 29, 16})},
  479|      1|      {"X509v3.ReasonCode", OID({2, 5, 29, 21})},
  480|      1|      {"X509v3.SubjectAlternativeName", OID({2, 5, 29, 17})},
  481|      1|      {"X509v3.SubjectKeyIdentifier", OID({2, 5, 29, 14})},
  482|      1|      {"X520.CommonName", OID({2, 5, 4, 3})},
  483|      1|      {"X520.Country", OID({2, 5, 4, 6})},
  484|      1|      {"X520.DNQualifier", OID({2, 5, 4, 46})},
  485|      1|      {"X520.GenerationalQualifier", OID({2, 5, 4, 44})},
  486|      1|      {"X520.GivenName", OID({2, 5, 4, 42})},
  487|      1|      {"X520.Initials", OID({2, 5, 4, 43})},
  488|      1|      {"X520.Locality", OID({2, 5, 4, 7})},
  489|      1|      {"X520.Organization", OID({2, 5, 4, 10})},
  490|      1|      {"X520.OrganizationalUnit", OID({2, 5, 4, 11})},
  491|      1|      {"X520.Pseudonym", OID({2, 5, 4, 65})},
  492|      1|      {"X520.SerialNumber", OID({2, 5, 4, 5})},
  493|      1|      {"X520.State", OID({2, 5, 4, 8})},
  494|      1|      {"X520.StreetAddress", OID({2, 5, 4, 9})},
  495|      1|      {"X520.Surname", OID({2, 5, 4, 4})},
  496|      1|      {"X520.Title", OID({2, 5, 4, 12})},
  497|      1|      {"XMSS", OID({0, 4, 0, 127, 0, 15, 1, 1, 13, 0})},
  498|      1|      {"XMSS-draft12", OID({1, 3, 6, 1, 4, 1, 25258, 1, 8})},
  499|      1|      {"XMSS-draft6", OID({1, 3, 6, 1, 4, 1, 25258, 1, 5})},
  500|      1|      {"brainpool160r1", OID({1, 3, 36, 3, 3, 2, 8, 1, 1, 1})},
  501|      1|      {"brainpool192r1", OID({1, 3, 36, 3, 3, 2, 8, 1, 1, 3})},
  502|      1|      {"brainpool224r1", OID({1, 3, 36, 3, 3, 2, 8, 1, 1, 5})},
  503|      1|      {"brainpool256r1", OID({1, 3, 36, 3, 3, 2, 8, 1, 1, 7})},
  504|      1|      {"brainpool320r1", OID({1, 3, 36, 3, 3, 2, 8, 1, 1, 9})},
  505|      1|      {"brainpool384r1", OID({1, 3, 36, 3, 3, 2, 8, 1, 1, 11})},
  506|      1|      {"brainpool512r1", OID({1, 3, 36, 3, 3, 2, 8, 1, 1, 13})},
  507|      1|      {"frp256v1", OID({1, 2, 250, 1, 223, 101, 256, 1})},
  508|      1|      {"gost_256A", OID({1, 2, 643, 7, 1, 2, 1, 1, 1})},
  509|      1|      {"gost_256B", OID({1, 2, 643, 7, 1, 2, 1, 1, 2})},
  510|      1|      {"gost_512A", OID({1, 2, 643, 7, 1, 2, 1, 2, 1})},
  511|      1|      {"gost_512B", OID({1, 2, 643, 7, 1, 2, 1, 2, 2})},
  512|      1|      {"secp160k1", OID({1, 3, 132, 0, 9})},
  513|      1|      {"secp160r1", OID({1, 3, 132, 0, 8})},
  514|      1|      {"secp160r2", OID({1, 3, 132, 0, 30})},
  515|      1|      {"secp192k1", OID({1, 3, 132, 0, 31})},
  516|      1|      {"secp192r1", OID({1, 2, 840, 10045, 3, 1, 1})},
  517|      1|      {"secp224k1", OID({1, 3, 132, 0, 32})},
  518|      1|      {"secp224r1", OID({1, 3, 132, 0, 33})},
  519|      1|      {"secp256k1", OID({1, 3, 132, 0, 10})},
  520|      1|      {"secp256r1", OID({1, 2, 840, 10045, 3, 1, 7})},
  521|      1|      {"secp384r1", OID({1, 3, 132, 0, 34})},
  522|      1|      {"secp521r1", OID({1, 3, 132, 0, 35})},
  523|      1|      {"sm2p256v1", OID({1, 2, 156, 10197, 1, 301})},
  524|      1|      {"x962_p192v2", OID({1, 2, 840, 10045, 3, 1, 2})},
  525|      1|      {"x962_p192v3", OID({1, 2, 840, 10045, 3, 1, 3})},
  526|      1|      {"x962_p239v1", OID({1, 2, 840, 10045, 3, 1, 4})},
  527|      1|      {"x962_p239v2", OID({1, 2, 840, 10045, 3, 1, 5})},
  528|      1|      {"x962_p239v3", OID({1, 2, 840, 10045, 3, 1, 6})}};
  529|      1|}

_ZN5Botan10PSS_ParamsC2EPKhm:
   37|      5|PSS_Params::PSS_Params(const uint8_t der[], size_t der_len) {
   38|      5|   BER_Decoder decoder(der, der_len);
   39|      5|   this->decode_from(decoder);
   40|      5|}
_ZN5Botan10PSS_Params11decode_fromERNS_11BER_DecoderE:
   67|      5|void PSS_Params::decode_from(BER_Decoder& from) {
   68|      5|   const AlgorithmIdentifier default_hash("SHA-1", AlgorithmIdentifier::USE_NULL_PARAM);
   69|      5|   const AlgorithmIdentifier default_mgf("MGF1", default_hash.BER_encode());
   70|      5|   const size_t default_salt_len = 20;
   71|      5|   const size_t default_trailer = 1;
   72|       |
   73|      5|   from.start_sequence()
   74|      5|      .decode_optional(m_hash, ASN1_Type(0), ASN1_Class::ExplicitContextSpecific, default_hash)
   75|      5|      .decode_optional(m_mgf, ASN1_Type(1), ASN1_Class::ExplicitContextSpecific, default_mgf)
   76|      5|      .decode_optional(m_salt_len, ASN1_Type(2), ASN1_Class::ExplicitContextSpecific, default_salt_len)
   77|      5|      .decode_optional(m_trailer_field, ASN1_Type(3), ASN1_Class::ExplicitContextSpecific, default_trailer)
   78|      5|      .end_cons();
   79|       |
   80|      5|   BER_Decoder(m_mgf.parameters()).decode(m_mgf_hash);
   81|      5|}

_ZN5Botan13base64_decodeEPKcmb:
  174|  1.83k|secure_vector<uint8_t> base64_decode(const char input[], size_t input_length, bool ignore_ws) {
  175|  1.83k|   return base_decode_to_vec<secure_vector<uint8_t>>(Base64(), input, input_length, ignore_ws);
  176|  1.83k|}
base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6417decode_max_outputEm:
   41|  3.67k|      static inline size_t decode_max_output(size_t input_length) {
   42|  3.67k|         return (round_up(input_length, m_encoding_bytes_out) * m_encoding_bytes_in) / m_encoding_bytes_out;
   43|  3.67k|      }
base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6417decoding_bytes_inEv:
   29|  1.83k|      static inline size_t decoding_bytes_in() noexcept { return m_encoding_bytes_out; }
base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6418decoding_bytes_outEv:
   31|  1.83k|      static inline size_t decoding_bytes_out() noexcept { return m_encoding_bytes_in; }
base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6419lookup_binary_valueEc:
  103|  1.89M|uint8_t Base64::lookup_binary_value(char input) noexcept {
  104|  1.89M|   const uint8_t c = static_cast<uint8_t>(input);
  105|       |
  106|  1.89M|   const auto is_alpha_upper = CT::Mask<uint8_t>::is_within_range(c, uint8_t('A'), uint8_t('Z'));
  107|  1.89M|   const auto is_alpha_lower = CT::Mask<uint8_t>::is_within_range(c, uint8_t('a'), uint8_t('z'));
  108|  1.89M|   const auto is_decimal = CT::Mask<uint8_t>::is_within_range(c, uint8_t('0'), uint8_t('9'));
  109|       |
  110|  1.89M|   const auto is_plus = CT::Mask<uint8_t>::is_equal(c, uint8_t('+'));
  111|  1.89M|   const auto is_slash = CT::Mask<uint8_t>::is_equal(c, uint8_t('/'));
  112|  1.89M|   const auto is_equal = CT::Mask<uint8_t>::is_equal(c, uint8_t('='));
  113|       |
  114|  1.89M|   const auto is_whitespace =
  115|  1.89M|      CT::Mask<uint8_t>::is_any_of(c, {uint8_t(' '), uint8_t('\t'), uint8_t('\n'), uint8_t('\r')});
  116|       |
  117|  1.89M|   const uint8_t c_upper = c - uint8_t('A');
  118|  1.89M|   const uint8_t c_lower = c - uint8_t('a') + 26;
  119|  1.89M|   const uint8_t c_decim = c - uint8_t('0') + 2 * 26;
  120|       |
  121|  1.89M|   uint8_t ret = 0xFF;  // default value
  122|       |
  123|  1.89M|   ret = is_alpha_upper.select(c_upper, ret);
  124|  1.89M|   ret = is_alpha_lower.select(c_lower, ret);
  125|  1.89M|   ret = is_decimal.select(c_decim, ret);
  126|  1.89M|   ret = is_plus.select(62, ret);
  127|  1.89M|   ret = is_slash.select(63, ret);
  128|  1.89M|   ret = is_equal.select(0x81, ret);
  129|  1.89M|   ret = is_whitespace.select(0x80, ret);
  130|       |
  131|  1.89M|   return ret;
  132|  1.89M|}
base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6414check_bad_charEhcb:
  135|  1.88M|bool Base64::check_bad_char(uint8_t bin, char input, bool ignore_ws) {
  136|  1.88M|   if(bin <= 0x3F) {
  ------------------
  |  Branch (136:7): [True: 1.85M, False: 22.9k]
  ------------------
  137|  1.85M|      return true;
  138|  1.85M|   } else if(!(bin == 0x81 || (bin == 0x80 && ignore_ws))) {
  ------------------
  |  Branch (138:16): [True: 901, False: 22.0k]
  |  Branch (138:32): [True: 22.0k, False: 39]
  |  Branch (138:47): [True: 22.0k, False: 0]
  ------------------
  139|     39|      throw Invalid_Argument(fmt("base64_decode: invalid character '{}'", format_char_for_display(input)));
  140|     39|   }
  141|  22.9k|   return false;
  142|  1.88M|}
base64.cpp:_ZN5Botan12_GLOBAL__N_16Base646decodeEPhPKh:
   51|   465k|      static void decode(uint8_t* out_ptr, const uint8_t decode_buf[4]) {
   52|   465k|         out_ptr[0] = (decode_buf[0] << 2) | (decode_buf[1] >> 4);
   53|   465k|         out_ptr[1] = (decode_buf[1] << 4) | (decode_buf[2] >> 2);
   54|   465k|         out_ptr[2] = (decode_buf[2] << 6) | decode_buf[3];
   55|   465k|      }
base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6415bytes_to_removeEm:
   57|  1.79k|      static inline size_t bytes_to_remove(size_t final_truncate) { return final_truncate; }
base64.cpp:_ZN5Botan12_GLOBAL__N_16Base644nameEv:
   23|     36|      static inline std::string name() noexcept { return "base64"; }

_ZN5Botan10hex_encodeEPcPKhmb:
   33|  8.00k|void hex_encode(char output[], const uint8_t input[], size_t input_length, bool uppercase) {
   34|   216k|   for(size_t i = 0; i != input_length; ++i) {
  ------------------
  |  Branch (34:22): [True: 208k, False: 8.00k]
  ------------------
   35|   208k|      const uint8_t n0 = (input[i] >> 4) & 0xF;
   36|   208k|      const uint8_t n1 = (input[i]) & 0xF;
   37|       |
   38|   208k|      output[2 * i] = hex_encode_nibble(n0, uppercase);
   39|   208k|      output[2 * i + 1] = hex_encode_nibble(n1, uppercase);
   40|   208k|   }
   41|  8.00k|}
_ZN5Botan10hex_encodeEPKhmb:
   43|  8.00k|std::string hex_encode(const uint8_t input[], size_t input_length, bool uppercase) {
   44|  8.00k|   std::string output(2 * input_length, 0);
   45|       |
   46|  8.00k|   if(input_length) {
  ------------------
  |  Branch (46:7): [True: 8.00k, False: 0]
  ------------------
   47|  8.00k|      hex_encode(&output.front(), input, input_length, uppercase);
   48|  8.00k|   }
   49|       |
   50|  8.00k|   return output;
   51|  8.00k|}
_ZN5Botan10hex_decodeEPhPKcmRmb:
   81|     50|size_t hex_decode(uint8_t output[], const char input[], size_t input_length, size_t& input_consumed, bool ignore_ws) {
   82|     50|   uint8_t* out_ptr = output;
   83|     50|   bool top_nibble = true;
   84|       |
   85|     50|   clear_mem(output, input_length / 2);
   86|       |
   87|  2.77k|   for(size_t i = 0; i != input_length; ++i) {
  ------------------
  |  Branch (87:22): [True: 2.72k, False: 50]
  ------------------
   88|  2.72k|      const uint8_t bin = hex_char_to_bin(input[i]);
   89|       |
   90|  2.72k|      if(bin >= 0x10) {
  ------------------
  |  Branch (90:10): [True: 0, False: 2.72k]
  ------------------
   91|      0|         if(bin == 0x80 && ignore_ws) {
  ------------------
  |  Branch (91:13): [True: 0, False: 0]
  |  Branch (91:28): [True: 0, False: 0]
  ------------------
   92|      0|            continue;
   93|      0|         }
   94|       |
   95|      0|         throw Invalid_Argument(fmt("hex_decode: invalid character '{}'", format_char_for_display(input[i])));
   96|      0|      }
   97|       |
   98|  2.72k|      if(top_nibble) {
  ------------------
  |  Branch (98:10): [True: 1.36k, False: 1.36k]
  ------------------
   99|  1.36k|         *out_ptr |= bin << 4;
  100|  1.36k|      } else {
  101|  1.36k|         *out_ptr |= bin;
  102|  1.36k|      }
  103|       |
  104|  2.72k|      top_nibble = !top_nibble;
  105|  2.72k|      if(top_nibble) {
  ------------------
  |  Branch (105:10): [True: 1.36k, False: 1.36k]
  ------------------
  106|  1.36k|         ++out_ptr;
  107|  1.36k|      }
  108|  2.72k|   }
  109|       |
  110|     50|   input_consumed = input_length;
  111|     50|   size_t written = (out_ptr - output);
  112|       |
  113|       |   /*
  114|       |   * We only got half of a uint8_t at the end; zap the half-written
  115|       |   * output and mark it as unread
  116|       |   */
  117|     50|   if(!top_nibble) {
  ------------------
  |  Branch (117:7): [True: 0, False: 50]
  ------------------
  118|      0|      *out_ptr = 0;
  119|      0|      input_consumed -= 1;
  120|      0|   }
  121|       |
  122|     50|   return written;
  123|     50|}
_ZN5Botan10hex_decodeEPhPKcmb:
  125|     50|size_t hex_decode(uint8_t output[], const char input[], size_t input_length, bool ignore_ws) {
  126|     50|   size_t consumed = 0;
  127|     50|   size_t written = hex_decode(output, input, input_length, consumed, ignore_ws);
  128|       |
  129|     50|   if(consumed != input_length) {
  ------------------
  |  Branch (129:7): [True: 0, False: 50]
  ------------------
  130|      0|      throw Invalid_Argument("hex_decode: input did not have full bytes");
  131|      0|   }
  132|       |
  133|     50|   return written;
  134|     50|}
_ZN5Botan17hex_decode_lockedEPKcmb:
  144|     50|secure_vector<uint8_t> hex_decode_locked(const char input[], size_t input_length, bool ignore_ws) {
  145|     50|   secure_vector<uint8_t> bin(1 + input_length / 2);
  146|       |
  147|     50|   size_t written = hex_decode(bin.data(), input, input_length, ignore_ws);
  148|       |
  149|     50|   bin.resize(written);
  150|     50|   return bin;
  151|     50|}
hex.cpp:_ZN5Botan12_GLOBAL__N_117hex_encode_nibbleEhb:
   20|   416k|char hex_encode_nibble(uint8_t n, bool uppercase) {
   21|   416k|   BOTAN_DEBUG_ASSERT(n <= 15);
  ------------------
  |  |   99|   416k|      do {                          \
  |  |  100|   416k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
   22|       |
   23|   416k|   const auto in_09 = CT::Mask<uint8_t>::is_lt(n, 10);
   24|       |
   25|   416k|   const char c_09 = n + '0';
   26|   416k|   const char c_af = n + (uppercase ? 'A' : 'a') - 10;
  ------------------
  |  Branch (26:27): [True: 416k, False: 0]
  ------------------
   27|       |
   28|   416k|   return in_09.select(c_09, c_af);
   29|   416k|}
hex.cpp:_ZN5Botan12_GLOBAL__N_115hex_char_to_binEc:
   55|  2.72k|uint8_t hex_char_to_bin(char input) {
   56|  2.72k|   const uint8_t c = static_cast<uint8_t>(input);
   57|       |
   58|  2.72k|   const auto is_alpha_upper = CT::Mask<uint8_t>::is_within_range(c, uint8_t('A'), uint8_t('F'));
   59|  2.72k|   const auto is_alpha_lower = CT::Mask<uint8_t>::is_within_range(c, uint8_t('a'), uint8_t('f'));
   60|  2.72k|   const auto is_decimal = CT::Mask<uint8_t>::is_within_range(c, uint8_t('0'), uint8_t('9'));
   61|       |
   62|  2.72k|   const auto is_whitespace =
   63|  2.72k|      CT::Mask<uint8_t>::is_any_of(c, {uint8_t(' '), uint8_t('\t'), uint8_t('\n'), uint8_t('\r')});
   64|       |
   65|  2.72k|   const uint8_t c_upper = c - uint8_t('A') + 10;
   66|  2.72k|   const uint8_t c_lower = c - uint8_t('a') + 10;
   67|  2.72k|   const uint8_t c_decim = c - uint8_t('0');
   68|       |
   69|  2.72k|   uint8_t ret = 0xFF;  // default value
   70|       |
   71|  2.72k|   ret = is_alpha_upper.select(c_upper, ret);
   72|  2.72k|   ret = is_alpha_lower.select(c_lower, ret);
   73|  2.72k|   ret = is_decimal.select(c_decim, ret);
   74|  2.72k|   ret = is_whitespace.select(0x80, ret);
   75|       |
   76|  2.72k|   return ret;
   77|  2.72k|}

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

_ZN5Botan3MD510compress_nEPKhm:
   62|    192|void MD5::compress_n(const uint8_t input[], size_t blocks) {
   63|    192|   uint32_t A = m_digest[0], B = m_digest[1], C = m_digest[2], D = m_digest[3];
   64|       |
   65|  1.10k|   for(size_t i = 0; i != blocks; ++i) {
  ------------------
  |  Branch (65:22): [True: 916, False: 192]
  ------------------
   66|    916|      load_le(m_M.data(), input, m_M.size());
   67|       |
   68|    916|      FF<7>(A, B, C, D, m_M[0] + 0xD76AA478);
   69|    916|      FF<12>(D, A, B, C, m_M[1] + 0xE8C7B756);
   70|    916|      FF<17>(C, D, A, B, m_M[2] + 0x242070DB);
   71|    916|      FF<22>(B, C, D, A, m_M[3] + 0xC1BDCEEE);
   72|    916|      FF<7>(A, B, C, D, m_M[4] + 0xF57C0FAF);
   73|    916|      FF<12>(D, A, B, C, m_M[5] + 0x4787C62A);
   74|    916|      FF<17>(C, D, A, B, m_M[6] + 0xA8304613);
   75|    916|      FF<22>(B, C, D, A, m_M[7] + 0xFD469501);
   76|    916|      FF<7>(A, B, C, D, m_M[8] + 0x698098D8);
   77|    916|      FF<12>(D, A, B, C, m_M[9] + 0x8B44F7AF);
   78|    916|      FF<17>(C, D, A, B, m_M[10] + 0xFFFF5BB1);
   79|    916|      FF<22>(B, C, D, A, m_M[11] + 0x895CD7BE);
   80|    916|      FF<7>(A, B, C, D, m_M[12] + 0x6B901122);
   81|    916|      FF<12>(D, A, B, C, m_M[13] + 0xFD987193);
   82|    916|      FF<17>(C, D, A, B, m_M[14] + 0xA679438E);
   83|    916|      FF<22>(B, C, D, A, m_M[15] + 0x49B40821);
   84|       |
   85|    916|      GG<5>(A, B, C, D, m_M[1] + 0xF61E2562);
   86|    916|      GG<9>(D, A, B, C, m_M[6] + 0xC040B340);
   87|    916|      GG<14>(C, D, A, B, m_M[11] + 0x265E5A51);
   88|    916|      GG<20>(B, C, D, A, m_M[0] + 0xE9B6C7AA);
   89|    916|      GG<5>(A, B, C, D, m_M[5] + 0xD62F105D);
   90|    916|      GG<9>(D, A, B, C, m_M[10] + 0x02441453);
   91|    916|      GG<14>(C, D, A, B, m_M[15] + 0xD8A1E681);
   92|    916|      GG<20>(B, C, D, A, m_M[4] + 0xE7D3FBC8);
   93|    916|      GG<5>(A, B, C, D, m_M[9] + 0x21E1CDE6);
   94|    916|      GG<9>(D, A, B, C, m_M[14] + 0xC33707D6);
   95|    916|      GG<14>(C, D, A, B, m_M[3] + 0xF4D50D87);
   96|    916|      GG<20>(B, C, D, A, m_M[8] + 0x455A14ED);
   97|    916|      GG<5>(A, B, C, D, m_M[13] + 0xA9E3E905);
   98|    916|      GG<9>(D, A, B, C, m_M[2] + 0xFCEFA3F8);
   99|    916|      GG<14>(C, D, A, B, m_M[7] + 0x676F02D9);
  100|    916|      GG<20>(B, C, D, A, m_M[12] + 0x8D2A4C8A);
  101|       |
  102|    916|      HH<4>(A, B, C, D, m_M[5] + 0xFFFA3942);
  103|    916|      HH<11>(D, A, B, C, m_M[8] + 0x8771F681);
  104|    916|      HH<16>(C, D, A, B, m_M[11] + 0x6D9D6122);
  105|    916|      HH<23>(B, C, D, A, m_M[14] + 0xFDE5380C);
  106|    916|      HH<4>(A, B, C, D, m_M[1] + 0xA4BEEA44);
  107|    916|      HH<11>(D, A, B, C, m_M[4] + 0x4BDECFA9);
  108|    916|      HH<16>(C, D, A, B, m_M[7] + 0xF6BB4B60);
  109|    916|      HH<23>(B, C, D, A, m_M[10] + 0xBEBFBC70);
  110|    916|      HH<4>(A, B, C, D, m_M[13] + 0x289B7EC6);
  111|    916|      HH<11>(D, A, B, C, m_M[0] + 0xEAA127FA);
  112|    916|      HH<16>(C, D, A, B, m_M[3] + 0xD4EF3085);
  113|    916|      HH<23>(B, C, D, A, m_M[6] + 0x04881D05);
  114|    916|      HH<4>(A, B, C, D, m_M[9] + 0xD9D4D039);
  115|    916|      HH<11>(D, A, B, C, m_M[12] + 0xE6DB99E5);
  116|    916|      HH<16>(C, D, A, B, m_M[15] + 0x1FA27CF8);
  117|    916|      HH<23>(B, C, D, A, m_M[2] + 0xC4AC5665);
  118|       |
  119|    916|      II<6>(A, B, C, D, m_M[0] + 0xF4292244);
  120|    916|      II<10>(D, A, B, C, m_M[7] + 0x432AFF97);
  121|    916|      II<15>(C, D, A, B, m_M[14] + 0xAB9423A7);
  122|    916|      II<21>(B, C, D, A, m_M[5] + 0xFC93A039);
  123|    916|      II<6>(A, B, C, D, m_M[12] + 0x655B59C3);
  124|    916|      II<10>(D, A, B, C, m_M[3] + 0x8F0CCC92);
  125|    916|      II<15>(C, D, A, B, m_M[10] + 0xFFEFF47D);
  126|    916|      II<21>(B, C, D, A, m_M[1] + 0x85845DD1);
  127|    916|      II<6>(A, B, C, D, m_M[8] + 0x6FA87E4F);
  128|    916|      II<10>(D, A, B, C, m_M[15] + 0xFE2CE6E0);
  129|    916|      II<15>(C, D, A, B, m_M[6] + 0xA3014314);
  130|    916|      II<21>(B, C, D, A, m_M[13] + 0x4E0811A1);
  131|    916|      II<6>(A, B, C, D, m_M[4] + 0xF7537E82);
  132|    916|      II<10>(D, A, B, C, m_M[11] + 0xBD3AF235);
  133|    916|      II<15>(C, D, A, B, m_M[2] + 0x2AD7D2BB);
  134|    916|      II<21>(B, C, D, A, m_M[9] + 0xEB86D391);
  135|       |
  136|    916|      A = (m_digest[0] += A);
  137|    916|      B = (m_digest[1] += B);
  138|    916|      C = (m_digest[2] += C);
  139|    916|      D = (m_digest[3] += D);
  140|       |
  141|    916|      input += hash_block_size();
  142|    916|   }
  143|    192|}
_ZN5Botan3MD58copy_outEPh:
  148|     96|void MD5::copy_out(uint8_t output[]) { copy_out_vec_le(output, output_length(), m_digest); }
_ZN5Botan3MD55clearEv:
  153|    192|void MD5::clear() {
  154|    192|   MDx_HashFunction::clear();
  155|    192|   zeroise(m_M);
  156|    192|   m_digest[0] = 0x67452301;
  157|    192|   m_digest[1] = 0xEFCDAB89;
  158|    192|   m_digest[2] = 0x98BADCFE;
  159|    192|   m_digest[3] = 0x10325476;
  160|    192|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12FFILm7EEEvRjjjjj:
   24|  3.66k|inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   25|  3.66k|   A += choose(B, C, D) + M;
   26|  3.66k|   A = rotl<S>(A) + B;
   27|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12FFILm12EEEvRjjjjj:
   24|  3.66k|inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   25|  3.66k|   A += choose(B, C, D) + M;
   26|  3.66k|   A = rotl<S>(A) + B;
   27|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12FFILm17EEEvRjjjjj:
   24|  3.66k|inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   25|  3.66k|   A += choose(B, C, D) + M;
   26|  3.66k|   A = rotl<S>(A) + B;
   27|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12FFILm22EEEvRjjjjj:
   24|  3.66k|inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   25|  3.66k|   A += choose(B, C, D) + M;
   26|  3.66k|   A = rotl<S>(A) + B;
   27|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12GGILm5EEEvRjjjjj:
   33|  3.66k|inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   34|  3.66k|   A += choose(D, B, C) + M;
   35|  3.66k|   A = rotl<S>(A) + B;
   36|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12GGILm9EEEvRjjjjj:
   33|  3.66k|inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   34|  3.66k|   A += choose(D, B, C) + M;
   35|  3.66k|   A = rotl<S>(A) + B;
   36|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12GGILm14EEEvRjjjjj:
   33|  3.66k|inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   34|  3.66k|   A += choose(D, B, C) + M;
   35|  3.66k|   A = rotl<S>(A) + B;
   36|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12GGILm20EEEvRjjjjj:
   33|  3.66k|inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   34|  3.66k|   A += choose(D, B, C) + M;
   35|  3.66k|   A = rotl<S>(A) + B;
   36|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12HHILm4EEEvRjjjjj:
   42|  3.66k|inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   43|  3.66k|   A += (B ^ C ^ D) + M;
   44|  3.66k|   A = rotl<S>(A) + B;
   45|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12HHILm11EEEvRjjjjj:
   42|  3.66k|inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   43|  3.66k|   A += (B ^ C ^ D) + M;
   44|  3.66k|   A = rotl<S>(A) + B;
   45|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12HHILm16EEEvRjjjjj:
   42|  3.66k|inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   43|  3.66k|   A += (B ^ C ^ D) + M;
   44|  3.66k|   A = rotl<S>(A) + B;
   45|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12HHILm23EEEvRjjjjj:
   42|  3.66k|inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   43|  3.66k|   A += (B ^ C ^ D) + M;
   44|  3.66k|   A = rotl<S>(A) + B;
   45|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12IIILm6EEEvRjjjjj:
   51|  3.66k|inline void II(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   52|       |   // This expr is choose(D, B ^ C, ~C), but that is slower
   53|  3.66k|   A += (C ^ (B | ~D)) + M;
   54|  3.66k|   A = rotl<S>(A) + B;
   55|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12IIILm10EEEvRjjjjj:
   51|  3.66k|inline void II(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   52|       |   // This expr is choose(D, B ^ C, ~C), but that is slower
   53|  3.66k|   A += (C ^ (B | ~D)) + M;
   54|  3.66k|   A = rotl<S>(A) + B;
   55|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12IIILm15EEEvRjjjjj:
   51|  3.66k|inline void II(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   52|       |   // This expr is choose(D, B ^ C, ~C), but that is slower
   53|  3.66k|   A += (C ^ (B | ~D)) + M;
   54|  3.66k|   A = rotl<S>(A) + B;
   55|  3.66k|}
md5.cpp:_ZN5Botan12_GLOBAL__N_12IIILm21EEEvRjjjjj:
   51|  3.66k|inline void II(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) {
   52|       |   // This expr is choose(D, B ^ C, ~C), but that is slower
   53|  3.66k|   A += (C ^ (B | ~D)) + M;
   54|  3.66k|   A = rotl<S>(A) + B;
   55|  3.66k|}

_ZN5Botan16MDx_HashFunctionC2Embbh:
   26|  17.6k|      m_position(0) {
   27|  17.6k|   if(!is_power_of_2(block_len)) {
  ------------------
  |  Branch (27:7): [True: 0, False: 17.6k]
  ------------------
   28|      0|      throw Invalid_Argument("MDx_HashFunction block length must be a power of 2");
   29|      0|   }
   30|  17.6k|   if(m_block_bits < 3 || m_block_bits > 16) {
  ------------------
  |  Branch (30:7): [True: 0, False: 17.6k]
  |  Branch (30:27): [True: 0, False: 17.6k]
  ------------------
   31|      0|      throw Invalid_Argument("MDx_HashFunction block size too large or too small");
   32|      0|   }
   33|  17.6k|   if(m_counter_size < 8 || m_counter_size > block_len) {
  ------------------
  |  Branch (33:7): [True: 0, False: 17.6k]
  |  Branch (33:29): [True: 0, False: 17.6k]
  ------------------
   34|      0|      throw Invalid_State("MDx_HashFunction invalid counter length");
   35|      0|   }
   36|  17.6k|}
_ZN5Botan16MDx_HashFunction5clearEv:
   41|  39.2k|void MDx_HashFunction::clear() {
   42|  39.2k|   zeroise(m_buffer);
   43|  39.2k|   m_count = m_position = 0;
   44|  39.2k|}
_ZN5Botan16MDx_HashFunction8add_dataEPKhm:
   49|  21.6k|void MDx_HashFunction::add_data(const uint8_t input[], size_t length) {
   50|  21.6k|   const size_t block_len = static_cast<size_t>(1) << m_block_bits;
   51|       |
   52|  21.6k|   m_count += length;
   53|       |
   54|  21.6k|   if(m_position) {
  ------------------
  |  Branch (54:7): [True: 0, False: 21.6k]
  ------------------
   55|      0|      buffer_insert(m_buffer, m_position, input, length);
   56|       |
   57|      0|      if(m_position + length >= block_len) {
  ------------------
  |  Branch (57:10): [True: 0, False: 0]
  ------------------
   58|      0|         compress_n(m_buffer.data(), 1);
   59|      0|         input += (block_len - m_position);
   60|      0|         length -= (block_len - m_position);
   61|      0|         m_position = 0;
   62|      0|      }
   63|      0|   }
   64|       |
   65|       |   // Just in case the compiler can't figure out block_len is a power of 2
   66|  21.6k|   const size_t full_blocks = length >> m_block_bits;
   67|  21.6k|   const size_t remaining = length & (block_len - 1);
   68|       |
   69|  21.6k|   if(full_blocks > 0) {
  ------------------
  |  Branch (69:7): [True: 16.4k, False: 5.24k]
  ------------------
   70|  16.4k|      compress_n(input, full_blocks);
   71|  16.4k|   }
   72|       |
   73|  21.6k|   buffer_insert(m_buffer, m_position, input + full_blocks * block_len, remaining);
   74|  21.6k|   m_position += remaining;
   75|  21.6k|}
_ZN5Botan16MDx_HashFunction12final_resultEPh:
   80|  21.6k|void MDx_HashFunction::final_result(uint8_t output[]) {
   81|  21.6k|   const size_t block_len = static_cast<size_t>(1) << m_block_bits;
   82|       |
   83|  21.6k|   clear_mem(&m_buffer[m_position], block_len - m_position);
   84|  21.6k|   m_buffer[m_position] = m_pad_char;
   85|       |
   86|  21.6k|   if(m_position >= block_len - m_counter_size) {
  ------------------
  |  Branch (86:7): [True: 993, False: 20.6k]
  ------------------
   87|    993|      compress_n(m_buffer.data(), 1);
   88|    993|      zeroise(m_buffer);
   89|    993|   }
   90|       |
   91|  21.6k|   BOTAN_ASSERT_NOMSG(m_counter_size <= output_length());
  ------------------
  |  |   60|  21.6k|   do {                                                                     \
  |  |   61|  21.6k|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 21.6k]
  |  |  ------------------
  |  |   62|  21.6k|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|  21.6k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   92|  21.6k|   BOTAN_ASSERT_NOMSG(m_counter_size >= 8);
  ------------------
  |  |   60|  21.6k|   do {                                                                     \
  |  |   61|  21.6k|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 21.6k]
  |  |  ------------------
  |  |   62|  21.6k|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|  21.6k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   93|       |
   94|  21.6k|   const uint64_t bit_count = m_count * 8;
   95|       |
   96|  21.6k|   if(m_count_big_endian) {
  ------------------
  |  Branch (96:7): [True: 21.5k, False: 96]
  ------------------
   97|  21.5k|      store_be(bit_count, &m_buffer[block_len - 8]);
   98|  21.5k|   } else {
   99|     96|      store_le(bit_count, &m_buffer[block_len - 8]);
  100|     96|   }
  101|       |
  102|  21.6k|   compress_n(m_buffer.data(), 1);
  103|  21.6k|   copy_out(output);
  104|  21.6k|   clear();
  105|  21.6k|}

_ZN5Botan5SHA_110compress_nEPKhm:
   62|  16.0k|void SHA_1::compress_n(const uint8_t input[], size_t blocks) {
   63|  16.0k|   using namespace SHA1_F;
   64|       |
   65|  16.0k|#if defined(BOTAN_HAS_SHA1_X86_SHA_NI)
   66|  16.0k|   if(CPUID::has_intel_sha()) {
  ------------------
  |  Branch (66:7): [True: 0, False: 16.0k]
  ------------------
   67|      0|      return sha1_compress_x86(m_digest, input, blocks);
   68|      0|   }
   69|  16.0k|#endif
   70|       |
   71|       |#if defined(BOTAN_HAS_SHA1_ARMV8)
   72|       |   if(CPUID::has_arm_sha1()) {
   73|       |      return sha1_armv8_compress_n(m_digest, input, blocks);
   74|       |   }
   75|       |#endif
   76|       |
   77|  16.0k|#if defined(BOTAN_HAS_SHA1_SSE2)
   78|  16.0k|   if(CPUID::has_sse2()) {
  ------------------
  |  Branch (78:7): [True: 16.0k, False: 0]
  ------------------
   79|  16.0k|      return sse2_compress_n(m_digest, input, blocks);
   80|  16.0k|   }
   81|       |
   82|      0|#endif
   83|       |
   84|      0|   uint32_t A = m_digest[0], B = m_digest[1], C = m_digest[2], D = m_digest[3], E = m_digest[4];
   85|       |
   86|      0|   m_W.resize(80);
   87|       |
   88|      0|   for(size_t i = 0; i != blocks; ++i) {
  ------------------
  |  Branch (88:22): [True: 0, False: 0]
  ------------------
   89|      0|      load_be(m_W.data(), input, 16);
   90|       |
   91|      0|      for(size_t j = 16; j != 80; j += 8) {
  ------------------
  |  Branch (91:26): [True: 0, False: 0]
  ------------------
   92|      0|         m_W[j] = rotl<1>(m_W[j - 3] ^ m_W[j - 8] ^ m_W[j - 14] ^ m_W[j - 16]);
   93|      0|         m_W[j + 1] = rotl<1>(m_W[j - 2] ^ m_W[j - 7] ^ m_W[j - 13] ^ m_W[j - 15]);
   94|      0|         m_W[j + 2] = rotl<1>(m_W[j - 1] ^ m_W[j - 6] ^ m_W[j - 12] ^ m_W[j - 14]);
   95|      0|         m_W[j + 3] = rotl<1>(m_W[j] ^ m_W[j - 5] ^ m_W[j - 11] ^ m_W[j - 13]);
   96|      0|         m_W[j + 4] = rotl<1>(m_W[j + 1] ^ m_W[j - 4] ^ m_W[j - 10] ^ m_W[j - 12]);
   97|      0|         m_W[j + 5] = rotl<1>(m_W[j + 2] ^ m_W[j - 3] ^ m_W[j - 9] ^ m_W[j - 11]);
   98|      0|         m_W[j + 6] = rotl<1>(m_W[j + 3] ^ m_W[j - 2] ^ m_W[j - 8] ^ m_W[j - 10]);
   99|      0|         m_W[j + 7] = rotl<1>(m_W[j + 4] ^ m_W[j - 1] ^ m_W[j - 7] ^ m_W[j - 9]);
  100|      0|      }
  101|       |
  102|      0|      F1(A, B, C, D, E, m_W[0]);
  103|      0|      F1(E, A, B, C, D, m_W[1]);
  104|      0|      F1(D, E, A, B, C, m_W[2]);
  105|      0|      F1(C, D, E, A, B, m_W[3]);
  106|      0|      F1(B, C, D, E, A, m_W[4]);
  107|      0|      F1(A, B, C, D, E, m_W[5]);
  108|      0|      F1(E, A, B, C, D, m_W[6]);
  109|      0|      F1(D, E, A, B, C, m_W[7]);
  110|      0|      F1(C, D, E, A, B, m_W[8]);
  111|      0|      F1(B, C, D, E, A, m_W[9]);
  112|      0|      F1(A, B, C, D, E, m_W[10]);
  113|      0|      F1(E, A, B, C, D, m_W[11]);
  114|      0|      F1(D, E, A, B, C, m_W[12]);
  115|      0|      F1(C, D, E, A, B, m_W[13]);
  116|      0|      F1(B, C, D, E, A, m_W[14]);
  117|      0|      F1(A, B, C, D, E, m_W[15]);
  118|      0|      F1(E, A, B, C, D, m_W[16]);
  119|      0|      F1(D, E, A, B, C, m_W[17]);
  120|      0|      F1(C, D, E, A, B, m_W[18]);
  121|      0|      F1(B, C, D, E, A, m_W[19]);
  122|       |
  123|      0|      F2(A, B, C, D, E, m_W[20]);
  124|      0|      F2(E, A, B, C, D, m_W[21]);
  125|      0|      F2(D, E, A, B, C, m_W[22]);
  126|      0|      F2(C, D, E, A, B, m_W[23]);
  127|      0|      F2(B, C, D, E, A, m_W[24]);
  128|      0|      F2(A, B, C, D, E, m_W[25]);
  129|      0|      F2(E, A, B, C, D, m_W[26]);
  130|      0|      F2(D, E, A, B, C, m_W[27]);
  131|      0|      F2(C, D, E, A, B, m_W[28]);
  132|      0|      F2(B, C, D, E, A, m_W[29]);
  133|      0|      F2(A, B, C, D, E, m_W[30]);
  134|      0|      F2(E, A, B, C, D, m_W[31]);
  135|      0|      F2(D, E, A, B, C, m_W[32]);
  136|      0|      F2(C, D, E, A, B, m_W[33]);
  137|      0|      F2(B, C, D, E, A, m_W[34]);
  138|      0|      F2(A, B, C, D, E, m_W[35]);
  139|      0|      F2(E, A, B, C, D, m_W[36]);
  140|      0|      F2(D, E, A, B, C, m_W[37]);
  141|      0|      F2(C, D, E, A, B, m_W[38]);
  142|      0|      F2(B, C, D, E, A, m_W[39]);
  143|       |
  144|      0|      F3(A, B, C, D, E, m_W[40]);
  145|      0|      F3(E, A, B, C, D, m_W[41]);
  146|      0|      F3(D, E, A, B, C, m_W[42]);
  147|      0|      F3(C, D, E, A, B, m_W[43]);
  148|      0|      F3(B, C, D, E, A, m_W[44]);
  149|      0|      F3(A, B, C, D, E, m_W[45]);
  150|      0|      F3(E, A, B, C, D, m_W[46]);
  151|      0|      F3(D, E, A, B, C, m_W[47]);
  152|      0|      F3(C, D, E, A, B, m_W[48]);
  153|      0|      F3(B, C, D, E, A, m_W[49]);
  154|      0|      F3(A, B, C, D, E, m_W[50]);
  155|      0|      F3(E, A, B, C, D, m_W[51]);
  156|      0|      F3(D, E, A, B, C, m_W[52]);
  157|      0|      F3(C, D, E, A, B, m_W[53]);
  158|      0|      F3(B, C, D, E, A, m_W[54]);
  159|      0|      F3(A, B, C, D, E, m_W[55]);
  160|      0|      F3(E, A, B, C, D, m_W[56]);
  161|      0|      F3(D, E, A, B, C, m_W[57]);
  162|      0|      F3(C, D, E, A, B, m_W[58]);
  163|      0|      F3(B, C, D, E, A, m_W[59]);
  164|       |
  165|      0|      F4(A, B, C, D, E, m_W[60]);
  166|      0|      F4(E, A, B, C, D, m_W[61]);
  167|      0|      F4(D, E, A, B, C, m_W[62]);
  168|      0|      F4(C, D, E, A, B, m_W[63]);
  169|      0|      F4(B, C, D, E, A, m_W[64]);
  170|      0|      F4(A, B, C, D, E, m_W[65]);
  171|      0|      F4(E, A, B, C, D, m_W[66]);
  172|      0|      F4(D, E, A, B, C, m_W[67]);
  173|      0|      F4(C, D, E, A, B, m_W[68]);
  174|      0|      F4(B, C, D, E, A, m_W[69]);
  175|      0|      F4(A, B, C, D, E, m_W[70]);
  176|      0|      F4(E, A, B, C, D, m_W[71]);
  177|      0|      F4(D, E, A, B, C, m_W[72]);
  178|      0|      F4(C, D, E, A, B, m_W[73]);
  179|      0|      F4(B, C, D, E, A, m_W[74]);
  180|      0|      F4(A, B, C, D, E, m_W[75]);
  181|      0|      F4(E, A, B, C, D, m_W[76]);
  182|      0|      F4(D, E, A, B, C, m_W[77]);
  183|      0|      F4(C, D, E, A, B, m_W[78]);
  184|      0|      F4(B, C, D, E, A, m_W[79]);
  185|       |
  186|      0|      A = (m_digest[0] += A);
  187|      0|      B = (m_digest[1] += B);
  188|      0|      C = (m_digest[2] += C);
  189|      0|      D = (m_digest[3] += D);
  190|      0|      E = (m_digest[4] += E);
  191|       |
  192|      0|      input += hash_block_size();
  193|      0|   }
  194|      0|}
_ZN5Botan5SHA_18copy_outEPh:
  199|  8.07k|void SHA_1::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); }
_ZN5Botan5SHA_15clearEv:
  204|  16.1k|void SHA_1::clear() {
  205|  16.1k|   MDx_HashFunction::clear();
  206|  16.1k|   zeroise(m_W);
  207|  16.1k|   m_digest[0] = 0x67452301;
  208|  16.1k|   m_digest[1] = 0xEFCDAB89;
  209|  16.1k|   m_digest[2] = 0x98BADCFE;
  210|  16.1k|   m_digest[3] = 0x10325476;
  211|  16.1k|   m_digest[4] = 0xC3D2E1F0;
  212|  16.1k|}

_ZN5Botan5SHA_115sse2_compress_nERNSt3__16vectorIjNS_16secure_allocatorIjEEEEPKhm:
  115|  16.0k|void SHA_1::sse2_compress_n(secure_vector<uint32_t>& digest, const uint8_t input[], size_t blocks) {
  116|  16.0k|   using namespace SHA1_SSE2_F;
  117|       |
  118|  16.0k|   const SIMD_4x32 K00_19 = SIMD_4x32::splat(0x5A827999);
  119|  16.0k|   const SIMD_4x32 K20_39 = SIMD_4x32::splat(0x6ED9EBA1);
  120|  16.0k|   const SIMD_4x32 K40_59 = SIMD_4x32::splat(0x8F1BBCDC);
  121|  16.0k|   const SIMD_4x32 K60_79 = SIMD_4x32::splat(0xCA62C1D6);
  122|       |
  123|  16.0k|   uint32_t A = digest[0], B = digest[1], C = digest[2], D = digest[3], E = digest[4];
  124|       |
  125|  67.2k|   for(size_t i = 0; i != blocks; ++i) {
  ------------------
  |  Branch (125:22): [True: 51.2k, False: 16.0k]
  ------------------
  126|  51.2k|      uint32_t PT[4];
  127|       |
  128|  51.2k|      SIMD_4x32 W0 = SIMD_4x32::load_be(&input[0]);
  129|  51.2k|      SIMD_4x32 W1 = SIMD_4x32::load_be(&input[16]);
  130|  51.2k|      SIMD_4x32 W2 = SIMD_4x32::load_be(&input[32]);
  131|  51.2k|      SIMD_4x32 W3 = SIMD_4x32::load_be(&input[48]);
  132|       |
  133|  51.2k|      SIMD_4x32 P0 = W0 + K00_19;
  134|  51.2k|      SIMD_4x32 P1 = W1 + K00_19;
  135|  51.2k|      SIMD_4x32 P2 = W2 + K00_19;
  136|  51.2k|      SIMD_4x32 P3 = W3 + K00_19;
  137|       |
  138|  51.2k|      SIMD_4x32(P0).store_le(PT);
  139|  51.2k|      F1(A, B, C, D, E, PT[0]);
  140|  51.2k|      F1(E, A, B, C, D, PT[1]);
  141|  51.2k|      F1(D, E, A, B, C, PT[2]);
  142|  51.2k|      F1(C, D, E, A, B, PT[3]);
  143|  51.2k|      P0 = prep(W0, W1, W2, W3, K00_19);
  144|       |
  145|  51.2k|      SIMD_4x32(P1).store_le(PT);
  146|  51.2k|      F1(B, C, D, E, A, PT[0]);
  147|  51.2k|      F1(A, B, C, D, E, PT[1]);
  148|  51.2k|      F1(E, A, B, C, D, PT[2]);
  149|  51.2k|      F1(D, E, A, B, C, PT[3]);
  150|  51.2k|      P1 = prep(W1, W2, W3, W0, K20_39);
  151|       |
  152|  51.2k|      SIMD_4x32(P2).store_le(PT);
  153|  51.2k|      F1(C, D, E, A, B, PT[0]);
  154|  51.2k|      F1(B, C, D, E, A, PT[1]);
  155|  51.2k|      F1(A, B, C, D, E, PT[2]);
  156|  51.2k|      F1(E, A, B, C, D, PT[3]);
  157|  51.2k|      P2 = prep(W2, W3, W0, W1, K20_39);
  158|       |
  159|  51.2k|      SIMD_4x32(P3).store_le(PT);
  160|  51.2k|      F1(D, E, A, B, C, PT[0]);
  161|  51.2k|      F1(C, D, E, A, B, PT[1]);
  162|  51.2k|      F1(B, C, D, E, A, PT[2]);
  163|  51.2k|      F1(A, B, C, D, E, PT[3]);
  164|  51.2k|      P3 = prep(W3, W0, W1, W2, K20_39);
  165|       |
  166|  51.2k|      SIMD_4x32(P0).store_le(PT);
  167|  51.2k|      F1(E, A, B, C, D, PT[0]);
  168|  51.2k|      F1(D, E, A, B, C, PT[1]);
  169|  51.2k|      F1(C, D, E, A, B, PT[2]);
  170|  51.2k|      F1(B, C, D, E, A, PT[3]);
  171|  51.2k|      P0 = prep(W0, W1, W2, W3, K20_39);
  172|       |
  173|  51.2k|      SIMD_4x32(P1).store_le(PT);
  174|  51.2k|      F2(A, B, C, D, E, PT[0]);
  175|  51.2k|      F2(E, A, B, C, D, PT[1]);
  176|  51.2k|      F2(D, E, A, B, C, PT[2]);
  177|  51.2k|      F2(C, D, E, A, B, PT[3]);
  178|  51.2k|      P1 = prep(W1, W2, W3, W0, K20_39);
  179|       |
  180|  51.2k|      SIMD_4x32(P2).store_le(PT);
  181|  51.2k|      F2(B, C, D, E, A, PT[0]);
  182|  51.2k|      F2(A, B, C, D, E, PT[1]);
  183|  51.2k|      F2(E, A, B, C, D, PT[2]);
  184|  51.2k|      F2(D, E, A, B, C, PT[3]);
  185|  51.2k|      P2 = prep(W2, W3, W0, W1, K40_59);
  186|       |
  187|  51.2k|      SIMD_4x32(P3).store_le(PT);
  188|  51.2k|      F2(C, D, E, A, B, PT[0]);
  189|  51.2k|      F2(B, C, D, E, A, PT[1]);
  190|  51.2k|      F2(A, B, C, D, E, PT[2]);
  191|  51.2k|      F2(E, A, B, C, D, PT[3]);
  192|  51.2k|      P3 = prep(W3, W0, W1, W2, K40_59);
  193|       |
  194|  51.2k|      SIMD_4x32(P0).store_le(PT);
  195|  51.2k|      F2(D, E, A, B, C, PT[0]);
  196|  51.2k|      F2(C, D, E, A, B, PT[1]);
  197|  51.2k|      F2(B, C, D, E, A, PT[2]);
  198|  51.2k|      F2(A, B, C, D, E, PT[3]);
  199|  51.2k|      P0 = prep(W0, W1, W2, W3, K40_59);
  200|       |
  201|  51.2k|      SIMD_4x32(P1).store_le(PT);
  202|  51.2k|      F2(E, A, B, C, D, PT[0]);
  203|  51.2k|      F2(D, E, A, B, C, PT[1]);
  204|  51.2k|      F2(C, D, E, A, B, PT[2]);
  205|  51.2k|      F2(B, C, D, E, A, PT[3]);
  206|  51.2k|      P1 = prep(W1, W2, W3, W0, K40_59);
  207|       |
  208|  51.2k|      SIMD_4x32(P2).store_le(PT);
  209|  51.2k|      F3(A, B, C, D, E, PT[0]);
  210|  51.2k|      F3(E, A, B, C, D, PT[1]);
  211|  51.2k|      F3(D, E, A, B, C, PT[2]);
  212|  51.2k|      F3(C, D, E, A, B, PT[3]);
  213|  51.2k|      P2 = prep(W2, W3, W0, W1, K40_59);
  214|       |
  215|  51.2k|      SIMD_4x32(P3).store_le(PT);
  216|  51.2k|      F3(B, C, D, E, A, PT[0]);
  217|  51.2k|      F3(A, B, C, D, E, PT[1]);
  218|  51.2k|      F3(E, A, B, C, D, PT[2]);
  219|  51.2k|      F3(D, E, A, B, C, PT[3]);
  220|  51.2k|      P3 = prep(W3, W0, W1, W2, K60_79);
  221|       |
  222|  51.2k|      SIMD_4x32(P0).store_le(PT);
  223|  51.2k|      F3(C, D, E, A, B, PT[0]);
  224|  51.2k|      F3(B, C, D, E, A, PT[1]);
  225|  51.2k|      F3(A, B, C, D, E, PT[2]);
  226|  51.2k|      F3(E, A, B, C, D, PT[3]);
  227|  51.2k|      P0 = prep(W0, W1, W2, W3, K60_79);
  228|       |
  229|  51.2k|      SIMD_4x32(P1).store_le(PT);
  230|  51.2k|      F3(D, E, A, B, C, PT[0]);
  231|  51.2k|      F3(C, D, E, A, B, PT[1]);
  232|  51.2k|      F3(B, C, D, E, A, PT[2]);
  233|  51.2k|      F3(A, B, C, D, E, PT[3]);
  234|  51.2k|      P1 = prep(W1, W2, W3, W0, K60_79);
  235|       |
  236|  51.2k|      SIMD_4x32(P2).store_le(PT);
  237|  51.2k|      F3(E, A, B, C, D, PT[0]);
  238|  51.2k|      F3(D, E, A, B, C, PT[1]);
  239|  51.2k|      F3(C, D, E, A, B, PT[2]);
  240|  51.2k|      F3(B, C, D, E, A, PT[3]);
  241|  51.2k|      P2 = prep(W2, W3, W0, W1, K60_79);
  242|       |
  243|  51.2k|      SIMD_4x32(P3).store_le(PT);
  244|  51.2k|      F4(A, B, C, D, E, PT[0]);
  245|  51.2k|      F4(E, A, B, C, D, PT[1]);
  246|  51.2k|      F4(D, E, A, B, C, PT[2]);
  247|  51.2k|      F4(C, D, E, A, B, PT[3]);
  248|  51.2k|      P3 = prep(W3, W0, W1, W2, K60_79);
  249|       |
  250|  51.2k|      SIMD_4x32(P0).store_le(PT);
  251|  51.2k|      F4(B, C, D, E, A, PT[0]);
  252|  51.2k|      F4(A, B, C, D, E, PT[1]);
  253|  51.2k|      F4(E, A, B, C, D, PT[2]);
  254|  51.2k|      F4(D, E, A, B, C, PT[3]);
  255|       |
  256|  51.2k|      SIMD_4x32(P1).store_le(PT);
  257|  51.2k|      F4(C, D, E, A, B, PT[0]);
  258|  51.2k|      F4(B, C, D, E, A, PT[1]);
  259|  51.2k|      F4(A, B, C, D, E, PT[2]);
  260|  51.2k|      F4(E, A, B, C, D, PT[3]);
  261|       |
  262|  51.2k|      SIMD_4x32(P2).store_le(PT);
  263|  51.2k|      F4(D, E, A, B, C, PT[0]);
  264|  51.2k|      F4(C, D, E, A, B, PT[1]);
  265|  51.2k|      F4(B, C, D, E, A, PT[2]);
  266|  51.2k|      F4(A, B, C, D, E, PT[3]);
  267|       |
  268|  51.2k|      SIMD_4x32(P3).store_le(PT);
  269|  51.2k|      F4(E, A, B, C, D, PT[0]);
  270|  51.2k|      F4(D, E, A, B, C, PT[1]);
  271|  51.2k|      F4(C, D, E, A, B, PT[2]);
  272|  51.2k|      F4(B, C, D, E, A, PT[3]);
  273|       |
  274|  51.2k|      A = (digest[0] += A);
  275|  51.2k|      B = (digest[1] += B);
  276|  51.2k|      C = (digest[2] += C);
  277|  51.2k|      D = (digest[3] += D);
  278|  51.2k|      E = (digest[4] += E);
  279|       |
  280|  51.2k|      input += 64;
  281|  51.2k|   }
  282|  16.0k|}
sha1_sse2.cpp:_ZN5Botan11SHA1_SSE2_F12_GLOBAL__N_12F1EjRjjjS2_j:
   77|  1.02M|inline void F1(uint32_t A, uint32_t& B, uint32_t C, uint32_t D, uint32_t& E, uint32_t msg) {
   78|  1.02M|   E += choose(B, C, D) + msg + rotl<5>(A);
   79|  1.02M|   B = rotl<30>(B);
   80|  1.02M|}
sha1_sse2.cpp:_ZN5Botan11SHA1_SSE2_F12_GLOBAL__N_14prepERNS_9SIMD_4x32ES2_S2_S2_S2_:
   50|   819k|BOTAN_FORCE_INLINE SIMD_4x32 prep(SIMD_4x32& XW0, SIMD_4x32 XW1, SIMD_4x32 XW2, SIMD_4x32 XW3, SIMD_4x32 K) {
   51|   819k|   SIMD_4x32 T0 = XW0;
   52|       |   /* load W[t-4] 16-byte aligned, and shift */
   53|   819k|   SIMD_4x32 T2 = XW3.shift_elems_right<1>();
   54|       |   /* get high 64-bits of XW0 into low 64-bits */
   55|   819k|   SIMD_4x32 T1 = SIMD_4x32(_mm_shuffle_epi32(XW0.raw(), _MM_SHUFFLE(1, 0, 3, 2)));
   56|       |   /* load high 64-bits of T1 */
   57|   819k|   T1 = SIMD_4x32(_mm_unpacklo_epi64(T1.raw(), XW1.raw()));
   58|       |
   59|   819k|   T0 ^= T1;
   60|   819k|   T2 ^= XW2;
   61|   819k|   T0 ^= T2;
   62|       |   /* unrotated W[t]..W[t+2] in T0 ... still need W[t+3] */
   63|       |
   64|   819k|   T2 = T0.shift_elems_left<3>();
   65|   819k|   T0 = T0.rotl<1>();
   66|   819k|   T2 = T2.rotl<2>();
   67|       |
   68|   819k|   T0 ^= T2; /* T0 now has W[t+3] */
   69|       |
   70|   819k|   XW0 = T0;
   71|   819k|   return T0 + K;
   72|   819k|}
sha1_sse2.cpp:_ZN5Botan11SHA1_SSE2_F12_GLOBAL__N_12F2EjRjjjS2_j:
   85|  1.02M|inline void F2(uint32_t A, uint32_t& B, uint32_t C, uint32_t D, uint32_t& E, uint32_t msg) {
   86|  1.02M|   E += (B ^ C ^ D) + msg + rotl<5>(A);
   87|  1.02M|   B = rotl<30>(B);
   88|  1.02M|}
sha1_sse2.cpp:_ZN5Botan11SHA1_SSE2_F12_GLOBAL__N_12F3EjRjjjS2_j:
   93|  1.02M|inline void F3(uint32_t A, uint32_t& B, uint32_t C, uint32_t D, uint32_t& E, uint32_t msg) {
   94|  1.02M|   E += majority(B, C, D) + msg + rotl<5>(A);
   95|  1.02M|   B = rotl<30>(B);
   96|  1.02M|}
sha1_sse2.cpp:_ZN5Botan11SHA1_SSE2_F12_GLOBAL__N_12F4EjRjjjS2_j:
  101|  1.02M|inline void F4(uint32_t A, uint32_t& B, uint32_t C, uint32_t D, uint32_t& E, uint32_t msg) {
  102|  1.02M|   E += (B ^ C ^ D) + msg + rotl<5>(A);
  103|  1.02M|   B = rotl<30>(B);
  104|  1.02M|}

_ZN5Botan7SHA_25615compress_digestERNSt3__16vectorIjNS_16secure_allocatorIjEEEEPKhm:
   52|  22.4k|void SHA_256::compress_digest(secure_vector<uint32_t>& digest, const uint8_t input[], size_t blocks) {
   53|  22.4k|#if defined(BOTAN_HAS_SHA2_32_X86)
   54|  22.4k|   if(CPUID::has_intel_sha()) {
  ------------------
  |  Branch (54:7): [True: 0, False: 22.4k]
  ------------------
   55|      0|      return SHA_256::compress_digest_x86(digest, input, blocks);
   56|      0|   }
   57|  22.4k|#endif
   58|       |
   59|  22.4k|#if defined(BOTAN_HAS_SHA2_32_X86_BMI2)
   60|  22.4k|   if(CPUID::has_bmi2()) {
  ------------------
  |  Branch (60:7): [True: 22.4k, False: 0]
  ------------------
   61|  22.4k|      return SHA_256::compress_digest_x86_bmi2(digest, input, blocks);
   62|  22.4k|   }
   63|      0|#endif
   64|       |
   65|       |#if defined(BOTAN_HAS_SHA2_32_ARMV8)
   66|       |   if(CPUID::has_arm_sha2()) {
   67|       |      return SHA_256::compress_digest_armv8(digest, input, blocks);
   68|       |   }
   69|       |#endif
   70|       |
   71|      0|   uint32_t A = digest[0], B = digest[1], C = digest[2], D = digest[3], E = digest[4], F = digest[5], G = digest[6],
   72|      0|            H = digest[7];
   73|       |
   74|      0|   for(size_t i = 0; i != blocks; ++i) {
  ------------------
  |  Branch (74:22): [True: 0, False: 0]
  ------------------
   75|      0|      uint32_t W00 = load_be<uint32_t>(input, 0);
   76|      0|      uint32_t W01 = load_be<uint32_t>(input, 1);
   77|      0|      uint32_t W02 = load_be<uint32_t>(input, 2);
   78|      0|      uint32_t W03 = load_be<uint32_t>(input, 3);
   79|      0|      uint32_t W04 = load_be<uint32_t>(input, 4);
   80|      0|      uint32_t W05 = load_be<uint32_t>(input, 5);
   81|      0|      uint32_t W06 = load_be<uint32_t>(input, 6);
   82|      0|      uint32_t W07 = load_be<uint32_t>(input, 7);
   83|      0|      uint32_t W08 = load_be<uint32_t>(input, 8);
   84|      0|      uint32_t W09 = load_be<uint32_t>(input, 9);
   85|      0|      uint32_t W10 = load_be<uint32_t>(input, 10);
   86|      0|      uint32_t W11 = load_be<uint32_t>(input, 11);
   87|      0|      uint32_t W12 = load_be<uint32_t>(input, 12);
   88|      0|      uint32_t W13 = load_be<uint32_t>(input, 13);
   89|      0|      uint32_t W14 = load_be<uint32_t>(input, 14);
   90|      0|      uint32_t W15 = load_be<uint32_t>(input, 15);
   91|       |
   92|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x428A2F98);
   93|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x71374491);
   94|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xB5C0FBCF);
   95|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xE9B5DBA5);
   96|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x3956C25B);
   97|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x59F111F1);
   98|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x923F82A4);
   99|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0xAB1C5ED5);
  100|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xD807AA98);
  101|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x12835B01);
  102|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x243185BE);
  103|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x550C7DC3);
  104|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x72BE5D74);
  105|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0x80DEB1FE);
  106|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x9BDC06A7);
  107|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC19BF174);
  108|       |
  109|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0xE49B69C1);
  110|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0xEFBE4786);
  111|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x0FC19DC6);
  112|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x240CA1CC);
  113|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x2DE92C6F);
  114|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4A7484AA);
  115|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5CB0A9DC);
  116|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x76F988DA);
  117|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x983E5152);
  118|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA831C66D);
  119|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xB00327C8);
  120|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xBF597FC7);
  121|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xC6E00BF3);
  122|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD5A79147);
  123|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x06CA6351);
  124|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x14292967);
  125|       |
  126|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x27B70A85);
  127|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x2E1B2138);
  128|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x4D2C6DFC);
  129|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x53380D13);
  130|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x650A7354);
  131|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x766A0ABB);
  132|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x81C2C92E);
  133|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x92722C85);
  134|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xA2BFE8A1);
  135|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA81A664B);
  136|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xC24B8B70);
  137|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xC76C51A3);
  138|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xD192E819);
  139|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD6990624);
  140|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xF40E3585);
  141|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x106AA070);
  142|       |
  143|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x19A4C116);
  144|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x1E376C08);
  145|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x2748774C);
  146|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x34B0BCB5);
  147|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x391C0CB3);
  148|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4ED8AA4A);
  149|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5B9CCA4F);
  150|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x682E6FF3);
  151|      0|      SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x748F82EE);
  152|      0|      SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x78A5636F);
  153|      0|      SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x84C87814);
  154|      0|      SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x8CC70208);
  155|      0|      SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x90BEFFFA);
  156|      0|      SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xA4506CEB);
  157|      0|      SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xBEF9A3F7);
  158|      0|      SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC67178F2);
  159|       |
  160|      0|      A = (digest[0] += A);
  161|      0|      B = (digest[1] += B);
  162|      0|      C = (digest[2] += C);
  163|      0|      D = (digest[3] += D);
  164|      0|      E = (digest[4] += E);
  165|      0|      F = (digest[5] += F);
  166|      0|      G = (digest[6] += G);
  167|      0|      H = (digest[7] += H);
  168|       |
  169|      0|      input += 64;
  170|      0|   }
  171|      0|}
_ZN5Botan7SHA_22410compress_nEPKhm:
  180|      6|void SHA_224::compress_n(const uint8_t input[], size_t blocks) { SHA_256::compress_digest(m_digest, input, blocks); }
_ZN5Botan7SHA_2248copy_outEPh:
  185|      3|void SHA_224::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); }
_ZN5Botan7SHA_2245clearEv:
  190|      6|void SHA_224::clear() {
  191|      6|   MDx_HashFunction::clear();
  192|      6|   m_digest[0] = 0xC1059ED8;
  193|      6|   m_digest[1] = 0x367CD507;
  194|      6|   m_digest[2] = 0x3070DD17;
  195|      6|   m_digest[3] = 0xF70E5939;
  196|      6|   m_digest[4] = 0xFFC00B31;
  197|      6|   m_digest[5] = 0x68581511;
  198|      6|   m_digest[6] = 0x64F98FA7;
  199|      6|   m_digest[7] = 0xBEFA4FA4;
  200|      6|}
_ZN5Botan7SHA_25610compress_nEPKhm:
  205|  22.4k|void SHA_256::compress_n(const uint8_t input[], size_t blocks) { SHA_256::compress_digest(m_digest, input, blocks); }
_ZN5Botan7SHA_2568copy_outEPh:
  210|  13.2k|void SHA_256::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); }
_ZN5Botan7SHA_2565clearEv:
  215|  22.5k|void SHA_256::clear() {
  216|  22.5k|   MDx_HashFunction::clear();
  217|  22.5k|   m_digest[0] = 0x6A09E667;
  218|  22.5k|   m_digest[1] = 0xBB67AE85;
  219|  22.5k|   m_digest[2] = 0x3C6EF372;
  220|  22.5k|   m_digest[3] = 0xA54FF53A;
  221|  22.5k|   m_digest[4] = 0x510E527F;
  222|  22.5k|   m_digest[5] = 0x9B05688C;
  223|  22.5k|   m_digest[6] = 0x1F83D9AB;
  224|  22.5k|   m_digest[7] = 0x5BE0CD19;
  225|  22.5k|}

_ZN5Botan7SHA_25624compress_digest_x86_bmi2ERNSt3__16vectorIjNS_16secure_allocatorIjEEEEPKhm:
   23|  22.4k|void SHA_256::compress_digest_x86_bmi2(secure_vector<uint32_t>& digest, const uint8_t input[], size_t blocks) {
   24|  22.4k|   uint32_t A = digest[0], B = digest[1], C = digest[2], D = digest[3], E = digest[4], F = digest[5], G = digest[6],
   25|  22.4k|            H = digest[7];
   26|       |
   27|  89.4k|   for(size_t i = 0; i != blocks; ++i) {
  ------------------
  |  Branch (27:22): [True: 67.0k, False: 22.4k]
  ------------------
   28|  67.0k|      uint32_t W00 = load_be<uint32_t>(input, 0);
   29|  67.0k|      uint32_t W01 = load_be<uint32_t>(input, 1);
   30|  67.0k|      uint32_t W02 = load_be<uint32_t>(input, 2);
   31|  67.0k|      uint32_t W03 = load_be<uint32_t>(input, 3);
   32|  67.0k|      uint32_t W04 = load_be<uint32_t>(input, 4);
   33|  67.0k|      uint32_t W05 = load_be<uint32_t>(input, 5);
   34|  67.0k|      uint32_t W06 = load_be<uint32_t>(input, 6);
   35|  67.0k|      uint32_t W07 = load_be<uint32_t>(input, 7);
   36|  67.0k|      uint32_t W08 = load_be<uint32_t>(input, 8);
   37|  67.0k|      uint32_t W09 = load_be<uint32_t>(input, 9);
   38|  67.0k|      uint32_t W10 = load_be<uint32_t>(input, 10);
   39|  67.0k|      uint32_t W11 = load_be<uint32_t>(input, 11);
   40|  67.0k|      uint32_t W12 = load_be<uint32_t>(input, 12);
   41|  67.0k|      uint32_t W13 = load_be<uint32_t>(input, 13);
   42|  67.0k|      uint32_t W14 = load_be<uint32_t>(input, 14);
   43|  67.0k|      uint32_t W15 = load_be<uint32_t>(input, 15);
   44|       |
   45|  67.0k|      SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x428A2F98);
   46|  67.0k|      SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x71374491);
   47|  67.0k|      SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xB5C0FBCF);
   48|  67.0k|      SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xE9B5DBA5);
   49|  67.0k|      SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x3956C25B);
   50|  67.0k|      SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x59F111F1);
   51|  67.0k|      SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x923F82A4);
   52|  67.0k|      SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0xAB1C5ED5);
   53|  67.0k|      SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xD807AA98);
   54|  67.0k|      SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x12835B01);
   55|  67.0k|      SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x243185BE);
   56|  67.0k|      SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x550C7DC3);
   57|  67.0k|      SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x72BE5D74);
   58|  67.0k|      SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0x80DEB1FE);
   59|  67.0k|      SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x9BDC06A7);
   60|  67.0k|      SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC19BF174);
   61|       |
   62|  67.0k|      SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0xE49B69C1);
   63|  67.0k|      SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0xEFBE4786);
   64|  67.0k|      SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x0FC19DC6);
   65|  67.0k|      SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x240CA1CC);
   66|  67.0k|      SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x2DE92C6F);
   67|  67.0k|      SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4A7484AA);
   68|  67.0k|      SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5CB0A9DC);
   69|  67.0k|      SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x76F988DA);
   70|  67.0k|      SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x983E5152);
   71|  67.0k|      SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA831C66D);
   72|  67.0k|      SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xB00327C8);
   73|  67.0k|      SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xBF597FC7);
   74|  67.0k|      SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xC6E00BF3);
   75|  67.0k|      SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD5A79147);
   76|  67.0k|      SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x06CA6351);
   77|  67.0k|      SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x14292967);
   78|       |
   79|  67.0k|      SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x27B70A85);
   80|  67.0k|      SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x2E1B2138);
   81|  67.0k|      SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x4D2C6DFC);
   82|  67.0k|      SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x53380D13);
   83|  67.0k|      SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x650A7354);
   84|  67.0k|      SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x766A0ABB);
   85|  67.0k|      SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x81C2C92E);
   86|  67.0k|      SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x92722C85);
   87|  67.0k|      SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xA2BFE8A1);
   88|  67.0k|      SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA81A664B);
   89|  67.0k|      SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xC24B8B70);
   90|  67.0k|      SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xC76C51A3);
   91|  67.0k|      SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xD192E819);
   92|  67.0k|      SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD6990624);
   93|  67.0k|      SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xF40E3585);
   94|  67.0k|      SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x106AA070);
   95|       |
   96|  67.0k|      SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x19A4C116);
   97|  67.0k|      SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x1E376C08);
   98|  67.0k|      SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x2748774C);
   99|  67.0k|      SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x34B0BCB5);
  100|  67.0k|      SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x391C0CB3);
  101|  67.0k|      SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4ED8AA4A);
  102|  67.0k|      SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5B9CCA4F);
  103|  67.0k|      SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x682E6FF3);
  104|  67.0k|      SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x748F82EE);
  105|  67.0k|      SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x78A5636F);
  106|  67.0k|      SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x84C87814);
  107|  67.0k|      SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x8CC70208);
  108|  67.0k|      SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x90BEFFFA);
  109|  67.0k|      SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xA4506CEB);
  110|  67.0k|      SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xBEF9A3F7);
  111|  67.0k|      SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC67178F2);
  112|       |
  113|  67.0k|      A = (digest[0] += A);
  114|  67.0k|      B = (digest[1] += B);
  115|  67.0k|      C = (digest[2] += C);
  116|  67.0k|      D = (digest[3] += D);
  117|  67.0k|      E = (digest[4] += E);
  118|  67.0k|      F = (digest[5] += F);
  119|  67.0k|      G = (digest[6] += G);
  120|  67.0k|      H = (digest[7] += H);
  121|       |
  122|  67.0k|      input += 64;
  123|  67.0k|   }
  124|  22.4k|}

_ZN5Botan7SHA_51215compress_digestERNSt3__16vectorImNS_16secure_allocatorImEEEEPKhm:
   42|    402|void SHA_512::compress_digest(secure_vector<uint64_t>& digest, const uint8_t input[], size_t blocks) {
   43|    402|#if defined(BOTAN_HAS_SHA2_64_BMI2)
   44|    402|   if(CPUID::has_bmi2()) {
  ------------------
  |  Branch (44:7): [True: 402, False: 0]
  ------------------
   45|    402|      return compress_digest_bmi2(digest, input, blocks);
   46|    402|   }
   47|      0|#endif
   48|       |
   49|      0|   uint64_t A = digest[0], B = digest[1], C = digest[2], D = digest[3], E = digest[4], F = digest[5], G = digest[6],
   50|      0|            H = digest[7];
   51|       |
   52|      0|   for(size_t i = 0; i != blocks; ++i) {
  ------------------
  |  Branch (52:22): [True: 0, False: 0]
  ------------------
   53|      0|      uint64_t W00 = load_be<uint64_t>(input, 0);
   54|      0|      uint64_t W01 = load_be<uint64_t>(input, 1);
   55|      0|      uint64_t W02 = load_be<uint64_t>(input, 2);
   56|      0|      uint64_t W03 = load_be<uint64_t>(input, 3);
   57|      0|      uint64_t W04 = load_be<uint64_t>(input, 4);
   58|      0|      uint64_t W05 = load_be<uint64_t>(input, 5);
   59|      0|      uint64_t W06 = load_be<uint64_t>(input, 6);
   60|      0|      uint64_t W07 = load_be<uint64_t>(input, 7);
   61|      0|      uint64_t W08 = load_be<uint64_t>(input, 8);
   62|      0|      uint64_t W09 = load_be<uint64_t>(input, 9);
   63|      0|      uint64_t W10 = load_be<uint64_t>(input, 10);
   64|      0|      uint64_t W11 = load_be<uint64_t>(input, 11);
   65|      0|      uint64_t W12 = load_be<uint64_t>(input, 12);
   66|      0|      uint64_t W13 = load_be<uint64_t>(input, 13);
   67|      0|      uint64_t W14 = load_be<uint64_t>(input, 14);
   68|      0|      uint64_t W15 = load_be<uint64_t>(input, 15);
   69|       |
   70|      0|      SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x428A2F98D728AE22);
   71|      0|      SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x7137449123EF65CD);
   72|      0|      SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xB5C0FBCFEC4D3B2F);
   73|      0|      SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xE9B5DBA58189DBBC);
   74|      0|      SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x3956C25BF348B538);
   75|      0|      SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x59F111F1B605D019);
   76|      0|      SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x923F82A4AF194F9B);
   77|      0|      SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0xAB1C5ED5DA6D8118);
   78|      0|      SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xD807AA98A3030242);
   79|      0|      SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x12835B0145706FBE);
   80|      0|      SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x243185BE4EE4B28C);
   81|      0|      SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x550C7DC3D5FFB4E2);
   82|      0|      SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x72BE5D74F27B896F);
   83|      0|      SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0x80DEB1FE3B1696B1);
   84|      0|      SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x9BDC06A725C71235);
   85|      0|      SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC19BF174CF692694);
   86|      0|      SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0xE49B69C19EF14AD2);
   87|      0|      SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0xEFBE4786384F25E3);
   88|      0|      SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x0FC19DC68B8CD5B5);
   89|      0|      SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x240CA1CC77AC9C65);
   90|      0|      SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x2DE92C6F592B0275);
   91|      0|      SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4A7484AA6EA6E483);
   92|      0|      SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5CB0A9DCBD41FBD4);
   93|      0|      SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x76F988DA831153B5);
   94|      0|      SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x983E5152EE66DFAB);
   95|      0|      SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA831C66D2DB43210);
   96|      0|      SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xB00327C898FB213F);
   97|      0|      SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xBF597FC7BEEF0EE4);
   98|      0|      SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xC6E00BF33DA88FC2);
   99|      0|      SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD5A79147930AA725);
  100|      0|      SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x06CA6351E003826F);
  101|      0|      SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x142929670A0E6E70);
  102|      0|      SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x27B70A8546D22FFC);
  103|      0|      SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x2E1B21385C26C926);
  104|      0|      SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x4D2C6DFC5AC42AED);
  105|      0|      SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x53380D139D95B3DF);
  106|      0|      SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x650A73548BAF63DE);
  107|      0|      SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x766A0ABB3C77B2A8);
  108|      0|      SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x81C2C92E47EDAEE6);
  109|      0|      SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x92722C851482353B);
  110|      0|      SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xA2BFE8A14CF10364);
  111|      0|      SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA81A664BBC423001);
  112|      0|      SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xC24B8B70D0F89791);
  113|      0|      SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xC76C51A30654BE30);
  114|      0|      SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xD192E819D6EF5218);
  115|      0|      SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD69906245565A910);
  116|      0|      SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xF40E35855771202A);
  117|      0|      SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x106AA07032BBD1B8);
  118|      0|      SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x19A4C116B8D2D0C8);
  119|      0|      SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x1E376C085141AB53);
  120|      0|      SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x2748774CDF8EEB99);
  121|      0|      SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x34B0BCB5E19B48A8);
  122|      0|      SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x391C0CB3C5C95A63);
  123|      0|      SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4ED8AA4AE3418ACB);
  124|      0|      SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5B9CCA4F7763E373);
  125|      0|      SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x682E6FF3D6B2B8A3);
  126|      0|      SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x748F82EE5DEFB2FC);
  127|      0|      SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x78A5636F43172F60);
  128|      0|      SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x84C87814A1F0AB72);
  129|      0|      SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x8CC702081A6439EC);
  130|      0|      SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x90BEFFFA23631E28);
  131|      0|      SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xA4506CEBDE82BDE9);
  132|      0|      SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xBEF9A3F7B2C67915);
  133|      0|      SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC67178F2E372532B);
  134|      0|      SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0xCA273ECEEA26619C);
  135|      0|      SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0xD186B8C721C0C207);
  136|      0|      SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xEADA7DD6CDE0EB1E);
  137|      0|      SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xF57D4F7FEE6ED178);
  138|      0|      SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x06F067AA72176FBA);
  139|      0|      SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x0A637DC5A2C898A6);
  140|      0|      SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x113F9804BEF90DAE);
  141|      0|      SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x1B710B35131C471B);
  142|      0|      SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x28DB77F523047D84);
  143|      0|      SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x32CAAB7B40C72493);
  144|      0|      SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x3C9EBE0A15C9BEBC);
  145|      0|      SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x431D67C49C100D4C);
  146|      0|      SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x4CC5D4BECB3E42B6);
  147|      0|      SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0x597F299CFC657E2A);
  148|      0|      SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x5FCB6FAB3AD6FAEC);
  149|      0|      SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x6C44198C4A475817);
  150|       |
  151|      0|      A = (digest[0] += A);
  152|      0|      B = (digest[1] += B);
  153|      0|      C = (digest[2] += C);
  154|      0|      D = (digest[3] += D);
  155|      0|      E = (digest[4] += E);
  156|      0|      F = (digest[5] += F);
  157|      0|      G = (digest[6] += G);
  158|      0|      H = (digest[7] += H);
  159|       |
  160|      0|      input += 128;
  161|      0|   }
  162|      0|}
_ZN5Botan11SHA_512_25610compress_nEPKhm:
  172|    360|void SHA_512_256::compress_n(const uint8_t input[], size_t blocks) {
  173|    360|   SHA_512::compress_digest(m_digest, input, blocks);
  174|    360|}
_ZN5Botan7SHA_38410compress_nEPKhm:
  176|     36|void SHA_384::compress_n(const uint8_t input[], size_t blocks) { SHA_512::compress_digest(m_digest, input, blocks); }
_ZN5Botan7SHA_51210compress_nEPKhm:
  178|      6|void SHA_512::compress_n(const uint8_t input[], size_t blocks) { SHA_512::compress_digest(m_digest, input, blocks); }
_ZN5Botan11SHA_512_2568copy_outEPh:
  180|    180|void SHA_512_256::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); }
_ZN5Botan7SHA_3848copy_outEPh:
  182|     18|void SHA_384::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); }
_ZN5Botan7SHA_5128copy_outEPh:
  184|      3|void SHA_512::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); }
_ZN5Botan11SHA_512_2565clearEv:
  186|    360|void SHA_512_256::clear() {
  187|    360|   MDx_HashFunction::clear();
  188|    360|   m_digest[0] = 0x22312194FC2BF72C;
  189|    360|   m_digest[1] = 0x9F555FA3C84C64C2;
  190|    360|   m_digest[2] = 0x2393B86B6F53B151;
  191|    360|   m_digest[3] = 0x963877195940EABD;
  192|    360|   m_digest[4] = 0x96283EE2A88EFFE3;
  193|    360|   m_digest[5] = 0xBE5E1E2553863992;
  194|    360|   m_digest[6] = 0x2B0199FC2C85B8AA;
  195|    360|   m_digest[7] = 0x0EB72DDC81C52CA2;
  196|    360|}
_ZN5Botan7SHA_3845clearEv:
  198|     36|void SHA_384::clear() {
  199|     36|   MDx_HashFunction::clear();
  200|     36|   m_digest[0] = 0xCBBB9D5DC1059ED8;
  201|     36|   m_digest[1] = 0x629A292A367CD507;
  202|     36|   m_digest[2] = 0x9159015A3070DD17;
  203|     36|   m_digest[3] = 0x152FECD8F70E5939;
  204|     36|   m_digest[4] = 0x67332667FFC00B31;
  205|     36|   m_digest[5] = 0x8EB44A8768581511;
  206|     36|   m_digest[6] = 0xDB0C2E0D64F98FA7;
  207|     36|   m_digest[7] = 0x47B5481DBEFA4FA4;
  208|     36|}
_ZN5Botan7SHA_5125clearEv:
  210|      6|void SHA_512::clear() {
  211|      6|   MDx_HashFunction::clear();
  212|      6|   m_digest[0] = 0x6A09E667F3BCC908;
  213|      6|   m_digest[1] = 0xBB67AE8584CAA73B;
  214|      6|   m_digest[2] = 0x3C6EF372FE94F82B;
  215|      6|   m_digest[3] = 0xA54FF53A5F1D36F1;
  216|      6|   m_digest[4] = 0x510E527FADE682D1;
  217|      6|   m_digest[5] = 0x9B05688C2B3E6C1F;
  218|      6|   m_digest[6] = 0x1F83D9ABFB41BD6B;
  219|      6|   m_digest[7] = 0x5BE0CD19137E2179;
  220|      6|}

_ZN5Botan7SHA_51220compress_digest_bmi2ERNSt3__16vectorImNS_16secure_allocatorImEEEEPKhm:
   16|    402|void SHA_512::compress_digest_bmi2(secure_vector<uint64_t>& digest, const uint8_t input[], size_t blocks) {
   17|    402|   uint64_t A = digest[0], B = digest[1], C = digest[2], D = digest[3], E = digest[4], F = digest[5], G = digest[6],
   18|    402|            H = digest[7];
   19|       |
   20|    898|   for(size_t i = 0; i != blocks; ++i) {
  ------------------
  |  Branch (20:22): [True: 496, False: 402]
  ------------------
   21|    496|      uint64_t W00 = load_be<uint64_t>(input, 0);
   22|    496|      uint64_t W01 = load_be<uint64_t>(input, 1);
   23|    496|      uint64_t W02 = load_be<uint64_t>(input, 2);
   24|    496|      uint64_t W03 = load_be<uint64_t>(input, 3);
   25|    496|      uint64_t W04 = load_be<uint64_t>(input, 4);
   26|    496|      uint64_t W05 = load_be<uint64_t>(input, 5);
   27|    496|      uint64_t W06 = load_be<uint64_t>(input, 6);
   28|    496|      uint64_t W07 = load_be<uint64_t>(input, 7);
   29|    496|      uint64_t W08 = load_be<uint64_t>(input, 8);
   30|    496|      uint64_t W09 = load_be<uint64_t>(input, 9);
   31|    496|      uint64_t W10 = load_be<uint64_t>(input, 10);
   32|    496|      uint64_t W11 = load_be<uint64_t>(input, 11);
   33|    496|      uint64_t W12 = load_be<uint64_t>(input, 12);
   34|    496|      uint64_t W13 = load_be<uint64_t>(input, 13);
   35|    496|      uint64_t W14 = load_be<uint64_t>(input, 14);
   36|    496|      uint64_t W15 = load_be<uint64_t>(input, 15);
   37|       |
   38|    496|      SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x428A2F98D728AE22);
   39|    496|      SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x7137449123EF65CD);
   40|    496|      SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xB5C0FBCFEC4D3B2F);
   41|    496|      SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xE9B5DBA58189DBBC);
   42|    496|      SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x3956C25BF348B538);
   43|    496|      SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x59F111F1B605D019);
   44|    496|      SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x923F82A4AF194F9B);
   45|    496|      SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0xAB1C5ED5DA6D8118);
   46|    496|      SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xD807AA98A3030242);
   47|    496|      SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x12835B0145706FBE);
   48|    496|      SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x243185BE4EE4B28C);
   49|    496|      SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x550C7DC3D5FFB4E2);
   50|    496|      SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x72BE5D74F27B896F);
   51|    496|      SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0x80DEB1FE3B1696B1);
   52|    496|      SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x9BDC06A725C71235);
   53|    496|      SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC19BF174CF692694);
   54|    496|      SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0xE49B69C19EF14AD2);
   55|    496|      SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0xEFBE4786384F25E3);
   56|    496|      SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x0FC19DC68B8CD5B5);
   57|    496|      SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x240CA1CC77AC9C65);
   58|    496|      SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x2DE92C6F592B0275);
   59|    496|      SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4A7484AA6EA6E483);
   60|    496|      SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5CB0A9DCBD41FBD4);
   61|    496|      SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x76F988DA831153B5);
   62|    496|      SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x983E5152EE66DFAB);
   63|    496|      SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA831C66D2DB43210);
   64|    496|      SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xB00327C898FB213F);
   65|    496|      SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xBF597FC7BEEF0EE4);
   66|    496|      SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xC6E00BF33DA88FC2);
   67|    496|      SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD5A79147930AA725);
   68|    496|      SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x06CA6351E003826F);
   69|    496|      SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x142929670A0E6E70);
   70|    496|      SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x27B70A8546D22FFC);
   71|    496|      SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x2E1B21385C26C926);
   72|    496|      SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x4D2C6DFC5AC42AED);
   73|    496|      SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x53380D139D95B3DF);
   74|    496|      SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x650A73548BAF63DE);
   75|    496|      SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x766A0ABB3C77B2A8);
   76|    496|      SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x81C2C92E47EDAEE6);
   77|    496|      SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x92722C851482353B);
   78|    496|      SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xA2BFE8A14CF10364);
   79|    496|      SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA81A664BBC423001);
   80|    496|      SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xC24B8B70D0F89791);
   81|    496|      SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xC76C51A30654BE30);
   82|    496|      SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xD192E819D6EF5218);
   83|    496|      SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD69906245565A910);
   84|    496|      SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xF40E35855771202A);
   85|    496|      SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x106AA07032BBD1B8);
   86|    496|      SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x19A4C116B8D2D0C8);
   87|    496|      SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x1E376C085141AB53);
   88|    496|      SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x2748774CDF8EEB99);
   89|    496|      SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x34B0BCB5E19B48A8);
   90|    496|      SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x391C0CB3C5C95A63);
   91|    496|      SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4ED8AA4AE3418ACB);
   92|    496|      SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5B9CCA4F7763E373);
   93|    496|      SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x682E6FF3D6B2B8A3);
   94|    496|      SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x748F82EE5DEFB2FC);
   95|    496|      SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x78A5636F43172F60);
   96|    496|      SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x84C87814A1F0AB72);
   97|    496|      SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x8CC702081A6439EC);
   98|    496|      SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x90BEFFFA23631E28);
   99|    496|      SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xA4506CEBDE82BDE9);
  100|    496|      SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xBEF9A3F7B2C67915);
  101|    496|      SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC67178F2E372532B);
  102|    496|      SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0xCA273ECEEA26619C);
  103|    496|      SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0xD186B8C721C0C207);
  104|    496|      SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xEADA7DD6CDE0EB1E);
  105|    496|      SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xF57D4F7FEE6ED178);
  106|    496|      SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x06F067AA72176FBA);
  107|    496|      SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x0A637DC5A2C898A6);
  108|    496|      SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x113F9804BEF90DAE);
  109|    496|      SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x1B710B35131C471B);
  110|    496|      SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x28DB77F523047D84);
  111|    496|      SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x32CAAB7B40C72493);
  112|    496|      SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x3C9EBE0A15C9BEBC);
  113|    496|      SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x431D67C49C100D4C);
  114|    496|      SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x4CC5D4BECB3E42B6);
  115|    496|      SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0x597F299CFC657E2A);
  116|    496|      SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x5FCB6FAB3AD6FAEC);
  117|    496|      SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x6C44198C4A475817);
  118|       |
  119|    496|      A = (digest[0] += A);
  120|    496|      B = (digest[1] += B);
  121|    496|      C = (digest[2] += C);
  122|    496|      D = (digest[3] += D);
  123|    496|      E = (digest[4] += E);
  124|    496|      F = (digest[5] += F);
  125|    496|      G = (digest[6] += G);
  126|    496|      H = (digest[7] += H);
  127|       |
  128|    496|      input += 128;
  129|    496|   }
  130|    402|}

_ZN5Botan6BigInt11encode_1363ERKS0_m:
  105|  1.13k|secure_vector<uint8_t> BigInt::encode_1363(const BigInt& n, size_t bytes) {
  106|  1.13k|   if(n.bytes() > bytes) {
  ------------------
  |  Branch (106:7): [True: 47, False: 1.08k]
  ------------------
  107|     47|      throw Encoding_Error("encode_1363: n is too large to encode properly");
  108|     47|   }
  109|       |
  110|  1.08k|   secure_vector<uint8_t> output(bytes);
  111|  1.08k|   n.binary_encode(output.data(), output.size());
  112|  1.08k|   return output;
  113|  1.13k|}
_ZN5Botan6BigInt6decodeEPKhmNS0_4BaseE:
  143|     47|BigInt BigInt::decode(const uint8_t buf[], size_t length, Base base) {
  144|     47|   BigInt r;
  145|     47|   if(base == Binary) {
  ------------------
  |  Branch (145:7): [True: 0, False: 47]
  ------------------
  146|      0|      r.binary_decode(buf, length);
  147|     47|   } else if(base == Hexadecimal) {
  ------------------
  |  Branch (147:14): [True: 47, False: 0]
  ------------------
  148|     47|      secure_vector<uint8_t> binary;
  149|       |
  150|     47|      if(length % 2) {
  ------------------
  |  Branch (150:10): [True: 3, False: 44]
  ------------------
  151|       |         // Handle lack of leading 0
  152|      3|         const char buf0_with_leading_0[2] = {'0', static_cast<char>(buf[0])};
  153|       |
  154|      3|         binary = hex_decode_locked(buf0_with_leading_0, 2);
  155|       |
  156|      3|         binary += hex_decode_locked(cast_uint8_ptr_to_char(&buf[1]), length - 1, false);
  157|     44|      } else {
  158|     44|         binary = hex_decode_locked(cast_uint8_ptr_to_char(buf), length, false);
  159|     44|      }
  160|       |
  161|     47|      r.binary_decode(binary.data(), binary.size());
  162|     47|   } else if(base == Decimal) {
  ------------------
  |  Branch (162:14): [True: 0, False: 0]
  ------------------
  163|       |      // This could be made faster using the same trick as to_dec_string
  164|      0|      for(size_t i = 0; i != length; ++i) {
  ------------------
  |  Branch (164:25): [True: 0, False: 0]
  ------------------
  165|      0|         const char c = buf[i];
  166|       |
  167|      0|         if(c < '0' || c > '9') {
  ------------------
  |  Branch (167:13): [True: 0, False: 0]
  |  Branch (167:24): [True: 0, False: 0]
  ------------------
  168|      0|            throw Invalid_Argument("BigInt::decode: invalid decimal char");
  169|      0|         }
  170|       |
  171|      0|         const uint8_t x = c - '0';
  172|      0|         BOTAN_ASSERT_NOMSG(x < 10);
  ------------------
  |  |   60|      0|   do {                                                                     \
  |  |   61|      0|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 0]
  |  |  ------------------
  |  |   62|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|      0|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  173|       |
  174|      0|         r *= 10;
  175|      0|         r += x;
  176|      0|      }
  177|      0|   } else {
  178|      0|      throw Invalid_Argument("Unknown BigInt decoding method");
  179|      0|   }
  180|     47|   return r;
  181|     47|}

_ZN5Botan6BigInt3addEPKmmNS0_4SignE:
   16|   158k|BigInt& BigInt::add(const word y[], size_t y_words, Sign y_sign) {
   17|   158k|   const size_t x_sw = sig_words();
   18|       |
   19|   158k|   grow_to(std::max(x_sw, y_words) + 1);
   20|       |
   21|   158k|   if(sign() == y_sign) {
  ------------------
  |  Branch (21:7): [True: 84.6k, False: 74.2k]
  ------------------
   22|  84.6k|      bigint_add2(mutable_data(), size() - 1, y, y_words);
   23|  84.6k|   } else {
   24|  74.2k|      const int32_t relative_size = bigint_cmp(data(), x_sw, y, y_words);
   25|       |
   26|  74.2k|      if(relative_size >= 0) {
  ------------------
  |  Branch (26:10): [True: 74.1k, False: 109]
  ------------------
   27|       |         // *this >= y
   28|  74.1k|         bigint_sub2(mutable_data(), x_sw, y, y_words);
   29|  74.1k|      } else {
   30|       |         // *this < y
   31|    109|         bigint_sub2_rev(mutable_data(), y, y_words);
   32|    109|      }
   33|       |
   34|       |      //this->sign_fixup(relative_size, y_sign);
   35|  74.2k|      if(relative_size < 0) {
  ------------------
  |  Branch (35:10): [True: 109, False: 74.1k]
  ------------------
   36|    109|         set_sign(y_sign);
   37|  74.1k|      } else if(relative_size == 0) {
  ------------------
  |  Branch (37:17): [True: 0, False: 74.1k]
  ------------------
   38|      0|         set_sign(Positive);
   39|      0|      }
   40|  74.2k|   }
   41|       |
   42|   158k|   return (*this);
   43|   158k|}
_ZN5Botan6BigInt7mod_addERKS0_S2_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
   45|  80.8k|BigInt& BigInt::mod_add(const BigInt& s, const BigInt& mod, secure_vector<word>& ws) {
   46|  80.8k|   if(this->is_negative() || s.is_negative() || mod.is_negative()) {
  ------------------
  |  Branch (46:7): [True: 0, False: 80.8k]
  |  Branch (46:30): [True: 0, False: 80.8k]
  |  Branch (46:49): [True: 0, False: 80.8k]
  ------------------
   47|      0|      throw Invalid_Argument("BigInt::mod_add expects all arguments are positive");
   48|      0|   }
   49|       |
   50|  80.8k|   BOTAN_DEBUG_ASSERT(*this < mod);
  ------------------
  |  |   99|  80.8k|      do {                          \
  |  |  100|  80.8k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
   51|  80.8k|   BOTAN_DEBUG_ASSERT(s < mod);
  ------------------
  |  |   99|  80.8k|      do {                          \
  |  |  100|  80.8k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
   52|       |
   53|       |   /*
   54|       |   t + s or t + s - p == t - (p - s)
   55|       |
   56|       |   So first compute ws = p - s
   57|       |
   58|       |   Then compute t + s and t - ws
   59|       |
   60|       |   If t - ws does not borrow, then that is the correct valued
   61|       |   */
   62|       |
   63|  80.8k|   const size_t mod_sw = mod.sig_words();
   64|  80.8k|   BOTAN_ARG_CHECK(mod_sw > 0, "BigInt::mod_add modulus must be positive");
  ------------------
  |  |   30|  80.8k|   do {                                                          \
  |  |   31|  80.8k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 0, False: 80.8k]
  |  |  ------------------
  |  |   32|  80.8k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  80.8k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   65|       |
   66|  80.8k|   this->grow_to(mod_sw);
   67|  80.8k|   s.grow_to(mod_sw);
   68|       |
   69|       |   // First mod_sw for p - s, 2*mod_sw for bigint_addsub workspace
   70|  80.8k|   if(ws.size() < 3 * mod_sw) {
  ------------------
  |  Branch (70:7): [True: 60.9k, False: 19.9k]
  ------------------
   71|  60.9k|      ws.resize(3 * mod_sw);
   72|  60.9k|   }
   73|       |
   74|  80.8k|   word borrow = bigint_sub3(&ws[0], mod.data(), mod_sw, s.data(), mod_sw);
   75|  80.8k|   BOTAN_DEBUG_ASSERT(borrow == 0);
  ------------------
  |  |   99|  80.8k|      do {                          \
  |  |  100|  80.8k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
   76|  80.8k|   BOTAN_UNUSED(borrow);
  ------------------
  |  |  118|  80.8k|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
   77|       |
   78|       |   // Compute t - ws
   79|  80.8k|   borrow = bigint_sub3(&ws[mod_sw], this->data(), mod_sw, &ws[0], mod_sw);
   80|       |
   81|       |   // Compute t + s
   82|  80.8k|   bigint_add3_nc(&ws[mod_sw * 2], this->data(), mod_sw, s.data(), mod_sw);
   83|       |
   84|  80.8k|   CT::conditional_copy_mem(borrow, &ws[0], &ws[mod_sw * 2], &ws[mod_sw], mod_sw);
   85|  80.8k|   set_words(&ws[0], mod_sw);
   86|       |
   87|  80.8k|   return (*this);
   88|  80.8k|}
_ZN5Botan6BigInt7mod_subERKS0_S2_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
   90|   720k|BigInt& BigInt::mod_sub(const BigInt& s, const BigInt& mod, secure_vector<word>& ws) {
   91|   720k|   if(this->is_negative() || s.is_negative() || mod.is_negative()) {
  ------------------
  |  Branch (91:7): [True: 0, False: 720k]
  |  Branch (91:30): [True: 0, False: 720k]
  |  Branch (91:49): [True: 0, False: 720k]
  ------------------
   92|      0|      throw Invalid_Argument("BigInt::mod_sub expects all arguments are positive");
   93|      0|   }
   94|       |
   95|       |   // We are assuming in this function that *this and s are no more than mod_sw words long
   96|   720k|   BOTAN_DEBUG_ASSERT(*this < mod);
  ------------------
  |  |   99|   720k|      do {                          \
  |  |  100|   720k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
   97|   720k|   BOTAN_DEBUG_ASSERT(s < mod);
  ------------------
  |  |   99|   720k|      do {                          \
  |  |  100|   720k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
   98|       |
   99|   720k|   const size_t mod_sw = mod.sig_words();
  100|       |
  101|   720k|   this->grow_to(mod_sw);
  102|   720k|   s.grow_to(mod_sw);
  103|       |
  104|   720k|   if(ws.size() < mod_sw) {
  ------------------
  |  Branch (104:7): [True: 0, False: 720k]
  ------------------
  105|      0|      ws.resize(mod_sw);
  106|      0|   }
  107|       |
  108|   720k|   if(mod_sw == 4) {
  ------------------
  |  Branch (108:7): [True: 701k, False: 18.7k]
  ------------------
  109|   701k|      bigint_mod_sub_n<4>(mutable_data(), s.data(), mod.data(), ws.data());
  110|   701k|   } else if(mod_sw == 6) {
  ------------------
  |  Branch (110:14): [True: 0, False: 18.7k]
  ------------------
  111|      0|      bigint_mod_sub_n<6>(mutable_data(), s.data(), mod.data(), ws.data());
  112|  18.7k|   } else {
  113|  18.7k|      bigint_mod_sub(mutable_data(), s.data(), mod.data(), mod_sw, ws.data());
  114|  18.7k|   }
  115|       |
  116|   720k|   return (*this);
  117|   720k|}
_ZN5Botan6BigInt7mod_mulEhRKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  119|   323k|BigInt& BigInt::mod_mul(uint8_t y, const BigInt& mod, secure_vector<word>& ws) {
  120|   323k|   BOTAN_ARG_CHECK(this->is_negative() == false, "*this must be positive");
  ------------------
  |  |   30|   323k|   do {                                                          \
  |  |   31|   323k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 0, False: 323k]
  |  |  ------------------
  |  |   32|   323k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|   323k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  121|   323k|   BOTAN_ARG_CHECK(y < 16, "y too large");
  ------------------
  |  |   30|   323k|   do {                                                          \
  |  |   31|   323k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 0, False: 323k]
  |  |  ------------------
  |  |   32|   323k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|   323k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  122|       |
  123|   323k|   BOTAN_DEBUG_ASSERT(*this < mod);
  ------------------
  |  |   99|   323k|      do {                          \
  |  |  100|   323k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  124|       |
  125|   323k|   *this *= static_cast<word>(y);
  126|   323k|   this->reduce_below(mod, ws);
  127|   323k|   return (*this);
  128|   323k|}
_ZN5Botan6BigInt7rev_subEPKmmRNSt3__16vectorImNS_16secure_allocatorImEEEE:
  130|  8.24k|BigInt& BigInt::rev_sub(const word y[], size_t y_sw, secure_vector<word>& ws) {
  131|  8.24k|   if(this->sign() != BigInt::Positive) {
  ------------------
  |  Branch (131:7): [True: 0, False: 8.24k]
  ------------------
  132|      0|      throw Invalid_State("BigInt::sub_rev requires this is positive");
  133|      0|   }
  134|       |
  135|  8.24k|   const size_t x_sw = this->sig_words();
  136|       |
  137|  8.24k|   ws.resize(std::max(x_sw, y_sw));
  138|  8.24k|   clear_mem(ws.data(), ws.size());
  139|       |
  140|  8.24k|   const int32_t relative_size = bigint_sub_abs(ws.data(), data(), x_sw, y, y_sw);
  141|       |
  142|  8.24k|   this->cond_flip_sign(relative_size > 0);
  143|  8.24k|   this->swap_reg(ws);
  144|       |
  145|  8.24k|   return (*this);
  146|  8.24k|}
_ZN5Botan6BigInt3mulERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  156|  16.4k|BigInt& BigInt::mul(const BigInt& y, secure_vector<word>& ws) {
  157|  16.4k|   const size_t x_sw = sig_words();
  158|  16.4k|   const size_t y_sw = y.sig_words();
  159|  16.4k|   set_sign((sign() == y.sign()) ? Positive : Negative);
  ------------------
  |  Branch (159:13): [True: 16.4k, False: 0]
  ------------------
  160|       |
  161|  16.4k|   if(x_sw == 0 || y_sw == 0) {
  ------------------
  |  Branch (161:7): [True: 1.06k, False: 15.4k]
  |  Branch (161:20): [True: 0, False: 15.4k]
  ------------------
  162|  1.06k|      clear();
  163|  1.06k|      set_sign(Positive);
  164|  15.4k|   } else if(x_sw == 1 && y_sw) {
  ------------------
  |  Branch (164:14): [True: 3.72k, False: 11.7k]
  |  Branch (164:27): [True: 3.72k, False: 0]
  ------------------
  165|  3.72k|      grow_to(y_sw + 1);
  166|  3.72k|      bigint_linmul3(mutable_data(), y.data(), y_sw, word_at(0));
  167|  11.7k|   } else if(y_sw == 1 && x_sw) {
  ------------------
  |  Branch (167:14): [True: 0, False: 11.7k]
  |  Branch (167:27): [True: 0, False: 0]
  ------------------
  168|      0|      word carry = bigint_linmul2(mutable_data(), x_sw, y.word_at(0));
  169|      0|      set_word_at(x_sw, carry);
  170|  11.7k|   } else {
  171|  11.7k|      const size_t new_size = x_sw + y_sw + 1;
  172|  11.7k|      ws.resize(new_size);
  173|  11.7k|      secure_vector<word> z_reg(new_size);
  174|       |
  175|  11.7k|      bigint_mul(z_reg.data(), z_reg.size(), data(), size(), x_sw, y.data(), y.size(), y_sw, ws.data(), ws.size());
  176|       |
  177|  11.7k|      this->swap_reg(z_reg);
  178|  11.7k|   }
  179|       |
  180|  16.4k|   return (*this);
  181|  16.4k|}
_ZN5Botan6BigInt6squareERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  183|  2.33k|BigInt& BigInt::square(secure_vector<word>& ws) {
  184|  2.33k|   const size_t sw = sig_words();
  185|       |
  186|  2.33k|   secure_vector<word> z(2 * sw);
  187|  2.33k|   ws.resize(z.size());
  188|       |
  189|  2.33k|   bigint_sqr(z.data(), z.size(), data(), size(), sw, ws.data(), ws.size());
  190|       |
  191|  2.33k|   swap_reg(z);
  192|  2.33k|   set_sign(BigInt::Positive);
  193|       |
  194|  2.33k|   return (*this);
  195|  2.33k|}
_ZN5Botan6BigIntmLEm:
  197|  2.76M|BigInt& BigInt::operator*=(word y) {
  198|  2.76M|   if(y == 0) {
  ------------------
  |  Branch (198:7): [True: 0, False: 2.76M]
  ------------------
  199|      0|      clear();
  200|      0|      set_sign(Positive);
  201|      0|   }
  202|       |
  203|  2.76M|   const word carry = bigint_linmul2(mutable_data(), size(), y);
  204|  2.76M|   set_word_at(size(), carry);
  205|       |
  206|  2.76M|   return (*this);
  207|  2.76M|}
_ZN5Botan6BigIntrMERKS0_:
  224|  86.2k|BigInt& BigInt::operator%=(const BigInt& mod) { return (*this = (*this) % mod); }
_ZN5Botan6BigIntlSEm:
  258|   129k|BigInt& BigInt::operator<<=(size_t shift) {
  259|   129k|   const size_t shift_words = shift / BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|   129k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  260|   129k|   const size_t shift_bits = shift % BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|   129k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  261|   129k|   const size_t size = sig_words();
  262|       |
  263|   129k|   const size_t bits_free = top_bits_free();
  264|       |
  265|   129k|   const size_t new_size = size + shift_words + (bits_free < shift_bits);
  266|       |
  267|   129k|   m_data.grow_to(new_size);
  268|       |
  269|   129k|   bigint_shl1(m_data.mutable_data(), new_size, size, shift_words, shift_bits);
  270|       |
  271|   129k|   return (*this);
  272|   129k|}
_ZN5Botan6BigIntrSEm:
  277|   241k|BigInt& BigInt::operator>>=(size_t shift) {
  278|   241k|   const size_t shift_words = shift / BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|   241k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  279|   241k|   const size_t shift_bits = shift % BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|   241k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  280|       |
  281|   241k|   bigint_shr1(m_data.mutable_data(), m_data.size(), shift_words, shift_bits);
  282|       |
  283|   241k|   if(is_negative() && is_zero()) {
  ------------------
  |  Branch (283:7): [True: 0, False: 241k]
  |  Branch (283:24): [True: 0, False: 0]
  ------------------
  284|      0|      set_sign(Positive);
  285|      0|   }
  286|       |
  287|   241k|   return (*this);
  288|   241k|}

_ZN5Botan6BigInt4add2ERKS0_PKmmNS0_4SignE:
   19|  47.0k|BigInt BigInt::add2(const BigInt& x, const word y[], size_t y_words, BigInt::Sign y_sign) {
   20|  47.0k|   const size_t x_sw = x.sig_words();
   21|       |
   22|  47.0k|   BigInt z = BigInt::with_capacity(std::max(x_sw, y_words) + 1);
   23|       |
   24|  47.0k|   if(x.sign() == y_sign) {
  ------------------
  |  Branch (24:7): [True: 7.68k, False: 39.3k]
  ------------------
   25|  7.68k|      bigint_add3(z.mutable_data(), x.data(), x_sw, y, y_words);
   26|  7.68k|      z.set_sign(x.sign());
   27|  39.3k|   } else {
   28|  39.3k|      const int32_t relative_size = bigint_sub_abs(z.mutable_data(), x.data(), x_sw, y, y_words);
   29|       |
   30|       |      //z.sign_fixup(relative_size, y_sign);
   31|  39.3k|      if(relative_size < 0) {
  ------------------
  |  Branch (31:10): [True: 0, False: 39.3k]
  ------------------
   32|      0|         z.set_sign(y_sign);
   33|  39.3k|      } else if(relative_size == 0) {
  ------------------
  |  Branch (33:17): [True: 0, False: 39.3k]
  ------------------
   34|      0|         z.set_sign(BigInt::Positive);
   35|  39.3k|      } else {
   36|  39.3k|         z.set_sign(x.sign());
   37|  39.3k|      }
   38|  39.3k|   }
   39|       |
   40|  47.0k|   return z;
   41|  47.0k|}
_ZN5BotanmlERKNS_6BigIntES2_:
   46|  6.49k|BigInt operator*(const BigInt& x, const BigInt& y) {
   47|  6.49k|   const size_t x_sw = x.sig_words();
   48|  6.49k|   const size_t y_sw = y.sig_words();
   49|       |
   50|  6.49k|   BigInt z = BigInt::with_capacity(x.size() + y.size());
   51|       |
   52|  6.49k|   if(x_sw == 1 && y_sw) {
  ------------------
  |  Branch (52:7): [True: 263, False: 6.23k]
  |  Branch (52:20): [True: 263, False: 0]
  ------------------
   53|    263|      bigint_linmul3(z.mutable_data(), y.data(), y_sw, x.word_at(0));
   54|  6.23k|   } else if(y_sw == 1 && x_sw) {
  ------------------
  |  Branch (54:14): [True: 167, False: 6.06k]
  |  Branch (54:27): [True: 167, False: 0]
  ------------------
   55|    167|      bigint_linmul3(z.mutable_data(), x.data(), x_sw, y.word_at(0));
   56|  6.06k|   } else if(x_sw && y_sw) {
  ------------------
  |  Branch (56:14): [True: 6.04k, False: 28]
  |  Branch (56:22): [True: 6.02k, False: 14]
  ------------------
   57|  6.02k|      secure_vector<word> workspace(z.size());
   58|       |
   59|  6.02k|      bigint_mul(z.mutable_data(),
   60|  6.02k|                 z.size(),
   61|  6.02k|                 x.data(),
   62|  6.02k|                 x.size(),
   63|  6.02k|                 x_sw,
   64|  6.02k|                 y.data(),
   65|  6.02k|                 y.size(),
   66|  6.02k|                 y_sw,
   67|  6.02k|                 workspace.data(),
   68|  6.02k|                 workspace.size());
   69|  6.02k|   }
   70|       |
   71|  6.49k|   z.cond_flip_sign(x_sw > 0 && y_sw > 0 && x.sign() != y.sign());
  ------------------
  |  Branch (71:21): [True: 6.47k, False: 28]
  |  Branch (71:33): [True: 6.45k, False: 14]
  |  Branch (71:45): [True: 0, False: 6.45k]
  ------------------
   72|       |
   73|  6.49k|   return z;
   74|  6.49k|}
_ZN5BotanmlERKNS_6BigIntEm:
   79|   148k|BigInt operator*(const BigInt& x, word y) {
   80|   148k|   const size_t x_sw = x.sig_words();
   81|       |
   82|   148k|   BigInt z = BigInt::with_capacity(x_sw + 1);
   83|       |
   84|   148k|   if(x_sw && y) {
  ------------------
  |  Branch (84:7): [True: 148k, False: 0]
  |  Branch (84:15): [True: 74.0k, False: 74.2k]
  ------------------
   85|  74.0k|      bigint_linmul3(z.mutable_data(), x.data(), x_sw, y);
   86|  74.0k|      z.set_sign(x.sign());
   87|  74.0k|   }
   88|       |
   89|   148k|   return z;
   90|   148k|}
_ZN5BotandvERKNS_6BigIntEm:
  108|  86.2k|BigInt operator/(const BigInt& x, word y) {
  109|  86.2k|   if(y == 0) {
  ------------------
  |  Branch (109:7): [True: 0, False: 86.2k]
  ------------------
  110|      0|      throw Invalid_Argument("BigInt::operator/ divide by zero");
  111|      0|   }
  112|       |
  113|  86.2k|   BigInt q;
  114|  86.2k|   word r;
  115|  86.2k|   ct_divide_word(x, y, q, r);
  116|  86.2k|   return q;
  117|  86.2k|}
_ZN5BotanrmERKNS_6BigIntES2_:
  122|  88.6k|BigInt operator%(const BigInt& n, const BigInt& mod) {
  123|  88.6k|   if(mod.is_zero()) {
  ------------------
  |  Branch (123:7): [True: 0, False: 88.6k]
  ------------------
  124|      0|      throw Invalid_Argument("BigInt::operator% divide by zero");
  125|      0|   }
  126|  88.6k|   if(mod.is_negative()) {
  ------------------
  |  Branch (126:7): [True: 0, False: 88.6k]
  ------------------
  127|      0|      throw Invalid_Argument("BigInt::operator% modulus must be > 0");
  128|      0|   }
  129|  88.6k|   if(n.is_positive() && mod.is_positive() && n < mod) {
  ------------------
  |  Branch (129:7): [True: 88.6k, False: 0]
  |  Branch (129:26): [True: 88.6k, False: 0]
  |  Branch (129:47): [True: 2.37k, False: 86.2k]
  ------------------
  130|  2.37k|      return n;
  131|  2.37k|   }
  132|       |
  133|  86.2k|   if(mod.sig_words() == 1) {
  ------------------
  |  Branch (133:7): [True: 21.5k, False: 64.6k]
  ------------------
  134|  21.5k|      return BigInt::from_word(n % mod.word_at(0));
  135|  21.5k|   }
  136|       |
  137|  64.6k|   BigInt q, r;
  138|  64.6k|   vartime_divide(n, mod, q, r);
  139|  64.6k|   return r;
  140|  86.2k|}
_ZN5BotanrmERKNS_6BigIntEm:
  145|   217k|word operator%(const BigInt& n, word mod) {
  146|   217k|   if(mod == 0) {
  ------------------
  |  Branch (146:7): [True: 0, False: 217k]
  ------------------
  147|      0|      throw Invalid_Argument("BigInt::operator% divide by zero");
  148|      0|   }
  149|       |
  150|   217k|   if(mod == 1) {
  ------------------
  |  Branch (150:7): [True: 0, False: 217k]
  ------------------
  151|      0|      return 0;
  152|      0|   }
  153|       |
  154|   217k|   word remainder = 0;
  155|       |
  156|   217k|   if(is_power_of_2(mod)) {
  ------------------
  |  Branch (156:7): [True: 195k, False: 21.5k]
  ------------------
  157|   195k|      remainder = (n.word_at(0) & (mod - 1));
  158|   195k|   } else {
  159|  21.5k|      const size_t sw = n.sig_words();
  160|  44.3k|      for(size_t i = sw; i > 0; --i) {
  ------------------
  |  Branch (160:26): [True: 22.7k, False: 21.5k]
  ------------------
  161|  22.7k|         remainder = bigint_modop(remainder, n.word_at(i - 1), mod);
  162|  22.7k|      }
  163|  21.5k|   }
  164|       |
  165|   217k|   if(remainder && n.sign() == BigInt::Negative) {
  ------------------
  |  Branch (165:7): [True: 217k, False: 0]
  |  Branch (165:20): [True: 0, False: 217k]
  ------------------
  166|      0|      return mod - remainder;
  167|      0|   }
  168|   217k|   return remainder;
  169|   217k|}
_ZN5BotanlsERKNS_6BigIntEm:
  174|  64.6k|BigInt operator<<(const BigInt& x, size_t shift) {
  175|  64.6k|   const size_t shift_words = shift / BOTAN_MP_WORD_BITS, shift_bits = shift % BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|  64.6k|#define BOTAN_MP_WORD_BITS 64
  ------------------
                 const size_t shift_words = shift / BOTAN_MP_WORD_BITS, shift_bits = shift % BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|  64.6k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  176|       |
  177|  64.6k|   const size_t x_sw = x.sig_words();
  178|       |
  179|  64.6k|   BigInt y = BigInt::with_capacity(x_sw + shift_words + (shift_bits ? 1 : 0));
  ------------------
  |  Branch (179:59): [True: 0, False: 64.6k]
  ------------------
  180|  64.6k|   bigint_shl2(y.mutable_data(), x.data(), x_sw, shift_words, shift_bits);
  181|  64.6k|   y.set_sign(x.sign());
  182|  64.6k|   return y;
  183|  64.6k|}
_ZN5BotanrsERKNS_6BigIntEm:
  188|    905|BigInt operator>>(const BigInt& x, size_t shift) {
  189|    905|   const size_t shift_words = shift / BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|    905|#define BOTAN_MP_WORD_BITS 64
  ------------------
  190|    905|   const size_t shift_bits = shift % BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|    905|#define BOTAN_MP_WORD_BITS 64
  ------------------
  191|    905|   const size_t x_sw = x.sig_words();
  192|       |
  193|    905|   if(shift_words >= x_sw) {
  ------------------
  |  Branch (193:7): [True: 0, False: 905]
  ------------------
  194|      0|      return BigInt::zero();
  195|      0|   }
  196|       |
  197|    905|   BigInt y = BigInt::with_capacity(x_sw - shift_words);
  198|    905|   bigint_shr2(y.mutable_data(), x.data(), x_sw, shift_words, shift_bits);
  199|       |
  200|    905|   if(x.is_negative() && y.is_zero()) {
  ------------------
  |  Branch (200:7): [True: 0, False: 905]
  |  Branch (200:26): [True: 0, False: 0]
  ------------------
  201|      0|      y.set_sign(BigInt::Positive);
  202|    905|   } else {
  203|    905|      y.set_sign(x.sign());
  204|    905|   }
  205|       |
  206|    905|   return y;
  207|    905|}

_ZN5Botan6BigIntC2Em:
   18|    623|BigInt::BigInt(uint64_t n) {
   19|    623|#if BOTAN_MP_WORD_BITS == 64
   20|    623|   m_data.set_word_at(0, n);
   21|       |#else
   22|       |   m_data.set_word_at(1, static_cast<word>(n >> 32));
   23|       |   m_data.set_word_at(0, static_cast<word>(n));
   24|       |#endif
   25|    623|}
_ZN5Botan6BigInt8from_u64Em:
   28|    276|BigInt BigInt::from_u64(uint64_t n) {
   29|    276|   BigInt bn;
   30|       |
   31|    276|#if BOTAN_MP_WORD_BITS == 64
   32|    276|   bn.set_word_at(0, n);
   33|       |#else
   34|       |   bn.set_word_at(1, static_cast<word>(n >> 32));
   35|       |   bn.set_word_at(0, static_cast<word>(n));
   36|       |#endif
   37|       |
   38|    276|   return bn;
   39|    276|}
_ZN5Botan6BigInt9from_wordEm:
   42|  21.5k|BigInt BigInt::from_word(word n) {
   43|  21.5k|   BigInt bn;
   44|  21.5k|   bn.set_word_at(0, n);
   45|  21.5k|   return bn;
   46|  21.5k|}
_ZN5Botan6BigInt8from_s32Ei:
   49|    276|BigInt BigInt::from_s32(int32_t n) {
   50|    276|   if(n >= 0) {
  ------------------
  |  Branch (50:7): [True: 0, False: 276]
  ------------------
   51|      0|      return BigInt::from_u64(static_cast<uint64_t>(n));
   52|    276|   } else {
   53|    276|      return -BigInt::from_u64(static_cast<uint64_t>(-n));
   54|    276|   }
   55|    276|}
_ZN5Botan6BigInt13with_capacityEm:
   58|   375k|BigInt BigInt::with_capacity(size_t size) {
   59|   375k|   BigInt bn;
   60|   375k|   bn.grow_to(size);
   61|   375k|   return bn;
   62|   375k|}
_ZN5Botan6BigIntC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   67|     47|BigInt::BigInt(std::string_view str) {
   68|     47|   Base base = Decimal;
   69|     47|   size_t markers = 0;
   70|     47|   bool negative = false;
   71|       |
   72|     47|   if(str.length() > 0 && str[0] == '-') {
  ------------------
  |  Branch (72:7): [True: 47, False: 0]
  |  Branch (72:27): [True: 0, False: 47]
  ------------------
   73|      0|      markers += 1;
   74|      0|      negative = true;
   75|      0|   }
   76|       |
   77|     47|   if(str.length() > markers + 2 && str[markers] == '0' && str[markers + 1] == 'x') {
  ------------------
  |  Branch (77:7): [True: 47, False: 0]
  |  Branch (77:37): [True: 47, False: 0]
  |  Branch (77:60): [True: 47, False: 0]
  ------------------
   78|     47|      markers += 2;
   79|     47|      base = Hexadecimal;
   80|     47|   }
   81|       |
   82|     47|   *this = decode(cast_char_ptr_to_uint8(str.data()) + markers, str.length() - markers, base);
   83|       |
   84|     47|   if(negative) {
  ------------------
  |  Branch (84:7): [True: 0, False: 47]
  ------------------
   85|      0|      set_sign(Negative);
   86|     47|   } else {
   87|     47|      set_sign(Positive);
   88|     47|   }
   89|     47|}
_ZN5Botan6BigIntC2EPKhm:
   91|  16.2k|BigInt::BigInt(const uint8_t input[], size_t length) { binary_decode(input, length); }
_ZN5Botan6BigInt24from_bytes_with_max_bitsEPKhmm:
   99|    309|BigInt BigInt::from_bytes_with_max_bits(const uint8_t input[], size_t length, size_t max_bits) {
  100|    309|   const size_t input_bits = 8 * length;
  101|       |
  102|    309|   BigInt bn;
  103|    309|   bn.binary_decode(input, length);
  104|       |
  105|    309|   if(input_bits > max_bits) {
  ------------------
  |  Branch (105:7): [True: 0, False: 309]
  ------------------
  106|      0|      const size_t bits_to_shift = input_bits - max_bits;
  107|       |
  108|      0|      bn >>= bits_to_shift;
  109|      0|   }
  110|       |
  111|    309|   return bn;
  112|    309|}
_ZNK5Botan6BigInt7byte_atEm:
  119|  16.9k|uint8_t BigInt::byte_at(size_t n) const {
  120|  16.9k|   return get_byte_var(sizeof(word) - (n % sizeof(word)) - 1, word_at(n / sizeof(word)));
  121|  16.9k|}
_ZNK5Botan6BigInt8cmp_wordEm:
  123|   104k|int32_t BigInt::cmp_word(word other) const {
  124|   104k|   if(is_negative()) {
  ------------------
  |  Branch (124:7): [True: 276, False: 104k]
  ------------------
  125|    276|      return -1;  // other is positive ...
  126|    276|   }
  127|       |
  128|   104k|   const size_t sw = this->sig_words();
  129|   104k|   if(sw > 1) {
  ------------------
  |  Branch (129:7): [True: 81.0k, False: 23.3k]
  ------------------
  130|  81.0k|      return 1;  // must be larger since other is just one word ...
  131|  81.0k|   }
  132|       |
  133|  23.3k|   return bigint_cmp(this->data(), sw, &other, 1);
  134|   104k|}
_ZNK5Botan6BigInt3cmpERKS0_b:
  139|  3.20k|int32_t BigInt::cmp(const BigInt& other, bool check_signs) const {
  140|  3.20k|   if(check_signs) {
  ------------------
  |  Branch (140:7): [True: 3.20k, False: 0]
  ------------------
  141|  3.20k|      if(other.is_positive() && this->is_negative()) {
  ------------------
  |  Branch (141:10): [True: 3.20k, False: 0]
  |  Branch (141:33): [True: 0, False: 3.20k]
  ------------------
  142|      0|         return -1;
  143|      0|      }
  144|       |
  145|  3.20k|      if(other.is_negative() && this->is_positive()) {
  ------------------
  |  Branch (145:10): [True: 0, False: 3.20k]
  |  Branch (145:33): [True: 0, False: 0]
  ------------------
  146|      0|         return 1;
  147|      0|      }
  148|       |
  149|  3.20k|      if(other.is_negative() && this->is_negative()) {
  ------------------
  |  Branch (149:10): [True: 0, False: 3.20k]
  |  Branch (149:33): [True: 0, False: 0]
  ------------------
  150|      0|         return (-bigint_cmp(this->data(), this->size(), other.data(), other.size()));
  151|      0|      }
  152|  3.20k|   }
  153|       |
  154|  3.20k|   return bigint_cmp(this->data(), this->size(), other.data(), other.size());
  155|  3.20k|}
_ZNK5Botan6BigInt8is_equalERKS0_:
  157|  5.58k|bool BigInt::is_equal(const BigInt& other) const {
  158|  5.58k|   if(this->sign() != other.sign()) {
  ------------------
  |  Branch (158:7): [True: 0, False: 5.58k]
  ------------------
  159|      0|      return false;
  160|      0|   }
  161|       |
  162|  5.58k|   return bigint_ct_is_eq(this->data(), this->sig_words(), other.data(), other.sig_words()).is_set();
  163|  5.58k|}
_ZNK5Botan6BigInt12is_less_thanERKS0_:
  165|   180k|bool BigInt::is_less_than(const BigInt& other) const {
  166|   180k|   if(this->is_negative() && other.is_positive()) {
  ------------------
  |  Branch (166:7): [True: 0, False: 180k]
  |  Branch (166:30): [True: 0, False: 0]
  ------------------
  167|      0|      return true;
  168|      0|   }
  169|       |
  170|   180k|   if(this->is_positive() && other.is_negative()) {
  ------------------
  |  Branch (170:7): [True: 180k, False: 0]
  |  Branch (170:30): [True: 0, False: 180k]
  ------------------
  171|      0|      return false;
  172|      0|   }
  173|       |
  174|   180k|   if(other.is_negative() && this->is_negative()) {
  ------------------
  |  Branch (174:7): [True: 0, False: 180k]
  |  Branch (174:30): [True: 0, False: 0]
  ------------------
  175|      0|      return bigint_ct_is_lt(other.data(), other.sig_words(), this->data(), this->sig_words()).is_set();
  176|      0|   }
  177|       |
  178|   180k|   return bigint_ct_is_lt(this->data(), this->sig_words(), other.data(), other.sig_words()).is_set();
  179|   180k|}
_ZNK5Botan6BigInt12encode_wordsEPmm:
  181|  10.9k|void BigInt::encode_words(word out[], size_t size) const {
  182|  10.9k|   const size_t words = sig_words();
  183|       |
  184|  10.9k|   if(words > size) {
  ------------------
  |  Branch (184:7): [True: 0, False: 10.9k]
  ------------------
  185|      0|      throw Encoding_Error("BigInt::encode_words value too large to encode");
  186|      0|   }
  187|       |
  188|  10.9k|   clear_mem(out, size);
  189|  10.9k|   copy_mem(out, data(), words);
  190|  10.9k|}
_ZNK5Botan6BigInt4Data14calc_sig_wordsEv:
  192|  1.19M|size_t BigInt::Data::calc_sig_words() const {
  193|  1.19M|   const size_t sz = m_reg.size();
  194|  1.19M|   size_t sig = sz;
  195|       |
  196|  1.19M|   word sub = 1;
  197|       |
  198|  12.9M|   for(size_t i = 0; i != sz; ++i) {
  ------------------
  |  Branch (198:22): [True: 11.7M, False: 1.19M]
  ------------------
  199|  11.7M|      const word w = m_reg[sz - i - 1];
  200|  11.7M|      sub &= ct_is_zero(w);
  201|  11.7M|      sig -= sub;
  202|  11.7M|   }
  203|       |
  204|       |   /*
  205|       |   * This depends on the data so is poisoned, but unpoison it here as
  206|       |   * later conditionals are made on the size.
  207|       |   */
  208|  1.19M|   CT::unpoison(sig);
  209|       |
  210|  1.19M|   return sig;
  211|  1.19M|}
_ZNK5Botan6BigInt13get_substringEmm:
  216|   186k|uint32_t BigInt::get_substring(size_t offset, size_t length) const {
  217|   186k|   if(length == 0 || length > 32) {
  ------------------
  |  Branch (217:7): [True: 0, False: 186k]
  |  Branch (217:22): [True: 0, False: 186k]
  ------------------
  218|      0|      throw Invalid_Argument("BigInt::get_substring invalid substring length");
  219|      0|   }
  220|       |
  221|   186k|   const uint32_t mask = 0xFFFFFFFF >> (32 - length);
  222|       |
  223|   186k|   const size_t word_offset = offset / BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|   186k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  224|   186k|   const size_t wshift = (offset % BOTAN_MP_WORD_BITS);
  ------------------
  |  |   50|   186k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  225|       |
  226|       |   /*
  227|       |   * The substring is contained within one or at most two words. The
  228|       |   * offset and length are not secret, so we can perform conditional
  229|       |   * operations on those values.
  230|       |   */
  231|   186k|   const word w0 = word_at(word_offset);
  232|       |
  233|   186k|   if(wshift == 0 || (offset + length) / BOTAN_MP_WORD_BITS == word_offset) {
  ------------------
  |  |   50|   179k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  |  Branch (233:7): [True: 7.53k, False: 179k]
  |  Branch (233:22): [True: 172k, False: 6.31k]
  ------------------
  234|   180k|      return static_cast<uint32_t>(w0 >> wshift) & mask;
  235|   180k|   } else {
  236|  6.31k|      const word w1 = word_at(word_offset + 1);
  237|  6.31k|      return static_cast<uint32_t>((w0 >> wshift) | (w1 << (BOTAN_MP_WORD_BITS - wshift))) & mask;
  ------------------
  |  |   50|  6.31k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  238|  6.31k|   }
  239|   186k|}
_ZNK5Botan6BigInt5bytesEv:
  271|  15.9k|size_t BigInt::bytes() const { return round_up(bits(), 8) / 8; }
_ZNK5Botan6BigInt13top_bits_freeEv:
  273|   306k|size_t BigInt::top_bits_free() const {
  274|   306k|   const size_t words = sig_words();
  275|       |
  276|   306k|   const word top_word = word_at(words - 1);
  277|   306k|   const size_t bits_used = high_bit(top_word);
  278|   306k|   CT::unpoison(bits_used);
  279|   306k|   return BOTAN_MP_WORD_BITS - bits_used;
  ------------------
  |  |   50|   306k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  280|   306k|}
_ZNK5Botan6BigInt4bitsEv:
  282|   115k|size_t BigInt::bits() const {
  283|   115k|   const size_t words = sig_words();
  284|       |
  285|   115k|   if(words == 0) {
  ------------------
  |  Branch (285:7): [True: 2.47k, False: 112k]
  ------------------
  286|  2.47k|      return 0;
  287|  2.47k|   }
  288|       |
  289|   112k|   const size_t full_words = (words - 1) * BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|   112k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  290|   112k|   const size_t top_bits = BOTAN_MP_WORD_BITS - top_bits_free();
  ------------------
  |  |   50|   112k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  291|       |
  292|   112k|   return full_words + top_bits;
  293|   115k|}
_ZNK5Botan6BigIntngEv:
  298|    276|BigInt BigInt::operator-() const {
  299|    276|   BigInt x = (*this);
  300|    276|   x.flip_sign();
  301|    276|   return x;
  302|    276|}
_ZN5Botan6BigInt12reduce_belowERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  304|   388k|size_t BigInt::reduce_below(const BigInt& p, secure_vector<word>& ws) {
  305|   388k|   if(p.is_negative() || this->is_negative()) {
  ------------------
  |  Branch (305:7): [True: 0, False: 388k]
  |  Branch (305:26): [True: 0, False: 388k]
  ------------------
  306|      0|      throw Invalid_Argument("BigInt::reduce_below both values must be positive");
  307|      0|   }
  308|       |
  309|   388k|   const size_t p_words = p.sig_words();
  310|       |
  311|   388k|   if(size() < p_words + 1) {
  ------------------
  |  Branch (311:7): [True: 4, False: 388k]
  ------------------
  312|      4|      grow_to(p_words + 1);
  313|      4|   }
  314|       |
  315|   388k|   if(ws.size() < p_words + 1) {
  ------------------
  |  Branch (315:7): [True: 64.6k, False: 323k]
  ------------------
  316|  64.6k|      ws.resize(p_words + 1);
  317|  64.6k|   }
  318|       |
  319|   388k|   clear_mem(ws.data(), ws.size());
  320|       |
  321|   388k|   size_t reductions = 0;
  322|       |
  323|   915k|   for(;;) {
  324|   915k|      word borrow = bigint_sub3(ws.data(), data(), p_words + 1, p.data(), p_words);
  325|   915k|      if(borrow) {
  ------------------
  |  Branch (325:10): [True: 388k, False: 527k]
  ------------------
  326|   388k|         break;
  327|   388k|      }
  328|       |
  329|   527k|      ++reductions;
  330|   527k|      swap_reg(ws);
  331|   527k|   }
  332|       |
  333|   388k|   return reductions;
  334|   388k|}
_ZN5Botan6BigInt15ct_reduce_belowERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEEm:
  336|  8.24k|void BigInt::ct_reduce_below(const BigInt& mod, secure_vector<word>& ws, size_t bound) {
  337|  8.24k|   if(mod.is_negative() || this->is_negative()) {
  ------------------
  |  Branch (337:7): [True: 0, False: 8.24k]
  |  Branch (337:28): [True: 0, False: 8.24k]
  ------------------
  338|      0|      throw Invalid_Argument("BigInt::ct_reduce_below both values must be positive");
  339|      0|   }
  340|       |
  341|  8.24k|   const size_t mod_words = mod.sig_words();
  342|       |
  343|  8.24k|   grow_to(mod_words);
  344|       |
  345|  8.24k|   const size_t sz = size();
  346|       |
  347|  8.24k|   ws.resize(sz);
  348|       |
  349|  8.24k|   clear_mem(ws.data(), sz);
  350|       |
  351|  24.7k|   for(size_t i = 0; i != bound; ++i) {
  ------------------
  |  Branch (351:22): [True: 16.4k, False: 8.24k]
  ------------------
  352|  16.4k|      word borrow = bigint_sub3(ws.data(), data(), sz, mod.data(), mod_words);
  353|       |
  354|  16.4k|      CT::Mask<word>::is_zero(borrow).select_n(mutable_data(), ws.data(), data(), sz);
  355|  16.4k|   }
  356|  8.24k|}
_ZNK5Botan6BigInt13binary_encodeEPh:
  367|  6.42k|void BigInt::binary_encode(uint8_t buf[]) const { this->binary_encode(buf, bytes()); }
_ZNK5Botan6BigInt13binary_encodeEPhm:
  372|  7.51k|void BigInt::binary_encode(uint8_t output[], size_t len) const {
  373|  7.51k|   const size_t full_words = len / sizeof(word);
  374|  7.51k|   const size_t extra_bytes = len % sizeof(word);
  375|       |
  376|  28.5k|   for(size_t i = 0; i != full_words; ++i) {
  ------------------
  |  Branch (376:22): [True: 21.0k, False: 7.51k]
  ------------------
  377|  21.0k|      const word w = word_at(i);
  378|  21.0k|      store_be(w, output + (len - (i + 1) * sizeof(word)));
  379|  21.0k|   }
  380|       |
  381|  7.51k|   if(extra_bytes > 0) {
  ------------------
  |  Branch (381:7): [True: 2.86k, False: 4.64k]
  ------------------
  382|  2.86k|      const word w = word_at(full_words);
  383|       |
  384|  10.1k|      for(size_t i = 0; i != extra_bytes; ++i) {
  ------------------
  |  Branch (384:25): [True: 7.30k, False: 2.86k]
  ------------------
  385|  7.30k|         output[extra_bytes - i - 1] = get_byte_var(sizeof(word) - i - 1, w);
  386|  7.30k|      }
  387|  2.86k|   }
  388|  7.51k|}
_ZN5Botan6BigInt13binary_decodeEPKhm:
  393|  17.2k|void BigInt::binary_decode(const uint8_t buf[], size_t length) {
  394|  17.2k|   clear();
  395|       |
  396|  17.2k|   const size_t full_words = length / sizeof(word);
  397|  17.2k|   const size_t extra_bytes = length % sizeof(word);
  398|       |
  399|  17.2k|   secure_vector<word> reg((round_up(full_words + (extra_bytes > 0 ? 1 : 0), 8)));
  ------------------
  |  Branch (399:52): [True: 10.9k, False: 6.27k]
  ------------------
  400|       |
  401|  69.0k|   for(size_t i = 0; i != full_words; ++i) {
  ------------------
  |  Branch (401:22): [True: 51.8k, False: 17.2k]
  ------------------
  402|  51.8k|      reg[i] = load_be<word>(buf + length - sizeof(word) * (i + 1), 0);
  403|  51.8k|   }
  404|       |
  405|  17.2k|   if(extra_bytes > 0) {
  ------------------
  |  Branch (405:7): [True: 10.9k, False: 6.27k]
  ------------------
  406|  29.9k|      for(size_t i = 0; i != extra_bytes; ++i) {
  ------------------
  |  Branch (406:25): [True: 18.9k, False: 10.9k]
  ------------------
  407|  18.9k|         reg[full_words] = (reg[full_words] << 8) | buf[i];
  408|  18.9k|      }
  409|  10.9k|   }
  410|       |
  411|  17.2k|   m_data.swap(reg);
  412|  17.2k|}
_ZN5Botan6BigInt12ct_cond_swapEbRS0_:
  423|  2.44M|void BigInt::ct_cond_swap(bool predicate, BigInt& other) {
  424|  2.44M|   const size_t max_words = std::max(size(), other.size());
  425|  2.44M|   grow_to(max_words);
  426|  2.44M|   other.grow_to(max_words);
  427|       |
  428|  2.44M|   bigint_cnd_swap(predicate, this->mutable_data(), other.mutable_data(), max_words);
  429|  2.44M|}
_ZN5Botan6BigInt14cond_flip_signEb:
  431|  89.9k|void BigInt::cond_flip_sign(bool predicate) {
  432|       |   // This code is assuming Negative == 0, Positive == 1
  433|       |
  434|  89.9k|   const auto mask = CT::Mask<uint8_t>::expand(predicate);
  435|       |
  436|  89.9k|   const uint8_t current_sign = static_cast<uint8_t>(sign());
  437|       |
  438|  89.9k|   const uint8_t new_sign = mask.select(current_sign ^ 1, current_sign);
  439|       |
  440|  89.9k|   set_sign(static_cast<Sign>(new_sign));
  441|  89.9k|}

_ZN5Botan9ct_divideERKNS_6BigIntES2_RS0_S3_:
   48|  2.34k|void ct_divide(const BigInt& x, const BigInt& y, BigInt& q_out, BigInt& r_out) {
   49|  2.34k|   if(y.is_zero()) {
  ------------------
  |  Branch (49:7): [True: 0, False: 2.34k]
  ------------------
   50|      0|      throw Invalid_Argument("ct_divide: cannot divide by zero");
   51|      0|   }
   52|       |
   53|  2.34k|   const size_t x_words = x.sig_words();
   54|  2.34k|   const size_t y_words = y.sig_words();
   55|       |
   56|  2.34k|   const size_t x_bits = x.bits();
   57|       |
   58|  2.34k|   BigInt q = BigInt::with_capacity(x_words);
   59|  2.34k|   BigInt r = BigInt::with_capacity(y_words);
   60|  2.34k|   BigInt t = BigInt::with_capacity(y_words);  // a temporary
   61|       |
   62|  2.44M|   for(size_t i = 0; i != x_bits; ++i) {
  ------------------
  |  Branch (62:22): [True: 2.44M, False: 2.34k]
  ------------------
   63|  2.44M|      const size_t b = x_bits - 1 - i;
   64|  2.44M|      const bool x_b = x.get_bit(b);
   65|       |
   66|  2.44M|      r *= 2;
   67|  2.44M|      r.conditionally_set_bit(0, x_b);
   68|       |
   69|  2.44M|      const bool r_gte_y = bigint_sub3(t.mutable_data(), r.data(), r.size(), y.data(), y_words) == 0;
   70|       |
   71|  2.44M|      q.conditionally_set_bit(b, r_gte_y);
   72|  2.44M|      r.ct_cond_swap(r_gte_y, t);
   73|  2.44M|   }
   74|       |
   75|  2.34k|   sign_fixup(x, y, q, r);
   76|  2.34k|   r_out = r;
   77|  2.34k|   q_out = q;
   78|  2.34k|}
_ZN5Botan14ct_divide_wordERKNS_6BigIntEmRS0_Rm:
   80|  86.2k|void ct_divide_word(const BigInt& x, word y, BigInt& q_out, word& r_out) {
   81|  86.2k|   if(y == 0) {
  ------------------
  |  Branch (81:7): [True: 0, False: 86.2k]
  ------------------
   82|      0|      throw Invalid_Argument("ct_divide_word: cannot divide by zero");
   83|      0|   }
   84|       |
   85|  86.2k|   const size_t x_words = x.sig_words();
   86|  86.2k|   const size_t x_bits = x.bits();
   87|       |
   88|  86.2k|   BigInt q = BigInt::with_capacity(x_words);
   89|  86.2k|   word r = 0;
   90|       |
   91|  11.0M|   for(size_t i = 0; i != x_bits; ++i) {
  ------------------
  |  Branch (91:22): [True: 10.9M, False: 86.2k]
  ------------------
   92|  10.9M|      const size_t b = x_bits - 1 - i;
   93|  10.9M|      const bool x_b = x.get_bit(b);
   94|       |
   95|  10.9M|      const auto r_carry = CT::Mask<word>::expand(r >> (BOTAN_MP_WORD_BITS - 1));
  ------------------
  |  |   50|  10.9M|#define BOTAN_MP_WORD_BITS 64
  ------------------
   96|       |
   97|  10.9M|      r *= 2;
   98|  10.9M|      r += x_b;
   99|       |
  100|  10.9M|      const auto r_gte_y = CT::Mask<word>::is_gte(r, y) | r_carry;
  101|  10.9M|      q.conditionally_set_bit(b, r_gte_y.is_set());
  102|  10.9M|      r = r_gte_y.select(r - y, r);
  103|  10.9M|   }
  104|       |
  105|  86.2k|   if(x.is_negative()) {
  ------------------
  |  Branch (105:7): [True: 0, False: 86.2k]
  ------------------
  106|      0|      q.flip_sign();
  107|      0|      if(r != 0) {
  ------------------
  |  Branch (107:10): [True: 0, False: 0]
  ------------------
  108|      0|         --q;
  109|      0|         r = y - r;
  110|      0|      }
  111|      0|   }
  112|       |
  113|  86.2k|   r_out = r;
  114|  86.2k|   q_out = q;
  115|  86.2k|}
_ZN5Botan14vartime_divideERKNS_6BigIntES2_RS0_S3_:
  155|  64.6k|void vartime_divide(const BigInt& x, const BigInt& y_arg, BigInt& q_out, BigInt& r_out) {
  156|  64.6k|   if(y_arg.is_zero()) {
  ------------------
  |  Branch (156:7): [True: 0, False: 64.6k]
  ------------------
  157|      0|      throw Invalid_Argument("vartime_divide: cannot divide by zero");
  158|      0|   }
  159|       |
  160|  64.6k|   const size_t y_words = y_arg.sig_words();
  161|       |
  162|  64.6k|   BOTAN_ASSERT_NOMSG(y_words > 0);
  ------------------
  |  |   60|  64.6k|   do {                                                                     \
  |  |   61|  64.6k|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 64.6k]
  |  |  ------------------
  |  |   62|  64.6k|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|  64.6k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  163|       |
  164|  64.6k|   BigInt y = y_arg;
  165|       |
  166|  64.6k|   BigInt r = x;
  167|  64.6k|   BigInt q = BigInt::zero();
  168|  64.6k|   secure_vector<word> ws;
  169|       |
  170|  64.6k|   r.set_sign(BigInt::Positive);
  171|  64.6k|   y.set_sign(BigInt::Positive);
  172|       |
  173|       |   // Calculate shifts needed to normalize y with high bit set
  174|  64.6k|   const size_t shifts = y.top_bits_free();
  175|       |
  176|  64.6k|   y <<= shifts;
  177|  64.6k|   r <<= shifts;
  178|       |
  179|       |   // we know y has not changed size, since we only shifted up to set high bit
  180|  64.6k|   const size_t t = y_words - 1;
  181|  64.6k|   const size_t n = std::max(y_words, r.sig_words()) - 1;  // r may have changed size however
  182|       |
  183|  64.6k|   BOTAN_ASSERT_NOMSG(n >= t);
  ------------------
  |  |   60|  64.6k|   do {                                                                     \
  |  |   61|  64.6k|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 64.6k]
  |  |  ------------------
  |  |   62|  64.6k|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|  64.6k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  184|       |
  185|  64.6k|   q.grow_to(n - t + 1);
  186|       |
  187|  64.6k|   word* q_words = q.mutable_data();
  188|       |
  189|  64.6k|   BigInt shifted_y = y << (BOTAN_MP_WORD_BITS * (n - t));
  ------------------
  |  |   50|  64.6k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  190|       |
  191|       |   // Set q_{n-t} to number of times r > shifted_y
  192|  64.6k|   q_words[n - t] = r.reduce_below(shifted_y, ws);
  193|       |
  194|  64.6k|   const word y_t0 = y.word_at(t);
  195|  64.6k|   const word y_t1 = y.word_at(t - 1);
  196|  64.6k|   BOTAN_DEBUG_ASSERT((y_t0 >> (BOTAN_MP_WORD_BITS - 1)) == 1);
  ------------------
  |  |   99|  64.6k|      do {                          \
  |  |  100|  64.6k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  197|       |
  198|   138k|   for(size_t j = n; j != t; --j) {
  ------------------
  |  Branch (198:22): [True: 74.1k, False: 64.6k]
  ------------------
  199|  74.1k|      const word x_j0 = r.word_at(j);
  200|  74.1k|      const word x_j1 = r.word_at(j - 1);
  201|  74.1k|      const word x_j2 = r.word_at(j - 2);
  202|       |
  203|  74.1k|      word qjt = bigint_divop(x_j0, x_j1, y_t0);
  204|       |
  205|  74.1k|      qjt = CT::Mask<word>::is_equal(x_j0, y_t0).select(MP_WORD_MAX, qjt);
  206|       |
  207|       |      // Per HAC 14.23, this operation is required at most twice
  208|  74.1k|      qjt -= division_check(qjt, y_t0, y_t1, x_j0, x_j1, x_j2);
  209|  74.1k|      qjt -= division_check(qjt, y_t0, y_t1, x_j0, x_j1, x_j2);
  210|  74.1k|      BOTAN_DEBUG_ASSERT(division_check(qjt, y_t0, y_t1, x_j0, x_j1, x_j2) == false);
  ------------------
  |  |   99|  74.1k|      do {                          \
  |  |  100|  74.1k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  211|       |
  212|  74.1k|      shifted_y >>= BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|  74.1k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  213|       |      // Now shifted_y == y << (BOTAN_MP_WORD_BITS * (j-t-1))
  214|       |
  215|       |      // TODO this sequence could be better
  216|  74.1k|      r -= qjt * shifted_y;
  217|  74.1k|      qjt -= r.is_negative();
  218|  74.1k|      r += static_cast<word>(r.is_negative()) * shifted_y;
  219|       |
  220|  74.1k|      q_words[j - t - 1] = qjt;
  221|  74.1k|   }
  222|       |
  223|  64.6k|   r >>= shifts;
  224|       |
  225|  64.6k|   sign_fixup(x, y_arg, q, r);
  226|       |
  227|  64.6k|   r_out = r;
  228|  64.6k|   q_out = q;
  229|  64.6k|}
divide.cpp:_ZN5Botan12_GLOBAL__N_110sign_fixupERKNS_6BigIntES3_RS1_S4_:
   21|  66.9k|void sign_fixup(const BigInt& x, const BigInt& y, BigInt& q, BigInt& r) {
   22|  66.9k|   q.cond_flip_sign(x.sign() != y.sign());
   23|       |
   24|  66.9k|   if(x.is_negative() && r.is_nonzero()) {
  ------------------
  |  Branch (24:7): [True: 0, False: 66.9k]
  |  Branch (24:26): [True: 0, False: 0]
  ------------------
   25|      0|      q -= 1;
   26|      0|      r = y.abs() - r;
   27|      0|   }
   28|  66.9k|}
divide.cpp:_ZN5Botan12_GLOBAL__N_114division_checkEmmmmmm:
   30|   148k|inline bool division_check(word q, word y2, word y1, word x3, word x2, word x1) {
   31|       |   /*
   32|       |   Compute (y3,y2,y1) = (y2,y1) * q
   33|       |   and return true if (y3,y2,y1) > (x3,x2,x1)
   34|       |   */
   35|       |
   36|   148k|   word y3 = 0;
   37|   148k|   y1 = word_madd2(q, y1, &y3);
   38|   148k|   y2 = word_madd2(q, y2, &y3);
   39|       |
   40|   148k|   const word x[3] = {x1, x2, x3};
   41|   148k|   const word y[3] = {y1, y2, y3};
   42|       |
   43|   148k|   return bigint_ct_is_lt(x, 3, y, 3).is_set();
   44|   148k|}

_ZN5Botan17bigint_comba_sqr4EPmPKm:
   16|   866k|void bigint_comba_sqr4(word z[8], const word x[4]) {
   17|   866k|   word w2 = 0, w1 = 0, w0 = 0;
   18|       |
   19|   866k|   word3_muladd(&w2, &w1, &w0, x[0], x[0]);
   20|   866k|   z[0] = w0;
   21|   866k|   w0 = 0;
   22|       |
   23|   866k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[1]);
   24|   866k|   z[1] = w1;
   25|   866k|   w1 = 0;
   26|       |
   27|   866k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[2]);
   28|   866k|   word3_muladd(&w1, &w0, &w2, x[1], x[1]);
   29|   866k|   z[2] = w2;
   30|   866k|   w2 = 0;
   31|       |
   32|   866k|   word3_muladd_2(&w2, &w1, &w0, x[0], x[3]);
   33|   866k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[2]);
   34|   866k|   z[3] = w0;
   35|   866k|   w0 = 0;
   36|       |
   37|   866k|   word3_muladd_2(&w0, &w2, &w1, x[1], x[3]);
   38|   866k|   word3_muladd(&w0, &w2, &w1, x[2], x[2]);
   39|   866k|   z[4] = w1;
   40|   866k|   w1 = 0;
   41|       |
   42|   866k|   word3_muladd_2(&w1, &w0, &w2, x[2], x[3]);
   43|   866k|   z[5] = w2;
   44|   866k|   w2 = 0;
   45|       |
   46|   866k|   word3_muladd(&w2, &w1, &w0, x[3], x[3]);
   47|   866k|   z[6] = w0;
   48|   866k|   z[7] = w1;
   49|   866k|}
_ZN5Botan17bigint_comba_mul4EPmPKmS2_:
   54|   833k|void bigint_comba_mul4(word z[8], const word x[4], const word y[4]) {
   55|   833k|   word w2 = 0, w1 = 0, w0 = 0;
   56|       |
   57|   833k|   word3_muladd(&w2, &w1, &w0, x[0], y[0]);
   58|   833k|   z[0] = w0;
   59|   833k|   w0 = 0;
   60|       |
   61|   833k|   word3_muladd(&w0, &w2, &w1, x[0], y[1]);
   62|   833k|   word3_muladd(&w0, &w2, &w1, x[1], y[0]);
   63|   833k|   z[1] = w1;
   64|   833k|   w1 = 0;
   65|       |
   66|   833k|   word3_muladd(&w1, &w0, &w2, x[0], y[2]);
   67|   833k|   word3_muladd(&w1, &w0, &w2, x[1], y[1]);
   68|   833k|   word3_muladd(&w1, &w0, &w2, x[2], y[0]);
   69|   833k|   z[2] = w2;
   70|   833k|   w2 = 0;
   71|       |
   72|   833k|   word3_muladd(&w2, &w1, &w0, x[0], y[3]);
   73|   833k|   word3_muladd(&w2, &w1, &w0, x[1], y[2]);
   74|   833k|   word3_muladd(&w2, &w1, &w0, x[2], y[1]);
   75|   833k|   word3_muladd(&w2, &w1, &w0, x[3], y[0]);
   76|   833k|   z[3] = w0;
   77|   833k|   w0 = 0;
   78|       |
   79|   833k|   word3_muladd(&w0, &w2, &w1, x[1], y[3]);
   80|   833k|   word3_muladd(&w0, &w2, &w1, x[2], y[2]);
   81|   833k|   word3_muladd(&w0, &w2, &w1, x[3], y[1]);
   82|   833k|   z[4] = w1;
   83|   833k|   w1 = 0;
   84|       |
   85|   833k|   word3_muladd(&w1, &w0, &w2, x[2], y[3]);
   86|   833k|   word3_muladd(&w1, &w0, &w2, x[3], y[2]);
   87|   833k|   z[5] = w2;
   88|   833k|   w2 = 0;
   89|       |
   90|   833k|   word3_muladd(&w2, &w1, &w0, x[3], y[3]);
   91|   833k|   z[6] = w0;
   92|   833k|   z[7] = w1;
   93|   833k|}
_ZN5Botan17bigint_comba_sqr6EPmPKm:
   98|  1.69k|void bigint_comba_sqr6(word z[12], const word x[6]) {
   99|  1.69k|   word w2 = 0, w1 = 0, w0 = 0;
  100|       |
  101|  1.69k|   word3_muladd(&w2, &w1, &w0, x[0], x[0]);
  102|  1.69k|   z[0] = w0;
  103|  1.69k|   w0 = 0;
  104|       |
  105|  1.69k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[1]);
  106|  1.69k|   z[1] = w1;
  107|  1.69k|   w1 = 0;
  108|       |
  109|  1.69k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[2]);
  110|  1.69k|   word3_muladd(&w1, &w0, &w2, x[1], x[1]);
  111|  1.69k|   z[2] = w2;
  112|  1.69k|   w2 = 0;
  113|       |
  114|  1.69k|   word3_muladd_2(&w2, &w1, &w0, x[0], x[3]);
  115|  1.69k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[2]);
  116|  1.69k|   z[3] = w0;
  117|  1.69k|   w0 = 0;
  118|       |
  119|  1.69k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[4]);
  120|  1.69k|   word3_muladd_2(&w0, &w2, &w1, x[1], x[3]);
  121|  1.69k|   word3_muladd(&w0, &w2, &w1, x[2], x[2]);
  122|  1.69k|   z[4] = w1;
  123|  1.69k|   w1 = 0;
  124|       |
  125|  1.69k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[5]);
  126|  1.69k|   word3_muladd_2(&w1, &w0, &w2, x[1], x[4]);
  127|  1.69k|   word3_muladd_2(&w1, &w0, &w2, x[2], x[3]);
  128|  1.69k|   z[5] = w2;
  129|  1.69k|   w2 = 0;
  130|       |
  131|  1.69k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[5]);
  132|  1.69k|   word3_muladd_2(&w2, &w1, &w0, x[2], x[4]);
  133|  1.69k|   word3_muladd(&w2, &w1, &w0, x[3], x[3]);
  134|  1.69k|   z[6] = w0;
  135|  1.69k|   w0 = 0;
  136|       |
  137|  1.69k|   word3_muladd_2(&w0, &w2, &w1, x[2], x[5]);
  138|  1.69k|   word3_muladd_2(&w0, &w2, &w1, x[3], x[4]);
  139|  1.69k|   z[7] = w1;
  140|  1.69k|   w1 = 0;
  141|       |
  142|  1.69k|   word3_muladd_2(&w1, &w0, &w2, x[3], x[5]);
  143|  1.69k|   word3_muladd(&w1, &w0, &w2, x[4], x[4]);
  144|  1.69k|   z[8] = w2;
  145|  1.69k|   w2 = 0;
  146|       |
  147|  1.69k|   word3_muladd_2(&w2, &w1, &w0, x[4], x[5]);
  148|  1.69k|   z[9] = w0;
  149|  1.69k|   w0 = 0;
  150|       |
  151|  1.69k|   word3_muladd(&w0, &w2, &w1, x[5], x[5]);
  152|  1.69k|   z[10] = w1;
  153|  1.69k|   z[11] = w2;
  154|  1.69k|}
_ZN5Botan17bigint_comba_mul6EPmPKmS2_:
  159|  1.79k|void bigint_comba_mul6(word z[12], const word x[6], const word y[6]) {
  160|  1.79k|   word w2 = 0, w1 = 0, w0 = 0;
  161|       |
  162|  1.79k|   word3_muladd(&w2, &w1, &w0, x[0], y[0]);
  163|  1.79k|   z[0] = w0;
  164|  1.79k|   w0 = 0;
  165|       |
  166|  1.79k|   word3_muladd(&w0, &w2, &w1, x[0], y[1]);
  167|  1.79k|   word3_muladd(&w0, &w2, &w1, x[1], y[0]);
  168|  1.79k|   z[1] = w1;
  169|  1.79k|   w1 = 0;
  170|       |
  171|  1.79k|   word3_muladd(&w1, &w0, &w2, x[0], y[2]);
  172|  1.79k|   word3_muladd(&w1, &w0, &w2, x[1], y[1]);
  173|  1.79k|   word3_muladd(&w1, &w0, &w2, x[2], y[0]);
  174|  1.79k|   z[2] = w2;
  175|  1.79k|   w2 = 0;
  176|       |
  177|  1.79k|   word3_muladd(&w2, &w1, &w0, x[0], y[3]);
  178|  1.79k|   word3_muladd(&w2, &w1, &w0, x[1], y[2]);
  179|  1.79k|   word3_muladd(&w2, &w1, &w0, x[2], y[1]);
  180|  1.79k|   word3_muladd(&w2, &w1, &w0, x[3], y[0]);
  181|  1.79k|   z[3] = w0;
  182|  1.79k|   w0 = 0;
  183|       |
  184|  1.79k|   word3_muladd(&w0, &w2, &w1, x[0], y[4]);
  185|  1.79k|   word3_muladd(&w0, &w2, &w1, x[1], y[3]);
  186|  1.79k|   word3_muladd(&w0, &w2, &w1, x[2], y[2]);
  187|  1.79k|   word3_muladd(&w0, &w2, &w1, x[3], y[1]);
  188|  1.79k|   word3_muladd(&w0, &w2, &w1, x[4], y[0]);
  189|  1.79k|   z[4] = w1;
  190|  1.79k|   w1 = 0;
  191|       |
  192|  1.79k|   word3_muladd(&w1, &w0, &w2, x[0], y[5]);
  193|  1.79k|   word3_muladd(&w1, &w0, &w2, x[1], y[4]);
  194|  1.79k|   word3_muladd(&w1, &w0, &w2, x[2], y[3]);
  195|  1.79k|   word3_muladd(&w1, &w0, &w2, x[3], y[2]);
  196|  1.79k|   word3_muladd(&w1, &w0, &w2, x[4], y[1]);
  197|  1.79k|   word3_muladd(&w1, &w0, &w2, x[5], y[0]);
  198|  1.79k|   z[5] = w2;
  199|  1.79k|   w2 = 0;
  200|       |
  201|  1.79k|   word3_muladd(&w2, &w1, &w0, x[1], y[5]);
  202|  1.79k|   word3_muladd(&w2, &w1, &w0, x[2], y[4]);
  203|  1.79k|   word3_muladd(&w2, &w1, &w0, x[3], y[3]);
  204|  1.79k|   word3_muladd(&w2, &w1, &w0, x[4], y[2]);
  205|  1.79k|   word3_muladd(&w2, &w1, &w0, x[5], y[1]);
  206|  1.79k|   z[6] = w0;
  207|  1.79k|   w0 = 0;
  208|       |
  209|  1.79k|   word3_muladd(&w0, &w2, &w1, x[2], y[5]);
  210|  1.79k|   word3_muladd(&w0, &w2, &w1, x[3], y[4]);
  211|  1.79k|   word3_muladd(&w0, &w2, &w1, x[4], y[3]);
  212|  1.79k|   word3_muladd(&w0, &w2, &w1, x[5], y[2]);
  213|  1.79k|   z[7] = w1;
  214|  1.79k|   w1 = 0;
  215|       |
  216|  1.79k|   word3_muladd(&w1, &w0, &w2, x[3], y[5]);
  217|  1.79k|   word3_muladd(&w1, &w0, &w2, x[4], y[4]);
  218|  1.79k|   word3_muladd(&w1, &w0, &w2, x[5], y[3]);
  219|  1.79k|   z[8] = w2;
  220|  1.79k|   w2 = 0;
  221|       |
  222|  1.79k|   word3_muladd(&w2, &w1, &w0, x[4], y[5]);
  223|  1.79k|   word3_muladd(&w2, &w1, &w0, x[5], y[4]);
  224|  1.79k|   z[9] = w0;
  225|  1.79k|   w0 = 0;
  226|       |
  227|  1.79k|   word3_muladd(&w0, &w2, &w1, x[5], y[5]);
  228|  1.79k|   z[10] = w1;
  229|  1.79k|   z[11] = w2;
  230|  1.79k|}
_ZN5Botan17bigint_comba_sqr8EPmPKm:
  235|  4.17k|void bigint_comba_sqr8(word z[16], const word x[8]) {
  236|  4.17k|   word w2 = 0, w1 = 0, w0 = 0;
  237|       |
  238|  4.17k|   word3_muladd(&w2, &w1, &w0, x[0], x[0]);
  239|  4.17k|   z[0] = w0;
  240|  4.17k|   w0 = 0;
  241|       |
  242|  4.17k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[1]);
  243|  4.17k|   z[1] = w1;
  244|  4.17k|   w1 = 0;
  245|       |
  246|  4.17k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[2]);
  247|  4.17k|   word3_muladd(&w1, &w0, &w2, x[1], x[1]);
  248|  4.17k|   z[2] = w2;
  249|  4.17k|   w2 = 0;
  250|       |
  251|  4.17k|   word3_muladd_2(&w2, &w1, &w0, x[0], x[3]);
  252|  4.17k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[2]);
  253|  4.17k|   z[3] = w0;
  254|  4.17k|   w0 = 0;
  255|       |
  256|  4.17k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[4]);
  257|  4.17k|   word3_muladd_2(&w0, &w2, &w1, x[1], x[3]);
  258|  4.17k|   word3_muladd(&w0, &w2, &w1, x[2], x[2]);
  259|  4.17k|   z[4] = w1;
  260|  4.17k|   w1 = 0;
  261|       |
  262|  4.17k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[5]);
  263|  4.17k|   word3_muladd_2(&w1, &w0, &w2, x[1], x[4]);
  264|  4.17k|   word3_muladd_2(&w1, &w0, &w2, x[2], x[3]);
  265|  4.17k|   z[5] = w2;
  266|  4.17k|   w2 = 0;
  267|       |
  268|  4.17k|   word3_muladd_2(&w2, &w1, &w0, x[0], x[6]);
  269|  4.17k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[5]);
  270|  4.17k|   word3_muladd_2(&w2, &w1, &w0, x[2], x[4]);
  271|  4.17k|   word3_muladd(&w2, &w1, &w0, x[3], x[3]);
  272|  4.17k|   z[6] = w0;
  273|  4.17k|   w0 = 0;
  274|       |
  275|  4.17k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[7]);
  276|  4.17k|   word3_muladd_2(&w0, &w2, &w1, x[1], x[6]);
  277|  4.17k|   word3_muladd_2(&w0, &w2, &w1, x[2], x[5]);
  278|  4.17k|   word3_muladd_2(&w0, &w2, &w1, x[3], x[4]);
  279|  4.17k|   z[7] = w1;
  280|  4.17k|   w1 = 0;
  281|       |
  282|  4.17k|   word3_muladd_2(&w1, &w0, &w2, x[1], x[7]);
  283|  4.17k|   word3_muladd_2(&w1, &w0, &w2, x[2], x[6]);
  284|  4.17k|   word3_muladd_2(&w1, &w0, &w2, x[3], x[5]);
  285|  4.17k|   word3_muladd(&w1, &w0, &w2, x[4], x[4]);
  286|  4.17k|   z[8] = w2;
  287|  4.17k|   w2 = 0;
  288|       |
  289|  4.17k|   word3_muladd_2(&w2, &w1, &w0, x[2], x[7]);
  290|  4.17k|   word3_muladd_2(&w2, &w1, &w0, x[3], x[6]);
  291|  4.17k|   word3_muladd_2(&w2, &w1, &w0, x[4], x[5]);
  292|  4.17k|   z[9] = w0;
  293|  4.17k|   w0 = 0;
  294|       |
  295|  4.17k|   word3_muladd_2(&w0, &w2, &w1, x[3], x[7]);
  296|  4.17k|   word3_muladd_2(&w0, &w2, &w1, x[4], x[6]);
  297|  4.17k|   word3_muladd(&w0, &w2, &w1, x[5], x[5]);
  298|  4.17k|   z[10] = w1;
  299|  4.17k|   w1 = 0;
  300|       |
  301|  4.17k|   word3_muladd_2(&w1, &w0, &w2, x[4], x[7]);
  302|  4.17k|   word3_muladd_2(&w1, &w0, &w2, x[5], x[6]);
  303|  4.17k|   z[11] = w2;
  304|  4.17k|   w2 = 0;
  305|       |
  306|  4.17k|   word3_muladd_2(&w2, &w1, &w0, x[5], x[7]);
  307|  4.17k|   word3_muladd(&w2, &w1, &w0, x[6], x[6]);
  308|  4.17k|   z[12] = w0;
  309|  4.17k|   w0 = 0;
  310|       |
  311|  4.17k|   word3_muladd_2(&w0, &w2, &w1, x[6], x[7]);
  312|  4.17k|   z[13] = w1;
  313|  4.17k|   w1 = 0;
  314|       |
  315|  4.17k|   word3_muladd(&w1, &w0, &w2, x[7], x[7]);
  316|  4.17k|   z[14] = w2;
  317|  4.17k|   z[15] = w0;
  318|  4.17k|}
_ZN5Botan17bigint_comba_mul8EPmPKmS2_:
  323|  3.51k|void bigint_comba_mul8(word z[16], const word x[8], const word y[8]) {
  324|  3.51k|   word w2 = 0, w1 = 0, w0 = 0;
  325|       |
  326|  3.51k|   word3_muladd(&w2, &w1, &w0, x[0], y[0]);
  327|  3.51k|   z[0] = w0;
  328|  3.51k|   w0 = 0;
  329|       |
  330|  3.51k|   word3_muladd(&w0, &w2, &w1, x[0], y[1]);
  331|  3.51k|   word3_muladd(&w0, &w2, &w1, x[1], y[0]);
  332|  3.51k|   z[1] = w1;
  333|  3.51k|   w1 = 0;
  334|       |
  335|  3.51k|   word3_muladd(&w1, &w0, &w2, x[0], y[2]);
  336|  3.51k|   word3_muladd(&w1, &w0, &w2, x[1], y[1]);
  337|  3.51k|   word3_muladd(&w1, &w0, &w2, x[2], y[0]);
  338|  3.51k|   z[2] = w2;
  339|  3.51k|   w2 = 0;
  340|       |
  341|  3.51k|   word3_muladd(&w2, &w1, &w0, x[0], y[3]);
  342|  3.51k|   word3_muladd(&w2, &w1, &w0, x[1], y[2]);
  343|  3.51k|   word3_muladd(&w2, &w1, &w0, x[2], y[1]);
  344|  3.51k|   word3_muladd(&w2, &w1, &w0, x[3], y[0]);
  345|  3.51k|   z[3] = w0;
  346|  3.51k|   w0 = 0;
  347|       |
  348|  3.51k|   word3_muladd(&w0, &w2, &w1, x[0], y[4]);
  349|  3.51k|   word3_muladd(&w0, &w2, &w1, x[1], y[3]);
  350|  3.51k|   word3_muladd(&w0, &w2, &w1, x[2], y[2]);
  351|  3.51k|   word3_muladd(&w0, &w2, &w1, x[3], y[1]);
  352|  3.51k|   word3_muladd(&w0, &w2, &w1, x[4], y[0]);
  353|  3.51k|   z[4] = w1;
  354|  3.51k|   w1 = 0;
  355|       |
  356|  3.51k|   word3_muladd(&w1, &w0, &w2, x[0], y[5]);
  357|  3.51k|   word3_muladd(&w1, &w0, &w2, x[1], y[4]);
  358|  3.51k|   word3_muladd(&w1, &w0, &w2, x[2], y[3]);
  359|  3.51k|   word3_muladd(&w1, &w0, &w2, x[3], y[2]);
  360|  3.51k|   word3_muladd(&w1, &w0, &w2, x[4], y[1]);
  361|  3.51k|   word3_muladd(&w1, &w0, &w2, x[5], y[0]);
  362|  3.51k|   z[5] = w2;
  363|  3.51k|   w2 = 0;
  364|       |
  365|  3.51k|   word3_muladd(&w2, &w1, &w0, x[0], y[6]);
  366|  3.51k|   word3_muladd(&w2, &w1, &w0, x[1], y[5]);
  367|  3.51k|   word3_muladd(&w2, &w1, &w0, x[2], y[4]);
  368|  3.51k|   word3_muladd(&w2, &w1, &w0, x[3], y[3]);
  369|  3.51k|   word3_muladd(&w2, &w1, &w0, x[4], y[2]);
  370|  3.51k|   word3_muladd(&w2, &w1, &w0, x[5], y[1]);
  371|  3.51k|   word3_muladd(&w2, &w1, &w0, x[6], y[0]);
  372|  3.51k|   z[6] = w0;
  373|  3.51k|   w0 = 0;
  374|       |
  375|  3.51k|   word3_muladd(&w0, &w2, &w1, x[0], y[7]);
  376|  3.51k|   word3_muladd(&w0, &w2, &w1, x[1], y[6]);
  377|  3.51k|   word3_muladd(&w0, &w2, &w1, x[2], y[5]);
  378|  3.51k|   word3_muladd(&w0, &w2, &w1, x[3], y[4]);
  379|  3.51k|   word3_muladd(&w0, &w2, &w1, x[4], y[3]);
  380|  3.51k|   word3_muladd(&w0, &w2, &w1, x[5], y[2]);
  381|  3.51k|   word3_muladd(&w0, &w2, &w1, x[6], y[1]);
  382|  3.51k|   word3_muladd(&w0, &w2, &w1, x[7], y[0]);
  383|  3.51k|   z[7] = w1;
  384|  3.51k|   w1 = 0;
  385|       |
  386|  3.51k|   word3_muladd(&w1, &w0, &w2, x[1], y[7]);
  387|  3.51k|   word3_muladd(&w1, &w0, &w2, x[2], y[6]);
  388|  3.51k|   word3_muladd(&w1, &w0, &w2, x[3], y[5]);
  389|  3.51k|   word3_muladd(&w1, &w0, &w2, x[4], y[4]);
  390|  3.51k|   word3_muladd(&w1, &w0, &w2, x[5], y[3]);
  391|  3.51k|   word3_muladd(&w1, &w0, &w2, x[6], y[2]);
  392|  3.51k|   word3_muladd(&w1, &w0, &w2, x[7], y[1]);
  393|  3.51k|   z[8] = w2;
  394|  3.51k|   w2 = 0;
  395|       |
  396|  3.51k|   word3_muladd(&w2, &w1, &w0, x[2], y[7]);
  397|  3.51k|   word3_muladd(&w2, &w1, &w0, x[3], y[6]);
  398|  3.51k|   word3_muladd(&w2, &w1, &w0, x[4], y[5]);
  399|  3.51k|   word3_muladd(&w2, &w1, &w0, x[5], y[4]);
  400|  3.51k|   word3_muladd(&w2, &w1, &w0, x[6], y[3]);
  401|  3.51k|   word3_muladd(&w2, &w1, &w0, x[7], y[2]);
  402|  3.51k|   z[9] = w0;
  403|  3.51k|   w0 = 0;
  404|       |
  405|  3.51k|   word3_muladd(&w0, &w2, &w1, x[3], y[7]);
  406|  3.51k|   word3_muladd(&w0, &w2, &w1, x[4], y[6]);
  407|  3.51k|   word3_muladd(&w0, &w2, &w1, x[5], y[5]);
  408|  3.51k|   word3_muladd(&w0, &w2, &w1, x[6], y[4]);
  409|  3.51k|   word3_muladd(&w0, &w2, &w1, x[7], y[3]);
  410|  3.51k|   z[10] = w1;
  411|  3.51k|   w1 = 0;
  412|       |
  413|  3.51k|   word3_muladd(&w1, &w0, &w2, x[4], y[7]);
  414|  3.51k|   word3_muladd(&w1, &w0, &w2, x[5], y[6]);
  415|  3.51k|   word3_muladd(&w1, &w0, &w2, x[6], y[5]);
  416|  3.51k|   word3_muladd(&w1, &w0, &w2, x[7], y[4]);
  417|  3.51k|   z[11] = w2;
  418|  3.51k|   w2 = 0;
  419|       |
  420|  3.51k|   word3_muladd(&w2, &w1, &w0, x[5], y[7]);
  421|  3.51k|   word3_muladd(&w2, &w1, &w0, x[6], y[6]);
  422|  3.51k|   word3_muladd(&w2, &w1, &w0, x[7], y[5]);
  423|  3.51k|   z[12] = w0;
  424|  3.51k|   w0 = 0;
  425|       |
  426|  3.51k|   word3_muladd(&w0, &w2, &w1, x[6], y[7]);
  427|  3.51k|   word3_muladd(&w0, &w2, &w1, x[7], y[6]);
  428|  3.51k|   z[13] = w1;
  429|  3.51k|   w1 = 0;
  430|       |
  431|  3.51k|   word3_muladd(&w1, &w0, &w2, x[7], y[7]);
  432|  3.51k|   z[14] = w2;
  433|  3.51k|   z[15] = w0;
  434|  3.51k|}
_ZN5Botan17bigint_comba_sqr9EPmPKm:
  439|  2.23k|void bigint_comba_sqr9(word z[18], const word x[9]) {
  440|  2.23k|   word w2 = 0, w1 = 0, w0 = 0;
  441|       |
  442|  2.23k|   word3_muladd(&w2, &w1, &w0, x[0], x[0]);
  443|  2.23k|   z[0] = w0;
  444|  2.23k|   w0 = 0;
  445|       |
  446|  2.23k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[1]);
  447|  2.23k|   z[1] = w1;
  448|  2.23k|   w1 = 0;
  449|       |
  450|  2.23k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[2]);
  451|  2.23k|   word3_muladd(&w1, &w0, &w2, x[1], x[1]);
  452|  2.23k|   z[2] = w2;
  453|  2.23k|   w2 = 0;
  454|       |
  455|  2.23k|   word3_muladd_2(&w2, &w1, &w0, x[0], x[3]);
  456|  2.23k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[2]);
  457|  2.23k|   z[3] = w0;
  458|  2.23k|   w0 = 0;
  459|       |
  460|  2.23k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[4]);
  461|  2.23k|   word3_muladd_2(&w0, &w2, &w1, x[1], x[3]);
  462|  2.23k|   word3_muladd(&w0, &w2, &w1, x[2], x[2]);
  463|  2.23k|   z[4] = w1;
  464|  2.23k|   w1 = 0;
  465|       |
  466|  2.23k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[5]);
  467|  2.23k|   word3_muladd_2(&w1, &w0, &w2, x[1], x[4]);
  468|  2.23k|   word3_muladd_2(&w1, &w0, &w2, x[2], x[3]);
  469|  2.23k|   z[5] = w2;
  470|  2.23k|   w2 = 0;
  471|       |
  472|  2.23k|   word3_muladd_2(&w2, &w1, &w0, x[0], x[6]);
  473|  2.23k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[5]);
  474|  2.23k|   word3_muladd_2(&w2, &w1, &w0, x[2], x[4]);
  475|  2.23k|   word3_muladd(&w2, &w1, &w0, x[3], x[3]);
  476|  2.23k|   z[6] = w0;
  477|  2.23k|   w0 = 0;
  478|       |
  479|  2.23k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[7]);
  480|  2.23k|   word3_muladd_2(&w0, &w2, &w1, x[1], x[6]);
  481|  2.23k|   word3_muladd_2(&w0, &w2, &w1, x[2], x[5]);
  482|  2.23k|   word3_muladd_2(&w0, &w2, &w1, x[3], x[4]);
  483|  2.23k|   z[7] = w1;
  484|  2.23k|   w1 = 0;
  485|       |
  486|  2.23k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[8]);
  487|  2.23k|   word3_muladd_2(&w1, &w0, &w2, x[1], x[7]);
  488|  2.23k|   word3_muladd_2(&w1, &w0, &w2, x[2], x[6]);
  489|  2.23k|   word3_muladd_2(&w1, &w0, &w2, x[3], x[5]);
  490|  2.23k|   word3_muladd(&w1, &w0, &w2, x[4], x[4]);
  491|  2.23k|   z[8] = w2;
  492|  2.23k|   w2 = 0;
  493|       |
  494|  2.23k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[8]);
  495|  2.23k|   word3_muladd_2(&w2, &w1, &w0, x[2], x[7]);
  496|  2.23k|   word3_muladd_2(&w2, &w1, &w0, x[3], x[6]);
  497|  2.23k|   word3_muladd_2(&w2, &w1, &w0, x[4], x[5]);
  498|  2.23k|   z[9] = w0;
  499|  2.23k|   w0 = 0;
  500|       |
  501|  2.23k|   word3_muladd_2(&w0, &w2, &w1, x[2], x[8]);
  502|  2.23k|   word3_muladd_2(&w0, &w2, &w1, x[3], x[7]);
  503|  2.23k|   word3_muladd_2(&w0, &w2, &w1, x[4], x[6]);
  504|  2.23k|   word3_muladd(&w0, &w2, &w1, x[5], x[5]);
  505|  2.23k|   z[10] = w1;
  506|  2.23k|   w1 = 0;
  507|       |
  508|  2.23k|   word3_muladd_2(&w1, &w0, &w2, x[3], x[8]);
  509|  2.23k|   word3_muladd_2(&w1, &w0, &w2, x[4], x[7]);
  510|  2.23k|   word3_muladd_2(&w1, &w0, &w2, x[5], x[6]);
  511|  2.23k|   z[11] = w2;
  512|  2.23k|   w2 = 0;
  513|       |
  514|  2.23k|   word3_muladd_2(&w2, &w1, &w0, x[4], x[8]);
  515|  2.23k|   word3_muladd_2(&w2, &w1, &w0, x[5], x[7]);
  516|  2.23k|   word3_muladd(&w2, &w1, &w0, x[6], x[6]);
  517|  2.23k|   z[12] = w0;
  518|  2.23k|   w0 = 0;
  519|       |
  520|  2.23k|   word3_muladd_2(&w0, &w2, &w1, x[5], x[8]);
  521|  2.23k|   word3_muladd_2(&w0, &w2, &w1, x[6], x[7]);
  522|  2.23k|   z[13] = w1;
  523|  2.23k|   w1 = 0;
  524|       |
  525|  2.23k|   word3_muladd_2(&w1, &w0, &w2, x[6], x[8]);
  526|  2.23k|   word3_muladd(&w1, &w0, &w2, x[7], x[7]);
  527|  2.23k|   z[14] = w2;
  528|  2.23k|   w2 = 0;
  529|       |
  530|  2.23k|   word3_muladd_2(&w2, &w1, &w0, x[7], x[8]);
  531|  2.23k|   z[15] = w0;
  532|  2.23k|   w0 = 0;
  533|       |
  534|  2.23k|   word3_muladd(&w0, &w2, &w1, x[8], x[8]);
  535|  2.23k|   z[16] = w1;
  536|  2.23k|   z[17] = w2;
  537|  2.23k|}
_ZN5Botan17bigint_comba_mul9EPmPKmS2_:
  542|  1.95k|void bigint_comba_mul9(word z[18], const word x[9], const word y[9]) {
  543|  1.95k|   word w2 = 0, w1 = 0, w0 = 0;
  544|       |
  545|  1.95k|   word3_muladd(&w2, &w1, &w0, x[0], y[0]);
  546|  1.95k|   z[0] = w0;
  547|  1.95k|   w0 = 0;
  548|       |
  549|  1.95k|   word3_muladd(&w0, &w2, &w1, x[0], y[1]);
  550|  1.95k|   word3_muladd(&w0, &w2, &w1, x[1], y[0]);
  551|  1.95k|   z[1] = w1;
  552|  1.95k|   w1 = 0;
  553|       |
  554|  1.95k|   word3_muladd(&w1, &w0, &w2, x[0], y[2]);
  555|  1.95k|   word3_muladd(&w1, &w0, &w2, x[1], y[1]);
  556|  1.95k|   word3_muladd(&w1, &w0, &w2, x[2], y[0]);
  557|  1.95k|   z[2] = w2;
  558|  1.95k|   w2 = 0;
  559|       |
  560|  1.95k|   word3_muladd(&w2, &w1, &w0, x[0], y[3]);
  561|  1.95k|   word3_muladd(&w2, &w1, &w0, x[1], y[2]);
  562|  1.95k|   word3_muladd(&w2, &w1, &w0, x[2], y[1]);
  563|  1.95k|   word3_muladd(&w2, &w1, &w0, x[3], y[0]);
  564|  1.95k|   z[3] = w0;
  565|  1.95k|   w0 = 0;
  566|       |
  567|  1.95k|   word3_muladd(&w0, &w2, &w1, x[0], y[4]);
  568|  1.95k|   word3_muladd(&w0, &w2, &w1, x[1], y[3]);
  569|  1.95k|   word3_muladd(&w0, &w2, &w1, x[2], y[2]);
  570|  1.95k|   word3_muladd(&w0, &w2, &w1, x[3], y[1]);
  571|  1.95k|   word3_muladd(&w0, &w2, &w1, x[4], y[0]);
  572|  1.95k|   z[4] = w1;
  573|  1.95k|   w1 = 0;
  574|       |
  575|  1.95k|   word3_muladd(&w1, &w0, &w2, x[0], y[5]);
  576|  1.95k|   word3_muladd(&w1, &w0, &w2, x[1], y[4]);
  577|  1.95k|   word3_muladd(&w1, &w0, &w2, x[2], y[3]);
  578|  1.95k|   word3_muladd(&w1, &w0, &w2, x[3], y[2]);
  579|  1.95k|   word3_muladd(&w1, &w0, &w2, x[4], y[1]);
  580|  1.95k|   word3_muladd(&w1, &w0, &w2, x[5], y[0]);
  581|  1.95k|   z[5] = w2;
  582|  1.95k|   w2 = 0;
  583|       |
  584|  1.95k|   word3_muladd(&w2, &w1, &w0, x[0], y[6]);
  585|  1.95k|   word3_muladd(&w2, &w1, &w0, x[1], y[5]);
  586|  1.95k|   word3_muladd(&w2, &w1, &w0, x[2], y[4]);
  587|  1.95k|   word3_muladd(&w2, &w1, &w0, x[3], y[3]);
  588|  1.95k|   word3_muladd(&w2, &w1, &w0, x[4], y[2]);
  589|  1.95k|   word3_muladd(&w2, &w1, &w0, x[5], y[1]);
  590|  1.95k|   word3_muladd(&w2, &w1, &w0, x[6], y[0]);
  591|  1.95k|   z[6] = w0;
  592|  1.95k|   w0 = 0;
  593|       |
  594|  1.95k|   word3_muladd(&w0, &w2, &w1, x[0], y[7]);
  595|  1.95k|   word3_muladd(&w0, &w2, &w1, x[1], y[6]);
  596|  1.95k|   word3_muladd(&w0, &w2, &w1, x[2], y[5]);
  597|  1.95k|   word3_muladd(&w0, &w2, &w1, x[3], y[4]);
  598|  1.95k|   word3_muladd(&w0, &w2, &w1, x[4], y[3]);
  599|  1.95k|   word3_muladd(&w0, &w2, &w1, x[5], y[2]);
  600|  1.95k|   word3_muladd(&w0, &w2, &w1, x[6], y[1]);
  601|  1.95k|   word3_muladd(&w0, &w2, &w1, x[7], y[0]);
  602|  1.95k|   z[7] = w1;
  603|  1.95k|   w1 = 0;
  604|       |
  605|  1.95k|   word3_muladd(&w1, &w0, &w2, x[0], y[8]);
  606|  1.95k|   word3_muladd(&w1, &w0, &w2, x[1], y[7]);
  607|  1.95k|   word3_muladd(&w1, &w0, &w2, x[2], y[6]);
  608|  1.95k|   word3_muladd(&w1, &w0, &w2, x[3], y[5]);
  609|  1.95k|   word3_muladd(&w1, &w0, &w2, x[4], y[4]);
  610|  1.95k|   word3_muladd(&w1, &w0, &w2, x[5], y[3]);
  611|  1.95k|   word3_muladd(&w1, &w0, &w2, x[6], y[2]);
  612|  1.95k|   word3_muladd(&w1, &w0, &w2, x[7], y[1]);
  613|  1.95k|   word3_muladd(&w1, &w0, &w2, x[8], y[0]);
  614|  1.95k|   z[8] = w2;
  615|  1.95k|   w2 = 0;
  616|       |
  617|  1.95k|   word3_muladd(&w2, &w1, &w0, x[1], y[8]);
  618|  1.95k|   word3_muladd(&w2, &w1, &w0, x[2], y[7]);
  619|  1.95k|   word3_muladd(&w2, &w1, &w0, x[3], y[6]);
  620|  1.95k|   word3_muladd(&w2, &w1, &w0, x[4], y[5]);
  621|  1.95k|   word3_muladd(&w2, &w1, &w0, x[5], y[4]);
  622|  1.95k|   word3_muladd(&w2, &w1, &w0, x[6], y[3]);
  623|  1.95k|   word3_muladd(&w2, &w1, &w0, x[7], y[2]);
  624|  1.95k|   word3_muladd(&w2, &w1, &w0, x[8], y[1]);
  625|  1.95k|   z[9] = w0;
  626|  1.95k|   w0 = 0;
  627|       |
  628|  1.95k|   word3_muladd(&w0, &w2, &w1, x[2], y[8]);
  629|  1.95k|   word3_muladd(&w0, &w2, &w1, x[3], y[7]);
  630|  1.95k|   word3_muladd(&w0, &w2, &w1, x[4], y[6]);
  631|  1.95k|   word3_muladd(&w0, &w2, &w1, x[5], y[5]);
  632|  1.95k|   word3_muladd(&w0, &w2, &w1, x[6], y[4]);
  633|  1.95k|   word3_muladd(&w0, &w2, &w1, x[7], y[3]);
  634|  1.95k|   word3_muladd(&w0, &w2, &w1, x[8], y[2]);
  635|  1.95k|   z[10] = w1;
  636|  1.95k|   w1 = 0;
  637|       |
  638|  1.95k|   word3_muladd(&w1, &w0, &w2, x[3], y[8]);
  639|  1.95k|   word3_muladd(&w1, &w0, &w2, x[4], y[7]);
  640|  1.95k|   word3_muladd(&w1, &w0, &w2, x[5], y[6]);
  641|  1.95k|   word3_muladd(&w1, &w0, &w2, x[6], y[5]);
  642|  1.95k|   word3_muladd(&w1, &w0, &w2, x[7], y[4]);
  643|  1.95k|   word3_muladd(&w1, &w0, &w2, x[8], y[3]);
  644|  1.95k|   z[11] = w2;
  645|  1.95k|   w2 = 0;
  646|       |
  647|  1.95k|   word3_muladd(&w2, &w1, &w0, x[4], y[8]);
  648|  1.95k|   word3_muladd(&w2, &w1, &w0, x[5], y[7]);
  649|  1.95k|   word3_muladd(&w2, &w1, &w0, x[6], y[6]);
  650|  1.95k|   word3_muladd(&w2, &w1, &w0, x[7], y[5]);
  651|  1.95k|   word3_muladd(&w2, &w1, &w0, x[8], y[4]);
  652|  1.95k|   z[12] = w0;
  653|  1.95k|   w0 = 0;
  654|       |
  655|  1.95k|   word3_muladd(&w0, &w2, &w1, x[5], y[8]);
  656|  1.95k|   word3_muladd(&w0, &w2, &w1, x[6], y[7]);
  657|  1.95k|   word3_muladd(&w0, &w2, &w1, x[7], y[6]);
  658|  1.95k|   word3_muladd(&w0, &w2, &w1, x[8], y[5]);
  659|  1.95k|   z[13] = w1;
  660|  1.95k|   w1 = 0;
  661|       |
  662|  1.95k|   word3_muladd(&w1, &w0, &w2, x[6], y[8]);
  663|  1.95k|   word3_muladd(&w1, &w0, &w2, x[7], y[7]);
  664|  1.95k|   word3_muladd(&w1, &w0, &w2, x[8], y[6]);
  665|  1.95k|   z[14] = w2;
  666|  1.95k|   w2 = 0;
  667|       |
  668|  1.95k|   word3_muladd(&w2, &w1, &w0, x[7], y[8]);
  669|  1.95k|   word3_muladd(&w2, &w1, &w0, x[8], y[7]);
  670|  1.95k|   z[15] = w0;
  671|  1.95k|   w0 = 0;
  672|       |
  673|  1.95k|   word3_muladd(&w0, &w2, &w1, x[8], y[8]);
  674|  1.95k|   z[16] = w1;
  675|  1.95k|   z[17] = w2;
  676|  1.95k|}
_ZN5Botan18bigint_comba_sqr16EPmPKm:
  681|  1.94k|void bigint_comba_sqr16(word z[32], const word x[16]) {
  682|  1.94k|   word w2 = 0, w1 = 0, w0 = 0;
  683|       |
  684|  1.94k|   word3_muladd(&w2, &w1, &w0, x[0], x[0]);
  685|  1.94k|   z[0] = w0;
  686|  1.94k|   w0 = 0;
  687|       |
  688|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[1]);
  689|  1.94k|   z[1] = w1;
  690|  1.94k|   w1 = 0;
  691|       |
  692|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[2]);
  693|  1.94k|   word3_muladd(&w1, &w0, &w2, x[1], x[1]);
  694|  1.94k|   z[2] = w2;
  695|  1.94k|   w2 = 0;
  696|       |
  697|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[0], x[3]);
  698|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[2]);
  699|  1.94k|   z[3] = w0;
  700|  1.94k|   w0 = 0;
  701|       |
  702|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[4]);
  703|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[1], x[3]);
  704|  1.94k|   word3_muladd(&w0, &w2, &w1, x[2], x[2]);
  705|  1.94k|   z[4] = w1;
  706|  1.94k|   w1 = 0;
  707|       |
  708|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[5]);
  709|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[1], x[4]);
  710|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[2], x[3]);
  711|  1.94k|   z[5] = w2;
  712|  1.94k|   w2 = 0;
  713|       |
  714|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[0], x[6]);
  715|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[5]);
  716|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[2], x[4]);
  717|  1.94k|   word3_muladd(&w2, &w1, &w0, x[3], x[3]);
  718|  1.94k|   z[6] = w0;
  719|  1.94k|   w0 = 0;
  720|       |
  721|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[7]);
  722|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[1], x[6]);
  723|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[2], x[5]);
  724|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[3], x[4]);
  725|  1.94k|   z[7] = w1;
  726|  1.94k|   w1 = 0;
  727|       |
  728|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[8]);
  729|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[1], x[7]);
  730|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[2], x[6]);
  731|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[3], x[5]);
  732|  1.94k|   word3_muladd(&w1, &w0, &w2, x[4], x[4]);
  733|  1.94k|   z[8] = w2;
  734|  1.94k|   w2 = 0;
  735|       |
  736|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[0], x[9]);
  737|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[8]);
  738|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[2], x[7]);
  739|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[3], x[6]);
  740|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[4], x[5]);
  741|  1.94k|   z[9] = w0;
  742|  1.94k|   w0 = 0;
  743|       |
  744|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[10]);
  745|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[1], x[9]);
  746|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[2], x[8]);
  747|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[3], x[7]);
  748|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[4], x[6]);
  749|  1.94k|   word3_muladd(&w0, &w2, &w1, x[5], x[5]);
  750|  1.94k|   z[10] = w1;
  751|  1.94k|   w1 = 0;
  752|       |
  753|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[11]);
  754|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[1], x[10]);
  755|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[2], x[9]);
  756|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[3], x[8]);
  757|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[4], x[7]);
  758|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[5], x[6]);
  759|  1.94k|   z[11] = w2;
  760|  1.94k|   w2 = 0;
  761|       |
  762|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[0], x[12]);
  763|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[11]);
  764|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[2], x[10]);
  765|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[3], x[9]);
  766|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[4], x[8]);
  767|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[5], x[7]);
  768|  1.94k|   word3_muladd(&w2, &w1, &w0, x[6], x[6]);
  769|  1.94k|   z[12] = w0;
  770|  1.94k|   w0 = 0;
  771|       |
  772|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[0], x[13]);
  773|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[1], x[12]);
  774|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[2], x[11]);
  775|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[3], x[10]);
  776|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[4], x[9]);
  777|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[5], x[8]);
  778|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[6], x[7]);
  779|  1.94k|   z[13] = w1;
  780|  1.94k|   w1 = 0;
  781|       |
  782|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[0], x[14]);
  783|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[1], x[13]);
  784|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[2], x[12]);
  785|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[3], x[11]);
  786|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[4], x[10]);
  787|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[5], x[9]);
  788|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[6], x[8]);
  789|  1.94k|   word3_muladd(&w1, &w0, &w2, x[7], x[7]);
  790|  1.94k|   z[14] = w2;
  791|  1.94k|   w2 = 0;
  792|       |
  793|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[0], x[15]);
  794|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[1], x[14]);
  795|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[2], x[13]);
  796|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[3], x[12]);
  797|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[4], x[11]);
  798|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[5], x[10]);
  799|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[6], x[9]);
  800|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[7], x[8]);
  801|  1.94k|   z[15] = w0;
  802|  1.94k|   w0 = 0;
  803|       |
  804|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[1], x[15]);
  805|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[2], x[14]);
  806|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[3], x[13]);
  807|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[4], x[12]);
  808|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[5], x[11]);
  809|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[6], x[10]);
  810|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[7], x[9]);
  811|  1.94k|   word3_muladd(&w0, &w2, &w1, x[8], x[8]);
  812|  1.94k|   z[16] = w1;
  813|  1.94k|   w1 = 0;
  814|       |
  815|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[2], x[15]);
  816|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[3], x[14]);
  817|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[4], x[13]);
  818|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[5], x[12]);
  819|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[6], x[11]);
  820|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[7], x[10]);
  821|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[8], x[9]);
  822|  1.94k|   z[17] = w2;
  823|  1.94k|   w2 = 0;
  824|       |
  825|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[3], x[15]);
  826|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[4], x[14]);
  827|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[5], x[13]);
  828|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[6], x[12]);
  829|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[7], x[11]);
  830|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[8], x[10]);
  831|  1.94k|   word3_muladd(&w2, &w1, &w0, x[9], x[9]);
  832|  1.94k|   z[18] = w0;
  833|  1.94k|   w0 = 0;
  834|       |
  835|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[4], x[15]);
  836|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[5], x[14]);
  837|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[6], x[13]);
  838|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[7], x[12]);
  839|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[8], x[11]);
  840|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[9], x[10]);
  841|  1.94k|   z[19] = w1;
  842|  1.94k|   w1 = 0;
  843|       |
  844|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[5], x[15]);
  845|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[6], x[14]);
  846|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[7], x[13]);
  847|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[8], x[12]);
  848|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[9], x[11]);
  849|  1.94k|   word3_muladd(&w1, &w0, &w2, x[10], x[10]);
  850|  1.94k|   z[20] = w2;
  851|  1.94k|   w2 = 0;
  852|       |
  853|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[6], x[15]);
  854|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[7], x[14]);
  855|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[8], x[13]);
  856|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[9], x[12]);
  857|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[10], x[11]);
  858|  1.94k|   z[21] = w0;
  859|  1.94k|   w0 = 0;
  860|       |
  861|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[7], x[15]);
  862|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[8], x[14]);
  863|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[9], x[13]);
  864|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[10], x[12]);
  865|  1.94k|   word3_muladd(&w0, &w2, &w1, x[11], x[11]);
  866|  1.94k|   z[22] = w1;
  867|  1.94k|   w1 = 0;
  868|       |
  869|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[8], x[15]);
  870|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[9], x[14]);
  871|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[10], x[13]);
  872|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[11], x[12]);
  873|  1.94k|   z[23] = w2;
  874|  1.94k|   w2 = 0;
  875|       |
  876|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[9], x[15]);
  877|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[10], x[14]);
  878|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[11], x[13]);
  879|  1.94k|   word3_muladd(&w2, &w1, &w0, x[12], x[12]);
  880|  1.94k|   z[24] = w0;
  881|  1.94k|   w0 = 0;
  882|       |
  883|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[10], x[15]);
  884|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[11], x[14]);
  885|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[12], x[13]);
  886|  1.94k|   z[25] = w1;
  887|  1.94k|   w1 = 0;
  888|       |
  889|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[11], x[15]);
  890|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[12], x[14]);
  891|  1.94k|   word3_muladd(&w1, &w0, &w2, x[13], x[13]);
  892|  1.94k|   z[26] = w2;
  893|  1.94k|   w2 = 0;
  894|       |
  895|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[12], x[15]);
  896|  1.94k|   word3_muladd_2(&w2, &w1, &w0, x[13], x[14]);
  897|  1.94k|   z[27] = w0;
  898|  1.94k|   w0 = 0;
  899|       |
  900|  1.94k|   word3_muladd_2(&w0, &w2, &w1, x[13], x[15]);
  901|  1.94k|   word3_muladd(&w0, &w2, &w1, x[14], x[14]);
  902|  1.94k|   z[28] = w1;
  903|  1.94k|   w1 = 0;
  904|       |
  905|  1.94k|   word3_muladd_2(&w1, &w0, &w2, x[14], x[15]);
  906|  1.94k|   z[29] = w2;
  907|  1.94k|   w2 = 0;
  908|       |
  909|  1.94k|   word3_muladd(&w2, &w1, &w0, x[15], x[15]);
  910|  1.94k|   z[30] = w0;
  911|  1.94k|   z[31] = w1;
  912|  1.94k|}
_ZN5Botan18bigint_comba_mul16EPmPKmS2_:
  917|  1.26k|void bigint_comba_mul16(word z[32], const word x[16], const word y[16]) {
  918|  1.26k|   word w2 = 0, w1 = 0, w0 = 0;
  919|       |
  920|  1.26k|   word3_muladd(&w2, &w1, &w0, x[0], y[0]);
  921|  1.26k|   z[0] = w0;
  922|  1.26k|   w0 = 0;
  923|       |
  924|  1.26k|   word3_muladd(&w0, &w2, &w1, x[0], y[1]);
  925|  1.26k|   word3_muladd(&w0, &w2, &w1, x[1], y[0]);
  926|  1.26k|   z[1] = w1;
  927|  1.26k|   w1 = 0;
  928|       |
  929|  1.26k|   word3_muladd(&w1, &w0, &w2, x[0], y[2]);
  930|  1.26k|   word3_muladd(&w1, &w0, &w2, x[1], y[1]);
  931|  1.26k|   word3_muladd(&w1, &w0, &w2, x[2], y[0]);
  932|  1.26k|   z[2] = w2;
  933|  1.26k|   w2 = 0;
  934|       |
  935|  1.26k|   word3_muladd(&w2, &w1, &w0, x[0], y[3]);
  936|  1.26k|   word3_muladd(&w2, &w1, &w0, x[1], y[2]);
  937|  1.26k|   word3_muladd(&w2, &w1, &w0, x[2], y[1]);
  938|  1.26k|   word3_muladd(&w2, &w1, &w0, x[3], y[0]);
  939|  1.26k|   z[3] = w0;
  940|  1.26k|   w0 = 0;
  941|       |
  942|  1.26k|   word3_muladd(&w0, &w2, &w1, x[0], y[4]);
  943|  1.26k|   word3_muladd(&w0, &w2, &w1, x[1], y[3]);
  944|  1.26k|   word3_muladd(&w0, &w2, &w1, x[2], y[2]);
  945|  1.26k|   word3_muladd(&w0, &w2, &w1, x[3], y[1]);
  946|  1.26k|   word3_muladd(&w0, &w2, &w1, x[4], y[0]);
  947|  1.26k|   z[4] = w1;
  948|  1.26k|   w1 = 0;
  949|       |
  950|  1.26k|   word3_muladd(&w1, &w0, &w2, x[0], y[5]);
  951|  1.26k|   word3_muladd(&w1, &w0, &w2, x[1], y[4]);
  952|  1.26k|   word3_muladd(&w1, &w0, &w2, x[2], y[3]);
  953|  1.26k|   word3_muladd(&w1, &w0, &w2, x[3], y[2]);
  954|  1.26k|   word3_muladd(&w1, &w0, &w2, x[4], y[1]);
  955|  1.26k|   word3_muladd(&w1, &w0, &w2, x[5], y[0]);
  956|  1.26k|   z[5] = w2;
  957|  1.26k|   w2 = 0;
  958|       |
  959|  1.26k|   word3_muladd(&w2, &w1, &w0, x[0], y[6]);
  960|  1.26k|   word3_muladd(&w2, &w1, &w0, x[1], y[5]);
  961|  1.26k|   word3_muladd(&w2, &w1, &w0, x[2], y[4]);
  962|  1.26k|   word3_muladd(&w2, &w1, &w0, x[3], y[3]);
  963|  1.26k|   word3_muladd(&w2, &w1, &w0, x[4], y[2]);
  964|  1.26k|   word3_muladd(&w2, &w1, &w0, x[5], y[1]);
  965|  1.26k|   word3_muladd(&w2, &w1, &w0, x[6], y[0]);
  966|  1.26k|   z[6] = w0;
  967|  1.26k|   w0 = 0;
  968|       |
  969|  1.26k|   word3_muladd(&w0, &w2, &w1, x[0], y[7]);
  970|  1.26k|   word3_muladd(&w0, &w2, &w1, x[1], y[6]);
  971|  1.26k|   word3_muladd(&w0, &w2, &w1, x[2], y[5]);
  972|  1.26k|   word3_muladd(&w0, &w2, &w1, x[3], y[4]);
  973|  1.26k|   word3_muladd(&w0, &w2, &w1, x[4], y[3]);
  974|  1.26k|   word3_muladd(&w0, &w2, &w1, x[5], y[2]);
  975|  1.26k|   word3_muladd(&w0, &w2, &w1, x[6], y[1]);
  976|  1.26k|   word3_muladd(&w0, &w2, &w1, x[7], y[0]);
  977|  1.26k|   z[7] = w1;
  978|  1.26k|   w1 = 0;
  979|       |
  980|  1.26k|   word3_muladd(&w1, &w0, &w2, x[0], y[8]);
  981|  1.26k|   word3_muladd(&w1, &w0, &w2, x[1], y[7]);
  982|  1.26k|   word3_muladd(&w1, &w0, &w2, x[2], y[6]);
  983|  1.26k|   word3_muladd(&w1, &w0, &w2, x[3], y[5]);
  984|  1.26k|   word3_muladd(&w1, &w0, &w2, x[4], y[4]);
  985|  1.26k|   word3_muladd(&w1, &w0, &w2, x[5], y[3]);
  986|  1.26k|   word3_muladd(&w1, &w0, &w2, x[6], y[2]);
  987|  1.26k|   word3_muladd(&w1, &w0, &w2, x[7], y[1]);
  988|  1.26k|   word3_muladd(&w1, &w0, &w2, x[8], y[0]);
  989|  1.26k|   z[8] = w2;
  990|  1.26k|   w2 = 0;
  991|       |
  992|  1.26k|   word3_muladd(&w2, &w1, &w0, x[0], y[9]);
  993|  1.26k|   word3_muladd(&w2, &w1, &w0, x[1], y[8]);
  994|  1.26k|   word3_muladd(&w2, &w1, &w0, x[2], y[7]);
  995|  1.26k|   word3_muladd(&w2, &w1, &w0, x[3], y[6]);
  996|  1.26k|   word3_muladd(&w2, &w1, &w0, x[4], y[5]);
  997|  1.26k|   word3_muladd(&w2, &w1, &w0, x[5], y[4]);
  998|  1.26k|   word3_muladd(&w2, &w1, &w0, x[6], y[3]);
  999|  1.26k|   word3_muladd(&w2, &w1, &w0, x[7], y[2]);
 1000|  1.26k|   word3_muladd(&w2, &w1, &w0, x[8], y[1]);
 1001|  1.26k|   word3_muladd(&w2, &w1, &w0, x[9], y[0]);
 1002|  1.26k|   z[9] = w0;
 1003|  1.26k|   w0 = 0;
 1004|       |
 1005|  1.26k|   word3_muladd(&w0, &w2, &w1, x[0], y[10]);
 1006|  1.26k|   word3_muladd(&w0, &w2, &w1, x[1], y[9]);
 1007|  1.26k|   word3_muladd(&w0, &w2, &w1, x[2], y[8]);
 1008|  1.26k|   word3_muladd(&w0, &w2, &w1, x[3], y[7]);
 1009|  1.26k|   word3_muladd(&w0, &w2, &w1, x[4], y[6]);
 1010|  1.26k|   word3_muladd(&w0, &w2, &w1, x[5], y[5]);
 1011|  1.26k|   word3_muladd(&w0, &w2, &w1, x[6], y[4]);
 1012|  1.26k|   word3_muladd(&w0, &w2, &w1, x[7], y[3]);
 1013|  1.26k|   word3_muladd(&w0, &w2, &w1, x[8], y[2]);
 1014|  1.26k|   word3_muladd(&w0, &w2, &w1, x[9], y[1]);
 1015|  1.26k|   word3_muladd(&w0, &w2, &w1, x[10], y[0]);
 1016|  1.26k|   z[10] = w1;
 1017|  1.26k|   w1 = 0;
 1018|       |
 1019|  1.26k|   word3_muladd(&w1, &w0, &w2, x[0], y[11]);
 1020|  1.26k|   word3_muladd(&w1, &w0, &w2, x[1], y[10]);
 1021|  1.26k|   word3_muladd(&w1, &w0, &w2, x[2], y[9]);
 1022|  1.26k|   word3_muladd(&w1, &w0, &w2, x[3], y[8]);
 1023|  1.26k|   word3_muladd(&w1, &w0, &w2, x[4], y[7]);
 1024|  1.26k|   word3_muladd(&w1, &w0, &w2, x[5], y[6]);
 1025|  1.26k|   word3_muladd(&w1, &w0, &w2, x[6], y[5]);
 1026|  1.26k|   word3_muladd(&w1, &w0, &w2, x[7], y[4]);
 1027|  1.26k|   word3_muladd(&w1, &w0, &w2, x[8], y[3]);
 1028|  1.26k|   word3_muladd(&w1, &w0, &w2, x[9], y[2]);
 1029|  1.26k|   word3_muladd(&w1, &w0, &w2, x[10], y[1]);
 1030|  1.26k|   word3_muladd(&w1, &w0, &w2, x[11], y[0]);
 1031|  1.26k|   z[11] = w2;
 1032|  1.26k|   w2 = 0;
 1033|       |
 1034|  1.26k|   word3_muladd(&w2, &w1, &w0, x[0], y[12]);
 1035|  1.26k|   word3_muladd(&w2, &w1, &w0, x[1], y[11]);
 1036|  1.26k|   word3_muladd(&w2, &w1, &w0, x[2], y[10]);
 1037|  1.26k|   word3_muladd(&w2, &w1, &w0, x[3], y[9]);
 1038|  1.26k|   word3_muladd(&w2, &w1, &w0, x[4], y[8]);
 1039|  1.26k|   word3_muladd(&w2, &w1, &w0, x[5], y[7]);
 1040|  1.26k|   word3_muladd(&w2, &w1, &w0, x[6], y[6]);
 1041|  1.26k|   word3_muladd(&w2, &w1, &w0, x[7], y[5]);
 1042|  1.26k|   word3_muladd(&w2, &w1, &w0, x[8], y[4]);
 1043|  1.26k|   word3_muladd(&w2, &w1, &w0, x[9], y[3]);
 1044|  1.26k|   word3_muladd(&w2, &w1, &w0, x[10], y[2]);
 1045|  1.26k|   word3_muladd(&w2, &w1, &w0, x[11], y[1]);
 1046|  1.26k|   word3_muladd(&w2, &w1, &w0, x[12], y[0]);
 1047|  1.26k|   z[12] = w0;
 1048|  1.26k|   w0 = 0;
 1049|       |
 1050|  1.26k|   word3_muladd(&w0, &w2, &w1, x[0], y[13]);
 1051|  1.26k|   word3_muladd(&w0, &w2, &w1, x[1], y[12]);
 1052|  1.26k|   word3_muladd(&w0, &w2, &w1, x[2], y[11]);
 1053|  1.26k|   word3_muladd(&w0, &w2, &w1, x[3], y[10]);
 1054|  1.26k|   word3_muladd(&w0, &w2, &w1, x[4], y[9]);
 1055|  1.26k|   word3_muladd(&w0, &w2, &w1, x[5], y[8]);
 1056|  1.26k|   word3_muladd(&w0, &w2, &w1, x[6], y[7]);
 1057|  1.26k|   word3_muladd(&w0, &w2, &w1, x[7], y[6]);
 1058|  1.26k|   word3_muladd(&w0, &w2, &w1, x[8], y[5]);
 1059|  1.26k|   word3_muladd(&w0, &w2, &w1, x[9], y[4]);
 1060|  1.26k|   word3_muladd(&w0, &w2, &w1, x[10], y[3]);
 1061|  1.26k|   word3_muladd(&w0, &w2, &w1, x[11], y[2]);
 1062|  1.26k|   word3_muladd(&w0, &w2, &w1, x[12], y[1]);
 1063|  1.26k|   word3_muladd(&w0, &w2, &w1, x[13], y[0]);
 1064|  1.26k|   z[13] = w1;
 1065|  1.26k|   w1 = 0;
 1066|       |
 1067|  1.26k|   word3_muladd(&w1, &w0, &w2, x[0], y[14]);
 1068|  1.26k|   word3_muladd(&w1, &w0, &w2, x[1], y[13]);
 1069|  1.26k|   word3_muladd(&w1, &w0, &w2, x[2], y[12]);
 1070|  1.26k|   word3_muladd(&w1, &w0, &w2, x[3], y[11]);
 1071|  1.26k|   word3_muladd(&w1, &w0, &w2, x[4], y[10]);
 1072|  1.26k|   word3_muladd(&w1, &w0, &w2, x[5], y[9]);
 1073|  1.26k|   word3_muladd(&w1, &w0, &w2, x[6], y[8]);
 1074|  1.26k|   word3_muladd(&w1, &w0, &w2, x[7], y[7]);
 1075|  1.26k|   word3_muladd(&w1, &w0, &w2, x[8], y[6]);
 1076|  1.26k|   word3_muladd(&w1, &w0, &w2, x[9], y[5]);
 1077|  1.26k|   word3_muladd(&w1, &w0, &w2, x[10], y[4]);
 1078|  1.26k|   word3_muladd(&w1, &w0, &w2, x[11], y[3]);
 1079|  1.26k|   word3_muladd(&w1, &w0, &w2, x[12], y[2]);
 1080|  1.26k|   word3_muladd(&w1, &w0, &w2, x[13], y[1]);
 1081|  1.26k|   word3_muladd(&w1, &w0, &w2, x[14], y[0]);
 1082|  1.26k|   z[14] = w2;
 1083|  1.26k|   w2 = 0;
 1084|       |
 1085|  1.26k|   word3_muladd(&w2, &w1, &w0, x[0], y[15]);
 1086|  1.26k|   word3_muladd(&w2, &w1, &w0, x[1], y[14]);
 1087|  1.26k|   word3_muladd(&w2, &w1, &w0, x[2], y[13]);
 1088|  1.26k|   word3_muladd(&w2, &w1, &w0, x[3], y[12]);
 1089|  1.26k|   word3_muladd(&w2, &w1, &w0, x[4], y[11]);
 1090|  1.26k|   word3_muladd(&w2, &w1, &w0, x[5], y[10]);
 1091|  1.26k|   word3_muladd(&w2, &w1, &w0, x[6], y[9]);
 1092|  1.26k|   word3_muladd(&w2, &w1, &w0, x[7], y[8]);
 1093|  1.26k|   word3_muladd(&w2, &w1, &w0, x[8], y[7]);
 1094|  1.26k|   word3_muladd(&w2, &w1, &w0, x[9], y[6]);
 1095|  1.26k|   word3_muladd(&w2, &w1, &w0, x[10], y[5]);
 1096|  1.26k|   word3_muladd(&w2, &w1, &w0, x[11], y[4]);
 1097|  1.26k|   word3_muladd(&w2, &w1, &w0, x[12], y[3]);
 1098|  1.26k|   word3_muladd(&w2, &w1, &w0, x[13], y[2]);
 1099|  1.26k|   word3_muladd(&w2, &w1, &w0, x[14], y[1]);
 1100|  1.26k|   word3_muladd(&w2, &w1, &w0, x[15], y[0]);
 1101|  1.26k|   z[15] = w0;
 1102|  1.26k|   w0 = 0;
 1103|       |
 1104|  1.26k|   word3_muladd(&w0, &w2, &w1, x[1], y[15]);
 1105|  1.26k|   word3_muladd(&w0, &w2, &w1, x[2], y[14]);
 1106|  1.26k|   word3_muladd(&w0, &w2, &w1, x[3], y[13]);
 1107|  1.26k|   word3_muladd(&w0, &w2, &w1, x[4], y[12]);
 1108|  1.26k|   word3_muladd(&w0, &w2, &w1, x[5], y[11]);
 1109|  1.26k|   word3_muladd(&w0, &w2, &w1, x[6], y[10]);
 1110|  1.26k|   word3_muladd(&w0, &w2, &w1, x[7], y[9]);
 1111|  1.26k|   word3_muladd(&w0, &w2, &w1, x[8], y[8]);
 1112|  1.26k|   word3_muladd(&w0, &w2, &w1, x[9], y[7]);
 1113|  1.26k|   word3_muladd(&w0, &w2, &w1, x[10], y[6]);
 1114|  1.26k|   word3_muladd(&w0, &w2, &w1, x[11], y[5]);
 1115|  1.26k|   word3_muladd(&w0, &w2, &w1, x[12], y[4]);
 1116|  1.26k|   word3_muladd(&w0, &w2, &w1, x[13], y[3]);
 1117|  1.26k|   word3_muladd(&w0, &w2, &w1, x[14], y[2]);
 1118|  1.26k|   word3_muladd(&w0, &w2, &w1, x[15], y[1]);
 1119|  1.26k|   z[16] = w1;
 1120|  1.26k|   w1 = 0;
 1121|       |
 1122|  1.26k|   word3_muladd(&w1, &w0, &w2, x[2], y[15]);
 1123|  1.26k|   word3_muladd(&w1, &w0, &w2, x[3], y[14]);
 1124|  1.26k|   word3_muladd(&w1, &w0, &w2, x[4], y[13]);
 1125|  1.26k|   word3_muladd(&w1, &w0, &w2, x[5], y[12]);
 1126|  1.26k|   word3_muladd(&w1, &w0, &w2, x[6], y[11]);
 1127|  1.26k|   word3_muladd(&w1, &w0, &w2, x[7], y[10]);
 1128|  1.26k|   word3_muladd(&w1, &w0, &w2, x[8], y[9]);
 1129|  1.26k|   word3_muladd(&w1, &w0, &w2, x[9], y[8]);
 1130|  1.26k|   word3_muladd(&w1, &w0, &w2, x[10], y[7]);
 1131|  1.26k|   word3_muladd(&w1, &w0, &w2, x[11], y[6]);
 1132|  1.26k|   word3_muladd(&w1, &w0, &w2, x[12], y[5]);
 1133|  1.26k|   word3_muladd(&w1, &w0, &w2, x[13], y[4]);
 1134|  1.26k|   word3_muladd(&w1, &w0, &w2, x[14], y[3]);
 1135|  1.26k|   word3_muladd(&w1, &w0, &w2, x[15], y[2]);
 1136|  1.26k|   z[17] = w2;
 1137|  1.26k|   w2 = 0;
 1138|       |
 1139|  1.26k|   word3_muladd(&w2, &w1, &w0, x[3], y[15]);
 1140|  1.26k|   word3_muladd(&w2, &w1, &w0, x[4], y[14]);
 1141|  1.26k|   word3_muladd(&w2, &w1, &w0, x[5], y[13]);
 1142|  1.26k|   word3_muladd(&w2, &w1, &w0, x[6], y[12]);
 1143|  1.26k|   word3_muladd(&w2, &w1, &w0, x[7], y[11]);
 1144|  1.26k|   word3_muladd(&w2, &w1, &w0, x[8], y[10]);
 1145|  1.26k|   word3_muladd(&w2, &w1, &w0, x[9], y[9]);
 1146|  1.26k|   word3_muladd(&w2, &w1, &w0, x[10], y[8]);
 1147|  1.26k|   word3_muladd(&w2, &w1, &w0, x[11], y[7]);
 1148|  1.26k|   word3_muladd(&w2, &w1, &w0, x[12], y[6]);
 1149|  1.26k|   word3_muladd(&w2, &w1, &w0, x[13], y[5]);
 1150|  1.26k|   word3_muladd(&w2, &w1, &w0, x[14], y[4]);
 1151|  1.26k|   word3_muladd(&w2, &w1, &w0, x[15], y[3]);
 1152|  1.26k|   z[18] = w0;
 1153|  1.26k|   w0 = 0;
 1154|       |
 1155|  1.26k|   word3_muladd(&w0, &w2, &w1, x[4], y[15]);
 1156|  1.26k|   word3_muladd(&w0, &w2, &w1, x[5], y[14]);
 1157|  1.26k|   word3_muladd(&w0, &w2, &w1, x[6], y[13]);
 1158|  1.26k|   word3_muladd(&w0, &w2, &w1, x[7], y[12]);
 1159|  1.26k|   word3_muladd(&w0, &w2, &w1, x[8], y[11]);
 1160|  1.26k|   word3_muladd(&w0, &w2, &w1, x[9], y[10]);
 1161|  1.26k|   word3_muladd(&w0, &w2, &w1, x[10], y[9]);
 1162|  1.26k|   word3_muladd(&w0, &w2, &w1, x[11], y[8]);
 1163|  1.26k|   word3_muladd(&w0, &w2, &w1, x[12], y[7]);
 1164|  1.26k|   word3_muladd(&w0, &w2, &w1, x[13], y[6]);
 1165|  1.26k|   word3_muladd(&w0, &w2, &w1, x[14], y[5]);
 1166|  1.26k|   word3_muladd(&w0, &w2, &w1, x[15], y[4]);
 1167|  1.26k|   z[19] = w1;
 1168|  1.26k|   w1 = 0;
 1169|       |
 1170|  1.26k|   word3_muladd(&w1, &w0, &w2, x[5], y[15]);
 1171|  1.26k|   word3_muladd(&w1, &w0, &w2, x[6], y[14]);
 1172|  1.26k|   word3_muladd(&w1, &w0, &w2, x[7], y[13]);
 1173|  1.26k|   word3_muladd(&w1, &w0, &w2, x[8], y[12]);
 1174|  1.26k|   word3_muladd(&w1, &w0, &w2, x[9], y[11]);
 1175|  1.26k|   word3_muladd(&w1, &w0, &w2, x[10], y[10]);
 1176|  1.26k|   word3_muladd(&w1, &w0, &w2, x[11], y[9]);
 1177|  1.26k|   word3_muladd(&w1, &w0, &w2, x[12], y[8]);
 1178|  1.26k|   word3_muladd(&w1, &w0, &w2, x[13], y[7]);
 1179|  1.26k|   word3_muladd(&w1, &w0, &w2, x[14], y[6]);
 1180|  1.26k|   word3_muladd(&w1, &w0, &w2, x[15], y[5]);
 1181|  1.26k|   z[20] = w2;
 1182|  1.26k|   w2 = 0;
 1183|       |
 1184|  1.26k|   word3_muladd(&w2, &w1, &w0, x[6], y[15]);
 1185|  1.26k|   word3_muladd(&w2, &w1, &w0, x[7], y[14]);
 1186|  1.26k|   word3_muladd(&w2, &w1, &w0, x[8], y[13]);
 1187|  1.26k|   word3_muladd(&w2, &w1, &w0, x[9], y[12]);
 1188|  1.26k|   word3_muladd(&w2, &w1, &w0, x[10], y[11]);
 1189|  1.26k|   word3_muladd(&w2, &w1, &w0, x[11], y[10]);
 1190|  1.26k|   word3_muladd(&w2, &w1, &w0, x[12], y[9]);
 1191|  1.26k|   word3_muladd(&w2, &w1, &w0, x[13], y[8]);
 1192|  1.26k|   word3_muladd(&w2, &w1, &w0, x[14], y[7]);
 1193|  1.26k|   word3_muladd(&w2, &w1, &w0, x[15], y[6]);
 1194|  1.26k|   z[21] = w0;
 1195|  1.26k|   w0 = 0;
 1196|       |
 1197|  1.26k|   word3_muladd(&w0, &w2, &w1, x[7], y[15]);
 1198|  1.26k|   word3_muladd(&w0, &w2, &w1, x[8], y[14]);
 1199|  1.26k|   word3_muladd(&w0, &w2, &w1, x[9], y[13]);
 1200|  1.26k|   word3_muladd(&w0, &w2, &w1, x[10], y[12]);
 1201|  1.26k|   word3_muladd(&w0, &w2, &w1, x[11], y[11]);
 1202|  1.26k|   word3_muladd(&w0, &w2, &w1, x[12], y[10]);
 1203|  1.26k|   word3_muladd(&w0, &w2, &w1, x[13], y[9]);
 1204|  1.26k|   word3_muladd(&w0, &w2, &w1, x[14], y[8]);
 1205|  1.26k|   word3_muladd(&w0, &w2, &w1, x[15], y[7]);
 1206|  1.26k|   z[22] = w1;
 1207|  1.26k|   w1 = 0;
 1208|       |
 1209|  1.26k|   word3_muladd(&w1, &w0, &w2, x[8], y[15]);
 1210|  1.26k|   word3_muladd(&w1, &w0, &w2, x[9], y[14]);
 1211|  1.26k|   word3_muladd(&w1, &w0, &w2, x[10], y[13]);
 1212|  1.26k|   word3_muladd(&w1, &w0, &w2, x[11], y[12]);
 1213|  1.26k|   word3_muladd(&w1, &w0, &w2, x[12], y[11]);
 1214|  1.26k|   word3_muladd(&w1, &w0, &w2, x[13], y[10]);
 1215|  1.26k|   word3_muladd(&w1, &w0, &w2, x[14], y[9]);
 1216|  1.26k|   word3_muladd(&w1, &w0, &w2, x[15], y[8]);
 1217|  1.26k|   z[23] = w2;
 1218|  1.26k|   w2 = 0;
 1219|       |
 1220|  1.26k|   word3_muladd(&w2, &w1, &w0, x[9], y[15]);
 1221|  1.26k|   word3_muladd(&w2, &w1, &w0, x[10], y[14]);
 1222|  1.26k|   word3_muladd(&w2, &w1, &w0, x[11], y[13]);
 1223|  1.26k|   word3_muladd(&w2, &w1, &w0, x[12], y[12]);
 1224|  1.26k|   word3_muladd(&w2, &w1, &w0, x[13], y[11]);
 1225|  1.26k|   word3_muladd(&w2, &w1, &w0, x[14], y[10]);
 1226|  1.26k|   word3_muladd(&w2, &w1, &w0, x[15], y[9]);
 1227|  1.26k|   z[24] = w0;
 1228|  1.26k|   w0 = 0;
 1229|       |
 1230|  1.26k|   word3_muladd(&w0, &w2, &w1, x[10], y[15]);
 1231|  1.26k|   word3_muladd(&w0, &w2, &w1, x[11], y[14]);
 1232|  1.26k|   word3_muladd(&w0, &w2, &w1, x[12], y[13]);
 1233|  1.26k|   word3_muladd(&w0, &w2, &w1, x[13], y[12]);
 1234|  1.26k|   word3_muladd(&w0, &w2, &w1, x[14], y[11]);
 1235|  1.26k|   word3_muladd(&w0, &w2, &w1, x[15], y[10]);
 1236|  1.26k|   z[25] = w1;
 1237|  1.26k|   w1 = 0;
 1238|       |
 1239|  1.26k|   word3_muladd(&w1, &w0, &w2, x[11], y[15]);
 1240|  1.26k|   word3_muladd(&w1, &w0, &w2, x[12], y[14]);
 1241|  1.26k|   word3_muladd(&w1, &w0, &w2, x[13], y[13]);
 1242|  1.26k|   word3_muladd(&w1, &w0, &w2, x[14], y[12]);
 1243|  1.26k|   word3_muladd(&w1, &w0, &w2, x[15], y[11]);
 1244|  1.26k|   z[26] = w2;
 1245|  1.26k|   w2 = 0;
 1246|       |
 1247|  1.26k|   word3_muladd(&w2, &w1, &w0, x[12], y[15]);
 1248|  1.26k|   word3_muladd(&w2, &w1, &w0, x[13], y[14]);
 1249|  1.26k|   word3_muladd(&w2, &w1, &w0, x[14], y[13]);
 1250|  1.26k|   word3_muladd(&w2, &w1, &w0, x[15], y[12]);
 1251|  1.26k|   z[27] = w0;
 1252|  1.26k|   w0 = 0;
 1253|       |
 1254|  1.26k|   word3_muladd(&w0, &w2, &w1, x[13], y[15]);
 1255|  1.26k|   word3_muladd(&w0, &w2, &w1, x[14], y[14]);
 1256|  1.26k|   word3_muladd(&w0, &w2, &w1, x[15], y[13]);
 1257|  1.26k|   z[28] = w1;
 1258|  1.26k|   w1 = 0;
 1259|       |
 1260|  1.26k|   word3_muladd(&w1, &w0, &w2, x[14], y[15]);
 1261|  1.26k|   word3_muladd(&w1, &w0, &w2, x[15], y[14]);
 1262|  1.26k|   z[29] = w2;
 1263|  1.26k|   w2 = 0;
 1264|       |
 1265|  1.26k|   word3_muladd(&w2, &w1, &w0, x[15], y[15]);
 1266|  1.26k|   z[30] = w0;
 1267|  1.26k|   z[31] = w1;
 1268|  1.26k|}
_ZN5Botan18bigint_comba_sqr24EPmPKm:
 1273|    222|void bigint_comba_sqr24(word z[48], const word x[24]) {
 1274|    222|   word w2 = 0, w1 = 0, w0 = 0;
 1275|       |
 1276|    222|   word3_muladd(&w2, &w1, &w0, x[0], x[0]);
 1277|    222|   z[0] = w0;
 1278|    222|   w0 = 0;
 1279|       |
 1280|    222|   word3_muladd_2(&w0, &w2, &w1, x[0], x[1]);
 1281|    222|   z[1] = w1;
 1282|    222|   w1 = 0;
 1283|       |
 1284|    222|   word3_muladd_2(&w1, &w0, &w2, x[0], x[2]);
 1285|    222|   word3_muladd(&w1, &w0, &w2, x[1], x[1]);
 1286|    222|   z[2] = w2;
 1287|    222|   w2 = 0;
 1288|       |
 1289|    222|   word3_muladd_2(&w2, &w1, &w0, x[0], x[3]);
 1290|    222|   word3_muladd_2(&w2, &w1, &w0, x[1], x[2]);
 1291|    222|   z[3] = w0;
 1292|    222|   w0 = 0;
 1293|       |
 1294|    222|   word3_muladd_2(&w0, &w2, &w1, x[0], x[4]);
 1295|    222|   word3_muladd_2(&w0, &w2, &w1, x[1], x[3]);
 1296|    222|   word3_muladd(&w0, &w2, &w1, x[2], x[2]);
 1297|    222|   z[4] = w1;
 1298|    222|   w1 = 0;
 1299|       |
 1300|    222|   word3_muladd_2(&w1, &w0, &w2, x[0], x[5]);
 1301|    222|   word3_muladd_2(&w1, &w0, &w2, x[1], x[4]);
 1302|    222|   word3_muladd_2(&w1, &w0, &w2, x[2], x[3]);
 1303|    222|   z[5] = w2;
 1304|    222|   w2 = 0;
 1305|       |
 1306|    222|   word3_muladd_2(&w2, &w1, &w0, x[0], x[6]);
 1307|    222|   word3_muladd_2(&w2, &w1, &w0, x[1], x[5]);
 1308|    222|   word3_muladd_2(&w2, &w1, &w0, x[2], x[4]);
 1309|    222|   word3_muladd(&w2, &w1, &w0, x[3], x[3]);
 1310|    222|   z[6] = w0;
 1311|    222|   w0 = 0;
 1312|       |
 1313|    222|   word3_muladd_2(&w0, &w2, &w1, x[0], x[7]);
 1314|    222|   word3_muladd_2(&w0, &w2, &w1, x[1], x[6]);
 1315|    222|   word3_muladd_2(&w0, &w2, &w1, x[2], x[5]);
 1316|    222|   word3_muladd_2(&w0, &w2, &w1, x[3], x[4]);
 1317|    222|   z[7] = w1;
 1318|    222|   w1 = 0;
 1319|       |
 1320|    222|   word3_muladd_2(&w1, &w0, &w2, x[0], x[8]);
 1321|    222|   word3_muladd_2(&w1, &w0, &w2, x[1], x[7]);
 1322|    222|   word3_muladd_2(&w1, &w0, &w2, x[2], x[6]);
 1323|    222|   word3_muladd_2(&w1, &w0, &w2, x[3], x[5]);
 1324|    222|   word3_muladd(&w1, &w0, &w2, x[4], x[4]);
 1325|    222|   z[8] = w2;
 1326|    222|   w2 = 0;
 1327|       |
 1328|    222|   word3_muladd_2(&w2, &w1, &w0, x[0], x[9]);
 1329|    222|   word3_muladd_2(&w2, &w1, &w0, x[1], x[8]);
 1330|    222|   word3_muladd_2(&w2, &w1, &w0, x[2], x[7]);
 1331|    222|   word3_muladd_2(&w2, &w1, &w0, x[3], x[6]);
 1332|    222|   word3_muladd_2(&w2, &w1, &w0, x[4], x[5]);
 1333|    222|   z[9] = w0;
 1334|    222|   w0 = 0;
 1335|       |
 1336|    222|   word3_muladd_2(&w0, &w2, &w1, x[0], x[10]);
 1337|    222|   word3_muladd_2(&w0, &w2, &w1, x[1], x[9]);
 1338|    222|   word3_muladd_2(&w0, &w2, &w1, x[2], x[8]);
 1339|    222|   word3_muladd_2(&w0, &w2, &w1, x[3], x[7]);
 1340|    222|   word3_muladd_2(&w0, &w2, &w1, x[4], x[6]);
 1341|    222|   word3_muladd(&w0, &w2, &w1, x[5], x[5]);
 1342|    222|   z[10] = w1;
 1343|    222|   w1 = 0;
 1344|       |
 1345|    222|   word3_muladd_2(&w1, &w0, &w2, x[0], x[11]);
 1346|    222|   word3_muladd_2(&w1, &w0, &w2, x[1], x[10]);
 1347|    222|   word3_muladd_2(&w1, &w0, &w2, x[2], x[9]);
 1348|    222|   word3_muladd_2(&w1, &w0, &w2, x[3], x[8]);
 1349|    222|   word3_muladd_2(&w1, &w0, &w2, x[4], x[7]);
 1350|    222|   word3_muladd_2(&w1, &w0, &w2, x[5], x[6]);
 1351|    222|   z[11] = w2;
 1352|    222|   w2 = 0;
 1353|       |
 1354|    222|   word3_muladd_2(&w2, &w1, &w0, x[0], x[12]);
 1355|    222|   word3_muladd_2(&w2, &w1, &w0, x[1], x[11]);
 1356|    222|   word3_muladd_2(&w2, &w1, &w0, x[2], x[10]);
 1357|    222|   word3_muladd_2(&w2, &w1, &w0, x[3], x[9]);
 1358|    222|   word3_muladd_2(&w2, &w1, &w0, x[4], x[8]);
 1359|    222|   word3_muladd_2(&w2, &w1, &w0, x[5], x[7]);
 1360|    222|   word3_muladd(&w2, &w1, &w0, x[6], x[6]);
 1361|    222|   z[12] = w0;
 1362|    222|   w0 = 0;
 1363|       |
 1364|    222|   word3_muladd_2(&w0, &w2, &w1, x[0], x[13]);
 1365|    222|   word3_muladd_2(&w0, &w2, &w1, x[1], x[12]);
 1366|    222|   word3_muladd_2(&w0, &w2, &w1, x[2], x[11]);
 1367|    222|   word3_muladd_2(&w0, &w2, &w1, x[3], x[10]);
 1368|    222|   word3_muladd_2(&w0, &w2, &w1, x[4], x[9]);
 1369|    222|   word3_muladd_2(&w0, &w2, &w1, x[5], x[8]);
 1370|    222|   word3_muladd_2(&w0, &w2, &w1, x[6], x[7]);
 1371|    222|   z[13] = w1;
 1372|    222|   w1 = 0;
 1373|       |
 1374|    222|   word3_muladd_2(&w1, &w0, &w2, x[0], x[14]);
 1375|    222|   word3_muladd_2(&w1, &w0, &w2, x[1], x[13]);
 1376|    222|   word3_muladd_2(&w1, &w0, &w2, x[2], x[12]);
 1377|    222|   word3_muladd_2(&w1, &w0, &w2, x[3], x[11]);
 1378|    222|   word3_muladd_2(&w1, &w0, &w2, x[4], x[10]);
 1379|    222|   word3_muladd_2(&w1, &w0, &w2, x[5], x[9]);
 1380|    222|   word3_muladd_2(&w1, &w0, &w2, x[6], x[8]);
 1381|    222|   word3_muladd(&w1, &w0, &w2, x[7], x[7]);
 1382|    222|   z[14] = w2;
 1383|    222|   w2 = 0;
 1384|       |
 1385|    222|   word3_muladd_2(&w2, &w1, &w0, x[0], x[15]);
 1386|    222|   word3_muladd_2(&w2, &w1, &w0, x[1], x[14]);
 1387|    222|   word3_muladd_2(&w2, &w1, &w0, x[2], x[13]);
 1388|    222|   word3_muladd_2(&w2, &w1, &w0, x[3], x[12]);
 1389|    222|   word3_muladd_2(&w2, &w1, &w0, x[4], x[11]);
 1390|    222|   word3_muladd_2(&w2, &w1, &w0, x[5], x[10]);
 1391|    222|   word3_muladd_2(&w2, &w1, &w0, x[6], x[9]);
 1392|    222|   word3_muladd_2(&w2, &w1, &w0, x[7], x[8]);
 1393|    222|   z[15] = w0;
 1394|    222|   w0 = 0;
 1395|       |
 1396|    222|   word3_muladd_2(&w0, &w2, &w1, x[0], x[16]);
 1397|    222|   word3_muladd_2(&w0, &w2, &w1, x[1], x[15]);
 1398|    222|   word3_muladd_2(&w0, &w2, &w1, x[2], x[14]);
 1399|    222|   word3_muladd_2(&w0, &w2, &w1, x[3], x[13]);
 1400|    222|   word3_muladd_2(&w0, &w2, &w1, x[4], x[12]);
 1401|    222|   word3_muladd_2(&w0, &w2, &w1, x[5], x[11]);
 1402|    222|   word3_muladd_2(&w0, &w2, &w1, x[6], x[10]);
 1403|    222|   word3_muladd_2(&w0, &w2, &w1, x[7], x[9]);
 1404|    222|   word3_muladd(&w0, &w2, &w1, x[8], x[8]);
 1405|    222|   z[16] = w1;
 1406|    222|   w1 = 0;
 1407|       |
 1408|    222|   word3_muladd_2(&w1, &w0, &w2, x[0], x[17]);
 1409|    222|   word3_muladd_2(&w1, &w0, &w2, x[1], x[16]);
 1410|    222|   word3_muladd_2(&w1, &w0, &w2, x[2], x[15]);
 1411|    222|   word3_muladd_2(&w1, &w0, &w2, x[3], x[14]);
 1412|    222|   word3_muladd_2(&w1, &w0, &w2, x[4], x[13]);
 1413|    222|   word3_muladd_2(&w1, &w0, &w2, x[5], x[12]);
 1414|    222|   word3_muladd_2(&w1, &w0, &w2, x[6], x[11]);
 1415|    222|   word3_muladd_2(&w1, &w0, &w2, x[7], x[10]);
 1416|    222|   word3_muladd_2(&w1, &w0, &w2, x[8], x[9]);
 1417|    222|   z[17] = w2;
 1418|    222|   w2 = 0;
 1419|       |
 1420|    222|   word3_muladd_2(&w2, &w1, &w0, x[0], x[18]);
 1421|    222|   word3_muladd_2(&w2, &w1, &w0, x[1], x[17]);
 1422|    222|   word3_muladd_2(&w2, &w1, &w0, x[2], x[16]);
 1423|    222|   word3_muladd_2(&w2, &w1, &w0, x[3], x[15]);
 1424|    222|   word3_muladd_2(&w2, &w1, &w0, x[4], x[14]);
 1425|    222|   word3_muladd_2(&w2, &w1, &w0, x[5], x[13]);
 1426|    222|   word3_muladd_2(&w2, &w1, &w0, x[6], x[12]);
 1427|    222|   word3_muladd_2(&w2, &w1, &w0, x[7], x[11]);
 1428|    222|   word3_muladd_2(&w2, &w1, &w0, x[8], x[10]);
 1429|    222|   word3_muladd(&w2, &w1, &w0, x[9], x[9]);
 1430|    222|   z[18] = w0;
 1431|    222|   w0 = 0;
 1432|       |
 1433|    222|   word3_muladd_2(&w0, &w2, &w1, x[0], x[19]);
 1434|    222|   word3_muladd_2(&w0, &w2, &w1, x[1], x[18]);
 1435|    222|   word3_muladd_2(&w0, &w2, &w1, x[2], x[17]);
 1436|    222|   word3_muladd_2(&w0, &w2, &w1, x[3], x[16]);
 1437|    222|   word3_muladd_2(&w0, &w2, &w1, x[4], x[15]);
 1438|    222|   word3_muladd_2(&w0, &w2, &w1, x[5], x[14]);
 1439|    222|   word3_muladd_2(&w0, &w2, &w1, x[6], x[13]);
 1440|    222|   word3_muladd_2(&w0, &w2, &w1, x[7], x[12]);
 1441|    222|   word3_muladd_2(&w0, &w2, &w1, x[8], x[11]);
 1442|    222|   word3_muladd_2(&w0, &w2, &w1, x[9], x[10]);
 1443|    222|   z[19] = w1;
 1444|    222|   w1 = 0;
 1445|       |
 1446|    222|   word3_muladd_2(&w1, &w0, &w2, x[0], x[20]);
 1447|    222|   word3_muladd_2(&w1, &w0, &w2, x[1], x[19]);
 1448|    222|   word3_muladd_2(&w1, &w0, &w2, x[2], x[18]);
 1449|    222|   word3_muladd_2(&w1, &w0, &w2, x[3], x[17]);
 1450|    222|   word3_muladd_2(&w1, &w0, &w2, x[4], x[16]);
 1451|    222|   word3_muladd_2(&w1, &w0, &w2, x[5], x[15]);
 1452|    222|   word3_muladd_2(&w1, &w0, &w2, x[6], x[14]);
 1453|    222|   word3_muladd_2(&w1, &w0, &w2, x[7], x[13]);
 1454|    222|   word3_muladd_2(&w1, &w0, &w2, x[8], x[12]);
 1455|    222|   word3_muladd_2(&w1, &w0, &w2, x[9], x[11]);
 1456|    222|   word3_muladd(&w1, &w0, &w2, x[10], x[10]);
 1457|    222|   z[20] = w2;
 1458|    222|   w2 = 0;
 1459|       |
 1460|    222|   word3_muladd_2(&w2, &w1, &w0, x[0], x[21]);
 1461|    222|   word3_muladd_2(&w2, &w1, &w0, x[1], x[20]);
 1462|    222|   word3_muladd_2(&w2, &w1, &w0, x[2], x[19]);
 1463|    222|   word3_muladd_2(&w2, &w1, &w0, x[3], x[18]);
 1464|    222|   word3_muladd_2(&w2, &w1, &w0, x[4], x[17]);
 1465|    222|   word3_muladd_2(&w2, &w1, &w0, x[5], x[16]);
 1466|    222|   word3_muladd_2(&w2, &w1, &w0, x[6], x[15]);
 1467|    222|   word3_muladd_2(&w2, &w1, &w0, x[7], x[14]);
 1468|    222|   word3_muladd_2(&w2, &w1, &w0, x[8], x[13]);
 1469|    222|   word3_muladd_2(&w2, &w1, &w0, x[9], x[12]);
 1470|    222|   word3_muladd_2(&w2, &w1, &w0, x[10], x[11]);
 1471|    222|   z[21] = w0;
 1472|    222|   w0 = 0;
 1473|       |
 1474|    222|   word3_muladd_2(&w0, &w2, &w1, x[0], x[22]);
 1475|    222|   word3_muladd_2(&w0, &w2, &w1, x[1], x[21]);
 1476|    222|   word3_muladd_2(&w0, &w2, &w1, x[2], x[20]);
 1477|    222|   word3_muladd_2(&w0, &w2, &w1, x[3], x[19]);
 1478|    222|   word3_muladd_2(&w0, &w2, &w1, x[4], x[18]);
 1479|    222|   word3_muladd_2(&w0, &w2, &w1, x[5], x[17]);
 1480|    222|   word3_muladd_2(&w0, &w2, &w1, x[6], x[16]);
 1481|    222|   word3_muladd_2(&w0, &w2, &w1, x[7], x[15]);
 1482|    222|   word3_muladd_2(&w0, &w2, &w1, x[8], x[14]);
 1483|    222|   word3_muladd_2(&w0, &w2, &w1, x[9], x[13]);
 1484|    222|   word3_muladd_2(&w0, &w2, &w1, x[10], x[12]);
 1485|    222|   word3_muladd(&w0, &w2, &w1, x[11], x[11]);
 1486|    222|   z[22] = w1;
 1487|    222|   w1 = 0;
 1488|       |
 1489|    222|   word3_muladd_2(&w1, &w0, &w2, x[0], x[23]);
 1490|    222|   word3_muladd_2(&w1, &w0, &w2, x[1], x[22]);
 1491|    222|   word3_muladd_2(&w1, &w0, &w2, x[2], x[21]);
 1492|    222|   word3_muladd_2(&w1, &w0, &w2, x[3], x[20]);
 1493|    222|   word3_muladd_2(&w1, &w0, &w2, x[4], x[19]);
 1494|    222|   word3_muladd_2(&w1, &w0, &w2, x[5], x[18]);
 1495|    222|   word3_muladd_2(&w1, &w0, &w2, x[6], x[17]);
 1496|    222|   word3_muladd_2(&w1, &w0, &w2, x[7], x[16]);
 1497|    222|   word3_muladd_2(&w1, &w0, &w2, x[8], x[15]);
 1498|    222|   word3_muladd_2(&w1, &w0, &w2, x[9], x[14]);
 1499|    222|   word3_muladd_2(&w1, &w0, &w2, x[10], x[13]);
 1500|    222|   word3_muladd_2(&w1, &w0, &w2, x[11], x[12]);
 1501|    222|   z[23] = w2;
 1502|    222|   w2 = 0;
 1503|       |
 1504|    222|   word3_muladd_2(&w2, &w1, &w0, x[1], x[23]);
 1505|    222|   word3_muladd_2(&w2, &w1, &w0, x[2], x[22]);
 1506|    222|   word3_muladd_2(&w2, &w1, &w0, x[3], x[21]);
 1507|    222|   word3_muladd_2(&w2, &w1, &w0, x[4], x[20]);
 1508|    222|   word3_muladd_2(&w2, &w1, &w0, x[5], x[19]);
 1509|    222|   word3_muladd_2(&w2, &w1, &w0, x[6], x[18]);
 1510|    222|   word3_muladd_2(&w2, &w1, &w0, x[7], x[17]);
 1511|    222|   word3_muladd_2(&w2, &w1, &w0, x[8], x[16]);
 1512|    222|   word3_muladd_2(&w2, &w1, &w0, x[9], x[15]);
 1513|    222|   word3_muladd_2(&w2, &w1, &w0, x[10], x[14]);
 1514|    222|   word3_muladd_2(&w2, &w1, &w0, x[11], x[13]);
 1515|    222|   word3_muladd(&w2, &w1, &w0, x[12], x[12]);
 1516|    222|   z[24] = w0;
 1517|    222|   w0 = 0;
 1518|       |
 1519|    222|   word3_muladd_2(&w0, &w2, &w1, x[2], x[23]);
 1520|    222|   word3_muladd_2(&w0, &w2, &w1, x[3], x[22]);
 1521|    222|   word3_muladd_2(&w0, &w2, &w1, x[4], x[21]);
 1522|    222|   word3_muladd_2(&w0, &w2, &w1, x[5], x[20]);
 1523|    222|   word3_muladd_2(&w0, &w2, &w1, x[6], x[19]);
 1524|    222|   word3_muladd_2(&w0, &w2, &w1, x[7], x[18]);
 1525|    222|   word3_muladd_2(&w0, &w2, &w1, x[8], x[17]);
 1526|    222|   word3_muladd_2(&w0, &w2, &w1, x[9], x[16]);
 1527|    222|   word3_muladd_2(&w0, &w2, &w1, x[10], x[15]);
 1528|    222|   word3_muladd_2(&w0, &w2, &w1, x[11], x[14]);
 1529|    222|   word3_muladd_2(&w0, &w2, &w1, x[12], x[13]);
 1530|    222|   z[25] = w1;
 1531|    222|   w1 = 0;
 1532|       |
 1533|    222|   word3_muladd_2(&w1, &w0, &w2, x[3], x[23]);
 1534|    222|   word3_muladd_2(&w1, &w0, &w2, x[4], x[22]);
 1535|    222|   word3_muladd_2(&w1, &w0, &w2, x[5], x[21]);
 1536|    222|   word3_muladd_2(&w1, &w0, &w2, x[6], x[20]);
 1537|    222|   word3_muladd_2(&w1, &w0, &w2, x[7], x[19]);
 1538|    222|   word3_muladd_2(&w1, &w0, &w2, x[8], x[18]);
 1539|    222|   word3_muladd_2(&w1, &w0, &w2, x[9], x[17]);
 1540|    222|   word3_muladd_2(&w1, &w0, &w2, x[10], x[16]);
 1541|    222|   word3_muladd_2(&w1, &w0, &w2, x[11], x[15]);
 1542|    222|   word3_muladd_2(&w1, &w0, &w2, x[12], x[14]);
 1543|    222|   word3_muladd(&w1, &w0, &w2, x[13], x[13]);
 1544|    222|   z[26] = w2;
 1545|    222|   w2 = 0;
 1546|       |
 1547|    222|   word3_muladd_2(&w2, &w1, &w0, x[4], x[23]);
 1548|    222|   word3_muladd_2(&w2, &w1, &w0, x[5], x[22]);
 1549|    222|   word3_muladd_2(&w2, &w1, &w0, x[6], x[21]);
 1550|    222|   word3_muladd_2(&w2, &w1, &w0, x[7], x[20]);
 1551|    222|   word3_muladd_2(&w2, &w1, &w0, x[8], x[19]);
 1552|    222|   word3_muladd_2(&w2, &w1, &w0, x[9], x[18]);
 1553|    222|   word3_muladd_2(&w2, &w1, &w0, x[10], x[17]);
 1554|    222|   word3_muladd_2(&w2, &w1, &w0, x[11], x[16]);
 1555|    222|   word3_muladd_2(&w2, &w1, &w0, x[12], x[15]);
 1556|    222|   word3_muladd_2(&w2, &w1, &w0, x[13], x[14]);
 1557|    222|   z[27] = w0;
 1558|    222|   w0 = 0;
 1559|       |
 1560|    222|   word3_muladd_2(&w0, &w2, &w1, x[5], x[23]);
 1561|    222|   word3_muladd_2(&w0, &w2, &w1, x[6], x[22]);
 1562|    222|   word3_muladd_2(&w0, &w2, &w1, x[7], x[21]);
 1563|    222|   word3_muladd_2(&w0, &w2, &w1, x[8], x[20]);
 1564|    222|   word3_muladd_2(&w0, &w2, &w1, x[9], x[19]);
 1565|    222|   word3_muladd_2(&w0, &w2, &w1, x[10], x[18]);
 1566|    222|   word3_muladd_2(&w0, &w2, &w1, x[11], x[17]);
 1567|    222|   word3_muladd_2(&w0, &w2, &w1, x[12], x[16]);
 1568|    222|   word3_muladd_2(&w0, &w2, &w1, x[13], x[15]);
 1569|    222|   word3_muladd(&w0, &w2, &w1, x[14], x[14]);
 1570|    222|   z[28] = w1;
 1571|    222|   w1 = 0;
 1572|       |
 1573|    222|   word3_muladd_2(&w1, &w0, &w2, x[6], x[23]);
 1574|    222|   word3_muladd_2(&w1, &w0, &w2, x[7], x[22]);
 1575|    222|   word3_muladd_2(&w1, &w0, &w2, x[8], x[21]);
 1576|    222|   word3_muladd_2(&w1, &w0, &w2, x[9], x[20]);
 1577|    222|   word3_muladd_2(&w1, &w0, &w2, x[10], x[19]);
 1578|    222|   word3_muladd_2(&w1, &w0, &w2, x[11], x[18]);
 1579|    222|   word3_muladd_2(&w1, &w0, &w2, x[12], x[17]);
 1580|    222|   word3_muladd_2(&w1, &w0, &w2, x[13], x[16]);
 1581|    222|   word3_muladd_2(&w1, &w0, &w2, x[14], x[15]);
 1582|    222|   z[29] = w2;
 1583|    222|   w2 = 0;
 1584|       |
 1585|    222|   word3_muladd_2(&w2, &w1, &w0, x[7], x[23]);
 1586|    222|   word3_muladd_2(&w2, &w1, &w0, x[8], x[22]);
 1587|    222|   word3_muladd_2(&w2, &w1, &w0, x[9], x[21]);
 1588|    222|   word3_muladd_2(&w2, &w1, &w0, x[10], x[20]);
 1589|    222|   word3_muladd_2(&w2, &w1, &w0, x[11], x[19]);
 1590|    222|   word3_muladd_2(&w2, &w1, &w0, x[12], x[18]);
 1591|    222|   word3_muladd_2(&w2, &w1, &w0, x[13], x[17]);
 1592|    222|   word3_muladd_2(&w2, &w1, &w0, x[14], x[16]);
 1593|    222|   word3_muladd(&w2, &w1, &w0, x[15], x[15]);
 1594|    222|   z[30] = w0;
 1595|    222|   w0 = 0;
 1596|       |
 1597|    222|   word3_muladd_2(&w0, &w2, &w1, x[8], x[23]);
 1598|    222|   word3_muladd_2(&w0, &w2, &w1, x[9], x[22]);
 1599|    222|   word3_muladd_2(&w0, &w2, &w1, x[10], x[21]);
 1600|    222|   word3_muladd_2(&w0, &w2, &w1, x[11], x[20]);
 1601|    222|   word3_muladd_2(&w0, &w2, &w1, x[12], x[19]);
 1602|    222|   word3_muladd_2(&w0, &w2, &w1, x[13], x[18]);
 1603|    222|   word3_muladd_2(&w0, &w2, &w1, x[14], x[17]);
 1604|    222|   word3_muladd_2(&w0, &w2, &w1, x[15], x[16]);
 1605|    222|   z[31] = w1;
 1606|    222|   w1 = 0;
 1607|       |
 1608|    222|   word3_muladd_2(&w1, &w0, &w2, x[9], x[23]);
 1609|    222|   word3_muladd_2(&w1, &w0, &w2, x[10], x[22]);
 1610|    222|   word3_muladd_2(&w1, &w0, &w2, x[11], x[21]);
 1611|    222|   word3_muladd_2(&w1, &w0, &w2, x[12], x[20]);
 1612|    222|   word3_muladd_2(&w1, &w0, &w2, x[13], x[19]);
 1613|    222|   word3_muladd_2(&w1, &w0, &w2, x[14], x[18]);
 1614|    222|   word3_muladd_2(&w1, &w0, &w2, x[15], x[17]);
 1615|    222|   word3_muladd(&w1, &w0, &w2, x[16], x[16]);
 1616|    222|   z[32] = w2;
 1617|    222|   w2 = 0;
 1618|       |
 1619|    222|   word3_muladd_2(&w2, &w1, &w0, x[10], x[23]);
 1620|    222|   word3_muladd_2(&w2, &w1, &w0, x[11], x[22]);
 1621|    222|   word3_muladd_2(&w2, &w1, &w0, x[12], x[21]);
 1622|    222|   word3_muladd_2(&w2, &w1, &w0, x[13], x[20]);
 1623|    222|   word3_muladd_2(&w2, &w1, &w0, x[14], x[19]);
 1624|    222|   word3_muladd_2(&w2, &w1, &w0, x[15], x[18]);
 1625|    222|   word3_muladd_2(&w2, &w1, &w0, x[16], x[17]);
 1626|    222|   z[33] = w0;
 1627|    222|   w0 = 0;
 1628|       |
 1629|    222|   word3_muladd_2(&w0, &w2, &w1, x[11], x[23]);
 1630|    222|   word3_muladd_2(&w0, &w2, &w1, x[12], x[22]);
 1631|    222|   word3_muladd_2(&w0, &w2, &w1, x[13], x[21]);
 1632|    222|   word3_muladd_2(&w0, &w2, &w1, x[14], x[20]);
 1633|    222|   word3_muladd_2(&w0, &w2, &w1, x[15], x[19]);
 1634|    222|   word3_muladd_2(&w0, &w2, &w1, x[16], x[18]);
 1635|    222|   word3_muladd(&w0, &w2, &w1, x[17], x[17]);
 1636|    222|   z[34] = w1;
 1637|    222|   w1 = 0;
 1638|       |
 1639|    222|   word3_muladd_2(&w1, &w0, &w2, x[12], x[23]);
 1640|    222|   word3_muladd_2(&w1, &w0, &w2, x[13], x[22]);
 1641|    222|   word3_muladd_2(&w1, &w0, &w2, x[14], x[21]);
 1642|    222|   word3_muladd_2(&w1, &w0, &w2, x[15], x[20]);
 1643|    222|   word3_muladd_2(&w1, &w0, &w2, x[16], x[19]);
 1644|    222|   word3_muladd_2(&w1, &w0, &w2, x[17], x[18]);
 1645|    222|   z[35] = w2;
 1646|    222|   w2 = 0;
 1647|       |
 1648|    222|   word3_muladd_2(&w2, &w1, &w0, x[13], x[23]);
 1649|    222|   word3_muladd_2(&w2, &w1, &w0, x[14], x[22]);
 1650|    222|   word3_muladd_2(&w2, &w1, &w0, x[15], x[21]);
 1651|    222|   word3_muladd_2(&w2, &w1, &w0, x[16], x[20]);
 1652|    222|   word3_muladd_2(&w2, &w1, &w0, x[17], x[19]);
 1653|    222|   word3_muladd(&w2, &w1, &w0, x[18], x[18]);
 1654|    222|   z[36] = w0;
 1655|    222|   w0 = 0;
 1656|       |
 1657|    222|   word3_muladd_2(&w0, &w2, &w1, x[14], x[23]);
 1658|    222|   word3_muladd_2(&w0, &w2, &w1, x[15], x[22]);
 1659|    222|   word3_muladd_2(&w0, &w2, &w1, x[16], x[21]);
 1660|    222|   word3_muladd_2(&w0, &w2, &w1, x[17], x[20]);
 1661|    222|   word3_muladd_2(&w0, &w2, &w1, x[18], x[19]);
 1662|    222|   z[37] = w1;
 1663|    222|   w1 = 0;
 1664|       |
 1665|    222|   word3_muladd_2(&w1, &w0, &w2, x[15], x[23]);
 1666|    222|   word3_muladd_2(&w1, &w0, &w2, x[16], x[22]);
 1667|    222|   word3_muladd_2(&w1, &w0, &w2, x[17], x[21]);
 1668|    222|   word3_muladd_2(&w1, &w0, &w2, x[18], x[20]);
 1669|    222|   word3_muladd(&w1, &w0, &w2, x[19], x[19]);
 1670|    222|   z[38] = w2;
 1671|    222|   w2 = 0;
 1672|       |
 1673|    222|   word3_muladd_2(&w2, &w1, &w0, x[16], x[23]);
 1674|    222|   word3_muladd_2(&w2, &w1, &w0, x[17], x[22]);
 1675|    222|   word3_muladd_2(&w2, &w1, &w0, x[18], x[21]);
 1676|    222|   word3_muladd_2(&w2, &w1, &w0, x[19], x[20]);
 1677|    222|   z[39] = w0;
 1678|    222|   w0 = 0;
 1679|       |
 1680|    222|   word3_muladd_2(&w0, &w2, &w1, x[17], x[23]);
 1681|    222|   word3_muladd_2(&w0, &w2, &w1, x[18], x[22]);
 1682|    222|   word3_muladd_2(&w0, &w2, &w1, x[19], x[21]);
 1683|    222|   word3_muladd(&w0, &w2, &w1, x[20], x[20]);
 1684|    222|   z[40] = w1;
 1685|    222|   w1 = 0;
 1686|       |
 1687|    222|   word3_muladd_2(&w1, &w0, &w2, x[18], x[23]);
 1688|    222|   word3_muladd_2(&w1, &w0, &w2, x[19], x[22]);
 1689|    222|   word3_muladd_2(&w1, &w0, &w2, x[20], x[21]);
 1690|    222|   z[41] = w2;
 1691|    222|   w2 = 0;
 1692|       |
 1693|    222|   word3_muladd_2(&w2, &w1, &w0, x[19], x[23]);
 1694|    222|   word3_muladd_2(&w2, &w1, &w0, x[20], x[22]);
 1695|    222|   word3_muladd(&w2, &w1, &w0, x[21], x[21]);
 1696|    222|   z[42] = w0;
 1697|    222|   w0 = 0;
 1698|       |
 1699|    222|   word3_muladd_2(&w0, &w2, &w1, x[20], x[23]);
 1700|    222|   word3_muladd_2(&w0, &w2, &w1, x[21], x[22]);
 1701|    222|   z[43] = w1;
 1702|    222|   w1 = 0;
 1703|       |
 1704|    222|   word3_muladd_2(&w1, &w0, &w2, x[21], x[23]);
 1705|    222|   word3_muladd(&w1, &w0, &w2, x[22], x[22]);
 1706|    222|   z[44] = w2;
 1707|    222|   w2 = 0;
 1708|       |
 1709|    222|   word3_muladd_2(&w2, &w1, &w0, x[22], x[23]);
 1710|    222|   z[45] = w0;
 1711|    222|   w0 = 0;
 1712|       |
 1713|    222|   word3_muladd(&w0, &w2, &w1, x[23], x[23]);
 1714|    222|   z[46] = w1;
 1715|    222|   z[47] = w2;
 1716|    222|}
_ZN5Botan18bigint_comba_mul24EPmPKmS2_:
 1721|    183|void bigint_comba_mul24(word z[48], const word x[24], const word y[24]) {
 1722|    183|   word w2 = 0, w1 = 0, w0 = 0;
 1723|       |
 1724|    183|   word3_muladd(&w2, &w1, &w0, x[0], y[0]);
 1725|    183|   z[0] = w0;
 1726|    183|   w0 = 0;
 1727|       |
 1728|    183|   word3_muladd(&w0, &w2, &w1, x[0], y[1]);
 1729|    183|   word3_muladd(&w0, &w2, &w1, x[1], y[0]);
 1730|    183|   z[1] = w1;
 1731|    183|   w1 = 0;
 1732|       |
 1733|    183|   word3_muladd(&w1, &w0, &w2, x[0], y[2]);
 1734|    183|   word3_muladd(&w1, &w0, &w2, x[1], y[1]);
 1735|    183|   word3_muladd(&w1, &w0, &w2, x[2], y[0]);
 1736|    183|   z[2] = w2;
 1737|    183|   w2 = 0;
 1738|       |
 1739|    183|   word3_muladd(&w2, &w1, &w0, x[0], y[3]);
 1740|    183|   word3_muladd(&w2, &w1, &w0, x[1], y[2]);
 1741|    183|   word3_muladd(&w2, &w1, &w0, x[2], y[1]);
 1742|    183|   word3_muladd(&w2, &w1, &w0, x[3], y[0]);
 1743|    183|   z[3] = w0;
 1744|    183|   w0 = 0;
 1745|       |
 1746|    183|   word3_muladd(&w0, &w2, &w1, x[0], y[4]);
 1747|    183|   word3_muladd(&w0, &w2, &w1, x[1], y[3]);
 1748|    183|   word3_muladd(&w0, &w2, &w1, x[2], y[2]);
 1749|    183|   word3_muladd(&w0, &w2, &w1, x[3], y[1]);
 1750|    183|   word3_muladd(&w0, &w2, &w1, x[4], y[0]);
 1751|    183|   z[4] = w1;
 1752|    183|   w1 = 0;
 1753|       |
 1754|    183|   word3_muladd(&w1, &w0, &w2, x[0], y[5]);
 1755|    183|   word3_muladd(&w1, &w0, &w2, x[1], y[4]);
 1756|    183|   word3_muladd(&w1, &w0, &w2, x[2], y[3]);
 1757|    183|   word3_muladd(&w1, &w0, &w2, x[3], y[2]);
 1758|    183|   word3_muladd(&w1, &w0, &w2, x[4], y[1]);
 1759|    183|   word3_muladd(&w1, &w0, &w2, x[5], y[0]);
 1760|    183|   z[5] = w2;
 1761|    183|   w2 = 0;
 1762|       |
 1763|    183|   word3_muladd(&w2, &w1, &w0, x[0], y[6]);
 1764|    183|   word3_muladd(&w2, &w1, &w0, x[1], y[5]);
 1765|    183|   word3_muladd(&w2, &w1, &w0, x[2], y[4]);
 1766|    183|   word3_muladd(&w2, &w1, &w0, x[3], y[3]);
 1767|    183|   word3_muladd(&w2, &w1, &w0, x[4], y[2]);
 1768|    183|   word3_muladd(&w2, &w1, &w0, x[5], y[1]);
 1769|    183|   word3_muladd(&w2, &w1, &w0, x[6], y[0]);
 1770|    183|   z[6] = w0;
 1771|    183|   w0 = 0;
 1772|       |
 1773|    183|   word3_muladd(&w0, &w2, &w1, x[0], y[7]);
 1774|    183|   word3_muladd(&w0, &w2, &w1, x[1], y[6]);
 1775|    183|   word3_muladd(&w0, &w2, &w1, x[2], y[5]);
 1776|    183|   word3_muladd(&w0, &w2, &w1, x[3], y[4]);
 1777|    183|   word3_muladd(&w0, &w2, &w1, x[4], y[3]);
 1778|    183|   word3_muladd(&w0, &w2, &w1, x[5], y[2]);
 1779|    183|   word3_muladd(&w0, &w2, &w1, x[6], y[1]);
 1780|    183|   word3_muladd(&w0, &w2, &w1, x[7], y[0]);
 1781|    183|   z[7] = w1;
 1782|    183|   w1 = 0;
 1783|       |
 1784|    183|   word3_muladd(&w1, &w0, &w2, x[0], y[8]);
 1785|    183|   word3_muladd(&w1, &w0, &w2, x[1], y[7]);
 1786|    183|   word3_muladd(&w1, &w0, &w2, x[2], y[6]);
 1787|    183|   word3_muladd(&w1, &w0, &w2, x[3], y[5]);
 1788|    183|   word3_muladd(&w1, &w0, &w2, x[4], y[4]);
 1789|    183|   word3_muladd(&w1, &w0, &w2, x[5], y[3]);
 1790|    183|   word3_muladd(&w1, &w0, &w2, x[6], y[2]);
 1791|    183|   word3_muladd(&w1, &w0, &w2, x[7], y[1]);
 1792|    183|   word3_muladd(&w1, &w0, &w2, x[8], y[0]);
 1793|    183|   z[8] = w2;
 1794|    183|   w2 = 0;
 1795|       |
 1796|    183|   word3_muladd(&w2, &w1, &w0, x[0], y[9]);
 1797|    183|   word3_muladd(&w2, &w1, &w0, x[1], y[8]);
 1798|    183|   word3_muladd(&w2, &w1, &w0, x[2], y[7]);
 1799|    183|   word3_muladd(&w2, &w1, &w0, x[3], y[6]);
 1800|    183|   word3_muladd(&w2, &w1, &w0, x[4], y[5]);
 1801|    183|   word3_muladd(&w2, &w1, &w0, x[5], y[4]);
 1802|    183|   word3_muladd(&w2, &w1, &w0, x[6], y[3]);
 1803|    183|   word3_muladd(&w2, &w1, &w0, x[7], y[2]);
 1804|    183|   word3_muladd(&w2, &w1, &w0, x[8], y[1]);
 1805|    183|   word3_muladd(&w2, &w1, &w0, x[9], y[0]);
 1806|    183|   z[9] = w0;
 1807|    183|   w0 = 0;
 1808|       |
 1809|    183|   word3_muladd(&w0, &w2, &w1, x[0], y[10]);
 1810|    183|   word3_muladd(&w0, &w2, &w1, x[1], y[9]);
 1811|    183|   word3_muladd(&w0, &w2, &w1, x[2], y[8]);
 1812|    183|   word3_muladd(&w0, &w2, &w1, x[3], y[7]);
 1813|    183|   word3_muladd(&w0, &w2, &w1, x[4], y[6]);
 1814|    183|   word3_muladd(&w0, &w2, &w1, x[5], y[5]);
 1815|    183|   word3_muladd(&w0, &w2, &w1, x[6], y[4]);
 1816|    183|   word3_muladd(&w0, &w2, &w1, x[7], y[3]);
 1817|    183|   word3_muladd(&w0, &w2, &w1, x[8], y[2]);
 1818|    183|   word3_muladd(&w0, &w2, &w1, x[9], y[1]);
 1819|    183|   word3_muladd(&w0, &w2, &w1, x[10], y[0]);
 1820|    183|   z[10] = w1;
 1821|    183|   w1 = 0;
 1822|       |
 1823|    183|   word3_muladd(&w1, &w0, &w2, x[0], y[11]);
 1824|    183|   word3_muladd(&w1, &w0, &w2, x[1], y[10]);
 1825|    183|   word3_muladd(&w1, &w0, &w2, x[2], y[9]);
 1826|    183|   word3_muladd(&w1, &w0, &w2, x[3], y[8]);
 1827|    183|   word3_muladd(&w1, &w0, &w2, x[4], y[7]);
 1828|    183|   word3_muladd(&w1, &w0, &w2, x[5], y[6]);
 1829|    183|   word3_muladd(&w1, &w0, &w2, x[6], y[5]);
 1830|    183|   word3_muladd(&w1, &w0, &w2, x[7], y[4]);
 1831|    183|   word3_muladd(&w1, &w0, &w2, x[8], y[3]);
 1832|    183|   word3_muladd(&w1, &w0, &w2, x[9], y[2]);
 1833|    183|   word3_muladd(&w1, &w0, &w2, x[10], y[1]);
 1834|    183|   word3_muladd(&w1, &w0, &w2, x[11], y[0]);
 1835|    183|   z[11] = w2;
 1836|    183|   w2 = 0;
 1837|       |
 1838|    183|   word3_muladd(&w2, &w1, &w0, x[0], y[12]);
 1839|    183|   word3_muladd(&w2, &w1, &w0, x[1], y[11]);
 1840|    183|   word3_muladd(&w2, &w1, &w0, x[2], y[10]);
 1841|    183|   word3_muladd(&w2, &w1, &w0, x[3], y[9]);
 1842|    183|   word3_muladd(&w2, &w1, &w0, x[4], y[8]);
 1843|    183|   word3_muladd(&w2, &w1, &w0, x[5], y[7]);
 1844|    183|   word3_muladd(&w2, &w1, &w0, x[6], y[6]);
 1845|    183|   word3_muladd(&w2, &w1, &w0, x[7], y[5]);
 1846|    183|   word3_muladd(&w2, &w1, &w0, x[8], y[4]);
 1847|    183|   word3_muladd(&w2, &w1, &w0, x[9], y[3]);
 1848|    183|   word3_muladd(&w2, &w1, &w0, x[10], y[2]);
 1849|    183|   word3_muladd(&w2, &w1, &w0, x[11], y[1]);
 1850|    183|   word3_muladd(&w2, &w1, &w0, x[12], y[0]);
 1851|    183|   z[12] = w0;
 1852|    183|   w0 = 0;
 1853|       |
 1854|    183|   word3_muladd(&w0, &w2, &w1, x[0], y[13]);
 1855|    183|   word3_muladd(&w0, &w2, &w1, x[1], y[12]);
 1856|    183|   word3_muladd(&w0, &w2, &w1, x[2], y[11]);
 1857|    183|   word3_muladd(&w0, &w2, &w1, x[3], y[10]);
 1858|    183|   word3_muladd(&w0, &w2, &w1, x[4], y[9]);
 1859|    183|   word3_muladd(&w0, &w2, &w1, x[5], y[8]);
 1860|    183|   word3_muladd(&w0, &w2, &w1, x[6], y[7]);
 1861|    183|   word3_muladd(&w0, &w2, &w1, x[7], y[6]);
 1862|    183|   word3_muladd(&w0, &w2, &w1, x[8], y[5]);
 1863|    183|   word3_muladd(&w0, &w2, &w1, x[9], y[4]);
 1864|    183|   word3_muladd(&w0, &w2, &w1, x[10], y[3]);
 1865|    183|   word3_muladd(&w0, &w2, &w1, x[11], y[2]);
 1866|    183|   word3_muladd(&w0, &w2, &w1, x[12], y[1]);
 1867|    183|   word3_muladd(&w0, &w2, &w1, x[13], y[0]);
 1868|    183|   z[13] = w1;
 1869|    183|   w1 = 0;
 1870|       |
 1871|    183|   word3_muladd(&w1, &w0, &w2, x[0], y[14]);
 1872|    183|   word3_muladd(&w1, &w0, &w2, x[1], y[13]);
 1873|    183|   word3_muladd(&w1, &w0, &w2, x[2], y[12]);
 1874|    183|   word3_muladd(&w1, &w0, &w2, x[3], y[11]);
 1875|    183|   word3_muladd(&w1, &w0, &w2, x[4], y[10]);
 1876|    183|   word3_muladd(&w1, &w0, &w2, x[5], y[9]);
 1877|    183|   word3_muladd(&w1, &w0, &w2, x[6], y[8]);
 1878|    183|   word3_muladd(&w1, &w0, &w2, x[7], y[7]);
 1879|    183|   word3_muladd(&w1, &w0, &w2, x[8], y[6]);
 1880|    183|   word3_muladd(&w1, &w0, &w2, x[9], y[5]);
 1881|    183|   word3_muladd(&w1, &w0, &w2, x[10], y[4]);
 1882|    183|   word3_muladd(&w1, &w0, &w2, x[11], y[3]);
 1883|    183|   word3_muladd(&w1, &w0, &w2, x[12], y[2]);
 1884|    183|   word3_muladd(&w1, &w0, &w2, x[13], y[1]);
 1885|    183|   word3_muladd(&w1, &w0, &w2, x[14], y[0]);
 1886|    183|   z[14] = w2;
 1887|    183|   w2 = 0;
 1888|       |
 1889|    183|   word3_muladd(&w2, &w1, &w0, x[0], y[15]);
 1890|    183|   word3_muladd(&w2, &w1, &w0, x[1], y[14]);
 1891|    183|   word3_muladd(&w2, &w1, &w0, x[2], y[13]);
 1892|    183|   word3_muladd(&w2, &w1, &w0, x[3], y[12]);
 1893|    183|   word3_muladd(&w2, &w1, &w0, x[4], y[11]);
 1894|    183|   word3_muladd(&w2, &w1, &w0, x[5], y[10]);
 1895|    183|   word3_muladd(&w2, &w1, &w0, x[6], y[9]);
 1896|    183|   word3_muladd(&w2, &w1, &w0, x[7], y[8]);
 1897|    183|   word3_muladd(&w2, &w1, &w0, x[8], y[7]);
 1898|    183|   word3_muladd(&w2, &w1, &w0, x[9], y[6]);
 1899|    183|   word3_muladd(&w2, &w1, &w0, x[10], y[5]);
 1900|    183|   word3_muladd(&w2, &w1, &w0, x[11], y[4]);
 1901|    183|   word3_muladd(&w2, &w1, &w0, x[12], y[3]);
 1902|    183|   word3_muladd(&w2, &w1, &w0, x[13], y[2]);
 1903|    183|   word3_muladd(&w2, &w1, &w0, x[14], y[1]);
 1904|    183|   word3_muladd(&w2, &w1, &w0, x[15], y[0]);
 1905|    183|   z[15] = w0;
 1906|    183|   w0 = 0;
 1907|       |
 1908|    183|   word3_muladd(&w0, &w2, &w1, x[0], y[16]);
 1909|    183|   word3_muladd(&w0, &w2, &w1, x[1], y[15]);
 1910|    183|   word3_muladd(&w0, &w2, &w1, x[2], y[14]);
 1911|    183|   word3_muladd(&w0, &w2, &w1, x[3], y[13]);
 1912|    183|   word3_muladd(&w0, &w2, &w1, x[4], y[12]);
 1913|    183|   word3_muladd(&w0, &w2, &w1, x[5], y[11]);
 1914|    183|   word3_muladd(&w0, &w2, &w1, x[6], y[10]);
 1915|    183|   word3_muladd(&w0, &w2, &w1, x[7], y[9]);
 1916|    183|   word3_muladd(&w0, &w2, &w1, x[8], y[8]);
 1917|    183|   word3_muladd(&w0, &w2, &w1, x[9], y[7]);
 1918|    183|   word3_muladd(&w0, &w2, &w1, x[10], y[6]);
 1919|    183|   word3_muladd(&w0, &w2, &w1, x[11], y[5]);
 1920|    183|   word3_muladd(&w0, &w2, &w1, x[12], y[4]);
 1921|    183|   word3_muladd(&w0, &w2, &w1, x[13], y[3]);
 1922|    183|   word3_muladd(&w0, &w2, &w1, x[14], y[2]);
 1923|    183|   word3_muladd(&w0, &w2, &w1, x[15], y[1]);
 1924|    183|   word3_muladd(&w0, &w2, &w1, x[16], y[0]);
 1925|    183|   z[16] = w1;
 1926|    183|   w1 = 0;
 1927|       |
 1928|    183|   word3_muladd(&w1, &w0, &w2, x[0], y[17]);
 1929|    183|   word3_muladd(&w1, &w0, &w2, x[1], y[16]);
 1930|    183|   word3_muladd(&w1, &w0, &w2, x[2], y[15]);
 1931|    183|   word3_muladd(&w1, &w0, &w2, x[3], y[14]);
 1932|    183|   word3_muladd(&w1, &w0, &w2, x[4], y[13]);
 1933|    183|   word3_muladd(&w1, &w0, &w2, x[5], y[12]);
 1934|    183|   word3_muladd(&w1, &w0, &w2, x[6], y[11]);
 1935|    183|   word3_muladd(&w1, &w0, &w2, x[7], y[10]);
 1936|    183|   word3_muladd(&w1, &w0, &w2, x[8], y[9]);
 1937|    183|   word3_muladd(&w1, &w0, &w2, x[9], y[8]);
 1938|    183|   word3_muladd(&w1, &w0, &w2, x[10], y[7]);
 1939|    183|   word3_muladd(&w1, &w0, &w2, x[11], y[6]);
 1940|    183|   word3_muladd(&w1, &w0, &w2, x[12], y[5]);
 1941|    183|   word3_muladd(&w1, &w0, &w2, x[13], y[4]);
 1942|    183|   word3_muladd(&w1, &w0, &w2, x[14], y[3]);
 1943|    183|   word3_muladd(&w1, &w0, &w2, x[15], y[2]);
 1944|    183|   word3_muladd(&w1, &w0, &w2, x[16], y[1]);
 1945|    183|   word3_muladd(&w1, &w0, &w2, x[17], y[0]);
 1946|    183|   z[17] = w2;
 1947|    183|   w2 = 0;
 1948|       |
 1949|    183|   word3_muladd(&w2, &w1, &w0, x[0], y[18]);
 1950|    183|   word3_muladd(&w2, &w1, &w0, x[1], y[17]);
 1951|    183|   word3_muladd(&w2, &w1, &w0, x[2], y[16]);
 1952|    183|   word3_muladd(&w2, &w1, &w0, x[3], y[15]);
 1953|    183|   word3_muladd(&w2, &w1, &w0, x[4], y[14]);
 1954|    183|   word3_muladd(&w2, &w1, &w0, x[5], y[13]);
 1955|    183|   word3_muladd(&w2, &w1, &w0, x[6], y[12]);
 1956|    183|   word3_muladd(&w2, &w1, &w0, x[7], y[11]);
 1957|    183|   word3_muladd(&w2, &w1, &w0, x[8], y[10]);
 1958|    183|   word3_muladd(&w2, &w1, &w0, x[9], y[9]);
 1959|    183|   word3_muladd(&w2, &w1, &w0, x[10], y[8]);
 1960|    183|   word3_muladd(&w2, &w1, &w0, x[11], y[7]);
 1961|    183|   word3_muladd(&w2, &w1, &w0, x[12], y[6]);
 1962|    183|   word3_muladd(&w2, &w1, &w0, x[13], y[5]);
 1963|    183|   word3_muladd(&w2, &w1, &w0, x[14], y[4]);
 1964|    183|   word3_muladd(&w2, &w1, &w0, x[15], y[3]);
 1965|    183|   word3_muladd(&w2, &w1, &w0, x[16], y[2]);
 1966|    183|   word3_muladd(&w2, &w1, &w0, x[17], y[1]);
 1967|    183|   word3_muladd(&w2, &w1, &w0, x[18], y[0]);
 1968|    183|   z[18] = w0;
 1969|    183|   w0 = 0;
 1970|       |
 1971|    183|   word3_muladd(&w0, &w2, &w1, x[0], y[19]);
 1972|    183|   word3_muladd(&w0, &w2, &w1, x[1], y[18]);
 1973|    183|   word3_muladd(&w0, &w2, &w1, x[2], y[17]);
 1974|    183|   word3_muladd(&w0, &w2, &w1, x[3], y[16]);
 1975|    183|   word3_muladd(&w0, &w2, &w1, x[4], y[15]);
 1976|    183|   word3_muladd(&w0, &w2, &w1, x[5], y[14]);
 1977|    183|   word3_muladd(&w0, &w2, &w1, x[6], y[13]);
 1978|    183|   word3_muladd(&w0, &w2, &w1, x[7], y[12]);
 1979|    183|   word3_muladd(&w0, &w2, &w1, x[8], y[11]);
 1980|    183|   word3_muladd(&w0, &w2, &w1, x[9], y[10]);
 1981|    183|   word3_muladd(&w0, &w2, &w1, x[10], y[9]);
 1982|    183|   word3_muladd(&w0, &w2, &w1, x[11], y[8]);
 1983|    183|   word3_muladd(&w0, &w2, &w1, x[12], y[7]);
 1984|    183|   word3_muladd(&w0, &w2, &w1, x[13], y[6]);
 1985|    183|   word3_muladd(&w0, &w2, &w1, x[14], y[5]);
 1986|    183|   word3_muladd(&w0, &w2, &w1, x[15], y[4]);
 1987|    183|   word3_muladd(&w0, &w2, &w1, x[16], y[3]);
 1988|    183|   word3_muladd(&w0, &w2, &w1, x[17], y[2]);
 1989|    183|   word3_muladd(&w0, &w2, &w1, x[18], y[1]);
 1990|    183|   word3_muladd(&w0, &w2, &w1, x[19], y[0]);
 1991|    183|   z[19] = w1;
 1992|    183|   w1 = 0;
 1993|       |
 1994|    183|   word3_muladd(&w1, &w0, &w2, x[0], y[20]);
 1995|    183|   word3_muladd(&w1, &w0, &w2, x[1], y[19]);
 1996|    183|   word3_muladd(&w1, &w0, &w2, x[2], y[18]);
 1997|    183|   word3_muladd(&w1, &w0, &w2, x[3], y[17]);
 1998|    183|   word3_muladd(&w1, &w0, &w2, x[4], y[16]);
 1999|    183|   word3_muladd(&w1, &w0, &w2, x[5], y[15]);
 2000|    183|   word3_muladd(&w1, &w0, &w2, x[6], y[14]);
 2001|    183|   word3_muladd(&w1, &w0, &w2, x[7], y[13]);
 2002|    183|   word3_muladd(&w1, &w0, &w2, x[8], y[12]);
 2003|    183|   word3_muladd(&w1, &w0, &w2, x[9], y[11]);
 2004|    183|   word3_muladd(&w1, &w0, &w2, x[10], y[10]);
 2005|    183|   word3_muladd(&w1, &w0, &w2, x[11], y[9]);
 2006|    183|   word3_muladd(&w1, &w0, &w2, x[12], y[8]);
 2007|    183|   word3_muladd(&w1, &w0, &w2, x[13], y[7]);
 2008|    183|   word3_muladd(&w1, &w0, &w2, x[14], y[6]);
 2009|    183|   word3_muladd(&w1, &w0, &w2, x[15], y[5]);
 2010|    183|   word3_muladd(&w1, &w0, &w2, x[16], y[4]);
 2011|    183|   word3_muladd(&w1, &w0, &w2, x[17], y[3]);
 2012|    183|   word3_muladd(&w1, &w0, &w2, x[18], y[2]);
 2013|    183|   word3_muladd(&w1, &w0, &w2, x[19], y[1]);
 2014|    183|   word3_muladd(&w1, &w0, &w2, x[20], y[0]);
 2015|    183|   z[20] = w2;
 2016|    183|   w2 = 0;
 2017|       |
 2018|    183|   word3_muladd(&w2, &w1, &w0, x[0], y[21]);
 2019|    183|   word3_muladd(&w2, &w1, &w0, x[1], y[20]);
 2020|    183|   word3_muladd(&w2, &w1, &w0, x[2], y[19]);
 2021|    183|   word3_muladd(&w2, &w1, &w0, x[3], y[18]);
 2022|    183|   word3_muladd(&w2, &w1, &w0, x[4], y[17]);
 2023|    183|   word3_muladd(&w2, &w1, &w0, x[5], y[16]);
 2024|    183|   word3_muladd(&w2, &w1, &w0, x[6], y[15]);
 2025|    183|   word3_muladd(&w2, &w1, &w0, x[7], y[14]);
 2026|    183|   word3_muladd(&w2, &w1, &w0, x[8], y[13]);
 2027|    183|   word3_muladd(&w2, &w1, &w0, x[9], y[12]);
 2028|    183|   word3_muladd(&w2, &w1, &w0, x[10], y[11]);
 2029|    183|   word3_muladd(&w2, &w1, &w0, x[11], y[10]);
 2030|    183|   word3_muladd(&w2, &w1, &w0, x[12], y[9]);
 2031|    183|   word3_muladd(&w2, &w1, &w0, x[13], y[8]);
 2032|    183|   word3_muladd(&w2, &w1, &w0, x[14], y[7]);
 2033|    183|   word3_muladd(&w2, &w1, &w0, x[15], y[6]);
 2034|    183|   word3_muladd(&w2, &w1, &w0, x[16], y[5]);
 2035|    183|   word3_muladd(&w2, &w1, &w0, x[17], y[4]);
 2036|    183|   word3_muladd(&w2, &w1, &w0, x[18], y[3]);
 2037|    183|   word3_muladd(&w2, &w1, &w0, x[19], y[2]);
 2038|    183|   word3_muladd(&w2, &w1, &w0, x[20], y[1]);
 2039|    183|   word3_muladd(&w2, &w1, &w0, x[21], y[0]);
 2040|    183|   z[21] = w0;
 2041|    183|   w0 = 0;
 2042|       |
 2043|    183|   word3_muladd(&w0, &w2, &w1, x[0], y[22]);
 2044|    183|   word3_muladd(&w0, &w2, &w1, x[1], y[21]);
 2045|    183|   word3_muladd(&w0, &w2, &w1, x[2], y[20]);
 2046|    183|   word3_muladd(&w0, &w2, &w1, x[3], y[19]);
 2047|    183|   word3_muladd(&w0, &w2, &w1, x[4], y[18]);
 2048|    183|   word3_muladd(&w0, &w2, &w1, x[5], y[17]);
 2049|    183|   word3_muladd(&w0, &w2, &w1, x[6], y[16]);
 2050|    183|   word3_muladd(&w0, &w2, &w1, x[7], y[15]);
 2051|    183|   word3_muladd(&w0, &w2, &w1, x[8], y[14]);
 2052|    183|   word3_muladd(&w0, &w2, &w1, x[9], y[13]);
 2053|    183|   word3_muladd(&w0, &w2, &w1, x[10], y[12]);
 2054|    183|   word3_muladd(&w0, &w2, &w1, x[11], y[11]);
 2055|    183|   word3_muladd(&w0, &w2, &w1, x[12], y[10]);
 2056|    183|   word3_muladd(&w0, &w2, &w1, x[13], y[9]);
 2057|    183|   word3_muladd(&w0, &w2, &w1, x[14], y[8]);
 2058|    183|   word3_muladd(&w0, &w2, &w1, x[15], y[7]);
 2059|    183|   word3_muladd(&w0, &w2, &w1, x[16], y[6]);
 2060|    183|   word3_muladd(&w0, &w2, &w1, x[17], y[5]);
 2061|    183|   word3_muladd(&w0, &w2, &w1, x[18], y[4]);
 2062|    183|   word3_muladd(&w0, &w2, &w1, x[19], y[3]);
 2063|    183|   word3_muladd(&w0, &w2, &w1, x[20], y[2]);
 2064|    183|   word3_muladd(&w0, &w2, &w1, x[21], y[1]);
 2065|    183|   word3_muladd(&w0, &w2, &w1, x[22], y[0]);
 2066|    183|   z[22] = w1;
 2067|    183|   w1 = 0;
 2068|       |
 2069|    183|   word3_muladd(&w1, &w0, &w2, x[0], y[23]);
 2070|    183|   word3_muladd(&w1, &w0, &w2, x[1], y[22]);
 2071|    183|   word3_muladd(&w1, &w0, &w2, x[2], y[21]);
 2072|    183|   word3_muladd(&w1, &w0, &w2, x[3], y[20]);
 2073|    183|   word3_muladd(&w1, &w0, &w2, x[4], y[19]);
 2074|    183|   word3_muladd(&w1, &w0, &w2, x[5], y[18]);
 2075|    183|   word3_muladd(&w1, &w0, &w2, x[6], y[17]);
 2076|    183|   word3_muladd(&w1, &w0, &w2, x[7], y[16]);
 2077|    183|   word3_muladd(&w1, &w0, &w2, x[8], y[15]);
 2078|    183|   word3_muladd(&w1, &w0, &w2, x[9], y[14]);
 2079|    183|   word3_muladd(&w1, &w0, &w2, x[10], y[13]);
 2080|    183|   word3_muladd(&w1, &w0, &w2, x[11], y[12]);
 2081|    183|   word3_muladd(&w1, &w0, &w2, x[12], y[11]);
 2082|    183|   word3_muladd(&w1, &w0, &w2, x[13], y[10]);
 2083|    183|   word3_muladd(&w1, &w0, &w2, x[14], y[9]);
 2084|    183|   word3_muladd(&w1, &w0, &w2, x[15], y[8]);
 2085|    183|   word3_muladd(&w1, &w0, &w2, x[16], y[7]);
 2086|    183|   word3_muladd(&w1, &w0, &w2, x[17], y[6]);
 2087|    183|   word3_muladd(&w1, &w0, &w2, x[18], y[5]);
 2088|    183|   word3_muladd(&w1, &w0, &w2, x[19], y[4]);
 2089|    183|   word3_muladd(&w1, &w0, &w2, x[20], y[3]);
 2090|    183|   word3_muladd(&w1, &w0, &w2, x[21], y[2]);
 2091|    183|   word3_muladd(&w1, &w0, &w2, x[22], y[1]);
 2092|    183|   word3_muladd(&w1, &w0, &w2, x[23], y[0]);
 2093|    183|   z[23] = w2;
 2094|    183|   w2 = 0;
 2095|       |
 2096|    183|   word3_muladd(&w2, &w1, &w0, x[1], y[23]);
 2097|    183|   word3_muladd(&w2, &w1, &w0, x[2], y[22]);
 2098|    183|   word3_muladd(&w2, &w1, &w0, x[3], y[21]);
 2099|    183|   word3_muladd(&w2, &w1, &w0, x[4], y[20]);
 2100|    183|   word3_muladd(&w2, &w1, &w0, x[5], y[19]);
 2101|    183|   word3_muladd(&w2, &w1, &w0, x[6], y[18]);
 2102|    183|   word3_muladd(&w2, &w1, &w0, x[7], y[17]);
 2103|    183|   word3_muladd(&w2, &w1, &w0, x[8], y[16]);
 2104|    183|   word3_muladd(&w2, &w1, &w0, x[9], y[15]);
 2105|    183|   word3_muladd(&w2, &w1, &w0, x[10], y[14]);
 2106|    183|   word3_muladd(&w2, &w1, &w0, x[11], y[13]);
 2107|    183|   word3_muladd(&w2, &w1, &w0, x[12], y[12]);
 2108|    183|   word3_muladd(&w2, &w1, &w0, x[13], y[11]);
 2109|    183|   word3_muladd(&w2, &w1, &w0, x[14], y[10]);
 2110|    183|   word3_muladd(&w2, &w1, &w0, x[15], y[9]);
 2111|    183|   word3_muladd(&w2, &w1, &w0, x[16], y[8]);
 2112|    183|   word3_muladd(&w2, &w1, &w0, x[17], y[7]);
 2113|    183|   word3_muladd(&w2, &w1, &w0, x[18], y[6]);
 2114|    183|   word3_muladd(&w2, &w1, &w0, x[19], y[5]);
 2115|    183|   word3_muladd(&w2, &w1, &w0, x[20], y[4]);
 2116|    183|   word3_muladd(&w2, &w1, &w0, x[21], y[3]);
 2117|    183|   word3_muladd(&w2, &w1, &w0, x[22], y[2]);
 2118|    183|   word3_muladd(&w2, &w1, &w0, x[23], y[1]);
 2119|    183|   z[24] = w0;
 2120|    183|   w0 = 0;
 2121|       |
 2122|    183|   word3_muladd(&w0, &w2, &w1, x[2], y[23]);
 2123|    183|   word3_muladd(&w0, &w2, &w1, x[3], y[22]);
 2124|    183|   word3_muladd(&w0, &w2, &w1, x[4], y[21]);
 2125|    183|   word3_muladd(&w0, &w2, &w1, x[5], y[20]);
 2126|    183|   word3_muladd(&w0, &w2, &w1, x[6], y[19]);
 2127|    183|   word3_muladd(&w0, &w2, &w1, x[7], y[18]);
 2128|    183|   word3_muladd(&w0, &w2, &w1, x[8], y[17]);
 2129|    183|   word3_muladd(&w0, &w2, &w1, x[9], y[16]);
 2130|    183|   word3_muladd(&w0, &w2, &w1, x[10], y[15]);
 2131|    183|   word3_muladd(&w0, &w2, &w1, x[11], y[14]);
 2132|    183|   word3_muladd(&w0, &w2, &w1, x[12], y[13]);
 2133|    183|   word3_muladd(&w0, &w2, &w1, x[13], y[12]);
 2134|    183|   word3_muladd(&w0, &w2, &w1, x[14], y[11]);
 2135|    183|   word3_muladd(&w0, &w2, &w1, x[15], y[10]);
 2136|    183|   word3_muladd(&w0, &w2, &w1, x[16], y[9]);
 2137|    183|   word3_muladd(&w0, &w2, &w1, x[17], y[8]);
 2138|    183|   word3_muladd(&w0, &w2, &w1, x[18], y[7]);
 2139|    183|   word3_muladd(&w0, &w2, &w1, x[19], y[6]);
 2140|    183|   word3_muladd(&w0, &w2, &w1, x[20], y[5]);
 2141|    183|   word3_muladd(&w0, &w2, &w1, x[21], y[4]);
 2142|    183|   word3_muladd(&w0, &w2, &w1, x[22], y[3]);
 2143|    183|   word3_muladd(&w0, &w2, &w1, x[23], y[2]);
 2144|    183|   z[25] = w1;
 2145|    183|   w1 = 0;
 2146|       |
 2147|    183|   word3_muladd(&w1, &w0, &w2, x[3], y[23]);
 2148|    183|   word3_muladd(&w1, &w0, &w2, x[4], y[22]);
 2149|    183|   word3_muladd(&w1, &w0, &w2, x[5], y[21]);
 2150|    183|   word3_muladd(&w1, &w0, &w2, x[6], y[20]);
 2151|    183|   word3_muladd(&w1, &w0, &w2, x[7], y[19]);
 2152|    183|   word3_muladd(&w1, &w0, &w2, x[8], y[18]);
 2153|    183|   word3_muladd(&w1, &w0, &w2, x[9], y[17]);
 2154|    183|   word3_muladd(&w1, &w0, &w2, x[10], y[16]);
 2155|    183|   word3_muladd(&w1, &w0, &w2, x[11], y[15]);
 2156|    183|   word3_muladd(&w1, &w0, &w2, x[12], y[14]);
 2157|    183|   word3_muladd(&w1, &w0, &w2, x[13], y[13]);
 2158|    183|   word3_muladd(&w1, &w0, &w2, x[14], y[12]);
 2159|    183|   word3_muladd(&w1, &w0, &w2, x[15], y[11]);
 2160|    183|   word3_muladd(&w1, &w0, &w2, x[16], y[10]);
 2161|    183|   word3_muladd(&w1, &w0, &w2, x[17], y[9]);
 2162|    183|   word3_muladd(&w1, &w0, &w2, x[18], y[8]);
 2163|    183|   word3_muladd(&w1, &w0, &w2, x[19], y[7]);
 2164|    183|   word3_muladd(&w1, &w0, &w2, x[20], y[6]);
 2165|    183|   word3_muladd(&w1, &w0, &w2, x[21], y[5]);
 2166|    183|   word3_muladd(&w1, &w0, &w2, x[22], y[4]);
 2167|    183|   word3_muladd(&w1, &w0, &w2, x[23], y[3]);
 2168|    183|   z[26] = w2;
 2169|    183|   w2 = 0;
 2170|       |
 2171|    183|   word3_muladd(&w2, &w1, &w0, x[4], y[23]);
 2172|    183|   word3_muladd(&w2, &w1, &w0, x[5], y[22]);
 2173|    183|   word3_muladd(&w2, &w1, &w0, x[6], y[21]);
 2174|    183|   word3_muladd(&w2, &w1, &w0, x[7], y[20]);
 2175|    183|   word3_muladd(&w2, &w1, &w0, x[8], y[19]);
 2176|    183|   word3_muladd(&w2, &w1, &w0, x[9], y[18]);
 2177|    183|   word3_muladd(&w2, &w1, &w0, x[10], y[17]);
 2178|    183|   word3_muladd(&w2, &w1, &w0, x[11], y[16]);
 2179|    183|   word3_muladd(&w2, &w1, &w0, x[12], y[15]);
 2180|    183|   word3_muladd(&w2, &w1, &w0, x[13], y[14]);
 2181|    183|   word3_muladd(&w2, &w1, &w0, x[14], y[13]);
 2182|    183|   word3_muladd(&w2, &w1, &w0, x[15], y[12]);
 2183|    183|   word3_muladd(&w2, &w1, &w0, x[16], y[11]);
 2184|    183|   word3_muladd(&w2, &w1, &w0, x[17], y[10]);
 2185|    183|   word3_muladd(&w2, &w1, &w0, x[18], y[9]);
 2186|    183|   word3_muladd(&w2, &w1, &w0, x[19], y[8]);
 2187|    183|   word3_muladd(&w2, &w1, &w0, x[20], y[7]);
 2188|    183|   word3_muladd(&w2, &w1, &w0, x[21], y[6]);
 2189|    183|   word3_muladd(&w2, &w1, &w0, x[22], y[5]);
 2190|    183|   word3_muladd(&w2, &w1, &w0, x[23], y[4]);
 2191|    183|   z[27] = w0;
 2192|    183|   w0 = 0;
 2193|       |
 2194|    183|   word3_muladd(&w0, &w2, &w1, x[5], y[23]);
 2195|    183|   word3_muladd(&w0, &w2, &w1, x[6], y[22]);
 2196|    183|   word3_muladd(&w0, &w2, &w1, x[7], y[21]);
 2197|    183|   word3_muladd(&w0, &w2, &w1, x[8], y[20]);
 2198|    183|   word3_muladd(&w0, &w2, &w1, x[9], y[19]);
 2199|    183|   word3_muladd(&w0, &w2, &w1, x[10], y[18]);
 2200|    183|   word3_muladd(&w0, &w2, &w1, x[11], y[17]);
 2201|    183|   word3_muladd(&w0, &w2, &w1, x[12], y[16]);
 2202|    183|   word3_muladd(&w0, &w2, &w1, x[13], y[15]);
 2203|    183|   word3_muladd(&w0, &w2, &w1, x[14], y[14]);
 2204|    183|   word3_muladd(&w0, &w2, &w1, x[15], y[13]);
 2205|    183|   word3_muladd(&w0, &w2, &w1, x[16], y[12]);
 2206|    183|   word3_muladd(&w0, &w2, &w1, x[17], y[11]);
 2207|    183|   word3_muladd(&w0, &w2, &w1, x[18], y[10]);
 2208|    183|   word3_muladd(&w0, &w2, &w1, x[19], y[9]);
 2209|    183|   word3_muladd(&w0, &w2, &w1, x[20], y[8]);
 2210|    183|   word3_muladd(&w0, &w2, &w1, x[21], y[7]);
 2211|    183|   word3_muladd(&w0, &w2, &w1, x[22], y[6]);
 2212|    183|   word3_muladd(&w0, &w2, &w1, x[23], y[5]);
 2213|    183|   z[28] = w1;
 2214|    183|   w1 = 0;
 2215|       |
 2216|    183|   word3_muladd(&w1, &w0, &w2, x[6], y[23]);
 2217|    183|   word3_muladd(&w1, &w0, &w2, x[7], y[22]);
 2218|    183|   word3_muladd(&w1, &w0, &w2, x[8], y[21]);
 2219|    183|   word3_muladd(&w1, &w0, &w2, x[9], y[20]);
 2220|    183|   word3_muladd(&w1, &w0, &w2, x[10], y[19]);
 2221|    183|   word3_muladd(&w1, &w0, &w2, x[11], y[18]);
 2222|    183|   word3_muladd(&w1, &w0, &w2, x[12], y[17]);
 2223|    183|   word3_muladd(&w1, &w0, &w2, x[13], y[16]);
 2224|    183|   word3_muladd(&w1, &w0, &w2, x[14], y[15]);
 2225|    183|   word3_muladd(&w1, &w0, &w2, x[15], y[14]);
 2226|    183|   word3_muladd(&w1, &w0, &w2, x[16], y[13]);
 2227|    183|   word3_muladd(&w1, &w0, &w2, x[17], y[12]);
 2228|    183|   word3_muladd(&w1, &w0, &w2, x[18], y[11]);
 2229|    183|   word3_muladd(&w1, &w0, &w2, x[19], y[10]);
 2230|    183|   word3_muladd(&w1, &w0, &w2, x[20], y[9]);
 2231|    183|   word3_muladd(&w1, &w0, &w2, x[21], y[8]);
 2232|    183|   word3_muladd(&w1, &w0, &w2, x[22], y[7]);
 2233|    183|   word3_muladd(&w1, &w0, &w2, x[23], y[6]);
 2234|    183|   z[29] = w2;
 2235|    183|   w2 = 0;
 2236|       |
 2237|    183|   word3_muladd(&w2, &w1, &w0, x[7], y[23]);
 2238|    183|   word3_muladd(&w2, &w1, &w0, x[8], y[22]);
 2239|    183|   word3_muladd(&w2, &w1, &w0, x[9], y[21]);
 2240|    183|   word3_muladd(&w2, &w1, &w0, x[10], y[20]);
 2241|    183|   word3_muladd(&w2, &w1, &w0, x[11], y[19]);
 2242|    183|   word3_muladd(&w2, &w1, &w0, x[12], y[18]);
 2243|    183|   word3_muladd(&w2, &w1, &w0, x[13], y[17]);
 2244|    183|   word3_muladd(&w2, &w1, &w0, x[14], y[16]);
 2245|    183|   word3_muladd(&w2, &w1, &w0, x[15], y[15]);
 2246|    183|   word3_muladd(&w2, &w1, &w0, x[16], y[14]);
 2247|    183|   word3_muladd(&w2, &w1, &w0, x[17], y[13]);
 2248|    183|   word3_muladd(&w2, &w1, &w0, x[18], y[12]);
 2249|    183|   word3_muladd(&w2, &w1, &w0, x[19], y[11]);
 2250|    183|   word3_muladd(&w2, &w1, &w0, x[20], y[10]);
 2251|    183|   word3_muladd(&w2, &w1, &w0, x[21], y[9]);
 2252|    183|   word3_muladd(&w2, &w1, &w0, x[22], y[8]);
 2253|    183|   word3_muladd(&w2, &w1, &w0, x[23], y[7]);
 2254|    183|   z[30] = w0;
 2255|    183|   w0 = 0;
 2256|       |
 2257|    183|   word3_muladd(&w0, &w2, &w1, x[8], y[23]);
 2258|    183|   word3_muladd(&w0, &w2, &w1, x[9], y[22]);
 2259|    183|   word3_muladd(&w0, &w2, &w1, x[10], y[21]);
 2260|    183|   word3_muladd(&w0, &w2, &w1, x[11], y[20]);
 2261|    183|   word3_muladd(&w0, &w2, &w1, x[12], y[19]);
 2262|    183|   word3_muladd(&w0, &w2, &w1, x[13], y[18]);
 2263|    183|   word3_muladd(&w0, &w2, &w1, x[14], y[17]);
 2264|    183|   word3_muladd(&w0, &w2, &w1, x[15], y[16]);
 2265|    183|   word3_muladd(&w0, &w2, &w1, x[16], y[15]);
 2266|    183|   word3_muladd(&w0, &w2, &w1, x[17], y[14]);
 2267|    183|   word3_muladd(&w0, &w2, &w1, x[18], y[13]);
 2268|    183|   word3_muladd(&w0, &w2, &w1, x[19], y[12]);
 2269|    183|   word3_muladd(&w0, &w2, &w1, x[20], y[11]);
 2270|    183|   word3_muladd(&w0, &w2, &w1, x[21], y[10]);
 2271|    183|   word3_muladd(&w0, &w2, &w1, x[22], y[9]);
 2272|    183|   word3_muladd(&w0, &w2, &w1, x[23], y[8]);
 2273|    183|   z[31] = w1;
 2274|    183|   w1 = 0;
 2275|       |
 2276|    183|   word3_muladd(&w1, &w0, &w2, x[9], y[23]);
 2277|    183|   word3_muladd(&w1, &w0, &w2, x[10], y[22]);
 2278|    183|   word3_muladd(&w1, &w0, &w2, x[11], y[21]);
 2279|    183|   word3_muladd(&w1, &w0, &w2, x[12], y[20]);
 2280|    183|   word3_muladd(&w1, &w0, &w2, x[13], y[19]);
 2281|    183|   word3_muladd(&w1, &w0, &w2, x[14], y[18]);
 2282|    183|   word3_muladd(&w1, &w0, &w2, x[15], y[17]);
 2283|    183|   word3_muladd(&w1, &w0, &w2, x[16], y[16]);
 2284|    183|   word3_muladd(&w1, &w0, &w2, x[17], y[15]);
 2285|    183|   word3_muladd(&w1, &w0, &w2, x[18], y[14]);
 2286|    183|   word3_muladd(&w1, &w0, &w2, x[19], y[13]);
 2287|    183|   word3_muladd(&w1, &w0, &w2, x[20], y[12]);
 2288|    183|   word3_muladd(&w1, &w0, &w2, x[21], y[11]);
 2289|    183|   word3_muladd(&w1, &w0, &w2, x[22], y[10]);
 2290|    183|   word3_muladd(&w1, &w0, &w2, x[23], y[9]);
 2291|    183|   z[32] = w2;
 2292|    183|   w2 = 0;
 2293|       |
 2294|    183|   word3_muladd(&w2, &w1, &w0, x[10], y[23]);
 2295|    183|   word3_muladd(&w2, &w1, &w0, x[11], y[22]);
 2296|    183|   word3_muladd(&w2, &w1, &w0, x[12], y[21]);
 2297|    183|   word3_muladd(&w2, &w1, &w0, x[13], y[20]);
 2298|    183|   word3_muladd(&w2, &w1, &w0, x[14], y[19]);
 2299|    183|   word3_muladd(&w2, &w1, &w0, x[15], y[18]);
 2300|    183|   word3_muladd(&w2, &w1, &w0, x[16], y[17]);
 2301|    183|   word3_muladd(&w2, &w1, &w0, x[17], y[16]);
 2302|    183|   word3_muladd(&w2, &w1, &w0, x[18], y[15]);
 2303|    183|   word3_muladd(&w2, &w1, &w0, x[19], y[14]);
 2304|    183|   word3_muladd(&w2, &w1, &w0, x[20], y[13]);
 2305|    183|   word3_muladd(&w2, &w1, &w0, x[21], y[12]);
 2306|    183|   word3_muladd(&w2, &w1, &w0, x[22], y[11]);
 2307|    183|   word3_muladd(&w2, &w1, &w0, x[23], y[10]);
 2308|    183|   z[33] = w0;
 2309|    183|   w0 = 0;
 2310|       |
 2311|    183|   word3_muladd(&w0, &w2, &w1, x[11], y[23]);
 2312|    183|   word3_muladd(&w0, &w2, &w1, x[12], y[22]);
 2313|    183|   word3_muladd(&w0, &w2, &w1, x[13], y[21]);
 2314|    183|   word3_muladd(&w0, &w2, &w1, x[14], y[20]);
 2315|    183|   word3_muladd(&w0, &w2, &w1, x[15], y[19]);
 2316|    183|   word3_muladd(&w0, &w2, &w1, x[16], y[18]);
 2317|    183|   word3_muladd(&w0, &w2, &w1, x[17], y[17]);
 2318|    183|   word3_muladd(&w0, &w2, &w1, x[18], y[16]);
 2319|    183|   word3_muladd(&w0, &w2, &w1, x[19], y[15]);
 2320|    183|   word3_muladd(&w0, &w2, &w1, x[20], y[14]);
 2321|    183|   word3_muladd(&w0, &w2, &w1, x[21], y[13]);
 2322|    183|   word3_muladd(&w0, &w2, &w1, x[22], y[12]);
 2323|    183|   word3_muladd(&w0, &w2, &w1, x[23], y[11]);
 2324|    183|   z[34] = w1;
 2325|    183|   w1 = 0;
 2326|       |
 2327|    183|   word3_muladd(&w1, &w0, &w2, x[12], y[23]);
 2328|    183|   word3_muladd(&w1, &w0, &w2, x[13], y[22]);
 2329|    183|   word3_muladd(&w1, &w0, &w2, x[14], y[21]);
 2330|    183|   word3_muladd(&w1, &w0, &w2, x[15], y[20]);
 2331|    183|   word3_muladd(&w1, &w0, &w2, x[16], y[19]);
 2332|    183|   word3_muladd(&w1, &w0, &w2, x[17], y[18]);
 2333|    183|   word3_muladd(&w1, &w0, &w2, x[18], y[17]);
 2334|    183|   word3_muladd(&w1, &w0, &w2, x[19], y[16]);
 2335|    183|   word3_muladd(&w1, &w0, &w2, x[20], y[15]);
 2336|    183|   word3_muladd(&w1, &w0, &w2, x[21], y[14]);
 2337|    183|   word3_muladd(&w1, &w0, &w2, x[22], y[13]);
 2338|    183|   word3_muladd(&w1, &w0, &w2, x[23], y[12]);
 2339|    183|   z[35] = w2;
 2340|    183|   w2 = 0;
 2341|       |
 2342|    183|   word3_muladd(&w2, &w1, &w0, x[13], y[23]);
 2343|    183|   word3_muladd(&w2, &w1, &w0, x[14], y[22]);
 2344|    183|   word3_muladd(&w2, &w1, &w0, x[15], y[21]);
 2345|    183|   word3_muladd(&w2, &w1, &w0, x[16], y[20]);
 2346|    183|   word3_muladd(&w2, &w1, &w0, x[17], y[19]);
 2347|    183|   word3_muladd(&w2, &w1, &w0, x[18], y[18]);
 2348|    183|   word3_muladd(&w2, &w1, &w0, x[19], y[17]);
 2349|    183|   word3_muladd(&w2, &w1, &w0, x[20], y[16]);
 2350|    183|   word3_muladd(&w2, &w1, &w0, x[21], y[15]);
 2351|    183|   word3_muladd(&w2, &w1, &w0, x[22], y[14]);
 2352|    183|   word3_muladd(&w2, &w1, &w0, x[23], y[13]);
 2353|    183|   z[36] = w0;
 2354|    183|   w0 = 0;
 2355|       |
 2356|    183|   word3_muladd(&w0, &w2, &w1, x[14], y[23]);
 2357|    183|   word3_muladd(&w0, &w2, &w1, x[15], y[22]);
 2358|    183|   word3_muladd(&w0, &w2, &w1, x[16], y[21]);
 2359|    183|   word3_muladd(&w0, &w2, &w1, x[17], y[20]);
 2360|    183|   word3_muladd(&w0, &w2, &w1, x[18], y[19]);
 2361|    183|   word3_muladd(&w0, &w2, &w1, x[19], y[18]);
 2362|    183|   word3_muladd(&w0, &w2, &w1, x[20], y[17]);
 2363|    183|   word3_muladd(&w0, &w2, &w1, x[21], y[16]);
 2364|    183|   word3_muladd(&w0, &w2, &w1, x[22], y[15]);
 2365|    183|   word3_muladd(&w0, &w2, &w1, x[23], y[14]);
 2366|    183|   z[37] = w1;
 2367|    183|   w1 = 0;
 2368|       |
 2369|    183|   word3_muladd(&w1, &w0, &w2, x[15], y[23]);
 2370|    183|   word3_muladd(&w1, &w0, &w2, x[16], y[22]);
 2371|    183|   word3_muladd(&w1, &w0, &w2, x[17], y[21]);
 2372|    183|   word3_muladd(&w1, &w0, &w2, x[18], y[20]);
 2373|    183|   word3_muladd(&w1, &w0, &w2, x[19], y[19]);
 2374|    183|   word3_muladd(&w1, &w0, &w2, x[20], y[18]);
 2375|    183|   word3_muladd(&w1, &w0, &w2, x[21], y[17]);
 2376|    183|   word3_muladd(&w1, &w0, &w2, x[22], y[16]);
 2377|    183|   word3_muladd(&w1, &w0, &w2, x[23], y[15]);
 2378|    183|   z[38] = w2;
 2379|    183|   w2 = 0;
 2380|       |
 2381|    183|   word3_muladd(&w2, &w1, &w0, x[16], y[23]);
 2382|    183|   word3_muladd(&w2, &w1, &w0, x[17], y[22]);
 2383|    183|   word3_muladd(&w2, &w1, &w0, x[18], y[21]);
 2384|    183|   word3_muladd(&w2, &w1, &w0, x[19], y[20]);
 2385|    183|   word3_muladd(&w2, &w1, &w0, x[20], y[19]);
 2386|    183|   word3_muladd(&w2, &w1, &w0, x[21], y[18]);
 2387|    183|   word3_muladd(&w2, &w1, &w0, x[22], y[17]);
 2388|    183|   word3_muladd(&w2, &w1, &w0, x[23], y[16]);
 2389|    183|   z[39] = w0;
 2390|    183|   w0 = 0;
 2391|       |
 2392|    183|   word3_muladd(&w0, &w2, &w1, x[17], y[23]);
 2393|    183|   word3_muladd(&w0, &w2, &w1, x[18], y[22]);
 2394|    183|   word3_muladd(&w0, &w2, &w1, x[19], y[21]);
 2395|    183|   word3_muladd(&w0, &w2, &w1, x[20], y[20]);
 2396|    183|   word3_muladd(&w0, &w2, &w1, x[21], y[19]);
 2397|    183|   word3_muladd(&w0, &w2, &w1, x[22], y[18]);
 2398|    183|   word3_muladd(&w0, &w2, &w1, x[23], y[17]);
 2399|    183|   z[40] = w1;
 2400|    183|   w1 = 0;
 2401|       |
 2402|    183|   word3_muladd(&w1, &w0, &w2, x[18], y[23]);
 2403|    183|   word3_muladd(&w1, &w0, &w2, x[19], y[22]);
 2404|    183|   word3_muladd(&w1, &w0, &w2, x[20], y[21]);
 2405|    183|   word3_muladd(&w1, &w0, &w2, x[21], y[20]);
 2406|    183|   word3_muladd(&w1, &w0, &w2, x[22], y[19]);
 2407|    183|   word3_muladd(&w1, &w0, &w2, x[23], y[18]);
 2408|    183|   z[41] = w2;
 2409|    183|   w2 = 0;
 2410|       |
 2411|    183|   word3_muladd(&w2, &w1, &w0, x[19], y[23]);
 2412|    183|   word3_muladd(&w2, &w1, &w0, x[20], y[22]);
 2413|    183|   word3_muladd(&w2, &w1, &w0, x[21], y[21]);
 2414|    183|   word3_muladd(&w2, &w1, &w0, x[22], y[20]);
 2415|    183|   word3_muladd(&w2, &w1, &w0, x[23], y[19]);
 2416|    183|   z[42] = w0;
 2417|    183|   w0 = 0;
 2418|       |
 2419|    183|   word3_muladd(&w0, &w2, &w1, x[20], y[23]);
 2420|    183|   word3_muladd(&w0, &w2, &w1, x[21], y[22]);
 2421|    183|   word3_muladd(&w0, &w2, &w1, x[22], y[21]);
 2422|    183|   word3_muladd(&w0, &w2, &w1, x[23], y[20]);
 2423|    183|   z[43] = w1;
 2424|    183|   w1 = 0;
 2425|       |
 2426|    183|   word3_muladd(&w1, &w0, &w2, x[21], y[23]);
 2427|    183|   word3_muladd(&w1, &w0, &w2, x[22], y[22]);
 2428|    183|   word3_muladd(&w1, &w0, &w2, x[23], y[21]);
 2429|    183|   z[44] = w2;
 2430|    183|   w2 = 0;
 2431|       |
 2432|    183|   word3_muladd(&w2, &w1, &w0, x[22], y[23]);
 2433|    183|   word3_muladd(&w2, &w1, &w0, x[23], y[22]);
 2434|    183|   z[45] = w0;
 2435|    183|   w0 = 0;
 2436|       |
 2437|    183|   word3_muladd(&w0, &w2, &w1, x[23], y[23]);
 2438|    183|   z[46] = w1;
 2439|    183|   z[47] = w2;
 2440|    183|}

_ZN5Botan12basecase_mulEPmmPKmmS2_m:
   20|  39.3k|void basecase_mul(word z[], size_t z_size, const word x[], size_t x_size, const word y[], size_t y_size) {
   21|  39.3k|   if(z_size < x_size + y_size) {
  ------------------
  |  Branch (21:7): [True: 0, False: 39.3k]
  ------------------
   22|      0|      throw Invalid_Argument("basecase_mul z_size too small");
   23|      0|   }
   24|       |
   25|  39.3k|   const size_t x_size_8 = x_size - (x_size % 8);
   26|       |
   27|  39.3k|   clear_mem(z, z_size);
   28|       |
   29|   283k|   for(size_t i = 0; i != y_size; ++i) {
  ------------------
  |  Branch (29:22): [True: 243k, False: 39.3k]
  ------------------
   30|   243k|      const word y_i = y[i];
   31|       |
   32|   243k|      word carry = 0;
   33|       |
   34|   495k|      for(size_t j = 0; j != x_size_8; j += 8) {
  ------------------
  |  Branch (34:25): [True: 251k, False: 243k]
  ------------------
   35|   251k|         carry = word8_madd3(z + i + j, x + j, y_i, carry);
   36|   251k|      }
   37|       |
   38|  1.00M|      for(size_t j = x_size_8; j != x_size; ++j) {
  ------------------
  |  Branch (38:32): [True: 762k, False: 243k]
  ------------------
   39|   762k|         z[i + j] = word_madd3(x[j], y_i, z[i + j], &carry);
   40|   762k|      }
   41|       |
   42|   243k|      z[x_size + i] = carry;
   43|   243k|   }
   44|  39.3k|}
_ZN5Botan12basecase_sqrEPmmPKmm:
   46|  67.2k|void basecase_sqr(word z[], size_t z_size, const word x[], size_t x_size) {
   47|  67.2k|   if(z_size < 2 * x_size) {
  ------------------
  |  Branch (47:7): [True: 0, False: 67.2k]
  ------------------
   48|      0|      throw Invalid_Argument("basecase_sqr z_size too small");
   49|      0|   }
   50|       |
   51|  67.2k|   const size_t x_size_8 = x_size - (x_size % 8);
   52|       |
   53|  67.2k|   clear_mem(z, z_size);
   54|       |
   55|   391k|   for(size_t i = 0; i != x_size; ++i) {
  ------------------
  |  Branch (55:22): [True: 324k, False: 67.2k]
  ------------------
   56|   324k|      const word x_i = x[i];
   57|       |
   58|   324k|      word carry = 0;
   59|       |
   60|   593k|      for(size_t j = 0; j != x_size_8; j += 8) {
  ------------------
  |  Branch (60:25): [True: 269k, False: 324k]
  ------------------
   61|   269k|         carry = word8_madd3(z + i + j, x + j, x_i, carry);
   62|   269k|      }
   63|       |
   64|  1.48M|      for(size_t j = x_size_8; j != x_size; ++j) {
  ------------------
  |  Branch (64:32): [True: 1.15M, False: 324k]
  ------------------
   65|  1.15M|         z[i + j] = word_madd3(x[j], x_i, z[i + j], &carry);
   66|  1.15M|      }
   67|       |
   68|   324k|      z[x_size + i] = carry;
   69|   324k|   }
   70|  67.2k|}
_ZN5Botan10bigint_mulEPmmPKmmmS2_mmS0_m:
  291|   882k|                size_t ws_size) {
  292|   882k|   clear_mem(z, z_size);
  293|       |
  294|   882k|   if(x_sw == 1) {
  ------------------
  |  Branch (294:7): [True: 3.66k, False: 878k]
  ------------------
  295|  3.66k|      bigint_linmul3(z, y, y_sw, x[0]);
  296|   878k|   } else if(y_sw == 1) {
  ------------------
  |  Branch (296:14): [True: 135, False: 878k]
  ------------------
  297|    135|      bigint_linmul3(z, x, x_sw, y[0]);
  298|   878k|   } else if(sized_for_comba_mul<4>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (298:14): [True: 833k, False: 45.2k]
  ------------------
  299|   833k|      bigint_comba_mul4(z, x, y);
  300|   833k|   } else if(sized_for_comba_mul<6>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (300:14): [True: 1.79k, False: 43.4k]
  ------------------
  301|  1.79k|      bigint_comba_mul6(z, x, y);
  302|  43.4k|   } else if(sized_for_comba_mul<8>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (302:14): [True: 3.51k, False: 39.9k]
  ------------------
  303|  3.51k|      bigint_comba_mul8(z, x, y);
  304|  39.9k|   } else if(sized_for_comba_mul<9>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (304:14): [True: 1.95k, False: 37.9k]
  ------------------
  305|  1.95k|      bigint_comba_mul9(z, x, y);
  306|  37.9k|   } else if(sized_for_comba_mul<16>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (306:14): [True: 137, False: 37.8k]
  ------------------
  307|    137|      bigint_comba_mul16(z, x, y);
  308|  37.8k|   } else if(sized_for_comba_mul<24>(x_sw, x_size, y_sw, y_size, z_size)) {
  ------------------
  |  Branch (308:14): [True: 183, False: 37.6k]
  ------------------
  309|    183|      bigint_comba_mul24(z, x, y);
  310|  37.6k|   } else if(x_sw < KARATSUBA_MULTIPLY_THRESHOLD || y_sw < KARATSUBA_MULTIPLY_THRESHOLD || !workspace) {
  ------------------
  |  Branch (310:14): [True: 35.6k, False: 2.04k]
  |  Branch (310:53): [True: 12, False: 2.03k]
  |  Branch (310:92): [True: 0, False: 2.03k]
  ------------------
  311|  35.6k|      basecase_mul(z, z_size, x, x_sw, y, y_sw);
  312|  35.6k|   } else {
  313|  2.03k|      const size_t N = karatsuba_size(z_size, x_size, x_sw, y_size, y_sw);
  314|       |
  315|  2.03k|      if(N && z_size >= 2 * N && ws_size >= 2 * N) {
  ------------------
  |  Branch (315:10): [True: 1.41k, False: 613]
  |  Branch (315:15): [True: 1.41k, False: 0]
  |  Branch (315:34): [True: 1.41k, False: 6]
  ------------------
  316|  1.41k|         karatsuba_mul(z, x, y, N, workspace);
  317|  1.41k|      } else {
  318|    619|         basecase_mul(z, z_size, x, x_sw, y, y_sw);
  319|    619|      }
  320|  2.03k|   }
  321|   882k|}
_ZN5Botan10bigint_sqrEPmmPKmmmS0_m:
  326|   954k|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) {
  327|   954k|   clear_mem(z, z_size);
  328|       |
  329|   954k|   BOTAN_ASSERT(z_size / 2 >= x_sw, "Output size is sufficient");
  ------------------
  |  |   51|   954k|   do {                                                                                 \
  |  |   52|   954k|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 954k]
  |  |  ------------------
  |  |   53|   954k|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|   954k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  330|       |
  331|   954k|   if(x_sw == 1) {
  ------------------
  |  Branch (331:7): [True: 14.5k, False: 939k]
  ------------------
  332|  14.5k|      bigint_linmul3(z, x, x_sw, x[0]);
  333|   939k|   } else if(sized_for_comba_sqr<4>(x_sw, x_size, z_size)) {
  ------------------
  |  Branch (333:14): [True: 866k, False: 73.4k]
  ------------------
  334|   866k|      bigint_comba_sqr4(z, x);
  335|   866k|   } else if(sized_for_comba_sqr<6>(x_sw, x_size, z_size)) {
  ------------------
  |  Branch (335:14): [True: 1.69k, False: 71.7k]
  ------------------
  336|  1.69k|      bigint_comba_sqr6(z, x);
  337|  71.7k|   } else if(sized_for_comba_sqr<8>(x_sw, x_size, z_size)) {
  ------------------
  |  Branch (337:14): [True: 4.17k, False: 67.5k]
  ------------------
  338|  4.17k|      bigint_comba_sqr8(z, x);
  339|  67.5k|   } else if(sized_for_comba_sqr<9>(x_sw, x_size, z_size)) {
  ------------------
  |  Branch (339:14): [True: 2.23k, False: 65.3k]
  ------------------
  340|  2.23k|      bigint_comba_sqr9(z, x);
  341|  65.3k|   } else if(sized_for_comba_sqr<16>(x_sw, x_size, z_size)) {
  ------------------
  |  Branch (341:14): [True: 202, False: 65.1k]
  ------------------
  342|    202|      bigint_comba_sqr16(z, x);
  343|  65.1k|   } else if(sized_for_comba_sqr<24>(x_sw, x_size, z_size)) {
  ------------------
  |  Branch (343:14): [True: 222, False: 64.8k]
  ------------------
  344|    222|      bigint_comba_sqr24(z, x);
  345|  64.8k|   } else if(x_size < KARATSUBA_SQUARE_THRESHOLD || !workspace) {
  ------------------
  |  Branch (345:14): [True: 61.8k, False: 3.00k]
  |  Branch (345:53): [True: 0, False: 3.00k]
  ------------------
  346|  61.8k|      basecase_sqr(z, z_size, x, x_sw);
  347|  61.8k|   } else {
  348|  3.00k|      const size_t N = karatsuba_size(z_size, x_size, x_sw);
  349|       |
  350|  3.00k|      if(N && z_size >= 2 * N && ws_size >= 2 * N) {
  ------------------
  |  Branch (350:10): [True: 2.18k, False: 822]
  |  Branch (350:15): [True: 2.18k, False: 0]
  |  Branch (350:34): [True: 2.18k, False: 0]
  ------------------
  351|  2.18k|         karatsuba_sqr(z, x, N, workspace);
  352|  2.18k|      } else {
  353|    822|         basecase_sqr(z, z_size, x, x_sw);
  354|    822|      }
  355|  3.00k|   }
  356|   954k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_114karatsuba_sizeEmmmmm:
  202|  2.03k|size_t karatsuba_size(size_t z_size, size_t x_size, size_t x_sw, size_t y_size, size_t y_sw) {
  203|  2.03k|   if(x_sw > x_size || x_sw > y_size || y_sw > x_size || y_sw > y_size) {
  ------------------
  |  Branch (203:7): [True: 0, False: 2.03k]
  |  Branch (203:24): [True: 0, False: 2.03k]
  |  Branch (203:41): [True: 1, False: 2.02k]
  |  Branch (203:58): [True: 0, False: 2.02k]
  ------------------
  204|      1|      return 0;
  205|      1|   }
  206|       |
  207|  2.02k|   if(((x_size == x_sw) && (x_size % 2)) || ((y_size == y_sw) && (y_size % 2))) {
  ------------------
  |  Branch (207:8): [True: 1, False: 2.02k]
  |  Branch (207:28): [True: 0, False: 1]
  |  Branch (207:46): [True: 10, False: 2.01k]
  |  Branch (207:66): [True: 0, False: 10]
  ------------------
  208|      0|      return 0;
  209|      0|   }
  210|       |
  211|  2.02k|   const size_t start = (x_sw > y_sw) ? x_sw : y_sw;
  ------------------
  |  Branch (211:25): [True: 13, False: 2.01k]
  ------------------
  212|  2.02k|   const size_t end = (x_size < y_size) ? x_size : y_size;
  ------------------
  |  Branch (212:23): [True: 167, False: 1.86k]
  ------------------
  213|       |
  214|  2.02k|   if(start == end) {
  ------------------
  |  Branch (214:7): [True: 11, False: 2.01k]
  ------------------
  215|     11|      if(start % 2) {
  ------------------
  |  Branch (215:10): [True: 0, False: 11]
  ------------------
  216|      0|         return 0;
  217|      0|      }
  218|     11|      return start;
  219|     11|   }
  220|       |
  221|  2.62k|   for(size_t j = start; j <= end; ++j) {
  ------------------
  |  Branch (221:26): [True: 2.62k, False: 0]
  ------------------
  222|  2.62k|      if(j % 2) {
  ------------------
  |  Branch (222:10): [True: 605, False: 2.01k]
  ------------------
  223|    605|         continue;
  224|    605|      }
  225|       |
  226|  2.01k|      if(2 * j > z_size) {
  ------------------
  |  Branch (226:10): [True: 612, False: 1.40k]
  ------------------
  227|    612|         return 0;
  228|    612|      }
  229|       |
  230|  1.40k|      if(x_sw <= j && j <= x_size && y_sw <= j && j <= y_size) {
  ------------------
  |  Branch (230:10): [True: 1.40k, False: 0]
  |  Branch (230:23): [True: 1.40k, False: 0]
  |  Branch (230:38): [True: 1.40k, False: 0]
  |  Branch (230:51): [True: 1.40k, False: 0]
  ------------------
  231|  1.40k|         if(j % 4 == 2 && (j + 2) <= x_size && (j + 2) <= y_size && 2 * (j + 2) <= z_size) {
  ------------------
  |  Branch (231:13): [True: 789, False: 617]
  |  Branch (231:27): [True: 789, False: 0]
  |  Branch (231:48): [True: 789, False: 0]
  |  Branch (231:69): [True: 84, False: 705]
  ------------------
  232|     84|            return j + 2;
  233|     84|         }
  234|  1.32k|         return j;
  235|  1.40k|      }
  236|  1.40k|   }
  237|       |
  238|      0|   return 0;
  239|  2.01k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_113karatsuba_mulEPmPKmS3_mS1_:
   80|  5.64k|void karatsuba_mul(word z[], const word x[], const word y[], size_t N, word workspace[]) {
   81|  5.64k|   if(N < KARATSUBA_MULTIPLY_THRESHOLD || N % 2) {
  ------------------
  |  Branch (81:7): [True: 4.23k, False: 1.41k]
  |  Branch (81:43): [True: 0, False: 1.41k]
  ------------------
   82|  4.23k|      switch(N) {
   83|      0|         case 6:
  ------------------
  |  Branch (83:10): [True: 0, False: 4.23k]
  ------------------
   84|      0|            return bigint_comba_mul6(z, x, y);
   85|      0|         case 8:
  ------------------
  |  Branch (85:10): [True: 0, False: 4.23k]
  ------------------
   86|      0|            return bigint_comba_mul8(z, x, y);
   87|      0|         case 9:
  ------------------
  |  Branch (87:10): [True: 0, False: 4.23k]
  ------------------
   88|      0|            return bigint_comba_mul9(z, x, y);
   89|  1.12k|         case 16:
  ------------------
  |  Branch (89:10): [True: 1.12k, False: 3.10k]
  ------------------
   90|  1.12k|            return bigint_comba_mul16(z, x, y);
   91|      0|         case 24:
  ------------------
  |  Branch (91:10): [True: 0, False: 4.23k]
  ------------------
   92|      0|            return bigint_comba_mul24(z, x, y);
   93|  3.10k|         default:
  ------------------
  |  Branch (93:10): [True: 3.10k, False: 1.12k]
  ------------------
   94|  3.10k|            return basecase_mul(z, 2 * N, x, N, y, N);
   95|  4.23k|      }
   96|  4.23k|   }
   97|       |
   98|  1.41k|   const size_t N2 = N / 2;
   99|       |
  100|  1.41k|   const word* x0 = x;
  101|  1.41k|   const word* x1 = x + N2;
  102|  1.41k|   const word* y0 = y;
  103|  1.41k|   const word* y1 = y + N2;
  104|  1.41k|   word* z0 = z;
  105|  1.41k|   word* z1 = z + N;
  106|       |
  107|  1.41k|   word* ws0 = workspace;
  108|  1.41k|   word* ws1 = workspace + N;
  109|       |
  110|  1.41k|   clear_mem(workspace, 2 * N);
  111|       |
  112|       |   /*
  113|       |   * If either of cmp0 or cmp1 is zero then z0 or z1 resp is zero here,
  114|       |   * resulting in a no-op - z0*z1 will be equal to zero so we don't need to do
  115|       |   * anything, clear_mem above already set the correct result.
  116|       |   *
  117|       |   * However we ignore the result of the comparisons and always perform the
  118|       |   * subtractions and recursively multiply to avoid the timing channel.
  119|       |   */
  120|       |
  121|       |   // First compute (X_lo - X_hi)*(Y_hi - Y_lo)
  122|  1.41k|   const auto cmp0 = bigint_sub_abs(z0, x0, x1, N2, workspace);
  123|  1.41k|   const auto cmp1 = bigint_sub_abs(z1, y1, y0, N2, workspace);
  124|  1.41k|   const auto neg_mask = ~(cmp0 ^ cmp1);
  125|       |
  126|  1.41k|   karatsuba_mul(ws0, z0, z1, N2, ws1);
  127|       |
  128|       |   // Compute X_lo * Y_lo
  129|  1.41k|   karatsuba_mul(z0, x0, y0, N2, ws1);
  130|       |
  131|       |   // Compute X_hi * Y_hi
  132|  1.41k|   karatsuba_mul(z1, x1, y1, N2, ws1);
  133|       |
  134|  1.41k|   const word ws_carry = bigint_add3_nc(ws1, z0, N, z1, N);
  135|  1.41k|   word z_carry = bigint_add2_nc(z + N2, N, ws1, N);
  136|       |
  137|  1.41k|   z_carry += bigint_add2_nc(z + N + N2, N2, &ws_carry, 1);
  138|  1.41k|   bigint_add2_nc(z + N + N2, N2, &z_carry, 1);
  139|       |
  140|  1.41k|   clear_mem(workspace + N, N2);
  141|       |
  142|  1.41k|   bigint_cnd_add_or_sub(neg_mask, z + N2, workspace, 2 * N - N2);
  143|  1.41k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_114karatsuba_sizeEmmm:
  244|  3.00k|size_t karatsuba_size(size_t z_size, size_t x_size, size_t x_sw) {
  245|  3.00k|   if(x_sw == x_size) {
  ------------------
  |  Branch (245:7): [True: 0, False: 3.00k]
  ------------------
  246|      0|      if(x_sw % 2) {
  ------------------
  |  Branch (246:10): [True: 0, False: 0]
  ------------------
  247|      0|         return 0;
  248|      0|      }
  249|      0|      return x_sw;
  250|      0|   }
  251|       |
  252|  3.82k|   for(size_t j = x_sw; j <= x_size; ++j) {
  ------------------
  |  Branch (252:25): [True: 3.82k, False: 0]
  ------------------
  253|  3.82k|      if(j % 2) {
  ------------------
  |  Branch (253:10): [True: 822, False: 3.00k]
  ------------------
  254|    822|         continue;
  255|    822|      }
  256|       |
  257|  3.00k|      if(2 * j > z_size) {
  ------------------
  |  Branch (257:10): [True: 822, False: 2.18k]
  ------------------
  258|    822|         return 0;
  259|    822|      }
  260|       |
  261|  2.18k|      if(j % 4 == 2 && (j + 2) <= x_size && 2 * (j + 2) <= z_size) {
  ------------------
  |  Branch (261:10): [True: 1.30k, False: 874]
  |  Branch (261:24): [True: 1.30k, False: 0]
  |  Branch (261:45): [True: 0, False: 1.30k]
  ------------------
  262|      0|         return j + 2;
  263|      0|      }
  264|  2.18k|      return j;
  265|  2.18k|   }
  266|       |
  267|      0|   return 0;
  268|  3.00k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_113karatsuba_sqrEPmPKmmS1_:
  148|  8.29k|void karatsuba_sqr(word z[], const word x[], size_t N, word workspace[]) {
  149|  8.29k|   if(N < KARATSUBA_SQUARE_THRESHOLD || N % 2) {
  ------------------
  |  Branch (149:7): [True: 6.25k, False: 2.03k]
  |  Branch (149:41): [True: 0, False: 2.03k]
  ------------------
  150|  6.25k|      switch(N) {
  151|      0|         case 6:
  ------------------
  |  Branch (151:10): [True: 0, False: 6.25k]
  ------------------
  152|      0|            return bigint_comba_sqr6(z, x);
  153|      0|         case 8:
  ------------------
  |  Branch (153:10): [True: 0, False: 6.25k]
  ------------------
  154|      0|            return bigint_comba_sqr8(z, x);
  155|      0|         case 9:
  ------------------
  |  Branch (155:10): [True: 0, False: 6.25k]
  ------------------
  156|      0|            return bigint_comba_sqr9(z, x);
  157|  1.74k|         case 16:
  ------------------
  |  Branch (157:10): [True: 1.74k, False: 4.50k]
  ------------------
  158|  1.74k|            return bigint_comba_sqr16(z, x);
  159|      0|         case 24:
  ------------------
  |  Branch (159:10): [True: 0, False: 6.25k]
  ------------------
  160|      0|            return bigint_comba_sqr24(z, x);
  161|  4.50k|         default:
  ------------------
  |  Branch (161:10): [True: 4.50k, False: 1.74k]
  ------------------
  162|  4.50k|            return basecase_sqr(z, 2 * N, x, N);
  163|  6.25k|      }
  164|  6.25k|   }
  165|       |
  166|  2.03k|   const size_t N2 = N / 2;
  167|       |
  168|  2.03k|   const word* x0 = x;
  169|  2.03k|   const word* x1 = x + N2;
  170|  2.03k|   word* z0 = z;
  171|  2.03k|   word* z1 = z + N;
  172|       |
  173|  2.03k|   word* ws0 = workspace;
  174|  2.03k|   word* ws1 = workspace + N;
  175|       |
  176|  2.03k|   clear_mem(workspace, 2 * N);
  177|       |
  178|       |   // See comment in karatsuba_mul
  179|  2.03k|   bigint_sub_abs(z0, x0, x1, N2, workspace);
  180|  2.03k|   karatsuba_sqr(ws0, z0, N2, ws1);
  181|       |
  182|  2.03k|   karatsuba_sqr(z0, x0, N2, ws1);
  183|  2.03k|   karatsuba_sqr(z1, x1, N2, ws1);
  184|       |
  185|  2.03k|   const word ws_carry = bigint_add3_nc(ws1, z0, N, z1, N);
  186|  2.03k|   word z_carry = bigint_add2_nc(z + N2, N, ws1, N);
  187|       |
  188|  2.03k|   z_carry += bigint_add2_nc(z + N + N2, N2, &ws_carry, 1);
  189|  2.03k|   bigint_add2_nc(z + N + N2, N2, &z_carry, 1);
  190|       |
  191|       |   /*
  192|       |   * This is only actually required if cmp (result of bigint_sub_abs) is != 0,
  193|       |   * however if cmp==0 then ws0[0:N] == 0 and avoiding the jump hides a
  194|       |   * timing channel.
  195|       |   */
  196|  2.03k|   bigint_sub2(z + N2, 2 * N - N2, ws0, N);
  197|  2.03k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm4EEEbmmmmm:
  271|   878k|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) {
  272|   878k|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (272:12): [True: 861k, False: 17.1k]
  |  Branch (272:26): [True: 852k, False: 8.32k]
  |  Branch (272:42): [True: 849k, False: 3.74k]
  |  Branch (272:56): [True: 848k, False: 1.01k]
  |  Branch (272:72): [True: 833k, False: 15.0k]
  ------------------
  273|   878k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm6EEEbmmmmm:
  271|  45.2k|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) {
  272|  45.2k|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (272:12): [True: 35.3k, False: 9.89k]
  |  Branch (272:26): [True: 26.9k, False: 8.36k]
  |  Branch (272:42): [True: 25.1k, False: 1.81k]
  |  Branch (272:56): [True: 24.1k, False: 1.01k]
  |  Branch (272:72): [True: 1.79k, False: 22.3k]
  ------------------
  273|  45.2k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm8EEEbmmmmm:
  271|  43.4k|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) {
  272|  43.4k|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (272:12): [True: 38.3k, False: 5.06k]
  |  Branch (272:26): [True: 27.2k, False: 11.1k]
  |  Branch (272:42): [True: 25.1k, False: 2.05k]
  |  Branch (272:56): [True: 21.4k, False: 3.66k]
  |  Branch (272:72): [True: 3.51k, False: 17.9k]
  ------------------
  273|  43.4k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm9EEEbmmmmm:
  271|  39.9k|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) {
  272|  39.9k|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (272:12): [True: 36.7k, False: 3.14k]
  |  Branch (272:26): [True: 17.1k, False: 19.5k]
  |  Branch (272:42): [True: 16.1k, False: 1.06k]
  |  Branch (272:56): [True: 14.4k, False: 1.69k]
  |  Branch (272:72): [True: 1.95k, False: 12.4k]
  ------------------
  273|  39.9k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm16EEEbmmmmm:
  271|  37.9k|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) {
  272|  37.9k|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (272:12): [True: 35.4k, False: 2.56k]
  |  Branch (272:26): [True: 13.7k, False: 21.7k]
  |  Branch (272:42): [True: 13.3k, False: 340]
  |  Branch (272:56): [True: 12.6k, False: 679]
  |  Branch (272:72): [True: 137, False: 12.5k]
  ------------------
  273|  37.9k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm24EEEbmmmmm:
  271|  37.8k|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) {
  272|  37.8k|   return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (272:12): [True: 35.6k, False: 2.19k]
  |  Branch (272:26): [True: 3.88k, False: 31.7k]
  |  Branch (272:42): [True: 3.54k, False: 344]
  |  Branch (272:56): [True: 1.33k, False: 2.21k]
  |  Branch (272:72): [True: 183, False: 1.14k]
  ------------------
  273|  37.8k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm4EEEbmmm:
  276|   939k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) {
  277|   939k|   return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (277:12): [True: 913k, False: 25.9k]
  |  Branch (277:26): [True: 911k, False: 1.95k]
  |  Branch (277:42): [True: 866k, False: 45.4k]
  ------------------
  278|   939k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm6EEEbmmm:
  276|  73.4k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) {
  277|  73.4k|   return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (277:12): [True: 62.4k, False: 10.9k]
  |  Branch (277:26): [True: 60.5k, False: 1.95k]
  |  Branch (277:42): [True: 1.69k, False: 58.8k]
  ------------------
  278|  73.4k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm8EEEbmmm:
  276|  71.7k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) {
  277|  71.7k|   return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (277:12): [True: 66.0k, False: 5.66k]
  |  Branch (277:26): [True: 61.0k, False: 5.00k]
  |  Branch (277:42): [True: 4.17k, False: 56.8k]
  ------------------
  278|  71.7k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm9EEEbmmm:
  276|  67.5k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) {
  277|  67.5k|   return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (277:12): [True: 64.1k, False: 3.42k]
  |  Branch (277:26): [True: 47.9k, False: 16.1k]
  |  Branch (277:42): [True: 2.23k, False: 45.7k]
  ------------------
  278|  67.5k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm16EEEbmmm:
  276|  65.3k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) {
  277|  65.3k|   return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (277:12): [True: 62.1k, False: 3.17k]
  |  Branch (277:26): [True: 43.2k, False: 18.9k]
  |  Branch (277:42): [True: 202, False: 43.0k]
  ------------------
  278|  65.3k|}
mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm24EEEbmmm:
  276|  65.1k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) {
  277|  65.1k|   return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ);
  ------------------
  |  Branch (277:12): [True: 62.3k, False: 2.75k]
  |  Branch (277:26): [True: 1.69k, False: 60.6k]
  |  Branch (277:42): [True: 222, False: 1.47k]
  ------------------
  278|  65.1k|}

_ZN5Botan25bigint_monty_redc_genericEPmmPKmmmS0_:
   31|  82.9k|void bigint_monty_redc_generic(word z[], size_t z_size, const word p[], size_t p_size, word p_dash, word ws[]) {
   32|  82.9k|   BOTAN_ARG_CHECK(z_size >= 2 * p_size && p_size > 0, "Invalid sizes for bigint_monty_redc_generic");
  ------------------
  |  |   30|  82.9k|   do {                                                          \
  |  |   31|   165k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:12): [True: 82.9k, False: 0]
  |  |  |  Branch (31:12): [True: 82.9k, False: 0]
  |  |  ------------------
  |  |   32|  82.9k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  82.9k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   33|       |
   34|  82.9k|   word w2 = 0, w1 = 0, w0 = 0;
   35|       |
   36|  82.9k|   w0 = z[0];
   37|       |
   38|  82.9k|   ws[0] = w0 * p_dash;
   39|       |
   40|  82.9k|   word3_muladd(&w2, &w1, &w0, ws[0], p[0]);
   41|       |
   42|  82.9k|   w0 = w1;
   43|  82.9k|   w1 = w2;
   44|  82.9k|   w2 = 0;
   45|       |
   46|   386k|   for(size_t i = 1; i != p_size; ++i) {
  ------------------
  |  Branch (46:22): [True: 303k, False: 82.9k]
  ------------------
   47|  3.00M|      for(size_t j = 0; j < i; ++j) {
  ------------------
  |  Branch (47:25): [True: 2.69M, False: 303k]
  ------------------
   48|  2.69M|         word3_muladd(&w2, &w1, &w0, ws[j], p[i - j]);
   49|  2.69M|      }
   50|       |
   51|   303k|      word3_add(&w2, &w1, &w0, z[i]);
   52|       |
   53|   303k|      ws[i] = w0 * p_dash;
   54|       |
   55|   303k|      word3_muladd(&w2, &w1, &w0, ws[i], p[0]);
   56|       |
   57|   303k|      w0 = w1;
   58|   303k|      w1 = w2;
   59|   303k|      w2 = 0;
   60|   303k|   }
   61|       |
   62|   386k|   for(size_t i = 0; i != p_size - 1; ++i) {
  ------------------
  |  Branch (62:22): [True: 303k, False: 82.9k]
  ------------------
   63|  3.00M|      for(size_t j = i + 1; j != p_size; ++j) {
  ------------------
  |  Branch (63:29): [True: 2.69M, False: 303k]
  ------------------
   64|  2.69M|         word3_muladd(&w2, &w1, &w0, ws[j], p[p_size + i - j]);
   65|  2.69M|      }
   66|       |
   67|   303k|      word3_add(&w2, &w1, &w0, z[p_size + i]);
   68|       |
   69|   303k|      ws[i] = w0;
   70|       |
   71|   303k|      w0 = w1;
   72|   303k|      w1 = w2;
   73|   303k|      w2 = 0;
   74|   303k|   }
   75|       |
   76|  82.9k|   word3_add(&w2, &w1, &w0, z[2 * p_size - 1]);
   77|       |
   78|  82.9k|   ws[p_size - 1] = w0;
   79|  82.9k|   ws[p_size] = w1;
   80|       |
   81|       |   /*
   82|       |   * The result might need to be reduced mod p. To avoid a timing
   83|       |   * channel, always perform the subtraction. If in the compution
   84|       |   * of x - p a borrow is required then x was already < p.
   85|       |   *
   86|       |   * x starts at ws[0] and is p_size+1 bytes long.
   87|       |   * x - p starts at z[0] and is also p_size+1 bytes log
   88|       |   *
   89|       |   * If borrow was set then x was already < p and the subtraction
   90|       |   * was not needed. In that case overwrite z[0:p_size] with the
   91|       |   * original x in ws[0:p_size].
   92|       |   *
   93|       |   * We only copy out p_size in the final step because we know
   94|       |   * the Montgomery result is < P
   95|       |   */
   96|       |
   97|  82.9k|   word borrow = bigint_sub3(z, ws, p_size + 1, p, p_size);
   98|       |
   99|  82.9k|   BOTAN_DEBUG_ASSERT(borrow == 0 || borrow == 1);
  ------------------
  |  |   99|  82.9k|      do {                          \
  |  |  100|  82.9k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  100|       |
  101|  82.9k|   CT::conditional_assign_mem(borrow, z, ws, p_size);
  102|  82.9k|   clear_mem(z + p_size, z_size - p_size);
  103|  82.9k|}

_ZN5Botan19bigint_monty_redc_4EPmPKmmS0_:
   14|   286k|void bigint_monty_redc_4(word z[8], const word p[4], word p_dash, word ws[]) {
   15|   286k|   word w2 = 0, w1 = 0, w0 = 0;
   16|   286k|   w0 = z[0];
   17|   286k|   ws[0] = w0 * p_dash;
   18|   286k|   word3_muladd(&w2, &w1, &w0, ws[0], p[0]);
   19|   286k|   w0 = w1;
   20|   286k|   w1 = w2;
   21|   286k|   w2 = 0;
   22|   286k|   word3_muladd(&w2, &w1, &w0, ws[0], p[1]);
   23|   286k|   word3_add(&w2, &w1, &w0, z[1]);
   24|   286k|   ws[1] = w0 * p_dash;
   25|   286k|   word3_muladd(&w2, &w1, &w0, ws[1], p[0]);
   26|   286k|   w0 = w1;
   27|   286k|   w1 = w2;
   28|   286k|   w2 = 0;
   29|   286k|   word3_muladd(&w2, &w1, &w0, ws[0], p[2]);
   30|   286k|   word3_muladd(&w2, &w1, &w0, ws[1], p[1]);
   31|   286k|   word3_add(&w2, &w1, &w0, z[2]);
   32|   286k|   ws[2] = w0 * p_dash;
   33|   286k|   word3_muladd(&w2, &w1, &w0, ws[2], p[0]);
   34|   286k|   w0 = w1;
   35|   286k|   w1 = w2;
   36|   286k|   w2 = 0;
   37|   286k|   word3_muladd(&w2, &w1, &w0, ws[0], p[3]);
   38|   286k|   word3_muladd(&w2, &w1, &w0, ws[1], p[2]);
   39|   286k|   word3_muladd(&w2, &w1, &w0, ws[2], p[1]);
   40|   286k|   word3_add(&w2, &w1, &w0, z[3]);
   41|   286k|   ws[3] = w0 * p_dash;
   42|   286k|   word3_muladd(&w2, &w1, &w0, ws[3], p[0]);
   43|   286k|   w0 = w1;
   44|   286k|   w1 = w2;
   45|   286k|   w2 = 0;
   46|   286k|   word3_muladd(&w2, &w1, &w0, ws[1], p[3]);
   47|   286k|   word3_muladd(&w2, &w1, &w0, ws[2], p[2]);
   48|   286k|   word3_muladd(&w2, &w1, &w0, ws[3], p[1]);
   49|   286k|   word3_add(&w2, &w1, &w0, z[4]);
   50|   286k|   ws[0] = w0;
   51|   286k|   w0 = w1;
   52|   286k|   w1 = w2;
   53|   286k|   w2 = 0;
   54|   286k|   word3_muladd(&w2, &w1, &w0, ws[2], p[3]);
   55|   286k|   word3_muladd(&w2, &w1, &w0, ws[3], p[2]);
   56|   286k|   word3_add(&w2, &w1, &w0, z[5]);
   57|   286k|   ws[1] = w0;
   58|   286k|   w0 = w1;
   59|   286k|   w1 = w2;
   60|   286k|   w2 = 0;
   61|   286k|   word3_muladd(&w2, &w1, &w0, ws[3], p[3]);
   62|   286k|   word3_add(&w2, &w1, &w0, z[6]);
   63|   286k|   ws[2] = w0;
   64|   286k|   w0 = w1;
   65|   286k|   w1 = w2;
   66|   286k|   w2 = 0;
   67|   286k|   word3_add(&w2, &w1, &w0, z[7]);
   68|   286k|   ws[3] = w0;
   69|   286k|   ws[4] = w1;
   70|   286k|   word borrow = bigint_sub3(z, ws, 4 + 1, p, 4);
   71|   286k|   CT::conditional_assign_mem(borrow, z, ws, 4);
   72|   286k|   clear_mem(z + 4, 4);
   73|   286k|}
_ZN5Botan19bigint_monty_redc_6EPmPKmmS0_:
   75|  2.68k|void bigint_monty_redc_6(word z[12], const word p[6], word p_dash, word ws[]) {
   76|  2.68k|   word w2 = 0, w1 = 0, w0 = 0;
   77|  2.68k|   w0 = z[0];
   78|  2.68k|   ws[0] = w0 * p_dash;
   79|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[0], p[0]);
   80|  2.68k|   w0 = w1;
   81|  2.68k|   w1 = w2;
   82|  2.68k|   w2 = 0;
   83|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[0], p[1]);
   84|  2.68k|   word3_add(&w2, &w1, &w0, z[1]);
   85|  2.68k|   ws[1] = w0 * p_dash;
   86|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[1], p[0]);
   87|  2.68k|   w0 = w1;
   88|  2.68k|   w1 = w2;
   89|  2.68k|   w2 = 0;
   90|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[0], p[2]);
   91|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[1], p[1]);
   92|  2.68k|   word3_add(&w2, &w1, &w0, z[2]);
   93|  2.68k|   ws[2] = w0 * p_dash;
   94|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[2], p[0]);
   95|  2.68k|   w0 = w1;
   96|  2.68k|   w1 = w2;
   97|  2.68k|   w2 = 0;
   98|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[0], p[3]);
   99|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[1], p[2]);
  100|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[2], p[1]);
  101|  2.68k|   word3_add(&w2, &w1, &w0, z[3]);
  102|  2.68k|   ws[3] = w0 * p_dash;
  103|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[3], p[0]);
  104|  2.68k|   w0 = w1;
  105|  2.68k|   w1 = w2;
  106|  2.68k|   w2 = 0;
  107|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[0], p[4]);
  108|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[1], p[3]);
  109|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[2], p[2]);
  110|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[3], p[1]);
  111|  2.68k|   word3_add(&w2, &w1, &w0, z[4]);
  112|  2.68k|   ws[4] = w0 * p_dash;
  113|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[4], p[0]);
  114|  2.68k|   w0 = w1;
  115|  2.68k|   w1 = w2;
  116|  2.68k|   w2 = 0;
  117|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[0], p[5]);
  118|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[1], p[4]);
  119|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[2], p[3]);
  120|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[3], p[2]);
  121|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[4], p[1]);
  122|  2.68k|   word3_add(&w2, &w1, &w0, z[5]);
  123|  2.68k|   ws[5] = w0 * p_dash;
  124|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[5], p[0]);
  125|  2.68k|   w0 = w1;
  126|  2.68k|   w1 = w2;
  127|  2.68k|   w2 = 0;
  128|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[1], p[5]);
  129|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[2], p[4]);
  130|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[3], p[3]);
  131|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[4], p[2]);
  132|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[5], p[1]);
  133|  2.68k|   word3_add(&w2, &w1, &w0, z[6]);
  134|  2.68k|   ws[0] = w0;
  135|  2.68k|   w0 = w1;
  136|  2.68k|   w1 = w2;
  137|  2.68k|   w2 = 0;
  138|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[2], p[5]);
  139|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[3], p[4]);
  140|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[4], p[3]);
  141|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[5], p[2]);
  142|  2.68k|   word3_add(&w2, &w1, &w0, z[7]);
  143|  2.68k|   ws[1] = w0;
  144|  2.68k|   w0 = w1;
  145|  2.68k|   w1 = w2;
  146|  2.68k|   w2 = 0;
  147|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[3], p[5]);
  148|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[4], p[4]);
  149|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[5], p[3]);
  150|  2.68k|   word3_add(&w2, &w1, &w0, z[8]);
  151|  2.68k|   ws[2] = w0;
  152|  2.68k|   w0 = w1;
  153|  2.68k|   w1 = w2;
  154|  2.68k|   w2 = 0;
  155|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[4], p[5]);
  156|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[5], p[4]);
  157|  2.68k|   word3_add(&w2, &w1, &w0, z[9]);
  158|  2.68k|   ws[3] = w0;
  159|  2.68k|   w0 = w1;
  160|  2.68k|   w1 = w2;
  161|  2.68k|   w2 = 0;
  162|  2.68k|   word3_muladd(&w2, &w1, &w0, ws[5], p[5]);
  163|  2.68k|   word3_add(&w2, &w1, &w0, z[10]);
  164|  2.68k|   ws[4] = w0;
  165|  2.68k|   w0 = w1;
  166|  2.68k|   w1 = w2;
  167|  2.68k|   w2 = 0;
  168|  2.68k|   word3_add(&w2, &w1, &w0, z[11]);
  169|  2.68k|   ws[5] = w0;
  170|  2.68k|   ws[6] = w1;
  171|  2.68k|   word borrow = bigint_sub3(z, ws, 6 + 1, p, 6);
  172|  2.68k|   CT::conditional_assign_mem(borrow, z, ws, 6);
  173|  2.68k|   clear_mem(z + 6, 6);
  174|  2.68k|}
_ZN5Botan19bigint_monty_redc_8EPmPKmmS0_:
  176|  5.61k|void bigint_monty_redc_8(word z[16], const word p[8], word p_dash, word ws[]) {
  177|  5.61k|   word w2 = 0, w1 = 0, w0 = 0;
  178|  5.61k|   w0 = z[0];
  179|  5.61k|   ws[0] = w0 * p_dash;
  180|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[0], p[0]);
  181|  5.61k|   w0 = w1;
  182|  5.61k|   w1 = w2;
  183|  5.61k|   w2 = 0;
  184|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[0], p[1]);
  185|  5.61k|   word3_add(&w2, &w1, &w0, z[1]);
  186|  5.61k|   ws[1] = w0 * p_dash;
  187|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[1], p[0]);
  188|  5.61k|   w0 = w1;
  189|  5.61k|   w1 = w2;
  190|  5.61k|   w2 = 0;
  191|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[0], p[2]);
  192|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[1], p[1]);
  193|  5.61k|   word3_add(&w2, &w1, &w0, z[2]);
  194|  5.61k|   ws[2] = w0 * p_dash;
  195|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[2], p[0]);
  196|  5.61k|   w0 = w1;
  197|  5.61k|   w1 = w2;
  198|  5.61k|   w2 = 0;
  199|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[0], p[3]);
  200|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[1], p[2]);
  201|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[2], p[1]);
  202|  5.61k|   word3_add(&w2, &w1, &w0, z[3]);
  203|  5.61k|   ws[3] = w0 * p_dash;
  204|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[3], p[0]);
  205|  5.61k|   w0 = w1;
  206|  5.61k|   w1 = w2;
  207|  5.61k|   w2 = 0;
  208|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[0], p[4]);
  209|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[1], p[3]);
  210|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[2], p[2]);
  211|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[3], p[1]);
  212|  5.61k|   word3_add(&w2, &w1, &w0, z[4]);
  213|  5.61k|   ws[4] = w0 * p_dash;
  214|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[4], p[0]);
  215|  5.61k|   w0 = w1;
  216|  5.61k|   w1 = w2;
  217|  5.61k|   w2 = 0;
  218|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[0], p[5]);
  219|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[1], p[4]);
  220|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[2], p[3]);
  221|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[3], p[2]);
  222|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[4], p[1]);
  223|  5.61k|   word3_add(&w2, &w1, &w0, z[5]);
  224|  5.61k|   ws[5] = w0 * p_dash;
  225|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[5], p[0]);
  226|  5.61k|   w0 = w1;
  227|  5.61k|   w1 = w2;
  228|  5.61k|   w2 = 0;
  229|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[0], p[6]);
  230|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[1], p[5]);
  231|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[2], p[4]);
  232|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[3], p[3]);
  233|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[4], p[2]);
  234|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[5], p[1]);
  235|  5.61k|   word3_add(&w2, &w1, &w0, z[6]);
  236|  5.61k|   ws[6] = w0 * p_dash;
  237|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[6], p[0]);
  238|  5.61k|   w0 = w1;
  239|  5.61k|   w1 = w2;
  240|  5.61k|   w2 = 0;
  241|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[0], p[7]);
  242|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[1], p[6]);
  243|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[2], p[5]);
  244|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[3], p[4]);
  245|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[4], p[3]);
  246|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[5], p[2]);
  247|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[6], p[1]);
  248|  5.61k|   word3_add(&w2, &w1, &w0, z[7]);
  249|  5.61k|   ws[7] = w0 * p_dash;
  250|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[7], p[0]);
  251|  5.61k|   w0 = w1;
  252|  5.61k|   w1 = w2;
  253|  5.61k|   w2 = 0;
  254|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[1], p[7]);
  255|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[2], p[6]);
  256|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[3], p[5]);
  257|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[4], p[4]);
  258|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[5], p[3]);
  259|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[6], p[2]);
  260|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[7], p[1]);
  261|  5.61k|   word3_add(&w2, &w1, &w0, z[8]);
  262|  5.61k|   ws[0] = w0;
  263|  5.61k|   w0 = w1;
  264|  5.61k|   w1 = w2;
  265|  5.61k|   w2 = 0;
  266|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[2], p[7]);
  267|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[3], p[6]);
  268|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[4], p[5]);
  269|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[5], p[4]);
  270|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[6], p[3]);
  271|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[7], p[2]);
  272|  5.61k|   word3_add(&w2, &w1, &w0, z[9]);
  273|  5.61k|   ws[1] = w0;
  274|  5.61k|   w0 = w1;
  275|  5.61k|   w1 = w2;
  276|  5.61k|   w2 = 0;
  277|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[3], p[7]);
  278|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[4], p[6]);
  279|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[5], p[5]);
  280|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[6], p[4]);
  281|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[7], p[3]);
  282|  5.61k|   word3_add(&w2, &w1, &w0, z[10]);
  283|  5.61k|   ws[2] = w0;
  284|  5.61k|   w0 = w1;
  285|  5.61k|   w1 = w2;
  286|  5.61k|   w2 = 0;
  287|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[4], p[7]);
  288|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[5], p[6]);
  289|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[6], p[5]);
  290|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[7], p[4]);
  291|  5.61k|   word3_add(&w2, &w1, &w0, z[11]);
  292|  5.61k|   ws[3] = w0;
  293|  5.61k|   w0 = w1;
  294|  5.61k|   w1 = w2;
  295|  5.61k|   w2 = 0;
  296|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[5], p[7]);
  297|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[6], p[6]);
  298|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[7], p[5]);
  299|  5.61k|   word3_add(&w2, &w1, &w0, z[12]);
  300|  5.61k|   ws[4] = w0;
  301|  5.61k|   w0 = w1;
  302|  5.61k|   w1 = w2;
  303|  5.61k|   w2 = 0;
  304|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[6], p[7]);
  305|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[7], p[6]);
  306|  5.61k|   word3_add(&w2, &w1, &w0, z[13]);
  307|  5.61k|   ws[5] = w0;
  308|  5.61k|   w0 = w1;
  309|  5.61k|   w1 = w2;
  310|  5.61k|   w2 = 0;
  311|  5.61k|   word3_muladd(&w2, &w1, &w0, ws[7], p[7]);
  312|  5.61k|   word3_add(&w2, &w1, &w0, z[14]);
  313|  5.61k|   ws[6] = w0;
  314|  5.61k|   w0 = w1;
  315|  5.61k|   w1 = w2;
  316|  5.61k|   w2 = 0;
  317|  5.61k|   word3_add(&w2, &w1, &w0, z[15]);
  318|  5.61k|   ws[7] = w0;
  319|  5.61k|   ws[8] = w1;
  320|  5.61k|   word borrow = bigint_sub3(z, ws, 8 + 1, p, 8);
  321|  5.61k|   CT::conditional_assign_mem(borrow, z, ws, 8);
  322|  5.61k|   clear_mem(z + 8, 8);
  323|  5.61k|}
_ZN5Botan20bigint_monty_redc_16EPmPKmmS0_:
  325|    279|void bigint_monty_redc_16(word z[32], const word p[16], word p_dash, word ws[]) {
  326|    279|   word w2 = 0, w1 = 0, w0 = 0;
  327|    279|   w0 = z[0];
  328|    279|   ws[0] = w0 * p_dash;
  329|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[0]);
  330|    279|   w0 = w1;
  331|    279|   w1 = w2;
  332|    279|   w2 = 0;
  333|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[1]);
  334|    279|   word3_add(&w2, &w1, &w0, z[1]);
  335|    279|   ws[1] = w0 * p_dash;
  336|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[0]);
  337|    279|   w0 = w1;
  338|    279|   w1 = w2;
  339|    279|   w2 = 0;
  340|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[2]);
  341|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[1]);
  342|    279|   word3_add(&w2, &w1, &w0, z[2]);
  343|    279|   ws[2] = w0 * p_dash;
  344|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[0]);
  345|    279|   w0 = w1;
  346|    279|   w1 = w2;
  347|    279|   w2 = 0;
  348|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[3]);
  349|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[2]);
  350|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[1]);
  351|    279|   word3_add(&w2, &w1, &w0, z[3]);
  352|    279|   ws[3] = w0 * p_dash;
  353|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[0]);
  354|    279|   w0 = w1;
  355|    279|   w1 = w2;
  356|    279|   w2 = 0;
  357|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[4]);
  358|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[3]);
  359|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[2]);
  360|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[1]);
  361|    279|   word3_add(&w2, &w1, &w0, z[4]);
  362|    279|   ws[4] = w0 * p_dash;
  363|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[0]);
  364|    279|   w0 = w1;
  365|    279|   w1 = w2;
  366|    279|   w2 = 0;
  367|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[5]);
  368|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[4]);
  369|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[3]);
  370|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[2]);
  371|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[1]);
  372|    279|   word3_add(&w2, &w1, &w0, z[5]);
  373|    279|   ws[5] = w0 * p_dash;
  374|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[0]);
  375|    279|   w0 = w1;
  376|    279|   w1 = w2;
  377|    279|   w2 = 0;
  378|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[6]);
  379|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[5]);
  380|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[4]);
  381|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[3]);
  382|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[2]);
  383|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[1]);
  384|    279|   word3_add(&w2, &w1, &w0, z[6]);
  385|    279|   ws[6] = w0 * p_dash;
  386|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[0]);
  387|    279|   w0 = w1;
  388|    279|   w1 = w2;
  389|    279|   w2 = 0;
  390|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[7]);
  391|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[6]);
  392|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[5]);
  393|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[4]);
  394|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[3]);
  395|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[2]);
  396|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[1]);
  397|    279|   word3_add(&w2, &w1, &w0, z[7]);
  398|    279|   ws[7] = w0 * p_dash;
  399|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[0]);
  400|    279|   w0 = w1;
  401|    279|   w1 = w2;
  402|    279|   w2 = 0;
  403|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[8]);
  404|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[7]);
  405|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[6]);
  406|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[5]);
  407|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[4]);
  408|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[3]);
  409|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[2]);
  410|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[1]);
  411|    279|   word3_add(&w2, &w1, &w0, z[8]);
  412|    279|   ws[8] = w0 * p_dash;
  413|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[0]);
  414|    279|   w0 = w1;
  415|    279|   w1 = w2;
  416|    279|   w2 = 0;
  417|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[9]);
  418|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[8]);
  419|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[7]);
  420|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[6]);
  421|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[5]);
  422|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[4]);
  423|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[3]);
  424|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[2]);
  425|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[1]);
  426|    279|   word3_add(&w2, &w1, &w0, z[9]);
  427|    279|   ws[9] = w0 * p_dash;
  428|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[0]);
  429|    279|   w0 = w1;
  430|    279|   w1 = w2;
  431|    279|   w2 = 0;
  432|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[10]);
  433|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[9]);
  434|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[8]);
  435|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[7]);
  436|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[6]);
  437|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[5]);
  438|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[4]);
  439|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[3]);
  440|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[2]);
  441|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[1]);
  442|    279|   word3_add(&w2, &w1, &w0, z[10]);
  443|    279|   ws[10] = w0 * p_dash;
  444|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[0]);
  445|    279|   w0 = w1;
  446|    279|   w1 = w2;
  447|    279|   w2 = 0;
  448|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[11]);
  449|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[10]);
  450|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[9]);
  451|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[8]);
  452|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[7]);
  453|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[6]);
  454|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[5]);
  455|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[4]);
  456|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[3]);
  457|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[2]);
  458|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[1]);
  459|    279|   word3_add(&w2, &w1, &w0, z[11]);
  460|    279|   ws[11] = w0 * p_dash;
  461|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[0]);
  462|    279|   w0 = w1;
  463|    279|   w1 = w2;
  464|    279|   w2 = 0;
  465|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[12]);
  466|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[11]);
  467|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[10]);
  468|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[9]);
  469|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[8]);
  470|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[7]);
  471|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[6]);
  472|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[5]);
  473|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[4]);
  474|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[3]);
  475|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[2]);
  476|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[1]);
  477|    279|   word3_add(&w2, &w1, &w0, z[12]);
  478|    279|   ws[12] = w0 * p_dash;
  479|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[0]);
  480|    279|   w0 = w1;
  481|    279|   w1 = w2;
  482|    279|   w2 = 0;
  483|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[13]);
  484|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[12]);
  485|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[11]);
  486|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[10]);
  487|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[9]);
  488|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[8]);
  489|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[7]);
  490|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[6]);
  491|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[5]);
  492|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[4]);
  493|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[3]);
  494|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[2]);
  495|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[1]);
  496|    279|   word3_add(&w2, &w1, &w0, z[13]);
  497|    279|   ws[13] = w0 * p_dash;
  498|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[0]);
  499|    279|   w0 = w1;
  500|    279|   w1 = w2;
  501|    279|   w2 = 0;
  502|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[14]);
  503|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[13]);
  504|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[12]);
  505|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[11]);
  506|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[10]);
  507|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[9]);
  508|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[8]);
  509|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[7]);
  510|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[6]);
  511|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[5]);
  512|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[4]);
  513|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[3]);
  514|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[2]);
  515|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[1]);
  516|    279|   word3_add(&w2, &w1, &w0, z[14]);
  517|    279|   ws[14] = w0 * p_dash;
  518|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[0]);
  519|    279|   w0 = w1;
  520|    279|   w1 = w2;
  521|    279|   w2 = 0;
  522|    279|   word3_muladd(&w2, &w1, &w0, ws[0], p[15]);
  523|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[14]);
  524|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[13]);
  525|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[12]);
  526|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[11]);
  527|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[10]);
  528|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[9]);
  529|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[8]);
  530|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[7]);
  531|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[6]);
  532|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[5]);
  533|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[4]);
  534|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[3]);
  535|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[2]);
  536|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[1]);
  537|    279|   word3_add(&w2, &w1, &w0, z[15]);
  538|    279|   ws[15] = w0 * p_dash;
  539|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[0]);
  540|    279|   w0 = w1;
  541|    279|   w1 = w2;
  542|    279|   w2 = 0;
  543|    279|   word3_muladd(&w2, &w1, &w0, ws[1], p[15]);
  544|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[14]);
  545|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[13]);
  546|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[12]);
  547|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[11]);
  548|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[10]);
  549|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[9]);
  550|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[8]);
  551|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[7]);
  552|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[6]);
  553|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[5]);
  554|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[4]);
  555|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[3]);
  556|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[2]);
  557|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[1]);
  558|    279|   word3_add(&w2, &w1, &w0, z[16]);
  559|    279|   ws[0] = w0;
  560|    279|   w0 = w1;
  561|    279|   w1 = w2;
  562|    279|   w2 = 0;
  563|    279|   word3_muladd(&w2, &w1, &w0, ws[2], p[15]);
  564|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[14]);
  565|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[13]);
  566|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[12]);
  567|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[11]);
  568|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[10]);
  569|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[9]);
  570|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[8]);
  571|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[7]);
  572|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[6]);
  573|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[5]);
  574|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[4]);
  575|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[3]);
  576|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[2]);
  577|    279|   word3_add(&w2, &w1, &w0, z[17]);
  578|    279|   ws[1] = w0;
  579|    279|   w0 = w1;
  580|    279|   w1 = w2;
  581|    279|   w2 = 0;
  582|    279|   word3_muladd(&w2, &w1, &w0, ws[3], p[15]);
  583|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[14]);
  584|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[13]);
  585|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[12]);
  586|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[11]);
  587|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[10]);
  588|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[9]);
  589|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[8]);
  590|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[7]);
  591|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[6]);
  592|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[5]);
  593|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[4]);
  594|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[3]);
  595|    279|   word3_add(&w2, &w1, &w0, z[18]);
  596|    279|   ws[2] = w0;
  597|    279|   w0 = w1;
  598|    279|   w1 = w2;
  599|    279|   w2 = 0;
  600|    279|   word3_muladd(&w2, &w1, &w0, ws[4], p[15]);
  601|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[14]);
  602|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[13]);
  603|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[12]);
  604|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[11]);
  605|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[10]);
  606|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[9]);
  607|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[8]);
  608|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[7]);
  609|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[6]);
  610|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[5]);
  611|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[4]);
  612|    279|   word3_add(&w2, &w1, &w0, z[19]);
  613|    279|   ws[3] = w0;
  614|    279|   w0 = w1;
  615|    279|   w1 = w2;
  616|    279|   w2 = 0;
  617|    279|   word3_muladd(&w2, &w1, &w0, ws[5], p[15]);
  618|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[14]);
  619|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[13]);
  620|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[12]);
  621|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[11]);
  622|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[10]);
  623|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[9]);
  624|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[8]);
  625|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[7]);
  626|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[6]);
  627|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[5]);
  628|    279|   word3_add(&w2, &w1, &w0, z[20]);
  629|    279|   ws[4] = w0;
  630|    279|   w0 = w1;
  631|    279|   w1 = w2;
  632|    279|   w2 = 0;
  633|    279|   word3_muladd(&w2, &w1, &w0, ws[6], p[15]);
  634|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[14]);
  635|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[13]);
  636|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[12]);
  637|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[11]);
  638|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[10]);
  639|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[9]);
  640|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[8]);
  641|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[7]);
  642|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[6]);
  643|    279|   word3_add(&w2, &w1, &w0, z[21]);
  644|    279|   ws[5] = w0;
  645|    279|   w0 = w1;
  646|    279|   w1 = w2;
  647|    279|   w2 = 0;
  648|    279|   word3_muladd(&w2, &w1, &w0, ws[7], p[15]);
  649|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[14]);
  650|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[13]);
  651|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[12]);
  652|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[11]);
  653|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[10]);
  654|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[9]);
  655|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[8]);
  656|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[7]);
  657|    279|   word3_add(&w2, &w1, &w0, z[22]);
  658|    279|   ws[6] = w0;
  659|    279|   w0 = w1;
  660|    279|   w1 = w2;
  661|    279|   w2 = 0;
  662|    279|   word3_muladd(&w2, &w1, &w0, ws[8], p[15]);
  663|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[14]);
  664|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[13]);
  665|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[12]);
  666|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[11]);
  667|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[10]);
  668|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[9]);
  669|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[8]);
  670|    279|   word3_add(&w2, &w1, &w0, z[23]);
  671|    279|   ws[7] = w0;
  672|    279|   w0 = w1;
  673|    279|   w1 = w2;
  674|    279|   w2 = 0;
  675|    279|   word3_muladd(&w2, &w1, &w0, ws[9], p[15]);
  676|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[14]);
  677|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[13]);
  678|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[12]);
  679|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[11]);
  680|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[10]);
  681|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[9]);
  682|    279|   word3_add(&w2, &w1, &w0, z[24]);
  683|    279|   ws[8] = w0;
  684|    279|   w0 = w1;
  685|    279|   w1 = w2;
  686|    279|   w2 = 0;
  687|    279|   word3_muladd(&w2, &w1, &w0, ws[10], p[15]);
  688|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[14]);
  689|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[13]);
  690|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[12]);
  691|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[11]);
  692|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[10]);
  693|    279|   word3_add(&w2, &w1, &w0, z[25]);
  694|    279|   ws[9] = w0;
  695|    279|   w0 = w1;
  696|    279|   w1 = w2;
  697|    279|   w2 = 0;
  698|    279|   word3_muladd(&w2, &w1, &w0, ws[11], p[15]);
  699|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[14]);
  700|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[13]);
  701|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[12]);
  702|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[11]);
  703|    279|   word3_add(&w2, &w1, &w0, z[26]);
  704|    279|   ws[10] = w0;
  705|    279|   w0 = w1;
  706|    279|   w1 = w2;
  707|    279|   w2 = 0;
  708|    279|   word3_muladd(&w2, &w1, &w0, ws[12], p[15]);
  709|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[14]);
  710|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[13]);
  711|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[12]);
  712|    279|   word3_add(&w2, &w1, &w0, z[27]);
  713|    279|   ws[11] = w0;
  714|    279|   w0 = w1;
  715|    279|   w1 = w2;
  716|    279|   w2 = 0;
  717|    279|   word3_muladd(&w2, &w1, &w0, ws[13], p[15]);
  718|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[14]);
  719|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[13]);
  720|    279|   word3_add(&w2, &w1, &w0, z[28]);
  721|    279|   ws[12] = w0;
  722|    279|   w0 = w1;
  723|    279|   w1 = w2;
  724|    279|   w2 = 0;
  725|    279|   word3_muladd(&w2, &w1, &w0, ws[14], p[15]);
  726|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[14]);
  727|    279|   word3_add(&w2, &w1, &w0, z[29]);
  728|    279|   ws[13] = w0;
  729|    279|   w0 = w1;
  730|    279|   w1 = w2;
  731|    279|   w2 = 0;
  732|    279|   word3_muladd(&w2, &w1, &w0, ws[15], p[15]);
  733|    279|   word3_add(&w2, &w1, &w0, z[30]);
  734|    279|   ws[14] = w0;
  735|    279|   w0 = w1;
  736|    279|   w1 = w2;
  737|    279|   w2 = 0;
  738|    279|   word3_add(&w2, &w1, &w0, z[31]);
  739|    279|   ws[15] = w0;
  740|    279|   ws[16] = w1;
  741|    279|   word borrow = bigint_sub3(z, ws, 16 + 1, p, 16);
  742|    279|   CT::conditional_assign_mem(borrow, z, ws, 16);
  743|    279|   clear_mem(z + 16, 16);
  744|    279|}
_ZN5Botan20bigint_monty_redc_24EPmPKmmS0_:
  746|    355|void bigint_monty_redc_24(word z[48], const word p[24], word p_dash, word ws[]) {
  747|    355|   word w2 = 0, w1 = 0, w0 = 0;
  748|    355|   w0 = z[0];
  749|    355|   ws[0] = w0 * p_dash;
  750|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[0]);
  751|    355|   w0 = w1;
  752|    355|   w1 = w2;
  753|    355|   w2 = 0;
  754|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[1]);
  755|    355|   word3_add(&w2, &w1, &w0, z[1]);
  756|    355|   ws[1] = w0 * p_dash;
  757|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[0]);
  758|    355|   w0 = w1;
  759|    355|   w1 = w2;
  760|    355|   w2 = 0;
  761|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[2]);
  762|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[1]);
  763|    355|   word3_add(&w2, &w1, &w0, z[2]);
  764|    355|   ws[2] = w0 * p_dash;
  765|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[0]);
  766|    355|   w0 = w1;
  767|    355|   w1 = w2;
  768|    355|   w2 = 0;
  769|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[3]);
  770|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[2]);
  771|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[1]);
  772|    355|   word3_add(&w2, &w1, &w0, z[3]);
  773|    355|   ws[3] = w0 * p_dash;
  774|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[0]);
  775|    355|   w0 = w1;
  776|    355|   w1 = w2;
  777|    355|   w2 = 0;
  778|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[4]);
  779|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[3]);
  780|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[2]);
  781|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[1]);
  782|    355|   word3_add(&w2, &w1, &w0, z[4]);
  783|    355|   ws[4] = w0 * p_dash;
  784|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[0]);
  785|    355|   w0 = w1;
  786|    355|   w1 = w2;
  787|    355|   w2 = 0;
  788|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[5]);
  789|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[4]);
  790|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[3]);
  791|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[2]);
  792|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[1]);
  793|    355|   word3_add(&w2, &w1, &w0, z[5]);
  794|    355|   ws[5] = w0 * p_dash;
  795|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[0]);
  796|    355|   w0 = w1;
  797|    355|   w1 = w2;
  798|    355|   w2 = 0;
  799|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[6]);
  800|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[5]);
  801|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[4]);
  802|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[3]);
  803|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[2]);
  804|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[1]);
  805|    355|   word3_add(&w2, &w1, &w0, z[6]);
  806|    355|   ws[6] = w0 * p_dash;
  807|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[0]);
  808|    355|   w0 = w1;
  809|    355|   w1 = w2;
  810|    355|   w2 = 0;
  811|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[7]);
  812|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[6]);
  813|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[5]);
  814|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[4]);
  815|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[3]);
  816|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[2]);
  817|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[1]);
  818|    355|   word3_add(&w2, &w1, &w0, z[7]);
  819|    355|   ws[7] = w0 * p_dash;
  820|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[0]);
  821|    355|   w0 = w1;
  822|    355|   w1 = w2;
  823|    355|   w2 = 0;
  824|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[8]);
  825|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[7]);
  826|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[6]);
  827|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[5]);
  828|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[4]);
  829|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[3]);
  830|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[2]);
  831|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[1]);
  832|    355|   word3_add(&w2, &w1, &w0, z[8]);
  833|    355|   ws[8] = w0 * p_dash;
  834|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[0]);
  835|    355|   w0 = w1;
  836|    355|   w1 = w2;
  837|    355|   w2 = 0;
  838|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[9]);
  839|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[8]);
  840|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[7]);
  841|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[6]);
  842|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[5]);
  843|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[4]);
  844|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[3]);
  845|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[2]);
  846|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[1]);
  847|    355|   word3_add(&w2, &w1, &w0, z[9]);
  848|    355|   ws[9] = w0 * p_dash;
  849|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[0]);
  850|    355|   w0 = w1;
  851|    355|   w1 = w2;
  852|    355|   w2 = 0;
  853|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[10]);
  854|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[9]);
  855|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[8]);
  856|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[7]);
  857|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[6]);
  858|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[5]);
  859|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[4]);
  860|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[3]);
  861|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[2]);
  862|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[1]);
  863|    355|   word3_add(&w2, &w1, &w0, z[10]);
  864|    355|   ws[10] = w0 * p_dash;
  865|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[0]);
  866|    355|   w0 = w1;
  867|    355|   w1 = w2;
  868|    355|   w2 = 0;
  869|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[11]);
  870|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[10]);
  871|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[9]);
  872|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[8]);
  873|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[7]);
  874|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[6]);
  875|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[5]);
  876|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[4]);
  877|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[3]);
  878|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[2]);
  879|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[1]);
  880|    355|   word3_add(&w2, &w1, &w0, z[11]);
  881|    355|   ws[11] = w0 * p_dash;
  882|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[0]);
  883|    355|   w0 = w1;
  884|    355|   w1 = w2;
  885|    355|   w2 = 0;
  886|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[12]);
  887|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[11]);
  888|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[10]);
  889|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[9]);
  890|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[8]);
  891|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[7]);
  892|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[6]);
  893|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[5]);
  894|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[4]);
  895|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[3]);
  896|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[2]);
  897|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[1]);
  898|    355|   word3_add(&w2, &w1, &w0, z[12]);
  899|    355|   ws[12] = w0 * p_dash;
  900|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[0]);
  901|    355|   w0 = w1;
  902|    355|   w1 = w2;
  903|    355|   w2 = 0;
  904|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[13]);
  905|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[12]);
  906|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[11]);
  907|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[10]);
  908|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[9]);
  909|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[8]);
  910|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[7]);
  911|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[6]);
  912|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[5]);
  913|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[4]);
  914|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[3]);
  915|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[2]);
  916|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[1]);
  917|    355|   word3_add(&w2, &w1, &w0, z[13]);
  918|    355|   ws[13] = w0 * p_dash;
  919|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[0]);
  920|    355|   w0 = w1;
  921|    355|   w1 = w2;
  922|    355|   w2 = 0;
  923|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[14]);
  924|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[13]);
  925|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[12]);
  926|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[11]);
  927|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[10]);
  928|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[9]);
  929|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[8]);
  930|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[7]);
  931|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[6]);
  932|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[5]);
  933|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[4]);
  934|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[3]);
  935|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[2]);
  936|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[1]);
  937|    355|   word3_add(&w2, &w1, &w0, z[14]);
  938|    355|   ws[14] = w0 * p_dash;
  939|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[0]);
  940|    355|   w0 = w1;
  941|    355|   w1 = w2;
  942|    355|   w2 = 0;
  943|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[15]);
  944|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[14]);
  945|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[13]);
  946|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[12]);
  947|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[11]);
  948|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[10]);
  949|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[9]);
  950|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[8]);
  951|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[7]);
  952|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[6]);
  953|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[5]);
  954|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[4]);
  955|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[3]);
  956|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[2]);
  957|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[1]);
  958|    355|   word3_add(&w2, &w1, &w0, z[15]);
  959|    355|   ws[15] = w0 * p_dash;
  960|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[0]);
  961|    355|   w0 = w1;
  962|    355|   w1 = w2;
  963|    355|   w2 = 0;
  964|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[16]);
  965|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[15]);
  966|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[14]);
  967|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[13]);
  968|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[12]);
  969|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[11]);
  970|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[10]);
  971|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[9]);
  972|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[8]);
  973|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[7]);
  974|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[6]);
  975|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[5]);
  976|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[4]);
  977|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[3]);
  978|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[2]);
  979|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[1]);
  980|    355|   word3_add(&w2, &w1, &w0, z[16]);
  981|    355|   ws[16] = w0 * p_dash;
  982|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[0]);
  983|    355|   w0 = w1;
  984|    355|   w1 = w2;
  985|    355|   w2 = 0;
  986|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[17]);
  987|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[16]);
  988|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[15]);
  989|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[14]);
  990|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[13]);
  991|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[12]);
  992|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[11]);
  993|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[10]);
  994|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[9]);
  995|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[8]);
  996|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[7]);
  997|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[6]);
  998|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[5]);
  999|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[4]);
 1000|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[3]);
 1001|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[2]);
 1002|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[1]);
 1003|    355|   word3_add(&w2, &w1, &w0, z[17]);
 1004|    355|   ws[17] = w0 * p_dash;
 1005|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[0]);
 1006|    355|   w0 = w1;
 1007|    355|   w1 = w2;
 1008|    355|   w2 = 0;
 1009|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[18]);
 1010|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[17]);
 1011|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[16]);
 1012|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[15]);
 1013|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[14]);
 1014|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[13]);
 1015|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[12]);
 1016|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[11]);
 1017|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[10]);
 1018|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[9]);
 1019|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[8]);
 1020|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[7]);
 1021|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[6]);
 1022|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[5]);
 1023|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[4]);
 1024|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[3]);
 1025|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[2]);
 1026|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[1]);
 1027|    355|   word3_add(&w2, &w1, &w0, z[18]);
 1028|    355|   ws[18] = w0 * p_dash;
 1029|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[0]);
 1030|    355|   w0 = w1;
 1031|    355|   w1 = w2;
 1032|    355|   w2 = 0;
 1033|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[19]);
 1034|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[18]);
 1035|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[17]);
 1036|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[16]);
 1037|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[15]);
 1038|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[14]);
 1039|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[13]);
 1040|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[12]);
 1041|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[11]);
 1042|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[10]);
 1043|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[9]);
 1044|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[8]);
 1045|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[7]);
 1046|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[6]);
 1047|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[5]);
 1048|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[4]);
 1049|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[3]);
 1050|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[2]);
 1051|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[1]);
 1052|    355|   word3_add(&w2, &w1, &w0, z[19]);
 1053|    355|   ws[19] = w0 * p_dash;
 1054|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[0]);
 1055|    355|   w0 = w1;
 1056|    355|   w1 = w2;
 1057|    355|   w2 = 0;
 1058|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[20]);
 1059|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[19]);
 1060|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[18]);
 1061|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[17]);
 1062|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[16]);
 1063|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[15]);
 1064|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[14]);
 1065|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[13]);
 1066|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[12]);
 1067|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[11]);
 1068|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[10]);
 1069|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[9]);
 1070|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[8]);
 1071|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[7]);
 1072|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[6]);
 1073|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[5]);
 1074|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[4]);
 1075|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[3]);
 1076|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[2]);
 1077|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[1]);
 1078|    355|   word3_add(&w2, &w1, &w0, z[20]);
 1079|    355|   ws[20] = w0 * p_dash;
 1080|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[0]);
 1081|    355|   w0 = w1;
 1082|    355|   w1 = w2;
 1083|    355|   w2 = 0;
 1084|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[21]);
 1085|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[20]);
 1086|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[19]);
 1087|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[18]);
 1088|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[17]);
 1089|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[16]);
 1090|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[15]);
 1091|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[14]);
 1092|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[13]);
 1093|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[12]);
 1094|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[11]);
 1095|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[10]);
 1096|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[9]);
 1097|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[8]);
 1098|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[7]);
 1099|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[6]);
 1100|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[5]);
 1101|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[4]);
 1102|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[3]);
 1103|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[2]);
 1104|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[1]);
 1105|    355|   word3_add(&w2, &w1, &w0, z[21]);
 1106|    355|   ws[21] = w0 * p_dash;
 1107|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[0]);
 1108|    355|   w0 = w1;
 1109|    355|   w1 = w2;
 1110|    355|   w2 = 0;
 1111|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[22]);
 1112|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[21]);
 1113|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[20]);
 1114|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[19]);
 1115|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[18]);
 1116|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[17]);
 1117|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[16]);
 1118|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[15]);
 1119|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[14]);
 1120|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[13]);
 1121|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[12]);
 1122|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[11]);
 1123|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[10]);
 1124|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[9]);
 1125|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[8]);
 1126|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[7]);
 1127|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[6]);
 1128|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[5]);
 1129|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[4]);
 1130|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[3]);
 1131|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[2]);
 1132|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[1]);
 1133|    355|   word3_add(&w2, &w1, &w0, z[22]);
 1134|    355|   ws[22] = w0 * p_dash;
 1135|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[0]);
 1136|    355|   w0 = w1;
 1137|    355|   w1 = w2;
 1138|    355|   w2 = 0;
 1139|    355|   word3_muladd(&w2, &w1, &w0, ws[0], p[23]);
 1140|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[22]);
 1141|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[21]);
 1142|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[20]);
 1143|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[19]);
 1144|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[18]);
 1145|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[17]);
 1146|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[16]);
 1147|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[15]);
 1148|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[14]);
 1149|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[13]);
 1150|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[12]);
 1151|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[11]);
 1152|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[10]);
 1153|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[9]);
 1154|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[8]);
 1155|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[7]);
 1156|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[6]);
 1157|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[5]);
 1158|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[4]);
 1159|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[3]);
 1160|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[2]);
 1161|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[1]);
 1162|    355|   word3_add(&w2, &w1, &w0, z[23]);
 1163|    355|   ws[23] = w0 * p_dash;
 1164|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[0]);
 1165|    355|   w0 = w1;
 1166|    355|   w1 = w2;
 1167|    355|   w2 = 0;
 1168|    355|   word3_muladd(&w2, &w1, &w0, ws[1], p[23]);
 1169|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[22]);
 1170|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[21]);
 1171|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[20]);
 1172|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[19]);
 1173|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[18]);
 1174|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[17]);
 1175|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[16]);
 1176|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[15]);
 1177|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[14]);
 1178|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[13]);
 1179|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[12]);
 1180|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[11]);
 1181|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[10]);
 1182|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[9]);
 1183|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[8]);
 1184|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[7]);
 1185|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[6]);
 1186|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[5]);
 1187|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[4]);
 1188|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[3]);
 1189|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[2]);
 1190|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[1]);
 1191|    355|   word3_add(&w2, &w1, &w0, z[24]);
 1192|    355|   ws[0] = w0;
 1193|    355|   w0 = w1;
 1194|    355|   w1 = w2;
 1195|    355|   w2 = 0;
 1196|    355|   word3_muladd(&w2, &w1, &w0, ws[2], p[23]);
 1197|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[22]);
 1198|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[21]);
 1199|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[20]);
 1200|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[19]);
 1201|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[18]);
 1202|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[17]);
 1203|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[16]);
 1204|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[15]);
 1205|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[14]);
 1206|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[13]);
 1207|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[12]);
 1208|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[11]);
 1209|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[10]);
 1210|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[9]);
 1211|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[8]);
 1212|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[7]);
 1213|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[6]);
 1214|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[5]);
 1215|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[4]);
 1216|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[3]);
 1217|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[2]);
 1218|    355|   word3_add(&w2, &w1, &w0, z[25]);
 1219|    355|   ws[1] = w0;
 1220|    355|   w0 = w1;
 1221|    355|   w1 = w2;
 1222|    355|   w2 = 0;
 1223|    355|   word3_muladd(&w2, &w1, &w0, ws[3], p[23]);
 1224|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[22]);
 1225|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[21]);
 1226|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[20]);
 1227|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[19]);
 1228|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[18]);
 1229|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[17]);
 1230|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[16]);
 1231|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[15]);
 1232|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[14]);
 1233|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[13]);
 1234|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[12]);
 1235|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[11]);
 1236|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[10]);
 1237|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[9]);
 1238|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[8]);
 1239|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[7]);
 1240|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[6]);
 1241|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[5]);
 1242|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[4]);
 1243|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[3]);
 1244|    355|   word3_add(&w2, &w1, &w0, z[26]);
 1245|    355|   ws[2] = w0;
 1246|    355|   w0 = w1;
 1247|    355|   w1 = w2;
 1248|    355|   w2 = 0;
 1249|    355|   word3_muladd(&w2, &w1, &w0, ws[4], p[23]);
 1250|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[22]);
 1251|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[21]);
 1252|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[20]);
 1253|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[19]);
 1254|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[18]);
 1255|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[17]);
 1256|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[16]);
 1257|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[15]);
 1258|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[14]);
 1259|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[13]);
 1260|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[12]);
 1261|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[11]);
 1262|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[10]);
 1263|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[9]);
 1264|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[8]);
 1265|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[7]);
 1266|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[6]);
 1267|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[5]);
 1268|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[4]);
 1269|    355|   word3_add(&w2, &w1, &w0, z[27]);
 1270|    355|   ws[3] = w0;
 1271|    355|   w0 = w1;
 1272|    355|   w1 = w2;
 1273|    355|   w2 = 0;
 1274|    355|   word3_muladd(&w2, &w1, &w0, ws[5], p[23]);
 1275|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[22]);
 1276|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[21]);
 1277|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[20]);
 1278|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[19]);
 1279|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[18]);
 1280|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[17]);
 1281|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[16]);
 1282|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[15]);
 1283|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[14]);
 1284|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[13]);
 1285|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[12]);
 1286|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[11]);
 1287|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[10]);
 1288|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[9]);
 1289|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[8]);
 1290|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[7]);
 1291|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[6]);
 1292|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[5]);
 1293|    355|   word3_add(&w2, &w1, &w0, z[28]);
 1294|    355|   ws[4] = w0;
 1295|    355|   w0 = w1;
 1296|    355|   w1 = w2;
 1297|    355|   w2 = 0;
 1298|    355|   word3_muladd(&w2, &w1, &w0, ws[6], p[23]);
 1299|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[22]);
 1300|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[21]);
 1301|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[20]);
 1302|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[19]);
 1303|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[18]);
 1304|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[17]);
 1305|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[16]);
 1306|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[15]);
 1307|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[14]);
 1308|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[13]);
 1309|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[12]);
 1310|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[11]);
 1311|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[10]);
 1312|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[9]);
 1313|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[8]);
 1314|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[7]);
 1315|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[6]);
 1316|    355|   word3_add(&w2, &w1, &w0, z[29]);
 1317|    355|   ws[5] = w0;
 1318|    355|   w0 = w1;
 1319|    355|   w1 = w2;
 1320|    355|   w2 = 0;
 1321|    355|   word3_muladd(&w2, &w1, &w0, ws[7], p[23]);
 1322|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[22]);
 1323|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[21]);
 1324|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[20]);
 1325|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[19]);
 1326|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[18]);
 1327|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[17]);
 1328|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[16]);
 1329|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[15]);
 1330|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[14]);
 1331|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[13]);
 1332|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[12]);
 1333|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[11]);
 1334|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[10]);
 1335|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[9]);
 1336|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[8]);
 1337|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[7]);
 1338|    355|   word3_add(&w2, &w1, &w0, z[30]);
 1339|    355|   ws[6] = w0;
 1340|    355|   w0 = w1;
 1341|    355|   w1 = w2;
 1342|    355|   w2 = 0;
 1343|    355|   word3_muladd(&w2, &w1, &w0, ws[8], p[23]);
 1344|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[22]);
 1345|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[21]);
 1346|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[20]);
 1347|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[19]);
 1348|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[18]);
 1349|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[17]);
 1350|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[16]);
 1351|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[15]);
 1352|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[14]);
 1353|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[13]);
 1354|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[12]);
 1355|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[11]);
 1356|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[10]);
 1357|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[9]);
 1358|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[8]);
 1359|    355|   word3_add(&w2, &w1, &w0, z[31]);
 1360|    355|   ws[7] = w0;
 1361|    355|   w0 = w1;
 1362|    355|   w1 = w2;
 1363|    355|   w2 = 0;
 1364|    355|   word3_muladd(&w2, &w1, &w0, ws[9], p[23]);
 1365|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[22]);
 1366|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[21]);
 1367|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[20]);
 1368|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[19]);
 1369|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[18]);
 1370|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[17]);
 1371|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[16]);
 1372|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[15]);
 1373|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[14]);
 1374|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[13]);
 1375|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[12]);
 1376|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[11]);
 1377|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[10]);
 1378|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[9]);
 1379|    355|   word3_add(&w2, &w1, &w0, z[32]);
 1380|    355|   ws[8] = w0;
 1381|    355|   w0 = w1;
 1382|    355|   w1 = w2;
 1383|    355|   w2 = 0;
 1384|    355|   word3_muladd(&w2, &w1, &w0, ws[10], p[23]);
 1385|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[22]);
 1386|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[21]);
 1387|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[20]);
 1388|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[19]);
 1389|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[18]);
 1390|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[17]);
 1391|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[16]);
 1392|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[15]);
 1393|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[14]);
 1394|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[13]);
 1395|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[12]);
 1396|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[11]);
 1397|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[10]);
 1398|    355|   word3_add(&w2, &w1, &w0, z[33]);
 1399|    355|   ws[9] = w0;
 1400|    355|   w0 = w1;
 1401|    355|   w1 = w2;
 1402|    355|   w2 = 0;
 1403|    355|   word3_muladd(&w2, &w1, &w0, ws[11], p[23]);
 1404|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[22]);
 1405|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[21]);
 1406|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[20]);
 1407|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[19]);
 1408|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[18]);
 1409|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[17]);
 1410|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[16]);
 1411|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[15]);
 1412|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[14]);
 1413|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[13]);
 1414|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[12]);
 1415|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[11]);
 1416|    355|   word3_add(&w2, &w1, &w0, z[34]);
 1417|    355|   ws[10] = w0;
 1418|    355|   w0 = w1;
 1419|    355|   w1 = w2;
 1420|    355|   w2 = 0;
 1421|    355|   word3_muladd(&w2, &w1, &w0, ws[12], p[23]);
 1422|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[22]);
 1423|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[21]);
 1424|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[20]);
 1425|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[19]);
 1426|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[18]);
 1427|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[17]);
 1428|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[16]);
 1429|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[15]);
 1430|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[14]);
 1431|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[13]);
 1432|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[12]);
 1433|    355|   word3_add(&w2, &w1, &w0, z[35]);
 1434|    355|   ws[11] = w0;
 1435|    355|   w0 = w1;
 1436|    355|   w1 = w2;
 1437|    355|   w2 = 0;
 1438|    355|   word3_muladd(&w2, &w1, &w0, ws[13], p[23]);
 1439|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[22]);
 1440|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[21]);
 1441|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[20]);
 1442|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[19]);
 1443|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[18]);
 1444|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[17]);
 1445|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[16]);
 1446|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[15]);
 1447|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[14]);
 1448|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[13]);
 1449|    355|   word3_add(&w2, &w1, &w0, z[36]);
 1450|    355|   ws[12] = w0;
 1451|    355|   w0 = w1;
 1452|    355|   w1 = w2;
 1453|    355|   w2 = 0;
 1454|    355|   word3_muladd(&w2, &w1, &w0, ws[14], p[23]);
 1455|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[22]);
 1456|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[21]);
 1457|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[20]);
 1458|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[19]);
 1459|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[18]);
 1460|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[17]);
 1461|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[16]);
 1462|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[15]);
 1463|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[14]);
 1464|    355|   word3_add(&w2, &w1, &w0, z[37]);
 1465|    355|   ws[13] = w0;
 1466|    355|   w0 = w1;
 1467|    355|   w1 = w2;
 1468|    355|   w2 = 0;
 1469|    355|   word3_muladd(&w2, &w1, &w0, ws[15], p[23]);
 1470|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[22]);
 1471|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[21]);
 1472|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[20]);
 1473|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[19]);
 1474|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[18]);
 1475|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[17]);
 1476|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[16]);
 1477|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[15]);
 1478|    355|   word3_add(&w2, &w1, &w0, z[38]);
 1479|    355|   ws[14] = w0;
 1480|    355|   w0 = w1;
 1481|    355|   w1 = w2;
 1482|    355|   w2 = 0;
 1483|    355|   word3_muladd(&w2, &w1, &w0, ws[16], p[23]);
 1484|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[22]);
 1485|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[21]);
 1486|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[20]);
 1487|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[19]);
 1488|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[18]);
 1489|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[17]);
 1490|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[16]);
 1491|    355|   word3_add(&w2, &w1, &w0, z[39]);
 1492|    355|   ws[15] = w0;
 1493|    355|   w0 = w1;
 1494|    355|   w1 = w2;
 1495|    355|   w2 = 0;
 1496|    355|   word3_muladd(&w2, &w1, &w0, ws[17], p[23]);
 1497|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[22]);
 1498|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[21]);
 1499|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[20]);
 1500|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[19]);
 1501|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[18]);
 1502|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[17]);
 1503|    355|   word3_add(&w2, &w1, &w0, z[40]);
 1504|    355|   ws[16] = w0;
 1505|    355|   w0 = w1;
 1506|    355|   w1 = w2;
 1507|    355|   w2 = 0;
 1508|    355|   word3_muladd(&w2, &w1, &w0, ws[18], p[23]);
 1509|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[22]);
 1510|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[21]);
 1511|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[20]);
 1512|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[19]);
 1513|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[18]);
 1514|    355|   word3_add(&w2, &w1, &w0, z[41]);
 1515|    355|   ws[17] = w0;
 1516|    355|   w0 = w1;
 1517|    355|   w1 = w2;
 1518|    355|   w2 = 0;
 1519|    355|   word3_muladd(&w2, &w1, &w0, ws[19], p[23]);
 1520|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[22]);
 1521|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[21]);
 1522|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[20]);
 1523|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[19]);
 1524|    355|   word3_add(&w2, &w1, &w0, z[42]);
 1525|    355|   ws[18] = w0;
 1526|    355|   w0 = w1;
 1527|    355|   w1 = w2;
 1528|    355|   w2 = 0;
 1529|    355|   word3_muladd(&w2, &w1, &w0, ws[20], p[23]);
 1530|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[22]);
 1531|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[21]);
 1532|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[20]);
 1533|    355|   word3_add(&w2, &w1, &w0, z[43]);
 1534|    355|   ws[19] = w0;
 1535|    355|   w0 = w1;
 1536|    355|   w1 = w2;
 1537|    355|   w2 = 0;
 1538|    355|   word3_muladd(&w2, &w1, &w0, ws[21], p[23]);
 1539|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[22]);
 1540|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[21]);
 1541|    355|   word3_add(&w2, &w1, &w0, z[44]);
 1542|    355|   ws[20] = w0;
 1543|    355|   w0 = w1;
 1544|    355|   w1 = w2;
 1545|    355|   w2 = 0;
 1546|    355|   word3_muladd(&w2, &w1, &w0, ws[22], p[23]);
 1547|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[22]);
 1548|    355|   word3_add(&w2, &w1, &w0, z[45]);
 1549|    355|   ws[21] = w0;
 1550|    355|   w0 = w1;
 1551|    355|   w1 = w2;
 1552|    355|   w2 = 0;
 1553|    355|   word3_muladd(&w2, &w1, &w0, ws[23], p[23]);
 1554|    355|   word3_add(&w2, &w1, &w0, z[46]);
 1555|    355|   ws[22] = w0;
 1556|    355|   w0 = w1;
 1557|    355|   w1 = w2;
 1558|    355|   w2 = 0;
 1559|    355|   word3_add(&w2, &w1, &w0, z[47]);
 1560|    355|   ws[23] = w0;
 1561|    355|   ws[24] = w1;
 1562|    355|   word borrow = bigint_sub3(z, ws, 24 + 1, p, 24);
 1563|    355|   CT::conditional_assign_mem(borrow, z, ws, 24);
 1564|    355|   clear_mem(z + 24, 24);
 1565|    355|}
_ZN5Botan20bigint_monty_redc_32EPmPKmmS0_:
 1567|    922|void bigint_monty_redc_32(word z[64], const word p[32], word p_dash, word ws[]) {
 1568|    922|   word w2 = 0, w1 = 0, w0 = 0;
 1569|    922|   w0 = z[0];
 1570|    922|   ws[0] = w0 * p_dash;
 1571|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[0]);
 1572|    922|   w0 = w1;
 1573|    922|   w1 = w2;
 1574|    922|   w2 = 0;
 1575|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[1]);
 1576|    922|   word3_add(&w2, &w1, &w0, z[1]);
 1577|    922|   ws[1] = w0 * p_dash;
 1578|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[0]);
 1579|    922|   w0 = w1;
 1580|    922|   w1 = w2;
 1581|    922|   w2 = 0;
 1582|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[2]);
 1583|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[1]);
 1584|    922|   word3_add(&w2, &w1, &w0, z[2]);
 1585|    922|   ws[2] = w0 * p_dash;
 1586|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[0]);
 1587|    922|   w0 = w1;
 1588|    922|   w1 = w2;
 1589|    922|   w2 = 0;
 1590|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[3]);
 1591|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[2]);
 1592|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[1]);
 1593|    922|   word3_add(&w2, &w1, &w0, z[3]);
 1594|    922|   ws[3] = w0 * p_dash;
 1595|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[0]);
 1596|    922|   w0 = w1;
 1597|    922|   w1 = w2;
 1598|    922|   w2 = 0;
 1599|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[4]);
 1600|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[3]);
 1601|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[2]);
 1602|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[1]);
 1603|    922|   word3_add(&w2, &w1, &w0, z[4]);
 1604|    922|   ws[4] = w0 * p_dash;
 1605|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[0]);
 1606|    922|   w0 = w1;
 1607|    922|   w1 = w2;
 1608|    922|   w2 = 0;
 1609|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[5]);
 1610|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[4]);
 1611|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[3]);
 1612|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[2]);
 1613|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[1]);
 1614|    922|   word3_add(&w2, &w1, &w0, z[5]);
 1615|    922|   ws[5] = w0 * p_dash;
 1616|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[0]);
 1617|    922|   w0 = w1;
 1618|    922|   w1 = w2;
 1619|    922|   w2 = 0;
 1620|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[6]);
 1621|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[5]);
 1622|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[4]);
 1623|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[3]);
 1624|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[2]);
 1625|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[1]);
 1626|    922|   word3_add(&w2, &w1, &w0, z[6]);
 1627|    922|   ws[6] = w0 * p_dash;
 1628|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[0]);
 1629|    922|   w0 = w1;
 1630|    922|   w1 = w2;
 1631|    922|   w2 = 0;
 1632|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[7]);
 1633|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[6]);
 1634|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[5]);
 1635|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[4]);
 1636|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[3]);
 1637|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[2]);
 1638|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[1]);
 1639|    922|   word3_add(&w2, &w1, &w0, z[7]);
 1640|    922|   ws[7] = w0 * p_dash;
 1641|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[0]);
 1642|    922|   w0 = w1;
 1643|    922|   w1 = w2;
 1644|    922|   w2 = 0;
 1645|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[8]);
 1646|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[7]);
 1647|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[6]);
 1648|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[5]);
 1649|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[4]);
 1650|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[3]);
 1651|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[2]);
 1652|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[1]);
 1653|    922|   word3_add(&w2, &w1, &w0, z[8]);
 1654|    922|   ws[8] = w0 * p_dash;
 1655|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[0]);
 1656|    922|   w0 = w1;
 1657|    922|   w1 = w2;
 1658|    922|   w2 = 0;
 1659|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[9]);
 1660|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[8]);
 1661|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[7]);
 1662|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[6]);
 1663|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[5]);
 1664|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[4]);
 1665|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[3]);
 1666|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[2]);
 1667|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[1]);
 1668|    922|   word3_add(&w2, &w1, &w0, z[9]);
 1669|    922|   ws[9] = w0 * p_dash;
 1670|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[0]);
 1671|    922|   w0 = w1;
 1672|    922|   w1 = w2;
 1673|    922|   w2 = 0;
 1674|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[10]);
 1675|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[9]);
 1676|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[8]);
 1677|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[7]);
 1678|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[6]);
 1679|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[5]);
 1680|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[4]);
 1681|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[3]);
 1682|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[2]);
 1683|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[1]);
 1684|    922|   word3_add(&w2, &w1, &w0, z[10]);
 1685|    922|   ws[10] = w0 * p_dash;
 1686|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[0]);
 1687|    922|   w0 = w1;
 1688|    922|   w1 = w2;
 1689|    922|   w2 = 0;
 1690|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[11]);
 1691|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[10]);
 1692|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[9]);
 1693|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[8]);
 1694|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[7]);
 1695|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[6]);
 1696|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[5]);
 1697|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[4]);
 1698|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[3]);
 1699|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[2]);
 1700|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[1]);
 1701|    922|   word3_add(&w2, &w1, &w0, z[11]);
 1702|    922|   ws[11] = w0 * p_dash;
 1703|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[0]);
 1704|    922|   w0 = w1;
 1705|    922|   w1 = w2;
 1706|    922|   w2 = 0;
 1707|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[12]);
 1708|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[11]);
 1709|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[10]);
 1710|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[9]);
 1711|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[8]);
 1712|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[7]);
 1713|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[6]);
 1714|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[5]);
 1715|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[4]);
 1716|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[3]);
 1717|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[2]);
 1718|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[1]);
 1719|    922|   word3_add(&w2, &w1, &w0, z[12]);
 1720|    922|   ws[12] = w0 * p_dash;
 1721|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[0]);
 1722|    922|   w0 = w1;
 1723|    922|   w1 = w2;
 1724|    922|   w2 = 0;
 1725|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[13]);
 1726|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[12]);
 1727|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[11]);
 1728|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[10]);
 1729|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[9]);
 1730|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[8]);
 1731|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[7]);
 1732|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[6]);
 1733|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[5]);
 1734|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[4]);
 1735|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[3]);
 1736|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[2]);
 1737|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[1]);
 1738|    922|   word3_add(&w2, &w1, &w0, z[13]);
 1739|    922|   ws[13] = w0 * p_dash;
 1740|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[0]);
 1741|    922|   w0 = w1;
 1742|    922|   w1 = w2;
 1743|    922|   w2 = 0;
 1744|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[14]);
 1745|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[13]);
 1746|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[12]);
 1747|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[11]);
 1748|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[10]);
 1749|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[9]);
 1750|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[8]);
 1751|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[7]);
 1752|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[6]);
 1753|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[5]);
 1754|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[4]);
 1755|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[3]);
 1756|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[2]);
 1757|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[1]);
 1758|    922|   word3_add(&w2, &w1, &w0, z[14]);
 1759|    922|   ws[14] = w0 * p_dash;
 1760|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[0]);
 1761|    922|   w0 = w1;
 1762|    922|   w1 = w2;
 1763|    922|   w2 = 0;
 1764|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[15]);
 1765|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[14]);
 1766|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[13]);
 1767|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[12]);
 1768|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[11]);
 1769|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[10]);
 1770|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[9]);
 1771|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[8]);
 1772|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[7]);
 1773|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[6]);
 1774|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[5]);
 1775|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[4]);
 1776|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[3]);
 1777|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[2]);
 1778|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[1]);
 1779|    922|   word3_add(&w2, &w1, &w0, z[15]);
 1780|    922|   ws[15] = w0 * p_dash;
 1781|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[0]);
 1782|    922|   w0 = w1;
 1783|    922|   w1 = w2;
 1784|    922|   w2 = 0;
 1785|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[16]);
 1786|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[15]);
 1787|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[14]);
 1788|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[13]);
 1789|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[12]);
 1790|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[11]);
 1791|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[10]);
 1792|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[9]);
 1793|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[8]);
 1794|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[7]);
 1795|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[6]);
 1796|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[5]);
 1797|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[4]);
 1798|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[3]);
 1799|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[2]);
 1800|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[1]);
 1801|    922|   word3_add(&w2, &w1, &w0, z[16]);
 1802|    922|   ws[16] = w0 * p_dash;
 1803|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[0]);
 1804|    922|   w0 = w1;
 1805|    922|   w1 = w2;
 1806|    922|   w2 = 0;
 1807|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[17]);
 1808|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[16]);
 1809|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[15]);
 1810|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[14]);
 1811|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[13]);
 1812|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[12]);
 1813|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[11]);
 1814|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[10]);
 1815|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[9]);
 1816|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[8]);
 1817|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[7]);
 1818|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[6]);
 1819|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[5]);
 1820|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[4]);
 1821|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[3]);
 1822|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[2]);
 1823|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[1]);
 1824|    922|   word3_add(&w2, &w1, &w0, z[17]);
 1825|    922|   ws[17] = w0 * p_dash;
 1826|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[0]);
 1827|    922|   w0 = w1;
 1828|    922|   w1 = w2;
 1829|    922|   w2 = 0;
 1830|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[18]);
 1831|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[17]);
 1832|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[16]);
 1833|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[15]);
 1834|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[14]);
 1835|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[13]);
 1836|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[12]);
 1837|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[11]);
 1838|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[10]);
 1839|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[9]);
 1840|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[8]);
 1841|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[7]);
 1842|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[6]);
 1843|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[5]);
 1844|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[4]);
 1845|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[3]);
 1846|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[2]);
 1847|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[1]);
 1848|    922|   word3_add(&w2, &w1, &w0, z[18]);
 1849|    922|   ws[18] = w0 * p_dash;
 1850|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[0]);
 1851|    922|   w0 = w1;
 1852|    922|   w1 = w2;
 1853|    922|   w2 = 0;
 1854|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[19]);
 1855|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[18]);
 1856|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[17]);
 1857|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[16]);
 1858|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[15]);
 1859|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[14]);
 1860|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[13]);
 1861|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[12]);
 1862|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[11]);
 1863|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[10]);
 1864|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[9]);
 1865|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[8]);
 1866|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[7]);
 1867|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[6]);
 1868|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[5]);
 1869|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[4]);
 1870|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[3]);
 1871|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[2]);
 1872|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[1]);
 1873|    922|   word3_add(&w2, &w1, &w0, z[19]);
 1874|    922|   ws[19] = w0 * p_dash;
 1875|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[0]);
 1876|    922|   w0 = w1;
 1877|    922|   w1 = w2;
 1878|    922|   w2 = 0;
 1879|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[20]);
 1880|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[19]);
 1881|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[18]);
 1882|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[17]);
 1883|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[16]);
 1884|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[15]);
 1885|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[14]);
 1886|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[13]);
 1887|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[12]);
 1888|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[11]);
 1889|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[10]);
 1890|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[9]);
 1891|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[8]);
 1892|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[7]);
 1893|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[6]);
 1894|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[5]);
 1895|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[4]);
 1896|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[3]);
 1897|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[2]);
 1898|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[1]);
 1899|    922|   word3_add(&w2, &w1, &w0, z[20]);
 1900|    922|   ws[20] = w0 * p_dash;
 1901|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[0]);
 1902|    922|   w0 = w1;
 1903|    922|   w1 = w2;
 1904|    922|   w2 = 0;
 1905|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[21]);
 1906|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[20]);
 1907|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[19]);
 1908|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[18]);
 1909|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[17]);
 1910|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[16]);
 1911|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[15]);
 1912|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[14]);
 1913|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[13]);
 1914|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[12]);
 1915|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[11]);
 1916|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[10]);
 1917|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[9]);
 1918|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[8]);
 1919|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[7]);
 1920|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[6]);
 1921|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[5]);
 1922|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[4]);
 1923|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[3]);
 1924|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[2]);
 1925|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[1]);
 1926|    922|   word3_add(&w2, &w1, &w0, z[21]);
 1927|    922|   ws[21] = w0 * p_dash;
 1928|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[0]);
 1929|    922|   w0 = w1;
 1930|    922|   w1 = w2;
 1931|    922|   w2 = 0;
 1932|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[22]);
 1933|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[21]);
 1934|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[20]);
 1935|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[19]);
 1936|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[18]);
 1937|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[17]);
 1938|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[16]);
 1939|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[15]);
 1940|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[14]);
 1941|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[13]);
 1942|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[12]);
 1943|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[11]);
 1944|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[10]);
 1945|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[9]);
 1946|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[8]);
 1947|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[7]);
 1948|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[6]);
 1949|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[5]);
 1950|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[4]);
 1951|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[3]);
 1952|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[2]);
 1953|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[1]);
 1954|    922|   word3_add(&w2, &w1, &w0, z[22]);
 1955|    922|   ws[22] = w0 * p_dash;
 1956|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[0]);
 1957|    922|   w0 = w1;
 1958|    922|   w1 = w2;
 1959|    922|   w2 = 0;
 1960|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[23]);
 1961|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[22]);
 1962|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[21]);
 1963|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[20]);
 1964|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[19]);
 1965|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[18]);
 1966|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[17]);
 1967|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[16]);
 1968|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[15]);
 1969|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[14]);
 1970|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[13]);
 1971|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[12]);
 1972|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[11]);
 1973|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[10]);
 1974|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[9]);
 1975|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[8]);
 1976|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[7]);
 1977|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[6]);
 1978|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[5]);
 1979|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[4]);
 1980|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[3]);
 1981|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[2]);
 1982|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[1]);
 1983|    922|   word3_add(&w2, &w1, &w0, z[23]);
 1984|    922|   ws[23] = w0 * p_dash;
 1985|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[0]);
 1986|    922|   w0 = w1;
 1987|    922|   w1 = w2;
 1988|    922|   w2 = 0;
 1989|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[24]);
 1990|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[23]);
 1991|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[22]);
 1992|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[21]);
 1993|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[20]);
 1994|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[19]);
 1995|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[18]);
 1996|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[17]);
 1997|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[16]);
 1998|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[15]);
 1999|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[14]);
 2000|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[13]);
 2001|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[12]);
 2002|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[11]);
 2003|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[10]);
 2004|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[9]);
 2005|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[8]);
 2006|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[7]);
 2007|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[6]);
 2008|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[5]);
 2009|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[4]);
 2010|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[3]);
 2011|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[2]);
 2012|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[1]);
 2013|    922|   word3_add(&w2, &w1, &w0, z[24]);
 2014|    922|   ws[24] = w0 * p_dash;
 2015|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[0]);
 2016|    922|   w0 = w1;
 2017|    922|   w1 = w2;
 2018|    922|   w2 = 0;
 2019|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[25]);
 2020|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[24]);
 2021|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[23]);
 2022|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[22]);
 2023|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[21]);
 2024|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[20]);
 2025|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[19]);
 2026|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[18]);
 2027|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[17]);
 2028|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[16]);
 2029|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[15]);
 2030|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[14]);
 2031|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[13]);
 2032|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[12]);
 2033|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[11]);
 2034|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[10]);
 2035|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[9]);
 2036|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[8]);
 2037|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[7]);
 2038|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[6]);
 2039|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[5]);
 2040|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[4]);
 2041|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[3]);
 2042|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[2]);
 2043|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[1]);
 2044|    922|   word3_add(&w2, &w1, &w0, z[25]);
 2045|    922|   ws[25] = w0 * p_dash;
 2046|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[0]);
 2047|    922|   w0 = w1;
 2048|    922|   w1 = w2;
 2049|    922|   w2 = 0;
 2050|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[26]);
 2051|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[25]);
 2052|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[24]);
 2053|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[23]);
 2054|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[22]);
 2055|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[21]);
 2056|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[20]);
 2057|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[19]);
 2058|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[18]);
 2059|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[17]);
 2060|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[16]);
 2061|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[15]);
 2062|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[14]);
 2063|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[13]);
 2064|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[12]);
 2065|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[11]);
 2066|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[10]);
 2067|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[9]);
 2068|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[8]);
 2069|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[7]);
 2070|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[6]);
 2071|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[5]);
 2072|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[4]);
 2073|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[3]);
 2074|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[2]);
 2075|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[1]);
 2076|    922|   word3_add(&w2, &w1, &w0, z[26]);
 2077|    922|   ws[26] = w0 * p_dash;
 2078|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[0]);
 2079|    922|   w0 = w1;
 2080|    922|   w1 = w2;
 2081|    922|   w2 = 0;
 2082|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[27]);
 2083|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[26]);
 2084|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[25]);
 2085|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[24]);
 2086|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[23]);
 2087|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[22]);
 2088|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[21]);
 2089|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[20]);
 2090|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[19]);
 2091|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[18]);
 2092|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[17]);
 2093|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[16]);
 2094|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[15]);
 2095|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[14]);
 2096|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[13]);
 2097|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[12]);
 2098|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[11]);
 2099|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[10]);
 2100|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[9]);
 2101|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[8]);
 2102|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[7]);
 2103|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[6]);
 2104|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[5]);
 2105|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[4]);
 2106|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[3]);
 2107|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[2]);
 2108|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[1]);
 2109|    922|   word3_add(&w2, &w1, &w0, z[27]);
 2110|    922|   ws[27] = w0 * p_dash;
 2111|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[0]);
 2112|    922|   w0 = w1;
 2113|    922|   w1 = w2;
 2114|    922|   w2 = 0;
 2115|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[28]);
 2116|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[27]);
 2117|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[26]);
 2118|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[25]);
 2119|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[24]);
 2120|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[23]);
 2121|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[22]);
 2122|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[21]);
 2123|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[20]);
 2124|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[19]);
 2125|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[18]);
 2126|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[17]);
 2127|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[16]);
 2128|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[15]);
 2129|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[14]);
 2130|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[13]);
 2131|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[12]);
 2132|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[11]);
 2133|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[10]);
 2134|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[9]);
 2135|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[8]);
 2136|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[7]);
 2137|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[6]);
 2138|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[5]);
 2139|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[4]);
 2140|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[3]);
 2141|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[2]);
 2142|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[1]);
 2143|    922|   word3_add(&w2, &w1, &w0, z[28]);
 2144|    922|   ws[28] = w0 * p_dash;
 2145|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[0]);
 2146|    922|   w0 = w1;
 2147|    922|   w1 = w2;
 2148|    922|   w2 = 0;
 2149|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[29]);
 2150|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[28]);
 2151|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[27]);
 2152|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[26]);
 2153|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[25]);
 2154|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[24]);
 2155|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[23]);
 2156|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[22]);
 2157|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[21]);
 2158|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[20]);
 2159|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[19]);
 2160|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[18]);
 2161|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[17]);
 2162|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[16]);
 2163|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[15]);
 2164|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[14]);
 2165|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[13]);
 2166|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[12]);
 2167|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[11]);
 2168|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[10]);
 2169|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[9]);
 2170|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[8]);
 2171|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[7]);
 2172|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[6]);
 2173|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[5]);
 2174|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[4]);
 2175|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[3]);
 2176|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[2]);
 2177|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[1]);
 2178|    922|   word3_add(&w2, &w1, &w0, z[29]);
 2179|    922|   ws[29] = w0 * p_dash;
 2180|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[0]);
 2181|    922|   w0 = w1;
 2182|    922|   w1 = w2;
 2183|    922|   w2 = 0;
 2184|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[30]);
 2185|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[29]);
 2186|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[28]);
 2187|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[27]);
 2188|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[26]);
 2189|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[25]);
 2190|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[24]);
 2191|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[23]);
 2192|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[22]);
 2193|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[21]);
 2194|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[20]);
 2195|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[19]);
 2196|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[18]);
 2197|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[17]);
 2198|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[16]);
 2199|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[15]);
 2200|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[14]);
 2201|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[13]);
 2202|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[12]);
 2203|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[11]);
 2204|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[10]);
 2205|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[9]);
 2206|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[8]);
 2207|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[7]);
 2208|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[6]);
 2209|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[5]);
 2210|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[4]);
 2211|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[3]);
 2212|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[2]);
 2213|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[1]);
 2214|    922|   word3_add(&w2, &w1, &w0, z[30]);
 2215|    922|   ws[30] = w0 * p_dash;
 2216|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[0]);
 2217|    922|   w0 = w1;
 2218|    922|   w1 = w2;
 2219|    922|   w2 = 0;
 2220|    922|   word3_muladd(&w2, &w1, &w0, ws[0], p[31]);
 2221|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[30]);
 2222|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[29]);
 2223|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[28]);
 2224|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[27]);
 2225|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[26]);
 2226|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[25]);
 2227|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[24]);
 2228|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[23]);
 2229|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[22]);
 2230|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[21]);
 2231|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[20]);
 2232|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[19]);
 2233|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[18]);
 2234|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[17]);
 2235|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[16]);
 2236|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[15]);
 2237|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[14]);
 2238|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[13]);
 2239|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[12]);
 2240|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[11]);
 2241|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[10]);
 2242|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[9]);
 2243|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[8]);
 2244|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[7]);
 2245|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[6]);
 2246|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[5]);
 2247|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[4]);
 2248|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[3]);
 2249|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[2]);
 2250|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[1]);
 2251|    922|   word3_add(&w2, &w1, &w0, z[31]);
 2252|    922|   ws[31] = w0 * p_dash;
 2253|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[0]);
 2254|    922|   w0 = w1;
 2255|    922|   w1 = w2;
 2256|    922|   w2 = 0;
 2257|    922|   word3_muladd(&w2, &w1, &w0, ws[1], p[31]);
 2258|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[30]);
 2259|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[29]);
 2260|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[28]);
 2261|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[27]);
 2262|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[26]);
 2263|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[25]);
 2264|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[24]);
 2265|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[23]);
 2266|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[22]);
 2267|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[21]);
 2268|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[20]);
 2269|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[19]);
 2270|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[18]);
 2271|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[17]);
 2272|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[16]);
 2273|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[15]);
 2274|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[14]);
 2275|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[13]);
 2276|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[12]);
 2277|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[11]);
 2278|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[10]);
 2279|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[9]);
 2280|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[8]);
 2281|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[7]);
 2282|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[6]);
 2283|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[5]);
 2284|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[4]);
 2285|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[3]);
 2286|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[2]);
 2287|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[1]);
 2288|    922|   word3_add(&w2, &w1, &w0, z[32]);
 2289|    922|   ws[0] = w0;
 2290|    922|   w0 = w1;
 2291|    922|   w1 = w2;
 2292|    922|   w2 = 0;
 2293|    922|   word3_muladd(&w2, &w1, &w0, ws[2], p[31]);
 2294|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[30]);
 2295|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[29]);
 2296|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[28]);
 2297|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[27]);
 2298|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[26]);
 2299|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[25]);
 2300|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[24]);
 2301|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[23]);
 2302|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[22]);
 2303|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[21]);
 2304|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[20]);
 2305|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[19]);
 2306|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[18]);
 2307|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[17]);
 2308|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[16]);
 2309|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[15]);
 2310|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[14]);
 2311|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[13]);
 2312|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[12]);
 2313|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[11]);
 2314|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[10]);
 2315|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[9]);
 2316|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[8]);
 2317|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[7]);
 2318|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[6]);
 2319|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[5]);
 2320|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[4]);
 2321|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[3]);
 2322|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[2]);
 2323|    922|   word3_add(&w2, &w1, &w0, z[33]);
 2324|    922|   ws[1] = w0;
 2325|    922|   w0 = w1;
 2326|    922|   w1 = w2;
 2327|    922|   w2 = 0;
 2328|    922|   word3_muladd(&w2, &w1, &w0, ws[3], p[31]);
 2329|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[30]);
 2330|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[29]);
 2331|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[28]);
 2332|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[27]);
 2333|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[26]);
 2334|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[25]);
 2335|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[24]);
 2336|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[23]);
 2337|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[22]);
 2338|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[21]);
 2339|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[20]);
 2340|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[19]);
 2341|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[18]);
 2342|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[17]);
 2343|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[16]);
 2344|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[15]);
 2345|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[14]);
 2346|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[13]);
 2347|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[12]);
 2348|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[11]);
 2349|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[10]);
 2350|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[9]);
 2351|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[8]);
 2352|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[7]);
 2353|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[6]);
 2354|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[5]);
 2355|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[4]);
 2356|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[3]);
 2357|    922|   word3_add(&w2, &w1, &w0, z[34]);
 2358|    922|   ws[2] = w0;
 2359|    922|   w0 = w1;
 2360|    922|   w1 = w2;
 2361|    922|   w2 = 0;
 2362|    922|   word3_muladd(&w2, &w1, &w0, ws[4], p[31]);
 2363|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[30]);
 2364|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[29]);
 2365|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[28]);
 2366|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[27]);
 2367|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[26]);
 2368|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[25]);
 2369|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[24]);
 2370|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[23]);
 2371|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[22]);
 2372|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[21]);
 2373|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[20]);
 2374|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[19]);
 2375|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[18]);
 2376|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[17]);
 2377|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[16]);
 2378|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[15]);
 2379|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[14]);
 2380|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[13]);
 2381|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[12]);
 2382|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[11]);
 2383|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[10]);
 2384|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[9]);
 2385|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[8]);
 2386|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[7]);
 2387|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[6]);
 2388|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[5]);
 2389|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[4]);
 2390|    922|   word3_add(&w2, &w1, &w0, z[35]);
 2391|    922|   ws[3] = w0;
 2392|    922|   w0 = w1;
 2393|    922|   w1 = w2;
 2394|    922|   w2 = 0;
 2395|    922|   word3_muladd(&w2, &w1, &w0, ws[5], p[31]);
 2396|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[30]);
 2397|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[29]);
 2398|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[28]);
 2399|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[27]);
 2400|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[26]);
 2401|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[25]);
 2402|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[24]);
 2403|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[23]);
 2404|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[22]);
 2405|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[21]);
 2406|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[20]);
 2407|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[19]);
 2408|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[18]);
 2409|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[17]);
 2410|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[16]);
 2411|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[15]);
 2412|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[14]);
 2413|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[13]);
 2414|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[12]);
 2415|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[11]);
 2416|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[10]);
 2417|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[9]);
 2418|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[8]);
 2419|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[7]);
 2420|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[6]);
 2421|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[5]);
 2422|    922|   word3_add(&w2, &w1, &w0, z[36]);
 2423|    922|   ws[4] = w0;
 2424|    922|   w0 = w1;
 2425|    922|   w1 = w2;
 2426|    922|   w2 = 0;
 2427|    922|   word3_muladd(&w2, &w1, &w0, ws[6], p[31]);
 2428|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[30]);
 2429|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[29]);
 2430|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[28]);
 2431|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[27]);
 2432|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[26]);
 2433|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[25]);
 2434|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[24]);
 2435|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[23]);
 2436|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[22]);
 2437|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[21]);
 2438|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[20]);
 2439|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[19]);
 2440|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[18]);
 2441|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[17]);
 2442|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[16]);
 2443|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[15]);
 2444|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[14]);
 2445|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[13]);
 2446|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[12]);
 2447|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[11]);
 2448|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[10]);
 2449|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[9]);
 2450|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[8]);
 2451|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[7]);
 2452|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[6]);
 2453|    922|   word3_add(&w2, &w1, &w0, z[37]);
 2454|    922|   ws[5] = w0;
 2455|    922|   w0 = w1;
 2456|    922|   w1 = w2;
 2457|    922|   w2 = 0;
 2458|    922|   word3_muladd(&w2, &w1, &w0, ws[7], p[31]);
 2459|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[30]);
 2460|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[29]);
 2461|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[28]);
 2462|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[27]);
 2463|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[26]);
 2464|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[25]);
 2465|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[24]);
 2466|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[23]);
 2467|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[22]);
 2468|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[21]);
 2469|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[20]);
 2470|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[19]);
 2471|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[18]);
 2472|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[17]);
 2473|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[16]);
 2474|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[15]);
 2475|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[14]);
 2476|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[13]);
 2477|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[12]);
 2478|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[11]);
 2479|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[10]);
 2480|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[9]);
 2481|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[8]);
 2482|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[7]);
 2483|    922|   word3_add(&w2, &w1, &w0, z[38]);
 2484|    922|   ws[6] = w0;
 2485|    922|   w0 = w1;
 2486|    922|   w1 = w2;
 2487|    922|   w2 = 0;
 2488|    922|   word3_muladd(&w2, &w1, &w0, ws[8], p[31]);
 2489|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[30]);
 2490|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[29]);
 2491|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[28]);
 2492|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[27]);
 2493|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[26]);
 2494|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[25]);
 2495|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[24]);
 2496|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[23]);
 2497|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[22]);
 2498|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[21]);
 2499|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[20]);
 2500|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[19]);
 2501|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[18]);
 2502|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[17]);
 2503|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[16]);
 2504|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[15]);
 2505|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[14]);
 2506|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[13]);
 2507|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[12]);
 2508|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[11]);
 2509|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[10]);
 2510|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[9]);
 2511|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[8]);
 2512|    922|   word3_add(&w2, &w1, &w0, z[39]);
 2513|    922|   ws[7] = w0;
 2514|    922|   w0 = w1;
 2515|    922|   w1 = w2;
 2516|    922|   w2 = 0;
 2517|    922|   word3_muladd(&w2, &w1, &w0, ws[9], p[31]);
 2518|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[30]);
 2519|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[29]);
 2520|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[28]);
 2521|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[27]);
 2522|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[26]);
 2523|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[25]);
 2524|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[24]);
 2525|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[23]);
 2526|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[22]);
 2527|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[21]);
 2528|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[20]);
 2529|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[19]);
 2530|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[18]);
 2531|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[17]);
 2532|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[16]);
 2533|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[15]);
 2534|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[14]);
 2535|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[13]);
 2536|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[12]);
 2537|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[11]);
 2538|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[10]);
 2539|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[9]);
 2540|    922|   word3_add(&w2, &w1, &w0, z[40]);
 2541|    922|   ws[8] = w0;
 2542|    922|   w0 = w1;
 2543|    922|   w1 = w2;
 2544|    922|   w2 = 0;
 2545|    922|   word3_muladd(&w2, &w1, &w0, ws[10], p[31]);
 2546|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[30]);
 2547|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[29]);
 2548|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[28]);
 2549|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[27]);
 2550|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[26]);
 2551|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[25]);
 2552|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[24]);
 2553|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[23]);
 2554|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[22]);
 2555|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[21]);
 2556|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[20]);
 2557|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[19]);
 2558|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[18]);
 2559|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[17]);
 2560|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[16]);
 2561|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[15]);
 2562|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[14]);
 2563|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[13]);
 2564|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[12]);
 2565|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[11]);
 2566|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[10]);
 2567|    922|   word3_add(&w2, &w1, &w0, z[41]);
 2568|    922|   ws[9] = w0;
 2569|    922|   w0 = w1;
 2570|    922|   w1 = w2;
 2571|    922|   w2 = 0;
 2572|    922|   word3_muladd(&w2, &w1, &w0, ws[11], p[31]);
 2573|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[30]);
 2574|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[29]);
 2575|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[28]);
 2576|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[27]);
 2577|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[26]);
 2578|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[25]);
 2579|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[24]);
 2580|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[23]);
 2581|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[22]);
 2582|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[21]);
 2583|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[20]);
 2584|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[19]);
 2585|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[18]);
 2586|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[17]);
 2587|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[16]);
 2588|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[15]);
 2589|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[14]);
 2590|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[13]);
 2591|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[12]);
 2592|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[11]);
 2593|    922|   word3_add(&w2, &w1, &w0, z[42]);
 2594|    922|   ws[10] = w0;
 2595|    922|   w0 = w1;
 2596|    922|   w1 = w2;
 2597|    922|   w2 = 0;
 2598|    922|   word3_muladd(&w2, &w1, &w0, ws[12], p[31]);
 2599|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[30]);
 2600|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[29]);
 2601|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[28]);
 2602|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[27]);
 2603|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[26]);
 2604|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[25]);
 2605|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[24]);
 2606|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[23]);
 2607|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[22]);
 2608|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[21]);
 2609|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[20]);
 2610|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[19]);
 2611|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[18]);
 2612|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[17]);
 2613|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[16]);
 2614|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[15]);
 2615|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[14]);
 2616|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[13]);
 2617|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[12]);
 2618|    922|   word3_add(&w2, &w1, &w0, z[43]);
 2619|    922|   ws[11] = w0;
 2620|    922|   w0 = w1;
 2621|    922|   w1 = w2;
 2622|    922|   w2 = 0;
 2623|    922|   word3_muladd(&w2, &w1, &w0, ws[13], p[31]);
 2624|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[30]);
 2625|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[29]);
 2626|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[28]);
 2627|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[27]);
 2628|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[26]);
 2629|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[25]);
 2630|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[24]);
 2631|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[23]);
 2632|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[22]);
 2633|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[21]);
 2634|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[20]);
 2635|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[19]);
 2636|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[18]);
 2637|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[17]);
 2638|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[16]);
 2639|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[15]);
 2640|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[14]);
 2641|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[13]);
 2642|    922|   word3_add(&w2, &w1, &w0, z[44]);
 2643|    922|   ws[12] = w0;
 2644|    922|   w0 = w1;
 2645|    922|   w1 = w2;
 2646|    922|   w2 = 0;
 2647|    922|   word3_muladd(&w2, &w1, &w0, ws[14], p[31]);
 2648|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[30]);
 2649|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[29]);
 2650|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[28]);
 2651|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[27]);
 2652|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[26]);
 2653|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[25]);
 2654|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[24]);
 2655|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[23]);
 2656|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[22]);
 2657|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[21]);
 2658|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[20]);
 2659|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[19]);
 2660|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[18]);
 2661|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[17]);
 2662|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[16]);
 2663|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[15]);
 2664|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[14]);
 2665|    922|   word3_add(&w2, &w1, &w0, z[45]);
 2666|    922|   ws[13] = w0;
 2667|    922|   w0 = w1;
 2668|    922|   w1 = w2;
 2669|    922|   w2 = 0;
 2670|    922|   word3_muladd(&w2, &w1, &w0, ws[15], p[31]);
 2671|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[30]);
 2672|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[29]);
 2673|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[28]);
 2674|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[27]);
 2675|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[26]);
 2676|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[25]);
 2677|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[24]);
 2678|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[23]);
 2679|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[22]);
 2680|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[21]);
 2681|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[20]);
 2682|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[19]);
 2683|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[18]);
 2684|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[17]);
 2685|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[16]);
 2686|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[15]);
 2687|    922|   word3_add(&w2, &w1, &w0, z[46]);
 2688|    922|   ws[14] = w0;
 2689|    922|   w0 = w1;
 2690|    922|   w1 = w2;
 2691|    922|   w2 = 0;
 2692|    922|   word3_muladd(&w2, &w1, &w0, ws[16], p[31]);
 2693|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[30]);
 2694|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[29]);
 2695|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[28]);
 2696|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[27]);
 2697|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[26]);
 2698|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[25]);
 2699|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[24]);
 2700|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[23]);
 2701|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[22]);
 2702|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[21]);
 2703|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[20]);
 2704|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[19]);
 2705|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[18]);
 2706|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[17]);
 2707|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[16]);
 2708|    922|   word3_add(&w2, &w1, &w0, z[47]);
 2709|    922|   ws[15] = w0;
 2710|    922|   w0 = w1;
 2711|    922|   w1 = w2;
 2712|    922|   w2 = 0;
 2713|    922|   word3_muladd(&w2, &w1, &w0, ws[17], p[31]);
 2714|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[30]);
 2715|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[29]);
 2716|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[28]);
 2717|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[27]);
 2718|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[26]);
 2719|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[25]);
 2720|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[24]);
 2721|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[23]);
 2722|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[22]);
 2723|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[21]);
 2724|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[20]);
 2725|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[19]);
 2726|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[18]);
 2727|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[17]);
 2728|    922|   word3_add(&w2, &w1, &w0, z[48]);
 2729|    922|   ws[16] = w0;
 2730|    922|   w0 = w1;
 2731|    922|   w1 = w2;
 2732|    922|   w2 = 0;
 2733|    922|   word3_muladd(&w2, &w1, &w0, ws[18], p[31]);
 2734|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[30]);
 2735|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[29]);
 2736|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[28]);
 2737|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[27]);
 2738|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[26]);
 2739|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[25]);
 2740|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[24]);
 2741|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[23]);
 2742|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[22]);
 2743|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[21]);
 2744|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[20]);
 2745|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[19]);
 2746|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[18]);
 2747|    922|   word3_add(&w2, &w1, &w0, z[49]);
 2748|    922|   ws[17] = w0;
 2749|    922|   w0 = w1;
 2750|    922|   w1 = w2;
 2751|    922|   w2 = 0;
 2752|    922|   word3_muladd(&w2, &w1, &w0, ws[19], p[31]);
 2753|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[30]);
 2754|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[29]);
 2755|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[28]);
 2756|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[27]);
 2757|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[26]);
 2758|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[25]);
 2759|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[24]);
 2760|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[23]);
 2761|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[22]);
 2762|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[21]);
 2763|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[20]);
 2764|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[19]);
 2765|    922|   word3_add(&w2, &w1, &w0, z[50]);
 2766|    922|   ws[18] = w0;
 2767|    922|   w0 = w1;
 2768|    922|   w1 = w2;
 2769|    922|   w2 = 0;
 2770|    922|   word3_muladd(&w2, &w1, &w0, ws[20], p[31]);
 2771|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[30]);
 2772|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[29]);
 2773|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[28]);
 2774|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[27]);
 2775|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[26]);
 2776|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[25]);
 2777|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[24]);
 2778|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[23]);
 2779|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[22]);
 2780|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[21]);
 2781|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[20]);
 2782|    922|   word3_add(&w2, &w1, &w0, z[51]);
 2783|    922|   ws[19] = w0;
 2784|    922|   w0 = w1;
 2785|    922|   w1 = w2;
 2786|    922|   w2 = 0;
 2787|    922|   word3_muladd(&w2, &w1, &w0, ws[21], p[31]);
 2788|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[30]);
 2789|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[29]);
 2790|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[28]);
 2791|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[27]);
 2792|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[26]);
 2793|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[25]);
 2794|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[24]);
 2795|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[23]);
 2796|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[22]);
 2797|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[21]);
 2798|    922|   word3_add(&w2, &w1, &w0, z[52]);
 2799|    922|   ws[20] = w0;
 2800|    922|   w0 = w1;
 2801|    922|   w1 = w2;
 2802|    922|   w2 = 0;
 2803|    922|   word3_muladd(&w2, &w1, &w0, ws[22], p[31]);
 2804|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[30]);
 2805|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[29]);
 2806|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[28]);
 2807|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[27]);
 2808|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[26]);
 2809|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[25]);
 2810|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[24]);
 2811|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[23]);
 2812|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[22]);
 2813|    922|   word3_add(&w2, &w1, &w0, z[53]);
 2814|    922|   ws[21] = w0;
 2815|    922|   w0 = w1;
 2816|    922|   w1 = w2;
 2817|    922|   w2 = 0;
 2818|    922|   word3_muladd(&w2, &w1, &w0, ws[23], p[31]);
 2819|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[30]);
 2820|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[29]);
 2821|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[28]);
 2822|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[27]);
 2823|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[26]);
 2824|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[25]);
 2825|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[24]);
 2826|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[23]);
 2827|    922|   word3_add(&w2, &w1, &w0, z[54]);
 2828|    922|   ws[22] = w0;
 2829|    922|   w0 = w1;
 2830|    922|   w1 = w2;
 2831|    922|   w2 = 0;
 2832|    922|   word3_muladd(&w2, &w1, &w0, ws[24], p[31]);
 2833|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[30]);
 2834|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[29]);
 2835|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[28]);
 2836|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[27]);
 2837|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[26]);
 2838|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[25]);
 2839|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[24]);
 2840|    922|   word3_add(&w2, &w1, &w0, z[55]);
 2841|    922|   ws[23] = w0;
 2842|    922|   w0 = w1;
 2843|    922|   w1 = w2;
 2844|    922|   w2 = 0;
 2845|    922|   word3_muladd(&w2, &w1, &w0, ws[25], p[31]);
 2846|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[30]);
 2847|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[29]);
 2848|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[28]);
 2849|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[27]);
 2850|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[26]);
 2851|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[25]);
 2852|    922|   word3_add(&w2, &w1, &w0, z[56]);
 2853|    922|   ws[24] = w0;
 2854|    922|   w0 = w1;
 2855|    922|   w1 = w2;
 2856|    922|   w2 = 0;
 2857|    922|   word3_muladd(&w2, &w1, &w0, ws[26], p[31]);
 2858|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[30]);
 2859|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[29]);
 2860|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[28]);
 2861|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[27]);
 2862|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[26]);
 2863|    922|   word3_add(&w2, &w1, &w0, z[57]);
 2864|    922|   ws[25] = w0;
 2865|    922|   w0 = w1;
 2866|    922|   w1 = w2;
 2867|    922|   w2 = 0;
 2868|    922|   word3_muladd(&w2, &w1, &w0, ws[27], p[31]);
 2869|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[30]);
 2870|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[29]);
 2871|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[28]);
 2872|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[27]);
 2873|    922|   word3_add(&w2, &w1, &w0, z[58]);
 2874|    922|   ws[26] = w0;
 2875|    922|   w0 = w1;
 2876|    922|   w1 = w2;
 2877|    922|   w2 = 0;
 2878|    922|   word3_muladd(&w2, &w1, &w0, ws[28], p[31]);
 2879|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[30]);
 2880|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[29]);
 2881|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[28]);
 2882|    922|   word3_add(&w2, &w1, &w0, z[59]);
 2883|    922|   ws[27] = w0;
 2884|    922|   w0 = w1;
 2885|    922|   w1 = w2;
 2886|    922|   w2 = 0;
 2887|    922|   word3_muladd(&w2, &w1, &w0, ws[29], p[31]);
 2888|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[30]);
 2889|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[29]);
 2890|    922|   word3_add(&w2, &w1, &w0, z[60]);
 2891|    922|   ws[28] = w0;
 2892|    922|   w0 = w1;
 2893|    922|   w1 = w2;
 2894|    922|   w2 = 0;
 2895|    922|   word3_muladd(&w2, &w1, &w0, ws[30], p[31]);
 2896|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[30]);
 2897|    922|   word3_add(&w2, &w1, &w0, z[61]);
 2898|    922|   ws[29] = w0;
 2899|    922|   w0 = w1;
 2900|    922|   w1 = w2;
 2901|    922|   w2 = 0;
 2902|    922|   word3_muladd(&w2, &w1, &w0, ws[31], p[31]);
 2903|    922|   word3_add(&w2, &w1, &w0, z[62]);
 2904|    922|   ws[30] = w0;
 2905|    922|   w0 = w1;
 2906|    922|   w1 = w2;
 2907|    922|   w2 = 0;
 2908|    922|   word3_add(&w2, &w1, &w0, z[63]);
 2909|    922|   ws[31] = w0;
 2910|    922|   ws[32] = w1;
 2911|    922|   word borrow = bigint_sub3(z, ws, 32 + 1, p, 32);
 2912|    922|   CT::conditional_assign_mem(borrow, z, ws, 32);
 2913|    922|   clear_mem(z + 32, 32);
 2914|    922|}

_ZN5Botan11inverse_modERKNS_6BigIntES2_:
  178|    423|BigInt inverse_mod(const BigInt& n, const BigInt& mod) {
  179|    423|   if(mod.is_zero()) {
  ------------------
  |  Branch (179:7): [True: 0, False: 423]
  ------------------
  180|      0|      throw Invalid_Argument("inverse_mod modulus cannot be zero");
  181|      0|   }
  182|    423|   if(mod.is_negative() || n.is_negative()) {
  ------------------
  |  Branch (182:7): [True: 0, False: 423]
  |  Branch (182:28): [True: 0, False: 423]
  ------------------
  183|      0|      throw Invalid_Argument("inverse_mod: arguments must be non-negative");
  184|      0|   }
  185|    423|   if(n.is_zero() || (n.is_even() && mod.is_even())) {
  ------------------
  |  Branch (185:7): [True: 0, False: 423]
  |  Branch (185:23): [True: 216, False: 207]
  |  Branch (185:38): [True: 0, False: 216]
  ------------------
  186|      0|      return BigInt::zero();
  187|      0|   }
  188|       |
  189|    423|   if(mod.is_odd()) {
  ------------------
  |  Branch (189:7): [True: 423, False: 0]
  ------------------
  190|       |      /*
  191|       |      Fastpath for common case. This leaks if n is greater than mod or
  192|       |      not, but we don't guarantee const time behavior in that case.
  193|       |      */
  194|    423|      if(n < mod) {
  ------------------
  |  Branch (194:10): [True: 423, False: 0]
  ------------------
  195|    423|         return inverse_mod_odd_modulus(n, mod);
  196|    423|      } else {
  197|      0|         return inverse_mod_odd_modulus(ct_modulo(n, mod), mod);
  198|      0|      }
  199|    423|   }
  200|       |
  201|       |   // If n is even and mod is even we already returned 0
  202|       |   // If n is even and mod is odd we jumped directly to odd-modulus algo
  203|      0|   BOTAN_DEBUG_ASSERT(n.is_odd());
  ------------------
  |  |   99|      0|      do {                          \
  |  |  100|      0|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  204|       |
  205|      0|   const size_t mod_lz = low_zero_bits(mod);
  206|      0|   BOTAN_ASSERT_NOMSG(mod_lz > 0);
  ------------------
  |  |   60|      0|   do {                                                                     \
  |  |   61|      0|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 0]
  |  |  ------------------
  |  |   62|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|      0|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  207|      0|   const size_t mod_bits = mod.bits();
  208|      0|   BOTAN_ASSERT_NOMSG(mod_bits > mod_lz);
  ------------------
  |  |   60|      0|   do {                                                                     \
  |  |   61|      0|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 0]
  |  |  ------------------
  |  |   62|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|      0|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  209|       |
  210|      0|   if(mod_lz == mod_bits - 1) {
  ------------------
  |  Branch (210:7): [True: 0, False: 0]
  ------------------
  211|       |      // In this case we are performing an inversion modulo 2^k
  212|      0|      return inverse_mod_pow2(n, mod_lz);
  213|      0|   }
  214|       |
  215|      0|   if(mod_lz == 1) {
  ------------------
  |  Branch (215:7): [True: 0, False: 0]
  ------------------
  216|       |      /*
  217|       |      Inversion modulo 2*o is an easier special case of CRT
  218|       |
  219|       |      This is exactly the main CRT flow below but taking advantage of
  220|       |      the fact that any odd number ^-1 modulo 2 is 1. As a result both
  221|       |      inv_2k and c can be taken to be 1, m2k is 2, and h is always
  222|       |      either 0 or 1, and its value depends only on the low bit of inv_o.
  223|       |
  224|       |      This is worth special casing because we generate RSA primes such
  225|       |      that phi(n) is of this form. However this only works for keys
  226|       |      that we generated in this way; pre-existing keys will typically
  227|       |      fall back to the general algorithm below.
  228|       |      */
  229|       |
  230|      0|      const BigInt o = mod >> 1;
  231|      0|      const BigInt n_redc = ct_modulo(n, o);
  232|      0|      const BigInt inv_o = inverse_mod_odd_modulus(n_redc, o);
  233|       |
  234|       |      // No modular inverse in this case:
  235|      0|      if(inv_o == 0) {
  ------------------
  |  Branch (235:10): [True: 0, False: 0]
  ------------------
  236|      0|         return BigInt::zero();
  237|      0|      }
  238|       |
  239|      0|      BigInt h = inv_o;
  240|      0|      h.ct_cond_add(!inv_o.get_bit(0), o);
  241|      0|      return h;
  242|      0|   }
  243|       |
  244|       |   /*
  245|       |   * In this case we are performing an inversion modulo 2^k*o for
  246|       |   * some k >= 2 and some odd (not necessarily prime) integer.
  247|       |   * Compute the inversions modulo 2^k and modulo o, then combine them
  248|       |   * using CRT, which is possible because 2^k and o are relatively prime.
  249|       |   */
  250|       |
  251|      0|   const BigInt o = mod >> mod_lz;
  252|      0|   const BigInt n_redc = ct_modulo(n, o);
  253|      0|   const BigInt inv_o = inverse_mod_odd_modulus(n_redc, o);
  254|      0|   const BigInt inv_2k = inverse_mod_pow2(n, mod_lz);
  255|       |
  256|       |   // No modular inverse in this case:
  257|      0|   if(inv_o == 0 || inv_2k == 0) {
  ------------------
  |  Branch (257:7): [True: 0, False: 0]
  |  Branch (257:21): [True: 0, False: 0]
  ------------------
  258|      0|      return BigInt::zero();
  259|      0|   }
  260|       |
  261|      0|   const BigInt m2k = BigInt::power_of_2(mod_lz);
  262|       |   // Compute the CRT parameter
  263|      0|   const BigInt c = inverse_mod_pow2(o, mod_lz);
  264|       |
  265|       |   // Compute h = c*(inv_2k-inv_o) mod 2^k
  266|      0|   BigInt h = c * (inv_2k - inv_o);
  267|      0|   const bool h_neg = h.is_negative();
  268|      0|   h.set_sign(BigInt::Positive);
  269|      0|   h.mask_bits(mod_lz);
  270|      0|   const bool h_nonzero = h.is_nonzero();
  271|      0|   h.ct_cond_assign(h_nonzero && h_neg, m2k - h);
  ------------------
  |  Branch (271:21): [True: 0, False: 0]
  |  Branch (271:34): [True: 0, False: 0]
  ------------------
  272|       |
  273|       |   // Return result inv_o + h * o
  274|      0|   h *= o;
  275|      0|   h += inv_o;
  276|      0|   return h;
  277|      0|}
mod_inv.cpp:_ZN5Botan12_GLOBAL__N_123inverse_mod_odd_modulusERKNS_6BigIntES3_:
   18|    423|BigInt inverse_mod_odd_modulus(const BigInt& n, const BigInt& mod) {
   19|       |   // Caller should assure these preconditions:
   20|    423|   BOTAN_DEBUG_ASSERT(n.is_positive());
  ------------------
  |  |   99|    423|      do {                          \
  |  |  100|    423|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
   21|    423|   BOTAN_DEBUG_ASSERT(mod.is_positive());
  ------------------
  |  |   99|    423|      do {                          \
  |  |  100|    423|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
   22|    423|   BOTAN_DEBUG_ASSERT(n < mod);
  ------------------
  |  |   99|    423|      do {                          \
  |  |  100|    423|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
   23|    423|   BOTAN_DEBUG_ASSERT(mod >= 3 && mod.is_odd());
  ------------------
  |  |   99|    423|      do {                          \
  |  |  100|    423|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
   24|       |
   25|       |   /*
   26|       |   This uses a modular inversion algorithm designed by Niels Möller
   27|       |   and implemented in Nettle. The same algorithm was later also
   28|       |   adapted to GMP in mpn_sec_invert.
   29|       |
   30|       |   It can be easily implemented in a way that does not depend on
   31|       |   secret branches or memory lookups, providing resistance against
   32|       |   some forms of side channel attack.
   33|       |
   34|       |   There is also a description of the algorithm in Appendix 5 of "Fast
   35|       |   Software Polynomial Multiplication on ARM Processors using the NEON Engine"
   36|       |   by Danilo Câmara, Conrado P. L. Gouvêa, Julio López, and Ricardo
   37|       |   Dahab in LNCS 8182
   38|       |      https://conradoplg.cryptoland.net/files/2010/12/mocrysen13.pdf
   39|       |
   40|       |   Thanks to Niels for creating the algorithm, explaining some things
   41|       |   about it, and the reference to the paper.
   42|       |   */
   43|       |
   44|    423|   const size_t mod_words = mod.sig_words();
   45|    423|   BOTAN_ASSERT(mod_words > 0, "Not empty");
  ------------------
  |  |   51|    423|   do {                                                                                 \
  |  |   52|    423|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 423]
  |  |  ------------------
  |  |   53|    423|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|    423|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   46|       |
   47|    423|   secure_vector<word> tmp_mem(5 * mod_words);
   48|       |
   49|    423|   word* v_w = &tmp_mem[0];
   50|    423|   word* u_w = &tmp_mem[1 * mod_words];
   51|    423|   word* b_w = &tmp_mem[2 * mod_words];
   52|    423|   word* a_w = &tmp_mem[3 * mod_words];
   53|    423|   word* mp1o2 = &tmp_mem[4 * mod_words];
   54|       |
   55|    423|   CT::poison(tmp_mem.data(), tmp_mem.size());
   56|       |
   57|    423|   copy_mem(a_w, n.data(), std::min(n.size(), mod_words));
   58|    423|   copy_mem(b_w, mod.data(), std::min(mod.size(), mod_words));
   59|    423|   u_w[0] = 1;
   60|       |   // v_w = 0
   61|       |
   62|       |   // compute (mod + 1) / 2 which [because mod is odd] is equal to
   63|       |   // (mod / 2) + 1
   64|    423|   copy_mem(mp1o2, mod.data(), std::min(mod.size(), mod_words));
   65|    423|   bigint_shr1(mp1o2, mod_words, 0, 1);
   66|    423|   word carry = bigint_add2_nc(mp1o2, mod_words, u_w, 1);
   67|    423|   BOTAN_ASSERT_NOMSG(carry == 0);
  ------------------
  |  |   60|    423|   do {                                                                     \
  |  |   61|    423|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 423]
  |  |  ------------------
  |  |   62|    423|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|    423|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   68|       |
   69|       |   // Only n.bits() + mod.bits() iterations are required, but avoid leaking the size of n
   70|    423|   const size_t execs = 2 * mod.bits();
   71|       |
   72|   205k|   for(size_t i = 0; i != execs; ++i) {
  ------------------
  |  Branch (72:22): [True: 205k, False: 423]
  ------------------
   73|   205k|      const word odd_a = a_w[0] & 1;
   74|       |
   75|       |      //if(odd_a) a -= b
   76|   205k|      word underflow = bigint_cnd_sub(odd_a, a_w, b_w, mod_words);
   77|       |
   78|       |      //if(underflow) { b -= a; a = abs(a); swap(u, v); }
   79|   205k|      bigint_cnd_add(underflow, b_w, a_w, mod_words);
   80|   205k|      bigint_cnd_abs(underflow, a_w, mod_words);
   81|   205k|      bigint_cnd_swap(underflow, u_w, v_w, mod_words);
   82|       |
   83|       |      // a >>= 1
   84|   205k|      bigint_shr1(a_w, mod_words, 0, 1);
   85|       |
   86|       |      //if(odd_a) u -= v;
   87|   205k|      word borrow = bigint_cnd_sub(odd_a, u_w, v_w, mod_words);
   88|       |
   89|       |      // if(borrow) u += p
   90|   205k|      bigint_cnd_add(borrow, u_w, mod.data(), mod_words);
   91|       |
   92|   205k|      const word odd_u = u_w[0] & 1;
   93|       |
   94|       |      // u >>= 1
   95|   205k|      bigint_shr1(u_w, mod_words, 0, 1);
   96|       |
   97|       |      //if(odd_u) u += mp1o2;
   98|   205k|      bigint_cnd_add(odd_u, u_w, mp1o2, mod_words);
   99|   205k|   }
  100|       |
  101|    423|   auto a_is_0 = CT::Mask<word>::set();
  102|  2.04k|   for(size_t i = 0; i != mod_words; ++i) {
  ------------------
  |  Branch (102:22): [True: 1.61k, False: 423]
  ------------------
  103|  1.61k|      a_is_0 &= CT::Mask<word>::is_zero(a_w[i]);
  104|  1.61k|   }
  105|       |
  106|    423|   auto b_is_1 = CT::Mask<word>::is_equal(b_w[0], 1);
  107|  1.61k|   for(size_t i = 1; i != mod_words; ++i) {
  ------------------
  |  Branch (107:22): [True: 1.19k, False: 423]
  ------------------
  108|  1.19k|      b_is_1 &= CT::Mask<word>::is_zero(b_w[i]);
  109|  1.19k|   }
  110|       |
  111|    423|   BOTAN_ASSERT(a_is_0.is_set(), "A is zero");
  ------------------
  |  |   51|    423|   do {                                                                                 \
  |  |   52|    423|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 423]
  |  |  ------------------
  |  |   53|    423|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|    423|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  112|       |
  113|       |   // if b != 1 then gcd(n,mod) > 1 and inverse does not exist
  114|       |   // in which case zero out the result to indicate this
  115|    423|   (~b_is_1).if_set_zero_out(v_w, mod_words);
  116|       |
  117|       |   /*
  118|       |   * We've placed the result in the lowest words of the temp buffer.
  119|       |   * So just clear out the other values and then give that buffer to a
  120|       |   * BigInt.
  121|       |   */
  122|    423|   clear_mem(&tmp_mem[mod_words], 4 * mod_words);
  123|       |
  124|    423|   CT::unpoison(tmp_mem.data(), tmp_mem.size());
  125|       |
  126|    423|   BigInt r;
  127|    423|   r.swap_reg(tmp_mem);
  128|    423|   return r;
  129|    423|}

_ZN5Botan13monty_inverseEm:
   16|  2.33k|word monty_inverse(word a) {
   17|  2.33k|   if(a % 2 == 0) {
  ------------------
  |  Branch (17:7): [True: 0, False: 2.33k]
  ------------------
   18|      0|      throw Invalid_Argument("monty_inverse only valid for odd integers");
   19|      0|   }
   20|       |
   21|       |   /*
   22|       |   * From "A New Algorithm for Inversion mod p^k" by Çetin Kaya Koç
   23|       |   * https://eprint.iacr.org/2017/411.pdf sections 5 and 7.
   24|       |   */
   25|       |
   26|  2.33k|   word b = 1;
   27|  2.33k|   word r = 0;
   28|       |
   29|   151k|   for(size_t i = 0; i != BOTAN_MP_WORD_BITS; ++i) {
  ------------------
  |  |   50|   151k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  |  Branch (29:22): [True: 149k, False: 2.33k]
  ------------------
   30|   149k|      const word bi = b % 2;
   31|   149k|      r >>= 1;
   32|   149k|      r += bi << (BOTAN_MP_WORD_BITS - 1);
  ------------------
  |  |   50|   149k|#define BOTAN_MP_WORD_BITS 64
  ------------------
   33|       |
   34|   149k|      b -= a * bi;
   35|   149k|      b >>= 1;
   36|   149k|   }
   37|       |
   38|       |   // Now invert in addition space
   39|  2.33k|   r = (MP_WORD_MAX - r) + 1;
   40|       |
   41|  2.33k|   return r;
   42|  2.33k|}
_ZN5Botan17Montgomery_ParamsC2ERKNS_6BigIntERKNS_15Modular_ReducerE:
   44|    905|Montgomery_Params::Montgomery_Params(const BigInt& p, const Modular_Reducer& mod_p) {
   45|    905|   if(p.is_even() || p < 3) {
  ------------------
  |  Branch (45:7): [True: 0, False: 905]
  |  Branch (45:22): [True: 0, False: 905]
  ------------------
   46|      0|      throw Invalid_Argument("Montgomery_Params invalid modulus");
   47|      0|   }
   48|       |
   49|    905|   m_p = p;
   50|    905|   m_p_words = m_p.sig_words();
   51|    905|   m_p_dash = monty_inverse(m_p.word_at(0));
   52|       |
   53|    905|   const BigInt r = BigInt::power_of_2(m_p_words * BOTAN_MP_WORD_BITS);
  ------------------
  |  |   50|    905|#define BOTAN_MP_WORD_BITS 64
  ------------------
   54|       |
   55|    905|   m_r1 = mod_p.reduce(r);
   56|    905|   m_r2 = mod_p.square(m_r1);
   57|    905|   m_r3 = mod_p.multiply(m_r1, m_r2);
   58|    905|}
_ZN5Botan17Montgomery_ParamsC2ERKNS_6BigIntE:
   60|  1.43k|Montgomery_Params::Montgomery_Params(const BigInt& p) {
   61|  1.43k|   if(p.is_even() || p < 3) {
  ------------------
  |  Branch (61:7): [True: 0, False: 1.43k]
  |  Branch (61:22): [True: 0, False: 1.43k]
  ------------------
   62|      0|      throw Invalid_Argument("Montgomery_Params invalid modulus");
   63|      0|   }
   64|       |
   65|  1.43k|   m_p = p;
   66|  1.43k|   m_p_words = m_p.sig_words();
   67|  1.43k|   m_p_dash = monty_inverse(m_p.word_at(0));
   68|       |
   69|  1.43k|   const BigInt r = BigInt::power_of_2(m_p_words * BOTAN_MP_WORD_BITS);
  ------------------
  |  |   50|  1.43k|#define BOTAN_MP_WORD_BITS 64
  ------------------
   70|       |
   71|       |   // It might be faster to use ct_modulo here vs setting up Barrett reduction?
   72|  1.43k|   Modular_Reducer mod_p(p);
   73|       |
   74|  1.43k|   m_r1 = mod_p.reduce(r);
   75|  1.43k|   m_r2 = mod_p.square(m_r1);
   76|  1.43k|   m_r3 = mod_p.multiply(m_r1, m_r2);
   77|  1.43k|}
_ZNK5Botan17Montgomery_Params4redcERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
   84|  1.97k|BigInt Montgomery_Params::redc(const BigInt& x, secure_vector<word>& ws) const {
   85|  1.97k|   const size_t output_size = m_p_words + 1;
   86|       |
   87|  1.97k|   if(ws.size() < output_size) {
  ------------------
  |  Branch (87:7): [True: 1.97k, False: 0]
  ------------------
   88|  1.97k|      ws.resize(output_size);
   89|  1.97k|   }
   90|       |
   91|  1.97k|   BigInt z = x;
   92|  1.97k|   z.grow_to(2 * m_p_words);
   93|       |
   94|  1.97k|   bigint_monty_redc(z.mutable_data(), m_p.data(), m_p_words, m_p_dash, ws.data(), ws.size());
   95|       |
   96|  1.97k|   return z;
   97|  1.97k|}
_ZNK5Botan17Montgomery_Params3mulERKNS_6BigIntES3_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
   99|  14.6k|BigInt Montgomery_Params::mul(const BigInt& x, const BigInt& y, secure_vector<word>& ws) const {
  100|  14.6k|   const size_t output_size = 2 * m_p_words + 2;
  101|       |
  102|  14.6k|   if(ws.size() < output_size) {
  ------------------
  |  Branch (102:7): [True: 14.6k, False: 0]
  ------------------
  103|  14.6k|      ws.resize(output_size);
  104|  14.6k|   }
  105|       |
  106|  14.6k|   BOTAN_DEBUG_ASSERT(x.sig_words() <= m_p_words);
  ------------------
  |  |   99|  14.6k|      do {                          \
  |  |  100|  14.6k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  107|  14.6k|   BOTAN_DEBUG_ASSERT(y.sig_words() <= m_p_words);
  ------------------
  |  |   99|  14.6k|      do {                          \
  |  |  100|  14.6k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  108|       |
  109|  14.6k|   BigInt z = BigInt::with_capacity(output_size);
  110|  14.6k|   bigint_mul(z.mutable_data(),
  111|  14.6k|              z.size(),
  112|  14.6k|              x.data(),
  113|  14.6k|              x.size(),
  114|  14.6k|              std::min(m_p_words, x.size()),
  115|  14.6k|              y.data(),
  116|  14.6k|              y.size(),
  117|  14.6k|              std::min(m_p_words, y.size()),
  118|  14.6k|              ws.data(),
  119|  14.6k|              ws.size());
  120|       |
  121|  14.6k|   bigint_monty_redc(z.mutable_data(), m_p.data(), m_p_words, m_p_dash, ws.data(), ws.size());
  122|       |
  123|  14.6k|   return z;
  124|  14.6k|}
_ZNK5Botan17Montgomery_Params6mul_byERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  182|  29.1k|void Montgomery_Params::mul_by(BigInt& x, const BigInt& y, secure_vector<word>& ws) const {
  183|  29.1k|   const size_t output_size = 2 * m_p_words;
  184|       |
  185|  29.1k|   if(ws.size() < 2 * output_size) {
  ------------------
  |  Branch (185:7): [True: 0, False: 29.1k]
  ------------------
  186|      0|      ws.resize(2 * output_size);
  187|      0|   }
  188|       |
  189|  29.1k|   word* z_data = &ws[0];
  190|  29.1k|   word* ws_data = &ws[output_size];
  191|       |
  192|  29.1k|   BOTAN_DEBUG_ASSERT(x.sig_words() <= m_p_words);
  ------------------
  |  |   99|  29.1k|      do {                          \
  |  |  100|  29.1k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  193|       |
  194|  29.1k|   bigint_mul(z_data,
  195|  29.1k|              output_size,
  196|  29.1k|              x.data(),
  197|  29.1k|              x.size(),
  198|  29.1k|              std::min(m_p_words, x.size()),
  199|  29.1k|              y.data(),
  200|  29.1k|              y.size(),
  201|  29.1k|              std::min(m_p_words, y.size()),
  202|  29.1k|              ws_data,
  203|  29.1k|              output_size);
  204|       |
  205|  29.1k|   bigint_monty_redc(z_data, m_p.data(), m_p_words, m_p_dash, ws_data, output_size);
  206|       |
  207|  29.1k|   if(x.size() < output_size) {
  ------------------
  |  Branch (207:7): [True: 0, False: 29.1k]
  ------------------
  208|      0|      x.grow_to(output_size);
  209|      0|   }
  210|  29.1k|   copy_mem(x.mutable_data(), z_data, output_size);
  211|  29.1k|}
_ZNK5Botan17Montgomery_Params11square_thisERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  231|   271k|void Montgomery_Params::square_this(BigInt& x, secure_vector<word>& ws) const {
  232|   271k|   const size_t output_size = 2 * m_p_words;
  233|       |
  234|   271k|   if(ws.size() < 2 * output_size) {
  ------------------
  |  Branch (234:7): [True: 1.93k, False: 269k]
  ------------------
  235|  1.93k|      ws.resize(2 * output_size);
  236|  1.93k|   }
  237|       |
  238|   271k|   word* z_data = &ws[0];
  239|   271k|   word* ws_data = &ws[output_size];
  240|       |
  241|   271k|   BOTAN_DEBUG_ASSERT(x.sig_words() <= m_p_words);
  ------------------
  |  |   99|   271k|      do {                          \
  |  |  100|   271k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  242|       |
  243|   271k|   bigint_sqr(z_data, output_size, x.data(), x.size(), std::min(m_p_words, x.size()), ws_data, output_size);
  244|       |
  245|   271k|   bigint_monty_redc(z_data, m_p.data(), m_p_words, m_p_dash, ws_data, output_size);
  246|       |
  247|   271k|   if(x.size() < output_size) {
  ------------------
  |  Branch (247:7): [True: 0, False: 271k]
  ------------------
  248|      0|      x.grow_to(output_size);
  249|      0|   }
  250|   271k|   copy_mem(x.mutable_data(), z_data, output_size);
  251|   271k|}
_ZN5Botan14Montgomery_IntC2ERKNSt3__110shared_ptrIKNS_17Montgomery_ParamsEEERKNS_6BigIntEb:
  256|  16.6k|      m_params(params) {
  257|  16.6k|   if(redc_needed == false) {
  ------------------
  |  Branch (257:7): [True: 14.6k, False: 1.97k]
  ------------------
  258|  14.6k|      m_v = v;
  259|  14.6k|   } else {
  260|  1.97k|      BOTAN_ASSERT_NOMSG(m_v < m_params->p());
  ------------------
  |  |   60|  1.97k|   do {                                                                     \
  |  |   61|  1.97k|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 1.97k]
  |  |  ------------------
  |  |   62|  1.97k|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|  1.97k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  261|  1.97k|      secure_vector<word> ws;
  262|  1.97k|      m_v = m_params->mul(v, m_params->R2(), ws);
  263|  1.97k|   }
  264|  16.6k|}
_ZN5Botan14Montgomery_Int8fix_sizeEv:
  292|  16.6k|void Montgomery_Int::fix_size() {
  293|  16.6k|   const size_t p_words = m_params->p_words();
  294|       |
  295|  16.6k|   if(m_v.sig_words() > p_words) {
  ------------------
  |  Branch (295:7): [True: 0, False: 16.6k]
  ------------------
  296|      0|      throw Internal_Error("Montgomery_Int::fix_size v too large");
  297|      0|   }
  298|       |
  299|  16.6k|   m_v.grow_to(p_words);
  300|  16.6k|}
_ZNK5Botan14Montgomery_Int5valueEv:
  318|  1.97k|BigInt Montgomery_Int::value() const {
  319|  1.97k|   secure_vector<word> ws;
  320|  1.97k|   return m_params->redc(m_v, ws);
  321|  1.97k|}
_ZNK5Botan14Montgomery_IntmlERKS0_:
  357|  12.6k|Montgomery_Int Montgomery_Int::operator*(const Montgomery_Int& other) const {
  358|  12.6k|   secure_vector<word> ws;
  359|  12.6k|   return Montgomery_Int(m_params, m_params->mul(m_v, other.m_v, ws), false);
  360|  12.6k|}
_ZN5Botan14Montgomery_Int6mul_byERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  366|  29.1k|Montgomery_Int& Montgomery_Int::mul_by(const Montgomery_Int& other, secure_vector<word>& ws) {
  367|  29.1k|   m_params->mul_by(m_v, other.m_v, ws);
  368|  29.1k|   return (*this);
  369|  29.1k|}
_ZN5Botan14Montgomery_Int19square_this_n_timesERNSt3__16vectorImNS_16secure_allocatorImEEEEm:
  386|   106k|Montgomery_Int& Montgomery_Int::square_this_n_times(secure_vector<word>& ws, size_t n) {
  387|   377k|   for(size_t i = 0; i != n; ++i) {
  ------------------
  |  Branch (387:22): [True: 271k, False: 106k]
  ------------------
  388|   271k|      m_params->square_this(m_v, ws);
  389|   271k|   }
  390|   106k|   return (*this);
  391|   106k|}

_ZN5Botan30Montgomery_Exponentation_StateC2ERKNSt3__110shared_ptrIKNS_17Montgomery_ParamsEEERKNS_6BigIntEmb:
   40|  1.97k|      m_params(params), m_window_bits(window_bits == 0 ? 4 : window_bits) {
   41|  1.97k|   BOTAN_ARG_CHECK(g < m_params->p(), "Montgomery base too big");
  ------------------
  |  |   30|  1.97k|   do {                                                          \
  |  |   31|  1.97k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 0, False: 1.97k]
  |  |  ------------------
  |  |   32|  1.97k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  1.97k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   42|       |
   43|  1.97k|   if(m_window_bits < 1 || m_window_bits > 12) {  // really even 8 is too large ...
  ------------------
  |  Branch (43:7): [True: 0, False: 1.97k]
  |  Branch (43:28): [True: 0, False: 1.97k]
  ------------------
   44|      0|      throw Invalid_Argument("Invalid window bits for Montgomery exponentiation");
   45|      0|   }
   46|       |
   47|  1.97k|   const size_t window_size = (static_cast<size_t>(1) << m_window_bits);
   48|       |
   49|  1.97k|   m_g.reserve(window_size);
   50|       |
   51|  1.97k|   m_g.push_back(Montgomery_Int(m_params, m_params->R1(), false));
   52|       |
   53|  1.97k|   m_g.push_back(Montgomery_Int(m_params, g));
   54|       |
   55|  14.6k|   for(size_t i = 2; i != window_size; ++i) {
  ------------------
  |  Branch (55:22): [True: 12.6k, False: 1.97k]
  ------------------
   56|  12.6k|      m_g.push_back(m_g[1] * m_g[i - 1]);
   57|  12.6k|   }
   58|       |
   59|       |   // Resize each element to exactly p words
   60|  18.5k|   for(size_t i = 0; i != window_size; ++i) {
  ------------------
  |  Branch (60:22): [True: 16.6k, False: 1.97k]
  ------------------
   61|  16.6k|      m_g[i].fix_size();
   62|  16.6k|      if(const_time) {
  ------------------
  |  Branch (62:10): [True: 0, False: 16.6k]
  ------------------
   63|      0|         m_g[i].const_time_poison();
   64|      0|      }
   65|  16.6k|   }
   66|  1.97k|}
_ZNK5Botan30Montgomery_Exponentation_State22exponentiation_vartimeERKNS_6BigIntE:
  121|  1.97k|BigInt Montgomery_Exponentation_State::exponentiation_vartime(const BigInt& scalar) const {
  122|  1.97k|   const size_t exp_nibbles = (scalar.bits() + m_window_bits - 1) / m_window_bits;
  123|       |
  124|  1.97k|   secure_vector<word> ws;
  125|       |
  126|  1.97k|   if(exp_nibbles == 0) {
  ------------------
  |  Branch (126:7): [True: 0, False: 1.97k]
  ------------------
  127|      0|      return BigInt::one();
  128|      0|   }
  129|       |
  130|  1.97k|   Montgomery_Int x = m_g[scalar.get_substring(m_window_bits * (exp_nibbles - 1), m_window_bits)];
  131|       |
  132|   108k|   for(size_t i = exp_nibbles - 1; i > 0; --i) {
  ------------------
  |  Branch (132:36): [True: 106k, False: 1.97k]
  ------------------
  133|   106k|      x.square_this_n_times(ws, m_window_bits);
  134|       |
  135|   106k|      const uint32_t nibble = scalar.get_substring(m_window_bits * (i - 1), m_window_bits);
  136|   106k|      if(nibble > 0) {
  ------------------
  |  Branch (136:10): [True: 29.1k, False: 77.6k]
  ------------------
  137|  29.1k|         x.mul_by(m_g[nibble], ws);
  138|  29.1k|      }
  139|   106k|   }
  140|       |
  141|  1.97k|   x.const_time_unpoison();
  142|  1.97k|   return x.value();
  143|  1.97k|}
_ZN5Botan16monty_precomputeERKNSt3__110shared_ptrIKNS_17Montgomery_ParamsEEERKNS_6BigIntEmb:
  146|  1.97k|   const std::shared_ptr<const Montgomery_Params>& params, const BigInt& g, size_t window_bits, bool const_time) {
  147|  1.97k|   return std::make_shared<const Montgomery_Exponentation_State>(params, g, window_bits, const_time);
  148|  1.97k|}
_ZN5Botan21monty_execute_vartimeERKNS_30Montgomery_Exponentation_StateERKNS_6BigIntE:
  154|  1.97k|BigInt monty_execute_vartime(const Montgomery_Exponentation_State& precomputed_state, const BigInt& k) {
  155|  1.97k|   return precomputed_state.exponentiation_vartime(k);
  156|  1.97k|}

_ZN5Botan10prime_p521Ev:
   15|      3|const BigInt& prime_p521() {
   16|      3|   static const BigInt p521(
   17|      3|      "0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
   18|      3|      "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF");
   19|       |
   20|      3|   return p521;
   21|      3|}
_ZN5Botan10prime_p192Ev:
  122|  3.44k|const BigInt& prime_p192() {
  123|  3.44k|   static const BigInt p192("0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFF");
  124|  3.44k|   return p192;
  125|  3.44k|}
_ZN5Botan9redc_p192ERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  127|  64.0k|void redc_p192(BigInt& x, secure_vector<word>& ws) {
  128|  64.0k|   BOTAN_DEBUG_ASSERT(x.is_positive());
  ------------------
  |  |   99|  64.0k|      do {                          \
  |  |  100|  64.0k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  129|       |
  130|  64.0k|   BOTAN_UNUSED(ws);
  ------------------
  |  |  118|  64.0k|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
  131|       |
  132|  64.0k|   static const size_t p192_limbs = 192 / BOTAN_MP_WORD_BITS;
  ------------------
  |  |   50|  64.0k|#define BOTAN_MP_WORD_BITS 64
  ------------------
  133|       |
  134|  64.0k|   x.grow_to(2 * p192_limbs);
  135|  64.0k|   word* xw = x.mutable_data();
  136|       |
  137|  64.0k|   const uint64_t X00 = get_uint32(xw, 0);
  138|  64.0k|   const uint64_t X01 = get_uint32(xw, 1);
  139|  64.0k|   const uint64_t X02 = get_uint32(xw, 2);
  140|  64.0k|   const uint64_t X03 = get_uint32(xw, 3);
  141|  64.0k|   const uint64_t X04 = get_uint32(xw, 4);
  142|  64.0k|   const uint64_t X05 = get_uint32(xw, 5);
  143|  64.0k|   const uint64_t X06 = get_uint32(xw, 6);
  144|  64.0k|   const uint64_t X07 = get_uint32(xw, 7);
  145|  64.0k|   const uint64_t X08 = get_uint32(xw, 8);
  146|  64.0k|   const uint64_t X09 = get_uint32(xw, 9);
  147|  64.0k|   const uint64_t X10 = get_uint32(xw, 10);
  148|  64.0k|   const uint64_t X11 = get_uint32(xw, 11);
  149|       |
  150|  64.0k|   const uint64_t S0 = X00 + X06 + X10;
  151|  64.0k|   const uint64_t S1 = X01 + X07 + X11;
  152|  64.0k|   const uint64_t S2 = X02 + X06 + X08 + X10;
  153|  64.0k|   const uint64_t S3 = X03 + X07 + X09 + X11;
  154|  64.0k|   const uint64_t S4 = X04 + X08 + X10;
  155|  64.0k|   const uint64_t S5 = X05 + X09 + X11;
  156|       |
  157|  64.0k|   uint64_t S = 0;
  158|  64.0k|   uint32_t R0 = 0, R1 = 0;
  159|       |
  160|  64.0k|   S += S0;
  161|  64.0k|   R0 = static_cast<uint32_t>(S);
  162|  64.0k|   S >>= 32;
  163|       |
  164|  64.0k|   S += S1;
  165|  64.0k|   R1 = static_cast<uint32_t>(S);
  166|  64.0k|   S >>= 32;
  167|       |
  168|  64.0k|   set_words(xw, 0, R0, R1);
  169|       |
  170|  64.0k|   S += S2;
  171|  64.0k|   R0 = static_cast<uint32_t>(S);
  172|  64.0k|   S >>= 32;
  173|       |
  174|  64.0k|   S += S3;
  175|  64.0k|   R1 = static_cast<uint32_t>(S);
  176|  64.0k|   S >>= 32;
  177|       |
  178|  64.0k|   set_words(xw, 2, R0, R1);
  179|       |
  180|  64.0k|   S += S4;
  181|  64.0k|   R0 = static_cast<uint32_t>(S);
  182|  64.0k|   S >>= 32;
  183|       |
  184|  64.0k|   S += S5;
  185|  64.0k|   R1 = static_cast<uint32_t>(S);
  186|  64.0k|   S >>= 32;
  187|       |
  188|  64.0k|   set_words(xw, 4, R0, R1);
  189|       |
  190|       |   // No underflow possible
  191|       |
  192|       |   /*
  193|       |   This is a table of (i*P-192) % 2**192 for i in 1...3
  194|       |   */
  195|  64.0k|   static const word p192_mults[3][p192_limbs] = {
  196|  64.0k|#if(BOTAN_MP_WORD_BITS == 64)
  197|  64.0k|      {0xFFFFFFFFFFFFFFFF, 0xFFFFFFFFFFFFFFFE, 0xFFFFFFFFFFFFFFFF},
  198|  64.0k|      {0xFFFFFFFFFFFFFFFE, 0xFFFFFFFFFFFFFFFD, 0xFFFFFFFFFFFFFFFF},
  199|  64.0k|      {0xFFFFFFFFFFFFFFFD, 0xFFFFFFFFFFFFFFFC, 0xFFFFFFFFFFFFFFFF},
  200|       |#else
  201|       |      {0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFE, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF},
  202|       |      {0xFFFFFFFE, 0xFFFFFFFF, 0xFFFFFFFD, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF},
  203|       |      {0xFFFFFFFD, 0xFFFFFFFF, 0xFFFFFFFC, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF},
  204|       |#endif
  205|  64.0k|   };
  206|       |
  207|  64.0k|   CT::unpoison(S);
  208|  64.0k|   BOTAN_ASSERT(S <= 2, "Expected overflow");
  ------------------
  |  |   51|  64.0k|   do {                                                                                 \
  |  |   52|  64.0k|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 64.0k]
  |  |  ------------------
  |  |   53|  64.0k|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|  64.0k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  209|       |
  210|  64.0k|   BOTAN_ASSERT_NOMSG(x.size() >= p192_limbs + 1);
  ------------------
  |  |   60|  64.0k|   do {                                                                     \
  |  |   61|  64.0k|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 64.0k]
  |  |  ------------------
  |  |   62|  64.0k|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|  64.0k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  211|  64.0k|   x.mask_bits(192);
  212|  64.0k|   word borrow = bigint_sub2(x.mutable_data(), p192_limbs + 1, p192_mults[S], p192_limbs);
  213|  64.0k|   BOTAN_DEBUG_ASSERT(borrow == 0 || borrow == 1);
  ------------------
  |  |   99|  64.0k|      do {                          \
  |  |  100|  64.0k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  214|  64.0k|   bigint_cnd_add(borrow, x.mutable_data(), p192_limbs + 1, p192_mults[0], p192_limbs);
  215|  64.0k|}
_ZN5Botan10prime_p224Ev:
  217|      4|const BigInt& prime_p224() {
  218|      4|   static const BigInt p224("0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF000000000000000000000001");
  219|      4|   return p224;
  220|      4|}
_ZN5Botan10prime_p256Ev:
  319|   122k|const BigInt& prime_p256() {
  320|   122k|   static const BigInt p256("0xFFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFF");
  321|   122k|   return p256;
  322|   122k|}
_ZN5Botan9redc_p256ERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  324|  1.38M|void redc_p256(BigInt& x, secure_vector<word>& ws) {
  325|  1.38M|   BOTAN_DEBUG_ASSERT(x.is_positive());
  ------------------
  |  |   99|  1.38M|      do {                          \
  |  |  100|  1.38M|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  326|       |
  327|  1.38M|   static const size_t p256_limbs = (BOTAN_MP_WORD_BITS == 32) ? 8 : 4;
  ------------------
  |  |   50|  1.38M|#define BOTAN_MP_WORD_BITS 64
  ------------------
  |  Branch (327:37): [Folded - Ignored]
  ------------------
  328|       |
  329|  1.38M|   BOTAN_UNUSED(ws);
  ------------------
  |  |  118|  1.38M|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
  330|       |
  331|  1.38M|   x.grow_to(2 * p256_limbs);
  332|  1.38M|   word* xw = x.mutable_data();
  333|       |
  334|  1.38M|   const int64_t X00 = get_uint32(xw, 0);
  335|  1.38M|   const int64_t X01 = get_uint32(xw, 1);
  336|  1.38M|   const int64_t X02 = get_uint32(xw, 2);
  337|  1.38M|   const int64_t X03 = get_uint32(xw, 3);
  338|  1.38M|   const int64_t X04 = get_uint32(xw, 4);
  339|  1.38M|   const int64_t X05 = get_uint32(xw, 5);
  340|  1.38M|   const int64_t X06 = get_uint32(xw, 6);
  341|  1.38M|   const int64_t X07 = get_uint32(xw, 7);
  342|  1.38M|   const int64_t X08 = get_uint32(xw, 8);
  343|  1.38M|   const int64_t X09 = get_uint32(xw, 9);
  344|  1.38M|   const int64_t X10 = get_uint32(xw, 10);
  345|  1.38M|   const int64_t X11 = get_uint32(xw, 11);
  346|  1.38M|   const int64_t X12 = get_uint32(xw, 12);
  347|  1.38M|   const int64_t X13 = get_uint32(xw, 13);
  348|  1.38M|   const int64_t X14 = get_uint32(xw, 14);
  349|  1.38M|   const int64_t X15 = get_uint32(xw, 15);
  350|       |
  351|       |   // Adds 6 * P-256 to prevent underflow
  352|  1.38M|   const int64_t S0 = 0xFFFFFFFA + X00 + X08 + X09 - (X11 + X12 + X13) - X14;
  353|  1.38M|   const int64_t S1 = 0xFFFFFFFF + X01 + X09 + X10 - X12 - (X13 + X14 + X15);
  354|  1.38M|   const int64_t S2 = 0xFFFFFFFF + X02 + X10 + X11 - (X13 + X14 + X15);
  355|  1.38M|   const int64_t S3 = 0x00000005 + X03 + (X11 + X12) * 2 + X13 - X15 - X08 - X09;
  356|  1.38M|   const int64_t S4 = 0x00000000 + X04 + (X12 + X13) * 2 + X14 - X09 - X10;
  357|  1.38M|   const int64_t S5 = 0x00000000 + X05 + (X13 + X14) * 2 + X15 - X10 - X11;
  358|  1.38M|   const int64_t S6 = 0x00000006 + X06 + X13 + X14 * 3 + X15 * 2 - X08 - X09;
  359|  1.38M|   const int64_t S7 = 0xFFFFFFFA + X07 + X15 * 3 + X08 - X10 - (X11 + X12 + X13);
  360|       |
  361|  1.38M|   int64_t S = 0;
  362|       |
  363|  1.38M|   uint32_t R0 = 0, R1 = 0;
  364|       |
  365|  1.38M|   S += S0;
  366|  1.38M|   R0 = static_cast<uint32_t>(S);
  367|  1.38M|   S >>= 32;
  368|       |
  369|  1.38M|   S += S1;
  370|  1.38M|   R1 = static_cast<uint32_t>(S);
  371|  1.38M|   S >>= 32;
  372|       |
  373|  1.38M|   set_words(xw, 0, R0, R1);
  374|       |
  375|  1.38M|   S += S2;
  376|  1.38M|   R0 = static_cast<uint32_t>(S);
  377|  1.38M|   S >>= 32;
  378|       |
  379|  1.38M|   S += S3;
  380|  1.38M|   R1 = static_cast<uint32_t>(S);
  381|  1.38M|   S >>= 32;
  382|       |
  383|  1.38M|   set_words(xw, 2, R0, R1);
  384|       |
  385|  1.38M|   S += S4;
  386|  1.38M|   R0 = static_cast<uint32_t>(S);
  387|  1.38M|   S >>= 32;
  388|       |
  389|  1.38M|   S += S5;
  390|  1.38M|   R1 = static_cast<uint32_t>(S);
  391|  1.38M|   S >>= 32;
  392|       |
  393|  1.38M|   set_words(xw, 4, R0, R1);
  394|       |
  395|  1.38M|   S += S6;
  396|  1.38M|   R0 = static_cast<uint32_t>(S);
  397|  1.38M|   S >>= 32;
  398|       |
  399|  1.38M|   S += S7;
  400|  1.38M|   R1 = static_cast<uint32_t>(S);
  401|  1.38M|   S >>= 32;
  402|  1.38M|   set_words(xw, 6, R0, R1);
  403|       |
  404|  1.38M|   S += 5;  // the top digits of 6*P-256
  405|       |
  406|       |   /*
  407|       |   This is a table of (i*P-256) % 2**256 for i in 1...10
  408|       |   */
  409|  1.38M|   static const word p256_mults[11][p256_limbs] = {
  410|  1.38M|#if(BOTAN_MP_WORD_BITS == 64)
  411|  1.38M|      {0xFFFFFFFFFFFFFFFF, 0x00000000FFFFFFFF, 0x0000000000000000, 0xFFFFFFFF00000001},
  412|  1.38M|      {0xFFFFFFFFFFFFFFFE, 0x00000001FFFFFFFF, 0x0000000000000000, 0xFFFFFFFE00000002},
  413|  1.38M|      {0xFFFFFFFFFFFFFFFD, 0x00000002FFFFFFFF, 0x0000000000000000, 0xFFFFFFFD00000003},
  414|  1.38M|      {0xFFFFFFFFFFFFFFFC, 0x00000003FFFFFFFF, 0x0000000000000000, 0xFFFFFFFC00000004},
  415|  1.38M|      {0xFFFFFFFFFFFFFFFB, 0x00000004FFFFFFFF, 0x0000000000000000, 0xFFFFFFFB00000005},
  416|  1.38M|      {0xFFFFFFFFFFFFFFFA, 0x00000005FFFFFFFF, 0x0000000000000000, 0xFFFFFFFA00000006},
  417|  1.38M|      {0xFFFFFFFFFFFFFFF9, 0x00000006FFFFFFFF, 0x0000000000000000, 0xFFFFFFF900000007},
  418|  1.38M|      {0xFFFFFFFFFFFFFFF8, 0x00000007FFFFFFFF, 0x0000000000000000, 0xFFFFFFF800000008},
  419|  1.38M|      {0xFFFFFFFFFFFFFFF7, 0x00000008FFFFFFFF, 0x0000000000000000, 0xFFFFFFF700000009},
  420|  1.38M|      {0xFFFFFFFFFFFFFFF6, 0x00000009FFFFFFFF, 0x0000000000000000, 0xFFFFFFF60000000A},
  421|  1.38M|      {0xFFFFFFFFFFFFFFF5, 0x0000000AFFFFFFFF, 0x0000000000000000, 0xFFFFFFF50000000B},
  422|       |#else
  423|       |      {0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000000, 0x00000000, 0x00000000, 0x00000001, 0xFFFFFFFF},
  424|       |      {0xFFFFFFFE, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000001, 0x00000000, 0x00000000, 0x00000002, 0xFFFFFFFE},
  425|       |      {0xFFFFFFFD, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000002, 0x00000000, 0x00000000, 0x00000003, 0xFFFFFFFD},
  426|       |      {0xFFFFFFFC, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000003, 0x00000000, 0x00000000, 0x00000004, 0xFFFFFFFC},
  427|       |      {0xFFFFFFFB, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000004, 0x00000000, 0x00000000, 0x00000005, 0xFFFFFFFB},
  428|       |      {0xFFFFFFFA, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000005, 0x00000000, 0x00000000, 0x00000006, 0xFFFFFFFA},
  429|       |      {0xFFFFFFF9, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000006, 0x00000000, 0x00000000, 0x00000007, 0xFFFFFFF9},
  430|       |      {0xFFFFFFF8, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000007, 0x00000000, 0x00000000, 0x00000008, 0xFFFFFFF8},
  431|       |      {0xFFFFFFF7, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000008, 0x00000000, 0x00000000, 0x00000009, 0xFFFFFFF7},
  432|       |      {0xFFFFFFF6, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000009, 0x00000000, 0x00000000, 0x0000000A, 0xFFFFFFF6},
  433|       |      {0xFFFFFFF5, 0xFFFFFFFF, 0xFFFFFFFF, 0x0000000A, 0x00000000, 0x00000000, 0x0000000B, 0xFFFFFFF5},
  434|       |#endif
  435|  1.38M|   };
  436|       |
  437|  1.38M|   CT::unpoison(S);
  438|  1.38M|   BOTAN_ASSERT(S >= 0 && S <= 10, "Expected overflow");
  ------------------
  |  |   51|  1.38M|   do {                                                                                 \
  |  |   52|  2.76M|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:12): [True: 1.38M, False: 0]
  |  |  |  Branch (52:12): [True: 1.38M, False: 0]
  |  |  ------------------
  |  |   53|  1.38M|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|  1.38M|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  439|       |
  440|  1.38M|   BOTAN_ASSERT_NOMSG(x.size() >= p256_limbs + 1);
  ------------------
  |  |   60|  1.38M|   do {                                                                     \
  |  |   61|  1.38M|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 1.38M]
  |  |  ------------------
  |  |   62|  1.38M|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|  1.38M|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  441|  1.38M|   x.mask_bits(256);
  442|  1.38M|   word borrow = bigint_sub2(x.mutable_data(), p256_limbs + 1, p256_mults[S], p256_limbs);
  443|  1.38M|   BOTAN_DEBUG_ASSERT(borrow == 0 || borrow == 1);
  ------------------
  |  |   99|  1.38M|      do {                          \
  |  |  100|  1.38M|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  444|  1.38M|   bigint_cnd_add(borrow, x.mutable_data(), p256_limbs + 1, p256_mults[0], p256_limbs);
  445|  1.38M|}
_ZN5Botan10prime_p384Ev:
  447|      3|const BigInt& prime_p384() {
  448|      3|   static const BigInt p384(
  449|      3|      "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFF");
  450|      3|   return p384;
  451|      3|}
nistp_redc.cpp:_ZN5Botan12_GLOBAL__N_110get_uint32EPKmm:
  103|  22.8M|inline uint32_t get_uint32(const word xw[], size_t i) {
  104|       |#if(BOTAN_MP_WORD_BITS == 32)
  105|       |   return xw[i];
  106|       |#else
  107|  22.8M|   return static_cast<uint32_t>(xw[i / 2] >> ((i % 2) * 32));
  108|  22.8M|#endif
  109|  22.8M|}
nistp_redc.cpp:_ZN5Botan12_GLOBAL__N_19set_wordsEPmmjj:
  111|  5.71M|inline void set_words(word x[], size_t i, uint32_t R0, uint32_t R1) {
  112|       |#if(BOTAN_MP_WORD_BITS == 32)
  113|       |   x[i] = R0;
  114|       |   x[i + 1] = R1;
  115|       |#else
  116|  5.71M|   x[i / 2] = (static_cast<uint64_t>(R1) << 32) | R0;
  117|  5.71M|#endif
  118|  5.71M|}

_ZN5Botan17sqrt_modulo_primeERKNS_6BigIntES2_:
   38|  1.18k|BigInt sqrt_modulo_prime(const BigInt& a, const BigInt& p) {
   39|  1.18k|   BOTAN_ARG_CHECK(p > 1, "invalid prime");
  ------------------
  |  |   30|  1.18k|   do {                                                          \
  |  |   31|  1.18k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 0, False: 1.18k]
  |  |  ------------------
  |  |   32|  1.18k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  1.18k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   40|  1.18k|   BOTAN_ARG_CHECK(a < p, "value to solve for must be less than p");
  ------------------
  |  |   30|  1.18k|   do {                                                          \
  |  |   31|  1.18k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 0, False: 1.18k]
  |  |  ------------------
  |  |   32|  1.18k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  1.18k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   41|  1.18k|   BOTAN_ARG_CHECK(a >= 0, "value to solve for must not be negative");
  ------------------
  |  |   30|  1.18k|   do {                                                          \
  |  |   31|  1.18k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 0, False: 1.18k]
  |  |  ------------------
  |  |   32|  1.18k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  1.18k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   42|       |
   43|       |   // some very easy cases
   44|  1.18k|   if(p == 2 || a <= 1) {
  ------------------
  |  Branch (44:7): [True: 0, False: 1.18k]
  |  Branch (44:17): [True: 0, False: 1.18k]
  ------------------
   45|      0|      return a;
   46|      0|   }
   47|       |
   48|  1.18k|   BOTAN_ARG_CHECK(p.is_odd(), "invalid prime");
  ------------------
  |  |   30|  1.18k|   do {                                                          \
  |  |   31|  1.18k|      if(!(expr))                                                \
  |  |  ------------------
  |  |  |  Branch (31:10): [True: 0, False: 1.18k]
  |  |  ------------------
  |  |   32|  1.18k|         Botan::throw_invalid_argument(msg, __func__, __FILE__); \
  |  |   33|  1.18k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (33:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   49|       |
   50|  1.18k|   if(jacobi(a, p) != 1) {  // not a quadratic residue
  ------------------
  |  Branch (50:7): [True: 276, False: 905]
  ------------------
   51|    276|      return BigInt::from_s32(-1);
   52|    276|   }
   53|       |
   54|    905|   Modular_Reducer mod_p(p);
   55|    905|   auto monty_p = std::make_shared<Montgomery_Params>(p, mod_p);
   56|       |
   57|    905|   if(p % 4 == 3)  // The easy case
  ------------------
  |  Branch (57:7): [True: 905, False: 0]
  ------------------
   58|    905|   {
   59|    905|      return monty_exp_vartime(monty_p, a, ((p + 1) >> 2));
   60|    905|   }
   61|       |
   62|       |   // Otherwise we have to use Shanks-Tonelli
   63|      0|   size_t s = low_zero_bits(p - 1);
   64|      0|   BigInt q = p >> s;
   65|       |
   66|      0|   q -= 1;
   67|      0|   q >>= 1;
   68|       |
   69|      0|   BigInt r = monty_exp_vartime(monty_p, a, q);
   70|      0|   BigInt n = mod_p.multiply(a, mod_p.square(r));
   71|      0|   r = mod_p.multiply(r, a);
   72|       |
   73|      0|   if(n == 1) {
  ------------------
  |  Branch (73:7): [True: 0, False: 0]
  ------------------
   74|      0|      return r;
   75|      0|   }
   76|       |
   77|       |   // find random quadratic nonresidue z
   78|      0|   word z = 2;
   79|      0|   for(;;) {
   80|      0|      if(jacobi(BigInt::from_word(z), p) == -1) {  // found one
  ------------------
  |  Branch (80:10): [True: 0, False: 0]
  ------------------
   81|      0|         break;
   82|      0|      }
   83|       |
   84|      0|      z += 1;  // try next z
   85|       |
   86|       |      /*
   87|       |      * The expected number of tests to find a non-residue modulo a
   88|       |      * prime is 2. If we have not found one after 256 then almost
   89|       |      * certainly we have been given a non-prime p.
   90|       |      */
   91|      0|      if(z >= 256) {
  ------------------
  |  Branch (91:10): [True: 0, False: 0]
  ------------------
   92|      0|         return BigInt::from_s32(-1);
   93|      0|      }
   94|      0|   }
   95|       |
   96|      0|   BigInt c = monty_exp_vartime(monty_p, BigInt::from_word(z), (q << 1) + 1);
   97|       |
   98|      0|   while(n > 1) {
  ------------------
  |  Branch (98:10): [True: 0, False: 0]
  ------------------
   99|      0|      q = n;
  100|       |
  101|      0|      size_t i = 0;
  102|      0|      while(q != 1) {
  ------------------
  |  Branch (102:13): [True: 0, False: 0]
  ------------------
  103|      0|         q = mod_p.square(q);
  104|      0|         ++i;
  105|       |
  106|      0|         if(i >= s) {
  ------------------
  |  Branch (106:13): [True: 0, False: 0]
  ------------------
  107|      0|            return BigInt::from_s32(-1);
  108|      0|         }
  109|      0|      }
  110|       |
  111|      0|      BOTAN_ASSERT_NOMSG(s >= (i + 1));  // No underflow!
  ------------------
  |  |   60|      0|   do {                                                                     \
  |  |   61|      0|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 0]
  |  |  ------------------
  |  |   62|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|      0|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  112|      0|      c = monty_exp_vartime(monty_p, c, BigInt::power_of_2(s - i - 1));
  113|      0|      r = mod_p.multiply(r, c);
  114|      0|      c = mod_p.square(c);
  115|      0|      n = mod_p.multiply(n, c);
  116|       |
  117|       |      // s decreases as the algorithm proceeds
  118|      0|      BOTAN_ASSERT_NOMSG(s >= i);
  ------------------
  |  |   60|      0|   do {                                                                     \
  |  |   61|      0|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 0]
  |  |  ------------------
  |  |   62|      0|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|      0|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  119|      0|      s = i;
  120|      0|   }
  121|       |
  122|      0|   return r;
  123|      0|}
_ZN5Botan6jacobiERKNS_6BigIntES2_:
  128|  1.18k|int32_t jacobi(const BigInt& a, const BigInt& n) {
  129|  1.18k|   if(n.is_even() || n < 2) {
  ------------------
  |  Branch (129:7): [True: 0, False: 1.18k]
  |  Branch (129:22): [True: 0, False: 1.18k]
  ------------------
  130|      0|      throw Invalid_Argument("jacobi: second argument must be odd and > 1");
  131|      0|   }
  132|       |
  133|  1.18k|   BigInt x = a % n;
  134|  1.18k|   BigInt y = n;
  135|  1.18k|   int32_t J = 1;
  136|       |
  137|  87.4k|   while(y > 1) {
  ------------------
  |  Branch (137:10): [True: 86.2k, False: 1.18k]
  ------------------
  138|  86.2k|      x %= y;
  139|  86.2k|      if(x > y / 2) {
  ------------------
  |  Branch (139:10): [True: 38.8k, False: 47.3k]
  ------------------
  140|  38.8k|         x = y - x;
  141|  38.8k|         if(y % 4 == 3) {
  ------------------
  |  Branch (141:13): [True: 19.4k, False: 19.3k]
  ------------------
  142|  19.4k|            J = -J;
  143|  19.4k|         }
  144|  38.8k|      }
  145|  86.2k|      if(x.is_zero()) {
  ------------------
  |  Branch (145:10): [True: 0, False: 86.2k]
  ------------------
  146|      0|         return 0;
  147|      0|      }
  148|       |
  149|  86.2k|      size_t shifts = low_zero_bits(x);
  150|  86.2k|      x >>= shifts;
  151|  86.2k|      if(shifts % 2) {
  ------------------
  |  Branch (151:10): [True: 27.3k, False: 58.9k]
  ------------------
  152|  27.3k|         word y_mod_8 = y % 8;
  153|  27.3k|         if(y_mod_8 == 3 || y_mod_8 == 5) {
  ------------------
  |  Branch (153:13): [True: 6.46k, False: 20.8k]
  |  Branch (153:29): [True: 6.90k, False: 13.9k]
  ------------------
  154|  13.3k|            J = -J;
  155|  13.3k|         }
  156|  27.3k|      }
  157|       |
  158|  86.2k|      if(x % 4 == 3 && y % 4 == 3) {
  ------------------
  |  Branch (158:10): [True: 42.1k, False: 44.1k]
  |  Branch (158:24): [True: 21.1k, False: 20.9k]
  ------------------
  159|  21.1k|         J = -J;
  160|  21.1k|      }
  161|  86.2k|      std::swap(x, y);
  162|  86.2k|   }
  163|  1.18k|   return J;
  164|  1.18k|}
_ZN5Botan6squareERKNS_6BigIntE:
  169|  2.33k|BigInt square(const BigInt& x) {
  170|  2.33k|   BigInt z = x;
  171|  2.33k|   secure_vector<word> ws;
  172|  2.33k|   z.square(ws);
  173|  2.33k|   return z;
  174|  2.33k|}
_ZN5Botan13low_zero_bitsERKNS_6BigIntE:
  179|  86.2k|size_t low_zero_bits(const BigInt& n) {
  180|  86.2k|   size_t low_zero = 0;
  181|       |
  182|  86.2k|   auto seen_nonempty_word = CT::Mask<word>::cleared();
  183|       |
  184|   803k|   for(size_t i = 0; i != n.size(); ++i) {
  ------------------
  |  Branch (184:22): [True: 717k, False: 86.2k]
  ------------------
  185|   717k|      const word x = n.word_at(i);
  186|       |
  187|       |      // ctz(0) will return sizeof(word)
  188|   717k|      const size_t tz_x = ctz(x);
  189|       |
  190|       |      // if x > 0 we want to count tz_x in total but not any
  191|       |      // further words, so set the mask after the addition
  192|   717k|      low_zero += seen_nonempty_word.if_not_set_return(tz_x);
  193|       |
  194|   717k|      seen_nonempty_word |= CT::Mask<word>::expand(x);
  195|   717k|   }
  196|       |
  197|       |   // if we saw no words with x > 0 then n == 0 and the value we have
  198|       |   // computed is meaningless. Instead return BigInt::zero() in that case.
  199|  86.2k|   return seen_nonempty_word.if_set_return(low_zero);
  200|  86.2k|}

_ZN5Botan15Modular_ReducerC2ERKNS_6BigIntE:
   19|  2.34k|Modular_Reducer::Modular_Reducer(const BigInt& mod) {
   20|  2.34k|   if(mod < 0) {
  ------------------
  |  Branch (20:7): [True: 0, False: 2.34k]
  ------------------
   21|      0|      throw Invalid_Argument("Modular_Reducer: modulus must be positive");
   22|      0|   }
   23|       |
   24|       |   // Left uninitialized if mod == 0
   25|  2.34k|   m_mod_words = 0;
   26|       |
   27|  2.34k|   if(mod > 0) {
  ------------------
  |  Branch (27:7): [True: 2.34k, False: 0]
  ------------------
   28|  2.34k|      m_modulus = mod;
   29|  2.34k|      m_mod_words = m_modulus.sig_words();
   30|       |
   31|       |      // Compute mu = floor(2^{2k} / m)
   32|  2.34k|      m_mu.set_bit(2 * BOTAN_MP_WORD_BITS * m_mod_words);
  ------------------
  |  |   50|  2.34k|#define BOTAN_MP_WORD_BITS 64
  ------------------
   33|  2.34k|      m_mu = ct_divide(m_mu, m_modulus);
   34|  2.34k|   }
   35|  2.34k|}
_ZNK5Botan15Modular_Reducer6reduceERKNS_6BigIntE:
   37|  8.24k|BigInt Modular_Reducer::reduce(const BigInt& x) const {
   38|  8.24k|   BigInt r;
   39|  8.24k|   secure_vector<word> ws;
   40|  8.24k|   reduce(r, x, ws);
   41|  8.24k|   return r;
   42|  8.24k|}
_ZNK5Botan15Modular_Reducer6reduceERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
   69|  8.24k|void Modular_Reducer::reduce(BigInt& t1, const BigInt& x, secure_vector<word>& ws) const {
   70|  8.24k|   if(&t1 == &x) {
  ------------------
  |  Branch (70:7): [True: 0, False: 8.24k]
  ------------------
   71|      0|      throw Invalid_State("Modular_Reducer arguments cannot alias");
   72|      0|   }
   73|  8.24k|   if(m_mod_words == 0) {
  ------------------
  |  Branch (73:7): [True: 0, False: 8.24k]
  ------------------
   74|      0|      throw Invalid_State("Modular_Reducer: Never initalized");
   75|      0|   }
   76|       |
   77|  8.24k|   const size_t x_sw = x.sig_words();
   78|       |
   79|  8.24k|   if(x_sw > 2 * m_mod_words) {
  ------------------
  |  Branch (79:7): [True: 0, False: 8.24k]
  ------------------
   80|       |      // too big, fall back to slow boat division
   81|      0|      t1 = ct_modulo(x, m_modulus);
   82|      0|      return;
   83|      0|   }
   84|       |
   85|  8.24k|   t1 = x;
   86|  8.24k|   t1.set_sign(BigInt::Positive);
   87|  8.24k|   t1 >>= (BOTAN_MP_WORD_BITS * (m_mod_words - 1));
  ------------------
  |  |   50|  8.24k|#define BOTAN_MP_WORD_BITS 64
  ------------------
   88|       |
   89|  8.24k|   t1.mul(m_mu, ws);
   90|  8.24k|   t1 >>= (BOTAN_MP_WORD_BITS * (m_mod_words + 1));
  ------------------
  |  |   50|  8.24k|#define BOTAN_MP_WORD_BITS 64
  ------------------
   91|       |
   92|       |   // TODO add masked mul to avoid computing high bits
   93|  8.24k|   t1.mul(m_modulus, ws);
   94|  8.24k|   t1.mask_bits(BOTAN_MP_WORD_BITS * (m_mod_words + 1));
  ------------------
  |  |   50|  8.24k|#define BOTAN_MP_WORD_BITS 64
  ------------------
   95|       |
   96|  8.24k|   t1.rev_sub(x.data(), std::min(x_sw, m_mod_words + 1), ws);
   97|       |
   98|       |   /*
   99|       |   * If t1 < 0 then we must add b^(k+1) where b = 2^w. To avoid a
  100|       |   * side channel perform the addition unconditionally, with ws set
  101|       |   * to either b^(k+1) or else 0.
  102|       |   */
  103|  8.24k|   const word t1_neg = t1.is_negative();
  104|       |
  105|  8.24k|   if(ws.size() < m_mod_words + 2) {
  ------------------
  |  Branch (105:7): [True: 78, False: 8.16k]
  ------------------
  106|     78|      ws.resize(m_mod_words + 2);
  107|     78|   }
  108|  8.24k|   clear_mem(ws.data(), ws.size());
  109|  8.24k|   ws[m_mod_words + 1] = t1_neg;
  110|       |
  111|  8.24k|   t1.add(ws.data(), m_mod_words + 2, BigInt::Positive);
  112|       |
  113|       |   // Per HAC this step requires at most 2 subtractions
  114|  8.24k|   t1.ct_reduce_below(m_modulus, ws, 2);
  115|       |
  116|  8.24k|   cnd_rev_sub(t1.is_nonzero() && x.is_negative(), t1, m_modulus.data(), m_modulus.size(), ws);
  ------------------
  |  Branch (116:16): [True: 8.24k, False: 0]
  |  Branch (116:35): [True: 0, False: 8.24k]
  ------------------
  117|  8.24k|}
reducer.cpp:_ZN5Botan12_GLOBAL__N_111cnd_rev_subEbRNS_6BigIntEPKmmRNSt3__16vectorImNS_16secure_allocatorImEEEE:
   49|  8.24k|void cnd_rev_sub(bool cnd, BigInt& x, const word y[], size_t y_sw, secure_vector<word>& ws) {
   50|  8.24k|   if(x.sign() != BigInt::Positive) {
  ------------------
  |  Branch (50:7): [True: 0, False: 8.24k]
  ------------------
   51|      0|      throw Invalid_State("BigInt::sub_rev requires this is positive");
   52|      0|   }
   53|       |
   54|  8.24k|   const size_t x_sw = x.sig_words();
   55|       |
   56|  8.24k|   const size_t max_words = std::max(x_sw, y_sw);
   57|  8.24k|   ws.resize(std::max(x_sw, y_sw));
   58|  8.24k|   clear_mem(ws.data(), ws.size());
   59|  8.24k|   x.grow_to(max_words);
   60|       |
   61|  8.24k|   const int32_t relative_size = bigint_sub_abs(ws.data(), x.data(), x_sw, y, y_sw);
   62|       |
   63|  8.24k|   x.cond_flip_sign((relative_size > 0) && cnd);
  ------------------
  |  Branch (63:21): [True: 0, False: 8.24k]
  |  Branch (63:44): [True: 0, False: 0]
  ------------------
   64|  8.24k|   bigint_cnd_swap(cnd, x.mutable_data(), ws.data(), max_words);
   65|  8.24k|}

_ZN5Botan4EMSA6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   35|  1.39k|std::unique_ptr<EMSA> EMSA::create(std::string_view algo_spec) {
   36|  1.39k|   SCAN_Name req(algo_spec);
   37|       |
   38|  1.39k|#if defined(BOTAN_HAS_EMSA_PKCS1)
   39|  1.39k|   if(req.algo_name() == "EMSA_PKCS1" || req.algo_name() == "PKCS1v15" || req.algo_name() == "EMSA-PKCS1-v1_5" ||
  ------------------
  |  Branch (39:7): [True: 0, False: 1.39k]
  |  Branch (39:7): [True: 1.10k, False: 291]
  |  Branch (39:42): [True: 0, False: 1.39k]
  |  Branch (39:75): [True: 0, False: 1.39k]
  ------------------
   40|  1.39k|      req.algo_name() == "EMSA3") {
  ------------------
  |  Branch (40:7): [True: 1.10k, False: 291]
  ------------------
   41|  1.10k|      if(req.arg_count() == 2 && req.arg(0) == "Raw") {
  ------------------
  |  Branch (41:10): [True: 0, False: 1.10k]
  |  Branch (41:10): [True: 0, False: 1.10k]
  |  Branch (41:34): [True: 0, False: 0]
  ------------------
   42|      0|         return std::make_unique<EMSA_PKCS1v15_Raw>(req.arg(1));
   43|  1.10k|      } else if(req.arg_count() == 1) {
  ------------------
  |  Branch (43:17): [True: 1.10k, False: 0]
  ------------------
   44|  1.10k|         if(req.arg(0) == "Raw") {
  ------------------
  |  Branch (44:13): [True: 0, False: 1.10k]
  ------------------
   45|      0|            return std::make_unique<EMSA_PKCS1v15_Raw>();
   46|  1.10k|         } else {
   47|  1.10k|            if(auto hash = HashFunction::create(req.arg(0))) {
  ------------------
  |  Branch (47:21): [True: 1.10k, False: 0]
  ------------------
   48|  1.10k|               return std::make_unique<EMSA_PKCS1v15>(std::move(hash));
   49|  1.10k|            }
   50|  1.10k|         }
   51|  1.10k|      }
   52|  1.10k|   }
   53|    291|#endif
   54|       |
   55|    291|#if defined(BOTAN_HAS_EMSA_PSSR)
   56|    291|   if(req.algo_name() == "PSS_Raw" || req.algo_name() == "PSSR_Raw") {
  ------------------
  |  Branch (56:7): [True: 0, False: 291]
  |  Branch (56:7): [True: 0, False: 291]
  |  Branch (56:39): [True: 0, False: 291]
  ------------------
   57|      0|      if(req.arg_count_between(1, 3) && req.arg(1, "MGF1") == "MGF1") {
  ------------------
  |  Branch (57:10): [True: 0, False: 0]
  |  Branch (57:10): [True: 0, False: 0]
  |  Branch (57:41): [True: 0, False: 0]
  ------------------
   58|      0|         if(auto hash = HashFunction::create(req.arg(0))) {
  ------------------
  |  Branch (58:18): [True: 0, False: 0]
  ------------------
   59|      0|            if(req.arg_count() == 3) {
  ------------------
  |  Branch (59:16): [True: 0, False: 0]
  ------------------
   60|      0|               const size_t salt_size = req.arg_as_integer(2, 0);
   61|      0|               return std::make_unique<PSSR_Raw>(std::move(hash), salt_size);
   62|      0|            } else {
   63|      0|               return std::make_unique<PSSR_Raw>(std::move(hash));
   64|      0|            }
   65|      0|         }
   66|      0|      }
   67|      0|   }
   68|       |
   69|    291|   if(req.algo_name() == "PSS" || req.algo_name() == "PSSR" || req.algo_name() == "EMSA-PSS" ||
  ------------------
  |  Branch (69:7): [True: 0, False: 291]
  |  Branch (69:7): [True: 0, False: 291]
  |  Branch (69:35): [True: 0, False: 291]
  |  Branch (69:64): [True: 0, False: 291]
  ------------------
   70|    291|      req.algo_name() == "PSS-MGF1" || req.algo_name() == "EMSA4") {
  ------------------
  |  Branch (70:7): [True: 0, False: 291]
  |  Branch (70:40): [True: 0, False: 291]
  ------------------
   71|      0|      if(req.arg_count_between(1, 3) && req.arg(1, "MGF1") == "MGF1") {
  ------------------
  |  Branch (71:10): [True: 0, False: 0]
  |  Branch (71:10): [True: 0, False: 0]
  |  Branch (71:41): [True: 0, False: 0]
  ------------------
   72|      0|         if(auto hash = HashFunction::create(req.arg(0))) {
  ------------------
  |  Branch (72:18): [True: 0, False: 0]
  ------------------
   73|      0|            if(req.arg_count() == 3) {
  ------------------
  |  Branch (73:16): [True: 0, False: 0]
  ------------------
   74|      0|               const size_t salt_size = req.arg_as_integer(2, 0);
   75|      0|               return std::make_unique<PSSR>(std::move(hash), salt_size);
   76|      0|            } else {
   77|      0|               return std::make_unique<PSSR>(std::move(hash));
   78|      0|            }
   79|      0|         }
   80|      0|      }
   81|      0|   }
   82|    291|#endif
   83|       |
   84|    291|#if defined(BOTAN_HAS_ISO_9796)
   85|    291|   if(req.algo_name() == "ISO_9796_DS2") {
  ------------------
  |  Branch (85:7): [True: 0, False: 291]
  ------------------
   86|      0|      if(req.arg_count_between(1, 3)) {
  ------------------
  |  Branch (86:10): [True: 0, False: 0]
  ------------------
   87|      0|         if(auto hash = HashFunction::create(req.arg(0))) {
  ------------------
  |  Branch (87:18): [True: 0, False: 0]
  ------------------
   88|      0|            const size_t salt_size = req.arg_as_integer(2, hash->output_length());
   89|      0|            const bool implicit = req.arg(1, "exp") == "imp";
   90|      0|            return std::make_unique<ISO_9796_DS2>(std::move(hash), implicit, salt_size);
   91|      0|         }
   92|      0|      }
   93|      0|   }
   94|       |   //ISO-9796-2 DS 3 is deterministic and DS2 without a salt
   95|    291|   if(req.algo_name() == "ISO_9796_DS3") {
  ------------------
  |  Branch (95:7): [True: 0, False: 291]
  ------------------
   96|      0|      if(req.arg_count_between(1, 2)) {
  ------------------
  |  Branch (96:10): [True: 0, False: 0]
  ------------------
   97|      0|         if(auto hash = HashFunction::create(req.arg(0))) {
  ------------------
  |  Branch (97:18): [True: 0, False: 0]
  ------------------
   98|      0|            const bool implicit = req.arg(1, "exp") == "imp";
   99|      0|            return std::make_unique<ISO_9796_DS3>(std::move(hash), implicit);
  100|      0|         }
  101|      0|      }
  102|      0|   }
  103|    291|#endif
  104|       |
  105|    291|#if defined(BOTAN_HAS_EMSA_X931)
  106|    291|   if(req.algo_name() == "EMSA_X931" || req.algo_name() == "EMSA2" || req.algo_name() == "X9.31") {
  ------------------
  |  Branch (106:7): [True: 0, False: 291]
  |  Branch (106:7): [True: 0, False: 291]
  |  Branch (106:41): [True: 0, False: 291]
  |  Branch (106:71): [True: 0, False: 291]
  ------------------
  107|      0|      if(req.arg_count() == 1) {
  ------------------
  |  Branch (107:10): [True: 0, False: 0]
  ------------------
  108|      0|         if(auto hash = HashFunction::create(req.arg(0))) {
  ------------------
  |  Branch (108:18): [True: 0, False: 0]
  ------------------
  109|      0|            return std::make_unique<EMSA_X931>(std::move(hash));
  110|      0|         }
  111|      0|      }
  112|      0|   }
  113|    291|#endif
  114|       |
  115|    291|#if defined(BOTAN_HAS_EMSA_RAW)
  116|    291|   if(req.algo_name() == "Raw") {
  ------------------
  |  Branch (116:7): [True: 0, False: 291]
  ------------------
  117|      0|      if(req.arg_count() == 0) {
  ------------------
  |  Branch (117:10): [True: 0, False: 0]
  ------------------
  118|      0|         return std::make_unique<EMSA_Raw>();
  119|      0|      } else {
  120|      0|         auto hash = HashFunction::create(req.arg(0));
  121|      0|         if(hash) {
  ------------------
  |  Branch (121:13): [True: 0, False: 0]
  ------------------
  122|      0|            return std::make_unique<EMSA_Raw>(hash->output_length());
  123|      0|         }
  124|      0|      }
  125|      0|   }
  126|    291|#endif
  127|       |
  128|    291|   return nullptr;
  129|    291|}
_ZN5Botan4EMSA15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  131|  1.39k|std::unique_ptr<EMSA> EMSA::create_or_throw(std::string_view algo_spec) {
  132|  1.39k|   auto emsa = EMSA::create(algo_spec);
  133|  1.39k|   if(emsa) {
  ------------------
  |  Branch (133:7): [True: 1.10k, False: 291]
  ------------------
  134|  1.10k|      return emsa;
  135|  1.10k|   }
  136|    291|   throw Algorithm_Not_Found(algo_spec);
  137|  1.39k|}

_ZN5Botan13EMSA_PKCS1v156updateEPKhm:
   44|  1.10k|void EMSA_PKCS1v15::update(const uint8_t input[], size_t length) { m_hash->update(input, length); }
_ZN5Botan13EMSA_PKCS1v158raw_dataEv:
   46|  1.10k|std::vector<uint8_t> EMSA_PKCS1v15::raw_data() { return m_hash->final_stdvec(); }
_ZN5Botan13EMSA_PKCS1v156verifyERKNSt3__16vectorIhNS1_9allocatorIhEEEES7_m:
   58|  1.07k|bool EMSA_PKCS1v15::verify(const std::vector<uint8_t>& coded, const std::vector<uint8_t>& raw, size_t key_bits) {
   59|  1.07k|   if(raw.size() != m_hash->output_length()) {
  ------------------
  |  Branch (59:7): [True: 0, False: 1.07k]
  ------------------
   60|      0|      return false;
   61|      0|   }
   62|       |
   63|  1.07k|   try {
   64|  1.07k|      return (coded == emsa3_encoding(raw, key_bits, m_hash_id.data(), m_hash_id.size()));
   65|  1.07k|   } catch(...) {
   66|    433|      return false;
   67|    433|   }
   68|  1.07k|}
_ZN5Botan13EMSA_PKCS1v15C2ENSt3__110unique_ptrINS_12HashFunctionENS1_14default_deleteIS3_EEEE:
   70|  1.10k|EMSA_PKCS1v15::EMSA_PKCS1v15(std::unique_ptr<HashFunction> hash) : m_hash(std::move(hash)) {
   71|  1.10k|   m_hash_id = pkcs_hash_id(m_hash->name());
   72|  1.10k|}
emsa_pkcs1.cpp:_ZN5Botan12_GLOBAL__N_114emsa3_encodingERKNSt3__16vectorIhNS1_9allocatorIhEEEEmPKhm:
   20|  1.07k|                                    size_t hash_id_length) {
   21|  1.07k|   size_t output_length = output_bits / 8;
   22|  1.07k|   if(output_length < hash_id_length + msg.size() + 10) {
  ------------------
  |  Branch (22:7): [True: 433, False: 638]
  ------------------
   23|    433|      throw Encoding_Error("emsa3_encoding: Output length is too small");
   24|    433|   }
   25|       |
   26|    638|   std::vector<uint8_t> T(output_length);
   27|    638|   const size_t P_LENGTH = output_length - msg.size() - hash_id_length - 2;
   28|       |
   29|    638|   T[0] = 0x01;
   30|    638|   set_mem(&T[1], P_LENGTH, 0xFF);
   31|    638|   T[P_LENGTH + 1] = 0x00;
   32|       |
   33|    638|   if(hash_id_length > 0) {
  ------------------
  |  Branch (33:7): [True: 638, False: 0]
  ------------------
   34|    638|      BOTAN_ASSERT_NONNULL(hash_id);
  ------------------
  |  |   87|    638|   do {                                                                                   \
  |  |   88|    638|      if((ptr) == nullptr)                                                                \
  |  |  ------------------
  |  |  |  Branch (88:10): [True: 0, False: 638]
  |  |  ------------------
  |  |   89|    638|         Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \
  |  |   90|    638|   } while(0)
  |  |  ------------------
  |  |  |  Branch (90:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   35|    638|      buffer_insert(T, P_LENGTH + 2, hash_id, hash_id_length);
   36|    638|   }
   37|       |
   38|    638|   buffer_insert(T, output_length - msg.size(), msg.data(), msg.size());
   39|    638|   return T;
   40|  1.07k|}

_ZN5Botan12pkcs_hash_idENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE:
   78|  1.10k|std::vector<uint8_t> pkcs_hash_id(std::string_view name) {
   79|       |   // Special case for SSL/TLS RSA signatures
   80|  1.10k|   if(name == "Parallel(MD5,SHA-1)") {
  ------------------
  |  Branch (80:7): [True: 0, False: 1.10k]
  ------------------
   81|      0|      return std::vector<uint8_t>();
   82|      0|   }
   83|       |
   84|       |   // If you add a value to this function, also update test_hash_id.cpp
   85|       |
   86|  1.10k|   if(name == "MD5") {
  ------------------
  |  Branch (86:7): [True: 96, False: 1.00k]
  ------------------
   87|     96|      return std::vector<uint8_t>(MD5_PKCS_ID, MD5_PKCS_ID + sizeof(MD5_PKCS_ID));
   88|     96|   }
   89|       |
   90|  1.00k|   if(name == "RIPEMD-160") {
  ------------------
  |  Branch (90:7): [True: 0, False: 1.00k]
  ------------------
   91|      0|      return std::vector<uint8_t>(RIPEMD_160_PKCS_ID, RIPEMD_160_PKCS_ID + sizeof(RIPEMD_160_PKCS_ID));
   92|      0|   }
   93|       |
   94|  1.00k|   if(name == "SHA-1") {
  ------------------
  |  Branch (94:7): [True: 68, False: 939]
  ------------------
   95|     68|      return std::vector<uint8_t>(SHA_1_PKCS_ID, SHA_1_PKCS_ID + sizeof(SHA_1_PKCS_ID));
   96|     68|   }
   97|       |
   98|    939|   if(name == "SHA-224") {
  ------------------
  |  Branch (98:7): [True: 3, False: 936]
  ------------------
   99|      3|      return std::vector<uint8_t>(SHA_224_PKCS_ID, SHA_224_PKCS_ID + sizeof(SHA_224_PKCS_ID));
  100|      3|   }
  101|       |
  102|    936|   if(name == "SHA-256") {
  ------------------
  |  Branch (102:7): [True: 735, False: 201]
  ------------------
  103|    735|      return std::vector<uint8_t>(SHA_256_PKCS_ID, SHA_256_PKCS_ID + sizeof(SHA_256_PKCS_ID));
  104|    735|   }
  105|       |
  106|    201|   if(name == "SHA-384") {
  ------------------
  |  Branch (106:7): [True: 18, False: 183]
  ------------------
  107|     18|      return std::vector<uint8_t>(SHA_384_PKCS_ID, SHA_384_PKCS_ID + sizeof(SHA_384_PKCS_ID));
  108|     18|   }
  109|       |
  110|    183|   if(name == "SHA-512") {
  ------------------
  |  Branch (110:7): [True: 3, False: 180]
  ------------------
  111|      3|      return std::vector<uint8_t>(SHA_512_PKCS_ID, SHA_512_PKCS_ID + sizeof(SHA_512_PKCS_ID));
  112|      3|   }
  113|       |
  114|    180|   if(name == "SHA-512-256") {
  ------------------
  |  Branch (114:7): [True: 180, False: 0]
  ------------------
  115|    180|      return std::vector<uint8_t>(SHA_512_256_PKCS_ID, SHA_512_256_PKCS_ID + sizeof(SHA_512_256_PKCS_ID));
  116|    180|   }
  117|       |
  118|      0|   if(name == "SHA-3(224)") {
  ------------------
  |  Branch (118:7): [True: 0, False: 0]
  ------------------
  119|      0|      return std::vector<uint8_t>(SHA3_224_PKCS_ID, SHA3_224_PKCS_ID + sizeof(SHA3_224_PKCS_ID));
  120|      0|   }
  121|       |
  122|      0|   if(name == "SHA-3(256)") {
  ------------------
  |  Branch (122:7): [True: 0, False: 0]
  ------------------
  123|      0|      return std::vector<uint8_t>(SHA3_256_PKCS_ID, SHA3_256_PKCS_ID + sizeof(SHA3_256_PKCS_ID));
  124|      0|   }
  125|       |
  126|      0|   if(name == "SHA-3(384)") {
  ------------------
  |  Branch (126:7): [True: 0, False: 0]
  ------------------
  127|      0|      return std::vector<uint8_t>(SHA3_384_PKCS_ID, SHA3_384_PKCS_ID + sizeof(SHA3_384_PKCS_ID));
  128|      0|   }
  129|       |
  130|      0|   if(name == "SHA-3(512)") {
  ------------------
  |  Branch (130:7): [True: 0, False: 0]
  ------------------
  131|      0|      return std::vector<uint8_t>(SHA3_512_PKCS_ID, SHA3_512_PKCS_ID + sizeof(SHA3_512_PKCS_ID));
  132|      0|   }
  133|       |
  134|      0|   if(name == "SM3") {
  ------------------
  |  Branch (134:7): [True: 0, False: 0]
  ------------------
  135|      0|      return std::vector<uint8_t>(SM3_PKCS_ID, SM3_PKCS_ID + sizeof(SM3_PKCS_ID));
  136|      0|   }
  137|       |
  138|      0|   throw Invalid_Argument("No PKCS #1 identifier for " + std::string(name));
  139|      0|}

_ZN5Botan12DH_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE:
   16|      6|DH_PublicKey::DH_PublicKey(const AlgorithmIdentifier& alg_id, std::span<const uint8_t> key_bits) {
   17|      6|   m_public_key = std::make_shared<DL_PublicKey>(alg_id, key_bits, DL_Group_Format::ANSI_X9_42);
   18|      6|}

_ZN5Botan12DL_PublicKeyC2ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEENS_15DL_Group_FormatE:
   44|      6|      m_group(alg_id.parameters(), format), m_public_key(decode_single_bigint(key_bits)) {}

_ZN5Botan8DL_Group19BER_decode_DL_groupEPKhmNS_15DL_Group_FormatENS_15DL_Group_SourceE:
  119|      6|                                                             DL_Group_Source source) {
  120|      6|   BigInt p, q, g;
  121|       |
  122|      6|   BER_Decoder decoder(data, data_len);
  123|      6|   BER_Decoder ber = decoder.start_sequence();
  124|       |
  125|      6|   if(format == DL_Group_Format::ANSI_X9_57) {
  ------------------
  |  Branch (125:7): [True: 0, False: 6]
  ------------------
  126|      0|      ber.decode(p).decode(q).decode(g).verify_end();
  127|      6|   } else if(format == DL_Group_Format::ANSI_X9_42) {
  ------------------
  |  Branch (127:14): [True: 3, False: 3]
  ------------------
  128|      3|      ber.decode(p).decode(g).decode(q).discard_remaining();
  129|      3|   } else if(format == DL_Group_Format::PKCS_3) {
  ------------------
  |  Branch (129:14): [True: 0, False: 3]
  ------------------
  130|       |      // q is left as zero
  131|      0|      ber.decode(p).decode(g).discard_remaining();
  132|      3|   } else {
  133|      3|      throw Invalid_Argument("Unknown DL_Group encoding");
  134|      3|   }
  135|       |
  136|      3|   return std::make_shared<DL_Group_Data>(p, q, g, source);
  137|      6|}
_ZN5Botan8DL_GroupC2EPKhmNS_15DL_Group_FormatE:
  552|      6|DL_Group::DL_Group(const uint8_t ber[], size_t ber_len, DL_Group_Format format) {
  553|      6|   m_data = BER_decode_DL_group(ber, ber_len, format, DL_Group_Source::ExternalSource);
  554|      6|}

_ZN5Botan8CurveGFp11choose_reprERKNS_6BigIntES3_S3_:
  564|      7|std::shared_ptr<CurveGFp_Repr> CurveGFp::choose_repr(const BigInt& p, const BigInt& a, const BigInt& b) {
  565|      7|   if(p == prime_p192()) {
  ------------------
  |  Branch (565:7): [True: 3, False: 4]
  ------------------
  566|      3|      return std::make_shared<CurveGFp_P192>(a, b);
  567|      3|   }
  568|      4|   if(p == prime_p224()) {
  ------------------
  |  Branch (568:7): [True: 0, False: 4]
  ------------------
  569|      0|      return std::make_shared<CurveGFp_P224>(a, b);
  570|      0|   }
  571|      4|   if(p == prime_p256()) {
  ------------------
  |  Branch (571:7): [True: 1, False: 3]
  ------------------
  572|      1|      return std::make_shared<CurveGFp_P256>(a, b);
  573|      1|   }
  574|      3|   if(p == prime_p384()) {
  ------------------
  |  Branch (574:7): [True: 0, False: 3]
  ------------------
  575|      0|      return std::make_shared<CurveGFp_P384>(a, b);
  576|      0|   }
  577|      3|   if(p == prime_p521()) {
  ------------------
  |  Branch (577:7): [True: 0, False: 3]
  ------------------
  578|      0|      return std::make_shared<CurveGFp_P521>(a, b);
  579|      0|   }
  580|       |
  581|      3|   return std::make_shared<CurveGFp_Montgomery>(p, a, b);
  582|      3|}
curve_gfp.cpp:_ZN5Botan12_GLOBAL__N_113CurveGFp_P192C2ERKNS_6BigIntES4_:
  263|      3|      CurveGFp_P192(const BigInt& a, const BigInt& b) : CurveGFp_NIST(192, a, b) {}
curve_gfp.cpp:_ZN5Botan12_GLOBAL__N_113CurveGFp_NISTC2EmRKNS_6BigIntES4_:
  157|      4|            m_1(1), m_a(a), m_b(b), m_p_words((p_bits + BOTAN_MP_WORD_BITS - 1) / BOTAN_MP_WORD_BITS) {
  158|       |         // All Solinas prime curves are assumed a == -3
  159|      4|      }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P1925get_pEv:
  265|  3.43k|      const BigInt& get_p() const override { return prime_p192(); }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST5get_aEv:
  165|  1.16k|      const BigInt& get_a() const override { return m_a; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST5get_bEv:
  167|  1.16k|      const BigInt& get_b() const override { return m_b; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST11get_p_wordsEv:
  171|  43.5k|      size_t get_p_words() const override { return m_p_words; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST11get_ws_sizeEv:
  173|  1.56M|      size_t get_ws_size() const override { return 2 * m_p_words; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST6is_oneERKNS_6BigIntE:
  179|    306|      bool is_one(const BigInt& x) const override { return x == 1; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST9a_is_zeroEv:
  161|  79.7k|      bool a_is_zero() const override { return false; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST12a_is_minus_3Ev:
  163|  79.7k|      bool a_is_minus_3() const override { return true; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST9get_a_repEv:
  175|  1.59k|      const BigInt& get_a_rep() const override { return m_a; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST9get_b_repEv:
  177|  3.13k|      const BigInt& get_b_rep() const override { return m_b; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST9get_1_repEv:
  169|  1.91k|      const BigInt& get_1_rep() const override { return m_1; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST14invert_elementERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  211|     75|BigInt CurveGFp_NIST::invert_element(const BigInt& x, secure_vector<word>& ws) const {
  212|     75|   BOTAN_UNUSED(ws);
  ------------------
  |  |  118|     75|#define BOTAN_UNUSED Botan::ignore_params
  ------------------
  213|     75|   return inverse_mod(x, get_p());
  214|     75|}
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST12to_curve_repERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  181|  1.16k|      void to_curve_rep(BigInt& x, secure_vector<word>& ws) const override { redc_mod_p(x, ws); }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST14from_curve_repERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  183|  5.04k|      void from_curve_rep(BigInt& x, secure_vector<word>& ws) const override { redc_mod_p(x, ws); }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST15curve_mul_wordsERNS_6BigIntEPKmmRKS2_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  217|   774k|   BigInt& z, const word x_w[], size_t x_size, const BigInt& y, secure_vector<word>& ws) const {
  218|   774k|   BOTAN_DEBUG_ASSERT(y.sig_words() <= m_p_words);
  ------------------
  |  |   99|   774k|      do {                          \
  |  |  100|   774k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  219|       |
  220|   774k|   if(ws.size() < get_ws_size()) {
  ------------------
  |  Branch (220:7): [True: 0, False: 774k]
  ------------------
  221|      0|      ws.resize(get_ws_size());
  222|      0|   }
  223|       |
  224|   774k|   const size_t output_size = 2 * m_p_words;
  225|   774k|   if(z.size() < output_size) {
  ------------------
  |  Branch (225:7): [True: 54.5k, False: 719k]
  ------------------
  226|  54.5k|      z.grow_to(output_size);
  227|  54.5k|   }
  228|       |
  229|   774k|   bigint_mul(z.mutable_data(),
  230|   774k|              z.size(),
  231|   774k|              x_w,
  232|   774k|              x_size,
  233|   774k|              std::min(m_p_words, x_size),
  234|   774k|              y.data(),
  235|   774k|              y.size(),
  236|   774k|              std::min(m_p_words, y.size()),
  237|   774k|              ws.data(),
  238|   774k|              ws.size());
  239|       |
  240|   774k|   this->redc_mod_p(z, ws);
  241|   774k|}
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST15curve_sqr_wordsERNS_6BigIntEPKmmRNSt3__16vectorImNS_16secure_allocatorImEEEE:
  243|   665k|void CurveGFp_NIST::curve_sqr_words(BigInt& z, const word x[], size_t x_size, secure_vector<word>& ws) const {
  244|   665k|   if(ws.size() < get_ws_size()) {
  ------------------
  |  Branch (244:7): [True: 1.90k, False: 663k]
  ------------------
  245|  1.90k|      ws.resize(get_ws_size());
  246|  1.90k|   }
  247|       |
  248|   665k|   const size_t output_size = 2 * m_p_words;
  249|   665k|   if(z.size() < output_size) {
  ------------------
  |  Branch (249:7): [True: 90.2k, False: 574k]
  ------------------
  250|  90.2k|      z.grow_to(output_size);
  251|  90.2k|   }
  252|       |
  253|   665k|   bigint_sqr(z.mutable_data(), output_size, x, x_size, std::min(m_p_words, x_size), ws.data(), ws.size());
  254|       |
  255|   665k|   this->redc_mod_p(z, ws);
  256|   665k|}
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P19210redc_mod_pERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  268|  64.0k|      void redc_mod_p(BigInt& x, secure_vector<word>& ws) const override { redc_p192(x, ws); }
curve_gfp.cpp:_ZN5Botan12_GLOBAL__N_113CurveGFp_P256C2ERKNS_6BigIntES4_:
  289|      1|      CurveGFp_P256(const BigInt& a, const BigInt& b) : CurveGFp_NIST(256, a, b) {}
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P2565get_pEv:
  291|   122k|      const BigInt& get_p() const override { return prime_p256(); }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P25614invert_elementERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  299|    746|BigInt CurveGFp_P256::invert_element(const BigInt& x, secure_vector<word>& ws) const {
  300|    746|   BigInt r, p2, p4, p8, p16, p32, tmp;
  301|       |
  302|    746|   curve_sqr(r, x, ws);
  303|       |
  304|    746|   curve_mul(p2, r, x, ws);
  305|    746|   curve_sqr(r, p2, ws);
  306|    746|   curve_sqr_tmp(r, tmp, ws);
  307|       |
  308|    746|   curve_mul(p4, r, p2, ws);
  309|       |
  310|    746|   curve_sqr(r, p4, ws);
  311|  2.98k|   for(size_t i = 0; i != 3; ++i) {
  ------------------
  |  Branch (311:22): [True: 2.23k, False: 746]
  ------------------
  312|  2.23k|      curve_sqr_tmp(r, tmp, ws);
  313|  2.23k|   }
  314|    746|   curve_mul(p8, r, p4, ws);
  315|       |
  316|    746|   curve_sqr(r, p8, ws);
  317|  5.96k|   for(size_t i = 0; i != 7; ++i) {
  ------------------
  |  Branch (317:22): [True: 5.22k, False: 746]
  ------------------
  318|  5.22k|      curve_sqr_tmp(r, tmp, ws);
  319|  5.22k|   }
  320|    746|   curve_mul(p16, r, p8, ws);
  321|       |
  322|    746|   curve_sqr(r, p16, ws);
  323|  11.9k|   for(size_t i = 0; i != 15; ++i) {
  ------------------
  |  Branch (323:22): [True: 11.1k, False: 746]
  ------------------
  324|  11.1k|      curve_sqr_tmp(r, tmp, ws);
  325|  11.1k|   }
  326|    746|   curve_mul(p32, r, p16, ws);
  327|       |
  328|    746|   curve_sqr(r, p32, ws);
  329|  23.8k|   for(size_t i = 0; i != 31; ++i) {
  ------------------
  |  Branch (329:22): [True: 23.1k, False: 746]
  ------------------
  330|  23.1k|      curve_sqr_tmp(r, tmp, ws);
  331|  23.1k|   }
  332|    746|   curve_mul_tmp(r, x, tmp, ws);
  333|       |
  334|  96.2k|   for(size_t i = 0; i != 32 * 4; ++i) {
  ------------------
  |  Branch (334:22): [True: 95.4k, False: 746]
  ------------------
  335|  95.4k|      curve_sqr_tmp(r, tmp, ws);
  336|  95.4k|   }
  337|    746|   curve_mul_tmp(r, p32, tmp, ws);
  338|       |
  339|  24.6k|   for(size_t i = 0; i != 32; ++i) {
  ------------------
  |  Branch (339:22): [True: 23.8k, False: 746]
  ------------------
  340|  23.8k|      curve_sqr_tmp(r, tmp, ws);
  341|  23.8k|   }
  342|    746|   curve_mul_tmp(r, p32, tmp, ws);
  343|       |
  344|  12.6k|   for(size_t i = 0; i != 16; ++i) {
  ------------------
  |  Branch (344:22): [True: 11.9k, False: 746]
  ------------------
  345|  11.9k|      curve_sqr_tmp(r, tmp, ws);
  346|  11.9k|   }
  347|    746|   curve_mul_tmp(r, p16, tmp, ws);
  348|  6.71k|   for(size_t i = 0; i != 8; ++i) {
  ------------------
  |  Branch (348:22): [True: 5.96k, False: 746]
  ------------------
  349|  5.96k|      curve_sqr_tmp(r, tmp, ws);
  350|  5.96k|   }
  351|    746|   curve_mul_tmp(r, p8, tmp, ws);
  352|       |
  353|  3.73k|   for(size_t i = 0; i != 4; ++i) {
  ------------------
  |  Branch (353:22): [True: 2.98k, False: 746]
  ------------------
  354|  2.98k|      curve_sqr_tmp(r, tmp, ws);
  355|  2.98k|   }
  356|    746|   curve_mul_tmp(r, p4, tmp, ws);
  357|       |
  358|  2.23k|   for(size_t i = 0; i != 2; ++i) {
  ------------------
  |  Branch (358:22): [True: 1.49k, False: 746]
  ------------------
  359|  1.49k|      curve_sqr_tmp(r, tmp, ws);
  360|  1.49k|   }
  361|    746|   curve_mul_tmp(r, p2, tmp, ws);
  362|       |
  363|  2.23k|   for(size_t i = 0; i != 2; ++i) {
  ------------------
  |  Branch (363:22): [True: 1.49k, False: 746]
  ------------------
  364|  1.49k|      curve_sqr_tmp(r, tmp, ws);
  365|  1.49k|   }
  366|    746|   curve_mul_tmp(r, x, tmp, ws);
  367|       |
  368|    746|   return r;
  369|    746|}
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST13curve_sqr_tmpERNS_6BigIntES3_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  197|   185k|      void curve_sqr_tmp(BigInt& x, BigInt& tmp, secure_vector<word>& ws) const {
  198|   185k|         curve_sqr(tmp, x, ws);
  199|   185k|         x.swap(tmp);
  200|   185k|      }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST13curve_mul_tmpERNS_6BigIntERKS2_S3_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  192|  5.96k|      void curve_mul_tmp(BigInt& x, const BigInt& y, BigInt& tmp, secure_vector<word>& ws) const {
  193|  5.96k|         curve_mul(tmp, x, y, ws);
  194|  5.96k|         x.swap(tmp);
  195|  5.96k|      }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P25610redc_mod_pERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
  294|  1.38M|      void redc_mod_p(BigInt& x, secure_vector<word>& ws) const override { redc_p256(x, ws); }
curve_gfp.cpp:_ZN5Botan12_GLOBAL__N_119CurveGFp_MontgomeryC2ERKNS_6BigIntES4_S4_:
   24|      3|            m_p(p), m_a(a), m_b(b), m_p_words(m_p.sig_words()), m_p_dash(monty_inverse(m_p.word_at(0))) {
   25|      3|         Modular_Reducer mod_p(m_p);
   26|       |
   27|      3|         m_r.set_bit(m_p_words * BOTAN_MP_WORD_BITS);
  ------------------
  |  |   50|      3|#define BOTAN_MP_WORD_BITS 64
  ------------------
   28|      3|         m_r = mod_p.reduce(m_r);
   29|       |
   30|      3|         m_r2 = mod_p.square(m_r);
   31|      3|         m_r3 = mod_p.multiply(m_r, m_r2);
   32|      3|         m_a_r = mod_p.multiply(m_r, m_a);
   33|      3|         m_b_r = mod_p.multiply(m_r, m_b);
   34|       |
   35|      3|         m_a_is_zero = m_a.is_zero();
   36|      3|         m_a_is_minus_3 = (m_a + 3 == m_p);
   37|      3|      }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery5get_pEv:
   47|  3.26k|      const BigInt& get_p() const override { return m_p; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery5get_aEv:
   43|     96|      const BigInt& get_a() const override { return m_a; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery5get_bEv:
   45|     96|      const BigInt& get_b() const override { return m_b; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery11get_p_wordsEv:
   57|  1.86k|      size_t get_p_words() const override { return m_p_words; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery11get_ws_sizeEv:
   59|  65.8k|      size_t get_ws_size() const override { return 2 * m_p_words; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery9a_is_zeroEv:
   39|  1.15k|      bool a_is_zero() const override { return m_a_is_zero; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery12a_is_minus_3Ev:
   41|  1.15k|      bool a_is_minus_3() const override { return m_a_is_minus_3; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery9get_a_repEv:
   49|    131|      const BigInt& get_a_rep() const override { return m_a_r; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery9get_b_repEv:
   51|    251|      const BigInt& get_b_rep() const override { return m_b_r; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery9get_1_repEv:
   53|    116|      const BigInt& get_1_rep() const override { return m_r; }
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery14invert_elementERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
   86|     42|BigInt CurveGFp_Montgomery::invert_element(const BigInt& x, secure_vector<word>& ws) const {
   87|       |   // Should we use Montgomery inverse instead?
   88|     42|   const BigInt inv = inverse_mod(x, m_p);
   89|     42|   BigInt res;
   90|     42|   curve_mul(res, inv, m_r3, ws);
   91|     42|   return res;
   92|     42|}
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery12to_curve_repERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
   94|    112|void CurveGFp_Montgomery::to_curve_rep(BigInt& x, secure_vector<word>& ws) const {
   95|    112|   const BigInt tx = x;
   96|    112|   curve_mul(x, tx, m_r2, ws);
   97|    112|}
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery14from_curve_repERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE:
   99|    382|void CurveGFp_Montgomery::from_curve_rep(BigInt& z, secure_vector<word>& ws) const {
  100|    382|   if(ws.size() < get_ws_size()) {
  ------------------
  |  Branch (100:7): [True: 0, False: 382]
  ------------------
  101|      0|      ws.resize(get_ws_size());
  102|      0|   }
  103|       |
  104|    382|   const size_t output_size = 2 * m_p_words;
  105|    382|   if(z.size() < output_size) {
  ------------------
  |  Branch (105:7): [True: 0, False: 382]
  ------------------
  106|      0|      z.grow_to(output_size);
  107|      0|   }
  108|       |
  109|    382|   bigint_monty_redc(z.mutable_data(), m_p.data(), m_p_words, m_p_dash, ws.data(), ws.size());
  110|    382|}
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery15curve_mul_wordsERNS_6BigIntEPKmmRKS2_RNSt3__16vectorImNS_16secure_allocatorImEEEE:
  113|  46.3k|   BigInt& z, const word x_w[], size_t x_size, const BigInt& y, secure_vector<word>& ws) const {
  114|  46.3k|   BOTAN_DEBUG_ASSERT(y.sig_words() <= m_p_words);
  ------------------
  |  |   99|  46.3k|      do {                          \
  |  |  100|  46.3k|      } while(0)
  |  |  ------------------
  |  |  |  Branch (100:15): [Folded - Ignored]
  |  |  ------------------
  ------------------
  115|       |
  116|  46.3k|   if(ws.size() < get_ws_size()) {
  ------------------
  |  Branch (116:7): [True: 0, False: 46.3k]
  ------------------
  117|      0|      ws.resize(get_ws_size());
  118|      0|   }
  119|       |
  120|  46.3k|   const size_t output_size = 2 * m_p_words;
  121|  46.3k|   if(z.size() < output_size) {
  ------------------
  |  Branch (121:7): [True: 13.0k, False: 33.2k]
  ------------------
  122|  13.0k|      z.grow_to(output_size);
  123|  13.0k|   }
  124|       |
  125|  46.3k|   bigint_mul(z.mutable_data(),
  126|  46.3k|              z.size(),
  127|  46.3k|              x_w,
  128|  46.3k|              x_size,
  129|  46.3k|              std::min(m_p_words, x_size),
  130|  46.3k|              y.data(),
  131|  46.3k|              y.size(),
  132|  46.3k|              std::min(m_p_words, y.size()),
  133|  46.3k|              ws.data(),
  134|  46.3k|              ws.size());
  135|       |
  136|  46.3k|   bigint_monty_redc(z.mutable_data(), m_p.data(), m_p_words, m_p_dash, ws.data(), ws.size());
  137|  46.3k|}
curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery15curve_sqr_wordsERNS_6BigIntEPKmmRNSt3__16vectorImNS_16secure_allocatorImEEEE:
  139|  15.8k|void CurveGFp_Montgomery::curve_sqr_words(BigInt& z, const word x[], size_t x_size, secure_vector<word>& ws) const {
  140|  15.8k|   if(ws.size() < get_ws_size()) {
  ------------------
  |  Branch (140:7): [True: 131, False: 15.7k]
  ------------------
  141|    131|      ws.resize(get_ws_size());
  142|    131|   }
  143|       |
  144|  15.8k|   const size_t output_size = 2 * m_p_words;
  145|  15.8k|   if(z.size() < output_size) {
  ------------------
  |  Branch (145:7): [True: 1.83k, False: 14.0k]
  ------------------
  146|  1.83k|      z.grow_to(output_size);
  147|  1.83k|   }
  148|       |
  149|  15.8k|   bigint_sqr(z.mutable_data(), z.size(), x, x_size, std::min(m_p_words, x_size), ws.data(), ws.size());
  150|       |
  151|  15.8k|   bigint_monty_redc(z.mutable_data(), m_p.data(), m_p_words, m_p_dash, ws.data(), ws.size());
  152|  15.8k|}

_ZN5Botan8EC_Group13ec_group_dataEv:
  289|  1.29k|EC_Group_Data_Map& EC_Group::ec_group_data() {
  290|       |   /*
  291|       |   * This exists purely to ensure the allocator is constructed before g_ec_data,
  292|       |   * which ensures that its destructor runs after ~g_ec_data is complete.
  293|       |   */
  294|       |
  295|  1.29k|   static Allocator_Initializer g_init_allocator;
  296|  1.29k|   static EC_Group_Data_Map g_ec_data;
  297|  1.29k|   return g_ec_data;
  298|  1.29k|}
_ZN5Botan8EC_Group18load_EC_group_infoEPKcS2_S2_S2_S2_S2_RKNS_3OIDE:
  310|      7|                                                            const OID& oid) {
  311|      7|   const BigInt p(p_str);
  312|      7|   const BigInt a(a_str);
  313|      7|   const BigInt b(b_str);
  314|      7|   const BigInt g_x(g_x_str);
  315|      7|   const BigInt g_y(g_y_str);
  316|      7|   const BigInt order(order_str);
  317|      7|   const BigInt cofactor(1);  // implicit
  318|       |
  319|      7|   return std::make_shared<EC_Group_Data>(p, a, b, g_x, g_y, order, cofactor, oid, EC_Group_Source::Builtin);
  320|      7|}
_ZN5Botan8EC_Group19BER_decode_EC_groupEPKhmNS_15EC_Group_SourceE:
  323|  1.32k|std::shared_ptr<EC_Group_Data> EC_Group::BER_decode_EC_group(const uint8_t bits[], size_t len, EC_Group_Source source) {
  324|  1.32k|   BER_Decoder ber(bits, len);
  325|  1.32k|   BER_Object obj = ber.get_next_object();
  326|       |
  327|  1.32k|   if(obj.type() == ASN1_Type::Null) [[unlikely]] {
  ------------------
  |  Branch (327:7): [True: 3, False: 1.31k]
  ------------------
  328|      3|      throw Decoding_Error("Cannot handle ImplicitCA ECC parameters");
  329|  1.31k|   } else if(obj.type() == ASN1_Type::ObjectId) {
  ------------------
  |  Branch (329:14): [True: 1.29k, False: 23]
  ------------------
  330|  1.29k|      OID dom_par_oid;
  331|  1.29k|      BER_Decoder(bits, len).decode(dom_par_oid);
  332|  1.29k|      return ec_group_data().lookup(dom_par_oid);
  333|  1.29k|   } else if(obj.type() == ASN1_Type::Sequence) {
  ------------------
  |  Branch (333:14): [True: 7, False: 16]
  ------------------
  334|      7|      BigInt p, a, b, order, cofactor;
  335|      7|      std::vector<uint8_t> base_pt;
  336|      7|      std::vector<uint8_t> seed;
  337|       |
  338|      7|      BER_Decoder(bits, len)
  339|      7|         .start_sequence()
  340|      7|         .decode_and_check<size_t>(1, "Unknown ECC param version code")
  341|      7|         .start_sequence()
  342|      7|         .decode_and_check(OID("1.2.840.10045.1.1"), "Only prime ECC fields supported")
  343|      7|         .decode(p)
  344|      7|         .end_cons()
  345|      7|         .start_sequence()
  346|      7|         .decode_octet_string_bigint(a)
  347|      7|         .decode_octet_string_bigint(b)
  348|      7|         .decode_optional_string(seed, ASN1_Type::BitString, ASN1_Type::BitString)
  349|      7|         .end_cons()
  350|      7|         .decode(base_pt, ASN1_Type::OctetString)
  351|      7|         .decode(order)
  352|      7|         .decode(cofactor)
  353|      7|         .end_cons()
  354|      7|         .verify_end();
  355|       |
  356|      7|      if(p.bits() < 64 || p.is_negative() || !is_bailie_psw_probable_prime(p)) {
  ------------------
  |  Branch (356:10): [True: 7, False: 0]
  |  Branch (356:27): [True: 0, False: 0]
  |  Branch (356:46): [True: 0, False: 0]
  ------------------
  357|      0|         throw Decoding_Error("Invalid ECC p parameter");
  358|      0|      }
  359|       |
  360|      7|      if(a.is_negative() || a >= p) {
  ------------------
  |  Branch (360:10): [True: 7, False: 0]
  |  Branch (360:29): [True: 0, False: 0]
  ------------------
  361|      0|         throw Decoding_Error("Invalid ECC a parameter");
  362|      0|      }
  363|       |
  364|      7|      if(b <= 0 || b >= p) {
  ------------------
  |  Branch (364:10): [True: 7, False: 0]
  |  Branch (364:20): [True: 0, False: 0]
  ------------------
  365|      0|         throw Decoding_Error("Invalid ECC b parameter");
  366|      0|      }
  367|       |
  368|      7|      if(order <= 0 || !is_bailie_psw_probable_prime(order)) {
  ------------------
  |  Branch (368:10): [True: 7, False: 0]
  |  Branch (368:24): [True: 0, False: 0]
  ------------------
  369|      0|         throw Decoding_Error("Invalid ECC order parameter");
  370|      0|      }
  371|       |
  372|      7|      if(cofactor <= 0 || cofactor >= 16) {
  ------------------
  |  Branch (372:10): [True: 7, False: 0]
  |  Branch (372:27): [True: 0, False: 0]
  ------------------
  373|      0|         throw Decoding_Error("Invalid ECC cofactor parameter");
  374|      0|      }
  375|       |
  376|      7|      std::pair<BigInt, BigInt> base_xy = Botan::OS2ECP(base_pt.data(), base_pt.size(), p, a, b);
  377|       |
  378|      7|      return ec_group_data().lookup_or_create(p, a, b, base_xy.first, base_xy.second, order, cofactor, OID(), source);
  379|     16|   } else {
  380|     16|      throw Decoding_Error("Unexpected tag while decoding ECC domain params");
  381|     16|   }
  382|  1.32k|}
_ZN5Botan8EC_GroupD2Ev:
  386|  1.84k|EC_Group::~EC_Group() = default;
_ZN5Botan8EC_GroupC2EPKhm:
  438|  1.32k|EC_Group::EC_Group(const uint8_t ber[], size_t ber_len) {
  439|  1.32k|   m_data = BER_decode_EC_group(ber, ber_len, EC_Group_Source::ExternalSource);
  440|  1.32k|}
_ZNK5Botan8EC_Group4dataEv:
  442|  5.91k|const EC_Group_Data& EC_Group::data() const {
  443|  5.91k|   if(m_data == nullptr) {
  ------------------
  |  Branch (443:7): [True: 28, False: 5.88k]
  ------------------
  444|     28|      throw Invalid_State("EC_Group uninitialized");
  445|     28|   }
  446|  5.88k|   return *m_data;
  447|  5.91k|}
_ZNK5Botan8EC_Group14get_order_bitsEv:
  457|    309|size_t EC_Group::get_order_bits() const { return data().order_bits(); }
_ZNK5Botan8EC_Group15get_order_bytesEv:
  459|    503|size_t EC_Group::get_order_bytes() const { return data().order_bytes(); }
_ZNK5Botan8EC_Group14get_base_pointEv:
  467|    550|const EC_Point& EC_Group::get_base_point() const { return data().base_point(); }
_ZNK5Botan8EC_Group9get_orderEv:
  469|  1.16k|const BigInt& EC_Group::get_order() const { return data().order(); }
_ZNK5Botan8EC_Group9mod_orderERKNS_6BigIntE:
  477|    612|BigInt EC_Group::mod_order(const BigInt& k) const { return data().mod_order(k); }
_ZNK5Botan8EC_Group18multiply_mod_orderERKNS_6BigIntES3_:
  481|    612|BigInt EC_Group::multiply_mod_order(const BigInt& x, const BigInt& y) const { return data().multiply_mod_order(x, y); }
_ZNK5Botan8EC_Group17inverse_mod_orderERKNS_6BigIntE:
  487|    306|BigInt EC_Group::inverse_mod_order(const BigInt& x) const { return data().inverse_mod_order(x); }
_ZNK5Botan8EC_Group13get_curve_oidEv:
  489|    560|const OID& EC_Group::get_curve_oid() const { return data().oid(); }
_ZNK5Botan8EC_Group6OS2ECPEPKhm:
  502|  1.29k|EC_Point EC_Group::OS2ECP(const uint8_t bits[], size_t len) const { return Botan::OS2ECP(bits, len, data().curve()); }
_ZN5Botan17EC_Group_Data_MapC2Ev:
  147|      1|      EC_Group_Data_Map() = default;
_ZN5Botan17EC_Group_Data_Map6lookupERKNS_3OIDE:
  156|  1.29k|      std::shared_ptr<EC_Group_Data> lookup(const OID& oid) {
  157|  1.29k|         lock_guard_type<mutex_type> lock(m_mutex);
  158|       |
  159|  1.90k|         for(auto i : m_registered_curves) {
  ------------------
  |  Branch (159:21): [True: 1.90k, False: 35]
  ------------------
  160|  1.90k|            if(i->oid() == oid) {
  ------------------
  |  Branch (160:16): [True: 1.25k, False: 650]
  ------------------
  161|  1.25k|               return i;
  162|  1.25k|            }
  163|  1.90k|         }
  164|       |
  165|       |         // Not found, check hardcoded data
  166|     35|         std::shared_ptr<EC_Group_Data> data = EC_Group::EC_group_info(oid);
  167|       |
  168|     35|         if(data) {
  ------------------
  |  Branch (168:13): [True: 7, False: 28]
  ------------------
  169|     21|            for(auto curve : m_registered_curves) {
  ------------------
  |  Branch (169:28): [True: 21, False: 7]
  ------------------
  170|     21|               if(curve->oid().empty() == true && curve->params_match(*data)) {
  ------------------
  |  Branch (170:19): [True: 0, False: 21]
  |  Branch (170:51): [True: 0, False: 0]
  ------------------
  171|      0|                  curve->set_oid(oid);
  172|      0|                  return curve;
  173|      0|               }
  174|     21|            }
  175|       |
  176|      7|            m_registered_curves.push_back(data);
  177|      7|            return data;
  178|      7|         }
  179|       |
  180|       |         // Nope, unknown curve
  181|     28|         return std::shared_ptr<EC_Group_Data>();
  182|     35|      }
_ZN5Botan13EC_Group_DataC2ERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceE:
   54|      7|            m_source(source) {}
_ZNK5Botan13EC_Group_Data10order_bitsEv:
   97|    309|      size_t order_bits() const { return m_order_bits; }
_ZNK5Botan13EC_Group_Data11order_bytesEv:
   99|    503|      size_t order_bytes() const { return (m_order_bits + 7) / 8; }
_ZNK5Botan13EC_Group_Data10base_pointEv:
  103|    550|      const EC_Point& base_point() const { return m_base_point; }
_ZNK5Botan13EC_Group_Data5orderEv:
   85|  1.16k|      const BigInt& order() const { return m_order; }
_ZNK5Botan13EC_Group_Data9mod_orderERKNS_6BigIntE:
  109|    612|      BigInt mod_order(const BigInt& x) const { return m_mod_order.reduce(x); }
_ZNK5Botan13EC_Group_Data18multiply_mod_orderERKNS_6BigIntES3_:
  113|    612|      BigInt multiply_mod_order(const BigInt& x, const BigInt& y) const { return m_mod_order.multiply(x, y); }
_ZNK5Botan13EC_Group_Data17inverse_mod_orderERKNS_6BigIntE:
  119|    306|      BigInt inverse_mod_order(const BigInt& x) const { return inverse_mod(x, m_order); }
_ZNK5Botan13EC_Group_Data3oidEv:
   77|  2.48k|      const OID& oid() const { return m_oid; }
_ZNK5Botan13EC_Group_Data5curveEv:
  101|  1.26k|      const CurveGFp& curve() const { return m_curve; }

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

_ZN5Botan8EC_PointC2ERKNS_8CurveGFpE:
   18|    306|EC_Point::EC_Point(const CurveGFp& curve) : m_curve(curve), m_coord_x(0), m_coord_y(curve.get_1_rep()), m_coord_z(0) {
   19|       |   // Assumes Montgomery rep of zero is zero
   20|    306|}
_ZN5Botan8EC_PointC2ERKNS_8CurveGFpERKNS_6BigIntES6_:
   23|    862|      m_curve(curve), m_coord_x(x), m_coord_y(y), m_coord_z(m_curve.get_1_rep()) {
   24|    862|   if(x < 0 || x >= curve.get_p()) {
  ------------------
  |  Branch (24:7): [True: 0, False: 862]
  |  Branch (24:16): [True: 221, False: 641]
  ------------------
   25|    221|      throw Invalid_Argument("Invalid EC_Point affine x");
   26|    221|   }
   27|    641|   if(y < 0 || y >= curve.get_p()) {
  ------------------
  |  Branch (27:7): [True: 0, False: 641]
  |  Branch (27:16): [True: 4, False: 637]
  ------------------
   28|      4|      throw Invalid_Argument("Invalid EC_Point affine y");
   29|      4|   }
   30|       |
   31|    637|   secure_vector<word> monty_ws(m_curve.get_ws_size());
   32|    637|   m_curve.to_rep(m_coord_x, monty_ws);
   33|    637|   m_curve.to_rep(m_coord_y, monty_ws);
   34|    637|}
_ZN5Botan8EC_Point10add_affineEPKmmS2_mRNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE:
   74|  36.2k|   const word x_words[], size_t x_size, const word y_words[], size_t y_size, std::vector<BigInt>& ws_bn) {
   75|  36.2k|   if((CT::all_zeros(x_words, x_size) & CT::all_zeros(y_words, y_size)).is_set()) {
  ------------------
  |  Branch (75:7): [True: 0, False: 36.2k]
  ------------------
   76|      0|      return;
   77|      0|   }
   78|       |
   79|  36.2k|   if(is_zero()) {
  ------------------
  |  Branch (79:7): [True: 306, False: 35.9k]
  ------------------
   80|    306|      m_coord_x.set_words(x_words, x_size);
   81|    306|      m_coord_y.set_words(y_words, y_size);
   82|    306|      m_coord_z = m_curve.get_1_rep();
   83|    306|      return;
   84|    306|   }
   85|       |
   86|  35.9k|   resize_ws(ws_bn, m_curve.get_ws_size());
   87|       |
   88|  35.9k|   secure_vector<word>& ws = ws_bn[0].get_word_vector();
   89|  35.9k|   secure_vector<word>& sub_ws = ws_bn[1].get_word_vector();
   90|       |
   91|  35.9k|   BigInt& T0 = ws_bn[2];
   92|  35.9k|   BigInt& T1 = ws_bn[3];
   93|  35.9k|   BigInt& T2 = ws_bn[4];
   94|  35.9k|   BigInt& T3 = ws_bn[5];
   95|  35.9k|   BigInt& T4 = ws_bn[6];
   96|       |
   97|       |   /*
   98|       |   https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addition-add-1998-cmo-2
   99|       |   simplified with Z2 = 1
  100|       |   */
  101|       |
  102|  35.9k|   const BigInt& p = m_curve.get_p();
  103|       |
  104|  35.9k|   m_curve.sqr(T3, m_coord_z, ws);            // z1^2
  105|  35.9k|   m_curve.mul(T4, x_words, x_size, T3, ws);  // x2*z1^2
  106|       |
  107|  35.9k|   m_curve.mul(T2, m_coord_z, T3, ws);        // z1^3
  108|  35.9k|   m_curve.mul(T0, y_words, y_size, T2, ws);  // y2*z1^3
  109|       |
  110|  35.9k|   T4.mod_sub(m_coord_x, p, sub_ws);  // x2*z1^2 - x1*z2^2
  111|       |
  112|  35.9k|   T0.mod_sub(m_coord_y, p, sub_ws);
  113|       |
  114|  35.9k|   if(T4.is_zero()) {
  ------------------
  |  Branch (114:7): [True: 0, False: 35.9k]
  ------------------
  115|      0|      if(T0.is_zero()) {
  ------------------
  |  Branch (115:10): [True: 0, False: 0]
  ------------------
  116|      0|         mult2(ws_bn);
  117|      0|         return;
  118|      0|      }
  119|       |
  120|       |      // setting to zero:
  121|      0|      m_coord_x.clear();
  122|      0|      m_coord_y = m_curve.get_1_rep();
  123|      0|      m_coord_z.clear();
  124|      0|      return;
  125|      0|   }
  126|       |
  127|  35.9k|   m_curve.sqr(T2, T4, ws);
  128|       |
  129|  35.9k|   m_curve.mul(T3, m_coord_x, T2, ws);
  130|       |
  131|  35.9k|   m_curve.mul(T1, T2, T4, ws);
  132|       |
  133|  35.9k|   m_curve.sqr(m_coord_x, T0, ws);
  134|  35.9k|   m_coord_x.mod_sub(T1, p, sub_ws);
  135|       |
  136|  35.9k|   m_coord_x.mod_sub(T3, p, sub_ws);
  137|  35.9k|   m_coord_x.mod_sub(T3, p, sub_ws);
  138|       |
  139|  35.9k|   T3.mod_sub(m_coord_x, p, sub_ws);
  140|       |
  141|  35.9k|   m_curve.mul(T2, T0, T3, ws);
  142|  35.9k|   m_curve.mul(T0, m_coord_y, T1, ws);
  143|  35.9k|   T2.mod_sub(T0, p, sub_ws);
  144|  35.9k|   m_coord_y.swap(T2);
  145|       |
  146|  35.9k|   m_curve.mul(T0, m_coord_z, T4, ws);
  147|  35.9k|   m_coord_z.swap(T0);
  148|  35.9k|}
_ZN5Botan8EC_Point3addEPKmmS2_mS2_mRNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE:
  156|  9.17k|                   std::vector<BigInt>& ws_bn) {
  157|  9.17k|   if((CT::all_zeros(x_words, x_size) & CT::all_zeros(z_words, z_size)).is_set()) {
  ------------------
  |  Branch (157:7): [True: 0, False: 9.17k]
  ------------------
  158|      0|      return;
  159|      0|   }
  160|       |
  161|  9.17k|   if(is_zero()) {
  ------------------
  |  Branch (161:7): [True: 0, False: 9.17k]
  ------------------
  162|      0|      m_coord_x.set_words(x_words, x_size);
  163|      0|      m_coord_y.set_words(y_words, y_size);
  164|      0|      m_coord_z.set_words(z_words, z_size);
  165|      0|      return;
  166|      0|   }
  167|       |
  168|  9.17k|   resize_ws(ws_bn, m_curve.get_ws_size());
  169|       |
  170|  9.17k|   secure_vector<word>& ws = ws_bn[0].get_word_vector();
  171|  9.17k|   secure_vector<word>& sub_ws = ws_bn[1].get_word_vector();
  172|       |
  173|  9.17k|   BigInt& T0 = ws_bn[2];
  174|  9.17k|   BigInt& T1 = ws_bn[3];
  175|  9.17k|   BigInt& T2 = ws_bn[4];
  176|  9.17k|   BigInt& T3 = ws_bn[5];
  177|  9.17k|   BigInt& T4 = ws_bn[6];
  178|  9.17k|   BigInt& T5 = ws_bn[7];
  179|       |
  180|       |   /*
  181|       |   https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addition-add-1998-cmo-2
  182|       |   */
  183|       |
  184|  9.17k|   const BigInt& p = m_curve.get_p();
  185|       |
  186|  9.17k|   m_curve.sqr(T0, z_words, z_size, ws);      // z2^2
  187|  9.17k|   m_curve.mul(T1, m_coord_x, T0, ws);        // x1*z2^2
  188|  9.17k|   m_curve.mul(T3, z_words, z_size, T0, ws);  // z2^3
  189|  9.17k|   m_curve.mul(T2, m_coord_y, T3, ws);        // y1*z2^3
  190|       |
  191|  9.17k|   m_curve.sqr(T3, m_coord_z, ws);            // z1^2
  192|  9.17k|   m_curve.mul(T4, x_words, x_size, T3, ws);  // x2*z1^2
  193|       |
  194|  9.17k|   m_curve.mul(T5, m_coord_z, T3, ws);        // z1^3
  195|  9.17k|   m_curve.mul(T0, y_words, y_size, T5, ws);  // y2*z1^3
  196|       |
  197|  9.17k|   T4.mod_sub(T1, p, sub_ws);  // x2*z1^2 - x1*z2^2
  198|       |
  199|  9.17k|   T0.mod_sub(T2, p, sub_ws);
  200|       |
  201|  9.17k|   if(T4.is_zero()) {
  ------------------
  |  Branch (201:7): [True: 0, False: 9.17k]
  ------------------
  202|      0|      if(T0.is_zero()) {
  ------------------
  |  Branch (202:10): [True: 0, False: 0]
  ------------------
  203|      0|         mult2(ws_bn);
  204|      0|         return;
  205|      0|      }
  206|       |
  207|       |      // setting to zero:
  208|      0|      m_coord_x.clear();
  209|      0|      m_coord_y = m_curve.get_1_rep();
  210|      0|      m_coord_z.clear();
  211|      0|      return;
  212|      0|   }
  213|       |
  214|  9.17k|   m_curve.sqr(T5, T4, ws);
  215|       |
  216|  9.17k|   m_curve.mul(T3, T1, T5, ws);
  217|       |
  218|  9.17k|   m_curve.mul(T1, T5, T4, ws);
  219|       |
  220|  9.17k|   m_curve.sqr(m_coord_x, T0, ws);
  221|  9.17k|   m_coord_x.mod_sub(T1, p, sub_ws);
  222|  9.17k|   m_coord_x.mod_sub(T3, p, sub_ws);
  223|  9.17k|   m_coord_x.mod_sub(T3, p, sub_ws);
  224|       |
  225|  9.17k|   T3.mod_sub(m_coord_x, p, sub_ws);
  226|       |
  227|  9.17k|   m_curve.mul(m_coord_y, T0, T3, ws);
  228|  9.17k|   m_curve.mul(T3, T2, T1, ws);
  229|       |
  230|  9.17k|   m_coord_y.mod_sub(T3, p, sub_ws);
  231|       |
  232|  9.17k|   m_curve.mul(T3, z_words, z_size, m_coord_z, ws);
  233|  9.17k|   m_curve.mul(m_coord_z, T3, T4, ws);
  234|  9.17k|}
_ZN5Botan8EC_Point6mult2iEmRNSt3__16vectorINS_6BigIntENS1_9allocatorIS3_EEEE:
  236|  38.7k|void EC_Point::mult2i(size_t iterations, std::vector<BigInt>& ws_bn) {
  237|  38.7k|   if(iterations == 0) {
  ------------------
  |  Branch (237:7): [True: 0, False: 38.7k]
  ------------------
  238|      0|      return;
  239|      0|   }
  240|       |
  241|  38.7k|   if(m_coord_y.is_zero()) {
  ------------------
  |  Branch (241:7): [True: 0, False: 38.7k]
  ------------------
  242|      0|      *this = EC_Point(m_curve);  // setting myself to zero
  243|      0|      return;
  244|      0|   }
  245|       |
  246|       |   /*
  247|       |   TODO we can save 2 squarings per iteration by computing
  248|       |   a*Z^4 using values cached from previous iteration
  249|       |   */
  250|   116k|   for(size_t i = 0; i != iterations; ++i) {
  ------------------
  |  Branch (250:22): [True: 77.4k, False: 38.7k]
  ------------------
  251|  77.4k|      mult2(ws_bn);
  252|  77.4k|   }
  253|  38.7k|}
_ZN5Botan8EC_Point5mult2ERNSt3__16vectorINS_6BigIntENS1_9allocatorIS3_EEEE:
  256|  80.8k|void EC_Point::mult2(std::vector<BigInt>& ws_bn) {
  257|  80.8k|   if(is_zero()) {
  ------------------
  |  Branch (257:7): [True: 0, False: 80.8k]
  ------------------
  258|      0|      return;
  259|      0|   }
  260|       |
  261|  80.8k|   if(m_coord_y.is_zero()) {
  ------------------
  |  Branch (261:7): [True: 0, False: 80.8k]
  ------------------
  262|      0|      *this = EC_Point(m_curve);  // setting myself to zero
  263|      0|      return;
  264|      0|   }
  265|       |
  266|  80.8k|   resize_ws(ws_bn, m_curve.get_ws_size());
  267|       |
  268|  80.8k|   secure_vector<word>& ws = ws_bn[0].get_word_vector();
  269|  80.8k|   secure_vector<word>& sub_ws = ws_bn[1].get_word_vector();
  270|       |
  271|  80.8k|   BigInt& T0 = ws_bn[2];
  272|  80.8k|   BigInt& T1 = ws_bn[3];
  273|  80.8k|   BigInt& T2 = ws_bn[4];
  274|  80.8k|   BigInt& T3 = ws_bn[5];
  275|  80.8k|   BigInt& T4 = ws_bn[6];
  276|       |
  277|       |   /*
  278|       |   https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-1986-cc
  279|       |   */
  280|  80.8k|   const BigInt& p = m_curve.get_p();
  281|       |
  282|  80.8k|   m_curve.sqr(T0, m_coord_y, ws);
  283|       |
  284|  80.8k|   m_curve.mul(T1, m_coord_x, T0, ws);
  285|  80.8k|   T1.mod_mul(4, p, sub_ws);
  286|       |
  287|  80.8k|   if(m_curve.a_is_zero()) {
  ------------------
  |  Branch (287:7): [True: 0, False: 80.8k]
  ------------------
  288|       |      // if a == 0 then 3*x^2 + a*z^4 is just 3*x^2
  289|      0|      m_curve.sqr(T4, m_coord_x, ws);  // x^2
  290|      0|      T4.mod_mul(3, p, sub_ws);        // 3*x^2
  291|  80.8k|   } else if(m_curve.a_is_minus_3()) {
  ------------------
  |  Branch (291:14): [True: 80.8k, False: 0]
  ------------------
  292|       |      /*
  293|       |      if a == -3 then
  294|       |        3*x^2 + a*z^4 == 3*x^2 - 3*z^4 == 3*(x^2-z^4) == 3*(x-z^2)*(x+z^2)
  295|       |      */
  296|  80.8k|      m_curve.sqr(T3, m_coord_z, ws);  // z^2
  297|       |
  298|       |      // (x-z^2)
  299|  80.8k|      T2 = m_coord_x;
  300|  80.8k|      T2.mod_sub(T3, p, sub_ws);
  301|       |
  302|       |      // (x+z^2)
  303|  80.8k|      T3.mod_add(m_coord_x, p, sub_ws);
  304|       |
  305|  80.8k|      m_curve.mul(T4, T2, T3, ws);  // (x-z^2)*(x+z^2)
  306|       |
  307|  80.8k|      T4.mod_mul(3, p, sub_ws);  // 3*(x-z^2)*(x+z^2)
  308|  80.8k|   } else {
  309|      0|      m_curve.sqr(T3, m_coord_z, ws);                // z^2
  310|      0|      m_curve.sqr(T4, T3, ws);                       // z^4
  311|      0|      m_curve.mul(T3, m_curve.get_a_rep(), T4, ws);  // a*z^4
  312|       |
  313|      0|      m_curve.sqr(T4, m_coord_x, ws);  // x^2
  314|      0|      T4.mod_mul(3, p, sub_ws);
  315|      0|      T4.mod_add(T3, p, sub_ws);  // 3*x^2 + a*z^4
  316|      0|   }
  317|       |
  318|  80.8k|   m_curve.sqr(T2, T4, ws);
  319|  80.8k|   T2.mod_sub(T1, p, sub_ws);
  320|  80.8k|   T2.mod_sub(T1, p, sub_ws);
  321|       |
  322|  80.8k|   m_curve.sqr(T3, T0, ws);
  323|  80.8k|   T3.mod_mul(8, p, sub_ws);
  324|       |
  325|  80.8k|   T1.mod_sub(T2, p, sub_ws);
  326|       |
  327|  80.8k|   m_curve.mul(T0, T4, T1, ws);
  328|  80.8k|   T0.mod_sub(T3, p, sub_ws);
  329|       |
  330|  80.8k|   m_coord_x.swap(T2);
  331|       |
  332|  80.8k|   m_curve.mul(T2, m_coord_y, m_coord_z, ws);
  333|  80.8k|   T2.mod_mul(2, p, sub_ws);
  334|       |
  335|  80.8k|   m_coord_y.swap(T0);
  336|  80.8k|   m_coord_z.swap(T2);
  337|  80.8k|}
_ZN5Botan8EC_Point16force_all_affineERNSt3__16vectorIS0_NS1_9allocatorIS0_EEEERNS2_ImNS_16secure_allocatorImEEEE:
  388|    557|void EC_Point::force_all_affine(std::vector<EC_Point>& points, secure_vector<word>& ws) {
  389|    557|   if(points.size() <= 1) {
  ------------------
  |  Branch (389:7): [True: 0, False: 557]
  ------------------
  390|      0|      for(auto& point : points) {
  ------------------
  |  Branch (390:23): [True: 0, False: 0]
  ------------------
  391|      0|         point.force_affine();
  392|      0|      }
  393|      0|      return;
  394|      0|   }
  395|       |
  396|  13.7k|   for(auto& point : points) {
  ------------------
  |  Branch (396:20): [True: 13.7k, False: 557]
  ------------------
  397|  13.7k|      if(point.is_zero()) {
  ------------------
  |  Branch (397:10): [True: 0, False: 13.7k]
  ------------------
  398|      0|         throw Invalid_State("Cannot convert zero ECC point to affine");
  399|      0|      }
  400|  13.7k|   }
  401|       |
  402|       |   /*
  403|       |   For >= 2 points use Montgomery's trick
  404|       |
  405|       |   See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography"
  406|       |   (Hankerson, Menezes, Vanstone)
  407|       |
  408|       |   TODO is it really necessary to save all k points in c?
  409|       |   */
  410|       |
  411|    557|   const CurveGFp& curve = points[0].m_curve;
  412|    557|   const BigInt& rep_1 = curve.get_1_rep();
  413|       |
  414|    557|   if(ws.size() < curve.get_ws_size()) {
  ------------------
  |  Branch (414:7): [True: 0, False: 557]
  ------------------
  415|      0|      ws.resize(curve.get_ws_size());
  416|      0|   }
  417|       |
  418|    557|   std::vector<BigInt> c(points.size());
  419|    557|   c[0] = points[0].m_coord_z;
  420|       |
  421|  13.7k|   for(size_t i = 1; i != points.size(); ++i) {
  ------------------
  |  Branch (421:22): [True: 13.1k, False: 557]
  ------------------
  422|  13.1k|      curve.mul(c[i], c[i - 1], points[i].m_coord_z, ws);
  423|  13.1k|   }
  424|       |
  425|    557|   BigInt s_inv = curve.invert_element(c[c.size() - 1], ws);
  426|       |
  427|    557|   BigInt z_inv, z2_inv, z3_inv;
  428|       |
  429|  13.7k|   for(size_t i = points.size() - 1; i != 0; i--) {
  ------------------
  |  Branch (429:38): [True: 13.1k, False: 557]
  ------------------
  430|  13.1k|      EC_Point& point = points[i];
  431|       |
  432|  13.1k|      curve.mul(z_inv, s_inv, c[i - 1], ws);
  433|       |
  434|  13.1k|      s_inv = curve.mul_to_tmp(s_inv, point.m_coord_z, ws);
  435|       |
  436|  13.1k|      curve.sqr(z2_inv, z_inv, ws);
  437|  13.1k|      curve.mul(z3_inv, z2_inv, z_inv, ws);
  438|  13.1k|      point.m_coord_x = curve.mul_to_tmp(point.m_coord_x, z2_inv, ws);
  439|  13.1k|      point.m_coord_y = curve.mul_to_tmp(point.m_coord_y, z3_inv, ws);
  440|  13.1k|      point.m_coord_z = rep_1;
  441|  13.1k|   }
  442|       |
  443|    557|   curve.sqr(z2_inv, s_inv, ws);
  444|    557|   curve.mul(z3_inv, z2_inv, s_inv, ws);
  445|    557|   points[0].m_coord_x = curve.mul_to_tmp(points[0].m_coord_x, z2_inv, ws);
  446|    557|   points[0].m_coord_y = curve.mul_to_tmp(points[0].m_coord_y, z3_inv, ws);
  447|    557|   points[0].m_coord_z = rep_1;
  448|    557|}
_ZNK5Botan8EC_Point9is_affineEv:
  465|    306|bool EC_Point::is_affine() const { return m_curve.is_one(m_coord_z); }
_ZNK5Botan8EC_Point12get_affine_xEv:
  467|    306|BigInt EC_Point::get_affine_x() const {
  468|    306|   if(is_zero()) {
  ------------------
  |  Branch (468:7): [True: 0, False: 306]
  ------------------
  469|      0|      throw Invalid_State("Cannot convert zero point to affine");
  470|      0|   }
  471|       |
  472|    306|   secure_vector<word> monty_ws;
  473|       |
  474|    306|   if(is_affine()) {
  ------------------
  |  Branch (474:7): [True: 0, False: 306]
  ------------------
  475|      0|      return m_curve.from_rep_to_tmp(m_coord_x, monty_ws);
  476|      0|   }
  477|       |
  478|    306|   BigInt z2 = m_curve.sqr_to_tmp(m_coord_z, monty_ws);
  479|    306|   z2 = m_curve.invert_element(z2, monty_ws);
  480|       |
  481|    306|   BigInt r;
  482|    306|   m_curve.mul(r, m_coord_x, z2, monty_ws);
  483|    306|   m_curve.from_rep(r, monty_ws);
  484|    306|   return r;
  485|    306|}
_ZNK5Botan8EC_Point12on_the_curveEv:
  508|  1.73k|bool EC_Point::on_the_curve() const {
  509|       |   /*
  510|       |   Is the point still on the curve?? (If everything is correct, the
  511|       |   point is always on its curve; then the function will return true.
  512|       |   If somehow the state is corrupted, which suggests a fault attack
  513|       |   (or internal computational error), then return false.
  514|       |   */
  515|  1.73k|   if(is_zero()) {
  ------------------
  |  Branch (515:7): [True: 0, False: 1.73k]
  ------------------
  516|      0|      return true;
  517|      0|   }
  518|       |
  519|  1.73k|   secure_vector<word> monty_ws;
  520|       |
  521|  1.73k|   const BigInt y2 = m_curve.from_rep_to_tmp(m_curve.sqr_to_tmp(m_coord_y, monty_ws), monty_ws);
  522|  1.73k|   const BigInt x3 = m_curve.mul_to_tmp(m_coord_x, m_curve.sqr_to_tmp(m_coord_x, monty_ws), monty_ws);
  523|  1.73k|   const BigInt ax = m_curve.mul_to_tmp(m_coord_x, m_curve.get_a_rep(), monty_ws);
  524|  1.73k|   const BigInt z2 = m_curve.sqr_to_tmp(m_coord_z, monty_ws);
  525|       |
  526|  1.73k|   if(m_coord_z == z2)  // Is z equal to 1 (in Montgomery form)?
  ------------------
  |  Branch (526:7): [True: 1.73k, False: 0]
  ------------------
  527|  1.73k|   {
  528|  1.73k|      if(y2 != m_curve.from_rep_to_tmp(x3 + ax + m_curve.get_b_rep(), monty_ws)) {
  ------------------
  |  Branch (528:10): [True: 70, False: 1.66k]
  ------------------
  529|     70|         return false;
  530|     70|      }
  531|  1.73k|   }
  532|       |
  533|  1.66k|   const BigInt z3 = m_curve.mul_to_tmp(m_coord_z, z2, monty_ws);
  534|  1.66k|   const BigInt ax_z4 = m_curve.mul_to_tmp(ax, m_curve.sqr_to_tmp(z2, monty_ws), monty_ws);
  535|  1.66k|   const BigInt b_z6 = m_curve.mul_to_tmp(m_curve.get_b_rep(), m_curve.sqr_to_tmp(z3, monty_ws), monty_ws);
  536|       |
  537|  1.66k|   if(y2 != m_curve.from_rep_to_tmp(x3 + ax_z4 + b_z6, monty_ws)) {
  ------------------
  |  Branch (537:7): [True: 0, False: 1.66k]
  ------------------
  538|      0|      return false;
  539|      0|   }
  540|       |
  541|  1.66k|   return true;
  542|  1.66k|}
_ZN5Botan8EC_Point4swapERS0_:
  545|  10.4k|void EC_Point::swap(EC_Point& other) {
  546|  10.4k|   m_curve.swap(other.m_curve);
  547|  10.4k|   m_coord_x.swap(other.m_coord_x);
  548|  10.4k|   m_coord_y.swap(other.m_coord_y);
  549|  10.4k|   m_coord_z.swap(other.m_coord_z);
  550|  10.4k|}
_ZN5Botan6OS2ECPEPKhmRKNS_8CurveGFpE:
  625|  1.26k|EC_Point OS2ECP(const uint8_t data[], size_t data_len, const CurveGFp& curve) {
  626|       |   // Should we really be doing this?
  627|  1.26k|   if(data_len <= 1) {
  ------------------
  |  Branch (627:7): [True: 0, False: 1.26k]
  ------------------
  628|      0|      return EC_Point(curve);  // return zero
  629|      0|   }
  630|       |
  631|  1.26k|   std::pair<BigInt, BigInt> xy = OS2ECP(data, data_len, curve.get_p(), curve.get_a(), curve.get_b());
  632|       |
  633|  1.26k|   EC_Point point(curve, xy.first, xy.second);
  634|       |
  635|  1.26k|   if(!point.on_the_curve()) {
  ------------------
  |  Branch (635:7): [True: 70, False: 1.19k]
  ------------------
  636|     70|      throw Decoding_Error("OS2ECP: Decoded point was not on the curve");
  637|     70|   }
  638|       |
  639|  1.19k|   return point;
  640|  1.26k|}
_ZN5Botan6OS2ECPEPKhmRKNS_6BigIntES4_S4_:
  643|  1.26k|   const uint8_t data[], size_t data_len, const BigInt& curve_p, const BigInt& curve_a, const BigInt& curve_b) {
  644|  1.26k|   if(data_len <= 1) {
  ------------------
  |  Branch (644:7): [True: 0, False: 1.26k]
  ------------------
  645|      0|      throw Decoding_Error("OS2ECP invalid point");
  646|      0|   }
  647|       |
  648|  1.26k|   const uint8_t pc = data[0];
  649|       |
  650|  1.26k|   BigInt x, y;
  651|       |
  652|  1.26k|   if(pc == 2 || pc == 3) {
  ------------------
  |  Branch (652:7): [True: 995, False: 270]
  |  Branch (652:18): [True: 28, False: 242]
  ------------------
  653|       |      //compressed form
  654|  1.02k|      x = BigInt::decode(&data[1], data_len - 1);
  655|       |
  656|  1.02k|      const bool y_mod_2 = ((pc & 0x01) == 1);
  657|  1.02k|      y = decompress_point(y_mod_2, x, curve_p, curve_a, curve_b);
  658|  1.02k|   } else if(pc == 4) {
  ------------------
  |  Branch (658:14): [True: 75, False: 167]
  ------------------
  659|     75|      const size_t l = (data_len - 1) / 2;
  660|       |
  661|       |      // uncompressed form
  662|     75|      x = BigInt::decode(&data[1], l);
  663|     75|      y = BigInt::decode(&data[l + 1], l);
  664|    167|   } else if(pc == 6 || pc == 7) {
  ------------------
  |  Branch (664:14): [True: 153, False: 14]
  |  Branch (664:25): [True: 5, False: 9]
  ------------------
  665|    158|      const size_t l = (data_len - 1) / 2;
  666|       |
  667|       |      // hybrid form
  668|    158|      x = BigInt::decode(&data[1], l);
  669|    158|      y = BigInt::decode(&data[l + 1], l);
  670|       |
  671|    158|      const bool y_mod_2 = ((pc & 0x01) == 1);
  672|       |
  673|    158|      if(decompress_point(y_mod_2, x, curve_p, curve_a, curve_b) != y) {
  ------------------
  |  Branch (673:10): [True: 125, False: 33]
  ------------------
  674|    125|         throw Decoding_Error("OS2ECP: Decoding error in hybrid format");
  675|    125|      }
  676|    158|   } else {
  677|      9|      throw Invalid_Argument("OS2ECP: Unknown format type " + std::to_string(pc));
  678|      9|   }
  679|       |
  680|  1.13k|   return std::make_pair(x, y);
  681|  1.26k|}
ec_point.cpp:_ZN5Botan12_GLOBAL__N_19resize_wsERNSt3__16vectorINS_6BigIntENS1_9allocatorIS3_EEEEm:
   61|   126k|inline void resize_ws(std::vector<BigInt>& ws_bn, size_t cap_size) {
   62|   126k|   BOTAN_ASSERT(ws_bn.size() >= EC_Point::WORKSPACE_SIZE, "Expected size for EC_Point workspace");
  ------------------
  |  |   51|   126k|   do {                                                                                 \
  |  |   52|   126k|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 126k]
  |  |  ------------------
  |  |   53|   126k|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|   126k|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
   63|       |
   64|  1.00M|   for(auto& ws : ws_bn) {
  ------------------
  |  Branch (64:17): [True: 1.00M, False: 126k]
  ------------------
   65|  1.00M|      if(ws.size() < cap_size) {
  ------------------
  |  Branch (65:10): [True: 7.21k, False: 1.00M]
  ------------------
   66|  7.21k|         ws.get_word_vector().resize(cap_size);
   67|  7.21k|      }
   68|  1.00M|   }
   69|   126k|}
ec_point.cpp:_ZN5Botan12_GLOBAL__N_116decompress_pointEbRKNS_6BigIntES3_S3_S3_:
  602|  1.18k|   bool yMod2, const BigInt& x, const BigInt& curve_p, const BigInt& curve_a, const BigInt& curve_b) {
  603|  1.18k|   BigInt xpow3 = x * x * x;
  604|       |
  605|  1.18k|   BigInt g = curve_a * x;
  606|  1.18k|   g += xpow3;
  607|  1.18k|   g += curve_b;
  608|  1.18k|   g = g % curve_p;
  609|       |
  610|  1.18k|   BigInt z = sqrt_modulo_prime(g, curve_p);
  611|       |
  612|  1.18k|   if(z < 0) {
  ------------------
  |  Branch (612:7): [True: 276, False: 905]
  ------------------
  613|    276|      throw Decoding_Error("Error during EC point decompression");
  614|    276|   }
  615|       |
  616|    905|   if(z.get_bit(0) != yMod2) {
  ------------------
  |  Branch (616:7): [True: 461, False: 444]
  ------------------
  617|    461|      z = curve_p - z;
  618|    461|   }
  619|       |
  620|    905|   return z;
  621|  1.18k|}

_ZN5Botan30EC_Point_Base_Point_PrecomputeC2ERKNS_8EC_PointERKNS_15Modular_ReducerE:
   28|      7|      m_base_point(base), m_mod_order(mod_order), m_p_words(base.get_curve().get_p().sig_words()) {
   29|      7|   std::vector<BigInt> ws(EC_Point::WORKSPACE_SIZE);
   30|       |
   31|      7|   const size_t p_bits = base.get_curve().get_p().bits();
   32|       |
   33|       |   /*
   34|       |   * Some of the curves (eg secp160k1) have an order slightly larger than
   35|       |   * the size of the prime modulus. In all cases they are at most 1 bit
   36|       |   * longer. The +1 compensates for this.
   37|       |   */
   38|      7|   const size_t T_bits = round_up(p_bits + blinding_size(mod_order.get_modulus()) + 1, WINDOW_BITS) / WINDOW_BITS;
   39|       |
   40|      7|   std::vector<EC_Point> T(WINDOW_SIZE * T_bits);
   41|       |
   42|      7|   EC_Point g = base;
   43|      7|   EC_Point g2, g4;
   44|       |
   45|    787|   for(size_t i = 0; i != T_bits; i++) {
  ------------------
  |  Branch (45:22): [True: 780, False: 7]
  ------------------
   46|    780|      g2 = g;
   47|    780|      g2.mult2(ws);
   48|    780|      g4 = g2;
   49|    780|      g4.mult2(ws);
   50|       |
   51|    780|      T[7 * i + 0] = g;
   52|    780|      T[7 * i + 1] = std::move(g2);
   53|    780|      T[7 * i + 2] = T[7 * i + 1].plus(T[7 * i + 0], ws);  // g2+g
   54|    780|      T[7 * i + 3] = g4;
   55|    780|      T[7 * i + 4] = T[7 * i + 3].plus(T[7 * i + 0], ws);  // g4+g
   56|    780|      T[7 * i + 5] = T[7 * i + 3].plus(T[7 * i + 1], ws);  // g4+g2
   57|    780|      T[7 * i + 6] = T[7 * i + 3].plus(T[7 * i + 2], ws);  // g4+g2+g
   58|       |
   59|    780|      g.swap(g4);
   60|    780|      g.mult2(ws);
   61|    780|   }
   62|       |
   63|      7|   EC_Point::force_all_affine(T, ws[0].get_word_vector());
   64|       |
   65|      7|   m_W.resize(T.size() * 2 * m_p_words);
   66|       |
   67|      7|   word* p = &m_W[0];
   68|  5.46k|   for(size_t i = 0; i != T.size(); ++i) {
  ------------------
  |  Branch (68:22): [True: 5.46k, False: 7]
  ------------------
   69|  5.46k|      T[i].get_x().encode_words(p, m_p_words);
   70|  5.46k|      p += m_p_words;
   71|  5.46k|      T[i].get_y().encode_words(p, m_p_words);
   72|  5.46k|      p += m_p_words;
   73|  5.46k|   }
   74|      7|}
_ZN5Botan31EC_Point_Multi_Point_PrecomputeC2ERKNS_8EC_PointES3_:
  293|    550|EC_Point_Multi_Point_Precompute::EC_Point_Multi_Point_Precompute(const EC_Point& x, const EC_Point& y) {
  294|    550|   if(x.on_the_curve() == false || y.on_the_curve() == false) {
  ------------------
  |  Branch (294:7): [True: 0, False: 550]
  |  Branch (294:36): [True: 0, False: 550]
  ------------------
  295|      0|      m_M.push_back(x.zero());
  296|      0|      return;
  297|      0|   }
  298|       |
  299|    550|   std::vector<BigInt> ws(EC_Point::WORKSPACE_SIZE);
  300|       |
  301|    550|   EC_Point x2 = x;
  302|    550|   x2.mult2(ws);
  303|       |
  304|    550|   const EC_Point x3(x2.plus(x, ws));
  305|       |
  306|    550|   EC_Point y2 = y;
  307|    550|   y2.mult2(ws);
  308|       |
  309|    550|   const EC_Point y3(y2.plus(y, ws));
  310|       |
  311|    550|   m_M.reserve(15);
  312|       |
  313|    550|   m_M.push_back(x);
  314|    550|   m_M.push_back(x2);
  315|    550|   m_M.push_back(x3);
  316|       |
  317|    550|   m_M.push_back(y);
  318|    550|   m_M.push_back(y.plus(x, ws));
  319|    550|   m_M.push_back(y.plus(x2, ws));
  320|    550|   m_M.push_back(y.plus(x3, ws));
  321|       |
  322|    550|   m_M.push_back(y2);
  323|    550|   m_M.push_back(y2.plus(x, ws));
  324|    550|   m_M.push_back(y2.plus(x2, ws));
  325|    550|   m_M.push_back(y2.plus(x3, ws));
  326|       |
  327|    550|   m_M.push_back(y3);
  328|    550|   m_M.push_back(y3.plus(x, ws));
  329|    550|   m_M.push_back(y3.plus(x2, ws));
  330|    550|   m_M.push_back(y3.plus(x3, ws));
  331|       |
  332|    550|   bool no_infinity = true;
  333|  8.25k|   for(auto& pt : m_M) {
  ------------------
  |  Branch (333:17): [True: 8.25k, False: 550]
  ------------------
  334|  8.25k|      if(pt.is_zero()) {
  ------------------
  |  Branch (334:10): [True: 0, False: 8.25k]
  ------------------
  335|      0|         no_infinity = false;
  336|      0|      }
  337|  8.25k|   }
  338|       |
  339|    550|   if(no_infinity) {
  ------------------
  |  Branch (339:7): [True: 550, False: 0]
  ------------------
  340|    550|      EC_Point::force_all_affine(m_M, ws[0].get_word_vector());
  341|    550|   }
  342|       |
  343|    550|   m_no_infinity = no_infinity;
  344|    550|}
_ZNK5Botan31EC_Point_Multi_Point_Precompute9multi_expERKNS_6BigIntES3_:
  346|    306|EC_Point EC_Point_Multi_Point_Precompute::multi_exp(const BigInt& z1, const BigInt& z2) const {
  347|    306|   if(m_M.size() == 1) {
  ------------------
  |  Branch (347:7): [True: 0, False: 306]
  ------------------
  348|      0|      return m_M[0];
  349|      0|   }
  350|       |
  351|    306|   std::vector<BigInt> ws(EC_Point::WORKSPACE_SIZE);
  352|       |
  353|    306|   const size_t z_bits = round_up(std::max(z1.bits(), z2.bits()), 2);
  354|       |
  355|    306|   EC_Point H = m_M[0].zero();
  356|       |
  357|  39.3k|   for(size_t i = 0; i != z_bits; i += 2) {
  ------------------
  |  Branch (357:22): [True: 39.0k, False: 306]
  ------------------
  358|  39.0k|      if(i > 0) {
  ------------------
  |  Branch (358:10): [True: 38.7k, False: 306]
  ------------------
  359|  38.7k|         H.mult2i(2, ws);
  360|  38.7k|      }
  361|       |
  362|  39.0k|      const uint32_t z1_b = z1.get_substring(z_bits - i - 2, 2);
  363|  39.0k|      const uint32_t z2_b = z2.get_substring(z_bits - i - 2, 2);
  364|       |
  365|  39.0k|      const uint32_t z12 = (4 * z2_b) + z1_b;
  366|       |
  367|       |      // This function is not intended to be const time
  368|  39.0k|      if(z12) {
  ------------------
  |  Branch (368:10): [True: 36.2k, False: 2.74k]
  ------------------
  369|  36.2k|         if(m_no_infinity) {
  ------------------
  |  Branch (369:13): [True: 36.2k, False: 0]
  ------------------
  370|  36.2k|            H.add_affine(m_M[z12 - 1], ws);
  371|  36.2k|         } else {
  372|      0|            H.add(m_M[z12 - 1], ws);
  373|      0|         }
  374|  36.2k|      }
  375|  39.0k|   }
  376|       |
  377|    306|   if(z1.is_negative() != z2.is_negative()) {
  ------------------
  |  Branch (377:7): [True: 0, False: 306]
  ------------------
  378|      0|      H.negate();
  379|      0|   }
  380|       |
  381|    306|   return H;
  382|    306|}
point_mul.cpp:_ZN5Botan12_GLOBAL__N_113blinding_sizeERKNS_6BigIntE:
   18|      7|size_t blinding_size(const BigInt& group_order) { return (group_order.bits() + 1) / 2; }

_ZN5Botan12EC_PublicKeyC2ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE:
   43|  1.32k|      m_domain_encoding(default_encoding_for(m_domain_params)) {}
ecc_key.cpp:_ZN5Botan12_GLOBAL__N_120default_encoding_forERNS_8EC_GroupE:
   27|    560|EC_Group_Encoding default_encoding_for(EC_Group& group) {
   28|    560|   if(group.get_curve_oid().empty()) {
  ------------------
  |  Branch (28:7): [True: 0, False: 560]
  ------------------
   29|      0|      return EC_Group_Encoding::Explicit;
   30|    560|   } else {
   31|    560|      return EC_Group_Encoding::NamedCurve;
   32|    560|   }
   33|    560|}

_ZNK5Botan15ECDSA_PublicKey27create_x509_verification_opERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE:
  255|    560|   const AlgorithmIdentifier& signature_algorithm, std::string_view provider) const {
  256|    560|   if(provider == "base" || provider.empty()) {
  ------------------
  |  Branch (256:7): [True: 0, False: 560]
  |  Branch (256:29): [True: 560, False: 0]
  ------------------
  257|    560|      return std::make_unique<ECDSA_Verification_Operation>(*this, signature_algorithm);
  258|    560|   }
  259|       |
  260|      0|   throw Provider_Not_Found(algo_name(), provider);
  261|    560|}
ecdsa.cpp:_ZN5Botan12_GLOBAL__N_128ECDSA_Verification_Operation6verifyEPKhmS3_m:
  210|    503|bool ECDSA_Verification_Operation::verify(const uint8_t msg[], size_t msg_len, const uint8_t sig[], size_t sig_len) {
  211|    503|   if(sig_len != m_group.get_order_bytes() * 2) {
  ------------------
  |  Branch (211:7): [True: 194, False: 309]
  ------------------
  212|    194|      return false;
  213|    194|   }
  214|       |
  215|    309|   const BigInt e = BigInt::from_bytes_with_max_bits(msg, msg_len, m_group.get_order_bits());
  216|       |
  217|    309|   const BigInt r(sig, sig_len / 2);
  218|    309|   const BigInt s(sig + sig_len / 2, sig_len / 2);
  219|       |
  220|       |   // Cannot be negative here since we just decoded from binary
  221|    309|   if(r.is_zero() || s.is_zero()) {
  ------------------
  |  Branch (221:7): [True: 0, False: 309]
  |  Branch (221:22): [True: 0, False: 309]
  ------------------
  222|      0|      return false;
  223|      0|   }
  224|       |
  225|    309|   if(r >= m_group.get_order() || s >= m_group.get_order()) {
  ------------------
  |  Branch (225:7): [True: 0, False: 309]
  |  Branch (225:35): [True: 3, False: 306]
  ------------------
  226|      3|      return false;
  227|      3|   }
  228|       |
  229|    306|   const BigInt w = m_group.inverse_mod_order(s);
  230|       |
  231|    306|   const BigInt u1 = m_group.multiply_mod_order(m_group.mod_order(e), w);
  232|    306|   const BigInt u2 = m_group.multiply_mod_order(r, w);
  233|    306|   const EC_Point R = m_gy_mul.multi_exp(u1, u2);
  234|       |
  235|    306|   if(R.is_zero()) {
  ------------------
  |  Branch (235:7): [True: 0, False: 306]
  ------------------
  236|      0|      return false;
  237|      0|   }
  238|       |
  239|    306|   const BigInt v = m_group.mod_order(R.get_affine_x());
  240|    306|   return (v == r);
  241|    306|}
ecdsa.cpp:_ZN5Botan12_GLOBAL__N_128ECDSA_Verification_OperationC2ERKNS_15ECDSA_PublicKeyERKNS_19AlgorithmIdentifierE:
  201|    560|            m_gy_mul(m_group.get_base_point(), ecdsa.public_point()) {}

_ZN5Botan8PEM_Code6decodeERNS_10DataSourceERNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEE:
   62|  2.25k|secure_vector<uint8_t> decode(DataSource& source, std::string& label) {
   63|  2.25k|   const size_t RANDOM_CHAR_LIMIT = 8;
   64|       |
   65|  2.25k|   label.clear();
   66|       |
   67|  2.25k|   const std::string PEM_HEADER1 = "-----BEGIN ";
   68|  2.25k|   const std::string PEM_HEADER2 = "-----";
   69|  2.25k|   size_t position = 0;
   70|       |
   71|  33.9k|   while(position != PEM_HEADER1.length()) {
  ------------------
  |  Branch (71:10): [True: 32.0k, False: 1.96k]
  ------------------
   72|  32.0k|      uint8_t b;
   73|  32.0k|      if(!source.read_byte(b)) {
  ------------------
  |  Branch (73:10): [True: 296, False: 31.7k]
  ------------------
   74|    296|         throw Decoding_Error("PEM: No PEM header found");
   75|    296|      }
   76|  31.7k|      if(static_cast<char>(b) == PEM_HEADER1[position]) {
  ------------------
  |  Branch (76:10): [True: 22.0k, False: 9.67k]
  ------------------
   77|  22.0k|         ++position;
   78|  22.0k|      } else if(position >= RANDOM_CHAR_LIMIT) {
  ------------------
  |  Branch (78:17): [True: 2, False: 9.66k]
  ------------------
   79|      2|         throw Decoding_Error("PEM: Malformed PEM header");
   80|  9.66k|      } else {
   81|  9.66k|         position = 0;
   82|  9.66k|      }
   83|  31.7k|   }
   84|  1.96k|   position = 0;
   85|  74.2k|   while(position != PEM_HEADER2.length()) {
  ------------------
  |  Branch (85:10): [True: 72.3k, False: 1.92k]
  ------------------
   86|  72.3k|      uint8_t b;
   87|  72.3k|      if(!source.read_byte(b)) {
  ------------------
  |  Branch (87:10): [True: 30, False: 72.2k]
  ------------------
   88|     30|         throw Decoding_Error("PEM: No PEM header found");
   89|     30|      }
   90|  72.2k|      if(static_cast<char>(b) == PEM_HEADER2[position]) {
  ------------------
  |  Branch (90:10): [True: 9.65k, False: 62.6k]
  ------------------
   91|  9.65k|         ++position;
   92|  62.6k|      } else if(position) {
  ------------------
  |  Branch (92:17): [True: 4, False: 62.6k]
  ------------------
   93|      4|         throw Decoding_Error("PEM: Malformed PEM header");
   94|      4|      }
   95|       |
   96|  72.2k|      if(position == 0) {
  ------------------
  |  Branch (96:10): [True: 62.6k, False: 9.65k]
  ------------------
   97|  62.6k|         label += static_cast<char>(b);
   98|  62.6k|      }
   99|  72.2k|   }
  100|       |
  101|  1.92k|   std::vector<char> b64;
  102|       |
  103|  1.92k|   const std::string PEM_TRAILER = fmt("-----END {}-----", label);
  104|  1.92k|   position = 0;
  105|  1.96M|   while(position != PEM_TRAILER.length()) {
  ------------------
  |  Branch (105:10): [True: 1.96M, False: 1.83k]
  ------------------
  106|  1.96M|      uint8_t b;
  107|  1.96M|      if(!source.read_byte(b)) {
  ------------------
  |  Branch (107:10): [True: 83, False: 1.96M]
  ------------------
  108|     83|         throw Decoding_Error("PEM: No PEM trailer found");
  109|     83|      }
  110|  1.96M|      if(static_cast<char>(b) == PEM_TRAILER[position]) {
  ------------------
  |  Branch (110:10): [True: 55.8k, False: 1.90M]
  ------------------
  111|  55.8k|         ++position;
  112|  1.90M|      } else if(position) {
  ------------------
  |  Branch (112:17): [True: 5, False: 1.90M]
  ------------------
  113|      5|         throw Decoding_Error("PEM: Malformed PEM trailer");
  114|      5|      }
  115|       |
  116|  1.96M|      if(position == 0) {
  ------------------
  |  Branch (116:10): [True: 1.90M, False: 55.8k]
  ------------------
  117|  1.90M|         b64.push_back(b);
  118|  1.90M|      }
  119|  1.96M|   }
  120|       |
  121|  1.83k|   return base64_decode(b64.data(), b64.size());
  122|  1.92k|}
_ZN5Botan8PEM_Code7matchesERNS_10DataSourceENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEm:
  137|  8.73k|bool matches(DataSource& source, std::string_view extra, size_t search_range) {
  138|  8.73k|   const std::string PEM_HEADER = fmt("-----BEGIN {}", extra);
  139|       |
  140|  8.73k|   secure_vector<uint8_t> search_buf(search_range);
  141|  8.73k|   const size_t got = source.peek(search_buf.data(), search_buf.size(), 0);
  142|       |
  143|  8.73k|   if(got < PEM_HEADER.length()) {
  ------------------
  |  Branch (143:7): [True: 472, False: 8.26k]
  ------------------
  144|    472|      return false;
  145|    472|   }
  146|       |
  147|  8.26k|   size_t index = 0;
  148|       |
  149|  3.07M|   for(size_t j = 0; j != got; ++j) {
  ------------------
  |  Branch (149:22): [True: 3.06M, False: 8.07k]
  ------------------
  150|  3.06M|      if(static_cast<char>(search_buf[j]) == PEM_HEADER[index]) {
  ------------------
  |  Branch (150:10): [True: 14.3k, False: 3.05M]
  ------------------
  151|  14.3k|         ++index;
  152|  3.05M|      } else {
  153|  3.05M|         index = 0;
  154|  3.05M|      }
  155|       |
  156|  3.06M|      if(index == PEM_HEADER.size()) {
  ------------------
  |  Branch (156:10): [True: 188, False: 3.06M]
  ------------------
  157|    188|         return true;
  158|    188|      }
  159|  3.06M|   }
  160|       |
  161|  8.07k|   return false;
  162|  8.26k|}

_ZN5Botan15load_public_keyERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE:
   88|  3.45k|                                            [[maybe_unused]] std::span<const uint8_t> key_bits) {
   89|  3.45k|   const std::string oid_str = alg_id.oid().to_formatted_string();
   90|  3.45k|   const std::vector<std::string> alg_info = split_on(oid_str, '/');
   91|  3.45k|   std::string_view alg_name = alg_info[0];
   92|       |
   93|  3.45k|#if defined(BOTAN_HAS_RSA)
   94|  3.45k|   if(alg_name == "RSA") {
  ------------------
  |  Branch (94:7): [True: 1.64k, False: 1.80k]
  ------------------
   95|  1.64k|      return std::make_unique<RSA_PublicKey>(alg_id, key_bits);
   96|  1.64k|   }
   97|  1.80k|#endif
   98|       |
   99|  1.80k|#if defined(BOTAN_HAS_CURVE_25519)
  100|  1.80k|   if(alg_name == "Curve25519") {
  ------------------
  |  Branch (100:7): [True: 0, False: 1.80k]
  ------------------
  101|      0|      return std::make_unique<Curve25519_PublicKey>(alg_id, key_bits);
  102|      0|   }
  103|  1.80k|#endif
  104|       |
  105|  1.80k|#if defined(BOTAN_HAS_MCELIECE)
  106|  1.80k|   if(alg_name == "McEliece") {
  ------------------
  |  Branch (106:7): [True: 0, False: 1.80k]
  ------------------
  107|      0|      return std::make_unique<McEliece_PublicKey>(key_bits);
  108|      0|   }
  109|  1.80k|#endif
  110|       |
  111|  1.80k|#if defined(BOTAN_HAS_KYBER) || defined(BOTAN_HAS_KYBER_90S)
  112|  1.80k|   if(alg_name == "Kyber" || alg_name.starts_with("Kyber-")) {
  ------------------
  |  Branch (112:7): [True: 0, False: 1.80k]
  |  Branch (112:30): [True: 0, False: 1.80k]
  ------------------
  113|      0|      return std::make_unique<Kyber_PublicKey>(alg_id, key_bits);
  114|      0|   }
  115|  1.80k|#endif
  116|       |
  117|  1.80k|#if defined(BOTAN_HAS_ECDSA)
  118|  1.80k|   if(alg_name == "ECDSA") {
  ------------------
  |  Branch (118:7): [True: 1.32k, False: 486]
  ------------------
  119|  1.32k|      return std::make_unique<ECDSA_PublicKey>(alg_id, key_bits);
  120|  1.32k|   }
  121|    486|#endif
  122|       |
  123|    486|#if defined(BOTAN_HAS_ECDH)
  124|    486|   if(alg_name == "ECDH") {
  ------------------
  |  Branch (124:7): [True: 0, False: 486]
  ------------------
  125|      0|      return std::make_unique<ECDH_PublicKey>(alg_id, key_bits);
  126|      0|   }
  127|    486|#endif
  128|       |
  129|    486|#if defined(BOTAN_HAS_DIFFIE_HELLMAN)
  130|    486|   if(alg_name == "DH") {
  ------------------
  |  Branch (130:7): [True: 6, False: 480]
  ------------------
  131|      6|      return std::make_unique<DH_PublicKey>(alg_id, key_bits);
  132|      6|   }
  133|    480|#endif
  134|       |
  135|    480|#if defined(BOTAN_HAS_DSA)
  136|    480|   if(alg_name == "DSA") {
  ------------------
  |  Branch (136:7): [True: 0, False: 480]
  ------------------
  137|      0|      return std::make_unique<DSA_PublicKey>(alg_id, key_bits);
  138|      0|   }
  139|    480|#endif
  140|       |
  141|    480|#if defined(BOTAN_HAS_ELGAMAL)
  142|    480|   if(alg_name == "ElGamal") {
  ------------------
  |  Branch (142:7): [True: 0, False: 480]
  ------------------
  143|      0|      return std::make_unique<ElGamal_PublicKey>(alg_id, key_bits);
  144|      0|   }
  145|    480|#endif
  146|       |
  147|    480|#if defined(BOTAN_HAS_ECGDSA)
  148|    480|   if(alg_name == "ECGDSA") {
  ------------------
  |  Branch (148:7): [True: 0, False: 480]
  ------------------
  149|      0|      return std::make_unique<ECGDSA_PublicKey>(alg_id, key_bits);
  150|      0|   }
  151|    480|#endif
  152|       |
  153|    480|#if defined(BOTAN_HAS_ECKCDSA)
  154|    480|   if(alg_name == "ECKCDSA") {
  ------------------
  |  Branch (154:7): [True: 0, False: 480]
  ------------------
  155|      0|      return std::make_unique<ECKCDSA_PublicKey>(alg_id, key_bits);
  156|      0|   }
  157|    480|#endif
  158|       |
  159|    480|#if defined(BOTAN_HAS_ED25519)
  160|    480|   if(alg_name == "Ed25519") {
  ------------------
  |  Branch (160:7): [True: 0, False: 480]
  ------------------
  161|      0|      return std::make_unique<Ed25519_PublicKey>(alg_id, key_bits);
  162|      0|   }
  163|    480|#endif
  164|       |
  165|    480|#if defined(BOTAN_HAS_GOST_34_10_2001)
  166|    480|   if(alg_name == "GOST-34.10" || alg_name == "GOST-34.10-2012-256" || alg_name == "GOST-34.10-2012-512") {
  ------------------
  |  Branch (166:7): [True: 0, False: 480]
  |  Branch (166:35): [True: 0, False: 480]
  |  Branch (166:72): [True: 0, False: 480]
  ------------------
  167|      0|      return std::make_unique<GOST_3410_PublicKey>(alg_id, key_bits);
  168|      0|   }
  169|    480|#endif
  170|       |
  171|    480|#if defined(BOTAN_HAS_SM2)
  172|    480|   if(alg_name == "SM2" || alg_name == "SM2_Sig" || alg_name == "SM2_Enc") {
  ------------------
  |  Branch (172:7): [True: 0, False: 480]
  |  Branch (172:28): [True: 0, False: 480]
  |  Branch (172:53): [True: 0, False: 480]
  ------------------
  173|      0|      return std::make_unique<SM2_PublicKey>(alg_id, key_bits);
  174|      0|   }
  175|    480|#endif
  176|       |
  177|    480|#if defined(BOTAN_HAS_XMSS_RFC8391)
  178|    480|   if(alg_name == "XMSS") {
  ------------------
  |  Branch (178:7): [True: 0, False: 480]
  ------------------
  179|      0|      return std::make_unique<XMSS_PublicKey>(key_bits);
  180|      0|   }
  181|    480|#endif
  182|       |
  183|    480|#if defined(BOTAN_HAS_DILITHIUM) || defined(BOTAN_HAS_DILITHIUM_AES)
  184|    480|   if(alg_name == "Dilithium" || alg_name.starts_with("Dilithium-")) {
  ------------------
  |  Branch (184:7): [True: 0, False: 480]
  |  Branch (184:34): [True: 0, False: 480]
  ------------------
  185|      0|      return std::make_unique<Dilithium_PublicKey>(alg_id, key_bits);
  186|      0|   }
  187|    480|#endif
  188|       |
  189|    480|   throw Decoding_Error(fmt("Unknown or unavailable public key algorithm '{}'", alg_name));
  190|    480|}

_ZN5Botan22create_hex_fingerprintEPKhmNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
   30|  8.00k|std::string create_hex_fingerprint(const uint8_t bits[], size_t bits_len, std::string_view hash_name) {
   31|  8.00k|   auto hash_fn = HashFunction::create_or_throw(hash_name);
   32|  8.00k|   const std::string hex_hash = hex_encode(hash_fn->process(bits, bits_len));
   33|       |
   34|  8.00k|   std::string fprint;
   35|       |
   36|   216k|   for(size_t i = 0; i != hex_hash.size(); i += 2) {
  ------------------
  |  Branch (36:22): [True: 208k, False: 8.00k]
  ------------------
   37|   208k|      if(i != 0) {
  ------------------
  |  Branch (37:10): [True: 200k, False: 8.00k]
  ------------------
   38|   200k|         fprint.push_back(':');
   39|   200k|      }
   40|       |
   41|   208k|      fprint.push_back(hex_hash[i]);
   42|   208k|      fprint.push_back(hex_hash[i + 1]);
   43|   208k|   }
   44|       |
   45|  8.00k|   return fprint;
   46|  8.00k|}

_ZN5Botan6PK_Ops22Verification_with_HashC2ERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEb:
  129|    560|                                                       bool allow_null_parameters) {
  130|    560|   const auto oid_info = split_on(alg_id.oid().to_formatted_string(), '/');
  131|       |
  132|    560|   if(oid_info.size() != 2 || oid_info[0] != pk_algo) {
  ------------------
  |  Branch (132:7): [True: 10, False: 550]
  |  Branch (132:31): [True: 0, False: 550]
  ------------------
  133|     10|      throw Decoding_Error(
  134|     10|         fmt("Unexpected AlgorithmIdentifier OID {} in association with {} key", alg_id.oid(), pk_algo));
  135|     10|   }
  136|       |
  137|    550|   if(!alg_id.parameters_are_empty()) {
  ------------------
  |  Branch (137:7): [True: 0, False: 550]
  ------------------
  138|      0|      if(alg_id.parameters_are_null()) {
  ------------------
  |  Branch (138:10): [True: 0, False: 0]
  ------------------
  139|      0|         if(!allow_null_parameters) {
  ------------------
  |  Branch (139:13): [True: 0, False: 0]
  ------------------
  140|      0|            throw Decoding_Error(fmt("Unexpected NULL AlgorithmIdentifier parameters for {}", pk_algo));
  141|      0|         }
  142|      0|      } else {
  143|      0|         throw Decoding_Error(fmt("Unexpected AlgorithmIdentifier parameters for {}", pk_algo));
  144|      0|      }
  145|      0|   }
  146|       |
  147|    550|   m_hash = HashFunction::create_or_throw(oid_info[1]);
  148|    550|}
_ZN5Botan6PK_Ops22Verification_with_Hash6updateEPKhm:
  150|    550|void PK_Ops::Verification_with_Hash::update(const uint8_t msg[], size_t msg_len) { m_hash->update(msg, msg_len); }
_ZN5Botan6PK_Ops22Verification_with_Hash18is_valid_signatureEPKhm:
  152|    503|bool PK_Ops::Verification_with_Hash::is_valid_signature(const uint8_t sig[], size_t sig_len) {
  153|    503|   const secure_vector<uint8_t> msg = m_hash->final();
  154|    503|   return verify(msg.data(), msg.size(), sig, sig_len);
  155|    503|}

_ZN5Botan11PK_VerifierC2ERKNS_10Public_KeyERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS7_11char_traitsIcEEEE:
  280|  1.97k|                         std::string_view provider) {
  281|  1.97k|   m_op = key.create_x509_verification_op(signature_algorithm, provider);
  282|       |
  283|  1.97k|   if(!m_op) {
  ------------------
  |  Branch (283:7): [True: 0, False: 1.97k]
  ------------------
  284|      0|      throw Invalid_Argument(fmt("Key type {} does not support X.509 signature verification", key.algo_name()));
  285|      0|   }
  286|       |
  287|  1.97k|   m_sig_format = key.default_x509_signature_format();
  288|  1.97k|   m_parts = key.message_parts();
  289|  1.97k|   m_part_size = key.message_part_size();
  290|  1.97k|   check_der_format_supported(m_sig_format, m_parts);
  291|  1.97k|}
_ZN5Botan11PK_VerifierD2Ev:
  293|  1.65k|PK_Verifier::~PK_Verifier() = default;
_ZNK5Botan11PK_Verifier13hash_functionEv:
  295|     12|std::string PK_Verifier::hash_function() const { return m_op->hash_function(); }
_ZN5Botan11PK_Verifier14verify_messageEPKhmS2_m:
  302|  1.65k|bool PK_Verifier::verify_message(const uint8_t msg[], size_t msg_length, const uint8_t sig[], size_t sig_length) {
  303|  1.65k|   update(msg, msg_length);
  304|  1.65k|   return check_signature(sig, sig_length);
  305|  1.65k|}
_ZN5Botan11PK_Verifier6updateEPKhm:
  307|  1.65k|void PK_Verifier::update(const uint8_t in[], size_t length) { m_op->update(in, length); }
_ZN5Botan11PK_Verifier15check_signatureEPKhm:
  341|  1.65k|bool PK_Verifier::check_signature(const uint8_t sig[], size_t length) {
  342|  1.65k|   try {
  343|  1.65k|      if(m_sig_format == Signature_Format::Standard) {
  ------------------
  |  Branch (343:10): [True: 1.10k, False: 550]
  ------------------
  344|  1.10k|         return m_op->is_valid_signature(sig, length);
  345|  1.10k|      } else if(m_sig_format == Signature_Format::DerSequence) {
  ------------------
  |  Branch (345:17): [True: 550, False: 0]
  ------------------
  346|    550|         bool decoding_success = false;
  347|    550|         std::vector<uint8_t> real_sig;
  348|       |
  349|    550|         try {
  350|    550|            real_sig = decode_der_signature(sig, length, m_parts, m_part_size);
  351|    550|            decoding_success = true;
  352|    550|         } catch(Decoding_Error&) {}
  353|       |
  354|    550|         bool accept = m_op->is_valid_signature(real_sig.data(), real_sig.size());
  355|       |
  356|    503|         return accept && decoding_success;
  ------------------
  |  Branch (356:17): [True: 0, False: 503]
  |  Branch (356:27): [True: 0, False: 0]
  ------------------
  357|    550|      } else {
  358|      0|         throw Internal_Error("PK_Verifier: Invalid signature format enum");
  359|      0|      }
  360|  1.65k|   } catch(Invalid_Argument&) {
  361|      0|      return false;
  362|     32|   } catch(Decoding_Error&) {
  363|     32|      return false;
  364|     47|   } catch(Encoding_Error&) {
  365|     47|      return false;
  366|     47|   }
  367|  1.65k|}
pubkey.cpp:_ZN5BotanL26check_der_format_supportedENS_16Signature_FormatEm:
  192|  1.65k|static void check_der_format_supported(Signature_Format format, size_t parts) {
  193|  1.65k|   if(format != Signature_Format::Standard && parts == 1) {
  ------------------
  |  Branch (193:7): [True: 550, False: 1.10k]
  |  Branch (193:47): [True: 0, False: 550]
  ------------------
  194|      0|      throw Invalid_Argument("This algorithm does not support DER encoding");
  195|      0|   }
  196|  1.65k|}
pubkey.cpp:_ZN5Botan12_GLOBAL__N_120der_encode_signatureERKNSt3__16vectorIhNS1_9allocatorIhEEEEmm:
  223|    327|std::vector<uint8_t> der_encode_signature(const std::vector<uint8_t>& sig, size_t parts, size_t part_size) {
  224|    327|   if(sig.size() % parts != 0 || sig.size() != parts * part_size) {
  ------------------
  |  Branch (224:7): [True: 0, False: 327]
  |  Branch (224:34): [True: 0, False: 327]
  ------------------
  225|      0|      throw Encoding_Error("Unexpected size for DER signature");
  226|      0|   }
  227|       |
  228|    327|   std::vector<BigInt> sig_parts(parts);
  229|    981|   for(size_t i = 0; i != sig_parts.size(); ++i) {
  ------------------
  |  Branch (229:22): [True: 654, False: 327]
  ------------------
  230|    654|      sig_parts[i].binary_decode(&sig[part_size * i], part_size);
  231|    654|   }
  232|       |
  233|    327|   std::vector<uint8_t> output;
  234|    327|   DER_Encoder(output).start_sequence().encode_list(sig_parts).end_cons();
  235|    327|   return output;
  236|    327|}
pubkey.cpp:_ZN5Botan12_GLOBAL__N_120decode_der_signatureEPKhmmm:
  311|    550|std::vector<uint8_t> decode_der_signature(const uint8_t sig[], size_t length, size_t sig_parts, size_t sig_part_size) {
  312|    550|   std::vector<uint8_t> real_sig;
  313|    550|   BER_Decoder decoder(sig, length);
  314|    550|   BER_Decoder ber_sig = decoder.start_sequence();
  315|       |
  316|    550|   BOTAN_ASSERT_NOMSG(sig_parts != 0 && sig_part_size != 0);
  ------------------
  |  |   60|    550|   do {                                                                     \
  |  |   61|  1.03k|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:12): [True: 486, False: 64]
  |  |  |  Branch (61:12): [True: 486, False: 0]
  |  |  ------------------
  |  |   62|    550|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|    550|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  317|       |
  318|    550|   size_t count = 0;
  319|       |
  320|  1.78k|   while(ber_sig.more_items()) {
  ------------------
  |  Branch (320:10): [True: 1.23k, False: 550]
  ------------------
  321|  1.23k|      BigInt sig_part;
  322|  1.23k|      ber_sig.decode(sig_part);
  323|  1.23k|      real_sig += BigInt::encode_1363(sig_part, sig_part_size);
  324|  1.23k|      ++count;
  325|  1.23k|   }
  326|       |
  327|    550|   if(count != sig_parts) {
  ------------------
  |  Branch (327:7): [True: 9, False: 541]
  ------------------
  328|      9|      throw Decoding_Error("PK_Verifier: signature size invalid");
  329|      9|   }
  330|       |
  331|    541|   const std::vector<uint8_t> reencoded = der_encode_signature(real_sig, sig_parts, sig_part_size);
  332|       |
  333|    541|   if(reencoded.size() != length || same_mem(reencoded.data(), sig, reencoded.size()) == false) {
  ------------------
  |  Branch (333:7): [True: 226, False: 315]
  |  Branch (333:37): [True: 6, False: 309]
  ------------------
  334|     18|      throw Decoding_Error("PK_Verifier: signature is not the canonical DER encoding");
  335|     18|   }
  336|    523|   return real_sig;
  337|    541|}

_ZNK5Botan13RSA_PublicKey11public_dataEv:
  118|  1.39k|std::shared_ptr<const RSA_Public_Data> RSA_PublicKey::public_data() const { return m_public; }
_ZN5Botan13RSA_PublicKey4initEONS_6BigIntES2_:
  134|  1.45k|void RSA_PublicKey::init(BigInt&& n, BigInt&& e) {
  135|  1.45k|   if(n.is_negative() || n.is_even() || n.bits() < 5 /* n >= 3*5 */ || e.is_negative() || e.is_even()) {
  ------------------
  |  Branch (135:7): [True: 7, False: 1.45k]
  |  Branch (135:26): [True: 6, False: 1.44k]
  |  Branch (135:41): [True: 4, False: 1.44k]
  |  Branch (135:72): [True: 5, False: 1.43k]
  |  Branch (135:91): [True: 7, False: 1.43k]
  ------------------
  136|     29|      throw Decoding_Error("Invalid RSA public key parameters");
  137|     29|   }
  138|  1.43k|   m_public = std::make_shared<RSA_Public_Data>(std::move(n), std::move(e));
  139|  1.43k|}
_ZN5Botan13RSA_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE:
  141|  1.64k|RSA_PublicKey::RSA_PublicKey(const AlgorithmIdentifier& /*unused*/, std::span<const uint8_t> key_bits) {
  142|  1.64k|   BigInt n, e;
  143|  1.64k|   BER_Decoder(key_bits).start_sequence().decode(n).decode(e).end_cons();
  144|       |
  145|  1.64k|   init(std::move(n), std::move(e));
  146|  1.64k|}
_ZNK5Botan13RSA_PublicKey10key_lengthEv:
  159|    290|size_t RSA_PublicKey::key_length() const { return m_public->public_modulus_bits(); }
_ZNK5Botan13RSA_PublicKey18estimated_strengthEv:
  161|    290|size_t RSA_PublicKey::estimated_strength() const { return if_work_factor(key_length()); }
_ZNK5Botan13RSA_PublicKey27create_x509_verification_opERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE:
  755|  1.41k|                                                                                 std::string_view provider) const {
  756|  1.41k|   if(provider == "base" || provider.empty()) {
  ------------------
  |  Branch (756:7): [True: 0, False: 1.41k]
  |  Branch (756:29): [True: 1.41k, False: 0]
  ------------------
  757|  1.41k|      return std::make_unique<RSA_Verify_Operation>(*this, parse_rsa_signature_algorithm(alg_id));
  758|  1.41k|   }
  759|       |
  760|      0|   throw Provider_Not_Found(algo_name(), provider);
  761|  1.41k|}
_ZNK5Botan15RSA_Public_Data5get_nEv:
   46|  1.08k|      const BigInt& get_n() const { return m_n; }
_ZNK5Botan15RSA_Public_Data19public_modulus_bitsEv:
   50|  1.36k|      size_t public_modulus_bits() const { return m_public_modulus_bits; }
rsa.cpp:_ZN5Botan12_GLOBAL__N_129parse_rsa_signature_algorithmERKNS_19AlgorithmIdentifierE:
  706|  1.41k|std::string parse_rsa_signature_algorithm(const AlgorithmIdentifier& alg_id) {
  707|  1.41k|   const auto sig_info = split_on(alg_id.oid().to_formatted_string(), '/');
  708|       |
  709|  1.41k|   if(sig_info.empty() || sig_info.size() != 2 || sig_info[0] != "RSA") {
  ------------------
  |  Branch (709:7): [True: 0, False: 1.41k]
  |  Branch (709:27): [True: 19, False: 1.39k]
  |  Branch (709:51): [True: 0, False: 1.39k]
  ------------------
  710|     19|      throw Decoding_Error("Unknown AlgorithmIdentifier for RSA X.509 signatures");
  711|     19|   }
  712|       |
  713|  1.39k|   std::string padding = sig_info[1];
  714|       |
  715|  1.39k|   if(padding == "EMSA4") {
  ------------------
  |  Branch (715:7): [True: 5, False: 1.39k]
  ------------------
  716|       |      // "MUST contain RSASSA-PSS-params"
  717|      5|      if(alg_id.parameters().empty()) {
  ------------------
  |  Branch (717:10): [True: 0, False: 5]
  ------------------
  718|      0|         throw Decoding_Error("PSS params must be provided");
  719|      0|      }
  720|       |
  721|      5|      PSS_Params pss_params(alg_id.parameters());
  722|       |
  723|       |      // hash_algo must be SHA1, SHA2-224, SHA2-256, SHA2-384 or SHA2-512
  724|      5|      const std::string hash_algo = pss_params.hash_function();
  725|      5|      if(hash_algo != "SHA-1" && hash_algo != "SHA-224" && hash_algo != "SHA-256" && hash_algo != "SHA-384" &&
  ------------------
  |  Branch (725:10): [True: 0, False: 5]
  |  Branch (725:34): [True: 0, False: 0]
  |  Branch (725:60): [True: 0, False: 0]
  |  Branch (725:86): [True: 0, False: 0]
  ------------------
  726|      5|         hash_algo != "SHA-512") {
  ------------------
  |  Branch (726:10): [True: 0, False: 0]
  ------------------
  727|      0|         throw Decoding_Error("Unacceptable hash for PSS signatures");
  728|      0|      }
  729|       |
  730|      5|      if(pss_params.mgf_function() != "MGF1") {
  ------------------
  |  Branch (730:10): [True: 0, False: 5]
  ------------------
  731|      0|         throw Decoding_Error("Unacceptable MGF for PSS signatures");
  732|      0|      }
  733|       |
  734|       |      // For MGF1, it is strongly RECOMMENDED that the underlying hash
  735|       |      // function be the same as the one identified by hashAlgorithm
  736|       |      //
  737|       |      // Must be SHA1, SHA2-224, SHA2-256, SHA2-384 or SHA2-512
  738|      5|      if(pss_params.hash_algid() != pss_params.mgf_hash_algid()) {
  ------------------
  |  Branch (738:10): [True: 0, False: 5]
  ------------------
  739|      0|         throw Decoding_Error("Unacceptable MGF hash for PSS signatures");
  740|      0|      }
  741|       |
  742|      5|      if(pss_params.trailer_field() != 1) {
  ------------------
  |  Branch (742:10): [True: 0, False: 5]
  ------------------
  743|      0|         throw Decoding_Error("Unacceptable trailer field for PSS signatures");
  744|      0|      }
  745|       |
  746|      5|      padding += fmt("({},MGF1,{})", hash_algo, pss_params.salt_length());
  747|      5|   }
  748|       |
  749|  1.39k|   return padding;
  750|  1.39k|}
_ZN5Botan15RSA_Public_DataC2EONS_6BigIntES2_:
   38|  1.43k|            m_public_modulus_bytes(m_n.bytes()) {}
rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Public_OperationC2ERKNS_13RSA_PublicKeyE:
  587|  1.39k|      explicit RSA_Public_Operation(const RSA_PublicKey& rsa) : m_public(rsa.public_data()) {}
rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Public_Operation20public_modulus_bytesEv:
  600|  1.10k|      size_t public_modulus_bytes() const { return m_public->public_modulus_bytes(); }
_ZNK5Botan15RSA_Public_Data20public_modulus_bytesEv:
   52|  1.10k|      size_t public_modulus_bytes() const { return m_public_modulus_bytes; }
rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Public_Operation19public_modulus_bitsEv:
  589|  1.07k|      size_t public_modulus_bits() const { return m_public->public_modulus_bits(); }
rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Public_Operation9public_opERKNS_6BigIntE:
  592|  1.08k|      BigInt public_op(const BigInt& m) const {
  593|  1.08k|         if(m >= m_public->get_n()) {
  ------------------
  |  Branch (593:13): [True: 15, False: 1.07k]
  ------------------
  594|     15|            throw Decoding_Error("RSA public op - input is too large");
  595|     15|         }
  596|       |
  597|  1.07k|         return m_public->public_op(m);
  598|  1.08k|      }
_ZNK5Botan15RSA_Public_Data9public_opERKNS_6BigIntE:
   40|  1.07k|      BigInt public_op(const BigInt& m) const {
   41|  1.07k|         const size_t powm_window = 1;
   42|  1.07k|         auto powm_m_n = monty_precompute(m_monty_n, m, powm_window, false);
   43|  1.07k|         return monty_execute_vartime(*powm_m_n, m_e);
   44|  1.07k|      }
rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_OperationC2ERKNS_13RSA_PublicKeyENSt3__117basic_string_viewIcNS5_11char_traitsIcEEEE:
  638|  1.39k|            RSA_Public_Operation(rsa), m_emsa(EMSA::create_or_throw(padding)) {}
rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_Operation6updateEPKhm:
  629|  1.10k|      void update(const uint8_t msg[], size_t msg_len) override { m_emsa->update(msg, msg_len); }
rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_Operation18is_valid_signatureEPKhm:
  631|  1.10k|      bool is_valid_signature(const uint8_t sig[], size_t sig_len) override {
  632|  1.10k|         const auto msg = m_emsa->raw_data();
  633|  1.10k|         const auto message_repr = recover_message_repr(sig, sig_len);
  634|  1.10k|         return m_emsa->verify(message_repr, msg, public_modulus_bits() - 1);
  635|  1.10k|      }
rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_Operation20recover_message_reprEPKhm:
  643|  1.10k|      std::vector<uint8_t> recover_message_repr(const uint8_t input[], size_t input_len) {
  644|  1.10k|         if(input_len > public_modulus_bytes()) {
  ------------------
  |  Branch (644:13): [True: 17, False: 1.08k]
  ------------------
  645|     17|            throw Decoding_Error("RSA signature too large to be valid for this key");
  646|     17|         }
  647|  1.08k|         BigInt input_bn(input, input_len);
  648|  1.08k|         return BigInt::encode(public_op(input_bn));
  649|  1.10k|      }
rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Verify_Operation13hash_functionEv:
  640|     12|      std::string hash_function() const override { return m_emsa->hash_function(); }

_ZN5Botan14if_work_factorEm:
   34|    290|size_t if_work_factor(size_t bits) {
   35|    290|   if(bits < 512) {
  ------------------
  |  Branch (35:7): [True: 146, False: 144]
  ------------------
   36|    146|      return 0;
   37|    146|   }
   38|       |
   39|       |   // RFC 3766 estimates k at .02 and o(1) to be effectively zero for sizes of interest
   40|       |
   41|    144|   const double log2_k = -5.6438;  // log2(.02)
   42|    144|   return nfs_workfactor(bits, log2_k);
   43|    290|}
workfactor.cpp:_ZN5Botan12_GLOBAL__N_114nfs_workfactorEmd:
   18|    144|size_t nfs_workfactor(size_t bits, double log2_k) {
   19|       |   // approximates natural logarithm of an integer of given bitsize
   20|    144|   const double log2_e = 1.44269504088896340736;
   21|    144|   const double log_p = bits / log2_e;
   22|       |
   23|    144|   const double log_log_p = std::log(log_p);
   24|       |
   25|       |   // RFC 3766: k * e^((1.92 + o(1)) * cubrt(ln(n) * (ln(ln(n)))^2))
   26|    144|   const double est = 1.92 * std::pow(log_p * log_log_p * log_log_p, 1.0 / 3.0);
   27|       |
   28|       |   // return log2 of the workfactor
   29|    144|   return static_cast<size_t>(log2_k + log2_e * est);
   30|    144|}

_ZN5Botan4X5098load_keyERNS_10DataSourceE:
   26|  3.62k|std::unique_ptr<Public_Key> load_key(DataSource& source) {
   27|  3.62k|   try {
   28|  3.62k|      AlgorithmIdentifier alg_id;
   29|  3.62k|      std::vector<uint8_t> key_bits;
   30|       |
   31|  3.62k|      if(ASN1::maybe_BER(source) && !PEM_Code::matches(source)) {
  ------------------
  |  Branch (31:10): [True: 3.62k, False: 0]
  |  Branch (31:37): [True: 3.62k, False: 0]
  ------------------
   32|  3.62k|         BER_Decoder(source).start_sequence().decode(alg_id).decode(key_bits, ASN1_Type::BitString).end_cons();
   33|  3.62k|      } else {
   34|      0|         DataSource_Memory ber(PEM_Code::decode_check_label(source, "PUBLIC KEY"));
   35|       |
   36|      0|         BER_Decoder(ber).start_sequence().decode(alg_id).decode(key_bits, ASN1_Type::BitString).end_cons();
   37|      0|      }
   38|       |
   39|  3.62k|      if(key_bits.empty()) {
  ------------------
  |  Branch (39:10): [True: 21, False: 3.60k]
  ------------------
   40|     21|         throw Decoding_Error("X.509 public key decoding");
   41|     21|      }
   42|       |
   43|  3.60k|      return load_public_key(alg_id, key_bits);
   44|  3.62k|   } catch(Decoding_Error& e) {
   45|  1.37k|      throw Decoding_Error("X.509 public key decoding", e);
   46|  1.37k|   }
   47|  3.62k|}

_ZN5Botan22throw_invalid_argumentEPKcS1_S1_:
   21|     91|void throw_invalid_argument(const char* message, const char* func, const char* file) {
   22|     91|   throw Invalid_Argument(fmt("{} in {}:{}", message, func, file));
   23|     91|}

_ZN5Botan14calendar_pointC2ERKNSt3__16chrono10time_pointINS2_12system_clockENS2_8durationIxNS1_5ratioILl1ELl1000000EEEEEEE:
  100|    551|calendar_point::calendar_point(const std::chrono::system_clock::time_point& time_point) {
  101|    551|   std::tm tm = do_gmtime(std::chrono::system_clock::to_time_t(time_point));
  102|       |
  103|    551|   m_year = tm.tm_year + 1900;
  104|    551|   m_month = tm.tm_mon + 1;
  105|    551|   m_day = tm.tm_mday;
  106|    551|   m_hour = tm.tm_hour;
  107|    551|   m_minutes = tm.tm_min;
  108|    551|   m_seconds = tm.tm_sec;
  109|    551|}
calendar.cpp:_ZN5Botan12_GLOBAL__N_19do_gmtimeEl:
   20|    551|std::tm do_gmtime(std::time_t time_val) {
   21|    551|   std::tm tm;
   22|       |
   23|       |#if defined(BOTAN_TARGET_OS_HAS_WIN32)
   24|       |   ::gmtime_s(&tm, &time_val);  // Windows
   25|       |#elif defined(BOTAN_TARGET_OS_HAS_POSIX1)
   26|    551|   ::gmtime_r(&time_val, &tm);  // Unix/SUSv2
   27|       |#else
   28|       |   std::tm* tm_p = std::gmtime(&time_val);
   29|       |   if(tm_p == nullptr)
   30|       |      throw Encoding_Error("time_t_to_tm could not convert");
   31|       |   tm = *tm_p;
   32|       |#endif
   33|       |
   34|    551|   return tm;
   35|    551|}

_ZN5Botan12ucs2_to_utf8EPKhm:
   54|  3.06k|std::string ucs2_to_utf8(const uint8_t ucs2[], size_t len) {
   55|  3.06k|   if(len % 2 != 0) {
  ------------------
  |  Branch (55:7): [True: 5, False: 3.05k]
  ------------------
   56|      5|      throw Decoding_Error("Invalid length for UCS-2 string");
   57|      5|   }
   58|       |
   59|  3.05k|   const size_t chars = len / 2;
   60|       |
   61|  3.05k|   std::string s;
   62|  7.32k|   for(size_t i = 0; i != chars; ++i) {
  ------------------
  |  Branch (62:22): [True: 4.26k, False: 3.05k]
  ------------------
   63|  4.26k|      const uint32_t c = load_be<uint16_t>(ucs2, i);
   64|  4.26k|      append_utf8_for(s, c);
   65|  4.26k|   }
   66|       |
   67|  3.05k|   return s;
   68|  3.06k|}
_ZN5Botan12ucs4_to_utf8EPKhm:
   70|    154|std::string ucs4_to_utf8(const uint8_t ucs4[], size_t len) {
   71|    154|   if(len % 4 != 0) {
  ------------------
  |  Branch (71:7): [True: 11, False: 143]
  ------------------
   72|     11|      throw Decoding_Error("Invalid length for UCS-4 string");
   73|     11|   }
   74|       |
   75|    143|   const size_t chars = len / 4;
   76|       |
   77|    143|   std::string s;
   78|    339|   for(size_t i = 0; i != chars; ++i) {
  ------------------
  |  Branch (78:22): [True: 196, False: 143]
  ------------------
   79|    196|      const uint32_t c = load_be<uint32_t>(ucs4, i);
   80|    196|      append_utf8_for(s, c);
   81|    196|   }
   82|       |
   83|    143|   return s;
   84|    154|}
_ZN5Botan14latin1_to_utf8EPKhm:
   89|    806|std::string latin1_to_utf8(const uint8_t chars[], size_t len) {
   90|    806|   std::string s;
   91|  9.55k|   for(size_t i = 0; i != len; ++i) {
  ------------------
  |  Branch (91:22): [True: 8.74k, False: 806]
  ------------------
   92|  8.74k|      const uint32_t c = static_cast<uint8_t>(chars[i]);
   93|  8.74k|      append_utf8_for(s, c);
   94|  8.74k|   }
   95|    806|   return s;
   96|    806|}
_ZN5Botan23format_char_for_displayEc:
   98|     39|std::string format_char_for_display(char c) {
   99|     39|   std::ostringstream oss;
  100|       |
  101|     39|   oss << "'";
  102|       |
  103|     39|   if(c == '\t') {
  ------------------
  |  Branch (103:7): [True: 0, False: 39]
  ------------------
  104|      0|      oss << "\\t";
  105|     39|   } else if(c == '\n') {
  ------------------
  |  Branch (105:14): [True: 0, False: 39]
  ------------------
  106|      0|      oss << "\\n";
  107|     39|   } else if(c == '\r') {
  ------------------
  |  Branch (107:14): [True: 0, False: 39]
  ------------------
  108|      0|      oss << "\\r";
  109|     39|   } else if(static_cast<unsigned char>(c) >= 128) {
  ------------------
  |  Branch (109:14): [True: 16, False: 23]
  ------------------
  110|     16|      unsigned char z = static_cast<unsigned char>(c);
  111|     16|      oss << "\\x" << std::hex << std::uppercase << static_cast<int>(z);
  112|     23|   } else {
  113|     23|      oss << c;
  114|     23|   }
  115|       |
  116|     39|   oss << "'";
  117|       |
  118|     39|   return oss.str();
  119|     39|}
charset.cpp:_ZN5Botan12_GLOBAL__N_115append_utf8_forERNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEj:
   18|  13.2k|void append_utf8_for(std::string& s, uint32_t c) {
   19|  13.2k|   if(c >= 0xD800 && c < 0xE000) {
  ------------------
  |  Branch (19:7): [True: 428, False: 12.7k]
  |  Branch (19:22): [True: 22, False: 406]
  ------------------
   20|     22|      throw Decoding_Error("Invalid Unicode character");
   21|     22|   }
   22|       |
   23|  13.1k|   if(c <= 0x7F) {
  ------------------
  |  Branch (23:7): [True: 9.63k, False: 3.55k]
  ------------------
   24|  9.63k|      const uint8_t b0 = static_cast<uint8_t>(c);
   25|  9.63k|      s.push_back(static_cast<char>(b0));
   26|  9.63k|   } else if(c <= 0x7FF) {
  ------------------
  |  Branch (26:14): [True: 1.87k, False: 1.68k]
  ------------------
   27|  1.87k|      const uint8_t b0 = 0xC0 | static_cast<uint8_t>(c >> 6);
   28|  1.87k|      const uint8_t b1 = 0x80 | static_cast<uint8_t>(c & 0x3F);
   29|  1.87k|      s.push_back(static_cast<char>(b0));
   30|  1.87k|      s.push_back(static_cast<char>(b1));
   31|  1.87k|   } else if(c <= 0xFFFF) {
  ------------------
  |  Branch (31:14): [True: 1.51k, False: 170]
  ------------------
   32|  1.51k|      const uint8_t b0 = 0xE0 | static_cast<uint8_t>(c >> 12);
   33|  1.51k|      const uint8_t b1 = 0x80 | static_cast<uint8_t>((c >> 6) & 0x3F);
   34|  1.51k|      const uint8_t b2 = 0x80 | static_cast<uint8_t>(c & 0x3F);
   35|  1.51k|      s.push_back(static_cast<char>(b0));
   36|  1.51k|      s.push_back(static_cast<char>(b1));
   37|  1.51k|      s.push_back(static_cast<char>(b2));
   38|  1.51k|   } else if(c <= 0x10FFFF) {
  ------------------
  |  Branch (38:14): [True: 93, False: 77]
  ------------------
   39|     93|      const uint8_t b0 = 0xF0 | static_cast<uint8_t>(c >> 18);
   40|     93|      const uint8_t b1 = 0x80 | static_cast<uint8_t>((c >> 12) & 0x3F);
   41|     93|      const uint8_t b2 = 0x80 | static_cast<uint8_t>((c >> 6) & 0x3F);
   42|     93|      const uint8_t b3 = 0x80 | static_cast<uint8_t>(c & 0x3F);
   43|     93|      s.push_back(static_cast<char>(b0));
   44|     93|      s.push_back(static_cast<char>(b1));
   45|     93|      s.push_back(static_cast<char>(b2));
   46|     93|      s.push_back(static_cast<char>(b3));
   47|     93|   } else {
   48|     77|      throw Decoding_Error("Invalid Unicode character");
   49|     77|   }
   50|  13.1k|}

_ZN5Botan5CPUID10CPUID_DataC2Ev:
  120|      1|CPUID::CPUID_Data::CPUID_Data() {
  121|      1|   m_processor_features = 0;
  122|       |
  123|      1|#if defined(BOTAN_TARGET_CPU_IS_PPC_FAMILY) || defined(BOTAN_TARGET_CPU_IS_ARM_FAMILY) || \
  124|      1|   defined(BOTAN_TARGET_CPU_IS_X86_FAMILY)
  125|       |
  126|      1|   m_processor_features = detect_cpu_features();
  127|       |
  128|      1|#endif
  129|       |
  130|      1|   m_processor_features |= CPUID::CPUID_INITIALIZED_BIT;
  131|       |
  132|      1|   if(runtime_check_if_big_endian()) {
  ------------------
  |  Branch (132:7): [True: 0, False: 1]
  ------------------
  133|      0|      m_processor_features |= CPUID::CPUID_IS_BIG_ENDIAN_BIT;
  134|      0|   }
  135|       |
  136|      1|   std::string clear_cpuid_env;
  137|      1|   if(OS::read_env_variable(clear_cpuid_env, "BOTAN_CLEAR_CPUID")) {
  ------------------
  |  Branch (137:7): [True: 0, False: 1]
  ------------------
  138|      0|      for(const auto& cpuid : split_on(clear_cpuid_env, ',')) {
  ------------------
  |  Branch (138:29): [True: 0, False: 0]
  ------------------
  139|      0|         for(auto& bit : CPUID::bit_from_string(cpuid)) {
  ------------------
  |  Branch (139:24): [True: 0, False: 0]
  ------------------
  140|      0|            const uint32_t cleared = ~static_cast<uint32_t>(bit);
  141|      0|            m_processor_features &= cleared;
  142|      0|         }
  143|      0|      }
  144|      0|   }
  145|      1|}
cpuid.cpp:_ZN5Botan12_GLOBAL__N_127runtime_check_if_big_endianEv:
   93|      1|bool runtime_check_if_big_endian() {
   94|       |   // Check runtime endian
   95|      1|   const uint32_t endian32 = 0x01234567;
   96|      1|   const uint8_t* e8 = reinterpret_cast<const uint8_t*>(&endian32);
   97|       |
   98|      1|   bool is_big_endian = false;
   99|       |
  100|      1|   if(e8[0] == 0x01 && e8[1] == 0x23 && e8[2] == 0x45 && e8[3] == 0x67) {
  ------------------
  |  Branch (100:7): [True: 0, False: 1]
  |  Branch (100:24): [True: 0, False: 0]
  |  Branch (100:41): [True: 0, False: 0]
  |  Branch (100:58): [True: 0, False: 0]
  ------------------
  101|      0|      is_big_endian = true;
  102|      1|   } else if(e8[0] == 0x67 && e8[1] == 0x45 && e8[2] == 0x23 && e8[3] == 0x01) {
  ------------------
  |  Branch (102:14): [True: 1, False: 0]
  |  Branch (102:31): [True: 1, False: 0]
  |  Branch (102:48): [True: 1, False: 0]
  |  Branch (102:65): [True: 1, False: 0]
  ------------------
  103|      1|      is_big_endian = false;
  104|      1|   } else {
  105|      0|      throw Internal_Error("Unexpected endian at runtime, neither big nor little");
  106|      0|   }
  107|       |
  108|       |   // If we were compiled with a known endian, verify it matches at runtime
  109|      1|#if defined(BOTAN_TARGET_CPU_IS_LITTLE_ENDIAN)
  110|      1|   BOTAN_ASSERT(!is_big_endian, "Build and runtime endian match");
  ------------------
  |  |   51|      1|   do {                                                                                 \
  |  |   52|      1|      if(!(expr))                                                                       \
  |  |  ------------------
  |  |  |  Branch (52:10): [True: 0, False: 1]
  |  |  ------------------
  |  |   53|      1|         Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \
  |  |   54|      1|   } while(0)
  |  |  ------------------
  |  |  |  Branch (54:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  111|       |#elif defined(BOTAN_TARGET_CPU_IS_BIG_ENDIAN)
  112|       |   BOTAN_ASSERT(is_big_endian, "Build and runtime endian match");
  113|       |#endif
  114|       |
  115|      1|   return is_big_endian;
  116|      1|}

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

_ZN5Botan10DataSource9read_byteERh:
   25|  6.85M|size_t DataSource::read_byte(uint8_t& out) { return read(&out, 1); }
_ZNK5Botan10DataSource9peek_byteERh:
   30|  12.8k|size_t DataSource::peek_byte(uint8_t& out) const { return peek(&out, 1, 0); }
_ZN5Botan10DataSource12discard_nextEm:
   35|  27.5k|size_t DataSource::discard_next(size_t n) {
   36|  27.5k|   uint8_t buf[64] = {0};
   37|  27.5k|   size_t discarded = 0;
   38|       |
   39|  88.2k|   while(n) {
  ------------------
  |  Branch (39:10): [True: 60.9k, False: 27.3k]
  ------------------
   40|  60.9k|      const size_t got = this->read(buf, std::min(n, sizeof(buf)));
   41|  60.9k|      discarded += got;
   42|  60.9k|      n -= got;
   43|       |
   44|  60.9k|      if(got == 0) {
  ------------------
  |  Branch (44:10): [True: 174, False: 60.7k]
  ------------------
   45|    174|         break;
   46|    174|      }
   47|  60.9k|   }
   48|       |
   49|  27.5k|   return discarded;
   50|  27.5k|}
_ZN5Botan17DataSource_Memory4readEPhm:
   55|  2.57M|size_t DataSource_Memory::read(uint8_t out[], size_t length) {
   56|  2.57M|   const size_t got = std::min<size_t>(m_source.size() - m_offset, length);
   57|  2.57M|   copy_mem(out, m_source.data() + m_offset, got);
   58|  2.57M|   m_offset += got;
   59|  2.57M|   return got;
   60|  2.57M|}
_ZN5Botan17DataSource_Memory15check_availableEm:
   62|   114k|bool DataSource_Memory::check_available(size_t n) { return (n <= (m_source.size() - m_offset)); }
_ZNK5Botan17DataSource_Memory4peekEPhmm:
   67|  33.5k|size_t DataSource_Memory::peek(uint8_t out[], size_t length, size_t peek_offset) const {
   68|  33.5k|   const size_t bytes_left = m_source.size() - m_offset;
   69|  33.5k|   if(peek_offset >= bytes_left) {
  ------------------
  |  Branch (69:7): [True: 7.93k, False: 25.6k]
  ------------------
   70|  7.93k|      return 0;
   71|  7.93k|   }
   72|       |
   73|  25.6k|   const size_t got = std::min(bytes_left - peek_offset, length);
   74|  25.6k|   copy_mem(out, &m_source[m_offset + peek_offset], got);
   75|  25.6k|   return got;
   76|  33.5k|}
_ZNK5Botan17DataSource_Memory11end_of_dataEv:
   81|  56.6k|bool DataSource_Memory::end_of_data() const { return (m_offset == m_source.size()); }

_ZN5Botan9ExceptionC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   71|  9.25k|Exception::Exception(std::string_view msg) : m_msg(msg) {}
_ZN5Botan9ExceptionC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKSt9exception:
   73|  4.53k|Exception::Exception(std::string_view msg, const std::exception& e) : m_msg(fmt("{} failed with {}", msg, e.what())) {}
_ZN5Botan9ExceptionC2EPKcNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
   75|  2.53k|Exception::Exception(const char* prefix, std::string_view msg) : m_msg(fmt("{} {}", prefix, msg)) {}
_ZN5Botan16Invalid_ArgumentC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   77|    484|Invalid_Argument::Invalid_Argument(std::string_view msg) : Exception(msg) {}
_ZN5Botan19Algorithm_Not_FoundC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  115|    291|      Lookup_Error(fmt("Could not find any algorithm named '{}'", name)) {}
_ZN5Botan14Encoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  123|    496|Encoding_Error::Encoding_Error(std::string_view name) : Exception("Encoding error:", name) {}
_ZN5Botan14Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  125|  8.45k|Decoding_Error::Decoding_Error(std::string_view name) : Exception(name) {}
_ZN5Botan14Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKSt9exception:
  130|  4.53k|Decoding_Error::Decoding_Error(std::string_view msg, const std::exception& e) : Exception(msg, e) {}
_ZN5Botan15Stream_IO_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  135|  2.03k|Stream_IO_Error::Stream_IO_Error(std::string_view err) : Exception("I/O error:", err) {}

_ZN5Botan15allocate_memoryEmm:
   20|  1.66M|BOTAN_MALLOC_FN void* allocate_memory(size_t elems, size_t elem_size) {
   21|  1.66M|   if(elems == 0 || elem_size == 0) {
  ------------------
  |  Branch (21:7): [True: 0, False: 1.66M]
  |  Branch (21:21): [True: 0, False: 1.66M]
  ------------------
   22|      0|      return nullptr;
   23|      0|   }
   24|       |
   25|       |   // Some calloc implementations do not check for overflow (?!?)
   26|       |
   27|  1.66M|   if(!BOTAN_CHECKED_MUL(elems, elem_size).has_value()) {
  ------------------
  |  |   73|  1.66M|#define BOTAN_CHECKED_MUL(x, y) checked_mul(x, y)
  ------------------
  |  Branch (27:7): [True: 0, False: 1.66M]
  ------------------
   28|      0|      throw std::bad_alloc();
   29|      0|   }
   30|       |
   31|       |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR)
   32|       |   if(void* p = mlock_allocator::instance().allocate(elems, elem_size)) {
   33|       |      return p;
   34|       |   }
   35|       |#endif
   36|       |
   37|       |#if defined(BOTAN_TARGET_OS_HAS_ALLOC_CONCEAL)
   38|       |   void* ptr = ::calloc_conceal(elems, elem_size);
   39|       |#else
   40|  1.66M|   void* ptr = std::calloc(elems, elem_size);  // NOLINT(*-no-malloc)
   41|  1.66M|#endif
   42|  1.66M|   if(!ptr) {
  ------------------
  |  Branch (42:7): [True: 0, False: 1.66M]
  ------------------
   43|      0|      [[unlikely]] throw std::bad_alloc();
   44|      0|   }
   45|  1.66M|   return ptr;
   46|  1.66M|}
_ZN5Botan17deallocate_memoryEPvmm:
   48|  1.66M|void deallocate_memory(void* p, size_t elems, size_t elem_size) {
   49|  1.66M|   if(p == nullptr) {
  ------------------
  |  Branch (49:7): [True: 0, False: 1.66M]
  ------------------
   50|      0|      [[unlikely]] return;
   51|      0|   }
   52|       |
   53|  1.66M|   secure_scrub_memory(p, elems * elem_size);
   54|       |
   55|       |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR)
   56|       |   if(mlock_allocator::instance().deallocate(p, elems, elem_size)) {
   57|       |      return;
   58|       |   }
   59|       |#endif
   60|       |
   61|  1.66M|   std::free(p);  // NOLINT(*-no-malloc)
   62|  1.66M|}
_ZN5Botan20initialize_allocatorEv:
   64|      1|void initialize_allocator() {
   65|       |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR)
   66|       |   mlock_allocator::instance();
   67|       |#endif
   68|      1|}

_ZN5Botan19secure_scrub_memoryEPvm:
   78|  1.66M|void secure_scrub_memory(void* ptr, size_t n) {
   79|       |#if defined(BOTAN_TARGET_OS_HAS_RTLSECUREZEROMEMORY)
   80|       |   ::RtlSecureZeroMemory(ptr, n);
   81|       |
   82|       |#elif defined(BOTAN_TARGET_OS_HAS_EXPLICIT_BZERO)
   83|  1.66M|   ::explicit_bzero(ptr, n);
   84|       |
   85|       |#elif defined(BOTAN_TARGET_OS_HAS_EXPLICIT_MEMSET)
   86|       |   (void)::explicit_memset(ptr, 0, n);
   87|       |
   88|       |#elif defined(BOTAN_USE_VOLATILE_MEMSET_FOR_ZERO) && (BOTAN_USE_VOLATILE_MEMSET_FOR_ZERO == 1)
   89|       |   /*
   90|       |   Call memset through a static volatile pointer, which the compiler
   91|       |   should not elide. This construct should be safe in conforming
   92|       |   compilers, but who knows. I did confirm that on x86-64 GCC 6.1 and
   93|       |   Clang 3.8 both create code that saves the memset address in the
   94|       |   data segment and unconditionally loads and jumps to that address.
   95|       |   */
   96|       |   static void* (*const volatile memset_ptr)(void*, int, size_t) = std::memset;
   97|       |   (memset_ptr)(ptr, 0, n);
   98|       |#else
   99|       |
  100|       |   volatile uint8_t* p = reinterpret_cast<volatile uint8_t*>(ptr);
  101|       |
  102|       |   for(size_t i = 0; i != n; ++i)
  103|       |      p[i] = 0;
  104|       |#endif
  105|  1.66M|}
_ZN5Botan2OS10get_auxvalEm:
  119|      1|unsigned long OS::get_auxval(unsigned long id) {
  120|      1|#if defined(BOTAN_TARGET_OS_HAS_GETAUXVAL)
  121|      1|   return ::getauxval(id);
  122|       |#elif defined(BOTAN_TARGET_OS_IS_ANDROID) && defined(BOTAN_TARGET_ARCH_IS_ARM32)
  123|       |
  124|       |   if(id == 0)
  125|       |      return 0;
  126|       |
  127|       |   char** p = environ;
  128|       |
  129|       |   while(*p++ != nullptr)
  130|       |      ;
  131|       |
  132|       |   Elf32_auxv_t* e = reinterpret_cast<Elf32_auxv_t*>(p);
  133|       |
  134|       |   while(e != nullptr) {
  135|       |      if(e->a_type == id)
  136|       |         return e->a_un.a_val;
  137|       |      e++;
  138|       |   }
  139|       |
  140|       |   return 0;
  141|       |#elif defined(BOTAN_TARGET_OS_HAS_ELF_AUX_INFO)
  142|       |   unsigned long auxinfo = 0;
  143|       |   ::elf_aux_info(static_cast<int>(id), &auxinfo, sizeof(auxinfo));
  144|       |   return auxinfo;
  145|       |#elif defined(BOTAN_TARGET_OS_HAS_AUXINFO)
  146|       |   for(const AuxInfo* auxinfo = static_cast<AuxInfo*>(::_dlauxinfo()); auxinfo != AT_NULL; ++auxinfo) {
  147|       |      if(id == auxinfo->a_type)
  148|       |         return auxinfo->a_v;
  149|       |   }
  150|       |
  151|       |   return 0;
  152|       |#else
  153|       |   BOTAN_UNUSED(id);
  154|       |   return 0;
  155|       |#endif
  156|      1|}
_ZN5Botan2OS27running_in_privileged_stateEv:
  158|      1|bool OS::running_in_privileged_state() {
  159|      1|#if defined(AT_SECURE)
  160|      1|   return OS::get_auxval(AT_SECURE) != 0;
  161|       |#elif defined(BOTAN_TARGET_OS_HAS_POSIX1)
  162|       |   return (::getuid() != ::geteuid()) || (::getgid() != ::getegid());
  163|       |#else
  164|       |   return false;
  165|       |#endif
  166|      1|}
_ZN5Botan2OS17read_env_variableERNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EE:
  400|      1|bool OS::read_env_variable(std::string& value_out, std::string_view name_view) {
  401|      1|   value_out = "";
  402|       |
  403|      1|   if(running_in_privileged_state()) {
  ------------------
  |  Branch (403:7): [True: 0, False: 1]
  ------------------
  404|      0|      return false;
  405|      0|   }
  406|       |
  407|       |#if defined(BOTAN_TARGET_OS_HAS_WIN32) && defined(BOTAN_BUILD_COMPILER_IS_MSVC)
  408|       |   const std::string name(name_view);
  409|       |   char val[128] = {0};
  410|       |   size_t req_size = 0;
  411|       |   if(getenv_s(&req_size, val, sizeof(val), name.c_str()) == 0) {
  412|       |      value_out = std::string(val, req_size);
  413|       |      return true;
  414|       |   }
  415|       |#else
  416|      1|   const std::string name(name_view);
  417|      1|   if(const char* val = std::getenv(name.c_str())) {
  ------------------
  |  Branch (417:19): [True: 0, False: 1]
  ------------------
  418|      0|      value_out = val;
  419|      0|      return true;
  420|      0|   }
  421|      1|#endif
  422|       |
  423|      1|   return false;
  424|      1|}

_ZN5Botan9to_u32bitENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE:
   32|   909k|uint32_t to_u32bit(std::string_view str_view) {
   33|   909k|   const std::string str(str_view);
   34|       |
   35|       |   // std::stoul is not strict enough. Ensure that str is digit only [0-9]*
   36|  1.33M|   for(const char chr : str) {
  ------------------
  |  Branch (36:23): [True: 1.33M, False: 909k]
  ------------------
   37|  1.33M|      if(chr < '0' || chr > '9') {
  ------------------
  |  Branch (37:10): [True: 12, False: 1.33M]
  |  Branch (37:23): [True: 7, False: 1.33M]
  ------------------
   38|     19|         throw Invalid_Argument("to_u32bit invalid decimal string '" + str + "'");
   39|     19|      }
   40|  1.33M|   }
   41|       |
   42|   909k|   const unsigned long int x = std::stoul(str);
   43|       |
   44|   909k|   if constexpr(sizeof(unsigned long int) > 4) {
  ------------------
  |  Branch (44:17): [Folded - Ignored]
  ------------------
   45|       |      // x might be uint64
   46|   909k|      if(x > std::numeric_limits<uint32_t>::max()) {
  ------------------
  |  Branch (46:10): [True: 0, False: 909k]
  ------------------
   47|      0|         throw Invalid_Argument("Integer value of " + str + " exceeds 32 bit range");
   48|      0|      }
   49|   909k|   }
   50|       |
   51|   909k|   return static_cast<uint32_t>(x);
   52|   909k|}
_ZN5Botan8split_onENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEc:
  111|  5.43k|std::vector<std::string> split_on(std::string_view str, char delim) {
  112|  5.43k|   std::vector<std::string> elems;
  113|  5.43k|   if(str.empty()) {
  ------------------
  |  Branch (113:7): [True: 0, False: 5.43k]
  ------------------
  114|      0|      return elems;
  115|      0|   }
  116|       |
  117|  5.43k|   std::string substr;
  118|  68.5k|   for(auto i = str.begin(); i != str.end(); ++i) {
  ------------------
  |  Branch (118:30): [True: 63.1k, False: 5.43k]
  ------------------
  119|  63.1k|      if(*i == delim) {
  ------------------
  |  Branch (119:10): [True: 2.13k, False: 60.9k]
  ------------------
  120|  2.13k|         if(!substr.empty()) {
  ------------------
  |  Branch (120:13): [True: 2.13k, False: 0]
  ------------------
  121|  2.13k|            elems.push_back(substr);
  122|  2.13k|         }
  123|  2.13k|         substr.clear();
  124|  60.9k|      } else {
  125|  60.9k|         substr += *i;
  126|  60.9k|      }
  127|  63.1k|   }
  128|       |
  129|  5.43k|   if(substr.empty()) {
  ------------------
  |  Branch (129:7): [True: 0, False: 5.43k]
  ------------------
  130|      0|      throw Invalid_Argument(fmt("Unable to split string '{}", str));
  131|      0|   }
  132|  5.43k|   elems.push_back(substr);
  133|       |
  134|  5.43k|   return elems;
  135|  5.43k|}
_ZN5Botan14ipv4_to_stringEj:
  181|  3.78k|std::string ipv4_to_string(uint32_t ip) {
  182|  3.78k|   std::string str;
  183|  3.78k|   uint8_t bits[4];
  184|  3.78k|   store_be(ip, bits);
  185|       |
  186|  18.9k|   for(size_t i = 0; i != 4; ++i) {
  ------------------
  |  Branch (186:22): [True: 15.1k, False: 3.78k]
  ------------------
  187|  15.1k|      if(i > 0) {
  ------------------
  |  Branch (187:10): [True: 11.3k, False: 3.78k]
  ------------------
  188|  11.3k|         str += ".";
  189|  11.3k|      }
  190|  15.1k|      str += std::to_string(bits[i]);
  191|  15.1k|   }
  192|       |
  193|  3.78k|   return str;
  194|  3.78k|}

_ZN5Botan9SCAN_NameC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
   58|  1.39k|SCAN_Name::SCAN_Name(std::string_view algo_spec) : m_orig_algo_spec(algo_spec), m_alg_name(), m_args(), m_mode_info() {
   59|  1.39k|   if(algo_spec.empty()) {
  ------------------
  |  Branch (59:7): [True: 0, False: 1.39k]
  ------------------
   60|      0|      throw Invalid_Argument("Expected algorithm name, got empty string");
   61|      0|   }
   62|       |
   63|  1.39k|   std::vector<std::pair<size_t, std::string>> name;
   64|  1.39k|   size_t level = 0;
   65|  1.39k|   std::pair<size_t, std::string> accum = std::make_pair(level, "");
   66|       |
   67|  1.39k|   const std::string decoding_error = "Bad SCAN name '" + m_orig_algo_spec + "': ";
   68|       |
   69|  16.8k|   for(char c : algo_spec) {
  ------------------
  |  Branch (69:15): [True: 16.8k, False: 1.39k]
  ------------------
   70|  16.8k|      if(c == '/' || c == ',' || c == '(' || c == ')') {
  ------------------
  |  Branch (70:10): [True: 0, False: 16.8k]
  |  Branch (70:22): [True: 0, False: 16.8k]
  |  Branch (70:34): [True: 1.10k, False: 15.7k]
  |  Branch (70:46): [True: 1.10k, False: 14.6k]
  ------------------
   71|  2.20k|         if(c == '(') {
  ------------------
  |  Branch (71:13): [True: 1.10k, False: 1.10k]
  ------------------
   72|  1.10k|            ++level;
   73|  1.10k|         } else if(c == ')') {
  ------------------
  |  Branch (73:20): [True: 1.10k, False: 0]
  ------------------
   74|  1.10k|            if(level == 0) {
  ------------------
  |  Branch (74:16): [True: 0, False: 1.10k]
  ------------------
   75|      0|               throw Decoding_Error(decoding_error + "Mismatched parens");
   76|      0|            }
   77|  1.10k|            --level;
   78|  1.10k|         }
   79|       |
   80|  2.20k|         if(c == '/' && level > 0) {
  ------------------
  |  Branch (80:13): [True: 0, False: 2.20k]
  |  Branch (80:25): [True: 0, False: 0]
  ------------------
   81|      0|            accum.second.push_back(c);
   82|  2.20k|         } else {
   83|  2.20k|            if(!accum.second.empty()) {
  ------------------
  |  Branch (83:16): [True: 2.20k, False: 0]
  ------------------
   84|  2.20k|               name.push_back(accum);
   85|  2.20k|            }
   86|  2.20k|            accum = std::make_pair(level, "");
   87|  2.20k|         }
   88|  14.6k|      } else {
   89|  14.6k|         accum.second.push_back(c);
   90|  14.6k|      }
   91|  16.8k|   }
   92|       |
   93|  1.39k|   if(!accum.second.empty()) {
  ------------------
  |  Branch (93:7): [True: 291, False: 1.10k]
  ------------------
   94|    291|      name.push_back(accum);
   95|    291|   }
   96|       |
   97|  1.39k|   if(level != 0) {
  ------------------
  |  Branch (97:7): [True: 0, False: 1.39k]
  ------------------
   98|      0|      throw Decoding_Error(decoding_error + "Missing close paren");
   99|      0|   }
  100|       |
  101|  1.39k|   if(name.empty()) {
  ------------------
  |  Branch (101:7): [True: 0, False: 1.39k]
  ------------------
  102|      0|      throw Decoding_Error(decoding_error + "Empty name");
  103|      0|   }
  104|       |
  105|  1.39k|   m_alg_name = name[0].second;
  106|       |
  107|  1.39k|   bool in_modes = false;
  108|       |
  109|  2.49k|   for(size_t i = 1; i != name.size(); ++i) {
  ------------------
  |  Branch (109:22): [True: 1.10k, False: 1.39k]
  ------------------
  110|  1.10k|      if(name[i].first == 0) {
  ------------------
  |  Branch (110:10): [True: 0, False: 1.10k]
  ------------------
  111|      0|         m_mode_info.push_back(make_arg(name, i));
  112|      0|         in_modes = true;
  113|  1.10k|      } else if(name[i].first == 1 && !in_modes) {
  ------------------
  |  Branch (113:17): [True: 1.10k, False: 0]
  |  Branch (113:39): [True: 1.10k, False: 0]
  ------------------
  114|  1.10k|         m_args.push_back(make_arg(name, i));
  115|  1.10k|      }
  116|  1.10k|   }
  117|  1.39k|}
_ZNK5Botan9SCAN_Name3argEm:
  119|  2.20k|std::string SCAN_Name::arg(size_t i) const {
  120|  2.20k|   if(i >= arg_count()) {
  ------------------
  |  Branch (120:7): [True: 0, False: 2.20k]
  ------------------
  121|      0|      throw Invalid_Argument("SCAN_Name::arg " + std::to_string(i) + " out of range for '" + to_string() + "'");
  122|      0|   }
  123|  2.20k|   return m_args[i];
  124|  2.20k|}
scan_name.cpp:_ZN5Botan12_GLOBAL__N_18make_argERKNSt3__16vectorINS1_4pairImNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEENS7_ISA_EEEEm:
   17|  1.10k|std::string make_arg(const std::vector<std::pair<size_t, std::string>>& name, size_t start) {
   18|  1.10k|   std::string output = name[start].second;
   19|  1.10k|   size_t level = name[start].first;
   20|       |
   21|  1.10k|   size_t paren_depth = 0;
   22|       |
   23|  1.10k|   for(size_t i = start + 1; i != name.size(); ++i) {
  ------------------
  |  Branch (23:30): [True: 0, False: 1.10k]
  ------------------
   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|  1.10k|   for(size_t i = 0; i != paren_depth; ++i) {
  ------------------
  |  Branch (47:22): [True: 0, False: 1.10k]
  ------------------
   48|      0|      output += ")";
   49|      0|   }
   50|       |
   51|  1.10k|   return output;
   52|  1.10k|}

_ZN5Botan15AlternativeNameC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_S5_S5_:
   27|  13.9k|                                 std::string_view ip) {
   28|  13.9k|   add_attribute("RFC822", email_addr);
   29|  13.9k|   add_attribute("DNS", dns);
   30|  13.9k|   add_attribute("URI", uri);
   31|  13.9k|   add_attribute("IP", ip);
   32|  13.9k|}
_ZN5Botan15AlternativeName13add_attributeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_:
   37|  65.2k|void AlternativeName::add_attribute(std::string_view type, std::string_view value) {
   38|  65.2k|   if(type.empty() || value.empty()) {
  ------------------
  |  Branch (38:7): [True: 0, False: 65.2k]
  |  Branch (38:23): [True: 56.3k, False: 8.86k]
  ------------------
   39|  56.3k|      return;
   40|  56.3k|   }
   41|       |
   42|  8.86k|   auto range = m_alt_info.equal_range(type);
   43|  72.4k|   for(auto j = range.first; j != range.second; ++j) {
  ------------------
  |  Branch (43:30): [True: 67.3k, False: 5.14k]
  ------------------
   44|  67.3k|      if(j->second == value) {
  ------------------
  |  Branch (44:10): [True: 3.72k, False: 63.5k]
  ------------------
   45|  3.72k|         return;
   46|  3.72k|      }
   47|  67.3k|   }
   48|       |
   49|  5.14k|   m_alt_info.emplace(type, value);
   50|  5.14k|}
_ZN5Botan15AlternativeName13add_othernameERKNS_3OIDENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEENS_9ASN1_TypeE:
   55|    641|void AlternativeName::add_othername(const OID& oid, std::string_view value, ASN1_Type type) {
   56|    641|   if(value.empty()) {
  ------------------
  |  Branch (56:7): [True: 80, False: 561]
  ------------------
   57|     80|      return;
   58|     80|   }
   59|    561|   multimap_insert(m_othernames, oid, ASN1_String(value, type));
   60|    561|}
_ZNK5Botan15AlternativeName8contentsEv:
   65|    277|std::multimap<std::string, std::string> AlternativeName::contents() const {
   66|    277|   std::multimap<std::string, std::string> names;
   67|       |
   68|  1.00k|   for(const auto& name : m_alt_info) {
  ------------------
  |  Branch (68:25): [True: 1.00k, False: 277]
  ------------------
   69|  1.00k|      names.emplace(name.first, name.second);
   70|  1.00k|   }
   71|       |
   72|    277|   for(const auto& othername : m_othernames) {
  ------------------
  |  Branch (72:30): [True: 203, False: 277]
  ------------------
   73|    203|      multimap_insert(names, othername.first.to_formatted_string(), othername.second.value());
   74|    203|   }
   75|       |
   76|    277|   return names;
   77|    277|}
_ZN5Botan15AlternativeName11decode_fromERNS_11BER_DecoderE:
  177|  1.69k|void AlternativeName::decode_from(BER_Decoder& source) {
  178|  1.69k|   BER_Decoder names = source.start_sequence();
  179|       |
  180|       |   // FIXME this is largely a duplication of GeneralName::decode_from
  181|       |
  182|  23.4k|   while(names.more_items()) {
  ------------------
  |  Branch (182:10): [True: 21.7k, False: 1.67k]
  ------------------
  183|  21.7k|      BER_Object obj = names.get_next_object();
  184|       |
  185|  21.7k|      if(obj.is_a(0, ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (185:10): [True: 1.02k, False: 20.7k]
  ------------------
  186|  1.02k|         BER_Decoder othername(obj);
  187|       |
  188|  1.02k|         OID oid;
  189|  1.02k|         othername.decode(oid);
  190|  1.02k|         if(othername.more_items()) {
  ------------------
  |  Branch (190:13): [True: 864, False: 160]
  ------------------
  191|    864|            BER_Object othername_value_outer = othername.get_next_object();
  192|    864|            othername.verify_end();
  193|       |
  194|    864|            if(othername_value_outer.is_a(0, ASN1_Class::ExplicitContextSpecific) == false) {
  ------------------
  |  Branch (194:16): [True: 12, False: 852]
  ------------------
  195|     12|               throw Decoding_Error("Invalid tags on otherName value");
  196|     12|            }
  197|       |
  198|    852|            BER_Decoder othername_value_inner(othername_value_outer);
  199|       |
  200|    852|            BER_Object value = othername_value_inner.get_next_object();
  201|    852|            othername_value_inner.verify_end();
  202|       |
  203|    852|            if(ASN1_String::is_string_type(value.type()) && value.get_class() == ASN1_Class::Universal) {
  ------------------
  |  Branch (203:16): [True: 704, False: 148]
  |  Branch (203:61): [True: 641, False: 63]
  ------------------
  204|    641|               add_othername(oid, ASN1::to_string(value), value.type());
  205|    641|            }
  206|    852|         }
  207|  1.02k|      }
  208|  21.7k|      if(obj.is_a(1, ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (208:10): [True: 2.38k, False: 19.3k]
  ------------------
  209|  2.38k|         add_attribute("RFC822", ASN1::to_string(obj));
  210|  19.3k|      } else if(obj.is_a(2, ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (210:17): [True: 1.80k, False: 17.5k]
  ------------------
  211|  1.80k|         add_attribute("DNS", ASN1::to_string(obj));
  212|  17.5k|      } else if(obj.is_a(6, ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (212:17): [True: 817, False: 16.7k]
  ------------------
  213|    817|         add_attribute("URI", ASN1::to_string(obj));
  214|  16.7k|      } else if(obj.is_a(4, ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) {
  ------------------
  |  Branch (214:17): [True: 973, False: 15.7k]
  ------------------
  215|    973|         BER_Decoder dec(obj);
  216|    973|         X509_DN dn;
  217|    973|         std::stringstream ss;
  218|       |
  219|    973|         dec.decode(dn);
  220|    973|         ss << dn;
  221|       |
  222|    973|         add_attribute("DN", ss.str());
  223|  15.7k|      } else if(obj.is_a(7, ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (223:17): [True: 4.00k, False: 11.7k]
  ------------------
  224|  4.00k|         if(obj.length() == 4) {
  ------------------
  |  Branch (224:13): [True: 3.73k, False: 271]
  ------------------
  225|  3.73k|            const uint32_t ip = load_be<uint32_t>(obj.bits(), 0);
  226|  3.73k|            add_attribute("IP", ipv4_to_string(ip));
  227|  3.73k|         }
  228|  4.00k|      }
  229|  21.7k|   }
  230|  1.69k|}

_ZN5Botan17Certificate_StoreD2Ev:
   18|  2.22k|Certificate_Store::~Certificate_Store() = default;
_ZN5Botan27Certificate_Store_In_Memory15add_certificateERKNS_16X509_CertificateE:
   36|    775|void Certificate_Store_In_Memory::add_certificate(const X509_Certificate& cert) {
   37|    775|   for(const auto& c : m_certs) {
  ------------------
  |  Branch (37:22): [True: 0, False: 775]
  ------------------
   38|      0|      if(c == cert) {
  ------------------
  |  Branch (38:10): [True: 0, False: 0]
  ------------------
   39|      0|         return;
   40|      0|      }
   41|      0|   }
   42|       |
   43|    775|   m_certs.push_back(cert);
   44|    775|}
_ZNK5Botan27Certificate_Store_In_Memory14find_all_certsERKNS_7X509_DNERKNSt3__16vectorIhNS4_9allocatorIhEEEE:
   76|  1.62k|                                                                          const std::vector<uint8_t>& key_id) const {
   77|  1.62k|   std::vector<X509_Certificate> matches;
   78|       |
   79|  1.62k|   for(const auto& cert : m_certs) {
  ------------------
  |  Branch (79:25): [True: 810, False: 1.62k]
  ------------------
   80|    810|      if(!key_id.empty()) {
  ------------------
  |  Branch (80:10): [True: 31, False: 779]
  ------------------
   81|     31|         const std::vector<uint8_t>& skid = cert.subject_key_id();
   82|       |
   83|     31|         if(!skid.empty() && skid != key_id) {  // no match
  ------------------
  |  Branch (83:13): [True: 18, False: 13]
  |  Branch (83:30): [True: 14, False: 4]
  ------------------
   84|     14|            continue;
   85|     14|         }
   86|     31|      }
   87|       |
   88|    796|      if(cert.subject_dn() == subject_dn) {
  ------------------
  |  Branch (88:10): [True: 666, False: 130]
  ------------------
   89|    666|         matches.push_back(cert);
   90|    666|      }
   91|    796|   }
   92|       |
   93|  1.62k|   return matches;
   94|  1.62k|}
_ZNK5Botan27Certificate_Store_In_Memory12find_crl_forERKNS_16X509_CertificateE:
  149|    302|std::optional<X509_CRL> Certificate_Store_In_Memory::find_crl_for(const X509_Certificate& subject) const {
  150|    302|   const std::vector<uint8_t>& key_id = subject.authority_key_id();
  151|       |
  152|    302|   for(const auto& c : m_crls) {
  ------------------
  |  Branch (152:22): [True: 0, False: 302]
  ------------------
  153|       |      // Only compare key ids if set in both call and in the CRL
  154|      0|      if(!key_id.empty()) {
  ------------------
  |  Branch (154:10): [True: 0, False: 0]
  ------------------
  155|      0|         const std::vector<uint8_t>& akid = c.authority_key_id();
  156|       |
  157|      0|         if(!akid.empty() && akid != key_id) {  // no match
  ------------------
  |  Branch (157:13): [True: 0, False: 0]
  |  Branch (157:30): [True: 0, False: 0]
  ------------------
  158|      0|            continue;
  159|      0|         }
  160|      0|      }
  161|       |
  162|      0|      if(c.issuer_dn() == subject.issuer_dn()) {
  ------------------
  |  Branch (162:10): [True: 0, False: 0]
  ------------------
  163|      0|         return c;
  164|      0|      }
  165|      0|   }
  166|       |
  167|    302|   return {};
  168|    302|}
_ZN5Botan27Certificate_Store_In_MemoryC2ERKNS_16X509_CertificateE:
  170|    775|Certificate_Store_In_Memory::Certificate_Store_In_Memory(const X509_Certificate& cert) { add_certificate(cert); }

_ZN5Botan11GeneralName11decode_fromERNS_11BER_DecoderE:
   34|    453|void GeneralName::decode_from(BER_Decoder& ber) {
   35|    453|   BER_Object obj = ber.get_next_object();
   36|       |
   37|    453|   if(obj.is_a(1, ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (37:7): [True: 110, False: 343]
  ------------------
   38|    110|      m_type = "RFC822";
   39|    110|      m_name = ASN1::to_string(obj);
   40|    343|   } else if(obj.is_a(2, ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (40:14): [True: 112, False: 231]
  ------------------
   41|    112|      m_type = "DNS";
   42|    112|      m_name = ASN1::to_string(obj);
   43|    231|   } else if(obj.is_a(6, ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (43:14): [True: 49, False: 182]
  ------------------
   44|     49|      m_type = "URI";
   45|     49|      m_name = ASN1::to_string(obj);
   46|    182|   } else if(obj.is_a(4, ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) {
  ------------------
  |  Branch (46:14): [True: 63, False: 119]
  ------------------
   47|     63|      m_type = "DN";
   48|     63|      X509_DN dn;
   49|     63|      BER_Decoder dec(obj);
   50|     63|      std::stringstream ss;
   51|       |
   52|     63|      dn.decode_from(dec);
   53|     63|      ss << dn;
   54|       |
   55|     63|      m_name = ss.str();
   56|    119|   } else if(obj.is_a(7, ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (56:14): [True: 53, False: 66]
  ------------------
   57|     53|      if(obj.length() == 8) {
  ------------------
  |  Branch (57:10): [True: 26, False: 27]
  ------------------
   58|     26|         m_type = "IP";
   59|     26|         m_name =
   60|     26|            ipv4_to_string(load_be<uint32_t>(obj.bits(), 0)) + "/" + ipv4_to_string(load_be<uint32_t>(obj.bits(), 1));
   61|     27|      } else if(obj.length() == 32) {
  ------------------
  |  Branch (61:17): [True: 1, False: 26]
  ------------------
   62|      1|         throw Decoding_Error("Unsupported IPv6 name constraint");
   63|     26|      } else {
   64|     26|         throw Decoding_Error("Invalid IP name constraint size " + std::to_string(obj.length()));
   65|     26|      }
   66|     66|   } else {
   67|     66|      throw Decoding_Error("Found unknown GeneralName type");
   68|     66|   }
   69|    453|}
_ZN5Botan14GeneralSubtree11decode_fromERNS_11BER_DecoderE:
  200|    511|void GeneralSubtree::decode_from(BER_Decoder& ber) {
  201|    511|   ber.start_sequence()
  202|    511|      .decode(m_base)
  203|    511|      .decode_optional(m_minimum, ASN1_Type(0), ASN1_Class::ContextSpecific, size_t(0))
  204|    511|      .end_cons();
  205|       |
  206|    511|   if(m_minimum != 0) {
  ------------------
  |  Branch (206:7): [True: 6, False: 505]
  ------------------
  207|      6|      throw Decoding_Error("GeneralSubtree minimum must be 0");
  208|      6|   }
  209|       |
  210|    505|   m_maximum = std::numeric_limits<std::size_t>::max();
  211|    505|}

_ZN5Botan7X509_DN13add_attributeERKNS_3OIDERKNS_11ASN1_StringE:
   96|  34.8k|void X509_DN::add_attribute(const OID& oid, const ASN1_String& str) {
   97|  34.8k|   if(str.empty()) {
  ------------------
  |  Branch (97:7): [True: 180, False: 34.6k]
  ------------------
   98|    180|      return;
   99|    180|   }
  100|       |
  101|  34.6k|   m_rdn.push_back(std::make_pair(oid, str));
  102|  34.6k|   m_dn_bits.clear();
  103|  34.6k|}
_ZNK5Botan7X509_DN14get_attributesEv:
  108|  11.0k|std::multimap<OID, std::string> X509_DN::get_attributes() const {
  109|  11.0k|   std::multimap<OID, std::string> retval;
  110|       |
  111|  37.0k|   for(auto& i : m_rdn) {
  ------------------
  |  Branch (111:16): [True: 37.0k, False: 11.0k]
  ------------------
  112|  37.0k|      multimap_insert(retval, i.first, i.second.value());
  113|  37.0k|   }
  114|  11.0k|   return retval;
  115|  11.0k|}
_ZN5BotaneqERKNS_7X509_DNES2_:
  216|  5.51k|bool operator==(const X509_DN& dn1, const X509_DN& dn2) {
  217|  5.51k|   auto attr1 = dn1.get_attributes();
  218|  5.51k|   auto attr2 = dn2.get_attributes();
  219|       |
  220|  5.51k|   if(attr1.size() != attr2.size()) {
  ------------------
  |  Branch (220:7): [True: 371, False: 5.13k]
  ------------------
  221|    371|      return false;
  222|    371|   }
  223|       |
  224|  5.13k|   auto p1 = attr1.begin();
  225|  5.13k|   auto p2 = attr2.begin();
  226|       |
  227|  20.3k|   while(true) {
  ------------------
  |  Branch (227:10): [Folded - Ignored]
  ------------------
  228|  20.3k|      if(p1 == attr1.end() && p2 == attr2.end()) {
  ------------------
  |  Branch (228:10): [True: 4.50k, False: 15.8k]
  |  Branch (228:10): [True: 4.50k, False: 15.8k]
  |  Branch (228:31): [True: 4.50k, False: 0]
  ------------------
  229|  4.50k|         break;
  230|  4.50k|      }
  231|  15.8k|      if(p1 == attr1.end()) {
  ------------------
  |  Branch (231:10): [True: 0, False: 15.8k]
  ------------------
  232|      0|         return false;
  233|      0|      }
  234|  15.8k|      if(p2 == attr2.end()) {
  ------------------
  |  Branch (234:10): [True: 0, False: 15.8k]
  ------------------
  235|      0|         return false;
  236|      0|      }
  237|  15.8k|      if(p1->first != p2->first) {
  ------------------
  |  Branch (237:10): [True: 379, False: 15.4k]
  ------------------
  238|    379|         return false;
  239|    379|      }
  240|  15.4k|      if(!x500_name_cmp(p1->second, p2->second)) {
  ------------------
  |  Branch (240:10): [True: 258, False: 15.2k]
  ------------------
  241|    258|         return false;
  242|    258|      }
  243|  15.2k|      ++p1;
  244|  15.2k|      ++p2;
  245|  15.2k|   }
  246|  4.50k|   return true;
  247|  5.13k|}
_ZN5BotanneERKNS_7X509_DNES2_:
  252|    702|bool operator!=(const X509_DN& dn1, const X509_DN& dn2) { return !(dn1 == dn2); }
_ZN5Botan7X509_DN11decode_fromERNS_11BER_DecoderE:
  341|  11.1k|void X509_DN::decode_from(BER_Decoder& source) {
  342|  11.1k|   std::vector<uint8_t> bits;
  343|       |
  344|  11.1k|   source.start_sequence().raw_bytes(bits).end_cons();
  345|       |
  346|  11.1k|   BER_Decoder sequence(bits);
  347|       |
  348|  11.1k|   m_rdn.clear();
  349|       |
  350|  46.4k|   while(sequence.more_items()) {
  ------------------
  |  Branch (350:10): [True: 35.2k, False: 11.1k]
  ------------------
  351|  35.2k|      BER_Decoder rdn = sequence.start_set();
  352|       |
  353|  70.4k|      while(rdn.more_items()) {
  ------------------
  |  Branch (353:13): [True: 35.2k, False: 35.2k]
  ------------------
  354|  35.2k|         OID oid;
  355|  35.2k|         ASN1_String str;
  356|       |
  357|  35.2k|         rdn.start_sequence()
  358|  35.2k|            .decode(oid)
  359|  35.2k|            .decode(str)  // TODO support Any
  360|  35.2k|            .end_cons();
  361|       |
  362|  35.2k|         add_attribute(oid, str);
  363|  35.2k|      }
  364|  35.2k|   }
  365|       |
  366|       |   // Have to assign last as add_attribute zaps m_dn_bits
  367|  11.1k|   m_dn_bits = bits;
  368|  11.1k|}
_ZN5BotanlsERNSt3__113basic_ostreamIcNS0_11char_traitsIcEEEERKNS_7X509_DNE:
  402|    852|std::ostream& operator<<(std::ostream& out, const X509_DN& dn) {
  403|    852|   auto info = dn.dn_info();
  404|       |
  405|  3.40k|   for(size_t i = 0; i != info.size(); ++i) {
  ------------------
  |  Branch (405:22): [True: 2.55k, False: 852]
  ------------------
  406|  2.55k|      out << to_short_form(info[i].first) << "=\"";
  407|  21.7k|      for(char c : info[i].second.value()) {
  ------------------
  |  Branch (407:18): [True: 21.7k, False: 2.55k]
  ------------------
  408|  21.7k|         if(c == '\\' || c == '\"') {
  ------------------
  |  Branch (408:13): [True: 95, False: 21.6k]
  |  Branch (408:26): [True: 246, False: 21.3k]
  ------------------
  409|    341|            out << "\\";
  410|    341|         }
  411|  21.7k|         out << c;
  412|  21.7k|      }
  413|  2.55k|      out << "\"";
  414|       |
  415|  2.55k|      if(i + 1 < info.size()) {
  ------------------
  |  Branch (415:10): [True: 1.84k, False: 706]
  ------------------
  416|  1.84k|         out << ",";
  417|  1.84k|      }
  418|  2.55k|   }
  419|    852|   return out;
  420|    852|}
x509_dn.cpp:_ZN5Botan12_GLOBAL__N_113x500_name_cmpENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_:
   34|  15.4k|bool x500_name_cmp(std::string_view name1, std::string_view name2) {
   35|  15.4k|   auto p1 = name1.begin();
   36|  15.4k|   auto p2 = name2.begin();
   37|       |
   38|  15.5k|   while((p1 != name1.end()) && is_space(*p1)) {
  ------------------
  |  Branch (38:10): [True: 15.5k, False: 16]
  |  Branch (38:33): [True: 107, False: 15.4k]
  ------------------
   39|    107|      ++p1;
   40|    107|   }
   41|  15.6k|   while((p2 != name2.end()) && is_space(*p2)) {
  ------------------
  |  Branch (41:10): [True: 15.5k, False: 18]
  |  Branch (41:33): [True: 138, False: 15.4k]
  ------------------
   42|    138|      ++p2;
   43|    138|   }
   44|       |
   45|   147k|   while(p1 != name1.end() && p2 != name2.end()) {
  ------------------
  |  Branch (45:10): [True: 132k, False: 15.2k]
  |  Branch (45:31): [True: 132k, False: 26]
  ------------------
   46|   132k|      if(is_space(*p1)) {
  ------------------
  |  Branch (46:10): [True: 3.18k, False: 129k]
  ------------------
   47|  3.18k|         if(!is_space(*p2)) {
  ------------------
  |  Branch (47:13): [True: 8, False: 3.17k]
  ------------------
   48|      8|            return false;
   49|      8|         }
   50|       |
   51|  6.42k|         while((p1 != name1.end()) && is_space(*p1)) {
  ------------------
  |  Branch (51:16): [True: 6.41k, False: 13]
  |  Branch (51:39): [True: 3.24k, False: 3.16k]
  ------------------
   52|  3.24k|            ++p1;
   53|  3.24k|         }
   54|  6.43k|         while((p2 != name2.end()) && is_space(*p2)) {
  ------------------
  |  Branch (54:16): [True: 6.41k, False: 13]
  |  Branch (54:39): [True: 3.25k, False: 3.16k]
  ------------------
   55|  3.25k|            ++p2;
   56|  3.25k|         }
   57|       |
   58|  3.17k|         if(p1 == name1.end() && p2 == name2.end()) {
  ------------------
  |  Branch (58:13): [True: 13, False: 3.16k]
  |  Branch (58:34): [True: 7, False: 6]
  ------------------
   59|      7|            return true;
   60|      7|         }
   61|  3.17k|         if(p1 == name1.end() || p2 == name2.end()) {
  ------------------
  |  Branch (61:13): [True: 6, False: 3.16k]
  |  Branch (61:34): [True: 6, False: 3.16k]
  ------------------
   62|     12|            return false;
   63|     12|         }
   64|  3.17k|      }
   65|       |
   66|   132k|      if(!caseless_cmp(*p1, *p2)) {
  ------------------
  |  Branch (66:10): [True: 208, False: 131k]
  ------------------
   67|    208|         return false;
   68|    208|      }
   69|   131k|      ++p1;
   70|   131k|      ++p2;
   71|   131k|   }
   72|       |
   73|  15.2k|   while((p1 != name1.end()) && is_space(*p1)) {
  ------------------
  |  Branch (73:10): [True: 40, False: 15.2k]
  |  Branch (73:33): [True: 24, False: 16]
  ------------------
   74|     24|      ++p1;
   75|     24|   }
   76|  15.2k|   while((p2 != name2.end()) && is_space(*p2)) {
  ------------------
  |  Branch (76:10): [True: 34, False: 15.2k]
  |  Branch (76:33): [True: 20, False: 14]
  ------------------
   77|     20|      ++p2;
   78|     20|   }
   79|       |
   80|  15.2k|   if((p1 != name1.end()) || (p2 != name2.end())) {
  ------------------
  |  Branch (80:7): [True: 16, False: 15.2k]
  |  Branch (80:30): [True: 14, False: 15.1k]
  ------------------
   81|     30|      return false;
   82|     30|   }
   83|  15.1k|   return true;
   84|  15.2k|}
x509_dn.cpp:_ZN5Botan12_GLOBAL__N_112_GLOBAL__N_18is_spaceEc:
   27|   179k|bool is_space(char c) { return std::isspace(static_cast<unsigned char>(c)); }
x509_dn.cpp:_ZN5Botan12_GLOBAL__N_112_GLOBAL__N_112caseless_cmpEcc:
   23|   132k|bool caseless_cmp(char a, char b) {
   24|   132k|   return (std::tolower(static_cast<unsigned char>(a)) == std::tolower(static_cast<unsigned char>(b)));
   25|   132k|}
x509_dn.cpp:_ZN5Botan12_GLOBAL__N_113to_short_formERKNS_3OIDE:
  372|  2.55k|std::string to_short_form(const OID& oid) {
  373|  2.55k|   std::string long_id = oid.to_formatted_string();
  374|       |
  375|  2.55k|   if(long_id == "X520.CommonName") {
  ------------------
  |  Branch (375:7): [True: 102, False: 2.45k]
  ------------------
  376|    102|      return "CN";
  377|    102|   }
  378|       |
  379|  2.45k|   if(long_id == "X520.Country") {
  ------------------
  |  Branch (379:7): [True: 311, False: 2.14k]
  ------------------
  380|    311|      return "C";
  381|    311|   }
  382|       |
  383|  2.14k|   if(long_id == "X520.Organization") {
  ------------------
  |  Branch (383:7): [True: 101, False: 2.03k]
  ------------------
  384|    101|      return "O";
  385|    101|   }
  386|       |
  387|  2.03k|   if(long_id == "X520.OrganizationalUnit") {
  ------------------
  |  Branch (387:7): [True: 398, False: 1.64k]
  ------------------
  388|    398|      return "OU";
  389|    398|   }
  390|       |
  391|  1.64k|   return long_id;
  392|  2.03k|}

_ZN5Botan7X509_DN9lookup_ubERKNS_3OIDE:
   48|  1.70k|size_t X509_DN::lookup_ub(const OID& oid) {
   49|  1.70k|   auto ub_entry = DN_UB.find(oid);
   50|  1.70k|   if(ub_entry != DN_UB.end()) {
  ------------------
  |  Branch (50:7): [True: 1.27k, False: 427]
  ------------------
   51|  1.27k|      return ub_entry->second;
   52|  1.27k|   } else {
   53|    427|      return 0;
   54|    427|   }
   55|  1.70k|}

_ZN5Botan10Extensions15create_extn_objERKNS_3OIDEbRKNSt3__16vectorIhNS4_9allocatorIhEEEE:
   93|  14.3k|                                                                   const std::vector<uint8_t>& body) {
   94|  14.3k|   const std::string oid_str = oid.to_string();
   95|       |
   96|  14.3k|   auto extn = extension_from_oid(oid);
   97|       |
   98|  14.3k|   if(!extn) {
  ------------------
  |  Branch (98:7): [True: 7.78k, False: 6.58k]
  ------------------
   99|       |      // some other unknown extension type
  100|  7.78k|      extn = std::make_unique<Cert_Extension::Unknown_Extension>(oid, critical);
  101|  7.78k|   }
  102|       |
  103|  14.3k|   try {
  104|  14.3k|      extn->decode_inner(body);
  105|  14.3k|   } catch(Decoding_Error&) {
  106|  3.91k|      extn = std::make_unique<Cert_Extension::Unknown_Extension>(oid, critical);
  107|  3.91k|      extn->decode_inner(body);
  108|  3.91k|   }
  109|  14.3k|   return extn;
  110|  14.3k|}
_ZN5Botan21Certificate_Extension8validateERKNS_16X509_CertificateES3_RKNSt3__16vectorIS1_NS4_9allocatorIS1_EEEERNS5_INS4_3setINS_23Certificate_Status_CodeENS4_4lessISC_EENS6_ISC_EEEENS6_ISG_EEEEm:
  119|    119|                                     size_t /*unused*/) {}
_ZNK5Botan10Extensions20get_extension_objectERKNS_3OIDE:
  188|  44.1k|const Certificate_Extension* Extensions::get_extension_object(const OID& oid) const {
  189|  44.1k|   auto extn = m_extension_info.find(oid);
  190|  44.1k|   if(extn == m_extension_info.end()) {
  ------------------
  |  Branch (190:7): [True: 41.5k, False: 2.61k]
  ------------------
  191|  41.5k|      return nullptr;
  192|  41.5k|   }
  193|       |
  194|  2.61k|   return &extn->second.obj();
  195|  44.1k|}
_ZNK5Botan10Extensions10extensionsEv:
  204|    302|std::vector<std::pair<std::unique_ptr<Certificate_Extension>, bool>> Extensions::extensions() const {
  205|    302|   std::vector<std::pair<std::unique_ptr<Certificate_Extension>, bool>> exts;
  206|    302|   exts.reserve(m_extension_info.size());
  207|    535|   for(auto&& ext : m_extension_info) {
  ------------------
  |  Branch (207:19): [True: 535, False: 302]
  ------------------
  208|    535|      exts.push_back(std::make_pair(ext.second.obj().copy(), ext.second.is_critical()));
  209|    535|   }
  210|    302|   return exts;
  211|    302|}
_ZN5Botan10Extensions11decode_fromERNS_11BER_DecoderE:
  245|  3.37k|void Extensions::decode_from(BER_Decoder& from_source) {
  246|  3.37k|   m_extension_oids.clear();
  247|  3.37k|   m_extension_info.clear();
  248|       |
  249|  3.37k|   BER_Decoder sequence = from_source.start_sequence();
  250|       |
  251|  18.3k|   while(sequence.more_items()) {
  ------------------
  |  Branch (251:10): [True: 14.9k, False: 3.37k]
  ------------------
  252|  14.9k|      OID oid;
  253|  14.9k|      bool critical;
  254|  14.9k|      std::vector<uint8_t> bits;
  255|       |
  256|  14.9k|      sequence.start_sequence()
  257|  14.9k|         .decode(oid)
  258|  14.9k|         .decode_optional(critical, ASN1_Type::Boolean, ASN1_Class::Universal, false)
  259|  14.9k|         .decode(bits, ASN1_Type::OctetString)
  260|  14.9k|         .end_cons();
  261|       |
  262|  14.9k|      auto obj = create_extn_obj(oid, critical, bits);
  263|  14.9k|      Extensions_Info info(critical, bits, std::move(obj));
  264|       |
  265|  14.9k|      m_extension_oids.push_back(oid);
  266|  14.9k|      m_extension_info.emplace(oid, info);
  267|  14.9k|   }
  268|  3.37k|   sequence.verify_end();
  269|  3.37k|}
_ZNK5Botan14Cert_Extension17Basic_Constraints14get_path_limitEv:
  276|    246|size_t Basic_Constraints::get_path_limit() const {
  277|    246|   if(!m_is_ca) {
  ------------------
  |  Branch (277:7): [True: 0, False: 246]
  ------------------
  278|      0|      throw Invalid_State("Basic_Constraints::get_path_limit: Not a CA");
  279|      0|   }
  280|    246|   return m_path_limit;
  281|    246|}
_ZN5Botan14Cert_Extension17Basic_Constraints12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  298|    801|void Basic_Constraints::decode_inner(const std::vector<uint8_t>& in) {
  299|    801|   BER_Decoder(in)
  300|    801|      .start_sequence()
  301|    801|      .decode_optional(m_is_ca, ASN1_Type::Boolean, ASN1_Class::Universal, false)
  302|    801|      .decode_optional(m_path_limit, ASN1_Type::Integer, ASN1_Class::Universal, NO_CERT_PATH_LIMIT)
  303|    801|      .end_cons();
  304|       |
  305|    801|   if(m_is_ca == false) {
  ------------------
  |  Branch (305:7): [True: 217, False: 584]
  ------------------
  306|    217|      m_path_limit = 0;
  307|    217|   }
  308|    801|}
_ZN5Botan14Cert_Extension9Key_Usage12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  336|    684|void Key_Usage::decode_inner(const std::vector<uint8_t>& in) {
  337|    684|   BER_Decoder ber(in);
  338|       |
  339|    684|   BER_Object obj = ber.get_next_object();
  340|       |
  341|    684|   obj.assert_is_a(ASN1_Type::BitString, ASN1_Class::Universal, "usage constraint");
  342|       |
  343|    684|   if(obj.length() != 2 && obj.length() != 3) {
  ------------------
  |  Branch (343:7): [True: 111, False: 573]
  |  Branch (343:28): [True: 29, False: 82]
  ------------------
  344|     29|      throw BER_Decoding_Error("Bad size for BITSTRING in usage constraint");
  345|     29|   }
  346|       |
  347|    655|   uint16_t usage = 0;
  348|       |
  349|    655|   const uint8_t* bits = obj.bits();
  350|       |
  351|    655|   if(bits[0] >= 8) {
  ------------------
  |  Branch (351:7): [True: 25, False: 630]
  ------------------
  352|     25|      throw BER_Decoding_Error("Invalid unused bits in usage constraint");
  353|     25|   }
  354|       |
  355|    630|   const uint8_t mask = static_cast<uint8_t>(0xFF << bits[0]);
  356|       |
  357|    630|   if(obj.length() == 2) {
  ------------------
  |  Branch (357:7): [True: 359, False: 271]
  ------------------
  358|    359|      usage = make_uint16(bits[1] & mask, 0);
  359|    359|   } else if(obj.length() == 3) {
  ------------------
  |  Branch (359:14): [True: 78, False: 193]
  ------------------
  360|     78|      usage = make_uint16(bits[1], bits[2] & mask);
  361|     78|   }
  362|       |
  363|    630|   m_constraints = Key_Constraints(usage);
  364|    630|}
_ZN5Botan14Cert_Extension14Subject_Key_ID12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  378|    460|void Subject_Key_ID::decode_inner(const std::vector<uint8_t>& in) {
  379|    460|   BER_Decoder(in).decode(m_key_id, ASN1_Type::OctetString).verify_end();
  380|    460|}
_ZN5Botan14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  415|    511|void Authority_Key_ID::decode_inner(const std::vector<uint8_t>& in) {
  416|    511|   BER_Decoder(in).start_sequence().decode_optional_string(m_key_id, ASN1_Type::OctetString, 0);
  417|    511|}
_ZN5Botan14Cert_Extension24Subject_Alternative_Name12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  440|    993|void Subject_Alternative_Name::decode_inner(const std::vector<uint8_t>& in) { BER_Decoder(in).decode(m_alt_name); }
_ZN5Botan14Cert_Extension23Issuer_Alternative_Name12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  445|    362|void Issuer_Alternative_Name::decode_inner(const std::vector<uint8_t>& in) { BER_Decoder(in).decode(m_alt_name); }
_ZN5Botan14Cert_Extension18Extended_Key_Usage12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  459|    626|void Extended_Key_Usage::decode_inner(const std::vector<uint8_t>& in) { BER_Decoder(in).decode_list(m_oids); }
_ZN5Botan14Cert_Extension16Name_Constraints12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  469|    542|void Name_Constraints::decode_inner(const std::vector<uint8_t>& in) {
  470|    542|   std::vector<GeneralSubtree> permit, exclude;
  471|    542|   BER_Decoder ber(in);
  472|    542|   BER_Decoder ext = ber.start_sequence();
  473|    542|   BER_Object per = ext.get_next_object();
  474|       |
  475|    542|   ext.push_back(per);
  476|    542|   if(per.is_a(0, ASN1_Class::Constructed | ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (476:7): [True: 256, False: 286]
  ------------------
  477|    256|      ext.decode_list(permit, ASN1_Type(0), ASN1_Class::Constructed | ASN1_Class::ContextSpecific);
  478|    256|      if(permit.empty()) {
  ------------------
  |  Branch (478:10): [True: 1, False: 255]
  ------------------
  479|      1|         throw Encoding_Error("Empty Name Contraint list");
  480|      1|      }
  481|    256|   }
  482|       |
  483|    541|   BER_Object exc = ext.get_next_object();
  484|    541|   ext.push_back(exc);
  485|    541|   if(per.is_a(1, ASN1_Class::Constructed | ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (485:7): [True: 65, False: 476]
  ------------------
  486|     65|      ext.decode_list(exclude, ASN1_Type(1), ASN1_Class::Constructed | ASN1_Class::ContextSpecific);
  487|     65|      if(exclude.empty()) {
  ------------------
  |  Branch (487:10): [True: 1, False: 64]
  ------------------
  488|      1|         throw Encoding_Error("Empty Name Contraint list");
  489|      1|      }
  490|     65|   }
  491|       |
  492|    540|   ext.end_cons();
  493|       |
  494|    540|   if(permit.empty() && exclude.empty()) {
  ------------------
  |  Branch (494:7): [True: 7, False: 533]
  |  Branch (494:25): [True: 6, False: 1]
  ------------------
  495|      6|      throw Encoding_Error("Empty Name Contraint extension");
  496|      6|   }
  497|       |
  498|    534|   m_name_constraints = NameConstraints(std::move(permit), std::move(exclude));
  499|    534|}
_ZN5Botan14Cert_Extension20Certificate_Policies12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  598|    361|void Certificate_Policies::decode_inner(const std::vector<uint8_t>& in) {
  599|    361|   std::vector<Policy_Information> policies;
  600|       |
  601|    361|   BER_Decoder(in).decode_list(policies);
  602|    361|   m_oids.clear();
  603|    361|   for(const auto& policy : policies) {
  ------------------
  |  Branch (603:27): [True: 130, False: 361]
  ------------------
  604|    130|      m_oids.push_back(policy.oid());
  605|    130|   }
  606|    361|}
_ZN5Botan14Cert_Extension20Certificate_Policies8validateERKNS_16X509_CertificateES4_RKNSt3__16vectorIS2_NS5_9allocatorIS2_EEEERNS6_INS5_3setINS_23Certificate_Status_CodeENS5_4lessISD_EENS7_ISD_EEEENS7_ISH_EEEEm:
  612|     10|                                    size_t pos) {
  613|     10|   std::set<OID> oid_set(m_oids.begin(), m_oids.end());
  614|     10|   if(oid_set.size() != m_oids.size()) {
  ------------------
  |  Branch (614:7): [True: 0, False: 10]
  ------------------
  615|      0|      cert_status.at(pos).insert(Certificate_Status_Code::DUPLICATE_CERT_POLICY);
  616|      0|   }
  617|     10|}
_ZN5Botan14Cert_Extension28Authority_Information_Access12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  633|    206|void Authority_Information_Access::decode_inner(const std::vector<uint8_t>& in) {
  634|    206|   BER_Decoder ber = BER_Decoder(in).start_sequence();
  635|       |
  636|    547|   while(ber.more_items()) {
  ------------------
  |  Branch (636:10): [True: 341, False: 206]
  ------------------
  637|    341|      OID oid;
  638|       |
  639|    341|      BER_Decoder info = ber.start_sequence();
  640|       |
  641|    341|      info.decode(oid);
  642|       |
  643|    341|      if(oid == OID::from_string("PKIX.OCSP")) {
  ------------------
  |  Branch (643:10): [True: 32, False: 309]
  ------------------
  644|     32|         BER_Object name = info.get_next_object();
  645|       |
  646|     32|         if(name.is_a(6, ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (646:13): [True: 17, False: 15]
  ------------------
  647|     17|            m_ocsp_responder = ASN1::to_string(name);
  648|     17|         }
  649|     32|      }
  650|    341|      if(oid == OID::from_string("PKIX.CertificateAuthorityIssuers")) {
  ------------------
  |  Branch (650:10): [True: 89, False: 252]
  ------------------
  651|     89|         BER_Object name = info.get_next_object();
  652|       |
  653|     89|         if(name.is_a(6, ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (653:13): [True: 70, False: 19]
  ------------------
  654|     70|            m_ca_issuers.push_back(ASN1::to_string(name));
  655|     70|         }
  656|     89|      }
  657|    341|   }
  658|    206|}
_ZNK5Botan14Cert_Extension10CRL_Number4copyEv:
  673|      2|std::unique_ptr<Certificate_Extension> CRL_Number::copy() const {
  674|      2|   if(!m_has_value) {
  ------------------
  |  Branch (674:7): [True: 0, False: 2]
  ------------------
  675|      0|      throw Invalid_State("CRL_Number::copy: Not set");
  676|      0|   }
  677|      2|   return std::make_unique<CRL_Number>(m_crl_number);
  678|      2|}
_ZN5Botan14Cert_Extension10CRL_Number12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  692|     66|void CRL_Number::decode_inner(const std::vector<uint8_t>& in) {
  693|     66|   BER_Decoder(in).decode(m_crl_number);
  694|     66|   m_has_value = true;
  695|     66|}
_ZN5Botan14Cert_Extension14CRL_ReasonCode12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  709|    107|void CRL_ReasonCode::decode_inner(const std::vector<uint8_t>& in) {
  710|    107|   size_t reason_code = 0;
  711|    107|   BER_Decoder(in).decode(reason_code, ASN1_Type::Enumerated, ASN1_Class::Universal);
  712|    107|   m_reason = static_cast<CRL_Code>(reason_code);
  713|    107|}
_ZN5Botan14Cert_Extension23CRL_Distribution_Points12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  719|    712|void CRL_Distribution_Points::decode_inner(const std::vector<uint8_t>& buf) {
  720|    712|   BER_Decoder(buf).decode_list(m_distribution_points).verify_end();
  721|       |
  722|    712|   std::stringstream ss;
  723|       |
  724|    712|   for(const auto& distribution_point : m_distribution_points) {
  ------------------
  |  Branch (724:39): [True: 277, False: 712]
  ------------------
  725|    277|      auto contents = distribution_point.point().contents();
  726|       |
  727|  1.20k|      for(const auto& pair : contents) {
  ------------------
  |  Branch (727:28): [True: 1.20k, False: 277]
  ------------------
  728|  1.20k|         ss << pair.first << ": " << pair.second << " ";
  729|  1.20k|      }
  730|    277|   }
  731|       |
  732|    712|   m_crl_distribution_urls.push_back(ss.str());
  733|    712|}
_ZN5Botan14Cert_Extension23CRL_Distribution_Points18Distribution_Point11decode_fromERNS_11BER_DecoderE:
  739|    713|void CRL_Distribution_Points::Distribution_Point::decode_from(BER_Decoder& ber) {
  740|    713|   ber.start_sequence()
  741|    713|      .start_context_specific(0)
  742|    713|      .decode_optional_implicit(m_point,
  743|    713|                                ASN1_Type(0),
  744|    713|                                ASN1_Class::ContextSpecific | ASN1_Class::Constructed,
  745|    713|                                ASN1_Type::Sequence,
  746|    713|                                ASN1_Class::Constructed)
  747|    713|      .end_cons()
  748|    713|      .end_cons();
  749|    713|}
_ZN5Botan14Cert_Extension30CRL_Issuing_Distribution_Point12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  755|    158|void CRL_Issuing_Distribution_Point::decode_inner(const std::vector<uint8_t>& buf) {
  756|    158|   BER_Decoder(buf).decode(m_distribution_point).verify_end();
  757|    158|}
_ZN5Botan14Cert_Extension17Unknown_Extension12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE:
  763|  11.6k|void Unknown_Extension::decode_inner(const std::vector<uint8_t>& bytes) {
  764|       |   // Just treat as an opaque blob at this level
  765|  11.6k|   m_bytes = bytes;
  766|  11.6k|}
x509_ext.cpp:_ZN5Botan12_GLOBAL__N_118extension_from_oidERKNS_3OIDE:
   26|  14.3k|std::unique_ptr<Certificate_Extension> extension_from_oid(const OID& oid) {
   27|  14.3k|   if(oid == Cert_Extension::Subject_Key_ID::static_oid()) {
  ------------------
  |  Branch (27:7): [True: 460, False: 13.9k]
  ------------------
   28|    460|      return std::make_unique<Cert_Extension::Subject_Key_ID>();
   29|    460|   }
   30|       |
   31|  13.9k|   if(oid == Cert_Extension::Key_Usage::static_oid()) {
  ------------------
  |  Branch (31:7): [True: 684, False: 13.2k]
  ------------------
   32|    684|      return std::make_unique<Cert_Extension::Key_Usage>();
   33|    684|   }
   34|       |
   35|  13.2k|   if(oid == Cert_Extension::Subject_Alternative_Name::static_oid()) {
  ------------------
  |  Branch (35:7): [True: 993, False: 12.2k]
  ------------------
   36|    993|      return std::make_unique<Cert_Extension::Subject_Alternative_Name>();
   37|    993|   }
   38|       |
   39|  12.2k|   if(oid == Cert_Extension::Issuer_Alternative_Name::static_oid()) {
  ------------------
  |  Branch (39:7): [True: 362, False: 11.8k]
  ------------------
   40|    362|      return std::make_unique<Cert_Extension::Issuer_Alternative_Name>();
   41|    362|   }
   42|       |
   43|  11.8k|   if(oid == Cert_Extension::Basic_Constraints::static_oid()) {
  ------------------
  |  Branch (43:7): [True: 801, False: 11.0k]
  ------------------
   44|    801|      return std::make_unique<Cert_Extension::Basic_Constraints>();
   45|    801|   }
   46|       |
   47|  11.0k|   if(oid == Cert_Extension::CRL_Number::static_oid()) {
  ------------------
  |  Branch (47:7): [True: 66, False: 11.0k]
  ------------------
   48|     66|      return std::make_unique<Cert_Extension::CRL_Number>();
   49|     66|   }
   50|       |
   51|  11.0k|   if(oid == Cert_Extension::CRL_ReasonCode::static_oid()) {
  ------------------
  |  Branch (51:7): [True: 107, False: 10.8k]
  ------------------
   52|    107|      return std::make_unique<Cert_Extension::CRL_ReasonCode>();
   53|    107|   }
   54|       |
   55|  10.8k|   if(oid == Cert_Extension::Authority_Key_ID::static_oid()) {
  ------------------
  |  Branch (55:7): [True: 511, False: 10.3k]
  ------------------
   56|    511|      return std::make_unique<Cert_Extension::Authority_Key_ID>();
   57|    511|   }
   58|       |
   59|  10.3k|   if(oid == Cert_Extension::Name_Constraints::static_oid()) {
  ------------------
  |  Branch (59:7): [True: 542, False: 9.84k]
  ------------------
   60|    542|      return std::make_unique<Cert_Extension::Name_Constraints>();
   61|    542|   }
   62|       |
   63|  9.84k|   if(oid == Cert_Extension::CRL_Distribution_Points::static_oid()) {
  ------------------
  |  Branch (63:7): [True: 712, False: 9.13k]
  ------------------
   64|    712|      return std::make_unique<Cert_Extension::CRL_Distribution_Points>();
   65|    712|   }
   66|       |
   67|  9.13k|   if(oid == Cert_Extension::CRL_Issuing_Distribution_Point::static_oid()) {
  ------------------
  |  Branch (67:7): [True: 158, False: 8.97k]
  ------------------
   68|    158|      return std::make_unique<Cert_Extension::CRL_Issuing_Distribution_Point>();
   69|    158|   }
   70|       |
   71|  8.97k|   if(oid == Cert_Extension::Certificate_Policies::static_oid()) {
  ------------------
  |  Branch (71:7): [True: 361, False: 8.61k]
  ------------------
   72|    361|      return std::make_unique<Cert_Extension::Certificate_Policies>();
   73|    361|   }
   74|       |
   75|  8.61k|   if(oid == Cert_Extension::Extended_Key_Usage::static_oid()) {
  ------------------
  |  Branch (75:7): [True: 626, False: 7.98k]
  ------------------
   76|    626|      return std::make_unique<Cert_Extension::Extended_Key_Usage>();
   77|    626|   }
   78|       |
   79|  7.98k|   if(oid == Cert_Extension::Authority_Information_Access::static_oid()) {
  ------------------
  |  Branch (79:7): [True: 206, False: 7.78k]
  ------------------
   80|    206|      return std::make_unique<Cert_Extension::Authority_Information_Access>();
   81|    206|   }
   82|       |
   83|  7.78k|   return nullptr;  // unknown
   84|  7.98k|}
x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_118Policy_Information11decode_fromERNS_11BER_DecoderE:
  569|    298|      void decode_from(BER_Decoder& codec) override {
  570|    298|         codec.start_sequence().decode(m_oid).discard_remaining().end_cons();
  571|    298|      }
x509_ext.cpp:_ZNK5Botan14Cert_Extension12_GLOBAL__N_118Policy_Information3oidEv:
  565|    130|      const OID& oid() const { return m_oid; }
x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_118Policy_InformationC2Ev:
  561|    298|      Policy_Information() = default;

_ZN5Botan11X509_Object9load_dataERNS_10DataSourceE:
   24|  9.21k|void X509_Object::load_data(DataSource& in) {
   25|  9.21k|   try {
   26|  9.21k|      if(ASN1::maybe_BER(in) && !PEM_Code::matches(in)) {
  ------------------
  |  Branch (26:10): [True: 5.10k, False: 4.10k]
  |  Branch (26:33): [True: 4.91k, False: 188]
  ------------------
   27|  4.91k|         BER_Decoder dec(in);
   28|  4.91k|         decode_from(dec);
   29|  4.91k|      } else {
   30|  4.29k|         std::string got_label;
   31|  4.29k|         DataSource_Memory ber(PEM_Code::decode(in, got_label));
   32|       |
   33|  4.29k|         if(got_label != PEM_label()) {
  ------------------
  |  Branch (33:13): [True: 80, False: 4.21k]
  ------------------
   34|     80|            bool is_alternate = false;
   35|     80|            for(std::string_view alt_label : alternate_PEM_labels()) {
  ------------------
  |  Branch (35:44): [True: 80, False: 80]
  ------------------
   36|     80|               if(got_label == alt_label) {
  ------------------
  |  Branch (36:19): [True: 0, False: 80]
  ------------------
   37|      0|                  is_alternate = true;
   38|      0|                  break;
   39|      0|               }
   40|     80|            }
   41|       |
   42|     80|            if(!is_alternate) {
  ------------------
  |  Branch (42:16): [True: 80, False: 0]
  ------------------
   43|     80|               throw Decoding_Error("Unexpected PEM label for " + PEM_label() + " of " + got_label);
   44|     80|            }
   45|     80|         }
   46|       |
   47|  4.21k|         BER_Decoder dec(ber);
   48|  4.21k|         decode_from(dec);
   49|  4.21k|      }
   50|  9.21k|   } catch(Decoding_Error& e) {
   51|  2.90k|      throw Decoding_Error(PEM_label() + " decoding", e);
   52|  2.90k|   }
   53|  9.21k|}
_ZNK5Botan11X509_Object11encode_intoERNS_11DER_EncoderE:
   55|  4.01k|void X509_Object::encode_into(DER_Encoder& to) const {
   56|  4.01k|   to.start_sequence()
   57|  4.01k|      .start_sequence()
   58|  4.01k|      .raw_bytes(signed_body())
   59|  4.01k|      .end_cons()
   60|  4.01k|      .encode(signature_algorithm())
   61|  4.01k|      .encode(signature(), ASN1_Type::BitString)
   62|  4.01k|      .end_cons();
   63|  4.01k|}
_ZN5Botan11X509_Object11decode_fromERNS_11BER_DecoderE:
   68|  6.60k|void X509_Object::decode_from(BER_Decoder& from) {
   69|  6.60k|   from.start_sequence()
   70|  6.60k|      .start_sequence()
   71|  6.60k|      .raw_bytes(m_tbs_bits)
   72|  6.60k|      .end_cons()
   73|  6.60k|      .decode(m_sig_algo)
   74|  6.60k|      .decode(m_sig, ASN1_Type::BitString)
   75|  6.60k|      .end_cons();
   76|       |
   77|  6.60k|   force_decode();
   78|  6.60k|}
_ZNK5Botan11X509_Object8tbs_dataEv:
   88|  1.65k|std::vector<uint8_t> X509_Object::tbs_data() const { return ASN1::put_in_sequence(m_tbs_bits); }
_ZNK5Botan11X509_Object16verify_signatureERKNS_10Public_KeyE:
   98|  1.97k|std::pair<Certificate_Status_Code, std::string> X509_Object::verify_signature(const Public_Key& pub_key) const {
   99|  1.97k|   try {
  100|  1.97k|      PK_Verifier verifier(pub_key, signature_algorithm());
  101|  1.97k|      const bool valid = verifier.verify_message(tbs_data(), signature());
  102|       |
  103|  1.97k|      if(valid) {
  ------------------
  |  Branch (103:10): [True: 12, False: 1.96k]
  ------------------
  104|     12|         return std::make_pair(Certificate_Status_Code::VERIFIED, verifier.hash_function());
  105|  1.96k|      } else {
  106|  1.96k|         return std::make_pair(Certificate_Status_Code::SIGNATURE_ERROR, "");
  107|  1.96k|      }
  108|  1.97k|   } catch(Decoding_Error&) {
  109|     34|      return std::make_pair(Certificate_Status_Code::SIGNATURE_ALGO_BAD_PARAMS, "");
  110|    291|   } catch(Algorithm_Not_Found&) {
  111|    291|      return std::make_pair(Certificate_Status_Code::SIGNATURE_ALGO_UNKNOWN, "");
  112|    291|   } catch(...) {
  113|       |      // This shouldn't happen, fallback to generic signature error
  114|      0|      return std::make_pair(Certificate_Status_Code::SIGNATURE_ERROR, "");
  115|      0|   }
  116|  1.97k|}

_ZNK5Botan16X509_Certificate9PEM_labelEv:
   70|  4.75k|std::string X509_Certificate::PEM_label() const { return "CERTIFICATE"; }
_ZNK5Botan16X509_Certificate20alternate_PEM_labelsEv:
   72|     80|std::vector<std::string> X509_Certificate::alternate_PEM_labels() const { return {"X509 CERTIFICATE"}; }
_ZN5Botan16X509_CertificateC2ERNS_10DataSourceE:
   74|  9.21k|X509_Certificate::X509_Certificate(DataSource& src) { load_data(src); }
_ZN5Botan16X509_Certificate12force_decodeEv:
  276|  5.70k|void X509_Certificate::force_decode() {
  277|  5.70k|   m_data.reset();
  278|  5.70k|   m_data = parse_x509_cert_body(*this);
  279|  5.70k|}
_ZNK5Botan16X509_Certificate4dataEv:
  281|  16.5k|const X509_Certificate_Data& X509_Certificate::data() const {
  282|  16.5k|   if(m_data == nullptr) {
  ------------------
  |  Branch (282:7): [True: 0, False: 16.5k]
  ------------------
  283|      0|      throw Invalid_State("X509_Certificate uninitialized");
  284|      0|   }
  285|  16.5k|   return *m_data;
  286|  16.5k|}
_ZNK5Botan16X509_Certificate12x509_versionEv:
  288|    604|uint32_t X509_Certificate::x509_version() const { return static_cast<uint32_t>(data().m_version); }
_ZNK5Botan16X509_Certificate14is_self_signedEv:
  290|  2.13k|bool X509_Certificate::is_self_signed() const { return data().m_self_signed; }
_ZNK5Botan16X509_Certificate10not_beforeEv:
  292|    551|const X509_Time& X509_Certificate::not_before() const { return data().m_not_before; }
_ZNK5Botan16X509_Certificate9not_afterEv:
  294|    551|const X509_Time& X509_Certificate::not_after() const { return data().m_not_after; }
_ZNK5Botan16X509_Certificate16v2_issuer_key_idEv:
  300|    122|const std::vector<uint8_t>& X509_Certificate::v2_issuer_key_id() const { return data().m_v2_issuer_key_id; }
_ZNK5Botan16X509_Certificate17v2_subject_key_idEv:
  302|    121|const std::vector<uint8_t>& X509_Certificate::v2_subject_key_id() const { return data().m_v2_subject_key_id; }
_ZNK5Botan16X509_Certificate23subject_public_key_infoEv:
  308|    551|const std::vector<uint8_t>& X509_Certificate::subject_public_key_info() const {
  309|    551|   return data().m_subject_public_key_bits_seq;
  310|    551|}
_ZNK5Botan16X509_Certificate16authority_key_idEv:
  324|  1.11k|const std::vector<uint8_t>& X509_Certificate::authority_key_id() const { return data().m_authority_key_id; }
_ZNK5Botan16X509_Certificate14subject_key_idEv:
  326|     31|const std::vector<uint8_t>& X509_Certificate::subject_key_id() const { return data().m_subject_key_id; }
_ZNK5Botan16X509_Certificate18is_serial_negativeEv:
  330|    551|bool X509_Certificate::is_serial_negative() const { return data().m_serial_negative; }
_ZNK5Botan16X509_Certificate9issuer_dnEv:
  332|  1.51k|const X509_DN& X509_Certificate::issuer_dn() const { return data().m_issuer_dn; }
_ZNK5Botan16X509_Certificate10subject_dnEv:
  334|  2.04k|const X509_DN& X509_Certificate::subject_dn() const { return data().m_subject_dn; }
_ZNK5Botan16X509_Certificate10is_CA_certEv:
  340|    567|bool X509_Certificate::is_CA_cert() const {
  341|    567|   if(data().m_version < 3 && data().m_self_signed) {
  ------------------
  |  Branch (341:7): [True: 196, False: 371]
  |  Branch (341:31): [True: 191, False: 5]
  ------------------
  342|    191|      return true;
  343|    191|   }
  344|       |
  345|    376|   return data().m_is_ca_certificate;
  346|    567|}
_ZNK5Botan16X509_Certificate10path_limitEv:
  348|    382|uint32_t X509_Certificate::path_limit() const {
  349|    382|   if(data().m_version < 3 && data().m_self_signed) {
  ------------------
  |  Branch (349:7): [True: 138, False: 244]
  |  Branch (349:31): [True: 138, False: 0]
  ------------------
  350|    138|      return 32;  // in theory infinite, but this is more than enough
  351|    138|   }
  352|       |
  353|    244|   return static_cast<uint32_t>(data().m_path_len_constraint);
  354|    382|}
_ZNK5Botan16X509_Certificate11constraintsEv:
  356|    400|Key_Constraints X509_Certificate::constraints() const { return data().m_key_constraints; }
_ZNK5Botan16X509_Certificate13v3_extensionsEv:
  364|    302|const Extensions& X509_Certificate::v3_extensions() const { return data().m_v3_extensions; }
_ZNK5Botan16X509_Certificate15has_constraintsENS_15Key_ConstraintsE:
  366|    400|bool X509_Certificate::has_constraints(Key_Constraints usage) const {
  367|       |   // Unlike allowed_usage, returns false if constraints was not set
  368|    400|   return constraints().includes(usage);
  369|    400|}
_ZNK5Botan16X509_Certificate13allowed_usageENS_10Usage_TypeE:
  395|    400|bool X509_Certificate::allowed_usage(Usage_Type usage) const {
  396|       |   // These follow suggestions in RFC 5280 4.2.1.12
  397|       |
  398|    400|   switch(usage) {
  ------------------
  |  Branch (398:11): [True: 0, False: 400]
  ------------------
  399|    400|      case Usage_Type::UNSPECIFIED:
  ------------------
  |  Branch (399:7): [True: 400, False: 0]
  ------------------
  400|    400|         return true;
  401|       |
  402|      0|      case Usage_Type::TLS_SERVER_AUTH:
  ------------------
  |  Branch (402:7): [True: 0, False: 400]
  ------------------
  403|      0|         return (allowed_usage(Key_Constraints::KeyAgreement) || allowed_usage(Key_Constraints::KeyEncipherment) ||
  ------------------
  |  Branch (403:18): [True: 0, False: 0]
  |  Branch (403:66): [True: 0, False: 0]
  ------------------
  404|      0|                 allowed_usage(Key_Constraints::DigitalSignature)) &&
  ------------------
  |  Branch (404:18): [True: 0, False: 0]
  ------------------
  405|      0|                allowed_extended_usage("PKIX.ServerAuth");
  ------------------
  |  Branch (405:17): [True: 0, False: 0]
  ------------------
  406|       |
  407|      0|      case Usage_Type::TLS_CLIENT_AUTH:
  ------------------
  |  Branch (407:7): [True: 0, False: 400]
  ------------------
  408|      0|         return (allowed_usage(Key_Constraints::DigitalSignature) || allowed_usage(Key_Constraints::KeyAgreement)) &&
  ------------------
  |  Branch (408:18): [True: 0, False: 0]
  |  Branch (408:70): [True: 0, False: 0]
  ------------------
  409|      0|                allowed_extended_usage("PKIX.ClientAuth");
  ------------------
  |  Branch (409:17): [True: 0, False: 0]
  ------------------
  410|       |
  411|      0|      case Usage_Type::OCSP_RESPONDER:
  ------------------
  |  Branch (411:7): [True: 0, False: 400]
  ------------------
  412|      0|         return (allowed_usage(Key_Constraints::DigitalSignature) || allowed_usage(Key_Constraints::NonRepudiation)) &&
  ------------------
  |  Branch (412:18): [True: 0, False: 0]
  |  Branch (412:70): [True: 0, False: 0]
  ------------------
  413|      0|                has_ex_constraint("PKIX.OCSPSigning");
  ------------------
  |  Branch (413:17): [True: 0, False: 0]
  ------------------
  414|       |
  415|      0|      case Usage_Type::CERTIFICATE_AUTHORITY:
  ------------------
  |  Branch (415:7): [True: 0, False: 400]
  ------------------
  416|      0|         return is_CA_cert();
  417|       |
  418|      0|      case Usage_Type::ENCRYPTION:
  ------------------
  |  Branch (418:7): [True: 0, False: 400]
  ------------------
  419|      0|         return (allowed_usage(Key_Constraints::KeyEncipherment) || allowed_usage(Key_Constraints::DataEncipherment));
  ------------------
  |  Branch (419:18): [True: 0, False: 0]
  |  Branch (419:69): [True: 0, False: 0]
  ------------------
  420|    400|   }
  421|       |
  422|      0|   return false;
  423|    400|}
_ZNK5Botan16X509_Certificate18subject_public_keyEv:
  494|    551|std::unique_ptr<Public_Key> X509_Certificate::subject_public_key() const {
  495|    551|   try {
  496|    551|      return std::unique_ptr<Public_Key>(X509::load_key(subject_public_key_info()));
  497|    551|   } catch(std::exception& e) {
  498|    249|      throw Decoding_Error("X509_Certificate::subject_public_key", e);
  499|    249|   }
  500|    551|}
_ZNK5Botan16X509_Certificate11fingerprintENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  518|  2.00k|std::string X509_Certificate::fingerprint(std::string_view hash_name) const {
  519|       |   /*
  520|       |   * The SHA-1 and SHA-256 fingerprints are precomputed since these
  521|       |   * are the most commonly used. Especially, SHA-256 fingerprints are
  522|       |   * used for cycle detection during path construction.
  523|       |   *
  524|       |   * If SHA-1 or SHA-256 was missing at parsing time the vectors are
  525|       |   * left empty in which case we fall back to create_hex_fingerprint
  526|       |   * which will throw if the hash is unavailable.
  527|       |   */
  528|  2.00k|   if(hash_name == "SHA-256" && !data().m_fingerprint_sha256.empty()) {
  ------------------
  |  Branch (528:7): [True: 2.00k, False: 0]
  |  Branch (528:33): [True: 2.00k, False: 0]
  ------------------
  529|  2.00k|      return data().m_fingerprint_sha256;
  530|  2.00k|   } else if(hash_name == "SHA-1" && !data().m_fingerprint_sha1.empty()) {
  ------------------
  |  Branch (530:14): [True: 0, False: 0]
  |  Branch (530:38): [True: 0, False: 0]
  ------------------
  531|      0|      return data().m_fingerprint_sha1;
  532|      0|   } else {
  533|      0|      return create_hex_fingerprint(this->BER_encode(), hash_name);
  534|      0|   }
  535|  2.00k|}
x509cert.cpp:_ZN5Botan12_GLOBAL__N_120parse_x509_cert_bodyERKNS_11X509_ObjectE:
   95|  5.70k|std::unique_ptr<X509_Certificate_Data> parse_x509_cert_body(const X509_Object& obj) {
   96|  5.70k|   auto data = std::make_unique<X509_Certificate_Data>();
   97|       |
   98|  5.70k|   BigInt serial_bn;
   99|  5.70k|   BER_Object public_key;
  100|  5.70k|   BER_Object v3_exts_data;
  101|       |
  102|  5.70k|   BER_Decoder(obj.signed_body())
  103|  5.70k|      .decode_optional(data->m_version, ASN1_Type(0), ASN1_Class::Constructed | ASN1_Class::ContextSpecific)
  104|  5.70k|      .decode(serial_bn)
  105|  5.70k|      .decode(data->m_sig_algo_inner)
  106|  5.70k|      .decode(data->m_issuer_dn)
  107|  5.70k|      .start_sequence()
  108|  5.70k|      .decode(data->m_not_before)
  109|  5.70k|      .decode(data->m_not_after)
  110|  5.70k|      .end_cons()
  111|  5.70k|      .decode(data->m_subject_dn)
  112|  5.70k|      .get_next(public_key)
  113|  5.70k|      .decode_optional_string(data->m_v2_issuer_key_id, ASN1_Type::BitString, 1)
  114|  5.70k|      .decode_optional_string(data->m_v2_subject_key_id, ASN1_Type::BitString, 2)
  115|  5.70k|      .get_next(v3_exts_data)
  116|  5.70k|      .verify_end("TBSCertificate has extra data after extensions block");
  117|       |
  118|  5.70k|   if(data->m_version > 2) {
  ------------------
  |  Branch (118:7): [True: 31, False: 5.67k]
  ------------------
  119|     31|      throw Decoding_Error("Unknown X.509 cert version " + std::to_string(data->m_version));
  120|     31|   }
  121|  5.67k|   if(obj.signature_algorithm() != data->m_sig_algo_inner) {
  ------------------
  |  Branch (121:7): [True: 58, False: 5.61k]
  ------------------
  122|     58|      throw Decoding_Error("X.509 Certificate had differing algorithm identifers in inner and outer ID fields");
  123|     58|   }
  124|       |
  125|  5.61k|   public_key.assert_is_a(ASN1_Type::Sequence, ASN1_Class::Constructed, "X.509 certificate public key");
  126|       |
  127|       |   // crude method to save the serial's sign; will get lost during decoding, otherwise
  128|  5.61k|   data->m_serial_negative = serial_bn.is_negative();
  129|       |
  130|       |   // for general sanity convert wire version (0 based) to standards version (v1 .. v3)
  131|  5.61k|   data->m_version += 1;
  132|       |
  133|  5.61k|   data->m_serial = BigInt::encode(serial_bn);
  134|  5.61k|   data->m_subject_dn_bits = ASN1::put_in_sequence(data->m_subject_dn.get_bits());
  135|  5.61k|   data->m_issuer_dn_bits = ASN1::put_in_sequence(data->m_issuer_dn.get_bits());
  136|       |
  137|  5.61k|   data->m_subject_public_key_bits.assign(public_key.bits(), public_key.bits() + public_key.length());
  138|       |
  139|  5.61k|   data->m_subject_public_key_bits_seq = ASN1::put_in_sequence(data->m_subject_public_key_bits);
  140|       |
  141|  5.61k|   BER_Decoder(data->m_subject_public_key_bits)
  142|  5.61k|      .decode(data->m_subject_public_key_algid)
  143|  5.61k|      .decode(data->m_subject_public_key_bitstring, ASN1_Type::BitString);
  144|       |
  145|  5.61k|   if(v3_exts_data.is_a(3, ASN1_Class::Constructed | ASN1_Class::ContextSpecific)) {
  ------------------
  |  Branch (145:7): [True: 3.37k, False: 2.23k]
  ------------------
  146|       |      // Path validation will reject a v1/v2 cert with v3 extensions
  147|  3.37k|      BER_Decoder(v3_exts_data).decode(data->m_v3_extensions).verify_end();
  148|  3.37k|   } else if(v3_exts_data.is_set()) {
  ------------------
  |  Branch (148:14): [True: 60, False: 2.17k]
  ------------------
  149|     60|      throw BER_Bad_Tag("Unknown tag in X.509 cert", v3_exts_data.tagging());
  150|     60|   }
  151|       |
  152|       |   // Now cache some fields from the extensions
  153|  5.55k|   if(auto ext = data->m_v3_extensions.get_extension_object_as<Cert_Extension::Key_Usage>()) {
  ------------------
  |  Branch (153:12): [True: 169, False: 5.38k]
  ------------------
  154|    169|      data->m_key_constraints = ext->get_constraints();
  155|       |      /*
  156|       |      RFC 5280: When the keyUsage extension appears in a certificate,
  157|       |      at least one of the bits MUST be set to 1.
  158|       |      */
  159|    169|      if(data->m_key_constraints.empty()) {
  ------------------
  |  Branch (159:10): [True: 3, False: 166]
  ------------------
  160|      3|         throw Decoding_Error("Certificate has invalid encoding for KeyUsage");
  161|      3|      }
  162|    169|   }
  163|       |
  164|  5.55k|   if(auto ext = data->m_v3_extensions.get_extension_object_as<Cert_Extension::Subject_Key_ID>()) {
  ------------------
  |  Branch (164:12): [True: 203, False: 5.34k]
  ------------------
  165|    203|      data->m_subject_key_id = ext->get_key_id();
  166|    203|   }
  167|       |
  168|  5.55k|   if(auto ext = data->m_v3_extensions.get_extension_object_as<Cert_Extension::Authority_Key_ID>()) {
  ------------------
  |  Branch (168:12): [True: 160, False: 5.39k]
  ------------------
  169|    160|      data->m_authority_key_id = ext->get_key_id();
  170|    160|   }
  171|       |
  172|  5.55k|   if(auto ext = data->m_v3_extensions.get_extension_object_as<Cert_Extension::Name_Constraints>()) {
  ------------------
  |  Branch (172:12): [True: 6, False: 5.54k]
  ------------------
  173|      6|      data->m_name_constraints = ext->get_name_constraints();
  174|      6|   }
  175|       |
  176|  5.55k|   if(auto ext = data->m_v3_extensions.get_extension_object_as<Cert_Extension::Basic_Constraints>()) {
  ------------------
  |  Branch (176:12): [True: 387, False: 5.16k]
  ------------------
  177|    387|      if(ext->get_is_ca() == true) {
  ------------------
  |  Branch (177:10): [True: 252, False: 135]
  ------------------
  178|       |         /*
  179|       |         * RFC 5280 section 4.2.1.3 requires that CAs include KeyUsage in all
  180|       |         * intermediate CA certificates they issue. Currently we accept it being
  181|       |         * missing, as do most other implementations. But it may be worth
  182|       |         * removing this entirely, or alternately adding a warning level
  183|       |         * validation failure for it.
  184|       |         */
  185|    252|         if(data->m_key_constraints.empty() || data->m_key_constraints.includes(Key_Constraints::KeyCertSign)) {
  ------------------
  |  Branch (185:13): [True: 216, False: 36]
  |  Branch (185:48): [True: 30, False: 6]
  ------------------
  186|    246|            data->m_is_ca_certificate = true;
  187|    246|            data->m_path_len_constraint = ext->get_path_limit();
  188|    246|         }
  189|    252|      }
  190|    387|   }
  191|       |
  192|  5.55k|   if(auto ext = data->m_v3_extensions.get_extension_object_as<Cert_Extension::Issuer_Alternative_Name>()) {
  ------------------
  |  Branch (192:12): [True: 53, False: 5.49k]
  ------------------
  193|     53|      data->m_issuer_alt_name = ext->get_alt_name();
  194|     53|   }
  195|       |
  196|  5.55k|   if(auto ext = data->m_v3_extensions.get_extension_object_as<Cert_Extension::Subject_Alternative_Name>()) {
  ------------------
  |  Branch (196:12): [True: 200, False: 5.35k]
  ------------------
  197|    200|      data->m_subject_alt_name = ext->get_alt_name();
  198|    200|   }
  199|       |
  200|  5.55k|   if(auto ext = data->m_v3_extensions.get_extension_object_as<Cert_Extension::Extended_Key_Usage>()) {
  ------------------
  |  Branch (200:12): [True: 119, False: 5.43k]
  ------------------
  201|    119|      data->m_extended_key_usage = ext->object_identifiers();
  202|    119|   }
  203|       |
  204|  5.55k|   if(auto ext = data->m_v3_extensions.get_extension_object_as<Cert_Extension::Certificate_Policies>()) {
  ------------------
  |  Branch (204:12): [True: 50, False: 5.50k]
  ------------------
  205|     50|      data->m_cert_policies = ext->get_policy_oids();
  206|     50|   }
  207|       |
  208|  5.55k|   if(auto ext = data->m_v3_extensions.get_extension_object_as<Cert_Extension::Authority_Information_Access>()) {
  ------------------
  |  Branch (208:12): [True: 51, False: 5.50k]
  ------------------
  209|     51|      data->m_ocsp_responder = ext->ocsp_responder();
  210|     51|      data->m_ca_issuers = ext->ca_issuers();
  211|     51|   }
  212|       |
  213|  5.55k|   if(auto ext = data->m_v3_extensions.get_extension_object_as<Cert_Extension::CRL_Distribution_Points>()) {
  ------------------
  |  Branch (213:12): [True: 79, False: 5.47k]
  ------------------
  214|     79|      data->m_crl_distribution_points = ext->crl_distribution_urls();
  215|     79|   }
  216|       |
  217|       |   // Check for self-signed vs self-issued certificates
  218|  5.55k|   if(data->m_subject_dn == data->m_issuer_dn) {
  ------------------
  |  Branch (218:7): [True: 3.13k, False: 2.41k]
  ------------------
  219|  3.13k|      if(data->m_subject_key_id.empty() == false && data->m_authority_key_id.empty() == false) {
  ------------------
  |  Branch (219:10): [True: 76, False: 3.05k]
  |  Branch (219:53): [True: 59, False: 17]
  ------------------
  220|     59|         data->m_self_signed = (data->m_subject_key_id == data->m_authority_key_id);
  221|  3.07k|      } else {
  222|       |         /*
  223|       |         If a parse error or unknown algorithm is encountered, default
  224|       |         to assuming it is self signed. We have no way of being certain but
  225|       |         that is usually the default case (self-issued is rare in practice).
  226|       |         */
  227|  3.07k|         data->m_self_signed = true;
  228|       |
  229|  3.07k|         try {
  230|  3.07k|            auto pub_key = X509::load_key(data->m_subject_public_key_bits_seq);
  231|       |
  232|  3.07k|            const auto sig_status = obj.verify_signature(*pub_key);
  233|       |
  234|  3.07k|            if(sig_status.first == Certificate_Status_Code::OK ||
  ------------------
  |  Branch (234:16): [True: 1.39k, False: 1.68k]
  ------------------
  235|  3.07k|               sig_status.first == Certificate_Status_Code::SIGNATURE_ALGO_UNKNOWN) {
  ------------------
  |  Branch (235:16): [True: 144, False: 1.53k]
  ------------------
  236|    152|               data->m_self_signed = true;
  237|  2.92k|            } else {
  238|  2.92k|               data->m_self_signed = false;
  239|  2.92k|            }
  240|  3.07k|         } catch(...) {
  241|       |            // ignore errors here to allow parsing to continue
  242|  1.38k|         }
  243|  3.07k|      }
  244|  3.13k|   }
  245|       |
  246|  5.55k|   const std::vector<uint8_t> full_encoding = obj.BER_encode();
  247|       |
  248|  5.55k|   auto sha1 = HashFunction::create("SHA-1");
  249|  5.55k|   if(sha1) {
  ------------------
  |  Branch (249:7): [True: 4.00k, False: 1.54k]
  ------------------
  250|  4.00k|      sha1->update(data->m_subject_public_key_bitstring);
  251|  4.00k|      data->m_subject_public_key_bitstring_sha1 = sha1->final_stdvec();
  252|       |      // otherwise left as empty, and we will throw if subject_public_key_bitstring_sha1 is called
  253|       |
  254|  4.00k|      data->m_fingerprint_sha1 = create_hex_fingerprint(full_encoding, "SHA-1");
  255|  4.00k|   }
  256|       |
  257|  5.55k|   auto sha256 = HashFunction::create("SHA-256");
  258|  5.55k|   if(sha256) {
  ------------------
  |  Branch (258:7): [True: 4.00k, False: 1.54k]
  ------------------
  259|  4.00k|      sha256->update(data->m_issuer_dn_bits);
  260|  4.00k|      data->m_issuer_dn_bits_sha256 = sha256->final_stdvec();
  261|       |
  262|  4.00k|      sha256->update(data->m_subject_dn_bits);
  263|  4.00k|      data->m_subject_dn_bits_sha256 = sha256->final_stdvec();
  264|       |
  265|  4.00k|      data->m_fingerprint_sha256 = create_hex_fingerprint(full_encoding, "SHA-256");
  266|  4.00k|   }
  267|       |
  268|  5.55k|   return data;
  269|  5.55k|}

_ZN5Botan4PKIX11check_chainERKNSt3__16vectorINS_16X509_CertificateENS1_9allocatorIS3_EEEENS1_6chrono10time_pointINS9_12system_clockENS9_8durationIxNS1_5ratioILl1ELl1000000EEEEEEENS1_17basic_string_viewIcNS1_11char_traitsIcEEEENS_10Usage_TypeERKNS_28Path_Validation_RestrictionsE:
   36|    400|                                             const Path_Validation_Restrictions& restrictions) {
   37|    400|   if(cert_path.empty()) {
  ------------------
  |  Branch (37:7): [True: 0, False: 400]
  ------------------
   38|      0|      throw Invalid_Argument("PKIX::check_chain cert_path empty");
   39|      0|   }
   40|       |
   41|    400|   const bool self_signed_ee_cert = (cert_path.size() == 1);
   42|       |
   43|    400|   X509_Time validation_time(ref_time);
   44|       |
   45|    400|   CertificatePathStatusCodes cert_status(cert_path.size());
   46|       |
   47|    400|   if(!hostname.empty() && !cert_path[0].matches_dns_name(hostname)) {
  ------------------
  |  Branch (47:7): [True: 0, False: 400]
  |  Branch (47:28): [True: 0, False: 0]
  ------------------
   48|      0|      cert_status[0].insert(Certificate_Status_Code::CERT_NAME_NOMATCH);
   49|      0|   }
   50|       |
   51|    400|   if(!cert_path[0].allowed_usage(usage)) {
  ------------------
  |  Branch (51:7): [True: 0, False: 400]
  ------------------
   52|      0|      if(usage == Usage_Type::OCSP_RESPONDER) {
  ------------------
  |  Branch (52:10): [True: 0, False: 0]
  ------------------
   53|      0|         cert_status[0].insert(Certificate_Status_Code::OCSP_RESPONSE_MISSING_KEYUSAGE);
   54|      0|      }
   55|      0|      cert_status[0].insert(Certificate_Status_Code::INVALID_USAGE);
   56|      0|   }
   57|       |
   58|    400|   if(cert_path[0].has_constraints(Key_Constraints::KeyCertSign) && cert_path[0].is_CA_cert() == false) {
  ------------------
  |  Branch (58:7): [True: 16, False: 384]
  |  Branch (58:69): [True: 15, False: 1]
  ------------------
   59|       |      /*
   60|       |      "If the keyCertSign bit is asserted, then the cA bit in the
   61|       |      basic constraints extension (Section 4.2.1.9) MUST also be
   62|       |      asserted." - RFC 5280
   63|       |
   64|       |      We don't bother doing this check on the rest of the path since they
   65|       |      must have the cA bit asserted or the validation will fail anyway.
   66|       |      */
   67|     15|      cert_status[0].insert(Certificate_Status_Code::INVALID_USAGE);
   68|     15|   }
   69|       |
   70|    951|   for(size_t i = 0; i != cert_path.size(); ++i) {
  ------------------
  |  Branch (70:22): [True: 551, False: 400]
  ------------------
   71|    551|      std::set<Certificate_Status_Code>& status = cert_status.at(i);
   72|       |
   73|    551|      const bool at_self_signed_root = (i == cert_path.size() - 1);
   74|       |
   75|    551|      const X509_Certificate& subject = cert_path[i];
   76|    551|      const X509_Certificate& issuer = cert_path[at_self_signed_root ? (i) : (i + 1)];
  ------------------
  |  Branch (76:50): [True: 151, False: 400]
  ------------------
   77|       |
   78|    551|      if(at_self_signed_root && (issuer.is_self_signed() == false)) {
  ------------------
  |  Branch (78:10): [True: 151, False: 400]
  |  Branch (78:33): [True: 0, False: 151]
  ------------------
   79|      0|         status.insert(Certificate_Status_Code::CHAIN_LACKS_TRUST_ROOT);
   80|      0|      }
   81|       |
   82|    551|      if(subject.issuer_dn() != issuer.subject_dn()) {
  ------------------
  |  Branch (82:10): [True: 0, False: 551]
  ------------------
   83|      0|         status.insert(Certificate_Status_Code::CHAIN_NAME_MISMATCH);
   84|      0|      }
   85|       |
   86|       |      // Check the serial number
   87|    551|      if(subject.is_serial_negative()) {
  ------------------
  |  Branch (87:10): [True: 165, False: 386]
  ------------------
   88|    165|         status.insert(Certificate_Status_Code::CERT_SERIAL_NEGATIVE);
   89|    165|      }
   90|       |
   91|       |      // Check the subject's DN components' length
   92|       |
   93|  1.70k|      for(const auto& dn_pair : subject.subject_dn().dn_info()) {
  ------------------
  |  Branch (93:31): [True: 1.70k, False: 551]
  ------------------
   94|  1.70k|         const size_t dn_ub = X509_DN::lookup_ub(dn_pair.first);
   95|       |         // dn_pair = <OID,str>
   96|  1.70k|         if(dn_ub > 0 && dn_pair.second.size() > dn_ub) {
  ------------------
  |  Branch (96:13): [True: 1.27k, False: 427]
  |  Branch (96:26): [True: 38, False: 1.24k]
  ------------------
   97|     38|            status.insert(Certificate_Status_Code::DN_TOO_LONG);
   98|     38|         }
   99|  1.70k|      }
  100|       |
  101|       |      // Check all certs for valid time range
  102|    551|      if(validation_time < subject.not_before()) {
  ------------------
  |  Branch (102:10): [True: 104, False: 447]
  ------------------
  103|    104|         status.insert(Certificate_Status_Code::CERT_NOT_YET_VALID);
  104|    104|      }
  105|       |
  106|    551|      if(validation_time > subject.not_after()) {
  ------------------
  |  Branch (106:10): [True: 274, False: 277]
  ------------------
  107|    274|         status.insert(Certificate_Status_Code::CERT_HAS_EXPIRED);
  108|    274|      }
  109|       |
  110|       |      // Check issuer constraints
  111|    551|      if(!issuer.is_CA_cert() && !self_signed_ee_cert) {
  ------------------
  |  Branch (111:10): [True: 345, False: 206]
  |  Branch (111:34): [True: 345, False: 0]
  ------------------
  112|    345|         status.insert(Certificate_Status_Code::CA_CERT_NOT_FOR_CERT_ISSUER);
  113|    345|      }
  114|       |
  115|    551|      auto issuer_key = issuer.subject_public_key();
  116|       |
  117|       |      // Check the signature algorithm is known
  118|    551|      if(!subject.signature_algorithm().oid().registered_oid()) {
  ------------------
  |  Branch (118:10): [True: 12, False: 539]
  ------------------
  119|     12|         status.insert(Certificate_Status_Code::SIGNATURE_ALGO_UNKNOWN);
  120|    539|      } else {
  121|       |         // only perform the following checks if the signature algorithm is known
  122|    539|         if(!issuer_key) {
  ------------------
  |  Branch (122:13): [True: 0, False: 539]
  ------------------
  123|      0|            status.insert(Certificate_Status_Code::CERT_PUBKEY_INVALID);
  124|    539|         } else {
  125|    539|            const auto sig_status = subject.verify_signature(*issuer_key);
  126|       |
  127|    539|            if(sig_status.first == Certificate_Status_Code::VERIFIED) {
  ------------------
  |  Branch (127:16): [True: 4, False: 535]
  ------------------
  128|      4|               const std::string hash_used_for_signature = sig_status.second;
  129|      4|               BOTAN_ASSERT_NOMSG(!hash_used_for_signature.empty());
  ------------------
  |  |   60|      4|   do {                                                                     \
  |  |   61|      4|      if(!(expr))                                                           \
  |  |  ------------------
  |  |  |  Branch (61:10): [True: 0, False: 4]
  |  |  ------------------
  |  |   62|      4|         Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \
  |  |   63|      4|   } while(0)
  |  |  ------------------
  |  |  |  Branch (63:12): [Folded - Ignored]
  |  |  ------------------
  ------------------
  130|      4|               const auto& trusted_hashes = restrictions.trusted_hashes();
  131|       |
  132|       |               // Ignore untrusted hashes on self-signed roots
  133|      4|               if(!trusted_hashes.empty() && !at_self_signed_root) {
  ------------------
  |  Branch (133:19): [True: 4, False: 0]
  |  Branch (133:46): [True: 0, False: 4]
  ------------------
  134|      0|                  if(!trusted_hashes.contains(hash_used_for_signature)) {
  ------------------
  |  Branch (134:22): [True: 0, False: 0]
  ------------------
  135|      0|                     status.insert(Certificate_Status_Code::UNTRUSTED_HASH);
  136|      0|                  }
  137|      0|               }
  138|    535|            } else {
  139|    535|               status.insert(sig_status.first);
  140|    535|            }
  141|       |
  142|    539|            if(issuer_key->estimated_strength() < restrictions.minimum_key_strength()) {
  ------------------
  |  Branch (142:16): [True: 290, False: 249]
  ------------------
  143|    290|               status.insert(Certificate_Status_Code::SIGNATURE_METHOD_TOO_WEAK);
  144|    290|            }
  145|    539|         }
  146|    539|      }
  147|       |
  148|       |      // Check cert extensions
  149|       |
  150|    551|      if(subject.x509_version() == 1) {
  ------------------
  |  Branch (150:10): [True: 122, False: 429]
  ------------------
  151|    122|         if(subject.v2_issuer_key_id().empty() == false || subject.v2_subject_key_id().empty() == false) {
  ------------------
  |  Branch (151:13): [True: 1, False: 121]
  |  Branch (151:60): [True: 2, False: 119]
  ------------------
  152|      3|            status.insert(Certificate_Status_Code::V2_IDENTIFIERS_IN_V1_CERT);
  153|      3|         }
  154|    122|      }
  155|       |
  156|    551|      const Extensions& extensions = subject.v3_extensions();
  157|    551|      const auto& extensions_vec = extensions.extensions();
  158|    551|      if(subject.x509_version() < 3 && !extensions_vec.empty()) {
  ------------------
  |  Branch (158:10): [True: 135, False: 416]
  |  Branch (158:40): [True: 87, False: 48]
  ------------------
  159|     87|         status.insert(Certificate_Status_Code::EXT_IN_V1_V2_CERT);
  160|     87|      }
  161|    551|      for(auto& extension : extensions_vec) {
  ------------------
  |  Branch (161:27): [True: 535, False: 551]
  ------------------
  162|    535|         extension.first->validate(subject, issuer, cert_path, cert_status, i);
  163|    535|      }
  164|    551|      if(extensions_vec.size() != extensions.get_extension_oids().size()) {
  ------------------
  |  Branch (164:10): [True: 34, False: 517]
  ------------------
  165|     34|         status.insert(Certificate_Status_Code::DUPLICATE_CERT_EXTENSION);
  166|     34|      }
  167|    551|   }
  168|       |
  169|       |   // path len check
  170|    400|   size_t max_path_length = cert_path.size();
  171|    551|   for(size_t i = cert_path.size() - 1; i > 0; --i) {
  ------------------
  |  Branch (171:41): [True: 151, False: 400]
  ------------------
  172|    151|      std::set<Certificate_Status_Code>& status = cert_status.at(i);
  173|    151|      const X509_Certificate& subject = cert_path[i];
  174|       |
  175|       |      /*
  176|       |      * If the certificate was not self-issued, verify that max_path_length is
  177|       |      * greater than zero and decrement max_path_length by 1.
  178|       |      */
  179|    151|      if(subject.subject_dn() != subject.issuer_dn()) {
  ------------------
  |  Branch (179:10): [True: 0, False: 151]
  ------------------
  180|      0|         if(max_path_length > 0) {
  ------------------
  |  Branch (180:13): [True: 0, False: 0]
  ------------------
  181|      0|            --max_path_length;
  182|      0|         } else {
  183|      0|            status.insert(Certificate_Status_Code::CERT_CHAIN_TOO_LONG);
  184|      0|         }
  185|      0|      }
  186|       |
  187|       |      /*
  188|       |      * If pathLenConstraint is present in the certificate and is less than max_path_length,
  189|       |      * set max_path_length to the value of pathLenConstraint.
  190|       |      */
  191|    151|      if(subject.path_limit() != Cert_Extension::NO_CERT_PATH_LIMIT && subject.path_limit() < max_path_length) {
  ------------------
  |  Branch (191:10): [True: 150, False: 1]
  |  Branch (191:72): [True: 81, False: 69]
  ------------------
  192|     81|         max_path_length = subject.path_limit();
  193|     81|      }
  194|    151|   }
  195|       |
  196|    400|   return cert_status;
  197|    400|}
_ZN5Botan4PKIX9check_crlERKNSt3__16vectorINS_16X509_CertificateENS1_9allocatorIS3_EEEERKNS2_INS1_8optionalINS_8X509_CRLEEENS4_ISB_EEEENS1_6chrono10time_pointINSG_12system_clockENSG_8durationIxNS1_5ratioILl1ELl1000000EEEEEEE:
  319|    151|                                           std::chrono::system_clock::time_point ref_time) {
  320|    151|   if(cert_path.empty()) {
  ------------------
  |  Branch (320:7): [True: 0, False: 151]
  ------------------
  321|      0|      throw Invalid_Argument("PKIX::check_crl cert_path empty");
  322|      0|   }
  323|       |
  324|    151|   CertificatePathStatusCodes cert_status(cert_path.size());
  325|    151|   const X509_Time validation_time(ref_time);
  326|       |
  327|    302|   for(size_t i = 0; i != cert_path.size() - 1; ++i) {
  ------------------
  |  Branch (327:22): [True: 151, False: 151]
  ------------------
  328|    151|      std::set<Certificate_Status_Code>& status = cert_status.at(i);
  329|       |
  330|    151|      if(i < crls.size() && crls[i].has_value()) {
  ------------------
  |  Branch (330:10): [True: 151, False: 0]
  |  Branch (330:29): [True: 0, False: 151]
  ------------------
  331|      0|         const X509_Certificate& subject = cert_path.at(i);
  332|      0|         const X509_Certificate& ca = cert_path.at(i + 1);
  333|       |
  334|      0|         if(!ca.allowed_usage(Key_Constraints::CrlSign)) {
  ------------------
  |  Branch (334:13): [True: 0, False: 0]
  ------------------
  335|      0|            status.insert(Certificate_Status_Code::CA_CERT_NOT_FOR_CRL_ISSUER);
  336|      0|         }
  337|       |
  338|      0|         if(validation_time < crls[i]->this_update()) {
  ------------------
  |  Branch (338:13): [True: 0, False: 0]
  ------------------
  339|      0|            status.insert(Certificate_Status_Code::CRL_NOT_YET_VALID);
  340|      0|         }
  341|       |
  342|      0|         if(validation_time > crls[i]->next_update()) {
  ------------------
  |  Branch (342:13): [True: 0, False: 0]
  ------------------
  343|      0|            status.insert(Certificate_Status_Code::CRL_HAS_EXPIRED);
  344|      0|         }
  345|       |
  346|      0|         auto ca_key = ca.subject_public_key();
  347|      0|         if(crls[i]->check_signature(*ca_key) == false) {
  ------------------
  |  Branch (347:13): [True: 0, False: 0]
  ------------------
  348|      0|            status.insert(Certificate_Status_Code::CRL_BAD_SIGNATURE);
  349|      0|         }
  350|       |
  351|      0|         status.insert(Certificate_Status_Code::VALID_CRL_CHECKED);
  352|       |
  353|      0|         if(crls[i]->is_revoked(subject)) {
  ------------------
  |  Branch (353:13): [True: 0, False: 0]
  ------------------
  354|      0|            status.insert(Certificate_Status_Code::CERT_IS_REVOKED);
  355|      0|         }
  356|       |
  357|      0|         std::string dp = subject.crl_distribution_point();
  358|      0|         if(!dp.empty()) {
  ------------------
  |  Branch (358:13): [True: 0, False: 0]
  ------------------
  359|      0|            if(dp != crls[i]->crl_issuing_distribution_point()) {
  ------------------
  |  Branch (359:16): [True: 0, False: 0]
  ------------------
  360|      0|               status.insert(Certificate_Status_Code::NO_MATCHING_CRLDP);
  361|      0|            }
  362|      0|         }
  363|       |
  364|      0|         for(const auto& extension : crls[i]->extensions().extensions()) {
  ------------------
  |  Branch (364:36): [True: 0, False: 0]
  ------------------
  365|       |            // XXX this is wrong - the OID might be defined but the extention not full parsed
  366|       |            // for example see #1652
  367|       |
  368|       |            // is the extension critical and unknown?
  369|      0|            if(extension.second && !extension.first->oid_of().registered_oid()) {
  ------------------
  |  Branch (369:16): [True: 0, False: 0]
  |  Branch (369:16): [True: 0, False: 0]
  |  Branch (369:36): [True: 0, False: 0]
  ------------------
  370|       |               /* NIST Certificate Path Valiadation Testing document: "When an implementation does not recognize a critical extension in the
  371|       |                * crlExtensions field, it shall assume that identified certificates have been revoked and are no longer valid"
  372|       |                */
  373|      0|               status.insert(Certificate_Status_Code::CERT_IS_REVOKED);
  374|      0|            }
  375|      0|         }
  376|      0|      }
  377|    151|   }
  378|       |
  379|    453|   while(!cert_status.empty() && cert_status.back().empty()) {
  ------------------
  |  Branch (379:10): [True: 302, False: 151]
  |  Branch (379:34): [True: 302, False: 0]
  ------------------
  380|    302|      cert_status.pop_back();
  381|    302|   }
  382|       |
  383|    151|   return cert_status;
  384|    151|}
_ZN5Botan4PKIX9check_crlERKNSt3__16vectorINS_16X509_CertificateENS1_9allocatorIS3_EEEERKNS2_IPNS_17Certificate_StoreENS4_ISA_EEEENS1_6chrono10time_pointINSF_12system_clockENSF_8durationIxNS1_5ratioILl1ELl1000000EEEEEEE:
  388|    151|                                           std::chrono::system_clock::time_point ref_time) {
  389|    151|   if(cert_path.empty()) {
  ------------------
  |  Branch (389:7): [True: 0, False: 151]
  ------------------
  390|      0|      throw Invalid_Argument("PKIX::check_crl cert_path empty");
  391|      0|   }
  392|       |
  393|    151|   if(certstores.empty()) {
  ------------------
  |  Branch (393:7): [True: 0, False: 151]
  ------------------
  394|      0|      throw Invalid_Argument("PKIX::check_crl certstores empty");
  395|      0|   }
  396|       |
  397|    151|   std::vector<std::optional<X509_CRL>> crls(cert_path.size());
  398|       |
  399|    453|   for(size_t i = 0; i != cert_path.size(); ++i) {
  ------------------
  |  Branch (399:22): [True: 302, False: 151]
  ------------------
  400|    302|      for(auto certstore : certstores) {
  ------------------
  |  Branch (400:26): [True: 302, False: 302]
  ------------------
  401|    302|         crls[i] = certstore->find_crl_for(cert_path[i]);
  402|    302|         if(crls[i]) {
  ------------------
  |  Branch (402:13): [True: 0, False: 302]
  ------------------
  403|      0|            break;
  404|      0|         }
  405|    302|      }
  406|    302|   }
  407|       |
  408|    151|   return PKIX::check_crl(cert_path, crls, ref_time);
  409|    151|}
_ZN5Botan4PKIX27build_all_certificate_pathsERNSt3__16vectorINS2_INS_16X509_CertificateENS1_9allocatorIS3_EEEENS4_IS6_EEEERKNS2_IPNS_17Certificate_StoreENS4_ISB_EEEERKNS1_8optionalIS3_EERKS6_:
  652|    775|                                                          const std::vector<X509_Certificate>& end_entity_extra) {
  653|    775|   if(!cert_paths_out.empty()) {
  ------------------
  |  Branch (653:7): [True: 0, False: 775]
  ------------------
  654|      0|      throw Invalid_Argument("PKIX::build_all_certificate_paths: cert_paths_out must be empty");
  655|      0|   }
  656|       |
  657|    775|   if(end_entity->is_self_signed()) {
  ------------------
  |  Branch (657:7): [True: 105, False: 670]
  ------------------
  658|    105|      return Certificate_Status_Code::CANNOT_ESTABLISH_TRUST;
  659|    105|   }
  660|       |
  661|       |   /*
  662|       |    * Pile up error messages
  663|       |    */
  664|    670|   std::vector<Certificate_Status_Code> stats;
  665|       |
  666|    670|   Certificate_Store_In_Memory ee_extras;
  667|    670|   for(const auto& cert : end_entity_extra) {
  ------------------
  |  Branch (667:25): [True: 0, False: 670]
  ------------------
  668|      0|      ee_extras.add_certificate(cert);
  669|      0|   }
  670|       |
  671|       |   /*
  672|       |   * This is an inelegant but functional way of preventing path loops
  673|       |   * (where C1 -> C2 -> C3 -> C1). We store a set of all the certificate
  674|       |   * fingerprints in the path. If there is a duplicate, we error out.
  675|       |   * TODO: save fingerprints in result struct? Maybe useful for blacklists, etc.
  676|       |   */
  677|    670|   std::set<std::string> certs_seen;
  678|       |
  679|       |   // new certs are added and removed from the path during the DFS
  680|       |   // it is copied into cert_paths_out when we encounter a trusted root
  681|    670|   std::vector<X509_Certificate> path_so_far;
  682|       |
  683|       |   // todo can we assume that the end certificate is not trusted?
  684|    670|   std::vector<cert_maybe_trusted> stack = {{end_entity, false}};
  685|       |
  686|  2.67k|   while(!stack.empty()) {
  ------------------
  |  Branch (686:10): [True: 2.00k, False: 670]
  ------------------
  687|  2.00k|      std::optional<X509_Certificate> last = stack.back().first;
  688|       |      // found a deletion marker that guides the DFS, backtracing
  689|  2.00k|      if(last == std::nullopt) {
  ------------------
  |  Branch (689:10): [True: 666, False: 1.33k]
  ------------------
  690|    666|         stack.pop_back();
  691|    666|         std::string fprint = path_so_far.back().fingerprint("SHA-256");
  692|    666|         certs_seen.erase(fprint);
  693|    666|         path_so_far.pop_back();
  694|    666|      }
  695|       |      // process next cert on the path
  696|  1.33k|      else {
  697|  1.33k|         const bool trusted = stack.back().second;
  698|  1.33k|         stack.pop_back();
  699|       |
  700|       |         // certificate already seen?
  701|  1.33k|         const std::string fprint = last->fingerprint("SHA-256");
  702|  1.33k|         if(certs_seen.count(fprint) == 1) {
  ------------------
  |  Branch (702:13): [True: 126, False: 1.21k]
  ------------------
  703|    126|            stats.push_back(Certificate_Status_Code::CERT_CHAIN_LOOP);
  704|       |            // the current path ended in a loop
  705|    126|            continue;
  706|    126|         }
  707|       |
  708|       |         // the current path ends here
  709|  1.21k|         if(last->is_self_signed()) {
  ------------------
  |  Branch (709:13): [True: 400, False: 810]
  ------------------
  710|       |            // found a trust anchor
  711|    400|            if(trusted) {
  ------------------
  |  Branch (711:16): [True: 400, False: 0]
  ------------------
  712|    400|               cert_paths_out.push_back(path_so_far);
  713|    400|               cert_paths_out.back().push_back(*last);
  714|       |
  715|    400|               continue;
  716|    400|            }
  717|       |            // found an untrustworthy root
  718|      0|            else {
  719|      0|               stats.push_back(Certificate_Status_Code::CANNOT_ESTABLISH_TRUST);
  720|      0|               continue;
  721|      0|            }
  722|    400|         }
  723|       |
  724|    810|         const X509_DN issuer_dn = last->issuer_dn();
  725|    810|         const std::vector<uint8_t> auth_key_id = last->authority_key_id();
  726|       |
  727|       |         // search for trusted issuers
  728|    810|         std::vector<X509_Certificate> trusted_issuers;
  729|    810|         for(Certificate_Store* store : trusted_certstores) {
  ------------------
  |  Branch (729:39): [True: 810, False: 810]
  ------------------
  730|    810|            auto new_issuers = store->find_all_certs(issuer_dn, auth_key_id);
  731|    810|            trusted_issuers.insert(trusted_issuers.end(), new_issuers.begin(), new_issuers.end());
  732|    810|         }
  733|       |
  734|       |         // search the supplemental certs
  735|    810|         std::vector<X509_Certificate> misc_issuers = ee_extras.find_all_certs(issuer_dn, auth_key_id);
  736|       |
  737|       |         // if we could not find any issuers, the current path ends here
  738|    810|         if(trusted_issuers.empty() && misc_issuers.empty()) {
  ------------------
  |  Branch (738:13): [True: 144, False: 666]
  |  Branch (738:40): [True: 144, False: 0]
  ------------------
  739|    144|            stats.push_back(Certificate_Status_Code::CERT_ISSUER_NOT_FOUND);
  740|    144|            continue;
  741|    144|         }
  742|       |
  743|       |         // push the latest certificate onto the path_so_far
  744|    666|         path_so_far.push_back(*last);
  745|    666|         certs_seen.emplace(fprint);
  746|       |
  747|       |         // push a deletion marker on the stack for backtracing later
  748|    666|         stack.push_back({std::optional<X509_Certificate>(), false});
  749|       |
  750|    666|         for(const auto& trusted_cert : trusted_issuers) {
  ------------------
  |  Branch (750:39): [True: 666, False: 666]
  ------------------
  751|    666|            stack.push_back({trusted_cert, true});
  752|    666|         }
  753|       |
  754|    666|         for(const auto& misc : misc_issuers) {
  ------------------
  |  Branch (754:31): [True: 0, False: 666]
  ------------------
  755|      0|            stack.push_back({misc, false});
  756|      0|         }
  757|    666|      }
  758|  2.00k|   }
  759|       |
  760|       |   // could not construct any potentially valid path
  761|    670|   if(cert_paths_out.empty()) {
  ------------------
  |  Branch (761:7): [True: 270, False: 400]
  ------------------
  762|    270|      if(stats.empty()) {
  ------------------
  |  Branch (762:10): [True: 0, False: 270]
  ------------------
  763|      0|         throw Internal_Error("X509 path building failed for unknown reasons");
  764|    270|      } else {
  765|       |         // arbitrarily return the first error
  766|    270|         return stats[0];
  767|    270|      }
  768|    400|   } else {
  769|    400|      return Certificate_Status_Code::OK;
  770|    400|   }
  771|    670|}
_ZN5Botan4PKIX23merge_revocation_statusERNSt3__16vectorINS1_3setINS_23Certificate_Status_CodeENS1_4lessIS4_EENS1_9allocatorIS4_EEEENS7_IS9_EEEERKSB_SE_RKNS_28Path_Validation_RestrictionsE:
  776|    151|                                   const Path_Validation_Restrictions& restrictions) {
  777|    151|   if(chain_status.empty()) {
  ------------------
  |  Branch (777:7): [True: 0, False: 151]
  ------------------
  778|      0|      throw Invalid_Argument("PKIX::merge_revocation_status chain_status was empty");
  779|      0|   }
  780|       |
  781|    302|   for(size_t i = 0; i != chain_status.size() - 1; ++i) {
  ------------------
  |  Branch (781:22): [True: 151, False: 151]
  ------------------
  782|    151|      bool had_crl = false, had_ocsp = false;
  783|       |
  784|    151|      if(i < crl.size() && !crl[i].empty()) {
  ------------------
  |  Branch (784:10): [True: 0, False: 151]
  |  Branch (784:28): [True: 0, False: 0]
  ------------------
  785|      0|         for(auto&& code : crl[i]) {
  ------------------
  |  Branch (785:26): [True: 0, False: 0]
  ------------------
  786|      0|            if(code == Certificate_Status_Code::VALID_CRL_CHECKED) {
  ------------------
  |  Branch (786:16): [True: 0, False: 0]
  ------------------
  787|      0|               had_crl = true;
  788|      0|            }
  789|      0|            chain_status[i].insert(code);
  790|      0|         }
  791|      0|      }
  792|       |
  793|    151|      if(i < ocsp.size() && !ocsp[i].empty()) {
  ------------------
  |  Branch (793:10): [True: 0, False: 151]
  |  Branch (793:29): [True: 0, False: 0]
  ------------------
  794|      0|         for(auto&& code : ocsp[i]) {
  ------------------
  |  Branch (794:26): [True: 0, False: 0]
  ------------------
  795|      0|            if(code == Certificate_Status_Code::OCSP_RESPONSE_GOOD ||
  ------------------
  |  Branch (795:16): [True: 0, False: 0]
  ------------------
  796|      0|               code == Certificate_Status_Code::OCSP_NO_REVOCATION_URL ||   // softfail
  ------------------
  |  Branch (796:16): [True: 0, False: 0]
  ------------------
  797|      0|               code == Certificate_Status_Code::OCSP_SERVER_NOT_AVAILABLE)  // softfail
  ------------------
  |  Branch (797:16): [True: 0, False: 0]
  ------------------
  798|      0|            {
  799|      0|               had_ocsp = true;
  800|      0|            }
  801|       |
  802|      0|            chain_status[i].insert(code);
  803|      0|         }
  804|      0|      }
  805|       |
  806|    151|      if(had_crl == false && had_ocsp == false) {
  ------------------
  |  Branch (806:10): [True: 151, False: 0]
  |  Branch (806:30): [True: 151, False: 0]
  ------------------
  807|    151|         if((restrictions.require_revocation_information() && i == 0) ||
  ------------------
  |  Branch (807:14): [True: 0, False: 151]
  |  Branch (807:63): [True: 0, False: 0]
  ------------------
  808|    151|            (restrictions.ocsp_all_intermediates() && i > 0)) {
  ------------------
  |  Branch (808:14): [True: 0, False: 151]
  |  Branch (808:55): [True: 0, False: 0]
  ------------------
  809|      0|            chain_status[i].insert(Certificate_Status_Code::NO_REVOCATION_DATA);
  810|      0|         }
  811|    151|      }
  812|    151|   }
  813|    151|}
_ZN5Botan4PKIX14overall_statusERKNSt3__16vectorINS1_3setINS_23Certificate_Status_CodeENS1_4lessIS4_EENS1_9allocatorIS4_EEEENS7_IS9_EEEE:
  815|    151|Certificate_Status_Code PKIX::overall_status(const CertificatePathStatusCodes& cert_status) {
  816|    151|   if(cert_status.empty()) {
  ------------------
  |  Branch (816:7): [True: 0, False: 151]
  ------------------
  817|      0|      throw Invalid_Argument("PKIX::overall_status empty cert status");
  818|      0|   }
  819|       |
  820|    151|   Certificate_Status_Code overall_status = Certificate_Status_Code::OK;
  821|       |
  822|       |   // take the "worst" error as overall
  823|    302|   for(const std::set<Certificate_Status_Code>& s : cert_status) {
  ------------------
  |  Branch (823:51): [True: 302, False: 151]
  ------------------
  824|    302|      if(!s.empty()) {
  ------------------
  |  Branch (824:10): [True: 302, False: 0]
  ------------------
  825|    302|         auto worst = *s.rbegin();
  826|       |         // Leave informative OCSP/CRL confirmations on cert-level status only
  827|    302|         if(worst >= Certificate_Status_Code::FIRST_ERROR_STATUS && worst > overall_status) {
  ------------------
  |  Branch (827:13): [True: 302, False: 0]
  |  Branch (827:69): [True: 223, False: 79]
  ------------------
  828|    223|            overall_status = worst;
  829|    223|         }
  830|    302|      }
  831|    302|   }
  832|    151|   return overall_status;
  833|    151|}
_ZN5Botan18x509_path_validateERKNSt3__16vectorINS_16X509_CertificateENS0_9allocatorIS2_EEEERKNS_28Path_Validation_RestrictionsERKNS1_IPNS_17Certificate_StoreENS3_ISC_EEEENS0_17basic_string_viewIcNS0_11char_traitsIcEEEENS_10Usage_TypeENS0_6chrono10time_pointINSM_12system_clockENSM_8durationIxNS0_5ratioILl1ELl1000000EEEEEEENSP_IxNSQ_ILl1ELl1000EEEEERKNS1_INS0_8optionalINS_4OCSP8ResponseEEENS3_ISZ_EEEE:
  842|    775|                                          const std::vector<std::optional<OCSP::Response>>& ocsp_resp) {
  843|    775|   if(end_certs.empty()) {
  ------------------
  |  Branch (843:7): [True: 0, False: 775]
  ------------------
  844|      0|      throw Invalid_Argument("x509_path_validate called with no subjects");
  845|      0|   }
  846|       |
  847|    775|   X509_Certificate end_entity = end_certs[0];
  848|    775|   std::vector<X509_Certificate> end_entity_extra;
  849|    775|   for(size_t i = 1; i < end_certs.size(); ++i) {
  ------------------
  |  Branch (849:22): [True: 0, False: 775]
  ------------------
  850|      0|      end_entity_extra.push_back(end_certs[i]);
  851|      0|   }
  852|       |
  853|    775|   std::vector<std::vector<X509_Certificate>> cert_paths;
  854|    775|   Certificate_Status_Code path_building_result =
  855|    775|      PKIX::build_all_certificate_paths(cert_paths, trusted_roots, end_entity, end_entity_extra);
  856|       |
  857|       |   // If we cannot successfully build a chain to a trusted self-signed root, stop now
  858|    775|   if(path_building_result != Certificate_Status_Code::OK) {
  ------------------
  |  Branch (858:7): [True: 375, False: 400]
  ------------------
  859|    375|      return Path_Validation_Result(path_building_result);
  860|    375|   }
  861|       |
  862|    400|   std::vector<Path_Validation_Result> error_results;
  863|       |   // Try validating all the potentially valid paths and return the first one to validate properly
  864|    400|   for(auto cert_path : cert_paths) {
  ------------------
  |  Branch (864:23): [True: 400, False: 400]
  ------------------
  865|    400|      CertificatePathStatusCodes status = PKIX::check_chain(cert_path, ref_time, hostname, usage, restrictions);
  866|       |
  867|    400|      CertificatePathStatusCodes crl_status = PKIX::check_crl(cert_path, trusted_roots, ref_time);
  868|       |
  869|    400|      CertificatePathStatusCodes ocsp_status;
  870|       |
  871|    400|      if(!ocsp_resp.empty()) {
  ------------------
  |  Branch (871:10): [True: 0, False: 400]
  ------------------
  872|      0|         ocsp_status = PKIX::check_ocsp(cert_path, ocsp_resp, trusted_roots, ref_time, restrictions);
  873|      0|      }
  874|       |
  875|    400|      if(ocsp_status.empty() && ocsp_timeout != std::chrono::milliseconds(0)) {
  ------------------
  |  Branch (875:10): [True: 151, False: 249]
  |  Branch (875:10): [True: 0, False: 400]
  |  Branch (875:33): [True: 0, False: 151]
  ------------------
  876|      0|#if defined(BOTAN_TARGET_OS_HAS_THREADS) && defined(BOTAN_HAS_HTTP_UTIL)
  877|      0|         ocsp_status = PKIX::check_ocsp_online(cert_path, trusted_roots, ref_time, ocsp_timeout, restrictions);
  878|       |#else
  879|       |         ocsp_status.resize(1);
  880|       |         ocsp_status[0].insert(Certificate_Status_Code::OCSP_NO_HTTP);
  881|       |#endif
  882|      0|      }
  883|       |
  884|    400|      PKIX::merge_revocation_status(status, crl_status, ocsp_status, restrictions);
  885|       |
  886|    400|      Path_Validation_Result pvd(status, std::move(cert_path));
  887|    400|      if(pvd.successful_validation()) {
  ------------------
  |  Branch (887:10): [True: 0, False: 400]
  ------------------
  888|      0|         return pvd;
  889|    400|      } else {
  890|    400|         error_results.push_back(std::move(pvd));
  891|    400|      }
  892|    400|   }
  893|    400|   return error_results[0];
  894|    400|}
_ZN5Botan18x509_path_validateERKNS_16X509_CertificateERKNS_28Path_Validation_RestrictionsERKNSt3__16vectorIPNS_17Certificate_StoreENS6_9allocatorIS9_EEEENS6_17basic_string_viewIcNS6_11char_traitsIcEEEENS_10Usage_TypeENS6_6chrono10time_pointINSK_12system_clockENSK_8durationIxNS6_5ratioILl1ELl1000000EEEEEEENSN_IxNSO_ILl1ELl1000EEEEERKNS7_INS6_8optionalINS_4OCSP8ResponseEEENSA_ISX_EEEE:
  903|    775|                                          const std::vector<std::optional<OCSP::Response>>& ocsp_resp) {
  904|    775|   std::vector<X509_Certificate> certs;
  905|    775|   certs.push_back(end_cert);
  906|    775|   return x509_path_validate(certs, restrictions, trusted_roots, hostname, usage, when, ocsp_timeout, ocsp_resp);
  907|    775|}
_ZN5Botan28Path_Validation_RestrictionsC2EbmbNSt3__16chrono8durationIxNS1_5ratioILl1ELl1EEEEENS1_10unique_ptrINS_17Certificate_StoreENS1_14default_deleteIS8_EEEE:
  949|    775|      m_trusted_ocsp_responders(std::move(trusted_ocsp_responders)) {
  950|    775|   if(key_strength <= 80) {
  ------------------
  |  Branch (950:7): [True: 0, False: 775]
  ------------------
  951|      0|      m_trusted_hashes.insert("SHA-1");
  952|      0|   }
  953|       |
  954|    775|   m_trusted_hashes.insert("SHA-224");
  955|    775|   m_trusted_hashes.insert("SHA-256");
  956|    775|   m_trusted_hashes.insert("SHA-384");
  957|    775|   m_trusted_hashes.insert("SHA-512");
  958|    775|   m_trusted_hashes.insert("SHAKE-256(512)");
  959|    775|}
_ZN5Botan22Path_Validation_ResultC2ENSt3__16vectorINS1_3setINS_23Certificate_Status_CodeENS1_4lessIS4_EENS1_9allocatorIS4_EEEENS7_IS9_EEEEONS2_INS_16X509_CertificateENS7_ISC_EEEE:
  983|    151|      m_overall(PKIX::overall_status(m_all_status)) {}
_ZNK5Botan22Path_Validation_Result21successful_validationEv:
  996|    151|bool Path_Validation_Result::successful_validation() const {
  997|    151|   return (result() == Certificate_Status_Code::VERIFIED || result() == Certificate_Status_Code::OCSP_RESPONSE_GOOD ||
  ------------------
  |  Branch (997:12): [True: 0, False: 151]
  |  Branch (997:61): [True: 0, False: 151]
  ------------------
  998|    151|           result() == Certificate_Status_Code::VALID_CRL_CHECKED);
  ------------------
  |  Branch (998:12): [True: 0, False: 151]
  ------------------
  999|    151|}
x509path.cpp:_ZN5Botan12_GLOBAL__N_113find_warningsERKNSt3__16vectorINS1_3setINS_23Certificate_Status_CodeENS1_4lessIS4_EENS1_9allocatorIS4_EEEENS7_IS9_EEEE:
  962|    151|CertificatePathStatusCodes find_warnings(const CertificatePathStatusCodes& all_statuses) {
  963|    151|   CertificatePathStatusCodes warnings;
  964|    302|   for(const auto& status_set_i : all_statuses) {
  ------------------
  |  Branch (964:33): [True: 302, False: 151]
  ------------------
  965|    302|      std::set<Certificate_Status_Code> warning_set_i;
  966|  1.35k|      for(const auto& code : status_set_i) {
  ------------------
  |  Branch (966:28): [True: 1.35k, False: 302]
  ------------------
  967|  1.35k|         if(code >= Certificate_Status_Code::FIRST_WARNING_STATUS &&
  ------------------
  |  Branch (967:13): [True: 1.35k, False: 0]
  ------------------
  968|  1.35k|            code < Certificate_Status_Code::FIRST_ERROR_STATUS) {
  ------------------
  |  Branch (968:13): [True: 130, False: 1.22k]
  ------------------
  969|    130|            warning_set_i.insert(code);
  970|    130|         }
  971|  1.35k|      }
  972|    302|      warnings.push_back(warning_set_i);
  973|    302|   }
  974|    151|   return warnings;
  975|    151|}

