_ZN5Botan11ASN1_ObjectD2Ev: 114| 503k| virtual ~ASN1_Object() = default; _ZN5Botan10BER_ObjectC2Ev: 122| 483k| BER_Object() : m_type_tag(ASN1_Type::NoObject), m_class_tag(ASN1_Class::Universal) {} _ZNK5Botan10BER_Object6is_setEv: 132| 721k| bool is_set() const { return m_type_tag != ASN1_Type::NoObject; } _ZNK5Botan10BER_Object7taggingEv: 134| 373k| uint32_t tagging() const { return type_tag() | class_tag(); } _ZNK5Botan10BER_Object8type_tagEv: 136| 373k| ASN1_Type type_tag() const { return m_type_tag; } _ZNK5Botan10BER_Object9class_tagEv: 138| 373k| ASN1_Class class_tag() const { return m_class_tag; } _ZNK5Botan10BER_Object4typeEv: 140| 48.7k| ASN1_Type type() const { return m_type_tag; } _ZNK5Botan10BER_Object9get_classEv: 142| 2.47k| ASN1_Class get_class() const { return m_class_tag; } _ZNK5Botan10BER_Object4bitsEv: 144| 4.35M| const uint8_t* bits() const { return m_value.data(); } _ZNK5Botan10BER_Object6lengthEv: 146| 9.12M| size_t length() const { return m_value.size(); } _ZN5Botan10BER_Object12mutable_bitsEm: 163| 319k| uint8_t* mutable_bits(size_t length) { 164| 319k| m_value.resize(length); 165| 319k| return m_value.data(); 166| 319k| } _ZN5Botan3OIDC2Ev: 212| 57.2k| explicit OID() {} _ZN5Botan3OIDC2ESt16initializer_listIjE: 223| 4.35k| explicit OID(std::initializer_list init) : m_id(init) { 224| 4.35k| BOTAN_ARG_CHECK(m_id.size() > 2 && m_id[0] <= 2 && (m_id[0] != 2 || m_id[1] <= 39), "Invalid OID"); ------------------ | | 30| 4.35k| do { \ | | 31| 21.8k| if(!(expr)) \ | | ------------------ | | | Branch (31:12): [True: 4.35k, False: 0] | | | Branch (31:12): [True: 4.35k, False: 0] | | | Branch (31:12): [True: 4.27k, False: 73] | | | Branch (31:12): [True: 73, False: 0] | | ------------------ | | 32| 4.35k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 4.35k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 225| 4.35k| } _ZNK5Botan3OID5emptyEv: 259| 97.4k| bool empty() const { return m_id.empty(); } _ZNK5Botan3OID9has_valueEv: 265| 1.38k| bool has_value() const { return (m_id.empty() == false); } _ZNK5Botan3OID14get_componentsEv: 271| 226k| const std::vector& get_components() const { return m_id; } _ZNK5Botan3OIDeqERKS0_: 303| 193k| bool operator==(const OID& other) const { return m_id == other.m_id; } _ZNK5Botan11ASN1_String5valueEv: 407| 9.36k| const std::string& value() const { return m_utf8_str; } _ZNK5Botan11ASN1_String5emptyEv: 411| 14.8k| bool empty() const { return m_utf8_str.empty(); } _ZNK5Botan19AlgorithmIdentifier3oidEv: 447| 16.9k| const OID& oid() const { return m_oid; } _ZNK5Botan19AlgorithmIdentifier10parametersEv: 449| 7.05k| const std::vector& parameters() const { return m_parameters; } _ZNK5Botan19AlgorithmIdentifier20parameters_are_emptyEv: 461| 8.61k| bool parameters_are_empty() const { return m_parameters.empty(); } _ZNK5Botan19AlgorithmIdentifier28parameters_are_null_or_emptyEv: 463| 8.07k| bool parameters_are_null_or_empty() const { return parameters_are_empty() || parameters_are_null(); } ------------------ | Branch (463:58): [True: 3.00k, False: 5.06k] | Branch (463:84): [True: 4.14k, False: 922] ------------------ _ZN5BotanorENS_10ASN1_ClassES0_: 76| 166k|inline ASN1_Class operator|(ASN1_Class x, ASN1_Class y) { 77| 166k| return static_cast(static_cast(x) | static_cast(y)); 78| 166k|} _ZN5BotanorENS_9ASN1_TypeENS_10ASN1_ClassE: 80| 373k|inline uint32_t operator|(ASN1_Type x, ASN1_Class y) { return static_cast(x) | static_cast(y); } _ZN5BotanorENS_10ASN1_ClassENS_9ASN1_TypeE: 82| 53.4k|inline uint32_t operator|(ASN1_Class x, ASN1_Type y) { return static_cast(x) | static_cast(y); } _ZN5BotanneERKNS_3OIDES2_: 320| 6.76k|inline bool operator!=(const OID& a, const OID& b) { return !(a == b); } _ZN5Botan11ASN1_ObjectC2Ev: 111| 333k| ASN1_Object() = default; _ZN5Botan19AlgorithmIdentifierC2Ev: 439| 20.0k| AlgorithmIdentifier() = default; _ZN5Botan9ASN1_TimeC2Ev: 354| 10.5k| ASN1_Time() = default; _ZN5Botan10BER_ObjectaSEOS0_: 130| 86.0k| BER_Object& operator=(BER_Object&& other) = default; _ZN5Botan11ASN1_ObjectaSERKS0_: 113| 394| ASN1_Object& operator=(const ASN1_Object&) = default; _ZN5Botan11ASN1_ObjectC2ERKS0_: 112| 169k| ASN1_Object(const ASN1_Object&) = default; _ZN5Botan10BER_ObjectC2EOS0_: 128| 131k| BER_Object(BER_Object&& other) = default; _ZN5Botan10BER_ObjectaSERKS0_: 126| 2.31k| BER_Object& operator=(const BER_Object& other) = default; _ZN5Botan12ignore_paramIRmEEvOT_: 111| 32.5M|void ignore_param(T&&) {} _ZN5Botan13ignore_paramsIJRhEEEvDpOT_: 114| 15.2k|void ignore_params(T&&... args) { 115| 15.2k| (ignore_param(args), ...); 116| 15.2k|} _ZN5Botan12ignore_paramIRhEEvOT_: 111| 15.2k|void ignore_param(T&&) {} _ZN5Botan13ignore_paramsIJRmEEEvDpOT_: 114| 32.5M|void ignore_params(T&&... args) { 115| 32.5M| (ignore_param(args), ...); 116| 32.5M|} _ZN5Botan13ignore_paramsIJRKmEEEvDpOT_: 114| 373k|void ignore_params(T&&... args) { 115| 373k| (ignore_param(args), ...); 116| 373k|} _ZN5Botan12ignore_paramIRKmEEvOT_: 111| 5.14M|void ignore_param(T&&) {} _ZN5Botan13ignore_paramsIJRKmS2_EEEvDpOT_: 114| 2.38M|void ignore_params(T&&... args) { 115| 2.38M| (ignore_param(args), ...); 116| 2.38M|} _ZN5Botan13ignore_paramsIJRPKmRmEEEvDpOT_: 114| 2.12k|void ignore_params(T&&... args) { 115| 2.12k| (ignore_param(args), ...); 116| 2.12k|} _ZN5Botan12ignore_paramIRPKmEEvOT_: 111| 2.12k|void ignore_param(T&&) {} _ZN5Botan13ignore_paramsIJRNSt3__16vectorImNS_16secure_allocatorImEEEEEEEvDpOT_: 114| 520k|void ignore_params(T&&... args) { 115| 520k| (ignore_param(args), ...); 116| 520k|} _ZN5Botan12ignore_paramIRNSt3__16vectorImNS_16secure_allocatorImEEEEEEvOT_: 111| 520k|void ignore_param(T&&) {} _ZN5Botan13ignore_paramsIJRlEEEvDpOT_: 114| 425k|void ignore_params(T&&... args) { 115| 425k| (ignore_param(args), ...); 116| 425k|} _ZN5Botan12ignore_paramIRlEEvOT_: 111| 425k|void ignore_param(T&&) {} _ZN5Botan11BER_Decoder14start_sequenceEv: 112| 91.4k| BER_Decoder start_sequence() { return start_cons(ASN1_Type::Sequence, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder6decodeINSt3__19allocatorIhEEEERS0_RNS2_6vectorIhT_EENS_9ASN1_TypeE: 195| 27.7k| BER_Decoder& decode(std::vector& out, ASN1_Type real_type) { 196| 27.7k| return decode(out, real_type, real_type, ASN1_Class::Universal); 197| 27.7k| } _ZN5Botan11BER_Decoder9raw_bytesINSt3__19allocatorIhEEEERS0_RNS2_6vectorIhT_EE: 160| 34.8k| BER_Decoder& raw_bytes(std::vector& out) { 161| 34.8k| out.clear(); 162| 34.8k| uint8_t buf; 163| 3.45M| while(m_source->read_byte(buf)) ------------------ | Branch (163:16): [True: 3.42M, False: 34.8k] ------------------ 164| 3.42M| out.push_back(buf); 165| 34.8k| return (*this); 166| 34.8k| } _ZN5Botan11BER_DecoderC2ENSt3__14spanIKhLm18446744073709551615EEE: 31| 612| BER_Decoder(std::span buf) : BER_Decoder(buf.data(), buf.size()) {} _ZN5Botan11BER_DecoderC2ERKNS_10BER_ObjectE: 51| 9.72k| BER_Decoder(const BER_Object& obj) : BER_Decoder(obj.bits(), obj.length()) {} _ZN5Botan11BER_DecoderC2EONS_10BER_ObjectE: 56| 1.98k| BER_Decoder(BER_Object&& obj) : BER_Decoder(std::move(obj), nullptr) {} _ZN5Botan11BER_Decoder8get_nextERNS_10BER_ObjectE: 68| 8.95k| BER_Decoder& get_next(BER_Object& ber) { 69| 8.95k| ber = get_next_object(); 70| 8.95k| return (*this); 71| 8.95k| } _ZN5Botan11BER_Decoder9start_setEv: 114| 15.3k| BER_Decoder start_set() { return start_cons(ASN1_Type::Set, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder22start_context_specificEj: 116| 685| BER_Decoder start_context_specific(uint32_t tag) { 117| 685| return start_cons(ASN1_Type(tag), ASN1_Class::ContextSpecific); 118| 685| } _ZN5Botan11BER_Decoder6decodeERm: 178| 2.66k| BER_Decoder& decode(size_t& out) { return decode(out, ASN1_Type::Integer, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder6decodeERNS_6BigIntE: 183| 8.41k| BER_Decoder& decode(BigInt& out) { return decode(out, ASN1_Type::Integer, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder15decode_optionalImEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS3_: 313| 6.41k|BER_Decoder& BER_Decoder::decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value) { 314| 6.41k| BER_Object obj = get_next_object(); 315| | 316| 6.41k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (316:7): [True: 2.11k, False: 4.30k] ------------------ 317| 2.11k| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (317:10): [True: 1.88k, False: 223] ------------------ 318| 1.88k| BER_Decoder(std::move(obj)).decode(out).verify_end(); 319| 1.88k| } else { 320| 223| push_back(std::move(obj)); 321| 223| decode(out, type_tag, class_tag); 322| 223| } 323| 4.30k| } else { 324| 4.30k| out = default_value; 325| 4.30k| push_back(std::move(obj)); 326| 4.30k| } 327| | 328| 6.41k| return (*this); 329| 6.41k|} _ZN5Botan11BER_Decoder22decode_optional_stringINSt3__19allocatorIhEEEERS0_RNS2_6vectorIhT_EENS_9ASN1_TypeEjNS_10ASN1_ClassE: 271| 9.43k| ASN1_Class class_tag = ASN1_Class::ContextSpecific) { 272| 9.43k| BER_Object obj = get_next_object(); 273| | 274| 9.43k| ASN1_Type type_tag = static_cast(expected_tag); 275| | 276| 9.43k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (276:13): [True: 92, False: 9.34k] ------------------ 277| 92| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (277:16): [True: 0, False: 92] ------------------ 278| 0| BER_Decoder(std::move(obj)).decode(out, real_type).verify_end(); 279| 92| } else { 280| 92| push_back(std::move(obj)); 281| 92| decode(out, real_type, type_tag, class_tag); 282| 92| } 283| 9.34k| } else { 284| 9.34k| out.clear(); 285| 9.34k| push_back(std::move(obj)); 286| 9.34k| } 287| | 288| 9.43k| return (*this); 289| 9.43k| } _ZN5Botan11BER_Decoder6decodeINS_16secure_allocatorIhEEEERS0_RNSt3__16vectorIhT_EENS_9ASN1_TypeE: 195| 726| BER_Decoder& decode(std::vector& out, ASN1_Type real_type) { 196| 726| return decode(out, real_type, real_type, ASN1_Class::Universal); 197| 726| } _ZN5Botan11BER_Decoder15decode_optionalIbEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS3_: 313| 14.7k|BER_Decoder& BER_Decoder::decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value) { 314| 14.7k| BER_Object obj = get_next_object(); 315| | 316| 14.7k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (316:7): [True: 2.43k, False: 12.3k] ------------------ 317| 2.43k| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (317:10): [True: 0, False: 2.43k] ------------------ 318| 0| BER_Decoder(std::move(obj)).decode(out).verify_end(); 319| 2.43k| } else { 320| 2.43k| push_back(std::move(obj)); 321| 2.43k| decode(out, type_tag, class_tag); 322| 2.43k| } 323| 12.3k| } else { 324| 12.3k| out = default_value; 325| 12.3k| push_back(std::move(obj)); 326| 12.3k| } 327| | 328| 14.7k| return (*this); 329| 14.7k|} _ZN5Botan11BER_Decoder11decode_listINS_3OIDEEERS0_RNSt3__16vectorIT_NS4_9allocatorIS6_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 360| 226|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 361| 226| BER_Decoder list = start_cons(type_tag, class_tag); 362| | 363| 642| while(list.more_items()) { ------------------ | Branch (363:10): [True: 416, False: 226] ------------------ 364| 416| T value; 365| 416| list.decode(value); 366| 416| vec.push_back(std::move(value)); 367| 416| } 368| | 369| 226| list.end_cons(); 370| | 371| 226| return (*this); 372| 226|} _ZN5Botan11BER_Decoder11decode_listINS_14GeneralSubtreeEEERS0_RNSt3__16vectorIT_NS4_9allocatorIS6_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 360| 1.12k|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 361| 1.12k| BER_Decoder list = start_cons(type_tag, class_tag); 362| | 363| 2.55k| while(list.more_items()) { ------------------ | Branch (363:10): [True: 1.42k, False: 1.12k] ------------------ 364| 1.42k| T value; 365| 1.42k| list.decode(value); 366| 1.42k| vec.push_back(std::move(value)); 367| 1.42k| } 368| | 369| 1.12k| list.end_cons(); 370| | 371| 1.12k| return (*this); 372| 1.12k|} x509_ext.cpp:_ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension12_GLOBAL__N_118Policy_InformationEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 360| 447|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 361| 447| BER_Decoder list = start_cons(type_tag, class_tag); 362| | 363| 834| while(list.more_items()) { ------------------ | Branch (363:10): [True: 387, False: 447] ------------------ 364| 387| T value; 365| 387| list.decode(value); 366| 387| vec.push_back(std::move(value)); 367| 387| } 368| | 369| 447| list.end_cons(); 370| | 371| 447| return (*this); 372| 447|} _ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension23CRL_Distribution_Points18Distribution_PointEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 360| 563|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 361| 563| BER_Decoder list = start_cons(type_tag, class_tag); 362| | 363| 1.19k| while(list.more_items()) { ------------------ | Branch (363:10): [True: 629, False: 563] ------------------ 364| 629| T value; 365| 629| list.decode(value); 366| 629| vec.push_back(std::move(value)); 367| 629| } 368| | 369| 563| list.end_cons(); 370| | 371| 563| return (*this); 372| 563|} _ZN5Botan11BER_Decoder24decode_optional_implicitINS_15AlternativeNameEEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassES6_S7_RKS4_: 340| 549| const T& default_value) { 341| 549| BER_Object obj = get_next_object(); 342| | 343| 549| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (343:7): [True: 308, False: 241] ------------------ 344| 308| obj.set_tagging(real_type, real_class); 345| 308| push_back(std::move(obj)); 346| 308| decode(out, real_type, real_class); 347| 308| } else { 348| | // Not what we wanted, push it back on the stream 349| 241| out = default_value; 350| 241| push_back(std::move(obj)); 351| 241| } 352| | 353| 549| return (*this); 354| 549|} _ZN5Botan11BER_Decoder16decode_and_checkImEERS0_RKT_NSt3__117basic_string_viewIcNS6_11char_traitsIcEEEE: 254| 364| BER_Decoder& decode_and_check(const T& expected, std::string_view error_msg) { 255| 364| T actual; 256| 364| decode(actual); 257| | 258| 364| if(actual != expected) ------------------ | Branch (258:13): [True: 25, False: 339] ------------------ 259| 25| throw Decoding_Error(error_msg); 260| | 261| 339| return (*this); 262| 364| } _ZN5Botan11BER_Decoder15decode_optionalINS_19AlgorithmIdentifierEEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS4_: 313| 109|BER_Decoder& BER_Decoder::decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value) { 314| 109| BER_Object obj = get_next_object(); 315| | 316| 109| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (316:7): [True: 98, False: 11] ------------------ 317| 98| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (317:10): [True: 98, False: 0] ------------------ 318| 98| BER_Decoder(std::move(obj)).decode(out).verify_end(); 319| 98| } else { 320| 0| push_back(std::move(obj)); 321| 0| decode(out, type_tag, class_tag); 322| 0| } 323| 98| } else { 324| 11| out = default_value; 325| 11| push_back(std::move(obj)); 326| 11| } 327| | 328| 109| return (*this); 329| 109|} _ZN5Botan11BER_Decoder16decode_and_checkINS_3OIDEEERS0_RKT_NSt3__117basic_string_viewIcNS7_11char_traitsIcEEEE: 254| 335| BER_Decoder& decode_and_check(const T& expected, std::string_view error_msg) { 255| 335| T actual; 256| 335| decode(actual); 257| | 258| 335| if(actual != expected) ------------------ | Branch (258:13): [True: 13, False: 322] ------------------ 259| 13| throw Decoding_Error(error_msg); 260| | 261| 322| return (*this); 262| 335| } _ZN5Botan11BER_Decoder22decode_optional_stringINSt3__19allocatorIhEEEERS0_RNS2_6vectorIhT_EENS_9ASN1_TypeESA_NS_10ASN1_ClassE: 295| 318| ASN1_Class class_tag = ASN1_Class::ContextSpecific) { 296| 318| return decode_optional_string(out, real_type, static_cast(expected_tag), class_tag); 297| 318| } _ZN5Botan6BigIntC2Ev: 39| 4.99M| BigInt() = default; _ZNK5Botan6BigInt11is_negativeEv: 524| 20.5M| bool is_negative() const { return (sign() == Negative); } _ZNK5Botan6BigInt4signEv: 536| 35.5M| Sign sign() const { return (m_signedness); } _ZN5Botan6BigInt6encodeERKS0_: 737| 4.79k| static std::vector encode(const BigInt& n) { 738| 4.79k| std::vector output(n.bytes()); 739| 4.79k| n.binary_encode(output.data()); 740| 4.79k| return output; 741| 4.79k| } _ZN5Botan6BigIntD2Ev: 147| 6.63M| ~BigInt() { const_time_unpoison(); } _ZNK5Botan6BigInt19const_time_unpoisonEv: 710| 6.64M| void const_time_unpoison() const {} _ZN5Botan6BigInt4zeroEv: 44| 75.3k| static BigInt zero() { return BigInt(); } _ZN5Botan6BigInt3oneEv: 49| 1.00k| static BigInt one() { return BigInt::from_word(1); } _ZN5Botan6BigIntC2EOS0_: 145| 270k| BigInt(BigInt&& other) { this->swap(other); } _ZN5Botan6BigIntaSEOS0_: 152| 1.95M| BigInt& operator=(BigInt&& other) { 153| 1.95M| if(this != &other) ------------------ | Branch (153:13): [True: 1.95M, False: 0] ------------------ 154| 1.95M| this->swap(other); 155| | 156| 1.95M| return (*this); 157| 1.95M| } _ZN5Botan6BigInt4swapERS0_: 168| 3.88M| void swap(BigInt& other) { 169| 3.88M| m_data.swap(other.m_data); 170| 3.88M| std::swap(m_signedness, other.m_signedness); 171| 3.88M| } _ZN5Botan6BigInt8swap_regERNSt3__16vectorImNS_16secure_allocatorImEEEE: 173| 4.67M| void swap_reg(secure_vector& reg) { 174| 4.67M| m_data.swap(reg); 175| | // sign left unchanged 176| 4.67M| } _ZN5Botan6BigIntpLERKS0_: 182| 92.5k| BigInt& operator+=(const BigInt& y) { return add(y.data(), y.sig_words(), y.sign()); } _ZN5Botan6BigIntpLEm: 188| 2.72k| BigInt& operator+=(word y) { return add(&y, 1, Positive); } _ZN5Botan6BigIntmIERKS0_: 194| 89.8k| BigInt& operator-=(const BigInt& y) { return sub(y.data(), y.sig_words(), y.sign()); } _ZN5Botan6BigIntmIEm: 200| 1.76k| BigInt& operator-=(word y) { return sub(&y, 1, Positive); } _ZN5Botan6BigInt3subEPKmmNS0_4SignE: 288| 91.6k| BigInt& sub(const word y[], size_t y_words, Sign sign) { 289| 91.6k| return add(y, y_words, sign == Positive ? Negative : Positive); ------------------ | Branch (289:33): [True: 91.6k, False: 0] ------------------ 290| 91.6k| } _ZN5Botan6BigInt5clearEv: 366| 261k| void clear() { 367| 261k| m_data.set_to_zero(); 368| 261k| m_signedness = Positive; 369| 261k| } _ZNK5Botan6BigInt7is_evenEv: 406| 15.7k| bool is_even() const { return (get_bit(0) == 0); } _ZNK5Botan6BigInt6is_oddEv: 412| 275k| bool is_odd() const { return (get_bit(0) == 1); } _ZNK5Botan6BigInt10is_nonzeroEv: 418| 1.20M| bool is_nonzero() const { return (!is_zero()); } _ZNK5Botan6BigInt7is_zeroEv: 424| 2.79M| bool is_zero() const { return (sig_words() == 0); } _ZN5Botan6BigInt7set_bitEm: 430| 15.7k| void set_bit(size_t n) { conditionally_set_bit(n, true); } _ZN5Botan6BigInt21conditionally_set_bitEmb: 440| 24.3M| void conditionally_set_bit(size_t n, bool set_it) { 441| 24.3M| const size_t which = n / BOTAN_MP_WORD_BITS; ------------------ | | 50| 24.3M|#define BOTAN_MP_WORD_BITS 64 ------------------ 442| 24.3M| const word mask = static_cast(set_it) << (n % BOTAN_MP_WORD_BITS); ------------------ | | 50| 24.3M|#define BOTAN_MP_WORD_BITS 64 ------------------ 443| 24.3M| m_data.set_word_at(which, word_at(which) | mask); 444| 24.3M| } _ZN5Botan6BigInt9mask_bitsEm: 456| 2.39M| void mask_bits(size_t n) { m_data.mask_bits(n); } _ZNK5Botan6BigInt7get_bitEm: 463| 21.3M| bool get_bit(size_t n) const { return ((word_at(n / BOTAN_MP_WORD_BITS) >> (n % BOTAN_MP_WORD_BITS)) & 1); } ------------------ | | 50| 21.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| 21.3M|#define BOTAN_MP_WORD_BITS 64 ------------------ _ZNK5Botan6BigInt7word_atEm: 514| 58.1M| word word_at(size_t n) const { return m_data.get_word_at(n); } _ZN5Botan6BigInt11set_word_atEmm: 516| 5.74M| void set_word_at(size_t i, word w) { m_data.set_word_at(i, w); } _ZN5Botan6BigInt9set_wordsEPKmm: 518| 151k| void set_words(const word w[], size_t len) { m_data.set_words(w, len); } _ZNK5Botan6BigInt11is_positiveEv: 530| 520k| bool is_positive() const { return (sign() == Positive); } _ZNK5Botan6BigInt12reverse_signEv: 541| 56.5k| Sign reverse_sign() const { 542| 56.5k| if(sign() == Positive) ------------------ | Branch (542:13): [True: 55.3k, False: 1.18k] ------------------ 543| 55.3k| return Negative; 544| 1.18k| return Positive; 545| 56.5k| } _ZN5Botan6BigInt9flip_signEv: 550| 4.71k| void flip_sign() { set_sign(reverse_sign()); } _ZN5Botan6BigInt8set_signENS0_4SignE: 556| 8.10M| void set_sign(Sign sign) { 557| 8.10M| if(sign == Negative && is_zero()) ------------------ | Branch (557:13): [True: 109k, False: 7.99M] | Branch (557:33): [True: 1.35k, False: 108k] ------------------ 558| 1.35k| sign = Positive; 559| | 560| 8.10M| m_signedness = sign; 561| 8.10M| } _ZNK5Botan6BigInt4sizeEv: 572| 65.6M| size_t size() const { return m_data.size(); } _ZNK5Botan6BigInt9sig_wordsEv: 578| 23.2M| size_t sig_words() const { return m_data.sig_words(); } _ZN5Botan6BigInt12mutable_dataEv: 603| 39.6M| word* mutable_data() { return m_data.mutable_data(); } _ZNK5Botan6BigInt4dataEv: 609| 56.6M| const word* data() const { return m_data.const_data(); } _ZN5Botan6BigInt15get_word_vectorEv: 614| 836k| secure_vector& get_word_vector() { return m_data.mutable_vector(); } _ZNK5Botan6BigInt15get_word_vectorEv: 619| 425k| const secure_vector& get_word_vector() const { return m_data.const_vector(); } _ZNK5Botan6BigInt7grow_toEm: 625| 20.4M| void grow_to(size_t n) const { m_data.grow_to(n); } _ZNK5Botan6BigInt17const_time_poisonEv: 708| 10.0k| void const_time_poison() const {} _ZN5Botan6BigInt10power_of_2Em: 726| 12.4k| static BigInt power_of_2(size_t n) { 727| 12.4k| BigInt b; 728| 12.4k| b.set_bit(n); 729| 12.4k| return b; 730| 12.4k| } _ZN5Botan6BigInt6decodeEPKhm: 760| 2.85k| static BigInt decode(const uint8_t buf[], size_t length) { return BigInt(buf, length); } _ZN5Botan6BigInt4Data12mutable_dataEv: 816| 42.7M| word* mutable_data() { 817| 42.7M| invalidate_sig_words(); 818| 42.7M| return m_reg.data(); 819| 42.7M| } _ZNK5Botan6BigInt4Data10const_dataEv: 821| 56.6M| const word* const_data() const { return m_reg.data(); } _ZN5Botan6BigInt4Data14mutable_vectorEv: 823| 836k| secure_vector& mutable_vector() { 824| 836k| invalidate_sig_words(); 825| 836k| return m_reg; 826| 836k| } _ZNK5Botan6BigInt4Data12const_vectorEv: 828| 425k| const secure_vector& const_vector() const { return m_reg; } _ZNK5Botan6BigInt4Data11get_word_atEm: 830| 58.1M| word get_word_at(size_t n) const { 831| 58.1M| if(n < m_reg.size()) ------------------ | Branch (831:19): [True: 58.0M, False: 59.5k] ------------------ 832| 58.0M| return m_reg[n]; 833| 59.5k| return 0; 834| 58.1M| } _ZN5Botan6BigInt4Data11set_word_atEmm: 836| 30.0M| void set_word_at(size_t i, word w) { 837| 30.0M| invalidate_sig_words(); 838| 30.0M| if(i >= m_reg.size()) { ------------------ | Branch (838:19): [True: 4.26M, False: 25.8M] ------------------ 839| 4.26M| if(w == 0) ------------------ | Branch (839:22): [True: 4.20M, False: 57.1k] ------------------ 840| 4.20M| return; 841| 57.1k| grow_to(i + 1); 842| 57.1k| } 843| 25.8M| m_reg[i] = w; 844| 25.8M| } _ZN5Botan6BigInt4Data9set_wordsEPKmm: 846| 151k| void set_words(const word w[], size_t len) { 847| 151k| invalidate_sig_words(); 848| 151k| m_reg.assign(w, w + len); 849| 151k| } _ZN5Botan6BigInt4Data11set_to_zeroEv: 851| 261k| void set_to_zero() { 852| 261k| m_reg.resize(m_reg.capacity()); 853| 261k| clear_mem(m_reg.data(), m_reg.size()); 854| 261k| m_sig_words = 0; 855| 261k| } _ZN5Botan6BigInt4Data9mask_bitsEm: 863| 2.39M| void mask_bits(size_t n) { 864| 2.39M| if(n == 0) { ------------------ | Branch (864:19): [True: 0, False: 2.39M] ------------------ 865| 0| return set_to_zero(); 866| 0| } 867| | 868| 2.39M| const size_t top_word = n / BOTAN_MP_WORD_BITS; ------------------ | | 50| 2.39M|#define BOTAN_MP_WORD_BITS 64 ------------------ 869| | 870| | // if(top_word < sig_words()) ? 871| 2.39M| if(top_word < size()) { ------------------ | Branch (871:19): [True: 2.38M, False: 6.22k] ------------------ 872| 2.38M| const word mask = (static_cast(1) << (n % BOTAN_MP_WORD_BITS)) - 1; ------------------ | | 50| 2.38M|#define BOTAN_MP_WORD_BITS 64 ------------------ 873| 2.38M| const size_t len = size() - (top_word + 1); 874| 2.38M| if(len > 0) { ------------------ | Branch (874:22): [True: 2.38M, False: 40] ------------------ 875| 2.38M| clear_mem(&m_reg[top_word + 1], len); 876| 2.38M| } 877| 2.38M| m_reg[top_word] &= mask; 878| 2.38M| invalidate_sig_words(); 879| 2.38M| } 880| 2.39M| } _ZNK5Botan6BigInt4Data7grow_toEm: 882| 20.6M| void grow_to(size_t n) const { 883| 20.6M| if(n > size()) { ------------------ | Branch (883:19): [True: 4.53M, False: 16.1M] ------------------ 884| 4.53M| if(n <= m_reg.capacity()) ------------------ | Branch (884:22): [True: 1.59M, False: 2.93M] ------------------ 885| 1.59M| m_reg.resize(n); 886| 2.93M| else 887| 2.93M| m_reg.resize(n + (8 - (n % 8))); 888| 4.53M| } 889| 20.6M| } _ZNK5Botan6BigInt4Data4sizeEv: 891| 94.0M| size_t size() const { return m_reg.size(); } _ZN5Botan6BigInt4Data4swapERS1_: 900| 3.88M| void swap(Data& other) { 901| 3.88M| m_reg.swap(other.m_reg); 902| 3.88M| std::swap(m_sig_words, other.m_sig_words); 903| 3.88M| } _ZN5Botan6BigInt4Data4swapERNSt3__16vectorImNS_16secure_allocatorImEEEE: 905| 4.68M| void swap(secure_vector& reg) { 906| 4.68M| m_reg.swap(reg); 907| 4.68M| invalidate_sig_words(); 908| 4.68M| } _ZNK5Botan6BigInt4Data20invalidate_sig_wordsEv: 910| 80.8M| void invalidate_sig_words() const { m_sig_words = sig_words_npos; } _ZNK5Botan6BigInt4Data9sig_wordsEv: 912| 23.2M| size_t sig_words() const { 913| 23.2M| if(m_sig_words == sig_words_npos) { ------------------ | Branch (913:19): [True: 11.3M, False: 11.9M] ------------------ 914| 11.3M| m_sig_words = calc_sig_words(); 915| 11.9M| } else { 916| 11.9M| BOTAN_DEBUG_ASSERT(m_sig_words == calc_sig_words()); ------------------ | | 99| 11.9M| do { \ | | 100| 11.9M| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 917| 11.9M| } 918| 23.2M| return m_sig_words; 919| 23.2M| } _ZN5BotanplERKNS_6BigIntES2_: 937| 281k|inline BigInt operator+(const BigInt& x, const BigInt& y) { return BigInt::add2(x, y.data(), y.sig_words(), y.sign()); } _ZN5BotanplERKNS_6BigIntEm: 939| 1.89k|inline BigInt operator+(const BigInt& x, word y) { return BigInt::add2(x, &y, 1, BigInt::Positive); } _ZN5BotanmiERKNS_6BigIntES2_: 943| 51.8k|inline BigInt operator-(const BigInt& x, const BigInt& y) { 944| 51.8k| return BigInt::add2(x, y.data(), y.sig_words(), y.reverse_sign()); 945| 51.8k|} _ZN5BotanmiERKNS_6BigIntEm: 947| 1.51k|inline BigInt operator-(const BigInt& x, word y) { return BigInt::add2(x, &y, 1, BigInt::Negative); } _ZN5BotanmlEmRKNS_6BigIntE: 952| 180k|inline BigInt operator*(word x, const BigInt& y) { return y * x; } _ZN5BotaneqERKNS_6BigIntES2_: 964| 86.6k|inline bool operator==(const BigInt& a, const BigInt& b) { return a.is_equal(b); } _ZN5BotanneERKNS_6BigIntES2_: 966| 3.55k|inline bool operator!=(const BigInt& a, const BigInt& b) { return !a.is_equal(b); } _ZN5BotangeERKNS_6BigIntES2_: 970| 4.29k|inline bool operator>=(const BigInt& a, const BigInt& b) { return (a.cmp(b) >= 0); } _ZN5BotanltERKNS_6BigIntES2_: 972| 152k|inline bool operator<(const BigInt& a, const BigInt& b) { return a.is_less_than(b); } _ZN5BotangtERKNS_6BigIntES2_: 974| 114k|inline bool operator>(const BigInt& a, const BigInt& b) { return b.is_less_than(a); } _ZN5BotaneqERKNS_6BigIntEm: 976| 15.0k|inline bool operator==(const BigInt& a, word b) { return (a.cmp_word(b) == 0); } _ZN5BotanneERKNS_6BigIntEm: 978| 435k|inline bool operator!=(const BigInt& a, word b) { return (a.cmp_word(b) != 0); } _ZN5BotanleERKNS_6BigIntEm: 980| 3.37k|inline bool operator<=(const BigInt& a, word b) { return (a.cmp_word(b) <= 0); } _ZN5BotangeERKNS_6BigIntEm: 982| 1.59k|inline bool operator>=(const BigInt& a, word b) { return (a.cmp_word(b) >= 0); } _ZN5BotanltERKNS_6BigIntEm: 984| 20.0k|inline bool operator<(const BigInt& a, word b) { return (a.cmp_word(b) < 0); } _ZN5BotangtERKNS_6BigIntEm: 986| 139k|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| 114k|inline void swap(Botan::BigInt& x, Botan::BigInt& y) { 1000| 114k| x.swap(y); 1001| 114k|} _ZN5Botan6BigIntC2ERKS0_: 79| 1.34M| BigInt(const BigInt& other) = default; _ZN5Botan6BigIntaSERKS0_: 162| 2.74M| BigInt& operator=(const BigInt&) = default; _ZN5Botan20Buffered_Computation6updateEPKhm: 34| 6.97k| void update(const uint8_t in[], size_t length) { add_data(in, length); } _ZN5Botan20Buffered_Computation6updateENSt3__14spanIKhLm18446744073709551615EEE: 40| 8.69k| void update(std::span in) { add_data(in.data(), in.size()); } _ZN5Botan20Buffered_Computation6updateEh: 61| 80| void update(uint8_t in) { add_data(&in, 1); } _ZN5Botan20Buffered_Computation5finalEPh: 69| 228| void final(uint8_t out[]) { final_result(out); } _ZN5Botan20Buffered_Computation12final_stdvecEv: 83| 9.10k| std::vector final_stdvec() { return final>(); } _ZN5Botan20Buffered_Computation5finalINSt3__16vectorIhNS2_9allocatorIhEEEEEET_v: 77| 9.10k| T final() { 78| 9.10k| T output(output_length()); 79| 9.10k| final_result(output.data()); 80| 9.10k| return output; 81| 9.10k| } _ZN5Botan20Buffered_ComputationD2Ev: 133| 12.5k| virtual ~Buffered_Computation() = default; _ZN5Botan20Buffered_Computation5finalINSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_v: 77| 6.32k| T final() { 78| 6.32k| T output(output_length()); 79| 6.32k| final_result(output.data()); 80| 6.32k| return output; 81| 6.32k| } _ZN5Botan20Buffered_Computation7processINSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_PKhm: 104| 5.79k| T process(const uint8_t in[], size_t length) { 105| 5.79k| update(in, length); 106| 5.79k| return final(); 107| 5.79k| } _ZN5Botan8CurveGFpC2Ev: 90| 280k| CurveGFp() = default; _ZNK5Botan13CurveGFp_Repr9curve_mulERNS_6BigIntERKS1_S4_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 60| 3.97M| void curve_mul(BigInt& z, const BigInt& x, const BigInt& y, secure_vector& ws) const { 61| 3.97M| BOTAN_DEBUG_ASSERT(x.sig_words() <= get_p_words()); ------------------ | | 99| 3.97M| do { \ | | 100| 3.97M| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 62| 3.97M| curve_mul_words(z, x.data(), x.size(), y, ws); 63| 3.97M| } _ZNK5Botan13CurveGFp_Repr9curve_sqrERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 68| 1.85M| void curve_sqr(BigInt& z, const BigInt& x, secure_vector& ws) const { 69| 1.85M| BOTAN_DEBUG_ASSERT(x.sig_words() <= get_p_words()); ------------------ | | 99| 1.85M| do { \ | | 100| 1.85M| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 70| 1.85M| curve_sqr_words(z, x.data(), x.size(), ws); 71| 1.85M| } _ZN5Botan8CurveGFpC2ERKNS_6BigIntES3_S3_: 98| 361| CurveGFp(const BigInt& p, const BigInt& a, const BigInt& b) : m_repr(choose_repr(p, a, b)) {} _ZNK5Botan8CurveGFp5get_aEv: 107| 25.6k| const BigInt& get_a() const { return m_repr->get_a(); } _ZNK5Botan8CurveGFp5get_bEv: 112| 25.6k| const BigInt& get_b() const { return m_repr->get_b(); } _ZNK5Botan8CurveGFp5get_pEv: 118| 483k| const BigInt& get_p() const { return m_repr->get_p(); } _ZNK5Botan8CurveGFp11get_p_wordsEv: 120| 204k| size_t get_p_words() const { return m_repr->get_p_words(); } _ZNK5Botan8CurveGFp11get_ws_sizeEv: 122| 414k| size_t get_ws_size() const { return m_repr->get_ws_size(); } _ZNK5Botan8CurveGFp9get_a_repEv: 124| 1.79k| const BigInt& get_a_rep() const { return m_repr->get_a_rep(); } _ZNK5Botan8CurveGFp9get_b_repEv: 126| 3.43k| const BigInt& get_b_rep() const { return m_repr->get_b_rep(); } _ZNK5Botan8CurveGFp9get_1_repEv: 128| 3.85k| const BigInt& get_1_rep() const { return m_repr->get_1_rep(); } _ZNK5Botan8CurveGFp12a_is_minus_3Ev: 130| 146k| bool a_is_minus_3() const { return m_repr->a_is_minus_3(); } _ZNK5Botan8CurveGFp9a_is_zeroEv: 132| 214k| bool a_is_zero() const { return m_repr->a_is_zero(); } _ZNK5Botan8CurveGFp6is_oneERKNS_6BigIntE: 134| 307| bool is_one(const BigInt& x) const { return m_repr->is_one(x); } _ZNK5Botan8CurveGFp14invert_elementERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 136| 1.04k| BigInt invert_element(const BigInt& x, secure_vector& ws) const { return m_repr->invert_element(x, ws); } _ZNK5Botan8CurveGFp6to_repERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 138| 2.40k| void to_rep(BigInt& x, secure_vector& ws) const { m_repr->to_curve_rep(x, ws); } _ZNK5Botan8CurveGFp8from_repERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 140| 307| void from_rep(BigInt& x, secure_vector& ws) const { m_repr->from_curve_rep(x, ws); } _ZNK5Botan8CurveGFp15from_rep_to_tmpERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 142| 5.22k| BigInt from_rep_to_tmp(const BigInt& x, secure_vector& ws) const { 143| 5.22k| BigInt xt(x); 144| 5.22k| m_repr->from_curve_rep(xt, ws); 145| 5.22k| return xt; 146| 5.22k| } _ZNK5Botan8CurveGFp3mulERNS_6BigIntERKS1_S4_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 150| 3.13M| void mul(BigInt& z, const BigInt& x, const BigInt& y, secure_vector& ws) const { 151| 3.13M| m_repr->curve_mul(z, x, y, ws); 152| 3.13M| } _ZNK5Botan8CurveGFp3mulERNS_6BigIntEPKmmRKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 154| 741k| void mul(BigInt& z, const word x_w[], size_t x_size, const BigInt& y, secure_vector& ws) const { 155| 741k| m_repr->curve_mul_words(z, x_w, x_size, y, ws); 156| 741k| } _ZNK5Botan8CurveGFp3sqrERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 158| 1.72M| void sqr(BigInt& z, const BigInt& x, secure_vector& ws) const { m_repr->curve_sqr(z, x, ws); } _ZNK5Botan8CurveGFp3sqrERNS_6BigIntEPKmmRNSt3__16vectorImNS_16secure_allocatorImEEEE: 160| 173k| void sqr(BigInt& z, const word x_w[], size_t x_size, secure_vector& ws) const { 161| 173k| m_repr->curve_sqr_words(z, x_w, x_size, ws); 162| 173k| } _ZNK5Botan8CurveGFp10mul_to_tmpERKNS_6BigIntES3_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 168| 830k| BigInt mul_to_tmp(const BigInt& x, const BigInt& y, secure_vector& ws) const { 169| 830k| BigInt z; 170| 830k| m_repr->curve_mul(z, x, y, ws); 171| 830k| return z; 172| 830k| } _ZNK5Botan8CurveGFp10sqr_to_tmpERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 174| 8.97k| BigInt sqr_to_tmp(const BigInt& x, secure_vector& ws) const { 175| 8.97k| BigInt z; 176| 8.97k| m_repr->curve_sqr(z, x, ws); 177| 8.97k| return z; 178| 8.97k| } _ZN5Botan8CurveGFp4swapERS0_: 180| 240k| void swap(CurveGFp& other) { std::swap(m_repr, other.m_repr); } _ZNK5Botan8CurveGFpeqERKS0_: 187| 204k| inline bool operator==(const CurveGFp& other) const { 188| 204k| if(m_repr.get() == other.m_repr.get()) ------------------ | Branch (188:13): [True: 204k, False: 0] ------------------ 189| 204k| 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| 204k| } _ZN5Botan8CurveGFpC2ERKS0_: 100| 168k| CurveGFp(const CurveGFp&) = default; _ZN5Botan8CurveGFpaSERKS0_: 102| 156k| CurveGFp& operator=(const CurveGFp&) = default; _ZN5Botan13CurveGFp_ReprD2Ev: 23| 361| virtual ~CurveGFp_Repr() = default; _ZN5Botan17DataSource_MemoryC2EPKhm: 118| 50.3k| DataSource_Memory(const uint8_t in[], size_t length) : m_source(in, in + length), m_offset(0) {} _ZN5Botan10DataSourceC2Ev: 91| 171k| DataSource() = default; _ZN5Botan10DataSourceD2Ev: 92| 171k| virtual ~DataSource() = default; _ZN5Botan17DataSource_MemoryC2ENSt3__16vectorIhNS_16secure_allocatorIhEEEE: 124| 11.0k| explicit DataSource_Memory(secure_vector in) : m_source(std::move(in)), m_offset(0) {} _ZN5Botan17DataSource_MemoryC2ERKNSt3__16vectorIhNS1_9allocatorIhEEEE: 136| 2.83k| explicit DataSource_Memory(const std::vector& in) : m_source(in.begin(), in.end()), m_offset(0) {} _ZN5Botan11DER_Encoder14start_sequenceEv: 65| 24.5k| DER_Encoder& start_sequence() { return start_cons(ASN1_Type::Sequence, ASN1_Class::Universal); } _ZN5Botan11DER_Encoder9raw_bytesINSt3__19allocatorIhEEEERS0_RKNS2_6vectorIhT_EE: 88| 6.29k| DER_Encoder& raw_bytes(const std::vector& val) { 89| 6.29k| return raw_bytes(val.data(), val.size()); 90| 6.29k| } _ZN5Botan11DER_Encoder6encodeINSt3__19allocatorIhEEEERS0_RKNS2_6vectorIhT_EENS_9ASN1_TypeE: 99| 2.89k| DER_Encoder& encode(const std::vector& vec, ASN1_Type real_type) { 100| 2.89k| return encode(vec.data(), vec.size(), real_type); 101| 2.89k| } _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassERKNSt3__16vectorIhNS3_9allocatorIhEEEE: 159| 2.95k| DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, const std::vector& rep) { 160| 2.95k| return add_object(type_tag, class_tag, rep.data(), rep.size()); 161| 2.95k| } _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassERKNSt3__16vectorIhNS_16secure_allocatorIhEEEE: 163| 3.39k| DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, const secure_vector& rep) { 164| 3.39k| return add_object(type_tag, class_tag, rep.data(), rep.size()); 165| 3.39k| } _ZN5Botan11DER_Encoder12DER_SequenceC2EOS1_: 188| 48.1k| m_set_contents(std::move(seq.m_set_contents)) {} _ZN5Botan11DER_Encoder12DER_SequenceC2ERKS1_: 198| 3.34k| DER_Sequence(const DER_Sequence& seq) = default; _ZN5Botan11DER_Encoder11encode_listINS_6BigIntEEERS0_RKNSt3__16vectorIT_NS4_9allocatorIS6_EEEE: 131| 258| DER_Encoder& encode_list(const std::vector& values) { 132| 774| for(size_t i = 0; i != values.size(); ++i) ------------------ | Branch (132:28): [True: 516, False: 258] ------------------ 133| 516| encode(values[i]); 134| 258| return (*this); 135| 258| } _ZNK5Botan12DH_PublicKey9algo_nameEv: 50| 1| std::string algo_name() const override { return "DH"; } _ZN5Botan8DL_GroupC2INSt3__19allocatorIhEEEERKNS2_6vectorIhT_EENS_15DL_Group_FormatE: 124| 70| DL_Group(ber.data(), ber.size(), format) {} _ZNK5Botan8EC_Group6OS2ECPENSt3__14spanIKhLm18446744073709551615EEE: 337| 1.70k| EC_Point OS2ECP(std::span encoded_point) const { 338| 1.70k| return this->OS2ECP(encoded_point.data(), encoded_point.size()); 339| 1.70k| } _ZN5Botan8EC_GroupC2ERKS0_: 105| 536| EC_Group(const EC_Group&) = default; _ZN5Botan8EC_GroupaSEOS0_: 109| 89| EC_Group& operator=(EC_Group&&) = default; _ZN5Botan8EC_GroupC2INSt3__19allocatorIhEEEERKNS2_6vectorIhT_EE: 78| 1.92k| EC_Group(const std::vector& ber) : EC_Group(ber.data(), ber.size()) {} _ZN5Botan8EC_PointC2Ev: 42| 274k| EC_Point() = default; _ZN5Botan8EC_PointC2EOS0_: 58| 5.76k| EC_Point(EC_Point&& other) { this->swap(other); } _ZN5Botan8EC_PointaSEOS0_: 68| 195k| EC_Point& operator=(EC_Point&& other) { 69| 195k| if(this != &other) ------------------ | Branch (69:13): [True: 195k, False: 0] ------------------ 70| 195k| this->swap(other); 71| 195k| return (*this); 72| 195k| } _ZNK5Botan8EC_Point5get_xEv: 137| 268k| const BigInt& get_x() const { return m_coord_x; } _ZNK5Botan8EC_Point5get_yEv: 144| 268k| const BigInt& get_y() const { return m_coord_y; } _ZNK5Botan8EC_Point7is_zeroEv: 175| 700k| bool is_zero() const { return m_coord_z.is_zero(); } _ZN5Botan8EC_Point3addERKS0_RNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE: 212| 179k| void add(const EC_Point& other, std::vector& workspace) { 213| 179k| BOTAN_ARG_CHECK(m_curve == other.m_curve, "cannot add points on different curves"); ------------------ | | 30| 179k| do { \ | | 31| 179k| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 0, False: 179k] | | ------------------ | | 32| 179k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 179k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 214| | 215| 179k| const size_t p_words = m_curve.get_p_words(); 216| | 217| 179k| add(other.m_coord_x.data(), 218| 179k| std::min(p_words, other.m_coord_x.size()), 219| 179k| other.m_coord_y.data(), 220| 179k| std::min(p_words, other.m_coord_y.size()), 221| 179k| other.m_coord_z.data(), 222| 179k| std::min(p_words, other.m_coord_z.size()), 223| 179k| workspace); 224| 179k| } _ZN5Botan8EC_Point10add_affineERKS0_RNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE: 250| 25.5k| void add_affine(const EC_Point& other, std::vector& workspace) { 251| 25.5k| BOTAN_ASSERT_NOMSG(m_curve == other.m_curve); ------------------ | | 60| 25.5k| do { \ | | 61| 25.5k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 25.5k] | | ------------------ | | 62| 25.5k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 25.5k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 252| 25.5k| BOTAN_DEBUG_ASSERT(other.is_affine()); ------------------ | | 99| 25.5k| do { \ | | 100| 25.5k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 253| | 254| 25.5k| const size_t p_words = m_curve.get_p_words(); 255| 25.5k| add_affine(other.m_coord_x.data(), 256| 25.5k| std::min(p_words, other.m_coord_x.size()), 257| 25.5k| other.m_coord_y.data(), 258| 25.5k| std::min(p_words, other.m_coord_y.size()), 259| 25.5k| workspace); 260| 25.5k| } _ZNK5Botan8EC_Point4plusERKS0_RNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE: 293| 162k| EC_Point plus(const EC_Point& other, std::vector& workspace) const { 294| 162k| EC_Point x = (*this); 295| 162k| x.add(other, workspace); 296| 162k| return x; 297| 162k| } _ZNK5Botan8EC_Point4zeroEv: 313| 307| EC_Point zero() const { return EC_Point(m_curve); } _ZNK5Botan8EC_Point9get_curveEv: 321| 698| const CurveGFp& get_curve() const { return m_curve; } _ZN5Botan8EC_PointC2ERKS0_: 53| 166k| EC_Point(const EC_Point&) = default; _ZN5Botan8EC_PointaSERKS0_: 63| 156k| EC_Point& operator=(const EC_Point&) = default; _ZN5Botan12EC_PublicKeyD2Ev: 32| 872| virtual ~EC_PublicKey() = default; _ZN5Botan12EC_PublicKeyC2Ev: 106| 101| EC_PublicKey() : m_domain_params{}, m_public_key{}, m_domain_encoding(EC_Group_Encoding::Explicit) {} _ZNK5Botan12EC_PublicKey12public_pointEv: 40| 536| const EC_Point& public_point() const { return m_public_key; } _ZNK5Botan12EC_PublicKey6domainEv: 54| 2.86k| const EC_Group& domain() const { return m_domain_params; } _ZN5Botan14ECDH_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 28| 7| EC_PublicKey(alg_id, key_bits) {} _ZNK5Botan14ECDH_PublicKey9algo_nameEv: 41| 2| std::string algo_name() const override { return "ECDH"; } _ZN5Botan15ECDSA_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 35| 1.91k| EC_PublicKey(alg_id, key_bits) {} _ZNK5Botan15ECDSA_PublicKey13message_partsEv: 55| 924| size_t message_parts() const override { return 2; } _ZNK5Botan15ECDSA_PublicKey17message_part_sizeEv: 57| 462| size_t message_part_size() const override { return domain().get_order().bytes(); } _ZNK5Botan9Exception4whatEv: 93| 3.96k| const char* what() const noexcept override { return m_msg.c_str(); } _ZN5Botan13Invalid_StateC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 208| 61| explicit Invalid_State(std::string_view err) : Exception(err) {} _ZN5Botan12Lookup_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 237| 4| explicit Lookup_Error(std::string_view err) : Exception(err) {} _ZNK5Botan19GOST_3410_PublicKey13message_partsEv: 47| 74| size_t message_parts() const override { return 2; } _ZNK5Botan19GOST_3410_PublicKey17message_part_sizeEv: 49| 74| size_t message_part_size() const override { return domain().get_order().bytes(); } _ZNK5Botan19GOST_3410_PublicKey29default_x509_signature_formatEv: 51| 74| Signature_Format default_x509_signature_format() const override { return Signature_Format::Standard; } _ZN5Botan10hex_encodeENSt3__14spanIKhLm18446744073709551615EEEb: 43| 5.79k|inline std::string hex_encode(std::span input, bool uppercase = true) { 44| 5.79k| return hex_encode(input.data(), input.size(), uppercase); 45| 5.79k|} _ZN5Botan10ct_is_zeroIhEET_S1_: 35| 3.03M|{ 36| 3.03M| return expand_top_bit(~x & (x - 1)); 37| 3.03M|} _ZN5Botan14expand_top_bitIhEET_S1_: 25| 3.59M|{ 26| 3.59M| return static_cast(0) - (a >> (sizeof(T) * 8 - 1)); 27| 3.59M|} _ZN5Botan8high_bitIjEEmT_: 60| 12.9k|{ 61| 12.9k| size_t hb = 0; 62| | 63| 77.4k| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (63:38): [True: 64.5k, False: 12.9k] ------------------ 64| 64.5k| const size_t z = s * ((~ct_is_zero(n >> s)) & 1); 65| 64.5k| hb += z; 66| 64.5k| n >>= z; 67| 64.5k| } 68| | 69| 12.9k| hb += n; 70| | 71| 12.9k| return hb; 72| 12.9k|} _ZN5Botan10ct_is_zeroIjEET_S1_: 35| 64.5k|{ 36| 64.5k| return expand_top_bit(~x & (x - 1)); 37| 64.5k|} _ZN5Botan14expand_top_bitIjEET_S1_: 25| 64.5k|{ 26| 64.5k| return static_cast(0) - (a >> (sizeof(T) * 8 - 1)); 27| 64.5k|} _ZN5Botan17significant_bytesImEEmT_: 82| 8.66k|{ 83| 8.66k| size_t b = 0; 84| | 85| 34.6k| for(size_t s = 8 * sizeof(n) / 2; s >= 8; s /= 2) { ------------------ | Branch (85:38): [True: 25.9k, False: 8.66k] ------------------ 86| 25.9k| const size_t z = s * (~ct_is_zero(n >> s) & 1); 87| 25.9k| b += z / 8; 88| 25.9k| n >>= z; 89| 25.9k| } 90| | 91| 8.66k| b += (n != 0); 92| | 93| 8.66k| return b; 94| 8.66k|} _ZN5Botan10ct_is_zeroImEET_S1_: 35| 197M|{ 36| 197M| return expand_top_bit(~x & (x - 1)); 37| 197M|} _ZN5Botan14expand_top_bitImEET_S1_: 25| 238M|{ 26| 238M| return static_cast(0) - (a >> (sizeof(T) * 8 - 1)); 27| 238M|} _ZN5Botan6chooseIhEET_S1_S1_S1_: 168| 3.59M|inline constexpr T choose(T mask, T a, T b) { 169| | //return (mask & a) | (~mask & b); 170| 3.59M| return (b ^ (mask & (a ^ b))); 171| 3.59M|} _ZN5Botan6chooseIjEET_S1_S1_S1_: 168| 5.47M|inline constexpr T choose(T mask, T a, T b) { 169| | //return (mask & a) | (~mask & b); 170| 5.47M| return (b ^ (mask & (a ^ b))); 171| 5.47M|} _ZN5Botan9ceil_log2ImEEhT_: 124| 12.4k|{ 125| 12.4k| if(x >> (sizeof(T) * 8 - 1)) ------------------ | Branch (125:7): [True: 0, False: 12.4k] ------------------ 126| 0| return sizeof(T) * 8; 127| | 128| 12.4k| uint8_t result = 0; 129| 12.4k| T compare = 1; 130| | 131| 87.6k| while(compare < x) { ------------------ | Branch (131:10): [True: 75.1k, False: 12.4k] ------------------ 132| 75.1k| compare <<= 1; 133| 75.1k| result++; 134| 75.1k| } 135| | 136| 12.4k| return result; 137| 12.4k|} _ZN5Botan13is_power_of_2ImEEbT_: 47| 299k|{ 48| 299k| return (arg != 0) && (arg != 1) && ((arg & static_cast(arg - 1)) == 0); ------------------ | Branch (48:11): [True: 299k, False: 0] | Branch (48:25): [True: 299k, False: 0] | Branch (48:39): [True: 266k, False: 33.4k] ------------------ 49| 299k|} _ZN5Botan8majorityIjEET_S1_S1_S1_: 174| 2.72M|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| 2.72M| return choose(a ^ b, c, b); 185| 2.72M|} _ZN5Botan6chooseImEET_S1_S1_S1_: 168| 513M|inline constexpr T choose(T mask, T a, T b) { 169| | //return (mask & a) | (~mask & b); 170| 513M| return (b ^ (mask & (a ^ b))); 171| 513M|} _ZN5Botan8majorityImEET_S1_S1_S1_: 174| 93.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| 93.6k| return choose(a ^ b, c, b); 185| 93.6k|} _ZN5Botan8high_bitImEEmT_: 60| 373k|{ 61| 373k| size_t hb = 0; 62| | 63| 2.61M| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (63:38): [True: 2.24M, False: 373k] ------------------ 64| 2.24M| const size_t z = s * ((~ct_is_zero(n >> s)) & 1); 65| 2.24M| hb += z; 66| 2.24M| n >>= z; 67| 2.24M| } 68| | 69| 373k| hb += n; 70| | 71| 373k| return hb; 72| 373k|} _ZN5Botan10ct_is_zeroIiEET_S1_: 35| 78|{ 36| 78| return expand_top_bit(~x & (x - 1)); 37| 78|} _ZN5Botan14expand_top_bitIiEET_S1_: 25| 78|{ 26| 78| return static_cast(0) - (a >> (sizeof(T) * 8 - 1)); 27| 78|} _ZN5Botan3ctzImEEmT_: 104| 1.00M|{ 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| 1.00M| size_t lb = ct_is_zero(n) & 1; 110| | 111| 7.06M| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (111:38): [True: 6.05M, False: 1.00M] ------------------ 112| 6.05M| const T mask = (static_cast(1) << s) - 1; 113| 6.05M| const size_t z = s * (ct_is_zero(n & mask) & 1); 114| 6.05M| lb += z; 115| 6.05M| n >>= z; 116| 6.05M| } 117| | 118| 1.00M| return lb; 119| 1.00M|} _ZN5Botan8high_bitIhEEmT_: 60| 26|{ 61| 26| size_t hb = 0; 62| | 63| 104| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (63:38): [True: 78, False: 26] ------------------ 64| 78| const size_t z = s * ((~ct_is_zero(n >> s)) & 1); 65| 78| hb += z; 66| 78| n >>= z; 67| 78| } 68| | 69| 26| hb += n; 70| | 71| 26| return hb; 72| 26|} _ZN5Botan13reverse_bytesEt: 19| 4.81k|inline constexpr uint16_t reverse_bytes(uint16_t x) { 20| 4.81k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap16) 21| 4.81k| return __builtin_bswap16(x); 22| |#else 23| | return static_cast((x << 8) | (x >> 8)); 24| |#endif 25| 4.81k|} _ZN5Botan13reverse_bytesEj: 33| 622k|inline constexpr uint32_t reverse_bytes(uint32_t x) { 34| 622k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap32) 35| 622k| 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| 622k|} _ZN5Botan13reverse_bytesEm: 48| 110k|inline constexpr uint64_t reverse_bytes(uint64_t x) { 49| 110k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap64) 50| 110k| return __builtin_bswap64(x); 51| |#else 52| | uint32_t hi = static_cast(x >> 32); 53| | uint32_t lo = static_cast(x); 54| | 55| | hi = reverse_bytes(hi); 56| | lo = reverse_bytes(lo); 57| | 58| | return (static_cast(lo) << 32) | hi; 59| |#endif 60| 110k|} base64.cpp:_ZN5Botan11base_decodeIRNS_12_GLOBAL__N_16Base64EEEmOT_PhPKcmRmbb: 118| 134| bool ignore_ws = true) { 119| 134| const size_t decoding_bytes_in = base.decoding_bytes_in(); 120| 134| const size_t decoding_bytes_out = base.decoding_bytes_out(); 121| | 122| 134| uint8_t* out_ptr = output; 123| 134| std::vector decode_buf(decoding_bytes_in, 0); 124| 134| size_t decode_buf_pos = 0; 125| 134| size_t final_truncate = 0; 126| | 127| 134| clear_mem(output, base.decode_max_output(input_length)); 128| | 129| 24.1k| for(size_t i = 0; i != input_length; ++i) { ------------------ | Branch (129:22): [True: 24.0k, False: 134] ------------------ 130| 24.0k| const uint8_t bin = base.lookup_binary_value(input[i]); 131| | 132| 24.0k| if(base.check_bad_char(bin, input[i], ignore_ws)) // May throw Invalid_Argument ------------------ | Branch (132:10): [True: 20.7k, False: 3.32k] ------------------ 133| 20.7k| { 134| 20.7k| decode_buf[decode_buf_pos] = bin; 135| 20.7k| ++decode_buf_pos; 136| 20.7k| } 137| | 138| | /* 139| | * If we're at the end of the input, pad with 0s and truncate 140| | */ 141| 24.0k| if(final_inputs && (i == input_length - 1)) { ------------------ | Branch (141:10): [True: 24.0k, False: 29] | Branch (141:26): [True: 74, False: 23.9k] ------------------ 142| 74| if(decode_buf_pos) { ------------------ | Branch (142:13): [True: 37, False: 37] ------------------ 143| 120| for(size_t j = decode_buf_pos; j < decoding_bytes_in; ++j) { ------------------ | Branch (143:44): [True: 83, False: 37] ------------------ 144| 83| decode_buf[j] = 0; 145| 83| } 146| | 147| 37| final_truncate = decoding_bytes_in - decode_buf_pos; 148| 37| decode_buf_pos = decoding_bytes_in; 149| 37| } 150| 74| } 151| | 152| 24.0k| if(decode_buf_pos == decoding_bytes_in) { ------------------ | Branch (152:10): [True: 5.19k, False: 18.8k] ------------------ 153| 5.19k| base.decode(out_ptr, decode_buf.data()); 154| | 155| 5.19k| out_ptr += decoding_bytes_out; 156| 5.19k| decode_buf_pos = 0; 157| 5.19k| input_consumed = i + 1; 158| 5.19k| } 159| 24.0k| } 160| | 161| 629| while(input_consumed < input_length && base.lookup_binary_value(input[input_consumed]) == 0x80) { ------------------ | Branch (161:10): [True: 519, False: 110] | Branch (161:43): [True: 495, False: 24] ------------------ 162| 495| ++input_consumed; 163| 495| } 164| | 165| 134| size_t written = (out_ptr - output) - base.bytes_to_remove(final_truncate); 166| | 167| 134| return written; 168| 134|} base64.cpp:_ZN5Botan18base_decode_to_vecINSt3__16vectorIhNS_16secure_allocatorIhEEEENS_12_GLOBAL__N_16Base64EEET_OT0_PKcmb: 183| 134|Vector base_decode_to_vec(Base&& base, const char input[], size_t input_length, bool ignore_ws) { 184| 134| const size_t output_length = base.decode_max_output(input_length); 185| 134| Vector bin(output_length); 186| | 187| 134| const size_t written = base_decode_full(base, bin.data(), input, input_length, ignore_ws); 188| | 189| 134| bin.resize(written); 190| 134| return bin; 191| 134|} base64.cpp:_ZN5Botan16base_decode_fullIRNS_12_GLOBAL__N_16Base64EEEmOT_PhPKcmb: 171| 134|size_t base_decode_full(Base&& base, uint8_t output[], const char input[], size_t input_length, bool ignore_ws) { 172| 134| size_t consumed = 0; 173| 134| const size_t written = base_decode(base, output, input, input_length, consumed, true, ignore_ws); 174| | 175| 134| if(consumed != input_length) { ------------------ | Branch (175:7): [True: 24, False: 110] ------------------ 176| 24| throw Invalid_Argument(base.name() + " decoding failed, input did not have full bytes"); 177| 24| } 178| | 179| 110| return written; 180| 134|} _ZN5Botan5CPUID13has_cpuid_bitENS0_10CPUID_bitsE: 333| 75.8k| static bool has_cpuid_bit(CPUID_bits elem) { 334| 75.8k| const uint32_t elem32 = static_cast(elem); 335| 75.8k| return state().has_bit(elem32); 336| 75.8k| } _ZN5Botan5CPUID5stateEv: 362| 75.8k| static CPUID_Data& state() { 363| 75.8k| static CPUID::CPUID_Data g_cpuid; 364| 75.8k| return g_cpuid; 365| 75.8k| } _ZNK5Botan5CPUID10CPUID_Data7has_bitEj: 350| 75.8k| bool has_bit(uint32_t bit) const { return (m_processor_features & bit) == bit; } _ZN5Botan5CPUID8has_sse2Ev: 208| 36.2k| static bool has_sse2() { return has_cpuid_bit(CPUID_SSE2_BIT); } _ZN5Botan5CPUID8has_bmi2Ev: 240| 14.6k| static bool has_bmi2() { return has_cpuid_bit(CPUID_BMI_BIT); } _ZN5Botan5CPUID13has_intel_shaEv: 255| 24.9k| static bool has_intel_sha() { return has_sse2() && has_cpuid_bit(CPUID_SHA_BIT); } ------------------ | Branch (255:44): [True: 24.9k, False: 0] | Branch (255:58): [True: 0, False: 24.9k] ------------------ _ZN5Botan2CT4MaskIhE7is_zeroEh: 123| 3.03M| static Mask is_zero(T x) { return Mask(ct_is_zero(x)); } _ZN5Botan2CT4MaskIhEC2Eh: 279| 6.76M| Mask(T m) : m_mask(m) {} _ZNK5Botan2CT4MaskIhE5valueEv: 276| 6.76M| T value() const { return m_mask; } _ZN5Botan2CT4MaskIhE3setEv: 99| 15.2k| static Mask set() { return Mask(static_cast(~0)); } _ZN5Botan2CT4MaskIhE15is_within_rangeEhhh: 150| 193k| static Mask is_within_range(T v, T l, T u) { 151| | //return Mask::is_gte(v, l) & Mask::is_lte(v, u); 152| | 153| 193k| const T v_lt_l = v ^ ((v ^ l) | ((v - l) ^ v)); 154| 193k| const T v_gt_u = u ^ ((u ^ v) | ((u - v) ^ u)); 155| 193k| const T either = v_lt_l | v_gt_u; 156| 193k| return ~Mask(expand_top_bit(either)); 157| 193k| } _ZNK5Botan2CT4MaskIhEcoEv: 213| 3.15M| Mask operator~() const { return Mask(~value()); } _ZN5Botan2CT4MaskIhE9is_any_ofEhSt16initializer_listIhE: 159| 64.4k| static Mask is_any_of(T v, std::initializer_list accepted) { 160| 64.4k| T accept = 0; 161| | 162| 257k| for(auto a : accepted) { ------------------ | Branch (162:21): [True: 257k, False: 64.4k] ------------------ 163| 257k| const T diff = a ^ v; 164| 257k| const T eq_zero = ~diff & (diff - 1); 165| 257k| accept |= eq_zero; 166| 257k| } 167| | 168| 64.4k| return Mask(expand_top_bit(accept)); 169| 64.4k| } _ZNK5Botan2CT4MaskIhE6is_setEv: 271| 15.2k| bool is_set() const { return unpoisoned_value() != 0; } _ZNK5Botan2CT4MaskIhE16unpoisoned_valueEv: 262| 15.2k| T unpoisoned_value() const { 263| 15.2k| T r = value(); 264| 15.2k| CT::unpoison(r); 265| 15.2k| return r; 266| 15.2k| } _ZN5Botan2CT8unpoisonIhEEvRT_: 66| 15.2k|inline void unpoison(T& p) { 67| |#if defined(BOTAN_HAS_VALGRIND) 68| | VALGRIND_MAKE_MEM_DEFINED(&p, sizeof(T)); 69| |#else 70| 15.2k| BOTAN_UNUSED(p); ------------------ | | 118| 15.2k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 71| 15.2k|#endif 72| 15.2k|} _ZN5Botan2CT4MaskIhE5is_ltEhh: 133| 301k| static Mask is_lt(T x, T y) { return Mask(expand_top_bit(x ^ ((x ^ y) | ((x - y) ^ x)))); } _ZNK5Botan2CT4MaskIhE6selectEhh: 228| 3.59M| T select(T x, T y) const { return choose(value(), x, y); } _ZN5Botan2CT4MaskImE8is_equalEmm: 128| 24.5M| static Mask is_equal(T x, T y) { return Mask::is_zero(static_cast(x ^ y)); } _ZN5Botan2CT4MaskImE5is_ltEmm: 133| 40.3M| static Mask is_lt(T x, T y) { return Mask(expand_top_bit(x ^ ((x ^ y) | ((x - y) ^ x)))); } _ZN5Botan2CT4MaskImEC2Em: 279| 216M| Mask(T m) : m_mask(m) {} _ZNK5Botan2CT4MaskImE11select_maskES2_S2_: 239| 12.5M| Mask select_mask(Mask x, Mask y) const { return Mask(select(x.value(), y.value())); } _ZNK5Botan2CT4MaskImE5valueEv: 276| 663M| T value() const { return m_mask; } _ZN5Botan2CT4MaskImEoRES2_: 190| 1.03M| Mask& operator|=(Mask o) { 191| 1.03M| m_mask |= o.value(); 192| 1.03M| return (*this); 193| 1.03M| } _ZN5Botan2CT4MaskImEaNES2_: 174| 28.5k| Mask& operator&=(Mask o) { 175| 28.5k| m_mask &= o.value(); 176| 28.5k| return (*this); 177| 28.5k| } _ZNK5Botan2CT4MaskImE13if_set_returnEm: 218| 46.1M| T if_set_return(T x) const { return m_mask & x; } _ZN5Botan2CT4MaskImE6expandEm: 109| 48.7M| static Mask expand(T v) { return ~Mask::is_zero(v); } _ZNK5Botan2CT4MaskImEcoEv: 213| 66.3M| Mask operator~() const { return Mask(~value()); } _ZNK5Botan2CT4MaskImE6selectEmm: 228| 513M| T select(T x, T y) const { return choose(value(), x, y); } _ZNK5Botan2CT4MaskImE8select_nEPmPKmS5_m: 245| 10.0M| void select_n(T output[], const T x[], const T y[], size_t len) const { 246| 64.1M| for(size_t i = 0; i != len; ++i) ------------------ | Branch (246:28): [True: 54.1M, False: 10.0M] ------------------ 247| 54.1M| output[i] = this->select(x[i], y[i]); 248| 10.0M| } _ZN5Botan2CT4MaskImE7is_zeroEm: 123| 77.6M| static Mask is_zero(T x) { return Mask(ct_is_zero(x)); } _ZN5Botan2CT8unpoisonImEEvRT_: 66| 32.4M|inline void unpoison(T& p) { 67| |#if defined(BOTAN_HAS_VALGRIND) 68| | VALGRIND_MAKE_MEM_DEFINED(&p, sizeof(T)); 69| |#else 70| 32.4M| BOTAN_UNUSED(p); ------------------ | | 118| 32.4M|#define BOTAN_UNUSED Botan::ignore_params ------------------ 71| 32.4M|#endif 72| 32.4M|} _ZNK5Botan2CT4MaskImE6is_setEv: 271| 18.3M| bool is_set() const { return unpoisoned_value() != 0; } _ZNK5Botan2CT4MaskImE16unpoisoned_valueEv: 262| 18.3M| T unpoisoned_value() const { 263| 18.3M| T r = value(); 264| 18.3M| CT::unpoison(r); 265| 18.3M| return r; 266| 18.3M| } _ZN5Botan2CT8unpoisonIKmEEvRT_: 66| 373k|inline void unpoison(T& p) { 67| |#if defined(BOTAN_HAS_VALGRIND) 68| | VALGRIND_MAKE_MEM_DEFINED(&p, sizeof(T)); 69| |#else 70| 373k| BOTAN_UNUSED(p); ------------------ | | 118| 373k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 71| 373k|#endif 72| 373k|} _ZN5Botan2CT4MaskIhE6expandEh: 109| 2.96M| static Mask expand(T v) { return ~Mask::is_zero(v); } _ZN5Botan2CT20conditional_copy_memImEENS0_4MaskIT_EES3_PS3_PKS3_S7_m: 285| 167k|inline Mask conditional_copy_mem(T cnd, T* to, const T* from0, const T* from1, size_t elems) { 286| 167k| const auto mask = CT::Mask::expand(cnd); 287| 167k| mask.select_n(to, from0, from1, elems); 288| 167k| return mask; 289| 167k|} _ZN5Botan2CT20conditional_swap_ptrIPKmEEvbRT_S5_: 309| 2.48M|inline void conditional_swap_ptr(bool cnd, T& x, T& y) { 310| 2.48M| uintptr_t xp = reinterpret_cast(x); 311| 2.48M| uintptr_t yp = reinterpret_cast(y); 312| | 313| 2.48M| conditional_swap(cnd, xp, yp); 314| | 315| 2.48M| x = reinterpret_cast(xp); 316| 2.48M| y = reinterpret_cast(yp); 317| 2.48M|} _ZN5Botan2CT16conditional_swapImEEvbRT_S3_: 299| 4.97M|inline void conditional_swap(bool cnd, T& x, T& y) { 300| 4.97M| const auto swap = CT::Mask::expand(cnd); 301| | 302| 4.97M| T t0 = swap.select(y, x); 303| 4.97M| T t1 = swap.select(x, y); 304| 4.97M| x = t0; 305| 4.97M| y = t1; 306| 4.97M|} _ZN5Botan2CT4MaskIhE8is_equalEhh: 128| 73.6k| static Mask is_equal(T x, T y) { return Mask::is_zero(static_cast(x ^ y)); } _ZN5Botan2CT4MaskImE6is_gteEmm: 148| 17.6M| static Mask is_gte(T x, T y) { return ~Mask::is_lt(x, y); } _ZN5Botan2CTorENS0_4MaskImEES2_: 208| 18.3M| friend Mask operator|(Mask x, Mask y) { return Mask(x.value() | y.value()); } _ZN5Botan2CTeoENS0_4MaskImEES2_: 203| 6.13k| friend Mask operator^(Mask x, Mask y) { return Mask(x.value() ^ y.value()); } _ZN5Botan2CT4MaskImE3setEv: 99| 1.06k| static Mask set() { return Mask(static_cast(~0)); } _ZN5Botan2CT6poisonImEEvPKT_m: 48| 1.06k|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| 1.06k| BOTAN_UNUSED(p, n); ------------------ | | 118| 1.06k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 53| 1.06k|#endif 54| 1.06k|} _ZN5Botan2CT4MaskImE15if_set_zero_outEPmm: 253| 1.06k| void if_set_zero_out(T buf[], size_t elems) { 254| 5.56k| for(size_t i = 0; i != elems; ++i) { ------------------ | Branch (254:28): [True: 4.49k, False: 1.06k] ------------------ 255| 4.49k| buf[i] = this->if_not_set_return(buf[i]); 256| 4.49k| } 257| 1.06k| } _ZNK5Botan2CT4MaskImE17if_not_set_returnEm: 223| 1.01M| T if_not_set_return(T x) const { return ~m_mask & x; } _ZN5Botan2CT8unpoisonImEEvPKT_m: 57| 1.06k|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| 1.06k| BOTAN_UNUSED(p, n); ------------------ | | 118| 1.06k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 62| 1.06k|#endif 63| 1.06k|} _ZN5Botan2CT4MaskImE7clearedEv: 104| 115k| static Mask cleared() { return Mask(0); } _ZN5Botan2CT9all_zerosImEENS0_4MaskIT_EEPKS3_m: 320| 409k|inline CT::Mask all_zeros(const T elem[], size_t len) { 321| 409k| T sum = 0; 322| 2.20M| for(size_t i = 0; i != len; ++i) ------------------ | Branch (322:22): [True: 1.79M, False: 409k] ------------------ 323| 1.79M| sum |= elem[i]; 324| 409k| return CT::Mask::is_zero(sum); 325| 409k|} _ZN5Botan2CTanENS0_4MaskImEES2_: 198| 878k| friend Mask operator&(Mask x, Mask y) { return Mask(x.value() & y.value()); } _ZN5Botan2CT22conditional_assign_memImEENS0_4MaskIT_EES3_PS3_PKS3_m: 292| 6.38M|inline Mask conditional_assign_mem(T cnd, T* sink, const T* src, size_t elems) { 293| 6.38M| const auto mask = CT::Mask::expand(cnd); 294| 6.38M| mask.select_n(sink, src, sink, elems); 295| 6.38M| return mask; 296| 6.38M|} _ZN5Botan2CT8unpoisonIlEEvRT_: 66| 425k|inline void unpoison(T& p) { 67| |#if defined(BOTAN_HAS_VALGRIND) 68| | VALGRIND_MAKE_MEM_DEFINED(&p, sizeof(T)); 69| |#else 70| 425k| BOTAN_UNUSED(p); ------------------ | | 118| 425k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 71| 425k|#endif 72| 425k|} _ZN5Botan9ct_divideERKNS_6BigIntES2_: 49| 2.92k|inline BigInt ct_divide(const BigInt& x, const BigInt& y) { 50| 2.92k| BigInt q, r; 51| 2.92k| ct_divide(x, y, q, r); 52| 2.92k| return q; 53| 2.92k|} _ZNK5Botan12DL_PublicKey5groupEv: 29| 8| const DL_Group& group() const { return m_group; } _ZN5Botan8FE_25519C2ESt16initializer_listIiE: 36| 1.53k| FE_25519(std::initializer_list 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| 414| virtual ~EMSA() = default; _ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_: 51| 17.2k|std::string fmt(std::string_view format, const T&... args) { 52| 17.2k| std::ostringstream oss; 53| 17.2k| oss.imbue(std::locale::classic()); 54| 17.2k| fmt_detail::do_fmt(oss, format, args...); 55| 17.2k| return oss.str(); 56| 17.2k|} _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| 174k| while(i < format.size()) { ------------------ | Branch (26:10): [True: 174k, False: 0] ------------------ 27| 174k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 18.0k, False: 156k] | 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| 156k| } else { 31| 156k| oss << format[i]; 32| 156k| } 33| | 34| 156k| i += 1; 35| 156k| } 36| 18.0k|} _ZN5Botan10fmt_detail6do_fmtERNSt3__119basic_ostringstreamIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EE: 20| 22.8k|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| 3.96k|std::string fmt(std::string_view format, const T&... args) { 52| 3.96k| std::ostringstream oss; 53| 3.96k| oss.imbue(std::locale::classic()); 54| 3.96k| fmt_detail::do_fmt(oss, format, args...); 55| 3.96k| return oss.str(); 56| 3.96k|} _ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJPKcEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_: 23| 3.96k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 3.96k| size_t i = 0; 25| | 26| 3.96k| while(i < format.size()) { ------------------ | Branch (26:10): [True: 3.96k, False: 0] ------------------ 27| 3.96k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 3.96k, False: 0] | Branch (27:30): [True: 3.96k, False: 0] | Branch (27:59): [True: 3.96k, False: 0] ------------------ 28| 3.96k| oss << val; 29| 3.96k| return do_fmt(oss, format.substr(i + 2), rest...); 30| 3.96k| } else { 31| 0| oss << format[i]; 32| 0| } 33| | 34| 0| i += 1; 35| 0| } 36| 3.96k|} _ZN5Botan10fmt_detail6do_fmtIPKcJEEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 23| 4.04k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 4.04k| size_t i = 0; 25| | 26| 55.6k| while(i < format.size()) { ------------------ | Branch (26:10): [True: 55.6k, False: 0] ------------------ 27| 55.6k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 4.04k, False: 51.5k] | Branch (27:30): [True: 4.04k, False: 0] | Branch (27:59): [True: 4.04k, False: 0] ------------------ 28| 4.04k| oss << val; 29| 4.04k| return do_fmt(oss, format.substr(i + 2), rest...); 30| 51.5k| } else { 31| 51.5k| oss << format[i]; 32| 51.5k| } 33| | 34| 51.5k| i += 1; 35| 51.5k| } 36| 4.04k|} _ZN5Botan3fmtIJPKcNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEEEENS3_12basic_stringIcS6_NS3_9allocatorIcEEEES7_DpRKT_: 51| 502|std::string fmt(std::string_view format, const T&... args) { 52| 502| std::ostringstream oss; 53| 502| oss.imbue(std::locale::classic()); 54| 502| fmt_detail::do_fmt(oss, format, args...); 55| 502| return oss.str(); 56| 502|} _ZN5Botan10fmt_detail6do_fmtIPKcJNSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEEEEvRNS4_19basic_ostringstreamIcS7_NS4_9allocatorIcEEEES8_RKT_DpRKT0_: 23| 502|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 502| size_t i = 0; 25| | 26| 502| while(i < format.size()) { ------------------ | Branch (26:10): [True: 502, False: 0] ------------------ 27| 502| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 502, False: 0] | Branch (27:30): [True: 502, False: 0] | Branch (27:59): [True: 502, False: 0] ------------------ 28| 502| oss << val; 29| 502| return do_fmt(oss, format.substr(i + 2), rest...); 30| 502| } else { 31| 0| oss << format[i]; 32| 0| } 33| | 34| 0| i += 1; 35| 0| } 36| 502|} _ZN5Botan10fmt_detail6do_fmtImJEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 23| 45|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 45| size_t i = 0; 25| | 26| 459| while(i < format.size()) { ------------------ | Branch (26:10): [True: 459, False: 0] ------------------ 27| 459| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 45, False: 414] | Branch (27:30): [True: 45, False: 0] | Branch (27:59): [True: 45, False: 0] ------------------ 28| 45| oss << val; 29| 45| return do_fmt(oss, format.substr(i + 2), rest...); 30| 414| } else { 31| 414| oss << format[i]; 32| 414| } 33| | 34| 414| i += 1; 35| 414| } 36| 45|} _ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEjEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_: 51| 327|std::string fmt(std::string_view format, const T&... args) { 52| 327| std::ostringstream oss; 53| 327| oss.imbue(std::locale::classic()); 54| 327| fmt_detail::do_fmt(oss, format, args...); 55| 327| return oss.str(); 56| 327|} _ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJjEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_: 23| 327|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 327| size_t i = 0; 25| | 26| 327| while(i < format.size()) { ------------------ | Branch (26:10): [True: 327, False: 0] ------------------ 27| 327| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 327, False: 0] | Branch (27:30): [True: 327, False: 0] | Branch (27:59): [True: 327, False: 0] ------------------ 28| 327| oss << val; 29| 327| return do_fmt(oss, format.substr(i + 2), rest...); 30| 327| } else { 31| 0| oss << format[i]; 32| 0| } 33| | 34| 0| i += 1; 35| 0| } 36| 327|} _ZN5Botan10fmt_detail6do_fmtIjJEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 23| 439|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 439| size_t i = 0; 25| | 26| 4.78k| while(i < format.size()) { ------------------ | Branch (26:10): [True: 4.78k, False: 0] ------------------ 27| 4.78k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 439, False: 4.35k] | Branch (27:30): [True: 439, False: 0] | Branch (27:59): [True: 439, False: 0] ------------------ 28| 439| oss << val; 29| 439| return do_fmt(oss, format.substr(i + 2), rest...); 30| 4.35k| } else { 31| 4.35k| oss << format[i]; 32| 4.35k| } 33| | 34| 4.35k| i += 1; 35| 4.35k| } 36| 439|} _ZN5Botan3fmtIJjEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 51| 112|std::string fmt(std::string_view format, const T&... args) { 52| 112| std::ostringstream oss; 53| 112| oss.imbue(std::locale::classic()); 54| 112| fmt_detail::do_fmt(oss, format, args...); 55| 112| return oss.str(); 56| 112|} _ZN5Botan3fmtIJNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEES7_NS1_17basic_string_viewIcS4_EEDpRKT_: 51| 271|std::string fmt(std::string_view format, const T&... args) { 52| 271| std::ostringstream oss; 53| 271| oss.imbue(std::locale::classic()); 54| 271| fmt_detail::do_fmt(oss, format, args...); 55| 271| return oss.str(); 56| 271|} _ZN5Botan10fmt_detail6do_fmtINSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEJEEEvRNS2_19basic_ostringstreamIcS5_S7_EENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 23| 271|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 271| size_t i = 0; 25| | 26| 3.40k| while(i < format.size()) { ------------------ | Branch (26:10): [True: 3.40k, False: 0] ------------------ 27| 3.40k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 271, False: 3.13k] | Branch (27:30): [True: 271, False: 0] | Branch (27:59): [True: 271, False: 0] ------------------ 28| 271| oss << val; 29| 271| return do_fmt(oss, format.substr(i + 2), rest...); 30| 3.13k| } else { 31| 3.13k| oss << format[i]; 32| 3.13k| } 33| | 34| 3.13k| i += 1; 35| 3.13k| } 36| 271|} _ZN5Botan3fmtIJmEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 51| 3|std::string fmt(std::string_view format, const T&... args) { 52| 3| std::ostringstream oss; 53| 3| oss.imbue(std::locale::classic()); 54| 3| fmt_detail::do_fmt(oss, format, args...); 55| 3| return oss.str(); 56| 3|} _ZN5Botan3fmtIJNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEmEEES7_NS1_17basic_string_viewIcS4_EEDpRKT_: 51| 42|std::string fmt(std::string_view format, const T&... args) { 52| 42| std::ostringstream oss; 53| 42| oss.imbue(std::locale::classic()); 54| 42| fmt_detail::do_fmt(oss, format, args...); 55| 42| return oss.str(); 56| 42|} _ZN5Botan10fmt_detail6do_fmtINSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEJmEEEvRNS2_19basic_ostringstreamIcS5_S7_EENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 23| 42|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 42| size_t i = 0; 25| | 26| 84| while(i < format.size()) { ------------------ | Branch (26:10): [True: 84, False: 0] ------------------ 27| 84| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 42, False: 42] | Branch (27:30): [True: 42, False: 0] | Branch (27:59): [True: 42, False: 0] ------------------ 28| 42| oss << val; 29| 42| return do_fmt(oss, format.substr(i + 2), rest...); 30| 42| } else { 31| 42| oss << format[i]; 32| 42| } 33| | 34| 42| i += 1; 35| 42| } 36| 42|} _ZN5Botan3fmtIJPKcS2_S2_EEENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS3_17basic_string_viewIcS6_EEDpRKT_: 51| 82|std::string fmt(std::string_view format, const T&... args) { 52| 82| std::ostringstream oss; 53| 82| oss.imbue(std::locale::classic()); 54| 82| fmt_detail::do_fmt(oss, format, args...); 55| 82| return oss.str(); 56| 82|} _ZN5Botan10fmt_detail6do_fmtIPKcJS3_S3_EEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 23| 82|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 82| size_t i = 0; 25| | 26| 82| while(i < format.size()) { ------------------ | Branch (26:10): [True: 82, False: 0] ------------------ 27| 82| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 82, False: 0] | Branch (27:30): [True: 82, False: 0] | Branch (27:59): [True: 82, False: 0] ------------------ 28| 82| oss << val; 29| 82| return do_fmt(oss, format.substr(i + 2), rest...); 30| 82| } else { 31| 0| oss << format[i]; 32| 0| } 33| | 34| 0| i += 1; 35| 0| } 36| 82|} _ZN5Botan10fmt_detail6do_fmtIPKcJS3_EEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 23| 82|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 82| size_t i = 0; 25| | 26| 410| while(i < format.size()) { ------------------ | Branch (26:10): [True: 410, False: 0] ------------------ 27| 410| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 82, False: 328] | Branch (27:30): [True: 82, False: 0] | Branch (27:59): [True: 82, False: 0] ------------------ 28| 82| oss << val; 29| 82| return do_fmt(oss, format.substr(i + 2), rest...); 30| 328| } else { 31| 328| oss << format[i]; 32| 328| } 33| | 34| 328| i += 1; 35| 328| } 36| 82|} _ZN5Botan3fmtIJmPKcEEENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS3_17basic_string_viewIcS6_EEDpRKT_: 51| 1|std::string fmt(std::string_view format, const T&... args) { 52| 1| std::ostringstream oss; 53| 1| oss.imbue(std::locale::classic()); 54| 1| fmt_detail::do_fmt(oss, format, args...); 55| 1| return oss.str(); 56| 1|} _ZN5Botan10fmt_detail6do_fmtImJPKcEEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 23| 1|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 1| size_t i = 0; 25| | 26| 14| while(i < format.size()) { ------------------ | Branch (26:10): [True: 14, False: 0] ------------------ 27| 14| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 1, False: 13] | Branch (27:30): [True: 1, False: 0] | Branch (27:59): [True: 1, False: 0] ------------------ 28| 1| oss << val; 29| 1| return do_fmt(oss, format.substr(i + 2), rest...); 30| 13| } else { 31| 13| oss << format[i]; 32| 13| } 33| | 34| 13| i += 1; 35| 13| } 36| 1|} _ZN5Botan3fmtIJNS_3OIDEEEENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EEDpRKT_: 51| 2|std::string fmt(std::string_view format, const T&... args) { 52| 2| std::ostringstream oss; 53| 2| oss.imbue(std::locale::classic()); 54| 2| fmt_detail::do_fmt(oss, format, args...); 55| 2| return oss.str(); 56| 2|} _ZN5Botan10fmt_detail6do_fmtINS_3OIDEJEEEvRNSt3__119basic_ostringstreamIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS3_17basic_string_viewIcS6_EERKT_DpRKT0_: 23| 2|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 2| size_t i = 0; 25| | 26| 28| while(i < format.size()) { ------------------ | Branch (26:10): [True: 28, False: 0] ------------------ 27| 28| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 2, False: 26] | Branch (27:30): [True: 2, False: 0] | Branch (27:59): [True: 2, False: 0] ------------------ 28| 2| oss << val; 29| 2| return do_fmt(oss, format.substr(i + 2), rest...); 30| 26| } else { 31| 26| oss << format[i]; 32| 26| } 33| | 34| 26| i += 1; 35| 26| } 36| 2|} _ZN5Botan3fmtIJNS_3OIDENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEEEENS2_12basic_stringIcS5_NS2_9allocatorIcEEEES6_DpRKT_: 51| 307|std::string fmt(std::string_view format, const T&... args) { 52| 307| std::ostringstream oss; 53| 307| oss.imbue(std::locale::classic()); 54| 307| fmt_detail::do_fmt(oss, format, args...); 55| 307| return oss.str(); 56| 307|} _ZN5Botan10fmt_detail6do_fmtINS_3OIDEJNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEEEEvRNS3_19basic_ostringstreamIcS6_NS3_9allocatorIcEEEES7_RKT_DpRKT0_: 23| 307|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 24| 307| size_t i = 0; 25| | 26| 11.0k| while(i < format.size()) { ------------------ | Branch (26:10): [True: 11.0k, False: 0] ------------------ 27| 11.0k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (27:10): [True: 307, False: 10.7k] | Branch (27:30): [True: 307, False: 0] | Branch (27:59): [True: 307, False: 0] ------------------ 28| 307| oss << val; 29| 307| return do_fmt(oss, format.substr(i + 2), rest...); 30| 10.7k| } else { 31| 10.7k| oss << format[i]; 32| 10.7k| } 33| | 34| 10.7k| i += 1; 35| 10.7k| } 36| 307|} _ZN5Botan8get_byteILm0EmEEhT0_: 52| 40.4k|{ 53| 40.4k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 54| 40.4k| return static_cast((input >> shift) & 0xFF); 55| 40.4k|} _ZN5Botan11make_uint16Ehh: 63| 94|inline constexpr uint16_t make_uint16(uint8_t i0, uint8_t i1) { 64| 94| return static_cast((static_cast(i0) << 8) | i1); 65| 94|} _ZN5Botan7load_beItEET_PKhm: 136| 4.81k|inline constexpr uint16_t load_be(const uint8_t in[], size_t off) { 137| 4.81k| in += off * sizeof(uint16_t); 138| | 139| 4.81k|#if defined(BOTAN_ENDIAN_N2B) 140| 4.81k| uint16_t x = 0; 141| 4.81k| typecast_copy(x, in); 142| 4.81k| return BOTAN_ENDIAN_N2B(x); ------------------ | | 26| 4.81k| #define BOTAN_ENDIAN_N2B(x) reverse_bytes(x) ------------------ 143| |#else 144| | return make_uint16(in[0], in[1]); 145| |#endif 146| 4.81k|} _ZN5Botan7load_beIjEET_PKhm: 174| 518k|inline constexpr uint32_t load_be(const uint8_t in[], size_t off) { 175| 518k| in += off * sizeof(uint32_t); 176| 518k|#if defined(BOTAN_ENDIAN_N2B) 177| 518k| uint32_t x = 0; 178| 518k| typecast_copy(x, in); 179| 518k| return BOTAN_ENDIAN_N2B(x); ------------------ | | 26| 518k| #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| 518k|} _ZN5Botan7load_beImEET_PKhm: 210| 72.5k|inline constexpr uint64_t load_be(const uint8_t in[], size_t off) { 211| 72.5k| in += off * sizeof(uint64_t); 212| 72.5k|#if defined(BOTAN_ENDIAN_N2B) 213| 72.5k| uint64_t x = 0; 214| 72.5k| typecast_copy(x, in); 215| 72.5k| return BOTAN_ENDIAN_N2B(x); ------------------ | | 26| 72.5k| #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| 72.5k|} _ZN5Botan8store_beEjPh: 437| 104k|inline constexpr void store_be(uint32_t in, uint8_t out[4]) { 438| 104k|#if defined(BOTAN_ENDIAN_B2N) 439| 104k| uint32_t o = BOTAN_ENDIAN_B2N(in); ------------------ | | 27| 104k| #define BOTAN_ENDIAN_B2N(x) reverse_bytes(x) ------------------ 440| 104k| 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| 104k|} _ZN5Botan8store_leEjPh: 454| 508|inline constexpr void store_le(uint32_t in, uint8_t out[4]) { 455| 508|#if defined(BOTAN_ENDIAN_L2N) 456| 508| uint32_t o = BOTAN_ENDIAN_L2N(in); ------------------ | | 25| 508| #define BOTAN_ENDIAN_L2N(x) (x) ------------------ 457| 508| 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| 508|} _ZN5Botan8store_beEmPh: 471| 37.6k|inline constexpr void store_be(uint64_t in, uint8_t out[8]) { 472| 37.6k|#if defined(BOTAN_ENDIAN_B2N) 473| 37.6k| uint64_t o = BOTAN_ENDIAN_B2N(in); ------------------ | | 27| 37.6k| #define BOTAN_ENDIAN_B2N(x) reverse_bytes(x) ------------------ 474| 37.6k| 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| 37.6k|} _ZN5Botan8store_leEmPh: 492| 201|inline constexpr void store_le(uint64_t in, uint8_t out[8]) { 493| 201|#if defined(BOTAN_ENDIAN_L2N) 494| 201| uint64_t o = BOTAN_ENDIAN_L2N(in); ------------------ | | 25| 201| #define BOTAN_ENDIAN_L2N(x) (x) ------------------ 495| 201| 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| 201|} _ZN5Botan12get_byte_varImEEhmT_: 40| 32.8k|inline constexpr uint8_t get_byte_var(size_t byte_num, T input) { 41| 32.8k| return static_cast(input >> (((~byte_num) & (sizeof(T) - 1)) << 3)); 42| 32.8k|} _ZN5Botan15copy_out_vec_leIjNS_16secure_allocatorIjEEEEvPhmRKNSt3__16vectorIT_T0_EE: 644| 127|void copy_out_vec_le(uint8_t out[], size_t out_bytes, const std::vector& in) { 645| 127| copy_out_le(out, out_bytes, in.data()); 646| 127|} _ZN5Botan11copy_out_leIjEEvPhmPKT_: 631| 127|void copy_out_le(uint8_t out[], size_t out_bytes, const T in[]) { 632| 635| while(out_bytes >= sizeof(T)) { ------------------ | Branch (632:10): [True: 508, False: 127] ------------------ 633| 508| store_le(in[0], out); 634| 508| out += sizeof(T); 635| 508| out_bytes -= sizeof(T); 636| 508| in += 1; 637| 508| } 638| | 639| 127| for(size_t i = 0; i != out_bytes; ++i) ------------------ | Branch (639:22): [True: 0, False: 127] ------------------ 640| 0| out[i] = get_byte_var(sizeof(T) - 1 - (i % 8), in[0]); 641| 127|} _ZN5Botan7load_leIjEEvPT_PKhm: 298| 528|inline constexpr void load_le(T out[], const uint8_t in[], size_t count) { 299| 528| if(count > 0) { ------------------ | Branch (299:7): [True: 528, False: 0] ------------------ 300| 528|#if defined(BOTAN_TARGET_CPU_IS_LITTLE_ENDIAN) 301| 528| 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(in, i); 317| |#endif 318| 528| } 319| 528|} _ZN5Botan15copy_out_vec_beIjNS_16secure_allocatorIjEEEEvPhmRKNSt3__16vectorIT_T0_EE: 626| 14.9k|void copy_out_vec_be(uint8_t out[], size_t out_bytes, const std::vector& in) { 627| 14.9k| copy_out_be(out, out_bytes, in.data()); 628| 14.9k|} _ZN5Botan11copy_out_beIjEEvPhmPKT_: 613| 14.9k|void copy_out_be(uint8_t out[], size_t out_bytes, const T in[]) { 614| 116k| while(out_bytes >= sizeof(T)) { ------------------ | Branch (614:10): [True: 101k, False: 14.9k] ------------------ 615| 101k| store_be(in[0], out); 616| 101k| out += sizeof(T); 617| 101k| out_bytes -= sizeof(T); 618| 101k| in += 1; 619| 101k| } 620| | 621| 14.9k| for(size_t i = 0; i != out_bytes; ++i) ------------------ | Branch (621:22): [True: 0, False: 14.9k] ------------------ 622| 0| out[i] = get_byte_var(i % 8, in[0]); 623| 14.9k|} _ZN5Botan15copy_out_vec_beImNS_16secure_allocatorImEEEEvPhmRKNSt3__16vectorIT_T0_EE: 626| 540|void copy_out_vec_be(uint8_t out[], size_t out_bytes, const std::vector& in) { 627| 540| copy_out_be(out, out_bytes, in.data()); 628| 540|} _ZN5Botan11copy_out_beImEEvPhmPKT_: 613| 540|void copy_out_be(uint8_t out[], size_t out_bytes, const T in[]) { 614| 3.82k| while(out_bytes >= sizeof(T)) { ------------------ | Branch (614:10): [True: 3.28k, False: 540] ------------------ 615| 3.28k| store_be(in[0], out); 616| 3.28k| out += sizeof(T); 617| 3.28k| out_bytes -= sizeof(T); 618| 3.28k| in += 1; 619| 3.28k| } 620| | 621| 540| for(size_t i = 0; i != out_bytes; ++i) ------------------ | Branch (621:22): [True: 0, False: 540] ------------------ 622| 0| out[i] = get_byte_var(i % 8, in[0]); 623| 540|} _ZN5Botan3MD5C2Ev: 30| 127| MD5() : MDx_HashFunction(64, false, true), m_M(16), m_digest(4) { clear(); } _ZNK5Botan3MD54nameEv: 20| 127| std::string name() const override { return "MD5"; } _ZNK5Botan3MD513output_lengthEv: 22| 505| size_t output_length() const override { return 16; } _ZNK5Botan16MDx_HashFunction15hash_block_sizeEv: 29| 528| size_t hash_block_size() const override final { return m_buffer.size(); } _ZNK5Botan14Montgomery_Int4reprEv: 76| 425k| const BigInt& repr() const { return m_v; } _ZNK5Botan14Montgomery_Int17const_time_poisonEv: 122| 10.0k| void const_time_poison() const { m_v.const_time_poison(); } _ZNK5Botan14Montgomery_Int19const_time_unpoisonEv: 124| 12.3k| void const_time_unpoison() const { return m_v.const_time_unpoison(); } _ZNK5Botan17Montgomery_Params1pEv: 148| 24.7k| const BigInt& p() const { return m_p; } _ZNK5Botan17Montgomery_Params2R1Ev: 150| 12.3k| const BigInt& R1() const { return m_r1; } _ZNK5Botan17Montgomery_Params2R2Ev: 152| 12.3k| const BigInt& R2() const { return m_r2; } _ZNK5Botan17Montgomery_Params7p_wordsEv: 158| 193k| size_t p_words() const { return m_p_words; } _ZN5Botan17monty_exp_vartimeENSt3__110shared_ptrIKNS_17Montgomery_ParamsEEERKNS_6BigIntES7_: 49| 11.3k|inline BigInt monty_exp_vartime(std::shared_ptr params_p, const BigInt& g, const BigInt& k) { 50| 11.3k| auto precomputed = monty_precompute(params_p, g, 4, false); 51| 11.3k| return monty_execute_vartime(*precomputed, k); 52| 11.3k|} _ZN5Botan10word8_sub3EPmPKmS2_m: 413| 20.2M|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| 20.2M| asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "sbbq")) 422| 20.2M| : [carry] "=r"(carry) 423| 20.2M| : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry) 424| 20.2M| : "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| 20.2M| return carry; 438| 20.2M|} _ZN5Botan8word_subEmmPm: 326| 127M|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| 127M| asm(ADD_OR_SUBTRACT(ASM("sbbq %[y],%[x]")) 336| 127M| : [x] "=r"(x), [carry] "=r"(*carry) 337| 127M| : "0"(x), [y] "rm"(y), "1"(*carry) 338| 127M| : "cc"); 339| 127M| 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| 127M|} _ZN5Botan10word8_add3EPmPKmS2_m: 296| 1.43M|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| 1.43M| asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "adcq")) 305| 1.43M| : [carry] "=r"(carry) 306| 1.43M| : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry) 307| 1.43M| : "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| 1.43M| return carry; 321| 1.43M|} _ZN5Botan8word_addEmmPm: 237| 34.1M|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| 34.1M| asm(ADD_OR_SUBTRACT(ASM("adcq %[y],%[x]")) 248| 34.1M| : [x] "=r"(x), [carry] "=r"(*carry) 249| 34.1M| : "0"(x), [y] "rm"(y), "1"(*carry) 250| 34.1M| : "cc"); 251| 34.1M| 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| 34.1M|} _ZN5Botan10word_madd2EmmPm: 44| 5.58M|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| 5.58M| asm(R"( 59| 5.58M| mulq %[b] 60| 5.58M| addq %[c],%[a] 61| 5.58M| adcq $0,%[carry] 62| 5.58M| )" 63| 5.58M| : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*c) 64| 5.58M| : "0"(a), "1"(b), [c] "g"(*c) 65| 5.58M| : "cc"); 66| | 67| 5.58M| return a; 68| | 69| |#elif defined(BOTAN_MP_DWORD) 70| | const BOTAN_MP_DWORD s = static_cast(a) * b + *c; 71| | *c = static_cast(s >> BOTAN_MP_WORD_BITS); 72| | return static_cast(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| 5.58M|} _ZN5Botan10word_madd3EmmmPm: 91| 20.3M|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| 20.3M| asm(R"( 110| 20.3M| mulq %[b] 111| 20.3M| 112| 20.3M| addq %[c],%[a] 113| 20.3M| adcq $0,%[carry] 114| 20.3M| 115| 20.3M| addq %[d],%[a] 116| 20.3M| adcq $0,%[carry] 117| 20.3M| )" 118| 20.3M| : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*d) 119| 20.3M| : "0"(a), "1"(b), [c] "g"(c), [d] "g"(*d) 120| 20.3M| : "cc"); 121| | 122| 20.3M| return a; 123| | 124| |#elif defined(BOTAN_MP_DWORD) 125| | const BOTAN_MP_DWORD s = static_cast(a) * b + c + *d; 126| | *d = static_cast(s >> BOTAN_MP_WORD_BITS); 127| | return static_cast(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| 20.3M|} _ZN5Botan10word8_add2EPmPKmm: 265| 107k|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| 107k| asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "adcq")) 275| 107k| : [carry] "=r"(carry) 276| 107k| : [x] "r"(x), [y] "r"(y), "0"(carry) 277| 107k| : "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| 107k| return carry; 291| 107k|} _ZN5Botan10word8_sub2EPmPKmm: 353| 93.8k|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| 93.8k| asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "sbbq")) 362| 93.8k| : [carry] "=r"(carry) 363| 93.8k| : [x] "r"(x), [y] "r"(y), "0"(carry) 364| 93.8k| : "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| 93.8k| return carry; 378| 93.8k|} _ZN5Botan14word8_sub2_revEPmPKmm: 383| 381|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| 381| asm(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "sbbq")) 392| 381| : [carry] "=r"(carry) 393| 381| : [x] "r"(y), [y] "r"(x), [z] "r"(x), "0"(carry) 394| 381| : "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| 381| return carry; 408| 381|} _ZN5Botan13word8_linmul2EPmmm: 443| 22.2M|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| 22.2M| 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| 22.2M| return carry; 462| 22.2M|} _ZN5Botan13word8_linmul3EPmPKmmm: 467| 46.7k|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| 46.7k| asm(DO_8_TIMES(LINMUL_OP, "z") 476| 46.7k| : [carry] "=r"(carry) 477| 46.7k| : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry) 478| 46.7k| : "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| 46.7k| return carry; 492| 46.7k|} _ZN5Botan11word8_madd3EPmPKmmm: 497| 2.06M|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| 2.06M| asm(DO_8_TIMES(MULADD_OP, "") 506| 2.06M| : [carry] "=r"(carry) 507| 2.06M| : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry) 508| 2.06M| : "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| 2.06M| return carry; 522| 2.06M|} _ZN5Botan12word3_muladdEPmS0_S0_mm: 528| 277M|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| 277M| word z0 = 0, z1 = 0; 545| | 546| 277M| asm("mulq %[y]" : "=a"(z0), "=d"(z1) : "a"(x), [y] "rm"(y) : "cc"); 547| | 548| 277M| asm(R"( 549| 277M| addq %[z0],%[w0] 550| 277M| adcq %[z1],%[w1] 551| 277M| adcq $0,%[w2] 552| 277M| )" 553| 277M| : [w0] "=r"(*w0), [w1] "=r"(*w1), [w2] "=r"(*w2) 554| 277M| : [z0] "r"(z0), [z1] "r"(z1), "0"(*w0), "1"(*w1), "2"(*w2) 555| 277M| : "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| 277M|} _ZN5Botan9word3_addEPmS0_S0_m: 569| 46.2M|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| 46.2M| asm(R"( 582| 46.2M| addq %[x],%[w0] 583| 46.2M| adcq $0,%[w1] 584| 46.2M| adcq $0,%[w2] 585| 46.2M| )" 586| 46.2M| : [w0] "=r"(*w0), [w1] "=r"(*w1), [w2] "=r"(*w2) 587| 46.2M| : [x] "r"(x), "0"(*w0), "1"(*w1), "2"(*w2) 588| 46.2M| : "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| 46.2M|} _ZN5Botan14word3_muladd_2EPmS0_S0_mm: 603| 33.7M|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| 33.7M| word z0 = 0, z1 = 0; 624| | 625| 33.7M| asm("mulq %[y]" : "=a"(z0), "=d"(z1) : "a"(x), [y] "rm"(y) : "cc"); 626| | 627| 33.7M| asm(R"( 628| 33.7M| addq %[z0],%[w0] 629| 33.7M| adcq %[z1],%[w1] 630| 33.7M| adcq $0,%[w2] 631| 33.7M| 632| 33.7M| addq %[z0],%[w0] 633| 33.7M| adcq %[z1],%[w1] 634| 33.7M| adcq $0,%[w2] 635| 33.7M| )" 636| 33.7M| : [w0] "=r"(*w0), [w1] "=r"(*w1), [w2] "=r"(*w2) 637| 33.7M| : [z0] "r"(z0), [z1] "r"(z1), "0"(*w0), "1"(*w1), "2"(*w2) 638| 33.7M| : "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| 33.7M|} _ZN5Botan10bigint_cmpEPKmmS1_m: 468| 2.64M|inline int32_t bigint_cmp(const word x[], size_t x_size, const word y[], size_t y_size) { 469| 2.64M| static_assert(sizeof(word) >= sizeof(uint32_t), "Size assumption"); 470| | 471| 2.64M| const word LT = static_cast(-1); 472| 2.64M| const word EQ = 0; 473| 2.64M| const word GT = 1; 474| | 475| 2.64M| const size_t common_elems = std::min(x_size, y_size); 476| | 477| 2.64M| word result = EQ; // until found otherwise 478| | 479| 12.7M| for(size_t i = 0; i != common_elems; i++) { ------------------ | Branch (479:22): [True: 10.1M, False: 2.64M] ------------------ 480| 10.1M| const auto is_eq = CT::Mask::is_equal(x[i], y[i]); 481| 10.1M| const auto is_lt = CT::Mask::is_lt(x[i], y[i]); 482| | 483| 10.1M| result = is_eq.select(result, is_lt.select(LT, GT)); 484| 10.1M| } 485| | 486| 2.64M| if(x_size < y_size) { ------------------ | Branch (486:7): [True: 1.43M, False: 1.21M] ------------------ 487| 1.43M| word mask = 0; 488| 7.37M| for(size_t i = x_size; i != y_size; i++) ------------------ | Branch (488:30): [True: 5.93M, False: 1.43M] ------------------ 489| 5.93M| mask |= y[i]; 490| | 491| | // If any bits were set in high part of y, then x < y 492| 1.43M| result = CT::Mask::is_zero(mask).select(result, LT); 493| 1.43M| } else if(y_size < x_size) { ------------------ | Branch (493:14): [True: 4.87k, False: 1.20M] ------------------ 494| 4.87k| word mask = 0; 495| 25.5k| for(size_t i = y_size; i != x_size; i++) ------------------ | Branch (495:30): [True: 20.6k, False: 4.87k] ------------------ 496| 20.6k| mask |= x[i]; 497| | 498| | // If any bits were set in high part of x, then x > y 499| 4.87k| result = CT::Mask::is_zero(mask).select(result, GT); 500| 4.87k| } 501| | 502| 2.64M| CT::unpoison(result); 503| 2.64M| BOTAN_DEBUG_ASSERT(result == LT || result == GT || result == EQ); ------------------ | | 99| 2.64M| do { \ | | 100| 2.64M| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 504| 2.64M| return static_cast(result); 505| 2.64M|} _ZN5Botan15bigint_ct_is_eqEPKmmS1_m: 542| 90.1k|inline CT::Mask bigint_ct_is_eq(const word x[], size_t x_size, const word y[], size_t y_size) { 543| 90.1k| const size_t common_elems = std::min(x_size, y_size); 544| | 545| 90.1k| word diff = 0; 546| | 547| 359k| for(size_t i = 0; i != common_elems; i++) { ------------------ | Branch (547:22): [True: 269k, False: 90.1k] ------------------ 548| 269k| diff |= (x[i] ^ y[i]); 549| 269k| } 550| | 551| | // If any bits were set in high part of x/y, then they are not equal 552| 90.1k| if(x_size < y_size) { ------------------ | Branch (552:7): [True: 5.99k, False: 84.1k] ------------------ 553| 17.2k| for(size_t i = x_size; i != y_size; i++) ------------------ | Branch (553:30): [True: 11.2k, False: 5.99k] ------------------ 554| 11.2k| diff |= y[i]; 555| 84.1k| } else if(y_size < x_size) { ------------------ | Branch (555:14): [True: 5.71k, False: 78.4k] ------------------ 556| 16.1k| for(size_t i = y_size; i != x_size; i++) ------------------ | Branch (556:30): [True: 10.4k, False: 5.71k] ------------------ 557| 10.4k| diff |= x[i]; 558| 5.71k| } 559| | 560| 90.1k| return CT::Mask::is_zero(diff); 561| 90.1k|} _ZN5Botan15bigint_ct_is_ltEPKmmS1_mb: 513| 2.83M| const word x[], size_t x_size, const word y[], size_t y_size, bool lt_or_equal = false) { 514| 2.83M| const size_t common_elems = std::min(x_size, y_size); 515| | 516| 2.83M| auto is_lt = CT::Mask::expand(lt_or_equal); 517| | 518| 15.3M| for(size_t i = 0; i != common_elems; i++) { ------------------ | Branch (518:22): [True: 12.5M, False: 2.83M] ------------------ 519| 12.5M| const auto eq = CT::Mask::is_equal(x[i], y[i]); 520| 12.5M| const auto lt = CT::Mask::is_lt(x[i], y[i]); 521| 12.5M| is_lt = eq.select_mask(is_lt, lt); 522| 12.5M| } 523| | 524| 2.83M| if(x_size < y_size) { ------------------ | Branch (524:7): [True: 29.0k, False: 2.80M] ------------------ 525| 29.0k| word mask = 0; 526| 144k| for(size_t i = x_size; i != y_size; i++) ------------------ | Branch (526:30): [True: 115k, False: 29.0k] ------------------ 527| 115k| mask |= y[i]; 528| | // If any bits were set in high part of y, then is_lt should be forced true 529| 29.0k| is_lt |= CT::Mask::expand(mask); 530| 2.80M| } else if(y_size < x_size) { ------------------ | Branch (530:14): [True: 20.6k, False: 2.78M] ------------------ 531| 20.6k| word mask = 0; 532| 82.5k| for(size_t i = y_size; i != x_size; i++) ------------------ | Branch (532:30): [True: 61.8k, False: 20.6k] ------------------ 533| 61.8k| mask |= x[i]; 534| | 535| | // If any bits were set in high part of x, then is_lt should be false 536| 20.6k| is_lt &= CT::Mask::is_zero(mask); 537| 20.6k| } 538| | 539| 2.83M| return is_lt; 540| 2.83M|} _ZN5Botan11bigint_sub3EPmPKmmS2_m: 308| 19.6M|inline word bigint_sub3(word z[], const word x[], size_t x_size, const word y[], size_t y_size) { 309| 19.6M| word borrow = 0; 310| | 311| 19.6M| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 51| 19.6M| do { \ | | 52| 19.6M| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 0, False: 19.6M] | | ------------------ | | 53| 19.6M| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 19.6M| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 312| | 313| 19.6M| const size_t blocks = y_size - (y_size % 8); 314| | 315| 38.4M| for(size_t i = 0; i != blocks; i += 8) ------------------ | Branch (315:22): [True: 18.8M, False: 19.6M] ------------------ 316| 18.8M| borrow = word8_sub3(z + i, x + i, y + i, borrow); 317| | 318| 89.5M| for(size_t i = blocks; i != y_size; ++i) ------------------ | Branch (318:27): [True: 69.9M, False: 19.6M] ------------------ 319| 69.9M| z[i] = word_sub(x[i], y[i], &borrow); 320| | 321| 60.6M| for(size_t i = y_size; i != x_size; ++i) ------------------ | Branch (321:27): [True: 41.0M, False: 19.6M] ------------------ 322| 41.0M| z[i] = word_sub(x[i], 0, &borrow); 323| | 324| 19.6M| return borrow; 325| 19.6M|} _ZN5Botan14bigint_cnd_addEmPmmPKmm: 40| 2.44M|inline word bigint_cnd_add(word cnd, word x[], word x_size, const word y[], size_t y_size) { 41| 2.44M| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 51| 2.44M| do { \ | | 52| 2.44M| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 0, False: 2.44M] | | ------------------ | | 53| 2.44M| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 2.44M| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 42| | 43| 2.44M| const auto mask = CT::Mask::expand(cnd); 44| | 45| 2.44M| word carry = 0; 46| | 47| 2.44M| const size_t blocks = y_size - (y_size % 8); 48| 2.44M| word z[8] = {0}; 49| | 50| 2.69M| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (50:22): [True: 250k, False: 2.44M] ------------------ 51| 250k| carry = word8_add3(z, x + i, y + i, carry); 52| 250k| mask.select_n(x + i, z, x + i, 8); 53| 250k| } 54| | 55| 11.8M| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (55:27): [True: 9.37M, False: 2.44M] ------------------ 56| 9.37M| z[0] = word_add(x[i], y[i], &carry); 57| 9.37M| x[i] = mask.select(z[0], x[i]); 58| 9.37M| } 59| | 60| 4.19M| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (60:27): [True: 1.74M, False: 2.44M] ------------------ 61| 1.74M| z[0] = word_add(x[i], 0, &carry); 62| 1.74M| x[i] = mask.select(z[0], x[i]); 63| 1.74M| } 64| | 65| 2.44M| return mask.if_set_return(carry); 66| 2.44M|} _ZN5Botan15bigint_cnd_swapEmPmS0_m: 29| 5.08M|inline void bigint_cnd_swap(word cnd, word x[], word y[], size_t size) { 30| 5.08M| const auto mask = CT::Mask::expand(cnd); 31| | 32| 186M| for(size_t i = 0; i != size; ++i) { ------------------ | Branch (32:22): [True: 181M, False: 5.08M] ------------------ 33| 181M| const word a = x[i]; 34| 181M| const word b = y[i]; 35| 181M| x[i] = mask.select(b, a); 36| 181M| y[i] = mask.select(a, b); 37| 181M| } 38| 5.08M|} _ZN5Botan14bigint_cnd_addEmPmPKmm: 72| 1.65M|inline word bigint_cnd_add(word cnd, word x[], const word y[], size_t size) { 73| 1.65M| return bigint_cnd_add(cnd, x, size, y, size); 74| 1.65M|} _ZN5Botan14bigint_cnd_subEmPmmPKmm: 80| 1.77M|inline word bigint_cnd_sub(word cnd, word x[], size_t x_size, const word y[], size_t y_size) { 81| 1.77M| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 51| 1.77M| do { \ | | 52| 1.77M| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 0, False: 1.77M] | | ------------------ | | 53| 1.77M| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 1.77M| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 82| | 83| 1.77M| const auto mask = CT::Mask::expand(cnd); 84| | 85| 1.77M| word carry = 0; 86| | 87| 1.77M| const size_t blocks = y_size - (y_size % 8); 88| 1.77M| word z[8] = {0}; 89| | 90| 2.61M| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (90:22): [True: 840k, False: 1.77M] ------------------ 91| 840k| carry = word8_sub3(z, x + i, y + i, carry); 92| 840k| mask.select_n(x + i, z, x + i, 8); 93| 840k| } 94| | 95| 6.31M| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (95:27): [True: 4.53M, False: 1.77M] ------------------ 96| 4.53M| z[0] = word_sub(x[i], y[i], &carry); 97| 4.53M| x[i] = mask.select(z[0], x[i]); 98| 4.53M| } 99| | 100| 1.77M| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (100:27): [True: 0, False: 1.77M] ------------------ 101| 0| z[0] = word_sub(x[i], 0, &carry); 102| 0| x[i] = mask.select(z[0], x[i]); 103| 0| } 104| | 105| 1.77M| return mask.if_set_return(carry); 106| 1.77M|} _ZN5Botan14bigint_cnd_subEmPmPKmm: 112| 1.77M|inline word bigint_cnd_sub(word cnd, word x[], const word y[], size_t size) { 113| 1.77M| return bigint_cnd_sub(cnd, x, size, y, size); 114| 1.77M|} _ZN5Botan21bigint_cnd_add_or_subENS_2CT4MaskImEEPmPKmm: 123| 6.13k|inline void bigint_cnd_add_or_sub(CT::Mask mask, word x[], const word y[], size_t size) { 124| 6.13k| const size_t blocks = size - (size % 8); 125| | 126| 6.13k| word carry = 0; 127| 6.13k| word borrow = 0; 128| | 129| 6.13k| word t0[8] = {0}; 130| 6.13k| word t1[8] = {0}; 131| | 132| 59.3k| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (132:22): [True: 53.2k, False: 6.13k] ------------------ 133| 53.2k| carry = word8_add3(t0, x + i, y + i, carry); 134| 53.2k| borrow = word8_sub3(t1, x + i, y + i, borrow); 135| | 136| 479k| for(size_t j = 0; j != 8; ++j) ------------------ | Branch (136:25): [True: 425k, False: 53.2k] ------------------ 137| 425k| x[i + j] = mask.select(t0[j], t1[j]); 138| 53.2k| } 139| | 140| 9.69k| for(size_t i = blocks; i != size; ++i) { ------------------ | Branch (140:27): [True: 3.56k, False: 6.13k] ------------------ 141| 3.56k| const word a = word_add(x[i], y[i], &carry); 142| 3.56k| const word s = word_sub(x[i], y[i], &borrow); 143| | 144| 3.56k| x[i] = mask.select(a, s); 145| 3.56k| } 146| 6.13k|} _ZN5Botan17bigint_cnd_addsubENS_2CT4MaskImEEPmPKmS5_m: 157| 2.38M|inline word bigint_cnd_addsub(CT::Mask mask, word x[], const word y[], const word z[], size_t size) { 158| 2.38M| const size_t blocks = size - (size % 8); 159| | 160| 2.38M| word carry = 0; 161| 2.38M| word borrow = 0; 162| | 163| 2.38M| word t0[8] = {0}; 164| 2.38M| word t1[8] = {0}; 165| | 166| 2.71M| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (166:22): [True: 326k, False: 2.38M] ------------------ 167| 326k| carry = word8_add3(t0, x + i, y + i, carry); 168| 326k| borrow = word8_sub3(t1, x + i, z + i, borrow); 169| | 170| 2.94M| for(size_t j = 0; j != 8; ++j) ------------------ | Branch (170:25): [True: 2.61M, False: 326k] ------------------ 171| 2.61M| x[i + j] = mask.select(t0[j], t1[j]); 172| 326k| } 173| | 174| 11.0M| for(size_t i = blocks; i != size; ++i) { ------------------ | Branch (174:27): [True: 8.68M, False: 2.38M] ------------------ 175| 8.68M| t0[0] = word_add(x[i], y[i], &carry); 176| 8.68M| t1[0] = word_sub(x[i], z[i], &borrow); 177| 8.68M| x[i] = mask.select(t0[0], t1[0]); 178| 8.68M| } 179| | 180| 2.38M| return mask.select(carry, borrow); 181| 2.38M|} _ZN5Botan14bigint_cnd_absEmPmm: 188| 550k|inline void bigint_cnd_abs(word cnd, word x[], size_t size) { 189| 550k| const auto mask = CT::Mask::expand(cnd); 190| | 191| 550k| word carry = mask.if_set_return(1); 192| 3.14M| for(size_t i = 0; i != size; ++i) { ------------------ | Branch (192:22): [True: 2.59M, False: 550k] ------------------ 193| 2.59M| const word z = word_add(~x[i], 0, &carry); 194| 2.59M| x[i] = mask.select(z, x[i]); 195| 2.59M| } 196| 550k|} _ZN5Botan14bigint_add2_ncEPmmPKmm: 201| 1.33M|inline word bigint_add2_nc(word x[], size_t x_size, const word y[], size_t y_size) { 202| 1.33M| word carry = 0; 203| | 204| 1.33M| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 51| 1.33M| do { \ | | 52| 1.33M| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 0, False: 1.33M] | | ------------------ | | 53| 1.33M| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 1.33M| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 205| | 206| 1.33M| const size_t blocks = y_size - (y_size % 8); 207| | 208| 1.44M| for(size_t i = 0; i != blocks; i += 8) ------------------ | Branch (208:22): [True: 107k, False: 1.33M] ------------------ 209| 107k| carry = word8_add2(x + i, y + i, carry); 210| | 211| 8.19M| for(size_t i = blocks; i != y_size; ++i) ------------------ | Branch (211:27): [True: 6.85M, False: 1.33M] ------------------ 212| 6.85M| x[i] = word_add(x[i], y[i], &carry); 213| | 214| 4.08M| for(size_t i = y_size; i != x_size; ++i) ------------------ | Branch (214:27): [True: 2.75M, False: 1.33M] ------------------ 215| 2.75M| x[i] = word_add(x[i], 0, &carry); 216| | 217| 1.33M| return carry; 218| 1.33M|} _ZN5Botan14bigint_add3_ncEPmPKmmS2_m: 223| 1.09M|inline word bigint_add3_nc(word z[], const word x[], size_t x_size, const word y[], size_t y_size) { 224| 1.09M| if(x_size < y_size) { ------------------ | Branch (224:7): [True: 5.56k, False: 1.08M] ------------------ 225| 5.56k| return bigint_add3_nc(z, y, y_size, x, x_size); 226| 5.56k| } 227| | 228| 1.08M| word carry = 0; 229| | 230| 1.08M| const size_t blocks = y_size - (y_size % 8); 231| | 232| 1.88M| for(size_t i = 0; i != blocks; i += 8) ------------------ | Branch (232:22): [True: 802k, False: 1.08M] ------------------ 233| 802k| carry = word8_add3(z + i, x + i, y + i, carry); 234| | 235| 3.14M| for(size_t i = blocks; i != y_size; ++i) ------------------ | Branch (235:27): [True: 2.06M, False: 1.08M] ------------------ 236| 2.06M| z[i] = word_add(x[i], y[i], &carry); 237| | 238| 1.11M| for(size_t i = y_size; i != x_size; ++i) ------------------ | Branch (238:27): [True: 26.5k, False: 1.08M] ------------------ 239| 26.5k| z[i] = word_add(x[i], 0, &carry); 240| | 241| 1.08M| return carry; 242| 1.09M|} _ZN5Botan11bigint_add2EPmmPKmm: 251| 1.28M|inline void bigint_add2(word x[], size_t x_size, const word y[], size_t y_size) { 252| 1.28M| x[x_size] += bigint_add2_nc(x, x_size, y, y_size); 253| 1.28M|} _ZN5Botan11bigint_add3EPmPKmmS2_m: 258| 251k|inline void bigint_add3(word z[], const word x[], size_t x_size, const word y[], size_t y_size) { 259| 251k| z[x_size > y_size ? x_size : y_size] += bigint_add3_nc(z, x, x_size, y, y_size); ------------------ | Branch (259:6): [True: 5.54k, False: 245k] ------------------ 260| 251k|} _ZN5Botan11bigint_sub2EPmmPKmm: 265| 619k|inline word bigint_sub2(word x[], size_t x_size, const word y[], size_t y_size) { 266| 619k| word borrow = 0; 267| | 268| 619k| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 51| 619k| do { \ | | 52| 619k| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 0, False: 619k] | | ------------------ | | 53| 619k| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 619k| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 269| | 270| 619k| const size_t blocks = y_size - (y_size % 8); 271| | 272| 713k| for(size_t i = 0; i != blocks; i += 8) ------------------ | Branch (272:22): [True: 93.8k, False: 619k] ------------------ 273| 93.8k| borrow = word8_sub2(x + i, y + i, borrow); 274| | 275| 3.55M| for(size_t i = blocks; i != y_size; ++i) ------------------ | Branch (275:27): [True: 2.93M, False: 619k] ------------------ 276| 2.93M| x[i] = word_sub(x[i], y[i], &borrow); 277| | 278| 1.35M| for(size_t i = y_size; i != x_size; ++i) ------------------ | Branch (278:27): [True: 736k, False: 619k] ------------------ 279| 736k| x[i] = word_sub(x[i], 0, &borrow); 280| | 281| 619k| return borrow; 282| 619k|} _ZN5Botan15bigint_sub2_revEPmPKmm: 287| 10.3k|inline void bigint_sub2_rev(word x[], const word y[], size_t y_size) { 288| 10.3k| word borrow = 0; 289| | 290| 10.3k| const size_t blocks = y_size - (y_size % 8); 291| | 292| 10.6k| for(size_t i = 0; i != blocks; i += 8) ------------------ | Branch (292:22): [True: 381, False: 10.3k] ------------------ 293| 381| borrow = word8_sub2_rev(x + i, y + i, borrow); 294| | 295| 65.0k| for(size_t i = blocks; i != y_size; ++i) ------------------ | Branch (295:27): [True: 54.7k, False: 10.3k] ------------------ 296| 54.7k| x[i] = word_sub(y[i], x[i], &borrow); 297| | 298| 10.3k| BOTAN_ASSERT(borrow == 0, "y must be greater than x"); ------------------ | | 51| 10.3k| do { \ | | 52| 10.3k| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 0, False: 10.3k] | | ------------------ | | 53| 10.3k| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 10.3k| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 299| 10.3k|} _ZN5Botan14bigint_sub_absEPmPKmS2_mS0_: 339| 21.4k|inline CT::Mask 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| 21.4k| word* ws0 = ws; 343| 21.4k| word* ws1 = ws + N; 344| | 345| 21.4k| word borrow0 = 0; 346| 21.4k| word borrow1 = 0; 347| | 348| 21.4k| const size_t blocks = N - (N % 8); 349| | 350| 81.9k| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (350:22): [True: 60.5k, False: 21.4k] ------------------ 351| 60.5k| borrow0 = word8_sub3(ws0 + i, x + i, y + i, borrow0); 352| 60.5k| borrow1 = word8_sub3(ws1 + i, y + i, x + i, borrow1); 353| 60.5k| } 354| | 355| 32.8k| for(size_t i = blocks; i != N; ++i) { ------------------ | Branch (355:27): [True: 11.4k, False: 21.4k] ------------------ 356| 11.4k| ws0[i] = word_sub(x[i], y[i], &borrow0); 357| 11.4k| ws1[i] = word_sub(y[i], x[i], &borrow1); 358| 11.4k| } 359| | 360| 21.4k| return CT::conditional_copy_mem(borrow0, z, ws1, ws0, N); 361| 21.4k|} _ZN5Botan11bigint_shl1EPmmmmm: 366| 150k|inline void bigint_shl1(word x[], size_t x_size, size_t x_words, size_t word_shift, size_t bit_shift) { 367| 150k| copy_mem(x + word_shift, x, x_words); 368| 150k| clear_mem(x, word_shift); 369| | 370| 150k| const auto carry_mask = CT::Mask::expand(bit_shift); 371| 150k| const size_t carry_shift = carry_mask.if_set_return(BOTAN_MP_WORD_BITS - bit_shift); ------------------ | | 50| 150k|#define BOTAN_MP_WORD_BITS 64 ------------------ 372| | 373| 150k| word carry = 0; 374| 791k| for(size_t i = word_shift; i != x_size; ++i) { ------------------ | Branch (374:31): [True: 641k, False: 150k] ------------------ 375| 641k| const word w = x[i]; 376| 641k| x[i] = (w << bit_shift) | carry; 377| 641k| carry = carry_mask.if_set_return(w >> carry_shift); 378| 641k| } 379| 150k|} _ZN5Botan11bigint_shr1EPmmmm: 381| 4.05M|inline void bigint_shr1(word x[], size_t x_size, size_t word_shift, size_t bit_shift) { 382| 4.05M| const size_t top = x_size >= word_shift ? (x_size - word_shift) : 0; ------------------ | Branch (382:23): [True: 4.04M, False: 9.78k] ------------------ 383| | 384| 4.05M| if(top > 0) ------------------ | Branch (384:7): [True: 4.04M, False: 11.5k] ------------------ 385| 4.04M| copy_mem(x, x + word_shift, top); 386| 4.05M| clear_mem(x + top, std::min(word_shift, x_size)); 387| | 388| 4.05M| const auto carry_mask = CT::Mask::expand(bit_shift); 389| 4.05M| const size_t carry_shift = carry_mask.if_set_return(BOTAN_MP_WORD_BITS - bit_shift); ------------------ | | 50| 4.05M|#define BOTAN_MP_WORD_BITS 64 ------------------ 390| | 391| 4.05M| word carry = 0; 392| | 393| 31.0M| for(size_t i = 0; i != top; ++i) { ------------------ | Branch (393:22): [True: 27.0M, False: 4.05M] ------------------ 394| 27.0M| const word w = x[top - i - 1]; 395| 27.0M| x[top - i - 1] = (w >> bit_shift) | carry; 396| 27.0M| carry = carry_mask.if_set_return(w << carry_shift); 397| 27.0M| } 398| 4.05M|} _ZN5Botan11bigint_shl2EPmPKmmmm: 400| 75.5k|inline void bigint_shl2(word y[], const word x[], size_t x_size, size_t word_shift, size_t bit_shift) { 401| 75.5k| copy_mem(y + word_shift, x, x_size); 402| | 403| 75.5k| const auto carry_mask = CT::Mask::expand(bit_shift); 404| 75.5k| const size_t carry_shift = carry_mask.if_set_return(BOTAN_MP_WORD_BITS - bit_shift); ------------------ | | 50| 75.5k|#define BOTAN_MP_WORD_BITS 64 ------------------ 405| | 406| 75.5k| word carry = 0; 407| 429k| for(size_t i = word_shift; i != x_size + word_shift + 1; ++i) { ------------------ | Branch (407:31): [True: 354k, False: 75.5k] ------------------ 408| 354k| const word w = y[i]; 409| 354k| y[i] = (w << bit_shift) | carry; 410| 354k| carry = carry_mask.if_set_return(w >> carry_shift); 411| 354k| } 412| 75.5k|} _ZN5Botan11bigint_shr2EPmPKmmmm: 414| 675k|inline void bigint_shr2(word y[], const word x[], size_t x_size, size_t word_shift, size_t bit_shift) { 415| 675k| const size_t new_size = x_size < word_shift ? 0 : (x_size - word_shift); ------------------ | Branch (415:28): [True: 2, False: 675k] ------------------ 416| | 417| 675k| if(new_size > 0) ------------------ | Branch (417:7): [True: 675k, False: 103] ------------------ 418| 675k| copy_mem(y, x + word_shift, new_size); 419| | 420| 675k| const auto carry_mask = CT::Mask::expand(bit_shift); 421| 675k| const size_t carry_shift = carry_mask.if_set_return(BOTAN_MP_WORD_BITS - bit_shift); ------------------ | | 50| 675k|#define BOTAN_MP_WORD_BITS 64 ------------------ 422| | 423| 675k| word carry = 0; 424| 7.41M| for(size_t i = new_size; i > 0; --i) { ------------------ | Branch (424:29): [True: 6.74M, False: 675k] ------------------ 425| 6.74M| word w = y[i - 1]; 426| 6.74M| y[i - 1] = (w >> bit_shift) | carry; 427| 6.74M| carry = carry_mask.if_set_return(w << carry_shift); 428| 6.74M| } 429| 675k|} _ZN5Botan14bigint_linmul2EPmmm: 434| 4.18M|[[nodiscard]] inline word bigint_linmul2(word x[], size_t x_size, word y) { 435| 4.18M| const size_t blocks = x_size - (x_size % 8); 436| | 437| 4.18M| word carry = 0; 438| | 439| 26.4M| for(size_t i = 0; i != blocks; i += 8) ------------------ | Branch (439:22): [True: 22.2M, False: 4.18M] ------------------ 440| 22.2M| carry = word8_linmul2(x + i, y, carry); 441| | 442| 5.46M| for(size_t i = blocks; i != x_size; ++i) ------------------ | Branch (442:27): [True: 1.28M, False: 4.18M] ------------------ 443| 1.28M| x[i] = word_madd2(x[i], y, &carry); 444| | 445| 4.18M| return carry; 446| 4.18M|} _ZN5Botan14bigint_linmul3EPmPKmmm: 448| 998k|inline void bigint_linmul3(word z[], const word x[], size_t x_size, word y) { 449| 998k| const size_t blocks = x_size - (x_size % 8); 450| | 451| 998k| word carry = 0; 452| | 453| 1.04M| for(size_t i = 0; i != blocks; i += 8) ------------------ | Branch (453:22): [True: 46.7k, False: 998k] ------------------ 454| 46.7k| carry = word8_linmul3(z + i, x + i, y, carry); 455| | 456| 4.94M| for(size_t i = blocks; i != x_size; ++i) ------------------ | Branch (456:27): [True: 3.94M, False: 998k] ------------------ 457| 3.94M| z[i] = word_madd2(x[i], y, &carry); 458| | 459| 998k| z[x_size] = carry; 460| 998k|} _ZN5Botan14bigint_sub_absEPmPKmmS2_m: 576| 2.48M|inline int32_t bigint_sub_abs(word z[], const word x[], size_t x_size, const word y[], size_t y_size) { 577| 2.48M| const int32_t relative_size = bigint_cmp(x, x_size, y, y_size); 578| | 579| | // Swap if relative_size == -1 580| 2.48M| const bool need_swap = relative_size < 0; 581| 2.48M| CT::conditional_swap_ptr(need_swap, x, y); 582| 2.48M| 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| 2.48M| y_size = std::min(x_size, y_size); 590| | 591| 2.48M| bigint_sub3(z, x, x_size, y, y_size); 592| | 593| 2.48M| return relative_size; 594| 2.48M|} _ZN5Botan14bigint_mod_subEPmPKmS2_mS0_: 605| 467k|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| 467k| const auto is_lt = bigint_ct_is_lt(t, mod_sw, s, mod_sw); 608| | 609| | // ws = p - s 610| 467k| 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| 467k| const word carry = bigint_cnd_addsub(is_lt, t, ws, s, mod_sw); 614| | 615| 467k| BOTAN_DEBUG_ASSERT(borrow == 0 && carry == 0); ------------------ | | 99| 467k| do { \ | | 100| 467k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 616| 467k| BOTAN_UNUSED(carry, borrow); ------------------ | | 118| 467k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 617| 467k|} _ZN5Botan12bigint_divopEmmm: 637| 89.8k|inline word bigint_divop(word n1, word n0, word d) { 638| 89.8k| if(d == 0) ------------------ | Branch (638:7): [True: 0, False: 89.8k] ------------------ 639| 0| throw Invalid_Argument("bigint_divop divide by zero"); 640| | 641| 89.8k|#if defined(BOTAN_MP_DWORD) 642| 89.8k| return static_cast(((static_cast(n1) << BOTAN_MP_WORD_BITS) | n0) / d); ------------------ | | 50| 89.8k|#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| 89.8k|} _ZN5Botan12bigint_modopEmmm: 668| 55.1k|inline word bigint_modop(word n1, word n0, word d) { 669| 55.1k| if(d == 0) ------------------ | Branch (669:7): [True: 0, False: 55.1k] ------------------ 670| 0| throw Invalid_Argument("bigint_modop divide by zero"); 671| | 672| 55.1k|#if defined(BOTAN_MP_DWORD) 673| 55.1k| return ((static_cast(n1) << BOTAN_MP_WORD_BITS) | n0) % d; ------------------ | | 50| 55.1k|#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| 55.1k|} _ZN5Botan17bigint_monty_redcEPmPKmmmS0_m: 727| 6.38M|inline void bigint_monty_redc(word z[], const word p[], size_t p_size, word p_dash, word ws[], size_t ws_size) { 728| 6.38M| const size_t z_size = 2 * p_size; 729| | 730| 6.38M| BOTAN_ARG_CHECK(ws_size >= p_size + 1, "Montgomery workspace too small"); ------------------ | | 30| 6.38M| do { \ | | 31| 6.38M| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 0, False: 6.38M] | | ------------------ | | 32| 6.38M| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 6.38M| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 731| | 732| 6.38M| if(p_size == 4) ------------------ | Branch (732:7): [True: 5.80M, False: 582k] ------------------ 733| 5.80M| bigint_monty_redc_4(z, p, p_dash, ws); 734| 582k| else if(p_size == 6) ------------------ | Branch (734:12): [True: 103k, False: 478k] ------------------ 735| 103k| bigint_monty_redc_6(z, p, p_dash, ws); 736| 478k| else if(p_size == 8) ------------------ | Branch (736:12): [True: 31.4k, False: 447k] ------------------ 737| 31.4k| bigint_monty_redc_8(z, p, p_dash, ws); 738| 447k| else if(p_size == 16) ------------------ | Branch (738:12): [True: 1.27k, False: 445k] ------------------ 739| 1.27k| bigint_monty_redc_16(z, p, p_dash, ws); 740| 445k| else if(p_size == 24) ------------------ | Branch (740:12): [True: 861, False: 445k] ------------------ 741| 861| bigint_monty_redc_24(z, p, p_dash, ws); 742| 445k| else if(p_size == 32) ------------------ | Branch (742:12): [True: 3.27k, False: 441k] ------------------ 743| 3.27k| bigint_monty_redc_32(z, p, p_dash, ws); 744| 441k| else 745| 441k| bigint_monty_redc_generic(z, z_size, p, p_size, p_dash, ws); 746| 6.38M|} _ZN5Botan16bigint_mod_sub_nILm4EEEvPmPKmS3_S1_: 620| 1.78M|inline void bigint_mod_sub_n(word t[], const word s[], const word mod[], word ws[]) { 621| | // is t < s or not? 622| 1.78M| const auto is_lt = bigint_ct_is_lt(t, N, s, N); 623| | 624| | // ws = p - s 625| 1.78M| const word borrow = bigint_sub3(ws, mod, N, s, N); 626| | 627| | // Compute either (t - s) or (t + (p - s)) depending on mask 628| 1.78M| const word carry = bigint_cnd_addsub(is_lt, t, ws, s, N); 629| | 630| 1.78M| BOTAN_DEBUG_ASSERT(borrow == 0 && carry == 0); ------------------ | | 99| 1.78M| do { \ | | 100| 1.78M| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 631| 1.78M| BOTAN_UNUSED(carry, borrow); ------------------ | | 118| 1.78M|#define BOTAN_UNUSED Botan::ignore_params ------------------ 632| 1.78M|} _ZN5Botan16bigint_mod_sub_nILm6EEEvPmPKmS3_S1_: 620| 130k|inline void bigint_mod_sub_n(word t[], const word s[], const word mod[], word ws[]) { 621| | // is t < s or not? 622| 130k| const auto is_lt = bigint_ct_is_lt(t, N, s, N); 623| | 624| | // ws = p - s 625| 130k| const word borrow = bigint_sub3(ws, mod, N, s, N); 626| | 627| | // Compute either (t - s) or (t + (p - s)) depending on mask 628| 130k| const word carry = bigint_cnd_addsub(is_lt, t, ws, s, N); 629| | 630| 130k| BOTAN_DEBUG_ASSERT(borrow == 0 && carry == 0); ------------------ | | 99| 130k| do { \ | | 100| 130k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 631| 130k| BOTAN_UNUSED(carry, borrow); ------------------ | | 118| 130k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 632| 130k|} _ZN5Botan6PK_Ops12VerificationD2Ev: 83| 1.26k| virtual ~Verification() = default; _ZN5Botan6PK_Ops22Verification_with_HashD2Ev: 54| 536| ~Verification_with_Hash() = default; _ZNK5Botan10PSS_Params10hash_algidEv: 27| 94| const AlgorithmIdentifier& hash_algid() const { return m_hash; } _ZNK5Botan10PSS_Params9mgf_algidEv: 29| 47| const AlgorithmIdentifier& mgf_algid() const { return m_mgf; } _ZNK5Botan10PSS_Params14mgf_hash_algidEv: 31| 45| const AlgorithmIdentifier& mgf_hash_algid() const { return m_mgf_hash; } _ZNK5Botan10PSS_Params11salt_lengthEv: 33| 42| size_t salt_length() const { return m_salt_len; } _ZNK5Botan10PSS_Params13trailer_fieldEv: 35| 43| size_t trailer_field() const { return m_trailer_field; } _ZNK5Botan10PSS_Params13hash_functionEv: 37| 49| std::string hash_function() const { return hash_algid().oid().to_formatted_string(); } _ZNK5Botan10PSS_Params12mgf_functionEv: 39| 47| std::string mgf_function() const { return mgf_algid().oid().to_formatted_string(); } _ZN5Botan10PSS_ParamsC2INSt3__19allocatorIhEEEERKNS2_6vectorIhT_EE: 25| 58| PSS_Params(const std::vector& vec) : PSS_Params(vec.data(), vec.size()) {} _ZN5Botan4rotlILm7EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm11EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm5EjEET0_S1_: 23| 2.67M|{ 24| 2.67M| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.67M|} _ZN5Botan4rotlILm9EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm15EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm12EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm17EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm22EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm14EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm20EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm4EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm16EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm23EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm6EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm10EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm21EjEET0_S1_: 23| 2.11k|{ 24| 2.11k| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.11k|} _ZN5Botan4rotlILm30EjEET0_S1_: 23| 2.67M|{ 24| 2.67M| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 25| 2.67M|} _ZN5Botan3rhoILm2ELm13ELm22EjEET2_S1_: 51| 2.06M|inline constexpr T rho(T x) { 52| 2.06M| return rotr(x) ^ rotr(x) ^ rotr(x); 53| 2.06M|} _ZN5Botan4rotrILm2EjEET0_S1_: 35| 2.06M|{ 36| 2.06M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 2.06M|} _ZN5Botan4rotrILm13EjEET0_S1_: 35| 2.06M|{ 36| 2.06M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 2.06M|} _ZN5Botan4rotrILm22EjEET0_S1_: 35| 2.06M|{ 36| 2.06M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 2.06M|} _ZN5Botan3rhoILm6ELm11ELm25EjEET2_S1_: 51| 2.06M|inline constexpr T rho(T x) { 52| 2.06M| return rotr(x) ^ rotr(x) ^ rotr(x); 53| 2.06M|} _ZN5Botan4rotrILm6EjEET0_S1_: 35| 2.06M|{ 36| 2.06M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 2.06M|} _ZN5Botan4rotrILm11EjEET0_S1_: 35| 2.06M|{ 36| 2.06M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 2.06M|} _ZN5Botan4rotrILm25EjEET0_S1_: 35| 2.06M|{ 36| 2.06M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 2.06M|} _ZN5Botan5sigmaILm17ELm19ELm10EjEET2_S1_: 43| 2.06M|inline constexpr T sigma(T x) { 44| 2.06M| return rotr(x) ^ rotr(x) ^ (x >> S); 45| 2.06M|} _ZN5Botan4rotrILm17EjEET0_S1_: 35| 2.06M|{ 36| 2.06M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 2.06M|} _ZN5Botan4rotrILm19EjEET0_S1_: 35| 2.06M|{ 36| 2.06M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 2.06M|} _ZN5Botan5sigmaILm7ELm18ELm3EjEET2_S1_: 43| 2.06M|inline constexpr T sigma(T x) { 44| 2.06M| return rotr(x) ^ rotr(x) ^ (x >> S); 45| 2.06M|} _ZN5Botan4rotrILm7EjEET0_S1_: 35| 2.06M|{ 36| 2.06M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 2.06M|} _ZN5Botan4rotrILm18EjEET0_S1_: 35| 2.06M|{ 36| 2.06M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 2.06M|} _ZN5Botan3rhoILm14ELm18ELm41EmEET2_S1_: 51| 93.6k|inline constexpr T rho(T x) { 52| 93.6k| return rotr(x) ^ rotr(x) ^ rotr(x); 53| 93.6k|} _ZN5Botan4rotrILm14EmEET0_S1_: 35| 93.6k|{ 36| 93.6k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 93.6k|} _ZN5Botan4rotrILm18EmEET0_S1_: 35| 93.6k|{ 36| 93.6k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 93.6k|} _ZN5Botan4rotrILm41EmEET0_S1_: 35| 93.6k|{ 36| 93.6k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 93.6k|} _ZN5Botan3rhoILm28ELm34ELm39EmEET2_S1_: 51| 93.6k|inline constexpr T rho(T x) { 52| 93.6k| return rotr(x) ^ rotr(x) ^ rotr(x); 53| 93.6k|} _ZN5Botan4rotrILm28EmEET0_S1_: 35| 93.6k|{ 36| 93.6k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 93.6k|} _ZN5Botan4rotrILm34EmEET0_S1_: 35| 93.6k|{ 36| 93.6k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 93.6k|} _ZN5Botan4rotrILm39EmEET0_S1_: 35| 93.6k|{ 36| 93.6k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 93.6k|} _ZN5Botan5sigmaILm19ELm61ELm6EmEET2_S1_: 43| 93.6k|inline constexpr T sigma(T x) { 44| 93.6k| return rotr(x) ^ rotr(x) ^ (x >> S); 45| 93.6k|} _ZN5Botan4rotrILm19EmEET0_S1_: 35| 93.6k|{ 36| 93.6k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 93.6k|} _ZN5Botan4rotrILm61EmEET0_S1_: 35| 93.6k|{ 36| 93.6k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 93.6k|} _ZN5Botan5sigmaILm1ELm8ELm7EmEET2_S1_: 43| 93.6k|inline constexpr T sigma(T x) { 44| 93.6k| return rotr(x) ^ rotr(x) ^ (x >> S); 45| 93.6k|} _ZN5Botan4rotrILm1EmEET0_S1_: 35| 93.6k|{ 36| 93.6k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 93.6k|} _ZN5Botan4rotrILm8EmEET0_S1_: 35| 93.6k|{ 36| 93.6k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 37| 93.6k|} _ZN5Botan8round_upEmm: 21| 28.6k|inline size_t round_up(size_t n, size_t align_to) { 22| 28.6k| BOTAN_ARG_CHECK(align_to != 0, "align_to must not be 0"); ------------------ | | 30| 28.6k| do { \ | | 31| 28.6k| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 0, False: 28.6k] | | ------------------ | | 32| 28.6k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 28.6k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 23| | 24| 28.6k| if(n % align_to) ------------------ | Branch (24:7): [True: 23.6k, False: 4.97k] ------------------ 25| 23.6k| n += align_to - (n % align_to); 26| 28.6k| return n; 27| 28.6k|} _ZN5Botan11checked_mulEmm: 47| 11.1M|inline std::optional checked_mul(size_t x, size_t y) { 48| 11.1M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_add_overflow) 49| 11.1M| size_t z; 50| 11.1M| if(__builtin_mul_overflow(x, y, &z)) [[unlikely]] ------------------ | Branch (50:7): [True: 0, False: 11.1M] ------------------ 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| 11.1M| return z; 62| 11.1M|} _ZN5Botan11checked_addEmmPKci: 30| 110k|inline size_t checked_add(size_t x, size_t y, const char* file, int line) { 31| 110k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_add_overflow) 32| 110k| size_t z; 33| 110k| if(__builtin_add_overflow(x, y, &z)) [[unlikely]] ------------------ | Branch (33:7): [True: 0, False: 110k] ------------------ 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| 110k| return z; 45| 110k|} _ZNK5Botan9SCAN_Name9algo_nameEv: 44| 1.96k| const std::string algo_name() const { return m_alg_name; } _ZNK5Botan9SCAN_Name9arg_countEv: 49| 1.74k| size_t arg_count() const { return m_args.size(); } _ZNK5Botan9SCAN_Name17arg_count_betweenEmm: 56| 42| bool arg_count_between(size_t lower, size_t upper) const { 57| 42| return ((arg_count() >= lower) && (arg_count() <= upper)); ------------------ | Branch (57:18): [True: 42, False: 0] | Branch (57:44): [True: 42, False: 0] ------------------ 58| 42| } _ZN5Botan5SHA_1C2Ev: 32| 5.95k| SHA_1() : MDx_HashFunction(64, true, true), m_digest(5) { clear(); } _ZNK5Botan5SHA_14nameEv: 20| 157| std::string name() const override { return "SHA-1"; } _ZNK5Botan5SHA_113output_lengthEv: 22| 18.0k| size_t output_length() const override { return 20; } _ZN5Botan7SHA_224C2Ev: 33| 67| SHA_224() : MDx_HashFunction(64, true, true), m_digest(8) { clear(); } _ZN5Botan7SHA_256C2Ev: 59| 5.86k| SHA_256() : MDx_HashFunction(64, true, true), m_digest(8) { clear(); } _ZNK5Botan7SHA_2244nameEv: 21| 50| std::string name() const override { return "SHA-224"; } _ZNK5Botan7SHA_22413output_lengthEv: 23| 248| size_t output_length() const override { return 28; } _ZNK5Botan7SHA_2564nameEv: 47| 11| std::string name() const override { return "SHA-256"; } _ZNK5Botan7SHA_25613output_lengthEv: 49| 26.5k| size_t output_length() const override { return 32; } _ZN5Botan9SHA2_32_FEjjjRjjjjS0_S0_jjjj: 31| 2.06M| uint32_t magic) { 32| 2.06M| uint32_t A_rho = rho<2, 13, 22>(A); 33| 2.06M| uint32_t E_rho = rho<6, 11, 25>(E); 34| 2.06M| uint32_t M2_sigma = sigma<17, 19, 10>(M2); 35| 2.06M| uint32_t M4_sigma = sigma<7, 18, 3>(M4); 36| 2.06M| H += magic + E_rho + choose(E, F, G) + M1; 37| 2.06M| D += H; 38| 2.06M| H += A_rho + majority(A, B, C); 39| 2.06M| M1 += M2_sigma + M3 + M4_sigma; 40| 2.06M|} _ZN5Botan7SHA_384C2Ev: 31| 388| SHA_384() : MDx_HashFunction(128, true, true, 16), m_digest(8) { clear(); } _ZN5Botan7SHA_512C2Ev: 61| 40| SHA_512() : MDx_HashFunction(128, true, true, 16), m_digest(8) { clear(); } _ZN5Botan11SHA_512_256C2Ev: 92| 17| SHA_512_256() : MDx_HashFunction(128, true, true, 16), m_digest(8) { clear(); } _ZNK5Botan7SHA_3844nameEv: 20| 8| std::string name() const override { return "SHA-384"; } _ZNK5Botan7SHA_38413output_lengthEv: 22| 1.40k| size_t output_length() const override { return 48; } _ZNK5Botan7SHA_5124nameEv: 45| 2| std::string name() const override { return "SHA-512"; } _ZNK5Botan7SHA_51213output_lengthEv: 47| 122| size_t output_length() const override { return 64; } _ZNK5Botan11SHA_512_2564nameEv: 81| 17| std::string name() const override { return "SHA-512-256"; } _ZNK5Botan11SHA_512_25613output_lengthEv: 83| 67| size_t output_length() const override { return 32; } _ZN5Botan9SHA2_64_FEmmmRmmmmS0_S0_mmmm: 31| 93.6k| uint64_t magic) { 32| 93.6k| const uint64_t E_rho = rho<14, 18, 41>(E); 33| 93.6k| const uint64_t A_rho = rho<28, 34, 39>(A); 34| 93.6k| const uint64_t M2_sigma = sigma<19, 61, 6>(M2); 35| 93.6k| const uint64_t M4_sigma = sigma<1, 8, 7>(M4); 36| 93.6k| H += magic + E_rho + choose(E, F, G) + M1; 37| 93.6k| D += H; 38| 93.6k| H += A_rho + majority(A, B, C); 39| 93.6k| M1 += M2_sigma + M3 + M4_sigma; 40| 93.6k|} _ZN5Botan9SIMD_4x325splatEj: 129| 45.3k| static SIMD_4x32 splat(uint32_t B) noexcept { 130| 45.3k|#if defined(BOTAN_SIMD_USE_SSE2) 131| 45.3k| 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| 45.3k| } _ZN5Botan9SIMD_4x32C2EDv2_x: 605| 3.52M| explicit SIMD_4x32(native_simd_type x) noexcept : m_simd(x) {} _ZN5Botan9SIMD_4x327load_beEPKv: 172| 133k| static SIMD_4x32 load_be(const void* in) noexcept { 173| 133k|#if defined(BOTAN_SIMD_USE_SSE2) 174| 133k| 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(in), 4); 179| | return SIMD_4x32(R); 180| | 181| |#elif defined(BOTAN_SIMD_USE_NEON) 182| | SIMD_4x32 l(vld1q_u32(static_cast(in))); 183| | return CPUID::is_little_endian() ? l.bswap() : l; 184| |#endif 185| 133k| } _ZN5Botan9SIMD_4x327load_leEPKv: 156| 133k| static SIMD_4x32 load_le(const void* in) noexcept { 157| 133k|#if defined(BOTAN_SIMD_USE_SSE2) 158| 133k| return SIMD_4x32(_mm_loadu_si128(reinterpret_cast(in))); 159| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 160| | uint32_t R[4]; 161| | Botan::load_le(R, static_cast(in), 4); 162| | return SIMD_4x32(R); 163| |#elif defined(BOTAN_SIMD_USE_NEON) 164| | SIMD_4x32 l(vld1q_u32(static_cast(in))); 165| | return CPUID::is_big_endian() ? l.bswap() : l; 166| |#endif 167| 133k| } _ZNK5Botan9SIMD_4x325bswapEv: 474| 133k| SIMD_4x32 bswap() const noexcept { 475| 133k|#if defined(BOTAN_SIMD_USE_SSE2) 476| | 477| 133k| __m128i T = m_simd; 478| 133k| T = _mm_shufflehi_epi16(T, _MM_SHUFFLE(2, 3, 0, 1)); 479| 133k| T = _mm_shufflelo_epi16(T, _MM_SHUFFLE(2, 3, 0, 1)); 480| 133k| 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| 133k| } _ZNK5Botan9SIMD_4x32plERKS0_: 321| 669k| SIMD_4x32 operator+(const SIMD_4x32& other) const noexcept { 322| 669k| SIMD_4x32 retval(*this); 323| 669k| retval += other; 324| 669k| return retval; 325| 669k| } _ZN5Botan9SIMD_4x32pLERKS0_: 363| 669k| void operator+=(const SIMD_4x32& other) noexcept { 364| 669k|#if defined(BOTAN_SIMD_USE_SSE2) 365| 669k| 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| 669k| } _ZNK5Botan9SIMD_4x328store_leEPj: 187| 669k| void store_le(uint32_t out[4]) const noexcept { this->store_le(reinterpret_cast(out)); } _ZNK5Botan9SIMD_4x328store_leEPh: 196| 669k| void store_le(uint8_t out[]) const noexcept { 197| 669k|#if defined(BOTAN_SIMD_USE_SSE2) 198| | 199| 669k| _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| 669k| } _ZNK5Botan9SIMD_4x323rawEv: 603| 3.34M| native_simd_type raw() const noexcept { return m_simd; } _ZNK5Botan9SIMD_4x3217shift_elems_rightILm1EEES0_v: 522| 535k| { 523| 535k|#if defined(BOTAN_SIMD_USE_SSE2) 524| 535k| 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| 535k| } _ZN5Botan9SIMD_4x32eOERKS0_: 383| 2.14M| void operator^=(const SIMD_4x32& other) noexcept { 384| 2.14M|#if defined(BOTAN_SIMD_USE_SSE2) 385| 2.14M| 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| 2.14M| } _ZNK5Botan9SIMD_4x3216shift_elems_leftILm3EEES0_v: 501| 535k| { 502| 535k|#if defined(BOTAN_SIMD_USE_SSE2) 503| 535k| 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| 535k| } _ZNK5Botan9SIMD_4x324rotlILm1EEES0_v: 281| 535k| { 282| 535k|#if defined(BOTAN_SIMD_USE_SSE2) 283| | 284| 535k| return SIMD_4x32(_mm_or_si128(_mm_slli_epi32(m_simd, static_cast(ROT)), 285| 535k| _mm_srli_epi32(m_simd, static_cast(32 - ROT)))); 286| | 287| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 288| | 289| | const unsigned int r = static_cast(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(ROT)), vshrq_n_u32(m_simd, static_cast(32 - ROT)))); 307| |#endif 308| 535k| } _ZNK5Botan9SIMD_4x324rotlILm2EEES0_v: 281| 535k| { 282| 535k|#if defined(BOTAN_SIMD_USE_SSE2) 283| | 284| 535k| return SIMD_4x32(_mm_or_si128(_mm_slli_epi32(m_simd, static_cast(ROT)), 285| 535k| _mm_srli_epi32(m_simd, static_cast(32 - ROT)))); 286| | 287| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 288| | 289| | const unsigned int r = static_cast(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(ROT)), vshrq_n_u32(m_simd, static_cast(32 - ROT)))); 307| |#endif 308| 535k| } _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_3OIDENS_11ASN1_StringEEEvRNSt3__18multimapIT_T0_NS3_4lessIS5_EENS3_9allocatorINS3_4pairIKS5_S6_EEEEEERSB_RKS6_: 81| 2.20k|void multimap_insert(std::multimap& multimap, const K& key, const V& value) { 82| 2.20k| multimap.insert(std::make_pair(key, value)); 83| 2.20k|} _ZN5Botan15multimap_insertINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEES7_EEvRNS1_8multimapIT_T0_NS1_4lessIS9_EENS5_INS1_4pairIKS9_SA_EEEEEERSE_RKSA_: 81| 609|void multimap_insert(std::multimap& multimap, const K& key, const V& value) { 82| 609| multimap.insert(std::make_pair(key, value)); 83| 609|} _ZN5Botan15multimap_insertINS_3OIDENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEEEvRNS2_8multimapIT_T0_NS2_4lessISA_EENS6_INS2_4pairIKSA_SB_EEEEEERSF_RKSB_: 81| 5.74k|void multimap_insert(std::multimap& multimap, const K& key, const V& value) { 82| 5.74k| multimap.insert(std::make_pair(key, value)); 83| 5.74k|} _ZNK5Botan8Streebog13output_lengthEv: 21| 222| size_t output_length() const override { return m_output_bits / 8; } _ZN5Botan21Allocator_InitializerC2Ev: 44| 1| Allocator_Initializer() { initialize_allocator(); } _ZN5Botan13typecast_copyImEEvPT_PKhm: 140| 72.9k|{ 141| 72.9k| std::memcpy(out, in, sizeof(T) * N); 142| 72.9k|} _ZN5Botan13typecast_copyImEEvPhPT_m: 133| 38.0k|{ 134| 38.0k| std::memcpy(out, in, sizeof(T) * N); 135| 38.0k|} _ZN5Botan21constant_time_compareEPKhS1_m: 80| 10|inline bool constant_time_compare(const uint8_t x[], const uint8_t y[], size_t len) { 81| 10| return ct_compare_u8(x, y, len) == 0xFF; 82| 10|} _ZN5Botan11clear_bytesEPvm: 92| 31.1M|inline constexpr void clear_bytes(void* ptr, size_t bytes) { 93| 31.1M| if(bytes > 0) { ------------------ | Branch (93:7): [True: 29.4M, False: 1.75M] ------------------ 94| 29.4M| std::memset(ptr, 0, bytes); 95| 29.4M| } 96| 31.1M|} _ZN5Botan7set_memEPhmh: 171| 310|inline constexpr void set_mem(uint8_t* ptr, size_t n, uint8_t val) { 172| 310| if(n > 0) { ------------------ | Branch (172:7): [True: 310, False: 0] ------------------ 173| 310| std::memset(ptr, val, n); 174| 310| } 175| 310|} _ZN5Botan22cast_char_ptr_to_uint8EPKc: 177| 895|inline const uint8_t* cast_char_ptr_to_uint8(const char* s) { return reinterpret_cast(s); } _ZN5Botan22cast_uint8_ptr_to_charEPKh: 179| 34.3k|inline const char* cast_uint8_ptr_to_char(const uint8_t* b) { return reinterpret_cast(b); } _ZN5Botan7xor_bufEPhPKhm: 228| 228|inline void xor_buf(uint8_t out[], const uint8_t in[], size_t length) { 229| 228| const size_t blocks = length - (length % 32); 230| | 231| 410| for(size_t i = 0; i != blocks; i += 32) { ------------------ | Branch (231:22): [True: 182, False: 228] ------------------ 232| 182| uint64_t x[4]; 233| 182| uint64_t y[4]; 234| | 235| 182| typecast_copy(x, out + i, 4); 236| 182| typecast_copy(y, in + i, 4); 237| | 238| 182| x[0] ^= y[0]; 239| 182| x[1] ^= y[1]; 240| 182| x[2] ^= y[2]; 241| 182| x[3] ^= y[3]; 242| | 243| 182| typecast_copy(out + i, x, 4); 244| 182| } 245| | 246| 2.65k| for(size_t i = blocks; i != length; ++i) { ------------------ | Branch (246:27): [True: 2.42k, False: 228] ------------------ 247| 2.42k| out[i] ^= in[i]; 248| 2.42k| } 249| 228|} _ZN5Botan9clear_memIhEEvPT_m: 109| 46.5k|inline constexpr void clear_mem(T* ptr, size_t n) { 110| 46.5k| clear_bytes(ptr, sizeof(T) * n); 111| 46.5k|} _ZN5Botan8copy_memIhEEvPT_PKS1_m: 122| 4.81M|{ 123| 4.81M| BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null"); ------------------ | | 78| 4.81M| do { \ | | 79| 9.42M| if((expr1) && !(expr2)) \ | | ------------------ | | | Branch (79:10): [True: 4.71M, False: 103k] | | | Branch (79:23): [True: 4.71M, False: 0] | | | Branch (79:23): [True: 4.71M, False: 0] | | ------------------ | | 80| 4.81M| Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \ | | 81| 4.81M| } while(0) | | ------------------ | | | Branch (81:12): [Folded - Ignored] | | ------------------ ------------------ 124| | 125| 4.81M| if(in != nullptr && out != nullptr && n > 0) { ------------------ | Branch (125:7): [True: 4.80M, False: 6.48k] | Branch (125:24): [True: 4.76M, False: 41.7k] | Branch (125:42): [True: 4.71M, False: 55.0k] ------------------ 126| 4.71M| std::memmove(out, in, sizeof(T) * n); 127| 4.71M| } 128| 4.81M|} _ZN5Botan9clear_memImEEvPT_m: 109| 31.1M|inline constexpr void clear_mem(T* ptr, size_t n) { 110| 31.1M| clear_bytes(ptr, sizeof(T) * n); 111| 31.1M|} _ZN5Botan13typecast_copyItEEvPT_PKhm: 140| 4.81k|{ 141| 4.81k| std::memcpy(out, in, sizeof(T) * N); 142| 4.81k|} _ZN5Botan13typecast_copyItEEvRT_PKh: 152| 4.81k|{ 153| 4.81k| typecast_copy(&out, in, 1); 154| 4.81k|} _ZN5Botan13typecast_copyIjEEvPT_PKhm: 140| 518k|{ 141| 518k| std::memcpy(out, in, sizeof(T) * N); 142| 518k|} _ZN5Botan13typecast_copyIjEEvRT_PKh: 152| 518k|{ 153| 518k| typecast_copy(&out, in, 1); 154| 518k|} _ZN5Botan13typecast_copyImEEvRT_PKh: 152| 72.5k|{ 153| 72.5k| typecast_copy(&out, in, 1); 154| 72.5k|} _ZN5Botan13typecast_copyIjEEvPhPT_m: 133| 105k|{ 134| 105k| std::memcpy(out, in, sizeof(T) * N); 135| 105k|} _ZN5Botan13typecast_copyIjEEvPhT_: 145| 105k|inline constexpr void typecast_copy(uint8_t out[], T in) { 146| 105k| typecast_copy(out, &in, 1); 147| 105k|} _ZN5Botan13typecast_copyImEEvPhT_: 145| 37.8k|inline constexpr void typecast_copy(uint8_t out[], T in) { 146| 37.8k| typecast_copy(out, &in, 1); 147| 37.8k|} _ZN5Botan9clear_memIjEEvPT_m: 109| 12.1k|inline constexpr void clear_mem(T* ptr, size_t n) { 110| 12.1k| clear_bytes(ptr, sizeof(T) * n); 111| 12.1k|} _ZN5Botan13buffer_insertIhNS_16secure_allocatorIhEEEEmRNSt3__16vectorIT_T0_EEmPKS5_m: 203| 16.2k|size_t buffer_insert(std::vector& buf, size_t buf_offset, const T input[], size_t input_length) { 204| 16.2k| BOTAN_ASSERT_NOMSG(buf_offset <= buf.size()); ------------------ | | 60| 16.2k| do { \ | | 61| 16.2k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 16.2k] | | ------------------ | | 62| 16.2k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 16.2k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 205| 16.2k| const size_t to_copy = std::min(input_length, buf.size() - buf_offset); 206| 16.2k| if(to_copy > 0) { ------------------ | Branch (206:7): [True: 15.9k, False: 359] ------------------ 207| 15.9k| copy_mem(&buf[buf_offset], input, to_copy); 208| 15.9k| } 209| 16.2k| return to_copy; 210| 16.2k|} _ZN5Botan8copy_memImEEvPT_PKS1_m: 122| 6.11M|{ 123| 6.11M| BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null"); ------------------ | | 78| 6.11M| do { \ | | 79| 12.2M| if((expr1) && !(expr2)) \ | | ------------------ | | | Branch (79:10): [True: 6.11M, False: 0] | | | Branch (79:23): [True: 6.11M, False: 0] | | | Branch (79:23): [True: 6.11M, False: 0] | | ------------------ | | 80| 6.11M| Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \ | | 81| 6.11M| } while(0) | | ------------------ | | | Branch (81:12): [Folded - Ignored] | | ------------------ ------------------ 124| | 125| 6.11M| if(in != nullptr && out != nullptr && n > 0) { ------------------ | Branch (125:7): [True: 6.11M, False: 0] | Branch (125:24): [True: 6.11M, False: 0] | Branch (125:42): [True: 6.11M, False: 0] ------------------ 126| 6.11M| std::memmove(out, in, sizeof(T) * n); 127| 6.11M| } 128| 6.11M|} _ZN5Botan8same_memIhEEbPKT_S3_m: 193| 250|inline bool same_mem(const T* p1, const T* p2, size_t n) { 194| 250| volatile T difference = 0; 195| | 196| 2.44k| for(size_t i = 0; i != n; ++i) ------------------ | Branch (196:22): [True: 2.19k, False: 250] ------------------ 197| 2.19k| difference = difference | (p1[i] ^ p2[i]); 198| | 199| 250| return difference == 0; 200| 250|} _ZN5Botan13buffer_insertIhNSt3__19allocatorIhEEEEmRNS1_6vectorIT_T0_EEmPKS5_m: 203| 620|size_t buffer_insert(std::vector& buf, size_t buf_offset, const T input[], size_t input_length) { 204| 620| BOTAN_ASSERT_NOMSG(buf_offset <= buf.size()); ------------------ | | 60| 620| do { \ | | 61| 620| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 620] | | ------------------ | | 62| 620| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 620| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 205| 620| const size_t to_copy = std::min(input_length, buf.size() - buf_offset); 206| 620| if(to_copy > 0) { ------------------ | Branch (206:7): [True: 620, False: 0] ------------------ 207| 620| copy_mem(&buf[buf_offset], input, to_copy); 208| 620| } 209| 620| return to_copy; 210| 620|} _ZN5Botan13buffer_insertIhNSt3__19allocatorIhEES3_EEmRNS1_6vectorIT_T0_EEmRKNS4_IS5_T1_EE: 213| 21|size_t buffer_insert(std::vector& buf, size_t buf_offset, const std::vector& input) { 214| 21| BOTAN_ASSERT_NOMSG(buf_offset <= buf.size()); ------------------ | | 60| 21| do { \ | | 61| 21| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 21] | | ------------------ | | 62| 21| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 21| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 215| 21| const size_t to_copy = std::min(input.size(), buf.size() - buf_offset); 216| 21| if(to_copy > 0) { ------------------ | Branch (216:7): [True: 21, False: 0] ------------------ 217| 21| copy_mem(&buf[buf_offset], input.data(), to_copy); 218| 21| } 219| 21| return to_copy; 220| 21|} _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| 828| virtual size_t message_parts() const { return 1; } _ZNK5Botan10Public_Key17message_part_sizeEv: 176| 414| virtual size_t message_part_size() const { return 0; } _ZNK5Botan10Public_Key29default_x509_signature_formatEv: 178| 876| virtual Signature_Format default_x509_signature_format() const { 179| 876| return (this->message_parts() >= 2) ? Signature_Format::DerSequence : Signature_Format::Standard; ------------------ | Branch (179:17): [True: 462, False: 414] ------------------ 180| 876| } _ZN5Botan22create_hex_fingerprintENSt3__14spanIKhLm18446744073709551615EEENS0_17basic_string_viewIcNS0_11char_traitsIcEEEE: 367| 5.79k|inline std::string create_hex_fingerprint(std::span vec, std::string_view hash_name) { 368| 5.79k| return create_hex_fingerprint(vec.data(), vec.size(), hash_name); 369| 5.79k|} _ZN5Botan14Asymmetric_KeyD2Ev: 57| 2.56k| virtual ~Asymmetric_Key() = default; _ZN5Botan15Key_ConstraintsC2ENS0_4BitsE: 139| 608| Key_Constraints(Key_Constraints::Bits bits) : m_value(bits) {} _ZN5Botan15Key_ConstraintsC2Ej: 141| 94| explicit Key_Constraints(uint32_t bits) : m_value(bits) {} _ZN5Botan15Key_ConstraintsC2Ev: 143| 5.29k| Key_Constraints() : m_value(0) {} _ZNK5Botan15Key_Constraints8includesENS0_4BitsE: 158| 2| bool includes(Key_Constraints::Bits other) const { return (m_value & other) == other; } _ZNK5Botan15Key_Constraints5emptyEv: 165| 11| bool empty() const { return m_value == 0; } _ZN5Botan7X509_DNC2Ev: 37| 12.9k| X509_DN() = default; _ZN5Botan10ExtensionsC2Ev: 513| 5.29k| Extensions() {} _ZN5Botan15NameConstraintsC2Ev: 295| 7.02k| NameConstraints() : m_permitted_subtrees(), m_excluded_subtrees() {} _ZNK5Botan7X509_DN8get_bitsEv: 58| 8.81k| const std::vector& get_bits() const { return m_dn_bits; } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension9Key_UsageEEEPKT_RKNS_3OIDE: 393| 3.34k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 394| 3.34k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (394:42): [True: 35, False: 3.31k] ------------------ 395| | // Unknown_Extension oid_name is empty 396| 35| if(extn->oid_name().empty()) { ------------------ | Branch (396:16): [True: 27, False: 8] ------------------ 397| 27| return nullptr; 398| 27| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (398:32): [True: 8, False: 0] ------------------ 399| 8| return extn_as_T; 400| 8| } else { 401| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 402| 0| } 403| 35| } 404| | 405| 3.31k| return nullptr; 406| 3.34k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension14Subject_Key_IDEEEPKT_RKNS_3OIDE: 393| 3.34k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 394| 3.34k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (394:42): [True: 29, False: 3.31k] ------------------ 395| | // Unknown_Extension oid_name is empty 396| 29| if(extn->oid_name().empty()) { ------------------ | Branch (396:16): [True: 11, False: 18] ------------------ 397| 11| return nullptr; 398| 18| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (398:32): [True: 18, False: 0] ------------------ 399| 18| return extn_as_T; 400| 18| } else { 401| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 402| 0| } 403| 29| } 404| | 405| 3.31k| return nullptr; 406| 3.34k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension16Authority_Key_IDEEEPKT_RKNS_3OIDE: 393| 3.34k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 394| 3.34k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (394:42): [True: 37, False: 3.30k] ------------------ 395| | // Unknown_Extension oid_name is empty 396| 37| if(extn->oid_name().empty()) { ------------------ | Branch (396:16): [True: 15, False: 22] ------------------ 397| 15| return nullptr; 398| 22| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (398:32): [True: 22, False: 0] ------------------ 399| 22| return extn_as_T; 400| 22| } else { 401| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 402| 0| } 403| 37| } 404| | 405| 3.30k| return nullptr; 406| 3.34k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension16Name_ConstraintsEEEPKT_RKNS_3OIDE: 393| 3.34k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 394| 3.34k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (394:42): [True: 47, False: 3.29k] ------------------ 395| | // Unknown_Extension oid_name is empty 396| 47| if(extn->oid_name().empty()) { ------------------ | Branch (396:16): [True: 36, False: 11] ------------------ 397| 36| return nullptr; 398| 36| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (398:32): [True: 11, False: 0] ------------------ 399| 11| return extn_as_T; 400| 11| } else { 401| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 402| 0| } 403| 47| } 404| | 405| 3.29k| return nullptr; 406| 3.34k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension17Basic_ConstraintsEEEPKT_RKNS_3OIDE: 393| 3.34k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 394| 3.34k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (394:42): [True: 15, False: 3.32k] ------------------ 395| | // Unknown_Extension oid_name is empty 396| 15| if(extn->oid_name().empty()) { ------------------ | Branch (396:16): [True: 11, False: 4] ------------------ 397| 11| return nullptr; 398| 11| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (398:32): [True: 4, False: 0] ------------------ 399| 4| return extn_as_T; 400| 4| } else { 401| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 402| 0| } 403| 15| } 404| | 405| 3.32k| return nullptr; 406| 3.34k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension23Issuer_Alternative_NameEEEPKT_RKNS_3OIDE: 393| 3.34k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 394| 3.34k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (394:42): [True: 100, False: 3.24k] ------------------ 395| | // Unknown_Extension oid_name is empty 396| 100| if(extn->oid_name().empty()) { ------------------ | Branch (396:16): [True: 43, False: 57] ------------------ 397| 43| return nullptr; 398| 57| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (398:32): [True: 57, False: 0] ------------------ 399| 57| return extn_as_T; 400| 57| } else { 401| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 402| 0| } 403| 100| } 404| | 405| 3.24k| return nullptr; 406| 3.34k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension24Subject_Alternative_NameEEEPKT_RKNS_3OIDE: 393| 3.34k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 394| 3.34k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (394:42): [True: 218, False: 3.12k] ------------------ 395| | // Unknown_Extension oid_name is empty 396| 218| if(extn->oid_name().empty()) { ------------------ | Branch (396:16): [True: 132, False: 86] ------------------ 397| 132| return nullptr; 398| 132| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (398:32): [True: 86, False: 0] ------------------ 399| 86| return extn_as_T; 400| 86| } else { 401| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 402| 0| } 403| 218| } 404| | 405| 3.12k| return nullptr; 406| 3.34k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension18Extended_Key_UsageEEEPKT_RKNS_3OIDE: 393| 3.34k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 394| 3.34k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (394:42): [True: 26, False: 3.31k] ------------------ 395| | // Unknown_Extension oid_name is empty 396| 26| if(extn->oid_name().empty()) { ------------------ | Branch (396:16): [True: 15, False: 11] ------------------ 397| 15| return nullptr; 398| 15| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (398:32): [True: 11, False: 0] ------------------ 399| 11| return extn_as_T; 400| 11| } else { 401| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 402| 0| } 403| 26| } 404| | 405| 3.31k| return nullptr; 406| 3.34k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension20Certificate_PoliciesEEEPKT_RKNS_3OIDE: 393| 3.34k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 394| 3.34k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (394:42): [True: 23, False: 3.32k] ------------------ 395| | // Unknown_Extension oid_name is empty 396| 23| if(extn->oid_name().empty()) { ------------------ | Branch (396:16): [True: 14, False: 9] ------------------ 397| 14| return nullptr; 398| 14| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (398:32): [True: 9, False: 0] ------------------ 399| 9| return extn_as_T; 400| 9| } else { 401| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 402| 0| } 403| 23| } 404| | 405| 3.32k| return nullptr; 406| 3.34k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension28Authority_Information_AccessEEEPKT_RKNS_3OIDE: 393| 3.34k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 394| 3.34k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (394:42): [True: 23, False: 3.32k] ------------------ 395| | // Unknown_Extension oid_name is empty 396| 23| if(extn->oid_name().empty()) { ------------------ | Branch (396:16): [True: 9, False: 14] ------------------ 397| 9| return nullptr; 398| 14| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (398:32): [True: 14, False: 0] ------------------ 399| 14| return extn_as_T; 400| 14| } else { 401| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 402| 0| } 403| 23| } 404| | 405| 3.32k| return nullptr; 406| 3.34k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension23CRL_Distribution_PointsEEEPKT_RKNS_3OIDE: 393| 3.34k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 394| 3.34k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (394:42): [True: 31, False: 3.31k] ------------------ 395| | // Unknown_Extension oid_name is empty 396| 31| if(extn->oid_name().empty()) { ------------------ | Branch (396:16): [True: 24, False: 7] ------------------ 397| 24| return nullptr; 398| 24| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (398:32): [True: 7, False: 0] ------------------ 399| 7| return extn_as_T; 400| 7| } else { 401| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 402| 0| } 403| 31| } 404| | 405| 3.31k| return nullptr; 406| 3.34k| } _ZNK5Botan7X509_DN7dn_infoEv: 66| 1.82k| const std::vector>& dn_info() const { return m_rdn; } _ZN5Botan14GeneralSubtreeC2Ev: 242| 1.42k| GeneralSubtree() : m_base(), m_minimum(0), m_maximum(std::numeric_limits::max()) {} _ZN5Botan15NameConstraintsC2EONSt3__16vectorINS_14GeneralSubtreeENS1_9allocatorIS3_EEEES7_: 304| 164| m_permitted_subtrees(permitted_subtrees), m_excluded_subtrees(excluded_subtrees) {} _ZN5Botan10Extensions15Extensions_InfoC2EbRKNSt3__16vectorIhNS2_9allocatorIhEEEENS2_10unique_ptrINS_21Certificate_ExtensionENS2_14default_deleteISA_EEEE: 534| 14.1k| m_obj(std::move(ext)), m_bits(encoding), m_critical(critical) {} _ZNK5Botan10Extensions15Extensions_Info3objEv: 540| 584| const Certificate_Extension& obj() const { 541| 584| BOTAN_ASSERT_NONNULL(m_obj.get()); ------------------ | | 87| 584| do { \ | | 88| 584| if((ptr) == nullptr) \ | | ------------------ | | | Branch (88:10): [True: 0, False: 584] | | ------------------ | | 89| 584| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 90| 584| } while(0) | | ------------------ | | | Branch (90:12): [Folded - Ignored] | | ------------------ ------------------ 542| 584| return *m_obj.get(); 543| 584| } _ZN5Botan11GeneralNameC2Ev: 190| 1.42k| GeneralName() = default; _ZN5Botan21Certificate_ExtensionD2Ev: 367| 20.3k| virtual ~Certificate_Extension() = default; _ZN5Botan11PK_Verifier14verify_messageENSt3__14spanIKhLm18446744073709551615EEES4_: 320| 950| bool verify_message(std::span msg, std::span sig) { 321| 950| return verify_message(msg.data(), msg.size(), sig.data(), sig.size()); 322| 950| } _ZNK5Botan15Modular_Reducer8multiplyERKNS_6BigIntES3_: 30| 206k| BigInt multiply(const BigInt& x, const BigInt& y) const { return reduce(x * y); } _ZNK5Botan15Modular_Reducer11get_modulusEv: 20| 349| const BigInt& get_modulus() const { return m_modulus; } _ZNK5Botan15Modular_Reducer6squareERKNS_6BigIntE: 43| 626k| BigInt square(const BigInt& x) const { return reduce(Botan::square(x)); } _ZN5Botan16secure_allocatorIhE8allocateEm: 45| 414k| T* allocate(std::size_t n) { return static_cast(allocate_memory(n, sizeof(T))); } _ZN5Botan16secure_allocatorIhE10deallocateEPhm: 47| 414k| void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); } _ZN5BotanneIhhEEbRKNS_16secure_allocatorIT_EERKNS1_IT0_EE: 56| 86.7k|inline bool operator!=(const secure_allocator&, const secure_allocator&) { 57| 86.7k| return false; 58| 86.7k|} _ZN5Botan16secure_allocatorImE10deallocateEPmm: 47| 10.7M| void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); } _ZN5Botan16secure_allocatorImE8allocateEm: 45| 10.7M| T* allocate(std::size_t n) { return static_cast(allocate_memory(n, sizeof(T))); } _ZN5BotanpLIhNS_16secure_allocatorIhEEmEERNSt3__16vectorIT_T0_EES8_RKNS3_4pairIPS5_T1_EE: 98| 10.8k|std::vector& operator+=(std::vector& out, const std::pair& in) { 99| 10.8k| out.insert(out.end(), in.first, in.first + in.second); 100| 10.8k| return out; 101| 10.8k|} _ZN5BotanpLIhNS_16secure_allocatorIhEES2_EERNSt3__16vectorIT_T0_EES8_RKNS4_IS5_T1_EE: 80| 12|std::vector& operator+=(std::vector& out, const std::vector& in) { 81| 12| out.insert(out.end(), in.begin(), in.end()); 82| 12| return out; 83| 12|} _ZN5BotanpLIhNS_16secure_allocatorIhEEmEERNSt3__16vectorIT_T0_EES8_RKNS3_4pairIPKS5_T1_EE: 92| 48.5k|std::vector& operator+=(std::vector& out, const std::pair& in) { 93| 48.5k| out.insert(out.end(), in.first, in.first + in.second); 94| 48.5k| return out; 95| 48.5k|} _ZN5Botan16secure_allocatorIjE10deallocateEPjm: 47| 12.1k| void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); } _ZN5Botan16secure_allocatorIjE8allocateEm: 45| 12.1k| T* allocate(std::size_t n) { return static_cast(allocate_memory(n, sizeof(T))); } _ZN5Botan7zeroiseImNS_16secure_allocatorImEEEEvRNSt3__16vectorIT_T0_EE: 108| 148|void zeroise(std::vector& vec) { 109| 148| clear_mem(vec.data(), vec.size()); 110| 148|} _ZN5Botan7zeroiseIjNS_16secure_allocatorIjEEEEvRNSt3__16vectorIT_T0_EE: 108| 12.1k|void zeroise(std::vector& vec) { 109| 12.1k| clear_mem(vec.data(), vec.size()); 110| 12.1k|} _ZN5Botan7zeroiseIhNS_16secure_allocatorIhEEEEvRNSt3__16vectorIT_T0_EE: 108| 30.0k|void zeroise(std::vector& vec) { 109| 30.0k| clear_mem(vec.data(), vec.size()); 110| 30.0k|} _ZN5BotanpLIhNSt3__19allocatorIhEENS_16secure_allocatorIhEEEERNS1_6vectorIT_T0_EESA_RKNS6_IS7_T1_EE: 80| 1.05k|std::vector& operator+=(std::vector& out, const std::vector& in) { 81| 1.05k| out.insert(out.end(), in.begin(), in.end()); 82| 1.05k| return out; 83| 1.05k|} _ZN5Botan14Cert_Extension9Key_Usage10static_oidEv: 66| 16.9k| static OID static_oid() { return OID("2.5.29.15"); } _ZNK5Botan14Cert_Extension9Key_Usage15get_constraintsEv: 64| 8| Key_Constraints get_constraints() const { return m_constraints; } _ZN5Botan14Cert_Extension14Subject_Key_ID10static_oidEv: 98| 17.5k| static OID static_oid() { return OID("2.5.29.14"); } _ZNK5Botan14Cert_Extension14Subject_Key_ID10get_key_idEv: 96| 18| const std::vector& get_key_id() const { return m_key_id; } _ZN5Botan14Cert_Extension16Authority_Key_ID10static_oidEv: 128| 13.7k| static OID static_oid() { return OID("2.5.29.35"); } _ZNK5Botan14Cert_Extension16Authority_Key_ID10get_key_idEv: 126| 22| const std::vector& get_key_id() const { return m_key_id; } _ZN5Botan14Cert_Extension16Name_Constraints10static_oidEv: 250| 13.3k| static OID static_oid() { return OID("2.5.29.30"); } _ZNK5Botan14Cert_Extension16Name_Constraints20get_name_constraintsEv: 248| 11| const NameConstraints& get_name_constraints() const { return m_name_constraints; } _ZN5Botan14Cert_Extension17Basic_Constraints10static_oidEv: 37| 15.2k| static OID static_oid() { return OID("2.5.29.19"); } _ZNK5Botan14Cert_Extension17Basic_Constraints9get_is_caEv: 33| 4| bool get_is_ca() const { return m_is_ca; } _ZN5Botan14Cert_Extension23Issuer_Alternative_Name10static_oidEv: 178| 15.7k| static OID static_oid() { return OID("2.5.29.18"); } _ZNK5Botan14Cert_Extension23Issuer_Alternative_Name12get_alt_nameEv: 176| 57| const AlternativeName& get_alt_name() const { return m_alt_name; } _ZN5Botan14Cert_Extension24Subject_Alternative_Name10static_oidEv: 150| 16.3k| static OID static_oid() { return OID("2.5.29.17"); } _ZNK5Botan14Cert_Extension24Subject_Alternative_Name12get_alt_nameEv: 148| 86| const AlternativeName& get_alt_name() const { return m_alt_name; } _ZN5Botan14Cert_Extension18Extended_Key_Usage10static_oidEv: 214| 10.3k| static OID static_oid() { return OID("2.5.29.37"); } _ZNK5Botan14Cert_Extension18Extended_Key_Usage18object_identifiersEv: 212| 11| const std::vector& object_identifiers() const { return m_oids; } _ZN5Botan14Cert_Extension20Certificate_Policies10static_oidEv: 280| 10.8k| static OID static_oid() { return OID("2.5.29.32"); } _ZNK5Botan14Cert_Extension20Certificate_Policies15get_policy_oidsEv: 278| 9| const std::vector& get_policy_oids() const { return m_oids; } _ZN5Botan14Cert_Extension28Authority_Information_Access10static_oidEv: 318| 10.1k| static OID static_oid() { return OID("1.3.6.1.5.5.7.1.1"); } _ZNK5Botan14Cert_Extension28Authority_Information_Access14ocsp_responderEv: 316| 14| std::string ocsp_responder() const { return m_ocsp_responder; } _ZNK5Botan14Cert_Extension28Authority_Information_Access10ca_issuersEv: 322| 14| const std::vector ca_issuers() const { return m_ca_issuers; } _ZN5Botan14Cert_Extension23CRL_Distribution_Points10static_oidEv: 422| 11.6k| static OID static_oid() { return OID("2.5.29.31"); } _ZNK5Botan14Cert_Extension23CRL_Distribution_Points21crl_distribution_urlsEv: 420| 7| const std::vector& crl_distribution_urls() const { return m_crl_distribution_urls; } _ZN5Botan14Cert_Extension17Basic_ConstraintsC2Ebm: 31| 800| Basic_Constraints(bool ca = false, size_t limit = 0) : m_is_ca(ca), m_path_limit(limit) {} _ZNK5Botan14Cert_Extension17Basic_Constraints8oid_nameEv: 42| 4| std::string oid_name() const override { return "X509v3.BasicConstraints"; } _ZN5Botan14Cert_Extension9Key_UsageC2Ev: 62| 608| explicit Key_Usage() : m_constraints(Key_Constraints::None) {} _ZNK5Botan14Cert_Extension9Key_Usage8oid_nameEv: 71| 8| std::string oid_name() const override { return "X509v3.KeyUsage"; } _ZNK5Botan14Cert_Extension14Subject_Key_ID8oid_nameEv: 103| 18| std::string oid_name() const override { return "X509v3.SubjectKeyIdentifier"; } _ZNK5Botan14Cert_Extension16Authority_Key_ID8oid_nameEv: 133| 22| std::string oid_name() const override { return "X509v3.AuthorityKeyIdentifier"; } _ZN5Botan14Cert_Extension24Subject_Alternative_NameC2ERKNS_15AlternativeNameE: 158| 615| explicit Subject_Alternative_Name(const AlternativeName& name = AlternativeName()) : m_alt_name(name) {} _ZNK5Botan14Cert_Extension24Subject_Alternative_Name8oid_nameEv: 161| 86| std::string oid_name() const override { return "X509v3.SubjectAlternativeName"; } _ZN5Botan14Cert_Extension23Issuer_Alternative_NameC2ERKNS_15AlternativeNameE: 186| 454| explicit Issuer_Alternative_Name(const AlternativeName& name = AlternativeName()) : m_alt_name(name) {} _ZNK5Botan14Cert_Extension23Issuer_Alternative_Name8oid_nameEv: 189| 57| std::string oid_name() const override { return "X509v3.IssuerAlternativeName"; } _ZNK5Botan14Cert_Extension18Extended_Key_Usage8oid_nameEv: 219| 11| std::string oid_name() const override { return "X509v3.ExtendedKeyUsage"; } _ZNK5Botan14Cert_Extension16Name_Constraints8oid_nameEv: 255| 11| std::string oid_name() const override { return "X509v3.NameConstraints"; } _ZNK5Botan14Cert_Extension20Certificate_Policies8oid_nameEv: 291| 9| std::string oid_name() const override { return "X509v3.CertificatePolicies"; } _ZNK5Botan14Cert_Extension28Authority_Information_Access8oid_nameEv: 325| 14| std::string oid_name() const override { return "PKIX.AuthorityInformationAccess"; } _ZN5Botan14Cert_Extension10CRL_NumberC2Ev: 343| 413| CRL_Number() : m_has_value(false), m_crl_number(0) {} _ZN5Botan14Cert_Extension10CRL_Number10static_oidEv: 349| 11.1k| static OID static_oid() { return OID("2.5.29.20"); } _ZN5Botan14Cert_Extension14CRL_ReasonCodeC2ENS_8CRL_CodeE: 374| 324| explicit CRL_ReasonCode(CRL_Code r = CRL_Code::Unspecified) : m_reason(r) {} _ZN5Botan14Cert_Extension14CRL_ReasonCode10static_oidEv: 378| 10.7k| static OID static_oid() { return OID("2.5.29.21"); } _ZNK5Botan14Cert_Extension23CRL_Distribution_Points18Distribution_Point5pointEv: 404| 233| const AlternativeName& point() const { return m_point; } _ZNK5Botan14Cert_Extension23CRL_Distribution_Points8oid_nameEv: 427| 7| std::string oid_name() const override { return "X509v3.CRLDistributionPoints"; } _ZN5Botan14Cert_Extension30CRL_Issuing_Distribution_Point10static_oidEv: 455| 7.76k| static OID static_oid() { return OID("2.5.29.28"); } _ZN5Botan14Cert_Extension17Unknown_ExtensionC2ERKNS_3OIDEb: 507| 12.6k| Unknown_Extension(const OID& oid, bool critical) : m_oid(oid), m_critical(critical) {} _ZNK5Botan14Cert_Extension17Unknown_Extension8oid_nameEv: 541| 337| std::string oid_name() const override { return ""; } _ZN5Botan14Cert_Extension14Subject_Key_IDC2Ev: 86| 570| Subject_Key_ID() = default; _ZN5Botan14Cert_Extension16Authority_Key_IDC2Ev: 122| 328| Authority_Key_ID() = default; _ZN5Botan14Cert_Extension16Name_ConstraintsC2Ev: 238| 1.72k| Name_Constraints() = default; _ZN5Botan14Cert_Extension23CRL_Distribution_PointsC2Ev: 414| 563| CRL_Distribution_Points() = default; _ZN5Botan14Cert_Extension30CRL_Issuing_Distribution_PointC2Ev: 444| 305| CRL_Issuing_Distribution_Point() = default; _ZN5Botan14Cert_Extension20Certificate_PoliciesC2Ev: 274| 447| Certificate_Policies() = default; _ZN5Botan14Cert_Extension18Extended_Key_UsageC2Ev: 208| 226| Extended_Key_Usage() = default; _ZN5Botan14Cert_Extension28Authority_Information_AccessC2Ev: 310| 359| Authority_Information_Access() = default; _ZN5Botan4X5098load_keyENSt3__16vectorIhNS1_9allocatorIhEEEE: 61| 2.83k|inline std::unique_ptr load_key(std::vector enc) { 62| 2.83k| DataSource_Memory source(std::move(enc)); 63| 2.83k| return X509::load_key(source); 64| 2.83k|} _ZN5Botan11X509_ObjectD2Ev: 103| 6.43k| virtual ~X509_Object() = default; _ZNK5Botan11X509_Object9signatureEv: 37| 3.84k| const std::vector& signature() const { return m_sig; } _ZNK5Botan11X509_Object11signed_bodyEv: 42| 8.63k| const std::vector& signed_body() const { return m_tbs_bits; } _ZNK5Botan11X509_Object19signature_algorithmEv: 47| 9.11k| const AlgorithmIdentifier& signature_algorithm() const { return m_sig_algo; } _ZN5Botan11X509_ObjectC2Ev: 121| 6.43k| X509_Object() = default; _Z4fuzzPKhm: 12| 6.43k|void fuzz(const uint8_t in[], size_t len) { 13| 6.43k| if(len > max_fuzzer_input_size) ------------------ | Branch (13:7): [True: 0, False: 6.43k] ------------------ 14| 0| return; 15| | 16| 6.43k| try { 17| 6.43k| Botan::DataSource_Memory input(in, len); 18| 6.43k| Botan::X509_Certificate cert(input); 19| 6.43k| } catch(Botan::Exception& e) {} 20| 6.43k|} 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| 6.44k|extern "C" int LLVMFuzzerTestOneInput(const uint8_t in[], size_t len) { 35| 6.44k| if(len <= max_fuzzer_input_size) { ------------------ | Branch (35:7): [True: 6.43k, False: 8] ------------------ 36| 6.43k| fuzz(in, len); 37| 6.43k| } 38| 6.44k| return 0; 39| 6.44k|} _ZN5Botan19AlgorithmIdentifierC2ERKNS_3OIDERKNSt3__16vectorIhNS4_9allocatorIhEEEE: 19| 58| m_oid(oid), m_parameters(param) {} _ZN5Botan19AlgorithmIdentifierC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKNS1_6vectorIhNS1_9allocatorIhEEEE: 25| 58| AlgorithmIdentifier(OID::from_string(oid), param) {} _ZN5Botan19AlgorithmIdentifierC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS0_15Encoding_OptionE: 42| 58| m_oid(OID::from_string(oid)), m_parameters() { 43| 58| const uint8_t DER_NULL[] = {0x05, 0x00}; 44| | 45| 58| if(option == USE_NULL_PARAM) { ------------------ | Branch (45:7): [True: 58, False: 0] ------------------ 46| 58| m_parameters.assign(DER_NULL, DER_NULL + 2); 47| 58| } 48| 58|} _ZNK5Botan19AlgorithmIdentifier19parameters_are_nullEv: 50| 5.07k|bool AlgorithmIdentifier::parameters_are_null() const { 51| 5.07k| return (m_parameters.size() == 2 && (m_parameters[0] == 0x05) && (m_parameters[1] == 0x00)); ------------------ | Branch (51:12): [True: 4.86k, False: 215] | Branch (51:40): [True: 4.16k, False: 693] | Branch (51:69): [True: 4.15k, False: 15] ------------------ 52| 5.07k|} _ZN5BotaneqERKNS_19AlgorithmIdentifierES2_: 54| 4.50k|bool operator==(const AlgorithmIdentifier& a1, const AlgorithmIdentifier& a2) { 55| 4.50k| if(a1.oid() != a2.oid()) { ------------------ | Branch (55:7): [True: 16, False: 4.49k] ------------------ 56| 16| return false; 57| 16| } 58| | 59| | /* 60| | * Treat NULL and empty as equivalent 61| | */ 62| 4.49k| if(a1.parameters_are_null_or_empty() && a2.parameters_are_null_or_empty()) { ------------------ | Branch (62:7): [True: 3.58k, False: 908] | Branch (62:44): [True: 3.56k, False: 14] ------------------ 63| 3.56k| return true; 64| 3.56k| } 65| | 66| 922| return (a1.parameters() == a2.parameters()); 67| 4.49k|} _ZN5BotanneERKNS_19AlgorithmIdentifierES2_: 69| 4.50k|bool operator!=(const AlgorithmIdentifier& a1, const AlgorithmIdentifier& a2) { return !(a1 == a2); } _ZNK5Botan19AlgorithmIdentifier11encode_intoERNS_11DER_EncoderE: 74| 3.40k|void AlgorithmIdentifier::encode_into(DER_Encoder& codec) const { 75| 3.40k| codec.start_sequence().encode(oid()).raw_bytes(parameters()).end_cons(); 76| 3.40k|} _ZN5Botan19AlgorithmIdentifier11decode_fromERNS_11BER_DecoderE: 81| 18.0k|void AlgorithmIdentifier::decode_from(BER_Decoder& codec) { 82| 18.0k| codec.start_sequence().decode(m_oid).raw_bytes(m_parameters).end_cons(); 83| 18.0k|} _ZNK5Botan11ASN1_Object10BER_encodeEv: 18| 3.40k|std::vector ASN1_Object::BER_encode() const { 19| 3.40k| std::vector output; 20| 3.40k| DER_Encoder der(output); 21| 3.40k| this->encode_into(der); 22| 3.40k| return output; 23| 3.40k|} _ZNK5Botan10BER_Object11assert_is_aENS_9ASN1_TypeENS_10ASN1_ClassENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE: 28| 155k|void BER_Object::assert_is_a(ASN1_Type expected_type_tag, ASN1_Class expected_class_tag, std::string_view descr) const { 29| 155k| if(this->is_a(expected_type_tag, expected_class_tag) == false) { ------------------ | Branch (29:7): [True: 4.34k, False: 151k] ------------------ 30| 4.34k| std::stringstream msg; 31| | 32| 4.34k| msg << "Tag mismatch when decoding " << descr << " got "; 33| | 34| 4.34k| if(m_class_tag == ASN1_Class::NoObject && m_type_tag == ASN1_Type::NoObject) { ------------------ | Branch (34:10): [True: 739, False: 3.60k] | Branch (34:49): [True: 739, False: 0] ------------------ 35| 739| msg << "EOF"; 36| 3.60k| } else { 37| 3.60k| if(m_class_tag == ASN1_Class::Universal || m_class_tag == ASN1_Class::Constructed) { ------------------ | Branch (37:13): [True: 1.26k, False: 2.34k] | Branch (37:53): [True: 1.51k, False: 826] ------------------ 38| 2.77k| msg << asn1_tag_to_string(m_type_tag); 39| 2.77k| } else { 40| 826| msg << std::to_string(static_cast(m_type_tag)); 41| 826| } 42| | 43| 3.60k| msg << "/" << asn1_class_to_string(m_class_tag); 44| 3.60k| } 45| | 46| 4.34k| msg << " expected "; 47| | 48| 4.34k| if(expected_class_tag == ASN1_Class::Universal || expected_class_tag == ASN1_Class::Constructed) { ------------------ | Branch (48:10): [True: 1.48k, False: 2.85k] | Branch (48:57): [True: 2.75k, False: 104] ------------------ 49| 4.23k| msg << asn1_tag_to_string(expected_type_tag); 50| 4.23k| } else { 51| 104| msg << std::to_string(static_cast(expected_type_tag)); 52| 104| } 53| | 54| 4.34k| msg << "/" << asn1_class_to_string(expected_class_tag); 55| | 56| 4.34k| throw BER_Decoding_Error(msg.str()); 57| 4.34k| } 58| 155k|} _ZNK5Botan10BER_Object4is_aENS_9ASN1_TypeENS_10ASN1_ClassE: 60| 342k|bool BER_Object::is_a(ASN1_Type expected_type_tag, ASN1_Class expected_class_tag) const { 61| 342k| return (m_type_tag == expected_type_tag && m_class_tag == expected_class_tag); ------------------ | Branch (61:12): [True: 184k, False: 157k] | Branch (61:47): [True: 180k, False: 4.24k] ------------------ 62| 342k|} _ZNK5Botan10BER_Object4is_aEiNS_10ASN1_ClassE: 64| 155k|bool BER_Object::is_a(int expected_type_tag, ASN1_Class expected_class_tag) const { 65| 155k| return is_a(ASN1_Type(expected_type_tag), expected_class_tag); 66| 155k|} _ZN5Botan10BER_Object11set_taggingENS_9ASN1_TypeENS_10ASN1_ClassE: 68| 333k|void BER_Object::set_tagging(ASN1_Type type_tag, ASN1_Class class_tag) { 69| 333k| m_type_tag = type_tag; 70| 333k| m_class_tag = class_tag; 71| 333k|} _ZN5Botan20asn1_class_to_stringENS_10ASN1_ClassE: 73| 7.94k|std::string asn1_class_to_string(ASN1_Class type) { 74| 7.94k| switch(type) { 75| 2.74k| case ASN1_Class::Universal: ------------------ | Branch (75:7): [True: 2.74k, False: 5.19k] ------------------ 76| 2.74k| return "UNIVERSAL"; 77| 4.26k| case ASN1_Class::Constructed: ------------------ | Branch (77:7): [True: 4.26k, False: 3.67k] ------------------ 78| 4.26k| return "CONSTRUCTED"; 79| 171| case ASN1_Class::ContextSpecific: ------------------ | Branch (79:7): [True: 171, False: 7.77k] ------------------ 80| 171| return "CONTEXT_SPECIFIC"; 81| 222| case ASN1_Class::Application: ------------------ | Branch (81:7): [True: 222, False: 7.72k] ------------------ 82| 222| return "APPLICATION"; 83| 97| case ASN1_Class::Private: ------------------ | Branch (83:7): [True: 97, False: 7.84k] ------------------ 84| 97| return "PRIVATE"; 85| 0| case ASN1_Class::NoObject: ------------------ | Branch (85:7): [True: 0, False: 7.94k] ------------------ 86| 0| return "NO_OBJECT"; 87| 440| default: ------------------ | Branch (87:7): [True: 440, False: 7.50k] ------------------ 88| 440| return "CLASS(" + std::to_string(static_cast(type)) + ")"; 89| 7.94k| } 90| 7.94k|} _ZN5Botan18asn1_tag_to_stringENS_9ASN1_TypeE: 92| 7.01k|std::string asn1_tag_to_string(ASN1_Type type) { 93| 7.01k| switch(type) { 94| 2.81k| case ASN1_Type::Sequence: ------------------ | Branch (94:7): [True: 2.81k, False: 4.20k] ------------------ 95| 2.81k| return "SEQUENCE"; 96| | 97| 357| case ASN1_Type::Set: ------------------ | Branch (97:7): [True: 357, False: 6.65k] ------------------ 98| 357| return "SET"; 99| | 100| 126| case ASN1_Type::PrintableString: ------------------ | Branch (100:7): [True: 126, False: 6.88k] ------------------ 101| 126| return "PRINTABLE STRING"; 102| | 103| 108| case ASN1_Type::NumericString: ------------------ | Branch (103:7): [True: 108, False: 6.90k] ------------------ 104| 108| return "NUMERIC STRING"; 105| | 106| 136| case ASN1_Type::Ia5String: ------------------ | Branch (106:7): [True: 136, False: 6.87k] ------------------ 107| 136| return "IA5 STRING"; 108| | 109| 132| case ASN1_Type::TeletexString: ------------------ | Branch (109:7): [True: 132, False: 6.88k] ------------------ 110| 132| return "T61 STRING"; 111| | 112| 47| case ASN1_Type::Utf8String: ------------------ | Branch (112:7): [True: 47, False: 6.96k] ------------------ 113| 47| return "UTF8 STRING"; 114| | 115| 89| case ASN1_Type::VisibleString: ------------------ | Branch (115:7): [True: 89, False: 6.92k] ------------------ 116| 89| return "VISIBLE STRING"; 117| | 118| 24| case ASN1_Type::BmpString: ------------------ | Branch (118:7): [True: 24, False: 6.99k] ------------------ 119| 24| return "BMP STRING"; 120| | 121| 48| case ASN1_Type::UniversalString: ------------------ | Branch (121:7): [True: 48, False: 6.96k] ------------------ 122| 48| return "UNIVERSAL STRING"; 123| | 124| 58| case ASN1_Type::UtcTime: ------------------ | Branch (124:7): [True: 58, False: 6.95k] ------------------ 125| 58| return "UTC TIME"; 126| | 127| 124| case ASN1_Type::GeneralizedTime: ------------------ | Branch (127:7): [True: 124, False: 6.89k] ------------------ 128| 124| return "GENERALIZED TIME"; 129| | 130| 710| case ASN1_Type::OctetString: ------------------ | Branch (130:7): [True: 710, False: 6.30k] ------------------ 131| 710| return "OCTET STRING"; 132| | 133| 529| case ASN1_Type::BitString: ------------------ | Branch (133:7): [True: 529, False: 6.48k] ------------------ 134| 529| return "BIT STRING"; 135| | 136| 281| case ASN1_Type::Enumerated: ------------------ | Branch (136:7): [True: 281, False: 6.73k] ------------------ 137| 281| return "ENUMERATED"; 138| | 139| 551| case ASN1_Type::Integer: ------------------ | Branch (139:7): [True: 551, False: 6.46k] ------------------ 140| 551| return "INTEGER"; 141| | 142| 74| case ASN1_Type::Null: ------------------ | Branch (142:7): [True: 74, False: 6.94k] ------------------ 143| 74| return "NULL"; 144| | 145| 105| case ASN1_Type::ObjectId: ------------------ | Branch (145:7): [True: 105, False: 6.91k] ------------------ 146| 105| return "OBJECT"; 147| | 148| 112| case ASN1_Type::Boolean: ------------------ | Branch (148:7): [True: 112, False: 6.90k] ------------------ 149| 112| return "BOOLEAN"; 150| | 151| 18| case ASN1_Type::NoObject: ------------------ | Branch (151:7): [True: 18, False: 6.99k] ------------------ 152| 18| return "NO_OBJECT"; 153| | 154| 572| default: ------------------ | Branch (154:7): [True: 572, False: 6.44k] ------------------ 155| 572| return "TAG(" + std::to_string(static_cast(type)) + ")"; 156| 7.01k| } 157| 7.01k|} _ZN5Botan18BER_Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 162| 7.97k|BER_Decoding_Error::BER_Decoding_Error(std::string_view str) : Decoding_Error(fmt("BER: {}", str)) {} _ZN5Botan11BER_Bad_TagC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEj: 164| 327|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| 14.1k|std::vector put_in_sequence(const std::vector& contents) { 172| 14.1k| return ASN1::put_in_sequence(contents.data(), contents.size()); 173| 14.1k|} _ZN5Botan4ASN115put_in_sequenceEPKhm: 175| 14.1k|std::vector put_in_sequence(const uint8_t bits[], size_t len) { 176| 14.1k| std::vector output; 177| 14.1k| DER_Encoder(output).start_sequence().raw_bytes(bits, len).end_cons(); 178| 14.1k| return output; 179| 14.1k|} _ZN5Botan4ASN19to_stringERKNS_10BER_ObjectE: 184| 33.5k|std::string to_string(const BER_Object& obj) { return std::string(cast_uint8_ptr_to_char(obj.bits()), obj.length()); } _ZN5Botan4ASN19maybe_BERERNS_10DataSourceE: 189| 9.26k|bool maybe_BER(DataSource& source) { 190| 9.26k| uint8_t first_u8; 191| 9.26k| if(!source.peek_byte(first_u8)) { ------------------ | Branch (191:7): [True: 0, False: 9.26k] ------------------ 192| 0| BOTAN_ASSERT_EQUAL(source.read_byte(first_u8), 0, "Expected EOF"); ------------------ | | 69| 0| do { \ | | 70| 0| if((expr1) != (expr2)) \ | | ------------------ | | | Branch (70:10): [True: 0, False: 0] | | ------------------ | | 71| 0| Botan::assertion_failure(#expr1 " == " #expr2, assertion_made, __func__, __FILE__, __LINE__); \ | | 72| 0| } while(0) | | ------------------ | | | Branch (72:12): [Folded - Ignored] | | ------------------ ------------------ 193| 0| throw Stream_IO_Error("ASN1::maybe_BER: Source was empty"); 194| 0| } 195| | 196| 9.26k| const auto cons_seq = static_cast(ASN1_Class::Constructed) | static_cast(ASN1_Type::Sequence); 197| 9.26k| if(first_u8 == cons_seq) { ------------------ | Branch (197:7): [True: 8.96k, False: 305] ------------------ 198| 8.96k| return true; 199| 8.96k| } 200| 305| return false; 201| 9.26k|} _ZN5Botan3OID11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 72| 998|OID OID::from_string(std::string_view str) { 73| 998| if(str.empty()) { ------------------ | Branch (73:7): [True: 0, False: 998] ------------------ 74| 0| throw Invalid_Argument("OID::from_string argument must be non-empty"); 75| 0| } 76| | 77| 998| OID o = OID_Map::global_registry().str2oid(str); 78| 998| if(o.has_value()) { ------------------ | Branch (78:7): [True: 998, False: 0] ------------------ 79| 998| return o; 80| 998| } 81| | 82| 0| std::vector 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| 181k|OID::OID(std::string_view oid_str) { 95| 181k| if(!oid_str.empty()) { ------------------ | Branch (95:7): [True: 181k, False: 0] ------------------ 96| 181k| m_id = parse_oid_str(oid_str); 97| 181k| if(m_id.size() < 2 || m_id[0] > 2 || (m_id[0] < 2 && m_id[1] > 39)) { ------------------ | Branch (97:10): [True: 0, False: 181k] | Branch (97:29): [True: 0, False: 181k] | Branch (97:45): [True: 10.4k, False: 171k] | Branch (97:60): [True: 0, False: 10.4k] ------------------ 98| 0| throw Decoding_Error(fmt("Invalid OID '{}'", oid_str)); 99| 0| } 100| 181k| } 101| 181k|} _ZNK5Botan3OID9to_stringEv: 106| 25.4k|std::string OID::to_string() const { 107| 25.4k| std::ostringstream out; 108| 25.4k| out << (*this); 109| 25.4k| return out.str(); 110| 25.4k|} _ZNK5Botan3OID19to_formatted_stringEv: 112| 7.80k|std::string OID::to_formatted_string() const { 113| 7.80k| std::string s = this->human_name_or_empty(); 114| 7.80k| if(!s.empty()) { ------------------ | Branch (114:7): [True: 4.35k, False: 3.44k] ------------------ 115| 4.35k| return s; 116| 4.35k| } 117| 3.44k| return this->to_string(); 118| 7.80k|} _ZNK5Botan3OID19human_name_or_emptyEv: 120| 7.80k|std::string OID::human_name_or_empty() const { return OID_Map::global_registry().oid2str(*this); } _ZN5BotanltERKNS_3OIDES2_: 127| 100k|bool operator<(const OID& a, const OID& b) { 128| 100k| const std::vector& oid1 = a.get_components(); 129| 100k| const std::vector& oid2 = b.get_components(); 130| | 131| 100k| return std::lexicographical_compare(oid1.begin(), oid1.end(), oid2.begin(), oid2.end()); 132| 100k|} _ZN5BotanlsERNSt3__113basic_ostreamIcNS0_11char_traitsIcEEEERKNS_3OIDE: 134| 25.7k|std::ostream& operator<<(std::ostream& out, const OID& oid) { 135| 25.7k| const auto& val = oid.get_components(); 136| | 137| 160k| for(size_t i = 0; i != val.size(); ++i) { ------------------ | Branch (137:22): [True: 134k, False: 25.7k] ------------------ 138| | // avoid locale issues with integer formatting 139| 134k| out << std::to_string(val[i]); 140| 134k| if(i != val.size() - 1) { ------------------ | Branch (140:10): [True: 109k, False: 25.7k] ------------------ 141| 109k| out << "."; 142| 109k| } 143| 134k| } 144| | 145| 25.7k| return out; 146| 25.7k|} _ZNK5Botan3OID11encode_intoERNS_11DER_EncoderE: 151| 3.40k|void OID::encode_into(DER_Encoder& der) const { 152| 3.40k| if(m_id.size() < 2) { ------------------ | Branch (152:7): [True: 0, False: 3.40k] ------------------ 153| 0| throw Invalid_Argument("OID::encode_into: OID is invalid"); 154| 0| } 155| | 156| 3.40k| std::vector encoding; 157| | 158| 3.40k| if(m_id[0] > 2 || m_id[1] >= 40) { ------------------ | Branch (158:7): [True: 449, False: 2.95k] | Branch (158:22): [True: 0, False: 2.95k] ------------------ 159| 449| throw Encoding_Error("Invalid OID prefix, cannot encode"); 160| 449| } 161| | 162| 2.95k| encoding.push_back(static_cast(40 * m_id[0] + m_id[1])); 163| | 164| 16.0k| for(size_t i = 2; i != m_id.size(); ++i) { ------------------ | Branch (164:22): [True: 13.0k, False: 2.95k] ------------------ 165| 13.0k| if(m_id[i] == 0) { ------------------ | Branch (165:10): [True: 162, False: 12.9k] ------------------ 166| 162| encoding.push_back(0); 167| 12.9k| } else { 168| 12.9k| size_t blocks = high_bit(m_id[i]) + 6; 169| 12.9k| blocks = (blocks - (blocks % 7)) / 7; 170| | 171| 12.9k| BOTAN_ASSERT(blocks > 0, "Math works"); ------------------ | | 51| 12.9k| do { \ | | 52| 12.9k| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 0, False: 12.9k] | | ------------------ | | 53| 12.9k| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 12.9k| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 172| | 173| 19.3k| for(size_t j = 0; j != blocks - 1; ++j) { ------------------ | Branch (173:28): [True: 6.41k, False: 12.9k] ------------------ 174| 6.41k| encoding.push_back(0x80 | ((m_id[i] >> 7 * (blocks - j - 1)) & 0x7F)); 175| 6.41k| } 176| 12.9k| encoding.push_back(m_id[i] & 0x7F); 177| 12.9k| } 178| 13.0k| } 179| 2.95k| der.add_object(ASN1_Type::ObjectId, ASN1_Class::Universal, encoding); 180| 2.95k|} _ZN5Botan3OID11decode_fromERNS_11BER_DecoderE: 185| 53.5k|void OID::decode_from(BER_Decoder& decoder) { 186| 53.5k| BER_Object obj = decoder.get_next_object(); 187| 53.5k| if(obj.tagging() != (ASN1_Class::Universal | ASN1_Type::ObjectId)) { ------------------ | Branch (187:7): [True: 268, False: 53.3k] ------------------ 188| 268| throw BER_Bad_Tag("Error decoding OID, unknown tag", obj.tagging()); 189| 268| } 190| | 191| 53.3k| const size_t length = obj.length(); 192| 53.3k| const uint8_t* bits = obj.bits(); 193| | 194| 53.3k| if(length < 2 && !(length == 1 && bits[0] == 0)) { ------------------ | Branch (194:7): [True: 2.94k, False: 50.3k] | Branch (194:23): [True: 2.91k, False: 30] | Branch (194:38): [True: 2.88k, False: 23] ------------------ 195| 53| throw BER_Decoding_Error("OID encoding is too short"); 196| 53| } 197| | 198| 53.2k| m_id.clear(); 199| 53.2k| m_id.push_back(bits[0] / 40); 200| 53.2k| m_id.push_back(bits[0] % 40); 201| | 202| 53.2k| size_t i = 0; 203| 269k| while(i != length - 1) { ------------------ | Branch (203:10): [True: 216k, False: 53.1k] ------------------ 204| 216k| uint32_t component = 0; 205| 273k| while(i != length - 1) { ------------------ | Branch (205:13): [True: 265k, False: 7.96k] ------------------ 206| 265k| ++i; 207| | 208| 265k| if(component >> (32 - 7)) { ------------------ | Branch (208:13): [True: 52, False: 265k] ------------------ 209| 52| throw Decoding_Error("OID component overflow"); 210| 52| } 211| | 212| 265k| component = (component << 7) + (bits[i] & 0x7F); 213| | 214| 265k| if(!(bits[i] & 0x80)) { ------------------ | Branch (214:13): [True: 208k, False: 56.6k] ------------------ 215| 208k| break; 216| 208k| } 217| 265k| } 218| 216k| m_id.push_back(component); 219| 216k| } 220| 53.2k|} asn1_oid.cpp:_ZN5Botan12_GLOBAL__N_113parse_oid_strENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 24| 181k|std::vector parse_oid_str(std::string_view oid) { 25| 181k| try { 26| 181k| std::string elem; 27| 181k| std::vector oid_elems; 28| | 29| 1.71M| for(char c : oid) { ------------------ | Branch (29:18): [True: 1.71M, False: 181k] ------------------ 30| 1.71M| if(c == '.') { ------------------ | Branch (30:13): [True: 596k, False: 1.12M] ------------------ 31| 596k| if(elem.empty()) { ------------------ | Branch (31:16): [True: 0, False: 596k] ------------------ 32| 0| return std::vector(); 33| 0| } 34| 596k| oid_elems.push_back(to_u32bit(elem)); 35| 596k| elem.clear(); 36| 1.12M| } else { 37| 1.12M| elem += c; 38| 1.12M| } 39| 1.71M| } 40| | 41| 181k| if(!elem.empty()) { ------------------ | Branch (41:10): [True: 181k, False: 0] ------------------ 42| 181k| oid_elems.push_back(to_u32bit(elem)); 43| 181k| } 44| | 45| 181k| return oid_elems; 46| 181k| } catch(Invalid_Argument&) // thrown by to_u32bit 47| 181k| { 48| 0| return std::vector(); 49| 0| } 50| 181k|} _ZN5Botan11ASN1_String14is_string_typeENS_9ASN1_TypeE: 60| 2.78k|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| 17.5k|ASN1_String::ASN1_String(std::string_view str, ASN1_Type t) : m_utf8_str(str), m_tag(t) { 63| 17.5k| if(!is_utf8_subset_string_type(m_tag)) { ------------------ | Branch (63:7): [True: 5, False: 17.4k] ------------------ 64| 5| throw Invalid_Argument("ASN1_String only supports encoding to UTF-8 or a UTF-8 subset"); 65| 5| } 66| 17.5k|} _ZN5Botan11ASN1_StringC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 68| 15.2k|ASN1_String::ASN1_String(std::string_view str) : ASN1_String(str, choose_encoding(str)) {} _ZN5Botan11ASN1_String11decode_fromERNS_11BER_DecoderE: 86| 15.1k|void ASN1_String::decode_from(BER_Decoder& source) { 87| 15.1k| BER_Object obj = source.get_next_object(); 88| | 89| 15.1k| if(!is_asn1_string_type(obj.type())) { ------------------ | Branch (89:7): [True: 112, False: 15.0k] ------------------ 90| 112| auto typ = static_cast(obj.type()); 91| 112| throw Decoding_Error(fmt("ASN1_String: Unknown string type {}", typ)); 92| 112| } 93| | 94| 15.0k| m_tag = obj.type(); 95| 15.0k| m_data.assign(obj.bits(), obj.bits() + obj.length()); 96| | 97| 15.0k| if(m_tag == ASN1_Type::BmpString) { ------------------ | Branch (97:7): [True: 731, False: 14.3k] ------------------ 98| 731| m_utf8_str = ucs2_to_utf8(m_data.data(), m_data.size()); 99| 14.3k| } else if(m_tag == ASN1_Type::UniversalString) { ------------------ | Branch (99:14): [True: 285, False: 14.0k] ------------------ 100| 285| m_utf8_str = ucs4_to_utf8(m_data.data(), m_data.size()); 101| 14.0k| } else if(m_tag == ASN1_Type::TeletexString) { ------------------ | Branch (101:14): [True: 1.35k, False: 12.6k] ------------------ 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| 1.35k| m_utf8_str = latin1_to_utf8(m_data.data(), m_data.size()); 107| 12.6k| } else { 108| | // All other supported string types are UTF-8 or some subset thereof 109| 12.6k| m_utf8_str = ASN1::to_string(obj); 110| 12.6k| } 111| 15.0k|} asn1_str.cpp:_ZN5Botan12_GLOBAL__N_119is_asn1_string_typeENS_9ASN1_TypeE: 52| 17.8k|bool is_asn1_string_type(ASN1_Type tag) { 53| 17.8k| return (is_utf8_subset_string_type(tag) || tag == ASN1_Type::TeletexString || tag == ASN1_Type::BmpString || ------------------ | Branch (53:12): [True: 14.9k, False: 2.95k] | Branch (53:47): [True: 1.40k, False: 1.55k] | Branch (53:82): [True: 847, False: 709] ------------------ 54| 17.8k| tag == ASN1_Type::UniversalString); ------------------ | Branch (54:12): [True: 290, False: 419] ------------------ 55| 17.8k|} asn1_str.cpp:_ZN5Botan12_GLOBAL__N_126is_utf8_subset_string_typeENS_9ASN1_TypeE: 47| 35.3k|bool is_utf8_subset_string_type(ASN1_Type tag) { 48| 35.3k| return (tag == ASN1_Type::NumericString || tag == ASN1_Type::PrintableString || tag == ASN1_Type::VisibleString || ------------------ | Branch (48:12): [True: 2.03k, False: 33.3k] | Branch (48:47): [True: 24.2k, False: 9.07k] | Branch (48:84): [True: 1.88k, False: 7.19k] ------------------ 49| 35.3k| tag == ASN1_Type::Ia5String || tag == ASN1_Type::Utf8String); ------------------ | Branch (49:12): [True: 2.58k, False: 4.61k] | Branch (49:43): [True: 1.65k, False: 2.96k] ------------------ 50| 35.3k|} asn1_str.cpp:_ZN5Botan12_GLOBAL__N_115choose_encodingENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 23| 15.2k|ASN1_Type choose_encoding(std::string_view str) { 24| 15.2k| auto all_printable = CT::Mask::set(); 25| | 26| 15.2k| for(size_t i = 0; i != str.size(); ++i) { ------------------ | Branch (26:22): [True: 0, False: 15.2k] ------------------ 27| 0| const uint8_t c = static_cast(str[i]); 28| | 29| 0| auto is_alpha_lower = CT::Mask::is_within_range(c, 'a', 'z'); 30| 0| auto is_alpha_upper = CT::Mask::is_within_range(c, 'A', 'Z'); 31| 0| auto is_decimal = CT::Mask::is_within_range(c, '0', '9'); 32| | 33| 0| auto is_print_punc = CT::Mask::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| 15.2k| if(all_printable.is_set()) { ------------------ | Branch (40:7): [True: 15.2k, False: 0] ------------------ 41| 15.2k| return ASN1_Type::PrintableString; 42| 15.2k| } else { 43| 0| return ASN1_Type::Utf8String; 44| 0| } 45| 15.2k|} _ZN5Botan9ASN1_Time11decode_fromERNS_11BER_DecoderE: 51| 9.15k|void ASN1_Time::decode_from(BER_Decoder& source) { 52| 9.15k| BER_Object ber_time = source.get_next_object(); 53| | 54| 9.15k| set_to(ASN1::to_string(ber_time), ber_time.type()); 55| 9.15k|} _ZN5Botan9ASN1_Time6set_toENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_9ASN1_TypeE: 153| 9.15k|void ASN1_Time::set_to(std::string_view t_spec, ASN1_Type spec_tag) { 154| 9.15k| BOTAN_ARG_CHECK(spec_tag == ASN1_Type::UtcTime || spec_tag == ASN1_Type::GeneralizedTime, ------------------ | | 30| 9.15k| do { \ | | 31| 9.32k| if(!(expr)) \ | | ------------------ | | | Branch (31:12): [True: 8.98k, False: 169] | | | Branch (31:12): [True: 113, False: 56] | | ------------------ | | 32| 9.15k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 9.15k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 155| 9.15k| "Invalid tag for ASN1_Time"); 156| | 157| 9.15k| if(spec_tag == ASN1_Type::GeneralizedTime) { ------------------ | Branch (157:7): [True: 113, False: 9.04k] ------------------ 158| 113| BOTAN_ARG_CHECK(t_spec.size() == 15, "Invalid GeneralizedTime input string"); ------------------ | | 30| 113| do { \ | | 31| 113| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 7, False: 106] | | ------------------ | | 32| 113| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 113| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 159| 9.04k| } else if(spec_tag == ASN1_Type::UtcTime) { ------------------ | Branch (159:14): [True: 8.98k, False: 56] ------------------ 160| 8.98k| BOTAN_ARG_CHECK(t_spec.size() == 13, "Invalid UTCTime input string"); ------------------ | | 30| 8.98k| do { \ | | 31| 8.98k| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 6, False: 8.98k] | | ------------------ | | 32| 8.98k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 8.98k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 161| 8.98k| } 162| | 163| 9.15k| BOTAN_ARG_CHECK(t_spec.back() == 'Z', "Botan does not support ASN1 times with timezones other than Z"); ------------------ | | 30| 9.15k| do { \ | | 31| 9.15k| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 11, False: 9.14k] | | ------------------ | | 32| 9.15k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 9.15k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 164| | 165| 9.15k| const size_t field_len = 2; 166| | 167| 9.15k| const size_t year_start = 0; 168| 9.15k| const size_t year_len = (spec_tag == ASN1_Type::UtcTime) ? 2 : 4; ------------------ | Branch (168:28): [True: 8.97k, False: 185] ------------------ 169| 9.15k| const size_t month_start = year_start + year_len; 170| 9.15k| const size_t day_start = month_start + field_len; 171| 9.15k| const size_t hour_start = day_start + field_len; 172| 9.15k| const size_t min_start = hour_start + field_len; 173| 9.15k| const size_t sec_start = min_start + field_len; 174| | 175| 9.15k| m_year = to_u32bit(t_spec.substr(year_start, year_len)); 176| 9.15k| m_month = to_u32bit(t_spec.substr(month_start, field_len)); 177| 9.15k| m_day = to_u32bit(t_spec.substr(day_start, field_len)); 178| 9.15k| m_hour = to_u32bit(t_spec.substr(hour_start, field_len)); 179| 9.15k| m_minute = to_u32bit(t_spec.substr(min_start, field_len)); 180| 9.15k| m_second = to_u32bit(t_spec.substr(sec_start, field_len)); 181| 9.15k| m_tag = spec_tag; 182| | 183| 9.15k| if(spec_tag == ASN1_Type::UtcTime) { ------------------ | Branch (183:7): [True: 8.96k, False: 195] ------------------ 184| 8.96k| if(m_year >= 50) { ------------------ | Branch (184:10): [True: 2.90k, False: 6.05k] ------------------ 185| 2.90k| m_year += 1900; 186| 6.05k| } else { 187| 6.05k| m_year += 2000; 188| 6.05k| } 189| 8.96k| } 190| | 191| 9.15k| if(!passes_sanity_check()) { ------------------ | Branch (191:7): [True: 54, False: 9.10k] ------------------ 192| 54| throw Invalid_Argument(fmt("ASN1_Time string '{}' does not seem to be valid", t_spec)); 193| 54| } 194| 9.15k|} _ZNK5Botan9ASN1_Time19passes_sanity_checkEv: 199| 9.06k|bool ASN1_Time::passes_sanity_check() const { 200| | // AppVeyor's trust store includes a cert with expiration date in 3016 ... 201| 9.06k| if(m_year < 1950 || m_year > 3100) { ------------------ | Branch (201:7): [True: 11, False: 9.05k] | Branch (201:24): [True: 7, False: 9.04k] ------------------ 202| 18| return false; 203| 18| } 204| 9.04k| if(m_month == 0 || m_month > 12) { ------------------ | Branch (204:7): [True: 1, False: 9.04k] | Branch (204:23): [True: 10, False: 9.03k] ------------------ 205| 11| return false; 206| 11| } 207| | 208| 9.03k| const uint32_t days_in_month[12] = {31, 28 + 1, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; 209| | 210| 9.03k| if(m_day == 0 || m_day > days_in_month[m_month - 1]) { ------------------ | Branch (210:7): [True: 1, False: 9.03k] | Branch (210:21): [True: 11, False: 9.02k] ------------------ 211| 12| return false; 212| 12| } 213| | 214| 9.02k| if(m_month == 2 && m_day == 29) { ------------------ | Branch (214:7): [True: 1.62k, False: 7.39k] | Branch (214:23): [True: 74, False: 1.54k] ------------------ 215| 74| if(m_year % 4 != 0) { ------------------ | Branch (215:10): [True: 2, False: 72] ------------------ 216| 2| return false; // not a leap year 217| 2| } 218| | 219| 72| if(m_year % 100 == 0 && m_year % 400 != 0) { ------------------ | Branch (219:10): [True: 7, False: 65] | Branch (219:31): [True: 2, False: 5] ------------------ 220| 2| return false; 221| 2| } 222| 72| } 223| | 224| 9.01k| if(m_hour >= 24 || m_minute >= 60 || m_second > 60) { ------------------ | Branch (224:7): [True: 4, False: 9.01k] | Branch (224:23): [True: 2, False: 9.01k] | Branch (224:41): [True: 2, False: 9.00k] ------------------ 225| 8| return false; 226| 8| } 227| | 228| 9.00k| if(m_tag == ASN1_Type::UtcTime) { ------------------ | Branch (228:7): [True: 8.94k, False: 66] ------------------ 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| 8.94k| if(m_second > 59) { ------------------ | Branch (236:10): [True: 1, False: 8.94k] ------------------ 237| 1| return false; 238| 1| } 239| 8.94k| } 240| | 241| 9.00k| return true; 242| 9.00k|} _ZNK5Botan11BER_Decoder10more_itemsEv: 195| 110k|bool BER_Decoder::more_items() const { 196| 110k| if(m_source->end_of_data() && !m_pushed.is_set()) { ------------------ | Branch (196:7): [True: 27.8k, False: 82.6k] | Branch (196:34): [True: 27.8k, False: 0] ------------------ 197| 27.8k| return false; 198| 27.8k| } 199| 82.6k| return true; 200| 110k|} _ZN5Botan11BER_Decoder10verify_endEv: 205| 9.44k|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| 13.9k|BER_Decoder& BER_Decoder::verify_end(std::string_view err) { 211| 13.9k| if(!m_source->end_of_data() || m_pushed.is_set()) { ------------------ | Branch (211:7): [True: 93, False: 13.8k] | Branch (211:35): [True: 0, False: 13.8k] ------------------ 212| 93| throw Decoding_Error(err); 213| 93| } 214| 13.8k| return (*this); 215| 13.9k|} _ZN5Botan11BER_Decoder17discard_remainingEv: 220| 286|BER_Decoder& BER_Decoder::discard_remaining() { 221| 286| uint8_t buf; 222| 1.34k| while(m_source->read_byte(buf)) {} ------------------ | Branch (222:10): [True: 1.05k, False: 286] ------------------ 223| 286| return (*this); 224| 286|} _ZN5Botan11BER_Decoder15get_next_objectEv: 229| 312k|BER_Object BER_Decoder::get_next_object() { 230| 312k| BER_Object next; 231| | 232| 312k| if(m_pushed.is_set()) { ------------------ | Branch (232:7): [True: 23.9k, False: 288k] ------------------ 233| 23.9k| std::swap(next, m_pushed); 234| 23.9k| return next; 235| 23.9k| } 236| | 237| 333k| for(;;) { 238| 333k| ASN1_Type type_tag; 239| 333k| ASN1_Class class_tag; 240| 333k| decode_tag(m_source, type_tag, class_tag); 241| 333k| next.set_tagging(type_tag, class_tag); 242| 333k| if(next.is_set() == false) { // no more objects ------------------ | Branch (242:10): [True: 10.6k, False: 322k] ------------------ 243| 10.6k| return next; 244| 10.6k| } 245| | 246| 322k| size_t field_size; 247| 322k| const size_t length = decode_length(m_source, field_size, ALLOWED_EOC_NESTINGS); 248| 322k| if(!m_source->check_available(length)) { ------------------ | Branch (248:10): [True: 1.66k, False: 321k] ------------------ 249| 1.66k| throw BER_Decoding_Error("Value truncated"); 250| 1.66k| } 251| | 252| 321k| uint8_t* out = next.mutable_bits(length); 253| 321k| if(m_source->read(out, length) != length) { ------------------ | Branch (253:10): [True: 0, False: 321k] ------------------ 254| 0| throw BER_Decoding_Error("Value truncated"); 255| 0| } 256| | 257| 321k| if(next.tagging() == static_cast(ASN1_Type::Eoc)) { ------------------ | Branch (257:10): [True: 45.2k, False: 275k] ------------------ 258| 45.2k| continue; 259| 275k| } else { 260| 275k| break; 261| 275k| } 262| 321k| } 263| | 264| 275k| return next; 265| 288k|} _ZN5Botan11BER_Decoder9push_backERKNS_10BER_ObjectE: 270| 2.31k|void BER_Decoder::push_back(const BER_Object& obj) { 271| 2.31k| if(m_pushed.is_set()) { ------------------ | Branch (271:7): [True: 0, False: 2.31k] ------------------ 272| 0| throw Invalid_State("BER_Decoder: Only one push back is allowed"); 273| 0| } 274| 2.31k| m_pushed = obj; 275| 2.31k|} _ZN5Botan11BER_Decoder9push_backEONS_10BER_ObjectE: 277| 29.0k|void BER_Decoder::push_back(BER_Object&& obj) { 278| 29.0k| if(m_pushed.is_set()) { ------------------ | Branch (278:7): [True: 0, False: 29.0k] ------------------ 279| 0| throw Invalid_State("BER_Decoder: Only one push back is allowed"); 280| 0| } 281| 29.0k| m_pushed = std::move(obj); 282| 29.0k|} _ZN5Botan11BER_Decoder10start_consENS_9ASN1_TypeENS_10ASN1_ClassE: 284| 109k|BER_Decoder BER_Decoder::start_cons(ASN1_Type type_tag, ASN1_Class class_tag) { 285| 109k| BER_Object obj = get_next_object(); 286| 109k| obj.assert_is_a(type_tag, class_tag | ASN1_Class::Constructed); 287| 109k| return BER_Decoder(std::move(obj), this); 288| 109k|} _ZN5Botan11BER_Decoder8end_consEv: 293| 80.9k|BER_Decoder& BER_Decoder::end_cons() { 294| 80.9k| if(!m_parent) { ------------------ | Branch (294:7): [True: 0, False: 80.9k] ------------------ 295| 0| throw Invalid_State("BER_Decoder::end_cons called with null parent"); 296| 0| } 297| 80.9k| if(!m_source->end_of_data()) { ------------------ | Branch (297:7): [True: 502, False: 80.4k] ------------------ 298| 502| throw Decoding_Error("BER_Decoder::end_cons called with data left"); 299| 502| } 300| 80.4k| return (*m_parent); 301| 80.9k|} _ZN5Botan11BER_DecoderC2EONS_10BER_ObjectEPS0_: 303| 107k|BER_Decoder::BER_Decoder(BER_Object&& obj, BER_Decoder* parent) { 304| 107k| m_data_src = std::make_unique(std::move(obj)); 305| 107k| m_source = m_data_src.get(); 306| 107k| m_parent = parent; 307| 107k|} _ZN5Botan11BER_DecoderC2ERNS_10DataSourceE: 312| 8.95k|BER_Decoder::BER_Decoder(DataSource& src) { m_source = &src; } _ZN5Botan11BER_DecoderC2EPKhm: 317| 14.7k|BER_Decoder::BER_Decoder(const uint8_t data[], size_t length) { 318| 14.7k| m_data_src = std::make_unique(data, length); 319| 14.7k| m_source = m_data_src.get(); 320| 14.7k|} _ZN5Botan11BER_DecoderC2ERKNSt3__16vectorIhNS1_9allocatorIhEEEE: 333| 29.1k|BER_Decoder::BER_Decoder(const std::vector& data) { 334| 29.1k| m_data_src = std::make_unique(data.data(), data.size()); 335| 29.1k| m_source = m_data_src.get(); 336| 29.1k|} _ZN5Botan11BER_Decoder6decodeERNS_11ASN1_ObjectENS_9ASN1_TypeENS_10ASN1_ClassE: 352| 114k|BER_Decoder& BER_Decoder::decode(ASN1_Object& obj, ASN1_Type /*unused*/, ASN1_Class /*unused*/) { 353| 114k| obj.decode_from(*this); 354| 114k| return (*this); 355| 114k|} _ZN5Botan11BER_Decoder26decode_octet_string_bigintERNS_6BigIntE: 369| 640|BER_Decoder& BER_Decoder::decode_octet_string_bigint(BigInt& out) { 370| 640| secure_vector out_vec; 371| 640| decode(out_vec, ASN1_Type::OctetString); 372| 640| out = BigInt::decode(out_vec.data(), out_vec.size()); 373| 640| return (*this); 374| 640|} _ZN5Botan11BER_Decoder6decodeERbNS_9ASN1_TypeENS_10ASN1_ClassE: 379| 2.43k|BER_Decoder& BER_Decoder::decode(bool& out, ASN1_Type type_tag, ASN1_Class class_tag) { 380| 2.43k| BER_Object obj = get_next_object(); 381| 2.43k| obj.assert_is_a(type_tag, class_tag); 382| | 383| 2.43k| if(obj.length() != 1) { ------------------ | Branch (383:7): [True: 41, False: 2.39k] ------------------ 384| 41| throw BER_Decoding_Error("BER boolean value had invalid size"); 385| 41| } 386| | 387| 2.39k| out = (obj.bits()[0]) ? true : false; ------------------ | Branch (387:10): [True: 2.34k, False: 50] ------------------ 388| 2.39k| return (*this); 389| 2.43k|} _ZN5Botan11BER_Decoder6decodeERmNS_9ASN1_TypeENS_10ASN1_ClassE: 394| 3.21k|BER_Decoder& BER_Decoder::decode(size_t& out, ASN1_Type type_tag, ASN1_Class class_tag) { 395| 3.21k| BigInt integer; 396| 3.21k| decode(integer, type_tag, class_tag); 397| | 398| 3.21k| if(integer.is_negative()) { ------------------ | Branch (398:7): [True: 27, False: 3.18k] ------------------ 399| 27| throw BER_Decoding_Error("Decoded small integer value was negative"); 400| 27| } 401| | 402| 3.18k| if(integer.bits() > 32) { ------------------ | Branch (402:7): [True: 138, False: 3.04k] ------------------ 403| 138| throw BER_Decoding_Error("Decoded integer value larger than expected"); 404| 138| } 405| | 406| 3.04k| out = 0; 407| 12.6k| for(size_t i = 0; i != 4; ++i) { ------------------ | Branch (407:22): [True: 9.62k, False: 3.04k] ------------------ 408| 9.62k| out = (out << 8) | integer.byte_at(3 - i); 409| 9.62k| } 410| | 411| 3.04k| return (*this); 412| 3.18k|} _ZN5Botan11BER_Decoder6decodeERNS_6BigIntENS_9ASN1_TypeENS_10ASN1_ClassE: 440| 11.6k|BER_Decoder& BER_Decoder::decode(BigInt& out, ASN1_Type type_tag, ASN1_Class class_tag) { 441| 11.6k| BER_Object obj = get_next_object(); 442| 11.6k| obj.assert_is_a(type_tag, class_tag); 443| | 444| 11.6k| if(obj.length() == 0) { ------------------ | Branch (444:7): [True: 1.31k, False: 10.3k] ------------------ 445| 1.31k| out.clear(); 446| 10.3k| } else { 447| 10.3k| const bool negative = (obj.bits()[0] & 0x80) ? true : false; ------------------ | Branch (447:29): [True: 1.77k, False: 8.54k] ------------------ 448| | 449| 10.3k| if(negative) { ------------------ | Branch (449:10): [True: 1.77k, False: 8.54k] ------------------ 450| 1.77k| secure_vector vec(obj.bits(), obj.bits() + obj.length()); 451| 2.76k| for(size_t i = obj.length(); i > 0; --i) { ------------------ | Branch (451:39): [True: 2.76k, False: 0] ------------------ 452| 2.76k| if(vec[i - 1]--) { ------------------ | Branch (452:16): [True: 1.77k, False: 991] ------------------ 453| 1.77k| break; 454| 1.77k| } 455| 2.76k| } 456| 30.1k| for(size_t i = 0; i != obj.length(); ++i) { ------------------ | Branch (456:28): [True: 28.3k, False: 1.77k] ------------------ 457| 28.3k| vec[i] = ~vec[i]; 458| 28.3k| } 459| 1.77k| out = BigInt(vec.data(), vec.size()); 460| 1.77k| out.flip_sign(); 461| 8.54k| } else { 462| 8.54k| out = BigInt(obj.bits(), obj.length()); 463| 8.54k| } 464| 10.3k| } 465| | 466| 11.6k| return (*this); 467| 11.6k|} _ZN5Botan11BER_Decoder6decodeERNSt3__16vectorIhNS_16secure_allocatorIhEEEENS_9ASN1_TypeES7_NS_10ASN1_ClassE: 505| 726| ASN1_Class class_tag) { 506| 726| if(real_type != ASN1_Type::OctetString && real_type != ASN1_Type::BitString) { ------------------ | Branch (506:7): [True: 0, False: 726] | Branch (506:46): [True: 0, False: 0] ------------------ 507| 0| throw BER_Bad_Tag("Bad tag for {BIT,OCTET} STRING", static_cast(real_type)); 508| 0| } 509| | 510| 726| asn1_decode_binary_string(buffer, get_next_object(), real_type, type_tag, class_tag); 511| 726| return (*this); 512| 726|} _ZN5Botan11BER_Decoder6decodeERNSt3__16vectorIhNS1_9allocatorIhEEEENS_9ASN1_TypeES7_NS_10ASN1_ClassE: 517| 27.8k| ASN1_Class class_tag) { 518| 27.8k| if(real_type != ASN1_Type::OctetString && real_type != ASN1_Type::BitString) { ------------------ | Branch (518:7): [True: 12.6k, False: 15.1k] | Branch (518:46): [True: 0, False: 12.6k] ------------------ 519| 0| throw BER_Bad_Tag("Bad tag for {BIT,OCTET} STRING", static_cast(real_type)); 520| 0| } 521| | 522| 27.8k| asn1_decode_binary_string(buffer, get_next_object(), real_type, type_tag, class_tag); 523| 27.8k| return (*this); 524| 27.8k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_110decode_tagEPNS_10DataSourceERNS_9ASN1_TypeERNS_10ASN1_ClassE: 29| 378k|size_t decode_tag(DataSource* ber, ASN1_Type& type_tag, ASN1_Class& class_tag) { 30| 378k| uint8_t b; 31| 378k| if(!ber->read_byte(b)) { ------------------ | Branch (31:7): [True: 17.6k, False: 360k] ------------------ 32| 17.6k| type_tag = ASN1_Type::NoObject; 33| 17.6k| class_tag = ASN1_Class::NoObject; 34| 17.6k| return 0; 35| 17.6k| } 36| | 37| 360k| if((b & 0x1F) != 0x1F) { ------------------ | Branch (37:7): [True: 356k, False: 3.41k] ------------------ 38| 356k| type_tag = ASN1_Type(b & 0x1F); 39| 356k| class_tag = ASN1_Class(b & 0xE0); 40| 356k| return 1; 41| 356k| } 42| | 43| 3.41k| size_t tag_bytes = 1; 44| 3.41k| class_tag = ASN1_Class(b & 0xE0); 45| | 46| 3.41k| size_t tag_buf = 0; 47| 10.0k| while(true) { ------------------ | Branch (47:10): [Folded - Ignored] ------------------ 48| 10.0k| if(!ber->read_byte(b)) { ------------------ | Branch (48:10): [True: 92, False: 9.97k] ------------------ 49| 92| throw BER_Decoding_Error("Long-form tag truncated"); 50| 92| } 51| 9.97k| if(tag_buf & 0xFF000000) { ------------------ | Branch (51:10): [True: 91, False: 9.88k] ------------------ 52| 91| throw BER_Decoding_Error("Long-form tag overflowed 32 bits"); 53| 91| } 54| 9.88k| ++tag_bytes; 55| 9.88k| tag_buf = (tag_buf << 7) | (b & 0x7F); 56| 9.88k| if((b & 0x80) == 0) { ------------------ | Branch (56:10): [True: 3.22k, False: 6.65k] ------------------ 57| 3.22k| break; 58| 3.22k| } 59| 9.88k| } 60| 3.22k| type_tag = ASN1_Type(tag_buf); 61| 3.22k| return tag_bytes; 62| 3.41k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_113decode_lengthEPNS_10DataSourceERmm: 72| 360k|size_t decode_length(DataSource* ber, size_t& field_size, size_t allow_indef) { 73| 360k| uint8_t b; 74| 360k| if(!ber->read_byte(b)) { ------------------ | Branch (74:7): [True: 306, False: 359k] ------------------ 75| 306| throw BER_Decoding_Error("Length field not found"); 76| 306| } 77| 359k| field_size = 1; 78| 359k| if((b & 0x80) == 0) { ------------------ | Branch (78:7): [True: 322k, False: 37.2k] ------------------ 79| 322k| return b; 80| 322k| } 81| | 82| 37.2k| field_size += (b & 0x7F); 83| 37.2k| if(field_size > 5) { ------------------ | Branch (83:7): [True: 686, False: 36.5k] ------------------ 84| 686| throw BER_Decoding_Error("Length field is too large"); 85| 686| } 86| | 87| 36.5k| if(field_size == 1) { ------------------ | Branch (87:7): [True: 10.9k, False: 25.5k] ------------------ 88| 10.9k| if(allow_indef == 0) { ------------------ | Branch (88:10): [True: 13, False: 10.9k] ------------------ 89| 13| throw BER_Decoding_Error("Nested EOC markers too deep, rejecting to avoid stack exhaustion"); 90| 10.9k| } else { 91| 10.9k| return find_eoc(ber, allow_indef - 1); 92| 10.9k| } 93| 10.9k| } 94| | 95| 25.5k| size_t length = 0; 96| | 97| 65.9k| for(size_t i = 0; i != field_size - 1; ++i) { ------------------ | Branch (97:22): [True: 40.4k, False: 25.4k] ------------------ 98| 40.4k| if(get_byte<0>(length) != 0) { ------------------ | Branch (98:10): [True: 0, False: 40.4k] ------------------ 99| 0| throw BER_Decoding_Error("Field length overflow"); 100| 0| } 101| 40.4k| if(!ber->read_byte(b)) { ------------------ | Branch (101:10): [True: 62, False: 40.3k] ------------------ 102| 62| throw BER_Decoding_Error("Corrupted length field"); 103| 62| } 104| 40.3k| length = (length << 8) | b; 105| 40.3k| } 106| 25.4k| return length; 107| 25.5k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_18find_eocEPNS_10DataSourceEm: 112| 10.9k|size_t find_eoc(DataSource* ber, size_t allow_indef) { 113| 10.9k| secure_vector buffer(BOTAN_DEFAULT_BUFFER_SIZE), data; ------------------ | | 372| 10.9k|#define BOTAN_DEFAULT_BUFFER_SIZE 4096 ------------------ 114| | 115| 21.8k| while(true) { ------------------ | Branch (115:10): [Folded - Ignored] ------------------ 116| 21.8k| const size_t got = ber->peek(buffer.data(), buffer.size(), data.size()); 117| 21.8k| if(got == 0) { ------------------ | Branch (117:10): [True: 10.9k, False: 10.8k] ------------------ 118| 10.9k| break; 119| 10.9k| } 120| | 121| 10.8k| data += std::make_pair(buffer.data(), got); 122| 10.8k| } 123| | 124| 10.9k| DataSource_Memory source(data); 125| 10.9k| data.clear(); 126| | 127| 10.9k| size_t length = 0; 128| 45.2k| while(true) { ------------------ | Branch (128:10): [Folded - Ignored] ------------------ 129| 44.6k| ASN1_Type type_tag; 130| 44.6k| ASN1_Class class_tag; 131| 44.6k| size_t tag_size = decode_tag(&source, type_tag, class_tag); 132| 44.6k| if(type_tag == ASN1_Type::NoObject) { ------------------ | Branch (132:10): [True: 7.14k, False: 37.5k] ------------------ 133| 7.14k| break; 134| 7.14k| } 135| | 136| 37.5k| size_t length_size = 0; 137| 37.5k| size_t item_size = decode_length(&source, length_size, allow_indef); 138| 37.5k| source.discard_next(item_size); 139| | 140| 37.5k| length = BOTAN_CHECKED_ADD(length, item_size); ------------------ | | 72| 37.5k|#define BOTAN_CHECKED_ADD(x, y) checked_add(x, y, __FILE__, __LINE__) ------------------ 141| 37.5k| length = BOTAN_CHECKED_ADD(length, tag_size); ------------------ | | 72| 37.5k|#define BOTAN_CHECKED_ADD(x, y) checked_add(x, y, __FILE__, __LINE__) ------------------ 142| 37.5k| length = BOTAN_CHECKED_ADD(length, length_size); ------------------ | | 72| 37.5k|#define BOTAN_CHECKED_ADD(x, y) checked_add(x, y, __FILE__, __LINE__) ------------------ 143| | 144| 37.5k| if(type_tag == ASN1_Type::Eoc && class_tag == ASN1_Class::Universal) { ------------------ | Branch (144:10): [True: 5.78k, False: 31.7k] | Branch (144:40): [True: 3.25k, False: 2.52k] ------------------ 145| 3.25k| break; 146| 3.25k| } 147| 37.5k| } 148| 10.9k| return length; 149| 10.9k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObjectC2EONS_10BER_ObjectE: 183| 107k| explicit DataSource_BERObject(BER_Object&& obj) : m_obj(std::move(obj)), m_offset(0) {} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObject4readEPhm: 153| 4.14M| size_t read(uint8_t out[], size_t length) override { 154| 4.14M| BOTAN_ASSERT_NOMSG(m_offset <= m_obj.length()); ------------------ | | 60| 4.14M| do { \ | | 61| 4.14M| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 4.14M] | | ------------------ | | 62| 4.14M| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 4.14M| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 155| 4.14M| const size_t got = std::min(m_obj.length() - m_offset, length); 156| 4.14M| copy_mem(out, m_obj.bits() + m_offset, got); 157| 4.14M| m_offset += got; 158| 4.14M| return got; 159| 4.14M| } ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObject15check_availableEm: 174| 219k| bool check_available(size_t n) override { 175| 219k| BOTAN_ASSERT_NOMSG(m_offset <= m_obj.length()); ------------------ | | 60| 219k| do { \ | | 61| 219k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 219k] | | ------------------ | | 62| 219k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 219k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 176| 219k| return (n <= (m_obj.length() - m_offset)); 177| 219k| } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_120DataSource_BERObject4peekEPhmm: 161| 2.67k| size_t peek(uint8_t out[], size_t length, size_t peek_offset) const override { 162| 2.67k| BOTAN_ASSERT_NOMSG(m_offset <= m_obj.length()); ------------------ | | 60| 2.67k| do { \ | | 61| 2.67k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 2.67k] | | ------------------ | | 62| 2.67k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 2.67k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 163| 2.67k| const size_t bytes_left = m_obj.length() - m_offset; 164| | 165| 2.67k| if(peek_offset >= bytes_left) { ------------------ | Branch (165:13): [True: 1.36k, False: 1.31k] ------------------ 166| 1.36k| return 0; 167| 1.36k| } 168| | 169| 1.31k| const size_t got = std::min(bytes_left - peek_offset, length); 170| 1.31k| copy_mem(out, m_obj.bits() + m_offset + peek_offset, got); 171| 1.31k| return got; 172| 2.67k| } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_120DataSource_BERObject11end_of_dataEv: 179| 164k| bool end_of_data() const override { return get_bytes_read() == m_obj.length(); } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_120DataSource_BERObject14get_bytes_readEv: 181| 164k| size_t get_bytes_read() const override { return m_offset; } ber_dec.cpp:_ZN5Botan12_GLOBAL__N_125asn1_decode_binary_stringINS_16secure_allocatorIhEEEEvRNSt3__16vectorIhT_EERKNS_10BER_ObjectENS_9ASN1_TypeESC_NS_10ASN1_ClassE: 476| 724| ASN1_Class class_tag) { 477| 724| obj.assert_is_a(type_tag, class_tag); 478| | 479| 724| if(real_type == ASN1_Type::OctetString) { ------------------ | Branch (479:7): [True: 722, False: 2] ------------------ 480| 722| buffer.assign(obj.bits(), obj.bits() + obj.length()); 481| 722| } else { 482| 2| if(obj.length() == 0) { ------------------ | Branch (482:10): [True: 0, False: 2] ------------------ 483| 0| throw BER_Decoding_Error("Invalid BIT STRING"); 484| 0| } 485| 2| if(obj.bits()[0] >= 8) { ------------------ | Branch (485:10): [True: 0, False: 2] ------------------ 486| 0| throw BER_Decoding_Error("Bad number of unused bits in BIT STRING"); 487| 0| } 488| | 489| 2| buffer.resize(obj.length() - 1); 490| | 491| 2| if(obj.length() > 1) { ------------------ | Branch (491:10): [True: 0, False: 2] ------------------ 492| 0| copy_mem(buffer.data(), obj.bits() + 1, obj.length() - 1); 493| 0| } 494| 2| } 495| 724|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_125asn1_decode_binary_stringINSt3__19allocatorIhEEEEvRNS2_6vectorIhT_EERKNS_10BER_ObjectENS_9ASN1_TypeESC_NS_10ASN1_ClassE: 476| 27.7k| ASN1_Class class_tag) { 477| 27.7k| obj.assert_is_a(type_tag, class_tag); 478| | 479| 27.7k| if(real_type == ASN1_Type::OctetString) { ------------------ | Branch (479:7): [True: 14.6k, False: 13.1k] ------------------ 480| 14.6k| buffer.assign(obj.bits(), obj.bits() + obj.length()); 481| 14.6k| } else { 482| 13.1k| if(obj.length() == 0) { ------------------ | Branch (482:10): [True: 3, False: 13.1k] ------------------ 483| 3| throw BER_Decoding_Error("Invalid BIT STRING"); 484| 3| } 485| 13.1k| if(obj.bits()[0] >= 8) { ------------------ | Branch (485:10): [True: 8, False: 13.1k] ------------------ 486| 8| throw BER_Decoding_Error("Bad number of unused bits in BIT STRING"); 487| 8| } 488| | 489| 13.1k| buffer.resize(obj.length() - 1); 490| | 491| 13.1k| if(obj.length() > 1) { ------------------ | Branch (491:10): [True: 8.92k, False: 4.20k] ------------------ 492| 8.92k| copy_mem(buffer.data(), obj.bits() + 1, obj.length() - 1); 493| 8.92k| } 494| 13.1k| } 495| 27.7k|} _ZN5Botan11DER_EncoderC2ERNSt3__16vectorIhNS1_9allocatorIhEEEE: 71| 17.8k|DER_Encoder::DER_Encoder(std::vector& vec) { 72| 17.8k| m_append_output = [&vec](const uint8_t b[], size_t l) { vec.insert(vec.end(), b, b + l); }; 73| 17.8k|} _ZN5Botan11DER_Encoder12DER_Sequence13push_contentsERS0_: 78| 23.6k|void DER_Encoder::DER_Sequence::push_contents(DER_Encoder& der) { 79| 23.6k| const auto real_class_tag = m_class_tag | ASN1_Class::Constructed; 80| | 81| 23.6k| if(m_type_tag == ASN1_Type::Set) { ------------------ | Branch (81:7): [True: 0, False: 23.6k] ------------------ 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| 23.6k| der.add_object(m_type_tag, real_class_tag, m_contents.data(), m_contents.size()); 90| 23.6k| m_contents.clear(); 91| 23.6k|} _ZN5Botan11DER_Encoder12DER_Sequence9add_bytesEPKhm: 96| 20.4k|void DER_Encoder::DER_Sequence::add_bytes(const uint8_t data[], size_t length) { 97| 20.4k| if(m_type_tag == ASN1_Type::Set) { ------------------ | Branch (97:7): [True: 0, False: 20.4k] ------------------ 98| 0| m_set_contents.push_back(secure_vector(data, data + length)); 99| 20.4k| } else { 100| 20.4k| m_contents += std::make_pair(data, length); 101| 20.4k| } 102| 20.4k|} _ZN5Botan11DER_Encoder12DER_Sequence9add_bytesEPKhmS3_m: 104| 12.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| 12.6k| if(m_type_tag == ASN1_Type::Set) { ------------------ | Branch (105:7): [True: 0, False: 12.6k] ------------------ 106| 0| secure_vector 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| 12.6k| } else { 112| 12.6k| m_contents += std::make_pair(hdr, hdr_len); 113| 12.6k| m_contents += std::make_pair(val, val_len); 114| 12.6k| } 115| 12.6k|} _ZN5Botan11DER_Encoder12DER_SequenceC2ENS_9ASN1_TypeENS_10ASN1_ClassE: 125| 24.5k|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| 24.5k|DER_Encoder& DER_Encoder::start_cons(ASN1_Type type_tag, ASN1_Class class_tag) { 162| 24.5k| m_subsequences.push_back(DER_Sequence(type_tag, class_tag)); 163| 24.5k| return (*this); 164| 24.5k|} _ZN5Botan11DER_Encoder8end_consEv: 169| 23.6k|DER_Encoder& DER_Encoder::end_cons() { 170| 23.6k| if(m_subsequences.empty()) { ------------------ | Branch (170:7): [True: 0, False: 23.6k] ------------------ 171| 0| throw Invalid_State("DER_Encoder::end_cons: No such sequence"); 172| 0| } 173| | 174| 23.6k| DER_Sequence last_seq = std::move(m_subsequences[m_subsequences.size() - 1]); 175| 23.6k| m_subsequences.pop_back(); 176| 23.6k| last_seq.push_contents(*this); 177| | 178| 23.6k| return (*this); 179| 23.6k|} _ZN5Botan11DER_Encoder9raw_bytesEPKhm: 203| 20.4k|DER_Encoder& DER_Encoder::raw_bytes(const uint8_t bytes[], size_t length) { 204| 20.4k| if(!m_subsequences.empty()) { ------------------ | Branch (204:7): [True: 20.4k, False: 0] ------------------ 205| 20.4k| m_subsequences[m_subsequences.size() - 1].add_bytes(bytes, length); 206| 20.4k| } 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| 20.4k| return (*this); 213| 20.4k|} _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassEPKhm: 218| 29.9k|DER_Encoder& DER_Encoder::add_object(ASN1_Type type_tag, ASN1_Class class_tag, const uint8_t rep[], size_t length) { 219| 29.9k| std::vector hdr; 220| 29.9k| encode_tag(hdr, type_tag, class_tag); 221| 29.9k| encode_length(hdr, length); 222| | 223| 29.9k| if(!m_subsequences.empty()) { ------------------ | Branch (223:7): [True: 12.6k, False: 17.3k] ------------------ 224| 12.6k| m_subsequences[m_subsequences.size() - 1].add_bytes(hdr.data(), hdr.size(), rep, length); 225| 17.3k| } else if(m_append_output) { ------------------ | Branch (225:14): [True: 17.3k, False: 0] ------------------ 226| 17.3k| m_append_output(hdr.data(), hdr.size()); 227| 17.3k| m_append_output(rep, length); 228| 17.3k| } else { 229| 0| m_default_outbuf += hdr; 230| 0| m_default_outbuf += std::make_pair(rep, length); 231| 0| } 232| | 233| 29.9k| return (*this); 234| 29.9k|} _ZN5Botan11DER_Encoder6encodeERKNS_6BigIntE: 256| 516|DER_Encoder& DER_Encoder::encode(const BigInt& n) { return encode(n, ASN1_Type::Integer, ASN1_Class::Universal); } _ZN5Botan11DER_Encoder6encodeEPKhmNS_9ASN1_TypeE: 261| 2.89k|DER_Encoder& DER_Encoder::encode(const uint8_t bytes[], size_t length, ASN1_Type real_type) { 262| 2.89k| return encode(bytes, length, real_type, real_type, ASN1_Class::Universal); 263| 2.89k|} _ZN5Botan11DER_Encoder6encodeERKNS_6BigIntENS_9ASN1_TypeENS_10ASN1_ClassE: 283| 516|DER_Encoder& DER_Encoder::encode(const BigInt& n, ASN1_Type type_tag, ASN1_Class class_tag) { 284| 516| if(n == 0) { ------------------ | Branch (284:7): [True: 19, False: 497] ------------------ 285| 19| return add_object(type_tag, class_tag, 0); 286| 19| } 287| | 288| 497| const size_t extra_zero = (n.bits() % 8 == 0) ? 1 : 0; ------------------ | Branch (288:30): [True: 6, False: 491] ------------------ 289| 497| secure_vector contents(extra_zero + n.bytes()); 290| 497| n.binary_encode(&contents[extra_zero]); 291| 497| if(n < 0) { ------------------ | Branch (291:7): [True: 0, False: 497] ------------------ 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| 497| return add_object(type_tag, class_tag, contents); 303| 516|} _ZN5Botan11DER_Encoder6encodeEPKhmNS_9ASN1_TypeES3_NS_10ASN1_ClassE: 309| 2.89k| const uint8_t bytes[], size_t length, ASN1_Type real_type, ASN1_Type type_tag, ASN1_Class class_tag) { 310| 2.89k| if(real_type != ASN1_Type::OctetString && real_type != ASN1_Type::BitString) { ------------------ | Branch (310:7): [True: 2.89k, False: 0] | Branch (310:46): [True: 0, False: 2.89k] ------------------ 311| 0| throw Invalid_Argument("DER_Encoder: Invalid tag for byte/bit string"); 312| 0| } 313| | 314| 2.89k| if(real_type == ASN1_Type::BitString) { ------------------ | Branch (314:7): [True: 2.89k, False: 0] ------------------ 315| 2.89k| secure_vector encoded; 316| 2.89k| encoded.push_back(0); 317| 2.89k| encoded += std::make_pair(bytes, length); 318| 2.89k| return add_object(type_tag, class_tag, encoded); 319| 2.89k| } else { 320| 0| return add_object(type_tag, class_tag, bytes, length); 321| 0| } 322| 2.89k|} _ZN5Botan11DER_Encoder6encodeERKNS_11ASN1_ObjectE: 324| 6.74k|DER_Encoder& DER_Encoder::encode(const ASN1_Object& obj) { 325| 6.74k| obj.encode_into(*this); 326| 6.74k| return (*this); 327| 6.74k|} _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassEh: 341| 19|DER_Encoder& DER_Encoder::add_object(ASN1_Type type_tag, ASN1_Class class_tag, uint8_t rep) { 342| 19| return add_object(type_tag, class_tag, &rep, 1); 343| 19|} der_enc.cpp:_ZN5Botan12_GLOBAL__N_110encode_tagERNSt3__16vectorIhNS1_9allocatorIhEEEENS_9ASN1_TypeENS_10ASN1_ClassE: 24| 29.9k|void encode_tag(std::vector& encoded_tag, ASN1_Type type_tag_e, ASN1_Class class_tag_e) { 25| 29.9k| const uint32_t type_tag = static_cast(type_tag_e); 26| 29.9k| const uint32_t class_tag = static_cast(class_tag_e); 27| | 28| 29.9k| if((class_tag | 0xE0) != 0xE0) { ------------------ | Branch (28:7): [True: 0, False: 29.9k] ------------------ 29| 0| throw Encoding_Error(fmt("DER_Encoder: Invalid class tag {}", std::to_string(class_tag))); 30| 0| } 31| | 32| 29.9k| if(type_tag <= 30) { ------------------ | Branch (32:7): [True: 29.9k, False: 0] ------------------ 33| 29.9k| encoded_tag.push_back(static_cast(type_tag | class_tag)); 34| 29.9k| } else { 35| 0| size_t blocks = high_bit(static_cast(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(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| 29.9k|} der_enc.cpp:_ZN5Botan12_GLOBAL__N_113encode_lengthERNSt3__16vectorIhNS1_9allocatorIhEEEEm: 51| 29.9k|void encode_length(std::vector& encoded_length, size_t length) { 52| 29.9k| if(length <= 127) { ------------------ | Branch (52:7): [True: 21.3k, False: 8.66k] ------------------ 53| 21.3k| encoded_length.push_back(static_cast(length)); 54| 21.3k| } else { 55| 8.66k| const size_t bytes_needed = significant_bytes(length); 56| | 57| 8.66k| encoded_length.push_back(static_cast(0x80 | bytes_needed)); 58| | 59| 21.4k| for(size_t i = sizeof(length) - bytes_needed; i < sizeof(length); ++i) { ------------------ | Branch (59:53): [True: 12.8k, False: 8.66k] ------------------ 60| 12.8k| encoded_length.push_back(get_byte_var(i, length)); 61| 12.8k| } 62| 8.66k| } 63| 29.9k|} der_enc.cpp:_ZZN5Botan11DER_EncoderC1ERNSt3__16vectorIhNS1_9allocatorIhEEEEENK3$_1clEPKhm: 72| 34.7k| 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| 8.79k|OID_Map& OID_Map::global_registry() { 17| 8.79k| static OID_Map g_map; 18| 8.79k| return g_map; 19| 8.79k|} _ZN5Botan7OID_Map7oid2strERKNS_3OIDE: 56| 7.80k|std::string OID_Map::oid2str(const OID& oid) { 57| 7.80k| const std::string oid_str = oid.to_string(); 58| | 59| 7.80k| lock_guard_type lock(m_mutex); 60| | 61| 7.80k| auto i = m_oid2str.find(oid_str); 62| 7.80k| if(i != m_oid2str.end()) { ------------------ | Branch (62:7): [True: 4.35k, False: 3.44k] ------------------ 63| 4.35k| return i->second; 64| 4.35k| } 65| | 66| 3.44k| return ""; 67| 7.80k|} _ZN5Botan7OID_Map7str2oidENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 69| 998|OID OID_Map::str2oid(std::string_view str) { 70| 998| lock_guard_type lock(m_mutex); 71| 998| auto i = m_str2oid.find(std::string(str)); 72| 998| if(i != m_str2oid.end()) { ------------------ | Branch (72:7): [True: 998, False: 0] ------------------ 73| 998| return i->second; 74| 998| } 75| | 76| 0| return OID(); 77| 998|} _ZN5Botan7OID_Map16load_oid2str_mapEv: 17| 1|std::unordered_map OID_Map::load_oid2str_map() { 18| 1| return std::unordered_map{ 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 OID_Map::load_str2oid_map() { 276| 1| return std::unordered_map{ 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| 58|PSS_Params::PSS_Params(const uint8_t der[], size_t der_len) { 38| 58| BER_Decoder decoder(der, der_len); 39| 58| this->decode_from(decoder); 40| 58|} _ZN5Botan10PSS_Params11decode_fromERNS_11BER_DecoderE: 67| 58|void PSS_Params::decode_from(BER_Decoder& from) { 68| 58| const AlgorithmIdentifier default_hash("SHA-1", AlgorithmIdentifier::USE_NULL_PARAM); 69| 58| const AlgorithmIdentifier default_mgf("MGF1", default_hash.BER_encode()); 70| 58| const size_t default_salt_len = 20; 71| 58| const size_t default_trailer = 1; 72| | 73| 58| from.start_sequence() 74| 58| .decode_optional(m_hash, ASN1_Type(0), ASN1_Class::ExplicitContextSpecific, default_hash) 75| 58| .decode_optional(m_mgf, ASN1_Type(1), ASN1_Class::ExplicitContextSpecific, default_mgf) 76| 58| .decode_optional(m_salt_len, ASN1_Type(2), ASN1_Class::ExplicitContextSpecific, default_salt_len) 77| 58| .decode_optional(m_trailer_field, ASN1_Type(3), ASN1_Class::ExplicitContextSpecific, default_trailer) 78| 58| .end_cons(); 79| | 80| 58| BER_Decoder(m_mgf.parameters()).decode(m_mgf_hash); 81| 58|} _ZN5Botan20Buffered_Computation9update_beEj: 19| 228|void Buffered_Computation::update_be(uint32_t val) { 20| 228| uint8_t inb[sizeof(val)]; 21| 228| store_be(val, inb); 22| 228| add_data(inb, sizeof(inb)); 23| 228|} _ZN5Botan13base64_decodeEPKcmb: 174| 134|secure_vector base64_decode(const char input[], size_t input_length, bool ignore_ws) { 175| 134| return base_decode_to_vec>(Base64(), input, input_length, ignore_ws); 176| 134|} base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6417decode_max_outputEm: 41| 268| static inline size_t decode_max_output(size_t input_length) { 42| 268| return (round_up(input_length, m_encoding_bytes_out) * m_encoding_bytes_in) / m_encoding_bytes_out; 43| 268| } base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6417decoding_bytes_inEv: 29| 134| static inline size_t decoding_bytes_in() noexcept { return m_encoding_bytes_out; } base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6418decoding_bytes_outEv: 31| 134| static inline size_t decoding_bytes_out() noexcept { return m_encoding_bytes_in; } base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6419lookup_binary_valueEc: 103| 24.5k|uint8_t Base64::lookup_binary_value(char input) noexcept { 104| 24.5k| const uint8_t c = static_cast(input); 105| | 106| 24.5k| const auto is_alpha_upper = CT::Mask::is_within_range(c, uint8_t('A'), uint8_t('Z')); 107| 24.5k| const auto is_alpha_lower = CT::Mask::is_within_range(c, uint8_t('a'), uint8_t('z')); 108| 24.5k| const auto is_decimal = CT::Mask::is_within_range(c, uint8_t('0'), uint8_t('9')); 109| | 110| 24.5k| const auto is_plus = CT::Mask::is_equal(c, uint8_t('+')); 111| 24.5k| const auto is_slash = CT::Mask::is_equal(c, uint8_t('/')); 112| 24.5k| const auto is_equal = CT::Mask::is_equal(c, uint8_t('=')); 113| | 114| 24.5k| const auto is_whitespace = 115| 24.5k| CT::Mask::is_any_of(c, {uint8_t(' '), uint8_t('\t'), uint8_t('\n'), uint8_t('\r')}); 116| | 117| 24.5k| const uint8_t c_upper = c - uint8_t('A'); 118| 24.5k| const uint8_t c_lower = c - uint8_t('a') + 26; 119| 24.5k| const uint8_t c_decim = c - uint8_t('0') + 2 * 26; 120| | 121| 24.5k| uint8_t ret = 0xFF; // default value 122| | 123| 24.5k| ret = is_alpha_upper.select(c_upper, ret); 124| 24.5k| ret = is_alpha_lower.select(c_lower, ret); 125| 24.5k| ret = is_decimal.select(c_decim, ret); 126| 24.5k| ret = is_plus.select(62, ret); 127| 24.5k| ret = is_slash.select(63, ret); 128| 24.5k| ret = is_equal.select(0x81, ret); 129| 24.5k| ret = is_whitespace.select(0x80, ret); 130| | 131| 24.5k| return ret; 132| 24.5k|} base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6414check_bad_charEhcb: 135| 24.0k|bool Base64::check_bad_char(uint8_t bin, char input, bool ignore_ws) { 136| 24.0k| if(bin <= 0x3F) { ------------------ | Branch (136:7): [True: 20.7k, False: 3.32k] ------------------ 137| 20.7k| return true; 138| 20.7k| } else if(!(bin == 0x81 || (bin == 0x80 && ignore_ws))) { ------------------ | Branch (138:16): [True: 281, False: 3.04k] | Branch (138:32): [True: 3.01k, False: 29] | Branch (138:47): [True: 3.01k, False: 0] ------------------ 139| 29| throw Invalid_Argument(fmt("base64_decode: invalid character '{}'", format_char_for_display(input))); 140| 29| } 141| 3.29k| return false; 142| 24.0k|} base64.cpp:_ZN5Botan12_GLOBAL__N_16Base646decodeEPhPKh: 51| 5.19k| static void decode(uint8_t* out_ptr, const uint8_t decode_buf[4]) { 52| 5.19k| out_ptr[0] = (decode_buf[0] << 2) | (decode_buf[1] >> 4); 53| 5.19k| out_ptr[1] = (decode_buf[1] << 4) | (decode_buf[2] >> 2); 54| 5.19k| out_ptr[2] = (decode_buf[2] << 6) | decode_buf[3]; 55| 5.19k| } base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6415bytes_to_removeEm: 57| 105| static inline size_t bytes_to_remove(size_t final_truncate) { return final_truncate; } base64.cpp:_ZN5Botan12_GLOBAL__N_16Base644nameEv: 23| 24| static inline std::string name() noexcept { return "base64"; } _ZN5Botan10hex_encodeEPcPKhmb: 33| 5.79k|void hex_encode(char output[], const uint8_t input[], size_t input_length, bool uppercase) { 34| 156k| for(size_t i = 0; i != input_length; ++i) { ------------------ | Branch (34:22): [True: 150k, False: 5.79k] ------------------ 35| 150k| const uint8_t n0 = (input[i] >> 4) & 0xF; 36| 150k| const uint8_t n1 = (input[i]) & 0xF; 37| | 38| 150k| output[2 * i] = hex_encode_nibble(n0, uppercase); 39| 150k| output[2 * i + 1] = hex_encode_nibble(n1, uppercase); 40| 150k| } 41| 5.79k|} _ZN5Botan10hex_encodeEPKhmb: 43| 5.79k|std::string hex_encode(const uint8_t input[], size_t input_length, bool uppercase) { 44| 5.79k| std::string output(2 * input_length, 0); 45| | 46| 5.79k| if(input_length) { ------------------ | Branch (46:7): [True: 5.79k, False: 0] ------------------ 47| 5.79k| hex_encode(&output.front(), input, input_length, uppercase); 48| 5.79k| } 49| | 50| 5.79k| return output; 51| 5.79k|} _ZN5Botan10hex_decodeEPhPKcmRmb: 81| 767|size_t hex_decode(uint8_t output[], const char input[], size_t input_length, size_t& input_consumed, bool ignore_ws) { 82| 767| uint8_t* out_ptr = output; 83| 767| bool top_nibble = true; 84| | 85| 767| clear_mem(output, input_length / 2); 86| | 87| 40.6k| for(size_t i = 0; i != input_length; ++i) { ------------------ | Branch (87:22): [True: 39.9k, False: 767] ------------------ 88| 39.9k| const uint8_t bin = hex_char_to_bin(input[i]); 89| | 90| 39.9k| if(bin >= 0x10) { ------------------ | Branch (90:10): [True: 0, False: 39.9k] ------------------ 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| 39.9k| if(top_nibble) { ------------------ | Branch (98:10): [True: 19.9k, False: 19.9k] ------------------ 99| 19.9k| *out_ptr |= bin << 4; 100| 19.9k| } else { 101| 19.9k| *out_ptr |= bin; 102| 19.9k| } 103| | 104| 39.9k| top_nibble = !top_nibble; 105| 39.9k| if(top_nibble) { ------------------ | Branch (105:10): [True: 19.9k, False: 19.9k] ------------------ 106| 19.9k| ++out_ptr; 107| 19.9k| } 108| 39.9k| } 109| | 110| 767| input_consumed = input_length; 111| 767| 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| 767| if(!top_nibble) { ------------------ | Branch (117:7): [True: 0, False: 767] ------------------ 118| 0| *out_ptr = 0; 119| 0| input_consumed -= 1; 120| 0| } 121| | 122| 767| return written; 123| 767|} _ZN5Botan10hex_decodeEPhPKcmb: 125| 767|size_t hex_decode(uint8_t output[], const char input[], size_t input_length, bool ignore_ws) { 126| 767| size_t consumed = 0; 127| 767| size_t written = hex_decode(output, input, input_length, consumed, ignore_ws); 128| | 129| 767| if(consumed != input_length) { ------------------ | Branch (129:7): [True: 0, False: 767] ------------------ 130| 0| throw Invalid_Argument("hex_decode: input did not have full bytes"); 131| 0| } 132| | 133| 767| return written; 134| 767|} _ZN5Botan17hex_decode_lockedEPKcmb: 144| 767|secure_vector hex_decode_locked(const char input[], size_t input_length, bool ignore_ws) { 145| 767| secure_vector bin(1 + input_length / 2); 146| | 147| 767| size_t written = hex_decode(bin.data(), input, input_length, ignore_ws); 148| | 149| 767| bin.resize(written); 150| 767| return bin; 151| 767|} hex.cpp:_ZN5Botan12_GLOBAL__N_117hex_encode_nibbleEhb: 20| 301k|char hex_encode_nibble(uint8_t n, bool uppercase) { 21| 301k| BOTAN_DEBUG_ASSERT(n <= 15); ------------------ | | 99| 301k| do { \ | | 100| 301k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 22| | 23| 301k| const auto in_09 = CT::Mask::is_lt(n, 10); 24| | 25| 301k| const char c_09 = n + '0'; 26| 301k| const char c_af = n + (uppercase ? 'A' : 'a') - 10; ------------------ | Branch (26:27): [True: 301k, False: 0] ------------------ 27| | 28| 301k| return in_09.select(c_09, c_af); 29| 301k|} hex.cpp:_ZN5Botan12_GLOBAL__N_115hex_char_to_binEc: 55| 39.9k|uint8_t hex_char_to_bin(char input) { 56| 39.9k| const uint8_t c = static_cast(input); 57| | 58| 39.9k| const auto is_alpha_upper = CT::Mask::is_within_range(c, uint8_t('A'), uint8_t('F')); 59| 39.9k| const auto is_alpha_lower = CT::Mask::is_within_range(c, uint8_t('a'), uint8_t('f')); 60| 39.9k| const auto is_decimal = CT::Mask::is_within_range(c, uint8_t('0'), uint8_t('9')); 61| | 62| 39.9k| const auto is_whitespace = 63| 39.9k| CT::Mask::is_any_of(c, {uint8_t(' '), uint8_t('\t'), uint8_t('\n'), uint8_t('\r')}); 64| | 65| 39.9k| const uint8_t c_upper = c - uint8_t('A') + 10; 66| 39.9k| const uint8_t c_lower = c - uint8_t('a') + 10; 67| 39.9k| const uint8_t c_decim = c - uint8_t('0'); 68| | 69| 39.9k| uint8_t ret = 0xFF; // default value 70| | 71| 39.9k| ret = is_alpha_upper.select(c_upper, ret); 72| 39.9k| ret = is_alpha_lower.select(c_lower, ret); 73| 39.9k| ret = is_decimal.select(c_decim, ret); 74| 39.9k| ret = is_whitespace.select(0x80, ret); 75| | 76| 39.9k| return ret; 77| 39.9k|} _ZN5Botan12HashFunction6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 103| 12.5k|std::unique_ptr 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| 12.5k| if(provider.empty() == false && provider != "base") { ------------------ | Branch (114:7): [True: 0, False: 12.5k] | Branch (114:36): [True: 0, False: 0] ------------------ 115| 0| return nullptr; // unknown provider 116| 0| } 117| | 118| 12.5k|#if defined(BOTAN_HAS_SHA1) 119| 12.5k| if(algo_spec == "SHA-1") { ------------------ | Branch (119:7): [True: 5.95k, False: 6.57k] ------------------ 120| 5.95k| return std::make_unique(); 121| 5.95k| } 122| 6.57k|#endif 123| | 124| 6.57k|#if defined(BOTAN_HAS_SHA2_32) 125| 6.57k| if(algo_spec == "SHA-224") { ------------------ | Branch (125:7): [True: 67, False: 6.51k] ------------------ 126| 67| return std::make_unique(); 127| 67| } 128| | 129| 6.51k| if(algo_spec == "SHA-256") { ------------------ | Branch (129:7): [True: 5.86k, False: 646] ------------------ 130| 5.86k| return std::make_unique(); 131| 5.86k| } 132| 646|#endif 133| | 134| 646|#if defined(BOTAN_HAS_SHA2_64) 135| 646| if(algo_spec == "SHA-384") { ------------------ | Branch (135:7): [True: 388, False: 258] ------------------ 136| 388| return std::make_unique(); 137| 388| } 138| | 139| 258| if(algo_spec == "SHA-512") { ------------------ | Branch (139:7): [True: 40, False: 218] ------------------ 140| 40| return std::make_unique(); 141| 40| } 142| | 143| 218| if(algo_spec == "SHA-512-256") { ------------------ | Branch (143:7): [True: 17, False: 201] ------------------ 144| 17| return std::make_unique(); 145| 17| } 146| 201|#endif 147| | 148| 201|#if defined(BOTAN_HAS_RIPEMD_160) 149| 201| if(algo_spec == "RIPEMD-160") { ------------------ | Branch (149:7): [True: 0, False: 201] ------------------ 150| 0| return std::make_unique(); 151| 0| } 152| 201|#endif 153| | 154| 201|#if defined(BOTAN_HAS_WHIRLPOOL) 155| 201| if(algo_spec == "Whirlpool") { ------------------ | Branch (155:7): [True: 0, False: 201] ------------------ 156| 0| return std::make_unique(); 157| 0| } 158| 201|#endif 159| | 160| 201|#if defined(BOTAN_HAS_MD5) 161| 201| if(algo_spec == "MD5") { ------------------ | Branch (161:7): [True: 127, False: 74] ------------------ 162| 127| return std::make_unique(); 163| 127| } 164| 74|#endif 165| | 166| 74|#if defined(BOTAN_HAS_MD4) 167| 74| if(algo_spec == "MD4") { ------------------ | Branch (167:7): [True: 0, False: 74] ------------------ 168| 0| return std::make_unique(); 169| 0| } 170| 74|#endif 171| | 172| 74|#if defined(BOTAN_HAS_GOST_34_11) 173| 74| if(algo_spec == "GOST-R-34.11-94" || algo_spec == "GOST-34.11") { ------------------ | Branch (173:7): [True: 0, False: 74] | Branch (173:41): [True: 0, False: 74] ------------------ 174| 0| return std::make_unique(); 175| 0| } 176| 74|#endif 177| | 178| 74|#if defined(BOTAN_HAS_ADLER32) 179| 74| if(algo_spec == "Adler32") { ------------------ | Branch (179:7): [True: 0, False: 74] ------------------ 180| 0| return std::make_unique(); 181| 0| } 182| 74|#endif 183| | 184| 74|#if defined(BOTAN_HAS_CRC24) 185| 74| if(algo_spec == "CRC24") { ------------------ | Branch (185:7): [True: 0, False: 74] ------------------ 186| 0| return std::make_unique(); 187| 0| } 188| 74|#endif 189| | 190| 74|#if defined(BOTAN_HAS_CRC32) 191| 74| if(algo_spec == "CRC32") { ------------------ | Branch (191:7): [True: 0, False: 74] ------------------ 192| 0| return std::make_unique(); 193| 0| } 194| 74|#endif 195| | 196| 74|#if defined(BOTAN_HAS_STREEBOG) 197| 74| if(algo_spec == "Streebog-256") { ------------------ | Branch (197:7): [True: 74, False: 0] ------------------ 198| 74| return std::make_unique(256); 199| 74| } 200| 0| if(algo_spec == "Streebog-512") { ------------------ | Branch (200:7): [True: 0, False: 0] ------------------ 201| 0| return std::make_unique(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(); 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(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(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(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(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(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(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> 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(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(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(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| 6.25k|std::unique_ptr HashFunction::create_or_throw(std::string_view algo, std::string_view provider) { 289| 6.25k| if(auto hash = HashFunction::create(algo, provider)) { ------------------ | Branch (289:12): [True: 6.25k, False: 0] ------------------ 290| 6.25k| return hash; 291| 6.25k| } 292| 0| throw Lookup_Error("Hash", algo, provider); 293| 6.25k|} _ZN5Botan3MD510compress_nEPKhm: 62| 255|void MD5::compress_n(const uint8_t input[], size_t blocks) { 63| 255| uint32_t A = m_digest[0], B = m_digest[1], C = m_digest[2], D = m_digest[3]; 64| | 65| 783| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (65:22): [True: 528, False: 255] ------------------ 66| 528| load_le(m_M.data(), input, m_M.size()); 67| | 68| 528| FF<7>(A, B, C, D, m_M[0] + 0xD76AA478); 69| 528| FF<12>(D, A, B, C, m_M[1] + 0xE8C7B756); 70| 528| FF<17>(C, D, A, B, m_M[2] + 0x242070DB); 71| 528| FF<22>(B, C, D, A, m_M[3] + 0xC1BDCEEE); 72| 528| FF<7>(A, B, C, D, m_M[4] + 0xF57C0FAF); 73| 528| FF<12>(D, A, B, C, m_M[5] + 0x4787C62A); 74| 528| FF<17>(C, D, A, B, m_M[6] + 0xA8304613); 75| 528| FF<22>(B, C, D, A, m_M[7] + 0xFD469501); 76| 528| FF<7>(A, B, C, D, m_M[8] + 0x698098D8); 77| 528| FF<12>(D, A, B, C, m_M[9] + 0x8B44F7AF); 78| 528| FF<17>(C, D, A, B, m_M[10] + 0xFFFF5BB1); 79| 528| FF<22>(B, C, D, A, m_M[11] + 0x895CD7BE); 80| 528| FF<7>(A, B, C, D, m_M[12] + 0x6B901122); 81| 528| FF<12>(D, A, B, C, m_M[13] + 0xFD987193); 82| 528| FF<17>(C, D, A, B, m_M[14] + 0xA679438E); 83| 528| FF<22>(B, C, D, A, m_M[15] + 0x49B40821); 84| | 85| 528| GG<5>(A, B, C, D, m_M[1] + 0xF61E2562); 86| 528| GG<9>(D, A, B, C, m_M[6] + 0xC040B340); 87| 528| GG<14>(C, D, A, B, m_M[11] + 0x265E5A51); 88| 528| GG<20>(B, C, D, A, m_M[0] + 0xE9B6C7AA); 89| 528| GG<5>(A, B, C, D, m_M[5] + 0xD62F105D); 90| 528| GG<9>(D, A, B, C, m_M[10] + 0x02441453); 91| 528| GG<14>(C, D, A, B, m_M[15] + 0xD8A1E681); 92| 528| GG<20>(B, C, D, A, m_M[4] + 0xE7D3FBC8); 93| 528| GG<5>(A, B, C, D, m_M[9] + 0x21E1CDE6); 94| 528| GG<9>(D, A, B, C, m_M[14] + 0xC33707D6); 95| 528| GG<14>(C, D, A, B, m_M[3] + 0xF4D50D87); 96| 528| GG<20>(B, C, D, A, m_M[8] + 0x455A14ED); 97| 528| GG<5>(A, B, C, D, m_M[13] + 0xA9E3E905); 98| 528| GG<9>(D, A, B, C, m_M[2] + 0xFCEFA3F8); 99| 528| GG<14>(C, D, A, B, m_M[7] + 0x676F02D9); 100| 528| GG<20>(B, C, D, A, m_M[12] + 0x8D2A4C8A); 101| | 102| 528| HH<4>(A, B, C, D, m_M[5] + 0xFFFA3942); 103| 528| HH<11>(D, A, B, C, m_M[8] + 0x8771F681); 104| 528| HH<16>(C, D, A, B, m_M[11] + 0x6D9D6122); 105| 528| HH<23>(B, C, D, A, m_M[14] + 0xFDE5380C); 106| 528| HH<4>(A, B, C, D, m_M[1] + 0xA4BEEA44); 107| 528| HH<11>(D, A, B, C, m_M[4] + 0x4BDECFA9); 108| 528| HH<16>(C, D, A, B, m_M[7] + 0xF6BB4B60); 109| 528| HH<23>(B, C, D, A, m_M[10] + 0xBEBFBC70); 110| 528| HH<4>(A, B, C, D, m_M[13] + 0x289B7EC6); 111| 528| HH<11>(D, A, B, C, m_M[0] + 0xEAA127FA); 112| 528| HH<16>(C, D, A, B, m_M[3] + 0xD4EF3085); 113| 528| HH<23>(B, C, D, A, m_M[6] + 0x04881D05); 114| 528| HH<4>(A, B, C, D, m_M[9] + 0xD9D4D039); 115| 528| HH<11>(D, A, B, C, m_M[12] + 0xE6DB99E5); 116| 528| HH<16>(C, D, A, B, m_M[15] + 0x1FA27CF8); 117| 528| HH<23>(B, C, D, A, m_M[2] + 0xC4AC5665); 118| | 119| 528| II<6>(A, B, C, D, m_M[0] + 0xF4292244); 120| 528| II<10>(D, A, B, C, m_M[7] + 0x432AFF97); 121| 528| II<15>(C, D, A, B, m_M[14] + 0xAB9423A7); 122| 528| II<21>(B, C, D, A, m_M[5] + 0xFC93A039); 123| 528| II<6>(A, B, C, D, m_M[12] + 0x655B59C3); 124| 528| II<10>(D, A, B, C, m_M[3] + 0x8F0CCC92); 125| 528| II<15>(C, D, A, B, m_M[10] + 0xFFEFF47D); 126| 528| II<21>(B, C, D, A, m_M[1] + 0x85845DD1); 127| 528| II<6>(A, B, C, D, m_M[8] + 0x6FA87E4F); 128| 528| II<10>(D, A, B, C, m_M[15] + 0xFE2CE6E0); 129| 528| II<15>(C, D, A, B, m_M[6] + 0xA3014314); 130| 528| II<21>(B, C, D, A, m_M[13] + 0x4E0811A1); 131| 528| II<6>(A, B, C, D, m_M[4] + 0xF7537E82); 132| 528| II<10>(D, A, B, C, m_M[11] + 0xBD3AF235); 133| 528| II<15>(C, D, A, B, m_M[2] + 0x2AD7D2BB); 134| 528| II<21>(B, C, D, A, m_M[9] + 0xEB86D391); 135| | 136| 528| A = (m_digest[0] += A); 137| 528| B = (m_digest[1] += B); 138| 528| C = (m_digest[2] += C); 139| 528| D = (m_digest[3] += D); 140| | 141| 528| input += hash_block_size(); 142| 528| } 143| 255|} _ZN5Botan3MD58copy_outEPh: 148| 127|void MD5::copy_out(uint8_t output[]) { copy_out_vec_le(output, output_length(), m_digest); } _ZN5Botan3MD55clearEv: 153| 254|void MD5::clear() { 154| 254| MDx_HashFunction::clear(); 155| 254| zeroise(m_M); 156| 254| m_digest[0] = 0x67452301; 157| 254| m_digest[1] = 0xEFCDAB89; 158| 254| m_digest[2] = 0x98BADCFE; 159| 254| m_digest[3] = 0x10325476; 160| 254|} md5.cpp:_ZN5Botan12_GLOBAL__N_12FFILm7EEEvRjjjjj: 24| 2.11k|inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) { 25| 2.11k| A += choose(B, C, D) + M; 26| 2.11k| A = rotl(A) + B; 27| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12FFILm12EEEvRjjjjj: 24| 2.11k|inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) { 25| 2.11k| A += choose(B, C, D) + M; 26| 2.11k| A = rotl(A) + B; 27| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12FFILm17EEEvRjjjjj: 24| 2.11k|inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) { 25| 2.11k| A += choose(B, C, D) + M; 26| 2.11k| A = rotl(A) + B; 27| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12FFILm22EEEvRjjjjj: 24| 2.11k|inline void FF(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) { 25| 2.11k| A += choose(B, C, D) + M; 26| 2.11k| A = rotl(A) + B; 27| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12GGILm5EEEvRjjjjj: 33| 2.11k|inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) { 34| 2.11k| A += choose(D, B, C) + M; 35| 2.11k| A = rotl(A) + B; 36| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12GGILm9EEEvRjjjjj: 33| 2.11k|inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) { 34| 2.11k| A += choose(D, B, C) + M; 35| 2.11k| A = rotl(A) + B; 36| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12GGILm14EEEvRjjjjj: 33| 2.11k|inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) { 34| 2.11k| A += choose(D, B, C) + M; 35| 2.11k| A = rotl(A) + B; 36| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12GGILm20EEEvRjjjjj: 33| 2.11k|inline void GG(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) { 34| 2.11k| A += choose(D, B, C) + M; 35| 2.11k| A = rotl(A) + B; 36| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12HHILm4EEEvRjjjjj: 42| 2.11k|inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) { 43| 2.11k| A += (B ^ C ^ D) + M; 44| 2.11k| A = rotl(A) + B; 45| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12HHILm11EEEvRjjjjj: 42| 2.11k|inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) { 43| 2.11k| A += (B ^ C ^ D) + M; 44| 2.11k| A = rotl(A) + B; 45| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12HHILm16EEEvRjjjjj: 42| 2.11k|inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) { 43| 2.11k| A += (B ^ C ^ D) + M; 44| 2.11k| A = rotl(A) + B; 45| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12HHILm23EEEvRjjjjj: 42| 2.11k|inline void HH(uint32_t& A, uint32_t B, uint32_t C, uint32_t D, uint32_t M) { 43| 2.11k| A += (B ^ C ^ D) + M; 44| 2.11k| A = rotl(A) + B; 45| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12IIILm6EEEvRjjjjj: 51| 2.11k|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| 2.11k| A += (C ^ (B | ~D)) + M; 54| 2.11k| A = rotl(A) + B; 55| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12IIILm10EEEvRjjjjj: 51| 2.11k|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| 2.11k| A += (C ^ (B | ~D)) + M; 54| 2.11k| A = rotl(A) + B; 55| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12IIILm15EEEvRjjjjj: 51| 2.11k|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| 2.11k| A += (C ^ (B | ~D)) + M; 54| 2.11k| A = rotl(A) + B; 55| 2.11k|} md5.cpp:_ZN5Botan12_GLOBAL__N_12IIILm21EEEvRjjjjj: 51| 2.11k|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| 2.11k| A += (C ^ (B | ~D)) + M; 54| 2.11k| A = rotl(A) + B; 55| 2.11k|} _ZN5Botan16MDx_HashFunctionC2Embbh: 26| 12.4k| m_position(0) { 27| 12.4k| if(!is_power_of_2(block_len)) { ------------------ | Branch (27:7): [True: 0, False: 12.4k] ------------------ 28| 0| throw Invalid_Argument("MDx_HashFunction block length must be a power of 2"); 29| 0| } 30| 12.4k| if(m_block_bits < 3 || m_block_bits > 16) { ------------------ | Branch (30:7): [True: 0, False: 12.4k] | Branch (30:27): [True: 0, False: 12.4k] ------------------ 31| 0| throw Invalid_Argument("MDx_HashFunction block size too large or too small"); 32| 0| } 33| 12.4k| if(m_counter_size < 8 || m_counter_size > block_len) { ------------------ | Branch (33:7): [True: 0, False: 12.4k] | Branch (33:29): [True: 0, False: 12.4k] ------------------ 34| 0| throw Invalid_State("MDx_HashFunction invalid counter length"); 35| 0| } 36| 12.4k|} _ZN5Botan16MDx_HashFunction5clearEv: 41| 28.0k|void MDx_HashFunction::clear() { 42| 28.0k| zeroise(m_buffer); 43| 28.0k| m_count = m_position = 0; 44| 28.0k|} _ZN5Botan16MDx_HashFunction8add_dataEPKhm: 49| 15.9k|void MDx_HashFunction::add_data(const uint8_t input[], size_t length) { 50| 15.9k| const size_t block_len = static_cast(1) << m_block_bits; 51| | 52| 15.9k| m_count += length; 53| | 54| 15.9k| if(m_position) { ------------------ | Branch (54:7): [True: 318, False: 15.5k] ------------------ 55| 318| buffer_insert(m_buffer, m_position, input, length); 56| | 57| 318| if(m_position + length >= block_len) { ------------------ | Branch (57:10): [True: 10, False: 308] ------------------ 58| 10| compress_n(m_buffer.data(), 1); 59| 10| input += (block_len - m_position); 60| 10| length -= (block_len - m_position); 61| 10| m_position = 0; 62| 10| } 63| 318| } 64| | 65| | // Just in case the compiler can't figure out block_len is a power of 2 66| 15.9k| const size_t full_blocks = length >> m_block_bits; 67| 15.9k| const size_t remaining = length & (block_len - 1); 68| | 69| 15.9k| if(full_blocks > 0) { ------------------ | Branch (69:7): [True: 8.86k, False: 7.04k] ------------------ 70| 8.86k| compress_n(input, full_blocks); 71| 8.86k| } 72| | 73| 15.9k| buffer_insert(m_buffer, m_position, input + full_blocks * block_len, remaining); 74| 15.9k| m_position += remaining; 75| 15.9k|} _ZN5Botan16MDx_HashFunction12final_resultEPh: 80| 15.5k|void MDx_HashFunction::final_result(uint8_t output[]) { 81| 15.5k| const size_t block_len = static_cast(1) << m_block_bits; 82| | 83| 15.5k| clear_mem(&m_buffer[m_position], block_len - m_position); 84| 15.5k| m_buffer[m_position] = m_pad_char; 85| | 86| 15.5k| if(m_position >= block_len - m_counter_size) { ------------------ | Branch (86:7): [True: 1.74k, False: 13.8k] ------------------ 87| 1.74k| compress_n(m_buffer.data(), 1); 88| 1.74k| zeroise(m_buffer); 89| 1.74k| } 90| | 91| 15.5k| BOTAN_ASSERT_NOMSG(m_counter_size <= output_length()); ------------------ | | 60| 15.5k| do { \ | | 61| 15.5k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 15.5k] | | ------------------ | | 62| 15.5k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 15.5k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 92| 15.5k| BOTAN_ASSERT_NOMSG(m_counter_size >= 8); ------------------ | | 60| 15.5k| do { \ | | 61| 15.5k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 15.5k] | | ------------------ | | 62| 15.5k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 15.5k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 93| | 94| 15.5k| const uint64_t bit_count = m_count * 8; 95| | 96| 15.5k| if(m_count_big_endian) { ------------------ | Branch (96:7): [True: 15.4k, False: 127] ------------------ 97| 15.4k| store_be(bit_count, &m_buffer[block_len - 8]); 98| 15.4k| } else { 99| 127| store_le(bit_count, &m_buffer[block_len - 8]); 100| 127| } 101| | 102| 15.5k| compress_n(m_buffer.data(), 1); 103| 15.5k| copy_out(output); 104| 15.5k| clear(); 105| 15.5k|} _ZN5Botan5SHA_110compress_nEPKhm: 62| 11.3k|void SHA_1::compress_n(const uint8_t input[], size_t blocks) { 63| 11.3k| using namespace SHA1_F; 64| | 65| 11.3k|#if defined(BOTAN_HAS_SHA1_X86_SHA_NI) 66| 11.3k| if(CPUID::has_intel_sha()) { ------------------ | Branch (66:7): [True: 0, False: 11.3k] ------------------ 67| 0| return sha1_compress_x86(m_digest, input, blocks); 68| 0| } 69| 11.3k|#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| 11.3k|#if defined(BOTAN_HAS_SHA1_SSE2) 78| 11.3k| if(CPUID::has_sse2()) { ------------------ | Branch (78:7): [True: 11.3k, False: 0] ------------------ 79| 11.3k| return sse2_compress_n(m_digest, input, blocks); 80| 11.3k| } 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| 5.99k|void SHA_1::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); } _ZN5Botan5SHA_15clearEv: 204| 11.9k|void SHA_1::clear() { 205| 11.9k| MDx_HashFunction::clear(); 206| 11.9k| zeroise(m_W); 207| 11.9k| m_digest[0] = 0x67452301; 208| 11.9k| m_digest[1] = 0xEFCDAB89; 209| 11.9k| m_digest[2] = 0x98BADCFE; 210| 11.9k| m_digest[3] = 0x10325476; 211| 11.9k| m_digest[4] = 0xC3D2E1F0; 212| 11.9k|} _ZN5Botan5SHA_115sse2_compress_nERNSt3__16vectorIjNS_16secure_allocatorIjEEEEPKhm: 115| 11.3k|void SHA_1::sse2_compress_n(secure_vector& digest, const uint8_t input[], size_t blocks) { 116| 11.3k| using namespace SHA1_SSE2_F; 117| | 118| 11.3k| const SIMD_4x32 K00_19 = SIMD_4x32::splat(0x5A827999); 119| 11.3k| const SIMD_4x32 K20_39 = SIMD_4x32::splat(0x6ED9EBA1); 120| 11.3k| const SIMD_4x32 K40_59 = SIMD_4x32::splat(0x8F1BBCDC); 121| 11.3k| const SIMD_4x32 K60_79 = SIMD_4x32::splat(0xCA62C1D6); 122| | 123| 11.3k| uint32_t A = digest[0], B = digest[1], C = digest[2], D = digest[3], E = digest[4]; 124| | 125| 44.7k| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (125:22): [True: 33.4k, False: 11.3k] ------------------ 126| 33.4k| uint32_t PT[4]; 127| | 128| 33.4k| SIMD_4x32 W0 = SIMD_4x32::load_be(&input[0]); 129| 33.4k| SIMD_4x32 W1 = SIMD_4x32::load_be(&input[16]); 130| 33.4k| SIMD_4x32 W2 = SIMD_4x32::load_be(&input[32]); 131| 33.4k| SIMD_4x32 W3 = SIMD_4x32::load_be(&input[48]); 132| | 133| 33.4k| SIMD_4x32 P0 = W0 + K00_19; 134| 33.4k| SIMD_4x32 P1 = W1 + K00_19; 135| 33.4k| SIMD_4x32 P2 = W2 + K00_19; 136| 33.4k| SIMD_4x32 P3 = W3 + K00_19; 137| | 138| 33.4k| SIMD_4x32(P0).store_le(PT); 139| 33.4k| F1(A, B, C, D, E, PT[0]); 140| 33.4k| F1(E, A, B, C, D, PT[1]); 141| 33.4k| F1(D, E, A, B, C, PT[2]); 142| 33.4k| F1(C, D, E, A, B, PT[3]); 143| 33.4k| P0 = prep(W0, W1, W2, W3, K00_19); 144| | 145| 33.4k| SIMD_4x32(P1).store_le(PT); 146| 33.4k| F1(B, C, D, E, A, PT[0]); 147| 33.4k| F1(A, B, C, D, E, PT[1]); 148| 33.4k| F1(E, A, B, C, D, PT[2]); 149| 33.4k| F1(D, E, A, B, C, PT[3]); 150| 33.4k| P1 = prep(W1, W2, W3, W0, K20_39); 151| | 152| 33.4k| SIMD_4x32(P2).store_le(PT); 153| 33.4k| F1(C, D, E, A, B, PT[0]); 154| 33.4k| F1(B, C, D, E, A, PT[1]); 155| 33.4k| F1(A, B, C, D, E, PT[2]); 156| 33.4k| F1(E, A, B, C, D, PT[3]); 157| 33.4k| P2 = prep(W2, W3, W0, W1, K20_39); 158| | 159| 33.4k| SIMD_4x32(P3).store_le(PT); 160| 33.4k| F1(D, E, A, B, C, PT[0]); 161| 33.4k| F1(C, D, E, A, B, PT[1]); 162| 33.4k| F1(B, C, D, E, A, PT[2]); 163| 33.4k| F1(A, B, C, D, E, PT[3]); 164| 33.4k| P3 = prep(W3, W0, W1, W2, K20_39); 165| | 166| 33.4k| SIMD_4x32(P0).store_le(PT); 167| 33.4k| F1(E, A, B, C, D, PT[0]); 168| 33.4k| F1(D, E, A, B, C, PT[1]); 169| 33.4k| F1(C, D, E, A, B, PT[2]); 170| 33.4k| F1(B, C, D, E, A, PT[3]); 171| 33.4k| P0 = prep(W0, W1, W2, W3, K20_39); 172| | 173| 33.4k| SIMD_4x32(P1).store_le(PT); 174| 33.4k| F2(A, B, C, D, E, PT[0]); 175| 33.4k| F2(E, A, B, C, D, PT[1]); 176| 33.4k| F2(D, E, A, B, C, PT[2]); 177| 33.4k| F2(C, D, E, A, B, PT[3]); 178| 33.4k| P1 = prep(W1, W2, W3, W0, K20_39); 179| | 180| 33.4k| SIMD_4x32(P2).store_le(PT); 181| 33.4k| F2(B, C, D, E, A, PT[0]); 182| 33.4k| F2(A, B, C, D, E, PT[1]); 183| 33.4k| F2(E, A, B, C, D, PT[2]); 184| 33.4k| F2(D, E, A, B, C, PT[3]); 185| 33.4k| P2 = prep(W2, W3, W0, W1, K40_59); 186| | 187| 33.4k| SIMD_4x32(P3).store_le(PT); 188| 33.4k| F2(C, D, E, A, B, PT[0]); 189| 33.4k| F2(B, C, D, E, A, PT[1]); 190| 33.4k| F2(A, B, C, D, E, PT[2]); 191| 33.4k| F2(E, A, B, C, D, PT[3]); 192| 33.4k| P3 = prep(W3, W0, W1, W2, K40_59); 193| | 194| 33.4k| SIMD_4x32(P0).store_le(PT); 195| 33.4k| F2(D, E, A, B, C, PT[0]); 196| 33.4k| F2(C, D, E, A, B, PT[1]); 197| 33.4k| F2(B, C, D, E, A, PT[2]); 198| 33.4k| F2(A, B, C, D, E, PT[3]); 199| 33.4k| P0 = prep(W0, W1, W2, W3, K40_59); 200| | 201| 33.4k| SIMD_4x32(P1).store_le(PT); 202| 33.4k| F2(E, A, B, C, D, PT[0]); 203| 33.4k| F2(D, E, A, B, C, PT[1]); 204| 33.4k| F2(C, D, E, A, B, PT[2]); 205| 33.4k| F2(B, C, D, E, A, PT[3]); 206| 33.4k| P1 = prep(W1, W2, W3, W0, K40_59); 207| | 208| 33.4k| SIMD_4x32(P2).store_le(PT); 209| 33.4k| F3(A, B, C, D, E, PT[0]); 210| 33.4k| F3(E, A, B, C, D, PT[1]); 211| 33.4k| F3(D, E, A, B, C, PT[2]); 212| 33.4k| F3(C, D, E, A, B, PT[3]); 213| 33.4k| P2 = prep(W2, W3, W0, W1, K40_59); 214| | 215| 33.4k| SIMD_4x32(P3).store_le(PT); 216| 33.4k| F3(B, C, D, E, A, PT[0]); 217| 33.4k| F3(A, B, C, D, E, PT[1]); 218| 33.4k| F3(E, A, B, C, D, PT[2]); 219| 33.4k| F3(D, E, A, B, C, PT[3]); 220| 33.4k| P3 = prep(W3, W0, W1, W2, K60_79); 221| | 222| 33.4k| SIMD_4x32(P0).store_le(PT); 223| 33.4k| F3(C, D, E, A, B, PT[0]); 224| 33.4k| F3(B, C, D, E, A, PT[1]); 225| 33.4k| F3(A, B, C, D, E, PT[2]); 226| 33.4k| F3(E, A, B, C, D, PT[3]); 227| 33.4k| P0 = prep(W0, W1, W2, W3, K60_79); 228| | 229| 33.4k| SIMD_4x32(P1).store_le(PT); 230| 33.4k| F3(D, E, A, B, C, PT[0]); 231| 33.4k| F3(C, D, E, A, B, PT[1]); 232| 33.4k| F3(B, C, D, E, A, PT[2]); 233| 33.4k| F3(A, B, C, D, E, PT[3]); 234| 33.4k| P1 = prep(W1, W2, W3, W0, K60_79); 235| | 236| 33.4k| SIMD_4x32(P2).store_le(PT); 237| 33.4k| F3(E, A, B, C, D, PT[0]); 238| 33.4k| F3(D, E, A, B, C, PT[1]); 239| 33.4k| F3(C, D, E, A, B, PT[2]); 240| 33.4k| F3(B, C, D, E, A, PT[3]); 241| 33.4k| P2 = prep(W2, W3, W0, W1, K60_79); 242| | 243| 33.4k| SIMD_4x32(P3).store_le(PT); 244| 33.4k| F4(A, B, C, D, E, PT[0]); 245| 33.4k| F4(E, A, B, C, D, PT[1]); 246| 33.4k| F4(D, E, A, B, C, PT[2]); 247| 33.4k| F4(C, D, E, A, B, PT[3]); 248| 33.4k| P3 = prep(W3, W0, W1, W2, K60_79); 249| | 250| 33.4k| SIMD_4x32(P0).store_le(PT); 251| 33.4k| F4(B, C, D, E, A, PT[0]); 252| 33.4k| F4(A, B, C, D, E, PT[1]); 253| 33.4k| F4(E, A, B, C, D, PT[2]); 254| 33.4k| F4(D, E, A, B, C, PT[3]); 255| | 256| 33.4k| SIMD_4x32(P1).store_le(PT); 257| 33.4k| F4(C, D, E, A, B, PT[0]); 258| 33.4k| F4(B, C, D, E, A, PT[1]); 259| 33.4k| F4(A, B, C, D, E, PT[2]); 260| 33.4k| F4(E, A, B, C, D, PT[3]); 261| | 262| 33.4k| SIMD_4x32(P2).store_le(PT); 263| 33.4k| F4(D, E, A, B, C, PT[0]); 264| 33.4k| F4(C, D, E, A, B, PT[1]); 265| 33.4k| F4(B, C, D, E, A, PT[2]); 266| 33.4k| F4(A, B, C, D, E, PT[3]); 267| | 268| 33.4k| SIMD_4x32(P3).store_le(PT); 269| 33.4k| F4(E, A, B, C, D, PT[0]); 270| 33.4k| F4(D, E, A, B, C, PT[1]); 271| 33.4k| F4(C, D, E, A, B, PT[2]); 272| 33.4k| F4(B, C, D, E, A, PT[3]); 273| | 274| 33.4k| A = (digest[0] += A); 275| 33.4k| B = (digest[1] += B); 276| 33.4k| C = (digest[2] += C); 277| 33.4k| D = (digest[3] += D); 278| 33.4k| E = (digest[4] += E); 279| | 280| 33.4k| input += 64; 281| 33.4k| } 282| 11.3k|} sha1_sse2.cpp:_ZN5Botan11SHA1_SSE2_F12_GLOBAL__N_12F1EjRjjjS2_j: 77| 669k|inline void F1(uint32_t A, uint32_t& B, uint32_t C, uint32_t D, uint32_t& E, uint32_t msg) { 78| 669k| E += choose(B, C, D) + msg + rotl<5>(A); 79| 669k| B = rotl<30>(B); 80| 669k|} sha1_sse2.cpp:_ZN5Botan11SHA1_SSE2_F12_GLOBAL__N_14prepERNS_9SIMD_4x32ES2_S2_S2_S2_: 50| 535k|BOTAN_FORCE_INLINE SIMD_4x32 prep(SIMD_4x32& XW0, SIMD_4x32 XW1, SIMD_4x32 XW2, SIMD_4x32 XW3, SIMD_4x32 K) { 51| 535k| SIMD_4x32 T0 = XW0; 52| | /* load W[t-4] 16-byte aligned, and shift */ 53| 535k| SIMD_4x32 T2 = XW3.shift_elems_right<1>(); 54| | /* get high 64-bits of XW0 into low 64-bits */ 55| 535k| SIMD_4x32 T1 = SIMD_4x32(_mm_shuffle_epi32(XW0.raw(), _MM_SHUFFLE(1, 0, 3, 2))); 56| | /* load high 64-bits of T1 */ 57| 535k| T1 = SIMD_4x32(_mm_unpacklo_epi64(T1.raw(), XW1.raw())); 58| | 59| 535k| T0 ^= T1; 60| 535k| T2 ^= XW2; 61| 535k| T0 ^= T2; 62| | /* unrotated W[t]..W[t+2] in T0 ... still need W[t+3] */ 63| | 64| 535k| T2 = T0.shift_elems_left<3>(); 65| 535k| T0 = T0.rotl<1>(); 66| 535k| T2 = T2.rotl<2>(); 67| | 68| 535k| T0 ^= T2; /* T0 now has W[t+3] */ 69| | 70| 535k| XW0 = T0; 71| 535k| return T0 + K; 72| 535k|} sha1_sse2.cpp:_ZN5Botan11SHA1_SSE2_F12_GLOBAL__N_12F2EjRjjjS2_j: 85| 669k|inline void F2(uint32_t A, uint32_t& B, uint32_t C, uint32_t D, uint32_t& E, uint32_t msg) { 86| 669k| E += (B ^ C ^ D) + msg + rotl<5>(A); 87| 669k| B = rotl<30>(B); 88| 669k|} sha1_sse2.cpp:_ZN5Botan11SHA1_SSE2_F12_GLOBAL__N_12F3EjRjjjS2_j: 93| 669k|inline void F3(uint32_t A, uint32_t& B, uint32_t C, uint32_t D, uint32_t& E, uint32_t msg) { 94| 669k| E += majority(B, C, D) + msg + rotl<5>(A); 95| 669k| B = rotl<30>(B); 96| 669k|} sha1_sse2.cpp:_ZN5Botan11SHA1_SSE2_F12_GLOBAL__N_12F4EjRjjjS2_j: 101| 669k|inline void F4(uint32_t A, uint32_t& B, uint32_t C, uint32_t D, uint32_t& E, uint32_t msg) { 102| 669k| E += (B ^ C ^ D) + msg + rotl<5>(A); 103| 669k| B = rotl<30>(B); 104| 669k|} _ZN5Botan7SHA_25615compress_digestERNSt3__16vectorIjNS_16secure_allocatorIjEEEEPKhm: 52| 13.6k|void SHA_256::compress_digest(secure_vector& digest, const uint8_t input[], size_t blocks) { 53| 13.6k|#if defined(BOTAN_HAS_SHA2_32_X86) 54| 13.6k| if(CPUID::has_intel_sha()) { ------------------ | Branch (54:7): [True: 0, False: 13.6k] ------------------ 55| 0| return SHA_256::compress_digest_x86(digest, input, blocks); 56| 0| } 57| 13.6k|#endif 58| | 59| 13.6k|#if defined(BOTAN_HAS_SHA2_32_X86_BMI2) 60| 13.6k| if(CPUID::has_bmi2()) { ------------------ | Branch (60:7): [True: 13.6k, False: 0] ------------------ 61| 13.6k| return SHA_256::compress_digest_x86_bmi2(digest, input, blocks); 62| 13.6k| } 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(input, 0); 76| 0| uint32_t W01 = load_be(input, 1); 77| 0| uint32_t W02 = load_be(input, 2); 78| 0| uint32_t W03 = load_be(input, 3); 79| 0| uint32_t W04 = load_be(input, 4); 80| 0| uint32_t W05 = load_be(input, 5); 81| 0| uint32_t W06 = load_be(input, 6); 82| 0| uint32_t W07 = load_be(input, 7); 83| 0| uint32_t W08 = load_be(input, 8); 84| 0| uint32_t W09 = load_be(input, 9); 85| 0| uint32_t W10 = load_be(input, 10); 86| 0| uint32_t W11 = load_be(input, 11); 87| 0| uint32_t W12 = load_be(input, 12); 88| 0| uint32_t W13 = load_be(input, 13); 89| 0| uint32_t W14 = load_be(input, 14); 90| 0| uint32_t W15 = load_be(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| 134|void SHA_224::compress_n(const uint8_t input[], size_t blocks) { SHA_256::compress_digest(m_digest, input, blocks); } _ZN5Botan7SHA_2248copy_outEPh: 185| 66|void SHA_224::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); } _ZN5Botan7SHA_2245clearEv: 190| 133|void SHA_224::clear() { 191| 133| MDx_HashFunction::clear(); 192| 133| m_digest[0] = 0xC1059ED8; 193| 133| m_digest[1] = 0x367CD507; 194| 133| m_digest[2] = 0x3070DD17; 195| 133| m_digest[3] = 0xF70E5939; 196| 133| m_digest[4] = 0xFFC00B31; 197| 133| m_digest[5] = 0x68581511; 198| 133| m_digest[6] = 0x64F98FA7; 199| 133| m_digest[7] = 0xBEFA4FA4; 200| 133|} _ZN5Botan7SHA_25610compress_nEPKhm: 205| 13.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| 8.86k|void SHA_256::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); } _ZN5Botan7SHA_2565clearEv: 215| 14.7k|void SHA_256::clear() { 216| 14.7k| MDx_HashFunction::clear(); 217| 14.7k| m_digest[0] = 0x6A09E667; 218| 14.7k| m_digest[1] = 0xBB67AE85; 219| 14.7k| m_digest[2] = 0x3C6EF372; 220| 14.7k| m_digest[3] = 0xA54FF53A; 221| 14.7k| m_digest[4] = 0x510E527F; 222| 14.7k| m_digest[5] = 0x9B05688C; 223| 14.7k| m_digest[6] = 0x1F83D9AB; 224| 14.7k| m_digest[7] = 0x5BE0CD19; 225| 14.7k|} _ZN5Botan7SHA_25624compress_digest_x86_bmi2ERNSt3__16vectorIjNS_16secure_allocatorIjEEEEPKhm: 23| 13.6k|void SHA_256::compress_digest_x86_bmi2(secure_vector& digest, const uint8_t input[], size_t blocks) { 24| 13.6k| uint32_t A = digest[0], B = digest[1], C = digest[2], D = digest[3], E = digest[4], F = digest[5], G = digest[6], 25| 13.6k| H = digest[7]; 26| | 27| 45.8k| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (27:22): [True: 32.1k, False: 13.6k] ------------------ 28| 32.1k| uint32_t W00 = load_be(input, 0); 29| 32.1k| uint32_t W01 = load_be(input, 1); 30| 32.1k| uint32_t W02 = load_be(input, 2); 31| 32.1k| uint32_t W03 = load_be(input, 3); 32| 32.1k| uint32_t W04 = load_be(input, 4); 33| 32.1k| uint32_t W05 = load_be(input, 5); 34| 32.1k| uint32_t W06 = load_be(input, 6); 35| 32.1k| uint32_t W07 = load_be(input, 7); 36| 32.1k| uint32_t W08 = load_be(input, 8); 37| 32.1k| uint32_t W09 = load_be(input, 9); 38| 32.1k| uint32_t W10 = load_be(input, 10); 39| 32.1k| uint32_t W11 = load_be(input, 11); 40| 32.1k| uint32_t W12 = load_be(input, 12); 41| 32.1k| uint32_t W13 = load_be(input, 13); 42| 32.1k| uint32_t W14 = load_be(input, 14); 43| 32.1k| uint32_t W15 = load_be(input, 15); 44| | 45| 32.1k| SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x428A2F98); 46| 32.1k| SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x71374491); 47| 32.1k| SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xB5C0FBCF); 48| 32.1k| SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xE9B5DBA5); 49| 32.1k| SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x3956C25B); 50| 32.1k| SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x59F111F1); 51| 32.1k| SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x923F82A4); 52| 32.1k| SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0xAB1C5ED5); 53| 32.1k| SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xD807AA98); 54| 32.1k| SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x12835B01); 55| 32.1k| SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x243185BE); 56| 32.1k| SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x550C7DC3); 57| 32.1k| SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x72BE5D74); 58| 32.1k| SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0x80DEB1FE); 59| 32.1k| SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x9BDC06A7); 60| 32.1k| SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC19BF174); 61| | 62| 32.1k| SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0xE49B69C1); 63| 32.1k| SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0xEFBE4786); 64| 32.1k| SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x0FC19DC6); 65| 32.1k| SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x240CA1CC); 66| 32.1k| SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x2DE92C6F); 67| 32.1k| SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4A7484AA); 68| 32.1k| SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5CB0A9DC); 69| 32.1k| SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x76F988DA); 70| 32.1k| SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x983E5152); 71| 32.1k| SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA831C66D); 72| 32.1k| SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xB00327C8); 73| 32.1k| SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xBF597FC7); 74| 32.1k| SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xC6E00BF3); 75| 32.1k| SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD5A79147); 76| 32.1k| SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x06CA6351); 77| 32.1k| SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x14292967); 78| | 79| 32.1k| SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x27B70A85); 80| 32.1k| SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x2E1B2138); 81| 32.1k| SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x4D2C6DFC); 82| 32.1k| SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x53380D13); 83| 32.1k| SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x650A7354); 84| 32.1k| SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x766A0ABB); 85| 32.1k| SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x81C2C92E); 86| 32.1k| SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x92722C85); 87| 32.1k| SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xA2BFE8A1); 88| 32.1k| SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA81A664B); 89| 32.1k| SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xC24B8B70); 90| 32.1k| SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xC76C51A3); 91| 32.1k| SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xD192E819); 92| 32.1k| SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD6990624); 93| 32.1k| SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xF40E3585); 94| 32.1k| SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x106AA070); 95| | 96| 32.1k| SHA2_32_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x19A4C116); 97| 32.1k| SHA2_32_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x1E376C08); 98| 32.1k| SHA2_32_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x2748774C); 99| 32.1k| SHA2_32_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x34B0BCB5); 100| 32.1k| SHA2_32_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x391C0CB3); 101| 32.1k| SHA2_32_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4ED8AA4A); 102| 32.1k| SHA2_32_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5B9CCA4F); 103| 32.1k| SHA2_32_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x682E6FF3); 104| 32.1k| SHA2_32_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x748F82EE); 105| 32.1k| SHA2_32_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x78A5636F); 106| 32.1k| SHA2_32_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x84C87814); 107| 32.1k| SHA2_32_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x8CC70208); 108| 32.1k| SHA2_32_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x90BEFFFA); 109| 32.1k| SHA2_32_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xA4506CEB); 110| 32.1k| SHA2_32_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xBEF9A3F7); 111| 32.1k| SHA2_32_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC67178F2); 112| | 113| 32.1k| A = (digest[0] += A); 114| 32.1k| B = (digest[1] += B); 115| 32.1k| C = (digest[2] += C); 116| 32.1k| D = (digest[3] += D); 117| 32.1k| E = (digest[4] += E); 118| 32.1k| F = (digest[5] += F); 119| 32.1k| G = (digest[6] += G); 120| 32.1k| H = (digest[7] += H); 121| | 122| 32.1k| input += 64; 123| 32.1k| } 124| 13.6k|} _ZN5Botan7SHA_51215compress_digestERNSt3__16vectorImNS_16secure_allocatorImEEEEPKhm: 42| 997|void SHA_512::compress_digest(secure_vector& digest, const uint8_t input[], size_t blocks) { 43| 997|#if defined(BOTAN_HAS_SHA2_64_BMI2) 44| 997| if(CPUID::has_bmi2()) { ------------------ | Branch (44:7): [True: 997, False: 0] ------------------ 45| 997| return compress_digest_bmi2(digest, input, blocks); 46| 997| } 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(input, 0); 54| 0| uint64_t W01 = load_be(input, 1); 55| 0| uint64_t W02 = load_be(input, 2); 56| 0| uint64_t W03 = load_be(input, 3); 57| 0| uint64_t W04 = load_be(input, 4); 58| 0| uint64_t W05 = load_be(input, 5); 59| 0| uint64_t W06 = load_be(input, 6); 60| 0| uint64_t W07 = load_be(input, 7); 61| 0| uint64_t W08 = load_be(input, 8); 62| 0| uint64_t W09 = load_be(input, 9); 63| 0| uint64_t W10 = load_be(input, 10); 64| 0| uint64_t W11 = load_be(input, 11); 65| 0| uint64_t W12 = load_be(input, 12); 66| 0| uint64_t W13 = load_be(input, 13); 67| 0| uint64_t W14 = load_be(input, 14); 68| 0| uint64_t W15 = load_be(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| 34|void SHA_512_256::compress_n(const uint8_t input[], size_t blocks) { 173| 34| SHA_512::compress_digest(m_digest, input, blocks); 174| 34|} _ZN5Botan7SHA_38410compress_nEPKhm: 176| 882|void SHA_384::compress_n(const uint8_t input[], size_t blocks) { SHA_512::compress_digest(m_digest, input, blocks); } _ZN5Botan7SHA_51210compress_nEPKhm: 178| 81|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| 17|void SHA_512_256::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); } _ZN5Botan7SHA_3848copy_outEPh: 182| 483|void SHA_384::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); } _ZN5Botan7SHA_5128copy_outEPh: 184| 40|void SHA_512::copy_out(uint8_t output[]) { copy_out_vec_be(output, output_length(), m_digest); } _ZN5Botan11SHA_512_2565clearEv: 186| 34|void SHA_512_256::clear() { 187| 34| MDx_HashFunction::clear(); 188| 34| m_digest[0] = 0x22312194FC2BF72C; 189| 34| m_digest[1] = 0x9F555FA3C84C64C2; 190| 34| m_digest[2] = 0x2393B86B6F53B151; 191| 34| m_digest[3] = 0x963877195940EABD; 192| 34| m_digest[4] = 0x96283EE2A88EFFE3; 193| 34| m_digest[5] = 0xBE5E1E2553863992; 194| 34| m_digest[6] = 0x2B0199FC2C85B8AA; 195| 34| m_digest[7] = 0x0EB72DDC81C52CA2; 196| 34|} _ZN5Botan7SHA_3845clearEv: 198| 871|void SHA_384::clear() { 199| 871| MDx_HashFunction::clear(); 200| 871| m_digest[0] = 0xCBBB9D5DC1059ED8; 201| 871| m_digest[1] = 0x629A292A367CD507; 202| 871| m_digest[2] = 0x9159015A3070DD17; 203| 871| m_digest[3] = 0x152FECD8F70E5939; 204| 871| m_digest[4] = 0x67332667FFC00B31; 205| 871| m_digest[5] = 0x8EB44A8768581511; 206| 871| m_digest[6] = 0xDB0C2E0D64F98FA7; 207| 871| m_digest[7] = 0x47B5481DBEFA4FA4; 208| 871|} _ZN5Botan7SHA_5125clearEv: 210| 80|void SHA_512::clear() { 211| 80| MDx_HashFunction::clear(); 212| 80| m_digest[0] = 0x6A09E667F3BCC908; 213| 80| m_digest[1] = 0xBB67AE8584CAA73B; 214| 80| m_digest[2] = 0x3C6EF372FE94F82B; 215| 80| m_digest[3] = 0xA54FF53A5F1D36F1; 216| 80| m_digest[4] = 0x510E527FADE682D1; 217| 80| m_digest[5] = 0x9B05688C2B3E6C1F; 218| 80| m_digest[6] = 0x1F83D9ABFB41BD6B; 219| 80| m_digest[7] = 0x5BE0CD19137E2179; 220| 80|} _ZN5Botan7SHA_51220compress_digest_bmi2ERNSt3__16vectorImNS_16secure_allocatorImEEEEPKhm: 16| 997|void SHA_512::compress_digest_bmi2(secure_vector& digest, const uint8_t input[], size_t blocks) { 17| 997| uint64_t A = digest[0], B = digest[1], C = digest[2], D = digest[3], E = digest[4], F = digest[5], G = digest[6], 18| 997| H = digest[7]; 19| | 20| 2.16k| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (20:22): [True: 1.17k, False: 997] ------------------ 21| 1.17k| uint64_t W00 = load_be(input, 0); 22| 1.17k| uint64_t W01 = load_be(input, 1); 23| 1.17k| uint64_t W02 = load_be(input, 2); 24| 1.17k| uint64_t W03 = load_be(input, 3); 25| 1.17k| uint64_t W04 = load_be(input, 4); 26| 1.17k| uint64_t W05 = load_be(input, 5); 27| 1.17k| uint64_t W06 = load_be(input, 6); 28| 1.17k| uint64_t W07 = load_be(input, 7); 29| 1.17k| uint64_t W08 = load_be(input, 8); 30| 1.17k| uint64_t W09 = load_be(input, 9); 31| 1.17k| uint64_t W10 = load_be(input, 10); 32| 1.17k| uint64_t W11 = load_be(input, 11); 33| 1.17k| uint64_t W12 = load_be(input, 12); 34| 1.17k| uint64_t W13 = load_be(input, 13); 35| 1.17k| uint64_t W14 = load_be(input, 14); 36| 1.17k| uint64_t W15 = load_be(input, 15); 37| | 38| 1.17k| SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x428A2F98D728AE22); 39| 1.17k| SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x7137449123EF65CD); 40| 1.17k| SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xB5C0FBCFEC4D3B2F); 41| 1.17k| SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xE9B5DBA58189DBBC); 42| 1.17k| SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x3956C25BF348B538); 43| 1.17k| SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x59F111F1B605D019); 44| 1.17k| SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x923F82A4AF194F9B); 45| 1.17k| SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0xAB1C5ED5DA6D8118); 46| 1.17k| SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xD807AA98A3030242); 47| 1.17k| SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x12835B0145706FBE); 48| 1.17k| SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x243185BE4EE4B28C); 49| 1.17k| SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x550C7DC3D5FFB4E2); 50| 1.17k| SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x72BE5D74F27B896F); 51| 1.17k| SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0x80DEB1FE3B1696B1); 52| 1.17k| SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x9BDC06A725C71235); 53| 1.17k| SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC19BF174CF692694); 54| 1.17k| SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0xE49B69C19EF14AD2); 55| 1.17k| SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0xEFBE4786384F25E3); 56| 1.17k| SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x0FC19DC68B8CD5B5); 57| 1.17k| SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x240CA1CC77AC9C65); 58| 1.17k| SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x2DE92C6F592B0275); 59| 1.17k| SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4A7484AA6EA6E483); 60| 1.17k| SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5CB0A9DCBD41FBD4); 61| 1.17k| SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x76F988DA831153B5); 62| 1.17k| SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x983E5152EE66DFAB); 63| 1.17k| SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA831C66D2DB43210); 64| 1.17k| SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xB00327C898FB213F); 65| 1.17k| SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xBF597FC7BEEF0EE4); 66| 1.17k| SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xC6E00BF33DA88FC2); 67| 1.17k| SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD5A79147930AA725); 68| 1.17k| SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x06CA6351E003826F); 69| 1.17k| SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x142929670A0E6E70); 70| 1.17k| SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x27B70A8546D22FFC); 71| 1.17k| SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x2E1B21385C26C926); 72| 1.17k| SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x4D2C6DFC5AC42AED); 73| 1.17k| SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x53380D139D95B3DF); 74| 1.17k| SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x650A73548BAF63DE); 75| 1.17k| SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x766A0ABB3C77B2A8); 76| 1.17k| SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x81C2C92E47EDAEE6); 77| 1.17k| SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x92722C851482353B); 78| 1.17k| SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xA2BFE8A14CF10364); 79| 1.17k| SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0xA81A664BBC423001); 80| 1.17k| SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0xC24B8B70D0F89791); 81| 1.17k| SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0xC76C51A30654BE30); 82| 1.17k| SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0xD192E819D6EF5218); 83| 1.17k| SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xD69906245565A910); 84| 1.17k| SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xF40E35855771202A); 85| 1.17k| SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x106AA07032BBD1B8); 86| 1.17k| SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x19A4C116B8D2D0C8); 87| 1.17k| SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x1E376C085141AB53); 88| 1.17k| SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0x2748774CDF8EEB99); 89| 1.17k| SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0x34B0BCB5E19B48A8); 90| 1.17k| SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x391C0CB3C5C95A63); 91| 1.17k| SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x4ED8AA4AE3418ACB); 92| 1.17k| SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x5B9CCA4F7763E373); 93| 1.17k| SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x682E6FF3D6B2B8A3); 94| 1.17k| SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x748F82EE5DEFB2FC); 95| 1.17k| SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x78A5636F43172F60); 96| 1.17k| SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x84C87814A1F0AB72); 97| 1.17k| SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x8CC702081A6439EC); 98| 1.17k| SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x90BEFFFA23631E28); 99| 1.17k| SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0xA4506CEBDE82BDE9); 100| 1.17k| SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0xBEF9A3F7B2C67915); 101| 1.17k| SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0xC67178F2E372532B); 102| 1.17k| SHA2_64_F(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0xCA273ECEEA26619C); 103| 1.17k| SHA2_64_F(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0xD186B8C721C0C207); 104| 1.17k| SHA2_64_F(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xEADA7DD6CDE0EB1E); 105| 1.17k| SHA2_64_F(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xF57D4F7FEE6ED178); 106| 1.17k| SHA2_64_F(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x06F067AA72176FBA); 107| 1.17k| SHA2_64_F(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x0A637DC5A2C898A6); 108| 1.17k| SHA2_64_F(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x113F9804BEF90DAE); 109| 1.17k| SHA2_64_F(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0x1B710B35131C471B); 110| 1.17k| SHA2_64_F(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0x28DB77F523047D84); 111| 1.17k| SHA2_64_F(H, A, B, C, D, E, F, G, W09, W07, W02, W10, 0x32CAAB7B40C72493); 112| 1.17k| SHA2_64_F(G, H, A, B, C, D, E, F, W10, W08, W03, W11, 0x3C9EBE0A15C9BEBC); 113| 1.17k| SHA2_64_F(F, G, H, A, B, C, D, E, W11, W09, W04, W12, 0x431D67C49C100D4C); 114| 1.17k| SHA2_64_F(E, F, G, H, A, B, C, D, W12, W10, W05, W13, 0x4CC5D4BECB3E42B6); 115| 1.17k| SHA2_64_F(D, E, F, G, H, A, B, C, W13, W11, W06, W14, 0x597F299CFC657E2A); 116| 1.17k| SHA2_64_F(C, D, E, F, G, H, A, B, W14, W12, W07, W15, 0x5FCB6FAB3AD6FAEC); 117| 1.17k| SHA2_64_F(B, C, D, E, F, G, H, A, W15, W13, W08, W00, 0x6C44198C4A475817); 118| | 119| 1.17k| A = (digest[0] += A); 120| 1.17k| B = (digest[1] += B); 121| 1.17k| C = (digest[2] += C); 122| 1.17k| D = (digest[3] += D); 123| 1.17k| E = (digest[4] += E); 124| 1.17k| F = (digest[5] += F); 125| 1.17k| G = (digest[6] += G); 126| 1.17k| H = (digest[7] += H); 127| | 128| 1.17k| input += 128; 129| 1.17k| } 130| 997|} _ZN5Botan8StreebogC2Em: 23| 74| m_output_bits(output_bits), m_count(0), m_position(0), m_buffer(64), m_h(8), m_S(8) { 24| 74| if(output_bits != 256 && output_bits != 512) { ------------------ | Branch (24:7): [True: 0, False: 74] | Branch (24:29): [True: 0, False: 0] ------------------ 25| 0| throw Invalid_Argument(fmt("Streebog: Invalid output length {}", output_bits)); 26| 0| } 27| | 28| 74| clear(); 29| 74|} _ZN5Botan8Streebog5clearEv: 36| 148|void Streebog::clear() { 37| 148| m_count = 0; 38| 148| m_position = 0; 39| 148| zeroise(m_buffer); 40| 148| zeroise(m_S); 41| | 42| 148| const uint64_t fill = (m_output_bits == 512) ? 0 : 0x0101010101010101; ------------------ | Branch (42:26): [True: 0, False: 148] ------------------ 43| 148| std::fill(m_h.begin(), m_h.end(), fill); 44| 148|} _ZN5Botan8Streebog8add_dataEPKhm: 49| 74|void Streebog::add_data(const uint8_t input[], size_t length) { 50| 74| const size_t block_size = m_buffer.size(); 51| | 52| 74| if(m_position) { ------------------ | Branch (52:7): [True: 0, False: 74] ------------------ 53| 0| buffer_insert(m_buffer, m_position, input, length); 54| | 55| 0| if(m_position + length >= block_size) { ------------------ | Branch (55:10): [True: 0, False: 0] ------------------ 56| 0| compress(m_buffer.data()); 57| 0| m_count += 512; 58| 0| input += (block_size - m_position); 59| 0| length -= (block_size - m_position); 60| 0| m_position = 0; 61| 0| } 62| 0| } 63| | 64| 74| const size_t full_blocks = length / block_size; 65| 74| const size_t remaining = length % block_size; 66| | 67| 666| for(size_t i = 0; i != full_blocks; ++i) { ------------------ | Branch (67:22): [True: 592, False: 74] ------------------ 68| 592| compress(input + block_size * i); 69| 592| m_count += 512; 70| 592| } 71| | 72| 74| buffer_insert(m_buffer, m_position, input + full_blocks * block_size, remaining); 73| 74| m_position += remaining; 74| 74|} _ZN5Botan8Streebog12final_resultEPh: 79| 74|void Streebog::final_result(uint8_t output[]) { 80| 74| m_buffer[m_position++] = 0x01; 81| | 82| 74| if(m_position != m_buffer.size()) { ------------------ | Branch (82:7): [True: 74, False: 0] ------------------ 83| 74| clear_mem(&m_buffer[m_position], m_buffer.size() - m_position); 84| 74| } 85| | 86| 74| compress(m_buffer.data()); 87| 74| m_count += (m_position - 1) * 8; 88| | 89| 74| zeroise(m_buffer); 90| 74| store_le(m_count, m_buffer.data()); 91| 74| compress(m_buffer.data(), true); 92| | 93| 74| compress_64(m_S.data(), true); 94| | // FIXME 95| 74| std::memcpy(output, &m_h[8 - output_length() / 8], output_length()); 96| 74| clear(); 97| 74|} _ZN5Botan8Streebog8compressEPKhb: 127| 740|void Streebog::compress(const uint8_t input[], bool last_block) { 128| 740| uint64_t M[8]; 129| 740| std::memcpy(M, input, 64); 130| | 131| 740| compress_64(M, last_block); 132| 740|} _ZN5Botan8Streebog11compress_64EPKmb: 134| 814|void Streebog::compress_64(const uint64_t M[], bool last_block) { 135| 814| const uint64_t N = last_block ? 0 : force_le(m_count); ------------------ | Branch (135:23): [True: 148, False: 666] ------------------ 136| | 137| 814| uint64_t hN[8]; 138| 814| uint64_t A[8]; 139| | 140| 814| copy_mem(hN, m_h.data(), 8); 141| 814| hN[0] ^= N; 142| 814| lps(hN); 143| | 144| 814| copy_mem(A, hN, 8); 145| | 146| 7.32k| for(size_t i = 0; i != 8; ++i) { ------------------ | Branch (146:22): [True: 6.51k, False: 814] ------------------ 147| 6.51k| hN[i] ^= M[i]; 148| 6.51k| } 149| | 150| 10.5k| for(size_t i = 0; i < 12; ++i) { ------------------ | Branch (150:22): [True: 9.76k, False: 814] ------------------ 151| 87.9k| for(size_t j = 0; j != 8; ++j) { ------------------ | Branch (151:25): [True: 78.1k, False: 9.76k] ------------------ 152| 78.1k| A[j] ^= force_le(STREEBOG_C[i][j]); 153| 78.1k| } 154| 9.76k| lps(A); 155| | 156| 9.76k| lps(hN); 157| 87.9k| for(size_t j = 0; j != 8; ++j) { ------------------ | Branch (157:25): [True: 78.1k, False: 9.76k] ------------------ 158| 78.1k| hN[j] ^= A[j]; 159| 78.1k| } 160| 9.76k| } 161| | 162| 7.32k| for(size_t i = 0; i != 8; ++i) { ------------------ | Branch (162:22): [True: 6.51k, False: 814] ------------------ 163| 6.51k| m_h[i] ^= hN[i] ^ M[i]; 164| 6.51k| } 165| | 166| 814| if(!last_block) { ------------------ | Branch (166:7): [True: 666, False: 148] ------------------ 167| 666| uint64_t carry = 0; 168| 5.99k| for(int i = 0; i < 8; i++) { ------------------ | Branch (168:22): [True: 5.32k, False: 666] ------------------ 169| 5.32k| const uint64_t m = force_le(M[i]); 170| 5.32k| const uint64_t hi = force_le(m_S[i]); 171| 5.32k| const uint64_t t = hi + m + carry; 172| | 173| 5.32k| m_S[i] = force_le(t); 174| 5.32k| if(t != m) { ------------------ | Branch (174:13): [True: 4.73k, False: 592] ------------------ 175| 4.73k| carry = (t < m); 176| 4.73k| } 177| 5.32k| } 178| 666| } 179| 814|} streebog.cpp:_ZN5Botan12_GLOBAL__N_18force_leEm: 101| 1.39M|inline uint64_t force_le(uint64_t x) { 102| 1.39M|#if defined(BOTAN_TARGET_CPU_IS_LITTLE_ENDIAN) 103| 1.39M| return x; 104| |#elif defined(BOTAN_TARGET_CPU_IS_BIG_ENDIAN) 105| | return reverse_bytes(x); 106| |#else 107| | store_le(x, reinterpret_cast(&x)); 108| | return x; 109| |#endif 110| 1.39M|} streebog.cpp:_ZN5Botan12_GLOBAL__N_13lpsEPm: 112| 20.3k|inline void lps(uint64_t block[8]) { 113| 20.3k| uint8_t r[64]; 114| | // FIXME 115| 20.3k| std::memcpy(r, block, 64); 116| | 117| 183k| for(int i = 0; i < 8; ++i) { ------------------ | Branch (117:19): [True: 162k, False: 20.3k] ------------------ 118| 162k| block[i] = force_le(STREEBOG_Ax[0][r[i + 0 * 8]]) ^ force_le(STREEBOG_Ax[1][r[i + 1 * 8]]) ^ 119| 162k| force_le(STREEBOG_Ax[2][r[i + 2 * 8]]) ^ force_le(STREEBOG_Ax[3][r[i + 3 * 8]]) ^ 120| 162k| force_le(STREEBOG_Ax[4][r[i + 4 * 8]]) ^ force_le(STREEBOG_Ax[5][r[i + 5 * 8]]) ^ 121| 162k| force_le(STREEBOG_Ax[6][r[i + 6 * 8]]) ^ force_le(STREEBOG_Ax[7][r[i + 7 * 8]]); 122| 162k| } 123| 20.3k|} _ZN5Botan6BigInt11encode_1363ERKS0_m: 105| 1.05k|secure_vector BigInt::encode_1363(const BigInt& n, size_t bytes) { 106| 1.05k| if(n.bytes() > bytes) { ------------------ | Branch (106:7): [True: 4, False: 1.05k] ------------------ 107| 4| throw Encoding_Error("encode_1363: n is too large to encode properly"); 108| 4| } 109| | 110| 1.05k| secure_vector output(bytes); 111| 1.05k| n.binary_encode(output.data(), output.size()); 112| 1.05k| return output; 113| 1.05k|} _ZN5Botan6BigInt6decodeEPKhmNS0_4BaseE: 143| 895|BigInt BigInt::decode(const uint8_t buf[], size_t length, Base base) { 144| 895| BigInt r; 145| 895| if(base == Binary) { ------------------ | Branch (145:7): [True: 0, False: 895] ------------------ 146| 0| r.binary_decode(buf, length); 147| 895| } else if(base == Hexadecimal) { ------------------ | Branch (147:14): [True: 755, False: 140] ------------------ 148| 755| secure_vector binary; 149| | 150| 755| if(length % 2) { ------------------ | Branch (150:10): [True: 12, False: 743] ------------------ 151| | // Handle lack of leading 0 152| 12| const char buf0_with_leading_0[2] = {'0', static_cast(buf[0])}; 153| | 154| 12| binary = hex_decode_locked(buf0_with_leading_0, 2); 155| | 156| 12| binary += hex_decode_locked(cast_uint8_ptr_to_char(&buf[1]), length - 1, false); 157| 743| } else { 158| 743| binary = hex_decode_locked(cast_uint8_ptr_to_char(buf), length, false); 159| 743| } 160| | 161| 755| r.binary_decode(binary.data(), binary.size()); 162| 755| } else if(base == Decimal) { ------------------ | Branch (162:14): [True: 140, False: 0] ------------------ 163| | // This could be made faster using the same trick as to_dec_string 164| 280| for(size_t i = 0; i != length; ++i) { ------------------ | Branch (164:25): [True: 140, False: 140] ------------------ 165| 140| const char c = buf[i]; 166| | 167| 140| if(c < '0' || c > '9') { ------------------ | Branch (167:13): [True: 0, False: 140] | Branch (167:24): [True: 0, False: 140] ------------------ 168| 0| throw Invalid_Argument("BigInt::decode: invalid decimal char"); 169| 0| } 170| | 171| 140| const uint8_t x = c - '0'; 172| 140| BOTAN_ASSERT_NOMSG(x < 10); ------------------ | | 60| 140| do { \ | | 61| 140| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 140] | | ------------------ | | 62| 140| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 140| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 173| | 174| 140| r *= 10; 175| 140| r += x; 176| 140| } 177| 140| } else { 178| 0| throw Invalid_Argument("Unknown BigInt decoding method"); 179| 0| } 180| 895| return r; 181| 895|} _ZN5Botan6BigInt3addEPKmmNS0_4SignE: 16| 1.38M|BigInt& BigInt::add(const word y[], size_t y_words, Sign y_sign) { 17| 1.38M| const size_t x_sw = sig_words(); 18| | 19| 1.38M| grow_to(std::max(x_sw, y_words) + 1); 20| | 21| 1.38M| if(sign() == y_sign) { ------------------ | Branch (21:7): [True: 1.28M, False: 100k] ------------------ 22| 1.28M| bigint_add2(mutable_data(), size() - 1, y, y_words); 23| 1.28M| } else { 24| 100k| const int32_t relative_size = bigint_cmp(data(), x_sw, y, y_words); 25| | 26| 100k| if(relative_size >= 0) { ------------------ | Branch (26:10): [True: 90.1k, False: 10.3k] ------------------ 27| | // *this >= y 28| 90.1k| bigint_sub2(mutable_data(), x_sw, y, y_words); 29| 90.1k| } else { 30| | // *this < y 31| 10.3k| bigint_sub2_rev(mutable_data(), y, y_words); 32| 10.3k| } 33| | 34| | //this->sign_fixup(relative_size, y_sign); 35| 100k| if(relative_size < 0) { ------------------ | Branch (35:10): [True: 10.3k, False: 90.1k] ------------------ 36| 10.3k| set_sign(y_sign); 37| 90.1k| } else if(relative_size == 0) { ------------------ | Branch (37:17): [True: 0, False: 90.1k] ------------------ 38| 0| set_sign(Positive); 39| 0| } 40| 100k| } 41| | 42| 1.38M| return (*this); 43| 1.38M|} _ZN5Botan6BigInt7mod_addERKS0_S2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 45| 146k|BigInt& BigInt::mod_add(const BigInt& s, const BigInt& mod, secure_vector& ws) { 46| 146k| if(this->is_negative() || s.is_negative() || mod.is_negative()) { ------------------ | Branch (46:7): [True: 0, False: 146k] | Branch (46:30): [True: 0, False: 146k] | Branch (46:49): [True: 0, False: 146k] ------------------ 47| 0| throw Invalid_Argument("BigInt::mod_add expects all arguments are positive"); 48| 0| } 49| | 50| 146k| BOTAN_DEBUG_ASSERT(*this < mod); ------------------ | | 99| 146k| do { \ | | 100| 146k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 51| 146k| BOTAN_DEBUG_ASSERT(s < mod); ------------------ | | 99| 146k| do { \ | | 100| 146k| } 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| 146k| const size_t mod_sw = mod.sig_words(); 64| 146k| BOTAN_ARG_CHECK(mod_sw > 0, "BigInt::mod_add modulus must be positive"); ------------------ | | 30| 146k| do { \ | | 31| 146k| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 0, False: 146k] | | ------------------ | | 32| 146k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 146k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 65| | 66| 146k| this->grow_to(mod_sw); 67| 146k| s.grow_to(mod_sw); 68| | 69| | // First mod_sw for p - s, 2*mod_sw for bigint_addsub workspace 70| 146k| if(ws.size() < 3 * mod_sw) { ------------------ | Branch (70:7): [True: 108k, False: 38.0k] ------------------ 71| 108k| ws.resize(3 * mod_sw); 72| 108k| } 73| | 74| 146k| word borrow = bigint_sub3(&ws[0], mod.data(), mod_sw, s.data(), mod_sw); 75| 146k| BOTAN_DEBUG_ASSERT(borrow == 0); ------------------ | | 99| 146k| do { \ | | 100| 146k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 76| 146k| BOTAN_UNUSED(borrow); ------------------ | | 118| 146k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 77| | 78| | // Compute t - ws 79| 146k| borrow = bigint_sub3(&ws[mod_sw], this->data(), mod_sw, &ws[0], mod_sw); 80| | 81| | // Compute t + s 82| 146k| bigint_add3_nc(&ws[mod_sw * 2], this->data(), mod_sw, s.data(), mod_sw); 83| | 84| 146k| CT::conditional_copy_mem(borrow, &ws[0], &ws[mod_sw * 2], &ws[mod_sw], mod_sw); 85| 146k| set_words(&ws[0], mod_sw); 86| | 87| 146k| return (*this); 88| 146k|} _ZN5Botan6BigInt7mod_subERKS0_S2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 90| 2.38M|BigInt& BigInt::mod_sub(const BigInt& s, const BigInt& mod, secure_vector& ws) { 91| 2.38M| if(this->is_negative() || s.is_negative() || mod.is_negative()) { ------------------ | Branch (91:7): [True: 0, False: 2.38M] | Branch (91:30): [True: 0, False: 2.38M] | Branch (91:49): [True: 0, False: 2.38M] ------------------ 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| 2.38M| BOTAN_DEBUG_ASSERT(*this < mod); ------------------ | | 99| 2.38M| do { \ | | 100| 2.38M| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 97| 2.38M| BOTAN_DEBUG_ASSERT(s < mod); ------------------ | | 99| 2.38M| do { \ | | 100| 2.38M| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 98| | 99| 2.38M| const size_t mod_sw = mod.sig_words(); 100| | 101| 2.38M| this->grow_to(mod_sw); 102| 2.38M| s.grow_to(mod_sw); 103| | 104| 2.38M| if(ws.size() < mod_sw) { ------------------ | Branch (104:7): [True: 0, False: 2.38M] ------------------ 105| 0| ws.resize(mod_sw); 106| 0| } 107| | 108| 2.38M| if(mod_sw == 4) { ------------------ | Branch (108:7): [True: 1.78M, False: 598k] ------------------ 109| 1.78M| bigint_mod_sub_n<4>(mutable_data(), s.data(), mod.data(), ws.data()); 110| 1.78M| } else if(mod_sw == 6) { ------------------ | Branch (110:14): [True: 130k, False: 467k] ------------------ 111| 130k| bigint_mod_sub_n<6>(mutable_data(), s.data(), mod.data(), ws.data()); 112| 467k| } else { 113| 467k| bigint_mod_sub(mutable_data(), s.data(), mod.data(), mod_sw, ws.data()); 114| 467k| } 115| | 116| 2.38M| return (*this); 117| 2.38M|} _ZN5Botan6BigInt7mod_mulEhRKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 119| 856k|BigInt& BigInt::mod_mul(uint8_t y, const BigInt& mod, secure_vector& ws) { 120| 856k| BOTAN_ARG_CHECK(this->is_negative() == false, "*this must be positive"); ------------------ | | 30| 856k| do { \ | | 31| 856k| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 0, False: 856k] | | ------------------ | | 32| 856k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 856k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 121| 856k| BOTAN_ARG_CHECK(y < 16, "y too large"); ------------------ | | 30| 856k| do { \ | | 31| 856k| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 0, False: 856k] | | ------------------ | | 32| 856k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 856k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 122| | 123| 856k| BOTAN_DEBUG_ASSERT(*this < mod); ------------------ | | 99| 856k| do { \ | | 100| 856k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 124| | 125| 856k| *this *= static_cast(y); 126| 856k| this->reduce_below(mod, ws); 127| 856k| return (*this); 128| 856k|} _ZN5Botan6BigInt7rev_subEPKmmRNSt3__16vectorImNS_16secure_allocatorImEEEE: 130| 1.19M|BigInt& BigInt::rev_sub(const word y[], size_t y_sw, secure_vector& ws) { 131| 1.19M| if(this->sign() != BigInt::Positive) { ------------------ | Branch (131:7): [True: 0, False: 1.19M] ------------------ 132| 0| throw Invalid_State("BigInt::sub_rev requires this is positive"); 133| 0| } 134| | 135| 1.19M| const size_t x_sw = this->sig_words(); 136| | 137| 1.19M| ws.resize(std::max(x_sw, y_sw)); 138| 1.19M| clear_mem(ws.data(), ws.size()); 139| | 140| 1.19M| const int32_t relative_size = bigint_sub_abs(ws.data(), data(), x_sw, y, y_sw); 141| | 142| 1.19M| this->cond_flip_sign(relative_size > 0); 143| 1.19M| this->swap_reg(ws); 144| | 145| 1.19M| return (*this); 146| 1.19M|} _ZN5Botan6BigInt3mulERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 156| 2.39M|BigInt& BigInt::mul(const BigInt& y, secure_vector& ws) { 157| 2.39M| const size_t x_sw = sig_words(); 158| 2.39M| const size_t y_sw = y.sig_words(); 159| 2.39M| set_sign((sign() == y.sign()) ? Positive : Negative); ------------------ | Branch (159:13): [True: 2.39M, False: 0] ------------------ 160| | 161| 2.39M| if(x_sw == 0 || y_sw == 0) { ------------------ | Branch (161:7): [True: 243k, False: 2.15M] | Branch (161:20): [True: 0, False: 2.15M] ------------------ 162| 243k| clear(); 163| 243k| set_sign(Positive); 164| 2.15M| } else if(x_sw == 1 && y_sw) { ------------------ | Branch (164:14): [True: 697k, False: 1.45M] | Branch (164:27): [True: 697k, False: 0] ------------------ 165| 697k| grow_to(y_sw + 1); 166| 697k| bigint_linmul3(mutable_data(), y.data(), y_sw, word_at(0)); 167| 1.45M| } else if(y_sw == 1 && x_sw) { ------------------ | Branch (167:14): [True: 0, False: 1.45M] | 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| 1.45M| } else { 171| 1.45M| const size_t new_size = x_sw + y_sw + 1; 172| 1.45M| ws.resize(new_size); 173| 1.45M| secure_vector z_reg(new_size); 174| | 175| 1.45M| bigint_mul(z_reg.data(), z_reg.size(), data(), size(), x_sw, y.data(), y.size(), y_sw, ws.data(), ws.size()); 176| | 177| 1.45M| this->swap_reg(z_reg); 178| 1.45M| } 179| | 180| 2.39M| return (*this); 181| 2.39M|} _ZN5Botan6BigInt6squareERNSt3__16vectorImNS_16secure_allocatorImEEEE: 183| 626k|BigInt& BigInt::square(secure_vector& ws) { 184| 626k| const size_t sw = sig_words(); 185| | 186| 626k| secure_vector z(2 * sw); 187| 626k| ws.resize(z.size()); 188| | 189| 626k| bigint_sqr(z.data(), z.size(), data(), size(), sw, ws.data(), ws.size()); 190| | 191| 626k| swap_reg(z); 192| 626k| set_sign(BigInt::Positive); 193| | 194| 626k| return (*this); 195| 626k|} _ZN5Botan6BigIntmLEm: 197| 4.18M|BigInt& BigInt::operator*=(word y) { 198| 4.18M| if(y == 0) { ------------------ | Branch (198:7): [True: 0, False: 4.18M] ------------------ 199| 0| clear(); 200| 0| set_sign(Positive); 201| 0| } 202| | 203| 4.18M| const word carry = bigint_linmul2(mutable_data(), size(), y); 204| 4.18M| set_word_at(size(), carry); 205| | 206| 4.18M| return (*this); 207| 4.18M|} _ZN5Botan6BigIntrMERKS0_: 224| 114k|BigInt& BigInt::operator%=(const BigInt& mod) { return (*this = (*this) % mod); } _ZN5Botan6BigIntlSEm: 258| 150k|BigInt& BigInt::operator<<=(size_t shift) { 259| 150k| const size_t shift_words = shift / BOTAN_MP_WORD_BITS; ------------------ | | 50| 150k|#define BOTAN_MP_WORD_BITS 64 ------------------ 260| 150k| const size_t shift_bits = shift % BOTAN_MP_WORD_BITS; ------------------ | | 50| 150k|#define BOTAN_MP_WORD_BITS 64 ------------------ 261| 150k| const size_t size = sig_words(); 262| | 263| 150k| const size_t bits_free = top_bits_free(); 264| | 265| 150k| const size_t new_size = size + shift_words + (bits_free < shift_bits); 266| | 267| 150k| m_data.grow_to(new_size); 268| | 269| 150k| bigint_shl1(m_data.mutable_data(), new_size, size, shift_words, shift_bits); 270| | 271| 150k| return (*this); 272| 150k|} _ZN5Botan6BigIntrSEm: 277| 2.95M|BigInt& BigInt::operator>>=(size_t shift) { 278| 2.95M| const size_t shift_words = shift / BOTAN_MP_WORD_BITS; ------------------ | | 50| 2.95M|#define BOTAN_MP_WORD_BITS 64 ------------------ 279| 2.95M| const size_t shift_bits = shift % BOTAN_MP_WORD_BITS; ------------------ | | 50| 2.95M|#define BOTAN_MP_WORD_BITS 64 ------------------ 280| | 281| 2.95M| bigint_shr1(m_data.mutable_data(), m_data.size(), shift_words, shift_bits); 282| | 283| 2.95M| if(is_negative() && is_zero()) { ------------------ | Branch (283:7): [True: 0, False: 2.95M] | Branch (283:24): [True: 0, False: 0] ------------------ 284| 0| set_sign(Positive); 285| 0| } 286| | 287| 2.95M| return (*this); 288| 2.95M|} _ZN5Botan6BigInt4add2ERKS0_PKmmNS0_4SignE: 19| 336k|BigInt BigInt::add2(const BigInt& x, const word y[], size_t y_words, BigInt::Sign y_sign) { 20| 336k| const size_t x_sw = x.sig_words(); 21| | 22| 336k| BigInt z = BigInt::with_capacity(std::max(x_sw, y_words) + 1); 23| | 24| 336k| if(x.sign() == y_sign) { ------------------ | Branch (24:7): [True: 251k, False: 85.6k] ------------------ 25| 251k| bigint_add3(z.mutable_data(), x.data(), x_sw, y, y_words); 26| 251k| z.set_sign(x.sign()); 27| 251k| } else { 28| 85.6k| 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| 85.6k| if(relative_size < 0) { ------------------ | Branch (31:10): [True: 29.9k, False: 55.7k] ------------------ 32| 29.9k| z.set_sign(y_sign); 33| 55.7k| } else if(relative_size == 0) { ------------------ | Branch (33:17): [True: 4, False: 55.7k] ------------------ 34| 4| z.set_sign(BigInt::Positive); 35| 55.7k| } else { 36| 55.7k| z.set_sign(x.sign()); 37| 55.7k| } 38| 85.6k| } 39| | 40| 336k| return z; 41| 336k|} _ZN5BotanmlERKNS_6BigIntES2_: 46| 303k|BigInt operator*(const BigInt& x, const BigInt& y) { 47| 303k| const size_t x_sw = x.sig_words(); 48| 303k| const size_t y_sw = y.sig_words(); 49| | 50| 303k| BigInt z = BigInt::with_capacity(x.size() + y.size()); 51| | 52| 303k| if(x_sw == 1 && y_sw) { ------------------ | Branch (52:7): [True: 99.2k, False: 203k] | Branch (52:20): [True: 98.8k, False: 398] ------------------ 53| 98.8k| bigint_linmul3(z.mutable_data(), y.data(), y_sw, x.word_at(0)); 54| 204k| } else if(y_sw == 1 && x_sw) { ------------------ | Branch (54:14): [True: 90.0k, False: 114k] | Branch (54:27): [True: 89.2k, False: 842] ------------------ 55| 89.2k| bigint_linmul3(z.mutable_data(), x.data(), x_sw, y.word_at(0)); 56| 115k| } else if(x_sw && y_sw) { ------------------ | Branch (56:14): [True: 113k, False: 1.59k] | Branch (56:22): [True: 112k, False: 757] ------------------ 57| 112k| secure_vector workspace(z.size()); 58| | 59| 112k| bigint_mul(z.mutable_data(), 60| 112k| z.size(), 61| 112k| x.data(), 62| 112k| x.size(), 63| 112k| x_sw, 64| 112k| y.data(), 65| 112k| y.size(), 66| 112k| y_sw, 67| 112k| workspace.data(), 68| 112k| workspace.size()); 69| 112k| } 70| | 71| 303k| z.cond_flip_sign(x_sw > 0 && y_sw > 0 && x.sign() != y.sign()); ------------------ | Branch (71:21): [True: 301k, False: 1.59k] | Branch (71:33): [True: 300k, False: 757] | Branch (71:45): [True: 64.7k, False: 236k] ------------------ 72| | 73| 303k| return z; 74| 303k|} _ZN5BotanmlERKNS_6BigIntEm: 79| 180k|BigInt operator*(const BigInt& x, word y) { 80| 180k| const size_t x_sw = x.sig_words(); 81| | 82| 180k| BigInt z = BigInt::with_capacity(x_sw + 1); 83| | 84| 180k| if(x_sw && y) { ------------------ | Branch (84:7): [True: 180k, False: 0] | Branch (84:15): [True: 90.7k, False: 90.1k] ------------------ 85| 90.7k| bigint_linmul3(z.mutable_data(), x.data(), x_sw, y); 86| 90.7k| z.set_sign(x.sign()); 87| 90.7k| } 88| | 89| 180k| return z; 90| 180k|} _ZN5BotandvERKNS_6BigIntES2_: 95| 1.26k|BigInt operator/(const BigInt& x, const BigInt& y) { 96| 1.26k| if(y.sig_words() == 1) { ------------------ | Branch (96:7): [True: 32, False: 1.22k] ------------------ 97| 32| return x / y.word_at(0); 98| 32| } 99| | 100| 1.22k| BigInt q, r; 101| 1.22k| vartime_divide(x, y, q, r); 102| 1.22k| return q; 103| 1.26k|} _ZN5BotandvERKNS_6BigIntEm: 108| 114k|BigInt operator/(const BigInt& x, word y) { 109| 114k| if(y == 0) { ------------------ | Branch (109:7): [True: 0, False: 114k] ------------------ 110| 0| throw Invalid_Argument("BigInt::operator/ divide by zero"); 111| 0| } 112| | 113| 114k| BigInt q; 114| 114k| word r; 115| 114k| ct_divide_word(x, y, q, r); 116| 114k| return q; 117| 114k|} _ZN5BotanrmERKNS_6BigIntES2_: 122| 125k|BigInt operator%(const BigInt& n, const BigInt& mod) { 123| 125k| if(mod.is_zero()) { ------------------ | Branch (123:7): [True: 0, False: 125k] ------------------ 124| 0| throw Invalid_Argument("BigInt::operator% divide by zero"); 125| 0| } 126| 125k| if(mod.is_negative()) { ------------------ | Branch (126:7): [True: 0, False: 125k] ------------------ 127| 0| throw Invalid_Argument("BigInt::operator% modulus must be > 0"); 128| 0| } 129| 125k| if(n.is_positive() && mod.is_positive() && n < mod) { ------------------ | Branch (129:7): [True: 123k, False: 1.39k] | Branch (129:26): [True: 123k, False: 0] | Branch (129:47): [True: 17.9k, False: 105k] ------------------ 130| 17.9k| return n; 131| 17.9k| } 132| | 133| 107k| if(mod.sig_words() == 1) { ------------------ | Branch (133:7): [True: 33.4k, False: 73.9k] ------------------ 134| 33.4k| return BigInt::from_word(n % mod.word_at(0)); 135| 33.4k| } 136| | 137| 73.9k| BigInt q, r; 138| 73.9k| vartime_divide(n, mod, q, r); 139| 73.9k| return r; 140| 107k|} _ZN5BotanrmERKNS_6BigIntEm: 145| 287k|word operator%(const BigInt& n, word mod) { 146| 287k| if(mod == 0) { ------------------ | Branch (146:7): [True: 0, False: 287k] ------------------ 147| 0| throw Invalid_Argument("BigInt::operator% divide by zero"); 148| 0| } 149| | 150| 287k| if(mod == 1) { ------------------ | Branch (150:7): [True: 0, False: 287k] ------------------ 151| 0| return 0; 152| 0| } 153| | 154| 287k| word remainder = 0; 155| | 156| 287k| if(is_power_of_2(mod)) { ------------------ | Branch (156:7): [True: 253k, False: 33.4k] ------------------ 157| 253k| remainder = (n.word_at(0) & (mod - 1)); 158| 253k| } else { 159| 33.4k| const size_t sw = n.sig_words(); 160| 88.5k| for(size_t i = sw; i > 0; --i) { ------------------ | Branch (160:26): [True: 55.1k, False: 33.4k] ------------------ 161| 55.1k| remainder = bigint_modop(remainder, n.word_at(i - 1), mod); 162| 55.1k| } 163| 33.4k| } 164| | 165| 287k| if(remainder && n.sign() == BigInt::Negative) { ------------------ | Branch (165:7): [True: 287k, False: 0] | Branch (165:20): [True: 46, False: 287k] ------------------ 166| 46| return mod - remainder; 167| 46| } 168| 287k| return remainder; 169| 287k|} _ZN5BotanlsERKNS_6BigIntEm: 174| 75.5k|BigInt operator<<(const BigInt& x, size_t shift) { 175| 75.5k| const size_t shift_words = shift / BOTAN_MP_WORD_BITS, shift_bits = shift % BOTAN_MP_WORD_BITS; ------------------ | | 50| 75.5k|#define BOTAN_MP_WORD_BITS 64 ------------------ const size_t shift_words = shift / BOTAN_MP_WORD_BITS, shift_bits = shift % BOTAN_MP_WORD_BITS; ------------------ | | 50| 75.5k|#define BOTAN_MP_WORD_BITS 64 ------------------ 176| | 177| 75.5k| const size_t x_sw = x.sig_words(); 178| | 179| 75.5k| BigInt y = BigInt::with_capacity(x_sw + shift_words + (shift_bits ? 1 : 0)); ------------------ | Branch (179:59): [True: 372, False: 75.1k] ------------------ 180| 75.5k| bigint_shl2(y.mutable_data(), x.data(), x_sw, shift_words, shift_bits); 181| 75.5k| y.set_sign(x.sign()); 182| 75.5k| return y; 183| 75.5k|} _ZN5BotanrsERKNS_6BigIntEm: 188| 1.65k|BigInt operator>>(const BigInt& x, size_t shift) { 189| 1.65k| const size_t shift_words = shift / BOTAN_MP_WORD_BITS; ------------------ | | 50| 1.65k|#define BOTAN_MP_WORD_BITS 64 ------------------ 190| 1.65k| const size_t shift_bits = shift % BOTAN_MP_WORD_BITS; ------------------ | | 50| 1.65k|#define BOTAN_MP_WORD_BITS 64 ------------------ 191| 1.65k| const size_t x_sw = x.sig_words(); 192| | 193| 1.65k| if(shift_words >= x_sw) { ------------------ | Branch (193:7): [True: 0, False: 1.65k] ------------------ 194| 0| return BigInt::zero(); 195| 0| } 196| | 197| 1.65k| BigInt y = BigInt::with_capacity(x_sw - shift_words); 198| 1.65k| bigint_shr2(y.mutable_data(), x.data(), x_sw, shift_words, shift_bits); 199| | 200| 1.65k| if(x.is_negative() && y.is_zero()) { ------------------ | Branch (200:7): [True: 0, False: 1.65k] | Branch (200:26): [True: 0, False: 0] ------------------ 201| 0| y.set_sign(BigInt::Positive); 202| 1.65k| } else { 203| 1.65k| y.set_sign(x.sign()); 204| 1.65k| } 205| | 206| 1.65k| return y; 207| 1.65k|} _ZN5Botan6BigIntC2Em: 18| 1.05k|BigInt::BigInt(uint64_t n) { 19| 1.05k|#if BOTAN_MP_WORD_BITS == 64 20| 1.05k| m_data.set_word_at(0, n); 21| |#else 22| | m_data.set_word_at(1, static_cast(n >> 32)); 23| | m_data.set_word_at(0, static_cast(n)); 24| |#endif 25| 1.05k|} _ZN5Botan6BigInt8from_u64Em: 28| 288|BigInt BigInt::from_u64(uint64_t n) { 29| 288| BigInt bn; 30| | 31| 288|#if BOTAN_MP_WORD_BITS == 64 32| 288| bn.set_word_at(0, n); 33| |#else 34| | bn.set_word_at(1, static_cast(n >> 32)); 35| | bn.set_word_at(0, static_cast(n)); 36| |#endif 37| | 38| 288| return bn; 39| 288|} _ZN5Botan6BigInt9from_wordEm: 42| 40.9k|BigInt BigInt::from_word(word n) { 43| 40.9k| BigInt bn; 44| 40.9k| bn.set_word_at(0, n); 45| 40.9k| return bn; 46| 40.9k|} _ZN5Botan6BigInt8from_s32Ei: 49| 288|BigInt BigInt::from_s32(int32_t n) { 50| 288| if(n >= 0) { ------------------ | Branch (50:7): [True: 0, False: 288] ------------------ 51| 0| return BigInt::from_u64(static_cast(n)); 52| 288| } else { 53| 288| return -BigInt::from_u64(static_cast(-n)); 54| 288| } 55| 288|} _ZN5Botan6BigInt13with_capacityEm: 58| 1.20M|BigInt BigInt::with_capacity(size_t size) { 59| 1.20M| BigInt bn; 60| 1.20M| bn.grow_to(size); 61| 1.20M| return bn; 62| 1.20M|} _ZN5Botan6BigIntC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 67| 895|BigInt::BigInt(std::string_view str) { 68| 895| Base base = Decimal; 69| 895| size_t markers = 0; 70| 895| bool negative = false; 71| | 72| 895| if(str.length() > 0 && str[0] == '-') { ------------------ | Branch (72:7): [True: 895, False: 0] | Branch (72:27): [True: 0, False: 895] ------------------ 73| 0| markers += 1; 74| 0| negative = true; 75| 0| } 76| | 77| 895| if(str.length() > markers + 2 && str[markers] == '0' && str[markers + 1] == 'x') { ------------------ | Branch (77:7): [True: 755, False: 140] | Branch (77:37): [True: 755, False: 0] | Branch (77:60): [True: 755, False: 0] ------------------ 78| 755| markers += 2; 79| 755| base = Hexadecimal; 80| 755| } 81| | 82| 895| *this = decode(cast_char_ptr_to_uint8(str.data()) + markers, str.length() - markers, base); 83| | 84| 895| if(negative) { ------------------ | Branch (84:7): [True: 0, False: 895] ------------------ 85| 0| set_sign(Negative); 86| 895| } else { 87| 895| set_sign(Positive); 88| 895| } 89| 895|} _ZN5Botan6BigIntC2EPKhm: 91| 13.5k|BigInt::BigInt(const uint8_t input[], size_t length) { binary_decode(input, length); } _ZN5Botan6BigInt24from_bytes_with_max_bitsEPKhmm: 99| 244|BigInt BigInt::from_bytes_with_max_bits(const uint8_t input[], size_t length, size_t max_bits) { 100| 244| const size_t input_bits = 8 * length; 101| | 102| 244| BigInt bn; 103| 244| bn.binary_decode(input, length); 104| | 105| 244| if(input_bits > max_bits) { ------------------ | Branch (105:7): [True: 119, False: 125] ------------------ 106| 119| const size_t bits_to_shift = input_bits - max_bits; 107| | 108| 119| bn >>= bits_to_shift; 109| 119| } 110| | 111| 244| return bn; 112| 244|} _ZNK5Botan6BigInt7byte_atEm: 119| 9.62k|uint8_t BigInt::byte_at(size_t n) const { 120| 9.62k| return get_byte_var(sizeof(word) - (n % sizeof(word)) - 1, word_at(n / sizeof(word))); 121| 9.62k|} _ZNK5Botan6BigInt8cmp_wordEm: 123| 614k|int32_t BigInt::cmp_word(word other) const { 124| 614k| if(is_negative()) { ------------------ | Branch (124:7): [True: 1.69k, False: 613k] ------------------ 125| 1.69k| return -1; // other is positive ... 126| 1.69k| } 127| | 128| 613k| const size_t sw = this->sig_words(); 129| 613k| if(sw > 1) { ------------------ | Branch (129:7): [True: 554k, False: 59.1k] ------------------ 130| 554k| return 1; // must be larger since other is just one word ... 131| 554k| } 132| | 133| 59.1k| return bigint_cmp(this->data(), sw, &other, 1); 134| 613k|} _ZNK5Botan6BigInt3cmpERKS0_b: 139| 4.29k|int32_t BigInt::cmp(const BigInt& other, bool check_signs) const { 140| 4.29k| if(check_signs) { ------------------ | Branch (140:7): [True: 4.29k, False: 0] ------------------ 141| 4.29k| if(other.is_positive() && this->is_negative()) { ------------------ | Branch (141:10): [True: 4.29k, False: 0] | Branch (141:33): [True: 0, False: 4.29k] ------------------ 142| 0| return -1; 143| 0| } 144| | 145| 4.29k| if(other.is_negative() && this->is_positive()) { ------------------ | Branch (145:10): [True: 0, False: 4.29k] | Branch (145:33): [True: 0, False: 0] ------------------ 146| 0| return 1; 147| 0| } 148| | 149| 4.29k| if(other.is_negative() && this->is_negative()) { ------------------ | Branch (149:10): [True: 0, False: 4.29k] | Branch (149:33): [True: 0, False: 0] ------------------ 150| 0| return (-bigint_cmp(this->data(), this->size(), other.data(), other.size())); 151| 0| } 152| 4.29k| } 153| | 154| 4.29k| return bigint_cmp(this->data(), this->size(), other.data(), other.size()); 155| 4.29k|} _ZNK5Botan6BigInt8is_equalERKS0_: 157| 90.1k|bool BigInt::is_equal(const BigInt& other) const { 158| 90.1k| if(this->sign() != other.sign()) { ------------------ | Branch (158:7): [True: 0, False: 90.1k] ------------------ 159| 0| return false; 160| 0| } 161| | 162| 90.1k| return bigint_ct_is_eq(this->data(), this->sig_words(), other.data(), other.sig_words()).is_set(); 163| 90.1k|} _ZNK5Botan6BigInt12is_less_thanERKS0_: 165| 266k|bool BigInt::is_less_than(const BigInt& other) const { 166| 266k| if(this->is_negative() && other.is_positive()) { ------------------ | Branch (166:7): [True: 42, False: 266k] | Branch (166:30): [True: 42, False: 0] ------------------ 167| 42| return true; 168| 42| } 169| | 170| 266k| if(this->is_positive() && other.is_negative()) { ------------------ | Branch (170:7): [True: 266k, False: 0] | Branch (170:30): [True: 0, False: 266k] ------------------ 171| 0| return false; 172| 0| } 173| | 174| 266k| if(other.is_negative() && this->is_negative()) { ------------------ | Branch (174:7): [True: 0, False: 266k] | 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| 266k| return bigint_ct_is_lt(this->data(), this->sig_words(), other.data(), other.sig_words()).is_set(); 179| 266k|} _ZNK5Botan6BigInt12encode_wordsEPmm: 181| 536k|void BigInt::encode_words(word out[], size_t size) const { 182| 536k| const size_t words = sig_words(); 183| | 184| 536k| if(words > size) { ------------------ | Branch (184:7): [True: 0, False: 536k] ------------------ 185| 0| throw Encoding_Error("BigInt::encode_words value too large to encode"); 186| 0| } 187| | 188| 536k| clear_mem(out, size); 189| 536k| copy_mem(out, data(), words); 190| 536k|} _ZNK5Botan6BigInt4Data14calc_sig_wordsEv: 192| 11.3M|size_t BigInt::Data::calc_sig_words() const { 193| 11.3M| const size_t sz = m_reg.size(); 194| 11.3M| size_t sig = sz; 195| | 196| 11.3M| word sub = 1; 197| | 198| 122M| for(size_t i = 0; i != sz; ++i) { ------------------ | Branch (198:22): [True: 110M, False: 11.3M] ------------------ 199| 110M| const word w = m_reg[sz - i - 1]; 200| 110M| sub &= ct_is_zero(w); 201| 110M| sig -= sub; 202| 110M| } 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| 11.3M| CT::unpoison(sig); 209| | 210| 11.3M| return sig; 211| 11.3M|} _ZNK5Botan6BigInt13get_substringEmm: 216| 288k|uint32_t BigInt::get_substring(size_t offset, size_t length) const { 217| 288k| if(length == 0 || length > 32) { ------------------ | Branch (217:7): [True: 0, False: 288k] | Branch (217:22): [True: 0, False: 288k] ------------------ 218| 0| throw Invalid_Argument("BigInt::get_substring invalid substring length"); 219| 0| } 220| | 221| 288k| const uint32_t mask = 0xFFFFFFFF >> (32 - length); 222| | 223| 288k| const size_t word_offset = offset / BOTAN_MP_WORD_BITS; ------------------ | | 50| 288k|#define BOTAN_MP_WORD_BITS 64 ------------------ 224| 288k| const size_t wshift = (offset % BOTAN_MP_WORD_BITS); ------------------ | | 50| 288k|#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| 288k| const word w0 = word_at(word_offset); 232| | 233| 288k| if(wshift == 0 || (offset + length) / BOTAN_MP_WORD_BITS == word_offset) { ------------------ | | 50| 266k|#define BOTAN_MP_WORD_BITS 64 ------------------ | Branch (233:7): [True: 22.2k, False: 266k] | Branch (233:22): [True: 256k, False: 10.3k] ------------------ 234| 278k| return static_cast(w0 >> wshift) & mask; 235| 278k| } else { 236| 10.3k| const word w1 = word_at(word_offset + 1); 237| 10.3k| return static_cast((w0 >> wshift) | (w1 << (BOTAN_MP_WORD_BITS - wshift))) & mask; ------------------ | | 50| 10.3k|#define BOTAN_MP_WORD_BITS 64 ------------------ 238| 10.3k| } 239| 288k|} _ZNK5Botan6BigInt5bytesEv: 271| 12.6k|size_t BigInt::bytes() const { return round_up(bits(), 8) / 8; } _ZNK5Botan6BigInt13top_bits_freeEv: 273| 373k|size_t BigInt::top_bits_free() const { 274| 373k| const size_t words = sig_words(); 275| | 276| 373k| const word top_word = word_at(words - 1); 277| 373k| const size_t bits_used = high_bit(top_word); 278| 373k| CT::unpoison(bits_used); 279| 373k| return BOTAN_MP_WORD_BITS - bits_used; ------------------ | | 50| 373k|#define BOTAN_MP_WORD_BITS 64 ------------------ 280| 373k|} _ZNK5Botan6BigInt4bitsEv: 282| 150k|size_t BigInt::bits() const { 283| 150k| const size_t words = sig_words(); 284| | 285| 150k| if(words == 0) { ------------------ | Branch (285:7): [True: 2.27k, False: 148k] ------------------ 286| 2.27k| return 0; 287| 2.27k| } 288| | 289| 148k| const size_t full_words = (words - 1) * BOTAN_MP_WORD_BITS; ------------------ | | 50| 148k|#define BOTAN_MP_WORD_BITS 64 ------------------ 290| 148k| const size_t top_bits = BOTAN_MP_WORD_BITS - top_bits_free(); ------------------ | | 50| 148k|#define BOTAN_MP_WORD_BITS 64 ------------------ 291| | 292| 148k| return full_words + top_bits; 293| 150k|} _ZNK5Botan6BigIntngEv: 298| 357|BigInt BigInt::operator-() const { 299| 357| BigInt x = (*this); 300| 357| x.flip_sign(); 301| 357| return x; 302| 357|} _ZN5Botan6BigInt12reduce_belowERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 304| 931k|size_t BigInt::reduce_below(const BigInt& p, secure_vector& ws) { 305| 931k| if(p.is_negative() || this->is_negative()) { ------------------ | Branch (305:7): [True: 0, False: 931k] | Branch (305:26): [True: 0, False: 931k] ------------------ 306| 0| throw Invalid_Argument("BigInt::reduce_below both values must be positive"); 307| 0| } 308| | 309| 931k| const size_t p_words = p.sig_words(); 310| | 311| 931k| if(size() < p_words + 1) { ------------------ | Branch (311:7): [True: 7, False: 931k] ------------------ 312| 7| grow_to(p_words + 1); 313| 7| } 314| | 315| 931k| if(ws.size() < p_words + 1) { ------------------ | Branch (315:7): [True: 75.1k, False: 856k] ------------------ 316| 75.1k| ws.resize(p_words + 1); 317| 75.1k| } 318| | 319| 931k| clear_mem(ws.data(), ws.size()); 320| | 321| 931k| size_t reductions = 0; 322| | 323| 2.31M| for(;;) { 324| 2.31M| word borrow = bigint_sub3(ws.data(), data(), p_words + 1, p.data(), p_words); 325| 2.31M| if(borrow) { ------------------ | Branch (325:10): [True: 931k, False: 1.38M] ------------------ 326| 931k| break; 327| 931k| } 328| | 329| 1.38M| ++reductions; 330| 1.38M| swap_reg(ws); 331| 1.38M| } 332| | 333| 931k| return reductions; 334| 931k|} _ZN5Botan6BigInt15ct_reduce_belowERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEEm: 336| 1.19M|void BigInt::ct_reduce_below(const BigInt& mod, secure_vector& ws, size_t bound) { 337| 1.19M| if(mod.is_negative() || this->is_negative()) { ------------------ | Branch (337:7): [True: 0, False: 1.19M] | Branch (337:28): [True: 0, False: 1.19M] ------------------ 338| 0| throw Invalid_Argument("BigInt::ct_reduce_below both values must be positive"); 339| 0| } 340| | 341| 1.19M| const size_t mod_words = mod.sig_words(); 342| | 343| 1.19M| grow_to(mod_words); 344| | 345| 1.19M| const size_t sz = size(); 346| | 347| 1.19M| ws.resize(sz); 348| | 349| 1.19M| clear_mem(ws.data(), sz); 350| | 351| 3.59M| for(size_t i = 0; i != bound; ++i) { ------------------ | Branch (351:22): [True: 2.39M, False: 1.19M] ------------------ 352| 2.39M| word borrow = bigint_sub3(ws.data(), data(), sz, mod.data(), mod_words); 353| | 354| 2.39M| CT::Mask::is_zero(borrow).select_n(mutable_data(), ws.data(), data(), sz); 355| 2.39M| } 356| 1.19M|} _ZNK5Botan6BigInt3absEv: 361| 1.35k|BigInt BigInt::abs() const { 362| 1.35k| BigInt x = (*this); 363| 1.35k| x.set_sign(Positive); 364| 1.35k| return x; 365| 1.35k|} _ZNK5Botan6BigInt13binary_encodeEPh: 367| 5.29k|void BigInt::binary_encode(uint8_t buf[]) const { this->binary_encode(buf, bytes()); } _ZNK5Botan6BigInt13binary_encodeEPhm: 372| 6.34k|void BigInt::binary_encode(uint8_t output[], size_t len) const { 373| 6.34k| const size_t full_words = len / sizeof(word); 374| 6.34k| const size_t extra_bytes = len % sizeof(word); 375| | 376| 25.2k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (376:22): [True: 18.9k, False: 6.34k] ------------------ 377| 18.9k| const word w = word_at(i); 378| 18.9k| store_be(w, output + (len - (i + 1) * sizeof(word))); 379| 18.9k| } 380| | 381| 6.34k| if(extra_bytes > 0) { ------------------ | Branch (381:7): [True: 4.08k, False: 2.25k] ------------------ 382| 4.08k| const word w = word_at(full_words); 383| | 384| 14.5k| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (384:25): [True: 10.4k, False: 4.08k] ------------------ 385| 10.4k| output[extra_bytes - i - 1] = get_byte_var(sizeof(word) - i - 1, w); 386| 10.4k| } 387| 4.08k| } 388| 6.34k|} _ZN5Botan6BigInt13binary_decodeEPKhm: 393| 15.0k|void BigInt::binary_decode(const uint8_t buf[], size_t length) { 394| 15.0k| clear(); 395| | 396| 15.0k| const size_t full_words = length / sizeof(word); 397| 15.0k| const size_t extra_bytes = length % sizeof(word); 398| | 399| 15.0k| secure_vector reg((round_up(full_words + (extra_bytes > 0 ? 1 : 0), 8))); ------------------ | Branch (399:52): [True: 11.8k, False: 3.25k] ------------------ 400| | 401| 68.9k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (401:22): [True: 53.8k, False: 15.0k] ------------------ 402| 53.8k| reg[i] = load_be(buf + length - sizeof(word) * (i + 1), 0); 403| 53.8k| } 404| | 405| 15.0k| if(extra_bytes > 0) { ------------------ | Branch (405:7): [True: 11.8k, False: 3.25k] ------------------ 406| 43.0k| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (406:25): [True: 31.2k, False: 11.8k] ------------------ 407| 31.2k| reg[full_words] = (reg[full_words] << 8) | buf[i]; 408| 31.2k| } 409| 11.8k| } 410| | 411| 15.0k| m_data.swap(reg); 412| 15.0k|} _ZN5Botan6BigInt11ct_cond_addEbRKS0_: 414| 273k|void BigInt::ct_cond_add(bool predicate, const BigInt& value) { 415| 273k| if(this->is_negative() || value.is_negative()) { ------------------ | Branch (415:7): [True: 0, False: 273k] | Branch (415:30): [True: 0, False: 273k] ------------------ 416| 0| throw Invalid_Argument("BigInt::ct_cond_add requires both values to be positive"); 417| 0| } 418| 273k| this->grow_to(1 + value.sig_words()); 419| | 420| 273k| bigint_cnd_add(static_cast(predicate), this->mutable_data(), this->size(), value.data(), value.sig_words()); 421| 273k|} _ZN5Botan6BigInt12ct_cond_swapEbRS0_: 423| 3.33M|void BigInt::ct_cond_swap(bool predicate, BigInt& other) { 424| 3.33M| const size_t max_words = std::max(size(), other.size()); 425| 3.33M| grow_to(max_words); 426| 3.33M| other.grow_to(max_words); 427| | 428| 3.33M| bigint_cnd_swap(predicate, this->mutable_data(), other.mutable_data(), max_words); 429| 3.33M|} _ZN5Botan6BigInt14cond_flip_signEb: 431| 2.96M|void BigInt::cond_flip_sign(bool predicate) { 432| | // This code is assuming Negative == 0, Positive == 1 433| | 434| 2.96M| const auto mask = CT::Mask::expand(predicate); 435| | 436| 2.96M| const uint8_t current_sign = static_cast(sign()); 437| | 438| 2.96M| const uint8_t new_sign = mask.select(current_sign ^ 1, current_sign); 439| | 440| 2.96M| set_sign(static_cast(new_sign)); 441| 2.96M|} _ZN5Botan6BigInt14ct_cond_assignEbRKS0_: 443| 182k|void BigInt::ct_cond_assign(bool predicate, const BigInt& other) { 444| 182k| const size_t t_words = size(); 445| 182k| const size_t o_words = other.size(); 446| | 447| 182k| if(o_words < t_words) { ------------------ | Branch (447:7): [True: 2.83k, False: 179k] ------------------ 448| 2.83k| grow_to(o_words); 449| 2.83k| } 450| | 451| 182k| const size_t r_words = std::max(t_words, o_words); 452| | 453| 182k| const auto mask = CT::Mask::expand(predicate); 454| | 455| 1.69M| for(size_t i = 0; i != r_words; ++i) { ------------------ | Branch (455:22): [True: 1.51M, False: 182k] ------------------ 456| 1.51M| const word o_word = other.word_at(i); 457| 1.51M| const word t_word = this->word_at(i); 458| 1.51M| this->set_word_at(i, mask.select(o_word, t_word)); 459| 1.51M| } 460| | 461| 182k| const bool different_sign = sign() != other.sign(); 462| 182k| cond_flip_sign(predicate && different_sign); ------------------ | Branch (462:19): [True: 69.9k, False: 112k] | Branch (462:32): [True: 0, False: 69.9k] ------------------ 463| 182k|} _ZN5Botan9ct_divideERKNS_6BigIntES2_RS0_S3_: 48| 2.92k|void ct_divide(const BigInt& x, const BigInt& y, BigInt& q_out, BigInt& r_out) { 49| 2.92k| if(y.is_zero()) { ------------------ | Branch (49:7): [True: 0, False: 2.92k] ------------------ 50| 0| throw Invalid_Argument("ct_divide: cannot divide by zero"); 51| 0| } 52| | 53| 2.92k| const size_t x_words = x.sig_words(); 54| 2.92k| const size_t y_words = y.sig_words(); 55| | 56| 2.92k| const size_t x_bits = x.bits(); 57| | 58| 2.92k| BigInt q = BigInt::with_capacity(x_words); 59| 2.92k| BigInt r = BigInt::with_capacity(y_words); 60| 2.92k| BigInt t = BigInt::with_capacity(y_words); // a temporary 61| | 62| 3.33M| for(size_t i = 0; i != x_bits; ++i) { ------------------ | Branch (62:22): [True: 3.33M, False: 2.92k] ------------------ 63| 3.33M| const size_t b = x_bits - 1 - i; 64| 3.33M| const bool x_b = x.get_bit(b); 65| | 66| 3.33M| r *= 2; 67| 3.33M| r.conditionally_set_bit(0, x_b); 68| | 69| 3.33M| const bool r_gte_y = bigint_sub3(t.mutable_data(), r.data(), r.size(), y.data(), y_words) == 0; 70| | 71| 3.33M| q.conditionally_set_bit(b, r_gte_y); 72| 3.33M| r.ct_cond_swap(r_gte_y, t); 73| 3.33M| } 74| | 75| 2.92k| sign_fixup(x, y, q, r); 76| 2.92k| r_out = r; 77| 2.92k| q_out = q; 78| 2.92k|} _ZN5Botan14ct_divide_wordERKNS_6BigIntEmRS0_Rm: 80| 114k|void ct_divide_word(const BigInt& x, word y, BigInt& q_out, word& r_out) { 81| 114k| if(y == 0) { ------------------ | Branch (81:7): [True: 0, False: 114k] ------------------ 82| 0| throw Invalid_Argument("ct_divide_word: cannot divide by zero"); 83| 0| } 84| | 85| 114k| const size_t x_words = x.sig_words(); 86| 114k| const size_t x_bits = x.bits(); 87| | 88| 114k| BigInt q = BigInt::with_capacity(x_words); 89| 114k| word r = 0; 90| | 91| 17.7M| for(size_t i = 0; i != x_bits; ++i) { ------------------ | Branch (91:22): [True: 17.6M, False: 114k] ------------------ 92| 17.6M| const size_t b = x_bits - 1 - i; 93| 17.6M| const bool x_b = x.get_bit(b); 94| | 95| 17.6M| const auto r_carry = CT::Mask::expand(r >> (BOTAN_MP_WORD_BITS - 1)); ------------------ | | 50| 17.6M|#define BOTAN_MP_WORD_BITS 64 ------------------ 96| | 97| 17.6M| r *= 2; 98| 17.6M| r += x_b; 99| | 100| 17.6M| const auto r_gte_y = CT::Mask::is_gte(r, y) | r_carry; 101| 17.6M| q.conditionally_set_bit(b, r_gte_y.is_set()); 102| 17.6M| r = r_gte_y.select(r - y, r); 103| 17.6M| } 104| | 105| 114k| if(x.is_negative()) { ------------------ | Branch (105:7): [True: 0, False: 114k] ------------------ 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| 114k| r_out = r; 114| 114k| q_out = q; 115| 114k|} _ZN5Botan14vartime_divideERKNS_6BigIntES2_RS0_S3_: 155| 75.1k|void vartime_divide(const BigInt& x, const BigInt& y_arg, BigInt& q_out, BigInt& r_out) { 156| 75.1k| if(y_arg.is_zero()) { ------------------ | Branch (156:7): [True: 0, False: 75.1k] ------------------ 157| 0| throw Invalid_Argument("vartime_divide: cannot divide by zero"); 158| 0| } 159| | 160| 75.1k| const size_t y_words = y_arg.sig_words(); 161| | 162| 75.1k| BOTAN_ASSERT_NOMSG(y_words > 0); ------------------ | | 60| 75.1k| do { \ | | 61| 75.1k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 75.1k] | | ------------------ | | 62| 75.1k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 75.1k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 163| | 164| 75.1k| BigInt y = y_arg; 165| | 166| 75.1k| BigInt r = x; 167| 75.1k| BigInt q = BigInt::zero(); 168| 75.1k| secure_vector ws; 169| | 170| 75.1k| r.set_sign(BigInt::Positive); 171| 75.1k| y.set_sign(BigInt::Positive); 172| | 173| | // Calculate shifts needed to normalize y with high bit set 174| 75.1k| const size_t shifts = y.top_bits_free(); 175| | 176| 75.1k| y <<= shifts; 177| 75.1k| r <<= shifts; 178| | 179| | // we know y has not changed size, since we only shifted up to set high bit 180| 75.1k| const size_t t = y_words - 1; 181| 75.1k| const size_t n = std::max(y_words, r.sig_words()) - 1; // r may have changed size however 182| | 183| 75.1k| BOTAN_ASSERT_NOMSG(n >= t); ------------------ | | 60| 75.1k| do { \ | | 61| 75.1k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 75.1k] | | ------------------ | | 62| 75.1k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 75.1k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 184| | 185| 75.1k| q.grow_to(n - t + 1); 186| | 187| 75.1k| word* q_words = q.mutable_data(); 188| | 189| 75.1k| BigInt shifted_y = y << (BOTAN_MP_WORD_BITS * (n - t)); ------------------ | | 50| 75.1k|#define BOTAN_MP_WORD_BITS 64 ------------------ 190| | 191| | // Set q_{n-t} to number of times r > shifted_y 192| 75.1k| q_words[n - t] = r.reduce_below(shifted_y, ws); 193| | 194| 75.1k| const word y_t0 = y.word_at(t); 195| 75.1k| const word y_t1 = y.word_at(t - 1); 196| 75.1k| BOTAN_DEBUG_ASSERT((y_t0 >> (BOTAN_MP_WORD_BITS - 1)) == 1); ------------------ | | 99| 75.1k| do { \ | | 100| 75.1k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 197| | 198| 165k| for(size_t j = n; j != t; --j) { ------------------ | Branch (198:22): [True: 89.8k, False: 75.1k] ------------------ 199| 89.8k| const word x_j0 = r.word_at(j); 200| 89.8k| const word x_j1 = r.word_at(j - 1); 201| 89.8k| const word x_j2 = r.word_at(j - 2); 202| | 203| 89.8k| word qjt = bigint_divop(x_j0, x_j1, y_t0); 204| | 205| 89.8k| qjt = CT::Mask::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| 89.8k| qjt -= division_check(qjt, y_t0, y_t1, x_j0, x_j1, x_j2); 209| 89.8k| qjt -= division_check(qjt, y_t0, y_t1, x_j0, x_j1, x_j2); 210| 89.8k| BOTAN_DEBUG_ASSERT(division_check(qjt, y_t0, y_t1, x_j0, x_j1, x_j2) == false); ------------------ | | 99| 89.8k| do { \ | | 100| 89.8k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 211| | 212| 89.8k| shifted_y >>= BOTAN_MP_WORD_BITS; ------------------ | | 50| 89.8k|#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| 89.8k| r -= qjt * shifted_y; 217| 89.8k| qjt -= r.is_negative(); 218| 89.8k| r += static_cast(r.is_negative()) * shifted_y; 219| | 220| 89.8k| q_words[j - t - 1] = qjt; 221| 89.8k| } 222| | 223| 75.1k| r >>= shifts; 224| | 225| 75.1k| sign_fixup(x, y_arg, q, r); 226| | 227| 75.1k| r_out = r; 228| 75.1k| q_out = q; 229| 75.1k|} divide.cpp:_ZN5Botan12_GLOBAL__N_110sign_fixupERKNS_6BigIntES3_RS1_S4_: 21| 78.0k|void sign_fixup(const BigInt& x, const BigInt& y, BigInt& q, BigInt& r) { 22| 78.0k| q.cond_flip_sign(x.sign() != y.sign()); 23| | 24| 78.0k| if(x.is_negative() && r.is_nonzero()) { ------------------ | Branch (24:7): [True: 1.35k, False: 76.7k] | Branch (24:26): [True: 1.35k, False: 0] ------------------ 25| 1.35k| q -= 1; 26| 1.35k| r = y.abs() - r; 27| 1.35k| } 28| 78.0k|} divide.cpp:_ZN5Botan12_GLOBAL__N_114division_checkEmmmmmm: 30| 179k|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| 179k| word y3 = 0; 37| 179k| y1 = word_madd2(q, y1, &y3); 38| 179k| y2 = word_madd2(q, y2, &y3); 39| | 40| 179k| const word x[3] = {x1, x2, x3}; 41| 179k| const word y[3] = {y1, y2, y3}; 42| | 43| 179k| return bigint_ct_is_lt(x, 3, y, 3).is_set(); 44| 179k|} _ZN5Botan17bigint_comba_sqr4EPmPKm: 16| 2.31M|void bigint_comba_sqr4(word z[8], const word x[4]) { 17| 2.31M| word w2 = 0, w1 = 0, w0 = 0; 18| | 19| 2.31M| word3_muladd(&w2, &w1, &w0, x[0], x[0]); 20| 2.31M| z[0] = w0; 21| 2.31M| w0 = 0; 22| | 23| 2.31M| word3_muladd_2(&w0, &w2, &w1, x[0], x[1]); 24| 2.31M| z[1] = w1; 25| 2.31M| w1 = 0; 26| | 27| 2.31M| word3_muladd_2(&w1, &w0, &w2, x[0], x[2]); 28| 2.31M| word3_muladd(&w1, &w0, &w2, x[1], x[1]); 29| 2.31M| z[2] = w2; 30| 2.31M| w2 = 0; 31| | 32| 2.31M| word3_muladd_2(&w2, &w1, &w0, x[0], x[3]); 33| 2.31M| word3_muladd_2(&w2, &w1, &w0, x[1], x[2]); 34| 2.31M| z[3] = w0; 35| 2.31M| w0 = 0; 36| | 37| 2.31M| word3_muladd_2(&w0, &w2, &w1, x[1], x[3]); 38| 2.31M| word3_muladd(&w0, &w2, &w1, x[2], x[2]); 39| 2.31M| z[4] = w1; 40| 2.31M| w1 = 0; 41| | 42| 2.31M| word3_muladd_2(&w1, &w0, &w2, x[2], x[3]); 43| 2.31M| z[5] = w2; 44| 2.31M| w2 = 0; 45| | 46| 2.31M| word3_muladd(&w2, &w1, &w0, x[3], x[3]); 47| 2.31M| z[6] = w0; 48| 2.31M| z[7] = w1; 49| 2.31M|} _ZN5Botan17bigint_comba_mul4EPmPKmS2_: 54| 5.12M|void bigint_comba_mul4(word z[8], const word x[4], const word y[4]) { 55| 5.12M| word w2 = 0, w1 = 0, w0 = 0; 56| | 57| 5.12M| word3_muladd(&w2, &w1, &w0, x[0], y[0]); 58| 5.12M| z[0] = w0; 59| 5.12M| w0 = 0; 60| | 61| 5.12M| word3_muladd(&w0, &w2, &w1, x[0], y[1]); 62| 5.12M| word3_muladd(&w0, &w2, &w1, x[1], y[0]); 63| 5.12M| z[1] = w1; 64| 5.12M| w1 = 0; 65| | 66| 5.12M| word3_muladd(&w1, &w0, &w2, x[0], y[2]); 67| 5.12M| word3_muladd(&w1, &w0, &w2, x[1], y[1]); 68| 5.12M| word3_muladd(&w1, &w0, &w2, x[2], y[0]); 69| 5.12M| z[2] = w2; 70| 5.12M| w2 = 0; 71| | 72| 5.12M| word3_muladd(&w2, &w1, &w0, x[0], y[3]); 73| 5.12M| word3_muladd(&w2, &w1, &w0, x[1], y[2]); 74| 5.12M| word3_muladd(&w2, &w1, &w0, x[2], y[1]); 75| 5.12M| word3_muladd(&w2, &w1, &w0, x[3], y[0]); 76| 5.12M| z[3] = w0; 77| 5.12M| w0 = 0; 78| | 79| 5.12M| word3_muladd(&w0, &w2, &w1, x[1], y[3]); 80| 5.12M| word3_muladd(&w0, &w2, &w1, x[2], y[2]); 81| 5.12M| word3_muladd(&w0, &w2, &w1, x[3], y[1]); 82| 5.12M| z[4] = w1; 83| 5.12M| w1 = 0; 84| | 85| 5.12M| word3_muladd(&w1, &w0, &w2, x[2], y[3]); 86| 5.12M| word3_muladd(&w1, &w0, &w2, x[3], y[2]); 87| 5.12M| z[5] = w2; 88| 5.12M| w2 = 0; 89| | 90| 5.12M| word3_muladd(&w2, &w1, &w0, x[3], y[3]); 91| 5.12M| z[6] = w0; 92| 5.12M| z[7] = w1; 93| 5.12M|} _ZN5Botan17bigint_comba_sqr6EPmPKm: 98| 218k|void bigint_comba_sqr6(word z[12], const word x[6]) { 99| 218k| word w2 = 0, w1 = 0, w0 = 0; 100| | 101| 218k| word3_muladd(&w2, &w1, &w0, x[0], x[0]); 102| 218k| z[0] = w0; 103| 218k| w0 = 0; 104| | 105| 218k| word3_muladd_2(&w0, &w2, &w1, x[0], x[1]); 106| 218k| z[1] = w1; 107| 218k| w1 = 0; 108| | 109| 218k| word3_muladd_2(&w1, &w0, &w2, x[0], x[2]); 110| 218k| word3_muladd(&w1, &w0, &w2, x[1], x[1]); 111| 218k| z[2] = w2; 112| 218k| w2 = 0; 113| | 114| 218k| word3_muladd_2(&w2, &w1, &w0, x[0], x[3]); 115| 218k| word3_muladd_2(&w2, &w1, &w0, x[1], x[2]); 116| 218k| z[3] = w0; 117| 218k| w0 = 0; 118| | 119| 218k| word3_muladd_2(&w0, &w2, &w1, x[0], x[4]); 120| 218k| word3_muladd_2(&w0, &w2, &w1, x[1], x[3]); 121| 218k| word3_muladd(&w0, &w2, &w1, x[2], x[2]); 122| 218k| z[4] = w1; 123| 218k| w1 = 0; 124| | 125| 218k| word3_muladd_2(&w1, &w0, &w2, x[0], x[5]); 126| 218k| word3_muladd_2(&w1, &w0, &w2, x[1], x[4]); 127| 218k| word3_muladd_2(&w1, &w0, &w2, x[2], x[3]); 128| 218k| z[5] = w2; 129| 218k| w2 = 0; 130| | 131| 218k| word3_muladd_2(&w2, &w1, &w0, x[1], x[5]); 132| 218k| word3_muladd_2(&w2, &w1, &w0, x[2], x[4]); 133| 218k| word3_muladd(&w2, &w1, &w0, x[3], x[3]); 134| 218k| z[6] = w0; 135| 218k| w0 = 0; 136| | 137| 218k| word3_muladd_2(&w0, &w2, &w1, x[2], x[5]); 138| 218k| word3_muladd_2(&w0, &w2, &w1, x[3], x[4]); 139| 218k| z[7] = w1; 140| 218k| w1 = 0; 141| | 142| 218k| word3_muladd_2(&w1, &w0, &w2, x[3], x[5]); 143| 218k| word3_muladd(&w1, &w0, &w2, x[4], x[4]); 144| 218k| z[8] = w2; 145| 218k| w2 = 0; 146| | 147| 218k| word3_muladd_2(&w2, &w1, &w0, x[4], x[5]); 148| 218k| z[9] = w0; 149| 218k| w0 = 0; 150| | 151| 218k| word3_muladd(&w0, &w2, &w1, x[5], x[5]); 152| 218k| z[10] = w1; 153| 218k| z[11] = w2; 154| 218k|} _ZN5Botan17bigint_comba_mul6EPmPKmS2_: 159| 179k|void bigint_comba_mul6(word z[12], const word x[6], const word y[6]) { 160| 179k| word w2 = 0, w1 = 0, w0 = 0; 161| | 162| 179k| word3_muladd(&w2, &w1, &w0, x[0], y[0]); 163| 179k| z[0] = w0; 164| 179k| w0 = 0; 165| | 166| 179k| word3_muladd(&w0, &w2, &w1, x[0], y[1]); 167| 179k| word3_muladd(&w0, &w2, &w1, x[1], y[0]); 168| 179k| z[1] = w1; 169| 179k| w1 = 0; 170| | 171| 179k| word3_muladd(&w1, &w0, &w2, x[0], y[2]); 172| 179k| word3_muladd(&w1, &w0, &w2, x[1], y[1]); 173| 179k| word3_muladd(&w1, &w0, &w2, x[2], y[0]); 174| 179k| z[2] = w2; 175| 179k| w2 = 0; 176| | 177| 179k| word3_muladd(&w2, &w1, &w0, x[0], y[3]); 178| 179k| word3_muladd(&w2, &w1, &w0, x[1], y[2]); 179| 179k| word3_muladd(&w2, &w1, &w0, x[2], y[1]); 180| 179k| word3_muladd(&w2, &w1, &w0, x[3], y[0]); 181| 179k| z[3] = w0; 182| 179k| w0 = 0; 183| | 184| 179k| word3_muladd(&w0, &w2, &w1, x[0], y[4]); 185| 179k| word3_muladd(&w0, &w2, &w1, x[1], y[3]); 186| 179k| word3_muladd(&w0, &w2, &w1, x[2], y[2]); 187| 179k| word3_muladd(&w0, &w2, &w1, x[3], y[1]); 188| 179k| word3_muladd(&w0, &w2, &w1, x[4], y[0]); 189| 179k| z[4] = w1; 190| 179k| w1 = 0; 191| | 192| 179k| word3_muladd(&w1, &w0, &w2, x[0], y[5]); 193| 179k| word3_muladd(&w1, &w0, &w2, x[1], y[4]); 194| 179k| word3_muladd(&w1, &w0, &w2, x[2], y[3]); 195| 179k| word3_muladd(&w1, &w0, &w2, x[3], y[2]); 196| 179k| word3_muladd(&w1, &w0, &w2, x[4], y[1]); 197| 179k| word3_muladd(&w1, &w0, &w2, x[5], y[0]); 198| 179k| z[5] = w2; 199| 179k| w2 = 0; 200| | 201| 179k| word3_muladd(&w2, &w1, &w0, x[1], y[5]); 202| 179k| word3_muladd(&w2, &w1, &w0, x[2], y[4]); 203| 179k| word3_muladd(&w2, &w1, &w0, x[3], y[3]); 204| 179k| word3_muladd(&w2, &w1, &w0, x[4], y[2]); 205| 179k| word3_muladd(&w2, &w1, &w0, x[5], y[1]); 206| 179k| z[6] = w0; 207| 179k| w0 = 0; 208| | 209| 179k| word3_muladd(&w0, &w2, &w1, x[2], y[5]); 210| 179k| word3_muladd(&w0, &w2, &w1, x[3], y[4]); 211| 179k| word3_muladd(&w0, &w2, &w1, x[4], y[3]); 212| 179k| word3_muladd(&w0, &w2, &w1, x[5], y[2]); 213| 179k| z[7] = w1; 214| 179k| w1 = 0; 215| | 216| 179k| word3_muladd(&w1, &w0, &w2, x[3], y[5]); 217| 179k| word3_muladd(&w1, &w0, &w2, x[4], y[4]); 218| 179k| word3_muladd(&w1, &w0, &w2, x[5], y[3]); 219| 179k| z[8] = w2; 220| 179k| w2 = 0; 221| | 222| 179k| word3_muladd(&w2, &w1, &w0, x[4], y[5]); 223| 179k| word3_muladd(&w2, &w1, &w0, x[5], y[4]); 224| 179k| z[9] = w0; 225| 179k| w0 = 0; 226| | 227| 179k| word3_muladd(&w0, &w2, &w1, x[5], y[5]); 228| 179k| z[10] = w1; 229| 179k| z[11] = w2; 230| 179k|} _ZN5Botan17bigint_comba_sqr8EPmPKm: 235| 25.6k|void bigint_comba_sqr8(word z[16], const word x[8]) { 236| 25.6k| word w2 = 0, w1 = 0, w0 = 0; 237| | 238| 25.6k| word3_muladd(&w2, &w1, &w0, x[0], x[0]); 239| 25.6k| z[0] = w0; 240| 25.6k| w0 = 0; 241| | 242| 25.6k| word3_muladd_2(&w0, &w2, &w1, x[0], x[1]); 243| 25.6k| z[1] = w1; 244| 25.6k| w1 = 0; 245| | 246| 25.6k| word3_muladd_2(&w1, &w0, &w2, x[0], x[2]); 247| 25.6k| word3_muladd(&w1, &w0, &w2, x[1], x[1]); 248| 25.6k| z[2] = w2; 249| 25.6k| w2 = 0; 250| | 251| 25.6k| word3_muladd_2(&w2, &w1, &w0, x[0], x[3]); 252| 25.6k| word3_muladd_2(&w2, &w1, &w0, x[1], x[2]); 253| 25.6k| z[3] = w0; 254| 25.6k| w0 = 0; 255| | 256| 25.6k| word3_muladd_2(&w0, &w2, &w1, x[0], x[4]); 257| 25.6k| word3_muladd_2(&w0, &w2, &w1, x[1], x[3]); 258| 25.6k| word3_muladd(&w0, &w2, &w1, x[2], x[2]); 259| 25.6k| z[4] = w1; 260| 25.6k| w1 = 0; 261| | 262| 25.6k| word3_muladd_2(&w1, &w0, &w2, x[0], x[5]); 263| 25.6k| word3_muladd_2(&w1, &w0, &w2, x[1], x[4]); 264| 25.6k| word3_muladd_2(&w1, &w0, &w2, x[2], x[3]); 265| 25.6k| z[5] = w2; 266| 25.6k| w2 = 0; 267| | 268| 25.6k| word3_muladd_2(&w2, &w1, &w0, x[0], x[6]); 269| 25.6k| word3_muladd_2(&w2, &w1, &w0, x[1], x[5]); 270| 25.6k| word3_muladd_2(&w2, &w1, &w0, x[2], x[4]); 271| 25.6k| word3_muladd(&w2, &w1, &w0, x[3], x[3]); 272| 25.6k| z[6] = w0; 273| 25.6k| w0 = 0; 274| | 275| 25.6k| word3_muladd_2(&w0, &w2, &w1, x[0], x[7]); 276| 25.6k| word3_muladd_2(&w0, &w2, &w1, x[1], x[6]); 277| 25.6k| word3_muladd_2(&w0, &w2, &w1, x[2], x[5]); 278| 25.6k| word3_muladd_2(&w0, &w2, &w1, x[3], x[4]); 279| 25.6k| z[7] = w1; 280| 25.6k| w1 = 0; 281| | 282| 25.6k| word3_muladd_2(&w1, &w0, &w2, x[1], x[7]); 283| 25.6k| word3_muladd_2(&w1, &w0, &w2, x[2], x[6]); 284| 25.6k| word3_muladd_2(&w1, &w0, &w2, x[3], x[5]); 285| 25.6k| word3_muladd(&w1, &w0, &w2, x[4], x[4]); 286| 25.6k| z[8] = w2; 287| 25.6k| w2 = 0; 288| | 289| 25.6k| word3_muladd_2(&w2, &w1, &w0, x[2], x[7]); 290| 25.6k| word3_muladd_2(&w2, &w1, &w0, x[3], x[6]); 291| 25.6k| word3_muladd_2(&w2, &w1, &w0, x[4], x[5]); 292| 25.6k| z[9] = w0; 293| 25.6k| w0 = 0; 294| | 295| 25.6k| word3_muladd_2(&w0, &w2, &w1, x[3], x[7]); 296| 25.6k| word3_muladd_2(&w0, &w2, &w1, x[4], x[6]); 297| 25.6k| word3_muladd(&w0, &w2, &w1, x[5], x[5]); 298| 25.6k| z[10] = w1; 299| 25.6k| w1 = 0; 300| | 301| 25.6k| word3_muladd_2(&w1, &w0, &w2, x[4], x[7]); 302| 25.6k| word3_muladd_2(&w1, &w0, &w2, x[5], x[6]); 303| 25.6k| z[11] = w2; 304| 25.6k| w2 = 0; 305| | 306| 25.6k| word3_muladd_2(&w2, &w1, &w0, x[5], x[7]); 307| 25.6k| word3_muladd(&w2, &w1, &w0, x[6], x[6]); 308| 25.6k| z[12] = w0; 309| 25.6k| w0 = 0; 310| | 311| 25.6k| word3_muladd_2(&w0, &w2, &w1, x[6], x[7]); 312| 25.6k| z[13] = w1; 313| 25.6k| w1 = 0; 314| | 315| 25.6k| word3_muladd(&w1, &w0, &w2, x[7], x[7]); 316| 25.6k| z[14] = w2; 317| 25.6k| z[15] = w0; 318| 25.6k|} _ZN5Botan17bigint_comba_mul8EPmPKmS2_: 323| 15.6k|void bigint_comba_mul8(word z[16], const word x[8], const word y[8]) { 324| 15.6k| word w2 = 0, w1 = 0, w0 = 0; 325| | 326| 15.6k| word3_muladd(&w2, &w1, &w0, x[0], y[0]); 327| 15.6k| z[0] = w0; 328| 15.6k| w0 = 0; 329| | 330| 15.6k| word3_muladd(&w0, &w2, &w1, x[0], y[1]); 331| 15.6k| word3_muladd(&w0, &w2, &w1, x[1], y[0]); 332| 15.6k| z[1] = w1; 333| 15.6k| w1 = 0; 334| | 335| 15.6k| word3_muladd(&w1, &w0, &w2, x[0], y[2]); 336| 15.6k| word3_muladd(&w1, &w0, &w2, x[1], y[1]); 337| 15.6k| word3_muladd(&w1, &w0, &w2, x[2], y[0]); 338| 15.6k| z[2] = w2; 339| 15.6k| w2 = 0; 340| | 341| 15.6k| word3_muladd(&w2, &w1, &w0, x[0], y[3]); 342| 15.6k| word3_muladd(&w2, &w1, &w0, x[1], y[2]); 343| 15.6k| word3_muladd(&w2, &w1, &w0, x[2], y[1]); 344| 15.6k| word3_muladd(&w2, &w1, &w0, x[3], y[0]); 345| 15.6k| z[3] = w0; 346| 15.6k| w0 = 0; 347| | 348| 15.6k| word3_muladd(&w0, &w2, &w1, x[0], y[4]); 349| 15.6k| word3_muladd(&w0, &w2, &w1, x[1], y[3]); 350| 15.6k| word3_muladd(&w0, &w2, &w1, x[2], y[2]); 351| 15.6k| word3_muladd(&w0, &w2, &w1, x[3], y[1]); 352| 15.6k| word3_muladd(&w0, &w2, &w1, x[4], y[0]); 353| 15.6k| z[4] = w1; 354| 15.6k| w1 = 0; 355| | 356| 15.6k| word3_muladd(&w1, &w0, &w2, x[0], y[5]); 357| 15.6k| word3_muladd(&w1, &w0, &w2, x[1], y[4]); 358| 15.6k| word3_muladd(&w1, &w0, &w2, x[2], y[3]); 359| 15.6k| word3_muladd(&w1, &w0, &w2, x[3], y[2]); 360| 15.6k| word3_muladd(&w1, &w0, &w2, x[4], y[1]); 361| 15.6k| word3_muladd(&w1, &w0, &w2, x[5], y[0]); 362| 15.6k| z[5] = w2; 363| 15.6k| w2 = 0; 364| | 365| 15.6k| word3_muladd(&w2, &w1, &w0, x[0], y[6]); 366| 15.6k| word3_muladd(&w2, &w1, &w0, x[1], y[5]); 367| 15.6k| word3_muladd(&w2, &w1, &w0, x[2], y[4]); 368| 15.6k| word3_muladd(&w2, &w1, &w0, x[3], y[3]); 369| 15.6k| word3_muladd(&w2, &w1, &w0, x[4], y[2]); 370| 15.6k| word3_muladd(&w2, &w1, &w0, x[5], y[1]); 371| 15.6k| word3_muladd(&w2, &w1, &w0, x[6], y[0]); 372| 15.6k| z[6] = w0; 373| 15.6k| w0 = 0; 374| | 375| 15.6k| word3_muladd(&w0, &w2, &w1, x[0], y[7]); 376| 15.6k| word3_muladd(&w0, &w2, &w1, x[1], y[6]); 377| 15.6k| word3_muladd(&w0, &w2, &w1, x[2], y[5]); 378| 15.6k| word3_muladd(&w0, &w2, &w1, x[3], y[4]); 379| 15.6k| word3_muladd(&w0, &w2, &w1, x[4], y[3]); 380| 15.6k| word3_muladd(&w0, &w2, &w1, x[5], y[2]); 381| 15.6k| word3_muladd(&w0, &w2, &w1, x[6], y[1]); 382| 15.6k| word3_muladd(&w0, &w2, &w1, x[7], y[0]); 383| 15.6k| z[7] = w1; 384| 15.6k| w1 = 0; 385| | 386| 15.6k| word3_muladd(&w1, &w0, &w2, x[1], y[7]); 387| 15.6k| word3_muladd(&w1, &w0, &w2, x[2], y[6]); 388| 15.6k| word3_muladd(&w1, &w0, &w2, x[3], y[5]); 389| 15.6k| word3_muladd(&w1, &w0, &w2, x[4], y[4]); 390| 15.6k| word3_muladd(&w1, &w0, &w2, x[5], y[3]); 391| 15.6k| word3_muladd(&w1, &w0, &w2, x[6], y[2]); 392| 15.6k| word3_muladd(&w1, &w0, &w2, x[7], y[1]); 393| 15.6k| z[8] = w2; 394| 15.6k| w2 = 0; 395| | 396| 15.6k| word3_muladd(&w2, &w1, &w0, x[2], y[7]); 397| 15.6k| word3_muladd(&w2, &w1, &w0, x[3], y[6]); 398| 15.6k| word3_muladd(&w2, &w1, &w0, x[4], y[5]); 399| 15.6k| word3_muladd(&w2, &w1, &w0, x[5], y[4]); 400| 15.6k| word3_muladd(&w2, &w1, &w0, x[6], y[3]); 401| 15.6k| word3_muladd(&w2, &w1, &w0, x[7], y[2]); 402| 15.6k| z[9] = w0; 403| 15.6k| w0 = 0; 404| | 405| 15.6k| word3_muladd(&w0, &w2, &w1, x[3], y[7]); 406| 15.6k| word3_muladd(&w0, &w2, &w1, x[4], y[6]); 407| 15.6k| word3_muladd(&w0, &w2, &w1, x[5], y[5]); 408| 15.6k| word3_muladd(&w0, &w2, &w1, x[6], y[4]); 409| 15.6k| word3_muladd(&w0, &w2, &w1, x[7], y[3]); 410| 15.6k| z[10] = w1; 411| 15.6k| w1 = 0; 412| | 413| 15.6k| word3_muladd(&w1, &w0, &w2, x[4], y[7]); 414| 15.6k| word3_muladd(&w1, &w0, &w2, x[5], y[6]); 415| 15.6k| word3_muladd(&w1, &w0, &w2, x[6], y[5]); 416| 15.6k| word3_muladd(&w1, &w0, &w2, x[7], y[4]); 417| 15.6k| z[11] = w2; 418| 15.6k| w2 = 0; 419| | 420| 15.6k| word3_muladd(&w2, &w1, &w0, x[5], y[7]); 421| 15.6k| word3_muladd(&w2, &w1, &w0, x[6], y[6]); 422| 15.6k| word3_muladd(&w2, &w1, &w0, x[7], y[5]); 423| 15.6k| z[12] = w0; 424| 15.6k| w0 = 0; 425| | 426| 15.6k| word3_muladd(&w0, &w2, &w1, x[6], y[7]); 427| 15.6k| word3_muladd(&w0, &w2, &w1, x[7], y[6]); 428| 15.6k| z[13] = w1; 429| 15.6k| w1 = 0; 430| | 431| 15.6k| word3_muladd(&w1, &w0, &w2, x[7], y[7]); 432| 15.6k| z[14] = w2; 433| 15.6k| z[15] = w0; 434| 15.6k|} _ZN5Botan17bigint_comba_sqr9EPmPKm: 439| 365k|void bigint_comba_sqr9(word z[18], const word x[9]) { 440| 365k| word w2 = 0, w1 = 0, w0 = 0; 441| | 442| 365k| word3_muladd(&w2, &w1, &w0, x[0], x[0]); 443| 365k| z[0] = w0; 444| 365k| w0 = 0; 445| | 446| 365k| word3_muladd_2(&w0, &w2, &w1, x[0], x[1]); 447| 365k| z[1] = w1; 448| 365k| w1 = 0; 449| | 450| 365k| word3_muladd_2(&w1, &w0, &w2, x[0], x[2]); 451| 365k| word3_muladd(&w1, &w0, &w2, x[1], x[1]); 452| 365k| z[2] = w2; 453| 365k| w2 = 0; 454| | 455| 365k| word3_muladd_2(&w2, &w1, &w0, x[0], x[3]); 456| 365k| word3_muladd_2(&w2, &w1, &w0, x[1], x[2]); 457| 365k| z[3] = w0; 458| 365k| w0 = 0; 459| | 460| 365k| word3_muladd_2(&w0, &w2, &w1, x[0], x[4]); 461| 365k| word3_muladd_2(&w0, &w2, &w1, x[1], x[3]); 462| 365k| word3_muladd(&w0, &w2, &w1, x[2], x[2]); 463| 365k| z[4] = w1; 464| 365k| w1 = 0; 465| | 466| 365k| word3_muladd_2(&w1, &w0, &w2, x[0], x[5]); 467| 365k| word3_muladd_2(&w1, &w0, &w2, x[1], x[4]); 468| 365k| word3_muladd_2(&w1, &w0, &w2, x[2], x[3]); 469| 365k| z[5] = w2; 470| 365k| w2 = 0; 471| | 472| 365k| word3_muladd_2(&w2, &w1, &w0, x[0], x[6]); 473| 365k| word3_muladd_2(&w2, &w1, &w0, x[1], x[5]); 474| 365k| word3_muladd_2(&w2, &w1, &w0, x[2], x[4]); 475| 365k| word3_muladd(&w2, &w1, &w0, x[3], x[3]); 476| 365k| z[6] = w0; 477| 365k| w0 = 0; 478| | 479| 365k| word3_muladd_2(&w0, &w2, &w1, x[0], x[7]); 480| 365k| word3_muladd_2(&w0, &w2, &w1, x[1], x[6]); 481| 365k| word3_muladd_2(&w0, &w2, &w1, x[2], x[5]); 482| 365k| word3_muladd_2(&w0, &w2, &w1, x[3], x[4]); 483| 365k| z[7] = w1; 484| 365k| w1 = 0; 485| | 486| 365k| word3_muladd_2(&w1, &w0, &w2, x[0], x[8]); 487| 365k| word3_muladd_2(&w1, &w0, &w2, x[1], x[7]); 488| 365k| word3_muladd_2(&w1, &w0, &w2, x[2], x[6]); 489| 365k| word3_muladd_2(&w1, &w0, &w2, x[3], x[5]); 490| 365k| word3_muladd(&w1, &w0, &w2, x[4], x[4]); 491| 365k| z[8] = w2; 492| 365k| w2 = 0; 493| | 494| 365k| word3_muladd_2(&w2, &w1, &w0, x[1], x[8]); 495| 365k| word3_muladd_2(&w2, &w1, &w0, x[2], x[7]); 496| 365k| word3_muladd_2(&w2, &w1, &w0, x[3], x[6]); 497| 365k| word3_muladd_2(&w2, &w1, &w0, x[4], x[5]); 498| 365k| z[9] = w0; 499| 365k| w0 = 0; 500| | 501| 365k| word3_muladd_2(&w0, &w2, &w1, x[2], x[8]); 502| 365k| word3_muladd_2(&w0, &w2, &w1, x[3], x[7]); 503| 365k| word3_muladd_2(&w0, &w2, &w1, x[4], x[6]); 504| 365k| word3_muladd(&w0, &w2, &w1, x[5], x[5]); 505| 365k| z[10] = w1; 506| 365k| w1 = 0; 507| | 508| 365k| word3_muladd_2(&w1, &w0, &w2, x[3], x[8]); 509| 365k| word3_muladd_2(&w1, &w0, &w2, x[4], x[7]); 510| 365k| word3_muladd_2(&w1, &w0, &w2, x[5], x[6]); 511| 365k| z[11] = w2; 512| 365k| w2 = 0; 513| | 514| 365k| word3_muladd_2(&w2, &w1, &w0, x[4], x[8]); 515| 365k| word3_muladd_2(&w2, &w1, &w0, x[5], x[7]); 516| 365k| word3_muladd(&w2, &w1, &w0, x[6], x[6]); 517| 365k| z[12] = w0; 518| 365k| w0 = 0; 519| | 520| 365k| word3_muladd_2(&w0, &w2, &w1, x[5], x[8]); 521| 365k| word3_muladd_2(&w0, &w2, &w1, x[6], x[7]); 522| 365k| z[13] = w1; 523| 365k| w1 = 0; 524| | 525| 365k| word3_muladd_2(&w1, &w0, &w2, x[6], x[8]); 526| 365k| word3_muladd(&w1, &w0, &w2, x[7], x[7]); 527| 365k| z[14] = w2; 528| 365k| w2 = 0; 529| | 530| 365k| word3_muladd_2(&w2, &w1, &w0, x[7], x[8]); 531| 365k| z[15] = w0; 532| 365k| w0 = 0; 533| | 534| 365k| word3_muladd(&w0, &w2, &w1, x[8], x[8]); 535| 365k| z[16] = w1; 536| 365k| z[17] = w2; 537| 365k|} _ZN5Botan17bigint_comba_mul9EPmPKmS2_: 542| 359k|void bigint_comba_mul9(word z[18], const word x[9], const word y[9]) { 543| 359k| word w2 = 0, w1 = 0, w0 = 0; 544| | 545| 359k| word3_muladd(&w2, &w1, &w0, x[0], y[0]); 546| 359k| z[0] = w0; 547| 359k| w0 = 0; 548| | 549| 359k| word3_muladd(&w0, &w2, &w1, x[0], y[1]); 550| 359k| word3_muladd(&w0, &w2, &w1, x[1], y[0]); 551| 359k| z[1] = w1; 552| 359k| w1 = 0; 553| | 554| 359k| word3_muladd(&w1, &w0, &w2, x[0], y[2]); 555| 359k| word3_muladd(&w1, &w0, &w2, x[1], y[1]); 556| 359k| word3_muladd(&w1, &w0, &w2, x[2], y[0]); 557| 359k| z[2] = w2; 558| 359k| w2 = 0; 559| | 560| 359k| word3_muladd(&w2, &w1, &w0, x[0], y[3]); 561| 359k| word3_muladd(&w2, &w1, &w0, x[1], y[2]); 562| 359k| word3_muladd(&w2, &w1, &w0, x[2], y[1]); 563| 359k| word3_muladd(&w2, &w1, &w0, x[3], y[0]); 564| 359k| z[3] = w0; 565| 359k| w0 = 0; 566| | 567| 359k| word3_muladd(&w0, &w2, &w1, x[0], y[4]); 568| 359k| word3_muladd(&w0, &w2, &w1, x[1], y[3]); 569| 359k| word3_muladd(&w0, &w2, &w1, x[2], y[2]); 570| 359k| word3_muladd(&w0, &w2, &w1, x[3], y[1]); 571| 359k| word3_muladd(&w0, &w2, &w1, x[4], y[0]); 572| 359k| z[4] = w1; 573| 359k| w1 = 0; 574| | 575| 359k| word3_muladd(&w1, &w0, &w2, x[0], y[5]); 576| 359k| word3_muladd(&w1, &w0, &w2, x[1], y[4]); 577| 359k| word3_muladd(&w1, &w0, &w2, x[2], y[3]); 578| 359k| word3_muladd(&w1, &w0, &w2, x[3], y[2]); 579| 359k| word3_muladd(&w1, &w0, &w2, x[4], y[1]); 580| 359k| word3_muladd(&w1, &w0, &w2, x[5], y[0]); 581| 359k| z[5] = w2; 582| 359k| w2 = 0; 583| | 584| 359k| word3_muladd(&w2, &w1, &w0, x[0], y[6]); 585| 359k| word3_muladd(&w2, &w1, &w0, x[1], y[5]); 586| 359k| word3_muladd(&w2, &w1, &w0, x[2], y[4]); 587| 359k| word3_muladd(&w2, &w1, &w0, x[3], y[3]); 588| 359k| word3_muladd(&w2, &w1, &w0, x[4], y[2]); 589| 359k| word3_muladd(&w2, &w1, &w0, x[5], y[1]); 590| 359k| word3_muladd(&w2, &w1, &w0, x[6], y[0]); 591| 359k| z[6] = w0; 592| 359k| w0 = 0; 593| | 594| 359k| word3_muladd(&w0, &w2, &w1, x[0], y[7]); 595| 359k| word3_muladd(&w0, &w2, &w1, x[1], y[6]); 596| 359k| word3_muladd(&w0, &w2, &w1, x[2], y[5]); 597| 359k| word3_muladd(&w0, &w2, &w1, x[3], y[4]); 598| 359k| word3_muladd(&w0, &w2, &w1, x[4], y[3]); 599| 359k| word3_muladd(&w0, &w2, &w1, x[5], y[2]); 600| 359k| word3_muladd(&w0, &w2, &w1, x[6], y[1]); 601| 359k| word3_muladd(&w0, &w2, &w1, x[7], y[0]); 602| 359k| z[7] = w1; 603| 359k| w1 = 0; 604| | 605| 359k| word3_muladd(&w1, &w0, &w2, x[0], y[8]); 606| 359k| word3_muladd(&w1, &w0, &w2, x[1], y[7]); 607| 359k| word3_muladd(&w1, &w0, &w2, x[2], y[6]); 608| 359k| word3_muladd(&w1, &w0, &w2, x[3], y[5]); 609| 359k| word3_muladd(&w1, &w0, &w2, x[4], y[4]); 610| 359k| word3_muladd(&w1, &w0, &w2, x[5], y[3]); 611| 359k| word3_muladd(&w1, &w0, &w2, x[6], y[2]); 612| 359k| word3_muladd(&w1, &w0, &w2, x[7], y[1]); 613| 359k| word3_muladd(&w1, &w0, &w2, x[8], y[0]); 614| 359k| z[8] = w2; 615| 359k| w2 = 0; 616| | 617| 359k| word3_muladd(&w2, &w1, &w0, x[1], y[8]); 618| 359k| word3_muladd(&w2, &w1, &w0, x[2], y[7]); 619| 359k| word3_muladd(&w2, &w1, &w0, x[3], y[6]); 620| 359k| word3_muladd(&w2, &w1, &w0, x[4], y[5]); 621| 359k| word3_muladd(&w2, &w1, &w0, x[5], y[4]); 622| 359k| word3_muladd(&w2, &w1, &w0, x[6], y[3]); 623| 359k| word3_muladd(&w2, &w1, &w0, x[7], y[2]); 624| 359k| word3_muladd(&w2, &w1, &w0, x[8], y[1]); 625| 359k| z[9] = w0; 626| 359k| w0 = 0; 627| | 628| 359k| word3_muladd(&w0, &w2, &w1, x[2], y[8]); 629| 359k| word3_muladd(&w0, &w2, &w1, x[3], y[7]); 630| 359k| word3_muladd(&w0, &w2, &w1, x[4], y[6]); 631| 359k| word3_muladd(&w0, &w2, &w1, x[5], y[5]); 632| 359k| word3_muladd(&w0, &w2, &w1, x[6], y[4]); 633| 359k| word3_muladd(&w0, &w2, &w1, x[7], y[3]); 634| 359k| word3_muladd(&w0, &w2, &w1, x[8], y[2]); 635| 359k| z[10] = w1; 636| 359k| w1 = 0; 637| | 638| 359k| word3_muladd(&w1, &w0, &w2, x[3], y[8]); 639| 359k| word3_muladd(&w1, &w0, &w2, x[4], y[7]); 640| 359k| word3_muladd(&w1, &w0, &w2, x[5], y[6]); 641| 359k| word3_muladd(&w1, &w0, &w2, x[6], y[5]); 642| 359k| word3_muladd(&w1, &w0, &w2, x[7], y[4]); 643| 359k| word3_muladd(&w1, &w0, &w2, x[8], y[3]); 644| 359k| z[11] = w2; 645| 359k| w2 = 0; 646| | 647| 359k| word3_muladd(&w2, &w1, &w0, x[4], y[8]); 648| 359k| word3_muladd(&w2, &w1, &w0, x[5], y[7]); 649| 359k| word3_muladd(&w2, &w1, &w0, x[6], y[6]); 650| 359k| word3_muladd(&w2, &w1, &w0, x[7], y[5]); 651| 359k| word3_muladd(&w2, &w1, &w0, x[8], y[4]); 652| 359k| z[12] = w0; 653| 359k| w0 = 0; 654| | 655| 359k| word3_muladd(&w0, &w2, &w1, x[5], y[8]); 656| 359k| word3_muladd(&w0, &w2, &w1, x[6], y[7]); 657| 359k| word3_muladd(&w0, &w2, &w1, x[7], y[6]); 658| 359k| word3_muladd(&w0, &w2, &w1, x[8], y[5]); 659| 359k| z[13] = w1; 660| 359k| w1 = 0; 661| | 662| 359k| word3_muladd(&w1, &w0, &w2, x[6], y[8]); 663| 359k| word3_muladd(&w1, &w0, &w2, x[7], y[7]); 664| 359k| word3_muladd(&w1, &w0, &w2, x[8], y[6]); 665| 359k| z[14] = w2; 666| 359k| w2 = 0; 667| | 668| 359k| word3_muladd(&w2, &w1, &w0, x[7], y[8]); 669| 359k| word3_muladd(&w2, &w1, &w0, x[8], y[7]); 670| 359k| z[15] = w0; 671| 359k| w0 = 0; 672| | 673| 359k| word3_muladd(&w0, &w2, &w1, x[8], y[8]); 674| 359k| z[16] = w1; 675| 359k| z[17] = w2; 676| 359k|} _ZN5Botan18bigint_comba_sqr16EPmPKm: 681| 19.4k|void bigint_comba_sqr16(word z[32], const word x[16]) { 682| 19.4k| word w2 = 0, w1 = 0, w0 = 0; 683| | 684| 19.4k| word3_muladd(&w2, &w1, &w0, x[0], x[0]); 685| 19.4k| z[0] = w0; 686| 19.4k| w0 = 0; 687| | 688| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[0], x[1]); 689| 19.4k| z[1] = w1; 690| 19.4k| w1 = 0; 691| | 692| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[0], x[2]); 693| 19.4k| word3_muladd(&w1, &w0, &w2, x[1], x[1]); 694| 19.4k| z[2] = w2; 695| 19.4k| w2 = 0; 696| | 697| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[0], x[3]); 698| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[1], x[2]); 699| 19.4k| z[3] = w0; 700| 19.4k| w0 = 0; 701| | 702| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[0], x[4]); 703| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[1], x[3]); 704| 19.4k| word3_muladd(&w0, &w2, &w1, x[2], x[2]); 705| 19.4k| z[4] = w1; 706| 19.4k| w1 = 0; 707| | 708| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[0], x[5]); 709| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[1], x[4]); 710| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[2], x[3]); 711| 19.4k| z[5] = w2; 712| 19.4k| w2 = 0; 713| | 714| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[0], x[6]); 715| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[1], x[5]); 716| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[2], x[4]); 717| 19.4k| word3_muladd(&w2, &w1, &w0, x[3], x[3]); 718| 19.4k| z[6] = w0; 719| 19.4k| w0 = 0; 720| | 721| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[0], x[7]); 722| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[1], x[6]); 723| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[2], x[5]); 724| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[3], x[4]); 725| 19.4k| z[7] = w1; 726| 19.4k| w1 = 0; 727| | 728| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[0], x[8]); 729| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[1], x[7]); 730| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[2], x[6]); 731| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[3], x[5]); 732| 19.4k| word3_muladd(&w1, &w0, &w2, x[4], x[4]); 733| 19.4k| z[8] = w2; 734| 19.4k| w2 = 0; 735| | 736| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[0], x[9]); 737| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[1], x[8]); 738| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[2], x[7]); 739| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[3], x[6]); 740| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[4], x[5]); 741| 19.4k| z[9] = w0; 742| 19.4k| w0 = 0; 743| | 744| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[0], x[10]); 745| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[1], x[9]); 746| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[2], x[8]); 747| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[3], x[7]); 748| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[4], x[6]); 749| 19.4k| word3_muladd(&w0, &w2, &w1, x[5], x[5]); 750| 19.4k| z[10] = w1; 751| 19.4k| w1 = 0; 752| | 753| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[0], x[11]); 754| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[1], x[10]); 755| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[2], x[9]); 756| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[3], x[8]); 757| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[4], x[7]); 758| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[5], x[6]); 759| 19.4k| z[11] = w2; 760| 19.4k| w2 = 0; 761| | 762| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[0], x[12]); 763| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[1], x[11]); 764| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[2], x[10]); 765| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[3], x[9]); 766| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[4], x[8]); 767| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[5], x[7]); 768| 19.4k| word3_muladd(&w2, &w1, &w0, x[6], x[6]); 769| 19.4k| z[12] = w0; 770| 19.4k| w0 = 0; 771| | 772| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[0], x[13]); 773| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[1], x[12]); 774| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[2], x[11]); 775| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[3], x[10]); 776| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[4], x[9]); 777| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[5], x[8]); 778| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[6], x[7]); 779| 19.4k| z[13] = w1; 780| 19.4k| w1 = 0; 781| | 782| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[0], x[14]); 783| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[1], x[13]); 784| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[2], x[12]); 785| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[3], x[11]); 786| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[4], x[10]); 787| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[5], x[9]); 788| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[6], x[8]); 789| 19.4k| word3_muladd(&w1, &w0, &w2, x[7], x[7]); 790| 19.4k| z[14] = w2; 791| 19.4k| w2 = 0; 792| | 793| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[0], x[15]); 794| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[1], x[14]); 795| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[2], x[13]); 796| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[3], x[12]); 797| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[4], x[11]); 798| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[5], x[10]); 799| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[6], x[9]); 800| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[7], x[8]); 801| 19.4k| z[15] = w0; 802| 19.4k| w0 = 0; 803| | 804| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[1], x[15]); 805| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[2], x[14]); 806| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[3], x[13]); 807| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[4], x[12]); 808| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[5], x[11]); 809| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[6], x[10]); 810| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[7], x[9]); 811| 19.4k| word3_muladd(&w0, &w2, &w1, x[8], x[8]); 812| 19.4k| z[16] = w1; 813| 19.4k| w1 = 0; 814| | 815| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[2], x[15]); 816| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[3], x[14]); 817| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[4], x[13]); 818| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[5], x[12]); 819| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[6], x[11]); 820| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[7], x[10]); 821| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[8], x[9]); 822| 19.4k| z[17] = w2; 823| 19.4k| w2 = 0; 824| | 825| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[3], x[15]); 826| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[4], x[14]); 827| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[5], x[13]); 828| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[6], x[12]); 829| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[7], x[11]); 830| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[8], x[10]); 831| 19.4k| word3_muladd(&w2, &w1, &w0, x[9], x[9]); 832| 19.4k| z[18] = w0; 833| 19.4k| w0 = 0; 834| | 835| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[4], x[15]); 836| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[5], x[14]); 837| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[6], x[13]); 838| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[7], x[12]); 839| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[8], x[11]); 840| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[9], x[10]); 841| 19.4k| z[19] = w1; 842| 19.4k| w1 = 0; 843| | 844| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[5], x[15]); 845| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[6], x[14]); 846| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[7], x[13]); 847| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[8], x[12]); 848| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[9], x[11]); 849| 19.4k| word3_muladd(&w1, &w0, &w2, x[10], x[10]); 850| 19.4k| z[20] = w2; 851| 19.4k| w2 = 0; 852| | 853| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[6], x[15]); 854| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[7], x[14]); 855| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[8], x[13]); 856| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[9], x[12]); 857| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[10], x[11]); 858| 19.4k| z[21] = w0; 859| 19.4k| w0 = 0; 860| | 861| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[7], x[15]); 862| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[8], x[14]); 863| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[9], x[13]); 864| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[10], x[12]); 865| 19.4k| word3_muladd(&w0, &w2, &w1, x[11], x[11]); 866| 19.4k| z[22] = w1; 867| 19.4k| w1 = 0; 868| | 869| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[8], x[15]); 870| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[9], x[14]); 871| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[10], x[13]); 872| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[11], x[12]); 873| 19.4k| z[23] = w2; 874| 19.4k| w2 = 0; 875| | 876| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[9], x[15]); 877| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[10], x[14]); 878| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[11], x[13]); 879| 19.4k| word3_muladd(&w2, &w1, &w0, x[12], x[12]); 880| 19.4k| z[24] = w0; 881| 19.4k| w0 = 0; 882| | 883| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[10], x[15]); 884| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[11], x[14]); 885| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[12], x[13]); 886| 19.4k| z[25] = w1; 887| 19.4k| w1 = 0; 888| | 889| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[11], x[15]); 890| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[12], x[14]); 891| 19.4k| word3_muladd(&w1, &w0, &w2, x[13], x[13]); 892| 19.4k| z[26] = w2; 893| 19.4k| w2 = 0; 894| | 895| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[12], x[15]); 896| 19.4k| word3_muladd_2(&w2, &w1, &w0, x[13], x[14]); 897| 19.4k| z[27] = w0; 898| 19.4k| w0 = 0; 899| | 900| 19.4k| word3_muladd_2(&w0, &w2, &w1, x[13], x[15]); 901| 19.4k| word3_muladd(&w0, &w2, &w1, x[14], x[14]); 902| 19.4k| z[28] = w1; 903| 19.4k| w1 = 0; 904| | 905| 19.4k| word3_muladd_2(&w1, &w0, &w2, x[14], x[15]); 906| 19.4k| z[29] = w2; 907| 19.4k| w2 = 0; 908| | 909| 19.4k| word3_muladd(&w2, &w1, &w0, x[15], x[15]); 910| 19.4k| z[30] = w0; 911| 19.4k| z[31] = w1; 912| 19.4k|} _ZN5Botan18bigint_comba_mul16EPmPKmS2_: 917| 12.3k|void bigint_comba_mul16(word z[32], const word x[16], const word y[16]) { 918| 12.3k| word w2 = 0, w1 = 0, w0 = 0; 919| | 920| 12.3k| word3_muladd(&w2, &w1, &w0, x[0], y[0]); 921| 12.3k| z[0] = w0; 922| 12.3k| w0 = 0; 923| | 924| 12.3k| word3_muladd(&w0, &w2, &w1, x[0], y[1]); 925| 12.3k| word3_muladd(&w0, &w2, &w1, x[1], y[0]); 926| 12.3k| z[1] = w1; 927| 12.3k| w1 = 0; 928| | 929| 12.3k| word3_muladd(&w1, &w0, &w2, x[0], y[2]); 930| 12.3k| word3_muladd(&w1, &w0, &w2, x[1], y[1]); 931| 12.3k| word3_muladd(&w1, &w0, &w2, x[2], y[0]); 932| 12.3k| z[2] = w2; 933| 12.3k| w2 = 0; 934| | 935| 12.3k| word3_muladd(&w2, &w1, &w0, x[0], y[3]); 936| 12.3k| word3_muladd(&w2, &w1, &w0, x[1], y[2]); 937| 12.3k| word3_muladd(&w2, &w1, &w0, x[2], y[1]); 938| 12.3k| word3_muladd(&w2, &w1, &w0, x[3], y[0]); 939| 12.3k| z[3] = w0; 940| 12.3k| w0 = 0; 941| | 942| 12.3k| word3_muladd(&w0, &w2, &w1, x[0], y[4]); 943| 12.3k| word3_muladd(&w0, &w2, &w1, x[1], y[3]); 944| 12.3k| word3_muladd(&w0, &w2, &w1, x[2], y[2]); 945| 12.3k| word3_muladd(&w0, &w2, &w1, x[3], y[1]); 946| 12.3k| word3_muladd(&w0, &w2, &w1, x[4], y[0]); 947| 12.3k| z[4] = w1; 948| 12.3k| w1 = 0; 949| | 950| 12.3k| word3_muladd(&w1, &w0, &w2, x[0], y[5]); 951| 12.3k| word3_muladd(&w1, &w0, &w2, x[1], y[4]); 952| 12.3k| word3_muladd(&w1, &w0, &w2, x[2], y[3]); 953| 12.3k| word3_muladd(&w1, &w0, &w2, x[3], y[2]); 954| 12.3k| word3_muladd(&w1, &w0, &w2, x[4], y[1]); 955| 12.3k| word3_muladd(&w1, &w0, &w2, x[5], y[0]); 956| 12.3k| z[5] = w2; 957| 12.3k| w2 = 0; 958| | 959| 12.3k| word3_muladd(&w2, &w1, &w0, x[0], y[6]); 960| 12.3k| word3_muladd(&w2, &w1, &w0, x[1], y[5]); 961| 12.3k| word3_muladd(&w2, &w1, &w0, x[2], y[4]); 962| 12.3k| word3_muladd(&w2, &w1, &w0, x[3], y[3]); 963| 12.3k| word3_muladd(&w2, &w1, &w0, x[4], y[2]); 964| 12.3k| word3_muladd(&w2, &w1, &w0, x[5], y[1]); 965| 12.3k| word3_muladd(&w2, &w1, &w0, x[6], y[0]); 966| 12.3k| z[6] = w0; 967| 12.3k| w0 = 0; 968| | 969| 12.3k| word3_muladd(&w0, &w2, &w1, x[0], y[7]); 970| 12.3k| word3_muladd(&w0, &w2, &w1, x[1], y[6]); 971| 12.3k| word3_muladd(&w0, &w2, &w1, x[2], y[5]); 972| 12.3k| word3_muladd(&w0, &w2, &w1, x[3], y[4]); 973| 12.3k| word3_muladd(&w0, &w2, &w1, x[4], y[3]); 974| 12.3k| word3_muladd(&w0, &w2, &w1, x[5], y[2]); 975| 12.3k| word3_muladd(&w0, &w2, &w1, x[6], y[1]); 976| 12.3k| word3_muladd(&w0, &w2, &w1, x[7], y[0]); 977| 12.3k| z[7] = w1; 978| 12.3k| w1 = 0; 979| | 980| 12.3k| word3_muladd(&w1, &w0, &w2, x[0], y[8]); 981| 12.3k| word3_muladd(&w1, &w0, &w2, x[1], y[7]); 982| 12.3k| word3_muladd(&w1, &w0, &w2, x[2], y[6]); 983| 12.3k| word3_muladd(&w1, &w0, &w2, x[3], y[5]); 984| 12.3k| word3_muladd(&w1, &w0, &w2, x[4], y[4]); 985| 12.3k| word3_muladd(&w1, &w0, &w2, x[5], y[3]); 986| 12.3k| word3_muladd(&w1, &w0, &w2, x[6], y[2]); 987| 12.3k| word3_muladd(&w1, &w0, &w2, x[7], y[1]); 988| 12.3k| word3_muladd(&w1, &w0, &w2, x[8], y[0]); 989| 12.3k| z[8] = w2; 990| 12.3k| w2 = 0; 991| | 992| 12.3k| word3_muladd(&w2, &w1, &w0, x[0], y[9]); 993| 12.3k| word3_muladd(&w2, &w1, &w0, x[1], y[8]); 994| 12.3k| word3_muladd(&w2, &w1, &w0, x[2], y[7]); 995| 12.3k| word3_muladd(&w2, &w1, &w0, x[3], y[6]); 996| 12.3k| word3_muladd(&w2, &w1, &w0, x[4], y[5]); 997| 12.3k| word3_muladd(&w2, &w1, &w0, x[5], y[4]); 998| 12.3k| word3_muladd(&w2, &w1, &w0, x[6], y[3]); 999| 12.3k| word3_muladd(&w2, &w1, &w0, x[7], y[2]); 1000| 12.3k| word3_muladd(&w2, &w1, &w0, x[8], y[1]); 1001| 12.3k| word3_muladd(&w2, &w1, &w0, x[9], y[0]); 1002| 12.3k| z[9] = w0; 1003| 12.3k| w0 = 0; 1004| | 1005| 12.3k| word3_muladd(&w0, &w2, &w1, x[0], y[10]); 1006| 12.3k| word3_muladd(&w0, &w2, &w1, x[1], y[9]); 1007| 12.3k| word3_muladd(&w0, &w2, &w1, x[2], y[8]); 1008| 12.3k| word3_muladd(&w0, &w2, &w1, x[3], y[7]); 1009| 12.3k| word3_muladd(&w0, &w2, &w1, x[4], y[6]); 1010| 12.3k| word3_muladd(&w0, &w2, &w1, x[5], y[5]); 1011| 12.3k| word3_muladd(&w0, &w2, &w1, x[6], y[4]); 1012| 12.3k| word3_muladd(&w0, &w2, &w1, x[7], y[3]); 1013| 12.3k| word3_muladd(&w0, &w2, &w1, x[8], y[2]); 1014| 12.3k| word3_muladd(&w0, &w2, &w1, x[9], y[1]); 1015| 12.3k| word3_muladd(&w0, &w2, &w1, x[10], y[0]); 1016| 12.3k| z[10] = w1; 1017| 12.3k| w1 = 0; 1018| | 1019| 12.3k| word3_muladd(&w1, &w0, &w2, x[0], y[11]); 1020| 12.3k| word3_muladd(&w1, &w0, &w2, x[1], y[10]); 1021| 12.3k| word3_muladd(&w1, &w0, &w2, x[2], y[9]); 1022| 12.3k| word3_muladd(&w1, &w0, &w2, x[3], y[8]); 1023| 12.3k| word3_muladd(&w1, &w0, &w2, x[4], y[7]); 1024| 12.3k| word3_muladd(&w1, &w0, &w2, x[5], y[6]); 1025| 12.3k| word3_muladd(&w1, &w0, &w2, x[6], y[5]); 1026| 12.3k| word3_muladd(&w1, &w0, &w2, x[7], y[4]); 1027| 12.3k| word3_muladd(&w1, &w0, &w2, x[8], y[3]); 1028| 12.3k| word3_muladd(&w1, &w0, &w2, x[9], y[2]); 1029| 12.3k| word3_muladd(&w1, &w0, &w2, x[10], y[1]); 1030| 12.3k| word3_muladd(&w1, &w0, &w2, x[11], y[0]); 1031| 12.3k| z[11] = w2; 1032| 12.3k| w2 = 0; 1033| | 1034| 12.3k| word3_muladd(&w2, &w1, &w0, x[0], y[12]); 1035| 12.3k| word3_muladd(&w2, &w1, &w0, x[1], y[11]); 1036| 12.3k| word3_muladd(&w2, &w1, &w0, x[2], y[10]); 1037| 12.3k| word3_muladd(&w2, &w1, &w0, x[3], y[9]); 1038| 12.3k| word3_muladd(&w2, &w1, &w0, x[4], y[8]); 1039| 12.3k| word3_muladd(&w2, &w1, &w0, x[5], y[7]); 1040| 12.3k| word3_muladd(&w2, &w1, &w0, x[6], y[6]); 1041| 12.3k| word3_muladd(&w2, &w1, &w0, x[7], y[5]); 1042| 12.3k| word3_muladd(&w2, &w1, &w0, x[8], y[4]); 1043| 12.3k| word3_muladd(&w2, &w1, &w0, x[9], y[3]); 1044| 12.3k| word3_muladd(&w2, &w1, &w0, x[10], y[2]); 1045| 12.3k| word3_muladd(&w2, &w1, &w0, x[11], y[1]); 1046| 12.3k| word3_muladd(&w2, &w1, &w0, x[12], y[0]); 1047| 12.3k| z[12] = w0; 1048| 12.3k| w0 = 0; 1049| | 1050| 12.3k| word3_muladd(&w0, &w2, &w1, x[0], y[13]); 1051| 12.3k| word3_muladd(&w0, &w2, &w1, x[1], y[12]); 1052| 12.3k| word3_muladd(&w0, &w2, &w1, x[2], y[11]); 1053| 12.3k| word3_muladd(&w0, &w2, &w1, x[3], y[10]); 1054| 12.3k| word3_muladd(&w0, &w2, &w1, x[4], y[9]); 1055| 12.3k| word3_muladd(&w0, &w2, &w1, x[5], y[8]); 1056| 12.3k| word3_muladd(&w0, &w2, &w1, x[6], y[7]); 1057| 12.3k| word3_muladd(&w0, &w2, &w1, x[7], y[6]); 1058| 12.3k| word3_muladd(&w0, &w2, &w1, x[8], y[5]); 1059| 12.3k| word3_muladd(&w0, &w2, &w1, x[9], y[4]); 1060| 12.3k| word3_muladd(&w0, &w2, &w1, x[10], y[3]); 1061| 12.3k| word3_muladd(&w0, &w2, &w1, x[11], y[2]); 1062| 12.3k| word3_muladd(&w0, &w2, &w1, x[12], y[1]); 1063| 12.3k| word3_muladd(&w0, &w2, &w1, x[13], y[0]); 1064| 12.3k| z[13] = w1; 1065| 12.3k| w1 = 0; 1066| | 1067| 12.3k| word3_muladd(&w1, &w0, &w2, x[0], y[14]); 1068| 12.3k| word3_muladd(&w1, &w0, &w2, x[1], y[13]); 1069| 12.3k| word3_muladd(&w1, &w0, &w2, x[2], y[12]); 1070| 12.3k| word3_muladd(&w1, &w0, &w2, x[3], y[11]); 1071| 12.3k| word3_muladd(&w1, &w0, &w2, x[4], y[10]); 1072| 12.3k| word3_muladd(&w1, &w0, &w2, x[5], y[9]); 1073| 12.3k| word3_muladd(&w1, &w0, &w2, x[6], y[8]); 1074| 12.3k| word3_muladd(&w1, &w0, &w2, x[7], y[7]); 1075| 12.3k| word3_muladd(&w1, &w0, &w2, x[8], y[6]); 1076| 12.3k| word3_muladd(&w1, &w0, &w2, x[9], y[5]); 1077| 12.3k| word3_muladd(&w1, &w0, &w2, x[10], y[4]); 1078| 12.3k| word3_muladd(&w1, &w0, &w2, x[11], y[3]); 1079| 12.3k| word3_muladd(&w1, &w0, &w2, x[12], y[2]); 1080| 12.3k| word3_muladd(&w1, &w0, &w2, x[13], y[1]); 1081| 12.3k| word3_muladd(&w1, &w0, &w2, x[14], y[0]); 1082| 12.3k| z[14] = w2; 1083| 12.3k| w2 = 0; 1084| | 1085| 12.3k| word3_muladd(&w2, &w1, &w0, x[0], y[15]); 1086| 12.3k| word3_muladd(&w2, &w1, &w0, x[1], y[14]); 1087| 12.3k| word3_muladd(&w2, &w1, &w0, x[2], y[13]); 1088| 12.3k| word3_muladd(&w2, &w1, &w0, x[3], y[12]); 1089| 12.3k| word3_muladd(&w2, &w1, &w0, x[4], y[11]); 1090| 12.3k| word3_muladd(&w2, &w1, &w0, x[5], y[10]); 1091| 12.3k| word3_muladd(&w2, &w1, &w0, x[6], y[9]); 1092| 12.3k| word3_muladd(&w2, &w1, &w0, x[7], y[8]); 1093| 12.3k| word3_muladd(&w2, &w1, &w0, x[8], y[7]); 1094| 12.3k| word3_muladd(&w2, &w1, &w0, x[9], y[6]); 1095| 12.3k| word3_muladd(&w2, &w1, &w0, x[10], y[5]); 1096| 12.3k| word3_muladd(&w2, &w1, &w0, x[11], y[4]); 1097| 12.3k| word3_muladd(&w2, &w1, &w0, x[12], y[3]); 1098| 12.3k| word3_muladd(&w2, &w1, &w0, x[13], y[2]); 1099| 12.3k| word3_muladd(&w2, &w1, &w0, x[14], y[1]); 1100| 12.3k| word3_muladd(&w2, &w1, &w0, x[15], y[0]); 1101| 12.3k| z[15] = w0; 1102| 12.3k| w0 = 0; 1103| | 1104| 12.3k| word3_muladd(&w0, &w2, &w1, x[1], y[15]); 1105| 12.3k| word3_muladd(&w0, &w2, &w1, x[2], y[14]); 1106| 12.3k| word3_muladd(&w0, &w2, &w1, x[3], y[13]); 1107| 12.3k| word3_muladd(&w0, &w2, &w1, x[4], y[12]); 1108| 12.3k| word3_muladd(&w0, &w2, &w1, x[5], y[11]); 1109| 12.3k| word3_muladd(&w0, &w2, &w1, x[6], y[10]); 1110| 12.3k| word3_muladd(&w0, &w2, &w1, x[7], y[9]); 1111| 12.3k| word3_muladd(&w0, &w2, &w1, x[8], y[8]); 1112| 12.3k| word3_muladd(&w0, &w2, &w1, x[9], y[7]); 1113| 12.3k| word3_muladd(&w0, &w2, &w1, x[10], y[6]); 1114| 12.3k| word3_muladd(&w0, &w2, &w1, x[11], y[5]); 1115| 12.3k| word3_muladd(&w0, &w2, &w1, x[12], y[4]); 1116| 12.3k| word3_muladd(&w0, &w2, &w1, x[13], y[3]); 1117| 12.3k| word3_muladd(&w0, &w2, &w1, x[14], y[2]); 1118| 12.3k| word3_muladd(&w0, &w2, &w1, x[15], y[1]); 1119| 12.3k| z[16] = w1; 1120| 12.3k| w1 = 0; 1121| | 1122| 12.3k| word3_muladd(&w1, &w0, &w2, x[2], y[15]); 1123| 12.3k| word3_muladd(&w1, &w0, &w2, x[3], y[14]); 1124| 12.3k| word3_muladd(&w1, &w0, &w2, x[4], y[13]); 1125| 12.3k| word3_muladd(&w1, &w0, &w2, x[5], y[12]); 1126| 12.3k| word3_muladd(&w1, &w0, &w2, x[6], y[11]); 1127| 12.3k| word3_muladd(&w1, &w0, &w2, x[7], y[10]); 1128| 12.3k| word3_muladd(&w1, &w0, &w2, x[8], y[9]); 1129| 12.3k| word3_muladd(&w1, &w0, &w2, x[9], y[8]); 1130| 12.3k| word3_muladd(&w1, &w0, &w2, x[10], y[7]); 1131| 12.3k| word3_muladd(&w1, &w0, &w2, x[11], y[6]); 1132| 12.3k| word3_muladd(&w1, &w0, &w2, x[12], y[5]); 1133| 12.3k| word3_muladd(&w1, &w0, &w2, x[13], y[4]); 1134| 12.3k| word3_muladd(&w1, &w0, &w2, x[14], y[3]); 1135| 12.3k| word3_muladd(&w1, &w0, &w2, x[15], y[2]); 1136| 12.3k| z[17] = w2; 1137| 12.3k| w2 = 0; 1138| | 1139| 12.3k| word3_muladd(&w2, &w1, &w0, x[3], y[15]); 1140| 12.3k| word3_muladd(&w2, &w1, &w0, x[4], y[14]); 1141| 12.3k| word3_muladd(&w2, &w1, &w0, x[5], y[13]); 1142| 12.3k| word3_muladd(&w2, &w1, &w0, x[6], y[12]); 1143| 12.3k| word3_muladd(&w2, &w1, &w0, x[7], y[11]); 1144| 12.3k| word3_muladd(&w2, &w1, &w0, x[8], y[10]); 1145| 12.3k| word3_muladd(&w2, &w1, &w0, x[9], y[9]); 1146| 12.3k| word3_muladd(&w2, &w1, &w0, x[10], y[8]); 1147| 12.3k| word3_muladd(&w2, &w1, &w0, x[11], y[7]); 1148| 12.3k| word3_muladd(&w2, &w1, &w0, x[12], y[6]); 1149| 12.3k| word3_muladd(&w2, &w1, &w0, x[13], y[5]); 1150| 12.3k| word3_muladd(&w2, &w1, &w0, x[14], y[4]); 1151| 12.3k| word3_muladd(&w2, &w1, &w0, x[15], y[3]); 1152| 12.3k| z[18] = w0; 1153| 12.3k| w0 = 0; 1154| | 1155| 12.3k| word3_muladd(&w0, &w2, &w1, x[4], y[15]); 1156| 12.3k| word3_muladd(&w0, &w2, &w1, x[5], y[14]); 1157| 12.3k| word3_muladd(&w0, &w2, &w1, x[6], y[13]); 1158| 12.3k| word3_muladd(&w0, &w2, &w1, x[7], y[12]); 1159| 12.3k| word3_muladd(&w0, &w2, &w1, x[8], y[11]); 1160| 12.3k| word3_muladd(&w0, &w2, &w1, x[9], y[10]); 1161| 12.3k| word3_muladd(&w0, &w2, &w1, x[10], y[9]); 1162| 12.3k| word3_muladd(&w0, &w2, &w1, x[11], y[8]); 1163| 12.3k| word3_muladd(&w0, &w2, &w1, x[12], y[7]); 1164| 12.3k| word3_muladd(&w0, &w2, &w1, x[13], y[6]); 1165| 12.3k| word3_muladd(&w0, &w2, &w1, x[14], y[5]); 1166| 12.3k| word3_muladd(&w0, &w2, &w1, x[15], y[4]); 1167| 12.3k| z[19] = w1; 1168| 12.3k| w1 = 0; 1169| | 1170| 12.3k| word3_muladd(&w1, &w0, &w2, x[5], y[15]); 1171| 12.3k| word3_muladd(&w1, &w0, &w2, x[6], y[14]); 1172| 12.3k| word3_muladd(&w1, &w0, &w2, x[7], y[13]); 1173| 12.3k| word3_muladd(&w1, &w0, &w2, x[8], y[12]); 1174| 12.3k| word3_muladd(&w1, &w0, &w2, x[9], y[11]); 1175| 12.3k| word3_muladd(&w1, &w0, &w2, x[10], y[10]); 1176| 12.3k| word3_muladd(&w1, &w0, &w2, x[11], y[9]); 1177| 12.3k| word3_muladd(&w1, &w0, &w2, x[12], y[8]); 1178| 12.3k| word3_muladd(&w1, &w0, &w2, x[13], y[7]); 1179| 12.3k| word3_muladd(&w1, &w0, &w2, x[14], y[6]); 1180| 12.3k| word3_muladd(&w1, &w0, &w2, x[15], y[5]); 1181| 12.3k| z[20] = w2; 1182| 12.3k| w2 = 0; 1183| | 1184| 12.3k| word3_muladd(&w2, &w1, &w0, x[6], y[15]); 1185| 12.3k| word3_muladd(&w2, &w1, &w0, x[7], y[14]); 1186| 12.3k| word3_muladd(&w2, &w1, &w0, x[8], y[13]); 1187| 12.3k| word3_muladd(&w2, &w1, &w0, x[9], y[12]); 1188| 12.3k| word3_muladd(&w2, &w1, &w0, x[10], y[11]); 1189| 12.3k| word3_muladd(&w2, &w1, &w0, x[11], y[10]); 1190| 12.3k| word3_muladd(&w2, &w1, &w0, x[12], y[9]); 1191| 12.3k| word3_muladd(&w2, &w1, &w0, x[13], y[8]); 1192| 12.3k| word3_muladd(&w2, &w1, &w0, x[14], y[7]); 1193| 12.3k| word3_muladd(&w2, &w1, &w0, x[15], y[6]); 1194| 12.3k| z[21] = w0; 1195| 12.3k| w0 = 0; 1196| | 1197| 12.3k| word3_muladd(&w0, &w2, &w1, x[7], y[15]); 1198| 12.3k| word3_muladd(&w0, &w2, &w1, x[8], y[14]); 1199| 12.3k| word3_muladd(&w0, &w2, &w1, x[9], y[13]); 1200| 12.3k| word3_muladd(&w0, &w2, &w1, x[10], y[12]); 1201| 12.3k| word3_muladd(&w0, &w2, &w1, x[11], y[11]); 1202| 12.3k| word3_muladd(&w0, &w2, &w1, x[12], y[10]); 1203| 12.3k| word3_muladd(&w0, &w2, &w1, x[13], y[9]); 1204| 12.3k| word3_muladd(&w0, &w2, &w1, x[14], y[8]); 1205| 12.3k| word3_muladd(&w0, &w2, &w1, x[15], y[7]); 1206| 12.3k| z[22] = w1; 1207| 12.3k| w1 = 0; 1208| | 1209| 12.3k| word3_muladd(&w1, &w0, &w2, x[8], y[15]); 1210| 12.3k| word3_muladd(&w1, &w0, &w2, x[9], y[14]); 1211| 12.3k| word3_muladd(&w1, &w0, &w2, x[10], y[13]); 1212| 12.3k| word3_muladd(&w1, &w0, &w2, x[11], y[12]); 1213| 12.3k| word3_muladd(&w1, &w0, &w2, x[12], y[11]); 1214| 12.3k| word3_muladd(&w1, &w0, &w2, x[13], y[10]); 1215| 12.3k| word3_muladd(&w1, &w0, &w2, x[14], y[9]); 1216| 12.3k| word3_muladd(&w1, &w0, &w2, x[15], y[8]); 1217| 12.3k| z[23] = w2; 1218| 12.3k| w2 = 0; 1219| | 1220| 12.3k| word3_muladd(&w2, &w1, &w0, x[9], y[15]); 1221| 12.3k| word3_muladd(&w2, &w1, &w0, x[10], y[14]); 1222| 12.3k| word3_muladd(&w2, &w1, &w0, x[11], y[13]); 1223| 12.3k| word3_muladd(&w2, &w1, &w0, x[12], y[12]); 1224| 12.3k| word3_muladd(&w2, &w1, &w0, x[13], y[11]); 1225| 12.3k| word3_muladd(&w2, &w1, &w0, x[14], y[10]); 1226| 12.3k| word3_muladd(&w2, &w1, &w0, x[15], y[9]); 1227| 12.3k| z[24] = w0; 1228| 12.3k| w0 = 0; 1229| | 1230| 12.3k| word3_muladd(&w0, &w2, &w1, x[10], y[15]); 1231| 12.3k| word3_muladd(&w0, &w2, &w1, x[11], y[14]); 1232| 12.3k| word3_muladd(&w0, &w2, &w1, x[12], y[13]); 1233| 12.3k| word3_muladd(&w0, &w2, &w1, x[13], y[12]); 1234| 12.3k| word3_muladd(&w0, &w2, &w1, x[14], y[11]); 1235| 12.3k| word3_muladd(&w0, &w2, &w1, x[15], y[10]); 1236| 12.3k| z[25] = w1; 1237| 12.3k| w1 = 0; 1238| | 1239| 12.3k| word3_muladd(&w1, &w0, &w2, x[11], y[15]); 1240| 12.3k| word3_muladd(&w1, &w0, &w2, x[12], y[14]); 1241| 12.3k| word3_muladd(&w1, &w0, &w2, x[13], y[13]); 1242| 12.3k| word3_muladd(&w1, &w0, &w2, x[14], y[12]); 1243| 12.3k| word3_muladd(&w1, &w0, &w2, x[15], y[11]); 1244| 12.3k| z[26] = w2; 1245| 12.3k| w2 = 0; 1246| | 1247| 12.3k| word3_muladd(&w2, &w1, &w0, x[12], y[15]); 1248| 12.3k| word3_muladd(&w2, &w1, &w0, x[13], y[14]); 1249| 12.3k| word3_muladd(&w2, &w1, &w0, x[14], y[13]); 1250| 12.3k| word3_muladd(&w2, &w1, &w0, x[15], y[12]); 1251| 12.3k| z[27] = w0; 1252| 12.3k| w0 = 0; 1253| | 1254| 12.3k| word3_muladd(&w0, &w2, &w1, x[13], y[15]); 1255| 12.3k| word3_muladd(&w0, &w2, &w1, x[14], y[14]); 1256| 12.3k| word3_muladd(&w0, &w2, &w1, x[15], y[13]); 1257| 12.3k| z[28] = w1; 1258| 12.3k| w1 = 0; 1259| | 1260| 12.3k| word3_muladd(&w1, &w0, &w2, x[14], y[15]); 1261| 12.3k| word3_muladd(&w1, &w0, &w2, x[15], y[14]); 1262| 12.3k| z[29] = w2; 1263| 12.3k| w2 = 0; 1264| | 1265| 12.3k| word3_muladd(&w2, &w1, &w0, x[15], y[15]); 1266| 12.3k| z[30] = w0; 1267| 12.3k| z[31] = w1; 1268| 12.3k|} _ZN5Botan18bigint_comba_sqr24EPmPKm: 1273| 1.33k|void bigint_comba_sqr24(word z[48], const word x[24]) { 1274| 1.33k| word w2 = 0, w1 = 0, w0 = 0; 1275| | 1276| 1.33k| word3_muladd(&w2, &w1, &w0, x[0], x[0]); 1277| 1.33k| z[0] = w0; 1278| 1.33k| w0 = 0; 1279| | 1280| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[0], x[1]); 1281| 1.33k| z[1] = w1; 1282| 1.33k| w1 = 0; 1283| | 1284| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[0], x[2]); 1285| 1.33k| word3_muladd(&w1, &w0, &w2, x[1], x[1]); 1286| 1.33k| z[2] = w2; 1287| 1.33k| w2 = 0; 1288| | 1289| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[0], x[3]); 1290| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[1], x[2]); 1291| 1.33k| z[3] = w0; 1292| 1.33k| w0 = 0; 1293| | 1294| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[0], x[4]); 1295| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[1], x[3]); 1296| 1.33k| word3_muladd(&w0, &w2, &w1, x[2], x[2]); 1297| 1.33k| z[4] = w1; 1298| 1.33k| w1 = 0; 1299| | 1300| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[0], x[5]); 1301| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[1], x[4]); 1302| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[2], x[3]); 1303| 1.33k| z[5] = w2; 1304| 1.33k| w2 = 0; 1305| | 1306| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[0], x[6]); 1307| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[1], x[5]); 1308| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[2], x[4]); 1309| 1.33k| word3_muladd(&w2, &w1, &w0, x[3], x[3]); 1310| 1.33k| z[6] = w0; 1311| 1.33k| w0 = 0; 1312| | 1313| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[0], x[7]); 1314| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[1], x[6]); 1315| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[2], x[5]); 1316| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[3], x[4]); 1317| 1.33k| z[7] = w1; 1318| 1.33k| w1 = 0; 1319| | 1320| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[0], x[8]); 1321| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[1], x[7]); 1322| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[2], x[6]); 1323| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[3], x[5]); 1324| 1.33k| word3_muladd(&w1, &w0, &w2, x[4], x[4]); 1325| 1.33k| z[8] = w2; 1326| 1.33k| w2 = 0; 1327| | 1328| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[0], x[9]); 1329| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[1], x[8]); 1330| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[2], x[7]); 1331| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[3], x[6]); 1332| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[4], x[5]); 1333| 1.33k| z[9] = w0; 1334| 1.33k| w0 = 0; 1335| | 1336| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[0], x[10]); 1337| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[1], x[9]); 1338| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[2], x[8]); 1339| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[3], x[7]); 1340| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[4], x[6]); 1341| 1.33k| word3_muladd(&w0, &w2, &w1, x[5], x[5]); 1342| 1.33k| z[10] = w1; 1343| 1.33k| w1 = 0; 1344| | 1345| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[0], x[11]); 1346| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[1], x[10]); 1347| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[2], x[9]); 1348| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[3], x[8]); 1349| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[4], x[7]); 1350| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[5], x[6]); 1351| 1.33k| z[11] = w2; 1352| 1.33k| w2 = 0; 1353| | 1354| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[0], x[12]); 1355| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[1], x[11]); 1356| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[2], x[10]); 1357| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[3], x[9]); 1358| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[4], x[8]); 1359| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[5], x[7]); 1360| 1.33k| word3_muladd(&w2, &w1, &w0, x[6], x[6]); 1361| 1.33k| z[12] = w0; 1362| 1.33k| w0 = 0; 1363| | 1364| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[0], x[13]); 1365| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[1], x[12]); 1366| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[2], x[11]); 1367| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[3], x[10]); 1368| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[4], x[9]); 1369| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[5], x[8]); 1370| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[6], x[7]); 1371| 1.33k| z[13] = w1; 1372| 1.33k| w1 = 0; 1373| | 1374| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[0], x[14]); 1375| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[1], x[13]); 1376| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[2], x[12]); 1377| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[3], x[11]); 1378| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[4], x[10]); 1379| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[5], x[9]); 1380| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[6], x[8]); 1381| 1.33k| word3_muladd(&w1, &w0, &w2, x[7], x[7]); 1382| 1.33k| z[14] = w2; 1383| 1.33k| w2 = 0; 1384| | 1385| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[0], x[15]); 1386| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[1], x[14]); 1387| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[2], x[13]); 1388| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[3], x[12]); 1389| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[4], x[11]); 1390| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[5], x[10]); 1391| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[6], x[9]); 1392| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[7], x[8]); 1393| 1.33k| z[15] = w0; 1394| 1.33k| w0 = 0; 1395| | 1396| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[0], x[16]); 1397| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[1], x[15]); 1398| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[2], x[14]); 1399| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[3], x[13]); 1400| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[4], x[12]); 1401| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[5], x[11]); 1402| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[6], x[10]); 1403| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[7], x[9]); 1404| 1.33k| word3_muladd(&w0, &w2, &w1, x[8], x[8]); 1405| 1.33k| z[16] = w1; 1406| 1.33k| w1 = 0; 1407| | 1408| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[0], x[17]); 1409| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[1], x[16]); 1410| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[2], x[15]); 1411| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[3], x[14]); 1412| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[4], x[13]); 1413| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[5], x[12]); 1414| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[6], x[11]); 1415| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[7], x[10]); 1416| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[8], x[9]); 1417| 1.33k| z[17] = w2; 1418| 1.33k| w2 = 0; 1419| | 1420| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[0], x[18]); 1421| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[1], x[17]); 1422| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[2], x[16]); 1423| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[3], x[15]); 1424| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[4], x[14]); 1425| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[5], x[13]); 1426| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[6], x[12]); 1427| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[7], x[11]); 1428| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[8], x[10]); 1429| 1.33k| word3_muladd(&w2, &w1, &w0, x[9], x[9]); 1430| 1.33k| z[18] = w0; 1431| 1.33k| w0 = 0; 1432| | 1433| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[0], x[19]); 1434| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[1], x[18]); 1435| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[2], x[17]); 1436| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[3], x[16]); 1437| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[4], x[15]); 1438| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[5], x[14]); 1439| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[6], x[13]); 1440| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[7], x[12]); 1441| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[8], x[11]); 1442| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[9], x[10]); 1443| 1.33k| z[19] = w1; 1444| 1.33k| w1 = 0; 1445| | 1446| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[0], x[20]); 1447| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[1], x[19]); 1448| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[2], x[18]); 1449| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[3], x[17]); 1450| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[4], x[16]); 1451| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[5], x[15]); 1452| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[6], x[14]); 1453| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[7], x[13]); 1454| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[8], x[12]); 1455| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[9], x[11]); 1456| 1.33k| word3_muladd(&w1, &w0, &w2, x[10], x[10]); 1457| 1.33k| z[20] = w2; 1458| 1.33k| w2 = 0; 1459| | 1460| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[0], x[21]); 1461| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[1], x[20]); 1462| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[2], x[19]); 1463| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[3], x[18]); 1464| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[4], x[17]); 1465| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[5], x[16]); 1466| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[6], x[15]); 1467| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[7], x[14]); 1468| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[8], x[13]); 1469| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[9], x[12]); 1470| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[10], x[11]); 1471| 1.33k| z[21] = w0; 1472| 1.33k| w0 = 0; 1473| | 1474| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[0], x[22]); 1475| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[1], x[21]); 1476| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[2], x[20]); 1477| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[3], x[19]); 1478| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[4], x[18]); 1479| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[5], x[17]); 1480| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[6], x[16]); 1481| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[7], x[15]); 1482| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[8], x[14]); 1483| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[9], x[13]); 1484| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[10], x[12]); 1485| 1.33k| word3_muladd(&w0, &w2, &w1, x[11], x[11]); 1486| 1.33k| z[22] = w1; 1487| 1.33k| w1 = 0; 1488| | 1489| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[0], x[23]); 1490| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[1], x[22]); 1491| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[2], x[21]); 1492| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[3], x[20]); 1493| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[4], x[19]); 1494| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[5], x[18]); 1495| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[6], x[17]); 1496| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[7], x[16]); 1497| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[8], x[15]); 1498| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[9], x[14]); 1499| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[10], x[13]); 1500| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[11], x[12]); 1501| 1.33k| z[23] = w2; 1502| 1.33k| w2 = 0; 1503| | 1504| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[1], x[23]); 1505| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[2], x[22]); 1506| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[3], x[21]); 1507| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[4], x[20]); 1508| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[5], x[19]); 1509| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[6], x[18]); 1510| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[7], x[17]); 1511| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[8], x[16]); 1512| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[9], x[15]); 1513| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[10], x[14]); 1514| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[11], x[13]); 1515| 1.33k| word3_muladd(&w2, &w1, &w0, x[12], x[12]); 1516| 1.33k| z[24] = w0; 1517| 1.33k| w0 = 0; 1518| | 1519| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[2], x[23]); 1520| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[3], x[22]); 1521| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[4], x[21]); 1522| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[5], x[20]); 1523| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[6], x[19]); 1524| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[7], x[18]); 1525| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[8], x[17]); 1526| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[9], x[16]); 1527| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[10], x[15]); 1528| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[11], x[14]); 1529| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[12], x[13]); 1530| 1.33k| z[25] = w1; 1531| 1.33k| w1 = 0; 1532| | 1533| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[3], x[23]); 1534| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[4], x[22]); 1535| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[5], x[21]); 1536| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[6], x[20]); 1537| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[7], x[19]); 1538| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[8], x[18]); 1539| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[9], x[17]); 1540| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[10], x[16]); 1541| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[11], x[15]); 1542| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[12], x[14]); 1543| 1.33k| word3_muladd(&w1, &w0, &w2, x[13], x[13]); 1544| 1.33k| z[26] = w2; 1545| 1.33k| w2 = 0; 1546| | 1547| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[4], x[23]); 1548| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[5], x[22]); 1549| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[6], x[21]); 1550| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[7], x[20]); 1551| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[8], x[19]); 1552| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[9], x[18]); 1553| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[10], x[17]); 1554| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[11], x[16]); 1555| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[12], x[15]); 1556| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[13], x[14]); 1557| 1.33k| z[27] = w0; 1558| 1.33k| w0 = 0; 1559| | 1560| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[5], x[23]); 1561| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[6], x[22]); 1562| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[7], x[21]); 1563| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[8], x[20]); 1564| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[9], x[19]); 1565| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[10], x[18]); 1566| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[11], x[17]); 1567| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[12], x[16]); 1568| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[13], x[15]); 1569| 1.33k| word3_muladd(&w0, &w2, &w1, x[14], x[14]); 1570| 1.33k| z[28] = w1; 1571| 1.33k| w1 = 0; 1572| | 1573| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[6], x[23]); 1574| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[7], x[22]); 1575| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[8], x[21]); 1576| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[9], x[20]); 1577| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[10], x[19]); 1578| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[11], x[18]); 1579| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[12], x[17]); 1580| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[13], x[16]); 1581| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[14], x[15]); 1582| 1.33k| z[29] = w2; 1583| 1.33k| w2 = 0; 1584| | 1585| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[7], x[23]); 1586| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[8], x[22]); 1587| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[9], x[21]); 1588| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[10], x[20]); 1589| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[11], x[19]); 1590| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[12], x[18]); 1591| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[13], x[17]); 1592| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[14], x[16]); 1593| 1.33k| word3_muladd(&w2, &w1, &w0, x[15], x[15]); 1594| 1.33k| z[30] = w0; 1595| 1.33k| w0 = 0; 1596| | 1597| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[8], x[23]); 1598| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[9], x[22]); 1599| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[10], x[21]); 1600| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[11], x[20]); 1601| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[12], x[19]); 1602| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[13], x[18]); 1603| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[14], x[17]); 1604| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[15], x[16]); 1605| 1.33k| z[31] = w1; 1606| 1.33k| w1 = 0; 1607| | 1608| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[9], x[23]); 1609| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[10], x[22]); 1610| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[11], x[21]); 1611| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[12], x[20]); 1612| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[13], x[19]); 1613| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[14], x[18]); 1614| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[15], x[17]); 1615| 1.33k| word3_muladd(&w1, &w0, &w2, x[16], x[16]); 1616| 1.33k| z[32] = w2; 1617| 1.33k| w2 = 0; 1618| | 1619| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[10], x[23]); 1620| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[11], x[22]); 1621| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[12], x[21]); 1622| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[13], x[20]); 1623| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[14], x[19]); 1624| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[15], x[18]); 1625| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[16], x[17]); 1626| 1.33k| z[33] = w0; 1627| 1.33k| w0 = 0; 1628| | 1629| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[11], x[23]); 1630| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[12], x[22]); 1631| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[13], x[21]); 1632| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[14], x[20]); 1633| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[15], x[19]); 1634| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[16], x[18]); 1635| 1.33k| word3_muladd(&w0, &w2, &w1, x[17], x[17]); 1636| 1.33k| z[34] = w1; 1637| 1.33k| w1 = 0; 1638| | 1639| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[12], x[23]); 1640| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[13], x[22]); 1641| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[14], x[21]); 1642| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[15], x[20]); 1643| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[16], x[19]); 1644| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[17], x[18]); 1645| 1.33k| z[35] = w2; 1646| 1.33k| w2 = 0; 1647| | 1648| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[13], x[23]); 1649| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[14], x[22]); 1650| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[15], x[21]); 1651| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[16], x[20]); 1652| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[17], x[19]); 1653| 1.33k| word3_muladd(&w2, &w1, &w0, x[18], x[18]); 1654| 1.33k| z[36] = w0; 1655| 1.33k| w0 = 0; 1656| | 1657| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[14], x[23]); 1658| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[15], x[22]); 1659| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[16], x[21]); 1660| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[17], x[20]); 1661| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[18], x[19]); 1662| 1.33k| z[37] = w1; 1663| 1.33k| w1 = 0; 1664| | 1665| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[15], x[23]); 1666| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[16], x[22]); 1667| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[17], x[21]); 1668| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[18], x[20]); 1669| 1.33k| word3_muladd(&w1, &w0, &w2, x[19], x[19]); 1670| 1.33k| z[38] = w2; 1671| 1.33k| w2 = 0; 1672| | 1673| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[16], x[23]); 1674| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[17], x[22]); 1675| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[18], x[21]); 1676| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[19], x[20]); 1677| 1.33k| z[39] = w0; 1678| 1.33k| w0 = 0; 1679| | 1680| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[17], x[23]); 1681| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[18], x[22]); 1682| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[19], x[21]); 1683| 1.33k| word3_muladd(&w0, &w2, &w1, x[20], x[20]); 1684| 1.33k| z[40] = w1; 1685| 1.33k| w1 = 0; 1686| | 1687| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[18], x[23]); 1688| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[19], x[22]); 1689| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[20], x[21]); 1690| 1.33k| z[41] = w2; 1691| 1.33k| w2 = 0; 1692| | 1693| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[19], x[23]); 1694| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[20], x[22]); 1695| 1.33k| word3_muladd(&w2, &w1, &w0, x[21], x[21]); 1696| 1.33k| z[42] = w0; 1697| 1.33k| w0 = 0; 1698| | 1699| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[20], x[23]); 1700| 1.33k| word3_muladd_2(&w0, &w2, &w1, x[21], x[22]); 1701| 1.33k| z[43] = w1; 1702| 1.33k| w1 = 0; 1703| | 1704| 1.33k| word3_muladd_2(&w1, &w0, &w2, x[21], x[23]); 1705| 1.33k| word3_muladd(&w1, &w0, &w2, x[22], x[22]); 1706| 1.33k| z[44] = w2; 1707| 1.33k| w2 = 0; 1708| | 1709| 1.33k| word3_muladd_2(&w2, &w1, &w0, x[22], x[23]); 1710| 1.33k| z[45] = w0; 1711| 1.33k| w0 = 0; 1712| | 1713| 1.33k| word3_muladd(&w0, &w2, &w1, x[23], x[23]); 1714| 1.33k| z[46] = w1; 1715| 1.33k| z[47] = w2; 1716| 1.33k|} _ZN5Botan18bigint_comba_mul24EPmPKmS2_: 1721| 1.18k|void bigint_comba_mul24(word z[48], const word x[24], const word y[24]) { 1722| 1.18k| word w2 = 0, w1 = 0, w0 = 0; 1723| | 1724| 1.18k| word3_muladd(&w2, &w1, &w0, x[0], y[0]); 1725| 1.18k| z[0] = w0; 1726| 1.18k| w0 = 0; 1727| | 1728| 1.18k| word3_muladd(&w0, &w2, &w1, x[0], y[1]); 1729| 1.18k| word3_muladd(&w0, &w2, &w1, x[1], y[0]); 1730| 1.18k| z[1] = w1; 1731| 1.18k| w1 = 0; 1732| | 1733| 1.18k| word3_muladd(&w1, &w0, &w2, x[0], y[2]); 1734| 1.18k| word3_muladd(&w1, &w0, &w2, x[1], y[1]); 1735| 1.18k| word3_muladd(&w1, &w0, &w2, x[2], y[0]); 1736| 1.18k| z[2] = w2; 1737| 1.18k| w2 = 0; 1738| | 1739| 1.18k| word3_muladd(&w2, &w1, &w0, x[0], y[3]); 1740| 1.18k| word3_muladd(&w2, &w1, &w0, x[1], y[2]); 1741| 1.18k| word3_muladd(&w2, &w1, &w0, x[2], y[1]); 1742| 1.18k| word3_muladd(&w2, &w1, &w0, x[3], y[0]); 1743| 1.18k| z[3] = w0; 1744| 1.18k| w0 = 0; 1745| | 1746| 1.18k| word3_muladd(&w0, &w2, &w1, x[0], y[4]); 1747| 1.18k| word3_muladd(&w0, &w2, &w1, x[1], y[3]); 1748| 1.18k| word3_muladd(&w0, &w2, &w1, x[2], y[2]); 1749| 1.18k| word3_muladd(&w0, &w2, &w1, x[3], y[1]); 1750| 1.18k| word3_muladd(&w0, &w2, &w1, x[4], y[0]); 1751| 1.18k| z[4] = w1; 1752| 1.18k| w1 = 0; 1753| | 1754| 1.18k| word3_muladd(&w1, &w0, &w2, x[0], y[5]); 1755| 1.18k| word3_muladd(&w1, &w0, &w2, x[1], y[4]); 1756| 1.18k| word3_muladd(&w1, &w0, &w2, x[2], y[3]); 1757| 1.18k| word3_muladd(&w1, &w0, &w2, x[3], y[2]); 1758| 1.18k| word3_muladd(&w1, &w0, &w2, x[4], y[1]); 1759| 1.18k| word3_muladd(&w1, &w0, &w2, x[5], y[0]); 1760| 1.18k| z[5] = w2; 1761| 1.18k| w2 = 0; 1762| | 1763| 1.18k| word3_muladd(&w2, &w1, &w0, x[0], y[6]); 1764| 1.18k| word3_muladd(&w2, &w1, &w0, x[1], y[5]); 1765| 1.18k| word3_muladd(&w2, &w1, &w0, x[2], y[4]); 1766| 1.18k| word3_muladd(&w2, &w1, &w0, x[3], y[3]); 1767| 1.18k| word3_muladd(&w2, &w1, &w0, x[4], y[2]); 1768| 1.18k| word3_muladd(&w2, &w1, &w0, x[5], y[1]); 1769| 1.18k| word3_muladd(&w2, &w1, &w0, x[6], y[0]); 1770| 1.18k| z[6] = w0; 1771| 1.18k| w0 = 0; 1772| | 1773| 1.18k| word3_muladd(&w0, &w2, &w1, x[0], y[7]); 1774| 1.18k| word3_muladd(&w0, &w2, &w1, x[1], y[6]); 1775| 1.18k| word3_muladd(&w0, &w2, &w1, x[2], y[5]); 1776| 1.18k| word3_muladd(&w0, &w2, &w1, x[3], y[4]); 1777| 1.18k| word3_muladd(&w0, &w2, &w1, x[4], y[3]); 1778| 1.18k| word3_muladd(&w0, &w2, &w1, x[5], y[2]); 1779| 1.18k| word3_muladd(&w0, &w2, &w1, x[6], y[1]); 1780| 1.18k| word3_muladd(&w0, &w2, &w1, x[7], y[0]); 1781| 1.18k| z[7] = w1; 1782| 1.18k| w1 = 0; 1783| | 1784| 1.18k| word3_muladd(&w1, &w0, &w2, x[0], y[8]); 1785| 1.18k| word3_muladd(&w1, &w0, &w2, x[1], y[7]); 1786| 1.18k| word3_muladd(&w1, &w0, &w2, x[2], y[6]); 1787| 1.18k| word3_muladd(&w1, &w0, &w2, x[3], y[5]); 1788| 1.18k| word3_muladd(&w1, &w0, &w2, x[4], y[4]); 1789| 1.18k| word3_muladd(&w1, &w0, &w2, x[5], y[3]); 1790| 1.18k| word3_muladd(&w1, &w0, &w2, x[6], y[2]); 1791| 1.18k| word3_muladd(&w1, &w0, &w2, x[7], y[1]); 1792| 1.18k| word3_muladd(&w1, &w0, &w2, x[8], y[0]); 1793| 1.18k| z[8] = w2; 1794| 1.18k| w2 = 0; 1795| | 1796| 1.18k| word3_muladd(&w2, &w1, &w0, x[0], y[9]); 1797| 1.18k| word3_muladd(&w2, &w1, &w0, x[1], y[8]); 1798| 1.18k| word3_muladd(&w2, &w1, &w0, x[2], y[7]); 1799| 1.18k| word3_muladd(&w2, &w1, &w0, x[3], y[6]); 1800| 1.18k| word3_muladd(&w2, &w1, &w0, x[4], y[5]); 1801| 1.18k| word3_muladd(&w2, &w1, &w0, x[5], y[4]); 1802| 1.18k| word3_muladd(&w2, &w1, &w0, x[6], y[3]); 1803| 1.18k| word3_muladd(&w2, &w1, &w0, x[7], y[2]); 1804| 1.18k| word3_muladd(&w2, &w1, &w0, x[8], y[1]); 1805| 1.18k| word3_muladd(&w2, &w1, &w0, x[9], y[0]); 1806| 1.18k| z[9] = w0; 1807| 1.18k| w0 = 0; 1808| | 1809| 1.18k| word3_muladd(&w0, &w2, &w1, x[0], y[10]); 1810| 1.18k| word3_muladd(&w0, &w2, &w1, x[1], y[9]); 1811| 1.18k| word3_muladd(&w0, &w2, &w1, x[2], y[8]); 1812| 1.18k| word3_muladd(&w0, &w2, &w1, x[3], y[7]); 1813| 1.18k| word3_muladd(&w0, &w2, &w1, x[4], y[6]); 1814| 1.18k| word3_muladd(&w0, &w2, &w1, x[5], y[5]); 1815| 1.18k| word3_muladd(&w0, &w2, &w1, x[6], y[4]); 1816| 1.18k| word3_muladd(&w0, &w2, &w1, x[7], y[3]); 1817| 1.18k| word3_muladd(&w0, &w2, &w1, x[8], y[2]); 1818| 1.18k| word3_muladd(&w0, &w2, &w1, x[9], y[1]); 1819| 1.18k| word3_muladd(&w0, &w2, &w1, x[10], y[0]); 1820| 1.18k| z[10] = w1; 1821| 1.18k| w1 = 0; 1822| | 1823| 1.18k| word3_muladd(&w1, &w0, &w2, x[0], y[11]); 1824| 1.18k| word3_muladd(&w1, &w0, &w2, x[1], y[10]); 1825| 1.18k| word3_muladd(&w1, &w0, &w2, x[2], y[9]); 1826| 1.18k| word3_muladd(&w1, &w0, &w2, x[3], y[8]); 1827| 1.18k| word3_muladd(&w1, &w0, &w2, x[4], y[7]); 1828| 1.18k| word3_muladd(&w1, &w0, &w2, x[5], y[6]); 1829| 1.18k| word3_muladd(&w1, &w0, &w2, x[6], y[5]); 1830| 1.18k| word3_muladd(&w1, &w0, &w2, x[7], y[4]); 1831| 1.18k| word3_muladd(&w1, &w0, &w2, x[8], y[3]); 1832| 1.18k| word3_muladd(&w1, &w0, &w2, x[9], y[2]); 1833| 1.18k| word3_muladd(&w1, &w0, &w2, x[10], y[1]); 1834| 1.18k| word3_muladd(&w1, &w0, &w2, x[11], y[0]); 1835| 1.18k| z[11] = w2; 1836| 1.18k| w2 = 0; 1837| | 1838| 1.18k| word3_muladd(&w2, &w1, &w0, x[0], y[12]); 1839| 1.18k| word3_muladd(&w2, &w1, &w0, x[1], y[11]); 1840| 1.18k| word3_muladd(&w2, &w1, &w0, x[2], y[10]); 1841| 1.18k| word3_muladd(&w2, &w1, &w0, x[3], y[9]); 1842| 1.18k| word3_muladd(&w2, &w1, &w0, x[4], y[8]); 1843| 1.18k| word3_muladd(&w2, &w1, &w0, x[5], y[7]); 1844| 1.18k| word3_muladd(&w2, &w1, &w0, x[6], y[6]); 1845| 1.18k| word3_muladd(&w2, &w1, &w0, x[7], y[5]); 1846| 1.18k| word3_muladd(&w2, &w1, &w0, x[8], y[4]); 1847| 1.18k| word3_muladd(&w2, &w1, &w0, x[9], y[3]); 1848| 1.18k| word3_muladd(&w2, &w1, &w0, x[10], y[2]); 1849| 1.18k| word3_muladd(&w2, &w1, &w0, x[11], y[1]); 1850| 1.18k| word3_muladd(&w2, &w1, &w0, x[12], y[0]); 1851| 1.18k| z[12] = w0; 1852| 1.18k| w0 = 0; 1853| | 1854| 1.18k| word3_muladd(&w0, &w2, &w1, x[0], y[13]); 1855| 1.18k| word3_muladd(&w0, &w2, &w1, x[1], y[12]); 1856| 1.18k| word3_muladd(&w0, &w2, &w1, x[2], y[11]); 1857| 1.18k| word3_muladd(&w0, &w2, &w1, x[3], y[10]); 1858| 1.18k| word3_muladd(&w0, &w2, &w1, x[4], y[9]); 1859| 1.18k| word3_muladd(&w0, &w2, &w1, x[5], y[8]); 1860| 1.18k| word3_muladd(&w0, &w2, &w1, x[6], y[7]); 1861| 1.18k| word3_muladd(&w0, &w2, &w1, x[7], y[6]); 1862| 1.18k| word3_muladd(&w0, &w2, &w1, x[8], y[5]); 1863| 1.18k| word3_muladd(&w0, &w2, &w1, x[9], y[4]); 1864| 1.18k| word3_muladd(&w0, &w2, &w1, x[10], y[3]); 1865| 1.18k| word3_muladd(&w0, &w2, &w1, x[11], y[2]); 1866| 1.18k| word3_muladd(&w0, &w2, &w1, x[12], y[1]); 1867| 1.18k| word3_muladd(&w0, &w2, &w1, x[13], y[0]); 1868| 1.18k| z[13] = w1; 1869| 1.18k| w1 = 0; 1870| | 1871| 1.18k| word3_muladd(&w1, &w0, &w2, x[0], y[14]); 1872| 1.18k| word3_muladd(&w1, &w0, &w2, x[1], y[13]); 1873| 1.18k| word3_muladd(&w1, &w0, &w2, x[2], y[12]); 1874| 1.18k| word3_muladd(&w1, &w0, &w2, x[3], y[11]); 1875| 1.18k| word3_muladd(&w1, &w0, &w2, x[4], y[10]); 1876| 1.18k| word3_muladd(&w1, &w0, &w2, x[5], y[9]); 1877| 1.18k| word3_muladd(&w1, &w0, &w2, x[6], y[8]); 1878| 1.18k| word3_muladd(&w1, &w0, &w2, x[7], y[7]); 1879| 1.18k| word3_muladd(&w1, &w0, &w2, x[8], y[6]); 1880| 1.18k| word3_muladd(&w1, &w0, &w2, x[9], y[5]); 1881| 1.18k| word3_muladd(&w1, &w0, &w2, x[10], y[4]); 1882| 1.18k| word3_muladd(&w1, &w0, &w2, x[11], y[3]); 1883| 1.18k| word3_muladd(&w1, &w0, &w2, x[12], y[2]); 1884| 1.18k| word3_muladd(&w1, &w0, &w2, x[13], y[1]); 1885| 1.18k| word3_muladd(&w1, &w0, &w2, x[14], y[0]); 1886| 1.18k| z[14] = w2; 1887| 1.18k| w2 = 0; 1888| | 1889| 1.18k| word3_muladd(&w2, &w1, &w0, x[0], y[15]); 1890| 1.18k| word3_muladd(&w2, &w1, &w0, x[1], y[14]); 1891| 1.18k| word3_muladd(&w2, &w1, &w0, x[2], y[13]); 1892| 1.18k| word3_muladd(&w2, &w1, &w0, x[3], y[12]); 1893| 1.18k| word3_muladd(&w2, &w1, &w0, x[4], y[11]); 1894| 1.18k| word3_muladd(&w2, &w1, &w0, x[5], y[10]); 1895| 1.18k| word3_muladd(&w2, &w1, &w0, x[6], y[9]); 1896| 1.18k| word3_muladd(&w2, &w1, &w0, x[7], y[8]); 1897| 1.18k| word3_muladd(&w2, &w1, &w0, x[8], y[7]); 1898| 1.18k| word3_muladd(&w2, &w1, &w0, x[9], y[6]); 1899| 1.18k| word3_muladd(&w2, &w1, &w0, x[10], y[5]); 1900| 1.18k| word3_muladd(&w2, &w1, &w0, x[11], y[4]); 1901| 1.18k| word3_muladd(&w2, &w1, &w0, x[12], y[3]); 1902| 1.18k| word3_muladd(&w2, &w1, &w0, x[13], y[2]); 1903| 1.18k| word3_muladd(&w2, &w1, &w0, x[14], y[1]); 1904| 1.18k| word3_muladd(&w2, &w1, &w0, x[15], y[0]); 1905| 1.18k| z[15] = w0; 1906| 1.18k| w0 = 0; 1907| | 1908| 1.18k| word3_muladd(&w0, &w2, &w1, x[0], y[16]); 1909| 1.18k| word3_muladd(&w0, &w2, &w1, x[1], y[15]); 1910| 1.18k| word3_muladd(&w0, &w2, &w1, x[2], y[14]); 1911| 1.18k| word3_muladd(&w0, &w2, &w1, x[3], y[13]); 1912| 1.18k| word3_muladd(&w0, &w2, &w1, x[4], y[12]); 1913| 1.18k| word3_muladd(&w0, &w2, &w1, x[5], y[11]); 1914| 1.18k| word3_muladd(&w0, &w2, &w1, x[6], y[10]); 1915| 1.18k| word3_muladd(&w0, &w2, &w1, x[7], y[9]); 1916| 1.18k| word3_muladd(&w0, &w2, &w1, x[8], y[8]); 1917| 1.18k| word3_muladd(&w0, &w2, &w1, x[9], y[7]); 1918| 1.18k| word3_muladd(&w0, &w2, &w1, x[10], y[6]); 1919| 1.18k| word3_muladd(&w0, &w2, &w1, x[11], y[5]); 1920| 1.18k| word3_muladd(&w0, &w2, &w1, x[12], y[4]); 1921| 1.18k| word3_muladd(&w0, &w2, &w1, x[13], y[3]); 1922| 1.18k| word3_muladd(&w0, &w2, &w1, x[14], y[2]); 1923| 1.18k| word3_muladd(&w0, &w2, &w1, x[15], y[1]); 1924| 1.18k| word3_muladd(&w0, &w2, &w1, x[16], y[0]); 1925| 1.18k| z[16] = w1; 1926| 1.18k| w1 = 0; 1927| | 1928| 1.18k| word3_muladd(&w1, &w0, &w2, x[0], y[17]); 1929| 1.18k| word3_muladd(&w1, &w0, &w2, x[1], y[16]); 1930| 1.18k| word3_muladd(&w1, &w0, &w2, x[2], y[15]); 1931| 1.18k| word3_muladd(&w1, &w0, &w2, x[3], y[14]); 1932| 1.18k| word3_muladd(&w1, &w0, &w2, x[4], y[13]); 1933| 1.18k| word3_muladd(&w1, &w0, &w2, x[5], y[12]); 1934| 1.18k| word3_muladd(&w1, &w0, &w2, x[6], y[11]); 1935| 1.18k| word3_muladd(&w1, &w0, &w2, x[7], y[10]); 1936| 1.18k| word3_muladd(&w1, &w0, &w2, x[8], y[9]); 1937| 1.18k| word3_muladd(&w1, &w0, &w2, x[9], y[8]); 1938| 1.18k| word3_muladd(&w1, &w0, &w2, x[10], y[7]); 1939| 1.18k| word3_muladd(&w1, &w0, &w2, x[11], y[6]); 1940| 1.18k| word3_muladd(&w1, &w0, &w2, x[12], y[5]); 1941| 1.18k| word3_muladd(&w1, &w0, &w2, x[13], y[4]); 1942| 1.18k| word3_muladd(&w1, &w0, &w2, x[14], y[3]); 1943| 1.18k| word3_muladd(&w1, &w0, &w2, x[15], y[2]); 1944| 1.18k| word3_muladd(&w1, &w0, &w2, x[16], y[1]); 1945| 1.18k| word3_muladd(&w1, &w0, &w2, x[17], y[0]); 1946| 1.18k| z[17] = w2; 1947| 1.18k| w2 = 0; 1948| | 1949| 1.18k| word3_muladd(&w2, &w1, &w0, x[0], y[18]); 1950| 1.18k| word3_muladd(&w2, &w1, &w0, x[1], y[17]); 1951| 1.18k| word3_muladd(&w2, &w1, &w0, x[2], y[16]); 1952| 1.18k| word3_muladd(&w2, &w1, &w0, x[3], y[15]); 1953| 1.18k| word3_muladd(&w2, &w1, &w0, x[4], y[14]); 1954| 1.18k| word3_muladd(&w2, &w1, &w0, x[5], y[13]); 1955| 1.18k| word3_muladd(&w2, &w1, &w0, x[6], y[12]); 1956| 1.18k| word3_muladd(&w2, &w1, &w0, x[7], y[11]); 1957| 1.18k| word3_muladd(&w2, &w1, &w0, x[8], y[10]); 1958| 1.18k| word3_muladd(&w2, &w1, &w0, x[9], y[9]); 1959| 1.18k| word3_muladd(&w2, &w1, &w0, x[10], y[8]); 1960| 1.18k| word3_muladd(&w2, &w1, &w0, x[11], y[7]); 1961| 1.18k| word3_muladd(&w2, &w1, &w0, x[12], y[6]); 1962| 1.18k| word3_muladd(&w2, &w1, &w0, x[13], y[5]); 1963| 1.18k| word3_muladd(&w2, &w1, &w0, x[14], y[4]); 1964| 1.18k| word3_muladd(&w2, &w1, &w0, x[15], y[3]); 1965| 1.18k| word3_muladd(&w2, &w1, &w0, x[16], y[2]); 1966| 1.18k| word3_muladd(&w2, &w1, &w0, x[17], y[1]); 1967| 1.18k| word3_muladd(&w2, &w1, &w0, x[18], y[0]); 1968| 1.18k| z[18] = w0; 1969| 1.18k| w0 = 0; 1970| | 1971| 1.18k| word3_muladd(&w0, &w2, &w1, x[0], y[19]); 1972| 1.18k| word3_muladd(&w0, &w2, &w1, x[1], y[18]); 1973| 1.18k| word3_muladd(&w0, &w2, &w1, x[2], y[17]); 1974| 1.18k| word3_muladd(&w0, &w2, &w1, x[3], y[16]); 1975| 1.18k| word3_muladd(&w0, &w2, &w1, x[4], y[15]); 1976| 1.18k| word3_muladd(&w0, &w2, &w1, x[5], y[14]); 1977| 1.18k| word3_muladd(&w0, &w2, &w1, x[6], y[13]); 1978| 1.18k| word3_muladd(&w0, &w2, &w1, x[7], y[12]); 1979| 1.18k| word3_muladd(&w0, &w2, &w1, x[8], y[11]); 1980| 1.18k| word3_muladd(&w0, &w2, &w1, x[9], y[10]); 1981| 1.18k| word3_muladd(&w0, &w2, &w1, x[10], y[9]); 1982| 1.18k| word3_muladd(&w0, &w2, &w1, x[11], y[8]); 1983| 1.18k| word3_muladd(&w0, &w2, &w1, x[12], y[7]); 1984| 1.18k| word3_muladd(&w0, &w2, &w1, x[13], y[6]); 1985| 1.18k| word3_muladd(&w0, &w2, &w1, x[14], y[5]); 1986| 1.18k| word3_muladd(&w0, &w2, &w1, x[15], y[4]); 1987| 1.18k| word3_muladd(&w0, &w2, &w1, x[16], y[3]); 1988| 1.18k| word3_muladd(&w0, &w2, &w1, x[17], y[2]); 1989| 1.18k| word3_muladd(&w0, &w2, &w1, x[18], y[1]); 1990| 1.18k| word3_muladd(&w0, &w2, &w1, x[19], y[0]); 1991| 1.18k| z[19] = w1; 1992| 1.18k| w1 = 0; 1993| | 1994| 1.18k| word3_muladd(&w1, &w0, &w2, x[0], y[20]); 1995| 1.18k| word3_muladd(&w1, &w0, &w2, x[1], y[19]); 1996| 1.18k| word3_muladd(&w1, &w0, &w2, x[2], y[18]); 1997| 1.18k| word3_muladd(&w1, &w0, &w2, x[3], y[17]); 1998| 1.18k| word3_muladd(&w1, &w0, &w2, x[4], y[16]); 1999| 1.18k| word3_muladd(&w1, &w0, &w2, x[5], y[15]); 2000| 1.18k| word3_muladd(&w1, &w0, &w2, x[6], y[14]); 2001| 1.18k| word3_muladd(&w1, &w0, &w2, x[7], y[13]); 2002| 1.18k| word3_muladd(&w1, &w0, &w2, x[8], y[12]); 2003| 1.18k| word3_muladd(&w1, &w0, &w2, x[9], y[11]); 2004| 1.18k| word3_muladd(&w1, &w0, &w2, x[10], y[10]); 2005| 1.18k| word3_muladd(&w1, &w0, &w2, x[11], y[9]); 2006| 1.18k| word3_muladd(&w1, &w0, &w2, x[12], y[8]); 2007| 1.18k| word3_muladd(&w1, &w0, &w2, x[13], y[7]); 2008| 1.18k| word3_muladd(&w1, &w0, &w2, x[14], y[6]); 2009| 1.18k| word3_muladd(&w1, &w0, &w2, x[15], y[5]); 2010| 1.18k| word3_muladd(&w1, &w0, &w2, x[16], y[4]); 2011| 1.18k| word3_muladd(&w1, &w0, &w2, x[17], y[3]); 2012| 1.18k| word3_muladd(&w1, &w0, &w2, x[18], y[2]); 2013| 1.18k| word3_muladd(&w1, &w0, &w2, x[19], y[1]); 2014| 1.18k| word3_muladd(&w1, &w0, &w2, x[20], y[0]); 2015| 1.18k| z[20] = w2; 2016| 1.18k| w2 = 0; 2017| | 2018| 1.18k| word3_muladd(&w2, &w1, &w0, x[0], y[21]); 2019| 1.18k| word3_muladd(&w2, &w1, &w0, x[1], y[20]); 2020| 1.18k| word3_muladd(&w2, &w1, &w0, x[2], y[19]); 2021| 1.18k| word3_muladd(&w2, &w1, &w0, x[3], y[18]); 2022| 1.18k| word3_muladd(&w2, &w1, &w0, x[4], y[17]); 2023| 1.18k| word3_muladd(&w2, &w1, &w0, x[5], y[16]); 2024| 1.18k| word3_muladd(&w2, &w1, &w0, x[6], y[15]); 2025| 1.18k| word3_muladd(&w2, &w1, &w0, x[7], y[14]); 2026| 1.18k| word3_muladd(&w2, &w1, &w0, x[8], y[13]); 2027| 1.18k| word3_muladd(&w2, &w1, &w0, x[9], y[12]); 2028| 1.18k| word3_muladd(&w2, &w1, &w0, x[10], y[11]); 2029| 1.18k| word3_muladd(&w2, &w1, &w0, x[11], y[10]); 2030| 1.18k| word3_muladd(&w2, &w1, &w0, x[12], y[9]); 2031| 1.18k| word3_muladd(&w2, &w1, &w0, x[13], y[8]); 2032| 1.18k| word3_muladd(&w2, &w1, &w0, x[14], y[7]); 2033| 1.18k| word3_muladd(&w2, &w1, &w0, x[15], y[6]); 2034| 1.18k| word3_muladd(&w2, &w1, &w0, x[16], y[5]); 2035| 1.18k| word3_muladd(&w2, &w1, &w0, x[17], y[4]); 2036| 1.18k| word3_muladd(&w2, &w1, &w0, x[18], y[3]); 2037| 1.18k| word3_muladd(&w2, &w1, &w0, x[19], y[2]); 2038| 1.18k| word3_muladd(&w2, &w1, &w0, x[20], y[1]); 2039| 1.18k| word3_muladd(&w2, &w1, &w0, x[21], y[0]); 2040| 1.18k| z[21] = w0; 2041| 1.18k| w0 = 0; 2042| | 2043| 1.18k| word3_muladd(&w0, &w2, &w1, x[0], y[22]); 2044| 1.18k| word3_muladd(&w0, &w2, &w1, x[1], y[21]); 2045| 1.18k| word3_muladd(&w0, &w2, &w1, x[2], y[20]); 2046| 1.18k| word3_muladd(&w0, &w2, &w1, x[3], y[19]); 2047| 1.18k| word3_muladd(&w0, &w2, &w1, x[4], y[18]); 2048| 1.18k| word3_muladd(&w0, &w2, &w1, x[5], y[17]); 2049| 1.18k| word3_muladd(&w0, &w2, &w1, x[6], y[16]); 2050| 1.18k| word3_muladd(&w0, &w2, &w1, x[7], y[15]); 2051| 1.18k| word3_muladd(&w0, &w2, &w1, x[8], y[14]); 2052| 1.18k| word3_muladd(&w0, &w2, &w1, x[9], y[13]); 2053| 1.18k| word3_muladd(&w0, &w2, &w1, x[10], y[12]); 2054| 1.18k| word3_muladd(&w0, &w2, &w1, x[11], y[11]); 2055| 1.18k| word3_muladd(&w0, &w2, &w1, x[12], y[10]); 2056| 1.18k| word3_muladd(&w0, &w2, &w1, x[13], y[9]); 2057| 1.18k| word3_muladd(&w0, &w2, &w1, x[14], y[8]); 2058| 1.18k| word3_muladd(&w0, &w2, &w1, x[15], y[7]); 2059| 1.18k| word3_muladd(&w0, &w2, &w1, x[16], y[6]); 2060| 1.18k| word3_muladd(&w0, &w2, &w1, x[17], y[5]); 2061| 1.18k| word3_muladd(&w0, &w2, &w1, x[18], y[4]); 2062| 1.18k| word3_muladd(&w0, &w2, &w1, x[19], y[3]); 2063| 1.18k| word3_muladd(&w0, &w2, &w1, x[20], y[2]); 2064| 1.18k| word3_muladd(&w0, &w2, &w1, x[21], y[1]); 2065| 1.18k| word3_muladd(&w0, &w2, &w1, x[22], y[0]); 2066| 1.18k| z[22] = w1; 2067| 1.18k| w1 = 0; 2068| | 2069| 1.18k| word3_muladd(&w1, &w0, &w2, x[0], y[23]); 2070| 1.18k| word3_muladd(&w1, &w0, &w2, x[1], y[22]); 2071| 1.18k| word3_muladd(&w1, &w0, &w2, x[2], y[21]); 2072| 1.18k| word3_muladd(&w1, &w0, &w2, x[3], y[20]); 2073| 1.18k| word3_muladd(&w1, &w0, &w2, x[4], y[19]); 2074| 1.18k| word3_muladd(&w1, &w0, &w2, x[5], y[18]); 2075| 1.18k| word3_muladd(&w1, &w0, &w2, x[6], y[17]); 2076| 1.18k| word3_muladd(&w1, &w0, &w2, x[7], y[16]); 2077| 1.18k| word3_muladd(&w1, &w0, &w2, x[8], y[15]); 2078| 1.18k| word3_muladd(&w1, &w0, &w2, x[9], y[14]); 2079| 1.18k| word3_muladd(&w1, &w0, &w2, x[10], y[13]); 2080| 1.18k| word3_muladd(&w1, &w0, &w2, x[11], y[12]); 2081| 1.18k| word3_muladd(&w1, &w0, &w2, x[12], y[11]); 2082| 1.18k| word3_muladd(&w1, &w0, &w2, x[13], y[10]); 2083| 1.18k| word3_muladd(&w1, &w0, &w2, x[14], y[9]); 2084| 1.18k| word3_muladd(&w1, &w0, &w2, x[15], y[8]); 2085| 1.18k| word3_muladd(&w1, &w0, &w2, x[16], y[7]); 2086| 1.18k| word3_muladd(&w1, &w0, &w2, x[17], y[6]); 2087| 1.18k| word3_muladd(&w1, &w0, &w2, x[18], y[5]); 2088| 1.18k| word3_muladd(&w1, &w0, &w2, x[19], y[4]); 2089| 1.18k| word3_muladd(&w1, &w0, &w2, x[20], y[3]); 2090| 1.18k| word3_muladd(&w1, &w0, &w2, x[21], y[2]); 2091| 1.18k| word3_muladd(&w1, &w0, &w2, x[22], y[1]); 2092| 1.18k| word3_muladd(&w1, &w0, &w2, x[23], y[0]); 2093| 1.18k| z[23] = w2; 2094| 1.18k| w2 = 0; 2095| | 2096| 1.18k| word3_muladd(&w2, &w1, &w0, x[1], y[23]); 2097| 1.18k| word3_muladd(&w2, &w1, &w0, x[2], y[22]); 2098| 1.18k| word3_muladd(&w2, &w1, &w0, x[3], y[21]); 2099| 1.18k| word3_muladd(&w2, &w1, &w0, x[4], y[20]); 2100| 1.18k| word3_muladd(&w2, &w1, &w0, x[5], y[19]); 2101| 1.18k| word3_muladd(&w2, &w1, &w0, x[6], y[18]); 2102| 1.18k| word3_muladd(&w2, &w1, &w0, x[7], y[17]); 2103| 1.18k| word3_muladd(&w2, &w1, &w0, x[8], y[16]); 2104| 1.18k| word3_muladd(&w2, &w1, &w0, x[9], y[15]); 2105| 1.18k| word3_muladd(&w2, &w1, &w0, x[10], y[14]); 2106| 1.18k| word3_muladd(&w2, &w1, &w0, x[11], y[13]); 2107| 1.18k| word3_muladd(&w2, &w1, &w0, x[12], y[12]); 2108| 1.18k| word3_muladd(&w2, &w1, &w0, x[13], y[11]); 2109| 1.18k| word3_muladd(&w2, &w1, &w0, x[14], y[10]); 2110| 1.18k| word3_muladd(&w2, &w1, &w0, x[15], y[9]); 2111| 1.18k| word3_muladd(&w2, &w1, &w0, x[16], y[8]); 2112| 1.18k| word3_muladd(&w2, &w1, &w0, x[17], y[7]); 2113| 1.18k| word3_muladd(&w2, &w1, &w0, x[18], y[6]); 2114| 1.18k| word3_muladd(&w2, &w1, &w0, x[19], y[5]); 2115| 1.18k| word3_muladd(&w2, &w1, &w0, x[20], y[4]); 2116| 1.18k| word3_muladd(&w2, &w1, &w0, x[21], y[3]); 2117| 1.18k| word3_muladd(&w2, &w1, &w0, x[22], y[2]); 2118| 1.18k| word3_muladd(&w2, &w1, &w0, x[23], y[1]); 2119| 1.18k| z[24] = w0; 2120| 1.18k| w0 = 0; 2121| | 2122| 1.18k| word3_muladd(&w0, &w2, &w1, x[2], y[23]); 2123| 1.18k| word3_muladd(&w0, &w2, &w1, x[3], y[22]); 2124| 1.18k| word3_muladd(&w0, &w2, &w1, x[4], y[21]); 2125| 1.18k| word3_muladd(&w0, &w2, &w1, x[5], y[20]); 2126| 1.18k| word3_muladd(&w0, &w2, &w1, x[6], y[19]); 2127| 1.18k| word3_muladd(&w0, &w2, &w1, x[7], y[18]); 2128| 1.18k| word3_muladd(&w0, &w2, &w1, x[8], y[17]); 2129| 1.18k| word3_muladd(&w0, &w2, &w1, x[9], y[16]); 2130| 1.18k| word3_muladd(&w0, &w2, &w1, x[10], y[15]); 2131| 1.18k| word3_muladd(&w0, &w2, &w1, x[11], y[14]); 2132| 1.18k| word3_muladd(&w0, &w2, &w1, x[12], y[13]); 2133| 1.18k| word3_muladd(&w0, &w2, &w1, x[13], y[12]); 2134| 1.18k| word3_muladd(&w0, &w2, &w1, x[14], y[11]); 2135| 1.18k| word3_muladd(&w0, &w2, &w1, x[15], y[10]); 2136| 1.18k| word3_muladd(&w0, &w2, &w1, x[16], y[9]); 2137| 1.18k| word3_muladd(&w0, &w2, &w1, x[17], y[8]); 2138| 1.18k| word3_muladd(&w0, &w2, &w1, x[18], y[7]); 2139| 1.18k| word3_muladd(&w0, &w2, &w1, x[19], y[6]); 2140| 1.18k| word3_muladd(&w0, &w2, &w1, x[20], y[5]); 2141| 1.18k| word3_muladd(&w0, &w2, &w1, x[21], y[4]); 2142| 1.18k| word3_muladd(&w0, &w2, &w1, x[22], y[3]); 2143| 1.18k| word3_muladd(&w0, &w2, &w1, x[23], y[2]); 2144| 1.18k| z[25] = w1; 2145| 1.18k| w1 = 0; 2146| | 2147| 1.18k| word3_muladd(&w1, &w0, &w2, x[3], y[23]); 2148| 1.18k| word3_muladd(&w1, &w0, &w2, x[4], y[22]); 2149| 1.18k| word3_muladd(&w1, &w0, &w2, x[5], y[21]); 2150| 1.18k| word3_muladd(&w1, &w0, &w2, x[6], y[20]); 2151| 1.18k| word3_muladd(&w1, &w0, &w2, x[7], y[19]); 2152| 1.18k| word3_muladd(&w1, &w0, &w2, x[8], y[18]); 2153| 1.18k| word3_muladd(&w1, &w0, &w2, x[9], y[17]); 2154| 1.18k| word3_muladd(&w1, &w0, &w2, x[10], y[16]); 2155| 1.18k| word3_muladd(&w1, &w0, &w2, x[11], y[15]); 2156| 1.18k| word3_muladd(&w1, &w0, &w2, x[12], y[14]); 2157| 1.18k| word3_muladd(&w1, &w0, &w2, x[13], y[13]); 2158| 1.18k| word3_muladd(&w1, &w0, &w2, x[14], y[12]); 2159| 1.18k| word3_muladd(&w1, &w0, &w2, x[15], y[11]); 2160| 1.18k| word3_muladd(&w1, &w0, &w2, x[16], y[10]); 2161| 1.18k| word3_muladd(&w1, &w0, &w2, x[17], y[9]); 2162| 1.18k| word3_muladd(&w1, &w0, &w2, x[18], y[8]); 2163| 1.18k| word3_muladd(&w1, &w0, &w2, x[19], y[7]); 2164| 1.18k| word3_muladd(&w1, &w0, &w2, x[20], y[6]); 2165| 1.18k| word3_muladd(&w1, &w0, &w2, x[21], y[5]); 2166| 1.18k| word3_muladd(&w1, &w0, &w2, x[22], y[4]); 2167| 1.18k| word3_muladd(&w1, &w0, &w2, x[23], y[3]); 2168| 1.18k| z[26] = w2; 2169| 1.18k| w2 = 0; 2170| | 2171| 1.18k| word3_muladd(&w2, &w1, &w0, x[4], y[23]); 2172| 1.18k| word3_muladd(&w2, &w1, &w0, x[5], y[22]); 2173| 1.18k| word3_muladd(&w2, &w1, &w0, x[6], y[21]); 2174| 1.18k| word3_muladd(&w2, &w1, &w0, x[7], y[20]); 2175| 1.18k| word3_muladd(&w2, &w1, &w0, x[8], y[19]); 2176| 1.18k| word3_muladd(&w2, &w1, &w0, x[9], y[18]); 2177| 1.18k| word3_muladd(&w2, &w1, &w0, x[10], y[17]); 2178| 1.18k| word3_muladd(&w2, &w1, &w0, x[11], y[16]); 2179| 1.18k| word3_muladd(&w2, &w1, &w0, x[12], y[15]); 2180| 1.18k| word3_muladd(&w2, &w1, &w0, x[13], y[14]); 2181| 1.18k| word3_muladd(&w2, &w1, &w0, x[14], y[13]); 2182| 1.18k| word3_muladd(&w2, &w1, &w0, x[15], y[12]); 2183| 1.18k| word3_muladd(&w2, &w1, &w0, x[16], y[11]); 2184| 1.18k| word3_muladd(&w2, &w1, &w0, x[17], y[10]); 2185| 1.18k| word3_muladd(&w2, &w1, &w0, x[18], y[9]); 2186| 1.18k| word3_muladd(&w2, &w1, &w0, x[19], y[8]); 2187| 1.18k| word3_muladd(&w2, &w1, &w0, x[20], y[7]); 2188| 1.18k| word3_muladd(&w2, &w1, &w0, x[21], y[6]); 2189| 1.18k| word3_muladd(&w2, &w1, &w0, x[22], y[5]); 2190| 1.18k| word3_muladd(&w2, &w1, &w0, x[23], y[4]); 2191| 1.18k| z[27] = w0; 2192| 1.18k| w0 = 0; 2193| | 2194| 1.18k| word3_muladd(&w0, &w2, &w1, x[5], y[23]); 2195| 1.18k| word3_muladd(&w0, &w2, &w1, x[6], y[22]); 2196| 1.18k| word3_muladd(&w0, &w2, &w1, x[7], y[21]); 2197| 1.18k| word3_muladd(&w0, &w2, &w1, x[8], y[20]); 2198| 1.18k| word3_muladd(&w0, &w2, &w1, x[9], y[19]); 2199| 1.18k| word3_muladd(&w0, &w2, &w1, x[10], y[18]); 2200| 1.18k| word3_muladd(&w0, &w2, &w1, x[11], y[17]); 2201| 1.18k| word3_muladd(&w0, &w2, &w1, x[12], y[16]); 2202| 1.18k| word3_muladd(&w0, &w2, &w1, x[13], y[15]); 2203| 1.18k| word3_muladd(&w0, &w2, &w1, x[14], y[14]); 2204| 1.18k| word3_muladd(&w0, &w2, &w1, x[15], y[13]); 2205| 1.18k| word3_muladd(&w0, &w2, &w1, x[16], y[12]); 2206| 1.18k| word3_muladd(&w0, &w2, &w1, x[17], y[11]); 2207| 1.18k| word3_muladd(&w0, &w2, &w1, x[18], y[10]); 2208| 1.18k| word3_muladd(&w0, &w2, &w1, x[19], y[9]); 2209| 1.18k| word3_muladd(&w0, &w2, &w1, x[20], y[8]); 2210| 1.18k| word3_muladd(&w0, &w2, &w1, x[21], y[7]); 2211| 1.18k| word3_muladd(&w0, &w2, &w1, x[22], y[6]); 2212| 1.18k| word3_muladd(&w0, &w2, &w1, x[23], y[5]); 2213| 1.18k| z[28] = w1; 2214| 1.18k| w1 = 0; 2215| | 2216| 1.18k| word3_muladd(&w1, &w0, &w2, x[6], y[23]); 2217| 1.18k| word3_muladd(&w1, &w0, &w2, x[7], y[22]); 2218| 1.18k| word3_muladd(&w1, &w0, &w2, x[8], y[21]); 2219| 1.18k| word3_muladd(&w1, &w0, &w2, x[9], y[20]); 2220| 1.18k| word3_muladd(&w1, &w0, &w2, x[10], y[19]); 2221| 1.18k| word3_muladd(&w1, &w0, &w2, x[11], y[18]); 2222| 1.18k| word3_muladd(&w1, &w0, &w2, x[12], y[17]); 2223| 1.18k| word3_muladd(&w1, &w0, &w2, x[13], y[16]); 2224| 1.18k| word3_muladd(&w1, &w0, &w2, x[14], y[15]); 2225| 1.18k| word3_muladd(&w1, &w0, &w2, x[15], y[14]); 2226| 1.18k| word3_muladd(&w1, &w0, &w2, x[16], y[13]); 2227| 1.18k| word3_muladd(&w1, &w0, &w2, x[17], y[12]); 2228| 1.18k| word3_muladd(&w1, &w0, &w2, x[18], y[11]); 2229| 1.18k| word3_muladd(&w1, &w0, &w2, x[19], y[10]); 2230| 1.18k| word3_muladd(&w1, &w0, &w2, x[20], y[9]); 2231| 1.18k| word3_muladd(&w1, &w0, &w2, x[21], y[8]); 2232| 1.18k| word3_muladd(&w1, &w0, &w2, x[22], y[7]); 2233| 1.18k| word3_muladd(&w1, &w0, &w2, x[23], y[6]); 2234| 1.18k| z[29] = w2; 2235| 1.18k| w2 = 0; 2236| | 2237| 1.18k| word3_muladd(&w2, &w1, &w0, x[7], y[23]); 2238| 1.18k| word3_muladd(&w2, &w1, &w0, x[8], y[22]); 2239| 1.18k| word3_muladd(&w2, &w1, &w0, x[9], y[21]); 2240| 1.18k| word3_muladd(&w2, &w1, &w0, x[10], y[20]); 2241| 1.18k| word3_muladd(&w2, &w1, &w0, x[11], y[19]); 2242| 1.18k| word3_muladd(&w2, &w1, &w0, x[12], y[18]); 2243| 1.18k| word3_muladd(&w2, &w1, &w0, x[13], y[17]); 2244| 1.18k| word3_muladd(&w2, &w1, &w0, x[14], y[16]); 2245| 1.18k| word3_muladd(&w2, &w1, &w0, x[15], y[15]); 2246| 1.18k| word3_muladd(&w2, &w1, &w0, x[16], y[14]); 2247| 1.18k| word3_muladd(&w2, &w1, &w0, x[17], y[13]); 2248| 1.18k| word3_muladd(&w2, &w1, &w0, x[18], y[12]); 2249| 1.18k| word3_muladd(&w2, &w1, &w0, x[19], y[11]); 2250| 1.18k| word3_muladd(&w2, &w1, &w0, x[20], y[10]); 2251| 1.18k| word3_muladd(&w2, &w1, &w0, x[21], y[9]); 2252| 1.18k| word3_muladd(&w2, &w1, &w0, x[22], y[8]); 2253| 1.18k| word3_muladd(&w2, &w1, &w0, x[23], y[7]); 2254| 1.18k| z[30] = w0; 2255| 1.18k| w0 = 0; 2256| | 2257| 1.18k| word3_muladd(&w0, &w2, &w1, x[8], y[23]); 2258| 1.18k| word3_muladd(&w0, &w2, &w1, x[9], y[22]); 2259| 1.18k| word3_muladd(&w0, &w2, &w1, x[10], y[21]); 2260| 1.18k| word3_muladd(&w0, &w2, &w1, x[11], y[20]); 2261| 1.18k| word3_muladd(&w0, &w2, &w1, x[12], y[19]); 2262| 1.18k| word3_muladd(&w0, &w2, &w1, x[13], y[18]); 2263| 1.18k| word3_muladd(&w0, &w2, &w1, x[14], y[17]); 2264| 1.18k| word3_muladd(&w0, &w2, &w1, x[15], y[16]); 2265| 1.18k| word3_muladd(&w0, &w2, &w1, x[16], y[15]); 2266| 1.18k| word3_muladd(&w0, &w2, &w1, x[17], y[14]); 2267| 1.18k| word3_muladd(&w0, &w2, &w1, x[18], y[13]); 2268| 1.18k| word3_muladd(&w0, &w2, &w1, x[19], y[12]); 2269| 1.18k| word3_muladd(&w0, &w2, &w1, x[20], y[11]); 2270| 1.18k| word3_muladd(&w0, &w2, &w1, x[21], y[10]); 2271| 1.18k| word3_muladd(&w0, &w2, &w1, x[22], y[9]); 2272| 1.18k| word3_muladd(&w0, &w2, &w1, x[23], y[8]); 2273| 1.18k| z[31] = w1; 2274| 1.18k| w1 = 0; 2275| | 2276| 1.18k| word3_muladd(&w1, &w0, &w2, x[9], y[23]); 2277| 1.18k| word3_muladd(&w1, &w0, &w2, x[10], y[22]); 2278| 1.18k| word3_muladd(&w1, &w0, &w2, x[11], y[21]); 2279| 1.18k| word3_muladd(&w1, &w0, &w2, x[12], y[20]); 2280| 1.18k| word3_muladd(&w1, &w0, &w2, x[13], y[19]); 2281| 1.18k| word3_muladd(&w1, &w0, &w2, x[14], y[18]); 2282| 1.18k| word3_muladd(&w1, &w0, &w2, x[15], y[17]); 2283| 1.18k| word3_muladd(&w1, &w0, &w2, x[16], y[16]); 2284| 1.18k| word3_muladd(&w1, &w0, &w2, x[17], y[15]); 2285| 1.18k| word3_muladd(&w1, &w0, &w2, x[18], y[14]); 2286| 1.18k| word3_muladd(&w1, &w0, &w2, x[19], y[13]); 2287| 1.18k| word3_muladd(&w1, &w0, &w2, x[20], y[12]); 2288| 1.18k| word3_muladd(&w1, &w0, &w2, x[21], y[11]); 2289| 1.18k| word3_muladd(&w1, &w0, &w2, x[22], y[10]); 2290| 1.18k| word3_muladd(&w1, &w0, &w2, x[23], y[9]); 2291| 1.18k| z[32] = w2; 2292| 1.18k| w2 = 0; 2293| | 2294| 1.18k| word3_muladd(&w2, &w1, &w0, x[10], y[23]); 2295| 1.18k| word3_muladd(&w2, &w1, &w0, x[11], y[22]); 2296| 1.18k| word3_muladd(&w2, &w1, &w0, x[12], y[21]); 2297| 1.18k| word3_muladd(&w2, &w1, &w0, x[13], y[20]); 2298| 1.18k| word3_muladd(&w2, &w1, &w0, x[14], y[19]); 2299| 1.18k| word3_muladd(&w2, &w1, &w0, x[15], y[18]); 2300| 1.18k| word3_muladd(&w2, &w1, &w0, x[16], y[17]); 2301| 1.18k| word3_muladd(&w2, &w1, &w0, x[17], y[16]); 2302| 1.18k| word3_muladd(&w2, &w1, &w0, x[18], y[15]); 2303| 1.18k| word3_muladd(&w2, &w1, &w0, x[19], y[14]); 2304| 1.18k| word3_muladd(&w2, &w1, &w0, x[20], y[13]); 2305| 1.18k| word3_muladd(&w2, &w1, &w0, x[21], y[12]); 2306| 1.18k| word3_muladd(&w2, &w1, &w0, x[22], y[11]); 2307| 1.18k| word3_muladd(&w2, &w1, &w0, x[23], y[10]); 2308| 1.18k| z[33] = w0; 2309| 1.18k| w0 = 0; 2310| | 2311| 1.18k| word3_muladd(&w0, &w2, &w1, x[11], y[23]); 2312| 1.18k| word3_muladd(&w0, &w2, &w1, x[12], y[22]); 2313| 1.18k| word3_muladd(&w0, &w2, &w1, x[13], y[21]); 2314| 1.18k| word3_muladd(&w0, &w2, &w1, x[14], y[20]); 2315| 1.18k| word3_muladd(&w0, &w2, &w1, x[15], y[19]); 2316| 1.18k| word3_muladd(&w0, &w2, &w1, x[16], y[18]); 2317| 1.18k| word3_muladd(&w0, &w2, &w1, x[17], y[17]); 2318| 1.18k| word3_muladd(&w0, &w2, &w1, x[18], y[16]); 2319| 1.18k| word3_muladd(&w0, &w2, &w1, x[19], y[15]); 2320| 1.18k| word3_muladd(&w0, &w2, &w1, x[20], y[14]); 2321| 1.18k| word3_muladd(&w0, &w2, &w1, x[21], y[13]); 2322| 1.18k| word3_muladd(&w0, &w2, &w1, x[22], y[12]); 2323| 1.18k| word3_muladd(&w0, &w2, &w1, x[23], y[11]); 2324| 1.18k| z[34] = w1; 2325| 1.18k| w1 = 0; 2326| | 2327| 1.18k| word3_muladd(&w1, &w0, &w2, x[12], y[23]); 2328| 1.18k| word3_muladd(&w1, &w0, &w2, x[13], y[22]); 2329| 1.18k| word3_muladd(&w1, &w0, &w2, x[14], y[21]); 2330| 1.18k| word3_muladd(&w1, &w0, &w2, x[15], y[20]); 2331| 1.18k| word3_muladd(&w1, &w0, &w2, x[16], y[19]); 2332| 1.18k| word3_muladd(&w1, &w0, &w2, x[17], y[18]); 2333| 1.18k| word3_muladd(&w1, &w0, &w2, x[18], y[17]); 2334| 1.18k| word3_muladd(&w1, &w0, &w2, x[19], y[16]); 2335| 1.18k| word3_muladd(&w1, &w0, &w2, x[20], y[15]); 2336| 1.18k| word3_muladd(&w1, &w0, &w2, x[21], y[14]); 2337| 1.18k| word3_muladd(&w1, &w0, &w2, x[22], y[13]); 2338| 1.18k| word3_muladd(&w1, &w0, &w2, x[23], y[12]); 2339| 1.18k| z[35] = w2; 2340| 1.18k| w2 = 0; 2341| | 2342| 1.18k| word3_muladd(&w2, &w1, &w0, x[13], y[23]); 2343| 1.18k| word3_muladd(&w2, &w1, &w0, x[14], y[22]); 2344| 1.18k| word3_muladd(&w2, &w1, &w0, x[15], y[21]); 2345| 1.18k| word3_muladd(&w2, &w1, &w0, x[16], y[20]); 2346| 1.18k| word3_muladd(&w2, &w1, &w0, x[17], y[19]); 2347| 1.18k| word3_muladd(&w2, &w1, &w0, x[18], y[18]); 2348| 1.18k| word3_muladd(&w2, &w1, &w0, x[19], y[17]); 2349| 1.18k| word3_muladd(&w2, &w1, &w0, x[20], y[16]); 2350| 1.18k| word3_muladd(&w2, &w1, &w0, x[21], y[15]); 2351| 1.18k| word3_muladd(&w2, &w1, &w0, x[22], y[14]); 2352| 1.18k| word3_muladd(&w2, &w1, &w0, x[23], y[13]); 2353| 1.18k| z[36] = w0; 2354| 1.18k| w0 = 0; 2355| | 2356| 1.18k| word3_muladd(&w0, &w2, &w1, x[14], y[23]); 2357| 1.18k| word3_muladd(&w0, &w2, &w1, x[15], y[22]); 2358| 1.18k| word3_muladd(&w0, &w2, &w1, x[16], y[21]); 2359| 1.18k| word3_muladd(&w0, &w2, &w1, x[17], y[20]); 2360| 1.18k| word3_muladd(&w0, &w2, &w1, x[18], y[19]); 2361| 1.18k| word3_muladd(&w0, &w2, &w1, x[19], y[18]); 2362| 1.18k| word3_muladd(&w0, &w2, &w1, x[20], y[17]); 2363| 1.18k| word3_muladd(&w0, &w2, &w1, x[21], y[16]); 2364| 1.18k| word3_muladd(&w0, &w2, &w1, x[22], y[15]); 2365| 1.18k| word3_muladd(&w0, &w2, &w1, x[23], y[14]); 2366| 1.18k| z[37] = w1; 2367| 1.18k| w1 = 0; 2368| | 2369| 1.18k| word3_muladd(&w1, &w0, &w2, x[15], y[23]); 2370| 1.18k| word3_muladd(&w1, &w0, &w2, x[16], y[22]); 2371| 1.18k| word3_muladd(&w1, &w0, &w2, x[17], y[21]); 2372| 1.18k| word3_muladd(&w1, &w0, &w2, x[18], y[20]); 2373| 1.18k| word3_muladd(&w1, &w0, &w2, x[19], y[19]); 2374| 1.18k| word3_muladd(&w1, &w0, &w2, x[20], y[18]); 2375| 1.18k| word3_muladd(&w1, &w0, &w2, x[21], y[17]); 2376| 1.18k| word3_muladd(&w1, &w0, &w2, x[22], y[16]); 2377| 1.18k| word3_muladd(&w1, &w0, &w2, x[23], y[15]); 2378| 1.18k| z[38] = w2; 2379| 1.18k| w2 = 0; 2380| | 2381| 1.18k| word3_muladd(&w2, &w1, &w0, x[16], y[23]); 2382| 1.18k| word3_muladd(&w2, &w1, &w0, x[17], y[22]); 2383| 1.18k| word3_muladd(&w2, &w1, &w0, x[18], y[21]); 2384| 1.18k| word3_muladd(&w2, &w1, &w0, x[19], y[20]); 2385| 1.18k| word3_muladd(&w2, &w1, &w0, x[20], y[19]); 2386| 1.18k| word3_muladd(&w2, &w1, &w0, x[21], y[18]); 2387| 1.18k| word3_muladd(&w2, &w1, &w0, x[22], y[17]); 2388| 1.18k| word3_muladd(&w2, &w1, &w0, x[23], y[16]); 2389| 1.18k| z[39] = w0; 2390| 1.18k| w0 = 0; 2391| | 2392| 1.18k| word3_muladd(&w0, &w2, &w1, x[17], y[23]); 2393| 1.18k| word3_muladd(&w0, &w2, &w1, x[18], y[22]); 2394| 1.18k| word3_muladd(&w0, &w2, &w1, x[19], y[21]); 2395| 1.18k| word3_muladd(&w0, &w2, &w1, x[20], y[20]); 2396| 1.18k| word3_muladd(&w0, &w2, &w1, x[21], y[19]); 2397| 1.18k| word3_muladd(&w0, &w2, &w1, x[22], y[18]); 2398| 1.18k| word3_muladd(&w0, &w2, &w1, x[23], y[17]); 2399| 1.18k| z[40] = w1; 2400| 1.18k| w1 = 0; 2401| | 2402| 1.18k| word3_muladd(&w1, &w0, &w2, x[18], y[23]); 2403| 1.18k| word3_muladd(&w1, &w0, &w2, x[19], y[22]); 2404| 1.18k| word3_muladd(&w1, &w0, &w2, x[20], y[21]); 2405| 1.18k| word3_muladd(&w1, &w0, &w2, x[21], y[20]); 2406| 1.18k| word3_muladd(&w1, &w0, &w2, x[22], y[19]); 2407| 1.18k| word3_muladd(&w1, &w0, &w2, x[23], y[18]); 2408| 1.18k| z[41] = w2; 2409| 1.18k| w2 = 0; 2410| | 2411| 1.18k| word3_muladd(&w2, &w1, &w0, x[19], y[23]); 2412| 1.18k| word3_muladd(&w2, &w1, &w0, x[20], y[22]); 2413| 1.18k| word3_muladd(&w2, &w1, &w0, x[21], y[21]); 2414| 1.18k| word3_muladd(&w2, &w1, &w0, x[22], y[20]); 2415| 1.18k| word3_muladd(&w2, &w1, &w0, x[23], y[19]); 2416| 1.18k| z[42] = w0; 2417| 1.18k| w0 = 0; 2418| | 2419| 1.18k| word3_muladd(&w0, &w2, &w1, x[20], y[23]); 2420| 1.18k| word3_muladd(&w0, &w2, &w1, x[21], y[22]); 2421| 1.18k| word3_muladd(&w0, &w2, &w1, x[22], y[21]); 2422| 1.18k| word3_muladd(&w0, &w2, &w1, x[23], y[20]); 2423| 1.18k| z[43] = w1; 2424| 1.18k| w1 = 0; 2425| | 2426| 1.18k| word3_muladd(&w1, &w0, &w2, x[21], y[23]); 2427| 1.18k| word3_muladd(&w1, &w0, &w2, x[22], y[22]); 2428| 1.18k| word3_muladd(&w1, &w0, &w2, x[23], y[21]); 2429| 1.18k| z[44] = w2; 2430| 1.18k| w2 = 0; 2431| | 2432| 1.18k| word3_muladd(&w2, &w1, &w0, x[22], y[23]); 2433| 1.18k| word3_muladd(&w2, &w1, &w0, x[23], y[22]); 2434| 1.18k| z[45] = w0; 2435| 1.18k| w0 = 0; 2436| | 2437| 1.18k| word3_muladd(&w0, &w2, &w1, x[23], y[23]); 2438| 1.18k| z[46] = w1; 2439| 1.18k| z[47] = w2; 2440| 1.18k|} _ZN5Botan12basecase_mulEPmmPKmmS2_m: 20| 905k|void basecase_mul(word z[], size_t z_size, const word x[], size_t x_size, const word y[], size_t y_size) { 21| 905k| if(z_size < x_size + y_size) { ------------------ | Branch (21:7): [True: 0, False: 905k] ------------------ 22| 0| throw Invalid_Argument("basecase_mul z_size too small"); 23| 0| } 24| | 25| 905k| const size_t x_size_8 = x_size - (x_size % 8); 26| | 27| 905k| clear_mem(z, z_size); 28| | 29| 5.16M| for(size_t i = 0; i != y_size; ++i) { ------------------ | Branch (29:22): [True: 4.25M, False: 905k] ------------------ 30| 4.25M| const word y_i = y[i]; 31| | 32| 4.25M| word carry = 0; 33| | 34| 5.34M| for(size_t j = 0; j != x_size_8; j += 8) { ------------------ | Branch (34:25): [True: 1.08M, False: 4.25M] ------------------ 35| 1.08M| carry = word8_madd3(z + i + j, x + j, y_i, carry); 36| 1.08M| } 37| | 38| 21.2M| for(size_t j = x_size_8; j != x_size; ++j) { ------------------ | Branch (38:32): [True: 17.0M, False: 4.25M] ------------------ 39| 17.0M| z[i + j] = word_madd3(x[j], y_i, z[i + j], &carry); 40| 17.0M| } 41| | 42| 4.25M| z[x_size + i] = carry; 43| 4.25M| } 44| 905k|} _ZN5Botan12basecase_sqrEPmmPKmm: 46| 233k|void basecase_sqr(word z[], size_t z_size, const word x[], size_t x_size) { 47| 233k| if(z_size < 2 * x_size) { ------------------ | Branch (47:7): [True: 0, False: 233k] ------------------ 48| 0| throw Invalid_Argument("basecase_sqr z_size too small"); 49| 0| } 50| | 51| 233k| const size_t x_size_8 = x_size - (x_size % 8); 52| | 53| 233k| clear_mem(z, z_size); 54| | 55| 1.14M| for(size_t i = 0; i != x_size; ++i) { ------------------ | Branch (55:22): [True: 908k, False: 233k] ------------------ 56| 908k| const word x_i = x[i]; 57| | 58| 908k| word carry = 0; 59| | 60| 1.89M| for(size_t j = 0; j != x_size_8; j += 8) { ------------------ | Branch (60:25): [True: 983k, False: 908k] ------------------ 61| 983k| carry = word8_madd3(z + i + j, x + j, x_i, carry); 62| 983k| } 63| | 64| 4.25M| for(size_t j = x_size_8; j != x_size; ++j) { ------------------ | Branch (64:32): [True: 3.34M, False: 908k] ------------------ 65| 3.34M| z[i + j] = word_madd3(x[j], x_i, z[i + j], &carry); 66| 3.34M| } 67| | 68| 908k| z[x_size + i] = carry; 69| 908k| } 70| 233k|} _ZN5Botan10bigint_mulEPmmPKmmmS2_mmS0_m: 291| 6.58M| size_t ws_size) { 292| 6.58M| clear_mem(z, z_size); 293| | 294| 6.58M| if(x_sw == 1) { ------------------ | Branch (294:7): [True: 4.36k, False: 6.58M] ------------------ 295| 4.36k| bigint_linmul3(z, y, y_sw, x[0]); 296| 6.58M| } else if(y_sw == 1) { ------------------ | Branch (296:14): [True: 23, False: 6.58M] ------------------ 297| 23| bigint_linmul3(z, x, x_sw, y[0]); 298| 6.58M| } else if(sized_for_comba_mul<4>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (298:14): [True: 5.12M, False: 1.46M] ------------------ 299| 5.12M| bigint_comba_mul4(z, x, y); 300| 5.12M| } else if(sized_for_comba_mul<6>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (300:14): [True: 179k, False: 1.28M] ------------------ 301| 179k| bigint_comba_mul6(z, x, y); 302| 1.28M| } else if(sized_for_comba_mul<8>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (302:14): [True: 15.6k, False: 1.26M] ------------------ 303| 15.6k| bigint_comba_mul8(z, x, y); 304| 1.26M| } else if(sized_for_comba_mul<9>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (304:14): [True: 359k, False: 907k] ------------------ 305| 359k| bigint_comba_mul9(z, x, y); 306| 907k| } else if(sized_for_comba_mul<16>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (306:14): [True: 777, False: 906k] ------------------ 307| 777| bigint_comba_mul16(z, x, y); 308| 906k| } else if(sized_for_comba_mul<24>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (308:14): [True: 583, False: 905k] ------------------ 309| 583| bigint_comba_mul24(z, x, y); 310| 905k| } else if(x_sw < KARATSUBA_MULTIPLY_THRESHOLD || y_sw < KARATSUBA_MULTIPLY_THRESHOLD || !workspace) { ------------------ | Branch (310:14): [True: 902k, False: 3.24k] | Branch (310:53): [True: 194, False: 3.05k] | Branch (310:92): [True: 0, False: 3.05k] ------------------ 311| 902k| basecase_mul(z, z_size, x, x_sw, y, y_sw); 312| 902k| } else { 313| 3.05k| const size_t N = karatsuba_size(z_size, x_size, x_sw, y_size, y_sw); 314| | 315| 3.05k| if(N && z_size >= 2 * N && ws_size >= 2 * N) { ------------------ | Branch (315:10): [True: 2.15k, False: 900] | Branch (315:15): [True: 2.15k, False: 3] | Branch (315:34): [True: 2.14k, False: 5] ------------------ 316| 2.14k| karatsuba_mul(z, x, y, N, workspace); 317| 2.14k| } else { 318| 908| basecase_mul(z, z_size, x, x_sw, y, y_sw); 319| 908| } 320| 3.05k| } 321| 6.58M|} _ZN5Botan10bigint_sqrEPmmPKmmmS0_m: 326| 3.17M|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| 3.17M| clear_mem(z, z_size); 328| | 329| 3.17M| BOTAN_ASSERT(z_size / 2 >= x_sw, "Output size is sufficient"); ------------------ | | 51| 3.17M| do { \ | | 52| 3.17M| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 0, False: 3.17M] | | ------------------ | | 53| 3.17M| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 3.17M| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 330| | 331| 3.17M| if(x_sw == 1) { ------------------ | Branch (331:7): [True: 18.6k, False: 3.15M] ------------------ 332| 18.6k| bigint_linmul3(z, x, x_sw, x[0]); 333| 3.15M| } else if(sized_for_comba_sqr<4>(x_sw, x_size, z_size)) { ------------------ | Branch (333:14): [True: 2.31M, False: 846k] ------------------ 334| 2.31M| bigint_comba_sqr4(z, x); 335| 2.31M| } else if(sized_for_comba_sqr<6>(x_sw, x_size, z_size)) { ------------------ | Branch (335:14): [True: 218k, False: 627k] ------------------ 336| 218k| bigint_comba_sqr6(z, x); 337| 627k| } else if(sized_for_comba_sqr<8>(x_sw, x_size, z_size)) { ------------------ | Branch (337:14): [True: 25.6k, False: 601k] ------------------ 338| 25.6k| bigint_comba_sqr8(z, x); 339| 601k| } else if(sized_for_comba_sqr<9>(x_sw, x_size, z_size)) { ------------------ | Branch (339:14): [True: 365k, False: 236k] ------------------ 340| 365k| bigint_comba_sqr9(z, x); 341| 365k| } else if(sized_for_comba_sqr<16>(x_sw, x_size, z_size)) { ------------------ | Branch (341:14): [True: 788, False: 235k] ------------------ 342| 788| bigint_comba_sqr16(z, x); 343| 235k| } else if(sized_for_comba_sqr<24>(x_sw, x_size, z_size)) { ------------------ | Branch (343:14): [True: 583, False: 234k] ------------------ 344| 583| bigint_comba_sqr24(z, x); 345| 234k| } else if(x_size < KARATSUBA_SQUARE_THRESHOLD || !workspace) { ------------------ | Branch (345:14): [True: 227k, False: 7.74k] | Branch (345:53): [True: 0, False: 7.74k] ------------------ 346| 227k| basecase_sqr(z, z_size, x, x_sw); 347| 227k| } else { 348| 7.74k| const size_t N = karatsuba_size(z_size, x_size, x_sw); 349| | 350| 7.74k| if(N && z_size >= 2 * N && ws_size >= 2 * N) { ------------------ | Branch (350:10): [True: 5.03k, False: 2.71k] | Branch (350:15): [True: 5.03k, False: 0] | Branch (350:34): [True: 5.03k, False: 0] ------------------ 351| 5.03k| karatsuba_sqr(z, x, N, workspace); 352| 5.03k| } else { 353| 2.71k| basecase_sqr(z, z_size, x, x_sw); 354| 2.71k| } 355| 7.74k| } 356| 3.17M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_114karatsuba_sizeEmmmmm: 202| 3.05k|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| 3.05k| if(x_sw > x_size || x_sw > y_size || y_sw > x_size || y_sw > y_size) { ------------------ | Branch (203:7): [True: 0, False: 3.05k] | Branch (203:24): [True: 0, False: 3.05k] | Branch (203:41): [True: 73, False: 2.98k] | Branch (203:58): [True: 0, False: 2.98k] ------------------ 204| 73| return 0; 205| 73| } 206| | 207| 2.98k| if(((x_size == x_sw) && (x_size % 2)) || ((y_size == y_sw) && (y_size % 2))) { ------------------ | Branch (207:8): [True: 34, False: 2.94k] | Branch (207:28): [True: 0, False: 34] | Branch (207:46): [True: 28, False: 2.95k] | Branch (207:66): [True: 0, False: 28] ------------------ 208| 0| return 0; 209| 0| } 210| | 211| 2.98k| const size_t start = (x_sw > y_sw) ? x_sw : y_sw; ------------------ | Branch (211:25): [True: 16, False: 2.96k] ------------------ 212| 2.98k| const size_t end = (x_size < y_size) ? x_size : y_size; ------------------ | Branch (212:23): [True: 223, False: 2.75k] ------------------ 213| | 214| 2.98k| if(start == end) { ------------------ | Branch (214:7): [True: 62, False: 2.91k] ------------------ 215| 62| if(start % 2) { ------------------ | Branch (215:10): [True: 0, False: 62] ------------------ 216| 0| return 0; 217| 0| } 218| 62| return start; 219| 62| } 220| | 221| 3.72k| for(size_t j = start; j <= end; ++j) { ------------------ | Branch (221:26): [True: 3.72k, False: 0] ------------------ 222| 3.72k| if(j % 2) { ------------------ | Branch (222:10): [True: 811, False: 2.91k] ------------------ 223| 811| continue; 224| 811| } 225| | 226| 2.91k| if(2 * j > z_size) { ------------------ | Branch (226:10): [True: 827, False: 2.09k] ------------------ 227| 827| return 0; 228| 827| } 229| | 230| 2.09k| if(x_sw <= j && j <= x_size && y_sw <= j && j <= y_size) { ------------------ | Branch (230:10): [True: 2.09k, False: 0] | Branch (230:23): [True: 2.09k, False: 0] | Branch (230:38): [True: 2.09k, False: 0] | Branch (230:51): [True: 2.09k, False: 0] ------------------ 231| 2.09k| if(j % 4 == 2 && (j + 2) <= x_size && (j + 2) <= y_size && 2 * (j + 2) <= z_size) { ------------------ | Branch (231:13): [True: 301, False: 1.79k] | Branch (231:27): [True: 301, False: 0] | Branch (231:48): [True: 301, False: 0] | Branch (231:69): [True: 68, False: 233] ------------------ 232| 68| return j + 2; 233| 68| } 234| 2.02k| return j; 235| 2.09k| } 236| 2.09k| } 237| | 238| 0| return 0; 239| 2.91k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_113karatsuba_mulEPmPKmS3_mS1_: 80| 20.5k|void karatsuba_mul(word z[], const word x[], const word y[], size_t N, word workspace[]) { 81| 20.5k| if(N < KARATSUBA_MULTIPLY_THRESHOLD || N % 2) { ------------------ | Branch (81:7): [True: 13.9k, False: 6.56k] | Branch (81:43): [True: 435, False: 6.13k] ------------------ 82| 14.4k| switch(N) { 83| 0| case 6: ------------------ | Branch (83:10): [True: 0, False: 14.4k] ------------------ 84| 0| return bigint_comba_mul6(z, x, y); 85| 0| case 8: ------------------ | Branch (85:10): [True: 0, False: 14.4k] ------------------ 86| 0| return bigint_comba_mul8(z, x, y); 87| 0| case 9: ------------------ | Branch (87:10): [True: 0, False: 14.4k] ------------------ 88| 0| return bigint_comba_mul9(z, x, y); 89| 11.5k| case 16: ------------------ | Branch (89:10): [True: 11.5k, False: 2.82k] ------------------ 90| 11.5k| return bigint_comba_mul16(z, x, y); 91| 603| case 24: ------------------ | Branch (91:10): [True: 603, False: 13.8k] ------------------ 92| 603| return bigint_comba_mul24(z, x, y); 93| 2.22k| default: ------------------ | Branch (93:10): [True: 2.22k, False: 12.1k] ------------------ 94| 2.22k| return basecase_mul(z, 2 * N, x, N, y, N); 95| 14.4k| } 96| 14.4k| } 97| | 98| 6.13k| const size_t N2 = N / 2; 99| | 100| 6.13k| const word* x0 = x; 101| 6.13k| const word* x1 = x + N2; 102| 6.13k| const word* y0 = y; 103| 6.13k| const word* y1 = y + N2; 104| 6.13k| word* z0 = z; 105| 6.13k| word* z1 = z + N; 106| | 107| 6.13k| word* ws0 = workspace; 108| 6.13k| word* ws1 = workspace + N; 109| | 110| 6.13k| 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| 6.13k| const auto cmp0 = bigint_sub_abs(z0, x0, x1, N2, workspace); 123| 6.13k| const auto cmp1 = bigint_sub_abs(z1, y1, y0, N2, workspace); 124| 6.13k| const auto neg_mask = ~(cmp0 ^ cmp1); 125| | 126| 6.13k| karatsuba_mul(ws0, z0, z1, N2, ws1); 127| | 128| | // Compute X_lo * Y_lo 129| 6.13k| karatsuba_mul(z0, x0, y0, N2, ws1); 130| | 131| | // Compute X_hi * Y_hi 132| 6.13k| karatsuba_mul(z1, x1, y1, N2, ws1); 133| | 134| 6.13k| const word ws_carry = bigint_add3_nc(ws1, z0, N, z1, N); 135| 6.13k| word z_carry = bigint_add2_nc(z + N2, N, ws1, N); 136| | 137| 6.13k| z_carry += bigint_add2_nc(z + N + N2, N2, &ws_carry, 1); 138| 6.13k| bigint_add2_nc(z + N + N2, N2, &z_carry, 1); 139| | 140| 6.13k| clear_mem(workspace + N, N2); 141| | 142| 6.13k| bigint_cnd_add_or_sub(neg_mask, z + N2, workspace, 2 * N - N2); 143| 6.13k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_114karatsuba_sizeEmmm: 244| 7.74k|size_t karatsuba_size(size_t z_size, size_t x_size, size_t x_sw) { 245| 7.74k| if(x_sw == x_size) { ------------------ | Branch (245:7): [True: 0, False: 7.74k] ------------------ 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| 10.4k| for(size_t j = x_sw; j <= x_size; ++j) { ------------------ | Branch (252:25): [True: 10.4k, False: 0] ------------------ 253| 10.4k| if(j % 2) { ------------------ | Branch (253:10): [True: 2.71k, False: 7.74k] ------------------ 254| 2.71k| continue; 255| 2.71k| } 256| | 257| 7.74k| if(2 * j > z_size) { ------------------ | Branch (257:10): [True: 2.71k, False: 5.03k] ------------------ 258| 2.71k| return 0; 259| 2.71k| } 260| | 261| 5.03k| if(j % 4 == 2 && (j + 2) <= x_size && 2 * (j + 2) <= z_size) { ------------------ | Branch (261:10): [True: 460, False: 4.57k] | Branch (261:24): [True: 460, False: 0] | Branch (261:45): [True: 0, False: 460] ------------------ 262| 0| return j + 2; 263| 0| } 264| 5.03k| return j; 265| 5.03k| } 266| | 267| 0| return 0; 268| 7.74k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_113karatsuba_sqrEPmPKmmS1_: 148| 32.5k|void karatsuba_sqr(word z[], const word x[], size_t N, word workspace[]) { 149| 32.5k| if(N < KARATSUBA_SQUARE_THRESHOLD || N % 2) { ------------------ | Branch (149:7): [True: 22.7k, False: 9.75k] | Branch (149:41): [True: 579, False: 9.17k] ------------------ 150| 23.3k| switch(N) { 151| 0| case 6: ------------------ | Branch (151:10): [True: 0, False: 23.3k] ------------------ 152| 0| return bigint_comba_sqr6(z, x); 153| 0| case 8: ------------------ | Branch (153:10): [True: 0, False: 23.3k] ------------------ 154| 0| return bigint_comba_sqr8(z, x); 155| 0| case 9: ------------------ | Branch (155:10): [True: 0, False: 23.3k] ------------------ 156| 0| return bigint_comba_sqr9(z, x); 157| 18.6k| case 16: ------------------ | Branch (157:10): [True: 18.6k, False: 4.68k] ------------------ 158| 18.6k| return bigint_comba_sqr16(z, x); 159| 747| case 24: ------------------ | Branch (159:10): [True: 747, False: 22.6k] ------------------ 160| 747| return bigint_comba_sqr24(z, x); 161| 3.93k| default: ------------------ | Branch (161:10): [True: 3.93k, False: 19.4k] ------------------ 162| 3.93k| return basecase_sqr(z, 2 * N, x, N); 163| 23.3k| } 164| 23.3k| } 165| | 166| 9.17k| const size_t N2 = N / 2; 167| | 168| 9.17k| const word* x0 = x; 169| 9.17k| const word* x1 = x + N2; 170| 9.17k| word* z0 = z; 171| 9.17k| word* z1 = z + N; 172| | 173| 9.17k| word* ws0 = workspace; 174| 9.17k| word* ws1 = workspace + N; 175| | 176| 9.17k| clear_mem(workspace, 2 * N); 177| | 178| | // See comment in karatsuba_mul 179| 9.17k| bigint_sub_abs(z0, x0, x1, N2, workspace); 180| 9.17k| karatsuba_sqr(ws0, z0, N2, ws1); 181| | 182| 9.17k| karatsuba_sqr(z0, x0, N2, ws1); 183| 9.17k| karatsuba_sqr(z1, x1, N2, ws1); 184| | 185| 9.17k| const word ws_carry = bigint_add3_nc(ws1, z0, N, z1, N); 186| 9.17k| word z_carry = bigint_add2_nc(z + N2, N, ws1, N); 187| | 188| 9.17k| z_carry += bigint_add2_nc(z + N + N2, N2, &ws_carry, 1); 189| 9.17k| 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| 9.17k| bigint_sub2(z + N2, 2 * N - N2, ws0, N); 197| 9.17k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm4EEEbmmmmm: 271| 6.58M|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| 6.58M| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (272:12): [True: 5.80M, False: 774k] | Branch (272:26): [True: 5.77M, False: 37.4k] | Branch (272:42): [True: 5.32M, False: 446k] | Branch (272:56): [True: 5.30M, False: 15.3k] | Branch (272:72): [True: 5.12M, False: 188k] ------------------ 273| 6.58M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm6EEEbmmmmm: 271| 1.46M|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| 1.46M| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (272:12): [True: 1.06M, False: 398k] | Branch (272:26): [True: 1.02M, False: 43.3k] | Branch (272:42): [True: 1.01M, False: 1.37k] | Branch (272:56): [True: 1.00M, False: 15.3k] | Branch (272:72): [True: 179k, False: 823k] ------------------ 273| 1.46M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm8EEEbmmmmm: 271| 1.28M|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| 1.28M| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (272:12): [True: 915k, False: 367k] | Branch (272:26): [True: 803k, False: 112k] | Branch (272:42): [True: 794k, False: 8.32k] | Branch (272:56): [True: 764k, False: 29.9k] | Branch (272:72): [True: 15.6k, False: 749k] ------------------ 273| 1.28M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm9EEEbmmmmm: 271| 1.26M|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| 1.26M| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (272:12): [True: 1.26M, False: 6.51k] | Branch (272:26): [True: 490k, False: 770k] | Branch (272:42): [True: 489k, False: 604] | Branch (272:56): [True: 457k, False: 32.2k] | Branch (272:72): [True: 359k, False: 97.5k] ------------------ 273| 1.26M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm16EEEbmmmmm: 271| 907k|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| 907k| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (272:12): [True: 902k, False: 4.80k] | Branch (272:26): [True: 110k, False: 791k] | Branch (272:42): [True: 110k, False: 401] | Branch (272:56): [True: 95.7k, False: 14.6k] | Branch (272:72): [True: 777, False: 94.9k] ------------------ 273| 907k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm24EEEbmmmmm: 271| 906k|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| 906k| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (272:12): [True: 902k, False: 3.93k] | Branch (272:26): [True: 92.1k, False: 810k] | Branch (272:42): [True: 91.7k, False: 321] | Branch (272:56): [True: 5.99k, False: 85.7k] | Branch (272:72): [True: 583, False: 5.41k] ------------------ 273| 906k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm4EEEbmmm: 276| 3.15M|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 277| 3.15M| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (277:12): [True: 2.52M, False: 634k] | Branch (277:26): [True: 2.51M, False: 8.43k] | Branch (277:42): [True: 2.31M, False: 203k] ------------------ 278| 3.15M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm6EEEbmmm: 276| 846k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 277| 846k| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (277:12): [True: 431k, False: 414k] | Branch (277:26): [True: 423k, False: 8.43k] | Branch (277:42): [True: 218k, False: 204k] ------------------ 278| 846k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm8EEEbmmm: 276| 627k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 277| 627k| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (277:12): [True: 252k, False: 374k] | Branch (277:26): [True: 198k, False: 53.8k] | Branch (277:42): [True: 25.6k, False: 173k] ------------------ 278| 627k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm9EEEbmmm: 276| 601k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 277| 601k| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (277:12): [True: 592k, False: 9.12k] | Branch (277:26): [True: 438k, False: 154k] | Branch (277:42): [True: 365k, False: 72.8k] ------------------ 278| 601k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm16EEEbmmm: 276| 236k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 277| 236k| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (277:12): [True: 230k, False: 5.62k] | Branch (277:26): [True: 58.6k, False: 171k] | Branch (277:42): [True: 788, False: 57.8k] ------------------ 278| 236k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm24EEEbmmm: 276| 235k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 277| 235k| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (277:12): [True: 230k, False: 4.72k] | Branch (277:26): [True: 13.3k, False: 217k] | Branch (277:42): [True: 583, False: 12.7k] ------------------ 278| 235k|} _ZN5Botan25bigint_monty_redc_genericEPmmPKmmmS0_: 31| 441k|void bigint_monty_redc_generic(word z[], size_t z_size, const word p[], size_t p_size, word p_dash, word ws[]) { 32| 441k| BOTAN_ARG_CHECK(z_size >= 2 * p_size && p_size > 0, "Invalid sizes for bigint_monty_redc_generic"); ------------------ | | 30| 441k| do { \ | | 31| 883k| if(!(expr)) \ | | ------------------ | | | Branch (31:12): [True: 441k, False: 0] | | | Branch (31:12): [True: 441k, False: 0] | | ------------------ | | 32| 441k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 441k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 33| | 34| 441k| word w2 = 0, w1 = 0, w0 = 0; 35| | 36| 441k| w0 = z[0]; 37| | 38| 441k| ws[0] = w0 * p_dash; 39| | 40| 441k| word3_muladd(&w2, &w1, &w0, ws[0], p[0]); 41| | 42| 441k| w0 = w1; 43| 441k| w1 = w2; 44| 441k| w2 = 0; 45| | 46| 2.06M| for(size_t i = 1; i != p_size; ++i) { ------------------ | Branch (46:22): [True: 1.62M, False: 441k] ------------------ 47| 19.4M| for(size_t j = 0; j < i; ++j) { ------------------ | Branch (47:25): [True: 17.8M, False: 1.62M] ------------------ 48| 17.8M| word3_muladd(&w2, &w1, &w0, ws[j], p[i - j]); 49| 17.8M| } 50| | 51| 1.62M| word3_add(&w2, &w1, &w0, z[i]); 52| | 53| 1.62M| ws[i] = w0 * p_dash; 54| | 55| 1.62M| word3_muladd(&w2, &w1, &w0, ws[i], p[0]); 56| | 57| 1.62M| w0 = w1; 58| 1.62M| w1 = w2; 59| 1.62M| w2 = 0; 60| 1.62M| } 61| | 62| 2.06M| for(size_t i = 0; i != p_size - 1; ++i) { ------------------ | Branch (62:22): [True: 1.62M, False: 441k] ------------------ 63| 19.4M| for(size_t j = i + 1; j != p_size; ++j) { ------------------ | Branch (63:29): [True: 17.8M, False: 1.62M] ------------------ 64| 17.8M| word3_muladd(&w2, &w1, &w0, ws[j], p[p_size + i - j]); 65| 17.8M| } 66| | 67| 1.62M| word3_add(&w2, &w1, &w0, z[p_size + i]); 68| | 69| 1.62M| ws[i] = w0; 70| | 71| 1.62M| w0 = w1; 72| 1.62M| w1 = w2; 73| 1.62M| w2 = 0; 74| 1.62M| } 75| | 76| 441k| word3_add(&w2, &w1, &w0, z[2 * p_size - 1]); 77| | 78| 441k| ws[p_size - 1] = w0; 79| 441k| 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| 441k| word borrow = bigint_sub3(z, ws, p_size + 1, p, p_size); 98| | 99| 441k| BOTAN_DEBUG_ASSERT(borrow == 0 || borrow == 1); ------------------ | | 99| 441k| do { \ | | 100| 441k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 100| | 101| 441k| CT::conditional_assign_mem(borrow, z, ws, p_size); 102| 441k| clear_mem(z + p_size, z_size - p_size); 103| 441k|} _ZN5Botan19bigint_monty_redc_4EPmPKmmS0_: 14| 5.80M|void bigint_monty_redc_4(word z[8], const word p[4], word p_dash, word ws[]) { 15| 5.80M| word w2 = 0, w1 = 0, w0 = 0; 16| 5.80M| w0 = z[0]; 17| 5.80M| ws[0] = w0 * p_dash; 18| 5.80M| word3_muladd(&w2, &w1, &w0, ws[0], p[0]); 19| 5.80M| w0 = w1; 20| 5.80M| w1 = w2; 21| 5.80M| w2 = 0; 22| 5.80M| word3_muladd(&w2, &w1, &w0, ws[0], p[1]); 23| 5.80M| word3_add(&w2, &w1, &w0, z[1]); 24| 5.80M| ws[1] = w0 * p_dash; 25| 5.80M| word3_muladd(&w2, &w1, &w0, ws[1], p[0]); 26| 5.80M| w0 = w1; 27| 5.80M| w1 = w2; 28| 5.80M| w2 = 0; 29| 5.80M| word3_muladd(&w2, &w1, &w0, ws[0], p[2]); 30| 5.80M| word3_muladd(&w2, &w1, &w0, ws[1], p[1]); 31| 5.80M| word3_add(&w2, &w1, &w0, z[2]); 32| 5.80M| ws[2] = w0 * p_dash; 33| 5.80M| word3_muladd(&w2, &w1, &w0, ws[2], p[0]); 34| 5.80M| w0 = w1; 35| 5.80M| w1 = w2; 36| 5.80M| w2 = 0; 37| 5.80M| word3_muladd(&w2, &w1, &w0, ws[0], p[3]); 38| 5.80M| word3_muladd(&w2, &w1, &w0, ws[1], p[2]); 39| 5.80M| word3_muladd(&w2, &w1, &w0, ws[2], p[1]); 40| 5.80M| word3_add(&w2, &w1, &w0, z[3]); 41| 5.80M| ws[3] = w0 * p_dash; 42| 5.80M| word3_muladd(&w2, &w1, &w0, ws[3], p[0]); 43| 5.80M| w0 = w1; 44| 5.80M| w1 = w2; 45| 5.80M| w2 = 0; 46| 5.80M| word3_muladd(&w2, &w1, &w0, ws[1], p[3]); 47| 5.80M| word3_muladd(&w2, &w1, &w0, ws[2], p[2]); 48| 5.80M| word3_muladd(&w2, &w1, &w0, ws[3], p[1]); 49| 5.80M| word3_add(&w2, &w1, &w0, z[4]); 50| 5.80M| ws[0] = w0; 51| 5.80M| w0 = w1; 52| 5.80M| w1 = w2; 53| 5.80M| w2 = 0; 54| 5.80M| word3_muladd(&w2, &w1, &w0, ws[2], p[3]); 55| 5.80M| word3_muladd(&w2, &w1, &w0, ws[3], p[2]); 56| 5.80M| word3_add(&w2, &w1, &w0, z[5]); 57| 5.80M| ws[1] = w0; 58| 5.80M| w0 = w1; 59| 5.80M| w1 = w2; 60| 5.80M| w2 = 0; 61| 5.80M| word3_muladd(&w2, &w1, &w0, ws[3], p[3]); 62| 5.80M| word3_add(&w2, &w1, &w0, z[6]); 63| 5.80M| ws[2] = w0; 64| 5.80M| w0 = w1; 65| 5.80M| w1 = w2; 66| 5.80M| w2 = 0; 67| 5.80M| word3_add(&w2, &w1, &w0, z[7]); 68| 5.80M| ws[3] = w0; 69| 5.80M| ws[4] = w1; 70| 5.80M| word borrow = bigint_sub3(z, ws, 4 + 1, p, 4); 71| 5.80M| CT::conditional_assign_mem(borrow, z, ws, 4); 72| 5.80M| clear_mem(z + 4, 4); 73| 5.80M|} _ZN5Botan19bigint_monty_redc_6EPmPKmmS0_: 75| 103k|void bigint_monty_redc_6(word z[12], const word p[6], word p_dash, word ws[]) { 76| 103k| word w2 = 0, w1 = 0, w0 = 0; 77| 103k| w0 = z[0]; 78| 103k| ws[0] = w0 * p_dash; 79| 103k| word3_muladd(&w2, &w1, &w0, ws[0], p[0]); 80| 103k| w0 = w1; 81| 103k| w1 = w2; 82| 103k| w2 = 0; 83| 103k| word3_muladd(&w2, &w1, &w0, ws[0], p[1]); 84| 103k| word3_add(&w2, &w1, &w0, z[1]); 85| 103k| ws[1] = w0 * p_dash; 86| 103k| word3_muladd(&w2, &w1, &w0, ws[1], p[0]); 87| 103k| w0 = w1; 88| 103k| w1 = w2; 89| 103k| w2 = 0; 90| 103k| word3_muladd(&w2, &w1, &w0, ws[0], p[2]); 91| 103k| word3_muladd(&w2, &w1, &w0, ws[1], p[1]); 92| 103k| word3_add(&w2, &w1, &w0, z[2]); 93| 103k| ws[2] = w0 * p_dash; 94| 103k| word3_muladd(&w2, &w1, &w0, ws[2], p[0]); 95| 103k| w0 = w1; 96| 103k| w1 = w2; 97| 103k| w2 = 0; 98| 103k| word3_muladd(&w2, &w1, &w0, ws[0], p[3]); 99| 103k| word3_muladd(&w2, &w1, &w0, ws[1], p[2]); 100| 103k| word3_muladd(&w2, &w1, &w0, ws[2], p[1]); 101| 103k| word3_add(&w2, &w1, &w0, z[3]); 102| 103k| ws[3] = w0 * p_dash; 103| 103k| word3_muladd(&w2, &w1, &w0, ws[3], p[0]); 104| 103k| w0 = w1; 105| 103k| w1 = w2; 106| 103k| w2 = 0; 107| 103k| word3_muladd(&w2, &w1, &w0, ws[0], p[4]); 108| 103k| word3_muladd(&w2, &w1, &w0, ws[1], p[3]); 109| 103k| word3_muladd(&w2, &w1, &w0, ws[2], p[2]); 110| 103k| word3_muladd(&w2, &w1, &w0, ws[3], p[1]); 111| 103k| word3_add(&w2, &w1, &w0, z[4]); 112| 103k| ws[4] = w0 * p_dash; 113| 103k| word3_muladd(&w2, &w1, &w0, ws[4], p[0]); 114| 103k| w0 = w1; 115| 103k| w1 = w2; 116| 103k| w2 = 0; 117| 103k| word3_muladd(&w2, &w1, &w0, ws[0], p[5]); 118| 103k| word3_muladd(&w2, &w1, &w0, ws[1], p[4]); 119| 103k| word3_muladd(&w2, &w1, &w0, ws[2], p[3]); 120| 103k| word3_muladd(&w2, &w1, &w0, ws[3], p[2]); 121| 103k| word3_muladd(&w2, &w1, &w0, ws[4], p[1]); 122| 103k| word3_add(&w2, &w1, &w0, z[5]); 123| 103k| ws[5] = w0 * p_dash; 124| 103k| word3_muladd(&w2, &w1, &w0, ws[5], p[0]); 125| 103k| w0 = w1; 126| 103k| w1 = w2; 127| 103k| w2 = 0; 128| 103k| word3_muladd(&w2, &w1, &w0, ws[1], p[5]); 129| 103k| word3_muladd(&w2, &w1, &w0, ws[2], p[4]); 130| 103k| word3_muladd(&w2, &w1, &w0, ws[3], p[3]); 131| 103k| word3_muladd(&w2, &w1, &w0, ws[4], p[2]); 132| 103k| word3_muladd(&w2, &w1, &w0, ws[5], p[1]); 133| 103k| word3_add(&w2, &w1, &w0, z[6]); 134| 103k| ws[0] = w0; 135| 103k| w0 = w1; 136| 103k| w1 = w2; 137| 103k| w2 = 0; 138| 103k| word3_muladd(&w2, &w1, &w0, ws[2], p[5]); 139| 103k| word3_muladd(&w2, &w1, &w0, ws[3], p[4]); 140| 103k| word3_muladd(&w2, &w1, &w0, ws[4], p[3]); 141| 103k| word3_muladd(&w2, &w1, &w0, ws[5], p[2]); 142| 103k| word3_add(&w2, &w1, &w0, z[7]); 143| 103k| ws[1] = w0; 144| 103k| w0 = w1; 145| 103k| w1 = w2; 146| 103k| w2 = 0; 147| 103k| word3_muladd(&w2, &w1, &w0, ws[3], p[5]); 148| 103k| word3_muladd(&w2, &w1, &w0, ws[4], p[4]); 149| 103k| word3_muladd(&w2, &w1, &w0, ws[5], p[3]); 150| 103k| word3_add(&w2, &w1, &w0, z[8]); 151| 103k| ws[2] = w0; 152| 103k| w0 = w1; 153| 103k| w1 = w2; 154| 103k| w2 = 0; 155| 103k| word3_muladd(&w2, &w1, &w0, ws[4], p[5]); 156| 103k| word3_muladd(&w2, &w1, &w0, ws[5], p[4]); 157| 103k| word3_add(&w2, &w1, &w0, z[9]); 158| 103k| ws[3] = w0; 159| 103k| w0 = w1; 160| 103k| w1 = w2; 161| 103k| w2 = 0; 162| 103k| word3_muladd(&w2, &w1, &w0, ws[5], p[5]); 163| 103k| word3_add(&w2, &w1, &w0, z[10]); 164| 103k| ws[4] = w0; 165| 103k| w0 = w1; 166| 103k| w1 = w2; 167| 103k| w2 = 0; 168| 103k| word3_add(&w2, &w1, &w0, z[11]); 169| 103k| ws[5] = w0; 170| 103k| ws[6] = w1; 171| 103k| word borrow = bigint_sub3(z, ws, 6 + 1, p, 6); 172| 103k| CT::conditional_assign_mem(borrow, z, ws, 6); 173| 103k| clear_mem(z + 6, 6); 174| 103k|} _ZN5Botan19bigint_monty_redc_8EPmPKmmS0_: 176| 31.4k|void bigint_monty_redc_8(word z[16], const word p[8], word p_dash, word ws[]) { 177| 31.4k| word w2 = 0, w1 = 0, w0 = 0; 178| 31.4k| w0 = z[0]; 179| 31.4k| ws[0] = w0 * p_dash; 180| 31.4k| word3_muladd(&w2, &w1, &w0, ws[0], p[0]); 181| 31.4k| w0 = w1; 182| 31.4k| w1 = w2; 183| 31.4k| w2 = 0; 184| 31.4k| word3_muladd(&w2, &w1, &w0, ws[0], p[1]); 185| 31.4k| word3_add(&w2, &w1, &w0, z[1]); 186| 31.4k| ws[1] = w0 * p_dash; 187| 31.4k| word3_muladd(&w2, &w1, &w0, ws[1], p[0]); 188| 31.4k| w0 = w1; 189| 31.4k| w1 = w2; 190| 31.4k| w2 = 0; 191| 31.4k| word3_muladd(&w2, &w1, &w0, ws[0], p[2]); 192| 31.4k| word3_muladd(&w2, &w1, &w0, ws[1], p[1]); 193| 31.4k| word3_add(&w2, &w1, &w0, z[2]); 194| 31.4k| ws[2] = w0 * p_dash; 195| 31.4k| word3_muladd(&w2, &w1, &w0, ws[2], p[0]); 196| 31.4k| w0 = w1; 197| 31.4k| w1 = w2; 198| 31.4k| w2 = 0; 199| 31.4k| word3_muladd(&w2, &w1, &w0, ws[0], p[3]); 200| 31.4k| word3_muladd(&w2, &w1, &w0, ws[1], p[2]); 201| 31.4k| word3_muladd(&w2, &w1, &w0, ws[2], p[1]); 202| 31.4k| word3_add(&w2, &w1, &w0, z[3]); 203| 31.4k| ws[3] = w0 * p_dash; 204| 31.4k| word3_muladd(&w2, &w1, &w0, ws[3], p[0]); 205| 31.4k| w0 = w1; 206| 31.4k| w1 = w2; 207| 31.4k| w2 = 0; 208| 31.4k| word3_muladd(&w2, &w1, &w0, ws[0], p[4]); 209| 31.4k| word3_muladd(&w2, &w1, &w0, ws[1], p[3]); 210| 31.4k| word3_muladd(&w2, &w1, &w0, ws[2], p[2]); 211| 31.4k| word3_muladd(&w2, &w1, &w0, ws[3], p[1]); 212| 31.4k| word3_add(&w2, &w1, &w0, z[4]); 213| 31.4k| ws[4] = w0 * p_dash; 214| 31.4k| word3_muladd(&w2, &w1, &w0, ws[4], p[0]); 215| 31.4k| w0 = w1; 216| 31.4k| w1 = w2; 217| 31.4k| w2 = 0; 218| 31.4k| word3_muladd(&w2, &w1, &w0, ws[0], p[5]); 219| 31.4k| word3_muladd(&w2, &w1, &w0, ws[1], p[4]); 220| 31.4k| word3_muladd(&w2, &w1, &w0, ws[2], p[3]); 221| 31.4k| word3_muladd(&w2, &w1, &w0, ws[3], p[2]); 222| 31.4k| word3_muladd(&w2, &w1, &w0, ws[4], p[1]); 223| 31.4k| word3_add(&w2, &w1, &w0, z[5]); 224| 31.4k| ws[5] = w0 * p_dash; 225| 31.4k| word3_muladd(&w2, &w1, &w0, ws[5], p[0]); 226| 31.4k| w0 = w1; 227| 31.4k| w1 = w2; 228| 31.4k| w2 = 0; 229| 31.4k| word3_muladd(&w2, &w1, &w0, ws[0], p[6]); 230| 31.4k| word3_muladd(&w2, &w1, &w0, ws[1], p[5]); 231| 31.4k| word3_muladd(&w2, &w1, &w0, ws[2], p[4]); 232| 31.4k| word3_muladd(&w2, &w1, &w0, ws[3], p[3]); 233| 31.4k| word3_muladd(&w2, &w1, &w0, ws[4], p[2]); 234| 31.4k| word3_muladd(&w2, &w1, &w0, ws[5], p[1]); 235| 31.4k| word3_add(&w2, &w1, &w0, z[6]); 236| 31.4k| ws[6] = w0 * p_dash; 237| 31.4k| word3_muladd(&w2, &w1, &w0, ws[6], p[0]); 238| 31.4k| w0 = w1; 239| 31.4k| w1 = w2; 240| 31.4k| w2 = 0; 241| 31.4k| word3_muladd(&w2, &w1, &w0, ws[0], p[7]); 242| 31.4k| word3_muladd(&w2, &w1, &w0, ws[1], p[6]); 243| 31.4k| word3_muladd(&w2, &w1, &w0, ws[2], p[5]); 244| 31.4k| word3_muladd(&w2, &w1, &w0, ws[3], p[4]); 245| 31.4k| word3_muladd(&w2, &w1, &w0, ws[4], p[3]); 246| 31.4k| word3_muladd(&w2, &w1, &w0, ws[5], p[2]); 247| 31.4k| word3_muladd(&w2, &w1, &w0, ws[6], p[1]); 248| 31.4k| word3_add(&w2, &w1, &w0, z[7]); 249| 31.4k| ws[7] = w0 * p_dash; 250| 31.4k| word3_muladd(&w2, &w1, &w0, ws[7], p[0]); 251| 31.4k| w0 = w1; 252| 31.4k| w1 = w2; 253| 31.4k| w2 = 0; 254| 31.4k| word3_muladd(&w2, &w1, &w0, ws[1], p[7]); 255| 31.4k| word3_muladd(&w2, &w1, &w0, ws[2], p[6]); 256| 31.4k| word3_muladd(&w2, &w1, &w0, ws[3], p[5]); 257| 31.4k| word3_muladd(&w2, &w1, &w0, ws[4], p[4]); 258| 31.4k| word3_muladd(&w2, &w1, &w0, ws[5], p[3]); 259| 31.4k| word3_muladd(&w2, &w1, &w0, ws[6], p[2]); 260| 31.4k| word3_muladd(&w2, &w1, &w0, ws[7], p[1]); 261| 31.4k| word3_add(&w2, &w1, &w0, z[8]); 262| 31.4k| ws[0] = w0; 263| 31.4k| w0 = w1; 264| 31.4k| w1 = w2; 265| 31.4k| w2 = 0; 266| 31.4k| word3_muladd(&w2, &w1, &w0, ws[2], p[7]); 267| 31.4k| word3_muladd(&w2, &w1, &w0, ws[3], p[6]); 268| 31.4k| word3_muladd(&w2, &w1, &w0, ws[4], p[5]); 269| 31.4k| word3_muladd(&w2, &w1, &w0, ws[5], p[4]); 270| 31.4k| word3_muladd(&w2, &w1, &w0, ws[6], p[3]); 271| 31.4k| word3_muladd(&w2, &w1, &w0, ws[7], p[2]); 272| 31.4k| word3_add(&w2, &w1, &w0, z[9]); 273| 31.4k| ws[1] = w0; 274| 31.4k| w0 = w1; 275| 31.4k| w1 = w2; 276| 31.4k| w2 = 0; 277| 31.4k| word3_muladd(&w2, &w1, &w0, ws[3], p[7]); 278| 31.4k| word3_muladd(&w2, &w1, &w0, ws[4], p[6]); 279| 31.4k| word3_muladd(&w2, &w1, &w0, ws[5], p[5]); 280| 31.4k| word3_muladd(&w2, &w1, &w0, ws[6], p[4]); 281| 31.4k| word3_muladd(&w2, &w1, &w0, ws[7], p[3]); 282| 31.4k| word3_add(&w2, &w1, &w0, z[10]); 283| 31.4k| ws[2] = w0; 284| 31.4k| w0 = w1; 285| 31.4k| w1 = w2; 286| 31.4k| w2 = 0; 287| 31.4k| word3_muladd(&w2, &w1, &w0, ws[4], p[7]); 288| 31.4k| word3_muladd(&w2, &w1, &w0, ws[5], p[6]); 289| 31.4k| word3_muladd(&w2, &w1, &w0, ws[6], p[5]); 290| 31.4k| word3_muladd(&w2, &w1, &w0, ws[7], p[4]); 291| 31.4k| word3_add(&w2, &w1, &w0, z[11]); 292| 31.4k| ws[3] = w0; 293| 31.4k| w0 = w1; 294| 31.4k| w1 = w2; 295| 31.4k| w2 = 0; 296| 31.4k| word3_muladd(&w2, &w1, &w0, ws[5], p[7]); 297| 31.4k| word3_muladd(&w2, &w1, &w0, ws[6], p[6]); 298| 31.4k| word3_muladd(&w2, &w1, &w0, ws[7], p[5]); 299| 31.4k| word3_add(&w2, &w1, &w0, z[12]); 300| 31.4k| ws[4] = w0; 301| 31.4k| w0 = w1; 302| 31.4k| w1 = w2; 303| 31.4k| w2 = 0; 304| 31.4k| word3_muladd(&w2, &w1, &w0, ws[6], p[7]); 305| 31.4k| word3_muladd(&w2, &w1, &w0, ws[7], p[6]); 306| 31.4k| word3_add(&w2, &w1, &w0, z[13]); 307| 31.4k| ws[5] = w0; 308| 31.4k| w0 = w1; 309| 31.4k| w1 = w2; 310| 31.4k| w2 = 0; 311| 31.4k| word3_muladd(&w2, &w1, &w0, ws[7], p[7]); 312| 31.4k| word3_add(&w2, &w1, &w0, z[14]); 313| 31.4k| ws[6] = w0; 314| 31.4k| w0 = w1; 315| 31.4k| w1 = w2; 316| 31.4k| w2 = 0; 317| 31.4k| word3_add(&w2, &w1, &w0, z[15]); 318| 31.4k| ws[7] = w0; 319| 31.4k| ws[8] = w1; 320| 31.4k| word borrow = bigint_sub3(z, ws, 8 + 1, p, 8); 321| 31.4k| CT::conditional_assign_mem(borrow, z, ws, 8); 322| 31.4k| clear_mem(z + 8, 8); 323| 31.4k|} _ZN5Botan20bigint_monty_redc_16EPmPKmmS0_: 325| 1.27k|void bigint_monty_redc_16(word z[32], const word p[16], word p_dash, word ws[]) { 326| 1.27k| word w2 = 0, w1 = 0, w0 = 0; 327| 1.27k| w0 = z[0]; 328| 1.27k| ws[0] = w0 * p_dash; 329| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[0]); 330| 1.27k| w0 = w1; 331| 1.27k| w1 = w2; 332| 1.27k| w2 = 0; 333| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[1]); 334| 1.27k| word3_add(&w2, &w1, &w0, z[1]); 335| 1.27k| ws[1] = w0 * p_dash; 336| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[0]); 337| 1.27k| w0 = w1; 338| 1.27k| w1 = w2; 339| 1.27k| w2 = 0; 340| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[2]); 341| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[1]); 342| 1.27k| word3_add(&w2, &w1, &w0, z[2]); 343| 1.27k| ws[2] = w0 * p_dash; 344| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[0]); 345| 1.27k| w0 = w1; 346| 1.27k| w1 = w2; 347| 1.27k| w2 = 0; 348| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[3]); 349| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[2]); 350| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[1]); 351| 1.27k| word3_add(&w2, &w1, &w0, z[3]); 352| 1.27k| ws[3] = w0 * p_dash; 353| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[0]); 354| 1.27k| w0 = w1; 355| 1.27k| w1 = w2; 356| 1.27k| w2 = 0; 357| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[4]); 358| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[3]); 359| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[2]); 360| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[1]); 361| 1.27k| word3_add(&w2, &w1, &w0, z[4]); 362| 1.27k| ws[4] = w0 * p_dash; 363| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[0]); 364| 1.27k| w0 = w1; 365| 1.27k| w1 = w2; 366| 1.27k| w2 = 0; 367| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[5]); 368| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[4]); 369| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[3]); 370| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[2]); 371| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[1]); 372| 1.27k| word3_add(&w2, &w1, &w0, z[5]); 373| 1.27k| ws[5] = w0 * p_dash; 374| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[0]); 375| 1.27k| w0 = w1; 376| 1.27k| w1 = w2; 377| 1.27k| w2 = 0; 378| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[6]); 379| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[5]); 380| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[4]); 381| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[3]); 382| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[2]); 383| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[1]); 384| 1.27k| word3_add(&w2, &w1, &w0, z[6]); 385| 1.27k| ws[6] = w0 * p_dash; 386| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[0]); 387| 1.27k| w0 = w1; 388| 1.27k| w1 = w2; 389| 1.27k| w2 = 0; 390| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[7]); 391| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[6]); 392| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[5]); 393| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[4]); 394| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[3]); 395| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[2]); 396| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[1]); 397| 1.27k| word3_add(&w2, &w1, &w0, z[7]); 398| 1.27k| ws[7] = w0 * p_dash; 399| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[0]); 400| 1.27k| w0 = w1; 401| 1.27k| w1 = w2; 402| 1.27k| w2 = 0; 403| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[8]); 404| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[7]); 405| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[6]); 406| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[5]); 407| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[4]); 408| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[3]); 409| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[2]); 410| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[1]); 411| 1.27k| word3_add(&w2, &w1, &w0, z[8]); 412| 1.27k| ws[8] = w0 * p_dash; 413| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[0]); 414| 1.27k| w0 = w1; 415| 1.27k| w1 = w2; 416| 1.27k| w2 = 0; 417| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[9]); 418| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[8]); 419| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[7]); 420| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[6]); 421| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[5]); 422| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[4]); 423| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[3]); 424| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[2]); 425| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[1]); 426| 1.27k| word3_add(&w2, &w1, &w0, z[9]); 427| 1.27k| ws[9] = w0 * p_dash; 428| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[0]); 429| 1.27k| w0 = w1; 430| 1.27k| w1 = w2; 431| 1.27k| w2 = 0; 432| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[10]); 433| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[9]); 434| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[8]); 435| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[7]); 436| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[6]); 437| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[5]); 438| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[4]); 439| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[3]); 440| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[2]); 441| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[1]); 442| 1.27k| word3_add(&w2, &w1, &w0, z[10]); 443| 1.27k| ws[10] = w0 * p_dash; 444| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[0]); 445| 1.27k| w0 = w1; 446| 1.27k| w1 = w2; 447| 1.27k| w2 = 0; 448| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[11]); 449| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[10]); 450| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[9]); 451| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[8]); 452| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[7]); 453| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[6]); 454| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[5]); 455| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[4]); 456| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[3]); 457| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[2]); 458| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[1]); 459| 1.27k| word3_add(&w2, &w1, &w0, z[11]); 460| 1.27k| ws[11] = w0 * p_dash; 461| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[0]); 462| 1.27k| w0 = w1; 463| 1.27k| w1 = w2; 464| 1.27k| w2 = 0; 465| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[12]); 466| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[11]); 467| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[10]); 468| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[9]); 469| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[8]); 470| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[7]); 471| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[6]); 472| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[5]); 473| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[4]); 474| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[3]); 475| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[2]); 476| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[1]); 477| 1.27k| word3_add(&w2, &w1, &w0, z[12]); 478| 1.27k| ws[12] = w0 * p_dash; 479| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[0]); 480| 1.27k| w0 = w1; 481| 1.27k| w1 = w2; 482| 1.27k| w2 = 0; 483| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[13]); 484| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[12]); 485| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[11]); 486| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[10]); 487| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[9]); 488| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[8]); 489| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[7]); 490| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[6]); 491| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[5]); 492| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[4]); 493| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[3]); 494| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[2]); 495| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[1]); 496| 1.27k| word3_add(&w2, &w1, &w0, z[13]); 497| 1.27k| ws[13] = w0 * p_dash; 498| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[0]); 499| 1.27k| w0 = w1; 500| 1.27k| w1 = w2; 501| 1.27k| w2 = 0; 502| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[14]); 503| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[13]); 504| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[12]); 505| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[11]); 506| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[10]); 507| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[9]); 508| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[8]); 509| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[7]); 510| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[6]); 511| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[5]); 512| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[4]); 513| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[3]); 514| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[2]); 515| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[1]); 516| 1.27k| word3_add(&w2, &w1, &w0, z[14]); 517| 1.27k| ws[14] = w0 * p_dash; 518| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[0]); 519| 1.27k| w0 = w1; 520| 1.27k| w1 = w2; 521| 1.27k| w2 = 0; 522| 1.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[15]); 523| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[14]); 524| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[13]); 525| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[12]); 526| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[11]); 527| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[10]); 528| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[9]); 529| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[8]); 530| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[7]); 531| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[6]); 532| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[5]); 533| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[4]); 534| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[3]); 535| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[2]); 536| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[1]); 537| 1.27k| word3_add(&w2, &w1, &w0, z[15]); 538| 1.27k| ws[15] = w0 * p_dash; 539| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[0]); 540| 1.27k| w0 = w1; 541| 1.27k| w1 = w2; 542| 1.27k| w2 = 0; 543| 1.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[15]); 544| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[14]); 545| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[13]); 546| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[12]); 547| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[11]); 548| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[10]); 549| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[9]); 550| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[8]); 551| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[7]); 552| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[6]); 553| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[5]); 554| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[4]); 555| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[3]); 556| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[2]); 557| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[1]); 558| 1.27k| word3_add(&w2, &w1, &w0, z[16]); 559| 1.27k| ws[0] = w0; 560| 1.27k| w0 = w1; 561| 1.27k| w1 = w2; 562| 1.27k| w2 = 0; 563| 1.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[15]); 564| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[14]); 565| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[13]); 566| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[12]); 567| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[11]); 568| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[10]); 569| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[9]); 570| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[8]); 571| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[7]); 572| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[6]); 573| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[5]); 574| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[4]); 575| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[3]); 576| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[2]); 577| 1.27k| word3_add(&w2, &w1, &w0, z[17]); 578| 1.27k| ws[1] = w0; 579| 1.27k| w0 = w1; 580| 1.27k| w1 = w2; 581| 1.27k| w2 = 0; 582| 1.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[15]); 583| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[14]); 584| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[13]); 585| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[12]); 586| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[11]); 587| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[10]); 588| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[9]); 589| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[8]); 590| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[7]); 591| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[6]); 592| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[5]); 593| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[4]); 594| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[3]); 595| 1.27k| word3_add(&w2, &w1, &w0, z[18]); 596| 1.27k| ws[2] = w0; 597| 1.27k| w0 = w1; 598| 1.27k| w1 = w2; 599| 1.27k| w2 = 0; 600| 1.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[15]); 601| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[14]); 602| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[13]); 603| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[12]); 604| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[11]); 605| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[10]); 606| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[9]); 607| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[8]); 608| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[7]); 609| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[6]); 610| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[5]); 611| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[4]); 612| 1.27k| word3_add(&w2, &w1, &w0, z[19]); 613| 1.27k| ws[3] = w0; 614| 1.27k| w0 = w1; 615| 1.27k| w1 = w2; 616| 1.27k| w2 = 0; 617| 1.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[15]); 618| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[14]); 619| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[13]); 620| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[12]); 621| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[11]); 622| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[10]); 623| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[9]); 624| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[8]); 625| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[7]); 626| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[6]); 627| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[5]); 628| 1.27k| word3_add(&w2, &w1, &w0, z[20]); 629| 1.27k| ws[4] = w0; 630| 1.27k| w0 = w1; 631| 1.27k| w1 = w2; 632| 1.27k| w2 = 0; 633| 1.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[15]); 634| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[14]); 635| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[13]); 636| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[12]); 637| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[11]); 638| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[10]); 639| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[9]); 640| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[8]); 641| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[7]); 642| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[6]); 643| 1.27k| word3_add(&w2, &w1, &w0, z[21]); 644| 1.27k| ws[5] = w0; 645| 1.27k| w0 = w1; 646| 1.27k| w1 = w2; 647| 1.27k| w2 = 0; 648| 1.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[15]); 649| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[14]); 650| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[13]); 651| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[12]); 652| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[11]); 653| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[10]); 654| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[9]); 655| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[8]); 656| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[7]); 657| 1.27k| word3_add(&w2, &w1, &w0, z[22]); 658| 1.27k| ws[6] = w0; 659| 1.27k| w0 = w1; 660| 1.27k| w1 = w2; 661| 1.27k| w2 = 0; 662| 1.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[15]); 663| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[14]); 664| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[13]); 665| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[12]); 666| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[11]); 667| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[10]); 668| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[9]); 669| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[8]); 670| 1.27k| word3_add(&w2, &w1, &w0, z[23]); 671| 1.27k| ws[7] = w0; 672| 1.27k| w0 = w1; 673| 1.27k| w1 = w2; 674| 1.27k| w2 = 0; 675| 1.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[15]); 676| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[14]); 677| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[13]); 678| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[12]); 679| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[11]); 680| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[10]); 681| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[9]); 682| 1.27k| word3_add(&w2, &w1, &w0, z[24]); 683| 1.27k| ws[8] = w0; 684| 1.27k| w0 = w1; 685| 1.27k| w1 = w2; 686| 1.27k| w2 = 0; 687| 1.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[15]); 688| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[14]); 689| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[13]); 690| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[12]); 691| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[11]); 692| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[10]); 693| 1.27k| word3_add(&w2, &w1, &w0, z[25]); 694| 1.27k| ws[9] = w0; 695| 1.27k| w0 = w1; 696| 1.27k| w1 = w2; 697| 1.27k| w2 = 0; 698| 1.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[15]); 699| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[14]); 700| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[13]); 701| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[12]); 702| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[11]); 703| 1.27k| word3_add(&w2, &w1, &w0, z[26]); 704| 1.27k| ws[10] = w0; 705| 1.27k| w0 = w1; 706| 1.27k| w1 = w2; 707| 1.27k| w2 = 0; 708| 1.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[15]); 709| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[14]); 710| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[13]); 711| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[12]); 712| 1.27k| word3_add(&w2, &w1, &w0, z[27]); 713| 1.27k| ws[11] = w0; 714| 1.27k| w0 = w1; 715| 1.27k| w1 = w2; 716| 1.27k| w2 = 0; 717| 1.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[15]); 718| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[14]); 719| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[13]); 720| 1.27k| word3_add(&w2, &w1, &w0, z[28]); 721| 1.27k| ws[12] = w0; 722| 1.27k| w0 = w1; 723| 1.27k| w1 = w2; 724| 1.27k| w2 = 0; 725| 1.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[15]); 726| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[14]); 727| 1.27k| word3_add(&w2, &w1, &w0, z[29]); 728| 1.27k| ws[13] = w0; 729| 1.27k| w0 = w1; 730| 1.27k| w1 = w2; 731| 1.27k| w2 = 0; 732| 1.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[15]); 733| 1.27k| word3_add(&w2, &w1, &w0, z[30]); 734| 1.27k| ws[14] = w0; 735| 1.27k| w0 = w1; 736| 1.27k| w1 = w2; 737| 1.27k| w2 = 0; 738| 1.27k| word3_add(&w2, &w1, &w0, z[31]); 739| 1.27k| ws[15] = w0; 740| 1.27k| ws[16] = w1; 741| 1.27k| word borrow = bigint_sub3(z, ws, 16 + 1, p, 16); 742| 1.27k| CT::conditional_assign_mem(borrow, z, ws, 16); 743| 1.27k| clear_mem(z + 16, 16); 744| 1.27k|} _ZN5Botan20bigint_monty_redc_24EPmPKmmS0_: 746| 861|void bigint_monty_redc_24(word z[48], const word p[24], word p_dash, word ws[]) { 747| 861| word w2 = 0, w1 = 0, w0 = 0; 748| 861| w0 = z[0]; 749| 861| ws[0] = w0 * p_dash; 750| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[0]); 751| 861| w0 = w1; 752| 861| w1 = w2; 753| 861| w2 = 0; 754| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[1]); 755| 861| word3_add(&w2, &w1, &w0, z[1]); 756| 861| ws[1] = w0 * p_dash; 757| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[0]); 758| 861| w0 = w1; 759| 861| w1 = w2; 760| 861| w2 = 0; 761| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[2]); 762| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[1]); 763| 861| word3_add(&w2, &w1, &w0, z[2]); 764| 861| ws[2] = w0 * p_dash; 765| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[0]); 766| 861| w0 = w1; 767| 861| w1 = w2; 768| 861| w2 = 0; 769| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[3]); 770| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[2]); 771| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[1]); 772| 861| word3_add(&w2, &w1, &w0, z[3]); 773| 861| ws[3] = w0 * p_dash; 774| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[0]); 775| 861| w0 = w1; 776| 861| w1 = w2; 777| 861| w2 = 0; 778| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[4]); 779| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[3]); 780| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[2]); 781| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[1]); 782| 861| word3_add(&w2, &w1, &w0, z[4]); 783| 861| ws[4] = w0 * p_dash; 784| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[0]); 785| 861| w0 = w1; 786| 861| w1 = w2; 787| 861| w2 = 0; 788| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[5]); 789| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[4]); 790| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[3]); 791| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[2]); 792| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[1]); 793| 861| word3_add(&w2, &w1, &w0, z[5]); 794| 861| ws[5] = w0 * p_dash; 795| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[0]); 796| 861| w0 = w1; 797| 861| w1 = w2; 798| 861| w2 = 0; 799| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[6]); 800| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[5]); 801| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[4]); 802| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[3]); 803| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[2]); 804| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[1]); 805| 861| word3_add(&w2, &w1, &w0, z[6]); 806| 861| ws[6] = w0 * p_dash; 807| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[0]); 808| 861| w0 = w1; 809| 861| w1 = w2; 810| 861| w2 = 0; 811| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[7]); 812| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[6]); 813| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[5]); 814| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[4]); 815| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[3]); 816| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[2]); 817| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[1]); 818| 861| word3_add(&w2, &w1, &w0, z[7]); 819| 861| ws[7] = w0 * p_dash; 820| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[0]); 821| 861| w0 = w1; 822| 861| w1 = w2; 823| 861| w2 = 0; 824| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[8]); 825| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[7]); 826| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[6]); 827| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[5]); 828| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[4]); 829| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[3]); 830| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[2]); 831| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[1]); 832| 861| word3_add(&w2, &w1, &w0, z[8]); 833| 861| ws[8] = w0 * p_dash; 834| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[0]); 835| 861| w0 = w1; 836| 861| w1 = w2; 837| 861| w2 = 0; 838| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[9]); 839| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[8]); 840| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[7]); 841| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[6]); 842| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[5]); 843| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[4]); 844| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[3]); 845| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[2]); 846| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[1]); 847| 861| word3_add(&w2, &w1, &w0, z[9]); 848| 861| ws[9] = w0 * p_dash; 849| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[0]); 850| 861| w0 = w1; 851| 861| w1 = w2; 852| 861| w2 = 0; 853| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[10]); 854| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[9]); 855| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[8]); 856| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[7]); 857| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[6]); 858| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[5]); 859| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[4]); 860| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[3]); 861| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[2]); 862| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[1]); 863| 861| word3_add(&w2, &w1, &w0, z[10]); 864| 861| ws[10] = w0 * p_dash; 865| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[0]); 866| 861| w0 = w1; 867| 861| w1 = w2; 868| 861| w2 = 0; 869| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[11]); 870| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[10]); 871| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[9]); 872| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[8]); 873| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[7]); 874| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[6]); 875| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[5]); 876| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[4]); 877| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[3]); 878| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[2]); 879| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[1]); 880| 861| word3_add(&w2, &w1, &w0, z[11]); 881| 861| ws[11] = w0 * p_dash; 882| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[0]); 883| 861| w0 = w1; 884| 861| w1 = w2; 885| 861| w2 = 0; 886| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[12]); 887| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[11]); 888| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[10]); 889| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[9]); 890| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[8]); 891| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[7]); 892| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[6]); 893| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[5]); 894| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[4]); 895| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[3]); 896| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[2]); 897| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[1]); 898| 861| word3_add(&w2, &w1, &w0, z[12]); 899| 861| ws[12] = w0 * p_dash; 900| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[0]); 901| 861| w0 = w1; 902| 861| w1 = w2; 903| 861| w2 = 0; 904| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[13]); 905| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[12]); 906| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[11]); 907| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[10]); 908| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[9]); 909| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[8]); 910| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[7]); 911| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[6]); 912| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[5]); 913| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[4]); 914| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[3]); 915| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[2]); 916| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[1]); 917| 861| word3_add(&w2, &w1, &w0, z[13]); 918| 861| ws[13] = w0 * p_dash; 919| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[0]); 920| 861| w0 = w1; 921| 861| w1 = w2; 922| 861| w2 = 0; 923| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[14]); 924| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[13]); 925| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[12]); 926| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[11]); 927| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[10]); 928| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[9]); 929| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[8]); 930| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[7]); 931| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[6]); 932| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[5]); 933| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[4]); 934| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[3]); 935| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[2]); 936| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[1]); 937| 861| word3_add(&w2, &w1, &w0, z[14]); 938| 861| ws[14] = w0 * p_dash; 939| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[0]); 940| 861| w0 = w1; 941| 861| w1 = w2; 942| 861| w2 = 0; 943| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[15]); 944| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[14]); 945| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[13]); 946| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[12]); 947| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[11]); 948| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[10]); 949| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[9]); 950| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[8]); 951| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[7]); 952| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[6]); 953| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[5]); 954| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[4]); 955| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[3]); 956| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[2]); 957| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[1]); 958| 861| word3_add(&w2, &w1, &w0, z[15]); 959| 861| ws[15] = w0 * p_dash; 960| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[0]); 961| 861| w0 = w1; 962| 861| w1 = w2; 963| 861| w2 = 0; 964| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[16]); 965| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[15]); 966| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[14]); 967| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[13]); 968| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[12]); 969| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[11]); 970| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[10]); 971| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[9]); 972| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[8]); 973| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[7]); 974| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[6]); 975| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[5]); 976| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[4]); 977| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[3]); 978| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[2]); 979| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[1]); 980| 861| word3_add(&w2, &w1, &w0, z[16]); 981| 861| ws[16] = w0 * p_dash; 982| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[0]); 983| 861| w0 = w1; 984| 861| w1 = w2; 985| 861| w2 = 0; 986| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[17]); 987| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[16]); 988| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[15]); 989| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[14]); 990| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[13]); 991| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[12]); 992| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[11]); 993| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[10]); 994| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[9]); 995| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[8]); 996| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[7]); 997| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[6]); 998| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[5]); 999| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[4]); 1000| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[3]); 1001| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[2]); 1002| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[1]); 1003| 861| word3_add(&w2, &w1, &w0, z[17]); 1004| 861| ws[17] = w0 * p_dash; 1005| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[0]); 1006| 861| w0 = w1; 1007| 861| w1 = w2; 1008| 861| w2 = 0; 1009| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[18]); 1010| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[17]); 1011| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[16]); 1012| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[15]); 1013| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[14]); 1014| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[13]); 1015| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[12]); 1016| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[11]); 1017| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[10]); 1018| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[9]); 1019| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[8]); 1020| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[7]); 1021| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[6]); 1022| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[5]); 1023| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[4]); 1024| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[3]); 1025| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[2]); 1026| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[1]); 1027| 861| word3_add(&w2, &w1, &w0, z[18]); 1028| 861| ws[18] = w0 * p_dash; 1029| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[0]); 1030| 861| w0 = w1; 1031| 861| w1 = w2; 1032| 861| w2 = 0; 1033| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[19]); 1034| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[18]); 1035| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[17]); 1036| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[16]); 1037| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[15]); 1038| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[14]); 1039| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[13]); 1040| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[12]); 1041| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[11]); 1042| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[10]); 1043| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[9]); 1044| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[8]); 1045| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[7]); 1046| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[6]); 1047| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[5]); 1048| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[4]); 1049| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[3]); 1050| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[2]); 1051| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[1]); 1052| 861| word3_add(&w2, &w1, &w0, z[19]); 1053| 861| ws[19] = w0 * p_dash; 1054| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[0]); 1055| 861| w0 = w1; 1056| 861| w1 = w2; 1057| 861| w2 = 0; 1058| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[20]); 1059| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[19]); 1060| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[18]); 1061| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[17]); 1062| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[16]); 1063| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[15]); 1064| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[14]); 1065| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[13]); 1066| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[12]); 1067| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[11]); 1068| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[10]); 1069| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[9]); 1070| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[8]); 1071| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[7]); 1072| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[6]); 1073| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[5]); 1074| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[4]); 1075| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[3]); 1076| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[2]); 1077| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[1]); 1078| 861| word3_add(&w2, &w1, &w0, z[20]); 1079| 861| ws[20] = w0 * p_dash; 1080| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[0]); 1081| 861| w0 = w1; 1082| 861| w1 = w2; 1083| 861| w2 = 0; 1084| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[21]); 1085| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[20]); 1086| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[19]); 1087| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[18]); 1088| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[17]); 1089| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[16]); 1090| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[15]); 1091| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[14]); 1092| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[13]); 1093| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[12]); 1094| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[11]); 1095| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[10]); 1096| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[9]); 1097| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[8]); 1098| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[7]); 1099| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[6]); 1100| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[5]); 1101| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[4]); 1102| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[3]); 1103| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[2]); 1104| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[1]); 1105| 861| word3_add(&w2, &w1, &w0, z[21]); 1106| 861| ws[21] = w0 * p_dash; 1107| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[0]); 1108| 861| w0 = w1; 1109| 861| w1 = w2; 1110| 861| w2 = 0; 1111| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[22]); 1112| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[21]); 1113| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[20]); 1114| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[19]); 1115| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[18]); 1116| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[17]); 1117| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[16]); 1118| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[15]); 1119| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[14]); 1120| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[13]); 1121| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[12]); 1122| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[11]); 1123| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[10]); 1124| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[9]); 1125| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[8]); 1126| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[7]); 1127| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[6]); 1128| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[5]); 1129| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[4]); 1130| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[3]); 1131| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[2]); 1132| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[1]); 1133| 861| word3_add(&w2, &w1, &w0, z[22]); 1134| 861| ws[22] = w0 * p_dash; 1135| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[0]); 1136| 861| w0 = w1; 1137| 861| w1 = w2; 1138| 861| w2 = 0; 1139| 861| word3_muladd(&w2, &w1, &w0, ws[0], p[23]); 1140| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[22]); 1141| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[21]); 1142| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[20]); 1143| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[19]); 1144| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[18]); 1145| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[17]); 1146| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[16]); 1147| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[15]); 1148| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[14]); 1149| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[13]); 1150| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[12]); 1151| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[11]); 1152| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[10]); 1153| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[9]); 1154| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[8]); 1155| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[7]); 1156| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[6]); 1157| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[5]); 1158| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[4]); 1159| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[3]); 1160| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[2]); 1161| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[1]); 1162| 861| word3_add(&w2, &w1, &w0, z[23]); 1163| 861| ws[23] = w0 * p_dash; 1164| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[0]); 1165| 861| w0 = w1; 1166| 861| w1 = w2; 1167| 861| w2 = 0; 1168| 861| word3_muladd(&w2, &w1, &w0, ws[1], p[23]); 1169| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[22]); 1170| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[21]); 1171| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[20]); 1172| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[19]); 1173| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[18]); 1174| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[17]); 1175| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[16]); 1176| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[15]); 1177| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[14]); 1178| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[13]); 1179| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[12]); 1180| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[11]); 1181| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[10]); 1182| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[9]); 1183| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[8]); 1184| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[7]); 1185| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[6]); 1186| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[5]); 1187| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[4]); 1188| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[3]); 1189| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[2]); 1190| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[1]); 1191| 861| word3_add(&w2, &w1, &w0, z[24]); 1192| 861| ws[0] = w0; 1193| 861| w0 = w1; 1194| 861| w1 = w2; 1195| 861| w2 = 0; 1196| 861| word3_muladd(&w2, &w1, &w0, ws[2], p[23]); 1197| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[22]); 1198| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[21]); 1199| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[20]); 1200| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[19]); 1201| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[18]); 1202| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[17]); 1203| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[16]); 1204| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[15]); 1205| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[14]); 1206| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[13]); 1207| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[12]); 1208| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[11]); 1209| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[10]); 1210| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[9]); 1211| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[8]); 1212| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[7]); 1213| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[6]); 1214| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[5]); 1215| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[4]); 1216| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[3]); 1217| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[2]); 1218| 861| word3_add(&w2, &w1, &w0, z[25]); 1219| 861| ws[1] = w0; 1220| 861| w0 = w1; 1221| 861| w1 = w2; 1222| 861| w2 = 0; 1223| 861| word3_muladd(&w2, &w1, &w0, ws[3], p[23]); 1224| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[22]); 1225| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[21]); 1226| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[20]); 1227| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[19]); 1228| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[18]); 1229| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[17]); 1230| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[16]); 1231| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[15]); 1232| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[14]); 1233| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[13]); 1234| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[12]); 1235| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[11]); 1236| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[10]); 1237| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[9]); 1238| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[8]); 1239| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[7]); 1240| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[6]); 1241| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[5]); 1242| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[4]); 1243| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[3]); 1244| 861| word3_add(&w2, &w1, &w0, z[26]); 1245| 861| ws[2] = w0; 1246| 861| w0 = w1; 1247| 861| w1 = w2; 1248| 861| w2 = 0; 1249| 861| word3_muladd(&w2, &w1, &w0, ws[4], p[23]); 1250| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[22]); 1251| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[21]); 1252| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[20]); 1253| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[19]); 1254| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[18]); 1255| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[17]); 1256| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[16]); 1257| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[15]); 1258| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[14]); 1259| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[13]); 1260| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[12]); 1261| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[11]); 1262| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[10]); 1263| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[9]); 1264| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[8]); 1265| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[7]); 1266| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[6]); 1267| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[5]); 1268| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[4]); 1269| 861| word3_add(&w2, &w1, &w0, z[27]); 1270| 861| ws[3] = w0; 1271| 861| w0 = w1; 1272| 861| w1 = w2; 1273| 861| w2 = 0; 1274| 861| word3_muladd(&w2, &w1, &w0, ws[5], p[23]); 1275| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[22]); 1276| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[21]); 1277| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[20]); 1278| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[19]); 1279| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[18]); 1280| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[17]); 1281| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[16]); 1282| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[15]); 1283| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[14]); 1284| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[13]); 1285| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[12]); 1286| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[11]); 1287| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[10]); 1288| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[9]); 1289| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[8]); 1290| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[7]); 1291| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[6]); 1292| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[5]); 1293| 861| word3_add(&w2, &w1, &w0, z[28]); 1294| 861| ws[4] = w0; 1295| 861| w0 = w1; 1296| 861| w1 = w2; 1297| 861| w2 = 0; 1298| 861| word3_muladd(&w2, &w1, &w0, ws[6], p[23]); 1299| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[22]); 1300| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[21]); 1301| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[20]); 1302| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[19]); 1303| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[18]); 1304| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[17]); 1305| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[16]); 1306| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[15]); 1307| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[14]); 1308| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[13]); 1309| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[12]); 1310| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[11]); 1311| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[10]); 1312| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[9]); 1313| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[8]); 1314| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[7]); 1315| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[6]); 1316| 861| word3_add(&w2, &w1, &w0, z[29]); 1317| 861| ws[5] = w0; 1318| 861| w0 = w1; 1319| 861| w1 = w2; 1320| 861| w2 = 0; 1321| 861| word3_muladd(&w2, &w1, &w0, ws[7], p[23]); 1322| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[22]); 1323| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[21]); 1324| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[20]); 1325| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[19]); 1326| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[18]); 1327| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[17]); 1328| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[16]); 1329| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[15]); 1330| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[14]); 1331| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[13]); 1332| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[12]); 1333| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[11]); 1334| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[10]); 1335| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[9]); 1336| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[8]); 1337| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[7]); 1338| 861| word3_add(&w2, &w1, &w0, z[30]); 1339| 861| ws[6] = w0; 1340| 861| w0 = w1; 1341| 861| w1 = w2; 1342| 861| w2 = 0; 1343| 861| word3_muladd(&w2, &w1, &w0, ws[8], p[23]); 1344| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[22]); 1345| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[21]); 1346| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[20]); 1347| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[19]); 1348| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[18]); 1349| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[17]); 1350| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[16]); 1351| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[15]); 1352| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[14]); 1353| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[13]); 1354| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[12]); 1355| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[11]); 1356| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[10]); 1357| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[9]); 1358| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[8]); 1359| 861| word3_add(&w2, &w1, &w0, z[31]); 1360| 861| ws[7] = w0; 1361| 861| w0 = w1; 1362| 861| w1 = w2; 1363| 861| w2 = 0; 1364| 861| word3_muladd(&w2, &w1, &w0, ws[9], p[23]); 1365| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[22]); 1366| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[21]); 1367| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[20]); 1368| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[19]); 1369| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[18]); 1370| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[17]); 1371| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[16]); 1372| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[15]); 1373| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[14]); 1374| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[13]); 1375| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[12]); 1376| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[11]); 1377| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[10]); 1378| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[9]); 1379| 861| word3_add(&w2, &w1, &w0, z[32]); 1380| 861| ws[8] = w0; 1381| 861| w0 = w1; 1382| 861| w1 = w2; 1383| 861| w2 = 0; 1384| 861| word3_muladd(&w2, &w1, &w0, ws[10], p[23]); 1385| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[22]); 1386| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[21]); 1387| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[20]); 1388| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[19]); 1389| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[18]); 1390| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[17]); 1391| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[16]); 1392| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[15]); 1393| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[14]); 1394| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[13]); 1395| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[12]); 1396| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[11]); 1397| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[10]); 1398| 861| word3_add(&w2, &w1, &w0, z[33]); 1399| 861| ws[9] = w0; 1400| 861| w0 = w1; 1401| 861| w1 = w2; 1402| 861| w2 = 0; 1403| 861| word3_muladd(&w2, &w1, &w0, ws[11], p[23]); 1404| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[22]); 1405| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[21]); 1406| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[20]); 1407| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[19]); 1408| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[18]); 1409| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[17]); 1410| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[16]); 1411| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[15]); 1412| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[14]); 1413| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[13]); 1414| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[12]); 1415| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[11]); 1416| 861| word3_add(&w2, &w1, &w0, z[34]); 1417| 861| ws[10] = w0; 1418| 861| w0 = w1; 1419| 861| w1 = w2; 1420| 861| w2 = 0; 1421| 861| word3_muladd(&w2, &w1, &w0, ws[12], p[23]); 1422| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[22]); 1423| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[21]); 1424| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[20]); 1425| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[19]); 1426| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[18]); 1427| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[17]); 1428| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[16]); 1429| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[15]); 1430| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[14]); 1431| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[13]); 1432| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[12]); 1433| 861| word3_add(&w2, &w1, &w0, z[35]); 1434| 861| ws[11] = w0; 1435| 861| w0 = w1; 1436| 861| w1 = w2; 1437| 861| w2 = 0; 1438| 861| word3_muladd(&w2, &w1, &w0, ws[13], p[23]); 1439| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[22]); 1440| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[21]); 1441| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[20]); 1442| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[19]); 1443| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[18]); 1444| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[17]); 1445| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[16]); 1446| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[15]); 1447| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[14]); 1448| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[13]); 1449| 861| word3_add(&w2, &w1, &w0, z[36]); 1450| 861| ws[12] = w0; 1451| 861| w0 = w1; 1452| 861| w1 = w2; 1453| 861| w2 = 0; 1454| 861| word3_muladd(&w2, &w1, &w0, ws[14], p[23]); 1455| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[22]); 1456| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[21]); 1457| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[20]); 1458| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[19]); 1459| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[18]); 1460| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[17]); 1461| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[16]); 1462| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[15]); 1463| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[14]); 1464| 861| word3_add(&w2, &w1, &w0, z[37]); 1465| 861| ws[13] = w0; 1466| 861| w0 = w1; 1467| 861| w1 = w2; 1468| 861| w2 = 0; 1469| 861| word3_muladd(&w2, &w1, &w0, ws[15], p[23]); 1470| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[22]); 1471| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[21]); 1472| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[20]); 1473| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[19]); 1474| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[18]); 1475| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[17]); 1476| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[16]); 1477| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[15]); 1478| 861| word3_add(&w2, &w1, &w0, z[38]); 1479| 861| ws[14] = w0; 1480| 861| w0 = w1; 1481| 861| w1 = w2; 1482| 861| w2 = 0; 1483| 861| word3_muladd(&w2, &w1, &w0, ws[16], p[23]); 1484| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[22]); 1485| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[21]); 1486| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[20]); 1487| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[19]); 1488| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[18]); 1489| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[17]); 1490| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[16]); 1491| 861| word3_add(&w2, &w1, &w0, z[39]); 1492| 861| ws[15] = w0; 1493| 861| w0 = w1; 1494| 861| w1 = w2; 1495| 861| w2 = 0; 1496| 861| word3_muladd(&w2, &w1, &w0, ws[17], p[23]); 1497| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[22]); 1498| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[21]); 1499| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[20]); 1500| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[19]); 1501| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[18]); 1502| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[17]); 1503| 861| word3_add(&w2, &w1, &w0, z[40]); 1504| 861| ws[16] = w0; 1505| 861| w0 = w1; 1506| 861| w1 = w2; 1507| 861| w2 = 0; 1508| 861| word3_muladd(&w2, &w1, &w0, ws[18], p[23]); 1509| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[22]); 1510| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[21]); 1511| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[20]); 1512| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[19]); 1513| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[18]); 1514| 861| word3_add(&w2, &w1, &w0, z[41]); 1515| 861| ws[17] = w0; 1516| 861| w0 = w1; 1517| 861| w1 = w2; 1518| 861| w2 = 0; 1519| 861| word3_muladd(&w2, &w1, &w0, ws[19], p[23]); 1520| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[22]); 1521| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[21]); 1522| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[20]); 1523| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[19]); 1524| 861| word3_add(&w2, &w1, &w0, z[42]); 1525| 861| ws[18] = w0; 1526| 861| w0 = w1; 1527| 861| w1 = w2; 1528| 861| w2 = 0; 1529| 861| word3_muladd(&w2, &w1, &w0, ws[20], p[23]); 1530| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[22]); 1531| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[21]); 1532| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[20]); 1533| 861| word3_add(&w2, &w1, &w0, z[43]); 1534| 861| ws[19] = w0; 1535| 861| w0 = w1; 1536| 861| w1 = w2; 1537| 861| w2 = 0; 1538| 861| word3_muladd(&w2, &w1, &w0, ws[21], p[23]); 1539| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[22]); 1540| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[21]); 1541| 861| word3_add(&w2, &w1, &w0, z[44]); 1542| 861| ws[20] = w0; 1543| 861| w0 = w1; 1544| 861| w1 = w2; 1545| 861| w2 = 0; 1546| 861| word3_muladd(&w2, &w1, &w0, ws[22], p[23]); 1547| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[22]); 1548| 861| word3_add(&w2, &w1, &w0, z[45]); 1549| 861| ws[21] = w0; 1550| 861| w0 = w1; 1551| 861| w1 = w2; 1552| 861| w2 = 0; 1553| 861| word3_muladd(&w2, &w1, &w0, ws[23], p[23]); 1554| 861| word3_add(&w2, &w1, &w0, z[46]); 1555| 861| ws[22] = w0; 1556| 861| w0 = w1; 1557| 861| w1 = w2; 1558| 861| w2 = 0; 1559| 861| word3_add(&w2, &w1, &w0, z[47]); 1560| 861| ws[23] = w0; 1561| 861| ws[24] = w1; 1562| 861| word borrow = bigint_sub3(z, ws, 24 + 1, p, 24); 1563| 861| CT::conditional_assign_mem(borrow, z, ws, 24); 1564| 861| clear_mem(z + 24, 24); 1565| 861|} _ZN5Botan20bigint_monty_redc_32EPmPKmmS0_: 1567| 3.27k|void bigint_monty_redc_32(word z[64], const word p[32], word p_dash, word ws[]) { 1568| 3.27k| word w2 = 0, w1 = 0, w0 = 0; 1569| 3.27k| w0 = z[0]; 1570| 3.27k| ws[0] = w0 * p_dash; 1571| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[0]); 1572| 3.27k| w0 = w1; 1573| 3.27k| w1 = w2; 1574| 3.27k| w2 = 0; 1575| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[1]); 1576| 3.27k| word3_add(&w2, &w1, &w0, z[1]); 1577| 3.27k| ws[1] = w0 * p_dash; 1578| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[0]); 1579| 3.27k| w0 = w1; 1580| 3.27k| w1 = w2; 1581| 3.27k| w2 = 0; 1582| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[2]); 1583| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[1]); 1584| 3.27k| word3_add(&w2, &w1, &w0, z[2]); 1585| 3.27k| ws[2] = w0 * p_dash; 1586| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[0]); 1587| 3.27k| w0 = w1; 1588| 3.27k| w1 = w2; 1589| 3.27k| w2 = 0; 1590| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[3]); 1591| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[2]); 1592| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[1]); 1593| 3.27k| word3_add(&w2, &w1, &w0, z[3]); 1594| 3.27k| ws[3] = w0 * p_dash; 1595| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[0]); 1596| 3.27k| w0 = w1; 1597| 3.27k| w1 = w2; 1598| 3.27k| w2 = 0; 1599| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[4]); 1600| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[3]); 1601| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[2]); 1602| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[1]); 1603| 3.27k| word3_add(&w2, &w1, &w0, z[4]); 1604| 3.27k| ws[4] = w0 * p_dash; 1605| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[0]); 1606| 3.27k| w0 = w1; 1607| 3.27k| w1 = w2; 1608| 3.27k| w2 = 0; 1609| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[5]); 1610| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[4]); 1611| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[3]); 1612| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[2]); 1613| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[1]); 1614| 3.27k| word3_add(&w2, &w1, &w0, z[5]); 1615| 3.27k| ws[5] = w0 * p_dash; 1616| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[0]); 1617| 3.27k| w0 = w1; 1618| 3.27k| w1 = w2; 1619| 3.27k| w2 = 0; 1620| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[6]); 1621| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[5]); 1622| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[4]); 1623| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[3]); 1624| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[2]); 1625| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[1]); 1626| 3.27k| word3_add(&w2, &w1, &w0, z[6]); 1627| 3.27k| ws[6] = w0 * p_dash; 1628| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[0]); 1629| 3.27k| w0 = w1; 1630| 3.27k| w1 = w2; 1631| 3.27k| w2 = 0; 1632| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[7]); 1633| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[6]); 1634| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[5]); 1635| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[4]); 1636| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[3]); 1637| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[2]); 1638| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[1]); 1639| 3.27k| word3_add(&w2, &w1, &w0, z[7]); 1640| 3.27k| ws[7] = w0 * p_dash; 1641| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[0]); 1642| 3.27k| w0 = w1; 1643| 3.27k| w1 = w2; 1644| 3.27k| w2 = 0; 1645| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[8]); 1646| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[7]); 1647| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[6]); 1648| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[5]); 1649| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[4]); 1650| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[3]); 1651| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[2]); 1652| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[1]); 1653| 3.27k| word3_add(&w2, &w1, &w0, z[8]); 1654| 3.27k| ws[8] = w0 * p_dash; 1655| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[0]); 1656| 3.27k| w0 = w1; 1657| 3.27k| w1 = w2; 1658| 3.27k| w2 = 0; 1659| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[9]); 1660| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[8]); 1661| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[7]); 1662| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[6]); 1663| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[5]); 1664| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[4]); 1665| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[3]); 1666| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[2]); 1667| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[1]); 1668| 3.27k| word3_add(&w2, &w1, &w0, z[9]); 1669| 3.27k| ws[9] = w0 * p_dash; 1670| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[0]); 1671| 3.27k| w0 = w1; 1672| 3.27k| w1 = w2; 1673| 3.27k| w2 = 0; 1674| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[10]); 1675| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[9]); 1676| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[8]); 1677| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[7]); 1678| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[6]); 1679| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[5]); 1680| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[4]); 1681| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[3]); 1682| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[2]); 1683| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[1]); 1684| 3.27k| word3_add(&w2, &w1, &w0, z[10]); 1685| 3.27k| ws[10] = w0 * p_dash; 1686| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[0]); 1687| 3.27k| w0 = w1; 1688| 3.27k| w1 = w2; 1689| 3.27k| w2 = 0; 1690| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[11]); 1691| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[10]); 1692| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[9]); 1693| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[8]); 1694| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[7]); 1695| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[6]); 1696| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[5]); 1697| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[4]); 1698| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[3]); 1699| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[2]); 1700| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[1]); 1701| 3.27k| word3_add(&w2, &w1, &w0, z[11]); 1702| 3.27k| ws[11] = w0 * p_dash; 1703| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[0]); 1704| 3.27k| w0 = w1; 1705| 3.27k| w1 = w2; 1706| 3.27k| w2 = 0; 1707| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[12]); 1708| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[11]); 1709| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[10]); 1710| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[9]); 1711| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[8]); 1712| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[7]); 1713| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[6]); 1714| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[5]); 1715| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[4]); 1716| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[3]); 1717| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[2]); 1718| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[1]); 1719| 3.27k| word3_add(&w2, &w1, &w0, z[12]); 1720| 3.27k| ws[12] = w0 * p_dash; 1721| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[0]); 1722| 3.27k| w0 = w1; 1723| 3.27k| w1 = w2; 1724| 3.27k| w2 = 0; 1725| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[13]); 1726| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[12]); 1727| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[11]); 1728| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[10]); 1729| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[9]); 1730| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[8]); 1731| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[7]); 1732| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[6]); 1733| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[5]); 1734| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[4]); 1735| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[3]); 1736| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[2]); 1737| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[1]); 1738| 3.27k| word3_add(&w2, &w1, &w0, z[13]); 1739| 3.27k| ws[13] = w0 * p_dash; 1740| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[0]); 1741| 3.27k| w0 = w1; 1742| 3.27k| w1 = w2; 1743| 3.27k| w2 = 0; 1744| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[14]); 1745| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[13]); 1746| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[12]); 1747| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[11]); 1748| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[10]); 1749| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[9]); 1750| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[8]); 1751| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[7]); 1752| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[6]); 1753| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[5]); 1754| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[4]); 1755| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[3]); 1756| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[2]); 1757| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[1]); 1758| 3.27k| word3_add(&w2, &w1, &w0, z[14]); 1759| 3.27k| ws[14] = w0 * p_dash; 1760| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[0]); 1761| 3.27k| w0 = w1; 1762| 3.27k| w1 = w2; 1763| 3.27k| w2 = 0; 1764| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[15]); 1765| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[14]); 1766| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[13]); 1767| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[12]); 1768| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[11]); 1769| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[10]); 1770| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[9]); 1771| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[8]); 1772| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[7]); 1773| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[6]); 1774| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[5]); 1775| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[4]); 1776| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[3]); 1777| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[2]); 1778| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[1]); 1779| 3.27k| word3_add(&w2, &w1, &w0, z[15]); 1780| 3.27k| ws[15] = w0 * p_dash; 1781| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[0]); 1782| 3.27k| w0 = w1; 1783| 3.27k| w1 = w2; 1784| 3.27k| w2 = 0; 1785| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[16]); 1786| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[15]); 1787| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[14]); 1788| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[13]); 1789| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[12]); 1790| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[11]); 1791| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[10]); 1792| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[9]); 1793| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[8]); 1794| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[7]); 1795| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[6]); 1796| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[5]); 1797| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[4]); 1798| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[3]); 1799| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[2]); 1800| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[1]); 1801| 3.27k| word3_add(&w2, &w1, &w0, z[16]); 1802| 3.27k| ws[16] = w0 * p_dash; 1803| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[0]); 1804| 3.27k| w0 = w1; 1805| 3.27k| w1 = w2; 1806| 3.27k| w2 = 0; 1807| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[17]); 1808| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[16]); 1809| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[15]); 1810| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[14]); 1811| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[13]); 1812| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[12]); 1813| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[11]); 1814| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[10]); 1815| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[9]); 1816| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[8]); 1817| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[7]); 1818| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[6]); 1819| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[5]); 1820| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[4]); 1821| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[3]); 1822| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[2]); 1823| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[1]); 1824| 3.27k| word3_add(&w2, &w1, &w0, z[17]); 1825| 3.27k| ws[17] = w0 * p_dash; 1826| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[0]); 1827| 3.27k| w0 = w1; 1828| 3.27k| w1 = w2; 1829| 3.27k| w2 = 0; 1830| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[18]); 1831| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[17]); 1832| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[16]); 1833| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[15]); 1834| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[14]); 1835| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[13]); 1836| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[12]); 1837| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[11]); 1838| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[10]); 1839| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[9]); 1840| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[8]); 1841| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[7]); 1842| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[6]); 1843| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[5]); 1844| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[4]); 1845| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[3]); 1846| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[2]); 1847| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[1]); 1848| 3.27k| word3_add(&w2, &w1, &w0, z[18]); 1849| 3.27k| ws[18] = w0 * p_dash; 1850| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[0]); 1851| 3.27k| w0 = w1; 1852| 3.27k| w1 = w2; 1853| 3.27k| w2 = 0; 1854| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[19]); 1855| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[18]); 1856| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[17]); 1857| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[16]); 1858| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[15]); 1859| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[14]); 1860| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[13]); 1861| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[12]); 1862| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[11]); 1863| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[10]); 1864| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[9]); 1865| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[8]); 1866| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[7]); 1867| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[6]); 1868| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[5]); 1869| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[4]); 1870| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[3]); 1871| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[2]); 1872| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[1]); 1873| 3.27k| word3_add(&w2, &w1, &w0, z[19]); 1874| 3.27k| ws[19] = w0 * p_dash; 1875| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[0]); 1876| 3.27k| w0 = w1; 1877| 3.27k| w1 = w2; 1878| 3.27k| w2 = 0; 1879| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[20]); 1880| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[19]); 1881| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[18]); 1882| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[17]); 1883| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[16]); 1884| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[15]); 1885| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[14]); 1886| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[13]); 1887| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[12]); 1888| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[11]); 1889| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[10]); 1890| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[9]); 1891| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[8]); 1892| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[7]); 1893| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[6]); 1894| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[5]); 1895| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[4]); 1896| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[3]); 1897| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[2]); 1898| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[1]); 1899| 3.27k| word3_add(&w2, &w1, &w0, z[20]); 1900| 3.27k| ws[20] = w0 * p_dash; 1901| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[0]); 1902| 3.27k| w0 = w1; 1903| 3.27k| w1 = w2; 1904| 3.27k| w2 = 0; 1905| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[21]); 1906| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[20]); 1907| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[19]); 1908| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[18]); 1909| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[17]); 1910| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[16]); 1911| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[15]); 1912| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[14]); 1913| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[13]); 1914| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[12]); 1915| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[11]); 1916| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[10]); 1917| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[9]); 1918| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[8]); 1919| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[7]); 1920| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[6]); 1921| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[5]); 1922| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[4]); 1923| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[3]); 1924| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[2]); 1925| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[1]); 1926| 3.27k| word3_add(&w2, &w1, &w0, z[21]); 1927| 3.27k| ws[21] = w0 * p_dash; 1928| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[0]); 1929| 3.27k| w0 = w1; 1930| 3.27k| w1 = w2; 1931| 3.27k| w2 = 0; 1932| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[22]); 1933| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[21]); 1934| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[20]); 1935| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[19]); 1936| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[18]); 1937| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[17]); 1938| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[16]); 1939| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[15]); 1940| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[14]); 1941| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[13]); 1942| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[12]); 1943| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[11]); 1944| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[10]); 1945| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[9]); 1946| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[8]); 1947| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[7]); 1948| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[6]); 1949| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[5]); 1950| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[4]); 1951| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[3]); 1952| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[2]); 1953| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[1]); 1954| 3.27k| word3_add(&w2, &w1, &w0, z[22]); 1955| 3.27k| ws[22] = w0 * p_dash; 1956| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[0]); 1957| 3.27k| w0 = w1; 1958| 3.27k| w1 = w2; 1959| 3.27k| w2 = 0; 1960| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[23]); 1961| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[22]); 1962| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[21]); 1963| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[20]); 1964| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[19]); 1965| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[18]); 1966| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[17]); 1967| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[16]); 1968| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[15]); 1969| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[14]); 1970| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[13]); 1971| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[12]); 1972| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[11]); 1973| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[10]); 1974| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[9]); 1975| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[8]); 1976| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[7]); 1977| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[6]); 1978| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[5]); 1979| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[4]); 1980| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[3]); 1981| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[2]); 1982| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[1]); 1983| 3.27k| word3_add(&w2, &w1, &w0, z[23]); 1984| 3.27k| ws[23] = w0 * p_dash; 1985| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[0]); 1986| 3.27k| w0 = w1; 1987| 3.27k| w1 = w2; 1988| 3.27k| w2 = 0; 1989| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[24]); 1990| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[23]); 1991| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[22]); 1992| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[21]); 1993| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[20]); 1994| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[19]); 1995| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[18]); 1996| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[17]); 1997| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[16]); 1998| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[15]); 1999| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[14]); 2000| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[13]); 2001| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[12]); 2002| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[11]); 2003| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[10]); 2004| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[9]); 2005| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[8]); 2006| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[7]); 2007| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[6]); 2008| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[5]); 2009| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[4]); 2010| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[3]); 2011| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[2]); 2012| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[1]); 2013| 3.27k| word3_add(&w2, &w1, &w0, z[24]); 2014| 3.27k| ws[24] = w0 * p_dash; 2015| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[0]); 2016| 3.27k| w0 = w1; 2017| 3.27k| w1 = w2; 2018| 3.27k| w2 = 0; 2019| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[25]); 2020| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[24]); 2021| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[23]); 2022| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[22]); 2023| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[21]); 2024| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[20]); 2025| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[19]); 2026| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[18]); 2027| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[17]); 2028| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[16]); 2029| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[15]); 2030| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[14]); 2031| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[13]); 2032| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[12]); 2033| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[11]); 2034| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[10]); 2035| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[9]); 2036| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[8]); 2037| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[7]); 2038| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[6]); 2039| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[5]); 2040| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[4]); 2041| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[3]); 2042| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[2]); 2043| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[1]); 2044| 3.27k| word3_add(&w2, &w1, &w0, z[25]); 2045| 3.27k| ws[25] = w0 * p_dash; 2046| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[0]); 2047| 3.27k| w0 = w1; 2048| 3.27k| w1 = w2; 2049| 3.27k| w2 = 0; 2050| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[26]); 2051| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[25]); 2052| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[24]); 2053| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[23]); 2054| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[22]); 2055| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[21]); 2056| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[20]); 2057| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[19]); 2058| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[18]); 2059| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[17]); 2060| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[16]); 2061| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[15]); 2062| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[14]); 2063| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[13]); 2064| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[12]); 2065| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[11]); 2066| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[10]); 2067| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[9]); 2068| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[8]); 2069| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[7]); 2070| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[6]); 2071| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[5]); 2072| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[4]); 2073| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[3]); 2074| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[2]); 2075| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[1]); 2076| 3.27k| word3_add(&w2, &w1, &w0, z[26]); 2077| 3.27k| ws[26] = w0 * p_dash; 2078| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[0]); 2079| 3.27k| w0 = w1; 2080| 3.27k| w1 = w2; 2081| 3.27k| w2 = 0; 2082| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[27]); 2083| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[26]); 2084| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[25]); 2085| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[24]); 2086| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[23]); 2087| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[22]); 2088| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[21]); 2089| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[20]); 2090| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[19]); 2091| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[18]); 2092| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[17]); 2093| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[16]); 2094| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[15]); 2095| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[14]); 2096| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[13]); 2097| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[12]); 2098| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[11]); 2099| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[10]); 2100| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[9]); 2101| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[8]); 2102| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[7]); 2103| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[6]); 2104| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[5]); 2105| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[4]); 2106| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[3]); 2107| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[2]); 2108| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[1]); 2109| 3.27k| word3_add(&w2, &w1, &w0, z[27]); 2110| 3.27k| ws[27] = w0 * p_dash; 2111| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[0]); 2112| 3.27k| w0 = w1; 2113| 3.27k| w1 = w2; 2114| 3.27k| w2 = 0; 2115| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[28]); 2116| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[27]); 2117| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[26]); 2118| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[25]); 2119| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[24]); 2120| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[23]); 2121| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[22]); 2122| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[21]); 2123| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[20]); 2124| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[19]); 2125| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[18]); 2126| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[17]); 2127| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[16]); 2128| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[15]); 2129| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[14]); 2130| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[13]); 2131| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[12]); 2132| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[11]); 2133| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[10]); 2134| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[9]); 2135| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[8]); 2136| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[7]); 2137| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[6]); 2138| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[5]); 2139| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[4]); 2140| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[3]); 2141| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[2]); 2142| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[1]); 2143| 3.27k| word3_add(&w2, &w1, &w0, z[28]); 2144| 3.27k| ws[28] = w0 * p_dash; 2145| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[0]); 2146| 3.27k| w0 = w1; 2147| 3.27k| w1 = w2; 2148| 3.27k| w2 = 0; 2149| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[29]); 2150| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[28]); 2151| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[27]); 2152| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[26]); 2153| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[25]); 2154| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[24]); 2155| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[23]); 2156| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[22]); 2157| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[21]); 2158| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[20]); 2159| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[19]); 2160| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[18]); 2161| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[17]); 2162| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[16]); 2163| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[15]); 2164| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[14]); 2165| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[13]); 2166| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[12]); 2167| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[11]); 2168| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[10]); 2169| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[9]); 2170| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[8]); 2171| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[7]); 2172| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[6]); 2173| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[5]); 2174| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[4]); 2175| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[3]); 2176| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[2]); 2177| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[1]); 2178| 3.27k| word3_add(&w2, &w1, &w0, z[29]); 2179| 3.27k| ws[29] = w0 * p_dash; 2180| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[0]); 2181| 3.27k| w0 = w1; 2182| 3.27k| w1 = w2; 2183| 3.27k| w2 = 0; 2184| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[30]); 2185| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[29]); 2186| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[28]); 2187| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[27]); 2188| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[26]); 2189| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[25]); 2190| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[24]); 2191| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[23]); 2192| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[22]); 2193| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[21]); 2194| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[20]); 2195| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[19]); 2196| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[18]); 2197| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[17]); 2198| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[16]); 2199| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[15]); 2200| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[14]); 2201| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[13]); 2202| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[12]); 2203| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[11]); 2204| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[10]); 2205| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[9]); 2206| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[8]); 2207| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[7]); 2208| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[6]); 2209| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[5]); 2210| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[4]); 2211| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[3]); 2212| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[2]); 2213| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[1]); 2214| 3.27k| word3_add(&w2, &w1, &w0, z[30]); 2215| 3.27k| ws[30] = w0 * p_dash; 2216| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[0]); 2217| 3.27k| w0 = w1; 2218| 3.27k| w1 = w2; 2219| 3.27k| w2 = 0; 2220| 3.27k| word3_muladd(&w2, &w1, &w0, ws[0], p[31]); 2221| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[30]); 2222| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[29]); 2223| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[28]); 2224| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[27]); 2225| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[26]); 2226| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[25]); 2227| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[24]); 2228| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[23]); 2229| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[22]); 2230| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[21]); 2231| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[20]); 2232| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[19]); 2233| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[18]); 2234| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[17]); 2235| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[16]); 2236| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[15]); 2237| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[14]); 2238| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[13]); 2239| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[12]); 2240| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[11]); 2241| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[10]); 2242| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[9]); 2243| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[8]); 2244| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[7]); 2245| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[6]); 2246| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[5]); 2247| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[4]); 2248| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[3]); 2249| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[2]); 2250| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[1]); 2251| 3.27k| word3_add(&w2, &w1, &w0, z[31]); 2252| 3.27k| ws[31] = w0 * p_dash; 2253| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[0]); 2254| 3.27k| w0 = w1; 2255| 3.27k| w1 = w2; 2256| 3.27k| w2 = 0; 2257| 3.27k| word3_muladd(&w2, &w1, &w0, ws[1], p[31]); 2258| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[30]); 2259| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[29]); 2260| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[28]); 2261| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[27]); 2262| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[26]); 2263| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[25]); 2264| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[24]); 2265| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[23]); 2266| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[22]); 2267| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[21]); 2268| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[20]); 2269| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[19]); 2270| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[18]); 2271| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[17]); 2272| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[16]); 2273| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[15]); 2274| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[14]); 2275| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[13]); 2276| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[12]); 2277| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[11]); 2278| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[10]); 2279| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[9]); 2280| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[8]); 2281| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[7]); 2282| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[6]); 2283| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[5]); 2284| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[4]); 2285| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[3]); 2286| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[2]); 2287| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[1]); 2288| 3.27k| word3_add(&w2, &w1, &w0, z[32]); 2289| 3.27k| ws[0] = w0; 2290| 3.27k| w0 = w1; 2291| 3.27k| w1 = w2; 2292| 3.27k| w2 = 0; 2293| 3.27k| word3_muladd(&w2, &w1, &w0, ws[2], p[31]); 2294| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[30]); 2295| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[29]); 2296| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[28]); 2297| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[27]); 2298| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[26]); 2299| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[25]); 2300| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[24]); 2301| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[23]); 2302| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[22]); 2303| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[21]); 2304| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[20]); 2305| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[19]); 2306| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[18]); 2307| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[17]); 2308| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[16]); 2309| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[15]); 2310| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[14]); 2311| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[13]); 2312| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[12]); 2313| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[11]); 2314| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[10]); 2315| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[9]); 2316| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[8]); 2317| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[7]); 2318| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[6]); 2319| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[5]); 2320| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[4]); 2321| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[3]); 2322| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[2]); 2323| 3.27k| word3_add(&w2, &w1, &w0, z[33]); 2324| 3.27k| ws[1] = w0; 2325| 3.27k| w0 = w1; 2326| 3.27k| w1 = w2; 2327| 3.27k| w2 = 0; 2328| 3.27k| word3_muladd(&w2, &w1, &w0, ws[3], p[31]); 2329| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[30]); 2330| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[29]); 2331| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[28]); 2332| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[27]); 2333| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[26]); 2334| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[25]); 2335| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[24]); 2336| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[23]); 2337| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[22]); 2338| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[21]); 2339| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[20]); 2340| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[19]); 2341| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[18]); 2342| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[17]); 2343| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[16]); 2344| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[15]); 2345| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[14]); 2346| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[13]); 2347| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[12]); 2348| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[11]); 2349| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[10]); 2350| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[9]); 2351| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[8]); 2352| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[7]); 2353| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[6]); 2354| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[5]); 2355| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[4]); 2356| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[3]); 2357| 3.27k| word3_add(&w2, &w1, &w0, z[34]); 2358| 3.27k| ws[2] = w0; 2359| 3.27k| w0 = w1; 2360| 3.27k| w1 = w2; 2361| 3.27k| w2 = 0; 2362| 3.27k| word3_muladd(&w2, &w1, &w0, ws[4], p[31]); 2363| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[30]); 2364| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[29]); 2365| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[28]); 2366| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[27]); 2367| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[26]); 2368| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[25]); 2369| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[24]); 2370| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[23]); 2371| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[22]); 2372| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[21]); 2373| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[20]); 2374| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[19]); 2375| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[18]); 2376| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[17]); 2377| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[16]); 2378| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[15]); 2379| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[14]); 2380| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[13]); 2381| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[12]); 2382| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[11]); 2383| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[10]); 2384| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[9]); 2385| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[8]); 2386| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[7]); 2387| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[6]); 2388| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[5]); 2389| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[4]); 2390| 3.27k| word3_add(&w2, &w1, &w0, z[35]); 2391| 3.27k| ws[3] = w0; 2392| 3.27k| w0 = w1; 2393| 3.27k| w1 = w2; 2394| 3.27k| w2 = 0; 2395| 3.27k| word3_muladd(&w2, &w1, &w0, ws[5], p[31]); 2396| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[30]); 2397| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[29]); 2398| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[28]); 2399| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[27]); 2400| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[26]); 2401| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[25]); 2402| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[24]); 2403| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[23]); 2404| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[22]); 2405| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[21]); 2406| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[20]); 2407| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[19]); 2408| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[18]); 2409| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[17]); 2410| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[16]); 2411| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[15]); 2412| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[14]); 2413| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[13]); 2414| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[12]); 2415| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[11]); 2416| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[10]); 2417| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[9]); 2418| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[8]); 2419| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[7]); 2420| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[6]); 2421| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[5]); 2422| 3.27k| word3_add(&w2, &w1, &w0, z[36]); 2423| 3.27k| ws[4] = w0; 2424| 3.27k| w0 = w1; 2425| 3.27k| w1 = w2; 2426| 3.27k| w2 = 0; 2427| 3.27k| word3_muladd(&w2, &w1, &w0, ws[6], p[31]); 2428| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[30]); 2429| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[29]); 2430| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[28]); 2431| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[27]); 2432| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[26]); 2433| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[25]); 2434| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[24]); 2435| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[23]); 2436| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[22]); 2437| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[21]); 2438| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[20]); 2439| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[19]); 2440| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[18]); 2441| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[17]); 2442| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[16]); 2443| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[15]); 2444| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[14]); 2445| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[13]); 2446| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[12]); 2447| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[11]); 2448| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[10]); 2449| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[9]); 2450| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[8]); 2451| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[7]); 2452| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[6]); 2453| 3.27k| word3_add(&w2, &w1, &w0, z[37]); 2454| 3.27k| ws[5] = w0; 2455| 3.27k| w0 = w1; 2456| 3.27k| w1 = w2; 2457| 3.27k| w2 = 0; 2458| 3.27k| word3_muladd(&w2, &w1, &w0, ws[7], p[31]); 2459| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[30]); 2460| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[29]); 2461| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[28]); 2462| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[27]); 2463| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[26]); 2464| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[25]); 2465| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[24]); 2466| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[23]); 2467| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[22]); 2468| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[21]); 2469| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[20]); 2470| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[19]); 2471| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[18]); 2472| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[17]); 2473| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[16]); 2474| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[15]); 2475| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[14]); 2476| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[13]); 2477| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[12]); 2478| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[11]); 2479| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[10]); 2480| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[9]); 2481| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[8]); 2482| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[7]); 2483| 3.27k| word3_add(&w2, &w1, &w0, z[38]); 2484| 3.27k| ws[6] = w0; 2485| 3.27k| w0 = w1; 2486| 3.27k| w1 = w2; 2487| 3.27k| w2 = 0; 2488| 3.27k| word3_muladd(&w2, &w1, &w0, ws[8], p[31]); 2489| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[30]); 2490| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[29]); 2491| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[28]); 2492| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[27]); 2493| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[26]); 2494| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[25]); 2495| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[24]); 2496| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[23]); 2497| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[22]); 2498| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[21]); 2499| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[20]); 2500| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[19]); 2501| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[18]); 2502| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[17]); 2503| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[16]); 2504| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[15]); 2505| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[14]); 2506| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[13]); 2507| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[12]); 2508| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[11]); 2509| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[10]); 2510| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[9]); 2511| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[8]); 2512| 3.27k| word3_add(&w2, &w1, &w0, z[39]); 2513| 3.27k| ws[7] = w0; 2514| 3.27k| w0 = w1; 2515| 3.27k| w1 = w2; 2516| 3.27k| w2 = 0; 2517| 3.27k| word3_muladd(&w2, &w1, &w0, ws[9], p[31]); 2518| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[30]); 2519| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[29]); 2520| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[28]); 2521| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[27]); 2522| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[26]); 2523| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[25]); 2524| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[24]); 2525| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[23]); 2526| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[22]); 2527| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[21]); 2528| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[20]); 2529| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[19]); 2530| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[18]); 2531| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[17]); 2532| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[16]); 2533| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[15]); 2534| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[14]); 2535| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[13]); 2536| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[12]); 2537| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[11]); 2538| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[10]); 2539| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[9]); 2540| 3.27k| word3_add(&w2, &w1, &w0, z[40]); 2541| 3.27k| ws[8] = w0; 2542| 3.27k| w0 = w1; 2543| 3.27k| w1 = w2; 2544| 3.27k| w2 = 0; 2545| 3.27k| word3_muladd(&w2, &w1, &w0, ws[10], p[31]); 2546| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[30]); 2547| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[29]); 2548| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[28]); 2549| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[27]); 2550| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[26]); 2551| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[25]); 2552| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[24]); 2553| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[23]); 2554| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[22]); 2555| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[21]); 2556| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[20]); 2557| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[19]); 2558| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[18]); 2559| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[17]); 2560| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[16]); 2561| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[15]); 2562| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[14]); 2563| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[13]); 2564| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[12]); 2565| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[11]); 2566| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[10]); 2567| 3.27k| word3_add(&w2, &w1, &w0, z[41]); 2568| 3.27k| ws[9] = w0; 2569| 3.27k| w0 = w1; 2570| 3.27k| w1 = w2; 2571| 3.27k| w2 = 0; 2572| 3.27k| word3_muladd(&w2, &w1, &w0, ws[11], p[31]); 2573| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[30]); 2574| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[29]); 2575| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[28]); 2576| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[27]); 2577| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[26]); 2578| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[25]); 2579| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[24]); 2580| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[23]); 2581| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[22]); 2582| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[21]); 2583| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[20]); 2584| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[19]); 2585| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[18]); 2586| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[17]); 2587| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[16]); 2588| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[15]); 2589| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[14]); 2590| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[13]); 2591| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[12]); 2592| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[11]); 2593| 3.27k| word3_add(&w2, &w1, &w0, z[42]); 2594| 3.27k| ws[10] = w0; 2595| 3.27k| w0 = w1; 2596| 3.27k| w1 = w2; 2597| 3.27k| w2 = 0; 2598| 3.27k| word3_muladd(&w2, &w1, &w0, ws[12], p[31]); 2599| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[30]); 2600| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[29]); 2601| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[28]); 2602| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[27]); 2603| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[26]); 2604| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[25]); 2605| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[24]); 2606| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[23]); 2607| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[22]); 2608| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[21]); 2609| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[20]); 2610| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[19]); 2611| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[18]); 2612| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[17]); 2613| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[16]); 2614| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[15]); 2615| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[14]); 2616| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[13]); 2617| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[12]); 2618| 3.27k| word3_add(&w2, &w1, &w0, z[43]); 2619| 3.27k| ws[11] = w0; 2620| 3.27k| w0 = w1; 2621| 3.27k| w1 = w2; 2622| 3.27k| w2 = 0; 2623| 3.27k| word3_muladd(&w2, &w1, &w0, ws[13], p[31]); 2624| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[30]); 2625| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[29]); 2626| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[28]); 2627| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[27]); 2628| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[26]); 2629| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[25]); 2630| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[24]); 2631| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[23]); 2632| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[22]); 2633| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[21]); 2634| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[20]); 2635| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[19]); 2636| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[18]); 2637| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[17]); 2638| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[16]); 2639| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[15]); 2640| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[14]); 2641| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[13]); 2642| 3.27k| word3_add(&w2, &w1, &w0, z[44]); 2643| 3.27k| ws[12] = w0; 2644| 3.27k| w0 = w1; 2645| 3.27k| w1 = w2; 2646| 3.27k| w2 = 0; 2647| 3.27k| word3_muladd(&w2, &w1, &w0, ws[14], p[31]); 2648| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[30]); 2649| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[29]); 2650| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[28]); 2651| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[27]); 2652| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[26]); 2653| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[25]); 2654| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[24]); 2655| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[23]); 2656| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[22]); 2657| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[21]); 2658| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[20]); 2659| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[19]); 2660| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[18]); 2661| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[17]); 2662| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[16]); 2663| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[15]); 2664| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[14]); 2665| 3.27k| word3_add(&w2, &w1, &w0, z[45]); 2666| 3.27k| ws[13] = w0; 2667| 3.27k| w0 = w1; 2668| 3.27k| w1 = w2; 2669| 3.27k| w2 = 0; 2670| 3.27k| word3_muladd(&w2, &w1, &w0, ws[15], p[31]); 2671| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[30]); 2672| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[29]); 2673| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[28]); 2674| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[27]); 2675| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[26]); 2676| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[25]); 2677| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[24]); 2678| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[23]); 2679| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[22]); 2680| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[21]); 2681| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[20]); 2682| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[19]); 2683| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[18]); 2684| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[17]); 2685| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[16]); 2686| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[15]); 2687| 3.27k| word3_add(&w2, &w1, &w0, z[46]); 2688| 3.27k| ws[14] = w0; 2689| 3.27k| w0 = w1; 2690| 3.27k| w1 = w2; 2691| 3.27k| w2 = 0; 2692| 3.27k| word3_muladd(&w2, &w1, &w0, ws[16], p[31]); 2693| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[30]); 2694| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[29]); 2695| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[28]); 2696| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[27]); 2697| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[26]); 2698| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[25]); 2699| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[24]); 2700| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[23]); 2701| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[22]); 2702| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[21]); 2703| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[20]); 2704| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[19]); 2705| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[18]); 2706| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[17]); 2707| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[16]); 2708| 3.27k| word3_add(&w2, &w1, &w0, z[47]); 2709| 3.27k| ws[15] = w0; 2710| 3.27k| w0 = w1; 2711| 3.27k| w1 = w2; 2712| 3.27k| w2 = 0; 2713| 3.27k| word3_muladd(&w2, &w1, &w0, ws[17], p[31]); 2714| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[30]); 2715| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[29]); 2716| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[28]); 2717| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[27]); 2718| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[26]); 2719| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[25]); 2720| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[24]); 2721| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[23]); 2722| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[22]); 2723| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[21]); 2724| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[20]); 2725| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[19]); 2726| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[18]); 2727| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[17]); 2728| 3.27k| word3_add(&w2, &w1, &w0, z[48]); 2729| 3.27k| ws[16] = w0; 2730| 3.27k| w0 = w1; 2731| 3.27k| w1 = w2; 2732| 3.27k| w2 = 0; 2733| 3.27k| word3_muladd(&w2, &w1, &w0, ws[18], p[31]); 2734| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[30]); 2735| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[29]); 2736| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[28]); 2737| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[27]); 2738| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[26]); 2739| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[25]); 2740| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[24]); 2741| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[23]); 2742| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[22]); 2743| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[21]); 2744| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[20]); 2745| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[19]); 2746| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[18]); 2747| 3.27k| word3_add(&w2, &w1, &w0, z[49]); 2748| 3.27k| ws[17] = w0; 2749| 3.27k| w0 = w1; 2750| 3.27k| w1 = w2; 2751| 3.27k| w2 = 0; 2752| 3.27k| word3_muladd(&w2, &w1, &w0, ws[19], p[31]); 2753| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[30]); 2754| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[29]); 2755| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[28]); 2756| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[27]); 2757| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[26]); 2758| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[25]); 2759| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[24]); 2760| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[23]); 2761| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[22]); 2762| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[21]); 2763| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[20]); 2764| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[19]); 2765| 3.27k| word3_add(&w2, &w1, &w0, z[50]); 2766| 3.27k| ws[18] = w0; 2767| 3.27k| w0 = w1; 2768| 3.27k| w1 = w2; 2769| 3.27k| w2 = 0; 2770| 3.27k| word3_muladd(&w2, &w1, &w0, ws[20], p[31]); 2771| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[30]); 2772| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[29]); 2773| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[28]); 2774| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[27]); 2775| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[26]); 2776| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[25]); 2777| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[24]); 2778| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[23]); 2779| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[22]); 2780| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[21]); 2781| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[20]); 2782| 3.27k| word3_add(&w2, &w1, &w0, z[51]); 2783| 3.27k| ws[19] = w0; 2784| 3.27k| w0 = w1; 2785| 3.27k| w1 = w2; 2786| 3.27k| w2 = 0; 2787| 3.27k| word3_muladd(&w2, &w1, &w0, ws[21], p[31]); 2788| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[30]); 2789| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[29]); 2790| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[28]); 2791| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[27]); 2792| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[26]); 2793| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[25]); 2794| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[24]); 2795| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[23]); 2796| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[22]); 2797| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[21]); 2798| 3.27k| word3_add(&w2, &w1, &w0, z[52]); 2799| 3.27k| ws[20] = w0; 2800| 3.27k| w0 = w1; 2801| 3.27k| w1 = w2; 2802| 3.27k| w2 = 0; 2803| 3.27k| word3_muladd(&w2, &w1, &w0, ws[22], p[31]); 2804| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[30]); 2805| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[29]); 2806| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[28]); 2807| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[27]); 2808| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[26]); 2809| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[25]); 2810| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[24]); 2811| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[23]); 2812| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[22]); 2813| 3.27k| word3_add(&w2, &w1, &w0, z[53]); 2814| 3.27k| ws[21] = w0; 2815| 3.27k| w0 = w1; 2816| 3.27k| w1 = w2; 2817| 3.27k| w2 = 0; 2818| 3.27k| word3_muladd(&w2, &w1, &w0, ws[23], p[31]); 2819| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[30]); 2820| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[29]); 2821| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[28]); 2822| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[27]); 2823| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[26]); 2824| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[25]); 2825| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[24]); 2826| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[23]); 2827| 3.27k| word3_add(&w2, &w1, &w0, z[54]); 2828| 3.27k| ws[22] = w0; 2829| 3.27k| w0 = w1; 2830| 3.27k| w1 = w2; 2831| 3.27k| w2 = 0; 2832| 3.27k| word3_muladd(&w2, &w1, &w0, ws[24], p[31]); 2833| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[30]); 2834| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[29]); 2835| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[28]); 2836| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[27]); 2837| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[26]); 2838| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[25]); 2839| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[24]); 2840| 3.27k| word3_add(&w2, &w1, &w0, z[55]); 2841| 3.27k| ws[23] = w0; 2842| 3.27k| w0 = w1; 2843| 3.27k| w1 = w2; 2844| 3.27k| w2 = 0; 2845| 3.27k| word3_muladd(&w2, &w1, &w0, ws[25], p[31]); 2846| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[30]); 2847| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[29]); 2848| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[28]); 2849| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[27]); 2850| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[26]); 2851| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[25]); 2852| 3.27k| word3_add(&w2, &w1, &w0, z[56]); 2853| 3.27k| ws[24] = w0; 2854| 3.27k| w0 = w1; 2855| 3.27k| w1 = w2; 2856| 3.27k| w2 = 0; 2857| 3.27k| word3_muladd(&w2, &w1, &w0, ws[26], p[31]); 2858| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[30]); 2859| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[29]); 2860| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[28]); 2861| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[27]); 2862| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[26]); 2863| 3.27k| word3_add(&w2, &w1, &w0, z[57]); 2864| 3.27k| ws[25] = w0; 2865| 3.27k| w0 = w1; 2866| 3.27k| w1 = w2; 2867| 3.27k| w2 = 0; 2868| 3.27k| word3_muladd(&w2, &w1, &w0, ws[27], p[31]); 2869| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[30]); 2870| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[29]); 2871| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[28]); 2872| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[27]); 2873| 3.27k| word3_add(&w2, &w1, &w0, z[58]); 2874| 3.27k| ws[26] = w0; 2875| 3.27k| w0 = w1; 2876| 3.27k| w1 = w2; 2877| 3.27k| w2 = 0; 2878| 3.27k| word3_muladd(&w2, &w1, &w0, ws[28], p[31]); 2879| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[30]); 2880| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[29]); 2881| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[28]); 2882| 3.27k| word3_add(&w2, &w1, &w0, z[59]); 2883| 3.27k| ws[27] = w0; 2884| 3.27k| w0 = w1; 2885| 3.27k| w1 = w2; 2886| 3.27k| w2 = 0; 2887| 3.27k| word3_muladd(&w2, &w1, &w0, ws[29], p[31]); 2888| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[30]); 2889| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[29]); 2890| 3.27k| word3_add(&w2, &w1, &w0, z[60]); 2891| 3.27k| ws[28] = w0; 2892| 3.27k| w0 = w1; 2893| 3.27k| w1 = w2; 2894| 3.27k| w2 = 0; 2895| 3.27k| word3_muladd(&w2, &w1, &w0, ws[30], p[31]); 2896| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[30]); 2897| 3.27k| word3_add(&w2, &w1, &w0, z[61]); 2898| 3.27k| ws[29] = w0; 2899| 3.27k| w0 = w1; 2900| 3.27k| w1 = w2; 2901| 3.27k| w2 = 0; 2902| 3.27k| word3_muladd(&w2, &w1, &w0, ws[31], p[31]); 2903| 3.27k| word3_add(&w2, &w1, &w0, z[62]); 2904| 3.27k| ws[30] = w0; 2905| 3.27k| w0 = w1; 2906| 3.27k| w1 = w2; 2907| 3.27k| w2 = 0; 2908| 3.27k| word3_add(&w2, &w1, &w0, z[63]); 2909| 3.27k| ws[31] = w0; 2910| 3.27k| ws[32] = w1; 2911| 3.27k| word borrow = bigint_sub3(z, ws, 32 + 1, p, 32); 2912| 3.27k| CT::conditional_assign_mem(borrow, z, ws, 32); 2913| 3.27k| clear_mem(z + 32, 32); 2914| 3.27k|} _ZN5Botan11inverse_modERKNS_6BigIntES2_: 178| 1.06k|BigInt inverse_mod(const BigInt& n, const BigInt& mod) { 179| 1.06k| if(mod.is_zero()) { ------------------ | Branch (179:7): [True: 0, False: 1.06k] ------------------ 180| 0| throw Invalid_Argument("inverse_mod modulus cannot be zero"); 181| 0| } 182| 1.06k| if(mod.is_negative() || n.is_negative()) { ------------------ | Branch (182:7): [True: 0, False: 1.06k] | Branch (182:28): [True: 0, False: 1.06k] ------------------ 183| 0| throw Invalid_Argument("inverse_mod: arguments must be non-negative"); 184| 0| } 185| 1.06k| if(n.is_zero() || (n.is_even() && mod.is_even())) { ------------------ | Branch (185:7): [True: 0, False: 1.06k] | Branch (185:23): [True: 362, False: 699] | Branch (185:38): [True: 0, False: 362] ------------------ 186| 0| return BigInt::zero(); 187| 0| } 188| | 189| 1.06k| if(mod.is_odd()) { ------------------ | Branch (189:7): [True: 1.06k, 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| 1.06k| if(n < mod) { ------------------ | Branch (194:10): [True: 1.06k, False: 0] ------------------ 195| 1.06k| return inverse_mod_odd_modulus(n, mod); 196| 1.06k| } else { 197| 0| return inverse_mod_odd_modulus(ct_modulo(n, mod), mod); 198| 0| } 199| 1.06k| } 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| 1.06k|BigInt inverse_mod_odd_modulus(const BigInt& n, const BigInt& mod) { 19| | // Caller should assure these preconditions: 20| 1.06k| BOTAN_DEBUG_ASSERT(n.is_positive()); ------------------ | | 99| 1.06k| do { \ | | 100| 1.06k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 21| 1.06k| BOTAN_DEBUG_ASSERT(mod.is_positive()); ------------------ | | 99| 1.06k| do { \ | | 100| 1.06k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 22| 1.06k| BOTAN_DEBUG_ASSERT(n < mod); ------------------ | | 99| 1.06k| do { \ | | 100| 1.06k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 23| 1.06k| BOTAN_DEBUG_ASSERT(mod >= 3 && mod.is_odd()); ------------------ | | 99| 1.06k| do { \ | | 100| 1.06k| } 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| 1.06k| const size_t mod_words = mod.sig_words(); 45| 1.06k| BOTAN_ASSERT(mod_words > 0, "Not empty"); ------------------ | | 51| 1.06k| do { \ | | 52| 1.06k| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 0, False: 1.06k] | | ------------------ | | 53| 1.06k| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 1.06k| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 46| | 47| 1.06k| secure_vector tmp_mem(5 * mod_words); 48| | 49| 1.06k| word* v_w = &tmp_mem[0]; 50| 1.06k| word* u_w = &tmp_mem[1 * mod_words]; 51| 1.06k| word* b_w = &tmp_mem[2 * mod_words]; 52| 1.06k| word* a_w = &tmp_mem[3 * mod_words]; 53| 1.06k| word* mp1o2 = &tmp_mem[4 * mod_words]; 54| | 55| 1.06k| CT::poison(tmp_mem.data(), tmp_mem.size()); 56| | 57| 1.06k| copy_mem(a_w, n.data(), std::min(n.size(), mod_words)); 58| 1.06k| copy_mem(b_w, mod.data(), std::min(mod.size(), mod_words)); 59| 1.06k| 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| 1.06k| copy_mem(mp1o2, mod.data(), std::min(mod.size(), mod_words)); 65| 1.06k| bigint_shr1(mp1o2, mod_words, 0, 1); 66| 1.06k| word carry = bigint_add2_nc(mp1o2, mod_words, u_w, 1); 67| 1.06k| BOTAN_ASSERT_NOMSG(carry == 0); ------------------ | | 60| 1.06k| do { \ | | 61| 1.06k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 1.06k] | | ------------------ | | 62| 1.06k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 1.06k| } 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| 1.06k| const size_t execs = 2 * mod.bits(); 71| | 72| 551k| for(size_t i = 0; i != execs; ++i) { ------------------ | Branch (72:22): [True: 550k, False: 1.06k] ------------------ 73| 550k| const word odd_a = a_w[0] & 1; 74| | 75| | //if(odd_a) a -= b 76| 550k| 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| 550k| bigint_cnd_add(underflow, b_w, a_w, mod_words); 80| 550k| bigint_cnd_abs(underflow, a_w, mod_words); 81| 550k| bigint_cnd_swap(underflow, u_w, v_w, mod_words); 82| | 83| | // a >>= 1 84| 550k| bigint_shr1(a_w, mod_words, 0, 1); 85| | 86| | //if(odd_a) u -= v; 87| 550k| word borrow = bigint_cnd_sub(odd_a, u_w, v_w, mod_words); 88| | 89| | // if(borrow) u += p 90| 550k| bigint_cnd_add(borrow, u_w, mod.data(), mod_words); 91| | 92| 550k| const word odd_u = u_w[0] & 1; 93| | 94| | // u >>= 1 95| 550k| bigint_shr1(u_w, mod_words, 0, 1); 96| | 97| | //if(odd_u) u += mp1o2; 98| 550k| bigint_cnd_add(odd_u, u_w, mp1o2, mod_words); 99| 550k| } 100| | 101| 1.06k| auto a_is_0 = CT::Mask::set(); 102| 5.56k| for(size_t i = 0; i != mod_words; ++i) { ------------------ | Branch (102:22): [True: 4.49k, False: 1.06k] ------------------ 103| 4.49k| a_is_0 &= CT::Mask::is_zero(a_w[i]); 104| 4.49k| } 105| | 106| 1.06k| auto b_is_1 = CT::Mask::is_equal(b_w[0], 1); 107| 4.49k| for(size_t i = 1; i != mod_words; ++i) { ------------------ | Branch (107:22): [True: 3.43k, False: 1.06k] ------------------ 108| 3.43k| b_is_1 &= CT::Mask::is_zero(b_w[i]); 109| 3.43k| } 110| | 111| 1.06k| BOTAN_ASSERT(a_is_0.is_set(), "A is zero"); ------------------ | | 51| 1.06k| do { \ | | 52| 1.06k| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 0, False: 1.06k] | | ------------------ | | 53| 1.06k| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 1.06k| } 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| 1.06k| (~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| 1.06k| clear_mem(&tmp_mem[mod_words], 4 * mod_words); 123| | 124| 1.06k| CT::unpoison(tmp_mem.data(), tmp_mem.size()); 125| | 126| 1.06k| BigInt r; 127| 1.06k| r.swap_reg(tmp_mem); 128| 1.06k| return r; 129| 1.06k|} _ZN5Botan13monty_inverseEm: 16| 2.52k|word monty_inverse(word a) { 17| 2.52k| if(a % 2 == 0) { ------------------ | Branch (17:7): [True: 0, False: 2.52k] ------------------ 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.52k| word b = 1; 27| 2.52k| word r = 0; 28| | 29| 164k| for(size_t i = 0; i != BOTAN_MP_WORD_BITS; ++i) { ------------------ | | 50| 164k|#define BOTAN_MP_WORD_BITS 64 ------------------ | Branch (29:22): [True: 161k, False: 2.52k] ------------------ 30| 161k| const word bi = b % 2; 31| 161k| r >>= 1; 32| 161k| r += bi << (BOTAN_MP_WORD_BITS - 1); ------------------ | | 50| 161k|#define BOTAN_MP_WORD_BITS 64 ------------------ 33| | 34| 161k| b -= a * bi; 35| 161k| b >>= 1; 36| 161k| } 37| | 38| | // Now invert in addition space 39| 2.52k| r = (MP_WORD_MAX - r) + 1; 40| | 41| 2.52k| return r; 42| 2.52k|} _ZN5Botan17Montgomery_ParamsC2ERKNS_6BigIntERKNS_15Modular_ReducerE: 44| 1.71k|Montgomery_Params::Montgomery_Params(const BigInt& p, const Modular_Reducer& mod_p) { 45| 1.71k| if(p.is_even() || p < 3) { ------------------ | Branch (45:7): [True: 3, False: 1.71k] | Branch (45:22): [True: 1, False: 1.71k] ------------------ 46| 4| throw Invalid_Argument("Montgomery_Params invalid modulus"); 47| 4| } 48| | 49| 1.71k| m_p = p; 50| 1.71k| m_p_words = m_p.sig_words(); 51| 1.71k| m_p_dash = monty_inverse(m_p.word_at(0)); 52| | 53| 1.71k| const BigInt r = BigInt::power_of_2(m_p_words * BOTAN_MP_WORD_BITS); ------------------ | | 50| 1.71k|#define BOTAN_MP_WORD_BITS 64 ------------------ 54| | 55| 1.71k| m_r1 = mod_p.reduce(r); 56| 1.71k| m_r2 = mod_p.square(m_r1); 57| 1.71k| m_r3 = mod_p.multiply(m_r1, m_r2); 58| 1.71k|} _ZN5Botan17Montgomery_ParamsC2ERKNS_6BigIntE: 60| 456|Montgomery_Params::Montgomery_Params(const BigInt& p) { 61| 456| if(p.is_even() || p < 3) { ------------------ | Branch (61:7): [True: 0, False: 456] | Branch (61:22): [True: 0, False: 456] ------------------ 62| 0| throw Invalid_Argument("Montgomery_Params invalid modulus"); 63| 0| } 64| | 65| 456| m_p = p; 66| 456| m_p_words = m_p.sig_words(); 67| 456| m_p_dash = monty_inverse(m_p.word_at(0)); 68| | 69| 456| const BigInt r = BigInt::power_of_2(m_p_words * BOTAN_MP_WORD_BITS); ------------------ | | 50| 456|#define BOTAN_MP_WORD_BITS 64 ------------------ 70| | 71| | // It might be faster to use ct_modulo here vs setting up Barrett reduction? 72| 456| Modular_Reducer mod_p(p); 73| | 74| 456| m_r1 = mod_p.reduce(r); 75| 456| m_r2 = mod_p.square(m_r1); 76| 456| m_r3 = mod_p.multiply(m_r1, m_r2); 77| 456|} _ZNK5Botan17Montgomery_Params4redcERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 84| 12.3k|BigInt Montgomery_Params::redc(const BigInt& x, secure_vector& ws) const { 85| 12.3k| const size_t output_size = m_p_words + 1; 86| | 87| 12.3k| if(ws.size() < output_size) { ------------------ | Branch (87:7): [True: 12.3k, False: 0] ------------------ 88| 12.3k| ws.resize(output_size); 89| 12.3k| } 90| | 91| 12.3k| BigInt z = x; 92| 12.3k| z.grow_to(2 * m_p_words); 93| | 94| 12.3k| bigint_monty_redc(z.mutable_data(), m_p.data(), m_p_words, m_p_dash, ws.data(), ws.size()); 95| | 96| 12.3k| return z; 97| 12.3k|} _ZNK5Botan17Montgomery_Params3mulERKNS_6BigIntES3_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 99| 180k|BigInt Montgomery_Params::mul(const BigInt& x, const BigInt& y, secure_vector& ws) const { 100| 180k| const size_t output_size = 2 * m_p_words + 2; 101| | 102| 180k| if(ws.size() < output_size) { ------------------ | Branch (102:7): [True: 180k, False: 0] ------------------ 103| 180k| ws.resize(output_size); 104| 180k| } 105| | 106| 180k| BOTAN_DEBUG_ASSERT(x.sig_words() <= m_p_words); ------------------ | | 99| 180k| do { \ | | 100| 180k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 107| 180k| BOTAN_DEBUG_ASSERT(y.sig_words() <= m_p_words); ------------------ | | 99| 180k| do { \ | | 100| 180k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 108| | 109| 180k| BigInt z = BigInt::with_capacity(output_size); 110| 180k| bigint_mul(z.mutable_data(), 111| 180k| z.size(), 112| 180k| x.data(), 113| 180k| x.size(), 114| 180k| std::min(m_p_words, x.size()), 115| 180k| y.data(), 116| 180k| y.size(), 117| 180k| std::min(m_p_words, y.size()), 118| 180k| ws.data(), 119| 180k| ws.size()); 120| | 121| 180k| bigint_monty_redc(z.mutable_data(), m_p.data(), m_p_words, m_p_dash, ws.data(), ws.size()); 122| | 123| 180k| return z; 124| 180k|} _ZNK5Botan17Montgomery_Params6mul_byERNS_6BigIntERKNSt3__16vectorImNS_16secure_allocatorImEEEERS7_: 151| 26.0k|void Montgomery_Params::mul_by(BigInt& x, const secure_vector& y, secure_vector& ws) const { 152| 26.0k| const size_t output_size = 2 * m_p_words; 153| | 154| 26.0k| if(ws.size() < 2 * output_size) { ------------------ | Branch (154:7): [True: 0, False: 26.0k] ------------------ 155| 0| ws.resize(2 * output_size); 156| 0| } 157| | 158| 26.0k| word* z_data = &ws[0]; 159| 26.0k| word* ws_data = &ws[output_size]; 160| | 161| 26.0k| BOTAN_DEBUG_ASSERT(x.sig_words() <= m_p_words); ------------------ | | 99| 26.0k| do { \ | | 100| 26.0k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 162| | 163| 26.0k| bigint_mul(z_data, 164| 26.0k| output_size, 165| 26.0k| x.data(), 166| 26.0k| x.size(), 167| 26.0k| std::min(m_p_words, x.size()), 168| 26.0k| y.data(), 169| 26.0k| y.size(), 170| 26.0k| std::min(m_p_words, y.size()), 171| 26.0k| ws_data, 172| 26.0k| output_size); 173| | 174| 26.0k| bigint_monty_redc(z_data, m_p.data(), m_p_words, m_p_dash, ws_data, output_size); 175| | 176| 26.0k| if(x.size() < output_size) { ------------------ | Branch (176:7): [True: 0, False: 26.0k] ------------------ 177| 0| x.grow_to(output_size); 178| 0| } 179| 26.0k| copy_mem(x.mutable_data(), z_data, output_size); 180| 26.0k|} _ZNK5Botan17Montgomery_Params6mul_byERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 182| 90.9k|void Montgomery_Params::mul_by(BigInt& x, const BigInt& y, secure_vector& ws) const { 183| 90.9k| const size_t output_size = 2 * m_p_words; 184| | 185| 90.9k| if(ws.size() < 2 * output_size) { ------------------ | Branch (185:7): [True: 0, False: 90.9k] ------------------ 186| 0| ws.resize(2 * output_size); 187| 0| } 188| | 189| 90.9k| word* z_data = &ws[0]; 190| 90.9k| word* ws_data = &ws[output_size]; 191| | 192| 90.9k| BOTAN_DEBUG_ASSERT(x.sig_words() <= m_p_words); ------------------ | | 99| 90.9k| do { \ | | 100| 90.9k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 193| | 194| 90.9k| bigint_mul(z_data, 195| 90.9k| output_size, 196| 90.9k| x.data(), 197| 90.9k| x.size(), 198| 90.9k| std::min(m_p_words, x.size()), 199| 90.9k| y.data(), 200| 90.9k| y.size(), 201| 90.9k| std::min(m_p_words, y.size()), 202| 90.9k| ws_data, 203| 90.9k| output_size); 204| | 205| 90.9k| bigint_monty_redc(z_data, m_p.data(), m_p_words, m_p_dash, ws_data, output_size); 206| | 207| 90.9k| if(x.size() < output_size) { ------------------ | Branch (207:7): [True: 0, False: 90.9k] ------------------ 208| 0| x.grow_to(output_size); 209| 0| } 210| 90.9k| copy_mem(x.mutable_data(), z_data, output_size); 211| 90.9k|} _ZNK5Botan17Montgomery_Params11square_thisERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 231| 517k|void Montgomery_Params::square_this(BigInt& x, secure_vector& ws) const { 232| 517k| const size_t output_size = 2 * m_p_words; 233| | 234| 517k| if(ws.size() < 2 * output_size) { ------------------ | Branch (234:7): [True: 3.01k, False: 514k] ------------------ 235| 3.01k| ws.resize(2 * output_size); 236| 3.01k| } 237| | 238| 517k| word* z_data = &ws[0]; 239| 517k| word* ws_data = &ws[output_size]; 240| | 241| 517k| BOTAN_DEBUG_ASSERT(x.sig_words() <= m_p_words); ------------------ | | 99| 517k| do { \ | | 100| 517k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 242| | 243| 517k| bigint_sqr(z_data, output_size, x.data(), x.size(), std::min(m_p_words, x.size()), ws_data, output_size); 244| | 245| 517k| bigint_monty_redc(z_data, m_p.data(), m_p_words, m_p_dash, ws_data, output_size); 246| | 247| 517k| if(x.size() < output_size) { ------------------ | Branch (247:7): [True: 572, False: 516k] ------------------ 248| 572| x.grow_to(output_size); 249| 572| } 250| 517k| copy_mem(x.mutable_data(), z_data, output_size); 251| 517k|} _ZN5Botan14Montgomery_IntC2ERKNSt3__110shared_ptrIKNS_17Montgomery_ParamsEEERKNS_6BigIntEb: 256| 192k| m_params(params) { 257| 192k| if(redc_needed == false) { ------------------ | Branch (257:7): [True: 180k, False: 12.3k] ------------------ 258| 180k| m_v = v; 259| 180k| } else { 260| 12.3k| BOTAN_ASSERT_NOMSG(m_v < m_params->p()); ------------------ | | 60| 12.3k| do { \ | | 61| 12.3k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 12.3k] | | ------------------ | | 62| 12.3k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 12.3k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 261| 12.3k| secure_vector ws; 262| 12.3k| m_v = m_params->mul(v, m_params->R2(), ws); 263| 12.3k| } 264| 192k|} _ZN5Botan14Montgomery_IntC2ENSt3__110shared_ptrIKNS_17Montgomery_ParamsEEEPKmmb: 282| 576| m_params(std::move(params)) { 283| 576| m_v.set_words(words, len); 284| | 285| 576| if(redc_needed) { ------------------ | Branch (285:7): [True: 0, False: 576] ------------------ 286| 0| BOTAN_ASSERT_NOMSG(m_v < m_params->p()); ------------------ | | 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] | | ------------------ ------------------ 287| 0| secure_vector ws; 288| 0| m_v = m_params->mul(m_v, m_params->R2(), ws); 289| 0| } 290| 576|} _ZN5Botan14Montgomery_Int8fix_sizeEv: 292| 192k|void Montgomery_Int::fix_size() { 293| 192k| const size_t p_words = m_params->p_words(); 294| | 295| 192k| if(m_v.sig_words() > p_words) { ------------------ | Branch (295:7): [True: 1, False: 192k] ------------------ 296| 1| throw Internal_Error("Montgomery_Int::fix_size v too large"); 297| 1| } 298| | 299| 192k| m_v.grow_to(p_words); 300| 192k|} _ZNK5Botan14Montgomery_Int5valueEv: 318| 12.3k|BigInt Montgomery_Int::value() const { 319| 12.3k| secure_vector ws; 320| 12.3k| return m_params->redc(m_v, ws); 321| 12.3k|} _ZNK5Botan14Montgomery_IntmlERKS0_: 357| 168k|Montgomery_Int Montgomery_Int::operator*(const Montgomery_Int& other) const { 358| 168k| secure_vector ws; 359| 168k| return Montgomery_Int(m_params, m_params->mul(m_v, other.m_v, ws), false); 360| 168k|} _ZN5Botan14Montgomery_Int6mul_byERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 366| 90.9k|Montgomery_Int& Montgomery_Int::mul_by(const Montgomery_Int& other, secure_vector& ws) { 367| 90.9k| m_params->mul_by(m_v, other.m_v, ws); 368| 90.9k| return (*this); 369| 90.9k|} _ZN5Botan14Montgomery_Int6mul_byERKNSt3__16vectorImNS_16secure_allocatorImEEEERS5_: 371| 26.0k|Montgomery_Int& Montgomery_Int::mul_by(const secure_vector& other, secure_vector& ws) { 372| 26.0k| m_params->mul_by(m_v, other, ws); 373| 26.0k| return (*this); 374| 26.0k|} _ZN5Botan14Montgomery_Int19square_this_n_timesERNSt3__16vectorImNS_16secure_allocatorImEEEEm: 386| 178k|Montgomery_Int& Montgomery_Int::square_this_n_times(secure_vector& ws, size_t n) { 387| 695k| for(size_t i = 0; i != n; ++i) { ------------------ | Branch (387:22): [True: 517k, False: 178k] ------------------ 388| 517k| m_params->square_this(m_v, ws); 389| 517k| } 390| 178k| return (*this); 391| 178k|} _ZN5Botan30Montgomery_Exponentation_StateC2ERKNSt3__110shared_ptrIKNS_17Montgomery_ParamsEEERKNS_6BigIntEmb: 40| 12.3k| m_params(params), m_window_bits(window_bits == 0 ? 4 : window_bits) { 41| 12.3k| BOTAN_ARG_CHECK(g < m_params->p(), "Montgomery base too big"); ------------------ | | 30| 12.3k| do { \ | | 31| 12.3k| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 1, False: 12.3k] | | ------------------ | | 32| 12.3k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 12.3k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 42| | 43| 12.3k| if(m_window_bits < 1 || m_window_bits > 12) { // really even 8 is too large ... ------------------ | Branch (43:7): [True: 1, False: 12.3k] | Branch (43:28): [True: 0, False: 12.3k] ------------------ 44| 0| throw Invalid_Argument("Invalid window bits for Montgomery exponentiation"); 45| 0| } 46| | 47| 12.3k| const size_t window_size = (static_cast(1) << m_window_bits); 48| | 49| 12.3k| m_g.reserve(window_size); 50| | 51| 12.3k| m_g.push_back(Montgomery_Int(m_params, m_params->R1(), false)); 52| | 53| 12.3k| m_g.push_back(Montgomery_Int(m_params, g)); 54| | 55| 180k| for(size_t i = 2; i != window_size; ++i) { ------------------ | Branch (55:22): [True: 168k, False: 12.3k] ------------------ 56| 168k| m_g.push_back(m_g[1] * m_g[i - 1]); 57| 168k| } 58| | 59| | // Resize each element to exactly p words 60| 205k| for(size_t i = 0; i != window_size; ++i) { ------------------ | Branch (60:22): [True: 192k, False: 12.3k] ------------------ 61| 192k| m_g[i].fix_size(); 62| 192k| if(const_time) { ------------------ | Branch (62:10): [True: 10.0k, False: 182k] ------------------ 63| 10.0k| m_g[i].const_time_poison(); 64| 10.0k| } 65| 192k| } 66| 12.3k|} _ZNK5Botan30Montgomery_Exponentation_State14exponentiationERKNS_6BigIntEm: 95| 576|BigInt Montgomery_Exponentation_State::exponentiation(const BigInt& scalar, size_t max_k_bits) const { 96| 576| BOTAN_DEBUG_ASSERT(scalar.bits() <= max_k_bits); ------------------ | | 99| 576| do { \ | | 100| 576| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 97| | // TODO add a const-time implementation of above assert and use it in release builds 98| | 99| 576| const size_t exp_nibbles = (max_k_bits + m_window_bits - 1) / m_window_bits; 100| | 101| 576| if(exp_nibbles == 0) { ------------------ | Branch (101:7): [True: 0, False: 576] ------------------ 102| 0| return BigInt::one(); 103| 0| } 104| | 105| 576| secure_vector e_bits(m_params->p_words()); 106| 576| secure_vector ws; 107| | 108| 576| const_time_lookup(e_bits, m_g, scalar.get_substring(m_window_bits * (exp_nibbles - 1), m_window_bits)); 109| 576| Montgomery_Int x(m_params, e_bits.data(), e_bits.size(), false); 110| | 111| 26.6k| for(size_t i = exp_nibbles - 1; i > 0; --i) { ------------------ | Branch (111:36): [True: 26.0k, False: 576] ------------------ 112| 26.0k| x.square_this_n_times(ws, m_window_bits); 113| 26.0k| const_time_lookup(e_bits, m_g, scalar.get_substring(m_window_bits * (i - 1), m_window_bits)); 114| 26.0k| x.mul_by(e_bits, ws); 115| 26.0k| } 116| | 117| 576| x.const_time_unpoison(); 118| 576| return x.value(); 119| 576|} _ZNK5Botan30Montgomery_Exponentation_State22exponentiation_vartimeERKNS_6BigIntE: 121| 11.7k|BigInt Montgomery_Exponentation_State::exponentiation_vartime(const BigInt& scalar) const { 122| 11.7k| const size_t exp_nibbles = (scalar.bits() + m_window_bits - 1) / m_window_bits; 123| | 124| 11.7k| secure_vector ws; 125| | 126| 11.7k| if(exp_nibbles == 0) { ------------------ | Branch (126:7): [True: 0, False: 11.7k] ------------------ 127| 0| return BigInt::one(); 128| 0| } 129| | 130| 11.7k| Montgomery_Int x = m_g[scalar.get_substring(m_window_bits * (exp_nibbles - 1), m_window_bits)]; 131| | 132| 163k| for(size_t i = exp_nibbles - 1; i > 0; --i) { ------------------ | Branch (132:36): [True: 152k, False: 11.7k] ------------------ 133| 152k| x.square_this_n_times(ws, m_window_bits); 134| | 135| 152k| const uint32_t nibble = scalar.get_substring(m_window_bits * (i - 1), m_window_bits); 136| 152k| if(nibble > 0) { ------------------ | Branch (136:10): [True: 90.9k, False: 61.2k] ------------------ 137| 90.9k| x.mul_by(m_g[nibble], ws); 138| 90.9k| } 139| 152k| } 140| | 141| 11.7k| x.const_time_unpoison(); 142| 11.7k| return x.value(); 143| 11.7k|} _ZN5Botan16monty_precomputeERKNSt3__110shared_ptrIKNS_17Montgomery_ParamsEEERKNS_6BigIntEmb: 146| 12.3k| const std::shared_ptr& params, const BigInt& g, size_t window_bits, bool const_time) { 147| 12.3k| return std::make_shared(params, g, window_bits, const_time); 148| 12.3k|} _ZN5Botan13monty_executeERKNS_30Montgomery_Exponentation_StateERKNS_6BigIntEm: 150| 576|BigInt monty_execute(const Montgomery_Exponentation_State& precomputed_state, const BigInt& k, size_t max_k_bits) { 151| 576| return precomputed_state.exponentiation(k, max_k_bits); 152| 576|} _ZN5Botan21monty_execute_vartimeERKNS_30Montgomery_Exponentation_StateERKNS_6BigIntE: 154| 11.7k|BigInt monty_execute_vartime(const Montgomery_Exponentation_State& precomputed_state, const BigInt& k) { 155| 11.7k| return precomputed_state.exponentiation_vartime(k); 156| 11.7k|} monty_exp.cpp:_ZN5Botan12_GLOBAL__N_117const_time_lookupERNSt3__16vectorImNS_16secure_allocatorImEEEERKNS2_INS_14Montgomery_IntENS1_9allocatorIS7_EEEEm: 70| 26.6k|void const_time_lookup(secure_vector& output, const std::vector& g, size_t nibble) { 71| 26.6k| BOTAN_ASSERT_NOMSG(g.size() % 2 == 0); // actually a power of 2 ------------------ | | 60| 26.6k| do { \ | | 61| 26.6k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 26.6k] | | ------------------ | | 62| 26.6k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 26.6k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 72| | 73| 26.6k| const size_t words = output.size(); 74| | 75| 26.6k| clear_mem(output.data(), output.size()); 76| | 77| 239k| for(size_t i = 0; i != g.size(); i += 2) { ------------------ | Branch (77:22): [True: 212k, False: 26.6k] ------------------ 78| 212k| const secure_vector& vec_0 = g[i].repr().get_word_vector(); 79| 212k| const secure_vector& vec_1 = g[i + 1].repr().get_word_vector(); 80| | 81| 212k| BOTAN_ASSERT_NOMSG(vec_0.size() >= words && vec_1.size() >= words); ------------------ | | 60| 212k| do { \ | | 61| 425k| if(!(expr)) \ | | ------------------ | | | Branch (61:12): [True: 212k, False: 0] | | | Branch (61:12): [True: 212k, False: 0] | | ------------------ | | 62| 212k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 212k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 82| | 83| 212k| const auto mask_0 = CT::Mask::is_equal(nibble, i); 84| 212k| const auto mask_1 = CT::Mask::is_equal(nibble, i + 1); 85| | 86| 1.00M| for(size_t w = 0; w != words; ++w) { ------------------ | Branch (86:25): [True: 788k, False: 212k] ------------------ 87| 788k| output[w] |= mask_0.if_set_return(vec_0[w]); 88| 788k| output[w] |= mask_1.if_set_return(vec_1[w]); 89| 788k| } 90| 212k| } 91| 26.6k|} _ZN5Botan10prime_p521Ev: 15| 59.2k|const BigInt& prime_p521() { 16| 59.2k| static const BigInt p521( 17| 59.2k| "0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF" 18| 59.2k| "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"); 19| | 20| 59.2k| return p521; 21| 59.2k|} _ZN5Botan9redc_p521ERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 23| 673k|void redc_p521(BigInt& x, secure_vector& ws) { 24| 673k| BOTAN_DEBUG_ASSERT(x.is_positive()); ------------------ | | 99| 673k| do { \ | | 100| 673k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 25| | 26| 673k| const size_t p_full_words = 521 / BOTAN_MP_WORD_BITS; ------------------ | | 50| 673k|#define BOTAN_MP_WORD_BITS 64 ------------------ 27| 673k| const size_t p_top_bits = 521 % BOTAN_MP_WORD_BITS; ------------------ | | 50| 673k|#define BOTAN_MP_WORD_BITS 64 ------------------ 28| 673k| const size_t p_words = p_full_words + 1; 29| | 30| 673k|#if(BOTAN_MP_WORD_BITS == 64) 31| 673k| static const word p521_words[p_words] = {0xFFFFFFFFFFFFFFFF, 32| 673k| 0xFFFFFFFFFFFFFFFF, 33| 673k| 0xFFFFFFFFFFFFFFFF, 34| 673k| 0xFFFFFFFFFFFFFFFF, 35| 673k| 0xFFFFFFFFFFFFFFFF, 36| 673k| 0xFFFFFFFFFFFFFFFF, 37| 673k| 0xFFFFFFFFFFFFFFFF, 38| 673k| 0xFFFFFFFFFFFFFFFF, 39| 673k| 0x1FF}; 40| |#else 41| | static const word p521_words[p_words] = {0xFFFFFFFF, 42| | 0xFFFFFFFF, 43| | 0xFFFFFFFF, 44| | 0xFFFFFFFF, 45| | 0xFFFFFFFF, 46| | 0xFFFFFFFF, 47| | 0xFFFFFFFF, 48| | 0xFFFFFFFF, 49| | 0xFFFFFFFF, 50| | 0xFFFFFFFF, 51| | 0xFFFFFFFF, 52| | 0xFFFFFFFF, 53| | 0xFFFFFFFF, 54| | 0xFFFFFFFF, 55| | 0xFFFFFFFF, 56| | 0xFFFFFFFF, 57| | 0x1FF}; 58| |#endif 59| | 60| 673k| if(ws.size() < p_words + 1) { ------------------ | Branch (60:7): [True: 0, False: 673k] ------------------ 61| 0| ws.resize(p_words + 1); 62| 0| } 63| | 64| 673k| clear_mem(ws.data(), ws.size()); 65| 673k| bigint_shr2(ws.data(), x.data(), std::min(x.size(), 2 * p_words), p_full_words, p_top_bits); 66| | 67| 673k| x.mask_bits(521); 68| 673k| x.grow_to(p_words); 69| | 70| | // Word-level carry will be zero 71| 673k| word carry = bigint_add3_nc(x.mutable_data(), x.data(), p_words, ws.data(), p_words); 72| 673k| BOTAN_ASSERT_EQUAL(carry, 0, "Final carry in P-521 reduction"); ------------------ | | 69| 673k| do { \ | | 70| 673k| if((expr1) != (expr2)) \ | | ------------------ | | | Branch (70:10): [True: 0, False: 673k] | | ------------------ | | 71| 673k| Botan::assertion_failure(#expr1 " == " #expr2, assertion_made, __func__, __FILE__, __LINE__); \ | | 72| 673k| } while(0) | | ------------------ | | | Branch (72:12): [Folded - Ignored] | | ------------------ ------------------ 73| | 74| 673k| const word top_word = x.word_at(p_full_words); 75| | 76| | /* 77| | * Check if we need to reduce modulo P 78| | * There are two possible cases: 79| | * - The result overflowed past 521 bits, in which case bit 522 will be set 80| | * - The result is exactly 2**521 - 1 81| | */ 82| 673k| const auto bit_522_set = CT::Mask::expand(top_word >> p_top_bits); 83| | 84| 673k| word and_512 = MP_WORD_MAX; 85| 6.06M| for(size_t i = 0; i != p_full_words; ++i) { ------------------ | Branch (85:22): [True: 5.39M, False: 673k] ------------------ 86| 5.39M| and_512 &= x.word_at(i); 87| 5.39M| } 88| 673k| const auto all_512_low_bits_set = CT::Mask::is_equal(and_512, MP_WORD_MAX); 89| 673k| const auto has_p521_top_word = CT::Mask::is_equal(top_word, 0x1FF); 90| 673k| const auto is_p521 = all_512_low_bits_set & has_p521_top_word; 91| | 92| 673k| const auto needs_reduction = is_p521 | bit_522_set; 93| | 94| 673k| bigint_cnd_sub(needs_reduction.value(), x.mutable_data(), p521_words, p_words); 95| 673k|} _ZN5Botan10prime_p192Ev: 122| 8.58k|const BigInt& prime_p192() { 123| 8.58k| static const BigInt p192("0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFF"); 124| 8.58k| return p192; 125| 8.58k|} _ZN5Botan9redc_p192ERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 127| 95.1k|void redc_p192(BigInt& x, secure_vector& ws) { 128| 95.1k| BOTAN_DEBUG_ASSERT(x.is_positive()); ------------------ | | 99| 95.1k| do { \ | | 100| 95.1k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 129| | 130| 95.1k| BOTAN_UNUSED(ws); ------------------ | | 118| 95.1k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 131| | 132| 95.1k| static const size_t p192_limbs = 192 / BOTAN_MP_WORD_BITS; ------------------ | | 50| 95.1k|#define BOTAN_MP_WORD_BITS 64 ------------------ 133| | 134| 95.1k| x.grow_to(2 * p192_limbs); 135| 95.1k| word* xw = x.mutable_data(); 136| | 137| 95.1k| const uint64_t X00 = get_uint32(xw, 0); 138| 95.1k| const uint64_t X01 = get_uint32(xw, 1); 139| 95.1k| const uint64_t X02 = get_uint32(xw, 2); 140| 95.1k| const uint64_t X03 = get_uint32(xw, 3); 141| 95.1k| const uint64_t X04 = get_uint32(xw, 4); 142| 95.1k| const uint64_t X05 = get_uint32(xw, 5); 143| 95.1k| const uint64_t X06 = get_uint32(xw, 6); 144| 95.1k| const uint64_t X07 = get_uint32(xw, 7); 145| 95.1k| const uint64_t X08 = get_uint32(xw, 8); 146| 95.1k| const uint64_t X09 = get_uint32(xw, 9); 147| 95.1k| const uint64_t X10 = get_uint32(xw, 10); 148| 95.1k| const uint64_t X11 = get_uint32(xw, 11); 149| | 150| 95.1k| const uint64_t S0 = X00 + X06 + X10; 151| 95.1k| const uint64_t S1 = X01 + X07 + X11; 152| 95.1k| const uint64_t S2 = X02 + X06 + X08 + X10; 153| 95.1k| const uint64_t S3 = X03 + X07 + X09 + X11; 154| 95.1k| const uint64_t S4 = X04 + X08 + X10; 155| 95.1k| const uint64_t S5 = X05 + X09 + X11; 156| | 157| 95.1k| uint64_t S = 0; 158| 95.1k| uint32_t R0 = 0, R1 = 0; 159| | 160| 95.1k| S += S0; 161| 95.1k| R0 = static_cast(S); 162| 95.1k| S >>= 32; 163| | 164| 95.1k| S += S1; 165| 95.1k| R1 = static_cast(S); 166| 95.1k| S >>= 32; 167| | 168| 95.1k| set_words(xw, 0, R0, R1); 169| | 170| 95.1k| S += S2; 171| 95.1k| R0 = static_cast(S); 172| 95.1k| S >>= 32; 173| | 174| 95.1k| S += S3; 175| 95.1k| R1 = static_cast(S); 176| 95.1k| S >>= 32; 177| | 178| 95.1k| set_words(xw, 2, R0, R1); 179| | 180| 95.1k| S += S4; 181| 95.1k| R0 = static_cast(S); 182| 95.1k| S >>= 32; 183| | 184| 95.1k| S += S5; 185| 95.1k| R1 = static_cast(S); 186| 95.1k| S >>= 32; 187| | 188| 95.1k| 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| 95.1k| static const word p192_mults[3][p192_limbs] = { 196| 95.1k|#if(BOTAN_MP_WORD_BITS == 64) 197| 95.1k| {0xFFFFFFFFFFFFFFFF, 0xFFFFFFFFFFFFFFFE, 0xFFFFFFFFFFFFFFFF}, 198| 95.1k| {0xFFFFFFFFFFFFFFFE, 0xFFFFFFFFFFFFFFFD, 0xFFFFFFFFFFFFFFFF}, 199| 95.1k| {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| 95.1k| }; 206| | 207| 95.1k| CT::unpoison(S); 208| 95.1k| BOTAN_ASSERT(S <= 2, "Expected overflow"); ------------------ | | 51| 95.1k| do { \ | | 52| 95.1k| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 0, False: 95.1k] | | ------------------ | | 53| 95.1k| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 95.1k| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 209| | 210| 95.1k| BOTAN_ASSERT_NOMSG(x.size() >= p192_limbs + 1); ------------------ | | 60| 95.1k| do { \ | | 61| 95.1k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 95.1k] | | ------------------ | | 62| 95.1k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 95.1k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 211| 95.1k| x.mask_bits(192); 212| 95.1k| word borrow = bigint_sub2(x.mutable_data(), p192_limbs + 1, p192_mults[S], p192_limbs); 213| 95.1k| BOTAN_DEBUG_ASSERT(borrow == 0 || borrow == 1); ------------------ | | 99| 95.1k| do { \ | | 100| 95.1k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 214| 95.1k| bigint_cnd_add(borrow, x.mutable_data(), p192_limbs + 1, p192_mults[0], p192_limbs); 215| 95.1k|} _ZN5Botan10prime_p224Ev: 217| 6.73k|const BigInt& prime_p224() { 218| 6.73k| static const BigInt p224("0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF000000000000000000000001"); 219| 6.73k| return p224; 220| 6.73k|} _ZN5Botan9redc_p224ERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 222| 66.6k|void redc_p224(BigInt& x, secure_vector& ws) { 223| 66.6k| BOTAN_DEBUG_ASSERT(x.is_positive()); ------------------ | | 99| 66.6k| do { \ | | 100| 66.6k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 224| | 225| 66.6k| static const size_t p224_limbs = (BOTAN_MP_WORD_BITS == 32) ? 7 : 4; ------------------ | | 50| 66.6k|#define BOTAN_MP_WORD_BITS 64 ------------------ | Branch (225:37): [Folded - Ignored] ------------------ 226| | 227| 66.6k| BOTAN_UNUSED(ws); ------------------ | | 118| 66.6k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 228| | 229| 66.6k| x.grow_to(2 * p224_limbs); 230| 66.6k| word* xw = x.mutable_data(); 231| | 232| 66.6k| const int64_t X00 = get_uint32(xw, 0); 233| 66.6k| const int64_t X01 = get_uint32(xw, 1); 234| 66.6k| const int64_t X02 = get_uint32(xw, 2); 235| 66.6k| const int64_t X03 = get_uint32(xw, 3); 236| 66.6k| const int64_t X04 = get_uint32(xw, 4); 237| 66.6k| const int64_t X05 = get_uint32(xw, 5); 238| 66.6k| const int64_t X06 = get_uint32(xw, 6); 239| 66.6k| const int64_t X07 = get_uint32(xw, 7); 240| 66.6k| const int64_t X08 = get_uint32(xw, 8); 241| 66.6k| const int64_t X09 = get_uint32(xw, 9); 242| 66.6k| const int64_t X10 = get_uint32(xw, 10); 243| 66.6k| const int64_t X11 = get_uint32(xw, 11); 244| 66.6k| const int64_t X12 = get_uint32(xw, 12); 245| 66.6k| const int64_t X13 = get_uint32(xw, 13); 246| | 247| | // One full copy of P224 is added, so the result is always positive 248| | 249| 66.6k| const int64_t S0 = 0x00000001 + X00 - X07 - X11; 250| 66.6k| const int64_t S1 = 0x00000000 + X01 - X08 - X12; 251| 66.6k| const int64_t S2 = 0x00000000 + X02 - X09 - X13; 252| 66.6k| const int64_t S3 = 0xFFFFFFFF + X03 + X07 + X11 - X10; 253| 66.6k| const int64_t S4 = 0xFFFFFFFF + X04 + X08 + X12 - X11; 254| 66.6k| const int64_t S5 = 0xFFFFFFFF + X05 + X09 + X13 - X12; 255| 66.6k| const int64_t S6 = 0xFFFFFFFF + X06 + X10 - X13; 256| | 257| 66.6k| int64_t S = 0; 258| 66.6k| uint32_t R0 = 0, R1 = 0; 259| | 260| 66.6k| S += S0; 261| 66.6k| R0 = static_cast(S); 262| 66.6k| S >>= 32; 263| | 264| 66.6k| S += S1; 265| 66.6k| R1 = static_cast(S); 266| 66.6k| S >>= 32; 267| | 268| 66.6k| set_words(xw, 0, R0, R1); 269| | 270| 66.6k| S += S2; 271| 66.6k| R0 = static_cast(S); 272| 66.6k| S >>= 32; 273| | 274| 66.6k| S += S3; 275| 66.6k| R1 = static_cast(S); 276| 66.6k| S >>= 32; 277| | 278| 66.6k| set_words(xw, 2, R0, R1); 279| | 280| 66.6k| S += S4; 281| 66.6k| R0 = static_cast(S); 282| 66.6k| S >>= 32; 283| | 284| 66.6k| S += S5; 285| 66.6k| R1 = static_cast(S); 286| 66.6k| S >>= 32; 287| | 288| 66.6k| set_words(xw, 4, R0, R1); 289| | 290| 66.6k| S += S6; 291| 66.6k| R0 = static_cast(S); 292| 66.6k| S >>= 32; 293| | 294| 66.6k| set_words(xw, 6, R0, 0); 295| | 296| 66.6k| static const word p224_mults[3][p224_limbs] = { 297| 66.6k|#if(BOTAN_MP_WORD_BITS == 64) 298| 66.6k| {0x0000000000000001, 0xFFFFFFFF00000000, 0xFFFFFFFFFFFFFFFF, 0x00000000FFFFFFFF}, 299| 66.6k| {0x0000000000000002, 0xFFFFFFFE00000000, 0xFFFFFFFFFFFFFFFF, 0x00000000FFFFFFFF}, 300| 66.6k| {0x0000000000000003, 0xFFFFFFFD00000000, 0xFFFFFFFFFFFFFFFF, 0x00000000FFFFFFFF}, 301| |#else 302| | {0x00000001, 0x00000000, 0x00000000, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF}, 303| | {0x00000002, 0x00000000, 0x00000000, 0xFFFFFFFE, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF}, 304| | {0x00000003, 0x00000000, 0x00000000, 0xFFFFFFFD, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF} 305| |#endif 306| | 307| 66.6k| }; 308| | 309| 66.6k| CT::unpoison(S); 310| 66.6k| BOTAN_ASSERT(S >= 0 && S <= 2, "Expected overflow"); ------------------ | | 51| 66.6k| do { \ | | 52| 133k| if(!(expr)) \ | | ------------------ | | | Branch (52:12): [True: 66.6k, False: 0] | | | Branch (52:12): [True: 66.6k, False: 0] | | ------------------ | | 53| 66.6k| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 66.6k| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 311| | 312| 66.6k| BOTAN_ASSERT_NOMSG(x.size() >= p224_limbs + 1); ------------------ | | 60| 66.6k| do { \ | | 61| 66.6k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 66.6k] | | ------------------ | | 62| 66.6k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 66.6k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 313| 66.6k| x.mask_bits(224); 314| 66.6k| word borrow = bigint_sub2(x.mutable_data(), p224_limbs + 1, p224_mults[S], p224_limbs); 315| 66.6k| BOTAN_DEBUG_ASSERT(borrow == 0 || borrow == 1); ------------------ | | 99| 66.6k| do { \ | | 100| 66.6k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 316| 66.6k| bigint_cnd_add(borrow, x.mutable_data(), p224_limbs + 1, p224_mults[0], p224_limbs); 317| 66.6k|} _ZN5Botan10prime_p256Ev: 319| 5.50k|const BigInt& prime_p256() { 320| 5.50k| static const BigInt p256("0xFFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFF"); 321| 5.50k| return p256; 322| 5.50k|} _ZN5Botan9redc_p256ERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 324| 63.2k|void redc_p256(BigInt& x, secure_vector& ws) { 325| 63.2k| BOTAN_DEBUG_ASSERT(x.is_positive()); ------------------ | | 99| 63.2k| do { \ | | 100| 63.2k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 326| | 327| 63.2k| static const size_t p256_limbs = (BOTAN_MP_WORD_BITS == 32) ? 8 : 4; ------------------ | | 50| 63.2k|#define BOTAN_MP_WORD_BITS 64 ------------------ | Branch (327:37): [Folded - Ignored] ------------------ 328| | 329| 63.2k| BOTAN_UNUSED(ws); ------------------ | | 118| 63.2k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 330| | 331| 63.2k| x.grow_to(2 * p256_limbs); 332| 63.2k| word* xw = x.mutable_data(); 333| | 334| 63.2k| const int64_t X00 = get_uint32(xw, 0); 335| 63.2k| const int64_t X01 = get_uint32(xw, 1); 336| 63.2k| const int64_t X02 = get_uint32(xw, 2); 337| 63.2k| const int64_t X03 = get_uint32(xw, 3); 338| 63.2k| const int64_t X04 = get_uint32(xw, 4); 339| 63.2k| const int64_t X05 = get_uint32(xw, 5); 340| 63.2k| const int64_t X06 = get_uint32(xw, 6); 341| 63.2k| const int64_t X07 = get_uint32(xw, 7); 342| 63.2k| const int64_t X08 = get_uint32(xw, 8); 343| 63.2k| const int64_t X09 = get_uint32(xw, 9); 344| 63.2k| const int64_t X10 = get_uint32(xw, 10); 345| 63.2k| const int64_t X11 = get_uint32(xw, 11); 346| 63.2k| const int64_t X12 = get_uint32(xw, 12); 347| 63.2k| const int64_t X13 = get_uint32(xw, 13); 348| 63.2k| const int64_t X14 = get_uint32(xw, 14); 349| 63.2k| const int64_t X15 = get_uint32(xw, 15); 350| | 351| | // Adds 6 * P-256 to prevent underflow 352| 63.2k| const int64_t S0 = 0xFFFFFFFA + X00 + X08 + X09 - (X11 + X12 + X13) - X14; 353| 63.2k| const int64_t S1 = 0xFFFFFFFF + X01 + X09 + X10 - X12 - (X13 + X14 + X15); 354| 63.2k| const int64_t S2 = 0xFFFFFFFF + X02 + X10 + X11 - (X13 + X14 + X15); 355| 63.2k| const int64_t S3 = 0x00000005 + X03 + (X11 + X12) * 2 + X13 - X15 - X08 - X09; 356| 63.2k| const int64_t S4 = 0x00000000 + X04 + (X12 + X13) * 2 + X14 - X09 - X10; 357| 63.2k| const int64_t S5 = 0x00000000 + X05 + (X13 + X14) * 2 + X15 - X10 - X11; 358| 63.2k| const int64_t S6 = 0x00000006 + X06 + X13 + X14 * 3 + X15 * 2 - X08 - X09; 359| 63.2k| const int64_t S7 = 0xFFFFFFFA + X07 + X15 * 3 + X08 - X10 - (X11 + X12 + X13); 360| | 361| 63.2k| int64_t S = 0; 362| | 363| 63.2k| uint32_t R0 = 0, R1 = 0; 364| | 365| 63.2k| S += S0; 366| 63.2k| R0 = static_cast(S); 367| 63.2k| S >>= 32; 368| | 369| 63.2k| S += S1; 370| 63.2k| R1 = static_cast(S); 371| 63.2k| S >>= 32; 372| | 373| 63.2k| set_words(xw, 0, R0, R1); 374| | 375| 63.2k| S += S2; 376| 63.2k| R0 = static_cast(S); 377| 63.2k| S >>= 32; 378| | 379| 63.2k| S += S3; 380| 63.2k| R1 = static_cast(S); 381| 63.2k| S >>= 32; 382| | 383| 63.2k| set_words(xw, 2, R0, R1); 384| | 385| 63.2k| S += S4; 386| 63.2k| R0 = static_cast(S); 387| 63.2k| S >>= 32; 388| | 389| 63.2k| S += S5; 390| 63.2k| R1 = static_cast(S); 391| 63.2k| S >>= 32; 392| | 393| 63.2k| set_words(xw, 4, R0, R1); 394| | 395| 63.2k| S += S6; 396| 63.2k| R0 = static_cast(S); 397| 63.2k| S >>= 32; 398| | 399| 63.2k| S += S7; 400| 63.2k| R1 = static_cast(S); 401| 63.2k| S >>= 32; 402| 63.2k| set_words(xw, 6, R0, R1); 403| | 404| 63.2k| 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| 63.2k| static const word p256_mults[11][p256_limbs] = { 410| 63.2k|#if(BOTAN_MP_WORD_BITS == 64) 411| 63.2k| {0xFFFFFFFFFFFFFFFF, 0x00000000FFFFFFFF, 0x0000000000000000, 0xFFFFFFFF00000001}, 412| 63.2k| {0xFFFFFFFFFFFFFFFE, 0x00000001FFFFFFFF, 0x0000000000000000, 0xFFFFFFFE00000002}, 413| 63.2k| {0xFFFFFFFFFFFFFFFD, 0x00000002FFFFFFFF, 0x0000000000000000, 0xFFFFFFFD00000003}, 414| 63.2k| {0xFFFFFFFFFFFFFFFC, 0x00000003FFFFFFFF, 0x0000000000000000, 0xFFFFFFFC00000004}, 415| 63.2k| {0xFFFFFFFFFFFFFFFB, 0x00000004FFFFFFFF, 0x0000000000000000, 0xFFFFFFFB00000005}, 416| 63.2k| {0xFFFFFFFFFFFFFFFA, 0x00000005FFFFFFFF, 0x0000000000000000, 0xFFFFFFFA00000006}, 417| 63.2k| {0xFFFFFFFFFFFFFFF9, 0x00000006FFFFFFFF, 0x0000000000000000, 0xFFFFFFF900000007}, 418| 63.2k| {0xFFFFFFFFFFFFFFF8, 0x00000007FFFFFFFF, 0x0000000000000000, 0xFFFFFFF800000008}, 419| 63.2k| {0xFFFFFFFFFFFFFFF7, 0x00000008FFFFFFFF, 0x0000000000000000, 0xFFFFFFF700000009}, 420| 63.2k| {0xFFFFFFFFFFFFFFF6, 0x00000009FFFFFFFF, 0x0000000000000000, 0xFFFFFFF60000000A}, 421| 63.2k| {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| 63.2k| }; 436| | 437| 63.2k| CT::unpoison(S); 438| 63.2k| BOTAN_ASSERT(S >= 0 && S <= 10, "Expected overflow"); ------------------ | | 51| 63.2k| do { \ | | 52| 126k| if(!(expr)) \ | | ------------------ | | | Branch (52:12): [True: 63.2k, False: 0] | | | Branch (52:12): [True: 63.2k, False: 0] | | ------------------ | | 53| 63.2k| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 63.2k| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 439| | 440| 63.2k| BOTAN_ASSERT_NOMSG(x.size() >= p256_limbs + 1); ------------------ | | 60| 63.2k| do { \ | | 61| 63.2k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 63.2k] | | ------------------ | | 62| 63.2k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 63.2k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 441| 63.2k| x.mask_bits(256); 442| 63.2k| word borrow = bigint_sub2(x.mutable_data(), p256_limbs + 1, p256_mults[S], p256_limbs); 443| 63.2k| BOTAN_DEBUG_ASSERT(borrow == 0 || borrow == 1); ------------------ | | 99| 63.2k| do { \ | | 100| 63.2k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 444| 63.2k| bigint_cnd_add(borrow, x.mutable_data(), p256_limbs + 1, p256_mults[0], p256_limbs); 445| 63.2k|} _ZN5Botan10prime_p384Ev: 447| 24.2k|const BigInt& prime_p384() { 448| 24.2k| static const BigInt p384( 449| 24.2k| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFF"); 450| 24.2k| return p384; 451| 24.2k|} _ZN5Botan9redc_p384ERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 453| 295k|void redc_p384(BigInt& x, secure_vector& ws) { 454| 295k| BOTAN_DEBUG_ASSERT(x.is_positive()); ------------------ | | 99| 295k| do { \ | | 100| 295k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 455| | 456| 295k| BOTAN_UNUSED(ws); ------------------ | | 118| 295k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 457| | 458| 295k| static const size_t p384_limbs = (BOTAN_MP_WORD_BITS == 32) ? 12 : 6; ------------------ | | 50| 295k|#define BOTAN_MP_WORD_BITS 64 ------------------ | Branch (458:37): [Folded - Ignored] ------------------ 459| | 460| 295k| x.grow_to(2 * p384_limbs); 461| 295k| word* xw = x.mutable_data(); 462| | 463| 295k| const int64_t X00 = get_uint32(xw, 0); 464| 295k| const int64_t X01 = get_uint32(xw, 1); 465| 295k| const int64_t X02 = get_uint32(xw, 2); 466| 295k| const int64_t X03 = get_uint32(xw, 3); 467| 295k| const int64_t X04 = get_uint32(xw, 4); 468| 295k| const int64_t X05 = get_uint32(xw, 5); 469| 295k| const int64_t X06 = get_uint32(xw, 6); 470| 295k| const int64_t X07 = get_uint32(xw, 7); 471| 295k| const int64_t X08 = get_uint32(xw, 8); 472| 295k| const int64_t X09 = get_uint32(xw, 9); 473| 295k| const int64_t X10 = get_uint32(xw, 10); 474| 295k| const int64_t X11 = get_uint32(xw, 11); 475| 295k| const int64_t X12 = get_uint32(xw, 12); 476| 295k| const int64_t X13 = get_uint32(xw, 13); 477| 295k| const int64_t X14 = get_uint32(xw, 14); 478| 295k| const int64_t X15 = get_uint32(xw, 15); 479| 295k| const int64_t X16 = get_uint32(xw, 16); 480| 295k| const int64_t X17 = get_uint32(xw, 17); 481| 295k| const int64_t X18 = get_uint32(xw, 18); 482| 295k| const int64_t X19 = get_uint32(xw, 19); 483| 295k| const int64_t X20 = get_uint32(xw, 20); 484| 295k| const int64_t X21 = get_uint32(xw, 21); 485| 295k| const int64_t X22 = get_uint32(xw, 22); 486| 295k| const int64_t X23 = get_uint32(xw, 23); 487| | 488| | // One copy of P-384 is added to prevent underflow 489| 295k| const int64_t S0 = 0xFFFFFFFF + X00 + X12 + X20 + X21 - X23; 490| 295k| const int64_t S1 = 0x00000000 + X01 + X13 + X22 + X23 - X12 - X20; 491| 295k| const int64_t S2 = 0x00000000 + X02 + X14 + X23 - X13 - X21; 492| 295k| const int64_t S3 = 0xFFFFFFFF + X03 + X12 + X15 + X20 + X21 - X14 - X22 - X23; 493| 295k| const int64_t S4 = 0xFFFFFFFE + X04 + X12 + X13 + X16 + X20 + X21 * 2 + X22 - X15 - X23 * 2; 494| 295k| const int64_t S5 = 0xFFFFFFFF + X05 + X13 + X14 + X17 + X21 + X22 * 2 + X23 - X16; 495| 295k| const int64_t S6 = 0xFFFFFFFF + X06 + X14 + X15 + X18 + X22 + X23 * 2 - X17; 496| 295k| const int64_t S7 = 0xFFFFFFFF + X07 + X15 + X16 + X19 + X23 - X18; 497| 295k| const int64_t S8 = 0xFFFFFFFF + X08 + X16 + X17 + X20 - X19; 498| 295k| const int64_t S9 = 0xFFFFFFFF + X09 + X17 + X18 + X21 - X20; 499| 295k| const int64_t SA = 0xFFFFFFFF + X10 + X18 + X19 + X22 - X21; 500| 295k| const int64_t SB = 0xFFFFFFFF + X11 + X19 + X20 + X23 - X22; 501| | 502| 295k| int64_t S = 0; 503| | 504| 295k| uint32_t R0 = 0, R1 = 0; 505| | 506| 295k| S += S0; 507| 295k| R0 = static_cast(S); 508| 295k| S >>= 32; 509| | 510| 295k| S += S1; 511| 295k| R1 = static_cast(S); 512| 295k| S >>= 32; 513| | 514| 295k| set_words(xw, 0, R0, R1); 515| | 516| 295k| S += S2; 517| 295k| R0 = static_cast(S); 518| 295k| S >>= 32; 519| | 520| 295k| S += S3; 521| 295k| R1 = static_cast(S); 522| 295k| S >>= 32; 523| | 524| 295k| set_words(xw, 2, R0, R1); 525| | 526| 295k| S += S4; 527| 295k| R0 = static_cast(S); 528| 295k| S >>= 32; 529| | 530| 295k| S += S5; 531| 295k| R1 = static_cast(S); 532| 295k| S >>= 32; 533| | 534| 295k| set_words(xw, 4, R0, R1); 535| | 536| 295k| S += S6; 537| 295k| R0 = static_cast(S); 538| 295k| S >>= 32; 539| | 540| 295k| S += S7; 541| 295k| R1 = static_cast(S); 542| 295k| S >>= 32; 543| | 544| 295k| set_words(xw, 6, R0, R1); 545| | 546| 295k| S += S8; 547| 295k| R0 = static_cast(S); 548| 295k| S >>= 32; 549| | 550| 295k| S += S9; 551| 295k| R1 = static_cast(S); 552| 295k| S >>= 32; 553| | 554| 295k| set_words(xw, 8, R0, R1); 555| | 556| 295k| S += SA; 557| 295k| R0 = static_cast(S); 558| 295k| S >>= 32; 559| | 560| 295k| S += SB; 561| 295k| R1 = static_cast(S); 562| 295k| S >>= 32; 563| | 564| 295k| set_words(xw, 10, R0, R1); 565| | 566| | /* 567| | This is a table of (i*P-384) % 2**384 for i in 1...4 568| | */ 569| 295k| static const word p384_mults[5][p384_limbs] = { 570| 295k|#if(BOTAN_MP_WORD_BITS == 64) 571| 295k| {0x00000000FFFFFFFF, 572| 295k| 0xFFFFFFFF00000000, 573| 295k| 0xFFFFFFFFFFFFFFFE, 574| 295k| 0xFFFFFFFFFFFFFFFF, 575| 295k| 0xFFFFFFFFFFFFFFFF, 576| 295k| 0xFFFFFFFFFFFFFFFF}, 577| 295k| {0x00000001FFFFFFFE, 578| 295k| 0xFFFFFFFE00000000, 579| 295k| 0xFFFFFFFFFFFFFFFD, 580| 295k| 0xFFFFFFFFFFFFFFFF, 581| 295k| 0xFFFFFFFFFFFFFFFF, 582| 295k| 0xFFFFFFFFFFFFFFFF}, 583| 295k| {0x00000002FFFFFFFD, 584| 295k| 0xFFFFFFFD00000000, 585| 295k| 0xFFFFFFFFFFFFFFFC, 586| 295k| 0xFFFFFFFFFFFFFFFF, 587| 295k| 0xFFFFFFFFFFFFFFFF, 588| 295k| 0xFFFFFFFFFFFFFFFF}, 589| 295k| {0x00000003FFFFFFFC, 590| 295k| 0xFFFFFFFC00000000, 591| 295k| 0xFFFFFFFFFFFFFFFB, 592| 295k| 0xFFFFFFFFFFFFFFFF, 593| 295k| 0xFFFFFFFFFFFFFFFF, 594| 295k| 0xFFFFFFFFFFFFFFFF}, 595| 295k| {0x00000004FFFFFFFB, 596| 295k| 0xFFFFFFFB00000000, 597| 295k| 0xFFFFFFFFFFFFFFFA, 598| 295k| 0xFFFFFFFFFFFFFFFF, 599| 295k| 0xFFFFFFFFFFFFFFFF, 600| 295k| 0xFFFFFFFFFFFFFFFF}, 601| | 602| |#else 603| | {0xFFFFFFFF, 604| | 0x00000000, 605| | 0x00000000, 606| | 0xFFFFFFFF, 607| | 0xFFFFFFFE, 608| | 0xFFFFFFFF, 609| | 0xFFFFFFFF, 610| | 0xFFFFFFFF, 611| | 0xFFFFFFFF, 612| | 0xFFFFFFFF, 613| | 0xFFFFFFFF, 614| | 0xFFFFFFFF}, 615| | {0xFFFFFFFE, 616| | 0x00000001, 617| | 0x00000000, 618| | 0xFFFFFFFE, 619| | 0xFFFFFFFD, 620| | 0xFFFFFFFF, 621| | 0xFFFFFFFF, 622| | 0xFFFFFFFF, 623| | 0xFFFFFFFF, 624| | 0xFFFFFFFF, 625| | 0xFFFFFFFF, 626| | 0xFFFFFFFF}, 627| | {0xFFFFFFFD, 628| | 0x00000002, 629| | 0x00000000, 630| | 0xFFFFFFFD, 631| | 0xFFFFFFFC, 632| | 0xFFFFFFFF, 633| | 0xFFFFFFFF, 634| | 0xFFFFFFFF, 635| | 0xFFFFFFFF, 636| | 0xFFFFFFFF, 637| | 0xFFFFFFFF, 638| | 0xFFFFFFFF}, 639| | {0xFFFFFFFC, 640| | 0x00000003, 641| | 0x00000000, 642| | 0xFFFFFFFC, 643| | 0xFFFFFFFB, 644| | 0xFFFFFFFF, 645| | 0xFFFFFFFF, 646| | 0xFFFFFFFF, 647| | 0xFFFFFFFF, 648| | 0xFFFFFFFF, 649| | 0xFFFFFFFF, 650| | 0xFFFFFFFF}, 651| | {0xFFFFFFFB, 652| | 0x00000004, 653| | 0x00000000, 654| | 0xFFFFFFFB, 655| | 0xFFFFFFFA, 656| | 0xFFFFFFFF, 657| | 0xFFFFFFFF, 658| | 0xFFFFFFFF, 659| | 0xFFFFFFFF, 660| | 0xFFFFFFFF, 661| | 0xFFFFFFFF, 662| | 0xFFFFFFFF}, 663| |#endif 664| 295k| }; 665| | 666| 295k| CT::unpoison(S); 667| 295k| BOTAN_ASSERT(S >= 0 && S <= 4, "Expected overflow"); ------------------ | | 51| 295k| do { \ | | 52| 590k| if(!(expr)) \ | | ------------------ | | | Branch (52:12): [True: 295k, False: 0] | | | Branch (52:12): [True: 295k, False: 0] | | ------------------ | | 53| 295k| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 295k| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 668| | 669| 295k| BOTAN_ASSERT_NOMSG(x.size() >= p384_limbs + 1); ------------------ | | 60| 295k| do { \ | | 61| 295k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 295k] | | ------------------ | | 62| 295k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 295k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 670| 295k| x.mask_bits(384); 671| 295k| word borrow = bigint_sub2(x.mutable_data(), p384_limbs + 1, p384_mults[S], p384_limbs); 672| 295k| BOTAN_DEBUG_ASSERT(borrow == 0 || borrow == 1); ------------------ | | 99| 295k| do { \ | | 100| 295k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 673| 295k| bigint_cnd_add(borrow, x.mutable_data(), p384_limbs + 1, p384_mults[0], p384_limbs); 674| 295k|} nistp_redc.cpp:_ZN5Botan12_GLOBAL__N_110get_uint32EPKmm: 103| 10.1M|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| 10.1M| return static_cast(xw[i / 2] >> ((i % 2) * 32)); 108| 10.1M|#endif 109| 10.1M|} nistp_redc.cpp:_ZN5Botan12_GLOBAL__N_19set_wordsEPmmjj: 111| 2.57M|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| 2.57M| x[i / 2] = (static_cast(R1) << 32) | R0; 117| 2.57M|#endif 118| 2.57M|} _ZN5Botan17sqrt_modulo_primeERKNS_6BigIntES2_: 38| 1.37k|BigInt sqrt_modulo_prime(const BigInt& a, const BigInt& p) { 39| 1.37k| BOTAN_ARG_CHECK(p > 1, "invalid prime"); ------------------ | | 30| 1.37k| do { \ | | 31| 1.37k| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 0, False: 1.37k] | | ------------------ | | 32| 1.37k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 1.37k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 40| 1.37k| BOTAN_ARG_CHECK(a < p, "value to solve for must be less than p"); ------------------ | | 30| 1.37k| do { \ | | 31| 1.37k| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 0, False: 1.37k] | | ------------------ | | 32| 1.37k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 1.37k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 41| 1.37k| BOTAN_ARG_CHECK(a >= 0, "value to solve for must not be negative"); ------------------ | | 30| 1.37k| do { \ | | 31| 1.37k| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 0, False: 1.37k] | | ------------------ | | 32| 1.37k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 1.37k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 42| | 43| | // some very easy cases 44| 1.37k| if(p == 2 || a <= 1) { ------------------ | Branch (44:7): [True: 0, False: 1.37k] | Branch (44:17): [True: 0, False: 1.37k] ------------------ 45| 0| return a; 46| 0| } 47| | 48| 1.37k| BOTAN_ARG_CHECK(p.is_odd(), "invalid prime"); ------------------ | | 30| 1.37k| do { \ | | 31| 1.37k| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 0, False: 1.37k] | | ------------------ | | 32| 1.37k| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 1.37k| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 49| | 50| 1.37k| if(jacobi(a, p) != 1) { // not a quadratic residue ------------------ | Branch (50:7): [True: 288, False: 1.08k] ------------------ 51| 288| return BigInt::from_s32(-1); 52| 288| } 53| | 54| 1.08k| Modular_Reducer mod_p(p); 55| 1.08k| auto monty_p = std::make_shared(p, mod_p); 56| | 57| 1.08k| if(p % 4 == 3) // The easy case ------------------ | Branch (57:7): [True: 672, False: 411] ------------------ 58| 672| { 59| 672| return monty_exp_vartime(monty_p, a, ((p + 1) >> 2)); 60| 672| } 61| | 62| | // Otherwise we have to use Shanks-Tonelli 63| 411| size_t s = low_zero_bits(p - 1); 64| 411| BigInt q = p >> s; 65| | 66| 411| q -= 1; 67| 411| q >>= 1; 68| | 69| 411| BigInt r = monty_exp_vartime(monty_p, a, q); 70| 411| BigInt n = mod_p.multiply(a, mod_p.square(r)); 71| 411| r = mod_p.multiply(r, a); 72| | 73| 411| if(n == 1) { ------------------ | Branch (73:7): [True: 39, False: 372] ------------------ 74| 39| return r; 75| 39| } 76| | 77| | // find random quadratic nonresidue z 78| 372| word z = 2; 79| 5.07k| for(;;) { 80| 5.07k| if(jacobi(BigInt::from_word(z), p) == -1) { // found one ------------------ | Branch (80:10): [True: 372, False: 4.69k] ------------------ 81| 372| break; 82| 372| } 83| | 84| 4.69k| 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| 4.69k| if(z >= 256) { ------------------ | Branch (91:10): [True: 0, False: 4.69k] ------------------ 92| 0| return BigInt::from_s32(-1); 93| 0| } 94| 4.69k| } 95| | 96| 372| BigInt c = monty_exp_vartime(monty_p, BigInt::from_word(z), (q << 1) + 1); 97| | 98| 10.2k| while(n > 1) { ------------------ | Branch (98:10): [True: 9.92k, False: 372] ------------------ 99| 9.92k| q = n; 100| | 101| 9.92k| size_t i = 0; 102| 435k| while(q != 1) { ------------------ | Branch (102:13): [True: 425k, False: 9.92k] ------------------ 103| 425k| q = mod_p.square(q); 104| 425k| ++i; 105| | 106| 425k| if(i >= s) { ------------------ | Branch (106:13): [True: 0, False: 425k] ------------------ 107| 0| return BigInt::from_s32(-1); 108| 0| } 109| 425k| } 110| | 111| 9.92k| BOTAN_ASSERT_NOMSG(s >= (i + 1)); // No underflow! ------------------ | | 60| 9.92k| do { \ | | 61| 9.92k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 9.92k] | | ------------------ | | 62| 9.92k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 9.92k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 112| 9.92k| c = monty_exp_vartime(monty_p, c, BigInt::power_of_2(s - i - 1)); 113| 9.92k| r = mod_p.multiply(r, c); 114| 9.92k| c = mod_p.square(c); 115| 9.92k| n = mod_p.multiply(n, c); 116| | 117| | // s decreases as the algorithm proceeds 118| 9.92k| BOTAN_ASSERT_NOMSG(s >= i); ------------------ | | 60| 9.92k| do { \ | | 61| 9.92k| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 9.92k] | | ------------------ | | 62| 9.92k| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 9.92k| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 119| 9.92k| s = i; 120| 9.92k| } 121| | 122| 372| return r; 123| 372|} _ZN5Botan6jacobiERKNS_6BigIntES2_: 128| 9.52k|int32_t jacobi(const BigInt& a, const BigInt& n) { 129| 9.52k| if(n.is_even() || n < 2) { ------------------ | Branch (129:7): [True: 0, False: 9.52k] | Branch (129:22): [True: 0, False: 9.52k] ------------------ 130| 0| throw Invalid_Argument("jacobi: second argument must be odd and > 1"); 131| 0| } 132| | 133| 9.52k| BigInt x = a % n; 134| 9.52k| BigInt y = n; 135| 9.52k| int32_t J = 1; 136| | 137| 123k| while(y > 1) { ------------------ | Branch (137:10): [True: 114k, False: 9.52k] ------------------ 138| 114k| x %= y; 139| 114k| if(x > y / 2) { ------------------ | Branch (139:10): [True: 49.9k, False: 64.4k] ------------------ 140| 49.9k| x = y - x; 141| 49.9k| if(y % 4 == 3) { ------------------ | Branch (141:13): [True: 24.3k, False: 25.5k] ------------------ 142| 24.3k| J = -J; 143| 24.3k| } 144| 49.9k| } 145| 114k| if(x.is_zero()) { ------------------ | Branch (145:10): [True: 0, False: 114k] ------------------ 146| 0| return 0; 147| 0| } 148| | 149| 114k| size_t shifts = low_zero_bits(x); 150| 114k| x >>= shifts; 151| 114k| if(shifts % 2) { ------------------ | Branch (151:10): [True: 35.7k, False: 78.6k] ------------------ 152| 35.7k| word y_mod_8 = y % 8; 153| 35.7k| if(y_mod_8 == 3 || y_mod_8 == 5) { ------------------ | Branch (153:13): [True: 8.59k, False: 27.1k] | Branch (153:29): [True: 8.49k, False: 18.6k] ------------------ 154| 17.0k| J = -J; 155| 17.0k| } 156| 35.7k| } 157| | 158| 114k| if(x % 4 == 3 && y % 4 == 3) { ------------------ | Branch (158:10): [True: 52.7k, False: 61.6k] | Branch (158:24): [True: 24.6k, False: 28.0k] ------------------ 159| 24.6k| J = -J; 160| 24.6k| } 161| 114k| std::swap(x, y); 162| 114k| } 163| 9.52k| return J; 164| 9.52k|} _ZN5Botan6squareERKNS_6BigIntE: 169| 626k|BigInt square(const BigInt& x) { 170| 626k| BigInt z = x; 171| 626k| secure_vector ws; 172| 626k| z.square(ws); 173| 626k| return z; 174| 626k|} _ZN5Botan13low_zero_bitsERKNS_6BigIntE: 179| 115k|size_t low_zero_bits(const BigInt& n) { 180| 115k| size_t low_zero = 0; 181| | 182| 115k| auto seen_nonempty_word = CT::Mask::cleared(); 183| | 184| 1.12M| for(size_t i = 0; i != n.size(); ++i) { ------------------ | Branch (184:22): [True: 1.00M, False: 115k] ------------------ 185| 1.00M| const word x = n.word_at(i); 186| | 187| | // ctz(0) will return sizeof(word) 188| 1.00M| 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| 1.00M| low_zero += seen_nonempty_word.if_not_set_return(tz_x); 193| | 194| 1.00M| seen_nonempty_word |= CT::Mask::expand(x); 195| 1.00M| } 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| 115k| return seen_nonempty_word.if_set_return(low_zero); 200| 115k|} _ZN5Botan17is_perfect_squareERKNS_6BigIntE: 328| 188|BigInt is_perfect_square(const BigInt& C) { 329| 188| if(C < 1) { ------------------ | Branch (329:7): [True: 0, False: 188] ------------------ 330| 0| throw Invalid_Argument("is_perfect_square requires C >= 1"); 331| 0| } 332| 188| if(C == 1) { ------------------ | Branch (332:7): [True: 0, False: 188] ------------------ 333| 0| return BigInt::one(); 334| 0| } 335| | 336| 188| const size_t n = C.bits(); 337| 188| const size_t m = (n + 1) / 2; 338| 188| const BigInt B = C + BigInt::power_of_2(m); 339| | 340| 188| BigInt X = BigInt::power_of_2(m) - 1; 341| 188| BigInt X2 = (X * X); 342| | 343| 1.26k| for(;;) { 344| 1.26k| X = (X2 + C) / (2 * X); 345| 1.26k| X2 = (X * X); 346| | 347| 1.26k| if(X2 < B) { ------------------ | Branch (347:10): [True: 188, False: 1.07k] ------------------ 348| 188| break; 349| 188| } 350| 1.26k| } 351| | 352| 188| if(X2 == C) { ------------------ | Branch (352:7): [True: 0, False: 188] ------------------ 353| 0| return X; 354| 188| } else { 355| 188| return BigInt::zero(); 356| 188| } 357| 188|} _ZN5Botan23is_lucas_probable_primeERKNS_6BigIntERKNS_15Modular_ReducerE: 18| 504|bool is_lucas_probable_prime(const BigInt& C, const Modular_Reducer& mod_C) { 19| 504| if(C == 2 || C == 3 || C == 5 || C == 7 || C == 11 || C == 13) { ------------------ | Branch (19:7): [True: 0, False: 504] | Branch (19:17): [True: 1, False: 503] | Branch (19:27): [True: 0, False: 503] | Branch (19:37): [True: 0, False: 503] | Branch (19:47): [True: 1, False: 502] | Branch (19:58): [True: 1, False: 501] ------------------ 20| 3| return true; 21| 3| } 22| | 23| 501| if(C <= 1 || C.is_even()) { ------------------ | Branch (23:7): [True: 0, False: 501] | Branch (23:17): [True: 0, False: 501] ------------------ 24| 0| return false; 25| 0| } 26| | 27| 501| BigInt D = BigInt::from_word(5); 28| | 29| 3.08k| for(;;) { 30| 3.08k| int32_t j = jacobi(D, C); 31| 3.08k| if(j == 0) { ------------------ | Branch (31:10): [True: 0, False: 3.08k] ------------------ 32| 0| return false; 33| 0| } 34| | 35| 3.08k| if(j == -1) { ------------------ | Branch (35:10): [True: 501, False: 2.58k] ------------------ 36| 501| break; 37| 501| } 38| | 39| | // Check 5, -7, 9, -11, 13, -15, 17, ... 40| 2.58k| if(D.is_negative()) { ------------------ | Branch (40:10): [True: 1.18k, False: 1.39k] ------------------ 41| 1.18k| D.flip_sign(); 42| 1.18k| D += 2; 43| 1.39k| } else { 44| 1.39k| D += 2; 45| 1.39k| D.flip_sign(); 46| 1.39k| } 47| | 48| 2.58k| if(D == 17 && is_perfect_square(C).is_nonzero()) { ------------------ | Branch (48:10): [True: 188, False: 2.39k] | Branch (48:10): [True: 0, False: 2.58k] | Branch (48:21): [True: 0, False: 188] ------------------ 49| 0| return false; 50| 0| } 51| 2.58k| } 52| | 53| 501| const BigInt K = C + 1; 54| 501| const size_t K_bits = K.bits() - 1; 55| | 56| 501| BigInt U = BigInt::one(); 57| 501| BigInt V = BigInt::one(); 58| | 59| 501| BigInt Ut, Vt, U2, V2; 60| | 61| 91.5k| for(size_t i = 0; i != K_bits; ++i) { ------------------ | Branch (61:22): [True: 91.0k, False: 501] ------------------ 62| 91.0k| const bool k_bit = K.get_bit(K_bits - 1 - i); 63| | 64| 91.0k| Ut = mod_C.multiply(U, V); 65| | 66| 91.0k| Vt = mod_C.reduce(mod_C.square(V) + mod_C.multiply(D, mod_C.square(U))); 67| 91.0k| Vt.ct_cond_add(Vt.is_odd(), C); 68| 91.0k| Vt >>= 1; 69| 91.0k| Vt = mod_C.reduce(Vt); 70| | 71| 91.0k| U = Ut; 72| 91.0k| V = Vt; 73| | 74| 91.0k| U2 = mod_C.reduce(Ut + Vt); 75| 91.0k| U2.ct_cond_add(U2.is_odd(), C); 76| 91.0k| U2 >>= 1; 77| | 78| 91.0k| V2 = mod_C.reduce(Vt + Ut * D); 79| 91.0k| V2.ct_cond_add(V2.is_odd(), C); 80| 91.0k| V2 >>= 1; 81| | 82| 91.0k| U.ct_cond_assign(k_bit, U2); 83| 91.0k| V.ct_cond_assign(k_bit, V2); 84| 91.0k| } 85| | 86| 501| return (U == 0); 87| 501|} _ZN5Botan28is_bailie_psw_probable_primeERKNS_6BigIntERKNS_15Modular_ReducerE: 89| 582|bool is_bailie_psw_probable_prime(const BigInt& n, const Modular_Reducer& mod_n) { 90| 582| if(n == 2) { ------------------ | Branch (90:7): [True: 1, False: 581] ------------------ 91| 1| return true; 92| 581| } else if(n <= 1 || n.is_even()) { ------------------ | Branch (92:14): [True: 1, False: 580] | Branch (92:24): [True: 4, False: 576] ------------------ 93| 5| return false; 94| 5| } 95| | 96| 576| auto monty_n = std::make_shared(n, mod_n); 97| 576| const auto base = BigInt::from_word(2); 98| 576| return passes_miller_rabin_test(n, mod_n, monty_n, base) && is_lucas_probable_prime(n, mod_n); ------------------ | Branch (98:11): [True: 504, False: 72] | Branch (98:64): [True: 502, False: 2] ------------------ 99| 582|} _ZN5Botan28is_bailie_psw_probable_primeERKNS_6BigIntE: 101| 582|bool is_bailie_psw_probable_prime(const BigInt& n) { 102| 582| Modular_Reducer mod_n(n); 103| 582| return is_bailie_psw_probable_prime(n, mod_n); 104| 582|} _ZN5Botan24passes_miller_rabin_testERKNS_6BigIntERKNS_15Modular_ReducerERKNSt3__110shared_ptrINS_17Montgomery_ParamsEEES2_: 109| 576| const BigInt& a) { 110| 576| if(n < 3 || n.is_even()) { ------------------ | Branch (110:7): [True: 0, False: 576] | Branch (110:16): [True: 0, False: 576] ------------------ 111| 0| return false; 112| 0| } 113| | 114| 576| BOTAN_ASSERT_NOMSG(n > 1); ------------------ | | 60| 576| do { \ | | 61| 576| if(!(expr)) \ | | ------------------ | | | Branch (61:10): [True: 0, False: 576] | | ------------------ | | 62| 576| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 576| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 115| | 116| 576| const BigInt n_minus_1 = n - 1; 117| 576| const size_t s = low_zero_bits(n_minus_1); 118| 576| const BigInt nm1_s = n_minus_1 >> s; 119| 576| const size_t n_bits = n.bits(); 120| | 121| 576| const size_t powm_window = 4; 122| | 123| 576| auto powm_a_n = monty_precompute(monty_n, a, powm_window); 124| | 125| 576| BigInt y = monty_execute(*powm_a_n, nm1_s, n_bits); 126| | 127| 576| if(y == 1 || y == n_minus_1) { ------------------ | Branch (127:7): [True: 27, False: 549] | Branch (127:17): [True: 15, False: 534] ------------------ 128| 42| return true; 129| 42| } 130| | 131| 5.19k| for(size_t i = 1; i != s; ++i) { ------------------ | Branch (131:22): [True: 5.12k, False: 71] ------------------ 132| 5.12k| y = mod_n.square(y); 133| | 134| 5.12k| if(y == 1) { // found a non-trivial square root ------------------ | Branch (134:10): [True: 1, False: 5.12k] ------------------ 135| 1| return false; 136| 1| } 137| | 138| | /* 139| | -1 is the trivial square root of unity, so ``a`` is not a 140| | witness for this number - give up 141| | */ 142| 5.12k| if(y == n_minus_1) { ------------------ | Branch (142:10): [True: 462, False: 4.66k] ------------------ 143| 462| return true; 144| 462| } 145| 5.12k| } 146| | 147| 71| return false; 148| 534|} _ZN5Botan15Modular_ReducerC2ERKNS_6BigIntE: 19| 2.95k|Modular_Reducer::Modular_Reducer(const BigInt& mod) { 20| 2.95k| if(mod < 0) { ------------------ | Branch (20:7): [True: 5, False: 2.94k] ------------------ 21| 5| throw Invalid_Argument("Modular_Reducer: modulus must be positive"); 22| 5| } 23| | 24| | // Left uninitialized if mod == 0 25| 2.94k| m_mod_words = 0; 26| | 27| 2.94k| if(mod > 0) { ------------------ | Branch (27:7): [True: 2.92k, False: 21] ------------------ 28| 2.92k| m_modulus = mod; 29| 2.92k| m_mod_words = m_modulus.sig_words(); 30| | 31| | // Compute mu = floor(2^{2k} / m) 32| 2.92k| m_mu.set_bit(2 * BOTAN_MP_WORD_BITS * m_mod_words); ------------------ | | 50| 2.92k|#define BOTAN_MP_WORD_BITS 64 ------------------ 33| 2.92k| m_mu = ct_divide(m_mu, m_modulus); 34| 2.92k| } 35| 2.94k|} _ZNK5Botan15Modular_Reducer6reduceERKNS_6BigIntE: 37| 1.19M|BigInt Modular_Reducer::reduce(const BigInt& x) const { 38| 1.19M| BigInt r; 39| 1.19M| secure_vector ws; 40| 1.19M| reduce(r, x, ws); 41| 1.19M| return r; 42| 1.19M|} _ZNK5Botan15Modular_Reducer6reduceERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 69| 1.19M|void Modular_Reducer::reduce(BigInt& t1, const BigInt& x, secure_vector& ws) const { 70| 1.19M| if(&t1 == &x) { ------------------ | Branch (70:7): [True: 0, False: 1.19M] ------------------ 71| 0| throw Invalid_State("Modular_Reducer arguments cannot alias"); 72| 0| } 73| 1.19M| if(m_mod_words == 0) { ------------------ | Branch (73:7): [True: 0, False: 1.19M] ------------------ 74| 0| throw Invalid_State("Modular_Reducer: Never initalized"); 75| 0| } 76| | 77| 1.19M| const size_t x_sw = x.sig_words(); 78| | 79| 1.19M| if(x_sw > 2 * m_mod_words) { ------------------ | Branch (79:7): [True: 0, False: 1.19M] ------------------ 80| | // too big, fall back to slow boat division 81| 0| t1 = ct_modulo(x, m_modulus); 82| 0| return; 83| 0| } 84| | 85| 1.19M| t1 = x; 86| 1.19M| t1.set_sign(BigInt::Positive); 87| 1.19M| t1 >>= (BOTAN_MP_WORD_BITS * (m_mod_words - 1)); ------------------ | | 50| 1.19M|#define BOTAN_MP_WORD_BITS 64 ------------------ 88| | 89| 1.19M| t1.mul(m_mu, ws); 90| 1.19M| t1 >>= (BOTAN_MP_WORD_BITS * (m_mod_words + 1)); ------------------ | | 50| 1.19M|#define BOTAN_MP_WORD_BITS 64 ------------------ 91| | 92| | // TODO add masked mul to avoid computing high bits 93| 1.19M| t1.mul(m_modulus, ws); 94| 1.19M| t1.mask_bits(BOTAN_MP_WORD_BITS * (m_mod_words + 1)); ------------------ | | 50| 1.19M|#define BOTAN_MP_WORD_BITS 64 ------------------ 95| | 96| 1.19M| 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| 1.19M| const word t1_neg = t1.is_negative(); 104| | 105| 1.19M| if(ws.size() < m_mod_words + 2) { ------------------ | Branch (105:7): [True: 6.11k, False: 1.19M] ------------------ 106| 6.11k| ws.resize(m_mod_words + 2); 107| 6.11k| } 108| 1.19M| clear_mem(ws.data(), ws.size()); 109| 1.19M| ws[m_mod_words + 1] = t1_neg; 110| | 111| 1.19M| t1.add(ws.data(), m_mod_words + 2, BigInt::Positive); 112| | 113| | // Per HAC this step requires at most 2 subtractions 114| 1.19M| t1.ct_reduce_below(m_modulus, ws, 2); 115| | 116| 1.19M| cnd_rev_sub(t1.is_nonzero() && x.is_negative(), t1, m_modulus.data(), m_modulus.size(), ws); ------------------ | Branch (116:16): [True: 1.19M, False: 2.16k] | Branch (116:35): [True: 62.3k, False: 1.13M] ------------------ 117| 1.19M|} reducer.cpp:_ZN5Botan12_GLOBAL__N_111cnd_rev_subEbRNS_6BigIntEPKmmRNSt3__16vectorImNS_16secure_allocatorImEEEE: 49| 1.19M|void cnd_rev_sub(bool cnd, BigInt& x, const word y[], size_t y_sw, secure_vector& ws) { 50| 1.19M| if(x.sign() != BigInt::Positive) { ------------------ | Branch (50:7): [True: 0, False: 1.19M] ------------------ 51| 0| throw Invalid_State("BigInt::sub_rev requires this is positive"); 52| 0| } 53| | 54| 1.19M| const size_t x_sw = x.sig_words(); 55| | 56| 1.19M| const size_t max_words = std::max(x_sw, y_sw); 57| 1.19M| ws.resize(std::max(x_sw, y_sw)); 58| 1.19M| clear_mem(ws.data(), ws.size()); 59| 1.19M| x.grow_to(max_words); 60| | 61| 1.19M| const int32_t relative_size = bigint_sub_abs(ws.data(), x.data(), x_sw, y, y_sw); 62| | 63| 1.19M| x.cond_flip_sign((relative_size > 0) && cnd); ------------------ | Branch (63:21): [True: 0, False: 1.19M] | Branch (63:44): [True: 0, False: 0] ------------------ 64| 1.19M| bigint_cnd_swap(cnd, x.mutable_data(), ws.data(), max_words); 65| 1.19M|} _ZN5Botan4EMSA6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 35| 415|std::unique_ptr EMSA::create(std::string_view algo_spec) { 36| 415| SCAN_Name req(algo_spec); 37| | 38| 415|#if defined(BOTAN_HAS_EMSA_PKCS1) 39| 415| if(req.algo_name() == "EMSA_PKCS1" || req.algo_name() == "PKCS1v15" || req.algo_name() == "EMSA-PKCS1-v1_5" || ------------------ | Branch (39:7): [True: 0, False: 415] | Branch (39:7): [True: 372, False: 43] | Branch (39:42): [True: 0, False: 415] | Branch (39:75): [True: 0, False: 415] ------------------ 40| 415| req.algo_name() == "EMSA3") { ------------------ | Branch (40:7): [True: 372, False: 43] ------------------ 41| 372| if(req.arg_count() == 2 && req.arg(0) == "Raw") { ------------------ | Branch (41:10): [True: 0, False: 372] | Branch (41:10): [True: 0, False: 372] | Branch (41:34): [True: 0, False: 0] ------------------ 42| 0| return std::make_unique(req.arg(1)); 43| 372| } else if(req.arg_count() == 1) { ------------------ | Branch (43:17): [True: 372, False: 0] ------------------ 44| 372| if(req.arg(0) == "Raw") { ------------------ | Branch (44:13): [True: 0, False: 372] ------------------ 45| 0| return std::make_unique(); 46| 372| } else { 47| 372| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (47:21): [True: 372, False: 0] ------------------ 48| 372| return std::make_unique(std::move(hash)); 49| 372| } 50| 372| } 51| 372| } 52| 372| } 53| 43|#endif 54| | 55| 43|#if defined(BOTAN_HAS_EMSA_PSSR) 56| 43| if(req.algo_name() == "PSS_Raw" || req.algo_name() == "PSSR_Raw") { ------------------ | Branch (56:7): [True: 0, False: 43] | Branch (56:7): [True: 0, False: 43] | Branch (56:39): [True: 0, False: 43] ------------------ 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(std::move(hash), salt_size); 62| 0| } else { 63| 0| return std::make_unique(std::move(hash)); 64| 0| } 65| 0| } 66| 0| } 67| 0| } 68| | 69| 43| if(req.algo_name() == "PSS" || req.algo_name() == "PSSR" || req.algo_name() == "EMSA-PSS" || ------------------ | Branch (69:7): [True: 0, False: 43] | Branch (69:7): [True: 42, False: 1] | Branch (69:35): [True: 0, False: 43] | Branch (69:64): [True: 0, False: 43] ------------------ 70| 43| req.algo_name() == "PSS-MGF1" || req.algo_name() == "EMSA4") { ------------------ | Branch (70:7): [True: 0, False: 43] | Branch (70:40): [True: 42, False: 1] ------------------ 71| 42| if(req.arg_count_between(1, 3) && req.arg(1, "MGF1") == "MGF1") { ------------------ | Branch (71:10): [True: 42, False: 0] | Branch (71:10): [True: 42, False: 0] | Branch (71:41): [True: 42, False: 0] ------------------ 72| 42| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (72:18): [True: 42, False: 0] ------------------ 73| 42| if(req.arg_count() == 3) { ------------------ | Branch (73:16): [True: 42, False: 0] ------------------ 74| 42| const size_t salt_size = req.arg_as_integer(2, 0); 75| 42| return std::make_unique(std::move(hash), salt_size); 76| 42| } else { 77| 0| return std::make_unique(std::move(hash)); 78| 0| } 79| 42| } 80| 42| } 81| 42| } 82| 1|#endif 83| | 84| 1|#if defined(BOTAN_HAS_ISO_9796) 85| 1| if(req.algo_name() == "ISO_9796_DS2") { ------------------ | Branch (85:7): [True: 0, False: 1] ------------------ 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(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| 1| if(req.algo_name() == "ISO_9796_DS3") { ------------------ | Branch (95:7): [True: 0, False: 1] ------------------ 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(std::move(hash), implicit); 100| 0| } 101| 0| } 102| 0| } 103| 1|#endif 104| | 105| 1|#if defined(BOTAN_HAS_EMSA_X931) 106| 1| if(req.algo_name() == "EMSA_X931" || req.algo_name() == "EMSA2" || req.algo_name() == "X9.31") { ------------------ | Branch (106:7): [True: 0, False: 1] | Branch (106:7): [True: 0, False: 1] | Branch (106:41): [True: 0, False: 1] | Branch (106:71): [True: 0, False: 1] ------------------ 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(std::move(hash)); 110| 0| } 111| 0| } 112| 0| } 113| 1|#endif 114| | 115| 1|#if defined(BOTAN_HAS_EMSA_RAW) 116| 1| if(req.algo_name() == "Raw") { ------------------ | Branch (116:7): [True: 0, False: 1] ------------------ 117| 0| if(req.arg_count() == 0) { ------------------ | Branch (117:10): [True: 0, False: 0] ------------------ 118| 0| return std::make_unique(); 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(hash->output_length()); 123| 0| } 124| 0| } 125| 0| } 126| 1|#endif 127| | 128| 1| return nullptr; 129| 1|} _ZN5Botan4EMSA15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 131| 415|std::unique_ptr EMSA::create_or_throw(std::string_view algo_spec) { 132| 415| auto emsa = EMSA::create(algo_spec); 133| 415| if(emsa) { ------------------ | Branch (133:7): [True: 414, False: 1] ------------------ 134| 414| return emsa; 135| 414| } 136| 1| throw Algorithm_Not_Found(algo_spec); 137| 415|} _ZN5Botan13EMSA_PKCS1v156updateEPKhm: 44| 372|void EMSA_PKCS1v15::update(const uint8_t input[], size_t length) { m_hash->update(input, length); } _ZN5Botan13EMSA_PKCS1v158raw_dataEv: 46| 372|std::vector EMSA_PKCS1v15::raw_data() { return m_hash->final_stdvec(); } _ZN5Botan13EMSA_PKCS1v156verifyERKNSt3__16vectorIhNS1_9allocatorIhEEEES7_m: 58| 345|bool EMSA_PKCS1v15::verify(const std::vector& coded, const std::vector& raw, size_t key_bits) { 59| 345| if(raw.size() != m_hash->output_length()) { ------------------ | Branch (59:7): [True: 0, False: 345] ------------------ 60| 0| return false; 61| 0| } 62| | 63| 345| try { 64| 345| return (coded == emsa3_encoding(raw, key_bits, m_hash_id.data(), m_hash_id.size())); 65| 345| } catch(...) { 66| 35| return false; 67| 35| } 68| 345|} _ZN5Botan13EMSA_PKCS1v15C2ENSt3__110unique_ptrINS_12HashFunctionENS1_14default_deleteIS3_EEEE: 70| 372|EMSA_PKCS1v15::EMSA_PKCS1v15(std::unique_ptr hash) : m_hash(std::move(hash)) { 71| 372| m_hash_id = pkcs_hash_id(m_hash->name()); 72| 372|} emsa_pkcs1.cpp:_ZN5Botan12_GLOBAL__N_114emsa3_encodingERKNSt3__16vectorIhNS1_9allocatorIhEEEEmPKhm: 20| 345| size_t hash_id_length) { 21| 345| size_t output_length = output_bits / 8; 22| 345| if(output_length < hash_id_length + msg.size() + 10) { ------------------ | Branch (22:7): [True: 35, False: 310] ------------------ 23| 35| throw Encoding_Error("emsa3_encoding: Output length is too small"); 24| 35| } 25| | 26| 310| std::vector T(output_length); 27| 310| const size_t P_LENGTH = output_length - msg.size() - hash_id_length - 2; 28| | 29| 310| T[0] = 0x01; 30| 310| set_mem(&T[1], P_LENGTH, 0xFF); 31| 310| T[P_LENGTH + 1] = 0x00; 32| | 33| 310| if(hash_id_length > 0) { ------------------ | Branch (33:7): [True: 310, False: 0] ------------------ 34| 310| BOTAN_ASSERT_NONNULL(hash_id); ------------------ | | 87| 310| do { \ | | 88| 310| if((ptr) == nullptr) \ | | ------------------ | | | Branch (88:10): [True: 0, False: 310] | | ------------------ | | 89| 310| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 90| 310| } while(0) | | ------------------ | | | Branch (90:12): [Folded - Ignored] | | ------------------ ------------------ 35| 310| buffer_insert(T, P_LENGTH + 2, hash_id, hash_id_length); 36| 310| } 37| | 38| 310| buffer_insert(T, output_length - msg.size(), msg.data(), msg.size()); 39| 310| return T; 40| 345|} _ZN5Botan4PSSRC2ENSt3__110unique_ptrINS_12HashFunctionENS1_14default_deleteIS3_EEEEm: 140| 42| m_hash(std::move(hash)), m_salt_size(salt_size), m_required_salt_len(true) {} _ZN5Botan4PSSR6updateEPKhm: 145| 42|void PSSR::update(const uint8_t input[], size_t length) { m_hash->update(input, length); } _ZN5Botan4PSSR8raw_dataEv: 150| 42|std::vector PSSR::raw_data() { return m_hash->final_stdvec(); } _ZN5Botan4PSSR6verifyERKNSt3__16vectorIhNS1_9allocatorIhEEEES7_m: 162| 41|bool PSSR::verify(const std::vector& coded, const std::vector& raw, size_t key_bits) { 163| 41| size_t salt_size = 0; 164| 41| const bool ok = pss_verify(*m_hash, coded, raw, key_bits, &salt_size); 165| | 166| 41| if(m_required_salt_len && salt_size != m_salt_size) { ------------------ | Branch (166:7): [True: 41, False: 0] | Branch (166:30): [True: 40, False: 1] ------------------ 167| 40| return false; 168| 40| } 169| | 170| 1| return ok; 171| 41|} pssr.cpp:_ZN5Botan12_GLOBAL__N_110pss_verifyERNS_12HashFunctionERKNSt3__16vectorIhNS3_9allocatorIhEEEES9_mPm: 60| 41| size_t* out_salt_size) { 61| 41| const size_t HASH_SIZE = hash.output_length(); 62| 41| const size_t KEY_BYTES = (key_bits + 7) / 8; 63| | 64| 41| if(key_bits < 8 * HASH_SIZE + 9) { ------------------ | Branch (64:7): [True: 0, False: 41] ------------------ 65| 0| return false; 66| 0| } 67| | 68| 41| if(message_hash.size() != HASH_SIZE) { ------------------ | Branch (68:7): [True: 0, False: 41] ------------------ 69| 0| return false; 70| 0| } 71| | 72| 41| if(pss_repr.size() > KEY_BYTES || pss_repr.size() <= 1) { ------------------ | Branch (72:7): [True: 5, False: 36] | Branch (72:38): [True: 1, False: 35] ------------------ 73| 6| return false; 74| 6| } 75| | 76| 35| if(pss_repr[pss_repr.size() - 1] != 0xBC) { ------------------ | Branch (76:7): [True: 9, False: 26] ------------------ 77| 9| return false; 78| 9| } 79| | 80| 26| std::vector coded = pss_repr; 81| 26| if(coded.size() < KEY_BYTES) { ------------------ | Branch (81:7): [True: 21, False: 5] ------------------ 82| 21| std::vector temp(KEY_BYTES); 83| 21| buffer_insert(temp, KEY_BYTES - coded.size(), coded); 84| 21| coded = temp; 85| 21| } 86| | 87| 26| const size_t TOP_BITS = 8 * ((key_bits + 7) / 8) - key_bits; 88| 26| if(TOP_BITS > 8 - high_bit(coded[0])) { ------------------ | Branch (88:7): [True: 2, False: 24] ------------------ 89| 2| return false; 90| 2| } 91| | 92| 24| uint8_t* DB = coded.data(); 93| 24| const size_t DB_size = coded.size() - HASH_SIZE - 1; 94| | 95| 24| const uint8_t* H = &coded[DB_size]; 96| 24| const size_t H_size = HASH_SIZE; 97| | 98| 24| mgf1_mask(hash, H, H_size, DB, DB_size); 99| 24| DB[0] &= 0xFF >> TOP_BITS; 100| | 101| 24| size_t salt_offset = 0; 102| 35| for(size_t j = 0; j != DB_size; ++j) { ------------------ | Branch (102:22): [True: 35, False: 0] ------------------ 103| 35| if(DB[j] == 0x01) { ------------------ | Branch (103:10): [True: 10, False: 25] ------------------ 104| 10| salt_offset = j + 1; 105| 10| break; 106| 10| } 107| 25| if(DB[j]) { ------------------ | Branch (107:10): [True: 14, False: 11] ------------------ 108| 14| return false; 109| 14| } 110| 25| } 111| 10| if(salt_offset == 0) { ------------------ | Branch (111:7): [True: 0, False: 10] ------------------ 112| 0| return false; 113| 0| } 114| | 115| 10| const size_t salt_size = DB_size - salt_offset; 116| | 117| 90| for(size_t j = 0; j != 8; ++j) { ------------------ | Branch (117:22): [True: 80, False: 10] ------------------ 118| 80| hash.update(0); 119| 80| } 120| 10| hash.update(message_hash); 121| 10| hash.update(&DB[salt_offset], salt_size); 122| | 123| 10| const std::vector H2 = hash.final_stdvec(); 124| | 125| 10| const bool ok = constant_time_compare(H, H2.data(), HASH_SIZE); 126| | 127| 10| if(out_salt_size && ok) { ------------------ | Branch (127:7): [True: 10, False: 0] | Branch (127:24): [True: 0, False: 10] ------------------ 128| 0| *out_salt_size = salt_size; 129| 0| } 130| | 131| 10| return ok; 132| 10|} _ZN5Botan12pkcs_hash_idENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 78| 372|std::vector pkcs_hash_id(std::string_view name) { 79| | // Special case for SSL/TLS RSA signatures 80| 372| if(name == "Parallel(MD5,SHA-1)") { ------------------ | Branch (80:7): [True: 0, False: 372] ------------------ 81| 0| return std::vector(); 82| 0| } 83| | 84| | // If you add a value to this function, also update test_hash_id.cpp 85| | 86| 372| if(name == "MD5") { ------------------ | Branch (86:7): [True: 127, False: 245] ------------------ 87| 127| return std::vector(MD5_PKCS_ID, MD5_PKCS_ID + sizeof(MD5_PKCS_ID)); 88| 127| } 89| | 90| 245| if(name == "RIPEMD-160") { ------------------ | Branch (90:7): [True: 0, False: 245] ------------------ 91| 0| return std::vector(RIPEMD_160_PKCS_ID, RIPEMD_160_PKCS_ID + sizeof(RIPEMD_160_PKCS_ID)); 92| 0| } 93| | 94| 245| if(name == "SHA-1") { ------------------ | Branch (94:7): [True: 157, False: 88] ------------------ 95| 157| return std::vector(SHA_1_PKCS_ID, SHA_1_PKCS_ID + sizeof(SHA_1_PKCS_ID)); 96| 157| } 97| | 98| 88| if(name == "SHA-224") { ------------------ | Branch (98:7): [True: 50, False: 38] ------------------ 99| 50| return std::vector(SHA_224_PKCS_ID, SHA_224_PKCS_ID + sizeof(SHA_224_PKCS_ID)); 100| 50| } 101| | 102| 38| if(name == "SHA-256") { ------------------ | Branch (102:7): [True: 11, False: 27] ------------------ 103| 11| return std::vector(SHA_256_PKCS_ID, SHA_256_PKCS_ID + sizeof(SHA_256_PKCS_ID)); 104| 11| } 105| | 106| 27| if(name == "SHA-384") { ------------------ | Branch (106:7): [True: 8, False: 19] ------------------ 107| 8| return std::vector(SHA_384_PKCS_ID, SHA_384_PKCS_ID + sizeof(SHA_384_PKCS_ID)); 108| 8| } 109| | 110| 19| if(name == "SHA-512") { ------------------ | Branch (110:7): [True: 2, False: 17] ------------------ 111| 2| return std::vector(SHA_512_PKCS_ID, SHA_512_PKCS_ID + sizeof(SHA_512_PKCS_ID)); 112| 2| } 113| | 114| 17| if(name == "SHA-512-256") { ------------------ | Branch (114:7): [True: 17, False: 0] ------------------ 115| 17| return std::vector(SHA_512_256_PKCS_ID, SHA_512_256_PKCS_ID + sizeof(SHA_512_256_PKCS_ID)); 116| 17| } 117| | 118| 0| if(name == "SHA-3(224)") { ------------------ | Branch (118:7): [True: 0, False: 0] ------------------ 119| 0| return std::vector(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(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(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(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(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|} _ZN5Botan9mgf1_maskERNS_12HashFunctionEPKhmPhm: 15| 24|void mgf1_mask(HashFunction& hash, const uint8_t in[], size_t in_len, uint8_t out[], size_t out_len) { 16| 24| uint32_t counter = 0; 17| | 18| 24| std::vector buffer(hash.output_length()); 19| 252| while(out_len) { ------------------ | Branch (19:10): [True: 228, False: 24] ------------------ 20| 228| hash.update(in, in_len); 21| 228| hash.update_be(counter); 22| 228| hash.final(buffer.data()); 23| | 24| 228| const size_t xored = std::min(buffer.size(), out_len); 25| 228| xor_buf(out, buffer.data(), xored); 26| 228| out += xored; 27| 228| out_len -= xored; 28| | 29| 228| ++counter; 30| 228| } 31| 24|} _ZN5Botan20Curve25519_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 47| 1|Curve25519_PublicKey::Curve25519_PublicKey(const AlgorithmIdentifier& /*unused*/, std::span key_bits) { 48| 1| m_public.assign(key_bits.begin(), key_bits.end()); 49| | 50| 1| size_check(m_public.size(), "public key"); 51| 1|} curve25519.cpp:_ZN5Botan12_GLOBAL__N_110size_checkEmPKc: 25| 1|void size_check(size_t size, const char* thing) { 26| 1| if(size != 32) { ------------------ | Branch (26:7): [True: 1, False: 0] ------------------ 27| 1| throw Decoding_Error(fmt("Invalid size {} for Curve2551 {}", size, thing)); 28| 1| } 29| 1|} _ZN5Botan12DH_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 16| 34|DH_PublicKey::DH_PublicKey(const AlgorithmIdentifier& alg_id, std::span key_bits) { 17| 34| m_public_key = std::make_shared(alg_id, key_bits, DL_Group_Format::ANSI_X9_42); 18| 34|} _ZN5Botan12DL_PublicKeyC2ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEENS_15DL_Group_FormatE: 44| 70| m_group(alg_id.parameters(), format), m_public_key(decode_single_bigint(key_bits)) {} dl_scheme.cpp:_ZN5Botan12_GLOBAL__N_120decode_single_bigintENSt3__14spanIKhLm18446744073709551615EEE: 17| 54|BigInt decode_single_bigint(std::span key_bits) { 18| 54| BigInt x; 19| 54| BER_Decoder(key_bits).decode(x); 20| 54| return x; 21| 54|} _ZN5Botan8DL_Group19BER_decode_DL_groupEPKhmNS_15DL_Group_FormatENS_15DL_Group_SourceE: 119| 70| DL_Group_Source source) { 120| 70| BigInt p, q, g; 121| | 122| 70| BER_Decoder decoder(data, data_len); 123| 70| BER_Decoder ber = decoder.start_sequence(); 124| | 125| 70| if(format == DL_Group_Format::ANSI_X9_57) { ------------------ | Branch (125:7): [True: 35, False: 35] ------------------ 126| 35| ber.decode(p).decode(q).decode(g).verify_end(); 127| 35| } else if(format == DL_Group_Format::ANSI_X9_42) { ------------------ | Branch (127:14): [True: 34, False: 1] ------------------ 128| 34| ber.decode(p).decode(g).decode(q).discard_remaining(); 129| 34| } else if(format == DL_Group_Format::PKCS_3) { ------------------ | Branch (129:14): [True: 0, False: 1] ------------------ 130| | // q is left as zero 131| 0| ber.decode(p).decode(g).discard_remaining(); 132| 1| } else { 133| 1| throw Invalid_Argument("Unknown DL_Group encoding"); 134| 1| } 135| | 136| 69| return std::make_shared(p, q, g, source); 137| 70|} _ZNK5Botan8DL_Group4dataEv: 316| 8|const DL_Group_Data& DL_Group::data() const { 317| 8| if(m_data) { ------------------ | Branch (317:7): [True: 8, False: 0] ------------------ 318| 8| return *m_data; 319| 8| } 320| | 321| 0| throw Invalid_State("DL_Group uninitialized"); 322| 8|} _ZNK5Botan8DL_Group5has_qEv: 440| 8|bool DL_Group::has_q() const { return data().q_is_set(); } _ZN5Botan8DL_GroupC2EPKhmNS_15DL_Group_FormatE: 552| 70|DL_Group::DL_Group(const uint8_t ber[], size_t ber_len, DL_Group_Format format) { 553| 70| m_data = BER_decode_DL_group(ber, ber_len, format, DL_Group_Source::ExternalSource); 554| 70|} _ZNK5Botan13DL_Group_Data8q_is_setEv: 90| 8| bool q_is_set() const { return m_q_bits > 0; } _ZN5Botan13DL_Group_DataC2ERKNS_6BigIntES3_S3_NS_15DL_Group_SourceE: 39| 65| m_source(source) {} _ZN5Botan13DL_Group_DataD2Ev: 41| 54| ~DL_Group_Data() = default; _ZN5Botan13DSA_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 43| 36|DSA_PublicKey::DSA_PublicKey(const AlgorithmIdentifier& alg_id, std::span key_bits) { 44| 36| m_public_key = std::make_shared(alg_id, key_bits, DL_Group_Format::ANSI_X9_57); 45| | 46| 36| BOTAN_ARG_CHECK(m_public_key->group().has_q(), "Q parameter must be set for DSA"); ------------------ | | 30| 36| do { \ | | 31| 36| if(!(expr)) \ | | ------------------ | | | Branch (31:10): [True: 1, False: 35] | | ------------------ | | 32| 36| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 33| 36| } while(0) | | ------------------ | | | Branch (33:12): [Folded - Ignored] | | ------------------ ------------------ 47| 36|} _ZNK5Botan13DSA_PublicKey27create_x509_verification_opERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE: 238| 7| const AlgorithmIdentifier& signature_algorithm, std::string_view provider) const { 239| 7| if(provider == "base" || provider.empty()) { ------------------ | Branch (239:7): [True: 0, False: 7] | Branch (239:29): [True: 7, False: 0] ------------------ 240| 7| return std::make_unique(this->m_public_key, signature_algorithm); 241| 7| } 242| | 243| 0| throw Provider_Not_Found(algo_name(), provider); 244| 7|} dsa.cpp:_ZN5Botan12_GLOBAL__N_126DSA_Verification_OperationC2ERKNSt3__110shared_ptrIKNS_12DL_PublicKeyEEERKNS_19AlgorithmIdentifierE: 187| 7| PK_Ops::Verification_with_Hash(alg_id, "DSA"), m_key(key) {} _ZN5Botan8CurveGFp11choose_reprERKNS_6BigIntES3_S3_: 564| 361|std::shared_ptr CurveGFp::choose_repr(const BigInt& p, const BigInt& a, const BigInt& b) { 565| 361| if(p == prime_p192()) { ------------------ | Branch (565:7): [True: 3, False: 358] ------------------ 566| 3| return std::make_shared(a, b); 567| 3| } 568| 358| if(p == prime_p224()) { ------------------ | Branch (568:7): [True: 1, False: 357] ------------------ 569| 1| return std::make_shared(a, b); 570| 1| } 571| 357| if(p == prime_p256()) { ------------------ | Branch (571:7): [True: 1, False: 356] ------------------ 572| 1| return std::make_shared(a, b); 573| 1| } 574| 356| if(p == prime_p384()) { ------------------ | Branch (574:7): [True: 1, False: 355] ------------------ 575| 1| return std::make_shared(a, b); 576| 1| } 577| 355| if(p == prime_p521()) { ------------------ | Branch (577:7): [True: 1, False: 354] ------------------ 578| 1| return std::make_shared(a, b); 579| 1| } 580| | 581| 354| return std::make_shared(p, a, b); 582| 355|} 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| 7| 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| 7| } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P1925get_pEv: 265| 8.22k| const BigInt& get_p() const override { return prime_p192(); } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST5get_aEv: 165| 633| const BigInt& get_a() const override { return m_a; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST5get_bEv: 167| 633| const BigInt& get_b() const override { return m_b; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST11get_p_wordsEv: 171| 35.3k| size_t get_p_words() const override { return m_p_words; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST11get_ws_sizeEv: 173| 1.29M| size_t get_ws_size() const override { return 2 * m_p_words; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST6is_oneERKNS_6BigIntE: 179| 165| bool is_one(const BigInt& x) const override { return x == 1; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST9a_is_zeroEv: 161| 67.7k| bool a_is_zero() const override { return false; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST12a_is_minus_3Ev: 163| 67.7k| bool a_is_minus_3() const override { return true; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST9get_a_repEv: 175| 918| const BigInt& get_a_rep() const override { return m_a; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST9get_b_repEv: 177| 1.79k| const BigInt& get_b_rep() const override { return m_b; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST9get_1_repEv: 169| 1.10k| const BigInt& get_1_rep() const override { return m_1; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST14invert_elementERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 211| 94|BigInt CurveGFp_NIST::invert_element(const BigInt& x, secure_vector& ws) const { 212| 94| BOTAN_UNUSED(ws); ------------------ | | 118| 94|#define BOTAN_UNUSED Botan::ignore_params ------------------ 213| 94| return inverse_mod(x, get_p()); 214| 94|} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST12to_curve_repERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 181| 834| void to_curve_rep(BigInt& x, secure_vector& ws) const override { redc_mod_p(x, ws); } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST14from_curve_repERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 183| 2.87k| void from_curve_rep(BigInt& x, secure_vector& ws) const override { redc_mod_p(x, ws); } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST15curve_mul_wordsERNS_6BigIntEPKmmRKS2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 217| 664k| BigInt& z, const word x_w[], size_t x_size, const BigInt& y, secure_vector& ws) const { 218| 664k| BOTAN_DEBUG_ASSERT(y.sig_words() <= m_p_words); ------------------ | | 99| 664k| do { \ | | 100| 664k| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 219| | 220| 664k| if(ws.size() < get_ws_size()) { ------------------ | Branch (220:7): [True: 0, False: 664k] ------------------ 221| 0| ws.resize(get_ws_size()); 222| 0| } 223| | 224| 664k| const size_t output_size = 2 * m_p_words; 225| 664k| if(z.size() < output_size) { ------------------ | Branch (225:7): [True: 46.0k, False: 618k] ------------------ 226| 46.0k| z.grow_to(output_size); 227| 46.0k| } 228| | 229| 664k| bigint_mul(z.mutable_data(), 230| 664k| z.size(), 231| 664k| x_w, 232| 664k| x_size, 233| 664k| std::min(m_p_words, x_size), 234| 664k| y.data(), 235| 664k| y.size(), 236| 664k| std::min(m_p_words, y.size()), 237| 664k| ws.data(), 238| 664k| ws.size()); 239| | 240| 664k| this->redc_mod_p(z, ws); 241| 664k|} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST15curve_sqr_wordsERNS_6BigIntEPKmmRNSt3__16vectorImNS_16secure_allocatorImEEEE: 243| 525k|void CurveGFp_NIST::curve_sqr_words(BigInt& z, const word x[], size_t x_size, secure_vector& ws) const { 244| 525k| if(ws.size() < get_ws_size()) { ------------------ | Branch (244:7): [True: 1.08k, False: 524k] ------------------ 245| 1.08k| ws.resize(get_ws_size()); 246| 1.08k| } 247| | 248| 525k| const size_t output_size = 2 * m_p_words; 249| 525k| if(z.size() < output_size) { ------------------ | Branch (249:7): [True: 73.4k, False: 452k] ------------------ 250| 73.4k| z.grow_to(output_size); 251| 73.4k| } 252| | 253| 525k| bigint_sqr(z.mutable_data(), output_size, x, x_size, std::min(m_p_words, x_size), ws.data(), ws.size()); 254| | 255| 525k| this->redc_mod_p(z, ws); 256| 525k|} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P19210redc_mod_pERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 268| 95.1k| void redc_mod_p(BigInt& x, secure_vector& ws) const override { redc_p192(x, ws); } curve_gfp.cpp:_ZN5Botan12_GLOBAL__N_113CurveGFp_P224C2ERKNS_6BigIntES4_: 276| 1| CurveGFp_P224(const BigInt& a, const BigInt& b) : CurveGFp_NIST(224, a, b) {} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P2245get_pEv: 278| 6.37k| const BigInt& get_p() const override { return prime_p224(); } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P22410redc_mod_pERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 281| 66.6k| void redc_mod_p(BigInt& x, secure_vector& ws) const override { redc_p224(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| 5.15k| const BigInt& get_p() const override { return prime_p256(); } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P25614invert_elementERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 299| 26|BigInt CurveGFp_P256::invert_element(const BigInt& x, secure_vector& ws) const { 300| 26| BigInt r, p2, p4, p8, p16, p32, tmp; 301| | 302| 26| curve_sqr(r, x, ws); 303| | 304| 26| curve_mul(p2, r, x, ws); 305| 26| curve_sqr(r, p2, ws); 306| 26| curve_sqr_tmp(r, tmp, ws); 307| | 308| 26| curve_mul(p4, r, p2, ws); 309| | 310| 26| curve_sqr(r, p4, ws); 311| 104| for(size_t i = 0; i != 3; ++i) { ------------------ | Branch (311:22): [True: 78, False: 26] ------------------ 312| 78| curve_sqr_tmp(r, tmp, ws); 313| 78| } 314| 26| curve_mul(p8, r, p4, ws); 315| | 316| 26| curve_sqr(r, p8, ws); 317| 208| for(size_t i = 0; i != 7; ++i) { ------------------ | Branch (317:22): [True: 182, False: 26] ------------------ 318| 182| curve_sqr_tmp(r, tmp, ws); 319| 182| } 320| 26| curve_mul(p16, r, p8, ws); 321| | 322| 26| curve_sqr(r, p16, ws); 323| 416| for(size_t i = 0; i != 15; ++i) { ------------------ | Branch (323:22): [True: 390, False: 26] ------------------ 324| 390| curve_sqr_tmp(r, tmp, ws); 325| 390| } 326| 26| curve_mul(p32, r, p16, ws); 327| | 328| 26| curve_sqr(r, p32, ws); 329| 832| for(size_t i = 0; i != 31; ++i) { ------------------ | Branch (329:22): [True: 806, False: 26] ------------------ 330| 806| curve_sqr_tmp(r, tmp, ws); 331| 806| } 332| 26| curve_mul_tmp(r, x, tmp, ws); 333| | 334| 3.35k| for(size_t i = 0; i != 32 * 4; ++i) { ------------------ | Branch (334:22): [True: 3.32k, False: 26] ------------------ 335| 3.32k| curve_sqr_tmp(r, tmp, ws); 336| 3.32k| } 337| 26| curve_mul_tmp(r, p32, tmp, ws); 338| | 339| 858| for(size_t i = 0; i != 32; ++i) { ------------------ | Branch (339:22): [True: 832, False: 26] ------------------ 340| 832| curve_sqr_tmp(r, tmp, ws); 341| 832| } 342| 26| curve_mul_tmp(r, p32, tmp, ws); 343| | 344| 442| for(size_t i = 0; i != 16; ++i) { ------------------ | Branch (344:22): [True: 416, False: 26] ------------------ 345| 416| curve_sqr_tmp(r, tmp, ws); 346| 416| } 347| 26| curve_mul_tmp(r, p16, tmp, ws); 348| 234| for(size_t i = 0; i != 8; ++i) { ------------------ | Branch (348:22): [True: 208, False: 26] ------------------ 349| 208| curve_sqr_tmp(r, tmp, ws); 350| 208| } 351| 26| curve_mul_tmp(r, p8, tmp, ws); 352| | 353| 130| for(size_t i = 0; i != 4; ++i) { ------------------ | Branch (353:22): [True: 104, False: 26] ------------------ 354| 104| curve_sqr_tmp(r, tmp, ws); 355| 104| } 356| 26| curve_mul_tmp(r, p4, tmp, ws); 357| | 358| 78| for(size_t i = 0; i != 2; ++i) { ------------------ | Branch (358:22): [True: 52, False: 26] ------------------ 359| 52| curve_sqr_tmp(r, tmp, ws); 360| 52| } 361| 26| curve_mul_tmp(r, p2, tmp, ws); 362| | 363| 78| for(size_t i = 0; i != 2; ++i) { ------------------ | Branch (363:22): [True: 52, False: 26] ------------------ 364| 52| curve_sqr_tmp(r, tmp, ws); 365| 52| } 366| 26| curve_mul_tmp(r, x, tmp, ws); 367| | 368| 26| return r; 369| 26|} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST13curve_sqr_tmpERNS_6BigIntES3_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 197| 126k| void curve_sqr_tmp(BigInt& x, BigInt& tmp, secure_vector& ws) const { 198| 126k| curve_sqr(tmp, x, ws); 199| 126k| x.swap(tmp); 200| 126k| } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_NIST13curve_mul_tmpERNS_6BigIntERKS2_S3_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 192| 3.72k| void curve_mul_tmp(BigInt& x, const BigInt& y, BigInt& tmp, secure_vector& ws) const { 193| 3.72k| curve_mul(tmp, x, y, ws); 194| 3.72k| x.swap(tmp); 195| 3.72k| } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P25610redc_mod_pERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 294| 63.2k| void redc_mod_p(BigInt& x, secure_vector& ws) const override { redc_p256(x, ws); } curve_gfp.cpp:_ZN5Botan12_GLOBAL__N_113CurveGFp_P384C2ERKNS_6BigIntES4_: 376| 1| CurveGFp_P384(const BigInt& a, const BigInt& b) : CurveGFp_NIST(384, a, b) {} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P3845get_pEv: 378| 23.9k| const BigInt& get_p() const override { return prime_p384(); } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P38414invert_elementERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 386| 114|BigInt CurveGFp_P384::invert_element(const BigInt& x, secure_vector& ws) const { 387| | // From https://briansmith.org/ecc-inversion-addition-chains-01 388| | 389| 114| BigInt r, x2, x3, x15, x30, tmp, rl; 390| | 391| 114| r = x; 392| 114| curve_sqr_tmp(r, tmp, ws); 393| 114| curve_mul_tmp(r, x, tmp, ws); 394| 114| x2 = r; 395| | 396| 114| curve_sqr_tmp(r, tmp, ws); 397| 114| curve_mul_tmp(r, x, tmp, ws); 398| | 399| 114| x3 = r; 400| | 401| 456| for(size_t i = 0; i != 3; ++i) { ------------------ | Branch (401:22): [True: 342, False: 114] ------------------ 402| 342| curve_sqr_tmp(r, tmp, ws); 403| 342| } 404| 114| curve_mul_tmp(r, x3, tmp, ws); 405| | 406| 114| rl = r; 407| 798| for(size_t i = 0; i != 6; ++i) { ------------------ | Branch (407:22): [True: 684, False: 114] ------------------ 408| 684| curve_sqr_tmp(r, tmp, ws); 409| 684| } 410| 114| curve_mul_tmp(r, rl, tmp, ws); 411| | 412| 456| for(size_t i = 0; i != 3; ++i) { ------------------ | Branch (412:22): [True: 342, False: 114] ------------------ 413| 342| curve_sqr_tmp(r, tmp, ws); 414| 342| } 415| 114| curve_mul_tmp(r, x3, tmp, ws); 416| | 417| 114| x15 = r; 418| 1.82k| for(size_t i = 0; i != 15; ++i) { ------------------ | Branch (418:22): [True: 1.71k, False: 114] ------------------ 419| 1.71k| curve_sqr_tmp(r, tmp, ws); 420| 1.71k| } 421| 114| curve_mul_tmp(r, x15, tmp, ws); 422| | 423| 114| x30 = r; 424| 3.53k| for(size_t i = 0; i != 30; ++i) { ------------------ | Branch (424:22): [True: 3.42k, False: 114] ------------------ 425| 3.42k| curve_sqr_tmp(r, tmp, ws); 426| 3.42k| } 427| 114| curve_mul_tmp(r, x30, tmp, ws); 428| | 429| 114| rl = r; 430| 6.95k| for(size_t i = 0; i != 60; ++i) { ------------------ | Branch (430:22): [True: 6.84k, False: 114] ------------------ 431| 6.84k| curve_sqr_tmp(r, tmp, ws); 432| 6.84k| } 433| 114| curve_mul_tmp(r, rl, tmp, ws); 434| | 435| 114| rl = r; 436| 13.7k| for(size_t i = 0; i != 120; ++i) { ------------------ | Branch (436:22): [True: 13.6k, False: 114] ------------------ 437| 13.6k| curve_sqr_tmp(r, tmp, ws); 438| 13.6k| } 439| 114| curve_mul_tmp(r, rl, tmp, ws); 440| | 441| 1.82k| for(size_t i = 0; i != 15; ++i) { ------------------ | Branch (441:22): [True: 1.71k, False: 114] ------------------ 442| 1.71k| curve_sqr_tmp(r, tmp, ws); 443| 1.71k| } 444| 114| curve_mul_tmp(r, x15, tmp, ws); 445| | 446| 3.64k| for(size_t i = 0; i != 31; ++i) { ------------------ | Branch (446:22): [True: 3.53k, False: 114] ------------------ 447| 3.53k| curve_sqr_tmp(r, tmp, ws); 448| 3.53k| } 449| 114| curve_mul_tmp(r, x30, tmp, ws); 450| | 451| 342| for(size_t i = 0; i != 2; ++i) { ------------------ | Branch (451:22): [True: 228, False: 114] ------------------ 452| 228| curve_sqr_tmp(r, tmp, ws); 453| 228| } 454| 114| curve_mul_tmp(r, x2, tmp, ws); 455| | 456| 10.8k| for(size_t i = 0; i != 94; ++i) { ------------------ | Branch (456:22): [True: 10.7k, False: 114] ------------------ 457| 10.7k| curve_sqr_tmp(r, tmp, ws); 458| 10.7k| } 459| 114| curve_mul_tmp(r, x30, tmp, ws); 460| | 461| 342| for(size_t i = 0; i != 2; ++i) { ------------------ | Branch (461:22): [True: 228, False: 114] ------------------ 462| 228| curve_sqr_tmp(r, tmp, ws); 463| 228| } 464| | 465| 114| curve_mul_tmp(r, x, tmp, ws); 466| | 467| 114| return r; 468| 114|} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P38410redc_mod_pERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 381| 295k| void redc_mod_p(BigInt& x, secure_vector& ws) const override { redc_p384(x, ws); } curve_gfp.cpp:_ZN5Botan12_GLOBAL__N_113CurveGFp_P521C2ERKNS_6BigIntES4_: 475| 1| CurveGFp_P521(const BigInt& a, const BigInt& b) : CurveGFp_NIST(521, a, b) {} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P5215get_pEv: 477| 58.9k| const BigInt& get_p() const override { return prime_p521(); } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P52114invert_elementERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 485| 148|BigInt CurveGFp_P521::invert_element(const BigInt& x, secure_vector& ws) const { 486| | // Addition chain from https://eprint.iacr.org/2014/852.pdf section 487| | 488| 148| BigInt r; 489| 148| BigInt rl; 490| 148| BigInt a7; 491| 148| BigInt tmp; 492| | 493| 148| curve_sqr(r, x, ws); 494| 148| curve_mul_tmp(r, x, tmp, ws); 495| | 496| 148| curve_sqr_tmp(r, tmp, ws); 497| 148| curve_mul_tmp(r, x, tmp, ws); 498| | 499| 148| rl = r; 500| | 501| 592| for(size_t i = 0; i != 3; ++i) { ------------------ | Branch (501:22): [True: 444, False: 148] ------------------ 502| 444| curve_sqr_tmp(r, tmp, ws); 503| 444| } 504| 148| curve_mul_tmp(r, rl, tmp, ws); 505| | 506| 148| curve_sqr_tmp(r, tmp, ws); 507| 148| curve_mul_tmp(r, x, tmp, ws); 508| 148| a7 = r; // need this value later 509| | 510| 148| curve_sqr_tmp(r, tmp, ws); 511| 148| curve_mul_tmp(r, x, tmp, ws); 512| | 513| 148| rl = r; 514| 1.33k| for(size_t i = 0; i != 8; ++i) { ------------------ | Branch (514:22): [True: 1.18k, False: 148] ------------------ 515| 1.18k| curve_sqr_tmp(r, tmp, ws); 516| 1.18k| } 517| 148| curve_mul_tmp(r, rl, tmp, ws); 518| | 519| 148| rl = r; 520| 2.51k| for(size_t i = 0; i != 16; ++i) { ------------------ | Branch (520:22): [True: 2.36k, False: 148] ------------------ 521| 2.36k| curve_sqr_tmp(r, tmp, ws); 522| 2.36k| } 523| 148| curve_mul_tmp(r, rl, tmp, ws); 524| | 525| 148| rl = r; 526| 4.88k| for(size_t i = 0; i != 32; ++i) { ------------------ | Branch (526:22): [True: 4.73k, False: 148] ------------------ 527| 4.73k| curve_sqr_tmp(r, tmp, ws); 528| 4.73k| } 529| 148| curve_mul_tmp(r, rl, tmp, ws); 530| | 531| 148| rl = r; 532| 9.62k| for(size_t i = 0; i != 64; ++i) { ------------------ | Branch (532:22): [True: 9.47k, False: 148] ------------------ 533| 9.47k| curve_sqr_tmp(r, tmp, ws); 534| 9.47k| } 535| 148| curve_mul_tmp(r, rl, tmp, ws); 536| | 537| 148| rl = r; 538| 19.0k| for(size_t i = 0; i != 128; ++i) { ------------------ | Branch (538:22): [True: 18.9k, False: 148] ------------------ 539| 18.9k| curve_sqr_tmp(r, tmp, ws); 540| 18.9k| } 541| 148| curve_mul_tmp(r, rl, tmp, ws); 542| | 543| 148| rl = r; 544| 38.0k| for(size_t i = 0; i != 256; ++i) { ------------------ | Branch (544:22): [True: 37.8k, False: 148] ------------------ 545| 37.8k| curve_sqr_tmp(r, tmp, ws); 546| 37.8k| } 547| 148| curve_mul_tmp(r, rl, tmp, ws); 548| | 549| 1.18k| for(size_t i = 0; i != 7; ++i) { ------------------ | Branch (549:22): [True: 1.03k, False: 148] ------------------ 550| 1.03k| curve_sqr_tmp(r, tmp, ws); 551| 1.03k| } 552| 148| curve_mul_tmp(r, a7, tmp, ws); 553| | 554| 444| for(size_t i = 0; i != 2; ++i) { ------------------ | Branch (554:22): [True: 296, False: 148] ------------------ 555| 296| curve_sqr_tmp(r, tmp, ws); 556| 296| } 557| 148| curve_mul_tmp(r, x, tmp, ws); 558| | 559| 148| return r; 560| 148|} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_113CurveGFp_P52110redc_mod_pERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 480| 673k| void redc_mod_p(BigInt& x, secure_vector& ws) const override { redc_p521(x, ws); } curve_gfp.cpp:_ZN5Botan12_GLOBAL__N_119CurveGFp_MontgomeryC2ERKNS_6BigIntES4_S4_: 24| 354| 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| 354| Modular_Reducer mod_p(m_p); 26| | 27| 354| m_r.set_bit(m_p_words * BOTAN_MP_WORD_BITS); ------------------ | | 50| 354|#define BOTAN_MP_WORD_BITS 64 ------------------ 28| 354| m_r = mod_p.reduce(m_r); 29| | 30| 354| m_r2 = mod_p.square(m_r); 31| 354| m_r3 = mod_p.multiply(m_r, m_r2); 32| 354| m_a_r = mod_p.multiply(m_r, m_a); 33| 354| m_b_r = mod_p.multiply(m_r, m_b); 34| | 35| 354| m_a_is_zero = m_a.is_zero(); 36| 354| m_a_is_minus_3 = (m_a + 3 == m_p); 37| 354| } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery5get_pEv: 47| 381k| const BigInt& get_p() const override { return m_p; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery5get_aEv: 43| 25.0k| const BigInt& get_a() const override { return m_a; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery5get_bEv: 45| 25.0k| const BigInt& get_b() const override { return m_b; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery11get_p_wordsEv: 57| 169k| size_t get_p_words() const override { return m_p_words; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery11get_ws_sizeEv: 59| 5.87M| size_t get_ws_size() const override { return 2 * m_p_words; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery6is_oneERKNS_6BigIntE: 55| 142| bool is_one(const BigInt& x) const override { return x == m_r; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery9a_is_zeroEv: 39| 146k| bool a_is_zero() const override { return m_a_is_zero; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery12a_is_minus_3Ev: 41| 78.3k| bool a_is_minus_3() const override { return m_a_is_minus_3; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery9get_a_repEv: 49| 873| const BigInt& get_a_rep() const override { return m_a_r; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery9get_b_repEv: 51| 1.64k| const BigInt& get_b_rep() const override { return m_b_r; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery9get_1_repEv: 53| 2.75k| const BigInt& get_1_rep() const override { return m_r; } curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery14invert_elementERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 86| 660|BigInt CurveGFp_Montgomery::invert_element(const BigInt& x, secure_vector& ws) const { 87| | // Should we use Montgomery inverse instead? 88| 660| const BigInt inv = inverse_mod(x, m_p); 89| 660| BigInt res; 90| 660| curve_mul(res, inv, m_r3, ws); 91| 660| return res; 92| 660|} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery12to_curve_repERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 94| 1.57k|void CurveGFp_Montgomery::to_curve_rep(BigInt& x, secure_vector& ws) const { 95| 1.57k| const BigInt tx = x; 96| 1.57k| curve_mul(x, tx, m_r2, ws); 97| 1.57k|} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery14from_curve_repERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 99| 2.66k|void CurveGFp_Montgomery::from_curve_rep(BigInt& z, secure_vector& ws) const { 100| 2.66k| if(ws.size() < get_ws_size()) { ------------------ | Branch (100:7): [True: 0, False: 2.66k] ------------------ 101| 0| ws.resize(get_ws_size()); 102| 0| } 103| | 104| 2.66k| const size_t output_size = 2 * m_p_words; 105| 2.66k| if(z.size() < output_size) { ------------------ | Branch (105:7): [True: 0, False: 2.66k] ------------------ 106| 0| z.grow_to(output_size); 107| 0| } 108| | 109| 2.66k| bigint_monty_redc(z.mutable_data(), m_p.data(), m_p_words, m_p_dash, ws.data(), ws.size()); 110| 2.66k|} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery15curve_mul_wordsERNS_6BigIntEPKmmRKS2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 113| 4.05M| BigInt& z, const word x_w[], size_t x_size, const BigInt& y, secure_vector& ws) const { 114| 4.05M| BOTAN_DEBUG_ASSERT(y.sig_words() <= m_p_words); ------------------ | | 99| 4.05M| do { \ | | 100| 4.05M| } while(0) | | ------------------ | | | Branch (100:15): [Folded - Ignored] | | ------------------ ------------------ 115| | 116| 4.05M| if(ws.size() < get_ws_size()) { ------------------ | Branch (116:7): [True: 0, False: 4.05M] ------------------ 117| 0| ws.resize(get_ws_size()); 118| 0| } 119| | 120| 4.05M| const size_t output_size = 2 * m_p_words; 121| 4.05M| if(z.size() < output_size) { ------------------ | Branch (121:7): [True: 1.06M, False: 2.99M] ------------------ 122| 1.06M| z.grow_to(output_size); 123| 1.06M| } 124| | 125| 4.05M| bigint_mul(z.mutable_data(), 126| 4.05M| z.size(), 127| 4.05M| x_w, 128| 4.05M| x_size, 129| 4.05M| std::min(m_p_words, x_size), 130| 4.05M| y.data(), 131| 4.05M| y.size(), 132| 4.05M| std::min(m_p_words, y.size()), 133| 4.05M| ws.data(), 134| 4.05M| ws.size()); 135| | 136| 4.05M| bigint_monty_redc(z.mutable_data(), m_p.data(), m_p_words, m_p_dash, ws.data(), ws.size()); 137| 4.05M|} curve_gfp.cpp:_ZNK5Botan12_GLOBAL__N_119CurveGFp_Montgomery15curve_sqr_wordsERNS_6BigIntEPKmmRNSt3__16vectorImNS_16secure_allocatorImEEEE: 139| 1.50M|void CurveGFp_Montgomery::curve_sqr_words(BigInt& z, const word x[], size_t x_size, secure_vector& ws) const { 140| 1.50M| if(ws.size() < get_ws_size()) { ------------------ | Branch (140:7): [True: 1.01k, False: 1.50M] ------------------ 141| 1.01k| ws.resize(get_ws_size()); 142| 1.01k| } 143| | 144| 1.50M| const size_t output_size = 2 * m_p_words; 145| 1.50M| if(z.size() < output_size) { ------------------ | Branch (145:7): [True: 83.2k, False: 1.42M] ------------------ 146| 83.2k| z.grow_to(output_size); 147| 83.2k| } 148| | 149| 1.50M| bigint_sqr(z.mutable_data(), z.size(), x, x_size, std::min(m_p_words, x_size), ws.data(), ws.size()); 150| | 151| 1.50M| bigint_monty_redc(z.mutable_data(), m_p.data(), m_p_words, m_p_dash, ws.data(), ws.size()); 152| 1.50M|} _ZN5Botan8EC_Group13ec_group_dataEv: 289| 1.82k|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.82k| static Allocator_Initializer g_init_allocator; 296| 1.82k| static EC_Group_Data_Map g_ec_data; 297| 1.82k| return g_ec_data; 298| 1.82k|} _ZN5Botan8EC_Group18load_EC_group_infoEPKcS2_S2_S2_S2_S2_RKNS_3OIDE: 310| 148| const OID& oid) { 311| 148| const BigInt p(p_str); 312| 148| const BigInt a(a_str); 313| 148| const BigInt b(b_str); 314| 148| const BigInt g_x(g_x_str); 315| 148| const BigInt g_y(g_y_str); 316| 148| const BigInt order(order_str); 317| 148| const BigInt cofactor(1); // implicit 318| | 319| 148| return std::make_shared(p, a, b, g_x, g_y, order, cofactor, oid, EC_Group_Source::Builtin); 320| 148|} _ZN5Botan8EC_Group19BER_decode_EC_groupEPKhmNS_15EC_Group_SourceE: 323| 1.92k|std::shared_ptr EC_Group::BER_decode_EC_group(const uint8_t bits[], size_t len, EC_Group_Source source) { 324| 1.92k| BER_Decoder ber(bits, len); 325| 1.92k| BER_Object obj = ber.get_next_object(); 326| | 327| 1.92k| if(obj.type() == ASN1_Type::Null) [[unlikely]] { ------------------ | Branch (327:7): [True: 1, False: 1.92k] ------------------ 328| 1| throw Decoding_Error("Cannot handle ImplicitCA ECC parameters"); 329| 1.92k| } else if(obj.type() == ASN1_Type::ObjectId) { ------------------ | Branch (329:14): [True: 1.51k, False: 409] ------------------ 330| 1.51k| OID dom_par_oid; 331| 1.51k| BER_Decoder(bits, len).decode(dom_par_oid); 332| 1.51k| return ec_group_data().lookup(dom_par_oid); 333| 1.51k| } else if(obj.type() == ASN1_Type::Sequence) { ------------------ | Branch (333:14): [True: 365, False: 44] ------------------ 334| 365| BigInt p, a, b, order, cofactor; 335| 365| std::vector base_pt; 336| 365| std::vector seed; 337| | 338| 365| BER_Decoder(bits, len) 339| 365| .start_sequence() 340| 365| .decode_and_check(1, "Unknown ECC param version code") 341| 365| .start_sequence() 342| 365| .decode_and_check(OID("1.2.840.10045.1.1"), "Only prime ECC fields supported") 343| 365| .decode(p) 344| 365| .end_cons() 345| 365| .start_sequence() 346| 365| .decode_octet_string_bigint(a) 347| 365| .decode_octet_string_bigint(b) 348| 365| .decode_optional_string(seed, ASN1_Type::BitString, ASN1_Type::BitString) 349| 365| .end_cons() 350| 365| .decode(base_pt, ASN1_Type::OctetString) 351| 365| .decode(order) 352| 365| .decode(cofactor) 353| 365| .end_cons() 354| 365| .verify_end(); 355| | 356| 365| if(p.bits() < 64 || p.is_negative() || !is_bailie_psw_probable_prime(p)) { ------------------ | Branch (356:10): [True: 52, False: 313] | Branch (356:27): [True: 1, False: 312] | Branch (356:46): [True: 39, False: 273] ------------------ 357| 42| throw Decoding_Error("Invalid ECC p parameter"); 358| 42| } 359| | 360| 323| if(a.is_negative() || a >= p) { ------------------ | Branch (360:10): [True: 50, False: 273] | Branch (360:29): [True: 0, False: 273] ------------------ 361| 0| throw Decoding_Error("Invalid ECC a parameter"); 362| 0| } 363| | 364| 323| if(b <= 0 || b >= p) { ------------------ | Branch (364:10): [True: 51, False: 272] | Branch (364:20): [True: 0, False: 272] ------------------ 365| 1| throw Decoding_Error("Invalid ECC b parameter"); 366| 1| } 367| | 368| 322| if(order <= 0 || !is_bailie_psw_probable_prime(order)) { ------------------ | Branch (368:10): [True: 52, False: 270] | Branch (368:24): [True: 40, False: 230] ------------------ 369| 42| throw Decoding_Error("Invalid ECC order parameter"); 370| 42| } 371| | 372| 280| if(cofactor <= 0 || cofactor >= 16) { ------------------ | Branch (372:10): [True: 53, False: 227] | Branch (372:27): [True: 8, False: 219] ------------------ 373| 11| throw Decoding_Error("Invalid ECC cofactor parameter"); 374| 11| } 375| | 376| 269| std::pair base_xy = Botan::OS2ECP(base_pt.data(), base_pt.size(), p, a, b); 377| | 378| 269| return ec_group_data().lookup_or_create(p, a, b, base_xy.first, base_xy.second, order, cofactor, OID(), source); 379| 280| } else { 380| 44| throw Decoding_Error("Unexpected tag while decoding ECC domain params"); 381| 44| } 382| 1.92k|} _ZN5Botan8EC_GroupC2Ev: 384| 101|EC_Group::EC_Group() = default; _ZN5Botan8EC_GroupD2Ev: 386| 2.43k|EC_Group::~EC_Group() = default; _ZN5Botan8EC_GroupC2ERKNS_3OIDE: 388| 99|EC_Group::EC_Group(const OID& domain_oid) { 389| 99| this->m_data = ec_group_data().lookup(domain_oid); 390| 99| if(!this->m_data) { ------------------ | Branch (390:7): [True: 10, False: 89] ------------------ 391| 10| throw Invalid_Argument("Unknown EC_Group " + domain_oid.to_string()); 392| 10| } 393| 99|} _ZN5Botan8EC_GroupC2EPKhm: 438| 1.92k|EC_Group::EC_Group(const uint8_t ber[], size_t ber_len) { 439| 1.92k| m_data = BER_decode_EC_group(ber, ber_len, EC_Group_Source::ExternalSource); 440| 1.92k|} _ZNK5Botan8EC_Group4dataEv: 442| 6.51k|const EC_Group_Data& EC_Group::data() const { 443| 6.51k| if(m_data == nullptr) { ------------------ | Branch (443:7): [True: 53, False: 6.45k] ------------------ 444| 53| throw Invalid_State("EC_Group uninitialized"); 445| 53| } 446| 6.45k| return *m_data; 447| 6.51k|} _ZNK5Botan8EC_Group10get_p_bitsEv: 453| 89|size_t EC_Group::get_p_bits() const { return data().p_bits(); } _ZNK5Botan8EC_Group14get_order_bitsEv: 457| 244|size_t EC_Group::get_order_bits() const { return data().order_bits(); } _ZNK5Botan8EC_Group15get_order_bytesEv: 459| 532|size_t EC_Group::get_order_bytes() const { return data().order_bytes(); } _ZNK5Botan8EC_Group14get_base_pointEv: 467| 536|const EC_Point& EC_Group::get_base_point() const { return data().base_point(); } _ZNK5Botan8EC_Group9get_orderEv: 469| 1.08k|const BigInt& EC_Group::get_order() const { return data().order(); } _ZNK5Botan8EC_Group9mod_orderERKNS_6BigIntE: 477| 545|BigInt EC_Group::mod_order(const BigInt& k) const { return data().mod_order(k); } _ZNK5Botan8EC_Group18multiply_mod_orderERKNS_6BigIntES3_: 481| 614|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| 307|BigInt EC_Group::inverse_mod_order(const BigInt& x) const { return data().inverse_mod_order(x); } _ZNK5Botan8EC_Group13get_curve_oidEv: 489| 771|const OID& EC_Group::get_curve_oid() const { return data().oid(); } _ZNK5Botan8EC_Group6OS2ECPEPKhm: 502| 1.70k|EC_Point EC_Group::OS2ECP(const uint8_t bits[], size_t len) const { return Botan::OS2ECP(bits, len, data().curve()); } _ZNK5Botan8EC_Group5pointERKNS_6BigIntES3_: 504| 82|EC_Point EC_Group::point(const BigInt& x, const BigInt& y) const { 505| | // TODO: randomize the representation? 506| 82| return EC_Point(data().curve(), x, y); 507| 82|} _ZN5Botan17EC_Group_Data_MapC2Ev: 147| 1| EC_Group_Data_Map() = default; _ZN5Botan17EC_Group_Data_Map6lookupERKNS_3OIDE: 156| 1.61k| std::shared_ptr lookup(const OID& oid) { 157| 1.61k| lock_guard_type lock(m_mutex); 158| | 159| 36.8k| for(auto i : m_registered_curves) { ------------------ | Branch (159:21): [True: 36.8k, False: 211] ------------------ 160| 36.8k| if(i->oid() == oid) { ------------------ | Branch (160:16): [True: 1.39k, False: 35.4k] ------------------ 161| 1.39k| return i; 162| 1.39k| } 163| 36.8k| } 164| | 165| | // Not found, check hardcoded data 166| 211| std::shared_ptr data = EC_Group::EC_group_info(oid); 167| | 168| 211| if(data) { ------------------ | Branch (168:13): [True: 148, False: 63] ------------------ 169| 26.5k| for(auto curve : m_registered_curves) { ------------------ | Branch (169:28): [True: 26.5k, False: 148] ------------------ 170| 26.5k| if(curve->oid().empty() == true && curve->params_match(*data)) { ------------------ | Branch (170:19): [True: 15.6k, False: 10.8k] | Branch (170:51): [True: 0, False: 15.6k] ------------------ 171| 0| curve->set_oid(oid); 172| 0| return curve; 173| 0| } 174| 26.5k| } 175| | 176| 148| m_registered_curves.push_back(data); 177| 148| return data; 178| 148| } 179| | 180| | // Nope, unknown curve 181| 63| return std::shared_ptr(); 182| 211| } _ZNK5Botan13EC_Group_Data12params_matchERKS0_: 67| 15.6k| bool params_match(const EC_Group_Data& other) const { 68| 15.6k| return params_match( 69| 15.6k| other.p(), other.a(), other.b(), other.g_x(), other.g_y(), other.order(), other.cofactor()); 70| 15.6k| } _ZNK5Botan13EC_Group_Data12params_matchERKNS_6BigIntES3_S3_S3_S3_S3_S3_: 62| 50.7k| const BigInt& cofactor) const { 63| 50.7k| return (this->p() == p && this->a() == a && this->b() == b && this->order() == order && ------------------ | Branch (63:18): [True: 8.51k, False: 42.2k] | Branch (63:36): [True: 8.51k, False: 0] | Branch (63:54): [True: 7.49k, False: 1.01k] | Branch (63:72): [True: 450, False: 7.04k] ------------------ 64| 50.7k| this->cofactor() == cofactor && this->g_x() == g_x && this->g_y() == g_y); ------------------ | Branch (64:18): [True: 308, False: 142] | Branch (64:50): [True: 35, False: 273] | Branch (64:72): [True: 3, False: 32] ------------------ 65| 50.7k| } _ZN5Botan17EC_Group_Data_Map16lookup_or_createERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceE: 192| 216| EC_Group_Source source) { 193| 216| lock_guard_type lock(m_mutex); 194| | 195| 35.0k| for(auto i : m_registered_curves) { ------------------ | Branch (195:21): [True: 35.0k, False: 213] ------------------ 196| | /* 197| | * The params may be the same but you are trying to register under a 198| | * different OID than the one we are using, so using a different 199| | * group, since EC_Group's model assumes a single OID per group. 200| | */ 201| 35.0k| if(!oid.empty() && !i->oid().empty() && i->oid() != oid) { ------------------ | Branch (201:16): [True: 0, False: 35.0k] | Branch (201:32): [True: 0, False: 0] | Branch (201:53): [True: 0, False: 0] ------------------ 202| 0| continue; 203| 0| } 204| | 205| 35.0k| const bool same_oid = !oid.empty() && i->oid() == oid; ------------------ | Branch (205:35): [True: 0, False: 35.0k] | Branch (205:51): [True: 0, False: 0] ------------------ 206| 35.0k| const bool same_params = i->params_match(p, a, b, g_x, g_y, order, cofactor); 207| | 208| | /* 209| | * If the params and OID are the same then we are done, just return 210| | * the already registered curve obj. 211| | */ 212| 35.0k| if(same_params && same_oid) { ------------------ | Branch (212:16): [True: 3, False: 35.0k] | Branch (212:31): [True: 0, False: 3] ------------------ 213| 0| return i; 214| 0| } 215| | 216| | /* 217| | * If same params and the new OID is empty, then that's ok too 218| | */ 219| 35.0k| if(same_params && oid.empty()) { ------------------ | Branch (219:16): [True: 3, False: 35.0k] | Branch (219:31): [True: 3, False: 0] ------------------ 220| 3| return i; 221| 3| } 222| | 223| | /* 224| | * Check for someone trying to reuse an already in-use OID 225| | */ 226| 35.0k| if(same_oid && !same_params) { ------------------ | Branch (226:16): [True: 0, False: 35.0k] | Branch (226:28): [True: 0, False: 0] ------------------ 227| 0| throw Invalid_Argument("Attempting to register a curve using OID " + oid.to_string() + 228| 0| " but a distinct curve is already registered using that OID"); 229| 0| } 230| | 231| | /* 232| | * If the same curve was previously created without an OID but is now 233| | * being registered again using an OID, save that OID. 234| | */ 235| 35.0k| if(same_params && i->oid().empty() && !oid.empty()) { ------------------ | Branch (235:16): [True: 0, False: 35.0k] | Branch (235:31): [True: 0, False: 0] | Branch (235:51): [True: 0, False: 0] ------------------ 236| 0| i->set_oid(oid); 237| 0| return i; 238| 0| } 239| 35.0k| } 240| | 241| | /* 242| | Not found in current list, so we need to create a new entry 243| | 244| | If an OID is set, try to look up relative our static tables to detect a duplicate 245| | registration under an OID 246| | */ 247| | 248| 213| std::shared_ptr new_group = 249| 213| std::make_shared(p, a, b, g_x, g_y, order, cofactor, oid, source); 250| | 251| 213| if(oid.has_value()) { ------------------ | Branch (251:13): [True: 0, False: 213] ------------------ 252| 0| std::shared_ptr data = EC_Group::EC_group_info(oid); 253| 0| if(data != nullptr && !new_group->params_match(*data)) { ------------------ | Branch (253:16): [True: 0, False: 0] | Branch (253:35): [True: 0, False: 0] ------------------ 254| 0| throw Invalid_Argument("Attempting to register an EC group under OID of hardcoded group"); 255| 0| } 256| 213| } else { 257| | // Here try to use the order as a hint to look up the group id, to identify common groups 258| 213| const OID oid_from_store = EC_Group::EC_group_identity_from_order(order); 259| 213| if(oid_from_store.has_value()) { ------------------ | Branch (259:16): [True: 0, False: 213] ------------------ 260| 0| std::shared_ptr data = EC_Group::EC_group_info(oid_from_store); 261| | 262| | /* 263| | If EC_group_identity_from_order returned an OID then looking up that OID 264| | must always return a result. 265| | */ 266| 0| BOTAN_ASSERT_NOMSG(data != nullptr); ------------------ | | 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] | | ------------------ ------------------ 267| | 268| | /* 269| | It is possible (if unlikely) that someone is registering another group 270| | that happens to have an order equal to that of a well known group - 271| | so verify all values before assigning the OID. 272| | */ 273| 0| if(new_group->params_match(*data)) { ------------------ | Branch (273:19): [True: 0, False: 0] ------------------ 274| 0| new_group->set_oid(oid_from_store); 275| 0| } 276| 0| } 277| 213| } 278| | 279| 213| m_registered_curves.push_back(new_group); 280| 213| return new_group; 281| 213| } _ZN5Botan13EC_Group_DataC2ERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceE: 54| 361| m_source(source) {} _ZNK5Botan13EC_Group_Data6p_bitsEv: 93| 89| size_t p_bits() const { return m_p_bits; } _ZNK5Botan13EC_Group_Data10order_bitsEv: 97| 244| size_t order_bits() const { return m_order_bits; } _ZNK5Botan13EC_Group_Data11order_bytesEv: 99| 532| size_t order_bytes() const { return (m_order_bits + 7) / 8; } _ZNK5Botan13EC_Group_Data1pEv: 79| 66.3k| const BigInt& p() const { return m_curve.get_p(); } _ZNK5Botan13EC_Group_Data1aEv: 81| 24.1k| const BigInt& a() const { return m_curve.get_a(); } _ZNK5Botan13EC_Group_Data1bEv: 83| 24.1k| const BigInt& b() const { return m_curve.get_b(); } _ZNK5Botan13EC_Group_Data10base_pointEv: 103| 536| const EC_Point& base_point() const { return m_base_point; } _ZNK5Botan13EC_Group_Data5orderEv: 85| 24.2k| const BigInt& order() const { return m_order; } _ZNK5Botan13EC_Group_Data3g_xEv: 89| 15.9k| const BigInt& g_x() const { return m_g_x; } _ZNK5Botan13EC_Group_Data3g_yEv: 91| 15.6k| const BigInt& g_y() const { return m_g_y; } _ZNK5Botan13EC_Group_Data8cofactorEv: 87| 16.0k| const BigInt& cofactor() const { return m_cofactor; } _ZNK5Botan13EC_Group_Data9mod_orderERKNS_6BigIntE: 109| 545| BigInt mod_order(const BigInt& x) const { return m_mod_order.reduce(x); } _ZNK5Botan13EC_Group_Data18multiply_mod_orderERKNS_6BigIntES3_: 113| 614| 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| 307| BigInt inverse_mod_order(const BigInt& x) const { return inverse_mod(x, m_order); } _ZNK5Botan13EC_Group_Data3oidEv: 77| 64.1k| const OID& oid() const { return m_oid; } _ZNK5Botan13EC_Group_Data5curveEv: 101| 1.73k| const CurveGFp& curve() const { return m_curve; } _ZN5Botan8EC_Group13EC_group_infoERKNS_3OIDE: 15| 211|std::shared_ptr EC_Group::EC_group_info(const OID& oid) { 16| | // secp256r1 17| 211| if(oid == OID{1, 2, 840, 10045, 3, 1, 7}) { ------------------ | Branch (17:7): [True: 1, False: 210] ------------------ 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| 210| if(oid == OID{1, 3, 132, 0, 34}) { ------------------ | Branch (29:7): [True: 1, False: 209] ------------------ 30| 1| return load_EC_group_info( 31| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFF", 32| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFC", 33| 1| "0xB3312FA7E23EE7E4988E056BE3F82D19181D9C6EFE8141120314088F5013875AC656398D8A2ED19D2A85C8EDD3EC2AEF", 34| 1| "0xAA87CA22BE8B05378EB1C71EF320AD746E1D3B628BA79B9859F741E082542A385502F25DBF55296C3A545E3872760AB7", 35| 1| "0x3617DE4A96262C6F5D9E98BF9292DC29F8F41DBD289A147CE9DA3113B5F0B8C00A60B1CE1D7E819D7A431D7C90EA0E5F", 36| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFC7634D81F4372DDF581A0DB248B0A77AECEC196ACCC52973", 37| 1| oid); 38| 1| } 39| | 40| | // secp521r1 41| 209| if(oid == OID{1, 3, 132, 0, 35}) { ------------------ | Branch (41:7): [True: 1, False: 208] ------------------ 42| 1| return load_EC_group_info( 43| 1| "0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", 44| 1| "0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFC", 45| 1| "0x51953EB9618E1C9A1F929A21A0B68540EEA2DA725B99B315F3B8B489918EF109E156193951EC7E937B1652C0BD3BB1BF073573DF883D2C34F1EF451FD46B503F00", 46| 1| "0xC6858E06B70404E9CD9E3ECB662395B4429C648139053FB521F828AF606B4D3DBAA14B5E77EFE75928FE1DC127A2FFA8DE3348B3C1856A429BF97E7E31C2E5BD66", 47| 1| "0x11839296A789A3BC0045C8A5FB42C7D1BD998F54449579B446817AFBD17273E662C97EE72995EF42640C550B9013FAD0761353C7086A272C24088BE94769FD16650", 48| 1| "0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFA51868783BF2F966B7FCC0148F709A5D03BB5C9B8899C47AEBB6FB71E91386409", 49| 1| oid); 50| 1| } 51| | 52| | // brainpool160r1 53| 208| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 1}) { ------------------ | Branch (53:7): [True: 0, False: 208] ------------------ 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| 208| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 3}) { ------------------ | Branch (65:7): [True: 0, False: 208] ------------------ 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| 208| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 5}) { ------------------ | Branch (77:7): [True: 0, False: 208] ------------------ 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| 208| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 7}) { ------------------ | Branch (89:7): [True: 0, False: 208] ------------------ 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| 208| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 9}) { ------------------ | Branch (101:7): [True: 0, False: 208] ------------------ 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| 208| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 11}) { ------------------ | Branch (113:7): [True: 0, False: 208] ------------------ 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| 208| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 13}) { ------------------ | Branch (125:7): [True: 0, False: 208] ------------------ 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| 208| if(oid == OID{1, 2, 250, 1, 223, 101, 256, 1}) { ------------------ | Branch (137:7): [True: 0, False: 208] ------------------ 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| 208| 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: 208] | Branch (149:7): [True: 132, False: 76] | Branch (149:50): [True: 3, False: 205] | Branch (149:88): [True: 129, False: 76] ------------------ 150| 132| return load_EC_group_info( 151| 132| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFD97", 152| 132| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFD94", 153| 132| "0xA6", 154| 132| "1", 155| 132| "0x8D91E471E0989CDA27DF505A453F2B7635294F2DDF23E3B122ACC99C9E9F1E14", 156| 132| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF6C611070995AD10045841B09B761B893", 157| 132| OID{1, 2, 643, 7, 1, 2, 1, 1, 1}); 158| 132| } 159| | 160| | // gost_512A 161| 76| if(oid == OID{1, 2, 643, 7, 1, 2, 1, 2, 1}) { ------------------ | Branch (161:7): [True: 0, False: 76] ------------------ 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| 76| if(oid == OID{1, 3, 132, 0, 9}) { ------------------ | Branch (173:7): [True: 1, False: 75] ------------------ 174| 1| return load_EC_group_info( 175| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC73", 176| 1| "0", 177| 1| "7", 178| 1| "0x3B4C382CE37AA192A4019E763036F4F5DD4D7EBB", 179| 1| "0x938CF935318FDCED6BC28286531733C3F03C4FEE", 180| 1| "0x100000000000000000001B8FA16DFAB9ACA16B6B3", 181| 1| oid); 182| 1| } 183| | 184| | // secp160r1 185| 75| if(oid == OID{1, 3, 132, 0, 8}) { ------------------ | Branch (185:7): [True: 1, False: 74] ------------------ 186| 1| return load_EC_group_info( 187| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFF", 188| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFC", 189| 1| "0x1C97BEFC54BD7A8B65ACF89F81D4D4ADC565FA45", 190| 1| "0x4A96B5688EF573284664698968C38BB913CBFC82", 191| 1| "0x23A628553168947D59DCC912042351377AC5FB32", 192| 1| "0x100000000000000000001F4C8F927AED3CA752257", 193| 1| oid); 194| 1| } 195| | 196| | // secp160r2 197| 74| if(oid == OID{1, 3, 132, 0, 30}) { ------------------ | Branch (197:7): [True: 1, False: 73] ------------------ 198| 1| return load_EC_group_info( 199| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC73", 200| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC70", 201| 1| "0xB4E134D3FB59EB8BAB57274904664D5AF50388BA", 202| 1| "0x52DCB034293A117E1F4FF11B30F7199D3144CE6D", 203| 1| "0xFEAFFEF2E331F296E071FA0DF9982CFEA7D43F2E", 204| 1| "0x100000000000000000000351EE786A818F3A1A16B", 205| 1| oid); 206| 1| } 207| | 208| | // secp192k1 209| 73| if(oid == OID{1, 3, 132, 0, 31}) { ------------------ | Branch (209:7): [True: 1, False: 72] ------------------ 210| 1| return load_EC_group_info( 211| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFEE37", 212| 1| "0", 213| 1| "3", 214| 1| "0xDB4FF10EC057E9AE26B07D0280B7F4341DA5D1B1EAE06C7D", 215| 1| "0x9B2F2F6D9C5628A7844163D015BE86344082AA88D95E2F9D", 216| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFE26F2FC170F69466A74DEFD8D", 217| 1| oid); 218| 1| } 219| | 220| | // secp192r1 221| 72| if(oid == OID{1, 2, 840, 10045, 3, 1, 1}) { ------------------ | Branch (221:7): [True: 1, False: 71] ------------------ 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| 71| if(oid == OID{1, 3, 132, 0, 32}) { ------------------ | Branch (233:7): [True: 1, False: 70] ------------------ 234| 1| return load_EC_group_info( 235| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFE56D", 236| 1| "0", 237| 1| "5", 238| 1| "0xA1455B334DF099DF30FC28A169A467E9E47075A90F7E650EB6B7A45C", 239| 1| "0x7E089FED7FBA344282CAFBD6F7E319F7C0B0BD59E2CA4BDB556D61A5", 240| 1| "0x10000000000000000000000000001DCE8D2EC6184CAF0A971769FB1F7", 241| 1| oid); 242| 1| } 243| | 244| | // secp224r1 245| 70| if(oid == OID{1, 3, 132, 0, 33}) { ------------------ | Branch (245:7): [True: 1, False: 69] ------------------ 246| 1| return load_EC_group_info( 247| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF000000000000000000000001", 248| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFE", 249| 1| "0xB4050A850C04B3ABF54132565044B0B7D7BFD8BA270B39432355FFB4", 250| 1| "0xB70E0CBD6BB4BF7F321390B94A03C1D356C21122343280D6115C1D21", 251| 1| "0xBD376388B5F723FB4C22DFE6CD4375A05A07476444D5819985007E34", 252| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF16A2E0B8F03E13DD29455C5C2A3D", 253| 1| oid); 254| 1| } 255| | 256| | // secp256k1 257| 69| if(oid == OID{1, 3, 132, 0, 10}) { ------------------ | Branch (257:7): [True: 1, False: 68] ------------------ 258| 1| return load_EC_group_info( 259| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F", 260| 1| "0", 261| 1| "7", 262| 1| "0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798", 263| 1| "0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8", 264| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141", 265| 1| oid); 266| 1| } 267| | 268| | // sm2p256v1 269| 68| if(oid == OID{1, 2, 156, 10197, 1, 301}) { ------------------ | Branch (269:7): [True: 0, False: 68] ------------------ 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| 68| if(oid == OID{1, 2, 840, 10045, 3, 1, 2}) { ------------------ | Branch (281:7): [True: 1, False: 67] ------------------ 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| 67| if(oid == OID{1, 2, 840, 10045, 3, 1, 3}) { ------------------ | Branch (293:7): [True: 1, False: 66] ------------------ 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| 66| if(oid == OID{1, 2, 840, 10045, 3, 1, 4}) { ------------------ | Branch (305:7): [True: 1, False: 65] ------------------ 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| 65| if(oid == OID{1, 2, 840, 10045, 3, 1, 5}) { ------------------ | Branch (317:7): [True: 1, False: 64] ------------------ 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| 64| if(oid == OID{1, 2, 840, 10045, 3, 1, 6}) { ------------------ | Branch (329:7): [True: 1, False: 63] ------------------ 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| 63| return std::shared_ptr(); 341| 64|} _ZN5Botan8EC_Group28EC_group_identity_from_orderERKNS_6BigIntE: 345| 193| { 346| 193| const uint32_t low_bits = static_cast(order.word_at(0)); 347| | 348| 193| if(low_bits == 0xFC632551 && order == BigInt("0xFFFFFFFF00000000FFFFFFFFFFFFFFFFBCE6FAADA7179E84F3B9CAC2FC632551")) { ------------------ | Branch (348:7): [True: 0, False: 193] | Branch (348:7): [True: 0, False: 193] | Branch (348:33): [True: 0, False: 0] ------------------ 349| 0| return OID{1, 2, 840, 10045, 3, 1, 7}; 350| 0| } 351| | 352| 193| if(low_bits == 0xCCC52973 && order == BigInt("0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFC7634D81F4372DDF581A0DB248B0A77AECEC196ACCC52973")) { ------------------ | Branch (352:7): [True: 0, False: 193] | Branch (352:7): [True: 0, False: 193] | Branch (352:33): [True: 0, False: 0] ------------------ 353| 0| return OID{1, 3, 132, 0, 34}; 354| 0| } 355| | 356| 193| if(low_bits == 0x91386409 && order == BigInt("0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFA51868783BF2F966B7FCC0148F709A5D03BB5C9B8899C47AEBB6FB71E91386409")) { ------------------ | Branch (356:7): [True: 0, False: 193] | Branch (356:7): [True: 0, False: 193] | Branch (356:33): [True: 0, False: 0] ------------------ 357| 0| return OID{1, 3, 132, 0, 35}; 358| 0| } 359| | 360| 193| if(low_bits == 0x9E60FC09 && order == BigInt("0xE95E4A5F737059DC60DF5991D45029409E60FC09")) { ------------------ | Branch (360:7): [True: 0, False: 193] | Branch (360:7): [True: 0, False: 193] | Branch (360:33): [True: 0, False: 0] ------------------ 361| 0| return OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 1}; 362| 0| } 363| | 364| 193| if(low_bits == 0x9AC4ACC1 && order == BigInt("0xC302F41D932A36CDA7A3462F9E9E916B5BE8F1029AC4ACC1")) { ------------------ | Branch (364:7): [True: 0, False: 193] | Branch (364:7): [True: 0, False: 193] | Branch (364:33): [True: 0, False: 0] ------------------ 365| 0| return OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 3}; 366| 0| } 367| | 368| 193| if(low_bits == 0xA5A7939F && order == BigInt("0xD7C134AA264366862A18302575D0FB98D116BC4B6DDEBCA3A5A7939F")) { ------------------ | Branch (368:7): [True: 0, False: 193] | Branch (368:7): [True: 0, False: 193] | Branch (368:33): [True: 0, False: 0] ------------------ 369| 0| return OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 5}; 370| 0| } 371| | 372| 193| if(low_bits == 0x974856A7 && order == BigInt("0xA9FB57DBA1EEA9BC3E660A909D838D718C397AA3B561A6F7901E0E82974856A7")) { ------------------ | Branch (372:7): [True: 0, False: 193] | Branch (372:7): [True: 0, False: 193] | Branch (372:33): [True: 0, False: 0] ------------------ 373| 0| return OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 7}; 374| 0| } 375| | 376| 193| if(low_bits == 0x44C59311 && order == BigInt("0xD35E472036BC4FB7E13C785ED201E065F98FCFA5B68F12A32D482EC7EE8658E98691555B44C59311")) { ------------------ | Branch (376:7): [True: 0, False: 193] | Branch (376:7): [True: 0, False: 193] | Branch (376:33): [True: 0, False: 0] ------------------ 377| 0| return OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 9}; 378| 0| } 379| | 380| 193| if(low_bits == 0xE9046565 && order == BigInt("0x8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B31F166E6CAC0425A7CF3AB6AF6B7FC3103B883202E9046565")) { ------------------ | Branch (380:7): [True: 0, False: 193] | Branch (380:7): [True: 0, False: 193] | Branch (380:33): [True: 0, False: 0] ------------------ 381| 0| return OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 11}; 382| 0| } 383| | 384| 193| if(low_bits == 0x9CA90069 && order == BigInt("0xAADD9DB8DBE9C48B3FD4E6AE33C9FC07CB308DB3B3C9D20ED6639CCA70330870553E5C414CA92619418661197FAC10471DB1D381085DDADDB58796829CA90069")) { ------------------ | Branch (384:7): [True: 0, False: 193] | Branch (384:7): [True: 0, False: 193] | Branch (384:33): [True: 0, False: 0] ------------------ 385| 0| return OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 13}; 386| 0| } 387| | 388| 193| if(low_bits == 0xC6D655E1 && order == BigInt("0xF1FD178C0B3AD58F10126DE8CE42435B53DC67E140D2BF941FFDD459C6D655E1")) { ------------------ | Branch (388:7): [True: 0, False: 193] | Branch (388:7): [True: 0, False: 193] | Branch (388:33): [True: 0, False: 0] ------------------ 389| 0| return OID{1, 2, 250, 1, 223, 101, 256, 1}; 390| 0| } 391| | 392| 193| if(low_bits == 0xB761B893 && order == BigInt("0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF6C611070995AD10045841B09B761B893")) { ------------------ | Branch (392:7): [True: 0, False: 193] | Branch (392:7): [True: 0, False: 193] | Branch (392:33): [True: 0, False: 0] ------------------ 393| 0| return OID{1, 2, 643, 7, 1, 2, 1, 1, 1}; 394| 0| } 395| | 396| 193| if(low_bits == 0x1F10B275 && order == BigInt("0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF27E69532F48D89116FF22B8D4E0560609B4B38ABFAD2B85DCACDB1411F10B275")) { ------------------ | Branch (396:7): [True: 0, False: 193] | Branch (396:7): [True: 0, False: 193] | Branch (396:33): [True: 0, False: 0] ------------------ 397| 0| return OID{1, 2, 643, 7, 1, 2, 1, 2, 1}; 398| 0| } 399| | 400| 193| if(low_bits == 0xCA16B6B3 && order == BigInt("0x100000000000000000001B8FA16DFAB9ACA16B6B3")) { ------------------ | Branch (400:7): [True: 0, False: 193] | Branch (400:7): [True: 0, False: 193] | Branch (400:33): [True: 0, False: 0] ------------------ 401| 0| return OID{1, 3, 132, 0, 9}; 402| 0| } 403| | 404| 193| if(low_bits == 0xCA752257 && order == BigInt("0x100000000000000000001F4C8F927AED3CA752257")) { ------------------ | Branch (404:7): [True: 0, False: 193] | Branch (404:7): [True: 0, False: 193] | Branch (404:33): [True: 0, False: 0] ------------------ 405| 0| return OID{1, 3, 132, 0, 8}; 406| 0| } 407| | 408| 193| if(low_bits == 0xF3A1A16B && order == BigInt("0x100000000000000000000351EE786A818F3A1A16B")) { ------------------ | Branch (408:7): [True: 0, False: 193] | Branch (408:7): [True: 0, False: 193] | Branch (408:33): [True: 0, False: 0] ------------------ 409| 0| return OID{1, 3, 132, 0, 30}; 410| 0| } 411| | 412| 193| if(low_bits == 0x74DEFD8D && order == BigInt("0xFFFFFFFFFFFFFFFFFFFFFFFE26F2FC170F69466A74DEFD8D")) { ------------------ | Branch (412:7): [True: 0, False: 193] | Branch (412:7): [True: 0, False: 193] | Branch (412:33): [True: 0, False: 0] ------------------ 413| 0| return OID{1, 3, 132, 0, 31}; 414| 0| } 415| | 416| 193| if(low_bits == 0xB4D22831 && order == BigInt("0xFFFFFFFFFFFFFFFFFFFFFFFF99DEF836146BC9B1B4D22831")) { ------------------ | Branch (416:7): [True: 0, False: 193] | Branch (416:7): [True: 0, False: 193] | Branch (416:33): [True: 0, False: 0] ------------------ 417| 0| return OID{1, 2, 840, 10045, 3, 1, 1}; 418| 0| } 419| | 420| 193| if(low_bits == 0x769FB1F7 && order == BigInt("0x10000000000000000000000000001DCE8D2EC6184CAF0A971769FB1F7")) { ------------------ | Branch (420:7): [True: 1, False: 192] | Branch (420:7): [True: 0, False: 193] | Branch (420:33): [True: 0, False: 1] ------------------ 421| 0| return OID{1, 3, 132, 0, 32}; 422| 0| } 423| | 424| 193| if(low_bits == 0x5C5C2A3D && order == BigInt("0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF16A2E0B8F03E13DD29455C5C2A3D")) { ------------------ | Branch (424:7): [True: 0, False: 193] | Branch (424:7): [True: 0, False: 193] | Branch (424:33): [True: 0, False: 0] ------------------ 425| 0| return OID{1, 3, 132, 0, 33}; 426| 0| } 427| | 428| 193| if(low_bits == 0xD0364141 && order == BigInt("0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141")) { ------------------ | Branch (428:7): [True: 0, False: 193] | Branch (428:7): [True: 0, False: 193] | Branch (428:33): [True: 0, False: 0] ------------------ 429| 0| return OID{1, 3, 132, 0, 10}; 430| 0| } 431| | 432| 193| if(low_bits == 0x39D54123 && order == BigInt("0xFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123")) { ------------------ | Branch (432:7): [True: 0, False: 193] | Branch (432:7): [True: 0, False: 193] | Branch (432:33): [True: 0, False: 0] ------------------ 433| 0| return OID{1, 2, 156, 10197, 1, 301}; 434| 0| } 435| | 436| 193| if(low_bits == 0x48D8DD31 && order == BigInt("0xFFFFFFFFFFFFFFFFFFFFFFFE5FB1A724DC80418648D8DD31")) { ------------------ | Branch (436:7): [True: 0, False: 193] | Branch (436:7): [True: 0, False: 193] | Branch (436:33): [True: 0, False: 0] ------------------ 437| 0| return OID{1, 2, 840, 10045, 3, 1, 2}; 438| 0| } 439| | 440| 193| if(low_bits == 0xF640EC13 && order == BigInt("0xFFFFFFFFFFFFFFFFFFFFFFFF7A62D031C83F4294F640EC13")) { ------------------ | Branch (440:7): [True: 0, False: 193] | Branch (440:7): [True: 0, False: 193] | Branch (440:33): [True: 0, False: 0] ------------------ 441| 0| return OID{1, 2, 840, 10045, 3, 1, 3}; 442| 0| } 443| | 444| 193| if(low_bits == 0x88909D0B && order == BigInt("0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFF9E5E9A9F5D9071FBD1522688909D0B")) { ------------------ | Branch (444:7): [True: 0, False: 193] | Branch (444:7): [True: 0, False: 193] | Branch (444:33): [True: 0, False: 0] ------------------ 445| 0| return OID{1, 2, 840, 10045, 3, 1, 4}; 446| 0| } 447| | 448| 193| if(low_bits == 0xBC582063 && order == BigInt("0x7FFFFFFFFFFFFFFFFFFFFFFF800000CFA7E8594377D414C03821BC582063")) { ------------------ | Branch (448:7): [True: 1, False: 192] | Branch (448:7): [True: 0, False: 193] | Branch (448:33): [True: 0, False: 1] ------------------ 449| 0| return OID{1, 2, 840, 10045, 3, 1, 5}; 450| 0| } 451| | 452| 193| if(low_bits == 0x46526551 && order == BigInt("0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFF975DEB41B3A6057C3C432146526551")) { ------------------ | Branch (452:7): [True: 0, False: 193] | Branch (452:7): [True: 0, False: 193] | Branch (452:33): [True: 0, False: 0] ------------------ 453| 0| return OID{1, 2, 840, 10045, 3, 1, 6}; 454| 0| } 455| | 456| 193| return OID(); 457| 193|} _ZN5Botan8EC_PointC2ERKNS_8CurveGFpE: 18| 449|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| 449|} _ZN5Botan8EC_PointC2ERKNS_8CurveGFpERKNS_6BigIntES6_: 23| 1.53k| m_curve(curve), m_coord_x(x), m_coord_y(y), m_coord_z(m_curve.get_1_rep()) { 24| 1.53k| if(x < 0 || x >= curve.get_p()) { ------------------ | Branch (24:7): [True: 0, False: 1.53k] | Branch (24:16): [True: 332, False: 1.20k] ------------------ 25| 332| throw Invalid_Argument("Invalid EC_Point affine x"); 26| 332| } 27| 1.20k| if(y < 0 || y >= curve.get_p()) { ------------------ | Branch (27:7): [True: 0, False: 1.20k] | Branch (27:16): [True: 2, False: 1.20k] ------------------ 28| 2| throw Invalid_Argument("Invalid EC_Point affine y"); 29| 2| } 30| | 31| 1.20k| secure_vector monty_ws(m_curve.get_ws_size()); 32| 1.20k| m_curve.to_rep(m_coord_x, monty_ws); 33| 1.20k| m_curve.to_rep(m_coord_y, monty_ws); 34| 1.20k|} _ZN5Botan8EC_Point10add_affineEPKmmS2_mRNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE: 74| 25.5k| const word x_words[], size_t x_size, const word y_words[], size_t y_size, std::vector& ws_bn) { 75| 25.5k| if((CT::all_zeros(x_words, x_size) & CT::all_zeros(y_words, y_size)).is_set()) { ------------------ | Branch (75:7): [True: 0, False: 25.5k] ------------------ 76| 0| return; 77| 0| } 78| | 79| 25.5k| if(is_zero()) { ------------------ | Branch (79:7): [True: 204, False: 25.3k] ------------------ 80| 204| m_coord_x.set_words(x_words, x_size); 81| 204| m_coord_y.set_words(y_words, y_size); 82| 204| m_coord_z = m_curve.get_1_rep(); 83| 204| return; 84| 204| } 85| | 86| 25.3k| resize_ws(ws_bn, m_curve.get_ws_size()); 87| | 88| 25.3k| secure_vector& ws = ws_bn[0].get_word_vector(); 89| 25.3k| secure_vector& sub_ws = ws_bn[1].get_word_vector(); 90| | 91| 25.3k| BigInt& T0 = ws_bn[2]; 92| 25.3k| BigInt& T1 = ws_bn[3]; 93| 25.3k| BigInt& T2 = ws_bn[4]; 94| 25.3k| BigInt& T3 = ws_bn[5]; 95| 25.3k| 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| 25.3k| const BigInt& p = m_curve.get_p(); 103| | 104| 25.3k| m_curve.sqr(T3, m_coord_z, ws); // z1^2 105| 25.3k| m_curve.mul(T4, x_words, x_size, T3, ws); // x2*z1^2 106| | 107| 25.3k| m_curve.mul(T2, m_coord_z, T3, ws); // z1^3 108| 25.3k| m_curve.mul(T0, y_words, y_size, T2, ws); // y2*z1^3 109| | 110| 25.3k| T4.mod_sub(m_coord_x, p, sub_ws); // x2*z1^2 - x1*z2^2 111| | 112| 25.3k| T0.mod_sub(m_coord_y, p, sub_ws); 113| | 114| 25.3k| if(T4.is_zero()) { ------------------ | Branch (114:7): [True: 1, False: 25.3k] ------------------ 115| 1| if(T0.is_zero()) { ------------------ | Branch (115:10): [True: 1, False: 0] ------------------ 116| 1| mult2(ws_bn); 117| 1| return; 118| 1| } 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| 1| } 126| | 127| 25.3k| m_curve.sqr(T2, T4, ws); 128| | 129| 25.3k| m_curve.mul(T3, m_coord_x, T2, ws); 130| | 131| 25.3k| m_curve.mul(T1, T2, T4, ws); 132| | 133| 25.3k| m_curve.sqr(m_coord_x, T0, ws); 134| 25.3k| m_coord_x.mod_sub(T1, p, sub_ws); 135| | 136| 25.3k| m_coord_x.mod_sub(T3, p, sub_ws); 137| 25.3k| m_coord_x.mod_sub(T3, p, sub_ws); 138| | 139| 25.3k| T3.mod_sub(m_coord_x, p, sub_ws); 140| | 141| 25.3k| m_curve.mul(T2, T0, T3, ws); 142| 25.3k| m_curve.mul(T0, m_coord_y, T1, ws); 143| 25.3k| T2.mod_sub(T0, p, sub_ws); 144| 25.3k| m_coord_y.swap(T2); 145| | 146| 25.3k| m_curve.mul(T0, m_coord_z, T4, ws); 147| 25.3k| m_coord_z.swap(T0); 148| 25.3k|} _ZN5Botan8EC_Point3addEPKmmS2_mS2_mRNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE: 156| 179k| std::vector& ws_bn) { 157| 179k| if((CT::all_zeros(x_words, x_size) & CT::all_zeros(z_words, z_size)).is_set()) { ------------------ | Branch (157:7): [True: 4.82k, False: 174k] ------------------ 158| 4.82k| return; 159| 4.82k| } 160| | 161| 174k| if(is_zero()) { ------------------ | Branch (161:7): [True: 1.32k, False: 173k] ------------------ 162| 1.32k| m_coord_x.set_words(x_words, x_size); 163| 1.32k| m_coord_y.set_words(y_words, y_size); 164| 1.32k| m_coord_z.set_words(z_words, z_size); 165| 1.32k| return; 166| 1.32k| } 167| | 168| 173k| resize_ws(ws_bn, m_curve.get_ws_size()); 169| | 170| 173k| secure_vector& ws = ws_bn[0].get_word_vector(); 171| 173k| secure_vector& sub_ws = ws_bn[1].get_word_vector(); 172| | 173| 173k| BigInt& T0 = ws_bn[2]; 174| 173k| BigInt& T1 = ws_bn[3]; 175| 173k| BigInt& T2 = ws_bn[4]; 176| 173k| BigInt& T3 = ws_bn[5]; 177| 173k| BigInt& T4 = ws_bn[6]; 178| 173k| 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| 173k| const BigInt& p = m_curve.get_p(); 185| | 186| 173k| m_curve.sqr(T0, z_words, z_size, ws); // z2^2 187| 173k| m_curve.mul(T1, m_coord_x, T0, ws); // x1*z2^2 188| 173k| m_curve.mul(T3, z_words, z_size, T0, ws); // z2^3 189| 173k| m_curve.mul(T2, m_coord_y, T3, ws); // y1*z2^3 190| | 191| 173k| m_curve.sqr(T3, m_coord_z, ws); // z1^2 192| 173k| m_curve.mul(T4, x_words, x_size, T3, ws); // x2*z1^2 193| | 194| 173k| m_curve.mul(T5, m_coord_z, T3, ws); // z1^3 195| 173k| m_curve.mul(T0, y_words, y_size, T5, ws); // y2*z1^3 196| | 197| 173k| T4.mod_sub(T1, p, sub_ws); // x2*z1^2 - x1*z2^2 198| | 199| 173k| T0.mod_sub(T2, p, sub_ws); 200| | 201| 173k| if(T4.is_zero()) { ------------------ | Branch (201:7): [True: 1.39k, False: 171k] ------------------ 202| 1.39k| if(T0.is_zero()) { ------------------ | Branch (202:10): [True: 464, False: 931] ------------------ 203| 464| mult2(ws_bn); 204| 464| return; 205| 464| } 206| | 207| | // setting to zero: 208| 931| m_coord_x.clear(); 209| 931| m_coord_y = m_curve.get_1_rep(); 210| 931| m_coord_z.clear(); 211| 931| return; 212| 1.39k| } 213| | 214| 171k| m_curve.sqr(T5, T4, ws); 215| | 216| 171k| m_curve.mul(T3, T1, T5, ws); 217| | 218| 171k| m_curve.mul(T1, T5, T4, ws); 219| | 220| 171k| m_curve.sqr(m_coord_x, T0, ws); 221| 171k| m_coord_x.mod_sub(T1, p, sub_ws); 222| 171k| m_coord_x.mod_sub(T3, p, sub_ws); 223| 171k| m_coord_x.mod_sub(T3, p, sub_ws); 224| | 225| 171k| T3.mod_sub(m_coord_x, p, sub_ws); 226| | 227| 171k| m_curve.mul(m_coord_y, T0, T3, ws); 228| 171k| m_curve.mul(T3, T2, T1, ws); 229| | 230| 171k| m_coord_y.mod_sub(T3, p, sub_ws); 231| | 232| 171k| m_curve.mul(T3, z_words, z_size, m_coord_z, ws); 233| 171k| m_curve.mul(m_coord_z, T3, T4, ws); 234| 171k|} _ZN5Botan8EC_Point6mult2iEmRNSt3__16vectorINS_6BigIntENS1_9allocatorIS3_EEEE: 236| 48.7k|void EC_Point::mult2i(size_t iterations, std::vector& ws_bn) { 237| 48.7k| if(iterations == 0) { ------------------ | Branch (237:7): [True: 0, False: 48.7k] ------------------ 238| 0| return; 239| 0| } 240| | 241| 48.7k| if(m_coord_y.is_zero()) { ------------------ | Branch (241:7): [True: 0, False: 48.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| 146k| for(size_t i = 0; i != iterations; ++i) { ------------------ | Branch (250:22): [True: 97.4k, False: 48.7k] ------------------ 251| 97.4k| mult2(ws_bn); 252| 97.4k| } 253| 48.7k|} _ZN5Botan8EC_Point5mult2ERNSt3__16vectorINS_6BigIntENS1_9allocatorIS3_EEEE: 256| 216k|void EC_Point::mult2(std::vector& ws_bn) { 257| 216k| if(is_zero()) { ------------------ | Branch (257:7): [True: 1.98k, False: 214k] ------------------ 258| 1.98k| return; 259| 1.98k| } 260| | 261| 214k| if(m_coord_y.is_zero()) { ------------------ | Branch (261:7): [True: 3, False: 214k] ------------------ 262| 3| *this = EC_Point(m_curve); // setting myself to zero 263| 3| return; 264| 3| } 265| | 266| 214k| resize_ws(ws_bn, m_curve.get_ws_size()); 267| | 268| 214k| secure_vector& ws = ws_bn[0].get_word_vector(); 269| 214k| secure_vector& sub_ws = ws_bn[1].get_word_vector(); 270| | 271| 214k| BigInt& T0 = ws_bn[2]; 272| 214k| BigInt& T1 = ws_bn[3]; 273| 214k| BigInt& T2 = ws_bn[4]; 274| 214k| BigInt& T3 = ws_bn[5]; 275| 214k| BigInt& T4 = ws_bn[6]; 276| | 277| | /* 278| | https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-1986-cc 279| | */ 280| 214k| const BigInt& p = m_curve.get_p(); 281| | 282| 214k| m_curve.sqr(T0, m_coord_y, ws); 283| | 284| 214k| m_curve.mul(T1, m_coord_x, T0, ws); 285| 214k| T1.mod_mul(4, p, sub_ws); 286| | 287| 214k| if(m_curve.a_is_zero()) { ------------------ | Branch (287:7): [True: 68.1k, False: 146k] ------------------ 288| | // if a == 0 then 3*x^2 + a*z^4 is just 3*x^2 289| 68.1k| m_curve.sqr(T4, m_coord_x, ws); // x^2 290| 68.1k| T4.mod_mul(3, p, sub_ws); // 3*x^2 291| 146k| } else if(m_curve.a_is_minus_3()) { ------------------ | Branch (291:14): [True: 146k, 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| 146k| m_curve.sqr(T3, m_coord_z, ws); // z^2 297| | 298| | // (x-z^2) 299| 146k| T2 = m_coord_x; 300| 146k| T2.mod_sub(T3, p, sub_ws); 301| | 302| | // (x+z^2) 303| 146k| T3.mod_add(m_coord_x, p, sub_ws); 304| | 305| 146k| m_curve.mul(T4, T2, T3, ws); // (x-z^2)*(x+z^2) 306| | 307| 146k| T4.mod_mul(3, p, sub_ws); // 3*(x-z^2)*(x+z^2) 308| 146k| } 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| 214k| m_curve.sqr(T2, T4, ws); 319| 214k| T2.mod_sub(T1, p, sub_ws); 320| 214k| T2.mod_sub(T1, p, sub_ws); 321| | 322| 214k| m_curve.sqr(T3, T0, ws); 323| 214k| T3.mod_mul(8, p, sub_ws); 324| | 325| 214k| T1.mod_sub(T2, p, sub_ws); 326| | 327| 214k| m_curve.mul(T0, T4, T1, ws); 328| 214k| T0.mod_sub(T3, p, sub_ws); 329| | 330| 214k| m_coord_x.swap(T2); 331| | 332| 214k| m_curve.mul(T2, m_coord_y, m_coord_z, ws); 333| 214k| T2.mod_mul(2, p, sub_ws); 334| | 335| 214k| m_coord_y.swap(T0); 336| 214k| m_coord_z.swap(T2); 337| 214k|} _ZN5Botan8EC_Point16force_all_affineERNSt3__16vectorIS0_NS1_9allocatorIS0_EEEERNS2_ImNS_16secure_allocatorImEEEE: 388| 743|void EC_Point::force_all_affine(std::vector& points, secure_vector& ws) { 389| 743| if(points.size() <= 1) { ------------------ | Branch (389:7): [True: 0, False: 743] ------------------ 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| 274k| for(auto& point : points) { ------------------ | Branch (396:20): [True: 274k, False: 735] ------------------ 397| 274k| if(point.is_zero()) { ------------------ | Branch (397:10): [True: 8, False: 274k] ------------------ 398| 8| throw Invalid_State("Cannot convert zero ECC point to affine"); 399| 8| } 400| 274k| } 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| 735| const CurveGFp& curve = points[0].m_curve; 412| 735| const BigInt& rep_1 = curve.get_1_rep(); 413| | 414| 735| if(ws.size() < curve.get_ws_size()) { ------------------ | Branch (414:7): [True: 0, False: 735] ------------------ 415| 0| ws.resize(curve.get_ws_size()); 416| 0| } 417| | 418| 735| std::vector c(points.size()); 419| 735| c[0] = points[0].m_coord_z; 420| | 421| 274k| for(size_t i = 1; i != points.size(); ++i) { ------------------ | Branch (421:22): [True: 273k, False: 735] ------------------ 422| 273k| curve.mul(c[i], c[i - 1], points[i].m_coord_z, ws); 423| 273k| } 424| | 425| 735| BigInt s_inv = curve.invert_element(c[c.size() - 1], ws); 426| | 427| 735| BigInt z_inv, z2_inv, z3_inv; 428| | 429| 274k| for(size_t i = points.size() - 1; i != 0; i--) { ------------------ | Branch (429:38): [True: 273k, False: 735] ------------------ 430| 273k| EC_Point& point = points[i]; 431| | 432| 273k| curve.mul(z_inv, s_inv, c[i - 1], ws); 433| | 434| 273k| s_inv = curve.mul_to_tmp(s_inv, point.m_coord_z, ws); 435| | 436| 273k| curve.sqr(z2_inv, z_inv, ws); 437| 273k| curve.mul(z3_inv, z2_inv, z_inv, ws); 438| 273k| point.m_coord_x = curve.mul_to_tmp(point.m_coord_x, z2_inv, ws); 439| 273k| point.m_coord_y = curve.mul_to_tmp(point.m_coord_y, z3_inv, ws); 440| 273k| point.m_coord_z = rep_1; 441| 273k| } 442| | 443| 735| curve.sqr(z2_inv, s_inv, ws); 444| 735| curve.mul(z3_inv, z2_inv, s_inv, ws); 445| 735| points[0].m_coord_x = curve.mul_to_tmp(points[0].m_coord_x, z2_inv, ws); 446| 735| points[0].m_coord_y = curve.mul_to_tmp(points[0].m_coord_y, z3_inv, ws); 447| 735| points[0].m_coord_z = rep_1; 448| 735|} _ZNK5Botan8EC_Point9is_affineEv: 465| 307|bool EC_Point::is_affine() const { return m_curve.is_one(m_coord_z); } _ZNK5Botan8EC_Point12get_affine_xEv: 467| 307|BigInt EC_Point::get_affine_x() const { 468| 307| if(is_zero()) { ------------------ | Branch (468:7): [True: 0, False: 307] ------------------ 469| 0| throw Invalid_State("Cannot convert zero point to affine"); 470| 0| } 471| | 472| 307| secure_vector monty_ws; 473| | 474| 307| if(is_affine()) { ------------------ | Branch (474:7): [True: 0, False: 307] ------------------ 475| 0| return m_curve.from_rep_to_tmp(m_coord_x, monty_ws); 476| 0| } 477| | 478| 307| BigInt z2 = m_curve.sqr_to_tmp(m_coord_z, monty_ws); 479| 307| z2 = m_curve.invert_element(z2, monty_ws); 480| | 481| 307| BigInt r; 482| 307| m_curve.mul(r, m_coord_x, z2, monty_ws); 483| 307| m_curve.from_rep(r, monty_ws); 484| 307| return r; 485| 307|} _ZNK5Botan8EC_Point12on_the_curveEv: 508| 1.92k|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.92k| if(is_zero()) { ------------------ | Branch (515:7): [True: 135, False: 1.79k] ------------------ 516| 135| return true; 517| 135| } 518| | 519| 1.79k| secure_vector monty_ws; 520| | 521| 1.79k| const BigInt y2 = m_curve.from_rep_to_tmp(m_curve.sqr_to_tmp(m_coord_y, monty_ws), monty_ws); 522| 1.79k| 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.79k| const BigInt ax = m_curve.mul_to_tmp(m_coord_x, m_curve.get_a_rep(), monty_ws); 524| 1.79k| const BigInt z2 = m_curve.sqr_to_tmp(m_coord_z, monty_ws); 525| | 526| 1.79k| if(m_coord_z == z2) // Is z equal to 1 (in Montgomery form)? ------------------ | Branch (526:7): [True: 1.79k, False: 0] ------------------ 527| 1.79k| { 528| 1.79k| if(y2 != m_curve.from_rep_to_tmp(x3 + ax + m_curve.get_b_rep(), monty_ws)) { ------------------ | Branch (528:10): [True: 145, False: 1.64k] ------------------ 529| 145| return false; 530| 145| } 531| 1.79k| } 532| | 533| 1.64k| const BigInt z3 = m_curve.mul_to_tmp(m_coord_z, z2, monty_ws); 534| 1.64k| const BigInt ax_z4 = m_curve.mul_to_tmp(ax, m_curve.sqr_to_tmp(z2, monty_ws), monty_ws); 535| 1.64k| 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.64k| if(y2 != m_curve.from_rep_to_tmp(x3 + ax_z4 + b_z6, monty_ws)) { ------------------ | Branch (537:7): [True: 0, False: 1.64k] ------------------ 538| 0| return false; 539| 0| } 540| | 541| 1.64k| return true; 542| 1.64k|} _ZN5Botan8EC_Point4swapERS0_: 545| 240k|void EC_Point::swap(EC_Point& other) { 546| 240k| m_curve.swap(other.m_curve); 547| 240k| m_coord_x.swap(other.m_coord_x); 548| 240k| m_coord_y.swap(other.m_coord_y); 549| 240k| m_coord_z.swap(other.m_coord_z); 550| 240k|} _ZN5Botan6OS2ECPEPKhmRKNS_8CurveGFpE: 625| 1.65k|EC_Point OS2ECP(const uint8_t data[], size_t data_len, const CurveGFp& curve) { 626| | // Should we really be doing this? 627| 1.65k| if(data_len <= 1) { ------------------ | Branch (627:7): [True: 139, False: 1.51k] ------------------ 628| 139| return EC_Point(curve); // return zero 629| 139| } 630| | 631| 1.51k| std::pair xy = OS2ECP(data, data_len, curve.get_p(), curve.get_a(), curve.get_b()); 632| | 633| 1.51k| EC_Point point(curve, xy.first, xy.second); 634| | 635| 1.51k| if(!point.on_the_curve()) { ------------------ | Branch (635:7): [True: 141, False: 1.37k] ------------------ 636| 141| throw Decoding_Error("OS2ECP: Decoded point was not on the curve"); 637| 141| } 638| | 639| 1.37k| return point; 640| 1.51k|} _ZN5Botan6OS2ECPEPKhmRKNS_6BigIntES4_S4_: 643| 1.73k| const uint8_t data[], size_t data_len, const BigInt& curve_p, const BigInt& curve_a, const BigInt& curve_b) { 644| 1.73k| if(data_len <= 1) { ------------------ | Branch (644:7): [True: 1, False: 1.73k] ------------------ 645| 1| throw Decoding_Error("OS2ECP invalid point"); 646| 1| } 647| | 648| 1.73k| const uint8_t pc = data[0]; 649| | 650| 1.73k| BigInt x, y; 651| | 652| 1.73k| if(pc == 2 || pc == 3) { ------------------ | Branch (652:7): [True: 522, False: 1.21k] | Branch (652:18): [True: 693, False: 518] ------------------ 653| | //compressed form 654| 1.21k| x = BigInt::decode(&data[1], data_len - 1); 655| | 656| 1.21k| const bool y_mod_2 = ((pc & 0x01) == 1); 657| 1.21k| y = decompress_point(y_mod_2, x, curve_p, curve_a, curve_b); 658| 1.21k| } else if(pc == 4) { ------------------ | Branch (658:14): [True: 346, False: 172] ------------------ 659| 346| const size_t l = (data_len - 1) / 2; 660| | 661| | // uncompressed form 662| 346| x = BigInt::decode(&data[1], l); 663| 346| y = BigInt::decode(&data[l + 1], l); 664| 346| } else if(pc == 6 || pc == 7) { ------------------ | Branch (664:14): [True: 87, False: 85] | Branch (664:25): [True: 69, False: 16] ------------------ 665| 156| const size_t l = (data_len - 1) / 2; 666| | 667| | // hybrid form 668| 156| x = BigInt::decode(&data[1], l); 669| 156| y = BigInt::decode(&data[l + 1], l); 670| | 671| 156| const bool y_mod_2 = ((pc & 0x01) == 1); 672| | 673| 156| if(decompress_point(y_mod_2, x, curve_p, curve_a, curve_b) != y) { ------------------ | Branch (673:10): [True: 119, False: 37] ------------------ 674| 119| throw Decoding_Error("OS2ECP: Decoding error in hybrid format"); 675| 119| } 676| 156| } else { 677| 16| throw Invalid_Argument("OS2ECP: Unknown format type " + std::to_string(pc)); 678| 16| } 679| | 680| 1.59k| return std::make_pair(x, y); 681| 1.73k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_19resize_wsERNSt3__16vectorINS_6BigIntENS1_9allocatorIS3_EEEEm: 61| 412k|inline void resize_ws(std::vector& ws_bn, size_t cap_size) { 62| 412k| BOTAN_ASSERT(ws_bn.size() >= EC_Point::WORKSPACE_SIZE, "Expected size for EC_Point workspace"); ------------------ | | 51| 412k| do { \ | | 52| 412k| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 0, False: 412k] | | ------------------ | | 53| 412k| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 412k| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 63| | 64| 3.30M| for(auto& ws : ws_bn) { ------------------ | Branch (64:17): [True: 3.30M, False: 412k] ------------------ 65| 3.30M| if(ws.size() < cap_size) { ------------------ | Branch (65:10): [True: 10.4k, False: 3.29M] ------------------ 66| 10.4k| ws.get_word_vector().resize(cap_size); 67| 10.4k| } 68| 3.30M| } 69| 412k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_116decompress_pointEbRKNS_6BigIntES3_S3_S3_: 602| 1.37k| bool yMod2, const BigInt& x, const BigInt& curve_p, const BigInt& curve_a, const BigInt& curve_b) { 603| 1.37k| BigInt xpow3 = x * x * x; 604| | 605| 1.37k| BigInt g = curve_a * x; 606| 1.37k| g += xpow3; 607| 1.37k| g += curve_b; 608| 1.37k| g = g % curve_p; 609| | 610| 1.37k| BigInt z = sqrt_modulo_prime(g, curve_p); 611| | 612| 1.37k| if(z < 0) { ------------------ | Branch (612:7): [True: 288, False: 1.08k] ------------------ 613| 288| throw Decoding_Error("Error during EC point decompression"); 614| 288| } 615| | 616| 1.08k| if(z.get_bit(0) != yMod2) { ------------------ | Branch (616:7): [True: 558, False: 525] ------------------ 617| 558| z = curve_p - z; 618| 558| } 619| | 620| 1.08k| return z; 621| 1.37k|} _ZN5Botan30EC_Point_Base_Point_PrecomputeC2ERKNS_8EC_PointERKNS_15Modular_ReducerE: 28| 349| m_base_point(base), m_mod_order(mod_order), m_p_words(base.get_curve().get_p().sig_words()) { 29| 349| std::vector ws(EC_Point::WORKSPACE_SIZE); 30| | 31| 349| 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| 349| const size_t T_bits = round_up(p_bits + blinding_size(mod_order.get_modulus()) + 1, WINDOW_BITS) / WINDOW_BITS; 39| | 40| 349| std::vector T(WINDOW_SIZE * T_bits); 41| | 42| 349| EC_Point g = base; 43| 349| EC_Point g2, g4; 44| | 45| 39.4k| for(size_t i = 0; i != T_bits; i++) { ------------------ | Branch (45:22): [True: 39.0k, False: 349] ------------------ 46| 39.0k| g2 = g; 47| 39.0k| g2.mult2(ws); 48| 39.0k| g4 = g2; 49| 39.0k| g4.mult2(ws); 50| | 51| 39.0k| T[7 * i + 0] = g; 52| 39.0k| T[7 * i + 1] = std::move(g2); 53| 39.0k| T[7 * i + 2] = T[7 * i + 1].plus(T[7 * i + 0], ws); // g2+g 54| 39.0k| T[7 * i + 3] = g4; 55| 39.0k| T[7 * i + 4] = T[7 * i + 3].plus(T[7 * i + 0], ws); // g4+g 56| 39.0k| T[7 * i + 5] = T[7 * i + 3].plus(T[7 * i + 1], ws); // g4+g2 57| 39.0k| T[7 * i + 6] = T[7 * i + 3].plus(T[7 * i + 2], ws); // g4+g2+g 58| | 59| 39.0k| g.swap(g4); 60| 39.0k| g.mult2(ws); 61| 39.0k| } 62| | 63| 349| EC_Point::force_all_affine(T, ws[0].get_word_vector()); 64| | 65| 349| m_W.resize(T.size() * 2 * m_p_words); 66| | 67| 349| word* p = &m_W[0]; 68| 268k| for(size_t i = 0; i != T.size(); ++i) { ------------------ | Branch (68:22): [True: 268k, False: 349] ------------------ 69| 268k| T[i].get_x().encode_words(p, m_p_words); 70| 268k| p += m_p_words; 71| 268k| T[i].get_y().encode_words(p, m_p_words); 72| 268k| p += m_p_words; 73| 268k| } 74| 349|} _ZN5Botan31EC_Point_Multi_Point_PrecomputeC2ERKNS_8EC_PointES3_: 293| 536|EC_Point_Multi_Point_Precompute::EC_Point_Multi_Point_Precompute(const EC_Point& x, const EC_Point& y) { 294| 536| if(x.on_the_curve() == false || y.on_the_curve() == false) { ------------------ | Branch (294:7): [True: 0, False: 536] | Branch (294:36): [True: 0, False: 536] ------------------ 295| 0| m_M.push_back(x.zero()); 296| 0| return; 297| 0| } 298| | 299| 536| std::vector ws(EC_Point::WORKSPACE_SIZE); 300| | 301| 536| EC_Point x2 = x; 302| 536| x2.mult2(ws); 303| | 304| 536| const EC_Point x3(x2.plus(x, ws)); 305| | 306| 536| EC_Point y2 = y; 307| 536| y2.mult2(ws); 308| | 309| 536| const EC_Point y3(y2.plus(y, ws)); 310| | 311| 536| m_M.reserve(15); 312| | 313| 536| m_M.push_back(x); 314| 536| m_M.push_back(x2); 315| 536| m_M.push_back(x3); 316| | 317| 536| m_M.push_back(y); 318| 536| m_M.push_back(y.plus(x, ws)); 319| 536| m_M.push_back(y.plus(x2, ws)); 320| 536| m_M.push_back(y.plus(x3, ws)); 321| | 322| 536| m_M.push_back(y2); 323| 536| m_M.push_back(y2.plus(x, ws)); 324| 536| m_M.push_back(y2.plus(x2, ws)); 325| 536| m_M.push_back(y2.plus(x3, ws)); 326| | 327| 536| m_M.push_back(y3); 328| 536| m_M.push_back(y3.plus(x, ws)); 329| 536| m_M.push_back(y3.plus(x2, ws)); 330| 536| m_M.push_back(y3.plus(x3, ws)); 331| | 332| 536| bool no_infinity = true; 333| 8.04k| for(auto& pt : m_M) { ------------------ | Branch (333:17): [True: 8.04k, False: 536] ------------------ 334| 8.04k| if(pt.is_zero()) { ------------------ | Branch (334:10): [True: 426, False: 7.61k] ------------------ 335| 426| no_infinity = false; 336| 426| } 337| 8.04k| } 338| | 339| 536| if(no_infinity) { ------------------ | Branch (339:7): [True: 394, False: 142] ------------------ 340| 394| EC_Point::force_all_affine(m_M, ws[0].get_word_vector()); 341| 394| } 342| | 343| 536| m_no_infinity = no_infinity; 344| 536|} _ZNK5Botan31EC_Point_Multi_Point_Precompute9multi_expERKNS_6BigIntES3_: 346| 307|EC_Point EC_Point_Multi_Point_Precompute::multi_exp(const BigInt& z1, const BigInt& z2) const { 347| 307| if(m_M.size() == 1) { ------------------ | Branch (347:7): [True: 0, False: 307] ------------------ 348| 0| return m_M[0]; 349| 0| } 350| | 351| 307| std::vector ws(EC_Point::WORKSPACE_SIZE); 352| | 353| 307| const size_t z_bits = round_up(std::max(z1.bits(), z2.bits()), 2); 354| | 355| 307| EC_Point H = m_M[0].zero(); 356| | 357| 49.3k| for(size_t i = 0; i != z_bits; i += 2) { ------------------ | Branch (357:22): [True: 49.0k, False: 307] ------------------ 358| 49.0k| if(i > 0) { ------------------ | Branch (358:10): [True: 48.7k, False: 307] ------------------ 359| 48.7k| H.mult2i(2, ws); 360| 48.7k| } 361| | 362| 49.0k| const uint32_t z1_b = z1.get_substring(z_bits - i - 2, 2); 363| 49.0k| const uint32_t z2_b = z2.get_substring(z_bits - i - 2, 2); 364| | 365| 49.0k| const uint32_t z12 = (4 * z2_b) + z1_b; 366| | 367| | // This function is not intended to be const time 368| 49.0k| if(z12) { ------------------ | Branch (368:10): [True: 42.6k, False: 6.39k] ------------------ 369| 42.6k| if(m_no_infinity) { ------------------ | Branch (369:13): [True: 25.5k, False: 17.1k] ------------------ 370| 25.5k| H.add_affine(m_M[z12 - 1], ws); 371| 25.5k| } else { 372| 17.1k| H.add(m_M[z12 - 1], ws); 373| 17.1k| } 374| 42.6k| } 375| 49.0k| } 376| | 377| 307| if(z1.is_negative() != z2.is_negative()) { ------------------ | Branch (377:7): [True: 0, False: 307] ------------------ 378| 0| H.negate(); 379| 0| } 380| | 381| 307| return H; 382| 307|} point_mul.cpp:_ZN5Botan12_GLOBAL__N_113blinding_sizeERKNS_6BigIntE: 18| 349|size_t blinding_size(const BigInt& group_order) { return (group_order.bits() + 1) / 2; } _ZN5Botan12EC_PublicKeyC2ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 43| 1.92k| m_domain_encoding(default_encoding_for(m_domain_params)) {} ecc_key.cpp:_ZN5Botan12_GLOBAL__N_120default_encoding_forERNS_8EC_GroupE: 27| 771|EC_Group_Encoding default_encoding_for(EC_Group& group) { 28| 771| if(group.get_curve_oid().empty()) { ------------------ | Branch (28:7): [True: 0, False: 771] ------------------ 29| 0| return EC_Group_Encoding::Explicit; 30| 771| } else { 31| 771| return EC_Group_Encoding::NamedCurve; 32| 771| } 33| 771|} _ZNK5Botan15ECDSA_PublicKey27create_x509_verification_opERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE: 255| 769| const AlgorithmIdentifier& signature_algorithm, std::string_view provider) const { 256| 769| if(provider == "base" || provider.empty()) { ------------------ | Branch (256:7): [True: 0, False: 769] | Branch (256:29): [True: 769, False: 0] ------------------ 257| 769| return std::make_unique(*this, signature_algorithm); 258| 769| } 259| | 260| 0| throw Provider_Not_Found(algo_name(), provider); 261| 769|} ecdsa.cpp:_ZN5Botan12_GLOBAL__N_128ECDSA_Verification_Operation6verifyEPKhmS3_m: 210| 458|bool ECDSA_Verification_Operation::verify(const uint8_t msg[], size_t msg_len, const uint8_t sig[], size_t sig_len) { 211| 458| if(sig_len != m_group.get_order_bytes() * 2) { ------------------ | Branch (211:7): [True: 214, False: 244] ------------------ 212| 214| return false; 213| 214| } 214| | 215| 244| const BigInt e = BigInt::from_bytes_with_max_bits(msg, msg_len, m_group.get_order_bits()); 216| | 217| 244| const BigInt r(sig, sig_len / 2); 218| 244| const BigInt s(sig + sig_len / 2, sig_len / 2); 219| | 220| | // Cannot be negative here since we just decoded from binary 221| 244| if(r.is_zero() || s.is_zero()) { ------------------ | Branch (221:7): [True: 4, False: 240] | Branch (221:22): [True: 2, False: 238] ------------------ 222| 6| return false; 223| 6| } 224| | 225| 238| if(r >= m_group.get_order() || s >= m_group.get_order()) { ------------------ | Branch (225:7): [True: 0, False: 238] | Branch (225:35): [True: 0, False: 238] ------------------ 226| 0| return false; 227| 0| } 228| | 229| 238| const BigInt w = m_group.inverse_mod_order(s); 230| | 231| 238| const BigInt u1 = m_group.multiply_mod_order(m_group.mod_order(e), w); 232| 238| const BigInt u2 = m_group.multiply_mod_order(r, w); 233| 238| const EC_Point R = m_gy_mul.multi_exp(u1, u2); 234| | 235| 238| if(R.is_zero()) { ------------------ | Branch (235:7): [True: 0, False: 238] ------------------ 236| 0| return false; 237| 0| } 238| | 239| 238| const BigInt v = m_group.mod_order(R.get_affine_x()); 240| 238| return (v == r); 241| 238|} ecdsa.cpp:_ZN5Botan12_GLOBAL__N_128ECDSA_Verification_OperationC2ERKNS_15ECDSA_PublicKeyERKNS_19AlgorithmIdentifierE: 201| 769| m_gy_mul(m_group.get_base_point(), ecdsa.public_point()) {} _ZN5Botan17Ed25519_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 73| 1|Ed25519_PublicKey::Ed25519_PublicKey(const AlgorithmIdentifier& /*unused*/, std::span key_bits) { 74| 1| m_public.assign(key_bits.begin(), key_bits.end()); 75| | 76| 1| if(m_public.size() != 32) { ------------------ | Branch (76:7): [True: 1, False: 0] ------------------ 77| 1| throw Decoding_Error("Invalid size for Ed25519 public key"); 78| 1| } 79| 1|} _ZN5Botan19GOST_3410_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 64| 101|GOST_3410_PublicKey::GOST_3410_PublicKey(const AlgorithmIdentifier& alg_id, std::span key_bits) { 65| 101| OID ecc_param_id; 66| | 67| | // The parameters also includes hash and cipher OIDs 68| 101| BER_Decoder(alg_id.parameters()).start_sequence().decode(ecc_param_id); 69| | 70| 101| m_domain_params = EC_Group(ecc_param_id); 71| | 72| 101| const size_t p_bits = m_domain_params.get_p_bits(); 73| 101| if(p_bits != 256 && p_bits != 512) { ------------------ | Branch (73:7): [True: 3, False: 98] | Branch (73:24): [True: 3, False: 0] ------------------ 74| 3| throw Decoding_Error(fmt("GOST-34.10-2012 is not defined for parameters of size {}", p_bits)); 75| 3| } 76| | 77| 98| secure_vector bits; 78| 98| BER_Decoder(key_bits).decode(bits, ASN1_Type::OctetString); 79| | 80| 98| if(bits.size() != 2 * (p_bits / 8)) { ------------------ | Branch (80:7): [True: 3, False: 95] ------------------ 81| 3| throw Decoding_Error("GOST-34.10-2020 invalid encoding of public key"); 82| 3| } 83| | 84| 95| const size_t part_size = bits.size() / 2; 85| | 86| | // Keys are stored in little endian format (WTF) 87| 1.40k| for(size_t i = 0; i != part_size / 2; ++i) { ------------------ | Branch (87:22): [True: 1.31k, False: 95] ------------------ 88| 1.31k| std::swap(bits[i], bits[part_size - 1 - i]); 89| 1.31k| std::swap(bits[part_size + i], bits[2 * part_size - 1 - i]); 90| 1.31k| } 91| | 92| 95| BigInt x(bits.data(), part_size); 93| 95| BigInt y(&bits[part_size], part_size); 94| | 95| 95| m_public_key = domain().point(x, y); 96| | 97| 95| BOTAN_ASSERT(m_public_key.on_the_curve(), "Loaded GOST 34.10 public key is on the curve"); ------------------ | | 51| 95| do { \ | | 52| 95| if(!(expr)) \ | | ------------------ | | | Branch (52:10): [True: 4, False: 91] | | ------------------ | | 53| 95| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 54| 95| } while(0) | | ------------------ | | | Branch (54:12): [Folded - Ignored] | | ------------------ ------------------ 98| 95|} _ZNK5Botan19GOST_3410_PublicKey27create_x509_verification_opERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE: 282| 77| const AlgorithmIdentifier& signature_algorithm, std::string_view provider) const { 283| 77| if(provider == "base" || provider.empty()) { ------------------ | Branch (283:7): [True: 0, False: 77] | Branch (283:29): [True: 77, False: 0] ------------------ 284| 77| return std::make_unique(*this, signature_algorithm); 285| 77| } 286| | 287| 0| throw Provider_Not_Found(algo_name(), provider); 288| 77|} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_132GOST_3410_Verification_Operation6verifyEPKhmS3_m: 237| 74| size_t sig_len) { 238| 74| if(sig_len != m_group.get_order_bytes() * 2) { ------------------ | Branch (238:7): [True: 1, False: 73] ------------------ 239| 1| return false; 240| 1| } 241| | 242| 73| const BigInt s(sig, sig_len / 2); 243| 73| const BigInt r(sig + sig_len / 2, sig_len / 2); 244| | 245| 73| const BigInt& order = m_group.get_order(); 246| | 247| 73| if(r <= 0 || r >= order || s <= 0 || s >= order) { ------------------ | Branch (247:7): [True: 1, False: 72] | Branch (247:17): [True: 1, False: 71] | Branch (247:31): [True: 1, False: 70] | Branch (247:41): [True: 1, False: 69] ------------------ 248| 4| return false; 249| 4| } 250| | 251| 69| BigInt e = decode_le(msg, msg_len); 252| 69| e = m_group.mod_order(e); 253| 69| if(e.is_zero()) { ------------------ | Branch (253:7): [True: 0, False: 69] ------------------ 254| 0| e = BigInt::one(); 255| 0| } 256| | 257| 69| const BigInt v = m_group.inverse_mod_order(e); 258| | 259| 69| const BigInt z1 = m_group.multiply_mod_order(s, v); 260| 69| const BigInt z2 = m_group.multiply_mod_order(-r, v); 261| | 262| 69| const EC_Point R = m_gy_mul.multi_exp(z1, z2); 263| | 264| 69| if(R.is_zero()) { ------------------ | Branch (264:7): [True: 0, False: 69] ------------------ 265| 0| return false; 266| 0| } 267| | 268| 69| return (R.get_affine_x() == r); 269| 69|} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_19decode_leEPKhm: 114| 69|BigInt decode_le(const uint8_t msg[], size_t msg_len) { 115| 69| secure_vector msg_le(msg, msg + msg_len); 116| | 117| 1.17k| for(size_t i = 0; i != msg_le.size() / 2; ++i) { ------------------ | Branch (117:22): [True: 1.10k, False: 69] ------------------ 118| 1.10k| std::swap(msg_le[i], msg_le[msg_le.size() - 1 - i]); 119| 1.10k| } 120| | 121| 69| return BigInt(msg_le.data(), msg_le.size()); 122| 69|} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_132GOST_3410_Verification_OperationC2ERKNS_19GOST_3410_PublicKeyERKNS_19AlgorithmIdentifierE: 225| 77| m_gy_mul(m_group.get_base_point(), gost.public_point()) {} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_120gost_hash_from_algidERKNS_19AlgorithmIdentifierE: 190| 77|std::string gost_hash_from_algid(const AlgorithmIdentifier& alg_id) { 191| 77| if(!alg_id.parameters_are_empty()) { ------------------ | Branch (191:7): [True: 1, False: 76] ------------------ 192| 1| throw Decoding_Error("Unexpected non-empty AlgorithmIdentifier parameters for GOST 34.10 signature"); 193| 1| } 194| | 195| 76| const std::string oid_str = alg_id.oid().to_formatted_string(); 196| 76| if(oid_str == "GOST-34.10/GOST-R-34.11-94") { ------------------ | Branch (196:7): [True: 0, False: 76] ------------------ 197| 0| return "GOST-R-34.11-94"; 198| 0| } 199| 76| if(oid_str == "GOST-34.10-2012-256/Streebog-256") { ------------------ | Branch (199:7): [True: 74, False: 2] ------------------ 200| 74| return "Streebog-256"; 201| 74| } 202| 2| if(oid_str == "GOST-34.10-2012-512/Streebog-512") { ------------------ | Branch (202:7): [True: 0, False: 2] ------------------ 203| 0| return "Streebog-512"; 204| 0| } 205| 2| if(oid_str == "GOST-34.10-2012-256/SHA-256") { ------------------ | Branch (205:7): [True: 0, False: 2] ------------------ 206| 0| return "SHA-256"; 207| 0| } 208| | 209| 2| throw Decoding_Error(fmt("Unknown OID ({}) for GOST 34.10 signatures", alg_id.oid())); 210| 2|} _ZN5Botan8PEM_Code6decodeERNS_10DataSourceERNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEE: 62| 313|secure_vector decode(DataSource& source, std::string& label) { 63| 313| const size_t RANDOM_CHAR_LIMIT = 8; 64| | 65| 313| label.clear(); 66| | 67| 313| const std::string PEM_HEADER1 = "-----BEGIN "; 68| 313| const std::string PEM_HEADER2 = "-----"; 69| 313| size_t position = 0; 70| | 71| 4.24k| while(position != PEM_HEADER1.length()) { ------------------ | Branch (71:10): [True: 3.97k, False: 270] ------------------ 72| 3.97k| uint8_t b; 73| 3.97k| if(!source.read_byte(b)) { ------------------ | Branch (73:10): [True: 42, False: 3.92k] ------------------ 74| 42| throw Decoding_Error("PEM: No PEM header found"); 75| 42| } 76| 3.92k| if(static_cast(b) == PEM_HEADER1[position]) { ------------------ | Branch (76:10): [True: 3.20k, False: 719] ------------------ 77| 3.20k| ++position; 78| 3.20k| } else if(position >= RANDOM_CHAR_LIMIT) { ------------------ | Branch (78:17): [True: 1, False: 718] ------------------ 79| 1| throw Decoding_Error("PEM: Malformed PEM header"); 80| 718| } else { 81| 718| position = 0; 82| 718| } 83| 3.92k| } 84| 270| position = 0; 85| 68.7k| while(position != PEM_HEADER2.length()) { ------------------ | Branch (85:10): [True: 68.4k, False: 239] ------------------ 86| 68.4k| uint8_t b; 87| 68.4k| if(!source.read_byte(b)) { ------------------ | Branch (87:10): [True: 29, False: 68.4k] ------------------ 88| 29| throw Decoding_Error("PEM: No PEM header found"); 89| 29| } 90| 68.4k| if(static_cast(b) == PEM_HEADER2[position]) { ------------------ | Branch (90:10): [True: 1.21k, False: 67.2k] ------------------ 91| 1.21k| ++position; 92| 67.2k| } else if(position) { ------------------ | Branch (92:17): [True: 2, False: 67.2k] ------------------ 93| 2| throw Decoding_Error("PEM: Malformed PEM header"); 94| 2| } 95| | 96| 68.4k| if(position == 0) { ------------------ | Branch (96:10): [True: 67.2k, False: 1.21k] ------------------ 97| 67.2k| label += static_cast(b); 98| 67.2k| } 99| 68.4k| } 100| | 101| 239| std::vector b64; 102| | 103| 239| const std::string PEM_TRAILER = fmt("-----END {}-----", label); 104| 239| position = 0; 105| 56.1k| while(position != PEM_TRAILER.length()) { ------------------ | Branch (105:10): [True: 56.0k, False: 134] ------------------ 106| 56.0k| uint8_t b; 107| 56.0k| if(!source.read_byte(b)) { ------------------ | Branch (107:10): [True: 97, False: 55.9k] ------------------ 108| 97| throw Decoding_Error("PEM: No PEM trailer found"); 109| 97| } 110| 55.9k| if(static_cast(b) == PEM_TRAILER[position]) { ------------------ | Branch (110:10): [True: 7.23k, False: 48.6k] ------------------ 111| 7.23k| ++position; 112| 48.6k| } else if(position) { ------------------ | Branch (112:17): [True: 8, False: 48.6k] ------------------ 113| 8| throw Decoding_Error("PEM: Malformed PEM trailer"); 114| 8| } 115| | 116| 55.9k| if(position == 0) { ------------------ | Branch (116:10): [True: 48.6k, False: 7.23k] ------------------ 117| 48.6k| b64.push_back(b); 118| 48.6k| } 119| 55.9k| } 120| | 121| 134| return base64_decode(b64.data(), b64.size()); 122| 239|} _ZN5Botan8PEM_Code7matchesERNS_10DataSourceENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEm: 137| 8.96k|bool matches(DataSource& source, std::string_view extra, size_t search_range) { 138| 8.96k| const std::string PEM_HEADER = fmt("-----BEGIN {}", extra); 139| | 140| 8.96k| secure_vector search_buf(search_range); 141| 8.96k| const size_t got = source.peek(search_buf.data(), search_buf.size(), 0); 142| | 143| 8.96k| if(got < PEM_HEADER.length()) { ------------------ | Branch (143:7): [True: 434, False: 8.52k] ------------------ 144| 434| return false; 145| 434| } 146| | 147| 8.52k| size_t index = 0; 148| | 149| 3.69M| for(size_t j = 0; j != got; ++j) { ------------------ | Branch (149:22): [True: 3.69M, False: 8.52k] ------------------ 150| 3.69M| if(static_cast(search_buf[j]) == PEM_HEADER[index]) { ------------------ | Branch (150:10): [True: 16.2k, False: 3.67M] ------------------ 151| 16.2k| ++index; 152| 3.67M| } else { 153| 3.67M| index = 0; 154| 3.67M| } 155| | 156| 3.69M| if(index == PEM_HEADER.size()) { ------------------ | Branch (156:10): [True: 8, False: 3.69M] ------------------ 157| 8| return true; 158| 8| } 159| 3.69M| } 160| | 161| 8.52k| return false; 162| 8.52k|} _ZN5Botan15load_public_keyERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 88| 2.77k| [[maybe_unused]] std::span key_bits) { 89| 2.77k| const std::string oid_str = alg_id.oid().to_formatted_string(); 90| 2.77k| const std::vector alg_info = split_on(oid_str, '/'); 91| 2.77k| std::string_view alg_name = alg_info[0]; 92| | 93| 2.77k|#if defined(BOTAN_HAS_RSA) 94| 2.77k| if(alg_name == "RSA") { ------------------ | Branch (94:7): [True: 472, False: 2.30k] ------------------ 95| 472| return std::make_unique(alg_id, key_bits); 96| 472| } 97| 2.30k|#endif 98| | 99| 2.30k|#if defined(BOTAN_HAS_CURVE_25519) 100| 2.30k| if(alg_name == "Curve25519") { ------------------ | Branch (100:7): [True: 1, False: 2.30k] ------------------ 101| 1| return std::make_unique(alg_id, key_bits); 102| 1| } 103| 2.30k|#endif 104| | 105| 2.30k|#if defined(BOTAN_HAS_MCELIECE) 106| 2.30k| if(alg_name == "McEliece") { ------------------ | Branch (106:7): [True: 0, False: 2.30k] ------------------ 107| 0| return std::make_unique(key_bits); 108| 0| } 109| 2.30k|#endif 110| | 111| 2.30k|#if defined(BOTAN_HAS_KYBER) || defined(BOTAN_HAS_KYBER_90S) 112| 2.30k| if(alg_name == "Kyber" || alg_name.starts_with("Kyber-")) { ------------------ | Branch (112:7): [True: 0, False: 2.30k] | Branch (112:30): [True: 0, False: 2.30k] ------------------ 113| 0| return std::make_unique(alg_id, key_bits); 114| 0| } 115| 2.30k|#endif 116| | 117| 2.30k|#if defined(BOTAN_HAS_ECDSA) 118| 2.30k| if(alg_name == "ECDSA") { ------------------ | Branch (118:7): [True: 1.91k, False: 387] ------------------ 119| 1.91k| return std::make_unique(alg_id, key_bits); 120| 1.91k| } 121| 387|#endif 122| | 123| 387|#if defined(BOTAN_HAS_ECDH) 124| 387| if(alg_name == "ECDH") { ------------------ | Branch (124:7): [True: 7, False: 380] ------------------ 125| 7| return std::make_unique(alg_id, key_bits); 126| 7| } 127| 380|#endif 128| | 129| 380|#if defined(BOTAN_HAS_DIFFIE_HELLMAN) 130| 380| if(alg_name == "DH") { ------------------ | Branch (130:7): [True: 34, False: 346] ------------------ 131| 34| return std::make_unique(alg_id, key_bits); 132| 34| } 133| 346|#endif 134| | 135| 346|#if defined(BOTAN_HAS_DSA) 136| 346| if(alg_name == "DSA") { ------------------ | Branch (136:7): [True: 36, False: 310] ------------------ 137| 36| return std::make_unique(alg_id, key_bits); 138| 36| } 139| 310|#endif 140| | 141| 310|#if defined(BOTAN_HAS_ELGAMAL) 142| 310| if(alg_name == "ElGamal") { ------------------ | Branch (142:7): [True: 0, False: 310] ------------------ 143| 0| return std::make_unique(alg_id, key_bits); 144| 0| } 145| 310|#endif 146| | 147| 310|#if defined(BOTAN_HAS_ECGDSA) 148| 310| if(alg_name == "ECGDSA") { ------------------ | Branch (148:7): [True: 0, False: 310] ------------------ 149| 0| return std::make_unique(alg_id, key_bits); 150| 0| } 151| 310|#endif 152| | 153| 310|#if defined(BOTAN_HAS_ECKCDSA) 154| 310| if(alg_name == "ECKCDSA") { ------------------ | Branch (154:7): [True: 0, False: 310] ------------------ 155| 0| return std::make_unique(alg_id, key_bits); 156| 0| } 157| 310|#endif 158| | 159| 310|#if defined(BOTAN_HAS_ED25519) 160| 310| if(alg_name == "Ed25519") { ------------------ | Branch (160:7): [True: 1, False: 309] ------------------ 161| 1| return std::make_unique(alg_id, key_bits); 162| 1| } 163| 309|#endif 164| | 165| 309|#if defined(BOTAN_HAS_GOST_34_10_2001) 166| 309| if(alg_name == "GOST-34.10" || alg_name == "GOST-34.10-2012-256" || alg_name == "GOST-34.10-2012-512") { ------------------ | Branch (166:7): [True: 4, False: 305] | Branch (166:35): [True: 82, False: 223] | Branch (166:72): [True: 15, False: 208] ------------------ 167| 101| return std::make_unique(alg_id, key_bits); 168| 101| } 169| 208|#endif 170| | 171| 208|#if defined(BOTAN_HAS_SM2) 172| 208| if(alg_name == "SM2" || alg_name == "SM2_Sig" || alg_name == "SM2_Enc") { ------------------ | Branch (172:7): [True: 0, False: 208] | Branch (172:28): [True: 0, False: 208] | Branch (172:53): [True: 0, False: 208] ------------------ 173| 0| return std::make_unique(alg_id, key_bits); 174| 0| } 175| 208|#endif 176| | 177| 208|#if defined(BOTAN_HAS_XMSS_RFC8391) 178| 208| if(alg_name == "XMSS") { ------------------ | Branch (178:7): [True: 0, False: 208] ------------------ 179| 0| return std::make_unique(key_bits); 180| 0| } 181| 208|#endif 182| | 183| 208|#if defined(BOTAN_HAS_DILITHIUM) || defined(BOTAN_HAS_DILITHIUM_AES) 184| 208| if(alg_name == "Dilithium" || alg_name.starts_with("Dilithium-")) { ------------------ | Branch (184:7): [True: 0, False: 208] | Branch (184:34): [True: 0, False: 208] ------------------ 185| 0| return std::make_unique(alg_id, key_bits); 186| 0| } 187| 208|#endif 188| | 189| 208| throw Decoding_Error(fmt("Unknown or unavailable public key algorithm '{}'", alg_name)); 190| 208|} _ZN5Botan22create_hex_fingerprintEPKhmNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 30| 5.79k|std::string create_hex_fingerprint(const uint8_t bits[], size_t bits_len, std::string_view hash_name) { 31| 5.79k| auto hash_fn = HashFunction::create_or_throw(hash_name); 32| 5.79k| const std::string hex_hash = hex_encode(hash_fn->process(bits, bits_len)); 33| | 34| 5.79k| std::string fprint; 35| | 36| 156k| for(size_t i = 0; i != hex_hash.size(); i += 2) { ------------------ | Branch (36:22): [True: 150k, False: 5.79k] ------------------ 37| 150k| if(i != 0) { ------------------ | Branch (37:10): [True: 144k, False: 5.79k] ------------------ 38| 144k| fprint.push_back(':'); 39| 144k| } 40| | 41| 150k| fprint.push_back(hex_hash[i]); 42| 150k| fprint.push_back(hex_hash[i + 1]); 43| 150k| } 44| | 45| 5.79k| return fprint; 46| 5.79k|} _ZNK5Botan10Public_Key27create_x509_verification_opERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE: 107| 3| std::string_view /*provider*/) const { 108| 3| throw Lookup_Error(fmt("{} does not support X.509 verification", algo_name())); 109| 3|} _ZN5Botan6PK_Ops22Verification_with_HashC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 125| 74| Verification(), m_hash(create_signature_hash(padding)) {} _ZN5Botan6PK_Ops22Verification_with_HashC2ERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEb: 129| 776| bool allow_null_parameters) { 130| 776| const auto oid_info = split_on(alg_id.oid().to_formatted_string(), '/'); 131| | 132| 776| if(oid_info.size() != 2 || oid_info[0] != pk_algo) { ------------------ | Branch (132:7): [True: 306, False: 470] | Branch (132:31): [True: 1, False: 469] ------------------ 133| 307| throw Decoding_Error( 134| 307| fmt("Unexpected AlgorithmIdentifier OID {} in association with {} key", alg_id.oid(), pk_algo)); 135| 307| } 136| | 137| 469| if(!alg_id.parameters_are_empty()) { ------------------ | Branch (137:7): [True: 7, False: 462] ------------------ 138| 7| if(alg_id.parameters_are_null()) { ------------------ | Branch (138:10): [True: 6, False: 1] ------------------ 139| 6| if(!allow_null_parameters) { ------------------ | Branch (139:13): [True: 6, False: 0] ------------------ 140| 6| throw Decoding_Error(fmt("Unexpected NULL AlgorithmIdentifier parameters for {}", pk_algo)); 141| 6| } 142| 6| } else { 143| 1| throw Decoding_Error(fmt("Unexpected AlgorithmIdentifier parameters for {}", pk_algo)); 144| 1| } 145| 7| } 146| | 147| 462| m_hash = HashFunction::create_or_throw(oid_info[1]); 148| 462|} _ZN5Botan6PK_Ops22Verification_with_Hash6updateEPKhm: 150| 536|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| 532|bool PK_Ops::Verification_with_Hash::is_valid_signature(const uint8_t sig[], size_t sig_len) { 153| 532| const secure_vector msg = m_hash->final(); 154| 532| return verify(msg.data(), msg.size(), sig, sig_len); 155| 532|} pk_ops.cpp:_ZN5Botan12_GLOBAL__N_121create_signature_hashENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 72| 74|std::unique_ptr create_signature_hash(std::string_view padding) { 73| 74| if(auto hash = HashFunction::create(padding)) { ------------------ | Branch (73:12): [True: 74, False: 0] ------------------ 74| 74| return hash; 75| 74| } 76| | 77| 0| SCAN_Name req(padding); 78| | 79| 0| if(req.algo_name() == "EMSA1" && req.arg_count() == 1) { ------------------ | Branch (79:7): [True: 0, False: 0] | Branch (79:7): [True: 0, False: 0] | Branch (79:37): [True: 0, False: 0] ------------------ 80| 0| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (80:15): [True: 0, False: 0] ------------------ 81| 0| return hash; 82| 0| } 83| 0| } 84| | 85| 0|#if defined(BOTAN_HAS_RAW_HASH_FN) 86| 0| if(req.algo_name() == "Raw") { ------------------ | Branch (86:7): [True: 0, False: 0] ------------------ 87| 0| if(req.arg_count() == 0) { ------------------ | Branch (87:10): [True: 0, False: 0] ------------------ 88| 0| return std::make_unique("Raw", 0); 89| 0| } 90| | 91| 0| if(req.arg_count() == 1) { ------------------ | Branch (91:10): [True: 0, False: 0] ------------------ 92| 0| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (92:18): [True: 0, False: 0] ------------------ 93| 0| return std::make_unique(std::move(hash)); 94| 0| } 95| 0| } 96| 0| } 97| 0|#endif 98| | 99| 0| throw Algorithm_Not_Found(padding); 100| 0|} _ZN5Botan11PK_VerifierC2ERKNS_10Public_KeyERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS7_11char_traitsIcEEEE: 280| 1.31k| std::string_view provider) { 281| 1.31k| m_op = key.create_x509_verification_op(signature_algorithm, provider); 282| | 283| 1.31k| if(!m_op) { ------------------ | Branch (283:7): [True: 0, False: 1.31k] ------------------ 284| 0| throw Invalid_Argument(fmt("Key type {} does not support X.509 signature verification", key.algo_name())); 285| 0| } 286| | 287| 1.31k| m_sig_format = key.default_x509_signature_format(); 288| 1.31k| m_parts = key.message_parts(); 289| 1.31k| m_part_size = key.message_part_size(); 290| 1.31k| check_der_format_supported(m_sig_format, m_parts); 291| 1.31k|} _ZN5Botan11PK_VerifierD2Ev: 293| 950|PK_Verifier::~PK_Verifier() = default; _ZN5Botan11PK_Verifier14verify_messageEPKhmS2_m: 302| 950|bool PK_Verifier::verify_message(const uint8_t msg[], size_t msg_length, const uint8_t sig[], size_t sig_length) { 303| 950| update(msg, msg_length); 304| 950| return check_signature(sig, sig_length); 305| 950|} _ZN5Botan11PK_Verifier6updateEPKhm: 307| 950|void PK_Verifier::update(const uint8_t in[], size_t length) { m_op->update(in, length); } _ZN5Botan11PK_Verifier15check_signatureEPKhm: 341| 950|bool PK_Verifier::check_signature(const uint8_t sig[], size_t length) { 342| 950| try { 343| 950| if(m_sig_format == Signature_Format::Standard) { ------------------ | Branch (343:10): [True: 488, False: 462] ------------------ 344| 488| return m_op->is_valid_signature(sig, length); 345| 488| } else if(m_sig_format == Signature_Format::DerSequence) { ------------------ | Branch (345:17): [True: 462, False: 0] ------------------ 346| 462| bool decoding_success = false; 347| 462| std::vector real_sig; 348| | 349| 462| try { 350| 462| real_sig = decode_der_signature(sig, length, m_parts, m_part_size); 351| 462| decoding_success = true; 352| 462| } catch(Decoding_Error&) {} 353| | 354| 462| bool accept = m_op->is_valid_signature(real_sig.data(), real_sig.size()); 355| | 356| 458| return accept && decoding_success; ------------------ | Branch (356:17): [True: 0, False: 458] | Branch (356:27): [True: 0, False: 0] ------------------ 357| 462| } else { 358| 0| throw Internal_Error("PK_Verifier: Invalid signature format enum"); 359| 0| } 360| 950| } catch(Invalid_Argument&) { 361| 0| return false; 362| 28| } catch(Decoding_Error&) { 363| 28| return false; 364| 28| } catch(Encoding_Error&) { 365| 4| return false; 366| 4| } 367| 950|} pubkey.cpp:_ZN5BotanL26check_der_format_supportedENS_16Signature_FormatEm: 192| 950|static void check_der_format_supported(Signature_Format format, size_t parts) { 193| 950| if(format != Signature_Format::Standard && parts == 1) { ------------------ | Branch (193:7): [True: 462, False: 488] | Branch (193:47): [True: 0, False: 462] ------------------ 194| 0| throw Invalid_Argument("This algorithm does not support DER encoding"); 195| 0| } 196| 950|} pubkey.cpp:_ZN5Botan12_GLOBAL__N_120der_encode_signatureERKNSt3__16vectorIhNS1_9allocatorIhEEEEmm: 223| 258|std::vector der_encode_signature(const std::vector& sig, size_t parts, size_t part_size) { 224| 258| if(sig.size() % parts != 0 || sig.size() != parts * part_size) { ------------------ | Branch (224:7): [True: 0, False: 258] | Branch (224:34): [True: 0, False: 258] ------------------ 225| 0| throw Encoding_Error("Unexpected size for DER signature"); 226| 0| } 227| | 228| 258| std::vector sig_parts(parts); 229| 774| for(size_t i = 0; i != sig_parts.size(); ++i) { ------------------ | Branch (229:22): [True: 516, False: 258] ------------------ 230| 516| sig_parts[i].binary_decode(&sig[part_size * i], part_size); 231| 516| } 232| | 233| 258| std::vector output; 234| 258| DER_Encoder(output).start_sequence().encode_list(sig_parts).end_cons(); 235| 258| return output; 236| 258|} pubkey.cpp:_ZN5Botan12_GLOBAL__N_120decode_der_signatureEPKhmmm: 311| 462|std::vector decode_der_signature(const uint8_t sig[], size_t length, size_t sig_parts, size_t sig_part_size) { 312| 462| std::vector real_sig; 313| 462| BER_Decoder decoder(sig, length); 314| 462| BER_Decoder ber_sig = decoder.start_sequence(); 315| | 316| 462| BOTAN_ASSERT_NOMSG(sig_parts != 0 && sig_part_size != 0); ------------------ | | 60| 462| do { \ | | 61| 762| if(!(expr)) \ | | ------------------ | | | Branch (61:12): [True: 300, False: 162] | | | Branch (61:12): [True: 300, False: 0] | | ------------------ | | 62| 462| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 63| 462| } while(0) | | ------------------ | | | Branch (63:12): [Folded - Ignored] | | ------------------ ------------------ 317| | 318| 462| size_t count = 0; 319| | 320| 1.53k| while(ber_sig.more_items()) { ------------------ | Branch (320:10): [True: 1.07k, False: 462] ------------------ 321| 1.07k| BigInt sig_part; 322| 1.07k| ber_sig.decode(sig_part); 323| 1.07k| real_sig += BigInt::encode_1363(sig_part, sig_part_size); 324| 1.07k| ++count; 325| 1.07k| } 326| | 327| 462| if(count != sig_parts) { ------------------ | Branch (327:7): [True: 20, False: 442] ------------------ 328| 20| throw Decoding_Error("PK_Verifier: signature size invalid"); 329| 20| } 330| | 331| 442| const std::vector reencoded = der_encode_signature(real_sig, sig_parts, sig_part_size); 332| | 333| 442| if(reencoded.size() != length || same_mem(reencoded.data(), sig, reencoded.size()) == false) { ------------------ | Branch (333:7): [True: 192, False: 250] | Branch (333:37): [True: 6, False: 244] ------------------ 334| 14| throw Decoding_Error("PK_Verifier: signature is not the canonical DER encoding"); 335| 14| } 336| 428| return real_sig; 337| 442|} _ZNK5Botan13RSA_PublicKey11public_dataEv: 118| 415|std::shared_ptr RSA_PublicKey::public_data() const { return m_public; } _ZN5Botan13RSA_PublicKey4initEONS_6BigIntES2_: 134| 466|void RSA_PublicKey::init(BigInt&& n, BigInt&& e) { 135| 466| if(n.is_negative() || n.is_even() || n.bits() < 5 /* n >= 3*5 */ || e.is_negative() || e.is_even()) { ------------------ | Branch (135:7): [True: 1, False: 465] | Branch (135:26): [True: 2, False: 463] | Branch (135:41): [True: 3, False: 460] | Branch (135:72): [True: 2, False: 458] | Branch (135:91): [True: 2, False: 456] ------------------ 136| 10| throw Decoding_Error("Invalid RSA public key parameters"); 137| 10| } 138| 456| m_public = std::make_shared(std::move(n), std::move(e)); 139| 456|} _ZN5Botan13RSA_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 141| 472|RSA_PublicKey::RSA_PublicKey(const AlgorithmIdentifier& /*unused*/, std::span key_bits) { 142| 472| BigInt n, e; 143| 472| BER_Decoder(key_bits).start_sequence().decode(n).decode(e).end_cons(); 144| | 145| 472| init(std::move(n), std::move(e)); 146| 472|} _ZNK5Botan13RSA_PublicKey27create_x509_verification_opERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE: 755| 456| std::string_view provider) const { 756| 456| if(provider == "base" || provider.empty()) { ------------------ | Branch (756:7): [True: 0, False: 456] | Branch (756:29): [True: 456, False: 0] ------------------ 757| 456| return std::make_unique(*this, parse_rsa_signature_algorithm(alg_id)); 758| 456| } 759| | 760| 0| throw Provider_Not_Found(algo_name(), provider); 761| 456|} _ZNK5Botan15RSA_Public_Data5get_nEv: 46| 389| const BigInt& get_n() const { return m_n; } _ZNK5Botan15RSA_Public_Data19public_modulus_bitsEv: 50| 386| size_t public_modulus_bits() const { return m_public_modulus_bits; } rsa.cpp:_ZN5Botan12_GLOBAL__N_129parse_rsa_signature_algorithmERKNS_19AlgorithmIdentifierE: 706| 456|std::string parse_rsa_signature_algorithm(const AlgorithmIdentifier& alg_id) { 707| 456| const auto sig_info = split_on(alg_id.oid().to_formatted_string(), '/'); 708| | 709| 456| if(sig_info.empty() || sig_info.size() != 2 || sig_info[0] != "RSA") { ------------------ | Branch (709:7): [True: 0, False: 456] | Branch (709:27): [True: 3, False: 453] | Branch (709:51): [True: 22, False: 431] ------------------ 710| 25| throw Decoding_Error("Unknown AlgorithmIdentifier for RSA X.509 signatures"); 711| 25| } 712| | 713| 431| std::string padding = sig_info[1]; 714| | 715| 431| if(padding == "EMSA4") { ------------------ | Branch (715:7): [True: 58, False: 373] ------------------ 716| | // "MUST contain RSASSA-PSS-params" 717| 58| if(alg_id.parameters().empty()) { ------------------ | Branch (717:10): [True: 0, False: 58] ------------------ 718| 0| throw Decoding_Error("PSS params must be provided"); 719| 0| } 720| | 721| 58| PSS_Params pss_params(alg_id.parameters()); 722| | 723| | // hash_algo must be SHA1, SHA2-224, SHA2-256, SHA2-384 or SHA2-512 724| 58| const std::string hash_algo = pss_params.hash_function(); 725| 58| if(hash_algo != "SHA-1" && hash_algo != "SHA-224" && hash_algo != "SHA-256" && hash_algo != "SHA-384" && ------------------ | Branch (725:10): [True: 44, False: 14] | Branch (725:34): [True: 44, False: 0] | Branch (725:60): [True: 28, False: 16] | Branch (725:86): [True: 3, False: 25] ------------------ 726| 58| hash_algo != "SHA-512") { ------------------ | Branch (726:10): [True: 2, False: 1] ------------------ 727| 2| throw Decoding_Error("Unacceptable hash for PSS signatures"); 728| 2| } 729| | 730| 56| if(pss_params.mgf_function() != "MGF1") { ------------------ | Branch (730:10): [True: 2, False: 54] ------------------ 731| 2| throw Decoding_Error("Unacceptable MGF for PSS signatures"); 732| 2| } 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| 54| if(pss_params.hash_algid() != pss_params.mgf_hash_algid()) { ------------------ | Branch (738:10): [True: 2, False: 52] ------------------ 739| 2| throw Decoding_Error("Unacceptable MGF hash for PSS signatures"); 740| 2| } 741| | 742| 52| if(pss_params.trailer_field() != 1) { ------------------ | Branch (742:10): [True: 1, False: 51] ------------------ 743| 1| throw Decoding_Error("Unacceptable trailer field for PSS signatures"); 744| 1| } 745| | 746| 51| padding += fmt("({},MGF1,{})", hash_algo, pss_params.salt_length()); 747| 51| } 748| | 749| 424| return padding; 750| 431|} _ZN5Botan15RSA_Public_DataC2EONS_6BigIntES2_: 38| 456| m_public_modulus_bytes(m_n.bytes()) {} rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Public_OperationC2ERKNS_13RSA_PublicKeyE: 587| 415| explicit RSA_Public_Operation(const RSA_PublicKey& rsa) : m_public(rsa.public_data()) {} rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Public_Operation20public_modulus_bytesEv: 600| 414| size_t public_modulus_bytes() const { return m_public->public_modulus_bytes(); } _ZNK5Botan15RSA_Public_Data20public_modulus_bytesEv: 52| 414| size_t public_modulus_bytes() const { return m_public_modulus_bytes; } rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Public_Operation19public_modulus_bitsEv: 589| 386| size_t public_modulus_bits() const { return m_public->public_modulus_bits(); } rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Public_Operation9public_opERKNS_6BigIntE: 592| 389| BigInt public_op(const BigInt& m) const { 593| 389| if(m >= m_public->get_n()) { ------------------ | Branch (593:13): [True: 3, False: 386] ------------------ 594| 3| throw Decoding_Error("RSA public op - input is too large"); 595| 3| } 596| | 597| 386| return m_public->public_op(m); 598| 389| } _ZNK5Botan15RSA_Public_Data9public_opERKNS_6BigIntE: 40| 386| BigInt public_op(const BigInt& m) const { 41| 386| const size_t powm_window = 1; 42| 386| auto powm_m_n = monty_precompute(m_monty_n, m, powm_window, false); 43| 386| return monty_execute_vartime(*powm_m_n, m_e); 44| 386| } rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_OperationC2ERKNS_13RSA_PublicKeyENSt3__117basic_string_viewIcNS5_11char_traitsIcEEEE: 638| 415| RSA_Public_Operation(rsa), m_emsa(EMSA::create_or_throw(padding)) {} rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_Operation6updateEPKhm: 629| 414| 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| 414| bool is_valid_signature(const uint8_t sig[], size_t sig_len) override { 632| 414| const auto msg = m_emsa->raw_data(); 633| 414| const auto message_repr = recover_message_repr(sig, sig_len); 634| 414| return m_emsa->verify(message_repr, msg, public_modulus_bits() - 1); 635| 414| } rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_Operation20recover_message_reprEPKhm: 643| 414| std::vector recover_message_repr(const uint8_t input[], size_t input_len) { 644| 414| if(input_len > public_modulus_bytes()) { ------------------ | Branch (644:13): [True: 25, False: 389] ------------------ 645| 25| throw Decoding_Error("RSA signature too large to be valid for this key"); 646| 25| } 647| 389| BigInt input_bn(input, input_len); 648| 389| return BigInt::encode(public_op(input_bn)); 649| 414| } _ZN5Botan14if_work_factorEm: 34| 54|size_t if_work_factor(size_t bits) { 35| 54| if(bits < 512) { ------------------ | Branch (35:7): [True: 29, False: 25] ------------------ 36| 29| return 0; 37| 29| } 38| | 39| | // RFC 3766 estimates k at .02 and o(1) to be effectively zero for sizes of interest 40| | 41| 25| const double log2_k = -5.6438; // log2(.02) 42| 25| return nfs_workfactor(bits, log2_k); 43| 54|} _ZN5Botan14dl_work_factorEm: 45| 54|size_t dl_work_factor(size_t bits) { 46| | // Lacking better estimates... 47| 54| return if_work_factor(bits); 48| 54|} _ZN5Botan16dl_exponent_sizeEm: 50| 54|size_t dl_exponent_size(size_t bits) { 51| 54| if(bits == 0) { ------------------ | Branch (51:7): [True: 0, False: 54] ------------------ 52| 0| return 0; 53| 0| } 54| 54| if(bits <= 256) { ------------------ | Branch (54:7): [True: 24, False: 30] ------------------ 55| 24| return bits - 1; 56| 24| } 57| 30| if(bits <= 1024) { ------------------ | Branch (57:7): [True: 10, False: 20] ------------------ 58| 10| return 192; 59| 10| } 60| 20| if(bits <= 1536) { ------------------ | Branch (60:7): [True: 9, False: 11] ------------------ 61| 9| return 224; 62| 9| } 63| 11| if(bits <= 2048) { ------------------ | Branch (63:7): [True: 11, False: 0] ------------------ 64| 11| return 256; 65| 11| } 66| 0| if(bits <= 4096) { ------------------ | Branch (66:7): [True: 0, False: 0] ------------------ 67| 0| return 384; 68| 0| } 69| 0| return 512; 70| 0|} workfactor.cpp:_ZN5Botan12_GLOBAL__N_114nfs_workfactorEmd: 18| 25|size_t nfs_workfactor(size_t bits, double log2_k) { 19| | // approximates natural logarithm of an integer of given bitsize 20| 25| const double log2_e = 1.44269504088896340736; 21| 25| const double log_p = bits / log2_e; 22| | 23| 25| 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| 25| 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| 25| return static_cast(log2_k + log2_e * est); 30| 25|} _ZN5Botan4X5098load_keyERNS_10DataSourceE: 26| 2.83k|std::unique_ptr load_key(DataSource& source) { 27| 2.83k| try { 28| 2.83k| AlgorithmIdentifier alg_id; 29| 2.83k| std::vector key_bits; 30| | 31| 2.83k| if(ASN1::maybe_BER(source) && !PEM_Code::matches(source)) { ------------------ | Branch (31:10): [True: 2.83k, False: 0] | Branch (31:37): [True: 2.83k, False: 0] ------------------ 32| 2.83k| BER_Decoder(source).start_sequence().decode(alg_id).decode(key_bits, ASN1_Type::BitString).end_cons(); 33| 2.83k| } 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| 2.83k| if(key_bits.empty()) { ------------------ | Branch (39:10): [True: 8, False: 2.82k] ------------------ 40| 8| throw Decoding_Error("X.509 public key decoding"); 41| 8| } 42| | 43| 2.82k| return load_public_key(alg_id, key_bits); 44| 2.83k| } catch(Decoding_Error& e) { 45| 1.08k| throw Decoding_Error("X.509 public key decoding", e); 46| 1.08k| } 47| 2.83k|} _ZN5Botan22throw_invalid_argumentEPKcS1_S1_: 21| 82|void throw_invalid_argument(const char* message, const char* func, const char* file) { 22| 82| throw Invalid_Argument(fmt("{} in {}:{}", message, func, file)); 23| 82|} _ZN5Botan17assertion_failureEPKcS1_S1_S1_i: 29| 4|void assertion_failure(const char* expr_str, const char* assertion_made, const char* func, const char* file, int line) { 30| 4| std::ostringstream format; 31| | 32| 4| format << "False assertion "; 33| | 34| 4| if(assertion_made && assertion_made[0] != 0) { ------------------ | Branch (34:7): [True: 4, False: 0] | Branch (34:25): [True: 4, False: 0] ------------------ 35| 4| format << "'" << assertion_made << "' (expression " << expr_str << ") "; 36| 4| } else { 37| 0| format << expr_str << " "; 38| 0| } 39| | 40| 4| if(func) { ------------------ | Branch (40:7): [True: 4, False: 0] ------------------ 41| 4| format << "in " << func << " "; 42| 4| } 43| | 44| 4| format << "@" << file << ":" << line; 45| | 46| |#if defined(BOTAN_TERMINATE_ON_ASSERTS) 47| | std::cerr << format.str() << '\n'; 48| | std::abort(); 49| |#else 50| 4| throw Internal_Error(format.str()); 51| 4|#endif 52| 4|} _ZN5Botan12ucs2_to_utf8EPKhm: 54| 731|std::string ucs2_to_utf8(const uint8_t ucs2[], size_t len) { 55| 731| if(len % 2 != 0) { ------------------ | Branch (55:7): [True: 18, False: 713] ------------------ 56| 18| throw Decoding_Error("Invalid length for UCS-2 string"); 57| 18| } 58| | 59| 713| const size_t chars = len / 2; 60| | 61| 713| std::string s; 62| 5.52k| for(size_t i = 0; i != chars; ++i) { ------------------ | Branch (62:22): [True: 4.81k, False: 713] ------------------ 63| 4.81k| const uint32_t c = load_be(ucs2, i); 64| 4.81k| append_utf8_for(s, c); 65| 4.81k| } 66| | 67| 713| return s; 68| 731|} _ZN5Botan12ucs4_to_utf8EPKhm: 70| 285|std::string ucs4_to_utf8(const uint8_t ucs4[], size_t len) { 71| 285| if(len % 4 != 0) { ------------------ | Branch (71:7): [True: 19, False: 266] ------------------ 72| 19| throw Decoding_Error("Invalid length for UCS-4 string"); 73| 19| } 74| | 75| 266| const size_t chars = len / 4; 76| | 77| 266| std::string s; 78| 579| for(size_t i = 0; i != chars; ++i) { ------------------ | Branch (78:22): [True: 313, False: 266] ------------------ 79| 313| const uint32_t c = load_be(ucs4, i); 80| 313| append_utf8_for(s, c); 81| 313| } 82| | 83| 266| return s; 84| 285|} _ZN5Botan14latin1_to_utf8EPKhm: 89| 1.35k|std::string latin1_to_utf8(const uint8_t chars[], size_t len) { 90| 1.35k| std::string s; 91| 23.7k| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (91:22): [True: 22.3k, False: 1.35k] ------------------ 92| 22.3k| const uint32_t c = static_cast(chars[i]); 93| 22.3k| append_utf8_for(s, c); 94| 22.3k| } 95| 1.35k| return s; 96| 1.35k|} _ZN5Botan23format_char_for_displayEc: 98| 29|std::string format_char_for_display(char c) { 99| 29| std::ostringstream oss; 100| | 101| 29| oss << "'"; 102| | 103| 29| if(c == '\t') { ------------------ | Branch (103:7): [True: 0, False: 29] ------------------ 104| 0| oss << "\\t"; 105| 29| } else if(c == '\n') { ------------------ | Branch (105:14): [True: 0, False: 29] ------------------ 106| 0| oss << "\\n"; 107| 29| } else if(c == '\r') { ------------------ | Branch (107:14): [True: 0, False: 29] ------------------ 108| 0| oss << "\\r"; 109| 29| } else if(static_cast(c) >= 128) { ------------------ | Branch (109:14): [True: 15, False: 14] ------------------ 110| 15| unsigned char z = static_cast(c); 111| 15| oss << "\\x" << std::hex << std::uppercase << static_cast(z); 112| 15| } else { 113| 14| oss << c; 114| 14| } 115| | 116| 29| oss << "'"; 117| | 118| 29| return oss.str(); 119| 29|} charset.cpp:_ZN5Botan12_GLOBAL__N_115append_utf8_forERNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEj: 18| 27.5k|void append_utf8_for(std::string& s, uint32_t c) { 19| 27.5k| if(c >= 0xD800 && c < 0xE000) { ------------------ | Branch (19:7): [True: 1.02k, False: 26.4k] | Branch (19:22): [True: 12, False: 1.01k] ------------------ 20| 12| throw Decoding_Error("Invalid Unicode character"); 21| 12| } 22| | 23| 27.4k| if(c <= 0x7F) { ------------------ | Branch (23:7): [True: 19.6k, False: 7.87k] ------------------ 24| 19.6k| const uint8_t b0 = static_cast(c); 25| 19.6k| s.push_back(static_cast(b0)); 26| 19.6k| } else if(c <= 0x7FF) { ------------------ | Branch (26:14): [True: 3.80k, False: 4.07k] ------------------ 27| 3.80k| const uint8_t b0 = 0xC0 | static_cast(c >> 6); 28| 3.80k| const uint8_t b1 = 0x80 | static_cast(c & 0x3F); 29| 3.80k| s.push_back(static_cast(b0)); 30| 3.80k| s.push_back(static_cast(b1)); 31| 4.07k| } else if(c <= 0xFFFF) { ------------------ | Branch (31:14): [True: 3.85k, False: 225] ------------------ 32| 3.85k| const uint8_t b0 = 0xE0 | static_cast(c >> 12); 33| 3.85k| const uint8_t b1 = 0x80 | static_cast((c >> 6) & 0x3F); 34| 3.85k| const uint8_t b2 = 0x80 | static_cast(c & 0x3F); 35| 3.85k| s.push_back(static_cast(b0)); 36| 3.85k| s.push_back(static_cast(b1)); 37| 3.85k| s.push_back(static_cast(b2)); 38| 3.85k| } else if(c <= 0x10FFFF) { ------------------ | Branch (38:14): [True: 163, False: 62] ------------------ 39| 163| const uint8_t b0 = 0xF0 | static_cast(c >> 18); 40| 163| const uint8_t b1 = 0x80 | static_cast((c >> 12) & 0x3F); 41| 163| const uint8_t b2 = 0x80 | static_cast((c >> 6) & 0x3F); 42| 163| const uint8_t b3 = 0x80 | static_cast(c & 0x3F); 43| 163| s.push_back(static_cast(b0)); 44| 163| s.push_back(static_cast(b1)); 45| 163| s.push_back(static_cast(b2)); 46| 163| s.push_back(static_cast(b3)); 47| 163| } else { 48| 62| throw Decoding_Error("Invalid Unicode character"); 49| 62| } 50| 27.4k|} _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(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(&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(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(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| 4.37M|size_t DataSource::read_byte(uint8_t& out) { return read(&out, 1); } _ZNK5Botan10DataSource9peek_byteERh: 30| 9.26k|size_t DataSource::peek_byte(uint8_t& out) const { return peek(&out, 1, 0); } _ZN5Botan10DataSource12discard_nextEm: 35| 36.9k|size_t DataSource::discard_next(size_t n) { 36| 36.9k| uint8_t buf[64] = {0}; 37| 36.9k| size_t discarded = 0; 38| | 39| 101k| while(n) { ------------------ | Branch (39:10): [True: 64.7k, False: 36.7k] ------------------ 40| 64.7k| const size_t got = this->read(buf, std::min(n, sizeof(buf))); 41| 64.7k| discarded += got; 42| 64.7k| n -= got; 43| | 44| 64.7k| if(got == 0) { ------------------ | Branch (44:10): [True: 249, False: 64.5k] ------------------ 45| 249| break; 46| 249| } 47| 64.7k| } 48| | 49| 36.9k| return discarded; 50| 36.9k|} _ZN5Botan17DataSource_Memory4readEPhm: 55| 617k|size_t DataSource_Memory::read(uint8_t out[], size_t length) { 56| 617k| const size_t got = std::min(m_source.size() - m_offset, length); 57| 617k| copy_mem(out, m_source.data() + m_offset, got); 58| 617k| m_offset += got; 59| 617k| return got; 60| 617k|} _ZN5Botan17DataSource_Memory15check_availableEm: 62| 101k|bool DataSource_Memory::check_available(size_t n) { return (n <= (m_source.size() - m_offset)); } _ZNK5Botan17DataSource_Memory4peekEPhmm: 67| 37.3k|size_t DataSource_Memory::peek(uint8_t out[], size_t length, size_t peek_offset) const { 68| 37.3k| const size_t bytes_left = m_source.size() - m_offset; 69| 37.3k| if(peek_offset >= bytes_left) { ------------------ | Branch (69:7): [True: 9.60k, False: 27.7k] ------------------ 70| 9.60k| return 0; 71| 9.60k| } 72| | 73| 27.7k| const size_t got = std::min(bytes_left - peek_offset, length); 74| 27.7k| copy_mem(out, &m_source[m_offset + peek_offset], got); 75| 27.7k| return got; 76| 37.3k|} _ZNK5Botan17DataSource_Memory11end_of_dataEv: 81| 40.6k|bool DataSource_Memory::end_of_data() const { return (m_offset == m_source.size()); } _ZN5Botan9ExceptionC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 71| 11.3k|Exception::Exception(std::string_view msg) : m_msg(msg) {} _ZN5Botan9ExceptionC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKSt9exception: 73| 3.96k|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| 502|Exception::Exception(const char* prefix, std::string_view msg) : m_msg(fmt("{} {}", prefix, msg)) {} _ZN5Botan16Invalid_ArgumentC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 77| 577|Invalid_Argument::Invalid_Argument(std::string_view msg) : Exception(msg) {} _ZN5Botan14Internal_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 99| 5|Internal_Error::Internal_Error(std::string_view err) : Exception("Internal error:", err) {} _ZN5Botan19Algorithm_Not_FoundC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 115| 1| Lookup_Error(fmt("Could not find any algorithm named '{}'", name)) {} _ZN5Botan14Encoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 123| 497|Encoding_Error::Encoding_Error(std::string_view name) : Exception("Encoding error:", name) {} _ZN5Botan14Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 125| 10.7k|Decoding_Error::Decoding_Error(std::string_view name) : Exception(name) {} _ZN5Botan14Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKSt9exception: 130| 3.96k|Decoding_Error::Decoding_Error(std::string_view msg, const std::exception& e) : Exception(msg, e) {} _ZN5Botan15allocate_memoryEmm: 20| 11.1M|BOTAN_MALLOC_FN void* allocate_memory(size_t elems, size_t elem_size) { 21| 11.1M| if(elems == 0 || elem_size == 0) { ------------------ | Branch (21:7): [True: 0, False: 11.1M] | Branch (21:21): [True: 0, False: 11.1M] ------------------ 22| 0| return nullptr; 23| 0| } 24| | 25| | // Some calloc implementations do not check for overflow (?!?) 26| | 27| 11.1M| if(!BOTAN_CHECKED_MUL(elems, elem_size).has_value()) { ------------------ | | 73| 11.1M|#define BOTAN_CHECKED_MUL(x, y) checked_mul(x, y) ------------------ | Branch (27:7): [True: 0, False: 11.1M] ------------------ 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| 11.1M| void* ptr = std::calloc(elems, elem_size); // NOLINT(*-no-malloc) 41| 11.1M|#endif 42| 11.1M| if(!ptr) { ------------------ | Branch (42:7): [True: 0, False: 11.1M] ------------------ 43| 0| [[unlikely]] throw std::bad_alloc(); 44| 0| } 45| 11.1M| return ptr; 46| 11.1M|} _ZN5Botan17deallocate_memoryEPvmm: 48| 11.1M|void deallocate_memory(void* p, size_t elems, size_t elem_size) { 49| 11.1M| if(p == nullptr) { ------------------ | Branch (49:7): [True: 0, False: 11.1M] ------------------ 50| 0| [[unlikely]] return; 51| 0| } 52| | 53| 11.1M| 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| 11.1M| std::free(p); // NOLINT(*-no-malloc) 62| 11.1M|} _ZN5Botan20initialize_allocatorEv: 64| 1|void initialize_allocator() { 65| |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR) 66| | mlock_allocator::instance(); 67| |#endif 68| 1|} _ZN5Botan13ct_compare_u8EPKhS1_m: 70| 10|uint8_t ct_compare_u8(const uint8_t x[], const uint8_t y[], size_t len) { 71| 10| volatile uint8_t difference = 0; 72| | 73| 386| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (73:22): [True: 376, False: 10] ------------------ 74| 376| difference = difference | (x[i] ^ y[i]); 75| 376| } 76| | 77| 10| return CT::Mask::is_zero(difference).value(); 78| 10|} _ZN5Botan19secure_scrub_memoryEPvm: 78| 11.1M|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| 11.1M| ::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(ptr); 101| | 102| | for(size_t i = 0; i != n; ++i) 103| | p[i] = 0; 104| |#endif 105| 11.1M|} _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(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(id), &auxinfo, sizeof(auxinfo)); 144| | return auxinfo; 145| |#elif defined(BOTAN_TARGET_OS_HAS_AUXINFO) 146| | for(const AuxInfo* auxinfo = static_cast(::_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| 832k|uint32_t to_u32bit(std::string_view str_view) { 33| 832k| const std::string str(str_view); 34| | 35| | // std::stoul is not strict enough. Ensure that str is digit only [0-9]* 36| 1.23M| for(const char chr : str) { ------------------ | Branch (36:23): [True: 1.23M, False: 832k] ------------------ 37| 1.23M| if(chr < '0' || chr > '9') { ------------------ | Branch (37:10): [True: 13, False: 1.23M] | Branch (37:23): [True: 1, False: 1.23M] ------------------ 38| 14| throw Invalid_Argument("to_u32bit invalid decimal string '" + str + "'"); 39| 14| } 40| 1.23M| } 41| | 42| 832k| const unsigned long int x = std::stoul(str); 43| | 44| 832k| if constexpr(sizeof(unsigned long int) > 4) { ------------------ | Branch (44:17): [Folded - Ignored] ------------------ 45| | // x might be uint64 46| 832k| if(x > std::numeric_limits::max()) { ------------------ | Branch (46:10): [True: 0, False: 832k] ------------------ 47| 0| throw Invalid_Argument("Integer value of " + str + " exceeds 32 bit range"); 48| 0| } 49| 832k| } 50| | 51| 832k| return static_cast(x); 52| 832k|} _ZN5Botan8split_onENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEc: 111| 4.00k|std::vector split_on(std::string_view str, char delim) { 112| 4.00k| std::vector elems; 113| 4.00k| if(str.empty()) { ------------------ | Branch (113:7): [True: 0, False: 4.00k] ------------------ 114| 0| return elems; 115| 0| } 116| | 117| 4.00k| std::string substr; 118| 71.7k| for(auto i = str.begin(); i != str.end(); ++i) { ------------------ | Branch (118:30): [True: 67.7k, False: 4.00k] ------------------ 119| 67.7k| if(*i == delim) { ------------------ | Branch (119:10): [True: 1.83k, False: 65.9k] ------------------ 120| 1.83k| if(!substr.empty()) { ------------------ | Branch (120:13): [True: 1.83k, False: 0] ------------------ 121| 1.83k| elems.push_back(substr); 122| 1.83k| } 123| 1.83k| substr.clear(); 124| 65.9k| } else { 125| 65.9k| substr += *i; 126| 65.9k| } 127| 67.7k| } 128| | 129| 4.00k| if(substr.empty()) { ------------------ | Branch (129:7): [True: 0, False: 4.00k] ------------------ 130| 0| throw Invalid_Argument(fmt("Unable to split string '{}", str)); 131| 0| } 132| 4.00k| elems.push_back(substr); 133| | 134| 4.00k| return elems; 135| 4.00k|} _ZN5Botan14ipv4_to_stringEj: 181| 2.96k|std::string ipv4_to_string(uint32_t ip) { 182| 2.96k| std::string str; 183| 2.96k| uint8_t bits[4]; 184| 2.96k| store_be(ip, bits); 185| | 186| 14.8k| for(size_t i = 0; i != 4; ++i) { ------------------ | Branch (186:22): [True: 11.8k, False: 2.96k] ------------------ 187| 11.8k| if(i > 0) { ------------------ | Branch (187:10): [True: 8.88k, False: 2.96k] ------------------ 188| 8.88k| str += "."; 189| 8.88k| } 190| 11.8k| str += std::to_string(bits[i]); 191| 11.8k| } 192| | 193| 2.96k| return str; 194| 2.96k|} _ZN5Botan9SCAN_NameC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 58| 415|SCAN_Name::SCAN_Name(std::string_view algo_spec) : m_orig_algo_spec(algo_spec), m_alg_name(), m_args(), m_mode_info() { 59| 415| if(algo_spec.empty()) { ------------------ | Branch (59:7): [True: 0, False: 415] ------------------ 60| 0| throw Invalid_Argument("Expected algorithm name, got empty string"); 61| 0| } 62| | 63| 415| std::vector> name; 64| 415| size_t level = 0; 65| 415| std::pair accum = std::make_pair(level, ""); 66| | 67| 415| const std::string decoding_error = "Bad SCAN name '" + m_orig_algo_spec + "': "; 68| | 69| 5.37k| for(char c : algo_spec) { ------------------ | Branch (69:15): [True: 5.37k, False: 415] ------------------ 70| 5.37k| if(c == '/' || c == ',' || c == '(' || c == ')') { ------------------ | Branch (70:10): [True: 0, False: 5.37k] | Branch (70:22): [True: 84, False: 5.28k] | Branch (70:34): [True: 414, False: 4.87k] | Branch (70:46): [True: 414, False: 4.45k] ------------------ 71| 912| if(c == '(') { ------------------ | Branch (71:13): [True: 414, False: 498] ------------------ 72| 414| ++level; 73| 498| } else if(c == ')') { ------------------ | Branch (73:20): [True: 414, False: 84] ------------------ 74| 414| if(level == 0) { ------------------ | Branch (74:16): [True: 0, False: 414] ------------------ 75| 0| throw Decoding_Error(decoding_error + "Mismatched parens"); 76| 0| } 77| 414| --level; 78| 414| } 79| | 80| 912| if(c == '/' && level > 0) { ------------------ | Branch (80:13): [True: 0, False: 912] | Branch (80:25): [True: 0, False: 0] ------------------ 81| 0| accum.second.push_back(c); 82| 912| } else { 83| 912| if(!accum.second.empty()) { ------------------ | Branch (83:16): [True: 912, False: 0] ------------------ 84| 912| name.push_back(accum); 85| 912| } 86| 912| accum = std::make_pair(level, ""); 87| 912| } 88| 4.45k| } else { 89| 4.45k| accum.second.push_back(c); 90| 4.45k| } 91| 5.37k| } 92| | 93| 415| if(!accum.second.empty()) { ------------------ | Branch (93:7): [True: 1, False: 414] ------------------ 94| 1| name.push_back(accum); 95| 1| } 96| | 97| 415| if(level != 0) { ------------------ | Branch (97:7): [True: 0, False: 415] ------------------ 98| 0| throw Decoding_Error(decoding_error + "Missing close paren"); 99| 0| } 100| | 101| 415| if(name.empty()) { ------------------ | Branch (101:7): [True: 0, False: 415] ------------------ 102| 0| throw Decoding_Error(decoding_error + "Empty name"); 103| 0| } 104| | 105| 415| m_alg_name = name[0].second; 106| | 107| 415| bool in_modes = false; 108| | 109| 913| for(size_t i = 1; i != name.size(); ++i) { ------------------ | Branch (109:22): [True: 498, False: 415] ------------------ 110| 498| if(name[i].first == 0) { ------------------ | Branch (110:10): [True: 0, False: 498] ------------------ 111| 0| m_mode_info.push_back(make_arg(name, i)); 112| 0| in_modes = true; 113| 498| } else if(name[i].first == 1 && !in_modes) { ------------------ | Branch (113:17): [True: 498, False: 0] | Branch (113:39): [True: 498, False: 0] ------------------ 114| 498| m_args.push_back(make_arg(name, i)); 115| 498| } 116| 498| } 117| 415|} _ZNK5Botan9SCAN_Name3argEm: 119| 786|std::string SCAN_Name::arg(size_t i) const { 120| 786| if(i >= arg_count()) { ------------------ | Branch (120:7): [True: 0, False: 786] ------------------ 121| 0| throw Invalid_Argument("SCAN_Name::arg " + std::to_string(i) + " out of range for '" + to_string() + "'"); 122| 0| } 123| 786| return m_args[i]; 124| 786|} _ZNK5Botan9SCAN_Name3argEmNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 126| 42|std::string SCAN_Name::arg(size_t i, std::string_view def_value) const { 127| 42| if(i >= arg_count()) { ------------------ | Branch (127:7): [True: 0, False: 42] ------------------ 128| 0| return std::string(def_value); 129| 0| } 130| 42| return m_args[i]; 131| 42|} _ZNK5Botan9SCAN_Name14arg_as_integerEmm: 133| 42|size_t SCAN_Name::arg_as_integer(size_t i, size_t def_value) const { 134| 42| if(i >= arg_count()) { ------------------ | Branch (134:7): [True: 0, False: 42] ------------------ 135| 0| return def_value; 136| 0| } 137| 42| return to_u32bit(m_args[i]); 138| 42|} scan_name.cpp:_ZN5Botan12_GLOBAL__N_18make_argERKNSt3__16vectorINS1_4pairImNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEENS7_ISA_EEEEm: 17| 498|std::string make_arg(const std::vector>& name, size_t start) { 18| 498| std::string output = name[start].second; 19| 498| size_t level = name[start].first; 20| | 21| 498| size_t paren_depth = 0; 22| | 23| 498| for(size_t i = start + 1; i != name.size(); ++i) { ------------------ | Branch (23:30): [True: 84, False: 414] ------------------ 24| 84| if(name[i].first <= name[start].first) { ------------------ | Branch (24:10): [True: 84, False: 0] ------------------ 25| 84| break; 26| 84| } 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| 498| for(size_t i = 0; i != paren_depth; ++i) { ------------------ | Branch (47:22): [True: 0, False: 498] ------------------ 48| 0| output += ")"; 49| 0| } 50| | 51| 498| return output; 52| 498|} _ZN5Botan15AlternativeNameC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_S5_S5_: 27| 13.1k| std::string_view ip) { 28| 13.1k| add_attribute("RFC822", email_addr); 29| 13.1k| add_attribute("DNS", dns); 30| 13.1k| add_attribute("URI", uri); 31| 13.1k| add_attribute("IP", ip); 32| 13.1k|} _ZN5Botan15AlternativeName13add_attributeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 37| 66.0k|void AlternativeName::add_attribute(std::string_view type, std::string_view value) { 38| 66.0k| if(type.empty() || value.empty()) { ------------------ | Branch (38:7): [True: 0, False: 66.0k] | Branch (38:23): [True: 56.5k, False: 9.43k] ------------------ 39| 56.5k| return; 40| 56.5k| } 41| | 42| 9.43k| auto range = m_alt_info.equal_range(type); 43| 84.0k| for(auto j = range.first; j != range.second; ++j) { ------------------ | Branch (43:30): [True: 78.9k, False: 5.06k] ------------------ 44| 78.9k| if(j->second == value) { ------------------ | Branch (44:10): [True: 4.37k, False: 74.5k] ------------------ 45| 4.37k| return; 46| 4.37k| } 47| 78.9k| } 48| | 49| 5.06k| m_alt_info.emplace(type, value); 50| 5.06k|} _ZN5Botan15AlternativeName13add_othernameERKNS_3OIDENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEENS_9ASN1_TypeE: 55| 2.31k|void AlternativeName::add_othername(const OID& oid, std::string_view value, ASN1_Type type) { 56| 2.31k| if(value.empty()) { ------------------ | Branch (56:7): [True: 102, False: 2.21k] ------------------ 57| 102| return; 58| 102| } 59| 2.21k| multimap_insert(m_othernames, oid, ASN1_String(value, type)); 60| 2.21k|} _ZNK5Botan15AlternativeName8contentsEv: 65| 233|std::multimap AlternativeName::contents() const { 66| 233| std::multimap names; 67| | 68| 766| for(const auto& name : m_alt_info) { ------------------ | Branch (68:25): [True: 766, False: 233] ------------------ 69| 766| names.emplace(name.first, name.second); 70| 766| } 71| | 72| 609| for(const auto& othername : m_othernames) { ------------------ | Branch (72:30): [True: 609, False: 233] ------------------ 73| 609| multimap_insert(names, othername.first.to_formatted_string(), othername.second.value()); 74| 609| } 75| | 76| 233| return names; 77| 233|} _ZN5Botan15AlternativeName11decode_fromERNS_11BER_DecoderE: 177| 1.37k|void AlternativeName::decode_from(BER_Decoder& source) { 178| 1.37k| BER_Decoder names = source.start_sequence(); 179| | 180| | // FIXME this is largely a duplication of GeneralName::decode_from 181| | 182| 30.8k| while(names.more_items()) { ------------------ | Branch (182:10): [True: 29.4k, False: 1.36k] ------------------ 183| 29.4k| BER_Object obj = names.get_next_object(); 184| | 185| 29.4k| if(obj.is_a(0, ASN1_Class::ContextSpecific)) { ------------------ | Branch (185:10): [True: 3.01k, False: 26.4k] ------------------ 186| 3.01k| BER_Decoder othername(obj); 187| | 188| 3.01k| OID oid; 189| 3.01k| othername.decode(oid); 190| 3.01k| if(othername.more_items()) { ------------------ | Branch (190:13): [True: 2.85k, False: 165] ------------------ 191| 2.85k| BER_Object othername_value_outer = othername.get_next_object(); 192| 2.85k| othername.verify_end(); 193| | 194| 2.85k| if(othername_value_outer.is_a(0, ASN1_Class::ExplicitContextSpecific) == false) { ------------------ | Branch (194:16): [True: 15, False: 2.83k] ------------------ 195| 15| throw Decoding_Error("Invalid tags on otherName value"); 196| 15| } 197| | 198| 2.83k| BER_Decoder othername_value_inner(othername_value_outer); 199| | 200| 2.83k| BER_Object value = othername_value_inner.get_next_object(); 201| 2.83k| othername_value_inner.verify_end(); 202| | 203| 2.83k| if(ASN1_String::is_string_type(value.type()) && value.get_class() == ASN1_Class::Universal) { ------------------ | Branch (203:16): [True: 2.47k, False: 357] | Branch (203:61): [True: 2.31k, False: 164] ------------------ 204| 2.31k| add_othername(oid, ASN1::to_string(value), value.type()); 205| 2.31k| } 206| 2.83k| } 207| 3.01k| } 208| 29.4k| if(obj.is_a(1, ASN1_Class::ContextSpecific)) { ------------------ | Branch (208:10): [True: 5.18k, False: 24.2k] ------------------ 209| 5.18k| add_attribute("RFC822", ASN1::to_string(obj)); 210| 24.2k| } else if(obj.is_a(2, ASN1_Class::ContextSpecific)) { ------------------ | Branch (210:17): [True: 2.14k, False: 22.1k] ------------------ 211| 2.14k| add_attribute("DNS", ASN1::to_string(obj)); 212| 22.1k| } else if(obj.is_a(6, ASN1_Class::ContextSpecific)) { ------------------ | Branch (212:17): [True: 1.60k, False: 20.5k] ------------------ 213| 1.60k| add_attribute("URI", ASN1::to_string(obj)); 214| 20.5k| } else if(obj.is_a(4, ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) { ------------------ | Branch (214:17): [True: 1.74k, False: 18.8k] ------------------ 215| 1.74k| BER_Decoder dec(obj); 216| 1.74k| X509_DN dn; 217| 1.74k| std::stringstream ss; 218| | 219| 1.74k| dec.decode(dn); 220| 1.74k| ss << dn; 221| | 222| 1.74k| add_attribute("DN", ss.str()); 223| 18.8k| } else if(obj.is_a(7, ASN1_Class::ContextSpecific)) { ------------------ | Branch (223:17): [True: 3.88k, False: 14.9k] ------------------ 224| 3.88k| if(obj.length() == 4) { ------------------ | Branch (224:13): [True: 2.86k, False: 1.01k] ------------------ 225| 2.86k| const uint32_t ip = load_be(obj.bits(), 0); 226| 2.86k| add_attribute("IP", ipv4_to_string(ip)); 227| 2.86k| } 228| 3.88k| } 229| 29.4k| } 230| 1.37k|} _ZN5Botan11GeneralName11decode_fromERNS_11BER_DecoderE: 34| 1.27k|void GeneralName::decode_from(BER_Decoder& ber) { 35| 1.27k| BER_Object obj = ber.get_next_object(); 36| | 37| 1.27k| if(obj.is_a(1, ASN1_Class::ContextSpecific)) { ------------------ | Branch (37:7): [True: 195, False: 1.08k] ------------------ 38| 195| m_type = "RFC822"; 39| 195| m_name = ASN1::to_string(obj); 40| 1.08k| } else if(obj.is_a(2, ASN1_Class::ContextSpecific)) { ------------------ | Branch (40:14): [True: 158, False: 924] ------------------ 41| 158| m_type = "DNS"; 42| 158| m_name = ASN1::to_string(obj); 43| 924| } else if(obj.is_a(6, ASN1_Class::ContextSpecific)) { ------------------ | Branch (43:14): [True: 78, False: 846] ------------------ 44| 78| m_type = "URI"; 45| 78| m_name = ASN1::to_string(obj); 46| 846| } else if(obj.is_a(4, ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) { ------------------ | Branch (46:14): [True: 596, False: 250] ------------------ 47| 596| m_type = "DN"; 48| 596| X509_DN dn; 49| 596| BER_Decoder dec(obj); 50| 596| std::stringstream ss; 51| | 52| 596| dn.decode_from(dec); 53| 596| ss << dn; 54| | 55| 596| m_name = ss.str(); 56| 596| } else if(obj.is_a(7, ASN1_Class::ContextSpecific)) { ------------------ | Branch (56:14): [True: 83, False: 167] ------------------ 57| 83| if(obj.length() == 8) { ------------------ | Branch (57:10): [True: 49, False: 34] ------------------ 58| 49| m_type = "IP"; 59| 49| m_name = 60| 49| ipv4_to_string(load_be(obj.bits(), 0)) + "/" + ipv4_to_string(load_be(obj.bits(), 1)); 61| 49| } else if(obj.length() == 32) { ------------------ | Branch (61:17): [True: 1, False: 33] ------------------ 62| 1| throw Decoding_Error("Unsupported IPv6 name constraint"); 63| 33| } else { 64| 33| throw Decoding_Error("Invalid IP name constraint size " + std::to_string(obj.length())); 65| 33| } 66| 167| } else { 67| 167| throw Decoding_Error("Found unknown GeneralName type"); 68| 167| } 69| 1.27k|} _ZN5Botan14GeneralSubtree11decode_fromERNS_11BER_DecoderE: 200| 1.42k|void GeneralSubtree::decode_from(BER_Decoder& ber) { 201| 1.42k| ber.start_sequence() 202| 1.42k| .decode(m_base) 203| 1.42k| .decode_optional(m_minimum, ASN1_Type(0), ASN1_Class::ContextSpecific, size_t(0)) 204| 1.42k| .end_cons(); 205| | 206| 1.42k| if(m_minimum != 0) { ------------------ | Branch (206:7): [True: 23, False: 1.40k] ------------------ 207| 23| throw Decoding_Error("GeneralSubtree minimum must be 0"); 208| 23| } 209| | 210| 1.40k| m_maximum = std::numeric_limits::max(); 211| 1.40k|} _ZN5Botan7X509_DN13add_attributeERKNS_3OIDERKNS_11ASN1_StringE: 96| 14.8k|void X509_DN::add_attribute(const OID& oid, const ASN1_String& str) { 97| 14.8k| if(str.empty()) { ------------------ | Branch (97:7): [True: 305, False: 14.5k] ------------------ 98| 305| return; 99| 305| } 100| | 101| 14.5k| m_rdn.push_back(std::make_pair(oid, str)); 102| 14.5k| m_dn_bits.clear(); 103| 14.5k|} _ZNK5Botan7X509_DN14get_attributesEv: 108| 6.68k|std::multimap X509_DN::get_attributes() const { 109| 6.68k| std::multimap retval; 110| | 111| 6.68k| for(auto& i : m_rdn) { ------------------ | Branch (111:16): [True: 5.74k, False: 6.68k] ------------------ 112| 5.74k| multimap_insert(retval, i.first, i.second.value()); 113| 5.74k| } 114| 6.68k| return retval; 115| 6.68k|} _ZN5BotaneqERKNS_7X509_DNES2_: 216| 3.34k|bool operator==(const X509_DN& dn1, const X509_DN& dn2) { 217| 3.34k| auto attr1 = dn1.get_attributes(); 218| 3.34k| auto attr2 = dn2.get_attributes(); 219| | 220| 3.34k| if(attr1.size() != attr2.size()) { ------------------ | Branch (220:7): [True: 243, False: 3.10k] ------------------ 221| 243| return false; 222| 243| } 223| | 224| 3.10k| auto p1 = attr1.begin(); 225| 3.10k| auto p2 = attr2.begin(); 226| | 227| 4.77k| while(true) { ------------------ | Branch (227:10): [Folded - Ignored] ------------------ 228| 4.77k| if(p1 == attr1.end() && p2 == attr2.end()) { ------------------ | Branch (228:10): [True: 2.85k, False: 1.92k] | Branch (228:10): [True: 2.85k, False: 1.92k] | Branch (228:31): [True: 2.85k, False: 0] ------------------ 229| 2.85k| break; 230| 2.85k| } 231| 1.92k| if(p1 == attr1.end()) { ------------------ | Branch (231:10): [True: 0, False: 1.92k] ------------------ 232| 0| return false; 233| 0| } 234| 1.92k| if(p2 == attr2.end()) { ------------------ | Branch (234:10): [True: 0, False: 1.92k] ------------------ 235| 0| return false; 236| 0| } 237| 1.92k| if(p1->first != p2->first) { ------------------ | Branch (237:10): [True: 198, False: 1.72k] ------------------ 238| 198| return false; 239| 198| } 240| 1.72k| if(!x500_name_cmp(p1->second, p2->second)) { ------------------ | Branch (240:10): [True: 51, False: 1.67k] ------------------ 241| 51| return false; 242| 51| } 243| 1.67k| ++p1; 244| 1.67k| ++p2; 245| 1.67k| } 246| 2.85k| return true; 247| 3.10k|} _ZN5Botan7X509_DN11decode_fromERNS_11BER_DecoderE: 341| 11.7k|void X509_DN::decode_from(BER_Decoder& source) { 342| 11.7k| std::vector bits; 343| | 344| 11.7k| source.start_sequence().raw_bytes(bits).end_cons(); 345| | 346| 11.7k| BER_Decoder sequence(bits); 347| | 348| 11.7k| m_rdn.clear(); 349| | 350| 27.0k| while(sequence.more_items()) { ------------------ | Branch (350:10): [True: 15.3k, False: 11.7k] ------------------ 351| 15.3k| BER_Decoder rdn = sequence.start_set(); 352| | 353| 30.6k| while(rdn.more_items()) { ------------------ | Branch (353:13): [True: 15.2k, False: 15.3k] ------------------ 354| 15.2k| OID oid; 355| 15.2k| ASN1_String str; 356| | 357| 15.2k| rdn.start_sequence() 358| 15.2k| .decode(oid) 359| 15.2k| .decode(str) // TODO support Any 360| 15.2k| .end_cons(); 361| | 362| 15.2k| add_attribute(oid, str); 363| 15.2k| } 364| 15.3k| } 365| | 366| | // Have to assign last as add_attribute zaps m_dn_bits 367| 11.7k| m_dn_bits = bits; 368| 11.7k|} _ZN5BotanlsERNSt3__113basic_ostreamIcNS0_11char_traitsIcEEEERKNS_7X509_DNE: 402| 1.82k|std::ostream& operator<<(std::ostream& out, const X509_DN& dn) { 403| 1.82k| auto info = dn.dn_info(); 404| | 405| 4.83k| for(size_t i = 0; i != info.size(); ++i) { ------------------ | Branch (405:22): [True: 3.01k, False: 1.82k] ------------------ 406| 3.01k| out << to_short_form(info[i].first) << "=\""; 407| 11.3k| for(char c : info[i].second.value()) { ------------------ | Branch (407:18): [True: 11.3k, False: 3.01k] ------------------ 408| 11.3k| if(c == '\\' || c == '\"') { ------------------ | Branch (408:13): [True: 318, False: 11.0k] | Branch (408:26): [True: 313, False: 10.7k] ------------------ 409| 631| out << "\\"; 410| 631| } 411| 11.3k| out << c; 412| 11.3k| } 413| 3.01k| out << "\""; 414| | 415| 3.01k| if(i + 1 < info.size()) { ------------------ | Branch (415:10): [True: 1.39k, False: 1.62k] ------------------ 416| 1.39k| out << ","; 417| 1.39k| } 418| 3.01k| } 419| 1.82k| return out; 420| 1.82k|} x509_dn.cpp:_ZN5Botan12_GLOBAL__N_113x500_name_cmpENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 34| 1.72k|bool x500_name_cmp(std::string_view name1, std::string_view name2) { 35| 1.72k| auto p1 = name1.begin(); 36| 1.72k| auto p2 = name2.begin(); 37| | 38| 1.91k| while((p1 != name1.end()) && is_space(*p1)) { ------------------ | Branch (38:10): [True: 1.91k, False: 1] | Branch (38:33): [True: 188, False: 1.72k] ------------------ 39| 188| ++p1; 40| 188| } 41| 1.86k| while((p2 != name2.end()) && is_space(*p2)) { ------------------ | Branch (41:10): [True: 1.86k, False: 1] | Branch (41:33): [True: 135, False: 1.72k] ------------------ 42| 135| ++p2; 43| 135| } 44| | 45| 22.7k| while(p1 != name1.end() && p2 != name2.end()) { ------------------ | Branch (45:10): [True: 21.0k, False: 1.68k] | Branch (45:31): [True: 21.0k, False: 9] ------------------ 46| 21.0k| if(is_space(*p1)) { ------------------ | Branch (46:10): [True: 892, False: 20.1k] ------------------ 47| 892| if(!is_space(*p2)) { ------------------ | Branch (47:13): [True: 3, False: 889] ------------------ 48| 3| return false; 49| 3| } 50| | 51| 2.10k| while((p1 != name1.end()) && is_space(*p1)) { ------------------ | Branch (51:16): [True: 2.10k, False: 4] | Branch (51:39): [True: 1.21k, False: 885] ------------------ 52| 1.21k| ++p1; 53| 1.21k| } 54| 2.20k| while((p2 != name2.end()) && is_space(*p2)) { ------------------ | Branch (54:16): [True: 2.19k, False: 4] | Branch (54:39): [True: 1.31k, False: 885] ------------------ 55| 1.31k| ++p2; 56| 1.31k| } 57| | 58| 889| if(p1 == name1.end() && p2 == name2.end()) { ------------------ | Branch (58:13): [True: 4, False: 885] | Branch (58:34): [True: 2, False: 2] ------------------ 59| 2| return true; 60| 2| } 61| 887| if(p1 == name1.end() || p2 == name2.end()) { ------------------ | Branch (61:13): [True: 2, False: 885] | Branch (61:34): [True: 2, False: 883] ------------------ 62| 4| return false; 63| 4| } 64| 887| } 65| | 66| 21.0k| if(!caseless_cmp(*p1, *p2)) { ------------------ | Branch (66:10): [True: 30, False: 21.0k] ------------------ 67| 30| return false; 68| 30| } 69| 21.0k| ++p1; 70| 21.0k| ++p2; 71| 21.0k| } 72| | 73| 1.77k| while((p1 != name1.end()) && is_space(*p1)) { ------------------ | Branch (73:10): [True: 92, False: 1.68k] | Branch (73:33): [True: 85, False: 7] ------------------ 74| 85| ++p1; 75| 85| } 76| 1.78k| while((p2 != name2.end()) && is_space(*p2)) { ------------------ | Branch (76:10): [True: 100, False: 1.68k] | Branch (76:33): [True: 93, False: 7] ------------------ 77| 93| ++p2; 78| 93| } 79| | 80| 1.68k| if((p1 != name1.end()) || (p2 != name2.end())) { ------------------ | Branch (80:7): [True: 7, False: 1.68k] | Branch (80:30): [True: 7, False: 1.67k] ------------------ 81| 14| return false; 82| 14| } 83| 1.67k| return true; 84| 1.68k|} x509_dn.cpp:_ZN5Botan12_GLOBAL__N_112_GLOBAL__N_18is_spaceEc: 27| 30.2k|bool is_space(char c) { return std::isspace(static_cast(c)); } x509_dn.cpp:_ZN5Botan12_GLOBAL__N_112_GLOBAL__N_112caseless_cmpEcc: 23| 21.0k|bool caseless_cmp(char a, char b) { 24| 21.0k| return (std::tolower(static_cast(a)) == std::tolower(static_cast(b))); 25| 21.0k|} x509_dn.cpp:_ZN5Botan12_GLOBAL__N_113to_short_formERKNS_3OIDE: 372| 3.01k|std::string to_short_form(const OID& oid) { 373| 3.01k| std::string long_id = oid.to_formatted_string(); 374| | 375| 3.01k| if(long_id == "X520.CommonName") { ------------------ | Branch (375:7): [True: 201, False: 2.81k] ------------------ 376| 201| return "CN"; 377| 201| } 378| | 379| 2.81k| if(long_id == "X520.Country") { ------------------ | Branch (379:7): [True: 170, False: 2.64k] ------------------ 380| 170| return "C"; 381| 170| } 382| | 383| 2.64k| if(long_id == "X520.Organization") { ------------------ | Branch (383:7): [True: 102, False: 2.53k] ------------------ 384| 102| return "O"; 385| 102| } 386| | 387| 2.53k| if(long_id == "X520.OrganizationalUnit") { ------------------ | Branch (387:7): [True: 115, False: 2.42k] ------------------ 388| 115| return "OU"; 389| 115| } 390| | 391| 2.42k| return long_id; 392| 2.53k|} _ZN5Botan10Extensions15create_extn_objERKNS_3OIDEbRKNSt3__16vectorIhNS4_9allocatorIhEEEE: 93| 14.1k| const std::vector& body) { 94| 14.1k| const std::string oid_str = oid.to_string(); 95| | 96| 14.1k| auto extn = extension_from_oid(oid); 97| | 98| 14.1k| if(!extn) { ------------------ | Branch (98:7): [True: 6.42k, False: 7.74k] ------------------ 99| | // some other unknown extension type 100| 6.42k| extn = std::make_unique(oid, critical); 101| 6.42k| } 102| | 103| 14.1k| try { 104| 14.1k| extn->decode_inner(body); 105| 14.1k| } catch(Decoding_Error&) { 106| 6.18k| extn = std::make_unique(oid, critical); 107| 6.18k| extn->decode_inner(body); 108| 6.18k| } 109| 14.1k| return extn; 110| 14.1k|} _ZNK5Botan10Extensions20get_extension_objectERKNS_3OIDE: 188| 36.7k|const Certificate_Extension* Extensions::get_extension_object(const OID& oid) const { 189| 36.7k| auto extn = m_extension_info.find(oid); 190| 36.7k| if(extn == m_extension_info.end()) { ------------------ | Branch (190:7): [True: 36.2k, False: 584] ------------------ 191| 36.2k| return nullptr; 192| 36.2k| } 193| | 194| 584| return &extn->second.obj(); 195| 36.7k|} _ZN5Botan10Extensions11decode_fromERNS_11BER_DecoderE: 245| 1.56k|void Extensions::decode_from(BER_Decoder& from_source) { 246| 1.56k| m_extension_oids.clear(); 247| 1.56k| m_extension_info.clear(); 248| | 249| 1.56k| BER_Decoder sequence = from_source.start_sequence(); 250| | 251| 16.6k| while(sequence.more_items()) { ------------------ | Branch (251:10): [True: 15.1k, False: 1.56k] ------------------ 252| 15.1k| OID oid; 253| 15.1k| bool critical; 254| 15.1k| std::vector bits; 255| | 256| 15.1k| sequence.start_sequence() 257| 15.1k| .decode(oid) 258| 15.1k| .decode_optional(critical, ASN1_Type::Boolean, ASN1_Class::Universal, false) 259| 15.1k| .decode(bits, ASN1_Type::OctetString) 260| 15.1k| .end_cons(); 261| | 262| 15.1k| auto obj = create_extn_obj(oid, critical, bits); 263| 15.1k| Extensions_Info info(critical, bits, std::move(obj)); 264| | 265| 15.1k| m_extension_oids.push_back(oid); 266| 15.1k| m_extension_info.emplace(oid, info); 267| 15.1k| } 268| 1.56k| sequence.verify_end(); 269| 1.56k|} _ZNK5Botan14Cert_Extension17Basic_Constraints14get_path_limitEv: 276| 2|size_t Basic_Constraints::get_path_limit() const { 277| 2| if(!m_is_ca) { ------------------ | Branch (277:7): [True: 0, False: 2] ------------------ 278| 0| throw Invalid_State("Basic_Constraints::get_path_limit: Not a CA"); 279| 0| } 280| 2| return m_path_limit; 281| 2|} _ZN5Botan14Cert_Extension17Basic_Constraints12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 298| 800|void Basic_Constraints::decode_inner(const std::vector& in) { 299| 800| BER_Decoder(in) 300| 800| .start_sequence() 301| 800| .decode_optional(m_is_ca, ASN1_Type::Boolean, ASN1_Class::Universal, false) 302| 800| .decode_optional(m_path_limit, ASN1_Type::Integer, ASN1_Class::Universal, NO_CERT_PATH_LIMIT) 303| 800| .end_cons(); 304| | 305| 800| if(m_is_ca == false) { ------------------ | Branch (305:7): [True: 138, False: 662] ------------------ 306| 138| m_path_limit = 0; 307| 138| } 308| 800|} _ZN5Botan14Cert_Extension9Key_Usage12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 336| 608|void Key_Usage::decode_inner(const std::vector& in) { 337| 608| BER_Decoder ber(in); 338| | 339| 608| BER_Object obj = ber.get_next_object(); 340| | 341| 608| obj.assert_is_a(ASN1_Type::BitString, ASN1_Class::Universal, "usage constraint"); 342| | 343| 608| if(obj.length() != 2 && obj.length() != 3) { ------------------ | Branch (343:7): [True: 35, False: 573] | Branch (343:28): [True: 22, False: 13] ------------------ 344| 22| throw BER_Decoding_Error("Bad size for BITSTRING in usage constraint"); 345| 22| } 346| | 347| 586| uint16_t usage = 0; 348| | 349| 586| const uint8_t* bits = obj.bits(); 350| | 351| 586| if(bits[0] >= 8) { ------------------ | Branch (351:7): [True: 93, False: 493] ------------------ 352| 93| throw BER_Decoding_Error("Invalid unused bits in usage constraint"); 353| 93| } 354| | 355| 493| const uint8_t mask = static_cast(0xFF << bits[0]); 356| | 357| 493| if(obj.length() == 2) { ------------------ | Branch (357:7): [True: 84, False: 409] ------------------ 358| 84| usage = make_uint16(bits[1] & mask, 0); 359| 409| } else if(obj.length() == 3) { ------------------ | Branch (359:14): [True: 10, False: 399] ------------------ 360| 10| usage = make_uint16(bits[1], bits[2] & mask); 361| 10| } 362| | 363| 493| m_constraints = Key_Constraints(usage); 364| 493|} _ZN5Botan14Cert_Extension14Subject_Key_ID12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 378| 570|void Subject_Key_ID::decode_inner(const std::vector& in) { 379| 570| BER_Decoder(in).decode(m_key_id, ASN1_Type::OctetString).verify_end(); 380| 570|} _ZN5Botan14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 415| 328|void Authority_Key_ID::decode_inner(const std::vector& in) { 416| 328| BER_Decoder(in).start_sequence().decode_optional_string(m_key_id, ASN1_Type::OctetString, 0); 417| 328|} _ZN5Botan14Cert_Extension24Subject_Alternative_Name12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 440| 615|void Subject_Alternative_Name::decode_inner(const std::vector& in) { BER_Decoder(in).decode(m_alt_name); } _ZN5Botan14Cert_Extension23Issuer_Alternative_Name12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 445| 454|void Issuer_Alternative_Name::decode_inner(const std::vector& in) { BER_Decoder(in).decode(m_alt_name); } _ZN5Botan14Cert_Extension18Extended_Key_Usage12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 459| 226|void Extended_Key_Usage::decode_inner(const std::vector& in) { BER_Decoder(in).decode_list(m_oids); } _ZN5Botan14Cert_Extension16Name_Constraints12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 469| 1.72k|void Name_Constraints::decode_inner(const std::vector& in) { 470| 1.72k| std::vector permit, exclude; 471| 1.72k| BER_Decoder ber(in); 472| 1.72k| BER_Decoder ext = ber.start_sequence(); 473| 1.72k| BER_Object per = ext.get_next_object(); 474| | 475| 1.72k| ext.push_back(per); 476| 1.72k| if(per.is_a(0, ASN1_Class::Constructed | ASN1_Class::ContextSpecific)) { ------------------ | Branch (476:7): [True: 247, False: 1.48k] ------------------ 477| 247| ext.decode_list(permit, ASN1_Type(0), ASN1_Class::Constructed | ASN1_Class::ContextSpecific); 478| 247| if(permit.empty()) { ------------------ | Branch (478:10): [True: 2, False: 245] ------------------ 479| 2| throw Encoding_Error("Empty Name Contraint list"); 480| 2| } 481| 247| } 482| | 483| 1.72k| BER_Object exc = ext.get_next_object(); 484| 1.72k| ext.push_back(exc); 485| 1.72k| if(per.is_a(1, ASN1_Class::Constructed | ASN1_Class::ContextSpecific)) { ------------------ | Branch (485:7): [True: 880, False: 846] ------------------ 486| 880| ext.decode_list(exclude, ASN1_Type(1), ASN1_Class::Constructed | ASN1_Class::ContextSpecific); 487| 880| if(exclude.empty()) { ------------------ | Branch (487:10): [True: 1, False: 879] ------------------ 488| 1| throw Encoding_Error("Empty Name Contraint list"); 489| 1| } 490| 880| } 491| | 492| 1.72k| ext.end_cons(); 493| | 494| 1.72k| if(permit.empty() && exclude.empty()) { ------------------ | Branch (494:7): [True: 110, False: 1.61k] | Branch (494:25): [True: 6, False: 104] ------------------ 495| 6| throw Encoding_Error("Empty Name Contraint extension"); 496| 6| } 497| | 498| 1.71k| m_name_constraints = NameConstraints(std::move(permit), std::move(exclude)); 499| 1.71k|} _ZN5Botan14Cert_Extension20Certificate_Policies12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 598| 447|void Certificate_Policies::decode_inner(const std::vector& in) { 599| 447| std::vector policies; 600| | 601| 447| BER_Decoder(in).decode_list(policies); 602| 447| m_oids.clear(); 603| 447| for(const auto& policy : policies) { ------------------ | Branch (603:27): [True: 163, False: 447] ------------------ 604| 163| m_oids.push_back(policy.oid()); 605| 163| } 606| 447|} _ZN5Botan14Cert_Extension28Authority_Information_Access12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 633| 359|void Authority_Information_Access::decode_inner(const std::vector& in) { 634| 359| BER_Decoder ber = BER_Decoder(in).start_sequence(); 635| | 636| 971| while(ber.more_items()) { ------------------ | Branch (636:10): [True: 612, False: 359] ------------------ 637| 612| OID oid; 638| | 639| 612| BER_Decoder info = ber.start_sequence(); 640| | 641| 612| info.decode(oid); 642| | 643| 612| if(oid == OID::from_string("PKIX.OCSP")) { ------------------ | Branch (643:10): [True: 67, False: 545] ------------------ 644| 67| BER_Object name = info.get_next_object(); 645| | 646| 67| if(name.is_a(6, ASN1_Class::ContextSpecific)) { ------------------ | Branch (646:13): [True: 36, False: 31] ------------------ 647| 36| m_ocsp_responder = ASN1::to_string(name); 648| 36| } 649| 67| } 650| 612| if(oid == OID::from_string("PKIX.CertificateAuthorityIssuers")) { ------------------ | Branch (650:10): [True: 102, False: 510] ------------------ 651| 102| BER_Object name = info.get_next_object(); 652| | 653| 102| if(name.is_a(6, ASN1_Class::ContextSpecific)) { ------------------ | Branch (653:13): [True: 65, False: 37] ------------------ 654| 65| m_ca_issuers.push_back(ASN1::to_string(name)); 655| 65| } 656| 102| } 657| 612| } 658| 359|} _ZN5Botan14Cert_Extension10CRL_Number12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 692| 413|void CRL_Number::decode_inner(const std::vector& in) { 693| 413| BER_Decoder(in).decode(m_crl_number); 694| 413| m_has_value = true; 695| 413|} _ZN5Botan14Cert_Extension14CRL_ReasonCode12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 709| 324|void CRL_ReasonCode::decode_inner(const std::vector& in) { 710| 324| size_t reason_code = 0; 711| 324| BER_Decoder(in).decode(reason_code, ASN1_Type::Enumerated, ASN1_Class::Universal); 712| 324| m_reason = static_cast(reason_code); 713| 324|} _ZN5Botan14Cert_Extension23CRL_Distribution_Points12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 719| 563|void CRL_Distribution_Points::decode_inner(const std::vector& buf) { 720| 563| BER_Decoder(buf).decode_list(m_distribution_points).verify_end(); 721| | 722| 563| std::stringstream ss; 723| | 724| 563| for(const auto& distribution_point : m_distribution_points) { ------------------ | Branch (724:39): [True: 233, False: 563] ------------------ 725| 233| auto contents = distribution_point.point().contents(); 726| | 727| 1.37k| for(const auto& pair : contents) { ------------------ | Branch (727:28): [True: 1.37k, False: 233] ------------------ 728| 1.37k| ss << pair.first << ": " << pair.second << " "; 729| 1.37k| } 730| 233| } 731| | 732| 563| m_crl_distribution_urls.push_back(ss.str()); 733| 563|} _ZN5Botan14Cert_Extension23CRL_Distribution_Points18Distribution_Point11decode_fromERNS_11BER_DecoderE: 739| 934|void CRL_Distribution_Points::Distribution_Point::decode_from(BER_Decoder& ber) { 740| 934| ber.start_sequence() 741| 934| .start_context_specific(0) 742| 934| .decode_optional_implicit(m_point, 743| 934| ASN1_Type(0), 744| 934| ASN1_Class::ContextSpecific | ASN1_Class::Constructed, 745| 934| ASN1_Type::Sequence, 746| 934| ASN1_Class::Constructed) 747| 934| .end_cons() 748| 934| .end_cons(); 749| 934|} _ZN5Botan14Cert_Extension30CRL_Issuing_Distribution_Point12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 755| 305|void CRL_Issuing_Distribution_Point::decode_inner(const std::vector& buf) { 756| 305| BER_Decoder(buf).decode(m_distribution_point).verify_end(); 757| 305|} _ZN5Botan14Cert_Extension17Unknown_Extension12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 763| 12.6k|void Unknown_Extension::decode_inner(const std::vector& bytes) { 764| | // Just treat as an opaque blob at this level 765| 12.6k| m_bytes = bytes; 766| 12.6k|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_118extension_from_oidERKNS_3OIDE: 26| 14.1k|std::unique_ptr extension_from_oid(const OID& oid) { 27| 14.1k| if(oid == Cert_Extension::Subject_Key_ID::static_oid()) { ------------------ | Branch (27:7): [True: 570, False: 13.5k] ------------------ 28| 570| return std::make_unique(); 29| 570| } 30| | 31| 13.5k| if(oid == Cert_Extension::Key_Usage::static_oid()) { ------------------ | Branch (31:7): [True: 608, False: 12.9k] ------------------ 32| 608| return std::make_unique(); 33| 608| } 34| | 35| 12.9k| if(oid == Cert_Extension::Subject_Alternative_Name::static_oid()) { ------------------ | Branch (35:7): [True: 615, False: 12.3k] ------------------ 36| 615| return std::make_unique(); 37| 615| } 38| | 39| 12.3k| if(oid == Cert_Extension::Issuer_Alternative_Name::static_oid()) { ------------------ | Branch (39:7): [True: 454, False: 11.9k] ------------------ 40| 454| return std::make_unique(); 41| 454| } 42| | 43| 11.9k| if(oid == Cert_Extension::Basic_Constraints::static_oid()) { ------------------ | Branch (43:7): [True: 800, False: 11.1k] ------------------ 44| 800| return std::make_unique(); 45| 800| } 46| | 47| 11.1k| if(oid == Cert_Extension::CRL_Number::static_oid()) { ------------------ | Branch (47:7): [True: 413, False: 10.7k] ------------------ 48| 413| return std::make_unique(); 49| 413| } 50| | 51| 10.7k| if(oid == Cert_Extension::CRL_ReasonCode::static_oid()) { ------------------ | Branch (51:7): [True: 324, False: 10.3k] ------------------ 52| 324| return std::make_unique(); 53| 324| } 54| | 55| 10.3k| if(oid == Cert_Extension::Authority_Key_ID::static_oid()) { ------------------ | Branch (55:7): [True: 328, False: 10.0k] ------------------ 56| 328| return std::make_unique(); 57| 328| } 58| | 59| 10.0k| if(oid == Cert_Extension::Name_Constraints::static_oid()) { ------------------ | Branch (59:7): [True: 1.72k, False: 8.32k] ------------------ 60| 1.72k| return std::make_unique(); 61| 1.72k| } 62| | 63| 8.32k| if(oid == Cert_Extension::CRL_Distribution_Points::static_oid()) { ------------------ | Branch (63:7): [True: 563, False: 7.76k] ------------------ 64| 563| return std::make_unique(); 65| 563| } 66| | 67| 7.76k| if(oid == Cert_Extension::CRL_Issuing_Distribution_Point::static_oid()) { ------------------ | Branch (67:7): [True: 305, False: 7.45k] ------------------ 68| 305| return std::make_unique(); 69| 305| } 70| | 71| 7.45k| if(oid == Cert_Extension::Certificate_Policies::static_oid()) { ------------------ | Branch (71:7): [True: 447, False: 7.01k] ------------------ 72| 447| return std::make_unique(); 73| 447| } 74| | 75| 7.01k| if(oid == Cert_Extension::Extended_Key_Usage::static_oid()) { ------------------ | Branch (75:7): [True: 226, False: 6.78k] ------------------ 76| 226| return std::make_unique(); 77| 226| } 78| | 79| 6.78k| if(oid == Cert_Extension::Authority_Information_Access::static_oid()) { ------------------ | Branch (79:7): [True: 359, False: 6.42k] ------------------ 80| 359| return std::make_unique(); 81| 359| } 82| | 83| 6.42k| return nullptr; // unknown 84| 6.78k|} x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_118Policy_Information11decode_fromERNS_11BER_DecoderE: 569| 387| void decode_from(BER_Decoder& codec) override { 570| 387| codec.start_sequence().decode(m_oid).discard_remaining().end_cons(); 571| 387| } x509_ext.cpp:_ZNK5Botan14Cert_Extension12_GLOBAL__N_118Policy_Information3oidEv: 565| 163| const OID& oid() const { return m_oid; } x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_118Policy_InformationC2Ev: 561| 387| Policy_Information() = default; _ZN5Botan11X509_Object9load_dataERNS_10DataSourceE: 24| 6.43k|void X509_Object::load_data(DataSource& in) { 25| 6.43k| try { 26| 6.43k| if(ASN1::maybe_BER(in) && !PEM_Code::matches(in)) { ------------------ | Branch (26:10): [True: 6.12k, False: 305] | Branch (26:33): [True: 6.11k, False: 8] ------------------ 27| 6.11k| BER_Decoder dec(in); 28| 6.11k| decode_from(dec); 29| 6.11k| } else { 30| 313| std::string got_label; 31| 313| DataSource_Memory ber(PEM_Code::decode(in, got_label)); 32| | 33| 313| if(got_label != PEM_label()) { ------------------ | Branch (33:13): [True: 80, False: 233] ------------------ 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| 233| BER_Decoder dec(ber); 48| 233| decode_from(dec); 49| 233| } 50| 6.43k| } catch(Decoding_Error& e) { 51| 2.87k| throw Decoding_Error(PEM_label() + " decoding", e); 52| 2.87k| } 53| 6.43k|} _ZNK5Botan11X509_Object11encode_intoERNS_11DER_EncoderE: 55| 3.34k|void X509_Object::encode_into(DER_Encoder& to) const { 56| 3.34k| to.start_sequence() 57| 3.34k| .start_sequence() 58| 3.34k| .raw_bytes(signed_body()) 59| 3.34k| .end_cons() 60| 3.34k| .encode(signature_algorithm()) 61| 3.34k| .encode(signature(), ASN1_Type::BitString) 62| 3.34k| .end_cons(); 63| 3.34k|} _ZN5Botan11X509_Object11decode_fromERNS_11BER_DecoderE: 68| 6.12k|void X509_Object::decode_from(BER_Decoder& from) { 69| 6.12k| from.start_sequence() 70| 6.12k| .start_sequence() 71| 6.12k| .raw_bytes(m_tbs_bits) 72| 6.12k| .end_cons() 73| 6.12k| .decode(m_sig_algo) 74| 6.12k| .decode(m_sig, ASN1_Type::BitString) 75| 6.12k| .end_cons(); 76| | 77| 6.12k| force_decode(); 78| 6.12k|} _ZNK5Botan11X509_Object8tbs_dataEv: 88| 950|std::vector X509_Object::tbs_data() const { return ASN1::put_in_sequence(m_tbs_bits); } _ZNK5Botan11X509_Object16verify_signatureERKNS_10Public_KeyE: 98| 1.31k|std::pair X509_Object::verify_signature(const Public_Key& pub_key) const { 99| 1.31k| try { 100| 1.31k| PK_Verifier verifier(pub_key, signature_algorithm()); 101| 1.31k| const bool valid = verifier.verify_message(tbs_data(), signature()); 102| | 103| 1.31k| if(valid) { ------------------ | Branch (103:10): [True: 0, False: 1.31k] ------------------ 104| 0| return std::make_pair(Certificate_Status_Code::VERIFIED, verifier.hash_function()); 105| 1.31k| } else { 106| 1.31k| return std::make_pair(Certificate_Status_Code::SIGNATURE_ERROR, ""); 107| 1.31k| } 108| 1.31k| } catch(Decoding_Error&) { 109| 358| return std::make_pair(Certificate_Status_Code::SIGNATURE_ALGO_BAD_PARAMS, ""); 110| 358| } catch(Algorithm_Not_Found&) { 111| 1| return std::make_pair(Certificate_Status_Code::SIGNATURE_ALGO_UNKNOWN, ""); 112| 3| } catch(...) { 113| | // This shouldn't happen, fallback to generic signature error 114| 3| return std::make_pair(Certificate_Status_Code::SIGNATURE_ERROR, ""); 115| 3| } 116| 1.31k|} _ZNK5Botan16X509_Certificate9PEM_labelEv: 70| 3.03k|std::string X509_Certificate::PEM_label() const { return "CERTIFICATE"; } _ZNK5Botan16X509_Certificate20alternate_PEM_labelsEv: 72| 80|std::vector X509_Certificate::alternate_PEM_labels() const { return {"X509 CERTIFICATE"}; } _ZN5Botan16X509_CertificateC2ERNS_10DataSourceE: 74| 6.43k|X509_Certificate::X509_Certificate(DataSource& src) { load_data(src); } _ZN5Botan16X509_Certificate12force_decodeEv: 276| 5.29k|void X509_Certificate::force_decode() { 277| 5.29k| m_data.reset(); 278| 5.29k| m_data = parse_x509_cert_body(*this); 279| 5.29k|} x509cert.cpp:_ZN5Botan12_GLOBAL__N_120parse_x509_cert_bodyERKNS_11X509_ObjectE: 95| 5.29k|std::unique_ptr parse_x509_cert_body(const X509_Object& obj) { 96| 5.29k| auto data = std::make_unique(); 97| | 98| 5.29k| BigInt serial_bn; 99| 5.29k| BER_Object public_key; 100| 5.29k| BER_Object v3_exts_data; 101| | 102| 5.29k| BER_Decoder(obj.signed_body()) 103| 5.29k| .decode_optional(data->m_version, ASN1_Type(0), ASN1_Class::Constructed | ASN1_Class::ContextSpecific) 104| 5.29k| .decode(serial_bn) 105| 5.29k| .decode(data->m_sig_algo_inner) 106| 5.29k| .decode(data->m_issuer_dn) 107| 5.29k| .start_sequence() 108| 5.29k| .decode(data->m_not_before) 109| 5.29k| .decode(data->m_not_after) 110| 5.29k| .end_cons() 111| 5.29k| .decode(data->m_subject_dn) 112| 5.29k| .get_next(public_key) 113| 5.29k| .decode_optional_string(data->m_v2_issuer_key_id, ASN1_Type::BitString, 1) 114| 5.29k| .decode_optional_string(data->m_v2_subject_key_id, ASN1_Type::BitString, 2) 115| 5.29k| .get_next(v3_exts_data) 116| 5.29k| .verify_end("TBSCertificate has extra data after extensions block"); 117| | 118| 5.29k| if(data->m_version > 2) { ------------------ | Branch (118:7): [True: 5, False: 5.28k] ------------------ 119| 5| throw Decoding_Error("Unknown X.509 cert version " + std::to_string(data->m_version)); 120| 5| } 121| 5.28k| if(obj.signature_algorithm() != data->m_sig_algo_inner) { ------------------ | Branch (121:7): [True: 52, False: 5.23k] ------------------ 122| 52| throw Decoding_Error("X.509 Certificate had differing algorithm identifers in inner and outer ID fields"); 123| 52| } 124| | 125| 5.23k| 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.23k| 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.23k| data->m_version += 1; 132| | 133| 5.23k| data->m_serial = BigInt::encode(serial_bn); 134| 5.23k| data->m_subject_dn_bits = ASN1::put_in_sequence(data->m_subject_dn.get_bits()); 135| 5.23k| data->m_issuer_dn_bits = ASN1::put_in_sequence(data->m_issuer_dn.get_bits()); 136| | 137| 5.23k| data->m_subject_public_key_bits.assign(public_key.bits(), public_key.bits() + public_key.length()); 138| | 139| 5.23k| data->m_subject_public_key_bits_seq = ASN1::put_in_sequence(data->m_subject_public_key_bits); 140| | 141| 5.23k| BER_Decoder(data->m_subject_public_key_bits) 142| 5.23k| .decode(data->m_subject_public_key_algid) 143| 5.23k| .decode(data->m_subject_public_key_bitstring, ASN1_Type::BitString); 144| | 145| 5.23k| if(v3_exts_data.is_a(3, ASN1_Class::Constructed | ASN1_Class::ContextSpecific)) { ------------------ | Branch (145:7): [True: 1.56k, False: 3.67k] ------------------ 146| | // Path validation will reject a v1/v2 cert with v3 extensions 147| 1.56k| BER_Decoder(v3_exts_data).decode(data->m_v3_extensions).verify_end(); 148| 3.67k| } else if(v3_exts_data.is_set()) { ------------------ | Branch (148:14): [True: 59, False: 3.61k] ------------------ 149| 59| throw BER_Bad_Tag("Unknown tag in X.509 cert", v3_exts_data.tagging()); 150| 59| } 151| | 152| | // Now cache some fields from the extensions 153| 5.17k| if(auto ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (153:12): [True: 8, False: 5.17k] ------------------ 154| 8| 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| 8| if(data->m_key_constraints.empty()) { ------------------ | Branch (159:10): [True: 1, False: 7] ------------------ 160| 1| throw Decoding_Error("Certificate has invalid encoding for KeyUsage"); 161| 1| } 162| 8| } 163| | 164| 5.17k| if(auto ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (164:12): [True: 18, False: 5.15k] ------------------ 165| 18| data->m_subject_key_id = ext->get_key_id(); 166| 18| } 167| | 168| 5.17k| if(auto ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (168:12): [True: 22, False: 5.15k] ------------------ 169| 22| data->m_authority_key_id = ext->get_key_id(); 170| 22| } 171| | 172| 5.17k| if(auto ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (172:12): [True: 11, False: 5.16k] ------------------ 173| 11| data->m_name_constraints = ext->get_name_constraints(); 174| 11| } 175| | 176| 5.17k| if(auto ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (176:12): [True: 4, False: 5.17k] ------------------ 177| 4| if(ext->get_is_ca() == true) { ------------------ | Branch (177:10): [True: 3, False: 1] ------------------ 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| 3| if(data->m_key_constraints.empty() || data->m_key_constraints.includes(Key_Constraints::KeyCertSign)) { ------------------ | Branch (185:13): [True: 1, False: 2] | Branch (185:48): [True: 1, False: 1] ------------------ 186| 2| data->m_is_ca_certificate = true; 187| 2| data->m_path_len_constraint = ext->get_path_limit(); 188| 2| } 189| 3| } 190| 4| } 191| | 192| 5.17k| if(auto ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (192:12): [True: 57, False: 5.12k] ------------------ 193| 57| data->m_issuer_alt_name = ext->get_alt_name(); 194| 57| } 195| | 196| 5.17k| if(auto ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (196:12): [True: 86, False: 5.09k] ------------------ 197| 86| data->m_subject_alt_name = ext->get_alt_name(); 198| 86| } 199| | 200| 5.17k| if(auto ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (200:12): [True: 11, False: 5.16k] ------------------ 201| 11| data->m_extended_key_usage = ext->object_identifiers(); 202| 11| } 203| | 204| 5.17k| if(auto ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (204:12): [True: 9, False: 5.16k] ------------------ 205| 9| data->m_cert_policies = ext->get_policy_oids(); 206| 9| } 207| | 208| 5.17k| if(auto ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (208:12): [True: 14, False: 5.16k] ------------------ 209| 14| data->m_ocsp_responder = ext->ocsp_responder(); 210| 14| data->m_ca_issuers = ext->ca_issuers(); 211| 14| } 212| | 213| 5.17k| if(auto ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (213:12): [True: 7, False: 5.17k] ------------------ 214| 7| data->m_crl_distribution_points = ext->crl_distribution_urls(); 215| 7| } 216| | 217| | // Check for self-signed vs self-issued certificates 218| 5.17k| if(data->m_subject_dn == data->m_issuer_dn) { ------------------ | Branch (218:7): [True: 2.85k, False: 2.32k] ------------------ 219| 2.85k| if(data->m_subject_key_id.empty() == false && data->m_authority_key_id.empty() == false) { ------------------ | Branch (219:10): [True: 17, False: 2.83k] | Branch (219:53): [True: 16, False: 1] ------------------ 220| 16| data->m_self_signed = (data->m_subject_key_id == data->m_authority_key_id); 221| 2.83k| } 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| 2.83k| data->m_self_signed = true; 228| | 229| 2.83k| try { 230| 2.83k| auto pub_key = X509::load_key(data->m_subject_public_key_bits_seq); 231| | 232| 2.83k| const auto sig_status = obj.verify_signature(*pub_key); 233| | 234| 2.83k| if(sig_status.first == Certificate_Status_Code::OK || ------------------ | Branch (234:16): [True: 1.52k, False: 1.31k] ------------------ 235| 2.83k| sig_status.first == Certificate_Status_Code::SIGNATURE_ALGO_UNKNOWN) { ------------------ | Branch (235:16): [True: 1, False: 1.31k] ------------------ 236| 1| data->m_self_signed = true; 237| 2.83k| } else { 238| 2.83k| data->m_self_signed = false; 239| 2.83k| } 240| 2.83k| } catch(...) { 241| | // ignore errors here to allow parsing to continue 242| 1.52k| } 243| 2.83k| } 244| 2.85k| } 245| | 246| 5.17k| const std::vector full_encoding = obj.BER_encode(); 247| | 248| 5.17k| auto sha1 = HashFunction::create("SHA-1"); 249| 5.17k| if(sha1) { ------------------ | Branch (249:7): [True: 2.89k, False: 2.28k] ------------------ 250| 2.89k| sha1->update(data->m_subject_public_key_bitstring); 251| 2.89k| 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| 2.89k| data->m_fingerprint_sha1 = create_hex_fingerprint(full_encoding, "SHA-1"); 255| 2.89k| } 256| | 257| 5.17k| auto sha256 = HashFunction::create("SHA-256"); 258| 5.17k| if(sha256) { ------------------ | Branch (258:7): [True: 2.89k, False: 2.28k] ------------------ 259| 2.89k| sha256->update(data->m_issuer_dn_bits); 260| 2.89k| data->m_issuer_dn_bits_sha256 = sha256->final_stdvec(); 261| | 262| 2.89k| sha256->update(data->m_subject_dn_bits); 263| 2.89k| data->m_subject_dn_bits_sha256 = sha256->final_stdvec(); 264| | 265| 2.89k| data->m_fingerprint_sha256 = create_hex_fingerprint(full_encoding, "SHA-256"); 266| 2.89k| } 267| | 268| 5.17k| return data; 269| 5.17k|}