_ZNK5Botan16AlgorithmPattern9to_stringEv: 98| 228| std::string_view to_string() const { return m_text; } _ZNK5Botan16AlgorithmPattern8any_headEv: 103| 228| bool any_head() const { return m_head_count == 0; } _ZNK5Botan16AlgorithmPattern17head_alternativesEv: 105| 228| std::span head_alternatives() const { return std::span(m_heads).first(m_head_count); } _ZNK5Botan16AlgorithmPattern8elementsEv: 107| 456| std::span elements() const { return std::span(m_elements).first(m_element_count); } _ZNK5Botan13AlgorithmSpec4headEv: 171| 228| std::string_view head() const { return m_head; } _ZN5Botan13AlgorithmSpecC2Ev: 212| 456| AlgorithmSpec() = default; _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EED2Ev: 64| 20.0k| ~AlignmentBuffer() { secure_zeroize_buffer(m_buffer.data(), sizeof(T) * m_buffer.size()); } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EEC2Ev: 62| 20.0k| AlignmentBuffer() = default; _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE5clearEv: 71| 97.0k| void clear() { 72| 97.0k| zeroize_buffer(m_buffer.data(), m_buffer.size()); 73| 97.0k| m_position = 0; 74| 97.0k| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EEC2Ev: 62| 462| AlignmentBuffer() = default; _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE5clearEv: 71| 891| void clear() { 72| 891| zeroize_buffer(m_buffer.data(), m_buffer.size()); 73| 891| m_position = 0; 74| 891| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EED2Ev: 64| 462| ~AlignmentBuffer() { secure_zeroize_buffer(m_buffer.data(), sizeof(T) * m_buffer.size()); } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE21handle_unaligned_dataERNS_12BufferSlicerE: 166| 127k| [[nodiscard]] std::optional> handle_unaligned_data(BufferSlicer& slicer) { 167| | // When the final block is to be deferred, we would need to store and 168| | // hold a buffer that contains exactly one block until more data is 169| | // passed or it is explicitly consumed. 170| 127k| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (170:31): [True: 0, False: 127k] ------------------ 171| | 172| 127k| if(in_alignment() && slicer.remaining() >= m_buffer.size() + defer) { ------------------ | Branch (172:13): [True: 126k, False: 747] | Branch (172:31): [True: 49.1k, False: 77.7k] ------------------ 173| | // We are currently in alignment and the passed-in data source 174| | // contains enough data to benefit from aligned processing. 175| | // Therefore, we don't copy anything into the intermittent buffer. 176| 49.1k| return std::nullopt; 177| 49.1k| } 178| | 179| | // Fill the buffer with as much input data as needed to reach alignment 180| | // or until the input source is depleted. 181| 78.5k| const auto elements_to_consume = std::min(m_buffer.size() - m_position, slicer.remaining()); 182| 78.5k| append(slicer.take(elements_to_consume)); 183| | 184| | // If we collected enough data, we push out one full block. When 185| | // deferring the final block is enabled, we additionally check that 186| | // more input data is available to continue processing a consecutive 187| | // block. 188| 78.5k| if(ready_to_consume() && (!defers_final_block() || !slicer.empty())) { ------------------ | Branch (188:13): [True: 747, False: 77.7k] | Branch (188:36): [True: 747, False: 0] | Branch (188:61): [True: 0, False: 0] ------------------ 189| 747| return consume(); 190| 77.7k| } else { 191| 77.7k| return std::nullopt; 192| 77.7k| } 193| 78.5k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE18defers_final_blockEv: 233| 180k| constexpr bool defers_final_block() const { 234| 180k| return FINAL_BLOCK_STRATEGY == AlignmentBufferFinalBlock::must_be_deferred; 235| 180k| } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE6appendENSt3__14spanIKhLm18446744073709551615EEE: 90| 155k| void append(std::span elements) { 91| 155k| BOTAN_ASSERT_NOMSG(elements.size() <= elements_until_alignment()); ------------------ | | 84| 155k| do { \ | | 85| 155k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 155k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 155k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 155k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 155k] | | ------------------ ------------------ 92| 155k| std::copy(elements.begin(), elements.end(), m_buffer.begin() + m_position); 93| 155k| m_position += elements.size(); 94| 155k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE24elements_until_alignmentEv: 221| 387k| size_t elements_until_alignment() const { return m_buffer.size() - m_position; } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE16ready_to_consumeEv: 231| 313k| bool ready_to_consume() const { return m_position == m_buffer.size(); } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE7consumeEv: 200| 79.4k| [[nodiscard]] std::span consume() { 201| 79.4k| BOTAN_ASSERT_NOMSG(ready_to_consume()); ------------------ | | 84| 79.4k| do { \ | | 85| 79.4k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 79.4k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 79.4k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 79.4k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 79.4k] | | ------------------ ------------------ 202| 79.4k| m_position = 0; 203| 79.4k| return m_buffer; 204| 79.4k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE12in_alignmentEv: 226| 306k| bool in_alignment() const { return m_position == 0; } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE23aligned_data_to_processERNS_12BufferSlicerE: 126| 49.5k| [[nodiscard]] std::tuple, size_t> aligned_data_to_process(BufferSlicer& slicer) const { 127| 49.5k| BOTAN_ASSERT_NOMSG(in_alignment()); ------------------ | | 84| 49.5k| do { \ | | 85| 49.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 49.5k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 49.5k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 49.5k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 49.5k] | | ------------------ ------------------ 128| | 129| | // When the final block is to be deferred, the last block must not be 130| | // selected for processing if there is no (unaligned) extra input data. 131| 49.5k| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (131:31): [True: 0, False: 49.5k] ------------------ 132| 49.5k| const size_t full_blocks_to_process = (slicer.remaining() - defer) / m_buffer.size(); 133| 49.5k| return {slicer.take(full_blocks_to_process * m_buffer.size()), full_blocks_to_process}; 134| 49.5k| } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE18fill_up_with_zerosEv: 79| 78.7k| void fill_up_with_zeros() { 80| 78.7k| if(!ready_to_consume()) { ------------------ | Branch (80:13): [True: 78.7k, False: 12] ------------------ 81| 78.7k| zeroize_buffer(&m_buffer[m_position], elements_until_alignment()); 82| 78.7k| m_position = m_buffer.size(); 83| 78.7k| } 84| 78.7k| } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE20directly_modify_lastEm: 113| 76.7k| std::span directly_modify_last(size_t elements) { 114| 76.7k| BOTAN_ASSERT_NOMSG(size() >= elements); ------------------ | | 84| 76.7k| do { \ | | 85| 76.7k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 76.7k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 76.7k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 76.7k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 76.7k] | | ------------------ ------------------ 115| 76.7k| return std::span(m_buffer).last(elements); 116| 76.7k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE4sizeEv: 217| 77.0k| constexpr size_t size() const { return m_buffer.size(); } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE21handle_unaligned_dataERNS_12BufferSlicerE: 166| 1.27k| [[nodiscard]] std::optional> handle_unaligned_data(BufferSlicer& slicer) { 167| | // When the final block is to be deferred, we would need to store and 168| | // hold a buffer that contains exactly one block until more data is 169| | // passed or it is explicitly consumed. 170| 1.27k| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (170:31): [True: 0, False: 1.27k] ------------------ 171| | 172| 1.27k| if(in_alignment() && slicer.remaining() >= m_buffer.size() + defer) { ------------------ | Branch (172:13): [True: 849, False: 430] | Branch (172:31): [True: 0, False: 849] ------------------ 173| | // We are currently in alignment and the passed-in data source 174| | // contains enough data to benefit from aligned processing. 175| | // Therefore, we don't copy anything into the intermittent buffer. 176| 0| return std::nullopt; 177| 0| } 178| | 179| | // Fill the buffer with as much input data as needed to reach alignment 180| | // or until the input source is depleted. 181| 1.27k| const auto elements_to_consume = std::min(m_buffer.size() - m_position, slicer.remaining()); 182| 1.27k| append(slicer.take(elements_to_consume)); 183| | 184| | // If we collected enough data, we push out one full block. When 185| | // deferring the final block is enabled, we additionally check that 186| | // more input data is available to continue processing a consecutive 187| | // block. 188| 1.27k| if(ready_to_consume() && (!defers_final_block() || !slicer.empty())) { ------------------ | Branch (188:13): [True: 420, False: 859] | Branch (188:36): [True: 420, False: 0] | Branch (188:61): [True: 0, False: 0] ------------------ 189| 420| return consume(); 190| 859| } else { 191| 859| return std::nullopt; 192| 859| } 193| 1.27k| } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE18defers_final_blockEv: 233| 2.11k| constexpr bool defers_final_block() const { 234| 2.11k| return FINAL_BLOCK_STRATEGY == AlignmentBufferFinalBlock::must_be_deferred; 235| 2.11k| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE6appendENSt3__14spanIKhLm18446744073709551615EEE: 90| 1.70k| void append(std::span elements) { 91| 1.70k| BOTAN_ASSERT_NOMSG(elements.size() <= elements_until_alignment()); ------------------ | | 84| 1.70k| do { \ | | 85| 1.70k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 1.70k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 1.70k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 1.70k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 1.70k] | | ------------------ ------------------ 92| 1.70k| std::copy(elements.begin(), elements.end(), m_buffer.begin() + m_position); 93| 1.70k| m_position += elements.size(); 94| 1.70k| } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE24elements_until_alignmentEv: 221| 2.99k| size_t elements_until_alignment() const { return m_buffer.size() - m_position; } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE16ready_to_consumeEv: 231| 2.98k| bool ready_to_consume() const { return m_position == m_buffer.size(); } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE7consumeEv: 200| 849| [[nodiscard]] std::span consume() { 201| 849| BOTAN_ASSERT_NOMSG(ready_to_consume()); ------------------ | | 84| 849| do { \ | | 85| 849| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 849| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 849] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 849| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 849] | | ------------------ ------------------ 202| 849| m_position = 0; 203| 849| return m_buffer; 204| 849| } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE12in_alignmentEv: 226| 2.97k| bool in_alignment() const { return m_position == 0; } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE23aligned_data_to_processERNS_12BufferSlicerE: 126| 420| [[nodiscard]] std::tuple, size_t> aligned_data_to_process(BufferSlicer& slicer) const { 127| 420| BOTAN_ASSERT_NOMSG(in_alignment()); ------------------ | | 84| 420| do { \ | | 85| 420| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 420| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 420] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 420| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 420] | | ------------------ ------------------ 128| | 129| | // When the final block is to be deferred, the last block must not be 130| | // selected for processing if there is no (unaligned) extra input data. 131| 420| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (131:31): [True: 0, False: 420] ------------------ 132| 420| const size_t full_blocks_to_process = (slicer.remaining() - defer) / m_buffer.size(); 133| 420| return {slicer.take(full_blocks_to_process * m_buffer.size()), full_blocks_to_process}; 134| 420| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE18fill_up_with_zerosEv: 79| 429| void fill_up_with_zeros() { 80| 429| if(!ready_to_consume()) { ------------------ | Branch (80:13): [True: 429, False: 0] ------------------ 81| 429| zeroize_buffer(&m_buffer[m_position], elements_until_alignment()); 82| 429| m_position = m_buffer.size(); 83| 429| } 84| 429| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE20directly_modify_lastEm: 113| 429| std::span directly_modify_last(size_t elements) { 114| 429| BOTAN_ASSERT_NOMSG(size() >= elements); ------------------ | | 84| 429| do { \ | | 85| 429| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 429| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 429] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 429| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 429] | | ------------------ ------------------ 115| 429| return std::span(m_buffer).last(elements); 116| 429| } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE4sizeEv: 217| 429| constexpr size_t size() const { return m_buffer.size(); } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE29next_aligned_block_to_processERNS_12BufferSlicerE: 143| 2.12k| [[nodiscard]] std::optional> next_aligned_block_to_process(BufferSlicer& slicer) const { 144| 2.12k| BOTAN_ASSERT_NOMSG(in_alignment()); ------------------ | | 84| 2.12k| do { \ | | 85| 2.12k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 2.12k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 2.12k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 2.12k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 2.12k] | | ------------------ ------------------ 145| | 146| | // When the final block is to be deferred, the last block must not be 147| | // selected for processing if there is no (unaligned) extra input data. 148| 2.12k| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (148:31): [True: 0, False: 2.12k] ------------------ 149| 2.12k| if(slicer.remaining() < m_buffer.size() + defer) { ------------------ | Branch (149:13): [True: 266, False: 1.86k] ------------------ 150| 266| return std::nullopt; 151| 266| } 152| | 153| 1.86k| return slicer.take(m_buffer.size()); 154| 2.12k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE18elements_in_bufferEv: 219| 266| size_t elements_in_buffer() const { return m_position; } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE21directly_modify_firstEm: 102| 266| std::span directly_modify_first(size_t elements) { 103| 266| BOTAN_ASSERT_NOMSG(size() >= elements); ------------------ | | 84| 266| do { \ | | 85| 266| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 266| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 266] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 266| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 266] | | ------------------ ------------------ 104| 266| return std::span(m_buffer).first(elements); 105| 266| } _ZNK5Botan17Barrett_Reduction4cubeERKNS_6BigIntE: 66| 622| BigInt cube(const BigInt& x) const { return this->multiply(x, this->square(x)); } _ZNK5Botan17Barrett_Reduction12modulus_bitsEv: 71| 4| size_t modulus_bits() const { return m_modulus_bits; } _ZN5Botan8high_bitITkNSt3__117unsigned_integralEjEEmT_: 73| 26.5k|BOTAN_FORCE_INLINE constexpr size_t high_bit(T n) { 74| 26.5k| size_t hb = 0; 75| | 76| 159k| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (76:38): [True: 132k, False: 26.5k] ------------------ 77| | // Equivalent to: ((n >> s) == 0) ? 0 : s; 78| 132k| const size_t z = s - ct_if_is_zero_ret(n >> s, s); 79| 132k| hb += z; 80| 132k| n >>= z; 81| 132k| } 82| | 83| 26.5k| hb += static_cast(n); 84| | 85| 26.5k| return hb; 86| 26.5k|} _ZN5Botan17ct_if_is_zero_retITkNSt3__117unsigned_integralEjEEmT_m: 45| 132k|BOTAN_FORCE_INLINE constexpr size_t ct_if_is_zero_ret(T x, size_t s) { 46| | /* 47| | Similar to `return ct_is_zero(x) & s` but has to account for possibility that 48| | sizeof(T) is smaller than sizeof(size_t) which would lead to incomplete masking 49| | */ 50| 132k| const T a = ~x & (x - 1); 51| 132k| const size_t a_top = static_cast(CT::value_barrier(a >> (sizeof(T) * 8 - 1))); 52| 132k| const size_t mask = static_cast(0) - a_top; 53| 132k| return mask & s; 54| 132k|} _ZN5Botan17significant_bytesITkNSt3__117unsigned_integralEmEEmT_: 94| 30.3k|BOTAN_FORCE_INLINE constexpr size_t significant_bytes(T n) { 95| 30.3k| size_t b = 0; 96| | 97| 121k| for(size_t s = 8 * sizeof(T) / 2; s >= 8; s /= 2) { ------------------ | Branch (97:38): [True: 90.9k, False: 30.3k] ------------------ 98| | // Equivalent to: ((n >> s) == 0) ? 0 : s; 99| 90.9k| const size_t z = s - ct_if_is_zero_ret(n >> s, s); 100| 90.9k| b += z / 8; 101| 90.9k| n >>= z; 102| 90.9k| } 103| | 104| 30.3k| b += (n != 0); 105| | 106| 30.3k| return b; 107| 30.3k|} _ZN5Botan17ct_if_is_zero_retITkNSt3__117unsigned_integralEmEEmT_m: 45| 1.04M|BOTAN_FORCE_INLINE constexpr size_t ct_if_is_zero_ret(T x, size_t s) { 46| | /* 47| | Similar to `return ct_is_zero(x) & s` but has to account for possibility that 48| | sizeof(T) is smaller than sizeof(size_t) which would lead to incomplete masking 49| | */ 50| 1.04M| const T a = ~x & (x - 1); 51| 1.04M| const size_t a_top = static_cast(CT::value_barrier(a >> (sizeof(T) * 8 - 1))); 52| 1.04M| const size_t mask = static_cast(0) - a_top; 53| 1.04M| return mask & s; 54| 1.04M|} _ZN5Botan3ctzITkNSt3__117unsigned_integralEmEEmT_: 115| 69.5k|BOTAN_FORCE_INLINE constexpr size_t ctz(T n) { 116| | /* 117| | * If n == 0 then this function will compute 8*sizeof(T)-1, so 118| | * initialize lb to 1 if n == 0 to produce the expected result. 119| | */ 120| 69.5k| size_t lb = ct_if_is_zero_ret(n, 1); 121| | 122| 486k| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (122:38): [True: 417k, False: 69.5k] ------------------ 123| 417k| const T range = (static_cast(1) << s) - 1; 124| | // Equivalent to: ((n & range) == 0) ? s : 0; 125| 417k| const size_t z = ct_if_is_zero_ret(n & range, s); 126| 417k| lb += z; 127| 417k| n >>= z; 128| 417k| } 129| | 130| 69.5k| return lb; 131| 69.5k|} _ZN5Botan13is_power_of_2ITkNSt3__117unsigned_integralEmEEbT_: 62| 12.8k|BOTAN_FORCE_INLINE constexpr bool is_power_of_2(T arg) { 63| 12.8k| return (arg != 0) && (arg != 1) && ((arg & static_cast(arg - 1)) == 0); ------------------ | Branch (63:11): [True: 12.8k, False: 0] | Branch (63:25): [True: 12.8k, False: 0] | Branch (63:39): [True: 8.11k, False: 4.74k] ------------------ 64| 12.8k|} _ZN5Botan6chooseITkNSt3__117unsigned_integralEmEET_S2_S2_S2_: 217| 112M|BOTAN_FORCE_INLINE constexpr T choose(T mask, T a, T b) { 218| | //return (mask & a) | (~mask & b); 219| 112M| return (b ^ (mask & (a ^ b))); 220| 112M|} _ZN5Botan8majorityITkNSt3__117unsigned_integralEmEET_S2_S2_S2_: 223| 130k|BOTAN_FORCE_INLINE constexpr T majority(T a, T b, T c) { 224| | /* 225| | Considering each bit of a, b, c individually 226| | 227| | If a xor b is set, then c is the deciding vote. 228| | 229| | If a xor b is not set then either a and b are both set or both unset. 230| | In either case the value of c doesn't matter, and examining b (or a) 231| | allows us to determine which case we are in. 232| | */ 233| 130k| return choose(a ^ b, c, b); 234| 130k|} _ZN5Botan17ct_expand_top_bitITkNSt3__117unsigned_integralEmEET_S2_: 28| 33.5M|BOTAN_FORCE_INLINE constexpr T ct_expand_top_bit(T a) { 29| 33.5M| const T top = CT::value_barrier(a >> (sizeof(T) * 8 - 1)); 30| 33.5M| return static_cast(0) - top; 31| 33.5M|} _ZN5Botan10ct_is_zeroITkNSt3__117unsigned_integralEmEET_S2_: 37| 31.3M|BOTAN_FORCE_INLINE constexpr T ct_is_zero(T x) { 38| 31.3M| return ct_expand_top_bit(~x & (x - 1)); 39| 31.3M|} _ZN5Botan12ceil_tobytesITkNSt3__117unsigned_integralEmEET_S2_: 176| 30.6k|BOTAN_FORCE_INLINE constexpr T ceil_tobytes(T bits) { 177| 30.6k| return (bits + 7) / 8; 178| 30.6k|} _ZN5Botan8high_bitITkNSt3__117unsigned_integralEmEEmT_: 73| 78.2k|BOTAN_FORCE_INLINE constexpr size_t high_bit(T n) { 74| 78.2k| size_t hb = 0; 75| | 76| 547k| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (76:38): [True: 469k, False: 78.2k] ------------------ 77| | // Equivalent to: ((n >> s) == 0) ? 0 : s; 78| 469k| const size_t z = s - ct_if_is_zero_ret(n >> s, s); 79| 469k| hb += z; 80| 469k| n >>= z; 81| 469k| } 82| | 83| 78.2k| hb += static_cast(n); 84| | 85| 78.2k| return hb; 86| 78.2k|} _ZN5Botan13ceil_divisionITkNSt3__117unsigned_integralEmEET_S2_S2_: 167| 33.3k|BOTAN_FORCE_INLINE constexpr T ceil_division(T a, T b) { 168| | // Same as `(a + b - 1) / b` but avoids possible overflow 169| 33.3k| return a / b + ((a % b != 0) ? 1 : 0); ------------------ | Branch (169:20): [True: 32.6k, False: 735] ------------------ 170| 33.3k|} _ZN5Botan9ceil_log2ITkNSt3__117unsigned_integralEmEEhT_QltstS2_Li32E: 142| 18|{ 143| 18| if(x >> (sizeof(T) * 8 - 1)) { ------------------ | Branch (143:7): [True: 0, False: 18] ------------------ 144| 0| return sizeof(T) * 8; 145| 0| } 146| | 147| 18| uint8_t result = 0; 148| 18| T compare = 1; 149| | 150| 212| while(compare < x) { ------------------ | Branch (150:10): [True: 194, False: 18] ------------------ 151| 194| compare <<= 1; 152| 194| result++; 153| 194| } 154| | 155| 18| return result; 156| 18|} _ZN5Botan10ct_is_zeroITkNSt3__117unsigned_integralEhEET_S2_: 37| 11.3k|BOTAN_FORCE_INLINE constexpr T ct_is_zero(T x) { 38| 11.3k| return ct_expand_top_bit(~x & (x - 1)); 39| 11.3k|} _ZN5Botan17ct_expand_top_bitITkNSt3__117unsigned_integralEhEET_S2_: 28| 11.3k|BOTAN_FORCE_INLINE constexpr T ct_expand_top_bit(T a) { 29| 11.3k| const T top = CT::value_barrier(a >> (sizeof(T) * 8 - 1)); 30| 11.3k| return static_cast(0) - top; 31| 11.3k|} _ZN5Botan6chooseITkNSt3__117unsigned_integralEhEET_S2_S2_S2_: 217| 11.0k|BOTAN_FORCE_INLINE constexpr T choose(T mask, T a, T b) { 218| | //return (mask & a) | (~mask & b); 219| 11.0k| return (b ^ (mask & (a ^ b))); 220| 11.0k|} _ZN5Botan9ceil_log2ITkNSt3__117unsigned_integralEjEEhT_QltstS2_Li32E: 142| 24|{ 143| 24| if(x >> (sizeof(T) * 8 - 1)) { ------------------ | Branch (143:7): [True: 0, False: 24] ------------------ 144| 0| return sizeof(T) * 8; 145| 0| } 146| | 147| 24| uint8_t result = 0; 148| 24| T compare = 1; 149| | 150| 188| while(compare < x) { ------------------ | Branch (150:10): [True: 164, False: 24] ------------------ 151| 164| compare <<= 1; 152| 164| result++; 153| 164| } 154| | 155| 24| return result; 156| 24|} _ZN5Botan12ceil_tobytesITkNSt3__117unsigned_integralEjEET_S2_: 176| 48|BOTAN_FORCE_INLINE constexpr T ceil_tobytes(T bits) { 177| 48| return (bits + 7) / 8; 178| 48|} _ZN5Botan8high_bitITkNSt3__117unsigned_integralEhEEmT_: 73| 4|BOTAN_FORCE_INLINE constexpr size_t high_bit(T n) { 74| 4| size_t hb = 0; 75| | 76| 16| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (76:38): [True: 12, False: 4] ------------------ 77| | // Equivalent to: ((n >> s) == 0) ? 0 : s; 78| 12| const size_t z = s - ct_if_is_zero_ret(n >> s, s); 79| 12| hb += z; 80| 12| n >>= z; 81| 12| } 82| | 83| 4| hb += static_cast(n); 84| | 85| 4| return hb; 86| 4|} _ZN5Botan17ct_if_is_zero_retITkNSt3__117unsigned_integralEhEEmT_m: 45| 12|BOTAN_FORCE_INLINE constexpr size_t ct_if_is_zero_ret(T x, size_t s) { 46| | /* 47| | Similar to `return ct_is_zero(x) & s` but has to account for possibility that 48| | sizeof(T) is smaller than sizeof(size_t) which would lead to incomplete masking 49| | */ 50| 12| const T a = ~x & (x - 1); 51| 12| const size_t a_top = static_cast(CT::value_barrier(a >> (sizeof(T) * 8 - 1))); 52| 12| const size_t mask = static_cast(0) - a_top; 53| 12| return mask & s; 54| 12|} _ZN5Botan13reverse_bytesITkNSt3__117unsigned_integralEtQooooooeqstT_Li1EeqstS2_Li2EeqstS2_Li4EeqstS2_Li8EEES2_S2_: 25| 7.14k|inline constexpr T reverse_bytes(T x) { 26| | if constexpr(sizeof(T) == 1) { 27| | return x; 28| 7.14k| } else if constexpr(sizeof(T) == 2) { 29| 7.14k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap16) 30| 7.14k| return static_cast(__builtin_bswap16(x)); 31| |#else 32| | return static_cast((x << 8) | (x >> 8)); 33| |#endif 34| | } else if constexpr(sizeof(T) == 4) { 35| |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap32) 36| | return static_cast(__builtin_bswap32(x)); 37| |#else 38| | // MSVC at least recognizes this as a bswap 39| | return static_cast(((x & 0x000000FF) << 24) | ((x & 0x0000FF00) << 8) | ((x & 0x00FF0000) >> 8) | 40| | ((x & 0xFF000000) >> 24)); 41| |#endif 42| | } else if constexpr(sizeof(T) == 8) { 43| |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap64) 44| | return static_cast(__builtin_bswap64(x)); 45| |#else 46| | uint32_t hi = static_cast(x >> 32); 47| | uint32_t lo = static_cast(x); 48| | 49| | hi = reverse_bytes(hi); 50| | lo = reverse_bytes(lo); 51| | 52| | return (static_cast(lo) << 32) | hi; 53| |#endif 54| | } 55| 7.14k|} _ZN5Botan13reverse_bytesITkNSt3__117unsigned_integralEjQooooooeqstT_Li1EeqstS2_Li2EeqstS2_Li4EeqstS2_Li8EEES2_S2_: 25| 499k|inline constexpr T reverse_bytes(T x) { 26| | if constexpr(sizeof(T) == 1) { 27| | return x; 28| | } else if constexpr(sizeof(T) == 2) { 29| |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap16) 30| | return static_cast(__builtin_bswap16(x)); 31| |#else 32| | return static_cast((x << 8) | (x >> 8)); 33| |#endif 34| 499k| } else if constexpr(sizeof(T) == 4) { 35| 499k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap32) 36| 499k| return static_cast(__builtin_bswap32(x)); 37| |#else 38| | // MSVC at least recognizes this as a bswap 39| | return static_cast(((x & 0x000000FF) << 24) | ((x & 0x0000FF00) << 8) | ((x & 0x00FF0000) >> 8) | 40| | ((x & 0xFF000000) >> 24)); 41| |#endif 42| | } else if constexpr(sizeof(T) == 8) { 43| |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap64) 44| | return static_cast(__builtin_bswap64(x)); 45| |#else 46| | uint32_t hi = static_cast(x >> 32); 47| | uint32_t lo = static_cast(x); 48| | 49| | hi = reverse_bytes(hi); 50| | lo = reverse_bytes(lo); 51| | 52| | return (static_cast(lo) << 32) | hi; 53| |#endif 54| | } 55| 499k|} _ZN5Botan13reverse_bytesITkNSt3__117unsigned_integralEmQooooooeqstT_Li1EeqstS2_Li2EeqstS2_Li4EeqstS2_Li8EEES2_S2_: 25| 254k|inline constexpr T reverse_bytes(T x) { 26| | if constexpr(sizeof(T) == 1) { 27| | return x; 28| | } else if constexpr(sizeof(T) == 2) { 29| |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap16) 30| | return static_cast(__builtin_bswap16(x)); 31| |#else 32| | return static_cast((x << 8) | (x >> 8)); 33| |#endif 34| | } else if constexpr(sizeof(T) == 4) { 35| |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap32) 36| | return static_cast(__builtin_bswap32(x)); 37| |#else 38| | // MSVC at least recognizes this as a bswap 39| | return static_cast(((x & 0x000000FF) << 24) | ((x & 0x0000FF00) << 8) | ((x & 0x00FF0000) >> 8) | 40| | ((x & 0xFF000000) >> 24)); 41| |#endif 42| 254k| } else if constexpr(sizeof(T) == 8) { 43| 254k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap64) 44| 254k| return static_cast(__builtin_bswap64(x)); 45| |#else 46| | uint32_t hi = static_cast(x >> 32); 47| | uint32_t lo = static_cast(x); 48| | 49| | hi = reverse_bytes(hi); 50| | lo = reverse_bytes(lo); 51| | 52| | return (static_cast(lo) << 32) | hi; 53| |#endif 54| 254k| } 55| 254k|} _ZN5Botan12BufferSlicerC2ENSt3__14spanIKhLm18446744073709551615EEE: 25| 196k| explicit BufferSlicer(std::span buffer) : m_remaining(buffer) {} _ZNK5Botan12BufferSlicer5emptyEv: 75| 1.82M| bool empty() const { return m_remaining.empty(); } _ZN5Botan12BufferSlicer9take_byteEv: 57| 808k| uint8_t take_byte() { return take(1)[0]; } _ZN5Botan12BufferSlicer4takeEm: 37| 940k| std::span take(const size_t count) { 38| 940k| BOTAN_STATE_CHECK(remaining() >= count); ------------------ | | 51| 940k| do { \ | | 52| 940k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 940k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 940k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 940k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 940k] | | ------------------ ------------------ 39| 940k| const auto result = m_remaining.first(count); 40| 940k| m_remaining = m_remaining.subspan(count); 41| 940k| return result; 42| 940k| } _ZNK5Botan12BufferSlicer9remainingEv: 73| 1.20M| size_t remaining() const { return m_remaining.size(); } _ZN5Botan13BufferStufferC2ENSt3__14spanIhLm18446744073709551615EEE: 26| 1.13k| constexpr explicit BufferStuffer(std::span buffer) : m_buffer(buffer) {} _ZN5Botan13BufferStuffer4nextEm: 32| 1.95k| constexpr std::span next(size_t bytes) { 33| 1.95k| BOTAN_STATE_CHECK(m_buffer.size() >= bytes); ------------------ | | 51| 1.95k| do { \ | | 52| 1.95k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 1.95k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 1.95k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 1.95k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 1.95k] | | ------------------ ------------------ 34| | 35| 1.95k| const auto result = m_buffer.first(bytes); 36| 1.95k| m_buffer = m_buffer.subspan(bytes); 37| 1.95k| return result; 38| 1.95k| } _ZN5Botan13BufferStuffer6appendENSt3__14spanIKhLm18446744073709551615EEE: 59| 143| constexpr void append(std::span buffer) { 60| 143| const size_t len = buffer.size(); 61| 143| const auto sink = next(len); 62| 3.83k| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (62:28): [True: 3.69k, False: 143] ------------------ 63| 3.69k| sink[i] = buffer[i]; 64| 3.69k| } 65| 143| } _ZN5Botan13BufferStuffer6appendEhm: 67| 1.27k| constexpr void append(uint8_t val, size_t repeat = 1) { 68| 6.76k| for(auto& b : next(repeat)) { ------------------ | Branch (68:22): [True: 6.76k, False: 1.27k] ------------------ 69| 6.76k| b = val; 70| 6.76k| } 71| 1.27k| } _ZNK5Botan13BufferStuffer4fullEv: 73| 71| constexpr bool full() const { return m_buffer.empty(); } _ZNK5Botan13BufferStuffer18remaining_capacityEv: 75| 71| constexpr size_t remaining_capacity() const { return m_buffer.size(); } _ZN5Botan13BufferStuffer4nextILm48EEENSt3__14spanIhXT_EEEv: 41| 752| constexpr std::span next() { 42| 752| BOTAN_STATE_CHECK(m_buffer.size() >= bytes); ------------------ | | 51| 752| do { \ | | 52| 752| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 752| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 752] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 752| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 752] | | ------------------ ------------------ 43| | 44| 752| const auto result = m_buffer.first(); 45| 752| m_buffer = m_buffer.subspan(bytes); 46| 752| return result; 47| 752| } _ZN5Botan13BufferStuffer4nextILm28EEENSt3__14spanIhXT_EEEv: 41| 270| constexpr std::span next() { 42| 270| BOTAN_STATE_CHECK(m_buffer.size() >= bytes); ------------------ | | 51| 270| do { \ | | 52| 270| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 270| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 270] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 270| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 270] | | ------------------ ------------------ 43| | 44| 270| const auto result = m_buffer.first(); 45| 270| m_buffer = m_buffer.subspan(bytes); 46| 270| return result; 47| 270| } _ZN5Botan13BufferStuffer4nextILm66EEENSt3__14spanIhXT_EEEv: 41| 572| constexpr std::span next() { 42| 572| BOTAN_STATE_CHECK(m_buffer.size() >= bytes); ------------------ | | 51| 572| do { \ | | 52| 572| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 572| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 572] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 572| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 572] | | ------------------ ------------------ 43| | 44| 572| const auto result = m_buffer.first(); 45| 572| m_buffer = m_buffer.subspan(bytes); 46| 572| return result; 47| 572| } _ZNK5Botan14calendar_point4yearEv: 23| 7.20k| uint32_t year() const { return m_year; } _ZNK5Botan14calendar_point5monthEv: 26| 3.60k| uint32_t month() const { return m_month; } _ZNK5Botan14calendar_point3dayEv: 29| 3.60k| uint32_t day() const { return m_day; } _ZNK5Botan14calendar_point4hourEv: 32| 3.60k| uint32_t hour() const { return m_hour; } _ZNK5Botan14calendar_point7minutesEv: 35| 3.60k| uint32_t minutes() const { return m_minutes; } _ZNK5Botan14calendar_point7secondsEv: 38| 3.60k| uint32_t seconds() const { return m_seconds; } _ZN5Botan13nibble_to_hexEh: 76| 82|inline constexpr char nibble_to_hex(uint8_t b) { 77| 82| const uint8_t n = b & 0x0F; 78| 82| return static_cast(n < 10 ? '0' + n : 'A' + (n - 10)); ------------------ | Branch (78:29): [True: 53, False: 29] ------------------ 79| 82|} _ZNK5Botan22CharacterValidityTableclEc: 125| 191k| constexpr bool operator()(char c) const { 126| 191k| const uint8_t uc = static_cast(c); 127| 191k| return ((m_tbl[uc / 32] >> (uc % 32)) & 1) != 0; 128| 191k| } base64.cpp:_ZN5Botan11base_decodeINS_12_GLOBAL__N_16Base64EEEmRKT_PhPKcmRmbb: 124| 1.07k| bool ignore_ws = true) { 125| | // TODO(Botan4) Check if we can use just base. or Base:: here instead 126| 1.07k| constexpr size_t decoding_bytes_in = std::remove_reference_t::decoding_bytes_in(); 127| 1.07k| constexpr size_t decoding_bytes_out = std::remove_reference_t::decoding_bytes_out(); 128| | 129| 1.07k| input_consumed = 0; 130| | 131| 1.07k| uint8_t* out_ptr = output; 132| 1.07k| std::array decode_buf{}; 133| 1.07k| size_t decode_buf_pos = 0; 134| 1.07k| size_t final_truncate = 0; 135| 1.07k| bool seen_padding = false; 136| | 137| 1.07k| clear_mem(output, base.decode_max_output(input_length)); 138| | 139| 750k| for(size_t i = 0; i != input_length; ++i) { ------------------ | Branch (139:22): [True: 749k, False: 1.06k] ------------------ 140| 749k| const uint8_t bin = base.lookup_binary_value(input[i]); 141| | 142| | // This call might throw Invalid_Argument 143| 749k| if(base.check_bad_char(bin, input[i], ignore_ws)) { ------------------ | Branch (143:10): [True: 714k, False: 35.4k] ------------------ 144| | // Padding may only appear at the end, so a data symbol must never 145| | // follow one (0x81 marks a padding character) 146| 714k| if(seen_padding) { ------------------ | Branch (146:13): [True: 1, False: 714k] ------------------ 147| 1| throw Invalid_Argument(base.name() + " decoding failed, data follows padding"); 148| 1| } 149| 714k| decode_buf[decode_buf_pos] = bin; 150| 714k| ++decode_buf_pos; 151| 714k| } else if(bin == 0x81) { ------------------ | Branch (151:17): [True: 727, False: 34.6k] ------------------ 152| 727| seen_padding = true; 153| 727| } 154| | 155| | /* 156| | * If we're at the end of the input, pad with 0s and truncate 157| | */ 158| 749k| if(final_inputs && (i == input_length - 1)) { ------------------ | Branch (158:10): [True: 749k, False: 54] | Branch (158:26): [True: 987, False: 748k] ------------------ 159| 987| if(decode_buf_pos) { ------------------ | Branch (159:13): [True: 934, False: 53] ------------------ 160| 934| const size_t bits_per_symbol = base.bits_consumed(); 161| 934| const size_t pad_bits = (decode_buf_pos * bits_per_symbol) % 8; 162| | 163| | // A trailing symbol contributing only pad bits cannot occur in a 164| | // valid encoding; RFC 4648 4 and 6 enumerate the reachable cases 165| 934| if(pad_bits >= bits_per_symbol) { ------------------ | Branch (165:16): [True: 6, False: 928] ------------------ 166| 6| throw Invalid_Argument(base.name() + " decoding failed, invalid length"); 167| 6| } 168| | 169| | // RFC 4648 3.5: "decoders MAY chose to reject an encoding if the 170| | // pad bits have not been set to zero" 171| 928| const uint8_t pad_mask = static_cast((1U << pad_bits) - 1); 172| 928| if(decode_buf[decode_buf_pos - 1] & pad_mask) { ------------------ | Branch (172:16): [True: 2, False: 926] ------------------ 173| 2| throw Invalid_Argument(base.name() + " decoding failed, nonzero padding bits"); 174| 2| } 175| | 176| 2.35k| for(size_t j = decode_buf_pos; j < decoding_bytes_in; ++j) { ------------------ | Branch (176:44): [True: 1.42k, False: 926] ------------------ 177| 1.42k| decode_buf[j] = 0; 178| 1.42k| } 179| | 180| 926| final_truncate = decoding_bytes_in - decode_buf_pos; 181| 926| decode_buf_pos = decoding_bytes_in; 182| 926| } 183| 987| } 184| | 185| 749k| if(decode_buf_pos == decoding_bytes_in) { ------------------ | Branch (185:10): [True: 178k, False: 570k] ------------------ 186| 178k| base.decode(out_ptr, decode_buf.data()); 187| | 188| 178k| out_ptr += decoding_bytes_out; 189| 178k| decode_buf_pos = 0; 190| 178k| input_consumed = i + 1; 191| 178k| } 192| 749k| } 193| | 194| 9.83k| while(input_consumed < input_length && base.lookup_binary_value(input[input_consumed]) == 0x80) { ------------------ | Branch (194:10): [True: 8.78k, False: 1.04k] | Branch (194:43): [True: 8.76k, False: 20] ------------------ 195| 8.76k| ++input_consumed; 196| 8.76k| } 197| | 198| 1.06k| const size_t written = (out_ptr - output) - base.bytes_to_remove(final_truncate); 199| | 200| 1.06k| return written; 201| 1.07k|} base64.cpp:_ZN5Botan16base_decode_fullINS_12_GLOBAL__N_16Base64EEEmRKT_PhPKcmb: 204| 1.07k|size_t base_decode_full(const Base& base, uint8_t output[], const char input[], size_t input_length, bool ignore_ws) { 205| 1.07k| size_t consumed = 0; 206| 1.07k| const size_t written = base_decode(base, output, input, input_length, consumed, true, ignore_ws); 207| | 208| 1.07k| if(consumed != input_length) { ------------------ | Branch (208:7): [True: 20, False: 1.05k] ------------------ 209| 20| throw Invalid_Argument(base.name() + " decoding failed, input did not have full bytes"); 210| 20| } 211| | 212| 1.05k| return written; 213| 1.07k|} _ZN5Botan5CPUID3hasENS_10CPUFeatureE: 93| 129k| static bool has(CPUID::Feature feat) { return state().has_bit(feat.as_u32()); } _ZN5Botan5CPUID5stateEv: 155| 15.3M| static CPUID_Data& state() { 156| 15.3M| static CPUID::CPUID_Data g_cpuid; 157| 15.3M| return g_cpuid; 158| 15.3M| } _ZNK5Botan5CPUID10CPUID_Data7has_bitEj: 143| 15.3M| bool has_bit(uint32_t bit) const { return (m_processor_features & bit) == bit; } _ZN5Botan5CPUID3hasENS_10CPUFeatureES1_: 98| 15.1M| static bool has(CPUID::Feature feat1, CPUID::Feature feat2) { 99| 15.1M| return state().has_bit(feat1.as_u32() | feat2.as_u32()); 100| 15.1M| } _ZN5Botan5CPUID6is_setEjNS_10CPUFeatureE: 126| 5| static inline bool is_set(uint32_t allowed, CPUID::Feature bit) { 127| 5| const uint32_t feat_bit = bit.as_u32(); 128| 5| return ((allowed & feat_bit) == feat_bit); 129| 5| } cpuid_x86.cpp:_ZN5Botan5CPUID6if_setIZNS0_10CPUID_Data19detect_cpu_featuresEjE16x86_CPUID_1_bitsEEjmT_NS_10CPUFeatureEj: 116| 7| static inline uint32_t if_set(uint64_t cpuid, T flag, CPUID::Feature bit, uint32_t allowed) { 117| 7| const uint64_t flag64 = static_cast(flag); 118| 7| if((cpuid & flag64) == flag64) { ------------------ | Branch (118:13): [True: 7, False: 0] ------------------ 119| 7| return (bit.as_u32() & allowed); 120| 7| } else { 121| 0| return 0; 122| 0| } 123| 7| } cpuid_x86.cpp:_ZN5Botan5CPUID6if_setIZNS0_10CPUID_Data19detect_cpu_featuresEjE16x86_CPUID_7_bitsEEjmT_NS_10CPUFeatureEj: 116| 8| static inline uint32_t if_set(uint64_t cpuid, T flag, CPUID::Feature bit, uint32_t allowed) { 117| 8| const uint64_t flag64 = static_cast(flag); 118| 8| if((cpuid & flag64) == flag64) { ------------------ | Branch (118:13): [True: 5, False: 3] ------------------ 119| 5| return (bit.as_u32() & allowed); 120| 5| } else { 121| 3| return 0; 122| 3| } 123| 8| } cpuid_x86.cpp:_ZN5Botan5CPUID6if_setIZNS0_10CPUID_Data19detect_cpu_featuresEjE18x86_CPUID_7_1_bitsEEjmT_NS_10CPUFeatureEj: 116| 3| static inline uint32_t if_set(uint64_t cpuid, T flag, CPUID::Feature bit, uint32_t allowed) { 117| 3| const uint64_t flag64 = static_cast(flag); 118| 3| if((cpuid & flag64) == flag64) { ------------------ | Branch (118:13): [True: 0, False: 3] ------------------ 119| 0| return (bit.as_u32() & allowed); 120| 3| } else { 121| 3| return 0; 122| 3| } 123| 3| } _ZNK5Botan10CPUFeature6as_u32Ev: 56| 30.5M| uint32_t as_u32() const { return static_cast(m_bit); } _ZN5Botan10CPUFeatureC2ENS0_3BitE: 54| 30.5M| CPUFeature(Bit b) : m_bit(b) {} // NOLINT(*-explicit-conversions,*-explicit-constructor) _ZN5Botan2CT4MaskImE5is_ltEmm: 450| 1.40M| static constexpr Mask is_lt(T x, T y) { 451| 1.40M| T u = x ^ ((x ^ y) | ((x - y) ^ x)); 452| 1.40M| return Mask::expand_top_bit(u); 453| 1.40M| } _ZN5Botan2CT4MaskImE14expand_top_bitEm: 415| 2.23M| static constexpr Mask expand_top_bit(T v) { return Mask(ct_expand_top_bit(v)); } _ZN5Botan2CT4MaskImEC2Em: 637| 55.6M| constexpr explicit Mask(T m) : m_mask(m) {} _ZNK5Botan2CT4MaskImE7as_boolEv: 614| 28.8k| constexpr bool as_bool() const { return unpoisoned_value() != 0; } _ZNK5Botan2CT4MaskImE16unpoisoned_valueEv: 598| 2.21M| constexpr T unpoisoned_value() const { 599| 2.21M| T r = value(); 600| 2.21M| CT::unpoison(r); 601| 2.21M| return r; 602| 2.21M| } _ZNK5Botan2CT4MaskImE11select_maskES2_S2_: 559| 193k| Mask select_mask(Mask x, Mask y) const { return Mask(select(x.value(), y.value())); } _ZN5Botan2CT4MaskImEoRES2_: 510| 70.5k| Mask& operator|=(Mask o) { 511| 70.5k| m_mask |= o.value(); 512| 70.5k| return (*this); 513| 70.5k| } _ZN5Botan2CT4MaskImEaNES2_: 494| 10.7k| Mask& operator&=(Mask o) { 495| 10.7k| m_mask &= o.value(); 496| 10.7k| return (*this); 497| 10.7k| } _ZN5Botan2CT8unpoisonITkNSt3__18integralEmEEvRKT_: 112| 2.42M|constexpr void unpoison(const T& p) { 113| 2.42M| unpoison(&p, 1); 114| 2.42M|} _ZN5Botan2CT4MaskImE7is_zeroEm: 437| 30.2M| static constexpr Mask is_zero(T x) { return Mask(ct_is_zero(value_barrier(x))); } _ZNK5Botan2CT4MaskImE8select_nEPmPKmS5_m: 565| 18.3M| constexpr void select_n(T output[], const T x[], const T y[], size_t len) const { 566| 18.3M| const T mask = value(); 567| 109M| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (567:28): [True: 91.4M, False: 18.3M] ------------------ 568| 91.4M| output[i] = choose(mask, x[i], y[i]); 569| 91.4M| } 570| 18.3M| } _ZN5Botan2CT4MaskImE6expandEm: 392| 21.0M| static constexpr Mask expand(T v) { return ~Mask::is_zero(value_barrier(v)); } _ZNK5Botan2CT4MaskImEcoEv: 533| 21.8M| constexpr Mask operator~() const { return Mask(~value()); } _ZNK5Botan2CT4MaskImE5valueEv: 630| 81.1M| constexpr T value() const { return value_barrier(m_mask); } _ZNK5Botan2CT4MaskImE13if_set_returnEm: 538| 2.85M| constexpr T if_set_return(T x) const { return value() & x; } _ZNK5Botan2CT4MaskImE6selectEmm: 548| 1.25M| constexpr T select(T x, T y) const { return choose(value(), x, y); } _ZN5Botan2CT4MaskIhE11expand_boolEb: 397| 11.0k| static constexpr Mask expand_bool(bool v) { return Mask::expand(static_cast(v)); } _ZN5Botan2CT4MaskIhE6expandEh: 392| 11.0k| static constexpr Mask expand(T v) { return ~Mask::is_zero(value_barrier(v)); } _ZN5Botan2CT4MaskIhE7is_zeroEh: 437| 11.3k| static constexpr Mask is_zero(T x) { return Mask(ct_is_zero(value_barrier(x))); } _ZN5Botan2CT4MaskIhEC2Eh: 637| 22.3k| constexpr explicit Mask(T m) : m_mask(m) {} _ZNK5Botan2CT4MaskIhEcoEv: 533| 11.0k| constexpr Mask operator~() const { return Mask(~value()); } _ZNK5Botan2CT4MaskIhE5valueEv: 630| 22.3k| constexpr T value() const { return value_barrier(m_mask); } _ZNK5Botan2CT4MaskIhE6selectEhh: 548| 11.0k| constexpr T select(T x, T y) const { return choose(value(), x, y); } _ZN5Botan2CT4MaskImE8is_equalEmm: 442| 464k| static constexpr Mask is_equal(T x, T y) { 443| 464k| const T diff = value_barrier(x) ^ value_barrier(y); 444| 464k| return Mask::is_zero(diff); 445| 464k| } _ZNK5Botan2CT4MaskImE9as_choiceEv: 619| 2.19M| constexpr CT::Choice as_choice() const { 620| 2.19M| if constexpr(sizeof(T) >= sizeof(Choice::underlying_type)) { 621| 2.19M| return CT::Choice::from_mask(static_cast(unpoisoned_value())); 622| | } else { 623| | return CT::Choice::from_int(unpoisoned_value()); 624| | } 625| 2.19M| } _ZN5Botan2CT6Choice9from_maskEm: 303| 2.19M| constexpr static Choice from_mask(underlying_type v) { return Choice(v); } _ZN5Botan2CT6ChoiceC2Em: 341| 4.45M| constexpr explicit Choice(underlying_type v) : m_value(CT::value_barrier(v)) {} _ZNK5Botan2CT6ChoiceaaERKS1_: 311| 1.23M| constexpr Choice operator&&(const Choice& other) const { return Choice(value() & other.value()); } _ZNK5Botan2CT6Choice5valueEv: 332| 4.81M| constexpr underlying_type value() const { return value_barrier(m_value); } _ZNK5Botan2CT6ChoicentEv: 309| 462k| constexpr Choice operator!() const { return Choice(~value()); } _ZNK5Botan2CT6Choice7as_boolEv: 329| 386k| constexpr bool as_bool() const { return m_value != 0; } _ZN5Botan2CT6poisonImEEvPKT_m: 56| 9.54k|constexpr inline void poison(const T* p, size_t n) { 57| |#if defined(BOTAN_HAS_VALGRIND) 58| | if(!std::is_constant_evaluated()) { 59| | VALGRIND_MAKE_MEM_UNDEFINED(p, n * sizeof(T)); 60| | } 61| |#endif 62| | 63| 9.54k| BOTAN_UNUSED(p, n); ------------------ | | 151| 9.54k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 64| 9.54k|} _ZN5Botan2CT8unpoisonImEEvPKT_m: 67| 2.68M|constexpr inline void unpoison(const T* p, size_t n) { 68| |#if defined(BOTAN_HAS_VALGRIND) 69| | if(!std::is_constant_evaluated()) { 70| | VALGRIND_MAKE_MEM_DEFINED(p, n * sizeof(T)); 71| | } 72| |#endif 73| | 74| 2.68M| BOTAN_UNUSED(p, n); ------------------ | | 151| 2.68M|#define BOTAN_UNUSED Botan::ignore_params ------------------ 75| 2.68M|} _ZN5Botan2CT6Choice2noEv: 307| 1.23k| constexpr static Choice no() { return Choice(0); } _ZNK5Botan2CT6ChoiceooERKS1_: 313| 512k| constexpr Choice operator||(const Choice& other) const { return Choice(value() | other.value()); } _ZNK5Botan2CT6ChoiceneERKS1_: 315| 135| constexpr Choice operator!=(const Choice& other) const { return Choice(value() ^ other.value()); } _ZN5Botan2CT4MaskIhE8is_equalEhh: 442| 210| static constexpr Mask is_equal(T x, T y) { 443| 210| const T diff = value_barrier(x) ^ value_barrier(y); 444| 210| return Mask::is_zero(diff); 445| 210| } _ZN5Botan2CT4MaskImE5is_gtEmm: 458| 225k| static constexpr Mask is_gt(T x, T y) { return Mask::is_lt(y, x); } _ZN5Botan2CT4MaskImE6is_gteEmm: 468| 873k| static constexpr Mask is_gte(T x, T y) { return ~Mask::is_lt(x, y); } _ZN5Botan2CTorENS0_4MaskImEES2_: 528| 957k| friend constexpr Mask operator|(Mask x, Mask y) { return Mask(x.value() | y.value()); } _ZN5Botan2CT20conditional_copy_memImEENS0_4MaskIT_EES3_PS3_PKS3_S7_m: 738| 8.79k|constexpr inline Mask conditional_copy_mem(T cnd, T* dest, const T* if_set, const T* if_unset, size_t elems) { 739| 8.79k| const auto mask = CT::Mask::expand(cnd); 740| 8.79k| return CT::conditional_copy_mem(mask, dest, if_set, if_unset, elems); 741| 8.79k|} _ZN5Botan2CT20conditional_copy_memImEENS0_4MaskIT_EES4_PS3_PKS3_S7_m: 732| 8.79k|constexpr inline Mask conditional_copy_mem(Mask mask, T* dest, const T* if_set, const T* if_unset, size_t elems) { 733| 8.79k| mask.select_n(dest, if_set, if_unset, elems); 734| 8.79k| return mask; 735| 8.79k|} _ZN5Botan2CTanENS0_4MaskImEES2_: 518| 125k| friend constexpr Mask operator&(Mask x, Mask y) { return Mask(x.value() & y.value()); } _ZN5Botan2CTeoENS0_4MaskImEES2_: 523| 137| friend constexpr Mask operator^(Mask x, Mask y) { return Mask(x.value() ^ y.value()); } _ZN5Botan2CT6poisonITkNS_6ranges14spanable_rangeENSt3__16vectorImNS_16secure_allocatorImEEEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEnt17custom_poisonableISC_EEEvRKSC_: 121| 1.39k|constexpr void poison(const R& r) { 122| 1.39k| const std::span s{r}; 123| 1.39k| poison(s.data(), s.size()); 124| 1.39k|} _ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__16vectorImNS_16secure_allocatorImEEEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEnt19custom_unpoisonableISC_EEEvRKSC_: 128| 24.4k|constexpr void unpoison(const R& r) { 129| 24.4k| const std::span s{r}; 130| 24.4k| unpoison(s.data(), s.size()); 131| 24.4k|} _ZNK5Botan2CT4MaskIhE7as_boolEv: 614| 1| constexpr bool as_bool() const { return unpoisoned_value() != 0; } _ZNK5Botan2CT4MaskIhE16unpoisoned_valueEv: 598| 211| constexpr T unpoisoned_value() const { 599| 211| T r = value(); 600| 211| CT::unpoison(r); 601| 211| return r; 602| 211| } _ZN5Botan2CT8unpoisonITkNSt3__18integralEhEEvRKT_: 112| 211|constexpr void unpoison(const T& p) { 113| 211| unpoison(&p, 1); 114| 211|} _ZN5Botan2CT8unpoisonIhEEvPKT_m: 67| 211|constexpr inline void unpoison(const T* p, size_t n) { 68| |#if defined(BOTAN_HAS_VALGRIND) 69| | if(!std::is_constant_evaluated()) { 70| | VALGRIND_MAKE_MEM_DEFINED(p, n * sizeof(T)); 71| | } 72| |#endif 73| | 74| 211| BOTAN_UNUSED(p, n); ------------------ | | 151| 211|#define BOTAN_UNUSED Botan::ignore_params ------------------ 75| 211|} _ZN5Botan2CT8is_equalIhEENS0_4MaskIT_EEPKS3_S6_m: 798| 72|constexpr inline CT::Mask is_equal(const T x[], const T y[], size_t len) { 799| 72| if(std::is_constant_evaluated()) { ------------------ | Branch (799:7): [Folded, False: 72] ------------------ 800| 0| T difference = 0; 801| | 802| 0| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (802:25): [True: 0, False: 0] ------------------ 803| 0| difference = difference | (x[i] ^ y[i]); 804| 0| } 805| | 806| 0| return CT::Mask::is_zero(difference); 807| 72| } else { 808| 72| volatile T difference = 0; 809| | 810| 9.21k| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (810:25): [True: 9.14k, False: 72] ------------------ 811| 9.14k| difference = difference | (x[i] ^ y[i]); 812| 9.14k| } 813| | 814| 72| return CT::Mask::is_zero(difference); 815| 72| } 816| 72|} _ZN5Botan2CT4MaskImE6expandIhEES2_NS1_IT_EE: 429| 71| static constexpr Mask expand(Mask m) { 430| 71| static_assert(sizeof(U) < sizeof(T), "sizes ok"); 431| 71| return ~Mask::is_zero(m.value()); 432| 71| } _ZN5Botan2CT6Choice8from_intIjQaasr3stdE17unsigned_integralIT_Entsr3stdE7same_asIbS3_EEES1_S3_: 268| 9.05k| constexpr static Choice from_int(T v) { 269| 9.05k| if constexpr(sizeof(T) <= sizeof(underlying_type)) { 270| 9.05k| return !Choice(ct_is_zero(v)); 271| | } else { 272| | // Mask of T that is either |0| or |1| 273| | const T v_is_0 = ct_is_zero(value_barrier(v)); 274| | 275| | // We want the mask to be set if v != 0 so we must check that 276| | // v_is_0 is itself zero. 277| | // 278| | // Also sizeof(T) may not equal sizeof(underlying_type) so we must 279| | // use ct_is_zero. It's ok to either truncate or 280| | // zero extend v_is_0 to 32 bits since we know it is |0| or |1| 281| | // so even just the low bit is sufficient. 282| | return Choice(ct_is_zero(static_cast(v_is_0))); 283| | } 284| 9.05k| } _ZN5Botan2CT6poisonITkNS_6ranges14spanable_rangeENSt3__14spanIKmLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEnt17custom_poisonableISB_EEEvRKSB_: 121| 8.01k|constexpr void poison(const R& r) { 122| 8.01k| const std::span s{r}; 123| 8.01k| poison(s.data(), s.size()); 124| 8.01k|} _ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__14spanIKmLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEnt19custom_unpoisonableISB_EEEvRKSB_: 128| 8.01k|constexpr void unpoison(const R& r) { 129| 8.01k| const std::span s{r}; 130| 8.01k| unpoison(s.data(), s.size()); 131| 8.01k|} _ZN5Botan2CT9all_zerosImEENS0_4MaskIT_EEPKS3_m: 785| 5.08M|constexpr inline CT::Mask all_zeros(const T elem[], size_t len) { 786| 5.08M| T sum = 0; 787| 41.9M| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (787:22): [True: 36.9M, False: 5.08M] ------------------ 788| 36.9M| sum |= elem[i]; 789| 36.9M| } 790| 5.08M| return CT::Mask::is_zero(sum); 791| 5.08M|} _ZN5Botan2CT4MaskImE15if_set_zero_outEPmm: 575| 2.87M| constexpr void if_set_zero_out(T buf[], size_t elems) { 576| 28.7M| for(size_t i = 0; i != elems; ++i) { ------------------ | Branch (576:28): [True: 25.8M, False: 2.87M] ------------------ 577| 25.8M| buf[i] = this->if_not_set_return(buf[i]); 578| 25.8M| } 579| 2.87M| } _ZNK5Botan2CT4MaskImE17if_not_set_returnEm: 543| 25.9M| constexpr T if_not_set_return(T x) const { return ~value() & x; } _ZN5Botan2CT22conditional_assign_memImEENS0_4MaskIT_EES3_PS3_PKS3_m: 749| 18.3M|constexpr inline Mask conditional_assign_mem(T cnd, T* dest, const T* src, size_t elems) { 750| 18.3M| const auto mask = CT::Mask::expand(cnd); 751| 18.3M| mask.select_n(dest, src, dest, elems); 752| 18.3M| return mask; 753| 18.3M|} _ZN5Botan2CT12poison_rangeITkNSt3__16ranges5rangeENS2_6vectorINS_14Montgomery_IntENS2_9allocatorIS5_EEEEQ10poisonableINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEEEvRKSC_: 181| 87|constexpr void poison_range(const R& r) { 182| 1.39k| for(const auto& v : r) { ------------------ | Branch (182:22): [True: 1.39k, False: 87] ------------------ 183| 1.39k| poison(v); 184| 1.39k| } 185| 87|} _ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_14Montgomery_IntEEEvRKT_: 138| 1.39k|constexpr void poison(const T& x) { 139| 1.39k| x._const_time_poison(); 140| 1.39k|} _ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_14Montgomery_IntEEEvRKT_: 143| 384|constexpr void unpoison(const T& x) { 144| 384| x._const_time_unpoison(); 145| 384|} _ZN5Botan2CT4MaskImE7clearedEv: 387| 15.6k| static constexpr Mask cleared() { return Mask(0); } _ZN5Botan2CT8is_equalImEENS0_4MaskIT_EEPKS3_S6_m: 798| 22.1k|constexpr inline CT::Mask is_equal(const T x[], const T y[], size_t len) { 799| 22.1k| if(std::is_constant_evaluated()) { ------------------ | Branch (799:7): [Folded, False: 22.1k] ------------------ 800| 0| T difference = 0; 801| | 802| 0| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (802:25): [True: 0, False: 0] ------------------ 803| 0| difference = difference | (x[i] ^ y[i]); 804| 0| } 805| | 806| 0| return CT::Mask::is_zero(difference); 807| 22.1k| } else { 808| 22.1k| volatile T difference = 0; 809| | 810| 115k| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (810:25): [True: 93.6k, False: 22.1k] ------------------ 811| 93.6k| difference = difference | (x[i] ^ y[i]); 812| 93.6k| } 813| | 814| 22.1k| return CT::Mask::is_zero(difference); 815| 22.1k| } 816| 22.1k|} _ZN5Botan2CT6Choice8from_intImQaasr3stdE17unsigned_integralIT_Entsr3stdE7same_asIbS3_EEES1_S3_: 268| 135| constexpr static Choice from_int(T v) { 269| 135| if constexpr(sizeof(T) <= sizeof(underlying_type)) { 270| 135| return !Choice(ct_is_zero(v)); 271| | } else { 272| | // Mask of T that is either |0| or |1| 273| | const T v_is_0 = ct_is_zero(value_barrier(v)); 274| | 275| | // We want the mask to be set if v != 0 so we must check that 276| | // v_is_0 is itself zero. 277| | // 278| | // Also sizeof(T) may not equal sizeof(underlying_type) so we must 279| | // use ct_is_zero. It's ok to either truncate or 280| | // zero extend v_is_0 to 32 bits since we know it is |0| or |1| 281| | // so even just the low bit is sufficient. 282| | return Choice(ct_is_zero(static_cast(v_is_0))); 283| | } 284| 135| } _ZN5Botan2CT6Choice8from_intIhQaasr3stdE17unsigned_integralIT_Entsr3stdE7same_asIbS3_EEES1_S3_: 268| 48.0k| constexpr static Choice from_int(T v) { 269| 48.0k| if constexpr(sizeof(T) <= sizeof(underlying_type)) { 270| 48.0k| return !Choice(ct_is_zero(v)); 271| | } else { 272| | // Mask of T that is either |0| or |1| 273| | const T v_is_0 = ct_is_zero(value_barrier(v)); 274| | 275| | // We want the mask to be set if v != 0 so we must check that 276| | // v_is_0 is itself zero. 277| | // 278| | // Also sizeof(T) may not equal sizeof(underlying_type) so we must 279| | // use ct_is_zero. It's ok to either truncate or 280| | // zero extend v_is_0 to 32 bits since we know it is |0| or |1| 281| | // so even just the low bit is sufficient. 282| | return Choice(ct_is_zero(static_cast(v_is_0))); 283| | } 284| 48.0k| } _ZNK5Botan2CT4MaskIhE9as_choiceEv: 619| 210| constexpr CT::Choice as_choice() const { 620| | if constexpr(sizeof(T) >= sizeof(Choice::underlying_type)) { 621| | return CT::Choice::from_mask(static_cast(unpoisoned_value())); 622| 210| } else { 623| 210| return CT::Choice::from_int(unpoisoned_value()); 624| 210| } 625| 210| } _ZNK5Botan2CT6Choice12into_bitmaskImQaasr3stdE17unsigned_integralIT_Entsr3stdE7same_asIbS3_EEES3_v: 291| 867k| constexpr T into_bitmask() const { 292| 867k| if constexpr(sizeof(T) <= sizeof(underlying_type)) { 293| | // The inner mask is already |0| or |1| so just truncate 294| 867k| return static_cast(value()); 295| | } else { 296| | return ~ct_is_zero(value()); 297| | } 298| 867k| } _ZN5Botan2CT4MaskImE6is_lteEmm: 463| 71| static constexpr Mask is_lte(T x, T y) { return ~Mask::is_gt(x, y); } pcurves_secp224r1.cpp:_ZN5Botan2CT6OptionINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEEEC2ESC_NS0_6ChoiceE: 653| 209| constexpr Option(T v, Choice valid) : m_has_value(valid), m_value(std::move(v)) {} pcurves_secp224r1.cpp:_ZNK5Botan2CT6OptionINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEEE19as_optional_vartimeEv: 710| 209| constexpr std::optional as_optional_vartime() const { 711| 209| if(m_has_value.as_bool()) { ------------------ | Branch (711:13): [True: 135, False: 74] ------------------ 712| 135| return {m_value}; 713| 135| } else { 714| 74| return {}; 715| 74| } 716| 209| } _ZNK5Botan18DilithiumConstants4modeEv: 162| 6| DilithiumMode mode() const { return m_mode; } _ZNK5Botan18DilithiumConstants16public_key_bytesEv: 152| 3| size_t public_key_bytes() const { return m_public_key_bytes; } _ZNK5Botan18DilithiumConstants9is_ml_dsaEv: 104| 6| bool is_ml_dsa() const { return m_mode.is_ml_dsa(); } _ZNK5Botan18DilithiumConstants1kEv: 123| 3| uint8_t k() const { return m_k; } _ZNK5Botan18DilithiumConstants1lEv: 126| 3| uint8_t l() const { return m_l; } _ZNK5Botan18DilithiumConstants9is_modernEv: 100| 3| bool is_modern() const { return m_mode.is_modern(); } _ZNK5Botan18DilithiumConstants6is_aesEv: 102| 3| bool is_aes() const { return m_mode.is_aes(); } _ZNK5Botan18DilithiumConstants21public_key_hash_bytesEv: 138| 3| size_t public_key_hash_bytes() const { return m_public_key_hash_bytes; } _ZNK5Botan18DilithiumConstants26commitment_hash_full_bytesEv: 141| 3| size_t commitment_hash_full_bytes() const { return m_commitment_hash_full_bytes; } _ZN5Botan23Dilithium_Keypair_CodecD2Ev: 27| 3| virtual ~Dilithium_Keypair_Codec() = default; _ZN5Botan17DilithiumShakeXOFC2Ev: 18| 3| DilithiumShakeXOF() = default; _ZN5Botan12DilithiumXOFD2Ev: 87| 3| virtual ~DilithiumXOF() = default; _ZN5Botan35Dilithium_Symmetric_Primitives_BaseD2Ev: 104| 3| virtual ~Dilithium_Symmetric_Primitives_Base() = default; _ZNK5Botan22EC_AffinePoint_Data_BN15to_legacy_pointEv: 85| 140| EC_Point to_legacy_point() const override { return m_pt; } _ZNK5Botan13EC_Group_Data3oidEv: 166| 14.4k| const OID& oid() const { return m_oid; } _ZNK5Botan13EC_Group_Data1pEv: 170| 5.89k| const BigInt& p() const { return m_p; } _ZNK5Botan13EC_Group_Data1aEv: 172| 218| const BigInt& a() const { return m_a; } _ZNK5Botan13EC_Group_Data1bEv: 174| 218| const BigInt& b() const { return m_b; } _ZNK5Botan13EC_Group_Data5curveEv: 181| 1.06k| const CurveGFp& curve() const { return m_curve; } _ZNK5Botan13EC_Group_Data5montyEv: 185| 59.1k| const Montgomery_Params& monty() const { return m_monty; } _ZNK5Botan13EC_Group_Data7monty_aEv: 187| 140| const BigInt& monty_a() const { return m_a_r; } _ZNK5Botan13EC_Group_Data7monty_bEv: 189| 140| const BigInt& monty_b() const { return m_b_r; } _ZNK5Botan13EC_Group_Data7p_wordsEv: 202| 5.44k| size_t p_words() const { return m_p_words; } _ZNK5Botan13EC_Group_Data6p_bitsEv: 204| 2.14k| size_t p_bits() const { return m_p_bits; } _ZNK5Botan13EC_Group_Data7p_bytesEv: 206| 2.32k| size_t p_bytes() const { return (m_p_bits + 7) / 8; } _ZNK5Botan13EC_Group_Data10order_bitsEv: 208| 1.03k| size_t order_bits() const { return m_order_bits; } _ZNK5Botan13EC_Group_Data11order_bytesEv: 210| 2.50k| size_t order_bytes() const { return m_order_bytes; } _ZNK5Botan13EC_Group_Data12a_is_minus_3Ev: 212| 486| bool a_is_minus_3() const { return m_a_is_minus_3; } _ZNK5Botan13EC_Group_Data9a_is_zeroEv: 214| 1.06k| bool a_is_zero() const { return m_a_is_zero; } _ZNK5Botan13EC_Group_Data6pcurveEv: 297| 10.1k| const PCurve::PrimeOrderCurve& pcurve() const { 298| 10.1k| BOTAN_ASSERT_NONNULL(m_pcurve); ------------------ | | 123| 10.1k| do { \ | | 124| 10.1k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (124:10): [True: 0, False: 10.1k] | | ------------------ | | 125| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 126| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 127| 0| } \ | | 128| 10.1k| } while(0) | | ------------------ | | | Branch (128:12): [Folded, False: 10.1k] | | ------------------ ------------------ 299| 10.1k| return *m_pcurve; 300| 10.1k| } _ZN5Botan19EC_AffinePoint_DataD2Ev: 74| 1.20k| virtual ~EC_AffinePoint_Data() = default; _ZN5Botan14EC_Scalar_DataD2Ev: 39| 7.59k| virtual ~EC_Scalar_Data() = default; _ZN5Botan17EC_Mul2Table_DataD2Ev: 113| 928| virtual ~EC_Mul2Table_Data() = default; _ZNK5Botan17EC_Scalar_Data_PC5valueEv: 53| 4.58k| const auto& value() const { return m_v; } _ZNK5Botan22EC_AffinePoint_Data_PC5valueEv: 88| 928| const PCurve::PrimeOrderCurve::AffinePoint& value() const { return m_pt; } _ZN5Botan17EC_Scalar_Data_PCC2ENSt3__110shared_ptrIKNS_13EC_Group_DataEEENS_6PCurve15PrimeOrderCurve6ScalarE: 19| 7.59k| m_group(std::move(group)), m_v(std::move(v)) {} _ZNK5Botan17EC_PublicKey_Data5groupEv: 30| 4.65k| const EC_Group& group() const { return m_group; } _ZNK5Botan17EC_PublicKey_Data10public_keyEv: 32| 928| const EC_AffinePoint& public_key() const { return m_point; } _ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_: 53| 22.5k|std::string fmt(std::string_view format, const T&... args) { 54| 22.5k| std::ostringstream oss; 55| 22.5k| oss.imbue(std::locale::classic()); 56| 22.5k| fmt_detail::do_fmt(oss, format, args...); 57| 22.5k| return oss.str(); 58| 22.5k|} _ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_: 25| 24.1k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 24.1k| size_t i = 0; 27| | 28| 236k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 236k, False: 0] ------------------ 29| 236k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 24.1k, False: 212k] | Branch (29:30): [True: 24.1k, False: 0] | Branch (29:59): [True: 24.1k, False: 0] ------------------ 30| 24.1k| oss << val; 31| 24.1k| return do_fmt(oss, format.substr(i + 2), rest...); 32| 212k| } else { 33| 212k| oss << format[i]; 34| 212k| } 35| | 36| 212k| i += 1; 37| 212k| } 38| 24.1k|} _ZN5Botan10fmt_detail6do_fmtERNSt3__119basic_ostringstreamIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EE: 20| 37.5k|inline void do_fmt(std::ostringstream& oss, std::string_view format) { 21| 37.5k| oss << format; 22| 37.5k|} _ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPKcEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_: 53| 7.17k|std::string fmt(std::string_view format, const T&... args) { 54| 7.17k| std::ostringstream oss; 55| 7.17k| oss.imbue(std::locale::classic()); 56| 7.17k| fmt_detail::do_fmt(oss, format, args...); 57| 7.17k| return oss.str(); 58| 7.17k|} _ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJPKcEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_: 25| 7.17k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 7.17k| size_t i = 0; 27| | 28| 7.17k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 7.17k, False: 0] ------------------ 29| 7.17k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 7.17k, False: 0] | Branch (29:30): [True: 7.17k, False: 0] | Branch (29:59): [True: 7.17k, False: 0] ------------------ 30| 7.17k| oss << val; 31| 7.17k| return do_fmt(oss, format.substr(i + 2), rest...); 32| 7.17k| } else { 33| 0| oss << format[i]; 34| 0| } 35| | 36| 0| i += 1; 37| 0| } 38| 7.17k|} _ZN5Botan10fmt_detail6do_fmtIPKcJEEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 25| 7.27k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 7.27k| size_t i = 0; 27| | 28| 102k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 102k, False: 0] ------------------ 29| 102k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 7.27k, False: 95.3k] | Branch (29:30): [True: 7.27k, False: 0] | Branch (29:59): [True: 7.27k, False: 0] ------------------ 30| 7.27k| oss << val; 31| 7.27k| return do_fmt(oss, format.substr(i + 2), rest...); 32| 95.3k| } else { 33| 95.3k| oss << format[i]; 34| 95.3k| } 35| | 36| 95.3k| i += 1; 37| 95.3k| } 38| 7.27k|} _ZN5Botan3fmtIJPKcNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEEEENS3_12basic_stringIcS6_NS3_9allocatorIcEEEES7_DpRKT_: 53| 1.31k|std::string fmt(std::string_view format, const T&... args) { 54| 1.31k| std::ostringstream oss; 55| 1.31k| oss.imbue(std::locale::classic()); 56| 1.31k| fmt_detail::do_fmt(oss, format, args...); 57| 1.31k| return oss.str(); 58| 1.31k|} _ZN5Botan10fmt_detail6do_fmtIPKcJNSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEEEEvRNS4_19basic_ostringstreamIcS7_NS4_9allocatorIcEEEES8_RKT_DpRKT0_: 25| 1.31k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 1.31k| size_t i = 0; 27| | 28| 1.31k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 1.31k, False: 0] ------------------ 29| 1.31k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 1.31k, False: 0] | Branch (29:30): [True: 1.31k, False: 0] | Branch (29:59): [True: 1.31k, False: 0] ------------------ 30| 1.31k| oss << val; 31| 1.31k| return do_fmt(oss, format.substr(i + 2), rest...); 32| 1.31k| } else { 33| 0| oss << format[i]; 34| 0| } 35| | 36| 0| i += 1; 37| 0| } 38| 1.31k|} _ZN5Botan10fmt_detail6do_fmtImJEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 5|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 5| size_t i = 0; 27| | 28| 255| while(i < format.size()) { ------------------ | Branch (28:10): [True: 255, False: 0] ------------------ 29| 255| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 5, False: 250] | Branch (29:30): [True: 5, False: 0] | Branch (29:59): [True: 5, False: 0] ------------------ 30| 5| oss << val; 31| 5| return do_fmt(oss, format.substr(i + 2), rest...); 32| 250| } else { 33| 250| oss << format[i]; 34| 250| } 35| | 36| 250| i += 1; 37| 250| } 38| 5|} _ZN5Botan3fmtIJPKcEEENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS3_17basic_string_viewIcS6_EEDpRKT_: 53| 71|std::string fmt(std::string_view format, const T&... args) { 54| 71| std::ostringstream oss; 55| 71| oss.imbue(std::locale::classic()); 56| 71| fmt_detail::do_fmt(oss, format, args...); 57| 71| return oss.str(); 58| 71|} _ZN5Botan3fmtIJNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEES7_NS1_17basic_string_viewIcS4_EEDpRKT_: 53| 4.95k|std::string fmt(std::string_view format, const T&... args) { 54| 4.95k| std::ostringstream oss; 55| 4.95k| oss.imbue(std::locale::classic()); 56| 4.95k| fmt_detail::do_fmt(oss, format, args...); 57| 4.95k| return oss.str(); 58| 4.95k|} _ZN5Botan10fmt_detail6do_fmtINSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEJEEEvRNS2_19basic_ostringstreamIcS5_S7_EENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 4.96k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 4.96k| size_t i = 0; 27| | 28| 146k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 146k, False: 0] ------------------ 29| 146k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 4.96k, False: 141k] | Branch (29:30): [True: 4.96k, False: 0] | Branch (29:59): [True: 4.96k, False: 0] ------------------ 30| 4.96k| oss << val; 31| 4.96k| return do_fmt(oss, format.substr(i + 2), rest...); 32| 141k| } else { 33| 141k| oss << format[i]; 34| 141k| } 35| | 36| 141k| i += 1; 37| 141k| } 38| 4.96k|} _ZN5Botan3fmtIJmmEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 53| 1|std::string fmt(std::string_view format, const T&... args) { 54| 1| std::ostringstream oss; 55| 1| oss.imbue(std::locale::classic()); 56| 1| fmt_detail::do_fmt(oss, format, args...); 57| 1| return oss.str(); 58| 1|} _ZN5Botan10fmt_detail6do_fmtImJmEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 1|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 1| size_t i = 0; 27| | 28| 45| while(i < format.size()) { ------------------ | Branch (28:10): [True: 45, False: 0] ------------------ 29| 45| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 1, False: 44] | Branch (29:30): [True: 1, False: 0] | Branch (29:59): [True: 1, False: 0] ------------------ 30| 1| oss << val; 31| 1| return do_fmt(oss, format.substr(i + 2), rest...); 32| 44| } else { 33| 44| oss << format[i]; 34| 44| } 35| | 36| 44| i += 1; 37| 44| } 38| 1|} _ZN5Botan3fmtIJmEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 53| 4|std::string fmt(std::string_view format, const T&... args) { 54| 4| std::ostringstream oss; 55| 4| oss.imbue(std::locale::classic()); 56| 4| fmt_detail::do_fmt(oss, format, args...); 57| 4| return oss.str(); 58| 4|} _ZN5Botan3fmtIJjEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 53| 300|std::string fmt(std::string_view format, const T&... args) { 54| 300| std::ostringstream oss; 55| 300| oss.imbue(std::locale::classic()); 56| 300| fmt_detail::do_fmt(oss, format, args...); 57| 300| return oss.str(); 58| 300|} _ZN5Botan10fmt_detail6do_fmtIjJEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 1.08k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 1.08k| size_t i = 0; 27| | 28| 13.7k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 13.7k, False: 0] ------------------ 29| 13.7k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 1.08k, False: 12.6k] | Branch (29:30): [True: 1.08k, False: 0] | Branch (29:59): [True: 1.08k, False: 0] ------------------ 30| 1.08k| oss << val; 31| 1.08k| return do_fmt(oss, format.substr(i + 2), rest...); 32| 12.6k| } else { 33| 12.6k| oss << format[i]; 34| 12.6k| } 35| | 36| 12.6k| i += 1; 37| 12.6k| } 38| 1.08k|} _ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEjEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_: 53| 412|std::string fmt(std::string_view format, const T&... args) { 54| 412| std::ostringstream oss; 55| 412| oss.imbue(std::locale::classic()); 56| 412| fmt_detail::do_fmt(oss, format, args...); 57| 412| return oss.str(); 58| 412|} _ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJjEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_: 25| 412|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 412| size_t i = 0; 27| | 28| 412| while(i < format.size()) { ------------------ | Branch (28:10): [True: 412, False: 0] ------------------ 29| 412| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 412, False: 0] | Branch (29:30): [True: 412, False: 0] | Branch (29:59): [True: 412, False: 0] ------------------ 30| 412| oss << val; 31| 412| return do_fmt(oss, format.substr(i + 2), rest...); 32| 412| } else { 33| 0| oss << format[i]; 34| 0| } 35| | 36| 0| i += 1; 37| 0| } 38| 412|} _ZN5Botan3fmtIJjjEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 53| 372|std::string fmt(std::string_view format, const T&... args) { 54| 372| std::ostringstream oss; 55| 372| oss.imbue(std::locale::classic()); 56| 372| fmt_detail::do_fmt(oss, format, args...); 57| 372| return oss.str(); 58| 372|} _ZN5Botan10fmt_detail6do_fmtIjJjEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 372|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 372| size_t i = 0; 27| | 28| 9.97k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 9.97k, False: 0] ------------------ 29| 9.97k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 372, False: 9.60k] | Branch (29:30): [True: 372, False: 0] | Branch (29:59): [True: 372, False: 0] ------------------ 30| 372| oss << val; 31| 372| return do_fmt(oss, format.substr(i + 2), rest...); 32| 9.60k| } else { 33| 9.60k| oss << format[i]; 34| 9.60k| } 35| | 36| 9.60k| i += 1; 37| 9.60k| } 38| 372|} _ZN5Botan3fmtIJtttEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 53| 10|std::string fmt(std::string_view format, const T&... args) { 54| 10| std::ostringstream oss; 55| 10| oss.imbue(std::locale::classic()); 56| 10| fmt_detail::do_fmt(oss, format, args...); 57| 10| return oss.str(); 58| 10|} _ZN5Botan10fmt_detail6do_fmtItJttEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 10|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 10| size_t i = 0; 27| | 28| 160| while(i < format.size()) { ------------------ | Branch (28:10): [True: 160, False: 0] ------------------ 29| 160| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 10, False: 150] | Branch (29:30): [True: 10, False: 0] | Branch (29:59): [True: 10, False: 0] ------------------ 30| 10| oss << val; 31| 10| return do_fmt(oss, format.substr(i + 2), rest...); 32| 150| } else { 33| 150| oss << format[i]; 34| 150| } 35| | 36| 150| i += 1; 37| 150| } 38| 10|} _ZN5Botan10fmt_detail6do_fmtItJtEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 10|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 10| size_t i = 0; 27| | 28| 190| while(i < format.size()) { ------------------ | Branch (28:10): [True: 190, False: 0] ------------------ 29| 190| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 10, False: 180] | Branch (29:30): [True: 10, False: 0] | Branch (29:59): [True: 10, False: 0] ------------------ 30| 10| oss << val; 31| 10| return do_fmt(oss, format.substr(i + 2), rest...); 32| 180| } else { 33| 180| oss << format[i]; 34| 180| } 35| | 36| 180| i += 1; 37| 180| } 38| 10|} _ZN5Botan10fmt_detail6do_fmtItJEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 10|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 10| size_t i = 0; 27| | 28| 50| while(i < format.size()) { ------------------ | Branch (28:10): [True: 50, False: 0] ------------------ 29| 50| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 10, False: 40] | Branch (29:30): [True: 10, False: 0] | Branch (29:59): [True: 10, False: 0] ------------------ 30| 10| oss << val; 31| 10| return do_fmt(oss, format.substr(i + 2), rest...); 32| 40| } else { 33| 40| oss << format[i]; 34| 40| } 35| | 36| 40| i += 1; 37| 40| } 38| 10|} _ZN5Botan3fmtIJNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEES7_EEES7_NS1_17basic_string_viewIcS4_EEDpRKT_: 53| 11|std::string fmt(std::string_view format, const T&... args) { 54| 11| std::ostringstream oss; 55| 11| oss.imbue(std::locale::classic()); 56| 11| fmt_detail::do_fmt(oss, format, args...); 57| 11| return oss.str(); 58| 11|} _ZN5Botan10fmt_detail6do_fmtINSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEJS8_EEEvRNS2_19basic_ostringstreamIcS5_S7_EENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 11|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 11| size_t i = 0; 27| | 28| 11| while(i < format.size()) { ------------------ | Branch (28:10): [True: 11, False: 0] ------------------ 29| 11| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 11, False: 0] | Branch (29:30): [True: 11, False: 0] | Branch (29:59): [True: 11, False: 0] ------------------ 30| 11| oss << val; 31| 11| return do_fmt(oss, format.substr(i + 2), rest...); 32| 11| } else { 33| 0| oss << format[i]; 34| 0| } 35| | 36| 0| i += 1; 37| 0| } 38| 11|} _ZN5Botan3fmtIJPKcS2_S2_EEENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS3_17basic_string_viewIcS6_EEDpRKT_: 53| 26|std::string fmt(std::string_view format, const T&... args) { 54| 26| std::ostringstream oss; 55| 26| oss.imbue(std::locale::classic()); 56| 26| fmt_detail::do_fmt(oss, format, args...); 57| 26| return oss.str(); 58| 26|} _ZN5Botan10fmt_detail6do_fmtIPKcJS3_S3_EEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 25| 26|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 26| size_t i = 0; 27| | 28| 26| while(i < format.size()) { ------------------ | Branch (28:10): [True: 26, False: 0] ------------------ 29| 26| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 26, False: 0] | Branch (29:30): [True: 26, False: 0] | Branch (29:59): [True: 26, False: 0] ------------------ 30| 26| oss << val; 31| 26| return do_fmt(oss, format.substr(i + 2), rest...); 32| 26| } else { 33| 0| oss << format[i]; 34| 0| } 35| | 36| 0| i += 1; 37| 0| } 38| 26|} _ZN5Botan10fmt_detail6do_fmtIPKcJS3_EEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 25| 26|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 26| size_t i = 0; 27| | 28| 130| while(i < format.size()) { ------------------ | Branch (28:10): [True: 130, False: 0] ------------------ 29| 130| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 26, False: 104] | Branch (29:30): [True: 26, False: 0] | Branch (29:59): [True: 26, False: 0] ------------------ 30| 26| oss << val; 31| 26| return do_fmt(oss, format.substr(i + 2), rest...); 32| 104| } else { 33| 104| oss << format[i]; 34| 104| } 35| | 36| 104| i += 1; 37| 104| } 38| 26|} _ZN5Botan3fmtIJNS_3OIDEEEENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EEDpRKT_: 53| 3|std::string fmt(std::string_view format, const T&... args) { 54| 3| std::ostringstream oss; 55| 3| oss.imbue(std::locale::classic()); 56| 3| fmt_detail::do_fmt(oss, format, args...); 57| 3| return oss.str(); 58| 3|} _ZN5Botan10fmt_detail6do_fmtINS_3OIDEJEEEvRNSt3__119basic_ostringstreamIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS3_17basic_string_viewIcS6_EERKT_DpRKT0_: 25| 3|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 3| size_t i = 0; 27| | 28| 108| while(i < format.size()) { ------------------ | Branch (28:10): [True: 108, False: 0] ------------------ 29| 108| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 3, False: 105] | Branch (29:30): [True: 3, False: 0] | Branch (29:59): [True: 3, False: 0] ------------------ 30| 3| oss << val; 31| 3| return do_fmt(oss, format.substr(i + 2), rest...); 32| 105| } else { 33| 105| oss << format[i]; 34| 105| } 35| | 36| 105| i += 1; 37| 105| } 38| 3|} _ZN5Botan3fmtIJNS_3OIDENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEEEENS2_12basic_stringIcS5_NS2_9allocatorIcEEEES6_DpRKT_: 53| 282|std::string fmt(std::string_view format, const T&... args) { 54| 282| std::ostringstream oss; 55| 282| oss.imbue(std::locale::classic()); 56| 282| fmt_detail::do_fmt(oss, format, args...); 57| 282| return oss.str(); 58| 282|} _ZN5Botan10fmt_detail6do_fmtINS_3OIDEJNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEEEEvRNS3_19basic_ostringstreamIcS6_NS3_9allocatorIcEEEES7_RKT_DpRKT0_: 25| 282|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 282| size_t i = 0; 27| | 28| 10.1k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 10.1k, False: 0] ------------------ 29| 10.1k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 282, False: 9.87k] | Branch (29:30): [True: 282, False: 0] | Branch (29:59): [True: 282, False: 0] ------------------ 30| 282| oss << val; 31| 282| return do_fmt(oss, format.substr(i + 2), rest...); 32| 9.87k| } else { 33| 9.87k| oss << format[i]; 34| 9.87k| } 35| | 36| 9.87k| i += 1; 37| 9.87k| } 38| 282|} _ZN5Botan11checked_mulITkNSt3__117unsigned_integralEmEENS1_8optionalIT_EES3_S3_: 46| 401k|constexpr inline std::optional checked_mul(T a, T b) { 47| | // Multiplication by 1U is a hack to work around C's insane 48| | // integer promotion rules. 49| | // https://stackoverflow.com/questions/24795651 50| 401k| const T r = (1U * a) * b; 51| | // If a == 0 then the multiply certainly did not overflow 52| | // Otherwise r / a == b unless overflow occurred 53| 401k| if(a != 0 && r / a != b) { ------------------ | Branch (53:7): [True: 401k, False: 0] | Branch (53:17): [True: 0, False: 401k] ------------------ 54| 0| return {}; 55| 0| } 56| 401k| return r; 57| 401k|} _ZN5Botan15checked_cast_toIjmQaasr3stdE8integralINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEsr3stdE8integralINS2_Iu14__remove_cvrefIT0_EE4typeEEEES3_S7_: 104| 338|constexpr RT checked_cast_to(AT i) { 105| 338| return checked_cast_to_or_throw(i, "Error during integer conversion"); 106| 338|} _ZN5Botan24checked_cast_to_or_throwIjNS_14Internal_ErrorEmQaasr3stdE8integralINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEsr3stdE8integralINS3_Iu14__remove_cvrefIT1_EE4typeEEEES4_S8_NSt3__117basic_string_viewIcNSC_11char_traitsIcEEEE: 91| 338|constexpr RT checked_cast_to_or_throw(AT i, std::string_view error_msg_on_fail) { 92| 338| const auto unwrapped_input = unwrap_strong_type(i); 93| | 94| 338| const auto unwrapped_result = static_cast>(unwrapped_input); 95| 338| if(unwrapped_input != static_cast>(unwrapped_result)) [[unlikely]] { ------------------ | Branch (95:7): [True: 0, False: 338] ------------------ 96| 0| throw ExceptionType(error_msg_on_fail); 97| 0| } 98| | 99| 338| return wrap_strong_type(unwrapped_result); 100| 338|} _ZN5Botan15checked_cast_toItmQaasr3stdE8integralINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEsr3stdE8integralINS2_Iu14__remove_cvrefIT0_EE4typeEEEES3_S7_: 104| 11|constexpr RT checked_cast_to(AT i) { 105| 11| return checked_cast_to_or_throw(i, "Error during integer conversion"); 106| 11|} _ZN5Botan24checked_cast_to_or_throwItNS_14Internal_ErrorEmQaasr3stdE8integralINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEsr3stdE8integralINS3_Iu14__remove_cvrefIT1_EE4typeEEEES4_S8_NSt3__117basic_string_viewIcNSC_11char_traitsIcEEEE: 91| 11|constexpr RT checked_cast_to_or_throw(AT i, std::string_view error_msg_on_fail) { 92| 11| const auto unwrapped_input = unwrap_strong_type(i); 93| | 94| 11| const auto unwrapped_result = static_cast>(unwrapped_input); 95| 11| if(unwrapped_input != static_cast>(unwrapped_result)) [[unlikely]] { ------------------ | Branch (95:7): [True: 0, False: 11] ------------------ 96| 0| throw ExceptionType(error_msg_on_fail); 97| 0| } 98| | 99| 11| return wrap_strong_type(unwrapped_result); 100| 11|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEjEENS1_8optionalIT_EES3_S3_: 19| 49.3k|constexpr inline std::optional checked_add(T a, T b) { 20| 49.3k| const T r = a + b; 21| 49.3k| if(r < a || r < b) { ------------------ | Branch (21:7): [True: 0, False: 49.3k] | Branch (21:16): [True: 0, False: 49.3k] ------------------ 22| 0| return {}; 23| 0| } 24| 49.3k| return r; 25| 49.3k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 42.0k|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 42.0k| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 42.0k, False: 0] ------------------ 39| 42.0k| return checked_add(r.value(), rest...); 40| 42.0k| } else { 41| 0| return {}; 42| 0| } 43| 42.0k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmEENS1_8optionalIT_EES3_S3_: 19| 131k|constexpr inline std::optional checked_add(T a, T b) { 20| 131k| const T r = a + b; 21| 131k| if(r < a || r < b) { ------------------ | Branch (21:7): [True: 0, False: 131k] | Branch (21:16): [True: 0, False: 131k] ------------------ 22| 0| return {}; 23| 0| } 24| 131k| return r; 25| 131k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 42.0k|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 42.0k| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 42.0k, False: 0] ------------------ 39| 42.0k| return checked_add(r.value(), rest...); 40| 42.0k| } else { 41| 0| return {}; 42| 0| } 43| 42.0k|} _ZN5Botan7swar_ltITkNSt3__117unsigned_integralEtEET_S2_S2_: 121| 495k|constexpr T swar_lt(T a, T b) { 122| | // The constant 0x808080... as a T 123| 495k| constexpr T hi1 = (static_cast(-1) / 255) << 7; 124| | // The constant 0x7F7F7F... as a T 125| 495k| constexpr T lo7 = static_cast(~hi1); 126| 495k| T r = (lo7 - a + b) & hi1; 127| | // Currently the mask is 80 if lt, otherwise 00. Convert to FF/00 128| 495k| return (r << 1) - (r >> 7); 129| 495k|} _ZN5Botan12mul_or_throwITkNSt3__117unsigned_integralEmEET_S2_S2_NS1_17basic_string_viewIcNS1_11char_traitsIcEEEE: 81| 19.0k|constexpr T mul_or_throw(T a, T b, std::string_view msg) { 82| 19.0k| if(auto r = checked_mul(a, b)) { ------------------ | Branch (82:12): [True: 19.0k, False: 0] ------------------ 83| 19.0k| return r.value(); 84| 19.0k| } else { 85| 0| throw Invalid_Argument(msg); 86| 0| } 87| 19.0k|} _ZN5Botan13swar_in_rangeITkNSt3__117unsigned_integralEmEET_S2_S2_S2_: 144| 841k|constexpr T swar_in_range(T v, T lower, T upper) { 145| | // The constant 0x808080... as a T 146| 841k| constexpr T hi1 = (static_cast(-1) / 255) << 7; 147| | // The constant 0x7F7F7F... as a T 148| 841k| constexpr T lo7 = ~hi1; 149| | 150| 841k| const T sub = ((v | hi1) - (lower & lo7)) ^ ((v ^ (~lower)) & hi1); 151| 841k| const T a_lo = sub & lo7; 152| 841k| const T a_hi = sub & hi1; 153| 841k| return (lo7 - a_lo + upper) & hi1 & ~a_hi; 154| 841k|} _ZN5Botan23index_of_first_set_byteITkNSt3__117unsigned_integralEmEEmT_: 160| 82.9k|constexpr size_t index_of_first_set_byte(T v) { 161| | // The constant 0x010101... as a T 162| 82.9k| constexpr T lo1 = (static_cast(-1) / 255); 163| | // The constant 0x808080... as a T 164| 82.9k| constexpr T hi1 = lo1 << 7; 165| | // How many bits to shift in order to get the top byte 166| 82.9k| constexpr size_t bits = (sizeof(T) * 8) - 8; 167| | 168| 82.9k| return static_cast((((((v & hi1) - 1) & lo1) * lo1) >> bits) - 1); 169| 82.9k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmmmmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 1.24k|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 1.24k| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 1.24k, False: 0] ------------------ 39| 1.24k| return checked_add(r.value(), rest...); 40| 1.24k| } else { 41| 0| return {}; 42| 0| } 43| 1.24k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmmmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 1.24k|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 1.24k| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 1.24k, False: 0] ------------------ 39| 1.24k| return checked_add(r.value(), rest...); 40| 1.24k| } else { 41| 0| return {}; 42| 0| } 43| 1.24k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 1.24k|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 1.24k| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 1.24k, False: 0] ------------------ 39| 1.24k| return checked_add(r.value(), rest...); 40| 1.24k| } else { 41| 0| return {}; 42| 0| } 43| 1.24k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 1.24k|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 1.24k| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 1.24k, False: 0] ------------------ 39| 1.24k| return checked_add(r.value(), rest...); 40| 1.24k| } else { 41| 0| return {}; 42| 0| } 43| 1.24k|} _ZNK5Botan14KyberConstants1kEv: 81| 6| uint8_t k() const { return m_k; } _ZNK5Botan14KyberConstants23polynomial_vector_bytesEv: 99| 6| size_t polynomial_vector_bytes() const { return m_polynomial_vector_bytes; } _ZN5Botan14KyberConstantsC2EOS0_: 69| 3| KyberConstants(KyberConstants&& other) = default; _ZNK5Botan14KyberConstants3d_uEv: 87| 3| KyberDu d_u() const { return m_du; } _ZNK5Botan14KyberConstants3d_vEv: 89| 3| KyberDv d_v() const { return m_dv; } _ZNK5Botan14KyberConstants16public_key_bytesEv: 114| 6| size_t public_key_bytes() const { return polynomial_vector_bytes() + SEED_BYTES; } _ZN5Botan26Kyber_Symmetric_PrimitivesD2Ev: 32| 3| virtual ~Kyber_Symmetric_Primitives() = default; _ZN5Botan8store_leINS_6detail10AutoDetectEJmEEEDaDpOT0_: 736| 118k|inline constexpr auto store_le(ParamTs&&... params) { 737| 118k| return detail::store_any(std::forward(params)...); 738| 118k|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETpTkNS0_20unsigned_integralishEJmEQ10all_same_vIDpT1_EEEDaS6_: 696| 118k|inline constexpr auto store_any(Ts... ins) { 697| 118k| return store_any(std::array{ins...}); 698| 118k|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS_6ranges14spanable_rangeENS2_5arrayImLm1EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS8_Esr3stdE21default_initializableIS8_Esr8conceptsE21resizable_byte_bufferIS8_EEEDaOT1_: 663| 118k|inline constexpr auto store_any(InR&& in_range) { 664| 118k| auto out = []([[maybe_unused]] const auto& in) { 665| 118k| if constexpr(std::same_as) { 666| 118k| if constexpr(ranges::statically_spanable_range) { 667| 118k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 118k| return std::array(); 669| 118k| } else { 670| 118k| static_assert( 671| 118k| !std::same_as, 672| 118k| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 118k| } 674| 118k| } else if constexpr(concepts::resizable_byte_buffer) { 675| 118k| return OutR(std::span{in}.size_bytes()); 676| 118k| } else { 677| 118k| return OutR{}; 678| 118k| } 679| 118k| }(in_range); 680| | 681| 118k| store_any>(out, std::forward(in_range)); 682| 118k| return out; 683| 118k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS_6ranges14spanable_rangeENS2_5arrayImLm1EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS8_Esr3stdE21default_initializableIS8_Esr8conceptsE21resizable_byte_bufferIS8_EEEDaOT1_ENKUlRKT_E_clIS7_EEDaSD_: 664| 118k| auto out = []([[maybe_unused]] const auto& in) { 665| 118k| if constexpr(std::same_as) { 666| 118k| if constexpr(ranges::statically_spanable_range) { 667| 118k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 118k| return std::array(); 669| | } else { 670| | static_assert( 671| | !std::same_as, 672| | "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| | } 674| | } else if constexpr(concepts::resizable_byte_buffer) { 675| | return OutR(std::span{in}.size_bytes()); 676| | } else { 677| | return OutR{}; 678| | } 679| 118k| }(in_range); _ZN5Botan6detail9store_anyILNSt3__16endianE57005EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm8EEETkNS4_14spanable_rangeENS6_ImLm1EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_: 603| 118k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 118k| ranges::assert_equal_byte_lengths(out, in); 605| 118k| using element_type = std::ranges::range_value_t; 606| | 607| 118k| const auto store_elementwise = [&] { 608| 118k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 118k| std::span out_s(out); 610| 118k| for(const auto in_elem : in) { 611| 118k| store_any(out_s.template first(), in_elem); 612| 118k| out_s = out_s.subspan(bytes_per_element); 613| 118k| } 614| 118k| }; 615| | 616| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 617| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 618| | // in a `constexpr` context. 619| 118k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 118k] ------------------ 620| 0| store_elementwise(); 621| 118k| } else { 622| 118k| if constexpr(endianness == std::endian::native && !custom_storable) { 623| 118k| typecast_copy(out, in); 624| | } else { 625| | store_elementwise(); 626| | } 627| 118k| } 628| 118k|} _ZN5Botan6detail26unwrap_strong_type_or_enumITkNS0_20unsigned_integralishEmEEDaT_: 190| 136k|constexpr auto unwrap_strong_type_or_enum(InT t) { 191| | if constexpr(std::is_enum_v) { 192| | // TODO: C++23: use std::to_underlying(in) instead 193| | return static_cast>(t); 194| 136k| } else { 195| 136k| return Botan::unwrap_strong_type(t); 196| 136k| } 197| 136k|} _ZN5Botan8get_byteILm0EmEEhT0_QltT_stS1_: 81| 246|{ 82| 246| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 246| return static_cast((input >> shift) & 0xFF); 84| 246|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvS9_OT1_: 525| 266|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) { 526| 266| const auto in = detail::unwrap_strong_type_or_enum(wrapped_in); 527| 266| using InT = decltype(in); 528| 266| ranges::assert_exact_byte_length(out_range); 529| 266| const std::span out{out_range}; 530| | 531| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 532| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 533| | // in a `constexpr` context. 534| 266| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (534:7): [Folded, False: 266] ------------------ 535| 0| return fallback_store_any(in, std::forward(out_range)); 536| 266| } else { 537| | if constexpr(sizeof(InT) == 1) { 538| | out[0] = static_cast(in); 539| 266| } else if constexpr(endianness == std::endian::native) { 540| 266| typecast_copy(out, in); 541| | } else { 542| | static_assert(opposite(endianness) == std::endian::native); 543| | typecast_copy(out, reverse_bytes(in)); 544| | } 545| 266| } 546| 266|} _ZN5Botan8get_byteILm0EtEEhT0_QltT_stS1_: 81| 495k|{ 82| 495k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 495k| return static_cast((input >> shift) & 0xFF); 84| 495k|} _ZN5Botan8get_byteILm1EtEEhT0_QltT_stS1_: 81| 495k|{ 82| 495k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 495k| return static_cast((input >> shift) & 0xFF); 84| 495k|} _ZN5Botan12get_byte_varImEEhmT_: 69| 122k|inline constexpr uint8_t get_byte_var(size_t byte_num, T input) { 70| 122k| return static_cast(input >> (((~byte_num) & (sizeof(T) - 1)) << 3)); 71| 122k|} _ZN5Botan8store_beINS_6detail10AutoDetectEJRjRA4_hEEEDaDpOT0_: 745| 9|inline constexpr auto store_be(ParamTs&&... params) { 746| 9| return detail::store_any(std::forward(params)...); 747| 9|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEjQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvS6_Ph: 711| 9|inline constexpr void store_any(T in, uint8_t out[]) { 712| | // asserts that *out points to enough bytes to write into 713| 9| store_any(in, std::span(out, sizeof(T))); 714| 9|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEEQsr3stdE7same_asIS4_T0_EEEvT1_OT2_: 646| 9|inline constexpr void store_any(T in, OutR&& out_range) { 647| 9| store_any(in, std::forward(out_range)); 648| 9|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvS9_OT1_: 525| 499k|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) { 526| 499k| const auto in = detail::unwrap_strong_type_or_enum(wrapped_in); 527| 499k| using InT = decltype(in); 528| 499k| ranges::assert_exact_byte_length(out_range); 529| 499k| const std::span out{out_range}; 530| | 531| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 532| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 533| | // in a `constexpr` context. 534| 499k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (534:7): [Folded, False: 499k] ------------------ 535| 0| return fallback_store_any(in, std::forward(out_range)); 536| 499k| } else { 537| | if constexpr(sizeof(InT) == 1) { 538| | out[0] = static_cast(in); 539| | } else if constexpr(endianness == std::endian::native) { 540| | typecast_copy(out, in); 541| 499k| } else { 542| 499k| static_assert(opposite(endianness) == std::endian::native); 543| 499k| typecast_copy(out, reverse_bytes(in)); 544| 499k| } 545| 499k| } 546| 499k|} _ZN5Botan6detail26unwrap_strong_type_or_enumITkNS0_20unsigned_integralishEjEEDaT_: 190| 499k|constexpr auto unwrap_strong_type_or_enum(InT t) { 191| | if constexpr(std::is_enum_v) { 192| | // TODO: C++23: use std::to_underlying(in) instead 193| | return static_cast>(t); 194| 499k| } else { 195| 499k| return Botan::unwrap_strong_type(t); 196| 499k| } 197| 499k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEmQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvS6_Ph: 711| 101k|inline constexpr void store_any(T in, uint8_t out[]) { 712| | // asserts that *out points to enough bytes to write into 713| 101k| store_any(in, std::span(out, sizeof(T))); 714| 101k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEEQsr3stdE7same_asIS4_T0_EEEvT1_OT2_: 646| 101k|inline constexpr void store_any(T in, OutR&& out_range) { 647| 101k| store_any(in, std::forward(out_range)); 648| 101k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvS9_OT1_: 525| 136k|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) { 526| 136k| const auto in = detail::unwrap_strong_type_or_enum(wrapped_in); 527| 136k| using InT = decltype(in); 528| 136k| ranges::assert_exact_byte_length(out_range); 529| 136k| const std::span out{out_range}; 530| | 531| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 532| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 533| | // in a `constexpr` context. 534| 136k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (534:7): [Folded, False: 136k] ------------------ 535| 0| return fallback_store_any(in, std::forward(out_range)); 536| 136k| } else { 537| | if constexpr(sizeof(InT) == 1) { 538| | out[0] = static_cast(in); 539| | } else if constexpr(endianness == std::endian::native) { 540| | typecast_copy(out, in); 541| 136k| } else { 542| 136k| static_assert(opposite(endianness) == std::endian::native); 543| 136k| typecast_copy(out, reverse_bytes(in)); 544| 136k| } 545| 136k| } 546| 136k|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS0_20unsigned_integralishEmQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvS6_Ph: 711| 266|inline constexpr void store_any(T in, uint8_t out[]) { 712| | // asserts that *out points to enough bytes to write into 713| 266| store_any(in, std::span(out, sizeof(T))); 714| 266|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEEQsr3stdE7same_asIS4_T0_EEEvT1_OT2_: 646| 266|inline constexpr void store_any(T in, OutR&& out_range) { 647| 266| store_any(in, std::forward(out_range)); 648| 266|} _ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEjTkNSt3__117unsigned_integralEjEEDaT0_: 200| 547|constexpr auto wrap_strong_type_or_enum(T t) { 201| | if constexpr(std::is_enum_v) { 202| | return static_cast(t); 203| 547| } else { 204| 547| return Botan::wrap_strong_type(t); 205| 547| } 206| 547|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm4EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 541|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 541| using OutT = detail::wrapped_type; 280| 541| ranges::assert_exact_byte_length(in_range); 281| | 282| 541| return detail::wrap_strong_type_or_enum([&]() -> OutT { 283| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 284| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 285| | // in a `constexpr` context. 286| 541| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 541| return fallback_load_any(std::forward(in_range)); 288| 541| } else { 289| 541| const std::span in{in_range}; 290| 541| if constexpr(sizeof(OutT) == 1) { 291| 541| return static_cast(in[0]); 292| 541| } else if constexpr(endianness == std::endian::native) { 293| 541| return typecast_copy(in); 294| 541| } else { 295| 541| static_assert(opposite(endianness) == std::endian::native); 296| 541| return reverse_bytes(typecast_copy(in)); 297| 541| } 298| 541| } 299| 541| }()); 300| 541|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm4EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 541| return detail::wrap_strong_type_or_enum([&]() -> OutT { 283| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 284| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 285| | // in a `constexpr` context. 286| 541| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 541] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 541| } else { 289| 541| const std::span in{in_range}; 290| | if constexpr(sizeof(OutT) == 1) { 291| | return static_cast(in[0]); 292| | } else if constexpr(endianness == std::endian::native) { 293| | return typecast_copy(in); 294| 541| } else { 295| 541| static_assert(opposite(endianness) == std::endian::native); 296| 541| return reverse_bytes(typecast_copy(in)); 297| 541| } 298| 541| } 299| 541| }()); _ZN5Botan8store_beINS_6detail10AutoDetectEJRKmPhEEEDaDpOT0_: 745| 101k|inline constexpr auto store_be(ParamTs&&... params) { 746| 101k| return detail::store_any(std::forward(params)...); 747| 101k|} _ZN5Botan11copy_out_beITkNS_6ranges14spanable_rangeENSt3__16vectorIjNS_16secure_allocatorIjEEEEEEvNS2_4spanIhLm18446744073709551615EEERKT_: 773| 76.7k|inline void copy_out_be(std::span out, const InR& in) { 774| 76.7k| using T = std::ranges::range_value_t; 775| 76.7k| std::span in_s{in}; 776| 76.7k| const auto remaining_bytes = detail::copy_out_any_word_aligned_portion(out, in_s); 777| | 778| | // copy remaining bytes as a partial word 779| 76.7k| for(size_t i = 0; i < remaining_bytes; ++i) { ------------------ | Branch (779:22): [True: 0, False: 76.7k] ------------------ 780| 0| out[i] = get_byte_var(i, in_s.front()); 781| 0| } 782| 76.7k|} _ZN5Botan6detail33copy_out_any_word_aligned_portionILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjEEmRNS2_4spanIhLm18446744073709551615EEERNS4_IKT0_Lm18446744073709551615EEE: 752| 76.7k|inline size_t copy_out_any_word_aligned_portion(std::span& out, std::span& in) { 753| 76.7k| const size_t full_words = out.size() / sizeof(T); 754| 76.7k| const size_t full_word_bytes = full_words * sizeof(T); 755| 76.7k| const size_t remaining_bytes = out.size() - full_word_bytes; 756| 76.7k| BOTAN_ASSERT_NOMSG(in.size_bytes() >= full_word_bytes + remaining_bytes); ------------------ | | 84| 76.7k| do { \ | | 85| 76.7k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 76.7k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 76.7k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 76.7k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 76.7k] | | ------------------ ------------------ 757| | 758| | // copy full words 759| 76.7k| store_any(out.first(full_word_bytes), in.first(full_words)); 760| 76.7k| out = out.subspan(full_word_bytes); 761| 76.7k| in = in.subspan(full_words); 762| | 763| 76.7k| return remaining_bytes; 764| 76.7k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206EjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm18446744073709551615EEETkNS4_14spanable_rangeENS6_IKjLm18446744073709551615EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_: 603| 76.7k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 76.7k| ranges::assert_equal_byte_lengths(out, in); 605| 76.7k| using element_type = std::ranges::range_value_t; 606| | 607| 76.7k| const auto store_elementwise = [&] { 608| 76.7k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 76.7k| std::span out_s(out); 610| 76.7k| for(const auto in_elem : in) { 611| 76.7k| store_any(out_s.template first(), in_elem); 612| 76.7k| out_s = out_s.subspan(bytes_per_element); 613| 76.7k| } 614| 76.7k| }; 615| | 616| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 617| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 618| | // in a `constexpr` context. 619| 76.7k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 76.7k] ------------------ 620| 0| store_elementwise(); 621| 76.7k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 76.7k| } else { 625| 76.7k| store_elementwise(); 626| 76.7k| } 627| 76.7k| } 628| 76.7k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm18446744073709551615EEETkNS4_14spanable_rangeENS6_IKjLm18446744073709551615EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_ENKUlvE_clEv: 607| 76.7k| const auto store_elementwise = [&] { 608| 76.7k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 76.7k| std::span out_s(out); 610| 499k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 499k, False: 76.7k] ------------------ 611| 499k| store_any(out_s.template first(), in_elem); 612| 499k| out_s = out_s.subspan(bytes_per_element); 613| 499k| } 614| 76.7k| }; _ZN5Botan6detail9store_anyILNSt3__16endianE64206EjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEETpTkNS0_20unsigned_integralishEJjEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_: 582| 499k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, Ts... ins) { 583| 499k| ranges::assert_exact_byte_length<(sizeof(Ts) + ...)>(out); 584| 499k| auto store_one = [off = 0](auto o, T i) mutable { 585| 499k| store_any(i, o.subspan(off).template first()); 586| 499k| off += sizeof(T); 587| 499k| }; 588| | 589| 499k| (store_one(std::span{out}, ins), ...); 590| 499k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEETpTkNS0_20unsigned_integralishEJjEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_ENUlTyS9_T_E_clIjS7_EEDaS9_SE_: 584| 499k| auto store_one = [off = 0](auto o, T i) mutable { 585| 499k| store_any(i, o.subspan(off).template first()); 586| 499k| off += sizeof(T); 587| 499k| }; _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 94.6k|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 94.6k| using OutT = detail::wrapped_type; 280| 94.6k| ranges::assert_exact_byte_length(in_range); 281| | 282| 94.6k| return detail::wrap_strong_type_or_enum([&]() -> OutT { 283| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 284| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 285| | // in a `constexpr` context. 286| 94.6k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 94.6k| return fallback_load_any(std::forward(in_range)); 288| 94.6k| } else { 289| 94.6k| const std::span in{in_range}; 290| 94.6k| if constexpr(sizeof(OutT) == 1) { 291| 94.6k| return static_cast(in[0]); 292| 94.6k| } else if constexpr(endianness == std::endian::native) { 293| 94.6k| return typecast_copy(in); 294| 94.6k| } else { 295| 94.6k| static_assert(opposite(endianness) == std::endian::native); 296| 94.6k| return reverse_bytes(typecast_copy(in)); 297| 94.6k| } 298| 94.6k| } 299| 94.6k| }()); 300| 94.6k|} _ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEmTkNSt3__117unsigned_integralEmEEDaT0_: 200| 118k|constexpr auto wrap_strong_type_or_enum(T t) { 201| | if constexpr(std::is_enum_v) { 202| | return static_cast(t); 203| 118k| } else { 204| 118k| return Botan::wrap_strong_type(t); 205| 118k| } 206| 118k|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 94.6k| return detail::wrap_strong_type_or_enum([&]() -> OutT { 283| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 284| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 285| | // in a `constexpr` context. 286| 94.6k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 94.6k] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 94.6k| } else { 289| 94.6k| const std::span in{in_range}; 290| | if constexpr(sizeof(OutT) == 1) { 291| | return static_cast(in[0]); 292| | } else if constexpr(endianness == std::endian::native) { 293| | return typecast_copy(in); 294| 94.6k| } else { 295| 94.6k| static_assert(opposite(endianness) == std::endian::native); 296| 94.6k| return reverse_bytes(typecast_copy(in)); 297| 94.6k| } 298| 94.6k| } 299| 94.6k| }()); _ZN5Botan11copy_out_beITkNS_6ranges14spanable_rangeENSt3__16vectorImNS_16secure_allocatorImEEEEEEvNS2_4spanIhLm18446744073709551615EEERKT_: 773| 429|inline void copy_out_be(std::span out, const InR& in) { 774| 429| using T = std::ranges::range_value_t; 775| 429| std::span in_s{in}; 776| 429| const auto remaining_bytes = detail::copy_out_any_word_aligned_portion(out, in_s); 777| | 778| | // copy remaining bytes as a partial word 779| 429| for(size_t i = 0; i < remaining_bytes; ++i) { ------------------ | Branch (779:22): [True: 0, False: 429] ------------------ 780| 0| out[i] = get_byte_var(i, in_s.front()); 781| 0| } 782| 429|} _ZN5Botan6detail33copy_out_any_word_aligned_portionILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmEEmRNS2_4spanIhLm18446744073709551615EEERNS4_IKT0_Lm18446744073709551615EEE: 752| 429|inline size_t copy_out_any_word_aligned_portion(std::span& out, std::span& in) { 753| 429| const size_t full_words = out.size() / sizeof(T); 754| 429| const size_t full_word_bytes = full_words * sizeof(T); 755| 429| const size_t remaining_bytes = out.size() - full_word_bytes; 756| 429| BOTAN_ASSERT_NOMSG(in.size_bytes() >= full_word_bytes + remaining_bytes); ------------------ | | 84| 429| do { \ | | 85| 429| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 429| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 429] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 429| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 429] | | ------------------ ------------------ 757| | 758| | // copy full words 759| 429| store_any(out.first(full_word_bytes), in.first(full_words)); 760| 429| out = out.subspan(full_word_bytes); 761| 429| in = in.subspan(full_words); 762| | 763| 429| return remaining_bytes; 764| 429|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm18446744073709551615EEETkNS4_14spanable_rangeENS6_IKmLm18446744073709551615EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_: 603| 429|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 429| ranges::assert_equal_byte_lengths(out, in); 605| 429| using element_type = std::ranges::range_value_t; 606| | 607| 429| const auto store_elementwise = [&] { 608| 429| constexpr size_t bytes_per_element = sizeof(element_type); 609| 429| std::span out_s(out); 610| 429| for(const auto in_elem : in) { 611| 429| store_any(out_s.template first(), in_elem); 612| 429| out_s = out_s.subspan(bytes_per_element); 613| 429| } 614| 429| }; 615| | 616| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 617| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 618| | // in a `constexpr` context. 619| 429| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 429] ------------------ 620| 0| store_elementwise(); 621| 429| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 429| } else { 625| 429| store_elementwise(); 626| 429| } 627| 429| } 628| 429|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm18446744073709551615EEETkNS4_14spanable_rangeENS6_IKmLm18446744073709551615EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_ENKUlvE_clEv: 607| 429| const auto store_elementwise = [&] { 608| 429| constexpr size_t bytes_per_element = sizeof(element_type); 609| 429| std::span out_s(out); 610| 2.68k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 2.68k, False: 429] ------------------ 611| 2.68k| store_any(out_s.template first(), in_elem); 612| 2.68k| out_s = out_s.subspan(bytes_per_element); 613| 2.68k| } 614| 429| }; _ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEETpTkNS0_20unsigned_integralishEJmEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_: 582| 34.7k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, Ts... ins) { 583| 34.7k| ranges::assert_exact_byte_length<(sizeof(Ts) + ...)>(out); 584| 34.7k| auto store_one = [off = 0](auto o, T i) mutable { 585| 34.7k| store_any(i, o.subspan(off).template first()); 586| 34.7k| off += sizeof(T); 587| 34.7k| }; 588| | 589| 34.7k| (store_one(std::span{out}, ins), ...); 590| 34.7k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEETpTkNS0_20unsigned_integralishEJmEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_ENUlTyS9_T_E_clImS7_EEDaS9_SE_: 584| 34.7k| auto store_one = [off = 0](auto o, T i) mutable { 585| 34.7k| store_any(i, o.subspan(off).template first()); 586| 34.7k| off += sizeof(T); 587| 34.7k| }; _ZN5Botan8store_leINS_6detail10AutoDetectEJRmPhEEEDaDpOT0_: 736| 266|inline constexpr auto store_le(ParamTs&&... params) { 737| 266| return detail::store_any(std::forward(params)...); 738| 266|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmEET0_PKhm: 454| 44.5k|inline constexpr OutT load_any(const uint8_t in[], size_t off) { 455| | // asserts that *in points to enough bytes to read at offset off 456| 44.5k| constexpr size_t out_size = sizeof(OutT); 457| 44.5k| return load_any(std::span(in + off * out_size, out_size)); 458| 44.5k|} _ZN5Botan7load_beImJNSt3__14spanIKhLm8EEEEEEDaDpOT0_: 504| 50.0k|inline constexpr auto load_be(ParamTs&&... params) { 505| 50.0k| return detail::load_any(std::forward(params)...); 506| 50.0k|} _ZN5Botan7load_beImJRNSt3__15arrayIhLm8EEEEEEDaDpOT0_: 504| 24.1k|inline constexpr auto load_be(ParamTs&&... params) { 505| 24.1k| return detail::load_any(std::forward(params)...); 506| 24.1k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEERNS2_5arrayIhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 24.1k|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 24.1k| using OutT = detail::wrapped_type; 280| 24.1k| ranges::assert_exact_byte_length(in_range); 281| | 282| 24.1k| return detail::wrap_strong_type_or_enum([&]() -> OutT { 283| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 284| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 285| | // in a `constexpr` context. 286| 24.1k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 24.1k| return fallback_load_any(std::forward(in_range)); 288| 24.1k| } else { 289| 24.1k| const std::span in{in_range}; 290| 24.1k| if constexpr(sizeof(OutT) == 1) { 291| 24.1k| return static_cast(in[0]); 292| 24.1k| } else if constexpr(endianness == std::endian::native) { 293| 24.1k| return typecast_copy(in); 294| 24.1k| } else { 295| 24.1k| static_assert(opposite(endianness) == std::endian::native); 296| 24.1k| return reverse_bytes(typecast_copy(in)); 297| 24.1k| } 298| 24.1k| } 299| 24.1k| }()); 300| 24.1k|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEERNS2_5arrayIhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 24.1k| return detail::wrap_strong_type_or_enum([&]() -> OutT { 283| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 284| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 285| | // in a `constexpr` context. 286| 24.1k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 24.1k] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 24.1k| } else { 289| 24.1k| const std::span in{in_range}; 290| | if constexpr(sizeof(OutT) == 1) { 291| | return static_cast(in[0]); 292| | } else if constexpr(endianness == std::endian::native) { 293| | return typecast_copy(in); 294| 24.1k| } else { 295| 24.1k| static_assert(opposite(endianness) == std::endian::native); 296| 24.1k| return reverse_bytes(typecast_copy(in)); 297| 24.1k| } 298| 24.1k| } 299| 24.1k| }()); _ZN5Botan7load_beItJPKhRmEEEDaDpOT0_: 504| 7.14k|inline constexpr auto load_be(ParamTs&&... params) { 505| 7.14k| return detail::load_any(std::forward(params)...); 506| 7.14k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEtEET0_PKhm: 454| 7.14k|inline constexpr OutT load_any(const uint8_t in[], size_t off) { 455| | // asserts that *in points to enough bytes to read at offset off 456| 7.14k| constexpr size_t out_size = sizeof(OutT); 457| 7.14k| return load_any(std::span(in + off * out_size, out_size)); 458| 7.14k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEtTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm2EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 7.14k|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 7.14k| using OutT = detail::wrapped_type; 280| 7.14k| ranges::assert_exact_byte_length(in_range); 281| | 282| 7.14k| return detail::wrap_strong_type_or_enum([&]() -> OutT { 283| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 284| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 285| | // in a `constexpr` context. 286| 7.14k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 7.14k| return fallback_load_any(std::forward(in_range)); 288| 7.14k| } else { 289| 7.14k| const std::span in{in_range}; 290| 7.14k| if constexpr(sizeof(OutT) == 1) { 291| 7.14k| return static_cast(in[0]); 292| 7.14k| } else if constexpr(endianness == std::endian::native) { 293| 7.14k| return typecast_copy(in); 294| 7.14k| } else { 295| 7.14k| static_assert(opposite(endianness) == std::endian::native); 296| 7.14k| return reverse_bytes(typecast_copy(in)); 297| 7.14k| } 298| 7.14k| } 299| 7.14k| }()); 300| 7.14k|} _ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEtTkNSt3__117unsigned_integralEtEEDaT0_: 200| 7.14k|constexpr auto wrap_strong_type_or_enum(T t) { 201| | if constexpr(std::is_enum_v) { 202| | return static_cast(t); 203| 7.14k| } else { 204| 7.14k| return Botan::wrap_strong_type(t); 205| 7.14k| } 206| 7.14k|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEtTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm2EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 7.14k| return detail::wrap_strong_type_or_enum([&]() -> OutT { 283| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 284| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 285| | // in a `constexpr` context. 286| 7.14k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 7.14k] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 7.14k| } else { 289| 7.14k| const std::span in{in_range}; 290| | if constexpr(sizeof(OutT) == 1) { 291| | return static_cast(in[0]); 292| | } else if constexpr(endianness == std::endian::native) { 293| | return typecast_copy(in); 294| 7.14k| } else { 295| 7.14k| static_assert(opposite(endianness) == std::endian::native); 296| 7.14k| return reverse_bytes(typecast_copy(in)); 297| 7.14k| } 298| 7.14k| } 299| 7.14k| }()); _ZN5Botan7load_beIjJPKhRmEEEDaDpOT0_: 504| 244|inline constexpr auto load_be(ParamTs&&... params) { 505| 244| return detail::load_any(std::forward(params)...); 506| 244|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjEET0_PKhm: 454| 541|inline constexpr OutT load_any(const uint8_t in[], size_t off) { 455| | // asserts that *in points to enough bytes to read at offset off 456| 541| constexpr size_t out_size = sizeof(OutT); 457| 541| return load_any(std::span(in + off * out_size, out_size)); 458| 541|} _ZN5Botan7load_beIjJRNSt3__14spanIKhLm4EEEEEEDaDpOT0_: 504| 6|inline constexpr auto load_be(ParamTs&&... params) { 505| 6| return detail::load_any(std::forward(params)...); 506| 6|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges16contiguous_rangeIhEERNS2_4spanIKhLm4EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESB_OT1_: 278| 6|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 6| using OutT = detail::wrapped_type; 280| 6| ranges::assert_exact_byte_length(in_range); 281| | 282| 6| return detail::wrap_strong_type_or_enum([&]() -> OutT { 283| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 284| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 285| | // in a `constexpr` context. 286| 6| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 6| return fallback_load_any(std::forward(in_range)); 288| 6| } else { 289| 6| const std::span in{in_range}; 290| 6| if constexpr(sizeof(OutT) == 1) { 291| 6| return static_cast(in[0]); 292| 6| } else if constexpr(endianness == std::endian::native) { 293| 6| return typecast_copy(in); 294| 6| } else { 295| 6| static_assert(opposite(endianness) == std::endian::native); 296| 6| return reverse_bytes(typecast_copy(in)); 297| 6| } 298| 6| } 299| 6| }()); 300| 6|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges16contiguous_rangeIhEERNS2_4spanIKhLm4EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESB_OT1_ENKUlvE_clEv: 282| 6| return detail::wrap_strong_type_or_enum([&]() -> OutT { 283| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 284| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 285| | // in a `constexpr` context. 286| 6| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 6] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 6| } else { 289| 6| const std::span in{in_range}; 290| | if constexpr(sizeof(OutT) == 1) { 291| | return static_cast(in[0]); 292| | } else if constexpr(endianness == std::endian::native) { 293| | return typecast_copy(in); 294| 6| } else { 295| 6| static_assert(opposite(endianness) == std::endian::native); 296| 6| return reverse_bytes(typecast_copy(in)); 297| 6| } 298| 6| } 299| 6| }()); _ZN5Botan8store_beINS_6detail10AutoDetectEJRKjRNSt3__15arrayIhLm4EEEEEEDaDpOT0_: 745| 6|inline constexpr auto store_be(ParamTs&&... params) { 746| 6| return detail::store_any(std::forward(params)...); 747| 6|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEjTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm4EEEQsr3stdE7same_asIS4_T0_EEEvT1_OT2_: 646| 6|inline constexpr void store_any(T in, OutR&& out_range) { 647| 6| store_any(in, std::forward(out_range)); 648| 6|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm4EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvSA_OT1_: 525| 6|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) { 526| 6| const auto in = detail::unwrap_strong_type_or_enum(wrapped_in); 527| 6| using InT = decltype(in); 528| 6| ranges::assert_exact_byte_length(out_range); 529| 6| const std::span out{out_range}; 530| | 531| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 532| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 533| | // in a `constexpr` context. 534| 6| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (534:7): [Folded, False: 6] ------------------ 535| 0| return fallback_store_any(in, std::forward(out_range)); 536| 6| } else { 537| | if constexpr(sizeof(InT) == 1) { 538| | out[0] = static_cast(in); 539| | } else if constexpr(endianness == std::endian::native) { 540| | typecast_copy(out, in); 541| 6| } else { 542| 6| static_assert(opposite(endianness) == std::endian::native); 543| 6| typecast_copy(out, reverse_bytes(in)); 544| 6| } 545| 6| } 546| 6|} _ZN5Botan7load_beIjJPKhiEEEDaDpOT0_: 504| 297|inline constexpr auto load_be(ParamTs&&... params) { 505| 297| return detail::load_any(std::forward(params)...); 506| 297|} _ZN5Botan7load_beImJPKhmEEEDaDpOT0_: 504| 44.5k|inline constexpr auto load_be(ParamTs&&... params) { 505| 44.5k| return detail::load_any(std::forward(params)...); 506| 44.5k|} _ZN5Botan8store_beINS_6detail10AutoDetectEJRNSt3__14spanIhLm48EEERNS3_5arrayImLm6EEEEEEDaDpOT0_: 745| 1.50k|inline constexpr auto store_be(ParamTs&&... params) { 746| 1.50k| return detail::store_any(std::forward(params)...); 747| 1.50k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeIhEERNS2_4spanIhLm48EEETkNS5_14spanable_rangeENS2_5arrayImLm6EEEQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asISC_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISK_EESL_E4type10value_typeEEEEvOT1_RKSH_: 603| 1.50k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 1.50k| ranges::assert_equal_byte_lengths(out, in); 605| 1.50k| using element_type = std::ranges::range_value_t; 606| | 607| 1.50k| const auto store_elementwise = [&] { 608| 1.50k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 1.50k| std::span out_s(out); 610| 1.50k| for(const auto in_elem : in) { 611| 1.50k| store_any(out_s.template first(), in_elem); 612| 1.50k| out_s = out_s.subspan(bytes_per_element); 613| 1.50k| } 614| 1.50k| }; 615| | 616| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 617| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 618| | // in a `constexpr` context. 619| 1.50k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 1.50k] ------------------ 620| 0| store_elementwise(); 621| 1.50k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 1.50k| } else { 625| 1.50k| store_elementwise(); 626| 1.50k| } 627| 1.50k| } 628| 1.50k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeIhEERNS2_4spanIhLm48EEETkNS5_14spanable_rangeENS2_5arrayImLm6EEEQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asISC_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISK_EESL_E4type10value_typeEEEEvOT1_RKSH_ENKUlvE_clEv: 607| 1.50k| const auto store_elementwise = [&] { 608| 1.50k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 1.50k| std::span out_s(out); 610| 9.01k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 9.01k, False: 1.50k] ------------------ 611| 9.01k| store_any(out_s.template first(), in_elem); 612| 9.01k| out_s = out_s.subspan(bytes_per_element); 613| 9.01k| } 614| 1.50k| }; _ZN5Botan8store_beINS_6detail10AutoDetectEJRNSt3__15arrayImLm9EEEEEEDaDpOT0_: 745| 2.44k|inline constexpr auto store_be(ParamTs&&... params) { 746| 2.44k| return detail::store_any(std::forward(params)...); 747| 2.44k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeERNS2_5arrayImLm9EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS9_Esr3stdE21default_initializableIS9_Esr8conceptsE21resizable_byte_bufferIS9_EEEDaOT1_: 663| 2.44k|inline constexpr auto store_any(InR&& in_range) { 664| 2.44k| auto out = []([[maybe_unused]] const auto& in) { 665| 2.44k| if constexpr(std::same_as) { 666| 2.44k| if constexpr(ranges::statically_spanable_range) { 667| 2.44k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 2.44k| return std::array(); 669| 2.44k| } else { 670| 2.44k| static_assert( 671| 2.44k| !std::same_as, 672| 2.44k| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 2.44k| } 674| 2.44k| } else if constexpr(concepts::resizable_byte_buffer) { 675| 2.44k| return OutR(std::span{in}.size_bytes()); 676| 2.44k| } else { 677| 2.44k| return OutR{}; 678| 2.44k| } 679| 2.44k| }(in_range); 680| | 681| 2.44k| store_any>(out, std::forward(in_range)); 682| 2.44k| return out; 683| 2.44k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeERNS2_5arrayImLm9EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS9_Esr3stdE21default_initializableIS9_Esr8conceptsE21resizable_byte_bufferIS9_EEEDaOT1_ENKUlRKT_E_clIS7_EEDaSE_: 664| 2.44k| auto out = []([[maybe_unused]] const auto& in) { 665| 2.44k| if constexpr(std::same_as) { 666| 2.44k| if constexpr(ranges::statically_spanable_range) { 667| 2.44k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 2.44k| return std::array(); 669| | } else { 670| | static_assert( 671| | !std::same_as, 672| | "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| | } 674| | } else if constexpr(concepts::resizable_byte_buffer) { 675| | return OutR(std::span{in}.size_bytes()); 676| | } else { 677| | return OutR{}; 678| | } 679| 2.44k| }(in_range); _ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm72EEETkNS4_14spanable_rangeENS6_ImLm9EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_: 603| 2.44k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 2.44k| ranges::assert_equal_byte_lengths(out, in); 605| 2.44k| using element_type = std::ranges::range_value_t; 606| | 607| 2.44k| const auto store_elementwise = [&] { 608| 2.44k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 2.44k| std::span out_s(out); 610| 2.44k| for(const auto in_elem : in) { 611| 2.44k| store_any(out_s.template first(), in_elem); 612| 2.44k| out_s = out_s.subspan(bytes_per_element); 613| 2.44k| } 614| 2.44k| }; 615| | 616| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 617| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 618| | // in a `constexpr` context. 619| 2.44k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 2.44k] ------------------ 620| 0| store_elementwise(); 621| 2.44k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 2.44k| } else { 625| 2.44k| store_elementwise(); 626| 2.44k| } 627| 2.44k| } 628| 2.44k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm72EEETkNS4_14spanable_rangeENS6_ImLm9EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_ENKUlvE_clEv: 607| 2.44k| const auto store_elementwise = [&] { 608| 2.44k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 2.44k| std::span out_s(out); 610| 22.0k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 22.0k, False: 2.44k] ------------------ 611| 22.0k| store_any(out_s.template first(), in_elem); 612| 22.0k| out_s = out_s.subspan(bytes_per_element); 613| 22.0k| } 614| 2.44k| }; _ZN5Botan8store_beINS_6detail10AutoDetectEJRNSt3__15arrayImLm4EEEEEEDaDpOT0_: 745| 270|inline constexpr auto store_be(ParamTs&&... params) { 746| 270| return detail::store_any(std::forward(params)...); 747| 270|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeERNS2_5arrayImLm4EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS9_Esr3stdE21default_initializableIS9_Esr8conceptsE21resizable_byte_bufferIS9_EEEDaOT1_: 663| 270|inline constexpr auto store_any(InR&& in_range) { 664| 270| auto out = []([[maybe_unused]] const auto& in) { 665| 270| if constexpr(std::same_as) { 666| 270| if constexpr(ranges::statically_spanable_range) { 667| 270| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 270| return std::array(); 669| 270| } else { 670| 270| static_assert( 671| 270| !std::same_as, 672| 270| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 270| } 674| 270| } else if constexpr(concepts::resizable_byte_buffer) { 675| 270| return OutR(std::span{in}.size_bytes()); 676| 270| } else { 677| 270| return OutR{}; 678| 270| } 679| 270| }(in_range); 680| | 681| 270| store_any>(out, std::forward(in_range)); 682| 270| return out; 683| 270|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeERNS2_5arrayImLm4EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS9_Esr3stdE21default_initializableIS9_Esr8conceptsE21resizable_byte_bufferIS9_EEEDaOT1_ENKUlRKT_E_clIS7_EEDaSE_: 664| 270| auto out = []([[maybe_unused]] const auto& in) { 665| 270| if constexpr(std::same_as) { 666| 270| if constexpr(ranges::statically_spanable_range) { 667| 270| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 270| return std::array(); 669| | } else { 670| | static_assert( 671| | !std::same_as, 672| | "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| | } 674| | } else if constexpr(concepts::resizable_byte_buffer) { 675| | return OutR(std::span{in}.size_bytes()); 676| | } else { 677| | return OutR{}; 678| | } 679| 270| }(in_range); _ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm32EEETkNS4_14spanable_rangeENS6_ImLm4EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_: 603| 270|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 270| ranges::assert_equal_byte_lengths(out, in); 605| 270| using element_type = std::ranges::range_value_t; 606| | 607| 270| const auto store_elementwise = [&] { 608| 270| constexpr size_t bytes_per_element = sizeof(element_type); 609| 270| std::span out_s(out); 610| 270| for(const auto in_elem : in) { 611| 270| store_any(out_s.template first(), in_elem); 612| 270| out_s = out_s.subspan(bytes_per_element); 613| 270| } 614| 270| }; 615| | 616| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 617| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 618| | // in a `constexpr` context. 619| 270| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 270] ------------------ 620| 0| store_elementwise(); 621| 270| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 270| } else { 625| 270| store_elementwise(); 626| 270| } 627| 270| } 628| 270|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm32EEETkNS4_14spanable_rangeENS6_ImLm4EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_ENKUlvE_clEv: 607| 270| const auto store_elementwise = [&] { 608| 270| constexpr size_t bytes_per_element = sizeof(element_type); 609| 270| std::span out_s(out); 610| 1.08k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 1.08k, False: 270] ------------------ 611| 1.08k| store_any(out_s.template first(), in_elem); 612| 1.08k| out_s = out_s.subspan(bytes_per_element); 613| 1.08k| } 614| 270| }; _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EEC2Ev: 42| 9.56k| MerkleDamgard_Hash() { clear(); } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE5clearEv: 70| 47.7k| void clear() { 71| 47.7k| MD::init(m_digest); 72| 47.7k| m_buffer.clear(); 73| 47.7k| m_count = 0; 74| 47.7k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_224EEC2Ev: 42| 174| MerkleDamgard_Hash() { clear(); } _ZN5Botan18MerkleDamgard_HashINS_7SHA_224EE5clearEv: 70| 261| void clear() { 71| 261| MD::init(m_digest); 72| 261| m_buffer.clear(); 73| 261| m_count = 0; 74| 261| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EEC2Ev: 42| 10.0k| MerkleDamgard_Hash() { clear(); } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE5clearEv: 70| 48.5k| void clear() { 71| 48.5k| MD::init(m_digest); 72| 48.5k| m_buffer.clear(); 73| 48.5k| m_count = 0; 74| 48.5k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EEC2Ev: 42| 376| MerkleDamgard_Hash() { clear(); } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE5clearEv: 70| 752| void clear() { 71| 752| MD::init(m_digest); 72| 752| m_buffer.clear(); 73| 752| m_count = 0; 74| 752| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EEC2Ev: 42| 86| MerkleDamgard_Hash() { clear(); } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EE5clearEv: 70| 139| void clear() { 71| 139| MD::init(m_digest); 72| 139| m_buffer.clear(); 73| 139| m_count = 0; 74| 139| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE6updateENSt3__14spanIKhLm18446744073709551615EEE: 44| 38.1k| void update(std::span input) { 45| 38.1k| BufferSlicer in(input); 46| | 47| 100k| while(!in.empty()) { ------------------ | Branch (47:16): [True: 62.7k, False: 38.1k] ------------------ 48| 62.7k| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (48:27): [True: 14, False: 62.7k] ------------------ 49| 14| MD::compress_n(m_digest, one_block.value(), 1); 50| 14| } 51| | 52| 62.7k| if(m_buffer.in_alignment()) { ------------------ | Branch (52:16): [True: 24.5k, False: 38.1k] ------------------ 53| 24.5k| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 54| 24.5k| if(full_blocks > 0) { ------------------ | Branch (54:19): [True: 24.5k, False: 0] ------------------ 55| 24.5k| MD::compress_n(m_digest, aligned_data, full_blocks); 56| 24.5k| } 57| 24.5k| } 58| 62.7k| } 59| | 60| 38.1k| m_count += input.size(); 61| 38.1k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE5finalENSt3__14spanIhLm18446744073709551615EEE: 63| 38.1k| void final(std::span output) { 64| 38.1k| append_padding_bit(); 65| 38.1k| append_counter_and_finalize(); 66| 38.1k| copy_output(output); 67| 38.1k| clear(); 68| 38.1k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE18append_padding_bitEv: 77| 38.1k| void append_padding_bit() { 78| 38.1k| BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume()); ------------------ | | 84| 38.1k| do { \ | | 85| 38.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 38.1k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 38.1k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 38.1k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 38.1k] | | ------------------ ------------------ 79| 38.1k| if constexpr(MD::bit_endianness == MD_Endian::Big) { 80| 38.1k| const uint8_t final_byte = 0x80; 81| 38.1k| m_buffer.append({&final_byte, 1}); 82| | } else { 83| | const uint8_t final_byte = 0x01; 84| | m_buffer.append({&final_byte, 1}); 85| | } 86| 38.1k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE27append_counter_and_finalizeEv: 88| 38.1k| void append_counter_and_finalize() { 89| | // Compress the remaining data if the final data block does not provide 90| | // enough space for the counter bytes. 91| 38.1k| if(m_buffer.elements_until_alignment() < MD::ctr_bytes) { ------------------ | Branch (91:13): [True: 731, False: 37.4k] ------------------ 92| 731| m_buffer.fill_up_with_zeros(); 93| 731| MD::compress_n(m_digest, m_buffer.consume(), 1); 94| 731| } 95| | 96| | // Make sure that any remaining bytes in the very last block are zero. 97| 38.1k| BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes); ------------------ | | 84| 38.1k| do { \ | | 85| 38.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 38.1k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 38.1k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 38.1k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 38.1k] | | ------------------ ------------------ 98| 38.1k| m_buffer.fill_up_with_zeros(); 99| | 100| | // Replace a bunch of the right-most zero-padding with the counter bytes. 101| 38.1k| const uint64_t bit_count = m_count * 8; 102| 38.1k| const auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count)); 103| 38.1k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 104| 38.1k| store_be(bit_count, last_bytes.data()); 105| | } else { 106| | store_le(bit_count, last_bytes.data()); 107| | } 108| | 109| | // Compress the very last block. 110| 38.1k| MD::compress_n(m_digest, m_buffer.consume(), 1); 111| 38.1k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE: 113| 38.1k| void copy_output(std::span output) { 114| 38.1k| BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes); ------------------ | | 84| 38.1k| do { \ | | 85| 38.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 38.1k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 38.1k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 38.1k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 38.1k] | | ------------------ ------------------ 115| | 116| 38.1k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 117| 38.1k| copy_out_be(output.first(MD::output_bytes), m_digest); 118| | } else { 119| | copy_out_le(output.first(MD::output_bytes), m_digest); 120| | } 121| 38.1k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_224EE6updateENSt3__14spanIKhLm18446744073709551615EEE: 44| 174| void update(std::span input) { 45| 174| BufferSlicer in(input); 46| | 47| 435| while(!in.empty()) { ------------------ | Branch (47:16): [True: 261, False: 174] ------------------ 48| 261| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (48:27): [True: 87, False: 174] ------------------ 49| 87| MD::compress_n(m_digest, one_block.value(), 1); 50| 87| } 51| | 52| 261| if(m_buffer.in_alignment()) { ------------------ | Branch (52:16): [True: 87, False: 174] ------------------ 53| 87| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 54| 87| if(full_blocks > 0) { ------------------ | Branch (54:19): [True: 87, False: 0] ------------------ 55| 87| MD::compress_n(m_digest, aligned_data, full_blocks); 56| 87| } 57| 87| } 58| 261| } 59| | 60| 174| m_count += input.size(); 61| 174| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_224EE5finalENSt3__14spanIhLm18446744073709551615EEE: 63| 87| void final(std::span output) { 64| 87| append_padding_bit(); 65| 87| append_counter_and_finalize(); 66| 87| copy_output(output); 67| 87| clear(); 68| 87| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_224EE18append_padding_bitEv: 77| 87| void append_padding_bit() { 78| 87| BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume()); ------------------ | | 84| 87| do { \ | | 85| 87| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 87| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 87] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 87| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 87] | | ------------------ ------------------ 79| 87| if constexpr(MD::bit_endianness == MD_Endian::Big) { 80| 87| const uint8_t final_byte = 0x80; 81| 87| m_buffer.append({&final_byte, 1}); 82| | } else { 83| | const uint8_t final_byte = 0x01; 84| | m_buffer.append({&final_byte, 1}); 85| | } 86| 87| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_224EE27append_counter_and_finalizeEv: 88| 87| void append_counter_and_finalize() { 89| | // Compress the remaining data if the final data block does not provide 90| | // enough space for the counter bytes. 91| 87| if(m_buffer.elements_until_alignment() < MD::ctr_bytes) { ------------------ | Branch (91:13): [True: 0, False: 87] ------------------ 92| 0| m_buffer.fill_up_with_zeros(); 93| 0| MD::compress_n(m_digest, m_buffer.consume(), 1); 94| 0| } 95| | 96| | // Make sure that any remaining bytes in the very last block are zero. 97| 87| BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes); ------------------ | | 84| 87| do { \ | | 85| 87| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 87| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 87] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 87| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 87] | | ------------------ ------------------ 98| 87| m_buffer.fill_up_with_zeros(); 99| | 100| | // Replace a bunch of the right-most zero-padding with the counter bytes. 101| 87| const uint64_t bit_count = m_count * 8; 102| 87| const auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count)); 103| 87| if constexpr(MD::byte_endianness == MD_Endian::Big) { 104| 87| store_be(bit_count, last_bytes.data()); 105| | } else { 106| | store_le(bit_count, last_bytes.data()); 107| | } 108| | 109| | // Compress the very last block. 110| 87| MD::compress_n(m_digest, m_buffer.consume(), 1); 111| 87| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_224EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE: 113| 87| void copy_output(std::span output) { 114| 87| BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes); ------------------ | | 84| 87| do { \ | | 85| 87| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 87| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 87] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 87| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 87] | | ------------------ ------------------ 115| | 116| 87| if constexpr(MD::byte_endianness == MD_Endian::Big) { 117| 87| copy_out_be(output.first(MD::output_bytes), m_digest); 118| | } else { 119| | copy_out_le(output.first(MD::output_bytes), m_digest); 120| | } 121| 87| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE6updateENSt3__14spanIKhLm18446744073709551615EEE: 44| 38.8k| void update(std::span input) { 45| 38.8k| BufferSlicer in(input); 46| | 47| 102k| while(!in.empty()) { ------------------ | Branch (47:16): [True: 63.8k, False: 38.8k] ------------------ 48| 63.8k| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (48:27): [True: 380, False: 63.4k] ------------------ 49| 380| MD::compress_n(m_digest, one_block.value(), 1); 50| 380| } 51| | 52| 63.8k| if(m_buffer.in_alignment()) { ------------------ | Branch (52:16): [True: 24.9k, False: 38.8k] ------------------ 53| 24.9k| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 54| 24.9k| if(full_blocks > 0) { ------------------ | Branch (54:19): [True: 24.9k, False: 0] ------------------ 55| 24.9k| MD::compress_n(m_digest, aligned_data, full_blocks); 56| 24.9k| } 57| 24.9k| } 58| 63.8k| } 59| | 60| 38.8k| m_count += input.size(); 61| 38.8k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE5finalENSt3__14spanIhLm18446744073709551615EEE: 63| 38.5k| void final(std::span output) { 64| 38.5k| append_padding_bit(); 65| 38.5k| append_counter_and_finalize(); 66| 38.5k| copy_output(output); 67| 38.5k| clear(); 68| 38.5k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE18append_padding_bitEv: 77| 38.5k| void append_padding_bit() { 78| 38.5k| BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume()); ------------------ | | 84| 38.5k| do { \ | | 85| 38.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 38.5k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 38.5k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 38.5k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 38.5k] | | ------------------ ------------------ 79| 38.5k| if constexpr(MD::bit_endianness == MD_Endian::Big) { 80| 38.5k| const uint8_t final_byte = 0x80; 81| 38.5k| m_buffer.append({&final_byte, 1}); 82| | } else { 83| | const uint8_t final_byte = 0x01; 84| | m_buffer.append({&final_byte, 1}); 85| | } 86| 38.5k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE27append_counter_and_finalizeEv: 88| 38.5k| void append_counter_and_finalize() { 89| | // Compress the remaining data if the final data block does not provide 90| | // enough space for the counter bytes. 91| 38.5k| if(m_buffer.elements_until_alignment() < MD::ctr_bytes) { ------------------ | Branch (91:13): [True: 736, False: 37.7k] ------------------ 92| 736| m_buffer.fill_up_with_zeros(); 93| 736| MD::compress_n(m_digest, m_buffer.consume(), 1); 94| 736| } 95| | 96| | // Make sure that any remaining bytes in the very last block are zero. 97| 38.5k| BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes); ------------------ | | 84| 38.5k| do { \ | | 85| 38.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 38.5k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 38.5k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 38.5k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 38.5k] | | ------------------ ------------------ 98| 38.5k| m_buffer.fill_up_with_zeros(); 99| | 100| | // Replace a bunch of the right-most zero-padding with the counter bytes. 101| 38.5k| const uint64_t bit_count = m_count * 8; 102| 38.5k| const auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count)); 103| 38.5k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 104| 38.5k| store_be(bit_count, last_bytes.data()); 105| | } else { 106| | store_le(bit_count, last_bytes.data()); 107| | } 108| | 109| | // Compress the very last block. 110| 38.5k| MD::compress_n(m_digest, m_buffer.consume(), 1); 111| 38.5k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE: 113| 38.5k| void copy_output(std::span output) { 114| 38.5k| BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes); ------------------ | | 84| 38.5k| do { \ | | 85| 38.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 38.5k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 38.5k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 38.5k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 38.5k] | | ------------------ ------------------ 115| | 116| 38.5k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 117| 38.5k| copy_out_be(output.first(MD::output_bytes), m_digest); 118| | } else { 119| | copy_out_le(output.first(MD::output_bytes), m_digest); 120| | } 121| 38.5k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE6updateENSt3__14spanIKhLm18446744073709551615EEE: 44| 752| void update(std::span input) { 45| 752| BufferSlicer in(input); 46| | 47| 1.88k| while(!in.empty()) { ------------------ | Branch (47:16): [True: 1.12k, False: 752] ------------------ 48| 1.12k| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (48:27): [True: 376, False: 752] ------------------ 49| 376| MD::compress_n(m_digest, one_block.value(), 1); 50| 376| } 51| | 52| 1.12k| if(m_buffer.in_alignment()) { ------------------ | Branch (52:16): [True: 376, False: 752] ------------------ 53| 376| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 54| 376| if(full_blocks > 0) { ------------------ | Branch (54:19): [True: 376, False: 0] ------------------ 55| 376| MD::compress_n(m_digest, aligned_data, full_blocks); 56| 376| } 57| 376| } 58| 1.12k| } 59| | 60| 752| m_count += input.size(); 61| 752| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EE6updateENSt3__14spanIKhLm18446744073709551615EEE: 44| 107| void update(std::span input) { 45| 107| BufferSlicer in(input); 46| | 47| 258| while(!in.empty()) { ------------------ | Branch (47:16): [True: 151, False: 107] ------------------ 48| 151| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (48:27): [True: 44, False: 107] ------------------ 49| 44| MD::compress_n(m_digest, one_block.value(), 1); 50| 44| } 51| | 52| 151| if(m_buffer.in_alignment()) { ------------------ | Branch (52:16): [True: 44, False: 107] ------------------ 53| 44| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 54| 44| if(full_blocks > 0) { ------------------ | Branch (54:19): [True: 11, False: 33] ------------------ 55| 11| MD::compress_n(m_digest, aligned_data, full_blocks); 56| 11| } 57| 44| } 58| 151| } 59| | 60| 107| m_count += input.size(); 61| 107| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE5finalENSt3__14spanIhLm18446744073709551615EEE: 63| 376| void final(std::span output) { 64| 376| append_padding_bit(); 65| 376| append_counter_and_finalize(); 66| 376| copy_output(output); 67| 376| clear(); 68| 376| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE18append_padding_bitEv: 77| 376| void append_padding_bit() { 78| 376| BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume()); ------------------ | | 84| 376| do { \ | | 85| 376| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 376| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 376] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 376| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 376] | | ------------------ ------------------ 79| 376| if constexpr(MD::bit_endianness == MD_Endian::Big) { 80| 376| const uint8_t final_byte = 0x80; 81| 376| m_buffer.append({&final_byte, 1}); 82| | } else { 83| | const uint8_t final_byte = 0x01; 84| | m_buffer.append({&final_byte, 1}); 85| | } 86| 376| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE27append_counter_and_finalizeEv: 88| 376| void append_counter_and_finalize() { 89| | // Compress the remaining data if the final data block does not provide 90| | // enough space for the counter bytes. 91| 376| if(m_buffer.elements_until_alignment() < MD::ctr_bytes) { ------------------ | Branch (91:13): [True: 0, False: 376] ------------------ 92| 0| m_buffer.fill_up_with_zeros(); 93| 0| MD::compress_n(m_digest, m_buffer.consume(), 1); 94| 0| } 95| | 96| | // Make sure that any remaining bytes in the very last block are zero. 97| 376| BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes); ------------------ | | 84| 376| do { \ | | 85| 376| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 376| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 376] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 376| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 376] | | ------------------ ------------------ 98| 376| m_buffer.fill_up_with_zeros(); 99| | 100| | // Replace a bunch of the right-most zero-padding with the counter bytes. 101| 376| const uint64_t bit_count = m_count * 8; 102| 376| const auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count)); 103| 376| if constexpr(MD::byte_endianness == MD_Endian::Big) { 104| 376| store_be(bit_count, last_bytes.data()); 105| | } else { 106| | store_le(bit_count, last_bytes.data()); 107| | } 108| | 109| | // Compress the very last block. 110| 376| MD::compress_n(m_digest, m_buffer.consume(), 1); 111| 376| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE: 113| 376| void copy_output(std::span output) { 114| 376| BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes); ------------------ | | 84| 376| do { \ | | 85| 376| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 376| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 376] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 376| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 376] | | ------------------ ------------------ 115| | 116| 376| if constexpr(MD::byte_endianness == MD_Endian::Big) { 117| 376| copy_out_be(output.first(MD::output_bytes), m_digest); 118| | } else { 119| | copy_out_le(output.first(MD::output_bytes), m_digest); 120| | } 121| 376| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EE5finalENSt3__14spanIhLm18446744073709551615EEE: 63| 53| void final(std::span output) { 64| 53| append_padding_bit(); 65| 53| append_counter_and_finalize(); 66| 53| copy_output(output); 67| 53| clear(); 68| 53| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EE18append_padding_bitEv: 77| 53| void append_padding_bit() { 78| 53| BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume()); ------------------ | | 84| 53| do { \ | | 85| 53| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 53| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 53] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 53| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 53] | | ------------------ ------------------ 79| 53| if constexpr(MD::bit_endianness == MD_Endian::Big) { 80| 53| const uint8_t final_byte = 0x80; 81| 53| m_buffer.append({&final_byte, 1}); 82| | } else { 83| | const uint8_t final_byte = 0x01; 84| | m_buffer.append({&final_byte, 1}); 85| | } 86| 53| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EE27append_counter_and_finalizeEv: 88| 53| void append_counter_and_finalize() { 89| | // Compress the remaining data if the final data block does not provide 90| | // enough space for the counter bytes. 91| 53| if(m_buffer.elements_until_alignment() < MD::ctr_bytes) { ------------------ | Branch (91:13): [True: 0, False: 53] ------------------ 92| 0| m_buffer.fill_up_with_zeros(); 93| 0| MD::compress_n(m_digest, m_buffer.consume(), 1); 94| 0| } 95| | 96| | // Make sure that any remaining bytes in the very last block are zero. 97| 53| BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes); ------------------ | | 84| 53| do { \ | | 85| 53| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 53| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 53] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 53| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 53] | | ------------------ ------------------ 98| 53| m_buffer.fill_up_with_zeros(); 99| | 100| | // Replace a bunch of the right-most zero-padding with the counter bytes. 101| 53| const uint64_t bit_count = m_count * 8; 102| 53| const auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count)); 103| 53| if constexpr(MD::byte_endianness == MD_Endian::Big) { 104| 53| store_be(bit_count, last_bytes.data()); 105| | } else { 106| | store_le(bit_count, last_bytes.data()); 107| | } 108| | 109| | // Compress the very last block. 110| 53| MD::compress_n(m_digest, m_buffer.consume(), 1); 111| 53| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE: 113| 53| void copy_output(std::span output) { 114| 53| BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes); ------------------ | | 84| 53| do { \ | | 85| 53| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 53| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 53] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 53| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 53] | | ------------------ ------------------ 115| | 116| 53| if constexpr(MD::byte_endianness == MD_Endian::Big) { 117| 53| copy_out_be(output.first(MD::output_bytes), m_digest); 118| | } else { 119| | copy_out_le(output.first(MD::output_bytes), m_digest); 120| | } 121| 53| } _ZN5Botan15bytes_to_stringENSt3__14spanIKhLm18446744073709551615EEE: 76| 72.0k|inline std::string bytes_to_string(std::span bytes) { 77| 72.0k| return std::string(reinterpret_cast(bytes.data()), bytes.size()); 78| 72.0k|} _ZN5Botan14zeroize_bufferITkNSt3__117unsigned_integralEhEEvPT_m: 37| 177k|inline void zeroize_buffer(T buf[], size_t n) { 38| 177k| if(n > 0) { ------------------ | Branch (38:7): [True: 177k, False: 0] ------------------ 39| 177k| std::memset(buf, 0, sizeof(T) * n); 40| 177k| } 41| 177k|} _ZN5Botan21unchecked_copy_memoryITkNSt3__117unsigned_integralEmEEvPT_PKS2_m: 44| 158k|inline void unchecked_copy_memory(T* out, const T* in, size_t n) { 45| 158k| if(in != nullptr && out != nullptr && n > 0) { ------------------ | Branch (45:7): [True: 158k, False: 0] | Branch (45:24): [True: 158k, False: 0] | Branch (45:42): [True: 158k, False: 0] ------------------ 46| 158k| std::memmove(out, in, sizeof(T) * n); 47| 158k| } 48| 158k|} _ZN5Botan14zeroize_bufferITkNSt3__117unsigned_integralEmEEvPT_m: 37| 400k|inline void zeroize_buffer(T buf[], size_t n) { 38| 400k| if(n > 0) { ------------------ | Branch (38:7): [True: 256k, False: 144k] ------------------ 39| 256k| std::memset(buf, 0, sizeof(T) * n); 40| 256k| } 41| 400k|} _ZN5Botan27ML_DSA_Symmetric_PrimitivesC2ERKNS_18DilithiumConstantsE: 65| 3| Dilithium_Symmetric_Primitives_Base(mode, std::make_unique()), 66| 3| m_seed_expansion_domain_separator({mode.k(), mode.l()}) {} _ZNK5Botan17Montgomery_Params1pEv: 41| 123k| const BigInt& p() const { return m_data->p(); } _ZNK5Botan17Montgomery_Params2R1Ev: 43| 3.02k| const BigInt& R1() const { return m_data->r1(); } _ZNK5Botan17Montgomery_Params2R2Ev: 45| 5.97k| const BigInt& R2() const { return m_data->r2(); } _ZNK5Botan17Montgomery_Params2R3Ev: 47| 758| const BigInt& R3() const { return m_data->r3(); } _ZNK5Botan17Montgomery_Params6p_dashEv: 49| 123k| word p_dash() const { return m_data->p_dash(); } _ZNK5Botan17Montgomery_Params7p_wordsEv: 51| 105k| size_t p_words() const { return m_data->p_size(); } _ZNK5Botan17Montgomery_Params4Data1pEv: 76| 123k| const BigInt& p() const { return m_p; } _ZNK5Botan17Montgomery_Params4Data2r1Ev: 78| 3.02k| const BigInt& r1() const { return m_r1; } _ZNK5Botan17Montgomery_Params4Data2r2Ev: 80| 5.97k| const BigInt& r2() const { return m_r2; } _ZNK5Botan17Montgomery_Params4Data2r3Ev: 82| 758| const BigInt& r3() const { return m_r3; } _ZNK5Botan17Montgomery_Params4Data6p_dashEv: 84| 123k| word p_dash() const { return m_p_dash; } _ZNK5Botan17Montgomery_Params4Data6p_sizeEv: 86| 105k| size_t p_size() const { return m_p_words; } _ZNK5Botan14Montgomery_Int18_const_time_poisonEv: 180| 1.39k| void _const_time_poison() const { CT::poison(m_v); } _ZNK5Botan14Montgomery_Int20_const_time_unpoisonEv: 182| 384| void _const_time_unpoison() const { CT::unpoison(m_v); } _ZNK5Botan14Montgomery_Int7_paramsEv: 184| 471| const Montgomery_Params& _params() const { return m_params; } _ZN5Botan17monty_exp_vartimeERKNS_17Montgomery_ParamsERKNS_6BigIntES5_: 79| 281|inline Montgomery_Int monty_exp_vartime(const Montgomery_Params& params_p, const BigInt& g, const BigInt& k) { 80| 281| const auto precomputed = monty_precompute(params_p, g, 4, false); 81| 281| return monty_execute_vartime(*precomputed, k); 82| 281|} _ZN5Botan31Montgomery_Exponentiation_StateC2Ev: 41| 471| Montgomery_Exponentiation_State() = default; _ZN5Botan31Montgomery_Exponentiation_StateD2Ev: 22| 471| virtual ~Montgomery_Exponentiation_State() = default; _ZN5Botan10word8_sub3ITkNS_8WordTypeEmEET_PS1_PKS1_S4_S1_: 385| 3.28M|inline constexpr auto word8_sub3(W z[8], const W x[8], const W y[8], W carry) -> W { 386| 3.28M|#if defined(BOTAN_MP_USE_X86_64_ASM) 387| 3.28M| if constexpr(std::same_as) { 388| 3.28M| if(!std::is_constant_evaluated()) { ------------------ | Branch (388:10): [True: 3.28M, Folded] ------------------ 389| 3.28M| asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "sbbq")) 390| 3.28M| : [carry] "=r"(carry) 391| 3.28M| : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry) 392| 3.28M| : "cc", "memory"); 393| 3.28M| return carry; 394| 3.28M| } 395| 3.28M| } 396| 0|#endif 397| | 398| 0| z[0] = word_sub(x[0], y[0], &carry); 399| 3.28M| z[1] = word_sub(x[1], y[1], &carry); 400| 3.28M| z[2] = word_sub(x[2], y[2], &carry); 401| 3.28M| z[3] = word_sub(x[3], y[3], &carry); 402| 3.28M| z[4] = word_sub(x[4], y[4], &carry); 403| 3.28M| z[5] = word_sub(x[5], y[5], &carry); 404| 3.28M| z[6] = word_sub(x[6], y[6], &carry); 405| 3.28M| z[7] = word_sub(x[7], y[7], &carry); 406| 3.28M| return carry; 407| 3.28M|} _ZN5Botan8word_subITkNS_8WordTypeEmEET_S1_S1_PS1_: 332| 142M|inline constexpr auto word_sub(W x, W y, W* carry) -> W { 333| 142M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_subc) 334| 142M| if(!std::is_constant_evaluated()) { ------------------ | Branch (334:7): [True: 142M, Folded] ------------------ 335| | if constexpr(std::same_as) { 336| | return __builtin_subc(x, y, *carry & 1, carry); 337| 142M| } else if constexpr(std::same_as) { 338| 142M| return __builtin_subcl(x, y, *carry & 1, carry); 339| | } else if constexpr(std::same_as) { 340| | return __builtin_subcll(x, y, *carry & 1, carry); 341| | } 342| 142M| } 343| 0|#endif 344| | 345| 0| const W cb = *carry & 1; 346| 142M| W t0 = x - y; 347| 142M| W c1 = (t0 > x); 348| 142M| W z = t0 - cb; 349| 142M| *carry = c1 | (z > t0); 350| 142M| return z; 351| 142M|} _ZN5Botan8word_addITkNS_8WordTypeEmEET_S1_S1_PS1_: 239| 67.7M|inline constexpr auto word_add(W x, W y, W* carry) -> W { 240| 67.7M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_addc) 241| 67.7M| if(!std::is_constant_evaluated()) { ------------------ | Branch (241:7): [True: 67.7M, Folded] ------------------ 242| | if constexpr(std::same_as) { 243| | return __builtin_addc(x, y, *carry & 1, carry); 244| 67.7M| } else if constexpr(std::same_as) { 245| 67.7M| return __builtin_addcl(x, y, *carry & 1, carry); 246| | } else if constexpr(std::same_as) { 247| | return __builtin_addcll(x, y, *carry & 1, carry); 248| | } 249| 67.7M| } 250| 0|#endif 251| | 252| | if constexpr(WordInfo::dword_is_native && use_dword_for_word_add) { 253| | /* 254| | TODO(Botan4) this is largely a performance hack for GCCs that don't 255| | support __builtin_addc, if we increase the minimum supported version of 256| | GCC to GCC 14 then we can remove this and not worry about it 257| | */ 258| | const W cb = *carry & 1; 259| | const auto s = typename WordInfo::dword(x) + y + cb; 260| | *carry = static_cast(s >> WordInfo::bits); 261| | return static_cast(s); 262| 67.7M| } else { 263| 67.7M| const W cb = *carry & 1; 264| 67.7M| W z = x + y; 265| 67.7M| W c1 = (z < x); 266| 67.7M| z += cb; 267| 67.7M| *carry = c1 | (z < cb); 268| 67.7M| return z; 269| 67.7M| } 270| 67.7M|} _ZN5Botan10word_madd2ITkNS_8WordTypeEmEET_S1_S1_PS1_: 90| 424k|inline constexpr auto word_madd2(W a, W b, W* c) -> W { 91| 424k|#if defined(BOTAN_MP_USE_X86_64_ASM) 92| 424k| if constexpr(std::same_as) { 93| 424k| if(!std::is_constant_evaluated()) { ------------------ | Branch (93:10): [True: 424k, Folded] ------------------ 94| 424k| asm(R"( 95| 424k| mulq %[b] 96| 424k| addq %[c],%[a] 97| 424k| adcq $0,%[carry] 98| 424k| )" 99| 424k| : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*c) 100| 424k| : "0"(a), "1"(b), [c] "g"(*c) 101| 424k| : "cc"); 102| | 103| 424k| return a; 104| 424k| } 105| 424k| } 106| |#elif defined(BOTAN_MP_USE_AARCH64_ASM) 107| | if constexpr(std::same_as) { 108| | if(!std::is_constant_evaluated()) { 109| | W lo = 0; 110| | W hi = 0; 111| | asm(R"( 112| | mul %[lo], %[a], %[b] 113| | umulh %[hi], %[a], %[b] 114| | adds %[lo], %[lo], %[c] 115| | adc %[hi], %[hi], xzr 116| | )" 117| | : [lo] "=&r"(lo), [hi] "=&r"(hi) 118| | : [a] "r"(a), [b] "r"(b), [c] "r"(*c) 119| | : "cc"); 120| | 121| | *c = hi; 122| | return lo; 123| | } 124| | } 125| |#endif 126| | 127| 0| typedef typename WordInfo::dword dword; 128| 424k| const dword s = dword(a) * b + *c; 129| 424k| *c = static_cast(s >> WordInfo::bits); 130| 424k| return static_cast(s); 131| 424k|} _ZN5Botan10word8_add2ITkNS_8WordTypeEmEET_PS1_PKS1_S1_: 276| 200k|inline constexpr auto word8_add2(W x[8], const W y[8], W carry) -> W { 277| 200k|#if defined(BOTAN_MP_USE_X86_64_ASM) 278| 200k| if constexpr(std::same_as) { 279| 200k| if(!std::is_constant_evaluated()) { ------------------ | Branch (279:10): [True: 200k, Folded] ------------------ 280| 200k| asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "adcq")) 281| 200k| : [carry] "=r"(carry) 282| 200k| : [x] "r"(x), [y] "r"(y), "0"(carry) 283| 200k| : "cc", "memory"); 284| 200k| return carry; 285| 200k| } 286| 200k| } 287| 0|#endif 288| | 289| 0| x[0] = word_add(x[0], y[0], &carry); 290| 200k| x[1] = word_add(x[1], y[1], &carry); 291| 200k| x[2] = word_add(x[2], y[2], &carry); 292| 200k| x[3] = word_add(x[3], y[3], &carry); 293| 200k| x[4] = word_add(x[4], y[4], &carry); 294| 200k| x[5] = word_add(x[5], y[5], &carry); 295| 200k| x[6] = word_add(x[6], y[6], &carry); 296| 200k| x[7] = word_add(x[7], y[7], &carry); 297| 200k| return carry; 298| 200k|} _ZN5Botan10word8_sub2ITkNS_8WordTypeEmEET_PS1_PKS1_S1_: 357| 1.83k|inline constexpr auto word8_sub2(W x[8], const W y[8], W carry) -> W { 358| 1.83k|#if defined(BOTAN_MP_USE_X86_64_ASM) 359| 1.83k| if constexpr(std::same_as) { 360| 1.83k| if(!std::is_constant_evaluated()) { ------------------ | Branch (360:10): [True: 1.83k, Folded] ------------------ 361| 1.83k| asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "sbbq")) 362| 1.83k| : [carry] "=r"(carry) 363| 1.83k| : [x] "r"(x), [y] "r"(y), "0"(carry) 364| 1.83k| : "cc", "memory"); 365| 1.83k| return carry; 366| 1.83k| } 367| 1.83k| } 368| 0|#endif 369| | 370| 0| x[0] = word_sub(x[0], y[0], &carry); 371| 1.83k| x[1] = word_sub(x[1], y[1], &carry); 372| 1.83k| x[2] = word_sub(x[2], y[2], &carry); 373| 1.83k| x[3] = word_sub(x[3], y[3], &carry); 374| 1.83k| x[4] = word_sub(x[4], y[4], &carry); 375| 1.83k| x[5] = word_sub(x[5], y[5], &carry); 376| 1.83k| x[6] = word_sub(x[6], y[6], &carry); 377| 1.83k| x[7] = word_sub(x[7], y[7], &carry); 378| 1.83k| return carry; 379| 1.83k|} _ZN5Botan10word8_add3ITkNS_8WordTypeEmEET_PS1_PKS1_S4_S1_: 304| 20.7k|inline constexpr auto word8_add3(W z[8], const W x[8], const W y[8], W carry) -> W { 305| 20.7k|#if defined(BOTAN_MP_USE_X86_64_ASM) 306| 20.7k| if constexpr(std::same_as) { 307| 20.7k| if(!std::is_constant_evaluated()) { ------------------ | Branch (307:10): [True: 20.7k, Folded] ------------------ 308| 20.7k| asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "adcq")) 309| 20.7k| : [carry] "=r"(carry) 310| 20.7k| : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry) 311| 20.7k| : "cc", "memory"); 312| 20.7k| return carry; 313| 20.7k| } 314| 20.7k| } 315| 0|#endif 316| | 317| 0| z[0] = word_add(x[0], y[0], &carry); 318| 20.7k| z[1] = word_add(x[1], y[1], &carry); 319| 20.7k| z[2] = word_add(x[2], y[2], &carry); 320| 20.7k| z[3] = word_add(x[3], y[3], &carry); 321| 20.7k| z[4] = word_add(x[4], y[4], &carry); 322| 20.7k| z[5] = word_add(x[5], y[5], &carry); 323| 20.7k| z[6] = word_add(x[6], y[6], &carry); 324| 20.7k| z[7] = word_add(x[7], y[7], &carry); 325| 20.7k| return carry; 326| 20.7k|} _ZN5Botan11word8_madd3ITkNS_8WordTypeEmEET_PS1_PKS1_S1_S1_: 441| 61.0k|inline constexpr auto word8_madd3(W z[8], const W x[8], W y, W carry) -> W { 442| 61.0k|#if defined(BOTAN_MP_USE_X86_64_ASM) 443| 61.0k| if constexpr(std::same_as) { 444| 61.0k| if(!std::is_constant_evaluated()) { ------------------ | Branch (444:10): [True: 61.0k, Folded] ------------------ 445| 61.0k| asm volatile(DO_8_TIMES(MULADD_OP, "") 446| 61.0k| : [carry] "=r"(carry) 447| 61.0k| : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry) 448| 61.0k| : "cc", "%rax", "%rdx", "memory"); 449| 61.0k| return carry; 450| 61.0k| } 451| 61.0k| } 452| 0|#endif 453| | 454| 0| z[0] = word_madd3(x[0], y, z[0], &carry); 455| 61.0k| z[1] = word_madd3(x[1], y, z[1], &carry); 456| 61.0k| z[2] = word_madd3(x[2], y, z[2], &carry); 457| 61.0k| z[3] = word_madd3(x[3], y, z[3], &carry); 458| 61.0k| z[4] = word_madd3(x[4], y, z[4], &carry); 459| 61.0k| z[5] = word_madd3(x[5], y, z[5], &carry); 460| 61.0k| z[6] = word_madd3(x[6], y, z[6], &carry); 461| 61.0k| z[7] = word_madd3(x[7], y, z[7], &carry); 462| 61.0k| return carry; 463| 61.0k|} _ZN5Botan10word_madd3ITkNS_8WordTypeEmEET_S1_S1_S1_PS1_: 137| 509k|inline constexpr auto word_madd3(W a, W b, W c, W* d) -> W { 138| 509k|#if defined(BOTAN_MP_USE_X86_64_ASM) 139| 509k| if constexpr(std::same_as) { 140| 509k| if(!std::is_constant_evaluated()) { ------------------ | Branch (140:10): [True: 509k, Folded] ------------------ 141| 509k| asm(R"( 142| 509k| mulq %[b] 143| 509k| 144| 509k| addq %[c],%[a] 145| 509k| adcq $0,%[carry] 146| 509k| 147| 509k| addq %[d],%[a] 148| 509k| adcq $0,%[carry] 149| 509k| )" 150| 509k| : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*d) 151| 509k| : "0"(a), "1"(b), [c] "g"(c), [d] "g"(*d) 152| 509k| : "cc"); 153| | 154| 509k| return a; 155| 509k| } 156| 509k| } 157| |#elif defined(BOTAN_MP_USE_AARCH64_ASM) 158| | if constexpr(std::same_as) { 159| | if(!std::is_constant_evaluated()) { 160| | W lo = 0; 161| | W hi = 0; 162| | asm(R"( 163| | mul %[lo], %[a], %[b] 164| | umulh %[hi], %[a], %[b] 165| | adds %[lo], %[lo], %[c] 166| | adc %[hi], %[hi], xzr 167| | adds %[lo], %[lo], %[d] 168| | adc %[hi], %[hi], xzr 169| | )" 170| | : [lo] "=&r"(lo), [hi] "=&r"(hi) 171| | : [a] "r"(a), [b] "r"(b), [c] "r"(c), [d] "r"(*d) 172| | : "cc"); 173| | 174| | *d = hi; 175| | return lo; 176| | } 177| | } 178| |#endif 179| | 180| 0| typedef typename WordInfo::dword dword; 181| 509k| const dword s = dword(a) * b + c + *d; 182| 509k| *d = static_cast(s >> WordInfo::bits); 183| 509k| return static_cast(s); 184| 509k|} _ZN5Botan5word3ImEC2Ev: 478| 10.4M| constexpr word3() : m_w(0) {} _ZN5Botan5word3ImE3mulEmm: 480| 170M| inline constexpr void mul(W x, W y) { m_w += static_cast(x) * y; } _ZN5Botan5word3ImE7extractEv: 486| 52.6M| inline constexpr W extract() { 487| 52.6M| W r = static_cast(m_w); 488| 52.6M| m_w >>= WordInfo::bits; 489| 52.6M| return r; 490| 52.6M| } _ZN5Botan5word3ImE6mul_x2Emm: 482| 17.1k| inline constexpr void mul_x2(W x, W y) { m_w += static_cast(x) * y * 2; } _ZN5Botan5word3ImE3addEm: 484| 84.2M| inline constexpr void add(W x) { m_w += x; } _ZN5Botan5word3ImE10monty_stepEmm: 492| 42.1M| inline constexpr W monty_step(W p0, W p_dash) { 493| 42.1M| const W w0 = static_cast(m_w); 494| 42.1M| const W r = w0 * p_dash; 495| 42.1M| mul(r, p0); 496| 42.1M| m_w >>= WordInfo::bits; 497| 42.1M| return r; 498| 42.1M| } _ZN5Botan10bigint_cmpITkNS_8WordTypeEmEEiPKT_mS3_m: 462| 31.8k|inline constexpr int32_t bigint_cmp(const W x[], size_t x_size, const W y[], size_t y_size) { 463| 31.8k| static_assert(sizeof(W) >= sizeof(uint32_t), "Size assumption"); 464| | 465| 31.8k| const W LT = static_cast(-1); 466| 31.8k| const W EQ = 0; 467| 31.8k| const W GT = 1; 468| | 469| 31.8k| const size_t common_elems = std::min(x_size, y_size); 470| | 471| 31.8k| W result = EQ; // until found otherwise 472| | 473| 140k| for(size_t i = 0; i != common_elems; i++) { ------------------ | Branch (473:22): [True: 108k, False: 31.8k] ------------------ 474| 108k| const auto is_eq = CT::Mask::is_equal(x[i], y[i]); 475| 108k| const auto is_lt = CT::Mask::is_lt(x[i], y[i]); 476| | 477| 108k| result = is_eq.select(result, is_lt.select(LT, GT)); 478| 108k| } 479| | 480| 31.8k| if(x_size < y_size) { ------------------ | Branch (480:7): [True: 717, False: 31.1k] ------------------ 481| 717| W mask = 0; 482| 7.10k| for(size_t i = x_size; i != y_size; i++) { ------------------ | Branch (482:30): [True: 6.39k, False: 717] ------------------ 483| 6.39k| mask |= y[i]; 484| 6.39k| } 485| | 486| | // If any bits were set in high part of y, then x < y 487| 717| result = CT::Mask::is_zero(mask).select(result, LT); 488| 31.1k| } else if(y_size < x_size) { ------------------ | Branch (488:14): [True: 1.41k, False: 29.7k] ------------------ 489| 1.41k| W mask = 0; 490| 6.22k| for(size_t i = y_size; i != x_size; i++) { ------------------ | Branch (490:30): [True: 4.81k, False: 1.41k] ------------------ 491| 4.81k| mask |= x[i]; 492| 4.81k| } 493| | 494| | // If any bits were set in high part of x, then x > y 495| 1.41k| result = CT::Mask::is_zero(mask).select(result, GT); 496| 1.41k| } 497| | 498| 31.8k| CT::unpoison(result); 499| 31.8k| BOTAN_DEBUG_ASSERT(result == LT || result == GT || result == EQ); ------------------ | | 137| 31.8k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 31.8k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 31.8k] | | ------------------ ------------------ 500| 31.8k| return static_cast(result); 501| 31.8k|} _ZN5Botan15bigint_ct_is_eqITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPKS3_mS6_m: 542| 1.94k|inline constexpr auto bigint_ct_is_eq(const W x[], size_t x_size, const W y[], size_t y_size) -> CT::Mask { 543| 1.94k| const size_t common_elems = std::min(x_size, y_size); 544| | 545| 1.94k| W diff = 0; 546| | 547| 21.6k| for(size_t i = 0; i != common_elems; i++) { ------------------ | Branch (547:22): [True: 19.7k, False: 1.94k] ------------------ 548| 19.7k| diff |= (x[i] ^ y[i]); 549| 19.7k| } 550| | 551| | // If any bits were set in high part of x/y, then they are not equal 552| 1.94k| if(x_size < y_size) { ------------------ | Branch (552:7): [True: 141, False: 1.80k] ------------------ 553| 709| for(size_t i = x_size; i != y_size; i++) { ------------------ | Branch (553:30): [True: 568, False: 141] ------------------ 554| 568| diff |= y[i]; 555| 568| } 556| 1.80k| } else if(y_size < x_size) { ------------------ | Branch (556:14): [True: 281, False: 1.52k] ------------------ 557| 2.52k| for(size_t i = y_size; i != x_size; i++) { ------------------ | Branch (557:30): [True: 2.24k, False: 281] ------------------ 558| 2.24k| diff |= x[i]; 559| 2.24k| } 560| 281| } 561| | 562| 1.94k| return CT::Mask::is_zero(diff); 563| 1.94k|} _ZN5Botan15bigint_ct_is_ltITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPKS3_mS6_mb: 510| 34.3k| -> CT::Mask { 511| 34.3k| const size_t common_elems = std::min(x_size, y_size); 512| | 513| 34.3k| auto is_lt = CT::Mask::expand(lt_or_equal); 514| | 515| 227k| for(size_t i = 0; i != common_elems; i++) { ------------------ | Branch (515:22): [True: 193k, False: 34.3k] ------------------ 516| 193k| const auto eq = CT::Mask::is_equal(x[i], y[i]); 517| 193k| const auto lt = CT::Mask::is_lt(x[i], y[i]); 518| 193k| is_lt = eq.select_mask(is_lt, lt); 519| 193k| } 520| | 521| 34.3k| if(x_size < y_size) { ------------------ | Branch (521:7): [True: 1.00k, False: 33.3k] ------------------ 522| 1.00k| W mask = 0; 523| 8.18k| for(size_t i = x_size; i != y_size; i++) { ------------------ | Branch (523:30): [True: 7.17k, False: 1.00k] ------------------ 524| 7.17k| mask |= y[i]; 525| 7.17k| } 526| | // If any bits were set in high part of y, then is_lt should be forced true 527| 1.00k| is_lt |= CT::Mask::expand(mask); 528| 33.3k| } else if(y_size < x_size) { ------------------ | Branch (528:14): [True: 10.2k, False: 23.0k] ------------------ 529| 10.2k| W mask = 0; 530| 84.0k| for(size_t i = y_size; i != x_size; i++) { ------------------ | Branch (530:30): [True: 73.7k, False: 10.2k] ------------------ 531| 73.7k| mask |= x[i]; 532| 73.7k| } 533| | 534| | // If any bits were set in high part of x, then is_lt should be false 535| 10.2k| is_lt &= CT::Mask::is_zero(mask); 536| 10.2k| } 537| | 538| 34.3k| return is_lt; 539| 34.3k|} _ZN5Botan11bigint_sub3ITkNS_8WordTypeEmEET_PS1_PKS1_mS4_m: 195| 3.59M|inline constexpr auto bigint_sub3(W z[], const W x[], size_t x_size, const W y[], size_t y_size) -> W { 196| 3.59M| W borrow = 0; 197| | 198| 3.59M| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 71| 3.59M| do { \ | | 72| 3.59M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 3.59M| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 3.59M] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 3.59M| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 3.59M] | | ------------------ ------------------ 199| | 200| 3.59M| const size_t blocks = y_size - (y_size % 8); 201| | 202| 6.84M| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (202:22): [True: 3.25M, False: 3.59M] ------------------ 203| 3.25M| borrow = word8_sub3(z + i, x + i, y + i, borrow); 204| 3.25M| } 205| | 206| 8.78M| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (206:27): [True: 5.18M, False: 3.59M] ------------------ 207| 5.18M| z[i] = word_sub(x[i], y[i], &borrow); 208| 5.18M| } 209| | 210| 3.62M| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (210:27): [True: 30.4k, False: 3.59M] ------------------ 211| 30.4k| z[i] = word_sub(x[i], static_cast(0), &borrow); 212| 30.4k| } 213| | 214| 3.59M| return borrow; 215| 3.59M|} _ZN5Botan11bigint_shl2ITkNS_8WordTypeEmEEvPT_mPKS1_mm: 358| 70|inline constexpr void bigint_shl2(W y[], size_t y_size, const W x[], size_t x_size, size_t shift) { 359| 70| const size_t word_shift = shift / WordInfo::bits; 360| 70| const size_t bit_shift = shift % WordInfo::bits; 361| | 362| 70| BOTAN_ASSERT_NOMSG(word_shift <= y_size); ------------------ | | 84| 70| do { \ | | 85| 70| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 70| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 70] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 70| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 70] | | ------------------ ------------------ 363| 70| BOTAN_ASSERT_NOMSG(x_size < y_size - word_shift); ------------------ | | 84| 70| do { \ | | 85| 70| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 70| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 70] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 70| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 70] | | ------------------ ------------------ 364| | 365| 70| unchecked_copy_memory(y + word_shift, x, x_size); 366| 70| zeroize_buffer(y, word_shift); 367| 70| zeroize_buffer(y + word_shift + x_size, y_size - word_shift - x_size); 368| | 369| 70| const auto carry_mask = CT::Mask::expand(bit_shift); 370| 70| const W carry_shift = carry_mask.if_set_return(WordInfo::bits - bit_shift); 371| | 372| 70| W carry = 0; 373| 420| for(size_t i = word_shift; i != x_size + word_shift + 1; ++i) { ------------------ | Branch (373:31): [True: 350, False: 70] ------------------ 374| 350| const W w = y[i]; 375| 350| y[i] = (w << bit_shift) | carry; 376| 350| carry = carry_mask.if_set_return(w >> carry_shift); 377| 350| } 378| 70|} _ZN5Botan15bigint_cnd_swapITkNS_8WordTypeEmEEvT_PS1_S2_m: 32| 64.1k|inline constexpr void bigint_cnd_swap(W cnd, W x[], W y[], size_t size) { 33| 64.1k| const auto mask = CT::Mask::expand(cnd); 34| | 35| 319k| for(size_t i = 0; i != size; ++i) { ------------------ | Branch (35:22): [True: 255k, False: 64.1k] ------------------ 36| 255k| const W a = x[i]; 37| 255k| const W b = y[i]; 38| 255k| x[i] = mask.select(b, a); 39| 255k| y[i] = mask.select(a, b); 40| 255k| } 41| 64.1k|} _ZN5Botan17bigint_monty_redcEPmPKmS2_mmS0_m: 1077| 10.4M| word r[], const word z[], const word p[], size_t p_size, word p_dash, word ws[], size_t ws_size) { 1078| 10.4M| const size_t z_size = 2 * p_size; 1079| | 1080| 10.4M| BOTAN_ARG_CHECK(ws_size >= p_size, "Montgomery reduction workspace too small"); ------------------ | | 35| 10.4M| do { \ | | 36| 10.4M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 10.4M| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 10.4M] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 10.4M| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 10.4M] | | ------------------ ------------------ 1081| | 1082| 10.4M| if(p_size == 4) { ------------------ | Branch (1082:7): [True: 10.3M, False: 115k] ------------------ 1083| 10.3M| bigint_monty_redc_4(r, z, p, p_dash, ws); 1084| 10.3M| } else if(p_size == 6) { ------------------ | Branch (1084:14): [True: 756, False: 115k] ------------------ 1085| 756| bigint_monty_redc_6(r, z, p, p_dash, ws); 1086| 115k| } else if(p_size == 8) { ------------------ | Branch (1086:14): [True: 59.6k, False: 55.5k] ------------------ 1087| 59.6k| bigint_monty_redc_8(r, z, p, p_dash, ws); 1088| 59.6k| } else if(p_size == 12) { ------------------ | Branch (1088:14): [True: 0, False: 55.5k] ------------------ 1089| 0| bigint_monty_redc_12(r, z, p, p_dash, ws); 1090| 55.5k| } else if(p_size == 16) { ------------------ | Branch (1090:14): [True: 61, False: 55.4k] ------------------ 1091| 61| bigint_monty_redc_16(r, z, p, p_dash, ws); 1092| 55.4k| } else if(p_size == 24) { ------------------ | Branch (1092:14): [True: 0, False: 55.4k] ------------------ 1093| 0| bigint_monty_redc_24(r, z, p, p_dash, ws); 1094| 55.4k| } else if(p_size == 32) { ------------------ | Branch (1094:14): [True: 14, False: 55.4k] ------------------ 1095| 14| bigint_monty_redc_32(r, z, p, p_dash, ws); 1096| 55.4k| } else { 1097| 55.4k| bigint_monty_redc_generic(r, z, z_size, p, p_size, p_dash, ws); 1098| 55.4k| } 1099| 10.4M|} _ZN5Botan25bigint_monty_redc_inplaceEPmPKmmmS0_m: 1101| 56.2k|inline void bigint_monty_redc_inplace(word z[], const word p[], size_t p_size, word p_dash, word ws[], size_t ws_size) { 1102| 56.2k| bigint_monty_redc(z, z, p, p_size, p_dash, ws, ws_size); 1103| 56.2k| zeroize_buffer(z + p_size, p_size); 1104| 56.2k|} _ZN5Botan12booth_recodeEmm: 1302| 48.7k|inline constexpr std::pair booth_recode(size_t x, size_t window_bits) { 1303| 48.7k| const auto sign = CT::Mask::expand(x >> window_bits); 1304| 48.7k| const size_t neg_x = (static_cast(1) << (window_bits + 1)) - x - 1; 1305| 48.7k| size_t digit = sign.select(neg_x, x); 1306| 48.7k| digit = (digit >> 1) + (digit & 1); 1307| 48.7k| return {digit, sign.as_choice()}; 1308| 48.7k|} _ZNK5Botan14divide_precompImE14divmod_2to1_ctEmm: 731| 39.6k| inline constexpr std::pair divmod_2to1_ct(W n1, W n0) const { 732| | /* 733| | * Scale the numerator to match the normalized divisor; the scaling cancels 734| | * in the quotient and is removed from the remainder by the final shift. 735| | */ 736| 39.6k| n1 <<= m_shift; 737| 39.6k| const size_t rshift = WordInfo::bits - m_shift; 738| | /* 739| | * We can't just `n0 >> rshift` because m_shift may be 0 (high bit divisor) 740| | * in which case rshift will be the maximum bit length, and >> by the maximum 741| | * bitlength is undefined behavior despite having an entirely obvious meaning. 742| | * 743| | * However we know m_shift is not equal to the bit length of the word, because 744| | * that would imply that the divisor is 0. Thus rshift must be >= 1. So split 745| | * the shift into two phases (first rshift-1, then 1) 746| | */ 747| 39.6k| n1 |= (n0 >> 1) >> (rshift - 1); 748| 39.6k| n0 <<= m_shift; 749| | 750| 39.6k| const auto [q, scaled_r] = div2by1_preinv(n1, n0, m_norm_divisor, m_reciprocal); 751| 39.6k| const W r = scaled_r >> m_shift; 752| 39.6k| return std::make_pair(q, r); 753| 39.6k| } _ZN5Botan14divide_precompImE14div2by1_preinvEmmmm: 782| 39.6k| static constexpr std::pair div2by1_preinv(W u1, W u0, W D, W v) { 783| | // Steps 1-3: = v*u1; += ; q1 += 1 784| 39.6k| W q1 = u0; 785| 39.6k| const W q0 = word_madd2(u1, v, &q1); // = u1*v + u0 786| 39.6k| q1 += u1 + 1; 787| | 788| | // Step 4 789| 39.6k| W r = u0 - q1 * D; 790| | 791| | // Steps 5-7: If r >= q0 { q1 -= 1; r += d; } 792| 39.6k| const auto fix_down = CT::Mask::is_gt(r, q0); 793| 39.6k| q1 -= fix_down.if_set_return(1); 794| 39.6k| r += fix_down.if_set_return(D); 795| | 796| | // Steps 8-10: if r >= D { q1 += 1; r -= D; } 797| 39.6k| const auto fix_up = CT::Mask::is_gte(r, D); 798| 39.6k| q1 += fix_up.if_set_return(1); 799| 39.6k| r -= fix_up.if_set_return(D); 800| | 801| | // Step 11 802| 39.6k| return std::make_pair(q1, r); 803| 39.6k| } _ZN5Botan18reciprocal_word_ctITkNS_8WordTypeEmEET_S1_: 649| 13.0k|constexpr W reciprocal_word_ct(W D) { 650| 13.0k| BOTAN_DEBUG_ASSERT((D & WordInfo::top_bit) != 0); ------------------ | | 137| 13.0k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 13.0k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 13.0k] | | ------------------ ------------------ 651| | 652| | // Bit serial long division of ((~D) || (2^b - 1)) / D, with all of the 653| | // conditional logic computed via masks 654| 13.0k| W remainder = static_cast(~D); 655| 13.0k| W quotient = 0; 656| | 657| 847k| for(size_t i = 0; i != WordInfo::bits; ++i) { ------------------ | Branch (657:22): [True: 834k, False: 13.0k] ------------------ 658| 834k| const auto carry = CT::Mask::expand_top_bit(remainder); 659| 834k| remainder = static_cast((remainder << 1) | 1); 660| 834k| quotient <<= 1; 661| | 662| 834k| const auto sub = carry | CT::Mask::is_gte(remainder, D); 663| 834k| remainder -= sub.if_set_return(D); 664| 834k| quotient |= sub.if_set_return(1); 665| 834k| } 666| | 667| 13.0k| return quotient; 668| 13.0k|} _ZN5Botan14divide_precompImE5setupEm: 694| 13.0k| static constexpr divide_precomp setup(W divisor) { 695| 13.0k| const size_t shift = WordInfo::bits - high_bit(divisor); 696| 13.0k| const W norm_divisor = divisor << shift; 697| 13.0k| const W reciprocal = reciprocal_word_ct(norm_divisor); 698| 13.0k| return divide_precomp(divisor, shift, norm_divisor, reciprocal); 699| 13.0k| } _ZN5Botan11bigint_add2ITkNS_8WordTypeEmEET_PS1_mPKS1_m: 97| 440k|inline constexpr auto bigint_add2(W x[], size_t x_size, const W y[], size_t y_size) -> W { 98| 440k| W carry = 0; 99| | 100| 440k| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 71| 440k| do { \ | | 72| 440k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 440k| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 440k] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 440k| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 440k] | | ------------------ ------------------ 101| | 102| 440k| const size_t blocks = y_size - (y_size % 8); 103| | 104| 640k| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (104:22): [True: 200k, False: 440k] ------------------ 105| 200k| carry = word8_add2(x + i, y + i, carry); 106| 200k| } 107| | 108| 1.96M| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (108:27): [True: 1.52M, False: 440k] ------------------ 109| 1.52M| x[i] = word_add(x[i], y[i], &carry); 110| 1.52M| } 111| | 112| 503k| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (112:27): [True: 62.6k, False: 440k] ------------------ 113| 62.6k| x[i] = word_add(x[i], static_cast(0), &carry); 114| 62.6k| } 115| | 116| 440k| return carry; 117| 440k|} _ZN5Botan11bigint_sub2ITkNS_8WordTypeEmEET_PS1_mPKS1_m: 151| 8.17k|inline constexpr auto bigint_sub2(W x[], size_t x_size, const W y[], size_t y_size) -> W { 152| 8.17k| W borrow = 0; 153| | 154| 8.17k| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 71| 8.17k| do { \ | | 72| 8.17k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 8.17k| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 8.17k] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 8.17k| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 8.17k] | | ------------------ ------------------ 155| | 156| 8.17k| const size_t blocks = y_size - (y_size % 8); 157| | 158| 10.0k| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (158:22): [True: 1.83k, False: 8.17k] ------------------ 159| 1.83k| borrow = word8_sub2(x + i, y + i, borrow); 160| 1.83k| } 161| | 162| 52.6k| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (162:27): [True: 44.4k, False: 8.17k] ------------------ 163| 44.4k| x[i] = word_sub(x[i], y[i], &borrow); 164| 44.4k| } 165| | 166| 8.87k| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (166:27): [True: 703, False: 8.17k] ------------------ 167| 703| x[i] = word_sub(x[i], static_cast(0), &borrow); 168| 703| } 169| | 170| 8.17k| return borrow; 171| 8.17k|} _ZN5Botan11bigint_add3ITkNS_8WordTypeEmEET_PS1_PKS1_mS4_m: 123| 3.76M|inline constexpr auto bigint_add3(W z[], const W x[], size_t x_size, const W y[], size_t y_size) -> W { 124| 3.76M| if(x_size < y_size) { ------------------ | Branch (124:7): [True: 614, False: 3.76M] ------------------ 125| 614| return bigint_add3(z, y, y_size, x, x_size); 126| 614| } 127| | 128| 3.76M| W carry = 0; 129| | 130| 3.76M| const size_t blocks = y_size - (y_size % 8); 131| | 132| 3.78M| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (132:22): [True: 20.7k, False: 3.76M] ------------------ 133| 20.7k| carry = word8_add3(z + i, x + i, y + i, carry); 134| 20.7k| } 135| | 136| 18.7M| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (136:27): [True: 14.9M, False: 3.76M] ------------------ 137| 14.9M| z[i] = word_add(x[i], y[i], &carry); 138| 14.9M| } 139| | 140| 3.77M| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (140:27): [True: 11.9k, False: 3.76M] ------------------ 141| 11.9k| z[i] = word_add(x[i], static_cast(0), &carry); 142| 11.9k| } 143| | 144| 3.76M| return carry; 145| 3.76M|} _ZN5Botan14bigint_cnd_addITkNS_8WordTypeEmEET_S1_PS1_PKS1_m: 48| 260k|inline constexpr W bigint_cnd_add(W cnd, W x[], const W y[], size_t size) { 49| 260k| const auto mask = CT::Mask::expand(cnd).value(); 50| | 51| 260k| W carry = 0; 52| | 53| 1.48M| for(size_t i = 0; i != size; ++i) { ------------------ | Branch (53:22): [True: 1.22M, False: 260k] ------------------ 54| 1.22M| x[i] = word_add(x[i], y[i] & mask, &carry); 55| 1.22M| } 56| | 57| 260k| return (mask & carry); 58| 260k|} _ZN5Botan14bigint_linmul3ITkNS_8WordTypeEmEEvPT_PKS1_mS1_: 419| 82|inline constexpr void bigint_linmul3(W z[], const W x[], size_t x_size, W y) { 420| 82| const size_t blocks = x_size - (x_size % 8); 421| | 422| 82| W carry = 0; 423| | 424| 82| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (424:22): [True: 0, False: 82] ------------------ 425| 0| carry = word8_linmul3(z + i, x + i, y, carry); 426| 0| } 427| | 428| 174| for(size_t i = blocks; i != x_size; ++i) { ------------------ | Branch (428:27): [True: 92, False: 82] ------------------ 429| 92| z[i] = word_madd2(x[i], y, &carry); 430| 92| } 431| | 432| 82| z[x_size] = carry; 433| 82|} _ZN5Botan14bigint_linmul2ITkNS_8WordTypeEmEET_PS1_mS1_: 408| 4.27k|[[nodiscard]] inline constexpr auto bigint_linmul2(W x[], size_t x_size, W y) -> W { 409| 4.27k| W carry = 0; 410| | 411| 37.4k| for(size_t i = 0; i != x_size; ++i) { ------------------ | Branch (411:22): [True: 33.1k, False: 4.27k] ------------------ 412| 33.1k| x[i] = word_madd2(x[i], y, &carry); 413| 33.1k| } 414| | 415| 4.27k| return carry; 416| 4.27k|} _ZN5Botan14divide_precompImE13setup_vartimeEm: 686| 5.66k| static constexpr divide_precomp setup_vartime(W divisor) { 687| 5.66k| const size_t shift = WordInfo::bits - high_bit(divisor); 688| 5.66k| const W norm_divisor = divisor << shift; 689| 5.66k| const W reciprocal = reciprocal_word(norm_divisor); 690| 5.66k| return divide_precomp(divisor, shift, norm_divisor, reciprocal); 691| 5.66k| } _ZN5Botan15reciprocal_wordITkNS_8WordTypeEmEET_S1_: 577| 5.66k|constexpr W reciprocal_word(W D) { 578| 5.66k| BOTAN_DEBUG_ASSERT((D & WordInfo::top_bit) != 0); ------------------ | | 137| 5.66k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 5.66k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 5.66k] | | ------------------ ------------------ 579| | 580| | /* 581| | * Subtracting 2^b*D from the numerator gives 582| | * v = floor(((~D)*2^b + (2^b - 1)) / D). Since D is normalized, ~D < D 583| | * and the quotient fits in a word. See the first part of Section III A 584| | * in the paper. 585| | */ 586| | if constexpr(sizeof(W) == 4) { 587| | const auto nD = ~D; // Work around spurious MSVC warning 588| | const typename WordInfo::dword n = 589| | (static_cast::dword>(nD) << WordInfo::bits) | WordInfo::max; 590| | return static_cast(n / D); 591| 5.66k| } else { 592| 5.66k| if(!std::is_constant_evaluated()) { ------------------ | Branch (592:10): [True: 5.66k, Folded] ------------------ 593| 5.66k|#if defined(BOTAN_MP_USE_X86_64_ASM) 594| 5.66k| W quotient = 0; 595| 5.66k| W remainder = 0; 596| | // NOLINTNEXTLINE(*-no-assembler) 597| 5.66k| asm("divq %[d]" 598| 5.66k| : "=a"(quotient), "=d"(remainder) 599| 5.66k| : [d] "r"(D), "a"(WordInfo::max), "d"(static_cast(~D)) 600| 5.66k| : "cc"); 601| 5.66k| return quotient; 602| |#elif !defined(BOTAN_BUILD_COMPILER_IS_CLANGCL) 603| | /* clang-cl has a bug where on encountering a 128/64 division it emits 604| | * a call to __udivti3() but then fails to link the relevant builtin into 605| | * the binary, causing a link failure. Work around this by simply omitting 606| | * such code for clang-cl 607| | * 608| | * See https://github.com/llvm/llvm-project/issues/25679 609| | */ 610| | if constexpr(WordInfo::dword_is_native) { 611| | typename WordInfo::dword n = 612| | (static_cast::dword>(~D) << WordInfo::bits) | WordInfo::max; 613| | return static_cast(n / D); 614| | } 615| |#endif 616| 5.66k| } 617| | 618| | // Algorithm 2 of Möller and Granlund 619| 0| const W d0 = D & 1; 620| 0| const W d9 = D >> 55; 621| 0| const W d40 = (D >> 24) + 1; 622| 0| const W d63 = (D >> 1) + d0; // ceil(D/2) 623| | 624| | // This division is done with a table lookup in the paper 625| 0| const W v0 = ((W(1) << 19) - (W(3) << 8)) / d9; 626| 0| const W v1 = (v0 << 11) - ((v0 * v0 * d40) >> 40) - 1; 627| 0| const W v2 = (v1 << 13) + ((v1 * ((W(1) << 60) - v1 * d40)) >> 47); 628| | 629| 0| const W e = W(0) - v2 * d63 + (v2 >> 1) * d0; 630| | 631| 0| W product_hi = 0; 632| 0| word_madd2(v2, e, &product_hi); 633| 0| const W v3 = (v2 << 31) + (product_hi >> 1); 634| | 635| | // Compute floor((v3 + 2^64 + 1) * D / 2^64) modulo 2^64 636| 0| product_hi = D; 637| 0| word_madd2(v3, D, &product_hi); 638| 0| return v3 - D - product_hi; 639| 5.66k| } 640| 5.66k|} _ZN5Botan14divide_precompImEC2Emmmm: 771| 18.6k| m_divisor(divisor), m_shift(shift), m_norm_divisor(norm_divisor), m_reciprocal(reciprocal) {} _ZNK5Botan14divide_precompImE8mod_2to1Emm: 767| 4.99k| inline constexpr W mod_2to1(W n1, W n0) const { return this->divmod_2to1_vartime(n1, n0).second; } _ZNK5Botan14divide_precompImE19divmod_2to1_vartimeEmm: 709| 8.68k| inline constexpr std::pair divmod_2to1_vartime(W n1, W n0) const { 710| 8.68k| if(m_divisor == WordInfo::max) { ------------------ | Branch (710:13): [True: 0, False: 8.68k] ------------------ 711| 0| const W q = div_2to1_max_d(n1, n0); 712| 0| const W r = static_cast(n0 + q); 713| 0| return std::make_pair(q, r); 714| 0| } 715| | 716| 8.68k| if(m_divisor == WordInfo::top_bit) { ------------------ | Branch (716:13): [True: 0, False: 8.68k] ------------------ 717| | // Simply a shift by N-1 bits 718| 0| const W q = (n1 << 1) | (n0 >> (WordInfo::bits - 1)); 719| 0| const W r = static_cast(n0 & (WordInfo::top_bit - 1)); 720| 0| return std::make_pair(q, r); 721| 0| } 722| | 723| 8.68k| return divmod_2to1_ct(n1, n0); 724| 8.68k| } _ZN5Botan11bigint_shr1ITkNS_8WordTypeEmEEvPT_mm: 334| 144k|inline constexpr void bigint_shr1(W x[], size_t x_size, size_t shift) { 335| 144k| const size_t word_shift = shift / WordInfo::bits; 336| 144k| const size_t bit_shift = shift % WordInfo::bits; 337| | 338| 144k| const size_t top = x_size >= word_shift ? (x_size - word_shift) : 0; ------------------ | Branch (338:23): [True: 144k, False: 0] ------------------ 339| | 340| 144k| if(top > 0) { ------------------ | Branch (340:7): [True: 144k, False: 0] ------------------ 341| 144k| unchecked_copy_memory(x, x + word_shift, top); 342| 144k| } 343| 144k| zeroize_buffer(x + top, std::min(word_shift, x_size)); 344| | 345| 144k| const auto carry_mask = CT::Mask::expand(bit_shift); 346| 144k| const W carry_shift = carry_mask.if_set_return(WordInfo::bits - bit_shift); 347| | 348| 144k| W carry = 0; 349| | 350| 725k| for(size_t i = 0; i != top; ++i) { ------------------ | Branch (350:22): [True: 581k, False: 144k] ------------------ 351| 581k| const W w = x[top - i - 1]; 352| 581k| x[top - i - 1] = (w >> bit_shift) | carry; 353| 581k| carry = carry_mask.if_set_return(w << carry_shift); 354| 581k| } 355| 144k|} _ZN5Botan11bigint_shr2ITkNS_8WordTypeEmEEvPT_mPKS1_mm: 381| 141|inline constexpr void bigint_shr2(W y[], size_t y_size, const W x[], size_t x_size, size_t shift) { 382| 141| const size_t word_shift = shift / WordInfo::bits; 383| 141| const size_t bit_shift = shift % WordInfo::bits; 384| 141| const size_t new_size = x_size < word_shift ? 0 : (x_size - word_shift); ------------------ | Branch (384:28): [True: 0, False: 141] ------------------ 385| | 386| 141| BOTAN_ASSERT_NOMSG(new_size <= y_size); ------------------ | | 84| 141| do { \ | | 85| 141| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 141| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 141] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 141| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 141] | | ------------------ ------------------ 387| | 388| 141| if(new_size > 0) { ------------------ | Branch (388:7): [True: 141, False: 0] ------------------ 389| 141| unchecked_copy_memory(y, x + word_shift, new_size); 390| 141| } 391| 141| zeroize_buffer(y + new_size, y_size - new_size); 392| | 393| 141| const auto carry_mask = CT::Mask::expand(bit_shift); 394| 141| const W carry_shift = carry_mask.if_set_return(WordInfo::bits - bit_shift); 395| | 396| 141| W carry = 0; 397| 705| for(size_t i = new_size; i > 0; --i) { ------------------ | Branch (397:29): [True: 564, False: 141] ------------------ 398| 564| W w = y[i - 1]; 399| 564| y[i - 1] = (w >> bit_shift) | carry; 400| 564| carry = carry_mask.if_set_return(w << carry_shift); 401| 564| } 402| 141|} _ZN5Botan13bigint_submulITkNS_8WordTypeEmEET_PS1_PKS1_mS1_: 442| 30.9k|inline constexpr auto bigint_submul(W z[], const W y[], size_t N, W q) -> W { 443| 30.9k| W mul_carry = 0; 444| 30.9k| W borrow = 0; 445| | 446| 229k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (446:22): [True: 198k, False: 30.9k] ------------------ 447| 198k| const W t = word_madd2(y[i], q, &mul_carry); 448| 198k| z[i] = word_sub(z[i], t, &borrow); 449| 198k| } 450| | 451| | // Both mul_carry <= W_max - 1 and borrow <= 1, so this cannot overflow 452| 30.9k| return mul_carry + borrow; 453| 30.9k|} _ZN5Botan14bigint_sub_absITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPS3_PKS3_S7_mS5_: 282| 8.30k|inline constexpr auto bigint_sub_abs(W z[], const W x[], const W y[], size_t N, W ws[]) -> CT::Mask { 283| | // Subtract in both direction then conditional copy out the result 284| | 285| 8.30k| W* ws0 = ws; 286| 8.30k| W* ws1 = ws + N; 287| | 288| 8.30k| W borrow0 = 0; 289| 8.30k| W borrow1 = 0; 290| | 291| 8.30k| const size_t blocks = N - (N % 8); 292| | 293| 10.6k| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (293:22): [True: 2.36k, False: 8.30k] ------------------ 294| 2.36k| borrow0 = word8_sub3(ws0 + i, x + i, y + i, borrow0); 295| 2.36k| borrow1 = word8_sub3(ws1 + i, y + i, x + i, borrow1); 296| 2.36k| } 297| | 298| 44.9k| for(size_t i = blocks; i != N; ++i) { ------------------ | Branch (298:27): [True: 36.6k, False: 8.30k] ------------------ 299| 36.6k| ws0[i] = word_sub(x[i], y[i], &borrow0); 300| 36.6k| ws1[i] = word_sub(y[i], x[i], &borrow1); 301| 36.6k| } 302| | 303| 8.30k| return CT::conditional_copy_mem(borrow0, z, ws1, ws0, N); 304| 8.30k|} _ZN5Botan14bigint_cnd_subITkNS_8WordTypeEmEET_S1_PS1_PKS1_m: 65| 128k|inline constexpr auto bigint_cnd_sub(W cnd, W x[], const W y[], size_t size) -> W { 66| 128k| const auto mask = CT::Mask::expand(cnd).value(); 67| | 68| 128k| W carry = 0; 69| | 70| 646k| for(size_t i = 0; i != size; ++i) { ------------------ | Branch (70:22): [True: 518k, False: 128k] ------------------ 71| 518k| x[i] = word_sub(x[i], y[i] & mask, &carry); 72| 518k| } 73| | 74| 128k| return (mask & carry); 75| 128k|} _ZN5Botan14bigint_cnd_absITkNS_8WordTypeEmEEvT_PS1_m: 83| 64.1k|inline constexpr void bigint_cnd_abs(W cnd, W x[], size_t size) { 84| 64.1k| const auto mask = CT::Mask::expand(cnd); 85| | 86| 64.1k| W carry = mask.if_set_return(1); 87| 319k| for(size_t i = 0; i != size; ++i) { ------------------ | Branch (87:22): [True: 255k, False: 64.1k] ------------------ 88| 255k| const W z = word_add(~x[i], static_cast(0), &carry); 89| 255k| x[i] = mask.select(z, x[i]); 90| 255k| } 91| 64.1k|} _ZN5Botan13monty_inverseITkNS_8WordTypeEmEET_S1_: 856| 1.40k|inline constexpr auto monty_inverse(W a) -> W { 857| 1.40k| BOTAN_ARG_CHECK(a % 2 == 1, "Cannot compute Montgomery inverse of an even integer"); ------------------ | | 35| 1.40k| do { \ | | 36| 1.40k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.40k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.40k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.40k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.40k] | | ------------------ ------------------ 858| | 859| | // Newton's Method, following https://lemire.me/blog/2017/09/18/computing-the-inverse-of-odd-integers/ 860| | 861| 1.40k| constexpr size_t iter = WordInfo::bits == 64 ? 4 : 3; ------------------ | Branch (861:28): [True: 0, Folded] ------------------ 862| | 863| | // Initial guess provides 5 bits of accuracy 864| 1.40k| W r = (3 * a) ^ 2; 865| | 866| | // Each iteration doubles the accuracy 867| 7.00k| for(size_t i = 0; i != iter; ++i) { ------------------ | Branch (867:22): [True: 5.60k, False: 1.40k] ------------------ 868| 5.60k| r = r * (2 - r * a); 869| 5.60k| } 870| | 871| | // Now invert in addition space 872| 1.40k| r = (WordInfo::max - r) + 1; 873| | 874| 1.40k| return r; 875| 1.40k|} _ZN5Botan22bigint_monty_maybe_subITkNS_8WordTypeEmEEvmPT_S1_PKS1_S4_: 228| 3.82M|inline constexpr void bigint_monty_maybe_sub(size_t N, W z[], W x0, const W x[], const W p[]) { 229| 3.82M| W borrow = 0; 230| | 231| 3.82M| const size_t blocks = N - (N % 8); 232| | 233| 3.84M| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (233:22): [True: 27.8k, False: 3.82M] ------------------ 234| 27.8k| borrow = word8_sub3(z + i, x + i, p + i, borrow); 235| 27.8k| } 236| | 237| 18.9M| for(size_t i = blocks; i != N; ++i) { ------------------ | Branch (237:27): [True: 15.1M, False: 3.82M] ------------------ 238| 15.1M| z[i] = word_sub(x[i], p[i], &borrow); 239| 15.1M| } 240| | 241| 3.82M| borrow = (x0 - borrow) > x0; 242| | 243| 3.82M| CT::conditional_assign_mem(borrow, z, x, N); 244| 3.82M|} _ZN5Botan9comba_sqrILm4ETkNS_8WordTypeEmEEvPT0_PKS1_: 1007| 1.01M|constexpr inline void comba_sqr(W z[2 * N], const W x[N]) { 1008| 1.01M| if(!std::is_constant_evaluated()) { ------------------ | Branch (1008:7): [True: 1.01M, Folded] ------------------ 1009| 1.01M| if constexpr(std::same_as && N == 4) { 1010| 1.01M| return bigint_comba_sqr4(z, x); 1011| 1.01M| } 1012| | if constexpr(std::same_as && N == 6) { 1013| | return bigint_comba_sqr6(z, x); 1014| | } 1015| | if constexpr(std::same_as && N == 7) { 1016| | return bigint_comba_sqr7(z, x); 1017| | } 1018| | if constexpr(std::same_as && N == 8) { 1019| | return bigint_comba_sqr8(z, x); 1020| | } 1021| | if constexpr(std::same_as && N == 9) { 1022| | return bigint_comba_sqr9(z, x); 1023| | } 1024| | if constexpr(std::same_as && N == 16) { 1025| | return bigint_comba_sqr16(z, x); 1026| | } 1027| 1.01M| } 1028| | 1029| 0| word3 accum; 1030| | 1031| 1.01M| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (1031:22): [True: 0, False: 1.01M] ------------------ 1032| 0| const size_t start = i + 1 < N ? 0 : i + 1 - N; ------------------ | Branch (1032:28): [True: 0, False: 0] ------------------ 1033| 0| const size_t end = std::min(N, i + 1); 1034| | 1035| 0| for(size_t j = start; j != end; ++j) { ------------------ | Branch (1035:29): [True: 0, False: 0] ------------------ 1036| 0| accum.mul(x[j], x[i - j]); 1037| 0| } 1038| 0| z[i] = accum.extract(); 1039| 0| } 1040| 1.01M|} _ZN5Botan9comba_mulILm4ETkNS_8WordTypeEmEEvPT0_PKS1_S4_: 971| 88.1k|constexpr inline void comba_mul(W z[2 * N], const W x[N], const W y[N]) { 972| 88.1k| if(!std::is_constant_evaluated()) { ------------------ | Branch (972:7): [True: 88.1k, Folded] ------------------ 973| 88.1k| if constexpr(std::same_as && N == 4) { 974| 88.1k| return bigint_comba_mul4(z, x, y); 975| 88.1k| } 976| | if constexpr(std::same_as && N == 6) { 977| | return bigint_comba_mul6(z, x, y); 978| | } 979| | if constexpr(std::same_as && N == 7) { 980| | return bigint_comba_mul7(z, x, y); 981| | } 982| | if constexpr(std::same_as && N == 8) { 983| | return bigint_comba_mul8(z, x, y); 984| | } 985| | if constexpr(std::same_as && N == 9) { 986| | return bigint_comba_mul9(z, x, y); 987| | } 988| | if constexpr(std::same_as && N == 16) { 989| | return bigint_comba_mul16(z, x, y); 990| | } 991| 88.1k| } 992| | 993| 0| word3 accum; 994| | 995| 88.1k| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (995:22): [True: 0, False: 88.1k] ------------------ 996| 0| const size_t start = i + 1 < N ? 0 : i + 1 - N; ------------------ | Branch (996:28): [True: 0, False: 0] ------------------ 997| 0| const size_t end = std::min(N, i + 1); 998| | 999| 0| for(size_t j = start; j != end; ++j) { ------------------ | Branch (999:29): [True: 0, False: 0] ------------------ 1000| 0| accum.mul(x[j], y[i - j]); 1001| 0| } 1002| 0| z[i] = accum.extract(); 1003| 0| } 1004| 88.1k|} _ZN5Botan22bigint_monty_maybe_subILm4ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 257| 10.3M|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 258| 10.3M| W borrow = 0; 259| | 260| 51.8M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (260:22): [True: 41.5M, False: 10.3M] ------------------ 261| 41.5M| z[i] = word_sub(x[i], y[i], &borrow); 262| 41.5M| } 263| | 264| 10.3M| borrow = (x0 - borrow) > x0; 265| | 266| 10.3M| CT::conditional_assign_mem(borrow, z, x, N); 267| 10.3M|} _ZN5Botan22bigint_monty_maybe_subILm6ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 257| 864k|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 258| 864k| W borrow = 0; 259| | 260| 6.04M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (260:22): [True: 5.18M, False: 864k] ------------------ 261| 5.18M| z[i] = word_sub(x[i], y[i], &borrow); 262| 5.18M| } 263| | 264| 864k| borrow = (x0 - borrow) > x0; 265| | 266| 864k| CT::conditional_assign_mem(borrow, z, x, N); 267| 864k|} _ZN5Botan22bigint_monty_maybe_subILm8ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 257| 59.6k|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 258| 59.6k| W borrow = 0; 259| | 260| 536k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (260:22): [True: 476k, False: 59.6k] ------------------ 261| 476k| z[i] = word_sub(x[i], y[i], &borrow); 262| 476k| } 263| | 264| 59.6k| borrow = (x0 - borrow) > x0; 265| | 266| 59.6k| CT::conditional_assign_mem(borrow, z, x, N); 267| 59.6k|} _ZN5Botan22bigint_monty_maybe_subILm16ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 257| 61|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 258| 61| W borrow = 0; 259| | 260| 1.03k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (260:22): [True: 976, False: 61] ------------------ 261| 976| z[i] = word_sub(x[i], y[i], &borrow); 262| 976| } 263| | 264| 61| borrow = (x0 - borrow) > x0; 265| | 266| 61| CT::conditional_assign_mem(borrow, z, x, N); 267| 61|} _ZN5Botan22bigint_monty_maybe_subILm32ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 257| 14|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 258| 14| W borrow = 0; 259| | 260| 462| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (260:22): [True: 448, False: 14] ------------------ 261| 448| z[i] = word_sub(x[i], y[i], &borrow); 262| 448| } 263| | 264| 14| borrow = (x0 - borrow) > x0; 265| | 266| 14| CT::conditional_assign_mem(borrow, z, x, N); 267| 14|} _ZN5Botan10shift_leftILm1ETkNS_8WordTypeEmLm4EEET0_RNSt3__15arrayIS1_XT1_EEE: 878| 12.5k|inline constexpr W shift_left(std::array& x) { 879| 12.5k| static_assert(N >= 1, "Invalid input size"); 880| 12.5k| static_assert(S > 0, "Zero shift not supported"); 881| 12.5k| static_assert(S < WordInfo::bits, "Shift too large"); 882| | 883| 12.5k| const W carry = x[N - 1] >> (WordInfo::bits - S); 884| | 885| 50.0k| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (885:26): [True: 37.5k, False: 12.5k] ------------------ 886| 37.5k| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 887| 37.5k| } 888| 12.5k| x[0] <<= S; 889| | 890| 12.5k| return carry; 891| 12.5k|} _ZN5Botan16read_window_bitsILm4EmLm4EEEmNSt3__14spanIKT0_XT1_EEEm: 1274| 11.7k|constexpr size_t read_window_bits(std::span words, size_t offset) { 1275| 11.7k| static_assert(WindowBits >= 1 && WindowBits <= 7); 1276| | 1277| 11.7k| constexpr uint8_t WindowMask = static_cast(1 << WindowBits) - 1; 1278| | 1279| 11.7k| constexpr size_t W_bits = sizeof(W) * 8; 1280| 11.7k| const auto bit_shift = offset % W_bits; 1281| 11.7k| const auto word_offset = words.size() - 1 - (offset / W_bits); 1282| | 1283| 11.7k| const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0; ------------------ | Branch (1283:36): [True: 11.7k, False: 0] | Branch (1283:74): [True: 0, False: 0] ------------------ 1284| | 1285| 11.7k| const auto w0 = words[word_offset]; 1286| | 1287| 11.7k| if(single_byte_window) { ------------------ | Branch (1287:7): [True: 11.7k, False: 0] ------------------ 1288| 11.7k| return (w0 >> bit_shift) & WindowMask; 1289| 11.7k| } else { 1290| | // Otherwise we must join two words and extract the result 1291| 0| const auto w1 = words[word_offset - 1]; 1292| 0| const auto combined = ((w0 >> bit_shift) | (w1 << (W_bits - bit_shift))); 1293| 0| return combined & WindowMask; 1294| 0| } 1295| 11.7k|} _ZN5Botan11shift_rightILm1ETkNS_8WordTypeEmLm4EEET0_RNSt3__15arrayIS1_XT1_EEE: 894| 1.37k|inline constexpr W shift_right(std::array& x) { 895| 1.37k| static_assert(N >= 1, "Invalid input size"); 896| 1.37k| static_assert(S > 0, "Zero shift not supported"); 897| 1.37k| static_assert(S < WordInfo::bits, "Shift too large"); 898| | 899| 1.37k| const W carry = x[0] << (WordInfo::bits - S); 900| | 901| 5.51k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (901:22): [True: 4.13k, False: 1.37k] ------------------ 902| 4.13k| x[i] = (x[i] >> S) | (x[i + 1] << (WordInfo::bits - S)); 903| 4.13k| } 904| 1.37k| x[N - 1] >>= S; 905| | 906| 1.37k| return carry; 907| 1.37k|} _ZN5Botan12booth_recodeILm6ETkNSt3__117unsigned_integralEmEENS1_4pairImNS_2CT6ChoiceEEET0_: 1311| 48.7k|constexpr std::pair booth_recode(T x) { 1312| 48.7k| static_assert(WindowBits >= 1 && WindowBits <= 16); 1313| 48.7k| return booth_recode(static_cast(x), WindowBits); 1314| 48.7k|} _ZN5Botan9comba_sqrILm6ETkNS_8WordTypeEmEEvPT0_PKS1_: 1007| 789k|constexpr inline void comba_sqr(W z[2 * N], const W x[N]) { 1008| 789k| if(!std::is_constant_evaluated()) { ------------------ | Branch (1008:7): [True: 789k, Folded] ------------------ 1009| | if constexpr(std::same_as && N == 4) { 1010| | return bigint_comba_sqr4(z, x); 1011| | } 1012| 789k| if constexpr(std::same_as && N == 6) { 1013| 789k| return bigint_comba_sqr6(z, x); 1014| 789k| } 1015| | if constexpr(std::same_as && N == 7) { 1016| | return bigint_comba_sqr7(z, x); 1017| | } 1018| | if constexpr(std::same_as && N == 8) { 1019| | return bigint_comba_sqr8(z, x); 1020| | } 1021| | if constexpr(std::same_as && N == 9) { 1022| | return bigint_comba_sqr9(z, x); 1023| | } 1024| | if constexpr(std::same_as && N == 16) { 1025| | return bigint_comba_sqr16(z, x); 1026| | } 1027| 789k| } 1028| | 1029| 0| word3 accum; 1030| | 1031| 789k| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (1031:22): [True: 0, False: 789k] ------------------ 1032| 0| const size_t start = i + 1 < N ? 0 : i + 1 - N; ------------------ | Branch (1032:28): [True: 0, False: 0] ------------------ 1033| 0| const size_t end = std::min(N, i + 1); 1034| | 1035| 0| for(size_t j = start; j != end; ++j) { ------------------ | Branch (1035:29): [True: 0, False: 0] ------------------ 1036| 0| accum.mul(x[j], x[i - j]); 1037| 0| } 1038| 0| z[i] = accum.extract(); 1039| 0| } 1040| 789k|} _ZN5Botan9comba_mulILm6ETkNS_8WordTypeEmEEvPT0_PKS1_S4_: 971| 1.01M|constexpr inline void comba_mul(W z[2 * N], const W x[N], const W y[N]) { 972| 1.01M| if(!std::is_constant_evaluated()) { ------------------ | Branch (972:7): [True: 1.01M, Folded] ------------------ 973| | if constexpr(std::same_as && N == 4) { 974| | return bigint_comba_mul4(z, x, y); 975| | } 976| 1.01M| if constexpr(std::same_as && N == 6) { 977| 1.01M| return bigint_comba_mul6(z, x, y); 978| 1.01M| } 979| | if constexpr(std::same_as && N == 7) { 980| | return bigint_comba_mul7(z, x, y); 981| | } 982| | if constexpr(std::same_as && N == 8) { 983| | return bigint_comba_mul8(z, x, y); 984| | } 985| | if constexpr(std::same_as && N == 9) { 986| | return bigint_comba_mul9(z, x, y); 987| | } 988| | if constexpr(std::same_as && N == 16) { 989| | return bigint_comba_mul16(z, x, y); 990| | } 991| 1.01M| } 992| | 993| 0| word3 accum; 994| | 995| 1.01M| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (995:22): [True: 0, False: 1.01M] ------------------ 996| 0| const size_t start = i + 1 < N ? 0 : i + 1 - N; ------------------ | Branch (996:28): [True: 0, False: 0] ------------------ 997| 0| const size_t end = std::min(N, i + 1); 998| | 999| 0| for(size_t j = start; j != end; ++j) { ------------------ | Branch (999:29): [True: 0, False: 0] ------------------ 1000| 0| accum.mul(x[j], y[i - j]); 1001| 0| } 1002| 0| z[i] = accum.extract(); 1003| 0| } 1004| 1.01M|} _ZN5Botan10shift_leftILm1ETkNS_8WordTypeEmLm6EEET0_RNSt3__15arrayIS1_XT1_EEE: 878| 465k|inline constexpr W shift_left(std::array& x) { 879| 465k| static_assert(N >= 1, "Invalid input size"); 880| 465k| static_assert(S > 0, "Zero shift not supported"); 881| 465k| static_assert(S < WordInfo::bits, "Shift too large"); 882| | 883| 465k| const W carry = x[N - 1] >> (WordInfo::bits - S); 884| | 885| 2.79M| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (885:26): [True: 2.32M, False: 465k] ------------------ 886| 2.32M| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 887| 2.32M| } 888| 465k| x[0] <<= S; 889| | 890| 465k| return carry; 891| 465k|} _ZN5Botan11shift_rightILm1ETkNS_8WordTypeEmLm6EEET0_RNSt3__15arrayIS1_XT1_EEE: 894| 860k|inline constexpr W shift_right(std::array& x) { 895| 860k| static_assert(N >= 1, "Invalid input size"); 896| 860k| static_assert(S > 0, "Zero shift not supported"); 897| 860k| static_assert(S < WordInfo::bits, "Shift too large"); 898| | 899| 860k| const W carry = x[0] << (WordInfo::bits - S); 900| | 901| 5.16M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (901:22): [True: 4.30M, False: 860k] ------------------ 902| 4.30M| x[i] = (x[i] >> S) | (x[i + 1] << (WordInfo::bits - S)); 903| 4.30M| } 904| 860k| x[N - 1] >>= S; 905| | 906| 860k| return carry; 907| 860k|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm12ELm96EEEDaNSt3__14spanIKhXT1_EEE: 1245| 375|inline constexpr auto bytes_to_words(std::span bytes) { 1246| 375| static_assert(L <= WordInfo::bytes * N); 1247| | 1248| 375| std::array r = {}; 1249| | 1250| 375| constexpr size_t full_words = L / WordInfo::bytes; 1251| 375| constexpr size_t extra_bytes = L % WordInfo::bytes; 1252| | 1253| 375| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 1254| | 1255| 4.87k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (1255:22): [True: 4.50k, False: 375] ------------------ 1256| 4.50k| r[i] = load_be(bytes.data(), full_words - 1 - i); 1257| 4.50k| } 1258| | 1259| | if constexpr(extra_bytes > 0) { 1260| | constexpr size_t shift = extra_bytes * 8; 1261| | shift_left(r); 1262| | 1263| | for(size_t i = 0; i != extra_bytes; ++i) { 1264| | const W b0 = bytes[WordInfo::bytes * full_words + i]; 1265| | r[0] |= (b0 << (8 * (extra_bytes - 1 - i))); 1266| | } 1267| | } 1268| | 1269| 375| return r; 1270| 375|} _ZN5Botan16read_window_bitsILm7EhLm48EEEmNSt3__14spanIKT0_XT1_EEEm: 1274| 24.3k|constexpr size_t read_window_bits(std::span words, size_t offset) { 1275| 24.3k| static_assert(WindowBits >= 1 && WindowBits <= 7); 1276| | 1277| 24.3k| constexpr uint8_t WindowMask = static_cast(1 << WindowBits) - 1; 1278| | 1279| 24.3k| constexpr size_t W_bits = sizeof(W) * 8; 1280| 24.3k| const auto bit_shift = offset % W_bits; 1281| 24.3k| const auto word_offset = words.size() - 1 - (offset / W_bits); 1282| | 1283| 24.3k| const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0; ------------------ | Branch (1283:36): [True: 6.37k, False: 18.0k] | Branch (1283:74): [True: 375, False: 17.6k] ------------------ 1284| | 1285| 24.3k| const auto w0 = words[word_offset]; 1286| | 1287| 24.3k| if(single_byte_window) { ------------------ | Branch (1287:7): [True: 6.75k, False: 17.6k] ------------------ 1288| 6.75k| return (w0 >> bit_shift) & WindowMask; 1289| 17.6k| } else { 1290| | // Otherwise we must join two words and extract the result 1291| 17.6k| const auto w1 = words[word_offset - 1]; 1292| 17.6k| const auto combined = ((w0 >> bit_shift) | (w1 << (W_bits - bit_shift))); 1293| 17.6k| return combined & WindowMask; 1294| 17.6k| } 1295| 24.3k|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm6ELm48EEEDaNSt3__14spanIKhXT1_EEE: 1245| 1.99k|inline constexpr auto bytes_to_words(std::span bytes) { 1246| 1.99k| static_assert(L <= WordInfo::bytes * N); 1247| | 1248| 1.99k| std::array r = {}; 1249| | 1250| 1.99k| constexpr size_t full_words = L / WordInfo::bytes; 1251| 1.99k| constexpr size_t extra_bytes = L % WordInfo::bytes; 1252| | 1253| 1.99k| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 1254| | 1255| 13.9k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (1255:22): [True: 11.9k, False: 1.99k] ------------------ 1256| 11.9k| r[i] = load_be(bytes.data(), full_words - 1 - i); 1257| 11.9k| } 1258| | 1259| | if constexpr(extra_bytes > 0) { 1260| | constexpr size_t shift = extra_bytes * 8; 1261| | shift_left(r); 1262| | 1263| | for(size_t i = 0; i != extra_bytes; ++i) { 1264| | const W b0 = bytes[WordInfo::bytes * full_words + i]; 1265| | r[0] |= (b0 << (8 * (extra_bytes - 1 - i))); 1266| | } 1267| | } 1268| | 1269| 1.99k| return r; 1270| 1.99k|} _ZN5Botan10shift_leftILm1ETkNS_8WordTypeEmLm9EEET0_RNSt3__15arrayIS1_XT1_EEE: 878| 2.77M|inline constexpr W shift_left(std::array& x) { 879| 2.77M| static_assert(N >= 1, "Invalid input size"); 880| 2.77M| static_assert(S > 0, "Zero shift not supported"); 881| 2.77M| static_assert(S < WordInfo::bits, "Shift too large"); 882| | 883| 2.77M| const W carry = x[N - 1] >> (WordInfo::bits - S); 884| | 885| 25.0M| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (885:26): [True: 22.2M, False: 2.77M] ------------------ 886| 22.2M| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 887| 22.2M| } 888| 2.77M| x[0] <<= S; 889| | 890| 2.77M| return carry; 891| 2.77M|} _ZN5Botan16read_window_bitsILm3EhLm18446744073709551615EEEmNSt3__14spanIKT0_XT1_EEEm: 1274| 44.8k|constexpr size_t read_window_bits(std::span words, size_t offset) { 1275| 44.8k| static_assert(WindowBits >= 1 && WindowBits <= 7); 1276| | 1277| 44.8k| constexpr uint8_t WindowMask = static_cast(1 << WindowBits) - 1; 1278| | 1279| 44.8k| constexpr size_t W_bits = sizeof(W) * 8; 1280| 44.8k| const auto bit_shift = offset % W_bits; 1281| 44.8k| const auto word_offset = words.size() - 1 - (offset / W_bits); 1282| | 1283| 44.8k| const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0; ------------------ | Branch (1283:36): [True: 33.4k, False: 11.4k] | Branch (1283:74): [True: 522, False: 10.9k] ------------------ 1284| | 1285| 44.8k| const auto w0 = words[word_offset]; 1286| | 1287| 44.8k| if(single_byte_window) { ------------------ | Branch (1287:7): [True: 33.9k, False: 10.9k] ------------------ 1288| 33.9k| return (w0 >> bit_shift) & WindowMask; 1289| 33.9k| } else { 1290| | // Otherwise we must join two words and extract the result 1291| 10.9k| const auto w1 = words[word_offset - 1]; 1292| 10.9k| const auto combined = ((w0 >> bit_shift) | (w1 << (W_bits - bit_shift))); 1293| 10.9k| return combined & WindowMask; 1294| 10.9k| } 1295| 44.8k|} _ZN5Botan22bigint_monty_maybe_subILm9ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 257| 3.18M|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 258| 3.18M| W borrow = 0; 259| | 260| 31.8M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (260:22): [True: 28.6M, False: 3.18M] ------------------ 261| 28.6M| z[i] = word_sub(x[i], y[i], &borrow); 262| 28.6M| } 263| | 264| 3.18M| borrow = (x0 - borrow) > x0; 265| | 266| 3.18M| CT::conditional_assign_mem(borrow, z, x, N); 267| 3.18M|} _ZN5Botan16read_window_bitsILm4EmLm18446744073709551615EEEmNSt3__14spanIKT0_XT1_EEEm: 1274| 36.7k|constexpr size_t read_window_bits(std::span words, size_t offset) { 1275| 36.7k| static_assert(WindowBits >= 1 && WindowBits <= 7); 1276| | 1277| 36.7k| constexpr uint8_t WindowMask = static_cast(1 << WindowBits) - 1; 1278| | 1279| 36.7k| constexpr size_t W_bits = sizeof(W) * 8; 1280| 36.7k| const auto bit_shift = offset % W_bits; 1281| 36.7k| const auto word_offset = words.size() - 1 - (offset / W_bits); 1282| | 1283| 36.7k| const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0; ------------------ | Branch (1283:36): [True: 36.7k, False: 0] | Branch (1283:74): [True: 0, False: 0] ------------------ 1284| | 1285| 36.7k| const auto w0 = words[word_offset]; 1286| | 1287| 36.7k| if(single_byte_window) { ------------------ | Branch (1287:7): [True: 36.7k, False: 0] ------------------ 1288| 36.7k| return (w0 >> bit_shift) & WindowMask; 1289| 36.7k| } else { 1290| | // Otherwise we must join two words and extract the result 1291| 0| const auto w1 = words[word_offset - 1]; 1292| 0| const auto combined = ((w0 >> bit_shift) | (w1 << (W_bits - bit_shift))); 1293| 0| return combined & WindowMask; 1294| 0| } 1295| 36.7k|} _ZN5Botan11shift_rightILm1ETkNS_8WordTypeEmLm9EEET0_RNSt3__15arrayIS1_XT1_EEE: 894| 1.12M|inline constexpr W shift_right(std::array& x) { 895| 1.12M| static_assert(N >= 1, "Invalid input size"); 896| 1.12M| static_assert(S > 0, "Zero shift not supported"); 897| 1.12M| static_assert(S < WordInfo::bits, "Shift too large"); 898| | 899| 1.12M| const W carry = x[0] << (WordInfo::bits - S); 900| | 901| 10.1M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (901:22): [True: 8.98M, False: 1.12M] ------------------ 902| 8.98M| x[i] = (x[i] >> S) | (x[i + 1] << (WordInfo::bits - S)); 903| 8.98M| } 904| 1.12M| x[N - 1] >>= S; 905| | 906| 1.12M| return carry; 907| 1.12M|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm4ELm28EEEDaNSt3__14spanIKhXT1_EEE: 1245| 210|inline constexpr auto bytes_to_words(std::span bytes) { 1246| 210| static_assert(L <= WordInfo::bytes * N); 1247| | 1248| 210| std::array r = {}; 1249| | 1250| 210| constexpr size_t full_words = L / WordInfo::bytes; 1251| 210| constexpr size_t extra_bytes = L % WordInfo::bytes; 1252| | 1253| 210| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 1254| | 1255| 840| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (1255:22): [True: 630, False: 210] ------------------ 1256| 630| r[i] = load_be(bytes.data(), full_words - 1 - i); 1257| 630| } 1258| | 1259| 210| if constexpr(extra_bytes > 0) { 1260| 210| constexpr size_t shift = extra_bytes * 8; 1261| 210| shift_left(r); 1262| | 1263| 1.05k| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (1263:25): [True: 840, False: 210] ------------------ 1264| 840| const W b0 = bytes[WordInfo::bytes * full_words + i]; 1265| 840| r[0] |= (b0 << (8 * (extra_bytes - 1 - i))); 1266| 840| } 1267| 210| } 1268| | 1269| 210| return r; 1270| 210|} _ZN5Botan10shift_leftILm32ETkNS_8WordTypeEmLm4EEET0_RNSt3__15arrayIS1_XT1_EEE: 878| 210|inline constexpr W shift_left(std::array& x) { 879| 210| static_assert(N >= 1, "Invalid input size"); 880| 210| static_assert(S > 0, "Zero shift not supported"); 881| 210| static_assert(S < WordInfo::bits, "Shift too large"); 882| | 883| 210| const W carry = x[N - 1] >> (WordInfo::bits - S); 884| | 885| 840| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (885:26): [True: 630, False: 210] ------------------ 886| 630| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 887| 630| } 888| 210| x[0] <<= S; 889| | 890| 210| return carry; 891| 210|} _ZN5Botan13redc_crandallITkNS_8WordTypeEmLm4ETnT_Lm4294968273EEENSt3__15arrayIS1_XT0_EEENS2_4spanIKS1_XmlLi2ET0_EEE: 1167| 28.5k|constexpr std::array redc_crandall(std::span z) { 1168| 28.5k| static_assert(N >= 2); 1169| | 1170| 28.5k| std::array hi = {}; 1171| | 1172| | // hi = hi * c + lo 1173| | 1174| 28.5k| W carry = 0; 1175| 142k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (1175:22): [True: 114k, False: 28.5k] ------------------ 1176| 114k| hi[i] = word_madd3(z[i + N], C, z[i], &carry); 1177| 114k| } 1178| | 1179| | // hi += carry * C 1180| 28.5k| W carry_c[2] = {0}; 1181| 28.5k| carry_c[0] = word_madd2(carry, C, &carry_c[1]); 1182| | 1183| 28.5k| carry = bigint_add2(hi.data(), N, carry_c, 2); 1184| | 1185| 28.5k| constexpr W P0 = WordInfo::max - (C - 1); 1186| | 1187| 28.5k| std::array r = {}; 1188| | 1189| 28.5k| W borrow = 0; 1190| | 1191| | /* 1192| | * For undetermined reasons, on GCC (only) removing this asm block causes 1193| | * massive (up to 20%) performance regressions in secp256k1. 1194| | * 1195| | * The generated code without the asm seems quite reasonable, and timing 1196| | * repeated calls to redc_crandall with the cycle counter show that GCC 1197| | * computes it in about the same number of cycles with or without the asm. 1198| | * 1199| | * So the cause of the regression is unclear. But it is reproducible across 1200| | * machines and GCC versions. 1201| | */ 1202| |#if defined(BOTAN_MP_USE_X86_64_ASM) && defined(__GNUC__) && !defined(__clang__) 1203| | if constexpr(N == 4 && std::same_as) { 1204| | if(!std::is_constant_evaluated()) { 1205| | asm volatile(R"( 1206| | movq 0(%[x]), %[borrow] 1207| | subq %[p0], %[borrow] 1208| | movq %[borrow], 0(%[r]) 1209| | movq 8(%[x]), %[borrow] 1210| | sbbq $-1, %[borrow] 1211| | movq %[borrow], 8(%[r]) 1212| | movq 16(%[x]), %[borrow] 1213| | sbbq $-1, %[borrow] 1214| | movq %[borrow], 16(%[r]) 1215| | movq 24(%[x]), %[borrow] 1216| | sbbq $-1, %[borrow] 1217| | movq %[borrow], 24(%[r]) 1218| | sbbq %[borrow],%[borrow] 1219| | negq %[borrow] 1220| | )" 1221| | : [borrow] "=r"(borrow) 1222| | : [x] "r"(hi.data()), [p0] "r"(P0), [r] "r"(r.data()), "0"(borrow) 1223| | : "cc", "memory"); 1224| | 1225| | borrow = (carry - borrow) > carry; 1226| | CT::conditional_assign_mem(borrow, r.data(), hi.data(), N); 1227| | return r; 1228| | } 1229| | } 1230| |#endif 1231| | 1232| 28.5k| r[0] = word_sub(hi[0], P0, &borrow); 1233| 114k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (1233:22): [True: 85.6k, False: 28.5k] ------------------ 1234| 85.6k| r[i] = word_sub(hi[i], WordInfo::max, &borrow); 1235| 85.6k| } 1236| | 1237| 28.5k| borrow = (carry - borrow) > carry; 1238| | 1239| 28.5k| CT::conditional_assign_mem(borrow, r.data(), hi.data(), N); 1240| | 1241| 28.5k| return r; 1242| 28.5k|} _ZN5Botan9comba_sqrILm9ETkNS_8WordTypeEmEEvPT0_PKS1_: 1007| 800k|constexpr inline void comba_sqr(W z[2 * N], const W x[N]) { 1008| 800k| if(!std::is_constant_evaluated()) { ------------------ | Branch (1008:7): [True: 800k, Folded] ------------------ 1009| | if constexpr(std::same_as && N == 4) { 1010| | return bigint_comba_sqr4(z, x); 1011| | } 1012| | if constexpr(std::same_as && N == 6) { 1013| | return bigint_comba_sqr6(z, x); 1014| | } 1015| | if constexpr(std::same_as && N == 7) { 1016| | return bigint_comba_sqr7(z, x); 1017| | } 1018| | if constexpr(std::same_as && N == 8) { 1019| | return bigint_comba_sqr8(z, x); 1020| | } 1021| 800k| if constexpr(std::same_as && N == 9) { 1022| 800k| return bigint_comba_sqr9(z, x); 1023| 800k| } 1024| | if constexpr(std::same_as && N == 16) { 1025| | return bigint_comba_sqr16(z, x); 1026| | } 1027| 800k| } 1028| | 1029| 0| word3 accum; 1030| | 1031| 800k| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (1031:22): [True: 0, False: 800k] ------------------ 1032| 0| const size_t start = i + 1 < N ? 0 : i + 1 - N; ------------------ | Branch (1032:28): [True: 0, False: 0] ------------------ 1033| 0| const size_t end = std::min(N, i + 1); 1034| | 1035| 0| for(size_t j = start; j != end; ++j) { ------------------ | Branch (1035:29): [True: 0, False: 0] ------------------ 1036| 0| accum.mul(x[j], x[i - j]); 1037| 0| } 1038| 0| z[i] = accum.extract(); 1039| 0| } 1040| 800k|} _ZN5Botan9comba_mulILm9ETkNS_8WordTypeEmEEvPT0_PKS1_S4_: 971| 1.02M|constexpr inline void comba_mul(W z[2 * N], const W x[N], const W y[N]) { 972| 1.02M| if(!std::is_constant_evaluated()) { ------------------ | Branch (972:7): [True: 1.02M, Folded] ------------------ 973| | if constexpr(std::same_as && N == 4) { 974| | return bigint_comba_mul4(z, x, y); 975| | } 976| | if constexpr(std::same_as && N == 6) { 977| | return bigint_comba_mul6(z, x, y); 978| | } 979| | if constexpr(std::same_as && N == 7) { 980| | return bigint_comba_mul7(z, x, y); 981| | } 982| | if constexpr(std::same_as && N == 8) { 983| | return bigint_comba_mul8(z, x, y); 984| | } 985| 1.02M| if constexpr(std::same_as && N == 9) { 986| 1.02M| return bigint_comba_mul9(z, x, y); 987| 1.02M| } 988| | if constexpr(std::same_as && N == 16) { 989| | return bigint_comba_mul16(z, x, y); 990| | } 991| 1.02M| } 992| | 993| 0| word3 accum; 994| | 995| 1.02M| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (995:22): [True: 0, False: 1.02M] ------------------ 996| 0| const size_t start = i + 1 < N ? 0 : i + 1 - N; ------------------ | Branch (996:28): [True: 0, False: 0] ------------------ 997| 0| const size_t end = std::min(N, i + 1); 998| | 999| 0| for(size_t j = start; j != end; ++j) { ------------------ | Branch (999:29): [True: 0, False: 0] ------------------ 1000| 0| accum.mul(x[j], y[i - j]); 1001| 0| } 1002| 0| z[i] = accum.extract(); 1003| 0| } 1004| 1.02M|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm18ELm132EEEDaNSt3__14spanIKhXT1_EEE: 1245| 280|inline constexpr auto bytes_to_words(std::span bytes) { 1246| 280| static_assert(L <= WordInfo::bytes * N); 1247| | 1248| 280| std::array r = {}; 1249| | 1250| 280| constexpr size_t full_words = L / WordInfo::bytes; 1251| 280| constexpr size_t extra_bytes = L % WordInfo::bytes; 1252| | 1253| 280| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 1254| | 1255| 4.76k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (1255:22): [True: 4.48k, False: 280] ------------------ 1256| 4.48k| r[i] = load_be(bytes.data(), full_words - 1 - i); 1257| 4.48k| } 1258| | 1259| 280| if constexpr(extra_bytes > 0) { 1260| 280| constexpr size_t shift = extra_bytes * 8; 1261| 280| shift_left(r); 1262| | 1263| 1.40k| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (1263:25): [True: 1.12k, False: 280] ------------------ 1264| 1.12k| const W b0 = bytes[WordInfo::bytes * full_words + i]; 1265| 1.12k| r[0] |= (b0 << (8 * (extra_bytes - 1 - i))); 1266| 1.12k| } 1267| 280| } 1268| | 1269| 280| return r; 1270| 280|} _ZN5Botan10shift_leftILm32ETkNS_8WordTypeEmLm18EEET0_RNSt3__15arrayIS1_XT1_EEE: 878| 280|inline constexpr W shift_left(std::array& x) { 879| 280| static_assert(N >= 1, "Invalid input size"); 880| 280| static_assert(S > 0, "Zero shift not supported"); 881| 280| static_assert(S < WordInfo::bits, "Shift too large"); 882| | 883| 280| const W carry = x[N - 1] >> (WordInfo::bits - S); 884| | 885| 5.04k| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (885:26): [True: 4.76k, False: 280] ------------------ 886| 4.76k| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 887| 4.76k| } 888| 280| x[0] <<= S; 889| | 890| 280| return carry; 891| 280|} _ZN5Botan16read_window_bitsILm7EhLm66EEEmNSt3__14spanIKT0_XT1_EEEm: 1274| 24.3k|constexpr size_t read_window_bits(std::span words, size_t offset) { 1275| 24.3k| static_assert(WindowBits >= 1 && WindowBits <= 7); 1276| | 1277| 24.3k| constexpr uint8_t WindowMask = static_cast(1 << WindowBits) - 1; 1278| | 1279| 24.3k| constexpr size_t W_bits = sizeof(W) * 8; 1280| 24.3k| const auto bit_shift = offset % W_bits; 1281| 24.3k| const auto word_offset = words.size() - 1 - (offset / W_bits); 1282| | 1283| 24.3k| const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0; ------------------ | Branch (1283:36): [True: 6.16k, False: 18.2k] | Branch (1283:74): [True: 0, False: 18.2k] ------------------ 1284| | 1285| 24.3k| const auto w0 = words[word_offset]; 1286| | 1287| 24.3k| if(single_byte_window) { ------------------ | Branch (1287:7): [True: 6.16k, False: 18.2k] ------------------ 1288| 6.16k| return (w0 >> bit_shift) & WindowMask; 1289| 18.2k| } else { 1290| | // Otherwise we must join two words and extract the result 1291| 18.2k| const auto w1 = words[word_offset - 1]; 1292| 18.2k| const auto combined = ((w0 >> bit_shift) | (w1 << (W_bits - bit_shift))); 1293| 18.2k| return combined & WindowMask; 1294| 18.2k| } 1295| 24.3k|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm9ELm66EEEDaNSt3__14spanIKhXT1_EEE: 1245| 1.58k|inline constexpr auto bytes_to_words(std::span bytes) { 1246| 1.58k| static_assert(L <= WordInfo::bytes * N); 1247| | 1248| 1.58k| std::array r = {}; 1249| | 1250| 1.58k| constexpr size_t full_words = L / WordInfo::bytes; 1251| 1.58k| constexpr size_t extra_bytes = L % WordInfo::bytes; 1252| | 1253| 1.58k| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 1254| | 1255| 14.2k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (1255:22): [True: 12.6k, False: 1.58k] ------------------ 1256| 12.6k| r[i] = load_be(bytes.data(), full_words - 1 - i); 1257| 12.6k| } 1258| | 1259| 1.58k| if constexpr(extra_bytes > 0) { 1260| 1.58k| constexpr size_t shift = extra_bytes * 8; 1261| 1.58k| shift_left(r); 1262| | 1263| 4.74k| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (1263:25): [True: 3.16k, False: 1.58k] ------------------ 1264| 3.16k| const W b0 = bytes[WordInfo::bytes * full_words + i]; 1265| 3.16k| r[0] |= (b0 << (8 * (extra_bytes - 1 - i))); 1266| 3.16k| } 1267| 1.58k| } 1268| | 1269| 1.58k| return r; 1270| 1.58k|} _ZN5Botan10shift_leftILm16ETkNS_8WordTypeEmLm9EEET0_RNSt3__15arrayIS1_XT1_EEE: 878| 1.58k|inline constexpr W shift_left(std::array& x) { 879| 1.58k| static_assert(N >= 1, "Invalid input size"); 880| 1.58k| static_assert(S > 0, "Zero shift not supported"); 881| 1.58k| static_assert(S < WordInfo::bits, "Shift too large"); 882| | 883| 1.58k| const W carry = x[N - 1] >> (WordInfo::bits - S); 884| | 885| 14.2k| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (885:26): [True: 12.6k, False: 1.58k] ------------------ 886| 12.6k| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 887| 12.6k| } 888| 1.58k| x[0] <<= S; 889| | 890| 1.58k| return carry; 891| 1.58k|} _ZN5Botan14use_mulx_montyEm: 33| 66.1k|inline bool use_mulx_monty(size_t p_size) { 34| 66.1k| return p_size >= MulxMontyMinWords && CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX); ------------------ | Branch (34:11): [True: 3.14k, False: 62.9k] | Branch (34:42): [True: 3.14k, False: 0] ------------------ 35| 66.1k|} _ZN5Botan6PCurve15PrimeOrderCurve6ScalarD2Ev: 73| 23.6k| ~Scalar() { _zeroize(); } _ZN5Botan6PCurve15PrimeOrderCurve11AffinePointD2Ev: 101| 4.82k| ~AffinePoint() = default; _ZN5Botan6PCurve15PrimeOrderCurve6ScalarC2EOS2_: 68| 14.2k| Scalar(Scalar&& other) = default; _ZN5Botan6PCurve15PrimeOrderCurve6ScalarC2ERKS2_: 67| 3.66k| Scalar(const Scalar& other) = default; _ZN5Botan6PCurve15PrimeOrderCurve11AffinePointC2EOS2_: 98| 3.18k| AffinePoint(AffinePoint&& other) = default; _ZNK5Botan6PCurve15PrimeOrderCurve6Scalar6_curveEv: 77| 9.68k| const auto& _curve() const { return m_curve; } _ZNK5Botan6PCurve15PrimeOrderCurve6Scalar6_valueEv: 79| 9.68k| const auto& _value() const { return m_value; } _ZN5Botan6PCurve15PrimeOrderCurve6Scalar7_createENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEE: 81| 5.76k| static Scalar _create(CurvePtr curve, StorageUnit v) { return Scalar(std::move(curve), v); } _ZN5Botan6PCurve15PrimeOrderCurve6ScalarC2ENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEE: 84| 5.76k| Scalar(CurvePtr curve, StorageUnit v) : m_curve(std::move(curve)), m_value(v) {} _ZNK5Botan6PCurve15PrimeOrderCurve11AffinePoint6_curveEv: 105| 3.62k| const auto& _curve() const { return m_curve; } _ZNK5Botan6PCurve15PrimeOrderCurve11AffinePoint2_xEv: 107| 3.62k| const auto& _x() const { return m_x; } _ZNK5Botan6PCurve15PrimeOrderCurve11AffinePoint2_yEv: 109| 3.62k| const auto& _y() const { return m_y; } _ZN5Botan6PCurve15PrimeOrderCurve11AffinePoint7_createENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEES8_: 111| 1.63k| static AffinePoint _create(CurvePtr curve, StorageUnit x, StorageUnit y) { 112| 1.63k| return AffinePoint(std::move(curve), x, y); 113| 1.63k| } _ZN5Botan6PCurve15PrimeOrderCurve11AffinePointC2ENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEES8_: 116| 1.63k| AffinePoint(CurvePtr curve, StorageUnit x, StorageUnit y) : m_curve(std::move(curve)), m_x(x), m_y(y) {} _ZN5Botan6PCurve15PrimeOrderCurveD2Ev: 164| 311| virtual ~PrimeOrderCurve() = default; _ZN5Botan6PCurve15PrimeOrderCurve20PrecomputedMul2TableD2Ev: 161| 928| virtual ~PrecomputedMul2Table() = default; _ZN5Botan10dbl_a_zeroINS_6PCurve22GenericProjectivePointEEET_RKS3_: 403| 629|inline constexpr ProjectivePoint dbl_a_zero(const ProjectivePoint& pt) { 404| | // If a == 0 then 3*x^2 + a*z^4 == 3*x^2 405| | // Cost: 1S + 1*3 406| 629| const auto m = pt.x().square().mul3(); 407| | 408| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 409| 629| const auto y2 = pt.y().square(); 410| 629| const auto s = pt.x().mul4() * y2; 411| 629| const auto nx = m.square() - s.mul2(); 412| 629| const auto ny = m * (s - nx) - y2.square().mul8(); 413| 629| const auto nz = pt.y().mul2() * pt.z(); 414| | 415| 629| return ProjectivePoint(nx, ny, nz); 416| 629|} _ZN5Botan13dbl_a_minus_3INS_6PCurve22GenericProjectivePointEEET_RKS3_: 384| 259k|inline constexpr ProjectivePoint dbl_a_minus_3(const ProjectivePoint& pt) { 385| | /* 386| | if a == -3 then 387| | 3*x^2 + a*z^4 == 3*x^2 - 3*z^4 == 3*(x^2-z^4) == 3*(x-z^2)*(x+z^2) 388| | */ 389| 259k| const auto z2 = pt.z().square(); 390| 259k| const auto m = (pt.x() - z2).mul3() * (pt.x() + z2); 391| | 392| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 393| 259k| const auto y2 = pt.y().square(); 394| 259k| const auto s = pt.x().mul4() * y2; 395| 259k| const auto nx = m.square() - s.mul2(); 396| 259k| const auto ny = m * (s - nx) - y2.square().mul8(); 397| 259k| const auto nz = pt.y().mul2() * pt.z(); 398| | 399| 259k| return ProjectivePoint(nx, ny, nz); 400| 259k|} pcurves_generic.cpp:_ZN5Botan17point_add_mixed_hINS_6PCurve22GenericProjectivePointENS1_18GenericAffinePointENS1_12_GLOBAL__N_112GenericFieldEEENSt3__14pairIT_T1_EERKS8_RKT0_RKS9_SH_: 250| 27.0k| const FieldElement& curve_a) { 251| 27.0k| const auto a_is_identity = a.is_identity(); 252| 27.0k| const auto b_is_identity = b.is_identity(); 253| | 254| | /* 255| | https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addition-add-1998-cmo-2 256| | 257| | Cost: 8M + 3S + 6add + 1*2 258| | */ 259| | 260| 27.0k| const auto Z1Z1 = a.z().square(); 261| 27.0k| const auto U2 = b.x() * Z1Z1; 262| 27.0k| const auto S2 = b.y() * a.z() * Z1Z1; 263| 27.0k| const auto H = U2 - a.x(); 264| 27.0k| const auto r = S2 - a.y(); 265| | 266| | /* Risky conditional 267| | * 268| | * This implementation uses projective coordinates, which do not have an efficient complete 269| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 270| | * 271| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 272| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 273| | * in which case at the end we'll set z to a.z * H = 0, resulting in the correct output 274| | * (the identity element) 275| | */ 276| 27.0k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (276:7): [True: 0, False: 27.0k] ------------------ 277| 0| return {a.dbl_iso(curve_a), H}; 278| 0| } 279| | 280| 27.0k| const auto HH = H.square(); 281| 27.0k| const auto HHH = H * HH; 282| 27.0k| const auto V = a.x() * HH; 283| 27.0k| const auto t2 = r.square(); 284| 27.0k| const auto t3 = V + V; 285| 27.0k| const auto t4 = t2 - HHH; 286| 27.0k| auto X3 = t4 - t3; 287| 27.0k| const auto t5 = V - X3; 288| 27.0k| const auto t6 = a.y() * HHH; 289| 27.0k| const auto t7 = r * t5; 290| 27.0k| auto Y3 = t7 - t6; 291| 27.0k| auto Z3 = a.z() * H; 292| | 293| | // if a is identity then return b 294| 27.0k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), one); 295| | 296| | // if b is identity then return a 297| 27.0k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 298| | 299| 27.0k| return {ProjectivePoint(X3, Y3, Z3), H}; 300| 27.0k|} pcurves_generic.cpp:_ZN5Botan15point_add_mixedINS_6PCurve22GenericProjectivePointENS1_18GenericAffinePointENS1_12_GLOBAL__N_112GenericFieldEEET_RKS6_RKT0_RKT1_SE_: 306| 27.0k| const FieldElement& curve_a) { 307| 27.0k| return point_add_mixed_h(a, b, one, curve_a).first; 308| 27.0k|} _ZN5Botan15dbl_n_a_minus_3INS_6PCurve22GenericProjectivePointEEET_RKS3_m: 454| 22.1k|inline constexpr ProjectivePoint dbl_n_a_minus_3(const ProjectivePoint& pt, size_t n) { 455| 22.1k| auto nx = pt.x(); 456| 22.1k| auto ny = pt.y().mul2(); 457| 22.1k| auto nz = pt.z(); 458| 22.1k| auto w = nz.square().square(); 459| | 460| | // Conditional ok: loop iteration count is public 461| 88.7k| while(n > 0) { ------------------ | Branch (461:10): [True: 66.5k, False: 22.1k] ------------------ 462| 66.5k| const auto ny2 = ny.square(); 463| 66.5k| const auto ny4 = ny2.square(); 464| 66.5k| const auto t1 = (nx.square() - w).mul3(); 465| 66.5k| const auto t2 = nx * ny2; 466| 66.5k| nx = t1.square() - t2.mul2(); 467| 66.5k| nz *= ny; 468| 66.5k| ny = t1 * (t2 - nx).mul2() - ny4; 469| 66.5k| n--; 470| | // Conditional ok: loop iteration count is public 471| 66.5k| if(n > 0) { ------------------ | Branch (471:10): [True: 44.3k, False: 22.1k] ------------------ 472| 44.3k| w *= ny4; 473| 44.3k| } 474| 66.5k| } 475| 22.1k| return ProjectivePoint(nx, ny.div2(), nz); 476| 22.1k|} pcurves_generic.cpp:_ZN5Botan9point_addINS_6PCurve22GenericProjectivePointENS1_12_GLOBAL__N_112GenericFieldEEET_RKS5_S7_: 188| 233k|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 189| 233k| const auto a_is_identity = a.is_identity(); 190| 233k| const auto b_is_identity = b.is_identity(); 191| | 192| 233k| const auto Z1Z1 = a.z().square(); 193| 233k| const auto Z2Z2 = b.z().square(); 194| 233k| const auto U1 = a.x() * Z2Z2; 195| 233k| const auto U2 = b.x() * Z1Z1; 196| 233k| const auto S1 = a.y() * b.z() * Z2Z2; 197| 233k| const auto S2 = b.y() * a.z() * Z1Z1; 198| 233k| const auto H = U2 - U1; 199| 233k| const auto r = S2 - S1; 200| | 201| | /* Risky conditional 202| | * 203| | * This implementation uses projective coordinates, which do not have an efficient complete 204| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 205| | * 206| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 207| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 208| | * in which case at the end we'll set z to a.z * b.z * H = 0, resulting in the correct 209| | * output (the identity element) 210| | */ 211| 233k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (211:7): [True: 0, False: 233k] ------------------ 212| 0| return a.dbl(); 213| 0| } 214| | 215| 233k| const auto HH = H.square(); 216| 233k| const auto HHH = H * HH; 217| 233k| const auto V = U1 * HH; 218| 233k| const auto t2 = r.square(); 219| 233k| const auto t3 = V + V; 220| 233k| const auto t4 = t2 - HHH; 221| 233k| auto X3 = t4 - t3; 222| 233k| const auto t5 = V - X3; 223| 233k| const auto t6 = S1 * HHH; 224| 233k| const auto t7 = r * t5; 225| 233k| auto Y3 = t7 - t6; 226| 233k| const auto t8 = b.z() * H; 227| 233k| auto Z3 = a.z() * t8; 228| | 229| | // if a is identity then return b 230| 233k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), b.z()); 231| | 232| | // if b is identity then return a 233| 233k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 234| | 235| 233k| return ProjectivePoint(X3, Y3, Z3); 236| 233k|} pcurves_generic.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_112GenericCurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEE: 108| 573|auto to_affine_batch(std::span projective) { 109| 573| using AffinePoint = typename C::AffinePoint; 110| | 111| 573| const size_t N = projective.size(); 112| 573| std::vector affine; 113| 573| affine.reserve(N); 114| | 115| 573| CT::Choice any_identity = CT::Choice::no(); 116| | 117| 499k| for(const auto& pt : projective) { ------------------ | Branch (117:23): [True: 499k, False: 573] ------------------ 118| 499k| any_identity = any_identity || pt.is_identity(); 119| 499k| } 120| | 121| | // Conditional acceptable: N is public. State of points is not necessarily 122| | // public, but we don't leak which point was the identity. In practice with 123| | // the algorithms currently in use, the only time an identity can occur is 124| | // during mul2 where the two points g/h have a small relation (ie h = g*k for 125| | // some k < 16) 126| | 127| 573| if(N <= 2 || any_identity.as_bool()) { ------------------ | Branch (127:7): [True: 0, False: 573] | Branch (127:17): [True: 0, False: 573] ------------------ 128| | // If there are identity elements, using the batch inversion gets 129| | // tricky. It can be done, but this should be a rare situation so 130| | // just punt to the serial conversion if it occurs 131| 0| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (131:25): [True: 0, False: 0] ------------------ 132| 0| affine.push_back(to_affine(projective[i])); 133| 0| } 134| 573| } else { 135| 573| std::vector c; 136| 573| c.reserve(N); 137| | 138| | /* 139| | Batch projective->affine using Montgomery's trick 140| | 141| | See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography" 142| | (Hankerson, Menezes, Vanstone) 143| | */ 144| | 145| 573| c.push_back(projective[0].z()); 146| 499k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (146:25): [True: 498k, False: 573] ------------------ 147| 498k| c.push_back(c[i - 1] * projective[i].z()); 148| 498k| } 149| | 150| 573| auto s_inv = [&]() { 151| 573| if constexpr(VariableTime) { 152| 573| return c[N - 1].invert_vartime(); 153| 573| } else { 154| 573| return invert_field_element(c[N - 1]); 155| 573| } 156| 573| }(); 157| | 158| 499k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (158:29): [True: 498k, False: 573] ------------------ 159| 498k| const auto& p = projective[i]; 160| | 161| 498k| const auto z_inv = s_inv * c[i - 1]; 162| 498k| const auto z2_inv = z_inv.square(); 163| 498k| const auto z3_inv = z_inv * z2_inv; 164| | 165| 498k| s_inv = s_inv * p.z(); 166| | 167| 498k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 168| 498k| } 169| | 170| 573| const auto z2_inv = s_inv.square(); 171| 573| const auto z3_inv = s_inv * z2_inv; 172| 573| affine.push_back(AffinePoint(projective[0].x() * z2_inv, projective[0].y() * z3_inv)); 173| 573| std::reverse(affine.begin(), affine.end()); 174| 573| return affine; 175| 573| } 176| | 177| 0| return affine; 178| 573|} pcurves_generic.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_112GenericCurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEEENKUlvE_clEv: 150| 573| auto s_inv = [&]() { 151| 573| if constexpr(VariableTime) { 152| 573| return c[N - 1].invert_vartime(); 153| | } else { 154| | return invert_field_element(c[N - 1]); 155| | } 156| 573| }(); pcurves_secp224r1.cpp:_ZN5Botan13dbl_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EEEET_RKSE_: 384| 731|inline constexpr ProjectivePoint dbl_a_minus_3(const ProjectivePoint& pt) { 385| | /* 386| | if a == -3 then 387| | 3*x^2 + a*z^4 == 3*x^2 - 3*z^4 == 3*(x^2-z^4) == 3*(x-z^2)*(x+z^2) 388| | */ 389| 731| const auto z2 = pt.z().square(); 390| 731| const auto m = (pt.x() - z2).mul3() * (pt.x() + z2); 391| | 392| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 393| 731| const auto y2 = pt.y().square(); 394| 731| const auto s = pt.x().mul4() * y2; 395| 731| const auto nx = m.square() - s.mul2(); 396| 731| const auto ny = m * (s - nx) - y2.square().mul8(); 397| 731| const auto nz = pt.y().mul2() * pt.z(); 398| | 399| 731| return ProjectivePoint(nx, ny, nz); 400| 731|} pcurves_secp224r1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_: 188| 645|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 189| 645| const auto a_is_identity = a.is_identity(); 190| 645| const auto b_is_identity = b.is_identity(); 191| | 192| 645| const auto Z1Z1 = a.z().square(); 193| 645| const auto Z2Z2 = b.z().square(); 194| 645| const auto U1 = a.x() * Z2Z2; 195| 645| const auto U2 = b.x() * Z1Z1; 196| 645| const auto S1 = a.y() * b.z() * Z2Z2; 197| 645| const auto S2 = b.y() * a.z() * Z1Z1; 198| 645| const auto H = U2 - U1; 199| 645| const auto r = S2 - S1; 200| | 201| | /* Risky conditional 202| | * 203| | * This implementation uses projective coordinates, which do not have an efficient complete 204| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 205| | * 206| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 207| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 208| | * in which case at the end we'll set z to a.z * b.z * H = 0, resulting in the correct 209| | * output (the identity element) 210| | */ 211| 645| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (211:7): [True: 0, False: 645] ------------------ 212| 0| return a.dbl(); 213| 0| } 214| | 215| 645| const auto HH = H.square(); 216| 645| const auto HHH = H * HH; 217| 645| const auto V = U1 * HH; 218| 645| const auto t2 = r.square(); 219| 645| const auto t3 = V + V; 220| 645| const auto t4 = t2 - HHH; 221| 645| auto X3 = t4 - t3; 222| 645| const auto t5 = V - X3; 223| 645| const auto t6 = S1 * HHH; 224| 645| const auto t7 = r * t5; 225| 645| auto Y3 = t7 - t6; 226| 645| const auto t8 = b.z() * H; 227| 645| auto Z3 = a.z() * t8; 228| | 229| | // if a is identity then return b 230| 645| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), b.z()); 231| | 232| | // if b is identity then return a 233| 645| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 234| | 235| 645| return ProjectivePoint(X3, Y3, Z3); 236| 645|} pcurves_secp224r1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp224r15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEE: 108| 1|auto to_affine_batch(std::span projective) { 109| 1| using AffinePoint = typename C::AffinePoint; 110| | 111| 1| const size_t N = projective.size(); 112| 1| std::vector affine; 113| 1| affine.reserve(N); 114| | 115| 1| CT::Choice any_identity = CT::Choice::no(); 116| | 117| 1.37k| for(const auto& pt : projective) { ------------------ | Branch (117:23): [True: 1.37k, False: 1] ------------------ 118| 1.37k| any_identity = any_identity || pt.is_identity(); 119| 1.37k| } 120| | 121| | // Conditional acceptable: N is public. State of points is not necessarily 122| | // public, but we don't leak which point was the identity. In practice with 123| | // the algorithms currently in use, the only time an identity can occur is 124| | // during mul2 where the two points g/h have a small relation (ie h = g*k for 125| | // some k < 16) 126| | 127| 1| if(N <= 2 || any_identity.as_bool()) { ------------------ | Branch (127:7): [True: 0, False: 1] | Branch (127:17): [True: 0, False: 1] ------------------ 128| | // If there are identity elements, using the batch inversion gets 129| | // tricky. It can be done, but this should be a rare situation so 130| | // just punt to the serial conversion if it occurs 131| 0| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (131:25): [True: 0, False: 0] ------------------ 132| 0| affine.push_back(to_affine(projective[i])); 133| 0| } 134| 1| } else { 135| 1| std::vector c; 136| 1| c.reserve(N); 137| | 138| | /* 139| | Batch projective->affine using Montgomery's trick 140| | 141| | See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography" 142| | (Hankerson, Menezes, Vanstone) 143| | */ 144| | 145| 1| c.push_back(projective[0].z()); 146| 1.37k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (146:25): [True: 1.37k, False: 1] ------------------ 147| 1.37k| c.push_back(c[i - 1] * projective[i].z()); 148| 1.37k| } 149| | 150| 1| auto s_inv = [&]() { 151| 1| if constexpr(VariableTime) { 152| 1| return c[N - 1].invert_vartime(); 153| 1| } else { 154| 1| return invert_field_element(c[N - 1]); 155| 1| } 156| 1| }(); 157| | 158| 1.37k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (158:29): [True: 1.37k, False: 1] ------------------ 159| 1.37k| const auto& p = projective[i]; 160| | 161| 1.37k| const auto z_inv = s_inv * c[i - 1]; 162| 1.37k| const auto z2_inv = z_inv.square(); 163| 1.37k| const auto z3_inv = z_inv * z2_inv; 164| | 165| 1.37k| s_inv = s_inv * p.z(); 166| | 167| 1.37k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 168| 1.37k| } 169| | 170| 1| const auto z2_inv = s_inv.square(); 171| 1| const auto z3_inv = s_inv * z2_inv; 172| 1| affine.push_back(AffinePoint(projective[0].x() * z2_inv, projective[0].y() * z3_inv)); 173| 1| std::reverse(affine.begin(), affine.end()); 174| 1| return affine; 175| 1| } 176| | 177| 0| return affine; 178| 1|} pcurves_secp224r1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp224r15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEEENKUlvE_clEv: 150| 1| auto s_inv = [&]() { 151| 1| if constexpr(VariableTime) { 152| 1| return c[N - 1].invert_vartime(); 153| | } else { 154| | return invert_field_element(c[N - 1]); 155| | } 156| 1| }(); pcurves_secp224r1.cpp:_ZN5Botan18sqrt_field_elementINS_6PCurve12_GLOBAL__N_19secp224r15CurveEEENS_2CT6OptionINT_12FieldElementEEERKS8_: 61| 209|inline constexpr CT::Option sqrt_field_element(const typename C::FieldElement& fe) { 62| | if constexpr(curve_supports_fe_sqrt) { 63| | auto z = C::fe_sqrt(fe); 64| | // Zero out the return value if it would otherwise be incorrect 65| | const CT::Choice correct = (z.square() == fe); 66| | z.conditional_assign(!correct, C::FieldElement::zero()); 67| | return CT::Option(z, correct); 68| 209| } else { 69| 209| return fe.sqrt(); 70| 209| } 71| 209|} pcurves_secp256k1.cpp:_ZN5Botan10dbl_a_zeroINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EEEET_RKSE_: 403| 833|inline constexpr ProjectivePoint dbl_a_zero(const ProjectivePoint& pt) { 404| | // If a == 0 then 3*x^2 + a*z^4 == 3*x^2 405| | // Cost: 1S + 1*3 406| 833| const auto m = pt.x().square().mul3(); 407| | 408| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 409| 833| const auto y2 = pt.y().square(); 410| 833| const auto s = pt.x().mul4() * y2; 411| 833| const auto nx = m.square() - s.mul2(); 412| 833| const auto ny = m * (s - nx) - y2.square().mul8(); 413| 833| const auto nz = pt.y().mul2() * pt.z(); 414| | 415| 833| return ProjectivePoint(nx, ny, nz); 416| 833|} pcurves_secp256k1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_: 188| 735|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 189| 735| const auto a_is_identity = a.is_identity(); 190| 735| const auto b_is_identity = b.is_identity(); 191| | 192| 735| const auto Z1Z1 = a.z().square(); 193| 735| const auto Z2Z2 = b.z().square(); 194| 735| const auto U1 = a.x() * Z2Z2; 195| 735| const auto U2 = b.x() * Z1Z1; 196| 735| const auto S1 = a.y() * b.z() * Z2Z2; 197| 735| const auto S2 = b.y() * a.z() * Z1Z1; 198| 735| const auto H = U2 - U1; 199| 735| const auto r = S2 - S1; 200| | 201| | /* Risky conditional 202| | * 203| | * This implementation uses projective coordinates, which do not have an efficient complete 204| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 205| | * 206| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 207| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 208| | * in which case at the end we'll set z to a.z * b.z * H = 0, resulting in the correct 209| | * output (the identity element) 210| | */ 211| 735| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (211:7): [True: 0, False: 735] ------------------ 212| 0| return a.dbl(); 213| 0| } 214| | 215| 735| const auto HH = H.square(); 216| 735| const auto HHH = H * HH; 217| 735| const auto V = U1 * HH; 218| 735| const auto t2 = r.square(); 219| 735| const auto t3 = V + V; 220| 735| const auto t4 = t2 - HHH; 221| 735| auto X3 = t4 - t3; 222| 735| const auto t5 = V - X3; 223| 735| const auto t6 = S1 * HHH; 224| 735| const auto t7 = r * t5; 225| 735| auto Y3 = t7 - t6; 226| 735| const auto t8 = b.z() * H; 227| 735| auto Z3 = a.z() * t8; 228| | 229| | // if a is identity then return b 230| 735| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), b.z()); 231| | 232| | // if b is identity then return a 233| 735| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 234| | 235| 735| return ProjectivePoint(X3, Y3, Z3); 236| 735|} pcurves_secp256k1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp256k15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEE: 108| 1|auto to_affine_batch(std::span projective) { 109| 1| using AffinePoint = typename C::AffinePoint; 110| | 111| 1| const size_t N = projective.size(); 112| 1| std::vector affine; 113| 1| affine.reserve(N); 114| | 115| 1| CT::Choice any_identity = CT::Choice::no(); 116| | 117| 1.56k| for(const auto& pt : projective) { ------------------ | Branch (117:23): [True: 1.56k, False: 1] ------------------ 118| 1.56k| any_identity = any_identity || pt.is_identity(); 119| 1.56k| } 120| | 121| | // Conditional acceptable: N is public. State of points is not necessarily 122| | // public, but we don't leak which point was the identity. In practice with 123| | // the algorithms currently in use, the only time an identity can occur is 124| | // during mul2 where the two points g/h have a small relation (ie h = g*k for 125| | // some k < 16) 126| | 127| 1| if(N <= 2 || any_identity.as_bool()) { ------------------ | Branch (127:7): [True: 0, False: 1] | Branch (127:17): [True: 0, False: 1] ------------------ 128| | // If there are identity elements, using the batch inversion gets 129| | // tricky. It can be done, but this should be a rare situation so 130| | // just punt to the serial conversion if it occurs 131| 0| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (131:25): [True: 0, False: 0] ------------------ 132| 0| affine.push_back(to_affine(projective[i])); 133| 0| } 134| 1| } else { 135| 1| std::vector c; 136| 1| c.reserve(N); 137| | 138| | /* 139| | Batch projective->affine using Montgomery's trick 140| | 141| | See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography" 142| | (Hankerson, Menezes, Vanstone) 143| | */ 144| | 145| 1| c.push_back(projective[0].z()); 146| 1.56k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (146:25): [True: 1.56k, False: 1] ------------------ 147| 1.56k| c.push_back(c[i - 1] * projective[i].z()); 148| 1.56k| } 149| | 150| 1| auto s_inv = [&]() { 151| 1| if constexpr(VariableTime) { 152| 1| return c[N - 1].invert_vartime(); 153| 1| } else { 154| 1| return invert_field_element(c[N - 1]); 155| 1| } 156| 1| }(); 157| | 158| 1.56k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (158:29): [True: 1.56k, False: 1] ------------------ 159| 1.56k| const auto& p = projective[i]; 160| | 161| 1.56k| const auto z_inv = s_inv * c[i - 1]; 162| 1.56k| const auto z2_inv = z_inv.square(); 163| 1.56k| const auto z3_inv = z_inv * z2_inv; 164| | 165| 1.56k| s_inv = s_inv * p.z(); 166| | 167| 1.56k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 168| 1.56k| } 169| | 170| 1| const auto z2_inv = s_inv.square(); 171| 1| const auto z3_inv = s_inv * z2_inv; 172| 1| affine.push_back(AffinePoint(projective[0].x() * z2_inv, projective[0].y() * z3_inv)); 173| 1| std::reverse(affine.begin(), affine.end()); 174| 1| return affine; 175| 1| } 176| | 177| 0| return affine; 178| 1|} pcurves_secp256k1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp256k15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEEENKUlvE_clEv: 150| 1| auto s_inv = [&]() { 151| 1| if constexpr(VariableTime) { 152| 1| return c[N - 1].invert_vartime(); 153| | } else { 154| | return invert_field_element(c[N - 1]); 155| | } 156| 1| }(); pcurves_secp384r1.cpp:_ZN5Botan13dbl_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEES8_EEEET_RKSE_: 384| 1.61k|inline constexpr ProjectivePoint dbl_a_minus_3(const ProjectivePoint& pt) { 385| | /* 386| | if a == -3 then 387| | 3*x^2 + a*z^4 == 3*x^2 - 3*z^4 == 3*(x^2-z^4) == 3*(x-z^2)*(x+z^2) 388| | */ 389| 1.61k| const auto z2 = pt.z().square(); 390| 1.61k| const auto m = (pt.x() - z2).mul3() * (pt.x() + z2); 391| | 392| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 393| 1.61k| const auto y2 = pt.y().square(); 394| 1.61k| const auto s = pt.x().mul4() * y2; 395| 1.61k| const auto nx = m.square() - s.mul2(); 396| 1.61k| const auto ny = m * (s - nx) - y2.square().mul8(); 397| 1.61k| const auto nz = pt.y().mul2() * pt.z(); 398| | 399| 1.61k| return ProjectivePoint(nx, ny, nz); 400| 1.61k|} pcurves_secp384r1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_: 188| 3.72k|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 189| 3.72k| const auto a_is_identity = a.is_identity(); 190| 3.72k| const auto b_is_identity = b.is_identity(); 191| | 192| 3.72k| const auto Z1Z1 = a.z().square(); 193| 3.72k| const auto Z2Z2 = b.z().square(); 194| 3.72k| const auto U1 = a.x() * Z2Z2; 195| 3.72k| const auto U2 = b.x() * Z1Z1; 196| 3.72k| const auto S1 = a.y() * b.z() * Z2Z2; 197| 3.72k| const auto S2 = b.y() * a.z() * Z1Z1; 198| 3.72k| const auto H = U2 - U1; 199| 3.72k| const auto r = S2 - S1; 200| | 201| | /* Risky conditional 202| | * 203| | * This implementation uses projective coordinates, which do not have an efficient complete 204| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 205| | * 206| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 207| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 208| | * in which case at the end we'll set z to a.z * b.z * H = 0, resulting in the correct 209| | * output (the identity element) 210| | */ 211| 3.72k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (211:7): [True: 0, False: 3.72k] ------------------ 212| 0| return a.dbl(); 213| 0| } 214| | 215| 3.72k| const auto HH = H.square(); 216| 3.72k| const auto HHH = H * HH; 217| 3.72k| const auto V = U1 * HH; 218| 3.72k| const auto t2 = r.square(); 219| 3.72k| const auto t3 = V + V; 220| 3.72k| const auto t4 = t2 - HHH; 221| 3.72k| auto X3 = t4 - t3; 222| 3.72k| const auto t5 = V - X3; 223| 3.72k| const auto t6 = S1 * HHH; 224| 3.72k| const auto t7 = r * t5; 225| 3.72k| auto Y3 = t7 - t6; 226| 3.72k| const auto t8 = b.z() * H; 227| 3.72k| auto Z3 = a.z() * t8; 228| | 229| | // if a is identity then return b 230| 3.72k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), b.z()); 231| | 232| | // if b is identity then return a 233| 3.72k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 234| | 235| 3.72k| return ProjectivePoint(X3, Y3, Z3); 236| 3.72k|} pcurves_secp384r1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp384r15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEE: 108| 377|auto to_affine_batch(std::span projective) { 109| 377| using AffinePoint = typename C::AffinePoint; 110| | 111| 377| const size_t N = projective.size(); 112| 377| std::vector affine; 113| 377| affine.reserve(N); 114| | 115| 377| CT::Choice any_identity = CT::Choice::no(); 116| | 117| 5.34k| for(const auto& pt : projective) { ------------------ | Branch (117:23): [True: 5.34k, False: 377] ------------------ 118| 5.34k| any_identity = any_identity || pt.is_identity(); 119| 5.34k| } 120| | 121| | // Conditional acceptable: N is public. State of points is not necessarily 122| | // public, but we don't leak which point was the identity. In practice with 123| | // the algorithms currently in use, the only time an identity can occur is 124| | // during mul2 where the two points g/h have a small relation (ie h = g*k for 125| | // some k < 16) 126| | 127| 377| if(N <= 2 || any_identity.as_bool()) { ------------------ | Branch (127:7): [True: 0, False: 377] | Branch (127:17): [True: 0, False: 377] ------------------ 128| | // If there are identity elements, using the batch inversion gets 129| | // tricky. It can be done, but this should be a rare situation so 130| | // just punt to the serial conversion if it occurs 131| 0| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (131:25): [True: 0, False: 0] ------------------ 132| 0| affine.push_back(to_affine(projective[i])); 133| 0| } 134| 377| } else { 135| 377| std::vector c; 136| 377| c.reserve(N); 137| | 138| | /* 139| | Batch projective->affine using Montgomery's trick 140| | 141| | See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography" 142| | (Hankerson, Menezes, Vanstone) 143| | */ 144| | 145| 377| c.push_back(projective[0].z()); 146| 5.34k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (146:25): [True: 4.96k, False: 377] ------------------ 147| 4.96k| c.push_back(c[i - 1] * projective[i].z()); 148| 4.96k| } 149| | 150| 377| auto s_inv = [&]() { 151| 377| if constexpr(VariableTime) { 152| 377| return c[N - 1].invert_vartime(); 153| 377| } else { 154| 377| return invert_field_element(c[N - 1]); 155| 377| } 156| 377| }(); 157| | 158| 5.34k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (158:29): [True: 4.96k, False: 377] ------------------ 159| 4.96k| const auto& p = projective[i]; 160| | 161| 4.96k| const auto z_inv = s_inv * c[i - 1]; 162| 4.96k| const auto z2_inv = z_inv.square(); 163| 4.96k| const auto z3_inv = z_inv * z2_inv; 164| | 165| 4.96k| s_inv = s_inv * p.z(); 166| | 167| 4.96k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 168| 4.96k| } 169| | 170| 377| const auto z2_inv = s_inv.square(); 171| 377| const auto z3_inv = s_inv * z2_inv; 172| 377| affine.push_back(AffinePoint(projective[0].x() * z2_inv, projective[0].y() * z3_inv)); 173| 377| std::reverse(affine.begin(), affine.end()); 174| 377| return affine; 175| 377| } 176| | 177| 0| return affine; 178| 377|} pcurves_secp384r1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp384r15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEEENKUlvE_clEv: 150| 377| auto s_inv = [&]() { 151| 377| if constexpr(VariableTime) { 152| 377| return c[N - 1].invert_vartime(); 153| | } else { 154| | return invert_field_element(c[N - 1]); 155| | } 156| 377| }(); pcurves_secp384r1.cpp:_ZN5Botan22point_add_or_sub_mixedINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EET_RKSG_RKT0_NS_2CT6ChoiceERKT1_SQ_: 318| 47.4k| const FieldElement& curve_a) { 319| 47.4k| const auto a_is_identity = a.is_identity(); 320| 47.4k| const auto b_is_identity = b.is_identity(); 321| | 322| | /* 323| | https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addition-add-1998-cmo-2 324| | 325| | Cost: 8M + 3S + 6add + 1*2 326| | */ 327| | 328| 47.4k| auto by = b.y(); 329| 47.4k| by.conditional_assign(sub, by.negate()); 330| | 331| 47.4k| const auto Z1Z1 = a.z().square(); 332| 47.4k| const auto U2 = b.x() * Z1Z1; 333| 47.4k| const auto S2 = by * a.z() * Z1Z1; 334| 47.4k| const auto H = U2 - a.x(); 335| 47.4k| const auto r = S2 - a.y(); 336| | 337| | /* Risky conditional 338| | * 339| | * This implementation uses projective coordinates, which do not have an efficient complete 340| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 341| | * 342| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 343| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 344| | * in which case at the end we'll set z to a.z * H = 0, resulting in the correct output 345| | * (the identity element) 346| | */ 347| 47.4k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (347:7): [True: 0, False: 47.4k] ------------------ 348| 0| return a.dbl_iso(curve_a); 349| 0| } 350| | 351| 47.4k| const auto HH = H.square(); 352| 47.4k| const auto HHH = H * HH; 353| 47.4k| const auto V = a.x() * HH; 354| 47.4k| const auto t2 = r.square(); 355| 47.4k| const auto t3 = V + V; 356| 47.4k| const auto t4 = t2 - HHH; 357| 47.4k| auto X3 = t4 - t3; 358| 47.4k| const auto t5 = V - X3; 359| 47.4k| const auto t6 = a.y() * HHH; 360| 47.4k| const auto t7 = r * t5; 361| 47.4k| auto Y3 = t7 - t6; 362| 47.4k| auto Z3 = a.z() * H; 363| | 364| | // if a is identity then return b 365| 47.4k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), by, one); 366| | 367| | // if b is identity then return a 368| 47.4k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 369| | 370| 47.4k| return ProjectivePoint(X3, Y3, Z3); 371| 47.4k|} pcurves_secp384r1.cpp:_ZN5Botan15dbl_n_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEES8_EEEET_RKSE_m: 454| 23.9k|inline constexpr ProjectivePoint dbl_n_a_minus_3(const ProjectivePoint& pt, size_t n) { 455| 23.9k| auto nx = pt.x(); 456| 23.9k| auto ny = pt.y().mul2(); 457| 23.9k| auto nz = pt.z(); 458| 23.9k| auto w = nz.square().square(); 459| | 460| | // Conditional ok: loop iteration count is public 461| 166k| while(n > 0) { ------------------ | Branch (461:10): [True: 142k, False: 23.9k] ------------------ 462| 142k| const auto ny2 = ny.square(); 463| 142k| const auto ny4 = ny2.square(); 464| 142k| const auto t1 = (nx.square() - w).mul3(); 465| 142k| const auto t2 = nx * ny2; 466| 142k| nx = t1.square() - t2.mul2(); 467| 142k| nz *= ny; 468| 142k| ny = t1 * (t2 - nx).mul2() - ny4; 469| 142k| n--; 470| | // Conditional ok: loop iteration count is public 471| 142k| if(n > 0) { ------------------ | Branch (471:10): [True: 118k, False: 23.9k] ------------------ 472| 118k| w *= ny4; 473| 118k| } 474| 142k| } 475| 23.9k| return ProjectivePoint(nx, ny.div2(), nz); 476| 23.9k|} pcurves_secp521r1.cpp:_ZN5Botan13dbl_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EEEET_RKSE_: 384| 1.93k|inline constexpr ProjectivePoint dbl_a_minus_3(const ProjectivePoint& pt) { 385| | /* 386| | if a == -3 then 387| | 3*x^2 + a*z^4 == 3*x^2 - 3*z^4 == 3*(x^2-z^4) == 3*(x-z^2)*(x+z^2) 388| | */ 389| 1.93k| const auto z2 = pt.z().square(); 390| 1.93k| const auto m = (pt.x() - z2).mul3() * (pt.x() + z2); 391| | 392| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 393| 1.93k| const auto y2 = pt.y().square(); 394| 1.93k| const auto s = pt.x().mul4() * y2; 395| 1.93k| const auto nx = m.square() - s.mul2(); 396| 1.93k| const auto ny = m * (s - nx) - y2.square().mul8(); 397| 1.93k| const auto nz = pt.y().mul2() * pt.z(); 398| | 399| 1.93k| return ProjectivePoint(nx, ny, nz); 400| 1.93k|} pcurves_secp521r1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_: 188| 3.45k|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 189| 3.45k| const auto a_is_identity = a.is_identity(); 190| 3.45k| const auto b_is_identity = b.is_identity(); 191| | 192| 3.45k| const auto Z1Z1 = a.z().square(); 193| 3.45k| const auto Z2Z2 = b.z().square(); 194| 3.45k| const auto U1 = a.x() * Z2Z2; 195| 3.45k| const auto U2 = b.x() * Z1Z1; 196| 3.45k| const auto S1 = a.y() * b.z() * Z2Z2; 197| 3.45k| const auto S2 = b.y() * a.z() * Z1Z1; 198| 3.45k| const auto H = U2 - U1; 199| 3.45k| const auto r = S2 - S1; 200| | 201| | /* Risky conditional 202| | * 203| | * This implementation uses projective coordinates, which do not have an efficient complete 204| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 205| | * 206| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 207| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 208| | * in which case at the end we'll set z to a.z * b.z * H = 0, resulting in the correct 209| | * output (the identity element) 210| | */ 211| 3.45k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (211:7): [True: 0, False: 3.45k] ------------------ 212| 0| return a.dbl(); 213| 0| } 214| | 215| 3.45k| const auto HH = H.square(); 216| 3.45k| const auto HHH = H * HH; 217| 3.45k| const auto V = U1 * HH; 218| 3.45k| const auto t2 = r.square(); 219| 3.45k| const auto t3 = V + V; 220| 3.45k| const auto t4 = t2 - HHH; 221| 3.45k| auto X3 = t4 - t3; 222| 3.45k| const auto t5 = V - X3; 223| 3.45k| const auto t6 = S1 * HHH; 224| 3.45k| const auto t7 = r * t5; 225| 3.45k| auto Y3 = t7 - t6; 226| 3.45k| const auto t8 = b.z() * H; 227| 3.45k| auto Z3 = a.z() * t8; 228| | 229| | // if a is identity then return b 230| 3.45k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), b.z()); 231| | 232| | // if b is identity then return a 233| 3.45k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 234| | 235| 3.45k| return ProjectivePoint(X3, Y3, Z3); 236| 3.45k|} pcurves_secp521r1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp521r15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEE: 108| 287|auto to_affine_batch(std::span projective) { 109| 287| using AffinePoint = typename C::AffinePoint; 110| | 111| 287| const size_t N = projective.size(); 112| 287| std::vector affine; 113| 287| affine.reserve(N); 114| | 115| 287| CT::Choice any_identity = CT::Choice::no(); 116| | 117| 5.39k| for(const auto& pt : projective) { ------------------ | Branch (117:23): [True: 5.39k, False: 287] ------------------ 118| 5.39k| any_identity = any_identity || pt.is_identity(); 119| 5.39k| } 120| | 121| | // Conditional acceptable: N is public. State of points is not necessarily 122| | // public, but we don't leak which point was the identity. In practice with 123| | // the algorithms currently in use, the only time an identity can occur is 124| | // during mul2 where the two points g/h have a small relation (ie h = g*k for 125| | // some k < 16) 126| | 127| 287| if(N <= 2 || any_identity.as_bool()) { ------------------ | Branch (127:7): [True: 0, False: 287] | Branch (127:17): [True: 0, False: 287] ------------------ 128| | // If there are identity elements, using the batch inversion gets 129| | // tricky. It can be done, but this should be a rare situation so 130| | // just punt to the serial conversion if it occurs 131| 0| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (131:25): [True: 0, False: 0] ------------------ 132| 0| affine.push_back(to_affine(projective[i])); 133| 0| } 134| 287| } else { 135| 287| std::vector c; 136| 287| c.reserve(N); 137| | 138| | /* 139| | Batch projective->affine using Montgomery's trick 140| | 141| | See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography" 142| | (Hankerson, Menezes, Vanstone) 143| | */ 144| | 145| 287| c.push_back(projective[0].z()); 146| 5.39k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (146:25): [True: 5.10k, False: 287] ------------------ 147| 5.10k| c.push_back(c[i - 1] * projective[i].z()); 148| 5.10k| } 149| | 150| 287| auto s_inv = [&]() { 151| 287| if constexpr(VariableTime) { 152| 287| return c[N - 1].invert_vartime(); 153| 287| } else { 154| 287| return invert_field_element(c[N - 1]); 155| 287| } 156| 287| }(); 157| | 158| 5.39k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (158:29): [True: 5.10k, False: 287] ------------------ 159| 5.10k| const auto& p = projective[i]; 160| | 161| 5.10k| const auto z_inv = s_inv * c[i - 1]; 162| 5.10k| const auto z2_inv = z_inv.square(); 163| 5.10k| const auto z3_inv = z_inv * z2_inv; 164| | 165| 5.10k| s_inv = s_inv * p.z(); 166| | 167| 5.10k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 168| 5.10k| } 169| | 170| 287| const auto z2_inv = s_inv.square(); 171| 287| const auto z3_inv = s_inv * z2_inv; 172| 287| affine.push_back(AffinePoint(projective[0].x() * z2_inv, projective[0].y() * z3_inv)); 173| 287| std::reverse(affine.begin(), affine.end()); 174| 287| return affine; 175| 287| } 176| | 177| 0| return affine; 178| 287|} pcurves_secp521r1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp521r15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEEENKUlvE_clEv: 150| 287| auto s_inv = [&]() { 151| 287| if constexpr(VariableTime) { 152| 287| return c[N - 1].invert_vartime(); 153| | } else { 154| | return invert_field_element(c[N - 1]); 155| | } 156| 287| }(); pcurves_secp521r1.cpp:_ZN5Botan22point_add_or_sub_mixedINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EET_RKSG_RKT0_NS_2CT6ChoiceERKT1_SQ_: 318| 48.0k| const FieldElement& curve_a) { 319| 48.0k| const auto a_is_identity = a.is_identity(); 320| 48.0k| const auto b_is_identity = b.is_identity(); 321| | 322| | /* 323| | https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addition-add-1998-cmo-2 324| | 325| | Cost: 8M + 3S + 6add + 1*2 326| | */ 327| | 328| 48.0k| auto by = b.y(); 329| 48.0k| by.conditional_assign(sub, by.negate()); 330| | 331| 48.0k| const auto Z1Z1 = a.z().square(); 332| 48.0k| const auto U2 = b.x() * Z1Z1; 333| 48.0k| const auto S2 = by * a.z() * Z1Z1; 334| 48.0k| const auto H = U2 - a.x(); 335| 48.0k| const auto r = S2 - a.y(); 336| | 337| | /* Risky conditional 338| | * 339| | * This implementation uses projective coordinates, which do not have an efficient complete 340| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 341| | * 342| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 343| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 344| | * in which case at the end we'll set z to a.z * H = 0, resulting in the correct output 345| | * (the identity element) 346| | */ 347| 48.0k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (347:7): [True: 0, False: 48.0k] ------------------ 348| 0| return a.dbl_iso(curve_a); 349| 0| } 350| | 351| 48.0k| const auto HH = H.square(); 352| 48.0k| const auto HHH = H * HH; 353| 48.0k| const auto V = a.x() * HH; 354| 48.0k| const auto t2 = r.square(); 355| 48.0k| const auto t3 = V + V; 356| 48.0k| const auto t4 = t2 - HHH; 357| 48.0k| auto X3 = t4 - t3; 358| 48.0k| const auto t5 = V - X3; 359| 48.0k| const auto t6 = a.y() * HHH; 360| 48.0k| const auto t7 = r * t5; 361| 48.0k| auto Y3 = t7 - t6; 362| 48.0k| auto Z3 = a.z() * H; 363| | 364| | // if a is identity then return b 365| 48.0k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), by, one); 366| | 367| | // if b is identity then return a 368| 48.0k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 369| | 370| 48.0k| return ProjectivePoint(X3, Y3, Z3); 371| 48.0k|} pcurves_secp521r1.cpp:_ZN5Botan15dbl_n_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EEEET_RKSE_m: 454| 24.2k|inline constexpr ProjectivePoint dbl_n_a_minus_3(const ProjectivePoint& pt, size_t n) { 455| 24.2k| auto nx = pt.x(); 456| 24.2k| auto ny = pt.y().mul2(); 457| 24.2k| auto nz = pt.z(); 458| 24.2k| auto w = nz.square().square(); 459| | 460| | // Conditional ok: loop iteration count is public 461| 169k| while(n > 0) { ------------------ | Branch (461:10): [True: 145k, False: 24.2k] ------------------ 462| 145k| const auto ny2 = ny.square(); 463| 145k| const auto ny4 = ny2.square(); 464| 145k| const auto t1 = (nx.square() - w).mul3(); 465| 145k| const auto t2 = nx * ny2; 466| 145k| nx = t1.square() - t2.mul2(); 467| 145k| nz *= ny; 468| 145k| ny = t1 * (t2 - nx).mul2() - ny4; 469| 145k| n--; 470| | // Conditional ok: loop iteration count is public 471| 145k| if(n > 0) { ------------------ | Branch (471:10): [True: 120k, False: 24.2k] ------------------ 472| 120k| w *= ny4; 473| 120k| } 474| 145k| } 475| 24.2k| return ProjectivePoint(nx, ny.div2(), nz); 476| 24.2k|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve7_paramsEv: 119| 56.1M| const GenericCurveParams& _params() const { return *m_params; } pcurves_secp224r1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp224r15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS3_12Secp224r1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1630| 1| m_table(basemul_booth_setup(p, BlindedScalar::Bits + 1)) {} pcurves_secp224r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11from_affineERKNS_16AffineCurvePointISB_EE: 1027| 1| static constexpr Self from_affine(const AffinePoint& pt) { 1028| | /* 1029| | * If the point is the identity element (x=0, y=0) then instead of 1030| | * creating (x, y, 1) = (0, 0, 1) we want our projective identity 1031| | * encoding of (0, 1, 0) 1032| | * 1033| | * Which we can achieve by a conditional swap of y and z if the 1034| | * affine point is the identity. 1035| | */ 1036| | 1037| 1| const auto x = pt.x(); 1038| 1| auto y = pt.y(); 1039| 1| auto z = FieldElement::one(); 1040| | 1041| 1| FieldElement::conditional_swap(pt.is_identity(), y, z); 1042| | 1043| 1| return ProjectiveCurvePoint(x, y, z); 1044| 1| } pcurves_secp224r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1xEv: 982| 542| constexpr const FieldElement& x() const { return m_x; } pcurves_secp224r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1yEv: 987| 542| constexpr const FieldElement& y() const { return m_y; } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE3oneEv: 202| 20.0k| static constexpr Self one() { return Self(Rep::one()); } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEC2ENSt3__15arrayImLm4EEE: 908| 105k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 412| 1| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 413| 1| const W mask = cond.into_bitmask(); 414| | 415| 5| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (415:28): [True: 4, False: 1] ------------------ 416| 4| const auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 417| 4| const auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 418| 4| x.m_val[i] = nx; 419| 4| y.m_val[i] = ny; 420| 4| } 421| 1| } pcurves_secp224r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE11is_identityEv: 939| 271| constexpr CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE7is_zeroEv: 227| 4.49k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_secp224r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EC2ERKSB_SE_SE_: 1067| 1.37k| m_x(x), m_y(y), m_z(z) {} pcurves_secp224r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3dblEv: 1181| 731| constexpr Self dbl() const { 1182| 731| if constexpr(Self::A_is_minus_3) { 1183| 731| return dbl_a_minus_3(*this); 1184| | } else if constexpr(Self::A_is_zero) { 1185| | return dbl_a_zero(*this); 1186| | } else { 1187| | return dbl_generic(*this, A); 1188| | } 1189| 731| } pcurves_secp224r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1zEv: 1224| 12.0k| constexpr const FieldElement& z() const { return m_z; } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6squareEv: 428| 8.97k| constexpr BOTAN_FORCE_INLINE Self square() const { 429| 8.97k| std::array z; // NOLINT(*-member-init) 430| 8.97k| comba_sqr(z.data(), this->data()); 431| 8.97k| return Self(Rep::redc(z)); 432| 8.97k| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4dataEv: 898| 1.18M| constexpr const W* data() const { return m_val.data(); } pcurves_secp224r1.cpp:_ZN5BotanmlERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 348| 60.2k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 349| 60.2k| std::array z; // NOLINT(*-member-init) 350| 60.2k| comba_mul(z.data(), a.data(), b.data()); 351| 60.2k| return Self(Rep::redc(z)); 352| 60.2k| } pcurves_secp224r1.cpp:_ZN5BotanmiERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 283| 6.79k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 284| 6.79k| std::array r; // NOLINT(*-member-init) 285| 6.79k| W carry = 0; 286| 33.9k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (286:28): [True: 27.1k, False: 6.79k] ------------------ 287| 27.1k| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 288| 27.1k| } 289| | 290| 6.79k| const auto mask = CT::Mask::expand(carry).value(); 291| | 292| 6.79k| carry = 0; 293| | 294| 33.9k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (294:28): [True: 27.1k, False: 6.79k] ------------------ 295| 27.1k| r[i] = word_add(r[i], P[i] & mask, &carry); 296| 27.1k| } 297| | 298| 6.79k| return Self(r); 299| 6.79k| } pcurves_secp224r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1xEv: 1214| 6.14k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul3Ev: 337| 731| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_secp224r1.cpp:_ZN5BotanplERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 267| 2.67k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 268| 2.67k| std::array t; // NOLINT(*-member-init) 269| | 270| 2.67k| W carry = 0; 271| 13.3k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (271:28): [True: 10.7k, False: 2.67k] ------------------ 272| 10.7k| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 273| 10.7k| } 274| | 275| 2.67k| std::array r; // NOLINT(*-member-init) 276| 2.67k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 277| 2.67k| return Self(r); 278| 2.67k| } pcurves_secp224r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1yEv: 1219| 5.41k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul4Ev: 340| 731| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul2Ev: 327| 5.84k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 328| 5.84k| std::array t = value(); 329| 5.84k| const W carry = shift_left<1>(t); 330| | 331| 5.84k| std::array r; // NOLINT(*-member-init) 332| 5.84k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 333| 5.84k| return Self(r); 334| 5.84k| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE5valueEv: 896| 5.84k| constexpr const std::array& value() const { return m_val; } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul8Ev: 343| 731| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_secp224r1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EESE_: 1075| 645| friend constexpr Self operator+(const Self& a, const Self& b) { return Self::add(a, b); } pcurves_secp224r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3addERKSC_SE_: 1138| 645| constexpr static Self add(const Self& a, const Self& b) { return point_add(a, b); } pcurves_secp224r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11is_identityEv: 1093| 2.66k| constexpr CT::Choice is_identity() const { return z().is_zero(); } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18conditional_assignERSA_SB_SB_NS_2CT6ChoiceERKSA_SF_SF_: 397| 1.29k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 398| 1.29k| const W mask = cond.into_bitmask(); 399| | 400| 6.45k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (400:28): [True: 5.16k, False: 1.29k] ------------------ 401| 5.16k| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 402| 5.16k| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 403| 5.16k| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 404| 5.16k| } 405| 1.29k| } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEmLERKSA_: 357| 7.10k| constexpr BOTAN_FORCE_INLINE Self& operator*=(const Self& other) { 358| 7.10k| std::array z; // NOLINT(*-member-init) 359| 7.10k| comba_mul(z.data(), data(), other.data()); 360| 7.10k| m_val = Rep::redc(z); 361| 7.10k| return (*this); 362| 7.10k| } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE8square_nEm: 441| 51.2k| constexpr void square_n(size_t n) { 442| 51.2k| std::array z; // NOLINT(*-member-init) 443| 1.05M| for(size_t i = 0; i != n; ++i) { ------------------ | Branch (443:28): [True: 999k, False: 51.2k] ------------------ 444| 999k| comba_sqr(z.data(), this->data()); 445| 999k| m_val = Rep::redc(z); 446| 999k| } 447| 51.2k| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE14invert_vartimeEv: 600| 1| constexpr Self invert_vartime() const { 601| | // Conditional ok: this function is variable time 602| 1| if(this->is_zero().as_bool()) { ------------------ | Branch (602:13): [True: 0, False: 1] ------------------ 603| 0| return Self::zero(); 604| 0| } 605| | 606| 1| auto x = Self(std::array{1}); // 1 in standard domain 607| 1| auto b = Self(this->to_words()); // *this in standard domain 608| | 609| | // First loop iteration 610| 1| Self::_invert_vartime_div2_helper(b, x); 611| | 612| 1| auto a = b.negate(); 613| | // y += x but y is zero at the outset 614| 1| auto y = x; 615| | 616| | // First half of second loop iteration 617| 1| Self::_invert_vartime_div2_helper(a, y); 618| | 619| 153| for(;;) { 620| | // Conditional ok: this function is variable time 621| 153| if(a.m_val == b.m_val) { ------------------ | Branch (621:16): [True: 1, False: 152] ------------------ 622| | // At this point it should be that a == b == 1 623| 1| auto r = y.negate(); 624| | 625| | // Convert back to Montgomery if required 626| 1| r.m_val = Rep::to_rep(r.m_val); 627| 1| return r; 628| 1| } 629| | 630| 152| const auto nx = x + y; 631| | 632| | /* 633| | * Otherwise either b > a or a > b 634| | * 635| | * If b > a we want to set b to b - a 636| | * Otherwise we want to set a to a - b 637| | * 638| | * Compute r = b - a and check if it underflowed 639| | * If it did not then we are in the b > a path 640| | */ 641| 152| std::array r; // NOLINT(*-member-init) 642| 152| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 643| | 644| | // Conditional ok: this function is variable time 645| 152| if(carry == 0) { ------------------ | Branch (645:16): [True: 81, False: 71] ------------------ 646| | // b > a 647| 81| b.m_val = r; 648| 81| x = nx; 649| 81| Self::_invert_vartime_div2_helper(b, x); 650| 81| } else { 651| | // We know this can't underflow because a > b 652| 71| bigint_sub3(r.data(), a.data(), N, b.data(), N); 653| 71| a.m_val = r; 654| 71| y = nx; 655| 71| Self::_invert_vartime_div2_helper(a, y); 656| 71| } 657| 152| } 658| 1| } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4zeroEv: 197| 209| static constexpr Self zero() { return Self(std::array{0}); } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE8to_wordsEv: 736| 1| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE27_invert_vartime_div2_helperERSA_SB_: 549| 154| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 550| 154| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 551| | 552| | // Conditional ok: this function is variable time 553| 479| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (553:16): [True: 325, False: 154] ------------------ 554| 325| shift_right<1>(a.m_val); 555| | 556| 325| const W borrow = shift_right<1>(x.m_val); 557| | 558| | // Conditional ok: this function is variable time 559| 325| if(borrow) { ------------------ | Branch (559:16): [True: 200, False: 125] ------------------ 560| 200| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 561| 200| } 562| 325| } 563| 154| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6negateEv: 454| 137| constexpr Self negate() const { 455| 137| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 456| | 457| 137| std::array r; // NOLINT(*-member-init) 458| 137| W carry = 0; 459| 685| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (459:28): [True: 548, False: 137] ------------------ 460| 548| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 461| 548| } 462| | 463| 137| return Self(r); 464| 137| } pcurves_secp224r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEEC2ERKSB_SE_: 928| 1.78k| constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {} pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 270| std::array stash_value() const { 762| 270| static_assert(L >= N); 763| 270| std::array stash = {}; 764| 1.35k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 1.08k, False: 270] ------------------ 765| 1.08k| stash[i] = m_val[i]; 766| 1.08k| } 767| 270| return stash; 768| 270| } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEC2Ev: 182| 3.13k| constexpr IntMod() : m_val({}) {} pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18conditional_assignENS_2CT6ChoiceERKSA_: 369| 40.0k| constexpr void conditional_assign(CT::Choice cond, const Self& nx) { 370| 40.0k| const W mask = cond.into_bitmask(); 371| | 372| 200k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (372:28): [True: 160k, False: 40.0k] ------------------ 373| 160k| m_val[i] = Botan::choose(mask, nx.m_val[i], m_val[i]); 374| 160k| } 375| 40.0k| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE12serialize_toENSt3__14spanIhLm28EEE: 741| 270| constexpr void serialize_to(std::span bytes) const { 742| 270| auto v = Rep::from_rep(m_val); 743| 270| std::reverse(v.begin(), v.end()); 744| | 745| | if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| | store_be(bytes, v); 747| 270| } else { 748| | // Remove leading zero bytes 749| 270| const auto padded_bytes = store_be(v); 750| 270| constexpr size_t extra = N * WordInfo::bytes - Self::BYTES; 751| 270| copy_mem(bytes, std::span{padded_bytes}.template subspan()); 752| 270| } 753| 270| } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE: 776| 540| static Self from_stash(const std::array& stash) { 777| 540| static_assert(L >= N); 778| 540| std::array val = {}; 779| 2.70k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 2.16k, False: 540] ------------------ 780| 2.16k| val[i] = stash[i]; 781| 2.16k| } 782| 540| return Self(val); 783| 540| } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 210| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 210| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 210] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 210| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 210| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 1, False: 209] ------------------ 804| 1| return {}; 805| 1| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 209| return Self::from_words(words); 809| 210| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEeqERKSA_: 724| 20.0k| constexpr CT::Choice operator==(const Self& other) const { 725| 20.0k| return CT::is_equal(this->data(), other.data(), N).as_choice(); 726| 20.0k| } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE10from_wordsILm4EEESA_NSt3__15arrayImXT_EEE: 213| 209| static constexpr Self from_words(std::array w) { 214| 209| if constexpr(L == N) { 215| 209| return Self(Rep::to_rep(w)); 216| | } else { 217| | static_assert(L < N); 218| | std::array ew = {}; 219| | copy_mem(std::span{ew}.template first(), w); 220| | return Self(Rep::to_rep(ew)); 221| | } 222| 209| } pcurves_secp224r1.cpp:_ZN5Botan13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp224r16ParamsENS3_12Secp224r1RepEE7x3_ax_bERKNS_6IntModINS5_INS6_11FieldParamsEEEEE: 1327| 209| static constexpr FieldElement x3_ax_b(const FieldElement& x) { return (x.square() + A) * x + B; } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4sqrtEv: 665| 209| constexpr CT::Option sqrt() const { 666| | if constexpr(Self::P_MOD_4 == 3) { 667| | // The easy case for square root is when p == 3 (mod 4) 668| | 669| | constexpr auto P_PLUS_1_OVER_4 = p_plus_1_over_4(P); 670| | auto z = pow_vartime(P_PLUS_1_OVER_4); 671| | 672| | // Zero out the return value if it would otherwise be incorrect 673| | const CT::Choice correct = (z.square() == *this); 674| | z.conditional_assign(!correct, Self::zero()); 675| | return CT::Option(z, correct); 676| 209| } else { 677| | // Shanks-Tonelli, following I.4 in RFC 9380 678| | 679| | /* 680| | Constants: 681| | 1. c1, the largest integer such that 2^c1 divides q - 1. 682| | 2. c2 = (q - 1) / (2^c1) # Integer arithmetic 683| | 3. c3 = (c2 - 1) / 2 # Integer arithmetic 684| | 4. c4, a non-square value in F 685| | 5. c5 = c4^c2 in F 686| | */ 687| 209| constexpr auto C1_C2 = shanks_tonelli_c1c2(Self::P); 688| 209| constexpr std::array C3 = shanks_tonelli_c3(C1_C2.second); 689| 209| constexpr std::array P_MINUS_1_OVER_2 = p_minus_1_over_2(Self::P); 690| 209| constexpr Self C4 = shanks_tonelli_c4(P_MINUS_1_OVER_2); 691| 209| constexpr Self C5 = C4.pow_vartime(C1_C2.second); 692| | 693| 209| const Self& x = (*this); 694| | 695| 209| auto z = x.pow_vartime(C3); 696| 209| auto t = z.square(); 697| 209| t *= x; 698| 209| z *= x; 699| 209| auto b = t; 700| 209| auto c = C5; 701| | 702| 20.0k| for(size_t i = C1_C2.first; i >= 2; i--) { ------------------ | Branch (702:41): [True: 19.8k, False: 209] ------------------ 703| 19.8k| b.square_n(i - 2); 704| 19.8k| const CT::Choice e = b.is_one(); 705| 19.8k| z.conditional_assign(!e, z * c); 706| 19.8k| c.square_n(1); 707| 19.8k| t.conditional_assign(!e, t * c); 708| 19.8k| b = t; 709| 19.8k| } 710| | 711| | // Zero out the return value if it would otherwise be incorrect 712| 209| const CT::Choice correct = (z.square() == *this); 713| 209| z.conditional_assign(!correct, Self::zero()); 714| 209| return CT::Option(z, correct); 715| 209| } 716| 209| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE11pow_vartimeERKNSt3__15arrayImLm4EEE: 479| 209| constexpr Self pow_vartime(const std::array& exp) const { 480| 209| constexpr size_t WindowBits = (Self::BITS <= 256) ? 4 : 5; ------------------ | Branch (480:40): [True: 0, Folded] ------------------ 481| 209| constexpr size_t WindowElements = (1 << WindowBits) - 1; 482| | 483| 209| constexpr size_t Windows = (Self::BITS + WindowBits - 1) / WindowBits; 484| | 485| | /* 486| | A simple fixed width window modular multiplication. 487| | 488| | TODO: investigate using sliding window here 489| | */ 490| | 491| 209| std::array tbl; 492| | 493| 209| tbl[0] = (*this); 494| | 495| 3.13k| for(size_t i = 1; i != WindowElements; ++i) { ------------------ | Branch (495:28): [True: 2.92k, False: 209] ------------------ 496| | // Conditional ok: table indexes are public here 497| 2.92k| if(i % 2 == 1) { ------------------ | Branch (497:16): [True: 1.46k, False: 1.46k] ------------------ 498| 1.46k| tbl[i] = tbl[i / 2].square(); 499| 1.46k| } else { 500| 1.46k| tbl[i] = tbl[i - 1] * tbl[0]; 501| 1.46k| } 502| 2.92k| } 503| | 504| 209| auto r = Self::one(); 505| | 506| 209| const size_t w0 = read_window_bits(std::span{exp}, (Windows - 1) * WindowBits); 507| | 508| | // Conditional ok: this function is variable time 509| 209| if(w0 > 0) { ------------------ | Branch (509:13): [True: 0, False: 209] ------------------ 510| 0| r = tbl[w0 - 1]; 511| 0| } 512| | 513| 11.7k| for(size_t i = 1; i != Windows; ++i) { ------------------ | Branch (513:28): [True: 11.4k, False: 209] ------------------ 514| 11.4k| r.square_n(WindowBits); 515| | 516| 11.4k| const size_t w = read_window_bits(std::span{exp}, (Windows - i - 1) * WindowBits); 517| | 518| | // Conditional ok: this function is variable time 519| 11.4k| if(w > 0) { ------------------ | Branch (519:16): [True: 6.68k, False: 4.80k] ------------------ 520| 6.68k| r *= tbl[w - 1]; 521| 6.68k| } 522| 11.4k| } 523| | 524| 209| return r; 525| 209| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6is_oneEv: 237| 19.8k| constexpr CT::Choice is_one() const { return (*this == Self::one()); } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE12correct_signENS_2CT6ChoiceE: 250| 135| constexpr Self correct_sign(CT::Choice even) const { 251| 135| const auto flip = (even != this->is_even()); 252| 135| return Self::choose(flip, this->negate(), *this); 253| 135| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE7is_evenEv: 242| 135| constexpr CT::Choice is_even() const { 243| 135| auto v = Rep::from_rep(m_val); 244| 135| return !CT::Choice::from_int(v[0] & 0x01); 245| 135| } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6chooseENS_2CT6ChoiceERKSA_SE_: 258| 135| static constexpr Self choose(CT::Choice choice, const Self& x, const Self& y) { 259| 135| auto r = y; 260| 135| r.conditional_assign(choice, x); 261| 135| return r; 262| 135| } pcurves_secp224r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE12serialize_toENSt3__14spanIhLm57EEE: 952| 135| constexpr void serialize_to(std::span bytes) const { 953| 135| BOTAN_STATE_CHECK(this->is_identity().as_bool() == false); ------------------ | | 51| 135| do { \ | | 52| 135| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 135| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 135] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 135| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 135] | | ------------------ ------------------ 954| 135| BufferStuffer pack(bytes); 955| 135| pack.append(0x04); 956| 135| x().serialize_to(pack.next()); 957| 135| y().serialize_to(pack.next()); 958| 135| BOTAN_DEBUG_ASSERT(pack.full()); ------------------ | | 137| 135| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 135| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 135] | | ------------------ ------------------ 959| 135| } pcurves_secp256k1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp256k15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS3_12Secp256k1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1630| 1| m_table(basemul_booth_setup(p, BlindedScalar::Bits + 1)) {} pcurves_secp256k1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11from_affineERKNS_16AffineCurvePointISB_EE: 1027| 1| static constexpr Self from_affine(const AffinePoint& pt) { 1028| | /* 1029| | * If the point is the identity element (x=0, y=0) then instead of 1030| | * creating (x, y, 1) = (0, 0, 1) we want our projective identity 1031| | * encoding of (0, 1, 0) 1032| | * 1033| | * Which we can achieve by a conditional swap of y and z if the 1034| | * affine point is the identity. 1035| | */ 1036| | 1037| 1| const auto x = pt.x(); 1038| 1| auto y = pt.y(); 1039| 1| auto z = FieldElement::one(); 1040| | 1041| 1| FieldElement::conditional_swap(pt.is_identity(), y, z); 1042| | 1043| 1| return ProjectiveCurvePoint(x, y, z); 1044| 1| } pcurves_secp256k1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1xEv: 982| 2| constexpr const FieldElement& x() const { return m_x; } pcurves_secp256k1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1yEv: 987| 2| constexpr const FieldElement& y() const { return m_y; } pcurves_secp256k1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE3oneEv: 202| 1| static constexpr Self one() { return Self(Rep::one()); } pcurves_secp256k1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEC2ENSt3__15arrayImLm4EEE: 908| 43.8k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp256k1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 412| 1| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 413| 1| const W mask = cond.into_bitmask(); 414| | 415| 5| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (415:28): [True: 4, False: 1] ------------------ 416| 4| const auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 417| 4| const auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 418| 4| x.m_val[i] = nx; 419| 4| y.m_val[i] = ny; 420| 4| } 421| 1| } pcurves_secp256k1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE11is_identityEv: 939| 1| constexpr CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE7is_zeroEv: 227| 4.51k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_secp256k1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EC2ERKSB_SE_SE_: 1067| 1.56k| m_x(x), m_y(y), m_z(z) {} pcurves_secp256k1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3dblEv: 1181| 833| constexpr Self dbl() const { 1182| | if constexpr(Self::A_is_minus_3) { 1183| | return dbl_a_minus_3(*this); 1184| 833| } else if constexpr(Self::A_is_zero) { 1185| 833| return dbl_a_zero(*this); 1186| | } else { 1187| | return dbl_generic(*this, A); 1188| | } 1189| 833| } pcurves_secp256k1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1xEv: 1214| 6.17k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6squareEv: 428| 7.84k| constexpr BOTAN_FORCE_INLINE Self square() const { 429| 7.84k| std::array z; // NOLINT(*-member-init) 430| 7.84k| comba_sqr(z.data(), this->data()); 431| 7.84k| return Self(Rep::redc(z)); 432| 7.84k| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4dataEv: 898| 49.7k| constexpr const W* data() const { return m_val.data(); } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul3Ev: 337| 833| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_secp256k1.cpp:_ZN5BotanplERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 267| 1.74k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 268| 1.74k| std::array t; // NOLINT(*-member-init) 269| | 270| 1.74k| W carry = 0; 271| 8.71k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (271:28): [True: 6.97k, False: 1.74k] ------------------ 272| 6.97k| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 273| 6.97k| } 274| | 275| 1.74k| std::array r; // NOLINT(*-member-init) 276| 1.74k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 277| 1.74k| return Self(r); 278| 1.74k| } pcurves_secp256k1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1yEv: 1219| 6.17k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp256k1.cpp:_ZN5BotanmlERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 348| 20.7k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 349| 20.7k| std::array z; // NOLINT(*-member-init) 350| 20.7k| comba_mul(z.data(), a.data(), b.data()); 351| 20.7k| return Self(Rep::redc(z)); 352| 20.7k| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul4Ev: 340| 833| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_secp256k1.cpp:_ZN5BotanmiERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 283| 6.90k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 284| 6.90k| std::array r; // NOLINT(*-member-init) 285| 6.90k| W carry = 0; 286| 34.5k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (286:28): [True: 27.6k, False: 6.90k] ------------------ 287| 27.6k| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 288| 27.6k| } 289| | 290| 6.90k| const auto mask = CT::Mask::expand(carry).value(); 291| | 292| 6.90k| carry = 0; 293| | 294| 34.5k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (294:28): [True: 27.6k, False: 6.90k] ------------------ 295| 27.6k| r[i] = word_add(r[i], P[i] & mask, &carry); 296| 27.6k| } 297| | 298| 6.90k| return Self(r); 299| 6.90k| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul2Ev: 327| 6.66k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 328| 6.66k| std::array t = value(); 329| 6.66k| const W carry = shift_left<1>(t); 330| | 331| 6.66k| std::array r; // NOLINT(*-member-init) 332| 6.66k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 333| 6.66k| return Self(r); 334| 6.66k| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE5valueEv: 896| 6.66k| constexpr const std::array& value() const { return m_val; } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul8Ev: 343| 833| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_secp256k1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1zEv: 1224| 12.8k| constexpr const FieldElement& z() const { return m_z; } pcurves_secp256k1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EESE_: 1075| 735| friend constexpr Self operator+(const Self& a, const Self& b) { return Self::add(a, b); } pcurves_secp256k1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3addERKSC_SE_: 1138| 735| constexpr static Self add(const Self& a, const Self& b) { return point_add(a, b); } pcurves_secp256k1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11is_identityEv: 1093| 3.03k| constexpr CT::Choice is_identity() const { return z().is_zero(); } pcurves_secp256k1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18conditional_assignERSA_SB_SB_NS_2CT6ChoiceERKSA_SF_SF_: 397| 1.47k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 398| 1.47k| const W mask = cond.into_bitmask(); 399| | 400| 7.35k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (400:28): [True: 5.88k, False: 1.47k] ------------------ 401| 5.88k| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 402| 5.88k| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 403| 5.88k| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 404| 5.88k| } 405| 1.47k| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE14invert_vartimeEv: 600| 1| constexpr Self invert_vartime() const { 601| | // Conditional ok: this function is variable time 602| 1| if(this->is_zero().as_bool()) { ------------------ | Branch (602:13): [True: 0, False: 1] ------------------ 603| 0| return Self::zero(); 604| 0| } 605| | 606| 1| auto x = Self(std::array{1}); // 1 in standard domain 607| 1| auto b = Self(this->to_words()); // *this in standard domain 608| | 609| | // First loop iteration 610| 1| Self::_invert_vartime_div2_helper(b, x); 611| | 612| 1| auto a = b.negate(); 613| | // y += x but y is zero at the outset 614| 1| auto y = x; 615| | 616| | // First half of second loop iteration 617| 1| Self::_invert_vartime_div2_helper(a, y); 618| | 619| 176| for(;;) { 620| | // Conditional ok: this function is variable time 621| 176| if(a.m_val == b.m_val) { ------------------ | Branch (621:16): [True: 1, False: 175] ------------------ 622| | // At this point it should be that a == b == 1 623| 1| auto r = y.negate(); 624| | 625| | // Convert back to Montgomery if required 626| 1| r.m_val = Rep::to_rep(r.m_val); 627| 1| return r; 628| 1| } 629| | 630| 175| const auto nx = x + y; 631| | 632| | /* 633| | * Otherwise either b > a or a > b 634| | * 635| | * If b > a we want to set b to b - a 636| | * Otherwise we want to set a to a - b 637| | * 638| | * Compute r = b - a and check if it underflowed 639| | * If it did not then we are in the b > a path 640| | */ 641| 175| std::array r; // NOLINT(*-member-init) 642| 175| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 643| | 644| | // Conditional ok: this function is variable time 645| 175| if(carry == 0) { ------------------ | Branch (645:16): [True: 105, False: 70] ------------------ 646| | // b > a 647| 105| b.m_val = r; 648| 105| x = nx; 649| 105| Self::_invert_vartime_div2_helper(b, x); 650| 105| } else { 651| | // We know this can't underflow because a > b 652| 70| bigint_sub3(r.data(), a.data(), N, b.data(), N); 653| 70| a.m_val = r; 654| 70| y = nx; 655| 70| Self::_invert_vartime_div2_helper(a, y); 656| 70| } 657| 175| } 658| 1| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE8to_wordsEv: 736| 1| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_secp256k1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE27_invert_vartime_div2_helperERSA_SB_: 549| 177| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 550| 177| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 551| | 552| | // Conditional ok: this function is variable time 553| 541| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (553:16): [True: 364, False: 177] ------------------ 554| 364| shift_right<1>(a.m_val); 555| | 556| 364| const W borrow = shift_right<1>(x.m_val); 557| | 558| | // Conditional ok: this function is variable time 559| 364| if(borrow) { ------------------ | Branch (559:16): [True: 186, False: 178] ------------------ 560| 186| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 561| 186| } 562| 364| } 563| 177| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6negateEv: 454| 2| constexpr Self negate() const { 455| 2| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 456| | 457| 2| std::array r; // NOLINT(*-member-init) 458| 2| W carry = 0; 459| 10| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (459:28): [True: 8, False: 2] ------------------ 460| 8| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 461| 8| } 462| | 463| 2| return Self(r); 464| 2| } pcurves_secp256k1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEEC2ERKSB_SE_: 928| 1.56k| constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {} pcurves_secp384r1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS2_12Secp384r1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1630| 1| m_table(basemul_booth_setup(p, BlindedScalar::Bits + 1)) {} pcurves_secp384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E11from_affineERKNS_16AffineCurvePointISB_EE: 1027| 1.12k| static constexpr Self from_affine(const AffinePoint& pt) { 1028| | /* 1029| | * If the point is the identity element (x=0, y=0) then instead of 1030| | * creating (x, y, 1) = (0, 0, 1) we want our projective identity 1031| | * encoding of (0, 1, 0) 1032| | * 1033| | * Which we can achieve by a conditional swap of y and z if the 1034| | * affine point is the identity. 1035| | */ 1036| | 1037| 1.12k| const auto x = pt.x(); 1038| 1.12k| auto y = pt.y(); 1039| 1.12k| auto z = FieldElement::one(); 1040| | 1041| 1.12k| FieldElement::conditional_swap(pt.is_identity(), y, z); 1042| | 1043| 1.12k| return ProjectiveCurvePoint(x, y, z); 1044| 1.12k| } pcurves_secp384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE1xEv: 982| 146k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE1yEv: 987| 98.7k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE3oneEv: 202| 48.6k| static constexpr Self one() { return Self(Rep::one()); } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEC2ENSt3__15arrayImLm6EEE: 908| 3.31M| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 412| 1.12k| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 413| 1.12k| const W mask = cond.into_bitmask(); 414| | 415| 7.89k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (415:28): [True: 6.76k, False: 1.12k] ------------------ 416| 6.76k| const auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 417| 6.76k| const auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 418| 6.76k| x.m_val[i] = nx; 419| 6.76k| y.m_val[i] = ny; 420| 6.76k| } 421| 1.12k| } pcurves_secp384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE11is_identityEv: 939| 49.3k| constexpr CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE7is_zeroEv: 227| 262k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_secp384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_EC2ERKSB_SE_SE_: 1067| 77.8k| m_x(x), m_y(y), m_z(z) {} pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E3dblEv: 1181| 1.61k| constexpr Self dbl() const { 1182| 1.61k| if constexpr(Self::A_is_minus_3) { 1183| 1.61k| return dbl_a_minus_3(*this); 1184| | } else if constexpr(Self::A_is_zero) { 1185| | return dbl_a_zero(*this); 1186| | } else { 1187| | return dbl_generic(*this, A); 1188| | } 1189| 1.61k| } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E1zEv: 1224| 318k| constexpr const FieldElement& z() const { return m_z; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE6squareEv: 428| 789k| constexpr BOTAN_FORCE_INLINE Self square() const { 429| 789k| std::array z; // NOLINT(*-member-init) 430| 789k| comba_sqr(z.data(), this->data()); 431| 789k| return Self(Rep::redc(z)); 432| 789k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4dataEv: 898| 3.15M| constexpr const W* data() const { return m_val.data(); } pcurves_secp384r1.cpp:_ZN5BotanmlERKNS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEESC_: 348| 748k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 349| 748k| std::array z; // NOLINT(*-member-init) 350| 748k| comba_mul(z.data(), a.data(), b.data()); 351| 748k| return Self(Rep::redc(z)); 352| 748k| } pcurves_secp384r1.cpp:_ZN5BotanmiERKNS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEESC_: 283| 885k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 284| 885k| std::array r; // NOLINT(*-member-init) 285| 885k| W carry = 0; 286| 6.19M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (286:28): [True: 5.31M, False: 885k] ------------------ 287| 5.31M| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 288| 5.31M| } 289| | 290| 885k| const auto mask = CT::Mask::expand(carry).value(); 291| | 292| 885k| carry = 0; 293| | 294| 6.19M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (294:28): [True: 5.31M, False: 885k] ------------------ 295| 5.31M| r[i] = word_add(r[i], P[i] & mask, &carry); 296| 5.31M| } 297| | 298| 885k| return Self(r); 299| 885k| } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E1xEv: 1214| 191k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4mul3Ev: 337| 144k| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_secp384r1.cpp:_ZN5BotanplERKNS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEESC_: 267| 296k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 268| 296k| std::array t; // NOLINT(*-member-init) 269| | 270| 296k| W carry = 0; 271| 2.07M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (271:28): [True: 1.77M, False: 296k] ------------------ 272| 1.77M| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 273| 1.77M| } 274| | 275| 296k| std::array r; // NOLINT(*-member-init) 276| 296k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 277| 296k| return Self(r); 278| 296k| } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E1yEv: 1219| 189k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4mul4Ev: 340| 1.61k| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4mul2Ev: 327| 465k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 328| 465k| std::array t = value(); 329| 465k| const W carry = shift_left<1>(t); 330| | 331| 465k| std::array r; // NOLINT(*-member-init) 332| 465k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 333| 465k| return Self(r); 334| 465k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE5valueEv: 896| 489k| constexpr const std::array& value() const { return m_val; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4mul8Ev: 343| 1.61k| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_secp384r1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_EESE_: 1075| 3.72k| friend constexpr Self operator+(const Self& a, const Self& b) { return Self::add(a, b); } pcurves_secp384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E3addERKSC_SE_: 1138| 3.72k| constexpr static Self add(const Self& a, const Self& b) { return point_add(a, b); } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E11is_identityEv: 1093| 60.6k| constexpr CT::Choice is_identity() const { return z().is_zero(); } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE18conditional_assignERSA_SB_SB_NS_2CT6ChoiceERKSA_SF_SF_: 397| 102k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 398| 102k| const W mask = cond.into_bitmask(); 399| | 400| 717k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (400:28): [True: 614k, False: 102k] ------------------ 401| 614k| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 402| 614k| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 403| 614k| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 404| 614k| } 405| 102k| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEmLERKSA_: 357| 261k| constexpr BOTAN_FORCE_INLINE Self& operator*=(const Self& other) { 358| 261k| std::array z; // NOLINT(*-member-init) 359| 261k| comba_mul(z.data(), data(), other.data()); 360| 261k| m_val = Rep::redc(z); 361| 261k| return (*this); 362| 261k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE14invert_vartimeEv: 600| 377| constexpr Self invert_vartime() const { 601| | // Conditional ok: this function is variable time 602| 377| if(this->is_zero().as_bool()) { ------------------ | Branch (602:13): [True: 0, False: 377] ------------------ 603| 0| return Self::zero(); 604| 0| } 605| | 606| 377| auto x = Self(std::array{1}); // 1 in standard domain 607| 377| auto b = Self(this->to_words()); // *this in standard domain 608| | 609| | // First loop iteration 610| 377| Self::_invert_vartime_div2_helper(b, x); 611| | 612| 377| auto a = b.negate(); 613| | // y += x but y is zero at the outset 614| 377| auto y = x; 615| | 616| | // First half of second loop iteration 617| 377| Self::_invert_vartime_div2_helper(a, y); 618| | 619| 98.3k| for(;;) { 620| | // Conditional ok: this function is variable time 621| 98.3k| if(a.m_val == b.m_val) { ------------------ | Branch (621:16): [True: 377, False: 98.0k] ------------------ 622| | // At this point it should be that a == b == 1 623| 377| auto r = y.negate(); 624| | 625| | // Convert back to Montgomery if required 626| 377| r.m_val = Rep::to_rep(r.m_val); 627| 377| return r; 628| 377| } 629| | 630| 98.0k| const auto nx = x + y; 631| | 632| | /* 633| | * Otherwise either b > a or a > b 634| | * 635| | * If b > a we want to set b to b - a 636| | * Otherwise we want to set a to a - b 637| | * 638| | * Compute r = b - a and check if it underflowed 639| | * If it did not then we are in the b > a path 640| | */ 641| 98.0k| std::array r; // NOLINT(*-member-init) 642| 98.0k| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 643| | 644| | // Conditional ok: this function is variable time 645| 98.0k| if(carry == 0) { ------------------ | Branch (645:16): [True: 48.6k, False: 49.3k] ------------------ 646| | // b > a 647| 48.6k| b.m_val = r; 648| 48.6k| x = nx; 649| 48.6k| Self::_invert_vartime_div2_helper(b, x); 650| 49.3k| } else { 651| | // We know this can't underflow because a > b 652| 49.3k| bigint_sub3(r.data(), a.data(), N, b.data(), N); 653| 49.3k| a.m_val = r; 654| 49.3k| y = nx; 655| 49.3k| Self::_invert_vartime_div2_helper(a, y); 656| 49.3k| } 657| 98.0k| } 658| 377| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE8to_wordsEv: 736| 1.12k| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE27_invert_vartime_div2_helperERSA_SB_: 549| 98.7k| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 550| 98.7k| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 551| | 552| | // Conditional ok: this function is variable time 553| 304k| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (553:16): [True: 205k, False: 98.7k] ------------------ 554| 205k| shift_right<1>(a.m_val); 555| | 556| 205k| const W borrow = shift_right<1>(x.m_val); 557| | 558| | // Conditional ok: this function is variable time 559| 205k| if(borrow) { ------------------ | Branch (559:16): [True: 105k, False: 99.9k] ------------------ 560| 105k| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 561| 105k| } 562| 205k| } 563| 98.7k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE6negateEv: 454| 48.6k| constexpr Self negate() const { 455| 48.6k| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 456| | 457| 48.6k| std::array r; // NOLINT(*-member-init) 458| 48.6k| W carry = 0; 459| 340k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (459:28): [True: 291k, False: 48.6k] ------------------ 460| 291k| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 461| 291k| } 462| | 463| 48.6k| return Self(r); 464| 48.6k| } pcurves_secp384r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEEC2ERKSB_SE_: 928| 6.84k| constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {} pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 752| std::array stash_value() const { 762| 752| static_assert(L >= N); 763| 752| std::array stash = {}; 764| 5.26k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 4.51k, False: 752] ------------------ 765| 4.51k| stash[i] = m_val[i]; 766| 4.51k| } 767| 752| return stash; 768| 752| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE18conditional_assignENS_2CT6ChoiceERKSA_: 369| 47.4k| constexpr void conditional_assign(CT::Choice cond, const Self& nx) { 370| 47.4k| const W mask = cond.into_bitmask(); 371| | 372| 332k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (372:28): [True: 284k, False: 47.4k] ------------------ 373| 284k| m_val[i] = Botan::choose(mask, nx.m_val[i], m_val[i]); 374| 284k| } 375| 47.4k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE8to_wordsEv: 736| 750| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_secp384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS3_12Secp384r1RepEE12ScalarParamsEE8from_repERKNSt3__15arrayImLm6EEE: 139| 1.50k| constexpr static std::array from_rep(const std::array& z) { 140| 1.50k| std::array ze = {}; 141| 1.50k| copy_mem(std::span{ze}.template first(), z); 142| 1.50k| return Self::redc(ze); 143| 1.50k| } pcurves_secp384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS3_12Secp384r1RepEE12ScalarParamsEE4redcERKNSt3__15arrayImLm12EEE: 106| 4.12k| constexpr static std::array redc(const std::array& z) { 107| | if constexpr(P_dash == 1) { 108| | return monty_redc_pdash1(z, P); 109| 4.12k| } else { 110| 4.12k| return monty_redc(z, P, P_dash); 111| 4.12k| } 112| 4.12k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE12serialize_toENSt3__14spanIhLm48EEE: 741| 750| constexpr void serialize_to(std::span bytes) const { 742| 750| auto v = Rep::from_rep(m_val); 743| 750| std::reverse(v.begin(), v.end()); 744| | 745| 750| if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| 750| store_be(bytes, v); 747| | } else { 748| | // Remove leading zero bytes 749| | const auto padded_bytes = store_be(v); 750| | constexpr size_t extra = N * WordInfo::bytes - Self::BYTES; 751| | copy_mem(bytes, std::span{padded_bytes}.template subspan()); 752| | } 753| 750| } pcurves_secp384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E10add_or_subERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceE: 1121| 47.4k| constexpr static Self add_or_sub(const Self& a, const AffinePoint& b, CT::Choice sub) { 1122| 47.4k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), A); 1123| 47.4k| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE10from_stashILm9EEESB_RKNSt3__15arrayImXT_EEE: 776| 3.75k| static Self from_stash(const std::array& stash) { 777| 3.75k| static_assert(L >= N); 778| 3.75k| std::array val = {}; 779| 26.2k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 22.5k, False: 3.75k] ------------------ 780| 22.5k| val[i] = stash[i]; 781| 22.5k| } 782| 3.75k| return Self(val); 783| 3.75k| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEEC2ENSt3__15arrayImLm6EEE: 908| 104k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE12serialize_toENSt3__14spanIhLm48EEE: 741| 752| constexpr void serialize_to(std::span bytes) const { 742| 752| auto v = Rep::from_rep(m_val); 743| 752| std::reverse(v.begin(), v.end()); 744| | 745| 752| if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| 752| store_be(bytes, v); 747| | } else { 748| | // Remove leading zero bytes 749| | const auto padded_bytes = store_be(v); 750| | constexpr size_t extra = N * WordInfo::bytes - Self::BYTES; 751| | copy_mem(bytes, std::span{padded_bytes}.template subspan()); 752| | } 753| 752| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 2.25k| std::array stash_value() const { 762| 2.25k| static_assert(L >= N); 763| 2.25k| std::array stash = {}; 764| 15.7k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 13.5k, False: 2.25k] ------------------ 765| 13.5k| stash[i] = m_val[i]; 766| 13.5k| } 767| 2.25k| return stash; 768| 2.25k| } pcurves_secp384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS3_12Secp384r1RepEE12ScalarParamsEE11wide_to_repERKNSt3__15arrayImLm12EEE: 129| 375| constexpr static std::array wide_to_rep(const std::array& x) { 130| 375| auto redc_x = Self::redc(x); 131| 375| std::array z; // NOLINT(*-member-init) 132| 375| comba_mul(z.data(), redc_x.data(), R3.data()); 133| 375| return Self::redc(z); 134| 375| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4div2Ev: 304| 23.9k| Self div2() const { 305| | // The inverse of 2 modulo P is (P/2)+1; this avoids a constexpr time 306| | // general inversion, which some compilers can't handle 307| 23.9k| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 308| | 309| | // We could multiply by INV_2 but there is a better way ... 310| | 311| 23.9k| std::array t = value(); 312| 23.9k| const W borrow = shift_right<1>(t); 313| | 314| | // If value was odd, add (P/2)+1 315| 23.9k| const auto mask = CT::Mask::expand(borrow).value(); 316| | 317| 23.9k| W carry = 0; 318| | 319| 167k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (319:28): [True: 143k, False: 23.9k] ------------------ 320| 143k| t[i] = word_add(t[i], INV_2[i] & mask, &carry); 321| 143k| } 322| | 323| 23.9k| return Self(t); 324| 23.9k| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE: 776| 2.25k| static Self from_stash(const std::array& stash) { 777| 2.25k| static_assert(L >= N); 778| 2.25k| std::array val = {}; 779| 15.7k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 13.5k, False: 2.25k] ------------------ 780| 13.5k| val[i] = stash[i]; 781| 13.5k| } 782| 2.25k| return Self(val); 783| 2.25k| } pcurves_secp384r1.cpp:_ZN5Botan16VartimeMul2TableINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm5EEC2ERKNS_16AffineCurvePointINS_6IntModINS2_12Secp384r1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1786| 376| explicit VartimeMul2Table(const AffinePoint& q) : m_table(odd_multiples_setup_vartime(q)) {} pcurves_secp384r1.cpp:_ZNK5Botan16VartimeMul2TableINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm5EE12mul2_vartimeILm6EEENS_20ProjectiveCurvePointINS_6IntModINS2_12Secp384r1RepINS_13EllipticCurveINS3_6ParamsES9_E11FieldParamsEEEEESB_EERKNS_23PrecomputedBaseMulTableIS4_XT_EEERKNS8_INS_13MontgomeryRepINSC_12ScalarParamsEEEEESQ_: 1791| 375| const Scalar& y) const { 1792| | // Conditional ok: this function is variable time 1793| 375| if(x.is_zero().as_bool() && y.is_zero().as_bool()) { ------------------ | Branch (1793:13): [True: 0, False: 375] | Branch (1793:13): [True: 0, False: 375] | Branch (1793:38): [True: 0, False: 0] ------------------ 1794| 0| return ProjectivePoint::identity(); 1795| 0| } 1796| | 1797| 375| return g_table.mul_vartime(x, this->mul_vartime(y)); 1798| 375| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE7is_zeroEv: 227| 2.25k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_secp384r1.cpp:_ZNK5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EE11mul_vartimeERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_12Secp384r1RepEE12ScalarParamsEEEEERKNS_20ProjectiveCurvePointINS6_INSA_INSB_11FieldParamsEEEEES9_EE: 1643| 375| ProjectivePoint mul_vartime(const Scalar& s, const ProjectivePoint& accum) const { 1644| 375| const UnblindedScalarBits scalar(s); 1645| 375| return basemul_booth_exec_vartime(m_table, scalar, accum); 1646| 375| } pcurves_secp384r1.cpp:_ZN5Botan19UnblindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm7EEC2ERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_12Secp384r1RepEE12ScalarParamsEEEEE: 1511| 375| explicit UnblindedScalarBits(const typename C::Scalar& scalar) { scalar.serialize_to(std::span{m_bytes}); } pcurves_secp384r1.cpp:_ZNK5Botan19UnblindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm7EE4bitsEv: 1513| 375| size_t bits() const { return Bits; } pcurves_secp384r1.cpp:_ZNK5Botan19UnblindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm7EE10get_windowEm: 1515| 24.3k| size_t get_window(size_t offset) const { 1516| | // Extract a WindowBits sized window out of s, depending on offset. 1517| 24.3k| return read_window_bits(std::span{m_bytes}, offset); 1518| 24.3k| } pcurves_secp384r1.cpp:_ZNK5Botan16VartimeMul2TableINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm5EE11mul_vartimeERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_12Secp384r1RepEE12ScalarParamsEEEEE: 1802| 375| ProjectivePoint mul_vartime(const Scalar& s) const { 1803| 375| const WnafScalar naf(s); 1804| | 1805| 375| size_t i = naf.length(); 1806| | 1807| | // Conditional ok: this function is variable time 1808| 375| if(i == 0) { ------------------ | Branch (1808:13): [True: 0, False: 375] ------------------ 1809| 0| return ProjectivePoint::identity(); 1810| 0| } 1811| | 1812| 375| const auto lookup = [&](int8_t d) -> const AffinePoint& { 1813| 375| const size_t mag = static_cast((d < 0) ? -d : d); 1814| 375| return m_table[(mag - 1) / 2]; 1815| 375| }; 1816| | 1817| 375| --i; 1818| 375| auto accum = ProjectivePoint::from_affine(lookup(naf.digit(i))); 1819| 375| if(naf.digit(i) < 0) { ------------------ | Branch (1819:13): [True: 0, False: 375] ------------------ 1820| 0| accum = accum.negate(); 1821| 0| } 1822| | 1823| 375| size_t pending_dbl = 0; 1824| | 1825| 143k| while(i > 0) { ------------------ | Branch (1825:16): [True: 142k, False: 375] ------------------ 1826| 142k| --i; 1827| 142k| pending_dbl += 1; 1828| | 1829| 142k| const int8_t d = naf.digit(i); 1830| 142k| if(d != 0) { ------------------ | Branch (1830:16): [True: 23.7k, False: 119k] ------------------ 1831| 23.7k| accum = accum.dbl_n(pending_dbl); 1832| 23.7k| pending_dbl = 0; 1833| 23.7k| accum = ProjectivePoint::add_or_sub(accum, lookup(d), CT::Choice::from_int(static_cast(d < 0))); 1834| 23.7k| } 1835| 142k| } 1836| | 1837| 375| if(pending_dbl > 0) { ------------------ | Branch (1837:13): [True: 175, False: 200] ------------------ 1838| 175| accum = accum.dbl_n(pending_dbl); 1839| 175| } 1840| | 1841| 375| return accum; 1842| 375| } pcurves_secp384r1.cpp:_ZN5Botan10WnafScalarINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm5EEC2ERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_12Secp384r1RepEE12ScalarParamsEEEEE: 1539| 375| explicit WnafScalar(const typename C::Scalar& scalar) : m_digits{}, m_len(0) { 1540| 375| using Word = typename C::W; 1541| 375| constexpr size_t WordBits = WordInfo::bits; 1542| 375| constexpr Word WindowMask = (static_cast(1) << W) - 1; 1543| 375| constexpr Word HalfWindow = static_cast(1) << (W - 1); 1544| | 1545| | // One extra word so that subtracting a negative digit cannot overflow 1546| 375| std::array k = {}; 1547| 375| const auto sw = scalar.to_words(); 1548| 375| std::copy(sw.begin(), sw.end(), k.begin()); 1549| | 1550| | // Conditionals ok: this function is variable time 1551| 375| size_t i = 0; 1552| 48.7k| for(;;) { 1553| 48.7k| bool k_is_zero = true; 1554| 340k| for(const auto w : k) { ------------------ | Branch (1554:30): [True: 340k, False: 48.7k] ------------------ 1555| 340k| k_is_zero = k_is_zero && (w == 0); ------------------ | Branch (1555:28): [True: 50.9k, False: 290k] | Branch (1555:41): [True: 2.62k, False: 48.3k] ------------------ 1556| 340k| } 1557| 48.7k| if(k_is_zero) { ------------------ | Branch (1557:16): [True: 375, False: 48.3k] ------------------ 1558| 375| break; 1559| 375| } 1560| | 1561| 48.3k| size_t shift = 1; 1562| | 1563| 48.3k| if((k[0] & 1) == 1) { ------------------ | Branch (1563:16): [True: 24.1k, False: 24.2k] ------------------ 1564| 24.1k| BOTAN_DEBUG_ASSERT(i < MaxDigits); ------------------ | | 137| 24.1k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 24.1k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 24.1k] | | ------------------ ------------------ 1565| | 1566| 24.1k| const Word d = k[0] & WindowMask; 1567| | 1568| 24.1k| if(d >= HalfWindow) { ------------------ | Branch (1568:19): [True: 11.8k, False: 12.2k] ------------------ 1569| | // Negative digit (d - 2^W); subtracting it adds 2^W - d to k 1570| 11.8k| m_digits[i] = static_cast(static_cast(d) - (1 << W)); 1571| 11.8k| Word carry = (static_cast(1) << W) - d; 1572| 23.7k| for(size_t j = 0; j != k.size() && carry > 0; ++j) { ------------------ | Branch (1572:37): [True: 23.7k, False: 0] | Branch (1572:54): [True: 11.8k, False: 11.8k] ------------------ 1573| 11.8k| const Word t = k[j] + carry; 1574| 11.8k| carry = (t < k[j]) ? 1 : 0; ------------------ | Branch (1574:30): [True: 0, False: 11.8k] ------------------ 1575| 11.8k| k[j] = t; 1576| 11.8k| } 1577| 12.2k| } else { 1578| 12.2k| m_digits[i] = static_cast(d); 1579| 12.2k| Word borrow = d; 1580| 24.4k| for(size_t j = 0; j != k.size() && borrow > 0; ++j) { ------------------ | Branch (1580:37): [True: 24.4k, False: 0] | Branch (1580:54): [True: 12.2k, False: 12.2k] ------------------ 1581| 12.2k| const Word t = k[j] - borrow; 1582| 12.2k| borrow = (k[j] < borrow) ? 1 : 0; ------------------ | Branch (1582:31): [True: 0, False: 12.2k] ------------------ 1583| 12.2k| k[j] = t; 1584| 12.2k| } 1585| 12.2k| } 1586| | 1587| 24.1k| m_len = i + 1; 1588| | 1589| | // k is now a multiple of 2^W, so the next W-1 digits are zero 1590| 24.1k| shift = W; 1591| 24.1k| } 1592| | 1593| 386k| for(size_t j = 0; j != k.size(); ++j) { ------------------ | Branch (1593:31): [True: 338k, False: 48.3k] ------------------ 1594| 338k| k[j] >>= shift; 1595| 338k| if(j + 1 != k.size()) { ------------------ | Branch (1595:19): [True: 290k, False: 48.3k] ------------------ 1596| 290k| k[j] |= k[j + 1] << (WordBits - shift); 1597| 290k| } 1598| 338k| } 1599| | 1600| 48.3k| i += shift; 1601| 48.3k| } 1602| 375| } pcurves_secp384r1.cpp:_ZNK5Botan10WnafScalarINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm5EE6lengthEv: 1605| 375| size_t length() const { return m_len; } pcurves_secp384r1.cpp:_ZZNK5Botan16VartimeMul2TableINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm5EE11mul_vartimeERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_12Secp384r1RepEE12ScalarParamsEEEEEENKUlaE_clEa: 1812| 24.1k| const auto lookup = [&](int8_t d) -> const AffinePoint& { 1813| 24.1k| const size_t mag = static_cast((d < 0) ? -d : d); ------------------ | Branch (1813:52): [True: 11.8k, False: 12.2k] ------------------ 1814| 24.1k| return m_table[(mag - 1) / 2]; 1815| 24.1k| }; pcurves_secp384r1.cpp:_ZNK5Botan10WnafScalarINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm5EE5digitEm: 1607| 143k| int8_t digit(size_t i) const { return m_digits[i]; } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E5dbl_nEm: 1143| 23.9k| constexpr Self dbl_n(size_t n) const { 1144| 23.9k| if constexpr(Self::A_is_minus_3) { 1145| 23.9k| return dbl_n_a_minus_3(*this, n); 1146| | } else if constexpr(Self::A_is_zero) { 1147| | return dbl_n_a_zero(*this, n); 1148| | } else { 1149| | return dbl_n_generic(*this, A, n); 1150| | } 1151| 23.9k| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 1.24k| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 1.24k| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 1.24k] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 1.24k| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 1.24k| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 1, False: 1.24k] ------------------ 804| 1| return {}; 805| 1| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 1.24k| return Self::from_words(words); 809| 1.24k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEeqERKSA_: 724| 807| constexpr CT::Choice operator==(const Self& other) const { 725| 807| return CT::is_equal(this->data(), other.data(), N).as_choice(); 726| 807| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE10from_wordsILm6EEESA_NSt3__15arrayImXT_EEE: 213| 1.61k| static constexpr Self from_words(std::array w) { 214| 1.61k| if constexpr(L == N) { 215| 1.61k| return Self(Rep::to_rep(w)); 216| | } else { 217| | static_assert(L < N); 218| | std::array ew = {}; 219| | copy_mem(std::span{ew}.template first(), w); 220| | return Self(Rep::to_rep(ew)); 221| | } 222| 1.61k| } pcurves_secp384r1.cpp:_ZN5Botan13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS2_12Secp384r1RepEE7x3_ax_bERKNS_6IntModINS5_INS6_11FieldParamsEEEEE: 1327| 432| static constexpr FieldElement x3_ax_b(const FieldElement& x) { return (x.square() + A) * x + B; } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 750| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 750| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 750] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 750| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 750| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 0, False: 750] ------------------ 804| 0| return {}; 805| 0| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 750| return Self::from_words(words); 809| 750| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE10from_wordsILm6EEESB_NSt3__15arrayImXT_EEE: 213| 750| static constexpr Self from_words(std::array w) { 214| 750| if constexpr(L == N) { 215| 750| return Self(Rep::to_rep(w)); 216| | } else { 217| | static_assert(L < N); 218| | std::array ew = {}; 219| | copy_mem(std::span{ew}.template first(), w); 220| | return Self(Rep::to_rep(ew)); 221| | } 222| 750| } pcurves_secp384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS3_12Secp384r1RepEE12ScalarParamsEE6to_repERKNSt3__15arrayImLm6EEE: 117| 1.12k| constexpr static std::array to_rep(const std::array& x) { 118| 1.12k| std::array z; // NOLINT(*-member-init) 119| 1.12k| comba_mul(z.data(), x.data(), R2.data()); 120| 1.12k| return Self::redc(z); 121| 1.12k| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE22from_wide_bytes_varlenENSt3__14spanIKhLm18446744073709551615EEE: 831| 375| static constexpr std::optional from_wide_bytes_varlen(std::span bytes) { 832| | // Conditional ok: input length is public 833| 375| if(bytes.size() > 2 * Self::BYTES) { ------------------ | Branch (833:13): [True: 0, False: 375] ------------------ 834| 0| return {}; 835| 0| } 836| | 837| 375| std::array padded_bytes = {}; 838| 375| copy_mem(std::span{padded_bytes}.last(bytes.size()), bytes); 839| 375| return Self(Rep::wide_to_rep(bytes_to_words(std::span{padded_bytes}))); 840| 375| } pcurves_secp384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE12serialize_toENSt3__14spanIhLm97EEE: 952| 376| constexpr void serialize_to(std::span bytes) const { 953| 376| BOTAN_STATE_CHECK(this->is_identity().as_bool() == false); ------------------ | | 51| 376| do { \ | | 52| 376| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 376| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 376] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 376| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 376] | | ------------------ ------------------ 954| 376| BufferStuffer pack(bytes); 955| 376| pack.append(0x04); 956| 376| x().serialize_to(pack.next()); 957| 376| y().serialize_to(pack.next()); 958| 376| BOTAN_DEBUG_ASSERT(pack.full()); ------------------ | | 137| 376| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 376| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 376] | | ------------------ ------------------ 959| 376| } pcurves_secp384r1.cpp:_ZN5BotanplERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEEESD_: 267| 97.3k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 268| 97.3k| std::array t; // NOLINT(*-member-init) 269| | 270| 97.3k| W carry = 0; 271| 681k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (271:28): [True: 584k, False: 97.3k] ------------------ 272| 584k| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 273| 584k| } 274| | 275| 97.3k| std::array r; // NOLINT(*-member-init) 276| 97.3k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 277| 97.3k| return Self(r); 278| 97.3k| } pcurves_secp384r1.cpp:_ZN5BotanmlERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEEESD_: 348| 750| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 349| 750| std::array z; // NOLINT(*-member-init) 350| 750| comba_mul(z.data(), a.data(), b.data()); 351| 750| return Self(Rep::redc(z)); 352| 750| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE4dataEv: 898| 303k| constexpr const W* data() const { return m_val.data(); } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE14invert_vartimeEv: 600| 375| constexpr Self invert_vartime() const { 601| | // Conditional ok: this function is variable time 602| 375| if(this->is_zero().as_bool()) { ------------------ | Branch (602:13): [True: 0, False: 375] ------------------ 603| 0| return Self::zero(); 604| 0| } 605| | 606| 375| auto x = Self(std::array{1}); // 1 in standard domain 607| 375| auto b = Self(this->to_words()); // *this in standard domain 608| | 609| | // First loop iteration 610| 375| Self::_invert_vartime_div2_helper(b, x); 611| | 612| 375| auto a = b.negate(); 613| | // y += x but y is zero at the outset 614| 375| auto y = x; 615| | 616| | // First half of second loop iteration 617| 375| Self::_invert_vartime_div2_helper(a, y); 618| | 619| 97.7k| for(;;) { 620| | // Conditional ok: this function is variable time 621| 97.7k| if(a.m_val == b.m_val) { ------------------ | Branch (621:16): [True: 375, False: 97.3k] ------------------ 622| | // At this point it should be that a == b == 1 623| 375| auto r = y.negate(); 624| | 625| | // Convert back to Montgomery if required 626| 375| r.m_val = Rep::to_rep(r.m_val); 627| 375| return r; 628| 375| } 629| | 630| 97.3k| const auto nx = x + y; 631| | 632| | /* 633| | * Otherwise either b > a or a > b 634| | * 635| | * If b > a we want to set b to b - a 636| | * Otherwise we want to set a to a - b 637| | * 638| | * Compute r = b - a and check if it underflowed 639| | * If it did not then we are in the b > a path 640| | */ 641| 97.3k| std::array r; // NOLINT(*-member-init) 642| 97.3k| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 643| | 644| | // Conditional ok: this function is variable time 645| 97.3k| if(carry == 0) { ------------------ | Branch (645:16): [True: 44.3k, False: 53.0k] ------------------ 646| | // b > a 647| 44.3k| b.m_val = r; 648| 44.3k| x = nx; 649| 44.3k| Self::_invert_vartime_div2_helper(b, x); 650| 53.0k| } else { 651| | // We know this can't underflow because a > b 652| 53.0k| bigint_sub3(r.data(), a.data(), N, b.data(), N); 653| 53.0k| a.m_val = r; 654| 53.0k| y = nx; 655| 53.0k| Self::_invert_vartime_div2_helper(a, y); 656| 53.0k| } 657| 97.3k| } 658| 375| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE27_invert_vartime_div2_helperERSB_SC_: 549| 98.1k| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 550| 98.1k| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 551| | 552| | // Conditional ok: this function is variable time 553| 310k| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (553:16): [True: 212k, False: 98.1k] ------------------ 554| 212k| shift_right<1>(a.m_val); 555| | 556| 212k| const W borrow = shift_right<1>(x.m_val); 557| | 558| | // Conditional ok: this function is variable time 559| 212k| if(borrow) { ------------------ | Branch (559:16): [True: 105k, False: 106k] ------------------ 560| 105k| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 561| 105k| } 562| 212k| } 563| 98.1k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE6negateEv: 454| 750| constexpr Self negate() const { 455| 750| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 456| | 457| 750| std::array r; // NOLINT(*-member-init) 458| 750| W carry = 0; 459| 5.25k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (459:28): [True: 4.50k, False: 750] ------------------ 460| 4.50k| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 461| 4.50k| } 462| | 463| 750| return Self(r); 464| 750| } pcurves_secp521r1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS3_7P521RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1630| 1| m_table(basemul_booth_setup(p, BlindedScalar::Bits + 1)) {} pcurves_secp521r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11from_affineERKNS_16AffineCurvePointISB_EE: 1027| 853| static constexpr Self from_affine(const AffinePoint& pt) { 1028| | /* 1029| | * If the point is the identity element (x=0, y=0) then instead of 1030| | * creating (x, y, 1) = (0, 0, 1) we want our projective identity 1031| | * encoding of (0, 1, 0) 1032| | * 1033| | * Which we can achieve by a conditional swap of y and z if the 1034| | * affine point is the identity. 1035| | */ 1036| | 1037| 853| const auto x = pt.x(); 1038| 853| auto y = pt.y(); 1039| 853| auto z = FieldElement::one(); 1040| | 1041| 853| FieldElement::conditional_swap(pt.is_identity(), y, z); 1042| | 1043| 853| return ProjectiveCurvePoint(x, y, z); 1044| 853| } pcurves_secp521r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1xEv: 982| 147k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp521r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1yEv: 987| 99.0k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE3oneEv: 202| 48.9k| static constexpr Self one() { return Self(Rep::one()); } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEC2ENSt3__15arrayImLm9EEE: 908| 3.36M| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 412| 853| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 413| 853| const W mask = cond.into_bitmask(); 414| | 415| 8.53k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (415:28): [True: 7.67k, False: 853] ------------------ 416| 7.67k| const auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 417| 7.67k| const auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 418| 7.67k| x.m_val[i] = nx; 419| 7.67k| y.m_val[i] = ny; 420| 7.67k| } 421| 853| } pcurves_secp521r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE11is_identityEv: 939| 49.5k| constexpr CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE7is_zeroEv: 227| 263k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_secp521r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EC2ERKSB_SE_SE_: 1067| 78.5k| m_x(x), m_y(y), m_z(z) {} pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3dblEv: 1181| 1.93k| constexpr Self dbl() const { 1182| 1.93k| if constexpr(Self::A_is_minus_3) { 1183| 1.93k| return dbl_a_minus_3(*this); 1184| | } else if constexpr(Self::A_is_zero) { 1185| | return dbl_a_zero(*this); 1186| | } else { 1187| | return dbl_generic(*this, A); 1188| | } 1189| 1.93k| } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1zEv: 1224| 319k| constexpr const FieldElement& z() const { return m_z; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6squareEv: 428| 800k| constexpr BOTAN_FORCE_INLINE Self square() const { 429| 800k| std::array z; // NOLINT(*-member-init) 430| 800k| comba_sqr(z.data(), this->data()); 431| 800k| return Self(Rep::redc(z)); 432| 800k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4dataEv: 898| 3.21M| constexpr const W* data() const { return m_val.data(); } pcurves_secp521r1.cpp:_ZN5BotanmlERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 348| 756k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 349| 756k| std::array z; // NOLINT(*-member-init) 350| 756k| comba_mul(z.data(), a.data(), b.data()); 351| 756k| return Self(Rep::redc(z)); 352| 756k| } pcurves_secp521r1.cpp:_ZN5BotanmiERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 283| 897k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 284| 897k| std::array r; // NOLINT(*-member-init) 285| 897k| W carry = 0; 286| 8.97M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (286:28): [True: 8.07M, False: 897k] ------------------ 287| 8.07M| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 288| 8.07M| } 289| | 290| 897k| const auto mask = CT::Mask::expand(carry).value(); 291| | 292| 897k| carry = 0; 293| | 294| 8.97M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (294:28): [True: 8.07M, False: 897k] ------------------ 295| 8.07M| r[i] = word_add(r[i], P[i] & mask, &carry); 296| 8.07M| } 297| | 298| 897k| return Self(r); 299| 897k| } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1xEv: 1214| 193k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul3Ev: 337| 146k| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_secp521r1.cpp:_ZN5BotanplERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 267| 306k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 268| 306k| std::array t; // NOLINT(*-member-init) 269| | 270| 306k| W carry = 0; 271| 3.06M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (271:28): [True: 2.75M, False: 306k] ------------------ 272| 2.75M| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 273| 2.75M| } 274| | 275| 306k| std::array r; // NOLINT(*-member-init) 276| 306k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 277| 306k| return Self(r); 278| 306k| } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1yEv: 1219| 191k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul4Ev: 340| 1.93k| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul2Ev: 327| 474k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 328| 474k| std::array t = value(); 329| 474k| const W carry = shift_left<1>(t); 330| | 331| 474k| std::array r; // NOLINT(*-member-init) 332| 474k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 333| 474k| return Self(r); 334| 474k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE5valueEv: 896| 499k| constexpr const std::array& value() const { return m_val; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul8Ev: 343| 1.93k| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_secp521r1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EESE_: 1075| 3.45k| friend constexpr Self operator+(const Self& a, const Self& b) { return Self::add(a, b); } pcurves_secp521r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3addERKSC_SE_: 1138| 3.45k| constexpr static Self add(const Self& a, const Self& b) { return point_add(a, b); } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11is_identityEv: 1093| 60.6k| constexpr CT::Choice is_identity() const { return z().is_zero(); } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18conditional_assignERSA_SB_SB_NS_2CT6ChoiceERKSA_SF_SF_: 397| 103k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 398| 103k| const W mask = cond.into_bitmask(); 399| | 400| 1.03M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (400:28): [True: 927k, False: 103k] ------------------ 401| 927k| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 402| 927k| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 403| 927k| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 404| 927k| } 405| 103k| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEmLERKSA_: 357| 265k| constexpr BOTAN_FORCE_INLINE Self& operator*=(const Self& other) { 358| 265k| std::array z; // NOLINT(*-member-init) 359| 265k| comba_mul(z.data(), data(), other.data()); 360| 265k| m_val = Rep::redc(z); 361| 265k| return (*this); 362| 265k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE14invert_vartimeEv: 600| 287| constexpr Self invert_vartime() const { 601| | // Conditional ok: this function is variable time 602| 287| if(this->is_zero().as_bool()) { ------------------ | Branch (602:13): [True: 0, False: 287] ------------------ 603| 0| return Self::zero(); 604| 0| } 605| | 606| 287| auto x = Self(std::array{1}); // 1 in standard domain 607| 287| auto b = Self(this->to_words()); // *this in standard domain 608| | 609| | // First loop iteration 610| 287| Self::_invert_vartime_div2_helper(b, x); 611| | 612| 287| auto a = b.negate(); 613| | // y += x but y is zero at the outset 614| 287| auto y = x; 615| | 616| | // First half of second loop iteration 617| 287| Self::_invert_vartime_div2_helper(a, y); 618| | 619| 105k| for(;;) { 620| | // Conditional ok: this function is variable time 621| 105k| if(a.m_val == b.m_val) { ------------------ | Branch (621:16): [True: 287, False: 105k] ------------------ 622| | // At this point it should be that a == b == 1 623| 287| auto r = y.negate(); 624| | 625| | // Convert back to Montgomery if required 626| 287| r.m_val = Rep::to_rep(r.m_val); 627| 287| return r; 628| 287| } 629| | 630| 105k| const auto nx = x + y; 631| | 632| | /* 633| | * Otherwise either b > a or a > b 634| | * 635| | * If b > a we want to set b to b - a 636| | * Otherwise we want to set a to a - b 637| | * 638| | * Compute r = b - a and check if it underflowed 639| | * If it did not then we are in the b > a path 640| | */ 641| 105k| std::array r; // NOLINT(*-member-init) 642| 105k| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 643| | 644| | // Conditional ok: this function is variable time 645| 105k| if(carry == 0) { ------------------ | Branch (645:16): [True: 50.5k, False: 54.8k] ------------------ 646| | // b > a 647| 50.5k| b.m_val = r; 648| 50.5k| x = nx; 649| 50.5k| Self::_invert_vartime_div2_helper(b, x); 650| 54.8k| } else { 651| | // We know this can't underflow because a > b 652| 54.8k| bigint_sub3(r.data(), a.data(), N, b.data(), N); 653| 54.8k| a.m_val = r; 654| 54.8k| y = nx; 655| 54.8k| Self::_invert_vartime_div2_helper(a, y); 656| 54.8k| } 657| 105k| } 658| 287| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE8to_wordsEv: 736| 847| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE27_invert_vartime_div2_helperERSA_SB_: 549| 105k| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 550| 105k| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 551| | 552| | // Conditional ok: this function is variable time 553| 317k| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (553:16): [True: 211k, False: 105k] ------------------ 554| 211k| shift_right<1>(a.m_val); 555| | 556| 211k| const W borrow = shift_right<1>(x.m_val); 557| | 558| | // Conditional ok: this function is variable time 559| 211k| if(borrow) { ------------------ | Branch (559:16): [True: 33.2k, False: 178k] ------------------ 560| 33.2k| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 561| 33.2k| } 562| 211k| } 563| 105k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6negateEv: 454| 48.9k| constexpr Self negate() const { 455| 48.9k| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 456| | 457| 48.9k| std::array r; // NOLINT(*-member-init) 458| 48.9k| W carry = 0; 459| 489k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (459:28): [True: 440k, False: 48.9k] ------------------ 460| 440k| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 461| 440k| } 462| | 463| 48.9k| return Self(r); 464| 48.9k| } pcurves_secp521r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEEC2ERKSB_SE_: 928| 6.53k| constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {} pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 572| std::array stash_value() const { 762| 572| static_assert(L >= N); 763| 572| std::array stash = {}; 764| 5.72k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 5.14k, False: 572] ------------------ 765| 5.14k| stash[i] = m_val[i]; 766| 5.14k| } 767| 572| return stash; 768| 572| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18conditional_assignENS_2CT6ChoiceERKSA_: 369| 48.0k| constexpr void conditional_assign(CT::Choice cond, const Self& nx) { 370| 48.0k| const W mask = cond.into_bitmask(); 371| | 372| 480k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (372:28): [True: 432k, False: 48.0k] ------------------ 373| 432k| m_val[i] = Botan::choose(mask, nx.m_val[i], m_val[i]); 374| 432k| } 375| 48.0k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE8to_wordsEv: 736| 560| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_secp521r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS4_7P521RepEE12ScalarParamsEE8from_repERKNSt3__15arrayImLm9EEE: 139| 1.12k| constexpr static std::array from_rep(const std::array& z) { 140| 1.12k| std::array ze = {}; 141| 1.12k| copy_mem(std::span{ze}.template first(), z); 142| 1.12k| return Self::redc(ze); 143| 1.12k| } pcurves_secp521r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS4_7P521RepEE12ScalarParamsEE4redcERKNSt3__15arrayImLm18EEE: 106| 3.08k| constexpr static std::array redc(const std::array& z) { 107| | if constexpr(P_dash == 1) { 108| | return monty_redc_pdash1(z, P); 109| 3.08k| } else { 110| 3.08k| return monty_redc(z, P, P_dash); 111| 3.08k| } 112| 3.08k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE12serialize_toENSt3__14spanIhLm66EEE: 741| 560| constexpr void serialize_to(std::span bytes) const { 742| 560| auto v = Rep::from_rep(m_val); 743| 560| std::reverse(v.begin(), v.end()); 744| | 745| | if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| | store_be(bytes, v); 747| 560| } else { 748| | // Remove leading zero bytes 749| 560| const auto padded_bytes = store_be(v); 750| 560| constexpr size_t extra = N * WordInfo::bytes - Self::BYTES; 751| 560| copy_mem(bytes, std::span{padded_bytes}.template subspan()); 752| 560| } 753| 560| } pcurves_secp521r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E10add_or_subERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceE: 1121| 48.0k| constexpr static Self add_or_sub(const Self& a, const AffinePoint& b, CT::Choice sub) { 1122| 48.0k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), A); 1123| 48.0k| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE10from_stashILm9EEESB_RKNSt3__15arrayImXT_EEE: 776| 2.80k| static Self from_stash(const std::array& stash) { 777| 2.80k| static_assert(L >= N); 778| 2.80k| std::array val = {}; 779| 28.0k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 25.2k, False: 2.80k] ------------------ 780| 25.2k| val[i] = stash[i]; 781| 25.2k| } 782| 2.80k| return Self(val); 783| 2.80k| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEEC2ENSt3__15arrayImLm9EEE: 908| 98.6k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE12serialize_toENSt3__14spanIhLm66EEE: 741| 572| constexpr void serialize_to(std::span bytes) const { 742| 572| auto v = Rep::from_rep(m_val); 743| 572| std::reverse(v.begin(), v.end()); 744| | 745| | if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| | store_be(bytes, v); 747| 572| } else { 748| | // Remove leading zero bytes 749| 572| const auto padded_bytes = store_be(v); 750| 572| constexpr size_t extra = N * WordInfo::bytes - Self::BYTES; 751| 572| copy_mem(bytes, std::span{padded_bytes}.template subspan()); 752| 572| } 753| 572| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 1.68k| std::array stash_value() const { 762| 1.68k| static_assert(L >= N); 763| 1.68k| std::array stash = {}; 764| 16.8k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 15.1k, False: 1.68k] ------------------ 765| 15.1k| stash[i] = m_val[i]; 766| 15.1k| } 767| 1.68k| return stash; 768| 1.68k| } pcurves_secp521r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS4_7P521RepEE12ScalarParamsEE11wide_to_repERKNSt3__15arrayImLm18EEE: 129| 280| constexpr static std::array wide_to_rep(const std::array& x) { 130| 280| auto redc_x = Self::redc(x); 131| 280| std::array z; // NOLINT(*-member-init) 132| 280| comba_mul(z.data(), redc_x.data(), R3.data()); 133| 280| return Self::redc(z); 134| 280| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4div2Ev: 304| 24.2k| Self div2() const { 305| | // The inverse of 2 modulo P is (P/2)+1; this avoids a constexpr time 306| | // general inversion, which some compilers can't handle 307| 24.2k| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 308| | 309| | // We could multiply by INV_2 but there is a better way ... 310| | 311| 24.2k| std::array t = value(); 312| 24.2k| const W borrow = shift_right<1>(t); 313| | 314| | // If value was odd, add (P/2)+1 315| 24.2k| const auto mask = CT::Mask::expand(borrow).value(); 316| | 317| 24.2k| W carry = 0; 318| | 319| 242k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (319:28): [True: 218k, False: 24.2k] ------------------ 320| 218k| t[i] = word_add(t[i], INV_2[i] & mask, &carry); 321| 218k| } 322| | 323| 24.2k| return Self(t); 324| 24.2k| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE: 776| 1.71k| static Self from_stash(const std::array& stash) { 777| 1.71k| static_assert(L >= N); 778| 1.71k| std::array val = {}; 779| 17.1k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 15.4k, False: 1.71k] ------------------ 780| 15.4k| val[i] = stash[i]; 781| 15.4k| } 782| 1.71k| return Self(val); 783| 1.71k| } pcurves_secp521r1.cpp:_ZN5Botan16VartimeMul2TableINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm5EEC2ERKNS_16AffineCurvePointINS_6IntModINS3_7P521RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1786| 286| explicit VartimeMul2Table(const AffinePoint& q) : m_table(odd_multiples_setup_vartime(q)) {} pcurves_secp521r1.cpp:_ZNK5Botan16VartimeMul2TableINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm5EE12mul2_vartimeILm6EEENS_20ProjectiveCurvePointINS_6IntModINS3_7P521RepINS_13EllipticCurveINS3_6ParamsES9_E11FieldParamsEEEEESB_EERKNS_23PrecomputedBaseMulTableIS4_XT_EEERKNS8_INS_13MontgomeryRepINSC_12ScalarParamsEEEEESQ_: 1791| 280| const Scalar& y) const { 1792| | // Conditional ok: this function is variable time 1793| 280| if(x.is_zero().as_bool() && y.is_zero().as_bool()) { ------------------ | Branch (1793:13): [True: 0, False: 280] | Branch (1793:13): [True: 0, False: 280] | Branch (1793:38): [True: 0, False: 0] ------------------ 1794| 0| return ProjectivePoint::identity(); 1795| 0| } 1796| | 1797| 280| return g_table.mul_vartime(x, this->mul_vartime(y)); 1798| 280| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE7is_zeroEv: 227| 1.68k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_secp521r1.cpp:_ZNK5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EE11mul_vartimeERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_7P521RepEE12ScalarParamsEEEEERKNS_20ProjectiveCurvePointINS6_INSA_INSB_11FieldParamsEEEEES9_EE: 1643| 280| ProjectivePoint mul_vartime(const Scalar& s, const ProjectivePoint& accum) const { 1644| 280| const UnblindedScalarBits scalar(s); 1645| 280| return basemul_booth_exec_vartime(m_table, scalar, accum); 1646| 280| } pcurves_secp521r1.cpp:_ZN5Botan19UnblindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm7EEC2ERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_7P521RepEE12ScalarParamsEEEEE: 1511| 280| explicit UnblindedScalarBits(const typename C::Scalar& scalar) { scalar.serialize_to(std::span{m_bytes}); } pcurves_secp521r1.cpp:_ZNK5Botan19UnblindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm7EE4bitsEv: 1513| 280| size_t bits() const { return Bits; } pcurves_secp521r1.cpp:_ZNK5Botan19UnblindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm7EE10get_windowEm: 1515| 24.3k| size_t get_window(size_t offset) const { 1516| | // Extract a WindowBits sized window out of s, depending on offset. 1517| 24.3k| return read_window_bits(std::span{m_bytes}, offset); 1518| 24.3k| } pcurves_secp521r1.cpp:_ZNK5Botan16VartimeMul2TableINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm5EE11mul_vartimeERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_7P521RepEE12ScalarParamsEEEEE: 1802| 280| ProjectivePoint mul_vartime(const Scalar& s) const { 1803| 280| const WnafScalar naf(s); 1804| | 1805| 280| size_t i = naf.length(); 1806| | 1807| | // Conditional ok: this function is variable time 1808| 280| if(i == 0) { ------------------ | Branch (1808:13): [True: 0, False: 280] ------------------ 1809| 0| return ProjectivePoint::identity(); 1810| 0| } 1811| | 1812| 280| const auto lookup = [&](int8_t d) -> const AffinePoint& { 1813| 280| const size_t mag = static_cast((d < 0) ? -d : d); 1814| 280| return m_table[(mag - 1) / 2]; 1815| 280| }; 1816| | 1817| 280| --i; 1818| 280| auto accum = ProjectivePoint::from_affine(lookup(naf.digit(i))); 1819| 280| if(naf.digit(i) < 0) { ------------------ | Branch (1819:13): [True: 0, False: 280] ------------------ 1820| 0| accum = accum.negate(); 1821| 0| } 1822| | 1823| 280| size_t pending_dbl = 0; 1824| | 1825| 145k| while(i > 0) { ------------------ | Branch (1825:16): [True: 145k, False: 280] ------------------ 1826| 145k| --i; 1827| 145k| pending_dbl += 1; 1828| | 1829| 145k| const int8_t d = naf.digit(i); 1830| 145k| if(d != 0) { ------------------ | Branch (1830:16): [True: 24.1k, False: 120k] ------------------ 1831| 24.1k| accum = accum.dbl_n(pending_dbl); 1832| 24.1k| pending_dbl = 0; 1833| 24.1k| accum = ProjectivePoint::add_or_sub(accum, lookup(d), CT::Choice::from_int(static_cast(d < 0))); 1834| 24.1k| } 1835| 145k| } 1836| | 1837| 280| if(pending_dbl > 0) { ------------------ | Branch (1837:13): [True: 131, False: 149] ------------------ 1838| 131| accum = accum.dbl_n(pending_dbl); 1839| 131| } 1840| | 1841| 280| return accum; 1842| 280| } pcurves_secp521r1.cpp:_ZN5Botan10WnafScalarINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm5EEC2ERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_7P521RepEE12ScalarParamsEEEEE: 1539| 280| explicit WnafScalar(const typename C::Scalar& scalar) : m_digits{}, m_len(0) { 1540| 280| using Word = typename C::W; 1541| 280| constexpr size_t WordBits = WordInfo::bits; 1542| 280| constexpr Word WindowMask = (static_cast(1) << W) - 1; 1543| 280| constexpr Word HalfWindow = static_cast(1) << (W - 1); 1544| | 1545| | // One extra word so that subtracting a negative digit cannot overflow 1546| 280| std::array k = {}; 1547| 280| const auto sw = scalar.to_words(); 1548| 280| std::copy(sw.begin(), sw.end(), k.begin()); 1549| | 1550| | // Conditionals ok: this function is variable time 1551| 280| size_t i = 0; 1552| 49.1k| for(;;) { 1553| 49.1k| bool k_is_zero = true; 1554| 491k| for(const auto w : k) { ------------------ | Branch (1554:30): [True: 491k, False: 49.1k] ------------------ 1555| 491k| k_is_zero = k_is_zero && (w == 0); ------------------ | Branch (1555:28): [True: 51.6k, False: 439k] | Branch (1555:41): [True: 2.80k, False: 48.8k] ------------------ 1556| 491k| } 1557| 49.1k| if(k_is_zero) { ------------------ | Branch (1557:16): [True: 280, False: 48.8k] ------------------ 1558| 280| break; 1559| 280| } 1560| | 1561| 48.8k| size_t shift = 1; 1562| | 1563| 48.8k| if((k[0] & 1) == 1) { ------------------ | Branch (1563:16): [True: 24.3k, False: 24.4k] ------------------ 1564| 24.3k| BOTAN_DEBUG_ASSERT(i < MaxDigits); ------------------ | | 137| 24.3k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 24.3k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 24.3k] | | ------------------ ------------------ 1565| | 1566| 24.3k| const Word d = k[0] & WindowMask; 1567| | 1568| 24.3k| if(d >= HalfWindow) { ------------------ | Branch (1568:19): [True: 12.1k, False: 12.2k] ------------------ 1569| | // Negative digit (d - 2^W); subtracting it adds 2^W - d to k 1570| 12.1k| m_digits[i] = static_cast(static_cast(d) - (1 << W)); 1571| 12.1k| Word carry = (static_cast(1) << W) - d; 1572| 24.2k| for(size_t j = 0; j != k.size() && carry > 0; ++j) { ------------------ | Branch (1572:37): [True: 24.2k, False: 0] | Branch (1572:54): [True: 12.1k, False: 12.1k] ------------------ 1573| 12.1k| const Word t = k[j] + carry; 1574| 12.1k| carry = (t < k[j]) ? 1 : 0; ------------------ | Branch (1574:30): [True: 0, False: 12.1k] ------------------ 1575| 12.1k| k[j] = t; 1576| 12.1k| } 1577| 12.2k| } else { 1578| 12.2k| m_digits[i] = static_cast(d); 1579| 12.2k| Word borrow = d; 1580| 24.5k| for(size_t j = 0; j != k.size() && borrow > 0; ++j) { ------------------ | Branch (1580:37): [True: 24.5k, False: 0] | Branch (1580:54): [True: 12.2k, False: 12.2k] ------------------ 1581| 12.2k| const Word t = k[j] - borrow; 1582| 12.2k| borrow = (k[j] < borrow) ? 1 : 0; ------------------ | Branch (1582:31): [True: 0, False: 12.2k] ------------------ 1583| 12.2k| k[j] = t; 1584| 12.2k| } 1585| 12.2k| } 1586| | 1587| 24.3k| m_len = i + 1; 1588| | 1589| | // k is now a multiple of 2^W, so the next W-1 digits are zero 1590| 24.3k| shift = W; 1591| 24.3k| } 1592| | 1593| 537k| for(size_t j = 0; j != k.size(); ++j) { ------------------ | Branch (1593:31): [True: 488k, False: 48.8k] ------------------ 1594| 488k| k[j] >>= shift; 1595| 488k| if(j + 1 != k.size()) { ------------------ | Branch (1595:19): [True: 439k, False: 48.8k] ------------------ 1596| 439k| k[j] |= k[j + 1] << (WordBits - shift); 1597| 439k| } 1598| 488k| } 1599| | 1600| 48.8k| i += shift; 1601| 48.8k| } 1602| 280| } pcurves_secp521r1.cpp:_ZNK5Botan10WnafScalarINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm5EE6lengthEv: 1605| 280| size_t length() const { return m_len; } pcurves_secp521r1.cpp:_ZZNK5Botan16VartimeMul2TableINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm5EE11mul_vartimeERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_7P521RepEE12ScalarParamsEEEEEENKUlaE_clEa: 1812| 24.3k| const auto lookup = [&](int8_t d) -> const AffinePoint& { 1813| 24.3k| const size_t mag = static_cast((d < 0) ? -d : d); ------------------ | Branch (1813:52): [True: 12.1k, False: 12.2k] ------------------ 1814| 24.3k| return m_table[(mag - 1) / 2]; 1815| 24.3k| }; pcurves_secp521r1.cpp:_ZNK5Botan10WnafScalarINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm5EE5digitEm: 1607| 145k| int8_t digit(size_t i) const { return m_digits[i]; } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E5dbl_nEm: 1143| 24.2k| constexpr Self dbl_n(size_t n) const { 1144| 24.2k| if constexpr(Self::A_is_minus_3) { 1145| 24.2k| return dbl_n_a_minus_3(*this, n); 1146| | } else if constexpr(Self::A_is_zero) { 1147| | return dbl_n_a_zero(*this, n); 1148| | } else { 1149| | return dbl_n_generic(*this, A, n); 1150| | } 1151| 24.2k| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 1.01k| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 1.01k| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 1.01k] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 1.01k| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 1.01k| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 7, False: 1.01k] ------------------ 804| 7| return {}; 805| 7| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 1.01k| return Self::from_words(words); 809| 1.01k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEeqERKSA_: 724| 644| constexpr CT::Choice operator==(const Self& other) const { 725| 644| return CT::is_equal(this->data(), other.data(), N).as_choice(); 726| 644| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE10from_wordsILm9EEESA_NSt3__15arrayImXT_EEE: 213| 1.29k| static constexpr Self from_words(std::array w) { 214| 1.29k| if constexpr(L == N) { 215| 1.29k| return Self(Rep::to_rep(w)); 216| | } else { 217| | static_assert(L < N); 218| | std::array ew = {}; 219| | copy_mem(std::span{ew}.template first(), w); 220| | return Self(Rep::to_rep(ew)); 221| | } 222| 1.29k| } pcurves_secp521r1.cpp:_ZN5Botan13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS3_7P521RepEE7x3_ax_bERKNS_6IntModINS5_INS6_11FieldParamsEEEEE: 1327| 364| static constexpr FieldElement x3_ax_b(const FieldElement& x) { return (x.square() + A) * x + B; } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 564| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 564| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 564] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 564| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 564| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 3, False: 561] ------------------ 804| 3| return {}; 805| 3| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 561| return Self::from_words(words); 809| 564| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE10from_wordsILm9EEESB_NSt3__15arrayImXT_EEE: 213| 561| static constexpr Self from_words(std::array w) { 214| 561| if constexpr(L == N) { 215| 561| return Self(Rep::to_rep(w)); 216| | } else { 217| | static_assert(L < N); 218| | std::array ew = {}; 219| | copy_mem(std::span{ew}.template first(), w); 220| | return Self(Rep::to_rep(ew)); 221| | } 222| 561| } pcurves_secp521r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS4_7P521RepEE12ScalarParamsEE6to_repERKNSt3__15arrayImLm9EEE: 117| 841| constexpr static std::array to_rep(const std::array& x) { 118| 841| std::array z; // NOLINT(*-member-init) 119| 841| comba_mul(z.data(), x.data(), R2.data()); 120| 841| return Self::redc(z); 121| 841| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE22from_wide_bytes_varlenENSt3__14spanIKhLm18446744073709551615EEE: 831| 280| static constexpr std::optional from_wide_bytes_varlen(std::span bytes) { 832| | // Conditional ok: input length is public 833| 280| if(bytes.size() > 2 * Self::BYTES) { ------------------ | Branch (833:13): [True: 0, False: 280] ------------------ 834| 0| return {}; 835| 0| } 836| | 837| 280| std::array padded_bytes = {}; 838| 280| copy_mem(std::span{padded_bytes}.last(bytes.size()), bytes); 839| 280| return Self(Rep::wide_to_rep(bytes_to_words(std::span{padded_bytes}))); 840| 280| } pcurves_secp521r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE12serialize_toENSt3__14spanIhLm133EEE: 952| 286| constexpr void serialize_to(std::span bytes) const { 953| 286| BOTAN_STATE_CHECK(this->is_identity().as_bool() == false); ------------------ | | 51| 286| do { \ | | 52| 286| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 286| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 286] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 286| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 286] | | ------------------ ------------------ 954| 286| BufferStuffer pack(bytes); 955| 286| pack.append(0x04); 956| 286| x().serialize_to(pack.next()); 957| 286| y().serialize_to(pack.next()); 958| 286| BOTAN_DEBUG_ASSERT(pack.full()); ------------------ | | 137| 286| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 286| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 286] | | ------------------ ------------------ 959| 286| } pcurves_secp521r1.cpp:_ZN5BotanplERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEEESD_: 267| 93.3k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 268| 93.3k| std::array t; // NOLINT(*-member-init) 269| | 270| 93.3k| W carry = 0; 271| 933k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (271:28): [True: 839k, False: 93.3k] ------------------ 272| 839k| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 273| 839k| } 274| | 275| 93.3k| std::array r; // NOLINT(*-member-init) 276| 93.3k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 277| 93.3k| return Self(r); 278| 93.3k| } pcurves_secp521r1.cpp:_ZN5BotanmlERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEEESD_: 348| 560| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 349| 560| std::array z; // NOLINT(*-member-init) 350| 560| comba_mul(z.data(), a.data(), b.data()); 351| 560| return Self(Rep::redc(z)); 352| 560| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE4dataEv: 898| 303k| constexpr const W* data() const { return m_val.data(); } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE14invert_vartimeEv: 600| 280| constexpr Self invert_vartime() const { 601| | // Conditional ok: this function is variable time 602| 280| if(this->is_zero().as_bool()) { ------------------ | Branch (602:13): [True: 0, False: 280] ------------------ 603| 0| return Self::zero(); 604| 0| } 605| | 606| 280| auto x = Self(std::array{1}); // 1 in standard domain 607| 280| auto b = Self(this->to_words()); // *this in standard domain 608| | 609| | // First loop iteration 610| 280| Self::_invert_vartime_div2_helper(b, x); 611| | 612| 280| auto a = b.negate(); 613| | // y += x but y is zero at the outset 614| 280| auto y = x; 615| | 616| | // First half of second loop iteration 617| 280| Self::_invert_vartime_div2_helper(a, y); 618| | 619| 93.6k| for(;;) { 620| | // Conditional ok: this function is variable time 621| 93.6k| if(a.m_val == b.m_val) { ------------------ | Branch (621:16): [True: 280, False: 93.3k] ------------------ 622| | // At this point it should be that a == b == 1 623| 280| auto r = y.negate(); 624| | 625| | // Convert back to Montgomery if required 626| 280| r.m_val = Rep::to_rep(r.m_val); 627| 280| return r; 628| 280| } 629| | 630| 93.3k| const auto nx = x + y; 631| | 632| | /* 633| | * Otherwise either b > a or a > b 634| | * 635| | * If b > a we want to set b to b - a 636| | * Otherwise we want to set a to a - b 637| | * 638| | * Compute r = b - a and check if it underflowed 639| | * If it did not then we are in the b > a path 640| | */ 641| 93.3k| std::array r; // NOLINT(*-member-init) 642| 93.3k| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 643| | 644| | // Conditional ok: this function is variable time 645| 93.3k| if(carry == 0) { ------------------ | Branch (645:16): [True: 35.7k, False: 57.5k] ------------------ 646| | // b > a 647| 35.7k| b.m_val = r; 648| 35.7k| x = nx; 649| 35.7k| Self::_invert_vartime_div2_helper(b, x); 650| 57.5k| } else { 651| | // We know this can't underflow because a > b 652| 57.5k| bigint_sub3(r.data(), a.data(), N, b.data(), N); 653| 57.5k| a.m_val = r; 654| 57.5k| y = nx; 655| 57.5k| Self::_invert_vartime_div2_helper(a, y); 656| 57.5k| } 657| 93.3k| } 658| 280| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE27_invert_vartime_div2_helperERSB_SC_: 549| 93.8k| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 550| 93.8k| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 551| | 552| | // Conditional ok: this function is variable time 553| 326k| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (553:16): [True: 232k, False: 93.8k] ------------------ 554| 232k| shift_right<1>(a.m_val); 555| | 556| 232k| const W borrow = shift_right<1>(x.m_val); 557| | 558| | // Conditional ok: this function is variable time 559| 232k| if(borrow) { ------------------ | Branch (559:16): [True: 119k, False: 113k] ------------------ 560| 119k| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 561| 119k| } 562| 232k| } 563| 93.8k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE6negateEv: 454| 560| constexpr Self negate() const { 455| 560| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 456| | 457| 560| std::array r; // NOLINT(*-member-init) 458| 560| W carry = 0; 459| 5.60k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (459:28): [True: 5.04k, False: 560] ------------------ 460| 5.04k| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 461| 5.04k| } 462| | 463| 560| return Self(r); 464| 560| } _ZN5Botan20scalar_blinding_bitsEm: 42| 307|constexpr size_t scalar_blinding_bits(size_t scalar_bits) { 43| | // For blinding use 1/8 the order length for most curves; for P-521 we round down a bit 44| | // so the masked scalar fits exactly in 9 or 18 words. 45| | 46| 307| if(scalar_bits == 521) { ------------------ | Branch (46:7): [True: 0, False: 307] ------------------ 47| 0| return 55; 48| 307| } else { 49| 307| return scalar_bits / 8; 50| 307| } 51| 307|} pcurves_generic.cpp:_ZN5Botan10mul2_setupINS_6PCurve12_GLOBAL__N_112GenericCurveELm3EEENSt3__16vectorINT_15ProjectivePointENS4_9allocatorIS7_EEEERKNS6_11AffinePointESD_: 604| 266| const typename C::AffinePoint& q) { 605| 266| static_assert(WindowBits >= 1 && WindowBits <= 4); 606| | 607| | // 2^(2*W) elements, less the identity element 608| 266| constexpr size_t TableSize = (1 << (2 * WindowBits)) - 1; 609| 266| constexpr size_t WindowSize = (1 << WindowBits); 610| | 611| 266| std::vector table; 612| 266| table.reserve(TableSize); 613| | 614| 17.0k| for(size_t i = 0; i != TableSize; ++i) { ------------------ | Branch (614:22): [True: 16.7k, False: 266] ------------------ 615| 16.7k| const size_t t_i = (i + 1); 616| 16.7k| const size_t p_i = t_i % WindowSize; 617| 16.7k| const size_t q_i = (t_i >> WindowBits) % WindowSize; 618| | 619| | // Conditionals ok: all based on t_i/p_i/q_i which in turn are derived from public i 620| | 621| | // Returns x_i * x + y_i * y 622| 16.7k| const auto next_tbl_e = [&]() { 623| 16.7k| if(p_i % 2 == 0 && q_i % 2 == 0) { 624| | // Where possible using doubling (eg indices 1, 7, 9 in 625| | // the table above) 626| 16.7k| return table[(t_i / 2) - 1].dbl(); 627| 16.7k| } else if(p_i > 0 && q_i > 0) { 628| | // A combination of p and q 629| 16.7k| if(p_i == 1) { 630| 16.7k| return p + table[(q_i << WindowBits) - 1]; 631| 16.7k| } else if(q_i == 1) { 632| 16.7k| return table[p_i - 1] + q; 633| 16.7k| } else { 634| 16.7k| return table[p_i - 1] + table[(q_i << WindowBits) - 1]; 635| 16.7k| } 636| 16.7k| } else if(p_i > 0 && q_i == 0) { 637| | // A multiple of p without a q component 638| 16.7k| if(p_i == 1) { 639| | // Just p 640| 16.7k| return C::ProjectivePoint::from_affine(p); 641| 16.7k| } else { 642| | // p * p_{i-1} 643| 16.7k| return p + table[p_i - 1 - 1]; 644| 16.7k| } 645| 16.7k| } else if(p_i == 0 && q_i > 0) { 646| 16.7k| if(q_i == 1) { 647| | // Just q 648| 16.7k| return C::ProjectivePoint::from_affine(q); 649| 16.7k| } else { 650| | // q * q_{i-1} 651| 16.7k| return q + table[((q_i - 1) << WindowBits) - 1]; 652| 16.7k| } 653| 16.7k| } else { 654| 16.7k| BOTAN_ASSERT_UNREACHABLE(); 655| 16.7k| } 656| 16.7k| }; 657| | 658| 16.7k| table.emplace_back(next_tbl_e()); 659| 16.7k| } 660| | 661| 266| return table; 662| 266|} pcurves_generic.cpp:_ZZN5Botan10mul2_setupINS_6PCurve12_GLOBAL__N_112GenericCurveELm3EEENSt3__16vectorINT_15ProjectivePointENS4_9allocatorIS7_EEEERKNS6_11AffinePointESD_ENKUlvE_clEv: 622| 16.7k| const auto next_tbl_e = [&]() { 623| 16.7k| if(p_i % 2 == 0 && q_i % 2 == 0) { ------------------ | Branch (623:13): [True: 8.24k, False: 8.51k] | Branch (623:29): [True: 3.99k, False: 4.25k] ------------------ 624| | // Where possible using doubling (eg indices 1, 7, 9 in 625| | // the table above) 626| 3.99k| return table[(t_i / 2) - 1].dbl(); 627| 12.7k| } else if(p_i > 0 && q_i > 0) { ------------------ | Branch (627:20): [True: 11.7k, False: 1.06k] | Branch (627:31): [True: 10.6k, False: 1.06k] ------------------ 628| | // A combination of p and q 629| 10.6k| if(p_i == 1) { ------------------ | Branch (629:16): [True: 1.86k, False: 8.77k] ------------------ 630| 1.86k| return p + table[(q_i << WindowBits) - 1]; 631| 8.77k| } else if(q_i == 1) { ------------------ | Branch (631:23): [True: 1.59k, False: 7.18k] ------------------ 632| 1.59k| return table[p_i - 1] + q; 633| 7.18k| } else { 634| 7.18k| return table[p_i - 1] + table[(q_i << WindowBits) - 1]; 635| 7.18k| } 636| 10.6k| } else if(p_i > 0 && q_i == 0) { ------------------ | Branch (636:20): [True: 1.06k, False: 1.06k] | Branch (636:31): [True: 1.06k, False: 0] ------------------ 637| | // A multiple of p without a q component 638| 1.06k| if(p_i == 1) { ------------------ | Branch (638:16): [True: 266, False: 798] ------------------ 639| | // Just p 640| 266| return C::ProjectivePoint::from_affine(p); 641| 798| } else { 642| | // p * p_{i-1} 643| 798| return p + table[p_i - 1 - 1]; 644| 798| } 645| 1.06k| } else if(p_i == 0 && q_i > 0) { ------------------ | Branch (645:20): [True: 1.06k, False: 0] | Branch (645:32): [True: 1.06k, False: 0] ------------------ 646| 1.06k| if(q_i == 1) { ------------------ | Branch (646:16): [True: 266, False: 798] ------------------ 647| | // Just q 648| 266| return C::ProjectivePoint::from_affine(q); 649| 798| } else { 650| | // q * q_{i-1} 651| 798| return q + table[((q_i - 1) << WindowBits) - 1]; 652| 798| } 653| 1.06k| } else { 654| 0| BOTAN_ASSERT_UNREACHABLE(); ------------------ | | 173| 0|#define BOTAN_ASSERT_UNREACHABLE() Botan::assert_unreachable(__FILE__, __LINE__) ------------------ 655| 0| } 656| 16.7k| }; pcurves_generic.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_112GenericCurveELm6EEENSt3__16vectorINT_11AffinePointENS4_9allocatorIS7_EEEERKS7_m: 180| 307|std::vector basemul_booth_setup(const typename C::AffinePoint& p, size_t max_scalar_bits) { 181| 307| static_assert(WindowBits >= 1 && WindowBits <= 8); 182| | 183| | // 2^(W-1) elements per window [1*base .. 2^(W-1)*base] 184| 307| constexpr size_t WindowElements = 1 << (WindowBits - 1); 185| | 186| 307| const size_t Windows = (max_scalar_bits + WindowBits - 1) / WindowBits; 187| | 188| 307| const size_t TableSize = Windows * WindowElements; 189| | 190| 307| std::vector table; 191| 307| table.reserve(TableSize); 192| | 193| 307| auto accum = C::ProjectivePoint::from_affine(p); 194| | 195| 15.3k| for(size_t i = 0; i != TableSize; i += WindowElements) { ------------------ | Branch (195:22): [True: 15.0k, False: 307] ------------------ 196| 15.0k| table.push_back(accum); 197| | 198| 482k| for(size_t j = 1; j != WindowElements; ++j) { ------------------ | Branch (198:25): [True: 467k, False: 15.0k] ------------------ 199| | // Conditional ok: loop iteration count is public 200| 467k| if(j % 2 == 1) { ------------------ | Branch (200:13): [True: 241k, False: 226k] ------------------ 201| 241k| table.emplace_back(table[i + j / 2].dbl()); 202| 241k| } else { 203| 226k| table.emplace_back(table[i + j - 1] + table[i]); 204| 226k| } 205| 467k| } 206| | 207| | // Advance to next window's base: 2^W * current_base 208| | // The last entry is 2^(W-1) * base, so doubling gives 2^W * base 209| 15.0k| accum = table[i + WindowElements - 1].dbl(); 210| 15.0k| } 211| | 212| | // Variable time batch conversion is fine since generator is public 213| 307| return to_affine_batch(table); 214| 307|} pcurves_secp224r1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_19secp224r15CurveELm6EEENSt3__16vectorINT_11AffinePointENS5_9allocatorIS8_EEEERKS8_m: 180| 1|std::vector basemul_booth_setup(const typename C::AffinePoint& p, size_t max_scalar_bits) { 181| 1| static_assert(WindowBits >= 1 && WindowBits <= 8); 182| | 183| | // 2^(W-1) elements per window [1*base .. 2^(W-1)*base] 184| 1| constexpr size_t WindowElements = 1 << (WindowBits - 1); 185| | 186| 1| const size_t Windows = (max_scalar_bits + WindowBits - 1) / WindowBits; 187| | 188| 1| const size_t TableSize = Windows * WindowElements; 189| | 190| 1| std::vector table; 191| 1| table.reserve(TableSize); 192| | 193| 1| auto accum = C::ProjectivePoint::from_affine(p); 194| | 195| 44| for(size_t i = 0; i != TableSize; i += WindowElements) { ------------------ | Branch (195:22): [True: 43, False: 1] ------------------ 196| 43| table.push_back(accum); 197| | 198| 1.37k| for(size_t j = 1; j != WindowElements; ++j) { ------------------ | Branch (198:25): [True: 1.33k, False: 43] ------------------ 199| | // Conditional ok: loop iteration count is public 200| 1.33k| if(j % 2 == 1) { ------------------ | Branch (200:13): [True: 688, False: 645] ------------------ 201| 688| table.emplace_back(table[i + j / 2].dbl()); 202| 688| } else { 203| 645| table.emplace_back(table[i + j - 1] + table[i]); 204| 645| } 205| 1.33k| } 206| | 207| | // Advance to next window's base: 2^W * current_base 208| | // The last entry is 2^(W-1) * base, so doubling gives 2^W * base 209| 43| accum = table[i + WindowElements - 1].dbl(); 210| 43| } 211| | 212| | // Variable time batch conversion is fine since generator is public 213| 1| return to_affine_batch(table); 214| 1|} pcurves_secp256k1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_19secp256k15CurveELm6EEENSt3__16vectorINT_11AffinePointENS5_9allocatorIS8_EEEERKS8_m: 180| 1|std::vector basemul_booth_setup(const typename C::AffinePoint& p, size_t max_scalar_bits) { 181| 1| static_assert(WindowBits >= 1 && WindowBits <= 8); 182| | 183| | // 2^(W-1) elements per window [1*base .. 2^(W-1)*base] 184| 1| constexpr size_t WindowElements = 1 << (WindowBits - 1); 185| | 186| 1| const size_t Windows = (max_scalar_bits + WindowBits - 1) / WindowBits; 187| | 188| 1| const size_t TableSize = Windows * WindowElements; 189| | 190| 1| std::vector table; 191| 1| table.reserve(TableSize); 192| | 193| 1| auto accum = C::ProjectivePoint::from_affine(p); 194| | 195| 50| for(size_t i = 0; i != TableSize; i += WindowElements) { ------------------ | Branch (195:22): [True: 49, False: 1] ------------------ 196| 49| table.push_back(accum); 197| | 198| 1.56k| for(size_t j = 1; j != WindowElements; ++j) { ------------------ | Branch (198:25): [True: 1.51k, False: 49] ------------------ 199| | // Conditional ok: loop iteration count is public 200| 1.51k| if(j % 2 == 1) { ------------------ | Branch (200:13): [True: 784, False: 735] ------------------ 201| 784| table.emplace_back(table[i + j / 2].dbl()); 202| 784| } else { 203| 735| table.emplace_back(table[i + j - 1] + table[i]); 204| 735| } 205| 1.51k| } 206| | 207| | // Advance to next window's base: 2^W * current_base 208| | // The last entry is 2^(W-1) * base, so doubling gives 2^W * base 209| 49| accum = table[i + WindowElements - 1].dbl(); 210| 49| } 211| | 212| | // Variable time batch conversion is fine since generator is public 213| 1| return to_affine_batch(table); 214| 1|} pcurves_secp384r1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EEENSt3__16vectorINT_11AffinePointENS5_9allocatorIS8_EEEERKS8_m: 180| 1|std::vector basemul_booth_setup(const typename C::AffinePoint& p, size_t max_scalar_bits) { 181| 1| static_assert(WindowBits >= 1 && WindowBits <= 8); 182| | 183| | // 2^(W-1) elements per window [1*base .. 2^(W-1)*base] 184| 1| constexpr size_t WindowElements = 1 << (WindowBits - 1); 185| | 186| 1| const size_t Windows = (max_scalar_bits + WindowBits - 1) / WindowBits; 187| | 188| 1| const size_t TableSize = Windows * WindowElements; 189| | 190| 1| std::vector table; 191| 1| table.reserve(TableSize); 192| | 193| 1| auto accum = C::ProjectivePoint::from_affine(p); 194| | 195| 74| for(size_t i = 0; i != TableSize; i += WindowElements) { ------------------ | Branch (195:22): [True: 73, False: 1] ------------------ 196| 73| table.push_back(accum); 197| | 198| 2.33k| for(size_t j = 1; j != WindowElements; ++j) { ------------------ | Branch (198:25): [True: 2.26k, False: 73] ------------------ 199| | // Conditional ok: loop iteration count is public 200| 2.26k| if(j % 2 == 1) { ------------------ | Branch (200:13): [True: 1.16k, False: 1.09k] ------------------ 201| 1.16k| table.emplace_back(table[i + j / 2].dbl()); 202| 1.16k| } else { 203| 1.09k| table.emplace_back(table[i + j - 1] + table[i]); 204| 1.09k| } 205| 2.26k| } 206| | 207| | // Advance to next window's base: 2^W * current_base 208| | // The last entry is 2^(W-1) * base, so doubling gives 2^W * base 209| 73| accum = table[i + WindowElements - 1].dbl(); 210| 73| } 211| | 212| | // Variable time batch conversion is fine since generator is public 213| 1| return to_affine_batch(table); 214| 1|} pcurves_secp384r1.cpp:_ZN5Botan27odd_multiples_setup_vartimeINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm5EEENSt3__16vectorINT_11AffinePointENS5_9allocatorIS8_EEEERKS8_: 562| 376|std::vector odd_multiples_setup_vartime(const typename C::AffinePoint& p) { 563| 376| static_assert(W >= 2 && W <= 7); 564| | 565| 376| constexpr size_t TableSize = 1 << (W - 2); 566| | 567| 376| std::vector table; 568| 376| table.reserve(TableSize); 569| | 570| 376| const auto p2 = C::ProjectivePoint::from_affine(p).dbl(); 571| | 572| 376| table.push_back(C::ProjectivePoint::from_affine(p)); 573| 3.00k| for(size_t i = 1; i != TableSize; ++i) { ------------------ | Branch (573:22): [True: 2.63k, False: 376] ------------------ 574| 2.63k| table.push_back(table[i - 1] + p2); 575| 2.63k| } 576| | 577| | // Variable time batch conversion is fine since the point is public 578| 376| return to_affine_batch(table); 579| 376|} pcurves_secp384r1.cpp:_ZN5Botan26basemul_booth_exec_vartimeINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6ENS_19UnblindedScalarBitsIS4_Lm7EEEEENT_15ProjectivePointENSt3__14spanIKNS7_11AffinePointELm18446744073709551615EEERKT1_S8_: 268| 375| typename C::ProjectivePoint accum) { 269| 375| static constexpr size_t WindowElements = 1 << (WindowBits - 1); 270| | 271| 375| const size_t windows = (scalar.bits() + WindowBits) / WindowBits; 272| 375| BOTAN_DEBUG_ASSERT(windows * WindowElements <= table.size()); ------------------ | | 137| 375| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 375| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 375] | | ------------------ ------------------ 273| | 274| 24.7k| for(size_t i = 0; i != windows; ++i) { ------------------ | Branch (274:22): [True: 24.3k, False: 375] ------------------ 275| | // Extract W+1 bits overlapping by 1 with the previous window; the 276| | // first window has an implicit carry in of zero 277| 24.3k| const size_t raw = 278| 24.3k| (i == 0) ? ((scalar.get_window(0) & ((1 << WindowBits) - 1)) << 1) : scalar.get_window(WindowBits * i - 1); ------------------ | Branch (278:10): [True: 375, False: 24.0k] ------------------ 279| | 280| 24.3k| const auto [tidx, tneg] = booth_recode(raw); 281| | 282| | // Conditional ok: this function is variable time 283| 24.3k| if(tidx > 0) { ------------------ | Branch (283:10): [True: 23.7k, False: 620] ------------------ 284| 23.7k| accum = C::ProjectivePoint::add_or_sub(accum, table[WindowElements * i + tidx - 1], tneg); 285| 23.7k| } 286| 24.3k| } 287| | 288| 375| return accum; 289| 375|} pcurves_secp521r1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EEENSt3__16vectorINT_11AffinePointENS5_9allocatorIS8_EEEERKS8_m: 180| 1|std::vector basemul_booth_setup(const typename C::AffinePoint& p, size_t max_scalar_bits) { 181| 1| static_assert(WindowBits >= 1 && WindowBits <= 8); 182| | 183| | // 2^(W-1) elements per window [1*base .. 2^(W-1)*base] 184| 1| constexpr size_t WindowElements = 1 << (WindowBits - 1); 185| | 186| 1| const size_t Windows = (max_scalar_bits + WindowBits - 1) / WindowBits; 187| | 188| 1| const size_t TableSize = Windows * WindowElements; 189| | 190| 1| std::vector table; 191| 1| table.reserve(TableSize); 192| | 193| 1| auto accum = C::ProjectivePoint::from_affine(p); 194| | 195| 98| for(size_t i = 0; i != TableSize; i += WindowElements) { ------------------ | Branch (195:22): [True: 97, False: 1] ------------------ 196| 97| table.push_back(accum); 197| | 198| 3.10k| for(size_t j = 1; j != WindowElements; ++j) { ------------------ | Branch (198:25): [True: 3.00k, False: 97] ------------------ 199| | // Conditional ok: loop iteration count is public 200| 3.00k| if(j % 2 == 1) { ------------------ | Branch (200:13): [True: 1.55k, False: 1.45k] ------------------ 201| 1.55k| table.emplace_back(table[i + j / 2].dbl()); 202| 1.55k| } else { 203| 1.45k| table.emplace_back(table[i + j - 1] + table[i]); 204| 1.45k| } 205| 3.00k| } 206| | 207| | // Advance to next window's base: 2^W * current_base 208| | // The last entry is 2^(W-1) * base, so doubling gives 2^W * base 209| 97| accum = table[i + WindowElements - 1].dbl(); 210| 97| } 211| | 212| | // Variable time batch conversion is fine since generator is public 213| 1| return to_affine_batch(table); 214| 1|} pcurves_secp521r1.cpp:_ZN5Botan27odd_multiples_setup_vartimeINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm5EEENSt3__16vectorINT_11AffinePointENS5_9allocatorIS8_EEEERKS8_: 562| 286|std::vector odd_multiples_setup_vartime(const typename C::AffinePoint& p) { 563| 286| static_assert(W >= 2 && W <= 7); 564| | 565| 286| constexpr size_t TableSize = 1 << (W - 2); 566| | 567| 286| std::vector table; 568| 286| table.reserve(TableSize); 569| | 570| 286| const auto p2 = C::ProjectivePoint::from_affine(p).dbl(); 571| | 572| 286| table.push_back(C::ProjectivePoint::from_affine(p)); 573| 2.28k| for(size_t i = 1; i != TableSize; ++i) { ------------------ | Branch (573:22): [True: 2.00k, False: 286] ------------------ 574| 2.00k| table.push_back(table[i - 1] + p2); 575| 2.00k| } 576| | 577| | // Variable time batch conversion is fine since the point is public 578| 286| return to_affine_batch(table); 579| 286|} pcurves_secp521r1.cpp:_ZN5Botan26basemul_booth_exec_vartimeINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6ENS_19UnblindedScalarBitsIS4_Lm7EEEEENT_15ProjectivePointENSt3__14spanIKNS7_11AffinePointELm18446744073709551615EEERKT1_S8_: 268| 280| typename C::ProjectivePoint accum) { 269| 280| static constexpr size_t WindowElements = 1 << (WindowBits - 1); 270| | 271| 280| const size_t windows = (scalar.bits() + WindowBits) / WindowBits; 272| 280| BOTAN_DEBUG_ASSERT(windows * WindowElements <= table.size()); ------------------ | | 137| 280| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 280| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 280] | | ------------------ ------------------ 273| | 274| 24.6k| for(size_t i = 0; i != windows; ++i) { ------------------ | Branch (274:22): [True: 24.3k, False: 280] ------------------ 275| | // Extract W+1 bits overlapping by 1 with the previous window; the 276| | // first window has an implicit carry in of zero 277| 24.3k| const size_t raw = 278| 24.3k| (i == 0) ? ((scalar.get_window(0) & ((1 << WindowBits) - 1)) << 1) : scalar.get_window(WindowBits * i - 1); ------------------ | Branch (278:10): [True: 280, False: 24.0k] ------------------ 279| | 280| 24.3k| const auto [tidx, tneg] = booth_recode(raw); 281| | 282| | // Conditional ok: this function is variable time 283| 24.3k| if(tidx > 0) { ------------------ | Branch (283:10): [True: 23.9k, False: 390] ------------------ 284| 23.9k| accum = C::ProjectivePoint::add_or_sub(accum, table[WindowElements * i + tidx - 1], tneg); 285| 23.9k| } 286| 24.3k| } 287| | 288| 280| return accum; 289| 280|} _ZN5Botan10get_uint32ITkNS_8WordTypeEmEEjPKT_m: 33| 58.2M|constexpr uint32_t get_uint32(const W xw[], size_t i) { 34| 58.2M| static_assert(WordInfo::bits == 32 || WordInfo::bits == 64); 35| | 36| | if constexpr(WordInfo::bits == 32) { 37| | return xw[i]; 38| 58.2M| } else { 39| 58.2M| return static_cast(xw[i / 2] >> ((i % 2) * 32)); 40| 58.2M| } 41| 58.2M|} _ZN5Botan12SolinasAccumImLm4EEC2ERNSt3__15arrayImLm4EEE: 50| 1.07M| constexpr explicit SolinasAccum(std::array& r) : m_r(r) {} _ZN5Botan12SolinasAccumImLm4EE5accumEl: 52| 7.52M| constexpr void accum(int64_t v) { 53| 7.52M| BOTAN_DEBUG_ASSERT(m_idx < N32); ------------------ | | 137| 7.52M| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 7.52M| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 7.52M] | | ------------------ ------------------ 54| | 55| 7.52M| m_S += v; 56| 7.52M| const uint32_t r = static_cast(m_S); 57| 7.52M| m_S >>= 32; 58| | 59| | if constexpr(WordInfo::bits == 32) { 60| | m_r[m_idx] = r; 61| 7.52M| } else { 62| 7.52M| m_r[m_idx / 2] |= static_cast(r) << (32 * (m_idx % 2)); 63| 7.52M| } 64| | 65| 7.52M| m_idx += 1; 66| 7.52M| } _ZN5Botan12SolinasAccumImLm4EE11final_carryEl: 68| 1.07M| constexpr W final_carry(int64_t C) { 69| 1.07M| m_S += C; 70| 1.07M| BOTAN_DEBUG_ASSERT(m_S >= 0); ------------------ | | 137| 1.07M| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.07M| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.07M] | | ------------------ ------------------ 71| 1.07M| return static_cast(m_S); 72| 1.07M| } _ZN5Botan20solinas_correct_redcILm4ETkNS_8WordTypeEmEEvRNSt3__15arrayIT0_XT_EEERKS4_S7_: 84| 1.07M|constexpr inline void solinas_correct_redc(std::array& r, const std::array& P, const std::array& C) { 85| 1.07M| W borrow = 0; 86| 5.37M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (86:22): [True: 4.30M, False: 1.07M] ------------------ 87| 4.30M| r[i] = word_sub(r[i], C[i], &borrow); 88| 4.30M| } 89| | 90| | // borrow is either 0 or 1, perfect for setting up a mask without extra work 91| 1.07M| const W mask = CT::value_barrier(0 - borrow); 92| | 93| 1.07M| W carry = 0; 94| | 95| 5.37M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (95:22): [True: 4.30M, False: 1.07M] ------------------ 96| 4.30M| r[i] = word_add(r[i], P[i] & mask, &carry); 97| 4.30M| } 98| 1.07M|} _ZN5Botan12SolinasAccumImLm6EEC2ERNSt3__15arrayImLm6EEE: 50| 1.80M| constexpr explicit SolinasAccum(std::array& r) : m_r(r) {} _ZN5Botan12SolinasAccumImLm6EE5accumEl: 52| 21.6M| constexpr void accum(int64_t v) { 53| 21.6M| BOTAN_DEBUG_ASSERT(m_idx < N32); ------------------ | | 137| 21.6M| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 21.6M| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 21.6M] | | ------------------ ------------------ 54| | 55| 21.6M| m_S += v; 56| 21.6M| const uint32_t r = static_cast(m_S); 57| 21.6M| m_S >>= 32; 58| | 59| | if constexpr(WordInfo::bits == 32) { 60| | m_r[m_idx] = r; 61| 21.6M| } else { 62| 21.6M| m_r[m_idx / 2] |= static_cast(r) << (32 * (m_idx % 2)); 63| 21.6M| } 64| | 65| 21.6M| m_idx += 1; 66| 21.6M| } _ZN5Botan12SolinasAccumImLm6EE11final_carryEl: 68| 1.80M| constexpr W final_carry(int64_t C) { 69| 1.80M| m_S += C; 70| 1.80M| BOTAN_DEBUG_ASSERT(m_S >= 0); ------------------ | | 137| 1.80M| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.80M| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.80M] | | ------------------ ------------------ 71| 1.80M| return static_cast(m_S); 72| 1.80M| } _ZN5Botan20solinas_correct_redcILm6ETkNS_8WordTypeEmEEvRNSt3__15arrayIT0_XT_EEERKS4_S7_: 84| 1.80M|constexpr inline void solinas_correct_redc(std::array& r, const std::array& P, const std::array& C) { 85| 1.80M| W borrow = 0; 86| 12.6M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (86:22): [True: 10.8M, False: 1.80M] ------------------ 87| 10.8M| r[i] = word_sub(r[i], C[i], &borrow); 88| 10.8M| } 89| | 90| | // borrow is either 0 or 1, perfect for setting up a mask without extra work 91| 1.80M| const W mask = CT::value_barrier(0 - borrow); 92| | 93| 1.80M| W carry = 0; 94| | 95| 12.6M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (95:22): [True: 10.8M, False: 1.80M] ------------------ 96| 10.8M| r[i] = word_add(r[i], P[i] & mask, &carry); 97| 10.8M| } 98| 1.80M|} _ZN5Botan10monty_redcITkNS_8WordTypeEmLm6EEENSt3__15arrayIT_XT0_EEERKNS2_IS3_XmlLi2ET0_EEERKS4_S3_: 110| 4.12k| -> std::array { 111| 4.12k| static_assert(N >= 1); 112| | 113| 4.12k| std::array ws; // NOLINT(*-member-init) 114| 4.12k| std::array r; // NOLINT(*-member-init) 115| | 116| | // Conditional ok: the parameter size is public 117| 4.12k| if(!std::is_constant_evaluated()) { ------------------ | Branch (117:7): [True: 4.12k, Folded] ------------------ 118| | // This range ensures we cover fields of 256, 384 and 512 bits for both 32 and 64 bit words 119| | if constexpr(N == 4) { 120| | bigint_monty_redc_4(r.data(), z.data(), p.data(), p_dash, ws.data()); 121| | return r; 122| 4.12k| } else if constexpr(N == 6) { 123| 4.12k| bigint_monty_redc_6(r.data(), z.data(), p.data(), p_dash, ws.data()); 124| 4.12k| return r; 125| | } else if constexpr(N == 8) { 126| | bigint_monty_redc_8(r.data(), z.data(), p.data(), p_dash, ws.data()); 127| | return r; 128| | } else if constexpr(N == 12) { 129| | bigint_monty_redc_12(r.data(), z.data(), p.data(), p_dash, ws.data()); 130| | return r; 131| | } else if constexpr(N == 16) { 132| | bigint_monty_redc_16(r.data(), z.data(), p.data(), p_dash, ws.data()); 133| | return r; 134| | } 135| 4.12k| } 136| | 137| 0| word3 accum; 138| | 139| 4.12k| accum.add(z[0]); 140| | 141| 4.12k| ws[0] = accum.monty_step(p[0], p_dash); 142| | 143| 4.12k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (143:22): [True: 0, False: 4.12k] ------------------ 144| 0| for(size_t j = 0; j < i; ++j) { ------------------ | Branch (144:25): [True: 0, False: 0] ------------------ 145| 0| accum.mul(ws[j], p[i - j]); 146| 0| } 147| | 148| 0| accum.add(z[i]); 149| | 150| 0| ws[i] = accum.monty_step(p[0], p_dash); 151| 0| } 152| | 153| 4.12k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (153:22): [True: 0, False: 4.12k] ------------------ 154| 0| for(size_t j = i + 1; j != N; ++j) { ------------------ | Branch (154:29): [True: 0, False: 0] ------------------ 155| 0| accum.mul(ws[j], p[N + i - j]); 156| 0| } 157| | 158| 0| accum.add(z[N + i]); 159| | 160| 0| ws[i] = accum.extract(); 161| 0| } 162| | 163| 4.12k| accum.add(z[2 * N - 1]); 164| | 165| 4.12k| ws[N - 1] = accum.extract(); 166| | // w1 is the final part, which is not stored in the workspace 167| 4.12k| const W w1 = accum.extract(); 168| | 169| 4.12k| bigint_monty_maybe_sub(r.data(), w1, ws.data(), p.data()); 170| | 171| 4.12k| return r; 172| 4.12k|} _ZN5Botan10monty_redcITkNS_8WordTypeEmLm9EEENSt3__15arrayIT_XT0_EEERKNS2_IS3_XmlLi2ET0_EEERKS4_S3_: 110| 3.08k| -> std::array { 111| 3.08k| static_assert(N >= 1); 112| | 113| 3.08k| std::array ws; // NOLINT(*-member-init) 114| 3.08k| std::array r; // NOLINT(*-member-init) 115| | 116| | // Conditional ok: the parameter size is public 117| 3.08k| if(!std::is_constant_evaluated()) { ------------------ | Branch (117:7): [True: 3.08k, Folded] ------------------ 118| | // This range ensures we cover fields of 256, 384 and 512 bits for both 32 and 64 bit words 119| | if constexpr(N == 4) { 120| | bigint_monty_redc_4(r.data(), z.data(), p.data(), p_dash, ws.data()); 121| | return r; 122| | } else if constexpr(N == 6) { 123| | bigint_monty_redc_6(r.data(), z.data(), p.data(), p_dash, ws.data()); 124| | return r; 125| | } else if constexpr(N == 8) { 126| | bigint_monty_redc_8(r.data(), z.data(), p.data(), p_dash, ws.data()); 127| | return r; 128| | } else if constexpr(N == 12) { 129| | bigint_monty_redc_12(r.data(), z.data(), p.data(), p_dash, ws.data()); 130| | return r; 131| 3.08k| } else if constexpr(N == 16) { 132| 3.08k| bigint_monty_redc_16(r.data(), z.data(), p.data(), p_dash, ws.data()); 133| 3.08k| return r; 134| 3.08k| } 135| 3.08k| } 136| | 137| 3.08k| word3 accum; 138| | 139| 3.08k| accum.add(z[0]); 140| | 141| 3.08k| ws[0] = accum.monty_step(p[0], p_dash); 142| | 143| 27.7k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (143:22): [True: 24.6k, False: 3.08k] ------------------ 144| 135k| for(size_t j = 0; j < i; ++j) { ------------------ | Branch (144:25): [True: 110k, False: 24.6k] ------------------ 145| 110k| accum.mul(ws[j], p[i - j]); 146| 110k| } 147| | 148| 24.6k| accum.add(z[i]); 149| | 150| 24.6k| ws[i] = accum.monty_step(p[0], p_dash); 151| 24.6k| } 152| | 153| 27.7k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (153:22): [True: 24.6k, False: 3.08k] ------------------ 154| 135k| for(size_t j = i + 1; j != N; ++j) { ------------------ | Branch (154:29): [True: 110k, False: 24.6k] ------------------ 155| 110k| accum.mul(ws[j], p[N + i - j]); 156| 110k| } 157| | 158| 24.6k| accum.add(z[N + i]); 159| | 160| 24.6k| ws[i] = accum.extract(); 161| 24.6k| } 162| | 163| 3.08k| accum.add(z[2 * N - 1]); 164| | 165| 3.08k| ws[N - 1] = accum.extract(); 166| | // w1 is the final part, which is not stored in the workspace 167| 3.08k| const W w1 = accum.extract(); 168| | 169| 3.08k| bigint_monty_maybe_sub(r.data(), w1, ws.data(), p.data()); 170| | 171| 3.08k| return r; 172| 3.08k|} pcurves_secp224r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp224r15CurveEE8instanceEv: 341| 406| static std::shared_ptr instance() { 342| 406| static const auto g_curve = std::make_shared>(); 343| 406| return g_curve; 344| 406| } pcurves_secp224r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp224r15CurveEEC2Ev: 339| 1| PrimeOrderCurveImpl() : m_mul_by_g(C::G) {} pcurves_secp224r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp224r15CurveEE19field_element_bytesEv: 36| 270| size_t field_element_bytes() const override { return C::FieldElement::BYTES; } pcurves_secp224r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp224r15CurveEE10from_stashERKNS0_15PrimeOrderCurve11AffinePointE: 364| 270| static typename C::AffinePoint from_stash(const AffinePoint& pt) { 365| 270| if(pt._curve() != instance()) { ------------------ | Branch (365:13): [True: 0, False: 270] ------------------ 366| 0| throw Invalid_Argument("Curve mismatch"); 367| 0| } 368| 270| const auto x = C::FieldElement::from_stash(pt._x()); 369| 270| const auto y = C::FieldElement::from_stash(pt._y()); 370| 270| return typename C::AffinePoint(x, y); 371| 270| } pcurves_secp224r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp224r15CurveEE5stashERKNS_16AffineCurvePointINS_6IntModINS3_12Secp224r1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 358| 135| static AffinePoint stash(const typename C::AffinePoint& pt) { 359| 135| const auto x_w = pt.x().template stash_value(); 360| 135| const auto y_w = pt.y().template stash_value(); 361| 135| return AffinePoint::_create(instance(), x_w, y_w); 362| 135| } pcurves_secp224r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp224r15CurveEE28deserialize_point_compressedENSt3__14spanIKhLm18446744073709551615EEE: 264| 210| std::optional deserialize_point_compressed(std::span bytes) const override { 265| 210| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 266| 210| constexpr size_t CompressedBytes = C::FieldElement::BYTES + 1; 267| | 268| 210| if(bytes.size() == CompressedBytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) { ------------------ | Branch (268:13): [True: 210, False: 0] | Branch (268:49): [True: 2, False: 208] | Branch (268:69): [True: 208, False: 0] ------------------ 269| 210| const CT::Choice y_is_even = CT::Mask::is_equal(bytes[0], 0x02).as_choice(); 270| | 271| 210| if(auto x = C::FieldElement::deserialize(bytes.subspan(1, FieldElementBytes))) { ------------------ | Branch (271:21): [True: 209, False: 1] ------------------ 272| 209| if(auto y = sqrt_field_element(C::x3_ax_b(*x)).as_optional_vartime()) { ------------------ | Branch (272:24): [True: 135, False: 74] ------------------ 273| 135| return stash(typename C::AffinePoint(*x, y->correct_sign(y_is_even))); 274| 135| } 275| 209| } 276| 210| } 277| | 278| 75| return {}; 279| 210| } pcurves_secp224r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp224r15CurveEE24affine_point_is_identityERKNS0_15PrimeOrderCurve11AffinePointE: 207| 135| bool affine_point_is_identity(const AffinePoint& pt) const override { 208| 135| return from_stash(pt).is_identity().as_bool(); 209| 135| } pcurves_secp224r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp224r15CurveEE15serialize_pointENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve11AffinePointE: 211| 135| void serialize_point(std::span bytes, const AffinePoint& pt) const override { 212| 135| BOTAN_ARG_CHECK(bytes.size() == C::AffinePoint::BYTES, "Invalid length for serialize_point"); ------------------ | | 35| 135| do { \ | | 36| 135| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 135| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 135] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 135| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 135] | | ------------------ ------------------ 213| 135| from_stash(pt).serialize_to(bytes.subspan<0, C::AffinePoint::BYTES>()); 214| 135| } pcurves_secp256k1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256k15CurveEE8instanceEv: 341| 1| static std::shared_ptr instance() { 342| 1| static const auto g_curve = std::make_shared>(); 343| 1| return g_curve; 344| 1| } pcurves_secp256k1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256k15CurveEEC2Ev: 339| 1| PrimeOrderCurveImpl() : m_mul_by_g(C::G) {} pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE8instanceEv: 341| 7.50k| static std::shared_ptr instance() { 342| 7.50k| static const auto g_curve = std::make_shared>(); 343| 7.50k| return g_curve; 344| 7.50k| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEEC2Ev: 339| 1| PrimeOrderCurveImpl() : m_mul_by_g(C::G) {} pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE19field_element_bytesEv: 36| 752| size_t field_element_bytes() const override { return C::FieldElement::BYTES; } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE10from_stashERKNS0_15PrimeOrderCurve6ScalarE: 351| 3.75k| static typename C::Scalar from_stash(const Scalar& s) { 352| 3.75k| if(s._curve() != instance()) { ------------------ | Branch (352:13): [True: 0, False: 3.75k] ------------------ 353| 0| throw Invalid_Argument("Curve mismatch"); 354| 0| } 355| 3.75k| return C::Scalar::from_stash(s._value()); 356| 3.75k| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE5stashERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_12Secp384r1RepEE12ScalarParamsEEEEE: 347| 2.25k| static Scalar stash(const typename C::Scalar& s) { 348| 2.25k| return Scalar::_create(instance(), s.template stash_value()); 349| 2.25k| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE10from_stashERKNS0_15PrimeOrderCurve11AffinePointE: 364| 1.12k| static typename C::AffinePoint from_stash(const AffinePoint& pt) { 365| 1.12k| if(pt._curve() != instance()) { ------------------ | Branch (365:13): [True: 0, False: 1.12k] ------------------ 366| 0| throw Invalid_Argument("Curve mismatch"); 367| 0| } 368| 1.12k| const auto x = C::FieldElement::from_stash(pt._x()); 369| 1.12k| const auto y = C::FieldElement::from_stash(pt._y()); 370| 1.12k| return typename C::AffinePoint(x, y); 371| 1.12k| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE12mul2_setup_gERKNS0_15PrimeOrderCurve11AffinePointE: 67| 376| std::unique_ptr mul2_setup_g(const AffinePoint& q) const override { 68| 376| return std::make_unique(from_stash(q)); 69| 376| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE21PrecomputedMul2TableCC2ERKNS_16AffineCurvePointINS_6IntModINS2_12Secp384r1RepINS_13EllipticCurveINS3_6ParamsES9_E11FieldParamsEEEEEEE: 61| 376| explicit PrecomputedMul2TableC(const typename C::AffinePoint& q) : m_table(q) {} pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE21PrecomputedMul2TableC5tableEv: 59| 375| const auto& table() const { return m_table; } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE27mul2_vartime_x_mod_order_eqERKNS0_15PrimeOrderCurve20PrecomputedMul2TableERKNS6_6ScalarESC_SC_: 104| 375| const Scalar& y) const override { 105| 375| try { 106| 375| const auto& table = dynamic_cast(tableb); 107| 375| const auto pt = table.table().mul2_vartime(m_mul_by_g, from_stash(x), from_stash(y)); 108| | // Variable time here, so the early return is fine 109| 375| if(pt.is_identity().as_bool()) { ------------------ | Branch (109:16): [True: 0, False: 375] ------------------ 110| 0| return false; 111| 0| } 112| | 113| | /* 114| | * Avoid the inversion by instead projecting v. 115| | * 116| | * Given (x*z2) and v we want to know if x % n == v 117| | * 118| | * Inverting z2 to extract x is expensive. Instead compute (v*z2) and 119| | * compare it with (x*z2). 120| | * 121| | * With overwhelming probability, this conversion is correct. The 122| | * only time it is not is in the extremely unlikely case where the 123| | * signer actually reduced the x coordinate modulo the group order. 124| | * That is handled separately in a second step. 125| | */ 126| 375| const auto z2 = pt.z().square(); 127| | 128| 375| std::array v_bytes{}; 129| 375| from_stash(v).serialize_to(v_bytes); 130| | 131| 375| if(const auto fe_v = C::FieldElement::deserialize(v_bytes)) { ------------------ | Branch (131:27): [True: 375, False: 0] ------------------ 132| 375| if((*fe_v * z2 == pt.x()).as_bool()) { ------------------ | Branch (132:19): [True: 0, False: 375] ------------------ 133| 0| return true; 134| 0| } 135| | 136| | /* 137| | * Possibly (if cryptographically unlikely) the signer 138| | * reduced the value modulo the group order. 139| | * 140| | * If so we must check v + n similarly as before. However here 141| | * we must be careful to not overflow since otherwise that 142| | * would lead to us accepting an incorrect signature. 143| | * 144| | * If the order is > p then the reduction modulo p would not have 145| | * had any effect and we don't need to consider the possibility 146| | */ 147| 375| if constexpr(C::OrderIsLessThanField) { 148| | /* 149| | * We have to be careful to avoid overflow since this would 150| | * lead to a forgery 151| | * 152| | * v < (p)-n => v + n < p 153| | * 154| | * The values n and neg_n could be precomputed but they are 155| | * fast to compute and this codepath will ~never be taken 156| | * unless when verifying an invalid signature. In any case 157| | * it is many times cheaper than performing the modular inversion 158| | * which this approach avoids. 159| | */ 160| | 161| | // Create the group order as a field element, safe because n < p 162| 375| const auto n = C::FieldElement::from_words(C::NW); 163| 375| const auto neg_n = n.negate().to_words(); 164| | 165| 375| const auto vw = fe_v->to_words(); 166| 375| if(bigint_ct_is_lt(vw.data(), vw.size(), neg_n.data(), neg_n.size()).as_bool()) { ------------------ | Branch (166:22): [True: 0, False: 375] ------------------ 167| 0| return (((*fe_v + n) * z2) == pt.x()).as_bool(); 168| 0| } 169| 375| } 170| 375| } 171| | 172| 375| return false; 173| 375| } catch(std::bad_cast&) { 174| 0| throw Invalid_Argument("Curve mismatch"); 175| 0| } 176| 375| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE5stashERKNS_16AffineCurvePointINS_6IntModINS2_12Secp384r1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 358| 376| static AffinePoint stash(const typename C::AffinePoint& pt) { 359| 376| const auto x_w = pt.x().template stash_value(); 360| 376| const auto y_w = pt.y().template stash_value(); 361| 376| return AffinePoint::_create(instance(), x_w, y_w); 362| 376| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE30deserialize_point_uncompressedENSt3__14spanIKhLm18446744073709551615EEE: 241| 433| std::optional deserialize_point_uncompressed(std::span bytes) const override { 242| 433| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 243| 433| constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1; 244| | 245| 433| if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) { ------------------ | Branch (245:13): [True: 433, False: 0] | Branch (245:50): [True: 433, False: 0] ------------------ 246| 433| const auto encoded_point = bytes.subspan(1); 247| 433| auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes)); 248| 433| auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes)); 249| | 250| 433| if(x && y) { ------------------ | Branch (250:16): [True: 433, False: 0] | Branch (250:21): [True: 432, False: 1] ------------------ 251| | // Check that y^2 = x^3 + ax + b 252| 432| const auto lhs = (*y).square(); 253| 432| const auto rhs = C::x3_ax_b(*x); 254| 432| const auto valid = (lhs == rhs); 255| 432| if(valid.as_bool()) { ------------------ | Branch (255:19): [True: 376, False: 56] ------------------ 256| 376| return stash(typename C::AffinePoint(*x, *y)); 257| 376| } 258| 432| } 259| 433| } 260| | 261| 57| return {}; 262| 433| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE18deserialize_scalarENSt3__14spanIKhLm18446744073709551615EEE: 221| 750| std::optional deserialize_scalar(std::span bytes) const override { 222| 750| if(auto scalar = C::Scalar::deserialize(bytes)) { ------------------ | Branch (222:18): [True: 750, False: 0] ------------------ 223| 750| if(!scalar->is_zero().as_bool()) { ------------------ | Branch (223:16): [True: 750, False: 0] ------------------ 224| 750| return stash(*scalar); 225| 750| } 226| 750| } 227| | 228| 0| return {}; 229| 750| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE22scalar_from_wide_bytesENSt3__14spanIKhLm18446744073709551615EEE: 231| 375| std::optional scalar_from_wide_bytes(std::span bytes) const override { 232| 375| if(auto s = C::Scalar::from_wide_bytes_varlen(bytes)) { ------------------ | Branch (232:18): [True: 375, False: 0] ------------------ 233| 375| return stash(*s); 234| 375| } else { 235| 0| return {}; 236| 0| } 237| 375| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE24affine_point_is_identityERKNS0_15PrimeOrderCurve11AffinePointE: 207| 376| bool affine_point_is_identity(const AffinePoint& pt) const override { 208| 376| return from_stash(pt).is_identity().as_bool(); 209| 376| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE15serialize_pointENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve11AffinePointE: 211| 376| void serialize_point(std::span bytes, const AffinePoint& pt) const override { 212| 376| BOTAN_ARG_CHECK(bytes.size() == C::AffinePoint::BYTES, "Invalid length for serialize_point"); ------------------ | | 35| 376| do { \ | | 36| 376| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 376| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 376] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 376| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 376] | | ------------------ ------------------ 213| 376| from_stash(pt).serialize_to(bytes.subspan<0, C::AffinePoint::BYTES>()); 214| 376| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE10scalar_mulERKNS0_15PrimeOrderCurve6ScalarES9_: 307| 750| Scalar scalar_mul(const Scalar& a, const Scalar& b) const override { 308| 750| return stash(from_stash(a) * from_stash(b)); 309| 750| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE21scalar_invert_vartimeERKNS0_15PrimeOrderCurve6ScalarE: 322| 375| Scalar scalar_invert_vartime(const Scalar& ss) const override { 323| 375| const auto s = from_stash(ss); 324| 375| return stash(s.invert_vartime()); 325| 375| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE14scalar_is_zeroERKNS0_15PrimeOrderCurve6ScalarE: 329| 750| bool scalar_is_zero(const Scalar& s) const override { return from_stash(s).is_zero().as_bool(); } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE8instanceEv: 341| 5.62k| static std::shared_ptr instance() { 342| 5.62k| static const auto g_curve = std::make_shared>(); 343| 5.62k| return g_curve; 344| 5.62k| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEEC2Ev: 339| 1| PrimeOrderCurveImpl() : m_mul_by_g(C::G) {} pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE19field_element_bytesEv: 36| 572| size_t field_element_bytes() const override { return C::FieldElement::BYTES; } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE10from_stashERKNS0_15PrimeOrderCurve6ScalarE: 351| 2.80k| static typename C::Scalar from_stash(const Scalar& s) { 352| 2.80k| if(s._curve() != instance()) { ------------------ | Branch (352:13): [True: 0, False: 2.80k] ------------------ 353| 0| throw Invalid_Argument("Curve mismatch"); 354| 0| } 355| 2.80k| return C::Scalar::from_stash(s._value()); 356| 2.80k| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE5stashERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_7P521RepEE12ScalarParamsEEEEE: 347| 1.68k| static Scalar stash(const typename C::Scalar& s) { 348| 1.68k| return Scalar::_create(instance(), s.template stash_value()); 349| 1.68k| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE10from_stashERKNS0_15PrimeOrderCurve11AffinePointE: 364| 858| static typename C::AffinePoint from_stash(const AffinePoint& pt) { 365| 858| if(pt._curve() != instance()) { ------------------ | Branch (365:13): [True: 0, False: 858] ------------------ 366| 0| throw Invalid_Argument("Curve mismatch"); 367| 0| } 368| 858| const auto x = C::FieldElement::from_stash(pt._x()); 369| 858| const auto y = C::FieldElement::from_stash(pt._y()); 370| 858| return typename C::AffinePoint(x, y); 371| 858| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE12mul2_setup_gERKNS0_15PrimeOrderCurve11AffinePointE: 67| 286| std::unique_ptr mul2_setup_g(const AffinePoint& q) const override { 68| 286| return std::make_unique(from_stash(q)); 69| 286| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE21PrecomputedMul2TableCC2ERKNS_16AffineCurvePointINS_6IntModINS3_7P521RepINS_13EllipticCurveINS3_6ParamsES9_E11FieldParamsEEEEEEE: 61| 286| explicit PrecomputedMul2TableC(const typename C::AffinePoint& q) : m_table(q) {} pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE21PrecomputedMul2TableC5tableEv: 59| 280| const auto& table() const { return m_table; } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE27mul2_vartime_x_mod_order_eqERKNS0_15PrimeOrderCurve20PrecomputedMul2TableERKNS6_6ScalarESC_SC_: 104| 280| const Scalar& y) const override { 105| 280| try { 106| 280| const auto& table = dynamic_cast(tableb); 107| 280| const auto pt = table.table().mul2_vartime(m_mul_by_g, from_stash(x), from_stash(y)); 108| | // Variable time here, so the early return is fine 109| 280| if(pt.is_identity().as_bool()) { ------------------ | Branch (109:16): [True: 0, False: 280] ------------------ 110| 0| return false; 111| 0| } 112| | 113| | /* 114| | * Avoid the inversion by instead projecting v. 115| | * 116| | * Given (x*z2) and v we want to know if x % n == v 117| | * 118| | * Inverting z2 to extract x is expensive. Instead compute (v*z2) and 119| | * compare it with (x*z2). 120| | * 121| | * With overwhelming probability, this conversion is correct. The 122| | * only time it is not is in the extremely unlikely case where the 123| | * signer actually reduced the x coordinate modulo the group order. 124| | * That is handled separately in a second step. 125| | */ 126| 280| const auto z2 = pt.z().square(); 127| | 128| 280| std::array v_bytes{}; 129| 280| from_stash(v).serialize_to(v_bytes); 130| | 131| 280| if(const auto fe_v = C::FieldElement::deserialize(v_bytes)) { ------------------ | Branch (131:27): [True: 280, False: 0] ------------------ 132| 280| if((*fe_v * z2 == pt.x()).as_bool()) { ------------------ | Branch (132:19): [True: 0, False: 280] ------------------ 133| 0| return true; 134| 0| } 135| | 136| | /* 137| | * Possibly (if cryptographically unlikely) the signer 138| | * reduced the value modulo the group order. 139| | * 140| | * If so we must check v + n similarly as before. However here 141| | * we must be careful to not overflow since otherwise that 142| | * would lead to us accepting an incorrect signature. 143| | * 144| | * If the order is > p then the reduction modulo p would not have 145| | * had any effect and we don't need to consider the possibility 146| | */ 147| 280| if constexpr(C::OrderIsLessThanField) { 148| | /* 149| | * We have to be careful to avoid overflow since this would 150| | * lead to a forgery 151| | * 152| | * v < (p)-n => v + n < p 153| | * 154| | * The values n and neg_n could be precomputed but they are 155| | * fast to compute and this codepath will ~never be taken 156| | * unless when verifying an invalid signature. In any case 157| | * it is many times cheaper than performing the modular inversion 158| | * which this approach avoids. 159| | */ 160| | 161| | // Create the group order as a field element, safe because n < p 162| 280| const auto n = C::FieldElement::from_words(C::NW); 163| 280| const auto neg_n = n.negate().to_words(); 164| | 165| 280| const auto vw = fe_v->to_words(); 166| 280| if(bigint_ct_is_lt(vw.data(), vw.size(), neg_n.data(), neg_n.size()).as_bool()) { ------------------ | Branch (166:22): [True: 0, False: 280] ------------------ 167| 0| return (((*fe_v + n) * z2) == pt.x()).as_bool(); 168| 0| } 169| 280| } 170| 280| } 171| | 172| 280| return false; 173| 280| } catch(std::bad_cast&) { 174| 0| throw Invalid_Argument("Curve mismatch"); 175| 0| } 176| 280| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE5stashERKNS_16AffineCurvePointINS_6IntModINS3_7P521RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 358| 286| static AffinePoint stash(const typename C::AffinePoint& pt) { 359| 286| const auto x_w = pt.x().template stash_value(); 360| 286| const auto y_w = pt.y().template stash_value(); 361| 286| return AffinePoint::_create(instance(), x_w, y_w); 362| 286| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE30deserialize_point_uncompressedENSt3__14spanIKhLm18446744073709551615EEE: 241| 369| std::optional deserialize_point_uncompressed(std::span bytes) const override { 242| 369| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 243| 369| constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1; 244| | 245| 369| if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) { ------------------ | Branch (245:13): [True: 369, False: 0] | Branch (245:50): [True: 369, False: 0] ------------------ 246| 369| const auto encoded_point = bytes.subspan(1); 247| 369| auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes)); 248| 369| auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes)); 249| | 250| 369| if(x && y) { ------------------ | Branch (250:16): [True: 367, False: 2] | Branch (250:21): [True: 364, False: 3] ------------------ 251| | // Check that y^2 = x^3 + ax + b 252| 364| const auto lhs = (*y).square(); 253| 364| const auto rhs = C::x3_ax_b(*x); 254| 364| const auto valid = (lhs == rhs); 255| 364| if(valid.as_bool()) { ------------------ | Branch (255:19): [True: 286, False: 78] ------------------ 256| 286| return stash(typename C::AffinePoint(*x, *y)); 257| 286| } 258| 364| } 259| 369| } 260| | 261| 83| return {}; 262| 369| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE18deserialize_scalarENSt3__14spanIKhLm18446744073709551615EEE: 221| 564| std::optional deserialize_scalar(std::span bytes) const override { 222| 564| if(auto scalar = C::Scalar::deserialize(bytes)) { ------------------ | Branch (222:18): [True: 561, False: 3] ------------------ 223| 561| if(!scalar->is_zero().as_bool()) { ------------------ | Branch (223:16): [True: 561, False: 0] ------------------ 224| 561| return stash(*scalar); 225| 561| } 226| 561| } 227| | 228| 3| return {}; 229| 564| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE22scalar_from_wide_bytesENSt3__14spanIKhLm18446744073709551615EEE: 231| 280| std::optional scalar_from_wide_bytes(std::span bytes) const override { 232| 280| if(auto s = C::Scalar::from_wide_bytes_varlen(bytes)) { ------------------ | Branch (232:18): [True: 280, False: 0] ------------------ 233| 280| return stash(*s); 234| 280| } else { 235| 0| return {}; 236| 0| } 237| 280| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE24affine_point_is_identityERKNS0_15PrimeOrderCurve11AffinePointE: 207| 286| bool affine_point_is_identity(const AffinePoint& pt) const override { 208| 286| return from_stash(pt).is_identity().as_bool(); 209| 286| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE15serialize_pointENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve11AffinePointE: 211| 286| void serialize_point(std::span bytes, const AffinePoint& pt) const override { 212| 286| BOTAN_ARG_CHECK(bytes.size() == C::AffinePoint::BYTES, "Invalid length for serialize_point"); ------------------ | | 35| 286| do { \ | | 36| 286| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 286| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 286] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 286| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 286] | | ------------------ ------------------ 213| 286| from_stash(pt).serialize_to(bytes.subspan<0, C::AffinePoint::BYTES>()); 214| 286| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE10scalar_mulERKNS0_15PrimeOrderCurve6ScalarES9_: 307| 560| Scalar scalar_mul(const Scalar& a, const Scalar& b) const override { 308| 560| return stash(from_stash(a) * from_stash(b)); 309| 560| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE21scalar_invert_vartimeERKNS0_15PrimeOrderCurve6ScalarE: 322| 280| Scalar scalar_invert_vartime(const Scalar& ss) const override { 323| 280| const auto s = from_stash(ss); 324| 280| return stash(s.invert_vartime()); 325| 280| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE14scalar_is_zeroERKNS0_15PrimeOrderCurve6ScalarE: 329| 560| bool scalar_is_zero(const Scalar& s) const override { return from_stash(s).is_zero().as_bool(); } _ZN5Botan24PK_Options_Reader_Access16for_verificationERKNS_20PK_Signature_OptionsE: 38| 504| static PK_Signature_Options_Reader for_verification(const PK_Signature_Options& options) { 39| 504| return PK_Signature_Options_Reader(options, PK_Signature_Options_Reader::Usage::Verification); 40| 504| } _ZN5Botan6bitlenEm: 101| 18|constexpr auto bitlen(size_t x) { 102| 18| return ceil_log2(x + 1); 103| 18|} _ZN5Botan3rhoILm14ELm18ELm41ETkNSt3__117unsigned_integralEmEET2_S2_: 53| 130k|BOTAN_FORCE_INLINE constexpr T rho(T x) { 54| 130k| return rotr(x) ^ rotr(x) ^ rotr(x); 55| 130k|} _ZN5Botan4rotrILm14ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 130k|{ 38| 130k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 130k|} _ZN5Botan4rotrILm18ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 130k|{ 38| 130k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 130k|} _ZN5Botan4rotrILm41ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 130k|{ 38| 130k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 130k|} _ZN5Botan3rhoILm28ELm34ELm39ETkNSt3__117unsigned_integralEmEET2_S2_: 53| 130k|BOTAN_FORCE_INLINE constexpr T rho(T x) { 54| 130k| return rotr(x) ^ rotr(x) ^ rotr(x); 55| 130k|} _ZN5Botan4rotrILm28ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 130k|{ 38| 130k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 130k|} _ZN5Botan4rotrILm34ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 130k|{ 38| 130k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 130k|} _ZN5Botan4rotrILm39ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 130k|{ 38| 130k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 130k|} _ZNK5Botan5SHA_14nameEv: 32| 14| std::string name() const override { return "SHA-1"; } _ZNK5Botan5SHA_113output_lengthEv: 34| 66.7k| size_t output_length() const override { return 20; } _ZNK5Botan7SHA_2244nameEv: 33| 87| std::string name() const override { return "SHA-224"; } _ZNK5Botan7SHA_22413output_lengthEv: 35| 88| size_t output_length() const override { return output_bytes; } _ZNK5Botan7SHA_2564nameEv: 73| 113| std::string name() const override { return "SHA-256"; } _ZNK5Botan7SHA_25613output_lengthEv: 75| 57.6k| size_t output_length() const override { return output_bytes; } _ZNK5Botan7SHA_38413output_lengthEv: 34| 376| size_t output_length() const override { return output_bytes; } _ZNK5Botan7SHA_5124nameEv: 72| 33| std::string name() const override { return "SHA-512"; } _ZNK5Botan7SHA_51213output_lengthEv: 74| 98| size_t output_length() const override { return output_bytes; } _ZN5Botan9SHA2_64_FEmmmRmmmmS0_m: 64| 130k| uint64_t A, uint64_t B, uint64_t C, uint64_t& D, uint64_t E, uint64_t F, uint64_t G, uint64_t& H, uint64_t M) { 65| 130k| H += rho<14, 18, 41>(E) + choose(E, F, G) + M; 66| 130k| D += H; 67| 130k| H += rho<28, 34, 39>(A) + majority(A, B, C); 68| 130k|} _ZN5Botan22SignaturePaddingSchemeD2Ev: 28| 238| virtual ~SignaturePaddingScheme() = default; _ZN5Botan9SIMD_2x64C2Ev: 61| 6.88k| m_simd(_mm_setzero_si128()) 62| |#elif defined(BOTAN_SIMD_USE_NEON) 63| | m_simd(vdupq_n_u64(0)) 64| |#elif defined(BOTAN_SIMD_USE_SIMD128) 65| | m_simd(wasm_u64x2_const_splat(0)) 66| |#elif defined(BOTAN_SIMD_USE_VSX) 67| | m_simd(vec_splats(static_cast(0))) 68| |#endif 69| 6.88k| { 70| 6.88k| } _ZN5Botan9SIMD_2x647load_beEPKv: 132| 6.88k| static SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 load_be(const void* in) { 133| | if constexpr(std::endian::native == std::endian::big) { 134| | return SIMD_2x64::load_native(in); 135| 6.88k| } else { 136| 6.88k| return SIMD_2x64::load_native(in).bswap(); 137| 6.88k| } 138| 6.88k| } _ZN5Botan9SIMD_2x6411load_nativeEPKv: 112| 41.2k| static SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 load_native(const void* in) { 113| 41.2k|#if defined(BOTAN_SIMD_USE_SSSE3) 114| 41.2k| return SIMD_2x64(_mm_loadu_si128(reinterpret_cast(in))); 115| |#elif defined(BOTAN_SIMD_USE_NEON) 116| | return SIMD_2x64(vld1q_u64(static_cast(in))); 117| |#elif defined(BOTAN_SIMD_USE_SIMD128) 118| | return SIMD_2x64(wasm_v128_load(in)); 119| |#elif defined(BOTAN_SIMD_USE_VSX) 120| | return SIMD_2x64(reinterpret_cast(vec_xl(0, static_cast(in)))); 121| |#endif 122| 41.2k| } _ZN5Botan9SIMD_2x64C2EDv2_x: 507| 268k| explicit BOTAN_FN_ISA_SIMD_2X64 SIMD_2x64(native_simd_type x) : m_simd(x) {} _ZNK5Botan9SIMD_2x645bswapEv: 148| 6.88k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 bswap() const { 149| 6.88k|#if defined(BOTAN_SIMD_USE_SSSE3) 150| 6.88k| const auto idx = _mm_set_epi8(8, 9, 10, 11, 12, 13, 14, 15, 0, 1, 2, 3, 4, 5, 6, 7); 151| 6.88k| return SIMD_2x64(_mm_shuffle_epi8(m_simd, idx)); 152| |#elif defined(BOTAN_SIMD_USE_NEON) 153| | return SIMD_2x64(vreinterpretq_u64_u8(vrev64q_u8(vreinterpretq_u8_u64(m_simd)))); 154| |#elif defined(BOTAN_SIMD_USE_SIMD128) 155| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 7, 6, 5, 4, 3, 2, 1, 0, 15, 14, 13, 12, 11, 10, 9, 8)); 156| |#elif defined(BOTAN_SIMD_USE_VSX) 157| | return SIMD_2x64(vec_revb(m_simd)); 158| |#endif 159| 6.88k| } _ZNK5Botan9SIMD_2x64plERKS0_: 224| 116k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 operator+(const SIMD_2x64& other) const { 225| 116k| SIMD_2x64 retval(*this); 226| 116k| retval += other; 227| 116k| return retval; 228| 116k| } _ZN5Botan9SIMD_2x64pLERKS0_: 254| 116k| void BOTAN_FN_ISA_SIMD_2X64 operator+=(const SIMD_2x64& other) { 255| 116k|#if defined(BOTAN_SIMD_USE_SSSE3) 256| 116k| m_simd = _mm_add_epi64(m_simd, other.m_simd); 257| |#elif defined(BOTAN_SIMD_USE_NEON) 258| | m_simd = vaddq_u64(m_simd, other.m_simd); 259| |#elif defined(BOTAN_SIMD_USE_SIMD128) 260| | m_simd = wasm_i64x2_add(m_simd, other.m_simd); 261| |#elif defined(BOTAN_SIMD_USE_VSX) 262| | m_simd = vec_add(m_simd, other.m_simd); 263| |#endif 264| 116k| } _ZN5Botan9SIMD_2x647load_leEPKv: 124| 34.4k| static SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 load_le(const void* in) { 125| 34.4k| if constexpr(std::endian::native == std::endian::little) { 126| 34.4k| return SIMD_2x64::load_native(in); 127| | } else { 128| | return SIMD_2x64::load_native(in).bswap(); 129| | } 130| 34.4k| } _ZNK5Botan9SIMD_2x648store_leEPm: 200| 34.4k| void BOTAN_FN_ISA_SIMD_2X64 store_le(uint64_t out[2]) const { this->store_le(reinterpret_cast(out)); } _ZNK5Botan9SIMD_2x648store_leEPh: 202| 34.4k| void BOTAN_FN_ISA_SIMD_2X64 store_le(uint8_t out[]) const { 203| 34.4k| if constexpr(std::endian::native == std::endian::little) { 204| 34.4k| this->store_native(out); 205| | } else { 206| | this->bswap().store_native(out); 207| | } 208| 34.4k| } _ZNK5Botan9SIMD_2x6412store_nativeEPv: 188| 34.4k| void BOTAN_FN_ISA_SIMD_2X64 store_native(void* out) const { 189| 34.4k|#if defined(BOTAN_SIMD_USE_SSSE3) 190| 34.4k| _mm_storeu_si128(static_cast<__m128i*>(out), m_simd); 191| |#elif defined(BOTAN_SIMD_USE_NEON) 192| | vst1q_u64(static_cast(out), m_simd); 193| |#elif defined(BOTAN_SIMD_USE_SIMD128) 194| | wasm_v128_store(out, m_simd); 195| |#elif defined(BOTAN_SIMD_USE_VSX) 196| | vec_xst(reinterpret_cast<__vector unsigned char>(m_simd), 0, static_cast(out)); 197| |#endif 198| 34.4k| } _ZN5Botan9SIMD_2x647alignr8ERKS0_S2_: 401| 55.0k| static SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 alignr8(const SIMD_2x64& a, const SIMD_2x64& b) { 402| 55.0k|#if defined(BOTAN_SIMD_USE_SSSE3) 403| 55.0k| return SIMD_2x64(_mm_alignr_epi8(a.m_simd, b.m_simd, 8)); 404| |#elif defined(BOTAN_SIMD_USE_NEON) 405| | return SIMD_2x64(vextq_u64(b.m_simd, a.m_simd, 1)); 406| |#elif defined(BOTAN_SIMD_USE_SIMD128) 407| | return SIMD_2x64( 408| | wasm_i8x16_shuffle(b.m_simd, a.m_simd, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23)); 409| |#elif defined(BOTAN_SIMD_USE_VSX) 410| | const __vector unsigned char mask = {8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23}; 411| | return SIMD_2x64(vec_perm(b.m_simd, a.m_simd, mask)); 412| |#endif 413| 55.0k| } _ZNK5Botan9SIMD_2x644rotrILm1EEES0_vQaagtT_Li0EltT_Li64E: 296| 27.5k| { 297| 27.5k|#if defined(BOTAN_SIMD_USE_SSSE3) 298| | if constexpr(ROT == 8) { 299| | const auto tab = _mm_setr_epi8(1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8); 300| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 301| | } else if constexpr(ROT == 16) { 302| | const auto tab = _mm_setr_epi8(2, 3, 4, 5, 6, 7, 0, 1, 10, 11, 12, 13, 14, 15, 8, 9); 303| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 304| | } else if constexpr(ROT == 24) { 305| | const auto tab = _mm_setr_epi8(3, 4, 5, 6, 7, 0, 1, 2, 11, 12, 13, 14, 15, 8, 9, 10); 306| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 307| | } else if constexpr(ROT == 32) { 308| | const auto tab = _mm_setr_epi8(4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11); 309| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 310| 27.5k| } else { 311| 27.5k| return SIMD_2x64(_mm_or_si128(_mm_srli_epi64(m_simd, static_cast(ROT)), 312| 27.5k| _mm_slli_epi64(m_simd, static_cast(64 - ROT)))); 313| 27.5k| } 314| |#elif defined(BOTAN_SIMD_USE_NEON) 315| | return SIMD_2x64(vsriq_n_u64(vshlq_n_u64(m_simd, 64 - ROT), m_simd, ROT)); 316| |#elif defined(BOTAN_SIMD_USE_SIMD128) 317| | if constexpr(ROT == 8) { 318| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8)); 319| | } else if constexpr(ROT == 16) { 320| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 2, 3, 4, 5, 6, 7, 0, 1, 10, 11, 12, 13, 14, 15, 8, 9)); 321| | } else if constexpr(ROT == 24) { 322| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 3, 4, 5, 6, 7, 0, 1, 2, 11, 12, 13, 14, 15, 8, 9, 10)); 323| | } else if constexpr(ROT == 32) { 324| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11)); 325| | } else { 326| | return SIMD_2x64(wasm_v128_or(wasm_u64x2_shr(m_simd, ROT), wasm_i64x2_shl(m_simd, 64 - ROT))); 327| | } 328| |#elif defined(BOTAN_SIMD_USE_VSX) && defined(__clang__) 329| | // Clang only declares the 64-bit vec_rl if POWER8 is enabled for the whole TU 330| | using s64x2 = __vector signed long long; 331| | const auto rot = vec_splats(static_cast(64 - ROT)); 332| | const auto r = __builtin_altivec_vrld(reinterpret_cast(m_simd), rot); 333| | return SIMD_2x64(reinterpret_cast(r)); 334| |#elif defined(BOTAN_SIMD_USE_VSX) 335| | return SIMD_2x64(vec_rl(m_simd, vec_splats(static_cast(64 - ROT)))); 336| |#endif 337| 27.5k| } _ZNK5Botan9SIMD_2x64eoERKS0_: 230| 110k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 operator^(const SIMD_2x64& other) const { 231| 110k| SIMD_2x64 retval(*this); 232| 110k| retval ^= other; 233| 110k| return retval; 234| 110k| } _ZN5Botan9SIMD_2x64eOERKS0_: 266| 110k| void BOTAN_FN_ISA_SIMD_2X64 operator^=(const SIMD_2x64& other) { 267| 110k|#if defined(BOTAN_SIMD_USE_SSSE3) 268| 110k| m_simd = _mm_xor_si128(m_simd, other.m_simd); 269| |#elif defined(BOTAN_SIMD_USE_NEON) 270| | m_simd = veorq_u64(m_simd, other.m_simd); 271| |#elif defined(BOTAN_SIMD_USE_SIMD128) 272| | m_simd = wasm_v128_xor(m_simd, other.m_simd); 273| |#elif defined(BOTAN_SIMD_USE_VSX) 274| | m_simd = vec_xor(m_simd, other.m_simd); 275| |#endif 276| 110k| } _ZNK5Botan9SIMD_2x644rotrILm8EEES0_vQaagtT_Li0EltT_Li64E: 296| 27.5k| { 297| 27.5k|#if defined(BOTAN_SIMD_USE_SSSE3) 298| 27.5k| if constexpr(ROT == 8) { 299| 27.5k| const auto tab = _mm_setr_epi8(1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8); 300| 27.5k| return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 301| | } else if constexpr(ROT == 16) { 302| | const auto tab = _mm_setr_epi8(2, 3, 4, 5, 6, 7, 0, 1, 10, 11, 12, 13, 14, 15, 8, 9); 303| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 304| | } else if constexpr(ROT == 24) { 305| | const auto tab = _mm_setr_epi8(3, 4, 5, 6, 7, 0, 1, 2, 11, 12, 13, 14, 15, 8, 9, 10); 306| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 307| | } else if constexpr(ROT == 32) { 308| | const auto tab = _mm_setr_epi8(4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11); 309| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 310| | } else { 311| | return SIMD_2x64(_mm_or_si128(_mm_srli_epi64(m_simd, static_cast(ROT)), 312| | _mm_slli_epi64(m_simd, static_cast(64 - ROT)))); 313| | } 314| |#elif defined(BOTAN_SIMD_USE_NEON) 315| | return SIMD_2x64(vsriq_n_u64(vshlq_n_u64(m_simd, 64 - ROT), m_simd, ROT)); 316| |#elif defined(BOTAN_SIMD_USE_SIMD128) 317| | if constexpr(ROT == 8) { 318| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8)); 319| | } else if constexpr(ROT == 16) { 320| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 2, 3, 4, 5, 6, 7, 0, 1, 10, 11, 12, 13, 14, 15, 8, 9)); 321| | } else if constexpr(ROT == 24) { 322| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 3, 4, 5, 6, 7, 0, 1, 2, 11, 12, 13, 14, 15, 8, 9, 10)); 323| | } else if constexpr(ROT == 32) { 324| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11)); 325| | } else { 326| | return SIMD_2x64(wasm_v128_or(wasm_u64x2_shr(m_simd, ROT), wasm_i64x2_shl(m_simd, 64 - ROT))); 327| | } 328| |#elif defined(BOTAN_SIMD_USE_VSX) && defined(__clang__) 329| | // Clang only declares the 64-bit vec_rl if POWER8 is enabled for the whole TU 330| | using s64x2 = __vector signed long long; 331| | const auto rot = vec_splats(static_cast(64 - ROT)); 332| | const auto r = __builtin_altivec_vrld(reinterpret_cast(m_simd), rot); 333| | return SIMD_2x64(reinterpret_cast(r)); 334| |#elif defined(BOTAN_SIMD_USE_VSX) 335| | return SIMD_2x64(vec_rl(m_simd, vec_splats(static_cast(64 - ROT)))); 336| |#endif 337| 27.5k| } _ZNK5Botan9SIMD_2x643shrILi7EEES0_v: 376| 27.5k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 shr() const noexcept { 377| 27.5k|#if defined(BOTAN_SIMD_USE_SSSE3) 378| 27.5k| return SIMD_2x64(_mm_srli_epi64(m_simd, SHIFT)); 379| |#elif defined(BOTAN_SIMD_USE_NEON) 380| | return SIMD_2x64(vshrq_n_u64(m_simd, SHIFT)); 381| |#elif defined(BOTAN_SIMD_USE_SIMD128) 382| | return SIMD_2x64(wasm_u64x2_shr(m_simd, SHIFT)); 383| |#elif defined(BOTAN_SIMD_USE_VSX) 384| | return SIMD_2x64(vec_sr(m_simd, vec_splats(static_cast(SHIFT)))); 385| |#endif 386| 27.5k| } _ZNK5Botan9SIMD_2x644rotrILm19EEES0_vQaagtT_Li0EltT_Li64E: 296| 27.5k| { 297| 27.5k|#if defined(BOTAN_SIMD_USE_SSSE3) 298| | if constexpr(ROT == 8) { 299| | const auto tab = _mm_setr_epi8(1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8); 300| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 301| | } else if constexpr(ROT == 16) { 302| | const auto tab = _mm_setr_epi8(2, 3, 4, 5, 6, 7, 0, 1, 10, 11, 12, 13, 14, 15, 8, 9); 303| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 304| | } else if constexpr(ROT == 24) { 305| | const auto tab = _mm_setr_epi8(3, 4, 5, 6, 7, 0, 1, 2, 11, 12, 13, 14, 15, 8, 9, 10); 306| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 307| | } else if constexpr(ROT == 32) { 308| | const auto tab = _mm_setr_epi8(4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11); 309| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 310| 27.5k| } else { 311| 27.5k| return SIMD_2x64(_mm_or_si128(_mm_srli_epi64(m_simd, static_cast(ROT)), 312| 27.5k| _mm_slli_epi64(m_simd, static_cast(64 - ROT)))); 313| 27.5k| } 314| |#elif defined(BOTAN_SIMD_USE_NEON) 315| | return SIMD_2x64(vsriq_n_u64(vshlq_n_u64(m_simd, 64 - ROT), m_simd, ROT)); 316| |#elif defined(BOTAN_SIMD_USE_SIMD128) 317| | if constexpr(ROT == 8) { 318| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8)); 319| | } else if constexpr(ROT == 16) { 320| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 2, 3, 4, 5, 6, 7, 0, 1, 10, 11, 12, 13, 14, 15, 8, 9)); 321| | } else if constexpr(ROT == 24) { 322| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 3, 4, 5, 6, 7, 0, 1, 2, 11, 12, 13, 14, 15, 8, 9, 10)); 323| | } else if constexpr(ROT == 32) { 324| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11)); 325| | } else { 326| | return SIMD_2x64(wasm_v128_or(wasm_u64x2_shr(m_simd, ROT), wasm_i64x2_shl(m_simd, 64 - ROT))); 327| | } 328| |#elif defined(BOTAN_SIMD_USE_VSX) && defined(__clang__) 329| | // Clang only declares the 64-bit vec_rl if POWER8 is enabled for the whole TU 330| | using s64x2 = __vector signed long long; 331| | const auto rot = vec_splats(static_cast(64 - ROT)); 332| | const auto r = __builtin_altivec_vrld(reinterpret_cast(m_simd), rot); 333| | return SIMD_2x64(reinterpret_cast(r)); 334| |#elif defined(BOTAN_SIMD_USE_VSX) 335| | return SIMD_2x64(vec_rl(m_simd, vec_splats(static_cast(64 - ROT)))); 336| |#endif 337| 27.5k| } _ZNK5Botan9SIMD_2x644rotrILm61EEES0_vQaagtT_Li0EltT_Li64E: 296| 27.5k| { 297| 27.5k|#if defined(BOTAN_SIMD_USE_SSSE3) 298| | if constexpr(ROT == 8) { 299| | const auto tab = _mm_setr_epi8(1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8); 300| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 301| | } else if constexpr(ROT == 16) { 302| | const auto tab = _mm_setr_epi8(2, 3, 4, 5, 6, 7, 0, 1, 10, 11, 12, 13, 14, 15, 8, 9); 303| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 304| | } else if constexpr(ROT == 24) { 305| | const auto tab = _mm_setr_epi8(3, 4, 5, 6, 7, 0, 1, 2, 11, 12, 13, 14, 15, 8, 9, 10); 306| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 307| | } else if constexpr(ROT == 32) { 308| | const auto tab = _mm_setr_epi8(4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11); 309| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 310| 27.5k| } else { 311| 27.5k| return SIMD_2x64(_mm_or_si128(_mm_srli_epi64(m_simd, static_cast(ROT)), 312| 27.5k| _mm_slli_epi64(m_simd, static_cast(64 - ROT)))); 313| 27.5k| } 314| |#elif defined(BOTAN_SIMD_USE_NEON) 315| | return SIMD_2x64(vsriq_n_u64(vshlq_n_u64(m_simd, 64 - ROT), m_simd, ROT)); 316| |#elif defined(BOTAN_SIMD_USE_SIMD128) 317| | if constexpr(ROT == 8) { 318| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8)); 319| | } else if constexpr(ROT == 16) { 320| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 2, 3, 4, 5, 6, 7, 0, 1, 10, 11, 12, 13, 14, 15, 8, 9)); 321| | } else if constexpr(ROT == 24) { 322| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 3, 4, 5, 6, 7, 0, 1, 2, 11, 12, 13, 14, 15, 8, 9, 10)); 323| | } else if constexpr(ROT == 32) { 324| | return SIMD_2x64(wasm_i8x16_shuffle(m_simd, m_simd, 4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11)); 325| | } else { 326| | return SIMD_2x64(wasm_v128_or(wasm_u64x2_shr(m_simd, ROT), wasm_i64x2_shl(m_simd, 64 - ROT))); 327| | } 328| |#elif defined(BOTAN_SIMD_USE_VSX) && defined(__clang__) 329| | // Clang only declares the 64-bit vec_rl if POWER8 is enabled for the whole TU 330| | using s64x2 = __vector signed long long; 331| | const auto rot = vec_splats(static_cast(64 - ROT)); 332| | const auto r = __builtin_altivec_vrld(reinterpret_cast(m_simd), rot); 333| | return SIMD_2x64(reinterpret_cast(r)); 334| |#elif defined(BOTAN_SIMD_USE_VSX) 335| | return SIMD_2x64(vec_rl(m_simd, vec_splats(static_cast(64 - ROT)))); 336| |#endif 337| 27.5k| } _ZNK5Botan9SIMD_2x643shrILi6EEES0_v: 376| 27.5k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 shr() const noexcept { 377| 27.5k|#if defined(BOTAN_SIMD_USE_SSSE3) 378| 27.5k| return SIMD_2x64(_mm_srli_epi64(m_simd, SHIFT)); 379| |#elif defined(BOTAN_SIMD_USE_NEON) 380| | return SIMD_2x64(vshrq_n_u64(m_simd, SHIFT)); 381| |#elif defined(BOTAN_SIMD_USE_SIMD128) 382| | return SIMD_2x64(wasm_u64x2_shr(m_simd, SHIFT)); 383| |#elif defined(BOTAN_SIMD_USE_VSX) 384| | return SIMD_2x64(vec_sr(m_simd, vec_splats(static_cast(SHIFT)))); 385| |#endif 386| 27.5k| } _ZN5Botan9SIMD_4x32C2EDv2_x: 966| 30.8M| explicit BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32(native_simd_type x) noexcept : m_simd(x) {} _ZN5Botan9SIMD_4x327load_beEPKv: 194| 1.22M| static SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 load_be(const void* in) noexcept { 195| | if constexpr(std::endian::native == std::endian::big) { 196| | return SIMD_4x32::load_native(in); 197| 1.22M| } else { 198| 1.22M| return SIMD_4x32::load_native(in).bswap(); 199| 1.22M| } 200| 1.22M| } _ZN5Botan9SIMD_4x3211load_nativeEPKv: 166| 3.88M| static SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 load_native(const void* in) noexcept { 167| 3.88M|#if defined(BOTAN_SIMD_USE_SSSE3) 168| 3.88M| return SIMD_4x32(_mm_loadu_si128(reinterpret_cast(in))); 169| |#elif defined(BOTAN_SIMD_USE_VSX) 170| | return SIMD_4x32(reinterpret_cast(vec_xl(0, static_cast(in)))); 171| |#elif defined(BOTAN_SIMD_USE_NEON) 172| | return SIMD_4x32(vld1q_u32(static_cast(in))); 173| |#elif defined(BOTAN_SIMD_USE_LSX) 174| | return SIMD_4x32(__lsx_vld(in, 0)); 175| |#elif defined(BOTAN_SIMD_USE_SIMD128) 176| | return SIMD_4x32(wasm_v128_load(in)); 177| |#endif 178| 3.88M| } _ZNK5Botan9SIMD_4x325bswapEv: 544| 1.22M| BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32 bswap() const noexcept { 545| 1.22M|#if defined(BOTAN_SIMD_USE_SSSE3) 546| 1.22M| const auto idx = _mm_set_epi8(12, 13, 14, 15, 8, 9, 10, 11, 4, 5, 6, 7, 0, 1, 2, 3); 547| | 548| 1.22M| return SIMD_4x32(_mm_shuffle_epi8(raw(), idx)); 549| |#elif defined(BOTAN_SIMD_USE_VSX) 550| | return SIMD_4x32(vec_revb(m_simd)); 551| | 552| |#elif defined(BOTAN_SIMD_USE_NEON) 553| | return SIMD_4x32(vreinterpretq_u32_u8(vrev32q_u8(vreinterpretq_u8_u32(m_simd)))); 554| |#elif defined(BOTAN_SIMD_USE_LSX) 555| | return SIMD_4x32(__lsx_vshuf4i_b(m_simd, 0b00011011)); 556| |#elif defined(BOTAN_SIMD_USE_SIMD128) 557| | return SIMD_4x32(wasm_i8x16_shuffle(m_simd, m_simd, 3, 2, 1, 0, 7, 6, 5, 4, 11, 10, 9, 8, 15, 14, 13, 12)); 558| |#endif 559| 1.22M| } _ZNK5Botan9SIMD_4x323rawEv: 964| 54.3M| native_simd_type BOTAN_FN_ISA_SIMD_4X32 raw() const noexcept { return m_simd; } _ZNK5Botan9SIMD_4x32plERKS0_: 352| 2.62M| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 operator+(const SIMD_4x32& other) const noexcept { 353| 2.62M| SIMD_4x32 retval(*this); 354| 2.62M| retval += other; 355| 2.62M| return retval; 356| 2.62M| } _ZN5Botan9SIMD_4x32pLERKS0_: 394| 4.93M| void BOTAN_FN_ISA_SIMD_4X32 operator+=(const SIMD_4x32& other) noexcept { 395| 4.93M|#if defined(BOTAN_SIMD_USE_SSSE3) 396| 4.93M| m_simd = _mm_add_epi32(m_simd, other.m_simd); 397| |#elif defined(BOTAN_SIMD_USE_VSX) 398| | m_simd = vec_add(m_simd, other.m_simd); 399| |#elif defined(BOTAN_SIMD_USE_NEON) 400| | m_simd = vaddq_u32(m_simd, other.m_simd); 401| |#elif defined(BOTAN_SIMD_USE_LSX) 402| | m_simd = __lsx_vadd_w(m_simd, other.m_simd); 403| |#elif defined(BOTAN_SIMD_USE_SIMD128) 404| | m_simd = wasm_i32x4_add(m_simd, other.m_simd); 405| |#endif 406| 4.93M| } _ZNK5Botan9SIMD_4x328store_leEPj: 210| 193k| void BOTAN_FN_ISA_SIMD_4X32 store_le(uint32_t out[4]) const noexcept { 211| 193k| this->store_le(reinterpret_cast(out)); 212| 193k| } _ZNK5Botan9SIMD_4x328store_leEPh: 242| 193k| void BOTAN_FN_ISA_SIMD_4X32 store_le(uint8_t out[]) const noexcept { 243| 193k| if constexpr(std::endian::native == std::endian::little) { 244| 193k| this->store_native(out); 245| | } else { 246| | this->bswap().store_native(out); 247| | } 248| 193k| } _ZNK5Botan9SIMD_4x3212store_nativeEPv: 225| 193k| void BOTAN_FN_ISA_SIMD_4X32 store_native(void* out) const noexcept { 226| 193k|#if defined(BOTAN_SIMD_USE_SSSE3) 227| 193k| _mm_storeu_si128(static_cast<__m128i*>(out), raw()); 228| |#elif defined(BOTAN_SIMD_USE_VSX) 229| | vec_xst(reinterpret_cast<__vector unsigned char>(m_simd), 0, static_cast(out)); 230| |#elif defined(BOTAN_SIMD_USE_NEON) 231| | vst1q_u32(static_cast(out), m_simd); 232| |#elif defined(BOTAN_SIMD_USE_LSX) 233| | __lsx_vst(raw(), out, 0); 234| |#elif defined(BOTAN_SIMD_USE_SIMD128) 235| | wasm_v128_store(out, m_simd); 236| |#endif 237| 193k| } _ZN5Botan9SIMD_4x327alignr8ERKS0_S2_: 882| 129k| static inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 alignr8(const SIMD_4x32& a, const SIMD_4x32& b) { 883| 129k|#if defined(BOTAN_SIMD_USE_SSSE3) 884| 129k| return SIMD_4x32(_mm_alignr_epi8(a.raw(), b.raw(), 8)); 885| |#elif defined(BOTAN_SIMD_USE_NEON) 886| | return SIMD_4x32(vextq_u32(b.raw(), a.raw(), 2)); 887| |#elif defined(BOTAN_SIMD_USE_VSX) 888| | const __vector unsigned char mask = {8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23}; 889| | return SIMD_4x32(vec_perm(b.raw(), a.raw(), mask)); 890| |#elif defined(BOTAN_SIMD_USE_LSX) 891| | return SIMD_4x32(__lsx_vshuf4i_d(a.raw(), b.raw(), 0b0011)); 892| |#elif defined(BOTAN_SIMD_USE_SIMD128) 893| | return SIMD_4x32( 894| | wasm_i8x16_shuffle(b.raw(), a.raw(), 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23)); 895| |#endif 896| 129k| } _ZN5Botan9SIMD_4x32eOERKS0_: 422| 2.56M| void BOTAN_FN_ISA_SIMD_4X32 operator^=(const SIMD_4x32& other) noexcept { 423| 2.56M|#if defined(BOTAN_SIMD_USE_SSSE3) 424| 2.56M| m_simd = _mm_xor_si128(m_simd, other.m_simd); 425| |#elif defined(BOTAN_SIMD_USE_VSX) 426| | m_simd = vec_xor(m_simd, other.m_simd); 427| |#elif defined(BOTAN_SIMD_USE_NEON) 428| | m_simd = veorq_u32(m_simd, other.m_simd); 429| |#elif defined(BOTAN_SIMD_USE_LSX) 430| | m_simd = __lsx_vxor_v(m_simd, other.m_simd); 431| |#elif defined(BOTAN_SIMD_USE_SIMD128) 432| | m_simd = wasm_v128_xor(m_simd, other.m_simd); 433| |#endif 434| 2.56M| } _ZN5Botan9SIMD_4x32C2Ejjjj: 99| 63.4k| BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32(uint32_t B0, uint32_t B1, uint32_t B2, uint32_t B3) noexcept { 100| 63.4k|#if defined(BOTAN_SIMD_USE_SSSE3) 101| 63.4k| m_simd = _mm_set_epi32(B3, B2, B1, B0); 102| |#elif defined(BOTAN_SIMD_USE_VSX) 103| | __vector unsigned int val = {B0, B1, B2, B3}; 104| | m_simd = val; 105| |#elif defined(BOTAN_SIMD_USE_NEON) 106| | // Better way to do this? 107| | const uint32_t B[4] = {B0, B1, B2, B3}; 108| | m_simd = vld1q_u32(B); 109| |#elif defined(BOTAN_SIMD_USE_LSX) 110| | // Better way to do this? 111| | const uint32_t B[4] = {B0, B1, B2, B3}; 112| | m_simd = __lsx_vld(B, 0); 113| |#elif defined(BOTAN_SIMD_USE_SIMD128) 114| | m_simd = wasm_u32x4_make(B0, B1, B2, B3); 115| |#endif 116| 63.4k| } _ZN5Botan9SIMD_4x327load_leEPKv: 183| 2.66M| static SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 load_le(const void* in) noexcept { 184| 2.66M| if constexpr(std::endian::native == std::endian::little) { 185| 2.66M| return SIMD_4x32::load_native(in); 186| | } else { 187| | return SIMD_4x32::load_native(in).bswap(); 188| | } 189| 2.66M| } _ZN5Botan9SIMD_4x327alignr4ERKS0_S2_: 865| 1.85M| static inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 alignr4(const SIMD_4x32& a, const SIMD_4x32& b) { 866| 1.85M|#if defined(BOTAN_SIMD_USE_SSSE3) 867| 1.85M| return SIMD_4x32(_mm_alignr_epi8(a.raw(), b.raw(), 4)); 868| |#elif defined(BOTAN_SIMD_USE_NEON) 869| | return SIMD_4x32(vextq_u32(b.raw(), a.raw(), 1)); 870| |#elif defined(BOTAN_SIMD_USE_VSX) 871| | const __vector unsigned char mask = {4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19}; 872| | return SIMD_4x32(vec_perm(b.raw(), a.raw(), mask)); 873| |#elif defined(BOTAN_SIMD_USE_LSX) 874| | const auto mask = SIMD_4x32(0x07060504, 0x0B0A0908, 0x0F0E0D0C, 0x13121110); 875| | return SIMD_4x32(__lsx_vshuf_b(a.raw(), b.raw(), mask.raw())); 876| |#elif defined(BOTAN_SIMD_USE_SIMD128) 877| | return SIMD_4x32( 878| | wasm_i8x16_shuffle(b.raw(), a.raw(), 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19)); 879| |#endif 880| 1.85M| } _ZNK5Botan9SIMD_4x3212extract_wordILm3EEEjv: 942| 63.4k| inline uint32_t BOTAN_FN_ISA_SIMD_4X32 extract_word() const noexcept { 943| 63.4k| static_assert(W <= 3); 944| | 945| |#if defined(BOTAN_SIMD_USE_NEON) 946| | return vgetq_lane_u32(raw(), W); 947| |#elif defined(BOTAN_SIMD_USE_VSX) 948| | return vec_extract(raw(), W); 949| |#elif defined(BOTAN_SIMD_USE_LSX) 950| | return __lsx_vpickve2gr_wu(raw(), W); 951| |#elif defined(BOTAN_SIMD_USE_SIMD128) 952| | return wasm_u32x4_extract_lane(raw(), W); 953| |#elif defined(BOTAN_SIMD_USE_SSSE3) 954| | if constexpr(W == 0) { 955| | return static_cast(_mm_cvtsi128_si32(raw())); 956| 63.4k| } else { 957| | // Broadcast the word then extract the low 958| | // TODO(SSE4.1) could use _mm_extract_epi32 here 959| | return static_cast(_mm_cvtsi128_si32(_mm_shuffle_epi32(raw(), _MM_SHUFFLE(W, W, W, W)))); 960| 63.4k| } 961| 63.4k|#endif 962| 63.4k| } _ZNK5Botan9SIMD_4x3217shift_elems_rightILm2EEES0_vQleT_Li3E: 601| 2.47M| { 602| 2.47M|#if defined(BOTAN_SIMD_USE_SSSE3) 603| 2.47M| return SIMD_4x32(_mm_srli_si128(raw(), 4 * I)); 604| |#elif defined(BOTAN_SIMD_USE_NEON) 605| | return SIMD_4x32(vextq_u32(raw(), vdupq_n_u32(0), I)); 606| |#elif defined(BOTAN_SIMD_USE_VSX) 607| | const __vector unsigned int zero = vec_splat_u32(0); 608| | 609| | const __vector unsigned char shuf[3] = { 610| | {4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19}, 611| | {8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23}, 612| | {12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27}, 613| | }; 614| | 615| | return SIMD_4x32(vec_perm(raw(), zero, shuf[I - 1])); 616| |#elif defined(BOTAN_SIMD_USE_LSX) 617| | return SIMD_4x32(__lsx_vbsrl_v(raw(), 4 * I)); 618| |#elif defined(BOTAN_SIMD_USE_SIMD128) 619| | if constexpr(I == 0) { 620| | return SIMD_4x32(m_simd); 621| | } 622| | 623| | const auto zero = wasm_u32x4_const_splat(0); 624| | if constexpr(I == 1) { 625| | return SIMD_4x32( 626| | wasm_i8x16_shuffle(m_simd, zero, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 16, 16, 16)); 627| | } 628| | if constexpr(I == 2) { 629| | return SIMD_4x32( 630| | wasm_i8x16_shuffle(m_simd, zero, 8, 9, 10, 11, 12, 13, 14, 15, 16, 16, 16, 16, 16, 16, 16, 16)); 631| | } 632| | 633| | return SIMD_4x32( 634| | wasm_i8x16_shuffle(m_simd, zero, 12, 13, 14, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16)); 635| |#endif 636| 2.47M| } _ZN5Botan9SIMD_4x64C2Ev: 33| 3.08k| BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64() : m_simd(_mm256_setzero_si256()) {} _ZN5Botan9SIMD_4x648load_be2EPKvS2_: 41| 3.08k| static BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64 load_be2(const void* lo, const void* hi) { 42| 3.08k| return SIMD_4x64::load_le2(lo, hi).bswap(); 43| 3.08k| } _ZN5Botan9SIMD_4x648load_le2EPKvS2_: 36| 3.08k| static BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64 load_le2(const void* lo, const void* hi) { 37| 3.08k| return SIMD_4x64( 38| 3.08k| _mm256_loadu2_m128i(reinterpret_cast(lo), reinterpret_cast(hi))); 39| 3.08k| } _ZN5Botan9SIMD_4x64C2EDv4_x: 267| 120k| explicit BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64(__m256i x) : m_simd(x) {} _ZNK5Botan9SIMD_4x645bswapEv: 65| 3.08k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 bswap() const { 66| 3.08k| const auto idx = _mm256_set_epi8( 67| 3.08k| 8, 9, 10, 11, 12, 13, 14, 15, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0, 1, 2, 3, 4, 5, 6, 7); 68| | 69| 3.08k| return SIMD_4x64(_mm256_shuffle_epi8(m_simd, idx)); 70| 3.08k| } _ZNK5Botan9SIMD_4x64plERKS0_: 84| 52.4k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 operator+(const SIMD_4x64& other) const { 85| 52.4k| SIMD_4x64 retval(*this); 86| 52.4k| retval += other; 87| 52.4k| return retval; 88| 52.4k| } _ZN5Botan9SIMD_4x64pLERKS0_: 108| 52.4k| BOTAN_FN_ISA_SIMD_4X64 void operator+=(const SIMD_4x64& other) { 109| 52.4k| m_simd = _mm256_add_epi64(m_simd, other.m_simd); 110| 52.4k| } _ZN5Botan9SIMD_4x6414broadcast_2x64EPKm: 61| 15.4k| static BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64 broadcast_2x64(const uint64_t* in) { 62| 15.4k| return SIMD_4x64(_mm256_broadcastsi128_si256(_mm_loadu_si128(reinterpret_cast(in)))); 63| 15.4k| } _ZN5Botan9SIMD_4x649store_le2EPvS1_: 78| 15.4k| BOTAN_FN_ISA_SIMD_4X64 void store_le2(void* outh, void* outl) { 79| 15.4k| _mm256_storeu2_m128i(reinterpret_cast<__m128i*>(outh), reinterpret_cast<__m128i*>(outl), m_simd); 80| 15.4k| } _ZN5Botan9SIMD_4x647alignr8ERKS0_S2_: 233| 24.7k| static SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 alignr8(const SIMD_4x64& a, const SIMD_4x64& b) { 234| | return SIMD_4x64(_mm256_alignr_epi8(a.m_simd, b.m_simd, 8)); 235| 24.7k| } _ZNK5Botan9SIMD_4x644rotrILm1EEES0_vQaagtT_Li0EltT_Li64E: 130| 12.3k| { 131| |#if defined(__AVX512VL__) 132| | return SIMD_4x64(_mm256_ror_epi64(m_simd, ROT)); 133| |#else 134| | if constexpr(ROT == 8) { 135| | const auto shuf_rot_8 = 136| | _mm256_set_epi64x(0x080f0e0d0c0b0a09, 0x0007060504030201, 0x080f0e0d0c0b0a09, 0x0007060504030201); 137| | 138| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_8)); 139| | } else if constexpr(ROT == 16) { 140| | const auto shuf_rot_16 = 141| | _mm256_set_epi64x(0x09080f0e0d0c0b0a, 0x0100070605040302, 0x09080f0e0d0c0b0a, 0x0100070605040302); 142| | 143| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_16)); 144| | } else if constexpr(ROT == 24) { 145| | const auto shuf_rot_24 = 146| | _mm256_set_epi64x(0x0a09080f0e0d0c0b, 0x0201000706050403, 0x0a09080f0e0d0c0b, 0x0201000706050403); 147| | 148| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_24)); 149| | } else if constexpr(ROT == 32) { 150| | const auto shuf_rot_32 = 151| | _mm256_set_epi64x(0x0b0a09080f0e0d0c, 0x0302010007060504, 0x0b0a09080f0e0d0c, 0x0302010007060504); 152| | 153| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_32)); 154| 12.3k| } else { 155| 12.3k| return SIMD_4x64(_mm256_or_si256(_mm256_srli_epi64(m_simd, static_cast(ROT)), 156| 12.3k| _mm256_slli_epi64(m_simd, static_cast(64 - ROT)))); 157| 12.3k| } 158| 12.3k|#endif 159| 12.3k| } _ZNK5Botan9SIMD_4x64eoERKS0_: 90| 49.4k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 operator^(const SIMD_4x64& other) const { 91| 49.4k| SIMD_4x64 retval(*this); 92| 49.4k| retval ^= other; 93| 49.4k| return retval; 94| 49.4k| } _ZN5Botan9SIMD_4x64eOERKS0_: 112| 49.4k| BOTAN_FN_ISA_SIMD_4X64 void operator^=(const SIMD_4x64& other) { 113| 49.4k| m_simd = _mm256_xor_si256(m_simd, other.m_simd); 114| 49.4k| } _ZNK5Botan9SIMD_4x644rotrILm8EEES0_vQaagtT_Li0EltT_Li64E: 130| 12.3k| { 131| |#if defined(__AVX512VL__) 132| | return SIMD_4x64(_mm256_ror_epi64(m_simd, ROT)); 133| |#else 134| 12.3k| if constexpr(ROT == 8) { 135| 12.3k| const auto shuf_rot_8 = 136| 12.3k| _mm256_set_epi64x(0x080f0e0d0c0b0a09, 0x0007060504030201, 0x080f0e0d0c0b0a09, 0x0007060504030201); 137| | 138| 12.3k| return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_8)); 139| | } else if constexpr(ROT == 16) { 140| | const auto shuf_rot_16 = 141| | _mm256_set_epi64x(0x09080f0e0d0c0b0a, 0x0100070605040302, 0x09080f0e0d0c0b0a, 0x0100070605040302); 142| | 143| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_16)); 144| | } else if constexpr(ROT == 24) { 145| | const auto shuf_rot_24 = 146| | _mm256_set_epi64x(0x0a09080f0e0d0c0b, 0x0201000706050403, 0x0a09080f0e0d0c0b, 0x0201000706050403); 147| | 148| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_24)); 149| | } else if constexpr(ROT == 32) { 150| | const auto shuf_rot_32 = 151| | _mm256_set_epi64x(0x0b0a09080f0e0d0c, 0x0302010007060504, 0x0b0a09080f0e0d0c, 0x0302010007060504); 152| | 153| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_32)); 154| | } else { 155| | return SIMD_4x64(_mm256_or_si256(_mm256_srli_epi64(m_simd, static_cast(ROT)), 156| | _mm256_slli_epi64(m_simd, static_cast(64 - ROT)))); 157| | } 158| 12.3k|#endif 159| 12.3k| } _ZNK5Botan9SIMD_4x643shrILi7EEES0_v: 224| 12.3k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 shr() const noexcept { 225| 12.3k| return SIMD_4x64(_mm256_srli_epi64(m_simd, SHIFT)); 226| 12.3k| } _ZNK5Botan9SIMD_4x644rotrILm19EEES0_vQaagtT_Li0EltT_Li64E: 130| 12.3k| { 131| |#if defined(__AVX512VL__) 132| | return SIMD_4x64(_mm256_ror_epi64(m_simd, ROT)); 133| |#else 134| | if constexpr(ROT == 8) { 135| | const auto shuf_rot_8 = 136| | _mm256_set_epi64x(0x080f0e0d0c0b0a09, 0x0007060504030201, 0x080f0e0d0c0b0a09, 0x0007060504030201); 137| | 138| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_8)); 139| | } else if constexpr(ROT == 16) { 140| | const auto shuf_rot_16 = 141| | _mm256_set_epi64x(0x09080f0e0d0c0b0a, 0x0100070605040302, 0x09080f0e0d0c0b0a, 0x0100070605040302); 142| | 143| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_16)); 144| | } else if constexpr(ROT == 24) { 145| | const auto shuf_rot_24 = 146| | _mm256_set_epi64x(0x0a09080f0e0d0c0b, 0x0201000706050403, 0x0a09080f0e0d0c0b, 0x0201000706050403); 147| | 148| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_24)); 149| | } else if constexpr(ROT == 32) { 150| | const auto shuf_rot_32 = 151| | _mm256_set_epi64x(0x0b0a09080f0e0d0c, 0x0302010007060504, 0x0b0a09080f0e0d0c, 0x0302010007060504); 152| | 153| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_32)); 154| 12.3k| } else { 155| 12.3k| return SIMD_4x64(_mm256_or_si256(_mm256_srli_epi64(m_simd, static_cast(ROT)), 156| 12.3k| _mm256_slli_epi64(m_simd, static_cast(64 - ROT)))); 157| 12.3k| } 158| 12.3k|#endif 159| 12.3k| } _ZNK5Botan9SIMD_4x644rotrILm61EEES0_vQaagtT_Li0EltT_Li64E: 130| 12.3k| { 131| |#if defined(__AVX512VL__) 132| | return SIMD_4x64(_mm256_ror_epi64(m_simd, ROT)); 133| |#else 134| | if constexpr(ROT == 8) { 135| | const auto shuf_rot_8 = 136| | _mm256_set_epi64x(0x080f0e0d0c0b0a09, 0x0007060504030201, 0x080f0e0d0c0b0a09, 0x0007060504030201); 137| | 138| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_8)); 139| | } else if constexpr(ROT == 16) { 140| | const auto shuf_rot_16 = 141| | _mm256_set_epi64x(0x09080f0e0d0c0b0a, 0x0100070605040302, 0x09080f0e0d0c0b0a, 0x0100070605040302); 142| | 143| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_16)); 144| | } else if constexpr(ROT == 24) { 145| | const auto shuf_rot_24 = 146| | _mm256_set_epi64x(0x0a09080f0e0d0c0b, 0x0201000706050403, 0x0a09080f0e0d0c0b, 0x0201000706050403); 147| | 148| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_24)); 149| | } else if constexpr(ROT == 32) { 150| | const auto shuf_rot_32 = 151| | _mm256_set_epi64x(0x0b0a09080f0e0d0c, 0x0302010007060504, 0x0b0a09080f0e0d0c, 0x0302010007060504); 152| | 153| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_32)); 154| 12.3k| } else { 155| 12.3k| return SIMD_4x64(_mm256_or_si256(_mm256_srli_epi64(m_simd, static_cast(ROT)), 156| 12.3k| _mm256_slli_epi64(m_simd, static_cast(64 - ROT)))); 157| 12.3k| } 158| 12.3k|#endif 159| 12.3k| } _ZNK5Botan9SIMD_4x643shrILi6EEES0_v: 224| 12.3k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 shr() const noexcept { 225| 12.3k| return SIMD_4x64(_mm256_srli_epi64(m_simd, SHIFT)); 226| 12.3k| } _ZNK5Botan8Streebog13output_lengthEv: 23| 798| size_t output_length() const override { return m_output_bits / 8; } _ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEjQntsr3stdE7same_asIbT_EEES3_S3_: 43| 132k|constexpr inline T value_barrier(T x) { 44| 132k| if(std::is_constant_evaluated()) { ------------------ | Branch (44:7): [Folded, False: 132k] ------------------ 45| 0| return x; 46| 132k| } else { 47| 132k|#if defined(BOTAN_CT_VALUE_BARRIER_USE_ASM) 48| | /* 49| | * We may want a "stronger" statement such as 50| | * asm volatile("" : "+r,m"(x) : : "memory); 51| | * (see https://theunixzoo.co.uk/blog/2021-10-14-preventing-optimisations.html) 52| | * however the current approach seems sufficient with current compilers, 53| | * and is minimally damaging with regards to degrading code generation. 54| | */ 55| 132k| asm("" : "+r"(x) : /* no input */); // NOLINT(*-no-assembler) 56| 132k| return x; 57| |#elif defined(BOTAN_CT_VALUE_BARRIER_USE_VOLATILE) 58| | volatile T vx = x; 59| | return vx; 60| |#else 61| | return x; 62| |#endif 63| 132k| } 64| 132k|} _ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEmQntsr3stdE7same_asIbT_EEES3_S3_: 43| 180M|constexpr inline T value_barrier(T x) { 44| 180M| if(std::is_constant_evaluated()) { ------------------ | Branch (44:7): [Folded, False: 180M] ------------------ 45| 0| return x; 46| 180M| } else { 47| 180M|#if defined(BOTAN_CT_VALUE_BARRIER_USE_ASM) 48| | /* 49| | * We may want a "stronger" statement such as 50| | * asm volatile("" : "+r,m"(x) : : "memory); 51| | * (see https://theunixzoo.co.uk/blog/2021-10-14-preventing-optimisations.html) 52| | * however the current approach seems sufficient with current compilers, 53| | * and is minimally damaging with regards to degrading code generation. 54| | */ 55| 180M| asm("" : "+r"(x) : /* no input */); // NOLINT(*-no-assembler) 56| 180M| return x; 57| |#elif defined(BOTAN_CT_VALUE_BARRIER_USE_VOLATILE) 58| | volatile T vx = x; 59| | return vx; 60| |#else 61| | return x; 62| |#endif 63| 180M| } 64| 180M|} _ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEhQntsr3stdE7same_asIbT_EEES3_S3_: 43| 56.4k|constexpr inline T value_barrier(T x) { 44| 56.4k| if(std::is_constant_evaluated()) { ------------------ | Branch (44:7): [Folded, False: 56.4k] ------------------ 45| 0| return x; 46| 56.4k| } else { 47| 56.4k|#if defined(BOTAN_CT_VALUE_BARRIER_USE_ASM) 48| | /* 49| | * We may want a "stronger" statement such as 50| | * asm volatile("" : "+r,m"(x) : : "memory); 51| | * (see https://theunixzoo.co.uk/blog/2021-10-14-preventing-optimisations.html) 52| | * however the current approach seems sufficient with current compilers, 53| | * and is minimally damaging with regards to degrading code generation. 54| | */ 55| 56.4k| asm("" : "+r"(x) : /* no input */); // NOLINT(*-no-assembler) 56| 56.4k| return x; 57| |#elif defined(BOTAN_CT_VALUE_BARRIER_USE_VOLATILE) 58| | volatile T vx = x; 59| | return vx; 60| |#else 61| | return x; 62| |#endif 63| 56.4k| } 64| 56.4k|} _ZN5Botan17is_sub_element_ofERKNS_3OIDESt16initializer_listIjE: 22| 41.1k|inline std::optional is_sub_element_of(const OID& oid, std::initializer_list prefix) { 23| 41.1k| const auto& c = oid.get_components(); 24| | 25| 41.1k| if(c.size() != prefix.size() + 1) { ------------------ | Branch (25:7): [True: 16.4k, False: 24.7k] ------------------ 26| 16.4k| return {}; 27| 16.4k| } 28| | 29| 24.7k| if(!std::equal(c.begin(), c.end() - 1, prefix.begin(), prefix.end())) { ------------------ | Branch (29:7): [True: 4.40k, False: 20.3k] ------------------ 30| 4.40k| return {}; 31| 4.40k| } 32| | 33| 20.3k| return c[c.size() - 1]; 34| 24.7k|} _ZN5Botan21Allocator_InitializerC2Ev: 57| 1| Allocator_Initializer() { initialize_allocator(); } _ZN5Botan11ASN1_ObjectD2Ev: 168| 962k| virtual ~ASN1_Object() = default; _ZNK5Botan14ASN1_BitString5bytesEv: 206| 51.0k| std::span bytes() const { return std::span{m_bytes}; } _ZNK5Botan14ASN1_BitString11unused_bitsEv: 211| 25.2k| size_t unused_bits() const { return m_unused_bits; } _ZNK5Botan10BER_Object6is_setEv: 267| 1.61M| bool is_set() const { return m_type_tag != ASN1_Type::NoObject; } _ZNK5Botan10BER_Object7taggingEv: 272| 687k| uint32_t tagging() const { return type_tag() | class_tag(); } _ZNK5Botan10BER_Object8type_tagEv: 277| 699k| ASN1_Type type_tag() const { return m_type_tag; } _ZNK5Botan10BER_Object9class_tagEv: 282| 783k| ASN1_Class class_tag() const { return m_class_tag; } _ZNK5Botan10BER_Object4typeEv: 287| 136k| ASN1_Type type() const { return m_type_tag; } _ZNK5Botan10BER_Object9get_classEv: 292| 69.6k| ASN1_Class get_class() const { return m_class_tag; } _ZNK5Botan10BER_Object4bitsEv: 298| 1.63M| const uint8_t* bits() const { return m_value.data(); } _ZNK5Botan10BER_Object6lengthEv: 303| 4.15M| size_t length() const { return m_value.size(); } _ZNK5Botan10BER_Object4dataEv: 308| 259k| std::span data() const { return std::span{m_value}; } _ZN5Botan10BER_Object12mutable_bitsEm: 344| 568k| uint8_t* mutable_bits(size_t length) { 345| 568k| m_value.resize(length); 346| 568k| return m_value.data(); 347| 568k| } _ZNK5Botan3OID5emptyEv: 468| 24.8k| bool empty() const { return m_id.empty(); } _ZNK5Botan3OID9has_valueEv: 474| 23.5k| bool has_value() const { return !empty(); } _ZNK5Botan3OIDeqERKS0_: 510| 86.4k| bool operator==(const OID& other) const { return m_id == other.m_id; } _ZNK5Botan3OID14get_componentsEv: 530| 809k| const std::vector& get_components() const { 531| 809k| return m_id; 532| 809k| } _ZNK5Botan11ASN1_String7taggingEv: 585| 126| ASN1_Type tagging() const { return m_tag; } _ZNK5Botan11ASN1_String5valueEv: 590| 54.8k| const std::string& value() const { return m_utf8_str; } _ZNK5Botan11ASN1_String4sizeEv: 595| 62| size_t size() const { return value().size(); } _ZN5BotanltERKNS_11ASN1_StringES2_: 612| 7.58k| friend bool operator<(const ASN1_String& a, const ASN1_String& b) { return a.value() < b.value(); } _ZNK5Botan19AlgorithmIdentifier3oidEv: 688| 43.2k| const OID& oid() const { return m_oid; } _ZNK5Botan19AlgorithmIdentifier10parametersEv: 693| 31.9k| const std::vector& parameters() const { return m_parameters; } _ZNK5Botan19AlgorithmIdentifier20parameters_are_emptyEv: 715| 37.6k| bool parameters_are_empty() const { return m_parameters.empty(); } _ZNK5Botan19AlgorithmIdentifier28parameters_are_null_or_emptyEv: 720| 36.7k| bool parameters_are_null_or_empty() const { return parameters_are_empty() || parameters_are_null(); } ------------------ | Branch (720:58): [True: 9.39k, False: 27.3k] | Branch (720:84): [True: 19.7k, False: 7.55k] ------------------ _ZN5BotanorENS_10ASN1_ClassES0_: 91| 309k|inline ASN1_Class operator|(ASN1_Class x, ASN1_Class y) { 92| 309k| return static_cast(static_cast(x) | static_cast(y)); 93| 309k|} _ZN5BotanorENS_9ASN1_TypeENS_10ASN1_ClassE: 98| 687k|inline uint32_t operator|(ASN1_Type x, ASN1_Class y) { 99| 687k| return static_cast(x) | static_cast(y); 100| 687k|} _ZN5BotanorENS_10ASN1_ClassENS_9ASN1_TypeE: 105| 118k|inline uint32_t operator|(ASN1_Class x, ASN1_Type y) { 106| 118k| return static_cast(x) | static_cast(y); 107| 118k|} _ZN5BotanneERKNS_3OIDES2_: 561| 34.5k|inline bool operator!=(const OID& a, const OID& b) { 562| 34.5k| return !(a == b); 563| 34.5k|} _ZNKSt3__14hashIN5Botan3OIDEEclERKS2_: 761| 1.37k| size_t operator()(const Botan::OID& oid) const noexcept { return static_cast(oid.hash_code()); } _ZN5Botan11ASN1_ObjectC2ERKS0_: 151| 174k| ASN1_Object(const ASN1_Object&) = default; _ZN5Botan11ASN1_ObjectC2EOS0_: 161| 267k| ASN1_Object(ASN1_Object&&) = default; _ZN5Botan11ASN1_ObjectaSERKS0_: 156| 234| ASN1_Object& operator=(const ASN1_Object&) = default; _ZN5Botan11ASN1_ObjectC2Ev: 146| 524k| ASN1_Object() = default; _ZN5Botan19AlgorithmIdentifierC2Ev: 655| 38.3k| AlgorithmIdentifier() = default; _ZN5Botan3OIDC2Ev: 423| 121k| explicit OID() = default; _ZN5Botan10BER_ObjectaSEOS0_: 259| 205k| BER_Object& operator=(BER_Object&& other) = default; _ZN5Botan11ASN1_ObjectaSEOS0_: 166| 36.4k| ASN1_Object& operator=(ASN1_Object&&) = default; _ZN5Botan14ASN1_BitStringC2Ev: 179| 28.1k| ASN1_BitString() = default; _ZN5Botan10BER_ObjectC2EOS0_: 249| 289k| BER_Object(BER_Object&& other) = default; _ZN5Botan10BER_ObjectC2Ev: 239| 1.00M| BER_Object() = default; _ZN5Botan10BER_ObjectC2ERKS0_: 244| 835| BER_Object(const BER_Object& other) = default; _ZN5Botan9ASN1_TimeC2ERKNSt3__16chrono10time_pointINS2_12system_clockENS2_8durationIxNS1_5ratioILl1ELl1000000EEEEEEE: 64| 3.60k| explicit ASN1_Time(const std::chrono::system_clock::time_point& time) { 65| 3.60k| *this = ASN1_Time::from_time_point(time); 66| 3.60k| } _ZN5Botan9ASN1_TimeC2Ev: 42| 22.5k| ASN1_Time() = default; _ZN5Botan13ignore_paramsIJPKmmEEEvDpRKT_: 149| 2.69M|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJbEEEvDpRKT_: 149| 228|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJjEEEvDpRKT_: 149| 302k|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJmEEEvDpRKT_: 149| 486|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEEEEvDpRKT_: 149| 311|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJPKhmEEEvDpRKT_: 149| 211|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan11BER_Decoder6Limits3DEREv: 44| 65.5k| static Limits DER() { return Limits(false, 0, false, DefaultMaxObjectSize, false); } _ZN5Botan11BER_Decoder6LimitsC2EbmbNSt3__18optionalImEEb: 135| 65.5k| m_allow_ber(allow_ber), 136| 65.5k| m_max_nested_indef(max_nested_indef), 137| 65.5k| m_allow_standalone_eoc(allow_standalone_eoc), 138| 65.5k| m_max_object_size(max_object_size), 139| 65.5k| m_reject_default_value_encoding(reject_default_value_encoding) {} _ZN5Botan11BER_Decoder15decode_optionalImEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS3_: 548| 11.6k| BER_Decoder& decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value = T()) { 549| 11.6k| std::optional optval; 550| 11.6k| this->decode_optional(optval, type_tag, class_tag); 551| 11.6k| out = optval ? *optval : default_value; ------------------ | Branch (551:16): [True: 9.73k, False: 1.92k] ------------------ 552| 11.6k| return (*this); 553| 11.6k| } _ZN5Botan11BER_Decoder15decode_optionalImEERS0_RNSt3__18optionalIT_EENS_9ASN1_TypeENS_10ASN1_ClassE: 840| 14.5k|BER_Decoder& BER_Decoder::decode_optional(std::optional& optval, ASN1_Type type_tag, ASN1_Class class_tag) { 841| 14.5k| BER_Object obj = get_next_object(); 842| | 843| 14.5k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (843:7): [True: 10.6k, False: 3.93k] ------------------ 844| 10.6k| T out{}; 845| 10.6k| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (845:10): [True: 9.75k, False: 912] ------------------ 846| 9.75k| BER_Decoder(obj, m_limits).decode(out).verify_end(); 847| 9.75k| } else { 848| 912| this->push_back(std::move(obj)); 849| | if constexpr(std::is_base_of_v) { 850| | // Object types check the tag in decode_from; a re-tagging 851| | // implicit override of an object is not supported here 852| | this->decode(out); 853| 912| } else { 854| 912| this->decode(out, type_tag, class_tag); 855| 912| } 856| 912| } 857| 10.6k| optval = std::move(out); 858| 10.6k| } else { 859| 3.93k| this->push_back(std::move(obj)); 860| 3.93k| optval = std::nullopt; 861| 3.93k| } 862| | 863| 14.5k| return (*this); 864| 14.5k|} _ZN5Botan11BER_Decoder6decodeERm: 364| 10.0k| BER_Decoder& decode(size_t& out) { return decode(out, ASN1_Type::Integer, ASN1_Class::Universal); } _ZNK5Botan11BER_Decoder6limitsEv: 199| 267k| Limits limits() const { return m_limits; } _ZN5Botan11BER_DecoderC2ERKNS_10BER_ObjectENS0_6LimitsE: 169| 33.7k| BER_Decoder(obj.data(), limits) {} _ZNK5Botan11BER_Decoder6Limits18allow_ber_encodingEv: 58| 1.43M| bool allow_ber_encoding() const { return m_allow_ber; } _ZNK5Botan11BER_Decoder6Limits20require_der_encodingEv: 63| 863k| bool require_der_encoding() const { return !allow_ber_encoding(); } _ZNK5Botan11BER_Decoder6Limits15max_object_sizeEv: 82| 569k| std::optional max_object_size() const { return m_max_object_size; } _ZN5Botan11BER_Decoder8get_nextERNS_10BER_ObjectE: 212| 20.5k| BER_Decoder& get_next(BER_Object& ber) { 213| 20.5k| ber = get_next_object(); 214| 20.5k| return (*this); 215| 20.5k| } _ZN5Botan11BER_Decoder14start_sequenceEv: 277| 188k| BER_Decoder start_sequence() { return start_cons(ASN1_Type::Sequence, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder9start_setEv: 283| 39.8k| BER_Decoder start_set() { return start_cons(ASN1_Type::Set, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder22start_context_specificEj: 292| 635| BER_Decoder start_context_specific(uint32_t tag) { 293| 635| return start_cons(ASN1_Type(tag), ASN1_Class::ContextSpecific); 294| 635| } _ZN5Botan11BER_Decoder6decodeERNS_6BigIntE: 369| 14.4k| BER_Decoder& decode(BigInt& out) { return decode(out, ASN1_Type::Integer, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder6decodeINSt3__16vectorIhNS2_9allocatorIhEEEEQsr8conceptsE20ordinary_byte_vectorINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEEERS0_RS9_NS_9ASN1_TypeE: 388| 31.3k| BER_Decoder& decode(T& out, ASN1_Type real_type) { 389| 31.3k| return decode(unwrap_strong_type(out), real_type, real_type, ASN1_Class::Universal); 390| 31.3k| } _ZN5Botan11BER_Decoder6decodeINSt3__16vectorIhNS2_9allocatorIhEEEEQsr8conceptsE20ordinary_byte_vectorINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEEERS0_RS9_NS_9ASN1_TypeESF_NS_10ASN1_ClassE: 405| 33.2k| ASN1_Class class_tag = ASN1_Class::ContextSpecific) { 406| 33.2k| return decode_into_byte_vector(unwrap_strong_type(v), real_type, type_tag, class_tag); 407| 33.2k| } _ZN5Botan11BER_Decoder9raw_bytesINSt3__16vectorIhNS2_9allocatorIhEEEEQsr8conceptsE20ordinary_byte_vectorINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEEERS0_RS9_: 341| 69.9k| BER_Decoder& raw_bytes(T& out_wrapped) { 342| 69.9k| auto& out = unwrap_strong_type(out_wrapped); 343| 69.9k| out.clear(); 344| 69.9k| uint8_t buf[64]; 345| 220k| while(const size_t got = this->read_bytes(std::span{buf})) { ------------------ | Branch (345:29): [True: 150k, False: 69.9k] ------------------ 346| 150k| out.insert(out.end(), buf, buf + got); 347| 150k| } 348| 69.9k| return (*this); 349| 69.9k| } _ZN5Botan11BER_Decoder15decode_optionalIbEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS3_: 548| 31.1k| BER_Decoder& decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value = T()) { 549| 31.1k| std::optional optval; 550| 31.1k| this->decode_optional(optval, type_tag, class_tag); 551| 31.1k| out = optval ? *optval : default_value; ------------------ | Branch (551:16): [True: 6.72k, False: 24.4k] ------------------ 552| 31.1k| return (*this); 553| 31.1k| } _ZN5Botan11BER_Decoder15decode_optionalIbEERS0_RNSt3__18optionalIT_EENS_9ASN1_TypeENS_10ASN1_ClassE: 840| 31.1k|BER_Decoder& BER_Decoder::decode_optional(std::optional& optval, ASN1_Type type_tag, ASN1_Class class_tag) { 841| 31.1k| BER_Object obj = get_next_object(); 842| | 843| 31.1k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (843:7): [True: 6.84k, False: 24.2k] ------------------ 844| 6.84k| T out{}; 845| 6.84k| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (845:10): [True: 0, False: 6.84k] ------------------ 846| 0| BER_Decoder(obj, m_limits).decode(out).verify_end(); 847| 6.84k| } else { 848| 6.84k| this->push_back(std::move(obj)); 849| | if constexpr(std::is_base_of_v) { 850| | // Object types check the tag in decode_from; a re-tagging 851| | // implicit override of an object is not supported here 852| | this->decode(out); 853| 6.84k| } else { 854| 6.84k| this->decode(out, type_tag, class_tag); 855| 6.84k| } 856| 6.84k| } 857| 6.84k| optval = std::move(out); 858| 24.2k| } else { 859| 24.2k| this->push_back(std::move(obj)); 860| 24.2k| optval = std::nullopt; 861| 24.2k| } 862| | 863| 31.1k| return (*this); 864| 31.1k|} x509_ext.cpp:_ZN5Botan11BER_Decoder21decode_optional_fieldIZNS_14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS4_9allocatorIhEEEEE3$_0EERS0_jNS_10ASN1_ClassEOT_: 621| 1.82k| BER_Decoder& decode_optional_field(uint32_t tag_no, ASN1_Class class_tag, F&& fn) { 622| 1.82k| if(peek_next_object().is_a(tag_no, class_tag)) { ------------------ | Branch (622:13): [True: 1.19k, False: 628] ------------------ 623| 1.19k| std::forward(fn)(*this); 624| 1.19k| } 625| 1.82k| return (*this); 626| 1.82k| } _ZN5Botan11BER_Decoder15decode_implicitINS_15AlternativeNameEEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassES6_S7_: 658| 1.36k| T& out, ASN1_Type type_tag, ASN1_Class class_tag, ASN1_Type real_type, ASN1_Class real_class) { 659| 1.36k| BER_Object obj = get_next_object(); 660| 1.36k| obj.assert_is_a(type_tag, class_tag); 661| 1.36k| return decode_implicit(std::move(obj), out, real_type, real_class); 662| 1.36k| } _ZN5Botan11BER_Decoder15decode_implicitINS_15AlternativeNameEEERS0_NS_10BER_ObjectERT_NS_9ASN1_TypeENS_10ASN1_ClassE: 635| 1.36k| BER_Decoder& decode_implicit(BER_Object obj, T& out, ASN1_Type real_type, ASN1_Class real_class) { 636| 1.36k| obj.set_tagging(real_type, real_class); 637| 1.36k| push_back(std::move(obj)); 638| 1.36k| if constexpr(std::is_base_of_v) { 639| | // The object was re-tagged above; decode_from checks the real tag itself 640| 1.36k| return decode(out); 641| | } else { 642| | return decode(out, real_type, real_class); 643| | } 644| 1.36k| } x509_ext.cpp:_ZN5Botan11BER_Decoder21decode_optional_fieldIZNS_14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS4_9allocatorIhEEEEE3$_1EERS0_jNS_10ASN1_ClassEOT_: 621| 1.66k| BER_Decoder& decode_optional_field(uint32_t tag_no, ASN1_Class class_tag, F&& fn) { 622| 1.66k| if(peek_next_object().is_a(tag_no, class_tag)) { ------------------ | Branch (622:13): [True: 749, False: 912] ------------------ 623| 749| std::forward(fn)(*this); 624| 749| } 625| 1.66k| return (*this); 626| 1.66k| } x509_ext.cpp:_ZN5Botan11BER_Decoder21decode_optional_fieldIZNS_14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS4_9allocatorIhEEEEE3$_2EERS0_jNS_10ASN1_ClassEOT_: 621| 1.49k| BER_Decoder& decode_optional_field(uint32_t tag_no, ASN1_Class class_tag, F&& fn) { 622| 1.49k| if(peek_next_object().is_a(tag_no, class_tag)) { ------------------ | Branch (622:13): [True: 645, False: 850] ------------------ 623| 645| std::forward(fn)(*this); 624| 645| } 625| 1.49k| return (*this); 626| 1.49k| } _ZN5Botan11BER_Decoder15decode_implicitINS_18X509_Serial_NumberEEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassES6_S7_: 658| 645| T& out, ASN1_Type type_tag, ASN1_Class class_tag, ASN1_Type real_type, ASN1_Class real_class) { 659| 645| BER_Object obj = get_next_object(); 660| 645| obj.assert_is_a(type_tag, class_tag); 661| 645| return decode_implicit(std::move(obj), out, real_type, real_class); 662| 645| } _ZN5Botan11BER_Decoder15decode_implicitINS_18X509_Serial_NumberEEERS0_NS_10BER_ObjectERT_NS_9ASN1_TypeENS_10ASN1_ClassE: 635| 645| BER_Decoder& decode_implicit(BER_Object obj, T& out, ASN1_Type real_type, ASN1_Class real_class) { 636| 645| obj.set_tagging(real_type, real_class); 637| 645| push_back(std::move(obj)); 638| 645| if constexpr(std::is_base_of_v) { 639| | // The object was re-tagged above; decode_from checks the real tag itself 640| 645| return decode(out); 641| | } else { 642| | return decode(out, real_type, real_class); 643| | } 644| 645| } _ZN5Botan11BER_Decoder11decode_listINS_3OIDEEERS0_RNSt3__16vectorIT_NS4_9allocatorIS6_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 893| 1.63k|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 894| 1.63k| BER_Decoder list = start_cons(type_tag, class_tag); 895| | 896| 3.94k| while(list.more_items()) { ------------------ | Branch (896:10): [True: 2.30k, False: 1.63k] ------------------ 897| 2.30k| T value; 898| 2.30k| list.decode(value); 899| 2.30k| vec.push_back(std::move(value)); 900| 2.30k| } 901| | 902| 1.63k| list.end_cons(); 903| | 904| 1.63k| return (*this); 905| 1.63k|} _ZN5Botan11BER_Decoder20decode_optional_listINS_14GeneralSubtreeEEEbRNSt3__16vectorIT_NS3_9allocatorIS5_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 911| 444|bool BER_Decoder::decode_optional_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 912| 444| if(peek_next_object().is_a(type_tag, class_tag)) { ------------------ | Branch (912:7): [True: 253, False: 191] ------------------ 913| 253| decode_list(vec, type_tag, class_tag); 914| 253| return true; 915| 253| } 916| | 917| 191| return false; 918| 444|} _ZN5Botan11BER_Decoder11decode_listINS_14GeneralSubtreeEEERS0_RNSt3__16vectorIT_NS4_9allocatorIS6_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 893| 253|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 894| 253| BER_Decoder list = start_cons(type_tag, class_tag); 895| | 896| 730| while(list.more_items()) { ------------------ | Branch (896:10): [True: 477, False: 253] ------------------ 897| 477| T value; 898| 477| list.decode(value); 899| 477| vec.push_back(std::move(value)); 900| 477| } 901| | 902| 253| list.end_cons(); 903| | 904| 253| return (*this); 905| 253|} x509_ext.cpp:_ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension12_GLOBAL__N_118Policy_InformationEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 893| 120|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 894| 120| BER_Decoder list = start_cons(type_tag, class_tag); 895| | 896| 499| while(list.more_items()) { ------------------ | Branch (896:10): [True: 379, False: 120] ------------------ 897| 379| T value; 898| 379| list.decode(value); 899| 379| vec.push_back(std::move(value)); 900| 379| } 901| | 902| 120| list.end_cons(); 903| | 904| 120| return (*this); 905| 120|} _ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension23CRL_Distribution_Points18Distribution_PointEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 893| 578|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 894| 578| BER_Decoder list = start_cons(type_tag, class_tag); 895| | 896| 1.34k| while(list.more_items()) { ------------------ | Branch (896:10): [True: 762, False: 578] ------------------ 897| 762| T value; 898| 762| list.decode(value); 899| 762| vec.push_back(std::move(value)); 900| 762| } 901| | 902| 578| list.end_cons(); 903| | 904| 578| return (*this); 905| 578|} x509_ext.cpp:_ZN5Botan11BER_Decoder21decode_optional_fieldIZNS_14Cert_Extension23CRL_Distribution_Points18Distribution_Point11decode_fromERS0_E3$_0EES5_jNS_10ASN1_ClassEOT_: 621| 692| BER_Decoder& decode_optional_field(uint32_t tag_no, ASN1_Class class_tag, F&& fn) { 622| 692| if(peek_next_object().is_a(tag_no, class_tag)) { ------------------ | Branch (622:13): [True: 635, False: 57] ------------------ 623| 635| std::forward(fn)(*this); 624| 635| } 625| 692| return (*this); 626| 692| } x509_ext.cpp:_ZN5Botan11BER_Decoder21decode_optional_fieldIZNS_14Cert_Extension23CRL_Distribution_Points18Distribution_Point11decode_fromERS0_E3$_1EES5_jNS_10ASN1_ClassEOT_: 621| 376| BER_Decoder& decode_optional_field(uint32_t tag_no, ASN1_Class class_tag, F&& fn) { 622| 376| if(peek_next_object().is_a(tag_no, class_tag)) { ------------------ | Branch (622:13): [True: 17, False: 359] ------------------ 623| 17| std::forward(fn)(*this); 624| 17| } 625| 376| return (*this); 626| 376| } x509_ext.cpp:_ZN5Botan11BER_Decoder21decode_optional_fieldIZNS_14Cert_Extension23CRL_Distribution_Points18Distribution_Point11decode_fromERS0_E3$_2EES5_jNS_10ASN1_ClassEOT_: 621| 359| BER_Decoder& decode_optional_field(uint32_t tag_no, ASN1_Class class_tag, F&& fn) { 622| 359| if(peek_next_object().is_a(tag_no, class_tag)) { ------------------ | Branch (622:13): [True: 10, False: 349] ------------------ 623| 10| std::forward(fn)(*this); 624| 10| } 625| 359| return (*this); 626| 359| } _ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension10TNAuthList5EntryEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 893| 151|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 894| 151| BER_Decoder list = start_cons(type_tag, class_tag); 895| | 896| 304| while(list.more_items()) { ------------------ | Branch (896:10): [True: 153, False: 151] ------------------ 897| 153| T value; 898| 153| list.decode(value); 899| 153| vec.push_back(std::move(value)); 900| 153| } 901| | 902| 151| list.end_cons(); 903| | 904| 151| return (*this); 905| 151|} _ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension15IPAddressBlocks15IPAddressFamilyEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 893| 266|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 894| 266| BER_Decoder list = start_cons(type_tag, class_tag); 895| | 896| 614| while(list.more_items()) { ------------------ | Branch (896:10): [True: 348, False: 266] ------------------ 897| 348| T value; 898| 348| list.decode(value); 899| 348| vec.push_back(std::move(value)); 900| 348| } 901| | 902| 266| list.end_cons(); 903| | 904| 266| return (*this); 905| 266|} _ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension15IPAddressBlocks16IPAddressOrRangeILNS3_7VersionE4EEEEERS0_RNSt3__16vectorIT_NS8_9allocatorISA_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 893| 104|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 894| 104| BER_Decoder list = start_cons(type_tag, class_tag); 895| | 896| 219| while(list.more_items()) { ------------------ | Branch (896:10): [True: 115, False: 104] ------------------ 897| 115| T value; 898| 115| list.decode(value); 899| 115| vec.push_back(std::move(value)); 900| 115| } 901| | 902| 104| list.end_cons(); 903| | 904| 104| return (*this); 905| 104|} _ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension15IPAddressBlocks16IPAddressOrRangeILNS3_7VersionE16EEEEERS0_RNSt3__16vectorIT_NS8_9allocatorISA_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 893| 109|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 894| 109| BER_Decoder list = start_cons(type_tag, class_tag); 895| | 896| 242| while(list.more_items()) { ------------------ | Branch (896:10): [True: 133, False: 109] ------------------ 897| 133| T value; 898| 133| list.decode(value); 899| 133| vec.push_back(std::move(value)); 900| 133| } 901| | 902| 109| list.end_cons(); 903| | 904| 109| return (*this); 905| 109|} _ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension8ASBlocks11ASIdOrRangeEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 893| 119|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 894| 119| BER_Decoder list = start_cons(type_tag, class_tag); 895| | 896| 490| while(list.more_items()) { ------------------ | Branch (896:10): [True: 371, False: 119] ------------------ 897| 371| T value; 898| 371| list.decode(value); 899| 371| vec.push_back(std::move(value)); 900| 371| } 901| | 902| 119| list.end_cons(); 903| | 904| 119| return (*this); 905| 119|} _ZN5Botan11BER_Decoder30decode_octet_aligned_bitstringINSt3__16vectorIhNS2_9allocatorIhEEEEQsr8conceptsE20ordinary_byte_vectorINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEEERS0_RS9_NS_9ASN1_TypeENS_10ASN1_ClassE: 458| 25.1k| ASN1_Class class_tag = ASN1_Class::Universal) { 459| 25.1k| auto& out = unwrap_strong_type(out_wrapped); 460| 25.1k| ASN1_BitString bits; 461| 25.1k| decode_bitstring(bits, type_tag, class_tag); 462| | 463| 25.1k| if(bits.unused_bits() != 0) { ------------------ | Branch (463:13): [True: 7, False: 25.1k] ------------------ 464| 7| throw Decoding_Error("Expected octet-aligned BIT STRING"); 465| 7| } 466| | 467| 25.1k| out.assign(bits.bytes().begin(), bits.bytes().end()); 468| 25.1k| return (*this); 469| 25.1k| } _ZN5Botan11BER_Decoder22decode_optional_stringINSt3__16vectorIhNS2_9allocatorIhEEEEQsr8conceptsE20ordinary_byte_vectorINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEEERS0_RS9_NS_9ASN1_TypeEjNS_10ASN1_ClassE: 720| 20.5k| ASN1_Class class_tag = ASN1_Class::ContextSpecific) { 721| 20.5k| BER_Object obj = get_next_object(); 722| 20.5k| auto& out = unwrap_strong_type(out_wrapped); 723| | 724| 20.5k| const ASN1_Type type_tag = static_cast(expected_tag); 725| | 726| 20.5k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (726:13): [True: 694, False: 19.8k] ------------------ 727| 694| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (727:16): [True: 0, False: 694] ------------------ 728| 0| BER_Decoder(obj, m_limits).decode(out, real_type).verify_end(); 729| 694| } else { 730| 694| push_back(std::move(obj)); 731| 694| decode(out, real_type, type_tag, class_tag); 732| 694| } 733| 19.8k| } else { 734| 19.8k| out.clear(); 735| 19.8k| push_back(std::move(obj)); 736| 19.8k| } 737| | 738| 20.5k| return (*this); 739| 20.5k| } _ZN5Botan11BER_Decoder15decode_implicitINS_3OIDEEERS0_NS_10BER_ObjectERT_NS_9ASN1_TypeENS_10ASN1_ClassE: 635| 835| BER_Decoder& decode_implicit(BER_Object obj, T& out, ASN1_Type real_type, ASN1_Class real_class) { 636| 835| obj.set_tagging(real_type, real_class); 637| 835| push_back(std::move(obj)); 638| 835| if constexpr(std::is_base_of_v) { 639| | // The object was re-tagged above; decode_from checks the real tag itself 640| 835| return decode(out); 641| | } else { 642| | return decode(out, real_type, real_class); 643| | } 644| 835| } _ZN5Botan11BER_Decoder16decode_and_checkINS_3OIDEEERS0_RKT_NSt3__117basic_string_viewIcNS7_11char_traitsIcEEEE: 696| 2| BER_Decoder& decode_and_check(const T& expected, std::string_view error_msg) { 697| 2| T actual; 698| 2| decode(actual); 699| | 700| 2| if(actual != expected) { ------------------ | Branch (700:13): [True: 2, False: 0] ------------------ 701| 2| throw Decoding_Error(error_msg); 702| 2| } 703| | 704| 0| return (*this); 705| 2| } _ZN5Botan11BER_Decoder16decode_and_checkImEERS0_RKT_NSt3__117basic_string_viewIcNS6_11char_traitsIcEEEE: 696| 4| BER_Decoder& decode_and_check(const T& expected, std::string_view error_msg) { 697| 4| T actual; 698| 4| decode(actual); 699| | 700| 4| if(actual != expected) { ------------------ | Branch (700:13): [True: 1, False: 3] ------------------ 701| 1| throw Decoding_Error(error_msg); 702| 1| } 703| | 704| 3| return (*this); 705| 4| } _ZN5Botan11BER_Decoder15decode_optionalINS_19AlgorithmIdentifierEEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS4_: 548| 29| BER_Decoder& decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value = T()) { 549| 29| std::optional optval; 550| 29| this->decode_optional(optval, type_tag, class_tag); 551| 29| out = optval ? *optval : default_value; ------------------ | Branch (551:16): [True: 27, False: 2] ------------------ 552| 29| return (*this); 553| 29| } _ZN5Botan11BER_Decoder15decode_optionalINS_19AlgorithmIdentifierEEERS0_RNSt3__18optionalIT_EENS_9ASN1_TypeENS_10ASN1_ClassE: 840| 29|BER_Decoder& BER_Decoder::decode_optional(std::optional& optval, ASN1_Type type_tag, ASN1_Class class_tag) { 841| 29| BER_Object obj = get_next_object(); 842| | 843| 29| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (843:7): [True: 29, False: 0] ------------------ 844| 29| T out{}; 845| 29| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (845:10): [True: 29, False: 0] ------------------ 846| 29| BER_Decoder(obj, m_limits).decode(out).verify_end(); 847| 29| } else { 848| 0| this->push_back(std::move(obj)); 849| 0| if constexpr(std::is_base_of_v) { 850| | // Object types check the tag in decode_from; a re-tagging 851| | // implicit override of an object is not supported here 852| 0| this->decode(out); 853| | } else { 854| | this->decode(out, type_tag, class_tag); 855| | } 856| 0| } 857| 29| optval = std::move(out); 858| 29| } else { 859| 0| this->push_back(std::move(obj)); 860| 0| optval = std::nullopt; 861| 0| } 862| | 863| 29| return (*this); 864| 29|} _ZN5Botan6BigInt4zeroEv: 50| 1| static BigInt zero() { return BigInt(); } _ZN5Botan6BigIntC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 98| 1.89k| explicit BigInt(std::string_view str) { *this = BigInt::from_string(str); } _ZN5Botan6BigIntC2EPKhm: 133| 128| BigInt(const uint8_t buf[], size_t length) { assign_from_bytes(std::span{buf, length}); } _ZN5Botan6BigIntC2EOS0_: 183| 21.4k| BigInt(BigInt&& other) noexcept { this->swap(other); } _ZN5Botan6BigIntD2Ev: 185| 225k| ~BigInt() { _const_time_unpoison(); } _ZN5Botan6BigIntaSEOS0_: 190| 134k| BigInt& operator=(BigInt&& other) noexcept { 191| 134k| if(this != &other) { ------------------ | Branch (191:13): [True: 134k, False: 0] ------------------ 192| 134k| this->swap(other); 193| 134k| } 194| | 195| 134k| return (*this); 196| 134k| } _ZN5Botan6BigInt4swapERS0_: 207| 170k| void swap(BigInt& other) noexcept { 208| 170k| m_data.swap(other.m_data); 209| 170k| std::swap(m_signedness, other.m_signedness); 210| 170k| } _ZN5Botan6BigInt8swap_regERNSt3__16vectorImNS_16secure_allocatorImEEEE: 218| 7.04k| BOTAN_DEPRECATED("Deprecated no replacement") void swap_reg(secure_vector& reg) { 219| 7.04k| m_data.swap(reg); 220| | // sign left unchanged 221| 7.04k| } _ZN5Botan6BigIntmIEm: 245| 141| BigInt& operator-=(word y) { return sub(&y, 1, Positive); } _ZN5Botan6BigInt3subEPKmmNS0_4SignE: 358| 141| BigInt& sub(const word y[], size_t y_words, Sign sign) { 359| 141| return add(y, y_words, sign == Positive ? Negative : Positive); ------------------ | Branch (359:33): [True: 141, False: 0] ------------------ 360| 141| } _ZN5Botan6BigInt5clearEv: 441| 31.2k| void clear() { 442| 31.2k| m_data.set_to_zero(); 443| 31.2k| m_signedness = Positive; 444| 31.2k| } _ZNK5Botan6BigInt7is_evenEv: 481| 2.16k| bool is_even() const { return !get_bit(0); } _ZNK5Botan6BigInt6is_oddEv: 487| 15.9k| bool is_odd() const { return get_bit(0); } _ZNK5Botan6BigInt6signumEv: 493| 319k| int signum() const { 494| 319k| if(sig_words() == 0) { ------------------ | Branch (494:13): [True: 1.34k, False: 318k] ------------------ 495| 1.34k| return 0; 496| 1.34k| } 497| 318k| return (sign() == Negative) ? -1 : 1; ------------------ | Branch (497:17): [True: 5.80k, False: 312k] ------------------ 498| 319k| } _ZNK5Botan6BigInt7is_zeroEv: 510| 39.5k| bool is_zero() const { return sig_words() == 0; } _ZN5Botan6BigInt7set_bitEm: 516| 3.89k| void set_bit(size_t n) { conditionally_set_bit(n, true); } _ZN5Botan6BigInt21conditionally_set_bitEmb: 526| 3.89k| void conditionally_set_bit(size_t n, bool set_it) { 527| 3.89k| const size_t which = n / (sizeof(word) * 8); 528| 3.89k| const word mask = static_cast(set_it) << (n % (sizeof(word) * 8)); 529| 3.89k| m_data.set_word_at(which, word_at(which) | mask); 530| 3.89k| } _ZNK5Botan6BigInt7get_bitEm: 549| 18.2k| bool get_bit(size_t n) const { return ((word_at(n / (sizeof(word) * 8)) >> (n % (sizeof(word) * 8))) & 1) == 1; } _ZNK5Botan6BigInt7word_atEm: 601| 267k| word word_at(size_t n) const { return m_data.get_word_at(n); } _ZN5Botan6BigInt11set_word_atEmm: 608| 9.15k| BOTAN_DEPRECATED("Deprecated no replacement") void set_word_at(size_t i, word w) { m_data.set_word_at(i, w); } _ZN5Botan6BigInt9set_wordsEPKmm: 615| 486| BOTAN_DEPRECATED("Deprecated no replacement") void set_words(const word w[], size_t len) { 616| 486| m_data.set_words(w, len); 617| 486| } _ZNK5Botan6BigInt11is_negativeEv: 623| 1.41k| BOTAN_DEPRECATED("Use signum() < 0") bool is_negative() const { return signum() < 0; } _ZNK5Botan6BigInt4signEv: 641| 380k| Sign sign() const { return (m_signedness); } _ZNK5Botan6BigInt12reverse_signEv: 647| 160| Sign reverse_sign() const { 648| 160| if(sign() == Positive) { ------------------ | Branch (648:13): [True: 160, False: 0] ------------------ 649| 160| return Negative; 650| 160| } 651| 0| return Positive; 652| 160| } _ZN5Botan6BigInt9flip_signEv: 657| 77| BOTAN_DEPRECATED("Deprecated no replacement") void flip_sign() { set_sign(reverse_sign()); } _ZN5Botan6BigInt8set_signENS0_4SignE: 663| 22.5k| void set_sign(Sign sign) { 664| 22.5k| if(sign == Negative && is_zero()) { ------------------ | Branch (664:13): [True: 4.66k, False: 17.8k] | Branch (664:33): [True: 0, False: 4.66k] ------------------ 665| 0| sign = Positive; 666| 0| } 667| | 668| 22.5k| m_signedness = sign; 669| 22.5k| } _ZNK5Botan6BigInt4sizeEv: 681| 517k| size_t size() const { return m_data.size(); } _ZNK5Botan6BigInt9sig_wordsEv: 687| 634k| size_t sig_words() const { return m_data.sig_words(); } _ZN5Botan6BigInt12mutable_dataEv: 712| 150k| BOTAN_DEPRECATED("Deprecated no replacement") word* mutable_data() { return m_data.mutable_data(); } _ZNK5Botan6BigInt4dataEv: 718| 2.30k| BOTAN_DEPRECATED("Deprecated no replacement") const word* data() const { return m_data.const_data(); } _ZN5Botan6BigInt15get_word_vectorEv: 723| 5.02k| BOTAN_DEPRECATED("Deprecated no replacement") secure_vector& get_word_vector() { 724| 5.02k| return m_data.mutable_vector(); 725| 5.02k| } _ZNK5Botan6BigInt7grow_toEm: 738| 59.2k| BOTAN_DEPRECATED("Deprecated no replacement") void grow_to(size_t n) const { m_data.grow_to(n); } _ZN5Botan6BigInt10power_of_2Em: 906| 3.89k| static BigInt power_of_2(size_t n) { 907| 3.89k| BigInt b; 908| 3.89k| b.set_bit(n); 909| 3.89k| return b; 910| 3.89k| } _ZN5Botan6BigInt6decodeEPKhm: 943| 218| BOTAN_DEPRECATED("Use BigInt::from_bytes") static BigInt decode(const uint8_t buf[], size_t length) { 944| 218| return BigInt::from_bytes(std::span{buf, length}); 945| 218| } _ZN5Botan6BigInt11encode_1363EPhmRKS0_: 1001| 280| static void encode_1363(uint8_t out[], size_t bytes, const BigInt& n) { 1002| 280| n.serialize_to(std::span{out, bytes}); 1003| 280| } _ZNK5Botan6BigInt8_as_spanEv: 1023| 8.65k| std::span _as_span() const { return m_data.const_span(); } _ZNK5Botan6BigInt5_dataEv: 1033| 616k| const word* _data() const { return m_data.const_data(); } _ZN5Botan6BigInt18_assign_from_bytesENSt3__14spanIKhLm18446744073709551615EEE: 1044| 26.8k| void _assign_from_bytes(std::span bytes) { assign_from_bytes(bytes); } _ZN5Botan6BigInt11_from_wordsERNSt3__16vectorImNS_16secure_allocatorImEEEE: 1052| 35.3k| static BigInt _from_words(secure_vector& words) { 1053| 35.3k| BigInt bn; 1054| 35.3k| bn.m_data.swap(words); 1055| 35.3k| return bn; 1056| 35.3k| } _ZN5Botan6BigInt4Data12mutable_dataEv: 1083| 166k| word* mutable_data() { 1084| 166k| invalidate_sig_words(); 1085| 166k| return m_reg.data(); 1086| 166k| } _ZNK5Botan6BigInt4Data10const_dataEv: 1088| 844k| const word* const_data() const { return m_reg.data(); } _ZNK5Botan6BigInt4Data10const_spanEv: 1090| 8.65k| std::span const_span() const { return std::span{m_reg}; } _ZN5Botan6BigInt4Data14mutable_vectorEv: 1092| 5.02k| secure_vector& mutable_vector() { 1093| 5.02k| invalidate_sig_words(); 1094| 5.02k| return m_reg; 1095| 5.02k| } _ZNK5Botan6BigInt4Data11get_word_atEm: 1099| 267k| word get_word_at(size_t n) const { 1100| 267k| if(n < m_reg.size()) { ------------------ | Branch (1100:19): [True: 263k, False: 3.89k] ------------------ 1101| 263k| return m_reg[n]; 1102| 263k| } 1103| 3.89k| return 0; 1104| 267k| } _ZN5Botan6BigInt4Data11set_word_atEmm: 1106| 13.4k| void set_word_at(size_t i, word w) { 1107| 13.4k| invalidate_sig_words(); 1108| 13.4k| if(i >= m_reg.size()) { ------------------ | Branch (1108:19): [True: 13.4k, False: 0] ------------------ 1109| 13.4k| if(w == 0) { ------------------ | Branch (1109:22): [True: 4.27k, False: 9.16k] ------------------ 1110| 4.27k| return; 1111| 4.27k| } 1112| 9.16k| grow_to(i + 1); 1113| 9.16k| } 1114| 9.16k| m_reg[i] = w; 1115| 9.16k| } _ZN5Botan6BigInt4Data9set_wordsEPKmm: 1117| 486| void set_words(const word w[], size_t len) { 1118| 486| invalidate_sig_words(); 1119| 486| m_reg.assign(w, w + len); 1120| 486| } _ZNK5Botan6BigInt4Data7grow_toEm: 1126| 68.3k| void grow_to(size_t n) const { 1127| 68.3k| if(n > size()) { ------------------ | Branch (1127:19): [True: 35.0k, False: 33.3k] ------------------ 1128| 35.0k| if(n <= m_reg.capacity()) { ------------------ | Branch (1128:22): [True: 486, False: 34.5k] ------------------ 1129| 486| m_reg.resize(n); 1130| 34.5k| } else { 1131| 34.5k| m_reg.resize(n + (8 - (n % 8))); 1132| 34.5k| } 1133| 35.0k| } 1134| 68.3k| } _ZNK5Botan6BigInt4Data4sizeEv: 1136| 826k| size_t size() const { return m_reg.size(); } _ZN5Botan6BigInt4Data4swapERS1_: 1151| 170k| void swap(Data& other) noexcept { 1152| 170k| m_reg.swap(other.m_reg); 1153| 170k| std::swap(m_sig_words, other.m_sig_words); 1154| 170k| } _ZN5Botan6BigInt4Data4swapERNSt3__16vectorImNS_16secure_allocatorImEEEE: 1156| 73.6k| void swap(secure_vector& reg) noexcept { 1157| 73.6k| m_reg.swap(reg); 1158| 73.6k| invalidate_sig_words(); 1159| 73.6k| } _ZNK5Botan6BigInt4Data20invalidate_sig_wordsEv: 1161| 258k| void invalidate_sig_words() const noexcept { m_sig_words = sig_words_npos; } _ZNK5Botan6BigInt4Data9sig_wordsEv: 1163| 634k| size_t sig_words() const { 1164| 634k| if(m_sig_words == sig_words_npos) { ------------------ | Branch (1164:19): [True: 125k, False: 509k] ------------------ 1165| 125k| m_sig_words = calc_sig_words(); 1166| 125k| } 1167| 634k| return m_sig_words; 1168| 634k| } _ZN5BotanplERKNS_6BigIntES2_: 1189| 2.24k|inline BigInt operator+(const BigInt& x, const BigInt& y) { 1190| 2.24k| return BigInt::add2(x, y._data(), y.sig_words(), y.sign()); 1191| 2.24k|} _ZN5BotanplERKNS_6BigIntEm: 1199| 1.29k|inline BigInt operator+(const BigInt& x, word y) { 1200| 1.29k| return BigInt::add2(x, &y, 1, BigInt::Positive); 1201| 1.29k|} _ZN5BotanmiERKNS_6BigIntES2_: 1219| 83|inline BigInt operator-(const BigInt& x, const BigInt& y) { 1220| 83| return BigInt::add2(x, y._data(), y.sig_words(), y.reverse_sign()); 1221| 83|} _ZN5BotanmiERKNS_6BigIntEm: 1229| 1.07k|inline BigInt operator-(const BigInt& x, word y) { 1230| 1.07k| return BigInt::add2(x, &y, 1, BigInt::Negative); 1231| 1.07k|} _ZN5BotaneqERKNS_6BigIntES2_: 1313| 1.04k|inline bool operator==(const BigInt& a, const BigInt& b) { 1314| 1.04k| return a.is_equal(b); 1315| 1.04k|} _ZN5BotanneERKNS_6BigIntES2_: 1323| 902|inline bool operator!=(const BigInt& a, const BigInt& b) { 1324| 902| return !a.is_equal(b); 1325| 902|} _ZN5BotangeERKNS_6BigIntES2_: 1343| 4.15k|inline bool operator>=(const BigInt& a, const BigInt& b) { 1344| 4.15k| return (a.cmp(b) >= 0); 1345| 4.15k|} _ZN5BotanltERKNS_6BigIntES2_: 1353| 19.1k|inline bool operator<(const BigInt& a, const BigInt& b) { 1354| 19.1k| return a.is_less_than(b); 1355| 19.1k|} _ZN5BotaneqERKNS_6BigIntEm: 1373| 43.3k|inline bool operator==(const BigInt& a, word b) { 1374| 43.3k| return (a.cmp_word(b) == 0); 1375| 43.3k|} _ZN5BotanneERKNS_6BigIntEm: 1383| 455|inline bool operator!=(const BigInt& a, word b) { 1384| 455| return (a.cmp_word(b) != 0); 1385| 455|} _ZN5BotanleERKNS_6BigIntEm: 1393| 462|inline bool operator<=(const BigInt& a, word b) { 1394| 462| return (a.cmp_word(b) <= 0); 1395| 462|} _ZN5BotangeERKNS_6BigIntEm: 1403| 1.58k|inline bool operator>=(const BigInt& a, word b) { 1404| 1.58k| return (a.cmp_word(b) >= 0); 1405| 1.58k|} _ZN5BotanltERKNS_6BigIntEm: 1413| 5.12k|inline bool operator<(const BigInt& a, word b) { 1414| 5.12k| return (a.cmp_word(b) < 0); 1415| 5.12k|} _ZN5BotangtERKNS_6BigIntEm: 1423| 813|inline bool operator>(const BigInt& a, word b) { 1424| 813| return (a.cmp_word(b) > 0); 1425| 813|} _ZNK5Botan6BigInt9serializeINSt3__16vectorIhNS2_9allocatorIhEEEEEET_m: 790| 13.3k| T serialize(size_t len) const { 791| | // TODO this supports std::vector and secure_vector 792| | // it would be nice if this also could work with std::array as in 793| | // bn.serialize_to>(32); 794| 13.3k| T out(len); 795| 13.3k| this->serialize_to(out); 796| 13.3k| return out; 797| 13.3k| } _ZN5Botan6BigIntaSERKS0_: 201| 8.86k| BigInt& operator=(const BigInt&) = default; _ZN5Botan6BigIntC2ERKS0_: 88| 13.6k| BigInt(const BigInt& other) = default; _ZN5Botan6BigIntC2Ev: 45| 187k| BigInt() = default; _ZNK5Botan6BigInt9serializeINSt3__16vectorIhNS2_9allocatorIhEEEEEET_v: 803| 1.59k| T serialize() const { 804| 1.59k| return serialize(this->bytes()); 805| 1.59k| } _ZN5Botan20Buffered_Computation6updateEPKhm: 35| 477| void update(const uint8_t in[], size_t length) { add_data({in, length}); } _ZN5Botan20Buffered_Computation6updateENSt3__14spanIKhLm18446744073709551615EEE: 41| 78.1k| void update(std::span in) { add_data(in); } _ZN5Botan20Buffered_Computation12final_stdvecEv: 114| 29.7k| std::vector final_stdvec() { return final>(); } _ZN5Botan20Buffered_Computation5finalITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEEET_v: 104| 29.7k| T final() { 105| 29.7k| T output(output_length()); 106| 29.7k| final_result(output); 107| 29.7k| return output; 108| 29.7k| } _ZN5Botan20Buffered_ComputationD2Ev: 169| 20.4k| virtual ~Buffered_Computation() = default; _ZN5Botan20Buffered_Computation5finalITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEEEvRT_: 127| 9| void final(T& out) { 128| 9| out.resize(output_length()); 129| 9| final_result(out); 130| 9| } _ZN5Botan8CurveGFp4swapERS0_: 82| 3.93k| void swap(CurveGFp& other) noexcept { std::swap(m_group, other.m_group); } _ZNK5Botan8CurveGFpeqERKS0_: 84| 1.42k| bool operator==(const CurveGFp& other) const { return (m_group == other.m_group); } _ZN5Botan8CurveGFpC2Ev: 75| 4.61k| CurveGFp() = default; _ZN5Botan17DataSource_MemoryC2ENSt3__14spanIKhLm18446744073709551615EEE: 181| 110k| explicit DataSource_Memory(std::span in) : m_offset(0) { 182| | // Guard against forming a range from a null pointer (eg an empty span) 183| 110k| if(!in.empty()) { ------------------ | Branch (183:13): [True: 106k, False: 3.24k] ------------------ 184| 106k| m_source.assign(in.begin(), in.end()); 185| 106k| } 186| 110k| } _ZN5Botan10DataSourceC2Ev: 107| 392k| DataSource() = default; _ZN5Botan10DataSourceD2Ev: 109| 340k| virtual ~DataSource() = default; _ZN5Botan17DataSource_MemoryC2ENSt3__16vectorIhNS_16secure_allocatorIhEEEE: 175| 992| explicit DataSource_Memory(secure_vector in) : m_source(std::move(in)), m_offset(0) {} _ZN5Botan17DataSource_MemoryC2ERKNSt3__16vectorIhNS1_9allocatorIhEEEE: 192| 3.55k| explicit DataSource_Memory(const std::vector& in) : DataSource_Memory(std::span(in)) {} _ZN5Botan11DER_Encoder12DER_SequenceD2Ev: 504| 98.3k| ~DER_Sequence() = default; _ZN5Botan11DER_Encoder14start_sequenceEv: 86| 29.5k| DER_Encoder& start_sequence() { return start_cons(ASN1_Type::Sequence, ASN1_Class::Universal); } _ZN5Botan11DER_Encoder9raw_bytesENSt3__14spanIKhLm18446744073709551615EEE: 154| 19.0k| DER_Encoder& raw_bytes(std::span val) { return raw_bytes(val.data(), val.size()); } _ZN5Botan11DER_Encoder30encode_octet_aligned_bitstringENSt3__14spanIKhLm18446744073709551615EEENS_9ASN1_TypeENS_10ASN1_ClassE: 212| 9.53k| ASN1_Class class_tag = ASN1_Class::Universal) { 213| 9.53k| return encode_bitstring(bytes, 0, type_tag, class_tag); 214| 9.53k| } _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassENSt3__14spanIKhLm18446744073709551615EEE: 410| 67.5k| DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, std::span rep) { 411| 67.5k| return add_object(type_tag, class_tag, rep.data(), rep.size()); 412| 67.5k| } _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassERKNSt3__16vectorIhNS3_9allocatorIhEEEE: 421| 49.3k| DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, const std::vector& rep) { 422| 49.3k| return add_object(type_tag, class_tag, std::span{rep}); 423| 49.3k| } _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassERKNSt3__16vectorIhNS_16secure_allocatorIhEEEE: 432| 9.53k| DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, const secure_vector& rep) { 433| 9.53k| return add_object(type_tag, class_tag, std::span{rep}); 434| 9.53k| } _ZN5Botan11DER_Encoder12DER_SequenceC2EOS1_: 487| 68.7k| m_type_tag(seq.m_type_tag), 488| 68.7k| m_class_tag(seq.m_class_tag), 489| 68.7k| m_sort_contents(seq.m_sort_contents), 490| 68.7k| m_contents(std::move(seq.m_contents)), 491| 68.7k| m_set_contents(std::move(seq.m_set_contents)) {} _ZNK5Botan13DilithiumMode19is_dilithium_round3Ev: 49| 9| bool is_dilithium_round3() const { return !is_ml_dsa(); } _ZNK5Botan13DilithiumMode4modeEv: 53| 9| Mode mode() const { return m_mode; } _ZNK5Botan7DNSName9to_stringEv: 51| 55| const std::string& to_string() const { return m_name; } _ZN5Botan7DNSNameC2ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEE: 101| 8.81k| explicit DNSName(std::string canonical) : m_name(std::move(canonical)) {} _ZNK5Botan7DNSNamessERKS0_: 84| 46.6k| auto operator<=>(const DNSName&) const = default; _ZNK5Botan14EC_AffinePoint6_innerEv: 340| 928| const EC_AffinePoint_Data& _inner() const { return inner(); } _ZNK5Botan14EC_AffinePoint5innerEv: 357| 4.26k| const EC_AffinePoint_Data& inner() const { return *m_point; } _ZNK5Botan8EC_Group5_dataEv: 604| 6.15k| const std::shared_ptr& _data() const { return m_data; } _ZN5Botan8EC_GroupC2EOS0_: 297| 1.51k| EC_Group(EC_Group&&) = default; _ZN5Botan8EC_PointC2EOS0_: 65| 280| EC_Point(EC_Point&& other) noexcept { this->swap(other); } _ZN5Botan8EC_PointaSEOS0_: 75| 3.29k| EC_Point& operator=(EC_Point&& other) noexcept { 76| 3.29k| if(this != &other) { ------------------ | Branch (76:13): [True: 3.29k, False: 0] ------------------ 77| 3.29k| this->swap(other); 78| 3.29k| } 79| 3.29k| return (*this); 80| 3.29k| } _ZNK5Botan8EC_Point7is_zeroEv: 170| 5.68k| bool is_zero() const { return m_z.is_zero(); } _ZNK5Botan8EC_Point5get_xEv: 248| 2.49k| BOTAN_DEPRECATED("Use affine coordinates only") const BigInt& get_x() const { return m_x; } _ZNK5Botan8EC_Point5get_yEv: 255| 2.49k| BOTAN_DEPRECATED("Use affine coordinates only") const BigInt& get_y() const { return m_y; } _ZNK5Botan8EC_Point4plusERKS0_RNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE: 357| 1.42k| EC_Point plus(const EC_Point& other, std::vector& workspace) const { 358| 1.42k| EC_Point x = (*this); 359| 1.42k| x.add(other, workspace); 360| 1.42k| return x; 361| 1.42k| } _ZNK5Botan8EC_Point9get_curveEv: 380| 4| BOTAN_DEPRECATED("Deprecated no replacement") const CurveGFp& get_curve() const { return m_curve; } _ZN5Botan8EC_PointD2Ev: 82| 7.38k| ~EC_Point() = default; _ZN5Botan8EC_PointC2Ev: 49| 4.01k| EC_Point() = default; _ZN5Botan8EC_PointC2ERKS0_: 60| 1.56k| EC_Point(const EC_Point&) = default; _ZN5Botan8EC_PointaSERKS0_: 70| 1.42k| EC_Point& operator=(const EC_Point&) = default; _ZNK5Botan9EC_Scalar10is_nonzeroEv: 175| 1.83k| bool is_nonzero() const { return !is_zero(); } _ZN5BotanmlERKNS_9EC_ScalarES2_: 246| 1.83k| friend EC_Scalar operator*(const EC_Scalar& x, const EC_Scalar& y) { return x.mul(y); } _ZNK5Botan9EC_Scalar6_innerEv: 282| 2.74k| const EC_Scalar_Data& _inner() const { return inner(); } _ZNK5Botan9EC_Scalar5innerEv: 296| 15.1k| const EC_Scalar_Data& inner() const { return *m_scalar; } _ZN5Botan12EC_PublicKeyC2Ev: 140| 387| EC_PublicKey() = default; _ZN5Botan12EC_PublicKeyD2Ev: 42| 1.32k| ~EC_PublicKey() override = default; _ZN5Botan15ECDSA_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 44| 1.28k| EC_PublicKey(assert_algorithm_identifier(alg_id, "ECDSA"), key_bits) {} _ZN5Botan12EmailAddressC2ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS_7DNSNameE: 69| 297| m_local_part(std::move(local_part)), m_domain(std::move(domain)) {} _ZN5Botan15SmtpUtf8MailboxC2ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS_7DNSNameE: 121| 619| m_local_part(std::move(local_part)), m_domain(std::move(domain)) {} _ZNK5Botan12EmailAddressssERKS0_: 59| 1.36k| auto operator<=>(const EmailAddress&) const = default; _ZNK5Botan15SmtpUtf8MailboxssERKS0_: 111| 3.03k| auto operator<=>(const SmtpUtf8Mailbox&) const = default; _ZNK5Botan9Exception4whatEv: 94| 7.24k| const char* what() const noexcept override { return m_msg.c_str(); } _ZNK5Botan19GOST_3410_PublicKey30_default_x509_signature_formatEv: 59| 266| Signature_Format _default_x509_signature_format() const override { return Signature_Format::Standard; } _ZN5Botan10hex_encodeENSt3__14spanIKhLm18446744073709551615EEEb: 43| 19.0k|inline std::string hex_encode(std::span input, bool uppercase = true) { 44| 19.0k| return hex_encode(input.data(), input.size(), uppercase); 45| 19.0k|} _ZN5Botan11IPv4AddressC2Ej: 29| 495| explicit IPv4Address(uint32_t ip) : m_ip(ip) {} _ZN5Botan11IPv4AddressC2ENSt3__15arrayIhLm4EEE: 41| 6| explicit IPv4Address(std::array ip) : IPv4Address(std::span(ip)) {} _ZNK5Botan11IPv4AddressanERKS0_: 67| 53| IPv4Address operator&(const IPv4Address& other) const { return IPv4Address(m_ip & other.m_ip); } _ZNK5Botan11IPv4Address7addressEv: 79| 4| uint32_t address() const { return m_ip; } _ZNK5Botan11IPv4AddressssERKS0_: 73| 536| auto operator<=>(const IPv4Address&) const = default; _ZN5Botan11IPv6AddressC2ENSt3__15arrayIhLm16EEE: 37| 98| explicit IPv6Address(std::array ip) : m_ip(ip) {} _ZNK5Botan11IPv6Address8to_bytesEv: 82| 14| std::array to_bytes() const { return m_ip; } _ZNK5Botan11IPv6AddressssERKS0_: 73| 1.67k| auto operator<=>(const IPv6Address&) const = default; _ZNK5Botan9KyberMode4modeEv: 60| 3| Mode mode() const { return m_mode; } _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayImLm4EEETkNS1_16contiguous_rangeENS2_4spanIhLm32EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS8_IXsr21__is_primary_templateINS9_Iu14__remove_cvrefIDTclL_ZNSB_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSH_ISP_EESQ_E4type10value_typeEEEEvOSM_RKSC_: 176| 15|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 15| ranges::assert_equal_byte_lengths(out, in); 178| 15| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 15|} _ZN5Botan13typecast_copyINSt3__15arrayImLm4EEETkNS_6ranges16contiguous_rangeENS1_4spanIhLm32EEEQaaaasr3stdE26is_default_constructible_vIT_Esr3stdE23is_trivially_copyable_vIS7_Esr3stdE23is_trivially_copyable_vINS1_11conditionalIXsr21__is_primary_templateINS1_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS1_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS1_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEEES7_RKSC_: 210| 15|inline constexpr ToT typecast_copy(const FromR& src) { 211| 15| ToT dst; // NOLINT(*-member-init) 212| 15| typecast_copy(dst, src); 213| 15| return dst; 214| 15|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayImLm4EEETkNS1_16contiguous_rangeENS2_4spanIKhLm32EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISG_EESH_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS9_IXsr21__is_primary_templateINSA_Iu14__remove_cvrefIDTclL_ZNSC_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSI_ISQ_EESR_E4type10value_typeEEEEvOSN_RKSD_: 176| 15|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 15| ranges::assert_equal_byte_lengths(out, in); 178| 15| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 15|} _ZN5Botan13typecast_copyINSt3__15arrayImLm4EEETkNS_6ranges16contiguous_rangeENS1_4spanIKhLm32EEEQaaaasr3stdE26is_default_constructible_vIT_Esr3stdE23is_trivially_copyable_vIS8_Esr3stdE23is_trivially_copyable_vINS1_11conditionalIXsr21__is_primary_templateINS1_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS1_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS1_26indirectly_readable_traitsISG_EESH_E4type10value_typeEEEES8_RKSD_: 210| 15|inline constexpr ToT typecast_copy(const FromR& src) { 211| 15| ToT dst; // NOLINT(*-member-init) 212| 15| typecast_copy(dst, src); 213| 15| return dst; 214| 15|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeENSt3__14spanIhLm32EEETkNS1_16contiguous_rangeENS2_5arrayImLm4EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEEEvOSL_RKSB_: 176| 15|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 15| ranges::assert_equal_byte_lengths(out, in); 178| 15| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 15|} _ZN5Botan11clear_bytesEPvm: 101| 10.4M|inline constexpr void clear_bytes(void* ptr, size_t bytes) { 102| 10.4M| if(bytes > 0) { ------------------ | Branch (102:7): [True: 10.3M, False: 31.2k] ------------------ 103| 10.3M| std::memset(ptr, 0, bytes); 104| 10.3M| } 105| 10.4M|} _ZN5Botan8copy_memIhQsr3stdE12is_trivial_vIu7__decayIT_EEEEvPS1_PKS1_m: 144| 3.06M|inline constexpr void copy_mem(T* out, const T* in, size_t n) { 145| 3.06M| BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null"); ------------------ | | 110| 3.06M| do { \ | | 111| 3.06M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 112| 5.95M| if((expr1) && !(expr2)) { \ | | ------------------ | | | Branch (112:10): [True: 2.97M, False: 91.7k] | | | Branch (112:23): [True: 2.97M, False: 0] | | | Branch (112:23): [True: 2.97M, False: 0] | | ------------------ | | 113| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 114| 0| Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \ | | 115| 0| } \ | | 116| 3.06M| } while(0) | | ------------------ | | | Branch (116:12): [Folded, False: 3.06M] | | ------------------ ------------------ 146| | 147| 3.06M| if(in != nullptr && out != nullptr && n > 0) { ------------------ | Branch (147:7): [True: 3.06M, False: 6.34k] | Branch (147:24): [True: 3.05M, False: 7.35k] | Branch (147:42): [True: 2.97M, False: 78.0k] ------------------ 148| 2.97M| std::memmove(out, in, sizeof(T) * n); 149| 2.97M| } 150| 3.06M|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayIhLm8EEETkNS1_16contiguous_rangeENS3_ImLm1EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEEEvOSL_RKSB_: 176| 118k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 118k| ranges::assert_equal_byte_lengths(out, in); 178| 118k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 118k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERKNSt3__14spanIhLm8EEETkNS1_16contiguous_rangeENS3_IKmLm1EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISG_EESH_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS9_IXsr21__is_primary_templateINSA_Iu14__remove_cvrefIDTclL_ZNSC_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSI_ISQ_EESR_E4type10value_typeEEEEvOSN_RKSD_: 176| 136k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 136k| ranges::assert_equal_byte_lengths(out, in); 178| 136k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 136k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERKNSt3__14spanIhLm8EEEmQaaaasr3stdE23is_trivially_copyable_vIT0_Entsr3std6rangesE5rangeIS7_Esr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEEEvOSC_RKS7_: 199| 136k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromT& in) { 200| 136k| typecast_copy(out, std::span(&in, 1)); 201| 136k|} _ZN5Botan19secure_scrub_memoryITkNS_6ranges23contiguous_output_rangeERNSt3__16vectorIhNS2_9allocatorIhEEEEEEvOT_: 59| 1.29M|void secure_scrub_memory(ranges::contiguous_output_range auto&& data) { 60| 1.29M| secure_scrub_memory(std::ranges::data(data), ranges::size_bytes(data)); 61| 1.29M|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERKNSt3__14spanIhLm4EEEjQaaaasr3stdE23is_trivially_copyable_vIT0_Entsr3std6rangesE5rangeIS7_Esr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEEEvOSC_RKS7_: 199| 499k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromT& in) { 200| 499k| typecast_copy(out, std::span(&in, 1)); 201| 499k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERKNSt3__14spanIhLm4EEETkNS1_16contiguous_rangeENS3_IKjLm1EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISG_EESH_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS9_IXsr21__is_primary_templateINSA_Iu14__remove_cvrefIDTclL_ZNSC_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSI_ISQ_EESR_E4type10value_typeEEEEvOSN_RKSD_: 176| 499k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 499k| ranges::assert_equal_byte_lengths(out, in); 178| 499k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 499k|} _ZN5Botan9clear_memIhEEvPT_m: 118| 2.97k|inline constexpr void clear_mem(T* ptr, size_t n) { 119| 2.97k| clear_bytes(ptr, sizeof(T) * n); 120| 2.97k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeENSt3__14spanIjLm1EEETkNS1_16contiguous_rangeENS3_IKhLm4EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEEEvOSL_RKSB_: 176| 547|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 547| ranges::assert_equal_byte_lengths(out, in); 178| 547| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 547|} _ZN5Botan13typecast_copyIjTkNS_6ranges16contiguous_rangeENSt3__14spanIKhLm4EEEQaaaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIT_Entsr3std6rangesE5rangeISK_EEEvRSK_RKSA_: 188| 547|inline constexpr void typecast_copy(ToT& out, const FromR& in) { 189| 547| typecast_copy(std::span(&out, 1), in); 190| 547|} _ZN5Botan13typecast_copyIjTkNS_6ranges16contiguous_rangeENSt3__14spanIKhLm4EEEQaaaasr3stdE26is_default_constructible_vIT_Esr3stdE23is_trivially_copyable_vIS6_Esr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEEES6_RKSB_: 210| 547|inline constexpr ToT typecast_copy(const FromR& src) { 211| 547| ToT dst; // NOLINT(*-member-init) 212| 547| typecast_copy(dst, src); 213| 547| return dst; 214| 547|} _ZN5Botan13typecast_copyImTkNS_6ranges16contiguous_rangeENSt3__14spanIKhLm8EEEQaaaasr3stdE26is_default_constructible_vIT_Esr3stdE23is_trivially_copyable_vIS6_Esr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEEES6_RKSB_: 210| 94.6k|inline constexpr ToT typecast_copy(const FromR& src) { 211| 94.6k| ToT dst; // NOLINT(*-member-init) 212| 94.6k| typecast_copy(dst, src); 213| 94.6k| return dst; 214| 94.6k|} _ZN5Botan13typecast_copyImTkNS_6ranges16contiguous_rangeENSt3__14spanIKhLm8EEEQaaaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIT_Entsr3std6rangesE5rangeISK_EEEvRSK_RKSA_: 188| 94.6k|inline constexpr void typecast_copy(ToT& out, const FromR& in) { 189| 94.6k| typecast_copy(std::span(&out, 1), in); 190| 94.6k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm1EEETkNS1_16contiguous_rangeENS3_IKhLm8EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEEEvOSL_RKSB_: 176| 94.6k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 94.6k| ranges::assert_equal_byte_lengths(out, in); 178| 94.6k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 94.6k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeENS3_IKmLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS8_IXsr21__is_primary_templateINS9_Iu14__remove_cvrefIDTclL_ZNSB_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSH_ISP_EESQ_E4type10value_typeEEEEvOSM_RKSC_: 176| 266|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 266| ranges::assert_equal_byte_lengths(out, in); 178| 266| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 266|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERA8_mTkNS1_16contiguous_rangeENSt3__14spanIKhLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS4_11conditionalIXsr21__is_primary_templateINS4_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS4_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS4_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS8_IXsr21__is_primary_templateINS9_Iu14__remove_cvrefIDTclL_ZNSB_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSH_ISP_EESQ_E4type10value_typeEEEEvOSM_RKSC_: 176| 2.66k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 2.66k| ranges::assert_equal_byte_lengths(out, in); 178| 2.66k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 2.66k|} _ZN5Botan8copy_memImQsr3stdE12is_trivial_vIu7__decayIT_EEEEvPS1_PKS1_m: 144| 1.04M|inline constexpr void copy_mem(T* out, const T* in, size_t n) { 145| 1.04M| BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null"); ------------------ | | 110| 1.04M| do { \ | | 111| 1.04M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 112| 2.09M| if((expr1) && !(expr2)) { \ | | ------------------ | | | Branch (112:10): [True: 1.04M, False: 0] | | | Branch (112:23): [True: 1.04M, False: 0] | | | Branch (112:23): [True: 1.04M, False: 0] | | ------------------ | | 113| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 114| 0| Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \ | | 115| 0| } \ | | 116| 1.04M| } while(0) | | ------------------ | | | Branch (116:12): [Folded, False: 1.04M] | | ------------------ ------------------ 146| | 147| 1.04M| if(in != nullptr && out != nullptr && n > 0) { ------------------ | Branch (147:7): [True: 1.04M, False: 0] | Branch (147:24): [True: 1.04M, False: 0] | Branch (147:42): [True: 1.04M, False: 0] ------------------ 148| 1.04M| std::memmove(out, in, sizeof(T) * n); 149| 1.04M| } 150| 1.04M|} _ZN5Botan9clear_memImEEvPT_m: 118| 51.7k|inline constexpr void clear_mem(T* ptr, size_t n) { 119| 51.7k| clear_bytes(ptr, sizeof(T) * n); 120| 51.7k|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeENS3_IKhLm18446744073709551615EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeENS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIST_EEEvOSB_RKSL_: 160| 25.0k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 25.0k| ranges::assert_equal_byte_lengths(out, in); 162| 25.0k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 25.0k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 25.0k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 25.0k, False: 0] ------------------ 165| 25.0k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 25.0k| } 167| 25.0k|} _ZN5Botan13typecast_copyImTkNS_6ranges16contiguous_rangeENSt3__14spanIhLm8EEEQaaaasr3stdE26is_default_constructible_vIT_Esr3stdE23is_trivially_copyable_vIS5_Esr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEEES5_RKSA_: 210| 24.1k|inline constexpr ToT typecast_copy(const FromR& src) { 211| 24.1k| ToT dst; // NOLINT(*-member-init) 212| 24.1k| typecast_copy(dst, src); 213| 24.1k| return dst; 214| 24.1k|} _ZN5Botan13typecast_copyImTkNS_6ranges16contiguous_rangeENSt3__14spanIhLm8EEEQaaaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISC_EESD_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIT_Entsr3std6rangesE5rangeISJ_EEEvRSJ_RKS9_: 188| 24.1k|inline constexpr void typecast_copy(ToT& out, const FromR& in) { 189| 24.1k| typecast_copy(std::span(&out, 1), in); 190| 24.1k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm1EEETkNS1_16contiguous_rangeENS3_IhLm8EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS6_IXsr21__is_primary_templateINS7_Iu14__remove_cvrefIDTclL_ZNS9_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSF_ISN_EESO_E4type10value_typeEEEEvOSK_RKSA_: 176| 24.1k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 24.1k| ranges::assert_equal_byte_lengths(out, in); 178| 24.1k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 24.1k|} _ZN5Botan13typecast_copyItTkNS_6ranges16contiguous_rangeENSt3__14spanIKhLm2EEEQaaaasr3stdE26is_default_constructible_vIT_Esr3stdE23is_trivially_copyable_vIS6_Esr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEEES6_RKSB_: 210| 7.14k|inline constexpr ToT typecast_copy(const FromR& src) { 211| 7.14k| ToT dst; // NOLINT(*-member-init) 212| 7.14k| typecast_copy(dst, src); 213| 7.14k| return dst; 214| 7.14k|} _ZN5Botan13typecast_copyItTkNS_6ranges16contiguous_rangeENSt3__14spanIKhLm2EEEQaaaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIT_Entsr3std6rangesE5rangeISK_EEEvRSK_RKSA_: 188| 7.14k|inline constexpr void typecast_copy(ToT& out, const FromR& in) { 189| 7.14k| typecast_copy(std::span(&out, 1), in); 190| 7.14k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeENSt3__14spanItLm1EEETkNS1_16contiguous_rangeENS3_IKhLm2EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEEEvOSL_RKSB_: 176| 7.14k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 7.14k| ranges::assert_equal_byte_lengths(out, in); 178| 7.14k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 7.14k|} _ZN5Botan9clear_memIjEEvPT_m: 118| 6|inline constexpr void clear_mem(T* ptr, size_t n) { 119| 6| clear_bytes(ptr, sizeof(T) * n); 120| 6|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeERNSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeENS3_IKhLm18446744073709551615EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeENS8_IXsr21__is_primary_templateINS9_Iu14__remove_cvrefIDTclL_ZNSB_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSH_ISP_EESQ_E4type10value_typeEEsr3stdE23is_trivially_copyable_vISU_EEEvOSC_RKSM_: 160| 1.31k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 1.31k| ranges::assert_equal_byte_lengths(out, in); 162| 1.31k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 1.31k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 1.31k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 1.31k, False: 0] ------------------ 165| 1.31k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 1.31k| } 167| 1.31k|} _ZN5Botan9clear_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm18446744073709551615EEEEEvOT_Qsr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRS5_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISD_EESE_E4type10value_typeEE: 132| 8.01k|{ 133| 8.01k| clear_bytes(std::ranges::data(mem), ranges::size_bytes(mem)); 134| 8.01k|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm18446744073709551615EEETkNS1_16contiguous_rangeENS3_IKmLm18446744073709551615EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeENS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIST_EEEvOSB_RKSL_: 160| 6.16k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 6.16k| ranges::assert_equal_byte_lengths(out, in); 162| 6.16k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 6.16k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 6.16k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 6.16k, False: 1] ------------------ 165| 6.16k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 6.16k| } 167| 6.16k|} _ZN5Botan7xor_bufITkNS_6ranges23contiguous_output_rangeIhEENSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeIhEES5_EEvOT_OT0_: 404| 9| ranges::contiguous_range auto&& in) { 405| 9| ranges::assert_equal_byte_lengths(out, in); 406| | 407| 9| std::span o(out); 408| 9| std::span i(in); 409| | 410| 24| for(; o.size_bytes() >= 32; o = o.subspan(32), i = i.subspan(32)) { ------------------ | Branch (410:10): [True: 15, False: 9] ------------------ 411| 15| auto x = typecast_copy>(o.template first<32>()); 412| 15| const auto y = typecast_copy>(i.template first<32>()); 413| | 414| 15| x[0] ^= y[0]; 415| 15| x[1] ^= y[1]; 416| 15| x[2] ^= y[2]; 417| 15| x[3] ^= y[3]; 418| | 419| 15| typecast_copy(o.template first<32>(), x); 420| 15| } 421| | 422| 102| for(size_t off = 0; off != o.size_bytes(); ++off) { ------------------ | Branch (422:24): [True: 93, False: 9] ------------------ 423| 93| o[off] ^= i[off]; 424| 93| } 425| 9|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm6EEETkNS1_16contiguous_rangeENS2_5arrayImLm6EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeENS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIST_EEEvOSB_RKSL_: 160| 1.50k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 1.50k| ranges::assert_equal_byte_lengths(out, in); 162| 1.50k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 1.50k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 1.50k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 1.50k, False: 0] ------------------ 165| 1.50k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 1.50k| } 167| 1.50k|} _ZN5Botan9clear_memITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayImLm18EEEEEvOT_Qsr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRS6_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEE: 132| 10.3M|{ 133| 10.3M| clear_bytes(std::ranges::data(mem), ranges::size_bytes(mem)); 134| 10.3M|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm9EEETkNS1_16contiguous_rangeENS2_5arrayImLm9EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeENS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIST_EEEvOSB_RKSL_: 160| 3.21k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 3.21k| ranges::assert_equal_byte_lengths(out, in); 162| 3.21k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 3.21k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 3.21k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 3.21k, False: 0] ------------------ 165| 3.21k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 3.21k| } 167| 3.21k|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeERNSt3__14spanIhLm28EEETkNS1_16contiguous_rangeENS3_IKhLm28EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeENS8_IXsr21__is_primary_templateINS9_Iu14__remove_cvrefIDTclL_ZNSB_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSH_ISP_EESQ_E4type10value_typeEEsr3stdE23is_trivially_copyable_vISU_EEEvOSC_RKSM_: 160| 270|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 270| ranges::assert_equal_byte_lengths(out, in); 162| 270| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 270] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 270| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 270, False: 0] ------------------ 165| 270| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 270| } 167| 270|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeERNSt3__14spanIhLm66EEETkNS1_16contiguous_rangeENS3_IKhLm66EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeENS8_IXsr21__is_primary_templateINS9_Iu14__remove_cvrefIDTclL_ZNSB_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSH_ISP_EESQ_E4type10value_typeEEsr3stdE23is_trivially_copyable_vISU_EEEvOSC_RKSM_: 160| 1.13k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 1.13k| ranges::assert_equal_byte_lengths(out, in); 162| 1.13k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 1.13k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 1.13k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 1.13k, False: 0] ------------------ 165| 1.13k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 1.13k| } 167| 1.13k|} _ZNK5Botan14Asymmetric_Key40_signature_element_size_for_DER_encodingEv: 148| 476| virtual std::optional _signature_element_size_for_DER_encoding() const { return {}; } _ZN5Botan14Asymmetric_KeyD2Ev: 66| 2.15k| virtual ~Asymmetric_Key() = default; _ZN5Botan6PK_Ops12VerificationD2Ev: 102| 1.44k| virtual ~Verification() = default; _ZN5Botan20PK_Signature_OptionsC2ERKS0_: 59| 752| PK_Signature_Options(const PK_Signature_Options&) = default; _ZN5Botan20PK_Signature_OptionsC2Ev: 54| 504| PK_Signature_Options() = default; _ZN5Botan27PK_Signature_Options_ReaderC2ERKNS_20PK_Signature_OptionsENS0_5UsageE: 140| 504| m_options(options), m_usage(usage) {} _ZNK5Botan27PK_Signature_Options_Reader13hash_functionEv: 54| 238| const std::optional& hash_function() const { 55| 238| note_examined(Option::Hash); 56| 238| return m_options.m_hash_fn; 57| 238| } _ZNK5Botan27PK_Signature_Options_Reader7paddingEv: 69| 476| const std::optional& padding() const { 70| 476| note_examined(Option::Padding); 71| 476| return m_options.m_padding; 72| 476| } _ZNK5Botan27PK_Signature_Options_Reader9salt_sizeEv: 84| 20| const std::optional& salt_size() const { 85| 20| note_examined(Option::SaltSize); 86| 20| return m_options.m_salt_size; 87| 20| } _ZNK5Botan27PK_Signature_Options_Reader29using_deterministic_signatureEv: 94| 238| bool using_deterministic_signature() const { 95| 238| note_examined(Option::Deterministic); 96| 238| return m_options.m_deterministic_sig && m_usage == Usage::Signing; ------------------ | Branch (96:17): [True: 0, False: 238] | Branch (96:50): [True: 0, False: 0] ------------------ 97| 238| } _ZNK5Botan27PK_Signature_Options_Reader10using_hashEv: 104| 238| bool using_hash() const { return hash_function().has_value(); } _ZNK5Botan27PK_Signature_Options_Reader13using_prehashEv: 108| 266| bool using_prehash() const { 109| 266| note_examined(Option::Prehash); 110| 266| return m_options.m_using_prehash; 111| 266| } _ZNK5Botan27PK_Signature_Options_Reader33using_externally_computed_prehashEv: 113| 494| bool using_externally_computed_prehash() const { 114| 494| note_examined(Option::ExternalPrehash); 115| 494| return m_options.m_using_external_prehash; 116| 494| } _ZNK5Botan27PK_Signature_Options_Reader13using_paddingEv: 118| 238| bool using_padding() const { return padding().has_value(); } _ZNK5Botan27PK_Signature_Options_Reader15using_salt_sizeEv: 120| 10| bool using_salt_size() const { return salt_size().has_value(); } _ZNK5Botan27PK_Signature_Options_Reader13note_examinedENS0_6OptionE: 155| 2.74k| void note_examined(Option option) const { m_examined |= static_cast(option); } _ZN5Botan15Key_ConstraintsC2ENS0_4BitsE: 163| 2.79k| Key_Constraints(Key_Constraints::Bits bits) : m_value(bits) {} _ZN5Botan15Key_ConstraintsC2Ej: 165| 1.81k| explicit Key_Constraints(uint32_t bits) : m_value(bits) {} _ZN5Botan15Key_ConstraintsC2Ev: 167| 11.2k| Key_Constraints() : m_value(0) {} _ZNK5Botan15Key_Constraints8includesENS0_4BitsE: 187| 679| bool includes(Key_Constraints::Bits other) const { return (m_value & other) == other; } _ZNK5Botan15Key_Constraints8includesES0_: 189| 32| bool includes(Key_Constraints other) const { return (m_value & other.m_value) == other.m_value; } _ZNK5Botan15Key_Constraints5emptyEv: 194| 1.91k| bool empty() const { return m_value == 0; } _ZN5Botan11ReasonFlagsC2Et: 248| 11| explicit ReasonFlags(uint16_t bits) : m_value(bits) { 249| 11| if((m_value & static_cast(~DefinedReasonBits)) != 0) { ------------------ | Branch (249:13): [True: 3, False: 8] ------------------ 250| 3| throw Decoding_Error("ReasonFlags contains undefined reason bits"); 251| 3| } 252| 8| if(m_value == 0) { ------------------ | Branch (252:13): [True: 5, False: 3] ------------------ 253| 5| throw Decoding_Error("ReasonFlags must have at least one defined reason"); 254| 5| } 255| 8| } _ZN5Botan18X509_Serial_NumberC2Ev: 70| 11.9k| X509_Serial_Number() : m_contents{0x00} {} _ZNK5Botan7X509_DN8get_bitsEv: 198| 20.4k| const std::vector& get_bits() const { return m_dn_bits; } _ZNK5Botan7X509_DN4rdnsEv: 229| 51| const std::vector>>& rdns() const { return m_rdn; } _ZNK5Botan7X509_DN16_canonical_bytesEv: 274| 63.4k| const std::vector& _canonical_bytes() const { return m_canonical_dn_bits; } _ZNK5Botan15AlternativeName14OtherNameValue3oidEv: 309| 110k| const OID& oid() const { return m_oid; } _ZNK5Botan15AlternativeName14OtherNameValueltERKS1_: 313| 32.6k| bool operator<(const OtherNameValue& other) const { 314| 32.6k| if(oid() != other.oid()) { ------------------ | Branch (314:19): [True: 22.5k, False: 10.1k] ------------------ 315| 22.5k| return oid() < other.oid(); 316| 22.5k| } 317| 10.1k| return m_value < other.m_value; 318| 32.6k| } _ZN5Botan15AlternativeName14OtherNameValueC2ERKNS_3OIDENSt3__16vectorIhNS5_9allocatorIhEEEE: 323| 7.69k| OtherNameValue(const OID& oid, std::vector value) : m_oid(oid), m_value(std::move(value)) {} _ZN5Botan15AlternativeName16add_ipv4_addressEj: 372| 147| BOTAN_DEPRECATED("Use variant taking IPv4Address") void add_ipv4_address(uint32_t ipv4) { 373| 147| this->add_ipv4_address(IPv4Address(ipv4)); 374| 147| } _ZNK5Botan15AlternativeName9uri_namesEv: 389| 238| const std::set& uri_names() const { return m_uri; } _ZNK5Botan15AlternativeName15directory_namesEv: 441| 345| const std::set& directory_names() const { return m_dn_names; } _ZNK5Botan11GeneralName9type_codeEv: 594| 140| NameType type_code() const { return m_type; } _ZN5Botan11GeneralName15EmailConstraintC2ENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEE: 645| 20| explicit EmailConstraint(std::string value) : m_value(std::move(value)) {} _ZN5Botan11GeneralName13DNSConstraintC2ENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEE: 663| 16| explicit DNSConstraint(std::string value) : m_value(std::move(value)) {} _ZN5Botan11GeneralName13URIConstraintC2ENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEE: 681| 9| explicit URIConstraint(std::string value) : m_value(std::move(value)) {} _ZNK5Botan14GeneralSubtree4baseEv: 735| 140| const GeneralName& base() const { return m_base; } _ZNK5Botan10Extensions18get_extension_oidsEv: 901| 17| const std::vector& get_extension_oids() const { return m_extension_oids; } _ZN5Botan10Extensions15Extensions_InfoC2EbNSt3__16vectorIhNS2_9allocatorIhEEEENS2_10unique_ptrINS_21Certificate_ExtensionENS2_14default_deleteIS8_EEEE: 1049| 27.9k| m_obj(std::move(ext)), m_bits(std::move(encoding)), m_critical(critical) {} _ZN5Botan7X509_DNC2Ev: 159| 23.2k| X509_DN() = default; _ZN5Botan10ExtensionsC2Ev: 1027| 11.2k| Extensions() = default; _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension16Authority_Key_IDEEEPKT_RKNS_3OIDE: 882| 9.53k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 9.53k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 1.78k, False: 7.74k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 1.78k| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 881, False: 904] ------------------ 886| 881| return nullptr; 887| 904| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 904, False: 0] ------------------ 888| 904| return extn_as_T; 889| 904| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 1.78k| } 893| | 894| 7.74k| return nullptr; 895| 9.53k| } _ZN5Botan10ExtensionsD2Ev: 1035| 11.2k| ~Extensions() override = default; _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension23CRL_Distribution_PointsEEEPKT_RKNS_3OIDE: 882| 9.53k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 9.53k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 232, False: 9.30k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 232| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 184, False: 48] ------------------ 886| 184| return nullptr; 887| 184| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 48, False: 0] ------------------ 888| 48| return extn_as_T; 889| 48| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 232| } 893| | 894| 9.30k| return nullptr; 895| 9.53k| } _ZN5Botan15NameConstraintsC2Ev: 753| 11.5k| NameConstraints() = default; _ZN5Botan21Certificate_ExtensionD2Ev: 856| 36.3k| virtual ~Certificate_Extension() = default; _ZN5Botan15AlternativeNameC2Ev: 336| 25.8k| AlternativeName() = default; _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension17Basic_ConstraintsEEEPKT_RKNS_3OIDE: 882| 9.53k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 9.53k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 3.35k, False: 6.17k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 3.35k| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 1.59k, False: 1.76k] ------------------ 886| 1.59k| return nullptr; 887| 1.76k| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 1.76k, False: 0] ------------------ 888| 1.76k| return extn_as_T; 889| 1.76k| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 3.35k| } 893| | 894| 6.17k| return nullptr; 895| 9.53k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension28Authority_Information_AccessEEEPKT_RKNS_3OIDE: 882| 9.53k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 9.53k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 1.11k, False: 8.41k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 1.11k| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 905, False: 211] ------------------ 886| 905| return nullptr; 887| 905| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 211, False: 0] ------------------ 888| 211| return extn_as_T; 889| 211| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 1.11k| } 893| | 894| 8.41k| return nullptr; 895| 9.53k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension9Key_UsageEEEPKT_RKNS_3OIDE: 882| 9.53k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 9.53k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 2.44k, False: 7.09k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 2.44k| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 854, False: 1.58k] ------------------ 886| 854| return nullptr; 887| 1.58k| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 1.58k, False: 0] ------------------ 888| 1.58k| return extn_as_T; 889| 1.58k| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 2.44k| } 893| | 894| 7.09k| return nullptr; 895| 9.53k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension14Subject_Key_IDEEEPKT_RKNS_3OIDE: 882| 9.53k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 9.53k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 2.50k, False: 7.02k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 2.50k| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 404, False: 2.10k] ------------------ 886| 404| return nullptr; 887| 2.10k| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 2.10k, False: 0] ------------------ 888| 2.10k| return extn_as_T; 889| 2.10k| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 2.50k| } 893| | 894| 7.02k| return nullptr; 895| 9.53k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension16Name_ConstraintsEEEPKT_RKNS_3OIDE: 882| 9.53k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 9.53k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 185, False: 9.34k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 185| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 161, False: 24] ------------------ 886| 161| return nullptr; 887| 161| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 24, False: 0] ------------------ 888| 24| return extn_as_T; 889| 24| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 185| } 893| | 894| 9.34k| return nullptr; 895| 9.53k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension18Extended_Key_UsageEEEPKT_RKNS_3OIDE: 882| 9.53k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 9.53k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 1.48k, False: 8.04k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 1.48k| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 805, False: 679] ------------------ 886| 805| return nullptr; 887| 805| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 679, False: 0] ------------------ 888| 679| return extn_as_T; 889| 679| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 1.48k| } 893| | 894| 8.04k| return nullptr; 895| 9.53k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension23Issuer_Alternative_NameEEEPKT_RKNS_3OIDE: 882| 9.53k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 9.53k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 144, False: 9.38k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 144| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 125, False: 19] ------------------ 886| 125| return nullptr; 887| 125| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 19, False: 0] ------------------ 888| 19| return extn_as_T; 889| 19| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 144| } 893| | 894| 9.38k| return nullptr; 895| 9.53k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension24Subject_Alternative_NameEEEPKT_RKNS_3OIDE: 882| 9.53k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 9.53k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 605, False: 8.92k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 605| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 507, False: 98] ------------------ 886| 507| return nullptr; 887| 507| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 98, False: 0] ------------------ 888| 98| return extn_as_T; 889| 98| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 605| } 893| | 894| 8.92k| return nullptr; 895| 9.53k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension20Certificate_PoliciesEEEPKT_RKNS_3OIDE: 882| 9.53k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 9.53k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 50, False: 9.48k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 50| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 27, False: 23] ------------------ 886| 27| return nullptr; 887| 27| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 23, False: 0] ------------------ 888| 23| return extn_as_T; 889| 23| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 50| } 893| | 894| 9.48k| return nullptr; 895| 9.53k| } _ZN5Botan11GeneralNameC2Ev: 562| 477| BOTAN_DEPRECATED("Deprecated use NameConstraints") GeneralName() = default; _ZN5Botan11GeneralName15EmailConstraintC2Ev: 636| 477| EmailConstraint() = default; _ZNK5Botan10PSS_Params10hash_algidEv: 59| 22| const AlgorithmIdentifier& hash_algid() const { return m_hash; } _ZNK5Botan10PSS_Params9mgf_algidEv: 64| 11| const AlgorithmIdentifier& mgf_algid() const { return m_mgf; } _ZNK5Botan10PSS_Params14mgf_hash_algidEv: 69| 11| const AlgorithmIdentifier& mgf_hash_algid() const { return m_mgf_hash; } _ZNK5Botan10PSS_Params13trailer_fieldEv: 79| 10| size_t trailer_field() const { return m_trailer_field; } _ZNK5Botan10PSS_Params11salt_lengthEv: 74| 10| size_t salt_length() const { return m_salt_len; } _ZN5Botan11PK_Verifier6updateENSt3__14spanIKhLm18446744073709551615EEE: 378| 2.33k| void update(std::span in) { update(in.data(), in.size()); } _ZN5Botan11PK_Verifier15check_signatureENSt3__14spanIKhLm18446744073709551615EEE: 401| 1.16k| bool check_signature(std::span sig) { return check_signature(sig.data(), sig.size()); } _ZN5Botan6ranges24assert_exact_byte_lengthILm32ETkNS0_14spanable_rangeENSt3__14spanIhLm32EEEEEvRKT0_: 77| 15|inline constexpr void assert_exact_byte_length(const R& r) { 78| 15| const std::span s{r}; 79| 15| if constexpr(statically_spanable_range) { 80| 15| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 15|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayImLm4EEETpTkNS0_14spanable_rangeEJNS2_4spanIhLm32EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 15|{ 101| 15| const std::span s0{r0}; 102| | 103| 15| if constexpr(statically_spanable_range) { 104| 15| constexpr size_t expected_size = s0.size_bytes(); 105| 15| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 15|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__15arrayImLm4EEEEEmRKT_: 59| 30|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 30| return std::span{r}.size_bytes(); 61| 30|} _ZN5Botan6ranges24assert_exact_byte_lengthILm32ETkNS0_14spanable_rangeENSt3__14spanIKhLm32EEEEEvRKT0_: 77| 15|inline constexpr void assert_exact_byte_length(const R& r) { 78| 15| const std::span s{r}; 79| 15| if constexpr(statically_spanable_range) { 80| 15| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 15|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayImLm4EEETpTkNS0_14spanable_rangeEJNS2_4spanIKhLm32EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 15|{ 101| 15| const std::span s0{r0}; 102| | 103| 15| if constexpr(statically_spanable_range) { 104| 15| constexpr size_t expected_size = s0.size_bytes(); 105| 15| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 15|} _ZN5Botan6ranges24assert_exact_byte_lengthILm32ETkNS0_14spanable_rangeENSt3__15arrayImLm4EEEEEvRKT0_: 77| 285|inline constexpr void assert_exact_byte_length(const R& r) { 78| 285| const std::span s{r}; 79| 285| if constexpr(statically_spanable_range) { 80| 285| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 285|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm32EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm4EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 15|{ 101| 15| const std::span s0{r0}; 102| | 103| 15| if constexpr(statically_spanable_range) { 104| 15| constexpr size_t expected_size = s0.size_bytes(); 105| 15| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 15|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm32EEEEEmRKT_: 59| 15|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 15| return std::span{r}.size_bytes(); 61| 15|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 26.4k|{ 101| 26.4k| const std::span s0{r0}; 102| | 103| | if constexpr(statically_spanable_range) { 104| | constexpr size_t expected_size = s0.size_bytes(); 105| | (assert_exact_byte_length(rs), ...); 106| 26.4k| } else { 107| 26.4k| const size_t expected_size = s0.size_bytes(); 108| 26.4k| const bool correct_size = 109| 26.4k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 26.4k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 26.4k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 26.4k| } 115| 26.4k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm8EEETpTkNS0_14spanable_rangeEJNS3_ImLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 236k|{ 101| 236k| const std::span s0{r0}; 102| | 103| 236k| if constexpr(statically_spanable_range) { 104| 236k| constexpr size_t expected_size = s0.size_bytes(); 105| 236k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 236k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__15arrayImLm1EEEEEvRKT0_: 77| 236k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 236k| const std::span s{r}; 79| 236k| if constexpr(statically_spanable_range) { 80| 236k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 236k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__15arrayIhLm8EEEEEmRKT_: 59| 118k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 118k| return std::span{r}.size_bytes(); 61| 118k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIhLm8EEEEEvRKT0_: 77| 195k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 195k| const std::span s{r}; 79| 195k| if constexpr(statically_spanable_range) { 80| 195k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 195k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIKmLm1EEEEEvRKT0_: 77| 136k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 136k| const std::span s{r}; 79| 136k| if constexpr(statically_spanable_range) { 80| 136k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 136k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm8EEETpTkNS0_14spanable_rangeEJNS3_IKmLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 136k|{ 101| 136k| const std::span s0{r0}; 102| | 103| 136k| if constexpr(statically_spanable_range) { 104| 136k| constexpr size_t expected_size = s0.size_bytes(); 105| 136k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 136k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm8EEEEEmRKT_: 59| 136k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 136k| return std::span{r}.size_bytes(); 61| 136k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__16vectorIhNS2_9allocatorIhEEEEEEmRKT_: 59| 1.29M|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 1.29M| return std::span{r}.size_bytes(); 61| 1.29M|} _ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__14spanIhLm4EEEEEvRKT0_: 77| 998k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 998k| const std::span s{r}; 79| 998k| if constexpr(statically_spanable_range) { 80| 998k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 998k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm4EEETpTkNS0_14spanable_rangeEJNS3_IKjLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 499k|{ 101| 499k| const std::span s0{r0}; 102| | 103| 499k| if constexpr(statically_spanable_range) { 104| 499k| constexpr size_t expected_size = s0.size_bytes(); 105| 499k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 499k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__14spanIKjLm1EEEEEvRKT0_: 77| 499k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 499k| const std::span s{r}; 79| 499k| if constexpr(statically_spanable_range) { 80| 499k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 499k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm4EEEEEmRKT_: 59| 499k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 499k| return std::span{r}.size_bytes(); 61| 499k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKjLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 76.7k|{ 101| 76.7k| const std::span s0{r0}; 102| | 103| | if constexpr(statically_spanable_range) { 104| | constexpr size_t expected_size = s0.size_bytes(); 105| | (assert_exact_byte_length(rs), ...); 106| 76.7k| } else { 107| 76.7k| const size_t expected_size = s0.size_bytes(); 108| 76.7k| const bool correct_size = 109| 76.7k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 76.7k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 76.7k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 76.7k| } 115| 76.7k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEEEEmRKT_: 59| 53.0k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 53.0k| return std::span{r}.size_bytes(); 61| 53.0k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__14spanIKhLm4EEEEEvRKT0_: 77| 1.09k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 1.09k| const std::span s{r}; 79| 1.09k| if constexpr(statically_spanable_range) { 80| 1.09k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 1.09k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIjLm1EEETpTkNS0_14spanable_rangeEJNS3_IKhLm4EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 547|{ 101| 547| const std::span s0{r0}; 102| | 103| 547| if constexpr(statically_spanable_range) { 104| 547| constexpr size_t expected_size = s0.size_bytes(); 105| 547| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 547|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIjLm1EEEEEmRKT_: 59| 547|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 547| return std::span{r}.size_bytes(); 61| 547|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIKhLm8EEEEEvRKT0_: 77| 189k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 189k| const std::span s{r}; 79| 189k| if constexpr(statically_spanable_range) { 80| 189k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 189k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm1EEETpTkNS0_14spanable_rangeEJNS3_IKhLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 94.6k|{ 101| 94.6k| const std::span s0{r0}; 102| | 103| 94.6k| if constexpr(statically_spanable_range) { 104| 94.6k| constexpr size_t expected_size = s0.size_bytes(); 105| 94.6k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 94.6k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm1EEEEEmRKT_: 59| 118k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 118k| return std::span{r}.size_bytes(); 61| 118k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKmLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 695|{ 101| 695| const std::span s0{r0}; 102| | 103| | if constexpr(statically_spanable_range) { 104| | constexpr size_t expected_size = s0.size_bytes(); 105| | (assert_exact_byte_length(rs), ...); 106| 695| } else { 107| 695| const size_t expected_size = s0.size_bytes(); 108| 695| const bool correct_size = 109| 695| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 695| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 695] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 695| } 115| 695|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm18446744073709551615EEEEEmRKT_: 59| 20.3k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 20.3k| return std::span{r}.size_bytes(); 61| 20.3k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeEA8_mTpTkNS0_14spanable_rangeEJNSt3__14spanIKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 2.66k|{ 101| 2.66k| const std::span s0{r0}; 102| | 103| 2.66k| if constexpr(statically_spanable_range) { 104| 2.66k| constexpr size_t expected_size = s0.size_bytes(); 105| 2.66k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 2.66k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm64ETkNS0_14spanable_rangeENSt3__14spanIKhLm18446744073709551615EEEEEvRKT0_: 77| 2.66k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 2.66k| const std::span s{r}; 79| | if constexpr(statically_spanable_range) { 80| | static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| 2.66k| } else { 82| 2.66k| if(s.size_bytes() != expected) { ------------------ | Branch (82:10): [True: 0, False: 2.66k] ------------------ 83| 0| memory_region_size_violation(); 84| 0| } 85| 2.66k| } 86| 2.66k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeEA8_mEEmRKT_: 59| 2.66k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 2.66k| return std::span{r}.size_bytes(); 61| 2.66k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__15arrayIhLm8EEEEEvRKT0_: 77| 24.1k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 24.1k| const std::span s{r}; 79| 24.1k| if constexpr(statically_spanable_range) { 80| 24.1k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 24.1k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm1EEETpTkNS0_14spanable_rangeEJNS3_IhLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 24.1k|{ 101| 24.1k| const std::span s0{r0}; 102| | 103| 24.1k| if constexpr(statically_spanable_range) { 104| 24.1k| constexpr size_t expected_size = s0.size_bytes(); 105| 24.1k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 24.1k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm2ETkNS0_14spanable_rangeENSt3__14spanIKhLm2EEEEEvRKT0_: 77| 14.2k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 14.2k| const std::span s{r}; 79| 14.2k| if constexpr(statically_spanable_range) { 80| 14.2k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 14.2k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanItLm1EEETpTkNS0_14spanable_rangeEJNS3_IKhLm2EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 7.14k|{ 101| 7.14k| const std::span s0{r0}; 102| | 103| 7.14k| if constexpr(statically_spanable_range) { 104| 7.14k| constexpr size_t expected_size = s0.size_bytes(); 105| 7.14k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 7.14k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanItLm1EEEEEmRKT_: 59| 7.14k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 7.14k| return std::span{r}.size_bytes(); 61| 7.14k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__15arrayIhLm4EEEEEvRKT0_: 77| 6|inline constexpr void assert_exact_byte_length(const R& r) { 78| 6| const std::span s{r}; 79| 6| if constexpr(statically_spanable_range) { 80| 6| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 6|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJS4_EEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 9|{ 101| 9| const std::span s0{r0}; 102| | 103| | if constexpr(statically_spanable_range) { 104| | constexpr size_t expected_size = s0.size_bytes(); 105| | (assert_exact_byte_length(rs), ...); 106| 9| } else { 107| 9| const size_t expected_size = s0.size_bytes(); 108| 9| const bool correct_size = 109| 9| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 9| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 9] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 9| } 115| 9|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKmLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 6.16k|{ 101| 6.16k| const std::span s0{r0}; 102| | 103| | if constexpr(statically_spanable_range) { 104| | constexpr size_t expected_size = s0.size_bytes(); 105| | (assert_exact_byte_length(rs), ...); 106| 6.16k| } else { 107| 6.16k| const size_t expected_size = s0.size_bytes(); 108| 6.16k| const bool correct_size = 109| 6.16k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 6.16k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 6.16k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 6.16k| } 115| 6.16k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm6EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm6EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 1.50k|{ 101| 1.50k| const std::span s0{r0}; 102| | 103| 1.50k| if constexpr(statically_spanable_range) { 104| 1.50k| constexpr size_t expected_size = s0.size_bytes(); 105| 1.50k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 1.50k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm48ETkNS0_14spanable_rangeENSt3__15arrayImLm6EEEEEvRKT0_: 77| 3.00k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 3.00k| const std::span s{r}; 79| 3.00k| if constexpr(statically_spanable_range) { 80| 3.00k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 3.00k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm6EEEEEmRKT_: 59| 3.00k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 3.00k| return std::span{r}.size_bytes(); 61| 3.00k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm48EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm6EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 1.50k|{ 101| 1.50k| const std::span s0{r0}; 102| | 103| 1.50k| if constexpr(statically_spanable_range) { 104| 1.50k| constexpr size_t expected_size = s0.size_bytes(); 105| 1.50k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 1.50k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__15arrayImLm18EEEEEmRKT_: 59| 10.3M|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 10.3M| return std::span{r}.size_bytes(); 61| 10.3M|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm9EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm9EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 3.21k|{ 101| 3.21k| const std::span s0{r0}; 102| | 103| 3.21k| if constexpr(statically_spanable_range) { 104| 3.21k| constexpr size_t expected_size = s0.size_bytes(); 105| 3.21k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 3.21k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm72ETkNS0_14spanable_rangeENSt3__15arrayImLm9EEEEEvRKT0_: 77| 5.66k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 5.66k| const std::span s{r}; 79| 5.66k| if constexpr(statically_spanable_range) { 80| 5.66k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 5.66k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm9EEEEEmRKT_: 59| 6.43k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 6.43k| return std::span{r}.size_bytes(); 61| 6.43k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm72EEETpTkNS0_14spanable_rangeEJNS3_ImLm9EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 2.44k|{ 101| 2.44k| const std::span s0{r0}; 102| | 103| 2.44k| if constexpr(statically_spanable_range) { 104| 2.44k| constexpr size_t expected_size = s0.size_bytes(); 105| 2.44k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 2.44k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm32EEETpTkNS0_14spanable_rangeEJNS3_ImLm4EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 270|{ 101| 270| const std::span s0{r0}; 102| | 103| 270| if constexpr(statically_spanable_range) { 104| 270| constexpr size_t expected_size = s0.size_bytes(); 105| 270| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 270|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm28EEETpTkNS0_14spanable_rangeEJNS3_IKhLm28EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 270|{ 101| 270| const std::span s0{r0}; 102| | 103| 270| if constexpr(statically_spanable_range) { 104| 270| constexpr size_t expected_size = s0.size_bytes(); 105| 270| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 270|} _ZN5Botan6ranges24assert_exact_byte_lengthILm28ETkNS0_14spanable_rangeENSt3__14spanIKhLm28EEEEEvRKT0_: 77| 270|inline constexpr void assert_exact_byte_length(const R& r) { 78| 270| const std::span s{r}; 79| 270| if constexpr(statically_spanable_range) { 80| 270| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 270|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm28EEEEEmRKT_: 59| 540|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 540| return std::span{r}.size_bytes(); 61| 540|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm66EEETpTkNS0_14spanable_rangeEJNS3_IKhLm66EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 1.13k|{ 101| 1.13k| const std::span s0{r0}; 102| | 103| 1.13k| if constexpr(statically_spanable_range) { 104| 1.13k| constexpr size_t expected_size = s0.size_bytes(); 105| 1.13k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 1.13k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm66ETkNS0_14spanable_rangeENSt3__14spanIKhLm66EEEEEvRKT0_: 77| 1.13k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 1.13k| const std::span s{r}; 79| 1.13k| if constexpr(statically_spanable_range) { 80| 1.13k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 1.13k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm66EEEEEmRKT_: 59| 2.26k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 2.26k| return std::span{r}.size_bytes(); 61| 2.26k|} _ZN5Botan16secure_allocatorIhE10deallocateEPhm: 102| 190k| void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); } _ZN5Botan16secure_allocatorIhE8allocateEm: 95| 190k| T* allocate(std::size_t n) { return static_cast(allocate_memory(n, sizeof(T))); } _ZN5Botan16secure_allocatorImE10deallocateEPmm: 102| 172k| void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); } _ZN5Botan16secure_allocatorImE8allocateEm: 95| 172k| T* allocate(std::size_t n) { return static_cast(allocate_memory(n, sizeof(T))); } _ZN5BotanneIhhEEbRKNS_16secure_allocatorIT_EERKNS1_IT0_EE: 123| 2.03k|inline bool operator!=(const secure_allocator& /*a*/, const secure_allocator& /*b*/) { 124| 2.03k| return false; 125| 2.03k|} _ZN5BotanpLIhNS_16secure_allocatorIhEES2_EERNSt3__16vectorIT_T0_EES8_RKNS4_IS5_T1_EE: 168| 8|std::vector& operator+=(std::vector& out, const std::vector& in) { 169| 8| out.insert(out.end(), in.begin(), in.end()); 170| 8| return out; 171| 8|} _ZN5BotanpLIhNS_16secure_allocatorIhEEmEERNSt3__16vectorIT_T0_EES8_RKNS3_4pairIPKS5_T1_EE: 204| 97.3k|std::vector& operator+=(std::vector& out, const std::pair& in) { 205| 97.3k| if(in.second > 0) { ------------------ | Branch (205:7): [True: 93.6k, False: 3.69k] ------------------ 206| 93.6k| out.insert(out.end(), in.first, in.first + in.second); 207| 93.6k| } 208| 97.3k| return out; 209| 97.3k|} _ZN5Botan16secure_allocatorIjE10deallocateEPjm: 102| 19.7k| void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); } _ZN5Botan16secure_allocatorIjE8allocateEm: 95| 19.7k| T* allocate(std::size_t n) { return static_cast(allocate_memory(n, sizeof(T))); } _ZN5Botan7zeroiseImNS_16secure_allocatorImEEEEvRNSt3__16vectorIT_T0_EE: 241| 532|void zeroise(std::vector& vec) { 242| 4.78k| for(size_t i = 0; i != vec.size(); ++i) { ------------------ | Branch (242:22): [True: 4.25k, False: 532] ------------------ 243| 4.25k| vec[i] = static_cast(0); 244| 4.25k| } 245| 532|} _ZNK5Botan18Sphincs_Parameters16public_key_bytesEv: 195| 12| uint32_t public_key_bytes() const { return m_n * 2; } _ZNK5Botan6detail29Container_Strong_Adapter_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEE4sizeEv: 182| 3| size_type size() const noexcept(noexcept(this->get().size())) { return this->get().size(); } _ZNKR5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEE3getEv: 85| 3| constexpr const T& get() const& { return m_value; } _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEED2Ev: 73| 33| ~Strong_Base() = default; _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEC2Ev: 57| 24| Strong_Base() = default; _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEC2ES6_: 77| 3| constexpr explicit Strong_Base(T v) : m_value(std::move(v)) {} _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEC2EOS7_: 63| 6| Strong_Base(Strong_Base&&) noexcept = default; _ZN5Botan6detail14Strong_AdapterINSt3__16vectorIhNS2_9allocatorIhEEEEEC2ENS2_4spanIKhLm18446744073709551615EEE: 241| 3| Strong_Adapter(T(span.begin(), span.end())) {} _ZN5Botan18unwrap_strong_typeIRNSt3__16vectorIhNS1_9allocatorIhEEEEEEDcOT_: 119| 180k|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) { 120| 180k| if constexpr(!concepts::strong_type>) { 121| | // If the parameter type isn't a strong type, return it as is. 122| 180k| return std::forward(t); 123| | } else { 124| | // Unwrap the strong type and return the underlying value. 125| | return std::forward(t).get(); 126| | } 127| 180k|} _ZN5Botan18unwrap_strong_typeIRmEEDcOT_: 119| 136k|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) { 120| 136k| if constexpr(!concepts::strong_type>) { 121| | // If the parameter type isn't a strong type, return it as is. 122| 136k| return std::forward(t); 123| | } else { 124| | // Unwrap the strong type and return the underlying value. 125| | return std::forward(t).get(); 126| | } 127| 136k|} _ZN5Botan16wrap_strong_typeIjRKjQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS3_Esr3stdE18constructible_fromINS3_12wrapped_typeES4_EEEDcOS4_: 144| 338|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 145| 338| if constexpr(std::same_as, T>) { 146| | // Noop, if the parameter type already is the desired return type. 147| 338| return std::forward(t); 148| | } else if constexpr(std::constructible_from) { 149| | // Implicit conversion from the parameter type to the return type. 150| | return T{std::forward(t)}; 151| | } else { 152| | // Explicitly calling the wrapped type's constructor to support 153| | // implicit conversions on types that mark their constructors as explicit. 154| | static_assert(concepts::strong_type && std::constructible_from); 155| | return T{typename T::wrapped_type{std::forward(t)}}; 156| | } 157| 338|} _ZN5Botan16wrap_strong_typeItRKtQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS3_Esr3stdE18constructible_fromINS3_12wrapped_typeES4_EEEDcOS4_: 144| 11|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 145| 11| if constexpr(std::same_as, T>) { 146| | // Noop, if the parameter type already is the desired return type. 147| 11| return std::forward(t); 148| | } else if constexpr(std::constructible_from) { 149| | // Implicit conversion from the parameter type to the return type. 150| | return T{std::forward(t)}; 151| | } else { 152| | // Explicitly calling the wrapped type's constructor to support 153| | // implicit conversions on types that mark their constructors as explicit. 154| | static_assert(concepts::strong_type && std::constructible_from); 155| | return T{typename T::wrapped_type{std::forward(t)}}; 156| | } 157| 11|} _ZN5Botan18unwrap_strong_typeIRjEEDcOT_: 119| 499k|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) { 120| 499k| if constexpr(!concepts::strong_type>) { 121| | // If the parameter type isn't a strong type, return it as is. 122| 499k| return std::forward(t); 123| | } else { 124| | // Unwrap the strong type and return the underlying value. 125| | return std::forward(t).get(); 126| | } 127| 499k|} _ZN5Botan16wrap_strong_typeIjRjQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_: 144| 547|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 145| 547| if constexpr(std::same_as, T>) { 146| | // Noop, if the parameter type already is the desired return type. 147| 547| return std::forward(t); 148| | } else if constexpr(std::constructible_from) { 149| | // Implicit conversion from the parameter type to the return type. 150| | return T{std::forward(t)}; 151| | } else { 152| | // Explicitly calling the wrapped type's constructor to support 153| | // implicit conversions on types that mark their constructors as explicit. 154| | static_assert(concepts::strong_type && std::constructible_from); 155| | return T{typename T::wrapped_type{std::forward(t)}}; 156| | } 157| 547|} _ZN5Botan16wrap_strong_typeImRmQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_: 144| 118k|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 145| 118k| if constexpr(std::same_as, T>) { 146| | // Noop, if the parameter type already is the desired return type. 147| 118k| return std::forward(t); 148| | } else if constexpr(std::constructible_from) { 149| | // Implicit conversion from the parameter type to the return type. 150| | return T{std::forward(t)}; 151| | } else { 152| | // Explicitly calling the wrapped type's constructor to support 153| | // implicit conversions on types that mark their constructors as explicit. 154| | static_assert(concepts::strong_type && std::constructible_from); 155| | return T{typename T::wrapped_type{std::forward(t)}}; 156| | } 157| 118k|} _ZN5Botan16wrap_strong_typeItRtQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_: 144| 7.14k|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 145| 7.14k| if constexpr(std::same_as, T>) { 146| | // Noop, if the parameter type already is the desired return type. 147| 7.14k| return std::forward(t); 148| | } else if constexpr(std::constructible_from) { 149| | // Implicit conversion from the parameter type to the return type. 150| | return T{std::forward(t)}; 151| | } else { 152| | // Explicitly calling the wrapped type's constructor to support 153| | // implicit conversions on types that mark their constructors as explicit. 154| | static_assert(concepts::strong_type && std::constructible_from); 155| | return T{typename T::wrapped_type{std::forward(t)}}; 156| | } 157| 7.14k|} _ZNK5Botan15TelephoneNumber9to_stringEv: 36| 2| const std::string& to_string() const { return m_number; } _ZNK5Botan15TelephoneNumber6lengthEv: 46| 90| size_t length() const { return m_number.size(); } _ZN5Botan15TelephoneNumberC2ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEE: 59| 98| explicit TelephoneNumber(std::string number) : m_number(std::move(number)) {} _ZNK5Botan20TelephoneNumberRange5startEv: 81| 2| const TelephoneNumber& start() const { return m_start; } _ZNK5Botan20TelephoneNumberRange5countEv: 86| 4| uint64_t count() const { return m_count; } _ZN5Botan20TelephoneNumberRangeC2ENS_15TelephoneNumberEm: 109| 5| TelephoneNumberRange(TelephoneNumber start, uint64_t count) : m_start(std::move(start)), m_count(count) {} _ZN5Botan3URI9AuthorityC2ENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_8optionalIS8_EENS2_7variantIJNS_7DNSNameENS_11IPv4AddressENS_11IPv6AddressEEEENS9_ItEE: 105| 1.53k| m_raw(std::move(raw)), m_userinfo(std::move(userinfo)), m_host(std::move(host)), m_port(port) {} _ZN5Botan3URIC2ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEES7_NS1_8optionalINS0_9AuthorityEEES7_NS8_IS7_EESB_: 202| 2.12k| m_raw(std::move(raw)), 203| 2.12k| m_scheme(std::move(scheme)), 204| 2.12k| m_authority(std::move(authority)), 205| 2.12k| m_path(std::move(path)), 206| 2.12k| m_query(std::move(query)), 207| 2.12k| m_fragment(std::move(fragment)) {} _ZN5Botan14Cert_Extension16Authority_Key_ID10static_oidEv: 185| 9.53k| static OID static_oid() { return OID({2, 5, 29, 35}); } _ZNK5Botan14Cert_Extension16Authority_Key_ID10get_key_idEv: 178| 904| const std::vector& get_key_id() const { return m_key_id; } _ZNK5Botan14Cert_Extension21DistributionPointName9full_nameEv: 592| 476| const std::optional& full_name() const { return m_full_name; } _ZN5Botan14Cert_Extension23CRL_Distribution_Points10static_oidEv: 667| 9.53k| static OID static_oid() { return OID({2, 5, 29, 31}); } _ZNK5Botan14Cert_Extension23CRL_Distribution_Points18Distribution_Point23distribution_point_nameEv: 626| 238| const std::optional& distribution_point_name() const { return m_dp_name; } _ZNK5Botan14Cert_Extension17Basic_Constraints5is_caEv: 58| 1.76k| bool is_ca() const { return m_is_ca; } _ZNK5Botan14Cert_Extension17Basic_Constraints22path_length_constraintEv: 60| 602| std::optional path_length_constraint() const { return m_path_length_constraint; } _ZN5Botan14Cert_Extension17Basic_Constraints10static_oidEv: 62| 9.53k| static OID static_oid() { return OID({2, 5, 29, 19}); } _ZNK5Botan14Cert_Extension17Basic_Constraints8oid_nameEv: 67| 2.64k| std::string oid_name() const override { return "X509v3.BasicConstraints"; } _ZN5Botan14Cert_Extension9Key_UsageC2Ev: 89| 2.76k| explicit Key_Usage() : m_constraints(Key_Constraints::None) {} _ZNK5Botan14Cert_Extension9Key_Usage15get_constraintsEv: 91| 1.58k| Key_Constraints get_constraints() const { return m_constraints; } _ZN5Botan14Cert_Extension9Key_Usage10static_oidEv: 93| 9.53k| static OID static_oid() { return OID({2, 5, 29, 15}); } _ZNK5Botan14Cert_Extension9Key_Usage8oid_nameEv: 98| 2.17k| std::string oid_name() const override { return "X509v3.KeyUsage"; } _ZNK5Botan14Cert_Extension14Subject_Key_ID10get_key_idEv: 136| 2.10k| const std::vector& get_key_id() const { return m_key_id; } _ZN5Botan14Cert_Extension14Subject_Key_ID10static_oidEv: 138| 9.53k| static OID static_oid() { return OID({2, 5, 29, 14}); } _ZNK5Botan14Cert_Extension14Subject_Key_ID8oid_nameEv: 143| 2.10k| std::string oid_name() const override { return "X509v3.SubjectKeyIdentifier"; } _ZNK5Botan14Cert_Extension16Authority_Key_ID8oid_nameEv: 190| 906| std::string oid_name() const override { return "X509v3.AuthorityKeyIdentifier"; } _ZNK5Botan14Cert_Extension24Subject_Alternative_Name12get_alt_nameEv: 208| 98| const AlternativeName& get_alt_name() const { return m_alt_name; } _ZN5Botan14Cert_Extension24Subject_Alternative_Name10static_oidEv: 210| 9.53k| static OID static_oid() { return OID({2, 5, 29, 17}); } _ZN5Botan14Cert_Extension24Subject_Alternative_NameC2ERKNS_15AlternativeNameE: 218| 745| explicit Subject_Alternative_Name(const AlternativeName& name = AlternativeName()) : m_alt_name(name) {} _ZNK5Botan14Cert_Extension24Subject_Alternative_Name8oid_nameEv: 221| 98| std::string oid_name() const override { return "X509v3.SubjectAlternativeName"; } _ZNK5Botan14Cert_Extension23Issuer_Alternative_Name12get_alt_nameEv: 238| 19| const AlternativeName& get_alt_name() const { return m_alt_name; } _ZN5Botan14Cert_Extension23Issuer_Alternative_Name10static_oidEv: 240| 9.53k| static OID static_oid() { return OID({2, 5, 29, 18}); } _ZN5Botan14Cert_Extension23Issuer_Alternative_NameC2ERKNS_15AlternativeNameE: 248| 222| explicit Issuer_Alternative_Name(const AlternativeName& name = AlternativeName()) : m_alt_name(name) {} _ZNK5Botan14Cert_Extension23Issuer_Alternative_Name8oid_nameEv: 251| 19| std::string oid_name() const override { return "X509v3.IssuerAlternativeName"; } _ZNK5Botan14Cert_Extension18Extended_Key_Usage18object_identifiersEv: 276| 679| const std::vector& object_identifiers() const { return m_oids; } _ZN5Botan14Cert_Extension18Extended_Key_Usage10static_oidEv: 278| 9.53k| static OID static_oid() { return OID({2, 5, 29, 37}); } _ZNK5Botan14Cert_Extension18Extended_Key_Usage8oid_nameEv: 283| 1.11k| std::string oid_name() const override { return "X509v3.ExtendedKeyUsage"; } _ZNK5Botan14Cert_Extension16Name_Constraints20get_name_constraintsEv: 314| 24| const NameConstraints& get_name_constraints() const { return m_name_constraints; } _ZN5Botan14Cert_Extension16Name_Constraints10static_oidEv: 316| 9.53k| static OID static_oid() { return OID({2, 5, 29, 30}); } _ZNK5Botan14Cert_Extension16Name_Constraints8oid_nameEv: 321| 24| std::string oid_name() const override { return "X509v3.NameConstraints"; } _ZNK5Botan14Cert_Extension20Certificate_Policies15get_policy_oidsEv: 346| 23| const std::vector& get_policy_oids() const { return m_oids; } _ZN5Botan14Cert_Extension20Certificate_Policies10static_oidEv: 348| 9.53k| static OID static_oid() { return OID({2, 5, 29, 32}); } _ZNK5Botan14Cert_Extension20Certificate_Policies8oid_nameEv: 359| 23| std::string oid_name() const override { return "X509v3.CertificatePolicies"; } _ZN5Botan14Cert_Extension28Authority_Information_Access17AccessDescriptionC2ENS_3OIDENS_9ASN1_TypeENS_10ASN1_ClassENSt3__16vectorIhNS6_9allocatorIhEEEE: 391| 454| m_method(std::move(method)), 392| 454| m_location_tag(location_tag), 393| 454| m_location_class(location_class), 394| 454| m_location_value(std::move(location_value)) {} _ZNK5Botan14Cert_Extension28Authority_Information_Access19ocsp_responder_urisEv: 465| 211| const std::vector& ocsp_responder_uris() const { return m_ocsp_responders; } _ZN5Botan14Cert_Extension28Authority_Information_Access10static_oidEv: 473| 9.53k| static OID static_oid() { return OID({1, 3, 6, 1, 5, 5, 7, 1, 1}); } _ZNK5Botan14Cert_Extension28Authority_Information_Access14ca_issuer_urisEv: 479| 211| const std::vector& ca_issuer_uris() const { return m_ca_issuers; } _ZNK5Botan14Cert_Extension28Authority_Information_Access8oid_nameEv: 482| 211| std::string oid_name() const override { return "PKIX.AuthorityInformationAccess"; } _ZN5Botan14Cert_Extension10CRL_NumberC2Ev: 506| 1| CRL_Number() : m_has_value(false), m_crl_number(BigInt::zero()) {} _ZNK5Botan14Cert_Extension10CRL_Number8oid_nameEv: 521| 1| std::string oid_name() const override { return "X509v3.CRLNumber"; } _ZN5Botan14Cert_Extension14CRL_ReasonCodeC2ENS_8CRL_CodeE: 543| 1| explicit CRL_ReasonCode(CRL_Code r = CRL_Code::Unspecified) : m_reason(r) {} _ZNK5Botan14Cert_Extension14CRL_ReasonCode8oid_nameEv: 552| 1| std::string oid_name() const override { return "X509v3.ReasonCode"; } _ZNK5Botan14Cert_Extension23CRL_Distribution_Points27crl_distribution_point_urisEv: 665| 48| const std::vector& crl_distribution_point_uris() const { return m_crl_distribution_urls; } _ZNK5Botan14Cert_Extension23CRL_Distribution_Points8oid_nameEv: 672| 48| std::string oid_name() const override { return "X509v3.CRLDistributionPoints"; } _ZNK5Botan14Cert_Extension30CRL_Issuing_Distribution_Point8oid_nameEv: 754| 1| std::string oid_name() const override { return "X509v3.CRLIssuingDistributionPoint"; } _ZN5Botan14Cert_Extension12OCSP_NoCheck10static_oidEv: 796| 20.7k| static OID static_oid() { return OID({1, 3, 6, 1, 5, 5, 7, 48, 1, 5}); } _ZN5Botan14Cert_Extension21NoRevocationAvailable10static_oidEv: 839| 9.53k| static OID static_oid() { return OID({2, 5, 29, 56}); } _ZNK5Botan14Cert_Extension8ASBlocks11ASIdOrRange3minEv: 1333| 314| asnum_t min() const { return m_min; } _ZNK5Botan14Cert_Extension8ASBlocks11ASIdOrRange3maxEv: 1335| 314| asnum_t max() const { return m_max; } _ZN5Botan14Cert_Extension17Unknown_ExtensionC2ERKNS_3OIDEbb: 1466| 19.5k| m_oid(oid), m_critical(critical), m_failed_to_decode(failed_to_decode) {} _ZNK5Botan14Cert_Extension17Unknown_Extension8validateERKNS_16X509_CertificateERKNSt3__18optionalIS2_EERKNS5_6vectorIS2_NS5_9allocatorIS2_EEEERNSA_INS5_3setINS_23Certificate_Status_CodeENS5_4lessISH_EENSB_ISH_EEEENSB_ISL_EEEEm: 1499| 59| size_t pos) const override { 1500| 59| if(m_failed_to_decode) { ------------------ | Branch (1500:13): [True: 27, False: 32] ------------------ 1501| 27| cert_status.at(pos).insert(Certificate_Status_Code::EXTENSION_ENCODING_ERROR); 1502| 32| } else if(m_critical) { ------------------ | Branch (1502:20): [True: 21, False: 11] ------------------ 1503| 21| cert_status.at(pos).insert(Certificate_Status_Code::UNKNOWN_CRITICAL_EXTENSION); 1504| 21| } 1505| 59| } _ZNK5Botan14Cert_Extension17Unknown_Extension8oid_nameEv: 1508| 10.2k| std::string oid_name() const override { return ""; } _ZN5Botan14Cert_ExtensionssENS0_15IPAddressBlocks9IPAddressILNS1_7VersionE4EEERKS4_: 1086| 24| friend std::strong_ordering operator<=>(const IPAddress lhs, const IPAddress& rhs) { 1087| 34| for(size_t i = 0; i < Length; i++) { ------------------ | Branch (1087:34): [True: 34, False: 0] ------------------ 1088| 34| if(lhs.m_value[i] < rhs.m_value[i]) { ------------------ | Branch (1088:22): [True: 6, False: 28] ------------------ 1089| 6| return std::strong_ordering::less; 1090| 28| } else if(lhs.m_value[i] > rhs.m_value[i]) { ------------------ | Branch (1090:29): [True: 18, False: 10] ------------------ 1091| 18| return std::strong_ordering::greater; 1092| 18| } 1093| 34| } 1094| 0| return std::strong_ordering::equal; 1095| 24| } _ZN5Botan14Cert_ExtensionssENS0_15IPAddressBlocks9IPAddressILNS1_7VersionE16EEERKS4_: 1086| 28| friend std::strong_ordering operator<=>(const IPAddress lhs, const IPAddress& rhs) { 1087| 34| for(size_t i = 0; i < Length; i++) { ------------------ | Branch (1087:34): [True: 34, False: 0] ------------------ 1088| 34| if(lhs.m_value[i] < rhs.m_value[i]) { ------------------ | Branch (1088:22): [True: 14, False: 20] ------------------ 1089| 14| return std::strong_ordering::less; 1090| 20| } else if(lhs.m_value[i] > rhs.m_value[i]) { ------------------ | Branch (1090:29): [True: 14, False: 6] ------------------ 1091| 14| return std::strong_ordering::greater; 1092| 14| } 1093| 34| } 1094| 0| return std::strong_ordering::equal; 1095| 28| } _ZN5Botan14Cert_Extension15IPAddressBlocks9IPAddressILNS1_7VersionE4EEC2ERKNS_11IPv4AddressE: 1050| 6| explicit IPAddress(const Address& addr) : m_value(addr.to_bytes()) {} _ZNK5Botan14Cert_Extension15IPAddressBlocks9IPAddressILNS1_7VersionE4EE8to_bytesEv: 1060| 6| std::array to_bytes() const { return m_value; } _ZN5Botan14Cert_Extension15IPAddressBlocks9IPAddressILNS1_7VersionE16EEC2ERKNS_11IPv6AddressE: 1050| 14| explicit IPAddress(const Address& addr) : m_value(addr.to_bytes()) {} _ZNK5Botan14Cert_Extension15IPAddressBlocks9IPAddressILNS1_7VersionE16EE8to_bytesEv: 1060| 14| std::array to_bytes() const { return m_value; } _ZNK5Botan14Cert_Extension15IPAddressBlocks16IPAddressOrRangeILNS1_7VersionE4EE3minEv: 1143| 30| IPAddress min() const { return m_min; } _ZNK5Botan14Cert_Extension15IPAddressBlocks16IPAddressOrRangeILNS1_7VersionE4EE3maxEv: 1145| 30| IPAddress max() const { return m_max; } _ZNK5Botan14Cert_Extension15IPAddressBlocks16IPAddressOrRangeILNS1_7VersionE16EE3minEv: 1143| 42| IPAddress min() const { return m_min; } _ZNK5Botan14Cert_Extension15IPAddressBlocks16IPAddressOrRangeILNS1_7VersionE16EE3maxEv: 1145| 42| IPAddress max() const { return m_max; } _ZN5Botan14Cert_Extension14Subject_Key_IDC2Ev: 115| 2.68k| Subject_Key_ID() = default; _ZN5Botan14Cert_Extension30CRL_Issuing_Distribution_PointC2Ev: 698| 1| CRL_Issuing_Distribution_Point() = default; _ZN5Botan14Cert_Extension16Name_ConstraintsC2Ev: 304| 290| Name_Constraints() = default; _ZN5Botan14Cert_Extension23CRL_Distribution_PointsC2Ev: 657| 578| CRL_Distribution_Points() = default; _ZN5Botan14Cert_Extension20Certificate_PoliciesC2Ev: 342| 120| Certificate_Policies() = default; _ZN5Botan14Cert_Extension16Authority_Key_IDC2Ev: 162| 2.02k| Authority_Key_ID() = default; _ZN5Botan14Cert_Extension18Extended_Key_UsageC2Ev: 272| 1.63k| Extended_Key_Usage() = default; _ZN5Botan14Cert_Extension21NoRevocationAvailableC2Ev: 835| 31| NoRevocationAvailable() = default; _ZN5Botan14Cert_Extension28Authority_Information_AccessC2Ev: 427| 1.28k| Authority_Information_Access() = default; _ZN5Botan14Cert_Extension15IPAddressBlocksC2Ev: 1206| 266| IPAddressBlocks() = default; _ZN5Botan14Cert_Extension8ASBlocksC2Ev: 1392| 245| ASBlocks() = default; _ZN5Botan14Cert_Extension8ASBlocks13ASIdentifiersC2Ev: 1386| 245| ASIdentifiers() = default; _ZN5Botan14Cert_Extension12OCSP_NoCheckC2Ev: 792| 10| OCSP_NoCheck() = default; _ZN5Botan14Cert_Extension10TNAuthList5EntryC2Ev: 914| 153| Entry() = default; _ZN5Botan14Cert_Extension10TNAuthListC2Ev: 958| 151| TNAuthList() = default; _ZN5Botan14Cert_Extension15IPAddressBlocks15IPAddressChoiceILNS1_7VersionE4EEC2Ev: 1168| 496| IPAddressChoice() = default; _ZN5Botan14Cert_Extension15IPAddressBlocks15IPAddressChoiceILNS1_7VersionE16EEC2Ev: 1168| 146| IPAddressChoice() = default; _ZN5Botan14Cert_Extension8ASBlocks18ASIdentifierChoiceC2Ev: 1357| 153| ASIdentifierChoice() = default; _ZN5Botan14Cert_Extension23CRL_Distribution_Points18Distribution_PointC2Ev: 614| 762| Distribution_Point() = default; _ZN5Botan14Cert_Extension21DistributionPointNameC2Ev: 577| 635| DistributionPointName() = default; _ZN5Botan14Cert_Extension15IPAddressBlocks15IPAddressFamilyC2Ev: 1183| 348| IPAddressFamily() = default; _ZN5Botan14Cert_Extension15IPAddressBlocks16IPAddressOrRangeILNS1_7VersionE4EEC2Ev: 1116| 115| IPAddressOrRange() = default; _ZN5Botan14Cert_ExtensioneqERKNS0_15IPAddressBlocks9IPAddressILNS1_7VersionE4EEES6_: 1097| 6| friend bool operator==(const IPAddress& lhs, const IPAddress& rhs) { 1098| 6| return lhs.m_value == rhs.m_value; 1099| 6| } _ZN5Botan14Cert_Extension15IPAddressBlocks16IPAddressOrRangeILNS1_7VersionE16EEC2Ev: 1116| 133| IPAddressOrRange() = default; _ZN5Botan14Cert_ExtensioneqERKNS0_15IPAddressBlocks9IPAddressILNS1_7VersionE16EEES6_: 1097| 14| friend bool operator==(const IPAddress& lhs, const IPAddress& rhs) { 1098| 14| return lhs.m_value == rhs.m_value; 1099| 14| } _ZN5Botan14Cert_Extension8ASBlocks11ASIdOrRangeC2Ev: 1337| 371| ASIdOrRange() = default; _ZN5Botan4X5098load_keyERKNSt3__16vectorIhNS1_9allocatorIhEEEE: 59| 3.55k|inline std::unique_ptr load_key(const std::vector& enc) { 60| 3.55k| DataSource_Memory source(enc); 61| 3.55k| return X509::load_key(source); 62| 3.55k|} _ZN5Botan11X509_ObjectC2Ev: 120| 13.9k| X509_Object() = default; _ZNK5Botan16X509_Certificate3Tag4hashEv: 455| 21.5k| size_t hash() const noexcept { 456| 21.5k| size_t h = 0; 457| 21.5k| std::memcpy(&h, m_tag.data(), sizeof(h)); 458| 21.5k| return h; 459| 21.5k| } _ZN5Botan16X509_Certificate3TagC2ENSt3__15arrayIhLm32EEE: 464| 33.3k| explicit Tag(std::array tag) : m_tag(tag) {} _ZNK5Botan16X509_Certificate7TagHashclERKNS0_3TagE: 471| 21.5k| size_t operator()(const X509_Certificate::Tag& tag) const noexcept { return tag.hash(); } _ZN5Botan16X509_CertificateC2ERKS0_: 559| 47.7k| X509_Certificate(const X509_Certificate& other) = default; _ZN5Botan16X509_CertificateC2EOS0_: 560| 29.3k| X509_Certificate(X509_Certificate&& other) = default; _ZNK5Botan16X509_Certificate3TagssERKS1_: 453| 11.6k| auto operator<=>(const Tag&) const = default; _ZNK5Botan28Path_Validation_Restrictions30require_revocation_informationEv: 123| 1| bool require_revocation_information() const { return m_require_revocation_information; } _ZNK5Botan28Path_Validation_Restrictions22ocsp_all_intermediatesEv: 129| 1| bool ocsp_all_intermediates() const { return m_ocsp_all_intermediates; } _ZNK5Botan28Path_Validation_Restrictions14trusted_hashesEv: 134| 19| const std::set& trusted_hashes() const { return m_trusted_hashes; } _ZNK5Botan28Path_Validation_Restrictions20minimum_key_strengthEv: 139| 1.44k| size_t minimum_key_strength() const { return m_minimum_key_strength; } _ZNK5Botan28Path_Validation_Restrictions30ignore_trusted_root_time_rangeEv: 165| 32| bool ignore_trusted_root_time_range() const { return m_ignore_trusted_root_time_range; } _ZNK5Botan28Path_Validation_Restrictions33require_self_signed_trust_anchorsEv: 175| 3.96k| bool require_self_signed_trust_anchors() const { return m_require_self_signed_trust_anchors; } _ZNK5Botan22Path_Validation_Result6resultEv: 229| 10.7k| Certificate_Status_Code result() const { return m_overall; } _ZN5Botan22Path_Validation_ResultC2ENS_23Certificate_Status_CodeE: 268| 323| explicit Path_Validation_Result(Certificate_Status_Code status) : m_overall(status) {} LLVMFuzzerInitialize: 28| 2|extern "C" int LLVMFuzzerInitialize(int* /*argc*/, char*** /*argv*/) { 29| | /* 30| | * This disables the mlock pool, as overwrites within the pool are 31| | * opaque to ASan or other instrumentation. 32| | */ 33| 2| ::setenv("BOTAN_MLOCK_POOL_SIZE", "0", 1); 34| 2| return 0; 35| 2|} LLVMFuzzerTestOneInput: 39| 8.32k|extern "C" int LLVMFuzzerTestOneInput(const uint8_t in[], size_t len) { 40| 8.32k| if(len <= max_fuzzer_input_size) { ------------------ | Branch (40:7): [True: 8.31k, False: 7] ------------------ 41| 8.31k| try { 42| 8.31k| fuzz(std::span(in, len)); 43| 8.31k| } catch(const std::exception& e) { 44| 0| std::cerr << "Uncaught exception from fuzzer driver " << e.what() << "\n"; 45| 0| abort(); 46| 0| } catch(...) { 47| 0| std::cerr << "Uncaught exception from fuzzer driver (unknown type)\n"; 48| 0| abort(); 49| 0| } 50| 8.31k| } 51| 8.32k| return 0; 52| 8.32k|} _Z4fuzzNSt3__14spanIKhLm18446744073709551615EEE: 13| 8.31k|void fuzz(std::span in) { 14| 8.31k| Botan::DataSource_Memory input(in); 15| | 16| 8.31k| try { 17| 8.31k| const Botan::X509_Certificate subject(input); 18| 8.31k| const Botan::X509_Certificate issuer(input); 19| | 20| 8.31k| std::vector roots; 21| 8.31k| const std::unique_ptr root_store(new Botan::Certificate_Store_In_Memory(issuer)); 22| 8.31k| roots.push_back(root_store.get()); 23| | 24| 8.31k| const Botan::Path_Validation_Restrictions restrictions; 25| | 26| 8.31k| x509_path_validate({subject}, restrictions, roots); 27| 8.31k| } catch(const Botan::Exception& e) {} 28| 8.31k|} _ZN5Botan19AlgorithmIdentifierC2ERKNS_3OIDERKNSt3__16vectorIhNS4_9allocatorIhEEEE: 20| 15| m_oid(oid), m_parameters(param) {} _ZN5Botan19AlgorithmIdentifierC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKNS1_6vectorIhNS1_9allocatorIhEEEE: 26| 15| AlgorithmIdentifier(OID::from_string(oid), param) {} _ZN5Botan19AlgorithmIdentifierC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS0_15Encoding_OptionE: 42| 15|AlgorithmIdentifier::AlgorithmIdentifier(std::string_view oid, Encoding_Option option) : m_oid(OID::from_string(oid)) { 43| 15| constexpr uint8_t DER_NULL[2] = {0x05, 0x00}; 44| | 45| 15| if(option == USE_NULL_PARAM) { ------------------ | Branch (45:7): [True: 15, False: 0] ------------------ 46| 15| m_parameters.assign(DER_NULL, DER_NULL + 2); 47| 15| } 48| 15|} _ZNK5Botan19AlgorithmIdentifier19parameters_are_nullEv: 50| 27.3k|bool AlgorithmIdentifier::parameters_are_null() const { 51| 27.3k| return (m_parameters.size() == 2 && (m_parameters[0] == 0x05) && (m_parameters[1] == 0x00)); ------------------ | Branch (51:12): [True: 20.5k, False: 6.76k] | Branch (51:40): [True: 19.7k, False: 781] | Branch (51:69): [True: 19.7k, False: 8] ------------------ 52| 27.3k|} _ZN5BotaneqERKNS_19AlgorithmIdentifierES2_: 54| 10.2k|bool operator==(const AlgorithmIdentifier& x, const AlgorithmIdentifier& y) { 55| 10.2k| return (x.oid() == y.oid() && x.parameters() == y.parameters()); ------------------ | Branch (55:12): [True: 10.2k, False: 16] | Branch (55:34): [True: 10.2k, False: 14] ------------------ 56| 10.2k|} _ZN5BotanneERKNS_19AlgorithmIdentifierES2_: 58| 10.2k|bool operator!=(const AlgorithmIdentifier& x, const AlgorithmIdentifier& y) { 59| 10.2k| return !(x == y); 60| 10.2k|} _ZNK5Botan19AlgorithmIdentifier11encode_intoERNS_11DER_EncoderE: 65| 9.54k|void AlgorithmIdentifier::encode_into(DER_Encoder& codec) const { 66| 9.54k| codec.start_sequence().encode(oid()).raw_bytes(parameters()).end_cons(); 67| 9.54k|} _ZN5Botan19AlgorithmIdentifier11decode_fromERNS_11BER_DecoderE: 72| 36.6k|void AlgorithmIdentifier::decode_from(BER_Decoder& codec) { 73| 36.6k| codec.start_sequence().decode(m_oid).raw_bytes(m_parameters).end_cons(); 74| | 75| | /* 76| | * The parameters field is OPTIONAL ANY but in practice it is one of 77| | * - empty 78| | * - NULL 79| | * - SEQUENCE 80| | * - OBJECT IDENTIFIER (namedCurve) 81| | * - OCTET STRING (CBC IV in PBES2) 82| | * 83| | * So require it be exactly one of these values. In particular this ensures that 84| | * there is not any additional trailing data (eg after the SEQUENCE encoding) 85| | * that might be otherwise skipped over by a reader. 86| | */ 87| | 88| 36.6k| const bool acceptable_parameters = [&]() { 89| 36.6k| if(this->parameters_are_null_or_empty()) { 90| 36.6k| return true; 91| 36.6k| } 92| 36.6k| if(ASN1::is_der_sequence_header(m_parameters)) { 93| 36.6k| return true; 94| 36.6k| } 95| 36.6k| if(ASN1::is_single_der_object(m_parameters, ASN1_Type::ObjectId, ASN1_Class::Universal)) { 96| 36.6k| return true; 97| 36.6k| } 98| 36.6k| if(ASN1::is_single_der_object(m_parameters, ASN1_Type::OctetString, ASN1_Class::Universal)) { 99| 36.6k| return true; 100| 36.6k| } 101| 36.6k| return false; 102| 36.6k| }(); 103| | 104| 36.6k| if(!acceptable_parameters) { ------------------ | Branch (104:7): [True: 145, False: 36.4k] ------------------ 105| 145| throw Decoding_Error("AlgorithmIdentifier parameters were not NULL, a SEQUENCE, an OID, or an OCTET STRING"); 106| 145| } 107| 36.6k|} alg_id.cpp:_ZZN5Botan19AlgorithmIdentifier11decode_fromERNS_11BER_DecoderEENK3$_0clEv: 88| 36.2k| const bool acceptable_parameters = [&]() { 89| 36.2k| if(this->parameters_are_null_or_empty()) { ------------------ | Branch (89:10): [True: 28.7k, False: 7.55k] ------------------ 90| 28.7k| return true; 91| 28.7k| } 92| 7.55k| if(ASN1::is_der_sequence_header(m_parameters)) { ------------------ | Branch (92:10): [True: 3.19k, False: 4.35k] ------------------ 93| 3.19k| return true; 94| 3.19k| } 95| 4.35k| if(ASN1::is_single_der_object(m_parameters, ASN1_Type::ObjectId, ASN1_Class::Universal)) { ------------------ | Branch (95:10): [True: 3.76k, False: 593] ------------------ 96| 3.76k| return true; 97| 3.76k| } 98| 593| if(ASN1::is_single_der_object(m_parameters, ASN1_Type::OctetString, ASN1_Class::Universal)) { ------------------ | Branch (98:10): [True: 448, False: 145] ------------------ 99| 448| return true; 100| 448| } 101| 145| return false; 102| 593| }(); _ZNK5Botan11ASN1_Object10BER_encodeEv: 21| 49.0k|std::vector ASN1_Object::BER_encode() const { 22| 49.0k| std::vector output; 23| 49.0k| DER_Encoder der(output); 24| 49.0k| this->encode_into(der); 25| 49.0k| return output; 26| 49.0k|} _ZN5Botan14ASN1_BitStringC2ENSt3__16vectorIhNS1_9allocatorIhEEEEm: 29| 27.0k| m_bytes(std::move(bytes)), m_unused_bits(unused_bits) { 30| 27.0k| if(m_unused_bits >= 8) { ------------------ | Branch (30:7): [True: 0, False: 27.0k] ------------------ 31| 0| throw Invalid_Argument("ASN1_BitString: Invalid unused bit count"); 32| 0| } 33| | 34| 27.0k| if(m_bytes.empty() && m_unused_bits != 0) { ------------------ | Branch (34:7): [True: 2.56k, False: 24.5k] | Branch (34:26): [True: 0, False: 2.56k] ------------------ 35| 0| throw Invalid_Argument("ASN1_BitString: Empty BIT STRING cannot have unused bits"); 36| 0| } 37| | 38| 27.0k| if(m_unused_bits > 0 && (m_bytes.back() & ((1U << m_unused_bits) - 1)) != 0) { ------------------ | Branch (38:7): [True: 1.90k, False: 25.1k] | Branch (38:28): [True: 0, False: 1.90k] ------------------ 39| 0| throw Invalid_Argument("ASN1_BitString: Unused bits must be zero"); 40| 0| } 41| 27.0k|} _ZNK5Botan14ASN1_BitString10bit_lengthEv: 46| 30.4k|size_t ASN1_BitString::bit_length() const { 47| 30.4k| return 8 * m_bytes.size() - m_unused_bits; 48| 30.4k|} _ZNK5Botan14ASN1_BitString6bit_atEm: 50| 12.4k|bool ASN1_BitString::bit_at(size_t bit) const { 51| 12.4k| if(bit >= bit_length()) { ------------------ | Branch (51:7): [True: 0, False: 12.4k] ------------------ 52| 0| throw Invalid_Argument("ASN1_BitString: Bit index out of range"); 53| 0| } 54| | 55| 12.4k| return (m_bytes[bit / 8] & (0x80 >> (bit % 8))) != 0; 56| 12.4k|} _ZN5Botan10BER_ObjectD2Ev: 58| 1.29M|BER_Object::~BER_Object() { 59| 1.29M| secure_scrub_memory(m_value); 60| 1.29M|} _ZNK5Botan10BER_Object11assert_is_aENS_9ASN1_TypeENS_10ASN1_ClassENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE: 65| 336k|void BER_Object::assert_is_a(ASN1_Type expected_type_tag, ASN1_Class expected_class_tag, std::string_view descr) const { 66| 336k| if(!this->is_a(expected_type_tag, expected_class_tag)) { ------------------ | Branch (66:7): [True: 1.80k, False: 334k] ------------------ 67| 1.80k| std::stringstream msg; 68| | 69| 1.80k| msg << "Tag mismatch when decoding " << descr << " got "; 70| | 71| 1.80k| if(m_class_tag == ASN1_Class::NoObject && m_type_tag == ASN1_Type::NoObject) { ------------------ | Branch (71:10): [True: 103, False: 1.70k] | Branch (71:49): [True: 103, False: 0] ------------------ 72| 103| msg << "EOF"; 73| 1.70k| } else { 74| 1.70k| if(m_class_tag == ASN1_Class::Universal || m_class_tag == ASN1_Class::Constructed) { ------------------ | Branch (74:13): [True: 373, False: 1.32k] | Branch (74:53): [True: 921, False: 408] ------------------ 75| 1.29k| msg << asn1_tag_to_string(m_type_tag); 76| 1.29k| } else { 77| 408| msg << std::to_string(static_cast(m_type_tag)); 78| 408| } 79| | 80| 1.70k| msg << "/" << asn1_class_to_string(m_class_tag); 81| 1.70k| } 82| | 83| 1.80k| msg << " expected "; 84| | 85| 1.80k| if(expected_class_tag == ASN1_Class::Universal || expected_class_tag == ASN1_Class::Constructed) { ------------------ | Branch (85:10): [True: 329, False: 1.47k] | Branch (85:57): [True: 1.47k, False: 0] ------------------ 86| 1.80k| msg << asn1_tag_to_string(expected_type_tag); 87| 1.80k| } else { 88| 0| msg << std::to_string(static_cast(expected_type_tag)); 89| 0| } 90| | 91| 1.80k| msg << "/" << asn1_class_to_string(expected_class_tag); 92| | 93| 1.80k| throw BER_Decoding_Error(msg.str()); 94| 1.80k| } 95| 336k|} _ZNK5Botan10BER_Object4is_aENS_9ASN1_TypeENS_10ASN1_ClassE: 97| 495k|bool BER_Object::is_a(ASN1_Type expected_type_tag, ASN1_Class expected_class_tag) const { 98| 495k| return (m_type_tag == expected_type_tag && m_class_tag == expected_class_tag); ------------------ | Branch (98:12): [True: 393k, False: 102k] | Branch (98:47): [True: 393k, False: 298] ------------------ 99| 495k|} _ZNK5Botan10BER_Object4is_aEiNS_10ASN1_ClassE: 101| 92.6k|bool BER_Object::is_a(int expected_type_tag, ASN1_Class expected_class_tag) const { 102| 92.6k| return is_a(ASN1_Type(expected_type_tag), expected_class_tag); 103| 92.6k|} _ZN5Botan10BER_Object11set_taggingENS_9ASN1_TypeENS_10ASN1_ClassE: 105| 586k|void BER_Object::set_tagging(ASN1_Type type_tag, ASN1_Class class_tag) { 106| 586k| m_type_tag = type_tag; 107| 586k| m_class_tag = class_tag; 108| 586k|} _ZN5Botan20asn1_class_to_stringENS_10ASN1_ClassE: 110| 3.50k|std::string asn1_class_to_string(ASN1_Class type) { 111| 3.50k| switch(type) { 112| 702| case ASN1_Class::Universal: ------------------ | Branch (112:7): [True: 702, False: 2.80k] ------------------ 113| 702| return "UNIVERSAL"; 114| 2.39k| case ASN1_Class::Constructed: ------------------ | Branch (114:7): [True: 2.39k, False: 1.11k] ------------------ 115| 2.39k| return "CONSTRUCTED"; 116| 95| case ASN1_Class::ContextSpecific: ------------------ | Branch (116:7): [True: 95, False: 3.41k] ------------------ 117| 95| return "CONTEXT_SPECIFIC"; 118| 42| case ASN1_Class::Application: ------------------ | Branch (118:7): [True: 42, False: 3.46k] ------------------ 119| 42| return "APPLICATION"; 120| 35| case ASN1_Class::Private: ------------------ | Branch (120:7): [True: 35, False: 3.47k] ------------------ 121| 35| return "PRIVATE"; 122| 0| case ASN1_Class::NoObject: ------------------ | Branch (122:7): [True: 0, False: 3.50k] ------------------ 123| 0| return "NO_OBJECT"; 124| 236| default: ------------------ | Branch (124:7): [True: 236, False: 3.27k] ------------------ 125| 236| return "CLASS(" + std::to_string(static_cast(type)) + ")"; 126| 3.50k| } 127| 3.50k|} _ZN5Botan18asn1_tag_to_stringENS_9ASN1_TypeE: 129| 5.37k|std::string asn1_tag_to_string(ASN1_Type type) { 130| 5.37k| switch(type) { 131| 1.39k| case ASN1_Type::Sequence: ------------------ | Branch (131:7): [True: 1.39k, False: 3.97k] ------------------ 132| 1.39k| return "SEQUENCE"; 133| | 134| 325| case ASN1_Type::Set: ------------------ | Branch (134:7): [True: 325, False: 5.05k] ------------------ 135| 325| return "SET"; 136| | 137| 119| case ASN1_Type::PrintableString: ------------------ | Branch (137:7): [True: 119, False: 5.25k] ------------------ 138| 119| return "PRINTABLE STRING"; 139| | 140| 43| case ASN1_Type::NumericString: ------------------ | Branch (140:7): [True: 43, False: 5.33k] ------------------ 141| 43| return "NUMERIC STRING"; 142| | 143| 48| case ASN1_Type::Ia5String: ------------------ | Branch (143:7): [True: 48, False: 5.32k] ------------------ 144| 48| return "IA5 STRING"; 145| | 146| 49| case ASN1_Type::TeletexString: ------------------ | Branch (146:7): [True: 49, False: 5.32k] ------------------ 147| 49| return "T61 STRING"; 148| | 149| 2.22k| case ASN1_Type::Utf8String: ------------------ | Branch (149:7): [True: 2.22k, False: 3.15k] ------------------ 150| 2.22k| return "UTF8 STRING"; 151| | 152| 16| case ASN1_Type::VisibleString: ------------------ | Branch (152:7): [True: 16, False: 5.36k] ------------------ 153| 16| return "VISIBLE STRING"; 154| | 155| 18| case ASN1_Type::BmpString: ------------------ | Branch (155:7): [True: 18, False: 5.35k] ------------------ 156| 18| return "BMP STRING"; 157| | 158| 16| case ASN1_Type::UniversalString: ------------------ | Branch (158:7): [True: 16, False: 5.36k] ------------------ 159| 16| return "UNIVERSAL STRING"; 160| | 161| 12| case ASN1_Type::UtcTime: ------------------ | Branch (161:7): [True: 12, False: 5.36k] ------------------ 162| 12| return "UTC TIME"; 163| | 164| 27| case ASN1_Type::GeneralizedTime: ------------------ | Branch (164:7): [True: 27, False: 5.34k] ------------------ 165| 27| return "GENERALIZED TIME"; 166| | 167| 222| case ASN1_Type::OctetString: ------------------ | Branch (167:7): [True: 222, False: 5.15k] ------------------ 168| 222| return "OCTET STRING"; 169| | 170| 193| case ASN1_Type::BitString: ------------------ | Branch (170:7): [True: 193, False: 5.18k] ------------------ 171| 193| return "BIT STRING"; 172| | 173| 14| case ASN1_Type::Enumerated: ------------------ | Branch (173:7): [True: 14, False: 5.36k] ------------------ 174| 14| return "ENUMERATED"; 175| | 176| 97| case ASN1_Type::Integer: ------------------ | Branch (176:7): [True: 97, False: 5.27k] ------------------ 177| 97| return "INTEGER"; 178| | 179| 77| case ASN1_Type::Null: ------------------ | Branch (179:7): [True: 77, False: 5.29k] ------------------ 180| 77| return "NULL"; 181| | 182| 39| case ASN1_Type::ObjectId: ------------------ | Branch (182:7): [True: 39, False: 5.33k] ------------------ 183| 39| return "OBJECT"; 184| | 185| 27| case ASN1_Type::Boolean: ------------------ | Branch (185:7): [True: 27, False: 5.34k] ------------------ 186| 27| return "BOOLEAN"; 187| | 188| 0| case ASN1_Type::NoObject: ------------------ | Branch (188:7): [True: 0, False: 5.37k] ------------------ 189| 0| return "NO_OBJECT"; 190| | 191| 416| default: ------------------ | Branch (191:7): [True: 416, False: 4.96k] ------------------ 192| 416| return "TAG(" + std::to_string(static_cast(type)) + ")"; 193| 5.37k| } 194| 5.37k|} _ZN5Botan18BER_Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 199| 7.17k|BER_Decoding_Error::BER_Decoding_Error(std::string_view err) : Decoding_Error(fmt("BER: {}", err)) {} _ZN5Botan11BER_Bad_TagC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEj: 201| 412|BER_Bad_Tag::BER_Bad_Tag(std::string_view str, uint32_t tagging) : BER_Decoding_Error(fmt("{}: {}", str, tagging)) {} _ZN5Botan4ASN115put_in_sequenceERKNSt3__16vectorIhNS1_9allocatorIhEEEE: 208| 30.6k|std::vector put_in_sequence(const std::vector& contents) { 209| 30.6k| return ASN1::put_in_sequence(contents.data(), contents.size()); 210| 30.6k|} _ZN5Botan4ASN115put_in_sequenceEPKhm: 212| 30.6k|std::vector put_in_sequence(const uint8_t bits[], size_t len) { 213| 30.6k| std::vector output = der_sequence_header(len); 214| 30.6k| output.reserve(output.size() + len); 215| 30.6k| if(len > 0) { ------------------ | Branch (215:7): [True: 28.0k, False: 2.55k] ------------------ 216| 28.0k| output.insert(output.end(), bits, bits + len); 217| 28.0k| } 218| 30.6k| return output; 219| 30.6k|} _ZN5Botan4ASN19to_stringERKNS_10BER_ObjectE: 224| 72.0k|std::string to_string(const BER_Object& obj) { 225| 72.0k| return bytes_to_string(obj.data()); 226| 72.0k|} _ZN5Botan4ASN19maybe_BERERNS_10DataSourceE: 231| 17.4k|bool maybe_BER(DataSource& source) { 232| 17.4k| uint8_t first_u8 = 0; 233| 17.4k| if(source.peek_byte(first_u8) == 0) { ------------------ | Branch (233:7): [True: 1.29k, False: 16.1k] ------------------ 234| 1.29k| BOTAN_ASSERT_EQUAL(source.read_byte(first_u8), 0, "Expected EOF"); ------------------ | | 97| 1.29k| do { \ | | 98| 1.29k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 99| 1.29k| if((expr1) != (expr2)) { \ | | ------------------ | | | Branch (99:10): [True: 0, False: 1.29k] | | ------------------ | | 100| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 101| 0| Botan::assertion_failure(#expr1 " == " #expr2, assertion_made, __func__, __FILE__, __LINE__); \ | | 102| 0| } \ | | 103| 1.29k| } while(0) | | ------------------ | | | Branch (103:12): [Folded, False: 1.29k] | | ------------------ ------------------ 235| 1.29k| throw Stream_IO_Error("ASN1::maybe_BER: Source was empty"); 236| 1.29k| } 237| | 238| 16.1k| const auto cons_seq = static_cast(ASN1_Class::Constructed) | static_cast(ASN1_Type::Sequence); 239| 16.1k| return first_u8 == cons_seq; 240| 17.4k|} _ZN5Botan3OID9from_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 66| 348|std::optional OID::from_name(std::string_view name) { 67| 348| if(name.empty()) { ------------------ | Branch (67:7): [True: 0, False: 348] ------------------ 68| 0| throw Invalid_Argument("OID::from_name argument must be non-empty"); 69| 0| } 70| | 71| 348| OID o = OID_Map::global_registry().str2oid(name); 72| 348| if(o.has_value()) { ------------------ | Branch (72:7): [True: 348, False: 0] ------------------ 73| 348| return std::optional(o); 74| 348| } 75| | 76| 0| return std::nullopt; 77| 348|} _ZN5Botan3OID11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 80| 22.9k|OID OID::from_string(std::string_view str) { 81| 22.9k| if(str.empty()) { ------------------ | Branch (81:7): [True: 0, False: 22.9k] ------------------ 82| 0| throw Invalid_Argument("OID::from_string argument must be non-empty"); 83| 0| } 84| | 85| 22.9k| OID o = OID_Map::global_registry().str2oid(str); 86| 22.9k| if(o.has_value()) { ------------------ | Branch (86:7): [True: 22.9k, False: 0] ------------------ 87| 22.9k| return o; 88| 22.9k| } 89| | 90| | // Try to parse as a dotted decimal 91| 0| try { 92| 0| return OID(str); 93| 0| } catch(...) {} 94| | 95| 0| throw Lookup_Error(fmt("No OID associated with name '{}'", str)); 96| 0|} _ZN5Botan3OIDC2ESt16initializer_listIjE: 98| 165k|OID::OID(std::initializer_list init) : m_id(init) { 99| 165k| oid_valid_check(m_id); 100| 165k|} _ZNK5Botan3OID9to_stringEv: 123| 1.69k|std::string OID::to_string() const { 124| 1.69k| std::ostringstream out; 125| | 126| 74.2k| for(size_t i = 0; i != m_id.size(); ++i) { ------------------ | Branch (126:22): [True: 72.5k, False: 1.69k] ------------------ 127| | // avoid locale issues with integer formatting 128| 72.5k| out << std::to_string(m_id[i]); 129| 72.5k| if(i != m_id.size() - 1) { ------------------ | Branch (129:10): [True: 70.8k, False: 1.69k] ------------------ 130| 70.8k| out << "."; 131| 70.8k| } 132| 72.5k| } 133| | 134| 1.69k| return out.str(); 135| 1.69k|} _ZNK5Botan3OID15registered_nameEv: 149| 9.20k|std::optional OID::registered_name() const { 150| 9.20k| return OID_Map::global_registry().oid2str(*this); 151| 9.20k|} _ZNK5Botan3OID14registered_oidEv: 153| 3.58k|bool OID::registered_oid() const { 154| 3.58k| return this->registered_name().has_value(); 155| 3.58k|} _ZNK5Botan3OID7matchesESt16initializer_listIjE: 157| 8.19k|bool OID::matches(std::initializer_list other) const { 158| | // TODO: once all target compilers support it, use std::ranges::equal 159| 8.19k| return std::equal(m_id.begin(), m_id.end(), other.begin(), other.end()); 160| 8.19k|} _ZNK5Botan3OID9hash_codeEv: 162| 10.5k|uint64_t OID::hash_code() const { 163| | // If this is changed also update gen_oids.py to match 164| 10.5k| uint64_t hash = 0x621F302327D9A49A; 165| 195k| for(const auto id : m_id) { ------------------ | Branch (165:22): [True: 195k, False: 10.5k] ------------------ 166| 195k| hash *= 193; 167| 195k| hash += id; 168| 195k| } 169| 10.5k| return hash; 170| 10.5k|} _ZN5BotanltERKNS_3OIDES2_: 175| 384k|bool operator<(const OID& a, const OID& b) { 176| 384k| const std::vector& oid1 = a.get_components(); 177| 384k| const std::vector& oid2 = b.get_components(); 178| | 179| 384k| return std::lexicographical_compare(oid1.begin(), oid1.end(), oid2.begin(), oid2.end()); 180| 384k|} _ZNK5Botan3OID11encode_intoERNS_11DER_EncoderE: 185| 49.3k|void OID::encode_into(DER_Encoder& der) const { 186| 49.3k| if(m_id.size() < 2) { ------------------ | Branch (186:7): [True: 0, False: 49.3k] ------------------ 187| 0| throw Invalid_Argument("OID::encode_into: OID is invalid"); 188| 0| } 189| | 190| 49.3k| const auto append = [](std::vector& encoding, uint32_t z) { 191| 49.3k| if(z <= 0x7F) { 192| 49.3k| encoding.push_back(static_cast(z)); 193| 49.3k| } else { 194| 49.3k| const size_t z7 = (high_bit(z) + 7 - 1) / 7; 195| | 196| 49.3k| for(size_t j = 0; j != z7; ++j) { 197| 49.3k| uint8_t zp = static_cast(z >> (7 * (z7 - j - 1)) & 0x7F); 198| | 199| 49.3k| if(j != z7 - 1) { 200| 49.3k| zp |= 0x80; 201| 49.3k| } 202| | 203| 49.3k| encoding.push_back(zp); 204| 49.3k| } 205| 49.3k| } 206| 49.3k| }; 207| | 208| 49.3k| std::vector encoding; 209| | 210| | // We know 40 * root can't overflow because root is between 0 and 2 211| 49.3k| auto first = checked_add(40 * m_id[0], m_id[1]); 212| 49.3k| BOTAN_ASSERT_NOMSG(first.has_value()); ------------------ | | 84| 49.3k| do { \ | | 85| 49.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 49.3k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 49.3k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 49.3k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 49.3k] | | ------------------ ------------------ 213| | 214| 49.3k| append(encoding, *first); 215| | 216| 185k| for(size_t i = 2; i != m_id.size(); ++i) { ------------------ | Branch (216:22): [True: 136k, False: 49.3k] ------------------ 217| 136k| append(encoding, m_id[i]); 218| 136k| } 219| 49.3k| der.add_object(ASN1_Type::ObjectId, ASN1_Class::Universal, encoding); 220| 49.3k|} _ZN5Botan3OID11decode_fromERNS_11BER_DecoderE: 225| 118k|void OID::decode_from(BER_Decoder& decoder) { 226| 118k| const BER_Object obj = decoder.get_next_object(); 227| 118k| if(obj.tagging() != (ASN1_Class::Universal | ASN1_Type::ObjectId)) { ------------------ | Branch (227:7): [True: 368, False: 118k] ------------------ 228| 368| throw BER_Bad_Tag("Error decoding OID, unknown tag", obj.tagging()); 229| 368| } 230| | 231| 118k| if(obj.length() == 0) { ------------------ | Branch (231:7): [True: 8, False: 118k] ------------------ 232| 8| throw BER_Decoding_Error("OID encoding is too short"); 233| 8| } 234| | 235| 118k| const auto consume = [](BufferSlicer& data) -> uint32_t { 236| 118k| BOTAN_ASSERT_NOMSG(!data.empty()); 237| 118k| uint32_t b = data.take_byte(); 238| | 239| 118k| if(b > 0x7F) { 240| 118k| b &= 0x7F; 241| | 242| | // Even BER requires that the OID have minimal length, ie that 243| | // the first byte of a multibyte encoding cannot be zero 244| | // See X.690 section 8.19.2 245| 118k| if(b == 0) { 246| 118k| throw Decoding_Error("Leading zero byte in multibyte OID encoding"); 247| 118k| } 248| | 249| 118k| while(true) { 250| 118k| if(data.empty()) { 251| 118k| throw Decoding_Error("Truncated OID value"); 252| 118k| } 253| | 254| 118k| const uint8_t next = data.take_byte(); 255| 118k| const bool more = (next & 0x80) == 0x80; 256| 118k| const uint8_t value = next & 0x7F; 257| | 258| 118k| if((b >> (32 - 7)) != 0) { 259| 118k| throw Decoding_Error("OID component overflow"); 260| 118k| } 261| | 262| 118k| b = (b << 7) | value; 263| | 264| 118k| if(!more) { 265| 118k| break; 266| 118k| } 267| 118k| } 268| 118k| } 269| | 270| 118k| return b; 271| 118k| }; 272| | 273| 118k| BufferSlicer data(obj.data()); 274| 118k| std::vector parts; 275| | 276| | // Each byte of the DER encoding can result in at most one additional arc, 277| | // except the first byte which always encodes two. Don't reserve for more than 278| | // 16 arcs though; the longest OID in our current table has just 13 arcs. 279| 118k| parts.reserve(std::min(16, obj.length() + 1)); 280| | 281| 806k| while(!data.empty()) { ------------------ | Branch (281:10): [True: 687k, False: 118k] ------------------ 282| 687k| const uint32_t comp = consume(data); 283| | 284| 687k| if(parts.empty()) { ------------------ | Branch (284:10): [True: 118k, False: 569k] ------------------ 285| | // divide into root and second arc 286| | 287| 118k| const uint32_t root_arc = [](uint32_t b0) -> uint32_t { 288| 118k| if(b0 < 40) { 289| 118k| return 0; 290| 118k| } else if(b0 < 80) { 291| 118k| return 1; 292| 118k| } else { 293| 118k| return 2; 294| 118k| } 295| 118k| }(comp); 296| | 297| 118k| parts.push_back(root_arc); 298| 118k| BOTAN_ASSERT_NOMSG(comp >= 40 * root_arc); ------------------ | | 84| 118k| do { \ | | 85| 118k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 118k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 118k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 118k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 118k] | | ------------------ ------------------ 299| 118k| parts.push_back(comp - 40 * root_arc); 300| 569k| } else { 301| 569k| parts.push_back(comp); 302| 569k| } 303| 687k| } 304| | 305| 118k| m_id = std::move(parts); 306| 118k|} _ZN5BotanlsERNSt3__113basic_ostreamIcNS0_11char_traitsIcEEEERKNS_3OIDE: 308| 285|std::ostream& operator<<(std::ostream& out, const OID& oid) { 309| 285| out << oid.to_string(); 310| 285| return out; 311| 285|} asn1_oid.cpp:_ZN5Botan12_GLOBAL__N_115oid_valid_checkENSt3__14spanIKjLm18446744073709551615EEE: 26| 165k|void oid_valid_check(std::span oid) { 27| 165k| BOTAN_ARG_CHECK(oid.size() >= 2, "OID too short to be valid"); ------------------ | | 35| 165k| do { \ | | 36| 165k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 165k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 165k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 165k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 165k] | | ------------------ ------------------ 28| 165k| BOTAN_ARG_CHECK(oid[0] <= 2, "OID root out of range"); ------------------ | | 35| 165k| do { \ | | 36| 165k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 165k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 165k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 165k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 165k] | | ------------------ ------------------ 29| 165k| BOTAN_ARG_CHECK(oid[1] <= 39 || oid[0] == 2, "OID second arc too large"); ------------------ | | 35| 165k| do { \ | | 36| 165k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 165k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 165k, False: 0] | | | Branch (37:12): [True: 0, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 165k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 165k] | | ------------------ ------------------ 30| | // This last is a limitation of using 32 bit integers when decoding 31| | // not a limitation of ASN.1 object identifiers in general 32| 165k| BOTAN_ARG_CHECK(oid[1] <= 0xFFFFFFAF, "OID second arc too large"); ------------------ | | 35| 165k| do { \ | | 36| 165k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 165k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 165k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 165k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 165k] | | ------------------ ------------------ 33| 165k|} asn1_oid.cpp:_ZZNK5Botan3OID11encode_intoERNS_11DER_EncoderEENK3$_0clERNSt3__16vectorIhNS4_9allocatorIhEEEEj: 190| 185k| const auto append = [](std::vector& encoding, uint32_t z) { 191| 185k| if(z <= 0x7F) { ------------------ | Branch (191:10): [True: 159k, False: 26.4k] ------------------ 192| 159k| encoding.push_back(static_cast(z)); 193| 159k| } else { 194| 26.4k| const size_t z7 = (high_bit(z) + 7 - 1) / 7; 195| | 196| 88.8k| for(size_t j = 0; j != z7; ++j) { ------------------ | Branch (196:28): [True: 62.4k, False: 26.4k] ------------------ 197| 62.4k| uint8_t zp = static_cast(z >> (7 * (z7 - j - 1)) & 0x7F); 198| | 199| 62.4k| if(j != z7 - 1) { ------------------ | Branch (199:16): [True: 35.9k, False: 26.4k] ------------------ 200| 35.9k| zp |= 0x80; 201| 35.9k| } 202| | 203| 62.4k| encoding.push_back(zp); 204| 62.4k| } 205| 26.4k| } 206| 185k| }; asn1_oid.cpp:_ZZN5Botan3OID11decode_fromERNS_11BER_DecoderEENK3$_0clERNS_12BufferSlicerE: 235| 687k| const auto consume = [](BufferSlicer& data) -> uint32_t { 236| 687k| BOTAN_ASSERT_NOMSG(!data.empty()); ------------------ | | 84| 687k| do { \ | | 85| 687k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 687k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 687k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 687k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 687k] | | ------------------ ------------------ 237| 687k| uint32_t b = data.take_byte(); 238| | 239| 687k| if(b > 0x7F) { ------------------ | Branch (239:10): [True: 90.4k, False: 597k] ------------------ 240| 90.4k| b &= 0x7F; 241| | 242| | // Even BER requires that the OID have minimal length, ie that 243| | // the first byte of a multibyte encoding cannot be zero 244| | // See X.690 section 8.19.2 245| 90.4k| if(b == 0) { ------------------ | Branch (245:13): [True: 25, False: 90.4k] ------------------ 246| 25| throw Decoding_Error("Leading zero byte in multibyte OID encoding"); 247| 25| } 248| | 249| 121k| while(true) { ------------------ | Branch (249:16): [True: 121k, Folded] ------------------ 250| 121k| if(data.empty()) { ------------------ | Branch (250:16): [True: 188, False: 121k] ------------------ 251| 188| throw Decoding_Error("Truncated OID value"); 252| 188| } 253| | 254| 121k| const uint8_t next = data.take_byte(); 255| 121k| const bool more = (next & 0x80) == 0x80; 256| 121k| const uint8_t value = next & 0x7F; 257| | 258| 121k| if((b >> (32 - 7)) != 0) { ------------------ | Branch (258:16): [True: 66, False: 121k] ------------------ 259| 66| throw Decoding_Error("OID component overflow"); 260| 66| } 261| | 262| 121k| b = (b << 7) | value; 263| | 264| 121k| if(!more) { ------------------ | Branch (264:16): [True: 90.2k, False: 30.8k] ------------------ 265| 90.2k| break; 266| 90.2k| } 267| 121k| } 268| 90.4k| } 269| | 270| 687k| return b; 271| 687k| }; asn1_oid.cpp:_ZZN5Botan3OID11decode_fromERNS_11BER_DecoderEENK3$_1clEj: 287| 118k| const uint32_t root_arc = [](uint32_t b0) -> uint32_t { 288| 118k| if(b0 < 40) { ------------------ | Branch (288:16): [True: 6.08k, False: 112k] ------------------ 289| 6.08k| return 0; 290| 112k| } else if(b0 < 80) { ------------------ | Branch (290:23): [True: 51.8k, False: 60.2k] ------------------ 291| 51.8k| return 1; 292| 60.2k| } else { 293| 60.2k| return 2; 294| 60.2k| } 295| 118k| }(comp); _ZN5Botan11ASN1_String14is_string_typeENS_9ASN1_TypeE: 131| 7.69k|bool ASN1_String::is_string_type(ASN1_Type tag) { 132| 7.69k| return is_asn1_string_type(tag); 133| 7.69k|} _ZN5Botan11ASN1_StringC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_9ASN1_TypeE: 135| 46.7k|ASN1_String::ASN1_String(std::string_view str, ASN1_Type t) : m_utf8_str(str), m_tag(t) { 136| 46.7k| if(!is_utf8_subset_string_type(m_tag)) { ------------------ | Branch (136:7): [True: 54, False: 46.6k] ------------------ 137| 54| throw Invalid_Argument("ASN1_String only supports encoding to UTF-8 or a UTF-8 subset"); 138| 54| } 139| | 140| 46.6k| if(!is_valid_asn1_string_content(m_utf8_str, m_tag)) { ------------------ | Branch (140:7): [True: 2.18k, False: 44.5k] ------------------ 141| 2.18k| throw Invalid_Argument(fmt("ASN1_String: Invalid {} encoding", asn1_tag_to_string(m_tag))); 142| 2.18k| } 143| 46.6k|} _ZN5Botan11ASN1_StringC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 145| 40.2k|ASN1_String::ASN1_String(std::string_view str) : ASN1_String(str, choose_encoding(str)) {} _ZN5Botan11ASN1_String11decode_fromERNS_11BER_DecoderE: 162| 40.2k|void ASN1_String::decode_from(BER_Decoder& source) { 163| 40.2k| const BER_Object obj = source.get_next_object(); 164| | 165| 40.2k| if(obj.get_class() != ASN1_Class::Universal || !is_asn1_string_type(obj.type())) { ------------------ | Branch (165:7): [True: 20, False: 40.2k] | Branch (165:51): [True: 59, False: 40.1k] ------------------ 166| 65| auto typ = static_cast(obj.type()); 167| 65| auto cls = static_cast(obj.get_class()); 168| 65| throw Decoding_Error(fmt("ASN1_String: Unknown string type {}/{}", typ, cls)); 169| 65| } 170| | 171| 40.1k| m_tag = obj.type(); 172| 40.1k| m_data.assign(obj.bits(), obj.bits() + obj.length()); 173| | 174| 40.1k| if(m_tag == ASN1_Type::BmpString) { ------------------ | Branch (174:7): [True: 4.78k, False: 35.4k] ------------------ 175| 4.78k| m_utf8_str = ucs2_to_utf8(m_data); 176| 35.4k| } else if(m_tag == ASN1_Type::UniversalString) { ------------------ | Branch (176:14): [True: 284, False: 35.1k] ------------------ 177| 284| m_utf8_str = ucs4_to_utf8(m_data); 178| 35.1k| } else if(m_tag == ASN1_Type::TeletexString) { ------------------ | Branch (178:14): [True: 723, False: 34.4k] ------------------ 179| | /* 180| | TeletexString is nominally ITU T.61 not ISO-8859-1 but it seems 181| | the majority of implementations actually used that charset here. 182| | */ 183| 723| m_utf8_str = latin1_to_utf8(m_data); 184| 34.4k| } else { 185| | // All other supported string types are UTF-8 or some subset thereof 186| 34.4k| m_utf8_str = ASN1::to_string(obj); 187| | 188| 34.4k| if(!is_valid_asn1_string_content(m_utf8_str, m_tag)) { ------------------ | Branch (188:10): [True: 94, False: 34.3k] ------------------ 189| 94| throw Decoding_Error(fmt("ASN1_String: Invalid {} encoding", asn1_tag_to_string(m_tag))); 190| 94| } 191| 34.4k| } 192| 40.1k|} asn1_str.cpp:_ZN5Botan12_GLOBAL__N_119is_asn1_string_typeENS_9ASN1_TypeE: 99| 47.9k|bool is_asn1_string_type(ASN1_Type tag) { 100| 47.9k| return (is_utf8_subset_string_type(tag) || tag == ASN1_Type::TeletexString || tag == ASN1_Type::BmpString || ------------------ | Branch (100:12): [True: 41.0k, False: 6.85k] | Branch (100:47): [True: 845, False: 6.00k] | Branch (100:82): [True: 4.80k, False: 1.20k] ------------------ 101| 1.20k| tag == ASN1_Type::UniversalString); ------------------ | Branch (101:12): [True: 296, False: 912] ------------------ 102| 47.9k|} asn1_str.cpp:_ZN5Botan12_GLOBAL__N_126is_utf8_subset_string_typeENS_9ASN1_TypeE: 94| 175k|bool is_utf8_subset_string_type(ASN1_Type tag) { 95| 175k| return (tag == ASN1_Type::NumericString || tag == ASN1_Type::PrintableString || tag == ASN1_Type::VisibleString || ------------------ | Branch (95:12): [True: 397, False: 175k] | Branch (95:47): [True: 106k, False: 68.8k] | Branch (95:84): [True: 138, False: 68.6k] ------------------ 96| 68.6k| tag == ASN1_Type::Ia5String || tag == ASN1_Type::Utf8String); ------------------ | Branch (96:12): [True: 8.01k, False: 60.6k] | Branch (96:43): [True: 53.7k, False: 6.90k] ------------------ 97| 175k|} asn1_str.cpp:_ZN5Botan12_GLOBAL__N_128is_valid_asn1_string_contentERKNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS_9ASN1_TypeE: 104| 81.0k|bool is_valid_asn1_string_content(const std::string& str, ASN1_Type tag) { 105| 81.0k| BOTAN_ASSERT_NOMSG(is_utf8_subset_string_type(tag)); ------------------ | | 84| 81.0k| do { \ | | 85| 81.0k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 81.0k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 81.0k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 81.0k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 81.0k] | | ------------------ ------------------ 106| | 107| 81.0k| switch(tag) { 108| 23.6k| case ASN1_Type::Utf8String: ------------------ | Branch (108:7): [True: 23.6k, False: 57.3k] ------------------ 109| 23.6k| return is_valid_utf8(str); 110| 169| case ASN1_Type::NumericString: ------------------ | Branch (110:7): [True: 169, False: 80.9k] ------------------ 111| 53.3k| case ASN1_Type::PrintableString: ------------------ | Branch (111:7): [True: 53.1k, False: 27.8k] ------------------ 112| 57.3k| case ASN1_Type::Ia5String: ------------------ | Branch (112:7): [True: 3.96k, False: 77.1k] ------------------ 113| 57.3k| case ASN1_Type::VisibleString: ------------------ | Branch (113:7): [True: 58, False: 81.0k] ------------------ 114| 57.3k| return g_char_validator.valid_encoding(str, tag); 115| 0| default: ------------------ | Branch (115:7): [True: 0, False: 81.0k] ------------------ 116| 0| return false; 117| 81.0k| } 118| 81.0k|} asn1_str.cpp:_ZNK5Botan12_GLOBAL__N_131ASN1_String_Codepoint_Validator14valid_encodingENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEENS_9ASN1_TypeE: 25| 97.6k| constexpr bool valid_encoding(std::string_view str, ASN1_Type tag) const { 26| 97.6k| const uint8_t mask = mask_for(tag); 27| 244k| for(const char c : str) { ------------------ | Branch (27:27): [True: 244k, False: 97.5k] ------------------ 28| 244k| const uint8_t codepoint = static_cast(c); 29| 244k| const bool is_valid = (m_table[codepoint] & mask) != 0; 30| | 31| 244k| if(!is_valid) { ------------------ | Branch (31:16): [True: 77, False: 244k] ------------------ 32| 77| return false; 33| 77| } 34| 244k| } 35| | 36| 97.5k| return true; 37| 97.6k| } asn1_str.cpp:_ZN5Botan12_GLOBAL__N_131ASN1_String_Codepoint_Validator8mask_forENS_9ASN1_TypeE: 45| 97.6k| static constexpr uint8_t mask_for(ASN1_Type tag) { 46| 97.6k| switch(tag) { 47| 169| case ASN1_Type::NumericString: ------------------ | Branch (47:13): [True: 169, False: 97.4k] ------------------ 48| 169| return Numeric_String; 49| 93.4k| case ASN1_Type::PrintableString: ------------------ | Branch (49:13): [True: 93.4k, False: 4.19k] ------------------ 50| 93.4k| return Printable_String; 51| 3.96k| case ASN1_Type::Ia5String: ------------------ | Branch (51:13): [True: 3.96k, False: 93.6k] ------------------ 52| 3.96k| return IA5_String; 53| 58| case ASN1_Type::VisibleString: ------------------ | Branch (53:13): [True: 58, False: 97.6k] ------------------ 54| 58| return Visible_String; 55| 0| default: ------------------ | Branch (55:13): [True: 0, False: 97.6k] ------------------ 56| 0| return 0; 57| 97.6k| } 58| 97.6k| } asn1_str.cpp:_ZN5Botan12_GLOBAL__N_115choose_encodingENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 120| 40.2k|ASN1_Type choose_encoding(std::string_view str) { 121| 40.2k| if(g_char_validator.valid_encoding(str, ASN1_Type::PrintableString)) { ------------------ | Branch (121:7): [True: 40.2k, False: 0] ------------------ 122| 40.2k| return ASN1_Type::PrintableString; 123| 40.2k| } else { 124| 0| return ASN1_Type::Utf8String; 125| 0| } 126| 40.2k|} _ZN5Botan9ASN1_TimeC2EthhhhhNS_9ASN1_TypeE: 43| 24.3k| m_year(year), m_month(month), m_day(day), m_hour(hour), m_minute(minute), m_second(second), m_tag(tag) { 44| 24.3k| if(tag != ASN1_Type::UtcTime && tag != ASN1_Type::GeneralizedTime) { ------------------ | Branch (44:7): [True: 519, False: 23.8k] | Branch (44:36): [True: 0, False: 519] ------------------ 45| 0| throw Invalid_Argument("ASN1_Time tag must be UtcTime or GeneralizedTime"); 46| 0| } 47| | 48| | /* 49| | * RFC 5280 Section 4.1.2.5: 50| | * To indicate that a certificate has no well-defined expiration date, 51| | * the notAfter SHOULD be assigned the GeneralizedTime value of 52| | * 99991231235959Z. 53| | */ 54| 24.3k| const uint16_t min_year = 1950; 55| 24.3k| const uint16_t max_year = (tag == ASN1_Type::UtcTime) ? 2049 : 9999; ------------------ | Branch (55:30): [True: 23.8k, False: 519] ------------------ 56| | 57| 24.3k| if(m_year < min_year || m_year > max_year) { ------------------ | Branch (57:7): [True: 10, False: 24.3k] | Branch (57:28): [True: 0, False: 24.3k] ------------------ 58| 10| throw Invalid_Argument(fmt("ASN1_Time year {} is out of range ({} to {})", m_year, min_year, max_year)); 59| 10| } 60| | 61| 24.3k| if(m_month < 1 || m_month > 12) { ------------------ | Branch (61:7): [True: 1, False: 24.3k] | Branch (61:22): [True: 7, False: 24.3k] ------------------ 62| 8| throw Invalid_Argument(fmt("ASN1_Time month {} is out of range", static_cast(m_month))); 63| 8| } 64| | 65| 24.3k| constexpr uint8_t days_in_month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; 66| | 67| 24.3k| const bool is_leap_year = (m_year % 4 == 0) && (m_year % 100 != 0 || m_year % 400 == 0); ------------------ | Branch (67:30): [True: 4.59k, False: 19.7k] | Branch (67:52): [True: 4.29k, False: 293] | Branch (67:73): [True: 292, False: 1] ------------------ 68| 24.3k| const uint8_t max_day = (m_month == 2 && is_leap_year) ? 29 : days_in_month[m_month - 1]; ------------------ | Branch (68:29): [True: 1.47k, False: 22.8k] | Branch (68:45): [True: 201, False: 1.27k] ------------------ 69| | 70| 24.3k| if(m_day < 1 || m_day > max_day) { ------------------ | Branch (70:7): [True: 1, False: 24.3k] | Branch (70:20): [True: 5, False: 24.2k] ------------------ 71| 6| throw Invalid_Argument(fmt("ASN1_Time day {} is out of range for month {}", 72| 6| static_cast(m_day), 73| 6| static_cast(m_month))); 74| 6| } 75| | 76| 24.2k| if(m_hour > 23) { ------------------ | Branch (76:7): [True: 4, False: 24.2k] ------------------ 77| 4| throw Invalid_Argument(fmt("ASN1_Time hour {} is out of range", static_cast(m_hour))); 78| 4| } 79| | 80| 24.2k| if(m_minute > 59) { ------------------ | Branch (80:7): [True: 3, False: 24.2k] ------------------ 81| 3| throw Invalid_Argument(fmt("ASN1_Time minute {} is out of range", static_cast(m_minute))); 82| 3| } 83| | 84| | /* 85| | * RFC 5280 is silent on the issue of leap seconds in certificate fields, but both 86| | * OpenSSL and Go reject which suggests they are rarely if ever used in practice. 87| | */ 88| 24.2k| if(m_second > 59) { ------------------ | Branch (88:7): [True: 3, False: 24.2k] ------------------ 89| 3| throw Invalid_Argument(fmt("ASN1_Time second {} is out of range", static_cast(m_second))); 90| 3| } 91| 24.2k|} _ZN5Botan9ASN1_Time15from_time_pointERKNSt3__16chrono10time_pointINS2_12system_clockENS2_8durationIxNS1_5ratioILl1ELl1000000EEEEEEE: 94| 3.60k|ASN1_Time ASN1_Time::from_time_point(const std::chrono::system_clock::time_point& time) { 95| 3.60k| const calendar_point cal(time); 96| | 97| 3.60k| const ASN1_Type tag = (cal.year() >= 2050) ? ASN1_Type::GeneralizedTime : ASN1_Type::UtcTime; ------------------ | Branch (97:26): [True: 0, False: 3.60k] ------------------ 98| | 99| 3.60k| return ASN1_Time(static_cast(cal.year()), 100| 3.60k| static_cast(cal.month()), 101| 3.60k| static_cast(cal.day()), 102| 3.60k| static_cast(cal.hour()), 103| 3.60k| static_cast(cal.minutes()), 104| 3.60k| static_cast(cal.seconds()), 105| 3.60k| tag); 106| 3.60k|} _ZN5Botan9ASN1_Time11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_9ASN1_TypeE: 109| 20.7k|ASN1_Time ASN1_Time::from_string(std::string_view t_spec, ASN1_Type tag) { 110| 20.7k| BOTAN_ARG_CHECK(tag == ASN1_Type::UtcTime || tag == ASN1_Type::GeneralizedTime, "Invalid tag for ASN1_Time"); ------------------ | | 35| 20.7k| do { \ | | 36| 20.7k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 21.2k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 20.2k, False: 528] | | | Branch (37:12): [True: 528, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 20.7k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 20.7k] | | ------------------ ------------------ 111| | 112| 20.7k| if(tag == ASN1_Type::GeneralizedTime) { ------------------ | Branch (112:7): [True: 528, False: 20.2k] ------------------ 113| 528| BOTAN_ARG_CHECK(t_spec.size() == 15, "Invalid GeneralizedTime input string"); ------------------ | | 35| 528| do { \ | | 36| 528| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 528| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 6, False: 522] | | ------------------ | | 38| 6| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 6| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 6| } \ | | 41| 528| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 528] | | ------------------ ------------------ 114| 20.2k| } else { 115| 20.2k| BOTAN_ARG_CHECK(t_spec.size() == 13, "Invalid UTCTime input string"); ------------------ | | 35| 20.2k| do { \ | | 36| 20.2k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 20.2k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 8, False: 20.2k] | | ------------------ | | 38| 8| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 8| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 8| } \ | | 41| 20.2k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 20.2k] | | ------------------ ------------------ 116| 20.2k| } 117| | 118| 20.7k| BOTAN_ARG_CHECK(t_spec.back() == 'Z', "Botan does not support ASN1 times with timezones other than Z"); ------------------ | | 35| 20.7k| do { \ | | 36| 20.7k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 20.7k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 9, False: 20.7k] | | ------------------ | | 38| 9| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 9| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 9| } \ | | 41| 20.7k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 20.7k] | | ------------------ ------------------ 119| | 120| 20.7k| const size_t field_len = 2; 121| 20.7k| const size_t year_len = (tag == ASN1_Type::UtcTime) ? 2 : 4; ------------------ | Branch (121:28): [True: 20.2k, False: 544] ------------------ 122| | 123| 20.7k| const size_t year_start = 0; 124| 20.7k| const size_t month_start = year_start + year_len; 125| 20.7k| const size_t day_start = month_start + field_len; 126| 20.7k| const size_t hour_start = day_start + field_len; 127| 20.7k| const size_t min_start = hour_start + field_len; 128| 20.7k| const size_t sec_start = min_start + field_len; 129| | 130| 20.7k| uint32_t year = to_u32bit(t_spec.substr(year_start, year_len)); 131| 20.7k| const uint32_t month = to_u32bit(t_spec.substr(month_start, field_len)); 132| 20.7k| const uint32_t day = to_u32bit(t_spec.substr(day_start, field_len)); 133| 20.7k| const uint32_t hour = to_u32bit(t_spec.substr(hour_start, field_len)); 134| 20.7k| const uint32_t minute = to_u32bit(t_spec.substr(min_start, field_len)); 135| 20.7k| const uint32_t second = to_u32bit(t_spec.substr(sec_start, field_len)); 136| | 137| 20.7k| if(tag == ASN1_Type::UtcTime) { ------------------ | Branch (137:7): [True: 20.2k, False: 556] ------------------ 138| | // Interpret the two digit year by the 1950/2050 split (RFC 5280 Section 4.1.2.5.1) 139| 20.2k| year += (year >= 50) ? 1900 : 2000; ------------------ | Branch (139:15): [True: 2.05k, False: 18.1k] ------------------ 140| 20.2k| } 141| | 142| 20.7k| return ASN1_Time(static_cast(year), 143| 20.7k| static_cast(month), 144| 20.7k| static_cast(day), 145| 20.7k| static_cast(hour), 146| 20.7k| static_cast(minute), 147| 20.7k| static_cast(second), 148| 20.7k| tag); 149| 20.7k|} _ZN5Botan9ASN1_Time11decode_fromERNS_11BER_DecoderE: 168| 20.8k|void ASN1_Time::decode_from(BER_Decoder& source) { 169| 20.8k| const BER_Object ber_time = source.get_next_object(); 170| | 171| 20.8k| if(ber_time.get_class() != ASN1_Class::Universal || ------------------ | Branch (171:7): [True: 18, False: 20.8k] ------------------ 172| 20.8k| (ber_time.type() != ASN1_Type::UtcTime && ber_time.type() != ASN1_Type::GeneralizedTime)) { ------------------ | Branch (172:8): [True: 598, False: 20.2k] | Branch (172:49): [True: 70, False: 528] ------------------ 173| 77| throw Decoding_Error(fmt("ASN1_Time: Unexpected tag {}/{}", 174| 77| static_cast(ber_time.type()), 175| 77| static_cast(ber_time.get_class()))); 176| 77| } 177| | 178| 20.7k| try { 179| | // Assigning only after a successful parse means that a decoding error 180| | // cannot leave this object in a partially written state 181| 20.7k| *this = ASN1_Time::from_string(ASN1::to_string(ber_time), ber_time.type()); 182| 20.7k| } catch(Invalid_Argument& e) { 183| 71| throw Decoding_Error(fmt("Invalid ASN1_Time encoding: {}", e.what())); 184| 71| } 185| 20.7k|} _ZNK5Botan9ASN1_Time11time_is_setEv: 233| 204|bool ASN1_Time::time_is_set() const { 234| 204| return (m_year != 0); 235| 204|} _ZNK5Botan9ASN1_Time3cmpERKS0_: 237| 102|int32_t ASN1_Time::cmp(const ASN1_Time& other) const { 238| 102| if(!time_is_set() || !other.time_is_set()) { ------------------ | Branch (238:7): [True: 0, False: 102] | Branch (238:25): [True: 0, False: 102] ------------------ 239| 0| throw Invalid_State("ASN1_Time::cmp: Cannot compare empty times"); 240| 0| } 241| | 242| 102| constexpr int32_t EARLIER = -1; 243| 102| constexpr int32_t LATER = 1; 244| 102| constexpr int32_t SAME_TIME = 0; 245| | 246| 102| if(m_year < other.m_year) { ------------------ | Branch (246:7): [True: 20, False: 82] ------------------ 247| 20| return EARLIER; 248| 20| } 249| 82| if(m_year > other.m_year) { ------------------ | Branch (249:7): [True: 73, False: 9] ------------------ 250| 73| return LATER; 251| 73| } 252| 9| if(m_month < other.m_month) { ------------------ | Branch (252:7): [True: 1, False: 8] ------------------ 253| 1| return EARLIER; 254| 1| } 255| 8| if(m_month > other.m_month) { ------------------ | Branch (255:7): [True: 1, False: 7] ------------------ 256| 1| return LATER; 257| 1| } 258| 7| if(m_day < other.m_day) { ------------------ | Branch (258:7): [True: 1, False: 6] ------------------ 259| 1| return EARLIER; 260| 1| } 261| 6| if(m_day > other.m_day) { ------------------ | Branch (261:7): [True: 6, False: 0] ------------------ 262| 6| return LATER; 263| 6| } 264| 0| if(m_hour < other.m_hour) { ------------------ | Branch (264:7): [True: 0, False: 0] ------------------ 265| 0| return EARLIER; 266| 0| } 267| 0| if(m_hour > other.m_hour) { ------------------ | Branch (267:7): [True: 0, False: 0] ------------------ 268| 0| return LATER; 269| 0| } 270| 0| if(m_minute < other.m_minute) { ------------------ | Branch (270:7): [True: 0, False: 0] ------------------ 271| 0| return EARLIER; 272| 0| } 273| 0| if(m_minute > other.m_minute) { ------------------ | Branch (273:7): [True: 0, False: 0] ------------------ 274| 0| return LATER; 275| 0| } 276| 0| if(m_second < other.m_second) { ------------------ | Branch (276:7): [True: 0, False: 0] ------------------ 277| 0| return EARLIER; 278| 0| } 279| 0| if(m_second > other.m_second) { ------------------ | Branch (279:7): [True: 0, False: 0] ------------------ 280| 0| return LATER; 281| 0| } 282| | 283| 0| return SAME_TIME; 284| 0|} _ZN5BotanltERKNS_9ASN1_TimeES2_: 319| 51|bool operator<(const ASN1_Time& t1, const ASN1_Time& t2) { 320| 51| return (t1.cmp(t2) < 0); 321| 51|} _ZN5BotangtERKNS_9ASN1_TimeES2_: 323| 51|bool operator>(const ASN1_Time& t1, const ASN1_Time& t2) { 324| 51| return (t1.cmp(t2) > 0); 325| 51|} _ZN5Botan11BER_DecoderD2Ev: 456| 343k|BER_Decoder::~BER_Decoder() = default; _ZNK5Botan11BER_Decoder10more_itemsEv: 461| 206k|bool BER_Decoder::more_items() const { 462| 206k| if(m_source->end_of_data() && !m_pushed.is_set()) { ------------------ | Branch (462:7): [True: 71.5k, False: 134k] | Branch (462:34): [True: 71.5k, False: 0] ------------------ 463| 71.5k| return false; 464| 71.5k| } 465| 134k| return true; 466| 206k|} _ZN5Botan11BER_Decoder10verify_endEv: 471| 66.6k|BER_Decoder& BER_Decoder::verify_end() { 472| 66.6k| return verify_end("BER_Decoder::verify_end called, but data remains"); 473| 66.6k|} _ZN5Botan11BER_Decoder10verify_endENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 478| 76.9k|BER_Decoder& BER_Decoder::verify_end(std::string_view err) { 479| 76.9k| if(!m_source->end_of_data() || m_pushed.is_set()) { ------------------ | Branch (479:7): [True: 283, False: 76.6k] | Branch (479:35): [True: 0, False: 76.6k] ------------------ 480| 283| throw Decoding_Error(err); 481| 283| } 482| 76.6k| return (*this); 483| 76.9k|} _ZN5Botan11BER_Decoder17discard_remainingEv: 488| 433|BER_Decoder& BER_Decoder::discard_remaining() { 489| 433| m_pushed = BER_Object(); 490| 433| uint8_t buf[64]; 491| 1.28k| while(m_source->read(buf, sizeof(buf)) != 0) {} ------------------ | Branch (491:10): [True: 850, False: 433] ------------------ 492| 433| return (*this); 493| 433|} _ZN5Botan11BER_Decoder10read_bytesENSt3__14spanIhLm18446744073709551615EEE: 505| 220k|size_t BER_Decoder::read_bytes(std::span out) { 506| 220k| BOTAN_ASSERT_NOMSG(m_source != nullptr); ------------------ | | 84| 220k| do { \ | | 85| 220k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 220k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 220k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 220k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 220k] | | ------------------ ------------------ 507| 220k| return m_source->read(out.data(), out.size()); 508| 220k|} _ZN5Botan11BER_Decoder16peek_next_objectEv: 510| 10.4k|const BER_Object& BER_Decoder::peek_next_object() { 511| 10.4k| if(!m_pushed.is_set()) { ------------------ | Branch (511:7): [True: 9.55k, False: 871] ------------------ 512| 9.55k| m_pushed = get_next_object(); 513| 9.55k| } 514| | 515| 10.4k| return m_pushed; 516| 10.4k|} _ZN5Botan11BER_Decoder15get_next_objectEv: 521| 641k|BER_Object BER_Decoder::get_next_object() { 522| 641k| BER_Object next; 523| | 524| 641k| if(m_pushed.is_set()) { ------------------ | Branch (524:7): [True: 58.1k, False: 583k] ------------------ 525| 58.1k| std::swap(next, m_pushed); 526| 58.1k| return next; 527| 58.1k| } 528| | 529| 583k| for(;;) { 530| 583k| ASN1_Type type_tag = ASN1_Type::NoObject; 531| 583k| ASN1_Class class_tag = ASN1_Class::NoObject; 532| 583k| decode_tag(m_source, type_tag, class_tag); 533| 583k| next.set_tagging(type_tag, class_tag); 534| 583k| if(next.is_set() == false) { // no more objects ------------------ | Branch (534:10): [True: 12.1k, False: 571k] ------------------ 535| 12.1k| return next; 536| 12.1k| } 537| | 538| 571k| const size_t allow_indef = m_limits.allow_ber_encoding() ? m_limits.max_nested_indefinite_length() : 0; ------------------ | Branch (538:34): [True: 0, False: 571k] ------------------ 539| 571k| const bool der_mode = m_limits.require_der_encoding(); 540| 571k| const auto dl = decode_length(m_source, allow_indef, der_mode, is_constructed(class_tag)); 541| | 542| | // Per X.690 8.1.5 the only valid EOC encoding is the two-octet 543| | // sequence 0x00 0x00. Reject any other length encoding on a tag of 544| | // (Eoc, Universal) before we consume the "content" bytes. 545| 571k| if(type_tag == ASN1_Type::Eoc && class_tag == ASN1_Class::Universal && ------------------ | Branch (545:10): [True: 28.5k, False: 542k] | Branch (545:40): [True: 325, False: 28.2k] ------------------ 546| 325| (dl.content_length() != 0 || dl.indefinite_length())) { ------------------ | Branch (546:11): [True: 141, False: 184] | Branch (546:39): [True: 0, False: 184] ------------------ 547| 141| throw BER_Decoding_Error("EOC marker with non-zero length"); 548| 141| } 549| | 550| 571k| if(const auto max_size = m_limits.max_object_size(); max_size && dl.content_length() > *max_size) { ------------------ | Branch (550:60): [True: 569k, False: 1.46k] | Branch (550:72): [True: 42, False: 569k] ------------------ 551| 42| throw BER_Decoding_Error("Encoded object exceeds maximum size"); 552| 42| } 553| | 554| 571k| if(!m_source->check_available(dl.total_length())) { ------------------ | Branch (554:10): [True: 1.47k, False: 569k] ------------------ 555| 1.47k| throw BER_Decoding_Error("Value truncated"); 556| 1.47k| } 557| | 558| 569k| uint8_t* out = next.mutable_bits(dl.content_length()); 559| 569k| if(m_source->read(out, dl.content_length()) != dl.content_length()) { ------------------ | Branch (559:10): [True: 0, False: 569k] ------------------ 560| 0| throw BER_Decoding_Error("Value truncated"); 561| 0| } 562| | 563| 569k| if(dl.indefinite_length()) { ------------------ | Branch (563:10): [True: 0, False: 569k] ------------------ 564| | // After reading the data consume the 2-byte EOC 565| 0| uint8_t eoc[2] = {0xFF, 0xFF}; 566| 0| if(m_source->read(eoc, 2) != 2 || eoc[0] != 0x00 || eoc[1] != 0x00) { ------------------ | Branch (566:13): [True: 0, False: 0] | Branch (566:44): [True: 0, False: 0] | Branch (566:62): [True: 0, False: 0] ------------------ 567| 0| throw BER_Decoding_Error("Missing or malformed EOC marker"); 568| 0| } 569| 0| } 570| | 571| 569k| if(next.tagging() == static_cast(ASN1_Type::Eoc)) { ------------------ | Branch (571:10): [True: 184, False: 569k] ------------------ 572| 184| if(m_limits.require_der_encoding()) { ------------------ | Branch (572:13): [True: 184, False: 0] ------------------ 573| 184| throw BER_Decoding_Error("Detected EOC marker in DER structure"); 574| 184| } 575| | // An EOC marker is only valid as an indefinite-length terminator, which 576| | // is consumed above when reading the indefinite-length object. A 577| | // standalone EOC is rejected unless the caller opted to tolerate it. 578| 0| if(m_limits.allow_standalone_eoc()) { ------------------ | Branch (578:13): [True: 0, False: 0] ------------------ 579| 0| continue; 580| 0| } 581| 0| throw BER_Decoding_Error("Encountered EOC marker outside of indefinite-length encoding"); 582| 0| } 583| | 584| 569k| break; 585| 569k| } 586| | 587| 569k| return next; 588| 583k|} _ZN5Botan11BER_Decoder9push_backEONS_10BER_ObjectE: 612| 58.9k|void BER_Decoder::push_back(BER_Object&& obj) { 613| 58.9k| if(m_pushed.is_set()) { ------------------ | Branch (613:7): [True: 0, False: 58.9k] ------------------ 614| 0| throw Invalid_State("BER_Decoder: Only one push back is allowed"); 615| 0| } 616| 58.9k| m_pushed = std::move(obj); 617| 58.9k|} _ZN5Botan11BER_Decoder10start_consENS_9ASN1_TypeENS_10ASN1_ClassE: 619| 232k|BER_Decoder BER_Decoder::start_cons(ASN1_Type type_tag, ASN1_Class class_tag) { 620| 232k| BER_Object obj = get_next_object(); 621| 232k| obj.assert_is_a(type_tag, class_tag | ASN1_Class::Constructed); 622| | 623| | // In DER mode the elements of a universal SET must appear in sorted order 624| 232k| if(m_limits.require_der_encoding() && type_tag == ASN1_Type::Set && class_tag == ASN1_Class::Universal) { ------------------ | Branch (624:7): [True: 229k, False: 2.79k] | Branch (624:42): [True: 39.7k, False: 189k] | Branch (624:72): [True: 39.7k, False: 0] ------------------ 625| 39.7k| verify_set_is_sorted(std::span{obj.bits(), obj.length()}); 626| 39.7k| } 627| | 628| 232k| BER_Decoder child(std::move(obj), this); 629| 232k| return child; 630| 232k|} _ZN5Botan11BER_Decoder8end_consEv: 635| 170k|BER_Decoder& BER_Decoder::end_cons() { 636| 170k| if(m_parent == nullptr) { ------------------ | Branch (636:7): [True: 0, False: 170k] ------------------ 637| 0| throw Invalid_State("BER_Decoder::end_cons called with null parent"); 638| 0| } 639| 170k| if(!m_source->end_of_data() || m_pushed.is_set()) { ------------------ | Branch (639:7): [True: 182, False: 170k] | Branch (639:35): [True: 371, False: 170k] ------------------ 640| 553| throw Decoding_Error("BER_Decoder::end_cons called with data left"); 641| 553| } 642| 170k| return (*m_parent); 643| 170k|} _ZN5Botan11BER_DecoderC2EONS_10BER_ObjectEPS0_: 646| 229k| m_limits(parent != nullptr ? parent->limits() : BER_Decoder::Limits::BER()), m_parent(parent) { ------------------ | Branch (646:16): [True: 229k, False: 0] ------------------ 647| 229k| m_data_src = std::make_unique(std::move(obj)); 648| 229k| m_source = m_data_src.get(); 649| 229k|} _ZN5Botan11BER_DecoderC2ERNS_10DataSourceENS0_6LimitsE: 659| 15.7k|BER_Decoder::BER_Decoder(DataSource& src, Limits limits) : m_limits(limits), m_source(&src) {} _ZN5Botan11BER_DecoderC2ENSt3__14spanIKhLm18446744073709551615EEENS0_6LimitsE: 664| 98.1k|BER_Decoder::BER_Decoder(std::span buf, Limits limits) : m_limits(limits) { 665| 98.1k| m_data_src = std::make_unique(buf); 666| 98.1k| m_source = m_data_src.get(); 667| 98.1k|} _ZN5Botan11BER_Decoder6decodeERNS_11ASN1_ObjectENS_9ASN1_TypeENS_10ASN1_ClassE: 676| 258k|BER_Decoder& BER_Decoder::decode(ASN1_Object& obj, ASN1_Type type_tag, ASN1_Class class_tag) { 677| | // TODO support this case properly 678| 258k| if(type_tag != ASN1_Type::NoObject || class_tag != ASN1_Class::NoObject) { ------------------ | Branch (678:7): [True: 0, False: 258k] | Branch (678:42): [True: 0, False: 258k] ------------------ 679| 0| throw Not_Implemented("BER_Decoder::decode(ASN1_Object) does not support implicit tagged decoding"); 680| 0| } 681| 258k| obj.decode_from(*this); 682| 258k| return (*this); 683| 258k|} _ZN5Botan11BER_Decoder11decode_nullEv: 688| 79|BER_Decoder& BER_Decoder::decode_null() { 689| 79| const BER_Object obj = get_next_object(); 690| 79| obj.assert_is_a(ASN1_Type::Null, ASN1_Class::Universal); 691| 79| if(obj.length() > 0) { ------------------ | Branch (691:7): [True: 16, False: 63] ------------------ 692| 16| throw BER_Decoding_Error("NULL object had nonzero size"); 693| 16| } 694| 63| return (*this); 695| 79|} _ZN5Botan11BER_Decoder6decodeERbNS_9ASN1_TypeENS_10ASN1_ClassE: 707| 6.84k|BER_Decoder& BER_Decoder::decode(bool& out, ASN1_Type type_tag, ASN1_Class class_tag) { 708| 6.84k| const BER_Object obj = get_next_object(); 709| 6.84k| obj.assert_is_a(type_tag, class_tag); 710| | 711| 6.84k| if(obj.length() != 1) { ------------------ | Branch (711:7): [True: 6, False: 6.84k] ------------------ 712| 6| throw BER_Decoding_Error("BER boolean value had invalid size"); 713| 6| } 714| | 715| 6.84k| const uint8_t val = obj.bits()[0]; 716| | 717| | // DER requires boolean values to be exactly 0x00 or 0xFF 718| 6.84k| if(m_limits.require_der_encoding() && val != 0x00 && val != 0xFF) { ------------------ | Branch (718:7): [True: 6.84k, False: 0] | Branch (718:42): [True: 6.75k, False: 88] | Branch (718:57): [True: 115, False: 6.63k] ------------------ 719| 115| throw BER_Decoding_Error("Detected non-canonical boolean encoding in DER structure"); 720| 115| } 721| | 722| 6.72k| out = (val != 0) ? true : false; ------------------ | Branch (722:10): [True: 6.63k, False: 88] ------------------ 723| | 724| 6.72k| return (*this); 725| 6.84k|} _ZN5Botan11BER_Decoder6decodeERmNS_9ASN1_TypeENS_10ASN1_ClassE: 730| 11.0k|BER_Decoder& BER_Decoder::decode(size_t& out, ASN1_Type type_tag, ASN1_Class class_tag) { 731| 11.0k| BigInt integer; 732| 11.0k| decode(integer, type_tag, class_tag); 733| | 734| 11.0k| if(integer.signum() < 0) { ------------------ | Branch (734:7): [True: 448, False: 10.5k] ------------------ 735| 448| throw BER_Decoding_Error("Decoded small integer value was negative"); 736| 448| } 737| | 738| 10.5k| if(integer.bits() > 32) { ------------------ | Branch (738:7): [True: 8, False: 10.5k] ------------------ 739| 8| throw BER_Decoding_Error("Decoded integer value larger than expected"); 740| 8| } 741| | 742| 10.5k| out = 0; 743| 52.6k| for(size_t i = 0; i != 4; ++i) { ------------------ | Branch (743:22): [True: 42.0k, False: 10.5k] ------------------ 744| 42.0k| out = (out << 8) | integer.byte_at(3 - i); 745| 42.0k| } 746| | 747| 10.5k| return (*this); 748| 10.5k|} _ZN5Botan11BER_Decoder6decodeERNS_6BigIntENS_9ASN1_TypeENS_10ASN1_ClassE: 780| 25.4k|BER_Decoder& BER_Decoder::decode(BigInt& out, ASN1_Type type_tag, ASN1_Class class_tag) { 781| 25.4k| const BER_Object obj = get_next_object(); 782| 25.4k| obj.assert_is_a(type_tag, class_tag); 783| | 784| | // An INTEGER must have at least one content octet (X.690 section 8.3.1) 785| 25.4k| if(obj.length() == 0) { ------------------ | Branch (785:7): [True: 28, False: 25.4k] ------------------ 786| 28| throw BER_Decoding_Error("INTEGER encoding has no content octets"); 787| 28| } 788| | 789| | // DER requires minimal INTEGER encoding (X.690 section 8.3.2) 790| 25.4k| if(m_limits.require_der_encoding()) { ------------------ | Branch (790:7): [True: 25.3k, False: 93] ------------------ 791| 25.3k| if(obj.length() > 1) { ------------------ | Branch (791:10): [True: 11.1k, False: 14.2k] ------------------ 792| 11.1k| if(obj.bits()[0] == 0x00 && (obj.bits()[1] & 0x80) == 0) { ------------------ | Branch (792:13): [True: 3.10k, False: 8.00k] | Branch (792:38): [True: 13, False: 3.09k] ------------------ 793| 13| throw BER_Decoding_Error("Detected non-minimal INTEGER encoding in DER structure"); 794| 13| } 795| 11.1k| if(obj.bits()[0] == 0xFF && (obj.bits()[1] & 0x80) != 0) { ------------------ | Branch (795:13): [True: 275, False: 10.8k] | Branch (795:38): [True: 9, False: 266] ------------------ 796| 9| throw BER_Decoding_Error("Detected non-minimal INTEGER encoding in DER structure"); 797| 9| } 798| 11.1k| } 799| 25.3k| } 800| | 801| 25.4k| out = ASN1::integer_from_contents(obj.data()); 802| | 803| 25.4k| return (*this); 804| 25.4k|} _ZN5Botan4ASN121integer_from_contentsENSt3__14spanIKhLm18446744073709551615EEE: 806| 26.8k|BigInt ASN1::integer_from_contents(std::span contents) { 807| 26.8k| if(contents.empty()) { ------------------ | Branch (807:7): [True: 0, False: 26.8k] ------------------ 808| 0| throw BER_Decoding_Error("INTEGER encoding has no content octets"); 809| 0| } 810| | 811| 26.8k| BigInt out; 812| | 813| 26.8k| const bool negative = (contents[0] & 0x80) == 0x80; 814| | 815| 26.8k| if(negative) { ------------------ | Branch (815:7): [True: 4.59k, False: 22.2k] ------------------ 816| 4.59k| secure_vector vec(contents.begin(), contents.end()); 817| 5.66k| for(size_t i = vec.size(); i > 0; --i) { ------------------ | Branch (817:34): [True: 5.66k, False: 0] ------------------ 818| 5.66k| const bool gt0 = (vec[i - 1] > 0); 819| 5.66k| vec[i - 1] -= 1; 820| 5.66k| if(gt0) { ------------------ | Branch (820:13): [True: 4.59k, False: 1.07k] ------------------ 821| 4.59k| break; 822| 4.59k| } 823| 5.66k| } 824| 41.3k| for(auto& byte : vec) { ------------------ | Branch (824:22): [True: 41.3k, False: 4.59k] ------------------ 825| 41.3k| byte = ~byte; 826| 41.3k| } 827| 4.59k| out._assign_from_bytes(vec); 828| 4.59k| out.set_sign(BigInt::Negative); 829| 22.2k| } else { 830| 22.2k| out._assign_from_bytes(contents); 831| 22.2k| } 832| | 833| 26.8k| return out; 834| 26.8k|} _ZN5Botan11BER_Decoder23decode_into_byte_vectorERNSt3__16vectorIhNS1_9allocatorIhEEEENS_9ASN1_TypeES7_NS_10ASN1_ClassE: 1038| 33.2k| ASN1_Class class_tag) { 1039| 33.2k| if(real_type != ASN1_Type::OctetString && real_type != ASN1_Type::BitString) { ------------------ | Branch (1039:7): [True: 694, False: 32.5k] | Branch (1039:46): [True: 0, False: 694] ------------------ 1040| 0| throw BER_Bad_Tag("Bad tag for {BIT,OCTET} STRING", static_cast(real_type)); 1041| 0| } 1042| | 1043| 33.2k| asn1_decode_binary_string(buffer, get_next_object(), real_type, type_tag, class_tag, m_limits); 1044| 33.2k| return (*this); 1045| 33.2k|} _ZN5Botan11BER_Decoder16decode_bitstringERNS_14ASN1_BitStringENS_9ASN1_TypeENS_10ASN1_ClassE: 1047| 28.0k|BER_Decoder& BER_Decoder::decode_bitstring(ASN1_BitString& out, ASN1_Type type_tag, ASN1_Class class_tag) { 1048| 28.0k| const BER_Object obj = get_next_object(); 1049| | 1050| 28.0k| std::vector bits; 1051| 28.0k| uint8_t unused_bits = 0; 1052| | 1053| 28.0k| if(is_constructed(obj.class_tag())) { ------------------ | Branch (1053:7): [True: 61, False: 28.0k] ------------------ 1054| 61| obj.assert_is_a(type_tag, class_tag | ASN1_Class::Constructed); 1055| 61| if(m_limits.require_der_encoding()) { ------------------ | Branch (1055:10): [True: 14, False: 47] ------------------ 1056| 14| throw BER_Decoding_Error("Detected constructed string encoding in DER structure"); 1057| 14| } 1058| 47| bits.reserve(obj.length()); // upper possible bound on the output size 1059| 47| unused_bits = asn1_concat_constructed_bit_string(bits, obj, m_limits, 0); 1060| 28.0k| } else { 1061| 28.0k| unused_bits = asn1_bitstring_unused_bits(obj, type_tag, class_tag, m_limits.require_der_encoding()); 1062| 28.0k| bits.assign(obj.bits() + 1, obj.bits() + obj.length()); 1063| 28.0k| } 1064| | 1065| 28.0k| if(unused_bits > 0 && !bits.empty()) { ------------------ | Branch (1065:7): [True: 1.90k, False: 26.1k] | Branch (1065:26): [True: 1.90k, False: 0] ------------------ 1066| 1.90k| bits.back() &= static_cast(0xFF << unused_bits); 1067| 1.90k| } 1068| | 1069| 28.0k| out = ASN1_BitString(std::move(bits), unused_bits); 1070| 28.0k| return (*this); 1071| 28.0k|} _ZN5Botan11BER_Decoder22decode_named_bitstringERmmNS_9ASN1_TypeENS_10ASN1_ClassE: 1076| 2.78k| ASN1_Class class_tag) { 1077| 2.78k| if(width > 64) { ------------------ | Branch (1077:7): [True: 0, False: 2.78k] ------------------ 1078| 0| throw Invalid_Argument("BER_Decoder: Named BIT STRING width is too large"); 1079| 0| } 1080| | 1081| 2.78k| ASN1_BitString bits; 1082| 2.78k| decode_bitstring(bits, type_tag, class_tag); 1083| | 1084| 2.78k| if(bits.bit_length() > width) { ------------------ | Branch (1084:7): [True: 5, False: 2.77k] ------------------ 1085| 5| throw BER_Decoding_Error("Named BIT STRING exceeds declared width"); 1086| 5| } 1087| | 1088| 2.77k| if(m_limits.require_der_encoding() && bits.bit_length() > 0 && !bits.bit_at(bits.bit_length() - 1)) { ------------------ | Branch (1088:7): [True: 1.87k, False: 903] | Branch (1088:42): [True: 1.86k, False: 7] | Branch (1088:67): [True: 44, False: 1.82k] ------------------ 1089| 44| throw BER_Decoding_Error("Named BIT STRING is not minimally encoded"); 1090| 44| } 1091| | 1092| 2.73k| uint64_t decoded = 0; 1093| 13.3k| for(size_t bit = 0; bit != bits.bit_length(); ++bit) { ------------------ | Branch (1093:24): [True: 10.5k, False: 2.73k] ------------------ 1094| 10.5k| if(bits.bit_at(bit)) { ------------------ | Branch (1094:10): [True: 5.07k, False: 5.49k] ------------------ 1095| 5.07k| decoded |= uint64_t(1) << (width - 1 - bit); 1096| 5.07k| } 1097| 10.5k| } 1098| | 1099| 2.73k| out = decoded; 1100| 2.73k| return (*this); 1101| 2.77k|} _ZN5Botan4ASN120is_single_der_objectENSt3__14spanIKhLm18446744073709551615EEENS_9ASN1_TypeENS_10ASN1_ClassE: 1105| 12.5k|bool is_single_der_object(std::span bytes, ASN1_Type expected_type, ASN1_Class expected_class) { 1106| 12.5k| if(bytes.empty()) { ------------------ | Branch (1106:7): [True: 0, False: 12.5k] ------------------ 1107| 0| return false; 1108| 0| } 1109| | 1110| 12.5k| try { 1111| 12.5k| DataSource_Span src(bytes); 1112| | 1113| 12.5k| ASN1_Type type_tag = ASN1_Type::NoObject; 1114| 12.5k| ASN1_Class class_tag = ASN1_Class::NoObject; 1115| 12.5k| const size_t tag_bytes = decode_tag(&src, type_tag, class_tag); 1116| | 1117| 12.5k| if(type_tag != expected_type || class_tag != expected_class) { ------------------ | Branch (1117:10): [True: 5.03k, False: 7.47k] | Branch (1117:39): [True: 9, False: 7.46k] ------------------ 1118| 4.97k| return false; 1119| 4.97k| } 1120| | 1121| 7.52k| const auto dl = decode_length(&src, /*allow_indef=*/0, /*der_mode=*/true, is_constructed(expected_class)); 1122| | 1123| 7.52k| const size_t header_bytes = tag_bytes + dl.field_length(); 1124| 7.52k| if(header_bytes > bytes.size()) { ------------------ | Branch (1124:10): [True: 0, False: 7.52k] ------------------ 1125| 0| return false; 1126| 0| } 1127| 7.52k| return dl.content_length() == bytes.size() - header_bytes; 1128| 7.52k| } catch(Decoding_Error&) { 1129| 68| return false; 1130| 68| } 1131| 12.5k|} _ZN5Botan4ASN122is_der_sequence_headerENSt3__14spanIKhLm18446744073709551615EEE: 1133| 7.55k|bool is_der_sequence_header(std::span bytes) { 1134| 7.55k| return is_single_der_object(bytes, ASN1_Type::Sequence, ASN1_Class::Universal | ASN1_Class::Constructed); 1135| 7.55k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_110decode_tagEPNS_10DataSourceERNS_9ASN1_TypeERNS_10ASN1_ClassE: 29| 596k|size_t decode_tag(DataSource* ber, ASN1_Type& type_tag, ASN1_Class& class_tag) { 30| 596k| auto b = ber->read_byte(); 31| | 32| 596k| if(!b) { ------------------ | Branch (32:7): [True: 12.1k, False: 584k] ------------------ 33| 12.1k| type_tag = ASN1_Type::NoObject; 34| 12.1k| class_tag = ASN1_Class::NoObject; 35| 12.1k| return 0; 36| 12.1k| } 37| | 38| 584k| if((*b & 0x1F) != 0x1F) { ------------------ | Branch (38:7): [True: 582k, False: 1.51k] ------------------ 39| 582k| type_tag = ASN1_Type(*b & 0x1F); 40| 582k| class_tag = ASN1_Class(*b & 0xE0); 41| | // The EOC marker is primitive; a constructed universal tag 0 has no 42| | // valid meaning and would otherwise bypass the EOC handling, which 43| | // matches on (Eoc, Universal) exactly 44| 582k| if(type_tag == ASN1_Type::Eoc && class_tag == ASN1_Class::Constructed) { ------------------ | Branch (44:10): [True: 28.7k, False: 553k] | Branch (44:40): [True: 48, False: 28.6k] ------------------ 45| 48| throw BER_Decoding_Error("EOC tag with constructed encoding"); 46| 48| } 47| 582k| return 1; 48| 582k| } 49| | 50| 1.51k| size_t tag_bytes = 1; 51| 1.51k| class_tag = ASN1_Class(*b & 0xE0); 52| | 53| 1.51k| uint32_t tag_buf = 0; 54| 4.46k| while(true) { ------------------ | Branch (54:10): [True: 4.46k, Folded] ------------------ 55| 4.46k| b = ber->read_byte(); 56| 4.46k| if(!b) { ------------------ | Branch (56:10): [True: 114, False: 4.34k] ------------------ 57| 114| throw BER_Decoding_Error("Long-form tag truncated"); 58| 114| } 59| | // Reject if shifting in another 7 bits would overflow the uint32_t tag 60| 4.34k| if((tag_buf >> 25) != 0) { ------------------ | Branch (60:10): [True: 60, False: 4.28k] ------------------ 61| 60| throw BER_Decoding_Error("Long-form tag overflowed 32 bits"); 62| 60| } 63| | // This is required even by BER (see X.690 section 8.1.2.4.2 sentence c). 64| | // Bits 7-1 of the first subsequent octet must not be all zero; this rules 65| | // out both 0x80 (continuation with no data) and 0x00 (a long-form encoding 66| | // of tag value 0, which collides with the EOC marker). 67| 4.28k| if(tag_bytes == 1 && (*b & 0x7F) == 0) { ------------------ | Branch (67:10): [True: 1.50k, False: 2.78k] | Branch (67:28): [True: 28, False: 1.47k] ------------------ 68| 28| throw BER_Decoding_Error("Long form tag with leading zero"); 69| 28| } 70| 4.26k| ++tag_bytes; 71| 4.26k| tag_buf = (tag_buf << 7) | (*b & 0x7F); 72| 4.26k| if((*b & 0x80) == 0) { ------------------ | Branch (72:10): [True: 1.30k, False: 2.95k] ------------------ 73| 1.30k| break; 74| 1.30k| } 75| 4.26k| } 76| | // Per X.690 8.1.2.2, tag values 0-30 shall be encoded in the short form. 77| | // Long-form encoding is reserved for tag values >= 31 (X.690 8.1.2.3). 78| | // This is unconditional and applies to BER as well as DER. 79| 1.30k| if(tag_buf <= 30) { ------------------ | Branch (79:7): [True: 281, False: 1.02k] ------------------ 80| 281| throw BER_Decoding_Error("Long-form tag encoding used for small tag value"); 81| 281| } 82| | 83| 1.02k| if(tag_buf == static_cast(ASN1_Type::NoObject)) { ------------------ | Branch (83:7): [True: 4, False: 1.02k] ------------------ 84| 4| throw BER_Decoding_Error("Tag value collides with internal sentinel"); 85| 4| } 86| | 87| | // NOLINTNEXTLINE(clang-analyzer-optin.core.EnumCastOutOfRange) 88| 1.02k| type_tag = ASN1_Type(tag_buf); 89| 1.02k| return tag_bytes; 90| 1.02k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_113decode_lengthEPNS_10DataSourceEmbb: 135| 578k|BerDecodedLength decode_length(DataSource* ber, size_t allow_indef, bool der_mode, bool constructed) { 136| 578k| uint8_t b = 0; 137| 578k| if(ber->read_byte(b) == 0) { ------------------ | Branch (137:7): [True: 194, False: 578k] ------------------ 138| 194| throw BER_Decoding_Error("Length field not found"); 139| 194| } 140| 578k| if((b & 0x80) == 0) { ------------------ | Branch (140:7): [True: 524k, False: 54.1k] ------------------ 141| 524k| return BerDecodedLength(b, 1); 142| 524k| } 143| | 144| 54.1k| const size_t num_length_bytes = (b & 0x7F); 145| 54.1k| if(num_length_bytes > 4) { ------------------ | Branch (145:7): [True: 759, False: 53.4k] ------------------ 146| 759| throw BER_Decoding_Error("Length field is too large"); 147| 759| } 148| | 149| 53.4k| const size_t field_size = 1 + num_length_bytes; 150| | 151| 53.4k| if(num_length_bytes == 0) { ------------------ | Branch (151:7): [True: 11, False: 53.4k] ------------------ 152| 11| if(der_mode) { ------------------ | Branch (152:10): [True: 11, False: 0] ------------------ 153| 11| throw BER_Decoding_Error("Detected indefinite-length encoding in DER structure"); 154| 11| } else if(!constructed) { ------------------ | Branch (154:17): [True: 0, False: 0] ------------------ 155| | // Indefinite length is only valid for constructed types (X.690 8.1.3.2) 156| 0| throw BER_Decoding_Error("Indefinite-length encoding used with non-constructed type"); 157| 0| } else if(allow_indef == 0) { ------------------ | Branch (157:17): [True: 0, False: 0] ------------------ 158| 0| throw BER_Decoding_Error("Nested EOC markers too deep, rejecting to avoid stack exhaustion"); 159| 0| } else { 160| | // find_eoc returns bytes up to and including the EOC marker. 161| | // Return the content length; the caller consumes the EOC separately. 162| 0| const size_t eoc_len = find_eoc(ber, /*base_offset=*/0, allow_indef - 1); 163| 0| if(eoc_len < 2) { ------------------ | Branch (163:13): [True: 0, False: 0] ------------------ 164| 0| throw BER_Decoding_Error("Invalid EOC encoding"); 165| 0| } 166| 0| return BerDecodedLength::indefinite(eoc_len - 2, field_size); 167| 0| } 168| 11| } 169| | 170| 53.4k| size_t length = 0; 171| | 172| 137k| for(size_t i = 0; i != num_length_bytes; ++i) { ------------------ | Branch (172:22): [True: 83.6k, False: 53.4k] ------------------ 173| 83.6k| if(ber->read_byte(b) == 0) { ------------------ | Branch (173:10): [True: 10, False: 83.6k] ------------------ 174| 10| throw BER_Decoding_Error("Corrupted length field"); 175| 10| } 176| | // Can't overflow since we already checked that num_length_bytes <= 4 177| 83.6k| length = (length << 8) | b; 178| 83.6k| } 179| | 180| | // DER requires shortest possible length encoding 181| 53.4k| if(der_mode) { ------------------ | Branch (181:7): [True: 53.4k, False: 0] ------------------ 182| 53.4k| if(length < 128) { ------------------ | Branch (182:10): [True: 19, False: 53.3k] ------------------ 183| 19| throw BER_Decoding_Error("Detected non-canonical length encoding in DER structure"); 184| 19| } 185| 53.3k| if(num_length_bytes > 1 && length < (size_t(1) << ((num_length_bytes - 1) * 8))) { ------------------ | Branch (185:10): [True: 29.9k, False: 23.3k] | Branch (185:34): [True: 1, False: 29.9k] ------------------ 186| 1| throw BER_Decoding_Error("Detected non-canonical length encoding in DER structure"); 187| 1| } 188| 53.3k| } 189| | 190| 53.3k| return BerDecodedLength(length, field_size); 191| 53.4k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_116BerDecodedLengthC2Emm: 108| 577k| BerDecodedLength(content_length, field_length, false) {} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_116BerDecodedLengthC2Emmb: 125| 577k| m_content_length(content_length), m_field_length(field_length), m_indefinite(indefinite) {} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_18peek_tagEPKNS_10DataSourceEmRNS_9ASN1_TypeERNS_10ASN1_ClassE: 197| 40.8k|size_t peek_tag(const DataSource* src, size_t offset, ASN1_Type& type_tag, ASN1_Class& class_tag) { 198| 40.8k| uint8_t b = 0; 199| 40.8k| if(src->peek(&b, 1, offset) == 0) { ------------------ | Branch (199:7): [True: 0, False: 40.8k] ------------------ 200| 0| type_tag = ASN1_Type::NoObject; 201| 0| class_tag = ASN1_Class::NoObject; 202| 0| return 0; 203| 0| } 204| | 205| 40.8k| if((b & 0x1F) != 0x1F) { ------------------ | Branch (205:7): [True: 40.7k, False: 125] ------------------ 206| 40.7k| type_tag = ASN1_Type(b & 0x1F); 207| 40.7k| class_tag = ASN1_Class(b & 0xE0); 208| | // The EOC marker is primitive; a constructed universal tag 0 has no 209| | // valid meaning and would otherwise bypass the EOC handling, which 210| | // matches on (Eoc, Universal) exactly 211| 40.7k| if(type_tag == ASN1_Type::Eoc && class_tag == ASN1_Class::Constructed) { ------------------ | Branch (211:10): [True: 255, False: 40.4k] | Branch (211:40): [True: 1, False: 254] ------------------ 212| 1| throw BER_Decoding_Error("EOC tag with constructed encoding"); 213| 1| } 214| 40.7k| return 1; 215| 40.7k| } 216| | 217| 125| class_tag = ASN1_Class(b & 0xE0); 218| 125| size_t tag_bytes = 1; 219| 125| uint32_t tag_buf = 0; 220| | 221| 438| while(true) { ------------------ | Branch (221:10): [True: 438, Folded] ------------------ 222| 438| if(src->peek(&b, 1, offset + tag_bytes) == 0) { ------------------ | Branch (222:10): [True: 1, False: 437] ------------------ 223| 1| throw BER_Decoding_Error("Long-form tag truncated"); 224| 1| } 225| | // Reject if shifting in another 7 bits would overflow the uint32_t tag 226| 437| if((tag_buf >> 25) != 0) { ------------------ | Branch (226:10): [True: 13, False: 424] ------------------ 227| 13| throw BER_Decoding_Error("Long-form tag overflowed 32 bits"); 228| 13| } 229| | // Required even by BER (X.690 section 8.1.2.4.2 sentence c). 230| | // Bits 7-1 of the first subsequent octet must not be all zero; this rules 231| | // out both 0x80 (continuation with no data) and 0x00 (a long-form encoding 232| | // of tag value 0, which collides with the EOC marker). 233| 424| if(tag_bytes == 1 && (b & 0x7F) == 0) { ------------------ | Branch (233:10): [True: 125, False: 299] | Branch (233:28): [True: 2, False: 123] ------------------ 234| 2| throw BER_Decoding_Error("Long form tag with leading zero"); 235| 2| } 236| 422| ++tag_bytes; 237| 422| tag_buf = (tag_buf << 7) | (b & 0x7F); 238| 422| if((b & 0x80) == 0) { ------------------ | Branch (238:10): [True: 109, False: 313] ------------------ 239| 109| break; 240| 109| } 241| 422| } 242| | 243| | // Per X.690 8.1.2.2, tag values 0-30 shall be encoded in the short form. 244| | // Long-form encoding is reserved for tag values >= 31 (X.690 8.1.2.3). 245| | // This is unconditional and applies to BER as well as DER. 246| 109| if(tag_buf <= 30) { ------------------ | Branch (246:7): [True: 6, False: 103] ------------------ 247| 6| throw BER_Decoding_Error("Long-form tag encoding used for small tag value"); 248| 6| } 249| | 250| 103| if(tag_buf == static_cast(ASN1_Type::NoObject)) { ------------------ | Branch (250:7): [True: 1, False: 102] ------------------ 251| 1| throw BER_Decoding_Error("Tag value collides with internal sentinel"); 252| 1| } 253| | 254| | // NOLINTNEXTLINE(clang-analyzer-optin.core.EnumCastOutOfRange) 255| 102| type_tag = ASN1_Type(tag_buf); 256| 102| return tag_bytes; 257| 103|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_111peek_lengthEPNS_10DataSourceEmRmmbb: 265| 40.8k| DataSource* src, size_t offset, size_t& field_size, size_t allow_indef, bool constructed, bool der_mode) { 266| 40.8k| uint8_t b = 0; 267| 40.8k| if(src->peek(&b, 1, offset) == 0) { ------------------ | Branch (267:7): [True: 6, False: 40.8k] ------------------ 268| 6| throw BER_Decoding_Error("Length field not found"); 269| 6| } 270| | 271| 40.8k| field_size = 1; 272| 40.8k| if((b & 0x80) == 0) { ------------------ | Branch (272:7): [True: 40.7k, False: 106] ------------------ 273| 40.7k| return b; 274| 40.7k| } 275| | 276| 106| const size_t num_length_bytes = (b & 0x7F); 277| 106| field_size += num_length_bytes; 278| 106| if(field_size > 5) { ------------------ | Branch (278:7): [True: 22, False: 84] ------------------ 279| 22| throw BER_Decoding_Error("Length field is too large"); 280| 22| } 281| | 282| 84| if(num_length_bytes == 0) { ------------------ | Branch (282:7): [True: 2, False: 82] ------------------ 283| | // Indefinite length is not allowed in DER 284| 2| if(der_mode) { ------------------ | Branch (284:10): [True: 2, False: 0] ------------------ 285| 2| throw BER_Decoding_Error("Detected indefinite-length encoding in DER structure"); 286| 2| } 287| | // Indefinite length is only valid for constructed types (X.690 8.1.3.2) 288| 0| if(!constructed) { ------------------ | Branch (288:10): [True: 0, False: 0] ------------------ 289| 0| throw BER_Decoding_Error("Indefinite-length encoding used with non-constructed type"); 290| 0| } 291| 0| if(allow_indef == 0) { ------------------ | Branch (291:10): [True: 0, False: 0] ------------------ 292| 0| throw BER_Decoding_Error("Nested EOC markers too deep, rejecting to avoid stack exhaustion"); 293| 0| } 294| 0| return find_eoc(src, offset + 1, allow_indef - 1); 295| 0| } 296| | 297| 82| size_t length = 0; 298| 328| for(size_t i = 0; i < num_length_bytes; ++i) { ------------------ | Branch (298:22): [True: 247, False: 81] ------------------ 299| 247| if(src->peek(&b, 1, offset + 1 + i) == 0) { ------------------ | Branch (299:10): [True: 1, False: 246] ------------------ 300| 1| throw BER_Decoding_Error("Corrupted length field"); 301| 1| } 302| 246| if(get_byte<0>(length) != 0) { ------------------ | Branch (302:10): [True: 0, False: 246] ------------------ 303| 0| throw BER_Decoding_Error("Field length overflow"); 304| 0| } 305| 246| length = (length << 8) | b; 306| 246| } 307| 81| return length; 308| 82|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_114is_constructedENS_10ASN1_ClassE: 22| 707k|bool is_constructed(ASN1_Class class_tag) { 23| 707k| return (static_cast(class_tag) & static_cast(ASN1_Class::Constructed)) != 0; 24| 707k|} ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_116BerDecodedLength14content_lengthEv: 114| 2.28M| size_t content_length() const { return m_content_length; } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_116BerDecodedLength17indefinite_lengthEv: 121| 568k| bool indefinite_length() const { return m_indefinite; } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_116BerDecodedLength12total_lengthEv: 117| 569k| size_t total_length() const { return m_indefinite ? m_content_length + 2 : m_content_length; } ------------------ | Branch (117:44): [True: 0, False: 569k] ------------------ ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120verify_set_is_sortedENSt3__14spanIKhLm18446744073709551615EEE: 426| 39.7k|void verify_set_is_sorted(std::span content) { 427| 39.7k| DataSource_Span src(content); 428| 39.7k| size_t offset = 0; 429| 39.7k| std::optional> prev; 430| | 431| 80.5k| while(offset < content.size()) { ------------------ | Branch (431:10): [True: 40.8k, False: 39.6k] ------------------ 432| 40.8k| ASN1_Type type_tag = ASN1_Type::NoObject; 433| 40.8k| ASN1_Class class_tag = ASN1_Class::NoObject; 434| 40.8k| const size_t tag_size = peek_tag(&src, offset, type_tag, class_tag); 435| | 436| 40.8k| size_t length_size = 0; 437| 40.8k| const size_t item_size = 438| 40.8k| peek_length(&src, offset + tag_size, length_size, /*allow_indef=*/0, is_constructed(class_tag), true); 439| | 440| 40.8k| const auto end = checked_add(offset, tag_size, length_size, item_size); 441| 40.8k| if(!end || *end > content.size()) { ------------------ | Branch (441:10): [True: 55, False: 40.7k] | Branch (441:18): [True: 69, False: 40.7k] ------------------ 442| 69| throw BER_Decoding_Error("SET element exceeds available data"); 443| 69| } 444| | 445| 40.7k| const auto elem = content.subspan(offset, *end - offset); 446| 40.7k| if(prev && std::lexicographical_compare(elem.begin(), elem.end(), prev->begin(), prev->end())) { ------------------ | Branch (446:10): [True: 939, False: 39.8k] | Branch (446:18): [True: 51, False: 888] ------------------ 447| 51| throw BER_Decoding_Error("Detected unsorted SET in DER structure"); 448| 51| } 449| 40.7k| prev = elem; 450| 40.7k| offset = *end; 451| 40.7k| } 452| 39.7k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_126asn1_bitstring_unused_bitsERKNS_10BER_ObjectENS_9ASN1_TypeENS_10ASN1_ClassEb: 990| 27.8k|uint8_t asn1_bitstring_unused_bits(const BER_Object& obj, ASN1_Type type_tag, ASN1_Class class_tag, bool require_der) { 991| 27.8k| obj.assert_is_a(type_tag, class_tag); 992| 27.8k| BOTAN_ASSERT_NOMSG(!is_constructed(obj)); ------------------ | | 84| 27.8k| do { \ | | 85| 27.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 27.8k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 27.8k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 27.8k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 27.8k] | | ------------------ ------------------ 993| | 994| 27.8k| if(obj.length() == 0) { ------------------ | Branch (994:7): [True: 62, False: 27.8k] ------------------ 995| 62| throw BER_Decoding_Error("Invalid BIT STRING"); 996| 62| } 997| | 998| 27.8k| const uint8_t unused_bits = obj.bits()[0]; 999| | 1000| 27.8k| if(unused_bits >= 8) { ------------------ | Branch (1000:7): [True: 69, False: 27.7k] ------------------ 1001| 69| throw BER_Decoding_Error("Invalid number of unused bits in BIT STRING"); 1002| 69| } 1003| | 1004| 27.7k| if(obj.length() == 1 && unused_bits != 0) { ------------------ | Branch (1004:7): [True: 2.57k, False: 25.1k] | Branch (1004:28): [True: 13, False: 2.56k] ------------------ 1005| 13| throw BER_Decoding_Error("Invalid BIT STRING"); 1006| 13| } 1007| | 1008| 27.7k| if(require_der && unused_bits > 0) { ------------------ | Branch (1008:7): [True: 27.6k, False: 110] | Branch (1008:22): [True: 2.43k, False: 25.1k] ------------------ 1009| 2.43k| const uint8_t last_byte = obj.bits()[obj.length() - 1]; 1010| 2.43k| if((last_byte & ((1 << unused_bits) - 1)) != 0) { ------------------ | Branch (1010:10): [True: 531, False: 1.90k] ------------------ 1011| 531| throw BER_Decoding_Error("Detected non-zero padding bits in BIT STRING in DER structure"); 1012| 531| } 1013| 2.43k| } 1014| | 1015| 27.1k| return unused_bits; 1016| 27.7k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_114is_constructedERKNS_10BER_ObjectE: 838| 60.6k|bool is_constructed(const BER_Object& obj) { 839| 60.6k| return is_constructed(obj.class_tag()); 840| 60.6k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_115DataSource_SpanC2ENSt3__14spanIKhLm18446744073709551615EEE: 414| 52.2k| explicit DataSource_Span(std::span buf) : m_buf(buf) {} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_115DataSource_Span4readEPhm: 392| 22.2k| size_t read(uint8_t out[], size_t length) override { 393| 22.2k| const size_t got = std::min(m_buf.size() - m_offset, length); 394| 22.2k| copy_mem(out, m_buf.data() + m_offset, got); 395| 22.2k| m_offset += got; 396| 22.2k| return got; 397| 22.2k| } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_115DataSource_Span4peekEPhmm: 399| 82.3k| size_t peek(uint8_t out[], size_t length, size_t peek_offset) const override { 400| 82.3k| if(peek_offset >= m_buf.size() - m_offset) { ------------------ | Branch (400:13): [True: 8, False: 82.3k] ------------------ 401| 8| return 0; 402| 8| } 403| 82.3k| const size_t got = std::min(m_buf.size() - m_offset - peek_offset, length); 404| 82.3k| copy_mem(out, m_buf.data() + m_offset + peek_offset, got); 405| 82.3k| return got; 406| 82.3k| } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_116BerDecodedLength12field_lengthEv: 119| 7.45k| size_t field_length() const { return m_field_length; } ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObjectC2EONS_10BER_ObjectE: 379| 229k| explicit DataSource_BERObject(BER_Object&& obj) : m_obj(std::move(obj)) {} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObject4readEPhm: 349| 1.31M| size_t read(uint8_t out[], size_t length) override { 350| 1.31M| BOTAN_ASSERT_NOMSG(m_offset <= m_obj.length()); ------------------ | | 84| 1.31M| do { \ | | 85| 1.31M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 1.31M| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 1.31M] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 1.31M| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 1.31M] | | ------------------ ------------------ 351| 1.31M| const size_t got = std::min(m_obj.length() - m_offset, length); 352| 1.31M| copy_mem(out, m_obj.bits() + m_offset, got); 353| 1.31M| m_offset += got; 354| 1.31M| return got; 355| 1.31M| } ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObject15check_availableEm: 370| 349k| bool check_available(size_t n) override { 371| 349k| BOTAN_ASSERT_NOMSG(m_offset <= m_obj.length()); ------------------ | | 84| 349k| do { \ | | 85| 349k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 349k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 349k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 349k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 349k] | | ------------------ ------------------ 372| 349k| return (n <= (m_obj.length() - m_offset)); 373| 349k| } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_120DataSource_BERObject11end_of_dataEv: 375| 323k| bool end_of_data() const override { return get_bytes_read() == m_obj.length(); } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_120DataSource_BERObject14get_bytes_readEv: 377| 323k| size_t get_bytes_read() const override { return m_offset; } ber_dec.cpp:_ZN5Botan12_GLOBAL__N_125asn1_decode_binary_stringINSt3__19allocatorIhEEEEvRNS2_6vectorIhT_EERKNS_10BER_ObjectENS_9ASN1_TypeESC_NS_10ASN1_ClassERKNS_11BER_Decoder6LimitsE: 932| 32.9k| const BER_Decoder::Limits& limits) { 933| | // DER requires BIT STRING and OCTET STRING to use primitive encoding; 934| | // in BER the constructed (fragmented) form is decoded by concatenation 935| 32.9k| if(is_constructed(obj)) { ------------------ | Branch (935:7): [True: 62, False: 32.8k] ------------------ 936| 62| obj.assert_is_a(type_tag, class_tag | ASN1_Class::Constructed); 937| | 938| 62| if(limits.require_der_encoding()) { ------------------ | Branch (938:10): [True: 6, False: 56] ------------------ 939| 6| throw BER_Decoding_Error("Detected constructed string encoding in DER structure"); 940| 6| } 941| | 942| | // Concatenate into a temporary so a failed decode leaves buffer unmodified 943| 56| std::vector concat; 944| 56| concat.reserve(obj.length()); // upper possible bound on the output size 945| 56| if(real_type == ASN1_Type::OctetString) { ------------------ | Branch (945:10): [True: 0, False: 56] ------------------ 946| 0| asn1_concat_constructed_octet_string(concat, obj, limits, 0); 947| 56| } else { 948| 56| asn1_concat_constructed_bit_string(concat, obj, limits, 0); 949| 56| } 950| 56| buffer = std::move(concat); 951| 56| return; 952| 62| } 953| | 954| 32.8k| obj.assert_is_a(type_tag, class_tag); 955| | 956| 32.8k| if(real_type == ASN1_Type::OctetString) { ------------------ | Branch (956:7): [True: 32.0k, False: 816] ------------------ 957| 32.0k| buffer.assign(obj.bits(), obj.bits() + obj.length()); 958| 32.0k| } else { 959| 816| if(obj.length() == 0) { ------------------ | Branch (959:10): [True: 1, False: 815] ------------------ 960| 1| throw BER_Decoding_Error("Invalid BIT STRING"); 961| 1| } 962| | 963| 815| const uint8_t unused_bits = obj.bits()[0]; 964| | 965| 815| if(unused_bits >= 8) { ------------------ | Branch (965:10): [True: 5, False: 810] ------------------ 966| 5| throw BER_Decoding_Error("Bad number of unused bits in BIT STRING"); 967| 5| } 968| | 969| | // Empty BIT STRING with unused bits > 0 ... 970| 810| if(unused_bits > 0 && obj.length() < 2) { ------------------ | Branch (970:10): [True: 20, False: 790] | Branch (970:29): [True: 1, False: 19] ------------------ 971| 1| throw BER_Decoding_Error("Invalid BIT STRING"); 972| 1| } 973| | 974| | // DER requires unused bits in BIT STRING to be zero (X.690 section 11.2.2) 975| 809| if(limits.require_der_encoding() && unused_bits > 0) { ------------------ | Branch (975:10): [True: 687, False: 122] | Branch (975:43): [True: 19, False: 668] ------------------ 976| 19| const uint8_t last_byte = obj.bits()[obj.length() - 1]; 977| 19| if((last_byte & ((1 << unused_bits) - 1)) != 0) { ------------------ | Branch (977:13): [True: 4, False: 15] ------------------ 978| 4| throw BER_Decoding_Error("Detected non-zero padding bits in BIT STRING in DER structure"); 979| 4| } 980| 19| } 981| | 982| 805| buffer.resize(obj.length() - 1); 983| | 984| 805| if(obj.length() > 1) { ------------------ | Branch (984:10): [True: 676, False: 129] ------------------ 985| 676| copy_mem(buffer.data(), obj.bits() + 1, obj.length() - 1); 986| 676| } 987| 805| } 988| 32.8k|} _ZN5Botan4ASN119der_sequence_headerEm: 71| 31.8k|std::vector der_sequence_header(size_t contents_len) { 72| 31.8k| std::vector header; 73| 31.8k| header.reserve(2 + sizeof(contents_len)); 74| 31.8k| encode_tag(header, ASN1_Type::Sequence, ASN1_Class::Constructed); 75| 31.8k| encode_length(header, contents_len); 76| 31.8k| return header; 77| 31.8k|} _ZN5Botan11DER_EncoderC2ERNSt3__16vectorIhNS1_9allocatorIhEEEE: 89| 58.0k|DER_Encoder::DER_Encoder(std::vector& vec) { 90| 58.0k| m_append_output = [&vec](const uint8_t b[], size_t l) { 91| 58.0k| if(l > 0) { 92| 58.0k| vec.insert(vec.end(), b, b + l); 93| 58.0k| } 94| 58.0k| }; 95| 58.0k|} _ZN5Botan11DER_Encoder12DER_Sequence13push_contentsERS0_: 100| 29.5k|void DER_Encoder::DER_Sequence::push_contents(DER_Encoder& der) { 101| 29.5k| const auto real_class_tag = m_class_tag | ASN1_Class::Constructed; 102| | 103| 29.5k| if(m_sort_contents) { ------------------ | Branch (103:7): [True: 0, False: 29.5k] ------------------ 104| 0| std::sort(m_set_contents.begin(), m_set_contents.end()); 105| 0| for(const auto& set_elem : m_set_contents) { ------------------ | Branch (105:32): [True: 0, False: 0] ------------------ 106| 0| m_contents += set_elem; 107| 0| } 108| 0| m_set_contents.clear(); 109| 0| } 110| | 111| 29.5k| der.add_object(m_type_tag, real_class_tag, m_contents.data(), m_contents.size()); 112| 29.5k| m_contents.clear(); 113| 29.5k|} _ZN5Botan11DER_Encoder12DER_Sequence9add_bytesEPKhm: 118| 19.0k|void DER_Encoder::DER_Sequence::add_bytes(const uint8_t data[], size_t length) { 119| 19.0k| if(m_sort_contents) { ------------------ | Branch (119:7): [True: 0, False: 19.0k] ------------------ 120| 0| if(length > 0) { ------------------ | Branch (120:10): [True: 0, False: 0] ------------------ 121| 0| m_set_contents.emplace_back(data, data + length); 122| 0| } else { 123| 0| m_set_contents.emplace_back(); 124| 0| } 125| 19.0k| } else { 126| 19.0k| m_contents += std::make_pair(data, length); 127| 19.0k| } 128| 19.0k|} _ZN5Botan11DER_Encoder12DER_Sequence9add_bytesEPKhmS3_m: 130| 39.1k|void DER_Encoder::DER_Sequence::add_bytes(const uint8_t hdr[], size_t hdr_len, const uint8_t val[], size_t val_len) { 131| 39.1k| if(m_sort_contents) { ------------------ | Branch (131:7): [True: 0, False: 39.1k] ------------------ 132| 0| secure_vector m; 133| 0| m.reserve(hdr_len + val_len); 134| 0| m += std::make_pair(hdr, hdr_len); 135| 0| m += std::make_pair(val, val_len); 136| 0| m_set_contents.push_back(std::move(m)); 137| 39.1k| } else { 138| 39.1k| m_contents += std::make_pair(hdr, hdr_len); 139| 39.1k| m_contents += std::make_pair(val, val_len); 140| 39.1k| } 141| 39.1k|} _ZN5Botan11DER_Encoder12DER_SequenceC2ENS_9ASN1_TypeENS_10ASN1_ClassEb: 154| 29.5k| m_type_tag(type_tag), 155| 29.5k| m_class_tag(class_tag), 156| 29.5k| m_sort_contents(sort_contents || (type_tag == ASN1_Type::Set && class_tag == ASN1_Class::Universal)) {} ------------------ | Branch (156:23): [True: 0, False: 29.5k] | Branch (156:41): [True: 0, False: 29.5k] | Branch (156:71): [True: 0, False: 0] ------------------ _ZN5Botan11DER_Encoder10start_consENS_9ASN1_TypeENS_10ASN1_ClassE: 192| 29.5k|DER_Encoder& DER_Encoder::start_cons(ASN1_Type type_tag, ASN1_Class class_tag) { 193| 29.5k| return start_cons(type_tag, class_tag, false); 194| 29.5k|} _ZN5Botan11DER_Encoder10start_consENS_9ASN1_TypeENS_10ASN1_ClassEb: 200| 29.5k|DER_Encoder& DER_Encoder::start_cons(ASN1_Type type_tag, ASN1_Class class_tag, bool sort_contents) { 201| 29.5k| m_subsequences.push_back(DER_Sequence(type_tag, class_tag, sort_contents)); 202| 29.5k| return (*this); 203| 29.5k|} _ZN5Botan11DER_Encoder8end_consEv: 208| 29.5k|DER_Encoder& DER_Encoder::end_cons() { 209| 29.5k| if(m_subsequences.empty()) { ------------------ | Branch (209:7): [True: 0, False: 29.5k] ------------------ 210| 0| throw Invalid_State("DER_Encoder::end_cons: No such sequence"); 211| 0| } 212| | 213| 29.5k| DER_Sequence last_seq = std::move(m_subsequences[m_subsequences.size() - 1]); 214| 29.5k| m_subsequences.pop_back(); 215| 29.5k| last_seq.push_contents(*this); 216| | 217| 29.5k| return (*this); 218| 29.5k|} _ZN5Botan11DER_Encoder9raw_bytesEPKhm: 237| 19.0k|DER_Encoder& DER_Encoder::raw_bytes(const uint8_t bytes[], size_t length) { 238| 19.0k| if(!m_subsequences.empty()) { ------------------ | Branch (238:7): [True: 19.0k, False: 0] ------------------ 239| 19.0k| m_subsequences[m_subsequences.size() - 1].add_bytes(bytes, length); 240| 19.0k| } else if(m_append_output) { ------------------ | Branch (240:14): [True: 0, False: 0] ------------------ 241| 0| m_append_output(bytes, length); 242| 0| } else { 243| 0| m_default_outbuf += std::make_pair(bytes, length); 244| 0| } 245| | 246| 19.0k| return (*this); 247| 19.0k|} _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassEPKhm: 285| 97.1k|DER_Encoder& DER_Encoder::add_object(ASN1_Type type_tag, ASN1_Class class_tag, const uint8_t rep[], size_t length) { 286| 97.1k| std::vector hdr; 287| 97.1k| encode_tag(hdr, type_tag, class_tag); 288| 97.1k| encode_length(hdr, length); 289| | 290| 97.1k| if(!m_subsequences.empty()) { ------------------ | Branch (290:7): [True: 39.1k, False: 58.0k] ------------------ 291| 39.1k| m_subsequences[m_subsequences.size() - 1].add_bytes(hdr.data(), hdr.size(), rep, length); 292| 58.0k| } else if(m_append_output) { ------------------ | Branch (292:14): [True: 58.0k, False: 1] ------------------ 293| 58.0k| m_append_output(hdr.data(), hdr.size()); 294| 58.0k| m_append_output(rep, length); 295| 58.0k| } else { 296| 1| m_default_outbuf += hdr; 297| 1| m_default_outbuf += std::make_pair(rep, length); 298| 1| } 299| | 300| 97.1k| return (*this); 301| 97.1k|} _ZN5Botan4ASN116integer_contentsERKNS_6BigIntE: 356| 11.8k|std::vector ASN1::integer_contents(const BigInt& n) { 357| 11.8k| if(n == 0) { ------------------ | Branch (357:7): [True: 81, False: 11.7k] ------------------ 358| 81| return {0x00}; 359| 81| } 360| | 361| | // Serialize magnitude with one extra leading byte 362| 11.7k| auto contents = n.serialize(n.bytes() + 1); 363| | 364| 11.7k| if(n.signum() < 0) { ------------------ | Branch (364:7): [True: 2.63k, False: 9.08k] ------------------ 365| | // Two's complement: bitwise NOT then increment 366| 31.3k| for(auto& byte : contents) { ------------------ | Branch (366:22): [True: 31.3k, False: 2.63k] ------------------ 367| 31.3k| byte = ~byte; 368| 31.3k| } 369| 3.50k| for(size_t i = contents.size(); i > 0; --i) { ------------------ | Branch (369:39): [True: 3.50k, False: 0] ------------------ 370| 3.50k| if(++contents[i - 1] != 0) { ------------------ | Branch (370:13): [True: 2.63k, False: 871] ------------------ 371| 2.63k| break; 372| 2.63k| } 373| 3.50k| } 374| 2.63k| } 375| | 376| | /* 377| | * DER requires the leading byte be emitted only if it required 378| | */ 379| 11.7k| BOTAN_ASSERT_NOMSG(contents.size() >= 2); ------------------ | | 84| 11.7k| do { \ | | 85| 11.7k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 11.7k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 11.7k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 11.7k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 11.7k] | | ------------------ ------------------ 380| 11.7k| const bool leading_byte_redundant = 381| 11.7k| (contents[0] == 0x00 && (contents[1] & 0x80) == 0) || (contents[0] == 0xFF && (contents[1] & 0x80) != 0); ------------------ | Branch (381:8): [True: 9.08k, False: 2.63k] | Branch (381:31): [True: 6.93k, False: 2.14k] | Branch (381:62): [True: 2.63k, False: 2.14k] | Branch (381:85): [True: 2.37k, False: 257] ------------------ 382| | 383| 11.7k| if(leading_byte_redundant) { ------------------ | Branch (383:7): [True: 9.31k, False: 2.40k] ------------------ 384| 9.31k| contents.erase(contents.begin()); 385| 9.31k| } 386| 11.7k| return contents; 387| 11.8k|} _ZN5Botan11DER_Encoder16encode_bitstringENSt3__14spanIKhLm18446744073709551615EEEmNS_9ASN1_TypeENS_10ASN1_ClassE: 414| 9.53k| ASN1_Class class_tag) { 415| 9.53k| if(unused_bits >= 8) { ------------------ | Branch (415:7): [True: 0, False: 9.53k] ------------------ 416| 0| throw Invalid_Argument("DER_Encoder: Invalid unused bit count for BIT STRING"); 417| 0| } 418| | 419| 9.53k| if(bits.empty() && unused_bits != 0) { ------------------ | Branch (419:7): [True: 1.56k, False: 7.97k] | Branch (419:23): [True: 0, False: 1.56k] ------------------ 420| 0| throw Invalid_Argument("DER_Encoder: Empty BIT STRING cannot have unused bits"); 421| 0| } 422| | 423| 9.53k| if(unused_bits > 0 && (bits.back() & ((1U << unused_bits) - 1)) != 0) { ------------------ | Branch (423:7): [True: 0, False: 9.53k] | Branch (423:26): [True: 0, False: 0] ------------------ 424| 0| throw Invalid_Argument("DER_Encoder: BIT STRING unused bits must be zero"); 425| 0| } 426| | 427| 9.53k| secure_vector encoded; 428| 9.53k| encoded.reserve(1 + bits.size()); 429| 9.53k| encoded.push_back(static_cast(unused_bits)); 430| 9.53k| encoded.insert(encoded.end(), bits.begin(), bits.end()); 431| 9.53k| return add_object(type_tag, class_tag, encoded); 432| 9.53k|} _ZN5Botan11DER_Encoder6encodeERKNS_11ASN1_ObjectE: 467| 19.3k|DER_Encoder& DER_Encoder::encode(const ASN1_Object& obj) { 468| 19.3k| obj.encode_into(*this); 469| 19.3k| return (*this); 470| 19.3k|} der_enc.cpp:_ZN5Botan12_GLOBAL__N_110encode_tagERNSt3__16vectorIhNS1_9allocatorIhEEEENS_9ASN1_TypeENS_10ASN1_ClassE: 26| 129k|void encode_tag(std::vector& encoded_tag, ASN1_Type type_tag_e, ASN1_Class class_tag_e) { 27| 129k| const uint32_t type_tag = static_cast(type_tag_e); 28| 129k| const uint32_t class_tag = static_cast(class_tag_e); 29| | 30| 129k| if((class_tag | 0xE0) != 0xE0) { ------------------ | Branch (30:7): [True: 1, False: 128k] ------------------ 31| 1| throw Encoding_Error(fmt("DER_Encoder: Invalid class tag {}", std::to_string(class_tag))); 32| 1| } 33| | 34| 128k| if(type_tag <= 30) { ------------------ | Branch (34:7): [True: 128k, False: 88] ------------------ 35| 128k| encoded_tag.push_back(static_cast(type_tag | class_tag)); 36| 128k| } else { 37| 88| size_t blocks = high_bit(static_cast(type_tag)) + 6; 38| 88| blocks = (blocks - (blocks % 7)) / 7; 39| | 40| 88| BOTAN_ASSERT_NOMSG(blocks > 0); ------------------ | | 84| 88| do { \ | | 85| 88| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 88| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 88] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 88| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 88] | | ------------------ ------------------ 41| | 42| 88| encoded_tag.push_back(static_cast(class_tag | 0x1F)); 43| 306| for(size_t i = 0; i != blocks - 1; ++i) { ------------------ | Branch (43:25): [True: 218, False: 88] ------------------ 44| 218| encoded_tag.push_back(0x80 | ((type_tag >> 7 * (blocks - i - 1)) & 0x7F)); 45| 218| } 46| 88| encoded_tag.push_back(type_tag & 0x7F); 47| 88| } 48| 128k|} der_enc.cpp:_ZN5Botan12_GLOBAL__N_113encode_lengthERNSt3__16vectorIhNS1_9allocatorIhEEEEm: 53| 128k|void encode_length(std::vector& encoded_length, size_t length) { 54| 128k| if(length <= 127) { ------------------ | Branch (54:7): [True: 98.6k, False: 30.3k] ------------------ 55| 98.6k| encoded_length.push_back(static_cast(length)); 56| 98.6k| } else { 57| 30.3k| const size_t bytes_needed = significant_bytes(length); 58| | 59| 30.3k| encoded_length.push_back(static_cast(0x80 | bytes_needed)); 60| | 61| 79.7k| for(size_t i = sizeof(length) - bytes_needed; i < sizeof(length); ++i) { ------------------ | Branch (61:53): [True: 49.4k, False: 30.3k] ------------------ 62| 49.4k| encoded_length.push_back(get_byte_var(i, length)); 63| 49.4k| } 64| 30.3k| } 65| 128k|} der_enc.cpp:_ZZN5Botan11DER_EncoderC1ERNSt3__16vectorIhNS1_9allocatorIhEEEEENK3$_0clEPKhm: 90| 116k| m_append_output = [&vec](const uint8_t b[], size_t l) { 91| 116k| if(l > 0) { ------------------ | Branch (91:10): [True: 116k, False: 0] ------------------ 92| 116k| vec.insert(vec.end(), b, b + l); 93| 116k| } 94| 116k| }; _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| 32.4k|OID_Map& OID_Map::global_registry() { 17| 32.4k| static OID_Map g_map; 18| 32.4k| return g_map; 19| 32.4k|} _ZN5Botan7OID_Map7oid2strERKNS_3OIDE: 73| 9.20k|std::optional OID_Map::oid2str(const OID& oid) { 74| 9.20k| if(auto name = lookup_static_oid(oid)) { ------------------ | Branch (74:12): [True: 7.84k, False: 1.36k] ------------------ 75| 7.84k| return std::string(*name); 76| 7.84k| } 77| | 78| 1.36k| const lock_guard_type lock(m_mutex); 79| | 80| 1.36k| const auto i = m_oid2str.find(oid); 81| 1.36k| if(i != m_oid2str.end()) { ------------------ | Branch (81:7): [True: 0, False: 1.36k] ------------------ 82| 0| return i->second; 83| 0| } 84| | 85| 1.36k| return {}; 86| 1.36k|} _ZN5Botan7OID_Map7str2oidENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 88| 23.2k|OID OID_Map::str2oid(std::string_view str) { 89| 23.2k| if(auto oid = lookup_static_oid_name(str)) { ------------------ | Branch (89:12): [True: 23.2k, False: 0] ------------------ 90| 23.2k| return std::move(*oid); 91| 23.2k| } 92| | 93| 0| const lock_guard_type lock(m_mutex); 94| 0| const auto i = m_str2oid.find(std::string(str)); 95| 0| if(i != m_str2oid.end()) { ------------------ | Branch (95:7): [True: 0, False: 0] ------------------ 96| 0| return i->second; 97| 0| } 98| | 99| 0| return OID(); 100| 0|} _ZN5Botan10PSS_ParamsC2ENSt3__14spanIKhLm18446744073709551615EEE: 37| 15|PSS_Params::PSS_Params(std::span der) : m_salt_len(0), m_trailer_field(1) { 38| 15| BER_Decoder decoder(der, BER_Decoder::Limits::DER()); 39| 15| this->decode_from(decoder); 40| 15| decoder.verify_end(); 41| 15|} _ZN5Botan10PSS_Params11decode_fromERNS_11BER_DecoderE: 63| 15|void PSS_Params::decode_from(BER_Decoder& from) { 64| 15| const AlgorithmIdentifier default_hash("SHA-1", AlgorithmIdentifier::USE_NULL_PARAM); 65| 15| const AlgorithmIdentifier default_mgf("MGF1", default_hash.BER_encode()); 66| 15| const size_t default_salt_len = 20; 67| 15| const size_t default_trailer = 1; 68| | 69| 15| from.start_sequence() 70| 15| .decode_optional(m_hash, ASN1_Type(0), ASN1_Class::ExplicitContextSpecific, default_hash) 71| 15| .decode_optional(m_mgf, ASN1_Type(1), ASN1_Class::ExplicitContextSpecific, default_mgf) 72| 15| .decode_optional(m_salt_len, ASN1_Type(2), ASN1_Class::ExplicitContextSpecific, default_salt_len) 73| 15| .decode_optional(m_trailer_field, ASN1_Type(3), ASN1_Class::ExplicitContextSpecific, default_trailer) 74| 15| .end_cons(); 75| | 76| 15| BER_Decoder(m_mgf.parameters(), from.limits()).decode(m_mgf_hash).verify_end(); 77| | 78| 15| if(!m_hash.parameters_are_null_or_empty() || !m_mgf_hash.parameters_are_null_or_empty()) { ------------------ | Branch (78:7): [True: 4, False: 11] | Branch (78:49): [True: 0, False: 11] ------------------ 79| 0| throw Decoding_Error("Unexpected parameters for PSS hash algorithm identifier"); 80| 0| } 81| 15|} _ZN5Botan7OID_Map17lookup_static_oidERKNS_3OIDE: 48| 9.20k|std::optional OID_Map::lookup_static_oid(const OID& oid) { 49| 9.20k| const uint32_t hc = static_cast(oid.hash_code() % 858701); 50| | 51| 9.20k| switch(hc) { 52| 2| case 0x01506: ------------------ | Branch (52:7): [True: 2, False: 9.20k] ------------------ 53| 2| return if_match(oid, {1, 2, 840, 10045, 4, 3, 1}, "ECDSA/SHA-224"); 54| 676| case 0x01507: ------------------ | Branch (54:7): [True: 676, False: 8.53k] ------------------ 55| 676| return if_match(oid, {1, 2, 840, 10045, 4, 3, 2}, "ECDSA/SHA-256"); 56| 810| case 0x01508: ------------------ | Branch (56:7): [True: 810, False: 8.39k] ------------------ 57| 810| return if_match(oid, {1, 2, 840, 10045, 4, 3, 3}, "ECDSA/SHA-384"); 58| 2| case 0x01509: ------------------ | Branch (58:7): [True: 2, False: 9.20k] ------------------ 59| 2| return if_match(oid, {1, 2, 840, 10045, 4, 3, 4}, "ECDSA/SHA-512"); 60| 1| case 0x04C1E: ------------------ | Branch (60:7): [True: 1, False: 9.20k] ------------------ 61| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 3029, 1, 2, 1}, "ElGamal"); 62| 1| case 0x04E61: ------------------ | Branch (62:7): [True: 1, False: 9.20k] ------------------ 63| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 3029, 1, 5, 1}, "OpenPGP.Curve25519"); 64| 1| case 0x0779B: ------------------ | Branch (64:7): [True: 1, False: 9.20k] ------------------ 65| 1| return if_match(oid, {1, 2, 840, 113549, 2, 5}, "MD5"); 66| 1| case 0x0779D: ------------------ | Branch (66:7): [True: 1, False: 9.20k] ------------------ 67| 1| return if_match(oid, {1, 2, 840, 113549, 2, 7}, "HMAC(SHA-1)"); 68| 1| case 0x0779E: ------------------ | Branch (68:7): [True: 1, False: 9.20k] ------------------ 69| 1| return if_match(oid, {1, 2, 840, 113549, 2, 8}, "HMAC(SHA-224)"); 70| 1| case 0x0779F: ------------------ | Branch (70:7): [True: 1, False: 9.20k] ------------------ 71| 1| return if_match(oid, {1, 2, 840, 113549, 2, 9}, "HMAC(SHA-256)"); 72| 1| case 0x077A0: ------------------ | Branch (72:7): [True: 1, False: 9.20k] ------------------ 73| 1| return if_match(oid, {1, 2, 840, 113549, 2, 10}, "HMAC(SHA-384)"); 74| 1| case 0x077A1: ------------------ | Branch (74:7): [True: 1, False: 9.20k] ------------------ 75| 1| return if_match(oid, {1, 2, 840, 113549, 2, 11}, "HMAC(SHA-512)"); 76| 1| case 0x077A3: ------------------ | Branch (76:7): [True: 1, False: 9.20k] ------------------ 77| 1| return if_match(oid, {1, 2, 840, 113549, 2, 13}, "HMAC(SHA-512-256)"); 78| 2| case 0x0785E: ------------------ | Branch (78:7): [True: 2, False: 9.20k] ------------------ 79| 2| return if_match(oid, {1, 2, 840, 113549, 3, 7}, "TripleDES/CBC"); 80| 1| case 0x0C904: ------------------ | Branch (80:7): [True: 1, False: 9.20k] ------------------ 81| 1| return if_match(oid, {1, 0, 14888, 3, 0, 5}, "ECKCDSA"); 82| 1| case 0x11547: ------------------ | Branch (82:7): [True: 1, False: 9.20k] ------------------ 83| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 1}, "SphincsPlus-shake-128s-r3.1"); 84| 1| case 0x11548: ------------------ | Branch (84:7): [True: 1, False: 9.20k] ------------------ 85| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 2}, "SphincsPlus-shake-128f-r3.1"); 86| 2| case 0x11549: ------------------ | Branch (86:7): [True: 2, False: 9.20k] ------------------ 87| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 3}, "SphincsPlus-shake-192s-r3.1"); 88| 1| case 0x1154A: ------------------ | Branch (88:7): [True: 1, False: 9.20k] ------------------ 89| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 4}, "SphincsPlus-shake-192f-r3.1"); 90| 1| case 0x1154B: ------------------ | Branch (90:7): [True: 1, False: 9.20k] ------------------ 91| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 5}, "SphincsPlus-shake-256s-r3.1"); 92| 1| case 0x1154C: ------------------ | Branch (92:7): [True: 1, False: 9.20k] ------------------ 93| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 6}, "SphincsPlus-shake-256f-r3.1"); 94| 1| case 0x11608: ------------------ | Branch (94:7): [True: 1, False: 9.20k] ------------------ 95| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 1}, "SphincsPlus-sha2-128s-r3.1"); 96| 1| case 0x11609: ------------------ | Branch (96:7): [True: 1, False: 9.20k] ------------------ 97| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 2}, "SphincsPlus-sha2-128f-r3.1"); 98| 1| case 0x1160A: ------------------ | Branch (98:7): [True: 1, False: 9.20k] ------------------ 99| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 3}, "SphincsPlus-sha2-192s-r3.1"); 100| 1| case 0x1160B: ------------------ | Branch (100:7): [True: 1, False: 9.20k] ------------------ 101| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 4}, "SphincsPlus-sha2-192f-r3.1"); 102| 1| case 0x1160C: ------------------ | Branch (102:7): [True: 1, False: 9.20k] ------------------ 103| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 5}, "SphincsPlus-sha2-256s-r3.1"); 104| 1| case 0x1160D: ------------------ | Branch (104:7): [True: 1, False: 9.20k] ------------------ 105| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 6}, "SphincsPlus-sha2-256f-r3.1"); 106| 1| case 0x116C9: ------------------ | Branch (106:7): [True: 1, False: 9.20k] ------------------ 107| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 1}, "SphincsPlus-haraka-128s-r3.1"); 108| 1| case 0x116CA: ------------------ | Branch (108:7): [True: 1, False: 9.20k] ------------------ 109| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 2}, "SphincsPlus-haraka-128f-r3.1"); 110| 1| case 0x116CB: ------------------ | Branch (110:7): [True: 1, False: 9.20k] ------------------ 111| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 3}, "SphincsPlus-haraka-192s-r3.1"); 112| 1| case 0x116CC: ------------------ | Branch (112:7): [True: 1, False: 9.20k] ------------------ 113| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 4}, "SphincsPlus-haraka-192f-r3.1"); 114| 1| case 0x116CD: ------------------ | Branch (114:7): [True: 1, False: 9.20k] ------------------ 115| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 5}, "SphincsPlus-haraka-256s-r3.1"); 116| 1| case 0x116CE: ------------------ | Branch (116:7): [True: 1, False: 9.20k] ------------------ 117| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 6}, "SphincsPlus-haraka-256f-r3.1"); 118| 1| case 0x1533B: ------------------ | Branch (118:7): [True: 1, False: 9.20k] ------------------ 119| 1| return if_match(oid, {1, 2, 156, 10197, 1, 104, 2}, "SM4/CBC"); 120| 1| case 0x15341: ------------------ | Branch (120:7): [True: 1, False: 9.20k] ------------------ 121| 1| return if_match(oid, {1, 2, 156, 10197, 1, 104, 8}, "SM4/GCM"); 122| 1| case 0x1539D: ------------------ | Branch (122:7): [True: 1, False: 9.20k] ------------------ 123| 1| return if_match(oid, {1, 2, 156, 10197, 1, 104, 100}, "SM4/OCB"); 124| 1| case 0x187D7: ------------------ | Branch (124:7): [True: 1, False: 9.20k] ------------------ 125| 1| return if_match(oid, {1, 3, 14, 3, 2, 7}, "DES/CBC"); 126| 1| case 0x187EA: ------------------ | Branch (126:7): [True: 1, False: 9.20k] ------------------ 127| 1| return if_match(oid, {1, 3, 14, 3, 2, 26}, "SHA-1"); 128| 2| case 0x19933: ------------------ | Branch (128:7): [True: 2, False: 9.20k] ------------------ 129| 2| return if_match(oid, {1, 3, 132, 0, 8}, "secp160r1"); 130| 2| case 0x19934: ------------------ | Branch (130:7): [True: 2, False: 9.20k] ------------------ 131| 2| return if_match(oid, {1, 3, 132, 0, 9}, "secp160k1"); 132| 2| case 0x19935: ------------------ | Branch (132:7): [True: 2, False: 9.20k] ------------------ 133| 2| return if_match(oid, {1, 3, 132, 0, 10}, "secp256k1"); 134| 2| case 0x19949: ------------------ | Branch (134:7): [True: 2, False: 9.20k] ------------------ 135| 2| return if_match(oid, {1, 3, 132, 0, 30}, "secp160r2"); 136| 2| case 0x1994A: ------------------ | Branch (136:7): [True: 2, False: 9.20k] ------------------ 137| 2| return if_match(oid, {1, 3, 132, 0, 31}, "secp192k1"); 138| 2| case 0x1994B: ------------------ | Branch (138:7): [True: 2, False: 9.20k] ------------------ 139| 2| return if_match(oid, {1, 3, 132, 0, 32}, "secp224k1"); 140| 2| case 0x1994C: ------------------ | Branch (140:7): [True: 2, False: 9.20k] ------------------ 141| 2| return if_match(oid, {1, 3, 132, 0, 33}, "secp224r1"); 142| 2| case 0x1994D: ------------------ | Branch (142:7): [True: 2, False: 9.20k] ------------------ 143| 2| return if_match(oid, {1, 3, 132, 0, 34}, "secp384r1"); 144| 2| case 0x1994E: ------------------ | Branch (144:7): [True: 2, False: 9.20k] ------------------ 145| 2| return if_match(oid, {1, 3, 132, 0, 35}, "secp521r1"); 146| 1| case 0x199F8: ------------------ | Branch (146:7): [True: 1, False: 9.20k] ------------------ 147| 1| return if_match(oid, {1, 3, 132, 1, 12}, "ECDH"); 148| 1| case 0x1E7BF: ------------------ | Branch (148:7): [True: 1, False: 9.20k] ------------------ 149| 1| return if_match(oid, {1, 2, 156, 10197, 1, 301, 1}, "SM2"); 150| 1| case 0x1E7C0: ------------------ | Branch (150:7): [True: 1, False: 9.20k] ------------------ 151| 1| return if_match(oid, {1, 2, 156, 10197, 1, 301, 2}, "SM2_Kex"); 152| 1| case 0x1E7C1: ------------------ | Branch (152:7): [True: 1, False: 9.20k] ------------------ 153| 1| return if_match(oid, {1, 2, 156, 10197, 1, 301, 3}, "SM2_Enc"); 154| 1| case 0x21960: ------------------ | Branch (154:7): [True: 1, False: 9.20k] ------------------ 155| 1| return if_match(oid, {1, 3, 36, 3, 3, 1, 2}, "RSA/PKCS1v15(RIPEMD-160)"); 156| 1| case 0x2198A: ------------------ | Branch (156:7): [True: 1, False: 9.20k] ------------------ 157| 1| return if_match(oid, {1, 2, 840, 113533, 7, 66, 10}, "CAST-128/CBC"); 158| 1| case 0x2198F: ------------------ | Branch (158:7): [True: 1, False: 9.20k] ------------------ 159| 1| return if_match(oid, {1, 2, 840, 113533, 7, 66, 15}, "KeyWrap.CAST-128"); 160| 1| case 0x227C0: ------------------ | Branch (160:7): [True: 1, False: 9.20k] ------------------ 161| 1| return if_match(oid, {1, 3, 101, 110}, "X25519"); 162| 1| case 0x227C1: ------------------ | Branch (162:7): [True: 1, False: 9.20k] ------------------ 163| 1| return if_match(oid, {1, 3, 101, 111}, "X448"); 164| 1| case 0x227C2: ------------------ | Branch (164:7): [True: 1, False: 9.20k] ------------------ 165| 1| return if_match(oid, {1, 3, 101, 112}, "Ed25519"); 166| 1| case 0x227C3: ------------------ | Branch (166:7): [True: 1, False: 9.20k] ------------------ 167| 1| return if_match(oid, {1, 3, 101, 113}, "Ed448"); 168| 1| case 0x27565: ------------------ | Branch (168:7): [True: 1, False: 9.20k] ------------------ 169| 1| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1, 1}, "PKIX.OCSP.BasicResponse"); 170| 1| case 0x27566: ------------------ | Branch (170:7): [True: 1, False: 9.20k] ------------------ 171| 1| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1, 2}, "PKIX.OCSP.Nonce"); 172| 1| case 0x27569: ------------------ | Branch (172:7): [True: 1, False: 9.20k] ------------------ 173| 1| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1, 5}, "PKIX.OCSP.NoCheck"); 174| 1| case 0x29F7C: ------------------ | Branch (174:7): [True: 1, False: 9.20k] ------------------ 175| 1| return if_match(oid, {1, 2, 410, 200004, 1, 100, 4, 3}, "ECKCDSA/SHA-1"); 176| 1| case 0x29F7D: ------------------ | Branch (176:7): [True: 1, False: 9.20k] ------------------ 177| 1| return if_match(oid, {1, 2, 410, 200004, 1, 100, 4, 4}, "ECKCDSA/SHA-224"); 178| 1| case 0x29F7E: ------------------ | Branch (178:7): [True: 1, False: 9.20k] ------------------ 179| 1| return if_match(oid, {1, 2, 410, 200004, 1, 100, 4, 5}, "ECKCDSA/SHA-256"); 180| 1| case 0x2AC3B: ------------------ | Branch (180:7): [True: 1, False: 9.20k] ------------------ 181| 1| return if_match(oid, {2, 5, 29, 32, 0}, "X509v3.AnyPolicy"); 182| 1| case 0x2B000: ------------------ | Branch (182:7): [True: 1, False: 9.20k] ------------------ 183| 1| return if_match(oid, {2, 5, 29, 37, 0}, "X509v3.AnyExtendedKeyUsage"); 184| 1.27k| case 0x2B5C9: ------------------ | Branch (184:7): [True: 1.27k, False: 7.93k] ------------------ 185| 1.27k| return if_match(oid, {1, 2, 840, 10045, 2, 1}, "ECDSA"); 186| 2| case 0x2B74B: ------------------ | Branch (186:7): [True: 2, False: 9.20k] ------------------ 187| 2| return if_match(oid, {1, 2, 840, 10045, 4, 1}, "ECDSA/SHA-1"); 188| 105| case 0x3474A: ------------------ | Branch (188:7): [True: 105, False: 9.10k] ------------------ 189| 105| return if_match(oid, {1, 2, 840, 10046, 2, 1}, "DH"); 190| 306| case 0x38D6D: ------------------ | Branch (190:7): [True: 306, False: 8.90k] ------------------ 191| 306| return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 1, 1}, "gost_256A"); 192| 1| case 0x38D6E: ------------------ | Branch (192:7): [True: 1, False: 9.20k] ------------------ 193| 1| return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 1, 2}, "gost_256B"); 194| 2| case 0x38E2E: ------------------ | Branch (194:7): [True: 2, False: 9.20k] ------------------ 195| 2| return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 2, 1}, "gost_512A"); 196| 1| case 0x38E2F: ------------------ | Branch (196:7): [True: 1, False: 9.20k] ------------------ 197| 1| return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 2, 2}, "gost_512B"); 198| 16| case 0x38F2C: ------------------ | Branch (198:7): [True: 16, False: 9.19k] ------------------ 199| 16| return if_match(oid, {1, 2, 643, 2, 2, 3}, "GOST-34.10/GOST-R-34.11-94"); 200| 2| case 0x38F3C: ------------------ | Branch (200:7): [True: 2, False: 9.20k] ------------------ 201| 2| return if_match(oid, {1, 2, 643, 2, 2, 19}, "GOST-34.10"); 202| 1| case 0x3D7B8: ------------------ | Branch (202:7): [True: 1, False: 9.20k] ------------------ 203| 1| return if_match(oid, {0, 3, 4401, 5, 3, 1, 9, 6}, "Camellia-128/GCM"); 204| 1| case 0x3D7CC: ------------------ | Branch (204:7): [True: 1, False: 9.20k] ------------------ 205| 1| return if_match(oid, {0, 3, 4401, 5, 3, 1, 9, 26}, "Camellia-192/GCM"); 206| 1| case 0x3D7E0: ------------------ | Branch (206:7): [True: 1, False: 9.20k] ------------------ 207| 1| return if_match(oid, {0, 3, 4401, 5, 3, 1, 9, 46}, "Camellia-256/GCM"); 208| 1| case 0x3F20F: ------------------ | Branch (208:7): [True: 1, False: 9.20k] ------------------ 209| 1| return if_match(oid, {1, 3, 36, 3, 2, 1}, "RIPEMD-160"); 210| 1| case 0x4266E: ------------------ | Branch (210:7): [True: 1, False: 9.20k] ------------------ 211| 1| return if_match(oid, {0, 4, 0, 127, 0, 15, 1, 1, 13, 0}, "XMSS"); 212| 1| case 0x478C4: ------------------ | Branch (212:7): [True: 1, False: 9.20k] ------------------ 213| 1| return if_match(oid, {1, 2, 410, 200004, 1, 4}, "SEED/CBC"); 214| 1| case 0x47D98: ------------------ | Branch (214:7): [True: 1, False: 9.20k] ------------------ 215| 1| return if_match(oid, {1, 2, 156, 10197, 1, 301}, "sm2p256v1"); 216| 1| case 0x47DFC: ------------------ | Branch (216:7): [True: 1, False: 9.20k] ------------------ 217| 1| return if_match(oid, {1, 2, 156, 10197, 1, 401}, "SM3"); 218| 1| case 0x47E60: ------------------ | Branch (218:7): [True: 1, False: 9.20k] ------------------ 219| 1| return if_match(oid, {1, 2, 156, 10197, 1, 501}, "SM2_Sig/SM3"); 220| 1| case 0x47E63: ------------------ | Branch (220:7): [True: 1, False: 9.20k] ------------------ 221| 1| return if_match(oid, {1, 2, 156, 10197, 1, 504}, "RSA/PKCS1v15(SM3)"); 222| 1| case 0x52B13: ------------------ | Branch (222:7): [True: 1, False: 9.20k] ------------------ 223| 1| return if_match(oid, {1, 2, 643, 3, 131, 1, 1}, "GOST.INN"); 224| 1| case 0x635AE: ------------------ | Branch (224:7): [True: 1, False: 9.20k] ------------------ 225| 1| return if_match(oid, {1, 2, 250, 1, 223, 101, 256, 1}, "frp256v1"); 226| 1| case 0x6A784: ------------------ | Branch (226:7): [True: 1, False: 9.20k] ------------------ 227| 1| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 1}, "PKCS12.KeyBag"); 228| 1| case 0x6A785: ------------------ | Branch (228:7): [True: 1, False: 9.20k] ------------------ 229| 1| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 2}, "PKCS12.PKCS8ShroudedKeyBag"); 230| 1| case 0x6A786: ------------------ | Branch (230:7): [True: 1, False: 9.20k] ------------------ 231| 1| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 3}, "PKCS12.CertBag"); 232| 1| case 0x6A787: ------------------ | Branch (232:7): [True: 1, False: 9.20k] ------------------ 233| 1| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 4}, "PKCS12.CRLBag"); 234| 1| case 0x6A788: ------------------ | Branch (234:7): [True: 1, False: 9.20k] ------------------ 235| 1| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 5}, "PKCS12.SecretBag"); 236| 1| case 0x6A789: ------------------ | Branch (236:7): [True: 1, False: 9.20k] ------------------ 237| 1| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 6}, "PKCS12.SafeContentsBag"); 238| 1| case 0x6EB86: ------------------ | Branch (238:7): [True: 1, False: 9.20k] ------------------ 239| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 6, 1}, "GOST-34.10-2012-256/SHA-256"); 240| 1| case 0x6EC47: ------------------ | Branch (240:7): [True: 1, False: 9.20k] ------------------ 241| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 7, 1}, "Kyber-512-r3"); 242| 1| case 0x6EC48: ------------------ | Branch (242:7): [True: 1, False: 9.20k] ------------------ 243| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 7, 2}, "Kyber-768-r3"); 244| 1| case 0x6EC49: ------------------ | Branch (244:7): [True: 1, False: 9.20k] ------------------ 245| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 7, 3}, "Kyber-1024-r3"); 246| 1| case 0x6EDC9: ------------------ | Branch (246:7): [True: 1, False: 9.20k] ------------------ 247| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 9, 1}, "Dilithium-4x4-r3"); 248| 1| case 0x6EDCA: ------------------ | Branch (248:7): [True: 1, False: 9.20k] ------------------ 249| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 9, 2}, "Dilithium-6x5-r3"); 250| 1| case 0x6EDCB: ------------------ | Branch (250:7): [True: 1, False: 9.20k] ------------------ 251| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 9, 3}, "Dilithium-8x7-r3"); 252| 1| case 0x6EE8A: ------------------ | Branch (252:7): [True: 1, False: 9.20k] ------------------ 253| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 10, 1}, "Dilithium-4x4-AES-r3"); 254| 1| case 0x6EE8B: ------------------ | Branch (254:7): [True: 1, False: 9.20k] ------------------ 255| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 10, 2}, "Dilithium-6x5-AES-r3"); 256| 1| case 0x6EE8C: ------------------ | Branch (256:7): [True: 1, False: 9.20k] ------------------ 257| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 10, 3}, "Dilithium-8x7-AES-r3"); 258| 1| case 0x6EF4B: ------------------ | Branch (258:7): [True: 1, False: 9.20k] ------------------ 259| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 11, 1}, "Kyber-512-90s-r3"); 260| 1| case 0x6EF4C: ------------------ | Branch (260:7): [True: 1, False: 9.20k] ------------------ 261| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 11, 2}, "Kyber-768-90s-r3"); 262| 1| case 0x6EF4D: ------------------ | Branch (262:7): [True: 1, False: 9.20k] ------------------ 263| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 11, 3}, "Kyber-1024-90s-r3"); 264| 1| case 0x6F18E: ------------------ | Branch (264:7): [True: 1, False: 9.20k] ------------------ 265| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 14, 1}, "FrodoKEM-640-SHAKE"); 266| 1| case 0x6F18F: ------------------ | Branch (266:7): [True: 1, False: 9.20k] ------------------ 267| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 14, 2}, "FrodoKEM-976-SHAKE"); 268| 1| case 0x6F190: ------------------ | Branch (268:7): [True: 1, False: 9.20k] ------------------ 269| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 14, 3}, "FrodoKEM-1344-SHAKE"); 270| 1| case 0x6F24F: ------------------ | Branch (270:7): [True: 1, False: 9.20k] ------------------ 271| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 15, 1}, "FrodoKEM-640-AES"); 272| 1| case 0x6F250: ------------------ | Branch (272:7): [True: 1, False: 9.20k] ------------------ 273| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 15, 2}, "FrodoKEM-976-AES"); 274| 1| case 0x6F251: ------------------ | Branch (274:7): [True: 1, False: 9.20k] ------------------ 275| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 15, 3}, "FrodoKEM-1344-AES"); 276| 1| case 0x6F310: ------------------ | Branch (276:7): [True: 1, False: 9.20k] ------------------ 277| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 16, 1}, "eFrodoKEM-640-SHAKE"); 278| 1| case 0x6F311: ------------------ | Branch (278:7): [True: 1, False: 9.20k] ------------------ 279| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 16, 2}, "eFrodoKEM-976-SHAKE"); 280| 1| case 0x6F312: ------------------ | Branch (280:7): [True: 1, False: 9.20k] ------------------ 281| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 16, 3}, "eFrodoKEM-1344-SHAKE"); 282| 1| case 0x6F3D1: ------------------ | Branch (282:7): [True: 1, False: 9.20k] ------------------ 283| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 17, 1}, "eFrodoKEM-640-AES"); 284| 1| case 0x6F3D2: ------------------ | Branch (284:7): [True: 1, False: 9.20k] ------------------ 285| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 17, 2}, "eFrodoKEM-976-AES"); 286| 1| case 0x6F3D3: ------------------ | Branch (286:7): [True: 1, False: 9.20k] ------------------ 287| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 17, 3}, "eFrodoKEM-1344-AES"); 288| 1| case 0x6F492: ------------------ | Branch (288:7): [True: 1, False: 9.20k] ------------------ 289| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 1}, "ClassicMcEliece_6688128pc"); 290| 1| case 0x6F493: ------------------ | Branch (290:7): [True: 1, False: 9.20k] ------------------ 291| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 2}, "ClassicMcEliece_6688128pcf"); 292| 1| case 0x6F494: ------------------ | Branch (292:7): [True: 1, False: 9.20k] ------------------ 293| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 3}, "ClassicMcEliece_6960119pc"); 294| 1| case 0x6F495: ------------------ | Branch (294:7): [True: 1, False: 9.20k] ------------------ 295| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 4}, "ClassicMcEliece_6960119pcf"); 296| 1| case 0x6F496: ------------------ | Branch (296:7): [True: 1, False: 9.20k] ------------------ 297| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 5}, "ClassicMcEliece_8192128pc"); 298| 1| case 0x6F497: ------------------ | Branch (298:7): [True: 1, False: 9.20k] ------------------ 299| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 6}, "ClassicMcEliece_8192128pcf"); 300| 1| case 0x6F79D: ------------------ | Branch (300:7): [True: 1, False: 9.20k] ------------------ 301| 1| return if_match(oid, {2, 16, 840, 1, 113730, 1, 13}, "Certificate Comment"); 302| 1| case 0x701A0: ------------------ | Branch (302:7): [True: 1, False: 9.20k] ------------------ 303| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 2, 1}, "ECGDSA"); 304| 1| case 0x70322: ------------------ | Branch (304:7): [True: 1, False: 9.20k] ------------------ 305| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 1}, "ECGDSA/RIPEMD-160"); 306| 1| case 0x70323: ------------------ | Branch (306:7): [True: 1, False: 9.20k] ------------------ 307| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 2}, "ECGDSA/SHA-1"); 308| 1| case 0x70324: ------------------ | Branch (308:7): [True: 1, False: 9.20k] ------------------ 309| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 3}, "ECGDSA/SHA-224"); 310| 1| case 0x70325: ------------------ | Branch (310:7): [True: 1, False: 9.20k] ------------------ 311| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 4}, "ECGDSA/SHA-256"); 312| 1| case 0x70326: ------------------ | Branch (312:7): [True: 1, False: 9.20k] ------------------ 313| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 5}, "ECGDSA/SHA-384"); 314| 1| case 0x70327: ------------------ | Branch (314:7): [True: 1, False: 9.20k] ------------------ 315| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 6}, "ECGDSA/SHA-512"); 316| 374| case 0x72B21: ------------------ | Branch (316:7): [True: 374, False: 8.83k] ------------------ 317| 374| return if_match(oid, {1, 2, 643, 7, 1, 1, 1, 1}, "GOST-34.10-2012-256"); 318| 12| case 0x72B22: ------------------ | Branch (318:7): [True: 12, False: 9.19k] ------------------ 319| 12| return if_match(oid, {1, 2, 643, 7, 1, 1, 1, 2}, "GOST-34.10-2012-512"); 320| 2| case 0x72BE3: ------------------ | Branch (320:7): [True: 2, False: 9.20k] ------------------ 321| 2| return if_match(oid, {1, 2, 643, 7, 1, 1, 2, 2}, "Streebog-256"); 322| 2| case 0x72BE4: ------------------ | Branch (322:7): [True: 2, False: 9.20k] ------------------ 323| 2| return if_match(oid, {1, 2, 643, 7, 1, 1, 2, 3}, "Streebog-512"); 324| 866| case 0x72CA4: ------------------ | Branch (324:7): [True: 866, False: 8.34k] ------------------ 325| 866| return if_match(oid, {1, 2, 643, 7, 1, 1, 3, 2}, "GOST-34.10-2012-256/Streebog-256"); 326| 2| case 0x72CA5: ------------------ | Branch (326:7): [True: 2, False: 9.20k] ------------------ 327| 2| return if_match(oid, {1, 2, 643, 7, 1, 1, 3, 3}, "GOST-34.10-2012-512/Streebog-512"); 328| 1| case 0x7C7C7: ------------------ | Branch (328:7): [True: 1, False: 9.20k] ------------------ 329| 1| return if_match(oid, {1, 2, 840, 113549, 1, 9, 22, 1}, "PKCS9.X509Certificate"); 330| 1| case 0x7C7C8: ------------------ | Branch (330:7): [True: 1, False: 9.20k] ------------------ 331| 1| return if_match(oid, {1, 2, 840, 113549, 1, 9, 22, 2}, "PKCS9.SDSICertificate"); 332| 1| case 0x7C888: ------------------ | Branch (332:7): [True: 1, False: 9.20k] ------------------ 333| 1| return if_match(oid, {1, 2, 840, 113549, 1, 9, 23, 1}, "PKCS9.X509CRL"); 334| 1| case 0x7E10F: ------------------ | Branch (334:7): [True: 1, False: 9.20k] ------------------ 335| 1| return if_match(oid, {2, 5, 4, 3}, "X520.CommonName"); 336| 1| case 0x7E110: ------------------ | Branch (336:7): [True: 1, False: 9.20k] ------------------ 337| 1| return if_match(oid, {2, 5, 4, 4}, "X520.Surname"); 338| 1| case 0x7E111: ------------------ | Branch (338:7): [True: 1, False: 9.20k] ------------------ 339| 1| return if_match(oid, {2, 5, 4, 5}, "X520.SerialNumber"); 340| 1| case 0x7E112: ------------------ | Branch (340:7): [True: 1, False: 9.20k] ------------------ 341| 1| return if_match(oid, {2, 5, 4, 6}, "X520.Country"); 342| 1| case 0x7E113: ------------------ | Branch (342:7): [True: 1, False: 9.20k] ------------------ 343| 1| return if_match(oid, {2, 5, 4, 7}, "X520.Locality"); 344| 1| case 0x7E114: ------------------ | Branch (344:7): [True: 1, False: 9.20k] ------------------ 345| 1| return if_match(oid, {2, 5, 4, 8}, "X520.State"); 346| 1| case 0x7E115: ------------------ | Branch (346:7): [True: 1, False: 9.20k] ------------------ 347| 1| return if_match(oid, {2, 5, 4, 9}, "X520.StreetAddress"); 348| 1| case 0x7E116: ------------------ | Branch (348:7): [True: 1, False: 9.20k] ------------------ 349| 1| return if_match(oid, {2, 5, 4, 10}, "X520.Organization"); 350| 1| case 0x7E117: ------------------ | Branch (350:7): [True: 1, False: 9.20k] ------------------ 351| 1| return if_match(oid, {2, 5, 4, 11}, "X520.OrganizationalUnit"); 352| 1| case 0x7E118: ------------------ | Branch (352:7): [True: 1, False: 9.20k] ------------------ 353| 1| return if_match(oid, {2, 5, 4, 12}, "X520.Title"); 354| 1| case 0x7E136: ------------------ | Branch (354:7): [True: 1, False: 9.20k] ------------------ 355| 1| return if_match(oid, {2, 5, 4, 42}, "X520.GivenName"); 356| 1| case 0x7E137: ------------------ | Branch (356:7): [True: 1, False: 9.20k] ------------------ 357| 1| return if_match(oid, {2, 5, 4, 43}, "X520.Initials"); 358| 1| case 0x7E138: ------------------ | Branch (358:7): [True: 1, False: 9.20k] ------------------ 359| 1| return if_match(oid, {2, 5, 4, 44}, "X520.GenerationalQualifier"); 360| 1| case 0x7E13A: ------------------ | Branch (360:7): [True: 1, False: 9.20k] ------------------ 361| 1| return if_match(oid, {2, 5, 4, 46}, "X520.DNQualifier"); 362| 1| case 0x7E14D: ------------------ | Branch (362:7): [True: 1, False: 9.20k] ------------------ 363| 1| return if_match(oid, {2, 5, 4, 65}, "X520.Pseudonym"); 364| 1| case 0x7F3F3: ------------------ | Branch (364:7): [True: 1, False: 9.20k] ------------------ 365| 1| return if_match(oid, {2, 5, 29, 14}, "X509v3.SubjectKeyIdentifier"); 366| 1| case 0x7F3F4: ------------------ | Branch (366:7): [True: 1, False: 9.20k] ------------------ 367| 1| return if_match(oid, {2, 5, 29, 15}, "X509v3.KeyUsage"); 368| 1| case 0x7F3F5: ------------------ | Branch (368:7): [True: 1, False: 9.20k] ------------------ 369| 1| return if_match(oid, {2, 5, 29, 16}, "X509v3.PrivateKeyUsagePeriod"); 370| 2| case 0x7F3F6: ------------------ | Branch (370:7): [True: 2, False: 9.20k] ------------------ 371| 2| return if_match(oid, {2, 5, 29, 17}, "X509v3.SubjectAlternativeName"); 372| 1| case 0x7F3F7: ------------------ | Branch (372:7): [True: 1, False: 9.20k] ------------------ 373| 1| return if_match(oid, {2, 5, 29, 18}, "X509v3.IssuerAlternativeName"); 374| 1| case 0x7F3F8: ------------------ | Branch (374:7): [True: 1, False: 9.20k] ------------------ 375| 1| return if_match(oid, {2, 5, 29, 19}, "X509v3.BasicConstraints"); 376| 1| case 0x7F3F9: ------------------ | Branch (376:7): [True: 1, False: 9.20k] ------------------ 377| 1| return if_match(oid, {2, 5, 29, 20}, "X509v3.CRLNumber"); 378| 1| case 0x7F3FA: ------------------ | Branch (378:7): [True: 1, False: 9.20k] ------------------ 379| 1| return if_match(oid, {2, 5, 29, 21}, "X509v3.ReasonCode"); 380| 1| case 0x7F3FC: ------------------ | Branch (380:7): [True: 1, False: 9.20k] ------------------ 381| 1| return if_match(oid, {2, 5, 29, 23}, "X509v3.HoldInstructionCode"); 382| 1| case 0x7F3FD: ------------------ | Branch (382:7): [True: 1, False: 9.20k] ------------------ 383| 1| return if_match(oid, {2, 5, 29, 24}, "X509v3.InvalidityDate"); 384| 1| case 0x7F401: ------------------ | Branch (384:7): [True: 1, False: 9.20k] ------------------ 385| 1| return if_match(oid, {2, 5, 29, 28}, "X509v3.CRLIssuingDistributionPoint"); 386| 1| case 0x7F403: ------------------ | Branch (386:7): [True: 1, False: 9.20k] ------------------ 387| 1| return if_match(oid, {2, 5, 29, 30}, "X509v3.NameConstraints"); 388| 1| case 0x7F404: ------------------ | Branch (388:7): [True: 1, False: 9.20k] ------------------ 389| 1| return if_match(oid, {2, 5, 29, 31}, "X509v3.CRLDistributionPoints"); 390| 1| case 0x7F405: ------------------ | Branch (390:7): [True: 1, False: 9.20k] ------------------ 391| 1| return if_match(oid, {2, 5, 29, 32}, "X509v3.CertificatePolicies"); 392| 1| case 0x7F408: ------------------ | Branch (392:7): [True: 1, False: 9.20k] ------------------ 393| 1| return if_match(oid, {2, 5, 29, 35}, "X509v3.AuthorityKeyIdentifier"); 394| 1| case 0x7F409: ------------------ | Branch (394:7): [True: 1, False: 9.20k] ------------------ 395| 1| return if_match(oid, {2, 5, 29, 36}, "X509v3.PolicyConstraints"); 396| 2| case 0x7F40A: ------------------ | Branch (396:7): [True: 2, False: 9.20k] ------------------ 397| 2| return if_match(oid, {2, 5, 29, 37}, "X509v3.ExtendedKeyUsage"); 398| 1| case 0x7F41D: ------------------ | Branch (398:7): [True: 1, False: 9.20k] ------------------ 399| 1| return if_match(oid, {2, 5, 29, 56}, "X509v3.NoRevocationAvailable"); 400| 1| case 0x80B84: ------------------ | Branch (400:7): [True: 1, False: 9.20k] ------------------ 401| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 1}, "AES-128/OCB"); 402| 1| case 0x80B85: ------------------ | Branch (402:7): [True: 1, False: 9.20k] ------------------ 403| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 2}, "AES-192/OCB"); 404| 1| case 0x80B86: ------------------ | Branch (404:7): [True: 1, False: 9.20k] ------------------ 405| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 3}, "AES-256/OCB"); 406| 1| case 0x80B87: ------------------ | Branch (406:7): [True: 1, False: 9.20k] ------------------ 407| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 4}, "Serpent/OCB"); 408| 1| case 0x80B88: ------------------ | Branch (408:7): [True: 1, False: 9.20k] ------------------ 409| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 5}, "Twofish/OCB"); 410| 1| case 0x80B89: ------------------ | Branch (410:7): [True: 1, False: 9.20k] ------------------ 411| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 6}, "Camellia-128/OCB"); 412| 1| case 0x80B8A: ------------------ | Branch (412:7): [True: 1, False: 9.20k] ------------------ 413| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 7}, "Camellia-192/OCB"); 414| 1| case 0x80B8B: ------------------ | Branch (414:7): [True: 1, False: 9.20k] ------------------ 415| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 8}, "Camellia-256/OCB"); 416| 1| case 0x80D06: ------------------ | Branch (416:7): [True: 1, False: 9.20k] ------------------ 417| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 1}, "AES-128/SIV"); 418| 1| case 0x80D07: ------------------ | Branch (418:7): [True: 1, False: 9.20k] ------------------ 419| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 2}, "AES-192/SIV"); 420| 1| case 0x80D08: ------------------ | Branch (420:7): [True: 1, False: 9.20k] ------------------ 421| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 3}, "AES-256/SIV"); 422| 1| case 0x80D09: ------------------ | Branch (422:7): [True: 1, False: 9.20k] ------------------ 423| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 4}, "Serpent/SIV"); 424| 1| case 0x80D0A: ------------------ | Branch (424:7): [True: 1, False: 9.20k] ------------------ 425| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 5}, "Twofish/SIV"); 426| 1| case 0x80D0B: ------------------ | Branch (426:7): [True: 1, False: 9.20k] ------------------ 427| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 6}, "Camellia-128/SIV"); 428| 1| case 0x80D0C: ------------------ | Branch (428:7): [True: 1, False: 9.20k] ------------------ 429| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 7}, "Camellia-192/SIV"); 430| 1| case 0x80D0D: ------------------ | Branch (430:7): [True: 1, False: 9.20k] ------------------ 431| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 8}, "Camellia-256/SIV"); 432| 1| case 0x80D0E: ------------------ | Branch (432:7): [True: 1, False: 9.20k] ------------------ 433| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 9}, "SM4/SIV"); 434| 1| case 0x84C6A: ------------------ | Branch (434:7): [True: 1, False: 9.20k] ------------------ 435| 1| return if_match(oid, {1, 2, 392, 200011, 61, 1, 1, 1, 2}, "Camellia-128/CBC"); 436| 1| case 0x84C6B: ------------------ | Branch (436:7): [True: 1, False: 9.20k] ------------------ 437| 1| return if_match(oid, {1, 2, 392, 200011, 61, 1, 1, 1, 3}, "Camellia-192/CBC"); 438| 1| case 0x84C6C: ------------------ | Branch (438:7): [True: 1, False: 9.20k] ------------------ 439| 1| return if_match(oid, {1, 2, 392, 200011, 61, 1, 1, 1, 4}, "Camellia-256/CBC"); 440| 1| case 0x88CD3: ------------------ | Branch (440:7): [True: 1, False: 9.20k] ------------------ 441| 1| return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 6}, "KeyWrap.TripleDES"); 442| 1| case 0x88CD5: ------------------ | Branch (442:7): [True: 1, False: 9.20k] ------------------ 443| 1| return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 8}, "Compression.Zlib"); 444| 1| case 0x88CDE: ------------------ | Branch (444:7): [True: 1, False: 9.20k] ------------------ 445| 1| return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 17}, "HSS-LMS"); 446| 1| case 0x88CDF: ------------------ | Branch (446:7): [True: 1, False: 9.20k] ------------------ 447| 1| return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 18}, "ChaCha20Poly1305"); 448| 2| case 0x92296: ------------------ | Branch (448:7): [True: 2, False: 9.20k] ------------------ 449| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 2}, "AES-128/CBC"); 450| 2| case 0x92299: ------------------ | Branch (450:7): [True: 2, False: 9.20k] ------------------ 451| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 5}, "KeyWrap.AES-128"); 452| 2| case 0x9229A: ------------------ | Branch (452:7): [True: 2, False: 9.20k] ------------------ 453| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 6}, "AES-128/GCM"); 454| 2| case 0x9229B: ------------------ | Branch (454:7): [True: 2, False: 9.20k] ------------------ 455| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 7}, "AES-128/CCM"); 456| 2| case 0x922AA: ------------------ | Branch (456:7): [True: 2, False: 9.20k] ------------------ 457| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 22}, "AES-192/CBC"); 458| 2| case 0x922AD: ------------------ | Branch (458:7): [True: 2, False: 9.20k] ------------------ 459| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 25}, "KeyWrap.AES-192"); 460| 2| case 0x922AE: ------------------ | Branch (460:7): [True: 2, False: 9.20k] ------------------ 461| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 26}, "AES-192/GCM"); 462| 2| case 0x922AF: ------------------ | Branch (462:7): [True: 2, False: 9.20k] ------------------ 463| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 27}, "AES-192/CCM"); 464| 2| case 0x922BE: ------------------ | Branch (464:7): [True: 2, False: 9.20k] ------------------ 465| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 42}, "AES-256/CBC"); 466| 2| case 0x922C1: ------------------ | Branch (466:7): [True: 2, False: 9.20k] ------------------ 467| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 45}, "KeyWrap.AES-256"); 468| 2| case 0x922C2: ------------------ | Branch (468:7): [True: 2, False: 9.20k] ------------------ 469| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 46}, "AES-256/GCM"); 470| 2| case 0x922C3: ------------------ | Branch (470:7): [True: 2, False: 9.20k] ------------------ 471| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 47}, "AES-256/CCM"); 472| 2| case 0x92356: ------------------ | Branch (472:7): [True: 2, False: 9.20k] ------------------ 473| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 1}, "SHA-256"); 474| 2| case 0x92357: ------------------ | Branch (474:7): [True: 2, False: 9.20k] ------------------ 475| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 2}, "SHA-384"); 476| 13| case 0x92358: ------------------ | Branch (476:7): [True: 13, False: 9.19k] ------------------ 477| 13| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 3}, "SHA-512"); 478| 2| case 0x92359: ------------------ | Branch (478:7): [True: 2, False: 9.20k] ------------------ 479| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 4}, "SHA-224"); 480| 2| case 0x9235B: ------------------ | Branch (480:7): [True: 2, False: 9.20k] ------------------ 481| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 6}, "SHA-512-256"); 482| 3| case 0x9235C: ------------------ | Branch (482:7): [True: 3, False: 9.20k] ------------------ 483| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 7}, "SHA-3(224)"); 484| 2| case 0x9235D: ------------------ | Branch (484:7): [True: 2, False: 9.20k] ------------------ 485| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 8}, "SHA-3(256)"); 486| 2| case 0x9235E: ------------------ | Branch (486:7): [True: 2, False: 9.20k] ------------------ 487| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 9}, "SHA-3(384)"); 488| 3| case 0x9235F: ------------------ | Branch (488:7): [True: 3, False: 9.20k] ------------------ 489| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 10}, "SHA-3(512)"); 490| 2| case 0x92360: ------------------ | Branch (490:7): [True: 2, False: 9.20k] ------------------ 491| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 11}, "SHAKE-128"); 492| 2| case 0x92361: ------------------ | Branch (492:7): [True: 2, False: 9.20k] ------------------ 493| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 12}, "SHAKE-256"); 494| 2| case 0x92417: ------------------ | Branch (494:7): [True: 2, False: 9.20k] ------------------ 495| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 1}, "DSA/SHA-224"); 496| 2| case 0x92418: ------------------ | Branch (496:7): [True: 2, False: 9.20k] ------------------ 497| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 2}, "DSA/SHA-256"); 498| 2| case 0x92419: ------------------ | Branch (498:7): [True: 2, False: 9.20k] ------------------ 499| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 3}, "DSA/SHA-384"); 500| 2| case 0x9241A: ------------------ | Branch (500:7): [True: 2, False: 9.20k] ------------------ 501| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 4}, "DSA/SHA-512"); 502| 2| case 0x9241B: ------------------ | Branch (502:7): [True: 2, False: 9.20k] ------------------ 503| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 5}, "DSA/SHA-3(224)"); 504| 2| case 0x9241C: ------------------ | Branch (504:7): [True: 2, False: 9.20k] ------------------ 505| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 6}, "DSA/SHA-3(256)"); 506| 2| case 0x9241D: ------------------ | Branch (506:7): [True: 2, False: 9.20k] ------------------ 507| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 7}, "DSA/SHA-3(384)"); 508| 2| case 0x9241E: ------------------ | Branch (508:7): [True: 2, False: 9.20k] ------------------ 509| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 8}, "DSA/SHA-3(512)"); 510| 2| case 0x9241F: ------------------ | Branch (510:7): [True: 2, False: 9.20k] ------------------ 511| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 9}, "ECDSA/SHA-3(224)"); 512| 2| case 0x92420: ------------------ | Branch (512:7): [True: 2, False: 9.20k] ------------------ 513| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 10}, "ECDSA/SHA-3(256)"); 514| 3| case 0x92421: ------------------ | Branch (514:7): [True: 3, False: 9.20k] ------------------ 515| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 11}, "ECDSA/SHA-3(384)"); 516| 2| case 0x92422: ------------------ | Branch (516:7): [True: 2, False: 9.20k] ------------------ 517| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 12}, "ECDSA/SHA-3(512)"); 518| 3| case 0x92423: ------------------ | Branch (518:7): [True: 3, False: 9.20k] ------------------ 519| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 13}, "RSA/PKCS1v15(SHA-3(224))"); 520| 3| case 0x92424: ------------------ | Branch (520:7): [True: 3, False: 9.20k] ------------------ 521| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 14}, "RSA/PKCS1v15(SHA-3(256))"); 522| 3| case 0x92425: ------------------ | Branch (522:7): [True: 3, False: 9.20k] ------------------ 523| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 15}, "RSA/PKCS1v15(SHA-3(384))"); 524| 3| case 0x92426: ------------------ | Branch (524:7): [True: 3, False: 9.20k] ------------------ 525| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 16}, "RSA/PKCS1v15(SHA-3(512))"); 526| 3| case 0x92427: ------------------ | Branch (526:7): [True: 3, False: 9.20k] ------------------ 527| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 17}, "ML-DSA-4x4"); 528| 3| case 0x92428: ------------------ | Branch (528:7): [True: 3, False: 9.20k] ------------------ 529| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 18}, "ML-DSA-6x5"); 530| 3| case 0x92429: ------------------ | Branch (530:7): [True: 3, False: 9.20k] ------------------ 531| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 19}, "ML-DSA-8x7"); 532| 3| case 0x9242A: ------------------ | Branch (532:7): [True: 3, False: 9.20k] ------------------ 533| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 20}, "SLH-DSA-SHA2-128s"); 534| 3| case 0x9242B: ------------------ | Branch (534:7): [True: 3, False: 9.20k] ------------------ 535| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 21}, "SLH-DSA-SHA2-128f"); 536| 3| case 0x9242C: ------------------ | Branch (536:7): [True: 3, False: 9.20k] ------------------ 537| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 22}, "SLH-DSA-SHA2-192s"); 538| 3| case 0x9242D: ------------------ | Branch (538:7): [True: 3, False: 9.20k] ------------------ 539| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 23}, "SLH-DSA-SHA2-192f"); 540| 3| case 0x9242E: ------------------ | Branch (540:7): [True: 3, False: 9.20k] ------------------ 541| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 24}, "SLH-DSA-SHA2-256s"); 542| 3| case 0x9242F: ------------------ | Branch (542:7): [True: 3, False: 9.20k] ------------------ 543| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 25}, "SLH-DSA-SHA2-256f"); 544| 3| case 0x92430: ------------------ | Branch (544:7): [True: 3, False: 9.20k] ------------------ 545| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 26}, "SLH-DSA-SHAKE-128s"); 546| 3| case 0x92431: ------------------ | Branch (546:7): [True: 3, False: 9.20k] ------------------ 547| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 27}, "SLH-DSA-SHAKE-128f"); 548| 3| case 0x92432: ------------------ | Branch (548:7): [True: 3, False: 9.20k] ------------------ 549| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 28}, "SLH-DSA-SHAKE-192s"); 550| 3| case 0x92433: ------------------ | Branch (550:7): [True: 3, False: 9.20k] ------------------ 551| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 29}, "SLH-DSA-SHAKE-192f"); 552| 3| case 0x92434: ------------------ | Branch (552:7): [True: 3, False: 9.20k] ------------------ 553| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 30}, "SLH-DSA-SHAKE-256s"); 554| 3| case 0x92435: ------------------ | Branch (554:7): [True: 3, False: 9.20k] ------------------ 555| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 31}, "SLH-DSA-SHAKE-256f"); 556| 3| case 0x924D8: ------------------ | Branch (556:7): [True: 3, False: 9.20k] ------------------ 557| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 4, 1}, "ML-KEM-512"); 558| 3| case 0x924D9: ------------------ | Branch (558:7): [True: 3, False: 9.20k] ------------------ 559| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 4, 2}, "ML-KEM-768"); 560| 3| case 0x924DA: ------------------ | Branch (560:7): [True: 3, False: 9.20k] ------------------ 561| 3| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 4, 3}, "ML-KEM-1024"); 562| 2| case 0x9479F: ------------------ | Branch (562:7): [True: 2, False: 9.20k] ------------------ 563| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 1}, "PKIX.AuthorityInformationAccess"); 564| 2| case 0x947A5: ------------------ | Branch (564:7): [True: 2, False: 9.20k] ------------------ 565| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 7}, "PKIX.IpAddrBlocks"); 566| 2| case 0x947A6: ------------------ | Branch (566:7): [True: 2, False: 9.20k] ------------------ 567| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 8}, "PKIX.AutonomousSysIds"); 568| 2| case 0x947B8: ------------------ | Branch (568:7): [True: 2, False: 9.20k] ------------------ 569| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 26}, "PKIX.TNAuthList"); 570| 2| case 0x94921: ------------------ | Branch (570:7): [True: 2, False: 9.20k] ------------------ 571| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 1}, "PKIX.ServerAuth"); 572| 2| case 0x94922: ------------------ | Branch (572:7): [True: 2, False: 9.20k] ------------------ 573| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 2}, "PKIX.ClientAuth"); 574| 2| case 0x94923: ------------------ | Branch (574:7): [True: 2, False: 9.20k] ------------------ 575| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 3}, "PKIX.CodeSigning"); 576| 2| case 0x94924: ------------------ | Branch (576:7): [True: 2, False: 9.20k] ------------------ 577| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 4}, "PKIX.EmailProtection"); 578| 2| case 0x94925: ------------------ | Branch (578:7): [True: 2, False: 9.20k] ------------------ 579| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 5}, "PKIX.IPsecEndSystem"); 580| 2| case 0x94926: ------------------ | Branch (580:7): [True: 2, False: 9.20k] ------------------ 581| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 6}, "PKIX.IPsecTunnel"); 582| 2| case 0x94927: ------------------ | Branch (582:7): [True: 2, False: 9.20k] ------------------ 583| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 7}, "PKIX.IPsecUser"); 584| 2| case 0x94928: ------------------ | Branch (584:7): [True: 2, False: 9.20k] ------------------ 585| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 8}, "PKIX.TimeStamping"); 586| 2| case 0x94929: ------------------ | Branch (586:7): [True: 2, False: 9.20k] ------------------ 587| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 9}, "PKIX.OCSPSigning"); 588| 2| case 0x94CEA: ------------------ | Branch (588:7): [True: 2, False: 9.20k] ------------------ 589| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 8, 5}, "PKIX.XMPPAddr"); 590| 2| case 0x94CEE: ------------------ | Branch (590:7): [True: 2, False: 9.20k] ------------------ 591| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 8, 9}, "PKIX.SmtpUTF8Mailbox"); 592| 1| case 0x954DB: ------------------ | Branch (592:7): [True: 1, False: 9.20k] ------------------ 593| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 311, 20, 2, 2}, "Microsoft SmartcardLogon"); 594| 1| case 0x954DC: ------------------ | Branch (594:7): [True: 1, False: 9.20k] ------------------ 595| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 311, 20, 2, 3}, "Microsoft UPN"); 596| 2| case 0x96B0E: ------------------ | Branch (596:7): [True: 2, False: 9.20k] ------------------ 597| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1}, "PKIX.OCSP"); 598| 2| case 0x96B0F: ------------------ | Branch (598:7): [True: 2, False: 9.20k] ------------------ 599| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 2}, "PKIX.CertificateAuthorityIssuers"); 600| 2| case 0x96B1B: ------------------ | Branch (600:7): [True: 2, False: 9.20k] ------------------ 601| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 14}, "PKIX.STIRTNList"); 602| 1| case 0x96C77: ------------------ | Branch (602:7): [True: 1, False: 9.20k] ------------------ 603| 1| return if_match(oid, {1, 2, 840, 113549, 1, 12, 1, 3}, "PBE-SHA1-3DES"); 604| 1| case 0x96C78: ------------------ | Branch (604:7): [True: 1, False: 9.20k] ------------------ 605| 1| return if_match(oid, {1, 2, 840, 113549, 1, 12, 1, 4}, "PBE-SHA1-2DES"); 606| 1| case 0x9A008: ------------------ | Branch (606:7): [True: 1, False: 9.20k] ------------------ 607| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 1}, "brainpool160r1"); 608| 1| case 0x9A00A: ------------------ | Branch (608:7): [True: 1, False: 9.20k] ------------------ 609| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 3}, "brainpool192r1"); 610| 1| case 0x9A00C: ------------------ | Branch (610:7): [True: 1, False: 9.20k] ------------------ 611| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 5}, "brainpool224r1"); 612| 1| case 0x9A00E: ------------------ | Branch (612:7): [True: 1, False: 9.20k] ------------------ 613| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 7}, "brainpool256r1"); 614| 1| case 0x9A010: ------------------ | Branch (614:7): [True: 1, False: 9.20k] ------------------ 615| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 9}, "brainpool320r1"); 616| 1| case 0x9A012: ------------------ | Branch (616:7): [True: 1, False: 9.20k] ------------------ 617| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 11}, "brainpool384r1"); 618| 1| case 0x9A014: ------------------ | Branch (618:7): [True: 1, False: 9.20k] ------------------ 619| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 13}, "brainpool512r1"); 620| 1| case 0xA0D61: ------------------ | Branch (620:7): [True: 1, False: 9.20k] ------------------ 621| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 3}, "McEliece"); 622| 1| case 0xA0D63: ------------------ | Branch (622:7): [True: 1, False: 9.20k] ------------------ 623| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 5}, "XMSS-draft6"); 624| 1| case 0xA0D66: ------------------ | Branch (624:7): [True: 1, False: 9.20k] ------------------ 625| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 8}, "XMSS-draft12"); 626| 1| case 0xA0D6B: ------------------ | Branch (626:7): [True: 1, False: 9.20k] ------------------ 627| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 13}, "HSS-LMS-Private-Key"); 628| 1| case 0xA0EE1: ------------------ | Branch (628:7): [True: 1, False: 9.20k] ------------------ 629| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 1}, "Serpent/CBC"); 630| 1| case 0xA0EE2: ------------------ | Branch (630:7): [True: 1, False: 9.20k] ------------------ 631| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2}, "Threefish-512/CBC"); 632| 1| case 0xA0EE3: ------------------ | Branch (632:7): [True: 1, False: 9.20k] ------------------ 633| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 3}, "Twofish/CBC"); 634| 1| case 0xA0F45: ------------------ | Branch (634:7): [True: 1, False: 9.20k] ------------------ 635| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 101}, "Serpent/GCM"); 636| 1| case 0xA0F46: ------------------ | Branch (636:7): [True: 1, False: 9.20k] ------------------ 637| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 102}, "Twofish/GCM"); 638| 1| case 0xA0FA2: ------------------ | Branch (638:7): [True: 1, False: 9.20k] ------------------ 639| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 4, 1}, "numsp256d1"); 640| 1| case 0xA0FA3: ------------------ | Branch (640:7): [True: 1, False: 9.20k] ------------------ 641| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 4, 2}, "numsp384d1"); 642| 1| case 0xA0FA4: ------------------ | Branch (642:7): [True: 1, False: 9.20k] ------------------ 643| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 4, 3}, "numsp512d1"); 644| 1| case 0xA244B: ------------------ | Branch (644:7): [True: 1, False: 9.20k] ------------------ 645| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 1}, "ClassicMcEliece_348864"); 646| 1| case 0xA244C: ------------------ | Branch (646:7): [True: 1, False: 9.20k] ------------------ 647| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 2}, "ClassicMcEliece_348864f"); 648| 1| case 0xA244D: ------------------ | Branch (648:7): [True: 1, False: 9.20k] ------------------ 649| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 3}, "ClassicMcEliece_460896"); 650| 1| case 0xA244E: ------------------ | Branch (650:7): [True: 1, False: 9.20k] ------------------ 651| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 4}, "ClassicMcEliece_460896f"); 652| 1| case 0xA244F: ------------------ | Branch (652:7): [True: 1, False: 9.20k] ------------------ 653| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 5}, "ClassicMcEliece_6688128"); 654| 1| case 0xA2450: ------------------ | Branch (654:7): [True: 1, False: 9.20k] ------------------ 655| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 6}, "ClassicMcEliece_6688128f"); 656| 1| case 0xA2451: ------------------ | Branch (656:7): [True: 1, False: 9.20k] ------------------ 657| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 7}, "ClassicMcEliece_6960119"); 658| 1| case 0xA2452: ------------------ | Branch (658:7): [True: 1, False: 9.20k] ------------------ 659| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 8}, "ClassicMcEliece_6960119f"); 660| 2| case 0xA2453: ------------------ | Branch (660:7): [True: 2, False: 9.20k] ------------------ 661| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 9}, "ClassicMcEliece_8192128"); 662| 1| case 0xA2454: ------------------ | Branch (662:7): [True: 1, False: 9.20k] ------------------ 663| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 10}, "ClassicMcEliece_8192128f"); 664| 413| case 0xAF989: ------------------ | Branch (664:7): [True: 413, False: 8.79k] ------------------ 665| 413| return if_match(oid, {1, 2, 840, 113549, 1, 1, 1}, "RSA"); 666| 19| case 0xAF98A: ------------------ | Branch (666:7): [True: 19, False: 9.18k] ------------------ 667| 19| return if_match(oid, {1, 2, 840, 113549, 1, 1, 2}, "RSA/PKCS1v15(MD2)"); 668| 5| case 0xAF98C: ------------------ | Branch (668:7): [True: 5, False: 9.20k] ------------------ 669| 5| return if_match(oid, {1, 2, 840, 113549, 1, 1, 4}, "RSA/PKCS1v15(MD5)"); 670| 884| case 0xAF98D: ------------------ | Branch (670:7): [True: 884, False: 8.32k] ------------------ 671| 884| return if_match(oid, {1, 2, 840, 113549, 1, 1, 5}, "RSA/PKCS1v15(SHA-1)"); 672| 7| case 0xAF98F: ------------------ | Branch (672:7): [True: 7, False: 9.20k] ------------------ 673| 7| return if_match(oid, {1, 2, 840, 113549, 1, 1, 7}, "RSA/OAEP"); 674| 13| case 0xAF990: ------------------ | Branch (674:7): [True: 13, False: 9.19k] ------------------ 675| 13| return if_match(oid, {1, 2, 840, 113549, 1, 1, 8}, "MGF1"); 676| 51| case 0xAF992: ------------------ | Branch (676:7): [True: 51, False: 9.15k] ------------------ 677| 51| return if_match(oid, {1, 2, 840, 113549, 1, 1, 10}, "RSA/PSS"); 678| 277| case 0xAF993: ------------------ | Branch (678:7): [True: 277, False: 8.93k] ------------------ 679| 277| return if_match(oid, {1, 2, 840, 113549, 1, 1, 11}, "RSA/PKCS1v15(SHA-256)"); 680| 36| case 0xAF994: ------------------ | Branch (680:7): [True: 36, False: 9.17k] ------------------ 681| 36| return if_match(oid, {1, 2, 840, 113549, 1, 1, 12}, "RSA/PKCS1v15(SHA-384)"); 682| 547| case 0xAF995: ------------------ | Branch (682:7): [True: 547, False: 8.66k] ------------------ 683| 547| return if_match(oid, {1, 2, 840, 113549, 1, 1, 13}, "RSA/PKCS1v15(SHA-512)"); 684| 505| case 0xAF996: ------------------ | Branch (684:7): [True: 505, False: 8.70k] ------------------ 685| 505| return if_match(oid, {1, 2, 840, 113549, 1, 1, 14}, "RSA/PKCS1v15(SHA-224)"); 686| 6| case 0xAF998: ------------------ | Branch (686:7): [True: 6, False: 9.20k] ------------------ 687| 6| return if_match(oid, {1, 2, 840, 113549, 1, 1, 16}, "RSA/PKCS1v15(SHA-512-256)"); 688| 2| case 0xAFC98: ------------------ | Branch (688:7): [True: 2, False: 9.20k] ------------------ 689| 2| return if_match(oid, {1, 2, 840, 113549, 1, 5, 12}, "PKCS5.PBKDF2"); 690| 2| case 0xAFC99: ------------------ | Branch (690:7): [True: 2, False: 9.20k] ------------------ 691| 2| return if_match(oid, {1, 2, 840, 113549, 1, 5, 13}, "PBE-PKCS5v20"); 692| 2| case 0xAFE0F: ------------------ | Branch (692:7): [True: 2, False: 9.20k] ------------------ 693| 2| return if_match(oid, {1, 2, 840, 113549, 1, 7, 1}, "PKCS7.Data"); 694| 2| case 0xAFE14: ------------------ | Branch (694:7): [True: 2, False: 9.20k] ------------------ 695| 2| return if_match(oid, {1, 2, 840, 113549, 1, 7, 6}, "PKCS7.EncryptedData"); 696| 2| case 0xAFF91: ------------------ | Branch (696:7): [True: 2, False: 9.20k] ------------------ 697| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 1}, "PKCS9.EmailAddress"); 698| 2| case 0xAFF92: ------------------ | Branch (698:7): [True: 2, False: 9.20k] ------------------ 699| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 2}, "PKCS9.UnstructuredName"); 700| 2| case 0xAFF93: ------------------ | Branch (700:7): [True: 2, False: 9.20k] ------------------ 701| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 3}, "PKCS9.ContentType"); 702| 2| case 0xAFF94: ------------------ | Branch (702:7): [True: 2, False: 9.20k] ------------------ 703| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 4}, "PKCS9.MessageDigest"); 704| 2| case 0xAFF97: ------------------ | Branch (704:7): [True: 2, False: 9.20k] ------------------ 705| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 7}, "PKCS9.ChallengePassword"); 706| 2| case 0xAFF9E: ------------------ | Branch (706:7): [True: 2, False: 9.20k] ------------------ 707| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 14}, "PKCS9.ExtensionRequest"); 708| 2| case 0xAFFA4: ------------------ | Branch (708:7): [True: 2, False: 9.20k] ------------------ 709| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 20}, "PKCS9.FriendlyName"); 710| 2| case 0xAFFA5: ------------------ | Branch (710:7): [True: 2, False: 9.20k] ------------------ 711| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 21}, "PKCS9.LocalKeyId"); 712| 1| case 0xC0226: ------------------ | Branch (712:7): [True: 1, False: 9.20k] ------------------ 713| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 11591, 4, 11}, "Scrypt"); 714| 1| case 0xC0A67: ------------------ | Branch (714:7): [True: 1, False: 9.20k] ------------------ 715| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 11591, 15, 1}, "OpenPGP.Ed25519"); 716| 1| case 0xC4CE5: ------------------ | Branch (716:7): [True: 1, False: 9.20k] ------------------ 717| 1| return if_match(oid, {1, 2, 643, 100, 1}, "GOST.OGRN"); 718| 1| case 0xC4D53: ------------------ | Branch (718:7): [True: 1, False: 9.20k] ------------------ 719| 1| return if_match(oid, {1, 2, 643, 100, 111}, "GOST.SubjectSigningTool"); 720| 1| case 0xC4D54: ------------------ | Branch (720:7): [True: 1, False: 9.20k] ------------------ 721| 1| return if_match(oid, {1, 2, 643, 100, 112}, "GOST.IssuerSigningTool"); 722| 1| case 0xC9C50: ------------------ | Branch (722:7): [True: 1, False: 9.20k] ------------------ 723| 1| return if_match(oid, {1, 2, 840, 10045, 3, 1, 1}, "secp192r1"); 724| 1| case 0xC9C51: ------------------ | Branch (724:7): [True: 1, False: 9.20k] ------------------ 725| 1| return if_match(oid, {1, 2, 840, 10045, 3, 1, 2}, "x962_p192v2"); 726| 1| case 0xC9C52: ------------------ | Branch (726:7): [True: 1, False: 9.20k] ------------------ 727| 1| return if_match(oid, {1, 2, 840, 10045, 3, 1, 3}, "x962_p192v3"); 728| 1| case 0xC9C53: ------------------ | Branch (728:7): [True: 1, False: 9.20k] ------------------ 729| 1| return if_match(oid, {1, 2, 840, 10045, 3, 1, 4}, "x962_p239v1"); 730| 1| case 0xC9C54: ------------------ | Branch (730:7): [True: 1, False: 9.20k] ------------------ 731| 1| return if_match(oid, {1, 2, 840, 10045, 3, 1, 5}, "x962_p239v2"); 732| 1| case 0xC9C55: ------------------ | Branch (732:7): [True: 1, False: 9.20k] ------------------ 733| 1| return if_match(oid, {1, 2, 840, 10045, 3, 1, 6}, "x962_p239v3"); 734| 1| case 0xC9C56: ------------------ | Branch (734:7): [True: 1, False: 9.20k] ------------------ 735| 1| return if_match(oid, {1, 2, 840, 10045, 3, 1, 7}, "secp256r1"); 736| 85| case 0xCFA13: ------------------ | Branch (736:7): [True: 85, False: 9.12k] ------------------ 737| 85| return if_match(oid, {1, 2, 840, 10040, 4, 1}, "DSA"); 738| 436| case 0xCFA15: ------------------ | Branch (738:7): [True: 436, False: 8.77k] ------------------ 739| 436| return if_match(oid, {1, 2, 840, 10040, 4, 3}, "DSA/SHA-1"); 740| 1.01k| default: ------------------ | Branch (740:7): [True: 1.01k, False: 8.19k] ------------------ 741| 1.01k| return {}; 742| 9.20k| } 743| 9.20k|} _ZN5Botan7OID_Map22lookup_static_oid_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 746| 23.2k|std::optional OID_Map::lookup_static_oid_name(std::string_view req) { 747| 23.2k| const uint32_t hc = hash_oid_name(req); 748| | 749| 23.2k| switch(hc) { 750| 0| case 0x00545: ------------------ | Branch (750:7): [True: 0, False: 23.2k] ------------------ 751| 0| return if_match(req, "Twofish/GCM", {1, 3, 6, 1, 4, 1, 25258, 3, 102}); 752| 0| case 0x00CF3: ------------------ | Branch (752:7): [True: 0, False: 23.2k] ------------------ 753| 0| return if_match(req, "SphincsPlus-sha2-192f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 4}); 754| 0| case 0x015FE: ------------------ | Branch (754:7): [True: 0, False: 23.2k] ------------------ 755| 0| return if_match(req, "FrodoKEM-640-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 14, 1}); 756| 0| case 0x01F9E: ------------------ | Branch (756:7): [True: 0, False: 23.2k] ------------------ 757| 0| return if_match(req, "MD5", {1, 2, 840, 113549, 2, 5}); 758| 0| case 0x02293: ------------------ | Branch (758:7): [True: 0, False: 23.2k] ------------------ 759| 0| return if_match(req, "SphincsPlus-shake-192f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 4}); 760| 0| case 0x02B93: ------------------ | Branch (760:7): [True: 0, False: 23.2k] ------------------ 761| 0| return if_match(req, "Microsoft SmartcardLogon", {1, 3, 6, 1, 4, 1, 311, 20, 2, 2}); 762| 0| case 0x041D5: ------------------ | Branch (762:7): [True: 0, False: 23.2k] ------------------ 763| 0| return if_match(req, "secp160k1", {1, 3, 132, 0, 9}); 764| 0| case 0x044B3: ------------------ | Branch (764:7): [True: 0, False: 23.2k] ------------------ 765| 0| return if_match(req, "Camellia-256/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 8}); 766| 0| case 0x048B2: ------------------ | Branch (766:7): [True: 0, False: 23.2k] ------------------ 767| 0| return if_match(req, "secp160r1", {1, 3, 132, 0, 8}); 768| 0| case 0x048B3: ------------------ | Branch (768:7): [True: 0, False: 23.2k] ------------------ 769| 0| return if_match(req, "secp160r2", {1, 3, 132, 0, 30}); 770| 0| case 0x05CDA: ------------------ | Branch (770:7): [True: 0, False: 23.2k] ------------------ 771| 0| return if_match(req, "X520.Country", {2, 5, 4, 6}); 772| 87| case 0x07783: ------------------ | Branch (772:7): [True: 87, False: 23.1k] ------------------ 773| 87| return if_match(req, "PKIX.ServerAuth", {1, 3, 6, 1, 5, 5, 7, 3, 1}); 774| 0| case 0x086C7: ------------------ | Branch (774:7): [True: 0, False: 23.2k] ------------------ 775| 0| return if_match(req, "numsp384d1", {1, 3, 6, 1, 4, 1, 25258, 4, 2}); 776| 0| case 0x08A92: ------------------ | Branch (776:7): [True: 0, False: 23.2k] ------------------ 777| 0| return if_match(req, "RSA/PKCS1v15(SHA-1)", {1, 2, 840, 113549, 1, 1, 5}); 778| 0| case 0x09EA0: ------------------ | Branch (778:7): [True: 0, False: 23.2k] ------------------ 779| 0| return if_match(req, "DES/CBC", {1, 3, 14, 3, 2, 7}); 780| 0| case 0x0B2D6: ------------------ | Branch (780:7): [True: 0, False: 23.2k] ------------------ 781| 0| return if_match(req, "ECDSA/SHA-3(512)", {2, 16, 840, 1, 101, 3, 4, 3, 12}); 782| 0| case 0x0BA72: ------------------ | Branch (782:7): [True: 0, False: 23.2k] ------------------ 783| 0| return if_match(req, "SphincsPlus-sha2-128s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 1}); 784| 0| case 0x0BE23: ------------------ | Branch (784:7): [True: 0, False: 23.2k] ------------------ 785| 0| return if_match(req, "ECGDSA", {1, 3, 36, 3, 3, 2, 5, 2, 1}); 786| 0| case 0x0C109: ------------------ | Branch (786:7): [True: 0, False: 23.2k] ------------------ 787| 0| return if_match(req, "PKCS9.FriendlyName", {1, 2, 840, 113549, 1, 9, 20}); 788| 0| case 0x0D012: ------------------ | Branch (788:7): [True: 0, False: 23.2k] ------------------ 789| 0| return if_match(req, "SphincsPlus-shake-128s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 1}); 790| 0| case 0x0DCE9: ------------------ | Branch (790:7): [True: 0, False: 23.2k] ------------------ 791| 0| return if_match(req, "ClassicMcEliece_8192128f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 10}); 792| 0| case 0x0E52A: ------------------ | Branch (792:7): [True: 0, False: 23.2k] ------------------ 793| 0| return if_match(req, "numsp512d1", {1, 3, 6, 1, 4, 1, 25258, 4, 3}); 794| 0| case 0x0F9CC: ------------------ | Branch (794:7): [True: 0, False: 23.2k] ------------------ 795| 0| return if_match(req, "PKCS9.UnstructuredName", {1, 2, 840, 113549, 1, 9, 2}); 796| 0| case 0x0FF45: ------------------ | Branch (796:7): [True: 0, False: 23.2k] ------------------ 797| 0| return if_match(req, "Camellia-256/GCM", {0, 3, 4401, 5, 3, 1, 9, 46}); 798| 0| case 0x1033D: ------------------ | Branch (798:7): [True: 0, False: 23.2k] ------------------ 799| 0| return if_match(req, "DSA/SHA-3(384)", {2, 16, 840, 1, 101, 3, 4, 3, 7}); 800| 0| case 0x1139D: ------------------ | Branch (800:7): [True: 0, False: 23.2k] ------------------ 801| 0| return if_match(req, "secp192k1", {1, 3, 132, 0, 31}); 802| 0| case 0x113D6: ------------------ | Branch (802:7): [True: 0, False: 23.2k] ------------------ 803| 0| return if_match(req, "X520.DNQualifier", {2, 5, 4, 46}); 804| 0| case 0x11A7A: ------------------ | Branch (804:7): [True: 0, False: 23.2k] ------------------ 805| 0| return if_match(req, "secp192r1", {1, 2, 840, 10045, 3, 1, 1}); 806| 0| case 0x12096: ------------------ | Branch (806:7): [True: 0, False: 23.2k] ------------------ 807| 0| return if_match(req, "SM2_Kex", {1, 2, 156, 10197, 1, 301, 2}); 808| 0| case 0x13FC1: ------------------ | Branch (808:7): [True: 0, False: 23.2k] ------------------ 809| 0| return if_match(req, "X520.GenerationalQualifier", {2, 5, 4, 44}); 810| 0| case 0x1445B: ------------------ | Branch (810:7): [True: 0, False: 23.2k] ------------------ 811| 0| return if_match(req, "PKCS5.PBKDF2", {1, 2, 840, 113549, 1, 5, 12}); 812| 0| case 0x1495D: ------------------ | Branch (812:7): [True: 0, False: 23.2k] ------------------ 813| 0| return if_match(req, "eFrodoKEM-1344-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 17, 3}); 814| 0| case 0x14E30: ------------------ | Branch (814:7): [True: 0, False: 23.2k] ------------------ 815| 0| return if_match(req, "ClassicMcEliece_460896", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 3}); 816| 0| case 0x14FB1: ------------------ | Branch (816:7): [True: 0, False: 23.2k] ------------------ 817| 0| return if_match(req, "XMSS-draft12", {1, 3, 6, 1, 4, 1, 25258, 1, 8}); 818| 0| case 0x156E3: ------------------ | Branch (818:7): [True: 0, False: 23.2k] ------------------ 819| 0| return if_match(req, "Compression.Zlib", {1, 2, 840, 113549, 1, 9, 16, 3, 8}); 820| 4| case 0x1579E: ------------------ | Branch (820:7): [True: 4, False: 23.2k] ------------------ 821| 4| return if_match(req, "Streebog-512", {1, 2, 643, 7, 1, 1, 2, 3}); 822| 87| case 0x1701A: ------------------ | Branch (822:7): [True: 87, False: 23.1k] ------------------ 823| 87| return if_match(req, "X509v3.AnyExtendedKeyUsage", {2, 5, 29, 37, 0}); 824| 0| case 0x175EF: ------------------ | Branch (824:7): [True: 0, False: 23.2k] ------------------ 825| 0| return if_match(req, "Kyber-1024-90s-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 11, 3}); 826| 0| case 0x17709: ------------------ | Branch (826:7): [True: 0, False: 23.2k] ------------------ 827| 0| return if_match(req, "X520.GivenName", {2, 5, 4, 42}); 828| 0| case 0x17AD9: ------------------ | Branch (828:7): [True: 0, False: 23.2k] ------------------ 829| 0| return if_match(req, "RSA/PKCS1v15(SM3)", {1, 2, 156, 10197, 1, 504}); 830| 0| case 0x17CE2: ------------------ | Branch (830:7): [True: 0, False: 23.2k] ------------------ 831| 0| return if_match(req, "SLH-DSA-SHA2-256f", {2, 16, 840, 1, 101, 3, 4, 3, 25}); 832| 0| case 0x17CEF: ------------------ | Branch (832:7): [True: 0, False: 23.2k] ------------------ 833| 0| return if_match(req, "SLH-DSA-SHA2-256s", {2, 16, 840, 1, 101, 3, 4, 3, 24}); 834| 0| case 0x18618: ------------------ | Branch (834:7): [True: 0, False: 23.2k] ------------------ 835| 0| return if_match(req, "FrodoKEM-976-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 15, 2}); 836| 0| case 0x19480: ------------------ | Branch (836:7): [True: 0, False: 23.2k] ------------------ 837| 0| return if_match(req, "eFrodoKEM-1344-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 16, 3}); 838| 0| case 0x1958A: ------------------ | Branch (838:7): [True: 0, False: 23.2k] ------------------ 839| 0| return if_match(req, "X509v3.InvalidityDate", {2, 5, 29, 24}); 840| 0| case 0x19851: ------------------ | Branch (840:7): [True: 0, False: 23.2k] ------------------ 841| 0| return if_match(req, "DSA/SHA-1", {1, 2, 840, 10040, 4, 3}); 842| 0| case 0x1B2E7: ------------------ | Branch (842:7): [True: 0, False: 23.2k] ------------------ 843| 0| return if_match(req, "KeyWrap.AES-128", {2, 16, 840, 1, 101, 3, 4, 1, 5}); 844| 0| case 0x1B9BE: ------------------ | Branch (844:7): [True: 0, False: 23.2k] ------------------ 845| 0| return if_match(req, "KeyWrap.AES-192", {2, 16, 840, 1, 101, 3, 4, 1, 25}); 846| 0| case 0x1D439: ------------------ | Branch (846:7): [True: 0, False: 23.2k] ------------------ 847| 0| return if_match(req, "SphincsPlus-haraka-192f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 4}); 848| 0| case 0x2065B: ------------------ | Branch (848:7): [True: 0, False: 23.2k] ------------------ 849| 0| return if_match(req, "KeyWrap.CAST-128", {1, 2, 840, 113533, 7, 66, 15}); 850| 0| case 0x216A0: ------------------ | Branch (850:7): [True: 0, False: 23.2k] ------------------ 851| 0| return if_match(req, "ML-KEM-512", {2, 16, 840, 1, 101, 3, 4, 4, 1}); 852| 651| case 0x2216B: ------------------ | Branch (852:7): [True: 651, False: 22.6k] ------------------ 853| 651| return if_match(req, "GOST-34.10-2012-512", {1, 2, 643, 7, 1, 1, 1, 2}); 854| 0| case 0x22C2C: ------------------ | Branch (854:7): [True: 0, False: 23.2k] ------------------ 855| 0| return if_match(req, "ElGamal", {1, 3, 6, 1, 4, 1, 3029, 1, 2, 1}); 856| 0| case 0x2559A: ------------------ | Branch (856:7): [True: 0, False: 23.2k] ------------------ 857| 0| return if_match(req, "X520.Initials", {2, 5, 4, 43}); 858| 0| case 0x271AC: ------------------ | Branch (858:7): [True: 0, False: 23.2k] ------------------ 859| 0| return if_match(req, "PKIX.AutonomousSysIds", {1, 3, 6, 1, 5, 5, 7, 1, 8}); 860| 0| case 0x2808B: ------------------ | Branch (860:7): [True: 0, False: 23.2k] ------------------ 861| 0| return if_match(req, "PKCS7.Data", {1, 2, 840, 113549, 1, 7, 1}); 862| 0| case 0x281B8: ------------------ | Branch (862:7): [True: 0, False: 23.2k] ------------------ 863| 0| return if_match(req, "SphincsPlus-haraka-128s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 1}); 864| 0| case 0x282FE: ------------------ | Branch (864:7): [True: 0, False: 23.2k] ------------------ 865| 0| return if_match(req, "PKIX.OCSP.Nonce", {1, 3, 6, 1, 5, 5, 7, 48, 1, 2}); 866| 0| case 0x29999: ------------------ | Branch (866:7): [True: 0, False: 23.2k] ------------------ 867| 0| return if_match(req, "DSA/SHA-3(256)", {2, 16, 840, 1, 101, 3, 4, 3, 6}); 868| 0| case 0x2A83D: ------------------ | Branch (868:7): [True: 0, False: 23.2k] ------------------ 869| 0| return if_match(req, "SHA-224", {2, 16, 840, 1, 101, 3, 4, 2, 4}); 870| 0| case 0x2AB30: ------------------ | Branch (870:7): [True: 0, False: 23.2k] ------------------ 871| 0| return if_match(req, "SHA-256", {2, 16, 840, 1, 101, 3, 4, 2, 1}); 872| 0| case 0x2ABEF: ------------------ | Branch (872:7): [True: 0, False: 23.2k] ------------------ 873| 0| return if_match(req, "KeyWrap.AES-256", {2, 16, 840, 1, 101, 3, 4, 1, 45}); 874| 0| case 0x2BAEF: ------------------ | Branch (874:7): [True: 0, False: 23.2k] ------------------ 875| 0| return if_match(req, "SM2_Sig/SM3", {1, 2, 156, 10197, 1, 501}); 876| 0| case 0x2C39A: ------------------ | Branch (876:7): [True: 0, False: 23.2k] ------------------ 877| 0| return if_match(req, "ECGDSA/RIPEMD-160", {1, 3, 36, 3, 3, 2, 5, 4, 1}); 878| 0| case 0x2C54F: ------------------ | Branch (878:7): [True: 0, False: 23.2k] ------------------ 879| 0| return if_match(req, "ECDSA/SHA-3(224)", {2, 16, 840, 1, 101, 3, 4, 3, 9}); 880| 0| case 0x2EEA6: ------------------ | Branch (880:7): [True: 0, False: 23.2k] ------------------ 881| 0| return if_match(req, "RSA/PKCS1v15(RIPEMD-160)", {1, 3, 36, 3, 3, 1, 2}); 882| 0| case 0x2EFBA: ------------------ | Branch (882:7): [True: 0, False: 23.2k] ------------------ 883| 0| return if_match(req, "Kyber-512-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 7, 1}); 884| 0| case 0x2F0AD: ------------------ | Branch (884:7): [True: 0, False: 23.2k] ------------------ 885| 0| return if_match(req, "PKCS7.EncryptedData", {1, 2, 840, 113549, 1, 7, 6}); 886| 0| case 0x2F219: ------------------ | Branch (886:7): [True: 0, False: 23.2k] ------------------ 887| 0| return if_match(req, "PBE-SHA1-2DES", {1, 2, 840, 113549, 1, 12, 1, 4}); 888| 0| case 0x3133E: ------------------ | Branch (888:7): [True: 0, False: 23.2k] ------------------ 889| 0| return if_match(req, "SLH-DSA-SHA2-128f", {2, 16, 840, 1, 101, 3, 4, 3, 21}); 890| 0| case 0x3134B: ------------------ | Branch (890:7): [True: 0, False: 23.2k] ------------------ 891| 0| return if_match(req, "SLH-DSA-SHA2-128s", {2, 16, 840, 1, 101, 3, 4, 3, 20}); 892| 0| case 0x3160D: ------------------ | Branch (892:7): [True: 0, False: 23.2k] ------------------ 893| 0| return if_match(req, "RSA/PKCS1v15(SHA-3(224))", {2, 16, 840, 1, 101, 3, 4, 3, 13}); 894| 0| case 0x319E0: ------------------ | Branch (894:7): [True: 0, False: 23.2k] ------------------ 895| 0| return if_match(req, "GOST-34.10-2012-256/Streebog-256", {1, 2, 643, 7, 1, 1, 3, 2}); 896| 0| case 0x31B3D: ------------------ | Branch (896:7): [True: 0, False: 23.2k] ------------------ 897| 0| return if_match(req, "HMAC(SHA-512)", {1, 2, 840, 113549, 2, 11}); 898| 0| case 0x31C6D: ------------------ | Branch (898:7): [True: 0, False: 23.2k] ------------------ 899| 0| return if_match(req, "secp384r1", {1, 3, 132, 0, 34}); 900| 0| case 0x32899: ------------------ | Branch (900:7): [True: 0, False: 23.2k] ------------------ 901| 0| return if_match(req, "TripleDES/CBC", {1, 2, 840, 113549, 3, 7}); 902| 7.69k| case 0x33C9C: ------------------ | Branch (902:7): [True: 7.69k, False: 15.5k] ------------------ 903| 7.69k| return if_match(req, "PKIX.SmtpUTF8Mailbox", {1, 3, 6, 1, 5, 5, 7, 8, 9}); 904| 0| case 0x33D04: ------------------ | Branch (904:7): [True: 0, False: 23.2k] ------------------ 905| 0| return if_match(req, "PKCS12.SecretBag", {1, 2, 840, 113549, 1, 12, 10, 1, 5}); 906| 0| case 0x3615D: ------------------ | Branch (906:7): [True: 0, False: 23.2k] ------------------ 907| 0| return if_match(req, "FrodoKEM-976-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 14, 2}); 908| 0| case 0x361B8: ------------------ | Branch (908:7): [True: 0, False: 23.2k] ------------------ 909| 0| return if_match(req, "Ed25519", {1, 3, 101, 112}); 910| 0| case 0x3649D: ------------------ | Branch (910:7): [True: 0, False: 23.2k] ------------------ 911| 0| return if_match(req, "SHAKE-128", {2, 16, 840, 1, 101, 3, 4, 2, 11}); 912| 0| case 0x36693: ------------------ | Branch (912:7): [True: 0, False: 23.2k] ------------------ 913| 0| return if_match(req, "ClassicMcEliece_348864", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 1}); 914| 0| case 0x373C7: ------------------ | Branch (914:7): [True: 0, False: 23.2k] ------------------ 915| 0| return if_match(req, "ML-DSA-4x4", {2, 16, 840, 1, 101, 3, 4, 3, 17}); 916| 0| case 0x3750B: ------------------ | Branch (916:7): [True: 0, False: 23.2k] ------------------ 917| 0| return if_match(req, "ClassicMcEliece_8192128", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 9}); 918| 0| case 0x39890: ------------------ | Branch (918:7): [True: 0, False: 23.2k] ------------------ 919| 0| return if_match(req, "Ed448", {1, 3, 101, 113}); 920| 0| case 0x3A438: ------------------ | Branch (920:7): [True: 0, False: 23.2k] ------------------ 921| 0| return if_match(req, "SHA-384", {2, 16, 840, 1, 101, 3, 4, 2, 2}); 922| 0| case 0x3A963: ------------------ | Branch (922:7): [True: 0, False: 23.2k] ------------------ 923| 0| return if_match(req, "DH", {1, 2, 840, 10046, 2, 1}); 924| 15| case 0x3AC83: ------------------ | Branch (924:7): [True: 15, False: 23.2k] ------------------ 925| 15| return if_match(req, "MGF1", {1, 2, 840, 113549, 1, 1, 8}); 926| 0| case 0x3ACBA: ------------------ | Branch (926:7): [True: 0, False: 23.2k] ------------------ 927| 0| return if_match(req, "X509v3.IssuerAlternativeName", {2, 5, 29, 18}); 928| 0| case 0x3B273: ------------------ | Branch (928:7): [True: 0, False: 23.2k] ------------------ 929| 0| return if_match(req, "KeyWrap.TripleDES", {1, 2, 840, 113549, 1, 9, 16, 3, 6}); 930| 0| case 0x3B91E: ------------------ | Branch (930:7): [True: 0, False: 23.2k] ------------------ 931| 0| return if_match(req, "X509v3.PrivateKeyUsagePeriod", {2, 5, 29, 16}); 932| 0| case 0x3BC8A: ------------------ | Branch (932:7): [True: 0, False: 23.2k] ------------------ 933| 0| return if_match(req, "SLH-DSA-SHAKE-192f", {2, 16, 840, 1, 101, 3, 4, 3, 29}); 934| 0| case 0x3BC97: ------------------ | Branch (934:7): [True: 0, False: 23.2k] ------------------ 935| 0| return if_match(req, "SLH-DSA-SHAKE-192s", {2, 16, 840, 1, 101, 3, 4, 3, 28}); 936| 0| case 0x3D127: ------------------ | Branch (936:7): [True: 0, False: 23.2k] ------------------ 937| 0| return if_match(req, "DSA", {1, 2, 840, 10040, 4, 1}); 938| 0| case 0x3E249: ------------------ | Branch (938:7): [True: 0, False: 23.2k] ------------------ 939| 0| return if_match(req, "HSS-LMS", {1, 2, 840, 113549, 1, 9, 16, 3, 17}); 940| 0| case 0x3E7D5: ------------------ | Branch (940:7): [True: 0, False: 23.2k] ------------------ 941| 0| return if_match(req, "RSA/PKCS1v15(SHA-3(256))", {2, 16, 840, 1, 101, 3, 4, 3, 14}); 942| 0| case 0x3F748: ------------------ | Branch (942:7): [True: 0, False: 23.2k] ------------------ 943| 0| return if_match(req, "GOST.OGRN", {1, 2, 643, 100, 1}); 944| 0| case 0x3F99F: ------------------ | Branch (944:7): [True: 0, False: 23.2k] ------------------ 945| 0| return if_match(req, "X509v3.BasicConstraints", {2, 5, 29, 19}); 946| 0| case 0x40726: ------------------ | Branch (946:7): [True: 0, False: 23.2k] ------------------ 947| 0| return if_match(req, "SHA-3(512)", {2, 16, 840, 1, 101, 3, 4, 2, 10}); 948| 0| case 0x407BF: ------------------ | Branch (948:7): [True: 0, False: 23.2k] ------------------ 949| 0| return if_match(req, "ML-KEM-768", {2, 16, 840, 1, 101, 3, 4, 4, 2}); 950| 0| case 0x41334: ------------------ | Branch (950:7): [True: 0, False: 23.2k] ------------------ 951| 0| return if_match(req, "ECDSA/SHA-3(384)", {2, 16, 840, 1, 101, 3, 4, 3, 11}); 952| 0| case 0x42DF3: ------------------ | Branch (952:7): [True: 0, False: 23.2k] ------------------ 953| 0| return if_match(req, "X509v3.CRLDistributionPoints", {2, 5, 29, 31}); 954| 0| case 0x437FB: ------------------ | Branch (954:7): [True: 0, False: 23.2k] ------------------ 955| 0| return if_match(req, "brainpool160r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 1}); 956| 0| case 0x441F5: ------------------ | Branch (956:7): [True: 0, False: 23.2k] ------------------ 957| 0| return if_match(req, "gost_256A", {1, 2, 643, 7, 1, 2, 1, 1, 1}); 958| 0| case 0x441F6: ------------------ | Branch (958:7): [True: 0, False: 23.2k] ------------------ 959| 0| return if_match(req, "gost_256B", {1, 2, 643, 7, 1, 2, 1, 1, 2}); 960| 0| case 0x44221: ------------------ | Branch (960:7): [True: 0, False: 23.2k] ------------------ 961| 0| return if_match(req, "GOST-34.10-2012-512/Streebog-512", {1, 2, 643, 7, 1, 1, 3, 3}); 962| 0| case 0x44322: ------------------ | Branch (962:7): [True: 0, False: 23.2k] ------------------ 963| 0| return if_match(req, "ClassicMcEliece_6960119pc", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 3}); 964| 0| case 0x44973: ------------------ | Branch (964:7): [True: 0, False: 23.2k] ------------------ 965| 0| return if_match(req, "Kyber-512-90s-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 11, 1}); 966| 0| case 0x45C27: ------------------ | Branch (966:7): [True: 0, False: 23.2k] ------------------ 967| 0| return if_match(req, "RSA/PKCS1v15(SHA-512-256)", {1, 2, 840, 113549, 1, 1, 16}); 968| 0| case 0x45C85: ------------------ | Branch (968:7): [True: 0, False: 23.2k] ------------------ 969| 0| return if_match(req, "X509v3.ReasonCode", {2, 5, 29, 21}); 970| 0| case 0x45DA5: ------------------ | Branch (970:7): [True: 0, False: 23.2k] ------------------ 971| 0| return if_match(req, "SHAKE-256", {2, 16, 840, 1, 101, 3, 4, 2, 12}); 972| 0| case 0x4663C: ------------------ | Branch (972:7): [True: 0, False: 23.2k] ------------------ 973| 0| return if_match(req, "X509v3.PolicyConstraints", {2, 5, 29, 36}); 974| 0| case 0x480F7: ------------------ | Branch (974:7): [True: 0, False: 23.2k] ------------------ 975| 0| return if_match(req, "Serpent/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 4}); 976| 0| case 0x48627: ------------------ | Branch (976:7): [True: 0, False: 23.2k] ------------------ 977| 0| return if_match(req, "Dilithium-4x4-AES-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 10, 1}); 978| 0| case 0x48861: ------------------ | Branch (978:7): [True: 0, False: 23.2k] ------------------ 979| 0| return if_match(req, "ChaCha20Poly1305", {1, 2, 840, 113549, 1, 9, 16, 3, 18}); 980| 0| case 0x4A292: ------------------ | Branch (980:7): [True: 0, False: 23.2k] ------------------ 981| 0| return if_match(req, "frp256v1", {1, 2, 250, 1, 223, 101, 256, 1}); 982| 0| case 0x4A9EE: ------------------ | Branch (982:7): [True: 0, False: 23.2k] ------------------ 983| 0| return if_match(req, "ClassicMcEliece_6960119f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 8}); 984| 0| case 0x4BF87: ------------------ | Branch (984:7): [True: 0, False: 23.2k] ------------------ 985| 0| return if_match(req, "PKIX.TNAuthList", {1, 3, 6, 1, 5, 5, 7, 1, 26}); 986| 0| case 0x4C088: ------------------ | Branch (986:7): [True: 0, False: 23.2k] ------------------ 987| 0| return if_match(req, "eFrodoKEM-976-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 17, 2}); 988| 0| case 0x4C513: ------------------ | Branch (988:7): [True: 0, False: 23.2k] ------------------ 989| 0| return if_match(req, "DSA/SHA-224", {2, 16, 840, 1, 101, 3, 4, 3, 1}); 990| 0| case 0x4C806: ------------------ | Branch (990:7): [True: 0, False: 23.2k] ------------------ 991| 0| return if_match(req, "DSA/SHA-256", {2, 16, 840, 1, 101, 3, 4, 3, 2}); 992| 0| case 0x4D740: ------------------ | Branch (992:7): [True: 0, False: 23.2k] ------------------ 993| 0| return if_match(req, "X509v3.AnyPolicy", {2, 5, 29, 32, 0}); 994| 0| case 0x4DE49: ------------------ | Branch (994:7): [True: 0, False: 23.2k] ------------------ 995| 0| return if_match(req, "RSA/PKCS1v15(SHA-512)", {1, 2, 840, 113549, 1, 1, 13}); 996| 0| case 0x4ED5D: ------------------ | Branch (996:7): [True: 0, False: 23.2k] ------------------ 997| 0| return if_match(req, "CAST-128/CBC", {1, 2, 840, 113533, 7, 66, 10}); 998| 0| case 0x4FCDC: ------------------ | Branch (998:7): [True: 0, False: 23.2k] ------------------ 999| 0| return if_match(req, "RSA", {1, 2, 840, 113549, 1, 1, 1}); 1000| 0| case 0x501CB: ------------------ | Branch (1000:7): [True: 0, False: 23.2k] ------------------ 1001| 0| return if_match(req, "ECDSA/SHA-224", {1, 2, 840, 10045, 4, 3, 1}); 1002| 0| case 0x50395: ------------------ | Branch (1002:7): [True: 0, False: 23.2k] ------------------ 1003| 0| return if_match(req, "GOST-34.10/GOST-R-34.11-94", {1, 2, 643, 2, 2, 3}); 1004| 0| case 0x504BE: ------------------ | Branch (1004:7): [True: 0, False: 23.2k] ------------------ 1005| 0| return if_match(req, "ECDSA/SHA-256", {1, 2, 840, 10045, 4, 3, 2}); 1006| 0| case 0x509C3: ------------------ | Branch (1006:7): [True: 0, False: 23.2k] ------------------ 1007| 0| return if_match(req, "brainpool192r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 3}); 1008| 0| case 0x509F9: ------------------ | Branch (1008:7): [True: 0, False: 23.2k] ------------------ 1009| 0| return if_match(req, "PKCS9.ContentType", {1, 2, 840, 113549, 1, 9, 3}); 1010| 0| case 0x50B26: ------------------ | Branch (1010:7): [True: 0, False: 23.2k] ------------------ 1011| 0| return if_match(req, "FrodoKEM-640-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 15, 1}); 1012| 0| case 0x50D78: ------------------ | Branch (1012:7): [True: 0, False: 23.2k] ------------------ 1013| 0| return if_match(req, "x962_p192v2", {1, 2, 840, 10045, 3, 1, 2}); 1014| 0| case 0x50D79: ------------------ | Branch (1014:7): [True: 0, False: 23.2k] ------------------ 1015| 0| return if_match(req, "x962_p192v3", {1, 2, 840, 10045, 3, 1, 3}); 1016| 0| case 0x51DC6: ------------------ | Branch (1016:7): [True: 0, False: 23.2k] ------------------ 1017| 0| return if_match(req, "AES-128/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 1}); 1018| 0| case 0x52DB6: ------------------ | Branch (1018:7): [True: 0, False: 23.2k] ------------------ 1019| 0| return if_match(req, "HMAC(SHA-224)", {1, 2, 840, 113549, 2, 8}); 1020| 0| case 0x53E11: ------------------ | Branch (1020:7): [True: 0, False: 23.2k] ------------------ 1021| 0| return if_match(req, "FrodoKEM-1344-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 14, 3}); 1022| 0| case 0x54012: ------------------ | Branch (1022:7): [True: 0, False: 23.2k] ------------------ 1023| 0| return if_match(req, "PKIX.TimeStamping", {1, 3, 6, 1, 5, 5, 7, 3, 8}); 1024| 0| case 0x5407A: ------------------ | Branch (1024:7): [True: 0, False: 23.2k] ------------------ 1025| 0| return if_match(req, "Serpent/CBC", {1, 3, 6, 1, 4, 1, 25258, 3, 1}); 1026| 0| case 0x5576D: ------------------ | Branch (1026:7): [True: 0, False: 23.2k] ------------------ 1027| 0| return if_match(req, "SphincsPlus-sha2-128f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 2}); 1028| 0| case 0x55EF6: ------------------ | Branch (1028:7): [True: 0, False: 23.2k] ------------------ 1029| 0| return if_match(req, "AES-192/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 2}); 1030| 0| case 0x55FFA: ------------------ | Branch (1030:7): [True: 0, False: 23.2k] ------------------ 1031| 0| return if_match(req, "ML-DSA-6x5", {2, 16, 840, 1, 101, 3, 4, 3, 18}); 1032| 0| case 0x56826: ------------------ | Branch (1032:7): [True: 0, False: 23.2k] ------------------ 1033| 0| return if_match(req, "brainpool320r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 9}); 1034| 0| case 0x56D0D: ------------------ | Branch (1034:7): [True: 0, False: 23.2k] ------------------ 1035| 0| return if_match(req, "SphincsPlus-shake-128f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 2}); 1036| 0| case 0x57077: ------------------ | Branch (1036:7): [True: 0, False: 23.2k] ------------------ 1037| 0| return if_match(req, "XMSS-draft6", {1, 3, 6, 1, 4, 1, 25258, 1, 5}); 1038| 0| case 0x5818B: ------------------ | Branch (1038:7): [True: 0, False: 23.2k] ------------------ 1039| 0| return if_match(req, "ECGDSA/SHA-224", {1, 3, 36, 3, 3, 2, 5, 4, 3}); 1040| 0| case 0x5847E: ------------------ | Branch (1040:7): [True: 0, False: 23.2k] ------------------ 1041| 0| return if_match(req, "ECGDSA/SHA-256", {1, 3, 36, 3, 3, 2, 5, 4, 4}); 1042| 0| case 0x5898B: ------------------ | Branch (1042:7): [True: 0, False: 23.2k] ------------------ 1043| 0| return if_match(req, "SHA-512", {2, 16, 840, 1, 101, 3, 4, 2, 3}); 1044| 0| case 0x58991: ------------------ | Branch (1044:7): [True: 0, False: 23.2k] ------------------ 1045| 0| return if_match(req, "PKIX.OCSP.NoCheck", {1, 3, 6, 1, 5, 5, 7, 48, 1, 5}); 1046| 0| case 0x59717: ------------------ | Branch (1046:7): [True: 0, False: 23.2k] ------------------ 1047| 0| return if_match(req, "X509v3.SubjectKeyIdentifier", {2, 5, 29, 14}); 1048| 0| case 0x5A1E1: ------------------ | Branch (1048:7): [True: 0, False: 23.2k] ------------------ 1049| 0| return if_match(req, "PKCS12.KeyBag", {1, 2, 840, 113549, 1, 12, 10, 1, 1}); 1050| 0| case 0x5A570: ------------------ | Branch (1050:7): [True: 0, False: 23.2k] ------------------ 1051| 0| return if_match(req, "X520.CommonName", {2, 5, 4, 3}); 1052| 0| case 0x5A990: ------------------ | Branch (1052:7): [True: 0, False: 23.2k] ------------------ 1053| 0| return if_match(req, "ECDSA/SHA-3(256)", {2, 16, 840, 1, 101, 3, 4, 3, 10}); 1054| 0| case 0x5AB0E: ------------------ | Branch (1054:7): [True: 0, False: 23.2k] ------------------ 1055| 0| return if_match(req, "SphincsPlus-sha2-256s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 5}); 1056| 0| case 0x5AC4A: ------------------ | Branch (1056:7): [True: 0, False: 23.2k] ------------------ 1057| 0| return if_match(req, "X520.Surname", {2, 5, 4, 4}); 1058| 0| case 0x5AF2C: ------------------ | Branch (1058:7): [True: 0, False: 23.2k] ------------------ 1059| 0| return if_match(req, "ClassicMcEliece_8192128pc", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 5}); 1060| 0| case 0x5BC39: ------------------ | Branch (1060:7): [True: 0, False: 23.2k] ------------------ 1061| 0| return if_match(req, "X509v3.KeyUsage", {2, 5, 29, 15}); 1062| 0| case 0x5BDDB: ------------------ | Branch (1062:7): [True: 0, False: 23.2k] ------------------ 1063| 0| return if_match(req, "numsp256d1", {1, 3, 6, 1, 4, 1, 25258, 4, 1}); 1064| 0| case 0x5C0AE: ------------------ | Branch (1064:7): [True: 0, False: 23.2k] ------------------ 1065| 0| return if_match(req, "SphincsPlus-shake-256s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 5}); 1066| 0| case 0x5C10E: ------------------ | Branch (1066:7): [True: 0, False: 23.2k] ------------------ 1067| 0| return if_match(req, "DSA/SHA-384", {2, 16, 840, 1, 101, 3, 4, 3, 3}); 1068| 0| case 0x5CFE5: ------------------ | Branch (1068:7): [True: 0, False: 23.2k] ------------------ 1069| 0| return if_match(req, "PKCS9.X509Certificate", {1, 2, 840, 113549, 1, 9, 22, 1}); 1070| 0| case 0x5D1CF: ------------------ | Branch (1070:7): [True: 0, False: 23.2k] ------------------ 1071| 0| return if_match(req, "X520.SerialNumber", {2, 5, 4, 5}); 1072| 0| case 0x5D375: ------------------ | Branch (1072:7): [True: 0, False: 23.2k] ------------------ 1073| 0| return if_match(req, "SM4/OCB", {1, 2, 156, 10197, 1, 104, 100}); 1074| 0| case 0x5DD49: ------------------ | Branch (1074:7): [True: 0, False: 23.2k] ------------------ 1075| 0| return if_match(req, "AES-128/CBC", {2, 16, 840, 1, 101, 3, 4, 1, 2}); 1076| 0| case 0x5DE4E: ------------------ | Branch (1076:7): [True: 0, False: 23.2k] ------------------ 1077| 0| return if_match(req, "AES-128/CCM", {2, 16, 840, 1, 101, 3, 4, 1, 7}); 1078| 0| case 0x5DF23: ------------------ | Branch (1078:7): [True: 0, False: 23.2k] ------------------ 1079| 0| return if_match(req, "HMAC(SHA-512-256)", {1, 2, 840, 113549, 2, 13}); 1080| 0| case 0x5ED04: ------------------ | Branch (1080:7): [True: 0, False: 23.2k] ------------------ 1081| 0| return if_match(req, "SM2", {1, 2, 156, 10197, 1, 301, 1}); 1082| 0| case 0x5ED05: ------------------ | Branch (1082:7): [True: 0, False: 23.2k] ------------------ 1083| 0| return if_match(req, "SM3", {1, 2, 156, 10197, 1, 401}); 1084| 0| case 0x5FDC6: ------------------ | Branch (1084:7): [True: 0, False: 23.2k] ------------------ 1085| 0| return if_match(req, "ECDSA/SHA-384", {1, 2, 840, 10045, 4, 3, 3}); 1086| 0| case 0x6199F: ------------------ | Branch (1086:7): [True: 0, False: 23.2k] ------------------ 1087| 0| return if_match(req, "SHA-3(224)", {2, 16, 840, 1, 101, 3, 4, 2, 7}); 1088| 0| case 0x61E79: ------------------ | Branch (1088:7): [True: 0, False: 23.2k] ------------------ 1089| 0| return if_match(req, "AES-192/CBC", {2, 16, 840, 1, 101, 3, 4, 1, 22}); 1090| 0| case 0x61F7E: ------------------ | Branch (1090:7): [True: 0, False: 23.2k] ------------------ 1091| 0| return if_match(req, "AES-192/CCM", {2, 16, 840, 1, 101, 3, 4, 1, 27}); 1092| 0| case 0x64947: ------------------ | Branch (1092:7): [True: 0, False: 23.2k] ------------------ 1093| 0| return if_match(req, "OpenPGP.Ed25519", {1, 3, 6, 1, 4, 1, 11591, 15, 1}); 1094| 0| case 0x652E7: ------------------ | Branch (1094:7): [True: 0, False: 23.2k] ------------------ 1095| 0| return if_match(req, "sm2p256v1", {1, 2, 156, 10197, 1, 301}); 1096| 0| case 0x6697B: ------------------ | Branch (1096:7): [True: 0, False: 23.2k] ------------------ 1097| 0| return if_match(req, "FrodoKEM-1344-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 15, 3}); 1098| 0| case 0x67B2C: ------------------ | Branch (1098:7): [True: 0, False: 23.2k] ------------------ 1099| 0| return if_match(req, "X520.State", {2, 5, 4, 8}); 1100| 0| case 0x67B9B: ------------------ | Branch (1100:7): [True: 0, False: 23.2k] ------------------ 1101| 0| return if_match(req, "HMAC(SHA-384)", {1, 2, 840, 113549, 2, 10}); 1102| 0| case 0x67D86: ------------------ | Branch (1102:7): [True: 0, False: 23.2k] ------------------ 1103| 0| return if_match(req, "ECGDSA/SHA-384", {1, 3, 36, 3, 3, 2, 5, 4, 5}); 1104| 0| case 0x68A0B: ------------------ | Branch (1104:7): [True: 0, False: 23.2k] ------------------ 1105| 0| return if_match(req, "Camellia-128/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 6}); 1106| 0| case 0x68E33: ------------------ | Branch (1106:7): [True: 0, False: 23.2k] ------------------ 1107| 0| return if_match(req, "PKCS9.ExtensionRequest", {1, 2, 840, 113549, 1, 9, 14}); 1108| 9.53k| case 0x69126: ------------------ | Branch (1108:7): [True: 9.53k, False: 13.7k] ------------------ 1109| 9.53k| return if_match(req, "X509v3.SubjectAlternativeName", {2, 5, 29, 17}); 1110| 0| case 0x692F8: ------------------ | Branch (1110:7): [True: 0, False: 23.2k] ------------------ 1111| 0| return if_match(req, "SM4/CBC", {1, 2, 156, 10197, 1, 104, 2}); 1112| 0| case 0x695E1: ------------------ | Branch (1112:7): [True: 0, False: 23.2k] ------------------ 1113| 0| return if_match(req, "Dilithium-4x4-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 9, 1}); 1114| 0| case 0x696DC: ------------------ | Branch (1114:7): [True: 0, False: 23.2k] ------------------ 1115| 0| return if_match(req, "PKIX.IpAddrBlocks", {1, 3, 6, 1, 5, 5, 7, 1, 7}); 1116| 1.28k| case 0x6A7CA: ------------------ | Branch (1116:7): [True: 1.28k, False: 21.9k] ------------------ 1117| 1.28k| return if_match(req, "ECDSA", {1, 2, 840, 10045, 2, 1}); 1118| 0| case 0x6BD26: ------------------ | Branch (1118:7): [True: 0, False: 23.2k] ------------------ 1119| 0| return if_match(req, "GOST.INN", {1, 2, 643, 3, 131, 1, 1}); 1120| 0| case 0x6CB3B: ------------------ | Branch (1120:7): [True: 0, False: 23.2k] ------------------ 1121| 0| return if_match(req, "Camellia-192/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 7}); 1122| 0| case 0x6E602: ------------------ | Branch (1122:7): [True: 0, False: 23.2k] ------------------ 1123| 0| return if_match(req, "Dilithium-8x7-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 9, 3}); 1124| 0| case 0x6F0C2: ------------------ | Branch (1124:7): [True: 0, False: 23.2k] ------------------ 1125| 0| return if_match(req, "RSA/PKCS1v15(SHA-224)", {1, 2, 840, 113549, 1, 1, 14}); 1126| 0| case 0x6F9F8: ------------------ | Branch (1126:7): [True: 0, False: 23.2k] ------------------ 1127| 0| return if_match(req, "PKCS12.SafeContentsBag", {1, 2, 840, 113549, 1, 12, 10, 1, 6}); 1128| 0| case 0x6FB26: ------------------ | Branch (1128:7): [True: 0, False: 23.2k] ------------------ 1129| 0| return if_match(req, "PKIX.AuthorityInformationAccess", {1, 3, 6, 1, 5, 5, 7, 1, 1}); 1130| 0| case 0x70BB6: ------------------ | Branch (1130:7): [True: 0, False: 23.2k] ------------------ 1131| 0| return if_match(req, "brainpool384r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 11}); 1132| 0| case 0x70EA6: ------------------ | Branch (1132:7): [True: 0, False: 23.2k] ------------------ 1133| 0| return if_match(req, "PKCS12.PKCS8ShroudedKeyBag", {1, 2, 840, 113549, 1, 12, 10, 1, 2}); 1134| 0| case 0x71EB3: ------------------ | Branch (1134:7): [True: 0, False: 23.2k] ------------------ 1135| 0| return if_match(req, "SphincsPlus-haraka-128f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 2}); 1136| 0| case 0x7382C: ------------------ | Branch (1136:7): [True: 0, False: 23.2k] ------------------ 1137| 0| return if_match(req, "ML-KEM-1024", {2, 16, 840, 1, 101, 3, 4, 4, 3}); 1138| 0| case 0x743BD: ------------------ | Branch (1138:7): [True: 0, False: 23.2k] ------------------ 1139| 0| return if_match(req, "AES-256/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 3}); 1140| 0| case 0x7498E: ------------------ | Branch (1140:7): [True: 0, False: 23.2k] ------------------ 1141| 0| return if_match(req, "Camellia-128/CBC", {1, 2, 392, 200011, 61, 1, 1, 1, 2}); 1142| 0| case 0x74C2E: ------------------ | Branch (1142:7): [True: 0, False: 23.2k] ------------------ 1143| 0| return if_match(req, "ML-DSA-8x7", {2, 16, 840, 1, 101, 3, 4, 3, 19}); 1144| 0| case 0x7505F: ------------------ | Branch (1144:7): [True: 0, False: 23.2k] ------------------ 1145| 0| return if_match(req, "PKIX.XMPPAddr", {1, 3, 6, 1, 5, 5, 7, 8, 5}); 1146| 0| case 0x7517A: ------------------ | Branch (1146:7): [True: 0, False: 23.2k] ------------------ 1147| 0| return if_match(req, "RSA/PKCS1v15(MD2)", {1, 2, 840, 113549, 1, 1, 2}); 1148| 0| case 0x7546B: ------------------ | Branch (1148:7): [True: 0, False: 23.2k] ------------------ 1149| 0| return if_match(req, "RSA/PKCS1v15(MD5)", {1, 2, 840, 113549, 1, 1, 4}); 1150| 0| case 0x75921: ------------------ | Branch (1150:7): [True: 0, False: 23.2k] ------------------ 1151| 0| return if_match(req, "ClassicMcEliece_348864f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 2}); 1152| 0| case 0x76784: ------------------ | Branch (1152:7): [True: 0, False: 23.2k] ------------------ 1153| 0| return if_match(req, "SHA-3(384)", {2, 16, 840, 1, 101, 3, 4, 2, 9}); 1154| 0| case 0x768FD: ------------------ | Branch (1154:7): [True: 0, False: 23.2k] ------------------ 1155| 0| return if_match(req, "PKCS9.LocalKeyId", {1, 2, 840, 113549, 1, 9, 21}); 1156| 0| case 0x76A19: ------------------ | Branch (1156:7): [True: 0, False: 23.2k] ------------------ 1157| 0| return if_match(req, "brainpool512r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 13}); 1158| 0| case 0x77254: ------------------ | Branch (1158:7): [True: 0, False: 23.2k] ------------------ 1159| 0| return if_match(req, "SphincsPlus-haraka-256s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 5}); 1160| 0| case 0x77ADC: ------------------ | Branch (1160:7): [True: 0, False: 23.2k] ------------------ 1161| 0| return if_match(req, "secp224k1", {1, 3, 132, 0, 32}); 1162| 0| case 0x781B9: ------------------ | Branch (1162:7): [True: 0, False: 23.2k] ------------------ 1163| 0| return if_match(req, "secp224r1", {1, 3, 132, 0, 33}); 1164| 0| case 0x78ABE: ------------------ | Branch (1164:7): [True: 0, False: 23.2k] ------------------ 1165| 0| return if_match(req, "Camellia-192/CBC", {1, 2, 392, 200011, 61, 1, 1, 1, 3}); 1166| 0| case 0x792F2: ------------------ | Branch (1166:7): [True: 0, False: 23.2k] ------------------ 1167| 0| return if_match(req, "ClassicMcEliece_6688128pc", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 1}); 1168| 0| case 0x7A661: ------------------ | Branch (1168:7): [True: 0, False: 23.2k] ------------------ 1169| 0| return if_match(req, "DSA/SHA-512", {2, 16, 840, 1, 101, 3, 4, 3, 4}); 1170| 0| case 0x7A977: ------------------ | Branch (1170:7): [True: 0, False: 23.2k] ------------------ 1171| 0| return if_match(req, "X509v3.ExtendedKeyUsage", {2, 5, 29, 37}); 1172| 0| case 0x7AE67: ------------------ | Branch (1172:7): [True: 0, False: 23.2k] ------------------ 1173| 0| return if_match(req, "SM2_Enc", {1, 2, 156, 10197, 1, 301, 3}); 1174| 0| case 0x7B602: ------------------ | Branch (1174:7): [True: 0, False: 23.2k] ------------------ 1175| 0| return if_match(req, "Twofish/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 5}); 1176| 0| case 0x7B9A1: ------------------ | Branch (1176:7): [True: 0, False: 23.2k] ------------------ 1177| 0| return if_match(req, "SphincsPlus-sha2-192s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 3}); 1178| 0| case 0x7BB0A: ------------------ | Branch (1178:7): [True: 0, False: 23.2k] ------------------ 1179| 0| return if_match(req, "SLH-DSA-SHAKE-256f", {2, 16, 840, 1, 101, 3, 4, 3, 31}); 1180| 0| case 0x7BB17: ------------------ | Branch (1180:7): [True: 0, False: 23.2k] ------------------ 1181| 0| return if_match(req, "SLH-DSA-SHAKE-256s", {2, 16, 840, 1, 101, 3, 4, 3, 30}); 1182| 0| case 0x7BCF3: ------------------ | Branch (1182:7): [True: 0, False: 23.2k] ------------------ 1183| 0| return if_match(req, "PKIX.EmailProtection", {1, 3, 6, 1, 5, 5, 7, 3, 4}); 1184| 0| case 0x7CC2C: ------------------ | Branch (1184:7): [True: 0, False: 23.2k] ------------------ 1185| 0| return if_match(req, "SHA-512-256", {2, 16, 840, 1, 101, 3, 4, 2, 6}); 1186| 0| case 0x7CF41: ------------------ | Branch (1186:7): [True: 0, False: 23.2k] ------------------ 1187| 0| return if_match(req, "SphincsPlus-shake-192s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 3}); 1188| 387| case 0x7DB91: ------------------ | Branch (1188:7): [True: 387, False: 22.8k] ------------------ 1189| 387| return if_match(req, "GOST-34.10", {1, 2, 643, 2, 2, 19}); 1190| 0| case 0x7E319: ------------------ | Branch (1190:7): [True: 0, False: 23.2k] ------------------ 1191| 0| return if_match(req, "ECDSA/SHA-512", {1, 2, 840, 10045, 4, 3, 4}); 1192| 0| case 0x7E874: ------------------ | Branch (1192:7): [True: 0, False: 23.2k] ------------------ 1193| 0| return if_match(req, "ClassicMcEliece_6688128f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 6}); 1194| 0| case 0x7EAAF: ------------------ | Branch (1194:7): [True: 0, False: 23.2k] ------------------ 1195| 0| return if_match(req, "eFrodoKEM-640-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 16, 1}); 1196| 0| case 0x7F51F: ------------------ | Branch (1196:7): [True: 0, False: 23.2k] ------------------ 1197| 0| return if_match(req, "PKIX.IPsecTunnel", {1, 3, 6, 1, 5, 5, 7, 3, 6}); 1198| 0| case 0x80272: ------------------ | Branch (1198:7): [True: 0, False: 23.2k] ------------------ 1199| 0| return if_match(req, "X520.Organization", {2, 5, 4, 10}); 1200| 0| case 0x80340: ------------------ | Branch (1200:7): [True: 0, False: 23.2k] ------------------ 1201| 0| return if_match(req, "AES-256/CBC", {2, 16, 840, 1, 101, 3, 4, 1, 42}); 1202| 0| case 0x80445: ------------------ | Branch (1202:7): [True: 0, False: 23.2k] ------------------ 1203| 0| return if_match(req, "AES-256/CCM", {2, 16, 840, 1, 101, 3, 4, 1, 47}); 1204| 0| case 0x80E71: ------------------ | Branch (1204:7): [True: 0, False: 23.2k] ------------------ 1205| 0| return if_match(req, "PKIX.STIRTNList", {1, 3, 6, 1, 5, 5, 7, 48, 14}); 1206| 0| case 0x811F7: ------------------ | Branch (1206:7): [True: 0, False: 23.2k] ------------------ 1207| 0| return if_match(req, "HMAC(SHA-256)", {1, 2, 840, 113549, 2, 9}); 1208| 0| case 0x82434: ------------------ | Branch (1208:7): [True: 0, False: 23.2k] ------------------ 1209| 0| return if_match(req, "PKCS9.X509CRL", {1, 2, 840, 113549, 1, 9, 23, 1}); 1210| 0| case 0x82B47: ------------------ | Branch (1210:7): [True: 0, False: 23.2k] ------------------ 1211| 0| return if_match(req, "Threefish-512/CBC", {1, 3, 6, 1, 4, 1, 25258, 3, 2}); 1212| 0| case 0x83EA7: ------------------ | Branch (1212:7): [True: 0, False: 23.2k] ------------------ 1213| 0| return if_match(req, "RSA/PKCS1v15(SHA-384)", {1, 2, 840, 113549, 1, 1, 12}); 1214| 0| case 0x84596: ------------------ | Branch (1214:7): [True: 0, False: 23.2k] ------------------ 1215| 0| return if_match(req, "eFrodoKEM-640-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 17, 1}); 1216| 0| case 0x8469F: ------------------ | Branch (1216:7): [True: 0, False: 23.2k] ------------------ 1217| 0| return if_match(req, "ClassicMcEliece_6960119pcf", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 4}); 1218| 0| case 0x84CA4: ------------------ | Branch (1218:7): [True: 0, False: 23.2k] ------------------ 1219| 0| return if_match(req, "secp256k1", {1, 3, 132, 0, 10}); 1220| 0| case 0x85381: ------------------ | Branch (1220:7): [True: 0, False: 23.2k] ------------------ 1221| 0| return if_match(req, "secp256r1", {1, 2, 840, 10045, 3, 1, 7}); 1222| 0| case 0x854FC: ------------------ | Branch (1222:7): [True: 0, False: 23.2k] ------------------ 1223| 0| return if_match(req, "PKIX.IPsecUser", {1, 3, 6, 1, 5, 5, 7, 3, 7}); 1224| 0| case 0x85F51: ------------------ | Branch (1224:7): [True: 0, False: 23.2k] ------------------ 1225| 0| return if_match(req, "Serpent/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 4}); 1226| 0| case 0x862D9: ------------------ | Branch (1226:7): [True: 0, False: 23.2k] ------------------ 1227| 0| return if_match(req, "ECGDSA/SHA-512", {1, 3, 36, 3, 3, 2, 5, 4, 6}); 1228| 0| case 0x87585: ------------------ | Branch (1228:7): [True: 0, False: 23.2k] ------------------ 1229| 0| return if_match(req, "Twofish/CBC", {1, 3, 6, 1, 4, 1, 25258, 3, 3}); 1230| 0| case 0x877D1: ------------------ | Branch (1230:7): [True: 0, False: 23.2k] ------------------ 1231| 0| return if_match(req, "PKCS9.EmailAddress", {1, 2, 840, 113549, 1, 9, 1}); 1232| 988| case 0x87D27: ------------------ | Branch (1232:7): [True: 988, False: 22.2k] ------------------ 1233| 988| return if_match(req, "PKIX.CertificateAuthorityIssuers", {1, 3, 6, 1, 5, 5, 7, 48, 2}); 1234| 0| case 0x87E42: ------------------ | Branch (1234:7): [True: 0, False: 23.2k] ------------------ 1235| 0| return if_match(req, "X509v3.AuthorityKeyIdentifier", {2, 5, 29, 35}); 1236| 0| case 0x889B1: ------------------ | Branch (1236:7): [True: 0, False: 23.2k] ------------------ 1237| 0| return if_match(req, "ECDSA/SHA-1", {1, 2, 840, 10045, 4, 1}); 1238| 0| case 0x89658: ------------------ | Branch (1238:7): [True: 0, False: 23.2k] ------------------ 1239| 0| return if_match(req, "PBE-PKCS5v20", {1, 2, 840, 113549, 1, 5, 13}); 1240| 0| case 0x8976D: ------------------ | Branch (1240:7): [True: 0, False: 23.2k] ------------------ 1241| 0| return if_match(req, "PKCS9.MessageDigest", {1, 2, 840, 113549, 1, 9, 4}); 1242| 0| case 0x8B002: ------------------ | Branch (1242:7): [True: 0, False: 23.2k] ------------------ 1243| 0| return if_match(req, "Camellia-256/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 8}); 1244| 0| case 0x8B935: ------------------ | Branch (1244:7): [True: 0, False: 23.2k] ------------------ 1245| 0| return if_match(req, "ClassicMcEliece_6688128", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 5}); 1246| 0| case 0x8BB11: ------------------ | Branch (1246:7): [True: 0, False: 23.2k] ------------------ 1247| 0| return if_match(req, "X509v3.NoRevocationAvailable", {2, 5, 29, 56}); 1248| 0| case 0x8CE3D: ------------------ | Branch (1248:7): [True: 0, False: 23.2k] ------------------ 1249| 0| return if_match(req, "PKCS9.ChallengePassword", {1, 2, 840, 113549, 1, 9, 7}); 1250| 0| case 0x8D45C: ------------------ | Branch (1250:7): [True: 0, False: 23.2k] ------------------ 1251| 0| return if_match(req, "ECKCDSA", {1, 0, 14888, 3, 0, 5}); 1252| 0| case 0x8E0C1: ------------------ | Branch (1252:7): [True: 0, False: 23.2k] ------------------ 1253| 0| return if_match(req, "X509v3.CertificatePolicies", {2, 5, 29, 32}); 1254| 0| case 0x8E39A: ------------------ | Branch (1254:7): [True: 0, False: 23.2k] ------------------ 1255| 0| return if_match(req, "HSS-LMS-Private-Key", {1, 3, 6, 1, 4, 1, 25258, 1, 13}); 1256| 0| case 0x8EC51: ------------------ | Branch (1256:7): [True: 0, False: 23.2k] ------------------ 1257| 0| return if_match(req, "Kyber-768-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 7, 2}); 1258| 0| case 0x8F94A: ------------------ | Branch (1258:7): [True: 0, False: 23.2k] ------------------ 1259| 0| return if_match(req, "Dilithium-6x5-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 9, 2}); 1260| 0| case 0x8FC20: ------------------ | Branch (1260:7): [True: 0, False: 23.2k] ------------------ 1261| 0| return if_match(req, "AES-128/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 1}); 1262| 0| case 0x8FDE0: ------------------ | Branch (1262:7): [True: 0, False: 23.2k] ------------------ 1263| 0| return if_match(req, "SHA-3(256)", {2, 16, 840, 1, 101, 3, 4, 2, 8}); 1264| 0| case 0x919E3: ------------------ | Branch (1264:7): [True: 0, False: 23.2k] ------------------ 1265| 0| return if_match(req, "Serpent/GCM", {1, 3, 6, 1, 4, 1, 25258, 3, 101}); 1266| 0| case 0x91C1A: ------------------ | Branch (1266:7): [True: 0, False: 23.2k] ------------------ 1267| 0| return if_match(req, "X25519", {1, 3, 101, 110}); 1268| 0| case 0x91DC4: ------------------ | Branch (1268:7): [True: 0, False: 23.2k] ------------------ 1269| 0| return if_match(req, "McEliece", {1, 3, 6, 1, 4, 1, 25258, 1, 3}); 1270| 0| case 0x93467: ------------------ | Branch (1270:7): [True: 0, False: 23.2k] ------------------ 1271| 0| return if_match(req, "Dilithium-6x5-AES-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 10, 2}); 1272| 0| case 0x93D50: ------------------ | Branch (1272:7): [True: 0, False: 23.2k] ------------------ 1273| 0| return if_match(req, "AES-192/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 2}); 1274| 0| case 0x95166: ------------------ | Branch (1274:7): [True: 0, False: 23.2k] ------------------ 1275| 0| return if_match(req, "SLH-DSA-SHAKE-128f", {2, 16, 840, 1, 101, 3, 4, 3, 27}); 1276| 0| case 0x95173: ------------------ | Branch (1276:7): [True: 0, False: 23.2k] ------------------ 1277| 0| return if_match(req, "SLH-DSA-SHAKE-128s", {2, 16, 840, 1, 101, 3, 4, 3, 26}); 1278| 988| case 0x952D6: ------------------ | Branch (1278:7): [True: 988, False: 22.2k] ------------------ 1279| 988| return if_match(req, "PKIX.OCSP", {1, 3, 6, 1, 5, 5, 7, 48, 1}); 1280| 0| case 0x959B9: ------------------ | Branch (1280:7): [True: 0, False: 23.2k] ------------------ 1281| 0| return if_match(req, "PKIX.IPsecEndSystem", {1, 3, 6, 1, 5, 5, 7, 3, 5}); 1282| 0| case 0x96F85: ------------------ | Branch (1282:7): [True: 0, False: 23.2k] ------------------ 1283| 0| return if_match(req, "Camellia-256/CBC", {1, 2, 392, 200011, 61, 1, 1, 1, 4}); 1284| 0| case 0x97D5E: ------------------ | Branch (1284:7): [True: 0, False: 23.2k] ------------------ 1285| 0| return if_match(req, "HMAC(SHA-1)", {1, 2, 840, 113549, 2, 7}); 1286| 0| case 0x9805C: ------------------ | Branch (1286:7): [True: 0, False: 23.2k] ------------------ 1287| 0| return if_match(req, "SEED/CBC", {1, 2, 410, 200004, 1, 4}); 1288| 0| case 0x980E7: ------------------ | Branch (1288:7): [True: 0, False: 23.2k] ------------------ 1289| 0| return if_match(req, "SphincsPlus-haraka-192s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 3}); 1290| 0| case 0x980F5: ------------------ | Branch (1290:7): [True: 0, False: 23.2k] ------------------ 1291| 0| return if_match(req, "GOST.SubjectSigningTool", {1, 2, 643, 100, 111}); 1292| 0| case 0x98B03: ------------------ | Branch (1292:7): [True: 0, False: 23.2k] ------------------ 1293| 0| return if_match(req, "XMSS", {0, 4, 0, 127, 0, 15, 1, 1, 13, 0}); 1294| 0| case 0x9A6B2: ------------------ | Branch (1294:7): [True: 0, False: 23.2k] ------------------ 1295| 0| return if_match(req, "ECKCDSA/SHA-1", {1, 2, 410, 200004, 1, 100, 4, 3}); 1296| 0| case 0x9B1CF: ------------------ | Branch (1296:7): [True: 0, False: 23.2k] ------------------ 1297| 0| return if_match(req, "SM4/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 9}); 1298| 0| case 0x9B6B2: ------------------ | Branch (1298:7): [True: 0, False: 23.2k] ------------------ 1299| 0| return if_match(req, "AES-128/GCM", {2, 16, 840, 1, 101, 3, 4, 1, 6}); 1300| 0| case 0x9B6BB: ------------------ | Branch (1300:7): [True: 0, False: 23.2k] ------------------ 1301| 0| return if_match(req, "X520.OrganizationalUnit", {2, 5, 4, 11}); 1302| 0| case 0x9B851: ------------------ | Branch (1302:7): [True: 0, False: 23.2k] ------------------ 1303| 0| return if_match(req, "OpenPGP.Curve25519", {1, 3, 6, 1, 4, 1, 3029, 1, 5, 1}); 1304| 0| case 0x9C80B: ------------------ | Branch (1304:7): [True: 0, False: 23.2k] ------------------ 1305| 0| return if_match(req, "SLH-DSA-SHA2-192f", {2, 16, 840, 1, 101, 3, 4, 3, 23}); 1306| 0| case 0x9C818: ------------------ | Branch (1306:7): [True: 0, False: 23.2k] ------------------ 1307| 0| return if_match(req, "SLH-DSA-SHA2-192s", {2, 16, 840, 1, 101, 3, 4, 3, 22}); 1308| 0| case 0x9CD2B: ------------------ | Branch (1308:7): [True: 0, False: 23.2k] ------------------ 1309| 0| return if_match(req, "Scrypt", {1, 3, 6, 1, 4, 1, 11591, 4, 11}); 1310| 0| case 0x9CDE1: ------------------ | Branch (1310:7): [True: 0, False: 23.2k] ------------------ 1311| 0| return if_match(req, "GOST-34.10-2012-256/SHA-256", {1, 3, 6, 1, 4, 1, 25258, 1, 6, 1}); 1312| 0| case 0x9CF73: ------------------ | Branch (1312:7): [True: 0, False: 23.2k] ------------------ 1313| 0| return if_match(req, "ClassicMcEliece_460896f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 4}); 1314| 0| case 0x9D354: ------------------ | Branch (1314:7): [True: 0, False: 23.2k] ------------------ 1315| 0| return if_match(req, "RIPEMD-160", {1, 3, 36, 3, 2, 1}); 1316| 0| case 0x9D503: ------------------ | Branch (1316:7): [True: 0, False: 23.2k] ------------------ 1317| 0| return if_match(req, "RSA/PKCS1v15(SHA-256)", {1, 2, 840, 113549, 1, 1, 11}); 1318| 0| case 0x9EC88: ------------------ | Branch (1318:7): [True: 0, False: 23.2k] ------------------ 1319| 0| return if_match(req, "DSA/SHA-3(512)", {2, 16, 840, 1, 101, 3, 4, 3, 8}); 1320| 0| case 0x9EF36: ------------------ | Branch (1320:7): [True: 0, False: 23.2k] ------------------ 1321| 0| return if_match(req, "ClassicMcEliece_6960119", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 7}); 1322| 0| case 0x9F764: ------------------ | Branch (1322:7): [True: 0, False: 23.2k] ------------------ 1323| 0| return if_match(req, "X448", {1, 3, 101, 111}); 1324| 0| case 0x9F7E2: ------------------ | Branch (1324:7): [True: 0, False: 23.2k] ------------------ 1325| 0| return if_match(req, "AES-192/GCM", {2, 16, 840, 1, 101, 3, 4, 1, 26}); 1326| 0| case 0x9F9C5: ------------------ | Branch (1326:7): [True: 0, False: 23.2k] ------------------ 1327| 0| return if_match(req, "ClassicMcEliece_6688128pcf", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 2}); 1328| 0| case 0xA0805: ------------------ | Branch (1328:7): [True: 0, False: 23.2k] ------------------ 1329| 0| return if_match(req, "PKCS9.SDSICertificate", {1, 2, 840, 113549, 1, 9, 22, 2}); 1330| 0| case 0xA2B5B: ------------------ | Branch (1330:7): [True: 0, False: 23.2k] ------------------ 1331| 0| return if_match(req, "X509v3.CRLNumber", {2, 5, 29, 20}); 1332| 0| case 0xA3005: ------------------ | Branch (1332:7): [True: 0, False: 23.2k] ------------------ 1333| 0| return if_match(req, "X520.Title", {2, 5, 4, 12}); 1334| 0| case 0xA323F: ------------------ | Branch (1334:7): [True: 0, False: 23.2k] ------------------ 1335| 0| return if_match(req, "X509v3.NameConstraints", {2, 5, 29, 30}); 1336| 0| case 0xA3C55: ------------------ | Branch (1336:7): [True: 0, False: 23.2k] ------------------ 1337| 0| return if_match(req, "X520.Pseudonym", {2, 5, 4, 65}); 1338| 0| case 0xA4809: ------------------ | Branch (1338:7): [True: 0, False: 23.2k] ------------------ 1339| 0| return if_match(req, "SphincsPlus-sha2-256f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 6}); 1340| 0| case 0xA57AF: ------------------ | Branch (1340:7): [True: 0, False: 23.2k] ------------------ 1341| 0| return if_match(req, "secp521r1", {1, 3, 132, 0, 35}); 1342| 0| case 0xA5DA9: ------------------ | Branch (1342:7): [True: 0, False: 23.2k] ------------------ 1343| 0| return if_match(req, "SphincsPlus-shake-256f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 6}); 1344| 0| case 0xA6865: ------------------ | Branch (1344:7): [True: 0, False: 23.2k] ------------------ 1345| 0| return if_match(req, "Camellia-128/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 6}); 1346| 0| case 0xA6C61: ------------------ | Branch (1346:7): [True: 0, False: 23.2k] ------------------ 1347| 0| return if_match(req, "SM4/GCM", {1, 2, 156, 10197, 1, 104, 8}); 1348| 0| case 0xA8439: ------------------ | Branch (1348:7): [True: 0, False: 23.2k] ------------------ 1349| 0| return if_match(req, "PKCS12.CertBag", {1, 2, 840, 113549, 1, 12, 10, 1, 3}); 1350| 0| case 0xA9061: ------------------ | Branch (1350:7): [True: 0, False: 23.2k] ------------------ 1351| 0| return if_match(req, "Kyber-768-90s-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 11, 2}); 1352| 0| case 0xAA995: ------------------ | Branch (1352:7): [True: 0, False: 23.2k] ------------------ 1353| 0| return if_match(req, "Camellia-192/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 7}); 1354| 0| case 0xAAE2B: ------------------ | Branch (1354:7): [True: 0, False: 23.2k] ------------------ 1355| 0| return if_match(req, "Dilithium-8x7-AES-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 10, 3}); 1356| 0| case 0xABCED: ------------------ | Branch (1356:7): [True: 0, False: 23.2k] ------------------ 1357| 0| return if_match(req, "GOST.IssuerSigningTool", {1, 2, 643, 100, 112}); 1358| 0| case 0xABD24: ------------------ | Branch (1358:7): [True: 0, False: 23.2k] ------------------ 1359| 0| return if_match(req, "RSA/OAEP", {1, 2, 840, 113549, 1, 1, 7}); 1360| 325| case 0xAC2EC: ------------------ | Branch (1360:7): [True: 325, False: 22.9k] ------------------ 1361| 325| return if_match(req, "Streebog-256", {1, 2, 643, 7, 1, 1, 2, 2}); 1362| 0| case 0xAC3DD: ------------------ | Branch (1362:7): [True: 0, False: 23.2k] ------------------ 1363| 0| return if_match(req, "Certificate Comment", {2, 16, 840, 1, 113730, 1, 13}); 1364| 0| case 0xAC511: ------------------ | Branch (1364:7): [True: 0, False: 23.2k] ------------------ 1365| 0| return if_match(req, "PBE-SHA1-3DES", {1, 2, 840, 113549, 1, 12, 1, 3}); 1366| 87| case 0xAE6FE: ------------------ | Branch (1366:7): [True: 87, False: 23.1k] ------------------ 1367| 87| return if_match(req, "PKIX.ClientAuth", {1, 3, 6, 1, 5, 5, 7, 3, 2}); 1368| 0| case 0xAE8D3: ------------------ | Branch (1368:7): [True: 0, False: 23.2k] ------------------ 1369| 0| return if_match(req, "ClassicMcEliece_8192128pcf", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 6}); 1370| 0| case 0xAF476: ------------------ | Branch (1370:7): [True: 0, False: 23.2k] ------------------ 1371| 0| return if_match(req, "ECDH", {1, 3, 132, 1, 12}); 1372| 0| case 0xAFA6A: ------------------ | Branch (1372:7): [True: 0, False: 23.2k] ------------------ 1373| 0| return if_match(req, "RSA/PKCS1v15(SHA-3(384))", {2, 16, 840, 1, 101, 3, 4, 3, 15}); 1374| 0| case 0xB2217: ------------------ | Branch (1374:7): [True: 0, False: 23.2k] ------------------ 1375| 0| return if_match(req, "AES-256/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 3}); 1376| 0| case 0xB22F7: ------------------ | Branch (1376:7): [True: 0, False: 23.2k] ------------------ 1377| 0| return if_match(req, "Camellia-128/GCM", {0, 3, 4401, 5, 3, 1, 9, 6}); 1378| 0| case 0xB23DE: ------------------ | Branch (1378:7): [True: 0, False: 23.2k] ------------------ 1379| 0| return if_match(req, "X520.Locality", {2, 5, 4, 7}); 1380| 0| case 0xB2FBD: ------------------ | Branch (1380:7): [True: 0, False: 23.2k] ------------------ 1381| 0| return if_match(req, "ECKCDSA/SHA-224", {1, 2, 410, 200004, 1, 100, 4, 4}); 1382| 0| case 0xB32B0: ------------------ | Branch (1382:7): [True: 0, False: 23.2k] ------------------ 1383| 0| return if_match(req, "ECKCDSA/SHA-256", {1, 2, 410, 200004, 1, 100, 4, 5}); 1384| 0| case 0xB360E: ------------------ | Branch (1384:7): [True: 0, False: 23.2k] ------------------ 1385| 0| return if_match(req, "eFrodoKEM-976-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 16, 2}); 1386| 0| case 0xB4368: ------------------ | Branch (1386:7): [True: 0, False: 23.2k] ------------------ 1387| 0| return if_match(req, "ECGDSA/SHA-1", {1, 3, 36, 3, 3, 2, 5, 4, 2}); 1388| 0| case 0xB58CD: ------------------ | Branch (1388:7): [True: 0, False: 23.2k] ------------------ 1389| 0| return if_match(req, "RSA/PKCS1v15(SHA-3(512))", {2, 16, 840, 1, 101, 3, 4, 3, 16}); 1390| 0| case 0xB6427: ------------------ | Branch (1390:7): [True: 0, False: 23.2k] ------------------ 1391| 0| return if_match(req, "Camellia-192/GCM", {0, 3, 4401, 5, 3, 1, 9, 26}); 1392| 0| case 0xB7102: ------------------ | Branch (1392:7): [True: 0, False: 23.2k] ------------------ 1393| 0| return if_match(req, "brainpool224r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 5}); 1394| 0| case 0xB710D: ------------------ | Branch (1394:7): [True: 0, False: 23.2k] ------------------ 1395| 0| return if_match(req, "X509v3.CRLIssuingDistributionPoint", {2, 5, 29, 28}); 1396| 0| case 0xB72D4: ------------------ | Branch (1396:7): [True: 0, False: 23.2k] ------------------ 1397| 0| return if_match(req, "Microsoft UPN", {1, 3, 6, 1, 4, 1, 311, 20, 2, 3}); 1398| 0| case 0xB73A5: ------------------ | Branch (1398:7): [True: 0, False: 23.2k] ------------------ 1399| 0| return if_match(req, "RSA/PSS", {1, 2, 840, 113549, 1, 1, 10}); 1400| 0| case 0xB84B3: ------------------ | Branch (1400:7): [True: 0, False: 23.2k] ------------------ 1401| 0| return if_match(req, "PKIX.CodeSigning", {1, 3, 6, 1, 5, 5, 7, 3, 3}); 1402| 1.03k| case 0xB8CB9: ------------------ | Branch (1402:7): [True: 1.03k, False: 22.2k] ------------------ 1403| 1.03k| return if_match(req, "GOST-34.10-2012-256", {1, 2, 643, 7, 1, 1, 1, 1}); 1404| 0| case 0xB945C: ------------------ | Branch (1404:7): [True: 0, False: 23.2k] ------------------ 1405| 0| return if_match(req, "Twofish/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 5}); 1406| 0| case 0xB94E4: ------------------ | Branch (1406:7): [True: 0, False: 23.2k] ------------------ 1407| 0| return if_match(req, "gost_512A", {1, 2, 643, 7, 1, 2, 1, 2, 1}); 1408| 0| case 0xB94E5: ------------------ | Branch (1408:7): [True: 0, False: 23.2k] ------------------ 1409| 0| return if_match(req, "gost_512B", {1, 2, 643, 7, 1, 2, 1, 2, 2}); 1410| 0| case 0xBA1D8: ------------------ | Branch (1410:7): [True: 0, False: 23.2k] ------------------ 1411| 0| return if_match(req, "X520.StreetAddress", {2, 5, 4, 9}); 1412| 0| case 0xBCB45: ------------------ | Branch (1412:7): [True: 0, False: 23.2k] ------------------ 1413| 0| return if_match(req, "PKCS12.CRLBag", {1, 2, 840, 113549, 1, 12, 10, 1, 4}); 1414| 0| case 0xBCC82: ------------------ | Branch (1414:7): [True: 0, False: 23.2k] ------------------ 1415| 0| return if_match(req, "x962_p239v1", {1, 2, 840, 10045, 3, 1, 4}); 1416| 0| case 0xBCC83: ------------------ | Branch (1416:7): [True: 0, False: 23.2k] ------------------ 1417| 0| return if_match(req, "x962_p239v2", {1, 2, 840, 10045, 3, 1, 5}); 1418| 0| case 0xBCC84: ------------------ | Branch (1418:7): [True: 0, False: 23.2k] ------------------ 1419| 0| return if_match(req, "x962_p239v3", {1, 2, 840, 10045, 3, 1, 6}); 1420| 0| case 0xBD92B: ------------------ | Branch (1420:7): [True: 0, False: 23.2k] ------------------ 1421| 0| return if_match(req, "X509v3.HoldInstructionCode", {2, 5, 29, 23}); 1422| 0| case 0xBDCA9: ------------------ | Branch (1422:7): [True: 0, False: 23.2k] ------------------ 1423| 0| return if_match(req, "AES-256/GCM", {2, 16, 840, 1, 101, 3, 4, 1, 46}); 1424| 0| case 0xBE48D: ------------------ | Branch (1424:7): [True: 0, False: 23.2k] ------------------ 1425| 0| return if_match(req, "PKIX.OCSP.BasicResponse", {1, 3, 6, 1, 5, 5, 7, 48, 1, 1}); 1426| 0| case 0xBF71E: ------------------ | Branch (1426:7): [True: 0, False: 23.2k] ------------------ 1427| 0| return if_match(req, "Kyber-1024-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 7, 3}); 1428| 0| case 0xBFF01: ------------------ | Branch (1428:7): [True: 0, False: 23.2k] ------------------ 1429| 0| return if_match(req, "DSA/SHA-3(224)", {2, 16, 840, 1, 101, 3, 4, 3, 5}); 1430| 0| case 0xC0F4F: ------------------ | Branch (1430:7): [True: 0, False: 23.2k] ------------------ 1431| 0| return if_match(req, "SphincsPlus-haraka-256f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 6}); 1432| 15| case 0xC1875: ------------------ | Branch (1432:7): [True: 15, False: 23.2k] ------------------ 1433| 15| return if_match(req, "SHA-1", {1, 3, 14, 3, 2, 26}); 1434| 87| case 0xC28D1: ------------------ | Branch (1434:7): [True: 87, False: 23.1k] ------------------ 1435| 87| return if_match(req, "PKIX.OCSPSigning", {1, 3, 6, 1, 5, 5, 7, 3, 9}); 1436| 0| case 0xC42CA: ------------------ | Branch (1436:7): [True: 0, False: 23.2k] ------------------ 1437| 0| return if_match(req, "brainpool256r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 7}); 1438| 0| default: ------------------ | Branch (1438:7): [True: 0, False: 23.2k] ------------------ 1439| 0| return {}; 1440| 23.2k| } 1441| 23.2k|} _ZN5Botan7OID_Map16load_oid2str_mapEv: 1443| 1|std::unordered_map OID_Map::load_oid2str_map() { 1444| 1| return { 1445| 1| {OID{2, 5, 8, 1, 1}, "RSA"}, 1446| 1| {OID{1, 3, 6, 1, 4, 1, 8301, 3, 1, 2, 9, 0, 38}, "secp521r1"}, 1447| 1| {OID{1, 2, 643, 2, 2, 35, 1}, "gost_256A"}, 1448| 1| {OID{1, 2, 643, 2, 2, 36, 0}, "gost_256A"}, 1449| 1| }; 1450| 1|} _ZN5Botan7OID_Map16load_str2oid_mapEv: 1452| 1|std::unordered_map OID_Map::load_str2oid_map() { 1453| 1| return { 1454| 1| {"Curve25519", OID{1, 3, 101, 110}}, 1455| 1| {"SM2_Sig", OID{1, 2, 156, 10197, 1, 301, 1}}, 1456| 1| {"RSA/EMSA3(MD2)", OID{1, 2, 840, 113549, 1, 1, 2}}, 1457| 1| {"RSA/EMSA3(MD5)", OID{1, 2, 840, 113549, 1, 1, 4}}, 1458| 1| {"RSA/EMSA3(SHA-1)", OID{1, 2, 840, 113549, 1, 1, 5}}, 1459| 1| {"RSA/EMSA3(SHA-256)", OID{1, 2, 840, 113549, 1, 1, 11}}, 1460| 1| {"RSA/EMSA3(SHA-384)", OID{1, 2, 840, 113549, 1, 1, 12}}, 1461| 1| {"RSA/EMSA3(SHA-512)", OID{1, 2, 840, 113549, 1, 1, 13}}, 1462| 1| {"RSA/EMSA3(SHA-224)", OID{1, 2, 840, 113549, 1, 1, 14}}, 1463| 1| {"RSA/EMSA3(SHA-512-256)", OID{1, 2, 840, 113549, 1, 1, 16}}, 1464| 1| {"RSA/EMSA3(SHA-3(224))", OID{2, 16, 840, 1, 101, 3, 4, 3, 13}}, 1465| 1| {"RSA/EMSA3(SHA-3(256))", OID{2, 16, 840, 1, 101, 3, 4, 3, 14}}, 1466| 1| {"RSA/EMSA3(SHA-3(384))", OID{2, 16, 840, 1, 101, 3, 4, 3, 15}}, 1467| 1| {"RSA/EMSA3(SHA-3(512))", OID{2, 16, 840, 1, 101, 3, 4, 3, 16}}, 1468| 1| {"RSA/EMSA3(SM3)", OID{1, 2, 156, 10197, 1, 504}}, 1469| 1| {"RSA/EMSA3(RIPEMD-160)", OID{1, 3, 36, 3, 3, 1, 2}}, 1470| 1| {"RSA/EMSA4", OID{1, 2, 840, 113549, 1, 1, 10}}, 1471| 1| {"PBES2", OID{1, 2, 840, 113549, 1, 5, 13}}, 1472| 1| }; 1473| 1|} static_oids.cpp:_ZN5Botan12_GLOBAL__N_18if_matchERKNS_3OIDESt16initializer_listIjENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEE: 18| 8.19k|std::optional if_match(const OID& oid, std::initializer_list val, std::string_view name) { 19| 8.19k| if(oid.matches(val)) { ------------------ | Branch (19:7): [True: 7.84k, False: 350] ------------------ 20| 7.84k| return name; 21| 7.84k| } else { 22| 350| return {}; 23| 350| } 24| 8.19k|} static_oids.cpp:_ZN5Botan12_GLOBAL__N_113hash_oid_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 34| 23.2k|uint32_t hash_oid_name(std::string_view s) { 35| 23.2k| uint64_t hash = 0x8188B31879A4879A; 36| | 37| 523k| for(const char c : s) { ------------------ | Branch (37:21): [True: 523k, False: 23.2k] ------------------ 38| 523k| hash *= 251; 39| 523k| hash += c; 40| 523k| } 41| | 42| 23.2k| return static_cast(hash % 805289); 43| 23.2k|} static_oids.cpp:_ZN5Botan12_GLOBAL__N_18if_matchENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_St16initializer_listIjE: 26| 23.2k|std::optional if_match(std::string_view req, std::string_view actual, std::initializer_list oid) { 27| 23.2k| if(req == actual) { ------------------ | Branch (27:7): [True: 23.2k, False: 0] ------------------ 28| 23.2k| return OID(oid); 29| 23.2k| } else { 30| 0| return {}; 31| 0| } 32| 23.2k|} _ZN5Botan20Buffered_Computation9update_beEj: 24| 9|void Buffered_Computation::update_be(uint32_t val) { 25| 9| uint8_t inb[sizeof(val)]; 26| 9| store_be(val, inb); 27| 9| add_data({inb, sizeof(inb)}); 28| 9|} _ZN5Botan20Buffered_Computation5finalENSt3__14spanIhLm18446744073709551615EEE: 54| 47.6k|void Buffered_Computation::final(std::span out) { 55| 47.6k| BOTAN_ARG_CHECK(out.size() >= output_length(), "Output buffer has insufficient capacity"); ------------------ | | 35| 47.6k| do { \ | | 36| 47.6k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 47.6k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 47.6k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 47.6k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 47.6k] | | ------------------ ------------------ 56| | // Pass exactly output_length() bytes so that an oversized buffer has the 57| | // result written to its leading bytes with the remainder left untouched. 58| 47.6k| final_result(out.first(output_length())); 59| 47.6k|} _ZN5Botan13base64_decodeEPhPKcmb: 208| 1.07k|size_t base64_decode(uint8_t output[], const char input[], size_t input_length, bool ignore_ws) { 209| 1.07k|#if defined(BOTAN_HAS_BASE64_AVX512) 210| 1.07k| if(input_length >= 128 && CPUID::has(CPUID::Feature::AVX512, CPUID::Feature::POPCNT)) { ------------------ | Branch (210:7): [True: 940, False: 135] | Branch (210:30): [True: 0, False: 940] ------------------ 211| | // Decoding directly stops at the first block containing whitespace, 212| | // padding, or an invalid character 213| 0| const uint8_t* in8 = as_span_of_bytes(input, input_length).data(); 214| 0| const size_t bulk = base64_decode_avx512(output, in8, input_length); 215| 0| size_t written = bulk / 4 * 3; 216| | 217| 0| const uint8_t* rest = in8 + bulk; 218| 0| size_t rest_len = input_length - bulk; 219| | 220| | // If the stop may have been due to whitespace, compact the remainder 221| | // and continue decoding 222| 0| secure_vector compacted; 223| 0| if(ignore_ws && rest_len > 128) { ------------------ | Branch (223:10): [True: 0, False: 0] | Branch (223:23): [True: 0, False: 0] ------------------ 224| 0| compacted.resize(rest_len); 225| 0| const size_t clean_len = base64_strip_ws_avx512(compacted.data(), rest, rest_len); 226| 0| rest = compacted.data(); 227| 0| rest_len = clean_len; 228| | 229| 0| const size_t bulk2 = base64_decode_avx512(output + written, rest, rest_len); 230| 0| written += bulk2 / 4 * 3; 231| 0| rest += bulk2; 232| 0| rest_len -= bulk2; 233| 0| } 234| | 235| | // The scalar decoder handles the final blocks, and with them all of 236| | // the padding logic and error reporting 237| 0| const size_t tail_written = 238| 0| base_decode_full(Base64(), output + written, cast_uint8_ptr_to_char(rest), rest_len, ignore_ws); 239| | 240| 0| return written + tail_written; 241| 0| } 242| 1.07k|#endif 243| | 244| 1.07k| return base_decode_full(Base64(), output, input, input_length, ignore_ws); 245| 1.07k|} _ZN5Botan13base64_decodeEPKcmb: 258| 1.07k|secure_vector base64_decode(const char input[], size_t input_length, bool ignore_ws) { 259| 1.07k| secure_vector bin(Base64::decode_max_output(input_length)); 260| 1.07k| const size_t written = base64_decode(bin.data(), input, input_length, ignore_ws); 261| 1.07k| bin.resize(written); 262| 1.07k| return bin; 263| 1.07k|} base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6417decode_max_outputEm: 49| 2.15k| static constexpr size_t decode_max_output(size_t input_length) { 50| | // Cannot overflow since each block shrinks when decoded 51| 2.15k| return ceil_division(input_length, m_encoding_bytes_out) * m_encoding_bytes_in; 52| 2.15k| } base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6413bits_consumedEv: 40| 934| static constexpr size_t bits_consumed() noexcept { return m_encoding_bits; } base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6419lookup_binary_valueEc: 118| 758k|uint8_t Base64::lookup_binary_value(char input) noexcept { 119| 758k| const auto has_zero_byte = [](uint64_t v) { return ((v - 0x0101010101010101) & ~(v) & 0x8080808080808080); }; 120| | 121| | // Assumes each byte is either 0x00 or 0x80 122| 758k| const auto index_of_first_set_byte = [](uint64_t v) { 123| 758k| return ((((v - 1) & 0x0101010101010101) * 0x0101010101010101) >> 56) - 1; 124| 758k| }; 125| | 126| 758k| constexpr uint64_t lo = 0x0101010101010101; 127| | 128| 758k| const uint8_t x = static_cast(input); 129| | 130| 758k| const uint64_t x8 = x * lo; 131| | 132| | // Defines the valid ASCII ranges of base64, except the special chars (below) 133| 758k| constexpr uint64_t val_l = make_uint64(0, 0, 0, 0, 0, 'A', 'a', '0'); 134| 758k| constexpr uint64_t val_u = make_uint64(0, 0, 0, 0, 0, 26, 26, 10); 135| | 136| | // If x is in one of the ranges return a mask. Otherwise we xor in at the 137| | // high word which will be our invalid marker 138| 758k| const auto v_mask = swar_in_range(x8, val_l, val_u) ^ 0x80000000; 139| | 140| | // This is the offset added to x to get the value 141| 758k| const uint64_t val_v = 0xbfb904 ^ (0xFF000000 - (x << 24)); 142| | 143| 758k| const uint8_t z = x + static_cast(val_v >> (8 * index_of_first_set_byte(v_mask))); 144| | 145| | // Valid base64 special characters, and some whitespace chars 146| 758k| constexpr uint64_t specials_i = make_uint64(0, '+', '/', '=', ' ', '\n', '\t', '\r'); 147| | 148| 758k| const uint64_t specials_v = 0x3e3f8180808080 ^ (static_cast(z) << 56); 149| | 150| 758k| const uint64_t smask = has_zero_byte(x8 ^ specials_i) ^ 0x8000000000000000; 151| | 152| 758k| return static_cast(specials_v >> (8 * index_of_first_set_byte(smask))); 153| 758k|} base64.cpp:_ZZN5Botan12_GLOBAL__N_16Base6419lookup_binary_valueEcENK3$_0clEm: 122| 1.51M| const auto index_of_first_set_byte = [](uint64_t v) { 123| 1.51M| return ((((v - 1) & 0x0101010101010101) * 0x0101010101010101) >> 56) - 1; 124| 1.51M| }; base64.cpp:_ZZN5Botan12_GLOBAL__N_16Base6419lookup_binary_valueEcENK3$_1clEm: 119| 758k| const auto has_zero_byte = [](uint64_t v) { return ((v - 0x0101010101010101) & ~(v) & 0x8080808080808080); }; base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6414check_bad_charEhcb: 156| 749k|bool Base64::check_bad_char(uint8_t bin, char input, bool ignore_ws) { 157| 749k| if(bin <= 0x3F) { ------------------ | Branch (157:7): [True: 714k, False: 35.4k] ------------------ 158| 714k| return true; 159| 714k| } else if(!(bin == 0x81 || (bin == 0x80 && ignore_ws))) { ------------------ | Branch (159:16): [True: 727, False: 34.6k] | Branch (159:32): [True: 34.6k, False: 54] | Branch (159:47): [True: 34.6k, False: 0] ------------------ 160| 54| throw Invalid_Argument(fmt("base64_decode: invalid character '{}'", format_char_for_display(input))); 161| 54| } 162| 35.3k| return false; 163| 749k|} base64.cpp:_ZN5Botan12_GLOBAL__N_16Base644nameEv: 30| 29| static std::string name() { return "base64"; } base64.cpp:_ZN5Botan12_GLOBAL__N_16Base646decodeEPhPKh: 60| 178k| static void decode(uint8_t* out_ptr, const uint8_t decode_buf[4]) { 61| 178k| out_ptr[0] = (decode_buf[0] << 2) | (decode_buf[1] >> 4); 62| 178k| out_ptr[1] = (decode_buf[1] << 4) | (decode_buf[2] >> 2); 63| 178k| out_ptr[2] = (decode_buf[2] << 6) | decode_buf[3]; 64| 178k| } base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6415bytes_to_removeEm: 66| 1.01k| static size_t bytes_to_remove(size_t final_truncate) { return final_truncate; } _ZN5Botan10hex_encodeEPcPKhmb: 34| 19.0k|void hex_encode(char output[], const uint8_t input[], size_t input_length, bool uppercase) { 35| 514k| for(size_t i = 0; i != input_length; ++i) { ------------------ | Branch (35:22): [True: 495k, False: 19.0k] ------------------ 36| 495k| const uint16_t h = hex_encode_2nibble(input[i], uppercase); 37| 495k| output[2 * i] = get_byte<0>(h); 38| 495k| output[2 * i + 1] = get_byte<1>(h); 39| 495k| } 40| 19.0k|} _ZN5Botan10hex_encodeEPKhmb: 42| 19.0k|std::string hex_encode(const uint8_t input[], size_t input_length, bool uppercase) { 43| 19.0k| const size_t output_length = mul_or_throw(2, input_length, "Input too large to hex encode"); 44| 19.0k| std::string output(output_length, 0); 45| | 46| 19.0k| if(input_length > 0) { ------------------ | Branch (46:7): [True: 19.0k, False: 0] ------------------ 47| 19.0k| hex_encode(&output.front(), input, input_length, uppercase); 48| 19.0k| } 49| | 50| 19.0k| return output; 51| 19.0k|} _ZN5Botan10hex_decodeEPhPKcmRmb: 75| 1.89k|size_t hex_decode(uint8_t output[], const char input[], size_t input_length, size_t& input_consumed, bool ignore_ws) { 76| 1.89k| uint8_t* out_ptr = output; 77| 1.89k| bool top_nibble = true; 78| 1.89k| uint8_t next = 0; 79| | 80| 1.89k| input_consumed = 0; 81| | 82| 1.89k| clear_mem(output, input_length / 2); 83| | 84| 84.8k| for(size_t i = 0; i != input_length; ++i) { ------------------ | Branch (84:22): [True: 82.9k, False: 1.89k] ------------------ 85| 82.9k| const uint8_t bin = hex_char_to_bin(input[i]); 86| | 87| 82.9k| if(bin >= 0x10) { ------------------ | Branch (87:10): [True: 0, False: 82.9k] ------------------ 88| 0| if(bin == 0x80 && ignore_ws) { ------------------ | Branch (88:13): [True: 0, False: 0] | Branch (88:28): [True: 0, False: 0] ------------------ 89| 0| continue; 90| 0| } 91| | 92| 0| throw Invalid_Argument(fmt("hex_decode: invalid character '{}'", format_char_for_display(input[i]))); 93| 0| } 94| | 95| 82.9k| if(top_nibble) { ------------------ | Branch (95:10): [True: 41.4k, False: 41.4k] ------------------ 96| 41.4k| next = bin << 4; 97| 41.4k| } else { 98| 41.4k| next |= bin; 99| 41.4k| *out_ptr = next; 100| 41.4k| } 101| | 102| 82.9k| top_nibble = !top_nibble; 103| 82.9k| if(top_nibble) { ------------------ | Branch (103:10): [True: 41.4k, False: 41.4k] ------------------ 104| 41.4k| ++out_ptr; 105| 41.4k| input_consumed = i + 1; 106| 41.4k| } 107| 82.9k| } 108| | 109| | /* 110| | * Consume trailing whitespace following the last full byte; a leftover 111| | * unpaired nibble (if any) stops the scan and is left unconsumed. 112| | */ 113| 1.89k| while(input_consumed < input_length && hex_char_to_bin(input[input_consumed]) == 0x80) { ------------------ | Branch (113:10): [True: 0, False: 1.89k] | Branch (113:43): [True: 0, False: 0] ------------------ 114| 0| ++input_consumed; 115| 0| } 116| | 117| 1.89k| return (out_ptr - output); 118| 1.89k|} _ZN5Botan10hex_decodeEPhPKcmb: 120| 1.89k|size_t hex_decode(uint8_t output[], const char input[], size_t input_length, bool ignore_ws) { 121| 1.89k| size_t consumed = 0; 122| 1.89k| const size_t written = hex_decode(output, input, input_length, consumed, ignore_ws); 123| | 124| 1.89k| if(consumed != input_length) { ------------------ | Branch (124:7): [True: 0, False: 1.89k] ------------------ 125| 0| throw Invalid_Argument("hex_decode: input did not have full bytes"); 126| 0| } 127| | 128| 1.89k| return written; 129| 1.89k|} _ZN5Botan17hex_decode_lockedEPKcmb: 142| 1.89k|secure_vector hex_decode_locked(const char input[], size_t input_length, bool ignore_ws) { 143| 1.89k| secure_vector bin(1 + input_length / 2); 144| | 145| 1.89k| const size_t written = hex_decode(bin.data(), input, input_length, ignore_ws); 146| | 147| 1.89k| bin.resize(written); 148| 1.89k| return bin; 149| 1.89k|} _ZN5Botan17hex_decode_lockedENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEb: 151| 1.56k|secure_vector hex_decode_locked(std::string_view input, bool ignore_ws) { 152| 1.56k| return hex_decode_locked(input.data(), input.size(), ignore_ws); 153| 1.56k|} hex.cpp:_ZN5Botan12_GLOBAL__N_118hex_encode_2nibbleEhb: 21| 495k|uint16_t hex_encode_2nibble(uint8_t n8, bool uppercase) { 22| | // Offset for upper or lower case 'a' resp 23| 495k| const uint16_t a_mask = uppercase ? 0x0707 : 0x2727; ------------------ | Branch (23:28): [True: 495k, False: 0] ------------------ 24| | 25| 495k| const uint16_t n = (static_cast(n8 & 0xF0) << 4) | (n8 & 0x0F); 26| | // n >= 10? If so add offset 27| 495k| const uint16_t diff = swar_lt(0x0909, n) & a_mask; 28| | // Can't overflow between bytes, so don't need explicit SWAR addition: 29| 495k| return n + 0x3030 + diff; 30| 495k|} hex.cpp:_ZN5Botan12_GLOBAL__N_115hex_char_to_binEc: 55| 82.9k|uint8_t hex_char_to_bin(char input) { 56| | // Starts of valid value ranges (v_lo) and their lengths (v_range) 57| 82.9k| constexpr uint64_t v_lo = make_uint64(0, '0', 'a', 'A', ' ', '\n', '\t', '\r'); 58| 82.9k| constexpr uint64_t v_range = make_uint64(0, 10, 6, 6, 1, 1, 1, 1); 59| 82.9k| constexpr uint64_t expand8 = 0x0101010101010101; 60| 82.9k| constexpr uint64_t top64 = 0x8000000000000000; 61| | 62| 82.9k| const uint8_t x = static_cast(input); 63| 82.9k| const uint64_t x8 = x * expand8; 64| | 65| 82.9k| const uint64_t v_mask = swar_in_range(x8, v_lo, v_range) ^ top64; 66| | 67| | // This is the offset added to x to get the value we need 68| 82.9k| const uint64_t val_v = 0xd0a9c960767773 ^ static_cast(0xFF - x) << 56; 69| | 70| 82.9k| return x + static_cast(val_v >> (8 * index_of_first_set_byte(v_mask))); 71| 82.9k|} _ZN5Botan12HashFunction6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 112| 20.4k|std::unique_ptr HashFunction::create(std::string_view algo_spec, std::string_view provider) { 113| |#if defined(BOTAN_HAS_COMMONCRYPTO) 114| | if(provider.empty() || provider == "commoncrypto") { 115| | if(auto hash = make_commoncrypto_hash(algo_spec)) 116| | return hash; 117| | 118| | if(!provider.empty()) 119| | return nullptr; 120| | } 121| |#endif 122| | 123| 20.4k| if(provider.empty() == false && provider != "base") { ------------------ | Branch (123:7): [True: 0, False: 20.4k] | Branch (123:36): [True: 0, False: 0] ------------------ 124| 0| return nullptr; // unknown provider 125| 0| } 126| | 127| 20.4k|#if defined(BOTAN_HAS_SHA1) 128| 20.4k| if(algo_spec == "SHA-1") { ------------------ | Branch (128:7): [True: 9.56k, False: 10.9k] ------------------ 129| 9.56k| return std::make_unique(); 130| 9.56k| } 131| 10.9k|#endif 132| | 133| 10.9k|#if defined(BOTAN_HAS_SHA2_32) 134| 10.9k| if(algo_spec == "SHA-224") { ------------------ | Branch (134:7): [True: 174, False: 10.7k] ------------------ 135| 174| return std::make_unique(); 136| 174| } 137| | 138| 10.7k| if(algo_spec == "SHA-256") { ------------------ | Branch (138:7): [True: 10.0k, False: 728] ------------------ 139| 10.0k| return std::make_unique(); 140| 10.0k| } 141| 728|#endif 142| | 143| 728|#if defined(BOTAN_HAS_SHA2_64) 144| 728| if(algo_spec == "SHA-384") { ------------------ | Branch (144:7): [True: 376, False: 352] ------------------ 145| 376| return std::make_unique(); 146| 376| } 147| | 148| 352| if(algo_spec == "SHA-512") { ------------------ | Branch (148:7): [True: 86, False: 266] ------------------ 149| 86| return std::make_unique(); 150| 86| } 151| | 152| 266| if(algo_spec == "SHA-512-256") { ------------------ | Branch (152:7): [True: 0, False: 266] ------------------ 153| 0| return std::make_unique(); 154| 0| } 155| 266|#endif 156| | 157| 266|#if defined(BOTAN_HAS_RIPEMD_160) 158| 266| if(algo_spec == "RIPEMD-160") { ------------------ | Branch (158:7): [True: 0, False: 266] ------------------ 159| 0| return std::make_unique(); 160| 0| } 161| 266|#endif 162| | 163| 266|#if defined(BOTAN_HAS_WHIRLPOOL) 164| 266| if(algo_spec == "Whirlpool") { ------------------ | Branch (164:7): [True: 0, False: 266] ------------------ 165| 0| return std::make_unique(); 166| 0| } 167| 266|#endif 168| | 169| 266|#if defined(BOTAN_HAS_MD5) 170| 266| if(algo_spec == "MD5") { ------------------ | Branch (170:7): [True: 0, False: 266] ------------------ 171| 0| return std::make_unique(); 172| 0| } 173| 266|#endif 174| | 175| 266|#if defined(BOTAN_HAS_MD4) 176| 266| if(algo_spec == "MD4") { ------------------ | Branch (176:7): [True: 0, False: 266] ------------------ 177| 0| return std::make_unique(); 178| 0| } 179| 266|#endif 180| | 181| 266|#if defined(BOTAN_HAS_GOST_34_11) 182| 266| if(algo_spec == "GOST-R-34.11-94" || algo_spec == "GOST-34.11") { ------------------ | Branch (182:7): [True: 0, False: 266] | Branch (182:41): [True: 0, False: 266] ------------------ 183| 0| return std::make_unique(); 184| 0| } 185| 266|#endif 186| | 187| 266|#if defined(BOTAN_HAS_ADLER32) 188| 266| if(algo_spec == "Adler32") { ------------------ | Branch (188:7): [True: 0, False: 266] ------------------ 189| 0| return std::make_unique(); 190| 0| } 191| 266|#endif 192| | 193| 266|#if defined(BOTAN_HAS_ASCON_HASH256) 194| 266| if(algo_spec == "Ascon-Hash256") { ------------------ | Branch (194:7): [True: 0, False: 266] ------------------ 195| 0| return std::make_unique(); 196| 0| } 197| 266|#endif 198| | 199| 266|#if defined(BOTAN_HAS_CRC24) 200| 266| if(algo_spec == "CRC24") { ------------------ | Branch (200:7): [True: 0, False: 266] ------------------ 201| 0| return std::make_unique(); 202| 0| } 203| 266|#endif 204| | 205| 266|#if defined(BOTAN_HAS_CRC32) 206| 266| if(algo_spec == "CRC32") { ------------------ | Branch (206:7): [True: 0, False: 266] ------------------ 207| 0| return std::make_unique(); 208| 0| } 209| 266|#endif 210| | 211| 266|#if defined(BOTAN_HAS_STREEBOG) 212| 266| if(algo_spec == "Streebog-256") { ------------------ | Branch (212:7): [True: 266, False: 0] ------------------ 213| 266| return std::make_unique(256); 214| 266| } 215| 0| if(algo_spec == "Streebog-512") { ------------------ | Branch (215:7): [True: 0, False: 0] ------------------ 216| 0| return std::make_unique(512); 217| 0| } 218| 0|#endif 219| | 220| 0|#if defined(BOTAN_HAS_SM3) 221| 0| if(algo_spec == "SM3") { ------------------ | Branch (221:7): [True: 0, False: 0] ------------------ 222| 0| return std::make_unique(); 223| 0| } 224| 0|#endif 225| | 226| 0| const AlgorithmSpec req(algo_spec); 227| | 228| 0|#if defined(BOTAN_HAS_SKEIN_512) 229| 0| if(auto m = req.match("Skein-512({bits:int=512},{personalization:str=})")) { ------------------ | Branch (229:12): [True: 0, False: 0] ------------------ 230| 0| return std::make_unique(m->integer("bits"), m->str("personalization")); 231| 0| } 232| 0|#endif 233| | 234| 0|#if defined(BOTAN_HAS_BLAKE2B) 235| 0| if(auto m = req.match("BLAKE2b|Blake2b({bits:int=512})")) { ------------------ | Branch (235:12): [True: 0, False: 0] ------------------ 236| 0| return std::make_unique(m->integer("bits")); 237| 0| } 238| 0|#endif 239| | 240| 0|#if defined(BOTAN_HAS_BLAKE2S) 241| 0| if(auto m = req.match("BLAKE2s|Blake2s({bits:int=256})")) { ------------------ | Branch (241:12): [True: 0, False: 0] ------------------ 242| 0| return std::make_unique(m->integer("bits")); 243| 0| } 244| 0|#endif 245| | 246| 0|#if defined(BOTAN_HAS_KECCAK) 247| 0| if(auto m = req.match("Keccak-1600({bits:int=512})")) { ------------------ | Branch (247:12): [True: 0, False: 0] ------------------ 248| 0| return std::make_unique(m->integer("bits")); 249| 0| } 250| 0|#endif 251| | 252| 0|#if defined(BOTAN_HAS_SHA3) 253| 0| if(auto m = req.match("SHA-3({bits:int=512})")) { ------------------ | Branch (253:12): [True: 0, False: 0] ------------------ 254| 0| return std::make_unique(m->integer("bits")); 255| 0| } 256| 0|#endif 257| | 258| 0|#if defined(BOTAN_HAS_SHAKE) 259| 0| if(auto m = req.match("SHAKE-128({bits:int})")) { ------------------ | Branch (259:12): [True: 0, False: 0] ------------------ 260| 0| return std::make_unique(m->integer("bits")); 261| 0| } 262| 0| if(auto m = req.match("SHAKE-256({bits:int})")) { ------------------ | Branch (262:12): [True: 0, False: 0] ------------------ 263| 0| return std::make_unique(m->integer("bits")); 264| 0| } 265| 0|#endif 266| | 267| 0|#if defined(BOTAN_HAS_PARALLEL_HASH) 268| 0| if(auto m = req.match("Parallel({hash}...)")) { ------------------ | Branch (268:12): [True: 0, False: 0] ------------------ 269| 0| std::vector> hashes; 270| | 271| 0| for(const auto& hash_spec : m->rest("hash")) { ------------------ | Branch (271:33): [True: 0, False: 0] ------------------ 272| 0| auto h = HashFunction::create(hash_spec.to_string()); 273| 0| if(!h) { ------------------ | Branch (273:13): [True: 0, False: 0] ------------------ 274| 0| return nullptr; 275| 0| } 276| 0| hashes.push_back(std::move(h)); 277| 0| } 278| | 279| 0| return std::make_unique(hashes); 280| 0| } 281| 0|#endif 282| | 283| 0|#if defined(BOTAN_HAS_TRUNCATED_HASH) 284| 0| if(auto m = req.match("Truncated({hash},{bits:int})")) { ------------------ | Branch (284:12): [True: 0, False: 0] ------------------ 285| 0| auto hash = HashFunction::create(m->str("hash")); 286| 0| if(!hash) { ------------------ | Branch (286:10): [True: 0, False: 0] ------------------ 287| 0| return nullptr; 288| 0| } 289| | 290| 0| return std::make_unique(std::move(hash), m->integer("bits")); 291| 0| } 292| 0|#endif 293| | 294| 0|#if defined(BOTAN_HAS_COMB4P) 295| 0| if(auto m = req.match("Comb4P({hash1},{hash2})")) { ------------------ | Branch (295:12): [True: 0, False: 0] ------------------ 296| 0| auto h1 = HashFunction::create(m->str("hash1")); 297| 0| auto h2 = HashFunction::create(m->str("hash2")); 298| | 299| 0| if(h1 && h2) { ------------------ | Branch (299:10): [True: 0, False: 0] | Branch (299:16): [True: 0, False: 0] ------------------ 300| 0| return std::make_unique(std::move(h1), std::move(h2)); 301| 0| } 302| 0| } 303| 0|#endif 304| | 305| 0| BOTAN_UNUSED(req); ------------------ | | 151| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 306| | 307| 0| return nullptr; 308| 0|} _ZN5Botan12HashFunction15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 311| 10.6k|std::unique_ptr HashFunction::create_or_throw(std::string_view algo, std::string_view provider) { 312| 10.6k| if(auto hash = HashFunction::create(algo, provider)) { ------------------ | Branch (312:12): [True: 10.6k, False: 0] ------------------ 313| 10.6k| return hash; 314| 10.6k| } 315| 0| throw Lookup_Error("Hash", algo, provider); 316| 10.6k|} _ZN5Botan5SHA_110compress_nERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 24| 63.4k|void SHA_1::compress_n(digest_type& digest, std::span input, size_t blocks) { 25| 63.4k| using namespace SHA1_F; 26| | 27| 63.4k|#if defined(BOTAN_HAS_SHA1_X86_SHA_NI) 28| 63.4k| if(CPUID::has(CPUID::Feature::SHA)) { ------------------ | Branch (28:7): [True: 63.4k, False: 0] ------------------ 29| 63.4k| return sha1_compress_x86(digest, input, blocks); 30| 63.4k| } 31| 0|#endif 32| | 33| |#if defined(BOTAN_HAS_SHA1_ARMV8) 34| | if(CPUID::has(CPUID::Feature::SHA1)) { 35| | return sha1_armv8_compress_n(digest, input, blocks); 36| | } 37| |#endif 38| | 39| 0|#if defined(BOTAN_HAS_SHA1_AVX2) 40| 0| if(CPUID::has(CPUID::Feature::AVX2, CPUID::Feature::BMI)) { ------------------ | Branch (40:7): [True: 0, False: 0] ------------------ 41| 0| return avx2_compress_n(digest, input, blocks); 42| 0| } 43| 0|#endif 44| | 45| 0|#if defined(BOTAN_HAS_SHA1_SIMD_4X32) 46| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (46:7): [True: 0, False: 0] ------------------ 47| 0| return simd_compress_n(digest, input, blocks); 48| 0| } 49| 0|#endif 50| | 51| 0| uint32_t A = digest[0]; 52| 0| uint32_t B = digest[1]; 53| 0| uint32_t C = digest[2]; 54| 0| uint32_t D = digest[3]; 55| 0| uint32_t E = digest[4]; 56| 0| std::array W{}; 57| 0| auto W_in = std::span{W}.first(); 58| | 59| 0| BufferSlicer in(input); 60| | 61| 0| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (61:22): [True: 0, False: 0] ------------------ 62| 0| load_be(W_in, in.take()); 63| | 64| | // clang-format off 65| | 66| 0| for(size_t j = 16; j != 80; j += 8) { ------------------ | Branch (66:26): [True: 0, False: 0] ------------------ 67| 0| W[j + 0] = rotl<1>(W[j - 3] ^ W[j - 8] ^ W[j - 14] ^ W[j - 16]); 68| 0| W[j + 1] = rotl<1>(W[j - 2] ^ W[j - 7] ^ W[j - 13] ^ W[j - 15]); 69| 0| W[j + 2] = rotl<1>(W[j - 1] ^ W[j - 6] ^ W[j - 12] ^ W[j - 14]); 70| 0| W[j + 3] = rotl<1>(W[j ] ^ W[j - 5] ^ W[j - 11] ^ W[j - 13]); 71| 0| W[j + 4] = rotl<1>(W[j + 1] ^ W[j - 4] ^ W[j - 10] ^ W[j - 12]); 72| 0| W[j + 5] = rotl<1>(W[j + 2] ^ W[j - 3] ^ W[j - 9] ^ W[j - 11]); 73| 0| W[j + 6] = rotl<1>(W[j + 3] ^ W[j - 2] ^ W[j - 8] ^ W[j - 10]); 74| 0| W[j + 7] = rotl<1>(W[j + 4] ^ W[j - 1] ^ W[j - 7] ^ W[j - 9]); 75| 0| } 76| | 77| | // clang-format on 78| | 79| 0| F1(A, B, C, D, E, W[0] + K1); 80| 0| F1(E, A, B, C, D, W[1] + K1); 81| 0| F1(D, E, A, B, C, W[2] + K1); 82| 0| F1(C, D, E, A, B, W[3] + K1); 83| 0| F1(B, C, D, E, A, W[4] + K1); 84| 0| F1(A, B, C, D, E, W[5] + K1); 85| 0| F1(E, A, B, C, D, W[6] + K1); 86| 0| F1(D, E, A, B, C, W[7] + K1); 87| 0| F1(C, D, E, A, B, W[8] + K1); 88| 0| F1(B, C, D, E, A, W[9] + K1); 89| 0| F1(A, B, C, D, E, W[10] + K1); 90| 0| F1(E, A, B, C, D, W[11] + K1); 91| 0| F1(D, E, A, B, C, W[12] + K1); 92| 0| F1(C, D, E, A, B, W[13] + K1); 93| 0| F1(B, C, D, E, A, W[14] + K1); 94| 0| F1(A, B, C, D, E, W[15] + K1); 95| 0| F1(E, A, B, C, D, W[16] + K1); 96| 0| F1(D, E, A, B, C, W[17] + K1); 97| 0| F1(C, D, E, A, B, W[18] + K1); 98| 0| F1(B, C, D, E, A, W[19] + K1); 99| | 100| 0| F2(A, B, C, D, E, W[20] + K2); 101| 0| F2(E, A, B, C, D, W[21] + K2); 102| 0| F2(D, E, A, B, C, W[22] + K2); 103| 0| F2(C, D, E, A, B, W[23] + K2); 104| 0| F2(B, C, D, E, A, W[24] + K2); 105| 0| F2(A, B, C, D, E, W[25] + K2); 106| 0| F2(E, A, B, C, D, W[26] + K2); 107| 0| F2(D, E, A, B, C, W[27] + K2); 108| 0| F2(C, D, E, A, B, W[28] + K2); 109| 0| F2(B, C, D, E, A, W[29] + K2); 110| 0| F2(A, B, C, D, E, W[30] + K2); 111| 0| F2(E, A, B, C, D, W[31] + K2); 112| 0| F2(D, E, A, B, C, W[32] + K2); 113| 0| F2(C, D, E, A, B, W[33] + K2); 114| 0| F2(B, C, D, E, A, W[34] + K2); 115| 0| F2(A, B, C, D, E, W[35] + K2); 116| 0| F2(E, A, B, C, D, W[36] + K2); 117| 0| F2(D, E, A, B, C, W[37] + K2); 118| 0| F2(C, D, E, A, B, W[38] + K2); 119| 0| F2(B, C, D, E, A, W[39] + K2); 120| | 121| 0| F3(A, B, C, D, E, W[40] + K3); 122| 0| F3(E, A, B, C, D, W[41] + K3); 123| 0| F3(D, E, A, B, C, W[42] + K3); 124| 0| F3(C, D, E, A, B, W[43] + K3); 125| 0| F3(B, C, D, E, A, W[44] + K3); 126| 0| F3(A, B, C, D, E, W[45] + K3); 127| 0| F3(E, A, B, C, D, W[46] + K3); 128| 0| F3(D, E, A, B, C, W[47] + K3); 129| 0| F3(C, D, E, A, B, W[48] + K3); 130| 0| F3(B, C, D, E, A, W[49] + K3); 131| 0| F3(A, B, C, D, E, W[50] + K3); 132| 0| F3(E, A, B, C, D, W[51] + K3); 133| 0| F3(D, E, A, B, C, W[52] + K3); 134| 0| F3(C, D, E, A, B, W[53] + K3); 135| 0| F3(B, C, D, E, A, W[54] + K3); 136| 0| F3(A, B, C, D, E, W[55] + K3); 137| 0| F3(E, A, B, C, D, W[56] + K3); 138| 0| F3(D, E, A, B, C, W[57] + K3); 139| 0| F3(C, D, E, A, B, W[58] + K3); 140| 0| F3(B, C, D, E, A, W[59] + K3); 141| | 142| 0| F4(A, B, C, D, E, W[60] + K4); 143| 0| F4(E, A, B, C, D, W[61] + K4); 144| 0| F4(D, E, A, B, C, W[62] + K4); 145| 0| F4(C, D, E, A, B, W[63] + K4); 146| 0| F4(B, C, D, E, A, W[64] + K4); 147| 0| F4(A, B, C, D, E, W[65] + K4); 148| 0| F4(E, A, B, C, D, W[66] + K4); 149| 0| F4(D, E, A, B, C, W[67] + K4); 150| 0| F4(C, D, E, A, B, W[68] + K4); 151| 0| F4(B, C, D, E, A, W[69] + K4); 152| 0| F4(A, B, C, D, E, W[70] + K4); 153| 0| F4(E, A, B, C, D, W[71] + K4); 154| 0| F4(D, E, A, B, C, W[72] + K4); 155| 0| F4(C, D, E, A, B, W[73] + K4); 156| 0| F4(B, C, D, E, A, W[74] + K4); 157| 0| F4(A, B, C, D, E, W[75] + K4); 158| 0| F4(E, A, B, C, D, W[76] + K4); 159| 0| F4(D, E, A, B, C, W[77] + K4); 160| 0| F4(C, D, E, A, B, W[78] + K4); 161| 0| F4(B, C, D, E, A, W[79] + K4); 162| | 163| 0| A = (digest[0] += A); 164| 0| B = (digest[1] += B); 165| 0| C = (digest[2] += C); 166| 0| D = (digest[3] += D); 167| 0| E = (digest[4] += E); 168| 0| } 169| 0|} _ZN5Botan5SHA_14initERNSt3__16vectorIjNS_16secure_allocatorIjEEEE: 174| 47.7k|void SHA_1::init(digest_type& digest) { 175| 47.7k| digest.assign({0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0}); 176| 47.7k|} _ZN5Botan5SHA_18add_dataENSt3__14spanIKhLm18446744073709551615EEE: 214| 38.1k|void SHA_1::add_data(std::span input) { 215| 38.1k| m_md.update(input); 216| 38.1k|} _ZN5Botan5SHA_112final_resultENSt3__14spanIhLm18446744073709551615EEE: 218| 38.1k|void SHA_1::final_result(std::span output) { 219| 38.1k| m_md.final(output); 220| 38.1k|} _ZN5Botan5SHA_117sha1_compress_x86ERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 76| 63.4k| size_t blocks) { 77| 63.4k| const uint8_t* input = input_span.data(); 78| | 79| 63.4k| SIMD_4x32 ABCD = rev_words(SIMD_4x32::load_le(&digest[0])); // NOLINT(*-container-data-pointer) 80| 63.4k| SIMD_4x32 E0 = SIMD_4x32(0, 0, 0, digest[4]); 81| | 82| 214k| while(blocks > 0) { ------------------ | Branch (82:10): [True: 150k, False: 63.4k] ------------------ 83| | // Save current hash 84| 150k| const auto ABCD_SAVE = ABCD; 85| 150k| const auto E0_SAVE = E0; 86| | 87| 150k| auto W0 = rev_words(SIMD_4x32::load_be(input)); 88| 150k| auto W1 = rev_words(SIMD_4x32::load_be(input + 16)); 89| 150k| auto W2 = rev_words(SIMD_4x32::load_be(input + 32)); 90| 150k| auto W3 = rev_words(SIMD_4x32::load_be(input + 48)); 91| | 92| 150k| sha1_x86_first8<0>(ABCD, E0, W0, W1); 93| 150k| sha1_x86_rnds8<0>(ABCD, E0, W2, W3); 94| | 95| 150k| W0 = sha1_x86_msg1(W0, W1); 96| 150k| W1 = sha1_x86_msg1(W1, W2); 97| 150k| W0 ^= W2; 98| | 99| 150k| sha1_x86_next_msg(W3, W0, W1, W2); 100| 150k| sha1_x86_next_msg(W0, W1, W2, W3); 101| 150k| sha1_x86_rnds8<0, 1>(ABCD, E0, W0, W1); 102| | 103| 150k| sha1_x86_next_msg(W1, W2, W3, W0); 104| 150k| sha1_x86_next_msg(W2, W3, W0, W1); 105| 150k| sha1_x86_rnds8<1>(ABCD, E0, W2, W3); 106| | 107| 150k| sha1_x86_next_msg(W3, W0, W1, W2); 108| 150k| sha1_x86_next_msg(W0, W1, W2, W3); 109| 150k| sha1_x86_rnds8<1>(ABCD, E0, W0, W1); 110| | 111| 150k| sha1_x86_next_msg(W1, W2, W3, W0); 112| 150k| sha1_x86_next_msg(W2, W3, W0, W1); 113| 150k| sha1_x86_rnds8<2>(ABCD, E0, W2, W3); 114| | 115| 150k| sha1_x86_next_msg(W3, W0, W1, W2); 116| 150k| sha1_x86_next_msg(W0, W1, W2, W3); 117| 150k| sha1_x86_rnds8<2>(ABCD, E0, W0, W1); 118| | 119| 150k| sha1_x86_next_msg(W1, W2, W3, W0); 120| 150k| sha1_x86_next_msg(W2, W3, W0, W1); 121| 150k| sha1_x86_rnds8<2, 3>(ABCD, E0, W2, W3); 122| | 123| 150k| sha1_x86_next_msg(W3, W0, W1, W2); 124| 150k| sha1_x86_next_msg(W0, W1, W2, W3); 125| 150k| sha1_x86_rnds8<3>(ABCD, E0, W0, W1); 126| | 127| 150k| sha1_x86_next_msg(W1, W2, W3, W0); 128| 150k| sha1_x86_next_msg(W2, W3, W0, W1); 129| 150k| sha1_x86_rnds8<3>(ABCD, E0, W2, W3); 130| | 131| 150k| ABCD += ABCD_SAVE; 132| 150k| E0 = sha1_x86_nexte(E0, E0_SAVE); 133| | 134| 150k| input += 64; 135| 150k| blocks--; 136| 150k| } 137| | 138| 63.4k| rev_words(ABCD).store_le(&digest[0]); // NOLINT(*-container-data-pointer) 139| 63.4k| digest[4] = E0.extract_word<3>(); 140| 63.4k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_19rev_wordsERKNS_9SIMD_4x32E: 66| 730k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI SIMD_4x32 rev_words(const SIMD_4x32& v) { 67| | return SIMD_4x32(_mm_shuffle_epi32(v.raw(), 0b00011011)); 68| 730k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_113sha1_x86_msg1ERKNS_9SIMD_4x32ES3_: 29| 301k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI SIMD_4x32 sha1_x86_msg1(const SIMD_4x32& W0, const SIMD_4x32& W1) { 30| 301k| return SIMD_4x32(_mm_sha1msg1_epu32(W0.raw(), W1.raw())); 31| 301k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_117sha1_x86_next_msgERKNS_9SIMD_4x32ERS1_S4_S4_: 36| 2.41M| SIMD_4x32& W3) { 37| 2.41M| W3 = SIMD_4x32(_mm_sha1msg1_epu32(W3.raw(), W0.raw())); 38| 2.41M| W1 = SIMD_4x32(_mm_sha1msg2_epu32(W1.raw(), W0.raw())); 39| 2.41M| W2 ^= W0; 40| 2.41M|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_nexteERKNS_9SIMD_4x32ES3_: 25| 3.01M|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI SIMD_4x32 sha1_x86_nexte(const SIMD_4x32& x, const SIMD_4x32& y) { 26| 3.01M| return SIMD_4x32(_mm_sha1nexte_epu32(x.raw(), y.raw())); 27| 3.01M|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_115sha1_x86_first8ILh0ELh0EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 46| 150k| const SIMD_4x32& W1) { 47| 150k| const auto TE = ABCD; 48| 150k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), (E + W0).raw(), R1)); 49| | 50| 150k| E = ABCD; 51| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 52| 150k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh0ELh0EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 150k| const SIMD_4x32& W1) { 59| 150k| const auto TE = ABCD; 60| 150k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 150k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 150k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh0ELh1EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 150k| const SIMD_4x32& W1) { 59| 150k| const auto TE = ABCD; 60| 150k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 150k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 150k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh1ELh1EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 301k| const SIMD_4x32& W1) { 59| 301k| const auto TE = ABCD; 60| 301k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 301k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 301k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh2ELh2EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 301k| const SIMD_4x32& W1) { 59| 301k| const auto TE = ABCD; 60| 301k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 301k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 301k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh2ELh3EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 150k| const SIMD_4x32& W1) { 59| 150k| const auto TE = ABCD; 60| 150k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 150k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 150k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh3ELh3EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 301k| const SIMD_4x32& W1) { 59| 301k| const auto TE = ABCD; 60| 301k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 301k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 301k|} _ZN5Botan7SHA_25615compress_digestERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 59| 64.8k| size_t blocks) { 60| 64.8k|#if defined(BOTAN_HAS_SHA2_32_X86) 61| 64.8k| if(CPUID::has(CPUID::Feature::SHA)) { ------------------ | Branch (61:7): [True: 64.8k, False: 0] ------------------ 62| 64.8k| return SHA_256::compress_digest_x86(digest, input, blocks); 63| 64.8k| } 64| 0|#endif 65| | 66| |#if defined(BOTAN_HAS_SHA2_32_ARMV8) 67| | if(CPUID::has(CPUID::Feature::SHA2)) { 68| | return SHA_256::compress_digest_armv8(digest, input, blocks); 69| | } 70| |#endif 71| | 72| 0|#if defined(BOTAN_HAS_SHA2_32_X86_AVX2) 73| 0| if(CPUID::has(CPUID::Feature::AVX2, CPUID::Feature::BMI)) { ------------------ | Branch (73:7): [True: 0, False: 0] ------------------ 74| 0| return SHA_256::compress_digest_x86_avx2(digest, input, blocks); 75| 0| } 76| 0|#endif 77| | 78| 0|#if defined(BOTAN_HAS_SHA2_32_SIMD) 79| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (79:7): [True: 0, False: 0] ------------------ 80| 0| return SHA_256::compress_digest_x86_simd(digest, input, blocks); 81| 0| } 82| 0|#endif 83| | 84| 0| uint32_t A = digest[0]; 85| 0| uint32_t B = digest[1]; 86| 0| uint32_t C = digest[2]; 87| 0| uint32_t D = digest[3]; 88| 0| uint32_t E = digest[4]; 89| 0| uint32_t F = digest[5]; 90| 0| uint32_t G = digest[6]; 91| 0| uint32_t H = digest[7]; 92| | 93| 0| std::array W{}; 94| | 95| 0| BufferSlicer in(input); 96| | 97| 0| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (97:22): [True: 0, False: 0] ------------------ 98| 0| load_be(W, in.take()); 99| | 100| | // clang-format off 101| | 102| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], SHA256_K[ 0]); 103| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], SHA256_K[ 1]); 104| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], SHA256_K[ 2]); 105| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], SHA256_K[ 3]); 106| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], SHA256_K[ 4]); 107| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], SHA256_K[ 5]); 108| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], SHA256_K[ 6]); 109| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], SHA256_K[ 7]); 110| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], SHA256_K[ 8]); 111| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], SHA256_K[ 9]); 112| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], SHA256_K[10]); 113| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], SHA256_K[11]); 114| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], SHA256_K[12]); 115| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], SHA256_K[13]); 116| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], SHA256_K[14]); 117| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], SHA256_K[15]); 118| | 119| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], SHA256_K[16]); 120| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], SHA256_K[17]); 121| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], SHA256_K[18]); 122| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], SHA256_K[19]); 123| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], SHA256_K[20]); 124| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], SHA256_K[21]); 125| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], SHA256_K[22]); 126| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], SHA256_K[23]); 127| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], SHA256_K[24]); 128| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], SHA256_K[25]); 129| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], SHA256_K[26]); 130| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], SHA256_K[27]); 131| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], SHA256_K[28]); 132| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], SHA256_K[29]); 133| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], SHA256_K[30]); 134| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], SHA256_K[31]); 135| | 136| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], SHA256_K[32]); 137| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], SHA256_K[33]); 138| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], SHA256_K[34]); 139| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], SHA256_K[35]); 140| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], SHA256_K[36]); 141| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], SHA256_K[37]); 142| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], SHA256_K[38]); 143| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], SHA256_K[39]); 144| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], SHA256_K[40]); 145| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], SHA256_K[41]); 146| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], SHA256_K[42]); 147| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], SHA256_K[43]); 148| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], SHA256_K[44]); 149| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], SHA256_K[45]); 150| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], SHA256_K[46]); 151| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], SHA256_K[47]); 152| | 153| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], SHA256_K[48]); 154| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], SHA256_K[49]); 155| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], SHA256_K[50]); 156| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], SHA256_K[51]); 157| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], SHA256_K[52]); 158| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], SHA256_K[53]); 159| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], SHA256_K[54]); 160| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], SHA256_K[55]); 161| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], SHA256_K[56]); 162| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], SHA256_K[57]); 163| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], SHA256_K[58]); 164| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], SHA256_K[59]); 165| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], SHA256_K[60]); 166| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], SHA256_K[61]); 167| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], SHA256_K[62]); 168| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], SHA256_K[63]); 169| | 170| | // clang-format on 171| | 172| 0| A = (digest[0] += A); 173| 0| B = (digest[1] += B); 174| 0| C = (digest[2] += C); 175| 0| D = (digest[3] += D); 176| 0| E = (digest[4] += E); 177| 0| F = (digest[5] += F); 178| 0| G = (digest[6] += G); 179| 0| H = (digest[7] += H); 180| 0| } 181| 0|} _ZN5Botan7SHA_22410compress_nERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 187| 261|void SHA_224::compress_n(digest_type& digest, std::span input, size_t blocks) { 188| 261| SHA_256::compress_digest(digest, input, blocks); 189| 261|} _ZN5Botan7SHA_2244initERNSt3__16vectorIjNS_16secure_allocatorIjEEEE: 191| 261|void SHA_224::init(digest_type& digest) { 192| 261| digest.assign({0xC1059ED8, 0x367CD507, 0x3070DD17, 0xF70E5939, 0xFFC00B31, 0x68581511, 0x64F98FA7, 0xBEFA4FA4}); 193| 261|} _ZN5Botan7SHA_2248add_dataENSt3__14spanIKhLm18446744073709551615EEE: 203| 174|void SHA_224::add_data(std::span input) { 204| 174| m_md.update(input); 205| 174|} _ZN5Botan7SHA_22412final_resultENSt3__14spanIhLm18446744073709551615EEE: 207| 87|void SHA_224::final_result(std::span output) { 208| 87| m_md.final(output); 209| 87|} _ZN5Botan7SHA_25610compress_nERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 215| 64.5k|void SHA_256::compress_n(digest_type& digest, std::span input, size_t blocks) { 216| 64.5k| SHA_256::compress_digest(digest, input, blocks); 217| 64.5k|} _ZN5Botan7SHA_2564initERNSt3__16vectorIjNS_16secure_allocatorIjEEEE: 219| 48.5k|void SHA_256::init(digest_type& digest) { 220| 48.5k| digest.assign({0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A, 0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19}); 221| 48.5k|} _ZN5Botan7SHA_2568add_dataENSt3__14spanIKhLm18446744073709551615EEE: 231| 38.8k|void SHA_256::add_data(std::span input) { 232| 38.8k| m_md.update(input); 233| 38.8k|} _ZN5Botan7SHA_25612final_resultENSt3__14spanIhLm18446744073709551615EEE: 235| 38.5k|void SHA_256::final_result(std::span output) { 236| 38.5k| m_md.final(output); 237| 38.5k|} _ZN5Botan7SHA_25619compress_digest_x86ERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 59| 64.8k| size_t blocks) { 60| 64.8k| const uint8_t* input = input_span.data(); 61| | 62| 64.8k| SIMD_4x32 S0 = SIMD_4x32::load_le(&digest[0]); // NOLINT(*container-data-pointer) 63| 64.8k| SIMD_4x32 S1 = SIMD_4x32::load_le(&digest[4]); 64| | 65| 64.8k| sha256_permute_state(S0, S1); 66| | 67| 219k| while(blocks > 0) { ------------------ | Branch (67:10): [True: 154k, False: 64.8k] ------------------ 68| 154k| const auto S0_SAVE = S0; 69| 154k| const auto S1_SAVE = S1; 70| | 71| 154k| auto W0 = SIMD_4x32::load_be(input); 72| 154k| auto W1 = SIMD_4x32::load_be(input + 16); 73| 154k| auto W2 = SIMD_4x32::load_be(input + 32); 74| 154k| auto W3 = SIMD_4x32::load_be(input + 48); 75| | 76| 154k| sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&SHA256_K[0])); 77| 154k| sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&SHA256_K[4])); 78| 154k| sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&SHA256_K[8])); 79| 154k| sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&SHA256_K[12])); 80| | 81| 154k| W0 = SIMD_4x32(_mm_sha256msg1_epu32(W0.raw(), W1.raw())); 82| 154k| W1 = SIMD_4x32(_mm_sha256msg1_epu32(W1.raw(), W2.raw())); 83| | 84| 154k| sha256_msg_exp(W2, W3, W0, W1); 85| | 86| 154k| sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&SHA256_K[4 * 4])); 87| 154k| sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&SHA256_K[4 * 5])); 88| | 89| 154k| sha256_msg_exp(W0, W1, W2, W3); 90| | 91| 154k| sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&SHA256_K[4 * 6])); 92| 154k| sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&SHA256_K[4 * 7])); 93| | 94| 154k| sha256_msg_exp(W2, W3, W0, W1); 95| | 96| 154k| sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&SHA256_K[4 * 8])); 97| 154k| sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&SHA256_K[4 * 9])); 98| | 99| 154k| sha256_msg_exp(W0, W1, W2, W3); 100| | 101| 154k| sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&SHA256_K[4 * 10])); 102| 154k| sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&SHA256_K[4 * 11])); 103| | 104| 154k| sha256_msg_exp(W2, W3, W0, W1); 105| | 106| 154k| sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&SHA256_K[4 * 12])); 107| 154k| sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&SHA256_K[4 * 13])); 108| | 109| 154k| sha256_msg_exp(W0, W1, W2, W3); 110| | 111| 154k| sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&SHA256_K[4 * 14])); 112| 154k| sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&SHA256_K[4 * 15])); 113| | 114| | // Add values back to state 115| 154k| S0 += S0_SAVE; 116| 154k| S1 += S1_SAVE; 117| | 118| 154k| input += 64; 119| 154k| blocks--; 120| 154k| } 121| | 122| 64.8k| sha256_permute_state(S1, S0); 123| | 124| 64.8k| S0.store_le(&digest[0]); // NOLINT(*container-data-pointer) 125| 64.8k| S1.store_le(&digest[4]); 126| 64.8k|} sha2_32_x86.cpp:_ZN5Botan12_GLOBAL__N_120sha256_permute_stateERNS_9SIMD_4x32ES2_: 44| 129k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI void sha256_permute_state(SIMD_4x32& S0, SIMD_4x32& S1) { 45| 129k| S0 = SIMD_4x32(_mm_shuffle_epi32(S0.raw(), 0b10110001)); // CDAB 46| 129k| S1 = SIMD_4x32(_mm_shuffle_epi32(S1.raw(), 0b00011011)); // EFGH 47| | 48| 129k| const auto T = SIMD_4x32::alignr8(S0, S1); // ABEF 49| | S1 = SIMD_4x32(_mm_blend_epi16(S1.raw(), S0.raw(), 0xF0)); // CDGH 50| 129k| S0 = T; 51| 129k|} sha2_32_x86.cpp:_ZN5Botan12_GLOBAL__N_112sha256_rnds4ERNS_9SIMD_4x32ES2_RKS1_S4_: 28| 2.47M| const SIMD_4x32& k) { 29| 2.47M| const auto mk = msg + k; 30| 2.47M| S1 = SIMD_4x32(_mm_sha256rnds2_epu32(S1.raw(), S0.raw(), mk.raw())); 31| 2.47M| S0 = SIMD_4x32(_mm_sha256rnds2_epu32(S0.raw(), S1.raw(), mk.shift_elems_right<2>().raw())); 32| 2.47M|} sha2_32_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha256_msg_expERNS_9SIMD_4x32ES2_S2_S2_: 34| 926k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI void sha256_msg_exp(SIMD_4x32& W0, SIMD_4x32& W1, SIMD_4x32& W2, SIMD_4x32& W3) { 35| 926k| W2 += SIMD_4x32::alignr4(W1, W0); 36| 926k| W0 = SIMD_4x32(_mm_sha256msg1_epu32(W0.raw(), W1.raw())); 37| 926k| W2 = SIMD_4x32(_mm_sha256msg2_epu32(W2.raw(), W1.raw())); 38| | 39| 926k| W3 += SIMD_4x32::alignr4(W2, W1); 40| 926k| W1 = SIMD_4x32(_mm_sha256msg1_epu32(W1.raw(), W2.raw())); 41| 926k| W3 = SIMD_4x32(_mm_sha256msg2_epu32(W3.raw(), W2.raw())); 42| 926k|} _ZN5Botan7SHA_51215compress_digestERNSt3__16vectorImNS_16secure_allocatorImEEEENS1_4spanIKhLm18446744073709551615EEEm: 56| 1.23k|void SHA_512::compress_digest(digest_type& digest, std::span input, size_t blocks) { 57| 1.23k|#if defined(BOTAN_HAS_SHA2_64_X86) 58| 1.23k| if(CPUID::has(CPUID::Feature::SHA512)) { ------------------ | Branch (58:7): [True: 0, False: 1.23k] ------------------ 59| 0| return compress_digest_x86(digest, input, blocks); 60| 0| } 61| 1.23k|#endif 62| | 63| |#if defined(BOTAN_HAS_SHA2_64_ARMV8) 64| | if(CPUID::has(CPUID::Feature::SHA2_512)) { 65| | return compress_digest_armv8(digest, input, blocks); 66| | } 67| |#endif 68| | 69| 1.23k|#if defined(BOTAN_HAS_SHA2_64_X86_AVX512) 70| 1.23k| if(CPUID::has(CPUID::Feature::AVX512, CPUID::Feature::BMI)) { ------------------ | Branch (70:7): [True: 0, False: 1.23k] ------------------ 71| 0| return compress_digest_x86_avx512(digest, input, blocks); 72| 0| } 73| 1.23k|#endif 74| | 75| 1.23k|#if defined(BOTAN_HAS_SHA2_64_X86_AVX2) 76| 1.23k| if(CPUID::has(CPUID::Feature::AVX2, CPUID::Feature::BMI)) { ------------------ | Branch (76:7): [True: 1.23k, False: 0] ------------------ 77| 1.23k| return compress_digest_x86_avx2(digest, input, blocks); 78| 1.23k| } 79| 0|#endif 80| | 81| 0| uint64_t A = digest[0]; 82| 0| uint64_t B = digest[1]; 83| 0| uint64_t C = digest[2]; 84| 0| uint64_t D = digest[3]; 85| 0| uint64_t E = digest[4]; 86| 0| uint64_t F = digest[5]; 87| 0| uint64_t G = digest[6]; 88| 0| uint64_t H = digest[7]; 89| | 90| 0| std::array W{}; 91| | 92| 0| BufferSlicer in(input); 93| | 94| 0| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (94:22): [True: 0, False: 0] ------------------ 95| 0| load_be(W, in.take()); 96| | 97| | // clang-format off 98| | 99| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], SHA512_K[ 0]); 100| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], SHA512_K[ 1]); 101| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], SHA512_K[ 2]); 102| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], SHA512_K[ 3]); 103| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], SHA512_K[ 4]); 104| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], SHA512_K[ 5]); 105| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], SHA512_K[ 6]); 106| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], SHA512_K[ 7]); 107| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], SHA512_K[ 8]); 108| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], SHA512_K[ 9]); 109| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], SHA512_K[10]); 110| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], SHA512_K[11]); 111| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], SHA512_K[12]); 112| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], SHA512_K[13]); 113| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], SHA512_K[14]); 114| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], SHA512_K[15]); 115| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], SHA512_K[16]); 116| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], SHA512_K[17]); 117| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], SHA512_K[18]); 118| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], SHA512_K[19]); 119| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], SHA512_K[20]); 120| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], SHA512_K[21]); 121| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], SHA512_K[22]); 122| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], SHA512_K[23]); 123| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], SHA512_K[24]); 124| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], SHA512_K[25]); 125| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], SHA512_K[26]); 126| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], SHA512_K[27]); 127| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], SHA512_K[28]); 128| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], SHA512_K[29]); 129| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], SHA512_K[30]); 130| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], SHA512_K[31]); 131| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], SHA512_K[32]); 132| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], SHA512_K[33]); 133| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], SHA512_K[34]); 134| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], SHA512_K[35]); 135| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], SHA512_K[36]); 136| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], SHA512_K[37]); 137| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], SHA512_K[38]); 138| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], SHA512_K[39]); 139| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], SHA512_K[40]); 140| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], SHA512_K[41]); 141| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], SHA512_K[42]); 142| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], SHA512_K[43]); 143| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], SHA512_K[44]); 144| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], SHA512_K[45]); 145| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], SHA512_K[46]); 146| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], SHA512_K[47]); 147| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], SHA512_K[48]); 148| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], SHA512_K[49]); 149| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], SHA512_K[50]); 150| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], SHA512_K[51]); 151| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], SHA512_K[52]); 152| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], SHA512_K[53]); 153| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], SHA512_K[54]); 154| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], SHA512_K[55]); 155| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], SHA512_K[56]); 156| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], SHA512_K[57]); 157| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], SHA512_K[58]); 158| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], SHA512_K[59]); 159| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], SHA512_K[60]); 160| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], SHA512_K[61]); 161| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], SHA512_K[62]); 162| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], SHA512_K[63]); 163| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], SHA512_K[64]); 164| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], SHA512_K[65]); 165| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], SHA512_K[66]); 166| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], SHA512_K[67]); 167| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], SHA512_K[68]); 168| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], SHA512_K[69]); 169| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], SHA512_K[70]); 170| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], SHA512_K[71]); 171| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], SHA512_K[72]); 172| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], SHA512_K[73]); 173| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], SHA512_K[74]); 174| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], SHA512_K[75]); 175| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], SHA512_K[76]); 176| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], SHA512_K[77]); 177| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], SHA512_K[78]); 178| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], SHA512_K[79]); 179| | 180| | // clang-format on 181| | 182| 0| A = (digest[0] += A); 183| 0| B = (digest[1] += B); 184| 0| C = (digest[2] += C); 185| 0| D = (digest[3] += D); 186| 0| E = (digest[4] += E); 187| 0| F = (digest[5] += F); 188| 0| G = (digest[6] += G); 189| 0| H = (digest[7] += H); 190| 0| } 191| 0|} _ZN5Botan7SHA_38410compress_nERNSt3__16vectorImNS_16secure_allocatorImEEEENS1_4spanIKhLm18446744073709551615EEEm: 209| 1.12k|void SHA_384::compress_n(digest_type& digest, std::span input, size_t blocks) { 210| 1.12k| SHA_512::compress_digest(digest, input, blocks); 211| 1.12k|} _ZN5Botan7SHA_51210compress_nERNSt3__16vectorImNS_16secure_allocatorImEEEENS1_4spanIKhLm18446744073709551615EEEm: 213| 108|void SHA_512::compress_n(digest_type& digest, std::span input, size_t blocks) { 214| 108| SHA_512::compress_digest(digest, input, blocks); 215| 108|} _ZN5Botan7SHA_3844initERNSt3__16vectorImNS_16secure_allocatorImEEEE: 228| 752|void SHA_384::init(digest_type& digest) { 229| 752| digest.assign({0xCBBB9D5DC1059ED8, 230| 752| 0x629A292A367CD507, 231| 752| 0x9159015A3070DD17, 232| 752| 0x152FECD8F70E5939, 233| 752| 0x67332667FFC00B31, 234| 752| 0x8EB44A8768581511, 235| 752| 0xDB0C2E0D64F98FA7, 236| 752| 0x47B5481DBEFA4FA4}); 237| 752|} _ZN5Botan7SHA_5124initERNSt3__16vectorImNS_16secure_allocatorImEEEE: 239| 139|void SHA_512::init(digest_type& digest) { 240| 139| digest.assign({0x6A09E667F3BCC908, 241| 139| 0xBB67AE8584CAA73B, 242| 139| 0x3C6EF372FE94F82B, 243| 139| 0xA54FF53A5F1D36F1, 244| 139| 0x510E527FADE682D1, 245| 139| 0x9B05688C2B3E6C1F, 246| 139| 0x1F83D9ABFB41BD6B, 247| 139| 0x5BE0CD19137E2179}); 248| 139|} _ZN5Botan7SHA_3848add_dataENSt3__14spanIKhLm18446744073709551615EEE: 274| 752|void SHA_384::add_data(std::span input) { 275| 752| m_md.update(input); 276| 752|} _ZN5Botan7SHA_5128add_dataENSt3__14spanIKhLm18446744073709551615EEE: 278| 107|void SHA_512::add_data(std::span input) { 279| 107| m_md.update(input); 280| 107|} _ZN5Botan7SHA_38412final_resultENSt3__14spanIhLm18446744073709551615EEE: 286| 376|void SHA_384::final_result(std::span output) { 287| 376| m_md.final(output); 288| 376|} _ZN5Botan7SHA_51212final_resultENSt3__14spanIhLm18446744073709551615EEE: 290| 53|void SHA_512::final_result(std::span output) { 291| 53| m_md.final(output); 292| 53|} _ZN5Botan7SHA_51224compress_digest_x86_avx2ERNSt3__16vectorImNS_16secure_allocatorImEEEENS1_4spanIKhLm18446744073709551615EEEm: 44| 1.23k| size_t blocks) { 45| 1.23k| alignas(64) uint64_t W[16] = {0}; 46| 1.23k| alignas(64) uint64_t W2[80]; 47| | 48| 1.23k| uint64_t A = digest[0]; 49| 1.23k| uint64_t B = digest[1]; 50| 1.23k| uint64_t C = digest[2]; 51| 1.23k| uint64_t D = digest[3]; 52| 1.23k| uint64_t E = digest[4]; 53| 1.23k| uint64_t F = digest[5]; 54| 1.23k| uint64_t G = digest[6]; 55| 1.23k| uint64_t H = digest[7]; 56| | 57| 1.23k| const uint8_t* data = input.data(); 58| | 59| 1.62k| while(blocks >= 2) { ------------------ | Branch (59:10): [True: 386, False: 1.23k] ------------------ 60| 386| SIMD_4x64 WS[8]; 61| | 62| 3.47k| for(size_t i = 0; i < 8; i++) { ------------------ | Branch (62:25): [True: 3.08k, False: 386] ------------------ 63| 3.08k| WS[i] = SIMD_4x64::load_be2(&data[16 * i], &data[128 + 16 * i]); 64| 3.08k| auto WK = WS[i] + SIMD_4x64::broadcast_2x64(&SHA512_K[2 * i]); 65| 3.08k| WK.store_le2(&W[2 * i], &W2[2 * i]); 66| 3.08k| } 67| | 68| 386| data += 2 * 128; 69| 386| blocks -= 2; 70| | 71| | // First 64 rounds of SHA-512 72| 1.93k| for(size_t r = 0; r != 64; r += 16) { ------------------ | Branch (72:25): [True: 1.54k, False: 386] ------------------ 73| 1.54k| auto w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 16]); 74| 1.54k| SHA2_64_F(A, B, C, D, E, F, G, H, W[0]); 75| 1.54k| SHA2_64_F(H, A, B, C, D, E, F, G, W[1]); 76| 1.54k| w.store_le2(&W[0], &W2[r + 16]); 77| | 78| 1.54k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 18]); 79| 1.54k| SHA2_64_F(G, H, A, B, C, D, E, F, W[2]); 80| 1.54k| SHA2_64_F(F, G, H, A, B, C, D, E, W[3]); 81| 1.54k| w.store_le2(&W[2], &W2[r + 18]); 82| | 83| 1.54k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 20]); 84| 1.54k| SHA2_64_F(E, F, G, H, A, B, C, D, W[4]); 85| 1.54k| SHA2_64_F(D, E, F, G, H, A, B, C, W[5]); 86| 1.54k| w.store_le2(&W[4], &W2[r + 20]); 87| | 88| 1.54k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 22]); 89| 1.54k| SHA2_64_F(C, D, E, F, G, H, A, B, W[6]); 90| 1.54k| SHA2_64_F(B, C, D, E, F, G, H, A, W[7]); 91| 1.54k| w.store_le2(&W[6], &W2[r + 22]); 92| | 93| 1.54k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 24]); 94| 1.54k| SHA2_64_F(A, B, C, D, E, F, G, H, W[8]); 95| 1.54k| SHA2_64_F(H, A, B, C, D, E, F, G, W[9]); 96| 1.54k| w.store_le2(&W[8], &W2[r + 24]); 97| | 98| 1.54k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 26]); 99| 1.54k| SHA2_64_F(G, H, A, B, C, D, E, F, W[10]); 100| 1.54k| SHA2_64_F(F, G, H, A, B, C, D, E, W[11]); 101| 1.54k| w.store_le2(&W[10], &W2[r + 26]); 102| | 103| 1.54k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 28]); 104| 1.54k| SHA2_64_F(E, F, G, H, A, B, C, D, W[12]); 105| 1.54k| SHA2_64_F(D, E, F, G, H, A, B, C, W[13]); 106| 1.54k| w.store_le2(&W[12], &W2[r + 28]); 107| | 108| 1.54k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 30]); 109| 1.54k| SHA2_64_F(C, D, E, F, G, H, A, B, W[14]); 110| 1.54k| SHA2_64_F(B, C, D, E, F, G, H, A, W[15]); 111| 1.54k| w.store_le2(&W[14], &W2[r + 30]); 112| 1.54k| } 113| | 114| | // Final 16 rounds of SHA-512 115| 386| SHA2_64_F(A, B, C, D, E, F, G, H, W[0]); 116| 386| SHA2_64_F(H, A, B, C, D, E, F, G, W[1]); 117| 386| SHA2_64_F(G, H, A, B, C, D, E, F, W[2]); 118| 386| SHA2_64_F(F, G, H, A, B, C, D, E, W[3]); 119| 386| SHA2_64_F(E, F, G, H, A, B, C, D, W[4]); 120| 386| SHA2_64_F(D, E, F, G, H, A, B, C, W[5]); 121| 386| SHA2_64_F(C, D, E, F, G, H, A, B, W[6]); 122| 386| SHA2_64_F(B, C, D, E, F, G, H, A, W[7]); 123| 386| SHA2_64_F(A, B, C, D, E, F, G, H, W[8]); 124| 386| SHA2_64_F(H, A, B, C, D, E, F, G, W[9]); 125| 386| SHA2_64_F(G, H, A, B, C, D, E, F, W[10]); 126| 386| SHA2_64_F(F, G, H, A, B, C, D, E, W[11]); 127| 386| SHA2_64_F(E, F, G, H, A, B, C, D, W[12]); 128| 386| SHA2_64_F(D, E, F, G, H, A, B, C, W[13]); 129| 386| SHA2_64_F(C, D, E, F, G, H, A, B, W[14]); 130| 386| SHA2_64_F(B, C, D, E, F, G, H, A, W[15]); 131| | 132| 386| A = (digest[0] += A); 133| 386| B = (digest[1] += B); 134| 386| C = (digest[2] += C); 135| 386| D = (digest[3] += D); 136| 386| E = (digest[4] += E); 137| 386| F = (digest[5] += F); 138| 386| G = (digest[6] += G); 139| 386| H = (digest[7] += H); 140| | 141| | // Second block of SHA-512 compression, with pre-expanded message 142| 386| SHA2_64_F(A, B, C, D, E, F, G, H, W2[0]); 143| 386| SHA2_64_F(H, A, B, C, D, E, F, G, W2[1]); 144| 386| SHA2_64_F(G, H, A, B, C, D, E, F, W2[2]); 145| 386| SHA2_64_F(F, G, H, A, B, C, D, E, W2[3]); 146| 386| SHA2_64_F(E, F, G, H, A, B, C, D, W2[4]); 147| 386| SHA2_64_F(D, E, F, G, H, A, B, C, W2[5]); 148| 386| SHA2_64_F(C, D, E, F, G, H, A, B, W2[6]); 149| 386| SHA2_64_F(B, C, D, E, F, G, H, A, W2[7]); 150| 386| SHA2_64_F(A, B, C, D, E, F, G, H, W2[8]); 151| 386| SHA2_64_F(H, A, B, C, D, E, F, G, W2[9]); 152| 386| SHA2_64_F(G, H, A, B, C, D, E, F, W2[10]); 153| 386| SHA2_64_F(F, G, H, A, B, C, D, E, W2[11]); 154| 386| SHA2_64_F(E, F, G, H, A, B, C, D, W2[12]); 155| 386| SHA2_64_F(D, E, F, G, H, A, B, C, W2[13]); 156| 386| SHA2_64_F(C, D, E, F, G, H, A, B, W2[14]); 157| 386| SHA2_64_F(B, C, D, E, F, G, H, A, W2[15]); 158| | 159| 386| SHA2_64_F(A, B, C, D, E, F, G, H, W2[16]); 160| 386| SHA2_64_F(H, A, B, C, D, E, F, G, W2[17]); 161| 386| SHA2_64_F(G, H, A, B, C, D, E, F, W2[18]); 162| 386| SHA2_64_F(F, G, H, A, B, C, D, E, W2[19]); 163| 386| SHA2_64_F(E, F, G, H, A, B, C, D, W2[20]); 164| 386| SHA2_64_F(D, E, F, G, H, A, B, C, W2[21]); 165| 386| SHA2_64_F(C, D, E, F, G, H, A, B, W2[22]); 166| 386| SHA2_64_F(B, C, D, E, F, G, H, A, W2[23]); 167| 386| SHA2_64_F(A, B, C, D, E, F, G, H, W2[24]); 168| 386| SHA2_64_F(H, A, B, C, D, E, F, G, W2[25]); 169| 386| SHA2_64_F(G, H, A, B, C, D, E, F, W2[26]); 170| 386| SHA2_64_F(F, G, H, A, B, C, D, E, W2[27]); 171| 386| SHA2_64_F(E, F, G, H, A, B, C, D, W2[28]); 172| 386| SHA2_64_F(D, E, F, G, H, A, B, C, W2[29]); 173| 386| SHA2_64_F(C, D, E, F, G, H, A, B, W2[30]); 174| 386| SHA2_64_F(B, C, D, E, F, G, H, A, W2[31]); 175| | 176| 386| SHA2_64_F(A, B, C, D, E, F, G, H, W2[32]); 177| 386| SHA2_64_F(H, A, B, C, D, E, F, G, W2[33]); 178| 386| SHA2_64_F(G, H, A, B, C, D, E, F, W2[34]); 179| 386| SHA2_64_F(F, G, H, A, B, C, D, E, W2[35]); 180| 386| SHA2_64_F(E, F, G, H, A, B, C, D, W2[36]); 181| 386| SHA2_64_F(D, E, F, G, H, A, B, C, W2[37]); 182| 386| SHA2_64_F(C, D, E, F, G, H, A, B, W2[38]); 183| 386| SHA2_64_F(B, C, D, E, F, G, H, A, W2[39]); 184| 386| SHA2_64_F(A, B, C, D, E, F, G, H, W2[40]); 185| 386| SHA2_64_F(H, A, B, C, D, E, F, G, W2[41]); 186| 386| SHA2_64_F(G, H, A, B, C, D, E, F, W2[42]); 187| 386| SHA2_64_F(F, G, H, A, B, C, D, E, W2[43]); 188| 386| SHA2_64_F(E, F, G, H, A, B, C, D, W2[44]); 189| 386| SHA2_64_F(D, E, F, G, H, A, B, C, W2[45]); 190| 386| SHA2_64_F(C, D, E, F, G, H, A, B, W2[46]); 191| 386| SHA2_64_F(B, C, D, E, F, G, H, A, W2[47]); 192| | 193| 386| SHA2_64_F(A, B, C, D, E, F, G, H, W2[48]); 194| 386| SHA2_64_F(H, A, B, C, D, E, F, G, W2[49]); 195| 386| SHA2_64_F(G, H, A, B, C, D, E, F, W2[50]); 196| 386| SHA2_64_F(F, G, H, A, B, C, D, E, W2[51]); 197| 386| SHA2_64_F(E, F, G, H, A, B, C, D, W2[52]); 198| 386| SHA2_64_F(D, E, F, G, H, A, B, C, W2[53]); 199| 386| SHA2_64_F(C, D, E, F, G, H, A, B, W2[54]); 200| 386| SHA2_64_F(B, C, D, E, F, G, H, A, W2[55]); 201| 386| SHA2_64_F(A, B, C, D, E, F, G, H, W2[56]); 202| 386| SHA2_64_F(H, A, B, C, D, E, F, G, W2[57]); 203| 386| SHA2_64_F(G, H, A, B, C, D, E, F, W2[58]); 204| 386| SHA2_64_F(F, G, H, A, B, C, D, E, W2[59]); 205| 386| SHA2_64_F(E, F, G, H, A, B, C, D, W2[60]); 206| 386| SHA2_64_F(D, E, F, G, H, A, B, C, W2[61]); 207| 386| SHA2_64_F(C, D, E, F, G, H, A, B, W2[62]); 208| 386| SHA2_64_F(B, C, D, E, F, G, H, A, W2[63]); 209| | 210| 386| SHA2_64_F(A, B, C, D, E, F, G, H, W2[64]); 211| 386| SHA2_64_F(H, A, B, C, D, E, F, G, W2[65]); 212| 386| SHA2_64_F(G, H, A, B, C, D, E, F, W2[66]); 213| 386| SHA2_64_F(F, G, H, A, B, C, D, E, W2[67]); 214| 386| SHA2_64_F(E, F, G, H, A, B, C, D, W2[68]); 215| 386| SHA2_64_F(D, E, F, G, H, A, B, C, W2[69]); 216| 386| SHA2_64_F(C, D, E, F, G, H, A, B, W2[70]); 217| 386| SHA2_64_F(B, C, D, E, F, G, H, A, W2[71]); 218| 386| SHA2_64_F(A, B, C, D, E, F, G, H, W2[72]); 219| 386| SHA2_64_F(H, A, B, C, D, E, F, G, W2[73]); 220| 386| SHA2_64_F(G, H, A, B, C, D, E, F, W2[74]); 221| 386| SHA2_64_F(F, G, H, A, B, C, D, E, W2[75]); 222| 386| SHA2_64_F(E, F, G, H, A, B, C, D, W2[76]); 223| 386| SHA2_64_F(D, E, F, G, H, A, B, C, W2[77]); 224| 386| SHA2_64_F(C, D, E, F, G, H, A, B, W2[78]); 225| 386| SHA2_64_F(B, C, D, E, F, G, H, A, W2[79]); 226| | 227| 386| A = (digest[0] += A); 228| 386| B = (digest[1] += B); 229| 386| C = (digest[2] += C); 230| 386| D = (digest[3] += D); 231| 386| E = (digest[4] += E); 232| 386| F = (digest[5] += F); 233| 386| G = (digest[6] += G); 234| 386| H = (digest[7] += H); 235| 386| } 236| | 237| 2.09k| while(blocks > 0) { ------------------ | Branch (237:10): [True: 860, False: 1.23k] ------------------ 238| 860| SIMD_2x64 WS[8]; 239| | 240| 7.74k| for(size_t i = 0; i < 8; i++) { ------------------ | Branch (240:25): [True: 6.88k, False: 860] ------------------ 241| 6.88k| WS[i] = SIMD_2x64::load_be(&data[16 * i]); 242| 6.88k| const auto WK = WS[i] + SIMD_2x64::load_le(&SHA512_K[2 * i]); 243| 6.88k| WK.store_le(&W[2 * i]); 244| 6.88k| } 245| | 246| 860| data += 128; 247| 860| blocks -= 1; 248| | 249| | // First 64 rounds of SHA-512 250| 4.30k| for(size_t r = 0; r != 64; r += 16) { ------------------ | Branch (250:25): [True: 3.44k, False: 860] ------------------ 251| 3.44k| auto w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 16]); 252| 3.44k| SHA2_64_F(A, B, C, D, E, F, G, H, W[0]); 253| 3.44k| SHA2_64_F(H, A, B, C, D, E, F, G, W[1]); 254| 3.44k| w.store_le(&W[0]); 255| | 256| 3.44k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 18]); 257| 3.44k| SHA2_64_F(G, H, A, B, C, D, E, F, W[2]); 258| 3.44k| SHA2_64_F(F, G, H, A, B, C, D, E, W[3]); 259| 3.44k| w.store_le(&W[2]); 260| | 261| 3.44k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 20]); 262| 3.44k| SHA2_64_F(E, F, G, H, A, B, C, D, W[4]); 263| 3.44k| SHA2_64_F(D, E, F, G, H, A, B, C, W[5]); 264| 3.44k| w.store_le(&W[4]); 265| | 266| 3.44k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 22]); 267| 3.44k| SHA2_64_F(C, D, E, F, G, H, A, B, W[6]); 268| 3.44k| SHA2_64_F(B, C, D, E, F, G, H, A, W[7]); 269| 3.44k| w.store_le(&W[6]); 270| | 271| 3.44k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 24]); 272| 3.44k| SHA2_64_F(A, B, C, D, E, F, G, H, W[8]); 273| 3.44k| SHA2_64_F(H, A, B, C, D, E, F, G, W[9]); 274| 3.44k| w.store_le(&W[8]); 275| | 276| 3.44k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 26]); 277| 3.44k| SHA2_64_F(G, H, A, B, C, D, E, F, W[10]); 278| 3.44k| SHA2_64_F(F, G, H, A, B, C, D, E, W[11]); 279| 3.44k| w.store_le(&W[10]); 280| | 281| 3.44k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 28]); 282| 3.44k| SHA2_64_F(E, F, G, H, A, B, C, D, W[12]); 283| 3.44k| SHA2_64_F(D, E, F, G, H, A, B, C, W[13]); 284| 3.44k| w.store_le(&W[12]); 285| | 286| 3.44k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 30]); 287| 3.44k| SHA2_64_F(C, D, E, F, G, H, A, B, W[14]); 288| 3.44k| SHA2_64_F(B, C, D, E, F, G, H, A, W[15]); 289| 3.44k| w.store_le(&W[14]); 290| 3.44k| } 291| | 292| | // Final 16 rounds of SHA-512 293| 860| SHA2_64_F(A, B, C, D, E, F, G, H, W[0]); 294| 860| SHA2_64_F(H, A, B, C, D, E, F, G, W[1]); 295| 860| SHA2_64_F(G, H, A, B, C, D, E, F, W[2]); 296| 860| SHA2_64_F(F, G, H, A, B, C, D, E, W[3]); 297| 860| SHA2_64_F(E, F, G, H, A, B, C, D, W[4]); 298| 860| SHA2_64_F(D, E, F, G, H, A, B, C, W[5]); 299| 860| SHA2_64_F(C, D, E, F, G, H, A, B, W[6]); 300| 860| SHA2_64_F(B, C, D, E, F, G, H, A, W[7]); 301| 860| SHA2_64_F(A, B, C, D, E, F, G, H, W[8]); 302| 860| SHA2_64_F(H, A, B, C, D, E, F, G, W[9]); 303| 860| SHA2_64_F(G, H, A, B, C, D, E, F, W[10]); 304| 860| SHA2_64_F(F, G, H, A, B, C, D, E, W[11]); 305| 860| SHA2_64_F(E, F, G, H, A, B, C, D, W[12]); 306| 860| SHA2_64_F(D, E, F, G, H, A, B, C, W[13]); 307| 860| SHA2_64_F(C, D, E, F, G, H, A, B, W[14]); 308| 860| SHA2_64_F(B, C, D, E, F, G, H, A, W[15]); 309| | 310| 860| A = (digest[0] += A); 311| 860| B = (digest[1] += B); 312| 860| C = (digest[2] += C); 313| 860| D = (digest[3] += D); 314| 860| E = (digest[4] += E); 315| 860| F = (digest[5] += F); 316| 860| G = (digest[6] += G); 317| 860| H = (digest[7] += H); 318| 860| } 319| 1.23k|} sha2_64_avx2.cpp:_ZN5Botan12_GLOBAL__N_113sha512_next_wINS_9SIMD_4x64EEET_PS3_: 19| 12.3k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AVX2_BMI2 SIMD_T sha512_next_w(SIMD_T x[8]) { 20| 12.3k| const auto t0 = SIMD_T::alignr8(x[1], x[0]); 21| 12.3k| const auto t1 = SIMD_T::alignr8(x[5], x[4]); 22| | 23| 12.3k| const auto s0 = t0.template rotr<1>() ^ t0.template rotr<8>() ^ t0.template shr<7>(); 24| 12.3k| const auto s1 = x[7].template rotr<19>() ^ x[7].template rotr<61>() ^ x[7].template shr<6>(); 25| | 26| 12.3k| const auto nx = x[0] + s0 + s1 + t1; 27| | 28| 12.3k| x[0] = x[1]; 29| 12.3k| x[1] = x[2]; 30| 12.3k| x[2] = x[3]; 31| 12.3k| x[3] = x[4]; 32| 12.3k| x[4] = x[5]; 33| 12.3k| x[5] = x[6]; 34| 12.3k| x[6] = x[7]; 35| 12.3k| x[7] = nx; 36| | 37| 12.3k| return x[7]; 38| 12.3k|} sha2_64_avx2.cpp:_ZN5Botan12_GLOBAL__N_113sha512_next_wINS_9SIMD_2x64EEET_PS3_: 19| 27.5k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AVX2_BMI2 SIMD_T sha512_next_w(SIMD_T x[8]) { 20| 27.5k| const auto t0 = SIMD_T::alignr8(x[1], x[0]); 21| 27.5k| const auto t1 = SIMD_T::alignr8(x[5], x[4]); 22| | 23| 27.5k| const auto s0 = t0.template rotr<1>() ^ t0.template rotr<8>() ^ t0.template shr<7>(); 24| 27.5k| const auto s1 = x[7].template rotr<19>() ^ x[7].template rotr<61>() ^ x[7].template shr<6>(); 25| | 26| 27.5k| const auto nx = x[0] + s0 + s1 + t1; 27| | 28| 27.5k| x[0] = x[1]; 29| 27.5k| x[1] = x[2]; 30| 27.5k| x[2] = x[3]; 31| 27.5k| x[3] = x[4]; 32| 27.5k| x[4] = x[5]; 33| 27.5k| x[5] = x[6]; 34| 27.5k| x[6] = x[7]; 35| 27.5k| x[7] = nx; 36| | 37| 27.5k| return x[7]; 38| 27.5k|} _ZN5Botan8StreebogC2Em: 73| 266|Streebog::Streebog(size_t output_bits) : m_output_bits(output_bits), m_count(0), m_h(8), m_S(8) { 74| 266| if(output_bits != 256 && output_bits != 512) { ------------------ | Branch (74:7): [True: 0, False: 266] | Branch (74:29): [True: 0, False: 0] ------------------ 75| 0| throw Invalid_Argument(fmt("Streebog: Invalid output length {}", output_bits)); 76| 0| } 77| | 78| 266| clear(); 79| 266|} _ZN5Botan8Streebog5clearEv: 98| 532|void Streebog::clear() { 99| 532| m_count = 0; 100| 532| m_buffer.clear(); 101| 532| zeroise(m_S); 102| | 103| 532| const uint64_t fill = (m_output_bits == 512) ? 0 : 0x0101010101010101; ------------------ | Branch (103:26): [True: 0, False: 532] ------------------ 104| 532| std::fill(m_h.begin(), m_h.end(), fill); 105| 532|} _ZN5Botan8Streebog8add_dataENSt3__14spanIKhLm18446744073709551615EEE: 110| 532|void Streebog::add_data(std::span input) { 111| 532| BufferSlicer in(input); 112| | 113| 1.33k| while(!in.empty()) { ------------------ | Branch (113:10): [True: 798, False: 532] ------------------ 114| 798| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (114:21): [True: 266, False: 532] ------------------ 115| 266| compress(one_block->data()); 116| 266| m_count += 512; 117| 266| } 118| | 119| 798| if(m_buffer.in_alignment()) { ------------------ | Branch (119:10): [True: 266, False: 532] ------------------ 120| 2.12k| while(const auto aligned_block = m_buffer.next_aligned_block_to_process(in)) { ------------------ | Branch (120:27): [True: 1.86k, False: 266] ------------------ 121| 1.86k| compress(aligned_block->data()); 122| 1.86k| m_count += 512; 123| 1.86k| } 124| 266| } 125| 798| } 126| 532|} _ZN5Botan8Streebog12final_resultENSt3__14spanIhLm18446744073709551615EEE: 131| 266|void Streebog::final_result(std::span output) { 132| 266| const auto pos = m_buffer.elements_in_buffer(); 133| | 134| 266| const uint8_t padding = 0x01; 135| 266| m_buffer.append({&padding, 1}); 136| 266| m_buffer.fill_up_with_zeros(); 137| | 138| 266| compress(m_buffer.consume().data()); 139| 266| m_count += pos * 8; 140| | 141| 266| m_buffer.fill_up_with_zeros(); 142| 266| store_le(m_count, m_buffer.directly_modify_first(sizeof(m_count)).data()); 143| 266| compress(m_buffer.consume().data(), true); 144| | 145| 266| compress_64(m_S.data(), true); 146| | 147| 266| const size_t offset = 8 - output_length() / 8; 148| 266| const size_t count = output_length() / sizeof(uint64_t); 149| 266| typecast_copy(output, std::span(&m_h[offset], count)); 150| 266| clear(); 151| 266|} _ZN5Botan8Streebog8compressEPKhb: 153| 2.66k|void Streebog::compress(const uint8_t input[], bool last_block) { 154| 2.66k| uint64_t M[8]; 155| 2.66k| typecast_copy(M, std::span(input, 64)); 156| 2.66k| compress_64(M, last_block); 157| 2.66k|} _ZN5Botan8Streebog11compress_64EPKmb: 179| 2.92k|void Streebog::compress_64(const uint64_t M[], bool last_block) { 180| 2.92k| const uint64_t N = last_block ? 0 : force_le(m_count); ------------------ | Branch (180:23): [True: 532, False: 2.39k] ------------------ 181| | 182| 2.92k|#if defined(BOTAN_HAS_STREEBOG_AVX512_GFNI) 183| 2.92k| if(CPUID::has(CPUID::Feature::AVX512, CPUID::Feature::GFNI)) { ------------------ | Branch (183:7): [True: 0, False: 2.92k] ------------------ 184| 0| compress_64_avx512_gfni(m_h.data(), M, N); 185| 0| increment_s(last_block, M, m_S.data()); 186| 0| return; 187| 0| } 188| 2.92k|#endif 189| | 190| 2.92k| uint64_t hN[8]; 191| 2.92k| uint64_t A[8]; 192| | 193| 2.92k| copy_mem(hN, m_h.data(), 8); 194| 2.92k| hN[0] ^= N; 195| 2.92k| lps(hN); 196| | 197| 2.92k| copy_mem(A, hN, 8); 198| | 199| 26.3k| for(size_t i = 0; i != 8; ++i) { ------------------ | Branch (199:22): [True: 23.4k, False: 2.92k] ------------------ 200| 23.4k| hN[i] ^= M[i]; 201| 23.4k| } 202| | 203| 38.0k| for(size_t i = 0; i < 12; ++i) { // NOLINT(modernize-loop-convert) ------------------ | Branch (203:22): [True: 35.1k, False: 2.92k] ------------------ 204| 316k| for(size_t j = 0; j != 8; ++j) { ------------------ | Branch (204:25): [True: 280k, False: 35.1k] ------------------ 205| 280k| A[j] ^= force_le(STREEBOG_C[i][7 - j]); 206| 280k| } 207| 35.1k| lps(A); 208| | 209| 35.1k| lps(hN); 210| 316k| for(size_t j = 0; j != 8; ++j) { ------------------ | Branch (210:25): [True: 280k, False: 35.1k] ------------------ 211| 280k| hN[j] ^= A[j]; 212| 280k| } 213| 35.1k| } 214| | 215| 26.3k| for(size_t i = 0; i != 8; ++i) { ------------------ | Branch (215:22): [True: 23.4k, False: 2.92k] ------------------ 216| 23.4k| m_h[i] ^= hN[i] ^ M[i]; 217| 23.4k| } 218| | 219| 2.92k| increment_s(last_block, M, m_S.data()); 220| 2.92k|} streebog.cpp:_ZN5Botan12_GLOBAL__N_18force_leEm: 44| 5.02M|inline uint64_t force_le(uint64_t x) { 45| 5.02M| if constexpr(std::endian::native == std::endian::little) { 46| 5.02M| return x; 47| | } else if constexpr(std::endian::native == std::endian::big) { 48| | return reverse_bytes(x); 49| | } else { 50| | store_le(x, reinterpret_cast(&x)); 51| | return x; 52| | } 53| 5.02M|} streebog.cpp:_ZN5Botan12_GLOBAL__N_111increment_sEbPKmPm: 161| 2.92k|void increment_s(bool last_block, const uint64_t M[8], uint64_t S[8]) { 162| 2.92k| if(!last_block) { ------------------ | Branch (162:7): [True: 2.39k, False: 532] ------------------ 163| 2.39k| uint64_t carry = 0; 164| 21.5k| for(int i = 0; i < 8; i++) { ------------------ | Branch (164:22): [True: 19.1k, False: 2.39k] ------------------ 165| 19.1k| const uint64_t m = force_le(M[i]); 166| 19.1k| const uint64_t hi = force_le(S[i]); 167| 19.1k| const uint64_t t = hi + m + carry; 168| | 169| 19.1k| S[i] = force_le(t); 170| 19.1k| if(t != m) { ------------------ | Branch (170:13): [True: 17.0k, False: 2.12k] ------------------ 171| 17.0k| carry = (t < m) ? 1 : 0; ------------------ | Branch (171:21): [True: 3.48k, False: 13.5k] ------------------ 172| 17.0k| } 173| 19.1k| } 174| 2.39k| } 175| 2.92k|} streebog.cpp:_ZN5Botan12_GLOBAL__N_13lpsEPm: 55| 73.1k|inline void lps(uint64_t block[8]) { 56| 73.1k| const uint64_t block2[8] = {block[0], block[1], block[2], block[3], block[4], block[5], block[6], block[7]}; 57| 73.1k| const std::span r{reinterpret_cast(block2), 64}; 58| | 59| 658k| for(int i = 0; i < 8; ++i) { ------------------ | Branch (59:19): [True: 585k, False: 73.1k] ------------------ 60| 585k| block[i] = force_le(STREEBOG_Ax[0][r[i + 0 * 8]]) ^ force_le(STREEBOG_Ax[1][r[i + 1 * 8]]) ^ 61| 585k| force_le(STREEBOG_Ax[2][r[i + 2 * 8]]) ^ force_le(STREEBOG_Ax[3][r[i + 3 * 8]]) ^ 62| 585k| force_le(STREEBOG_Ax[4][r[i + 4 * 8]]) ^ force_le(STREEBOG_Ax[5][r[i + 5 * 8]]) ^ 63| 585k| force_le(STREEBOG_Ax[6][r[i + 6 * 8]]) ^ force_le(STREEBOG_Ax[7][r[i + 7 * 8]]); 64| 585k| } 65| 73.1k|} _ZN5Botan6BigInt17from_radix_digitsENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEm: 126| 1.89k|BigInt BigInt::from_radix_digits(std::string_view digits, size_t radix) { 127| 1.89k| if(radix == 16) { ------------------ | Branch (127:7): [True: 1.89k, False: 0] ------------------ 128| 1.89k| secure_vector binary; 129| | 130| 1.89k| if(digits.size() % 2 == 1) { ------------------ | Branch (130:10): [True: 322, False: 1.56k] ------------------ 131| | // Handle lack of leading 0 132| 322| const char buf0_with_leading_0[2] = {'0', digits[0]}; 133| | 134| 322| binary = hex_decode_locked(buf0_with_leading_0, 2); 135| | 136| 322| if(digits.size() > 1) { ------------------ | Branch (136:13): [True: 8, False: 314] ------------------ 137| 8| binary += hex_decode_locked(&digits[1], digits.size() - 1, false); 138| 8| } 139| 1.56k| } else { 140| 1.56k| binary = hex_decode_locked(digits, false); 141| 1.56k| } 142| | 143| 1.89k| return BigInt::from_bytes(binary); 144| 1.89k| } else if(radix == 10) { ------------------ | Branch (144:14): [True: 0, False: 0] ------------------ 145| | // Use the largest power of 10 that fits in a word, accumulating 146| | // groups of digits into word-sized chunks to minimize the number 147| | // of multiprecision multiplications. 148| 0| constexpr word conversion_radix = decimal_conversion_radix(); 149| 0| constexpr size_t radix_digits = decimal_conversion_radix_digits(); 150| | 151| 0| BigInt r; 152| | 153| | // Handle the initial partial block (if digit count is not a multiple of radix_digits) 154| 0| const size_t partial_block = digits.size() % radix_digits; 155| | 156| 0| if(partial_block > 0) { ------------------ | Branch (156:10): [True: 0, False: 0] ------------------ 157| 0| word acc = 0; 158| 0| for(size_t i = 0; i < partial_block; ++i) { ------------------ | Branch (158:28): [True: 0, False: 0] ------------------ 159| 0| const char c = digits[i]; 160| 0| BOTAN_ARG_CHECK(c >= '0' && c <= '9', "Invalid decimal character"); ------------------ | | 35| 0| do { \ | | 36| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 0| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 0, False: 0] | | | Branch (37:12): [True: 0, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 0| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 0] | | ------------------ ------------------ 161| 0| acc = acc * 10 + static_cast(c - '0'); 162| 0| } 163| 0| r += acc; 164| 0| } 165| | 166| | // Process full blocks of radix_digits 167| 0| for(size_t i = partial_block; i != digits.size(); i += radix_digits) { ------------------ | Branch (167:37): [True: 0, False: 0] ------------------ 168| 0| word acc = 0; 169| 0| for(size_t j = 0; j < radix_digits; ++j) { ------------------ | Branch (169:28): [True: 0, False: 0] ------------------ 170| 0| const char c = digits[i + j]; 171| 0| BOTAN_ARG_CHECK(c >= '0' && c <= '9', "Invalid decimal character"); ------------------ | | 35| 0| do { \ | | 36| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 0| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 0, False: 0] | | | Branch (37:12): [True: 0, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 0| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 0] | | ------------------ ------------------ 172| 0| acc = acc * 10 + static_cast(c - '0'); 173| 0| } 174| 0| r *= conversion_radix; 175| 0| r += acc; 176| 0| } 177| | 178| 0| return r; 179| 0| } else { 180| 0| throw Invalid_Argument("BigInt::from_radix_digits unknown radix"); 181| 0| } 182| 1.89k|} _ZN5Botan6BigInt3addEPKmmNS0_4SignE: 32| 141|BigInt& BigInt::add(const word y[], size_t y_words, Sign y_sign) { 33| 141| const size_t x_sw = sig_words(); 34| | 35| 141| grow_to(std::max(x_sw, y_words) + 1); 36| | 37| 141| if(sign() == y_sign) { ------------------ | Branch (37:7): [True: 0, False: 141] ------------------ 38| 0| const word carry = bigint_add2(mutable_data(), size() - 1, y, y_words); 39| 0| mutable_data()[size() - 1] += carry; 40| 141| } else { 41| 141| const int32_t relative_size = bigint_cmp(_data(), x_sw, y, y_words); 42| | 43| 141| if(relative_size >= 0) { ------------------ | Branch (43:10): [True: 141, False: 0] ------------------ 44| | // *this >= y 45| 141| bigint_sub2(mutable_data(), x_sw, y, y_words); 46| 141| } else { 47| | // *this < y: compute *this = y - *this 48| 0| bigint_sub2_rev(mutable_data(), y, y_words); 49| 0| } 50| | 51| 141| if(relative_size < 0) { ------------------ | Branch (51:10): [True: 0, False: 141] ------------------ 52| 0| set_sign(y_sign); 53| 141| } else if(relative_size == 0) { ------------------ | Branch (53:17): [True: 0, False: 141] ------------------ 54| 0| set_sign(Positive); 55| 0| } 56| 141| } 57| | 58| 141| return (*this); 59| 141|} _ZN5Botan6BigInt7mod_addERKS0_S2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 61| 486|BigInt& BigInt::mod_add(const BigInt& s, const BigInt& mod, secure_vector& ws) { 62| 486| if(this->signum() < 0 || s.signum() < 0 || mod.signum() < 0) { ------------------ | Branch (62:7): [True: 0, False: 486] | Branch (62:29): [True: 0, False: 486] | Branch (62:47): [True: 0, False: 486] ------------------ 63| 0| throw Invalid_Argument("BigInt::mod_add expects all arguments are positive"); 64| 0| } 65| | 66| 486| BOTAN_DEBUG_ASSERT(*this < mod); ------------------ | | 137| 486| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 486| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 486] | | ------------------ ------------------ 67| 486| BOTAN_DEBUG_ASSERT(s < mod); ------------------ | | 137| 486| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 486| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 486] | | ------------------ ------------------ 68| | 69| | /* 70| | t + s or t + s - p == t - (p - s) 71| | 72| | So first compute ws = p - s 73| | 74| | Then compute t + s and t - ws 75| | 76| | If t - ws does not borrow, then that is the correct valued 77| | */ 78| | 79| 486| const size_t mod_sw = mod.sig_words(); 80| 486| BOTAN_ARG_CHECK(mod_sw > 0, "BigInt::mod_add modulus must be positive"); ------------------ | | 35| 486| do { \ | | 36| 486| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 486| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 486] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 486| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 486] | | ------------------ ------------------ 81| | 82| 486| this->grow_to(mod_sw); 83| 486| s.grow_to(mod_sw); 84| | 85| | // First mod_sw for p - s, 2*mod_sw for bigint_addsub workspace 86| 486| if(ws.size() < 3 * mod_sw) { ------------------ | Branch (86:7): [True: 376, False: 110] ------------------ 87| 376| ws.resize(3 * mod_sw); 88| 376| } 89| | 90| | // NOLINTBEGIN(readability-container-data-pointer) 91| | 92| 486| word borrow = bigint_sub3(&ws[0], mod._data(), mod_sw, s._data(), mod_sw); 93| 486| BOTAN_DEBUG_ASSERT(borrow == 0); ------------------ | | 137| 486| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 486| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 486] | | ------------------ ------------------ 94| 486| BOTAN_UNUSED(borrow); ------------------ | | 151| 486|#define BOTAN_UNUSED Botan::ignore_params ------------------ 95| | 96| | // Compute t - ws 97| 486| borrow = bigint_sub3(&ws[mod_sw], this->_data(), mod_sw, &ws[0], mod_sw); 98| | 99| | // Compute t + s 100| 486| bigint_add3(&ws[mod_sw * 2], this->_data(), mod_sw, s._data(), mod_sw); 101| | 102| 486| CT::conditional_copy_mem(borrow, &ws[0], &ws[mod_sw * 2], &ws[mod_sw], mod_sw); 103| 486| set_words(&ws[0], mod_sw); 104| | 105| | // NOLINTEND(readability-container-data-pointer) 106| | 107| 486| return (*this); 108| 486|} _ZN5Botan6BigInt7mod_subERKS0_S2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 110| 14.7k|BigInt& BigInt::mod_sub(const BigInt& s, const BigInt& mod, secure_vector& ws) { 111| 14.7k| if(this->signum() < 0 || s.signum() < 0 || mod.signum() < 0) { ------------------ | Branch (111:7): [True: 0, False: 14.7k] | Branch (111:29): [True: 0, False: 14.7k] | Branch (111:47): [True: 0, False: 14.7k] ------------------ 112| 0| throw Invalid_Argument("BigInt::mod_sub expects all arguments are positive"); 113| 0| } 114| | 115| | // We are assuming in this function that *this and s are no more than mod_sw words long 116| 14.7k| BOTAN_DEBUG_ASSERT(*this < mod); ------------------ | | 137| 14.7k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 14.7k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 14.7k] | | ------------------ ------------------ 117| 14.7k| BOTAN_DEBUG_ASSERT(s < mod); ------------------ | | 137| 14.7k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 14.7k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 14.7k] | | ------------------ ------------------ 118| | 119| 14.7k| const size_t mod_sw = mod.sig_words(); 120| | 121| 14.7k| this->grow_to(mod_sw); 122| 14.7k| s.grow_to(mod_sw); 123| | 124| 14.7k| if(ws.size() < mod_sw) { ------------------ | Branch (124:7): [True: 0, False: 14.7k] ------------------ 125| 0| ws.resize(mod_sw); 126| 0| } 127| | 128| 14.7k| const word borrow = bigint_sub3(ws.data(), mutable_data(), mod_sw, s._data(), mod_sw); 129| | 130| | // Conditionally add back the modulus 131| 14.7k| bigint_cnd_add(borrow, ws.data(), mod._data(), mod_sw); 132| | 133| 14.7k| unchecked_copy_memory(mutable_data(), ws.data(), mod_sw); 134| | 135| 14.7k| return (*this); 136| 14.7k|} _ZN5Botan6BigInt7mod_mulEhRKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 138| 4.27k|BigInt& BigInt::mod_mul(uint8_t y, const BigInt& mod, secure_vector& ws) { 139| 4.27k| BOTAN_ARG_CHECK(this->signum() >= 0, "*this must be positive"); ------------------ | | 35| 4.27k| do { \ | | 36| 4.27k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 4.27k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 4.27k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 4.27k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 4.27k] | | ------------------ ------------------ 140| 4.27k| BOTAN_ARG_CHECK(y < 16, "y too large"); ------------------ | | 35| 4.27k| do { \ | | 36| 4.27k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 4.27k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 4.27k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 4.27k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 4.27k] | | ------------------ ------------------ 141| | 142| 4.27k| BOTAN_DEBUG_ASSERT(*this < mod); ------------------ | | 137| 4.27k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 4.27k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 4.27k] | | ------------------ ------------------ 143| | 144| 4.27k| *this *= static_cast(y); 145| 4.27k| this->reduce_below(mod, ws); 146| 4.27k| return (*this); 147| 4.27k|} _ZN5Botan6BigIntmLEm: 205| 4.27k|BigInt& BigInt::operator*=(word y) { 206| 4.27k| if(y == 0) { ------------------ | Branch (206:7): [True: 0, False: 4.27k] ------------------ 207| 0| clear(); 208| 0| set_sign(Positive); 209| 0| } 210| | 211| 4.27k| const word carry = bigint_linmul2(mutable_data(), size(), y); 212| 4.27k| set_word_at(size(), carry); 213| | 214| 4.27k| return (*this); 215| 4.27k|} _ZN5Botan6BigIntrMERKS0_: 232| 15.1k|BigInt& BigInt::operator%=(const BigInt& mod) { 233| 15.1k| return (*this = (*this) % mod); 234| 15.1k|} _ZN5Botan6BigIntrSEm: 287| 15.6k|BigInt& BigInt::operator>>=(size_t shift) { 288| 15.6k| bigint_shr1(m_data.mutable_data(), m_data.size(), shift); 289| | 290| 15.6k| if(sig_words() == 0 && m_signedness == Negative) { ------------------ | Branch (290:7): [True: 0, False: 15.6k] | Branch (290:27): [True: 0, False: 0] ------------------ 291| 0| m_signedness = Positive; 292| 0| } 293| | 294| 15.6k| return (*this); 295| 15.6k|} _ZN5Botan6BigInt4add2ERKS0_PKmmNS0_4SignE: 20| 4.69k|BigInt BigInt::add2(const BigInt& x, const word y[], size_t y_size, BigInt::Sign y_sign) { 21| 4.69k| const size_t x_sw = x.sig_words(); 22| | 23| 4.69k| BigInt z = BigInt::with_capacity(std::max(x_sw, y_size) + 1); 24| | 25| 4.69k| if(x.sign() == y_sign) { ------------------ | Branch (25:7): [True: 3.53k, False: 1.15k] ------------------ 26| 3.53k| const word carry = bigint_add3(z.mutable_data(), x._data(), x_sw, y, y_size); 27| 3.53k| z.mutable_data()[std::max(x_sw, y_size)] += carry; 28| 3.53k| z.set_sign(x.sign()); 29| 3.53k| } else { 30| 1.15k| const int32_t relative_size = bigint_cmp(x.data(), x_sw, y, y_size); 31| | 32| 1.15k| if(relative_size < 0) { ------------------ | Branch (32:10): [True: 0, False: 1.15k] ------------------ 33| | // x < y so z = abs(y - x) 34| | // NOLINTNEXTLINE(*-suspicious-call-argument) intentionally swapping x and y here 35| 0| bigint_sub3(z.mutable_data(), y, y_size, x.data(), x_sw); 36| 0| z.set_sign(y_sign); 37| 1.15k| } else if(relative_size == 0) { ------------------ | Branch (37:17): [True: 0, False: 1.15k] ------------------ 38| | // Positive zero (nothing to do in this case) 39| 1.15k| } else { 40| | /* 41| | * We know at this point that x >= y so if y_size is larger than 42| | * x_sw, we are guaranteed they are just leading zeros which can 43| | * be ignored 44| | */ 45| 1.15k| y_size = std::min(x_sw, y_size); 46| 1.15k| bigint_sub3(z.mutable_data(), x.data(), x_sw, y, y_size); 47| 1.15k| z.set_sign(x.sign()); 48| 1.15k| } 49| 1.15k| } 50| | 51| 4.69k| return z; 52| 4.69k|} _ZN5BotanmlERKNS_6BigIntES2_: 57| 436|BigInt operator*(const BigInt& x, const BigInt& y) { 58| 436| const size_t x_sw = x.sig_words(); 59| 436| const size_t y_sw = y.sig_words(); 60| | 61| 436| BigInt z = BigInt::with_capacity(x.size() + y.size()); 62| | 63| 436| if(x_sw == 1 && y_sw > 0) { ------------------ | Branch (63:7): [True: 55, False: 381] | Branch (63:20): [True: 55, False: 0] ------------------ 64| 55| bigint_linmul3(z.mutable_data(), y._data(), y_sw, x.word_at(0)); 65| 381| } else if(y_sw == 1 && x_sw > 0) { ------------------ | Branch (65:14): [True: 7, False: 374] | Branch (65:27): [True: 7, False: 0] ------------------ 66| 7| bigint_linmul3(z.mutable_data(), x._data(), x_sw, y.word_at(0)); 67| 374| } else if(x_sw > 0 && y_sw > 0) { ------------------ | Branch (67:14): [True: 372, False: 2] | Branch (67:26): [True: 372, False: 0] ------------------ 68| 372| secure_vector workspace(z.size()); 69| | 70| 372| bigint_mul(z.mutable_data(), 71| 372| z.size(), 72| 372| x._data(), 73| 372| x.size(), 74| 372| x_sw, 75| 372| y._data(), 76| 372| y.size(), 77| 372| y_sw, 78| 372| workspace.data(), 79| 372| workspace.size()); 80| 372| } 81| | 82| 436| z.cond_flip_sign(x_sw > 0 && y_sw > 0 && x.sign() != y.sign()); ------------------ | Branch (82:21): [True: 434, False: 2] | Branch (82:33): [True: 434, False: 0] | Branch (82:45): [True: 0, False: 434] ------------------ 83| | 84| 436| return z; 85| 436|} _ZN5BotandvERKNS_6BigIntEm: 120| 921|BigInt operator/(const BigInt& x, word y) { 121| 921| if(y == 0) { ------------------ | Branch (121:7): [True: 0, False: 921] ------------------ 122| 0| throw Invalid_Argument("BigInt::operator/ divide by zero"); 123| 0| } 124| | 125| 921| BigInt q; 126| 921| word r = 0; 127| 921| ct_divide_word(x, y, q, r); 128| 921| return q; 129| 921|} _ZN5BotanrmERKNS_6BigIntES2_: 134| 15.3k|BigInt operator%(const BigInt& n, const BigInt& mod) { 135| 15.3k| if(mod.is_zero()) { ------------------ | Branch (135:7): [True: 0, False: 15.3k] ------------------ 136| 0| throw Invalid_Argument("BigInt::operator% divide by zero"); 137| 0| } 138| 15.3k| if(mod.signum() < 0) { ------------------ | Branch (138:7): [True: 0, False: 15.3k] ------------------ 139| 0| throw Invalid_Argument("BigInt::operator% modulus must be > 0"); 140| 0| } 141| 15.3k| if(n.signum() >= 0 && mod.signum() >= 0 && n < mod) { ------------------ | Branch (141:7): [True: 15.3k, False: 0] | Branch (141:26): [True: 15.3k, False: 0] | Branch (141:47): [True: 39, False: 15.3k] ------------------ 142| 39| return n; 143| 39| } 144| | 145| 15.3k| if(mod.sig_words() == 1) { ------------------ | Branch (145:7): [True: 4.74k, False: 10.6k] ------------------ 146| 4.74k| return BigInt::from_word(n % mod.word_at(0)); 147| 4.74k| } 148| | 149| 10.6k| BigInt q; 150| 10.6k| BigInt r; 151| 10.6k| ct_divide(n, mod, q, r); 152| 10.6k| return r; 153| 15.3k|} _ZN5BotanrmERKNS_6BigIntEm: 158| 12.8k|word operator%(const BigInt& n, word mod) { 159| 12.8k| if(mod == 0) { ------------------ | Branch (159:7): [True: 0, False: 12.8k] ------------------ 160| 0| throw Invalid_Argument("BigInt::operator% divide by zero"); 161| 0| } 162| | 163| 12.8k| if(mod == 1) { ------------------ | Branch (163:7): [True: 0, False: 12.8k] ------------------ 164| 0| return 0; 165| 0| } 166| | 167| 12.8k| word remainder = 0; 168| | 169| 12.8k| if(n.signum() >= 0 && is_power_of_2(mod)) { ------------------ | Branch (169:7): [True: 12.8k, False: 0] | Branch (169:26): [True: 8.11k, False: 4.74k] ------------------ 170| 8.11k| remainder = (n.word_at(0) & (mod - 1)); 171| 8.11k| } else { 172| 4.74k| const auto redc_mod = divide_precomp::setup_vartime(mod); 173| 4.74k| const size_t sw = n.sig_words(); 174| 9.73k| for(size_t i = sw; i > 0; --i) { ------------------ | Branch (174:26): [True: 4.99k, False: 4.74k] ------------------ 175| 4.99k| remainder = redc_mod.mod_2to1(remainder, n.word_at(i - 1)); 176| 4.99k| } 177| 4.74k| } 178| | 179| 12.8k| if(remainder != 0 && n.sign() == BigInt::Negative) { ------------------ | Branch (179:7): [True: 12.8k, False: 0] | Branch (179:25): [True: 0, False: 12.8k] ------------------ 180| 0| return mod - remainder; 181| 0| } 182| 12.8k| return remainder; 183| 12.8k|} _ZN5BotanlsERKNS_6BigIntEm: 188| 70|BigInt operator<<(const BigInt& x, size_t shift) { 189| 70| if(shift >= 65536) { ------------------ | Branch (189:7): [True: 0, False: 70] ------------------ 190| 0| throw Invalid_Argument("BigInt left shift count too large"); 191| 0| } 192| | 193| 70| if(x.is_zero()) { ------------------ | Branch (193:7): [True: 0, False: 70] ------------------ 194| 0| return BigInt::zero(); 195| 0| } 196| | 197| 70| const size_t x_sw = x.sig_words(); 198| | 199| 70| const size_t new_size = x_sw + shift / WordInfo::bits + 1; 200| 70| BigInt y = BigInt::with_capacity(new_size); 201| 70| bigint_shl2(y.mutable_data(), new_size, x._data(), x_sw, shift); 202| 70| y.set_sign(x.sign()); 203| 70| return y; 204| 70|} _ZN5BotanrsERKNS_6BigIntEm: 209| 141|BigInt operator>>(const BigInt& x, size_t shift) { 210| 141| const size_t shift_words = shift / WordInfo::bits; 211| 141| const size_t x_sw = x.sig_words(); 212| | 213| 141| if(shift_words >= x_sw) { ------------------ | Branch (213:7): [True: 0, False: 141] ------------------ 214| 0| return BigInt::zero(); 215| 0| } 216| | 217| 141| const size_t new_size = x_sw - shift_words; 218| 141| BigInt y = BigInt::with_capacity(new_size); 219| 141| bigint_shr2(y.mutable_data(), new_size, x._data(), x_sw, shift); 220| | 221| 141| if(x.signum() < 0 && y.is_zero()) { ------------------ | Branch (221:7): [True: 0, False: 141] | Branch (221:25): [True: 0, False: 0] ------------------ 222| 0| y.set_sign(BigInt::Positive); 223| 141| } else { 224| 141| y.set_sign(x.sign()); 225| 141| } 226| | 227| 141| return y; 228| 141|} _ZN5Botan6BigIntC2Em: 18| 392|BigInt::BigInt(uint64_t n) { 19| 392| if constexpr(sizeof(word) == 8) { 20| 392| m_data.set_word_at(0, static_cast(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| | } 25| 392|} _ZN5Botan6BigInt8from_u64Em: 28| 77|BigInt BigInt::from_u64(uint64_t n) { 29| 77| return BigInt(n); 30| 77|} _ZN5Botan6BigInt9from_wordEm: 33| 4.88k|BigInt BigInt::from_word(word n) { 34| 4.88k| BigInt bn; 35| 4.88k| bn.set_word_at(0, n); 36| 4.88k| return bn; 37| 4.88k|} _ZN5Botan6BigInt8from_s32Ei: 40| 77|BigInt BigInt::from_s32(int32_t n) { 41| 77| if(n >= 0) { ------------------ | Branch (41:7): [True: 0, False: 77] ------------------ 42| 0| return BigInt::from_u64(static_cast(n)); 43| 77| } else { 44| 77| return -BigInt::from_u64(static_cast(-static_cast(n))); 45| 77| } 46| 77|} _ZN5Botan6BigInt13with_capacityEm: 49| 16.7k|BigInt BigInt::with_capacity(size_t size) { 50| 16.7k| BigInt bn; 51| 16.7k| bn.grow_to(size); 52| 16.7k| return bn; 53| 16.7k|} _ZN5Botan6BigInt11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 55| 1.89k|BigInt BigInt::from_string(std::string_view str) { 56| 1.89k| size_t prefix_bytes = 0; 57| 1.89k| bool negative = false; 58| 1.89k| size_t radix = 10; 59| | 60| 1.89k| if(!str.empty() && str[0] == '-') { ------------------ | Branch (60:7): [True: 1.89k, False: 0] | Branch (60:23): [True: 0, False: 1.89k] ------------------ 61| 0| prefix_bytes += 1; 62| 0| negative = true; 63| 0| } 64| | 65| 1.89k| if(str.length() > prefix_bytes + 2 && str[prefix_bytes] == '0' && str[prefix_bytes + 1] == 'x') { ------------------ | Branch (65:7): [True: 1.89k, False: 0] | Branch (65:42): [True: 1.89k, False: 0] | Branch (65:70): [True: 1.89k, False: 0] ------------------ 66| 1.89k| prefix_bytes += 2; 67| 1.89k| radix = 16; 68| 1.89k| } 69| | 70| 1.89k| BigInt r = BigInt::from_radix_digits(str.substr(prefix_bytes), radix); 71| | 72| 1.89k| if(negative) { ------------------ | Branch (72:7): [True: 0, False: 1.89k] ------------------ 73| 0| r.set_sign(Negative); 74| 1.89k| } else { 75| 1.89k| r.set_sign(Positive); 76| 1.89k| } 77| | 78| 1.89k| return r; 79| 1.89k|} _ZN5Botan6BigInt10from_bytesENSt3__14spanIKhLm18446744073709551615EEE: 81| 4.23k|BigInt BigInt::from_bytes(std::span input) { 82| 4.23k| BigInt r; 83| 4.23k| r.assign_from_bytes(input); 84| 4.23k| return r; 85| 4.23k|} _ZNK5Botan6BigInt7byte_atEm: 116| 42.8k|uint8_t BigInt::byte_at(size_t n) const { 117| 42.8k| return get_byte_var(sizeof(word) - (n % sizeof(word)) - 1, word_at(n / sizeof(word))); 118| 42.8k|} _ZNK5Botan6BigInt8cmp_wordEm: 120| 51.8k|int32_t BigInt::cmp_word(word other) const { 121| 51.8k| if(signum() < 0) { ------------------ | Branch (121:7): [True: 2.71k, False: 49.0k] ------------------ 122| 2.71k| return -1; // other is positive ... 123| 2.71k| } 124| | 125| 49.0k| const size_t sw = this->sig_words(); 126| 49.0k| if(sw > 1) { ------------------ | Branch (126:7): [True: 30.7k, False: 18.3k] ------------------ 127| 30.7k| return 1; // must be larger since other is just one word ... 128| 30.7k| } 129| | 130| 18.3k| return bigint_cmp(this->_data(), sw, &other, 1); 131| 49.0k|} _ZNK5Botan6BigInt3cmpERKS0_b: 136| 4.15k|int32_t BigInt::cmp(const BigInt& other, bool check_signs) const { 137| 4.15k| if(check_signs) { ------------------ | Branch (137:7): [True: 4.15k, False: 0] ------------------ 138| 4.15k| if(other.signum() >= 0 && this->signum() < 0) { ------------------ | Branch (138:10): [True: 4.15k, False: 0] | Branch (138:33): [True: 0, False: 4.15k] ------------------ 139| 0| return -1; 140| 0| } 141| | 142| 4.15k| if(other.signum() < 0 && this->signum() >= 0) { ------------------ | Branch (142:10): [True: 0, False: 4.15k] | Branch (142:32): [True: 0, False: 0] ------------------ 143| 0| return 1; 144| 0| } 145| | 146| 4.15k| if(other.signum() < 0 && this->signum() < 0) { ------------------ | Branch (146:10): [True: 0, False: 4.15k] | Branch (146:32): [True: 0, False: 0] ------------------ 147| 0| return (-bigint_cmp(this->_data(), this->size(), other._data(), other.size())); 148| 0| } 149| 4.15k| } 150| | 151| 4.15k| return bigint_cmp(this->_data(), this->size(), other._data(), other.size()); 152| 4.15k|} _ZNK5Botan6BigInt8is_equalERKS0_: 154| 1.94k|bool BigInt::is_equal(const BigInt& other) const { 155| 1.94k| if(this->sign() != other.sign()) { ------------------ | Branch (155:7): [True: 0, False: 1.94k] ------------------ 156| 0| return false; 157| 0| } 158| | 159| 1.94k| return bigint_ct_is_eq(this->_data(), this->size(), other._data(), other.size()).as_bool(); 160| 1.94k|} _ZNK5Botan6BigInt12is_less_thanERKS0_: 162| 19.1k|bool BigInt::is_less_than(const BigInt& other) const { 163| 19.1k| if(this->signum() < 0 && other.signum() >= 0) { ------------------ | Branch (163:7): [True: 0, False: 19.1k] | Branch (163:29): [True: 0, False: 0] ------------------ 164| 0| return true; 165| 0| } 166| | 167| 19.1k| if(this->signum() >= 0 && other.signum() < 0) { ------------------ | Branch (167:7): [True: 19.1k, False: 0] | Branch (167:30): [True: 0, False: 19.1k] ------------------ 168| 0| return false; 169| 0| } 170| | 171| 19.1k| if(other.signum() < 0 && this->signum() < 0) { ------------------ | Branch (171:7): [True: 0, False: 19.1k] | Branch (171:29): [True: 0, False: 0] ------------------ 172| 0| return bigint_ct_is_lt(other._data(), other.size(), this->_data(), this->size()).as_bool(); 173| 0| } 174| | 175| 19.1k| return bigint_ct_is_lt(this->_data(), this->size(), other._data(), other.size()).as_bool(); 176| 19.1k|} _ZNK5Botan6BigInt12encode_wordsEPmm: 178| 4.98k|void BigInt::encode_words(word out[], size_t size) const { 179| 4.98k| const size_t words = sig_words(); 180| | 181| 4.98k| if(words > size) { ------------------ | Branch (181:7): [True: 0, False: 4.98k] ------------------ 182| 0| throw Encoding_Error("BigInt::encode_words value too large to encode"); 183| 0| } 184| | 185| 4.98k| clear_mem(out, size); 186| 4.98k| copy_mem(out, _data(), words); 187| 4.98k|} _ZN5Botan6BigInt4Data11set_to_zeroEv: 189| 31.2k|void BigInt::Data::set_to_zero() { 190| 31.2k| m_reg.resize(m_reg.capacity()); 191| 31.2k| clear_mem(m_reg.data(), m_reg.size()); 192| 31.2k| m_sig_words = 0; 193| 31.2k|} _ZNK5Botan6BigInt4Data14calc_sig_wordsEv: 213| 125k|size_t BigInt::Data::calc_sig_words() const { 214| 125k| const size_t sz = m_reg.size(); 215| 125k| size_t sig = sz; 216| | 217| 125k| word sub = 1; 218| | 219| 1.16M| for(size_t i = 0; i != sz; ++i) { ------------------ | Branch (219:22): [True: 1.03M, False: 125k] ------------------ 220| 1.03M| const word w = m_reg[sz - i - 1]; 221| 1.03M| sub &= ct_is_zero(w); 222| 1.03M| sig -= sub; 223| 1.03M| } 224| | 225| | /* 226| | * This depends on the data so is poisoned, but unpoison it here as 227| | * later conditionals are made on the size. 228| | */ 229| 125k| CT::unpoison(sig); 230| | 231| 125k| return sig; 232| 125k|} _ZNK5Botan6BigInt13get_substringEmm: 237| 13.8k|uint32_t BigInt::get_substring(size_t offset, size_t length) const { 238| 13.8k| if(length == 0 || length > 32) { ------------------ | Branch (238:7): [True: 0, False: 13.8k] | Branch (238:22): [True: 0, False: 13.8k] ------------------ 239| 0| throw Invalid_Argument("BigInt::get_substring invalid substring length"); 240| 0| } 241| | 242| 13.8k| const uint32_t mask = 0xFFFFFFFF >> (32 - length); 243| | 244| 13.8k| const size_t word_offset = offset / WordInfo::bits; 245| 13.8k| const size_t wshift = (offset % WordInfo::bits); 246| | 247| | /* 248| | * The substring is contained within one or at most two words. The 249| | * offset and length are not secret, so we can perform conditional 250| | * operations on those values. 251| | */ 252| 13.8k| const word w0 = word_at(word_offset); 253| | 254| 13.8k| if(wshift == 0 || (offset + length) / WordInfo::bits == word_offset) { ------------------ | Branch (254:7): [True: 1.01k, False: 12.8k] | Branch (254:22): [True: 12.1k, False: 633] ------------------ 255| 13.2k| return static_cast(w0 >> wshift) & mask; 256| 13.2k| } else { 257| 633| const word w1 = word_at(word_offset + 1); 258| 633| return static_cast((w0 >> wshift) | (w1 << (WordInfo::bits - wshift))) & mask; 259| 633| } 260| 13.8k|} _ZNK5Botan6BigInt5bytesEv: 292| 30.6k|size_t BigInt::bytes() const { 293| 30.6k| return ceil_tobytes(bits()); 294| 30.6k|} _ZNK5Botan6BigInt13top_bits_freeEv: 296| 46.5k|size_t BigInt::top_bits_free() const { 297| 46.5k| const size_t words = sig_words(); 298| | 299| 46.5k| const word top_word = word_at(words - 1); 300| 46.5k| const size_t bits_used = high_bit(CT::value_barrier(top_word)); 301| 46.5k| CT::unpoison(bits_used); 302| 46.5k| return WordInfo::bits - bits_used; 303| 46.5k|} _ZNK5Botan6BigInt4bitsEv: 305| 47.7k|size_t BigInt::bits() const { 306| 47.7k| const size_t words = sig_words(); 307| | 308| 47.7k| if(words == 0) { ------------------ | Branch (308:7): [True: 1.24k, False: 46.5k] ------------------ 309| 1.24k| return 0; 310| 1.24k| } 311| | 312| 46.5k| const size_t full_words = (words - 1) * WordInfo::bits; 313| 46.5k| const size_t top_bits = WordInfo::bits - top_bits_free(); 314| | 315| 46.5k| return full_words + top_bits; 316| 47.7k|} _ZNK5Botan6BigIntngEv: 321| 77|BigInt BigInt::operator-() const { 322| 77| BigInt x = (*this); 323| 77| x.flip_sign(); 324| 77| return x; 325| 77|} _ZN5Botan6BigInt12reduce_belowERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 327| 4.27k|size_t BigInt::reduce_below(const BigInt& p, secure_vector& ws) { 328| 4.27k| if(p.signum() < 0 || this->signum() < 0) { ------------------ | Branch (328:7): [True: 0, False: 4.27k] | Branch (328:25): [True: 0, False: 4.27k] ------------------ 329| 0| throw Invalid_Argument("BigInt::reduce_below both values must be positive"); 330| 0| } 331| | 332| 4.27k| const size_t p_words = p.sig_words(); 333| | 334| 4.27k| if(size() < p_words + 1) { ------------------ | Branch (334:7): [True: 0, False: 4.27k] ------------------ 335| 0| grow_to(p_words + 1); 336| 0| } 337| | 338| 4.27k| if(ws.size() < p_words + 1) { ------------------ | Branch (338:7): [True: 0, False: 4.27k] ------------------ 339| 0| ws.resize(p_words + 1); 340| 0| } 341| | 342| 4.27k| clear_mem(ws.data(), ws.size()); 343| | 344| 4.27k| size_t reductions = 0; 345| | 346| 11.1k| for(;;) { 347| 11.1k| const word borrow = bigint_sub3(ws.data(), _data(), p_words + 1, p._data(), p_words); 348| 11.1k| if(borrow > 0) { ------------------ | Branch (348:10): [True: 4.27k, False: 6.90k] ------------------ 349| 4.27k| break; 350| 4.27k| } 351| | 352| 6.90k| ++reductions; 353| 6.90k| swap_reg(ws); 354| 6.90k| } 355| | 356| 4.27k| return reductions; 357| 4.27k|} _ZNK5Botan6BigInt12serialize_toENSt3__14spanIhLm18446744073709551615EEE: 393| 14.9k|void BigInt::serialize_to(std::span output) const { 394| 14.9k| BOTAN_ARG_CHECK(this->bytes() <= output.size(), "Insufficient output space"); ------------------ | | 35| 14.9k| do { \ | | 36| 14.9k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 14.9k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 14.9k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 14.9k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 14.9k] | | ------------------ ------------------ 395| | 396| 14.9k| this->binary_encode(output.data(), output.size()); 397| 14.9k|} _ZNK5Botan6BigInt13binary_encodeEPhm: 402| 14.9k|void BigInt::binary_encode(uint8_t output[], size_t len) const { 403| 14.9k| const size_t full_words = len / sizeof(word); 404| 14.9k| const size_t extra_bytes = len % sizeof(word); 405| | 406| 39.0k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (406:22): [True: 24.1k, False: 14.9k] ------------------ 407| 24.1k| const word w = word_at(i); 408| 24.1k| store_be(w, output + (len - (i + 1) * sizeof(word))); 409| 24.1k| } 410| | 411| 14.9k| if(extra_bytes > 0) { ------------------ | Branch (411:7): [True: 12.8k, False: 2.04k] ------------------ 412| 12.8k| const word w = word_at(full_words); 413| | 414| 42.8k| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (414:25): [True: 30.0k, False: 12.8k] ------------------ 415| 30.0k| output[extra_bytes - i - 1] = get_byte_var(sizeof(word) - i - 1, w); 416| 30.0k| } 417| 12.8k| } 418| 14.9k|} _ZN5Botan6BigInt17assign_from_bytesENSt3__14spanIKhLm18446744073709551615EEE: 423| 31.2k|void BigInt::assign_from_bytes(std::span bytes) { 424| 31.2k| clear(); 425| | 426| 31.2k| const size_t length = bytes.size(); 427| 31.2k| const size_t full_words = length / sizeof(word); 428| 31.2k| const size_t extra_bytes = length % sizeof(word); 429| | 430| 31.2k| const size_t total_words = full_words + (extra_bytes > 0 ? 1 : 0); ------------------ | Branch (430:45): [True: 24.1k, False: 7.02k] ------------------ 431| | 432| 31.2k| secure_vector reg(8 * ceil_division(total_words, 8)); 433| | 434| 81.2k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (434:22): [True: 50.0k, False: 31.2k] ------------------ 435| 50.0k| reg[i] = load_be(bytes.last()); 436| 50.0k| bytes = bytes.first(bytes.size() - sizeof(word)); 437| 50.0k| } 438| | 439| 31.2k| if(!bytes.empty()) { ------------------ | Branch (439:7): [True: 24.1k, False: 7.02k] ------------------ 440| 24.1k| BOTAN_ASSERT_NOMSG(extra_bytes == bytes.size()); ------------------ | | 84| 24.1k| do { \ | | 85| 24.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 24.1k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 24.1k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 24.1k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 24.1k] | | ------------------ ------------------ 441| 24.1k| std::array last_partial_word = {0}; 442| 24.1k| copy_mem(std::span{last_partial_word}.last(extra_bytes), bytes); 443| 24.1k| reg[full_words] = load_be(last_partial_word); 444| 24.1k| } 445| | 446| 31.2k| m_data.swap(reg); 447| 31.2k|} _ZN5Botan6BigInt14cond_flip_signEb: 521| 11.0k|void BigInt::cond_flip_sign(bool predicate) { 522| | // This code is assuming Negative == 0, Positive == 1 523| | 524| 11.0k| const auto mask = CT::Mask::expand_bool(predicate); 525| | 526| 11.0k| const uint8_t current_sign = static_cast(sign()); 527| | 528| 11.0k| const uint8_t new_sign = mask.select(current_sign ^ 1, current_sign); 529| | 530| 11.0k| set_sign(static_cast(new_sign)); 531| 11.0k|} _ZNK5Botan6BigInt20_const_time_unpoisonEv: 559| 225k|void BigInt::_const_time_unpoison() const { 560| 225k| CT::unpoison(m_data.const_data(), m_data.size()); 561| 225k|} _ZN5Botan9ct_divideERKNS_6BigIntES2_RS0_S3_: 180| 10.6k|void ct_divide(const BigInt& x, const BigInt& y, BigInt& q_out, BigInt& r_out) { 181| 10.6k| if(y.is_zero()) { ------------------ | Branch (181:7): [True: 0, False: 10.6k] ------------------ 182| 0| throw Invalid_Argument("ct_divide: cannot divide by zero"); 183| 0| } 184| | 185| 10.6k| BigInt q; 186| 10.6k| BigInt r; 187| 10.6k| ct_divide_impl(q, r, x, y); 188| | 189| 10.6k| sign_fixup(x, y, q, r); 190| 10.6k| r_out = std::move(r); 191| 10.6k| q_out = std::move(q); 192| 10.6k|} _ZN5Botan15ct_divide_pow2kEmRKNS_6BigIntE: 194| 2.42k|BigInt ct_divide_pow2k(size_t k, const BigInt& y) { 195| 2.42k| BOTAN_ARG_CHECK(y.signum() != 0, "Cannot divide by zero"); ------------------ | | 35| 2.42k| do { \ | | 36| 2.42k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.42k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2.42k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2.42k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.42k] | | ------------------ ------------------ 196| 2.42k| BOTAN_ARG_CHECK(y.signum() >= 0, "Negative divisor not supported"); ------------------ | | 35| 2.42k| do { \ | | 36| 2.42k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.42k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2.42k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2.42k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.42k] | | ------------------ ------------------ 197| 2.42k| BOTAN_ARG_CHECK(k > 1, "Invalid k"); ------------------ | | 35| 2.42k| do { \ | | 36| 2.42k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.42k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2.42k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2.42k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.42k] | | ------------------ ------------------ 198| | 199| 2.42k| BigInt q; 200| 2.42k| BigInt r; 201| 2.42k| ct_divide_impl(q, r, BigInt::power_of_2(k), y); 202| 2.42k| return q; 203| 2.42k|} _ZN5Botan14ct_divide_wordERKNS_6BigIntEmRS0_Rm: 205| 921|void ct_divide_word(const BigInt& x, word y, BigInt& q_out, word& r_out) { 206| 921| if(y == 0) { ------------------ | Branch (206:7): [True: 0, False: 921] ------------------ 207| 0| throw Invalid_Argument("ct_divide_word: cannot divide by zero"); 208| 0| } 209| | 210| 921| const size_t x_words = x.sig_words(); 211| | 212| | // The divisor is public here; setup is variable time in it 213| 921| const auto div_y = divide_precomp::setup_vartime(y); 214| | 215| 921| secure_vector qw(x_words); 216| 921| word r = 0; 217| | 218| | // Each step depends on r < y, which holds since r is a remainder mod y 219| 4.61k| for(size_t i = x_words; i > 0; --i) { ------------------ | Branch (219:28): [True: 3.69k, False: 921] ------------------ 220| 3.69k| const auto [qi, ri] = div_y.divmod_2to1_vartime(r, x._data()[i - 1]); 221| 3.69k| qw[i - 1] = qi; 222| 3.69k| r = ri; 223| 3.69k| } 224| | 225| 921| BigInt q = BigInt::_from_words(qw); 226| | 227| 921| if(x.signum() < 0) { ------------------ | Branch (227:7): [True: 0, False: 921] ------------------ 228| 0| q.flip_sign(); 229| 0| if(r != 0) { ------------------ | Branch (229:10): [True: 0, False: 0] ------------------ 230| 0| --q; 231| 0| r = y - r; 232| 0| } 233| 0| } 234| | 235| 921| r_out = r; 236| 921| q_out = std::move(q); 237| 921|} divide.cpp:_ZN5Botan12_GLOBAL__N_114ct_divide_implERNS_6BigIntES2_RKS1_S4_: 66| 13.0k|void ct_divide_impl(BigInt& q_out, BigInt& r_out, const BigInt& x, const BigInt& y) { 67| 13.0k| constexpr size_t WB = WordInfo::bits; 68| | 69| 13.0k| const size_t x_words = x.sig_words(); 70| 13.0k| const size_t y_words = y.sig_words(); 71| 13.0k| BOTAN_ASSERT_NOMSG(y_words > 0); ------------------ | | 84| 13.0k| do { \ | | 85| 13.0k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 13.0k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 13.0k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 13.0k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 13.0k] | | ------------------ ------------------ 72| | 73| 13.0k| if(x_words < y_words) { ------------------ | Branch (73:7): [True: 0, False: 13.0k] ------------------ 74| | // Here |x| < |y| so q = 0 and r = |x| 75| 0| r_out = x.abs(); 76| 0| q_out = BigInt::zero(); 77| 0| return; 78| 0| } 79| | 80| 13.0k| const size_t r_words = x_words + 1; 81| 13.0k| const size_t q_words = x_words - y_words + 1; 82| | 83| | // The number of leading zero bits of y, in [0,WB) 84| 13.0k| const word s = static_cast(WB) - static_cast(high_bit(CT::value_barrier(y._data()[y_words - 1]))); 85| 13.0k| const auto s_mask = CT::Mask::expand(s); 86| 13.0k| const word s_comp = s_mask.if_set_return(static_cast(WB) - s); 87| | 88| 13.0k| secure_vector yn(y_words); 89| 13.0k| secure_vector rw(r_words); 90| 13.0k| secure_vector qw(q_words); 91| | 92| | // Normalize: yn = |y| << s (which sets the top bit of yn) and rw = |x| << s; 93| | // shifting y stays within y_words words, shifting x adds at most one word 94| 13.0k| word carry = 0; 95| 56.7k| for(size_t i = 0; i != y_words; ++i) { ------------------ | Branch (95:22): [True: 43.7k, False: 13.0k] ------------------ 96| 43.7k| const word w = y._data()[i]; 97| 43.7k| yn[i] = (w << s) | carry; 98| 43.7k| carry = s_mask.if_set_return(w >> s_comp); 99| 43.7k| } 100| | 101| 13.0k| carry = 0; 102| 74.6k| for(size_t i = 0; i != x_words; ++i) { ------------------ | Branch (102:22): [True: 61.6k, False: 13.0k] ------------------ 103| 61.6k| const word w = x._data()[i]; 104| 61.6k| rw[i] = (w << s) | carry; 105| 61.6k| carry = s_mask.if_set_return(w >> s_comp); 106| 61.6k| } 107| 13.0k| rw[x_words] = carry; 108| | 109| 13.0k| const auto div_by_yn = divide_precomp::setup(CT::value_barrier(yn[y_words - 1])); 110| | 111| 13.0k| if(y_words == 1) { ------------------ | Branch (111:7): [True: 4, False: 13.0k] ------------------ 112| | /* 113| | * 2/1 word-serial division. The initial remainder is the shift-out 114| | * carry, which is less than 2^s and so less than the divisor. 115| | */ 116| 4| word r = rw[x_words]; 117| 16| for(size_t i = x_words; i > 0; --i) { ------------------ | Branch (117:31): [True: 12, False: 4] ------------------ 118| 12| const auto [qi, ri] = div_by_yn.divmod_2to1_ct(r, rw[i - 1]); 119| 12| qw[i - 1] = qi; 120| 12| r = ri; 121| 12| } 122| | 123| 4| rw[0] = r >> s; 124| 13.0k| } else { 125| 13.0k| const word yn1 = yn[y_words - 1]; 126| 13.0k| const word yn2 = yn[y_words - 2]; 127| | 128| 43.9k| for(size_t i = q_words; i > 0; --i) { ------------------ | Branch (128:31): [True: 30.9k, False: 13.0k] ------------------ 129| 30.9k| const size_t j = i - 1; // current window is rw[j ... j + y_words] 130| | 131| 30.9k| const word u2 = rw[j + y_words]; 132| 30.9k| const word u1 = rw[j + y_words - 1]; 133| 30.9k| const word u0 = rw[j + y_words - 2]; 134| | 135| | /* 136| | * Estimate the quotient digit from the top two words of the window. 137| | * The window invariant gives u2 <= yn1; if u2 == yn1 the 2/1 138| | * division precondition does not hold, and instead the digit 139| | * estimate is the maximum word value. 140| | */ 141| 30.9k| const auto top_eq = CT::Mask::is_equal(u2, yn1); 142| 30.9k| const word q_est = div_by_yn.divmod_2to1_ct(u2, u1).first; 143| 30.9k| word qhat = top_eq.select(WordInfo::max, q_est); 144| | 145| | // Per HAC 14.23, this correction is required at most twice 146| 30.9k| qhat -= division_check_ct(qhat, yn1, yn2, u2, u1, u0).if_set_return(1); 147| 30.9k| qhat -= division_check_ct(qhat, yn1, yn2, u2, u1, u0).if_set_return(1); 148| | 149| | // Subtract qhat * yn from the window 150| 30.9k| const word bw = bigint_submul(&rw[j], yn.data(), y_words, qhat); 151| 30.9k| word borrow = 0; 152| 30.9k| rw[j + y_words] = word_sub(u2, bw, &borrow); 153| | 154| | // If the digit was still one too large, the subtraction 155| | // underflowed; add back and decrement the digit 156| 30.9k| const word cb = bigint_cnd_add(borrow, &rw[j], yn.data(), y_words); 157| 30.9k| rw[j + y_words] += cb; 158| 30.9k| qhat -= borrow; 159| | 160| 30.9k| qw[j] = qhat; 161| 30.9k| } 162| | 163| | // The remainder is in rw[0:y_words], still shifted left by s, and 164| | // rw[y_words] is zero 165| 56.7k| for(size_t i = 0; i != y_words; ++i) { ------------------ | Branch (165:25): [True: 43.7k, False: 13.0k] ------------------ 166| 43.7k| rw[i] = (rw[i] >> s) | s_mask.if_set_return(CT::value_barrier(rw[i + 1]) << s_comp); 167| 43.7k| } 168| 13.0k| } 169| | 170| 13.0k| BigInt q = BigInt::_from_words(qw); 171| 13.0k| rw.resize(y_words); 172| 13.0k| BigInt r = BigInt::_from_words(rw); 173| | 174| 13.0k| r_out = std::move(r); 175| 13.0k| q_out = std::move(q); 176| 13.0k|} divide.cpp:_ZN5Botan12_GLOBAL__N_117division_check_ctEmmmmmm: 39| 61.8k|inline CT::Mask division_check_ct(word q, word y2, word y1, word x3, word x2, word x1) { 40| 61.8k| word y3 = 0; 41| 61.8k| y1 = word_madd2(q, y1, &y3); 42| 61.8k| y2 = word_madd2(q, y2, &y3); 43| | 44| 61.8k| const auto gt3 = CT::Mask::is_gt(y3, x3); 45| 61.8k| const auto eq3 = CT::Mask::is_equal(y3, x3); 46| 61.8k| const auto gt2 = CT::Mask::is_gt(y2, x2); 47| 61.8k| const auto eq2 = CT::Mask::is_equal(y2, x2); 48| 61.8k| const auto gt1 = CT::Mask::is_gt(y1, x1); 49| | 50| 61.8k| return gt3 | (eq3 & (gt2 | (eq2 & gt1))); 51| 61.8k|} divide.cpp:_ZN5Botan12_GLOBAL__N_110sign_fixupERKNS_6BigIntES3_RS1_S4_: 22| 10.6k|void sign_fixup(const BigInt& x, const BigInt& y, BigInt& q, BigInt& r) { 23| 10.6k| q.cond_flip_sign(x.sign() != y.sign()); 24| | 25| 10.6k| if(x.signum() < 0 && r.signum() != 0) { ------------------ | Branch (25:7): [True: 0, False: 10.6k] | Branch (25:25): [True: 0, False: 0] ------------------ 26| 0| if(y.signum() > 0) { ------------------ | Branch (26:10): [True: 0, False: 0] ------------------ 27| 0| q -= 1; 28| 0| } else { 29| 0| q += 1; 30| 0| } 31| 0| r = y.abs() - r; 32| 0| } 33| 10.6k|} _ZN5Botan17bigint_comba_sqr4EPmPKm: 22| 4.06M|void bigint_comba_sqr4(word z[8], const word x[4]) { 23| 4.06M|#if defined(BOTAN_HAS_MP_MULX) 24| 4.06M| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (24:7): [True: 4.06M, False: 0] ------------------ 25| 4.06M| return bigint_mulx_sqr4(z, x); 26| 4.06M| } 27| 0|#endif 28| | 29| 0| word3 accum; 30| | 31| 0| accum.mul(x[0], x[0]); 32| 0| z[0] = accum.extract(); 33| 0| accum.mul_x2(x[0], x[1]); 34| 0| z[1] = accum.extract(); 35| 0| accum.mul_x2(x[0], x[2]); 36| 0| accum.mul(x[1], x[1]); 37| 0| z[2] = accum.extract(); 38| 0| accum.mul_x2(x[0], x[3]); 39| 0| accum.mul_x2(x[1], x[2]); 40| 0| z[3] = accum.extract(); 41| 0| accum.mul_x2(x[1], x[3]); 42| 0| accum.mul(x[2], x[2]); 43| 0| z[4] = accum.extract(); 44| 0| accum.mul_x2(x[2], x[3]); 45| 0| z[5] = accum.extract(); 46| 0| accum.mul(x[3], x[3]); 47| 0| z[6] = accum.extract(); 48| 0| z[7] = accum.extract(); 49| 0|} _ZN5Botan17bigint_comba_mul4EPmPKmS2_: 54| 7.41M|void bigint_comba_mul4(word z[8], const word x[4], const word y[4]) { 55| 7.41M|#if defined(BOTAN_HAS_MP_MULX) 56| 7.41M| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (56:7): [True: 7.41M, False: 0] ------------------ 57| 7.41M| return bigint_mulx_mul4(z, x, y); 58| 7.41M| } 59| 0|#endif 60| | 61| 0| word3 accum; 62| | 63| 0| accum.mul(x[0], y[0]); 64| 0| z[0] = accum.extract(); 65| 0| accum.mul(x[0], y[1]); 66| 0| accum.mul(x[1], y[0]); 67| 0| z[1] = accum.extract(); 68| 0| accum.mul(x[0], y[2]); 69| 0| accum.mul(x[1], y[1]); 70| 0| accum.mul(x[2], y[0]); 71| 0| z[2] = accum.extract(); 72| 0| accum.mul(x[0], y[3]); 73| 0| accum.mul(x[1], y[2]); 74| 0| accum.mul(x[2], y[1]); 75| 0| accum.mul(x[3], y[0]); 76| 0| z[3] = accum.extract(); 77| 0| accum.mul(x[1], y[3]); 78| 0| accum.mul(x[2], y[2]); 79| 0| accum.mul(x[3], y[1]); 80| 0| z[4] = accum.extract(); 81| 0| accum.mul(x[2], y[3]); 82| 0| accum.mul(x[3], y[2]); 83| 0| z[5] = accum.extract(); 84| 0| accum.mul(x[3], y[3]); 85| 0| z[6] = accum.extract(); 86| 0| z[7] = accum.extract(); 87| 0|} _ZN5Botan17bigint_comba_sqr6EPmPKm: 92| 789k|void bigint_comba_sqr6(word z[12], const word x[6]) { 93| 789k|#if defined(BOTAN_HAS_MP_MULX) 94| 789k| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (94:7): [True: 789k, False: 0] ------------------ 95| 789k| return bigint_mulx_sqr6(z, x); 96| 789k| } 97| 0|#endif 98| | 99| 0| word3 accum; 100| | 101| 0| accum.mul(x[0], x[0]); 102| 0| z[0] = accum.extract(); 103| 0| accum.mul_x2(x[0], x[1]); 104| 0| z[1] = accum.extract(); 105| 0| accum.mul_x2(x[0], x[2]); 106| 0| accum.mul(x[1], x[1]); 107| 0| z[2] = accum.extract(); 108| 0| accum.mul_x2(x[0], x[3]); 109| 0| accum.mul_x2(x[1], x[2]); 110| 0| z[3] = accum.extract(); 111| 0| accum.mul_x2(x[0], x[4]); 112| 0| accum.mul_x2(x[1], x[3]); 113| 0| accum.mul(x[2], x[2]); 114| 0| z[4] = accum.extract(); 115| 0| accum.mul_x2(x[0], x[5]); 116| 0| accum.mul_x2(x[1], x[4]); 117| 0| accum.mul_x2(x[2], x[3]); 118| 0| z[5] = accum.extract(); 119| 0| accum.mul_x2(x[1], x[5]); 120| 0| accum.mul_x2(x[2], x[4]); 121| 0| accum.mul(x[3], x[3]); 122| 0| z[6] = accum.extract(); 123| 0| accum.mul_x2(x[2], x[5]); 124| 0| accum.mul_x2(x[3], x[4]); 125| 0| z[7] = accum.extract(); 126| 0| accum.mul_x2(x[3], x[5]); 127| 0| accum.mul(x[4], x[4]); 128| 0| z[8] = accum.extract(); 129| 0| accum.mul_x2(x[4], x[5]); 130| 0| z[9] = accum.extract(); 131| 0| accum.mul(x[5], x[5]); 132| 0| z[10] = accum.extract(); 133| 0| z[11] = accum.extract(); 134| 0|} _ZN5Botan17bigint_comba_mul6EPmPKmS2_: 139| 1.02M|void bigint_comba_mul6(word z[12], const word x[6], const word y[6]) { 140| 1.02M|#if defined(BOTAN_HAS_MP_MULX) 141| 1.02M| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (141:7): [True: 1.02M, False: 0] ------------------ 142| 1.02M| return bigint_mulx_mul6(z, x, y); 143| 1.02M| } 144| 0|#endif 145| | 146| 0| word3 accum; 147| | 148| 0| accum.mul(x[0], y[0]); 149| 0| z[0] = accum.extract(); 150| 0| accum.mul(x[0], y[1]); 151| 0| accum.mul(x[1], y[0]); 152| 0| z[1] = accum.extract(); 153| 0| accum.mul(x[0], y[2]); 154| 0| accum.mul(x[1], y[1]); 155| 0| accum.mul(x[2], y[0]); 156| 0| z[2] = accum.extract(); 157| 0| accum.mul(x[0], y[3]); 158| 0| accum.mul(x[1], y[2]); 159| 0| accum.mul(x[2], y[1]); 160| 0| accum.mul(x[3], y[0]); 161| 0| z[3] = accum.extract(); 162| 0| accum.mul(x[0], y[4]); 163| 0| accum.mul(x[1], y[3]); 164| 0| accum.mul(x[2], y[2]); 165| 0| accum.mul(x[3], y[1]); 166| 0| accum.mul(x[4], y[0]); 167| 0| z[4] = accum.extract(); 168| 0| accum.mul(x[0], y[5]); 169| 0| accum.mul(x[1], y[4]); 170| 0| accum.mul(x[2], y[3]); 171| 0| accum.mul(x[3], y[2]); 172| 0| accum.mul(x[4], y[1]); 173| 0| accum.mul(x[5], y[0]); 174| 0| z[5] = accum.extract(); 175| 0| accum.mul(x[1], y[5]); 176| 0| accum.mul(x[2], y[4]); 177| 0| accum.mul(x[3], y[3]); 178| 0| accum.mul(x[4], y[2]); 179| 0| accum.mul(x[5], y[1]); 180| 0| z[6] = accum.extract(); 181| 0| accum.mul(x[2], y[5]); 182| 0| accum.mul(x[3], y[4]); 183| 0| accum.mul(x[4], y[3]); 184| 0| accum.mul(x[5], y[2]); 185| 0| z[7] = accum.extract(); 186| 0| accum.mul(x[3], y[5]); 187| 0| accum.mul(x[4], y[4]); 188| 0| accum.mul(x[5], y[3]); 189| 0| z[8] = accum.extract(); 190| 0| accum.mul(x[4], y[5]); 191| 0| accum.mul(x[5], y[4]); 192| 0| z[9] = accum.extract(); 193| 0| accum.mul(x[5], y[5]); 194| 0| z[10] = accum.extract(); 195| 0| z[11] = accum.extract(); 196| 0|} _ZN5Botan17bigint_comba_sqr8EPmPKm: 322| 16.6k|void bigint_comba_sqr8(word z[16], const word x[8]) { 323| 16.6k|#if defined(BOTAN_HAS_MP_MULX) 324| 16.6k| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (324:7): [True: 16.6k, False: 0] ------------------ 325| 16.6k| return bigint_mulx_sqr8(z, x); 326| 16.6k| } 327| 0|#endif 328| | 329| 0| word3 accum; 330| | 331| 0| accum.mul(x[0], x[0]); 332| 0| z[0] = accum.extract(); 333| 0| accum.mul_x2(x[0], x[1]); 334| 0| z[1] = accum.extract(); 335| 0| accum.mul_x2(x[0], x[2]); 336| 0| accum.mul(x[1], x[1]); 337| 0| z[2] = accum.extract(); 338| 0| accum.mul_x2(x[0], x[3]); 339| 0| accum.mul_x2(x[1], x[2]); 340| 0| z[3] = accum.extract(); 341| 0| accum.mul_x2(x[0], x[4]); 342| 0| accum.mul_x2(x[1], x[3]); 343| 0| accum.mul(x[2], x[2]); 344| 0| z[4] = accum.extract(); 345| 0| accum.mul_x2(x[0], x[5]); 346| 0| accum.mul_x2(x[1], x[4]); 347| 0| accum.mul_x2(x[2], x[3]); 348| 0| z[5] = accum.extract(); 349| 0| accum.mul_x2(x[0], x[6]); 350| 0| accum.mul_x2(x[1], x[5]); 351| 0| accum.mul_x2(x[2], x[4]); 352| 0| accum.mul(x[3], x[3]); 353| 0| z[6] = accum.extract(); 354| 0| accum.mul_x2(x[0], x[7]); 355| 0| accum.mul_x2(x[1], x[6]); 356| 0| accum.mul_x2(x[2], x[5]); 357| 0| accum.mul_x2(x[3], x[4]); 358| 0| z[7] = accum.extract(); 359| 0| accum.mul_x2(x[1], x[7]); 360| 0| accum.mul_x2(x[2], x[6]); 361| 0| accum.mul_x2(x[3], x[5]); 362| 0| accum.mul(x[4], x[4]); 363| 0| z[8] = accum.extract(); 364| 0| accum.mul_x2(x[2], x[7]); 365| 0| accum.mul_x2(x[3], x[6]); 366| 0| accum.mul_x2(x[4], x[5]); 367| 0| z[9] = accum.extract(); 368| 0| accum.mul_x2(x[3], x[7]); 369| 0| accum.mul_x2(x[4], x[6]); 370| 0| accum.mul(x[5], x[5]); 371| 0| z[10] = accum.extract(); 372| 0| accum.mul_x2(x[4], x[7]); 373| 0| accum.mul_x2(x[5], x[6]); 374| 0| z[11] = accum.extract(); 375| 0| accum.mul_x2(x[5], x[7]); 376| 0| accum.mul(x[6], x[6]); 377| 0| z[12] = accum.extract(); 378| 0| accum.mul_x2(x[6], x[7]); 379| 0| z[13] = accum.extract(); 380| 0| accum.mul(x[7], x[7]); 381| 0| z[14] = accum.extract(); 382| 0| z[15] = accum.extract(); 383| 0|} _ZN5Botan17bigint_comba_mul8EPmPKmS2_: 388| 43.3k|void bigint_comba_mul8(word z[16], const word x[8], const word y[8]) { 389| 43.3k|#if defined(BOTAN_HAS_MP_MULX) 390| 43.3k| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (390:7): [True: 43.3k, False: 0] ------------------ 391| 43.3k| return bigint_mulx_mul8(z, x, y); 392| 43.3k| } 393| 0|#endif 394| | 395| 0| word3 accum; 396| | 397| 0| accum.mul(x[0], y[0]); 398| 0| z[0] = accum.extract(); 399| 0| accum.mul(x[0], y[1]); 400| 0| accum.mul(x[1], y[0]); 401| 0| z[1] = accum.extract(); 402| 0| accum.mul(x[0], y[2]); 403| 0| accum.mul(x[1], y[1]); 404| 0| accum.mul(x[2], y[0]); 405| 0| z[2] = accum.extract(); 406| 0| accum.mul(x[0], y[3]); 407| 0| accum.mul(x[1], y[2]); 408| 0| accum.mul(x[2], y[1]); 409| 0| accum.mul(x[3], y[0]); 410| 0| z[3] = accum.extract(); 411| 0| accum.mul(x[0], y[4]); 412| 0| accum.mul(x[1], y[3]); 413| 0| accum.mul(x[2], y[2]); 414| 0| accum.mul(x[3], y[1]); 415| 0| accum.mul(x[4], y[0]); 416| 0| z[4] = accum.extract(); 417| 0| accum.mul(x[0], y[5]); 418| 0| accum.mul(x[1], y[4]); 419| 0| accum.mul(x[2], y[3]); 420| 0| accum.mul(x[3], y[2]); 421| 0| accum.mul(x[4], y[1]); 422| 0| accum.mul(x[5], y[0]); 423| 0| z[5] = accum.extract(); 424| 0| accum.mul(x[0], y[6]); 425| 0| accum.mul(x[1], y[5]); 426| 0| accum.mul(x[2], y[4]); 427| 0| accum.mul(x[3], y[3]); 428| 0| accum.mul(x[4], y[2]); 429| 0| accum.mul(x[5], y[1]); 430| 0| accum.mul(x[6], y[0]); 431| 0| z[6] = accum.extract(); 432| 0| accum.mul(x[0], y[7]); 433| 0| accum.mul(x[1], y[6]); 434| 0| accum.mul(x[2], y[5]); 435| 0| accum.mul(x[3], y[4]); 436| 0| accum.mul(x[4], y[3]); 437| 0| accum.mul(x[5], y[2]); 438| 0| accum.mul(x[6], y[1]); 439| 0| accum.mul(x[7], y[0]); 440| 0| z[7] = accum.extract(); 441| 0| accum.mul(x[1], y[7]); 442| 0| accum.mul(x[2], y[6]); 443| 0| accum.mul(x[3], y[5]); 444| 0| accum.mul(x[4], y[4]); 445| 0| accum.mul(x[5], y[3]); 446| 0| accum.mul(x[6], y[2]); 447| 0| accum.mul(x[7], y[1]); 448| 0| z[8] = accum.extract(); 449| 0| accum.mul(x[2], y[7]); 450| 0| accum.mul(x[3], y[6]); 451| 0| accum.mul(x[4], y[5]); 452| 0| accum.mul(x[5], y[4]); 453| 0| accum.mul(x[6], y[3]); 454| 0| accum.mul(x[7], y[2]); 455| 0| z[9] = accum.extract(); 456| 0| accum.mul(x[3], y[7]); 457| 0| accum.mul(x[4], y[6]); 458| 0| accum.mul(x[5], y[5]); 459| 0| accum.mul(x[6], y[4]); 460| 0| accum.mul(x[7], y[3]); 461| 0| z[10] = accum.extract(); 462| 0| accum.mul(x[4], y[7]); 463| 0| accum.mul(x[5], y[6]); 464| 0| accum.mul(x[6], y[5]); 465| 0| accum.mul(x[7], y[4]); 466| 0| z[11] = accum.extract(); 467| 0| accum.mul(x[5], y[7]); 468| 0| accum.mul(x[6], y[6]); 469| 0| accum.mul(x[7], y[5]); 470| 0| z[12] = accum.extract(); 471| 0| accum.mul(x[6], y[7]); 472| 0| accum.mul(x[7], y[6]); 473| 0| z[13] = accum.extract(); 474| 0| accum.mul(x[7], y[7]); 475| 0| z[14] = accum.extract(); 476| 0| z[15] = accum.extract(); 477| 0|} _ZN5Botan17bigint_comba_sqr9EPmPKm: 482| 800k|void bigint_comba_sqr9(word z[18], const word x[9]) { 483| 800k|#if defined(BOTAN_HAS_MP_MULX) 484| 800k| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (484:7): [True: 800k, False: 0] ------------------ 485| 800k| return bigint_mulx_sqr9(z, x); 486| 800k| } 487| 0|#endif 488| | 489| 0| word3 accum; 490| | 491| 0| accum.mul(x[0], x[0]); 492| 0| z[0] = accum.extract(); 493| 0| accum.mul_x2(x[0], x[1]); 494| 0| z[1] = accum.extract(); 495| 0| accum.mul_x2(x[0], x[2]); 496| 0| accum.mul(x[1], x[1]); 497| 0| z[2] = accum.extract(); 498| 0| accum.mul_x2(x[0], x[3]); 499| 0| accum.mul_x2(x[1], x[2]); 500| 0| z[3] = accum.extract(); 501| 0| accum.mul_x2(x[0], x[4]); 502| 0| accum.mul_x2(x[1], x[3]); 503| 0| accum.mul(x[2], x[2]); 504| 0| z[4] = accum.extract(); 505| 0| accum.mul_x2(x[0], x[5]); 506| 0| accum.mul_x2(x[1], x[4]); 507| 0| accum.mul_x2(x[2], x[3]); 508| 0| z[5] = accum.extract(); 509| 0| accum.mul_x2(x[0], x[6]); 510| 0| accum.mul_x2(x[1], x[5]); 511| 0| accum.mul_x2(x[2], x[4]); 512| 0| accum.mul(x[3], x[3]); 513| 0| z[6] = accum.extract(); 514| 0| accum.mul_x2(x[0], x[7]); 515| 0| accum.mul_x2(x[1], x[6]); 516| 0| accum.mul_x2(x[2], x[5]); 517| 0| accum.mul_x2(x[3], x[4]); 518| 0| z[7] = accum.extract(); 519| 0| accum.mul_x2(x[0], x[8]); 520| 0| accum.mul_x2(x[1], x[7]); 521| 0| accum.mul_x2(x[2], x[6]); 522| 0| accum.mul_x2(x[3], x[5]); 523| 0| accum.mul(x[4], x[4]); 524| 0| z[8] = accum.extract(); 525| 0| accum.mul_x2(x[1], x[8]); 526| 0| accum.mul_x2(x[2], x[7]); 527| 0| accum.mul_x2(x[3], x[6]); 528| 0| accum.mul_x2(x[4], x[5]); 529| 0| z[9] = accum.extract(); 530| 0| accum.mul_x2(x[2], x[8]); 531| 0| accum.mul_x2(x[3], x[7]); 532| 0| accum.mul_x2(x[4], x[6]); 533| 0| accum.mul(x[5], x[5]); 534| 0| z[10] = accum.extract(); 535| 0| accum.mul_x2(x[3], x[8]); 536| 0| accum.mul_x2(x[4], x[7]); 537| 0| accum.mul_x2(x[5], x[6]); 538| 0| z[11] = accum.extract(); 539| 0| accum.mul_x2(x[4], x[8]); 540| 0| accum.mul_x2(x[5], x[7]); 541| 0| accum.mul(x[6], x[6]); 542| 0| z[12] = accum.extract(); 543| 0| accum.mul_x2(x[5], x[8]); 544| 0| accum.mul_x2(x[6], x[7]); 545| 0| z[13] = accum.extract(); 546| 0| accum.mul_x2(x[6], x[8]); 547| 0| accum.mul(x[7], x[7]); 548| 0| z[14] = accum.extract(); 549| 0| accum.mul_x2(x[7], x[8]); 550| 0| z[15] = accum.extract(); 551| 0| accum.mul(x[8], x[8]); 552| 0| z[16] = accum.extract(); 553| 0| z[17] = accum.extract(); 554| 0|} _ZN5Botan17bigint_comba_mul9EPmPKmS2_: 559| 1.02M|void bigint_comba_mul9(word z[18], const word x[9], const word y[9]) { 560| 1.02M|#if defined(BOTAN_HAS_MP_MULX) 561| 1.02M| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (561:7): [True: 1.02M, False: 0] ------------------ 562| 1.02M| return bigint_mulx_mul9(z, x, y); 563| 1.02M| } 564| 0|#endif 565| | 566| 0| word3 accum; 567| | 568| 0| accum.mul(x[0], y[0]); 569| 0| z[0] = accum.extract(); 570| 0| accum.mul(x[0], y[1]); 571| 0| accum.mul(x[1], y[0]); 572| 0| z[1] = accum.extract(); 573| 0| accum.mul(x[0], y[2]); 574| 0| accum.mul(x[1], y[1]); 575| 0| accum.mul(x[2], y[0]); 576| 0| z[2] = accum.extract(); 577| 0| accum.mul(x[0], y[3]); 578| 0| accum.mul(x[1], y[2]); 579| 0| accum.mul(x[2], y[1]); 580| 0| accum.mul(x[3], y[0]); 581| 0| z[3] = accum.extract(); 582| 0| accum.mul(x[0], y[4]); 583| 0| accum.mul(x[1], y[3]); 584| 0| accum.mul(x[2], y[2]); 585| 0| accum.mul(x[3], y[1]); 586| 0| accum.mul(x[4], y[0]); 587| 0| z[4] = accum.extract(); 588| 0| accum.mul(x[0], y[5]); 589| 0| accum.mul(x[1], y[4]); 590| 0| accum.mul(x[2], y[3]); 591| 0| accum.mul(x[3], y[2]); 592| 0| accum.mul(x[4], y[1]); 593| 0| accum.mul(x[5], y[0]); 594| 0| z[5] = accum.extract(); 595| 0| accum.mul(x[0], y[6]); 596| 0| accum.mul(x[1], y[5]); 597| 0| accum.mul(x[2], y[4]); 598| 0| accum.mul(x[3], y[3]); 599| 0| accum.mul(x[4], y[2]); 600| 0| accum.mul(x[5], y[1]); 601| 0| accum.mul(x[6], y[0]); 602| 0| z[6] = accum.extract(); 603| 0| accum.mul(x[0], y[7]); 604| 0| accum.mul(x[1], y[6]); 605| 0| accum.mul(x[2], y[5]); 606| 0| accum.mul(x[3], y[4]); 607| 0| accum.mul(x[4], y[3]); 608| 0| accum.mul(x[5], y[2]); 609| 0| accum.mul(x[6], y[1]); 610| 0| accum.mul(x[7], y[0]); 611| 0| z[7] = accum.extract(); 612| 0| accum.mul(x[0], y[8]); 613| 0| accum.mul(x[1], y[7]); 614| 0| accum.mul(x[2], y[6]); 615| 0| accum.mul(x[3], y[5]); 616| 0| accum.mul(x[4], y[4]); 617| 0| accum.mul(x[5], y[3]); 618| 0| accum.mul(x[6], y[2]); 619| 0| accum.mul(x[7], y[1]); 620| 0| accum.mul(x[8], y[0]); 621| 0| z[8] = accum.extract(); 622| 0| accum.mul(x[1], y[8]); 623| 0| accum.mul(x[2], y[7]); 624| 0| accum.mul(x[3], y[6]); 625| 0| accum.mul(x[4], y[5]); 626| 0| accum.mul(x[5], y[4]); 627| 0| accum.mul(x[6], y[3]); 628| 0| accum.mul(x[7], y[2]); 629| 0| accum.mul(x[8], y[1]); 630| 0| z[9] = accum.extract(); 631| 0| accum.mul(x[2], y[8]); 632| 0| accum.mul(x[3], y[7]); 633| 0| accum.mul(x[4], y[6]); 634| 0| accum.mul(x[5], y[5]); 635| 0| accum.mul(x[6], y[4]); 636| 0| accum.mul(x[7], y[3]); 637| 0| accum.mul(x[8], y[2]); 638| 0| z[10] = accum.extract(); 639| 0| accum.mul(x[3], y[8]); 640| 0| accum.mul(x[4], y[7]); 641| 0| accum.mul(x[5], y[6]); 642| 0| accum.mul(x[6], y[5]); 643| 0| accum.mul(x[7], y[4]); 644| 0| accum.mul(x[8], y[3]); 645| 0| z[11] = accum.extract(); 646| 0| accum.mul(x[4], y[8]); 647| 0| accum.mul(x[5], y[7]); 648| 0| accum.mul(x[6], y[6]); 649| 0| accum.mul(x[7], y[5]); 650| 0| accum.mul(x[8], y[4]); 651| 0| z[12] = accum.extract(); 652| 0| accum.mul(x[5], y[8]); 653| 0| accum.mul(x[6], y[7]); 654| 0| accum.mul(x[7], y[6]); 655| 0| accum.mul(x[8], y[5]); 656| 0| z[13] = accum.extract(); 657| 0| accum.mul(x[6], y[8]); 658| 0| accum.mul(x[7], y[7]); 659| 0| accum.mul(x[8], y[6]); 660| 0| z[14] = accum.extract(); 661| 0| accum.mul(x[7], y[8]); 662| 0| accum.mul(x[8], y[7]); 663| 0| z[15] = accum.extract(); 664| 0| accum.mul(x[8], y[8]); 665| 0| z[16] = accum.extract(); 666| 0| z[17] = accum.extract(); 667| 0|} _ZN5Botan18bigint_comba_sqr16EPmPKm: 672| 136|void bigint_comba_sqr16(word z[32], const word x[16]) { 673| 136| word3 accum; 674| | 675| 136| accum.mul(x[0], x[0]); 676| 136| z[0] = accum.extract(); 677| 136| accum.mul_x2(x[0], x[1]); 678| 136| z[1] = accum.extract(); 679| 136| accum.mul_x2(x[0], x[2]); 680| 136| accum.mul(x[1], x[1]); 681| 136| z[2] = accum.extract(); 682| 136| accum.mul_x2(x[0], x[3]); 683| 136| accum.mul_x2(x[1], x[2]); 684| 136| z[3] = accum.extract(); 685| 136| accum.mul_x2(x[0], x[4]); 686| 136| accum.mul_x2(x[1], x[3]); 687| 136| accum.mul(x[2], x[2]); 688| 136| z[4] = accum.extract(); 689| 136| accum.mul_x2(x[0], x[5]); 690| 136| accum.mul_x2(x[1], x[4]); 691| 136| accum.mul_x2(x[2], x[3]); 692| 136| z[5] = accum.extract(); 693| 136| accum.mul_x2(x[0], x[6]); 694| 136| accum.mul_x2(x[1], x[5]); 695| 136| accum.mul_x2(x[2], x[4]); 696| 136| accum.mul(x[3], x[3]); 697| 136| z[6] = accum.extract(); 698| 136| accum.mul_x2(x[0], x[7]); 699| 136| accum.mul_x2(x[1], x[6]); 700| 136| accum.mul_x2(x[2], x[5]); 701| 136| accum.mul_x2(x[3], x[4]); 702| 136| z[7] = accum.extract(); 703| 136| accum.mul_x2(x[0], x[8]); 704| 136| accum.mul_x2(x[1], x[7]); 705| 136| accum.mul_x2(x[2], x[6]); 706| 136| accum.mul_x2(x[3], x[5]); 707| 136| accum.mul(x[4], x[4]); 708| 136| z[8] = accum.extract(); 709| 136| accum.mul_x2(x[0], x[9]); 710| 136| accum.mul_x2(x[1], x[8]); 711| 136| accum.mul_x2(x[2], x[7]); 712| 136| accum.mul_x2(x[3], x[6]); 713| 136| accum.mul_x2(x[4], x[5]); 714| 136| z[9] = accum.extract(); 715| 136| accum.mul_x2(x[0], x[10]); 716| 136| accum.mul_x2(x[1], x[9]); 717| 136| accum.mul_x2(x[2], x[8]); 718| 136| accum.mul_x2(x[3], x[7]); 719| 136| accum.mul_x2(x[4], x[6]); 720| 136| accum.mul(x[5], x[5]); 721| 136| z[10] = accum.extract(); 722| 136| accum.mul_x2(x[0], x[11]); 723| 136| accum.mul_x2(x[1], x[10]); 724| 136| accum.mul_x2(x[2], x[9]); 725| 136| accum.mul_x2(x[3], x[8]); 726| 136| accum.mul_x2(x[4], x[7]); 727| 136| accum.mul_x2(x[5], x[6]); 728| 136| z[11] = accum.extract(); 729| 136| accum.mul_x2(x[0], x[12]); 730| 136| accum.mul_x2(x[1], x[11]); 731| 136| accum.mul_x2(x[2], x[10]); 732| 136| accum.mul_x2(x[3], x[9]); 733| 136| accum.mul_x2(x[4], x[8]); 734| 136| accum.mul_x2(x[5], x[7]); 735| 136| accum.mul(x[6], x[6]); 736| 136| z[12] = accum.extract(); 737| 136| accum.mul_x2(x[0], x[13]); 738| 136| accum.mul_x2(x[1], x[12]); 739| 136| accum.mul_x2(x[2], x[11]); 740| 136| accum.mul_x2(x[3], x[10]); 741| 136| accum.mul_x2(x[4], x[9]); 742| 136| accum.mul_x2(x[5], x[8]); 743| 136| accum.mul_x2(x[6], x[7]); 744| 136| z[13] = accum.extract(); 745| 136| accum.mul_x2(x[0], x[14]); 746| 136| accum.mul_x2(x[1], x[13]); 747| 136| accum.mul_x2(x[2], x[12]); 748| 136| accum.mul_x2(x[3], x[11]); 749| 136| accum.mul_x2(x[4], x[10]); 750| 136| accum.mul_x2(x[5], x[9]); 751| 136| accum.mul_x2(x[6], x[8]); 752| 136| accum.mul(x[7], x[7]); 753| 136| z[14] = accum.extract(); 754| 136| accum.mul_x2(x[0], x[15]); 755| 136| accum.mul_x2(x[1], x[14]); 756| 136| accum.mul_x2(x[2], x[13]); 757| 136| accum.mul_x2(x[3], x[12]); 758| 136| accum.mul_x2(x[4], x[11]); 759| 136| accum.mul_x2(x[5], x[10]); 760| 136| accum.mul_x2(x[6], x[9]); 761| 136| accum.mul_x2(x[7], x[8]); 762| 136| z[15] = accum.extract(); 763| 136| accum.mul_x2(x[1], x[15]); 764| 136| accum.mul_x2(x[2], x[14]); 765| 136| accum.mul_x2(x[3], x[13]); 766| 136| accum.mul_x2(x[4], x[12]); 767| 136| accum.mul_x2(x[5], x[11]); 768| 136| accum.mul_x2(x[6], x[10]); 769| 136| accum.mul_x2(x[7], x[9]); 770| 136| accum.mul(x[8], x[8]); 771| 136| z[16] = accum.extract(); 772| 136| accum.mul_x2(x[2], x[15]); 773| 136| accum.mul_x2(x[3], x[14]); 774| 136| accum.mul_x2(x[4], x[13]); 775| 136| accum.mul_x2(x[5], x[12]); 776| 136| accum.mul_x2(x[6], x[11]); 777| 136| accum.mul_x2(x[7], x[10]); 778| 136| accum.mul_x2(x[8], x[9]); 779| 136| z[17] = accum.extract(); 780| 136| accum.mul_x2(x[3], x[15]); 781| 136| accum.mul_x2(x[4], x[14]); 782| 136| accum.mul_x2(x[5], x[13]); 783| 136| accum.mul_x2(x[6], x[12]); 784| 136| accum.mul_x2(x[7], x[11]); 785| 136| accum.mul_x2(x[8], x[10]); 786| 136| accum.mul(x[9], x[9]); 787| 136| z[18] = accum.extract(); 788| 136| accum.mul_x2(x[4], x[15]); 789| 136| accum.mul_x2(x[5], x[14]); 790| 136| accum.mul_x2(x[6], x[13]); 791| 136| accum.mul_x2(x[7], x[12]); 792| 136| accum.mul_x2(x[8], x[11]); 793| 136| accum.mul_x2(x[9], x[10]); 794| 136| z[19] = accum.extract(); 795| 136| accum.mul_x2(x[5], x[15]); 796| 136| accum.mul_x2(x[6], x[14]); 797| 136| accum.mul_x2(x[7], x[13]); 798| 136| accum.mul_x2(x[8], x[12]); 799| 136| accum.mul_x2(x[9], x[11]); 800| 136| accum.mul(x[10], x[10]); 801| 136| z[20] = accum.extract(); 802| 136| accum.mul_x2(x[6], x[15]); 803| 136| accum.mul_x2(x[7], x[14]); 804| 136| accum.mul_x2(x[8], x[13]); 805| 136| accum.mul_x2(x[9], x[12]); 806| 136| accum.mul_x2(x[10], x[11]); 807| 136| z[21] = accum.extract(); 808| 136| accum.mul_x2(x[7], x[15]); 809| 136| accum.mul_x2(x[8], x[14]); 810| 136| accum.mul_x2(x[9], x[13]); 811| 136| accum.mul_x2(x[10], x[12]); 812| 136| accum.mul(x[11], x[11]); 813| 136| z[22] = accum.extract(); 814| 136| accum.mul_x2(x[8], x[15]); 815| 136| accum.mul_x2(x[9], x[14]); 816| 136| accum.mul_x2(x[10], x[13]); 817| 136| accum.mul_x2(x[11], x[12]); 818| 136| z[23] = accum.extract(); 819| 136| accum.mul_x2(x[9], x[15]); 820| 136| accum.mul_x2(x[10], x[14]); 821| 136| accum.mul_x2(x[11], x[13]); 822| 136| accum.mul(x[12], x[12]); 823| 136| z[24] = accum.extract(); 824| 136| accum.mul_x2(x[10], x[15]); 825| 136| accum.mul_x2(x[11], x[14]); 826| 136| accum.mul_x2(x[12], x[13]); 827| 136| z[25] = accum.extract(); 828| 136| accum.mul_x2(x[11], x[15]); 829| 136| accum.mul_x2(x[12], x[14]); 830| 136| accum.mul(x[13], x[13]); 831| 136| z[26] = accum.extract(); 832| 136| accum.mul_x2(x[12], x[15]); 833| 136| accum.mul_x2(x[13], x[14]); 834| 136| z[27] = accum.extract(); 835| 136| accum.mul_x2(x[13], x[15]); 836| 136| accum.mul(x[14], x[14]); 837| 136| z[28] = accum.extract(); 838| 136| accum.mul_x2(x[14], x[15]); 839| 136| z[29] = accum.extract(); 840| 136| accum.mul(x[15], x[15]); 841| 136| z[30] = accum.extract(); 842| 136| z[31] = accum.extract(); 843| 136|} _ZN5Botan18bigint_comba_mul16EPmPKmS2_: 848| 136|void bigint_comba_mul16(word z[32], const word x[16], const word y[16]) { 849| 136| word3 accum; 850| | 851| 136| accum.mul(x[0], y[0]); 852| 136| z[0] = accum.extract(); 853| 136| accum.mul(x[0], y[1]); 854| 136| accum.mul(x[1], y[0]); 855| 136| z[1] = accum.extract(); 856| 136| accum.mul(x[0], y[2]); 857| 136| accum.mul(x[1], y[1]); 858| 136| accum.mul(x[2], y[0]); 859| 136| z[2] = accum.extract(); 860| 136| accum.mul(x[0], y[3]); 861| 136| accum.mul(x[1], y[2]); 862| 136| accum.mul(x[2], y[1]); 863| 136| accum.mul(x[3], y[0]); 864| 136| z[3] = accum.extract(); 865| 136| accum.mul(x[0], y[4]); 866| 136| accum.mul(x[1], y[3]); 867| 136| accum.mul(x[2], y[2]); 868| 136| accum.mul(x[3], y[1]); 869| 136| accum.mul(x[4], y[0]); 870| 136| z[4] = accum.extract(); 871| 136| accum.mul(x[0], y[5]); 872| 136| accum.mul(x[1], y[4]); 873| 136| accum.mul(x[2], y[3]); 874| 136| accum.mul(x[3], y[2]); 875| 136| accum.mul(x[4], y[1]); 876| 136| accum.mul(x[5], y[0]); 877| 136| z[5] = accum.extract(); 878| 136| accum.mul(x[0], y[6]); 879| 136| accum.mul(x[1], y[5]); 880| 136| accum.mul(x[2], y[4]); 881| 136| accum.mul(x[3], y[3]); 882| 136| accum.mul(x[4], y[2]); 883| 136| accum.mul(x[5], y[1]); 884| 136| accum.mul(x[6], y[0]); 885| 136| z[6] = accum.extract(); 886| 136| accum.mul(x[0], y[7]); 887| 136| accum.mul(x[1], y[6]); 888| 136| accum.mul(x[2], y[5]); 889| 136| accum.mul(x[3], y[4]); 890| 136| accum.mul(x[4], y[3]); 891| 136| accum.mul(x[5], y[2]); 892| 136| accum.mul(x[6], y[1]); 893| 136| accum.mul(x[7], y[0]); 894| 136| z[7] = accum.extract(); 895| 136| accum.mul(x[0], y[8]); 896| 136| accum.mul(x[1], y[7]); 897| 136| accum.mul(x[2], y[6]); 898| 136| accum.mul(x[3], y[5]); 899| 136| accum.mul(x[4], y[4]); 900| 136| accum.mul(x[5], y[3]); 901| 136| accum.mul(x[6], y[2]); 902| 136| accum.mul(x[7], y[1]); 903| 136| accum.mul(x[8], y[0]); 904| 136| z[8] = accum.extract(); 905| 136| accum.mul(x[0], y[9]); 906| 136| accum.mul(x[1], y[8]); 907| 136| accum.mul(x[2], y[7]); 908| 136| accum.mul(x[3], y[6]); 909| 136| accum.mul(x[4], y[5]); 910| 136| accum.mul(x[5], y[4]); 911| 136| accum.mul(x[6], y[3]); 912| 136| accum.mul(x[7], y[2]); 913| 136| accum.mul(x[8], y[1]); 914| 136| accum.mul(x[9], y[0]); 915| 136| z[9] = accum.extract(); 916| 136| accum.mul(x[0], y[10]); 917| 136| accum.mul(x[1], y[9]); 918| 136| accum.mul(x[2], y[8]); 919| 136| accum.mul(x[3], y[7]); 920| 136| accum.mul(x[4], y[6]); 921| 136| accum.mul(x[5], y[5]); 922| 136| accum.mul(x[6], y[4]); 923| 136| accum.mul(x[7], y[3]); 924| 136| accum.mul(x[8], y[2]); 925| 136| accum.mul(x[9], y[1]); 926| 136| accum.mul(x[10], y[0]); 927| 136| z[10] = accum.extract(); 928| 136| accum.mul(x[0], y[11]); 929| 136| accum.mul(x[1], y[10]); 930| 136| accum.mul(x[2], y[9]); 931| 136| accum.mul(x[3], y[8]); 932| 136| accum.mul(x[4], y[7]); 933| 136| accum.mul(x[5], y[6]); 934| 136| accum.mul(x[6], y[5]); 935| 136| accum.mul(x[7], y[4]); 936| 136| accum.mul(x[8], y[3]); 937| 136| accum.mul(x[9], y[2]); 938| 136| accum.mul(x[10], y[1]); 939| 136| accum.mul(x[11], y[0]); 940| 136| z[11] = accum.extract(); 941| 136| accum.mul(x[0], y[12]); 942| 136| accum.mul(x[1], y[11]); 943| 136| accum.mul(x[2], y[10]); 944| 136| accum.mul(x[3], y[9]); 945| 136| accum.mul(x[4], y[8]); 946| 136| accum.mul(x[5], y[7]); 947| 136| accum.mul(x[6], y[6]); 948| 136| accum.mul(x[7], y[5]); 949| 136| accum.mul(x[8], y[4]); 950| 136| accum.mul(x[9], y[3]); 951| 136| accum.mul(x[10], y[2]); 952| 136| accum.mul(x[11], y[1]); 953| 136| accum.mul(x[12], y[0]); 954| 136| z[12] = accum.extract(); 955| 136| accum.mul(x[0], y[13]); 956| 136| accum.mul(x[1], y[12]); 957| 136| accum.mul(x[2], y[11]); 958| 136| accum.mul(x[3], y[10]); 959| 136| accum.mul(x[4], y[9]); 960| 136| accum.mul(x[5], y[8]); 961| 136| accum.mul(x[6], y[7]); 962| 136| accum.mul(x[7], y[6]); 963| 136| accum.mul(x[8], y[5]); 964| 136| accum.mul(x[9], y[4]); 965| 136| accum.mul(x[10], y[3]); 966| 136| accum.mul(x[11], y[2]); 967| 136| accum.mul(x[12], y[1]); 968| 136| accum.mul(x[13], y[0]); 969| 136| z[13] = accum.extract(); 970| 136| accum.mul(x[0], y[14]); 971| 136| accum.mul(x[1], y[13]); 972| 136| accum.mul(x[2], y[12]); 973| 136| accum.mul(x[3], y[11]); 974| 136| accum.mul(x[4], y[10]); 975| 136| accum.mul(x[5], y[9]); 976| 136| accum.mul(x[6], y[8]); 977| 136| accum.mul(x[7], y[7]); 978| 136| accum.mul(x[8], y[6]); 979| 136| accum.mul(x[9], y[5]); 980| 136| accum.mul(x[10], y[4]); 981| 136| accum.mul(x[11], y[3]); 982| 136| accum.mul(x[12], y[2]); 983| 136| accum.mul(x[13], y[1]); 984| 136| accum.mul(x[14], y[0]); 985| 136| z[14] = accum.extract(); 986| 136| accum.mul(x[0], y[15]); 987| 136| accum.mul(x[1], y[14]); 988| 136| accum.mul(x[2], y[13]); 989| 136| accum.mul(x[3], y[12]); 990| 136| accum.mul(x[4], y[11]); 991| 136| accum.mul(x[5], y[10]); 992| 136| accum.mul(x[6], y[9]); 993| 136| accum.mul(x[7], y[8]); 994| 136| accum.mul(x[8], y[7]); 995| 136| accum.mul(x[9], y[6]); 996| 136| accum.mul(x[10], y[5]); 997| 136| accum.mul(x[11], y[4]); 998| 136| accum.mul(x[12], y[3]); 999| 136| accum.mul(x[13], y[2]); 1000| 136| accum.mul(x[14], y[1]); 1001| 136| accum.mul(x[15], y[0]); 1002| 136| z[15] = accum.extract(); 1003| 136| accum.mul(x[1], y[15]); 1004| 136| accum.mul(x[2], y[14]); 1005| 136| accum.mul(x[3], y[13]); 1006| 136| accum.mul(x[4], y[12]); 1007| 136| accum.mul(x[5], y[11]); 1008| 136| accum.mul(x[6], y[10]); 1009| 136| accum.mul(x[7], y[9]); 1010| 136| accum.mul(x[8], y[8]); 1011| 136| accum.mul(x[9], y[7]); 1012| 136| accum.mul(x[10], y[6]); 1013| 136| accum.mul(x[11], y[5]); 1014| 136| accum.mul(x[12], y[4]); 1015| 136| accum.mul(x[13], y[3]); 1016| 136| accum.mul(x[14], y[2]); 1017| 136| accum.mul(x[15], y[1]); 1018| 136| z[16] = accum.extract(); 1019| 136| accum.mul(x[2], y[15]); 1020| 136| accum.mul(x[3], y[14]); 1021| 136| accum.mul(x[4], y[13]); 1022| 136| accum.mul(x[5], y[12]); 1023| 136| accum.mul(x[6], y[11]); 1024| 136| accum.mul(x[7], y[10]); 1025| 136| accum.mul(x[8], y[9]); 1026| 136| accum.mul(x[9], y[8]); 1027| 136| accum.mul(x[10], y[7]); 1028| 136| accum.mul(x[11], y[6]); 1029| 136| accum.mul(x[12], y[5]); 1030| 136| accum.mul(x[13], y[4]); 1031| 136| accum.mul(x[14], y[3]); 1032| 136| accum.mul(x[15], y[2]); 1033| 136| z[17] = accum.extract(); 1034| 136| accum.mul(x[3], y[15]); 1035| 136| accum.mul(x[4], y[14]); 1036| 136| accum.mul(x[5], y[13]); 1037| 136| accum.mul(x[6], y[12]); 1038| 136| accum.mul(x[7], y[11]); 1039| 136| accum.mul(x[8], y[10]); 1040| 136| accum.mul(x[9], y[9]); 1041| 136| accum.mul(x[10], y[8]); 1042| 136| accum.mul(x[11], y[7]); 1043| 136| accum.mul(x[12], y[6]); 1044| 136| accum.mul(x[13], y[5]); 1045| 136| accum.mul(x[14], y[4]); 1046| 136| accum.mul(x[15], y[3]); 1047| 136| z[18] = accum.extract(); 1048| 136| accum.mul(x[4], y[15]); 1049| 136| accum.mul(x[5], y[14]); 1050| 136| accum.mul(x[6], y[13]); 1051| 136| accum.mul(x[7], y[12]); 1052| 136| accum.mul(x[8], y[11]); 1053| 136| accum.mul(x[9], y[10]); 1054| 136| accum.mul(x[10], y[9]); 1055| 136| accum.mul(x[11], y[8]); 1056| 136| accum.mul(x[12], y[7]); 1057| 136| accum.mul(x[13], y[6]); 1058| 136| accum.mul(x[14], y[5]); 1059| 136| accum.mul(x[15], y[4]); 1060| 136| z[19] = accum.extract(); 1061| 136| accum.mul(x[5], y[15]); 1062| 136| accum.mul(x[6], y[14]); 1063| 136| accum.mul(x[7], y[13]); 1064| 136| accum.mul(x[8], y[12]); 1065| 136| accum.mul(x[9], y[11]); 1066| 136| accum.mul(x[10], y[10]); 1067| 136| accum.mul(x[11], y[9]); 1068| 136| accum.mul(x[12], y[8]); 1069| 136| accum.mul(x[13], y[7]); 1070| 136| accum.mul(x[14], y[6]); 1071| 136| accum.mul(x[15], y[5]); 1072| 136| z[20] = accum.extract(); 1073| 136| accum.mul(x[6], y[15]); 1074| 136| accum.mul(x[7], y[14]); 1075| 136| accum.mul(x[8], y[13]); 1076| 136| accum.mul(x[9], y[12]); 1077| 136| accum.mul(x[10], y[11]); 1078| 136| accum.mul(x[11], y[10]); 1079| 136| accum.mul(x[12], y[9]); 1080| 136| accum.mul(x[13], y[8]); 1081| 136| accum.mul(x[14], y[7]); 1082| 136| accum.mul(x[15], y[6]); 1083| 136| z[21] = accum.extract(); 1084| 136| accum.mul(x[7], y[15]); 1085| 136| accum.mul(x[8], y[14]); 1086| 136| accum.mul(x[9], y[13]); 1087| 136| accum.mul(x[10], y[12]); 1088| 136| accum.mul(x[11], y[11]); 1089| 136| accum.mul(x[12], y[10]); 1090| 136| accum.mul(x[13], y[9]); 1091| 136| accum.mul(x[14], y[8]); 1092| 136| accum.mul(x[15], y[7]); 1093| 136| z[22] = accum.extract(); 1094| 136| accum.mul(x[8], y[15]); 1095| 136| accum.mul(x[9], y[14]); 1096| 136| accum.mul(x[10], y[13]); 1097| 136| accum.mul(x[11], y[12]); 1098| 136| accum.mul(x[12], y[11]); 1099| 136| accum.mul(x[13], y[10]); 1100| 136| accum.mul(x[14], y[9]); 1101| 136| accum.mul(x[15], y[8]); 1102| 136| z[23] = accum.extract(); 1103| 136| accum.mul(x[9], y[15]); 1104| 136| accum.mul(x[10], y[14]); 1105| 136| accum.mul(x[11], y[13]); 1106| 136| accum.mul(x[12], y[12]); 1107| 136| accum.mul(x[13], y[11]); 1108| 136| accum.mul(x[14], y[10]); 1109| 136| accum.mul(x[15], y[9]); 1110| 136| z[24] = accum.extract(); 1111| 136| accum.mul(x[10], y[15]); 1112| 136| accum.mul(x[11], y[14]); 1113| 136| accum.mul(x[12], y[13]); 1114| 136| accum.mul(x[13], y[12]); 1115| 136| accum.mul(x[14], y[11]); 1116| 136| accum.mul(x[15], y[10]); 1117| 136| z[25] = accum.extract(); 1118| 136| accum.mul(x[11], y[15]); 1119| 136| accum.mul(x[12], y[14]); 1120| 136| accum.mul(x[13], y[13]); 1121| 136| accum.mul(x[14], y[12]); 1122| 136| accum.mul(x[15], y[11]); 1123| 136| z[26] = accum.extract(); 1124| 136| accum.mul(x[12], y[15]); 1125| 136| accum.mul(x[13], y[14]); 1126| 136| accum.mul(x[14], y[13]); 1127| 136| accum.mul(x[15], y[12]); 1128| 136| z[27] = accum.extract(); 1129| 136| accum.mul(x[13], y[15]); 1130| 136| accum.mul(x[14], y[14]); 1131| 136| accum.mul(x[15], y[13]); 1132| 136| z[28] = accum.extract(); 1133| 136| accum.mul(x[14], y[15]); 1134| 136| accum.mul(x[15], y[14]); 1135| 136| z[29] = accum.extract(); 1136| 136| accum.mul(x[15], y[15]); 1137| 136| z[30] = accum.extract(); 1138| 136| z[31] = accum.extract(); 1139| 136|} _ZN5Botan18bigint_comba_sqr24EPmPKm: 1144| 3|void bigint_comba_sqr24(word z[48], const word x[24]) { 1145| 3| word3 accum; 1146| | 1147| 3| accum.mul(x[0], x[0]); 1148| 3| z[0] = accum.extract(); 1149| 3| accum.mul_x2(x[0], x[1]); 1150| 3| z[1] = accum.extract(); 1151| 3| accum.mul_x2(x[0], x[2]); 1152| 3| accum.mul(x[1], x[1]); 1153| 3| z[2] = accum.extract(); 1154| 3| accum.mul_x2(x[0], x[3]); 1155| 3| accum.mul_x2(x[1], x[2]); 1156| 3| z[3] = accum.extract(); 1157| 3| accum.mul_x2(x[0], x[4]); 1158| 3| accum.mul_x2(x[1], x[3]); 1159| 3| accum.mul(x[2], x[2]); 1160| 3| z[4] = accum.extract(); 1161| 3| accum.mul_x2(x[0], x[5]); 1162| 3| accum.mul_x2(x[1], x[4]); 1163| 3| accum.mul_x2(x[2], x[3]); 1164| 3| z[5] = accum.extract(); 1165| 3| accum.mul_x2(x[0], x[6]); 1166| 3| accum.mul_x2(x[1], x[5]); 1167| 3| accum.mul_x2(x[2], x[4]); 1168| 3| accum.mul(x[3], x[3]); 1169| 3| z[6] = accum.extract(); 1170| 3| accum.mul_x2(x[0], x[7]); 1171| 3| accum.mul_x2(x[1], x[6]); 1172| 3| accum.mul_x2(x[2], x[5]); 1173| 3| accum.mul_x2(x[3], x[4]); 1174| 3| z[7] = accum.extract(); 1175| 3| accum.mul_x2(x[0], x[8]); 1176| 3| accum.mul_x2(x[1], x[7]); 1177| 3| accum.mul_x2(x[2], x[6]); 1178| 3| accum.mul_x2(x[3], x[5]); 1179| 3| accum.mul(x[4], x[4]); 1180| 3| z[8] = accum.extract(); 1181| 3| accum.mul_x2(x[0], x[9]); 1182| 3| accum.mul_x2(x[1], x[8]); 1183| 3| accum.mul_x2(x[2], x[7]); 1184| 3| accum.mul_x2(x[3], x[6]); 1185| 3| accum.mul_x2(x[4], x[5]); 1186| 3| z[9] = accum.extract(); 1187| 3| accum.mul_x2(x[0], x[10]); 1188| 3| accum.mul_x2(x[1], x[9]); 1189| 3| accum.mul_x2(x[2], x[8]); 1190| 3| accum.mul_x2(x[3], x[7]); 1191| 3| accum.mul_x2(x[4], x[6]); 1192| 3| accum.mul(x[5], x[5]); 1193| 3| z[10] = accum.extract(); 1194| 3| accum.mul_x2(x[0], x[11]); 1195| 3| accum.mul_x2(x[1], x[10]); 1196| 3| accum.mul_x2(x[2], x[9]); 1197| 3| accum.mul_x2(x[3], x[8]); 1198| 3| accum.mul_x2(x[4], x[7]); 1199| 3| accum.mul_x2(x[5], x[6]); 1200| 3| z[11] = accum.extract(); 1201| 3| accum.mul_x2(x[0], x[12]); 1202| 3| accum.mul_x2(x[1], x[11]); 1203| 3| accum.mul_x2(x[2], x[10]); 1204| 3| accum.mul_x2(x[3], x[9]); 1205| 3| accum.mul_x2(x[4], x[8]); 1206| 3| accum.mul_x2(x[5], x[7]); 1207| 3| accum.mul(x[6], x[6]); 1208| 3| z[12] = accum.extract(); 1209| 3| accum.mul_x2(x[0], x[13]); 1210| 3| accum.mul_x2(x[1], x[12]); 1211| 3| accum.mul_x2(x[2], x[11]); 1212| 3| accum.mul_x2(x[3], x[10]); 1213| 3| accum.mul_x2(x[4], x[9]); 1214| 3| accum.mul_x2(x[5], x[8]); 1215| 3| accum.mul_x2(x[6], x[7]); 1216| 3| z[13] = accum.extract(); 1217| 3| accum.mul_x2(x[0], x[14]); 1218| 3| accum.mul_x2(x[1], x[13]); 1219| 3| accum.mul_x2(x[2], x[12]); 1220| 3| accum.mul_x2(x[3], x[11]); 1221| 3| accum.mul_x2(x[4], x[10]); 1222| 3| accum.mul_x2(x[5], x[9]); 1223| 3| accum.mul_x2(x[6], x[8]); 1224| 3| accum.mul(x[7], x[7]); 1225| 3| z[14] = accum.extract(); 1226| 3| accum.mul_x2(x[0], x[15]); 1227| 3| accum.mul_x2(x[1], x[14]); 1228| 3| accum.mul_x2(x[2], x[13]); 1229| 3| accum.mul_x2(x[3], x[12]); 1230| 3| accum.mul_x2(x[4], x[11]); 1231| 3| accum.mul_x2(x[5], x[10]); 1232| 3| accum.mul_x2(x[6], x[9]); 1233| 3| accum.mul_x2(x[7], x[8]); 1234| 3| z[15] = accum.extract(); 1235| 3| accum.mul_x2(x[0], x[16]); 1236| 3| accum.mul_x2(x[1], x[15]); 1237| 3| accum.mul_x2(x[2], x[14]); 1238| 3| accum.mul_x2(x[3], x[13]); 1239| 3| accum.mul_x2(x[4], x[12]); 1240| 3| accum.mul_x2(x[5], x[11]); 1241| 3| accum.mul_x2(x[6], x[10]); 1242| 3| accum.mul_x2(x[7], x[9]); 1243| 3| accum.mul(x[8], x[8]); 1244| 3| z[16] = accum.extract(); 1245| 3| accum.mul_x2(x[0], x[17]); 1246| 3| accum.mul_x2(x[1], x[16]); 1247| 3| accum.mul_x2(x[2], x[15]); 1248| 3| accum.mul_x2(x[3], x[14]); 1249| 3| accum.mul_x2(x[4], x[13]); 1250| 3| accum.mul_x2(x[5], x[12]); 1251| 3| accum.mul_x2(x[6], x[11]); 1252| 3| accum.mul_x2(x[7], x[10]); 1253| 3| accum.mul_x2(x[8], x[9]); 1254| 3| z[17] = accum.extract(); 1255| 3| accum.mul_x2(x[0], x[18]); 1256| 3| accum.mul_x2(x[1], x[17]); 1257| 3| accum.mul_x2(x[2], x[16]); 1258| 3| accum.mul_x2(x[3], x[15]); 1259| 3| accum.mul_x2(x[4], x[14]); 1260| 3| accum.mul_x2(x[5], x[13]); 1261| 3| accum.mul_x2(x[6], x[12]); 1262| 3| accum.mul_x2(x[7], x[11]); 1263| 3| accum.mul_x2(x[8], x[10]); 1264| 3| accum.mul(x[9], x[9]); 1265| 3| z[18] = accum.extract(); 1266| 3| accum.mul_x2(x[0], x[19]); 1267| 3| accum.mul_x2(x[1], x[18]); 1268| 3| accum.mul_x2(x[2], x[17]); 1269| 3| accum.mul_x2(x[3], x[16]); 1270| 3| accum.mul_x2(x[4], x[15]); 1271| 3| accum.mul_x2(x[5], x[14]); 1272| 3| accum.mul_x2(x[6], x[13]); 1273| 3| accum.mul_x2(x[7], x[12]); 1274| 3| accum.mul_x2(x[8], x[11]); 1275| 3| accum.mul_x2(x[9], x[10]); 1276| 3| z[19] = accum.extract(); 1277| 3| accum.mul_x2(x[0], x[20]); 1278| 3| accum.mul_x2(x[1], x[19]); 1279| 3| accum.mul_x2(x[2], x[18]); 1280| 3| accum.mul_x2(x[3], x[17]); 1281| 3| accum.mul_x2(x[4], x[16]); 1282| 3| accum.mul_x2(x[5], x[15]); 1283| 3| accum.mul_x2(x[6], x[14]); 1284| 3| accum.mul_x2(x[7], x[13]); 1285| 3| accum.mul_x2(x[8], x[12]); 1286| 3| accum.mul_x2(x[9], x[11]); 1287| 3| accum.mul(x[10], x[10]); 1288| 3| z[20] = accum.extract(); 1289| 3| accum.mul_x2(x[0], x[21]); 1290| 3| accum.mul_x2(x[1], x[20]); 1291| 3| accum.mul_x2(x[2], x[19]); 1292| 3| accum.mul_x2(x[3], x[18]); 1293| 3| accum.mul_x2(x[4], x[17]); 1294| 3| accum.mul_x2(x[5], x[16]); 1295| 3| accum.mul_x2(x[6], x[15]); 1296| 3| accum.mul_x2(x[7], x[14]); 1297| 3| accum.mul_x2(x[8], x[13]); 1298| 3| accum.mul_x2(x[9], x[12]); 1299| 3| accum.mul_x2(x[10], x[11]); 1300| 3| z[21] = accum.extract(); 1301| 3| accum.mul_x2(x[0], x[22]); 1302| 3| accum.mul_x2(x[1], x[21]); 1303| 3| accum.mul_x2(x[2], x[20]); 1304| 3| accum.mul_x2(x[3], x[19]); 1305| 3| accum.mul_x2(x[4], x[18]); 1306| 3| accum.mul_x2(x[5], x[17]); 1307| 3| accum.mul_x2(x[6], x[16]); 1308| 3| accum.mul_x2(x[7], x[15]); 1309| 3| accum.mul_x2(x[8], x[14]); 1310| 3| accum.mul_x2(x[9], x[13]); 1311| 3| accum.mul_x2(x[10], x[12]); 1312| 3| accum.mul(x[11], x[11]); 1313| 3| z[22] = accum.extract(); 1314| 3| accum.mul_x2(x[0], x[23]); 1315| 3| accum.mul_x2(x[1], x[22]); 1316| 3| accum.mul_x2(x[2], x[21]); 1317| 3| accum.mul_x2(x[3], x[20]); 1318| 3| accum.mul_x2(x[4], x[19]); 1319| 3| accum.mul_x2(x[5], x[18]); 1320| 3| accum.mul_x2(x[6], x[17]); 1321| 3| accum.mul_x2(x[7], x[16]); 1322| 3| accum.mul_x2(x[8], x[15]); 1323| 3| accum.mul_x2(x[9], x[14]); 1324| 3| accum.mul_x2(x[10], x[13]); 1325| 3| accum.mul_x2(x[11], x[12]); 1326| 3| z[23] = accum.extract(); 1327| 3| accum.mul_x2(x[1], x[23]); 1328| 3| accum.mul_x2(x[2], x[22]); 1329| 3| accum.mul_x2(x[3], x[21]); 1330| 3| accum.mul_x2(x[4], x[20]); 1331| 3| accum.mul_x2(x[5], x[19]); 1332| 3| accum.mul_x2(x[6], x[18]); 1333| 3| accum.mul_x2(x[7], x[17]); 1334| 3| accum.mul_x2(x[8], x[16]); 1335| 3| accum.mul_x2(x[9], x[15]); 1336| 3| accum.mul_x2(x[10], x[14]); 1337| 3| accum.mul_x2(x[11], x[13]); 1338| 3| accum.mul(x[12], x[12]); 1339| 3| z[24] = accum.extract(); 1340| 3| accum.mul_x2(x[2], x[23]); 1341| 3| accum.mul_x2(x[3], x[22]); 1342| 3| accum.mul_x2(x[4], x[21]); 1343| 3| accum.mul_x2(x[5], x[20]); 1344| 3| accum.mul_x2(x[6], x[19]); 1345| 3| accum.mul_x2(x[7], x[18]); 1346| 3| accum.mul_x2(x[8], x[17]); 1347| 3| accum.mul_x2(x[9], x[16]); 1348| 3| accum.mul_x2(x[10], x[15]); 1349| 3| accum.mul_x2(x[11], x[14]); 1350| 3| accum.mul_x2(x[12], x[13]); 1351| 3| z[25] = accum.extract(); 1352| 3| accum.mul_x2(x[3], x[23]); 1353| 3| accum.mul_x2(x[4], x[22]); 1354| 3| accum.mul_x2(x[5], x[21]); 1355| 3| accum.mul_x2(x[6], x[20]); 1356| 3| accum.mul_x2(x[7], x[19]); 1357| 3| accum.mul_x2(x[8], x[18]); 1358| 3| accum.mul_x2(x[9], x[17]); 1359| 3| accum.mul_x2(x[10], x[16]); 1360| 3| accum.mul_x2(x[11], x[15]); 1361| 3| accum.mul_x2(x[12], x[14]); 1362| 3| accum.mul(x[13], x[13]); 1363| 3| z[26] = accum.extract(); 1364| 3| accum.mul_x2(x[4], x[23]); 1365| 3| accum.mul_x2(x[5], x[22]); 1366| 3| accum.mul_x2(x[6], x[21]); 1367| 3| accum.mul_x2(x[7], x[20]); 1368| 3| accum.mul_x2(x[8], x[19]); 1369| 3| accum.mul_x2(x[9], x[18]); 1370| 3| accum.mul_x2(x[10], x[17]); 1371| 3| accum.mul_x2(x[11], x[16]); 1372| 3| accum.mul_x2(x[12], x[15]); 1373| 3| accum.mul_x2(x[13], x[14]); 1374| 3| z[27] = accum.extract(); 1375| 3| accum.mul_x2(x[5], x[23]); 1376| 3| accum.mul_x2(x[6], x[22]); 1377| 3| accum.mul_x2(x[7], x[21]); 1378| 3| accum.mul_x2(x[8], x[20]); 1379| 3| accum.mul_x2(x[9], x[19]); 1380| 3| accum.mul_x2(x[10], x[18]); 1381| 3| accum.mul_x2(x[11], x[17]); 1382| 3| accum.mul_x2(x[12], x[16]); 1383| 3| accum.mul_x2(x[13], x[15]); 1384| 3| accum.mul(x[14], x[14]); 1385| 3| z[28] = accum.extract(); 1386| 3| accum.mul_x2(x[6], x[23]); 1387| 3| accum.mul_x2(x[7], x[22]); 1388| 3| accum.mul_x2(x[8], x[21]); 1389| 3| accum.mul_x2(x[9], x[20]); 1390| 3| accum.mul_x2(x[10], x[19]); 1391| 3| accum.mul_x2(x[11], x[18]); 1392| 3| accum.mul_x2(x[12], x[17]); 1393| 3| accum.mul_x2(x[13], x[16]); 1394| 3| accum.mul_x2(x[14], x[15]); 1395| 3| z[29] = accum.extract(); 1396| 3| accum.mul_x2(x[7], x[23]); 1397| 3| accum.mul_x2(x[8], x[22]); 1398| 3| accum.mul_x2(x[9], x[21]); 1399| 3| accum.mul_x2(x[10], x[20]); 1400| 3| accum.mul_x2(x[11], x[19]); 1401| 3| accum.mul_x2(x[12], x[18]); 1402| 3| accum.mul_x2(x[13], x[17]); 1403| 3| accum.mul_x2(x[14], x[16]); 1404| 3| accum.mul(x[15], x[15]); 1405| 3| z[30] = accum.extract(); 1406| 3| accum.mul_x2(x[8], x[23]); 1407| 3| accum.mul_x2(x[9], x[22]); 1408| 3| accum.mul_x2(x[10], x[21]); 1409| 3| accum.mul_x2(x[11], x[20]); 1410| 3| accum.mul_x2(x[12], x[19]); 1411| 3| accum.mul_x2(x[13], x[18]); 1412| 3| accum.mul_x2(x[14], x[17]); 1413| 3| accum.mul_x2(x[15], x[16]); 1414| 3| z[31] = accum.extract(); 1415| 3| accum.mul_x2(x[9], x[23]); 1416| 3| accum.mul_x2(x[10], x[22]); 1417| 3| accum.mul_x2(x[11], x[21]); 1418| 3| accum.mul_x2(x[12], x[20]); 1419| 3| accum.mul_x2(x[13], x[19]); 1420| 3| accum.mul_x2(x[14], x[18]); 1421| 3| accum.mul_x2(x[15], x[17]); 1422| 3| accum.mul(x[16], x[16]); 1423| 3| z[32] = accum.extract(); 1424| 3| accum.mul_x2(x[10], x[23]); 1425| 3| accum.mul_x2(x[11], x[22]); 1426| 3| accum.mul_x2(x[12], x[21]); 1427| 3| accum.mul_x2(x[13], x[20]); 1428| 3| accum.mul_x2(x[14], x[19]); 1429| 3| accum.mul_x2(x[15], x[18]); 1430| 3| accum.mul_x2(x[16], x[17]); 1431| 3| z[33] = accum.extract(); 1432| 3| accum.mul_x2(x[11], x[23]); 1433| 3| accum.mul_x2(x[12], x[22]); 1434| 3| accum.mul_x2(x[13], x[21]); 1435| 3| accum.mul_x2(x[14], x[20]); 1436| 3| accum.mul_x2(x[15], x[19]); 1437| 3| accum.mul_x2(x[16], x[18]); 1438| 3| accum.mul(x[17], x[17]); 1439| 3| z[34] = accum.extract(); 1440| 3| accum.mul_x2(x[12], x[23]); 1441| 3| accum.mul_x2(x[13], x[22]); 1442| 3| accum.mul_x2(x[14], x[21]); 1443| 3| accum.mul_x2(x[15], x[20]); 1444| 3| accum.mul_x2(x[16], x[19]); 1445| 3| accum.mul_x2(x[17], x[18]); 1446| 3| z[35] = accum.extract(); 1447| 3| accum.mul_x2(x[13], x[23]); 1448| 3| accum.mul_x2(x[14], x[22]); 1449| 3| accum.mul_x2(x[15], x[21]); 1450| 3| accum.mul_x2(x[16], x[20]); 1451| 3| accum.mul_x2(x[17], x[19]); 1452| 3| accum.mul(x[18], x[18]); 1453| 3| z[36] = accum.extract(); 1454| 3| accum.mul_x2(x[14], x[23]); 1455| 3| accum.mul_x2(x[15], x[22]); 1456| 3| accum.mul_x2(x[16], x[21]); 1457| 3| accum.mul_x2(x[17], x[20]); 1458| 3| accum.mul_x2(x[18], x[19]); 1459| 3| z[37] = accum.extract(); 1460| 3| accum.mul_x2(x[15], x[23]); 1461| 3| accum.mul_x2(x[16], x[22]); 1462| 3| accum.mul_x2(x[17], x[21]); 1463| 3| accum.mul_x2(x[18], x[20]); 1464| 3| accum.mul(x[19], x[19]); 1465| 3| z[38] = accum.extract(); 1466| 3| accum.mul_x2(x[16], x[23]); 1467| 3| accum.mul_x2(x[17], x[22]); 1468| 3| accum.mul_x2(x[18], x[21]); 1469| 3| accum.mul_x2(x[19], x[20]); 1470| 3| z[39] = accum.extract(); 1471| 3| accum.mul_x2(x[17], x[23]); 1472| 3| accum.mul_x2(x[18], x[22]); 1473| 3| accum.mul_x2(x[19], x[21]); 1474| 3| accum.mul(x[20], x[20]); 1475| 3| z[40] = accum.extract(); 1476| 3| accum.mul_x2(x[18], x[23]); 1477| 3| accum.mul_x2(x[19], x[22]); 1478| 3| accum.mul_x2(x[20], x[21]); 1479| 3| z[41] = accum.extract(); 1480| 3| accum.mul_x2(x[19], x[23]); 1481| 3| accum.mul_x2(x[20], x[22]); 1482| 3| accum.mul(x[21], x[21]); 1483| 3| z[42] = accum.extract(); 1484| 3| accum.mul_x2(x[20], x[23]); 1485| 3| accum.mul_x2(x[21], x[22]); 1486| 3| z[43] = accum.extract(); 1487| 3| accum.mul_x2(x[21], x[23]); 1488| 3| accum.mul(x[22], x[22]); 1489| 3| z[44] = accum.extract(); 1490| 3| accum.mul_x2(x[22], x[23]); 1491| 3| z[45] = accum.extract(); 1492| 3| accum.mul(x[23], x[23]); 1493| 3| z[46] = accum.extract(); 1494| 3| z[47] = accum.extract(); 1495| 3|} _ZN5Botan18bigint_comba_mul24EPmPKmS2_: 1500| 3|void bigint_comba_mul24(word z[48], const word x[24], const word y[24]) { 1501| 3| word3 accum; 1502| | 1503| 3| accum.mul(x[0], y[0]); 1504| 3| z[0] = accum.extract(); 1505| 3| accum.mul(x[0], y[1]); 1506| 3| accum.mul(x[1], y[0]); 1507| 3| z[1] = accum.extract(); 1508| 3| accum.mul(x[0], y[2]); 1509| 3| accum.mul(x[1], y[1]); 1510| 3| accum.mul(x[2], y[0]); 1511| 3| z[2] = accum.extract(); 1512| 3| accum.mul(x[0], y[3]); 1513| 3| accum.mul(x[1], y[2]); 1514| 3| accum.mul(x[2], y[1]); 1515| 3| accum.mul(x[3], y[0]); 1516| 3| z[3] = accum.extract(); 1517| 3| accum.mul(x[0], y[4]); 1518| 3| accum.mul(x[1], y[3]); 1519| 3| accum.mul(x[2], y[2]); 1520| 3| accum.mul(x[3], y[1]); 1521| 3| accum.mul(x[4], y[0]); 1522| 3| z[4] = accum.extract(); 1523| 3| accum.mul(x[0], y[5]); 1524| 3| accum.mul(x[1], y[4]); 1525| 3| accum.mul(x[2], y[3]); 1526| 3| accum.mul(x[3], y[2]); 1527| 3| accum.mul(x[4], y[1]); 1528| 3| accum.mul(x[5], y[0]); 1529| 3| z[5] = accum.extract(); 1530| 3| accum.mul(x[0], y[6]); 1531| 3| accum.mul(x[1], y[5]); 1532| 3| accum.mul(x[2], y[4]); 1533| 3| accum.mul(x[3], y[3]); 1534| 3| accum.mul(x[4], y[2]); 1535| 3| accum.mul(x[5], y[1]); 1536| 3| accum.mul(x[6], y[0]); 1537| 3| z[6] = accum.extract(); 1538| 3| accum.mul(x[0], y[7]); 1539| 3| accum.mul(x[1], y[6]); 1540| 3| accum.mul(x[2], y[5]); 1541| 3| accum.mul(x[3], y[4]); 1542| 3| accum.mul(x[4], y[3]); 1543| 3| accum.mul(x[5], y[2]); 1544| 3| accum.mul(x[6], y[1]); 1545| 3| accum.mul(x[7], y[0]); 1546| 3| z[7] = accum.extract(); 1547| 3| accum.mul(x[0], y[8]); 1548| 3| accum.mul(x[1], y[7]); 1549| 3| accum.mul(x[2], y[6]); 1550| 3| accum.mul(x[3], y[5]); 1551| 3| accum.mul(x[4], y[4]); 1552| 3| accum.mul(x[5], y[3]); 1553| 3| accum.mul(x[6], y[2]); 1554| 3| accum.mul(x[7], y[1]); 1555| 3| accum.mul(x[8], y[0]); 1556| 3| z[8] = accum.extract(); 1557| 3| accum.mul(x[0], y[9]); 1558| 3| accum.mul(x[1], y[8]); 1559| 3| accum.mul(x[2], y[7]); 1560| 3| accum.mul(x[3], y[6]); 1561| 3| accum.mul(x[4], y[5]); 1562| 3| accum.mul(x[5], y[4]); 1563| 3| accum.mul(x[6], y[3]); 1564| 3| accum.mul(x[7], y[2]); 1565| 3| accum.mul(x[8], y[1]); 1566| 3| accum.mul(x[9], y[0]); 1567| 3| z[9] = accum.extract(); 1568| 3| accum.mul(x[0], y[10]); 1569| 3| accum.mul(x[1], y[9]); 1570| 3| accum.mul(x[2], y[8]); 1571| 3| accum.mul(x[3], y[7]); 1572| 3| accum.mul(x[4], y[6]); 1573| 3| accum.mul(x[5], y[5]); 1574| 3| accum.mul(x[6], y[4]); 1575| 3| accum.mul(x[7], y[3]); 1576| 3| accum.mul(x[8], y[2]); 1577| 3| accum.mul(x[9], y[1]); 1578| 3| accum.mul(x[10], y[0]); 1579| 3| z[10] = accum.extract(); 1580| 3| accum.mul(x[0], y[11]); 1581| 3| accum.mul(x[1], y[10]); 1582| 3| accum.mul(x[2], y[9]); 1583| 3| accum.mul(x[3], y[8]); 1584| 3| accum.mul(x[4], y[7]); 1585| 3| accum.mul(x[5], y[6]); 1586| 3| accum.mul(x[6], y[5]); 1587| 3| accum.mul(x[7], y[4]); 1588| 3| accum.mul(x[8], y[3]); 1589| 3| accum.mul(x[9], y[2]); 1590| 3| accum.mul(x[10], y[1]); 1591| 3| accum.mul(x[11], y[0]); 1592| 3| z[11] = accum.extract(); 1593| 3| accum.mul(x[0], y[12]); 1594| 3| accum.mul(x[1], y[11]); 1595| 3| accum.mul(x[2], y[10]); 1596| 3| accum.mul(x[3], y[9]); 1597| 3| accum.mul(x[4], y[8]); 1598| 3| accum.mul(x[5], y[7]); 1599| 3| accum.mul(x[6], y[6]); 1600| 3| accum.mul(x[7], y[5]); 1601| 3| accum.mul(x[8], y[4]); 1602| 3| accum.mul(x[9], y[3]); 1603| 3| accum.mul(x[10], y[2]); 1604| 3| accum.mul(x[11], y[1]); 1605| 3| accum.mul(x[12], y[0]); 1606| 3| z[12] = accum.extract(); 1607| 3| accum.mul(x[0], y[13]); 1608| 3| accum.mul(x[1], y[12]); 1609| 3| accum.mul(x[2], y[11]); 1610| 3| accum.mul(x[3], y[10]); 1611| 3| accum.mul(x[4], y[9]); 1612| 3| accum.mul(x[5], y[8]); 1613| 3| accum.mul(x[6], y[7]); 1614| 3| accum.mul(x[7], y[6]); 1615| 3| accum.mul(x[8], y[5]); 1616| 3| accum.mul(x[9], y[4]); 1617| 3| accum.mul(x[10], y[3]); 1618| 3| accum.mul(x[11], y[2]); 1619| 3| accum.mul(x[12], y[1]); 1620| 3| accum.mul(x[13], y[0]); 1621| 3| z[13] = accum.extract(); 1622| 3| accum.mul(x[0], y[14]); 1623| 3| accum.mul(x[1], y[13]); 1624| 3| accum.mul(x[2], y[12]); 1625| 3| accum.mul(x[3], y[11]); 1626| 3| accum.mul(x[4], y[10]); 1627| 3| accum.mul(x[5], y[9]); 1628| 3| accum.mul(x[6], y[8]); 1629| 3| accum.mul(x[7], y[7]); 1630| 3| accum.mul(x[8], y[6]); 1631| 3| accum.mul(x[9], y[5]); 1632| 3| accum.mul(x[10], y[4]); 1633| 3| accum.mul(x[11], y[3]); 1634| 3| accum.mul(x[12], y[2]); 1635| 3| accum.mul(x[13], y[1]); 1636| 3| accum.mul(x[14], y[0]); 1637| 3| z[14] = accum.extract(); 1638| 3| accum.mul(x[0], y[15]); 1639| 3| accum.mul(x[1], y[14]); 1640| 3| accum.mul(x[2], y[13]); 1641| 3| accum.mul(x[3], y[12]); 1642| 3| accum.mul(x[4], y[11]); 1643| 3| accum.mul(x[5], y[10]); 1644| 3| accum.mul(x[6], y[9]); 1645| 3| accum.mul(x[7], y[8]); 1646| 3| accum.mul(x[8], y[7]); 1647| 3| accum.mul(x[9], y[6]); 1648| 3| accum.mul(x[10], y[5]); 1649| 3| accum.mul(x[11], y[4]); 1650| 3| accum.mul(x[12], y[3]); 1651| 3| accum.mul(x[13], y[2]); 1652| 3| accum.mul(x[14], y[1]); 1653| 3| accum.mul(x[15], y[0]); 1654| 3| z[15] = accum.extract(); 1655| 3| accum.mul(x[0], y[16]); 1656| 3| accum.mul(x[1], y[15]); 1657| 3| accum.mul(x[2], y[14]); 1658| 3| accum.mul(x[3], y[13]); 1659| 3| accum.mul(x[4], y[12]); 1660| 3| accum.mul(x[5], y[11]); 1661| 3| accum.mul(x[6], y[10]); 1662| 3| accum.mul(x[7], y[9]); 1663| 3| accum.mul(x[8], y[8]); 1664| 3| accum.mul(x[9], y[7]); 1665| 3| accum.mul(x[10], y[6]); 1666| 3| accum.mul(x[11], y[5]); 1667| 3| accum.mul(x[12], y[4]); 1668| 3| accum.mul(x[13], y[3]); 1669| 3| accum.mul(x[14], y[2]); 1670| 3| accum.mul(x[15], y[1]); 1671| 3| accum.mul(x[16], y[0]); 1672| 3| z[16] = accum.extract(); 1673| 3| accum.mul(x[0], y[17]); 1674| 3| accum.mul(x[1], y[16]); 1675| 3| accum.mul(x[2], y[15]); 1676| 3| accum.mul(x[3], y[14]); 1677| 3| accum.mul(x[4], y[13]); 1678| 3| accum.mul(x[5], y[12]); 1679| 3| accum.mul(x[6], y[11]); 1680| 3| accum.mul(x[7], y[10]); 1681| 3| accum.mul(x[8], y[9]); 1682| 3| accum.mul(x[9], y[8]); 1683| 3| accum.mul(x[10], y[7]); 1684| 3| accum.mul(x[11], y[6]); 1685| 3| accum.mul(x[12], y[5]); 1686| 3| accum.mul(x[13], y[4]); 1687| 3| accum.mul(x[14], y[3]); 1688| 3| accum.mul(x[15], y[2]); 1689| 3| accum.mul(x[16], y[1]); 1690| 3| accum.mul(x[17], y[0]); 1691| 3| z[17] = accum.extract(); 1692| 3| accum.mul(x[0], y[18]); 1693| 3| accum.mul(x[1], y[17]); 1694| 3| accum.mul(x[2], y[16]); 1695| 3| accum.mul(x[3], y[15]); 1696| 3| accum.mul(x[4], y[14]); 1697| 3| accum.mul(x[5], y[13]); 1698| 3| accum.mul(x[6], y[12]); 1699| 3| accum.mul(x[7], y[11]); 1700| 3| accum.mul(x[8], y[10]); 1701| 3| accum.mul(x[9], y[9]); 1702| 3| accum.mul(x[10], y[8]); 1703| 3| accum.mul(x[11], y[7]); 1704| 3| accum.mul(x[12], y[6]); 1705| 3| accum.mul(x[13], y[5]); 1706| 3| accum.mul(x[14], y[4]); 1707| 3| accum.mul(x[15], y[3]); 1708| 3| accum.mul(x[16], y[2]); 1709| 3| accum.mul(x[17], y[1]); 1710| 3| accum.mul(x[18], y[0]); 1711| 3| z[18] = accum.extract(); 1712| 3| accum.mul(x[0], y[19]); 1713| 3| accum.mul(x[1], y[18]); 1714| 3| accum.mul(x[2], y[17]); 1715| 3| accum.mul(x[3], y[16]); 1716| 3| accum.mul(x[4], y[15]); 1717| 3| accum.mul(x[5], y[14]); 1718| 3| accum.mul(x[6], y[13]); 1719| 3| accum.mul(x[7], y[12]); 1720| 3| accum.mul(x[8], y[11]); 1721| 3| accum.mul(x[9], y[10]); 1722| 3| accum.mul(x[10], y[9]); 1723| 3| accum.mul(x[11], y[8]); 1724| 3| accum.mul(x[12], y[7]); 1725| 3| accum.mul(x[13], y[6]); 1726| 3| accum.mul(x[14], y[5]); 1727| 3| accum.mul(x[15], y[4]); 1728| 3| accum.mul(x[16], y[3]); 1729| 3| accum.mul(x[17], y[2]); 1730| 3| accum.mul(x[18], y[1]); 1731| 3| accum.mul(x[19], y[0]); 1732| 3| z[19] = accum.extract(); 1733| 3| accum.mul(x[0], y[20]); 1734| 3| accum.mul(x[1], y[19]); 1735| 3| accum.mul(x[2], y[18]); 1736| 3| accum.mul(x[3], y[17]); 1737| 3| accum.mul(x[4], y[16]); 1738| 3| accum.mul(x[5], y[15]); 1739| 3| accum.mul(x[6], y[14]); 1740| 3| accum.mul(x[7], y[13]); 1741| 3| accum.mul(x[8], y[12]); 1742| 3| accum.mul(x[9], y[11]); 1743| 3| accum.mul(x[10], y[10]); 1744| 3| accum.mul(x[11], y[9]); 1745| 3| accum.mul(x[12], y[8]); 1746| 3| accum.mul(x[13], y[7]); 1747| 3| accum.mul(x[14], y[6]); 1748| 3| accum.mul(x[15], y[5]); 1749| 3| accum.mul(x[16], y[4]); 1750| 3| accum.mul(x[17], y[3]); 1751| 3| accum.mul(x[18], y[2]); 1752| 3| accum.mul(x[19], y[1]); 1753| 3| accum.mul(x[20], y[0]); 1754| 3| z[20] = accum.extract(); 1755| 3| accum.mul(x[0], y[21]); 1756| 3| accum.mul(x[1], y[20]); 1757| 3| accum.mul(x[2], y[19]); 1758| 3| accum.mul(x[3], y[18]); 1759| 3| accum.mul(x[4], y[17]); 1760| 3| accum.mul(x[5], y[16]); 1761| 3| accum.mul(x[6], y[15]); 1762| 3| accum.mul(x[7], y[14]); 1763| 3| accum.mul(x[8], y[13]); 1764| 3| accum.mul(x[9], y[12]); 1765| 3| accum.mul(x[10], y[11]); 1766| 3| accum.mul(x[11], y[10]); 1767| 3| accum.mul(x[12], y[9]); 1768| 3| accum.mul(x[13], y[8]); 1769| 3| accum.mul(x[14], y[7]); 1770| 3| accum.mul(x[15], y[6]); 1771| 3| accum.mul(x[16], y[5]); 1772| 3| accum.mul(x[17], y[4]); 1773| 3| accum.mul(x[18], y[3]); 1774| 3| accum.mul(x[19], y[2]); 1775| 3| accum.mul(x[20], y[1]); 1776| 3| accum.mul(x[21], y[0]); 1777| 3| z[21] = accum.extract(); 1778| 3| accum.mul(x[0], y[22]); 1779| 3| accum.mul(x[1], y[21]); 1780| 3| accum.mul(x[2], y[20]); 1781| 3| accum.mul(x[3], y[19]); 1782| 3| accum.mul(x[4], y[18]); 1783| 3| accum.mul(x[5], y[17]); 1784| 3| accum.mul(x[6], y[16]); 1785| 3| accum.mul(x[7], y[15]); 1786| 3| accum.mul(x[8], y[14]); 1787| 3| accum.mul(x[9], y[13]); 1788| 3| accum.mul(x[10], y[12]); 1789| 3| accum.mul(x[11], y[11]); 1790| 3| accum.mul(x[12], y[10]); 1791| 3| accum.mul(x[13], y[9]); 1792| 3| accum.mul(x[14], y[8]); 1793| 3| accum.mul(x[15], y[7]); 1794| 3| accum.mul(x[16], y[6]); 1795| 3| accum.mul(x[17], y[5]); 1796| 3| accum.mul(x[18], y[4]); 1797| 3| accum.mul(x[19], y[3]); 1798| 3| accum.mul(x[20], y[2]); 1799| 3| accum.mul(x[21], y[1]); 1800| 3| accum.mul(x[22], y[0]); 1801| 3| z[22] = accum.extract(); 1802| 3| accum.mul(x[0], y[23]); 1803| 3| accum.mul(x[1], y[22]); 1804| 3| accum.mul(x[2], y[21]); 1805| 3| accum.mul(x[3], y[20]); 1806| 3| accum.mul(x[4], y[19]); 1807| 3| accum.mul(x[5], y[18]); 1808| 3| accum.mul(x[6], y[17]); 1809| 3| accum.mul(x[7], y[16]); 1810| 3| accum.mul(x[8], y[15]); 1811| 3| accum.mul(x[9], y[14]); 1812| 3| accum.mul(x[10], y[13]); 1813| 3| accum.mul(x[11], y[12]); 1814| 3| accum.mul(x[12], y[11]); 1815| 3| accum.mul(x[13], y[10]); 1816| 3| accum.mul(x[14], y[9]); 1817| 3| accum.mul(x[15], y[8]); 1818| 3| accum.mul(x[16], y[7]); 1819| 3| accum.mul(x[17], y[6]); 1820| 3| accum.mul(x[18], y[5]); 1821| 3| accum.mul(x[19], y[4]); 1822| 3| accum.mul(x[20], y[3]); 1823| 3| accum.mul(x[21], y[2]); 1824| 3| accum.mul(x[22], y[1]); 1825| 3| accum.mul(x[23], y[0]); 1826| 3| z[23] = accum.extract(); 1827| 3| accum.mul(x[1], y[23]); 1828| 3| accum.mul(x[2], y[22]); 1829| 3| accum.mul(x[3], y[21]); 1830| 3| accum.mul(x[4], y[20]); 1831| 3| accum.mul(x[5], y[19]); 1832| 3| accum.mul(x[6], y[18]); 1833| 3| accum.mul(x[7], y[17]); 1834| 3| accum.mul(x[8], y[16]); 1835| 3| accum.mul(x[9], y[15]); 1836| 3| accum.mul(x[10], y[14]); 1837| 3| accum.mul(x[11], y[13]); 1838| 3| accum.mul(x[12], y[12]); 1839| 3| accum.mul(x[13], y[11]); 1840| 3| accum.mul(x[14], y[10]); 1841| 3| accum.mul(x[15], y[9]); 1842| 3| accum.mul(x[16], y[8]); 1843| 3| accum.mul(x[17], y[7]); 1844| 3| accum.mul(x[18], y[6]); 1845| 3| accum.mul(x[19], y[5]); 1846| 3| accum.mul(x[20], y[4]); 1847| 3| accum.mul(x[21], y[3]); 1848| 3| accum.mul(x[22], y[2]); 1849| 3| accum.mul(x[23], y[1]); 1850| 3| z[24] = accum.extract(); 1851| 3| accum.mul(x[2], y[23]); 1852| 3| accum.mul(x[3], y[22]); 1853| 3| accum.mul(x[4], y[21]); 1854| 3| accum.mul(x[5], y[20]); 1855| 3| accum.mul(x[6], y[19]); 1856| 3| accum.mul(x[7], y[18]); 1857| 3| accum.mul(x[8], y[17]); 1858| 3| accum.mul(x[9], y[16]); 1859| 3| accum.mul(x[10], y[15]); 1860| 3| accum.mul(x[11], y[14]); 1861| 3| accum.mul(x[12], y[13]); 1862| 3| accum.mul(x[13], y[12]); 1863| 3| accum.mul(x[14], y[11]); 1864| 3| accum.mul(x[15], y[10]); 1865| 3| accum.mul(x[16], y[9]); 1866| 3| accum.mul(x[17], y[8]); 1867| 3| accum.mul(x[18], y[7]); 1868| 3| accum.mul(x[19], y[6]); 1869| 3| accum.mul(x[20], y[5]); 1870| 3| accum.mul(x[21], y[4]); 1871| 3| accum.mul(x[22], y[3]); 1872| 3| accum.mul(x[23], y[2]); 1873| 3| z[25] = accum.extract(); 1874| 3| accum.mul(x[3], y[23]); 1875| 3| accum.mul(x[4], y[22]); 1876| 3| accum.mul(x[5], y[21]); 1877| 3| accum.mul(x[6], y[20]); 1878| 3| accum.mul(x[7], y[19]); 1879| 3| accum.mul(x[8], y[18]); 1880| 3| accum.mul(x[9], y[17]); 1881| 3| accum.mul(x[10], y[16]); 1882| 3| accum.mul(x[11], y[15]); 1883| 3| accum.mul(x[12], y[14]); 1884| 3| accum.mul(x[13], y[13]); 1885| 3| accum.mul(x[14], y[12]); 1886| 3| accum.mul(x[15], y[11]); 1887| 3| accum.mul(x[16], y[10]); 1888| 3| accum.mul(x[17], y[9]); 1889| 3| accum.mul(x[18], y[8]); 1890| 3| accum.mul(x[19], y[7]); 1891| 3| accum.mul(x[20], y[6]); 1892| 3| accum.mul(x[21], y[5]); 1893| 3| accum.mul(x[22], y[4]); 1894| 3| accum.mul(x[23], y[3]); 1895| 3| z[26] = accum.extract(); 1896| 3| accum.mul(x[4], y[23]); 1897| 3| accum.mul(x[5], y[22]); 1898| 3| accum.mul(x[6], y[21]); 1899| 3| accum.mul(x[7], y[20]); 1900| 3| accum.mul(x[8], y[19]); 1901| 3| accum.mul(x[9], y[18]); 1902| 3| accum.mul(x[10], y[17]); 1903| 3| accum.mul(x[11], y[16]); 1904| 3| accum.mul(x[12], y[15]); 1905| 3| accum.mul(x[13], y[14]); 1906| 3| accum.mul(x[14], y[13]); 1907| 3| accum.mul(x[15], y[12]); 1908| 3| accum.mul(x[16], y[11]); 1909| 3| accum.mul(x[17], y[10]); 1910| 3| accum.mul(x[18], y[9]); 1911| 3| accum.mul(x[19], y[8]); 1912| 3| accum.mul(x[20], y[7]); 1913| 3| accum.mul(x[21], y[6]); 1914| 3| accum.mul(x[22], y[5]); 1915| 3| accum.mul(x[23], y[4]); 1916| 3| z[27] = accum.extract(); 1917| 3| accum.mul(x[5], y[23]); 1918| 3| accum.mul(x[6], y[22]); 1919| 3| accum.mul(x[7], y[21]); 1920| 3| accum.mul(x[8], y[20]); 1921| 3| accum.mul(x[9], y[19]); 1922| 3| accum.mul(x[10], y[18]); 1923| 3| accum.mul(x[11], y[17]); 1924| 3| accum.mul(x[12], y[16]); 1925| 3| accum.mul(x[13], y[15]); 1926| 3| accum.mul(x[14], y[14]); 1927| 3| accum.mul(x[15], y[13]); 1928| 3| accum.mul(x[16], y[12]); 1929| 3| accum.mul(x[17], y[11]); 1930| 3| accum.mul(x[18], y[10]); 1931| 3| accum.mul(x[19], y[9]); 1932| 3| accum.mul(x[20], y[8]); 1933| 3| accum.mul(x[21], y[7]); 1934| 3| accum.mul(x[22], y[6]); 1935| 3| accum.mul(x[23], y[5]); 1936| 3| z[28] = accum.extract(); 1937| 3| accum.mul(x[6], y[23]); 1938| 3| accum.mul(x[7], y[22]); 1939| 3| accum.mul(x[8], y[21]); 1940| 3| accum.mul(x[9], y[20]); 1941| 3| accum.mul(x[10], y[19]); 1942| 3| accum.mul(x[11], y[18]); 1943| 3| accum.mul(x[12], y[17]); 1944| 3| accum.mul(x[13], y[16]); 1945| 3| accum.mul(x[14], y[15]); 1946| 3| accum.mul(x[15], y[14]); 1947| 3| accum.mul(x[16], y[13]); 1948| 3| accum.mul(x[17], y[12]); 1949| 3| accum.mul(x[18], y[11]); 1950| 3| accum.mul(x[19], y[10]); 1951| 3| accum.mul(x[20], y[9]); 1952| 3| accum.mul(x[21], y[8]); 1953| 3| accum.mul(x[22], y[7]); 1954| 3| accum.mul(x[23], y[6]); 1955| 3| z[29] = accum.extract(); 1956| 3| accum.mul(x[7], y[23]); 1957| 3| accum.mul(x[8], y[22]); 1958| 3| accum.mul(x[9], y[21]); 1959| 3| accum.mul(x[10], y[20]); 1960| 3| accum.mul(x[11], y[19]); 1961| 3| accum.mul(x[12], y[18]); 1962| 3| accum.mul(x[13], y[17]); 1963| 3| accum.mul(x[14], y[16]); 1964| 3| accum.mul(x[15], y[15]); 1965| 3| accum.mul(x[16], y[14]); 1966| 3| accum.mul(x[17], y[13]); 1967| 3| accum.mul(x[18], y[12]); 1968| 3| accum.mul(x[19], y[11]); 1969| 3| accum.mul(x[20], y[10]); 1970| 3| accum.mul(x[21], y[9]); 1971| 3| accum.mul(x[22], y[8]); 1972| 3| accum.mul(x[23], y[7]); 1973| 3| z[30] = accum.extract(); 1974| 3| accum.mul(x[8], y[23]); 1975| 3| accum.mul(x[9], y[22]); 1976| 3| accum.mul(x[10], y[21]); 1977| 3| accum.mul(x[11], y[20]); 1978| 3| accum.mul(x[12], y[19]); 1979| 3| accum.mul(x[13], y[18]); 1980| 3| accum.mul(x[14], y[17]); 1981| 3| accum.mul(x[15], y[16]); 1982| 3| accum.mul(x[16], y[15]); 1983| 3| accum.mul(x[17], y[14]); 1984| 3| accum.mul(x[18], y[13]); 1985| 3| accum.mul(x[19], y[12]); 1986| 3| accum.mul(x[20], y[11]); 1987| 3| accum.mul(x[21], y[10]); 1988| 3| accum.mul(x[22], y[9]); 1989| 3| accum.mul(x[23], y[8]); 1990| 3| z[31] = accum.extract(); 1991| 3| accum.mul(x[9], y[23]); 1992| 3| accum.mul(x[10], y[22]); 1993| 3| accum.mul(x[11], y[21]); 1994| 3| accum.mul(x[12], y[20]); 1995| 3| accum.mul(x[13], y[19]); 1996| 3| accum.mul(x[14], y[18]); 1997| 3| accum.mul(x[15], y[17]); 1998| 3| accum.mul(x[16], y[16]); 1999| 3| accum.mul(x[17], y[15]); 2000| 3| accum.mul(x[18], y[14]); 2001| 3| accum.mul(x[19], y[13]); 2002| 3| accum.mul(x[20], y[12]); 2003| 3| accum.mul(x[21], y[11]); 2004| 3| accum.mul(x[22], y[10]); 2005| 3| accum.mul(x[23], y[9]); 2006| 3| z[32] = accum.extract(); 2007| 3| accum.mul(x[10], y[23]); 2008| 3| accum.mul(x[11], y[22]); 2009| 3| accum.mul(x[12], y[21]); 2010| 3| accum.mul(x[13], y[20]); 2011| 3| accum.mul(x[14], y[19]); 2012| 3| accum.mul(x[15], y[18]); 2013| 3| accum.mul(x[16], y[17]); 2014| 3| accum.mul(x[17], y[16]); 2015| 3| accum.mul(x[18], y[15]); 2016| 3| accum.mul(x[19], y[14]); 2017| 3| accum.mul(x[20], y[13]); 2018| 3| accum.mul(x[21], y[12]); 2019| 3| accum.mul(x[22], y[11]); 2020| 3| accum.mul(x[23], y[10]); 2021| 3| z[33] = accum.extract(); 2022| 3| accum.mul(x[11], y[23]); 2023| 3| accum.mul(x[12], y[22]); 2024| 3| accum.mul(x[13], y[21]); 2025| 3| accum.mul(x[14], y[20]); 2026| 3| accum.mul(x[15], y[19]); 2027| 3| accum.mul(x[16], y[18]); 2028| 3| accum.mul(x[17], y[17]); 2029| 3| accum.mul(x[18], y[16]); 2030| 3| accum.mul(x[19], y[15]); 2031| 3| accum.mul(x[20], y[14]); 2032| 3| accum.mul(x[21], y[13]); 2033| 3| accum.mul(x[22], y[12]); 2034| 3| accum.mul(x[23], y[11]); 2035| 3| z[34] = accum.extract(); 2036| 3| accum.mul(x[12], y[23]); 2037| 3| accum.mul(x[13], y[22]); 2038| 3| accum.mul(x[14], y[21]); 2039| 3| accum.mul(x[15], y[20]); 2040| 3| accum.mul(x[16], y[19]); 2041| 3| accum.mul(x[17], y[18]); 2042| 3| accum.mul(x[18], y[17]); 2043| 3| accum.mul(x[19], y[16]); 2044| 3| accum.mul(x[20], y[15]); 2045| 3| accum.mul(x[21], y[14]); 2046| 3| accum.mul(x[22], y[13]); 2047| 3| accum.mul(x[23], y[12]); 2048| 3| z[35] = accum.extract(); 2049| 3| accum.mul(x[13], y[23]); 2050| 3| accum.mul(x[14], y[22]); 2051| 3| accum.mul(x[15], y[21]); 2052| 3| accum.mul(x[16], y[20]); 2053| 3| accum.mul(x[17], y[19]); 2054| 3| accum.mul(x[18], y[18]); 2055| 3| accum.mul(x[19], y[17]); 2056| 3| accum.mul(x[20], y[16]); 2057| 3| accum.mul(x[21], y[15]); 2058| 3| accum.mul(x[22], y[14]); 2059| 3| accum.mul(x[23], y[13]); 2060| 3| z[36] = accum.extract(); 2061| 3| accum.mul(x[14], y[23]); 2062| 3| accum.mul(x[15], y[22]); 2063| 3| accum.mul(x[16], y[21]); 2064| 3| accum.mul(x[17], y[20]); 2065| 3| accum.mul(x[18], y[19]); 2066| 3| accum.mul(x[19], y[18]); 2067| 3| accum.mul(x[20], y[17]); 2068| 3| accum.mul(x[21], y[16]); 2069| 3| accum.mul(x[22], y[15]); 2070| 3| accum.mul(x[23], y[14]); 2071| 3| z[37] = accum.extract(); 2072| 3| accum.mul(x[15], y[23]); 2073| 3| accum.mul(x[16], y[22]); 2074| 3| accum.mul(x[17], y[21]); 2075| 3| accum.mul(x[18], y[20]); 2076| 3| accum.mul(x[19], y[19]); 2077| 3| accum.mul(x[20], y[18]); 2078| 3| accum.mul(x[21], y[17]); 2079| 3| accum.mul(x[22], y[16]); 2080| 3| accum.mul(x[23], y[15]); 2081| 3| z[38] = accum.extract(); 2082| 3| accum.mul(x[16], y[23]); 2083| 3| accum.mul(x[17], y[22]); 2084| 3| accum.mul(x[18], y[21]); 2085| 3| accum.mul(x[19], y[20]); 2086| 3| accum.mul(x[20], y[19]); 2087| 3| accum.mul(x[21], y[18]); 2088| 3| accum.mul(x[22], y[17]); 2089| 3| accum.mul(x[23], y[16]); 2090| 3| z[39] = accum.extract(); 2091| 3| accum.mul(x[17], y[23]); 2092| 3| accum.mul(x[18], y[22]); 2093| 3| accum.mul(x[19], y[21]); 2094| 3| accum.mul(x[20], y[20]); 2095| 3| accum.mul(x[21], y[19]); 2096| 3| accum.mul(x[22], y[18]); 2097| 3| accum.mul(x[23], y[17]); 2098| 3| z[40] = accum.extract(); 2099| 3| accum.mul(x[18], y[23]); 2100| 3| accum.mul(x[19], y[22]); 2101| 3| accum.mul(x[20], y[21]); 2102| 3| accum.mul(x[21], y[20]); 2103| 3| accum.mul(x[22], y[19]); 2104| 3| accum.mul(x[23], y[18]); 2105| 3| z[41] = accum.extract(); 2106| 3| accum.mul(x[19], y[23]); 2107| 3| accum.mul(x[20], y[22]); 2108| 3| accum.mul(x[21], y[21]); 2109| 3| accum.mul(x[22], y[20]); 2110| 3| accum.mul(x[23], y[19]); 2111| 3| z[42] = accum.extract(); 2112| 3| accum.mul(x[20], y[23]); 2113| 3| accum.mul(x[21], y[22]); 2114| 3| accum.mul(x[22], y[21]); 2115| 3| accum.mul(x[23], y[20]); 2116| 3| z[43] = accum.extract(); 2117| 3| accum.mul(x[21], y[23]); 2118| 3| accum.mul(x[22], y[22]); 2119| 3| accum.mul(x[23], y[21]); 2120| 3| z[44] = accum.extract(); 2121| 3| accum.mul(x[22], y[23]); 2122| 3| accum.mul(x[23], y[22]); 2123| 3| z[45] = accum.extract(); 2124| 3| accum.mul(x[23], y[23]); 2125| 3| z[46] = accum.extract(); 2126| 3| z[47] = accum.extract(); 2127| 3|} _ZN5Botan12basecase_mulEPmmPKmmS2_m: 20| 26.9k|void basecase_mul(word z[], size_t z_size, const word x[], size_t x_size, const word y[], size_t y_size) { 21| 26.9k| if(z_size < x_size + y_size) { ------------------ | Branch (21:7): [True: 0, False: 26.9k] ------------------ 22| 0| throw Invalid_Argument("basecase_mul z_size too small"); 23| 0| } 24| | 25| 26.9k| const size_t x_size_8 = x_size - (x_size % 8); 26| | 27| 26.9k| zeroize_buffer(z, z_size); 28| | 29| 131k| for(size_t i = 0; i != y_size; ++i) { ------------------ | Branch (29:22): [True: 104k, False: 26.9k] ------------------ 30| 104k| const word y_i = y[i]; 31| | 32| 104k| word carry = 0; 33| | 34| 161k| for(size_t j = 0; j != x_size_8; j += 8) { ------------------ | Branch (34:25): [True: 57.2k, False: 104k] ------------------ 35| 57.2k| carry = word8_madd3(z + i + j, x + j, y_i, carry); 36| 57.2k| } 37| | 38| 372k| for(size_t j = x_size_8; j != x_size; ++j) { ------------------ | Branch (38:32): [True: 267k, False: 104k] ------------------ 39| 267k| z[i + j] = word_madd3(x[j], y_i, z[i + j], &carry); 40| 267k| } 41| | 42| 104k| z[x_size + i] = carry; 43| 104k| } 44| 26.9k|} _ZN5Botan12basecase_sqrEPmmPKmm: 46| 10.5k|void basecase_sqr(word z[], size_t z_size, const word x[], size_t x_size) { 47| 10.5k| if(z_size < 2 * x_size) { ------------------ | Branch (47:7): [True: 0, False: 10.5k] ------------------ 48| 0| throw Invalid_Argument("basecase_sqr z_size too small"); 49| 0| } 50| | 51| 10.5k| const size_t x_size_8 = x_size - (x_size % 8); 52| | 53| 10.5k| zeroize_buffer(z, z_size); 54| | 55| 43.6k| for(size_t i = 0; i != x_size; ++i) { ------------------ | Branch (55:22): [True: 33.1k, False: 10.5k] ------------------ 56| 33.1k| const word x_i = x[i]; 57| | 58| 33.1k| word carry = 0; 59| | 60| 36.9k| for(size_t j = 0; j != x_size_8; j += 8) { ------------------ | Branch (60:25): [True: 3.82k, False: 33.1k] ------------------ 61| 3.82k| carry = word8_madd3(z + i + j, x + j, x_i, carry); 62| 3.82k| } 63| | 64| 128k| for(size_t j = x_size_8; j != x_size; ++j) { ------------------ | Branch (64:32): [True: 95.8k, False: 33.1k] ------------------ 65| 95.8k| z[i + j] = word_madd3(x[j], x_i, z[i + j], &carry); 66| 95.8k| } 67| | 68| 33.1k| z[x_size + i] = carry; 69| 33.1k| } 70| 10.5k|} _ZN5Botan10bigint_mulEPmmPKmmmS2_mmS0_m: 292| 91.1k| size_t ws_size) { 293| 91.1k| zeroize_buffer(z, z_size); 294| | 295| 91.1k| if(x_sw == 1) { ------------------ | Branch (295:7): [True: 9, False: 91.1k] ------------------ 296| 9| bigint_linmul3(z, y, y_sw, x[0]); 297| 91.1k| } else if(y_sw == 1) { ------------------ | Branch (297:14): [True: 3, False: 91.1k] ------------------ 298| 3| bigint_linmul3(z, x, x_sw, y[0]); 299| 91.1k| } else if(sized_for_comba_mul<4>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (299:14): [True: 47.9k, False: 43.2k] ------------------ 300| 47.9k| bigint_comba_mul4(z, x, y); 301| 47.9k| } else if(sized_for_comba_mul<6>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (301:14): [True: 14.6k, False: 28.5k] ------------------ 302| 14.6k| bigint_comba_mul6(z, x, y); 303| 28.5k| } else if(sized_for_comba_mul<8>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (303:14): [True: 493, False: 28.0k] ------------------ 304| 493| bigint_comba_mul8(z, x, y); 305| 28.0k| } else if(sized_for_comba_mul<9>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (305:14): [True: 1.19k, False: 26.8k] ------------------ 306| 1.19k| bigint_comba_mul9(z, x, y); 307| 26.8k| } else if(sized_for_comba_mul<16>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (307:14): [True: 88, False: 26.7k] ------------------ 308| 88| bigint_comba_mul16(z, x, y); 309| 26.7k| } else if(sized_for_comba_mul<24>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (309:14): [True: 0, False: 26.7k] ------------------ 310| 0| bigint_comba_mul24(z, x, y); 311| 26.7k| } else if(x_sw < KARATSUBA_MULTIPLY_THRESHOLD || y_sw < KARATSUBA_MULTIPLY_THRESHOLD || workspace == nullptr) { ------------------ | Branch (311:14): [True: 26.5k, False: 140] | Branch (311:53): [True: 0, False: 140] | Branch (311:92): [True: 0, False: 140] ------------------ 312| 26.5k| basecase_mul(z, z_size, x, x_sw, y, y_sw); 313| 26.5k| } else { 314| 140| const size_t N = karatsuba_size(z_size, x_size, x_sw, y_size, y_sw); 315| | 316| 140| if(N > 0 && z_size >= 2 * N && ws_size >= 2 * N) { ------------------ | Branch (316:10): [True: 137, False: 3] | Branch (316:19): [True: 137, False: 0] | Branch (316:38): [True: 137, False: 0] ------------------ 317| 137| karatsuba_mul(z, x, y, N, workspace); 318| 137| } else { 319| 3| basecase_mul(z, z_size, x, x_sw, y, y_sw); 320| 3| } 321| 140| } 322| 91.1k|} _ZN5Botan10bigint_sqrEPmmPKmmmS0_m: 327| 71.2k|void bigint_sqr(word z[], size_t z_size, const word x[], size_t x_size, size_t x_sw, word workspace[], size_t ws_size) { 328| 71.2k| zeroize_buffer(z, z_size); 329| | 330| 71.2k| BOTAN_ASSERT(z_size / 2 >= x_sw, "Output size is sufficient"); ------------------ | | 71| 71.2k| do { \ | | 72| 71.2k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 71.2k| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 71.2k] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 71.2k| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 71.2k] | | ------------------ ------------------ 331| | 332| 71.2k| if(x_sw == 1) { ------------------ | Branch (332:7): [True: 8, False: 71.2k] ------------------ 333| 8| bigint_linmul3(z, x, x_sw, x[0]); 334| 71.2k| } else if(sized_for_comba_sqr<4>(x_sw, x_size, z_size)) { ------------------ | Branch (334:14): [True: 59.9k, False: 11.2k] ------------------ 335| 59.9k| bigint_comba_sqr4(z, x); 336| 59.9k| } else if(sized_for_comba_sqr<6>(x_sw, x_size, z_size)) { ------------------ | Branch (336:14): [True: 3, False: 11.2k] ------------------ 337| 3| bigint_comba_sqr6(z, x); 338| 11.2k| } else if(sized_for_comba_sqr<8>(x_sw, x_size, z_size)) { ------------------ | Branch (338:14): [True: 584, False: 10.6k] ------------------ 339| 584| bigint_comba_sqr8(z, x); 340| 10.6k| } else if(sized_for_comba_sqr<9>(x_sw, x_size, z_size)) { ------------------ | Branch (340:14): [True: 37, False: 10.6k] ------------------ 341| 37| bigint_comba_sqr9(z, x); 342| 10.6k| } else if(sized_for_comba_sqr<16>(x_sw, x_size, z_size)) { ------------------ | Branch (342:14): [True: 88, False: 10.5k] ------------------ 343| 88| bigint_comba_sqr16(z, x); 344| 10.5k| } else if(sized_for_comba_sqr<24>(x_sw, x_size, z_size)) { ------------------ | Branch (344:14): [True: 0, False: 10.5k] ------------------ 345| 0| bigint_comba_sqr24(z, x); 346| 10.5k| } else if(x_size < KARATSUBA_SQUARE_THRESHOLD || workspace == nullptr) { ------------------ | Branch (346:14): [True: 10.4k, False: 116] | Branch (346:53): [True: 0, False: 116] ------------------ 347| 10.4k| basecase_sqr(z, z_size, x, x_sw); 348| 10.4k| } else { 349| 116| const size_t N = karatsuba_size(z_size, x_size, x_sw); 350| | 351| 116| if(N > 0 && z_size >= 2 * N && ws_size >= 2 * N) { ------------------ | Branch (351:10): [True: 17, False: 99] | Branch (351:19): [True: 17, False: 0] | Branch (351:38): [True: 17, False: 0] ------------------ 352| 17| karatsuba_sqr(z, x, N, workspace); 353| 99| } else { 354| 99| basecase_sqr(z, z_size, x, x_sw); 355| 99| } 356| 116| } 357| 71.2k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_114karatsuba_sizeEmmmmm: 203| 140|size_t karatsuba_size(size_t z_size, size_t x_size, size_t x_sw, size_t y_size, size_t y_sw) { 204| 140| if(x_sw > x_size || x_sw > y_size || y_sw > x_size || y_sw > y_size) { ------------------ | Branch (204:7): [True: 0, False: 140] | Branch (204:24): [True: 0, False: 140] | Branch (204:41): [True: 0, False: 140] | Branch (204:58): [True: 0, False: 140] ------------------ 205| 0| return 0; 206| 0| } 207| | 208| 140| if(((x_size == x_sw) && (x_size % 2 != 0)) || ((y_size == y_sw) && (y_size % 2 != 0))) { ------------------ | Branch (208:8): [True: 0, False: 140] | Branch (208:28): [True: 0, False: 0] | Branch (208:51): [True: 0, False: 140] | Branch (208:71): [True: 0, False: 0] ------------------ 209| 0| return 0; 210| 0| } 211| | 212| 140| const size_t start = (x_sw > y_sw) ? x_sw : y_sw; ------------------ | Branch (212:25): [True: 60, False: 80] ------------------ 213| 140| const size_t end = (x_size < y_size) ? x_size : y_size; ------------------ | Branch (213:23): [True: 60, False: 80] ------------------ 214| | 215| 140| if(start == end) { ------------------ | Branch (215:7): [True: 0, False: 140] ------------------ 216| 0| if(start % 2 != 0) { ------------------ | Branch (216:10): [True: 0, False: 0] ------------------ 217| 0| return 0; 218| 0| } 219| 0| return start; 220| 0| } 221| | 222| 245| for(size_t j = start; j <= end; ++j) { ------------------ | Branch (222:26): [True: 245, False: 0] ------------------ 223| 245| if(j % 2 != 0) { ------------------ | Branch (223:10): [True: 105, False: 140] ------------------ 224| 105| continue; 225| 105| } 226| | 227| 140| if(2 * j > z_size) { ------------------ | Branch (227:10): [True: 3, False: 137] ------------------ 228| 3| return 0; 229| 3| } 230| | 231| 137| if(x_sw <= j && j <= x_size && y_sw <= j && j <= y_size) { ------------------ | Branch (231:10): [True: 137, False: 0] | Branch (231:23): [True: 137, False: 0] | Branch (231:38): [True: 137, False: 0] | Branch (231:51): [True: 137, False: 0] ------------------ 232| 137| if(j % 4 == 2 && (j + 2) <= x_size && (j + 2) <= y_size && 2 * (j + 2) <= z_size) { ------------------ | Branch (232:13): [True: 120, False: 17] | Branch (232:27): [True: 69, False: 51] | Branch (232:48): [True: 69, False: 0] | Branch (232:69): [True: 0, False: 69] ------------------ 233| 0| return j + 2; 234| 0| } 235| 137| return j; 236| 137| } 237| 137| } 238| | 239| 0| return 0; 240| 140|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_113karatsuba_mulEPmPKmS3_mS1_: 80| 548|void karatsuba_mul(word z[], const word x[], const word y[], size_t N, word workspace[]) { 81| 548| if(N < KARATSUBA_MULTIPLY_THRESHOLD || N % 2 != 0) { ------------------ | Branch (81:7): [True: 411, False: 137] | Branch (81:43): [True: 0, False: 137] ------------------ 82| 411| switch(N) { 83| 0| case 6: ------------------ | Branch (83:10): [True: 0, False: 411] ------------------ 84| 0| return bigint_comba_mul6(z, x, y); 85| 0| case 8: ------------------ | Branch (85:10): [True: 0, False: 411] ------------------ 86| 0| return bigint_comba_mul8(z, x, y); 87| 0| case 9: ------------------ | Branch (87:10): [True: 0, False: 411] ------------------ 88| 0| return bigint_comba_mul9(z, x, y); 89| 48| case 16: ------------------ | Branch (89:10): [True: 48, False: 363] ------------------ 90| 48| return bigint_comba_mul16(z, x, y); 91| 3| case 24: ------------------ | Branch (91:10): [True: 3, False: 408] ------------------ 92| 3| return bigint_comba_mul24(z, x, y); 93| 360| default: ------------------ | Branch (93:10): [True: 360, False: 51] ------------------ 94| 360| return basecase_mul(z, 2 * N, x, N, y, N); 95| 411| } 96| 411| } 97| | 98| 137| const size_t N2 = N / 2; 99| | 100| 137| const word* x0 = x; 101| 137| const word* x1 = x + N2; 102| 137| const word* y0 = y; 103| 137| const word* y1 = y + N2; 104| 137| word* z0 = z; 105| 137| word* z1 = z + N; 106| | 107| 137| word* ws0 = workspace; 108| 137| word* ws1 = workspace + N; 109| | 110| 137| zeroize_buffer(workspace, 2 * N); 111| | 112| | /* 113| | * If either of cmp0 or cmp1 is zero then z0 or z1 resp is zero here, 114| | * resulting in a no-op - z0*z1 will be equal to zero so we don't need to do 115| | * anything, zeroize_buffer above already set the correct result. 116| | * 117| | * However we ignore the result of the comparisons and always perform the 118| | * subtractions and recursively multiply to avoid the timing channel. 119| | */ 120| | 121| | // First compute (X_lo - X_hi)*(Y_hi - Y_lo) 122| 137| const auto cmp0 = bigint_sub_abs(z0, x0, x1, N2, workspace); 123| 137| const auto cmp1 = bigint_sub_abs(z1, y1, y0, N2, workspace); 124| 137| const auto neg_mask = ~(cmp0 ^ cmp1); 125| | 126| 137| karatsuba_mul(ws0, z0, z1, N2, ws1); 127| | 128| | // Compute X_lo * Y_lo 129| 137| karatsuba_mul(z0, x0, y0, N2, ws1); 130| | 131| | // Compute X_hi * Y_hi 132| 137| karatsuba_mul(z1, x1, y1, N2, ws1); 133| | 134| 137| const word ws_carry = bigint_add3(ws1, z0, N, z1, N); 135| 137| word z_carry = bigint_add2(z + N2, N, ws1, N); 136| | 137| 137| z_carry += bigint_add2(z + N + N2, N2, &ws_carry, 1); 138| 137| bigint_add2(z + N + N2, N2, &z_carry, 1); 139| | 140| 137| zeroize_buffer(workspace + N, N2); 141| | 142| 137| bigint_cnd_add(neg_mask.value(), z + N2, workspace, 2 * N - N2); 143| 137| bigint_cnd_sub((~neg_mask).value(), z + N2, workspace, 2 * N - N2); 144| 137|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_114karatsuba_sizeEmmm: 245| 116|size_t karatsuba_size(size_t z_size, size_t x_size, size_t x_sw) { 246| 116| if(x_sw == x_size) { ------------------ | Branch (246:7): [True: 0, False: 116] ------------------ 247| 0| if(x_sw % 2 != 0) { ------------------ | Branch (247:10): [True: 0, False: 0] ------------------ 248| 0| return 0; 249| 0| } 250| 0| return x_sw; 251| 0| } 252| | 253| 215| for(size_t j = x_sw; j <= x_size; ++j) { ------------------ | Branch (253:25): [True: 215, False: 0] ------------------ 254| 215| if(j % 2 != 0) { ------------------ | Branch (254:10): [True: 99, False: 116] ------------------ 255| 99| continue; 256| 99| } 257| | 258| 116| if(2 * j > z_size) { ------------------ | Branch (258:10): [True: 99, False: 17] ------------------ 259| 99| return 0; 260| 99| } 261| | 262| 17| if(j % 4 == 2 && (j + 2) <= x_size && 2 * (j + 2) <= z_size) { ------------------ | Branch (262:10): [True: 0, False: 17] | Branch (262:24): [True: 0, False: 0] | Branch (262:45): [True: 0, False: 0] ------------------ 263| 0| return j + 2; 264| 0| } 265| 17| return j; 266| 17| } 267| | 268| 0| return 0; 269| 116|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_113karatsuba_sqrEPmPKmmS1_: 149| 68|void karatsuba_sqr(word z[], const word x[], size_t N, word workspace[]) { 150| 68| if(N < KARATSUBA_SQUARE_THRESHOLD || N % 2 != 0) { ------------------ | Branch (150:7): [True: 51, False: 17] | Branch (150:41): [True: 0, False: 17] ------------------ 151| 51| switch(N) { 152| 0| case 6: ------------------ | Branch (152:10): [True: 0, False: 51] ------------------ 153| 0| return bigint_comba_sqr6(z, x); 154| 0| case 8: ------------------ | Branch (154:10): [True: 0, False: 51] ------------------ 155| 0| return bigint_comba_sqr8(z, x); 156| 0| case 9: ------------------ | Branch (156:10): [True: 0, False: 51] ------------------ 157| 0| return bigint_comba_sqr9(z, x); 158| 48| case 16: ------------------ | Branch (158:10): [True: 48, False: 3] ------------------ 159| 48| return bigint_comba_sqr16(z, x); 160| 3| case 24: ------------------ | Branch (160:10): [True: 3, False: 48] ------------------ 161| 3| return bigint_comba_sqr24(z, x); 162| 0| default: ------------------ | Branch (162:10): [True: 0, False: 51] ------------------ 163| 0| return basecase_sqr(z, 2 * N, x, N); 164| 51| } 165| 51| } 166| | 167| 17| const size_t N2 = N / 2; 168| | 169| 17| const word* x0 = x; 170| 17| const word* x1 = x + N2; 171| 17| word* z0 = z; 172| 17| word* z1 = z + N; 173| | 174| 17| word* ws0 = workspace; 175| 17| word* ws1 = workspace + N; 176| | 177| 17| zeroize_buffer(workspace, 2 * N); 178| | 179| | // See comment in karatsuba_mul 180| 17| bigint_sub_abs(z0, x0, x1, N2, workspace); 181| 17| karatsuba_sqr(ws0, z0, N2, ws1); 182| | 183| 17| karatsuba_sqr(z0, x0, N2, ws1); 184| 17| karatsuba_sqr(z1, x1, N2, ws1); 185| | 186| 17| const word ws_carry = bigint_add3(ws1, z0, N, z1, N); 187| 17| word z_carry = bigint_add2(z + N2, N, ws1, N); 188| | 189| 17| z_carry += bigint_add2(z + N + N2, N2, &ws_carry, 1); 190| 17| bigint_add2(z + N + N2, N2, &z_carry, 1); 191| | 192| | /* 193| | * This is only actually required if cmp (result of bigint_sub_abs) is != 0, 194| | * however if cmp==0 then ws0[0:N] == 0 and avoiding the jump hides a 195| | * timing channel. 196| | */ 197| 17| bigint_sub2(z + N2, 2 * N - N2, ws0, N); 198| 17|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm4EEEbmmmmm: 272| 91.1k|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) { 273| 91.1k| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 73.1k, False: 18.0k] | Branch (273:26): [True: 57.4k, False: 15.7k] | Branch (273:42): [True: 57.4k, False: 0] | Branch (273:56): [True: 53.0k, False: 4.37k] | Branch (273:72): [True: 47.9k, False: 5.10k] ------------------ 274| 91.1k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm6EEEbmmmmm: 272| 43.2k|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) { 273| 43.2k| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 39.8k, False: 3.33k] | Branch (273:26): [True: 24.1k, False: 15.7k] | Branch (273:42): [True: 24.1k, False: 0] | Branch (273:56): [True: 19.7k, False: 4.37k] | Branch (273:72): [True: 14.6k, False: 5.10k] ------------------ 274| 43.2k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm8EEEbmmmmm: 272| 28.5k|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) { 273| 28.5k| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 25.6k, False: 2.84k] | Branch (273:26): [True: 5.30k, False: 20.3k] | Branch (273:42): [True: 5.30k, False: 0] | Branch (273:56): [True: 1.74k, False: 3.56k] | Branch (273:72): [True: 493, False: 1.24k] ------------------ 274| 28.5k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm9EEEbmmmmm: 272| 28.0k|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) { 273| 28.0k| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 26.3k, False: 1.64k] | Branch (273:26): [True: 2.75k, False: 23.6k] | Branch (273:42): [True: 2.75k, False: 0] | Branch (273:56): [True: 1.43k, False: 1.32k] | Branch (273:72): [True: 1.19k, False: 236] ------------------ 274| 28.0k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm16EEEbmmmmm: 272| 26.8k|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) { 273| 26.8k| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 25.4k, False: 1.34k] | Branch (273:26): [True: 198, False: 25.2k] | Branch (273:42): [True: 198, False: 0] | Branch (273:56): [True: 198, False: 0] | Branch (273:72): [True: 88, False: 110] ------------------ 274| 26.8k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm24EEEbmmmmm: 272| 26.7k|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) { 273| 26.7k| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 26.5k, False: 140] | Branch (273:26): [True: 648, False: 25.9k] | Branch (273:42): [True: 648, False: 0] | Branch (273:56): [True: 648, False: 0] | Branch (273:72): [True: 0, False: 648] ------------------ 274| 26.7k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm4EEEbmmm: 277| 71.2k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 71.2k| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 70.3k, False: 828] | Branch (278:26): [True: 63.2k, False: 7.08k] | Branch (278:42): [True: 59.9k, False: 3.36k] ------------------ 279| 71.2k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm6EEEbmmm: 277| 11.2k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 11.2k| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 10.4k, False: 825] | Branch (278:26): [True: 3.36k, False: 7.08k] | Branch (278:42): [True: 3, False: 3.36k] ------------------ 279| 11.2k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm8EEEbmmm: 277| 11.2k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 11.2k| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 11.0k, False: 241] | Branch (278:26): [True: 2.87k, False: 8.16k] | Branch (278:42): [True: 584, False: 2.28k] ------------------ 279| 11.2k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm9EEEbmmm: 277| 10.6k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 10.6k| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 10.4k, False: 204] | Branch (278:26): [True: 1.10k, False: 9.38k] | Branch (278:42): [True: 37, False: 1.06k] ------------------ 279| 10.6k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm16EEEbmmm: 277| 10.6k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 10.6k| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 10.5k, False: 116] | Branch (278:26): [True: 88, False: 10.4k] | Branch (278:42): [True: 88, False: 0] ------------------ 279| 10.6k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm24EEEbmmm: 277| 10.5k|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 10.5k| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 10.5k, False: 20] | Branch (278:26): [True: 96, False: 10.4k] | Branch (278:42): [True: 0, False: 96] ------------------ 279| 10.5k|} _ZN5Botan25bigint_monty_redc_genericEPmPKmmS2_mmS0_: 95| 55.4k| word r[], const word z[], size_t z_size, const word p[], size_t p_size, word p_dash, word ws[]) { 96| 55.4k| BOTAN_ARG_CHECK(z_size >= 2 * p_size && p_size > 0, "Invalid sizes for bigint_monty_redc_generic"); ------------------ | | 35| 55.4k| do { \ | | 36| 55.4k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 110k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 55.4k, False: 0] | | | Branch (37:12): [True: 55.4k, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 55.4k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 55.4k] | | ------------------ ------------------ 97| | 98| 55.4k| word3 accum; 99| | 100| 55.4k| accum.add(z[0]); 101| | 102| 55.4k| ws[0] = accum.monty_step(p[0], p_dash); 103| | 104| 169k| for(size_t i = 1; i != p_size; ++i) { ------------------ | Branch (104:22): [True: 114k, False: 55.4k] ------------------ 105| 114k| mul_rev_range(accum, ws, p, i); 106| 114k| accum.add(z[i]); 107| 114k| ws[i] = accum.monty_step(p[0], p_dash); 108| 114k| } 109| | 110| 169k| for(size_t i = 0; i != p_size - 1; ++i) { ------------------ | Branch (110:22): [True: 114k, False: 55.4k] ------------------ 111| 114k| mul_rev_range(accum, &ws[i + 1], &p[i], p_size - (i + 1)); 112| 114k| accum.add(z[p_size + i]); 113| 114k| ws[i] = accum.extract(); 114| 114k| } 115| | 116| 55.4k| accum.add(z[2 * p_size - 1]); 117| | 118| 55.4k| ws[p_size - 1] = accum.extract(); 119| | // w1 is the final part, which is not stored in the workspace 120| 55.4k| const word w1 = accum.extract(); 121| | 122| | /* 123| | * The result might need to be reduced mod p. To avoid a timing 124| | * channel, always perform the subtraction. If in the computation 125| | * of x - p a borrow is required then x was already < p. 126| | * 127| | * x starts at ws[0] and is p_size bytes long plus a possible high 128| | * digit left over in w1. 129| | * 130| | * x - p starts at z[0] and is also p_size bytes long 131| | * 132| | * If borrow was set after the subtraction, then x was already less 133| | * than p and the subtraction was not needed. In that case overwrite 134| | * z[0:p_size] with the original x in ws[0:p_size]. 135| | * 136| | * We only copy out p_size in the final step because we know 137| | * the Montgomery result is < P 138| | */ 139| | 140| 55.4k| bigint_monty_maybe_sub(p_size, r, w1, ws, p); 141| 55.4k|} _ZN5Botan16bigint_monty_mulEPmPKmS2_S2_mmS0_m: 144| 15.3k| word z[], const word x[], const word y[], const word p[], size_t p_size, word p_dash, word ws[], size_t ws_size) { 145| 15.3k| BOTAN_ARG_CHECK(ws_size >= 4 * p_size && p_size > 0, "Invalid workspace for Montgomery multiplication"); ------------------ | | 35| 15.3k| do { \ | | 36| 15.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 30.6k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 15.3k, False: 0] | | | Branch (37:12): [True: 15.3k, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 15.3k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 15.3k] | | ------------------ ------------------ 146| | 147| 15.3k|#if defined(BOTAN_HAS_MP_MULX) 148| 15.3k| if(use_mulx_monty(p_size)) { ------------------ | Branch (148:7): [True: 1.18k, False: 14.1k] ------------------ 149| 1.18k| return bigint_mulx_monty_mul(z, x, y, p, p_size, p_dash, ws); 150| 1.18k| } 151| 14.1k|#endif 152| | 153| 14.1k| word* prod = ws; 154| 14.1k| word* mul_ws = ws + 2 * p_size; 155| 14.1k| bigint_mul(prod, 2 * p_size, x, p_size, p_size, y, p_size, p_size, mul_ws, 2 * p_size); 156| 14.1k| bigint_monty_redc(z, prod, p, p_size, p_dash, mul_ws, 2 * p_size); 157| 14.1k|} _ZN5Botan16bigint_monty_sqrEPmPKmS2_mmS0_m: 159| 50.8k|void bigint_monty_sqr(word z[], const word x[], const word p[], size_t p_size, word p_dash, word ws[], size_t ws_size) { 160| 50.8k| BOTAN_ARG_CHECK(ws_size >= 4 * p_size && p_size > 0, "Invalid workspace for Montgomery squaring"); ------------------ | | 35| 50.8k| do { \ | | 36| 50.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 101k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 50.8k, False: 0] | | | Branch (37:12): [True: 50.8k, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 50.8k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 50.8k] | | ------------------ ------------------ 161| | 162| 50.8k| word* prod = ws; 163| | 164| 50.8k|#if defined(BOTAN_HAS_MP_MULX) 165| 50.8k| if(use_mulx_monty(p_size)) { ------------------ | Branch (165:7): [True: 1.96k, False: 48.8k] ------------------ 166| 1.96k| return bigint_mulx_monty_sqr(z, x, p, p_size, p_dash, ws); 167| 1.96k| } 168| 48.8k|#endif 169| | 170| 48.8k| word* mul_ws = ws + 2 * p_size; 171| 48.8k| bigint_sqr(prod, 2 * p_size, x, p_size, p_size, mul_ws, 2 * p_size); 172| 48.8k| bigint_monty_redc(z, prod, p, p_size, p_dash, mul_ws, 2 * p_size); 173| 48.8k|} mp_monty.cpp:_ZN5Botan12_GLOBAL__N_113mul_rev_rangeERNS_5word3ImEEPKmS5_m: 22| 228k|BOTAN_FORCE_INLINE void mul_rev_range(word3& accum, const word ws[], const word p[], size_t bound) { 23| | /* 24| | Unrolled version of: 25| | 26| | for(size_t i = 0; i < bound; ++i) { 27| | accum.mul(ws[i], p[bound - i]); 28| | } 29| | */ 30| | 31| 228k| size_t lower = 0; 32| 463k| while(lower < bound) { ------------------ | Branch (32:10): [True: 234k, False: 228k] ------------------ 33| 234k| const size_t upper = bound - lower; 34| | 35| 234k| if(upper >= 16) { ------------------ | Branch (35:10): [True: 0, False: 234k] ------------------ 36| 0| accum.mul(ws[lower], p[upper]); 37| 0| accum.mul(ws[lower + 1], p[upper - 1]); 38| 0| accum.mul(ws[lower + 2], p[upper - 2]); 39| 0| accum.mul(ws[lower + 3], p[upper - 3]); 40| 0| accum.mul(ws[lower + 4], p[upper - 4]); 41| 0| accum.mul(ws[lower + 5], p[upper - 5]); 42| 0| accum.mul(ws[lower + 6], p[upper - 6]); 43| 0| accum.mul(ws[lower + 7], p[upper - 7]); 44| 0| accum.mul(ws[lower + 8], p[upper - 8]); 45| 0| accum.mul(ws[lower + 9], p[upper - 9]); 46| 0| accum.mul(ws[lower + 10], p[upper - 10]); 47| 0| accum.mul(ws[lower + 11], p[upper - 11]); 48| 0| accum.mul(ws[lower + 12], p[upper - 12]); 49| 0| accum.mul(ws[lower + 13], p[upper - 13]); 50| 0| accum.mul(ws[lower + 14], p[upper - 14]); 51| 0| accum.mul(ws[lower + 15], p[upper - 15]); 52| 0| lower += 16; 53| 234k| } else if(upper >= 8) { ------------------ | Branch (53:17): [True: 1.15k, False: 233k] ------------------ 54| 1.15k| accum.mul(ws[lower], p[upper]); 55| 1.15k| accum.mul(ws[lower + 1], p[upper - 1]); 56| 1.15k| accum.mul(ws[lower + 2], p[upper - 2]); 57| 1.15k| accum.mul(ws[lower + 3], p[upper - 3]); 58| 1.15k| accum.mul(ws[lower + 4], p[upper - 4]); 59| 1.15k| accum.mul(ws[lower + 5], p[upper - 5]); 60| 1.15k| accum.mul(ws[lower + 6], p[upper - 6]); 61| 1.15k| accum.mul(ws[lower + 7], p[upper - 7]); 62| 1.15k| lower += 8; 63| 233k| } else if(upper >= 4) { ------------------ | Branch (63:17): [True: 4.60k, False: 228k] ------------------ 64| 4.60k| accum.mul(ws[lower], p[upper]); 65| 4.60k| accum.mul(ws[lower + 1], p[upper - 1]); 66| 4.60k| accum.mul(ws[lower + 2], p[upper - 2]); 67| 4.60k| accum.mul(ws[lower + 3], p[upper - 3]); 68| 4.60k| lower += 4; 69| 228k| } else if(upper >= 2) { ------------------ | Branch (69:17): [True: 114k, False: 114k] ------------------ 70| 114k| accum.mul(ws[lower], p[upper]); 71| 114k| accum.mul(ws[lower + 1], p[upper - 1]); 72| 114k| lower += 2; 73| 114k| } else { 74| 114k| accum.mul(ws[lower], p[upper]); 75| 114k| lower += 1; 76| 114k| } 77| 234k| } 78| 228k|} _ZN5Botan19bigint_monty_redc_4EPmPKmS2_mS0_: 12| 10.3M|void bigint_monty_redc_4(word r[4], const word z[8], const word p[4], word p_dash, word ws[4]) { 13| 10.3M| word3 accum; 14| 10.3M| accum.add(z[0]); 15| 10.3M| ws[0] = accum.monty_step(p[0], p_dash); 16| 10.3M| accum.mul(ws[0], p[1]); 17| 10.3M| accum.add(z[1]); 18| 10.3M| ws[1] = accum.monty_step(p[0], p_dash); 19| 10.3M| accum.mul(ws[0], p[2]); 20| 10.3M| accum.mul(ws[1], p[1]); 21| 10.3M| accum.add(z[2]); 22| 10.3M| ws[2] = accum.monty_step(p[0], p_dash); 23| 10.3M| accum.mul(ws[0], p[3]); 24| 10.3M| accum.mul(ws[1], p[2]); 25| 10.3M| accum.mul(ws[2], p[1]); 26| 10.3M| accum.add(z[3]); 27| 10.3M| ws[3] = accum.monty_step(p[0], p_dash); 28| 10.3M| accum.mul(ws[1], p[3]); 29| 10.3M| accum.mul(ws[2], p[2]); 30| 10.3M| accum.mul(ws[3], p[1]); 31| 10.3M| accum.add(z[4]); 32| 10.3M| ws[0] = accum.extract(); 33| 10.3M| accum.mul(ws[2], p[3]); 34| 10.3M| accum.mul(ws[3], p[2]); 35| 10.3M| accum.add(z[5]); 36| 10.3M| ws[1] = accum.extract(); 37| 10.3M| accum.mul(ws[3], p[3]); 38| 10.3M| accum.add(z[6]); 39| 10.3M| ws[2] = accum.extract(); 40| 10.3M| accum.add(z[7]); 41| 10.3M| ws[3] = accum.extract(); 42| 10.3M| const word w1 = accum.extract(); 43| 10.3M| bigint_monty_maybe_sub<4>(r, w1, ws, p); 44| 10.3M|} _ZN5Botan19bigint_monty_redc_6EPmPKmS2_mS0_: 46| 4.88k|void bigint_monty_redc_6(word r[6], const word z[12], const word p[6], word p_dash, word ws[6]) { 47| 4.88k| word3 accum; 48| 4.88k| accum.add(z[0]); 49| 4.88k| ws[0] = accum.monty_step(p[0], p_dash); 50| 4.88k| accum.mul(ws[0], p[1]); 51| 4.88k| accum.add(z[1]); 52| 4.88k| ws[1] = accum.monty_step(p[0], p_dash); 53| 4.88k| accum.mul(ws[0], p[2]); 54| 4.88k| accum.mul(ws[1], p[1]); 55| 4.88k| accum.add(z[2]); 56| 4.88k| ws[2] = accum.monty_step(p[0], p_dash); 57| 4.88k| accum.mul(ws[0], p[3]); 58| 4.88k| accum.mul(ws[1], p[2]); 59| 4.88k| accum.mul(ws[2], p[1]); 60| 4.88k| accum.add(z[3]); 61| 4.88k| ws[3] = accum.monty_step(p[0], p_dash); 62| 4.88k| accum.mul(ws[0], p[4]); 63| 4.88k| accum.mul(ws[1], p[3]); 64| 4.88k| accum.mul(ws[2], p[2]); 65| 4.88k| accum.mul(ws[3], p[1]); 66| 4.88k| accum.add(z[4]); 67| 4.88k| ws[4] = accum.monty_step(p[0], p_dash); 68| 4.88k| accum.mul(ws[0], p[5]); 69| 4.88k| accum.mul(ws[1], p[4]); 70| 4.88k| accum.mul(ws[2], p[3]); 71| 4.88k| accum.mul(ws[3], p[2]); 72| 4.88k| accum.mul(ws[4], p[1]); 73| 4.88k| accum.add(z[5]); 74| 4.88k| ws[5] = accum.monty_step(p[0], p_dash); 75| 4.88k| accum.mul(ws[1], p[5]); 76| 4.88k| accum.mul(ws[2], p[4]); 77| 4.88k| accum.mul(ws[3], p[3]); 78| 4.88k| accum.mul(ws[4], p[2]); 79| 4.88k| accum.mul(ws[5], p[1]); 80| 4.88k| accum.add(z[6]); 81| 4.88k| ws[0] = accum.extract(); 82| 4.88k| accum.mul(ws[2], p[5]); 83| 4.88k| accum.mul(ws[3], p[4]); 84| 4.88k| accum.mul(ws[4], p[3]); 85| 4.88k| accum.mul(ws[5], p[2]); 86| 4.88k| accum.add(z[7]); 87| 4.88k| ws[1] = accum.extract(); 88| 4.88k| accum.mul(ws[3], p[5]); 89| 4.88k| accum.mul(ws[4], p[4]); 90| 4.88k| accum.mul(ws[5], p[3]); 91| 4.88k| accum.add(z[8]); 92| 4.88k| ws[2] = accum.extract(); 93| 4.88k| accum.mul(ws[4], p[5]); 94| 4.88k| accum.mul(ws[5], p[4]); 95| 4.88k| accum.add(z[9]); 96| 4.88k| ws[3] = accum.extract(); 97| 4.88k| accum.mul(ws[5], p[5]); 98| 4.88k| accum.add(z[10]); 99| 4.88k| ws[4] = accum.extract(); 100| 4.88k| accum.add(z[11]); 101| 4.88k| ws[5] = accum.extract(); 102| 4.88k| const word w1 = accum.extract(); 103| 4.88k| bigint_monty_maybe_sub<6>(r, w1, ws, p); 104| 4.88k|} _ZN5Botan19bigint_monty_redc_8EPmPKmS2_mS0_: 106| 59.6k|void bigint_monty_redc_8(word r[8], const word z[16], const word p[8], word p_dash, word ws[8]) { 107| 59.6k| word3 accum; 108| 59.6k| accum.add(z[0]); 109| 59.6k| ws[0] = accum.monty_step(p[0], p_dash); 110| 59.6k| accum.mul(ws[0], p[1]); 111| 59.6k| accum.add(z[1]); 112| 59.6k| ws[1] = accum.monty_step(p[0], p_dash); 113| 59.6k| accum.mul(ws[0], p[2]); 114| 59.6k| accum.mul(ws[1], p[1]); 115| 59.6k| accum.add(z[2]); 116| 59.6k| ws[2] = accum.monty_step(p[0], p_dash); 117| 59.6k| accum.mul(ws[0], p[3]); 118| 59.6k| accum.mul(ws[1], p[2]); 119| 59.6k| accum.mul(ws[2], p[1]); 120| 59.6k| accum.add(z[3]); 121| 59.6k| ws[3] = accum.monty_step(p[0], p_dash); 122| 59.6k| accum.mul(ws[0], p[4]); 123| 59.6k| accum.mul(ws[1], p[3]); 124| 59.6k| accum.mul(ws[2], p[2]); 125| 59.6k| accum.mul(ws[3], p[1]); 126| 59.6k| accum.add(z[4]); 127| 59.6k| ws[4] = accum.monty_step(p[0], p_dash); 128| 59.6k| accum.mul(ws[0], p[5]); 129| 59.6k| accum.mul(ws[1], p[4]); 130| 59.6k| accum.mul(ws[2], p[3]); 131| 59.6k| accum.mul(ws[3], p[2]); 132| 59.6k| accum.mul(ws[4], p[1]); 133| 59.6k| accum.add(z[5]); 134| 59.6k| ws[5] = accum.monty_step(p[0], p_dash); 135| 59.6k| accum.mul(ws[0], p[6]); 136| 59.6k| accum.mul(ws[1], p[5]); 137| 59.6k| accum.mul(ws[2], p[4]); 138| 59.6k| accum.mul(ws[3], p[3]); 139| 59.6k| accum.mul(ws[4], p[2]); 140| 59.6k| accum.mul(ws[5], p[1]); 141| 59.6k| accum.add(z[6]); 142| 59.6k| ws[6] = accum.monty_step(p[0], p_dash); 143| 59.6k| accum.mul(ws[0], p[7]); 144| 59.6k| accum.mul(ws[1], p[6]); 145| 59.6k| accum.mul(ws[2], p[5]); 146| 59.6k| accum.mul(ws[3], p[4]); 147| 59.6k| accum.mul(ws[4], p[3]); 148| 59.6k| accum.mul(ws[5], p[2]); 149| 59.6k| accum.mul(ws[6], p[1]); 150| 59.6k| accum.add(z[7]); 151| 59.6k| ws[7] = accum.monty_step(p[0], p_dash); 152| 59.6k| accum.mul(ws[1], p[7]); 153| 59.6k| accum.mul(ws[2], p[6]); 154| 59.6k| accum.mul(ws[3], p[5]); 155| 59.6k| accum.mul(ws[4], p[4]); 156| 59.6k| accum.mul(ws[5], p[3]); 157| 59.6k| accum.mul(ws[6], p[2]); 158| 59.6k| accum.mul(ws[7], p[1]); 159| 59.6k| accum.add(z[8]); 160| 59.6k| ws[0] = accum.extract(); 161| 59.6k| accum.mul(ws[2], p[7]); 162| 59.6k| accum.mul(ws[3], p[6]); 163| 59.6k| accum.mul(ws[4], p[5]); 164| 59.6k| accum.mul(ws[5], p[4]); 165| 59.6k| accum.mul(ws[6], p[3]); 166| 59.6k| accum.mul(ws[7], p[2]); 167| 59.6k| accum.add(z[9]); 168| 59.6k| ws[1] = accum.extract(); 169| 59.6k| accum.mul(ws[3], p[7]); 170| 59.6k| accum.mul(ws[4], p[6]); 171| 59.6k| accum.mul(ws[5], p[5]); 172| 59.6k| accum.mul(ws[6], p[4]); 173| 59.6k| accum.mul(ws[7], p[3]); 174| 59.6k| accum.add(z[10]); 175| 59.6k| ws[2] = accum.extract(); 176| 59.6k| accum.mul(ws[4], p[7]); 177| 59.6k| accum.mul(ws[5], p[6]); 178| 59.6k| accum.mul(ws[6], p[5]); 179| 59.6k| accum.mul(ws[7], p[4]); 180| 59.6k| accum.add(z[11]); 181| 59.6k| ws[3] = accum.extract(); 182| 59.6k| accum.mul(ws[5], p[7]); 183| 59.6k| accum.mul(ws[6], p[6]); 184| 59.6k| accum.mul(ws[7], p[5]); 185| 59.6k| accum.add(z[12]); 186| 59.6k| ws[4] = accum.extract(); 187| 59.6k| accum.mul(ws[6], p[7]); 188| 59.6k| accum.mul(ws[7], p[6]); 189| 59.6k| accum.add(z[13]); 190| 59.6k| ws[5] = accum.extract(); 191| 59.6k| accum.mul(ws[7], p[7]); 192| 59.6k| accum.add(z[14]); 193| 59.6k| ws[6] = accum.extract(); 194| 59.6k| accum.add(z[15]); 195| 59.6k| ws[7] = accum.extract(); 196| 59.6k| const word w1 = accum.extract(); 197| 59.6k| bigint_monty_maybe_sub<8>(r, w1, ws, p); 198| 59.6k|} _ZN5Botan20bigint_monty_redc_16EPmPKmS2_mS0_: 386| 61|void bigint_monty_redc_16(word r[16], const word z[32], const word p[16], word p_dash, word ws[16]) { 387| 61| word3 accum; 388| 61| accum.add(z[0]); 389| 61| ws[0] = accum.monty_step(p[0], p_dash); 390| 61| accum.mul(ws[0], p[1]); 391| 61| accum.add(z[1]); 392| 61| ws[1] = accum.monty_step(p[0], p_dash); 393| 61| accum.mul(ws[0], p[2]); 394| 61| accum.mul(ws[1], p[1]); 395| 61| accum.add(z[2]); 396| 61| ws[2] = accum.monty_step(p[0], p_dash); 397| 61| accum.mul(ws[0], p[3]); 398| 61| accum.mul(ws[1], p[2]); 399| 61| accum.mul(ws[2], p[1]); 400| 61| accum.add(z[3]); 401| 61| ws[3] = accum.monty_step(p[0], p_dash); 402| 61| accum.mul(ws[0], p[4]); 403| 61| accum.mul(ws[1], p[3]); 404| 61| accum.mul(ws[2], p[2]); 405| 61| accum.mul(ws[3], p[1]); 406| 61| accum.add(z[4]); 407| 61| ws[4] = accum.monty_step(p[0], p_dash); 408| 61| accum.mul(ws[0], p[5]); 409| 61| accum.mul(ws[1], p[4]); 410| 61| accum.mul(ws[2], p[3]); 411| 61| accum.mul(ws[3], p[2]); 412| 61| accum.mul(ws[4], p[1]); 413| 61| accum.add(z[5]); 414| 61| ws[5] = accum.monty_step(p[0], p_dash); 415| 61| accum.mul(ws[0], p[6]); 416| 61| accum.mul(ws[1], p[5]); 417| 61| accum.mul(ws[2], p[4]); 418| 61| accum.mul(ws[3], p[3]); 419| 61| accum.mul(ws[4], p[2]); 420| 61| accum.mul(ws[5], p[1]); 421| 61| accum.add(z[6]); 422| 61| ws[6] = accum.monty_step(p[0], p_dash); 423| 61| accum.mul(ws[0], p[7]); 424| 61| accum.mul(ws[1], p[6]); 425| 61| accum.mul(ws[2], p[5]); 426| 61| accum.mul(ws[3], p[4]); 427| 61| accum.mul(ws[4], p[3]); 428| 61| accum.mul(ws[5], p[2]); 429| 61| accum.mul(ws[6], p[1]); 430| 61| accum.add(z[7]); 431| 61| ws[7] = accum.monty_step(p[0], p_dash); 432| 61| accum.mul(ws[0], p[8]); 433| 61| accum.mul(ws[1], p[7]); 434| 61| accum.mul(ws[2], p[6]); 435| 61| accum.mul(ws[3], p[5]); 436| 61| accum.mul(ws[4], p[4]); 437| 61| accum.mul(ws[5], p[3]); 438| 61| accum.mul(ws[6], p[2]); 439| 61| accum.mul(ws[7], p[1]); 440| 61| accum.add(z[8]); 441| 61| ws[8] = accum.monty_step(p[0], p_dash); 442| 61| accum.mul(ws[0], p[9]); 443| 61| accum.mul(ws[1], p[8]); 444| 61| accum.mul(ws[2], p[7]); 445| 61| accum.mul(ws[3], p[6]); 446| 61| accum.mul(ws[4], p[5]); 447| 61| accum.mul(ws[5], p[4]); 448| 61| accum.mul(ws[6], p[3]); 449| 61| accum.mul(ws[7], p[2]); 450| 61| accum.mul(ws[8], p[1]); 451| 61| accum.add(z[9]); 452| 61| ws[9] = accum.monty_step(p[0], p_dash); 453| 61| accum.mul(ws[0], p[10]); 454| 61| accum.mul(ws[1], p[9]); 455| 61| accum.mul(ws[2], p[8]); 456| 61| accum.mul(ws[3], p[7]); 457| 61| accum.mul(ws[4], p[6]); 458| 61| accum.mul(ws[5], p[5]); 459| 61| accum.mul(ws[6], p[4]); 460| 61| accum.mul(ws[7], p[3]); 461| 61| accum.mul(ws[8], p[2]); 462| 61| accum.mul(ws[9], p[1]); 463| 61| accum.add(z[10]); 464| 61| ws[10] = accum.monty_step(p[0], p_dash); 465| 61| accum.mul(ws[0], p[11]); 466| 61| accum.mul(ws[1], p[10]); 467| 61| accum.mul(ws[2], p[9]); 468| 61| accum.mul(ws[3], p[8]); 469| 61| accum.mul(ws[4], p[7]); 470| 61| accum.mul(ws[5], p[6]); 471| 61| accum.mul(ws[6], p[5]); 472| 61| accum.mul(ws[7], p[4]); 473| 61| accum.mul(ws[8], p[3]); 474| 61| accum.mul(ws[9], p[2]); 475| 61| accum.mul(ws[10], p[1]); 476| 61| accum.add(z[11]); 477| 61| ws[11] = accum.monty_step(p[0], p_dash); 478| 61| accum.mul(ws[0], p[12]); 479| 61| accum.mul(ws[1], p[11]); 480| 61| accum.mul(ws[2], p[10]); 481| 61| accum.mul(ws[3], p[9]); 482| 61| accum.mul(ws[4], p[8]); 483| 61| accum.mul(ws[5], p[7]); 484| 61| accum.mul(ws[6], p[6]); 485| 61| accum.mul(ws[7], p[5]); 486| 61| accum.mul(ws[8], p[4]); 487| 61| accum.mul(ws[9], p[3]); 488| 61| accum.mul(ws[10], p[2]); 489| 61| accum.mul(ws[11], p[1]); 490| 61| accum.add(z[12]); 491| 61| ws[12] = accum.monty_step(p[0], p_dash); 492| 61| accum.mul(ws[0], p[13]); 493| 61| accum.mul(ws[1], p[12]); 494| 61| accum.mul(ws[2], p[11]); 495| 61| accum.mul(ws[3], p[10]); 496| 61| accum.mul(ws[4], p[9]); 497| 61| accum.mul(ws[5], p[8]); 498| 61| accum.mul(ws[6], p[7]); 499| 61| accum.mul(ws[7], p[6]); 500| 61| accum.mul(ws[8], p[5]); 501| 61| accum.mul(ws[9], p[4]); 502| 61| accum.mul(ws[10], p[3]); 503| 61| accum.mul(ws[11], p[2]); 504| 61| accum.mul(ws[12], p[1]); 505| 61| accum.add(z[13]); 506| 61| ws[13] = accum.monty_step(p[0], p_dash); 507| 61| accum.mul(ws[0], p[14]); 508| 61| accum.mul(ws[1], p[13]); 509| 61| accum.mul(ws[2], p[12]); 510| 61| accum.mul(ws[3], p[11]); 511| 61| accum.mul(ws[4], p[10]); 512| 61| accum.mul(ws[5], p[9]); 513| 61| accum.mul(ws[6], p[8]); 514| 61| accum.mul(ws[7], p[7]); 515| 61| accum.mul(ws[8], p[6]); 516| 61| accum.mul(ws[9], p[5]); 517| 61| accum.mul(ws[10], p[4]); 518| 61| accum.mul(ws[11], p[3]); 519| 61| accum.mul(ws[12], p[2]); 520| 61| accum.mul(ws[13], p[1]); 521| 61| accum.add(z[14]); 522| 61| ws[14] = accum.monty_step(p[0], p_dash); 523| 61| accum.mul(ws[0], p[15]); 524| 61| accum.mul(ws[1], p[14]); 525| 61| accum.mul(ws[2], p[13]); 526| 61| accum.mul(ws[3], p[12]); 527| 61| accum.mul(ws[4], p[11]); 528| 61| accum.mul(ws[5], p[10]); 529| 61| accum.mul(ws[6], p[9]); 530| 61| accum.mul(ws[7], p[8]); 531| 61| accum.mul(ws[8], p[7]); 532| 61| accum.mul(ws[9], p[6]); 533| 61| accum.mul(ws[10], p[5]); 534| 61| accum.mul(ws[11], p[4]); 535| 61| accum.mul(ws[12], p[3]); 536| 61| accum.mul(ws[13], p[2]); 537| 61| accum.mul(ws[14], p[1]); 538| 61| accum.add(z[15]); 539| 61| ws[15] = accum.monty_step(p[0], p_dash); 540| 61| accum.mul(ws[1], p[15]); 541| 61| accum.mul(ws[2], p[14]); 542| 61| accum.mul(ws[3], p[13]); 543| 61| accum.mul(ws[4], p[12]); 544| 61| accum.mul(ws[5], p[11]); 545| 61| accum.mul(ws[6], p[10]); 546| 61| accum.mul(ws[7], p[9]); 547| 61| accum.mul(ws[8], p[8]); 548| 61| accum.mul(ws[9], p[7]); 549| 61| accum.mul(ws[10], p[6]); 550| 61| accum.mul(ws[11], p[5]); 551| 61| accum.mul(ws[12], p[4]); 552| 61| accum.mul(ws[13], p[3]); 553| 61| accum.mul(ws[14], p[2]); 554| 61| accum.mul(ws[15], p[1]); 555| 61| accum.add(z[16]); 556| 61| ws[0] = accum.extract(); 557| 61| accum.mul(ws[2], p[15]); 558| 61| accum.mul(ws[3], p[14]); 559| 61| accum.mul(ws[4], p[13]); 560| 61| accum.mul(ws[5], p[12]); 561| 61| accum.mul(ws[6], p[11]); 562| 61| accum.mul(ws[7], p[10]); 563| 61| accum.mul(ws[8], p[9]); 564| 61| accum.mul(ws[9], p[8]); 565| 61| accum.mul(ws[10], p[7]); 566| 61| accum.mul(ws[11], p[6]); 567| 61| accum.mul(ws[12], p[5]); 568| 61| accum.mul(ws[13], p[4]); 569| 61| accum.mul(ws[14], p[3]); 570| 61| accum.mul(ws[15], p[2]); 571| 61| accum.add(z[17]); 572| 61| ws[1] = accum.extract(); 573| 61| accum.mul(ws[3], p[15]); 574| 61| accum.mul(ws[4], p[14]); 575| 61| accum.mul(ws[5], p[13]); 576| 61| accum.mul(ws[6], p[12]); 577| 61| accum.mul(ws[7], p[11]); 578| 61| accum.mul(ws[8], p[10]); 579| 61| accum.mul(ws[9], p[9]); 580| 61| accum.mul(ws[10], p[8]); 581| 61| accum.mul(ws[11], p[7]); 582| 61| accum.mul(ws[12], p[6]); 583| 61| accum.mul(ws[13], p[5]); 584| 61| accum.mul(ws[14], p[4]); 585| 61| accum.mul(ws[15], p[3]); 586| 61| accum.add(z[18]); 587| 61| ws[2] = accum.extract(); 588| 61| accum.mul(ws[4], p[15]); 589| 61| accum.mul(ws[5], p[14]); 590| 61| accum.mul(ws[6], p[13]); 591| 61| accum.mul(ws[7], p[12]); 592| 61| accum.mul(ws[8], p[11]); 593| 61| accum.mul(ws[9], p[10]); 594| 61| accum.mul(ws[10], p[9]); 595| 61| accum.mul(ws[11], p[8]); 596| 61| accum.mul(ws[12], p[7]); 597| 61| accum.mul(ws[13], p[6]); 598| 61| accum.mul(ws[14], p[5]); 599| 61| accum.mul(ws[15], p[4]); 600| 61| accum.add(z[19]); 601| 61| ws[3] = accum.extract(); 602| 61| accum.mul(ws[5], p[15]); 603| 61| accum.mul(ws[6], p[14]); 604| 61| accum.mul(ws[7], p[13]); 605| 61| accum.mul(ws[8], p[12]); 606| 61| accum.mul(ws[9], p[11]); 607| 61| accum.mul(ws[10], p[10]); 608| 61| accum.mul(ws[11], p[9]); 609| 61| accum.mul(ws[12], p[8]); 610| 61| accum.mul(ws[13], p[7]); 611| 61| accum.mul(ws[14], p[6]); 612| 61| accum.mul(ws[15], p[5]); 613| 61| accum.add(z[20]); 614| 61| ws[4] = accum.extract(); 615| 61| accum.mul(ws[6], p[15]); 616| 61| accum.mul(ws[7], p[14]); 617| 61| accum.mul(ws[8], p[13]); 618| 61| accum.mul(ws[9], p[12]); 619| 61| accum.mul(ws[10], p[11]); 620| 61| accum.mul(ws[11], p[10]); 621| 61| accum.mul(ws[12], p[9]); 622| 61| accum.mul(ws[13], p[8]); 623| 61| accum.mul(ws[14], p[7]); 624| 61| accum.mul(ws[15], p[6]); 625| 61| accum.add(z[21]); 626| 61| ws[5] = accum.extract(); 627| 61| accum.mul(ws[7], p[15]); 628| 61| accum.mul(ws[8], p[14]); 629| 61| accum.mul(ws[9], p[13]); 630| 61| accum.mul(ws[10], p[12]); 631| 61| accum.mul(ws[11], p[11]); 632| 61| accum.mul(ws[12], p[10]); 633| 61| accum.mul(ws[13], p[9]); 634| 61| accum.mul(ws[14], p[8]); 635| 61| accum.mul(ws[15], p[7]); 636| 61| accum.add(z[22]); 637| 61| ws[6] = accum.extract(); 638| 61| accum.mul(ws[8], p[15]); 639| 61| accum.mul(ws[9], p[14]); 640| 61| accum.mul(ws[10], p[13]); 641| 61| accum.mul(ws[11], p[12]); 642| 61| accum.mul(ws[12], p[11]); 643| 61| accum.mul(ws[13], p[10]); 644| 61| accum.mul(ws[14], p[9]); 645| 61| accum.mul(ws[15], p[8]); 646| 61| accum.add(z[23]); 647| 61| ws[7] = accum.extract(); 648| 61| accum.mul(ws[9], p[15]); 649| 61| accum.mul(ws[10], p[14]); 650| 61| accum.mul(ws[11], p[13]); 651| 61| accum.mul(ws[12], p[12]); 652| 61| accum.mul(ws[13], p[11]); 653| 61| accum.mul(ws[14], p[10]); 654| 61| accum.mul(ws[15], p[9]); 655| 61| accum.add(z[24]); 656| 61| ws[8] = accum.extract(); 657| 61| accum.mul(ws[10], p[15]); 658| 61| accum.mul(ws[11], p[14]); 659| 61| accum.mul(ws[12], p[13]); 660| 61| accum.mul(ws[13], p[12]); 661| 61| accum.mul(ws[14], p[11]); 662| 61| accum.mul(ws[15], p[10]); 663| 61| accum.add(z[25]); 664| 61| ws[9] = accum.extract(); 665| 61| accum.mul(ws[11], p[15]); 666| 61| accum.mul(ws[12], p[14]); 667| 61| accum.mul(ws[13], p[13]); 668| 61| accum.mul(ws[14], p[12]); 669| 61| accum.mul(ws[15], p[11]); 670| 61| accum.add(z[26]); 671| 61| ws[10] = accum.extract(); 672| 61| accum.mul(ws[12], p[15]); 673| 61| accum.mul(ws[13], p[14]); 674| 61| accum.mul(ws[14], p[13]); 675| 61| accum.mul(ws[15], p[12]); 676| 61| accum.add(z[27]); 677| 61| ws[11] = accum.extract(); 678| 61| accum.mul(ws[13], p[15]); 679| 61| accum.mul(ws[14], p[14]); 680| 61| accum.mul(ws[15], p[13]); 681| 61| accum.add(z[28]); 682| 61| ws[12] = accum.extract(); 683| 61| accum.mul(ws[14], p[15]); 684| 61| accum.mul(ws[15], p[14]); 685| 61| accum.add(z[29]); 686| 61| ws[13] = accum.extract(); 687| 61| accum.mul(ws[15], p[15]); 688| 61| accum.add(z[30]); 689| 61| ws[14] = accum.extract(); 690| 61| accum.add(z[31]); 691| 61| ws[15] = accum.extract(); 692| 61| const word w1 = accum.extract(); 693| 61| bigint_monty_maybe_sub<16>(r, w1, ws, p); 694| 61|} _ZN5Botan20bigint_monty_redc_32EPmPKmS2_mS0_: 1350| 14|void bigint_monty_redc_32(word r[32], const word z[64], const word p[32], word p_dash, word ws[32]) { 1351| 14| word3 accum; 1352| 14| accum.add(z[0]); 1353| 14| ws[0] = accum.monty_step(p[0], p_dash); 1354| 14| accum.mul(ws[0], p[1]); 1355| 14| accum.add(z[1]); 1356| 14| ws[1] = accum.monty_step(p[0], p_dash); 1357| 14| accum.mul(ws[0], p[2]); 1358| 14| accum.mul(ws[1], p[1]); 1359| 14| accum.add(z[2]); 1360| 14| ws[2] = accum.monty_step(p[0], p_dash); 1361| 14| accum.mul(ws[0], p[3]); 1362| 14| accum.mul(ws[1], p[2]); 1363| 14| accum.mul(ws[2], p[1]); 1364| 14| accum.add(z[3]); 1365| 14| ws[3] = accum.monty_step(p[0], p_dash); 1366| 14| accum.mul(ws[0], p[4]); 1367| 14| accum.mul(ws[1], p[3]); 1368| 14| accum.mul(ws[2], p[2]); 1369| 14| accum.mul(ws[3], p[1]); 1370| 14| accum.add(z[4]); 1371| 14| ws[4] = accum.monty_step(p[0], p_dash); 1372| 14| accum.mul(ws[0], p[5]); 1373| 14| accum.mul(ws[1], p[4]); 1374| 14| accum.mul(ws[2], p[3]); 1375| 14| accum.mul(ws[3], p[2]); 1376| 14| accum.mul(ws[4], p[1]); 1377| 14| accum.add(z[5]); 1378| 14| ws[5] = accum.monty_step(p[0], p_dash); 1379| 14| accum.mul(ws[0], p[6]); 1380| 14| accum.mul(ws[1], p[5]); 1381| 14| accum.mul(ws[2], p[4]); 1382| 14| accum.mul(ws[3], p[3]); 1383| 14| accum.mul(ws[4], p[2]); 1384| 14| accum.mul(ws[5], p[1]); 1385| 14| accum.add(z[6]); 1386| 14| ws[6] = accum.monty_step(p[0], p_dash); 1387| 14| accum.mul(ws[0], p[7]); 1388| 14| accum.mul(ws[1], p[6]); 1389| 14| accum.mul(ws[2], p[5]); 1390| 14| accum.mul(ws[3], p[4]); 1391| 14| accum.mul(ws[4], p[3]); 1392| 14| accum.mul(ws[5], p[2]); 1393| 14| accum.mul(ws[6], p[1]); 1394| 14| accum.add(z[7]); 1395| 14| ws[7] = accum.monty_step(p[0], p_dash); 1396| 14| accum.mul(ws[0], p[8]); 1397| 14| accum.mul(ws[1], p[7]); 1398| 14| accum.mul(ws[2], p[6]); 1399| 14| accum.mul(ws[3], p[5]); 1400| 14| accum.mul(ws[4], p[4]); 1401| 14| accum.mul(ws[5], p[3]); 1402| 14| accum.mul(ws[6], p[2]); 1403| 14| accum.mul(ws[7], p[1]); 1404| 14| accum.add(z[8]); 1405| 14| ws[8] = accum.monty_step(p[0], p_dash); 1406| 14| accum.mul(ws[0], p[9]); 1407| 14| accum.mul(ws[1], p[8]); 1408| 14| accum.mul(ws[2], p[7]); 1409| 14| accum.mul(ws[3], p[6]); 1410| 14| accum.mul(ws[4], p[5]); 1411| 14| accum.mul(ws[5], p[4]); 1412| 14| accum.mul(ws[6], p[3]); 1413| 14| accum.mul(ws[7], p[2]); 1414| 14| accum.mul(ws[8], p[1]); 1415| 14| accum.add(z[9]); 1416| 14| ws[9] = accum.monty_step(p[0], p_dash); 1417| 14| accum.mul(ws[0], p[10]); 1418| 14| accum.mul(ws[1], p[9]); 1419| 14| accum.mul(ws[2], p[8]); 1420| 14| accum.mul(ws[3], p[7]); 1421| 14| accum.mul(ws[4], p[6]); 1422| 14| accum.mul(ws[5], p[5]); 1423| 14| accum.mul(ws[6], p[4]); 1424| 14| accum.mul(ws[7], p[3]); 1425| 14| accum.mul(ws[8], p[2]); 1426| 14| accum.mul(ws[9], p[1]); 1427| 14| accum.add(z[10]); 1428| 14| ws[10] = accum.monty_step(p[0], p_dash); 1429| 14| accum.mul(ws[0], p[11]); 1430| 14| accum.mul(ws[1], p[10]); 1431| 14| accum.mul(ws[2], p[9]); 1432| 14| accum.mul(ws[3], p[8]); 1433| 14| accum.mul(ws[4], p[7]); 1434| 14| accum.mul(ws[5], p[6]); 1435| 14| accum.mul(ws[6], p[5]); 1436| 14| accum.mul(ws[7], p[4]); 1437| 14| accum.mul(ws[8], p[3]); 1438| 14| accum.mul(ws[9], p[2]); 1439| 14| accum.mul(ws[10], p[1]); 1440| 14| accum.add(z[11]); 1441| 14| ws[11] = accum.monty_step(p[0], p_dash); 1442| 14| accum.mul(ws[0], p[12]); 1443| 14| accum.mul(ws[1], p[11]); 1444| 14| accum.mul(ws[2], p[10]); 1445| 14| accum.mul(ws[3], p[9]); 1446| 14| accum.mul(ws[4], p[8]); 1447| 14| accum.mul(ws[5], p[7]); 1448| 14| accum.mul(ws[6], p[6]); 1449| 14| accum.mul(ws[7], p[5]); 1450| 14| accum.mul(ws[8], p[4]); 1451| 14| accum.mul(ws[9], p[3]); 1452| 14| accum.mul(ws[10], p[2]); 1453| 14| accum.mul(ws[11], p[1]); 1454| 14| accum.add(z[12]); 1455| 14| ws[12] = accum.monty_step(p[0], p_dash); 1456| 14| accum.mul(ws[0], p[13]); 1457| 14| accum.mul(ws[1], p[12]); 1458| 14| accum.mul(ws[2], p[11]); 1459| 14| accum.mul(ws[3], p[10]); 1460| 14| accum.mul(ws[4], p[9]); 1461| 14| accum.mul(ws[5], p[8]); 1462| 14| accum.mul(ws[6], p[7]); 1463| 14| accum.mul(ws[7], p[6]); 1464| 14| accum.mul(ws[8], p[5]); 1465| 14| accum.mul(ws[9], p[4]); 1466| 14| accum.mul(ws[10], p[3]); 1467| 14| accum.mul(ws[11], p[2]); 1468| 14| accum.mul(ws[12], p[1]); 1469| 14| accum.add(z[13]); 1470| 14| ws[13] = accum.monty_step(p[0], p_dash); 1471| 14| accum.mul(ws[0], p[14]); 1472| 14| accum.mul(ws[1], p[13]); 1473| 14| accum.mul(ws[2], p[12]); 1474| 14| accum.mul(ws[3], p[11]); 1475| 14| accum.mul(ws[4], p[10]); 1476| 14| accum.mul(ws[5], p[9]); 1477| 14| accum.mul(ws[6], p[8]); 1478| 14| accum.mul(ws[7], p[7]); 1479| 14| accum.mul(ws[8], p[6]); 1480| 14| accum.mul(ws[9], p[5]); 1481| 14| accum.mul(ws[10], p[4]); 1482| 14| accum.mul(ws[11], p[3]); 1483| 14| accum.mul(ws[12], p[2]); 1484| 14| accum.mul(ws[13], p[1]); 1485| 14| accum.add(z[14]); 1486| 14| ws[14] = accum.monty_step(p[0], p_dash); 1487| 14| accum.mul(ws[0], p[15]); 1488| 14| accum.mul(ws[1], p[14]); 1489| 14| accum.mul(ws[2], p[13]); 1490| 14| accum.mul(ws[3], p[12]); 1491| 14| accum.mul(ws[4], p[11]); 1492| 14| accum.mul(ws[5], p[10]); 1493| 14| accum.mul(ws[6], p[9]); 1494| 14| accum.mul(ws[7], p[8]); 1495| 14| accum.mul(ws[8], p[7]); 1496| 14| accum.mul(ws[9], p[6]); 1497| 14| accum.mul(ws[10], p[5]); 1498| 14| accum.mul(ws[11], p[4]); 1499| 14| accum.mul(ws[12], p[3]); 1500| 14| accum.mul(ws[13], p[2]); 1501| 14| accum.mul(ws[14], p[1]); 1502| 14| accum.add(z[15]); 1503| 14| ws[15] = accum.monty_step(p[0], p_dash); 1504| 14| accum.mul(ws[0], p[16]); 1505| 14| accum.mul(ws[1], p[15]); 1506| 14| accum.mul(ws[2], p[14]); 1507| 14| accum.mul(ws[3], p[13]); 1508| 14| accum.mul(ws[4], p[12]); 1509| 14| accum.mul(ws[5], p[11]); 1510| 14| accum.mul(ws[6], p[10]); 1511| 14| accum.mul(ws[7], p[9]); 1512| 14| accum.mul(ws[8], p[8]); 1513| 14| accum.mul(ws[9], p[7]); 1514| 14| accum.mul(ws[10], p[6]); 1515| 14| accum.mul(ws[11], p[5]); 1516| 14| accum.mul(ws[12], p[4]); 1517| 14| accum.mul(ws[13], p[3]); 1518| 14| accum.mul(ws[14], p[2]); 1519| 14| accum.mul(ws[15], p[1]); 1520| 14| accum.add(z[16]); 1521| 14| ws[16] = accum.monty_step(p[0], p_dash); 1522| 14| accum.mul(ws[0], p[17]); 1523| 14| accum.mul(ws[1], p[16]); 1524| 14| accum.mul(ws[2], p[15]); 1525| 14| accum.mul(ws[3], p[14]); 1526| 14| accum.mul(ws[4], p[13]); 1527| 14| accum.mul(ws[5], p[12]); 1528| 14| accum.mul(ws[6], p[11]); 1529| 14| accum.mul(ws[7], p[10]); 1530| 14| accum.mul(ws[8], p[9]); 1531| 14| accum.mul(ws[9], p[8]); 1532| 14| accum.mul(ws[10], p[7]); 1533| 14| accum.mul(ws[11], p[6]); 1534| 14| accum.mul(ws[12], p[5]); 1535| 14| accum.mul(ws[13], p[4]); 1536| 14| accum.mul(ws[14], p[3]); 1537| 14| accum.mul(ws[15], p[2]); 1538| 14| accum.mul(ws[16], p[1]); 1539| 14| accum.add(z[17]); 1540| 14| ws[17] = accum.monty_step(p[0], p_dash); 1541| 14| accum.mul(ws[0], p[18]); 1542| 14| accum.mul(ws[1], p[17]); 1543| 14| accum.mul(ws[2], p[16]); 1544| 14| accum.mul(ws[3], p[15]); 1545| 14| accum.mul(ws[4], p[14]); 1546| 14| accum.mul(ws[5], p[13]); 1547| 14| accum.mul(ws[6], p[12]); 1548| 14| accum.mul(ws[7], p[11]); 1549| 14| accum.mul(ws[8], p[10]); 1550| 14| accum.mul(ws[9], p[9]); 1551| 14| accum.mul(ws[10], p[8]); 1552| 14| accum.mul(ws[11], p[7]); 1553| 14| accum.mul(ws[12], p[6]); 1554| 14| accum.mul(ws[13], p[5]); 1555| 14| accum.mul(ws[14], p[4]); 1556| 14| accum.mul(ws[15], p[3]); 1557| 14| accum.mul(ws[16], p[2]); 1558| 14| accum.mul(ws[17], p[1]); 1559| 14| accum.add(z[18]); 1560| 14| ws[18] = accum.monty_step(p[0], p_dash); 1561| 14| accum.mul(ws[0], p[19]); 1562| 14| accum.mul(ws[1], p[18]); 1563| 14| accum.mul(ws[2], p[17]); 1564| 14| accum.mul(ws[3], p[16]); 1565| 14| accum.mul(ws[4], p[15]); 1566| 14| accum.mul(ws[5], p[14]); 1567| 14| accum.mul(ws[6], p[13]); 1568| 14| accum.mul(ws[7], p[12]); 1569| 14| accum.mul(ws[8], p[11]); 1570| 14| accum.mul(ws[9], p[10]); 1571| 14| accum.mul(ws[10], p[9]); 1572| 14| accum.mul(ws[11], p[8]); 1573| 14| accum.mul(ws[12], p[7]); 1574| 14| accum.mul(ws[13], p[6]); 1575| 14| accum.mul(ws[14], p[5]); 1576| 14| accum.mul(ws[15], p[4]); 1577| 14| accum.mul(ws[16], p[3]); 1578| 14| accum.mul(ws[17], p[2]); 1579| 14| accum.mul(ws[18], p[1]); 1580| 14| accum.add(z[19]); 1581| 14| ws[19] = accum.monty_step(p[0], p_dash); 1582| 14| accum.mul(ws[0], p[20]); 1583| 14| accum.mul(ws[1], p[19]); 1584| 14| accum.mul(ws[2], p[18]); 1585| 14| accum.mul(ws[3], p[17]); 1586| 14| accum.mul(ws[4], p[16]); 1587| 14| accum.mul(ws[5], p[15]); 1588| 14| accum.mul(ws[6], p[14]); 1589| 14| accum.mul(ws[7], p[13]); 1590| 14| accum.mul(ws[8], p[12]); 1591| 14| accum.mul(ws[9], p[11]); 1592| 14| accum.mul(ws[10], p[10]); 1593| 14| accum.mul(ws[11], p[9]); 1594| 14| accum.mul(ws[12], p[8]); 1595| 14| accum.mul(ws[13], p[7]); 1596| 14| accum.mul(ws[14], p[6]); 1597| 14| accum.mul(ws[15], p[5]); 1598| 14| accum.mul(ws[16], p[4]); 1599| 14| accum.mul(ws[17], p[3]); 1600| 14| accum.mul(ws[18], p[2]); 1601| 14| accum.mul(ws[19], p[1]); 1602| 14| accum.add(z[20]); 1603| 14| ws[20] = accum.monty_step(p[0], p_dash); 1604| 14| accum.mul(ws[0], p[21]); 1605| 14| accum.mul(ws[1], p[20]); 1606| 14| accum.mul(ws[2], p[19]); 1607| 14| accum.mul(ws[3], p[18]); 1608| 14| accum.mul(ws[4], p[17]); 1609| 14| accum.mul(ws[5], p[16]); 1610| 14| accum.mul(ws[6], p[15]); 1611| 14| accum.mul(ws[7], p[14]); 1612| 14| accum.mul(ws[8], p[13]); 1613| 14| accum.mul(ws[9], p[12]); 1614| 14| accum.mul(ws[10], p[11]); 1615| 14| accum.mul(ws[11], p[10]); 1616| 14| accum.mul(ws[12], p[9]); 1617| 14| accum.mul(ws[13], p[8]); 1618| 14| accum.mul(ws[14], p[7]); 1619| 14| accum.mul(ws[15], p[6]); 1620| 14| accum.mul(ws[16], p[5]); 1621| 14| accum.mul(ws[17], p[4]); 1622| 14| accum.mul(ws[18], p[3]); 1623| 14| accum.mul(ws[19], p[2]); 1624| 14| accum.mul(ws[20], p[1]); 1625| 14| accum.add(z[21]); 1626| 14| ws[21] = accum.monty_step(p[0], p_dash); 1627| 14| accum.mul(ws[0], p[22]); 1628| 14| accum.mul(ws[1], p[21]); 1629| 14| accum.mul(ws[2], p[20]); 1630| 14| accum.mul(ws[3], p[19]); 1631| 14| accum.mul(ws[4], p[18]); 1632| 14| accum.mul(ws[5], p[17]); 1633| 14| accum.mul(ws[6], p[16]); 1634| 14| accum.mul(ws[7], p[15]); 1635| 14| accum.mul(ws[8], p[14]); 1636| 14| accum.mul(ws[9], p[13]); 1637| 14| accum.mul(ws[10], p[12]); 1638| 14| accum.mul(ws[11], p[11]); 1639| 14| accum.mul(ws[12], p[10]); 1640| 14| accum.mul(ws[13], p[9]); 1641| 14| accum.mul(ws[14], p[8]); 1642| 14| accum.mul(ws[15], p[7]); 1643| 14| accum.mul(ws[16], p[6]); 1644| 14| accum.mul(ws[17], p[5]); 1645| 14| accum.mul(ws[18], p[4]); 1646| 14| accum.mul(ws[19], p[3]); 1647| 14| accum.mul(ws[20], p[2]); 1648| 14| accum.mul(ws[21], p[1]); 1649| 14| accum.add(z[22]); 1650| 14| ws[22] = accum.monty_step(p[0], p_dash); 1651| 14| accum.mul(ws[0], p[23]); 1652| 14| accum.mul(ws[1], p[22]); 1653| 14| accum.mul(ws[2], p[21]); 1654| 14| accum.mul(ws[3], p[20]); 1655| 14| accum.mul(ws[4], p[19]); 1656| 14| accum.mul(ws[5], p[18]); 1657| 14| accum.mul(ws[6], p[17]); 1658| 14| accum.mul(ws[7], p[16]); 1659| 14| accum.mul(ws[8], p[15]); 1660| 14| accum.mul(ws[9], p[14]); 1661| 14| accum.mul(ws[10], p[13]); 1662| 14| accum.mul(ws[11], p[12]); 1663| 14| accum.mul(ws[12], p[11]); 1664| 14| accum.mul(ws[13], p[10]); 1665| 14| accum.mul(ws[14], p[9]); 1666| 14| accum.mul(ws[15], p[8]); 1667| 14| accum.mul(ws[16], p[7]); 1668| 14| accum.mul(ws[17], p[6]); 1669| 14| accum.mul(ws[18], p[5]); 1670| 14| accum.mul(ws[19], p[4]); 1671| 14| accum.mul(ws[20], p[3]); 1672| 14| accum.mul(ws[21], p[2]); 1673| 14| accum.mul(ws[22], p[1]); 1674| 14| accum.add(z[23]); 1675| 14| ws[23] = accum.monty_step(p[0], p_dash); 1676| 14| accum.mul(ws[0], p[24]); 1677| 14| accum.mul(ws[1], p[23]); 1678| 14| accum.mul(ws[2], p[22]); 1679| 14| accum.mul(ws[3], p[21]); 1680| 14| accum.mul(ws[4], p[20]); 1681| 14| accum.mul(ws[5], p[19]); 1682| 14| accum.mul(ws[6], p[18]); 1683| 14| accum.mul(ws[7], p[17]); 1684| 14| accum.mul(ws[8], p[16]); 1685| 14| accum.mul(ws[9], p[15]); 1686| 14| accum.mul(ws[10], p[14]); 1687| 14| accum.mul(ws[11], p[13]); 1688| 14| accum.mul(ws[12], p[12]); 1689| 14| accum.mul(ws[13], p[11]); 1690| 14| accum.mul(ws[14], p[10]); 1691| 14| accum.mul(ws[15], p[9]); 1692| 14| accum.mul(ws[16], p[8]); 1693| 14| accum.mul(ws[17], p[7]); 1694| 14| accum.mul(ws[18], p[6]); 1695| 14| accum.mul(ws[19], p[5]); 1696| 14| accum.mul(ws[20], p[4]); 1697| 14| accum.mul(ws[21], p[3]); 1698| 14| accum.mul(ws[22], p[2]); 1699| 14| accum.mul(ws[23], p[1]); 1700| 14| accum.add(z[24]); 1701| 14| ws[24] = accum.monty_step(p[0], p_dash); 1702| 14| accum.mul(ws[0], p[25]); 1703| 14| accum.mul(ws[1], p[24]); 1704| 14| accum.mul(ws[2], p[23]); 1705| 14| accum.mul(ws[3], p[22]); 1706| 14| accum.mul(ws[4], p[21]); 1707| 14| accum.mul(ws[5], p[20]); 1708| 14| accum.mul(ws[6], p[19]); 1709| 14| accum.mul(ws[7], p[18]); 1710| 14| accum.mul(ws[8], p[17]); 1711| 14| accum.mul(ws[9], p[16]); 1712| 14| accum.mul(ws[10], p[15]); 1713| 14| accum.mul(ws[11], p[14]); 1714| 14| accum.mul(ws[12], p[13]); 1715| 14| accum.mul(ws[13], p[12]); 1716| 14| accum.mul(ws[14], p[11]); 1717| 14| accum.mul(ws[15], p[10]); 1718| 14| accum.mul(ws[16], p[9]); 1719| 14| accum.mul(ws[17], p[8]); 1720| 14| accum.mul(ws[18], p[7]); 1721| 14| accum.mul(ws[19], p[6]); 1722| 14| accum.mul(ws[20], p[5]); 1723| 14| accum.mul(ws[21], p[4]); 1724| 14| accum.mul(ws[22], p[3]); 1725| 14| accum.mul(ws[23], p[2]); 1726| 14| accum.mul(ws[24], p[1]); 1727| 14| accum.add(z[25]); 1728| 14| ws[25] = accum.monty_step(p[0], p_dash); 1729| 14| accum.mul(ws[0], p[26]); 1730| 14| accum.mul(ws[1], p[25]); 1731| 14| accum.mul(ws[2], p[24]); 1732| 14| accum.mul(ws[3], p[23]); 1733| 14| accum.mul(ws[4], p[22]); 1734| 14| accum.mul(ws[5], p[21]); 1735| 14| accum.mul(ws[6], p[20]); 1736| 14| accum.mul(ws[7], p[19]); 1737| 14| accum.mul(ws[8], p[18]); 1738| 14| accum.mul(ws[9], p[17]); 1739| 14| accum.mul(ws[10], p[16]); 1740| 14| accum.mul(ws[11], p[15]); 1741| 14| accum.mul(ws[12], p[14]); 1742| 14| accum.mul(ws[13], p[13]); 1743| 14| accum.mul(ws[14], p[12]); 1744| 14| accum.mul(ws[15], p[11]); 1745| 14| accum.mul(ws[16], p[10]); 1746| 14| accum.mul(ws[17], p[9]); 1747| 14| accum.mul(ws[18], p[8]); 1748| 14| accum.mul(ws[19], p[7]); 1749| 14| accum.mul(ws[20], p[6]); 1750| 14| accum.mul(ws[21], p[5]); 1751| 14| accum.mul(ws[22], p[4]); 1752| 14| accum.mul(ws[23], p[3]); 1753| 14| accum.mul(ws[24], p[2]); 1754| 14| accum.mul(ws[25], p[1]); 1755| 14| accum.add(z[26]); 1756| 14| ws[26] = accum.monty_step(p[0], p_dash); 1757| 14| accum.mul(ws[0], p[27]); 1758| 14| accum.mul(ws[1], p[26]); 1759| 14| accum.mul(ws[2], p[25]); 1760| 14| accum.mul(ws[3], p[24]); 1761| 14| accum.mul(ws[4], p[23]); 1762| 14| accum.mul(ws[5], p[22]); 1763| 14| accum.mul(ws[6], p[21]); 1764| 14| accum.mul(ws[7], p[20]); 1765| 14| accum.mul(ws[8], p[19]); 1766| 14| accum.mul(ws[9], p[18]); 1767| 14| accum.mul(ws[10], p[17]); 1768| 14| accum.mul(ws[11], p[16]); 1769| 14| accum.mul(ws[12], p[15]); 1770| 14| accum.mul(ws[13], p[14]); 1771| 14| accum.mul(ws[14], p[13]); 1772| 14| accum.mul(ws[15], p[12]); 1773| 14| accum.mul(ws[16], p[11]); 1774| 14| accum.mul(ws[17], p[10]); 1775| 14| accum.mul(ws[18], p[9]); 1776| 14| accum.mul(ws[19], p[8]); 1777| 14| accum.mul(ws[20], p[7]); 1778| 14| accum.mul(ws[21], p[6]); 1779| 14| accum.mul(ws[22], p[5]); 1780| 14| accum.mul(ws[23], p[4]); 1781| 14| accum.mul(ws[24], p[3]); 1782| 14| accum.mul(ws[25], p[2]); 1783| 14| accum.mul(ws[26], p[1]); 1784| 14| accum.add(z[27]); 1785| 14| ws[27] = accum.monty_step(p[0], p_dash); 1786| 14| accum.mul(ws[0], p[28]); 1787| 14| accum.mul(ws[1], p[27]); 1788| 14| accum.mul(ws[2], p[26]); 1789| 14| accum.mul(ws[3], p[25]); 1790| 14| accum.mul(ws[4], p[24]); 1791| 14| accum.mul(ws[5], p[23]); 1792| 14| accum.mul(ws[6], p[22]); 1793| 14| accum.mul(ws[7], p[21]); 1794| 14| accum.mul(ws[8], p[20]); 1795| 14| accum.mul(ws[9], p[19]); 1796| 14| accum.mul(ws[10], p[18]); 1797| 14| accum.mul(ws[11], p[17]); 1798| 14| accum.mul(ws[12], p[16]); 1799| 14| accum.mul(ws[13], p[15]); 1800| 14| accum.mul(ws[14], p[14]); 1801| 14| accum.mul(ws[15], p[13]); 1802| 14| accum.mul(ws[16], p[12]); 1803| 14| accum.mul(ws[17], p[11]); 1804| 14| accum.mul(ws[18], p[10]); 1805| 14| accum.mul(ws[19], p[9]); 1806| 14| accum.mul(ws[20], p[8]); 1807| 14| accum.mul(ws[21], p[7]); 1808| 14| accum.mul(ws[22], p[6]); 1809| 14| accum.mul(ws[23], p[5]); 1810| 14| accum.mul(ws[24], p[4]); 1811| 14| accum.mul(ws[25], p[3]); 1812| 14| accum.mul(ws[26], p[2]); 1813| 14| accum.mul(ws[27], p[1]); 1814| 14| accum.add(z[28]); 1815| 14| ws[28] = accum.monty_step(p[0], p_dash); 1816| 14| accum.mul(ws[0], p[29]); 1817| 14| accum.mul(ws[1], p[28]); 1818| 14| accum.mul(ws[2], p[27]); 1819| 14| accum.mul(ws[3], p[26]); 1820| 14| accum.mul(ws[4], p[25]); 1821| 14| accum.mul(ws[5], p[24]); 1822| 14| accum.mul(ws[6], p[23]); 1823| 14| accum.mul(ws[7], p[22]); 1824| 14| accum.mul(ws[8], p[21]); 1825| 14| accum.mul(ws[9], p[20]); 1826| 14| accum.mul(ws[10], p[19]); 1827| 14| accum.mul(ws[11], p[18]); 1828| 14| accum.mul(ws[12], p[17]); 1829| 14| accum.mul(ws[13], p[16]); 1830| 14| accum.mul(ws[14], p[15]); 1831| 14| accum.mul(ws[15], p[14]); 1832| 14| accum.mul(ws[16], p[13]); 1833| 14| accum.mul(ws[17], p[12]); 1834| 14| accum.mul(ws[18], p[11]); 1835| 14| accum.mul(ws[19], p[10]); 1836| 14| accum.mul(ws[20], p[9]); 1837| 14| accum.mul(ws[21], p[8]); 1838| 14| accum.mul(ws[22], p[7]); 1839| 14| accum.mul(ws[23], p[6]); 1840| 14| accum.mul(ws[24], p[5]); 1841| 14| accum.mul(ws[25], p[4]); 1842| 14| accum.mul(ws[26], p[3]); 1843| 14| accum.mul(ws[27], p[2]); 1844| 14| accum.mul(ws[28], p[1]); 1845| 14| accum.add(z[29]); 1846| 14| ws[29] = accum.monty_step(p[0], p_dash); 1847| 14| accum.mul(ws[0], p[30]); 1848| 14| accum.mul(ws[1], p[29]); 1849| 14| accum.mul(ws[2], p[28]); 1850| 14| accum.mul(ws[3], p[27]); 1851| 14| accum.mul(ws[4], p[26]); 1852| 14| accum.mul(ws[5], p[25]); 1853| 14| accum.mul(ws[6], p[24]); 1854| 14| accum.mul(ws[7], p[23]); 1855| 14| accum.mul(ws[8], p[22]); 1856| 14| accum.mul(ws[9], p[21]); 1857| 14| accum.mul(ws[10], p[20]); 1858| 14| accum.mul(ws[11], p[19]); 1859| 14| accum.mul(ws[12], p[18]); 1860| 14| accum.mul(ws[13], p[17]); 1861| 14| accum.mul(ws[14], p[16]); 1862| 14| accum.mul(ws[15], p[15]); 1863| 14| accum.mul(ws[16], p[14]); 1864| 14| accum.mul(ws[17], p[13]); 1865| 14| accum.mul(ws[18], p[12]); 1866| 14| accum.mul(ws[19], p[11]); 1867| 14| accum.mul(ws[20], p[10]); 1868| 14| accum.mul(ws[21], p[9]); 1869| 14| accum.mul(ws[22], p[8]); 1870| 14| accum.mul(ws[23], p[7]); 1871| 14| accum.mul(ws[24], p[6]); 1872| 14| accum.mul(ws[25], p[5]); 1873| 14| accum.mul(ws[26], p[4]); 1874| 14| accum.mul(ws[27], p[3]); 1875| 14| accum.mul(ws[28], p[2]); 1876| 14| accum.mul(ws[29], p[1]); 1877| 14| accum.add(z[30]); 1878| 14| ws[30] = accum.monty_step(p[0], p_dash); 1879| 14| accum.mul(ws[0], p[31]); 1880| 14| accum.mul(ws[1], p[30]); 1881| 14| accum.mul(ws[2], p[29]); 1882| 14| accum.mul(ws[3], p[28]); 1883| 14| accum.mul(ws[4], p[27]); 1884| 14| accum.mul(ws[5], p[26]); 1885| 14| accum.mul(ws[6], p[25]); 1886| 14| accum.mul(ws[7], p[24]); 1887| 14| accum.mul(ws[8], p[23]); 1888| 14| accum.mul(ws[9], p[22]); 1889| 14| accum.mul(ws[10], p[21]); 1890| 14| accum.mul(ws[11], p[20]); 1891| 14| accum.mul(ws[12], p[19]); 1892| 14| accum.mul(ws[13], p[18]); 1893| 14| accum.mul(ws[14], p[17]); 1894| 14| accum.mul(ws[15], p[16]); 1895| 14| accum.mul(ws[16], p[15]); 1896| 14| accum.mul(ws[17], p[14]); 1897| 14| accum.mul(ws[18], p[13]); 1898| 14| accum.mul(ws[19], p[12]); 1899| 14| accum.mul(ws[20], p[11]); 1900| 14| accum.mul(ws[21], p[10]); 1901| 14| accum.mul(ws[22], p[9]); 1902| 14| accum.mul(ws[23], p[8]); 1903| 14| accum.mul(ws[24], p[7]); 1904| 14| accum.mul(ws[25], p[6]); 1905| 14| accum.mul(ws[26], p[5]); 1906| 14| accum.mul(ws[27], p[4]); 1907| 14| accum.mul(ws[28], p[3]); 1908| 14| accum.mul(ws[29], p[2]); 1909| 14| accum.mul(ws[30], p[1]); 1910| 14| accum.add(z[31]); 1911| 14| ws[31] = accum.monty_step(p[0], p_dash); 1912| 14| accum.mul(ws[1], p[31]); 1913| 14| accum.mul(ws[2], p[30]); 1914| 14| accum.mul(ws[3], p[29]); 1915| 14| accum.mul(ws[4], p[28]); 1916| 14| accum.mul(ws[5], p[27]); 1917| 14| accum.mul(ws[6], p[26]); 1918| 14| accum.mul(ws[7], p[25]); 1919| 14| accum.mul(ws[8], p[24]); 1920| 14| accum.mul(ws[9], p[23]); 1921| 14| accum.mul(ws[10], p[22]); 1922| 14| accum.mul(ws[11], p[21]); 1923| 14| accum.mul(ws[12], p[20]); 1924| 14| accum.mul(ws[13], p[19]); 1925| 14| accum.mul(ws[14], p[18]); 1926| 14| accum.mul(ws[15], p[17]); 1927| 14| accum.mul(ws[16], p[16]); 1928| 14| accum.mul(ws[17], p[15]); 1929| 14| accum.mul(ws[18], p[14]); 1930| 14| accum.mul(ws[19], p[13]); 1931| 14| accum.mul(ws[20], p[12]); 1932| 14| accum.mul(ws[21], p[11]); 1933| 14| accum.mul(ws[22], p[10]); 1934| 14| accum.mul(ws[23], p[9]); 1935| 14| accum.mul(ws[24], p[8]); 1936| 14| accum.mul(ws[25], p[7]); 1937| 14| accum.mul(ws[26], p[6]); 1938| 14| accum.mul(ws[27], p[5]); 1939| 14| accum.mul(ws[28], p[4]); 1940| 14| accum.mul(ws[29], p[3]); 1941| 14| accum.mul(ws[30], p[2]); 1942| 14| accum.mul(ws[31], p[1]); 1943| 14| accum.add(z[32]); 1944| 14| ws[0] = accum.extract(); 1945| 14| accum.mul(ws[2], p[31]); 1946| 14| accum.mul(ws[3], p[30]); 1947| 14| accum.mul(ws[4], p[29]); 1948| 14| accum.mul(ws[5], p[28]); 1949| 14| accum.mul(ws[6], p[27]); 1950| 14| accum.mul(ws[7], p[26]); 1951| 14| accum.mul(ws[8], p[25]); 1952| 14| accum.mul(ws[9], p[24]); 1953| 14| accum.mul(ws[10], p[23]); 1954| 14| accum.mul(ws[11], p[22]); 1955| 14| accum.mul(ws[12], p[21]); 1956| 14| accum.mul(ws[13], p[20]); 1957| 14| accum.mul(ws[14], p[19]); 1958| 14| accum.mul(ws[15], p[18]); 1959| 14| accum.mul(ws[16], p[17]); 1960| 14| accum.mul(ws[17], p[16]); 1961| 14| accum.mul(ws[18], p[15]); 1962| 14| accum.mul(ws[19], p[14]); 1963| 14| accum.mul(ws[20], p[13]); 1964| 14| accum.mul(ws[21], p[12]); 1965| 14| accum.mul(ws[22], p[11]); 1966| 14| accum.mul(ws[23], p[10]); 1967| 14| accum.mul(ws[24], p[9]); 1968| 14| accum.mul(ws[25], p[8]); 1969| 14| accum.mul(ws[26], p[7]); 1970| 14| accum.mul(ws[27], p[6]); 1971| 14| accum.mul(ws[28], p[5]); 1972| 14| accum.mul(ws[29], p[4]); 1973| 14| accum.mul(ws[30], p[3]); 1974| 14| accum.mul(ws[31], p[2]); 1975| 14| accum.add(z[33]); 1976| 14| ws[1] = accum.extract(); 1977| 14| accum.mul(ws[3], p[31]); 1978| 14| accum.mul(ws[4], p[30]); 1979| 14| accum.mul(ws[5], p[29]); 1980| 14| accum.mul(ws[6], p[28]); 1981| 14| accum.mul(ws[7], p[27]); 1982| 14| accum.mul(ws[8], p[26]); 1983| 14| accum.mul(ws[9], p[25]); 1984| 14| accum.mul(ws[10], p[24]); 1985| 14| accum.mul(ws[11], p[23]); 1986| 14| accum.mul(ws[12], p[22]); 1987| 14| accum.mul(ws[13], p[21]); 1988| 14| accum.mul(ws[14], p[20]); 1989| 14| accum.mul(ws[15], p[19]); 1990| 14| accum.mul(ws[16], p[18]); 1991| 14| accum.mul(ws[17], p[17]); 1992| 14| accum.mul(ws[18], p[16]); 1993| 14| accum.mul(ws[19], p[15]); 1994| 14| accum.mul(ws[20], p[14]); 1995| 14| accum.mul(ws[21], p[13]); 1996| 14| accum.mul(ws[22], p[12]); 1997| 14| accum.mul(ws[23], p[11]); 1998| 14| accum.mul(ws[24], p[10]); 1999| 14| accum.mul(ws[25], p[9]); 2000| 14| accum.mul(ws[26], p[8]); 2001| 14| accum.mul(ws[27], p[7]); 2002| 14| accum.mul(ws[28], p[6]); 2003| 14| accum.mul(ws[29], p[5]); 2004| 14| accum.mul(ws[30], p[4]); 2005| 14| accum.mul(ws[31], p[3]); 2006| 14| accum.add(z[34]); 2007| 14| ws[2] = accum.extract(); 2008| 14| accum.mul(ws[4], p[31]); 2009| 14| accum.mul(ws[5], p[30]); 2010| 14| accum.mul(ws[6], p[29]); 2011| 14| accum.mul(ws[7], p[28]); 2012| 14| accum.mul(ws[8], p[27]); 2013| 14| accum.mul(ws[9], p[26]); 2014| 14| accum.mul(ws[10], p[25]); 2015| 14| accum.mul(ws[11], p[24]); 2016| 14| accum.mul(ws[12], p[23]); 2017| 14| accum.mul(ws[13], p[22]); 2018| 14| accum.mul(ws[14], p[21]); 2019| 14| accum.mul(ws[15], p[20]); 2020| 14| accum.mul(ws[16], p[19]); 2021| 14| accum.mul(ws[17], p[18]); 2022| 14| accum.mul(ws[18], p[17]); 2023| 14| accum.mul(ws[19], p[16]); 2024| 14| accum.mul(ws[20], p[15]); 2025| 14| accum.mul(ws[21], p[14]); 2026| 14| accum.mul(ws[22], p[13]); 2027| 14| accum.mul(ws[23], p[12]); 2028| 14| accum.mul(ws[24], p[11]); 2029| 14| accum.mul(ws[25], p[10]); 2030| 14| accum.mul(ws[26], p[9]); 2031| 14| accum.mul(ws[27], p[8]); 2032| 14| accum.mul(ws[28], p[7]); 2033| 14| accum.mul(ws[29], p[6]); 2034| 14| accum.mul(ws[30], p[5]); 2035| 14| accum.mul(ws[31], p[4]); 2036| 14| accum.add(z[35]); 2037| 14| ws[3] = accum.extract(); 2038| 14| accum.mul(ws[5], p[31]); 2039| 14| accum.mul(ws[6], p[30]); 2040| 14| accum.mul(ws[7], p[29]); 2041| 14| accum.mul(ws[8], p[28]); 2042| 14| accum.mul(ws[9], p[27]); 2043| 14| accum.mul(ws[10], p[26]); 2044| 14| accum.mul(ws[11], p[25]); 2045| 14| accum.mul(ws[12], p[24]); 2046| 14| accum.mul(ws[13], p[23]); 2047| 14| accum.mul(ws[14], p[22]); 2048| 14| accum.mul(ws[15], p[21]); 2049| 14| accum.mul(ws[16], p[20]); 2050| 14| accum.mul(ws[17], p[19]); 2051| 14| accum.mul(ws[18], p[18]); 2052| 14| accum.mul(ws[19], p[17]); 2053| 14| accum.mul(ws[20], p[16]); 2054| 14| accum.mul(ws[21], p[15]); 2055| 14| accum.mul(ws[22], p[14]); 2056| 14| accum.mul(ws[23], p[13]); 2057| 14| accum.mul(ws[24], p[12]); 2058| 14| accum.mul(ws[25], p[11]); 2059| 14| accum.mul(ws[26], p[10]); 2060| 14| accum.mul(ws[27], p[9]); 2061| 14| accum.mul(ws[28], p[8]); 2062| 14| accum.mul(ws[29], p[7]); 2063| 14| accum.mul(ws[30], p[6]); 2064| 14| accum.mul(ws[31], p[5]); 2065| 14| accum.add(z[36]); 2066| 14| ws[4] = accum.extract(); 2067| 14| accum.mul(ws[6], p[31]); 2068| 14| accum.mul(ws[7], p[30]); 2069| 14| accum.mul(ws[8], p[29]); 2070| 14| accum.mul(ws[9], p[28]); 2071| 14| accum.mul(ws[10], p[27]); 2072| 14| accum.mul(ws[11], p[26]); 2073| 14| accum.mul(ws[12], p[25]); 2074| 14| accum.mul(ws[13], p[24]); 2075| 14| accum.mul(ws[14], p[23]); 2076| 14| accum.mul(ws[15], p[22]); 2077| 14| accum.mul(ws[16], p[21]); 2078| 14| accum.mul(ws[17], p[20]); 2079| 14| accum.mul(ws[18], p[19]); 2080| 14| accum.mul(ws[19], p[18]); 2081| 14| accum.mul(ws[20], p[17]); 2082| 14| accum.mul(ws[21], p[16]); 2083| 14| accum.mul(ws[22], p[15]); 2084| 14| accum.mul(ws[23], p[14]); 2085| 14| accum.mul(ws[24], p[13]); 2086| 14| accum.mul(ws[25], p[12]); 2087| 14| accum.mul(ws[26], p[11]); 2088| 14| accum.mul(ws[27], p[10]); 2089| 14| accum.mul(ws[28], p[9]); 2090| 14| accum.mul(ws[29], p[8]); 2091| 14| accum.mul(ws[30], p[7]); 2092| 14| accum.mul(ws[31], p[6]); 2093| 14| accum.add(z[37]); 2094| 14| ws[5] = accum.extract(); 2095| 14| accum.mul(ws[7], p[31]); 2096| 14| accum.mul(ws[8], p[30]); 2097| 14| accum.mul(ws[9], p[29]); 2098| 14| accum.mul(ws[10], p[28]); 2099| 14| accum.mul(ws[11], p[27]); 2100| 14| accum.mul(ws[12], p[26]); 2101| 14| accum.mul(ws[13], p[25]); 2102| 14| accum.mul(ws[14], p[24]); 2103| 14| accum.mul(ws[15], p[23]); 2104| 14| accum.mul(ws[16], p[22]); 2105| 14| accum.mul(ws[17], p[21]); 2106| 14| accum.mul(ws[18], p[20]); 2107| 14| accum.mul(ws[19], p[19]); 2108| 14| accum.mul(ws[20], p[18]); 2109| 14| accum.mul(ws[21], p[17]); 2110| 14| accum.mul(ws[22], p[16]); 2111| 14| accum.mul(ws[23], p[15]); 2112| 14| accum.mul(ws[24], p[14]); 2113| 14| accum.mul(ws[25], p[13]); 2114| 14| accum.mul(ws[26], p[12]); 2115| 14| accum.mul(ws[27], p[11]); 2116| 14| accum.mul(ws[28], p[10]); 2117| 14| accum.mul(ws[29], p[9]); 2118| 14| accum.mul(ws[30], p[8]); 2119| 14| accum.mul(ws[31], p[7]); 2120| 14| accum.add(z[38]); 2121| 14| ws[6] = accum.extract(); 2122| 14| accum.mul(ws[8], p[31]); 2123| 14| accum.mul(ws[9], p[30]); 2124| 14| accum.mul(ws[10], p[29]); 2125| 14| accum.mul(ws[11], p[28]); 2126| 14| accum.mul(ws[12], p[27]); 2127| 14| accum.mul(ws[13], p[26]); 2128| 14| accum.mul(ws[14], p[25]); 2129| 14| accum.mul(ws[15], p[24]); 2130| 14| accum.mul(ws[16], p[23]); 2131| 14| accum.mul(ws[17], p[22]); 2132| 14| accum.mul(ws[18], p[21]); 2133| 14| accum.mul(ws[19], p[20]); 2134| 14| accum.mul(ws[20], p[19]); 2135| 14| accum.mul(ws[21], p[18]); 2136| 14| accum.mul(ws[22], p[17]); 2137| 14| accum.mul(ws[23], p[16]); 2138| 14| accum.mul(ws[24], p[15]); 2139| 14| accum.mul(ws[25], p[14]); 2140| 14| accum.mul(ws[26], p[13]); 2141| 14| accum.mul(ws[27], p[12]); 2142| 14| accum.mul(ws[28], p[11]); 2143| 14| accum.mul(ws[29], p[10]); 2144| 14| accum.mul(ws[30], p[9]); 2145| 14| accum.mul(ws[31], p[8]); 2146| 14| accum.add(z[39]); 2147| 14| ws[7] = accum.extract(); 2148| 14| accum.mul(ws[9], p[31]); 2149| 14| accum.mul(ws[10], p[30]); 2150| 14| accum.mul(ws[11], p[29]); 2151| 14| accum.mul(ws[12], p[28]); 2152| 14| accum.mul(ws[13], p[27]); 2153| 14| accum.mul(ws[14], p[26]); 2154| 14| accum.mul(ws[15], p[25]); 2155| 14| accum.mul(ws[16], p[24]); 2156| 14| accum.mul(ws[17], p[23]); 2157| 14| accum.mul(ws[18], p[22]); 2158| 14| accum.mul(ws[19], p[21]); 2159| 14| accum.mul(ws[20], p[20]); 2160| 14| accum.mul(ws[21], p[19]); 2161| 14| accum.mul(ws[22], p[18]); 2162| 14| accum.mul(ws[23], p[17]); 2163| 14| accum.mul(ws[24], p[16]); 2164| 14| accum.mul(ws[25], p[15]); 2165| 14| accum.mul(ws[26], p[14]); 2166| 14| accum.mul(ws[27], p[13]); 2167| 14| accum.mul(ws[28], p[12]); 2168| 14| accum.mul(ws[29], p[11]); 2169| 14| accum.mul(ws[30], p[10]); 2170| 14| accum.mul(ws[31], p[9]); 2171| 14| accum.add(z[40]); 2172| 14| ws[8] = accum.extract(); 2173| 14| accum.mul(ws[10], p[31]); 2174| 14| accum.mul(ws[11], p[30]); 2175| 14| accum.mul(ws[12], p[29]); 2176| 14| accum.mul(ws[13], p[28]); 2177| 14| accum.mul(ws[14], p[27]); 2178| 14| accum.mul(ws[15], p[26]); 2179| 14| accum.mul(ws[16], p[25]); 2180| 14| accum.mul(ws[17], p[24]); 2181| 14| accum.mul(ws[18], p[23]); 2182| 14| accum.mul(ws[19], p[22]); 2183| 14| accum.mul(ws[20], p[21]); 2184| 14| accum.mul(ws[21], p[20]); 2185| 14| accum.mul(ws[22], p[19]); 2186| 14| accum.mul(ws[23], p[18]); 2187| 14| accum.mul(ws[24], p[17]); 2188| 14| accum.mul(ws[25], p[16]); 2189| 14| accum.mul(ws[26], p[15]); 2190| 14| accum.mul(ws[27], p[14]); 2191| 14| accum.mul(ws[28], p[13]); 2192| 14| accum.mul(ws[29], p[12]); 2193| 14| accum.mul(ws[30], p[11]); 2194| 14| accum.mul(ws[31], p[10]); 2195| 14| accum.add(z[41]); 2196| 14| ws[9] = accum.extract(); 2197| 14| accum.mul(ws[11], p[31]); 2198| 14| accum.mul(ws[12], p[30]); 2199| 14| accum.mul(ws[13], p[29]); 2200| 14| accum.mul(ws[14], p[28]); 2201| 14| accum.mul(ws[15], p[27]); 2202| 14| accum.mul(ws[16], p[26]); 2203| 14| accum.mul(ws[17], p[25]); 2204| 14| accum.mul(ws[18], p[24]); 2205| 14| accum.mul(ws[19], p[23]); 2206| 14| accum.mul(ws[20], p[22]); 2207| 14| accum.mul(ws[21], p[21]); 2208| 14| accum.mul(ws[22], p[20]); 2209| 14| accum.mul(ws[23], p[19]); 2210| 14| accum.mul(ws[24], p[18]); 2211| 14| accum.mul(ws[25], p[17]); 2212| 14| accum.mul(ws[26], p[16]); 2213| 14| accum.mul(ws[27], p[15]); 2214| 14| accum.mul(ws[28], p[14]); 2215| 14| accum.mul(ws[29], p[13]); 2216| 14| accum.mul(ws[30], p[12]); 2217| 14| accum.mul(ws[31], p[11]); 2218| 14| accum.add(z[42]); 2219| 14| ws[10] = accum.extract(); 2220| 14| accum.mul(ws[12], p[31]); 2221| 14| accum.mul(ws[13], p[30]); 2222| 14| accum.mul(ws[14], p[29]); 2223| 14| accum.mul(ws[15], p[28]); 2224| 14| accum.mul(ws[16], p[27]); 2225| 14| accum.mul(ws[17], p[26]); 2226| 14| accum.mul(ws[18], p[25]); 2227| 14| accum.mul(ws[19], p[24]); 2228| 14| accum.mul(ws[20], p[23]); 2229| 14| accum.mul(ws[21], p[22]); 2230| 14| accum.mul(ws[22], p[21]); 2231| 14| accum.mul(ws[23], p[20]); 2232| 14| accum.mul(ws[24], p[19]); 2233| 14| accum.mul(ws[25], p[18]); 2234| 14| accum.mul(ws[26], p[17]); 2235| 14| accum.mul(ws[27], p[16]); 2236| 14| accum.mul(ws[28], p[15]); 2237| 14| accum.mul(ws[29], p[14]); 2238| 14| accum.mul(ws[30], p[13]); 2239| 14| accum.mul(ws[31], p[12]); 2240| 14| accum.add(z[43]); 2241| 14| ws[11] = accum.extract(); 2242| 14| accum.mul(ws[13], p[31]); 2243| 14| accum.mul(ws[14], p[30]); 2244| 14| accum.mul(ws[15], p[29]); 2245| 14| accum.mul(ws[16], p[28]); 2246| 14| accum.mul(ws[17], p[27]); 2247| 14| accum.mul(ws[18], p[26]); 2248| 14| accum.mul(ws[19], p[25]); 2249| 14| accum.mul(ws[20], p[24]); 2250| 14| accum.mul(ws[21], p[23]); 2251| 14| accum.mul(ws[22], p[22]); 2252| 14| accum.mul(ws[23], p[21]); 2253| 14| accum.mul(ws[24], p[20]); 2254| 14| accum.mul(ws[25], p[19]); 2255| 14| accum.mul(ws[26], p[18]); 2256| 14| accum.mul(ws[27], p[17]); 2257| 14| accum.mul(ws[28], p[16]); 2258| 14| accum.mul(ws[29], p[15]); 2259| 14| accum.mul(ws[30], p[14]); 2260| 14| accum.mul(ws[31], p[13]); 2261| 14| accum.add(z[44]); 2262| 14| ws[12] = accum.extract(); 2263| 14| accum.mul(ws[14], p[31]); 2264| 14| accum.mul(ws[15], p[30]); 2265| 14| accum.mul(ws[16], p[29]); 2266| 14| accum.mul(ws[17], p[28]); 2267| 14| accum.mul(ws[18], p[27]); 2268| 14| accum.mul(ws[19], p[26]); 2269| 14| accum.mul(ws[20], p[25]); 2270| 14| accum.mul(ws[21], p[24]); 2271| 14| accum.mul(ws[22], p[23]); 2272| 14| accum.mul(ws[23], p[22]); 2273| 14| accum.mul(ws[24], p[21]); 2274| 14| accum.mul(ws[25], p[20]); 2275| 14| accum.mul(ws[26], p[19]); 2276| 14| accum.mul(ws[27], p[18]); 2277| 14| accum.mul(ws[28], p[17]); 2278| 14| accum.mul(ws[29], p[16]); 2279| 14| accum.mul(ws[30], p[15]); 2280| 14| accum.mul(ws[31], p[14]); 2281| 14| accum.add(z[45]); 2282| 14| ws[13] = accum.extract(); 2283| 14| accum.mul(ws[15], p[31]); 2284| 14| accum.mul(ws[16], p[30]); 2285| 14| accum.mul(ws[17], p[29]); 2286| 14| accum.mul(ws[18], p[28]); 2287| 14| accum.mul(ws[19], p[27]); 2288| 14| accum.mul(ws[20], p[26]); 2289| 14| accum.mul(ws[21], p[25]); 2290| 14| accum.mul(ws[22], p[24]); 2291| 14| accum.mul(ws[23], p[23]); 2292| 14| accum.mul(ws[24], p[22]); 2293| 14| accum.mul(ws[25], p[21]); 2294| 14| accum.mul(ws[26], p[20]); 2295| 14| accum.mul(ws[27], p[19]); 2296| 14| accum.mul(ws[28], p[18]); 2297| 14| accum.mul(ws[29], p[17]); 2298| 14| accum.mul(ws[30], p[16]); 2299| 14| accum.mul(ws[31], p[15]); 2300| 14| accum.add(z[46]); 2301| 14| ws[14] = accum.extract(); 2302| 14| accum.mul(ws[16], p[31]); 2303| 14| accum.mul(ws[17], p[30]); 2304| 14| accum.mul(ws[18], p[29]); 2305| 14| accum.mul(ws[19], p[28]); 2306| 14| accum.mul(ws[20], p[27]); 2307| 14| accum.mul(ws[21], p[26]); 2308| 14| accum.mul(ws[22], p[25]); 2309| 14| accum.mul(ws[23], p[24]); 2310| 14| accum.mul(ws[24], p[23]); 2311| 14| accum.mul(ws[25], p[22]); 2312| 14| accum.mul(ws[26], p[21]); 2313| 14| accum.mul(ws[27], p[20]); 2314| 14| accum.mul(ws[28], p[19]); 2315| 14| accum.mul(ws[29], p[18]); 2316| 14| accum.mul(ws[30], p[17]); 2317| 14| accum.mul(ws[31], p[16]); 2318| 14| accum.add(z[47]); 2319| 14| ws[15] = accum.extract(); 2320| 14| accum.mul(ws[17], p[31]); 2321| 14| accum.mul(ws[18], p[30]); 2322| 14| accum.mul(ws[19], p[29]); 2323| 14| accum.mul(ws[20], p[28]); 2324| 14| accum.mul(ws[21], p[27]); 2325| 14| accum.mul(ws[22], p[26]); 2326| 14| accum.mul(ws[23], p[25]); 2327| 14| accum.mul(ws[24], p[24]); 2328| 14| accum.mul(ws[25], p[23]); 2329| 14| accum.mul(ws[26], p[22]); 2330| 14| accum.mul(ws[27], p[21]); 2331| 14| accum.mul(ws[28], p[20]); 2332| 14| accum.mul(ws[29], p[19]); 2333| 14| accum.mul(ws[30], p[18]); 2334| 14| accum.mul(ws[31], p[17]); 2335| 14| accum.add(z[48]); 2336| 14| ws[16] = accum.extract(); 2337| 14| accum.mul(ws[18], p[31]); 2338| 14| accum.mul(ws[19], p[30]); 2339| 14| accum.mul(ws[20], p[29]); 2340| 14| accum.mul(ws[21], p[28]); 2341| 14| accum.mul(ws[22], p[27]); 2342| 14| accum.mul(ws[23], p[26]); 2343| 14| accum.mul(ws[24], p[25]); 2344| 14| accum.mul(ws[25], p[24]); 2345| 14| accum.mul(ws[26], p[23]); 2346| 14| accum.mul(ws[27], p[22]); 2347| 14| accum.mul(ws[28], p[21]); 2348| 14| accum.mul(ws[29], p[20]); 2349| 14| accum.mul(ws[30], p[19]); 2350| 14| accum.mul(ws[31], p[18]); 2351| 14| accum.add(z[49]); 2352| 14| ws[17] = accum.extract(); 2353| 14| accum.mul(ws[19], p[31]); 2354| 14| accum.mul(ws[20], p[30]); 2355| 14| accum.mul(ws[21], p[29]); 2356| 14| accum.mul(ws[22], p[28]); 2357| 14| accum.mul(ws[23], p[27]); 2358| 14| accum.mul(ws[24], p[26]); 2359| 14| accum.mul(ws[25], p[25]); 2360| 14| accum.mul(ws[26], p[24]); 2361| 14| accum.mul(ws[27], p[23]); 2362| 14| accum.mul(ws[28], p[22]); 2363| 14| accum.mul(ws[29], p[21]); 2364| 14| accum.mul(ws[30], p[20]); 2365| 14| accum.mul(ws[31], p[19]); 2366| 14| accum.add(z[50]); 2367| 14| ws[18] = accum.extract(); 2368| 14| accum.mul(ws[20], p[31]); 2369| 14| accum.mul(ws[21], p[30]); 2370| 14| accum.mul(ws[22], p[29]); 2371| 14| accum.mul(ws[23], p[28]); 2372| 14| accum.mul(ws[24], p[27]); 2373| 14| accum.mul(ws[25], p[26]); 2374| 14| accum.mul(ws[26], p[25]); 2375| 14| accum.mul(ws[27], p[24]); 2376| 14| accum.mul(ws[28], p[23]); 2377| 14| accum.mul(ws[29], p[22]); 2378| 14| accum.mul(ws[30], p[21]); 2379| 14| accum.mul(ws[31], p[20]); 2380| 14| accum.add(z[51]); 2381| 14| ws[19] = accum.extract(); 2382| 14| accum.mul(ws[21], p[31]); 2383| 14| accum.mul(ws[22], p[30]); 2384| 14| accum.mul(ws[23], p[29]); 2385| 14| accum.mul(ws[24], p[28]); 2386| 14| accum.mul(ws[25], p[27]); 2387| 14| accum.mul(ws[26], p[26]); 2388| 14| accum.mul(ws[27], p[25]); 2389| 14| accum.mul(ws[28], p[24]); 2390| 14| accum.mul(ws[29], p[23]); 2391| 14| accum.mul(ws[30], p[22]); 2392| 14| accum.mul(ws[31], p[21]); 2393| 14| accum.add(z[52]); 2394| 14| ws[20] = accum.extract(); 2395| 14| accum.mul(ws[22], p[31]); 2396| 14| accum.mul(ws[23], p[30]); 2397| 14| accum.mul(ws[24], p[29]); 2398| 14| accum.mul(ws[25], p[28]); 2399| 14| accum.mul(ws[26], p[27]); 2400| 14| accum.mul(ws[27], p[26]); 2401| 14| accum.mul(ws[28], p[25]); 2402| 14| accum.mul(ws[29], p[24]); 2403| 14| accum.mul(ws[30], p[23]); 2404| 14| accum.mul(ws[31], p[22]); 2405| 14| accum.add(z[53]); 2406| 14| ws[21] = accum.extract(); 2407| 14| accum.mul(ws[23], p[31]); 2408| 14| accum.mul(ws[24], p[30]); 2409| 14| accum.mul(ws[25], p[29]); 2410| 14| accum.mul(ws[26], p[28]); 2411| 14| accum.mul(ws[27], p[27]); 2412| 14| accum.mul(ws[28], p[26]); 2413| 14| accum.mul(ws[29], p[25]); 2414| 14| accum.mul(ws[30], p[24]); 2415| 14| accum.mul(ws[31], p[23]); 2416| 14| accum.add(z[54]); 2417| 14| ws[22] = accum.extract(); 2418| 14| accum.mul(ws[24], p[31]); 2419| 14| accum.mul(ws[25], p[30]); 2420| 14| accum.mul(ws[26], p[29]); 2421| 14| accum.mul(ws[27], p[28]); 2422| 14| accum.mul(ws[28], p[27]); 2423| 14| accum.mul(ws[29], p[26]); 2424| 14| accum.mul(ws[30], p[25]); 2425| 14| accum.mul(ws[31], p[24]); 2426| 14| accum.add(z[55]); 2427| 14| ws[23] = accum.extract(); 2428| 14| accum.mul(ws[25], p[31]); 2429| 14| accum.mul(ws[26], p[30]); 2430| 14| accum.mul(ws[27], p[29]); 2431| 14| accum.mul(ws[28], p[28]); 2432| 14| accum.mul(ws[29], p[27]); 2433| 14| accum.mul(ws[30], p[26]); 2434| 14| accum.mul(ws[31], p[25]); 2435| 14| accum.add(z[56]); 2436| 14| ws[24] = accum.extract(); 2437| 14| accum.mul(ws[26], p[31]); 2438| 14| accum.mul(ws[27], p[30]); 2439| 14| accum.mul(ws[28], p[29]); 2440| 14| accum.mul(ws[29], p[28]); 2441| 14| accum.mul(ws[30], p[27]); 2442| 14| accum.mul(ws[31], p[26]); 2443| 14| accum.add(z[57]); 2444| 14| ws[25] = accum.extract(); 2445| 14| accum.mul(ws[27], p[31]); 2446| 14| accum.mul(ws[28], p[30]); 2447| 14| accum.mul(ws[29], p[29]); 2448| 14| accum.mul(ws[30], p[28]); 2449| 14| accum.mul(ws[31], p[27]); 2450| 14| accum.add(z[58]); 2451| 14| ws[26] = accum.extract(); 2452| 14| accum.mul(ws[28], p[31]); 2453| 14| accum.mul(ws[29], p[30]); 2454| 14| accum.mul(ws[30], p[29]); 2455| 14| accum.mul(ws[31], p[28]); 2456| 14| accum.add(z[59]); 2457| 14| ws[27] = accum.extract(); 2458| 14| accum.mul(ws[29], p[31]); 2459| 14| accum.mul(ws[30], p[30]); 2460| 14| accum.mul(ws[31], p[29]); 2461| 14| accum.add(z[60]); 2462| 14| ws[28] = accum.extract(); 2463| 14| accum.mul(ws[30], p[31]); 2464| 14| accum.mul(ws[31], p[30]); 2465| 14| accum.add(z[61]); 2466| 14| ws[29] = accum.extract(); 2467| 14| accum.mul(ws[31], p[31]); 2468| 14| accum.add(z[62]); 2469| 14| ws[30] = accum.extract(); 2470| 14| accum.add(z[63]); 2471| 14| ws[31] = accum.extract(); 2472| 14| const word w1 = accum.extract(); 2473| 14| bigint_monty_maybe_sub<32>(r, w1, ws, p); 2474| 14|} _ZN5Botan21bigint_mulx_monty_mulEPmPKmS2_S2_mmS0_: 111| 1.18k|void bigint_mulx_monty_mul(word z[], const word x[], const word y[], const word p[], size_t N, word p_dash, word ws[]) { 112| | // t[-1] receives the word shifted out by each reduction row 113| 1.18k| word* t = ws + 1; 114| 1.18k| clear_mem(ws, N + 3); 115| | 116| 23.6k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (116:22): [True: 22.4k, False: 1.18k] ------------------ 117| 22.4k| monty_row(t, t, x, N, y[i], 0); 118| 22.4k| const word m = t[0] * p_dash; 119| 22.4k| monty_row(t - 1, t, p, N, m, 0); 120| 22.4k| t[N + 1] = 0; 121| 22.4k| } 122| | 123| | // The result is below 2p, with t[N] holding its top bit 124| 1.18k| bigint_monty_maybe_sub(N, z, t[N], t, p); 125| 1.18k|} _ZN5Botan21bigint_mulx_monty_sqrEPmPKmS2_mmS0_: 127| 1.96k|void bigint_mulx_monty_sqr(word z[], const word x[], const word p[], size_t N, word p_dash, word ws[]) { 128| 1.96k| bigint_mulx_sqr(ws, x, N); 129| 1.96k| bigint_mulx_monty_redc(z, ws, p, N, p_dash); 130| 1.96k|} _ZN5Botan15bigint_mulx_sqrEPmPKmm: 132| 1.96k|void bigint_mulx_sqr(word z[], const word x[], size_t N) { 133| 1.96k| clear_mem(z, 2 * N + 1); 134| | 135| | /* 136| | * x is split into a leading block of N % 8 words followed by blocks of 8 137| | * words. Rows from the leading block cover every product x[i]*x[j] with 138| | * j > i; rows from the other blocks cover only products with x[j] in a 139| | * later block, so their lengths are multiples of 8. 140| | */ 141| 1.96k| const size_t lead = N % 8; 142| | 143| 2.53k| for(size_t i = 0; i != lead; ++i) { ------------------ | Branch (143:22): [True: 574, False: 1.96k] ------------------ 144| 574| monty_row(z + 2 * i + 1, z + 2 * i + 1, x + i + 1, N - i - 1, x[i], 0); 145| 574| } 146| | 147| 4.48k| for(size_t b = lead; b + 8 < N; b += 8) { ------------------ | Branch (147:25): [True: 2.52k, False: 1.96k] ------------------ 148| 22.7k| for(size_t i = b; i != b + 8; ++i) { ------------------ | Branch (148:25): [True: 20.1k, False: 2.52k] ------------------ 149| 20.1k| monty_row(z + i + b + 8, z + i + b + 8, x + b + 8, N - b - 8, x[i], 0); 150| 20.1k| } 151| 2.52k| } 152| | 153| | // Double the products while adding the squares not yet included, which together cover z[0..2N) 154| 1.96k| word carry = 0; 155| 1.96k| word top = 0; 156| 1.96k| auto double_and_add = [&](size_t k, word s) { 157| 1.96k| const word w = z[k]; 158| 1.96k| z[k] = word_add((w << 1) | top, s, &carry); 159| 1.96k| top = w >> (WordInfo::bits - 1); 160| 1.96k| }; 161| | 162| 2.53k| for(size_t i = 0; i != lead; ++i) { ------------------ | Branch (162:22): [True: 574, False: 1.96k] ------------------ 163| 574| word hi = 0; 164| 574| const word lo = word_madd2(x[i], x[i], &hi); 165| 574| double_and_add(2 * i, lo); 166| 574| double_and_add(2 * i + 1, hi); 167| 574| } 168| | 169| 6.44k| for(size_t b = lead; b != N; b += 8) { ------------------ | Branch (169:25): [True: 4.48k, False: 1.96k] ------------------ 170| 4.48k| std::array sq{}; 171| 4.48k| bigint_mulx_sqr8(sq.data(), x + b); 172| 76.2k| for(size_t k = 0; k != 16; ++k) { ------------------ | Branch (172:25): [True: 71.7k, False: 4.48k] ------------------ 173| 71.7k| double_and_add(2 * b + k, sq[k]); 174| 71.7k| } 175| 4.48k| } 176| | 177| | // The square fits in 2N words 178| 1.96k| BOTAN_DEBUG_ASSERT(carry == 0 && top == 0); ------------------ | | 137| 1.96k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.96k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.96k] | | ------------------ ------------------ 179| 1.96k|} _ZN5Botan22bigint_mulx_monty_redcEPmS0_PKmmm: 181| 1.96k|void bigint_mulx_monty_redc(word r[], word z[], const word p[], size_t N, word p_dash) { 182| 1.96k| z[2 * N] = 0; 183| | 184| 1.96k| word c = 0; 185| 38.4k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (185:22): [True: 36.4k, False: 1.96k] ------------------ 186| 36.4k| const word m = z[i] * p_dash; 187| 36.4k| c = monty_row(z + i, z + i, p, N, m, c); 188| 36.4k| } 189| | 190| | // The sum is below 2p * B^N, so the final carry is zero and the top bit is z[2N] 191| 1.96k| BOTAN_DEBUG_ASSERT(c == 0); ------------------ | | 137| 1.96k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.96k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.96k] | | ------------------ ------------------ 192| 1.96k| bigint_monty_maybe_sub(N, r, z[2 * N], z + N, p); 193| 1.96k|} mp_monty_mulx.cpp:_ZN5Botan12_GLOBAL__N_19monty_rowEPmPKmS3_mmm: 84| 102k|BOTAN_FORCE_INLINE word monty_row(word* out, const word* t, const word* x, size_t N, word b, word c) { 85| 102k| word carry = 0; 86| | // Advancing the pointers, rather than indexing, keeps the compiler from generating a slower loop 87| 333k| for(size_t i = N / 8; i != 0; --i) { ------------------ | Branch (87:26): [True: 231k, False: 102k] ------------------ 88| 231k| carry = muladd8(out, t, x, b, carry); 89| 231k| out += 8; 90| 231k| t += 8; 91| 231k| x += 8; 92| 231k| } 93| 102k| if(N % 8 >= 4) { ------------------ | Branch (93:7): [True: 0, False: 102k] ------------------ 94| 0| carry = muladd4(out, t, x, b, carry); 95| 0| out += 4; 96| 0| t += 4; 97| 0| x += 4; 98| 0| } 99| 134k| for(size_t i = N % 4; i != 0; --i) { ------------------ | Branch (99:26): [True: 32.0k, False: 102k] ------------------ 100| 32.0k| *out++ = word_madd3(*x++, b, *t++, &carry); 101| 32.0k| } 102| | 103| 102k| word c2 = 0; 104| 102k| out[0] = word_add(t[0], carry, &c2); 105| 102k| out[1] = word_add(t[1], c, &c2); 106| 102k| return c2; 107| 102k|} mp_monty_mulx.cpp:_ZN5Botan12_GLOBAL__N_17muladd8EPmPKmS3_mm: 60| 231k|BOTAN_FORCE_INLINE word muladd8(word* out, const word* t, const word* x, word b, word carry) { 61| 231k| word tmp = 0; 62| 231k| word lo = 0; 63| 231k| word zero = 0; 64| 231k| BOTAN_MULADD_ASM(BOTAN_MULADD_STEPS8); ------------------ | | 38| 231k| asm volatile("xorl %k[zero], %k[zero]\n\t" \ | | 39| 231k| STEPS \ | | 40| 231k| "adox %[zero], %[carry]\n\t" \ | | 41| 231k| "adcx %[zero], %[carry]\n\t" \ | | 42| 231k| : [carry] "+&r"(carry), [tmp] "=&r"(tmp), [lo] "=&r"(lo), [zero] "=&r"(zero) \ | | 43| 231k| : [out] "r"(out), [t] "r"(t), [x] "r"(x), "d"(b) \ | | 44| 231k| : "cc", "memory") ------------------ 65| 231k| return carry; 66| 231k|} mp_monty_mulx.cpp:_ZZN5Botan15bigint_mulx_sqrEPmPKmmENK3$_0clEmm: 156| 72.8k| auto double_and_add = [&](size_t k, word s) { 157| 72.8k| const word w = z[k]; 158| 72.8k| z[k] = word_add((w << 1) | top, s, &carry); 159| 72.8k| top = w >> (WordInfo::bits - 1); 160| 72.8k| }; _ZN5Botan16bigint_mulx_sqr4EPmPKm: 27| 4.06M|void bigint_mulx_sqr4(word z[8], const word x[4]) { 28| | // clang-format off 29| 4.06M| asm( 30| 4.06M| "xorl %%r9d, %%r9d\n\t" 31| 4.06M| "xorl %%r10d, %%r10d\n\t" 32| 4.06M| "xorl %%r8d, %%r8d\n\t" 33| | 34| 4.06M| "movq 0(%[x]), %%rdx\n\t" // x[0] * x[1..3] 35| 4.06M| "xorl %%eax, %%eax\n\t" 36| 4.06M| "mulx 8(%[x]), %%rax, %%rcx\n\t" 37| 4.06M| "adcx %%rax, %%r9\n\t" 38| 4.06M| "movq %%r9, 8(%[z])\n\t" 39| 4.06M| "mulx 16(%[x]), %%rax, %%r9\n\t" 40| 4.06M| "adox %%rcx, %%rax\n\t" 41| 4.06M| "adcx %%rax, %%r10\n\t" 42| 4.06M| "mulx 24(%[x]), %%rax, %%rcx\n\t" 43| 4.06M| "adox %%r9, %%rax\n\t" 44| 4.06M| "adcx %%rax, %%r8\n\t" 45| 4.06M| "movl $0, %%eax\n\t" 46| 4.06M| "adox %%rax, %%rcx\n\t" 47| 4.06M| "adcx %%rax, %%rcx\n\t" 48| 4.06M| "movq %%rcx, %%r9\n\t" 49| 4.06M| "movq %%r10, 16(%[z])\n\t" 50| | 51| 4.06M| "movq 8(%[x]), %%rdx\n\t" // x[1] * x[2..3] 52| 4.06M| "xorl %%eax, %%eax\n\t" 53| 4.06M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 54| 4.06M| "adcx %%rax, %%r8\n\t" 55| 4.06M| "movq %%r8, 24(%[z])\n\t" 56| 4.06M| "mulx 24(%[x]), %%rax, %%r10\n\t" 57| 4.06M| "adox %%rcx, %%rax\n\t" 58| 4.06M| "adcx %%rax, %%r9\n\t" 59| 4.06M| "movl $0, %%eax\n\t" 60| 4.06M| "adox %%rax, %%r10\n\t" 61| 4.06M| "adcx %%rax, %%r10\n\t" 62| 4.06M| "movq %%r9, 32(%[z])\n\t" 63| | 64| 4.06M| "movq 16(%[x]), %%rdx\n\t" // x[2] * x[3..3] 65| 4.06M| "xorl %%eax, %%eax\n\t" 66| 4.06M| "mulx 24(%[x]), %%rax, %%rcx\n\t" 67| 4.06M| "adcx %%rax, %%r10\n\t" 68| 4.06M| "movq %%r10, 40(%[z])\n\t" 69| 4.06M| "movl $0, %%eax\n\t" 70| 4.06M| "adox %%rax, %%rcx\n\t" 71| 4.06M| "adcx %%rax, %%rcx\n\t" 72| 4.06M| "movq %%rcx, %%r8\n\t" 73| 4.06M| "movq %%r8, 48(%[z])\n\t" 74| | 75| 4.06M| "movq $0, 56(%[z])\n\t" 76| 4.06M| "xorl %%eax, %%eax\n\t" // double the cross products and add the squares 77| 4.06M| "movq 0(%[x]), %%rdx\n\t" 78| 4.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 79| 4.06M| "movq %%rax, 0(%[z])\n\t" 80| 4.06M| "movq 8(%[z]), %%r8\n\t" 81| 4.06M| "adcx %%r8, %%r8\n\t" 82| 4.06M| "adox %%rcx, %%r8\n\t" 83| 4.06M| "movq %%r8, 8(%[z])\n\t" 84| 4.06M| "movq 8(%[x]), %%rdx\n\t" 85| 4.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 86| 4.06M| "movq 16(%[z]), %%r8\n\t" 87| 4.06M| "adcx %%r8, %%r8\n\t" 88| 4.06M| "adox %%rax, %%r8\n\t" 89| 4.06M| "movq %%r8, 16(%[z])\n\t" 90| 4.06M| "movq 24(%[z]), %%r8\n\t" 91| 4.06M| "adcx %%r8, %%r8\n\t" 92| 4.06M| "adox %%rcx, %%r8\n\t" 93| 4.06M| "movq %%r8, 24(%[z])\n\t" 94| 4.06M| "movq 16(%[x]), %%rdx\n\t" 95| 4.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 96| 4.06M| "movq 32(%[z]), %%r8\n\t" 97| 4.06M| "adcx %%r8, %%r8\n\t" 98| 4.06M| "adox %%rax, %%r8\n\t" 99| 4.06M| "movq %%r8, 32(%[z])\n\t" 100| 4.06M| "movq 40(%[z]), %%r8\n\t" 101| 4.06M| "adcx %%r8, %%r8\n\t" 102| 4.06M| "adox %%rcx, %%r8\n\t" 103| 4.06M| "movq %%r8, 40(%[z])\n\t" 104| 4.06M| "movq 24(%[x]), %%rdx\n\t" 105| 4.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 106| 4.06M| "movq 48(%[z]), %%r8\n\t" 107| 4.06M| "adcx %%r8, %%r8\n\t" 108| 4.06M| "adox %%rax, %%r8\n\t" 109| 4.06M| "movq %%r8, 48(%[z])\n\t" 110| 4.06M| "movq 56(%[z]), %%r8\n\t" 111| 4.06M| "adcx %%r8, %%r8\n\t" 112| 4.06M| "adox %%rcx, %%r8\n\t" 113| 4.06M| "movq %%r8, 56(%[z])\n\t" 114| 4.06M| : 115| 4.06M| : [z] "r"(z), [x] "r"(x) 116| 4.06M| : "rax", "rcx", "rdx", "r8", "r9", "r10", "cc", "memory"); 117| | // clang-format on 118| 4.06M|} _ZN5Botan16bigint_mulx_mul4EPmPKmS2_: 120| 7.41M|void bigint_mulx_mul4(word z[8], const word x[4], const word y[4]) { 121| | // clang-format off 122| 7.41M| asm( 123| 7.41M| "xorl %%r8d, %%r8d\n\t" 124| 7.41M| "xorl %%r9d, %%r9d\n\t" 125| 7.41M| "xorl %%r10d, %%r10d\n\t" 126| 7.41M| "xorl %%r11d, %%r11d\n\t" 127| | 128| 7.41M| "movq 0(%[y]), %%rdx\n\t" // row 0: x * y[0] 129| 7.41M| "xorl %%eax, %%eax\n\t" 130| 7.41M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 131| 7.41M| "adcx %%rax, %%r8\n\t" 132| 7.41M| "movq %%r8, 0(%[z])\n\t" 133| 7.41M| "mulx 8(%[x]), %%rax, %%r8\n\t" 134| 7.41M| "adox %%rcx, %%rax\n\t" 135| 7.41M| "adcx %%rax, %%r9\n\t" 136| 7.41M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 137| 7.41M| "adox %%r8, %%rax\n\t" 138| 7.41M| "adcx %%rax, %%r10\n\t" 139| 7.41M| "mulx 24(%[x]), %%rax, %%r8\n\t" 140| 7.41M| "adox %%rcx, %%rax\n\t" 141| 7.41M| "adcx %%rax, %%r11\n\t" 142| 7.41M| "movl $0, %%eax\n\t" 143| 7.41M| "adox %%rax, %%r8\n\t" 144| 7.41M| "adcx %%rax, %%r8\n\t" 145| | 146| 7.41M| "movq 8(%[y]), %%rdx\n\t" // row 1: x * y[1] 147| 7.41M| "xorl %%eax, %%eax\n\t" 148| 7.41M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 149| 7.41M| "adcx %%rax, %%r9\n\t" 150| 7.41M| "movq %%r9, 8(%[z])\n\t" 151| 7.41M| "mulx 8(%[x]), %%rax, %%r9\n\t" 152| 7.41M| "adox %%rcx, %%rax\n\t" 153| 7.41M| "adcx %%rax, %%r10\n\t" 154| 7.41M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 155| 7.41M| "adox %%r9, %%rax\n\t" 156| 7.41M| "adcx %%rax, %%r11\n\t" 157| 7.41M| "mulx 24(%[x]), %%rax, %%r9\n\t" 158| 7.41M| "adox %%rcx, %%rax\n\t" 159| 7.41M| "adcx %%rax, %%r8\n\t" 160| 7.41M| "movl $0, %%eax\n\t" 161| 7.41M| "adox %%rax, %%r9\n\t" 162| 7.41M| "adcx %%rax, %%r9\n\t" 163| | 164| 7.41M| "movq 16(%[y]), %%rdx\n\t" // row 2: x * y[2] 165| 7.41M| "xorl %%eax, %%eax\n\t" 166| 7.41M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 167| 7.41M| "adcx %%rax, %%r10\n\t" 168| 7.41M| "movq %%r10, 16(%[z])\n\t" 169| 7.41M| "mulx 8(%[x]), %%rax, %%r10\n\t" 170| 7.41M| "adox %%rcx, %%rax\n\t" 171| 7.41M| "adcx %%rax, %%r11\n\t" 172| 7.41M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 173| 7.41M| "adox %%r10, %%rax\n\t" 174| 7.41M| "adcx %%rax, %%r8\n\t" 175| 7.41M| "mulx 24(%[x]), %%rax, %%r10\n\t" 176| 7.41M| "adox %%rcx, %%rax\n\t" 177| 7.41M| "adcx %%rax, %%r9\n\t" 178| 7.41M| "movl $0, %%eax\n\t" 179| 7.41M| "adox %%rax, %%r10\n\t" 180| 7.41M| "adcx %%rax, %%r10\n\t" 181| | 182| 7.41M| "movq 24(%[y]), %%rdx\n\t" // row 3: x * y[3] 183| 7.41M| "xorl %%eax, %%eax\n\t" 184| 7.41M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 185| 7.41M| "adcx %%rax, %%r11\n\t" 186| 7.41M| "movq %%r11, 24(%[z])\n\t" 187| 7.41M| "mulx 8(%[x]), %%rax, %%r11\n\t" 188| 7.41M| "adox %%rcx, %%rax\n\t" 189| 7.41M| "adcx %%rax, %%r8\n\t" 190| 7.41M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 191| 7.41M| "adox %%r11, %%rax\n\t" 192| 7.41M| "adcx %%rax, %%r9\n\t" 193| 7.41M| "mulx 24(%[x]), %%rax, %%r11\n\t" 194| 7.41M| "adox %%rcx, %%rax\n\t" 195| 7.41M| "adcx %%rax, %%r10\n\t" 196| 7.41M| "movl $0, %%eax\n\t" 197| 7.41M| "adox %%rax, %%r11\n\t" 198| 7.41M| "adcx %%rax, %%r11\n\t" 199| | 200| 7.41M| "movq %%r8, 32(%[z])\n\t" 201| 7.41M| "movq %%r9, 40(%[z])\n\t" 202| 7.41M| "movq %%r10, 48(%[z])\n\t" 203| 7.41M| "movq %%r11, 56(%[z])\n\t" 204| 7.41M| : 205| 7.41M| : [z] "r"(z), [x] "r"(x), [y] "r"(y) 206| 7.41M| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "cc", "memory"); 207| | // clang-format on 208| 7.41M|} _ZN5Botan16bigint_mulx_sqr6EPmPKm: 210| 789k|void bigint_mulx_sqr6(word z[12], const word x[6]) { 211| | // clang-format off 212| 789k| asm( 213| 789k| "xorl %%r9d, %%r9d\n\t" 214| 789k| "xorl %%r10d, %%r10d\n\t" 215| 789k| "xorl %%r11d, %%r11d\n\t" 216| 789k| "xorl %%r12d, %%r12d\n\t" 217| 789k| "xorl %%r8d, %%r8d\n\t" 218| | 219| 789k| "movq 0(%[x]), %%rdx\n\t" // x[0] * x[1..5] 220| 789k| "xorl %%eax, %%eax\n\t" 221| 789k| "mulx 8(%[x]), %%rax, %%rcx\n\t" 222| 789k| "adcx %%rax, %%r9\n\t" 223| 789k| "movq %%r9, 8(%[z])\n\t" 224| 789k| "mulx 16(%[x]), %%rax, %%r9\n\t" 225| 789k| "adox %%rcx, %%rax\n\t" 226| 789k| "adcx %%rax, %%r10\n\t" 227| 789k| "mulx 24(%[x]), %%rax, %%rcx\n\t" 228| 789k| "adox %%r9, %%rax\n\t" 229| 789k| "adcx %%rax, %%r11\n\t" 230| 789k| "mulx 32(%[x]), %%rax, %%r9\n\t" 231| 789k| "adox %%rcx, %%rax\n\t" 232| 789k| "adcx %%rax, %%r12\n\t" 233| 789k| "mulx 40(%[x]), %%rax, %%rcx\n\t" 234| 789k| "adox %%r9, %%rax\n\t" 235| 789k| "adcx %%rax, %%r8\n\t" 236| 789k| "movl $0, %%eax\n\t" 237| 789k| "adox %%rax, %%rcx\n\t" 238| 789k| "adcx %%rax, %%rcx\n\t" 239| 789k| "movq %%rcx, %%r9\n\t" 240| 789k| "movq %%r10, 16(%[z])\n\t" 241| | 242| 789k| "movq 8(%[x]), %%rdx\n\t" // x[1] * x[2..5] 243| 789k| "xorl %%eax, %%eax\n\t" 244| 789k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 245| 789k| "adcx %%rax, %%r11\n\t" 246| 789k| "movq %%r11, 24(%[z])\n\t" 247| 789k| "mulx 24(%[x]), %%rax, %%r10\n\t" 248| 789k| "adox %%rcx, %%rax\n\t" 249| 789k| "adcx %%rax, %%r12\n\t" 250| 789k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 251| 789k| "adox %%r10, %%rax\n\t" 252| 789k| "adcx %%rax, %%r8\n\t" 253| 789k| "mulx 40(%[x]), %%rax, %%r10\n\t" 254| 789k| "adox %%rcx, %%rax\n\t" 255| 789k| "adcx %%rax, %%r9\n\t" 256| 789k| "movl $0, %%eax\n\t" 257| 789k| "adox %%rax, %%r10\n\t" 258| 789k| "adcx %%rax, %%r10\n\t" 259| 789k| "movq %%r12, 32(%[z])\n\t" 260| | 261| 789k| "movq 16(%[x]), %%rdx\n\t" // x[2] * x[3..5] 262| 789k| "xorl %%eax, %%eax\n\t" 263| 789k| "mulx 24(%[x]), %%rax, %%rcx\n\t" 264| 789k| "adcx %%rax, %%r8\n\t" 265| 789k| "movq %%r8, 40(%[z])\n\t" 266| 789k| "mulx 32(%[x]), %%rax, %%r11\n\t" 267| 789k| "adox %%rcx, %%rax\n\t" 268| 789k| "adcx %%rax, %%r9\n\t" 269| 789k| "mulx 40(%[x]), %%rax, %%rcx\n\t" 270| 789k| "adox %%r11, %%rax\n\t" 271| 789k| "adcx %%rax, %%r10\n\t" 272| 789k| "movl $0, %%eax\n\t" 273| 789k| "adox %%rax, %%rcx\n\t" 274| 789k| "adcx %%rax, %%rcx\n\t" 275| 789k| "movq %%rcx, %%r11\n\t" 276| 789k| "movq %%r9, 48(%[z])\n\t" 277| | 278| 789k| "movq 24(%[x]), %%rdx\n\t" // x[3] * x[4..5] 279| 789k| "xorl %%eax, %%eax\n\t" 280| 789k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 281| 789k| "adcx %%rax, %%r10\n\t" 282| 789k| "movq %%r10, 56(%[z])\n\t" 283| 789k| "mulx 40(%[x]), %%rax, %%r12\n\t" 284| 789k| "adox %%rcx, %%rax\n\t" 285| 789k| "adcx %%rax, %%r11\n\t" 286| 789k| "movl $0, %%eax\n\t" 287| 789k| "adox %%rax, %%r12\n\t" 288| 789k| "adcx %%rax, %%r12\n\t" 289| 789k| "movq %%r11, 64(%[z])\n\t" 290| | 291| 789k| "movq 32(%[x]), %%rdx\n\t" // x[4] * x[5..5] 292| 789k| "xorl %%eax, %%eax\n\t" 293| 789k| "mulx 40(%[x]), %%rax, %%rcx\n\t" 294| 789k| "adcx %%rax, %%r12\n\t" 295| 789k| "movq %%r12, 72(%[z])\n\t" 296| 789k| "movl $0, %%eax\n\t" 297| 789k| "adox %%rax, %%rcx\n\t" 298| 789k| "adcx %%rax, %%rcx\n\t" 299| 789k| "movq %%rcx, %%r8\n\t" 300| 789k| "movq %%r8, 80(%[z])\n\t" 301| | 302| 789k| "movq $0, 88(%[z])\n\t" 303| 789k| "xorl %%eax, %%eax\n\t" // double the cross products and add the squares 304| 789k| "movq 0(%[x]), %%rdx\n\t" 305| 789k| "mulx %%rdx, %%rax, %%rcx\n\t" 306| 789k| "movq %%rax, 0(%[z])\n\t" 307| 789k| "movq 8(%[z]), %%r8\n\t" 308| 789k| "adcx %%r8, %%r8\n\t" 309| 789k| "adox %%rcx, %%r8\n\t" 310| 789k| "movq %%r8, 8(%[z])\n\t" 311| 789k| "movq 8(%[x]), %%rdx\n\t" 312| 789k| "mulx %%rdx, %%rax, %%rcx\n\t" 313| 789k| "movq 16(%[z]), %%r8\n\t" 314| 789k| "adcx %%r8, %%r8\n\t" 315| 789k| "adox %%rax, %%r8\n\t" 316| 789k| "movq %%r8, 16(%[z])\n\t" 317| 789k| "movq 24(%[z]), %%r8\n\t" 318| 789k| "adcx %%r8, %%r8\n\t" 319| 789k| "adox %%rcx, %%r8\n\t" 320| 789k| "movq %%r8, 24(%[z])\n\t" 321| 789k| "movq 16(%[x]), %%rdx\n\t" 322| 789k| "mulx %%rdx, %%rax, %%rcx\n\t" 323| 789k| "movq 32(%[z]), %%r8\n\t" 324| 789k| "adcx %%r8, %%r8\n\t" 325| 789k| "adox %%rax, %%r8\n\t" 326| 789k| "movq %%r8, 32(%[z])\n\t" 327| 789k| "movq 40(%[z]), %%r8\n\t" 328| 789k| "adcx %%r8, %%r8\n\t" 329| 789k| "adox %%rcx, %%r8\n\t" 330| 789k| "movq %%r8, 40(%[z])\n\t" 331| 789k| "movq 24(%[x]), %%rdx\n\t" 332| 789k| "mulx %%rdx, %%rax, %%rcx\n\t" 333| 789k| "movq 48(%[z]), %%r8\n\t" 334| 789k| "adcx %%r8, %%r8\n\t" 335| 789k| "adox %%rax, %%r8\n\t" 336| 789k| "movq %%r8, 48(%[z])\n\t" 337| 789k| "movq 56(%[z]), %%r8\n\t" 338| 789k| "adcx %%r8, %%r8\n\t" 339| 789k| "adox %%rcx, %%r8\n\t" 340| 789k| "movq %%r8, 56(%[z])\n\t" 341| 789k| "movq 32(%[x]), %%rdx\n\t" 342| 789k| "mulx %%rdx, %%rax, %%rcx\n\t" 343| 789k| "movq 64(%[z]), %%r8\n\t" 344| 789k| "adcx %%r8, %%r8\n\t" 345| 789k| "adox %%rax, %%r8\n\t" 346| 789k| "movq %%r8, 64(%[z])\n\t" 347| 789k| "movq 72(%[z]), %%r8\n\t" 348| 789k| "adcx %%r8, %%r8\n\t" 349| 789k| "adox %%rcx, %%r8\n\t" 350| 789k| "movq %%r8, 72(%[z])\n\t" 351| 789k| "movq 40(%[x]), %%rdx\n\t" 352| 789k| "mulx %%rdx, %%rax, %%rcx\n\t" 353| 789k| "movq 80(%[z]), %%r8\n\t" 354| 789k| "adcx %%r8, %%r8\n\t" 355| 789k| "adox %%rax, %%r8\n\t" 356| 789k| "movq %%r8, 80(%[z])\n\t" 357| 789k| "movq 88(%[z]), %%r8\n\t" 358| 789k| "adcx %%r8, %%r8\n\t" 359| 789k| "adox %%rcx, %%r8\n\t" 360| 789k| "movq %%r8, 88(%[z])\n\t" 361| 789k| : 362| 789k| : [z] "r"(z), [x] "r"(x) 363| 789k| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "r12", "cc", "memory"); 364| | // clang-format on 365| 789k|} _ZN5Botan16bigint_mulx_mul6EPmPKmS2_: 367| 1.02M|void bigint_mulx_mul6(word z[12], const word x[6], const word y[6]) { 368| | // clang-format off 369| 1.02M| asm( 370| 1.02M| "xorl %%r8d, %%r8d\n\t" 371| 1.02M| "xorl %%r9d, %%r9d\n\t" 372| 1.02M| "xorl %%r10d, %%r10d\n\t" 373| 1.02M| "xorl %%r11d, %%r11d\n\t" 374| 1.02M| "xorl %%r12d, %%r12d\n\t" 375| 1.02M| "xorl %%r13d, %%r13d\n\t" 376| | 377| 1.02M| "movq 0(%[y]), %%rdx\n\t" // row 0: x * y[0] 378| 1.02M| "xorl %%eax, %%eax\n\t" 379| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 380| 1.02M| "adcx %%rax, %%r8\n\t" 381| 1.02M| "movq %%r8, 0(%[z])\n\t" 382| 1.02M| "mulx 8(%[x]), %%rax, %%r8\n\t" 383| 1.02M| "adox %%rcx, %%rax\n\t" 384| 1.02M| "adcx %%rax, %%r9\n\t" 385| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 386| 1.02M| "adox %%r8, %%rax\n\t" 387| 1.02M| "adcx %%rax, %%r10\n\t" 388| 1.02M| "mulx 24(%[x]), %%rax, %%r8\n\t" 389| 1.02M| "adox %%rcx, %%rax\n\t" 390| 1.02M| "adcx %%rax, %%r11\n\t" 391| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 392| 1.02M| "adox %%r8, %%rax\n\t" 393| 1.02M| "adcx %%rax, %%r12\n\t" 394| 1.02M| "mulx 40(%[x]), %%rax, %%r8\n\t" 395| 1.02M| "adox %%rcx, %%rax\n\t" 396| 1.02M| "adcx %%rax, %%r13\n\t" 397| 1.02M| "movl $0, %%eax\n\t" 398| 1.02M| "adox %%rax, %%r8\n\t" 399| 1.02M| "adcx %%rax, %%r8\n\t" 400| | 401| 1.02M| "movq 8(%[y]), %%rdx\n\t" // row 1: x * y[1] 402| 1.02M| "xorl %%eax, %%eax\n\t" 403| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 404| 1.02M| "adcx %%rax, %%r9\n\t" 405| 1.02M| "movq %%r9, 8(%[z])\n\t" 406| 1.02M| "mulx 8(%[x]), %%rax, %%r9\n\t" 407| 1.02M| "adox %%rcx, %%rax\n\t" 408| 1.02M| "adcx %%rax, %%r10\n\t" 409| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 410| 1.02M| "adox %%r9, %%rax\n\t" 411| 1.02M| "adcx %%rax, %%r11\n\t" 412| 1.02M| "mulx 24(%[x]), %%rax, %%r9\n\t" 413| 1.02M| "adox %%rcx, %%rax\n\t" 414| 1.02M| "adcx %%rax, %%r12\n\t" 415| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 416| 1.02M| "adox %%r9, %%rax\n\t" 417| 1.02M| "adcx %%rax, %%r13\n\t" 418| 1.02M| "mulx 40(%[x]), %%rax, %%r9\n\t" 419| 1.02M| "adox %%rcx, %%rax\n\t" 420| 1.02M| "adcx %%rax, %%r8\n\t" 421| 1.02M| "movl $0, %%eax\n\t" 422| 1.02M| "adox %%rax, %%r9\n\t" 423| 1.02M| "adcx %%rax, %%r9\n\t" 424| | 425| 1.02M| "movq 16(%[y]), %%rdx\n\t" // row 2: x * y[2] 426| 1.02M| "xorl %%eax, %%eax\n\t" 427| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 428| 1.02M| "adcx %%rax, %%r10\n\t" 429| 1.02M| "movq %%r10, 16(%[z])\n\t" 430| 1.02M| "mulx 8(%[x]), %%rax, %%r10\n\t" 431| 1.02M| "adox %%rcx, %%rax\n\t" 432| 1.02M| "adcx %%rax, %%r11\n\t" 433| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 434| 1.02M| "adox %%r10, %%rax\n\t" 435| 1.02M| "adcx %%rax, %%r12\n\t" 436| 1.02M| "mulx 24(%[x]), %%rax, %%r10\n\t" 437| 1.02M| "adox %%rcx, %%rax\n\t" 438| 1.02M| "adcx %%rax, %%r13\n\t" 439| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 440| 1.02M| "adox %%r10, %%rax\n\t" 441| 1.02M| "adcx %%rax, %%r8\n\t" 442| 1.02M| "mulx 40(%[x]), %%rax, %%r10\n\t" 443| 1.02M| "adox %%rcx, %%rax\n\t" 444| 1.02M| "adcx %%rax, %%r9\n\t" 445| 1.02M| "movl $0, %%eax\n\t" 446| 1.02M| "adox %%rax, %%r10\n\t" 447| 1.02M| "adcx %%rax, %%r10\n\t" 448| | 449| 1.02M| "movq 24(%[y]), %%rdx\n\t" // row 3: x * y[3] 450| 1.02M| "xorl %%eax, %%eax\n\t" 451| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 452| 1.02M| "adcx %%rax, %%r11\n\t" 453| 1.02M| "movq %%r11, 24(%[z])\n\t" 454| 1.02M| "mulx 8(%[x]), %%rax, %%r11\n\t" 455| 1.02M| "adox %%rcx, %%rax\n\t" 456| 1.02M| "adcx %%rax, %%r12\n\t" 457| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 458| 1.02M| "adox %%r11, %%rax\n\t" 459| 1.02M| "adcx %%rax, %%r13\n\t" 460| 1.02M| "mulx 24(%[x]), %%rax, %%r11\n\t" 461| 1.02M| "adox %%rcx, %%rax\n\t" 462| 1.02M| "adcx %%rax, %%r8\n\t" 463| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 464| 1.02M| "adox %%r11, %%rax\n\t" 465| 1.02M| "adcx %%rax, %%r9\n\t" 466| 1.02M| "mulx 40(%[x]), %%rax, %%r11\n\t" 467| 1.02M| "adox %%rcx, %%rax\n\t" 468| 1.02M| "adcx %%rax, %%r10\n\t" 469| 1.02M| "movl $0, %%eax\n\t" 470| 1.02M| "adox %%rax, %%r11\n\t" 471| 1.02M| "adcx %%rax, %%r11\n\t" 472| | 473| 1.02M| "movq 32(%[y]), %%rdx\n\t" // row 4: x * y[4] 474| 1.02M| "xorl %%eax, %%eax\n\t" 475| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 476| 1.02M| "adcx %%rax, %%r12\n\t" 477| 1.02M| "movq %%r12, 32(%[z])\n\t" 478| 1.02M| "mulx 8(%[x]), %%rax, %%r12\n\t" 479| 1.02M| "adox %%rcx, %%rax\n\t" 480| 1.02M| "adcx %%rax, %%r13\n\t" 481| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 482| 1.02M| "adox %%r12, %%rax\n\t" 483| 1.02M| "adcx %%rax, %%r8\n\t" 484| 1.02M| "mulx 24(%[x]), %%rax, %%r12\n\t" 485| 1.02M| "adox %%rcx, %%rax\n\t" 486| 1.02M| "adcx %%rax, %%r9\n\t" 487| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 488| 1.02M| "adox %%r12, %%rax\n\t" 489| 1.02M| "adcx %%rax, %%r10\n\t" 490| 1.02M| "mulx 40(%[x]), %%rax, %%r12\n\t" 491| 1.02M| "adox %%rcx, %%rax\n\t" 492| 1.02M| "adcx %%rax, %%r11\n\t" 493| 1.02M| "movl $0, %%eax\n\t" 494| 1.02M| "adox %%rax, %%r12\n\t" 495| 1.02M| "adcx %%rax, %%r12\n\t" 496| | 497| 1.02M| "movq 40(%[y]), %%rdx\n\t" // row 5: x * y[5] 498| 1.02M| "xorl %%eax, %%eax\n\t" 499| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 500| 1.02M| "adcx %%rax, %%r13\n\t" 501| 1.02M| "movq %%r13, 40(%[z])\n\t" 502| 1.02M| "mulx 8(%[x]), %%rax, %%r13\n\t" 503| 1.02M| "adox %%rcx, %%rax\n\t" 504| 1.02M| "adcx %%rax, %%r8\n\t" 505| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 506| 1.02M| "adox %%r13, %%rax\n\t" 507| 1.02M| "adcx %%rax, %%r9\n\t" 508| 1.02M| "mulx 24(%[x]), %%rax, %%r13\n\t" 509| 1.02M| "adox %%rcx, %%rax\n\t" 510| 1.02M| "adcx %%rax, %%r10\n\t" 511| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 512| 1.02M| "adox %%r13, %%rax\n\t" 513| 1.02M| "adcx %%rax, %%r11\n\t" 514| 1.02M| "mulx 40(%[x]), %%rax, %%r13\n\t" 515| 1.02M| "adox %%rcx, %%rax\n\t" 516| 1.02M| "adcx %%rax, %%r12\n\t" 517| 1.02M| "movl $0, %%eax\n\t" 518| 1.02M| "adox %%rax, %%r13\n\t" 519| 1.02M| "adcx %%rax, %%r13\n\t" 520| | 521| 1.02M| "movq %%r8, 48(%[z])\n\t" 522| 1.02M| "movq %%r9, 56(%[z])\n\t" 523| 1.02M| "movq %%r10, 64(%[z])\n\t" 524| 1.02M| "movq %%r11, 72(%[z])\n\t" 525| 1.02M| "movq %%r12, 80(%[z])\n\t" 526| 1.02M| "movq %%r13, 88(%[z])\n\t" 527| 1.02M| : 528| 1.02M| : [z] "r"(z), [x] "r"(x), [y] "r"(y) 529| 1.02M| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "cc", "memory"); 530| | // clang-format on 531| 1.02M|} _ZN5Botan16bigint_mulx_sqr8EPmPKm: 533| 21.1k|void bigint_mulx_sqr8(word z[16], const word x[8]) { 534| | // clang-format off 535| 21.1k| asm( 536| 21.1k| "xorl %%r9d, %%r9d\n\t" 537| 21.1k| "xorl %%r10d, %%r10d\n\t" 538| 21.1k| "xorl %%r11d, %%r11d\n\t" 539| 21.1k| "xorl %%r12d, %%r12d\n\t" 540| 21.1k| "xorl %%r13d, %%r13d\n\t" 541| 21.1k| "xorl %%r14d, %%r14d\n\t" 542| 21.1k| "xorl %%r8d, %%r8d\n\t" 543| | 544| 21.1k| "movq 0(%[x]), %%rdx\n\t" // x[0] * x[1..7] 545| 21.1k| "xorl %%eax, %%eax\n\t" 546| 21.1k| "mulx 8(%[x]), %%rax, %%rcx\n\t" 547| 21.1k| "adcx %%rax, %%r9\n\t" 548| 21.1k| "movq %%r9, 8(%[z])\n\t" 549| 21.1k| "mulx 16(%[x]), %%rax, %%r9\n\t" 550| 21.1k| "adox %%rcx, %%rax\n\t" 551| 21.1k| "adcx %%rax, %%r10\n\t" 552| 21.1k| "mulx 24(%[x]), %%rax, %%rcx\n\t" 553| 21.1k| "adox %%r9, %%rax\n\t" 554| 21.1k| "adcx %%rax, %%r11\n\t" 555| 21.1k| "mulx 32(%[x]), %%rax, %%r9\n\t" 556| 21.1k| "adox %%rcx, %%rax\n\t" 557| 21.1k| "adcx %%rax, %%r12\n\t" 558| 21.1k| "mulx 40(%[x]), %%rax, %%rcx\n\t" 559| 21.1k| "adox %%r9, %%rax\n\t" 560| 21.1k| "adcx %%rax, %%r13\n\t" 561| 21.1k| "mulx 48(%[x]), %%rax, %%r9\n\t" 562| 21.1k| "adox %%rcx, %%rax\n\t" 563| 21.1k| "adcx %%rax, %%r14\n\t" 564| 21.1k| "mulx 56(%[x]), %%rax, %%rcx\n\t" 565| 21.1k| "adox %%r9, %%rax\n\t" 566| 21.1k| "adcx %%rax, %%r8\n\t" 567| 21.1k| "movl $0, %%eax\n\t" 568| 21.1k| "adox %%rax, %%rcx\n\t" 569| 21.1k| "adcx %%rax, %%rcx\n\t" 570| 21.1k| "movq %%rcx, %%r9\n\t" 571| 21.1k| "movq %%r10, 16(%[z])\n\t" 572| | 573| 21.1k| "movq 8(%[x]), %%rdx\n\t" // x[1] * x[2..7] 574| 21.1k| "xorl %%eax, %%eax\n\t" 575| 21.1k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 576| 21.1k| "adcx %%rax, %%r11\n\t" 577| 21.1k| "movq %%r11, 24(%[z])\n\t" 578| 21.1k| "mulx 24(%[x]), %%rax, %%r10\n\t" 579| 21.1k| "adox %%rcx, %%rax\n\t" 580| 21.1k| "adcx %%rax, %%r12\n\t" 581| 21.1k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 582| 21.1k| "adox %%r10, %%rax\n\t" 583| 21.1k| "adcx %%rax, %%r13\n\t" 584| 21.1k| "mulx 40(%[x]), %%rax, %%r10\n\t" 585| 21.1k| "adox %%rcx, %%rax\n\t" 586| 21.1k| "adcx %%rax, %%r14\n\t" 587| 21.1k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 588| 21.1k| "adox %%r10, %%rax\n\t" 589| 21.1k| "adcx %%rax, %%r8\n\t" 590| 21.1k| "mulx 56(%[x]), %%rax, %%r10\n\t" 591| 21.1k| "adox %%rcx, %%rax\n\t" 592| 21.1k| "adcx %%rax, %%r9\n\t" 593| 21.1k| "movl $0, %%eax\n\t" 594| 21.1k| "adox %%rax, %%r10\n\t" 595| 21.1k| "adcx %%rax, %%r10\n\t" 596| 21.1k| "movq %%r12, 32(%[z])\n\t" 597| | 598| 21.1k| "movq 16(%[x]), %%rdx\n\t" // x[2] * x[3..7] 599| 21.1k| "xorl %%eax, %%eax\n\t" 600| 21.1k| "mulx 24(%[x]), %%rax, %%rcx\n\t" 601| 21.1k| "adcx %%rax, %%r13\n\t" 602| 21.1k| "movq %%r13, 40(%[z])\n\t" 603| 21.1k| "mulx 32(%[x]), %%rax, %%r11\n\t" 604| 21.1k| "adox %%rcx, %%rax\n\t" 605| 21.1k| "adcx %%rax, %%r14\n\t" 606| 21.1k| "mulx 40(%[x]), %%rax, %%rcx\n\t" 607| 21.1k| "adox %%r11, %%rax\n\t" 608| 21.1k| "adcx %%rax, %%r8\n\t" 609| 21.1k| "mulx 48(%[x]), %%rax, %%r11\n\t" 610| 21.1k| "adox %%rcx, %%rax\n\t" 611| 21.1k| "adcx %%rax, %%r9\n\t" 612| 21.1k| "mulx 56(%[x]), %%rax, %%rcx\n\t" 613| 21.1k| "adox %%r11, %%rax\n\t" 614| 21.1k| "adcx %%rax, %%r10\n\t" 615| 21.1k| "movl $0, %%eax\n\t" 616| 21.1k| "adox %%rax, %%rcx\n\t" 617| 21.1k| "adcx %%rax, %%rcx\n\t" 618| 21.1k| "movq %%rcx, %%r11\n\t" 619| 21.1k| "movq %%r14, 48(%[z])\n\t" 620| | 621| 21.1k| "movq 24(%[x]), %%rdx\n\t" // x[3] * x[4..7] 622| 21.1k| "xorl %%eax, %%eax\n\t" 623| 21.1k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 624| 21.1k| "adcx %%rax, %%r8\n\t" 625| 21.1k| "movq %%r8, 56(%[z])\n\t" 626| 21.1k| "mulx 40(%[x]), %%rax, %%r12\n\t" 627| 21.1k| "adox %%rcx, %%rax\n\t" 628| 21.1k| "adcx %%rax, %%r9\n\t" 629| 21.1k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 630| 21.1k| "adox %%r12, %%rax\n\t" 631| 21.1k| "adcx %%rax, %%r10\n\t" 632| 21.1k| "mulx 56(%[x]), %%rax, %%r12\n\t" 633| 21.1k| "adox %%rcx, %%rax\n\t" 634| 21.1k| "adcx %%rax, %%r11\n\t" 635| 21.1k| "movl $0, %%eax\n\t" 636| 21.1k| "adox %%rax, %%r12\n\t" 637| 21.1k| "adcx %%rax, %%r12\n\t" 638| 21.1k| "movq %%r9, 64(%[z])\n\t" 639| | 640| 21.1k| "movq 32(%[x]), %%rdx\n\t" // x[4] * x[5..7] 641| 21.1k| "xorl %%eax, %%eax\n\t" 642| 21.1k| "mulx 40(%[x]), %%rax, %%rcx\n\t" 643| 21.1k| "adcx %%rax, %%r10\n\t" 644| 21.1k| "movq %%r10, 72(%[z])\n\t" 645| 21.1k| "mulx 48(%[x]), %%rax, %%r13\n\t" 646| 21.1k| "adox %%rcx, %%rax\n\t" 647| 21.1k| "adcx %%rax, %%r11\n\t" 648| 21.1k| "mulx 56(%[x]), %%rax, %%rcx\n\t" 649| 21.1k| "adox %%r13, %%rax\n\t" 650| 21.1k| "adcx %%rax, %%r12\n\t" 651| 21.1k| "movl $0, %%eax\n\t" 652| 21.1k| "adox %%rax, %%rcx\n\t" 653| 21.1k| "adcx %%rax, %%rcx\n\t" 654| 21.1k| "movq %%rcx, %%r13\n\t" 655| 21.1k| "movq %%r11, 80(%[z])\n\t" 656| | 657| 21.1k| "movq 40(%[x]), %%rdx\n\t" // x[5] * x[6..7] 658| 21.1k| "xorl %%eax, %%eax\n\t" 659| 21.1k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 660| 21.1k| "adcx %%rax, %%r12\n\t" 661| 21.1k| "movq %%r12, 88(%[z])\n\t" 662| 21.1k| "mulx 56(%[x]), %%rax, %%r14\n\t" 663| 21.1k| "adox %%rcx, %%rax\n\t" 664| 21.1k| "adcx %%rax, %%r13\n\t" 665| 21.1k| "movl $0, %%eax\n\t" 666| 21.1k| "adox %%rax, %%r14\n\t" 667| 21.1k| "adcx %%rax, %%r14\n\t" 668| 21.1k| "movq %%r13, 96(%[z])\n\t" 669| | 670| 21.1k| "movq 48(%[x]), %%rdx\n\t" // x[6] * x[7..7] 671| 21.1k| "xorl %%eax, %%eax\n\t" 672| 21.1k| "mulx 56(%[x]), %%rax, %%rcx\n\t" 673| 21.1k| "adcx %%rax, %%r14\n\t" 674| 21.1k| "movq %%r14, 104(%[z])\n\t" 675| 21.1k| "movl $0, %%eax\n\t" 676| 21.1k| "adox %%rax, %%rcx\n\t" 677| 21.1k| "adcx %%rax, %%rcx\n\t" 678| 21.1k| "movq %%rcx, %%r8\n\t" 679| 21.1k| "movq %%r8, 112(%[z])\n\t" 680| | 681| 21.1k| "movq $0, 120(%[z])\n\t" 682| 21.1k| "xorl %%eax, %%eax\n\t" // double the cross products and add the squares 683| 21.1k| "movq 0(%[x]), %%rdx\n\t" 684| 21.1k| "mulx %%rdx, %%rax, %%rcx\n\t" 685| 21.1k| "movq %%rax, 0(%[z])\n\t" 686| 21.1k| "movq 8(%[z]), %%r8\n\t" 687| 21.1k| "adcx %%r8, %%r8\n\t" 688| 21.1k| "adox %%rcx, %%r8\n\t" 689| 21.1k| "movq %%r8, 8(%[z])\n\t" 690| 21.1k| "movq 8(%[x]), %%rdx\n\t" 691| 21.1k| "mulx %%rdx, %%rax, %%rcx\n\t" 692| 21.1k| "movq 16(%[z]), %%r8\n\t" 693| 21.1k| "adcx %%r8, %%r8\n\t" 694| 21.1k| "adox %%rax, %%r8\n\t" 695| 21.1k| "movq %%r8, 16(%[z])\n\t" 696| 21.1k| "movq 24(%[z]), %%r8\n\t" 697| 21.1k| "adcx %%r8, %%r8\n\t" 698| 21.1k| "adox %%rcx, %%r8\n\t" 699| 21.1k| "movq %%r8, 24(%[z])\n\t" 700| 21.1k| "movq 16(%[x]), %%rdx\n\t" 701| 21.1k| "mulx %%rdx, %%rax, %%rcx\n\t" 702| 21.1k| "movq 32(%[z]), %%r8\n\t" 703| 21.1k| "adcx %%r8, %%r8\n\t" 704| 21.1k| "adox %%rax, %%r8\n\t" 705| 21.1k| "movq %%r8, 32(%[z])\n\t" 706| 21.1k| "movq 40(%[z]), %%r8\n\t" 707| 21.1k| "adcx %%r8, %%r8\n\t" 708| 21.1k| "adox %%rcx, %%r8\n\t" 709| 21.1k| "movq %%r8, 40(%[z])\n\t" 710| 21.1k| "movq 24(%[x]), %%rdx\n\t" 711| 21.1k| "mulx %%rdx, %%rax, %%rcx\n\t" 712| 21.1k| "movq 48(%[z]), %%r8\n\t" 713| 21.1k| "adcx %%r8, %%r8\n\t" 714| 21.1k| "adox %%rax, %%r8\n\t" 715| 21.1k| "movq %%r8, 48(%[z])\n\t" 716| 21.1k| "movq 56(%[z]), %%r8\n\t" 717| 21.1k| "adcx %%r8, %%r8\n\t" 718| 21.1k| "adox %%rcx, %%r8\n\t" 719| 21.1k| "movq %%r8, 56(%[z])\n\t" 720| 21.1k| "movq 32(%[x]), %%rdx\n\t" 721| 21.1k| "mulx %%rdx, %%rax, %%rcx\n\t" 722| 21.1k| "movq 64(%[z]), %%r8\n\t" 723| 21.1k| "adcx %%r8, %%r8\n\t" 724| 21.1k| "adox %%rax, %%r8\n\t" 725| 21.1k| "movq %%r8, 64(%[z])\n\t" 726| 21.1k| "movq 72(%[z]), %%r8\n\t" 727| 21.1k| "adcx %%r8, %%r8\n\t" 728| 21.1k| "adox %%rcx, %%r8\n\t" 729| 21.1k| "movq %%r8, 72(%[z])\n\t" 730| 21.1k| "movq 40(%[x]), %%rdx\n\t" 731| 21.1k| "mulx %%rdx, %%rax, %%rcx\n\t" 732| 21.1k| "movq 80(%[z]), %%r8\n\t" 733| 21.1k| "adcx %%r8, %%r8\n\t" 734| 21.1k| "adox %%rax, %%r8\n\t" 735| 21.1k| "movq %%r8, 80(%[z])\n\t" 736| 21.1k| "movq 88(%[z]), %%r8\n\t" 737| 21.1k| "adcx %%r8, %%r8\n\t" 738| 21.1k| "adox %%rcx, %%r8\n\t" 739| 21.1k| "movq %%r8, 88(%[z])\n\t" 740| 21.1k| "movq 48(%[x]), %%rdx\n\t" 741| 21.1k| "mulx %%rdx, %%rax, %%rcx\n\t" 742| 21.1k| "movq 96(%[z]), %%r8\n\t" 743| 21.1k| "adcx %%r8, %%r8\n\t" 744| 21.1k| "adox %%rax, %%r8\n\t" 745| 21.1k| "movq %%r8, 96(%[z])\n\t" 746| 21.1k| "movq 104(%[z]), %%r8\n\t" 747| 21.1k| "adcx %%r8, %%r8\n\t" 748| 21.1k| "adox %%rcx, %%r8\n\t" 749| 21.1k| "movq %%r8, 104(%[z])\n\t" 750| 21.1k| "movq 56(%[x]), %%rdx\n\t" 751| 21.1k| "mulx %%rdx, %%rax, %%rcx\n\t" 752| 21.1k| "movq 112(%[z]), %%r8\n\t" 753| 21.1k| "adcx %%r8, %%r8\n\t" 754| 21.1k| "adox %%rax, %%r8\n\t" 755| 21.1k| "movq %%r8, 112(%[z])\n\t" 756| 21.1k| "movq 120(%[z]), %%r8\n\t" 757| 21.1k| "adcx %%r8, %%r8\n\t" 758| 21.1k| "adox %%rcx, %%r8\n\t" 759| 21.1k| "movq %%r8, 120(%[z])\n\t" 760| 21.1k| : 761| 21.1k| : [z] "r"(z), [x] "r"(x) 762| 21.1k| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "r14", "cc", "memory"); 763| | // clang-format on 764| 21.1k|} _ZN5Botan16bigint_mulx_mul8EPmPKmS2_: 766| 43.3k|void bigint_mulx_mul8(word z[16], const word x[8], const word y[8]) { 767| | // clang-format off 768| 43.3k| asm( 769| 43.3k| "xorl %%r8d, %%r8d\n\t" 770| 43.3k| "xorl %%r9d, %%r9d\n\t" 771| 43.3k| "xorl %%r10d, %%r10d\n\t" 772| 43.3k| "xorl %%r11d, %%r11d\n\t" 773| 43.3k| "xorl %%r12d, %%r12d\n\t" 774| 43.3k| "xorl %%r13d, %%r13d\n\t" 775| 43.3k| "xorl %%r14d, %%r14d\n\t" 776| 43.3k| "xorl %%r15d, %%r15d\n\t" 777| | 778| 43.3k| "movq 0(%[y]), %%rdx\n\t" // row 0: x * y[0] 779| 43.3k| "xorl %%eax, %%eax\n\t" 780| 43.3k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 781| 43.3k| "adcx %%rax, %%r8\n\t" 782| 43.3k| "movq %%r8, 0(%[z])\n\t" 783| 43.3k| "mulx 8(%[x]), %%rax, %%r8\n\t" 784| 43.3k| "adox %%rcx, %%rax\n\t" 785| 43.3k| "adcx %%rax, %%r9\n\t" 786| 43.3k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 787| 43.3k| "adox %%r8, %%rax\n\t" 788| 43.3k| "adcx %%rax, %%r10\n\t" 789| 43.3k| "mulx 24(%[x]), %%rax, %%r8\n\t" 790| 43.3k| "adox %%rcx, %%rax\n\t" 791| 43.3k| "adcx %%rax, %%r11\n\t" 792| 43.3k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 793| 43.3k| "adox %%r8, %%rax\n\t" 794| 43.3k| "adcx %%rax, %%r12\n\t" 795| 43.3k| "mulx 40(%[x]), %%rax, %%r8\n\t" 796| 43.3k| "adox %%rcx, %%rax\n\t" 797| 43.3k| "adcx %%rax, %%r13\n\t" 798| 43.3k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 799| 43.3k| "adox %%r8, %%rax\n\t" 800| 43.3k| "adcx %%rax, %%r14\n\t" 801| 43.3k| "mulx 56(%[x]), %%rax, %%r8\n\t" 802| 43.3k| "adox %%rcx, %%rax\n\t" 803| 43.3k| "adcx %%rax, %%r15\n\t" 804| 43.3k| "movl $0, %%eax\n\t" 805| 43.3k| "adox %%rax, %%r8\n\t" 806| 43.3k| "adcx %%rax, %%r8\n\t" 807| | 808| 43.3k| "movq 8(%[y]), %%rdx\n\t" // row 1: x * y[1] 809| 43.3k| "xorl %%eax, %%eax\n\t" 810| 43.3k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 811| 43.3k| "adcx %%rax, %%r9\n\t" 812| 43.3k| "movq %%r9, 8(%[z])\n\t" 813| 43.3k| "mulx 8(%[x]), %%rax, %%r9\n\t" 814| 43.3k| "adox %%rcx, %%rax\n\t" 815| 43.3k| "adcx %%rax, %%r10\n\t" 816| 43.3k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 817| 43.3k| "adox %%r9, %%rax\n\t" 818| 43.3k| "adcx %%rax, %%r11\n\t" 819| 43.3k| "mulx 24(%[x]), %%rax, %%r9\n\t" 820| 43.3k| "adox %%rcx, %%rax\n\t" 821| 43.3k| "adcx %%rax, %%r12\n\t" 822| 43.3k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 823| 43.3k| "adox %%r9, %%rax\n\t" 824| 43.3k| "adcx %%rax, %%r13\n\t" 825| 43.3k| "mulx 40(%[x]), %%rax, %%r9\n\t" 826| 43.3k| "adox %%rcx, %%rax\n\t" 827| 43.3k| "adcx %%rax, %%r14\n\t" 828| 43.3k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 829| 43.3k| "adox %%r9, %%rax\n\t" 830| 43.3k| "adcx %%rax, %%r15\n\t" 831| 43.3k| "mulx 56(%[x]), %%rax, %%r9\n\t" 832| 43.3k| "adox %%rcx, %%rax\n\t" 833| 43.3k| "adcx %%rax, %%r8\n\t" 834| 43.3k| "movl $0, %%eax\n\t" 835| 43.3k| "adox %%rax, %%r9\n\t" 836| 43.3k| "adcx %%rax, %%r9\n\t" 837| | 838| 43.3k| "movq 16(%[y]), %%rdx\n\t" // row 2: x * y[2] 839| 43.3k| "xorl %%eax, %%eax\n\t" 840| 43.3k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 841| 43.3k| "adcx %%rax, %%r10\n\t" 842| 43.3k| "movq %%r10, 16(%[z])\n\t" 843| 43.3k| "mulx 8(%[x]), %%rax, %%r10\n\t" 844| 43.3k| "adox %%rcx, %%rax\n\t" 845| 43.3k| "adcx %%rax, %%r11\n\t" 846| 43.3k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 847| 43.3k| "adox %%r10, %%rax\n\t" 848| 43.3k| "adcx %%rax, %%r12\n\t" 849| 43.3k| "mulx 24(%[x]), %%rax, %%r10\n\t" 850| 43.3k| "adox %%rcx, %%rax\n\t" 851| 43.3k| "adcx %%rax, %%r13\n\t" 852| 43.3k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 853| 43.3k| "adox %%r10, %%rax\n\t" 854| 43.3k| "adcx %%rax, %%r14\n\t" 855| 43.3k| "mulx 40(%[x]), %%rax, %%r10\n\t" 856| 43.3k| "adox %%rcx, %%rax\n\t" 857| 43.3k| "adcx %%rax, %%r15\n\t" 858| 43.3k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 859| 43.3k| "adox %%r10, %%rax\n\t" 860| 43.3k| "adcx %%rax, %%r8\n\t" 861| 43.3k| "mulx 56(%[x]), %%rax, %%r10\n\t" 862| 43.3k| "adox %%rcx, %%rax\n\t" 863| 43.3k| "adcx %%rax, %%r9\n\t" 864| 43.3k| "movl $0, %%eax\n\t" 865| 43.3k| "adox %%rax, %%r10\n\t" 866| 43.3k| "adcx %%rax, %%r10\n\t" 867| | 868| 43.3k| "movq 24(%[y]), %%rdx\n\t" // row 3: x * y[3] 869| 43.3k| "xorl %%eax, %%eax\n\t" 870| 43.3k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 871| 43.3k| "adcx %%rax, %%r11\n\t" 872| 43.3k| "movq %%r11, 24(%[z])\n\t" 873| 43.3k| "mulx 8(%[x]), %%rax, %%r11\n\t" 874| 43.3k| "adox %%rcx, %%rax\n\t" 875| 43.3k| "adcx %%rax, %%r12\n\t" 876| 43.3k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 877| 43.3k| "adox %%r11, %%rax\n\t" 878| 43.3k| "adcx %%rax, %%r13\n\t" 879| 43.3k| "mulx 24(%[x]), %%rax, %%r11\n\t" 880| 43.3k| "adox %%rcx, %%rax\n\t" 881| 43.3k| "adcx %%rax, %%r14\n\t" 882| 43.3k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 883| 43.3k| "adox %%r11, %%rax\n\t" 884| 43.3k| "adcx %%rax, %%r15\n\t" 885| 43.3k| "mulx 40(%[x]), %%rax, %%r11\n\t" 886| 43.3k| "adox %%rcx, %%rax\n\t" 887| 43.3k| "adcx %%rax, %%r8\n\t" 888| 43.3k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 889| 43.3k| "adox %%r11, %%rax\n\t" 890| 43.3k| "adcx %%rax, %%r9\n\t" 891| 43.3k| "mulx 56(%[x]), %%rax, %%r11\n\t" 892| 43.3k| "adox %%rcx, %%rax\n\t" 893| 43.3k| "adcx %%rax, %%r10\n\t" 894| 43.3k| "movl $0, %%eax\n\t" 895| 43.3k| "adox %%rax, %%r11\n\t" 896| 43.3k| "adcx %%rax, %%r11\n\t" 897| | 898| 43.3k| "movq 32(%[y]), %%rdx\n\t" // row 4: x * y[4] 899| 43.3k| "xorl %%eax, %%eax\n\t" 900| 43.3k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 901| 43.3k| "adcx %%rax, %%r12\n\t" 902| 43.3k| "movq %%r12, 32(%[z])\n\t" 903| 43.3k| "mulx 8(%[x]), %%rax, %%r12\n\t" 904| 43.3k| "adox %%rcx, %%rax\n\t" 905| 43.3k| "adcx %%rax, %%r13\n\t" 906| 43.3k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 907| 43.3k| "adox %%r12, %%rax\n\t" 908| 43.3k| "adcx %%rax, %%r14\n\t" 909| 43.3k| "mulx 24(%[x]), %%rax, %%r12\n\t" 910| 43.3k| "adox %%rcx, %%rax\n\t" 911| 43.3k| "adcx %%rax, %%r15\n\t" 912| 43.3k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 913| 43.3k| "adox %%r12, %%rax\n\t" 914| 43.3k| "adcx %%rax, %%r8\n\t" 915| 43.3k| "mulx 40(%[x]), %%rax, %%r12\n\t" 916| 43.3k| "adox %%rcx, %%rax\n\t" 917| 43.3k| "adcx %%rax, %%r9\n\t" 918| 43.3k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 919| 43.3k| "adox %%r12, %%rax\n\t" 920| 43.3k| "adcx %%rax, %%r10\n\t" 921| 43.3k| "mulx 56(%[x]), %%rax, %%r12\n\t" 922| 43.3k| "adox %%rcx, %%rax\n\t" 923| 43.3k| "adcx %%rax, %%r11\n\t" 924| 43.3k| "movl $0, %%eax\n\t" 925| 43.3k| "adox %%rax, %%r12\n\t" 926| 43.3k| "adcx %%rax, %%r12\n\t" 927| | 928| 43.3k| "movq 40(%[y]), %%rdx\n\t" // row 5: x * y[5] 929| 43.3k| "xorl %%eax, %%eax\n\t" 930| 43.3k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 931| 43.3k| "adcx %%rax, %%r13\n\t" 932| 43.3k| "movq %%r13, 40(%[z])\n\t" 933| 43.3k| "mulx 8(%[x]), %%rax, %%r13\n\t" 934| 43.3k| "adox %%rcx, %%rax\n\t" 935| 43.3k| "adcx %%rax, %%r14\n\t" 936| 43.3k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 937| 43.3k| "adox %%r13, %%rax\n\t" 938| 43.3k| "adcx %%rax, %%r15\n\t" 939| 43.3k| "mulx 24(%[x]), %%rax, %%r13\n\t" 940| 43.3k| "adox %%rcx, %%rax\n\t" 941| 43.3k| "adcx %%rax, %%r8\n\t" 942| 43.3k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 943| 43.3k| "adox %%r13, %%rax\n\t" 944| 43.3k| "adcx %%rax, %%r9\n\t" 945| 43.3k| "mulx 40(%[x]), %%rax, %%r13\n\t" 946| 43.3k| "adox %%rcx, %%rax\n\t" 947| 43.3k| "adcx %%rax, %%r10\n\t" 948| 43.3k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 949| 43.3k| "adox %%r13, %%rax\n\t" 950| 43.3k| "adcx %%rax, %%r11\n\t" 951| 43.3k| "mulx 56(%[x]), %%rax, %%r13\n\t" 952| 43.3k| "adox %%rcx, %%rax\n\t" 953| 43.3k| "adcx %%rax, %%r12\n\t" 954| 43.3k| "movl $0, %%eax\n\t" 955| 43.3k| "adox %%rax, %%r13\n\t" 956| 43.3k| "adcx %%rax, %%r13\n\t" 957| | 958| 43.3k| "movq 48(%[y]), %%rdx\n\t" // row 6: x * y[6] 959| 43.3k| "xorl %%eax, %%eax\n\t" 960| 43.3k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 961| 43.3k| "adcx %%rax, %%r14\n\t" 962| 43.3k| "movq %%r14, 48(%[z])\n\t" 963| 43.3k| "mulx 8(%[x]), %%rax, %%r14\n\t" 964| 43.3k| "adox %%rcx, %%rax\n\t" 965| 43.3k| "adcx %%rax, %%r15\n\t" 966| 43.3k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 967| 43.3k| "adox %%r14, %%rax\n\t" 968| 43.3k| "adcx %%rax, %%r8\n\t" 969| 43.3k| "mulx 24(%[x]), %%rax, %%r14\n\t" 970| 43.3k| "adox %%rcx, %%rax\n\t" 971| 43.3k| "adcx %%rax, %%r9\n\t" 972| 43.3k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 973| 43.3k| "adox %%r14, %%rax\n\t" 974| 43.3k| "adcx %%rax, %%r10\n\t" 975| 43.3k| "mulx 40(%[x]), %%rax, %%r14\n\t" 976| 43.3k| "adox %%rcx, %%rax\n\t" 977| 43.3k| "adcx %%rax, %%r11\n\t" 978| 43.3k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 979| 43.3k| "adox %%r14, %%rax\n\t" 980| 43.3k| "adcx %%rax, %%r12\n\t" 981| 43.3k| "mulx 56(%[x]), %%rax, %%r14\n\t" 982| 43.3k| "adox %%rcx, %%rax\n\t" 983| 43.3k| "adcx %%rax, %%r13\n\t" 984| 43.3k| "movl $0, %%eax\n\t" 985| 43.3k| "adox %%rax, %%r14\n\t" 986| 43.3k| "adcx %%rax, %%r14\n\t" 987| | 988| 43.3k| "movq 56(%[y]), %%rdx\n\t" // row 7: x * y[7] 989| 43.3k| "xorl %%eax, %%eax\n\t" 990| 43.3k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 991| 43.3k| "adcx %%rax, %%r15\n\t" 992| 43.3k| "movq %%r15, 56(%[z])\n\t" 993| 43.3k| "mulx 8(%[x]), %%rax, %%r15\n\t" 994| 43.3k| "adox %%rcx, %%rax\n\t" 995| 43.3k| "adcx %%rax, %%r8\n\t" 996| 43.3k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 997| 43.3k| "adox %%r15, %%rax\n\t" 998| 43.3k| "adcx %%rax, %%r9\n\t" 999| 43.3k| "mulx 24(%[x]), %%rax, %%r15\n\t" 1000| 43.3k| "adox %%rcx, %%rax\n\t" 1001| 43.3k| "adcx %%rax, %%r10\n\t" 1002| 43.3k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1003| 43.3k| "adox %%r15, %%rax\n\t" 1004| 43.3k| "adcx %%rax, %%r11\n\t" 1005| 43.3k| "mulx 40(%[x]), %%rax, %%r15\n\t" 1006| 43.3k| "adox %%rcx, %%rax\n\t" 1007| 43.3k| "adcx %%rax, %%r12\n\t" 1008| 43.3k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1009| 43.3k| "adox %%r15, %%rax\n\t" 1010| 43.3k| "adcx %%rax, %%r13\n\t" 1011| 43.3k| "mulx 56(%[x]), %%rax, %%r15\n\t" 1012| 43.3k| "adox %%rcx, %%rax\n\t" 1013| 43.3k| "adcx %%rax, %%r14\n\t" 1014| 43.3k| "movl $0, %%eax\n\t" 1015| 43.3k| "adox %%rax, %%r15\n\t" 1016| 43.3k| "adcx %%rax, %%r15\n\t" 1017| | 1018| 43.3k| "movq %%r8, 64(%[z])\n\t" 1019| 43.3k| "movq %%r9, 72(%[z])\n\t" 1020| 43.3k| "movq %%r10, 80(%[z])\n\t" 1021| 43.3k| "movq %%r11, 88(%[z])\n\t" 1022| 43.3k| "movq %%r12, 96(%[z])\n\t" 1023| 43.3k| "movq %%r13, 104(%[z])\n\t" 1024| 43.3k| "movq %%r14, 112(%[z])\n\t" 1025| 43.3k| "movq %%r15, 120(%[z])\n\t" 1026| 43.3k| : 1027| 43.3k| : [z] "r"(z), [x] "r"(x), [y] "r"(y) 1028| 43.3k| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15", "cc", "memory"); 1029| | // clang-format on 1030| 43.3k|} _ZN5Botan16bigint_mulx_sqr9EPmPKm: 1032| 800k|void bigint_mulx_sqr9(word z[18], const word x[9]) { 1033| | // clang-format off 1034| 800k| asm( 1035| 800k| "xorl %%r9d, %%r9d\n\t" 1036| 800k| "xorl %%r10d, %%r10d\n\t" 1037| 800k| "xorl %%r11d, %%r11d\n\t" 1038| 800k| "xorl %%r12d, %%r12d\n\t" 1039| 800k| "xorl %%r13d, %%r13d\n\t" 1040| 800k| "xorl %%r14d, %%r14d\n\t" 1041| 800k| "xorl %%r15d, %%r15d\n\t" 1042| 800k| "xorl %%r8d, %%r8d\n\t" 1043| | 1044| 800k| "movq 0(%[x]), %%rdx\n\t" // x[0] * x[1..8] 1045| 800k| "xorl %%eax, %%eax\n\t" 1046| 800k| "mulx 8(%[x]), %%rax, %%rcx\n\t" 1047| 800k| "adcx %%rax, %%r9\n\t" 1048| 800k| "movq %%r9, 8(%[z])\n\t" 1049| 800k| "mulx 16(%[x]), %%rax, %%r9\n\t" 1050| 800k| "adox %%rcx, %%rax\n\t" 1051| 800k| "adcx %%rax, %%r10\n\t" 1052| 800k| "mulx 24(%[x]), %%rax, %%rcx\n\t" 1053| 800k| "adox %%r9, %%rax\n\t" 1054| 800k| "adcx %%rax, %%r11\n\t" 1055| 800k| "mulx 32(%[x]), %%rax, %%r9\n\t" 1056| 800k| "adox %%rcx, %%rax\n\t" 1057| 800k| "adcx %%rax, %%r12\n\t" 1058| 800k| "mulx 40(%[x]), %%rax, %%rcx\n\t" 1059| 800k| "adox %%r9, %%rax\n\t" 1060| 800k| "adcx %%rax, %%r13\n\t" 1061| 800k| "mulx 48(%[x]), %%rax, %%r9\n\t" 1062| 800k| "adox %%rcx, %%rax\n\t" 1063| 800k| "adcx %%rax, %%r14\n\t" 1064| 800k| "mulx 56(%[x]), %%rax, %%rcx\n\t" 1065| 800k| "adox %%r9, %%rax\n\t" 1066| 800k| "adcx %%rax, %%r15\n\t" 1067| 800k| "mulx 64(%[x]), %%rax, %%r9\n\t" 1068| 800k| "adox %%rcx, %%rax\n\t" 1069| 800k| "adcx %%rax, %%r8\n\t" 1070| 800k| "movl $0, %%eax\n\t" 1071| 800k| "adox %%rax, %%r9\n\t" 1072| 800k| "adcx %%rax, %%r9\n\t" 1073| 800k| "movq %%r10, 16(%[z])\n\t" 1074| | 1075| 800k| "movq 8(%[x]), %%rdx\n\t" // x[1] * x[2..8] 1076| 800k| "xorl %%eax, %%eax\n\t" 1077| 800k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1078| 800k| "adcx %%rax, %%r11\n\t" 1079| 800k| "movq %%r11, 24(%[z])\n\t" 1080| 800k| "mulx 24(%[x]), %%rax, %%r10\n\t" 1081| 800k| "adox %%rcx, %%rax\n\t" 1082| 800k| "adcx %%rax, %%r12\n\t" 1083| 800k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1084| 800k| "adox %%r10, %%rax\n\t" 1085| 800k| "adcx %%rax, %%r13\n\t" 1086| 800k| "mulx 40(%[x]), %%rax, %%r10\n\t" 1087| 800k| "adox %%rcx, %%rax\n\t" 1088| 800k| "adcx %%rax, %%r14\n\t" 1089| 800k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1090| 800k| "adox %%r10, %%rax\n\t" 1091| 800k| "adcx %%rax, %%r15\n\t" 1092| 800k| "mulx 56(%[x]), %%rax, %%r10\n\t" 1093| 800k| "adox %%rcx, %%rax\n\t" 1094| 800k| "adcx %%rax, %%r8\n\t" 1095| 800k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1096| 800k| "adox %%r10, %%rax\n\t" 1097| 800k| "adcx %%rax, %%r9\n\t" 1098| 800k| "movl $0, %%eax\n\t" 1099| 800k| "adox %%rax, %%rcx\n\t" 1100| 800k| "adcx %%rax, %%rcx\n\t" 1101| 800k| "movq %%rcx, %%r10\n\t" 1102| 800k| "movq %%r12, 32(%[z])\n\t" 1103| | 1104| 800k| "movq 16(%[x]), %%rdx\n\t" // x[2] * x[3..8] 1105| 800k| "xorl %%eax, %%eax\n\t" 1106| 800k| "mulx 24(%[x]), %%rax, %%rcx\n\t" 1107| 800k| "adcx %%rax, %%r13\n\t" 1108| 800k| "movq %%r13, 40(%[z])\n\t" 1109| 800k| "mulx 32(%[x]), %%rax, %%r11\n\t" 1110| 800k| "adox %%rcx, %%rax\n\t" 1111| 800k| "adcx %%rax, %%r14\n\t" 1112| 800k| "mulx 40(%[x]), %%rax, %%rcx\n\t" 1113| 800k| "adox %%r11, %%rax\n\t" 1114| 800k| "adcx %%rax, %%r15\n\t" 1115| 800k| "mulx 48(%[x]), %%rax, %%r11\n\t" 1116| 800k| "adox %%rcx, %%rax\n\t" 1117| 800k| "adcx %%rax, %%r8\n\t" 1118| 800k| "mulx 56(%[x]), %%rax, %%rcx\n\t" 1119| 800k| "adox %%r11, %%rax\n\t" 1120| 800k| "adcx %%rax, %%r9\n\t" 1121| 800k| "mulx 64(%[x]), %%rax, %%r11\n\t" 1122| 800k| "adox %%rcx, %%rax\n\t" 1123| 800k| "adcx %%rax, %%r10\n\t" 1124| 800k| "movl $0, %%eax\n\t" 1125| 800k| "adox %%rax, %%r11\n\t" 1126| 800k| "adcx %%rax, %%r11\n\t" 1127| 800k| "movq %%r14, 48(%[z])\n\t" 1128| | 1129| 800k| "movq 24(%[x]), %%rdx\n\t" // x[3] * x[4..8] 1130| 800k| "xorl %%eax, %%eax\n\t" 1131| 800k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1132| 800k| "adcx %%rax, %%r15\n\t" 1133| 800k| "movq %%r15, 56(%[z])\n\t" 1134| 800k| "mulx 40(%[x]), %%rax, %%r12\n\t" 1135| 800k| "adox %%rcx, %%rax\n\t" 1136| 800k| "adcx %%rax, %%r8\n\t" 1137| 800k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1138| 800k| "adox %%r12, %%rax\n\t" 1139| 800k| "adcx %%rax, %%r9\n\t" 1140| 800k| "mulx 56(%[x]), %%rax, %%r12\n\t" 1141| 800k| "adox %%rcx, %%rax\n\t" 1142| 800k| "adcx %%rax, %%r10\n\t" 1143| 800k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1144| 800k| "adox %%r12, %%rax\n\t" 1145| 800k| "adcx %%rax, %%r11\n\t" 1146| 800k| "movl $0, %%eax\n\t" 1147| 800k| "adox %%rax, %%rcx\n\t" 1148| 800k| "adcx %%rax, %%rcx\n\t" 1149| 800k| "movq %%rcx, %%r12\n\t" 1150| 800k| "movq %%r8, 64(%[z])\n\t" 1151| | 1152| 800k| "movq 32(%[x]), %%rdx\n\t" // x[4] * x[5..8] 1153| 800k| "xorl %%eax, %%eax\n\t" 1154| 800k| "mulx 40(%[x]), %%rax, %%rcx\n\t" 1155| 800k| "adcx %%rax, %%r9\n\t" 1156| 800k| "movq %%r9, 72(%[z])\n\t" 1157| 800k| "mulx 48(%[x]), %%rax, %%r13\n\t" 1158| 800k| "adox %%rcx, %%rax\n\t" 1159| 800k| "adcx %%rax, %%r10\n\t" 1160| 800k| "mulx 56(%[x]), %%rax, %%rcx\n\t" 1161| 800k| "adox %%r13, %%rax\n\t" 1162| 800k| "adcx %%rax, %%r11\n\t" 1163| 800k| "mulx 64(%[x]), %%rax, %%r13\n\t" 1164| 800k| "adox %%rcx, %%rax\n\t" 1165| 800k| "adcx %%rax, %%r12\n\t" 1166| 800k| "movl $0, %%eax\n\t" 1167| 800k| "adox %%rax, %%r13\n\t" 1168| 800k| "adcx %%rax, %%r13\n\t" 1169| 800k| "movq %%r10, 80(%[z])\n\t" 1170| | 1171| 800k| "movq 40(%[x]), %%rdx\n\t" // x[5] * x[6..8] 1172| 800k| "xorl %%eax, %%eax\n\t" 1173| 800k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1174| 800k| "adcx %%rax, %%r11\n\t" 1175| 800k| "movq %%r11, 88(%[z])\n\t" 1176| 800k| "mulx 56(%[x]), %%rax, %%r14\n\t" 1177| 800k| "adox %%rcx, %%rax\n\t" 1178| 800k| "adcx %%rax, %%r12\n\t" 1179| 800k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1180| 800k| "adox %%r14, %%rax\n\t" 1181| 800k| "adcx %%rax, %%r13\n\t" 1182| 800k| "movl $0, %%eax\n\t" 1183| 800k| "adox %%rax, %%rcx\n\t" 1184| 800k| "adcx %%rax, %%rcx\n\t" 1185| 800k| "movq %%rcx, %%r14\n\t" 1186| 800k| "movq %%r12, 96(%[z])\n\t" 1187| | 1188| 800k| "movq 48(%[x]), %%rdx\n\t" // x[6] * x[7..8] 1189| 800k| "xorl %%eax, %%eax\n\t" 1190| 800k| "mulx 56(%[x]), %%rax, %%rcx\n\t" 1191| 800k| "adcx %%rax, %%r13\n\t" 1192| 800k| "movq %%r13, 104(%[z])\n\t" 1193| 800k| "mulx 64(%[x]), %%rax, %%r15\n\t" 1194| 800k| "adox %%rcx, %%rax\n\t" 1195| 800k| "adcx %%rax, %%r14\n\t" 1196| 800k| "movl $0, %%eax\n\t" 1197| 800k| "adox %%rax, %%r15\n\t" 1198| 800k| "adcx %%rax, %%r15\n\t" 1199| 800k| "movq %%r14, 112(%[z])\n\t" 1200| | 1201| 800k| "movq 56(%[x]), %%rdx\n\t" // x[7] * x[8..8] 1202| 800k| "xorl %%eax, %%eax\n\t" 1203| 800k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1204| 800k| "adcx %%rax, %%r15\n\t" 1205| 800k| "movq %%r15, 120(%[z])\n\t" 1206| 800k| "movl $0, %%eax\n\t" 1207| 800k| "adox %%rax, %%rcx\n\t" 1208| 800k| "adcx %%rax, %%rcx\n\t" 1209| 800k| "movq %%rcx, %%r8\n\t" 1210| 800k| "movq %%r8, 128(%[z])\n\t" 1211| | 1212| 800k| "movq $0, 136(%[z])\n\t" 1213| 800k| "xorl %%eax, %%eax\n\t" // double the cross products and add the squares 1214| 800k| "movq 0(%[x]), %%rdx\n\t" 1215| 800k| "mulx %%rdx, %%rax, %%rcx\n\t" 1216| 800k| "movq %%rax, 0(%[z])\n\t" 1217| 800k| "movq 8(%[z]), %%r8\n\t" 1218| 800k| "adcx %%r8, %%r8\n\t" 1219| 800k| "adox %%rcx, %%r8\n\t" 1220| 800k| "movq %%r8, 8(%[z])\n\t" 1221| 800k| "movq 8(%[x]), %%rdx\n\t" 1222| 800k| "mulx %%rdx, %%rax, %%rcx\n\t" 1223| 800k| "movq 16(%[z]), %%r8\n\t" 1224| 800k| "adcx %%r8, %%r8\n\t" 1225| 800k| "adox %%rax, %%r8\n\t" 1226| 800k| "movq %%r8, 16(%[z])\n\t" 1227| 800k| "movq 24(%[z]), %%r8\n\t" 1228| 800k| "adcx %%r8, %%r8\n\t" 1229| 800k| "adox %%rcx, %%r8\n\t" 1230| 800k| "movq %%r8, 24(%[z])\n\t" 1231| 800k| "movq 16(%[x]), %%rdx\n\t" 1232| 800k| "mulx %%rdx, %%rax, %%rcx\n\t" 1233| 800k| "movq 32(%[z]), %%r8\n\t" 1234| 800k| "adcx %%r8, %%r8\n\t" 1235| 800k| "adox %%rax, %%r8\n\t" 1236| 800k| "movq %%r8, 32(%[z])\n\t" 1237| 800k| "movq 40(%[z]), %%r8\n\t" 1238| 800k| "adcx %%r8, %%r8\n\t" 1239| 800k| "adox %%rcx, %%r8\n\t" 1240| 800k| "movq %%r8, 40(%[z])\n\t" 1241| 800k| "movq 24(%[x]), %%rdx\n\t" 1242| 800k| "mulx %%rdx, %%rax, %%rcx\n\t" 1243| 800k| "movq 48(%[z]), %%r8\n\t" 1244| 800k| "adcx %%r8, %%r8\n\t" 1245| 800k| "adox %%rax, %%r8\n\t" 1246| 800k| "movq %%r8, 48(%[z])\n\t" 1247| 800k| "movq 56(%[z]), %%r8\n\t" 1248| 800k| "adcx %%r8, %%r8\n\t" 1249| 800k| "adox %%rcx, %%r8\n\t" 1250| 800k| "movq %%r8, 56(%[z])\n\t" 1251| 800k| "movq 32(%[x]), %%rdx\n\t" 1252| 800k| "mulx %%rdx, %%rax, %%rcx\n\t" 1253| 800k| "movq 64(%[z]), %%r8\n\t" 1254| 800k| "adcx %%r8, %%r8\n\t" 1255| 800k| "adox %%rax, %%r8\n\t" 1256| 800k| "movq %%r8, 64(%[z])\n\t" 1257| 800k| "movq 72(%[z]), %%r8\n\t" 1258| 800k| "adcx %%r8, %%r8\n\t" 1259| 800k| "adox %%rcx, %%r8\n\t" 1260| 800k| "movq %%r8, 72(%[z])\n\t" 1261| 800k| "movq 40(%[x]), %%rdx\n\t" 1262| 800k| "mulx %%rdx, %%rax, %%rcx\n\t" 1263| 800k| "movq 80(%[z]), %%r8\n\t" 1264| 800k| "adcx %%r8, %%r8\n\t" 1265| 800k| "adox %%rax, %%r8\n\t" 1266| 800k| "movq %%r8, 80(%[z])\n\t" 1267| 800k| "movq 88(%[z]), %%r8\n\t" 1268| 800k| "adcx %%r8, %%r8\n\t" 1269| 800k| "adox %%rcx, %%r8\n\t" 1270| 800k| "movq %%r8, 88(%[z])\n\t" 1271| 800k| "movq 48(%[x]), %%rdx\n\t" 1272| 800k| "mulx %%rdx, %%rax, %%rcx\n\t" 1273| 800k| "movq 96(%[z]), %%r8\n\t" 1274| 800k| "adcx %%r8, %%r8\n\t" 1275| 800k| "adox %%rax, %%r8\n\t" 1276| 800k| "movq %%r8, 96(%[z])\n\t" 1277| 800k| "movq 104(%[z]), %%r8\n\t" 1278| 800k| "adcx %%r8, %%r8\n\t" 1279| 800k| "adox %%rcx, %%r8\n\t" 1280| 800k| "movq %%r8, 104(%[z])\n\t" 1281| 800k| "movq 56(%[x]), %%rdx\n\t" 1282| 800k| "mulx %%rdx, %%rax, %%rcx\n\t" 1283| 800k| "movq 112(%[z]), %%r8\n\t" 1284| 800k| "adcx %%r8, %%r8\n\t" 1285| 800k| "adox %%rax, %%r8\n\t" 1286| 800k| "movq %%r8, 112(%[z])\n\t" 1287| 800k| "movq 120(%[z]), %%r8\n\t" 1288| 800k| "adcx %%r8, %%r8\n\t" 1289| 800k| "adox %%rcx, %%r8\n\t" 1290| 800k| "movq %%r8, 120(%[z])\n\t" 1291| 800k| "movq 64(%[x]), %%rdx\n\t" 1292| 800k| "mulx %%rdx, %%rax, %%rcx\n\t" 1293| 800k| "movq 128(%[z]), %%r8\n\t" 1294| 800k| "adcx %%r8, %%r8\n\t" 1295| 800k| "adox %%rax, %%r8\n\t" 1296| 800k| "movq %%r8, 128(%[z])\n\t" 1297| 800k| "movq 136(%[z]), %%r8\n\t" 1298| 800k| "adcx %%r8, %%r8\n\t" 1299| 800k| "adox %%rcx, %%r8\n\t" 1300| 800k| "movq %%r8, 136(%[z])\n\t" 1301| 800k| : 1302| 800k| : [z] "r"(z), [x] "r"(x) 1303| 800k| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15", "cc", "memory"); 1304| | // clang-format on 1305| 800k|} _ZN5Botan16bigint_mulx_mul9EPmPKmS2_: 1307| 1.02M|void bigint_mulx_mul9(word z[18], const word x[9], const word y[9]) { 1308| 1.02M| copy_mem(z + 9, y, 9); 1309| | // clang-format off 1310| 1.02M| asm( 1311| 1.02M| "xorl %%r8d, %%r8d\n\t" 1312| 1.02M| "xorl %%r9d, %%r9d\n\t" 1313| 1.02M| "xorl %%r10d, %%r10d\n\t" 1314| 1.02M| "xorl %%r11d, %%r11d\n\t" 1315| 1.02M| "xorl %%r12d, %%r12d\n\t" 1316| 1.02M| "xorl %%r13d, %%r13d\n\t" 1317| 1.02M| "xorl %%r14d, %%r14d\n\t" 1318| 1.02M| "xorl %%r15d, %%r15d\n\t" 1319| 1.02M| "xorl %%ebx, %%ebx\n\t" 1320| | 1321| 1.02M| "movq 72(%[z]), %%rdx\n\t" // row 0: x * y[0] 1322| 1.02M| "xorl %%eax, %%eax\n\t" 1323| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1324| 1.02M| "adcx %%rax, %%r8\n\t" 1325| 1.02M| "movq %%r8, 0(%[z])\n\t" 1326| 1.02M| "mulx 8(%[x]), %%rax, %%r8\n\t" 1327| 1.02M| "adox %%rcx, %%rax\n\t" 1328| 1.02M| "adcx %%rax, %%r9\n\t" 1329| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1330| 1.02M| "adox %%r8, %%rax\n\t" 1331| 1.02M| "adcx %%rax, %%r10\n\t" 1332| 1.02M| "mulx 24(%[x]), %%rax, %%r8\n\t" 1333| 1.02M| "adox %%rcx, %%rax\n\t" 1334| 1.02M| "adcx %%rax, %%r11\n\t" 1335| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1336| 1.02M| "adox %%r8, %%rax\n\t" 1337| 1.02M| "adcx %%rax, %%r12\n\t" 1338| 1.02M| "mulx 40(%[x]), %%rax, %%r8\n\t" 1339| 1.02M| "adox %%rcx, %%rax\n\t" 1340| 1.02M| "adcx %%rax, %%r13\n\t" 1341| 1.02M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1342| 1.02M| "adox %%r8, %%rax\n\t" 1343| 1.02M| "adcx %%rax, %%r14\n\t" 1344| 1.02M| "mulx 56(%[x]), %%rax, %%r8\n\t" 1345| 1.02M| "adox %%rcx, %%rax\n\t" 1346| 1.02M| "adcx %%rax, %%r15\n\t" 1347| 1.02M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1348| 1.02M| "adox %%r8, %%rax\n\t" 1349| 1.02M| "adcx %%rax, %%rbx\n\t" 1350| 1.02M| "movl $0, %%eax\n\t" 1351| 1.02M| "adox %%rax, %%rcx\n\t" 1352| 1.02M| "adcx %%rax, %%rcx\n\t" 1353| 1.02M| "movq %%rcx, %%r8\n\t" 1354| | 1355| 1.02M| "movq 80(%[z]), %%rdx\n\t" // row 1: x * y[1] 1356| 1.02M| "xorl %%eax, %%eax\n\t" 1357| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1358| 1.02M| "adcx %%rax, %%r9\n\t" 1359| 1.02M| "movq %%r9, 8(%[z])\n\t" 1360| 1.02M| "mulx 8(%[x]), %%rax, %%r9\n\t" 1361| 1.02M| "adox %%rcx, %%rax\n\t" 1362| 1.02M| "adcx %%rax, %%r10\n\t" 1363| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1364| 1.02M| "adox %%r9, %%rax\n\t" 1365| 1.02M| "adcx %%rax, %%r11\n\t" 1366| 1.02M| "mulx 24(%[x]), %%rax, %%r9\n\t" 1367| 1.02M| "adox %%rcx, %%rax\n\t" 1368| 1.02M| "adcx %%rax, %%r12\n\t" 1369| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1370| 1.02M| "adox %%r9, %%rax\n\t" 1371| 1.02M| "adcx %%rax, %%r13\n\t" 1372| 1.02M| "mulx 40(%[x]), %%rax, %%r9\n\t" 1373| 1.02M| "adox %%rcx, %%rax\n\t" 1374| 1.02M| "adcx %%rax, %%r14\n\t" 1375| 1.02M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1376| 1.02M| "adox %%r9, %%rax\n\t" 1377| 1.02M| "adcx %%rax, %%r15\n\t" 1378| 1.02M| "mulx 56(%[x]), %%rax, %%r9\n\t" 1379| 1.02M| "adox %%rcx, %%rax\n\t" 1380| 1.02M| "adcx %%rax, %%rbx\n\t" 1381| 1.02M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1382| 1.02M| "adox %%r9, %%rax\n\t" 1383| 1.02M| "adcx %%rax, %%r8\n\t" 1384| 1.02M| "movl $0, %%eax\n\t" 1385| 1.02M| "adox %%rax, %%rcx\n\t" 1386| 1.02M| "adcx %%rax, %%rcx\n\t" 1387| 1.02M| "movq %%rcx, %%r9\n\t" 1388| | 1389| 1.02M| "movq 88(%[z]), %%rdx\n\t" // row 2: x * y[2] 1390| 1.02M| "xorl %%eax, %%eax\n\t" 1391| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1392| 1.02M| "adcx %%rax, %%r10\n\t" 1393| 1.02M| "movq %%r10, 16(%[z])\n\t" 1394| 1.02M| "mulx 8(%[x]), %%rax, %%r10\n\t" 1395| 1.02M| "adox %%rcx, %%rax\n\t" 1396| 1.02M| "adcx %%rax, %%r11\n\t" 1397| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1398| 1.02M| "adox %%r10, %%rax\n\t" 1399| 1.02M| "adcx %%rax, %%r12\n\t" 1400| 1.02M| "mulx 24(%[x]), %%rax, %%r10\n\t" 1401| 1.02M| "adox %%rcx, %%rax\n\t" 1402| 1.02M| "adcx %%rax, %%r13\n\t" 1403| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1404| 1.02M| "adox %%r10, %%rax\n\t" 1405| 1.02M| "adcx %%rax, %%r14\n\t" 1406| 1.02M| "mulx 40(%[x]), %%rax, %%r10\n\t" 1407| 1.02M| "adox %%rcx, %%rax\n\t" 1408| 1.02M| "adcx %%rax, %%r15\n\t" 1409| 1.02M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1410| 1.02M| "adox %%r10, %%rax\n\t" 1411| 1.02M| "adcx %%rax, %%rbx\n\t" 1412| 1.02M| "mulx 56(%[x]), %%rax, %%r10\n\t" 1413| 1.02M| "adox %%rcx, %%rax\n\t" 1414| 1.02M| "adcx %%rax, %%r8\n\t" 1415| 1.02M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1416| 1.02M| "adox %%r10, %%rax\n\t" 1417| 1.02M| "adcx %%rax, %%r9\n\t" 1418| 1.02M| "movl $0, %%eax\n\t" 1419| 1.02M| "adox %%rax, %%rcx\n\t" 1420| 1.02M| "adcx %%rax, %%rcx\n\t" 1421| 1.02M| "movq %%rcx, %%r10\n\t" 1422| | 1423| 1.02M| "movq 96(%[z]), %%rdx\n\t" // row 3: x * y[3] 1424| 1.02M| "xorl %%eax, %%eax\n\t" 1425| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1426| 1.02M| "adcx %%rax, %%r11\n\t" 1427| 1.02M| "movq %%r11, 24(%[z])\n\t" 1428| 1.02M| "mulx 8(%[x]), %%rax, %%r11\n\t" 1429| 1.02M| "adox %%rcx, %%rax\n\t" 1430| 1.02M| "adcx %%rax, %%r12\n\t" 1431| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1432| 1.02M| "adox %%r11, %%rax\n\t" 1433| 1.02M| "adcx %%rax, %%r13\n\t" 1434| 1.02M| "mulx 24(%[x]), %%rax, %%r11\n\t" 1435| 1.02M| "adox %%rcx, %%rax\n\t" 1436| 1.02M| "adcx %%rax, %%r14\n\t" 1437| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1438| 1.02M| "adox %%r11, %%rax\n\t" 1439| 1.02M| "adcx %%rax, %%r15\n\t" 1440| 1.02M| "mulx 40(%[x]), %%rax, %%r11\n\t" 1441| 1.02M| "adox %%rcx, %%rax\n\t" 1442| 1.02M| "adcx %%rax, %%rbx\n\t" 1443| 1.02M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1444| 1.02M| "adox %%r11, %%rax\n\t" 1445| 1.02M| "adcx %%rax, %%r8\n\t" 1446| 1.02M| "mulx 56(%[x]), %%rax, %%r11\n\t" 1447| 1.02M| "adox %%rcx, %%rax\n\t" 1448| 1.02M| "adcx %%rax, %%r9\n\t" 1449| 1.02M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1450| 1.02M| "adox %%r11, %%rax\n\t" 1451| 1.02M| "adcx %%rax, %%r10\n\t" 1452| 1.02M| "movl $0, %%eax\n\t" 1453| 1.02M| "adox %%rax, %%rcx\n\t" 1454| 1.02M| "adcx %%rax, %%rcx\n\t" 1455| 1.02M| "movq %%rcx, %%r11\n\t" 1456| | 1457| 1.02M| "movq 104(%[z]), %%rdx\n\t" // row 4: x * y[4] 1458| 1.02M| "xorl %%eax, %%eax\n\t" 1459| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1460| 1.02M| "adcx %%rax, %%r12\n\t" 1461| 1.02M| "movq %%r12, 32(%[z])\n\t" 1462| 1.02M| "mulx 8(%[x]), %%rax, %%r12\n\t" 1463| 1.02M| "adox %%rcx, %%rax\n\t" 1464| 1.02M| "adcx %%rax, %%r13\n\t" 1465| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1466| 1.02M| "adox %%r12, %%rax\n\t" 1467| 1.02M| "adcx %%rax, %%r14\n\t" 1468| 1.02M| "mulx 24(%[x]), %%rax, %%r12\n\t" 1469| 1.02M| "adox %%rcx, %%rax\n\t" 1470| 1.02M| "adcx %%rax, %%r15\n\t" 1471| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1472| 1.02M| "adox %%r12, %%rax\n\t" 1473| 1.02M| "adcx %%rax, %%rbx\n\t" 1474| 1.02M| "mulx 40(%[x]), %%rax, %%r12\n\t" 1475| 1.02M| "adox %%rcx, %%rax\n\t" 1476| 1.02M| "adcx %%rax, %%r8\n\t" 1477| 1.02M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1478| 1.02M| "adox %%r12, %%rax\n\t" 1479| 1.02M| "adcx %%rax, %%r9\n\t" 1480| 1.02M| "mulx 56(%[x]), %%rax, %%r12\n\t" 1481| 1.02M| "adox %%rcx, %%rax\n\t" 1482| 1.02M| "adcx %%rax, %%r10\n\t" 1483| 1.02M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1484| 1.02M| "adox %%r12, %%rax\n\t" 1485| 1.02M| "adcx %%rax, %%r11\n\t" 1486| 1.02M| "movl $0, %%eax\n\t" 1487| 1.02M| "adox %%rax, %%rcx\n\t" 1488| 1.02M| "adcx %%rax, %%rcx\n\t" 1489| 1.02M| "movq %%rcx, %%r12\n\t" 1490| | 1491| 1.02M| "movq 112(%[z]), %%rdx\n\t" // row 5: x * y[5] 1492| 1.02M| "xorl %%eax, %%eax\n\t" 1493| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1494| 1.02M| "adcx %%rax, %%r13\n\t" 1495| 1.02M| "movq %%r13, 40(%[z])\n\t" 1496| 1.02M| "mulx 8(%[x]), %%rax, %%r13\n\t" 1497| 1.02M| "adox %%rcx, %%rax\n\t" 1498| 1.02M| "adcx %%rax, %%r14\n\t" 1499| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1500| 1.02M| "adox %%r13, %%rax\n\t" 1501| 1.02M| "adcx %%rax, %%r15\n\t" 1502| 1.02M| "mulx 24(%[x]), %%rax, %%r13\n\t" 1503| 1.02M| "adox %%rcx, %%rax\n\t" 1504| 1.02M| "adcx %%rax, %%rbx\n\t" 1505| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1506| 1.02M| "adox %%r13, %%rax\n\t" 1507| 1.02M| "adcx %%rax, %%r8\n\t" 1508| 1.02M| "mulx 40(%[x]), %%rax, %%r13\n\t" 1509| 1.02M| "adox %%rcx, %%rax\n\t" 1510| 1.02M| "adcx %%rax, %%r9\n\t" 1511| 1.02M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1512| 1.02M| "adox %%r13, %%rax\n\t" 1513| 1.02M| "adcx %%rax, %%r10\n\t" 1514| 1.02M| "mulx 56(%[x]), %%rax, %%r13\n\t" 1515| 1.02M| "adox %%rcx, %%rax\n\t" 1516| 1.02M| "adcx %%rax, %%r11\n\t" 1517| 1.02M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1518| 1.02M| "adox %%r13, %%rax\n\t" 1519| 1.02M| "adcx %%rax, %%r12\n\t" 1520| 1.02M| "movl $0, %%eax\n\t" 1521| 1.02M| "adox %%rax, %%rcx\n\t" 1522| 1.02M| "adcx %%rax, %%rcx\n\t" 1523| 1.02M| "movq %%rcx, %%r13\n\t" 1524| | 1525| 1.02M| "movq 120(%[z]), %%rdx\n\t" // row 6: x * y[6] 1526| 1.02M| "xorl %%eax, %%eax\n\t" 1527| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1528| 1.02M| "adcx %%rax, %%r14\n\t" 1529| 1.02M| "movq %%r14, 48(%[z])\n\t" 1530| 1.02M| "mulx 8(%[x]), %%rax, %%r14\n\t" 1531| 1.02M| "adox %%rcx, %%rax\n\t" 1532| 1.02M| "adcx %%rax, %%r15\n\t" 1533| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1534| 1.02M| "adox %%r14, %%rax\n\t" 1535| 1.02M| "adcx %%rax, %%rbx\n\t" 1536| 1.02M| "mulx 24(%[x]), %%rax, %%r14\n\t" 1537| 1.02M| "adox %%rcx, %%rax\n\t" 1538| 1.02M| "adcx %%rax, %%r8\n\t" 1539| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1540| 1.02M| "adox %%r14, %%rax\n\t" 1541| 1.02M| "adcx %%rax, %%r9\n\t" 1542| 1.02M| "mulx 40(%[x]), %%rax, %%r14\n\t" 1543| 1.02M| "adox %%rcx, %%rax\n\t" 1544| 1.02M| "adcx %%rax, %%r10\n\t" 1545| 1.02M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1546| 1.02M| "adox %%r14, %%rax\n\t" 1547| 1.02M| "adcx %%rax, %%r11\n\t" 1548| 1.02M| "mulx 56(%[x]), %%rax, %%r14\n\t" 1549| 1.02M| "adox %%rcx, %%rax\n\t" 1550| 1.02M| "adcx %%rax, %%r12\n\t" 1551| 1.02M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1552| 1.02M| "adox %%r14, %%rax\n\t" 1553| 1.02M| "adcx %%rax, %%r13\n\t" 1554| 1.02M| "movl $0, %%eax\n\t" 1555| 1.02M| "adox %%rax, %%rcx\n\t" 1556| 1.02M| "adcx %%rax, %%rcx\n\t" 1557| 1.02M| "movq %%rcx, %%r14\n\t" 1558| | 1559| 1.02M| "movq 128(%[z]), %%rdx\n\t" // row 7: x * y[7] 1560| 1.02M| "xorl %%eax, %%eax\n\t" 1561| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1562| 1.02M| "adcx %%rax, %%r15\n\t" 1563| 1.02M| "movq %%r15, 56(%[z])\n\t" 1564| 1.02M| "mulx 8(%[x]), %%rax, %%r15\n\t" 1565| 1.02M| "adox %%rcx, %%rax\n\t" 1566| 1.02M| "adcx %%rax, %%rbx\n\t" 1567| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1568| 1.02M| "adox %%r15, %%rax\n\t" 1569| 1.02M| "adcx %%rax, %%r8\n\t" 1570| 1.02M| "mulx 24(%[x]), %%rax, %%r15\n\t" 1571| 1.02M| "adox %%rcx, %%rax\n\t" 1572| 1.02M| "adcx %%rax, %%r9\n\t" 1573| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1574| 1.02M| "adox %%r15, %%rax\n\t" 1575| 1.02M| "adcx %%rax, %%r10\n\t" 1576| 1.02M| "mulx 40(%[x]), %%rax, %%r15\n\t" 1577| 1.02M| "adox %%rcx, %%rax\n\t" 1578| 1.02M| "adcx %%rax, %%r11\n\t" 1579| 1.02M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1580| 1.02M| "adox %%r15, %%rax\n\t" 1581| 1.02M| "adcx %%rax, %%r12\n\t" 1582| 1.02M| "mulx 56(%[x]), %%rax, %%r15\n\t" 1583| 1.02M| "adox %%rcx, %%rax\n\t" 1584| 1.02M| "adcx %%rax, %%r13\n\t" 1585| 1.02M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1586| 1.02M| "adox %%r15, %%rax\n\t" 1587| 1.02M| "adcx %%rax, %%r14\n\t" 1588| 1.02M| "movl $0, %%eax\n\t" 1589| 1.02M| "adox %%rax, %%rcx\n\t" 1590| 1.02M| "adcx %%rax, %%rcx\n\t" 1591| 1.02M| "movq %%rcx, %%r15\n\t" 1592| | 1593| 1.02M| "movq 136(%[z]), %%rdx\n\t" // row 8: x * y[8] 1594| 1.02M| "xorl %%eax, %%eax\n\t" 1595| 1.02M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1596| 1.02M| "adcx %%rax, %%rbx\n\t" 1597| 1.02M| "movq %%rbx, 64(%[z])\n\t" 1598| 1.02M| "mulx 8(%[x]), %%rax, %%rbx\n\t" 1599| 1.02M| "adox %%rcx, %%rax\n\t" 1600| 1.02M| "adcx %%rax, %%r8\n\t" 1601| 1.02M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1602| 1.02M| "adox %%rbx, %%rax\n\t" 1603| 1.02M| "adcx %%rax, %%r9\n\t" 1604| 1.02M| "mulx 24(%[x]), %%rax, %%rbx\n\t" 1605| 1.02M| "adox %%rcx, %%rax\n\t" 1606| 1.02M| "adcx %%rax, %%r10\n\t" 1607| 1.02M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1608| 1.02M| "adox %%rbx, %%rax\n\t" 1609| 1.02M| "adcx %%rax, %%r11\n\t" 1610| 1.02M| "mulx 40(%[x]), %%rax, %%rbx\n\t" 1611| 1.02M| "adox %%rcx, %%rax\n\t" 1612| 1.02M| "adcx %%rax, %%r12\n\t" 1613| 1.02M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1614| 1.02M| "adox %%rbx, %%rax\n\t" 1615| 1.02M| "adcx %%rax, %%r13\n\t" 1616| 1.02M| "mulx 56(%[x]), %%rax, %%rbx\n\t" 1617| 1.02M| "adox %%rcx, %%rax\n\t" 1618| 1.02M| "adcx %%rax, %%r14\n\t" 1619| 1.02M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1620| 1.02M| "adox %%rbx, %%rax\n\t" 1621| 1.02M| "adcx %%rax, %%r15\n\t" 1622| 1.02M| "movl $0, %%eax\n\t" 1623| 1.02M| "adox %%rax, %%rcx\n\t" 1624| 1.02M| "adcx %%rax, %%rcx\n\t" 1625| 1.02M| "movq %%rcx, %%rbx\n\t" 1626| | 1627| 1.02M| "movq %%r8, 72(%[z])\n\t" 1628| 1.02M| "movq %%r9, 80(%[z])\n\t" 1629| 1.02M| "movq %%r10, 88(%[z])\n\t" 1630| 1.02M| "movq %%r11, 96(%[z])\n\t" 1631| 1.02M| "movq %%r12, 104(%[z])\n\t" 1632| 1.02M| "movq %%r13, 112(%[z])\n\t" 1633| 1.02M| "movq %%r14, 120(%[z])\n\t" 1634| 1.02M| "movq %%r15, 128(%[z])\n\t" 1635| 1.02M| "movq %%rbx, 136(%[z])\n\t" 1636| 1.02M| : 1637| 1.02M| : [z] "r"(z), [x] "r"(x) 1638| 1.02M| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15", "rbx", "cc", "memory"); 1639| | // clang-format on 1640| 1.02M|} _ZN5Botan17Barrett_ReductionC2ERKNS_6BigIntES1_m: 17| 2.42k| m_modulus(m), m_mu(std::move(mu)), m_mod_words(mw), m_modulus_bits(m.bits()) { 18| | // Give some extra space for Karatsuba 19| 2.42k| m_modulus.grow_to(m_mod_words + 8); 20| 2.42k| m_mu.grow_to(m_mod_words + 8); 21| 2.42k|} _ZN5Botan17Barrett_Reduction18for_secret_modulusERKNS_6BigIntE: 23| 2.42k|Barrett_Reduction Barrett_Reduction::for_secret_modulus(const BigInt& mod) { 24| 2.42k| BOTAN_ARG_CHECK(mod.signum() > 0, "Modulus must be positive"); ------------------ | | 35| 2.42k| do { \ | | 36| 2.42k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.42k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2.42k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2.42k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.42k] | | ------------------ ------------------ 25| | 26| 2.42k| const size_t mod_words = mod.sig_words(); 27| | 28| | // Compute mu = floor(2^{2k} / m) 29| 2.42k| const size_t mu_bits = 2 * WordInfo::bits * mod_words; 30| 2.42k| return Barrett_Reduction(mod, ct_divide_pow2k(mu_bits, mod), mod_words); 31| 2.42k|} _ZN5Botan17Barrett_Reduction18for_public_modulusERKNS_6BigIntE: 33| 1.81k|Barrett_Reduction Barrett_Reduction::for_public_modulus(const BigInt& mod) { 34| 1.81k| return Barrett_Reduction::for_secret_modulus(mod); 35| 1.81k|} _ZNK5Botan17Barrett_Reduction8multiplyERKNS_6BigIntES3_: 153| 3.06k|BigInt Barrett_Reduction::multiply(const BigInt& x, const BigInt& y) const { 154| 3.06k| BOTAN_ARG_CHECK(acceptable_barrett_input(x, m_modulus).as_bool(), "Invalid x param for Barrett multiply"); ------------------ | | 35| 3.06k| do { \ | | 36| 3.06k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 3.06k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 3.06k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 3.06k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 3.06k] | | ------------------ ------------------ 155| 3.06k| BOTAN_ARG_CHECK(acceptable_barrett_input(y, m_modulus).as_bool(), "Invalid y param for Barrett multiply"); ------------------ | | 35| 3.06k| do { \ | | 36| 3.06k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 3.06k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 3.06k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 3.06k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 3.06k] | | ------------------ ------------------ 156| | 157| 3.06k| secure_vector ws(2 * (m_mod_words + 2)); 158| 3.06k| secure_vector xy(2 * m_mod_words); 159| | 160| 3.06k| bigint_mul(xy.data(), 161| 3.06k| xy.size(), 162| 3.06k| x._data(), 163| 3.06k| x.size(), 164| 3.06k| std::min(x.size(), m_mod_words), 165| 3.06k| y._data(), 166| 3.06k| y.size(), 167| 3.06k| std::min(y.size(), m_mod_words), 168| 3.06k| ws.data(), 169| 3.06k| ws.size()); 170| | 171| 3.06k| return barrett_reduce(m_mod_words, m_modulus, m_mu, xy, ws); 172| 3.06k|} _ZNK5Botan17Barrett_Reduction6squareERKNS_6BigIntE: 174| 2.92k|BigInt Barrett_Reduction::square(const BigInt& x) const { 175| 2.92k| BOTAN_ARG_CHECK(acceptable_barrett_input(x, m_modulus).as_bool(), "Invalid x param for Barrett square"); ------------------ | | 35| 2.92k| do { \ | | 36| 2.92k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.92k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2.92k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2.92k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.92k] | | ------------------ ------------------ 176| | 177| 2.92k| secure_vector ws(2 * (m_mod_words + 2)); 178| 2.92k| secure_vector x2(2 * m_mod_words); 179| | 180| 2.92k| bigint_sqr(x2.data(), x2.size(), x._data(), x.size(), std::min(x.size(), m_mod_words), ws.data(), ws.size()); 181| | 182| 2.92k| return barrett_reduce(m_mod_words, m_modulus, m_mu, x2, ws); 183| 2.92k|} _ZNK5Botan17Barrett_Reduction6reduceERKNS_6BigIntE: 185| 2.02k|BigInt Barrett_Reduction::reduce(const BigInt& x) const { 186| 2.02k| BOTAN_ARG_CHECK(x.signum() >= 0, "Argument must be non-negative"); ------------------ | | 35| 2.02k| do { \ | | 36| 2.02k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.02k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2.02k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2.02k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.02k] | | ------------------ ------------------ 187| | 188| 2.02k| const size_t x_sw = x.sig_words(); 189| 2.02k| BOTAN_ARG_CHECK(x_sw <= 2 * m_mod_words, "Argument is too large for Barrett reduction"); ------------------ | | 35| 2.02k| do { \ | | 36| 2.02k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.02k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2.02k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2.02k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.02k] | | ------------------ ------------------ 190| | 191| 2.02k| x.grow_to(2 * m_mod_words); 192| | 193| 2.02k| secure_vector ws; 194| 2.02k| return barrett_reduce(m_mod_words, m_modulus, m_mu, x._as_span(), ws); 195| 2.02k|} barrett.cpp:_ZN5Botan12_GLOBAL__N_124acceptable_barrett_inputERKNS_6BigIntES3_: 145| 9.05k|CT::Choice acceptable_barrett_input(const BigInt& x, const BigInt& modulus) { 146| 9.05k| const auto x_is_positive = CT::Choice::from_int(static_cast(x.signum() >= 0)); 147| 9.05k| const auto x_lt_mod = bigint_ct_is_lt(x._data(), x.size(), modulus._data(), modulus.sig_words()).as_choice(); 148| 9.05k| return x_is_positive && x_lt_mod; 149| 9.05k|} barrett.cpp:_ZN5Botan12_GLOBAL__N_114barrett_reduceEmRKNS_6BigIntES3_NSt3__14spanIKmLm18446744073709551615EEERNS4_6vectorImNS_16secure_allocatorImEEEE: 48| 8.01k| size_t mod_words, const BigInt& modulus, const BigInt& mu, std::span x_words, secure_vector& ws) { 49| 8.01k| BOTAN_ASSERT_NOMSG(modulus.sig_words() == mod_words); ------------------ | | 84| 8.01k| do { \ | | 85| 8.01k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 8.01k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 8.01k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 8.01k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 8.01k] | | ------------------ ------------------ 50| | 51| | // Caller must expand input to be at least this size 52| 8.01k| BOTAN_ASSERT_NOMSG(x_words.size() >= 2 * mod_words); ------------------ | | 84| 8.01k| do { \ | | 85| 8.01k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 8.01k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 8.01k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 8.01k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 8.01k] | | ------------------ ------------------ 53| | 54| | // Normally mod_words + 1 but can be + 2 if the modulus is a power of 2 55| 8.01k| const size_t mu_words = mu.sig_words(); 56| 8.01k| BOTAN_ASSERT_NOMSG(mu_words <= mod_words + 2); ------------------ | | 84| 8.01k| do { \ | | 85| 8.01k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 8.01k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 8.01k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 8.01k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 8.01k] | | ------------------ ------------------ 57| | 58| 8.01k| if(ws.size() < 2 * (mod_words + 2)) { ------------------ | Branch (58:7): [True: 2.02k, False: 5.99k] ------------------ 59| 2.02k| ws.resize(2 * (mod_words + 2)); 60| 2.02k| } 61| | 62| 8.01k| CT::poison(x_words); 63| | 64| | /* 65| | * Following the notation of Handbook of Applied Cryptography 66| | * Algorithm 14.42 "Barrett modular reduction", page 604 67| | * 68| | * 69| | * Using `mu` for µ in the code 70| | */ 71| | 72| | // Compute q1 = floor(x / 2^(k - 1)) which is equivalent to ignoring the low (k-1) words 73| | 74| | // 2 * mod_words + 1 is sufficient, extra is to enable Karatsuba 75| 8.01k| secure_vector r(2 * mu_words + 2); 76| | 77| 8.01k| copy_mem(r.data(), x_words.data() + (mod_words - 1), mod_words + 1); 78| | 79| | // Now compute q2 = q1 * µ 80| | 81| | // We allocate more size than required since this allows Karatsuba more often; 82| | // just `mu_words + (mod_words + 1)` is sufficient 83| 8.01k| const size_t q2_size = 2 * mu_words + 2; 84| | 85| 8.01k| secure_vector q2(q2_size); 86| | 87| 8.01k| bigint_mul( 88| 8.01k| q2.data(), q2.size(), r.data(), r.size(), mod_words + 1, mu._data(), mu.size(), mu_words, ws.data(), ws.size()); 89| | 90| | // Compute r2 = (floor(q2 / b^(k+1)) * m) mod 2^(k+1) 91| | // The division/floor is again effected by just ignoring the low k + 1 words 92| 8.01k| bigint_mul(r.data(), 93| 8.01k| r.size(), 94| 8.01k| &q2[mod_words + 1], // ignoring the low mod_words + 1 words of the first product 95| 8.01k| q2.size() - (mod_words + 1), 96| 8.01k| mod_words + 1, 97| 8.01k| modulus._data(), 98| 8.01k| modulus.size(), 99| 8.01k| mod_words, 100| 8.01k| ws.data(), 101| 8.01k| ws.size()); 102| | 103| | // Clear the high words of the product, equivalent to computing mod 2^(k+1) 104| | // TODO add masked mul to avoid computing high bits at all 105| 8.01k| clear_mem(std::span{r}.subspan(mod_words + 1)); 106| | 107| | // Compute r = r1 - r2 108| | 109| | // The return value of bigint_sub_abs isn't quite right for what we need here so first compare 110| 8.01k| const int32_t relative_size = bigint_cmp(r.data(), mod_words + 1, x_words.data(), mod_words + 1); 111| | 112| 8.01k| bigint_sub_abs(r.data(), r.data(), x_words.data(), mod_words + 1, ws.data()); 113| | 114| | /* 115| | If r is negative then we have to set r to r + 2^(k+1) 116| | 117| | However for r negative computing this sum is equivalent to computing 2^(k+1) - abs(r) 118| | */ 119| 8.01k| clear_mem(ws.data(), mod_words + 2); 120| 8.01k| ws[mod_words + 1] = 1; 121| 8.01k| bigint_sub2(ws.data(), mod_words + 2, r.data(), mod_words + 2); 122| | 123| | // If relative_size > 0 then assign r to 2^(k+1) - r 124| 8.01k| CT::Mask::is_equal(static_cast(relative_size), 1).select_n(r.data(), ws.data(), r.data(), mod_words + 2); 125| | 126| | /* 127| | * Per HAC Note 14.44 (ii) "step 4 is repeated at most twice since 0 <= r < 3m" 128| | */ 129| 8.01k| const size_t bound = 2; 130| | 131| 8.01k| BOTAN_ASSERT_NOMSG(r.size() >= mod_words + 1); ------------------ | | 84| 8.01k| do { \ | | 85| 8.01k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 8.01k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 8.01k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 8.01k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 8.01k] | | ------------------ ------------------ 132| 24.0k| for(size_t i = 0; i != bound; ++i) { ------------------ | Branch (132:22): [True: 16.0k, False: 8.01k] ------------------ 133| 16.0k| const word borrow = bigint_sub3(ws.data(), r.data(), mod_words + 1, modulus._data(), mod_words); 134| 16.0k| CT::Mask::is_zero(borrow).select_n(r.data(), ws.data(), r.data(), mod_words + 1); 135| 16.0k| } 136| | 137| 8.01k| CT::unpoison(q2); 138| 8.01k| CT::unpoison(r); 139| 8.01k| CT::unpoison(ws); 140| 8.01k| CT::unpoison(x_words); 141| | 142| 8.01k| return BigInt::_from_words(r); 143| 8.01k|} _ZN5Botan24inverse_mod_public_primeERKNS_6BigIntES2_: 295| 144|BigInt inverse_mod_public_prime(const BigInt& x, const BigInt& p) { 296| 144| BOTAN_ARG_CHECK(p.signum() > 0, "Modulus must be positive"); ------------------ | | 35| 144| do { \ | | 36| 144| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 144| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 144] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 144| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 144] | | ------------------ ------------------ 297| 144| BOTAN_ARG_CHECK(x.signum() > 0, "Input must be positive"); ------------------ | | 35| 144| do { \ | | 36| 144| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 144| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 144] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 144| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 144] | | ------------------ ------------------ 298| 144| BOTAN_ARG_CHECK(x < p, "Input must be less than modulus"); ------------------ | | 35| 144| do { \ | | 36| 144| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 144| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 144] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 144| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 144] | | ------------------ ------------------ 299| 144| BOTAN_ARG_CHECK(p.is_odd() && p > 1, "Primes are odd integers greater than 1"); ------------------ | | 35| 144| do { \ | | 36| 144| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 288| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 144, False: 0] | | | Branch (37:12): [True: 144, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 144| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 144] | | ------------------ ------------------ 300| | 301| | // TODO possibly use FLT, or the algorithm presented for this case in 302| | // Handbook of Elliptic and Hyperelliptic Curve Cryptography 303| | 304| 144| return inverse_mod_odd_modulus(x, p); 305| 144|} mod_inv.cpp:_ZN5Botan12_GLOBAL__N_123inverse_mod_odd_modulusERKNS_6BigIntES3_: 21| 144|BigInt inverse_mod_odd_modulus(const BigInt& n, const BigInt& mod) { 22| | // Caller should assure these preconditions: 23| 144| BOTAN_ASSERT_NOMSG(n.signum() >= 0); ------------------ | | 84| 144| do { \ | | 85| 144| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 144| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 144] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 144| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 144] | | ------------------ ------------------ 24| 144| BOTAN_ASSERT_NOMSG(mod.signum() > 0); ------------------ | | 84| 144| do { \ | | 85| 144| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 144| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 144] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 144| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 144] | | ------------------ ------------------ 25| 144| BOTAN_ASSERT_NOMSG(n < mod); ------------------ | | 84| 144| do { \ | | 85| 144| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 144| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 144] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 144| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 144] | | ------------------ ------------------ 26| 144| BOTAN_ASSERT_NOMSG(mod >= 3 && mod.is_odd()); ------------------ | | 84| 144| do { \ | | 85| 144| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 288| if(!(expr)) { \ | | ------------------ | | | Branch (86:12): [True: 144, False: 0] | | | Branch (86:12): [True: 144, False: 0] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 144| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 144] | | ------------------ ------------------ 27| | 28| | /* 29| | This uses a modular inversion algorithm designed by Niels Möller 30| | and implemented in Nettle. The same algorithm was later also 31| | adapted to GMP in mpn_sec_invert. 32| | 33| | It can be easily implemented in a way that does not depend on 34| | secret branches or memory lookups, providing resistance against 35| | some forms of side channel attack. 36| | 37| | There is also a description of the algorithm in Appendix 5 of "Fast 38| | Software Polynomial Multiplication on ARM Processors using the NEON Engine" 39| | by Danilo Câmara, Conrado P. L. Gouvêa, Julio López, and Ricardo 40| | Dahab in LNCS 8182 41| | https://inria.hal.science/hal-01506572/document 42| | 43| | Thanks to Niels for creating the algorithm, explaining some things 44| | about it, and the reference to the paper. 45| | */ 46| | 47| 144| const size_t mod_words = mod.sig_words(); 48| 144| BOTAN_ASSERT(mod_words > 0, "Not empty"); ------------------ | | 71| 144| do { \ | | 72| 144| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 144| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 144] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 144| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 144] | | ------------------ ------------------ 49| | 50| 144| secure_vector tmp_mem(5 * mod_words); 51| | 52| 144| word* v_w = &tmp_mem[0]; // NOLINT(readability-container-data-pointer) 53| 144| word* u_w = &tmp_mem[1 * mod_words]; 54| 144| word* b_w = &tmp_mem[2 * mod_words]; 55| 144| word* a_w = &tmp_mem[3 * mod_words]; 56| 144| word* mp1o2 = &tmp_mem[4 * mod_words]; 57| | 58| 144| copy_mem(a_w, n._data(), std::min(n.size(), mod_words)); 59| 144| copy_mem(b_w, mod._data(), std::min(mod.size(), mod_words)); 60| 144| u_w[0] = 1; 61| | // v_w = 0 62| | 63| | // compute (mod + 1) / 2 which [because mod is odd] is equal to 64| | // (mod / 2) + 1 65| 144| copy_mem(mp1o2, mod._data(), std::min(mod.size(), mod_words)); 66| 144| bigint_shr1(mp1o2, mod_words, 1); 67| 144| const word carry = bigint_add2(mp1o2, mod_words, u_w, 1); 68| 144| BOTAN_ASSERT_NOMSG(carry == 0); ------------------ | | 84| 144| do { \ | | 85| 144| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 144| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 144] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 144| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 144] | | ------------------ ------------------ 69| | 70| 144| CT::poison(tmp_mem.data(), tmp_mem.size()); 71| | 72| | // Only n.bits() + mod.bits() iterations are required, but avoid leaking the size of n 73| 144| const size_t execs = 2 * mod.bits(); 74| | 75| 64.2k| for(size_t i = 0; i != execs; ++i) { ------------------ | Branch (75:22): [True: 64.1k, False: 144] ------------------ 76| 64.1k| const word odd_a = a_w[0] & 1; 77| | 78| | //if(odd_a) a -= b 79| 64.1k| const word underflow = bigint_cnd_sub(odd_a, a_w, b_w, mod_words); 80| | 81| | //if(underflow) { b -= a; a = abs(a); swap(u, v); } 82| 64.1k| bigint_cnd_add(underflow, b_w, a_w, mod_words); 83| 64.1k| bigint_cnd_abs(underflow, a_w, mod_words); 84| 64.1k| bigint_cnd_swap(underflow, u_w, v_w, mod_words); 85| | 86| | // a >>= 1 87| 64.1k| bigint_shr1(a_w, mod_words, 1); 88| | 89| | //if(odd_a) u -= v; 90| 64.1k| const word borrow = bigint_cnd_sub(odd_a, u_w, v_w, mod_words); 91| | 92| | // if(borrow) u += p 93| 64.1k| bigint_cnd_add(borrow, u_w, mod._data(), mod_words); 94| | 95| 64.1k| const word odd_u = u_w[0] & 1; 96| | 97| | // u >>= 1 98| 64.1k| bigint_shr1(u_w, mod_words, 1); 99| | 100| | //if(odd_u) u += mp1o2; 101| 64.1k| bigint_cnd_add(odd_u, u_w, mp1o2, mod_words); 102| 64.1k| } 103| | 104| 144| const auto a_is_0 = CT::all_zeros(a_w, mod_words); 105| | 106| 144| auto b_is_1 = CT::Mask::is_equal(b_w[0], 1); 107| 573| for(size_t i = 1; i != mod_words; ++i) { ------------------ | Branch (107:22): [True: 429, False: 144] ------------------ 108| 429| b_is_1 &= CT::Mask::is_zero(b_w[i]); 109| 429| } 110| | 111| 144| BOTAN_ASSERT(a_is_0.as_bool(), "A is zero"); ------------------ | | 71| 144| do { \ | | 72| 144| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 144| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 144] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 144| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 144] | | ------------------ ------------------ 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| 144| (~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| 144| clear_mem(&tmp_mem[mod_words], 4 * mod_words); 123| | 124| 144| CT::unpoison(tmp_mem.data(), tmp_mem.size()); 125| | 126| 144| BigInt r; 127| 144| r.swap_reg(tmp_mem); 128| 144| return r; 129| 144|} _ZN5Botan17Montgomery_Params4DataC2ERKNS_6BigIntERKNS_17Barrett_ReductionE: 40| 1.40k|Montgomery_Params::Data::Data(const BigInt& p, const Barrett_Reduction& mod_p) { 41| 1.40k| if(p.is_even() || p < 3) { ------------------ | Branch (41:7): [True: 0, False: 1.40k] | Branch (41:22): [True: 0, False: 1.40k] ------------------ 42| 0| throw Invalid_Argument("Montgomery_Params invalid modulus"); 43| 0| } 44| | 45| 1.40k| m_p = p; 46| 1.40k| m_p_words = m_p.sig_words(); 47| 1.40k| m_p_dash = monty_inverse(m_p.word_at(0)); 48| | 49| 1.40k| const BigInt r = BigInt::power_of_2(m_p_words * WordInfo::bits); 50| | 51| 1.40k| m_r1 = mod_p.reduce(r); 52| 1.40k| m_r2 = mod_p.square(m_r1); 53| 1.40k| m_r3 = mod_p.multiply(m_r1, m_r2); 54| | 55| | // Barrett should be at least zero prefixing up to modulus size 56| 1.40k| BOTAN_ASSERT_NOMSG(m_r1.size() >= m_p_words); ------------------ | | 84| 1.40k| do { \ | | 85| 1.40k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 1.40k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 1.40k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 1.40k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 1.40k] | | ------------------ ------------------ 57| 1.40k| BOTAN_ASSERT_NOMSG(m_r2.size() >= m_p_words); ------------------ | | 84| 1.40k| do { \ | | 85| 1.40k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 1.40k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 1.40k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 1.40k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 1.40k] | | ------------------ ------------------ 58| 1.40k| BOTAN_ASSERT_NOMSG(m_r3.size() >= m_p_words); ------------------ | | 84| 1.40k| do { \ | | 85| 1.40k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 1.40k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 1.40k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 1.40k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 1.40k] | | ------------------ ------------------ 59| 1.40k|} _ZN5Botan17Montgomery_ParamsC2ERKNS_6BigIntERKNS_17Barrett_ReductionE: 62| 1.40k| m_data(std::make_shared(p, mod_p)) {} _ZN5Botan17Montgomery_ParamsC2ERKNS_6BigIntE: 65| 614| Montgomery_Params(p, Barrett_Reduction::for_secret_modulus(p)) {} _ZNK5Botan17Montgomery_ParamseqERKS0_: 67| 14.8k|bool Montgomery_Params::operator==(const Montgomery_Params& other) const { 68| 14.8k| if(this->m_data == other.m_data) { ------------------ | Branch (68:7): [True: 14.8k, False: 0] ------------------ 69| 14.8k| return true; 70| 14.8k| } 71| | 72| 0| return (this->m_data->p() == other.m_data->p()); 73| 14.8k|} _ZNK5Botan17Montgomery_Params4redcERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 75| 700|BigInt Montgomery_Params::redc(const BigInt& x, secure_vector& ws) const { 76| 700| const size_t p_size = this->p_words(); 77| | 78| 700| if(ws.size() < p_size) { ------------------ | Branch (78:7): [True: 280, False: 420] ------------------ 79| 280| ws.resize(p_size); 80| 280| } 81| | 82| 700| BigInt z = x; 83| 700| z.grow_to(2 * p_size); 84| | 85| 700| bigint_monty_redc_inplace(z.mutable_data(), this->p()._data(), p_size, this->p_dash(), ws.data(), ws.size()); 86| | 87| 700| return z; 88| 700|} _ZNK5Botan17Montgomery_Params3mulERKNS_6BigIntES3_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 90| 10.5k|BigInt Montgomery_Params::mul(const BigInt& x, const BigInt& y, secure_vector& ws) const { 91| 10.5k| const size_t p_size = this->p_words(); 92| 10.5k| BigInt z = BigInt::with_capacity(2 * p_size); 93| 10.5k| this->mul(z, x, y, ws); 94| 10.5k| return z; 95| 10.5k|} _ZNK5Botan17Montgomery_Params3mulERNS_6BigIntERKS1_S4_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 97| 33.1k|void Montgomery_Params::mul(BigInt& z, const BigInt& x, const BigInt& y, secure_vector& ws) const { 98| 33.1k| BOTAN_ARG_CHECK(&z != &x && &z != &y, "Montgomery_Params::mul output must not alias inputs"); ------------------ | | 35| 33.1k| do { \ | | 36| 33.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 66.2k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 33.1k, False: 0] | | | Branch (37:12): [True: 33.1k, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 33.1k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 33.1k] | | ------------------ ------------------ 99| | 100| 33.1k| const size_t p_size = this->p_words(); 101| | 102| 33.1k| if(ws.size() < 2 * p_size) { ------------------ | Branch (102:7): [True: 762, False: 32.3k] ------------------ 103| 762| ws.resize(2 * p_size); 104| 762| } 105| | 106| 33.1k| BOTAN_DEBUG_ASSERT(x.sig_words() <= p_size); ------------------ | | 137| 33.1k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 33.1k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 33.1k] | | ------------------ ------------------ 107| 33.1k| BOTAN_DEBUG_ASSERT(y.sig_words() <= p_size); ------------------ | | 137| 33.1k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 33.1k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 33.1k] | | ------------------ ------------------ 108| | 109| 33.1k| if(z.size() < 2 * p_size) { ------------------ | Branch (109:7): [True: 2.49k, False: 30.6k] ------------------ 110| 2.49k| z.grow_to(2 * p_size); 111| 2.49k| } 112| | 113| 33.1k| bigint_mul(z.mutable_data(), 114| 33.1k| z.size(), 115| 33.1k| x._data(), 116| 33.1k| x.size(), 117| 33.1k| std::min(p_size, x.size()), 118| 33.1k| y._data(), 119| 33.1k| y.size(), 120| 33.1k| std::min(p_size, y.size()), 121| 33.1k| ws.data(), 122| 33.1k| ws.size()); 123| | 124| 33.1k| bigint_monty_redc_inplace(z.mutable_data(), this->p()._data(), p_size, this->p_dash(), ws.data(), ws.size()); 125| 33.1k|} _ZNK5Botan17Montgomery_Params3mulERNS_6BigIntERKS1_NSt3__14spanIKmLm18446744073709551615EEERNS5_6vectorImNS_16secure_allocatorImEEEE: 127| 5.69k|void Montgomery_Params::mul(BigInt& z, const BigInt& x, std::span y, secure_vector& ws) const { 128| 5.69k| BOTAN_ARG_CHECK(&z != &x, "Montgomery_Params::mul output must not alias x"); ------------------ | | 35| 5.69k| do { \ | | 36| 5.69k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 5.69k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 5.69k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 5.69k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 5.69k] | | ------------------ ------------------ 129| 5.69k| BOTAN_ARG_CHECK(!ranges_overlap(z._data(), z.size(), y.data(), y.size()), ------------------ | | 35| 5.69k| do { \ | | 36| 5.69k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 5.69k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 5.69k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 5.69k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 5.69k] | | ------------------ ------------------ 130| 5.69k| "Montgomery_Params::mul output must not overlap y"); 131| | 132| 5.69k| const size_t p_size = this->p_words(); 133| | 134| 5.69k| if(ws.size() < 2 * p_size) { ------------------ | Branch (134:7): [True: 0, False: 5.69k] ------------------ 135| 0| ws.resize(2 * p_size); 136| 0| } 137| 5.69k| if(z.size() < 2 * p_size) { ------------------ | Branch (137:7): [True: 0, False: 5.69k] ------------------ 138| 0| z.grow_to(2 * p_size); 139| 0| } 140| | 141| 5.69k| BOTAN_DEBUG_ASSERT(x.sig_words() <= p_size); ------------------ | | 137| 5.69k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 5.69k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 5.69k] | | ------------------ ------------------ 142| | 143| 5.69k| bigint_mul(z.mutable_data(), 144| 5.69k| z.size(), 145| 5.69k| x._data(), 146| 5.69k| x.size(), 147| 5.69k| std::min(p_size, x.size()), 148| 5.69k| y.data(), 149| 5.69k| y.size(), 150| 5.69k| std::min(p_size, y.size()), 151| 5.69k| ws.data(), 152| 5.69k| ws.size()); 153| | 154| 5.69k| bigint_monty_redc_inplace(z.mutable_data(), this->p()._data(), p_size, this->p_dash(), ws.data(), ws.size()); 155| 5.69k|} _ZNK5Botan17Montgomery_Params6mul_byERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 157| 3.03k|void Montgomery_Params::mul_by(BigInt& x, const BigInt& y, secure_vector& ws) const { 158| 3.03k| const size_t p_size = this->p_words(); 159| | 160| 3.03k| if(ws.size() < 4 * p_size) { ------------------ | Branch (160:7): [True: 1.51k, False: 1.51k] ------------------ 161| 1.51k| ws.resize(4 * p_size); 162| 1.51k| } 163| | 164| 3.03k| word* z_data = ws.data(); 165| 3.03k| word* ws_data = &ws[2 * p_size]; 166| | 167| 3.03k| BOTAN_DEBUG_ASSERT(x.sig_words() <= p_size); ------------------ | | 137| 3.03k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 3.03k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 3.03k] | | ------------------ ------------------ 168| | 169| 3.03k| bigint_mul(z_data, 170| 3.03k| 2 * p_size, 171| 3.03k| x._data(), 172| 3.03k| x.size(), 173| 3.03k| std::min(p_size, x.size()), 174| 3.03k| y._data(), 175| 3.03k| y.size(), 176| 3.03k| std::min(p_size, y.size()), 177| 3.03k| ws_data, 178| 3.03k| 2 * p_size); 179| | 180| 3.03k| bigint_monty_redc_inplace(z_data, this->p()._data(), p_size, this->p_dash(), ws_data, 2 * p_size); 181| | 182| 3.03k| if(x.size() < 2 * p_size) { ------------------ | Branch (182:7): [True: 1.33k, False: 1.70k] ------------------ 183| 1.33k| x.grow_to(2 * p_size); 184| 1.33k| } 185| 3.03k| copy_mem(x.mutable_data(), z_data, 2 * p_size); 186| 3.03k|} _ZNK5Botan17Montgomery_Params3sqrERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 188| 840|BigInt Montgomery_Params::sqr(const BigInt& x, secure_vector& ws) const { 189| 840| BOTAN_DEBUG_ASSERT(x.sig_words() <= this->p_words()); ------------------ | | 137| 840| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 840| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 840] | | ------------------ ------------------ 190| 840| return this->sqr(std::span{x._data(), x.size()}, ws); 191| 840|} _ZNK5Botan17Montgomery_Params3sqrENSt3__14spanIKmLm18446744073709551615EEERNS1_6vectorImNS_16secure_allocatorImEEEE: 193| 840|BigInt Montgomery_Params::sqr(std::span x, secure_vector& ws) const { 194| 840| const size_t p_size = this->p_words(); 195| 840| BigInt z = BigInt::with_capacity(2 * p_size); 196| 840| this->sqr(z, x, ws); 197| 840| return z; 198| 840|} _ZNK5Botan17Montgomery_Params3sqrERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 200| 11.0k|void Montgomery_Params::sqr(BigInt& z, const BigInt& x, secure_vector& ws) const { 201| 11.0k| BOTAN_ARG_CHECK(&z != &x, "Montgomery_Params::sqr output must not alias input"); ------------------ | | 35| 11.0k| do { \ | | 36| 11.0k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 11.0k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 11.0k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 11.0k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 11.0k] | | ------------------ ------------------ 202| 11.0k| this->sqr(z, std::span{x._data(), x.size()}, ws); 203| 11.0k|} _ZNK5Botan17Montgomery_Params3sqrERNS_6BigIntENSt3__14spanIKmLm18446744073709551615EEERNS3_6vectorImNS_16secure_allocatorImEEEE: 205| 13.3k|void Montgomery_Params::sqr(BigInt& z, std::span x, secure_vector& ws) const { 206| 13.3k| BOTAN_ARG_CHECK(!ranges_overlap(z._data(), z.size(), x.data(), x.size()), ------------------ | | 35| 13.3k| do { \ | | 36| 13.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 13.3k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 13.3k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 13.3k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 13.3k] | | ------------------ ------------------ 207| 13.3k| "Montgomery_Params::sqr output must not overlap input"); 208| | 209| 13.3k| const size_t p_size = this->p_words(); 210| | 211| 13.3k| if(ws.size() < 2 * p_size) { ------------------ | Branch (211:7): [True: 140, False: 13.1k] ------------------ 212| 140| ws.resize(2 * p_size); 213| 140| } 214| | 215| 13.3k| if(z.size() < 2 * p_size) { ------------------ | Branch (215:7): [True: 490, False: 12.8k] ------------------ 216| 490| z.grow_to(2 * p_size); 217| 490| } 218| | 219| 13.3k| bigint_sqr(z.mutable_data(), z.size(), x.data(), x.size(), std::min(p_size, x.size()), ws.data(), ws.size()); 220| | 221| 13.3k| bigint_monty_redc_inplace(z.mutable_data(), this->p()._data(), p_size, this->p_dash(), ws.data(), ws.size()); 222| 13.3k|} _ZN5Botan14Montgomery_IntC2ERKNS_17Montgomery_ParamsENSt3__16vectorImNS_16secure_allocatorImEEEE: 227| 2.57k| m_params(params), m_v(std::move(words)) { 228| 2.57k| BOTAN_ASSERT_NOMSG(m_v.size() == m_params.p_words()); ------------------ | | 84| 2.57k| do { \ | | 85| 2.57k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 2.57k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 2.57k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 2.57k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 2.57k] | | ------------------ ------------------ 229| 2.57k|} _ZN5Botan14Montgomery_Int3oneERKNS_17Montgomery_ParamsE: 231| 471|Montgomery_Int Montgomery_Int::one(const Montgomery_Params& params) { 232| 471| return Montgomery_Int(params, params.R1(), false); 233| 471|} _ZN5Botan14Montgomery_IntC2ERKNS_17Montgomery_ParamsERKNS_6BigIntEb: 242| 942| m_params(params), m_v(m_params.p_words()) { 243| 942| BOTAN_ARG_CHECK(v.signum() >= 0 && v < m_params.p(), "Input out of range"); ------------------ | | 35| 942| do { \ | | 36| 942| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.88k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 942, False: 0] | | | Branch (37:12): [True: 942, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 942| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 942] | | ------------------ ------------------ 244| | 245| 942| const size_t p_size = m_params.p_words(); 246| | 247| 942| auto v_span = v._as_span(); 248| | 249| 942| if(v_span.size() > p_size) { ------------------ | Branch (249:7): [True: 628, False: 314] ------------------ 250| | // Safe to truncate the span since we already checked v < p 251| 628| v_span = v_span.first(p_size); 252| 628| } 253| | 254| 942| BOTAN_ASSERT_NOMSG(m_v.size() >= v_span.size()); ------------------ | | 84| 942| do { \ | | 85| 942| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 942| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 942] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 942| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 942] | | ------------------ ------------------ 255| | 256| 942| copy_mem(std::span{m_v}.first(v_span.size()), v_span); 257| | 258| 942| if(redc_needed) { ------------------ | Branch (258:7): [True: 471, False: 471] ------------------ 259| 471| secure_vector ws; 260| 471| this->mul_by(m_params.R2()._as_span().first(p_size), ws); 261| 471| } 262| 942|} _ZNK5Botan14Montgomery_Int5valueEv: 273| 384|BigInt Montgomery_Int::value() const { 274| 384| secure_vector ws(m_params.p_words()); 275| | 276| 384| secure_vector z = m_v; 277| 384| z.resize(2 * m_params.p_words()); // zero extend 278| | 279| 384| bigint_monty_redc_inplace( 280| 384| z.data(), m_params.p()._data(), m_params.p_words(), m_params.p_dash(), ws.data(), ws.size()); 281| | 282| 384| return BigInt::_from_words(z); 283| 384|} _ZNK5Botan14Montgomery_Int3mulERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 320| 2.57k|Montgomery_Int Montgomery_Int::mul(const Montgomery_Int& other, secure_vector& ws) const { 321| 2.57k| BOTAN_STATE_CHECK(other.m_params == m_params); ------------------ | | 51| 2.57k| do { \ | | 52| 2.57k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 2.57k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 2.57k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 2.57k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 2.57k] | | ------------------ ------------------ 322| | 323| 2.57k| const size_t p_size = m_params.p_words(); 324| 2.57k| BOTAN_ASSERT_NOMSG(m_v.size() == p_size && other.m_v.size() == p_size); ------------------ | | 84| 2.57k| do { \ | | 85| 2.57k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 5.15k| if(!(expr)) { \ | | ------------------ | | | Branch (86:12): [True: 2.57k, False: 0] | | | Branch (86:12): [True: 2.57k, False: 0] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 2.57k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 2.57k] | | ------------------ ------------------ 325| | 326| 2.57k| if(ws.size() < 4 * p_size) { ------------------ | Branch (326:7): [True: 0, False: 2.57k] ------------------ 327| 0| ws.resize(4 * p_size); 328| 0| } 329| | 330| 2.57k| secure_vector z(p_size); 331| | 332| 2.57k| bigint_monty_mul( 333| 2.57k| z.data(), m_v.data(), other.m_v.data(), m_params.p()._data(), p_size, m_params.p_dash(), ws.data(), ws.size()); 334| | 335| 2.57k| return Montgomery_Int(m_params, std::move(z)); 336| 2.57k|} _ZN5Botan14Montgomery_Int6mul_byERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 338| 12.2k|Montgomery_Int& Montgomery_Int::mul_by(const Montgomery_Int& other, secure_vector& ws) { 339| 12.2k| BOTAN_STATE_CHECK(other.m_params == m_params); ------------------ | | 51| 12.2k| do { \ | | 52| 12.2k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 12.2k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 12.2k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 12.2k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 12.2k] | | ------------------ ------------------ 340| 12.2k| return this->mul_by(std::span{other.m_v}, ws); 341| 12.2k|} _ZN5Botan14Montgomery_Int6mul_byENSt3__14spanIKmLm18446744073709551615EEERNS1_6vectorImNS_16secure_allocatorImEEEE: 343| 12.7k|Montgomery_Int& Montgomery_Int::mul_by(std::span other, secure_vector& ws) { 344| 12.7k| const size_t p_size = m_params.p_words(); 345| 12.7k| BOTAN_ASSERT_NOMSG(m_v.size() == p_size && other.size() == p_size); ------------------ | | 84| 12.7k| do { \ | | 85| 12.7k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 25.4k| if(!(expr)) { \ | | ------------------ | | | Branch (86:12): [True: 12.7k, False: 0] | | | Branch (86:12): [True: 12.7k, False: 0] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 12.7k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 12.7k] | | ------------------ ------------------ 346| | 347| 12.7k| if(ws.size() < 4 * p_size) { ------------------ | Branch (347:7): [True: 471, False: 12.2k] ------------------ 348| 471| ws.resize(4 * p_size); 349| 471| } 350| | 351| 12.7k| bigint_monty_mul( 352| 12.7k| m_v.data(), m_v.data(), other.data(), m_params.p()._data(), p_size, m_params.p_dash(), ws.data(), ws.size()); 353| | 354| 12.7k| return (*this); 355| 12.7k|} _ZN5Botan14Montgomery_Int19square_this_n_timesERNSt3__16vectorImNS_16secure_allocatorImEEEEm: 357| 16.0k|Montgomery_Int& Montgomery_Int::square_this_n_times(secure_vector& ws, size_t n) { 358| 16.0k| const size_t p_size = m_params.p_words(); 359| 16.0k| BOTAN_ASSERT_NOMSG(m_v.size() == p_size); ------------------ | | 84| 16.0k| do { \ | | 85| 16.0k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 16.0k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 16.0k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 16.0k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 16.0k] | | ------------------ ------------------ 360| | 361| 16.0k| if(ws.size() < 4 * p_size) { ------------------ | Branch (361:7): [True: 682, False: 15.3k] ------------------ 362| 682| ws.resize(4 * p_size); 363| 682| } 364| | 365| 66.8k| for(size_t i = 0; i != n; ++i) { ------------------ | Branch (365:22): [True: 50.8k, False: 16.0k] ------------------ 366| 50.8k| bigint_monty_sqr(m_v.data(), m_v.data(), m_params.p()._data(), p_size, m_params.p_dash(), ws.data(), ws.size()); 367| 50.8k| } 368| | 369| 16.0k| return (*this); 370| 16.0k|} _ZNK5Botan14Montgomery_Int6squareERNSt3__16vectorImNS_16secure_allocatorImEEEE: 463| 2.57k|Montgomery_Int Montgomery_Int::square(secure_vector& ws) const { 464| 2.57k| auto z = (*this); 465| 2.57k| z.square_this_n_times(ws, 1); 466| 2.57k| return z; 467| 2.57k|} monty.cpp:_ZN5Botan12_GLOBAL__N_114ranges_overlapEPKmmS2_m: 30| 18.9k|bool ranges_overlap(const word* a, size_t na, const word* b, size_t nb) { 31| 18.9k| if(na == 0 || nb == 0) { ------------------ | Branch (31:7): [True: 4, False: 18.9k] | Branch (31:18): [True: 0, False: 18.9k] ------------------ 32| 4| return false; 33| 4| } 34| 18.9k| const std::less lt; // NOLINT(modernize-use-transparent-functors) 35| 18.9k| return lt(a, b + nb) && lt(b, a + na); ------------------ | Branch (35:11): [True: 13.1k, False: 5.86k] | Branch (35:28): [True: 0, False: 13.1k] ------------------ 36| 18.9k|} _ZN5Botan16monty_precomputeERKNS_14Montgomery_IntEmb: 145| 471| bool const_time) { 146| 471| if(window_bits == 0) { ------------------ | Branch (146:7): [True: 0, False: 471] ------------------ 147| 0| window_bits = 4; 148| 0| } 149| | 150| 471| if(window_bits < 1 || window_bits > 12) { // really even 8 is too large ... ------------------ | Branch (150:7): [True: 0, False: 471] | Branch (150:26): [True: 0, False: 471] ------------------ 151| 0| throw Invalid_Argument("Invalid window bits for Montgomery exponentiation"); 152| 0| } 153| | 154| 471|#if defined(BOTAN_HAS_MONTY_EXP_AVX512) 155| 471| if(CPUID::has(CPUID::Feature::AVX512)) { ------------------ | Branch (155:7): [True: 0, False: 471] ------------------ 156| 0| if(auto state = make_monty_exp_avx512(g, window_bits, const_time)) { ------------------ | Branch (156:15): [True: 0, False: 0] ------------------ 157| 0| return state; 158| 0| } 159| 0| } 160| 471|#endif 161| | 162| 471| return std::make_shared(g, window_bits, const_time); 163| 471|} _ZN5Botan16monty_precomputeERKNS_17Montgomery_ParamsERKNS_6BigIntEmb: 168| 471| bool const_time) { 169| 471| BOTAN_ARG_CHECK(g.signum() >= 0 && g < params.p(), "Montgomery exponentiation base integer out of range"); ------------------ | | 35| 471| do { \ | | 36| 471| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 942| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 471, False: 0] | | | Branch (37:12): [True: 471, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 471| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 471] | | ------------------ ------------------ 170| 471| const Montgomery_Int monty_g(params, g); 171| 471| return monty_precompute(monty_g, window_bits, const_time); 172| 471|} _ZN5Botan21monty_execute_vartimeERKNS_31Montgomery_Exponentiation_StateERKNS_6BigIntE: 180| 384|Montgomery_Int monty_execute_vartime(const Montgomery_Exponentiation_State& precomputed_state, const BigInt& k) { 181| 384| return precomputed_state.exponentiation_vartime(k); 182| 384|} monty_exp.cpp:_ZN5Botan12_GLOBAL__N_133Montgomery_Exponentiation_GenericC2ERKNS_14Montgomery_IntEmb: 43| 471| m_params(g._params()), m_window_bits(window_bits) { 44| 471| const size_t window_size = (static_cast(1) << m_window_bits); 45| | 46| 471| m_g.reserve(window_size); 47| | 48| 471| m_g.push_back(Montgomery_Int::one(m_params)); 49| | 50| 471| m_g.push_back(g); 51| | 52| 471| secure_vector ws(2 * m_params.p_words()); 53| | 54| 5.62k| for(size_t i = 2; i != window_size; ++i) { ------------------ | Branch (54:22): [True: 5.15k, False: 471] ------------------ 55| 5.15k| if(i % 2 == 0) { ------------------ | Branch (55:10): [True: 2.57k, False: 2.57k] ------------------ 56| 2.57k| m_g.push_back(m_g[i / 2].square(ws)); 57| 2.57k| } else { 58| 2.57k| m_g.push_back(m_g[1].mul(m_g[i - 1], ws)); 59| 2.57k| } 60| 5.15k| } 61| | 62| 471| if(const_time) { ------------------ | Branch (62:7): [True: 87, False: 384] ------------------ 63| 87| CT::poison_range(m_g); 64| 87| } 65| 471|} monty_exp.cpp:_ZNK5Botan12_GLOBAL__N_133Montgomery_Exponentiation_Generic22exponentiation_vartimeERKNS_6BigIntE: 117| 384|Montgomery_Int Montgomery_Exponentiation_Generic::exponentiation_vartime(const BigInt& scalar) const { 118| 384| const size_t exp_nibbles = (scalar.bits() + m_window_bits - 1) / m_window_bits; 119| | 120| 384| secure_vector ws(2 * m_params.p_words()); 121| | 122| 384| if(exp_nibbles == 0) { ------------------ | Branch (122:7): [True: 0, False: 384] ------------------ 123| 0| return Montgomery_Int::one(m_params); 124| 0| } 125| | 126| 384| Montgomery_Int x = m_g[scalar.get_substring(m_window_bits * (exp_nibbles - 1), m_window_bits)]; 127| | 128| 13.8k| for(size_t i = exp_nibbles - 1; i > 0; --i) { ------------------ | Branch (128:36): [True: 13.4k, False: 384] ------------------ 129| 13.4k| x.square_this_n_times(ws, m_window_bits); 130| | 131| 13.4k| const uint32_t nibble = scalar.get_substring(m_window_bits * (i - 1), m_window_bits); 132| 13.4k| if(nibble > 0) { ------------------ | Branch (132:10): [True: 12.2k, False: 1.19k] ------------------ 133| 12.2k| x.mul_by(m_g[nibble], ws); 134| 12.2k| } 135| 13.4k| } 136| | 137| 384| CT::unpoison(x); 138| 384| return x; 139| 384|} _ZN5Botan17sqrt_modulo_primeERKNS_6BigIntES2_: 27| 218|BigInt sqrt_modulo_prime(const BigInt& a, const BigInt& p) { 28| 218| BOTAN_ARG_CHECK(p > 1, "invalid prime"); ------------------ | | 35| 218| do { \ | | 36| 218| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 218| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 218] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 218| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 218] | | ------------------ ------------------ 29| 218| BOTAN_ARG_CHECK(a < p, "value to solve for must be less than p"); ------------------ | | 35| 218| do { \ | | 36| 218| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 218| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 218] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 218| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 218] | | ------------------ ------------------ 30| 218| BOTAN_ARG_CHECK(a >= 0, "value to solve for must not be negative"); ------------------ | | 35| 218| do { \ | | 36| 218| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 218| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 218] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 218| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 218] | | ------------------ ------------------ 31| | 32| | // some very easy cases 33| 218| if(p == 2 || a <= 1) { ------------------ | Branch (33:7): [True: 0, False: 218] | Branch (33:17): [True: 0, False: 218] ------------------ 34| 0| return a; 35| 0| } 36| | 37| 218| BOTAN_ARG_CHECK(p.is_odd(), "invalid prime"); ------------------ | | 35| 218| do { \ | | 36| 218| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 218| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 218] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 218| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 218] | | ------------------ ------------------ 38| | 39| 218| if(jacobi(a, p) != 1) { // not a quadratic residue ------------------ | Branch (39:7): [True: 77, False: 141] ------------------ 40| 77| return BigInt::from_s32(-1); 41| 77| } 42| | 43| 141| const auto mod_p = Barrett_Reduction::for_public_modulus(p); 44| 141| const Montgomery_Params monty_p(p, mod_p); 45| | 46| | // If p == 3 (mod 4) there is a simple solution 47| 141| if(p % 4 == 3) { ------------------ | Branch (47:7): [True: 0, False: 141] ------------------ 48| 0| return monty_exp_vartime(monty_p, a, ((p + 1) >> 2)).value(); 49| 0| } 50| | 51| | // Otherwise we have to use Shanks-Tonelli 52| 141| size_t s = low_zero_bits(p - 1); 53| 141| BigInt q = p >> s; 54| | 55| 141| q -= 1; 56| 141| q >>= 1; 57| | 58| 141| BigInt r = monty_exp_vartime(monty_p, a, q).value(); 59| 141| BigInt n = mod_p.multiply(a, mod_p.square(r)); 60| 141| r = mod_p.multiply(r, a); 61| | 62| 141| if(n == 1) { ------------------ | Branch (62:7): [True: 71, False: 70] ------------------ 63| 71| return r; 64| 71| } 65| | 66| | // find random quadratic nonresidue z 67| 70| word z = 2; 68| 70| for(;;) { 69| 70| if(jacobi(BigInt::from_word(z), p) == -1) { // found one ------------------ | Branch (69:10): [True: 70, False: 0] ------------------ 70| 70| break; 71| 70| } 72| | 73| 0| z += 1; // try next z 74| | 75| | /* 76| | * The expected number of tests to find a non-residue modulo a 77| | * prime is 2. If we have not found one after 256 then almost 78| | * certainly we have been given a non-prime p. 79| | */ 80| 0| if(z >= 256) { ------------------ | Branch (80:10): [True: 0, False: 0] ------------------ 81| 0| return BigInt::from_s32(-1); 82| 0| } 83| 0| } 84| | 85| 70| BigInt c = monty_exp_vartime(monty_p, BigInt::from_word(z), (q << 1) + 1).value(); 86| | 87| 140| while(n > 1) { ------------------ | Branch (87:10): [True: 70, False: 70] ------------------ 88| 70| q = n; 89| | 90| 70| size_t i = 0; 91| 140| while(q != 1) { ------------------ | Branch (91:13): [True: 70, False: 70] ------------------ 92| 70| q = mod_p.square(q); 93| 70| ++i; 94| | 95| 70| if(i >= s) { ------------------ | Branch (95:13): [True: 0, False: 70] ------------------ 96| 0| return BigInt::from_s32(-1); 97| 0| } 98| 70| } 99| | 100| 70| BOTAN_ASSERT_NOMSG(s >= (i + 1)); // No underflow! ------------------ | | 84| 70| do { \ | | 85| 70| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 70| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 70] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 70| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 70] | | ------------------ ------------------ 101| 70| c = monty_exp_vartime(monty_p, c, BigInt::power_of_2(s - i - 1)).value(); 102| 70| r = mod_p.multiply(r, c); 103| 70| c = mod_p.square(c); 104| 70| n = mod_p.multiply(n, c); 105| | 106| | // s decreases as the algorithm proceeds 107| 70| BOTAN_ASSERT_NOMSG(s >= i); ------------------ | | 84| 70| do { \ | | 85| 70| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 70| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 70] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 70| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 70] | | ------------------ ------------------ 108| 70| s = i; 109| 70| } 110| | 111| 70| return r; 112| 70|} _ZN5Botan6jacobiENS_6BigIntES0_: 119| 288|int32_t jacobi(BigInt a, BigInt n) { 120| 288| BOTAN_ARG_CHECK(n.is_odd() && n >= 3, "Argument n must be an odd integer >= 3"); ------------------ | | 35| 288| do { \ | | 36| 288| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 576| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 288, False: 0] | | | Branch (37:12): [True: 288, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 288| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 288] | | ------------------ ------------------ 121| | 122| 288| if(a < 0 || a >= n) { ------------------ | Branch (122:7): [True: 0, False: 288] | Branch (122:16): [True: 0, False: 288] ------------------ 123| 0| a %= n; 124| 0| } 125| | 126| 288| if(a == 0) { ------------------ | Branch (126:7): [True: 0, False: 288] ------------------ 127| 0| return 0; 128| 0| } 129| 288| if(a == 1) { ------------------ | Branch (129:7): [True: 0, False: 288] ------------------ 130| 0| return 1; 131| 0| } 132| | 133| 288| int32_t s = 1; 134| | 135| 15.4k| for(;;) { 136| 15.4k| const size_t e = low_zero_bits(a); 137| 15.4k| a >>= e; 138| 15.4k| const word n_mod_8 = n.word_at(0) % 8; 139| 15.4k| const word n_mod_4 = n_mod_8 % 4; 140| | 141| 15.4k| if(e % 2 == 1 && (n_mod_8 == 3 || n_mod_8 == 5)) { ------------------ | Branch (141:10): [True: 5.79k, False: 9.66k] | Branch (141:25): [True: 1.39k, False: 4.40k] | Branch (141:41): [True: 1.54k, False: 2.85k] ------------------ 142| 2.94k| s = -s; 143| 2.94k| } 144| | 145| 15.4k| if(n_mod_4 == 3 && a % 4 == 3) { ------------------ | Branch (145:10): [True: 7.66k, False: 7.79k] | Branch (145:26): [True: 3.79k, False: 3.87k] ------------------ 146| 3.79k| s = -s; 147| 3.79k| } 148| | 149| | /* 150| | * The HAC presentation of the algorithm uses recursion, which is not 151| | * desirable or necessary. 152| | * 153| | * Instead we loop accumulating the product of the various jacobi() 154| | * subcomputations into s, until we reach algorithm termination, which 155| | * occurs in one of two ways. 156| | * 157| | * If a == 1 then the recursion has completed; we can return the value of s. 158| | * 159| | * Otherwise, after swapping and reducing, check for a == 0 [this value is 160| | * called `n1` in HAC's presentation]. This would imply that jacobi(n1,a1) 161| | * would have the value 0, due to Line 1 in HAC 2.149, in which case the 162| | * entire product is zero, and we can immediately return that result. 163| | */ 164| | 165| 15.4k| if(a == 1) { ------------------ | Branch (165:10): [True: 288, False: 15.1k] ------------------ 166| 288| return s; 167| 288| } 168| | 169| 15.1k| std::swap(a, n); 170| | 171| 15.1k| BOTAN_ASSERT_NOMSG(n.is_odd()); ------------------ | | 84| 15.1k| do { \ | | 85| 15.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 15.1k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 15.1k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 15.1k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 15.1k] | | ------------------ ------------------ 172| | 173| 15.1k| a %= n; 174| | 175| 15.1k| if(a == 0) { ------------------ | Branch (175:10): [True: 0, False: 15.1k] ------------------ 176| 0| return 0; 177| 0| } 178| 15.1k| } 179| 288|} _ZN5Botan13low_zero_bitsERKNS_6BigIntE: 194| 15.6k|size_t low_zero_bits(const BigInt& n) { 195| 15.6k| size_t low_zero = 0; 196| | 197| 15.6k| auto seen_nonempty_word = CT::Mask::cleared(); 198| | 199| 85.1k| for(size_t i = 0; i != n.size(); ++i) { ------------------ | Branch (199:22): [True: 69.5k, False: 15.6k] ------------------ 200| 69.5k| const word x = n.word_at(i); 201| | 202| | // ctz(0) will return sizeof(word) 203| 69.5k| const size_t tz_x = ctz(x); 204| | 205| | // if x > 0 we want to count tz_x in total but not any 206| | // further words, so set the mask after the addition 207| 69.5k| low_zero += seen_nonempty_word.if_not_set_return(tz_x); 208| | 209| 69.5k| seen_nonempty_word |= CT::Mask::expand(x); 210| 69.5k| } 211| | 212| | // if we saw no words with x > 0 then n == 0 and the value we have 213| | // computed is meaningless. Instead return BigInt::zero() in that case. 214| 15.6k| return static_cast(seen_nonempty_word.if_set_return(low_zero)); 215| 15.6k|} _ZN5Botan6PCurve15PrimeOrderCurve6Scalar8_zeroizeEv: 16| 23.6k|void PrimeOrderCurve::Scalar::_zeroize() { 17| 23.6k| secure_zeroize_buffer(m_value.data(), m_value.size() * sizeof(word)); 18| 23.6k|} _ZN5Botan6PCurve15PrimeOrderCurve11from_paramsERKNS_6BigIntES4_S4_S4_S4_S4_: 22| 311| const BigInt& p, const BigInt& a, const BigInt& b, const BigInt& base_x, const BigInt& base_y, const BigInt& order) { 23| 311|#if defined(BOTAN_HAS_PCURVES_GENERIC) 24| 311| return PCurveInstance::from_params(p, a, b, base_x, base_y, order); 25| 0|#endif 26| | 27| 0| BOTAN_UNUSED(p, a, b, base_x, base_y, order); ------------------ | | 151| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 28| 0| return {}; 29| 311|} _ZN5Botan6PCurve15PrimeOrderCurve15for_named_curveENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 32| 315|std::shared_ptr PrimeOrderCurve::for_named_curve(std::string_view name) { 33| 315|#if defined(BOTAN_HAS_PCURVES_SECP256R1) 34| 315| if(name == "secp256r1") { ------------------ | Branch (34:7): [True: 0, False: 315] ------------------ 35| 0| return PCurveInstance::secp256r1(); 36| 0| } 37| 315|#endif 38| | 39| 315|#if defined(BOTAN_HAS_PCURVES_SECP384R1) 40| 315| if(name == "secp384r1") { ------------------ | Branch (40:7): [True: 1, False: 314] ------------------ 41| 1| return PCurveInstance::secp384r1(); 42| 1| } 43| 314|#endif 44| | 45| 314|#if defined(BOTAN_HAS_PCURVES_SECP521R1) 46| 314| if(name == "secp521r1") { ------------------ | Branch (46:7): [True: 1, False: 313] ------------------ 47| 1| return PCurveInstance::secp521r1(); 48| 1| } 49| 313|#endif 50| | 51| 313|#if defined(BOTAN_HAS_PCURVES_BRAINPOOL256R1) 52| 313| if(name == "brainpool256r1") { ------------------ | Branch (52:7): [True: 0, False: 313] ------------------ 53| 0| return PCurveInstance::brainpool256r1(); 54| 0| } 55| 313|#endif 56| | 57| 313|#if defined(BOTAN_HAS_PCURVES_BRAINPOOL384R1) 58| 313| if(name == "brainpool384r1") { ------------------ | Branch (58:7): [True: 0, False: 313] ------------------ 59| 0| return PCurveInstance::brainpool384r1(); 60| 0| } 61| 313|#endif 62| | 63| 313|#if defined(BOTAN_HAS_PCURVES_BRAINPOOL512R1) 64| 313| if(name == "brainpool512r1") { ------------------ | Branch (64:7): [True: 0, False: 313] ------------------ 65| 0| return PCurveInstance::brainpool512r1(); 66| 0| } 67| 313|#endif 68| | 69| 313|#if defined(BOTAN_HAS_PCURVES_FRP256V1) 70| 313| if(name == "frp256v1") { ------------------ | Branch (70:7): [True: 0, False: 313] ------------------ 71| 0| return PCurveInstance::frp256v1(); 72| 0| } 73| 313|#endif 74| | 75| 313|#if defined(BOTAN_HAS_PCURVES_SECP192R1) 76| 313| if(name == "secp192r1") { ------------------ | Branch (76:7): [True: 0, False: 313] ------------------ 77| 0| return PCurveInstance::secp192r1(); 78| 0| } 79| 313|#endif 80| | 81| 313|#if defined(BOTAN_HAS_PCURVES_SECP224R1) 82| 313| if(name == "secp224r1") { ------------------ | Branch (82:7): [True: 1, False: 312] ------------------ 83| 1| return PCurveInstance::secp224r1(); 84| 1| } 85| 312|#endif 86| | 87| 312|#if defined(BOTAN_HAS_PCURVES_SECP256K1) 88| 312| if(name == "secp256k1") { ------------------ | Branch (88:7): [True: 1, False: 311] ------------------ 89| 1| return PCurveInstance::secp256k1(); 90| 1| } 91| 311|#endif 92| | 93| 311|#if defined(BOTAN_HAS_PCURVES_SM2P256V1) 94| 311| if(name == "sm2p256v1") { ------------------ | Branch (94:7): [True: 0, False: 311] ------------------ 95| 0| return PCurveInstance::sm2p256v1(); 96| 0| } 97| 311|#endif 98| | 99| 311|#if defined(BOTAN_HAS_PCURVES_NUMSP512D1) 100| 311| if(name == "numsp512d1") { ------------------ | Branch (100:7): [True: 0, False: 311] ------------------ 101| 0| return PCurveInstance::numsp512d1(); 102| 0| } 103| 311|#endif 104| | 105| 311| BOTAN_UNUSED(name); ------------------ | | 151| 311|#define BOTAN_UNUSED Botan::ignore_params ------------------ 106| 311| return {}; 107| 311|} _ZN5Botan6PCurve22GenericPrimeOrderCurveC2ERKNS_6BigIntES4_S4_S4_S4_S4_: 1601| 307| m_params(std::make_unique(p, a, b, base_x, base_y, order)) {} _ZN5Botan6PCurve22GenericPrimeOrderCurve20_precompute_base_mulEv: 1603| 307|void GenericPrimeOrderCurve::_precompute_base_mul() { 1604| 307| BOTAN_STATE_CHECK(m_basemul == nullptr); ------------------ | | 51| 307| do { \ | | 52| 307| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 307| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 307] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 307| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 307] | | ------------------ ------------------ 1605| 307| m_basemul = std::make_unique(from_stash(generator())); 1606| 307|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve10order_bitsEv: 1608| 568|size_t GenericPrimeOrderCurve::order_bits() const { 1609| 568| return _params().order_bits(); 1610| 568|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve19field_element_bytesEv: 1616| 532|size_t GenericPrimeOrderCurve::field_element_bytes() const { 1617| 532| return _params().field_bytes(); 1618| 532|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve12mul2_setup_gERKNS0_15PrimeOrderCurve11AffinePointE: 1654| 266| const AffinePoint& q) const { 1655| 266| return std::make_unique(from_stash(generator()), from_stash(q)); 1656| 266|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve27mul2_vartime_x_mod_order_eqERKNS0_15PrimeOrderCurve20PrecomputedMul2TableERKNS2_6ScalarES8_S8_: 1683| 261| const Scalar& s2) const { 1684| 261| const auto& tbl = dynamic_cast(tableb); 1685| 261| const auto pt = tbl.mul2_vartime(from_stash(s1), from_stash(s2)); 1686| | 1687| 261| if(!pt.is_identity().as_bool()) { ------------------ | Branch (1687:7): [True: 261, False: 0] ------------------ 1688| 261| const auto z2 = pt.z().square(); 1689| | 1690| 261| const auto v_bytes = from_stash(v).serialize>(); 1691| | 1692| 261| if(auto fe_v = GenericField::deserialize(this, v_bytes)) { ------------------ | Branch (1692:15): [True: 261, False: 0] ------------------ 1693| 261| if((*fe_v * z2 == pt.x()).as_bool()) { ------------------ | Branch (1693:13): [True: 0, False: 261] ------------------ 1694| 0| return true; 1695| 0| } 1696| | 1697| 261| if(_params().order_is_less_than_field()) { ------------------ | Branch (1697:13): [True: 261, False: 0] ------------------ 1698| 261| const auto n = GenericField::from_words(this, _params().order()); 1699| 261| const auto neg_n = n.negate().to_words(); 1700| | 1701| 261| const auto vw = fe_v->to_words(); 1702| 261| if(bigint_ct_is_lt(vw.data(), vw.size(), neg_n.data(), neg_n.size()).as_bool()) { ------------------ | Branch (1702:16): [True: 109, False: 152] ------------------ 1703| 109| return (((*fe_v + n) * z2) == pt.x()).as_bool(); 1704| 109| } 1705| 261| } 1706| 261| } 1707| 261| } 1708| | 1709| 152| return false; 1710| 261|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve9generatorEv: 1712| 573|PrimeOrderCurve::AffinePoint GenericPrimeOrderCurve::generator() const { 1713| 573| return PrimeOrderCurve::AffinePoint::_create(shared_from_this(), _params().base_x(), _params().base_y()); 1714| 573|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve24affine_point_is_identityERKNS0_15PrimeOrderCurve11AffinePointE: 1740| 266|bool GenericPrimeOrderCurve::affine_point_is_identity(const AffinePoint& pt) const { 1741| 266| return from_stash(pt).is_identity().as_bool(); 1742| 266|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve15serialize_pointENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve11AffinePointE: 1744| 266|void GenericPrimeOrderCurve::serialize_point(std::span bytes, const AffinePoint& pt) const { 1745| 266| from_stash(pt).serialize_to(bytes); 1746| 266|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve18deserialize_scalarENSt3__14spanIKhLm18446744073709551615EEE: 1754| 532| std::span bytes) const { 1755| 532| if(auto s = GenericScalar::deserialize(this, bytes)) { ------------------ | Branch (1755:12): [True: 529, False: 3] ------------------ 1756| 529| if(s->is_nonzero().as_bool()) { ------------------ | Branch (1756:10): [True: 525, False: 4] ------------------ 1757| 525| return stash(s.value()); 1758| 525| } 1759| 529| } 1760| | 1761| 7| return {}; 1762| 532|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve22scalar_from_wide_bytesENSt3__14spanIKhLm18446744073709551615EEE: 1765| 261| std::span bytes) const { 1766| 261| if(auto s = GenericScalar::from_wide_bytes(this, bytes)) { ------------------ | Branch (1766:12): [True: 261, False: 0] ------------------ 1767| 261| return stash(s.value()); 1768| 261| } else { 1769| 0| return {}; 1770| 0| } 1771| 261|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve30deserialize_point_uncompressedENSt3__14spanIKhLm18446744073709551615EEE: 1774| 310| std::span bytes) const { 1775| 310| if(auto pt = GenericAffinePoint::deserialize_uncompressed(this, bytes)) { ------------------ | Branch (1775:12): [True: 266, False: 44] ------------------ 1776| 266| return stash(pt.value()); 1777| 266| } else { 1778| 44| return {}; 1779| 44| } 1780| 310|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve10scalar_mulERKNS0_15PrimeOrderCurve6ScalarES5_: 1799| 522|PrimeOrderCurve::Scalar GenericPrimeOrderCurve::scalar_mul(const Scalar& a, const Scalar& b) const { 1800| 522| return stash(from_stash(a) * from_stash(b)); 1801| 522|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve21scalar_invert_vartimeERKNS0_15PrimeOrderCurve6ScalarE: 1811| 261|PrimeOrderCurve::Scalar GenericPrimeOrderCurve::scalar_invert_vartime(const Scalar& s) const { 1812| 261| return stash(from_stash(s).invert_vartime()); 1813| 261|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve13scalar_negateERKNS0_15PrimeOrderCurve6ScalarE: 1815| 261|PrimeOrderCurve::Scalar GenericPrimeOrderCurve::scalar_negate(const Scalar& s) const { 1816| 261| return stash(from_stash(s).negate()); 1817| 261|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve14scalar_is_zeroERKNS0_15PrimeOrderCurve6ScalarE: 1819| 783|bool GenericPrimeOrderCurve::scalar_is_zero(const Scalar& s) const { 1820| 783| return from_stash(s).is_zero().as_bool(); 1821| 783|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve5stashERKNS0_13GenericScalarE: 1835| 1.83k|PrimeOrderCurve::Scalar GenericPrimeOrderCurve::stash(const GenericScalar& s) const { 1836| 1.83k| return Scalar::_create(shared_from_this(), s.stash_value()); 1837| 1.83k|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve10from_stashERKNS0_15PrimeOrderCurve6ScalarE: 1839| 3.13k|GenericScalar GenericPrimeOrderCurve::from_stash(const PrimeOrderCurve::Scalar& s) const { 1840| 3.13k| BOTAN_ARG_CHECK(s._curve().get() == this, "Curve mismatch"); ------------------ | | 35| 3.13k| do { \ | | 36| 3.13k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 3.13k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 3.13k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 3.13k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 3.13k] | | ------------------ ------------------ 1841| 3.13k| return GenericScalar(this, s._value()); 1842| 3.13k|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve5stashERKNS0_18GenericAffinePointE: 1844| 266|PrimeOrderCurve::AffinePoint GenericPrimeOrderCurve::stash(const GenericAffinePoint& pt) const { 1845| 266| const auto x_w = pt.x().stash_value(); 1846| 266| const auto y_w = pt.y().stash_value(); 1847| 266| return AffinePoint::_create(shared_from_this(), x_w, y_w); 1848| 266|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve10from_stashERKNS0_15PrimeOrderCurve11AffinePointE: 1850| 1.37k|GenericAffinePoint GenericPrimeOrderCurve::from_stash(const PrimeOrderCurve::AffinePoint& pt) const { 1851| 1.37k| BOTAN_ARG_CHECK(pt._curve().get() == this, "Curve mismatch"); ------------------ | | 35| 1.37k| do { \ | | 36| 1.37k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.37k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.37k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.37k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.37k] | | ------------------ ------------------ 1852| 1.37k| const auto x = GenericField(this, pt._x()); 1853| 1.37k| const auto y = GenericField(this, pt._y()); 1854| 1.37k| return GenericAffinePoint(x, y); 1855| 1.37k|} _ZN5Botan6PCurve14PCurveInstance11from_paramsERKNS_6BigIntES4_S4_S4_S4_S4_: 1889| 311| const BigInt& p, const BigInt& a, const BigInt& b, const BigInt& base_x, const BigInt& base_y, const BigInt& order) { 1890| | // We don't check that p and order are prime here on the assumption this has 1891| | // been checked already by EC_Group 1892| | 1893| 311| BOTAN_ARG_CHECK(a >= 0 && a < p, "a is invalid"); ------------------ | | 35| 311| do { \ | | 36| 311| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 622| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 311, False: 0] | | | Branch (37:12): [True: 311, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 311| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 311] | | ------------------ ------------------ 1894| 311| BOTAN_ARG_CHECK(b > 0 && b < p, "b is invalid"); ------------------ | | 35| 311| do { \ | | 36| 311| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 622| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 311, False: 0] | | | Branch (37:12): [True: 311, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 311| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 311] | | ------------------ ------------------ 1895| 311| BOTAN_ARG_CHECK(base_x >= 0 && base_x < p, "base_x is invalid"); ------------------ | | 35| 311| do { \ | | 36| 311| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 622| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 311, False: 0] | | | Branch (37:12): [True: 311, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 311| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 311] | | ------------------ ------------------ 1896| 311| BOTAN_ARG_CHECK(base_y >= 0 && base_y < p, "base_y is invalid"); ------------------ | | 35| 311| do { \ | | 36| 311| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 622| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 311, False: 0] | | | Branch (37:12): [True: 311, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 311| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 311] | | ------------------ ------------------ 1897| | 1898| 311| const size_t p_bits = p.bits(); 1899| | 1900| | // Same size restrictions as EC_Group however here we do not require 1901| | // exactly the primes for the 521 or 239 bit exceptions; this code 1902| | // should work fine with any such prime and we are relying on the higher 1903| | // levels to prevent creating such a group in the first place 1904| | // 1905| | // TODO(Botan4) increase the 128 here to 192 when the corresponding EC_Group constructor is changed 1906| | // 1907| 311| if(p_bits != 521 && p_bits != 239 && (p_bits < 128 || p_bits > 512 || p_bits % 32 != 0)) { ------------------ | Branch (1907:7): [True: 311, False: 0] | Branch (1907:24): [True: 311, False: 0] | Branch (1907:42): [True: 0, False: 311] | Branch (1907:58): [True: 0, False: 311] | Branch (1907:74): [True: 0, False: 311] ------------------ 1908| 0| return {}; 1909| 0| } 1910| | 1911| | // We don't want to deal with Shanks-Tonelli in the generic case 1912| 311| if(p % 4 != 3) { ------------------ | Branch (1912:7): [True: 1, False: 310] ------------------ 1913| 1| return {}; 1914| 1| } 1915| | 1916| | // The bit length of the field and order being the same simplifies things 1917| 310| if(p_bits != order.bits()) { ------------------ | Branch (1917:7): [True: 3, False: 307] ------------------ 1918| 3| return {}; 1919| 3| } 1920| | 1921| | // Check that the (x,y) generator point is on the curve 1922| 307| const auto mod_p = Barrett_Reduction::for_public_modulus(p); 1923| 307| const BigInt y2 = mod_p.square(base_y); 1924| 307| const BigInt x3_ax_b = mod_p.reduce(mod_p.cube(base_x) + mod_p.multiply(a, base_x) + b); 1925| 307| if(y2 != x3_ax_b) { ------------------ | Branch (1925:7): [True: 0, False: 307] ------------------ 1926| 0| return {}; 1927| 0| } 1928| | 1929| 307| auto gpoc = std::make_shared(p, a, b, base_x, base_y, order); 1930| | /* 1931| | The implementation of this needs to call shared_from_this which is not usable 1932| | until after the constructor has completed, so we have to do a two-stage 1933| | construction process. This is certainly not so clean but it is contained to 1934| | this single file so seems tolerable. 1935| | 1936| | Alternately we could lazily compute the base mul table but this brings in 1937| | locking issues which seem a worse alternative overall. 1938| | */ 1939| 307| gpoc->_precompute_base_mul(); 1940| 307| return gpoc; 1941| 307|} _ZNK5Botan6PCurve18GenericCurveParams10order_bitsEv: 147| 568| size_t order_bits() const { return m_order_bits; } _ZNK5Botan6PCurve18GenericCurveParams11order_bytesEv: 149| 2.35k| size_t order_bytes() const { return m_order_bytes; } _ZNK5Botan6PCurve18GenericCurveParams11field_bytesEv: 153| 2.52k| size_t field_bytes() const { return m_field_bytes; } _ZNK5Botan6PCurve13GenericScalar5curveEv: 553| 47.7k| const GenericPrimeOrderCurve* curve() const { return m_curve; } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField3oneEPKNS0_22GenericPrimeOrderCurveE: 639| 28.6k| static GenericField one(const GenericPrimeOrderCurve* curve) { 640| 28.6k| return GenericField(curve, curve->_params().field_monty_r1()); 641| 28.6k| } _ZNK5Botan6PCurve18GenericCurveParams14field_monty_r1Ev: 163| 28.6k| const StorageUnit& field_monty_r1() const { return m_field_monty_r1; } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_114bytes_to_wordsILm18EEENSt3__18optionalINS3_5arrayImXT_EEEEENS3_4spanIKhLm18446744073709551615EEE: 28| 261|constexpr std::optional> bytes_to_words(std::span bytes) { 29| 261| if(bytes.size() > WordInfo::bytes * N) { ------------------ | Branch (29:7): [True: 0, False: 261] ------------------ 30| 0| return std::nullopt; 31| 0| } 32| | 33| 261| std::array r{}; 34| | 35| 261| const size_t full_words = bytes.size() / WordInfo::bytes; 36| 261| const size_t extra_bytes = bytes.size() % WordInfo::bytes; 37| | 38| 4.95k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (38:22): [True: 4.69k, False: 261] ------------------ 39| 4.69k| r[i] = load_be(bytes.data(), full_words - 1 - i); 40| 4.69k| } 41| | 42| 261| if(extra_bytes > 0) { ------------------ | Branch (42:7): [True: 0, False: 261] ------------------ 43| 0| const size_t shift = extra_bytes * 8; 44| 0| bigint_shl1(r.data(), r.size(), r.size(), shift); 45| | 46| 0| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (46:25): [True: 0, False: 0] ------------------ 47| 0| const word b0 = bytes[WordInfo::bytes * full_words + i]; 48| 0| r[0] |= (b0 << (8 * (extra_bytes - 1 - i))); 49| 0| } 50| 0| } 51| | 52| 261| return r; 53| 261|} pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField4redcEPKNS0_22GenericPrimeOrderCurveENSt3__15arrayImLm18EEE: 916| 10.3M| static StorageUnit redc(const GenericPrimeOrderCurve* curve, std::array z) { 917| 10.3M| const auto& mod = curve->_params().field(); 918| 10.3M| const size_t words = curve->_params().words(); 919| 10.3M| StorageUnit r{}; 920| 10.3M| StorageUnit ws{}; 921| 10.3M| bigint_monty_redc( 922| 10.3M| r.data(), z.data(), mod.data(), words, curve->_params().field_p_dash(), ws.data(), ws.size()); 923| 10.3M| return r; 924| 10.3M| } _ZNK5Botan6PCurve18GenericCurveParams5fieldEv: 159| 19.2M| const StorageUnit& field() const { return m_field; } _ZNK5Botan6PCurve18GenericCurveParams5wordsEv: 145| 15.6M| size_t words() const { return m_words; } _ZNK5Botan6PCurve18GenericCurveParams12field_p_dashEv: 173| 10.3M| word field_p_dash() const { return m_field_p_dash; } _ZNK5Botan6PCurve18GenericCurveParams3mulERNSt3__15arrayImLm18EEERKNS3_ImLm9EEES8_: 203| 7.33M| void mul(std::array& z, const std::array& x, const std::array& y) const { 204| 7.33M| clear_mem(z); 205| | 206| 7.33M| if(m_words == 4) { ------------------ | Branch (206:13): [True: 7.28M, False: 58.5k] ------------------ 207| 7.28M| bigint_comba_mul4(z.data(), x.data(), y.data()); 208| 7.28M| } else if(m_words == 6) { ------------------ | Branch (208:20): [True: 0, False: 58.5k] ------------------ 209| 0| bigint_comba_mul6(z.data(), x.data(), y.data()); 210| 58.5k| } else if(m_words == 8) { ------------------ | Branch (210:20): [True: 42.8k, False: 15.7k] ------------------ 211| 42.8k| bigint_comba_mul8(z.data(), x.data(), y.data()); 212| 42.8k| } else if(m_words == 9) { ------------------ | Branch (212:20): [True: 0, False: 15.7k] ------------------ 213| 0| bigint_comba_mul9(z.data(), x.data(), y.data()); 214| 15.7k| } else { 215| 15.7k| bigint_mul(z.data(), z.size(), x.data(), m_words, m_words, y.data(), m_words, m_words, nullptr, 0); 216| 15.7k| } 217| 7.33M| } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField7is_zeroEv: 809| 1.57M| CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_curve->_params().words()).as_choice(); } _ZN5Botan6PCurve13GenericScalar8from_repEPKNS0_22GenericPrimeOrderCurveENSt3__15arrayImLm9EEE: 577| 1.04k| static StorageUnit from_rep(const GenericPrimeOrderCurve* curve, StorageUnit z) { 578| 1.04k| std::array ze{}; 579| 1.04k| copy_mem(std::span{ze}.template first(), z); 580| 1.04k| return redc(curve, ze); 581| 1.04k| } _ZN5Botan6PCurve13GenericScalar4redcEPKNS0_22GenericPrimeOrderCurveENSt3__15arrayImLm18EEE: 567| 2.87k| static StorageUnit redc(const GenericPrimeOrderCurve* curve, std::array z) { 568| 2.87k| const auto& mod = curve->_params().order(); 569| 2.87k| const size_t words = curve->_params().words(); 570| 2.87k| StorageUnit r{}; 571| 2.87k| StorageUnit ws{}; 572| 2.87k| bigint_monty_redc( 573| 2.87k| r.data(), z.data(), mod.data(), words, curve->_params().order_p_dash(), ws.data(), ws.size()); 574| 2.87k| return r; 575| 2.87k| } _ZNK5Botan6PCurve18GenericCurveParams12order_p_dashEv: 187| 2.87k| word order_p_dash() const { return m_order_p_dash; } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField18conditional_assignERS2_S3_S3_NS_2CT6ChoiceERKS2_S7_S7_: 884| 520k| const GenericField& nz) { 885| 520k| const W mask = cond.into_bitmask(); 886| | 887| 5.20M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (887:28): [True: 4.68M, False: 520k] ------------------ 888| 4.68M| x.m_val[i] = choose(mask, nx.m_val[i], x.m_val[i]); 889| 4.68M| y.m_val[i] = choose(mask, ny.m_val[i], y.m_val[i]); 890| 4.68M| z.m_val[i] = choose(mask, nz.m_val[i], z.m_val[i]); 891| 4.68M| } 892| 520k| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_1miERKNS1_12GenericFieldES4_: 740| 2.86M| friend GenericField operator-(const GenericField& a, const GenericField& b) { return a + b.negate(); } _ZNK5Botan6PCurve18GenericCurveParams9a_is_zeroEv: 199| 629| bool a_is_zero() const { return m_a_is_zero; } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField4mul3Ev: 720| 326k| GenericField mul3() const { return mul2() + (*this); } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField4mul4Ev: 723| 260k| GenericField mul4() const { return mul2().mul2(); } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField4mul2Ev: 710| 2.30M| GenericField mul2() const { 711| 2.30M| StorageUnit t = value(); 712| 2.30M| const W carry = shift_left<1>(t); 713| | 714| 2.30M| StorageUnit r; 715| 2.30M| bigint_monty_maybe_sub(r.data(), carry, t.data(), m_curve->_params().field().data()); 716| 2.30M| return GenericField(m_curve, r); 717| 2.30M| } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField5valueEv: 907| 20.0M| const StorageUnit& value() const { return m_val; } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField4mul8Ev: 726| 260k| GenericField mul8() const { return mul2().mul2().mul2(); } _ZNK5Botan6PCurve22GenericProjectivePoint5curveEv: 1286| 337k| const GenericPrimeOrderCurve* curve() const { return m_x.curve(); } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField5curveEv: 823| 341k| const GenericPrimeOrderCurve* curve() const { return m_curve; } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField7curve_aEPKNS0_22GenericPrimeOrderCurveE: 643| 27.3k| static GenericField curve_a(const GenericPrimeOrderCurve* curve) { 644| 27.3k| return GenericField(curve, curve->_params().monty_curve_a()); 645| 27.3k| } _ZNK5Botan6PCurve18GenericCurveParams13monty_curve_aEv: 189| 27.3k| const StorageUnit& monty_curve_a() const { return m_monty_curve_a; } _ZNK5Botan6PCurve18GenericAffinePoint5curveEv: 1077| 834| const GenericPrimeOrderCurve* curve() const { return m_x.curve(); } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericFieldmLERKS2_: 750| 147k| GenericField& operator*=(const GenericField& other) { 751| 147k| const auto* curve = check_curve(*this, other); 752| | 753| 147k| std::array z; // NOLINT(*-member-init) 754| 147k| curve->_params().mul(z, value(), other.value()); 755| 147k| m_val = redc(curve, z); 756| 147k| return (*this); 757| 147k| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField11check_curveERKS2_S4_: 911| 11.0M| static const GenericPrimeOrderCurve* check_curve(const GenericField& a, const GenericField& b) { 912| 11.0M| BOTAN_STATE_CHECK(a.m_curve == b.m_curve); ------------------ | | 51| 11.0M| do { \ | | 52| 11.0M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 11.0M| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 11.0M] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 11.0M| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 11.0M] | | ------------------ ------------------ 913| 11.0M| return a.m_curve; 914| 11.0M| } _ZNK5Botan6PCurve22GenericProjectivePoint11is_identityEv: 1148| 993k| CT::Choice is_identity() const { return z().is_zero(); } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField6invertEv: 781| 573| GenericField invert() const { return pow_vartime(m_curve->_params().field_minus_2()); } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField11pow_vartimeERKNSt3__15arrayImLm9EEE: 765| 573| GenericField pow_vartime(const StorageUnit& exp) const { 766| 573| const auto one = GenericField::one(curve()); 767| 573| auto bits = curve()->_params().field_bits(); 768| 573| auto words = curve()->_params().words(); 769| 573| return impl_pow_vartime(*this, one, bits, std::span{exp}.last(words)); 770| 573| } _ZNK5Botan6PCurve18GenericCurveParams10field_bitsEv: 151| 573| size_t field_bits() const { return m_field_bits; } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_116impl_pow_vartimeINS1_12GenericFieldEEET_RKS4_S6_mNSt3__14spanIKmLm18446744073709551615EEE: 56| 573|T impl_pow_vartime(const T& elem, const T& one, size_t bits, std::span exp) { 57| 573| constexpr size_t WindowBits = 4; 58| 573| constexpr size_t WindowElements = (1 << WindowBits) - 1; 59| | 60| 573| const size_t Windows = (bits + WindowBits - 1) / WindowBits; 61| | 62| 573| std::vector tbl; 63| 573| tbl.reserve(WindowElements); 64| | 65| 573| tbl.push_back(elem); 66| | 67| 8.59k| for(size_t i = 1; i != WindowElements; ++i) { ------------------ | Branch (67:22): [True: 8.02k, False: 573] ------------------ 68| 8.02k| if(i % 2 == 1) { ------------------ | Branch (68:10): [True: 4.01k, False: 4.01k] ------------------ 69| 4.01k| tbl.push_back(tbl[i / 2].square()); 70| 4.01k| } else { 71| 4.01k| tbl.push_back(tbl[i - 1] * tbl[0]); 72| 4.01k| } 73| 8.02k| } 74| | 75| 573| auto r = one; 76| | 77| 573| const size_t w0 = read_window_bits(exp, (Windows - 1) * WindowBits); 78| | 79| 573| if(w0 > 0) { ------------------ | Branch (79:7): [True: 573, False: 0] ------------------ 80| 573| r = tbl[w0 - 1]; 81| 573| } 82| | 83| 36.7k| for(size_t i = 1; i != Windows; ++i) { ------------------ | Branch (83:22): [True: 36.1k, False: 573] ------------------ 84| 180k| for(size_t j = 0; j != WindowBits; ++j) { ------------------ | Branch (84:25): [True: 144k, False: 36.1k] ------------------ 85| 144k| r = r.square(); 86| 144k| } 87| 36.1k| const size_t w = read_window_bits(exp, (Windows - i - 1) * WindowBits); 88| | 89| 36.1k| if(w > 0) { ------------------ | Branch (89:10): [True: 36.1k, False: 0] ------------------ 90| 36.1k| r *= tbl[w - 1]; 91| 36.1k| } 92| 36.1k| } 93| | 94| 573| return r; 95| 573|} _ZNK5Botan6PCurve18GenericCurveParams13field_minus_2Ev: 161| 573| const StorageUnit& field_minus_2() const { return m_field_minus_2; } _ZN5Botan6PCurve13GenericScalar15from_wide_bytesEPKNS0_22GenericPrimeOrderCurveENSt3__14spanIKhLm18446744073709551615EEE: 296| 261| std::span bytes) { 297| 261| const size_t mlen = curve->_params().order_bytes(); 298| | 299| 261| if(bytes.size() > 2 * mlen) { ------------------ | Branch (299:13): [True: 0, False: 261] ------------------ 300| 0| return {}; 301| 0| } 302| | 303| 261| std::array padded_bytes{}; 304| 261| copy_mem(std::span{padded_bytes}.last(bytes.size()), bytes); 305| | 306| 261| auto words = bytes_to_words<2 * N>(std::span{padded_bytes}); 307| 261| if(words) { ------------------ | Branch (307:13): [True: 261, False: 0] ------------------ 308| 261| const auto in_rep = wide_to_rep(curve, words.value()); 309| 261| return GenericScalar(curve, in_rep); 310| 261| } else { 311| 0| return {}; 312| 0| } 313| 261| } _ZN5Botan6PCurve13GenericScalar11wide_to_repEPKNS0_22GenericPrimeOrderCurveENSt3__15arrayImLm18EEE: 589| 261| static StorageUnit wide_to_rep(const GenericPrimeOrderCurve* curve, std::array x) { 590| 261| const auto redc_x = redc(curve, x); 591| 261| std::array z; // NOLINT(*-member-init) 592| 261| curve->_params().mul(z, redc_x, curve->_params().order_monty_r3()); 593| 261| return redc(curve, z); 594| 261| } _ZNK5Botan6PCurve18GenericCurveParams14order_monty_r3Ev: 183| 261| const StorageUnit& order_monty_r3() const { return m_order_monty_r3; } _ZNK5Botan6PCurve22GenericProjectivePoint3dblEv: 1240| 260k| Self dbl() const { 1241| 260k| if(curve()->_params().a_is_minus_3()) { ------------------ | Branch (1241:13): [True: 259k, False: 629] ------------------ 1242| 259k| return dbl_a_minus_3(*this); 1243| 259k| } else if(curve()->_params().a_is_zero()) { ------------------ | Branch (1243:20): [True: 629, False: 0] ------------------ 1244| 629| return dbl_a_zero(*this); 1245| 629| } else { 1246| 0| const auto A = GenericField::curve_a(curve()); 1247| 0| return dbl_generic(*this, A); 1248| 0| } 1249| 260k| } _ZNK5Botan6PCurve18GenericCurveParams12a_is_minus_3Ev: 197| 282k| bool a_is_minus_3() const { return m_a_is_minus_3; } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField4div2Ev: 699| 22.1k| GenericField div2() const { 700| 22.1k| StorageUnit t = value(); 701| 22.1k| const W borrow = shift_right<1>(t); 702| | 703| | // If value was odd, add (P/2)+1 704| 22.1k| bigint_cnd_add(borrow, t.data(), m_curve->_params().field_inv_2().data(), N); 705| | 706| 22.1k| return GenericField(m_curve, t); 707| 22.1k| } _ZNK5Botan6PCurve18GenericCurveParams11field_inv_2Ev: 171| 22.1k| const StorageUnit& field_inv_2() const { return m_field_inv_2; } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_126GenericVartimeWindowedMul212mul2_vartimeERKNS0_13GenericScalarES5_: 1564| 261| GenericProjectivePoint mul2_vartime(const GenericScalar& x, const GenericScalar& y) const { 1565| 261| const auto x_bits = x.serialize>(); 1566| 261| const auto y_bits = y.serialize>(); 1567| | 1568| 261| const auto& curve = m_table[0].curve(); 1569| 261| auto accum = GenericProjectivePoint(curve); 1570| | 1571| 261| const size_t order_bits = curve->order_bits(); 1572| | 1573| 261| const size_t windows = (order_bits + WindowBits - 1) / WindowBits; 1574| | 1575| 22.7k| for(size_t i = 0; i != windows; ++i) { ------------------ | Branch (1575:28): [True: 22.4k, False: 261] ------------------ 1576| 22.4k| auto x_i = read_window_bits(std::span{x_bits}, (windows - i - 1) * WindowBits); 1577| 22.4k| auto y_i = read_window_bits(std::span{y_bits}, (windows - i - 1) * WindowBits); 1578| | 1579| 22.4k| if(i > 0) { ------------------ | Branch (1579:16): [True: 22.1k, False: 261] ------------------ 1580| 22.1k| accum = accum.dbl_n(WindowBits); 1581| 22.1k| } 1582| | 1583| 22.4k| const size_t idx = (y_i << WindowBits) + x_i; 1584| | 1585| 22.4k| if(idx > 0) { ------------------ | Branch (1585:16): [True: 21.9k, False: 496] ------------------ 1586| 21.9k| accum += m_table[idx - 1]; 1587| 21.9k| } 1588| 22.4k| } 1589| | 1590| 261| return accum; 1591| 261| } _ZN5Botan6PCurve22GenericProjectivePointC2EPKNS0_22GenericPrimeOrderCurveE: 1118| 261| m_x(GenericField::zero(curve)), m_y(GenericField::one(curve)), m_z(GenericField::zero(curve)) {} pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField4zeroEPKNS0_22GenericPrimeOrderCurveE: 634| 522| static GenericField zero(const GenericPrimeOrderCurve* curve) { 635| 522| const StorageUnit zeros{}; 636| 522| return GenericField(curve, zeros); 637| 522| } _ZNK5Botan6PCurve22GenericProjectivePoint5dbl_nEm: 1201| 22.1k| Self dbl_n(size_t n) const { 1202| 22.1k| if(curve()->_params().a_is_minus_3()) { ------------------ | Branch (1202:13): [True: 22.1k, False: 0] ------------------ 1203| 22.1k| return dbl_n_a_minus_3(*this, n); 1204| 22.1k| } else if(curve()->_params().a_is_zero()) { ------------------ | Branch (1204:20): [True: 0, False: 0] ------------------ 1205| 0| return dbl_n_a_zero(*this, n); 1206| 0| } else { 1207| 0| const auto A = GenericField::curve_a(curve()); 1208| 0| return dbl_n_generic(*this, A, n); 1209| 0| } 1210| 22.1k| } _ZN5Botan6PCurve22GenericProjectivePointpLERKNS0_18GenericAffinePointE: 1143| 21.9k| Self& operator+=(const GenericAffinePoint& other) { 1144| 21.9k| (*this) = (*this) + other; 1145| 21.9k| return (*this); 1146| 21.9k| } _ZN5Botan6PCurveplERKNS0_18GenericAffinePointERKNS0_22GenericProjectivePointE: 1136| 3.45k| friend Self operator+(const GenericAffinePoint& a, const Self& b) { return Self::add_mixed(b, a); } _ZN5Botan6PCurve22GenericProjectivePoint9add_mixedERKS1_RKNS0_18GenericAffinePointE: 1157| 27.0k| static Self add_mixed(const Self& a, const GenericAffinePoint& b) { 1158| 27.0k| return point_add_mixed( 1159| 27.0k| a, b, GenericField::one(a.curve()), GenericField::curve_a(a.curve())); 1160| 27.0k| } _ZN5Botan6PCurveplERKNS0_22GenericProjectivePointES3_: 1132| 233k| friend Self operator+(const Self& a, const Self& b) { return Self::add(a, b); } _ZN5Botan6PCurve22GenericProjectivePoint3addERKS1_S3_: 1196| 233k| static Self add(const Self& a, const Self& b) { return point_add(a, b); } pcurves_generic.cpp:_ZNK5Botan6PCurve22GenericProjectivePoint1zEv: 1284| 4.50M| const GenericField& z() const { return m_z; } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField6squareEv: 759| 3.01M| GenericField square() const { 760| 3.01M| std::array z; // NOLINT(*-member-init) 761| 3.01M| m_curve->_params().sqr(z, value()); 762| 3.01M| return GenericField(m_curve, redc(m_curve, z)); 763| 3.01M| } _ZNK5Botan6PCurve18GenericCurveParams3sqrERNSt3__15arrayImLm18EEERKNS3_ImLm9EEE: 219| 3.01M| void sqr(std::array& z, const std::array& x) const { 220| 3.01M| clear_mem(z); 221| | 222| 3.01M| if(m_words == 4) { ------------------ | Branch (222:13): [True: 2.99M, False: 22.1k] ------------------ 223| 2.99M| bigint_comba_sqr4(z.data(), x.data()); 224| 2.99M| } else if(m_words == 6) { ------------------ | Branch (224:20): [True: 0, False: 22.1k] ------------------ 225| 0| bigint_comba_sqr6(z.data(), x.data()); 226| 22.1k| } else if(m_words == 8) { ------------------ | Branch (226:20): [True: 16.0k, False: 6.11k] ------------------ 227| 16.0k| bigint_comba_sqr8(z.data(), x.data()); 228| 16.0k| } else if(m_words == 9) { ------------------ | Branch (228:20): [True: 0, False: 6.11k] ------------------ 229| 0| bigint_comba_sqr9(z.data(), x.data()); 230| 6.11k| } else { 231| 6.11k| bigint_sqr(z.data(), z.size(), x.data(), m_words, m_words, nullptr, 0); 232| 6.11k| } 233| 3.01M| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField11deserializeEPKNS0_22GenericPrimeOrderCurveENSt3__14spanIKhLm18446744073709551615EEE: 609| 881| std::span bytes) { 610| 881| const size_t len = curve->_params().field_bytes(); 611| | 612| 881| if(bytes.size() != len) { ------------------ | Branch (612:13): [True: 0, False: 881] ------------------ 613| 0| return {}; 614| 0| } 615| | 616| 881| const auto words = bytes_to_words(bytes); 617| | 618| 881| if(words) { ------------------ | Branch (618:13): [True: 881, False: 0] ------------------ 619| 881| if(!bigint_ct_is_lt(words->data(), N, curve->_params().field().data(), N).as_bool()) { ------------------ | Branch (619:16): [True: 0, False: 881] ------------------ 620| 0| return {}; 621| 0| } 622| | 623| | // Safe because we checked above that words is an integer < P 624| 881| return GenericField::from_words(curve, *words); 625| 881| } else { 626| 0| return {}; 627| 0| } 628| 881| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_114bytes_to_wordsILm9EEENSt3__18optionalINS3_5arrayImXT_EEEEENS3_4spanIKhLm18446744073709551615EEE: 28| 1.41k|constexpr std::optional> bytes_to_words(std::span bytes) { 29| 1.41k| if(bytes.size() > WordInfo::bytes * N) { ------------------ | Branch (29:7): [True: 0, False: 1.41k] ------------------ 30| 0| return std::nullopt; 31| 0| } 32| | 33| 1.41k| std::array r{}; 34| | 35| 1.41k| const size_t full_words = bytes.size() / WordInfo::bytes; 36| 1.41k| const size_t extra_bytes = bytes.size() % WordInfo::bytes; 37| | 38| 7.06k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (38:22): [True: 5.65k, False: 1.41k] ------------------ 39| 5.65k| r[i] = load_be(bytes.data(), full_words - 1 - i); 40| 5.65k| } 41| | 42| 1.41k| if(extra_bytes > 0) { ------------------ | Branch (42:7): [True: 0, False: 1.41k] ------------------ 43| 0| const size_t shift = extra_bytes * 8; 44| 0| bigint_shl1(r.data(), r.size(), r.size(), shift); 45| | 46| 0| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (46:25): [True: 0, False: 0] ------------------ 47| 0| const word b0 = bytes[WordInfo::bytes * full_words + i]; 48| 0| r[0] |= (b0 << (8 * (extra_bytes - 1 - i))); 49| 0| } 50| 0| } 51| | 52| 1.41k| return r; 53| 1.41k|} pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_1mlERKNS1_12GenericFieldES4_: 742| 7.18M| friend GenericField operator*(const GenericField& a, const GenericField& b) { 743| 7.18M| const auto* curve = check_curve(a, b); 744| | 745| 7.18M| std::array z; // NOLINT(*-member-init) 746| 7.18M| curve->_params().mul(z, a.value(), b.value()); 747| 7.18M| return GenericField(curve, redc(curve, z)); 748| 7.18M| } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericFieldeqERKS2_: 813| 680| CT::Choice operator==(const GenericField& other) const { 814| 680| if(this->m_curve != other.m_curve) { ------------------ | Branch (814:13): [True: 0, False: 680] ------------------ 815| 0| return CT::Choice::no(); 816| 0| } 817| | 818| 680| return CT::is_equal(m_val.data(), other.m_val.data(), m_curve->_params().words()).as_choice(); 819| 680| } pcurves_generic.cpp:_ZNK5Botan6PCurve22GenericProjectivePoint1xEv: 1274| 2.31M| const GenericField& x() const { return m_x; } _ZNK5Botan6PCurve18GenericCurveParams24order_is_less_than_fieldEv: 201| 261| bool order_is_less_than_field() const { return m_order_is_lt_field; } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField10from_wordsEPKNS0_22GenericPrimeOrderCurveERKNSt3__15arrayImLm9EEE: 630| 1.14k| static GenericField from_words(const GenericPrimeOrderCurve* curve, const std::array& words) { 631| 1.14k| return GenericField(curve, to_rep(curve, words)); 632| 1.14k| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField6to_repEPKNS0_22GenericPrimeOrderCurveENSt3__15arrayImLm9EEE: 932| 1.14k| static StorageUnit to_rep(const GenericPrimeOrderCurve* curve, StorageUnit x) { 933| 1.14k| std::array z{}; 934| 1.14k| curve->_params().mul(z, x, curve->_params().field_monty_r2()); 935| 1.14k| return redc(curve, z); 936| 1.14k| } _ZNK5Botan6PCurve18GenericCurveParams14field_monty_r2Ev: 165| 1.14k| const StorageUnit& field_monty_r2() const { return m_field_monty_r2; } _ZNK5Botan6PCurve18GenericCurveParams5orderEv: 175| 51.1k| const StorageUnit& order() const { return m_order; } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField6negateEv: 772| 2.86M| GenericField negate() const { 773| 2.86M| auto x_is_zero = CT::all_zeros(this->data(), N); 774| | 775| 2.86M| StorageUnit r; 776| 2.86M| bigint_sub3(r.data(), m_curve->_params().field().data(), N, this->data(), N); 777| 2.86M| x_is_zero.if_set_zero_out(r.data(), N); 778| 2.86M| return GenericField(m_curve, r); 779| 2.86M| } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField4dataEv: 909| 13.1M| const W* data() const { return m_val.data(); } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField8to_wordsEv: 833| 522| StorageUnit to_words() const { return from_rep(m_curve, m_val); } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField8from_repEPKNS0_22GenericPrimeOrderCurveENSt3__15arrayImLm9EEE: 926| 1.05k| static StorageUnit from_rep(const GenericPrimeOrderCurve* curve, StorageUnit z) { 927| 1.05k| std::array ze{}; 928| 1.05k| copy_mem(std::span{ze}.template first(), z); 929| 1.05k| return redc(curve, ze); 930| 1.05k| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_1plERKNS1_12GenericFieldES4_: 728| 3.71M| friend GenericField operator+(const GenericField& a, const GenericField& b) { 729| 3.71M| const auto* curve = check_curve(a, b); 730| 3.71M| const size_t words = curve->_params().words(); 731| | 732| 3.71M| StorageUnit t{}; 733| 3.71M| const W carry = bigint_add3(t.data(), a.data(), words, b.data(), words); 734| | 735| 3.71M| StorageUnit r{}; 736| 3.71M| bigint_monty_maybe_sub(words, r.data(), carry, t.data(), curve->_params().field().data()); 737| 3.71M| return GenericField(curve, r); 738| 3.71M| } _ZNK5Botan6PCurve18GenericCurveParams6base_xEv: 193| 573| const StorageUnit& base_x() const { return m_base_x; } _ZNK5Botan6PCurve18GenericCurveParams6base_yEv: 195| 573| const StorageUnit& base_y() const { return m_base_y; } pcurves_generic.cpp:_ZNK5Botan6PCurve18GenericAffinePoint1yEv: 1068| 83.7k| const GenericField& y() const { return m_y; } pcurves_generic.cpp:_ZN5Botan6PCurve18GenericAffinePoint7x3_ax_bERKNS0_12_GLOBAL__N_112GenericFieldE: 1009| 310| static GenericField x3_ax_b(const GenericField& x) { 1010| 310| return (x.square() + GenericField::curve_a(x.curve())) * x + GenericField::curve_b(x.curve()); 1011| 310| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField7curve_bEPKNS0_22GenericPrimeOrderCurveE: 647| 310| static GenericField curve_b(const GenericPrimeOrderCurve* curve) { 648| 310| return GenericField(curve, curve->_params().monty_curve_b()); 649| 310| } _ZNK5Botan6PCurve18GenericCurveParams13monty_curve_bEv: 191| 310| const StorageUnit& monty_curve_b() const { return m_monty_curve_b; } pcurves_generic.cpp:_ZNK5Botan6PCurve18GenericAffinePoint1xEv: 1063| 83.7k| const GenericField& x() const { return m_x; } _ZNK5Botan6PCurve18GenericAffinePoint11is_identityEv: 969| 28.3k| CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); } _ZN5Botan6PCurveplERKNS0_22GenericProjectivePointERKNS0_18GenericAffinePointE: 1134| 23.5k| friend Self operator+(const Self& a, const GenericAffinePoint& b) { return Self::add_mixed(a, b); } _ZN5Botan6PCurve22GenericProjectivePoint11from_affineERKNS0_18GenericAffinePointE: 1097| 839| static Self from_affine(const GenericAffinePoint& pt) { 1098| 839| const auto x = pt.x(); 1099| 839| auto y = pt.y(); 1100| 839| auto z = GenericField::one(x.curve()); 1101| | 1102| | // If pt is identity (0,0) swap y/z to convert (0,0,1) into (0,1,0) 1103| 839| GenericField::conditional_swap(pt.is_identity(), y, z); 1104| 839| return GenericProjectivePoint(x, y, z); 1105| 839| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField16conditional_swapENS_2CT6ChoiceERS2_S5_: 839| 839| static void conditional_swap(CT::Choice cond, GenericField& x, GenericField& y) { 840| 839| const W mask = cond.into_bitmask(); 841| | 842| 8.39k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (842:28): [True: 7.55k, False: 839] ------------------ 843| 7.55k| const auto nx = choose(mask, y.m_val[i], x.m_val[i]); 844| 7.55k| const auto ny = choose(mask, x.m_val[i], y.m_val[i]); 845| 7.55k| x.m_val[i] = nx; 846| 7.55k| y.m_val[i] = ny; 847| 7.55k| } 848| 839| } _ZNK5Botan6PCurve18GenericAffinePoint12serialize_toENSt3__14spanIhLm18446744073709551615EEE: 976| 266| void serialize_to(std::span bytes) const { 977| 266| const size_t fe_bytes = curve()->_params().field_bytes(); 978| 266| BOTAN_ARG_CHECK(bytes.size() == 1 + 2 * fe_bytes, "Buffer size incorrect"); ------------------ | | 35| 266| do { \ | | 36| 266| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 266| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 266] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 266| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 266] | | ------------------ ------------------ 979| 266| BOTAN_STATE_CHECK(this->is_identity().as_bool() == false); ------------------ | | 51| 266| do { \ | | 52| 266| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 266| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 266] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 266| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 266] | | ------------------ ------------------ 980| 266| BufferStuffer pack(bytes); 981| 266| pack.append(0x04); 982| 266| x().serialize_to(pack.next(fe_bytes)); 983| 266| y().serialize_to(pack.next(fe_bytes)); 984| 266| BOTAN_DEBUG_ASSERT(pack.full()); ------------------ | | 137| 266| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 266| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 266] | | ------------------ ------------------ 985| 266| } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField12serialize_toENSt3__14spanIhLm18446744073709551615EEE: 796| 532| void serialize_to(std::span bytes) const { 797| 532| auto v = from_rep(m_curve, m_val); 798| 532| std::reverse(v.begin(), v.end()); 799| | 800| 532| const size_t flen = m_curve->_params().field_bytes(); 801| 532| BOTAN_ARG_CHECK(bytes.size() == flen, "Expected output span provided"); ------------------ | | 35| 532| do { \ | | 36| 532| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 532| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 532] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 532| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 532] | | ------------------ ------------------ 802| | 803| | // Remove leading zero bytes 804| 532| const auto padded_bytes = store_be(v); 805| 532| const size_t extra = N * WordInfo::bytes - flen; 806| 532| copy_mem(bytes, std::span{padded_bytes}.subspan(extra, flen)); 807| 532| } _ZNK5Botan6PCurve13GenericScalar12serialize_toENSt3__14spanIhLm18446744073709551615EEE: 521| 783| void serialize_to(std::span bytes) const { 522| 783| auto v = from_rep(m_curve, m_val); 523| 783| std::reverse(v.begin(), v.end()); 524| | 525| 783| const size_t flen = m_curve->_params().order_bytes(); 526| 783| BOTAN_ARG_CHECK(bytes.size() == flen, "Expected output span provided"); ------------------ | | 35| 783| do { \ | | 36| 783| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 783| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 783] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 783| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 783] | | ------------------ ------------------ 527| | 528| | // Remove leading zero bytes 529| 783| const auto padded_bytes = store_be(v); 530| 783| const size_t extra = N * WordInfo::bytes - flen; 531| 783| copy_mem(bytes, std::span{padded_bytes}.subspan(extra, flen)); 532| 783| } _ZN5Botan6PCurve13GenericScalar11deserializeEPKNS0_22GenericPrimeOrderCurveENSt3__14spanIKhLm18446744073709551615EEE: 316| 532| std::span bytes) { 317| 532| const size_t len = curve->_params().order_bytes(); 318| | 319| 532| if(bytes.size() != len) { ------------------ | Branch (319:13): [True: 0, False: 532] ------------------ 320| 0| return {}; 321| 0| } 322| | 323| 532| const auto words = bytes_to_words(bytes); 324| | 325| 532| if(words) { ------------------ | Branch (325:13): [True: 532, False: 0] ------------------ 326| 532| if(!bigint_ct_is_lt(words->data(), N, curve->_params().order().data(), N).as_bool()) { ------------------ | Branch (326:16): [True: 3, False: 529] ------------------ 327| 3| return {}; 328| 3| } 329| | 330| | // Safe because we checked above that words is an integer < P 331| 529| return GenericScalar(curve, to_rep(curve, *words)); 332| 532| } else { 333| 0| return {}; 334| 0| } 335| 532| } _ZN5Botan6PCurve13GenericScalar6to_repEPKNS0_22GenericPrimeOrderCurveENSt3__15arrayImLm9EEE: 583| 790| static StorageUnit to_rep(const GenericPrimeOrderCurve* curve, StorageUnit x) { 584| 790| std::array z; // NOLINT(*-member-init) 585| 790| curve->_params().mul(z, x, curve->_params().order_monty_r2()); 586| 790| return redc(curve, z); 587| 790| } _ZNK5Botan6PCurve18GenericCurveParams14order_monty_r2Ev: 181| 790| const StorageUnit& order_monty_r2() const { return m_order_monty_r2; } _ZNK5Botan6PCurve13GenericScalar10is_nonzeroEv: 536| 529| CT::Choice is_nonzero() const { return !is_zero(); } _ZN5Botan6PCurve18GenericAffinePoint24deserialize_uncompressedEPKNS0_22GenericPrimeOrderCurveENSt3__14spanIKhLm18446744073709551615EEE: 1017| 310| std::span bytes) { 1018| 310| const size_t fe_bytes = curve->_params().field_bytes(); 1019| | 1020| 310| if(bytes.size() == 1 + 2 * fe_bytes && bytes[0] == 0x04) { ------------------ | Branch (1020:13): [True: 310, False: 0] | Branch (1020:49): [True: 310, False: 0] ------------------ 1021| 310| auto x = GenericField::deserialize(curve, bytes.subspan(1, fe_bytes)); 1022| 310| auto y = GenericField::deserialize(curve, bytes.subspan(1 + fe_bytes, fe_bytes)); 1023| | 1024| 310| if(x && y) { ------------------ | Branch (1024:16): [True: 310, False: 0] | Branch (1024:21): [True: 310, False: 0] ------------------ 1025| 310| const auto lhs = (*y).square(); 1026| 310| const auto rhs = GenericAffinePoint::x3_ax_b(*x); 1027| 310| if((lhs == rhs).as_bool()) { ------------------ | Branch (1027:19): [True: 266, False: 44] ------------------ 1028| 266| return GenericAffinePoint(*x, *y); 1029| 266| } 1030| 310| } 1031| 310| } 1032| | 1033| 44| return {}; 1034| 310| } _ZN5Botan6PCurveplERKNS0_13GenericScalarES3_: 373| 46.6k| friend GenericScalar operator+(const GenericScalar& a, const GenericScalar& b) { 374| 46.6k| const auto* curve = check_curve(a, b); 375| 46.6k| const size_t words = curve->_params().words(); 376| | 377| 46.6k| StorageUnit t{}; 378| 46.6k| const W carry = bigint_add3(t.data(), a.data(), words, b.data(), words); 379| | 380| 46.6k| StorageUnit r{}; 381| 46.6k| bigint_monty_maybe_sub(words, r.data(), carry, t.data(), curve->_params().order().data()); 382| 46.6k| return GenericScalar(curve, r); 383| 46.6k| } _ZN5Botan6PCurve13GenericScalar11check_curveERKS1_S3_: 562| 47.1k| static const GenericPrimeOrderCurve* check_curve(const GenericScalar& a, const GenericScalar& b) { 563| 47.1k| BOTAN_STATE_CHECK(a.m_curve == b.m_curve); ------------------ | | 51| 47.1k| do { \ | | 52| 47.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 47.1k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 47.1k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 47.1k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 47.1k] | | ------------------ ------------------ 564| 47.1k| return a.m_curve; 565| 47.1k| } _ZNK5Botan6PCurve13GenericScalar4dataEv: 560| 234k| const W* data() const { return m_val.data(); } _ZN5Botan6PCurvemlERKNS0_13GenericScalarES3_: 387| 522| friend GenericScalar operator*(const GenericScalar& a, const GenericScalar& b) { 388| 522| const auto* curve = check_curve(a, b); 389| | 390| 522| std::array z; // NOLINT(*-member-init) 391| 522| curve->_params().mul(z, a.value(), b.value()); 392| 522| return GenericScalar(curve, redc(curve, z)); 393| 522| } _ZNK5Botan6PCurve13GenericScalar5valueEv: 558| 1.04k| const StorageUnit& value() const { return m_val; } _ZNK5Botan6PCurve13GenericScalar14invert_vartimeEv: 456| 261| GenericScalar invert_vartime() const { 457| 261| if(this->is_zero().as_bool()) { ------------------ | Branch (457:13): [True: 0, False: 261] ------------------ 458| 0| return (*this); 459| 0| } 460| | 461| 261| auto x = GenericScalar(m_curve, std::array{1}); 462| 261| auto b = GenericScalar(m_curve, from_rep(m_curve, m_val)); 463| | 464| | // First loop iteration 465| 261| GenericScalar::_invert_vartime_div2_helper(b, x); 466| | 467| 261| auto a = b.negate(); 468| | // y += x but y is zero at the outset 469| 261| auto y = x; 470| | 471| | // First half of second loop iteration 472| 261| GenericScalar::_invert_vartime_div2_helper(a, y); 473| | 474| 46.9k| for(;;) { 475| | // Conditional ok: this function is variable time 476| 46.9k| if(a.m_val == b.m_val) { ------------------ | Branch (476:16): [True: 261, False: 46.6k] ------------------ 477| | // At this point it should be that a == b == 1 478| 261| const auto r = y.negate(); 479| | 480| | // Convert back to Montgomery 481| 261| return GenericScalar(curve(), to_rep(curve(), r.m_val)); 482| 261| } 483| | 484| 46.6k| const auto nx = x + y; 485| | 486| | /* 487| | * Otherwise either b > a or a > b 488| | * 489| | * If b > a we want to set b to b - a 490| | * Otherwise we want to set a to a - b 491| | * 492| | * Compute r = b - a and check if it underflowed 493| | * If it did not then we are in the b > a path 494| | */ 495| 46.6k| std::array r{}; 496| 46.6k| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 497| | 498| | // Conditional ok: this function is variable time 499| 46.6k| if(carry == 0) { ------------------ | Branch (499:16): [True: 23.3k, False: 23.2k] ------------------ 500| | // b > a 501| 23.3k| b.m_val = r; 502| 23.3k| x = nx; 503| 23.3k| GenericScalar::_invert_vartime_div2_helper(b, x); 504| 23.3k| } else { 505| | // We know this can't underflow because a > b 506| 23.2k| bigint_sub3(r.data(), a.data(), N, b.data(), N); 507| 23.2k| a.m_val = r; 508| 23.2k| y = nx; 509| 23.2k| GenericScalar::_invert_vartime_div2_helper(a, y); 510| 23.2k| } 511| 46.6k| } 512| 261| } _ZN5Botan6PCurve13GenericScalar27_invert_vartime_div2_helperERS1_S2_: 437| 47.1k| static void _invert_vartime_div2_helper(GenericScalar& a, GenericScalar& x) { 438| 47.1k| const auto& inv_2 = a.curve()->_params().order_inv_2(); 439| | 440| | // Conditional ok: this function is variable time 441| 141k| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (441:16): [True: 94.4k, False: 47.1k] ------------------ 442| 94.4k| shift_right<1>(a.m_val); 443| | 444| 94.4k| const W borrow = shift_right<1>(x.m_val); 445| | 446| | // Conditional ok: this function is variable time 447| 94.4k| if(borrow > 0) { ------------------ | Branch (447:16): [True: 47.3k, False: 47.1k] ------------------ 448| 47.3k| bigint_add2(x.m_val.data(), N, inv_2.data(), N); 449| 47.3k| } 450| 94.4k| } 451| 47.1k| } _ZNK5Botan6PCurve18GenericCurveParams11order_inv_2Ev: 185| 47.1k| const StorageUnit& order_inv_2() const { return m_order_inv_2; } _ZNK5Botan6PCurve13GenericScalar6negateEv: 419| 783| GenericScalar negate() const { 420| 783| auto x_is_zero = CT::all_zeros(this->data(), N); 421| | 422| 783| StorageUnit r; 423| 783| bigint_sub3(r.data(), m_curve->_params().order().data(), N, this->data(), N); 424| 783| x_is_zero.if_set_zero_out(r.data(), N); 425| 783| return GenericScalar(m_curve, r); 426| 783| } _ZNK5Botan6PCurve13GenericScalar7is_zeroEv: 534| 1.57k| CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_curve->_params().words()).as_choice(); } _ZNK5Botan6PCurve13GenericScalar11stash_valueEv: 551| 1.83k| const StorageUnit& stash_value() const { return m_val; } _ZN5Botan6PCurve13GenericScalarC2EPKNS0_22GenericPrimeOrderCurveENSt3__15arrayImLm9EEE: 555| 52.6k| GenericScalar(const GenericPrimeOrderCurve* curve, StorageUnit val) : m_curve(curve), m_val(val) {} pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField11stash_valueEv: 821| 532| const StorageUnit& stash_value() const { return m_val; } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericFieldC2EPKNS0_22GenericPrimeOrderCurveENSt3__15arrayImLm9EEE: 904| 19.1M| GenericField(const GenericPrimeOrderCurve* curve, StorageUnit val) : m_curve(curve), m_val(val) {} pcurves_generic.cpp:_ZN5Botan6PCurve18GenericAffinePointC2ERKNS0_12_GLOBAL__N_112GenericFieldES5_: 958| 500k| GenericAffinePoint(const GenericField& x, const GenericField& y) : m_x(x), m_y(y) {} pcurves_generic.cpp:_ZNK5Botan6PCurve22GenericProjectivePoint1yEv: 1279| 2.05M| const GenericField& y() const { return m_y; } pcurves_generic.cpp:_ZN5Botan6PCurve22GenericProjectivePointC2ERKNS0_12_GLOBAL__N_112GenericFieldES5_S5_: 1130| 543k| m_x(x), m_y(y), m_z(z) {} _ZNK5Botan6PCurve13GenericScalar9serializeITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS4_9allocatorIhEEEEEET_v: 515| 783| T serialize() const { 516| 783| T bytes(m_curve->_params().order_bytes()); 517| 783| this->serialize_to(bytes); 518| 783| return bytes; 519| 783| } _ZN5Botan6PCurve18GenericCurveParamsC2ERKNS_6BigIntES4_S4_S4_S4_S4_: 110| 307| m_words(p.sig_words()), 111| 307| m_order_bits(order.bits()), 112| 307| m_order_bytes(order.bytes()), 113| 307| m_field_bits(p.bits()), 114| 307| m_field_bytes(p.bytes()), 115| 307| m_monty_order(order), 116| 307| m_monty_field(p), 117| 307| m_field(bn_to_fixed(p)), 118| 307| m_field_minus_2(bn_to_fixed_rev(p - 2)), 119| 307| m_field_monty_r1(bn_to_fixed(m_monty_field.R1())), 120| 307| m_field_monty_r2(bn_to_fixed(m_monty_field.R2())), 121| 307| m_field_monty_r3(bn_to_fixed(m_monty_field.R3())), 122| 307| m_field_p_plus_1_over_4(bn_to_fixed_rev((p + 1) / 4)), 123| 307| m_field_inv_2(bn_to_fixed((p / 2) + 1)), 124| 307| m_field_p_dash(m_monty_field.p_dash()), 125| | 126| 307| m_order(bn_to_fixed(order)), 127| 307| m_order_minus_2(bn_to_fixed_rev(order - 2)), 128| 307| m_order_monty_r1(bn_to_fixed(m_monty_order.R1())), 129| 307| m_order_monty_r2(bn_to_fixed(m_monty_order.R2())), 130| 307| m_order_monty_r3(bn_to_fixed(m_monty_order.R3())), 131| 307| m_order_inv_2(bn_to_fixed((order / 2) + 1)), 132| 307| m_order_p_dash(m_monty_order.p_dash()), 133| | 134| 307| m_a_is_minus_3(a + 3 == p), 135| 307| m_a_is_zero(a.is_zero()), 136| 307| m_order_is_lt_field(order < p) { 137| 307| secure_vector ws; 138| 307| m_monty_curve_a = bn_to_fixed(m_monty_field.mul(a, m_monty_field.R2(), ws)); 139| 307| m_monty_curve_b = bn_to_fixed(m_monty_field.mul(b, m_monty_field.R2(), ws)); 140| | 141| 307| m_base_x = bn_to_fixed(m_monty_field.mul(base_x, m_monty_field.R2(), ws)); 142| 307| m_base_y = bn_to_fixed(m_monty_field.mul(base_y, m_monty_field.R2(), ws)); 143| 307| } _ZN5Botan6PCurve18GenericCurveParams11bn_to_fixedERKNS_6BigIntE: 236| 5.21k| static std::array bn_to_fixed(const BigInt& n) { 237| 5.21k| const size_t n_words = n.sig_words(); 238| 5.21k| BOTAN_ASSERT_NOMSG(n_words <= PrimeOrderCurve::StorageWords); ------------------ | | 84| 5.21k| do { \ | | 85| 5.21k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 5.21k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 5.21k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 5.21k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 5.21k] | | ------------------ ------------------ 239| | 240| 5.21k| std::array r{}; 241| 5.21k| copy_mem(std::span{r}.first(n_words), n._as_span().first(n_words)); 242| 5.21k| return r; 243| 5.21k| } _ZN5Botan6PCurve18GenericCurveParams15bn_to_fixed_revERKNS_6BigIntE: 245| 921| static std::array bn_to_fixed_rev(const BigInt& n) { 246| 921| auto v = bn_to_fixed(n); 247| 921| std::reverse(v.begin(), v.end()); 248| 921| return v; 249| 921| } _ZN5Botan6PCurve19GenericBaseMulTableC2ERKNS0_18GenericAffinePointE: 1509| 307| m_table(basemul_booth_setup(pt, blinded_scalar_bits(*pt.curve()) + 1)) {} pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField14invert_vartimeEv: 783| 573| GenericField invert_vartime() const { 784| | // TODO take advantage of variable time here using eg BEEA 785| | // see IntMod::invert_vartime in pcurves_impl.h 786| 573| return invert(); 787| 573| } _ZN5Botan6PCurve19GenericBaseMulTable19blinded_scalar_bitsERKNS0_22GenericPrimeOrderCurveE: 1519| 307| static size_t blinded_scalar_bits(const GenericPrimeOrderCurve& curve) { 1520| 307| const size_t order_bits = curve.order_bits(); 1521| 307| return order_bits + scalar_blinding_bits(order_bits); 1522| 307| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_126GenericVartimeWindowedMul2C2ERKNS0_18GenericAffinePointES5_: 1562| 266| m_table(to_affine_batch(mul2_setup(p, q))) {} pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_126GenericVartimeWindowedMul2D2Ev: 1559| 266| ~GenericVartimeWindowedMul2() override = default; _ZN5Botan6PCurve14PCurveInstance9secp224r1Ev: 223| 1|std::shared_ptr PCurveInstance::secp224r1() { 224| 1| return PrimeOrderCurveImpl::instance(); 225| 1|} pcurves_secp224r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE3oneEv: 69| 20.0k| constexpr static std::array one() { return std::array{1}; } pcurves_secp224r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE4redcERKNSt3__15arrayImLm8EEE: 25| 1.07M| constexpr static std::array redc(const std::array& z) { 26| 1.07M| const int64_t X00 = get_uint32(z.data(), 0); 27| 1.07M| const int64_t X01 = get_uint32(z.data(), 1); 28| 1.07M| const int64_t X02 = get_uint32(z.data(), 2); 29| 1.07M| const int64_t X03 = get_uint32(z.data(), 3); 30| 1.07M| const int64_t X04 = get_uint32(z.data(), 4); 31| 1.07M| const int64_t X05 = get_uint32(z.data(), 5); 32| 1.07M| const int64_t X06 = get_uint32(z.data(), 6); 33| 1.07M| const int64_t X07 = get_uint32(z.data(), 7); 34| 1.07M| const int64_t X08 = get_uint32(z.data(), 8); 35| 1.07M| const int64_t X09 = get_uint32(z.data(), 9); 36| 1.07M| const int64_t X10 = get_uint32(z.data(), 10); 37| 1.07M| const int64_t X11 = get_uint32(z.data(), 11); 38| 1.07M| const int64_t X12 = get_uint32(z.data(), 12); 39| 1.07M| const int64_t X13 = get_uint32(z.data(), 13); 40| | 41| 1.07M| const int64_t S0 = 0x00000001 + X00 - X07 - X11; 42| 1.07M| const int64_t S1 = 0x00000000 + X01 - X08 - X12; 43| 1.07M| const int64_t S2 = 0x00000000 + X02 - X09 - X13; 44| 1.07M| const int64_t S3 = 0xFFFFFFFF + X03 + X07 + X11 - X10; 45| 1.07M| const int64_t S4 = 0xFFFFFFFF + X04 + X08 + X12 - X11; 46| 1.07M| const int64_t S5 = 0xFFFFFFFF + X05 + X09 + X13 - X12; 47| 1.07M| const int64_t S6 = 0xFFFFFFFF + X06 + X10 - X13; 48| | 49| 1.07M| std::array r = {}; 50| | 51| 1.07M| SolinasAccum sum(r); 52| | 53| 1.07M| sum.accum(S0); 54| 1.07M| sum.accum(S1); 55| 1.07M| sum.accum(S2); 56| 1.07M| sum.accum(S3); 57| 1.07M| sum.accum(S4); 58| 1.07M| sum.accum(S5); 59| 1.07M| sum.accum(S6); 60| 1.07M| const auto S = sum.final_carry(0); 61| | 62| 1.07M| BOTAN_DEBUG_ASSERT(S <= 2); ------------------ | | 137| 1.07M| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.07M| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.07M] | | ------------------ ------------------ 63| | 64| 1.07M| solinas_correct_redc(r, P, p224_mul_mod_224(S)); 65| | 66| 1.07M| return r; 67| 1.07M| } pcurves_secp224r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE16p224_mul_mod_224Em: 81| 1.07M| constexpr static std::array p224_mul_mod_224(W i) { 82| 1.07M| static_assert(WordInfo::bits == 32 || WordInfo::bits == 64); 83| | 84| | // For small i, multiples of P-224 have a simple structure so it's faster to 85| | // compute the value directly vs a (constant time) table lookup 86| | 87| 1.07M| auto r = P; 88| | 89| | if constexpr(WordInfo::bits == 32) { 90| | r[3] -= i; 91| | r[0] += i; 92| 1.07M| } else { 93| 1.07M| const W i32 = i << 32; 94| 1.07M| r[1] -= i32; 95| 1.07M| r[0] += i; 96| 1.07M| } 97| 1.07M| return r; 98| 1.07M| } pcurves_secp224r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE8from_repERKNSt3__15arrayImLm4EEE: 75| 406| constexpr static std::array from_rep(const std::array& z) { return z; } pcurves_secp224r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE6to_repERKNSt3__15arrayImLm4EEE: 71| 210| constexpr static std::array to_rep(const std::array& x) { return x; } _ZN5Botan6PCurve14PCurveInstance9secp256k1Ev: 233| 1|std::shared_ptr PCurveInstance::secp256k1() { 234| 1| return PrimeOrderCurveImpl::instance(); 235| 1|} pcurves_secp256k1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE3oneEv: 28| 1| constexpr static std::array one() { return std::array{1}; } pcurves_secp256k1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE4redcERKNSt3__15arrayImLm8EEE: 30| 28.5k| constexpr static std::array redc(const std::array& z) { 31| 28.5k| return redc_crandall(std::span{z}); 32| 28.5k| } pcurves_secp256k1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE8from_repERKNSt3__15arrayImLm4EEE: 38| 1| constexpr static std::array from_rep(const std::array& z) { return z; } pcurves_secp256k1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE6to_repERKNSt3__15arrayImLm4EEE: 34| 1| constexpr static std::array to_rep(const std::array& x) { return x; } _ZN5Botan6PCurve14PCurveInstance9secp384r1Ev: 343| 1|std::shared_ptr PCurveInstance::secp384r1() { 344| 1| return PrimeOrderCurveImpl::instance(); 345| 1|} pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE3oneEv: 88| 48.6k| constexpr static std::array one() { return std::array{1}; } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE4redcERKNSt3__15arrayImLm12EEE: 23| 1.80M| constexpr static std::array redc(const std::array& z) { 24| 1.80M| const int64_t X00 = get_uint32(z.data(), 0); 25| 1.80M| const int64_t X01 = get_uint32(z.data(), 1); 26| 1.80M| const int64_t X02 = get_uint32(z.data(), 2); 27| 1.80M| const int64_t X03 = get_uint32(z.data(), 3); 28| 1.80M| const int64_t X04 = get_uint32(z.data(), 4); 29| 1.80M| const int64_t X05 = get_uint32(z.data(), 5); 30| 1.80M| const int64_t X06 = get_uint32(z.data(), 6); 31| 1.80M| const int64_t X07 = get_uint32(z.data(), 7); 32| 1.80M| const int64_t X08 = get_uint32(z.data(), 8); 33| 1.80M| const int64_t X09 = get_uint32(z.data(), 9); 34| 1.80M| const int64_t X10 = get_uint32(z.data(), 10); 35| 1.80M| const int64_t X11 = get_uint32(z.data(), 11); 36| 1.80M| const int64_t X12 = get_uint32(z.data(), 12); 37| 1.80M| const int64_t X13 = get_uint32(z.data(), 13); 38| 1.80M| const int64_t X14 = get_uint32(z.data(), 14); 39| 1.80M| const int64_t X15 = get_uint32(z.data(), 15); 40| 1.80M| const int64_t X16 = get_uint32(z.data(), 16); 41| 1.80M| const int64_t X17 = get_uint32(z.data(), 17); 42| 1.80M| const int64_t X18 = get_uint32(z.data(), 18); 43| 1.80M| const int64_t X19 = get_uint32(z.data(), 19); 44| 1.80M| const int64_t X20 = get_uint32(z.data(), 20); 45| 1.80M| const int64_t X21 = get_uint32(z.data(), 21); 46| 1.80M| const int64_t X22 = get_uint32(z.data(), 22); 47| 1.80M| const int64_t X23 = get_uint32(z.data(), 23); 48| | 49| | // One copy of P-384 is added to prevent underflow 50| 1.80M| const int64_t S0 = 0xFFFFFFFF + X00 + X12 + X20 + X21 - X23; 51| 1.80M| const int64_t S1 = 0x00000000 + X01 + X13 + X22 + X23 - X12 - X20; 52| 1.80M| const int64_t S2 = 0x00000000 + X02 + X14 + X23 - X13 - X21; 53| 1.80M| const int64_t S3 = 0xFFFFFFFF + X03 + X12 + X15 + X20 + X21 - X14 - X22 - X23; 54| 1.80M| const int64_t S4 = 0xFFFFFFFE + X04 + X12 + X13 + X16 + X20 + X21 * 2 + X22 - X15 - X23 * 2; 55| 1.80M| const int64_t S5 = 0xFFFFFFFF + X05 + X13 + X14 + X17 + X21 + X22 * 2 + X23 - X16; 56| 1.80M| const int64_t S6 = 0xFFFFFFFF + X06 + X14 + X15 + X18 + X22 + X23 * 2 - X17; 57| 1.80M| const int64_t S7 = 0xFFFFFFFF + X07 + X15 + X16 + X19 + X23 - X18; 58| 1.80M| const int64_t S8 = 0xFFFFFFFF + X08 + X16 + X17 + X20 - X19; 59| 1.80M| const int64_t S9 = 0xFFFFFFFF + X09 + X17 + X18 + X21 - X20; 60| 1.80M| const int64_t SA = 0xFFFFFFFF + X10 + X18 + X19 + X22 - X21; 61| 1.80M| const int64_t SB = 0xFFFFFFFF + X11 + X19 + X20 + X23 - X22; 62| | 63| 1.80M| std::array r = {}; 64| | 65| 1.80M| SolinasAccum sum(r); 66| | 67| 1.80M| sum.accum(S0); 68| 1.80M| sum.accum(S1); 69| 1.80M| sum.accum(S2); 70| 1.80M| sum.accum(S3); 71| 1.80M| sum.accum(S4); 72| 1.80M| sum.accum(S5); 73| 1.80M| sum.accum(S6); 74| 1.80M| sum.accum(S7); 75| 1.80M| sum.accum(S8); 76| 1.80M| sum.accum(S9); 77| 1.80M| sum.accum(SA); 78| 1.80M| sum.accum(SB); 79| 1.80M| const auto S = sum.final_carry(0); 80| | 81| 1.80M| BOTAN_DEBUG_ASSERT(S <= 4); ------------------ | | 137| 1.80M| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.80M| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.80M] | | ------------------ ------------------ 82| | 83| 1.80M| solinas_correct_redc(r, P, p384_mul_mod_384(S)); 84| | 85| 1.80M| return r; 86| 1.80M| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE16p384_mul_mod_384Em: 100| 1.80M| constexpr static std::array p384_mul_mod_384(W i) { 101| 1.80M| static_assert(WordInfo::bits == 32 || WordInfo::bits == 64); 102| | 103| | // For small i, multiples of P-384 have a simple structure so it's faster to 104| | // compute the value directly vs a (constant time) table lookup 105| | 106| 1.80M| auto r = P; 107| | if constexpr(WordInfo::bits == 32) { 108| | r[4] -= i; 109| | r[3] -= i; 110| | r[1] += i; 111| | r[0] -= i; 112| 1.80M| } else { 113| 1.80M| const uint64_t i32 = static_cast(i) << 32; 114| 1.80M| r[2] -= i; 115| 1.80M| r[1] -= i32; 116| 1.80M| r[0] += i32; 117| 1.80M| r[0] -= i; 118| 1.80M| } 119| 1.80M| return r; 120| 1.80M| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE8from_repERKNSt3__15arrayImLm6EEE: 94| 1.87k| constexpr static std::array from_rep(const std::array& z) { return z; } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE6to_repERKNSt3__15arrayImLm6EEE: 90| 1.99k| constexpr static std::array to_rep(const std::array& x) { return x; } _ZN5Botan6PCurve14PCurveInstance9secp521r1Ev: 291| 1|std::shared_ptr PCurveInstance::secp521r1() { 292| 1| return PrimeOrderCurveImpl::instance(); 293| 1|} pcurves_secp521r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE3oneEv: 24| 48.9k| constexpr static std::array one() { return std::array{1}; } pcurves_secp521r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE4redcERKNSt3__15arrayImLm18EEE: 26| 1.82M| constexpr static std::array redc(const std::array& z) { 27| | // Regardless of word size (32 or 64) the top word is 9 bits long 28| 1.82M| constexpr W TOP_BITS = static_cast(0x1FF); 29| | // The 23 or 55 bits that should be cleared in the top word 30| 1.82M| constexpr W CLEARED_TOP_BITS = WordInfo::max ^ TOP_BITS; 31| | 32| | /* 33| | * Extract the high part of z (z >> 521) 34| | */ 35| 1.82M| std::array t; // NOLINT(*-member-init) 36| | 37| 18.2M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (37:28): [True: 16.4M, False: 1.82M] ------------------ 38| 16.4M| t[i] = z[(N - 1) + i] >> 9; 39| 16.4M| } 40| | 41| 16.4M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (41:28): [True: 14.5M, False: 1.82M] ------------------ 42| 14.5M| t[i] |= z[(N - 1) + i + 1] << (WordInfo::bits - 9); 43| 14.5M| } 44| | 45| | // Now t += z & (2**521-1) 46| 1.82M| W carry = 0; 47| 16.4M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (47:28): [True: 14.5M, False: 1.82M] ------------------ 48| 14.5M| t[i] = word_add(t[i], z[i], &carry); 49| 14.5M| } 50| | 51| | // Now add the (partial) top words; this can't carry out 52| | // since both inputs are at most 2**9-1 53| 1.82M| t[N - 1] += (z[N - 1] & TOP_BITS) + carry; 54| | 55| | /* 56| | Since the modulus P is exactly 2**521 - 1 the only way the computed 57| | result can be larger than P is if the top word is larger than TOP_BITS 58| | 59| | Since TOP_BITS has the low 9 bits set, we can check if t[N - 1] > TOP_BITS 60| | by checking if t[N - 1] >> 9 has any bits set. Doing it this way is 61| | faster than a standard comparison since CT::Mask::is_gt requires 62| | several bit operations. 63| | */ 64| | 65| 1.82M| const W is_over_p521 = ~CT::Mask::is_zero(t[N - 1] >> 9).value(); 66| | 67| | /* 68| | * Also must detect/handle x == P 69| | */ 70| 1.82M| const W is_eq_p521 = [&]() { 71| 1.82M| W sum = WordInfo::max; 72| 1.82M| for(size_t i = 0; i != N - 1; ++i) { 73| 1.82M| sum &= t[i]; 74| 1.82M| } 75| 1.82M| sum &= (CLEARED_TOP_BITS | t[N - 1]); 76| | 77| 1.82M| return CT::Mask::is_zero(sum ^ WordInfo::max).value(); 78| 1.82M| }(); 79| | 80| 1.82M| const W need_sub = is_over_p521 | is_eq_p521; 81| | 82| 1.82M| W borrow = 0; 83| 16.4M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (83:28): [True: 14.5M, False: 1.82M] ------------------ 84| 14.5M| t[i] = word_sub(t[i], need_sub & WordInfo::max, &borrow); 85| 14.5M| } 86| 1.82M| t[N - 1] = word_sub(t[N - 1], need_sub & TOP_BITS, &borrow); 87| | 88| 1.82M| return t; 89| 1.82M| } pcurves_secp521r1.cpp:_ZZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE4redcERKNSt3__15arrayImLm18EEEENKUlvE_clEv: 70| 1.82M| const W is_eq_p521 = [&]() { 71| 1.82M| W sum = WordInfo::max; 72| 16.4M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (72:31): [True: 14.5M, False: 1.82M] ------------------ 73| 14.5M| sum &= t[i]; 74| 14.5M| } 75| 1.82M| sum &= (CLEARED_TOP_BITS | t[N - 1]); 76| | 77| 1.82M| return CT::Mask::is_zero(sum ^ WordInfo::max).value(); 78| 1.82M| }(); pcurves_secp521r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE8from_repERKNSt3__15arrayImLm9EEE: 95| 1.41k| constexpr static std::array from_rep(const std::array& z) { return z; } pcurves_secp521r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE6to_repERKNSt3__15arrayImLm9EEE: 91| 1.57k| constexpr static std::array to_rep(const std::array& x) { return x; } _ZN5Botan12pkcs_hash_idENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 78| 228|std::vector pkcs_hash_id(std::string_view name) { 79| | // Special case for SSL/TLS RSA signatures 80| 228| if(name == "Parallel(MD5,SHA-1)") { ------------------ | Branch (80:7): [True: 0, False: 228] ------------------ 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| 228| if(name == "MD5") { ------------------ | Branch (86:7): [True: 0, False: 228] ------------------ 87| 0| return std::vector(MD5_PKCS_ID, MD5_PKCS_ID + sizeof(MD5_PKCS_ID)); 88| 0| } 89| | 90| 228| if(name == "RIPEMD-160") { ------------------ | Branch (90:7): [True: 0, False: 228] ------------------ 91| 0| return std::vector(RIPEMD_160_PKCS_ID, RIPEMD_160_PKCS_ID + sizeof(RIPEMD_160_PKCS_ID)); 92| 0| } 93| | 94| 228| if(name == "SHA-1") { ------------------ | Branch (94:7): [True: 14, False: 214] ------------------ 95| 14| return std::vector(SHA_1_PKCS_ID, SHA_1_PKCS_ID + sizeof(SHA_1_PKCS_ID)); 96| 14| } 97| | 98| 214| if(name == "SHA-224") { ------------------ | Branch (98:7): [True: 87, False: 127] ------------------ 99| 87| return std::vector(SHA_224_PKCS_ID, SHA_224_PKCS_ID + sizeof(SHA_224_PKCS_ID)); 100| 87| } 101| | 102| 127| if(name == "SHA-256") { ------------------ | Branch (102:7): [True: 94, False: 33] ------------------ 103| 94| return std::vector(SHA_256_PKCS_ID, SHA_256_PKCS_ID + sizeof(SHA_256_PKCS_ID)); 104| 94| } 105| | 106| 33| if(name == "SHA-384") { ------------------ | Branch (106:7): [True: 0, False: 33] ------------------ 107| 0| return std::vector(SHA_384_PKCS_ID, SHA_384_PKCS_ID + sizeof(SHA_384_PKCS_ID)); 108| 0| } 109| | 110| 33| if(name == "SHA-512") { ------------------ | Branch (110:7): [True: 33, False: 0] ------------------ 111| 33| return std::vector(SHA_512_PKCS_ID, SHA_512_PKCS_ID + sizeof(SHA_512_PKCS_ID)); 112| 33| } 113| | 114| 0| if(name == "SHA-512-256") { ------------------ | Branch (114:7): [True: 0, False: 0] ------------------ 115| 0| return std::vector(SHA_512_256_PKCS_ID, SHA_512_256_PKCS_ID + sizeof(SHA_512_256_PKCS_ID)); 116| 0| } 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_12HashFunctionENSt3__14spanIKhLm18446744073709551615EEENS3_IhLm18446744073709551615EEE: 15| 3|void mgf1_mask(HashFunction& hash, std::span input, std::span output) { 16| 3| uint32_t counter = 0; 17| | 18| 3| const size_t hlen = hash.output_length(); 19| | 20| 3| BOTAN_ASSERT_NOMSG(hlen > 0); ------------------ | | 84| 3| do { \ | | 85| 3| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 3| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 3] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 3| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 3] | | ------------------ ------------------ 21| | 22| 3| std::vector buffer(hlen); 23| 12| while(!output.empty()) { ------------------ | Branch (23:10): [True: 9, False: 3] ------------------ 24| 9| hash.update(input); 25| 9| hash.update_be(counter); 26| 9| hash.final(buffer); 27| | 28| 9| const size_t xored = std::min(buffer.size(), output.size()); 29| 9| xor_buf(output.first(xored), std::span{buffer}.first(xored)); 30| 9| output = output.subspan(xored); 31| | 32| 9| ++counter; 33| 9| } 34| 3|} _ZN5Botan31PKCS1v15_SignaturePaddingScheme6updateEPKhm: 48| 456|void PKCS1v15_SignaturePaddingScheme::update(const uint8_t input[], size_t length) { 49| 456| m_hash->update(input, length); 50| 456|} _ZN5Botan31PKCS1v15_SignaturePaddingScheme8raw_dataEv: 52| 228|std::vector PKCS1v15_SignaturePaddingScheme::raw_data() { 53| 228| return m_hash->final_stdvec(); 54| 228|} _ZN5Botan31PKCS1v15_SignaturePaddingScheme6verifyENSt3__14spanIKhLm18446744073709551615EEES4_m: 68| 93| size_t key_bits) { 69| 93| if(raw.size() != m_hash->output_length()) { ------------------ | Branch (69:7): [True: 0, False: 93] ------------------ 70| 0| return false; 71| 0| } 72| | 73| 93| try { 74| 93| const auto pkcs1 = pkcs1v15_sig_encoding(raw, key_bits, m_hash_id); 75| 93| return constant_time_compare(coded, pkcs1); 76| 93| } catch(...) { 77| 22| return false; 78| 22| } 79| 93|} _ZN5Botan31PKCS1v15_SignaturePaddingSchemeC2ERKNS_27PK_Signature_Options_ReaderE: 82| 228| m_hash(HashFunction::create_or_throw(options.hash_function_name())) { 83| 228| acknowledge_always_deterministic(options); 84| 228| m_hash_id = pkcs_hash_id(m_hash->name()); 85| 228|} _ZNK5Botan31PKCS1v15_SignaturePaddingScheme13hash_functionEv: 87| 19|std::string PKCS1v15_SignaturePaddingScheme::hash_function() const { 88| 19| return m_hash->name(); 89| 19|} pkcs1_sig_padding.cpp:_ZN5Botan12_GLOBAL__N_121pkcs1v15_sig_encodingENSt3__14spanIKhLm18446744073709551615EEEmS4_: 26| 93| std::span hash_id) { 27| 93| const size_t output_length = output_bits / 8; 28| | 29| 93| if(output_length < hash_id.size() + msg.size() + 2 + 8) { ------------------ | Branch (29:7): [True: 22, False: 71] ------------------ 30| 22| throw Encoding_Error("pkcs1v15_sig_encoding: Output length is too small"); 31| 22| } 32| | 33| 71| std::vector padded(output_length); 34| 71| BufferStuffer stuffer(padded); 35| | 36| 71| stuffer.append(0x01); 37| 71| stuffer.append(0xFF, stuffer.remaining_capacity() - (1 + hash_id.size() + msg.size())); 38| 71| stuffer.append(0x00); 39| 71| stuffer.append(hash_id); 40| 71| stuffer.append(msg); 41| 71| BOTAN_ASSERT_NOMSG(stuffer.full()); ------------------ | | 84| 71| do { \ | | 85| 71| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 71| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 71] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 71| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 71] | | ------------------ ------------------ 42| | 43| 71| return padded; 44| 93|} _ZN5Botan4PSSRC2ERKNS_27PK_Signature_Options_ReaderE: 152| 10| m_hash(HashFunction::create_or_throw(options.hash_function_name())), 153| 10| m_salt_size(options.salt_size().value_or(m_hash->output_length())), 154| 10| m_required_salt_len(options.using_salt_size()) { 155| 10| if(options.using_deterministic_signature() && m_salt_size > 0) { ------------------ | Branch (155:7): [True: 0, False: 10] | Branch (155:50): [True: 0, False: 0] ------------------ 156| 0| throw Invalid_Argument("PSS with a non-zero salt cannot produce deterministic signatures"); 157| 0| } 158| 10|} _ZN5Botan4PSSR6updateEPKhm: 163| 20|void PSSR::update(const uint8_t input[], size_t length) { 164| 20| m_hash->update(input, length); 165| 20|} _ZN5Botan4PSSR8raw_dataEv: 170| 10|std::vector PSSR::raw_data() { 171| 10| return m_hash->final_stdvec(); 172| 10|} _ZN5Botan4PSSR6verifyENSt3__14spanIKhLm18446744073709551615EEES4_m: 182| 10|bool PSSR::verify(std::span coded, std::span raw, size_t key_bits) { 183| 10| size_t salt_size = 0; 184| 10| const bool ok = pss_verify(*m_hash, coded, raw, key_bits, &salt_size); 185| | 186| 10| if(m_required_salt_len && salt_size != m_salt_size) { ------------------ | Branch (186:7): [True: 10, False: 0] | Branch (186:30): [True: 10, False: 0] ------------------ 187| 10| return false; 188| 10| } 189| | 190| 0| return ok; 191| 10|} pssr.cpp:_ZN5Botan12_GLOBAL__N_110pss_verifyERNS_12HashFunctionENSt3__14spanIKhLm18446744073709551615EEES6_mPm: 72| 10| size_t* out_salt_size) { 73| 10| const size_t HASH_SIZE = hash.output_length(); 74| 10| const size_t key_bytes = ceil_tobytes(key_bits); 75| | 76| 10| if(key_bits < 8 * HASH_SIZE + 9) { ------------------ | Branch (76:7): [True: 0, False: 10] ------------------ 77| 0| return false; 78| 0| } 79| | 80| 10| if(message_hash.size() != HASH_SIZE) { ------------------ | Branch (80:7): [True: 0, False: 10] ------------------ 81| 0| return false; 82| 0| } 83| | 84| 10| if(pss_repr.size() > key_bytes || pss_repr.size() <= 1) { ------------------ | Branch (84:7): [True: 0, False: 10] | Branch (84:38): [True: 0, False: 10] ------------------ 85| 0| return false; 86| 0| } 87| | 88| 10| if(pss_repr[pss_repr.size() - 1] != 0xBC) { ------------------ | Branch (88:7): [True: 6, False: 4] ------------------ 89| 6| return false; 90| 6| } 91| | 92| 4| std::vector coded; 93| 4| if(pss_repr.size() < key_bytes) { ------------------ | Branch (93:7): [True: 1, False: 3] ------------------ 94| 1| coded.resize(key_bytes); 95| 1| BufferStuffer stuffer(coded); 96| 1| stuffer.append(0x00, key_bytes - pss_repr.size()); 97| 1| stuffer.append(pss_repr); 98| 3| } else { 99| 3| coded.assign(pss_repr.begin(), pss_repr.end()); 100| 3| } 101| | 102| | // We have to check this after potential zero padding above 103| 4| const size_t top_bits = 8 * ((key_bits + 7) / 8) - key_bits; 104| 4| if(top_bits > 8 - high_bit(coded[0])) { ------------------ | Branch (104:7): [True: 1, False: 3] ------------------ 105| 1| return false; 106| 1| } 107| | 108| 3| uint8_t* DB = coded.data(); 109| 3| const size_t DB_size = coded.size() - HASH_SIZE - 1; 110| | 111| 3| const uint8_t* H = &coded[DB_size]; 112| 3| const size_t H_size = HASH_SIZE; 113| | 114| 3| mgf1_mask(hash, {H, H_size}, {DB, DB_size}); 115| 3| DB[0] &= 0xFF >> top_bits; 116| | 117| 3| size_t salt_offset = 0; 118| 4| for(size_t j = 0; j != DB_size; ++j) { ------------------ | Branch (118:22): [True: 4, False: 0] ------------------ 119| 4| if(DB[j] == 0x01) { ------------------ | Branch (119:10): [True: 1, False: 3] ------------------ 120| 1| salt_offset = j + 1; 121| 1| break; 122| 1| } 123| 3| if(DB[j] != 0x00) { ------------------ | Branch (123:10): [True: 2, False: 1] ------------------ 124| 2| return false; 125| 2| } 126| 3| } 127| 1| if(salt_offset == 0) { ------------------ | Branch (127:7): [True: 0, False: 1] ------------------ 128| 0| return false; 129| 0| } 130| | 131| 1| const size_t salt_size = DB_size - salt_offset; 132| | 133| 1| std::array padding = {0}; 134| 1| hash.update(padding); 135| 1| hash.update(message_hash); 136| 1| hash.update(&DB[salt_offset], salt_size); 137| | 138| 1| const std::vector H2 = hash.final_stdvec(); 139| | 140| 1| const bool ok = CT::is_equal(H, H2.data(), HASH_SIZE).as_bool(); 141| | 142| 1| if(ok && out_salt_size != nullptr) { ------------------ | Branch (142:7): [True: 0, False: 1] | Branch (142:13): [True: 0, False: 0] ------------------ 143| 0| *out_salt_size = salt_size; 144| 0| } 145| | 146| 1| return ok; 147| 1|} _ZN5Botan22SignaturePaddingScheme15create_or_throwERKNS_27PK_Signature_Options_ReaderE: 37| 238| const PK_Signature_Options_Reader& options) { 38| | // Signing without padding is dangerous, so it must be requested explicitly 39| 238| if(!options.using_padding()) { ------------------ | Branch (39:7): [True: 0, False: 238] ------------------ 40| 0| throw Lookup_Error("RSA signatures require specifying a padding scheme"); 41| 0| } 42| | 43| 238| const std::string padding = options.padding().value(); 44| | 45| 238| if(padding == "Raw") { ------------------ | Branch (45:7): [True: 0, False: 238] ------------------ 46| 0|#if defined(BOTAN_HAS_EMSA_RAW) 47| | // Raw padding signs the input directly, so no hash function is involved 48| 0| return std::make_unique(options); 49| 0|#endif 50| 238| } else { 51| 238|#if defined(BOTAN_HAS_EMSA_PKCS1) 52| | // PKCS1v15 can also sign a digest the caller computed 53| 238| if(padding == "PKCS1v15" && options.using_externally_computed_prehash()) { ------------------ | Branch (53:10): [True: 228, False: 10] | Branch (53:35): [True: 0, False: 228] ------------------ 54| 0| return std::make_unique(options); 55| 0| } 56| 238|#endif 57| | 58| 238| if(!options.using_hash()) { ------------------ | Branch (58:10): [True: 0, False: 238] ------------------ 59| 0| throw Lookup_Error(fmt("RSA/{} signatures require specifying a hash function", padding)); 60| 0| } 61| | 62| 238| const std::string& hash_fn = options.hash_function_name(); 63| 238| const bool hash_available = HashFunction::create(hash_fn) != nullptr; 64| | 65| 238|#if defined(BOTAN_HAS_EMSA_PKCS1) 66| 238| if(padding == "PKCS1v15" && hash_available) { ------------------ | Branch (66:10): [True: 228, False: 10] | Branch (66:35): [True: 228, False: 0] ------------------ 67| 228| return std::make_unique(options); 68| 228| } 69| 10|#endif 70| | 71| 10|#if defined(BOTAN_HAS_PSS) 72| 10| if(padding == "PSS_Raw" && hash_available) { ------------------ | Branch (72:10): [True: 0, False: 10] | Branch (72:34): [True: 0, False: 0] ------------------ 73| 0| return std::make_unique(options); 74| 0| } 75| | 76| 10| if(padding == "PSS" && hash_available) { ------------------ | Branch (76:10): [True: 10, False: 0] | Branch (76:30): [True: 10, False: 0] ------------------ 77| 10| return std::make_unique(options); 78| 10| } 79| 0|#endif 80| | 81| 0|#if defined(BOTAN_HAS_ISO_9796) 82| 0| if(padding == "ISO_9796_DS2" && hash_available) { ------------------ | Branch (82:10): [True: 0, False: 0] | Branch (82:39): [True: 0, False: 0] ------------------ 83| 0| return std::make_unique(options); 84| 0| } 85| | 86| 0| if(padding == "ISO_9796_DS3" && hash_available) { ------------------ | Branch (86:10): [True: 0, False: 0] | Branch (86:39): [True: 0, False: 0] ------------------ 87| 0| return std::make_unique(options); 88| 0| } 89| 0|#endif 90| | 91| 0|#if defined(BOTAN_HAS_EMSA_X931) 92| 0| if(padding == "X9.31" && hash_available) { ------------------ | Branch (92:10): [True: 0, False: 0] | Branch (92:32): [True: 0, False: 0] ------------------ 93| 0| return std::make_unique(options); 94| 0| } 95| 0|#endif 96| 0| } 97| | 98| 0| throw Lookup_Error("Invalid or unavailable signature padding scheme " + options.to_string()); 99| 238|} _ZN5Botan12DH_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 17| 104|DH_PublicKey::DH_PublicKey(const AlgorithmIdentifier& alg_id, std::span key_bits) { 18| 104| m_public_key = std::make_shared(alg_id, key_bits, DL_Group_Format::ANSI_X9_42); 19| 104|} _ZN5Botan13DilithiumModeC2ERKNS_3OIDE: 78| 3|DilithiumMode::DilithiumMode(const OID& oid) : m_mode(dilithium_mode_from_oid(oid)) {} _ZNK5Botan13DilithiumMode6is_aesEv: 111| 6|bool DilithiumMode::is_aes() const { 112| 6| return m_mode == Dilithium4x4_AES || m_mode == Dilithium6x5_AES || m_mode == Dilithium8x7_AES; ------------------ | Branch (112:11): [True: 0, False: 6] | Branch (112:41): [True: 0, False: 6] | Branch (112:71): [True: 0, False: 6] ------------------ 113| 6|} _ZNK5Botan13DilithiumMode9is_modernEv: 115| 3|bool DilithiumMode::is_modern() const { 116| 3| return !is_aes(); 117| 3|} _ZNK5Botan13DilithiumMode9is_ml_dsaEv: 119| 21|bool DilithiumMode::is_ml_dsa() const { 120| 21| return m_mode == ML_DSA_4x4 || m_mode == ML_DSA_6x5 || m_mode == ML_DSA_8x7; ------------------ | Branch (120:11): [True: 7, False: 14] | Branch (120:35): [True: 7, False: 7] | Branch (120:59): [True: 7, False: 0] ------------------ 121| 21|} _ZNK5Botan13DilithiumMode12is_availableEv: 123| 3|bool DilithiumMode::is_available() const { 124| 3|#if defined(BOTAN_HAS_DILITHIUM_AES) 125| 3| if(is_dilithium_round3() && is_aes()) { ------------------ | Branch (125:7): [True: 0, False: 3] | Branch (125:32): [True: 0, False: 0] ------------------ 126| 0| return true; 127| 0| } 128| 3|#endif 129| 3|#if defined(BOTAN_HAS_DILITHIUM) 130| 3| if(is_dilithium_round3() && is_modern()) { ------------------ | Branch (130:7): [True: 0, False: 3] | Branch (130:32): [True: 0, False: 0] ------------------ 131| 0| return true; 132| 0| } 133| 3|#endif 134| 3|#if defined(BOTAN_HAS_ML_DSA) 135| 3| if(is_ml_dsa()) { ------------------ | Branch (135:7): [True: 3, False: 0] ------------------ 136| 3| return true; 137| 3| } 138| 0|#endif 139| 0| return false; 140| 3|} _ZN5Botan19Dilithium_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 379| 3| Dilithium_PublicKey(pk, DilithiumMode(alg_id.oid())) { 380| | // The parameter set is identified by the OID; no parameters are defined. 381| 3| if(!alg_id.parameters_are_empty()) { ------------------ | Branch (381:7): [True: 0, False: 3] ------------------ 382| 0| throw Decoding_Error("Unexpected parameters for ML-DSA/Dilithium public key"); 383| 0| } 384| 3|} _ZN5Botan19Dilithium_PublicKeyC1ENSt3__14spanIKhLm18446744073709551615EEENS_13DilithiumModeE: 386| 3|Dilithium_PublicKey::Dilithium_PublicKey(std::span pk, DilithiumMode m) { 387| 3| DilithiumConstants mode(m); 388| 3| BOTAN_ARG_CHECK(mode.mode().is_available(), "Dilithium/ML-DSA mode is not available in this build"); ------------------ | | 35| 3| do { \ | | 36| 3| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 3| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 3] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 3| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 3] | | ------------------ ------------------ 389| 3| BOTAN_ARG_CHECK(pk.empty() || pk.size() == mode.public_key_bytes(), ------------------ | | 35| 3| do { \ | | 36| 3| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 6| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 0, False: 3] | | | Branch (37:12): [True: 0, False: 3] | | ------------------ | | 38| 3| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 3| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 3| } \ | | 41| 3| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 3] | | ------------------ ------------------ 390| 3| "dilithium public key does not have the correct byte count"); 391| | 392| 3| m_public = Dilithium_PublicKeyInternal::decode(std::move(mode), StrongSpan(pk)); 393| 3|} dilithium.cpp:_ZN5Botan12_GLOBAL__N_123dilithium_mode_from_oidERKNS_3OIDE: 68| 3|DilithiumMode::Mode dilithium_mode_from_oid(const OID& oid) { 69| 3| if(const auto name = oid.registered_name()) { ------------------ | Branch (69:18): [True: 3, False: 0] ------------------ 70| 3| return dilithium_mode_from_string(*name); 71| 3| } 72| | 73| 0| throw Invalid_Argument(fmt("OID '{}' is not registered as a Dilithium/ML-DSA mode", oid)); 74| 3|} dilithium.cpp:_ZN5Botan12_GLOBAL__N_126dilithium_mode_from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 36| 3|DilithiumMode::Mode dilithium_mode_from_string(std::string_view str) { 37| 3| if(str == "Dilithium-4x4-r3") { ------------------ | Branch (37:7): [True: 0, False: 3] ------------------ 38| 0| return DilithiumMode::Dilithium4x4; 39| 0| } 40| 3| if(str == "Dilithium-4x4-AES-r3") { ------------------ | Branch (40:7): [True: 0, False: 3] ------------------ 41| 0| return DilithiumMode::Dilithium4x4_AES; 42| 0| } 43| 3| if(str == "Dilithium-6x5-r3") { ------------------ | Branch (43:7): [True: 0, False: 3] ------------------ 44| 0| return DilithiumMode::Dilithium6x5; 45| 0| } 46| 3| if(str == "Dilithium-6x5-AES-r3") { ------------------ | Branch (46:7): [True: 0, False: 3] ------------------ 47| 0| return DilithiumMode::Dilithium6x5_AES; 48| 0| } 49| 3| if(str == "Dilithium-8x7-r3") { ------------------ | Branch (49:7): [True: 0, False: 3] ------------------ 50| 0| return DilithiumMode::Dilithium8x7; 51| 0| } 52| 3| if(str == "Dilithium-8x7-AES-r3") { ------------------ | Branch (52:7): [True: 0, False: 3] ------------------ 53| 0| return DilithiumMode::Dilithium8x7_AES; 54| 0| } 55| 3| if(str == "ML-DSA-4x4") { ------------------ | Branch (55:7): [True: 1, False: 2] ------------------ 56| 1| return DilithiumMode::ML_DSA_4x4; 57| 1| } 58| 2| if(str == "ML-DSA-6x5") { ------------------ | Branch (58:7): [True: 1, False: 1] ------------------ 59| 1| return DilithiumMode::ML_DSA_6x5; 60| 1| } 61| 1| if(str == "ML-DSA-8x7") { ------------------ | Branch (61:7): [True: 1, False: 0] ------------------ 62| 1| return DilithiumMode::ML_DSA_8x7; 63| 1| } 64| | 65| 0| throw Invalid_Argument(fmt("'{}' is not a valid Dilithium mode name", str)); 66| 1|} _ZN5Botan18DilithiumConstantsD2Ev: 57| 3|DilithiumConstants::~DilithiumConstants() = default; _ZN5Botan18DilithiumConstantsC2ENS_13DilithiumModeE: 60| 3| m_mode(mode), 61| 3| m_public_key_hash_bytes(public_key_hash_size(m_mode)), 62| 3| m_commitment_hash_full_bytes(commitment_hash_full_size(m_mode)) { 63| 3| switch(m_mode.mode()) { 64| 0| case Botan::DilithiumMode::Dilithium4x4: ------------------ | Branch (64:7): [True: 0, False: 3] ------------------ 65| 0| case Botan::DilithiumMode::Dilithium4x4_AES: ------------------ | Branch (65:7): [True: 0, False: 3] ------------------ 66| 1| case Botan::DilithiumMode::ML_DSA_4x4: ------------------ | Branch (66:7): [True: 1, False: 2] ------------------ 67| 1| m_tau = DilithiumTau::_39; 68| 1| m_lambda = DilithiumLambda::_128; 69| 1| m_gamma1 = DilithiumGamma1::ToThe17th; 70| 1| m_gamma2 = DilithiumGamma2::Qminus1DividedBy88; 71| 1| m_k = 4; 72| 1| m_l = 4; 73| 1| m_eta = DilithiumEta::_2; 74| 1| m_beta = DilithiumBeta::_78; 75| 1| m_omega = DilithiumOmega::_80; 76| 1| break; 77| 0| case Botan::DilithiumMode::Dilithium6x5: ------------------ | Branch (77:7): [True: 0, False: 3] ------------------ 78| 0| case Botan::DilithiumMode::Dilithium6x5_AES: ------------------ | Branch (78:7): [True: 0, False: 3] ------------------ 79| 1| case Botan::DilithiumMode::ML_DSA_6x5: ------------------ | Branch (79:7): [True: 1, False: 2] ------------------ 80| 1| m_tau = DilithiumTau::_49; 81| 1| m_lambda = DilithiumLambda::_192; 82| 1| m_gamma1 = DilithiumGamma1::ToThe19th; 83| 1| m_gamma2 = DilithiumGamma2::Qminus1DividedBy32; 84| 1| m_k = 6; 85| 1| m_l = 5; 86| 1| m_eta = DilithiumEta::_4; 87| 1| m_beta = DilithiumBeta::_196; 88| 1| m_omega = DilithiumOmega::_55; 89| 1| break; 90| 0| case Botan::DilithiumMode::Dilithium8x7: ------------------ | Branch (90:7): [True: 0, False: 3] ------------------ 91| 0| case Botan::DilithiumMode::Dilithium8x7_AES: ------------------ | Branch (91:7): [True: 0, False: 3] ------------------ 92| 1| case Botan::DilithiumMode::ML_DSA_8x7: ------------------ | Branch (92:7): [True: 1, False: 2] ------------------ 93| 1| m_tau = DilithiumTau::_60; 94| 1| m_lambda = DilithiumLambda::_256; 95| 1| m_gamma1 = DilithiumGamma1::ToThe19th; 96| 1| m_gamma2 = DilithiumGamma2::Qminus1DividedBy32; 97| 1| m_k = 8; 98| 1| m_l = 7; 99| 1| m_eta = DilithiumEta::_2; 100| 1| m_beta = DilithiumBeta::_120; 101| 1| m_omega = DilithiumOmega::_75; 102| 1| break; 103| 0| default: ------------------ | Branch (103:7): [True: 0, False: 3] ------------------ 104| 0| BOTAN_ASSERT_UNREACHABLE(); ------------------ | | 173| 0|#define BOTAN_ASSERT_UNREACHABLE() Botan::assert_unreachable(__FILE__, __LINE__) ------------------ 105| 3| } 106| | 107| 3| const auto s1_bytes = 32 * m_l * bitlen(2 * m_eta); 108| 3| const auto s2_bytes = 32 * m_k * bitlen(2 * m_eta); 109| 3| const auto t0_bytes = 32 * m_k * D; 110| 3| const auto t1_bytes = 32 * m_k * (bitlen(static_cast(Q) - 1) - D); 111| 3| const auto z_bytes = 32 * m_l * (1 + bitlen(m_gamma1 - 1)); 112| 3| const auto hint_bytes = m_omega + m_k; 113| | 114| 3| m_private_key_bytes = 115| 3| SEED_RHO_BYTES + SEED_SIGNING_KEY_BYTES + m_public_key_hash_bytes + s1_bytes + s2_bytes + t0_bytes; 116| 3| m_public_key_bytes = SEED_RHO_BYTES + t1_bytes; 117| 3| m_signature_bytes = m_commitment_hash_full_bytes + z_bytes + hint_bytes; 118| 3| m_serialized_commitment_bytes = 32 * m_k * bitlen(((Q - 1) / (2 * m_gamma2)) - 1); 119| | 120| 3| m_symmetric_primitives = Dilithium_Symmetric_Primitives_Base::create(*this); 121| 3| m_keypair_codec = Dilithium_Keypair_Codec::create(mode); 122| 3|} dilithium_constants.cpp:_ZN5Botan12_GLOBAL__N_120public_key_hash_sizeENS_13DilithiumModeE: 20| 3|uint32_t public_key_hash_size(DilithiumMode mode) { 21| 3| switch(mode.mode()) { ------------------ | Branch (21:11): [True: 3, False: 0] ------------------ 22| 1| case DilithiumMode::ML_DSA_4x4: ------------------ | Branch (22:7): [True: 1, False: 2] ------------------ 23| 2| case DilithiumMode::ML_DSA_6x5: ------------------ | Branch (23:7): [True: 1, False: 2] ------------------ 24| 3| case DilithiumMode::ML_DSA_8x7: ------------------ | Branch (24:7): [True: 1, False: 2] ------------------ 25| 3| return 64; 26| 0| case DilithiumMode::Dilithium4x4: ------------------ | Branch (26:7): [True: 0, False: 3] ------------------ 27| 0| case DilithiumMode::Dilithium4x4_AES: ------------------ | Branch (27:7): [True: 0, False: 3] ------------------ 28| 0| case DilithiumMode::Dilithium6x5: ------------------ | Branch (28:7): [True: 0, False: 3] ------------------ 29| 0| case DilithiumMode::Dilithium6x5_AES: ------------------ | Branch (29:7): [True: 0, False: 3] ------------------ 30| 0| case DilithiumMode::Dilithium8x7: ------------------ | Branch (30:7): [True: 0, False: 3] ------------------ 31| 0| case DilithiumMode::Dilithium8x7_AES: ------------------ | Branch (31:7): [True: 0, False: 3] ------------------ 32| 0| return 32; 33| 3| } 34| 0| BOTAN_ASSERT_UNREACHABLE(); ------------------ | | 173| 0|#define BOTAN_ASSERT_UNREACHABLE() Botan::assert_unreachable(__FILE__, __LINE__) ------------------ 35| 0|} dilithium_constants.cpp:_ZN5Botan12_GLOBAL__N_125commitment_hash_full_sizeENS_13DilithiumModeE: 37| 3|uint32_t commitment_hash_full_size(DilithiumMode mode) { 38| 3| switch(mode.mode()) { ------------------ | Branch (38:11): [True: 3, False: 0] ------------------ 39| 0| case DilithiumMode::Dilithium4x4: ------------------ | Branch (39:7): [True: 0, False: 3] ------------------ 40| 0| case DilithiumMode::Dilithium4x4_AES: ------------------ | Branch (40:7): [True: 0, False: 3] ------------------ 41| 0| case DilithiumMode::Dilithium6x5: ------------------ | Branch (41:7): [True: 0, False: 3] ------------------ 42| 0| case DilithiumMode::Dilithium6x5_AES: ------------------ | Branch (42:7): [True: 0, False: 3] ------------------ 43| 0| case DilithiumMode::Dilithium8x7: ------------------ | Branch (43:7): [True: 0, False: 3] ------------------ 44| 0| case DilithiumMode::Dilithium8x7_AES: ------------------ | Branch (44:7): [True: 0, False: 3] ------------------ 45| 1| case DilithiumMode::ML_DSA_4x4: ------------------ | Branch (45:7): [True: 1, False: 2] ------------------ 46| 1| return 32; 47| 1| case DilithiumMode::ML_DSA_6x5: ------------------ | Branch (47:7): [True: 1, False: 2] ------------------ 48| 1| return 48; 49| 1| case DilithiumMode::ML_DSA_8x7: ------------------ | Branch (49:7): [True: 1, False: 2] ------------------ 50| 1| return 64; 51| 3| } 52| 0| BOTAN_ASSERT_UNREACHABLE(); ------------------ | | 173| 0|#define BOTAN_ASSERT_UNREACHABLE() Botan::assert_unreachable(__FILE__, __LINE__) ------------------ 53| 0|} _ZN5Botan23Dilithium_Keypair_Codec6createENS_13DilithiumModeE: 22| 3|std::unique_ptr Dilithium_Keypair_Codec::create(DilithiumMode mode) { 23| 3|#if defined(BOTAN_HAS_DILITHIUM) || defined(BOTAN_HAS_DILITHIUM_AES) 24| 3| if(mode.is_dilithium_round3()) { ------------------ | Branch (24:7): [True: 0, False: 3] ------------------ 25| 0| return std::make_unique(); 26| 0| } 27| 3|#endif 28| | 29| 3|#if defined(BOTAN_HAS_ML_DSA) 30| 3| if(mode.is_ml_dsa()) { ------------------ | Branch (30:7): [True: 3, False: 0] ------------------ 31| 3| return std::make_unique(); 32| 3| } 33| 0|#endif 34| | 35| 0| throw Not_Implemented("requested ML-DSA/Dilithium mode is not implemented in this build"); 36| 3|} _ZN5Botan17DilithiumShakeXOFD2Ev: 13| 3|DilithiumShakeXOF::~DilithiumShakeXOF() = default; _ZN5Botan35Dilithium_Symmetric_Primitives_BaseC2ERKNS_18DilithiumConstantsENSt3__110unique_ptrINS_12DilithiumXOFENS4_14default_deleteIS6_EEEE: 43| 3| m_commitment_hash_length_bytes(mode.commitment_hash_full_bytes()), 44| 3| m_public_key_hash_bytes(mode.public_key_hash_bytes()), 45| 3| m_mode(mode.mode()), 46| 3| m_xof_adapter(std::move(xof_adapter)) {} _ZN5Botan35Dilithium_Symmetric_Primitives_Base6createERKNS_18DilithiumConstantsE: 49| 3| const DilithiumConstants& mode) { 50| 3|#if defined(BOTAN_HAS_DILITHIUM) 51| 3| if(mode.is_modern() && !mode.is_ml_dsa()) { ------------------ | Branch (51:7): [True: 3, False: 0] | Branch (51:27): [True: 0, False: 3] ------------------ 52| 0| return std::make_unique(mode); 53| 0| } 54| 3|#endif 55| | 56| 3|#if defined(BOTAN_HAS_DILITHIUM_AES) 57| 3| if(mode.is_aes()) { ------------------ | Branch (57:7): [True: 0, False: 3] ------------------ 58| 0| return std::make_unique(mode); 59| 0| } 60| 3|#endif 61| | 62| 3|#if defined(BOTAN_HAS_ML_DSA) 63| 3| if(mode.is_ml_dsa()) { ------------------ | Branch (63:7): [True: 3, False: 0] ------------------ 64| 3| return std::make_unique(mode); 65| 3| } 66| 0|#endif 67| | 68| 0| throw Not_Implemented("requested ML-DSA/Dilithium mode is not implemented in this build"); 69| 3|} _ZN5Botan12DL_PublicKeyC2ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEENS_15DL_Group_FormatE: 54| 199| m_group(alg_id.parameters(), format), 55| 199| m_public_key(check_dl_public_key_input(decode_single_bigint(key_bits), m_group)) {} dl_scheme.cpp:_ZN5Botan12_GLOBAL__N_120decode_single_bigintENSt3__14spanIKhLm18446744073709551615EEE: 17| 87|BigInt decode_single_bigint(std::span key_bits) { 18| 87| BigInt x; 19| 87| BER_Decoder(key_bits, BER_Decoder::Limits::DER()).decode(x).verify_end(); 20| 87| return x; 21| 87|} _ZN5Botan8DL_Group19DER_decode_DL_groupENSt3__14spanIKhLm18446744073709551615EEENS_15DL_Group_FormatENS_15DL_Group_SourceE: 170| 199| DL_Group_Source source) { 171| 199| BER_Decoder outer(data, BER_Decoder::Limits::DER()); 172| 199| BER_Decoder inner = outer.start_sequence(); 173| 199| outer.verify_end(); 174| | 175| 199| if(format == DL_Group_Format::ANSI_X9_57) { ------------------ | Branch (175:7): [True: 87, False: 112] ------------------ 176| | /* 177| | This format is p, q, g with no additional data following 178| | */ 179| 87| BigInt p; 180| 87| BigInt q; 181| 87| BigInt g; 182| 87| inner.decode(p).decode(q).decode(g).verify_end(); 183| 87| return DL_Group_Data::create(p, q, g, source); 184| 112| } else if(format == DL_Group_Format::ANSI_X9_42) { ------------------ | Branch (184:14): [True: 103, False: 9] ------------------ 185| | /* 186| | This format is p, g, q with optional cofactor and seed following 187| | */ 188| 103| BigInt p; 189| 103| BigInt g; 190| 103| BigInt q; 191| 103| inner.decode(p).decode(g).decode(q).discard_remaining(); 192| 103| return DL_Group_Data::create(p, q, g, source); 193| 103| } else if(format == DL_Group_Format::PKCS_3) { ------------------ | Branch (193:14): [True: 0, False: 9] ------------------ 194| | /* 195| | This format is p, g followed by optional privateValueLength (recommended exponent size) 196| | */ 197| 0| BigInt p; 198| 0| BigInt g; 199| 0| inner.decode(p).decode(g).discard_remaining(); 200| 0| return DL_Group_Data::create(p, g, source); 201| 9| } else { 202| 9| throw Invalid_Argument("Unknown DL_Group encoding"); 203| 9| } 204| 199|} _ZN5Botan8DL_GroupC2ENSt3__14spanIKhLm18446744073709551615EEENS_15DL_Group_FormatE: 681| 199|DL_Group::DL_Group(std::span der, DL_Group_Format format) { 682| 199| m_data = DER_decode_DL_group(der, format, DL_Group_Source::ExternalSource); 683| 199|} _ZN5Botan13DL_Group_Data6createERKNS_6BigIntES3_S3_NS_15DL_Group_SourceE: 52| 188| DL_Group_Source source) { 53| 188| check_dl_group_params(p, q, g); 54| 188| return std::make_shared(p, q, g, source); 55| 188| } dl_group.cpp:_ZN5Botan12_GLOBAL__N_121check_dl_group_paramsERKNS_6BigIntES3_S3_: 38| 188|void check_dl_group_params(const BigInt& p, const BigInt& q, const BigInt& g) { 39| 188| check_dl_group_params(p, g); 40| 188| if(q.signum() <= 0 || q.is_even() || q.bits() >= p.bits()) { ------------------ | Branch (40:7): [True: 99, False: 89] | Branch (40:26): [True: 1, False: 88] | Branch (40:41): [True: 1, False: 87] ------------------ 41| 4| throw Decoding_Error("Invalid DL group subgroup order"); 42| 4| } 43| 188|} dl_group.cpp:_ZN5Botan12_GLOBAL__N_121check_dl_group_paramsERKNS_6BigIntES3_: 29| 188|void check_dl_group_params(const BigInt& p, const BigInt& g) { 30| 188| if(p.signum() <= 0 || p.is_even() || p.bits() < 3 || p.bits() > 16384) { ------------------ | Branch (30:7): [True: 3, False: 185] | Branch (30:26): [True: 2, False: 183] | Branch (30:41): [True: 1, False: 182] | Branch (30:57): [True: 0, False: 182] ------------------ 31| 6| throw Decoding_Error("Invalid DL group prime"); 32| 6| } 33| 182| if(g.signum() <= 0 || g < 2 || g >= p) { ------------------ | Branch (33:7): [True: 2, False: 180] | Branch (33:26): [True: 1, False: 179] | Branch (33:35): [True: 88, False: 91] ------------------ 34| 91| throw Decoding_Error("Invalid DL group generator"); 35| 91| } 36| 182|} _ZN5Botan13DL_Group_DataC2ERKNS_6BigIntES3_S3_NS_15DL_Group_SourceE: 65| 87| m_p(p), 66| 87| m_q(q), 67| 87| m_g(g), 68| 87| m_mod_p(Barrett_Reduction::for_public_modulus(p)), 69| 87| m_mod_q(Barrett_Reduction::for_public_modulus(q)), 70| 87| m_monty_params(m_p, m_mod_p), 71| 87| m_monty(monty_precompute(m_monty_params, m_g, /*window bits=*/4)), 72| 87| m_p_bits(p.bits()), 73| 87| m_q_bits(q.bits()), 74| | // For DL crypto in a prime-order subgroup, security is bounded by 75| | // both the NFS cost in Z_p* and Pollard rho in the q-order subgroup. 76| 87| m_estimated_strength(std::min(dl_work_factor(m_p_bits), m_q_bits / 2)), 77| 87| m_exponent_bits(dl_exponent_size(m_p_bits)), 78| 87| m_source(source) {} _ZN5Botan13DL_Group_DataD2Ev: 94| 87| ~DL_Group_Data() = default; _ZN5Botan13DSA_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 85| 95|DSA_PublicKey::DSA_PublicKey(const AlgorithmIdentifier& alg_id, std::span key_bits) { 86| 95| m_public_key = std::make_shared(alg_id, key_bits, DL_Group_Format::ANSI_X9_57); 87| | 88| 95| check_dsa_group(m_public_key->group()); 89| 95|} _ZN5Botan14EC_AffinePointC2ENSt3__110unique_ptrINS_19EC_AffinePoint_DataENS1_14default_deleteIS3_EEEE: 16| 1.20k|EC_AffinePoint::EC_AffinePoint(std::unique_ptr point) : m_point(std::move(point)) { 17| 1.20k| BOTAN_ASSERT_NONNULL(m_point); ------------------ | | 123| 1.20k| do { \ | | 124| 1.20k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (124:10): [True: 0, False: 1.20k] | | ------------------ | | 125| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 126| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 127| 0| } \ | | 128| 1.20k| } while(0) | | ------------------ | | | Branch (128:12): [Folded, False: 1.20k] | | ------------------ ------------------ 18| 1.20k|} _ZN5Botan14EC_AffinePointC2EOS0_: 22| 3.60k|EC_AffinePoint::EC_AffinePoint(EC_AffinePoint&& other) noexcept : m_point(std::move(other.m_point)) {} _ZNK5Botan14EC_AffinePoint15to_legacy_pointEv: 46| 1.20k|EC_Point EC_AffinePoint::to_legacy_point() const { 47| 1.20k| return m_point->to_legacy_point(); 48| 1.20k|} _ZNK5Botan14EC_AffinePoint11is_identityEv: 118| 1.20k|bool EC_AffinePoint::is_identity() const { 119| 1.20k| return inner().is_identity(); 120| 1.20k|} _ZN5Botan14EC_AffinePointD2Ev: 152| 4.81k|EC_AffinePoint::~EC_AffinePoint() = default; _ZN5Botan14EC_AffinePoint22deserialize_compressedERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 195| 627| std::span bytes) { 196| 627| if(auto pt = group._data()->point_deserialize_compressed(bytes)) { ------------------ | Branch (196:12): [True: 275, False: 352] ------------------ 197| 275| return EC_AffinePoint(std::move(pt)); 198| 352| } else { 199| 352| return {}; 200| 352| } 201| 627|} _ZN5Botan14EC_AffinePoint24deserialize_uncompressedERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 204| 1.55k| std::span bytes) { 205| 1.55k| if(auto pt = group._data()->point_deserialize_uncompressed(bytes)) { ------------------ | Branch (205:12): [True: 928, False: 627] ------------------ 206| 928| return EC_AffinePoint(std::move(pt)); 207| 928| } else { 208| 627| return {}; 209| 627| } 210| 1.55k|} _ZNK5Botan14EC_AffinePoint6_groupEv: 292| 2.13k|const std::shared_ptr& EC_AffinePoint::_group() const { 293| 2.13k| return inner().group(); 294| 2.13k|} _ZN5Botan8EC_Group13ec_group_dataEv: 240| 1.63k|EC_Group_Data_Map& EC_Group::ec_group_data() { 241| | /* 242| | * This exists purely to ensure the allocator is constructed before g_ec_data, 243| | * which ensures that its destructor runs after ~g_ec_data is complete. 244| | */ 245| | 246| 1.63k| static const Allocator_Initializer g_init_allocator; 247| 1.63k| static EC_Group_Data_Map g_ec_data; 248| 1.63k| return g_ec_data; 249| 1.63k|} _ZN5Botan8EC_Group18load_EC_group_infoEPKcS2_S2_S2_S2_S2_RKNS_3OIDE: 263| 315| const OID& oid) { 264| 315| BOTAN_ARG_CHECK(oid.has_value(), "EC_Group::load_EC_group_info OID must be set"); ------------------ | | 35| 315| do { \ | | 36| 315| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 315| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 315] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 315| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 315] | | ------------------ ------------------ 265| | 266| 315| const BigInt p(p_str); 267| 315| const BigInt a(a_str); 268| 315| const BigInt b(b_str); 269| 315| const BigInt g_x(g_x_str); 270| 315| const BigInt g_y(g_y_str); 271| 315| const BigInt order(order_str); 272| 315| const BigInt cofactor(1); // implicit 273| | 274| 315| return EC_Group_Data::create(p, a, b, g_x, g_y, order, cofactor, oid, EC_Group_Source::Builtin); 275| 315|} _ZN5Botan8EC_Group19DER_decode_EC_groupENSt3__14spanIKhLm18446744073709551615EEENS_15EC_Group_SourceE: 279| 1.27k| EC_Group_Source source) { 280| 1.27k| BER_Decoder dec(der, BER_Decoder::Limits::DER()); 281| | 282| 1.27k| const auto next_obj_type = dec.peek_next_object().type_tag(); 283| | 284| 1.27k| if(next_obj_type == ASN1_Type::ObjectId) { ------------------ | Branch (284:7): [True: 1.26k, False: 5] ------------------ 285| 1.26k| OID oid; 286| 1.26k| dec.decode(oid).verify_end(); 287| | 288| 1.26k| const auto data = ec_group_data().lookup(oid); 289| 1.26k| if(!data) { ------------------ | Branch (289:10): [True: 19, False: 1.25k] ------------------ 290| 19| throw Decoding_Error(fmt("Unknown namedCurve OID '{}'", oid.to_string())); 291| 19| } 292| | 293| 1.25k| return std::make_pair(data, false); 294| 1.26k| } else if(next_obj_type == ASN1_Type::Sequence) { ------------------ | Branch (294:14): [True: 4, False: 1] ------------------ 295| 4| BigInt p; 296| 4| BigInt a; 297| 4| BigInt b; 298| 4| BigInt order; 299| 4| BigInt cofactor; 300| 4| std::vector base_pt; 301| 4| std::vector seed; 302| | 303| 4| dec.start_sequence() 304| 4| .decode_and_check(1, "Unknown ECC param version code") 305| 4| .start_sequence() 306| 4| .decode_and_check(OID({1, 2, 840, 10045, 1, 1}), "Only prime ECC fields supported") 307| 4| .decode(p) 308| 4| .end_cons() 309| 4| .start_sequence() 310| 4| .decode_octet_string_bigint(a) 311| 4| .decode_octet_string_bigint(b) 312| 4| .decode_optional_string(seed, ASN1_Type::BitString, ASN1_Type::BitString, ASN1_Class::Universal) 313| 4| .end_cons() 314| 4| .decode(base_pt, ASN1_Type::OctetString) 315| 4| .decode(order) 316| 4| .decode(cofactor) 317| 4| .end_cons() 318| 4| .verify_end(); 319| | 320| | // TODO(Botan4) Require cofactor == 1 321| 4| if(cofactor <= 0 || cofactor >= 16) { ------------------ | Branch (321:10): [True: 4, False: 0] | Branch (321:27): [True: 0, False: 0] ------------------ 322| 0| throw Decoding_Error("Invalid ECC cofactor parameter"); 323| 0| } 324| | 325| 4| if(p.bits() < 112 || p.bits() > 521 || p.signum() < 0) { ------------------ | Branch (325:10): [True: 4, False: 0] | Branch (325:28): [True: 0, False: 0] | Branch (325:46): [True: 0, False: 0] ------------------ 326| 0| throw Decoding_Error("ECC p parameter is invalid size"); 327| 0| } 328| | 329| | // A can be zero 330| 4| if(a.signum() < 0 || a >= p) { ------------------ | Branch (330:10): [True: 4, False: 0] | Branch (330:28): [True: 0, False: 0] ------------------ 331| 0| throw Decoding_Error("Invalid ECC a parameter"); 332| 0| } 333| | 334| | // B must be > 0 335| | // 336| | // Technically this is not true but we have historically rejected this and 337| | // nobody has noted it as an issue, so it is retained. 338| 4| if(b.signum() <= 0 || b >= p) { ------------------ | Branch (338:10): [True: 4, False: 0] | Branch (338:29): [True: 0, False: 0] ------------------ 339| 0| throw Decoding_Error("Invalid ECC b parameter"); 340| 0| } 341| | 342| 4| if(order.signum() <= 0 || order >= 2 * p) { ------------------ | Branch (342:10): [True: 4, False: 0] | Branch (342:10): [True: 0, False: 4] | Branch (342:33): [True: 0, False: 0] ------------------ 343| 0| throw Decoding_Error("Invalid ECC group order"); 344| 0| } 345| | 346| 4| if(p == order) { ------------------ | Branch (346:10): [True: 0, False: 4] ------------------ 347| 0| throw Decoding_Error("Anomalous elliptic curves are not supported"); 348| 0| } 349| | 350| 4| if(const auto data = ec_group_data().lookup_from_params(p, a, b, base_pt, order, cofactor)) { ------------------ | Branch (350:21): [True: 0, False: 4] ------------------ 351| 0| return std::make_pair(data, true); 352| 0| } 353| | 354| | /* 355| | TODO(Botan4) the remaining code is used only to handle the case of decoding an EC_Group 356| | which is neither a builtin group nor a group that was registered by the application. 357| | It can all be removed and replaced with a throw 358| | */ 359| | 360| 4| const auto mod_p = Barrett_Reduction::for_public_modulus(p); 361| 4| if(!is_bailie_psw_probable_prime_vartime(p)) { ------------------ | Branch (361:10): [True: 0, False: 4] ------------------ 362| 0| throw Decoding_Error("ECC p parameter is not a prime"); 363| 0| } 364| | 365| 4| if(!is_bailie_psw_probable_prime_vartime(order)) { ------------------ | Branch (365:10): [True: 0, False: 4] ------------------ 366| 0| throw Decoding_Error("Invalid ECC order parameter"); 367| 0| } 368| | 369| 4| if((p - cofactor * order).abs().bits() > (p.bits() / 2) + 1) { ------------------ | Branch (369:10): [True: 0, False: 4] ------------------ 370| 0| throw Decoding_Error("Invalid ECC Hasse bound"); 371| 0| } 372| | 373| 4| const auto discriminant = mod_p.reduce(mod_p.multiply(BigInt::from_s32(4), mod_p.cube(a)) + 374| 4| mod_p.multiply(BigInt::from_s32(27), mod_p.square(b))); 375| 4| if(discriminant == 0) { ------------------ | Branch (375:10): [True: 0, False: 4] ------------------ 376| 0| throw Decoding_Error("Invalid ECC curve discriminant"); 377| 0| } 378| | 379| 4| const size_t p_bytes = p.bytes(); 380| 4| if(base_pt.size() != 1 + p_bytes && base_pt.size() != 1 + 2 * p_bytes) { ------------------ | Branch (380:10): [True: 0, False: 4] | Branch (380:43): [True: 0, False: 0] ------------------ 381| 0| throw Decoding_Error("Invalid ECC base point encoding"); 382| 0| } 383| | 384| 4| auto [g_x, g_y] = [&]() { 385| 4| const uint8_t hdr = base_pt[0]; 386| | 387| 4| if(hdr == 0x04 && base_pt.size() == 1 + 2 * p_bytes) { 388| 4| const BigInt x = BigInt::from_bytes(std::span{base_pt}.subspan(1, p_bytes)); 389| 4| const BigInt y = BigInt::from_bytes(std::span{base_pt}.subspan(1 + p_bytes, p_bytes)); 390| | 391| 4| if(x < p && y < p) { 392| 4| return std::make_pair(x, y); 393| 4| } 394| 4| } else if((hdr == 0x02 || hdr == 0x03) && base_pt.size() == 1 + p_bytes) { 395| | // TODO(Botan4) remove this branch; we won't support compressed points 396| 4| const BigInt x = BigInt::from_bytes(std::span{base_pt}.subspan(1, p_bytes)); 397| 4| BigInt y = sqrt_modulo_prime(((x * x + a) * x + b) % p, p); 398| | 399| 4| if(x < p && y >= 0) { 400| 4| const bool y_mod_2 = (hdr & 0x01) == 1; 401| 4| if(y.get_bit(0) != y_mod_2) { 402| 4| y = p - y; 403| 4| } 404| | 405| 4| return std::make_pair(x, y); 406| 4| } 407| 4| } 408| | 409| 4| throw Decoding_Error("Invalid ECC base point encoding"); 410| 4| }(); 411| | 412| | // TODO(Botan4) we can remove this check since we'll only accept pre-registered groups 413| 4| const auto y2 = mod_p.square(g_y); 414| 4| const auto x3_ax_b = mod_p.reduce(mod_p.cube(g_x) + mod_p.multiply(a, g_x) + b); 415| 4| if(y2 != x3_ax_b) { ------------------ | Branch (415:10): [True: 0, False: 4] ------------------ 416| 0| throw Decoding_Error("Invalid ECC base point"); 417| 0| } 418| | 419| | /* 420| | * Create the group data without registering it in the global map. 421| | * 422| | * Applications that need persistent custom groups should register them 423| | * via the relevant EC_Group constructor 424| | */ 425| 4| const auto data = EC_Group_Data::create(p, a, b, g_x, g_y, order, cofactor, OID(), source); 426| | 427| 4| if(!EC_Group::verify_generator_order(data)) { ------------------ | Branch (427:10): [True: 0, False: 4] ------------------ 428| 0| throw Decoding_Error("ECC generator does not have the claimed order"); 429| 0| } 430| | 431| 4| return std::make_pair(data, true); 432| 4| } else if(next_obj_type == ASN1_Type::Null) { ------------------ | Branch (432:14): [True: 0, False: 1] ------------------ 433| 0| throw Decoding_Error("Decoding ImplicitCA ECC parameters is not supported"); 434| 1| } else { 435| 1| throw Decoding_Error( 436| 1| fmt("Unexpected tag {} while decoding ECC domain params", asn1_tag_to_string(next_obj_type))); 437| 1| } 438| 1.27k|} _ZN5Botan8EC_GroupD2Ev: 442| 5.56k|EC_Group::~EC_Group() = default; _ZN5Botan8EC_GroupC2ERKS0_: 444| 2.48k|EC_Group::EC_Group(const EC_Group&) = default; _ZN5Botan8EC_GroupC2ENSt3__110shared_ptrIKNS_13EC_Group_DataEEE: 449| 316|EC_Group::EC_Group(std::shared_ptr data) : m_data(std::move(data)) {} _ZN5Botan8EC_Group8from_OIDERKNS_3OIDE: 518| 370|EC_Group EC_Group::from_OID(const OID& oid) { 519| 370| auto data = ec_group_data().lookup(oid); 520| | 521| 370| if(!data) { ------------------ | Branch (521:7): [True: 54, False: 316] ------------------ 522| 54| throw Invalid_Argument(fmt("No EC_Group associated with OID '{}'", oid.to_string())); 523| 54| } 524| | 525| 316| return EC_Group(std::move(data)); 526| 370|} _ZN5Botan8EC_GroupC2ENSt3__14spanIKhLm18446744073709551615EEE: 703| 1.27k|EC_Group::EC_Group(std::span der) { 704| 1.27k| const auto data = DER_decode_EC_group(der, EC_Group_Source::ExternalSource); 705| 1.27k| m_data = data.first; 706| 1.27k| m_explicit_encoding = data.second; 707| 1.27k|} _ZNK5Botan8EC_Group4dataEv: 714| 4.67k|const EC_Group_Data& EC_Group::data() const { 715| 4.67k| if(m_data == nullptr) { ------------------ | Branch (715:7): [True: 0, False: 4.67k] ------------------ 716| 0| throw Invalid_State("EC_Group uninitialized"); 717| 0| } 718| 4.67k| return *m_data; 719| 4.67k|} _ZNK5Botan8EC_Group10get_p_bitsEv: 721| 2.14k|size_t EC_Group::get_p_bits() const { 722| 2.14k| return data().p_bits(); 723| 2.14k|} _ZNK5Botan8EC_Group15get_order_bytesEv: 733| 1.59k|size_t EC_Group::get_order_bytes() const { 734| 1.59k| return data().order_bytes(); 735| 1.59k|} _ZNK5Botan8EC_Group13get_curve_oidEv: 805| 937|const OID& EC_Group::get_curve_oid() const { 806| 937| return data().oid(); 807| 937|} _ZN5Botan8EC_Group9Mul2TableC2ERKNS_14EC_AffinePointE: 974| 928|EC_Group::Mul2Table::Mul2Table(const EC_AffinePoint& h) : m_tbl(h._group()->make_mul2_table(h._inner())) {} _ZN5Botan8EC_Group9Mul2TableD2Ev: 976| 928|EC_Group::Mul2Table::~Mul2Table() = default; _ZNK5Botan8EC_Group9Mul2Table27mul2_vartime_x_mod_order_eqERKNS_9EC_ScalarES4_S4_: 989| 916| const EC_Scalar& y) const { 990| 916| return m_tbl->mul2_vartime_x_mod_order_eq(v._inner(), x._inner(), y._inner()); 991| 916|} _ZNK5Botan8EC_Group9Mul2Table27mul2_vartime_x_mod_order_eqERKNS_9EC_ScalarES4_S4_S4_: 996| 916| const EC_Scalar& y) const { 997| 916| return this->mul2_vartime_x_mod_order_eq(v, c * x, c * y); 998| 916|} _ZN5Botan17EC_Group_Data_Map6lookupERKNS_3OIDE: 54| 1.63k| std::shared_ptr lookup(const OID& oid) { 55| 1.63k| const lock_guard_type lock(m_mutex); 56| | 57| 12.5k| for(auto i : m_registered_curves) { ------------------ | Branch (57:21): [True: 12.5k, False: 388] ------------------ 58| 12.5k| if(i->oid() == oid) { ------------------ | Branch (58:16): [True: 1.24k, False: 11.3k] ------------------ 59| 1.24k| return i; 60| 1.24k| } 61| 12.5k| } 62| | 63| | // Not found, check hardcoded data 64| 388| std::shared_ptr data = EC_Group::EC_group_info(oid); 65| | 66| 388| if(data) { ------------------ | Branch (66:13): [True: 315, False: 73] ------------------ 67| | // The requested OID may be an alias for a curve whose canonical OID differs 68| | // TODO(Botan4) remove this once we require exactly one canonical OID per curve 69| 315| if(data->oid() != oid) { ------------------ | Branch (69:16): [True: 304, False: 11] ------------------ 70| 304| for(const auto& i : m_registered_curves) { ------------------ | Branch (70:34): [True: 304, False: 0] ------------------ 71| 304| if(i->oid() == data->oid()) { ------------------ | Branch (71:22): [True: 304, False: 0] ------------------ 72| 304| return i; 73| 304| } 74| 304| } 75| 304| } 76| | 77| 11| m_registered_curves.push_back(data); 78| 11| return data; 79| 315| } 80| | 81| | // Nope, unknown curve 82| 73| return std::shared_ptr(); 83| 388| } _ZN5Botan13EC_Group_DataD2Ev: 28| 315|EC_Group_Data::~EC_Group_Data() = default; _ZN5Botan13EC_Group_DataC2ERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceE: 40| 315| m_p(p), 41| 315| m_a(a), 42| 315| m_b(b), 43| 315| m_g_x(g_x), 44| 315| m_g_y(g_y), 45| 315| m_order(order), 46| 315| m_cofactor(cofactor), 47| |#if defined(BOTAN_HAS_LEGACY_EC_POINT) 48| 315| m_mod_field(Barrett_Reduction::for_public_modulus(p)), 49| 315| m_mod_order(Barrett_Reduction::for_public_modulus(order)), 50| 315| m_monty(m_p, m_mod_field), 51| |#endif 52| 315| m_oid(oid), 53| 315| m_p_words(p.sig_words()), 54| 315| m_p_bits(p.bits()), 55| 315| m_order_bits(order.bits()), 56| 315| m_order_bytes((m_order_bits + 7) / 8), 57| 315| m_a_is_minus_3(a == p - 3), 58| 315| m_a_is_zero(a.is_zero()), 59| 315| m_has_cofactor(m_cofactor != 1), 60| 315| m_order_is_less_than_p(m_order < p), 61| 315| m_source(source) { 62| | // Verify the generator (x, y) satisfies y^2 = x^3 + a*x + b (mod p) 63| 315| const auto mod_p = Barrett_Reduction::for_public_modulus(p); 64| 315| const BigInt y2 = mod_p.square(g_y); 65| 315| const BigInt x3_ax_b = mod_p.reduce(mod_p.cube(g_x) + mod_p.multiply(a, g_x) + b); 66| 315| if(y2 != x3_ax_b) { ------------------ | Branch (66:7): [True: 0, False: 315] ------------------ 67| 0| throw Invalid_Argument("EC_Group generator is not on the curve"); 68| 0| } 69| | 70| | // TODO(Botan4) we can assume/assert the OID is set 71| 315| if(!m_oid.empty()) { ------------------ | Branch (71:7): [True: 315, False: 0] ------------------ 72| 315| DER_Encoder der(m_der_named_curve); 73| 315| der.encode(m_oid); 74| | 75| 315| if(const auto name = m_oid.registered_name()) { ------------------ | Branch (75:21): [True: 315, False: 0] ------------------ 76| 315| if(auto pcurve = PCurve::PrimeOrderCurve::for_named_curve(*name)) { ------------------ | Branch (76:18): [True: 4, False: 311] ------------------ 77| 4| const bool same_params = [&]() { 78| 4| if(m_source == EC_Group_Source::Builtin) { 79| 4| return true; 80| 4| } 81| | 82| 4| if(const auto group_oid = OID::from_name(*name)) { 83| 4| if(const auto group_info = EC_Group::EC_group_info(*group_oid)) { 84| 4| return group_info->params_match(p, a, b, g_x, g_y, order, cofactor); 85| 4| } 86| 4| } 87| | 88| 4| return false; 89| 4| }(); 90| | 91| 4| if(same_params) { ------------------ | Branch (91:16): [True: 4, False: 0] ------------------ 92| 4| m_pcurve = std::move(pcurve); 93| 4| } 94| 4| } 95| 315| } 96| 315| if(m_pcurve) { ------------------ | Branch (96:10): [True: 4, False: 311] ------------------ 97| 4| m_engine = EC_Group_Engine::Optimized; 98| 4| } 99| 315| } 100| | 101| | // Try a generic pcurves instance 102| 315| if(!m_pcurve && !m_has_cofactor) { ------------------ | Branch (102:7): [True: 311, False: 4] | Branch (102:20): [True: 311, False: 0] ------------------ 103| 311| m_pcurve = PCurve::PrimeOrderCurve::from_params(p, a, b, g_x, g_y, order); 104| 311| if(m_pcurve) { ------------------ | Branch (104:10): [True: 307, False: 4] ------------------ 105| 307| m_engine = EC_Group_Engine::Generic; 106| 307| } 107| | // possibly still null here, if parameters unsuitable or if the 108| | // pcurves_generic module wasn't included in the build 109| 311| } 110| | 111| 315|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 112| 315| secure_vector ws; 113| 315| m_a_r = m_monty.mul(a, m_monty.R2(), ws); 114| 315| m_b_r = m_monty.mul(b, m_monty.R2(), ws); 115| 315| if(!m_pcurve) { ------------------ | Branch (115:7): [True: 4, False: 311] ------------------ 116| 4| m_engine = EC_Group_Engine::Legacy; 117| 4| } 118| |#else 119| | if(!m_pcurve) { 120| | if(m_oid.empty()) { 121| | throw Not_Implemented("EC_Group this group is not supported in this build configuration"); 122| | } else { 123| | throw Not_Implemented( 124| | fmt("EC_Group the group {} is not supported in this build configuration", oid.to_string())); 125| | } 126| | } 127| |#endif 128| 315|} _ZN5Botan13EC_Group_Data6createERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceE: 138| 315| EC_Group_Source source) { 139| 315| auto group = std::make_shared(p, a, b, g_x, g_y, order, cofactor, oid, source); 140| | 141| 315|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 142| 315| group->m_curve = CurveGFp(group.get()); 143| 315| group->m_base_point = EC_Point(group->m_curve, g_x, g_y); 144| 315| if(!group->m_pcurve) { ------------------ | Branch (144:7): [True: 4, False: 311] ------------------ 145| 4| group->m_base_mult = std::make_unique(group->m_base_point, group->m_mod_order); 146| 4| } 147| 315|#endif 148| | 149| 315| return group; 150| 315|} _ZNK5Botan13EC_Group_Data28scalar_from_bytes_with_truncENSt3__14spanIKhLm18446744073709551615EEE: 260| 655|std::unique_ptr EC_Group_Data::scalar_from_bytes_with_trunc(std::span bytes) const { 261| 655| const size_t bit_length = 8 * bytes.size(); 262| | 263| 655| if(bit_length < order_bits()) { ------------------ | Branch (263:7): [True: 280, False: 375] ------------------ 264| | // No shifting required, but might still need to reduce by modulus 265| 280| return this->scalar_from_bytes_mod_order(bytes); 266| 375| } else { 267| 375| const size_t shift = bit_length - order_bits(); 268| | 269| 375| const size_t new_length = bytes.size() - (shift / 8); 270| 375| const size_t bit_shift = shift % 8; 271| | 272| 375| if(bit_shift == 0) { ------------------ | Branch (272:10): [True: 375, False: 0] ------------------ 273| | // Easy case just read different bytes 274| 375| return this->scalar_from_bytes_mod_order(bytes.first(new_length)); 275| 375| } else { 276| 0| std::vector sbytes(new_length); 277| | 278| 0| uint8_t carry = 0; 279| 0| for(size_t i = 0; i != new_length; ++i) { ------------------ | Branch (279:28): [True: 0, False: 0] ------------------ 280| 0| const uint8_t w = bytes[i]; 281| 0| sbytes[i] = (w >> bit_shift) | carry; 282| 0| carry = w << (8 - bit_shift); 283| 0| } 284| | 285| 0| return this->scalar_from_bytes_mod_order(sbytes); 286| 0| } 287| 375| } 288| 655|} _ZNK5Botan13EC_Group_Data27scalar_from_bytes_mod_orderENSt3__14spanIKhLm18446744073709551615EEE: 290| 916|std::unique_ptr EC_Group_Data::scalar_from_bytes_mod_order(std::span bytes) const { 291| 916| if(bytes.size() > 2 * order_bytes()) { ------------------ | Branch (291:7): [True: 0, False: 916] ------------------ 292| 0| return {}; 293| 0| } 294| | 295| 916| if(m_pcurve) { ------------------ | Branch (295:7): [True: 916, False: 0] ------------------ 296| 916| if(auto s = m_pcurve->scalar_from_wide_bytes(bytes)) { ------------------ | Branch (296:15): [True: 916, False: 0] ------------------ 297| 916| return std::make_unique(shared_from_this(), std::move(*s)); 298| 916| } else { 299| 0| return {}; 300| 0| } 301| 916| } else { 302| 0|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 303| 0| return std::make_unique(shared_from_this(), m_mod_order.reduce(BigInt(bytes))); 304| |#else 305| | throw Not_Implemented("Legacy EC interfaces disabled in this build configuration"); 306| |#endif 307| 0| } 308| 916|} _ZNK5Botan13EC_Group_Data18scalar_deserializeENSt3__14spanIKhLm18446744073709551615EEE: 375| 1.85k|std::unique_ptr EC_Group_Data::scalar_deserialize(std::span bytes) const { 376| 1.85k| if(bytes.size() != m_order_bytes) { ------------------ | Branch (376:7): [True: 10, False: 1.84k] ------------------ 377| 10| return nullptr; 378| 10| } 379| | 380| 1.84k| if(m_pcurve) { ------------------ | Branch (380:7): [True: 1.84k, False: 0] ------------------ 381| 1.84k| if(auto s = m_pcurve->deserialize_scalar(bytes)) { ------------------ | Branch (381:15): [True: 1.83k, False: 10] ------------------ 382| 1.83k| return std::make_unique(shared_from_this(), *s); 383| 1.83k| } else { 384| 10| return nullptr; 385| 10| } 386| 1.84k| } else { 387| 0|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 388| 0| BigInt r(bytes); 389| | 390| 0| if(r.is_zero() || r >= m_order) { ------------------ | Branch (390:10): [True: 0, False: 0] | Branch (390:25): [True: 0, False: 0] ------------------ 391| 0| return nullptr; 392| 0| } 393| | 394| 0| return std::make_unique(shared_from_this(), std::move(r)); 395| |#else 396| | throw Not_Implemented("Legacy EC interfaces disabled in this build configuration"); 397| |#endif 398| 0| } 399| 1.84k|} _ZNK5Botan13EC_Group_Data30point_deserialize_uncompressedENSt3__14spanIKhLm18446744073709551615EEE: 402| 1.55k| std::span bytes) const { 403| 1.55k| if(bytes.size() != 1 + 2 * p_bytes() || bytes[0] != 0x04) { ------------------ | Branch (403:7): [True: 442, False: 1.11k] | Branch (403:44): [True: 1, False: 1.11k] ------------------ 404| 443| return {}; 405| 443| } 406| | 407| 1.11k| if(m_pcurve) { ------------------ | Branch (407:7): [True: 1.11k, False: 0] ------------------ 408| 1.11k| if(auto pt = m_pcurve->deserialize_point_uncompressed(bytes)) { ------------------ | Branch (408:15): [True: 928, False: 184] ------------------ 409| 928| return std::make_unique(shared_from_this(), std::move(*pt)); 410| 928| } else { 411| 184| return {}; 412| 184| } 413| 1.11k| } else { 414| 0|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 415| 0| try { 416| 0| auto pt = Botan::OS2ECP(bytes, m_curve); 417| 0| return std::make_unique(shared_from_this(), std::move(pt)); 418| 0| } catch(...) { 419| 0| return {}; 420| 0| } 421| |#else 422| | throw Not_Implemented("Legacy EC interfaces disabled in this build configuration"); 423| |#endif 424| 0| } 425| 1.11k|} _ZNK5Botan13EC_Group_Data28point_deserialize_compressedENSt3__14spanIKhLm18446744073709551615EEE: 427| 627|std::unique_ptr EC_Group_Data::point_deserialize_compressed(std::span bytes) const { 428| 627| if(bytes.size() != 1 + p_bytes() || (bytes[0] != 0x02 && bytes[0] != 0x03)) { ------------------ | Branch (428:7): [True: 195, False: 432] | Branch (428:41): [True: 427, False: 5] | Branch (428:61): [True: 4, False: 423] ------------------ 429| 199| return {}; 430| 199| } 431| | 432| 428| if(m_pcurve) { ------------------ | Branch (432:7): [True: 210, False: 218] ------------------ 433| 210| if(auto pt = m_pcurve->deserialize_point_compressed(bytes)) { ------------------ | Branch (433:15): [True: 135, False: 75] ------------------ 434| 135| return std::make_unique(shared_from_this(), std::move(*pt)); 435| 135| } else { 436| 75| return {}; 437| 75| } 438| 218| } else { 439| 218|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 440| 218| try { 441| 218| auto pt = Botan::OS2ECP(bytes, m_curve); 442| 218| return std::make_unique(shared_from_this(), std::move(pt)); 443| 218| } catch(...) { 444| 78| return {}; 445| 78| } 446| |#else 447| | throw Not_Implemented("Legacy EC interfaces disabled in this build configuration"); 448| |#endif 449| 218| } 450| 428|} _ZNK5Botan13EC_Group_Data15make_mul2_tableERKNS_19EC_AffinePoint_DataE: 653| 928|std::unique_ptr EC_Group_Data::make_mul2_table(const EC_AffinePoint_Data& h) const { 654| 928| if(m_pcurve) { ------------------ | Branch (654:7): [True: 928, False: 0] ------------------ 655| 928| return std::make_unique(h); 656| 928| } else { 657| 0|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 658| 0| const EC_AffinePoint_Data_BN g(shared_from_this(), this->base_point()); 659| 0| return std::make_unique(g, h); 660| |#else 661| | throw Not_Implemented("Legacy EC interfaces disabled in this build configuration"); 662| |#endif 663| 0| } 664| 928|} ec_inner_data.cpp:_ZZN5Botan13EC_Group_DataC1ERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceEENK3$_0clEv: 77| 4| const bool same_params = [&]() { 78| 4| if(m_source == EC_Group_Source::Builtin) { ------------------ | Branch (78:19): [True: 4, False: 0] ------------------ 79| 4| return true; 80| 4| } 81| | 82| 0| if(const auto group_oid = OID::from_name(*name)) { ------------------ | Branch (82:30): [True: 0, False: 0] ------------------ 83| 0| if(const auto group_info = EC_Group::EC_group_info(*group_oid)) { ------------------ | Branch (83:33): [True: 0, False: 0] ------------------ 84| 0| return group_info->params_match(p, a, b, g_x, g_y, order, cofactor); 85| 0| } 86| 0| } 87| | 88| 0| return false; 89| 0| }(); _ZN5Botan17EC_Scalar_Data_PC11checked_refERKNS_14EC_Scalar_DataE: 14| 4.58k|const EC_Scalar_Data_PC& EC_Scalar_Data_PC::checked_ref(const EC_Scalar_Data& data) { 15| 4.58k| const auto* p = dynamic_cast(&data); 16| 4.58k| if(p == nullptr) { ------------------ | Branch (16:7): [True: 0, False: 4.58k] ------------------ 17| 0| throw Invalid_State("Failed conversion to EC_Scalar_Data_PC"); 18| 0| } 19| 4.58k| return *p; 20| 4.58k|} _ZNK5Botan17EC_Scalar_Data_PC5groupEv: 22| 11.2k|const std::shared_ptr& EC_Scalar_Data_PC::group() const { 23| 11.2k| return m_group; 24| 11.2k|} _ZNK5Botan17EC_Scalar_Data_PC5cloneEv: 30| 1.83k|std::unique_ptr EC_Scalar_Data_PC::clone() const { 31| 1.83k| return std::make_unique(this->group(), this->value()); 32| 1.83k|} _ZNK5Botan17EC_Scalar_Data_PC7is_zeroEv: 34| 2.09k|bool EC_Scalar_Data_PC::is_zero() const { 35| 2.09k| const auto& pcurve = this->group()->pcurve(); 36| 2.09k| return pcurve.scalar_is_zero(m_v); 37| 2.09k|} _ZNK5Botan17EC_Scalar_Data_PC6negateEv: 58| 261|std::unique_ptr EC_Scalar_Data_PC::negate() const { 59| 261| return std::make_unique(m_group, m_group->pcurve().scalar_negate(m_v)); 60| 261|} _ZNK5Botan17EC_Scalar_Data_PC14invert_vartimeEv: 66| 916|std::unique_ptr EC_Scalar_Data_PC::invert_vartime() const { 67| 916| return std::make_unique(m_group, m_group->pcurve().scalar_invert_vartime(m_v)); 68| 916|} _ZNK5Botan17EC_Scalar_Data_PC3mulERKNS_14EC_Scalar_DataE: 78| 1.83k|std::unique_ptr EC_Scalar_Data_PC::mul(const EC_Scalar_Data& other) const { 79| 1.83k| return std::make_unique(m_group, group()->pcurve().scalar_mul(m_v, checked_ref(other).m_v)); 80| 1.83k|} _ZN5Botan22EC_AffinePoint_Data_PCC2ENSt3__110shared_ptrIKNS_13EC_Group_DataEEENS_6PCurve15PrimeOrderCurve11AffinePointE: 89| 1.06k| m_group(std::move(group)), m_pt(std::move(pt)) { 90| 1.06k| const auto& pcurve = m_group->pcurve(); 91| | 92| 1.06k| if(!pcurve.affine_point_is_identity(m_pt)) { ------------------ | Branch (92:7): [True: 1.06k, False: 0] ------------------ 93| 1.06k| m_xy.resize(1 + 2 * field_element_bytes()); 94| 1.06k| pcurve.serialize_point(m_xy, m_pt); 95| 1.06k| } 96| 1.06k|} _ZN5Botan22EC_AffinePoint_Data_PC11checked_refERKNS_19EC_AffinePoint_DataE: 98| 928|const EC_AffinePoint_Data_PC& EC_AffinePoint_Data_PC::checked_ref(const EC_AffinePoint_Data& data) { 99| 928| const auto* p = dynamic_cast(&data); 100| 928| if(p == nullptr) { ------------------ | Branch (100:7): [True: 0, False: 928] ------------------ 101| 0| throw Invalid_State("Failed conversion to EC_AffinePoint_Data_PC"); 102| 0| } 103| 928| return *p; 104| 928|} _ZNK5Botan22EC_AffinePoint_Data_PC5groupEv: 110| 3.84k|const std::shared_ptr& EC_AffinePoint_Data_PC::group() const { 111| 3.84k| return m_group; 112| 3.84k|} _ZNK5Botan22EC_AffinePoint_Data_PC19field_element_bytesEv: 130| 2.12k|size_t EC_AffinePoint_Data_PC::field_element_bytes() const { 131| 2.12k| return m_group->pcurve().field_element_bytes(); 132| 2.12k|} _ZNK5Botan22EC_AffinePoint_Data_PC11is_identityEv: 134| 2.12k|bool EC_AffinePoint_Data_PC::is_identity() const { 135| 2.12k| return m_xy.empty(); 136| 2.12k|} _ZNK5Botan22EC_AffinePoint_Data_PC15to_legacy_pointEv: 178| 1.06k|EC_Point EC_AffinePoint_Data_PC::to_legacy_point() const { 179| 1.06k| if(this->is_identity()) { ------------------ | Branch (179:7): [True: 0, False: 1.06k] ------------------ 180| 0| return EC_Point(m_group->curve()); 181| 1.06k| } else { 182| 1.06k| const size_t fe_bytes = this->field_element_bytes(); 183| 1.06k| return EC_Point(m_group->curve(), 184| 1.06k| BigInt::from_bytes(std::span{m_xy}.subspan(1, fe_bytes)), 185| 1.06k| BigInt::from_bytes(std::span{m_xy}.last(fe_bytes))); 186| 1.06k| } 187| 1.06k|} _ZN5Botan20EC_Mul2Table_Data_PCC2ERKNS_19EC_AffinePoint_DataE: 190| 928|EC_Mul2Table_Data_PC::EC_Mul2Table_Data_PC(const EC_AffinePoint_Data& q) : m_group(q.group()) { 191| 928| BOTAN_ARG_CHECK(q.group() == m_group, "Curve mismatch"); ------------------ | | 35| 928| do { \ | | 36| 928| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 928| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 928] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 928| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 928] | | ------------------ ------------------ 192| | 193| 928| const auto& pt_q = EC_AffinePoint_Data_PC::checked_ref(q); 194| | 195| 928| m_tbl = m_group->pcurve().mul2_setup_g(pt_q.value()); 196| 928|} _ZNK5Botan20EC_Mul2Table_Data_PC27mul2_vartime_x_mod_order_eqERKNS_14EC_Scalar_DataES3_S3_: 216| 916| const EC_Scalar_Data& yd) const { 217| 916| BOTAN_ARG_CHECK(xd.group() == m_group && yd.group() == m_group, "Curve mismatch"); ------------------ | | 35| 916| do { \ | | 36| 916| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.83k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 916, False: 0] | | | Branch (37:12): [True: 916, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 916| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 916] | | ------------------ ------------------ 218| | 219| 916| const auto& v = EC_Scalar_Data_PC::checked_ref(vd); 220| 916| const auto& x = EC_Scalar_Data_PC::checked_ref(xd); 221| 916| const auto& y = EC_Scalar_Data_PC::checked_ref(yd); 222| | 223| 916| return m_group->pcurve().mul2_vartime_x_mod_order_eq(*m_tbl, v.value(), x.value(), y.value()); 224| 916|} _ZN5Botan8EC_Group13EC_group_infoERKNS_3OIDE: 16| 388|std::shared_ptr EC_Group::EC_group_info(const OID& oid) { 17| | // secp256r1 18| 388| if(oid == OID{1, 2, 840, 10045, 3, 1, 7}) { ------------------ | Branch (18:7): [True: 0, False: 388] ------------------ 19| 0| return load_EC_group_info( 20| 0| "0xFFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFF", 21| 0| "0xFFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFC", 22| 0| "0x5AC635D8AA3A93E7B3EBBD55769886BC651D06B0CC53B0F63BCE3C3E27D2604B", 23| 0| "0x6B17D1F2E12C4247F8BCE6E563A440F277037D812DEB33A0F4A13945D898C296", 24| 0| "0x4FE342E2FE1A7F9B8EE7EB4A7C0F9E162BCE33576B315ECECBB6406837BF51F5", 25| 0| "0xFFFFFFFF00000000FFFFFFFFFFFFFFFFBCE6FAADA7179E84F3B9CAC2FC632551", 26| 0| oid); 27| 0| } 28| | 29| | // secp384r1 30| 388| if(oid == OID{1, 3, 132, 0, 34}) { ------------------ | Branch (30:7): [True: 1, False: 387] ------------------ 31| 1| return load_EC_group_info( 32| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFF", 33| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFC", 34| 1| "0xB3312FA7E23EE7E4988E056BE3F82D19181D9C6EFE8141120314088F5013875AC656398D8A2ED19D2A85C8EDD3EC2AEF", 35| 1| "0xAA87CA22BE8B05378EB1C71EF320AD746E1D3B628BA79B9859F741E082542A385502F25DBF55296C3A545E3872760AB7", 36| 1| "0x3617DE4A96262C6F5D9E98BF9292DC29F8F41DBD289A147CE9DA3113B5F0B8C00A60B1CE1D7E819D7A431D7C90EA0E5F", 37| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFC7634D81F4372DDF581A0DB248B0A77AECEC196ACCC52973", 38| 1| oid); 39| 1| } 40| | 41| | // secp521r1 42| 387| if(oid == OID{1, 3, 132, 0, 35}) { ------------------ | Branch (42:7): [True: 1, False: 386] ------------------ 43| 1| return load_EC_group_info( 44| 1| "0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", 45| 1| "0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFC", 46| 1| "0x51953EB9618E1C9A1F929A21A0B68540EEA2DA725B99B315F3B8B489918EF109E156193951EC7E937B1652C0BD3BB1BF073573DF883D2C34F1EF451FD46B503F00", 47| 1| "0xC6858E06B70404E9CD9E3ECB662395B4429C648139053FB521F828AF606B4D3DBAA14B5E77EFE75928FE1DC127A2FFA8DE3348B3C1856A429BF97E7E31C2E5BD66", 48| 1| "0x11839296A789A3BC0045C8A5FB42C7D1BD998F54449579B446817AFBD17273E662C97EE72995EF42640C550B9013FAD0761353C7086A272C24088BE94769FD16650", 49| 1| "0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFA51868783BF2F966B7FCC0148F709A5D03BB5C9B8899C47AEBB6FB71E91386409", 50| 1| oid); 51| 1| } 52| | 53| | // brainpool160r1 54| 386| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 1}) { ------------------ | Branch (54:7): [True: 0, False: 386] ------------------ 55| 0| return load_EC_group_info( 56| 0| "0xE95E4A5F737059DC60DFC7AD95B3D8139515620F", 57| 0| "0x340E7BE2A280EB74E2BE61BADA745D97E8F7C300", 58| 0| "0x1E589A8595423412134FAA2DBDEC95C8D8675E58", 59| 0| "0xBED5AF16EA3F6A4F62938C4631EB5AF7BDBCDBC3", 60| 0| "0x1667CB477A1A8EC338F94741669C976316DA6321", 61| 0| "0xE95E4A5F737059DC60DF5991D45029409E60FC09", 62| 0| oid); 63| 0| } 64| | 65| | // brainpool192r1 66| 386| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 3}) { ------------------ | Branch (66:7): [True: 0, False: 386] ------------------ 67| 0| return load_EC_group_info( 68| 0| "0xC302F41D932A36CDA7A3463093D18DB78FCE476DE1A86297", 69| 0| "0x6A91174076B1E0E19C39C031FE8685C1CAE040E5C69A28EF", 70| 0| "0x469A28EF7C28CCA3DC721D044F4496BCCA7EF4146FBF25C9", 71| 0| "0xC0A0647EAAB6A48753B033C56CB0F0900A2F5C4853375FD6", 72| 0| "0x14B690866ABD5BB88B5F4828C1490002E6773FA2FA299B8F", 73| 0| "0xC302F41D932A36CDA7A3462F9E9E916B5BE8F1029AC4ACC1", 74| 0| oid); 75| 0| } 76| | 77| | // brainpool224r1 78| 386| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 5}) { ------------------ | Branch (78:7): [True: 0, False: 386] ------------------ 79| 0| return load_EC_group_info( 80| 0| "0xD7C134AA264366862A18302575D1D787B09F075797DA89F57EC8C0FF", 81| 0| "0x68A5E62CA9CE6C1C299803A6C1530B514E182AD8B0042A59CAD29F43", 82| 0| "0x2580F63CCFE44138870713B1A92369E33E2135D266DBB372386C400B", 83| 0| "0xD9029AD2C7E5CF4340823B2A87DC68C9E4CE3174C1E6EFDEE12C07D", 84| 0| "0x58AA56F772C0726F24C6B89E4ECDAC24354B9E99CAA3F6D3761402CD", 85| 0| "0xD7C134AA264366862A18302575D0FB98D116BC4B6DDEBCA3A5A7939F", 86| 0| oid); 87| 0| } 88| | 89| | // brainpool256r1 90| 386| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 7}) { ------------------ | Branch (90:7): [True: 0, False: 386] ------------------ 91| 0| return load_EC_group_info( 92| 0| "0xA9FB57DBA1EEA9BC3E660A909D838D726E3BF623D52620282013481D1F6E5377", 93| 0| "0x7D5A0975FC2C3057EEF67530417AFFE7FB8055C126DC5C6CE94A4B44F330B5D9", 94| 0| "0x26DC5C6CE94A4B44F330B5D9BBD77CBF958416295CF7E1CE6BCCDC18FF8C07B6", 95| 0| "0x8BD2AEB9CB7E57CB2C4B482FFC81B7AFB9DE27E1E3BD23C23A4453BD9ACE3262", 96| 0| "0x547EF835C3DAC4FD97F8461A14611DC9C27745132DED8E545C1D54C72F046997", 97| 0| "0xA9FB57DBA1EEA9BC3E660A909D838D718C397AA3B561A6F7901E0E82974856A7", 98| 0| oid); 99| 0| } 100| | 101| | // brainpool320r1 102| 386| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 9}) { ------------------ | Branch (102:7): [True: 0, False: 386] ------------------ 103| 0| return load_EC_group_info( 104| 0| "0xD35E472036BC4FB7E13C785ED201E065F98FCFA6F6F40DEF4F92B9EC7893EC28FCD412B1F1B32E27", 105| 0| "0x3EE30B568FBAB0F883CCEBD46D3F3BB8A2A73513F5EB79DA66190EB085FFA9F492F375A97D860EB4", 106| 0| "0x520883949DFDBC42D3AD198640688A6FE13F41349554B49ACC31DCCD884539816F5EB4AC8FB1F1A6", 107| 0| "0x43BD7E9AFB53D8B85289BCC48EE5BFE6F20137D10A087EB6E7871E2A10A599C710AF8D0D39E20611", 108| 0| "0x14FDD05545EC1CC8AB4093247F77275E0743FFED117182EAA9C77877AAAC6AC7D35245D1692E8EE1", 109| 0| "0xD35E472036BC4FB7E13C785ED201E065F98FCFA5B68F12A32D482EC7EE8658E98691555B44C59311", 110| 0| oid); 111| 0| } 112| | 113| | // brainpool384r1 114| 386| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 11}) { ------------------ | Branch (114:7): [True: 0, False: 386] ------------------ 115| 0| return load_EC_group_info( 116| 0| "0x8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B412B1DA197FB71123ACD3A729901D1A71874700133107EC53", 117| 0| "0x7BC382C63D8C150C3C72080ACE05AFA0C2BEA28E4FB22787139165EFBA91F90F8AA5814A503AD4EB04A8C7DD22CE2826", 118| 0| "0x4A8C7DD22CE28268B39B55416F0447C2FB77DE107DCD2A62E880EA53EEB62D57CB4390295DBC9943AB78696FA504C11", 119| 0| "0x1D1C64F068CF45FFA2A63A81B7C13F6B8847A3E77EF14FE3DB7FCAFE0CBD10E8E826E03436D646AAEF87B2E247D4AF1E", 120| 0| "0x8ABE1D7520F9C2A45CB1EB8E95CFD55262B70B29FEEC5864E19C054FF99129280E4646217791811142820341263C5315", 121| 0| "0x8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B31F166E6CAC0425A7CF3AB6AF6B7FC3103B883202E9046565", 122| 0| oid); 123| 0| } 124| | 125| | // brainpool512r1 126| 386| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 13}) { ------------------ | Branch (126:7): [True: 0, False: 386] ------------------ 127| 0| return load_EC_group_info( 128| 0| "0xAADD9DB8DBE9C48B3FD4E6AE33C9FC07CB308DB3B3C9D20ED6639CCA703308717D4D9B009BC66842AECDA12AE6A380E62881FF2F2D82C68528AA6056583A48F3", 129| 0| "0x7830A3318B603B89E2327145AC234CC594CBDD8D3DF91610A83441CAEA9863BC2DED5D5AA8253AA10A2EF1C98B9AC8B57F1117A72BF2C7B9E7C1AC4D77FC94CA", 130| 0| "0x3DF91610A83441CAEA9863BC2DED5D5AA8253AA10A2EF1C98B9AC8B57F1117A72BF2C7B9E7C1AC4D77FC94CADC083E67984050B75EBAE5DD2809BD638016F723", 131| 0| "0x81AEE4BDD82ED9645A21322E9C4C6A9385ED9F70B5D916C1B43B62EEF4D0098EFF3B1F78E2D0D48D50D1687B93B97D5F7C6D5047406A5E688B352209BCB9F822", 132| 0| "0x7DDE385D566332ECC0EABFA9CF7822FDF209F70024A57B1AA000C55B881F8111B2DCDE494A5F485E5BCA4BD88A2763AED1CA2B2FA8F0540678CD1E0F3AD80892", 133| 0| "0xAADD9DB8DBE9C48B3FD4E6AE33C9FC07CB308DB3B3C9D20ED6639CCA70330870553E5C414CA92619418661197FAC10471DB1D381085DDADDB58796829CA90069", 134| 0| oid); 135| 0| } 136| | 137| | // frp256v1 138| 386| if(oid == OID{1, 2, 250, 1, 223, 101, 256, 1}) { ------------------ | Branch (138:7): [True: 0, False: 386] ------------------ 139| 0| return load_EC_group_info( 140| 0| "0xF1FD178C0B3AD58F10126DE8CE42435B3961ADBCABC8CA6DE8FCF353D86E9C03", 141| 0| "0xF1FD178C0B3AD58F10126DE8CE42435B3961ADBCABC8CA6DE8FCF353D86E9C00", 142| 0| "0xEE353FCA5428A9300D4ABA754A44C00FDFEC0C9AE4B1A1803075ED967B7BB73F", 143| 0| "0xB6B3D4C356C139EB31183D4749D423958C27D2DCAF98B70164C97A2DD98F5CFF", 144| 0| "0x6142E0F7C8B204911F9271F0F3ECEF8C2701C307E8E4C9E183115A1554062CFB", 145| 0| "0xF1FD178C0B3AD58F10126DE8CE42435B53DC67E140D2BF941FFDD459C6D655E1", 146| 0| oid); 147| 0| } 148| | 149| | // gost_256A 150| 386| if(oid == OID{1, 2, 643, 7, 1, 2, 1, 1, 1} || oid == OID{1, 2, 643, 2, 2, 35, 1} || oid == OID{1, 2, 643, 2, 2, 36, 0}) { ------------------ | Branch (150:7): [True: 1, False: 385] | Branch (150:7): [True: 305, False: 81] | Branch (150:50): [True: 0, False: 385] | Branch (150:88): [True: 304, False: 81] ------------------ 151| 305| return load_EC_group_info( 152| 305| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFD97", 153| 305| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFD94", 154| 305| "0xA6", 155| 305| "0x1", 156| 305| "0x8D91E471E0989CDA27DF505A453F2B7635294F2DDF23E3B122ACC99C9E9F1E14", 157| 305| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF6C611070995AD10045841B09B761B893", 158| 305| OID{1, 2, 643, 7, 1, 2, 1, 1, 1}); 159| 305| } 160| | 161| | // gost_512A 162| 81| if(oid == OID{1, 2, 643, 7, 1, 2, 1, 2, 1}) { ------------------ | Branch (162:7): [True: 1, False: 80] ------------------ 163| 1| return load_EC_group_info( 164| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFDC7", 165| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFDC4", 166| 1| "0xE8C2505DEDFC86DDC1BD0B2B6667F1DA34B82574761CB0E879BD081CFD0B6265EE3CB090F30D27614CB4574010DA90DD862EF9D4EBEE4761503190785A71C760", 167| 1| "0x3", 168| 1| "0x7503CFE87A836AE3A61B8816E25450E6CE5E1C93ACF1ABC1778064FDCBEFA921DF1626BE4FD036E93D75E6A50E3A41E98028FE5FC235F5B889A589CB5215F2A4", 169| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF27E69532F48D89116FF22B8D4E0560609B4B38ABFAD2B85DCACDB1411F10B275", 170| 1| oid); 171| 1| } 172| | 173| | // secp160k1 174| 80| if(oid == OID{1, 3, 132, 0, 9}) { ------------------ | Branch (174:7): [True: 1, False: 79] ------------------ 175| 1| return load_EC_group_info( 176| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC73", 177| 1| "0x0", 178| 1| "0x7", 179| 1| "0x3B4C382CE37AA192A4019E763036F4F5DD4D7EBB", 180| 1| "0x938CF935318FDCED6BC28286531733C3F03C4FEE", 181| 1| "0x100000000000000000001B8FA16DFAB9ACA16B6B3", 182| 1| oid); 183| 1| } 184| | 185| | // secp160r1 186| 79| if(oid == OID{1, 3, 132, 0, 8}) { ------------------ | Branch (186:7): [True: 1, False: 78] ------------------ 187| 1| return load_EC_group_info( 188| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFF", 189| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFC", 190| 1| "0x1C97BEFC54BD7A8B65ACF89F81D4D4ADC565FA45", 191| 1| "0x4A96B5688EF573284664698968C38BB913CBFC82", 192| 1| "0x23A628553168947D59DCC912042351377AC5FB32", 193| 1| "0x100000000000000000001F4C8F927AED3CA752257", 194| 1| oid); 195| 1| } 196| | 197| | // secp160r2 198| 78| if(oid == OID{1, 3, 132, 0, 30}) { ------------------ | Branch (198:7): [True: 1, False: 77] ------------------ 199| 1| return load_EC_group_info( 200| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC73", 201| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC70", 202| 1| "0xB4E134D3FB59EB8BAB57274904664D5AF50388BA", 203| 1| "0x52DCB034293A117E1F4FF11B30F7199D3144CE6D", 204| 1| "0xFEAFFEF2E331F296E071FA0DF9982CFEA7D43F2E", 205| 1| "0x100000000000000000000351EE786A818F3A1A16B", 206| 1| oid); 207| 1| } 208| | 209| | // secp192k1 210| 77| if(oid == OID{1, 3, 132, 0, 31}) { ------------------ | Branch (210:7): [True: 1, False: 76] ------------------ 211| 1| return load_EC_group_info( 212| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFEE37", 213| 1| "0x0", 214| 1| "0x3", 215| 1| "0xDB4FF10EC057E9AE26B07D0280B7F4341DA5D1B1EAE06C7D", 216| 1| "0x9B2F2F6D9C5628A7844163D015BE86344082AA88D95E2F9D", 217| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFE26F2FC170F69466A74DEFD8D", 218| 1| oid); 219| 1| } 220| | 221| | // secp192r1 222| 76| if(oid == OID{1, 2, 840, 10045, 3, 1, 1}) { ------------------ | Branch (222:7): [True: 0, False: 76] ------------------ 223| 0| return load_EC_group_info( 224| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFF", 225| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFC", 226| 0| "0x64210519E59C80E70FA7E9AB72243049FEB8DEECC146B9B1", 227| 0| "0x188DA80EB03090F67CBF20EB43A18800F4FF0AFD82FF1012", 228| 0| "0x7192B95FFC8DA78631011ED6B24CDD573F977A11E794811", 229| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFF99DEF836146BC9B1B4D22831", 230| 0| oid); 231| 0| } 232| | 233| | // secp224k1 234| 76| if(oid == OID{1, 3, 132, 0, 32}) { ------------------ | Branch (234:7): [True: 1, False: 75] ------------------ 235| 1| return load_EC_group_info( 236| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFE56D", 237| 1| "0x0", 238| 1| "0x5", 239| 1| "0xA1455B334DF099DF30FC28A169A467E9E47075A90F7E650EB6B7A45C", 240| 1| "0x7E089FED7FBA344282CAFBD6F7E319F7C0B0BD59E2CA4BDB556D61A5", 241| 1| "0x10000000000000000000000000001DCE8D2EC6184CAF0A971769FB1F7", 242| 1| oid); 243| 1| } 244| | 245| | // secp224r1 246| 75| if(oid == OID{1, 3, 132, 0, 33}) { ------------------ | Branch (246:7): [True: 1, False: 74] ------------------ 247| 1| return load_EC_group_info( 248| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF000000000000000000000001", 249| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFE", 250| 1| "0xB4050A850C04B3ABF54132565044B0B7D7BFD8BA270B39432355FFB4", 251| 1| "0xB70E0CBD6BB4BF7F321390B94A03C1D356C21122343280D6115C1D21", 252| 1| "0xBD376388B5F723FB4C22DFE6CD4375A05A07476444D5819985007E34", 253| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF16A2E0B8F03E13DD29455C5C2A3D", 254| 1| oid); 255| 1| } 256| | 257| | // secp256k1 258| 74| if(oid == OID{1, 3, 132, 0, 10}) { ------------------ | Branch (258:7): [True: 1, False: 73] ------------------ 259| 1| return load_EC_group_info( 260| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F", 261| 1| "0x0", 262| 1| "0x7", 263| 1| "0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798", 264| 1| "0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8", 265| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141", 266| 1| oid); 267| 1| } 268| | 269| | // sm2p256v1 270| 73| if(oid == OID{1, 2, 156, 10197, 1, 301}) { ------------------ | Branch (270:7): [True: 0, False: 73] ------------------ 271| 0| return load_EC_group_info( 272| 0| "0xFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 273| 0| "0xFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 274| 0| "0x28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 275| 0| "0x32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7", 276| 0| "0xBC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0", 277| 0| "0xFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 278| 0| oid); 279| 0| } 280| | 281| | // x962_p192v2 282| 73| if(oid == OID{1, 2, 840, 10045, 3, 1, 2}) { ------------------ | Branch (282:7): [True: 0, False: 73] ------------------ 283| 0| return load_EC_group_info( 284| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFF", 285| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFC", 286| 0| "0xCC22D6DFB95C6B25E49C0D6364A4E5980C393AA21668D953", 287| 0| "0xEEA2BAE7E1497842F2DE7769CFE9C989C072AD696F48034A", 288| 0| "0x6574D11D69B6EC7A672BB82A083DF2F2B0847DE970B2DE15", 289| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFE5FB1A724DC80418648D8DD31", 290| 0| oid); 291| 0| } 292| | 293| | // x962_p192v3 294| 73| if(oid == OID{1, 2, 840, 10045, 3, 1, 3}) { ------------------ | Branch (294:7): [True: 0, False: 73] ------------------ 295| 0| return load_EC_group_info( 296| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFF", 297| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFC", 298| 0| "0x22123DC2395A05CAA7423DAECCC94760A7D462256BD56916", 299| 0| "0x7D29778100C65A1DA1783716588DCE2B8B4AEE8E228F1896", 300| 0| "0x38A90F22637337334B49DCB66A6DC8F9978ACA7648A943B0", 301| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFF7A62D031C83F4294F640EC13", 302| 0| oid); 303| 0| } 304| | 305| | // x962_p239v1 306| 73| if(oid == OID{1, 2, 840, 10045, 3, 1, 4}) { ------------------ | Branch (306:7): [True: 0, False: 73] ------------------ 307| 0| return load_EC_group_info( 308| 0| "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFFFFF8000000000007FFFFFFFFFFF", 309| 0| "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFFFFF8000000000007FFFFFFFFFFC", 310| 0| "0x6B016C3BDCF18941D0D654921475CA71A9DB2FB27D1D37796185C2942C0A", 311| 0| "0xFFA963CDCA8816CCC33B8642BEDF905C3D358573D3F27FBBD3B3CB9AAAF", 312| 0| "0x7DEBE8E4E90A5DAE6E4054CA530BA04654B36818CE226B39FCCB7B02F1AE", 313| 0| "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFF9E5E9A9F5D9071FBD1522688909D0B", 314| 0| oid); 315| 0| } 316| | 317| | // x962_p239v2 318| 73| if(oid == OID{1, 2, 840, 10045, 3, 1, 5}) { ------------------ | Branch (318:7): [True: 0, False: 73] ------------------ 319| 0| return load_EC_group_info( 320| 0| "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFFFFF8000000000007FFFFFFFFFFF", 321| 0| "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFFFFF8000000000007FFFFFFFFFFC", 322| 0| "0x617FAB6832576CBBFED50D99F0249C3FEE58B94BA0038C7AE84C8C832F2C", 323| 0| "0x38AF09D98727705120C921BB5E9E26296A3CDCF2F35757A0EAFD87B830E7", 324| 0| "0x5B0125E4DBEA0EC7206DA0FC01D9B081329FB555DE6EF460237DFF8BE4BA", 325| 0| "0x7FFFFFFFFFFFFFFFFFFFFFFF800000CFA7E8594377D414C03821BC582063", 326| 0| oid); 327| 0| } 328| | 329| | // x962_p239v3 330| 73| if(oid == OID{1, 2, 840, 10045, 3, 1, 6}) { ------------------ | Branch (330:7): [True: 0, False: 73] ------------------ 331| 0| return load_EC_group_info( 332| 0| "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFFFFF8000000000007FFFFFFFFFFF", 333| 0| "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFFFFF8000000000007FFFFFFFFFFC", 334| 0| "0x255705FA2A306654B1F4CB03D6A750A30C250102D4988717D9BA15AB6D3E", 335| 0| "0x6768AE8E18BB92CFCF005C949AA2C6D94853D0E660BBF854B1C9505FE95A", 336| 0| "0x1607E6898F390C06BC1D552BAD226F3B6FCFE48B6E818499AF18E3ED6CF3", 337| 0| "0x7FFFFFFFFFFFFFFFFFFFFFFF7FFFFF975DEB41B3A6057C3C432146526551", 338| 0| oid); 339| 0| } 340| | 341| | // numsp512d1 342| 73| if(oid == OID{1, 3, 6, 1, 4, 1, 25258, 4, 3}) { ------------------ | Branch (342:7): [True: 0, False: 73] ------------------ 343| 0| return load_EC_group_info( 344| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFDC7", 345| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFDC4", 346| 0| "0x1D99B", 347| 0| "0x2", 348| 0| "0x1C282EB23327F9711952C250EA61AD53FCC13031CF6DD336E0B9328433AFBDD8CC5A1C1F0C716FDC724DDE537C2B0ADB00BB3D08DC83755B205CC30D7F83CF28", 349| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5B3CA4FB94E7831B4FC258ED97D0BDC63B568B36607CD243CE153F390433555D", 350| 0| oid); 351| 0| } 352| | 353| 73| return std::shared_ptr(); 354| 73|} _ZN5Botan9EC_ScalarC2ENSt3__110unique_ptrINS_14EC_Scalar_DataENS1_14default_deleteIS3_EEEE: 19| 5.76k|EC_Scalar::EC_Scalar(std::unique_ptr scalar) : m_scalar(std::move(scalar)) { 20| 5.76k| BOTAN_ASSERT_NONNULL(m_scalar); ------------------ | | 123| 5.76k| do { \ | | 124| 5.76k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (124:10): [True: 0, False: 5.76k] | | ------------------ | | 125| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 126| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 127| 0| } \ | | 128| 5.76k| } while(0) | | ------------------ | | | Branch (128:12): [Folded, False: 5.76k] | | ------------------ ------------------ 21| 5.76k|} _ZN5Botan9EC_ScalarC2ERKS0_: 23| 1.83k|EC_Scalar::EC_Scalar(const EC_Scalar& other) : m_scalar(other.inner().clone()) {} _ZN5Botan9EC_ScalarC2EOS0_: 25| 3.92k|EC_Scalar::EC_Scalar(EC_Scalar&& other) noexcept : m_scalar(std::move(other.m_scalar)) {} _ZN5Botan9EC_ScalarD2Ev: 46| 11.5k|EC_Scalar::~EC_Scalar() = default; _ZN5Botan9EC_Scalar21from_bytes_with_truncERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 56| 655|EC_Scalar EC_Scalar::from_bytes_with_trunc(const EC_Group& group, std::span bytes) { 57| 655| return EC_Scalar(group._data()->scalar_from_bytes_with_trunc(bytes)); 58| 655|} _ZN5Botan9EC_Scalar20from_bytes_mod_orderERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 60| 261|EC_Scalar EC_Scalar::from_bytes_mod_order(const EC_Group& group, std::span bytes) { 61| 261| if(auto s = group._data()->scalar_from_bytes_mod_order(bytes)) { ------------------ | Branch (61:12): [True: 261, False: 0] ------------------ 62| 261| return EC_Scalar(std::move(s)); 63| 261| } else { 64| 0| throw Decoding_Error("EC_Scalar::from_bytes_mod_order input invalid"); 65| 0| } 66| 261|} _ZN5Botan9EC_Scalar16deserialize_pairERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 109| 928| std::span bytes) { 110| 928| if(bytes.size() % 2 != 0) { ------------------ | Branch (110:7): [True: 0, False: 928] ------------------ 111| 0| return {}; 112| 0| } 113| | 114| 928| const size_t half = bytes.size() / 2; 115| | 116| 928| auto r = EC_Scalar::deserialize(group, bytes.first(half)); 117| 928| auto s = EC_Scalar::deserialize(group, bytes.last(half)); 118| | 119| 928| if(r && s) { ------------------ | Branch (119:7): [True: 919, False: 9] | Branch (119:12): [True: 916, False: 3] ------------------ 120| 916| return std::make_pair(r.value(), s.value()); 121| 916| } else { 122| 12| return {}; 123| 12| } 124| 928|} _ZN5Botan9EC_Scalar11deserializeERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 126| 1.85k|std::optional EC_Scalar::deserialize(const EC_Group& group, std::span bytes) { 127| 1.85k| if(auto v = group._data()->scalar_deserialize(bytes)) { ------------------ | Branch (127:12): [True: 1.83k, False: 20] ------------------ 128| 1.83k| return EC_Scalar(std::move(v)); 129| 1.83k| } else { 130| 20| return {}; 131| 20| } 132| 1.85k|} _ZNK5Botan9EC_Scalar7is_zeroEv: 141| 2.09k|bool EC_Scalar::is_zero() const { 142| 2.09k| return inner().is_zero(); 143| 2.09k|} _ZNK5Botan9EC_Scalar14invert_vartimeEv: 149| 916|EC_Scalar EC_Scalar::invert_vartime() const { 150| 916| return EC_Scalar(inner().invert_vartime()); 151| 916|} _ZNK5Botan9EC_Scalar6negateEv: 153| 261|EC_Scalar EC_Scalar::negate() const { 154| 261| return EC_Scalar(inner().negate()); 155| 261|} _ZNK5Botan9EC_Scalar3mulERKS0_: 171| 1.83k|EC_Scalar EC_Scalar::mul(const EC_Scalar& x) const { 172| 1.83k| BOTAN_ARG_CHECK(inner().group() == x.inner().group(), "Curve mismatch"); ------------------ | | 35| 1.83k| do { \ | | 36| 1.83k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.83k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.83k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.83k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.83k] | | ------------------ ------------------ 173| 1.83k| return EC_Scalar(inner().mul(x.inner())); 174| 1.83k|} _ZN5Botan22EC_AffinePoint_Data_BNC2ENSt3__110shared_ptrIKNS_13EC_Group_DataEEENS_8EC_PointE: 98| 140| m_group(std::move(group)), m_pt(std::move(pt)) { 99| 140| if(!m_pt.is_zero()) { ------------------ | Branch (99:7): [True: 140, False: 0] ------------------ 100| 140| m_pt.force_affine(); 101| 140| m_xy = m_pt.xy_bytes(); 102| 140| } 103| 140|} _ZNK5Botan22EC_AffinePoint_Data_BN5groupEv: 109| 140|const std::shared_ptr& EC_AffinePoint_Data_BN::group() const { 110| 140| return m_group; 111| 140|} _ZNK5Botan22EC_AffinePoint_Data_BN11is_identityEv: 153| 140|bool EC_AffinePoint_Data_BN::is_identity() const { 154| 140| return m_xy.empty(); 155| 140|} _ZN5Botan8CurveGFpC2EPKNS_13EC_Group_DataE: 28| 315|CurveGFp::CurveGFp(const EC_Group_Data* group) : m_group(group) { 29| 315| BOTAN_ASSERT_NONNULL(m_group); ------------------ | | 123| 315| do { \ | | 124| 315| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (124:10): [True: 0, False: 315] | | ------------------ | | 125| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 126| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 127| 0| } \ | | 128| 315| } while(0) | | ------------------ | | | Branch (128:12): [Folded, False: 315] | | ------------------ ------------------ 30| 315|} _ZNK5Botan8CurveGFp5groupEv: 32| 8.59k|const EC_Group_Data& CurveGFp::group() const { 33| 8.59k| BOTAN_ASSERT_NONNULL(m_group); ------------------ | | 123| 8.59k| do { \ | | 124| 8.59k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (124:10): [True: 0, False: 8.59k] | | ------------------ | | 125| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 126| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 127| 0| } \ | | 128| 8.59k| } while(0) | | ------------------ | | | Branch (128:12): [Folded, False: 8.59k] | | ------------------ ------------------ 34| 8.59k| return *m_group; 35| 8.59k|} _ZNK5Botan8CurveGFp5get_aEv: 37| 218|const BigInt& CurveGFp::get_a() const { 38| 218| return this->group().a(); 39| 218|} _ZNK5Botan8CurveGFp5get_bEv: 41| 218|const BigInt& CurveGFp::get_b() const { 42| 218| return this->group().b(); 43| 218|} _ZNK5Botan8CurveGFp5get_pEv: 45| 218|const BigInt& CurveGFp::get_p() const { 46| 218| return this->group().p(); 47| 218|} _ZNK5Botan8CurveGFp11get_p_wordsEv: 49| 1.42k|size_t CurveGFp::get_p_words() const { 50| 1.42k| return this->group().p_words(); 51| 1.42k|} _ZN5Botan8EC_PointC2ERKNS_8CurveGFpENS_6BigIntES4_: 115| 1.51k| m_curve(curve), m_x(std::move(x)), m_y(std::move(y)), m_z(m_curve.group().monty().R1()) { 116| 1.51k| const auto& group = m_curve.group(); 117| | 118| 1.51k| if(m_x < 0 || m_x >= group.p()) { ------------------ | Branch (118:7): [True: 0, False: 1.51k] | Branch (118:18): [True: 0, False: 1.51k] ------------------ 119| 0| throw Invalid_Argument("Invalid EC_Point affine x"); 120| 0| } 121| 1.51k| if(m_y < 0 || m_y >= group.p()) { ------------------ | Branch (121:7): [True: 0, False: 1.51k] | Branch (121:18): [True: 0, False: 1.51k] ------------------ 122| 0| throw Invalid_Argument("Invalid EC_Point affine y"); 123| 0| } 124| | 125| 1.51k| secure_vector monty_ws(monty_ws_size(group)); 126| | 127| 1.51k| to_rep(group, m_x, monty_ws); 128| 1.51k| to_rep(group, m_y, monty_ws); 129| 1.51k|} _ZN5Botan8EC_Point3addERKS0_RNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE: 266| 1.42k|void EC_Point::add(const EC_Point& other, std::vector& workspace) { 267| 1.42k| BOTAN_ARG_CHECK(m_curve == other.m_curve, "cannot add points on different curves"); ------------------ | | 35| 1.42k| do { \ | | 36| 1.42k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.42k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.42k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.42k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.42k] | | ------------------ ------------------ 268| | 269| 1.42k| const size_t p_words = m_curve.get_p_words(); 270| | 271| 1.42k| add(other.m_x._data(), 272| 1.42k| std::min(p_words, other.m_x.size()), 273| 1.42k| other.m_y._data(), 274| 1.42k| std::min(p_words, other.m_y.size()), 275| 1.42k| other.m_z._data(), 276| 1.42k| std::min(p_words, other.m_z.size()), 277| 1.42k| workspace); 278| 1.42k|} _ZN5Botan8EC_Point3addEPKmmS2_mS2_mRNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE: 286| 1.42k| std::vector& ws_bn) { 287| 1.42k| if((CT::all_zeros(x_words, x_size) & CT::all_zeros(z_words, z_size)).as_bool()) { ------------------ | Branch (287:7): [True: 0, False: 1.42k] ------------------ 288| 0| return; 289| 0| } 290| | 291| 1.42k| const auto& group = m_curve.group(); 292| | 293| 1.42k| if(is_zero()) { ------------------ | Branch (293:7): [True: 0, False: 1.42k] ------------------ 294| 0| m_x.set_words(x_words, x_size); 295| 0| m_y.set_words(y_words, y_size); 296| 0| m_z.set_words(z_words, z_size); 297| 0| return; 298| 0| } 299| | 300| 1.42k| resize_ws(ws_bn, monty_ws_size(group)); 301| | 302| 1.42k| secure_vector& ws = ws_bn[0].get_word_vector(); 303| 1.42k| secure_vector& sub_ws = ws_bn[1].get_word_vector(); 304| | 305| 1.42k| BigInt& T0 = ws_bn[2]; 306| 1.42k| BigInt& T1 = ws_bn[3]; 307| 1.42k| BigInt& T2 = ws_bn[4]; 308| 1.42k| BigInt& T3 = ws_bn[5]; 309| 1.42k| BigInt& T4 = ws_bn[6]; 310| 1.42k| BigInt& T5 = ws_bn[7]; 311| | 312| | /* 313| | https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addition-add-1998-cmo-2 314| | */ 315| | 316| 1.42k| const BigInt& p = group.p(); 317| | 318| 1.42k| fe_sqr(group, T0, z_words, z_size, ws); // z2^2 319| 1.42k| fe_mul(group, T1, m_x, T0, ws); // x1*z2^2 320| 1.42k| fe_mul(group, T3, z_words, z_size, T0, ws); // z2^3 321| 1.42k| fe_mul(group, T2, m_y, T3, ws); // y1*z2^3 322| | 323| 1.42k| fe_sqr(group, T3, m_z, ws); // z1^2 324| 1.42k| fe_mul(group, T4, x_words, x_size, T3, ws); // x2*z1^2 325| | 326| 1.42k| fe_mul(group, T5, m_z, T3, ws); // z1^3 327| 1.42k| fe_mul(group, T0, y_words, y_size, T5, ws); // y2*z1^3 328| | 329| 1.42k| T4.mod_sub(T1, p, sub_ws); // x2*z1^2 - x1*z2^2 330| | 331| 1.42k| T0.mod_sub(T2, p, sub_ws); 332| | 333| 1.42k| if(T4.is_zero()) { ------------------ | Branch (333:7): [True: 0, False: 1.42k] ------------------ 334| 0| if(T0.is_zero()) { ------------------ | Branch (334:10): [True: 0, False: 0] ------------------ 335| 0| mult2(ws_bn); 336| 0| return; 337| 0| } 338| | 339| | // setting to zero: 340| 0| m_x.clear(); 341| 0| m_y = group.monty().R1(); 342| 0| m_z.clear(); 343| 0| return; 344| 0| } 345| | 346| 1.42k| fe_sqr(group, T5, T4, ws); 347| | 348| 1.42k| fe_mul(group, T3, T1, T5, ws); 349| | 350| 1.42k| fe_mul(group, T1, T5, T4, ws); 351| | 352| 1.42k| fe_sqr(group, m_x, T0, ws); 353| 1.42k| m_x.mod_sub(T1, p, sub_ws); 354| 1.42k| m_x.mod_sub(T3, p, sub_ws); 355| 1.42k| m_x.mod_sub(T3, p, sub_ws); 356| | 357| 1.42k| T3.mod_sub(m_x, p, sub_ws); 358| | 359| 1.42k| fe_mul(group, m_y, T0, T3, ws); 360| 1.42k| fe_mul(group, T3, T2, T1, ws); 361| | 362| 1.42k| m_y.mod_sub(T3, p, sub_ws); 363| | 364| 1.42k| fe_mul(group, T3, z_words, z_size, m_z, ws); 365| 1.42k| fe_mul(group, m_z, T3, T4, ws); 366| 1.42k|} _ZN5Botan8EC_Point5mult2ERNSt3__16vectorINS_6BigIntENS1_9allocatorIS3_EEEE: 388| 1.06k|void EC_Point::mult2(std::vector& ws_bn) { 389| 1.06k| if(is_zero()) { ------------------ | Branch (389:7): [True: 0, False: 1.06k] ------------------ 390| 0| return; 391| 0| } 392| | 393| 1.06k| const auto& group = m_curve.group(); 394| | 395| 1.06k| if(m_y.is_zero()) { ------------------ | Branch (395:7): [True: 0, False: 1.06k] ------------------ 396| 0| *this = EC_Point(m_curve); // setting myself to zero 397| 0| return; 398| 0| } 399| | 400| 1.06k| resize_ws(ws_bn, monty_ws_size(group)); 401| | 402| 1.06k| secure_vector& ws = ws_bn[0].get_word_vector(); 403| 1.06k| secure_vector& sub_ws = ws_bn[1].get_word_vector(); 404| | 405| 1.06k| BigInt& T0 = ws_bn[2]; 406| 1.06k| BigInt& T1 = ws_bn[3]; 407| 1.06k| BigInt& T2 = ws_bn[4]; 408| 1.06k| BigInt& T3 = ws_bn[5]; 409| 1.06k| BigInt& T4 = ws_bn[6]; 410| | 411| | /* 412| | https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-1986-cc 413| | */ 414| 1.06k| const BigInt& p = group.p(); 415| | 416| 1.06k| fe_sqr(group, T0, m_y, ws); 417| | 418| 1.06k| fe_mul(group, T1, m_x, T0, ws); 419| 1.06k| fe_smul<4>(T1, p, sub_ws); 420| | 421| 1.06k| if(group.a_is_zero()) { ------------------ | Branch (421:7): [True: 582, False: 486] ------------------ 422| | // if a == 0 then 3*x^2 + a*z^4 is just 3*x^2 423| 582| fe_sqr(group, T4, m_x, ws); // x^2 424| 582| fe_smul<3>(T4, p, sub_ws); // 3*x^2 425| 582| } else if(group.a_is_minus_3()) { ------------------ | Branch (425:14): [True: 486, False: 0] ------------------ 426| | /* 427| | if a == -3 then 428| | 3*x^2 + a*z^4 == 3*x^2 - 3*z^4 == 3*(x^2-z^4) == 3*(x-z^2)*(x+z^2) 429| | */ 430| 486| fe_sqr(group, T3, m_z, ws); // z^2 431| | 432| | // (x-z^2) 433| 486| T2 = m_x; 434| 486| T2.mod_sub(T3, p, sub_ws); 435| | 436| | // (x+z^2) 437| 486| T3.mod_add(m_x, p, sub_ws); 438| | 439| 486| fe_mul(group, T4, T2, T3, ws); // (x-z^2)*(x+z^2) 440| | 441| 486| fe_smul<3>(T4, p, sub_ws); // 3*(x-z^2)*(x+z^2) 442| 486| } else { 443| 0| fe_sqr(group, T3, m_z, ws); // z^2 444| 0| fe_sqr(group, T4, T3, ws); // z^4 445| 0| fe_mul(group, T3, group.monty_a(), T4, ws); // a*z^4 446| | 447| 0| fe_sqr(group, T4, m_x, ws); // x^2 448| 0| fe_smul<3>(T4, p, sub_ws); 449| 0| T4.mod_add(T3, p, sub_ws); // 3*x^2 + a*z^4 450| 0| } 451| | 452| 1.06k| fe_sqr(group, T2, T4, ws); 453| 1.06k| T2.mod_sub(T1, p, sub_ws); 454| 1.06k| T2.mod_sub(T1, p, sub_ws); 455| | 456| 1.06k| fe_sqr(group, T3, T0, ws); 457| 1.06k| fe_smul<8>(T3, p, sub_ws); 458| | 459| 1.06k| T1.mod_sub(T2, p, sub_ws); 460| | 461| 1.06k| fe_mul(group, T0, T4, T1, ws); 462| 1.06k| T0.mod_sub(T3, p, sub_ws); 463| | 464| 1.06k| m_x.swap(T2); 465| | 466| 1.06k| fe_mul(group, T2, m_y, m_z, ws); 467| 1.06k| fe_smul<2>(T2, p, sub_ws); 468| | 469| 1.06k| m_y.swap(T0); 470| 1.06k| m_z.swap(T2); 471| 1.06k|} _ZN5Botan8EC_Point16force_all_affineENSt3__14spanIS0_Lm18446744073709551615EEERNS1_6vectorImNS_16secure_allocatorImEEEE: 520| 4|void EC_Point::force_all_affine(std::span points, secure_vector& ws) { 521| 4| if(points.size() <= 1) { ------------------ | Branch (521:7): [True: 0, False: 4] ------------------ 522| 0| for(auto& point : points) { ------------------ | Branch (522:23): [True: 0, False: 0] ------------------ 523| 0| point.force_affine(); 524| 0| } 525| 0| return; 526| 0| } 527| | 528| 2.49k| for(const auto& point : points) { ------------------ | Branch (528:26): [True: 2.49k, False: 4] ------------------ 529| 2.49k| if(point.is_zero()) { ------------------ | Branch (529:10): [True: 0, False: 2.49k] ------------------ 530| 0| throw Invalid_State("Cannot convert zero ECC point to affine"); 531| 0| } 532| 2.49k| } 533| | 534| | /* 535| | For >= 2 points use Montgomery's trick 536| | 537| | See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography" 538| | (Hankerson, Menezes, Vanstone) 539| | 540| | TODO is it really necessary to save all k points in c? 541| | */ 542| | 543| 4| const auto& group = points[0].m_curve.group(); 544| 4| const BigInt& rep_1 = group.monty().R1(); 545| | 546| 4| if(ws.size() < monty_ws_size(group)) { ------------------ | Branch (546:7): [True: 0, False: 4] ------------------ 547| 0| ws.resize(monty_ws_size(group)); 548| 0| } 549| | 550| 4| std::vector c(points.size()); 551| 4| c[0] = points[0].m_z; 552| | 553| 2.49k| for(size_t i = 1; i != points.size(); ++i) { ------------------ | Branch (553:22): [True: 2.48k, False: 4] ------------------ 554| 2.48k| fe_mul(group, c[i], c[i - 1], points[i].m_z, ws); 555| 2.48k| } 556| | 557| 4| BigInt s_inv = invert_element(group, c[c.size() - 1], ws); 558| | 559| 4| BigInt z_inv; 560| 4| BigInt z2_inv; 561| 4| BigInt z3_inv; 562| | 563| 2.49k| for(size_t i = points.size() - 1; i != 0; i--) { ------------------ | Branch (563:38): [True: 2.48k, False: 4] ------------------ 564| 2.48k| EC_Point& point = points[i]; 565| | 566| 2.48k| fe_mul(group, z_inv, s_inv, c[i - 1], ws); 567| | 568| 2.48k| s_inv = fe_mul(group, s_inv, point.m_z, ws); 569| | 570| 2.48k| fe_sqr(group, z2_inv, z_inv, ws); 571| 2.48k| fe_mul(group, z3_inv, z2_inv, z_inv, ws); 572| 2.48k| point.m_x = fe_mul(group, point.m_x, z2_inv, ws); 573| 2.48k| point.m_y = fe_mul(group, point.m_y, z3_inv, ws); 574| 2.48k| point.m_z = rep_1; 575| 2.48k| } 576| | 577| 4| fe_sqr(group, z2_inv, s_inv, ws); 578| 4| fe_mul(group, z3_inv, z2_inv, s_inv, ws); 579| 4| points[0].m_x = fe_mul(group, points[0].m_x, z2_inv, ws); 580| 4| points[0].m_y = fe_mul(group, points[0].m_y, z3_inv, ws); 581| 4| points[0].m_z = rep_1; 582| 4|} _ZN5Botan8EC_Point12force_affineEv: 584| 140|void EC_Point::force_affine() { 585| 140| if(is_zero()) { ------------------ | Branch (585:7): [True: 0, False: 140] ------------------ 586| 0| throw Invalid_State("Cannot convert zero ECC point to affine"); 587| 0| } 588| | 589| 140| secure_vector ws; 590| | 591| 140| const auto& group = m_curve.group(); 592| | 593| 140| const BigInt z_inv = invert_element(group, m_z, ws); 594| 140| const BigInt z2_inv = fe_sqr(group, z_inv, ws); 595| 140| const BigInt z3_inv = fe_mul(group, z_inv, z2_inv, ws); 596| 140| m_x = fe_mul(group, m_x, z2_inv, ws); 597| 140| m_y = fe_mul(group, m_y, z3_inv, ws); 598| 140| m_z = group.monty().R1(); 599| 140|} _ZNK5Botan8EC_Point9is_affineEv: 601| 280|bool EC_Point::is_affine() const { 602| 280| const auto& group = m_curve.group(); 603| 280| return m_z == group.monty().R1(); 604| 280|} _ZNK5Botan8EC_Point8xy_bytesEv: 622| 140|secure_vector EC_Point::xy_bytes() const { 623| 140| const auto& group = m_curve.group(); 624| 140| const size_t p_bytes = group.p_bytes(); 625| 140| secure_vector b(2 * p_bytes); 626| 140| BigInt::encode_1363(&b[0], p_bytes, this->get_affine_x()); // NOLINT(*container-data-pointer) 627| 140| BigInt::encode_1363(&b[p_bytes], p_bytes, this->get_affine_y()); 628| 140| return b; 629| 140|} _ZNK5Botan8EC_Point12get_affine_xEv: 631| 140|BigInt EC_Point::get_affine_x() const { 632| 140| if(is_zero()) { ------------------ | Branch (632:7): [True: 0, False: 140] ------------------ 633| 0| throw Invalid_State("Cannot convert zero point to affine"); 634| 0| } 635| | 636| 140| secure_vector monty_ws; 637| | 638| 140| const auto& group = m_curve.group(); 639| | 640| 140| if(is_affine()) { ------------------ | Branch (640:7): [True: 140, False: 0] ------------------ 641| 140| return from_rep_to_tmp(group, m_x, monty_ws); 642| 140| } 643| | 644| 0| BigInt z2 = fe_sqr(group, m_z, monty_ws); 645| 0| z2 = invert_element(group, z2, monty_ws); 646| | 647| 0| BigInt r; 648| 0| fe_mul(group, r, m_x, z2, monty_ws); 649| 0| from_rep(group, r, monty_ws); 650| 0| return r; 651| 140|} _ZNK5Botan8EC_Point12get_affine_yEv: 653| 140|BigInt EC_Point::get_affine_y() const { 654| 140| if(is_zero()) { ------------------ | Branch (654:7): [True: 0, False: 140] ------------------ 655| 0| throw Invalid_State("Cannot convert zero point to affine"); 656| 0| } 657| | 658| 140| const auto& group = m_curve.group(); 659| 140| secure_vector monty_ws; 660| | 661| 140| if(is_affine()) { ------------------ | Branch (661:7): [True: 140, False: 0] ------------------ 662| 140| return from_rep_to_tmp(group, m_y, monty_ws); 663| 140| } 664| | 665| 0| const BigInt z2 = fe_sqr(group, m_z, monty_ws); 666| 0| const BigInt z3 = fe_mul(group, m_z, z2, monty_ws); 667| 0| const BigInt z3_inv = invert_element(group, z3, monty_ws); 668| | 669| 0| BigInt r; 670| 0| fe_mul(group, r, m_y, z3_inv, monty_ws); 671| 0| from_rep(group, r, monty_ws); 672| 0| return r; 673| 140|} _ZNK5Botan8EC_Point12on_the_curveEv: 675| 140|bool EC_Point::on_the_curve() const { 676| | /* 677| | Is the point still on the curve?? (If everything is correct, the 678| | point is always on its curve; then the function will return true. 679| | If somehow the state is corrupted, which suggests a fault attack 680| | (or internal computational error), then return false. 681| | */ 682| 140| if(is_zero()) { ------------------ | Branch (682:7): [True: 0, False: 140] ------------------ 683| 0| return true; 684| 0| } 685| | 686| 140| const auto& group = m_curve.group(); 687| 140| secure_vector monty_ws; 688| | 689| 140| const BigInt y2 = from_rep_to_tmp(group, fe_sqr(group, m_y, monty_ws), monty_ws); 690| 140| const BigInt x3 = fe_mul(group, m_x, fe_sqr(group, m_x, monty_ws), monty_ws); 691| 140| const BigInt ax = fe_mul(group, m_x, group.monty_a(), monty_ws); 692| 140| const BigInt z2 = fe_sqr(group, m_z, monty_ws); 693| | 694| 140| const BigInt& monty_b = group.monty_b(); 695| | 696| | // Is z equal to 1 (in Montgomery form)? 697| 140| if(m_z == z2) { ------------------ | Branch (697:7): [True: 140, False: 0] ------------------ 698| 140| if(y2 != from_rep_to_tmp(group, x3 + ax + monty_b, monty_ws)) { ------------------ | Branch (698:10): [True: 0, False: 140] ------------------ 699| 0| return false; 700| 0| } 701| 140| } 702| | 703| 140| const BigInt z3 = fe_mul(group, m_z, z2, monty_ws); 704| 140| const BigInt ax_z4 = fe_mul(group, ax, fe_sqr(group, z2, monty_ws), monty_ws); 705| 140| const BigInt b_z6 = fe_mul(group, monty_b, fe_sqr(group, z3, monty_ws), monty_ws); 706| | 707| 140| if(y2 != from_rep_to_tmp(group, x3 + ax_z4 + b_z6, monty_ws)) { ------------------ | Branch (707:7): [True: 0, False: 140] ------------------ 708| 0| return false; 709| 0| } 710| | 711| 140| return true; 712| 140|} _ZN5Botan8EC_Point4swapERS0_: 792| 3.93k|void EC_Point::swap(EC_Point& other) noexcept { 793| 3.93k| m_curve.swap(other.m_curve); 794| 3.93k| m_x.swap(other.m_x); 795| 3.93k| m_y.swap(other.m_y); 796| 3.93k| m_z.swap(other.m_z); 797| 3.93k|} _ZN5Botan6OS2ECPENSt3__14spanIKhLm18446744073709551615EEERKNS_8CurveGFpE: 866| 218|EC_Point OS2ECP(std::span data, const CurveGFp& curve) { 867| 218| return OS2ECP(data.data(), data.size(), curve); 868| 218|} _ZN5Botan6OS2ECPEPKhmRKNS_8CurveGFpE: 870| 218|EC_Point OS2ECP(const uint8_t data[], size_t data_len, const CurveGFp& curve) { 871| 218| if(data_len == 1 && data[0] == 0) { ------------------ | Branch (871:7): [True: 0, False: 218] | Branch (871:24): [True: 0, False: 0] ------------------ 872| | // SEC1 standard representation of the point at infinity 873| 0| return EC_Point(curve); 874| 0| } 875| | 876| 218| const auto [g_x, g_y] = OS2ECP(data, data_len, curve.get_p(), curve.get_a(), curve.get_b()); 877| | 878| 218| EC_Point point(curve, g_x, g_y); 879| | 880| 218| if(!point.on_the_curve()) { ------------------ | Branch (880:7): [True: 0, False: 218] ------------------ 881| 0| throw Decoding_Error("OS2ECP: Decoded point was not on the curve"); 882| 0| } 883| | 884| 218| return point; 885| 218|} _ZN5Botan6OS2ECPEPKhmRKNS_6BigIntES4_S4_: 887| 218|std::pair OS2ECP(const uint8_t pt[], size_t pt_len, const BigInt& p, const BigInt& a, const BigInt& b) { 888| 218| if(pt_len <= 1) { ------------------ | Branch (888:7): [True: 0, False: 218] ------------------ 889| 0| throw Decoding_Error("OS2ECP invalid point encoding"); 890| 0| } 891| | 892| 218| const uint8_t pc = pt[0]; 893| 218| const size_t p_bytes = p.bytes(); 894| | 895| 218| BigInt x; 896| 218| BigInt y; 897| | 898| 218| if(pc == 2 || pc == 3) { ------------------ | Branch (898:7): [True: 3, False: 215] | Branch (898:18): [True: 215, False: 0] ------------------ 899| 218| if(pt_len != 1 + p_bytes) { ------------------ | Branch (899:10): [True: 0, False: 218] ------------------ 900| 0| throw Decoding_Error("OS2ECP invalid point encoding"); 901| 0| } 902| 218| x = BigInt::decode(&pt[1], pt_len - 1); 903| | 904| 218| const bool y_mod_2 = ((pc & 0x01) == 1); 905| 218| y = decompress_point(y_mod_2, x, p, a, b); 906| 218| } else if(pc == 4) { ------------------ | Branch (906:14): [True: 0, False: 0] ------------------ 907| 0| if(pt_len != 1 + 2 * p_bytes) { ------------------ | Branch (907:10): [True: 0, False: 0] ------------------ 908| 0| throw Decoding_Error("OS2ECP invalid point encoding"); 909| 0| } 910| | 911| 0| x = BigInt::decode(&pt[1], p_bytes); 912| 0| y = BigInt::decode(&pt[p_bytes + 1], p_bytes); 913| 0| } else if(pc == 6 || pc == 7) { ------------------ | Branch (913:14): [True: 0, False: 0] | Branch (913:25): [True: 0, False: 0] ------------------ 914| 0| if(pt_len != 1 + 2 * p_bytes) { ------------------ | Branch (914:10): [True: 0, False: 0] ------------------ 915| 0| throw Decoding_Error("OS2ECP invalid point encoding"); 916| 0| } 917| | 918| 0| x = BigInt::decode(&pt[1], p_bytes); 919| 0| y = BigInt::decode(&pt[p_bytes + 1], p_bytes); 920| | 921| 0| const bool y_mod_2 = ((pc & 0x01) == 1); 922| | 923| 0| if(decompress_point(y_mod_2, x, p, a, b) != y) { ------------------ | Branch (923:10): [True: 0, False: 0] ------------------ 924| 0| throw Decoding_Error("OS2ECP: Decoding error in hybrid format"); 925| 0| } 926| 0| } else { 927| 0| throw Decoding_Error("OS2ECP: Unknown format type " + std::to_string(static_cast(pc))); 928| 0| } 929| | 930| 218| if(x >= p || y >= p) { ------------------ | Branch (930:7): [True: 78, False: 140] | Branch (930:17): [True: 0, False: 140] ------------------ 931| 1| throw Decoding_Error("OS2ECP invalid point encoding"); 932| 1| } 933| | 934| 217| return std::make_pair(x, y); 935| 218|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_113monty_ws_sizeERKNS_13EC_Group_DataE: 102| 4.01k|size_t monty_ws_size(const EC_Group_Data& group) { 103| 4.01k| return 2 * group.p_words(); 104| 4.01k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16to_repERKNS_13EC_Group_DataERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 55| 3.03k|void to_rep(const EC_Group_Data& group, BigInt& x, secure_vector& ws) { 56| 3.03k| group.monty().mul_by(x, group.monty().R2(), ws); 57| 3.03k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16fe_sqrERKNS_13EC_Group_DataERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 94| 840|BigInt fe_sqr(const EC_Group_Data& group, const BigInt& x, secure_vector& ws) { 95| 840| return group.monty().sqr(x, ws); 96| 840|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16fe_mulERKNS_13EC_Group_DataERKNS_6BigIntES6_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 82| 8.59k|inline BigInt fe_mul(const EC_Group_Data& group, const BigInt& x, const BigInt& y, secure_vector& ws) { 83| 8.59k| return group.monty().mul(x, y, ws); 84| 8.59k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_19resize_wsERNSt3__16vectorINS_6BigIntENS1_9allocatorIS3_EEEEm: 163| 2.49k|inline void resize_ws(std::vector& ws_bn, size_t cap_size) { 164| 2.49k| BOTAN_ASSERT(ws_bn.size() >= EC_Point::WORKSPACE_SIZE, "Expected size for EC_Point workspace"); ------------------ | | 71| 2.49k| do { \ | | 72| 2.49k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 2.49k| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 2.49k] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 2.49k| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 2.49k] | | ------------------ ------------------ 165| | 166| 19.9k| for(auto& ws : ws_bn) { ------------------ | Branch (166:17): [True: 19.9k, False: 2.49k] ------------------ 167| 19.9k| if(ws.size() < cap_size) { ------------------ | Branch (167:10): [True: 32, False: 19.9k] ------------------ 168| 32| ws.get_word_vector().resize(cap_size); 169| 32| } 170| 19.9k| } 171| 2.49k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16fe_sqrERKNS_13EC_Group_DataERNS_6BigIntERKS4_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 86| 11.0k|void fe_sqr(const EC_Group_Data& group, BigInt& z, const BigInt& x, secure_vector& ws) { 87| 11.0k| group.monty().sqr(z, x, ws); 88| 11.0k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16fe_mulERKNS_13EC_Group_DataERNS_6BigIntEPKmmRKS4_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 72| 5.69k| const EC_Group_Data& group, BigInt& z, const word x_w[], size_t x_size, const BigInt& y, secure_vector& ws) { 73| 5.69k| group.monty().mul(z, y, std::span{x_w, x_size}, ws); 74| 5.69k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16fe_mulERKNS_13EC_Group_DataERNS_6BigIntERKS4_S7_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 67| 22.5k|inline void fe_mul(const EC_Group_Data& group, BigInt& z, const BigInt& x, const BigInt& y, secure_vector& ws) { 68| 22.5k| group.monty().mul(z, x, y, ws); 69| 22.5k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16fe_sqrERKNS_13EC_Group_DataERNS_6BigIntEPKmmRNSt3__16vectorImNS_16secure_allocatorImEEEE: 90| 1.42k|void fe_sqr(const EC_Group_Data& group, BigInt& z, const word x_w[], size_t x_size, secure_vector& ws) { 91| 1.42k| group.monty().sqr(z, std::span{x_w, x_size}, ws); 92| 1.42k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_114invert_elementERKNS_13EC_Group_DataERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 98| 144|BigInt invert_element(const EC_Group_Data& group, const BigInt& x, secure_vector& ws) { 99| 144| return group.monty().mul(inverse_mod_public_prime(x, group.p()), group.monty().R3(), ws); 100| 144|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_115from_rep_to_tmpERKNS_13EC_Group_DataERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 63| 700|BigInt from_rep_to_tmp(const EC_Group_Data& group, const BigInt& x, secure_vector& ws) { 64| 700| return group.monty().redc(x, ws); 65| 700|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_116decompress_pointEbRKNS_6BigIntES3_S3_S3_: 848| 218|BigInt decompress_point(bool y_mod_2, const BigInt& x, const BigInt& p, const BigInt& a, const BigInt& b) { 849| 218| const BigInt g = ((x * x + a) * x + b) % p; 850| | 851| 218| BigInt z = sqrt_modulo_prime(g, p); 852| | 853| 218| if(z < 0) { ------------------ | Branch (853:7): [True: 77, False: 141] ------------------ 854| 77| throw Decoding_Error("Error during EC point decompression"); 855| 77| } 856| | 857| 141| if(z.get_bit(0) != y_mod_2) { ------------------ | Branch (857:7): [True: 83, False: 58] ------------------ 858| 83| z = p - z; 859| 83| } 860| | 861| 141| return z; 862| 218|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_17fe_smulILm4EEEvRNS_6BigIntERKS2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 77| 1.06k|inline void fe_smul(BigInt& z, const BigInt& p, secure_vector& ws) { 78| 1.06k| static_assert(M == 2 || M == 3 || M == 4 || M == 8); 79| 1.06k| z.mod_mul(M, p, ws); 80| 1.06k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_17fe_smulILm3EEEvRNS_6BigIntERKS2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 77| 1.06k|inline void fe_smul(BigInt& z, const BigInt& p, secure_vector& ws) { 78| 1.06k| static_assert(M == 2 || M == 3 || M == 4 || M == 8); 79| 1.06k| z.mod_mul(M, p, ws); 80| 1.06k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_17fe_smulILm8EEEvRNS_6BigIntERKS2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 77| 1.06k|inline void fe_smul(BigInt& z, const BigInt& p, secure_vector& ws) { 78| 1.06k| static_assert(M == 2 || M == 3 || M == 4 || M == 8); 79| 1.06k| z.mod_mul(M, p, ws); 80| 1.06k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_17fe_smulILm2EEEvRNS_6BigIntERKS2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 77| 1.06k|inline void fe_smul(BigInt& z, const BigInt& p, secure_vector& ws) { 78| 1.06k| static_assert(M == 2 || M == 3 || M == 4 || M == 8); 79| 1.06k| z.mod_mul(M, p, ws); 80| 1.06k|} _ZN5Botan30EC_Point_Base_Point_PrecomputeC2ERKNS_8EC_PointERKNS_17Barrett_ReductionE: 43| 4| m_base_point(base), m_mod_order(mod_order), m_p_words(base.get_curve().get_p_words()) { 44| 4| std::vector ws(EC_Point::WORKSPACE_SIZE); 45| | 46| 4| const size_t order_bits = mod_order.modulus_bits(); 47| | 48| 4| const size_t T_bits = ceil_division(order_bits + blinding_size(order_bits), WindowBits); 49| | 50| 4| std::vector T(WindowSize * T_bits); 51| | 52| 4| EC_Point g = base; 53| 4| EC_Point g2; 54| 4| EC_Point g4; 55| | 56| 360| for(size_t i = 0; i != T_bits; i++) { ------------------ | Branch (56:22): [True: 356, False: 4] ------------------ 57| 356| g2 = g; 58| 356| g2.mult2(ws); 59| 356| g4 = g2; 60| 356| g4.mult2(ws); 61| | 62| 356| T[7 * i + 0] = g; 63| 356| T[7 * i + 1] = std::move(g2); 64| 356| T[7 * i + 2] = T[7 * i + 1].plus(T[7 * i + 0], ws); // g2+g 65| 356| T[7 * i + 3] = g4; 66| 356| T[7 * i + 4] = T[7 * i + 3].plus(T[7 * i + 0], ws); // g4+g 67| 356| T[7 * i + 5] = T[7 * i + 3].plus(T[7 * i + 1], ws); // g4+g2 68| 356| T[7 * i + 6] = T[7 * i + 3].plus(T[7 * i + 2], ws); // g4+g2+g 69| | 70| 356| g.swap(g4); 71| 356| g.mult2(ws); 72| 356| } 73| | 74| 4| EC_Point::force_all_affine(T, ws[0].get_word_vector()); 75| | 76| 4| m_W.resize(T.size() * 2 * m_p_words); 77| | 78| 4| word* p = m_W.data(); 79| 2.49k| for(const auto& pt : T) { ------------------ | Branch (79:23): [True: 2.49k, False: 4] ------------------ 80| 2.49k| pt.get_x().encode_words(p, m_p_words); 81| 2.49k| p += m_p_words; 82| 2.49k| pt.get_y().encode_words(p, m_p_words); 83| 2.49k| p += m_p_words; 84| 2.49k| } 85| 4|} point_mul.cpp:_ZN5Botan12_GLOBAL__N_113blinding_sizeEm: 20| 4|size_t blinding_size(size_t order_bits) { 21| 4| return (order_bits + 1) / 2; 22| 4|} _ZN5Botan17EC_PublicKey_DataC2ERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 38| 1.55k| EC_PublicKey_Data(group, decode_ec_public_key_point(group, bytes)) {} _ZN5Botan17EC_PublicKey_DataC2ENS_8EC_GroupENS_14EC_AffinePointE: 41| 1.20k| m_group(std::move(group)), m_point(std::move(pt)) { 42| | // Checking that the point lies on the curve is done in the deserialization 43| | // of EC_AffinePoint. 44| 1.20k| if(m_point.is_identity()) { ------------------ | Branch (44:7): [True: 0, False: 1.20k] ------------------ 45| 0| throw Decoding_Error("ECC public key cannot be point at infinity"); 46| 0| } 47| | 48| 1.20k| if(m_point._group() != m_group._data()) { ------------------ | Branch (48:7): [True: 0, False: 1.20k] ------------------ 49| 0| if(m_point.group() != m_group) { ------------------ | Branch (49:10): [True: 0, False: 0] ------------------ 50| 0| throw Decoding_Error("ECC public key point is not an element of the specified group"); 51| 0| } 52| | 53| | // Same curve but a distinct EC_Group_Data (eg an unregistered explicit 54| | // group decoded twice); point arithmetic requires a shared representation 55| 0| if(auto rebound = EC_AffinePoint::deserialize_uncompressed(m_group, m_point.serialize_uncompressed())) { ------------------ | Branch (55:15): [True: 0, False: 0] ------------------ 56| 0| m_point = std::move(rebound).value(); 57| 0| } else { 58| 0| throw Decoding_Error("ECC public key point is not an element of the specified group"); 59| 0| } 60| 0| } 61| | 62| 1.20k|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 63| 1.20k| m_legacy_point = m_point.to_legacy_point(); 64| 1.20k|#endif 65| 1.20k|} ec_key_data.cpp:_ZN5Botan12_GLOBAL__N_126decode_ec_public_key_pointERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 17| 1.55k|EC_AffinePoint decode_ec_public_key_point(const EC_Group& group, std::span bytes) { 18| | /* 19| | * RFC 5480 section 2.2: 20| | * The first octet of the OCTET STRING indicates whether the key is 21| | * compressed or uncompressed. The uncompressed form is indicated 22| | * by 0x04 and the compressed form is indicated by either 0x02 or 23| | * 0x03 (see 2.3.3 in [SEC1]). The public key MUST be rejected if 24| | * any other value is included in the first octet. 25| | */ 26| 1.55k| if(auto pt_uncompressed = EC_AffinePoint::deserialize_uncompressed(group, bytes)) { ------------------ | Branch (26:12): [True: 928, False: 627] ------------------ 27| 928| return std::move(pt_uncompressed).value(); 28| 928| } else if(auto pt_compressed = EC_AffinePoint::deserialize_compressed(group, bytes)) { ------------------ | Branch (28:19): [True: 275, False: 352] ------------------ 29| 275| return std::move(pt_compressed).value(); 30| 352| } else { 31| 352| throw Decoding_Error("Failed to deserialize elliptic curve point"); 32| 352| } 33| 1.55k|} _ZNK5Botan12EC_PublicKey10key_lengthEv: 28| 1.20k|size_t EC_PublicKey::key_length() const { 29| 1.20k| return domain().get_p_bits(); 30| 1.20k|} _ZNK5Botan12EC_PublicKey18estimated_strengthEv: 32| 1.20k|size_t EC_PublicKey::estimated_strength() const { 33| 1.20k| return ecp_work_factor(key_length()); 34| 1.20k|} _ZN5Botan12EC_PublicKey27assert_algorithm_identifierERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE: 49| 1.28k| std::string_view alg_name) { 50| 1.28k| if(alg_id.oid() != OID::from_string(alg_name)) { ------------------ | Branch (50:7): [True: 7, False: 1.27k] ------------------ 51| 7| throw Decoding_Error( 52| 7| fmt("Unexpected AlgorithmIdentifier OID {} in association with {} key", alg_id.oid(), alg_name)); 53| 7| } 54| | 55| 1.27k| return alg_id; // NOLINT(*-return-const-ref-from-parameter) 56| 1.28k|} _ZN5Botan12EC_PublicKeyC2ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 71| 1.27k|EC_PublicKey::EC_PublicKey(const AlgorithmIdentifier& alg_id, std::span key_bits) { 72| 1.27k| m_public_key = std::make_shared(EC_Group(alg_id.parameters()), key_bits); 73| 1.27k| m_domain_encoding = default_encoding_for(domain()); // NOLINT(*-prefer-member-initializer) 74| 1.27k|} _ZNK5Botan12EC_PublicKey6domainEv: 76| 4.65k|const EC_Group& EC_PublicKey::domain() const { 77| 4.65k| BOTAN_STATE_CHECK(m_public_key != nullptr); ------------------ | | 51| 4.65k| do { \ | | 52| 4.65k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 4.65k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 4.65k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 4.65k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 4.65k] | | ------------------ ------------------ 78| 4.65k| return m_public_key->group(); 79| 4.65k|} _ZNK5Botan12EC_PublicKey16_public_ec_pointEv: 88| 928|const EC_AffinePoint& EC_PublicKey::_public_ec_point() const { 89| 928| BOTAN_STATE_CHECK(m_public_key != nullptr); ------------------ | | 51| 928| do { \ | | 52| 928| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 928| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 928] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 928| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 928] | | ------------------ ------------------ 90| 928| return m_public_key->public_key(); 91| 928|} ecc_key.cpp:_ZN5Botan12_GLOBAL__N_120default_encoding_forERKNS_8EC_GroupE: 38| 937|EC_Group_Encoding default_encoding_for(const EC_Group& group) { 39| 937| if(group.get_curve_oid().empty()) { ------------------ | Branch (39:7): [True: 0, False: 937] ------------------ 40| 0| return EC_Group_Encoding::Explicit; 41| 937| } else { 42| 937| return EC_Group_Encoding::NamedCurve; 43| 937| } 44| 937|} _ZNK5Botan15ECDSA_PublicKey40_signature_element_size_for_DER_encodingEv: 82| 1.32k|std::optional ECDSA_PublicKey::_signature_element_size_for_DER_encoding() const { 83| 1.32k| return domain().get_order_bytes(); 84| 1.32k|} _ZNK5Botan15ECDSA_PublicKey27create_x509_verification_opERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE: 281| 937| const AlgorithmIdentifier& signature_algorithm, std::string_view provider) const { 282| 937| if(provider == "base" || provider.empty()) { ------------------ | Branch (282:7): [True: 0, False: 937] | Branch (282:29): [True: 937, False: 0] ------------------ 283| 937| return std::make_unique(*this, signature_algorithm); 284| 937| } 285| | 286| 0| throw Provider_Not_Found(algo_name(), provider); 287| 937|} ecdsa.cpp:_ZN5Botan12_GLOBAL__N_128ECDSA_Verification_Operation6verifyENSt3__14spanIKhLm18446744073709551615EEES5_: 254| 662|bool ECDSA_Verification_Operation::verify(std::span msg, std::span sig) { 255| 662| if(auto rs = EC_Scalar::deserialize_pair(m_group, sig)) { ------------------ | Branch (255:12): [True: 655, False: 7] ------------------ 256| 655| const auto& [r, s] = rs.value(); 257| | 258| 655| if(r.is_nonzero() && s.is_nonzero()) { ------------------ | Branch (258:10): [True: 655, False: 0] | Branch (258:28): [True: 655, False: 0] ------------------ 259| 655| const auto m = EC_Scalar::from_bytes_with_trunc(m_group, msg); 260| | 261| 655| const auto w = s.invert_vartime(); 262| | 263| | // Check if r == x_coord(g*w*m + y*w*r) % n 264| 655| return m_gy_mul.mul2_vartime_x_mod_order_eq(r, w, m, r); 265| 655| } 266| 655| } 267| | 268| 7| return false; 269| 662|} ecdsa.cpp:_ZN5Botan12_GLOBAL__N_128ECDSA_Verification_OperationC2ERKNS_15ECDSA_PublicKeyERKNS_19AlgorithmIdentifierE: 243| 937| PK_Ops::Verification_with_Hash(alg_id, "ECDSA", true), 244| 937| m_group(ecdsa.domain()), 245| 937| m_gy_mul(ecdsa._public_ec_point()) {} _ZNK5Botan19GOST_3410_PublicKey40_signature_element_size_for_DER_encodingEv: 112| 266|std::optional GOST_3410_PublicKey::_signature_element_size_for_DER_encoding() const { 113| 266| return domain().get_order_bytes(); 114| 266|} _ZN5Botan19GOST_3410_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 153| 387|GOST_3410_PublicKey::GOST_3410_PublicKey(const AlgorithmIdentifier& alg_id, std::span key_bits) { 154| 387| assert_gost_algorithm_identifier(alg_id); 155| | 156| 387| const OID ecc_param_id = decode_gost_key_parameters(alg_id); 157| | 158| 387| const auto group = check_domain(EC_Group::from_OID(ecc_param_id)); 159| 387| check_gost_key_oid_matches_group(alg_id.oid(), group); 160| | 161| 387| std::vector bits; 162| 387| BER_Decoder(key_bits, BER_Decoder::Limits::DER()).decode(bits, ASN1_Type::OctetString).verify_end(); 163| | 164| 387| if(bits.size() != 2 * (group.get_p_bits() / 8)) { ------------------ | Branch (164:7): [True: 1, False: 386] ------------------ 165| 1| throw Decoding_Error("GOST-34.10-2012 invalid encoding of public key"); 166| 1| } 167| | 168| 386| const size_t part_size = bits.size() / 2; 169| | 170| | // Keys are stored in little endian format (WTF) 171| 386| std::vector encoding; 172| 386| encoding.reserve(bits.size() + 1); 173| 386| encoding.push_back(0x04); 174| 386| encoding.insert(encoding.end(), bits.rbegin() + part_size, bits.rend()); 175| 386| encoding.insert(encoding.end(), bits.rbegin(), bits.rend() - part_size); 176| | 177| 386| m_public_key = std::make_shared(group, encoding); 178| 386|} _ZNK5Botan19GOST_3410_PublicKey27create_x509_verification_opERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE: 338| 266| const AlgorithmIdentifier& signature_algorithm, std::string_view provider) const { 339| 266| if(provider == "base" || provider.empty()) { ------------------ | Branch (339:7): [True: 0, False: 266] | Branch (339:29): [True: 266, False: 0] ------------------ 340| 266| return std::make_unique(*this, signature_algorithm); 341| 266| } 342| | 343| 0| throw Provider_Not_Found(algo_name(), provider); 344| 266|} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_132assert_gost_algorithm_identifierERKNS_19AlgorithmIdentifierE: 37| 387|const AlgorithmIdentifier& assert_gost_algorithm_identifier(const AlgorithmIdentifier& alg_id) { 38| 387| if(!is_gost_3410_key_oid(alg_id.oid())) { ------------------ | Branch (38:7): [True: 3, False: 384] ------------------ 39| 3| throw Decoding_Error( 40| 3| fmt("Unexpected AlgorithmIdentifier OID {} in association with GOST 34.10 key", alg_id.oid())); 41| 3| } 42| | 43| 384| return alg_id; // NOLINT(*-return-const-ref-from-parameter) 44| 387|} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_120is_gost_3410_key_oidERKNS_3OIDE: 32| 387|bool is_gost_3410_key_oid(const OID& oid) { 33| 387| return oid == OID::from_string("GOST-34.10") || oid == OID::from_string("GOST-34.10-2012-256") || ------------------ | Branch (33:11): [True: 1, False: 386] | Branch (33:52): [True: 373, False: 13] ------------------ 34| 13| oid == OID::from_string("GOST-34.10-2012-512"); ------------------ | Branch (34:11): [True: 10, False: 3] ------------------ 35| 387|} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_126decode_gost_key_parametersERKNS_19AlgorithmIdentifierE: 46| 384|OID decode_gost_key_parameters(const AlgorithmIdentifier& alg_id) { 47| 384| OID ecc_param_id; 48| | 49| 384| auto outer = BER_Decoder(alg_id.parameters(), BER_Decoder::Limits::DER()); 50| 384| auto params = outer.start_sequence(); 51| 384| params.decode(ecc_param_id); 52| | 53| 384| if(params.more_items()) { ------------------ | Branch (53:7): [True: 331, False: 53] ------------------ 54| 331| OID digest_param_id; 55| 331| params.decode(digest_param_id); 56| | 57| 331| if(alg_id.oid() == OID::from_string("GOST-34.10-2012-256") && ------------------ | Branch (57:10): [True: 325, False: 6] | Branch (57:10): [True: 6, False: 325] ------------------ 58| 325| digest_param_id != OID::from_string("Streebog-256")) { ------------------ | Branch (58:10): [True: 6, False: 319] ------------------ 59| 6| throw Decoding_Error("Unexpected digest parameters for GOST-34.10-2012-256 public key"); 60| 6| } 61| | 62| 325| if(alg_id.oid() == OID::from_string("GOST-34.10-2012-512") && ------------------ | Branch (62:10): [True: 4, False: 321] | Branch (62:10): [True: 3, False: 322] ------------------ 63| 4| digest_param_id != OID::from_string("Streebog-512")) { ------------------ | Branch (63:10): [True: 3, False: 1] ------------------ 64| 3| throw Decoding_Error("Unexpected digest parameters for GOST-34.10-2012-512 public key"); 65| 3| } 66| 325| } 67| | 68| 375| if(params.more_items()) { ------------------ | Branch (68:7): [True: 0, False: 375] ------------------ 69| 0| if(alg_id.oid() != OID::from_string("GOST-34.10")) { ------------------ | Branch (69:10): [True: 0, False: 0] ------------------ 70| 0| throw Decoding_Error("Unexpected extra parameters for GOST-34.10-2012 public key"); 71| 0| } 72| | 73| 0| OID encryption_param_id; 74| 0| params.decode(encryption_param_id); 75| 0| } 76| | 77| 375| params.verify_end(); 78| 375| outer.verify_end(); 79| | 80| 375| return ecc_param_id; 81| 375|} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_112check_domainENS_8EC_GroupE: 24| 316|EC_Group check_domain(EC_Group domain) { 25| 316| const size_t p_bits = domain.get_p_bits(); 26| 316| if(p_bits != 256 && p_bits != 512) { ------------------ | Branch (26:7): [True: 2, False: 314] | Branch (26:24): [True: 0, False: 2] ------------------ 27| 0| throw Decoding_Error(fmt("GOST-34.10-2012 is not defined for parameters of size {}", p_bits)); 28| 0| } 29| 316| return domain; 30| 316|} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_132check_gost_key_oid_matches_groupERKNS_3OIDERKNS_8EC_GroupE: 83| 316|void check_gost_key_oid_matches_group(const OID& key_oid, const EC_Group& group) { 84| 316| if(key_oid == OID::from_string("GOST-34.10-2012-256") && group.get_p_bits() != 256) { ------------------ | Branch (84:7): [True: 313, False: 3] | Branch (84:7): [True: 1, False: 315] | Branch (84:61): [True: 1, False: 312] ------------------ 85| 1| throw Decoding_Error("GOST-34.10-2012-256 public key has unexpected parameters"); 86| 1| } 87| | 88| 315| if(key_oid == OID::from_string("GOST-34.10-2012-512") && group.get_p_bits() != 512) { ------------------ | Branch (88:7): [True: 3, False: 312] | Branch (88:7): [True: 2, False: 313] | Branch (88:61): [True: 2, False: 1] ------------------ 89| 2| throw Decoding_Error("GOST-34.10-2012-512 public key has unexpected parameters"); 90| 2| } 91| 315|} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_132GOST_3410_Verification_Operation6verifyENSt3__14spanIKhLm18446744073709551615EEES5_: 307| 266|bool GOST_3410_Verification_Operation::verify(std::span msg, std::span sig) { 308| 266| if(auto sr = EC_Scalar::deserialize_pair(m_group, sig)) { ------------------ | Branch (308:12): [True: 261, False: 5] ------------------ 309| 261| const auto& [s, r] = sr.value(); 310| | 311| 261| if(r.is_nonzero() && s.is_nonzero()) { ------------------ | Branch (311:10): [True: 261, False: 0] | Branch (311:28): [True: 261, False: 0] ------------------ 312| 261| const auto e = gost_msg_to_scalar(m_group, msg); 313| | 314| 261| const auto v = e.invert_vartime(); 315| | 316| | // Check if r == x_coord(g*v*s - y*v*r) % n 317| 261| return m_gy_mul.mul2_vartime_x_mod_order_eq(r, v, s, r.negate()); 318| 261| } 319| 261| } 320| | 321| 5| return false; 322| 266|} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_118gost_msg_to_scalarERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 198| 261|EC_Scalar gost_msg_to_scalar(const EC_Group& group, std::span msg) { 199| 261| std::vector rev_bytes(msg.rbegin(), msg.rend()); 200| | 201| 261| auto ie = EC_Scalar::from_bytes_mod_order(group, rev_bytes); 202| 261| if(ie.is_zero()) { ------------------ | Branch (202:7): [True: 0, False: 261] ------------------ 203| 0| return EC_Scalar::one(group); 204| 261| } else { 205| 261| return ie; 206| 261| } 207| 261|} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_132GOST_3410_Verification_OperationC2ERKNS_19GOST_3410_PublicKeyERKNS_19AlgorithmIdentifierE: 296| 266| PK_Ops::Verification_with_Hash(PK_Options_Reader_Access::for_verification(gost_hash_from_algid(alg_id))), 297| 266| m_group(gost.domain()), 298| 266| m_gy_mul(gost._public_ec_point()) {} gost_3410.cpp:_ZN5Botan12_GLOBAL__N_120gost_hash_from_algidERKNS_19AlgorithmIdentifierE: 265| 266|PK_Signature_Options gost_hash_from_algid(const AlgorithmIdentifier& alg_id) { 266| 266| if(!alg_id.parameters_are_empty()) { ------------------ | Branch (266:7): [True: 0, False: 266] ------------------ 267| 0| throw Decoding_Error("Unexpected non-empty AlgorithmIdentifier parameters for GOST 34.10 signature"); 268| 0| } 269| | 270| 266| if(const auto name = alg_id.oid().registered_name()) { ------------------ | Branch (270:18): [True: 266, False: 0] ------------------ 271| 266| if(*name == "GOST-34.10/GOST-R-34.11-94") { ------------------ | Branch (271:10): [True: 0, False: 266] ------------------ 272| 0| return PK_Signature_Options().with_hash("GOST-R-34.11-94"); 273| 266| } else if(*name == "GOST-34.10-2012-256/Streebog-256") { ------------------ | Branch (273:17): [True: 266, False: 0] ------------------ 274| 266| return PK_Signature_Options().with_hash("Streebog-256"); 275| 266| } else if(*name == "GOST-34.10-2012-512/Streebog-512") { ------------------ | Branch (275:17): [True: 0, False: 0] ------------------ 276| 0| return PK_Signature_Options().with_hash("Streebog-512"); 277| 0| } else if(*name == "GOST-34.10-2012-256/SHA-256") { ------------------ | Branch (277:17): [True: 0, False: 0] ------------------ 278| 0| return PK_Signature_Options().with_hash("SHA-256"); 279| 0| } else { 280| 0| throw Decoding_Error(fmt("Unknown OID ({}, {}) for GOST 34.10 signatures", alg_id.oid(), *name)); 281| 0| } 282| 266| } else { 283| 0| throw Decoding_Error(fmt("Unknown OID ({}) for GOST 34.10 signatures", alg_id.oid())); 284| 0| } 285| 266|} _ZN5Botan9KyberModeC2ERKNS_3OIDE: 87| 3|KyberMode::KyberMode(const OID& oid) : m_mode(kyber_mode_from_oid(oid)) {} _ZNK5Botan9KyberMode9is_ml_kemEv: 128| 3|bool KyberMode::is_ml_kem() const { 129| 3| return m_mode == KyberMode::ML_KEM_512 || m_mode == KyberMode::ML_KEM_768 || m_mode == KyberMode::ML_KEM_1024; ------------------ | Branch (129:11): [True: 1, False: 2] | Branch (129:46): [True: 1, False: 1] | Branch (129:81): [True: 1, False: 0] ------------------ 130| 3|} _ZNK5Botan9KyberMode15is_kyber_round3Ev: 132| 6|bool KyberMode::is_kyber_round3() const { 133| 6| return m_mode == KyberMode::Kyber512_R3 || m_mode == KyberMode::Kyber768_R3 || m_mode == KyberMode::Kyber1024_R3 || ------------------ | Branch (133:11): [True: 0, False: 6] | Branch (133:47): [True: 0, False: 6] | Branch (133:83): [True: 0, False: 6] ------------------ 134| 6| m_mode == KyberMode::Kyber512_90s || m_mode == KyberMode::Kyber768_90s || m_mode == KyberMode::Kyber1024_90s; ------------------ | Branch (134:11): [True: 0, False: 6] | Branch (134:48): [True: 0, False: 6] | Branch (134:85): [True: 0, False: 6] ------------------ 135| 6|} _ZN5Botan15Kyber_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 184| 3| Kyber_PublicKey(key_bits, KyberMode(alg_id.oid())) { 185| | // The parameter set is identified by the OID; no parameters are defined. 186| 3| if(!alg_id.parameters_are_empty()) { ------------------ | Branch (186:7): [True: 0, False: 3] ------------------ 187| 0| throw Decoding_Error("Unexpected parameters for ML-KEM/Kyber public key"); 188| 0| } 189| 3|} _ZN5Botan15Kyber_PublicKeyC1ENSt3__14spanIKhLm18446744073709551615EEENS_9KyberModeE: 191| 3|Kyber_PublicKey::Kyber_PublicKey(std::span pub_key, KyberMode mode) { 192| 3| m_public = std::make_shared(mode, KyberSerializedPublicKey(pub_key)); 193| 3|} kyber.cpp:_ZN5Botan12_GLOBAL__N_119kyber_mode_from_oidERKNS_3OIDE: 75| 3|KyberMode::Mode kyber_mode_from_oid(const OID& oid) { 76| 3| if(const auto name = oid.registered_name()) { ------------------ | Branch (76:18): [True: 3, False: 0] ------------------ 77| 3| return kyber_mode_from_string(*name); 78| 3| } 79| | 80| 0| throw Invalid_Argument(fmt("OID '{}' is not registered as a Kyber/ML-KEM mode", oid)); 81| 3|} kyber.cpp:_ZN5Botan12_GLOBAL__N_122kyber_mode_from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 43| 3|KyberMode::Mode kyber_mode_from_string(std::string_view str) { 44| 3| if(str == "Kyber-512-90s-r3") { ------------------ | Branch (44:7): [True: 0, False: 3] ------------------ 45| 0| return KyberMode::Kyber512_90s; 46| 0| } 47| 3| if(str == "Kyber-768-90s-r3") { ------------------ | Branch (47:7): [True: 0, False: 3] ------------------ 48| 0| return KyberMode::Kyber768_90s; 49| 0| } 50| 3| if(str == "Kyber-1024-90s-r3") { ------------------ | Branch (50:7): [True: 0, False: 3] ------------------ 51| 0| return KyberMode::Kyber1024_90s; 52| 0| } 53| 3| if(str == "Kyber-512-r3") { ------------------ | Branch (53:7): [True: 0, False: 3] ------------------ 54| 0| return KyberMode::Kyber512_R3; 55| 0| } 56| 3| if(str == "Kyber-768-r3") { ------------------ | Branch (56:7): [True: 0, False: 3] ------------------ 57| 0| return KyberMode::Kyber768_R3; 58| 0| } 59| 3| if(str == "Kyber-1024-r3") { ------------------ | Branch (59:7): [True: 0, False: 3] ------------------ 60| 0| return KyberMode::Kyber1024_R3; 61| 0| } 62| 3| if(str == "ML-KEM-512") { ------------------ | Branch (62:7): [True: 1, False: 2] ------------------ 63| 1| return KyberMode::ML_KEM_512; 64| 1| } 65| 2| if(str == "ML-KEM-768") { ------------------ | Branch (65:7): [True: 1, False: 1] ------------------ 66| 1| return KyberMode::ML_KEM_768; 67| 1| } 68| 1| if(str == "ML-KEM-1024") { ------------------ | Branch (68:7): [True: 1, False: 0] ------------------ 69| 1| return KyberMode::ML_KEM_1024; 70| 1| } 71| | 72| 0| throw Invalid_Argument(fmt("'{}' is not a valid Kyber mode name", str)); 73| 1|} _ZN5Botan14KyberConstantsC2ENS_9KyberModeE: 30| 3|KyberConstants::KyberConstants(KyberMode mode) : m_mode(mode) { 31| 3| switch(mode.mode()) { 32| 0| case KyberMode::Kyber512_R3: ------------------ | Branch (32:7): [True: 0, False: 3] ------------------ 33| 0| case KyberMode::Kyber512_90s: ------------------ | Branch (33:7): [True: 0, False: 3] ------------------ 34| 1| case KyberMode::ML_KEM_512: ------------------ | Branch (34:7): [True: 1, False: 2] ------------------ 35| 1| m_nist_strength = KyberStrength::_128; 36| 1| m_k = 2; 37| 1| m_eta1 = KyberEta::_3; 38| 1| m_du = KyberDu::_10; 39| 1| m_dv = KyberDv::_4; 40| 1| break; 41| | 42| 0| case KyberMode::Kyber768_R3: ------------------ | Branch (42:7): [True: 0, False: 3] ------------------ 43| 0| case KyberMode::Kyber768_90s: ------------------ | Branch (43:7): [True: 0, False: 3] ------------------ 44| 1| case KyberMode::ML_KEM_768: ------------------ | Branch (44:7): [True: 1, False: 2] ------------------ 45| 1| m_nist_strength = KyberStrength::_192; 46| 1| m_k = 3; 47| 1| m_eta1 = KyberEta::_2; 48| 1| m_du = KyberDu::_10; 49| 1| m_dv = KyberDv::_4; 50| 1| break; 51| | 52| 0| case KyberMode::Kyber1024_R3: ------------------ | Branch (52:7): [True: 0, False: 3] ------------------ 53| 0| case KyberMode::Kyber1024_90s: ------------------ | Branch (53:7): [True: 0, False: 3] ------------------ 54| 1| case KyberMode::ML_KEM_1024: ------------------ | Branch (54:7): [True: 1, False: 2] ------------------ 55| 1| m_nist_strength = KyberStrength::_256; 56| 1| m_k = 4; 57| 1| m_eta1 = KyberEta::_2; 58| 1| m_du = KyberDu::_11; 59| 1| m_dv = KyberDv::_5; 60| 1| break; 61| | 62| 0| default: ------------------ | Branch (62:7): [True: 0, False: 3] ------------------ 63| 0| BOTAN_ASSERT_UNREACHABLE(); ------------------ | | 173| 0|#define BOTAN_ASSERT_UNREACHABLE() Botan::assert_unreachable(__FILE__, __LINE__) ------------------ 64| 3| } 65| | 66| 3|#ifdef BOTAN_HAS_KYBER_90S 67| 3| if(mode.is_kyber_round3() && mode.is_90s()) { ------------------ | Branch (67:7): [True: 0, False: 3] | Branch (67:33): [True: 0, False: 0] ------------------ 68| 0| m_symmetric_primitives = std::make_unique(); 69| 0| } 70| 3|#endif 71| | 72| 3|#ifdef BOTAN_HAS_KYBER 73| 3| if(mode.is_kyber_round3() && mode.is_modern()) { ------------------ | Branch (73:7): [True: 0, False: 3] | Branch (73:33): [True: 0, False: 0] ------------------ 74| 0| m_symmetric_primitives = std::make_unique(); 75| 0| } 76| 3|#endif 77| | 78| 3|#ifdef BOTAN_HAS_ML_KEM 79| 3| if(mode.is_ml_kem()) { ------------------ | Branch (79:7): [True: 3, False: 0] ------------------ 80| 3| m_symmetric_primitives = std::make_unique(); 81| 3| } 82| 3|#endif 83| | 84| 3| static_assert(N % 8 == 0); 85| 3| m_polynomial_vector_bytes = (bitlen(Q) * (N / 8)) * k(); 86| 3| m_polynomial_vector_compressed_bytes = d_u() * k() * (N / 8); 87| 3| m_polynomial_compressed_bytes = d_v() * (N / 8); 88| 3| m_expanded_private_key_bytes = 89| 3| static_cast(m_polynomial_vector_bytes + public_key_bytes() + PUBLIC_KEY_HASH_BYTES + SEED_BYTES); 90| 3| m_seed_private_key_bytes = 2 * SEED_BYTES; 91| | 92| 3| if(!m_symmetric_primitives) { ------------------ | Branch (92:7): [True: 0, False: 3] ------------------ 93| 0| throw Not_Implemented("requested Kyber mode is not enabled in this build"); 94| 0| } 95| 3|} _ZN5Botan14KyberConstantsD2Ev: 97| 6|KyberConstants::~KyberConstants() = default; _ZN5Botan23Kyber_PublicKeyInternalC2ENS_14KyberConstantsENS_6StrongINSt3__16vectorIhNS3_9allocatorIhEEEENS_25KyberSerializedPublicKey_EJEEE: 106| 3| m_mode(std::move(mode)), 107| 3| m_public_key_bits_raw(validate_public_key_length(std::move(public_key), m_mode.public_key_bytes())), 108| 3| m_H_public_key_bits_raw(m_mode.symmetric_primitives().H(m_public_key_bits_raw)), 109| 3| m_t(Kyber_Algos::decode_polynomial_vector( 110| 3| std::span{m_public_key_bits_raw}.first(m_mode.polynomial_vector_bytes()), m_mode)), 111| 3| m_rho(std::span{m_public_key_bits_raw}.last(Botan::KyberConstants::SEED_BYTES)) {} kyber_keys.cpp:_ZN5Botan12_GLOBAL__N_126validate_public_key_lengthENS_6StrongINSt3__16vectorIhNS2_9allocatorIhEEEENS_25KyberSerializedPublicKey_EJEEEm: 22| 3|KyberSerializedPublicKey validate_public_key_length(KyberSerializedPublicKey public_key, size_t expected_length) { 23| 3| if(public_key.size() != expected_length) { ------------------ | Branch (23:7): [True: 3, False: 0] ------------------ 24| 3| throw Invalid_Argument("Public key does not have the correct byte count"); 25| 3| } 26| 0| return public_key; 27| 3|} _ZN5Botan8PEM_Code6decodeERNS_10DataSourceERNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEE: 64| 1.39k|secure_vector decode(DataSource& source, std::string& label) { 65| 1.39k| const size_t RANDOM_CHAR_LIMIT = 8; 66| | 67| 1.39k| label.clear(); 68| | 69| 1.39k| const std::string PEM_HEADER1 = "-----BEGIN "; 70| 1.39k| const std::string PEM_HEADER2 = "-----"; 71| 1.39k| size_t position = 0; 72| | 73| 54.8k| while(position != PEM_HEADER1.length()) { ------------------ | Branch (73:10): [True: 53.6k, False: 1.19k] ------------------ 74| 53.6k| auto b = source.read_byte(); 75| | 76| 53.6k| if(!b) { ------------------ | Branch (76:10): [True: 201, False: 53.4k] ------------------ 77| 201| throw Decoding_Error("PEM: No PEM header found"); 78| 201| } 79| 53.4k| if(static_cast(*b) == PEM_HEADER1[position]) { ------------------ | Branch (79:10): [True: 14.0k, False: 39.4k] ------------------ 80| 14.0k| ++position; 81| 39.4k| } else if(position >= RANDOM_CHAR_LIMIT) { ------------------ | Branch (81:17): [True: 1, False: 39.4k] ------------------ 82| 1| throw Decoding_Error("PEM: Malformed PEM header"); 83| 39.4k| } else { 84| 39.4k| position = 0; 85| 39.4k| } 86| 53.4k| } 87| 1.19k| position = 0; 88| 19.3k| while(position != PEM_HEADER2.length()) { ------------------ | Branch (88:10): [True: 18.2k, False: 1.15k] ------------------ 89| 18.2k| auto b = source.read_byte(); 90| | 91| 18.2k| if(!b) { ------------------ | Branch (91:10): [True: 38, False: 18.2k] ------------------ 92| 38| throw Decoding_Error("PEM: No PEM header found"); 93| 38| } 94| 18.2k| if(static_cast(*b) == PEM_HEADER2[position]) { ------------------ | Branch (94:10): [True: 5.77k, False: 12.4k] ------------------ 95| 5.77k| ++position; 96| 12.4k| } else if(position > 0) { ------------------ | Branch (96:17): [True: 3, False: 12.4k] ------------------ 97| 3| throw Decoding_Error("PEM: Malformed PEM header"); 98| 3| } 99| | 100| 18.2k| if(position == 0) { ------------------ | Branch (100:10): [True: 12.4k, False: 5.77k] ------------------ 101| 12.4k| if(label.size() >= 128) { ------------------ | Branch (101:13): [True: 1, False: 12.4k] ------------------ 102| 1| throw Decoding_Error("PEM: Label too long"); 103| 1| } 104| 12.4k| label += static_cast(*b); 105| 12.4k| } 106| 18.2k| } 107| | 108| 1.15k| std::vector b64; 109| | 110| 1.15k| const std::string PEM_TRAILER = fmt("-----END {}-----", label); 111| 1.15k| position = 0; 112| 829k| while(position != PEM_TRAILER.length()) { ------------------ | Branch (112:10): [True: 828k, False: 1.07k] ------------------ 113| 828k| auto b = source.read_byte(); 114| | 115| 828k| if(!b) { ------------------ | Branch (115:10): [True: 66, False: 828k] ------------------ 116| 66| throw Decoding_Error("PEM: No PEM trailer found"); 117| 66| } 118| 828k| if(static_cast(*b) == PEM_TRAILER[position]) { ------------------ | Branch (118:10): [True: 26.0k, False: 802k] ------------------ 119| 26.0k| ++position; 120| 802k| } else if(position > 0) { ------------------ | Branch (120:17): [True: 11, False: 802k] ------------------ 121| 11| throw Decoding_Error("PEM: Malformed PEM trailer"); 122| 11| } 123| | 124| 828k| if(position == 0) { ------------------ | Branch (124:10): [True: 802k, False: 26.0k] ------------------ 125| 802k| b64.push_back(*b); 126| 802k| } 127| 828k| } 128| | 129| 1.07k| return base64_decode(b64.data(), b64.size()); 130| 1.15k|} _ZN5Botan8PEM_Code7matchesERNS_10DataSourceENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEm: 146| 15.3k|bool matches(DataSource& source, std::string_view extra, size_t search_range) { 147| 15.3k| const std::string PEM_HEADER = fmt("-----BEGIN {}", extra); 148| | 149| 15.3k| std::array stack_buf{}; 150| 15.3k| std::vector heap_buf; 151| 15.3k| uint8_t* search_buf = stack_buf.data(); 152| 15.3k| if(search_range > stack_buf.size()) { ------------------ | Branch (152:7): [True: 0, False: 15.3k] ------------------ 153| 0| heap_buf.resize(search_range); 154| 0| search_buf = heap_buf.data(); 155| 0| } 156| | 157| 15.3k| const size_t got = source.peek(search_buf, search_range, 0); 158| | 159| 15.3k| if(got < PEM_HEADER.length()) { ------------------ | Branch (159:7): [True: 454, False: 14.9k] ------------------ 160| 454| return false; 161| 454| } 162| | 163| 14.9k| return std::search(search_buf, search_buf + got, PEM_HEADER.begin(), PEM_HEADER.end()) != search_buf + got; 164| 15.3k|} _ZN5Botan15load_public_keyERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 131| 3.55k| [[maybe_unused]] std::span key_bits) { 132| 3.55k| const std::string alg_name = [&]() -> std::string { 133| 3.55k| if(const auto name = alg_id.oid().registered_name()) { 134| 3.55k| const std::vector alg_info = split_on(*name, '/'); 135| 3.55k| if(!alg_info.empty()) { 136| 3.55k| return alg_info[0]; 137| 3.55k| } 138| 3.55k| } 139| | 140| 3.55k| throw Decoding_Error( 141| 3.55k| fmt("Public key decoding failed, no algorithm associated with {}", alg_id.oid().to_string())); 142| 3.55k| }(); 143| | 144| 3.55k|#if defined(BOTAN_HAS_RSA) 145| 3.55k| if(alg_name == "RSA") { ------------------ | Branch (145:7): [True: 271, False: 3.28k] ------------------ 146| 271| return std::make_unique(alg_id, key_bits); 147| 271| } 148| 3.28k|#endif 149| | 150| 3.28k|#if defined(BOTAN_HAS_X25519) 151| 3.28k| if(alg_name == "X25519" || alg_name == "Curve25519") { ------------------ | Branch (151:7): [True: 1.34k, False: 1.94k] | Branch (151:31): [True: 0, False: 1.94k] ------------------ 152| 0| return std::make_unique(alg_id, key_bits); 153| 0| } 154| 3.28k|#endif 155| | 156| 3.28k|#if defined(BOTAN_HAS_X448) 157| 3.28k| if(alg_name == "X448") { ------------------ | Branch (157:7): [True: 0, False: 3.28k] ------------------ 158| 0| return std::make_unique(alg_id, key_bits); 159| 0| } 160| 3.28k|#endif 161| | 162| 3.28k|#if defined(BOTAN_HAS_MCELIECE) 163| 3.28k| if(alg_name == "McEliece") { ------------------ | Branch (163:7): [True: 0, False: 3.28k] ------------------ 164| 0| return std::make_unique(alg_id, key_bits); 165| 0| } 166| 3.28k|#endif 167| | 168| 3.28k|#if defined(BOTAN_HAS_FRODOKEM) 169| 3.28k| if(alg_name == "FrodoKEM" || alg_name.starts_with("FrodoKEM-") || alg_name.starts_with("eFrodoKEM-")) { ------------------ | Branch (169:7): [True: 1.34k, False: 1.94k] | Branch (169:33): [True: 0, False: 1.94k] | Branch (169:70): [True: 0, False: 1.94k] ------------------ 170| 0| return std::make_unique(alg_id, key_bits); 171| 0| } 172| 3.28k|#endif 173| | 174| 3.28k|#if defined(BOTAN_HAS_KYBER) || defined(BOTAN_HAS_KYBER_90S) 175| 3.28k| if(alg_name == "Kyber" || alg_name.starts_with("Kyber-")) { ------------------ | Branch (175:7): [True: 1.34k, False: 1.94k] | Branch (175:30): [True: 0, False: 1.94k] ------------------ 176| 0| return std::make_unique(alg_id, key_bits); 177| 0| } 178| 3.28k|#endif 179| | 180| 3.28k|#if defined(BOTAN_HAS_ML_KEM) 181| 3.28k| if(alg_name.starts_with("ML-KEM-")) { ------------------ | Branch (181:7): [True: 3, False: 3.28k] ------------------ 182| 3| return std::make_unique(alg_id, key_bits); 183| 3| } 184| 3.28k|#endif 185| | 186| 3.28k|#if defined(BOTAN_HAS_ECDSA) 187| 3.28k| if(alg_name == "ECDSA") { ------------------ | Branch (187:7): [True: 1.28k, False: 1.99k] ------------------ 188| 1.28k| return std::make_unique(alg_id, key_bits); 189| 1.28k| } 190| 1.99k|#endif 191| | 192| 1.99k|#if defined(BOTAN_HAS_ECDH) 193| 1.99k| if(alg_name == "ECDH") { ------------------ | Branch (193:7): [True: 0, False: 1.99k] ------------------ 194| 0| return std::make_unique(alg_id, key_bits); 195| 0| } 196| 1.99k|#endif 197| | 198| 1.99k|#if defined(BOTAN_HAS_DIFFIE_HELLMAN) 199| 1.99k| if(alg_name == "DH") { ------------------ | Branch (199:7): [True: 104, False: 1.89k] ------------------ 200| 104| return std::make_unique(alg_id, key_bits); 201| 104| } 202| 1.89k|#endif 203| | 204| 1.89k|#if defined(BOTAN_HAS_DSA) 205| 1.89k| if(alg_name == "DSA") { ------------------ | Branch (205:7): [True: 95, False: 1.80k] ------------------ 206| 95| return std::make_unique(alg_id, key_bits); 207| 95| } 208| 1.80k|#endif 209| | 210| 1.80k|#if defined(BOTAN_HAS_ELGAMAL) 211| 1.80k| if(alg_name == "ElGamal") { ------------------ | Branch (211:7): [True: 0, False: 1.80k] ------------------ 212| 0| return std::make_unique(alg_id, key_bits); 213| 0| } 214| 1.80k|#endif 215| | 216| 1.80k|#if defined(BOTAN_HAS_ECGDSA) 217| 1.80k| if(alg_name == "ECGDSA") { ------------------ | Branch (217:7): [True: 0, False: 1.80k] ------------------ 218| 0| return std::make_unique(alg_id, key_bits); 219| 0| } 220| 1.80k|#endif 221| | 222| 1.80k|#if defined(BOTAN_HAS_ECKCDSA) 223| 1.80k| if(alg_name == "ECKCDSA") { ------------------ | Branch (223:7): [True: 0, False: 1.80k] ------------------ 224| 0| return std::make_unique(alg_id, key_bits); 225| 0| } 226| 1.80k|#endif 227| | 228| 1.80k|#if defined(BOTAN_HAS_ED25519) 229| 1.80k| if(alg_name == "Ed25519") { ------------------ | Branch (229:7): [True: 0, False: 1.80k] ------------------ 230| 0| return std::make_unique(alg_id, key_bits); 231| 0| } 232| 1.80k|#endif 233| | 234| 1.80k|#if defined(BOTAN_HAS_ED448) 235| 1.80k| if(alg_name == "Ed448") { ------------------ | Branch (235:7): [True: 0, False: 1.80k] ------------------ 236| 0| return std::make_unique(alg_id, key_bits); 237| 0| } 238| 1.80k|#endif 239| | 240| 1.80k|#if defined(BOTAN_HAS_GOST_34_10_2001) 241| 1.80k| if(alg_name == "GOST-34.10" || alg_name == "GOST-34.10-2012-256" || alg_name == "GOST-34.10-2012-512") { ------------------ | Branch (241:7): [True: 1.34k, False: 458] | Branch (241:35): [True: 374, False: 84] | Branch (241:72): [True: 11, False: 73] ------------------ 242| 387| return std::make_unique(alg_id, key_bits); 243| 387| } 244| 1.41k|#endif 245| | 246| 1.41k|#if defined(BOTAN_HAS_SM2) 247| 1.41k| if(alg_name == "SM2" || alg_name == "SM2_Sig" || alg_name == "SM2_Enc") { ------------------ | Branch (247:7): [True: 1.34k, False: 73] | Branch (247:28): [True: 0, False: 73] | Branch (247:53): [True: 0, False: 73] ------------------ 248| 0| return std::make_unique(alg_id, key_bits); 249| 0| } 250| 1.41k|#endif 251| | 252| 1.41k|#if defined(BOTAN_HAS_XMSS_RFC8391) 253| 1.41k| if(alg_name == "XMSS") { ------------------ | Branch (253:7): [True: 0, False: 1.41k] ------------------ 254| 0| return std::make_unique(alg_id, key_bits); 255| 0| } 256| 1.41k|#endif 257| | 258| 1.41k|#if defined(BOTAN_HAS_DILITHIUM) || defined(BOTAN_HAS_DILITHIUM_AES) 259| 1.41k| if(alg_name == "Dilithium" || alg_name.starts_with("Dilithium-")) { ------------------ | Branch (259:7): [True: 1.34k, False: 73] | Branch (259:34): [True: 0, False: 73] ------------------ 260| 0| return std::make_unique(alg_id, key_bits); 261| 0| } 262| 1.41k|#endif 263| | 264| 1.41k|#if defined(BOTAN_HAS_ML_DSA) 265| 1.41k| if(alg_name.starts_with("ML-DSA-")) { ------------------ | Branch (265:7): [True: 3, False: 1.41k] ------------------ 266| 3| return std::make_unique(alg_id, key_bits); 267| 3| } 268| 1.41k|#endif 269| | 270| 1.41k|#if defined(BOTAN_HAS_HSS_LMS) 271| 1.41k| if(alg_name == "HSS-LMS") { ------------------ | Branch (271:7): [True: 0, False: 1.41k] ------------------ 272| 0| return std::make_unique(alg_id, key_bits); 273| 0| } 274| 1.41k|#endif 275| | 276| 1.41k|#if defined(BOTAN_HAS_SPHINCS_PLUS_WITH_SHA2) || defined(BOTAN_HAS_SPHINCS_PLUS_WITH_SHAKE) 277| 1.41k| if(alg_name == "SPHINCS+" || alg_name.starts_with("SphincsPlus-")) { ------------------ | Branch (277:7): [True: 1.34k, False: 70] | Branch (277:33): [True: 0, False: 70] ------------------ 278| 0| return std::make_unique(alg_id, key_bits); 279| 0| } 280| 1.41k|#endif 281| | 282| 1.41k|#if defined(BOTAN_HAS_SLH_DSA_WITH_SHA2) || defined(BOTAN_HAS_SLH_DSA_WITH_SHAKE) 283| 1.41k| if(alg_name.starts_with("SLH-DSA-") || alg_name.starts_with("Hash-SLH-DSA-")) { ------------------ | Branch (283:7): [True: 1.35k, False: 58] | Branch (283:43): [True: 0, False: 58] ------------------ 284| 12| return std::make_unique(alg_id, key_bits); 285| 12| } 286| 1.39k|#endif 287| | 288| 1.39k|#if defined(BOTAN_HAS_CLASSICMCELIECE) 289| 1.39k| if(alg_name.starts_with("ClassicMcEliece")) { ------------------ | Branch (289:7): [True: 0, False: 1.39k] ------------------ 290| 0| return std::make_unique(alg_id, key_bits); 291| 0| } 292| 1.39k|#endif 293| | 294| 1.39k| throw Decoding_Error(fmt("Unknown or unavailable public key algorithm '{}'", alg_name)); 295| 1.39k|} pk_algs.cpp:_ZZN5Botan15load_public_keyERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEEENK3$_0clEv: 132| 3.55k| const std::string alg_name = [&]() -> std::string { 133| 3.55k| if(const auto name = alg_id.oid().registered_name()) { ------------------ | Branch (133:21): [True: 2.21k, False: 1.34k] ------------------ 134| 2.21k| const std::vector alg_info = split_on(*name, '/'); 135| 2.21k| if(!alg_info.empty()) { ------------------ | Branch (135:13): [True: 2.21k, False: 0] ------------------ 136| 2.21k| return alg_info[0]; 137| 2.21k| } 138| 2.21k| } 139| | 140| 1.34k| throw Decoding_Error( 141| 1.34k| fmt("Public key decoding failed, no algorithm associated with {}", alg_id.oid().to_string())); 142| 3.55k| }(); _ZNK5Botan14Asymmetric_Key30_default_x509_signature_formatEv: 32| 900|Signature_Format Asymmetric_Key::_default_x509_signature_format() const { 33| 900| if(_signature_element_size_for_DER_encoding()) { ------------------ | Branch (33:7): [True: 662, False: 238] ------------------ 34| 662| return Signature_Format::DerSequence; 35| 662| } else { 36| 238| return Signature_Format::Standard; 37| 238| } 38| 900|} _ZN5Botan22format_hex_fingerprintENSt3__14spanIKhLm18446744073709551615EEE: 47| 19.0k|std::string format_hex_fingerprint(std::span bits) { 48| 19.0k| const std::string hex = hex_encode(bits); 49| | 50| 19.0k| std::string fprint; 51| 19.0k| fprint.reserve(3 * bits.size()); 52| | 53| 514k| for(size_t i = 0; i != hex.size(); i += 2) { ------------------ | Branch (53:22): [True: 495k, False: 19.0k] ------------------ 54| 495k| if(i != 0) { ------------------ | Branch (54:10): [True: 476k, False: 19.0k] ------------------ 55| 476k| fprint.push_back(':'); 56| 476k| } 57| | 58| 495k| fprint.push_back(hex[i]); 59| 495k| fprint.push_back(hex[i + 1]); 60| 495k| } 61| | 62| 19.0k| return fprint; 63| 19.0k|} _ZN5Botan6PK_Ops22Verification_with_HashC2ERKNS_27PK_Signature_Options_ReaderE: 173| 266| Verification(), m_hash(validate_options_returning_hash(options)) {} _ZN5Botan6PK_Ops22Verification_with_HashD2Ev: 175| 928|PK_Ops::Verification_with_Hash::~Verification_with_Hash() = default; _ZN5Botan6PK_Ops22Verification_with_HashC2ERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEb: 183| 937| bool allow_null_parameters) { 184| 937| const auto oid_name = alg_id.oid().registered_name(); 185| 937| if(!oid_name) { ------------------ | Branch (185:7): [True: 0, False: 937] ------------------ 186| 0| throw Decoding_Error( 187| 0| fmt("Unexpected AlgorithmIdentifier OID {} in association with {} key", alg_id.oid(), pk_algo)); 188| 0| } 189| | 190| 937| const auto oid_info = split_on(*oid_name, '/'); 191| | 192| 937| if(oid_info.size() != 2 || oid_info[0] != pk_algo) { ------------------ | Branch (192:7): [True: 0, False: 937] | Branch (192:31): [True: 275, False: 662] ------------------ 193| 275| throw Decoding_Error( 194| 275| fmt("Unexpected AlgorithmIdentifier OID {} in association with {} key", alg_id.oid(), pk_algo)); 195| 275| } 196| | 197| 662| if(!alg_id.parameters_are_empty()) { ------------------ | Branch (197:7): [True: 0, False: 662] ------------------ 198| 0| if(alg_id.parameters_are_null()) { ------------------ | Branch (198:10): [True: 0, False: 0] ------------------ 199| 0| if(!allow_null_parameters) { ------------------ | Branch (199:13): [True: 0, False: 0] ------------------ 200| 0| throw Decoding_Error(fmt("Unexpected NULL AlgorithmIdentifier parameters for {}", pk_algo)); 201| 0| } 202| 0| } else { 203| 0| throw Decoding_Error(fmt("Unexpected AlgorithmIdentifier parameters for {}", pk_algo)); 204| 0| } 205| 0| } 206| | 207| 662| m_hash = HashFunction::create_or_throw(oid_info[1]); 208| 662|} _ZN5Botan6PK_Ops22Verification_with_Hash6updateENSt3__14spanIKhLm18446744073709551615EEE: 210| 1.85k|void PK_Ops::Verification_with_Hash::update(std::span msg) { 211| 1.85k| m_hash->update(msg); 212| 1.85k|} _ZN5Botan6PK_Ops22Verification_with_Hash18is_valid_signatureENSt3__14spanIKhLm18446744073709551615EEE: 214| 928|bool PK_Ops::Verification_with_Hash::is_valid_signature(std::span sig) { 215| 928| const std::vector msg = m_hash->final_stdvec(); 216| 928| return verify(msg, sig); 217| 928|} pk_ops.cpp:_ZN5Botan12_GLOBAL__N_131validate_options_returning_hashERKNS_27PK_Signature_Options_ReaderE: 113| 266|std::unique_ptr validate_options_returning_hash(const PK_Signature_Options_Reader& options) { 114| | // The caller provides the digest; if they named the hash, its length is checked 115| 266| if(options.using_externally_computed_prehash()) { ------------------ | Branch (115:7): [True: 0, False: 266] ------------------ 116| 0|#if defined(BOTAN_HAS_RAW_HASH_FN) 117| 0| if(auto prehash = externally_computed_prehash_name(options)) { ------------------ | Branch (117:15): [True: 0, False: 0] ------------------ 118| 0| return std::make_unique(HashFunction::create_or_throw(*prehash)); 119| 0| } 120| 0| return std::make_unique("Raw", 0); 121| |#else 122| | throw Lookup_Error("Signing an externally computed prehash requires the raw_hash module"); 123| |#endif 124| 0| } 125| | 126| 266| BOTAN_ARG_CHECK(!options.hash_function_name().empty(), "This algorithm requires a hash function for signing"); ------------------ | | 35| 266| do { \ | | 36| 266| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 266| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 266] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 266| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 266] | | ------------------ ------------------ 127| | 128| | /* 129| | * In a sense ECDSA/DSA are *always* in prehashing mode, so we accept the case 130| | * where prehashing is requested as long as the prehash hash matches the signature hash. 131| | */ 132| 266| if(options.using_prehash()) { ------------------ | Branch (132:7): [True: 0, False: 266] ------------------ 133| 0| if(!options.prehash_function().has_value() || ------------------ | Branch (133:10): [True: 0, False: 0] ------------------ 134| 0| options.prehash_function().value() != options.hash_function_name()) { ------------------ | Branch (134:10): [True: 0, False: 0] ------------------ 135| 0| throw Invalid_Argument("This algorithm does not support prehashing with a different hash"); 136| 0| } 137| 0| } 138| | 139| 266| return HashFunction::create_or_throw(options.hash_function_name()); 140| 266|} _ZN5Botan20PK_Signature_OptionsD2Ev: 19| 1.25k|PK_Signature_Options::~PK_Signature_Options() = default; _ZN5Botan20PK_Signature_Options9with_hashENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 21| 504|PK_Signature_Options PK_Signature_Options::with_hash(std::string_view hash) { 22| 504| BOTAN_STATE_CHECK_MSG(!m_hash_fn.has_value(), "PK_Signature_Options::with_hash cannot specify hash twice"); ------------------ | | 61| 504| do { \ | | 62| 504| if(!(expr)) \ | | ------------------ | | | Branch (62:10): [True: 0, False: 504] | | ------------------ | | 63| 504| Botan::throw_invalid_state(msg, __func__, __FILE__); \ | | 64| 504| } while(0) | | ------------------ | | | Branch (64:12): [Folded, False: 504] | | ------------------ ------------------ 23| 504| auto next = (*this); 24| 504| if(!hash.empty()) { ------------------ | Branch (24:7): [True: 504, False: 0] ------------------ 25| 504| next.m_hash_fn = hash; 26| 504| } 27| 504| return next; 28| 504|} _ZN5Botan20PK_Signature_Options12with_paddingENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 30| 238|PK_Signature_Options PK_Signature_Options::with_padding(std::string_view padding) { 31| 238| BOTAN_STATE_CHECK_MSG(!m_padding.has_value(), "PK_Signature_Options::with_padding cannot specify padding twice"); ------------------ | | 61| 238| do { \ | | 62| 238| if(!(expr)) \ | | ------------------ | | | Branch (62:10): [True: 0, False: 238] | | ------------------ | | 63| 238| Botan::throw_invalid_state(msg, __func__, __FILE__); \ | | 64| 238| } while(0) | | ------------------ | | | Branch (64:12): [Folded, False: 238] | | ------------------ ------------------ 32| 238| auto next = (*this); 33| 238| if(!padding.empty()) { ------------------ | Branch (33:7): [True: 238, False: 0] ------------------ 34| 238| next.m_padding = padding; 35| 238| } 36| 238| return next; 37| 238|} _ZN5Botan20PK_Signature_Options14with_salt_sizeEm: 92| 10|PK_Signature_Options PK_Signature_Options::with_salt_size(size_t salt_size) { 93| 10| BOTAN_STATE_CHECK_MSG(!m_salt_size.has_value(), ------------------ | | 61| 10| do { \ | | 62| 10| if(!(expr)) \ | | ------------------ | | | Branch (62:10): [True: 0, False: 10] | | ------------------ | | 63| 10| Botan::throw_invalid_state(msg, __func__, __FILE__); \ | | 64| 10| } while(0) | | ------------------ | | | Branch (64:12): [Folded, False: 10] | | ------------------ ------------------ 94| 10| "PK_Signature_Options::with_salt_size cannot specify salt size twice"); 95| 10| BOTAN_ARG_CHECK(salt_size <= 1024, "Unreasonable salt size"); ------------------ | | 35| 10| do { \ | | 36| 10| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 10| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 10] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 10| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 10] | | ------------------ ------------------ 96| 10| auto next = (*this); 97| 10| next.m_salt_size = salt_size; 98| 10| return next; 99| 10|} _ZNK5Botan27PK_Signature_Options_Reader18hash_function_nameEv: 140| 1.00k|const std::string& PK_Signature_Options_Reader::hash_function_name() const { 141| 1.00k| note_examined(Option::Hash); 142| | 143| 1.00k| if(m_options.m_hash_fn.has_value()) { ------------------ | Branch (143:7): [True: 1.00k, False: 0] ------------------ 144| 1.00k| return m_options.m_hash_fn.value(); 145| 1.00k| } 146| | 147| 0| throw Invalid_State("This signature scheme requires specifying a hash function"); 148| 1.00k|} _ZN5Botan32acknowledge_always_deterministicERKNS_27PK_Signature_Options_ReaderE: 347| 228|void acknowledge_always_deterministic(const PK_Signature_Options_Reader& options) { 348| 228| BOTAN_UNUSED(options.using_deterministic_signature()); ------------------ | | 151| 228|#define BOTAN_UNUSED Botan::ignore_params ------------------ 349| 228|} _ZN5Botan11PK_VerifierC2ERKNS_10Public_KeyERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS7_11char_traitsIcEEEE: 462| 1.44k| std::string_view provider) { 463| 1.44k| m_op = key.create_x509_verification_op(signature_algorithm, provider); 464| 1.44k| if(!m_op) { ------------------ | Branch (464:7): [True: 0, False: 1.44k] ------------------ 465| 0| throw Invalid_Argument(fmt("Key type {} does not support X.509 signature verification", key.algo_name())); 466| 0| } 467| | 468| 1.44k| m_sig_format = key._default_x509_signature_format(); 469| 1.44k| m_sig_element_size = key._signature_element_size_for_DER_encoding(); 470| 1.44k|} _ZN5Botan11PK_VerifierD2Ev: 472| 1.16k|PK_Verifier::~PK_Verifier() = default; _ZNK5Botan11PK_Verifier13hash_functionEv: 477| 19|std::string PK_Verifier::hash_function() const { 478| 19| return m_op->hash_function(); 479| 19|} _ZN5Botan11PK_Verifier6updateEPKhm: 497| 2.33k|void PK_Verifier::update(const uint8_t in[], size_t length) { 498| 2.33k| m_op->update({in, length}); 499| 2.33k|} _ZN5Botan11PK_Verifier15check_signatureEPKhm: 528| 1.16k|bool PK_Verifier::check_signature(const uint8_t sig[], size_t length) { 529| 1.16k| try { 530| 1.16k| if(m_sig_format == Signature_Format::Standard) { ------------------ | Branch (530:10): [True: 504, False: 662] ------------------ 531| 504| return m_op->is_valid_signature({sig, length}); 532| 662| } else if(m_sig_format == Signature_Format::DerSequence) { ------------------ | Branch (532:17): [True: 662, False: 0] ------------------ 533| 662| bool decoding_success = false; 534| 662| std::vector real_sig; 535| | 536| 662| BOTAN_ASSERT_NOMSG(m_sig_element_size.has_value()); ------------------ | | 84| 662| do { \ | | 85| 662| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 662| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 662] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 662| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 662] | | ------------------ ------------------ 537| | 538| 662| try { 539| 662| real_sig = decode_der_signature_pair({sig, length}, m_sig_element_size.value()); 540| 662| decoding_success = true; 541| 662| } catch(...) {} 542| | 543| | // It is critical that is_valid_signature is called even if DER decoding failed, since 544| | // that is what resets the internal state (message hashes, etc) 545| 662| const bool accept = m_op->is_valid_signature(real_sig); 546| | 547| 662| return accept && decoding_success; ------------------ | Branch (547:17): [True: 0, False: 662] | Branch (547:27): [True: 0, False: 0] ------------------ 548| 662| } else { 549| 0| throw Internal_Error("PK_Verifier: Invalid signature format enum"); 550| 0| } 551| 1.16k| } catch(Invalid_Argument&) { 552| 0| return false; 553| 135| } catch(Decoding_Error&) { 554| 135| return false; 555| 135| } catch(Encoding_Error&) { 556| 0| return false; 557| 0| } 558| 1.16k|} pubkey.cpp:_ZN5Botan12_GLOBAL__N_125decode_der_signature_pairENSt3__14spanIKhLm18446744073709551615EEEm: 503| 662|std::vector decode_der_signature_pair(std::span der_sig, size_t sig_part_size) { 504| 662| BOTAN_ASSERT_NOMSG(sig_part_size > 0); ------------------ | | 84| 662| do { \ | | 85| 662| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 662| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 662] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 662| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 662] | | ------------------ ------------------ 505| | 506| 662| BigInt r; 507| 662| BigInt s; 508| | 509| | // TODO should be able to just get the integer bytes directly from 510| | // BER_Decoder without using BigInt here 511| 662| BER_Decoder(der_sig, BER_Decoder::Limits::DER()).start_sequence().decode(r).decode(s).end_cons().verify_end(); 512| | 513| 662| const bool invalid_r = r.is_negative() || r.bytes() > sig_part_size; ------------------ | Branch (513:27): [True: 4, False: 658] | Branch (513:46): [True: 0, False: 658] ------------------ 514| 662| const bool invalid_s = s.is_negative() || s.bytes() > sig_part_size; ------------------ | Branch (514:27): [True: 4, False: 658] | Branch (514:46): [True: 0, False: 658] ------------------ 515| | 516| 662| if(invalid_r || invalid_s) { ------------------ | Branch (516:7): [True: 4, False: 658] | Branch (516:20): [True: 1, False: 657] ------------------ 517| 2| throw Decoding_Error("Invalid DER encoding of signature"); 518| 2| } 519| | 520| 660| std::vector sig(2 * sig_part_size); 521| 660| r.serialize_to(std::span{sig}.first(sig_part_size)); 522| 660| s.serialize_to(std::span{sig}.last(sig_part_size)); 523| 660| return sig; 524| 662|} _ZNK5Botan13RSA_PublicKey11public_dataEv: 298| 238|std::shared_ptr RSA_PublicKey::public_data() const { 299| 238| return m_public; 300| 238|} _ZN5Botan13RSA_PublicKey4initEONS_6BigIntES2_: 324| 253|void RSA_PublicKey::init(BigInt&& n, BigInt&& e) { 325| 253| if(n.signum() <= 0 || n.is_even() || n.bits() < 384 || n.bits() > MAX_RSA_BITS) { ------------------ | Branch (325:7): [True: 5, False: 248] | Branch (325:26): [True: 1, False: 247] | Branch (325:41): [True: 1, False: 246] | Branch (325:59): [True: 0, False: 246] ------------------ 326| 7| throw Decoding_Error("Invalid RSA public key modulus"); 327| 7| } 328| 246| if(e.is_even() || e <= 1 || e >= n || e.bits() > 256) { ------------------ | Branch (328:7): [True: 2, False: 244] | Branch (328:22): [True: 1, False: 243] | Branch (328:32): [True: 0, False: 243] | Branch (328:42): [True: 0, False: 243] ------------------ 329| 3| throw Decoding_Error("Invalid RSA public key exponent"); 330| 3| } 331| 243| m_public = std::make_shared(std::move(n), std::move(e)); 332| 243|} _ZN5Botan13RSA_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 334| 271|RSA_PublicKey::RSA_PublicKey(const AlgorithmIdentifier& alg_id, std::span key_bits) { 335| | // RFC 4055 Section 1.2 has that parameters MUST be NULL, but historical 336| | // reasons make that difficult to enforce, so absent is also accepted. 337| | // 338| | // This only checks rsaEncryption; PSS/OAEP key identifiers have their own parameter encoding 339| 271| if(alg_id.oid().registered_name() == "RSA" && !alg_id.parameters_are_null_or_empty()) { ------------------ | Branch (339:7): [True: 206, False: 65] | Branch (339:7): [True: 2, False: 269] | Branch (339:50): [True: 2, False: 204] ------------------ 340| 2| throw Decoding_Error("Unexpected parameters for RSA public key"); 341| 2| } 342| | 343| 269| BigInt n; 344| 269| BigInt e; 345| 269| BER_Decoder(key_bits, BER_Decoder::Limits::DER()).start_sequence().decode(n).decode(e).end_cons().verify_end(); 346| | 347| 269| init(std::move(n), std::move(e)); 348| 269|} _ZNK5Botan13RSA_PublicKey10key_lengthEv: 361| 243|size_t RSA_PublicKey::key_length() const { 362| 243| return m_public->public_modulus_bits(); 363| 243|} _ZNK5Botan13RSA_PublicKey18estimated_strengthEv: 365| 243|size_t RSA_PublicKey::estimated_strength() const { 366| 243| return if_work_factor(key_length()); 367| 243|} _ZNK5Botan13RSA_PublicKey27create_x509_verification_opERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE: 1113| 243| std::string_view provider) const { 1114| 243| if(provider == "base" || provider.empty()) { ------------------ | Branch (1114:7): [True: 0, False: 243] | Branch (1114:29): [True: 243, False: 0] ------------------ 1115| 243| return std::make_unique( 1116| 243| *this, PK_Options_Reader_Access::for_verification(parse_rsa_signature_algorithm(alg_id))); 1117| 243| } 1118| | 1119| 0| throw Provider_Not_Found(algo_name(), provider); 1120| 243|} _ZNK5Botan15RSA_Public_Data5get_nEv: 64| 128| const BigInt& get_n() const { return m_n; } _ZNK5Botan15RSA_Public_Data19public_modulus_bitsEv: 68| 346| size_t public_modulus_bits() const { return m_public_modulus_bits; } rsa.cpp:_ZN5Botan12_GLOBAL__N_129parse_rsa_signature_algorithmERKNS_19AlgorithmIdentifierE: 1046| 243|PK_Signature_Options parse_rsa_signature_algorithm(const AlgorithmIdentifier& alg_id) { 1047| 243| const auto oid_name = alg_id.oid().registered_name(); 1048| 243| if(!oid_name) { ------------------ | Branch (1048:7): [True: 0, False: 243] ------------------ 1049| 0| throw Decoding_Error("Unknown AlgorithmIdentifier for RSA X.509 signatures"); 1050| 0| } 1051| | 1052| 243| const auto sig_info = split_on(*oid_name, '/'); 1053| | 1054| 243| if(sig_info.empty() || sig_info.size() != 2 || sig_info[0] != "RSA") { ------------------ | Branch (1054:7): [True: 0, False: 243] | Branch (1054:27): [True: 0, False: 243] | Branch (1054:51): [True: 0, False: 243] ------------------ 1055| 0| throw Decoding_Error("Unknown AlgorithmIdentifier for RSA X.509 signatures"); 1056| 0| } 1057| | 1058| 243| const std::string& padding = sig_info[1]; 1059| | 1060| 243| if(padding != "PSS") { ------------------ | Branch (1060:7): [True: 228, False: 15] ------------------ 1061| 228| if(!alg_id.parameters_are_null_or_empty()) { ------------------ | Branch (1061:10): [True: 0, False: 228] ------------------ 1062| 0| throw Decoding_Error("Non-PSS RSA signature algorithm OID has unexpected parameters"); 1063| 0| } 1064| 228| } 1065| | 1066| 243| if(padding == "PSS") { ------------------ | Branch (1066:7): [True: 15, False: 228] ------------------ 1067| | // "MUST contain RSASSA-PSS-params" 1068| 15| if(alg_id.parameters().empty()) { ------------------ | Branch (1068:10): [True: 0, False: 15] ------------------ 1069| 0| throw Decoding_Error("PSS params must be provided"); 1070| 0| } 1071| | 1072| 15| const PSS_Params pss_params(alg_id.parameters()); 1073| | 1074| | // hash_algo must be SHA1, SHA2-224, SHA2-256, SHA2-384 or SHA2-512 1075| | // We also support SHA-3 (is also supported by e.g. OpenSSL and bouncycastle) 1076| 15| const auto hash_algo = pss_params.hash_algid().oid().registered_name(); 1077| 15| if(hash_algo != "SHA-1" && hash_algo != "SHA-224" && hash_algo != "SHA-256" && hash_algo != "SHA-384" && ------------------ | Branch (1077:10): [True: 11, False: 4] | Branch (1077:34): [True: 11, False: 0] | Branch (1077:60): [True: 11, False: 0] | Branch (1077:86): [True: 11, False: 0] ------------------ 1078| 11| hash_algo != "SHA-512" && hash_algo != "SHA-3(224)" && hash_algo != "SHA-3(256)" && ------------------ | Branch (1078:10): [True: 0, False: 11] | Branch (1078:36): [True: 0, False: 0] | Branch (1078:65): [True: 0, False: 0] ------------------ 1079| 0| hash_algo != "SHA-3(384)" && hash_algo != "SHA-3(512)") { ------------------ | Branch (1079:10): [True: 0, False: 0] | Branch (1079:39): [True: 0, False: 0] ------------------ 1080| 0| throw Decoding_Error("Unacceptable hash for PSS signatures"); 1081| 0| } 1082| | 1083| 15| if(pss_params.mgf_algid().oid().registered_name() != "MGF1") { ------------------ | Branch (1083:10): [True: 0, False: 15] ------------------ 1084| 0| throw Decoding_Error("Unacceptable MGF for PSS signatures"); 1085| 0| } 1086| | 1087| | // For MGF1, it is strongly RECOMMENDED that the underlying hash 1088| | // function be the same as the one identified by hashAlgorithm 1089| 15| if(pss_params.hash_algid() != pss_params.mgf_hash_algid()) { ------------------ | Branch (1089:10): [True: 1, False: 14] ------------------ 1090| 1| throw Decoding_Error("Unacceptable MGF hash for PSS signatures"); 1091| 1| } 1092| | 1093| 14| if(pss_params.trailer_field() != 1) { ------------------ | Branch (1093:10): [True: 0, False: 14] ------------------ 1094| 0| throw Decoding_Error("Unacceptable trailer field for PSS signatures"); 1095| 0| } 1096| | 1097| 14| return PK_Signature_Options().with_padding("PSS").with_hash(*hash_algo).with_salt_size(pss_params.salt_length()); 1098| 228| } else { 1099| 228| const AlgorithmSpec spec(padding); 1100| | 1101| 228| const auto m = spec.match("PKCS1v15({hash})"); 1102| 228| if(!m) { ------------------ | Branch (1102:10): [True: 0, False: 228] ------------------ 1103| 0| throw Decoding_Error("Unexpected OID for RSA signatures"); 1104| 0| } 1105| | 1106| 228| return PK_Signature_Options().with_padding("PKCS1v15").with_hash(m->str("hash")); 1107| 228| } 1108| 243|} _ZN5Botan15RSA_Public_DataC2EONS_6BigIntES2_: 51| 243| m_n(std::move(n)), 52| 243| m_e(std::move(e)), 53| 243| m_mod_n(Barrett_Reduction::for_public_modulus(m_n)), 54| 243| m_monty_n(m_n, m_mod_n), 55| 243| m_public_modulus_bits(m_n.bits()), 56| 243| m_public_modulus_bytes(m_n.bytes()) {} rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Public_OperationC2ERKNS_13RSA_PublicKeyE: 928| 238| explicit RSA_Public_Operation(const RSA_PublicKey& rsa) : m_public(rsa.public_data()) {} rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Public_Operation20public_modulus_bytesEv: 941| 238| size_t public_modulus_bytes() const { return m_public->public_modulus_bytes(); } _ZNK5Botan15RSA_Public_Data20public_modulus_bytesEv: 70| 238| size_t public_modulus_bytes() const { return m_public_modulus_bytes; } rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Public_Operation19public_modulus_bitsEv: 930| 103| size_t public_modulus_bits() const { return m_public->public_modulus_bits(); } rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Public_Operation9public_opERKNS_6BigIntE: 933| 128| BigInt public_op(const BigInt& m) const { 934| 128| if(m >= m_public->get_n()) { ------------------ | Branch (934:13): [True: 25, False: 103] ------------------ 935| 25| throw Decoding_Error("RSA public op - input is too large"); 936| 25| } 937| | 938| 103| return m_public->public_op(m); 939| 128| } _ZNK5Botan15RSA_Public_Data9public_opERKNS_6BigIntE: 58| 103| BigInt public_op(const BigInt& m) const { 59| 103| const size_t powm_window = 1; 60| 103| const auto powm_m_n = monty_precompute(m_monty_n, m, powm_window, false); 61| 103| return monty_execute_vartime(*powm_m_n, m_e).value(); 62| 103| } rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_OperationC2ERKNS_13RSA_PublicKeyERKNS_27PK_Signature_Options_ReaderE: 977| 238| RSA_Public_Operation(rsa), m_padding(SignaturePaddingScheme::create_or_throw(options)) {} rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_Operation6updateENSt3__14spanIKhLm18446744073709551615EEE: 968| 476| void update(std::span msg) override { m_padding->update(msg.data(), msg.size()); } rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_Operation18is_valid_signatureENSt3__14spanIKhLm18446744073709551615EEE: 970| 238| bool is_valid_signature(std::span sig) override { 971| 238| const auto msg = m_padding->raw_data(); 972| 238| const auto message_repr = recover_message_repr(sig.data(), sig.size()); 973| 238| return m_padding->verify(message_repr, msg, public_modulus_bits() - 1); 974| 238| } rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_Operation20recover_message_reprEPKhm: 982| 238| std::vector recover_message_repr(const uint8_t input[], size_t input_len) { 983| | // RFC 8017 8.1.2 and 8.2.2 state 984| | // If the length of the signature S is not k octets, 985| | // output "invalid signature" and stop. 986| | // 987| 238| if(input_len != public_modulus_bytes()) { ------------------ | Branch (987:13): [True: 110, False: 128] ------------------ 988| 110| throw Decoding_Error("RSA signature is an incorrect size for this public key"); 989| 110| } 990| 128| const BigInt input_bn(input, input_len); 991| 128| return public_op(input_bn).serialize(); 992| 238| } rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Verify_Operation13hash_functionEv: 979| 19| std::string hash_function() const override { return m_padding->hash_function(); } _ZN5Botan18Sphincs_ParametersC2ENS_21Sphincs_Parameter_SetENS_17Sphincs_Hash_TypeEjjjjjjj: 245| 12| m_set(set), m_hash_type(hash_type), m_n(n), m_h(h), m_d(d), m_a(a), m_k(k), m_w(w), m_bitsec(bitsec) { 246| 12| BOTAN_ARG_CHECK(!(hash_type == Sphincs_Hash_Type::Haraka && is_slh_dsa_set(set)), ------------------ | | 35| 12| do { \ | | 36| 12| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 12| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 0, False: 12] | | | Branch (37:12): [True: 0, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 12| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 12] | | ------------------ ------------------ 247| 12| "Haraka is not available for SLH-DSA"); 248| 12| BOTAN_ARG_CHECK(w == 4 || w == 16 || w == 256, "Winternitz parameter must be one of 4, 16, 256"); ------------------ | | 35| 12| do { \ | | 36| 12| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 36| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 0, False: 12] | | | Branch (37:12): [True: 12, False: 0] | | | Branch (37:12): [True: 0, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 12| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 12] | | ------------------ ------------------ 249| 12| BOTAN_ARG_CHECK(n == 16 || n == 24 || n == 32, "n must be one of 16, 24, 32"); ------------------ | | 35| 12| do { \ | | 36| 12| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 36| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 4, False: 8] | | | Branch (37:12): [True: 4, False: 4] | | | Branch (37:12): [True: 4, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 12| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 12] | | ------------------ ------------------ 250| 12| BOTAN_ARG_CHECK(m_d > 0, "d must be greater than zero"); ------------------ | | 35| 12| do { \ | | 36| 12| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 12| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 12] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 12| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 12] | | ------------------ ------------------ 251| | 252| 12| m_xmss_tree_height = m_h / m_d; 253| 12| m_lg_w = ceil_log2(m_w); 254| | 255| | // base_2^b algorithm (Fips 205, Algorithm 4) only works 256| | // when m_log_w is a divisor of 8. 257| 12| BOTAN_ASSERT_NOMSG(m_lg_w <= 8 && 8 % m_lg_w == 0); ------------------ | | 84| 12| do { \ | | 85| 12| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 24| if(!(expr)) { \ | | ------------------ | | | Branch (86:12): [True: 12, False: 0] | | | Branch (86:12): [True: 12, False: 0] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 12| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 12] | | ------------------ ------------------ 258| | 259| | // # Winternitz blocks of the message (len_1 of FIPS 205, Algorithm 1) 260| 12| m_wots_len1 = (m_n * 8) / m_lg_w; 261| | 262| | // # Winternitz blocks of the checksum (output of FIPS 205 Algorithm 1) 263| 12| m_wots_len2 = ceil_log2(m_wots_len1 * (m_w - 1)) / m_lg_w + 1; 264| | 265| | // # Winternitz blocks in the signature (len of FIPS 205, Equation 5.4) 266| 12| m_wots_len = m_wots_len1 + m_wots_len2; 267| | 268| | // byte length of WOTS+ signature as well as public key 269| 12| m_wots_bytes = m_wots_len * m_n; 270| | 271| | // # of bytes the WOTS+ checksum consists of 272| 12| m_wots_checksum_bytes = ceil_tobytes(m_wots_len2 * m_lg_w); 273| | 274| 12| m_fors_sig_bytes = (m_a + 1) * m_k * m_n; 275| | 276| | // byte length of the FORS input message 277| 12| m_fors_message_bytes = ceil_tobytes(m_k * m_a); 278| | 279| 12| m_xmss_sig_bytes = m_wots_bytes + m_xmss_tree_height * m_n; 280| 12| m_ht_sig_bytes = m_d * m_xmss_sig_bytes; 281| 12| m_sp_sig_bytes = m_n /* random */ + m_fors_sig_bytes + m_ht_sig_bytes; 282| | 283| 12| m_tree_digest_bytes = ceil_tobytes(m_h - m_xmss_tree_height); 284| 12| m_leaf_digest_bytes = ceil_tobytes(m_xmss_tree_height); 285| 12| m_h_msg_digest_bytes = m_fors_message_bytes + m_tree_digest_bytes + m_leaf_digest_bytes; 286| 12|} _ZN5Botan18Sphincs_Parameters6createENS_21Sphincs_Parameter_SetENS_17Sphincs_Hash_TypeE: 314| 12| Sphincs_Parameter_Set set, Sphincs_Hash_Type hash /*, SlhDsaInputMode input_mode [TODO: prehash mode]*/) { 315| | // See FIPS 205, Table 2 316| 12| switch(set) { ------------------ | Branch (316:11): [True: 12, False: 0] ------------------ 317| 0| case Sphincs_Parameter_Set::Sphincs128Small: ------------------ | Branch (317:7): [True: 0, False: 12] ------------------ 318| 2| case Sphincs_Parameter_Set::SLHDSA128Small: ------------------ | Branch (318:7): [True: 2, False: 10] ------------------ 319| 2| return Sphincs_Parameters(set, hash, 16, 63, 7, 12, 14, 16, 133); 320| 0| case Sphincs_Parameter_Set::Sphincs128Fast: ------------------ | Branch (320:7): [True: 0, False: 12] ------------------ 321| 2| case Sphincs_Parameter_Set::SLHDSA128Fast: ------------------ | Branch (321:7): [True: 2, False: 10] ------------------ 322| 2| return Sphincs_Parameters(set, hash, 16, 66, 22, 6, 33, 16, 128); 323| | 324| 0| case Sphincs_Parameter_Set::Sphincs192Small: ------------------ | Branch (324:7): [True: 0, False: 12] ------------------ 325| 2| case Sphincs_Parameter_Set::SLHDSA192Small: ------------------ | Branch (325:7): [True: 2, False: 10] ------------------ 326| 2| return Sphincs_Parameters(set, hash, 24, 63, 7, 14, 17, 16, 193); 327| 0| case Sphincs_Parameter_Set::Sphincs192Fast: ------------------ | Branch (327:7): [True: 0, False: 12] ------------------ 328| 2| case Sphincs_Parameter_Set::SLHDSA192Fast: ------------------ | Branch (328:7): [True: 2, False: 10] ------------------ 329| 2| return Sphincs_Parameters(set, hash, 24, 66, 22, 8, 33, 16, 194); 330| | 331| 0| case Sphincs_Parameter_Set::Sphincs256Small: ------------------ | Branch (331:7): [True: 0, False: 12] ------------------ 332| 2| case Sphincs_Parameter_Set::SLHDSA256Small: ------------------ | Branch (332:7): [True: 2, False: 10] ------------------ 333| 2| return Sphincs_Parameters(set, hash, 32, 64, 8, 14, 22, 16, 255); 334| 0| case Sphincs_Parameter_Set::Sphincs256Fast: ------------------ | Branch (334:7): [True: 0, False: 12] ------------------ 335| 2| case Sphincs_Parameter_Set::SLHDSA256Fast: ------------------ | Branch (335:7): [True: 2, False: 10] ------------------ 336| 2| return Sphincs_Parameters(set, hash, 32, 68, 17, 9, 35, 16, 255); 337| 12| } 338| 0| BOTAN_ASSERT_UNREACHABLE(); ------------------ | | 173| 0|#define BOTAN_ASSERT_UNREACHABLE() Botan::assert_unreachable(__FILE__, __LINE__) ------------------ 339| 0|} _ZN5Botan18Sphincs_Parameters6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 341| 12|Sphincs_Parameters Sphincs_Parameters::create(std::string_view name) { 342| 12| auto [param_set, hash_type] = set_and_hash_from_name(name); 343| 12| return Sphincs_Parameters::create(param_set, hash_type); 344| 12|} _ZN5Botan18Sphincs_Parameters6createERKNS_3OIDE: 366| 12|Sphincs_Parameters Sphincs_Parameters::create(const OID& oid) { 367| 12| if(const auto name = oid.registered_name()) { ------------------ | Branch (367:18): [True: 12, False: 0] ------------------ 368| 12| return Sphincs_Parameters::create(*name); 369| 12| } 370| | 371| 0| throw Lookup_Error(fmt("No SLH-DSA (or SPHINCS+) parameter registered for OID {}", oid)); 372| 12|} sp_parameters.cpp:_ZN5Botan12_GLOBAL__N_122set_and_hash_from_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 20| 12|std::pair set_and_hash_from_name(std::string_view name) { 21| | // SPHINCS+ Round 3.1 instances 22| 12| if(name == "SphincsPlus-sha2-128s-r3.1") { ------------------ | Branch (22:7): [True: 0, False: 12] ------------------ 23| 0| return {Sphincs_Parameter_Set::Sphincs128Small, Sphincs_Hash_Type::Sha256}; 24| 0| } 25| 12| if(name == "SphincsPlus-sha2-128f-r3.1") { ------------------ | Branch (25:7): [True: 0, False: 12] ------------------ 26| 0| return {Sphincs_Parameter_Set::Sphincs128Fast, Sphincs_Hash_Type::Sha256}; 27| 0| } 28| 12| if(name == "SphincsPlus-sha2-192s-r3.1") { ------------------ | Branch (28:7): [True: 0, False: 12] ------------------ 29| 0| return {Sphincs_Parameter_Set::Sphincs192Small, Sphincs_Hash_Type::Sha256}; 30| 0| } 31| 12| if(name == "SphincsPlus-sha2-192f-r3.1") { ------------------ | Branch (31:7): [True: 0, False: 12] ------------------ 32| 0| return {Sphincs_Parameter_Set::Sphincs192Fast, Sphincs_Hash_Type::Sha256}; 33| 0| } 34| 12| if(name == "SphincsPlus-sha2-256s-r3.1") { ------------------ | Branch (34:7): [True: 0, False: 12] ------------------ 35| 0| return {Sphincs_Parameter_Set::Sphincs256Small, Sphincs_Hash_Type::Sha256}; 36| 0| } 37| 12| if(name == "SphincsPlus-sha2-256f-r3.1") { ------------------ | Branch (37:7): [True: 0, False: 12] ------------------ 38| 0| return {Sphincs_Parameter_Set::Sphincs256Fast, Sphincs_Hash_Type::Sha256}; 39| 0| } 40| | 41| 12| if(name == "SphincsPlus-shake-128s-r3.1") { ------------------ | Branch (41:7): [True: 0, False: 12] ------------------ 42| 0| return {Sphincs_Parameter_Set::Sphincs128Small, Sphincs_Hash_Type::Shake256}; 43| 0| } 44| 12| if(name == "SphincsPlus-shake-128f-r3.1") { ------------------ | Branch (44:7): [True: 0, False: 12] ------------------ 45| 0| return {Sphincs_Parameter_Set::Sphincs128Fast, Sphincs_Hash_Type::Shake256}; 46| 0| } 47| 12| if(name == "SphincsPlus-shake-192s-r3.1") { ------------------ | Branch (47:7): [True: 0, False: 12] ------------------ 48| 0| return {Sphincs_Parameter_Set::Sphincs192Small, Sphincs_Hash_Type::Shake256}; 49| 0| } 50| 12| if(name == "SphincsPlus-shake-192f-r3.1") { ------------------ | Branch (50:7): [True: 0, False: 12] ------------------ 51| 0| return {Sphincs_Parameter_Set::Sphincs192Fast, Sphincs_Hash_Type::Shake256}; 52| 0| } 53| 12| if(name == "SphincsPlus-shake-256s-r3.1") { ------------------ | Branch (53:7): [True: 0, False: 12] ------------------ 54| 0| return {Sphincs_Parameter_Set::Sphincs256Small, Sphincs_Hash_Type::Shake256}; 55| 0| } 56| 12| if(name == "SphincsPlus-shake-256f-r3.1") { ------------------ | Branch (56:7): [True: 0, False: 12] ------------------ 57| 0| return {Sphincs_Parameter_Set::Sphincs256Fast, Sphincs_Hash_Type::Shake256}; 58| 0| } 59| | 60| 12| if(name == "SphincsPlus-haraka-128s-r3.1") { ------------------ | Branch (60:7): [True: 0, False: 12] ------------------ 61| 0| return {Sphincs_Parameter_Set::Sphincs128Small, Sphincs_Hash_Type::Haraka}; 62| 0| } 63| 12| if(name == "SphincsPlus-haraka-128f-r3.1") { ------------------ | Branch (63:7): [True: 0, False: 12] ------------------ 64| 0| return {Sphincs_Parameter_Set::Sphincs128Fast, Sphincs_Hash_Type::Haraka}; 65| 0| } 66| 12| if(name == "SphincsPlus-haraka-192s-r3.1") { ------------------ | Branch (66:7): [True: 0, False: 12] ------------------ 67| 0| return {Sphincs_Parameter_Set::Sphincs192Small, Sphincs_Hash_Type::Haraka}; 68| 0| } 69| 12| if(name == "SphincsPlus-haraka-192f-r3.1") { ------------------ | Branch (69:7): [True: 0, False: 12] ------------------ 70| 0| return {Sphincs_Parameter_Set::Sphincs192Fast, Sphincs_Hash_Type::Haraka}; 71| 0| } 72| 12| if(name == "SphincsPlus-haraka-256s-r3.1") { ------------------ | Branch (72:7): [True: 0, False: 12] ------------------ 73| 0| return {Sphincs_Parameter_Set::Sphincs256Small, Sphincs_Hash_Type::Haraka}; 74| 0| } 75| 12| if(name == "SphincsPlus-haraka-256f-r3.1") { ------------------ | Branch (75:7): [True: 0, False: 12] ------------------ 76| 0| return {Sphincs_Parameter_Set::Sphincs256Fast, Sphincs_Hash_Type::Haraka}; 77| 0| } 78| | 79| | // SLH-DSA instances WITHOUT prehash mode 80| 12| if(name == "SLH-DSA-SHA2-128s") { ------------------ | Branch (80:7): [True: 1, False: 11] ------------------ 81| 1| return {Sphincs_Parameter_Set::SLHDSA128Small, Sphincs_Hash_Type::Sha256}; 82| 1| } 83| 11| if(name == "SLH-DSA-SHA2-128f") { ------------------ | Branch (83:7): [True: 1, False: 10] ------------------ 84| 1| return {Sphincs_Parameter_Set::SLHDSA128Fast, Sphincs_Hash_Type::Sha256}; 85| 1| } 86| 10| if(name == "SLH-DSA-SHA2-192s") { ------------------ | Branch (86:7): [True: 1, False: 9] ------------------ 87| 1| return {Sphincs_Parameter_Set::SLHDSA192Small, Sphincs_Hash_Type::Sha256}; 88| 1| } 89| 9| if(name == "SLH-DSA-SHA2-192f") { ------------------ | Branch (89:7): [True: 1, False: 8] ------------------ 90| 1| return {Sphincs_Parameter_Set::SLHDSA192Fast, Sphincs_Hash_Type::Sha256}; 91| 1| } 92| 8| if(name == "SLH-DSA-SHA2-256s") { ------------------ | Branch (92:7): [True: 1, False: 7] ------------------ 93| 1| return {Sphincs_Parameter_Set::SLHDSA256Small, Sphincs_Hash_Type::Sha256}; 94| 1| } 95| 7| if(name == "SLH-DSA-SHA2-256f") { ------------------ | Branch (95:7): [True: 1, False: 6] ------------------ 96| 1| return {Sphincs_Parameter_Set::SLHDSA256Fast, Sphincs_Hash_Type::Sha256}; 97| 1| } 98| | 99| 6| if(name == "SLH-DSA-SHAKE-128s") { ------------------ | Branch (99:7): [True: 1, False: 5] ------------------ 100| 1| return {Sphincs_Parameter_Set::SLHDSA128Small, Sphincs_Hash_Type::Shake256}; 101| 1| } 102| 5| if(name == "SLH-DSA-SHAKE-128f") { ------------------ | Branch (102:7): [True: 1, False: 4] ------------------ 103| 1| return {Sphincs_Parameter_Set::SLHDSA128Fast, Sphincs_Hash_Type::Shake256}; 104| 1| } 105| 4| if(name == "SLH-DSA-SHAKE-192s") { ------------------ | Branch (105:7): [True: 1, False: 3] ------------------ 106| 1| return {Sphincs_Parameter_Set::SLHDSA192Small, Sphincs_Hash_Type::Shake256}; 107| 1| } 108| 3| if(name == "SLH-DSA-SHAKE-192f") { ------------------ | Branch (108:7): [True: 1, False: 2] ------------------ 109| 1| return {Sphincs_Parameter_Set::SLHDSA192Fast, Sphincs_Hash_Type::Shake256}; 110| 1| } 111| 2| if(name == "SLH-DSA-SHAKE-256s") { ------------------ | Branch (111:7): [True: 1, False: 1] ------------------ 112| 1| return {Sphincs_Parameter_Set::SLHDSA256Small, Sphincs_Hash_Type::Shake256}; 113| 1| } 114| 1| if(name == "SLH-DSA-SHAKE-256f") { ------------------ | Branch (114:7): [True: 1, False: 0] ------------------ 115| 1| return {Sphincs_Parameter_Set::SLHDSA256Fast, Sphincs_Hash_Type::Shake256}; 116| 1| } 117| | 118| | // The pre-hash variants (HashSLH-DSA) are not currently implemented 119| 0| if(name.starts_with("Hash-SLH-DSA-")) { ------------------ | Branch (119:7): [True: 0, False: 0] ------------------ 120| 0| throw Not_Implemented(fmt("Pre-hash SLH-DSA ({}) is not supported", name)); 121| 0| } 122| | 123| 0| throw Lookup_Error(fmt("No SLH-DSA (or SPHINCS+) parameter supported for: {}", name)); 124| 0|} _ZN5Botan21SphincsPlus_PublicKeyC1ENSt3__14spanIKhLm18446744073709551615EEENS_18Sphincs_ParametersE: 135| 12| m_public(std::make_shared(params, pub_key)) { 136| 12| if(!params.is_available()) { ------------------ | Branch (136:7): [True: 0, False: 12] ------------------ 137| 0| throw Not_Implemented("This SPHINCS+ parameter set is not available in this configuration"); 138| 0| } 139| 12|} _ZN5Botan21SphincsPlus_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 142| 12| SphincsPlus_PublicKey(key_bits, Sphincs_Parameters::create(alg_id.oid())) { 143| | // The parameter set is identified by the OID; no parameters are defined. 144| 12| if(!alg_id.parameters_are_empty()) { ------------------ | Branch (144:7): [True: 0, False: 12] ------------------ 145| 0| throw Decoding_Error("Unexpected parameters for SLH-DSA/SPHINCS+ public key"); 146| 0| } 147| 12|} _ZN5Botan29SphincsPlus_PublicKeyInternalC2ENS_18Sphincs_ParametersENSt3__14spanIKhLm18446744073709551615EEE: 75| 12| SphincsPlus_PublicKeyInternal(Sphincs_Parameters params, std::span key_bits) : m_params(params) { 76| 12| if(key_bits.size() != m_params.public_key_bytes()) { ------------------ | Branch (76:13): [True: 12, False: 0] ------------------ 77| 12| throw Decoding_Error("SLH-DSA (or SPHINCS+) Public Key doesn't have the expected length"); 78| 12| } 79| | 80| 0| BufferSlicer s(key_bits); 81| 0| m_public_seed = s.copy(params.n()); 82| 0| m_sphincs_root = s.copy(params.n()); 83| | 84| 0| BOTAN_ASSERT_NOMSG(s.empty()); ------------------ | | 84| 0| do { \ | | 85| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 0| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 0] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 0| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 0] | | ------------------ ------------------ 85| 0| } _ZN5Botan15ecp_work_factorEm: 16| 1.20k|size_t ecp_work_factor(size_t bits) { 17| 1.20k| return bits / 2; 18| 1.20k|} _ZN5Botan14if_work_factorEm: 37| 330|size_t if_work_factor(size_t bits) { 38| 330| if(bits < 512) { ------------------ | Branch (38:7): [True: 1, False: 329] ------------------ 39| 1| return 0; 40| 1| } 41| | 42| | // RFC 3766 estimates k at .02 and o(1) to be effectively zero for sizes of interest 43| | 44| 329| const double log2_k = -5.6438; // log2(.02) 45| 329| return nfs_workfactor(bits, log2_k); 46| 330|} _ZN5Botan14dl_work_factorEm: 48| 87|size_t dl_work_factor(size_t bits) { 49| | // Lacking better estimates... 50| 87| return if_work_factor(bits); 51| 87|} _ZN5Botan16dl_exponent_sizeEm: 53| 87|size_t dl_exponent_size(size_t p_bits) { 54| 87| BOTAN_ARG_CHECK(p_bits > 1, "Invalid prime length"); ------------------ | | 35| 87| do { \ | | 36| 87| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 87| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 87] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 87| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 87] | | ------------------ ------------------ 55| | 56| | /* 57| | For relevant sizes we follow the suggestions in 58| | NIST SP 800-56B Rev 2 Appendix D 59| | "Maximum Security Strength Estimates for IFC Modulus Lengths" 60| | 61| | For sizes outside the range considered in the SP we use some sensible values 62| | 63| | Note that we return twice the value given in Table 4 since we are choosing 64| | the exponent size as twice the estimated security strength. 65| | 66| | See also NIST SP 800-56A Rev 3 Appendix D, Tables 25 and 26 67| | */ 68| | 69| 87| if(p_bits <= 256) { ------------------ | Branch (69:7): [True: 1, False: 86] ------------------ 70| | /* 71| | * For stupidly small groups we might return a value larger than the group 72| | * size if we fell into the conditionals below. Just use the maximum 73| | * possible exponent size - for all the good it will do you with a group 74| | * this weak. 75| | */ 76| 1| return p_bits - 1; 77| 86| } else if(p_bits <= 1024) { ------------------ | Branch (77:14): [True: 4, False: 82] ------------------ 78| | /* 79| | Not in the SP, but general estimates are that a 1024 bit group provides at 80| | most 80 bits security, so using an exponent appropriate for 96 bit security 81| | is more than sufficient. 82| | */ 83| 4| return 192; 84| 82| } else if(p_bits <= 2048) { ------------------ | Branch (84:14): [True: 82, False: 0] ------------------ 85| 82| return 224; // SP 800-56B 86| 82| } else if(p_bits <= 3072) { ------------------ | Branch (86:14): [True: 0, False: 0] ------------------ 87| 0| return 256; // SP 800-56B 88| 0| } else if(p_bits <= 4096) { ------------------ | Branch (88:14): [True: 0, False: 0] ------------------ 89| 0| return 304; // SP 800-56B 90| 0| } else if(p_bits <= 6144) { ------------------ | Branch (90:14): [True: 0, False: 0] ------------------ 91| 0| return 352; // SP 800-56B 92| 0| } else if(p_bits <= 8192) { ------------------ | Branch (92:14): [True: 0, False: 0] ------------------ 93| 0| return 400; // SP 800-56B 94| 0| } else { 95| | // For values larger than we know about, just saturate to 256 bit security 96| | // which is Good Enough for FFDH 97| | // 98| | // NIST puts 15360 bit groups at exactly 256 bits security 99| 0| return 512; 100| 0| } 101| 87|} workfactor.cpp:_ZN5Botan12_GLOBAL__N_114nfs_workfactorEmd: 22| 329|size_t nfs_workfactor(size_t bits, double log2_k) { 23| | // approximates natural logarithm of an integer of given bitsize 24| 329| const double log_p = static_cast(bits) / std::numbers::log2e; 25| | 26| 329| const double log_log_p = std::log(log_p); 27| | 28| | // RFC 3766: k * e^((1.92 + o(1)) * cubrt(ln(n) * (ln(ln(n)))^2)) 29| 329| const double est = 1.92 * std::pow(log_p * log_log_p * log_log_p, 1.0 / 3.0); 30| | 31| | // return log2 of the workfactor 32| 329| return static_cast(log2_k + std::numbers::log2e * est); 33| 329|} _ZN5Botan4X5098load_keyERNS_10DataSourceE: 28| 3.55k|std::unique_ptr load_key(DataSource& source) { 29| 3.55k| try { 30| 3.55k| AlgorithmIdentifier alg_id; 31| 3.55k| std::vector key_bits; 32| | 33| 3.55k| if(ASN1::maybe_BER(source) && !PEM_Code::matches(source)) { ------------------ | Branch (33:10): [True: 3.55k, False: 0] | Branch (33:37): [True: 3.55k, False: 0] ------------------ 34| 3.55k| BER_Decoder(source, BER_Decoder::Limits::DER()) 35| 3.55k| .start_sequence() 36| 3.55k| .decode(alg_id) 37| 3.55k| .decode_octet_aligned_bitstring(key_bits) 38| 3.55k| .end_cons() 39| 3.55k| .verify_end(); 40| 3.55k| } else { 41| 0| DataSource_Memory ber(PEM_Code::decode_check_label(source, "PUBLIC KEY")); 42| | 43| 0| BER_Decoder(ber, BER_Decoder::Limits::DER()) 44| 0| .start_sequence() 45| 0| .decode(alg_id) 46| 0| .decode_octet_aligned_bitstring(key_bits) 47| 0| .end_cons() 48| 0| .verify_end(); 49| 0| } 50| | 51| 3.55k| if(key_bits.empty()) { ------------------ | Branch (51:10): [True: 0, False: 3.55k] ------------------ 52| 0| throw Decoding_Error("X.509 public key decoding"); 53| 0| } 54| | 55| 3.55k| return load_public_key(alg_id, key_bits); 56| 3.55k| } catch(Decoding_Error& e) { 57| 2.04k| throw Decoding_Error("X.509 public key decoding", e); 58| 2.04k| } 59| 3.55k|} _ZN5Botan13AlgorithmSpec10parse_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERmmb: 28| 456|AlgorithmSpec AlgorithmSpec::parse_name(std::string_view text, size_t& pos, size_t depth, bool mode_syntax) { 29| 456| if(depth > MaxNestingDepth) { ------------------ | Branch (29:7): [True: 0, False: 456] ------------------ 30| 0| throw Invalid_Algorithm_Name(text); 31| 0| } 32| | 33| | // The '/' separator is only significant at the top level of a cipher mode 34| 456| const bool slash_separates = mode_syntax && (depth == 0); ------------------ | Branch (34:33): [True: 0, False: 456] | Branch (34:48): [True: 0, False: 0] ------------------ 35| 456| const size_t start = pos; 36| | 37| 3.84k| while(pos < text.size() && !is_spec_separator(text[pos], slash_separates)) { ------------------ | Branch (37:10): [True: 3.84k, False: 0] | Branch (37:31): [True: 3.39k, False: 456] ------------------ 38| 3.39k| ++pos; 39| 3.39k| } 40| | 41| 456| AlgorithmSpec node; 42| 456| node.m_head = std::string(text.substr(start, pos - start)); 43| | 44| 456| if(node.m_head.empty()) { ------------------ | Branch (44:7): [True: 0, False: 456] ------------------ 45| 0| throw Invalid_Algorithm_Name(text); 46| 0| } 47| | 48| 456| if(pos < text.size() && text[pos] == '(') { ------------------ | Branch (48:7): [True: 456, False: 0] | Branch (48:28): [True: 228, False: 228] ------------------ 49| 228| do { // NOLINT(*-avoid-do-while) 50| 228| ++pos; // skip the '(' or ',' 51| 228| node.m_args.push_back(parse_name(text, pos, depth + 1, mode_syntax)); 52| 228| } while(pos < text.size() && text[pos] == ','); ------------------ | Branch (52:15): [True: 228, False: 0] | Branch (52:36): [True: 0, False: 228] ------------------ 53| | 54| 228| if(pos >= text.size() || text[pos] != ')') { ------------------ | Branch (54:10): [True: 0, False: 228] | Branch (54:32): [True: 0, False: 228] ------------------ 55| 0| throw Invalid_Algorithm_Name(text); 56| 0| } 57| 228| ++pos; 58| 228| } 59| | 60| 456| node.m_text = std::string(text.substr(start, pos - start)); 61| 456| return node; 62| 456|} _ZN5Botan13AlgorithmSpecC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS0_6SyntaxE: 64| 228|AlgorithmSpec::AlgorithmSpec(std::string_view spec, Syntax syntax) { 65| 228| if(spec.empty()) { ------------------ | Branch (65:7): [True: 0, False: 228] ------------------ 66| 0| throw Invalid_Algorithm_Name(spec); 67| 0| } 68| | 69| 228| const bool mode_syntax = (syntax == Syntax::CipherMode); 70| | 71| | // Fast path for a bare name such as "SHA-256", which is the common case 72| 228| if(spec.find_first_of(mode_syntax ? "(),/" : "(),") == std::string_view::npos) { ------------------ | Branch (72:7): [True: 0, False: 228] | Branch (72:26): [True: 0, False: 228] ------------------ 73| 0| m_text = std::string(spec); 74| 0| m_head = std::string(spec); 75| 0| return; 76| 0| } 77| | 78| 228| size_t pos = 0; 79| 228| std::vector parts; 80| 228| parts.push_back(parse_name(spec, pos, 0, mode_syntax)); 81| | 82| 228| while(mode_syntax && pos < spec.size() && spec[pos] == '/') { ------------------ | Branch (82:10): [True: 0, False: 228] | Branch (82:25): [True: 0, False: 0] | Branch (82:46): [True: 0, False: 0] ------------------ 83| 0| ++pos; 84| 0| parts.push_back(parse_name(spec, pos, 0, mode_syntax)); 85| 0| } 86| | 87| 228| if(pos != spec.size()) { ------------------ | Branch (87:7): [True: 0, False: 228] ------------------ 88| 0| throw Invalid_Algorithm_Name(spec); 89| 0| } 90| | 91| 228| if(parts.size() == 1) { ------------------ | Branch (91:7): [True: 228, False: 0] ------------------ 92| 228| m_head = std::move(parts[0].m_head); 93| 228| m_args = std::move(parts[0].m_args); 94| 228| } else { 95| | // Cipher/Mode(args)/Pad becomes Mode(Cipher,args,Pad) 96| 0| AlgorithmSpec& mode = parts[1]; 97| 0| m_head = std::move(mode.m_head); 98| 0| m_args.push_back(std::move(parts[0])); 99| 0| for(auto& mode_arg : mode.m_args) { ------------------ | Branch (99:26): [True: 0, False: 0] ------------------ 100| 0| m_args.push_back(std::move(mode_arg)); 101| 0| } 102| 0| for(size_t i = 2; i < parts.size(); ++i) { ------------------ | Branch (102:25): [True: 0, False: 0] ------------------ 103| 0| m_args.push_back(std::move(parts[i])); 104| 0| } 105| 0| } 106| | 107| 228| m_text = std::string(spec); 108| 228|} _ZNKR5Botan13AlgorithmSpec5matchERKNS_16AlgorithmPatternE: 132| 228|std::optional AlgorithmSpec::match(const AlgorithmPattern& pattern) const& { 133| | // Factories try many patterns in turn, so reject on the head before 134| | // setting up the (fairly large) match object 135| 228| if(!pattern.any_head()) { ------------------ | Branch (135:7): [True: 228, False: 0] ------------------ 136| 228| bool head_matches = false; 137| 228| for(const auto alt : pattern.head_alternatives()) { ------------------ | Branch (137:26): [True: 228, False: 0] ------------------ 138| 228| if(alt == m_head) { ------------------ | Branch (138:13): [True: 228, False: 0] ------------------ 139| 228| head_matches = true; 140| 228| break; 141| 228| } 142| 228| } 143| 228| if(!head_matches) { ------------------ | Branch (143:10): [True: 0, False: 228] ------------------ 144| 0| return std::nullopt; 145| 0| } 146| 228| } 147| | 148| 228| AlgorithmMatch m(pattern, *this); 149| | 150| 228| size_t idx = 0; 151| 228| if(!match_args(pattern.elements(), idx, 0, m)) { ------------------ | Branch (151:7): [True: 0, False: 228] ------------------ 152| 0| return std::nullopt; 153| 0| } 154| | 155| 228| return m; 156| 228|} _ZNK5Botan13AlgorithmSpec10match_argsENSt3__14spanIKNS_16AlgorithmPattern7ElementELm18446744073709551615EEERmhRNS_14AlgorithmMatchE: 161| 228| AlgorithmMatch& m) const { 162| 228| using Type = AlgorithmPattern::Type; 163| | 164| 228| size_t arg_idx = 0; 165| | 166| 456| while(idx < elems.size() && elems[idx].depth == depth) { ------------------ | Branch (166:10): [True: 228, False: 228] | Branch (166:32): [True: 228, False: 0] ------------------ 167| 228| const auto& e = elems[idx]; 168| 228| ++idx; 169| | 170| 228| if(arg_idx >= m_args.size()) { ------------------ | Branch (170:10): [True: 0, False: 228] ------------------ 171| | // No argument was provided for this element 172| 0| if(!e.optional) { ------------------ | Branch (172:13): [True: 0, False: 0] ------------------ 173| 0| return false; 174| 0| } 175| | 176| 0| if(e.placeholder && e.has_default) { ------------------ | Branch (176:13): [True: 0, False: 0] | Branch (176:30): [True: 0, False: 0] ------------------ 177| 0| auto& b = m.declared(e.text); 178| 0| b.bound = true; 179| 0| b.text = e.default_value; 180| 0| if(e.type == Type::Int) { ------------------ | Branch (180:16): [True: 0, False: 0] ------------------ 181| | // The pattern parser already checked this is a canonical decimal 182| 0| const auto v = parse_sz(e.default_value, true); 183| 0| BOTAN_ASSERT_NOMSG(v.has_value()); ------------------ | | 84| 0| do { \ | | 85| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 0| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 0] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 0| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 0] | | ------------------ ------------------ 184| 0| b.integer = *v; 185| 0| } 186| 0| } 187| | 188| 0| continue; 189| 0| } 190| | 191| 228| const AlgorithmSpec& arg = m_args[arg_idx]; 192| | 193| 228| if(e.variadic) { ------------------ | Branch (193:10): [True: 0, False: 228] ------------------ 194| 0| auto& b = m.declared(e.text); 195| 0| b.bound = true; 196| 0| b.rest = std::span(m_args).subspan(arg_idx); 197| 0| arg_idx = m_args.size(); 198| 0| continue; 199| 0| } 200| | 201| 228| if(e.placeholder) { ------------------ | Branch (201:10): [True: 228, False: 0] ------------------ 202| 228| auto& b = m.declared(e.text); 203| | 204| 228| if(e.type == Type::Int) { ------------------ | Branch (204:13): [True: 0, False: 228] ------------------ 205| 0| if(!arg.m_args.empty()) { ------------------ | Branch (205:16): [True: 0, False: 0] ------------------ 206| 0| return false; 207| 0| } 208| 0| const auto v = parse_sz(arg.m_text, true); 209| 0| if(!v) { ------------------ | Branch (209:16): [True: 0, False: 0] ------------------ 210| 0| return false; 211| 0| } 212| 0| b.integer = *v; 213| 0| } 214| | 215| 228| b.bound = true; 216| 228| b.text = arg.m_text; 217| 228| b.node = &arg; 218| 228| } else if(e.optional) { ------------------ | Branch (218:17): [True: 0, False: 0] ------------------ 219| | // An optional literal which is not present is skipped without consuming the argument 220| 0| if(arg.m_head != e.text || !arg.m_args.empty()) { ------------------ | Branch (220:13): [True: 0, False: 0] | Branch (220:37): [True: 0, False: 0] ------------------ 221| 0| continue; 222| 0| } 223| 0| } else { 224| 0| if(arg.m_head != e.text) { ------------------ | Branch (224:13): [True: 0, False: 0] ------------------ 225| 0| return false; 226| 0| } 227| | 228| 0| if(idx < elems.size() && elems[idx].depth == depth + 1) { ------------------ | Branch (228:13): [True: 0, False: 0] | Branch (228:35): [True: 0, False: 0] ------------------ 229| 0| if(!arg.match_args(elems, idx, depth + 1, m)) { ------------------ | Branch (229:16): [True: 0, False: 0] ------------------ 230| 0| return false; 231| 0| } 232| 0| } else if(!arg.m_args.empty()) { ------------------ | Branch (232:20): [True: 0, False: 0] ------------------ 233| 0| return false; 234| 0| } 235| 0| } 236| | 237| 228| ++arg_idx; 238| 228| } 239| | 240| 228| return arg_idx == m_args.size(); 241| 228|} _ZN5Botan14AlgorithmMatchC2ERKNS_16AlgorithmPatternERKNS_13AlgorithmSpecE: 244| 228| m_pattern(pattern.to_string()), m_head(spec.head()) { 245| 228| for(const auto& e : pattern.elements()) { ------------------ | Branch (245:22): [True: 228, False: 228] ------------------ 246| 228| if(e.placeholder) { ------------------ | Branch (246:10): [True: 228, False: 0] ------------------ 247| 228| Binding b; 248| 228| b.var = e.text; 249| 228| b.type = e.type; 250| 228| b.variadic = e.variadic; 251| 228| m_bindings[m_binding_count++] = b; 252| 228| } 253| 228| } 254| 228|} _ZN5Botan14AlgorithmMatch8declaredENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 256| 228|AlgorithmMatch::Binding& AlgorithmMatch::declared(std::string_view var) { 257| 228| for(size_t i = 0; i != m_binding_count; ++i) { ------------------ | Branch (257:22): [True: 228, False: 0] ------------------ 258| 228| if(m_bindings[i].var == var) { ------------------ | Branch (258:10): [True: 228, False: 0] ------------------ 259| 228| return m_bindings[i]; 260| 228| } 261| 228| } 262| 0| throw Internal_Error(fmt("AlgorithmMatch: no variable '{}' in pattern '{}'", var, m_pattern)); 263| 228|} _ZNK5Botan14AlgorithmMatch5boundENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPKc: 265| 228|const AlgorithmMatch::Binding& AlgorithmMatch::bound(std::string_view var, const char* accessor) const { 266| 228| for(size_t i = 0; i != m_binding_count; ++i) { ------------------ | Branch (266:22): [True: 228, False: 0] ------------------ 267| 228| if(m_bindings[i].var == var) { ------------------ | Branch (267:10): [True: 228, False: 0] ------------------ 268| 228| if(!m_bindings[i].bound) { ------------------ | Branch (268:13): [True: 0, False: 228] ------------------ 269| 0| throw Internal_Error( 270| 0| fmt("AlgorithmMatch::{}: variable '{}' in pattern '{}' was not bound; check has() first", 271| 0| accessor, 272| 0| var, 273| 0| m_pattern)); 274| 0| } 275| 228| return m_bindings[i]; 276| 228| } 277| 228| } 278| 0| throw Internal_Error(fmt("AlgorithmMatch::{}: no variable '{}' in pattern '{}'", accessor, var, m_pattern)); 279| 228|} _ZNK5Botan14AlgorithmMatch3strENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 290| 228|std::string_view AlgorithmMatch::str(std::string_view var) const { 291| 228| const auto& b = bound(var, "str"); 292| 228| if(b.variadic) { ------------------ | Branch (292:7): [True: 0, False: 228] ------------------ 293| 0| throw Internal_Error(fmt("AlgorithmMatch::str: variable '{}' in pattern '{}' is variadic", var, m_pattern)); 294| 0| } 295| 228| return b.text; 296| 228|} algorithm_spec.cpp:_ZN5Botan12_GLOBAL__N_117is_spec_separatorEcb: 21| 3.84k|bool is_spec_separator(char c, bool slash_separates) { 22| 3.84k| return c == '(' || c == ')' || c == ',' || (slash_separates && c == '/'); ------------------ | Branch (22:11): [True: 228, False: 3.62k] | Branch (22:23): [True: 228, False: 3.39k] | Branch (22:35): [True: 0, False: 3.39k] | Branch (22:48): [True: 0, False: 3.39k] | Branch (22:67): [True: 0, False: 0] ------------------ 23| 3.84k|} _ZN5Botan15allocate_memoryEmm: 21| 382k|BOTAN_MALLOC_FN void* allocate_memory(size_t elems, size_t elem_size) { 22| 382k| if(elems == 0 || elem_size == 0) { ------------------ | Branch (22:7): [True: 0, False: 382k] | Branch (22:21): [True: 0, False: 382k] ------------------ 23| 0| return nullptr; 24| 0| } 25| | 26| | // Some calloc implementations do not check for overflow (?!?) 27| 382k| if(!checked_mul(elems, elem_size).has_value()) { ------------------ | Branch (27:7): [True: 0, False: 382k] ------------------ 28| 0| throw std::bad_alloc(); 29| 0| } 30| | 31| |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR) 32| | // NOLINTNEXTLINE(*-const-correctness) bug in clang-tidy 33| | if(void* p = mlock_allocator::instance().allocate(elems, elem_size)) { 34| | return p; 35| | } 36| |#endif 37| | 38| |#if defined(BOTAN_TARGET_OS_HAS_ALLOC_CONCEAL) 39| | void* ptr = ::calloc_conceal(elems, elem_size); 40| |#else 41| | // NOLINTNEXTLINE(*-const-correctness) bug in clang-tidy 42| 382k| void* ptr = std::calloc(elems, elem_size); // NOLINT(*-no-malloc,*-owning-memory) 43| 382k|#endif 44| 382k| if(ptr == nullptr) { ------------------ | Branch (44:7): [True: 0, False: 382k] ------------------ 45| 0| [[unlikely]] throw std::bad_alloc(); 46| 0| } 47| 382k| return ptr; 48| 382k|} _ZN5Botan17deallocate_memoryEPvmm: 50| 382k|void deallocate_memory(void* p, size_t elems, size_t elem_size) { 51| 382k| if(p == nullptr) { ------------------ | Branch (51:7): [True: 0, False: 382k] ------------------ 52| 0| [[unlikely]] return; 53| 0| } 54| | 55| 382k| secure_scrub_memory(p, elems * elem_size); 56| | 57| |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR) 58| | if(mlock_allocator::instance().deallocate(p, elems, elem_size)) { 59| | return; 60| | } 61| |#endif 62| | 63| 382k| std::free(p); // NOLINT(*-no-malloc,*-owning-memory) 64| 382k|} _ZN5Botan20initialize_allocatorEv: 66| 1|void initialize_allocator() { 67| |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR) 68| | mlock_allocator::instance(); 69| |#endif 70| 1|} _ZN5Botan22throw_invalid_argumentEPKcS1_S1_: 23| 26|void throw_invalid_argument(const char* message, const char* func, const char* file) { 24| 26| throw Invalid_Argument(fmt("{} in {}:{}", message, func, file)); 25| 26|} _ZN5Botan14calendar_pointC2ERKNSt3__16chrono10time_pointINS2_12system_clockENS2_8durationIxNS1_5ratioILl1ELl1000000EEEEEEE: 128| 3.60k|calendar_point::calendar_point(const std::chrono::system_clock::time_point& time_point) { 129| 3.60k| const auto [year, month, day, hour, minute, second] = civil_from_time_point(time_point); 130| | 131| 3.60k| BOTAN_ARG_CHECK(year <= 9999, "Year is outside representable range"); ------------------ | | 35| 3.60k| do { \ | | 36| 3.60k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 3.60k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 3.60k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 3.60k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 3.60k] | | ------------------ ------------------ 132| | 133| 3.60k| m_year = static_cast(year); 134| 3.60k| m_month = static_cast(month); 135| 3.60k| m_day = static_cast(day); 136| 3.60k| m_hour = static_cast(hour); 137| 3.60k| m_minutes = static_cast(minute); 138| 3.60k| m_seconds = static_cast(second); 139| 3.60k|} calendar.cpp:_ZN5Botan12_GLOBAL__N_121civil_from_time_pointERKNSt3__16chrono10time_pointINS2_12system_clockENS2_8durationIxNS1_5ratioILl1ELl1000000EEEEEEE: 50| 3.60k|std::array civil_from_time_point(const std::chrono::system_clock::time_point& tp) { 51| 3.60k| const int64_t t = static_cast(std::chrono::system_clock::to_time_t(tp)); 52| | 53| | // Split into days since epoch and seconds within the day, flooring towards 54| | // negative infinity so that times before the epoch are handled correctly. 55| 3.60k| int64_t days = t / 86400; 56| 3.60k| int64_t tod = t % 86400; 57| 3.60k| if(tod < 0) { ------------------ | Branch (57:7): [True: 0, False: 3.60k] ------------------ 58| 0| tod += 86400; 59| 0| days -= 1; 60| 0| } 61| | 62| 3.60k| const int64_t z = days + 719468; 63| 3.60k| const int64_t era = (z >= 0 ? z : z - 146096) / 146097; ------------------ | Branch (63:25): [True: 3.60k, False: 0] ------------------ 64| 3.60k| const int64_t doe = z - era * 146097; // [0, 146096] 65| 3.60k| const int64_t yoe = (doe - doe / 1460 + doe / 36524 - doe / 146096) / 365; // [0, 399] 66| 3.60k| const int64_t y = yoe + era * 400; 67| 3.60k| const int64_t doy = doe - (365 * yoe + yoe / 4 - yoe / 100); // [0, 365] 68| 3.60k| const int64_t mp = (5 * doy + 2) / 153; // [0, 11] 69| 3.60k| const int64_t day = doy - (153 * mp + 2) / 5 + 1; // [1, 31] 70| 3.60k| const int64_t month = mp < 10 ? mp + 3 : mp - 9; // [1, 12] ------------------ | Branch (70:26): [True: 3.60k, False: 0] ------------------ 71| 3.60k| const int64_t year = y + (month <= 2 ? 1 : 0); ------------------ | Branch (71:30): [True: 0, False: 3.60k] ------------------ 72| | 73| 3.60k| return {static_cast(year), 74| 3.60k| static_cast(month), 75| 3.60k| static_cast(day), 76| 3.60k| static_cast(tod / 3600), 77| 3.60k| static_cast((tod % 3600) / 60), 78| 3.60k| static_cast(tod % 60)}; 79| 3.60k|} _ZN5Botan19next_utf8_codepointENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEERm: 53| 304k|uint32_t next_utf8_codepoint(std::string_view utf8, size_t& pos) { 54| 304k| const auto read_continuation = [&]() -> uint32_t { 55| 304k| if(pos >= utf8.size()) { 56| 304k| throw Decoding_Error("Invalid UTF-8 sequence"); 57| 304k| } 58| 304k| const uint8_t b = static_cast(utf8[pos++]); 59| 304k| if((b & 0xC0) != 0x80) { 60| 304k| throw Decoding_Error("Invalid UTF-8 sequence"); 61| 304k| } 62| 304k| return b & 0x3F; 63| 304k| }; 64| | 65| 304k| if(pos >= utf8.size()) { ------------------ | Branch (65:7): [True: 0, False: 304k] ------------------ 66| 0| throw Decoding_Error("Invalid UTF-8 sequence"); 67| 0| } 68| 304k| const uint8_t lead = static_cast(utf8[pos++]); 69| 304k| uint32_t c = 0; 70| | 71| 304k| if(lead <= 0x7F) { ------------------ | Branch (71:7): [True: 300k, False: 4.30k] ------------------ 72| 300k| c = lead; 73| 300k| } else if((lead & 0xE0) == 0xC0) { ------------------ | Branch (73:14): [True: 2.44k, False: 1.85k] ------------------ 74| 2.44k| c = (lead & 0x1F) << 6; 75| 2.44k| c |= read_continuation(); 76| 2.44k| if(c < 0x80) { ------------------ | Branch (76:10): [True: 26, False: 2.41k] ------------------ 77| 26| throw Decoding_Error("Overlong UTF-8 sequence"); 78| 26| } 79| 2.44k| } else if((lead & 0xF0) == 0xE0) { ------------------ | Branch (79:14): [True: 398, False: 1.46k] ------------------ 80| 398| c = (lead & 0x0F) << 12; 81| 398| c |= read_continuation() << 6; 82| 398| c |= read_continuation(); 83| 398| if(c < 0x800) { ------------------ | Branch (83:10): [True: 8, False: 390] ------------------ 84| 8| throw Decoding_Error("Overlong UTF-8 sequence"); 85| 8| } 86| 1.46k| } else if((lead & 0xF8) == 0xF0) { ------------------ | Branch (86:14): [True: 175, False: 1.28k] ------------------ 87| 175| c = (lead & 0x07) << 18; 88| 175| c |= read_continuation() << 12; 89| 175| c |= read_continuation() << 6; 90| 175| c |= read_continuation(); 91| 175| if(c < 0x10000) { ------------------ | Branch (91:10): [True: 6, False: 169] ------------------ 92| 6| throw Decoding_Error("Overlong UTF-8 sequence"); 93| 6| } 94| 1.28k| } else { 95| 1.28k| throw Decoding_Error("Invalid UTF-8 sequence"); 96| 1.28k| } 97| | 98| 303k| if(c > 0x10FFFF) { ------------------ | Branch (98:7): [True: 33, False: 303k] ------------------ 99| 33| throw Decoding_Error("UTF-8 sequence encodes value outside Unicode range"); 100| 33| } 101| 303k| if(c >= 0xD800 && c < 0xE000) { ------------------ | Branch (101:7): [True: 64, False: 303k] | Branch (101:22): [True: 8, False: 56] ------------------ 102| 8| throw Decoding_Error("UTF-8 sequence encodes surrogate code point"); 103| 8| } 104| | 105| 303k| return c; 106| 303k|} _ZN5Botan13is_valid_utf8ENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 108| 24.6k|bool is_valid_utf8(std::string_view utf8) { 109| 24.6k| try { 110| 24.6k| size_t pos = 0; 111| 329k| while(pos < utf8.size()) { ------------------ | Branch (111:13): [True: 304k, False: 24.6k] ------------------ 112| 304k| const uint32_t c = next_utf8_codepoint(utf8, pos); 113| 304k| BOTAN_UNUSED(c); ------------------ | | 151| 304k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 114| 304k| } 115| 24.6k| } catch(Decoding_Error&) { 116| 2.21k| return false; 117| 2.21k| } 118| 22.4k| return true; 119| 24.6k|} _ZN5Botan12ucs2_to_utf8ENSt3__14spanIKhLm18446744073709551615EEE: 121| 4.78k|std::string ucs2_to_utf8(std::span ucs2) { 122| 4.78k| if(ucs2.size() % 2 != 0) { ------------------ | Branch (122:7): [True: 1, False: 4.78k] ------------------ 123| 1| throw Decoding_Error("Invalid length for UCS-2 string"); 124| 1| } 125| | 126| 4.78k| const size_t chars = ucs2.size() / 2; 127| | 128| 4.78k| std::string s; 129| 11.9k| for(size_t i = 0; i != chars; ++i) { ------------------ | Branch (129:22): [True: 7.14k, False: 4.78k] ------------------ 130| 7.14k| const uint32_t c = load_be(ucs2.data(), i); 131| 7.14k| append_utf8_for(s, c); 132| 7.14k| } 133| | 134| 4.78k| return s; 135| 4.78k|} _ZN5Botan12ucs4_to_utf8ENSt3__14spanIKhLm18446744073709551615EEE: 155| 284|std::string ucs4_to_utf8(std::span ucs4) { 156| 284| if(ucs4.size() % 4 != 0) { ------------------ | Branch (156:7): [True: 1, False: 283] ------------------ 157| 1| throw Decoding_Error("Invalid length for UCS-4 string"); 158| 1| } 159| | 160| 283| const size_t chars = ucs4.size() / 4; 161| | 162| 283| std::string s; 163| 527| for(size_t i = 0; i != chars; ++i) { ------------------ | Branch (163:22): [True: 244, False: 283] ------------------ 164| 244| const uint32_t c = load_be(ucs4.data(), i); 165| 244| append_utf8_for(s, c); 166| 244| } 167| | 168| 283| return s; 169| 284|} _ZN5Botan14latin1_to_utf8ENSt3__14spanIKhLm18446744073709551615EEE: 190| 723|std::string latin1_to_utf8(std::span chars) { 191| 723| std::string s; 192| 7.68k| for(const uint8_t b : chars) { ------------------ | Branch (192:24): [True: 7.68k, False: 723] ------------------ 193| 7.68k| append_utf8_for(s, static_cast(b)); 194| 7.68k| } 195| 723| return s; 196| 723|} _ZN5Botan21is_ascii_control_charEc: 198| 54|bool is_ascii_control_char(char c) { 199| 54| const uint8_t b = static_cast(c); 200| 54| return b < 0x20 || b == 0x7F; ------------------ | Branch (200:11): [True: 18, False: 36] | Branch (200:23): [True: 1, False: 35] ------------------ 201| 54|} _ZN5Botan23format_char_for_displayEc: 243| 54|std::string format_char_for_display(char c) { 244| 54| std::string out; 245| 54| out += '\''; 246| | 247| 54| if(c == '\t') { ------------------ | Branch (247:7): [True: 0, False: 54] ------------------ 248| 0| out += "\\t"; 249| 54| } else if(c == '\n') { ------------------ | Branch (249:14): [True: 0, False: 54] ------------------ 250| 0| out += "\\n"; 251| 54| } else if(c == '\r') { ------------------ | Branch (251:14): [True: 0, False: 54] ------------------ 252| 0| out += "\\r"; 253| 54| } else if(is_ascii_control_char(c) || static_cast(c) >= 0x80) { ------------------ | Branch (253:14): [True: 19, False: 35] | Branch (253:42): [True: 22, False: 13] ------------------ 254| 41| const auto b = static_cast(c); 255| 41| out += "\\x"; 256| 41| out += nibble_to_hex(b >> 4); 257| 41| out += nibble_to_hex(b); 258| 41| } else { 259| 13| out += c; 260| 13| } 261| | 262| 54| out += '\''; 263| | 264| 54| return out; 265| 54|} charset.cpp:_ZZN5Botan19next_utf8_codepointENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEERmENK3$_0clEv: 54| 3.52k| const auto read_continuation = [&]() -> uint32_t { 55| 3.52k| if(pos >= utf8.size()) { ------------------ | Branch (55:10): [True: 59, False: 3.46k] ------------------ 56| 59| throw Decoding_Error("Invalid UTF-8 sequence"); 57| 59| } 58| 3.46k| const uint8_t b = static_cast(utf8[pos++]); 59| 3.46k| if((b & 0xC0) != 0x80) { ------------------ | Branch (59:10): [True: 787, False: 2.68k] ------------------ 60| 787| throw Decoding_Error("Invalid UTF-8 sequence"); 61| 787| } 62| 2.68k| return b & 0x3F; 63| 3.46k| }; charset.cpp:_ZN5Botan12_GLOBAL__N_115append_utf8_forERNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEj: 17| 15.0k|void append_utf8_for(std::string& s, uint32_t c) { 18| 15.0k| if(c >= 0xD800 && c < 0xE000) { ------------------ | Branch (18:7): [True: 978, False: 14.0k] | Branch (18:22): [True: 9, False: 969] ------------------ 19| 9| throw Decoding_Error("Invalid Unicode character"); 20| 9| } 21| | 22| 15.0k| if(c <= 0x7F) { ------------------ | Branch (22:7): [True: 11.8k, False: 3.23k] ------------------ 23| 11.8k| const uint8_t b0 = static_cast(c); 24| 11.8k| s.push_back(static_cast(b0)); 25| 11.8k| } else if(c <= 0x7FF) { ------------------ | Branch (25:14): [True: 1.15k, False: 2.08k] ------------------ 26| 1.15k| const uint8_t b0 = 0xC0 | static_cast(c >> 6); 27| 1.15k| const uint8_t b1 = 0x80 | static_cast(c & 0x3F); 28| 1.15k| s.push_back(static_cast(b0)); 29| 1.15k| s.push_back(static_cast(b1)); 30| 2.08k| } else if(c <= 0xFFFF) { ------------------ | Branch (30:14): [True: 1.91k, False: 170] ------------------ 31| 1.91k| const uint8_t b0 = 0xE0 | static_cast(c >> 12); 32| 1.91k| const uint8_t b1 = 0x80 | static_cast((c >> 6) & 0x3F); 33| 1.91k| const uint8_t b2 = 0x80 | static_cast(c & 0x3F); 34| 1.91k| s.push_back(static_cast(b0)); 35| 1.91k| s.push_back(static_cast(b1)); 36| 1.91k| s.push_back(static_cast(b2)); 37| 1.91k| } else if(c <= 0x10FFFF) { ------------------ | Branch (37:14): [True: 124, False: 46] ------------------ 38| 124| const uint8_t b0 = 0xF0 | static_cast(c >> 18); 39| 124| const uint8_t b1 = 0x80 | static_cast((c >> 12) & 0x3F); 40| 124| const uint8_t b2 = 0x80 | static_cast((c >> 6) & 0x3F); 41| 124| const uint8_t b3 = 0x80 | static_cast(c & 0x3F); 42| 124| s.push_back(static_cast(b0)); 43| 124| s.push_back(static_cast(b1)); 44| 124| s.push_back(static_cast(b2)); 45| 124| s.push_back(static_cast(b3)); 46| 124| } else { 47| 46| throw Decoding_Error("Invalid Unicode character"); 48| 46| } 49| 15.0k|} _ZN5Botan5CPUID10CPUID_DataC2Ev: 80| 1|CPUID::CPUID_Data::CPUID_Data() { 81| | // NOLINTBEGIN(*-prefer-member-initializer) 82| 1|#if defined(BOTAN_HAS_CPUID_DETECTION) 83| 1| m_processor_features = detect_cpu_features(~cleared_cpuid_bits()); 84| |#else 85| | m_processor_features = 0; 86| |#endif 87| | // NOLINTEND(*-prefer-member-initializer) 88| 1|} cpuid.cpp:_ZN5Botan12_GLOBAL__N_118cleared_cpuid_bitsEv: 59| 1|uint32_t cleared_cpuid_bits() { 60| 1| uint32_t cleared = 0; 61| | 62| 1| #if defined(BOTAN_HAS_OS_UTILS) 63| 1| std::string clear_cpuid_env; 64| 1| if(OS::read_env_variable(clear_cpuid_env, "BOTAN_CLEAR_CPUID")) { ------------------ | Branch (64:7): [True: 0, False: 1] ------------------ 65| 0| for(const auto& cpuid : split_on(clear_cpuid_env, ',')) { ------------------ | Branch (65:29): [True: 0, False: 0] ------------------ 66| 0| if(auto bit = CPUID::bit_from_string(cpuid)) { ------------------ | Branch (66:18): [True: 0, False: 0] ------------------ 67| 0| cleared |= bit->as_u32(); 68| 0| } 69| 0| } 70| 0| } 71| 1| #endif 72| | 73| 1| return cleared; 74| 1|} _ZN5Botan5CPUID10CPUID_Data19detect_cpu_featuresEj: 62| 1|uint32_t CPUID::CPUID_Data::detect_cpu_features(uint32_t allowed) { 63| 1| enum class x86_CPUID_1_bits : uint64_t { 64| 1| RDTSC = (1ULL << 4), 65| 1| SSE2 = (1ULL << 26), 66| 1| CLMUL = (1ULL << 33), 67| 1| SSSE3 = (1ULL << 41), 68| 1| SSE41 = (1ULL << 51), 69| 1| POPCNT = (1ULL << 55), 70| 1| AESNI = (1ULL << 57), 71| | // AVX + OSXSAVE 72| 1| OSXSAVE = (1ULL << 59) | (1ULL << 60), 73| 1| RDRAND = (1ULL << 62) 74| 1| }; 75| | 76| 1| enum class x86_CPUID_7_bits : uint64_t { 77| 1| BMI1 = (1ULL << 3), 78| 1| AVX2 = (1ULL << 5), 79| 1| BMI2 = (1ULL << 8), 80| 1| BMI_1_AND_2 = BMI1 | BMI2, 81| 1| AVX512_F = (1ULL << 16), 82| 1| AVX512_DQ = (1ULL << 17), 83| 1| RDSEED = (1ULL << 18), 84| 1| ADX = (1ULL << 19), 85| 1| AVX512_IFMA = (1ULL << 21), 86| 1| SHA = (1ULL << 29), 87| 1| AVX512_BW = (1ULL << 30), 88| 1| AVX512_VL = (1ULL << 31), 89| 1| AVX512_VBMI = (1ULL << 33), 90| 1| AVX512_VBMI2 = (1ULL << 38), 91| 1| GFNI = (1ULL << 40), 92| 1| AVX512_VAES = (1ULL << 41), 93| 1| AVX512_VCLMUL = (1ULL << 42), 94| 1| AVX512_VBITALG = (1ULL << 44), 95| | 96| | /* 97| | We only enable AVX512 support if all of the below flags are available 98| | 99| | This is more than we strictly need for most uses, however it also has 100| | the effect of preventing execution of AVX512 codepaths on cores that 101| | have serious downclocking problems when AVX512 code executes, 102| | especially Intel Skylake. 103| | 104| | VBMI2/VBITALG are the key flags here as they restrict us to Intel Ice 105| | Lake/Rocket Lake, or AMD Zen4, all of which do not have penalties for 106| | executing AVX512. 107| | 108| | There is nothing stopping some future processor from supporting the 109| | above flags and having AVX512 penalties, but maybe you should not have 110| | bought such a processor. 111| | */ 112| 1| AVX512_PROFILE = 113| 1| AVX512_F | AVX512_DQ | AVX512_IFMA | AVX512_BW | AVX512_VL | AVX512_VBMI | AVX512_VBMI2 | AVX512_VBITALG, 114| 1| }; 115| | 116| | // NOLINTNEXTLINE(performance-enum-size) 117| 1| enum class x86_CPUID_7_1_bits : uint64_t { 118| 1| SHA512 = (1 << 0), 119| 1| SM3 = (1 << 1), 120| 1| SM4 = (1 << 2), 121| 1| }; 122| | 123| 1| uint32_t feat = 0; 124| 1| uint32_t cpuid[4] = {0}; 125| 1| bool has_sse41 = false; 126| 1| bool has_os_ymm_support = false; 127| 1| bool has_os_zmm_support = false; 128| | 129| | // CPUID 0: vendor identification, max sublevel 130| 1| invoke_cpuid(0, cpuid); 131| | 132| 1| const uint32_t max_supported_sublevel = cpuid[0]; 133| | 134| 1| if(max_supported_sublevel >= 1) { ------------------ | Branch (134:7): [True: 1, False: 0] ------------------ 135| | // CPUID 1: feature bits 136| 1| invoke_cpuid(1, cpuid); 137| 1| const uint64_t flags0 = (static_cast(cpuid[2]) << 32) | cpuid[3]; 138| | 139| 1| feat |= if_set(flags0, x86_CPUID_1_bits::RDTSC, CPUFeature::Bit::RDTSC, allowed); 140| | 141| 1| feat |= if_set(flags0, x86_CPUID_1_bits::RDRAND, CPUFeature::Bit::RDRAND, allowed); 142| | 143| 1| feat |= if_set(flags0, x86_CPUID_1_bits::POPCNT, CPUFeature::Bit::POPCNT, allowed); 144| | 145| 1| feat |= if_set(flags0, x86_CPUID_1_bits::SSE2, CPUFeature::Bit::SSE2, allowed); 146| | 147| 1| if(is_set(feat, CPUFeature::Bit::SSE2)) { ------------------ | Branch (147:10): [True: 1, False: 0] ------------------ 148| 1| feat |= if_set(flags0, x86_CPUID_1_bits::SSSE3, CPUFeature::Bit::SSSE3, allowed); 149| | 150| 1| if(is_set(feat, CPUFeature::Bit::SSSE3)) { ------------------ | Branch (150:13): [True: 1, False: 0] ------------------ 151| 1| feat |= if_set(flags0, x86_CPUID_1_bits::CLMUL, CPUFeature::Bit::CLMUL, allowed); 152| 1| feat |= if_set(flags0, x86_CPUID_1_bits::AESNI, CPUFeature::Bit::AESNI, allowed); 153| | 154| | // SSE4.1 is not tracked as a feature, but is required by the SHA-NI code 155| 1| const uint64_t sse41 = static_cast(x86_CPUID_1_bits::SSE41); 156| 1| has_sse41 = (flags0 & sse41) == sse41; 157| 1| } 158| | 159| 1| const uint64_t osxsave64 = static_cast(x86_CPUID_1_bits::OSXSAVE); 160| 1| if((flags0 & osxsave64) == osxsave64) { ------------------ | Branch (160:13): [True: 1, False: 0] ------------------ 161| 1| const uint64_t xcr_flags = xgetbv(); 162| 1| if((xcr_flags & 0x6) == 0x6) { ------------------ | Branch (162:16): [True: 1, False: 0] ------------------ 163| 1| has_os_ymm_support = true; 164| 1| has_os_zmm_support = (xcr_flags & 0xE0) == 0xE0; 165| 1| } 166| 1| } 167| 1| } 168| 1| } 169| | 170| 1| if(max_supported_sublevel >= 7) { ------------------ | Branch (170:7): [True: 1, False: 0] ------------------ 171| 1| clear_mem(cpuid, 4); 172| 1| invoke_cpuid_sublevel(7, 0, cpuid); 173| | 174| 1| const uint64_t flags7 = (static_cast(cpuid[2]) << 32) | cpuid[1]; 175| | 176| 1| clear_mem(cpuid, 4); 177| 1| invoke_cpuid_sublevel(7, 1, cpuid); 178| 1| const uint32_t flags7_1 = cpuid[0]; 179| | 180| 1| feat |= if_set(flags7, x86_CPUID_7_bits::RDSEED, CPUFeature::Bit::RDSEED, allowed); 181| 1| feat |= if_set(flags7, x86_CPUID_7_bits::ADX, CPUFeature::Bit::ADX, allowed); 182| | 183| | /* 184| | We only set the BMI bit if both BMI1 and BMI2 are supported, since 185| | typically we want to use both extensions in the same code. 186| | */ 187| 1| feat |= if_set(flags7, x86_CPUID_7_bits::BMI_1_AND_2, CPUFeature::Bit::BMI, allowed); 188| | 189| 1| if(is_set(feat, CPUFeature::Bit::SSSE3)) { ------------------ | Branch (189:10): [True: 1, False: 0] ------------------ 190| | // The SHA-NI code uses SSE4.1 instructions in addition to SSSE3 191| 1| if(has_sse41) { ------------------ | Branch (191:13): [True: 1, False: 0] ------------------ 192| 1| feat |= if_set(flags7, x86_CPUID_7_bits::SHA, CPUFeature::Bit::SHA, allowed); 193| 1| } 194| | 195| | // We only consider AVX2 if SSSE3 is supported 196| 1| if(has_os_ymm_support) { ------------------ | Branch (196:13): [True: 1, False: 0] ------------------ 197| 1| feat |= if_set(flags7, x86_CPUID_7_bits::AVX2, CPUFeature::Bit::AVX2, allowed); 198| | 199| 1| if(is_set(feat, CPUFeature::Bit::AVX2)) { ------------------ | Branch (199:16): [True: 1, False: 0] ------------------ 200| 1| feat |= if_set(flags7, x86_CPUID_7_bits::GFNI, CPUFeature::Bit::GFNI, allowed); 201| 1| feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_VAES, CPUFeature::Bit::AVX2_AES, allowed); 202| 1| feat |= if_set(flags7_1, x86_CPUID_7_1_bits::SHA512, CPUFeature::Bit::SHA512, allowed); 203| | // The SM3/SM4 instructions are VEX encoded and the code using them also uses AVX2 204| 1| feat |= if_set(flags7_1, x86_CPUID_7_1_bits::SM3, CPUFeature::Bit::SM3, allowed); 205| 1| feat |= if_set(flags7_1, x86_CPUID_7_1_bits::SM4, CPUFeature::Bit::SM4, allowed); 206| | 207| | // The VPCLMULQDQ code also uses the legacy 128-bit PCLMULQDQ instruction 208| 1| if(is_set(feat, CPUFeature::Bit::CLMUL)) { ------------------ | Branch (208:19): [True: 1, False: 0] ------------------ 209| 1| feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_VCLMUL, CPUFeature::Bit::AVX2_CLMUL, allowed); 210| 1| } 211| | 212| | // Likewise we only consider AVX-512 if AVX2 is supported 213| 1| if(has_os_zmm_support) { ------------------ | Branch (213:19): [True: 0, False: 1] ------------------ 214| 0| feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_PROFILE, CPUFeature::Bit::AVX512, allowed); 215| | 216| 0| if(is_set(feat, CPUFeature::Bit::AVX512)) { ------------------ | Branch (216:22): [True: 0, False: 0] ------------------ 217| 0| feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_VAES, CPUFeature::Bit::AVX512_AES, allowed); 218| 0| if(is_set(feat, CPUFeature::Bit::CLMUL)) { ------------------ | Branch (218:25): [True: 0, False: 0] ------------------ 219| 0| feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_VCLMUL, CPUFeature::Bit::AVX512_CLMUL, allowed); 220| 0| } 221| 0| } 222| 0| } 223| 1| } 224| 1| } 225| 1| } 226| 1| } 227| | 228| |/* 229| | * If we don't have access to CPUID, we can still safely assume that 230| | * any x86-64 processor has SSE2 and RDTSC 231| | */ 232| 1|#if defined(BOTAN_TARGET_ARCH_IS_X86_64) 233| 1| if(feat == 0) { ------------------ | Branch (233:7): [True: 0, False: 1] ------------------ 234| 0| feat |= CPUFeature::Bit::SSE2 & allowed; 235| 0| feat |= CPUFeature::Bit::RDTSC & allowed; 236| 0| } 237| 1|#endif 238| | 239| 1| return feat; 240| 1|} cpuid_x86.cpp:_ZN5Botan12_GLOBAL__N_112invoke_cpuidEjPj: 24| 2|void invoke_cpuid(uint32_t type, uint32_t out[4]) { 25| 2| clear_mem(out, 4); 26| | 27| 2|#if defined(BOTAN_USE_GCC_INLINE_ASM) 28| | // NOLINTNEXTLINE(*-no-assembler) 29| 2| asm volatile("cpuid\n\t" : "=a"(out[0]), "=b"(out[1]), "=c"(out[2]), "=d"(out[3]) : "0"(type)); 30| | 31| |#elif defined(BOTAN_BUILD_COMPILER_IS_MSVC) 32| | __cpuid((int*)out, type); 33| | 34| |#else 35| | BOTAN_UNUSED(type); 36| | #warning "No way of calling x86 cpuid instruction for this compiler" 37| |#endif 38| 2|} cpuid_x86.cpp:_ZN5Botan12_GLOBAL__N_16xgetbvEv: 56| 1|BOTAN_FUNC_ISA("xsave") uint64_t xgetbv() { 57| | return _xgetbv(0); 58| 1|} cpuid_x86.cpp:_ZN5Botan12_GLOBAL__N_121invoke_cpuid_sublevelEjjPj: 40| 2|void invoke_cpuid_sublevel(uint32_t type, uint32_t level, uint32_t out[4]) { 41| 2| clear_mem(out, 4); 42| | 43| 2|#if defined(BOTAN_USE_GCC_INLINE_ASM) 44| | // NOLINTNEXTLINE(*-no-assembler) 45| 2| asm volatile("cpuid\n\t" : "=a"(out[0]), "=b"(out[1]), "=c"(out[2]), "=d"(out[3]) : "0"(type), "2"(level)); 46| | 47| |#elif defined(BOTAN_BUILD_COMPILER_IS_MSVC) 48| | __cpuidex((int*)out, type, level); 49| | 50| |#else 51| | BOTAN_UNUSED(type, level); 52| | #warning "No way of calling x86 cpuid instruction for this compiler" 53| |#endif 54| 2|} _ZN5Botan10DataSource9read_byteERh: 27| 663k|size_t DataSource::read_byte(uint8_t& out) { 28| 663k| return read(&out, 1); 29| 663k|} _ZN5Botan10DataSource9read_byteEv: 34| 1.50M|std::optional DataSource::read_byte() { 35| 1.50M| uint8_t b = 0; 36| 1.50M| if(this->read(&b, 1) == 1) { ------------------ | Branch (36:7): [True: 1.48M, False: 12.5k] ------------------ 37| 1.48M| return b; 38| 1.48M| } else { 39| 12.5k| return {}; 40| 12.5k| } 41| 1.50M|} _ZNK5Botan10DataSource9peek_byteERh: 46| 17.4k|size_t DataSource::peek_byte(uint8_t& out) const { 47| 17.4k| return peek(&out, 1, 0); 48| 17.4k|} _ZN5Botan17DataSource_Memory4readEPhm: 73| 1.61M|size_t DataSource_Memory::read(uint8_t out[], size_t length) { 74| 1.61M| const size_t got = std::min(m_source.size() - m_offset, length); 75| 1.61M| copy_mem(out, m_source.data() + m_offset, got); 76| 1.61M| m_offset += got; 77| 1.61M| return got; 78| 1.61M|} _ZN5Botan17DataSource_Memory15check_availableEm: 80| 220k|bool DataSource_Memory::check_available(size_t n) { 81| 220k| return (n <= (m_source.size() - m_offset)); 82| 220k|} _ZNK5Botan17DataSource_Memory4peekEPhmm: 87| 32.8k|size_t DataSource_Memory::peek(uint8_t out[], size_t length, size_t peek_offset) const { 88| 32.8k| const size_t bytes_left = m_source.size() - m_offset; 89| 32.8k| if(peek_offset >= bytes_left) { ------------------ | Branch (89:7): [True: 1.29k, False: 31.5k] ------------------ 90| 1.29k| return 0; 91| 1.29k| } 92| | 93| 31.5k| const size_t got = std::min(bytes_left - peek_offset, length); 94| 31.5k| copy_mem(out, &m_source[m_offset + peek_offset], got); 95| 31.5k| return got; 96| 32.8k|} _ZNK5Botan17DataSource_Memory11end_of_dataEv: 101| 130k|bool DataSource_Memory::end_of_data() const { 102| 130k| return (m_offset == m_source.size()); 103| 130k|} _ZN5Botan7DNSName11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 134| 2.57k|std::optional DNSName::from_string(std::string_view name) { 135| 2.57k| if(auto canon = check_and_canonicalize_dns_name(name)) { ------------------ | Branch (135:12): [True: 2.39k, False: 187] ------------------ 136| | // TODO(C++23) std::string::contains 137| 2.39k| if(canon->find('*') != std::string::npos) { ------------------ | Branch (137:10): [True: 24, False: 2.36k] ------------------ 138| 24| return {}; 139| 24| } 140| 2.36k| return DNSName(std::move(*canon)); 141| 2.39k| } else { 142| 187| return {}; 143| 187| } 144| 2.57k|} _ZN5Botan7DNSName15from_san_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 147| 6.56k|std::optional DNSName::from_san_string(std::string_view name) { 148| 6.56k| if(auto canon = check_and_canonicalize_dns_name(name)) { ------------------ | Branch (148:12): [True: 6.47k, False: 94] ------------------ 149| | /* 150| | Validate the wildcard shape: at most one "*", and if present it must be in 151| | the leftmost label (no "." before it). This matches the RFC 6125 6.4.3 152| | form that host_wildcard_match accepts and rejects eg "*.*.example.com" or 153| | "foo.*.example.com" 154| | */ 155| 6.47k| const auto first_star = canon->find('*'); 156| 6.47k| if(first_star != std::string::npos) { ------------------ | Branch (156:10): [True: 64, False: 6.40k] ------------------ 157| 64| if(canon->find('*', first_star + 1) != std::string::npos) { ------------------ | Branch (157:13): [True: 2, False: 62] ------------------ 158| 2| return std::nullopt; 159| 2| } 160| 62| const auto first_dot = canon->find('.'); 161| 62| if(first_dot != std::string::npos && first_dot < first_star) { ------------------ | Branch (161:13): [True: 53, False: 9] | Branch (161:47): [True: 5, False: 48] ------------------ 162| 5| return std::nullopt; 163| 5| } 164| | /* 165| | RFC 6125 6.4.3: "the client SHOULD NOT attempt to match a presented 166| | identifier where the wildcard character is embedded within an 167| | A-label or U-label" 168| | */ 169| 57| if(canon->starts_with("xn--")) { ------------------ | Branch (169:13): [True: 3, False: 54] ------------------ 170| 3| return std::nullopt; 171| 3| } 172| | // A wildcard match requires at least three labels, so shorter 173| | // patterns ("*", "*.com") could never match any host 174| 54| if(std::count(canon->begin(), canon->end(), '.') < 2) { ------------------ | Branch (174:13): [True: 12, False: 42] ------------------ 175| 12| return std::nullopt; 176| 12| } 177| 54| } 178| 6.44k| return DNSName(std::move(*canon)); 179| 6.47k| } else { 180| 94| return {}; 181| 94| } 182| 6.56k|} dns_name.cpp:_ZN5Botan12_GLOBAL__N_131check_and_canonicalize_dns_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 21| 9.14k|std::optional check_and_canonicalize_dns_name(std::string_view name) { 22| | /* 23| | * RFC 1035 limits names to "255 octets or less", but that is in the wire 24| | * encoding, which includes a length octet per label plus the root label. 25| | * In presentation form (without a trailing dot) the limit is 253. 26| | */ 27| 9.14k| if(name.size() > 253) { ------------------ | Branch (27:7): [True: 1, False: 9.14k] ------------------ 28| 1| return {}; 29| 1| } 30| | 31| | // DNS names are not empty 32| 9.14k| if(name.empty()) { ------------------ | Branch (32:7): [True: 1, False: 9.14k] ------------------ 33| 1| return {}; 34| 1| } 35| | 36| | // DNS names do not start with or end with a dot 37| 9.14k| if(name.starts_with('.') || name.ends_with('.')) { ------------------ | Branch (37:7): [True: 6, False: 9.13k] | Branch (37:32): [True: 5, False: 9.12k] ------------------ 38| 11| return {}; 39| 11| } 40| | 41| | /* 42| | * Table mapping uppercase to lowercase and only including values valid for 43| | * DNS names: A-Z, a-z, 0-9, '-', '.', plus '*' for wildcarding (RFC 1035) 44| | */ 45| | // clang-format off 46| 9.12k| constexpr uint8_t DNS_CHAR_MAPPING[128] = { 47| 9.12k| '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', 48| 9.12k| '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', 49| 9.12k| '\0', '\0', '\0', '\0', '*', '\0', '\0', '-', '.', '\0', '0', '1', '2', '3', '4', '5', '6', '7', '8', 50| 9.12k| '9', '\0', '\0', '\0', '\0', '\0', '\0', '\0', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 51| 9.12k| 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '\0', '\0', '\0', '\0', 52| 9.12k| '\0', '\0', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 53| 9.12k| 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '\0', '\0', '\0', '\0', '\0', 54| 9.12k| }; 55| | // clang-format on 56| | 57| 9.12k| std::string canon; 58| 9.12k| canon.reserve(name.size()); 59| | 60| | // RFC 1035: DNS labels must not exceed 63 characters 61| 9.12k| size_t current_label_length = 0; 62| | 63| | // Tracks if the name consists only of digits and dots 64| 9.12k| bool all_numeric = true; 65| | 66| 144k| for(size_t i = 0; i != name.size(); ++i) { ------------------ | Branch (66:22): [True: 135k, False: 8.87k] ------------------ 67| 135k| const char c = name[i]; 68| | 69| 135k| if(c == '.') { ------------------ | Branch (69:10): [True: 15.3k, False: 120k] ------------------ 70| | // Sequential dot (.) characters are not allowed 71| 15.3k| if(i > 0 && name[i - 1] == '.') { ------------------ | Branch (71:13): [True: 15.3k, False: 0] | Branch (71:22): [True: 5, False: 15.3k] ------------------ 72| 5| return {}; 73| 5| } 74| | 75| | // Empty labels are not allowed 76| 15.3k| if(current_label_length == 0) { ------------------ | Branch (76:13): [True: 0, False: 15.3k] ------------------ 77| 0| return {}; 78| 0| } 79| 15.3k| current_label_length = 0; // Reset for next label 80| 120k| } else { 81| 120k| current_label_length++; 82| | 83| | // Labels cannot exceed maximum DNS label length 84| 120k| if(current_label_length > 63) { ------------------ | Branch (84:13): [True: 3, False: 120k] ------------------ 85| 3| return {}; 86| 3| } 87| 120k| } 88| | 89| 135k| const uint8_t cu = static_cast(c); 90| | // DNS names are not allowed to include any high-bit set characters 91| 135k| if(cu >= 128) { ------------------ | Branch (91:10): [True: 104, False: 135k] ------------------ 92| 104| return {}; 93| 104| } 94| 135k| const uint8_t mapped = DNS_CHAR_MAPPING[cu]; 95| | // DNS names are from a restricted character set 96| 135k| if(mapped == 0) { ------------------ | Branch (96:10): [True: 129, False: 135k] ------------------ 97| 129| return {}; 98| 129| } 99| | 100| 135k| if(mapped != '.' && (mapped < '0' || mapped > '9')) { ------------------ | Branch (100:10): [True: 120k, False: 15.3k] | Branch (100:28): [True: 1.77k, False: 118k] | Branch (100:44): [True: 112k, False: 5.63k] ------------------ 101| 114k| all_numeric = false; 102| 114k| } 103| | 104| 135k| if(mapped == '-') { ------------------ | Branch (104:10): [True: 1.68k, False: 133k] ------------------ 105| | // DNS labels are not allowed to include a leading or trailing hyphen 106| 1.68k| if(i == 0 || (i > 0 && name[i - 1] == '.')) { ------------------ | Branch (106:13): [True: 4, False: 1.68k] | Branch (106:24): [True: 1.68k, False: 0] | Branch (106:33): [True: 3, False: 1.67k] ------------------ 107| 7| return {}; // leading hyphen 108| 7| } 109| | 110| 1.67k| if(i == name.size() - 1 || (i < name.size() - 1 && name[i + 1] == '.')) { ------------------ | Branch (110:13): [True: 6, False: 1.67k] | Branch (110:38): [True: 1.67k, False: 0] | Branch (110:61): [True: 4, False: 1.66k] ------------------ 111| 10| return {}; // trailing hyphen 112| 10| } 113| 1.67k| } 114| 135k| canon.push_back(static_cast(mapped)); 115| 135k| } 116| | 117| | // This should never be hit, due to earlier validation steps 118| 8.87k| if(current_label_length == 0) { ------------------ | Branch (118:7): [True: 0, False: 8.87k] ------------------ 119| 0| return {}; 120| 0| } 121| | 122| | // An entirely numeric name ("1.2.3.4") is either a misplaced IP address 123| | // or an attempt at confusing some other system; reject outright 124| 8.87k| if(all_numeric) { ------------------ | Branch (124:7): [True: 10, False: 8.86k] ------------------ 125| 10| return {}; 126| 10| } 127| | 128| 8.86k| return canon; 129| 8.87k|} _ZNK5Botan12EmailAddress9to_stringEv: 73| 11|std::string EmailAddress::to_string() const { 74| 11| return fmt("{}@{}", m_local_part, m_domain.to_string()); 75| 11|} _ZN5Botan12EmailAddress11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 78| 357|std::optional EmailAddress::from_string(std::string_view addr) { 79| 357| auto parsed = parse_email_address(addr); 80| | 81| 357| if(parsed) { ------------------ | Branch (81:7): [True: 299, False: 58] ------------------ 82| | // Verify the local-part is all ASCII 83| 1.28k| for(const char c : parsed->first) { ------------------ | Branch (83:24): [True: 1.28k, False: 297] ------------------ 84| 1.28k| if(static_cast(c) >= 0x80) { ------------------ | Branch (84:13): [True: 2, False: 1.28k] ------------------ 85| 2| return {}; 86| 2| } 87| 1.28k| } 88| 297| return EmailAddress(std::move(parsed->first), std::move(parsed->second)); 89| 299| } else { 90| 58| return {}; 91| 58| } 92| 357|} _ZN5Botan15SmtpUtf8Mailbox11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 99| 641|std::optional SmtpUtf8Mailbox::from_string(std::string_view addr) { 100| 641| auto parsed = parse_email_address(addr); 101| | 102| 641| if(parsed) { ------------------ | Branch (102:7): [True: 619, False: 22] ------------------ 103| | /* 104| | * RFC 9598 Section 3 105| | * SmtpUTF8Mailbox subjectAltName MUST NOT be used unless the Local-part 106| | * of the email address contains non-ASCII characters. When the Local- 107| | * part is ASCII, rfc822Name subjectAltName MUST be used instead of 108| | * SmtpUTF8Mailbox. 109| | * 110| | * We do not currently enforce this on the decoding side. 111| | */ 112| 619| return SmtpUtf8Mailbox(std::move(parsed->first), std::move(parsed->second)); 113| 619| } 114| | 115| 22| return {}; 116| 641|} email.cpp:_ZN5Botan12_GLOBAL__N_119parse_email_addressENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 16| 998|std::optional> parse_email_address(std::string_view addr) { 17| | /* 18| | * RFC 5322 atext: ALPHA / DIGIT plus "!#$%&'*+-/=?^_`{|}~" (plus ".") 19| | * 20| | * Anything outside this set in the local part requires quoting, 21| | * which we deliberately don't accept. 22| | */ 23| 998| constexpr auto is_atext_or_dot = CharacterValidityTable::alpha_numeric_plus(".!#$%&'*+-/=?^_`{|}~"); 24| | 25| 998| if(addr.empty() || !is_valid_utf8(addr)) { ------------------ | Branch (25:7): [True: 0, False: 998] | Branch (25:23): [True: 14, False: 984] ------------------ 26| 14| return {}; 27| 14| } 28| | 29| 984| const auto at = addr.find('@'); 30| | 31| | // Must be one (and only one) @ sign 32| 984| if(at == std::string_view::npos || addr.find('@', at + 1) != std::string_view::npos) { ------------------ | Branch (32:7): [True: 15, False: 969] | Branch (32:39): [True: 6, False: 963] ------------------ 33| 21| return {}; 34| 21| } 35| | 36| | // Split at the @ sign and verify both halves are non-empty 37| 963| const std::string_view local = addr.substr(0, at); 38| 963| const std::string_view domain = addr.substr(at + 1); 39| | 40| 963| if(local.empty() || domain.empty()) { ------------------ | Branch (40:7): [True: 3, False: 960] | Branch (40:24): [True: 4, False: 956] ------------------ 41| 7| return {}; 42| 7| } 43| | 44| | // RFC 3696 section 3: 45| | // 46| | // period (".") may also appear [in an email address local-part], 47| | // but may not be used to start or end the local part, nor may two 48| | // or more consecutive periods appear. 49| | 50| | // TODO(C++23): use std::string::contains 51| 956| if(local.starts_with('.') || local.ends_with('.') || local.find("..") != std::string_view::npos) { ------------------ | Branch (51:7): [True: 5, False: 951] | Branch (51:33): [True: 3, False: 948] | Branch (51:57): [True: 3, False: 945] ------------------ 52| 11| return {}; 53| 11| } 54| | 55| | // RFC 5322 dot-atom. This intentionally omits support for quoting 56| 6.55k| for(const char c : local) { ------------------ | Branch (56:21): [True: 6.55k, False: 926] ------------------ 57| | // Here we accept high bit for UTF-8 for SmtpUtf8Mailbox 58| 6.55k| if(!is_atext_or_dot(c) && static_cast(c) < 0x80) { ------------------ | Branch (58:10): [True: 81, False: 6.47k] | Branch (58:33): [True: 19, False: 62] ------------------ 59| 19| return {}; 60| 19| } 61| 6.55k| } 62| | 63| 926| auto parsed_domain = DNSName::from_string(domain); 64| 926| if(!parsed_domain.has_value()) { ------------------ | Branch (64:7): [True: 8, False: 918] ------------------ 65| 8| return {}; 66| 8| } 67| | 68| 918| return std::make_pair(std::string(local), parsed_domain.value()); 69| 926|} _ZN5Botan9ExceptionC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 71| 18.6k|Exception::Exception(std::string_view msg) : m_msg(msg) {} _ZN5Botan9ExceptionC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKSt9exception: 73| 7.17k|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| 1.31k|Exception::Exception(const char* prefix, std::string_view msg) : m_msg(fmt("{} {}", prefix, msg)) {} _ZN5Botan16Invalid_ArgumentC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 77| 2.45k|Invalid_Argument::Invalid_Argument(std::string_view msg) : Exception(msg) {} _ZN5Botan14Encoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 123| 23|Encoding_Error::Encoding_Error(std::string_view name) : Exception("Encoding error:", name) {} _ZN5Botan14Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 125| 16.2k|Decoding_Error::Decoding_Error(std::string_view name) : Exception(name) {} _ZN5Botan14Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKSt9exception: 130| 7.17k|Decoding_Error::Decoding_Error(std::string_view msg, const std::exception& e) : Exception(msg, e) {} _ZN5Botan15Stream_IO_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 135| 1.29k|Stream_IO_Error::Stream_IO_Error(std::string_view err) : Exception("I/O error:", err) {} _ZN5Botan11IPv4AddressC2ENSt3__14spanIKhLm4EEE: 89| 6|IPv4Address::IPv4Address(std::span ip) : m_ip(load_be(ip)) {} _ZN5Botan11IPv4Address11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 92| 1.69k|std::optional IPv4Address::from_string(std::string_view str) { 93| 1.69k| if(auto ipv4 = string_to_ipv4(str)) { ------------------ | Branch (93:12): [True: 92, False: 1.60k] ------------------ 94| 92| return IPv4Address(*ipv4); 95| 1.60k| } else { 96| 1.60k| return {}; 97| 1.60k| } 98| 1.69k|} _ZN5Botan11IPv4Address7netmaskEm: 101| 53|IPv4Address IPv4Address::netmask(size_t bits) { 102| 53| BOTAN_ARG_CHECK(bits <= 32, "IPv4 netmask prefix length must be at most 32"); ------------------ | | 35| 53| do { \ | | 36| 53| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 53| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 53] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 53| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 53] | | ------------------ ------------------ 103| 53| if(bits == 0) { ------------------ | Branch (103:7): [True: 15, False: 38] ------------------ 104| 15| return IPv4Address(0); 105| 15| } 106| 38| return IPv4Address(0xFFFFFFFF << (32 - bits)); 107| 53|} _ZNK5Botan11IPv4Address8to_bytesEv: 109| 6|std::array IPv4Address::to_bytes() const { 110| 6| std::array out{}; 111| 6| store_be(m_ip, out); 112| 6| return out; 113| 6|} _ZNK5Botan11IPv4Address13prefix_lengthEv: 131| 75|std::optional IPv4Address::prefix_length() const { 132| | // A 32-bit mask m is a CIDR prefix iff (~m) + 1 is a power of two or zero, 133| | // i.e. (~m) & (~m + 1) == 0. If so, the prefix length is the leading-one count. 134| 75| const uint32_t inv = ~m_ip; 135| 75| if((inv & (inv + 1)) != 0) { ------------------ | Branch (135:7): [True: 22, False: 53] ------------------ 136| 22| return std::nullopt; 137| 22| } 138| 53| return std::countl_one(m_ip); 139| 75|} _ZN5Botan10IPv4SubnetC2ENS_11IPv4AddressEm: 142| 53| m_address(address & IPv4Address::netmask(prefix_length)), m_prefix_length(static_cast(prefix_length)) { 143| | // IPv4Address::netmask validates prefix_length <= 32, so by this point 144| | // the static_cast is in range. 145| 53|} _ZN5Botan10IPv4Subnet21from_address_and_maskENSt3__14spanIKhLm8EEE: 156| 75|std::optional IPv4Subnet::from_address_and_mask(std::span addr_and_mask) { 157| 75| const IPv4Address addr(load_be(addr_and_mask.data(), 0)); 158| 75| const IPv4Address mask(load_be(addr_and_mask.data(), 1)); 159| | 160| 75| if(const auto plen = mask.prefix_length()) { ------------------ | Branch (160:18): [True: 53, False: 22] ------------------ 161| 53| return IPv4Subnet(addr, *plen); 162| 53| } else { 163| 22| return {}; 164| 22| } 165| 75|} ipv4_address.cpp:_ZN5Botan12_GLOBAL__N_114string_to_ipv4ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 21| 1.69k|std::optional string_to_ipv4(std::string_view str) { 22| | // At least 3 dots + 4 1-digit integers 23| | // At most 3 dots + 4 3-digit integers 24| 1.69k| if(str.size() < 3 + 4 * 1 || str.size() > 3 + 4 * 3) { ------------------ | Branch (24:7): [True: 366, False: 1.32k] | Branch (24:33): [True: 868, False: 460] ------------------ 25| 1.23k| return {}; 26| 1.23k| } 27| | 28| | // the final result 29| 460| uint32_t ip = 0; 30| | // the number of '.' seen so far 31| 460| size_t dots = 0; 32| | // accumulates one quad (range 0-255) 33| 460| uint32_t accum = 0; 34| | // # of digits pushed to accum since last dot 35| 460| size_t cur_digits = 0; 36| | 37| 1.55k| for(const char c : str) { ------------------ | Branch (37:21): [True: 1.55k, False: 95] ------------------ 38| 1.55k| if(c == '.') { ------------------ | Branch (38:10): [True: 355, False: 1.20k] ------------------ 39| | // . without preceding digit is invalid 40| 355| if(cur_digits == 0) { ------------------ | Branch (40:13): [True: 4, False: 351] ------------------ 41| 4| return {}; 42| 4| } 43| 351| dots += 1; 44| | // too many dots 45| 351| if(dots > 3) { ------------------ | Branch (45:13): [True: 3, False: 348] ------------------ 46| 3| return {}; 47| 3| } 48| | 49| 348| cur_digits = 0; 50| 348| ip = (ip << 8) | accum; 51| 348| accum = 0; 52| 1.20k| } else if(c >= '0' && c <= '9') { ------------------ | Branch (52:17): [True: 1.15k, False: 46] | Branch (52:29): [True: 889, False: 268] ------------------ 53| 889| const auto d = static_cast(c - '0'); 54| | 55| | // prohibit leading zero in quad (used for octal) 56| 889| if(cur_digits > 0 && accum == 0) { ------------------ | Branch (56:13): [True: 358, False: 531] | Branch (56:31): [True: 16, False: 342] ------------------ 57| 16| return {}; 58| 16| } 59| 873| accum = (accum * 10) + d; 60| | 61| 873| if(accum > 255) { ------------------ | Branch (61:13): [True: 28, False: 845] ------------------ 62| 28| return {}; 63| 28| } 64| | 65| 845| cur_digits++; 66| 845| BOTAN_ASSERT_NOMSG(cur_digits <= 3); ------------------ | | 84| 845| do { \ | | 85| 845| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 845| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 845] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 845| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 845] | | ------------------ ------------------ 67| 845| } else { 68| 314| return {}; 69| 314| } 70| 1.55k| } 71| | 72| | // no trailing digits? 73| 95| if(cur_digits == 0) { ------------------ | Branch (73:7): [True: 1, False: 94] ------------------ 74| 1| return {}; 75| 1| } 76| | 77| | // insufficient # of dots 78| 94| if(dots != 3) { ------------------ | Branch (78:7): [True: 2, False: 92] ------------------ 79| 2| return {}; 80| 2| } 81| | 82| 92| ip = (ip << 8) | accum; 83| | 84| 92| return ip; 85| 94|} _ZN5Botan11IPv6AddressC2ENSt3__14spanIKhLm16EEE: 17| 364|IPv6Address::IPv6Address(std::span ip) : m_ip{} { 18| 6.18k| for(size_t i = 0; i != 16; ++i) { ------------------ | Branch (18:22): [True: 5.82k, False: 364] ------------------ 19| 5.82k| m_ip[i] = ip[i]; 20| 5.82k| } 21| 364|} _ZN5Botan11IPv6Address11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 24| 133|std::optional IPv6Address::from_string(std::string_view str) { 25| 133| if(str.empty()) { ------------------ | Branch (25:7): [True: 0, False: 133] ------------------ 26| 0| return {}; 27| 0| } 28| | 29| | // Parsed hex groups, split by whether they appeared before or after a "::". 30| | // If no "::" appears, only `pre` is populated and must reach exactly 8 groups. 31| 133| std::array pre{}; 32| 133| std::array post{}; 33| 133| size_t pre_count = 0; 34| 133| size_t post_count = 0; 35| 133| bool seen_double_colon = false; 36| | 37| 133| const auto hex_value = [](char c) -> std::optional { 38| 133| if(c >= '0' && c <= '9') { 39| 133| return c - '0'; 40| 133| } else if(c >= 'a' && c <= 'f') { 41| 133| return 10 + (c - 'a'); 42| 133| } else if(c >= 'A' && c <= 'F') { 43| 133| return 10 + (c - 'A'); 44| 133| } else { 45| 133| return {}; 46| 133| } 47| 133| }; 48| | 49| 133| size_t idx = 0; 50| 133| bool expect_group = true; // set after any separator, cleared after a group 51| | 52| 645| while(idx < str.size()) { ------------------ | Branch (52:10): [True: 581, False: 64] ------------------ 53| 581| if(str[idx] == ':') { ------------------ | Branch (53:10): [True: 255, False: 326] ------------------ 54| 255| if(idx + 1 < str.size() && str[idx + 1] == ':') { ------------------ | Branch (54:13): [True: 252, False: 3] | Branch (54:37): [True: 93, False: 159] ------------------ 55| 93| if(seen_double_colon) { ------------------ | Branch (55:16): [True: 3, False: 90] ------------------ 56| 3| return {}; // at most one "::" 57| 3| } 58| 90| seen_double_colon = true; 59| 90| idx += 2; 60| 90| expect_group = (idx < str.size()); 61| 90| continue; 62| 93| } 63| | // single ':' separator between groups, only valid after a group 64| 162| if(expect_group) { ------------------ | Branch (64:13): [True: 3, False: 159] ------------------ 65| 3| return {}; 66| 3| } 67| 159| expect_group = true; 68| 159| idx += 1; 69| 159| continue; 70| 162| } 71| | 72| | // Parse a hex group of 1..4 digits 73| 326| const size_t group_start = idx; 74| 326| uint32_t group = 0; 75| 326| size_t hex_chars = 0; 76| 937| while(idx < str.size() && hex_chars < 4) { ------------------ | Branch (76:13): [True: 898, False: 39] | Branch (76:33): [True: 841, False: 57] ------------------ 77| 841| const auto digit = hex_value(str[idx]); 78| 841| if(digit.has_value() == false) { ------------------ | Branch (78:13): [True: 230, False: 611] ------------------ 79| 230| break; 80| 230| } 81| 611| group = (group << 4) | static_cast(digit.value()); 82| 611| idx += 1; 83| 611| hex_chars += 1; 84| 611| } 85| 326| if(hex_chars == 0) { ------------------ | Branch (85:10): [True: 41, False: 285] ------------------ 86| 41| return {}; 87| 41| } 88| | // If a 5th hex digit follows, the group is oversized. 89| 285| if(hex_chars == 4 && idx < str.size() && hex_value(str[idx]).has_value()) { ------------------ | Branch (89:10): [True: 71, False: 214] | Branch (89:10): [True: 16, False: 269] | Branch (89:28): [True: 57, False: 14] | Branch (89:48): [True: 16, False: 41] ------------------ 90| 16| return {}; 91| 16| } 92| | 93| | /* 94| | RFC 4291 2.2 allows the final 32 bits in dotted decimal, eg 95| | "::ffff:1.2.3.4". The dotted quad must consume the remainder of the 96| | input, and accounts for two 16-bit groups. 97| | */ 98| 269| if(idx < str.size() && str[idx] == '.') { ------------------ | Branch (98:10): [True: 230, False: 39] | Branch (98:30): [True: 10, False: 220] ------------------ 99| 10| const auto ipv4 = IPv4Address::from_string(str.substr(group_start)); 100| 10| if(!ipv4.has_value()) { ------------------ | Branch (100:13): [True: 6, False: 4] ------------------ 101| 6| return {}; 102| 6| } 103| 4| const uint32_t v4 = ipv4->address(); 104| 4| const std::array v4_groups{static_cast(v4 >> 16), static_cast(v4 & 0xFFFF)}; 105| 8| for(const auto g : v4_groups) { ------------------ | Branch (105:27): [True: 8, False: 4] ------------------ 106| 8| if(seen_double_colon) { ------------------ | Branch (106:16): [True: 6, False: 2] ------------------ 107| 6| if(post_count >= 8) { ------------------ | Branch (107:19): [True: 0, False: 6] ------------------ 108| 0| return {}; 109| 0| } 110| 6| post[post_count++] = g; 111| 6| } else { 112| 2| if(pre_count >= 8) { ------------------ | Branch (112:19): [True: 0, False: 2] ------------------ 113| 0| return {}; 114| 0| } 115| 2| pre[pre_count++] = g; 116| 2| } 117| 8| } 118| 4| idx = str.size(); 119| 4| expect_group = false; 120| 4| continue; 121| 4| } 122| | 123| 259| if(seen_double_colon) { ------------------ | Branch (123:10): [True: 148, False: 111] ------------------ 124| 148| if(post_count >= 8) { ------------------ | Branch (124:13): [True: 0, False: 148] ------------------ 125| 0| return {}; 126| 0| } 127| 148| post[post_count++] = static_cast(group); 128| 148| } else { 129| 111| if(pre_count >= 8) { ------------------ | Branch (129:13): [True: 0, False: 111] ------------------ 130| 0| return {}; 131| 0| } 132| 111| pre[pre_count++] = static_cast(group); 133| 111| } 134| 259| expect_group = false; 135| 259| } 136| | 137| | // Trailing single ':' is invalid 138| 64| if(expect_group) { ------------------ | Branch (138:7): [True: 3, False: 61] ------------------ 139| 3| return {}; 140| 3| } 141| | 142| 61| const size_t total_groups = pre_count + post_count; 143| 61| if(seen_double_colon) { ------------------ | Branch (143:7): [True: 58, False: 3] ------------------ 144| | // "::" has to cover at least one zero group 145| 58| if(total_groups > 7) { ------------------ | Branch (145:10): [True: 0, False: 58] ------------------ 146| 0| return {}; 147| 0| } 148| 58| } else { 149| 3| if(total_groups != 8) { ------------------ | Branch (149:10): [True: 3, False: 0] ------------------ 150| 3| return {}; 151| 3| } 152| 3| } 153| | 154| 58| std::array out{}; 155| 114| for(size_t i = 0; i != pre_count; ++i) { ------------------ | Branch (155:22): [True: 56, False: 58] ------------------ 156| 56| out[2 * i] = get_byte<0>(pre[i]); 157| 56| out[2 * i + 1] = get_byte<1>(pre[i]); 158| 56| } 159| 58| const size_t gap = 8 - total_groups; 160| 182| for(size_t i = 0; i != post_count; ++i) { ------------------ | Branch (160:22): [True: 124, False: 58] ------------------ 161| 124| const size_t target = pre_count + gap + i; 162| 124| out[2 * target] = get_byte<0>(post[i]); 163| 124| out[2 * target + 1] = get_byte<1>(post[i]); 164| 124| } 165| 58| return IPv6Address(out); 166| 61|} _ZN5Botan11IPv6Address7netmaskEm: 169| 18|IPv6Address IPv6Address::netmask(size_t bits) { 170| 18| BOTAN_ARG_CHECK(bits <= 128, "IPv6 netmask prefix length must be at most 128"); ------------------ | | 35| 18| do { \ | | 36| 18| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 18| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 18] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 18| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 18] | | ------------------ ------------------ 171| | 172| 18| const size_t full_bytes = bits / 8; 173| 18| const size_t leftover = bits % 8; 174| | 175| 18| std::array m{}; 176| 136| for(size_t i = 0; i != full_bytes; ++i) { ------------------ | Branch (176:22): [True: 118, False: 18] ------------------ 177| 118| m[i] = 0xFF; 178| 118| } 179| | 180| 18| if(leftover > 0) { ------------------ | Branch (180:7): [True: 8, False: 10] ------------------ 181| 8| m[full_bytes] = static_cast(0xFF << (8 - leftover)); 182| 8| } 183| | 184| 18| return IPv6Address(m); 185| 18|} _ZNK5Botan11IPv6AddressanERKS0_: 257| 8|IPv6Address IPv6Address::operator&(const IPv6Address& other) const { 258| 8| std::array masked{}; 259| 136| for(size_t i = 0; i != 16; ++i) { ------------------ | Branch (259:22): [True: 128, False: 8] ------------------ 260| 128| masked[i] = m_ip[i] & other.m_ip[i]; 261| 128| } 262| 8| return IPv6Address(masked); 263| 8|} _ZNK5Botan11IPv6Address13prefix_lengthEv: 265| 10|std::optional IPv6Address::prefix_length() const { 266| | // Count leading one bits, stopping at the first byte that isn't fully set. 267| 10| size_t leading = 0; 268| 74| for(size_t i = 0; i != 16; ++i) { ------------------ | Branch (268:22): [True: 73, False: 1] ------------------ 269| 73| const size_t hw = (m_ip[i] == 0xFF) ? 8 : std::countl_one(m_ip[i]); ------------------ | Branch (269:25): [True: 64, False: 9] ------------------ 270| 73| leading += hw; 271| 73| if(hw != 8) { ------------------ | Branch (271:10): [True: 9, False: 64] ------------------ 272| 9| break; 273| 9| } 274| 73| } 275| | 276| | // Verify this is exactly equal to a netmask of that size 277| 10| if(*this != netmask(leading)) { ------------------ | Branch (277:7): [True: 2, False: 8] ------------------ 278| 2| return std::nullopt; 279| 2| } 280| 8| return leading; 281| 10|} _ZN5Botan10IPv6SubnetC2ENS_11IPv6AddressEm: 297| 8| m_address(address & IPv6Address::netmask(prefix_length)), m_prefix_length(static_cast(prefix_length)) { 298| | // IPv6Address::netmask validates prefix_length <= 128, so by this point 299| | // the static_cast is in range. 300| 8|} _ZN5Botan10IPv6Subnet21from_address_and_maskENSt3__14spanIKhLm32EEE: 303| 10|std::optional IPv6Subnet::from_address_and_mask(std::span addr_and_mask) { 304| 10| const auto addr = IPv6Address(addr_and_mask.first<16>()); 305| 10| const auto mask = IPv6Address(addr_and_mask.last<16>()); 306| | 307| 10| if(const auto plen = mask.prefix_length()) { ------------------ | Branch (307:18): [True: 8, False: 2] ------------------ 308| 8| return IPv6Subnet(addr, *plen); 309| 8| } else { 310| 2| return {}; 311| 2| } 312| 10|} ipv6_address.cpp:_ZZN5Botan11IPv6Address11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEENK3$_0clEc: 37| 898| const auto hex_value = [](char c) -> std::optional { 38| 898| if(c >= '0' && c <= '9') { ------------------ | Branch (38:10): [True: 847, False: 51] | Branch (38:22): [True: 314, False: 533] ------------------ 39| 314| return c - '0'; 40| 584| } else if(c >= 'a' && c <= 'f') { ------------------ | Branch (40:17): [True: 147, False: 437] | Branch (40:29): [True: 124, False: 23] ------------------ 41| 124| return 10 + (c - 'a'); 42| 460| } else if(c >= 'A' && c <= 'F') { ------------------ | Branch (42:17): [True: 222, False: 238] | Branch (42:29): [True: 189, False: 33] ------------------ 43| 189| return 10 + (c - 'A'); 44| 271| } else { 45| 271| return {}; 46| 271| } 47| 898| }; _ZN5Botan21constant_time_compareENSt3__14spanIKhLm18446744073709551615EEES3_: 17| 71|bool constant_time_compare(std::span x, std::span y) { 18| 71| const auto min_size = CT::Mask::is_lte(x.size(), y.size()).select(x.size(), y.size()); 19| 71| const auto equal_size = CT::Mask::is_equal(x.size(), y.size()); 20| 71| const auto equal_content = CT::Mask::expand(CT::is_equal(x.data(), y.data(), min_size)); 21| 71| return (equal_content & equal_size).as_bool(); 22| 71|} _ZN5Botan19secure_scrub_memoryEPvm: 24| 1.68M|void secure_scrub_memory(void* ptr, size_t n) { 25| 1.68M| return secure_zeroize_buffer(ptr, n); 26| 1.68M|} _ZN5Botan21secure_zeroize_bufferEPvm: 28| 1.72M|void secure_zeroize_buffer(void* ptr, size_t n) { 29| 1.72M| if(n == 0) { ------------------ | Branch (29:7): [True: 736k, False: 988k] ------------------ 30| 736k| return; 31| 736k| } 32| | 33| |#if defined(BOTAN_TARGET_OS_HAS_RTLSECUREZEROMEMORY) 34| | ::RtlSecureZeroMemory(ptr, n); 35| | 36| |#elif defined(BOTAN_TARGET_OS_HAS_EXPLICIT_BZERO) 37| 988k| ::explicit_bzero(ptr, n); 38| | 39| |#elif defined(BOTAN_TARGET_OS_HAS_EXPLICIT_MEMSET) 40| | (void)::explicit_memset(ptr, 0, n); 41| | 42| |#else 43| | /* 44| | * Call memset through a static volatile pointer, which the compiler should 45| | * not elide. This construct should be safe in conforming compilers, but who 46| | * knows. This has been checked to generate the expected code, which saves the 47| | * memset address in the data segment and unconditionally loads and jumps to 48| | * that address, with the following targets: 49| | * 50| | * x86-64: Clang 19, GCC 6, 11, 13, 14 51| | * riscv64: GCC 14 52| | * aarch64: GCC 14 53| | * armv7: GCC 14 54| | * 55| | * Actually all of them generated the expected jump even without marking the 56| | * function pointer as volatile. However this seems worth including as an 57| | * additional precaution. 58| | */ 59| | static void* (*const volatile memset_ptr)(void*, int, size_t) = std::memset; 60| | (memset_ptr)(ptr, 0, n); 61| |#endif 62| 988k|} _ZN5Botan2OS17read_env_variableERNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EE: 471| 1|bool OS::read_env_variable(std::string& value_out, std::string_view name_view) { 472| 1| value_out = ""; 473| | 474| 1| if(running_in_privileged_state()) { ------------------ | Branch (474:7): [True: 0, False: 1] ------------------ 475| 0| return false; 476| 0| } 477| | 478| |#if defined(BOTAN_TARGET_OS_HAS_WIN32) && \ 479| | (defined(BOTAN_BUILD_COMPILER_IS_MSVC) || defined(BOTAN_BUILD_COMPILER_IS_CLANGCL)) 480| | const std::string name(name_view); 481| | 482| | // First query the required buffer size; req_size is 0 if the variable is not set 483| | size_t req_size = 0; 484| | if(getenv_s(&req_size, nullptr, 0, name.c_str()) != 0 || req_size == 0) { 485| | return false; 486| | } 487| | 488| | // The reported size includes the terminating \0 489| | std::string val(req_size, '\0'); 490| | if(getenv_s(&req_size, val.data(), val.size(), name.c_str()) != 0) { 491| | return false; 492| | } 493| | 494| | value_out = std::string(val.c_str()); 495| | return true; 496| |#else 497| 1| const std::string name(name_view); 498| 1| if(const char* val = std::getenv(name.c_str())) { ------------------ | Branch (498:19): [True: 0, False: 1] ------------------ 499| 0| value_out = val; 500| 0| return true; 501| 0| } 502| 1|#endif 503| | 504| 1| return false; 505| 1|} os_utils.cpp:_ZN5Botan12_GLOBAL__N_110get_auxvalENSt3__18optionalImEE: 120| 1|std::optional get_auxval(std::optional id) { 121| 1| if(id) { ------------------ | Branch (121:7): [True: 1, False: 0] ------------------ 122| 1|#if defined(BOTAN_TARGET_OS_HAS_GETAUXVAL) 123| 1| return ::getauxval(*id); 124| |#elif defined(BOTAN_TARGET_OS_HAS_ELF_AUX_INFO) 125| | unsigned long auxinfo = 0; 126| | if(::elf_aux_info(static_cast(*id), &auxinfo, sizeof(auxinfo)) == 0) { 127| | return auxinfo; 128| | } 129| |#endif 130| 1| } 131| | 132| 0| return {}; 133| 1|} os_utils.cpp:_ZN5Botan12_GLOBAL__N_127running_in_privileged_stateEv: 154| 1|bool running_in_privileged_state() { 155| 1|#if defined(AT_SECURE) 156| 1| if(const auto at_secure = get_auxval(AT_SECURE)) { ------------------ | Branch (156:18): [True: 1, False: 0] ------------------ 157| 1| return at_secure != 0; 158| 1| } 159| 0|#endif 160| | 161| 0|#if defined(BOTAN_TARGET_OS_HAS_POSIX1) 162| 0| return (::getuid() != ::geteuid()) || (::getgid() != ::getegid()); ------------------ | Branch (162:11): [True: 0, False: 0] | Branch (162:42): [True: 0, False: 0] ------------------ 163| |#else 164| | return false; 165| |#endif 166| 1|} _ZN5Botan9parse_u16ENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEb: 59| 151|std::optional parse_u16(std::string_view input, bool require_canonical) { 60| 151| return parse_decimal_integer(input, require_canonical); 61| 151|} _ZN5Botan9parse_u32ENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEb: 63| 124k|std::optional parse_u32(std::string_view input, bool require_canonical) { 64| 124k| return parse_decimal_integer(input, require_canonical); 65| 124k|} _ZN5Botan9to_u32bitENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 75| 124k|uint32_t to_u32bit(std::string_view input) { 76| 124k| if(const auto parsed = parse_u32(input)) { ------------------ | Branch (76:18): [True: 124k, False: 14] ------------------ 77| 124k| return *parsed; 78| 124k| } else { 79| 14| throw Invalid_Argument(fmt("Failed to parse input '{}' as a 32-bit integer", input)); 80| 14| } 81| 124k|} _ZN5Botan8split_onENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEc: 83| 3.39k|std::vector split_on(std::string_view str, char delim) { 84| 3.39k| std::vector elems; 85| 3.39k| if(str.empty()) { ------------------ | Branch (85:7): [True: 0, False: 3.39k] ------------------ 86| 0| return elems; 87| 0| } 88| | 89| 3.39k| std::string substr; 90| 36.0k| for(const char c : str) { ------------------ | Branch (90:21): [True: 36.0k, False: 3.39k] ------------------ 91| 36.0k| if(c == delim) { ------------------ | Branch (91:10): [True: 1.27k, False: 34.7k] ------------------ 92| 1.27k| if(!substr.empty()) { ------------------ | Branch (92:13): [True: 1.27k, False: 0] ------------------ 93| 1.27k| elems.push_back(substr); 94| 1.27k| } 95| 1.27k| substr.clear(); 96| 34.7k| } else { 97| 34.7k| substr += c; 98| 34.7k| } 99| 36.0k| } 100| | 101| 3.39k| if(substr.empty()) { ------------------ | Branch (101:7): [True: 0, False: 3.39k] ------------------ 102| 0| throw Invalid_Argument(fmt("Unable to split string '{}", str)); 103| 0| } 104| 3.39k| elems.push_back(substr); 105| | 106| 3.39k| return elems; 107| 3.39k|} _ZN5Botan14tolower_stringENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 125| 2.63k|std::string tolower_string(std::string_view str) { 126| | // Locale-independent ASCII fold; the only callers (DNS name canonicalization 127| | // for SAN/name-constraints) work on ASCII strings per RFC 1035. 128| 2.63k| std::string lower(str); 129| 12.0k| for(char& c : lower) { ------------------ | Branch (129:16): [True: 12.0k, False: 2.63k] ------------------ 130| 12.0k| if(c >= 'A' && c <= 'Z') { ------------------ | Branch (130:10): [True: 11.7k, False: 307] | Branch (130:22): [True: 230, False: 11.5k] ------------------ 131| 230| c = static_cast(c + ('a' - 'A')); 132| 230| } 133| 12.0k| } 134| 2.63k| return lower; 135| 2.63k|} parsing.cpp:_ZN5Botan12_GLOBAL__N_121parse_decimal_integerITkNSt3__117unsigned_integralEtEENS2_8optionalIT_EENS2_17basic_string_viewIcNS2_11char_traitsIcEEEEb: 31| 151|std::optional parse_decimal_integer(std::string_view input, bool require_canonical) { 32| 151| if(input.empty() || input.size() > (std::numeric_limits::digits10 + 1)) { ------------------ | Branch (32:7): [True: 0, False: 151] | Branch (32:24): [True: 3, False: 148] ------------------ 33| 3| return {}; 34| 3| } 35| | 36| | // The canonical encoding of zero is "0"; no other value starts with a zero 37| 148| if(require_canonical && input.size() > 1 && input.front() == '0') { ------------------ | Branch (37:7): [True: 148, False: 0] | Branch (37:28): [True: 126, False: 22] | Branch (37:48): [True: 2, False: 124] ------------------ 38| 2| return {}; 39| 2| } 40| | 41| 146| T accum = 0; 42| | 43| 463| for(const char c : input) { ------------------ | Branch (43:21): [True: 463, False: 128] ------------------ 44| 463| if(const auto digit = digit_from_ascii(c)) { ------------------ | Branch (44:21): [True: 447, False: 16] ------------------ 45| 447| if(accum > (std::numeric_limits::max() - static_cast(*digit)) / 10) { ------------------ | Branch (45:13): [True: 2, False: 445] ------------------ 46| 2| return {}; 47| 2| } 48| 445| accum = accum * 10 + static_cast(*digit); 49| 445| } else { 50| 16| return {}; 51| 16| } 52| 463| } 53| | 54| 128| return accum; 55| 146|} parsing.cpp:_ZN5Botan12_GLOBAL__N_116digit_from_asciiEc: 22| 250k|std::optional digit_from_ascii(char c) { 23| 250k| if(c >= '0' && c <= '9') { ------------------ | Branch (23:7): [True: 250k, False: 23] | Branch (23:19): [True: 250k, False: 7] ------------------ 24| 250k| return c - '0'; 25| 250k| } else { 26| 30| return {}; 27| 30| } 28| 250k|} parsing.cpp:_ZN5Botan12_GLOBAL__N_121parse_decimal_integerITkNSt3__117unsigned_integralEjEENS2_8optionalIT_EENS2_17basic_string_viewIcNS2_11char_traitsIcEEEEb: 31| 124k|std::optional parse_decimal_integer(std::string_view input, bool require_canonical) { 32| 124k| if(input.empty() || input.size() > (std::numeric_limits::digits10 + 1)) { ------------------ | Branch (32:7): [True: 0, False: 124k] | Branch (32:24): [True: 0, False: 124k] ------------------ 33| 0| return {}; 34| 0| } 35| | 36| | // The canonical encoding of zero is "0"; no other value starts with a zero 37| 124k| if(require_canonical && input.size() > 1 && input.front() == '0') { ------------------ | Branch (37:7): [True: 0, False: 124k] | Branch (37:28): [True: 0, False: 0] | Branch (37:48): [True: 0, False: 0] ------------------ 38| 0| return {}; 39| 0| } 40| | 41| 124k| T accum = 0; 42| | 43| 249k| for(const char c : input) { ------------------ | Branch (43:21): [True: 249k, False: 124k] ------------------ 44| 249k| if(const auto digit = digit_from_ascii(c)) { ------------------ | Branch (44:21): [True: 249k, False: 14] ------------------ 45| 249k| if(accum > (std::numeric_limits::max() - static_cast(*digit)) / 10) { ------------------ | Branch (45:13): [True: 0, False: 249k] ------------------ 46| 0| return {}; 47| 0| } 48| 249k| accum = accum * 10 + static_cast(*digit); 49| 249k| } else { 50| 14| return {}; 51| 14| } 52| 249k| } 53| | 54| 124k| return accum; 55| 124k|} _ZN5Botan15TelephoneNumber11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 13| 109|std::optional TelephoneNumber::from_string(std::string_view tn) { 14| | // TelephoneNumber ::= IA5String (SIZE (1..15)) (FROM ("0123456789#*")) 15| 109| if(tn.empty() || tn.size() > 15 || tn.find_first_not_of("0123456789#*") != std::string_view::npos) { ------------------ | Branch (15:7): [True: 1, False: 108] | Branch (15:21): [True: 0, False: 108] | Branch (15:39): [True: 10, False: 98] ------------------ 16| 11| return std::nullopt; 17| 11| } 18| 98| return TelephoneNumber(std::string(tn)); 19| 109|} _ZNK5Botan15TelephoneNumber11is_wildcardEv: 21| 93|bool TelephoneNumber::is_wildcard() const { 22| 93| return m_number.find_first_of("*#") != std::string::npos; 23| 93|} _ZNK5Botan15TelephoneNumber13numeric_valueEv: 25| 93|std::optional TelephoneNumber::numeric_value() const { 26| 93| if(is_wildcard()) { ------------------ | Branch (26:7): [True: 3, False: 90] ------------------ 27| 3| return std::nullopt; 28| 3| } 29| 90| uint64_t value = 0; 30| 181| for(const char c : m_number) { ------------------ | Branch (30:21): [True: 181, False: 90] ------------------ 31| 181| value = (value * 10) + static_cast(c - '0'); 32| 181| } 33| 90| return value; 34| 93|} _ZN5Botan20TelephoneNumberRange4fromERKNS_15TelephoneNumberEm: 48| 93|std::optional TelephoneNumberRange::from(const TelephoneNumber& start, uint64_t count) { 49| 93| const auto pow10 = [](size_t n) -> uint64_t { 50| | // Always in range since the input length is at most 15 51| 93| uint64_t v = 1; 52| 93| for(size_t i = 0; i != n; ++i) { 53| 93| v *= 10; 54| 93| } 55| 93| return v; 56| 93| }; 57| | 58| 93| const auto first = start.numeric_value(); 59| 93| if(!first.has_value() || count <= 1) { ------------------ | Branch (59:7): [True: 3, False: 90] | Branch (59:29): [True: 0, False: 90] ------------------ 60| 3| return std::nullopt; 61| 3| } 62| 90| if(count > pow10(start.length()) - *first) { ------------------ | Branch (62:7): [True: 85, False: 5] ------------------ 63| 85| return std::nullopt; 64| 85| } 65| 5| return TelephoneNumberRange(start, count); 66| 90|} telephone_number.cpp:_ZZN5Botan20TelephoneNumberRange4fromERKNS_15TelephoneNumberEmENK3$_0clEm: 49| 90| const auto pow10 = [](size_t n) -> uint64_t { 50| | // Always in range since the input length is at most 15 51| 90| uint64_t v = 1; 52| 271| for(size_t i = 0; i != n; ++i) { ------------------ | Branch (52:25): [True: 181, False: 90] ------------------ 53| 181| v *= 10; 54| 181| } 55| 90| return v; 56| 90| }; _ZNK5Botan3URIssERKS0_: 114| 2.69k|std::strong_ordering URI::operator<=>(const URI& other) const { 115| 2.69k| const bool has_authority = raw_authority().has_value(); 116| 2.69k| const bool other_has_authority = other.raw_authority().has_value(); 117| | 118| 2.69k| return std::tie(m_scheme, has_authority, m_authority, m_path, m_query, m_fragment) <=> 119| 2.69k| std::tie( 120| 2.69k| other.m_scheme, other_has_authority, other.m_authority, other.m_path, other.m_query, other.m_fragment); 121| 2.69k|} _ZNK5Botan3URI13raw_authorityEv: 129| 5.38k|std::optional URI::raw_authority() const { 130| 5.38k| const auto colon = m_raw.find(':'); 131| 5.38k| BOTAN_ASSERT_NOMSG(colon != std::string::npos); ------------------ | | 84| 5.38k| do { \ | | 85| 5.38k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 5.38k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 5.38k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 5.38k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 5.38k] | | ------------------ ------------------ 132| | 133| 5.38k| const size_t rest_offset = colon + 1; 134| 5.38k| if(m_raw.size() < rest_offset + 2 || m_raw[rest_offset] != '/' || m_raw[rest_offset + 1] != '/') { ------------------ | Branch (134:7): [True: 19, False: 5.36k] | Branch (134:41): [True: 699, False: 4.67k] | Branch (134:70): [True: 1.18k, False: 3.48k] ------------------ 135| 1.90k| return std::nullopt; 136| 1.90k| } 137| | 138| 3.48k| const size_t authority_start = rest_offset + 2; 139| 3.48k| const auto authority_end = m_raw.find_first_of("/?#", authority_start); 140| 3.48k| const size_t authority_len = 141| 3.48k| (authority_end == std::string::npos) ? std::string::npos : authority_end - authority_start; ------------------ | Branch (141:7): [True: 978, False: 2.51k] ------------------ 142| 3.48k| return std::string_view(m_raw).substr(authority_start, authority_len); 143| 5.38k|} _ZNK5Botan3URI9AuthorityssERKS1_: 145| 1.38k|std::strong_ordering URI::Authority::operator<=>(const URI::Authority& other) const { 146| | /* 147| | Userinfo is compared without normalization; RFC 3986 6.2.2.1: 148| | When a URI uses components of the generic syntax, the component 149| | syntax equivalence rules always apply; namely, that the scheme 150| | and host are case-insensitive and therefore should be normalized 151| | to lowercase. ... The other generic syntax components are assumed 152| | to be case-sensitive unless specifically defined otherwise by the 153| | scheme. 154| | */ 155| 1.38k| return std::tie(m_userinfo, m_host, m_port) <=> std::tie(other.m_userinfo, other.m_host, other.m_port); 156| 1.38k|} _ZN5Botan3URI11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 163| 2.75k|std::optional URI::from_string(std::string_view raw) { 164| | // Empty string is not a valid URI 165| 2.75k| if(raw.empty()) { ------------------ | Branch (165:7): [True: 0, False: 2.75k] ------------------ 166| 0| return {}; 167| 0| } 168| | 169| | // RFC 3986: 170| | // scheme = ALPHA *( ALPHA / DIGIT / "+" / "-" / "." ) 171| 2.75k| constexpr auto is_scheme_cont_char = CharacterValidityTable::alpha_numeric_plus("+-."); 172| | 173| 2.75k| const auto is_ascii_alpha = [](char c) -> bool { return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'); }; 174| | 175| | // Check the first scheme character 176| 2.75k| if(!is_ascii_alpha(raw.front())) { ------------------ | Branch (176:7): [True: 28, False: 2.72k] ------------------ 177| 28| return {}; 178| 28| } 179| | 180| | // Scan the rest of the scheme 181| 2.72k| size_t i = 1; 182| 12.4k| while(i < raw.size() && is_scheme_cont_char(raw[i])) { ------------------ | Branch (182:10): [True: 12.3k, False: 27] | Branch (182:28): [True: 9.69k, False: 2.69k] ------------------ 183| 9.69k| ++i; 184| 9.69k| } 185| | // Scheme wasn't followed by ':' -> invalid 186| 2.72k| if(i >= raw.size() || raw[i] != ':') { ------------------ | Branch (186:7): [True: 27, False: 2.69k] | Branch (186:26): [True: 56, False: 2.63k] ------------------ 187| 83| return {}; 188| 83| } 189| | 190| | // Canonicalize the scheme 191| 2.63k| const std::string scheme = tolower_string(raw.substr(0, i)); 192| | 193| 2.63k| auto rest = raw.substr(i + 1); 194| | 195| 2.63k| std::optional parsed_authority; 196| 2.63k| std::string_view path_query_fragment; 197| | 198| 2.63k| if(rest.starts_with("//")) { ------------------ | Branch (198:7): [True: 1.96k, False: 675] ------------------ 199| 1.96k| rest.remove_prefix(2); // Strip off the '//' 200| | 201| | // Authority runs to the first '/', '?' or '#'. The remaining is `path ? query # fragment`, 202| | // which is validated against the RFC 3986 character set. 203| 1.96k| const auto end = rest.find_first_of("/?#"); 204| 1.96k| const auto authority = (end == std::string_view::npos) ? rest : rest.substr(0, end); ------------------ | Branch (204:30): [True: 633, False: 1.33k] ------------------ 205| 1.96k| path_query_fragment = (end == std::string_view::npos) ? std::string_view{} : rest.substr(end); ------------------ | Branch (205:29): [True: 633, False: 1.33k] ------------------ 206| | 207| | // Parse and validate non-empty authority strings (hostname, IPv4, or IPv6 address) 208| 1.96k| if(!authority.empty()) { ------------------ | Branch (208:10): [True: 1.92k, False: 42] ------------------ 209| 1.92k| parsed_authority = Authority::from_string(authority); 210| 1.92k| if(!parsed_authority.has_value()) { ------------------ | Branch (210:13): [True: 390, False: 1.53k] ------------------ 211| 390| return {}; 212| 390| } 213| 1.92k| } 214| 1.96k| } else { 215| 675| path_query_fragment = rest; 216| 675| } 217| | 218| | // Validate any `path ? query # fragment` portions of the URL 219| 2.24k| if(!validate_path_query_fragment(path_query_fragment)) { ------------------ | Branch (219:7): [True: 129, False: 2.12k] ------------------ 220| 129| return {}; 221| 129| } 222| | 223| | // Split into path / query / fragment. Validation above guarantees at most 224| | // one '#', so the first '#' is the fragment delimiter, and within the 225| | // pre-fragment portion the first '?' (if any) is the query delimiter. 226| 2.12k| const auto hash = path_query_fragment.find('#'); 227| 2.12k| const auto pre_fragment = 228| 2.12k| (hash == std::string_view::npos) ? path_query_fragment : path_query_fragment.substr(0, hash); ------------------ | Branch (228:7): [True: 1.31k, False: 810] ------------------ 229| 2.12k| std::optional fragment; 230| 2.12k| if(hash != std::string_view::npos) { ------------------ | Branch (230:7): [True: 810, False: 1.31k] ------------------ 231| 810| fragment = std::string(path_query_fragment.substr(hash + 1)); 232| 810| } 233| | 234| 2.12k| const auto qmark = pre_fragment.find('?'); 235| 2.12k| const auto path = (qmark == std::string_view::npos) ? pre_fragment : pre_fragment.substr(0, qmark); ------------------ | Branch (235:22): [True: 1.24k, False: 878] ------------------ 236| 2.12k| std::optional query; 237| 2.12k| if(qmark != std::string_view::npos) { ------------------ | Branch (237:7): [True: 878, False: 1.24k] ------------------ 238| 878| query = std::string(pre_fragment.substr(qmark + 1)); 239| 878| } 240| | 241| | // Accept 242| 2.12k| return URI( 243| 2.12k| std::string(raw), scheme, std::move(parsed_authority), std::string(path), std::move(query), std::move(fragment)); 244| 2.24k|} _ZN5Botan3URI9Authority11from_stringENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 247| 1.92k|std::optional URI::Authority::from_string(std::string_view raw) { 248| 1.92k| if(raw.empty()) { ------------------ | Branch (248:7): [True: 0, False: 1.92k] ------------------ 249| 0| return {}; 250| 0| } 251| | 252| | // Capture the full input now; the userinfo prefix is stripped from 253| | // `raw` below, and m_raw must reflect the original 254| 1.92k| const std::string original_input(raw); 255| | 256| | /* 257| | RFC 3986 258| | userinfo = *( unreserved / pct-encoded / sub-delims / ":" ) 259| | 260| | Thus a unencoded '@' is not allowed inside userinfo, and the single '@' splits the 261| | username from the authority. The @ being present at all is significant; an empty 262| | userinfo ("https://@example.com/") is distinct from no userinfo at all. 263| | */ 264| 1.92k| std::optional userinfo; 265| 1.92k| const auto first_at = raw.find('@'); 266| 1.92k| if(first_at != std::string_view::npos) { ------------------ | Branch (266:7): [True: 452, False: 1.47k] ------------------ 267| 452| if(raw.find('@', first_at + 1) != std::string_view::npos) { ------------------ | Branch (267:10): [True: 10, False: 442] ------------------ 268| 10| return {}; 269| 10| } 270| 442| const auto userinfo_view = raw.substr(0, first_at); 271| 442| if(!validate_userinfo(userinfo_view)) { ------------------ | Branch (271:10): [True: 65, False: 377] ------------------ 272| 65| return {}; 273| 65| } 274| 377| userinfo = std::string(userinfo_view); 275| 377| raw.remove_prefix(first_at + 1); 276| 377| } 277| | 278| 1.84k| std::string_view host_view; 279| 1.84k| std::string_view port_str; 280| 1.84k| std::optional host; 281| | 282| 1.84k| if(!raw.empty() && raw.front() == '[') { ------------------ | Branch (282:7): [True: 1.84k, False: 5] | Branch (282:23): [True: 146, False: 1.69k] ------------------ 283| | // Bracketed IPv6 literal. 284| 146| const auto close = raw.find(']'); 285| 146| if(close == std::string_view::npos) { ------------------ | Branch (285:10): [True: 3, False: 143] ------------------ 286| 3| return {}; 287| 3| } 288| 143| host_view = raw.substr(1, close - 1); 289| 143| if(host_view.empty()) { ------------------ | Branch (289:10): [True: 1, False: 142] ------------------ 290| 1| return {}; 291| 1| } 292| 142| const auto after = raw.substr(close + 1); 293| 142| if(!after.empty()) { ------------------ | Branch (293:10): [True: 51, False: 91] ------------------ 294| 51| if(after.front() != ':') { ------------------ | Branch (294:13): [True: 9, False: 42] ------------------ 295| 9| return {}; 296| 9| } 297| 42| port_str = after.substr(1); 298| 42| } 299| 133| auto ipv6 = IPv6Address::from_string(host_view); 300| 133| if(!ipv6.has_value()) { ------------------ | Branch (300:10): [True: 75, False: 58] ------------------ 301| 75| return {}; 302| 75| } 303| 58| host = *ipv6; 304| 1.70k| } else { 305| | // host[:port] with no brackets. Only one ':' is allowed (port). 306| 1.70k| const auto colon = raw.find(':'); 307| 1.70k| if(colon == std::string_view::npos) { ------------------ | Branch (307:10): [True: 1.50k, False: 196] ------------------ 308| 1.50k| host_view = raw; 309| 1.50k| } else { 310| 196| host_view = raw.substr(0, colon); 311| 196| port_str = raw.substr(colon + 1); 312| | 313| | // Verify the `:` char is the only one that appears 314| 196| if(port_str.find(':') != std::string::npos) { ------------------ | Branch (314:13): [True: 8, False: 188] ------------------ 315| 8| return {}; 316| 8| } 317| 196| } 318| | 319| 1.69k| if(host_view.empty()) { ------------------ | Branch (319:10): [True: 6, False: 1.68k] ------------------ 320| 6| return {}; 321| 6| } 322| | 323| | // Technically valid per RFC 3986 but likely not something we want to support 324| 1.68k| if(host_view.ends_with('.')) { ------------------ | Branch (324:10): [True: 3, False: 1.68k] ------------------ 325| 3| return {}; 326| 3| } 327| | 328| 1.68k| if(auto ipv4 = IPv4Address::from_string(host_view)) { ------------------ | Branch (328:15): [True: 88, False: 1.59k] ------------------ 329| 88| host = *ipv4; 330| 1.59k| } else if(auto dns = DNSName::from_string(host_view)) { ------------------ | Branch (330:22): [True: 1.41k, False: 182] ------------------ 331| 1.41k| host = std::move(*dns); 332| 1.41k| } else { 333| 182| return {}; 334| 182| } 335| 1.68k| } 336| | 337| 1.56k| std::optional port; 338| | 339| 1.56k| if(!port_str.empty()) { ------------------ | Branch (339:7): [True: 151, False: 1.40k] ------------------ 340| 151| port = parse_port(port_str); 341| 151| if(!port.has_value()) { ------------------ | Branch (341:10): [True: 28, False: 123] ------------------ 342| 28| return {}; 343| 28| } 344| 151| } 345| | 346| 1.53k| return Authority(original_input, std::move(userinfo), std::move(*host), port); 347| 1.56k|} uri.cpp:_ZZN5Botan3URI11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEENK3$_0clEc: 173| 2.75k| const auto is_ascii_alpha = [](char c) -> bool { return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'); }; ------------------ | Branch (173:61): [True: 2.66k, False: 87] | Branch (173:73): [True: 2.66k, False: 3] | Branch (173:87): [True: 67, False: 23] | Branch (173:99): [True: 62, False: 5] ------------------ uri.cpp:_ZN5Botan12_GLOBAL__N_128validate_path_query_fragmentENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 45| 2.24k|bool validate_path_query_fragment(std::string_view tail) { 46| | /* 47| | * RFC 3986 syntax for the path/query/fragment of a URI: 48| | * 49| | * URI = scheme ":" hier-part [ "?" query ] [ "#" fragment ] 50| | * pchar = unreserved / pct-encoded / sub-delims / ":" / "@" 51| | * segment = *pchar 52| | * path-abempty = *( "/" segment ) 53| | * query = *( pchar / "/" / "?" ) 54| | * fragment = *( pchar / "/" / "?" ) 55| | */ 56| | 57| 2.24k| constexpr auto is_pchar_or_slash = CharacterValidityTable::alpha_numeric_plus("-._~!$&'()*+,;=:@/"); 58| | 59| 2.24k| enum class State : uint8_t { Path, Query, Fragment }; 60| 2.24k| State state = State::Path; 61| | 62| 176k| for(size_t i = 0; i < tail.size(); ++i) { ------------------ | Branch (62:22): [True: 174k, False: 2.12k] ------------------ 63| 174k| const char c = tail[i]; 64| 174k| if(c == '%') { ------------------ | Branch (64:10): [True: 4.32k, False: 170k] ------------------ 65| 4.32k| if(i + 2 >= tail.size() || !is_valid_percent_escape(tail[i + 1], tail[i + 2])) { ------------------ | Branch (65:13): [True: 5, False: 4.32k] | Branch (65:37): [True: 51, False: 4.27k] ------------------ 66| 56| return false; 67| 56| } 68| 4.27k| i += 2; 69| 4.27k| continue; 70| 4.32k| } 71| 170k| if(c == '?') { ------------------ | Branch (71:10): [True: 3.43k, False: 166k] ------------------ 72| | // First '?' transitions from path to query, any further '?' are literal 73| 3.43k| if(state == State::Path) { ------------------ | Branch (73:13): [True: 913, False: 2.52k] ------------------ 74| 913| state = State::Query; 75| 913| } 76| 3.43k| continue; 77| 3.43k| } 78| 166k| if(c == '#') { ------------------ | Branch (78:10): [True: 852, False: 165k] ------------------ 79| | // There is only one '#' fragment delimiter, second '#' is invalid 80| 852| if(state == State::Fragment) { ------------------ | Branch (80:13): [True: 4, False: 848] ------------------ 81| 4| return false; 82| 4| } 83| 848| state = State::Fragment; 84| 848| continue; 85| 852| } 86| 165k| if(!is_pchar_or_slash(c)) { ------------------ | Branch (86:10): [True: 69, False: 165k] ------------------ 87| 69| return false; 88| 69| } 89| 165k| } 90| 2.12k| return true; 91| 2.24k|} uri.cpp:_ZN5Botan12_GLOBAL__N_123is_valid_percent_escapeEcc: 28| 4.58k|bool is_valid_percent_escape(char c1, char c2) { 29| 4.58k| const auto is_hex_digit = [](char c) { 30| 4.58k| return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') || (c >= 'A' && c <= 'F'); 31| 4.58k| }; 32| | 33| 4.58k| if(!is_hex_digit(c1) || !is_hex_digit(c2)) { ------------------ | Branch (33:7): [True: 46, False: 4.53k] | Branch (33:28): [True: 43, False: 4.49k] ------------------ 34| 89| return false; 35| 89| } 36| | 37| | // Proactively reject embedded null (%00) 38| 4.49k| if(c1 == '0' && c2 == '0') { ------------------ | Branch (38:7): [True: 152, False: 4.34k] | Branch (38:20): [True: 6, False: 146] ------------------ 39| 6| return false; 40| 6| } 41| | 42| 4.48k| return true; 43| 4.49k|} uri.cpp:_ZZN5Botan12_GLOBAL__N_123is_valid_percent_escapeEccENK3$_0clEc: 29| 9.11k| const auto is_hex_digit = [](char c) { 30| 9.11k| return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') || (c >= 'A' && c <= 'F'); ------------------ | Branch (30:15): [True: 9.06k, False: 53] | Branch (30:27): [True: 8.18k, False: 877] | Branch (30:41): [True: 486, False: 444] | Branch (30:53): [True: 461, False: 25] | Branch (30:67): [True: 412, False: 57] | Branch (30:79): [True: 380, False: 32] ------------------ 31| 9.11k| }; uri.cpp:_ZN5Botan12_GLOBAL__N_117validate_userinfoENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 93| 442|bool validate_userinfo(std::string_view userinfo) { 94| 442| constexpr auto is_valid_userinfo_char = CharacterValidityTable::alpha_numeric_plus("-._~!$&'()*+,;=:"); 95| | 96| 7.27k| for(size_t i = 0; i < userinfo.size(); ++i) { ------------------ | Branch (96:22): [True: 6.90k, False: 377] ------------------ 97| 6.90k| const char c = userinfo[i]; 98| 6.90k| if(c == '%') { ------------------ | Branch (98:10): [True: 261, False: 6.64k] ------------------ 99| 261| if(i + 2 >= userinfo.size() || !is_valid_percent_escape(userinfo[i + 1], userinfo[i + 2])) { ------------------ | Branch (99:13): [True: 1, False: 260] | Branch (99:41): [True: 44, False: 216] ------------------ 100| 45| return false; 101| 45| } 102| 216| i += 2; 103| 216| continue; 104| 261| } 105| 6.64k| if(!is_valid_userinfo_char(c)) { ------------------ | Branch (105:10): [True: 20, False: 6.62k] ------------------ 106| 20| return false; 107| 20| } 108| 6.64k| } 109| 377| return true; 110| 442|} uri.cpp:_ZN5Botan12_GLOBAL__N_110parse_portENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 17| 151|std::optional parse_port(std::string_view s) { 18| | // RFC 3986 port is "*DIGIT" but we reject leading zeros ("host:0080") 19| 151| if(const auto port = parse_u16(s, /*require_canonical=*/true)) { ------------------ | Branch (19:18): [True: 128, False: 23] ------------------ 20| 128| if(*port > 0) { ------------------ | Branch (20:10): [True: 123, False: 5] ------------------ 21| 123| return port; 22| 123| } 23| 128| } 24| | 25| 28| return {}; 26| 151|} _ZN5Botan15AlternativeName7add_uriENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 17| 2.46k|void AlternativeName::add_uri(std::string_view uri) { 18| 2.46k| if(uri.empty()) { ------------------ | Branch (18:7): [True: 14, False: 2.45k] ------------------ 19| 14| return; 20| 14| } 21| 2.45k| if(auto parsed = URI::from_string(uri)) { ------------------ | Branch (21:12): [True: 1.82k, False: 630] ------------------ 22| 1.82k| add_uri(std::move(*parsed)); 23| 1.82k| } else { 24| 630| throw Decoding_Error("Invalid URI in SubjectAlternativeName"); 25| 630| } 26| 2.45k|} _ZN5Botan15AlternativeName7add_uriENS_3URIE: 28| 1.82k|void AlternativeName::add_uri(URI uri) { 29| 1.82k| m_uri.insert(std::move(uri)); 30| 1.82k|} _ZN5Botan15AlternativeName9add_emailENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 40| 340|void AlternativeName::add_email(std::string_view addr) { 41| 340| if(addr.empty()) { ------------------ | Branch (41:7): [True: 3, False: 337] ------------------ 42| 3| return; 43| 3| } 44| 337| if(auto parsed = EmailAddress::from_string(addr)) { ------------------ | Branch (44:12): [True: 286, False: 51] ------------------ 45| 286| add_email(std::move(*parsed)); 46| 286| } else { 47| 51| throw Decoding_Error("Invalid email address in SubjectAlternativeName"); 48| 51| } 49| 337|} _ZN5Botan15AlternativeName9add_emailENS_12EmailAddressE: 51| 286|void AlternativeName::add_email(EmailAddress addr) { 52| 286| m_email.insert(std::move(addr)); 53| 286|} _ZN5Botan15AlternativeName7add_dnsENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 63| 6.57k|void AlternativeName::add_dns(std::string_view dns) { 64| 6.57k| if(dns.empty()) { ------------------ | Branch (64:7): [True: 15, False: 6.56k] ------------------ 65| 15| return; 66| 15| } 67| 6.56k| if(auto parsed = DNSName::from_san_string(dns)) { ------------------ | Branch (67:12): [True: 6.44k, False: 116] ------------------ 68| 6.44k| add_dns(std::move(*parsed)); 69| 6.44k| } else { 70| 116| throw Decoding_Error("Invalid DNS name in SubjectAlternativeName"); 71| 116| } 72| 6.56k|} _ZN5Botan15AlternativeName7add_dnsENS_7DNSNameE: 74| 6.44k|void AlternativeName::add_dns(DNSName dns) { 75| 6.44k| m_dns.insert(std::move(dns)); 76| 6.44k|} _ZN5Botan15AlternativeName17add_registered_idERKNS_3OIDE: 97| 829|void AlternativeName::add_registered_id(const OID& oid) { 98| 829| m_registered_ids.insert(oid); 99| 829|} _ZN5Botan15AlternativeName6add_dnERKNS_7X509_DNE: 101| 624|void AlternativeName::add_dn(const X509_DN& dn) { 102| 624| m_dn_names.insert(dn); 103| 624|} _ZN5Botan15AlternativeName16add_ipv4_addressERKNS_11IPv4AddressE: 105| 147|void AlternativeName::add_ipv4_address(const IPv4Address& ip) { 106| 147| m_ipv4_addrs.insert(ip); 107| 147|} _ZN5Botan15AlternativeName16add_ipv6_addressERKNS_11IPv6AddressE: 109| 344|void AlternativeName::add_ipv6_address(const IPv6Address& ip) { 110| 344| m_ipv6_addrs.insert(ip); 111| 344|} _ZNK5Botan15AlternativeName5countEv: 113| 1.24k|size_t AlternativeName::count() const { 114| 1.24k| const auto sum = checked_add(m_dns.size(), 115| 1.24k| m_uri.size(), 116| 1.24k| m_email.size(), 117| 1.24k| m_ipv4_addrs.size(), 118| 1.24k| m_ipv6_addrs.size(), 119| 1.24k| m_dn_names.size(), 120| 1.24k| m_other_name_values.size(), 121| 1.24k| m_registered_ids.size()); 122| | 123| 1.24k| BOTAN_ASSERT_NOMSG(sum.has_value()); ------------------ | | 84| 1.24k| do { \ | | 85| 1.24k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 1.24k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 1.24k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 1.24k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 1.24k] | | ------------------ ------------------ 124| 1.24k| return sum.value(); 125| 1.24k|} _ZNK5Botan15AlternativeName9has_itemsEv: 127| 632|bool AlternativeName::has_items() const { 128| 632| return this->count() > 0; 129| 632|} _ZNK5Botan15AlternativeName8is_emptyEv: 131| 610|bool AlternativeName::is_empty() const { 132| 610| return this->count() == 0; 133| 610|} _ZN5Botan15AlternativeName11decode_fromERNS_11BER_DecoderE: 198| 3.30k|void AlternativeName::decode_from(BER_Decoder& source) { 199| 3.30k| BER_Decoder names = source.start_sequence(); 200| | 201| 22.8k| while(names.more_items()) { ------------------ | Branch (201:10): [True: 20.0k, False: 2.80k] ------------------ 202| 20.0k| const BER_Object obj = names.get_next_object(); 203| | 204| 20.0k| if(obj.is_a(0, ASN1_Class::ExplicitContextSpecific)) { ------------------ | Branch (204:10): [True: 7.77k, False: 12.3k] ------------------ 205| 7.77k| BER_Decoder othername(obj, names.limits()); 206| | 207| 7.77k| OID oid; 208| 7.77k| othername.decode(oid); 209| 7.77k| const BER_Object othername_value_outer = othername.get_next_object(); 210| 7.77k| othername.verify_end(); 211| | 212| 7.77k| if(!othername_value_outer.is_a(0, ASN1_Class::ExplicitContextSpecific)) { ------------------ | Branch (212:13): [True: 11, False: 7.76k] ------------------ 213| 11| throw Decoding_Error("Invalid tags on otherName value"); 214| 11| } 215| | 216| 7.76k| BER_Decoder othername_value_inner(othername_value_outer, names.limits()); 217| | 218| 7.76k| const BER_Object value = othername_value_inner.get_next_object(); 219| 7.76k| othername_value_inner.verify_end(); 220| | 221| | // Capture the inner ANY value verbatim so applications can retrieve 222| | // it regardless of its ASN.1 form. 223| 7.76k| std::vector raw_value; 224| 7.76k| DER_Encoder(raw_value).add_object(value.type_tag(), value.class_tag(), value.data()); 225| 7.76k| m_other_name_values.insert(OtherNameValue{oid, std::move(raw_value)}); 226| | 227| | // Populate old string view for compatibility 228| 7.76k| if(ASN1_String::is_string_type(value.type()) && value.get_class() == ASN1_Class::Universal) { ------------------ | Branch (228:13): [True: 6.83k, False: 928] | Branch (228:58): [True: 6.46k, False: 370] ------------------ 229| 6.46k| try { 230| 6.46k| m_othernames.insert(std::make_pair(oid, ASN1_String(ASN1::to_string(value), value.type()))); 231| 6.46k| } catch(const Invalid_Argument&) { // NOLINT(*-empty-catch) 232| 2.23k| } 233| 6.46k| } 234| | 235| 7.76k| if(oid == OID::from_string("PKIX.SmtpUTF8Mailbox")) { ------------------ | Branch (235:13): [True: 645, False: 7.12k] ------------------ 236| 645| if(!value.is_a(ASN1_Type::Utf8String, ASN1_Class::Universal)) { ------------------ | Branch (236:16): [True: 4, False: 641] ------------------ 237| 4| throw Decoding_Error("SmtpUTF8Mailbox otherName must contain a UTF8String"); 238| 4| } 239| 641| auto parsed_mailbox = SmtpUtf8Mailbox::from_string(ASN1::to_string(value)); 240| 641| if(!parsed_mailbox.has_value()) { ------------------ | Branch (240:16): [True: 22, False: 619] ------------------ 241| 22| throw Decoding_Error("Invalid SmtpUTF8Mailbox encoding"); 242| 22| } 243| 619| m_smtp_utf8_mailboxes.insert(std::move(*parsed_mailbox)); 244| 619| } 245| 12.3k| } else if(obj.is_a(1, ASN1_Class::ContextSpecific)) { ------------------ | Branch (245:17): [True: 340, False: 11.9k] ------------------ 246| 340| add_email(ASN1::to_string(obj)); 247| 11.9k| } else if(obj.is_a(2, ASN1_Class::ContextSpecific)) { ------------------ | Branch (247:17): [True: 6.57k, False: 5.39k] ------------------ 248| 6.57k| add_dns(ASN1::to_string(obj)); 249| 6.57k| } else if(obj.is_a(3, ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) { ------------------ | Branch (249:17): [True: 30, False: 5.36k] ------------------ 250| | // x400Address not supported but it is a SEQUENCE so we know it cannot be empty 251| 30| if(obj.length() == 0) { ------------------ | Branch (251:13): [True: 4, False: 26] ------------------ 252| 4| throw Decoding_Error("Invalid x400Address field"); 253| 4| } 254| 5.36k| } else if(obj.is_a(4, ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) { ------------------ | Branch (254:17): [True: 711, False: 4.65k] ------------------ 255| 711| BER_Decoder dec(obj, names.limits()); 256| 711| X509_DN dn; 257| 711| dec.decode(dn).verify_end(); 258| 711| this->add_dn(dn); 259| 4.65k| } else if(obj.is_a(5, ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) { ------------------ | Branch (259:17): [True: 406, False: 4.24k] ------------------ 260| | // ediPartyName not supported but it is a SEQUENCE so we know it cannot be empty 261| 406| if(obj.length() == 0) { ------------------ | Branch (261:13): [True: 3, False: 403] ------------------ 262| 3| throw Decoding_Error("Invalid ediPartyName field"); 263| 3| } 264| 4.24k| } else if(obj.is_a(6, ASN1_Class::ContextSpecific)) { ------------------ | Branch (264:17): [True: 2.46k, False: 1.77k] ------------------ 265| 2.46k| this->add_uri(ASN1::to_string(obj)); 266| 2.46k| } else if(obj.is_a(7, ASN1_Class::ContextSpecific)) { ------------------ | Branch (266:17): [True: 497, False: 1.28k] ------------------ 267| 497| if(obj.length() == 4) { ------------------ | Branch (267:13): [True: 147, False: 350] ------------------ 268| 147| const uint32_t ip = load_be(obj.bits(), 0); 269| 147| this->add_ipv4_address(ip); 270| 350| } else if(obj.length() == 16) { ------------------ | Branch (270:20): [True: 344, False: 6] ------------------ 271| 344| const IPv6Address ip(std::span{obj.bits(), 16}); 272| 344| this->add_ipv6_address(ip); 273| 344| } else { 274| 6| throw Decoding_Error("Invalid IP constraint neither IPv4 or IPv6"); 275| 6| } 276| 1.28k| } else if(obj.is_a(8, ASN1_Class::ContextSpecific)) { ------------------ | Branch (276:17): [True: 835, False: 447] ------------------ 277| | // [8] registeredID is IMPLICIT OBJECT IDENTIFIER. 278| 835| OID oid; 279| 835| names.decode_implicit(obj, oid, ASN1_Type::ObjectId, ASN1_Class::Universal); 280| 835| this->add_registered_id(oid); 281| 835| } else { 282| 447| throw Decoding_Error(fmt("Unknown GeneralName tag {}/class {}", 283| 447| static_cast(obj.type_tag()), 284| 447| static_cast(obj.class_tag()))); 285| 447| } 286| 20.0k| } 287| 3.30k|} _ZN5Botan17Certificate_StoreD2Ev: 22| 7.83k|Certificate_Store::~Certificate_Store() = default; _ZN5Botan27Certificate_Store_In_MemoryC2Ev: 63| 7.83k|Certificate_Store_In_Memory::Certificate_Store_In_Memory() : m_impl(std::make_unique()) {} _ZN5Botan27Certificate_Store_In_MemoryD2Ev: 73| 7.83k|Certificate_Store_In_Memory::~Certificate_Store_In_Memory() = default; _ZN5Botan27Certificate_Store_In_Memory4implEv: 75| 3.91k|Certificate_Store_In_Memory::Impl& Certificate_Store_In_Memory::impl() { 76| 3.91k| BOTAN_STATE_CHECK(m_impl != nullptr); ------------------ | | 51| 3.91k| do { \ | | 52| 3.91k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 3.91k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 3.91k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 3.91k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 3.91k] | | ------------------ ------------------ 77| 3.91k| return *m_impl; 78| 3.91k|} _ZNK5Botan27Certificate_Store_In_Memory4implEv: 80| 18.9k|const Certificate_Store_In_Memory::Impl& Certificate_Store_In_Memory::impl() const { 81| 18.9k| BOTAN_STATE_CHECK(m_impl != nullptr); ------------------ | | 51| 18.9k| do { \ | | 52| 18.9k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 18.9k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 18.9k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 18.9k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 18.9k] | | ------------------ ------------------ 82| 18.9k| return *m_impl; 83| 18.9k|} _ZN5Botan27Certificate_Store_In_Memory15add_certificateERKNS_16X509_CertificateE: 85| 3.91k|void Certificate_Store_In_Memory::add_certificate(const X509_Certificate& cert) { 86| 3.91k| auto& store = impl(); 87| 3.91k| const auto tag = cert.tag(); 88| 3.91k| if(!store.m_cert_tags.contains(tag)) { ------------------ | Branch (88:7): [True: 3.91k, False: 0] ------------------ 89| 3.91k| store.m_cert_tags.insert(tag); 90| 3.91k| const size_t idx = store.m_certs.size(); 91| 3.91k| store.m_certs.push_back(cert); 92| 3.91k| store.m_dn_to_indices[cert.subject_dn()].push_back(idx); 93| 3.91k| } 94| 3.91k|} _ZNK5Botan27Certificate_Store_In_Memory14find_all_certsERKNS_7X509_DNERKNSt3__16vectorIhNS4_9allocatorIhEEEE: 132| 14.9k| const std::vector& key_id) const { 133| 14.9k| const auto& store = impl(); 134| 14.9k| std::vector matches; 135| | 136| 14.9k| const auto it = store.m_dn_to_indices.find(subject_dn); 137| 14.9k| if(it == store.m_dn_to_indices.end()) { ------------------ | Branch (137:7): [True: 7.78k, False: 7.19k] ------------------ 138| 7.78k| return matches; 139| 7.78k| } 140| | 141| 7.19k| for(const size_t idx : it->second) { ------------------ | Branch (141:25): [True: 7.19k, False: 7.19k] ------------------ 142| 7.19k| const auto& cert = store.m_certs[idx]; 143| 7.19k| BOTAN_ASSERT_NOMSG(cert.subject_dn() == subject_dn); ------------------ | | 84| 7.19k| do { \ | | 85| 7.19k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 7.19k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 7.19k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 7.19k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 7.19k] | | ------------------ ------------------ 144| | 145| 7.19k| if(!key_id.empty()) { ------------------ | Branch (145:10): [True: 655, False: 6.53k] ------------------ 146| 655| const std::vector& skid = cert.subject_key_id(); 147| 655| if(!skid.empty() && skid != key_id) { // no match ------------------ | Branch (147:13): [True: 57, False: 598] | Branch (147:30): [True: 6, False: 51] ------------------ 148| 6| continue; 149| 6| } 150| 655| } 151| | 152| 7.18k| matches.push_back(cert); 153| 7.18k| } 154| | 155| 7.19k| return matches; 156| 14.9k|} _ZNK5Botan27Certificate_Store_In_Memory12find_crl_forERKNS_16X509_CertificateE: 219| 7|std::optional Certificate_Store_In_Memory::find_crl_for(const X509_Certificate& subject) const { 220| 7| const auto& store = impl(); 221| 7| const std::vector& key_id = subject.authority_key_id(); 222| | 223| 7| const auto it = store.m_issuer_dn_to_crl_idx.find(subject.issuer_dn()); 224| 7| if(it == store.m_issuer_dn_to_crl_idx.end()) { ------------------ | Branch (224:7): [True: 7, False: 0] ------------------ 225| 7| return std::nullopt; 226| 7| } 227| | 228| 0| const auto& crl = store.m_crls.at(it->second); 229| | 230| | // Only compare key ids if set in both call and in the CRL 231| 0| if(!key_id.empty()) { ------------------ | Branch (231:7): [True: 0, False: 0] ------------------ 232| 0| const std::vector& akid = crl.authority_key_id(); 233| | 234| 0| if(!akid.empty() && akid != key_id) { ------------------ | Branch (234:10): [True: 0, False: 0] | Branch (234:27): [True: 0, False: 0] ------------------ 235| 0| return std::nullopt; 236| 0| } 237| 0| } 238| | 239| 0| return crl; 240| 0|} _ZNK5Botan27Certificate_Store_In_Memory8containsERKNS_16X509_CertificateE: 242| 3.91k|bool Certificate_Store_In_Memory::contains(const X509_Certificate& cert) const { 243| 3.91k| return impl().m_cert_tags.contains(cert.tag()); 244| 3.91k|} _ZN5Botan27Certificate_Store_In_MemoryC2ERKNS_16X509_CertificateE: 246| 3.91k|Certificate_Store_In_Memory::Certificate_Store_In_Memory(const X509_Certificate& cert) : Certificate_Store_In_Memory() { 247| 3.91k| add_certificate(cert); 248| 3.91k|} _ZN5Botan11GeneralName13DNSConstraint11from_stringENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 58| 23|std::optional GeneralName::DNSConstraint::from_string(std::string_view input) { 59| | // TODO(C++23): validate_subtree_constraint_host(input, RequireFQDN::No) 60| | // .transform([](std::string s) { return DNSConstraint(std::move(s)); }); 61| 23| if(auto canonical = validate_subtree_constraint_host(input, RequireFQDN::No)) { ------------------ | Branch (61:12): [True: 16, False: 7] ------------------ 62| 16| return DNSConstraint(std::move(*canonical)); 63| 16| } else { 64| 7| return std::nullopt; 65| 7| } 66| 23|} _ZN5Botan11GeneralName13URIConstraint11from_stringENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 76| 20|std::optional GeneralName::URIConstraint::from_string(std::string_view input) { 77| | /* 78| | RFC 5280 4.2.1.10: 79| | The constraint MUST be specified as a fully qualified domain 80| | name and MAY specify a host or a domain. Examples would be 81| | "host.example.com" and ".example.com". 82| | */ 83| 20| if(auto canonical = validate_subtree_constraint_host(input, RequireFQDN::Yes)) { ------------------ | Branch (83:12): [True: 9, False: 11] ------------------ 84| 9| return URIConstraint(std::move(*canonical)); 85| 11| } else { 86| 11| return std::nullopt; 87| 11| } 88| 20|} _ZN5Botan11GeneralName15EmailConstraint11from_stringENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 98| 36|std::optional GeneralName::EmailConstraint::from_string(std::string_view input) { 99| 36| if(input.empty()) { ------------------ | Branch (99:7): [True: 2, False: 34] ------------------ 100| 2| return std::nullopt; 101| 2| } 102| 34| if(input.find('@') != std::string_view::npos) { ------------------ | Branch (102:7): [True: 20, False: 14] ------------------ 103| | // Mailbox form: 104| 20| auto email = EmailAddress::from_string(input); 105| 20| if(!email.has_value()) { ------------------ | Branch (105:10): [True: 9, False: 11] ------------------ 106| 9| return std::nullopt; 107| 9| } 108| 11| return EmailConstraint(email->to_string()); 109| 20| } 110| 14| if(auto canonical = validate_subtree_constraint_host(input, RequireFQDN::No)) { ------------------ | Branch (110:12): [True: 9, False: 5] ------------------ 111| | // Host form 112| 9| return EmailConstraint(std::move(*canonical)); 113| 9| } 114| 5| return std::nullopt; 115| 14|} _ZN5Botan11GeneralName11decode_fromERNS_11BER_DecoderE: 467| 438|void GeneralName::decode_from(BER_Decoder& ber) { 468| 438| const BER_Object obj = ber.get_next_object(); 469| | 470| 438| if(obj.is_a(0, ASN1_Class::ExplicitContextSpecific)) { ------------------ | Branch (470:7): [True: 42, False: 396] ------------------ 471| 42| m_type = NameType::Other; 472| 396| } else if(obj.is_a(1, ASN1_Class::ContextSpecific)) { ------------------ | Branch (472:14): [True: 36, False: 360] ------------------ 473| | /* 474| | RFC 5280 4.2.1.10: 475| | A name constraint for Internet mail addresses MAY specify a 476| | particular mailbox, all addresses at a particular host, or all 477| | mailboxes in a domain. 478| | EmailConstraint::from_string validates and canonicalizes per the 479| | Section 7.5 matching rules. 480| | */ 481| 36| auto constraint = EmailConstraint::from_string(ASN1::to_string(obj)); 482| 36| if(!constraint.has_value()) { ------------------ | Branch (482:10): [True: 16, False: 20] ------------------ 483| 16| throw Decoding_Error("Malformed RFC822 name in GeneralName"); 484| 16| } 485| 20| m_type = NameType::RFC822; 486| 20| m_name = std::move(*constraint); 487| 360| } else if(obj.is_a(2, ASN1_Class::ContextSpecific)) { ------------------ | Branch (487:14): [True: 23, False: 337] ------------------ 488| 23| auto constraint = DNSConstraint::from_string(ASN1::to_string(obj)); 489| 23| if(!constraint.has_value()) { ------------------ | Branch (489:10): [True: 7, False: 16] ------------------ 490| 7| throw Decoding_Error("Malformed DNS name in GeneralName"); 491| 7| } 492| 16| m_type = NameType::DNS; 493| 16| m_name = std::move(*constraint); 494| 337| } else if(obj.is_a(6, ASN1_Class::ContextSpecific)) { ------------------ | Branch (494:14): [True: 20, False: 317] ------------------ 495| | /* 496| | RFC 5280 4.2.1.10: 497| | For URIs, the constraint applies to the host part of the name. 498| | The constraint MUST be specified as a fully qualified domain 499| | name and MAY specify a host or a domain. Examples would be 500| | "host.example.com" and ".example.com". 501| | */ 502| 20| auto constraint = URIConstraint::from_string(ASN1::to_string(obj)); 503| 20| if(!constraint.has_value()) { ------------------ | Branch (503:10): [True: 11, False: 9] ------------------ 504| 11| throw Decoding_Error("Malformed URI name in GeneralName"); 505| 11| } 506| 9| m_type = NameType::URI; 507| 9| m_name = std::move(*constraint); 508| 317| } else if(obj.is_a(4, ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) { ------------------ | Branch (508:14): [True: 2, False: 315] ------------------ 509| 2| X509_DN dn; 510| 2| BER_Decoder dec(obj, ber.limits()); 511| 2| dn.decode_from(dec); 512| 2| dec.verify_end(); 513| 2| m_type = NameType::DN; 514| 2| m_name.emplace(dn); 515| 315| } else if(obj.is_a(7, ASN1_Class::ContextSpecific)) { ------------------ | Branch (515:14): [True: 89, False: 226] ------------------ 516| 89| if(obj.length() == 8) { ------------------ | Branch (516:10): [True: 75, False: 14] ------------------ 517| 75| const auto addr_and_mask = std::span{obj.bits(), 8}; 518| 75| auto subnet = IPv4Subnet::from_address_and_mask(addr_and_mask); 519| 75| if(!subnet.has_value()) { ------------------ | Branch (519:13): [True: 22, False: 53] ------------------ 520| 22| throw Decoding_Error("IPv4 name constraint mask is not a contiguous CIDR prefix"); 521| 22| } 522| | 523| 53| m_type = NameType::IPv4; 524| 53| m_name.emplace(*subnet); 525| 53| } else if(obj.length() == 32) { ------------------ | Branch (525:17): [True: 10, False: 4] ------------------ 526| 10| const auto addr_and_mask = std::span{obj.bits(), 32}; 527| 10| auto subnet = IPv6Subnet::from_address_and_mask(addr_and_mask); 528| 10| if(!subnet.has_value()) { ------------------ | Branch (528:13): [True: 2, False: 8] ------------------ 529| 2| throw Decoding_Error("IPv6 name constraint mask is not a contiguous CIDR prefix"); 530| 2| } 531| | 532| 8| m_type = NameType::IPv6; 533| 8| m_name.emplace(*subnet); 534| 8| } else { 535| 4| throw Decoding_Error("Invalid IP name constraint size " + std::to_string(obj.length())); 536| 4| } 537| 226| } else { 538| 226| m_type = NameType::Unknown; 539| 226| } 540| 438|} _ZN5Botan14GeneralSubtreeC2Ev: 790| 477|GeneralSubtree::GeneralSubtree() = default; _ZN5Botan14GeneralSubtree11decode_fromERNS_11BER_DecoderE: 803| 477|void GeneralSubtree::decode_from(BER_Decoder& ber) { 804| | /* 805| | * RFC 5280 Section 4.2.1.10: 806| | * Within this profile, the minimum and maximum fields are not used with any 807| | * name forms, thus, the minimum MUST be zero, and maximum MUST be absent. 808| | */ 809| 477| size_t minimum = 0; 810| 477| std::optional maximum; 811| | 812| 477| ber.start_sequence() 813| 477| .decode(m_base) 814| 477| .decode_optional(minimum, ASN1_Type(0), ASN1_Class::ContextSpecific, size_t(0)) 815| 477| .decode_optional(maximum, ASN1_Type(1), ASN1_Class::ContextSpecific) 816| 477| .end_cons(); 817| | 818| 477| if(minimum != 0) { ------------------ | Branch (818:7): [True: 1, False: 476] ------------------ 819| 1| throw Decoding_Error("GeneralSubtree minimum must be 0"); 820| 1| } 821| 476| if(maximum.has_value()) { ------------------ | Branch (821:7): [True: 1, False: 475] ------------------ 822| 1| throw Decoding_Error("GeneralSubtree maximum must be absent"); 823| 1| } 824| 476|} _ZN5Botan15NameConstraintsC2EONSt3__16vectorINS_14GeneralSubtreeENS1_9allocatorIS3_EEEES7_: 833| 42| m_permitted_subtrees(std::move(permitted_subtrees)), m_excluded_subtrees(std::move(excluded_subtrees)) { 834| 66| for(const auto& c : m_permitted_subtrees) { ------------------ | Branch (834:22): [True: 66, False: 42] ------------------ 835| 66| m_permitted_name_types.insert(c.base().type_code()); 836| 66| } 837| 74| for(const auto& c : m_excluded_subtrees) { ------------------ | Branch (837:22): [True: 74, False: 42] ------------------ 838| 74| m_excluded_name_types.insert(c.base().type_code()); 839| 74| } 840| 42|} name_constraint.cpp:_ZN5Botan12_GLOBAL__N_132validate_subtree_constraint_hostENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS0_11RequireFQDNE: 35| 57|std::optional validate_subtree_constraint_host(std::string_view input, RequireFQDN require_fqdn) { 36| 57| if(input.empty()) { ------------------ | Branch (36:7): [True: 1, False: 56] ------------------ 37| 1| return std::nullopt; 38| 1| } 39| 56| const bool subtree = input.starts_with('.'); 40| 56| const std::string_view body = subtree ? input.substr(1) : input; ------------------ | Branch (40:34): [True: 8, False: 48] ------------------ 41| 56| auto dns = DNSName::from_string(body); 42| 56| if(!dns.has_value()) { ------------------ | Branch (42:7): [True: 21, False: 35] ------------------ 43| 21| return std::nullopt; 44| 21| } 45| 35| if(require_fqdn == RequireFQDN::Yes && dns->to_string().find('.') == std::string::npos) { ------------------ | Branch (45:7): [True: 10, False: 25] | Branch (45:43): [True: 1, False: 9] ------------------ 46| 1| return std::nullopt; 47| 1| } 48| | 49| 34| if(subtree) { ------------------ | Branch (49:7): [True: 3, False: 31] ------------------ 50| 3| return std::string(".") + dns->to_string(); 51| 31| } else { 52| 31| return dns->to_string(); 53| 31| } 54| 34|} _ZN5BotaneqERKNS_7X509_DNES2_: 340| 16.7k|bool operator==(const X509_DN& dn1, const X509_DN& dn2) { 341| 16.7k| return dn1._canonical_bytes() == dn2._canonical_bytes(); 342| 16.7k|} _ZN5BotanneERKNS_7X509_DNES2_: 347| 70|bool operator!=(const X509_DN& dn1, const X509_DN& dn2) { 348| 70| return !(dn1 == dn2); 349| 70|} _ZN5BotanltERKNS_7X509_DNES2_: 355| 14.9k|bool operator<(const X509_DN& dn1, const X509_DN& dn2) { 356| 14.9k| return dn1._canonical_bytes() < dn2._canonical_bytes(); 357| 14.9k|} _ZN5Botan7X509_DN11decode_fromERNS_11BER_DecoderE: 405| 22.0k|void X509_DN::decode_from(BER_Decoder& source) { 406| 22.0k| std::vector bits; 407| | 408| 22.0k| source.start_sequence().raw_bytes(bits).end_cons(); 409| | 410| 22.0k| BER_Decoder sequence(bits, source.limits()); 411| | 412| 22.0k| std::vector>> rdns; 413| | 414| | // Cap AVAs per RDN to bound work for downstream set-based matching. 415| | // No legitimate cert has anywhere near this many AVAs in a single RDN. 416| 22.0k| constexpr size_t MAX_AVAS_PER_RDN = 32; 417| | 418| 61.8k| while(sequence.more_items()) { ------------------ | Branch (418:10): [True: 39.8k, False: 22.0k] ------------------ 419| 39.8k| BER_Decoder rdn_decoder = sequence.start_set(); 420| | 421| 39.8k| std::vector> rdn; 422| 79.9k| while(rdn_decoder.more_items()) { ------------------ | Branch (422:13): [True: 40.1k, False: 39.8k] ------------------ 423| 40.1k| OID oid; 424| 40.1k| ASN1_String str; 425| | 426| 40.1k| rdn_decoder.start_sequence() 427| 40.1k| .decode(oid) 428| 40.1k| .decode(str) // TODO support Any 429| 40.1k| .end_cons(); 430| | 431| 40.1k| rdn.emplace_back(std::move(oid), std::move(str)); 432| | 433| 40.1k| if(rdn.size() > MAX_AVAS_PER_RDN) { ------------------ | Branch (433:13): [True: 0, False: 40.1k] ------------------ 434| 0| throw Decoding_Error("X.500 RDN has too many attribute-value assertions"); 435| 0| } 436| 40.1k| } 437| | 438| | /* 439| | RFC 5280 4.1.2.4: 440| | RelativeDistinguishedName ::= 441| | SET SIZE (1..MAX) OF AttributeTypeAndValue 442| | */ 443| 39.8k| if(rdn.empty()) { ------------------ | Branch (443:10): [True: 1, False: 39.8k] ------------------ 444| 1| throw Decoding_Error("X.500 RDN must contain at least one attribute-value assertion"); 445| 1| } 446| 39.8k| rdns.push_back(std::move(rdn)); 447| 39.8k| } 448| | 449| 22.0k| auto canonical_bits = canonicalize_dn(rdns); 450| | 451| 22.0k| m_rdn = std::move(rdns); 452| 22.0k| m_dn_bits = std::move(bits); 453| 22.0k| m_canonical_dn_bits = std::move(canonical_bits); 454| 22.0k|} x509_dn.cpp:_ZN5Botan12_GLOBAL__N_120append_canonical_rdnERNSt3__16vectorIhNS1_9allocatorIhEEEERKNS2_INS1_4pairINS_3OIDENS_11ASN1_StringEEENS3_ISA_EEEE: 152| 39.1k|void append_canonical_rdn(std::vector& canonical_bits, const std::vector>& rdn) { 153| 39.1k| const auto append_canonical_data = [](std::vector& out, const T& data) { 154| 39.1k| const std::array data_len = store_le(static_cast(data.size())); 155| 39.1k| out.insert(out.end(), data_len.begin(), data_len.end()); 156| 39.1k| out.insert(out.end(), data.begin(), data.end()); 157| 39.1k| }; 158| | 159| 39.1k| std::vector rdn_bits; 160| | 161| 39.5k| for(const auto& [oid, value] : canonicalize_rdn(rdn)) { ------------------ | Branch (161:33): [True: 39.5k, False: 39.1k] ------------------ 162| 39.5k| append_canonical_data(rdn_bits, oid.BER_encode()); 163| 39.5k| append_canonical_data(rdn_bits, value); 164| 39.5k| } 165| | 166| 39.1k| append_canonical_data(canonical_bits, rdn_bits); 167| 39.1k|} x509_dn.cpp:_ZN5Botan12_GLOBAL__N_116canonicalize_rdnERKNSt3__16vectorINS1_4pairINS_3OIDENS_11ASN1_StringEEENS1_9allocatorIS6_EEEE: 136| 39.1k|std::vector> canonicalize_rdn(const std::vector>& rdn) { 137| 39.1k| std::vector> result; 138| 39.1k| result.reserve(rdn.size()); 139| 39.5k| for(const auto& ava : rdn) { ------------------ | Branch (139:24): [True: 39.5k, False: 39.1k] ------------------ 140| 39.5k| result.emplace_back(ava.first, X500_Char_Iterator::canonicalize(ava.second.value())); 141| 39.5k| } 142| 39.1k| if(result.size() != 1) { ------------------ | Branch (142:7): [True: 179, False: 38.9k] ------------------ 143| 179| std::sort(result.begin(), result.end()); 144| 179| } 145| 39.1k| return result; 146| 39.1k|} x509_dn.cpp:_ZN5Botan12_GLOBAL__N_118X500_Char_Iterator12canonicalizeENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 114| 39.5k| static std::string canonicalize(std::string_view name) { 115| 39.5k| std::string result; 116| 39.5k| result.reserve(name.size()); 117| | 118| 39.5k| X500_Char_Iterator it(name); 119| 509k| while(auto c = it.next()) { ------------------ | Branch (119:21): [True: 469k, False: 39.5k] ------------------ 120| 469k| result += *c; 121| 469k| } 122| | 123| 39.5k| return result; 124| 39.5k| } x509_dn.cpp:_ZN5Botan12_GLOBAL__N_118X500_Char_IteratorC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 81| 39.5k| explicit X500_Char_Iterator(std::string_view s) : m_str(s), m_pos(0) { 82| | // Skip leading whitespace 83| 39.8k| while(m_pos < m_str.size() && is_space(m_str[m_pos])) { ------------------ | Branch (83:16): [True: 39.5k, False: 355] | Branch (83:40): [True: 344, False: 39.1k] ------------------ 84| 344| ++m_pos; 85| 344| } 86| 39.5k| } x509_dn.cpp:_ZN5Botan12_GLOBAL__N_118X500_Char_Iterator4nextEv: 89| 509k| std::optional next() { 90| 509k| if(m_pos >= m_str.size()) { ------------------ | Branch (90:13): [True: 39.3k, False: 469k] ------------------ 91| 39.3k| return std::nullopt; 92| 39.3k| } 93| | 94| 469k| if(is_space(m_str[m_pos])) { ------------------ | Branch (94:13): [True: 24.9k, False: 444k] ------------------ 95| | // Skip the entire whitespace run 96| 50.1k| while(m_pos < m_str.size() && is_space(m_str[m_pos])) { ------------------ | Branch (96:19): [True: 50.0k, False: 145] | Branch (96:43): [True: 25.2k, False: 24.7k] ------------------ 97| 25.2k| ++m_pos; 98| 25.2k| } 99| | // Emit a single space only if more content follows (strip trailing ws) 100| 24.9k| if(m_pos < m_str.size()) { ------------------ | Branch (100:16): [True: 24.7k, False: 145] ------------------ 101| 24.7k| return ' '; 102| 24.7k| } 103| 145| return std::nullopt; 104| 24.9k| } 105| | 106| 444k| const char c = m_str[m_pos++]; 107| | // Locale-independent ASCII fold; RFC 5280 DN matching does not depend on libc locale 108| 444k| if(c >= 'A' && c <= 'Z') { ------------------ | Branch (108:13): [True: 334k, False: 110k] | Branch (108:25): [True: 58.9k, False: 275k] ------------------ 109| 58.9k| return static_cast(c + ('a' - 'A')); 110| 58.9k| } 111| 385k| return c; 112| 444k| } x509_dn.cpp:_ZZN5Botan12_GLOBAL__N_120append_canonical_rdnERNSt3__16vectorIhNS1_9allocatorIhEEEERKNS2_INS1_4pairINS_3OIDENS_11ASN1_StringEEENS3_ISA_EEEEENK3$_0clIS5_EEDaS6_RKT_: 153| 78.6k| const auto append_canonical_data = [](std::vector& out, const T& data) { 154| 78.6k| const std::array data_len = store_le(static_cast(data.size())); 155| 78.6k| out.insert(out.end(), data_len.begin(), data_len.end()); 156| 78.6k| out.insert(out.end(), data.begin(), data.end()); 157| 78.6k| }; x509_dn.cpp:_ZZN5Botan12_GLOBAL__N_120append_canonical_rdnERNSt3__16vectorIhNS1_9allocatorIhEEEERKNS2_INS1_4pairINS_3OIDENS_11ASN1_StringEEENS3_ISA_EEEEENK3$_0clINS1_12basic_stringIcNS1_11char_traitsIcEENS3_IcEEEEEEDaS6_RKT_: 153| 39.5k| const auto append_canonical_data = [](std::vector& out, const T& data) { 154| 39.5k| const std::array data_len = store_le(static_cast(data.size())); 155| 39.5k| out.insert(out.end(), data_len.begin(), data_len.end()); 156| 39.5k| out.insert(out.end(), data.begin(), data.end()); 157| 39.5k| }; x509_dn.cpp:_ZN5Botan12_GLOBAL__N_115canonicalize_dnERKNSt3__16vectorINS2_INS1_4pairINS_3OIDENS_11ASN1_StringEEENS1_9allocatorIS6_EEEENS7_IS9_EEEE: 169| 21.5k|std::vector canonicalize_dn(const std::vector>>& rdns) { 170| 21.5k| std::vector canonical_bits; 171| | 172| 39.1k| for(const auto& rdn : rdns) { ------------------ | Branch (172:24): [True: 39.1k, False: 21.5k] ------------------ 173| 39.1k| append_canonical_rdn(canonical_bits, rdn); 174| 39.1k| } 175| | 176| 21.5k| return canonical_bits; 177| 21.5k|} x509_dn.cpp:_ZN5Botan12_GLOBAL__N_18is_spaceEc: 26| 559k|bool is_space(char c) { 27| 559k| return c == ' ' || c == '\t'; ------------------ | Branch (27:11): [True: 49.6k, False: 509k] | Branch (27:23): [True: 860, False: 508k] ------------------ 28| 559k|} _ZN5Botan7X509_DN9lookup_ubERKNS_3OIDE: 16| 63|size_t X509_DN::lookup_ub(const OID& oid) { 17| | /* 18| | * See RFC 5280 Appendix A.1 starting with comment "-- Upper Bounds" 19| | */ 20| | 21| | // NOLINTBEGIN(*-branch-clone) 22| 63| if(auto iso_dn = is_sub_element_of(oid, {2, 5, 4})) { ------------------ | Branch (22:12): [True: 62, False: 1] ------------------ 23| 62| switch(*iso_dn) { 24| 46| case 3: ------------------ | Branch (24:10): [True: 46, False: 16] ------------------ 25| | // X520.CommonName 26| 46| return 64; 27| 0| case 4: ------------------ | Branch (27:10): [True: 0, False: 62] ------------------ 28| | // X520.Surname 29| 0| return 40; 30| 0| case 5: ------------------ | Branch (30:10): [True: 0, False: 62] ------------------ 31| | // X520.SerialNumber 32| 0| return 64; 33| 5| case 6: ------------------ | Branch (33:10): [True: 5, False: 57] ------------------ 34| | // X520.Country 35| 5| return 3; 36| 1| case 7: ------------------ | Branch (36:10): [True: 1, False: 61] ------------------ 37| | // X520.Locality 38| 1| return 128; 39| 1| case 8: ------------------ | Branch (39:10): [True: 1, False: 61] ------------------ 40| | // X520.State 41| 1| return 128; 42| 0| case 9: ------------------ | Branch (42:10): [True: 0, False: 62] ------------------ 43| | // X520.StreetAddress 44| 0| return 128; 45| 5| case 10: ------------------ | Branch (45:10): [True: 5, False: 57] ------------------ 46| | // X520.Organization 47| 5| return 64; 48| 4| case 11: ------------------ | Branch (48:10): [True: 4, False: 58] ------------------ 49| | // X520.OrganizationalUnit 50| 4| return 64; 51| 0| case 12: ------------------ | Branch (51:10): [True: 0, False: 62] ------------------ 52| | // X520.Title 53| 0| return 64; 54| 0| case 42: ------------------ | Branch (54:10): [True: 0, False: 62] ------------------ 55| | // X520.GivenName 56| 0| return 16; 57| 0| case 43: ------------------ | Branch (57:10): [True: 0, False: 62] ------------------ 58| | // X520.Initials 59| 0| return 5; 60| 0| case 44: ------------------ | Branch (60:10): [True: 0, False: 62] ------------------ 61| | // X520.GenerationalQualifier 62| 0| return 3; 63| 0| case 46: ------------------ | Branch (63:10): [True: 0, False: 62] ------------------ 64| | // X520.DNQualifier 65| 0| return 64; 66| 0| case 65: ------------------ | Branch (66:10): [True: 0, False: 62] ------------------ 67| | // X520.Pseudonym 68| 0| return 128; 69| 0| default: ------------------ | Branch (69:10): [True: 0, False: 62] ------------------ 70| 0| return 0; 71| 62| } 72| 62| } 73| | 74| | // NOLINTEND(*-branch-clone) 75| | 76| 1| return 0; 77| 63|} _ZN5Botan14Cert_Extension15IPAddressBlocks9IPAddressILNS1_7VersionE4EE10from_bytesENSt3__14spanIKhLm18446744073709551615EEE: 2571| 156|IPAddressBlocks::IPAddress IPAddressBlocks::IPAddress::from_bytes(std::span v) { 2572| 156| if(v.size() != Length) { ------------------ | Branch (2572:7): [True: 0, False: 156] ------------------ 2573| 0| throw Decoding_Error("number of bytes does not match IP version used"); 2574| 0| } 2575| | 2576| 156| IPAddress addr{}; 2577| 156| std::copy(v.begin(), v.end(), addr.m_value.begin()); 2578| 156| return addr; 2579| 156|} _ZN5Botan14Cert_Extension15IPAddressBlocks9IPAddressILNS1_7VersionE16EE10from_bytesENSt3__14spanIKhLm18446744073709551615EEE: 2571| 166|IPAddressBlocks::IPAddress IPAddressBlocks::IPAddress::from_bytes(std::span v) { 2572| 166| if(v.size() != Length) { ------------------ | Branch (2572:7): [True: 0, False: 166] ------------------ 2573| 0| throw Decoding_Error("number of bytes does not match IP version used"); 2574| 0| } 2575| | 2576| 166| IPAddress addr{}; 2577| 166| std::copy(v.begin(), v.end(), addr.m_value.begin()); 2578| 166| return addr; 2579| 166|} _ZN5Botan14Cert_Extension15IPAddressBlocks16IPAddressOrRangeILNS1_7VersionE4EE11decode_fromERNS_11BER_DecoderE: 2465| 115|void IPAddressBlocks::IPAddressOrRange::decode_from(Botan::BER_Decoder& from) { 2466| 115| const ASN1_Type next_tag = from.peek_next_object().type_tag(); 2467| | 2468| | // this can either be a prefix or a single address 2469| 115| if(next_tag == ASN1_Type::BitString) { ------------------ | Branch (2469:7): [True: 85, False: 30] ------------------ 2470| | // construct a min and a max address from the prefix 2471| | 2472| 85| ASN1_BitString prefix; 2473| 85| from.decode_bitstring(prefix); 2474| | 2475| | // min address gets filled with 0's 2476| 85| m_min = decode_single_address(prefix, true); 2477| | // max address with 1's 2478| 85| m_max = decode_single_address(prefix, false); 2479| 85| } else if(next_tag == ASN1_Type::Sequence) { ------------------ | Branch (2479:14): [True: 9, False: 21] ------------------ 2480| | // this is a range 2481| | 2482| 9| ASN1_BitString addr_min; 2483| 9| ASN1_BitString addr_max; 2484| | 2485| 9| from.start_sequence().decode_bitstring(addr_min).decode_bitstring(addr_max).end_cons(); 2486| | 2487| | /* RFC 3779 Section 2.2.3.9 - 2488| | * 2489| | * The BIT STRING for the minimum address results from removing all the 2490| | * least-significant zero-bits from the minimum address. The BIT STRING 2491| | * for the maximum address results from removing all the least-significant 2492| | * one-bits from the maximum address. 2493| | * 2494| | * So a canonically encoded minimum ends in a one bit (or is empty) and 2495| | * a canonically encoded maximum ends in a zero bit (or is empty). 2496| | * Section 2.2.3.9 also requires that a maximum "MUST contain at least 2497| | * one bit whose value is 1", but verified erratum 2537 removes that 2498| | * sentence as it contradicts the removal rule, so it is not checked. 2499| | */ 2500| 9| if(!addr_min.bytes().empty() && ((addr_min.bytes().back() >> addr_min.unused_bits()) & 1) == 0) { ------------------ | Branch (2500:10): [True: 0, False: 9] | Branch (2500:10): [True: 0, False: 9] | Branch (2500:39): [True: 0, False: 0] ------------------ 2501| 0| throw Decoding_Error("IPAddressRange minimum must have trailing zero bits removed"); 2502| 0| } 2503| 9| if(!addr_max.bytes().empty() && ((addr_max.bytes().back() >> addr_max.unused_bits()) & 1) == 1) { ------------------ | Branch (2503:10): [True: 0, False: 9] | Branch (2503:10): [True: 0, False: 9] | Branch (2503:39): [True: 0, False: 0] ------------------ 2504| 0| throw Decoding_Error("IPAddressRange maximum must have trailing one bits removed"); 2505| 0| } 2506| | 2507| 9| m_min = decode_single_address(addr_min, true); 2508| 9| m_max = decode_single_address(addr_max, false); 2509| | 2510| 9| if(m_min > m_max) { ------------------ | Branch (2510:10): [True: 0, False: 9] ------------------ 2511| 0| throw Decoding_Error("IP address ranges must be sorted."); 2512| 0| } 2513| | 2514| | /* RFC 3779 Section 2.2.3.7 - 2515| | * 2516| | * This specification requires that any range of addresses that can be 2517| | * encoded as a prefix MUST be encoded using an IPAddress element (a BIT 2518| | * STRING), and any range that cannot be encoded as a prefix MUST be 2519| | * encoded using an IPAddressRange 2520| | */ 2521| 9| if(range_is_expressible_as_prefix(m_min, m_max)) { ------------------ | Branch (2521:10): [True: 0, False: 9] ------------------ 2522| 0| throw Decoding_Error("IPAddressRange expressible as a prefix must be encoded as a prefix"); 2523| 0| } 2524| 21| } else { 2525| 21| throw Decoding_Error(fmt("Unexpected type for IPAddressOrRange {}", static_cast(next_tag))); 2526| 21| } 2527| 115|} _ZN5Botan14Cert_Extension15IPAddressBlocks16IPAddressOrRangeILNS1_7VersionE4EE21decode_single_addressERKNS_14ASN1_BitStringEb: 2531| 160| bool min) { 2532| 160| const size_t version_octets = static_cast(V); 2533| | 2534| | // decode a single address according to https://datatracker.ietf.org/doc/html/rfc3779#section-2.1.1 and following 2535| | 2536| 160| if(decoded.bytes().size() > version_octets) { ------------------ | Branch (2536:7): [True: 4, False: 156] ------------------ 2537| 4| throw Decoding_Error(fmt("IP address range entries must have a length between 0 and {} bytes.", version_octets)); 2538| 4| } 2539| | 2540| 156| std::vector address(decoded.bytes().begin(), decoded.bytes().end()); 2541| | 2542| | // ASN1_BitString guarantees the unused bits are zero (and absent if empty), 2543| | // which is already correct for a min address; for a max address set them 2544| 156| if(!min && decoded.unused_bits() > 0) { ------------------ | Branch (2544:7): [True: 78, False: 78] | Branch (2544:15): [True: 17, False: 61] ------------------ 2545| 17| address.back() |= static_cast((1 << decoded.unused_bits()) - 1); 2546| 17| } 2547| | 2548| | // pad to version length with 0's for min addresses, 255's (0xff) for max addresses 2549| 156| address.resize(version_octets, min ? 0x00 : 0xFF); ------------------ | Branch (2549:35): [True: 78, False: 78] ------------------ 2550| | 2551| 156| return IPAddressBlocks::IPAddress::from_bytes(address); 2552| 160|} _ZN5Botan14Cert_Extension15IPAddressBlocks16IPAddressOrRangeILNS1_7VersionE16EE11decode_fromERNS_11BER_DecoderE: 2465| 133|void IPAddressBlocks::IPAddressOrRange::decode_from(Botan::BER_Decoder& from) { 2466| 133| const ASN1_Type next_tag = from.peek_next_object().type_tag(); 2467| | 2468| | // this can either be a prefix or a single address 2469| 133| if(next_tag == ASN1_Type::BitString) { ------------------ | Branch (2469:7): [True: 91, False: 42] ------------------ 2470| | // construct a min and a max address from the prefix 2471| | 2472| 91| ASN1_BitString prefix; 2473| 91| from.decode_bitstring(prefix); 2474| | 2475| | // min address gets filled with 0's 2476| 91| m_min = decode_single_address(prefix, true); 2477| | // max address with 1's 2478| 91| m_max = decode_single_address(prefix, false); 2479| 91| } else if(next_tag == ASN1_Type::Sequence) { ------------------ | Branch (2479:14): [True: 8, False: 34] ------------------ 2480| | // this is a range 2481| | 2482| 8| ASN1_BitString addr_min; 2483| 8| ASN1_BitString addr_max; 2484| | 2485| 8| from.start_sequence().decode_bitstring(addr_min).decode_bitstring(addr_max).end_cons(); 2486| | 2487| | /* RFC 3779 Section 2.2.3.9 - 2488| | * 2489| | * The BIT STRING for the minimum address results from removing all the 2490| | * least-significant zero-bits from the minimum address. The BIT STRING 2491| | * for the maximum address results from removing all the least-significant 2492| | * one-bits from the maximum address. 2493| | * 2494| | * So a canonically encoded minimum ends in a one bit (or is empty) and 2495| | * a canonically encoded maximum ends in a zero bit (or is empty). 2496| | * Section 2.2.3.9 also requires that a maximum "MUST contain at least 2497| | * one bit whose value is 1", but verified erratum 2537 removes that 2498| | * sentence as it contradicts the removal rule, so it is not checked. 2499| | */ 2500| 8| if(!addr_min.bytes().empty() && ((addr_min.bytes().back() >> addr_min.unused_bits()) & 1) == 0) { ------------------ | Branch (2500:10): [True: 0, False: 8] | Branch (2500:10): [True: 0, False: 8] | Branch (2500:39): [True: 0, False: 0] ------------------ 2501| 0| throw Decoding_Error("IPAddressRange minimum must have trailing zero bits removed"); 2502| 0| } 2503| 8| if(!addr_max.bytes().empty() && ((addr_max.bytes().back() >> addr_max.unused_bits()) & 1) == 1) { ------------------ | Branch (2503:10): [True: 0, False: 8] | Branch (2503:10): [True: 0, False: 8] | Branch (2503:39): [True: 0, False: 0] ------------------ 2504| 0| throw Decoding_Error("IPAddressRange maximum must have trailing one bits removed"); 2505| 0| } 2506| | 2507| 8| m_min = decode_single_address(addr_min, true); 2508| 8| m_max = decode_single_address(addr_max, false); 2509| | 2510| 8| if(m_min > m_max) { ------------------ | Branch (2510:10): [True: 0, False: 8] ------------------ 2511| 0| throw Decoding_Error("IP address ranges must be sorted."); 2512| 0| } 2513| | 2514| | /* RFC 3779 Section 2.2.3.7 - 2515| | * 2516| | * This specification requires that any range of addresses that can be 2517| | * encoded as a prefix MUST be encoded using an IPAddress element (a BIT 2518| | * STRING), and any range that cannot be encoded as a prefix MUST be 2519| | * encoded using an IPAddressRange 2520| | */ 2521| 8| if(range_is_expressible_as_prefix(m_min, m_max)) { ------------------ | Branch (2521:10): [True: 0, False: 8] ------------------ 2522| 0| throw Decoding_Error("IPAddressRange expressible as a prefix must be encoded as a prefix"); 2523| 0| } 2524| 34| } else { 2525| 34| throw Decoding_Error(fmt("Unexpected type for IPAddressOrRange {}", static_cast(next_tag))); 2526| 34| } 2527| 133|} _ZN5Botan14Cert_Extension15IPAddressBlocks16IPAddressOrRangeILNS1_7VersionE16EE21decode_single_addressERKNS_14ASN1_BitStringEb: 2531| 166| bool min) { 2532| 166| const size_t version_octets = static_cast(V); 2533| | 2534| | // decode a single address according to https://datatracker.ietf.org/doc/html/rfc3779#section-2.1.1 and following 2535| | 2536| 166| if(decoded.bytes().size() > version_octets) { ------------------ | Branch (2536:7): [True: 0, False: 166] ------------------ 2537| 0| throw Decoding_Error(fmt("IP address range entries must have a length between 0 and {} bytes.", version_octets)); 2538| 0| } 2539| | 2540| 166| std::vector address(decoded.bytes().begin(), decoded.bytes().end()); 2541| | 2542| | // ASN1_BitString guarantees the unused bits are zero (and absent if empty), 2543| | // which is already correct for a min address; for a max address set them 2544| 166| if(!min && decoded.unused_bits() > 0) { ------------------ | Branch (2544:7): [True: 83, False: 83] | Branch (2544:15): [True: 23, False: 60] ------------------ 2545| 23| address.back() |= static_cast((1 << decoded.unused_bits()) - 1); 2546| 23| } 2547| | 2548| | // pad to version length with 0's for min addresses, 255's (0xff) for max addresses 2549| 166| address.resize(version_octets, min ? 0x00 : 0xFF); ------------------ | Branch (2549:35): [True: 83, False: 83] ------------------ 2550| | 2551| 166| return IPAddressBlocks::IPAddress::from_bytes(address); 2552| 166|} _ZN5Botan14Cert_Extension15IPAddressBlocks15IPAddressChoiceILNS1_7VersionE4EE11decode_fromERNS_11BER_DecoderE: 2340| 148|void IPAddressBlocks::IPAddressChoice::decode_from(Botan::BER_Decoder& from) { 2341| 148| const ASN1_Type next_tag = from.peek_next_object().type_tag(); 2342| | 2343| 148| if(next_tag == ASN1_Type::Null) { ------------------ | Branch (2343:7): [True: 15, False: 133] ------------------ 2344| 15| from.decode_null(); 2345| 15| m_ip_addr_ranges = std::nullopt; 2346| 133| } else if(next_tag == ASN1_Type::Sequence) { ------------------ | Branch (2346:14): [True: 104, False: 29] ------------------ 2347| 104| std::vector> ip_ranges; 2348| 104| from.decode_list(ip_ranges); 2349| | 2350| | /* RFC 3779 Section 2.2.3.6 - 2351| | * 2352| | * Any pair of IPAddressOrRange choices in an extension MUST NOT overlap 2353| | * each other. Any contiguous address prefixes or ranges MUST be combined 2354| | * into a single range or, whenever possible, a single prefix. 2355| | */ 2356| 104| if(!ranges_are_sorted_and_merged(ip_ranges)) { ------------------ | Branch (2356:10): [True: 19, False: 85] ------------------ 2357| 19| throw Decoding_Error("IPAddressChoice entries must be sorted, non-overlapping and fully merged"); 2358| 19| } 2359| 85| m_ip_addr_ranges = std::move(ip_ranges); 2360| 85| } else { 2361| 29| throw Decoding_Error(fmt("Unexpected type for IPAddressChoice {}", static_cast(next_tag))); 2362| 29| } 2363| 148|} _ZN5Botan14Cert_Extension15IPAddressBlocks15IPAddressChoiceILNS1_7VersionE16EE11decode_fromERNS_11BER_DecoderE: 2340| 146|void IPAddressBlocks::IPAddressChoice::decode_from(Botan::BER_Decoder& from) { 2341| 146| const ASN1_Type next_tag = from.peek_next_object().type_tag(); 2342| | 2343| 146| if(next_tag == ASN1_Type::Null) { ------------------ | Branch (2343:7): [True: 15, False: 131] ------------------ 2344| 15| from.decode_null(); 2345| 15| m_ip_addr_ranges = std::nullopt; 2346| 131| } else if(next_tag == ASN1_Type::Sequence) { ------------------ | Branch (2346:14): [True: 109, False: 22] ------------------ 2347| 109| std::vector> ip_ranges; 2348| 109| from.decode_list(ip_ranges); 2349| | 2350| | /* RFC 3779 Section 2.2.3.6 - 2351| | * 2352| | * Any pair of IPAddressOrRange choices in an extension MUST NOT overlap 2353| | * each other. Any contiguous address prefixes or ranges MUST be combined 2354| | * into a single range or, whenever possible, a single prefix. 2355| | */ 2356| 109| if(!ranges_are_sorted_and_merged(ip_ranges)) { ------------------ | Branch (2356:10): [True: 17, False: 92] ------------------ 2357| 17| throw Decoding_Error("IPAddressChoice entries must be sorted, non-overlapping and fully merged"); 2358| 17| } 2359| 92| m_ip_addr_ranges = std::move(ip_ranges); 2360| 92| } else { 2361| 22| throw Decoding_Error(fmt("Unexpected type for IPAddressChoice {}", static_cast(next_tag))); 2362| 22| } 2363| 146|} _ZN5Botan10Extensions15create_extn_objERKNS_3OIDEbRKNSt3__16vectorIhNS4_9allocatorIhEEEENS4_8optionalINS_17Extension_ContextEEE: 138| 27.9k| std::optional context) { 139| 27.9k| auto extn = extension_from_oid(oid); 140| | 141| 27.9k| if(!extn) { ------------------ | Branch (141:7): [True: 11.2k, False: 16.7k] ------------------ 142| | // some other unknown extension type 143| 11.2k| extn = std::make_unique(oid, critical); 144| 16.7k| } else { 145| 16.7k| if(context.has_value() && !extn->is_appropriate_context(*context)) { ------------------ | Branch (145:10): [True: 16.7k, False: 0] | Branch (145:33): [True: 3, False: 16.7k] ------------------ 146| 3| throw Decoding_Error(fmt("Extension {} is not allowed in this context", extn->oid_name())); 147| 3| } 148| | 149| 16.7k| try { 150| 16.7k| extn->decode_inner(body); 151| 16.7k| return extn; 152| 16.7k| } catch(const Exception&) { 153| | // OID was recognized but contents failed to decode 154| 8.36k| extn = std::make_unique(oid, critical, /*failed_to_decode=*/true); 155| 8.36k| } 156| 16.7k| } 157| | 158| | // This is always Unknown_Extension: 159| 19.5k| extn->decode_inner(body); 160| 19.5k| return extn; 161| 27.9k|} _ZNK5Botan10Extensions15Extensions_Info3objEv: 163| 14.0k|const Certificate_Extension& Extensions::Extensions_Info::obj() const { 164| 14.0k| BOTAN_ASSERT_NONNULL(m_obj.get()); ------------------ | | 123| 14.0k| do { \ | | 124| 14.0k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (124:10): [True: 0, False: 14.0k] | | ------------------ | | 125| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 126| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 127| 0| } \ | | 128| 14.0k| } while(0) | | ------------------ | | | Branch (128:12): [Folded, False: 14.0k] | | ------------------ ------------------ 165| 14.0k| return *m_obj; 166| 14.0k|} _ZNK5Botan21Certificate_Extension8validateERKNS_16X509_CertificateERKNSt3__18optionalIS1_EERKNS4_6vectorIS1_NS4_9allocatorIS1_EEEERNS9_INS4_3setINS_23Certificate_Status_CodeENS4_4lessISG_EENSA_ISG_EEEENSA_ISK_EEEEm: 175| 98| size_t /*unused*/) const {} _ZNK5Botan10Extensions13extension_setERKNS_3OIDE: 225| 28.5k|bool Extensions::extension_set(const OID& oid) const { 226| 28.5k| return m_extension_info.contains(oid); 227| 28.5k|} _ZNK5Botan10Extensions20get_extension_objectERKNS_3OIDE: 246| 104k|const Certificate_Extension* Extensions::get_extension_object(const OID& oid) const { 247| 104k| const auto extn = m_extension_info.find(oid); 248| 104k| if(extn == m_extension_info.end()) { ------------------ | Branch (248:7): [True: 90.9k, False: 13.9k] ------------------ 249| 90.9k| return nullptr; 250| 90.9k| } 251| | 252| 13.9k| return &extn->second.obj(); 253| 104k|} _ZNK5Botan10Extensions8validateERKNS_16X509_CertificateERKNSt3__18optionalIS1_EERKNS4_6vectorIS1_NS4_9allocatorIS1_EEEERNS9_INS4_3setINS_23Certificate_Status_CodeENS4_4lessISG_EENSA_ISG_EEEENSA_ISK_EEEEm: 275| 51| size_t pos) const { 276| 157| for(const auto& ext : m_extension_info) { ------------------ | Branch (276:24): [True: 157, False: 51] ------------------ 277| 157| ext.second.obj().validate(subject, issuer, cert_path, cert_status, pos); 278| 157| } 279| 51|} _ZN5Botan10Extensions11decode_fromERNS_11BER_DecoderENSt3__18optionalINS_17Extension_ContextEEE: 316| 7.47k|void Extensions::decode_from(BER_Decoder& from_source, std::optional context) { 317| 7.47k| m_extension_oids.clear(); 318| 7.47k| m_extension_info.clear(); 319| 7.47k| m_has_unknown_critical_extension = false; 320| | 321| 7.47k| BER_Decoder sequence = from_source.start_sequence(); 322| | 323| 35.4k| while(sequence.more_items()) { ------------------ | Branch (323:10): [True: 28.2k, False: 7.18k] ------------------ 324| 28.2k| OID oid; 325| 28.2k| bool critical = false; 326| 28.2k| std::vector bits; 327| | 328| 28.2k| sequence.start_sequence() 329| 28.2k| .decode(oid) 330| 28.2k| .decode_optional(critical, ASN1_Type::Boolean, ASN1_Class::Universal, false) 331| 28.2k| .decode(bits, ASN1_Type::OctetString) 332| 28.2k| .end_cons(); 333| | 334| 28.2k| auto obj = create_extn_obj(oid, critical, bits, context); 335| | // Unknown_Extension is the only Certificate_Extension with an empty oid_name 336| 28.2k| if(critical && obj->oid_name().empty()) { ------------------ | Branch (336:10): [True: 5.75k, False: 22.5k] | Branch (336:10): [True: 3.84k, False: 24.4k] | Branch (336:22): [True: 3.84k, False: 1.90k] ------------------ 337| 3.84k| m_has_unknown_critical_extension = true; 338| 3.84k| } 339| 28.2k| Extensions_Info info(critical, std::move(bits), std::move(obj)); 340| | 341| 28.2k| m_extension_oids.push_back(oid); 342| | 343| | // RFC 5280 4.2: "A certificate MUST NOT include more than one 344| | // instance of a particular extension." 345| 28.2k| if(!m_extension_info.emplace(std::move(oid), std::move(info)).second) { ------------------ | Branch (345:10): [True: 292, False: 27.9k] ------------------ 346| 292| throw Decoding_Error("Duplicate certificate extension encountered"); 347| 292| } 348| 28.2k| } 349| 7.18k| sequence.verify_end(); 350| 7.18k|} _ZNK5Botan14Cert_Extension17Basic_Constraints22is_appropriate_contextENS_17Extension_ContextE: 354| 3.69k|bool Basic_Constraints::is_appropriate_context(Extension_Context context) const { 355| 3.69k| return context == Extension_Context::Certificate; 356| 3.69k|} _ZNK5Botan14Cert_Extension9Key_Usage22is_appropriate_contextENS_17Extension_ContextE: 358| 2.76k|bool Key_Usage::is_appropriate_context(Extension_Context context) const { 359| 2.76k| return context == Extension_Context::Certificate; 360| 2.76k|} _ZNK5Botan14Cert_Extension14Subject_Key_ID22is_appropriate_contextENS_17Extension_ContextE: 362| 2.68k|bool Subject_Key_ID::is_appropriate_context(Extension_Context context) const { 363| 2.68k| return context == Extension_Context::Certificate; 364| 2.68k|} _ZNK5Botan14Cert_Extension16Authority_Key_ID22is_appropriate_contextENS_17Extension_ContextE: 366| 2.02k|bool Authority_Key_ID::is_appropriate_context(Extension_Context context) const { 367| 2.02k| return context == Extension_Context::Certificate || context == Extension_Context::CRL; ------------------ | Branch (367:11): [True: 2.02k, False: 0] | Branch (367:56): [True: 0, False: 0] ------------------ 368| 2.02k|} _ZNK5Botan14Cert_Extension24Subject_Alternative_Name22is_appropriate_contextENS_17Extension_ContextE: 370| 745|bool Subject_Alternative_Name::is_appropriate_context(Extension_Context context) const { 371| 745| return context == Extension_Context::Certificate; 372| 745|} _ZNK5Botan14Cert_Extension23Issuer_Alternative_Name22is_appropriate_contextENS_17Extension_ContextE: 374| 222|bool Issuer_Alternative_Name::is_appropriate_context(Extension_Context context) const { 375| 222| return context == Extension_Context::Certificate || context == Extension_Context::CRL; ------------------ | Branch (375:11): [True: 222, False: 0] | Branch (375:56): [True: 0, False: 0] ------------------ 376| 222|} _ZNK5Botan14Cert_Extension18Extended_Key_Usage22is_appropriate_contextENS_17Extension_ContextE: 378| 1.63k|bool Extended_Key_Usage::is_appropriate_context(Extension_Context context) const { 379| 1.63k| return context == Extension_Context::Certificate; 380| 1.63k|} _ZNK5Botan14Cert_Extension16Name_Constraints22is_appropriate_contextENS_17Extension_ContextE: 382| 290|bool Name_Constraints::is_appropriate_context(Extension_Context context) const { 383| 290| return context == Extension_Context::Certificate; 384| 290|} _ZNK5Botan14Cert_Extension20Certificate_Policies22is_appropriate_contextENS_17Extension_ContextE: 386| 120|bool Certificate_Policies::is_appropriate_context(Extension_Context context) const { 387| 120| return context == Extension_Context::Certificate; 388| 120|} _ZNK5Botan14Cert_Extension28Authority_Information_Access22is_appropriate_contextENS_17Extension_ContextE: 390| 1.28k|bool Authority_Information_Access::is_appropriate_context(Extension_Context context) const { 391| 1.28k| return context == Extension_Context::Certificate || context == Extension_Context::CRL; ------------------ | Branch (391:11): [True: 1.28k, False: 0] | Branch (391:56): [True: 0, False: 0] ------------------ 392| 1.28k|} _ZNK5Botan14Cert_Extension10CRL_Number22is_appropriate_contextENS_17Extension_ContextE: 394| 1|bool CRL_Number::is_appropriate_context(Extension_Context context) const { 395| 1| return context == Extension_Context::CRL; 396| 1|} _ZNK5Botan14Cert_Extension14CRL_ReasonCode22is_appropriate_contextENS_17Extension_ContextE: 398| 1|bool CRL_ReasonCode::is_appropriate_context(Extension_Context context) const { 399| | // RFC 6960 4.4.5: "All the extensions specified as CRL entry extensions 400| | // -- in Section 5.3 of [RFC5280] -- are also supported as singleExtensions." 401| 1| return context == Extension_Context::CRL_Entry || context == Extension_Context::OCSP_Response; ------------------ | Branch (401:11): [True: 0, False: 1] | Branch (401:54): [True: 0, False: 1] ------------------ 402| 1|} _ZNK5Botan14Cert_Extension23CRL_Distribution_Points22is_appropriate_contextENS_17Extension_ContextE: 404| 578|bool CRL_Distribution_Points::is_appropriate_context(Extension_Context context) const { 405| 578| return context == Extension_Context::Certificate; 406| 578|} _ZNK5Botan14Cert_Extension30CRL_Issuing_Distribution_Point22is_appropriate_contextENS_17Extension_ContextE: 408| 1|bool CRL_Issuing_Distribution_Point::is_appropriate_context(Extension_Context context) const { 409| 1| return context == Extension_Context::CRL; 410| 1|} _ZNK5Botan14Cert_Extension12OCSP_NoCheck22is_appropriate_contextENS_17Extension_ContextE: 412| 10|bool OCSP_NoCheck::is_appropriate_context(Extension_Context context) const { 413| 10| return context == Extension_Context::Certificate; 414| 10|} _ZNK5Botan14Cert_Extension21NoRevocationAvailable22is_appropriate_contextENS_17Extension_ContextE: 416| 31|bool NoRevocationAvailable::is_appropriate_context(Extension_Context context) const { 417| 31| return context == Extension_Context::Certificate; 418| 31|} _ZNK5Botan14Cert_Extension10TNAuthList22is_appropriate_contextENS_17Extension_ContextE: 420| 151|bool TNAuthList::is_appropriate_context(Extension_Context context) const { 421| 151| return context == Extension_Context::Certificate; 422| 151|} _ZNK5Botan14Cert_Extension15IPAddressBlocks22is_appropriate_contextENS_17Extension_ContextE: 424| 266|bool IPAddressBlocks::is_appropriate_context(Extension_Context context) const { 425| 266| return context == Extension_Context::Certificate; 426| 266|} _ZNK5Botan14Cert_Extension8ASBlocks22is_appropriate_contextENS_17Extension_ContextE: 428| 245|bool ASBlocks::is_appropriate_context(Extension_Context context) const { 429| 245| return context == Extension_Context::Certificate; 430| 245|} _ZN5Botan14Cert_Extension17Basic_ConstraintsC2Ebm: 437| 3.69k| Basic_Constraints(is_ca, is_ca ? std::optional(path_length_constraint) : std::nullopt) {} ------------------ | Branch (437:32): [True: 0, False: 3.69k] ------------------ _ZN5Botan14Cert_Extension17Basic_ConstraintsC2EbNSt3__18optionalImEE: 440| 3.69k| m_is_ca(is_ca), m_path_length_constraint(path_length_constraint) { 441| 3.69k| if(!m_is_ca && m_path_length_constraint.has_value()) { ------------------ | Branch (441:7): [True: 3.69k, False: 0] | Branch (441:19): [True: 0, False: 3.69k] ------------------ 442| | // RFC 5280 Sec 4.2.1.9 "CAs MUST NOT include the pathLenConstraint field unless the cA boolean is asserted" 443| 0| throw Invalid_Argument( 444| 0| "Basic_Constraints nonsensical to set a path length constraint for a non-CA basicConstraints"); 445| 0| } 446| 3.69k|} _ZN5Botan14Cert_Extension17Basic_Constraints12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 477| 3.69k|void Basic_Constraints::decode_inner(const std::vector& in) { 478| | /* 479| | * RFC 5280 Section 4.2.1.9 480| | * 481| | * BasicConstraints ::= SEQUENCE { 482| | * cA BOOLEAN DEFAULT FALSE, 483| | * pathLenConstraint INTEGER (0..MAX) OPTIONAL } 484| | */ 485| 3.69k| BER_Decoder(in, BER_Decoder::Limits::DER()) 486| 3.69k| .start_sequence() 487| 3.69k| .decode_optional(m_is_ca, ASN1_Type::Boolean, ASN1_Class::Universal, false) 488| 3.69k| .decode_optional(m_path_length_constraint, ASN1_Type::Integer, ASN1_Class::Universal) 489| 3.69k| .end_cons() 490| 3.69k| .verify_end(); 491| | 492| | /* RFC 5280 Section 4.2.1.9: 493| | * "CAs MUST NOT include the pathLenConstraint field unless the cA boolean 494| | * is asserted and the key usage extension asserts the keyCertSign bit" */ 495| 3.69k| if(!m_is_ca && m_path_length_constraint.has_value()) { ------------------ | Branch (495:7): [True: 1.20k, False: 2.49k] | Branch (495:19): [True: 28, False: 1.17k] ------------------ 496| 28| throw Decoding_Error("BasicConstraints pathLenConstraint must not be present when cA is FALSE"); 497| 28| } 498| 3.69k|} _ZN5Botan14Cert_Extension9Key_Usage12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 516| 2.76k|void Key_Usage::decode_inner(const std::vector& in) { 517| | /* RFC 5280 Section 4.2.1.3 - KeyUsage ::= BIT STRING */ 518| 2.76k| uint64_t usage = 0; 519| 2.76k| BER_Decoder(in, BER_Decoder::Limits::DER()) 520| 2.76k| .decode_named_bitstring(usage, 16, ASN1_Type::BitString, ASN1_Class::Universal) 521| 2.76k| .verify_end(); 522| | 523| | /* RFC 5280 Section 4.2.1.3: 524| | * "When the keyUsage extension appears in a certificate, at least one of 525| | * the bits MUST be set to 1." */ 526| 2.76k| if(usage == 0) { ------------------ | Branch (526:7): [True: 0, False: 2.76k] ------------------ 527| 0| throw Decoding_Error("KeyUsage extension must have at least one bit set"); 528| 0| } 529| | 530| 2.76k| m_constraints = Key_Constraints(static_cast(usage)); 531| 2.76k|} _ZN5Botan14Cert_Extension14Subject_Key_ID12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 545| 2.68k|void Subject_Key_ID::decode_inner(const std::vector& in) { 546| | /* RFC 5280 Section 4.2.1.2 - SubjectKeyIdentifier ::= KeyIdentifier */ 547| 2.68k| BER_Decoder(in, BER_Decoder::Limits::DER()).decode(m_key_id, ASN1_Type::OctetString).verify_end(); 548| | 549| 2.68k| if(m_key_id.empty()) { ------------------ | Branch (549:7): [True: 3, False: 2.67k] ------------------ 550| 3| throw Decoding_Error("SubjectKeyIdentifier must not be empty"); 551| 3| } 552| 2.67k| if(m_key_id.size() > MaximumKeyIdentifierLength) { ------------------ | Branch (552:7): [True: 0, False: 2.67k] ------------------ 553| 0| throw Decoding_Error( 554| 0| fmt("SubjectKeyIdentifier length {} exceeds limit of {} bytes", m_key_id.size(), MaximumKeyIdentifierLength)); 555| 0| } 556| 2.67k|} _ZN5Botan14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 615| 2.02k|void Authority_Key_ID::decode_inner(const std::vector& in) { 616| | /* 617| | * RFC 5280 Section 4.2.1.1 618| | * 619| | * AuthorityKeyIdentifier ::= SEQUENCE { 620| | * keyIdentifier [0] KeyIdentifier OPTIONAL, 621| | * authorityCertIssuer [1] GeneralNames OPTIONAL, 622| | * authorityCertSerialNumber [2] CertificateSerialNumber OPTIONAL } 623| | */ 624| 2.02k| BER_Decoder ber(in, BER_Decoder::Limits::DER()); 625| 2.02k| BER_Decoder seq = ber.start_sequence(); 626| | 627| 2.02k| m_key_id.clear(); 628| 2.02k| m_authority_cert.reset(); 629| | 630| 2.02k| bool key_id_present = false; 631| 2.02k| std::optional authority_cert_issuer; 632| 2.02k| std::optional authority_cert_serial; 633| | 634| 2.02k| seq.decode_optional_field(0, 635| 2.02k| ASN1_Class::ContextSpecific, 636| 2.02k| [&](BER_Decoder& d) { 637| 2.02k| d.decode(m_key_id, ASN1_Type::OctetString, ASN1_Type(0), ASN1_Class::ContextSpecific); 638| 2.02k| key_id_present = true; 639| 2.02k| }) 640| 2.02k| .decode_optional_field(1, 641| 2.02k| ASN1_Class::ContextSpecific | ASN1_Class::Constructed, 642| 2.02k| [&](BER_Decoder& d) { 643| 2.02k| AlternativeName names; 644| 2.02k| d.decode_implicit(names, 645| 2.02k| ASN1_Type(1), 646| 2.02k| ASN1_Class::ContextSpecific | ASN1_Class::Constructed, 647| 2.02k| ASN1_Type::Sequence, 648| 2.02k| ASN1_Class::Constructed); 649| 2.02k| authority_cert_issuer = std::move(names); 650| 2.02k| }) 651| 2.02k| .decode_optional_field(2, ASN1_Class::ContextSpecific, [&](BER_Decoder& d) { 652| 2.02k| X509_Serial_Number serial; 653| 2.02k| d.decode_implicit( 654| 2.02k| serial, ASN1_Type(2), ASN1_Class::ContextSpecific, ASN1_Type::Integer, ASN1_Class::Universal); 655| 2.02k| authority_cert_serial = std::move(serial); 656| 2.02k| }); 657| | 658| 2.02k| seq.end_cons(); 659| 2.02k| ber.verify_end(); 660| | 661| 2.02k| if(key_id_present) { ------------------ | Branch (661:7): [True: 990, False: 1.03k] ------------------ 662| 990| if(m_key_id.empty()) { ------------------ | Branch (662:10): [True: 0, False: 990] ------------------ 663| 0| throw Decoding_Error("AuthorityKeyIdentifier keyIdentifier must not be empty"); 664| 0| } 665| 990| if(m_key_id.size() > MaximumKeyIdentifierLength) { ------------------ | Branch (665:10): [True: 1, False: 989] ------------------ 666| 1| throw Decoding_Error(fmt("AuthorityKeyIdentifier keyIdentifier length {} exceeds limit of {} bytes", 667| 1| m_key_id.size(), 668| 1| MaximumKeyIdentifierLength)); 669| 1| } 670| 990| } 671| | 672| | // RFC 5280 4.2.1.6: GeneralNames ::= SEQUENCE SIZE (1..MAX) OF GeneralName 673| 2.02k| if(authority_cert_issuer.has_value() && authority_cert_issuer->is_empty()) { ------------------ | Branch (673:7): [True: 608, False: 1.41k] | Branch (673:44): [True: 4, False: 604] ------------------ 674| 4| throw Decoding_Error("AuthorityKeyIdentifier authorityCertIssuer must contain at least one GeneralName"); 675| 4| } 676| | 677| | /* 678| | * RFC 5280 Appendix A.2: 679| | * 680| | * authorityCertIssuer and authorityCertSerialNumber MUST both be 681| | * present or both be absent 682| | */ 683| 2.02k| if(authority_cert_issuer.has_value() != authority_cert_serial.has_value()) { ------------------ | Branch (683:7): [True: 21, False: 1.99k] ------------------ 684| 21| throw Decoding_Error( 685| 21| "AuthorityKeyIdentifier authorityCertIssuer and authorityCertSerialNumber must both be present or absent"); 686| 21| } 687| | 688| 1.99k| if(authority_cert_issuer.has_value()) { ------------------ | Branch (688:7): [True: 604, False: 1.39k] ------------------ 689| 604| m_authority_cert = 690| 604| Authority_Cert_Identifier{std::move(*authority_cert_issuer), std::move(*authority_cert_serial)}; 691| 604| } 692| 1.99k|} _ZN5Botan14Cert_Extension24Subject_Alternative_Name12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 715| 745|void Subject_Alternative_Name::decode_inner(const std::vector& in) { 716| | /* RFC 5280 Section 4.2.1.6 - SubjectAltName ::= GeneralNames 717| | * GeneralNames ::= SEQUENCE SIZE (1..MAX) OF GeneralName */ 718| 745| BER_Decoder(in, BER_Decoder::Limits::DER()).decode(m_alt_name).verify_end(); 719| 745| if(!m_alt_name.has_items()) { ------------------ | Branch (719:7): [True: 59, False: 686] ------------------ 720| 59| throw Decoding_Error("SubjectAlternativeName extension must contain at least one GeneralName"); 721| 59| } 722| 745|} _ZN5Botan14Cert_Extension23Issuer_Alternative_Name12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 727| 222|void Issuer_Alternative_Name::decode_inner(const std::vector& in) { 728| | /* RFC 5280 Section 4.2.1.7 - IssuerAltName ::= GeneralNames 729| | * GeneralNames ::= SEQUENCE SIZE (1..MAX) OF GeneralName */ 730| 222| BER_Decoder(in, BER_Decoder::Limits::DER()).decode(m_alt_name).verify_end(); 731| 222| if(!m_alt_name.has_items()) { ------------------ | Branch (731:7): [True: 76, False: 146] ------------------ 732| 76| throw Decoding_Error("IssuerAlternativeName extension must contain at least one GeneralName"); 733| 76| } 734| 222|} _ZN5Botan14Cert_Extension18Extended_Key_Usage12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 748| 1.63k|void Extended_Key_Usage::decode_inner(const std::vector& in) { 749| | /* RFC 5280 Section 4.2.1.12 - ExtKeyUsageSyntax ::= SEQUENCE SIZE (1..MAX) OF KeyPurposeId */ 750| 1.63k| BER_Decoder(in, BER_Decoder::Limits::DER()).decode_list(m_oids).verify_end(); 751| 1.63k| if(m_oids.empty()) { ------------------ | Branch (751:7): [True: 45, False: 1.59k] ------------------ 752| 45| throw Decoding_Error("ExtendedKeyUsage extension must contain at least one KeyPurposeId"); 753| 45| } 754| 1.63k|} _ZN5Botan14Cert_Extension16Name_Constraints12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 783| 290|void Name_Constraints::decode_inner(const std::vector& in) { 784| | /* 785| | * RFC 5280 Section 4.2.1.10 786| | * 787| | * NameConstraints ::= SEQUENCE { 788| | * permittedSubtrees [0] GeneralSubtrees OPTIONAL, 789| | * excludedSubtrees [1] GeneralSubtrees OPTIONAL } 790| | */ 791| 290| BER_Decoder ber(in, BER_Decoder::Limits::DER()); 792| 290| BER_Decoder inner = ber.start_sequence(); 793| | 794| 290| std::vector permitted; 795| 290| if(inner.decode_optional_list(permitted, ASN1_Type(0), ASN1_Class::ExplicitContextSpecific)) { ------------------ | Branch (795:7): [True: 81, False: 209] ------------------ 796| 81| if(permitted.empty()) { ------------------ | Branch (796:10): [True: 3, False: 78] ------------------ 797| 3| throw Decoding_Error("Empty NameConstraint permitted list"); 798| 3| } 799| 81| } 800| | 801| 287| std::vector excluded; 802| 287| if(inner.decode_optional_list(excluded, ASN1_Type(1), ASN1_Class::ExplicitContextSpecific)) { ------------------ | Branch (802:7): [True: 38, False: 249] ------------------ 803| 38| if(excluded.empty()) { ------------------ | Branch (803:10): [True: 1, False: 37] ------------------ 804| 1| throw Decoding_Error("Empty NameConstraint excluded list"); 805| 1| } 806| 38| } 807| | 808| 286| inner.end_cons(); 809| 286| ber.verify_end(); 810| | 811| 286| if(permitted.empty() && excluded.empty()) { ------------------ | Branch (811:7): [True: 15, False: 271] | Branch (811:28): [True: 11, False: 4] ------------------ 812| 11| throw Decoding_Error("Empty NameConstraint extension"); 813| 11| } 814| | 815| 275| m_name_constraints = NameConstraints(std::move(permitted), std::move(excluded)); 816| 275|} _ZN5Botan14Cert_Extension20Certificate_Policies12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 911| 120|void Certificate_Policies::decode_inner(const std::vector& in) { 912| | /* RFC 5280 Section 4.2.1.4 - CertificatePolicies ::= SEQUENCE SIZE (1..MAX) OF PolicyInformation */ 913| 120| std::vector policies; 914| | 915| 120| BER_Decoder(in, BER_Decoder::Limits::DER()).decode_list(policies).verify_end(); 916| 120| if(policies.empty()) { ------------------ | Branch (916:7): [True: 4, False: 116] ------------------ 917| 4| throw Decoding_Error("CertificatePolicies extension must contain at least one PolicyInformation"); 918| 4| } 919| 116| m_oids.clear(); 920| 116| for(const auto& policy : policies) { ------------------ | Branch (920:27): [True: 75, False: 116] ------------------ 921| 75| m_oids.push_back(policy.oid()); 922| 75| } 923| 116| m_has_duplicate = policy_oids_have_duplicate(m_oids); 924| 116|} _ZN5Botan14Cert_Extension28Authority_Information_Access12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 1125| 1.28k|void Authority_Information_Access::decode_inner(const std::vector& in) { 1126| | /* 1127| | * RFC 5280 Section 4.2.2.1 1128| | * 1129| | * AuthorityInfoAccessSyntax ::= SEQUENCE SIZE (1..MAX) OF AccessDescription 1130| | * AccessDescription ::= SEQUENCE { 1131| | * accessMethod OBJECT IDENTIFIER, 1132| | * accessLocation GeneralName } 1133| | */ 1134| 1.28k| BER_Decoder outer(in, BER_Decoder::Limits::DER()); 1135| 1.28k| BER_Decoder ber = outer.start_sequence(); 1136| | 1137| 1.28k| const OID ocsp_responder = OID::from_string("PKIX.OCSP"); 1138| 1.28k| const OID ca_issuer = OID::from_string("PKIX.CertificateAuthorityIssuers"); 1139| | 1140| 1.28k| m_access_descriptions.clear(); 1141| 1.28k| m_ocsp_responders.clear(); 1142| 1.28k| m_ca_issuers.clear(); 1143| | 1144| 2.38k| while(ber.more_items()) { ------------------ | Branch (1144:10): [True: 1.10k, False: 1.28k] ------------------ 1145| 1.10k| OID oid; 1146| | 1147| 1.10k| BER_Decoder info = ber.start_sequence(); 1148| | 1149| 1.10k| info.decode(oid); 1150| 1.10k| const BER_Object name = info.get_next_object(); 1151| | 1152| | /* RFC 5280 4.2.2.1: 1153| | * AccessDescription ::= SEQUENCE { 1154| | * accessMethod OBJECT IDENTIFIER, 1155| | * accessLocation GeneralName } 1156| | */ 1157| 1.10k| if(!name.is_set()) { ------------------ | Branch (1157:10): [True: 1, False: 1.10k] ------------------ 1158| 1| throw Decoding_Error("AuthorityInformationAccess AccessDescription missing accessLocation"); 1159| 1| } 1160| 1.10k| validate_general_name_encoding(name.type_tag(), name.get_class(), name.data()); 1161| 1.10k| info.end_cons(); 1162| | 1163| 1.10k| m_access_descriptions.emplace_back( 1164| 1.10k| oid, name.type_tag(), name.get_class(), std::vector(name.data().begin(), name.data().end())); 1165| | 1166| 1.10k| if(name.is_a(6, ASN1_Class::ContextSpecific)) { ------------------ | Branch (1166:10): [True: 439, False: 665] ------------------ 1167| 439| if(oid == ocsp_responder) { ------------------ | Branch (1167:13): [True: 168, False: 271] ------------------ 1168| 168| if(auto parsed = URI::from_string(ASN1::to_string(name))) { ------------------ | Branch (1168:21): [True: 168, False: 0] ------------------ 1169| 168| m_ocsp_responders.push_back(std::move(*parsed)); 1170| 168| } else { 1171| 0| throw Decoding_Error("Invalid URI in AuthorityInformationAccess OCSP responder"); 1172| 0| } 1173| 271| } else if(oid == ca_issuer) { ------------------ | Branch (1173:20): [True: 129, False: 142] ------------------ 1174| 129| if(auto parsed = URI::from_string(ASN1::to_string(name))) { ------------------ | Branch (1174:21): [True: 129, False: 0] ------------------ 1175| 129| m_ca_issuers.push_back(std::move(*parsed)); 1176| 129| } else { 1177| 0| throw Decoding_Error("Invalid URI in AuthorityInformationAccess CA issuers"); 1178| 0| } 1179| 129| } 1180| 439| } 1181| 1.10k| } 1182| | 1183| 1.28k| ber.end_cons(); 1184| 1.28k| outer.verify_end(); 1185| | 1186| 1.28k| if(m_access_descriptions.empty()) { ------------------ | Branch (1186:7): [True: 112, False: 1.16k] ------------------ 1187| 112| throw Decoding_Error("AuthorityInformationAccess extension must contain at least one AccessDescription"); 1188| 112| } 1189| 1.28k|} _ZN5Botan14Cert_Extension21DistributionPointName11decode_fromERNS_11BER_DecoderE: 1346| 635|void DistributionPointName::decode_from(BER_Decoder& ber) { 1347| 635| const BER_Object& obj = ber.peek_next_object(); 1348| 635| if(obj.is_a(0, ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) { ------------------ | Branch (1348:7): [True: 602, False: 33] ------------------ 1349| 602| AlternativeName full_name; 1350| 602| ber.decode_implicit(full_name, 1351| 602| ASN1_Type(0), 1352| 602| ASN1_Class::ContextSpecific | ASN1_Class::Constructed, 1353| 602| ASN1_Type::Sequence, 1354| 602| ASN1_Class::Constructed); 1355| | // RFC 5280 4.2.1.6: GeneralNames ::= SEQUENCE SIZE (1..MAX) OF GeneralName 1356| 602| if(!full_name.has_items()) { ------------------ | Branch (1356:10): [True: 8, False: 594] ------------------ 1357| 8| throw Decoding_Error("DistributionPointName fullName must contain at least one GeneralName"); 1358| 8| } 1359| 594| if(std::ranges::any_of(full_name.directory_names(), [](const X509_DN& dn) { return dn.empty(); })) { ------------------ | Branch (1359:10): [True: 0, False: 594] ------------------ 1360| 0| throw Decoding_Error("DistributionPointName fullName must not contain an empty directoryName"); 1361| 0| } 1362| 594| m_full_name = std::move(full_name); 1363| 594| } else if(obj.is_a(1, ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) { ------------------ | Branch (1363:14): [True: 3, False: 30] ------------------ 1364| 3| throw Decoding_Error("nameRelativeToCrlIssuer not supported in DistributionPointName"); 1365| 30| } else { 1366| 30| throw Decoding_Error("DistributionPointName CHOICE is neither fullName nor nameRelativeToCRLIssuer"); 1367| 30| } 1368| 635|} _ZN5Botan14Cert_Extension23CRL_Distribution_Points12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 1376| 578|void CRL_Distribution_Points::decode_inner(const std::vector& buf) { 1377| | /* 1378| | * RFC 5280 Section 4.2.1.13 1379| | * 1380| | * CRLDistributionPoints ::= SEQUENCE SIZE (1..MAX) OF DistributionPoint 1381| | */ 1382| 578| BER_Decoder(buf, BER_Decoder::Limits::DER()).decode_list(m_distribution_points).verify_end(); 1383| | 1384| 578| if(m_distribution_points.empty()) { ------------------ | Branch (1384:7): [True: 11, False: 567] ------------------ 1385| 11| throw Decoding_Error("CRLDistributionPoints extension must contain at least one DistributionPoint"); 1386| 11| } 1387| | 1388| 567| m_crl_distribution_urls = crl_distribution_point_uris_from_distribution_points(m_distribution_points); 1389| 567|} _ZN5Botan14Cert_Extension23CRL_Distribution_Points18Distribution_Point11decode_fromERNS_11BER_DecoderE: 1438| 762|void CRL_Distribution_Points::Distribution_Point::decode_from(BER_Decoder& ber) { 1439| | /* 1440| | * DistributionPoint ::= SEQUENCE { 1441| | * distributionPoint [0] DistributionPointName OPTIONAL, 1442| | * reasons [1] ReasonFlags OPTIONAL, 1443| | * cRLIssuer [2] GeneralNames OPTIONAL } 1444| | */ 1445| 762| BER_Decoder dp = ber.start_sequence(); 1446| | 1447| 762| m_dp_name.reset(); 1448| 762| m_reasons.reset(); 1449| 762| m_crl_issuer.reset(); 1450| | 1451| | // DER: these optional fields appear at most once and in increasing tag 1452| | // order. Decoding them in tag order and then rejecting anything left over 1453| | // (see end_cons below) catches out-of-order, duplicate, and unknown fields. 1454| 762| dp.decode_optional_field(0, 1455| 762| ASN1_Class::ContextSpecific | ASN1_Class::Constructed, 1456| 762| [&](BER_Decoder& d) { 1457| 762| DistributionPointName name; 1458| 762| d.start_context_specific(0).decode(name).verify_end(); 1459| 762| m_dp_name = std::move(name); 1460| 762| }) 1461| 762| .decode_optional_field( 1462| 762| 1, ASN1_Class::ContextSpecific, [&](BER_Decoder& d) { m_reasons = decode_reason_flags_implicit(d, 1); }) 1463| 762| .decode_optional_field(2, ASN1_Class::ContextSpecific | ASN1_Class::Constructed, [&](BER_Decoder& d) { 1464| 762| AlternativeName crl_issuer; 1465| 762| d.decode_implicit(crl_issuer, 1466| 762| ASN1_Type(2), 1467| 762| ASN1_Class::ContextSpecific | ASN1_Class::Constructed, 1468| 762| ASN1_Type::Sequence, 1469| 762| ASN1_Class::Constructed); 1470| 762| m_crl_issuer = std::move(crl_issuer); 1471| 762| }); 1472| | 1473| 762| dp.end_cons(); 1474| | 1475| | // RFC 5280 4.2.1.6: GeneralNames ::= SEQUENCE SIZE (1..MAX) OF GeneralName 1476| 762| if(m_crl_issuer.has_value() && m_crl_issuer->is_empty()) { ------------------ | Branch (1476:7): [True: 2, False: 760] | Branch (1476:35): [True: 1, False: 1] ------------------ 1477| 1| throw Decoding_Error("cRLIssuer GeneralNames must contain at least one GeneralName"); 1478| 1| } 1479| | 1480| 761| if(m_crl_issuer.has_value() && !crl_issuer_is_well_formed(*m_crl_issuer)) { ------------------ | Branch (1480:7): [True: 1, False: 760] | Branch (1480:35): [True: 1, False: 0] ------------------ 1481| | /* RFC 5280 4.2.1.13: "If present, the cRLIssuer MUST only contain the 1482| | * distinguished name (DN) from the issuer field of the CRL". */ 1483| 1| throw Decoding_Error("cRLIssuer must contain exactly one non-empty directoryName GeneralName"); 1484| 1| } 1485| | 1486| 760| if(!m_dp_name.has_value() && !m_crl_issuer.has_value()) { ------------------ | Branch (1486:7): [True: 4, False: 756] | Branch (1486:33): [True: 4, False: 0] ------------------ 1487| 4| throw Decoding_Error("DistributionPoint must contain either distributionPoint or cRLIssuer"); 1488| 4| } 1489| 760|} _ZN5Botan14Cert_Extension10TNAuthList5Entry11decode_fromERNS_11BER_DecoderE: 1667| 153|void TNAuthList::Entry::decode_from(BER_Decoder& ber) { 1668| 153| const auto decode_ia5_string = [](BER_Decoder& from, std::string_view what) { 1669| 153| ASN1_String str; 1670| 153| from.decode(str); 1671| 153| if(str.tagging() != ASN1_Type::Ia5String) { 1672| 153| throw Decoding_Error(fmt("TNAuthList {} must be an IA5String", what)); 1673| 153| } 1674| 153| return str.value(); 1675| 153| }; 1676| | 1677| 153| const BER_Object obj = ber.get_next_object(); 1678| | 1679| | // The TNEntry alternatives are explicitly tagged so each is constructed 1680| 153| if(obj.get_class() != (ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) { ------------------ | Branch (1680:7): [True: 5, False: 148] ------------------ 1681| 5| throw Decoding_Error(fmt("Unexpected TNEntry class tag {}", static_cast(obj.get_class()))); 1682| 5| } 1683| | 1684| 148| const uint32_t type_tag = static_cast(obj.type_tag()); 1685| 148| BER_Decoder inner(obj, ber.limits()); 1686| | 1687| 148| if(type_tag == ServiceProviderCode) { ------------------ | Branch (1687:7): [True: 15, False: 133] ------------------ 1688| 15| m_type = ServiceProviderCode; 1689| 15| m_data = decode_ia5_string(inner, "ServiceProviderCode"); 1690| 133| } else if(type_tag == TelephoneNumberRange) { ------------------ | Branch (1690:14): [True: 120, False: 13] ------------------ 1691| 120| BER_Decoder range = inner.start_sequence(); 1692| | 1693| 120| const auto start = Botan::TelephoneNumber::from_string(decode_ia5_string(range, "TelephoneNumberRange start")); 1694| 120| if(!start.has_value()) { ------------------ | Branch (1694:10): [True: 10, False: 110] ------------------ 1695| 10| throw Decoding_Error("Invalid TelephoneNumberRange start"); 1696| 10| } 1697| | 1698| 110| BigInt count; 1699| 110| range.decode(count); 1700| | // count INTEGER (2..MAX), but no value over 64 bits fits within a 15 digit number 1701| 110| if(count.is_negative() || count.bits() > 64) { ------------------ | Branch (1701:10): [True: 15, False: 95] | Branch (1701:33): [True: 1, False: 94] ------------------ 1702| 2| throw Decoding_Error("Invalid TelephoneNumberRange count"); 1703| 2| } 1704| 108| uint64_t count_value = 0; 1705| 860| for(size_t i = 0; i != 8; ++i) { ------------------ | Branch (1705:25): [True: 752, False: 108] ------------------ 1706| 752| count_value = (count_value << 8) | count.byte_at(7 - i); 1707| 752| } 1708| 108| if(count_value < 2) { ------------------ | Branch (1708:10): [True: 1, False: 107] ------------------ 1709| 1| throw Decoding_Error("Invalid TelephoneNumberRange count"); 1710| 1| } 1711| | 1712| 107| auto tn_range = Botan::TelephoneNumberRange::from(*start, count_value); 1713| 107| if(!tn_range.has_value()) { ------------------ | Branch (1713:10): [True: 88, False: 19] ------------------ 1714| 88| throw Decoding_Error("Invalid TelephoneNumberRange"); 1715| 88| } 1716| | 1717| | // TelephoneNumberRange is extensible; skip any additions following count 1718| 33| while(range.more_items()) { ------------------ | Branch (1718:13): [True: 14, False: 19] ------------------ 1719| 14| range.get_next_object(); 1720| 14| } 1721| 19| range.end_cons(); 1722| | 1723| 19| set_range(std::move(*tn_range)); 1724| 19| } else if(type_tag == TelephoneNumber) { ------------------ | Branch (1724:14): [True: 4, False: 9] ------------------ 1725| 4| m_type = TelephoneNumber; 1726| 4| auto tn = Botan::TelephoneNumber::from_string(decode_ia5_string(inner, "TelephoneNumber")); 1727| 4| if(!tn.has_value()) { ------------------ | Branch (1727:10): [True: 1, False: 3] ------------------ 1728| 1| throw Decoding_Error("Invalid TelephoneNumber"); 1729| 1| } 1730| 3| m_data = std::move(*tn); 1731| 9| } else { 1732| 9| throw Decoding_Error(fmt("Unexpected TNEntry type code {}", type_tag)); 1733| 9| } 1734| | 1735| 37| inner.verify_end(); 1736| 37|} _ZN5Botan14Cert_Extension10TNAuthList12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 1756| 151|void TNAuthList::decode_inner(const std::vector& in) { 1757| | /* RFC 8226 Section 9 - TNAuthorizationList ::= SEQUENCE SIZE (1..MAX) OF TNEntry */ 1758| 151| m_tn_entries.clear(); 1759| 151| BER_Decoder(in, BER_Decoder::Limits::DER()).decode_list(m_tn_entries).verify_end(); 1760| 151| if(m_tn_entries.empty()) { ------------------ | Branch (1760:7): [True: 4, False: 147] ------------------ 1761| 4| throw Decoding_Error("TNAuthorizationList is empty"); 1762| 4| } 1763| 151|} _ZN5Botan14Cert_Extension10TNAuthList5Entry9set_rangeENS_20TelephoneNumberRangeE: 1780| 2|void TNAuthList::Entry::set_range(Botan::TelephoneNumberRange range) { 1781| 2| m_type = TelephoneNumberRange; 1782| 2| m_legacy_range.clear(); 1783| 2| if(std::in_range(range.count())) { ------------------ | Branch (1783:7): [True: 2, False: 0] ------------------ 1784| 2| m_legacy_range.push_back(TelephoneNumberRangeData{ASN1_String(range.start().to_string(), ASN1_Type::Ia5String), 1785| 2| static_cast(range.count())}); 1786| 2| } 1787| 2| m_data = std::move(range); 1788| 2|} _ZN5Botan14Cert_Extension15IPAddressBlocks12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 1950| 266|void IPAddressBlocks::decode_inner(const std::vector& in) { 1951| | /* RFC 3779 Section 2.2.3.1 - IPAddrBlocks ::= SEQUENCE OF IPAddressFamily */ 1952| 266| BER_Decoder(in, BER_Decoder::Limits::DER()).decode_list(m_ip_addr_blocks).verify_end(); 1953| | 1954| | /* RFC 3779 Section 2.2.3.3 1955| | * 1956| | * There MUST be only one IPAddressFamily SEQUENCE per unique combination of 1957| | * AFI and SAFI. Each SEQUENCE MUST be ordered by ascending addressFamily 1958| | * values (treating the octets as unsigned quantities). 1959| | * 1960| | * Comparing (afi, safi) pairs matches the octet string ordering, since 1961| | * a std::nullopt safi sorts before any actual safi value. 1962| | */ 1963| 266| for(size_t i = 1; i < m_ip_addr_blocks.size(); i++) { ------------------ | Branch (1963:22): [True: 0, False: 266] ------------------ 1964| 0| const auto prev = std::make_pair(m_ip_addr_blocks[i - 1].afi(), m_ip_addr_blocks[i - 1].safi()); 1965| 0| const auto cur = std::make_pair(m_ip_addr_blocks[i].afi(), m_ip_addr_blocks[i].safi()); 1966| 0| if(prev >= cur) { ------------------ | Branch (1966:10): [True: 0, False: 0] ------------------ 1967| 0| throw Decoding_Error("IPAddrBlocks families must be sorted by AFI/SAFI and not repeat"); 1968| 0| } 1969| 0| } 1970| | 1971| | // IPAddressFamily::decode_from only accepts AFI 1 (IPv4) or 2 (IPv6) 1972| 266| m_v4_count = 0; 1973| 266| m_v6_count = 0; 1974| 266| for(const IPAddressFamily& block : m_ip_addr_blocks) { ------------------ | Branch (1974:37): [True: 0, False: 266] ------------------ 1975| 0| if(block.afi() == 1) { ------------------ | Branch (1975:10): [True: 0, False: 0] ------------------ 1976| 0| m_v4_count++; 1977| 0| } else { 1978| 0| m_v6_count++; 1979| 0| } 1980| 0| } 1981| 266|} _ZN5Botan14Cert_Extension15IPAddressBlocks15IPAddressFamily11decode_fromERNS_11BER_DecoderE: 2002| 348|void IPAddressBlocks::IPAddressFamily::decode_from(Botan::BER_Decoder& from) { 2003| 348| const ASN1_Type next_tag = from.peek_next_object().type_tag(); 2004| 348| if(next_tag != ASN1_Type::Sequence) { ------------------ | Branch (2004:7): [True: 15, False: 333] ------------------ 2005| 15| throw Decoding_Error(fmt("Unexpected type for IPAddressFamily {}", static_cast(next_tag))); 2006| 15| } 2007| | 2008| 333| BER_Decoder seq_dec = from.start_sequence(); 2009| | 2010| 333| std::vector addr_family; 2011| 333| seq_dec.decode(addr_family, ASN1_Type::OctetString); 2012| 333| const size_t addr_family_length = addr_family.size(); 2013| | 2014| 333| if(addr_family_length != 2 && addr_family_length != 3) { ------------------ | Branch (2014:7): [True: 8, False: 325] | Branch (2014:34): [True: 3, False: 5] ------------------ 2015| 3| throw Decoding_Error("(S)AFI can only contain 2 or 3 bytes"); 2016| 3| } 2017| | 2018| 330| m_afi = (addr_family[0] << 8) | addr_family[1]; 2019| | 2020| 330| if(addr_family_length == 3) { ------------------ | Branch (2020:7): [True: 5, False: 325] ------------------ 2021| 5| m_safi = addr_family[2]; 2022| 5| } 2023| | 2024| 330| if(m_afi == 1) { ------------------ | Branch (2024:7): [True: 148, False: 182] ------------------ 2025| 148| IPAddressChoice addr_choice; 2026| 148| seq_dec.decode(addr_choice); 2027| 148| m_ip_addr_choice = addr_choice; 2028| 182| } else if(m_afi == 2) { ------------------ | Branch (2028:14): [True: 146, False: 36] ------------------ 2029| 146| IPAddressChoice addr_choice; 2030| 146| seq_dec.decode(addr_choice); 2031| 146| m_ip_addr_choice = addr_choice; 2032| 146| } else { 2033| 36| throw Decoding_Error("Only AFI IPv4 and IPv6 are supported."); 2034| 36| } 2035| | 2036| 294| seq_dec.end_cons(); 2037| 294|} _ZN5Botan14Cert_Extension8ASBlocks12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 2676| 245|void ASBlocks::decode_inner(const std::vector& in) { 2677| | /* RFC 3779 Section 3.2.3.1 - ASIdentifiers ::= SEQUENCE { ... } */ 2678| 245| BER_Decoder(in, BER_Decoder::Limits::DER()).decode(m_as_identifiers).verify_end(); 2679| 245|} _ZN5Botan14Cert_Extension8ASBlocks13ASIdentifiers11decode_fromERNS_11BER_DecoderE: 2714| 245|void ASBlocks::ASIdentifiers::decode_from(Botan::BER_Decoder& from) { 2715| 245| const ASN1_Type next_tag = from.peek_next_object().type_tag(); 2716| 245| if(next_tag != ASN1_Type::Sequence) { ------------------ | Branch (2716:7): [True: 39, False: 206] ------------------ 2717| 39| throw Decoding_Error(fmt("Unexpected type for ASIdentifiers {}", static_cast(next_tag))); 2718| 39| } 2719| | 2720| 206| BER_Decoder seq_dec = from.start_sequence(); 2721| | 2722| 206| const BER_Object elem_obj = seq_dec.get_next_object(); 2723| | 2724| | // asnum, potentially followed by an rdi 2725| 206| if(elem_obj.is_a(0, ASN1_Class::ExplicitContextSpecific)) { ------------------ | Branch (2725:7): [True: 85, False: 121] ------------------ 2726| 85| BER_Decoder as_obj_ber = BER_Decoder(elem_obj, seq_dec.limits()); 2727| 85| ASIdentifierChoice asnum; 2728| 85| as_obj_ber.decode(asnum).verify_end(); 2729| 85| m_asnum = asnum; 2730| | 2731| 85| const BER_Object rdi_obj = seq_dec.get_next_object(); 2732| 85| if(rdi_obj.is_a(1, ASN1_Class::ExplicitContextSpecific)) { ------------------ | Branch (2732:10): [True: 1, False: 84] ------------------ 2733| 1| BER_Decoder rdi_obj_ber = BER_Decoder(rdi_obj, seq_dec.limits()); 2734| 1| ASIdentifierChoice rdi; 2735| 1| rdi_obj_ber.decode(rdi).verify_end(); 2736| 1| m_rdi = rdi; 2737| 84| } else if(rdi_obj.type_tag() != ASN1_Type::NoObject) { ------------------ | Branch (2737:17): [True: 15, False: 69] ------------------ 2738| 15| throw Decoding_Error( 2739| 15| fmt("Unexpected type for ASIdentifiers rdi: {}", static_cast(rdi_obj.type_tag()))); 2740| 15| } 2741| 121| } else if(elem_obj.is_a(1, ASN1_Class::ExplicitContextSpecific)) { ------------------ | Branch (2741:14): [True: 67, False: 54] ------------------ 2742| | // just an rdi 2743| 67| BER_Decoder rdi_obj_ber = BER_Decoder(elem_obj, seq_dec.limits()); 2744| 67| ASIdentifierChoice rdi; 2745| 67| rdi_obj_ber.decode(rdi).verify_end(); 2746| 67| m_rdi = rdi; 2747| 67| const BER_Object end = seq_dec.get_next_object(); 2748| 67| if(end.type_tag() != ASN1_Type::NoObject) { ------------------ | Branch (2748:10): [True: 12, False: 55] ------------------ 2749| 12| throw Decoding_Error( 2750| 12| fmt("Unexpected element with type {} in ASIdentifiers", static_cast(end.type_tag()))); 2751| 12| } 2752| 67| } else if(elem_obj.type_tag() == ASN1_Type::NoObject) { ------------------ | Branch (2752:14): [True: 5, False: 49] ------------------ 2753| | /* RFC 3779 Section 3.2.3.1 - 2754| | * "The ASIdentifiers type is a SEQUENCE containing one or more forms of 2755| | * autonomous system identifiers" 2756| | */ 2757| 5| throw Decoding_Error("ASIdentifiers must contain an asnum or rdi element"); 2758| 49| } else { 2759| 49| throw Decoding_Error( 2760| 49| fmt("Unexpected element with type {} in ASIdentifiers", static_cast(elem_obj.type_tag()))); 2761| 49| } 2762| | 2763| 125| seq_dec.end_cons(); 2764| | 2765| 125| if(!m_asnum.has_value() && !m_rdi.has_value()) { ------------------ | Branch (2765:7): [True: 2, False: 123] | Branch (2765:31): [True: 0, False: 2] ------------------ 2766| 0| throw Decoding_Error("Invalid encoding for ASIdentifiers"); 2767| 0| } 2768| 125|} _ZN5Botan14Cert_Extension8ASBlocks18ASIdentifierChoice11decode_fromERNS_11BER_DecoderE: 2782| 153|void ASBlocks::ASIdentifierChoice::decode_from(Botan::BER_Decoder& from) { 2783| 153| const ASN1_Type next_tag = from.peek_next_object().type_tag(); 2784| | 2785| 153| if(next_tag == ASN1_Type::Null) { ------------------ | Branch (2785:7): [True: 8, False: 145] ------------------ 2786| 8| from.decode_null(); 2787| 8| m_as_ranges = std::nullopt; 2788| 145| } else if(next_tag == ASN1_Type::Sequence) { ------------------ | Branch (2788:14): [True: 119, False: 26] ------------------ 2789| 119| std::vector as_ranges; 2790| 119| from.decode_list(as_ranges); 2791| | 2792| | /* RFC 3779 Section 3.2.3.4 - 2793| | * "Any pair of items in the asIdsOrRanges SEQUENCE MUST NOT overlap. 2794| | * Any contiguous series of AS identifiers MUST be combined into a 2795| | * single range whenever possible. The AS identifiers in the 2796| | * asIdsOrRanges element MUST be sorted by increasing numeric value." 2797| | */ 2798| 119| if(!ranges_are_sorted_and_merged(as_ranges)) { ------------------ | Branch (2798:10): [True: 25, False: 94] ------------------ 2799| 25| throw Decoding_Error("ASIdentifierChoice entries must be sorted, non-overlapping and fully merged"); 2800| 25| } 2801| 94| m_as_ranges = std::move(as_ranges); 2802| 94| } else { 2803| 26| throw Decoding_Error(fmt("Unexpected type for ASIdentifierChoice {}", static_cast(next_tag))); 2804| 26| } 2805| 153|} _ZN5Botan14Cert_Extension8ASBlocks11ASIdOrRange11decode_fromERNS_11BER_DecoderE: 2818| 371|void ASBlocks::ASIdOrRange::decode_from(BER_Decoder& from) { 2819| 371| const ASN1_Type next_tag = from.peek_next_object().type_tag(); 2820| | 2821| 371| size_t min = 0; 2822| 371| size_t max = 0; 2823| | 2824| 371| if(next_tag == ASN1_Type::Integer) { ------------------ | Branch (2824:7): [True: 327, False: 44] ------------------ 2825| 327| from.decode(min); 2826| 327| m_min = checked_cast_to(min); 2827| 327| m_max = m_min; 2828| 327| } else if(next_tag == ASN1_Type::Sequence) { ------------------ | Branch (2828:14): [True: 8, False: 36] ------------------ 2829| 8| from.start_sequence().decode(min).decode(max).end_cons(); 2830| 8| m_min = checked_cast_to(min); 2831| 8| m_max = checked_cast_to(max); 2832| 8| if(m_min >= m_max) { ------------------ | Branch (2832:10): [True: 7, False: 1] ------------------ 2833| 7| throw Decoding_Error("ASIdOrRange has min greater than max"); 2834| 7| } 2835| 36| } else { 2836| 36| throw Decoding_Error(fmt("Unexpected type for ASIdOrRange {}", static_cast(next_tag))); 2837| 36| } 2838| 371|} _ZN5Botan14Cert_Extension12OCSP_NoCheck12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 2931| 10|void OCSP_NoCheck::decode_inner(const std::vector& buf) { 2932| | /* RFC 6960 Section 4.2.2.2.1 - id-pkix-ocsp-nocheck (value SHALL be NULL) */ 2933| 10| BER_Decoder(buf, BER_Decoder::Limits::DER()).decode_null().verify_end(); 2934| 10|} _ZN5Botan14Cert_Extension21NoRevocationAvailable12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 2940| 31|void NoRevocationAvailable::decode_inner(const std::vector& buf) { 2941| | // RFC 9608 Section 2, it's just a NULL 2942| 31| BER_Decoder(buf, BER_Decoder::Limits::DER()).decode_null().verify_end(); 2943| 31|} _ZN5Botan14Cert_Extension17Unknown_Extension12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 3008| 19.5k|void Unknown_Extension::decode_inner(const std::vector& bytes) { 3009| | // Just treat as an opaque blob at this level 3010| 19.5k| m_bytes = bytes; 3011| 19.5k|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_118extension_from_oidERKNS_3OIDE: 60| 27.9k|std::unique_ptr extension_from_oid(const OID& oid) { 61| 27.9k| if(auto iso_ext = is_sub_element_of(oid, {2, 5, 29})) { ------------------ | Branch (61:12): [True: 18.0k, False: 9.90k] ------------------ 62| | // NOLINTNEXTLINE(*-switch-missing-default-case) 63| 18.0k| switch(*iso_ext) { ------------------ | Branch (63:14): [True: 14.7k, False: 3.26k] ------------------ 64| 2.68k| case 14: ------------------ | Branch (64:10): [True: 2.68k, False: 15.3k] ------------------ 65| 2.68k| return make_extension(oid); 66| 2.76k| case 15: ------------------ | Branch (66:10): [True: 2.76k, False: 15.2k] ------------------ 67| 2.76k| return make_extension(oid); 68| 745| case 17: ------------------ | Branch (68:10): [True: 745, False: 17.3k] ------------------ 69| 745| return make_extension(oid); 70| 222| case 18: ------------------ | Branch (70:10): [True: 222, False: 17.8k] ------------------ 71| 222| return make_extension(oid); 72| 3.69k| case 19: ------------------ | Branch (72:10): [True: 3.69k, False: 14.3k] ------------------ 73| 3.69k| return make_extension(oid); 74| 1| case 20: ------------------ | Branch (74:10): [True: 1, False: 18.0k] ------------------ 75| 1| return make_extension(oid); 76| 1| case 21: ------------------ | Branch (76:10): [True: 1, False: 18.0k] ------------------ 77| 1| return make_extension(oid); 78| 1| case 28: ------------------ | Branch (78:10): [True: 1, False: 18.0k] ------------------ 79| 1| return make_extension(oid); 80| 290| case 30: ------------------ | Branch (80:10): [True: 290, False: 17.7k] ------------------ 81| 290| return make_extension(oid); 82| 578| case 31: ------------------ | Branch (82:10): [True: 578, False: 17.4k] ------------------ 83| 578| return make_extension(oid); 84| 120| case 32: ------------------ | Branch (84:10): [True: 120, False: 17.9k] ------------------ 85| 120| return make_extension(oid); 86| 2.02k| case 35: ------------------ | Branch (86:10): [True: 2.02k, False: 16.0k] ------------------ 87| 2.02k| return make_extension(oid); 88| 1.63k| case 37: ------------------ | Branch (88:10): [True: 1.63k, False: 16.4k] ------------------ 89| 1.63k| return make_extension(oid); 90| 31| case 56: ------------------ | Branch (90:10): [True: 31, False: 18.0k] ------------------ 91| 31| return make_extension(oid); 92| 18.0k| } 93| 18.0k| } 94| | 95| 13.1k| if(auto pkix_ext = is_sub_element_of(oid, {1, 3, 6, 1, 5, 5, 7, 1})) { ------------------ | Branch (95:12): [True: 2.23k, False: 10.9k] ------------------ 96| | // NOLINTNEXTLINE(*-switch-missing-default-case) 97| 2.23k| switch(*pkix_ext) { ------------------ | Branch (97:14): [True: 1.94k, False: 290] ------------------ 98| 1.28k| case 1: ------------------ | Branch (98:10): [True: 1.28k, False: 952] ------------------ 99| 1.28k| return make_extension(oid); 100| 266| case 7: ------------------ | Branch (100:10): [True: 266, False: 1.96k] ------------------ 101| 266| return make_extension(oid); 102| 245| case 8: ------------------ | Branch (102:10): [True: 245, False: 1.98k] ------------------ 103| 245| return make_extension(oid); 104| 151| case 26: ------------------ | Branch (104:10): [True: 151, False: 2.08k] ------------------ 105| 151| return make_extension(oid); 106| 2.23k| } 107| 2.23k| } 108| | 109| 11.2k| if(oid == Cert_Extension::OCSP_NoCheck::static_oid()) { ------------------ | Branch (109:7): [True: 10, False: 11.2k] ------------------ 110| 10| return make_extension(oid); 111| 10| } 112| | 113| 11.2k| return nullptr; // unknown 114| 11.2k|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension14Subject_Key_IDEEEDaRKNS_3OIDE: 55| 2.68k|auto make_extension([[maybe_unused]] const OID& oid) { 56| 2.68k| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 2.68k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 2.68k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 2.68k] | | ------------------ ------------------ 57| 2.68k| return std::make_unique(); 58| 2.68k|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension9Key_UsageEEEDaRKNS_3OIDE: 55| 2.76k|auto make_extension([[maybe_unused]] const OID& oid) { 56| 2.76k| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 2.76k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 2.76k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 2.76k] | | ------------------ ------------------ 57| 2.76k| return std::make_unique(); 58| 2.76k|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension24Subject_Alternative_NameEEEDaRKNS_3OIDE: 55| 745|auto make_extension([[maybe_unused]] const OID& oid) { 56| 745| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 745| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 745| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 745] | | ------------------ ------------------ 57| 745| return std::make_unique(); 58| 745|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension23Issuer_Alternative_NameEEEDaRKNS_3OIDE: 55| 222|auto make_extension([[maybe_unused]] const OID& oid) { 56| 222| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 222| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 222| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 222] | | ------------------ ------------------ 57| 222| return std::make_unique(); 58| 222|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension17Basic_ConstraintsEEEDaRKNS_3OIDE: 55| 3.69k|auto make_extension([[maybe_unused]] const OID& oid) { 56| 3.69k| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 3.69k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 3.69k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 3.69k] | | ------------------ ------------------ 57| 3.69k| return std::make_unique(); 58| 3.69k|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension10CRL_NumberEEEDaRKNS_3OIDE: 55| 1|auto make_extension([[maybe_unused]] const OID& oid) { 56| 1| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 1| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1] | | ------------------ ------------------ 57| 1| return std::make_unique(); 58| 1|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension14CRL_ReasonCodeEEEDaRKNS_3OIDE: 55| 1|auto make_extension([[maybe_unused]] const OID& oid) { 56| 1| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 1| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1] | | ------------------ ------------------ 57| 1| return std::make_unique(); 58| 1|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension30CRL_Issuing_Distribution_PointEEEDaRKNS_3OIDE: 55| 1|auto make_extension([[maybe_unused]] const OID& oid) { 56| 1| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 1| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1] | | ------------------ ------------------ 57| 1| return std::make_unique(); 58| 1|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension16Name_ConstraintsEEEDaRKNS_3OIDE: 55| 290|auto make_extension([[maybe_unused]] const OID& oid) { 56| 290| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 290| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 290| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 290] | | ------------------ ------------------ 57| 290| return std::make_unique(); 58| 290|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension23CRL_Distribution_PointsEEEDaRKNS_3OIDE: 55| 578|auto make_extension([[maybe_unused]] const OID& oid) { 56| 578| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 578| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 578| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 578] | | ------------------ ------------------ 57| 578| return std::make_unique(); 58| 578|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension20Certificate_PoliciesEEEDaRKNS_3OIDE: 55| 120|auto make_extension([[maybe_unused]] const OID& oid) { 56| 120| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 120| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 120| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 120] | | ------------------ ------------------ 57| 120| return std::make_unique(); 58| 120|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension16Authority_Key_IDEEEDaRKNS_3OIDE: 55| 2.02k|auto make_extension([[maybe_unused]] const OID& oid) { 56| 2.02k| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 2.02k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 2.02k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 2.02k] | | ------------------ ------------------ 57| 2.02k| return std::make_unique(); 58| 2.02k|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension18Extended_Key_UsageEEEDaRKNS_3OIDE: 55| 1.63k|auto make_extension([[maybe_unused]] const OID& oid) { 56| 1.63k| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 1.63k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.63k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.63k] | | ------------------ ------------------ 57| 1.63k| return std::make_unique(); 58| 1.63k|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension21NoRevocationAvailableEEEDaRKNS_3OIDE: 55| 31|auto make_extension([[maybe_unused]] const OID& oid) { 56| 31| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 31| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 31| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 31] | | ------------------ ------------------ 57| 31| return std::make_unique(); 58| 31|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension28Authority_Information_AccessEEEDaRKNS_3OIDE: 55| 1.28k|auto make_extension([[maybe_unused]] const OID& oid) { 56| 1.28k| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 1.28k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.28k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.28k] | | ------------------ ------------------ 57| 1.28k| return std::make_unique(); 58| 1.28k|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension15IPAddressBlocksEEEDaRKNS_3OIDE: 55| 266|auto make_extension([[maybe_unused]] const OID& oid) { 56| 266| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 266| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 266| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 266] | | ------------------ ------------------ 57| 266| return std::make_unique(); 58| 266|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension8ASBlocksEEEDaRKNS_3OIDE: 55| 245|auto make_extension([[maybe_unused]] const OID& oid) { 56| 245| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 245| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 245| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 245] | | ------------------ ------------------ 57| 245| return std::make_unique(); 58| 245|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension10TNAuthListEEEDaRKNS_3OIDE: 55| 151|auto make_extension([[maybe_unused]] const OID& oid) { 56| 151| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 151| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 151| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 151] | | ------------------ ------------------ 57| 151| return std::make_unique(); 58| 151|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension12OCSP_NoCheckEEEDaRKNS_3OIDE: 55| 10|auto make_extension([[maybe_unused]] const OID& oid) { 56| 10| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 137| 10| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 10| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 10] | | ------------------ ------------------ 57| 10| return std::make_unique(); 58| 10|} x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_126policy_oids_have_duplicateERKNSt3__16vectorINS_3OIDENS2_9allocatorIS4_EEEE: 877| 52|bool policy_oids_have_duplicate(const std::vector& oids) { 878| 52| std::set seen; 879| 75| for(const auto& oid : oids) { ------------------ | Branch (879:24): [True: 75, False: 51] ------------------ 880| 75| if(!seen.insert(oid).second) { ------------------ | Branch (880:10): [True: 1, False: 74] ------------------ 881| 1| return true; 882| 1| } 883| 75| } 884| 51| return false; 885| 52|} x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_118Policy_Information11decode_fromERNS_11BER_DecoderE: 869| 379| void decode_from(BER_Decoder& codec) override { 870| 379| codec.start_sequence().decode(m_oid).discard_remaining().end_cons(); 871| 379| } x509_ext.cpp:_ZNK5Botan14Cert_Extension12_GLOBAL__N_118Policy_Information3oidEv: 865| 75| const OID& oid() const { return m_oid; } x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_130validate_general_name_encodingENS_9ASN1_TypeENS_10ASN1_ClassENSt3__14spanIKhLm18446744073709551615EEE: 1014| 977|void validate_general_name_encoding(ASN1_Type tag, ASN1_Class cls, std::span value) { 1015| | // AlternativeName decodes GeneralNames; AIA accessLocation is a single GeneralName. 1016| 977| std::vector wrapped_name; 1017| 977| DER_Encoder(wrapped_name).start_sequence().add_object(tag, cls, value).end_cons(); 1018| | 1019| 977| AlternativeName decoded_name; 1020| 977| BER_Decoder(wrapped_name, BER_Decoder::Limits::DER()).decode(decoded_name).verify_end(); 1021| | 1022| 977| if((tag == ASN1_Type(1) || tag == ASN1_Type(2) || tag == ASN1_Type(6)) && value.empty()) { ------------------ | Branch (1022:8): [True: 508, False: 469] | Branch (1022:31): [True: 4, False: 465] | Branch (1022:54): [True: 450, False: 15] | Branch (1022:78): [True: 6, False: 452] ------------------ 1023| 6| throw Decoding_Error("GeneralName IA5String value must not be empty"); 1024| 6| } 1025| 971| if(tag == ASN1_Type(4) && ------------------ | Branch (1025:7): [True: 0, False: 971] ------------------ 1026| 0| std::ranges::any_of(decoded_name.directory_names(), [](const X509_DN& dn) { return dn.empty(); })) { ------------------ | Branch (1026:7): [True: 0, False: 0] ------------------ 1027| 0| throw Decoding_Error("GeneralName directoryName must not be empty"); 1028| 0| } 1029| 971|} x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_152crl_distribution_point_uris_from_distribution_pointsERKNSt3__16vectorINS0_23CRL_Distribution_Points18Distribution_PointENS2_9allocatorIS5_EEEE: 1307| 114| const std::vector& dps) { 1308| 114| std::vector out; 1309| 238| for(const auto& dp : dps) { ------------------ | Branch (1309:23): [True: 238, False: 114] ------------------ 1310| 238| const auto& dpn = dp.distribution_point_name(); 1311| 238| if(dpn.has_value() && dpn->full_name().has_value()) { ------------------ | Branch (1311:10): [True: 238, False: 0] | Branch (1311:29): [True: 238, False: 0] ------------------ 1312| 387| for(const auto& uri : dpn->full_name()->uri_names()) { ------------------ | Branch (1312:30): [True: 387, False: 238] ------------------ 1313| 387| out.push_back(uri); 1314| 387| } 1315| 238| } 1316| 238| } 1317| 114| return out; 1318| 114|} x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_125crl_issuer_is_well_formedERKNS_15AlternativeNameE: 1301| 1|bool crl_issuer_is_well_formed(const AlternativeName& crl_issuer) { 1302| 1| const auto& dn = crl_issuer.directory_names(); 1303| 1| return crl_issuer.count() == 1 && dn.size() == 1 && !dn.begin()->empty(); ------------------ | Branch (1303:11): [True: 1, False: 0] | Branch (1303:38): [True: 0, False: 1] | Branch (1303:56): [True: 0, False: 0] ------------------ 1304| 1|} x509_ext.cpp:_ZZN5Botan14Cert_Extension10TNAuthList5Entry11decode_fromERNS_11BER_DecoderEENK3$_0clES4_NSt3__117basic_string_viewIcNS6_11char_traitsIcEEEE: 1668| 134| const auto decode_ia5_string = [](BER_Decoder& from, std::string_view what) { 1669| 134| ASN1_String str; 1670| 134| from.decode(str); 1671| 134| if(str.tagging() != ASN1_Type::Ia5String) { ------------------ | Branch (1671:10): [True: 9, False: 125] ------------------ 1672| 9| throw Decoding_Error(fmt("TNAuthList {} must be an IA5String", what)); 1673| 9| } 1674| 125| return str.value(); 1675| 134| }; x509_ext.cpp:_ZZN5Botan14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEEENK3$_0clERNS_11BER_DecoderE: 636| 1.19k| [&](BER_Decoder& d) { 637| 1.19k| d.decode(m_key_id, ASN1_Type::OctetString, ASN1_Type(0), ASN1_Class::ContextSpecific); 638| 1.19k| key_id_present = true; 639| 1.19k| }) x509_ext.cpp:_ZZN5Botan14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEEENK3$_1clERNS_11BER_DecoderE: 642| 749| [&](BER_Decoder& d) { 643| 749| AlternativeName names; 644| 749| d.decode_implicit(names, 645| 749| ASN1_Type(1), 646| 749| ASN1_Class::ContextSpecific | ASN1_Class::Constructed, 647| 749| ASN1_Type::Sequence, 648| 749| ASN1_Class::Constructed); 649| 749| authority_cert_issuer = std::move(names); 650| 749| }) x509_ext.cpp:_ZZN5Botan14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEEENK3$_2clERNS_11BER_DecoderE: 651| 645| .decode_optional_field(2, ASN1_Class::ContextSpecific, [&](BER_Decoder& d) { 652| 645| X509_Serial_Number serial; 653| 645| d.decode_implicit( 654| 645| serial, ASN1_Type(2), ASN1_Class::ContextSpecific, ASN1_Type::Integer, ASN1_Class::Universal); 655| 645| authority_cert_serial = std::move(serial); 656| 645| }); x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_118Policy_InformationC2Ev: 861| 379| Policy_Information() = default; x509_ext.cpp:_ZZN5Botan14Cert_Extension23CRL_Distribution_Points18Distribution_Point11decode_fromERNS_11BER_DecoderEENK3$_0clES4_: 1456| 635| [&](BER_Decoder& d) { 1457| 635| DistributionPointName name; 1458| 635| d.start_context_specific(0).decode(name).verify_end(); 1459| 635| m_dp_name = std::move(name); 1460| 635| }) x509_ext.cpp:_ZZN5Botan14Cert_Extension23CRL_Distribution_Points18Distribution_Point11decode_fromERNS_11BER_DecoderEENK3$_1clES4_: 1462| 17| 1, ASN1_Class::ContextSpecific, [&](BER_Decoder& d) { m_reasons = decode_reason_flags_implicit(d, 1); }) x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_128decode_reason_flags_implicitERNS_11BER_DecoderEj: 1287| 17|ReasonFlags decode_reason_flags_implicit(BER_Decoder& decoder, uint32_t tag) { 1288| 17| uint64_t bits = 0; 1289| 17| decoder.decode_named_bitstring(bits, ReasonFlagsNamedBitWidth, ASN1_Type(tag), ASN1_Class::ContextSpecific); 1290| 17| return ReasonFlags(checked_cast_to(bits)); 1291| 17|} x509_ext.cpp:_ZZN5Botan14Cert_Extension23CRL_Distribution_Points18Distribution_Point11decode_fromERNS_11BER_DecoderEENK3$_2clES4_: 1463| 10| .decode_optional_field(2, ASN1_Class::ContextSpecific | ASN1_Class::Constructed, [&](BER_Decoder& d) { 1464| 10| AlternativeName crl_issuer; 1465| 10| d.decode_implicit(crl_issuer, 1466| 10| ASN1_Type(2), 1467| 10| ASN1_Class::ContextSpecific | ASN1_Class::Constructed, 1468| 10| ASN1_Type::Sequence, 1469| 10| ASN1_Class::Constructed); 1470| 10| m_crl_issuer = std::move(crl_issuer); 1471| 10| }); x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_19successorILNS0_15IPAddressBlocks7VersionE4EEENS3_9IPAddressIXT_EEERKS6_: 2147| 6|IPAddressBlocks::IPAddress successor(const IPAddressBlocks::IPAddress& addr) { 2148| 6| auto bytes = addr.to_bytes(); 2149| 18| for(auto it = bytes.rbegin(); it != bytes.rend(); ++it) { ------------------ | Branch (2149:34): [True: 18, False: 0] ------------------ 2150| 18| (*it)++; 2151| 18| if(*it != 0) { ------------------ | Branch (2151:10): [True: 6, False: 12] ------------------ 2152| 6| break; 2153| 6| } 2154| 18| } 2155| 6| using Address = std::conditional_t; 2156| 6| return IPAddressBlocks::IPAddress(Address(bytes)); 2157| 6|} x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_19successorILNS0_15IPAddressBlocks7VersionE16EEENS3_9IPAddressIXT_EEERKS6_: 2147| 14|IPAddressBlocks::IPAddress successor(const IPAddressBlocks::IPAddress& addr) { 2148| 14| auto bytes = addr.to_bytes(); 2149| 210| for(auto it = bytes.rbegin(); it != bytes.rend(); ++it) { ------------------ | Branch (2149:34): [True: 210, False: 0] ------------------ 2150| 210| (*it)++; 2151| 210| if(*it != 0) { ------------------ | Branch (2151:10): [True: 14, False: 196] ------------------ 2152| 14| break; 2153| 14| } 2154| 210| } 2155| 14| using Address = std::conditional_t; 2156| 14| return IPAddressBlocks::IPAddress(Address(bytes)); 2157| 14|} x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_128ranges_are_sorted_and_mergedINS0_15IPAddressBlocks16IPAddressOrRangeILNS3_7VersionE4EEEEEbRKNSt3__16vectorIT_NS7_9allocatorIS9_EEEE: 2204| 67|bool ranges_are_sorted_and_merged(const std::vector& ranges) { 2205| 72| for(size_t i = 1; i < ranges.size(); i++) { ------------------ | Branch (2205:22): [True: 24, False: 48] ------------------ 2206| | // Required sorted order without overlaps implies the previous maximum 2207| | // is strictly below the next minimum 2208| 24| if(!(ranges[i - 1].max() < ranges[i].min())) { ------------------ | Branch (2208:10): [True: 18, False: 6] ------------------ 2209| 18| return false; 2210| 18| } 2211| | // Contiguous entries were required to be combined by the issuer. The 2212| | // increment cannot wrap since max() < min() <= the all-ones value. 2213| 6| if(successor(ranges[i - 1].max()) == ranges[i].min()) { ------------------ | Branch (2213:10): [True: 1, False: 5] ------------------ 2214| 1| return false; 2215| 1| } 2216| 6| } 2217| 48| return true; 2218| 67|} x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_128ranges_are_sorted_and_mergedINS0_15IPAddressBlocks16IPAddressOrRangeILNS3_7VersionE16EEEEEbRKNSt3__16vectorIT_NS7_9allocatorIS9_EEEE: 2204| 58|bool ranges_are_sorted_and_merged(const std::vector& ranges) { 2205| 69| for(size_t i = 1; i < ranges.size(); i++) { ------------------ | Branch (2205:22): [True: 28, False: 41] ------------------ 2206| | // Required sorted order without overlaps implies the previous maximum 2207| | // is strictly below the next minimum 2208| 28| if(!(ranges[i - 1].max() < ranges[i].min())) { ------------------ | Branch (2208:10): [True: 14, False: 14] ------------------ 2209| 14| return false; 2210| 14| } 2211| | // Contiguous entries were required to be combined by the issuer. The 2212| | // increment cannot wrap since max() < min() <= the all-ones value. 2213| 14| if(successor(ranges[i - 1].max()) == ranges[i].min()) { ------------------ | Branch (2213:10): [True: 3, False: 11] ------------------ 2214| 3| return false; 2215| 3| } 2216| 14| } 2217| 41| return true; 2218| 58|} x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_19successorITkNSt3__117unsigned_integralEjEET_S4_: 2160| 145|T successor(T x) { 2161| 145| return static_cast(x + 1); 2162| 145|} x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_128ranges_are_sorted_and_mergedINS0_8ASBlocks11ASIdOrRangeEEEbRKNSt3__16vectorIT_NS5_9allocatorIS7_EEEE: 2204| 72|bool ranges_are_sorted_and_merged(const std::vector& ranges) { 2205| 216| for(size_t i = 1; i < ranges.size(); i++) { ------------------ | Branch (2205:22): [True: 169, False: 47] ------------------ 2206| | // Required sorted order without overlaps implies the previous maximum 2207| | // is strictly below the next minimum 2208| 169| if(!(ranges[i - 1].max() < ranges[i].min())) { ------------------ | Branch (2208:10): [True: 24, False: 145] ------------------ 2209| 24| return false; 2210| 24| } 2211| | // Contiguous entries were required to be combined by the issuer. The 2212| | // increment cannot wrap since max() < min() <= the all-ones value. 2213| 145| if(successor(ranges[i - 1].max()) == ranges[i].min()) { ------------------ | Branch (2213:10): [True: 1, False: 144] ------------------ 2214| 1| return false; 2215| 1| } 2216| 145| } 2217| 47| return true; 2218| 72|} _ZN5Botan11X509_Object9load_dataERNS_10DataSourceE: 24| 13.9k|void X509_Object::load_data(DataSource& in) { 25| 13.9k| try { 26| 13.9k| if(ASN1::maybe_BER(in) && !PEM_Code::matches(in)) { ------------------ | Branch (26:10): [True: 11.8k, False: 2.11k] | Branch (26:33): [True: 11.2k, False: 576] ------------------ 27| 11.2k| BER_Decoder dec(in, BER_Decoder::Limits::DER()); 28| 11.2k| decode_from(dec); 29| | // Call to verify_end omitted here since we have to sometimes decode 30| | // multiple certificates encoded sequentially in a DataSource 31| 11.2k| } else { 32| 2.69k| std::string got_label; 33| 2.69k| DataSource_Memory ber(PEM_Code::decode(in, got_label)); 34| | 35| 2.69k| if(got_label != PEM_label()) { ------------------ | Branch (35:13): [True: 84, False: 2.60k] ------------------ 36| 84| bool is_alternate = false; 37| 84| for(const std::string_view alt_label : alternate_PEM_labels()) { ------------------ | Branch (37:50): [True: 84, False: 83] ------------------ 38| 84| if(got_label == alt_label) { ------------------ | Branch (38:19): [True: 1, False: 83] ------------------ 39| 1| is_alternate = true; 40| 1| break; 41| 1| } 42| 84| } 43| | 44| 84| if(!is_alternate) { ------------------ | Branch (44:16): [True: 83, False: 1] ------------------ 45| 83| throw Decoding_Error("Unexpected PEM label for " + PEM_label() + " of " + got_label); 46| 83| } 47| 84| } 48| | 49| 2.60k| BER_Decoder dec(ber, BER_Decoder::Limits::DER()); 50| 2.60k| decode_from(dec); 51| | // Call to verify_end omitted here since we have to sometimes decode 52| | // multiple certificates encoded sequentially in a DataSource 53| 2.60k| } 54| 13.9k| } catch(Decoding_Error& e) { 55| 3.02k| throw Decoding_Error(PEM_label() + " decoding", e); 56| 3.02k| } 57| 13.9k|} _ZNK5Botan11X509_Object9signatureEv: 59| 10.6k|const std::vector& X509_Object::signature() const { 60| 10.6k| if(!m_signed_data) { ------------------ | Branch (60:7): [True: 0, False: 10.6k] ------------------ 61| 0| throw Invalid_State("X509_Object uninitialized"); 62| 0| } 63| 10.6k| return m_signed_data->m_sig; 64| 10.6k|} _ZNK5Botan11X509_Object11signed_bodyEv: 66| 21.9k|const std::vector& X509_Object::signed_body() const { 67| 21.9k| if(!m_signed_data) { ------------------ | Branch (67:7): [True: 0, False: 21.9k] ------------------ 68| 0| throw Invalid_State("X509_Object uninitialized"); 69| 0| } 70| 21.9k| return m_signed_data->m_tbs_bits; 71| 21.9k|} _ZNK5Botan11X509_Object19signature_algorithmEv: 73| 24.8k|const AlgorithmIdentifier& X509_Object::signature_algorithm() const { 74| 24.8k| if(!m_signed_data) { ------------------ | Branch (74:7): [True: 0, False: 24.8k] ------------------ 75| 0| throw Invalid_State("X509_Object uninitialized"); 76| 0| } 77| 24.8k| return m_signed_data->m_sig_algo; 78| 24.8k|} _ZNK5Botan11X509_Object11encode_intoERNS_11DER_EncoderE: 80| 9.53k|void X509_Object::encode_into(DER_Encoder& to) const { 81| 9.53k| to.start_sequence() 82| 9.53k| .start_sequence() 83| 9.53k| .raw_bytes(signed_body()) 84| 9.53k| .end_cons() 85| 9.53k| .encode(signature_algorithm()) 86| 9.53k| .encode_octet_aligned_bitstring(signature()) 87| 9.53k| .end_cons(); 88| 9.53k|} _ZN5Botan11X509_Object11decode_fromERNS_11BER_DecoderE: 93| 12.1k|void X509_Object::decode_from(BER_Decoder& from) { 94| 12.1k| auto data = std::make_shared(); 95| | 96| 12.1k| from.start_sequence() 97| 12.1k| .start_sequence() 98| 12.1k| .raw_bytes(data->m_tbs_bits) 99| 12.1k| .end_cons() 100| 12.1k| .decode(data->m_sig_algo) 101| 12.1k| .decode_octet_aligned_bitstring(data->m_sig) 102| 12.1k| .end_cons(); 103| | 104| 12.1k| m_signed_data = std::move(data); 105| 12.1k| force_decode(); 106| 12.1k|} _ZNK5Botan11X509_Object16verify_signatureERKNS_10Public_KeyE: 130| 1.44k|std::pair X509_Object::verify_signature(const Public_Key& pub_key) const { 131| 1.44k| try { 132| 1.44k| PK_Verifier verifier(pub_key, signature_algorithm()); 133| 1.44k| const auto& tbs = signed_body(); 134| 1.44k| verifier.update(ASN1::der_sequence_header(tbs.size())); 135| 1.44k| verifier.update(tbs); 136| 1.44k| const bool valid = verifier.check_signature(signature()); 137| | 138| 1.44k| if(valid) { ------------------ | Branch (138:10): [True: 19, False: 1.42k] ------------------ 139| 19| return std::make_pair(Certificate_Status_Code::VERIFIED, verifier.hash_function()); 140| 1.42k| } else { 141| 1.42k| return std::make_pair(Certificate_Status_Code::SIGNATURE_ERROR, ""); 142| 1.42k| } 143| 1.44k| } catch(Decoding_Error&) { 144| 280| return std::make_pair(Certificate_Status_Code::SIGNATURE_ALGO_BAD_PARAMS, ""); 145| 280| } catch(Lookup_Error&) { 146| 0| return std::make_pair(Certificate_Status_Code::SIGNATURE_ALGO_UNKNOWN, ""); 147| 0| } catch(...) { 148| | // This shouldn't happen, fallback to generic signature error 149| 0| return std::make_pair(Certificate_Status_Code::SIGNATURE_ERROR, ""); 150| 0| } 151| 1.44k|} _ZN5Botan18X509_Serial_NumberC2ERKNS_6BigIntE: 20| 11.8k|X509_Serial_Number::X509_Serial_Number(const BigInt& value) : m_contents(ASN1::integer_contents(value)) {} _ZNK5Botan18X509_Serial_Number11is_negativeEv: 65| 10.1k|bool X509_Serial_Number::is_negative() const { 66| 10.1k| BOTAN_STATE_CHECK(!m_contents.empty()); ------------------ | | 51| 10.1k| do { \ | | 52| 10.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 10.1k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 10.1k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 10.1k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 10.1k] | | ------------------ ------------------ 67| 10.1k| return (m_contents[0] & 0x80) == 0x80; 68| 10.1k|} _ZNK5Botan18X509_Serial_Number7is_zeroEv: 70| 10.2k|bool X509_Serial_Number::is_zero() const { 71| 10.2k| return m_contents.size() == 1 && m_contents[0] == 0x00; ------------------ | Branch (71:11): [True: 3.32k, False: 6.89k] | Branch (71:37): [True: 77, False: 3.24k] ------------------ 72| 10.2k|} _ZNK5Botan18X509_Serial_Number9magnitudeEv: 74| 10.2k|std::vector X509_Serial_Number::magnitude() const { 75| 10.2k| BOTAN_STATE_CHECK(!m_contents.empty()); ------------------ | | 51| 10.2k| do { \ | | 52| 10.2k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 10.2k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 10.2k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 10.2k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 10.2k] | | ------------------ ------------------ 76| | 77| 10.2k| if(is_zero()) { ------------------ | Branch (77:7): [True: 77, False: 10.1k] ------------------ 78| 77| return {}; 79| 10.1k| } else if(is_negative()) { ------------------ | Branch (79:14): [True: 1.49k, False: 8.64k] ------------------ 80| 1.49k| return to_bigint().serialize(); 81| 8.64k| } else if(m_contents[0] == 0x00) { ------------------ | Branch (81:14): [True: 1.98k, False: 6.66k] ------------------ 82| | // Positive value whose leading magnitude bit is set; skip the sign octet 83| 1.98k| return {m_contents.begin() + 1, m_contents.end()}; 84| 6.66k| } else { 85| 6.66k| return m_contents; 86| 6.66k| } 87| 10.2k|} _ZNK5Botan18X509_Serial_Number9to_bigintEv: 89| 1.49k|BigInt X509_Serial_Number::to_bigint() const { 90| 1.49k| BOTAN_STATE_CHECK(!m_contents.empty()); ------------------ | | 51| 1.49k| do { \ | | 52| 1.49k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 1.49k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 1.49k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 1.49k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 1.49k] | | ------------------ ------------------ 91| 1.49k| return ASN1::integer_from_contents(m_contents); 92| 1.49k|} _ZN5Botan18X509_Serial_Number11decode_fromERNS_11BER_DecoderE: 108| 11.8k|void X509_Serial_Number::decode_from(BER_Decoder& from) { 109| | // Decode via BigInt so the decoder's limits apply, in particular the 110| | // rejection of non-minimal INTEGER encodings in DER mode 111| 11.8k| BigInt value; 112| 11.8k| from.decode(value); 113| 11.8k| *this = X509_Serial_Number(value); 114| 11.8k|} _ZN5Botan16X509_CertificateD2Ev: 85| 86.6k|X509_Certificate::~X509_Certificate() = default; _ZNK5Botan16X509_Certificate9PEM_labelEv: 87| 4.09k|std::string X509_Certificate::PEM_label() const { 88| 4.09k| return "CERTIFICATE"; 89| 4.09k|} _ZNK5Botan16X509_Certificate20alternate_PEM_labelsEv: 91| 84|std::vector X509_Certificate::alternate_PEM_labels() const { 92| 84| return {"X509 CERTIFICATE"}; 93| 84|} _ZN5Botan16X509_CertificateC2ERNS_10DataSourceE: 95| 13.9k|X509_Certificate::X509_Certificate(DataSource& src) { 96| 13.9k| load_data(src); 97| 13.9k|} _ZN5Botan16X509_Certificate12force_decodeEv: 366| 11.2k|void X509_Certificate::force_decode() { 367| 11.2k| m_data.reset(); 368| 11.2k| m_data = parse_x509_cert_body(*this); 369| 11.2k|} _ZNK5Botan16X509_Certificate4dataEv: 371| 71.8k|const X509_Certificate_Data& X509_Certificate::data() const { 372| 71.8k| if(m_data == nullptr) { ------------------ | Branch (372:7): [True: 0, False: 71.8k] ------------------ 373| 0| throw Invalid_State("X509_Certificate uninitialized"); 374| 0| } 375| 71.8k| return *m_data; 376| 71.8k|} _ZNK5Botan16X509_Certificate12x509_versionEv: 378| 102|uint32_t X509_Certificate::x509_version() const { 379| 102| return static_cast(data().m_version); 380| 102|} _ZNK5Botan16X509_Certificate14is_self_signedEv: 382| 7.54k|bool X509_Certificate::is_self_signed() const { 383| 7.54k| return data().m_self_signed; 384| 7.54k|} _ZNK5Botan16X509_Certificate10not_beforeEv: 386| 51|const X509_Time& X509_Certificate::not_before() const { 387| 51| return data().m_not_before; 388| 51|} _ZNK5Botan16X509_Certificate9not_afterEv: 390| 51|const X509_Time& X509_Certificate::not_after() const { 391| 51| return data().m_not_after; 392| 51|} _ZNK5Botan16X509_Certificate16v2_issuer_key_idEv: 398| 5|const std::vector& X509_Certificate::v2_issuer_key_id() const { 399| 5| return data().m_v2_issuer_key_id; 400| 5|} _ZNK5Botan16X509_Certificate17v2_subject_key_idEv: 402| 5|const std::vector& X509_Certificate::v2_subject_key_id() const { 403| 5| return data().m_v2_subject_key_id; 404| 5|} _ZNK5Botan16X509_Certificate23subject_public_key_infoEv: 410| 3.55k|const std::vector& X509_Certificate::subject_public_key_info() const { 411| 3.55k| return data().m_subject_public_key_bits_seq; 412| 3.55k|} _ZNK5Botan16X509_Certificate16authority_key_idEv: 430| 7.49k|const std::vector& X509_Certificate::authority_key_id() const { 431| 7.49k| return data().m_authority_key_id; 432| 7.49k|} _ZNK5Botan16X509_Certificate14subject_key_idEv: 434| 655|const std::vector& X509_Certificate::subject_key_id() const { 435| 655| return data().m_subject_key_id; 436| 655|} _ZNK5Botan16X509_Certificate6serialEv: 442| 51|const X509_Serial_Number& X509_Certificate::serial() const { 443| 51| return data().m_serial; 444| 51|} _ZNK5Botan16X509_Certificate21skip_revocation_checkEv: 450| 9|bool X509_Certificate::skip_revocation_check() const { 451| 9| return data().m_skip_revocation_check; 452| 9|} _ZNK5Botan16X509_Certificate9issuer_dnEv: 454| 7.56k|const X509_DN& X509_Certificate::issuer_dn() const { 455| 7.56k| return data().m_issuer_dn; 456| 7.56k|} _ZNK5Botan16X509_Certificate10subject_dnEv: 458| 11.2k|const X509_DN& X509_Certificate::subject_dn() const { 459| 11.2k| return data().m_subject_dn; 460| 11.2k|} _ZNK5Botan16X509_Certificate10is_CA_certEv: 481| 53|bool X509_Certificate::is_CA_cert() const { 482| 53| if(data().m_version < 3 && data().m_self_signed) { ------------------ | Branch (482:7): [True: 29, False: 24] | Branch (482:31): [True: 29, False: 0] ------------------ 483| 29| return true; 484| 29| } 485| | 486| 24| return data().m_is_ca_certificate; 487| 53|} _ZNK5Botan16X509_Certificate22path_length_constraintEv: 497| 19|std::optional X509_Certificate::path_length_constraint() const { 498| 19| return data().m_path_len_constraint; 499| 19|} _ZNK5Botan16X509_Certificate11constraintsEv: 501| 32|Key_Constraints X509_Certificate::constraints() const { 502| 32| return data().m_key_constraints; 503| 32|} _ZNK5Botan16X509_Certificate13v3_extensionsEv: 517| 51|const Extensions& X509_Certificate::v3_extensions() const { 518| 51| return data().m_v3_extensions; 519| 51|} _ZNK5Botan16X509_Certificate15has_constraintsENS_15Key_ConstraintsE: 521| 32|bool X509_Certificate::has_constraints(Key_Constraints usage) const { 522| | // Unlike allowed_usage, returns false if constraints was not set 523| 32| return constraints().includes(usage); 524| 32|} _ZNK5Botan16X509_Certificate13allowed_usageENS_10Usage_TypeE: 550| 32|bool X509_Certificate::allowed_usage(Usage_Type usage) const { 551| | // These follow suggestions in RFC 5280 4.2.1.12 552| | 553| 32| switch(usage) { ------------------ | Branch (553:11): [True: 32, False: 0] ------------------ 554| 32| case Usage_Type::UNSPECIFIED: ------------------ | Branch (554:7): [True: 32, False: 0] ------------------ 555| 32| return true; 556| | 557| 0| case Usage_Type::TLS_SERVER_AUTH: ------------------ | Branch (557:7): [True: 0, False: 32] ------------------ 558| 0| return (allowed_usage(Key_Constraints::KeyAgreement) || allowed_usage(Key_Constraints::KeyEncipherment) || ------------------ | Branch (558:18): [True: 0, False: 0] | Branch (558:66): [True: 0, False: 0] ------------------ 559| 0| allowed_usage(Key_Constraints::DigitalSignature)) && ------------------ | Branch (559:18): [True: 0, False: 0] ------------------ 560| 0| allowed_extended_usage("PKIX.ServerAuth"); ------------------ | Branch (560:17): [True: 0, False: 0] ------------------ 561| | 562| 0| case Usage_Type::TLS_CLIENT_AUTH: ------------------ | Branch (562:7): [True: 0, False: 32] ------------------ 563| 0| return (allowed_usage(Key_Constraints::DigitalSignature) || allowed_usage(Key_Constraints::KeyAgreement)) && ------------------ | Branch (563:18): [True: 0, False: 0] | Branch (563:70): [True: 0, False: 0] ------------------ 564| 0| allowed_extended_usage("PKIX.ClientAuth"); ------------------ | Branch (564:17): [True: 0, False: 0] ------------------ 565| | 566| 0| case Usage_Type::OCSP_RESPONDER: ------------------ | Branch (566:7): [True: 0, False: 32] ------------------ 567| 0| return (allowed_usage(Key_Constraints::DigitalSignature) || allowed_usage(Key_Constraints::NonRepudiation)) && ------------------ | Branch (567:18): [True: 0, False: 0] | Branch (567:70): [True: 0, False: 0] ------------------ 568| 0| has_ex_constraint("PKIX.OCSPSigning"); ------------------ | Branch (568:17): [True: 0, False: 0] ------------------ 569| | 570| 0| case Usage_Type::CERTIFICATE_AUTHORITY: ------------------ | Branch (570:7): [True: 0, False: 32] ------------------ 571| 0| return is_CA_cert(); 572| | 573| 0| case Usage_Type::ENCRYPTION: ------------------ | Branch (573:7): [True: 0, False: 32] ------------------ 574| 0| return (allowed_usage(Key_Constraints::KeyEncipherment) || allowed_usage(Key_Constraints::DataEncipherment)); ------------------ | Branch (574:18): [True: 0, False: 0] | Branch (574:69): [True: 0, False: 0] ------------------ 575| 32| } 576| | 577| 0| return false; 578| 32|} _ZNK5Botan16X509_Certificate18subject_public_keyEv: 756| 3.55k|std::unique_ptr X509_Certificate::subject_public_key() const { 757| 3.55k| try { 758| 3.55k| return std::unique_ptr(X509::load_key(subject_public_key_info())); 759| 3.55k| } catch(std::exception& e) { 760| 2.10k| throw Decoding_Error("X509_Certificate::subject_public_key", e); 761| 2.10k| } 762| 3.55k|} _ZNK5Botan16X509_Certificate3tagEv: 809| 33.3k|X509_Certificate::Tag X509_Certificate::tag() const { 810| 33.3k| return Tag(data().m_cert_data_sha256); 811| 33.3k|} x509cert.cpp:_ZN5Botan12_GLOBAL__N_120parse_x509_cert_bodyERKNS_11X509_ObjectE: 113| 11.2k|std::unique_ptr parse_x509_cert_body(const X509_Object& obj) { 114| 11.2k| auto data = std::make_unique(); 115| | 116| 11.2k| BER_Object public_key; 117| 11.2k| BER_Object v3_exts_data; 118| | 119| 11.2k| BER_Decoder(obj.signed_body(), BER_Decoder::Limits::DER()) 120| 11.2k| .decode_optional(data->m_version, ASN1_Type(0), ASN1_Class::Constructed | ASN1_Class::ContextSpecific) 121| 11.2k| .decode(data->m_serial) 122| 11.2k| .decode(data->m_sig_algo_inner) 123| 11.2k| .decode(data->m_issuer_dn) 124| 11.2k| .start_sequence() 125| 11.2k| .decode(data->m_not_before) 126| 11.2k| .decode(data->m_not_after) 127| 11.2k| .end_cons() 128| 11.2k| .decode(data->m_subject_dn) 129| 11.2k| .get_next(public_key) 130| 11.2k| .decode_optional_string(data->m_v2_issuer_key_id, ASN1_Type::BitString, 1) 131| 11.2k| .decode_optional_string(data->m_v2_subject_key_id, ASN1_Type::BitString, 2) 132| 11.2k| .get_next(v3_exts_data) 133| 11.2k| .verify_end("TBSCertificate has extra data after extensions block"); 134| | 135| 11.2k| if(data->m_version > 2) { ------------------ | Branch (135:7): [True: 3, False: 11.2k] ------------------ 136| 3| throw Decoding_Error("Unknown X.509 cert version " + std::to_string(data->m_version)); 137| 3| } 138| 11.2k| if(obj.signature_algorithm() != data->m_sig_algo_inner) { ------------------ | Branch (138:7): [True: 29, False: 11.2k] ------------------ 139| 29| throw Decoding_Error("X.509 Certificate had differing algorithm identifiers in inner and outer ID fields"); 140| 29| } 141| | 142| 11.2k| public_key.assert_is_a(ASN1_Type::Sequence, ASN1_Class::Constructed, "X.509 certificate public key"); 143| | 144| | // for general sanity convert wire version (0 based) to standards version (v1 .. v3) 145| 11.2k| data->m_version += 1; 146| | 147| 11.2k| data->m_serial_bits = data->m_serial.magnitude(); 148| 11.2k| data->m_subject_dn_bits = ASN1::put_in_sequence(data->m_subject_dn.get_bits()); 149| 11.2k| data->m_issuer_dn_bits = ASN1::put_in_sequence(data->m_issuer_dn.get_bits()); 150| | 151| 11.2k| data->m_subject_public_key_bits.assign(public_key.bits(), public_key.bits() + public_key.length()); 152| | 153| 11.2k| data->m_subject_public_key_bits_seq = ASN1::put_in_sequence(data->m_subject_public_key_bits); 154| | 155| 11.2k| BER_Decoder(data->m_subject_public_key_bits, BER_Decoder::Limits::DER()) 156| 11.2k| .decode(data->m_subject_public_key_algid) 157| 11.2k| .decode_octet_aligned_bitstring(data->m_subject_public_key_bitstring) 158| 11.2k| .verify_end(); 159| | 160| 11.2k| if(v3_exts_data.is_a(3, ASN1_Class::Constructed | ASN1_Class::ContextSpecific)) { ------------------ | Branch (160:7): [True: 7.47k, False: 3.76k] ------------------ 161| | // Path validation will reject a v1/v2 cert with v3 extensions 162| 7.47k| BER_Decoder cert_extensions(v3_exts_data, BER_Decoder::Limits::DER()); 163| 7.47k| data->m_v3_extensions.decode_from(cert_extensions, Extension_Context::Certificate); 164| 7.47k| cert_extensions.verify_end(); 165| 7.47k| } else if(v3_exts_data.is_set()) { ------------------ | Branch (165:14): [True: 44, False: 3.71k] ------------------ 166| 44| throw BER_Bad_Tag("Unknown tag in X.509 cert", v3_exts_data.tagging()); 167| 44| } 168| | 169| | // Now cache some fields from the extensions 170| 11.1k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (170:19): [True: 1.58k, False: 9.60k] ------------------ 171| 1.58k| data->m_key_constraints = ext->get_constraints(); 172| | /* 173| | RFC 5280: When the keyUsage extension appears in a certificate, 174| | at least one of the bits MUST be set to 1. 175| | */ 176| 1.58k| if(data->m_key_constraints.empty()) { ------------------ | Branch (176:10): [True: 0, False: 1.58k] ------------------ 177| 0| throw Decoding_Error("Certificate has invalid encoding for KeyUsage"); 178| 0| } 179| 1.58k| } 180| | 181| 11.1k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (181:19): [True: 2.10k, False: 9.09k] ------------------ 182| 2.10k| data->m_subject_key_id = ext->get_key_id(); 183| 2.10k| } 184| | 185| 11.1k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (185:19): [True: 904, False: 10.2k] ------------------ 186| 904| data->m_authority_key_id = ext->get_key_id(); 187| 904| } 188| | 189| 11.1k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (189:19): [True: 24, False: 11.1k] ------------------ 190| 24| data->m_name_constraints = ext->get_name_constraints(); 191| 24| } 192| | 193| 11.1k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (193:19): [True: 679, False: 10.5k] ------------------ 194| 679| data->m_extended_key_usage = ext->object_identifiers(); 195| | /* 196| | RFC 5280 section 4.2.1.12 197| | 198| | "This extension indicates one or more purposes ..." 199| | 200| | "If the extension is present, then the certificate MUST only be 201| | used for one of the purposes indicated." 202| | 203| | Thus we reject an EKU extension which is empty, since this indicates 204| | the certificate cannot be used for any purpose. 205| | */ 206| 679| if(data->m_extended_key_usage.empty()) { ------------------ | Branch (206:10): [True: 0, False: 679] ------------------ 207| 0| throw Decoding_Error("Certificate has invalid empty EKU extension"); 208| 0| } 209| 679| } 210| | 211| 11.1k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (211:19): [True: 1.76k, False: 9.42k] ------------------ 212| | /* 213| | * RFC 5280 4.2.1.9 requires that conforming CAs "MUST mark the 214| | * extension [basicConstraints] as critical in such certificates" 215| | * but places no such requirement on validators. 216| | */ 217| 1.76k| if(ext->is_ca() == true) { ------------------ | Branch (217:10): [True: 679, False: 1.08k] ------------------ 218| | /* 219| | * RFC 5280 section 4.2.1.3 requires that CAs include KeyUsage in all 220| | * intermediate CA certificates they issue. Currently we accept it being 221| | * missing, as do most other implementations. But it may be worth 222| | * removing this entirely, or alternately adding a warning level 223| | * validation failure for it. 224| | */ 225| 679| const bool allowed_by_ku = 226| 679| data->m_key_constraints.includes(Key_Constraints::KeyCertSign) || data->m_key_constraints.empty(); ------------------ | Branch (226:13): [True: 356, False: 323] | Branch (226:79): [True: 316, False: 7] ------------------ 227| | 228| | /* 229| | * If the extended key usages are set then we must restrict the usage in 230| | * accordance with it as well. 231| | * 232| | * RFC 5280 does not define any extended key usages compatible with certificate 233| | * signing, but some CAs use serverAuth, clientAuth, OCSPSigning, or AnyExtendedKeyUsage 234| | * for this purpose, even though clearly all of these (besides AEKU) are invalid. 235| | * This check at least allows excluding a certificate which is set for only eg 236| | * timestamping or code signing, and that seems about the best we can possibly enforce. 237| | * OpenSSL, BoringSSL, and Go all completely ignore EKUs in determining ability to 238| | * issue certs. 239| | */ 240| 679| const bool allowed_by_ext_ku = [](const std::vector& ext_ku) -> bool { 241| 679| if(ext_ku.empty()) { 242| 679| return true; 243| 679| } 244| | 245| 679| const auto server_auth = OID::from_name("PKIX.ServerAuth"); 246| 679| const auto client_auth = OID::from_name("PKIX.ClientAuth"); 247| 679| const auto ocsp_sign = OID::from_name("PKIX.OCSPSigning"); 248| 679| const auto any_eku = OID::from_name("X509v3.AnyExtendedKeyUsage"); 249| | 250| 679| for(const auto& oid : ext_ku) { 251| 679| if(oid == any_eku || oid == server_auth || oid == client_auth || oid == ocsp_sign) { 252| 679| return true; 253| 679| } 254| 679| } 255| | 256| 679| return false; 257| 679| }(data->m_extended_key_usage); 258| | 259| 679| if(allowed_by_ku && allowed_by_ext_ku) { ------------------ | Branch (259:13): [True: 672, False: 7] | Branch (259:30): [True: 602, False: 70] ------------------ 260| 602| data->m_is_ca_certificate = true; 261| 602| data->m_path_len_constraint = ext->path_length_constraint(); 262| 602| } 263| 679| } 264| 1.76k| } 265| | 266| 11.1k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (266:19): [True: 19, False: 11.1k] ------------------ 267| 19| data->m_issuer_alt_name = ext->get_alt_name(); 268| 19| } 269| | 270| 11.1k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (270:19): [True: 98, False: 11.0k] ------------------ 271| 98| data->m_subject_alt_name = ext->get_alt_name(); 272| 98| } 273| | 274| | // This will be set even if SAN parsing failed entirely eg due to a decoding error 275| | // or if the SAN is empty. This is used to guard against using the CN for domain 276| | // name checking. 277| 11.1k| const auto san_oid = OID::from_string("X509v3.SubjectAlternativeName"); 278| 11.1k| data->m_subject_alt_name_exists = data->m_v3_extensions.extension_set(san_oid); 279| | 280| | /* 281| | * RFC 9608 Section 4: 282| | * 283| | * If the noRevAvail certificate extension specified in this document is 284| | * present or the ocsp-nocheck certificate extension [RFC6960] is 285| | * present, then Step (a)(3) is skipped. Otherwise, revocation status 286| | * determination of the certificate is performed. 287| | */ 288| 11.1k| data->m_skip_revocation_check = 289| 11.1k| data->m_v3_extensions.extension_set(Cert_Extension::NoRevocationAvailable::static_oid()) || ------------------ | Branch (289:7): [True: 1.68k, False: 9.50k] ------------------ 290| 9.50k| data->m_v3_extensions.extension_set(Cert_Extension::OCSP_NoCheck::static_oid()); ------------------ | Branch (290:7): [True: 6, False: 9.50k] ------------------ 291| | 292| 11.1k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (292:19): [True: 23, False: 11.1k] ------------------ 293| 23| data->m_cert_policies = ext->get_policy_oids(); 294| 23| } 295| | 296| 11.1k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (296:19): [True: 211, False: 10.9k] ------------------ 297| 211| data->m_ocsp_responders = ext->ocsp_responder_uris(); 298| 211| data->m_ca_issuers = ext->ca_issuer_uris(); 299| 211| } 300| | 301| 11.1k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (301:19): [True: 48, False: 11.1k] ------------------ 302| 48| data->m_crl_distribution_points = ext->crl_distribution_point_uris(); 303| 48| } 304| | 305| | /* 306| | Determine if this certificate appears to be self-issued (subject == issuer). 307| | This is only a heuristic used for path building so it's ok it is not precise. 308| | */ 309| 11.1k| if(data->m_subject_dn == data->m_issuer_dn) { ------------------ | Branch (309:7): [True: 4.29k, False: 6.89k] ------------------ 310| 4.29k| if(!data->m_subject_key_id.empty() && !data->m_authority_key_id.empty()) { ------------------ | Branch (310:10): [True: 1.03k, False: 3.26k] | Branch (310:45): [True: 602, False: 429] ------------------ 311| | /* 312| | Both SKID and AKID are set so we can reliably determine self-signed vs 313| | self-issued by comparing the two 314| | */ 315| 602| data->m_self_signed = (data->m_subject_key_id == data->m_authority_key_id); 316| 3.69k| } else { 317| | /* 318| | Without both SKID and AKID we can't determine with certainty. Assume 319| | self-signed since that's by far the common case. 320| | */ 321| 3.69k| data->m_self_signed = true; 322| 3.69k| } 323| 4.29k| } 324| | 325| 11.1k| const std::vector full_encoding = obj.BER_encode(); 326| | 327| 11.1k| if(auto sha1 = HashFunction::create("SHA-1")) { ------------------ | Branch (327:12): [True: 9.53k, False: 1.65k] ------------------ 328| 9.53k| sha1->update(data->m_subject_public_key_bitstring); 329| 9.53k| data->m_subject_public_key_bitstring_sha1 = sha1->final_stdvec(); 330| | // otherwise left as empty, and we will throw if subject_public_key_bitstring_sha1 is called 331| | 332| 9.53k| sha1->update(full_encoding); 333| 9.53k| sha1->final(data->m_cert_data_sha1); 334| 9.53k| data->m_fingerprint_sha1 = format_hex_fingerprint(data->m_cert_data_sha1); 335| | 336| 9.53k| sha1->update(data->m_issuer_dn_bits); 337| 9.53k| sha1->final(data->m_issuer_dn_bits_sha1); 338| | 339| 9.53k| sha1->update(data->m_subject_dn_bits); 340| 9.53k| sha1->final(data->m_subject_dn_bits_sha1); 341| 9.53k| } 342| | 343| | // SHA-256 is a hard dependency of this module 344| 11.1k| auto sha256 = HashFunction::create_or_throw("SHA-256"); 345| 11.1k| sha256->update(data->m_issuer_dn_bits); 346| 11.1k| data->m_issuer_dn_bits_sha256 = sha256->final_stdvec(); 347| | 348| 11.1k| sha256->update(data->m_subject_dn_bits); 349| 11.1k| data->m_subject_dn_bits_sha256 = sha256->final_stdvec(); 350| | 351| 11.1k| sha256->update(full_encoding); 352| 11.1k| sha256->final(data->m_cert_data_sha256); 353| 11.1k| data->m_fingerprint_sha256 = format_hex_fingerprint(data->m_cert_data_sha256); 354| | 355| 11.1k| sha256->update(data->m_subject_public_key_bitstring); 356| 11.1k| sha256->final(data->m_subject_public_key_bitstring_sha256); 357| | 358| 11.1k| return data; 359| 11.1k|} x509cert.cpp:_ZZN5Botan12_GLOBAL__N_120parse_x509_cert_bodyERKNS_11X509_ObjectEENK3$_0clERKNSt3__16vectorINS_3OIDENS5_9allocatorIS7_EEEE: 240| 679| const bool allowed_by_ext_ku = [](const std::vector& ext_ku) -> bool { 241| 679| if(ext_ku.empty()) { ------------------ | Branch (241:16): [True: 592, False: 87] ------------------ 242| 592| return true; 243| 592| } 244| | 245| 87| const auto server_auth = OID::from_name("PKIX.ServerAuth"); 246| 87| const auto client_auth = OID::from_name("PKIX.ClientAuth"); 247| 87| const auto ocsp_sign = OID::from_name("PKIX.OCSPSigning"); 248| 87| const auto any_eku = OID::from_name("X509v3.AnyExtendedKeyUsage"); 249| | 250| 120| for(const auto& oid : ext_ku) { ------------------ | Branch (250:33): [True: 120, False: 71] ------------------ 251| 120| if(oid == any_eku || oid == server_auth || oid == client_auth || oid == ocsp_sign) { ------------------ | Branch (251:19): [True: 0, False: 120] | Branch (251:37): [True: 8, False: 112] | Branch (251:59): [True: 5, False: 107] | Branch (251:81): [True: 3, False: 104] ------------------ 252| 16| return true; 253| 16| } 254| 120| } 255| | 256| 71| return false; 257| 87| }(data->m_extended_key_usage); _ZN5Botan4PKIX11check_chainERKNSt3__16vectorINS_16X509_CertificateENS1_9allocatorIS3_EEEENS1_6chrono10time_pointINS9_12system_clockENS9_8durationIxNS1_5ratioILl1ELl1000000EEEEEEENS1_17basic_string_viewIcNS1_11char_traitsIcEEEENS_10Usage_TypeERKNS_28Path_Validation_RestrictionsE: 348| 3.59k| const Path_Validation_Restrictions& restrictions) { 349| 3.59k| if(cert_path.empty()) { ------------------ | Branch (349:7): [True: 0, False: 3.59k] ------------------ 350| 0| throw Invalid_Argument("PKIX::check_chain cert_path empty"); 351| 0| } 352| | 353| 3.59k| const bool is_end_entity_trust_anchor = (cert_path.size() == 1); 354| | 355| 3.59k| const X509_Time validation_time(ref_time); 356| | 357| 3.59k| CertificatePathStatusCodes cert_status(cert_path.size()); 358| | 359| | // Before anything else verify the entire chain of signatures 360| | // starting from the certificate issued by the trust anchor and 361| | // working towards the leaf. This precludes denial of service 362| | // attacks based on long certificate chains which are valid except 363| | // for the final forged (invalid) signature purportedly by the 364| | // trust root. 365| | // 366| | // The trust anchor's own signature is not checked. RFC 5280 6.1.1: 367| | // "The trust anchor information is trusted because it was 368| | // delivered to the path processing procedure by some trustworthy 369| | // out-of-band procedure." 370| 3.61k| for(size_t i = cert_path.size() - 1; i-- > 0;) { ------------------ | Branch (370:41): [True: 3.58k, False: 32] ------------------ 371| 3.58k| std::set& status = cert_status.at(i); 372| | 373| 3.58k| const X509_Certificate& subject = cert_path[i]; 374| 3.58k| const X509_Certificate& issuer = cert_path[i + 1]; 375| | 376| | // Check the signature algorithm is known 377| 3.58k| if(!subject.signature_algorithm().oid().registered_oid()) { ------------------ | Branch (377:10): [True: 28, False: 3.55k] ------------------ 378| 28| status.insert(Certificate_Status_Code::SIGNATURE_ALGO_UNKNOWN); 379| 3.55k| } else { 380| 3.55k| std::unique_ptr issuer_key; 381| 3.55k| try { 382| 3.55k| issuer_key = issuer.subject_public_key(); 383| 3.55k| } catch(...) { 384| 2.10k| status.insert(Certificate_Status_Code::CERT_PUBKEY_INVALID); 385| 2.10k| } 386| | 387| 3.55k| if(issuer_key) { ------------------ | Branch (387:13): [True: 1.44k, False: 2.10k] ------------------ 388| 1.44k| if(issuer_key->estimated_strength() < restrictions.minimum_key_strength()) { ------------------ | Branch (388:16): [True: 223, False: 1.22k] ------------------ 389| 223| status.insert(Certificate_Status_Code::SIGNATURE_METHOD_TOO_WEAK); 390| 223| } 391| | 392| 1.44k| const auto sig_status = subject.verify_signature(*issuer_key); 393| | 394| 1.44k| if(sig_status.first != Certificate_Status_Code::VERIFIED) { ------------------ | Branch (394:16): [True: 1.42k, False: 19] ------------------ 395| 1.42k| status.insert(sig_status.first); 396| 1.42k| } else { 397| | // Signature is valid, check if hash used was acceptable 398| 19| const std::string hash_used_for_signature = sig_status.second; 399| 19| BOTAN_ASSERT_NOMSG(!hash_used_for_signature.empty()); ------------------ | | 84| 19| do { \ | | 85| 19| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 19| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 19] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 19| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 19] | | ------------------ ------------------ 400| 19| const auto& trusted_hashes = restrictions.trusted_hashes(); 401| | 402| 19| if(!trusted_hashes.empty() && !trusted_hashes.contains(hash_used_for_signature)) { ------------------ | Branch (402:19): [True: 19, False: 0] | Branch (402:46): [True: 0, False: 19] ------------------ 403| 0| status.insert(Certificate_Status_Code::UNTRUSTED_HASH); 404| 0| } 405| 19| } 406| 1.44k| } 407| 3.55k| } 408| | 409| | // If any of the signatures were invalid, return immediately; we know the 410| | // chain is invalid and signature failure is always considered the most 411| | // critical result. This does mean other problems in the certificate (eg 412| | // expired) will not be reported, but we'd have to assume any such data is 413| | // anyway arbitrary considering we couldn't verify the signature chain 414| 3.78k| for(const auto s : status) { ------------------ | Branch (414:24): [True: 3.78k, False: 19] ------------------ 415| | // This ignores errors relating to the key or hash being weak since 416| | // these are somewhat advisory 417| 3.78k| if(static_cast(s) >= 5000) { ------------------ | Branch (417:13): [True: 3.56k, False: 223] ------------------ 418| 3.56k| return cert_status; 419| 3.56k| } 420| 3.78k| } 421| 3.58k| } 422| | 423| 32| if(!hostname.empty() && !cert_path[0].matches_dns_name(hostname)) { ------------------ | Branch (423:7): [True: 0, False: 32] | Branch (423:28): [True: 0, False: 0] ------------------ 424| 0| cert_status[0].insert(Certificate_Status_Code::CERT_NAME_NOMATCH); 425| 0| } 426| | 427| 32| if(!cert_path[0].allowed_usage(usage)) { ------------------ | Branch (427:7): [True: 0, False: 32] ------------------ 428| 0| if(usage == Usage_Type::OCSP_RESPONDER) { ------------------ | Branch (428:10): [True: 0, False: 0] ------------------ 429| 0| cert_status[0].insert(Certificate_Status_Code::OCSP_RESPONSE_MISSING_KEYUSAGE); 430| 0| } 431| 0| cert_status[0].insert(Certificate_Status_Code::INVALID_USAGE); 432| 0| } 433| | 434| 32| if(cert_path[0].has_constraints(Key_Constraints::KeyCertSign) && cert_path[0].is_CA_cert() == false) { ------------------ | Branch (434:7): [True: 2, False: 30] | Branch (434:69): [True: 2, False: 0] ------------------ 435| | /* 436| | "If the keyCertSign bit is asserted, then the cA bit in the 437| | basic constraints extension (Section 4.2.1.9) MUST also be 438| | asserted." - RFC 5280 439| | 440| | We don't bother doing this check on the rest of the path since they 441| | must have the cA bit asserted or the validation will fail anyway. 442| | */ 443| 2| cert_status[0].insert(Certificate_Status_Code::INVALID_USAGE); 444| 2| } 445| | 446| 83| for(size_t i = 0; i != cert_path.size(); ++i) { ------------------ | Branch (446:22): [True: 51, False: 32] ------------------ 447| 51| std::set& status = cert_status.at(i); 448| | 449| 51| const bool at_trust_anchor = (i == cert_path.size() - 1); 450| | 451| 51| const X509_Certificate& subject = cert_path[i]; 452| 51| const auto issuer = [&]() -> std::optional { 453| 51| if(!at_trust_anchor) { 454| 51| return cert_path[i + 1]; 455| 51| } else if(subject.is_self_signed()) { 456| 51| return cert_path[i]; 457| 51| } else { 458| 51| return {}; // Non self-signed trust anchors have no checkable issuers. 459| 51| } 460| 51| }(); 461| | 462| 51| if(restrictions.require_self_signed_trust_anchors() && !issuer.has_value()) { ------------------ | Branch (462:10): [True: 51, False: 0] | Branch (462:62): [True: 0, False: 51] ------------------ 463| 0| status.insert(Certificate_Status_Code::CHAIN_LACKS_TRUST_ROOT); 464| 0| } 465| | 466| | // This should never happen; it indicates a bug in path building 467| 51| if(issuer.has_value() && subject.issuer_dn() != issuer->subject_dn()) { ------------------ | Branch (467:10): [True: 51, False: 0] | Branch (467:32): [True: 0, False: 51] ------------------ 468| 0| status.insert(Certificate_Status_Code::CHAIN_NAME_MISMATCH); 469| 0| } 470| | 471| | // Check the serial number 472| 51| if(subject.serial().is_negative()) { ------------------ | Branch (472:10): [True: 14, False: 37] ------------------ 473| 14| status.insert(Certificate_Status_Code::CERT_SERIAL_NEGATIVE); 474| 14| } 475| | 476| | // Check the subject's DN components' length 477| | 478| 63| for(const auto& rdn : subject.subject_dn().rdns()) { ------------------ | Branch (478:27): [True: 63, False: 51] ------------------ 479| 63| for(const auto& ava : rdn) { ------------------ | Branch (479:30): [True: 63, False: 63] ------------------ 480| 63| const size_t dn_ub = X509_DN::lookup_ub(ava.first); 481| 63| if(dn_ub > 0 && ava.second.size() > dn_ub) { ------------------ | Branch (481:16): [True: 62, False: 1] | Branch (481:29): [True: 0, False: 62] ------------------ 482| 0| status.insert(Certificate_Status_Code::DN_TOO_LONG); 483| 0| } 484| 63| } 485| 63| } 486| | 487| | // If so configured, allow trust anchors outside the validity period with 488| | // a warning rather than a hard error 489| 51| const bool enforce_validity_period = !at_trust_anchor || !restrictions.ignore_trusted_root_time_range(); ------------------ | Branch (489:44): [True: 19, False: 32] | Branch (489:64): [True: 32, False: 0] ------------------ 490| | // Check all certs for valid time range 491| 51| if(validation_time < subject.not_before()) { ------------------ | Branch (491:10): [True: 5, False: 46] ------------------ 492| 5| if(enforce_validity_period) { ------------------ | Branch (492:13): [True: 5, False: 0] ------------------ 493| 5| status.insert(Certificate_Status_Code::CERT_NOT_YET_VALID); 494| 5| } else { 495| 0| status.insert(Certificate_Status_Code::TRUSTED_CERT_NOT_YET_VALID); // only warn 496| 0| } 497| 5| } 498| | 499| 51| if(validation_time > subject.not_after()) { ------------------ | Branch (499:10): [True: 34, False: 17] ------------------ 500| 34| if(enforce_validity_period) { ------------------ | Branch (500:13): [True: 34, False: 0] ------------------ 501| 34| status.insert(Certificate_Status_Code::CERT_HAS_EXPIRED); 502| 34| } else { 503| 0| status.insert(Certificate_Status_Code::TRUSTED_CERT_HAS_EXPIRED); // only warn 504| 0| } 505| 34| } 506| | 507| | // Check issuer constraints 508| 51| if(issuer.has_value() && !issuer->is_CA_cert() && !is_end_entity_trust_anchor) { ------------------ | Branch (508:10): [True: 51, False: 0] | Branch (508:32): [True: 16, False: 35] | Branch (508:57): [True: 8, False: 8] ------------------ 509| 8| status.insert(Certificate_Status_Code::CA_CERT_NOT_FOR_CERT_ISSUER); 510| 8| } 511| | 512| | // Check cert extensions 513| | 514| 51| if(subject.x509_version() == 1) { ------------------ | Branch (514:10): [True: 5, False: 46] ------------------ 515| 5| if(subject.v2_issuer_key_id().empty() == false || subject.v2_subject_key_id().empty() == false) { ------------------ | Branch (515:13): [True: 0, False: 5] | Branch (515:60): [True: 1, False: 4] ------------------ 516| 1| status.insert(Certificate_Status_Code::V2_IDENTIFIERS_IN_V1_CERT); 517| 1| } 518| 5| } 519| | 520| 51| const Extensions& extensions = subject.v3_extensions(); 521| 51| if(subject.x509_version() < 3 && !extensions.get_extension_oids().empty()) { ------------------ | Branch (521:10): [True: 17, False: 34] | Branch (521:40): [True: 12, False: 5] ------------------ 522| 12| status.insert(Certificate_Status_Code::EXT_IN_V1_V2_CERT); 523| 12| } 524| | 525| 51| extensions.validate(subject, issuer, cert_path, cert_status, i); 526| 51| } 527| | 528| | // path len check 529| 32| size_t max_path_length = cert_path.size(); 530| 51| for(size_t i = cert_path.size() - 1; i > 0; --i) { ------------------ | Branch (530:41): [True: 19, False: 32] ------------------ 531| 19| std::set& status = cert_status.at(i); 532| 19| const X509_Certificate& subject = cert_path[i]; 533| | 534| | /* 535| | * If the certificate was not self-issued, verify that max_path_length is 536| | * greater than zero and decrement max_path_length by 1. 537| | */ 538| 19| if(subject.subject_dn() != subject.issuer_dn()) { ------------------ | Branch (538:10): [True: 0, False: 19] ------------------ 539| 0| if(max_path_length > 0) { ------------------ | Branch (539:13): [True: 0, False: 0] ------------------ 540| 0| max_path_length -= 1; 541| 0| } else { 542| 0| status.insert(Certificate_Status_Code::CERT_CHAIN_TOO_LONG); 543| 0| } 544| 0| } 545| | 546| | /* 547| | * If pathLenConstraint is present in the certificate and is less than max_path_length, 548| | * set max_path_length to the value of pathLenConstraint. 549| | */ 550| 19| if(auto path_len_constraint = subject.path_length_constraint()) { ------------------ | Branch (550:15): [True: 0, False: 19] ------------------ 551| 0| max_path_length = std::min(max_path_length, *path_len_constraint); 552| 0| } 553| 19| } 554| | 555| 32| return cert_status; 556| 3.59k|} _ZN5Botan4PKIX9check_crlERKNSt3__16vectorINS_16X509_CertificateENS1_9allocatorIS3_EEEERKNS2_INS1_8optionalINS_8X509_CRLEEENS4_ISB_EEEENS1_6chrono10time_pointINSG_12system_clockENSG_8durationIxNS1_5ratioILl1ELl1000000EEEEEEERKNS_28Path_Validation_RestrictionsE: 747| 6| const Path_Validation_Restrictions& restrictions) { 748| 6| if(cert_path.empty()) { ------------------ | Branch (748:7): [True: 0, False: 6] ------------------ 749| 0| throw Invalid_Argument("PKIX::check_crl cert_path empty"); 750| 0| } 751| | 752| 6| CertificatePathStatusCodes cert_status(cert_path.size()); 753| 6| const X509_Time validation_time(ref_time); 754| | 755| 7| for(size_t i = 0; i != cert_path.size() - 1; ++i) { ------------------ | Branch (755:22): [True: 1, False: 6] ------------------ 756| 1| std::set& status = cert_status.at(i); 757| | 758| 1| if(cert_path.at(i).skip_revocation_check()) { ------------------ | Branch (758:10): [True: 0, False: 1] ------------------ 759| 0| continue; 760| 0| } 761| | 762| 1| if(i < crls.size() && crls[i].has_value()) { ------------------ | Branch (762:10): [True: 1, False: 0] | Branch (762:29): [True: 0, False: 1] ------------------ 763| 0| const X509_Certificate& subject = cert_path.at(i); 764| 0| const X509_Certificate& ca = cert_path.at(i + 1); 765| | 766| | // RFC 5280 6.3.3 step (b)(2): if the CRL's IDP scope or 767| | // distributionPoint name excludes this certificate, do not use it 768| | // to determine revocation status. Treat as if no CRL was supplied 769| | // so the caller's policy (strict revocation or soft fail) decides 770| | // the outcome. 771| 0| const auto applic = crl_applicability_for(*crls[i], subject); 772| 0| if(!applic.usable) { ------------------ | Branch (772:13): [True: 0, False: 0] ------------------ 773| 0| continue; 774| 0| } 775| | 776| 0| if(!ca.allowed_usage(Key_Constraints::CrlSign)) { ------------------ | Branch (776:13): [True: 0, False: 0] ------------------ 777| 0| status.insert(Certificate_Status_Code::CA_CERT_NOT_FOR_CRL_ISSUER); 778| 0| } 779| | 780| 0| if(validation_time < crls[i]->this_update()) { ------------------ | Branch (780:13): [True: 0, False: 0] ------------------ 781| 0| status.insert(Certificate_Status_Code::CRL_NOT_YET_VALID); 782| 0| } 783| | 784| 0| if(crls[i]->next_update().time_is_set() && validation_time > crls[i]->next_update()) { ------------------ | Branch (784:13): [True: 0, False: 0] | Branch (784:53): [True: 0, False: 0] ------------------ 785| 0| status.insert(Certificate_Status_Code::CRL_HAS_EXPIRED); 786| 0| } 787| | 788| 0| const auto ca_key = ca.subject_public_key(); 789| 0| const auto sig_status = crls[i]->verify_signature(*ca_key); 790| 0| const auto& trusted_hashes = restrictions.trusted_hashes(); 791| | 792| 0| if(sig_status.first != Certificate_Status_Code::VERIFIED) { ------------------ | Branch (792:13): [True: 0, False: 0] ------------------ 793| 0| status.insert(Certificate_Status_Code::CRL_BAD_SIGNATURE); 794| 0| } else if(!trusted_hashes.empty() && !trusted_hashes.contains(sig_status.second)) { ------------------ | Branch (794:20): [True: 0, False: 0] | Branch (794:47): [True: 0, False: 0] ------------------ 795| 0| status.insert(Certificate_Status_Code::UNTRUSTED_HASH); 796| 0| } else { 797| | /* 798| | RFC 5280 5.2 "If a CRL contains a critical extension that the 799| | application cannot process, then the application MUST NOT use that 800| | CRL to determine the status of certificates." 801| | 802| | RFC 5280 5.3 "If a CRL contains a critical CRL entry extension that 803| | the application cannot process, then the application MUST NOT use 804| | that CRL to determine the status of any certificates." 805| | */ 806| 0| const bool crl_is_not_usable = crls[i]->has_unknown_critical_extension(); 807| | 808| 0| if(crl_is_not_usable) { ------------------ | Branch (808:16): [True: 0, False: 0] ------------------ 809| 0| status.insert(Certificate_Status_Code::CRL_HAS_UNKNOWN_CRITICAL_EXTENSION); 810| 0| } else if(crls[i]->is_revoked(subject)) { ------------------ | Branch (810:23): [True: 0, False: 0] ------------------ 811| | // A reason-limited CRL that lists the cert still proves the 812| | // cert is revoked (the cert was revoked for whichever reason 813| | // the CRL covers). Surface CERT_IS_REVOKED regardless of 814| | // full-coverage status. 815| 0| status.insert(Certificate_Status_Code::CERT_IS_REVOKED); 816| 0| } else if(applic.full_coverage) { ------------------ | Branch (816:23): [True: 0, False: 0] ------------------ 817| | // Cert not listed AND the CRL covers every reason: positive 818| | // non-revocation evidence. 819| 0| status.insert(Certificate_Status_Code::VALID_CRL_CHECKED); 820| 0| } 821| | // else: cert not listed but CRL only covers some reasons. No 822| | // positive evidence is recorded; the caller's policy (strict 823| | // revocation -> NO_REVOCATION_DATA, soft fail -> validates) 824| | // decides what happens next. 825| 0| } 826| 0| } 827| 1| } 828| | 829| 13| while(!cert_status.empty() && cert_status.back().empty()) { ------------------ | Branch (829:10): [True: 7, False: 6] | Branch (829:34): [True: 7, False: 0] ------------------ 830| 7| cert_status.pop_back(); 831| 7| } 832| | 833| 6| return cert_status; 834| 6|} _ZN5Botan4PKIX9check_crlERKNSt3__16vectorINS_16X509_CertificateENS1_9allocatorIS3_EEEERKNS2_IPNS_17Certificate_StoreENS4_ISA_EEEENS1_6chrono10time_pointINSF_12system_clockENSF_8durationIxNS1_5ratioILl1ELl1000000EEEEEEERKNS_28Path_Validation_RestrictionsE: 845| 6| const Path_Validation_Restrictions& restrictions) { 846| 6| if(cert_path.empty()) { ------------------ | Branch (846:7): [True: 0, False: 6] ------------------ 847| 0| throw Invalid_Argument("PKIX::check_crl cert_path empty"); 848| 0| } 849| | 850| 6| if(certstores.empty()) { ------------------ | Branch (850:7): [True: 0, False: 6] ------------------ 851| 0| throw Invalid_Argument("PKIX::check_crl certstores empty"); 852| 0| } 853| | 854| 6| std::vector> crls(cert_path.size()); 855| | 856| 13| for(size_t i = 0; i != cert_path.size(); ++i) { ------------------ | Branch (856:22): [True: 7, False: 6] ------------------ 857| 7| if(cert_path[i].skip_revocation_check()) { ------------------ | Branch (857:10): [True: 0, False: 7] ------------------ 858| 0| continue; 859| 0| } 860| 7| for(const auto* certstore : certstores) { ------------------ | Branch (860:33): [True: 7, False: 7] ------------------ 861| 7| crls[i] = certstore->find_crl_for(cert_path[i]); 862| 7| if(crls[i]) { ------------------ | Branch (862:13): [True: 0, False: 7] ------------------ 863| 0| break; 864| 0| } 865| 7| } 866| 7| } 867| | 868| 6| return PKIX::check_crl(cert_path, crls, ref_time, restrictions); 869| 6|} _ZN5Botan4PKIX23merge_revocation_statusERNSt3__16vectorINS1_3setINS_23Certificate_Status_CodeENS1_4lessIS4_EENS1_9allocatorIS4_EEEENS7_IS9_EEEERKSB_SE_RKNS_28Path_Validation_RestrictionsE: 1127| 6| const Path_Validation_Restrictions& restrictions) { 1128| 6| if(chain_status.empty()) { ------------------ | Branch (1128:7): [True: 0, False: 6] ------------------ 1129| 0| throw Invalid_Argument("PKIX::merge_revocation_status chain_status was empty"); 1130| 0| } 1131| | 1132| 7| for(size_t i = 0; i != chain_status.size() - 1; ++i) { ------------------ | Branch (1132:22): [True: 1, False: 6] ------------------ 1133| 1| bool had_crl = false; 1134| 1| bool had_ocsp = false; 1135| | 1136| | // RFC 5280 6.3.3 treats revocation status as determined once cert_status 1137| | // is not UNREVOKED, so CERT_IS_REVOKED (whether from CRL or OCSP) is 1138| | // revocation evidence on a par with VALID_CRL_CHECKED / OCSP_RESPONSE_GOOD; 1139| | // omitting it would surface a spurious NO_REVOCATION_DATA alongside the 1140| | // revocation, e.g. when a reason-limited CRL lists the cert. 1141| 1| if(i < crl_status.size() && !crl_status[i].empty()) { ------------------ | Branch (1141:10): [True: 0, False: 1] | Branch (1141:35): [True: 0, False: 0] ------------------ 1142| 0| for(auto&& code : crl_status[i]) { ------------------ | Branch (1142:26): [True: 0, False: 0] ------------------ 1143| 0| if(code == Certificate_Status_Code::VALID_CRL_CHECKED || code == Certificate_Status_Code::CERT_IS_REVOKED) { ------------------ | Branch (1143:16): [True: 0, False: 0] | Branch (1143:70): [True: 0, False: 0] ------------------ 1144| 0| had_crl = true; 1145| 0| } 1146| 0| chain_status[i].insert(code); 1147| 0| } 1148| 0| } 1149| | 1150| 1| if(i < ocsp_status.size() && !ocsp_status[i].empty()) { ------------------ | Branch (1150:10): [True: 0, False: 1] | Branch (1150:36): [True: 0, False: 0] ------------------ 1151| 0| for(auto&& code : ocsp_status[i]) { ------------------ | Branch (1151:26): [True: 0, False: 0] ------------------ 1152| 0| const bool was_definitive = 1153| 0| code == Certificate_Status_Code::OCSP_RESPONSE_GOOD || code == Certificate_Status_Code::CERT_IS_REVOKED; ------------------ | Branch (1153:16): [True: 0, False: 0] | Branch (1153:71): [True: 0, False: 0] ------------------ 1154| | 1155| 0| const bool was_softfail = code == Certificate_Status_Code::OCSP_NO_REVOCATION_URL || ------------------ | Branch (1155:39): [True: 0, False: 0] ------------------ 1156| 0| code == Certificate_Status_Code::OCSP_SERVER_NOT_AVAILABLE || ------------------ | Branch (1156:39): [True: 0, False: 0] ------------------ 1157| 0| code == Certificate_Status_Code::OCSP_NO_HTTP; ------------------ | Branch (1157:39): [True: 0, False: 0] ------------------ 1158| | 1159| 0| const bool accepted_softfail = was_softfail && restrictions.accept_ocsp_softfail(); ------------------ | Branch (1159:44): [True: 0, False: 0] | Branch (1159:60): [True: 0, False: 0] ------------------ 1160| | 1161| 0| if(was_definitive || accepted_softfail) { ------------------ | Branch (1161:16): [True: 0, False: 0] | Branch (1161:34): [True: 0, False: 0] ------------------ 1162| 0| had_ocsp = true; 1163| 0| } 1164| | 1165| 0| chain_status[i].insert(code); 1166| 0| } 1167| 0| } 1168| | 1169| 1| if(had_crl == false && had_ocsp == false) { ------------------ | Branch (1169:10): [True: 1, False: 0] | Branch (1169:30): [True: 1, False: 0] ------------------ 1170| 1| if((restrictions.require_revocation_information() && i == 0) || ------------------ | Branch (1170:14): [True: 0, False: 1] | Branch (1170:63): [True: 0, False: 0] ------------------ 1171| 1| (restrictions.ocsp_all_intermediates() && i > 0)) { ------------------ | Branch (1171:14): [True: 0, False: 1] | Branch (1171:55): [True: 0, False: 0] ------------------ 1172| 0| chain_status[i].insert(Certificate_Status_Code::NO_REVOCATION_DATA); 1173| 0| } 1174| 1| } 1175| 1| } 1176| 6|} _ZN5Botan4PKIX14overall_statusERKNSt3__16vectorINS1_3setINS_23Certificate_Status_CodeENS1_4lessIS4_EENS1_9allocatorIS4_EEEENS7_IS9_EEEE: 1178| 7.19k|Certificate_Status_Code PKIX::overall_status(const CertificatePathStatusCodes& cert_status) { 1179| 7.19k| if(cert_status.empty()) { ------------------ | Branch (1179:7): [True: 0, False: 7.19k] ------------------ 1180| 0| throw Invalid_Argument("PKIX::overall_status empty cert status"); 1181| 0| } 1182| | 1183| 7.19k| Certificate_Status_Code overall_status = Certificate_Status_Code::OK; 1184| | 1185| | // take the "worst" error as overall 1186| 14.3k| for(const std::set& s : cert_status) { ------------------ | Branch (1186:51): [True: 14.3k, False: 7.19k] ------------------ 1187| 14.3k| if(!s.empty()) { ------------------ | Branch (1187:10): [True: 7.22k, False: 7.13k] ------------------ 1188| 7.22k| const auto worst = *s.rbegin(); 1189| | // Leave informative OCSP/CRL confirmations on cert-level status only 1190| 7.22k| if(worst >= Certificate_Status_Code::FIRST_ERROR_STATUS && worst > overall_status) { ------------------ | Branch (1190:13): [True: 7.21k, False: 4] | Branch (1190:69): [True: 7.21k, False: 2] ------------------ 1191| 7.21k| overall_status = worst; 1192| 7.21k| } 1193| 7.22k| } 1194| 14.3k| } 1195| 7.19k| return overall_status; 1196| 7.19k|} _ZN5Botan18x509_path_validateERKNSt3__16vectorINS_16X509_CertificateENS0_9allocatorIS2_EEEERKNS_28Path_Validation_RestrictionsERKNS1_IPNS_17Certificate_StoreENS3_ISC_EEEENS0_17basic_string_viewIcNS0_11char_traitsIcEEEENS_10Usage_TypeENS0_6chrono10time_pointINSM_12system_clockENSM_8durationIxNS0_5ratioILl1ELl1000000EEEEEEENSP_IxNSQ_ILl1ELl1000EEEEERKNS1_INS0_8optionalINS_4OCSP8ResponseEEENS3_ISZ_EEEE: 1205| 3.91k| const std::vector>& ocsp_resp) { 1206| 3.91k| if(end_certs.empty()) { ------------------ | Branch (1206:7): [True: 0, False: 3.91k] ------------------ 1207| 0| throw Invalid_Argument("x509_path_validate called with no subjects"); 1208| 0| } 1209| | 1210| 3.91k| const X509_Certificate& end_entity = end_certs[0]; 1211| 3.91k| const auto end_entity_extra = std::span(end_certs).subspan(1); 1212| | 1213| 3.91k| const bool require_self_signed = restrictions.require_self_signed_trust_anchors(); 1214| | 1215| 3.91k| CertificatePathBuilder builder( 1216| 3.91k| trusted_roots, end_entity, end_entity_extra, PathBuildingDfsBudget, require_self_signed); 1217| | 1218| 3.91k| std::optional first_path_error; 1219| 3.91k| size_t paths_checked = 0; 1220| 3.91k| size_t certs_checked = 0; 1221| | 1222| 7.50k| while(auto cert_path = builder.next()) { ------------------ | Branch (1222:15): [True: 3.59k, False: 3.91k] ------------------ 1223| 3.59k| BOTAN_ASSERT_NOMSG(cert_path->empty() == false); ------------------ | | 84| 3.59k| do { \ | | 85| 3.59k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 3.59k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 3.59k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 3.59k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 3.59k] | | ------------------ ------------------ 1224| | 1225| 3.59k| if(cert_path->size() > PathBuildingMaximumChainLength) { ------------------ | Branch (1225:10): [True: 0, False: 3.59k] ------------------ 1226| 0| continue; 1227| 0| } 1228| | 1229| 3.59k| paths_checked += 1; 1230| 3.59k| certs_checked += cert_path->size(); 1231| 3.59k| if(paths_checked > PathBuildingMaxPathsExamined || certs_checked > PathBuildingVerificationBudget) { ------------------ | Branch (1231:10): [True: 0, False: 3.59k] | Branch (1231:58): [True: 0, False: 3.59k] ------------------ 1232| 0| first_path_error = Path_Validation_Result(Certificate_Status_Code::EXCEEDED_SEARCH_LIMITS); 1233| 0| break; 1234| 0| } 1235| | 1236| 3.59k| CertificatePathStatusCodes status = PKIX::check_chain(*cert_path, ref_time, hostname, usage, restrictions); 1237| | 1238| | // Skip revocation checks if the chain already has fatal errors. 1239| 3.59k| if(PKIX::overall_status(status) < Certificate_Status_Code::FIRST_ERROR_STATUS_TO_SKIP_REVOCATION) { ------------------ | Branch (1239:10): [True: 6, False: 3.58k] ------------------ 1240| 6| const CertificatePathStatusCodes crl_status = 1241| 6| PKIX::check_crl(*cert_path, trusted_roots, ref_time, restrictions); 1242| | 1243| 6| CertificatePathStatusCodes ocsp_status; 1244| | 1245| 6| if(!ocsp_resp.empty()) { ------------------ | Branch (1245:13): [True: 0, False: 6] ------------------ 1246| 0| ocsp_status = PKIX::check_ocsp(*cert_path, ocsp_resp, trusted_roots, ref_time, restrictions); 1247| 0| } 1248| | 1249| 6| if(ocsp_timeout != std::chrono::milliseconds(0)) { ------------------ | Branch (1249:13): [True: 0, False: 6] ------------------ 1250| 0| const size_t to_online = restrictions.ocsp_all_intermediates() ? (cert_path->size() - 1) : 1; ------------------ | Branch (1250:38): [True: 0, False: 0] ------------------ 1251| 0| bool need_online = false; 1252| 0| for(size_t i = 0; i < to_online; ++i) { ------------------ | Branch (1252:31): [True: 0, False: 0] ------------------ 1253| 0| if((*cert_path)[i].skip_revocation_check()) { ------------------ | Branch (1253:19): [True: 0, False: 0] ------------------ 1254| 0| continue; 1255| 0| } 1256| 0| if(i >= ocsp_status.size() || ocsp_status[i].empty()) { ------------------ | Branch (1256:19): [True: 0, False: 0] | Branch (1256:46): [True: 0, False: 0] ------------------ 1257| 0| need_online = true; 1258| 0| break; 1259| 0| } 1260| 0| } 1261| | 1262| 0| if(need_online) { ------------------ | Branch (1262:16): [True: 0, False: 0] ------------------ 1263| 0|#if defined(BOTAN_TARGET_OS_HAS_THREADS) && defined(BOTAN_HAS_HTTP_UTIL) 1264| 0| auto online_status = 1265| 0| PKIX::check_ocsp_online(*cert_path, trusted_roots, ref_time, ocsp_timeout, restrictions); 1266| 0| if(ocsp_status.size() < online_status.size()) { ------------------ | Branch (1266:19): [True: 0, False: 0] ------------------ 1267| 0| ocsp_status.resize(online_status.size()); 1268| 0| } 1269| 0| for(size_t i = 0; i < online_status.size(); ++i) { ------------------ | Branch (1269:34): [True: 0, False: 0] ------------------ 1270| 0| if(ocsp_status[i].empty()) { ------------------ | Branch (1270:22): [True: 0, False: 0] ------------------ 1271| 0| ocsp_status[i] = std::move(online_status[i]); 1272| 0| } 1273| 0| } 1274| |#else 1275| | if(ocsp_status.size() < to_online) { 1276| | ocsp_status.resize(to_online); 1277| | } 1278| | for(size_t i = 0; i < to_online; ++i) { 1279| | if(ocsp_status[i].empty()) { 1280| | ocsp_status[i].insert(Certificate_Status_Code::OCSP_NO_HTTP); 1281| | } 1282| | } 1283| |#endif 1284| 0| } 1285| 0| } 1286| | 1287| 6| PKIX::merge_revocation_status(status, crl_status, ocsp_status, restrictions); 1288| | 1289| | // merge_revocation_status flags NO_REVOCATION_DATA when require_revocation 1290| | // is set; clear it for certs where RFC 9608 Section 4 says to skip the check. 1291| 7| for(size_t i = 0; i + 1 < cert_path->size() && i < status.size(); ++i) { ------------------ | Branch (1291:28): [True: 1, False: 6] | Branch (1291:57): [True: 1, False: 0] ------------------ 1292| 1| if((*cert_path)[i].skip_revocation_check()) { ------------------ | Branch (1292:16): [True: 0, False: 1] ------------------ 1293| 0| status[i].erase(Certificate_Status_Code::NO_REVOCATION_DATA); 1294| 0| } 1295| 1| } 1296| 6| } 1297| | 1298| 3.59k| Path_Validation_Result pvd(status, std::move(*cert_path)); 1299| 3.59k| if(pvd.successful_validation()) { ------------------ | Branch (1299:10): [True: 4, False: 3.59k] ------------------ 1300| 4| return pvd; 1301| 3.59k| } else if(!first_path_error.has_value()) { ------------------ | Branch (1301:17): [True: 3.59k, False: 0] ------------------ 1302| | // Save the errors from the first path we attempted 1303| 3.59k| first_path_error = std::move(pvd); 1304| 3.59k| } 1305| 3.59k| } 1306| | 1307| 3.91k| if(first_path_error.has_value()) { ------------------ | Branch (1307:7): [True: 3.59k, False: 323] ------------------ 1308| | // We found at least one path, but none of them verified 1309| | // Return arbitrarily the error from the first path attempted 1310| 3.59k| return first_path_error.value(); 1311| 3.59k| } else { 1312| | // Failed to build any path at all 1313| 323| return Path_Validation_Result(builder.error()); 1314| 323| } 1315| 3.91k|} _ZN5Botan18x509_path_validateERKNS_16X509_CertificateERKNS_28Path_Validation_RestrictionsERKNSt3__16vectorIPNS_17Certificate_StoreENS6_9allocatorIS9_EEEENS6_17basic_string_viewIcNS6_11char_traitsIcEEEENS_10Usage_TypeENS6_6chrono10time_pointINSK_12system_clockENSK_8durationIxNS6_5ratioILl1ELl1000000EEEEEEENSN_IxNSO_ILl1ELl1000EEEEERKNS7_INS6_8optionalINS_4OCSP8ResponseEEENSA_ISX_EEEE: 1324| 3.91k| const std::vector>& ocsp_resp) { 1325| 3.91k| std::vector certs; 1326| 3.91k| certs.push_back(end_cert); 1327| 3.91k| return x509_path_validate(certs, restrictions, trusted_roots, hostname, usage, when, ocsp_timeout, ocsp_resp); 1328| 3.91k|} _ZN5Botan28Path_Validation_RestrictionsC2EbmbNSt3__16chrono8durationIxNS1_5ratioILl1ELl1EEEEENS1_10unique_ptrINS_17Certificate_StoreENS1_14default_deleteIS8_EEEEbbb: 1369| 3.91k| m_require_revocation_information(require_rev), 1370| 3.91k| m_ocsp_all_intermediates(ocsp_intermediates), 1371| 3.91k| m_minimum_key_strength(key_strength), 1372| 3.91k| m_max_ocsp_age(max_ocsp_age), 1373| 3.91k| m_trusted_ocsp_responders(std::move(trusted_ocsp_responders)), 1374| 3.91k| m_ignore_trusted_root_time_range(ignore_trusted_root_time_range), 1375| 3.91k| m_require_self_signed_trust_anchors(require_self_signed_trust_anchors), 1376| 3.91k| m_accept_ocsp_softfail(accept_ocsp_softfail) { 1377| 3.91k| if(key_strength <= 80) { ------------------ | Branch (1377:7): [True: 0, False: 3.91k] ------------------ 1378| 0| m_trusted_hashes.insert("SHA-1"); 1379| 0| } 1380| | 1381| 3.91k| m_trusted_hashes.insert("SHA-224"); 1382| 3.91k| m_trusted_hashes.insert("SHA-256"); 1383| 3.91k| m_trusted_hashes.insert("SHA-384"); 1384| 3.91k| m_trusted_hashes.insert("SHA-512"); 1385| 3.91k| m_trusted_hashes.insert("SHAKE-256(512)"); // Dilithium/ML-DSA 1386| 3.91k| m_trusted_hashes.insert("SHAKE-256(912)"); // Ed448 1387| | 1388| | // SLH-DSA-SHAKE reports the H_msg output length, which depends on the parameter set 1389| 3.91k| m_trusted_hashes.insert("SHAKE-256(240)"); // SLH-DSA-SHAKE-128s 1390| 3.91k| m_trusted_hashes.insert("SHAKE-256(272)"); // SLH-DSA-SHAKE-128f 1391| 3.91k| m_trusted_hashes.insert("SHAKE-256(312)"); // SLH-DSA-SHAKE-192s 1392| 3.91k| m_trusted_hashes.insert("SHAKE-256(336)"); // SLH-DSA-SHAKE-192f 1393| 3.91k| m_trusted_hashes.insert("SHAKE-256(376)"); // SLH-DSA-SHAKE-256s 1394| 3.91k| m_trusted_hashes.insert("SHAKE-256(392)"); // SLH-DSA-SHAKE-256f 1395| | 1396| | // Hashes used by HSS-LMS and XMSS parameter sets 1397| 3.91k| m_trusted_hashes.insert("SHAKE-128(256)"); // XMSS-SHAKE_*_256 1398| 3.91k| m_trusted_hashes.insert("SHAKE-256(192)"); // HSS-LMS and XMSS with SHAKE-256/192 1399| 3.91k| m_trusted_hashes.insert("SHAKE-256(256)"); // HSS-LMS and XMSS with SHAKE-256/256 1400| 3.91k| m_trusted_hashes.insert("Truncated(SHA-256,192)"); // HSS-LMS and XMSS with SHA-256/192 1401| 3.91k|} _ZN5Botan22Path_Validation_ResultC2ENSt3__16vectorINS1_3setINS_23Certificate_Status_CodeENS1_4lessIS4_EENS1_9allocatorIS4_EEEENS7_IS9_EEEEONS2_INS_16X509_CertificateENS7_ISC_EEEE: 1422| 3.59k| m_all_status(std::move(status)), 1423| 3.59k| m_warnings(find_warnings(m_all_status)), 1424| 3.59k| m_cert_path(std::move(cert_chain)), 1425| 3.59k| m_overall(PKIX::overall_status(m_all_status)) {} _ZNK5Botan22Path_Validation_Result21successful_validationEv: 1438| 3.59k|bool Path_Validation_Result::successful_validation() const { 1439| 3.59k| return (result() == Certificate_Status_Code::VERIFIED || result() == Certificate_Status_Code::OCSP_RESPONSE_GOOD || ------------------ | Branch (1439:12): [True: 4, False: 3.59k] | Branch (1439:61): [True: 0, False: 3.59k] ------------------ 1440| 3.59k| result() == Certificate_Status_Code::VALID_CRL_CHECKED); ------------------ | Branch (1440:12): [True: 0, False: 3.59k] ------------------ 1441| 3.59k|} x509path.cpp:_ZZN5Botan4PKIX11check_chainERKNSt3__16vectorINS_16X509_CertificateENS1_9allocatorIS3_EEEENS1_6chrono10time_pointINS9_12system_clockENS9_8durationIxNS1_5ratioILl1ELl1000000EEEEEEENS1_17basic_string_viewIcNS1_11char_traitsIcEEEENS_10Usage_TypeERKNS_28Path_Validation_RestrictionsEENK3$_0clEv: 452| 51| const auto issuer = [&]() -> std::optional { 453| 51| if(!at_trust_anchor) { ------------------ | Branch (453:13): [True: 19, False: 32] ------------------ 454| 19| return cert_path[i + 1]; 455| 32| } else if(subject.is_self_signed()) { ------------------ | Branch (455:20): [True: 32, False: 0] ------------------ 456| 32| return cert_path[i]; 457| 32| } else { 458| 0| return {}; // Non self-signed trust anchors have no checkable issuers. 459| 0| } 460| 51| }(); x509path.cpp:_ZN5Botan12_GLOBAL__N_122CertificatePathBuilderC2ERKNSt3__16vectorIPNS_17Certificate_StoreENS2_9allocatorIS5_EEEERKNS_16X509_CertificateENS2_4spanISC_Lm18446744073709551615EEEmb: 179| 3.91k| m_trusted_certstores(trusted_certstores), 180| 3.91k| m_require_self_signed(require_self_signed), 181| 3.91k| m_dfs_budget(dfs_budget) { 182| 3.91k| BOTAN_ARG_CHECK(m_dfs_budget > 0, "DFS budget must be non-zero"); ------------------ | | 35| 3.91k| do { \ | | 36| 3.91k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 3.91k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 3.91k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 3.91k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 3.91k] | | ------------------ ------------------ 183| | 184| 3.91k| if(std::ranges::any_of(trusted_certstores, [](auto* ptr) { return ptr == nullptr; })) { ------------------ | Branch (184:13): [True: 0, False: 3.91k] ------------------ 185| 0| throw Invalid_Argument("Certificate store list must not contain nullptr"); 186| 0| } 187| | 188| 3.91k| for(const auto& cert : end_entity_extra) { ------------------ | Branch (188:31): [True: 0, False: 3.91k] ------------------ 189| 0| if(!cert_in_any_trusted_store(cert)) { ------------------ | Branch (189:16): [True: 0, False: 0] ------------------ 190| 0| m_ee_extras.add_certificate(cert); 191| 0| } 192| 0| } 193| | 194| 3.91k| m_stack.push_back({end_entity, cert_in_any_trusted_store(end_entity)}); 195| 3.91k| } x509path.cpp:_ZZN5Botan12_GLOBAL__N_122CertificatePathBuilderC1ERKNSt3__16vectorIPNS_17Certificate_StoreENS2_9allocatorIS5_EEEERKNS_16X509_CertificateENS2_4spanISC_Lm18446744073709551615EEEmbENKUlPT_E_clIS4_EEDaSH_: 184| 3.91k| if(std::ranges::any_of(trusted_certstores, [](auto* ptr) { return ptr == nullptr; })) { x509path.cpp:_ZNK5Botan12_GLOBAL__N_122CertificatePathBuilder25cert_in_any_trusted_storeERKNS_16X509_CertificateE: 278| 3.91k| bool cert_in_any_trusted_store(const X509_Certificate& cert) const { 279| 3.91k| return std::ranges::any_of(m_trusted_certstores, 280| 3.91k| [&](const Certificate_Store* store) { return store->contains(cert); }); 281| 3.91k| } x509path.cpp:_ZZNK5Botan12_GLOBAL__N_122CertificatePathBuilder25cert_in_any_trusted_storeERKNS_16X509_CertificateEENKUlPKNS_17Certificate_StoreEE_clES7_: 280| 3.91k| [&](const Certificate_Store* store) { return store->contains(cert); }); x509path.cpp:_ZN5Botan12_GLOBAL__N_122CertificatePathBuilder4nextEv: 197| 7.50k| std::optional> next() { 198| 22.1k| while(!m_stack.empty()) { ------------------ | Branch (198:16): [True: 18.2k, False: 3.91k] ------------------ 199| 18.2k| if(m_dfs_budget == 0) { ------------------ | Branch (199:16): [True: 0, False: 18.2k] ------------------ 200| | // Intentionally overwrite any previous builder error 201| 0| m_error = Certificate_Status_Code::CERT_ISSUER_NOT_FOUND; 202| 0| return std::nullopt; 203| 0| } 204| | 205| 18.2k| BOTAN_ASSERT_NOMSG(m_dfs_budget > 0); ------------------ | | 84| 18.2k| do { \ | | 85| 18.2k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 18.2k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 18.2k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 18.2k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 18.2k] | | ------------------ ------------------ 206| 18.2k| m_dfs_budget -= 1; 207| | 208| 18.2k| auto [last, trusted] = std::move(m_stack.back()); // move before pop_back 209| 18.2k| m_stack.pop_back(); 210| | 211| | // Found a deletion marker that guides the DFS, backtracking 212| 18.2k| if(!last.has_value()) { ------------------ | Branch (212:16): [True: 7.18k, False: 11.0k] ------------------ 213| 7.18k| m_certs_seen.erase(m_path_so_far.back().tag()); 214| 7.18k| m_path_so_far.pop_back(); 215| 7.18k| continue; 216| 7.18k| } 217| | 218| | // Certificate already seen in this path? 219| 11.0k| const auto tag = last->tag(); 220| 11.0k| if(m_certs_seen.contains(tag)) { ------------------ | Branch (220:16): [True: 3.59k, False: 7.50k] ------------------ 221| 3.59k| if(!m_error.has_value()) { ------------------ | Branch (221:19): [True: 3.59k, False: 0] ------------------ 222| 3.59k| m_error = Certificate_Status_Code::CERT_CHAIN_LOOP; 223| 3.59k| } 224| 3.59k| continue; 225| 3.59k| } 226| | 227| | // A valid path has been discovered. It includes endpoints that may end 228| | // with either a self-signed or a non-self-signed certificate. For 229| | // certificates that are not self-signed, additional paths could 230| | // potentially extend from the current one. 231| 7.50k| if(trusted) { ------------------ | Branch (231:16): [True: 3.61k, False: 3.89k] ------------------ 232| 3.61k| auto path = m_path_so_far; 233| 3.61k| path.push_back(*last); 234| 3.61k| push_issuers(*last); 235| | 236| 3.61k| if(!m_require_self_signed || last->is_self_signed()) { ------------------ | Branch (236:19): [True: 0, False: 3.61k] | Branch (236:45): [True: 3.59k, False: 17] ------------------ 237| 3.59k| return path; 238| 3.59k| } 239| | 240| | /* 241| | This unconditionally overwrites the error because it's likely the most 242| | informative error in this context - we found a path that seemed entirely 243| | suitable, except that self-signed roots are required so it was skipped. 244| | */ 245| 17| m_error = Certificate_Status_Code::CANNOT_ESTABLISH_TRUST; 246| 17| continue; 247| 3.61k| } 248| | 249| 3.89k| if(last->is_self_signed()) { ------------------ | Branch (249:16): [True: 19, False: 3.87k] ------------------ 250| 19| if(!m_error.has_value()) { ------------------ | Branch (250:19): [True: 19, False: 0] ------------------ 251| 19| m_error = Certificate_Status_Code::CANNOT_ESTABLISH_TRUST; 252| 19| } 253| 19| continue; 254| 19| } 255| | 256| 3.87k| push_issuers(*last); 257| 3.87k| } 258| | 259| 3.91k| return std::nullopt; 260| 7.50k| } x509path.cpp:_ZN5Botan12_GLOBAL__N_122CertificatePathBuilder12push_issuersERKNS_16X509_CertificateE: 283| 7.48k| void push_issuers(const X509_Certificate& cert) { 284| 7.48k| const X509_DN& issuer_dn = cert.issuer_dn(); 285| 7.48k| const std::vector& auth_key_id = cert.authority_key_id(); 286| | 287| | // Common case is a single trusted store; steal its buffer and only 288| | // move-append if multiple stores return matches. 289| 7.48k| std::vector trusted_issuers; 290| 7.48k| for(const Certificate_Store* store : m_trusted_certstores) { ------------------ | Branch (290:45): [True: 7.48k, False: 7.48k] ------------------ 291| 7.48k| auto new_issuers = store->find_all_certs(issuer_dn, auth_key_id); 292| 7.48k| if(trusted_issuers.empty()) { ------------------ | Branch (292:16): [True: 7.48k, False: 0] ------------------ 293| 7.48k| trusted_issuers = std::move(new_issuers); 294| 7.48k| } else { 295| 0| trusted_issuers.insert(trusted_issuers.end(), 296| 0| std::make_move_iterator(new_issuers.begin()), 297| 0| std::make_move_iterator(new_issuers.end())); 298| 0| } 299| 7.48k| } 300| | 301| | // Search the supplemental certs 302| 7.48k| const std::vector misc_issuers = m_ee_extras.find_all_certs(issuer_dn, auth_key_id); 303| | 304| | // If we could not find any issuers, the current path ends here 305| 7.48k| if(trusted_issuers.empty() && misc_issuers.empty()) { ------------------ | Branch (305:13): [True: 304, False: 7.18k] | Branch (305:40): [True: 304, False: 0] ------------------ 306| 304| if(!m_error.has_value()) { ------------------ | Branch (306:16): [True: 304, False: 0] ------------------ 307| 304| m_error = Certificate_Status_Code::CERT_ISSUER_NOT_FOUND; 308| 304| } 309| 304| return; 310| 304| } 311| | 312| 7.18k| m_path_so_far.push_back(cert); 313| 7.18k| m_certs_seen.emplace(cert.tag()); 314| | 315| | // Push a deletion marker on the stack for backtracking later 316| 7.18k| m_stack.push_back({std::nullopt, false}); 317| | 318| | // The stack is LIFO so push trusted issuers last; preferring them 319| | // keeps the DFS from wandering through cross-signed CAs when the 320| | // trust anchor issued the certificate directly. 321| 7.18k| for(const auto& misc : misc_issuers) { ------------------ | Branch (321:31): [True: 0, False: 7.18k] ------------------ 322| 0| m_stack.push_back({misc, false}); 323| 0| } 324| 7.18k| for(const auto& trusted_cert : trusted_issuers) { ------------------ | Branch (324:39): [True: 7.18k, False: 7.18k] ------------------ 325| 7.18k| m_stack.push_back({trusted_cert, true}); 326| 7.18k| } 327| 7.18k| } x509path.cpp:_ZNK5Botan12_GLOBAL__N_122CertificatePathBuilder5errorEv: 267| 323| Certificate_Status_Code error() const { 268| 323| if(m_error.has_value()) { ------------------ | Branch (268:13): [True: 323, False: 0] ------------------ 269| | // Confirm it is an actual error code and not accidentally OK... 270| 323| BOTAN_ASSERT_NOMSG(static_cast(m_error.value()) >= 3000); ------------------ | | 84| 323| do { \ | | 85| 323| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 323| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 323] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 323| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 323] | | ------------------ ------------------ 271| 323| return m_error.value(); 272| 323| } else { 273| 0| return Certificate_Status_Code::CERT_ISSUER_NOT_FOUND; 274| 0| } 275| 323| } x509path.cpp:_ZN5Botan12_GLOBAL__N_113find_warningsERKNSt3__16vectorINS1_3setINS_23Certificate_Status_CodeENS1_4lessIS4_EENS1_9allocatorIS4_EEEENS7_IS9_EEEE: 1404| 3.59k|CertificatePathStatusCodes find_warnings(const CertificatePathStatusCodes& all_statuses) { 1405| 3.59k| CertificatePathStatusCodes warnings; 1406| 7.17k| for(const auto& status_set_i : all_statuses) { ------------------ | Branch (1406:33): [True: 7.17k, False: 3.59k] ------------------ 1407| 7.17k| std::set warning_set_i; 1408| 7.17k| for(const auto& code : status_set_i) { ------------------ | Branch (1408:28): [True: 3.90k, False: 7.17k] ------------------ 1409| 3.90k| if(code >= Certificate_Status_Code::FIRST_WARNING_STATUS && ------------------ | Branch (1409:13): [True: 3.90k, False: 0] ------------------ 1410| 3.90k| code < Certificate_Status_Code::FIRST_ERROR_STATUS) { ------------------ | Branch (1410:13): [True: 14, False: 3.88k] ------------------ 1411| 14| warning_set_i.insert(code); 1412| 14| } 1413| 3.90k| } 1414| 7.17k| warnings.push_back(warning_set_i); 1415| 7.17k| } 1416| 3.59k| return warnings; 1417| 3.59k|}