_ZNK5Botan7AES_1284nameEv: 28| 51| std::string name() const override { return "AES-128"; } _ZNK5Botan7AES_2564nameEv: 119| 87| std::string name() const override { return "AES-256"; } _ZNK5Botan16AlgorithmPattern9to_stringEv: 98| 3.05k| std::string_view to_string() const { return m_text; } _ZNK5Botan16AlgorithmPattern8any_headEv: 103| 14.4k| bool any_head() const { return m_head_count == 0; } _ZNK5Botan16AlgorithmPattern17head_alternativesEv: 105| 14.4k| std::span head_alternatives() const { return std::span(m_heads).first(m_head_count); } _ZNK5Botan16AlgorithmPattern8elementsEv: 107| 6.11k| std::span elements() const { return std::span(m_elements).first(m_element_count); } _ZNK5Botan13AlgorithmSpec4headEv: 171| 3.05k| std::string_view head() const { return m_head; } _ZNK5Botan13AlgorithmSpec7matchesERKNS_16AlgorithmPatternE: 292| 33|inline bool AlgorithmSpec::matches(const AlgorithmPattern& pattern) const { 293| 33| return match(pattern).has_value(); 294| 33|} _ZN5Botan13AlgorithmSpecC2Ev: 212| 6.05k| 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| 98.5k| void clear() { 72| 98.5k| zeroize_buffer(m_buffer.data(), m_buffer.size()); 73| 98.5k| m_position = 0; 74| 98.5k| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EEC2Ev: 62| 652| AlignmentBuffer() = default; _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE5clearEv: 71| 6.88k| void clear() { 72| 6.88k| zeroize_buffer(m_buffer.data(), m_buffer.size()); 73| 6.88k| m_position = 0; 74| 6.88k| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EED2Ev: 64| 652| ~AlignmentBuffer() { secure_zeroize_buffer(m_buffer.data(), sizeof(T) * m_buffer.size()); } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE21handle_unaligned_dataERNS_12BufferSlicerE: 166| 140k| [[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| 140k| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (170:31): [True: 0, False: 140k] ------------------ 171| | 172| 140k| if(in_alignment() && slicer.remaining() >= m_buffer.size() + defer) { ------------------ | Branch (172:13): [True: 130k, False: 9.90k] | Branch (172:31): [True: 48.9k, False: 81.2k] ------------------ 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| 48.9k| return std::nullopt; 177| 48.9k| } 178| | 179| | // Fill the buffer with as much input data as needed to reach alignment 180| | // or until the input source is depleted. 181| 91.1k| const auto elements_to_consume = std::min(m_buffer.size() - m_position, slicer.remaining()); 182| 91.1k| 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| 91.1k| if(ready_to_consume() && (!defers_final_block() || !slicer.empty())) { ------------------ | Branch (188:13): [True: 4.89k, False: 86.3k] | Branch (188:36): [True: 4.89k, False: 0] | Branch (188:61): [True: 0, False: 0] ------------------ 189| 4.89k| return consume(); 190| 86.3k| } else { 191| 86.3k| return std::nullopt; 192| 86.3k| } 193| 91.1k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE18defers_final_blockEv: 233| 198k| constexpr bool defers_final_block() const { 234| 198k| return FINAL_BLOCK_STRATEGY == AlignmentBufferFinalBlock::must_be_deferred; 235| 198k| } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE6appendENSt3__14spanIKhLm18446744073709551615EEE: 90| 167k| void append(std::span elements) { 91| 167k| BOTAN_ASSERT_NOMSG(elements.size() <= elements_until_alignment()); ------------------ | | 84| 167k| do { \ | | 85| 167k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 167k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 167k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 167k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 167k] | | ------------------ ------------------ 92| 167k| std::copy(elements.begin(), elements.end(), m_buffer.begin() + m_position); 93| 167k| m_position += elements.size(); 94| 167k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE24elements_until_alignmentEv: 221| 422k| size_t elements_until_alignment() const { return m_buffer.size() - m_position; } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE16ready_to_consumeEv: 231| 376k| bool ready_to_consume() const { return m_position == m_buffer.size(); } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE7consumeEv: 200| 106k| [[nodiscard]] std::span consume() { 201| 106k| BOTAN_ASSERT_NOMSG(ready_to_consume()); ------------------ | | 84| 106k| do { \ | | 85| 106k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 106k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 106k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 106k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 106k] | | ------------------ ------------------ 202| 106k| m_position = 0; 203| 106k| return m_buffer; 204| 106k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE12in_alignmentEv: 226| 334k| bool in_alignment() const { return m_position == 0; } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE23aligned_data_to_processERNS_12BufferSlicerE: 126| 53.8k| [[nodiscard]] std::tuple, size_t> aligned_data_to_process(BufferSlicer& slicer) const { 127| 53.8k| BOTAN_ASSERT_NOMSG(in_alignment()); ------------------ | | 84| 53.8k| do { \ | | 85| 53.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 53.8k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 53.8k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 53.8k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 53.8k] | | ------------------ ------------------ 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| 53.8k| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (131:31): [True: 0, False: 53.8k] ------------------ 132| 53.8k| const size_t full_blocks_to_process = (slicer.remaining() - defer) / m_buffer.size(); 133| 53.8k| return {slicer.take(full_blocks_to_process * m_buffer.size()), full_blocks_to_process}; 134| 53.8k| } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE18fill_up_with_zerosEv: 79| 101k| void fill_up_with_zeros() { 80| 101k| if(!ready_to_consume()) { ------------------ | Branch (80:13): [True: 101k, False: 7] ------------------ 81| 101k| zeroize_buffer(&m_buffer[m_position], elements_until_alignment()); 82| 101k| m_position = m_buffer.size(); 83| 101k| } 84| 101k| } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE20directly_modify_lastEm: 113| 76.3k| std::span directly_modify_last(size_t elements) { 114| 76.3k| BOTAN_ASSERT_NOMSG(size() >= elements); ------------------ | | 84| 76.3k| do { \ | | 85| 76.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 76.3k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 76.3k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 76.3k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 76.3k] | | ------------------ ------------------ 115| 76.3k| return std::span(m_buffer).last(elements); 116| 76.3k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE4sizeEv: 217| 76.3k| constexpr size_t size() const { return m_buffer.size(); } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE21handle_unaligned_dataERNS_12BufferSlicerE: 166| 14.5k| [[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| 14.5k| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (170:31): [True: 0, False: 14.5k] ------------------ 171| | 172| 14.5k| if(in_alignment() && slicer.remaining() >= m_buffer.size() + defer) { ------------------ | Branch (172:13): [True: 11.8k, False: 2.65k] | Branch (172:31): [True: 6.23k, False: 5.62k] ------------------ 173| | // We are currently in alignment and the passed-in data source 174| | // contains enough data to benefit from aligned processing. 175| | // Therefore, we don't copy anything into the intermittent buffer. 176| 6.23k| return std::nullopt; 177| 6.23k| } 178| | 179| | // Fill the buffer with as much input data as needed to reach alignment 180| | // or until the input source is depleted. 181| 8.28k| const auto elements_to_consume = std::min(m_buffer.size() - m_position, slicer.remaining()); 182| 8.28k| 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| 8.28k| if(ready_to_consume() && (!defers_final_block() || !slicer.empty())) { ------------------ | Branch (188:13): [True: 9, False: 8.27k] | Branch (188:36): [True: 9, False: 0] | Branch (188:61): [True: 0, False: 0] ------------------ 189| 9| return consume(); 190| 8.27k| } else { 191| 8.27k| return std::nullopt; 192| 8.27k| } 193| 8.28k| } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE18defers_final_blockEv: 233| 20.7k| constexpr bool defers_final_block() const { 234| 20.7k| return FINAL_BLOCK_STRATEGY == AlignmentBufferFinalBlock::must_be_deferred; 235| 20.7k| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE6appendENSt3__14spanIKhLm18446744073709551615EEE: 90| 13.8k| void append(std::span elements) { 91| 13.8k| BOTAN_ASSERT_NOMSG(elements.size() <= elements_until_alignment()); ------------------ | | 84| 13.8k| do { \ | | 85| 13.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 13.8k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 13.8k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 13.8k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 13.8k] | | ------------------ ------------------ 92| 13.8k| std::copy(elements.begin(), elements.end(), m_buffer.begin() + m_position); 93| 13.8k| m_position += elements.size(); 94| 13.8k| } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE24elements_until_alignmentEv: 221| 32.1k| size_t elements_until_alignment() const { return m_buffer.size() - m_position; } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE16ready_to_consumeEv: 231| 27.8k| bool ready_to_consume() const { return m_position == m_buffer.size(); } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE7consumeEv: 200| 6.99k| [[nodiscard]] std::span consume() { 201| 6.99k| BOTAN_ASSERT_NOMSG(ready_to_consume()); ------------------ | | 84| 6.99k| do { \ | | 85| 6.99k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 6.99k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 6.99k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 6.99k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 6.99k] | | ------------------ ------------------ 202| 6.99k| m_position = 0; 203| 6.99k| return m_buffer; 204| 6.99k| } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE12in_alignmentEv: 226| 35.2k| bool in_alignment() const { return m_position == 0; } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE23aligned_data_to_processERNS_12BufferSlicerE: 126| 6.24k| [[nodiscard]] std::tuple, size_t> aligned_data_to_process(BufferSlicer& slicer) const { 127| 6.24k| BOTAN_ASSERT_NOMSG(in_alignment()); ------------------ | | 84| 6.24k| do { \ | | 85| 6.24k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 6.24k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 6.24k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 6.24k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 6.24k] | | ------------------ ------------------ 128| | 129| | // When the final block is to be deferred, the last block must not be 130| | // selected for processing if there is no (unaligned) extra input data. 131| 6.24k| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (131:31): [True: 0, False: 6.24k] ------------------ 132| 6.24k| const size_t full_blocks_to_process = (slicer.remaining() - defer) / m_buffer.size(); 133| 6.24k| return {slicer.take(full_blocks_to_process * m_buffer.size()), full_blocks_to_process}; 134| 6.24k| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE18fill_up_with_zerosEv: 79| 6.98k| void fill_up_with_zeros() { 80| 6.98k| if(!ready_to_consume()) { ------------------ | Branch (80:13): [True: 6.98k, False: 1] ------------------ 81| 6.98k| zeroize_buffer(&m_buffer[m_position], elements_until_alignment()); 82| 6.98k| m_position = m_buffer.size(); 83| 6.98k| } 84| 6.98k| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE20directly_modify_lastEm: 113| 5.61k| std::span directly_modify_last(size_t elements) { 114| 5.61k| BOTAN_ASSERT_NOMSG(size() >= elements); ------------------ | | 84| 5.61k| do { \ | | 85| 5.61k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 5.61k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 5.61k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 5.61k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 5.61k] | | ------------------ ------------------ 115| 5.61k| return std::span(m_buffer).last(elements); 116| 5.61k| } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE4sizeEv: 217| 5.61k| constexpr size_t size() const { return m_buffer.size(); } _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EEC2Ev: 62| 130| AlignmentBuffer() = default; _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EED2Ev: 64| 130| ~AlignmentBuffer() { secure_zeroize_buffer(m_buffer.data(), sizeof(T) * m_buffer.size()); } _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE5clearEv: 71| 266| void clear() { 72| 266| zeroize_buffer(m_buffer.data(), m_buffer.size()); 73| 266| m_position = 0; 74| 266| } _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE21handle_unaligned_dataERNS_12BufferSlicerE: 166| 472| [[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| 472| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (170:31): [True: 0, False: 472] ------------------ 171| | 172| 472| if(in_alignment() && slicer.remaining() >= m_buffer.size() + defer) { ------------------ | Branch (172:13): [True: 365, False: 107] | Branch (172:31): [True: 102, False: 263] ------------------ 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| 102| return std::nullopt; 177| 102| } 178| | 179| | // Fill the buffer with as much input data as needed to reach alignment 180| | // or until the input source is depleted. 181| 370| const auto elements_to_consume = std::min(m_buffer.size() - m_position, slicer.remaining()); 182| 370| 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| 370| if(ready_to_consume() && (!defers_final_block() || !slicer.empty())) { ------------------ | Branch (188:13): [True: 107, False: 263] | Branch (188:36): [True: 107, False: 0] | Branch (188:61): [True: 0, False: 0] ------------------ 189| 107| return consume(); 190| 263| } else { 191| 263| return std::nullopt; 192| 263| } 193| 370| } _ZNK5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE18defers_final_blockEv: 233| 788| constexpr bool defers_final_block() const { 234| 788| return FINAL_BLOCK_STRATEGY == AlignmentBufferFinalBlock::must_be_deferred; 235| 788| } _ZNK5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE16ready_to_consumeEv: 231| 789| bool ready_to_consume() const { return m_position == m_buffer.size(); } _ZNK5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE12in_alignmentEv: 226| 1.45k| bool in_alignment() const { return m_position == 0; } _ZNK5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE23aligned_data_to_processERNS_12BufferSlicerE: 126| 209| [[nodiscard]] std::tuple, size_t> aligned_data_to_process(BufferSlicer& slicer) const { 127| 209| BOTAN_ASSERT_NOMSG(in_alignment()); ------------------ | | 84| 209| do { \ | | 85| 209| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 209| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 209] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 209| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 209] | | ------------------ ------------------ 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| 209| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (131:31): [True: 0, False: 209] ------------------ 132| 209| const size_t full_blocks_to_process = (slicer.remaining() - defer) / m_buffer.size(); 133| 209| return {slicer.take(full_blocks_to_process * m_buffer.size()), full_blocks_to_process}; 134| 209| } _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE6appendENSt3__14spanIKhLm18446744073709551615EEE: 90| 370| void append(std::span elements) { 91| 370| BOTAN_ASSERT_NOMSG(elements.size() <= elements_until_alignment()); ------------------ | | 84| 370| do { \ | | 85| 370| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 370| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 370] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 370| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 370] | | ------------------ ------------------ 92| 370| std::copy(elements.begin(), elements.end(), m_buffer.begin() + m_position); 93| 370| m_position += elements.size(); 94| 370| } _ZNK5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE24elements_until_alignmentEv: 221| 526| size_t elements_until_alignment() const { return m_buffer.size() - m_position; } _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE18fill_up_with_zerosEv: 79| 156| void fill_up_with_zeros() { 80| 156| if(!ready_to_consume()) { ------------------ | Branch (80:13): [True: 156, False: 0] ------------------ 81| 156| zeroize_buffer(&m_buffer[m_position], elements_until_alignment()); 82| 156| m_position = m_buffer.size(); 83| 156| } 84| 156| } _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE7consumeEv: 200| 263| [[nodiscard]] std::span consume() { 201| 263| BOTAN_ASSERT_NOMSG(ready_to_consume()); ------------------ | | 84| 263| do { \ | | 85| 263| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 263| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 263] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 263| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 263] | | ------------------ ------------------ 202| 263| m_position = 0; 203| 263| return m_buffer; 204| 263| } _ZNK5Botan8ARIA_1284nameEv: 34| 3| std::string name() const override { return "ARIA-128"; } _ZNK5Botan8ARIA_2564nameEv: 104| 3| std::string name() const override { return "ARIA-256"; } _ZNK5Botan17Barrett_Reduction4cubeERKNS_6BigIntE: 66| 6| BigInt cube(const BigInt& x) const { return this->multiply(x, this->square(x)); } _ZN5Botan10ct_is_zeroITkNSt3__117unsigned_integralEhEET_S2_: 37| 16.0k|BOTAN_FORCE_INLINE constexpr T ct_is_zero(T x) { 38| 16.0k| return ct_expand_top_bit(~x & (x - 1)); 39| 16.0k|} _ZN5Botan17ct_expand_top_bitITkNSt3__117unsigned_integralEhEET_S2_: 28| 16.0k|BOTAN_FORCE_INLINE constexpr T ct_expand_top_bit(T a) { 29| 16.0k| const T top = CT::value_barrier(a >> (sizeof(T) * 8 - 1)); 30| 16.0k| return static_cast(0) - top; 31| 16.0k|} _ZN5Botan9var_ctz64Em: 181| 289|BOTAN_FORCE_INLINE constexpr size_t var_ctz64(uint64_t n) { 182| 289|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_ctzll) 183| 289| if(n == 0) { ------------------ | Branch (183:7): [True: 0, False: 289] ------------------ 184| 0| return 64; 185| 0| } 186| 289| return __builtin_ctzll(n); 187| |#else 188| | return ctz(n); 189| |#endif 190| 289|} _ZN5Botan17ct_expand_top_bitITkNSt3__117unsigned_integralEmEET_S2_: 28| 40.1M|BOTAN_FORCE_INLINE constexpr T ct_expand_top_bit(T a) { 29| 40.1M| const T top = CT::value_barrier(a >> (sizeof(T) * 8 - 1)); 30| 40.1M| return static_cast(0) - top; 31| 40.1M|} _ZN5Botan10ct_is_zeroITkNSt3__117unsigned_integralEmEET_S2_: 37| 39.7M|BOTAN_FORCE_INLINE constexpr T ct_is_zero(T x) { 38| 39.7M| return ct_expand_top_bit(~x & (x - 1)); 39| 39.7M|} _ZN5Botan6chooseITkNSt3__117unsigned_integralEmEET_S2_S2_S2_: 217| 269M|BOTAN_FORCE_INLINE constexpr T choose(T mask, T a, T b) { 218| | //return (mask & a) | (~mask & b); 219| 269M| return (b ^ (mask & (a ^ b))); 220| 269M|} _ZN5Botan8high_bitITkNSt3__117unsigned_integralEjEEmT_: 73| 59.3k|BOTAN_FORCE_INLINE constexpr size_t high_bit(T n) { 74| 59.3k| size_t hb = 0; 75| | 76| 356k| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (76:38): [True: 296k, False: 59.3k] ------------------ 77| | // Equivalent to: ((n >> s) == 0) ? 0 : s; 78| 296k| const size_t z = s - ct_if_is_zero_ret(n >> s, s); 79| 296k| hb += z; 80| 296k| n >>= z; 81| 296k| } 82| | 83| 59.3k| hb += static_cast(n); 84| | 85| 59.3k| return hb; 86| 59.3k|} _ZN5Botan17ct_if_is_zero_retITkNSt3__117unsigned_integralEjEEmT_m: 45| 296k|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| 296k| const T a = ~x & (x - 1); 51| 296k| const size_t a_top = static_cast(CT::value_barrier(a >> (sizeof(T) * 8 - 1))); 52| 296k| const size_t mask = static_cast(0) - a_top; 53| 296k| return mask & s; 54| 296k|} _ZN5Botan17significant_bytesITkNSt3__117unsigned_integralEmEEmT_: 94| 12.5k|BOTAN_FORCE_INLINE constexpr size_t significant_bytes(T n) { 95| 12.5k| size_t b = 0; 96| | 97| 50.1k| for(size_t s = 8 * sizeof(T) / 2; s >= 8; s /= 2) { ------------------ | Branch (97:38): [True: 37.6k, False: 12.5k] ------------------ 98| | // Equivalent to: ((n >> s) == 0) ? 0 : s; 99| 37.6k| const size_t z = s - ct_if_is_zero_ret(n >> s, s); 100| 37.6k| b += z / 8; 101| 37.6k| n >>= z; 102| 37.6k| } 103| | 104| 12.5k| b += (n != 0); 105| | 106| 12.5k| return b; 107| 12.5k|} _ZN5Botan17ct_if_is_zero_retITkNSt3__117unsigned_integralEmEEmT_m: 45| 328k|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| 328k| const T a = ~x & (x - 1); 51| 328k| const size_t a_top = static_cast(CT::value_barrier(a >> (sizeof(T) * 8 - 1))); 52| 328k| const size_t mask = static_cast(0) - a_top; 53| 328k| return mask & s; 54| 328k|} _ZN5Botan9swap_bitsITkNSt3__117unsigned_integralEmEEvRT_S3_S2_m: 203| 22.0k|BOTAN_FORCE_INLINE constexpr void swap_bits(T& x, T& y, T mask, size_t shift) { 204| 22.0k| const T swap = ((x >> shift) ^ y) & mask; 205| 22.0k| x ^= swap << shift; 206| 22.0k| y ^= swap; 207| 22.0k|} _ZN5Botan13ceil_divisionITkNSt3__117unsigned_integralEmEET_S2_S2_: 167| 94.0k|BOTAN_FORCE_INLINE constexpr T ceil_division(T a, T b) { 168| | // Same as `(a + b - 1) / b` but avoids possible overflow 169| 94.0k| return a / b + ((a % b != 0) ? 1 : 0); ------------------ | Branch (169:20): [True: 67.5k, False: 26.5k] ------------------ 170| 94.0k|} _ZN5Botan13is_power_of_2ITkNSt3__117unsigned_integralEmEEbT_: 62| 281|BOTAN_FORCE_INLINE constexpr bool is_power_of_2(T arg) { 63| 281| return (arg != 0) && (arg != 1) && ((arg & static_cast(arg - 1)) == 0); ------------------ | Branch (63:11): [True: 281, False: 0] | Branch (63:25): [True: 281, False: 0] | Branch (63:39): [True: 281, False: 0] ------------------ 64| 281|} _ZN5Botan8majorityITkNSt3__117unsigned_integralEmEET_S2_S2_S2_: 223| 1.10M|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| 1.10M| return choose(a ^ b, c, b); 234| 1.10M|} _ZN5Botan8high_bitITkNSt3__117unsigned_integralEmEEmT_: 73| 48.5k|BOTAN_FORCE_INLINE constexpr size_t high_bit(T n) { 74| 48.5k| size_t hb = 0; 75| | 76| 339k| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (76:38): [True: 291k, False: 48.5k] ------------------ 77| | // Equivalent to: ((n >> s) == 0) ? 0 : s; 78| 291k| const size_t z = s - ct_if_is_zero_ret(n >> s, s); 79| 291k| hb += z; 80| 291k| n >>= z; 81| 291k| } 82| | 83| 48.5k| hb += static_cast(n); 84| | 85| 48.5k| return hb; 86| 48.5k|} _ZN5Botan12ceil_tobytesITkNSt3__117unsigned_integralEmEET_S2_: 176| 35.9k|BOTAN_FORCE_INLINE constexpr T ceil_tobytes(T bits) { 177| 35.9k| return (bits + 7) / 8; 178| 35.9k|} _ZN5Botan6chooseITkNSt3__117unsigned_integralEhEET_S2_S2_S2_: 217| 472|BOTAN_FORCE_INLINE constexpr T choose(T mask, T a, T b) { 218| | //return (mask & a) | (~mask & b); 219| 472| return (b ^ (mask & (a ^ b))); 220| 472|} _ZN5Botan17ct_expand_top_bitITkNSt3__117unsigned_integralEtEET_S2_: 28| 18.5k|BOTAN_FORCE_INLINE constexpr T ct_expand_top_bit(T a) { 29| 18.5k| const T top = CT::value_barrier(a >> (sizeof(T) * 8 - 1)); 30| 18.5k| return static_cast(0) - top; 31| 18.5k|} _ZN5Botan10ct_is_zeroITkNSt3__117unsigned_integralEtEET_S2_: 37| 9.27k|BOTAN_FORCE_INLINE constexpr T ct_is_zero(T x) { 38| 9.27k| return ct_expand_top_bit(~x & (x - 1)); 39| 9.27k|} _ZN5Botan13reverse_bytesITkNSt3__117unsigned_integralEmQooooooeqstT_Li1EeqstS2_Li2EeqstS2_Li4EeqstS2_Li8EEES2_S2_: 25| 1.01M|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| 1.01M| } else if constexpr(sizeof(T) == 8) { 43| 1.01M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap64) 44| 1.01M| 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| 1.01M| } 55| 1.01M|} _ZN5Botan13reverse_bytesITkNSt3__117unsigned_integralEtQooooooeqstT_Li1EeqstS2_Li2EeqstS2_Li4EeqstS2_Li8EEES2_S2_: 25| 213k|inline constexpr T reverse_bytes(T x) { 26| | if constexpr(sizeof(T) == 1) { 27| | return x; 28| 213k| } else if constexpr(sizeof(T) == 2) { 29| 213k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap16) 30| 213k| 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| 213k|} _ZN5Botan13reverse_bytesITkNSt3__117unsigned_integralEjQooooooeqstT_Li1EeqstS2_Li2EeqstS2_Li4EeqstS2_Li8EEES2_S2_: 25| 545k|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| 545k| } else if constexpr(sizeof(T) == 4) { 35| 545k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap32) 36| 545k| 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| 545k|} _ZN5Botan12BufferSlicerC2ENSt3__14spanIKhLm18446744073709551615EEE: 25| 282k| explicit BufferSlicer(std::span buffer) : m_remaining(buffer) {} _ZN5Botan12BufferSlicer4takeEm: 37| 691k| std::span take(const size_t count) { 38| 691k| BOTAN_STATE_CHECK(remaining() >= count); ------------------ | | 51| 691k| do { \ | | 52| 691k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 691k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 691k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 691k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 691k] | | ------------------ ------------------ 39| 691k| const auto result = m_remaining.first(count); 40| 691k| m_remaining = m_remaining.subspan(count); 41| 691k| return result; 42| 691k| } _ZNK5Botan12BufferSlicer9remainingEv: 73| 1.15M| size_t remaining() const { return m_remaining.size(); } _ZN5Botan12BufferSlicer9take_byteEv: 57| 431k| uint8_t take_byte() { return take(1)[0]; } _ZN5Botan12BufferSlicer9copy_intoENSt3__14spanIhLm18446744073709551615EEE: 66| 56.6k| void copy_into(std::span sink) { 67| 56.6k| const auto data = take(sink.size()); 68| 56.6k| std::copy(data.begin(), data.end(), sink.begin()); 69| 56.6k| } _ZNK5Botan12BufferSlicer5emptyEv: 75| 1.17M| bool empty() const { return m_remaining.empty(); } _ZN5Botan12BufferSlicer4copyITkNS_8concepts20contiguous_containerENS_6StrongINSt3__16vectorIhNS4_9allocatorIhEEEENS_3TLS27SerializedHandshakeMessage_EJEEEEEDam: 28| 5.12k| auto copy(const size_t count) { 29| 5.12k| const auto result = take(count); 30| 5.12k| return ContainerT(result.begin(), result.end()); 31| 5.12k| } _ZN5Botan13BufferStufferC2ENSt3__14spanIhLm18446744073709551615EEE: 26| 23.2k| constexpr explicit BufferStuffer(std::span buffer) : m_buffer(buffer) {} _ZN5Botan13BufferStuffer4nextEm: 32| 26.8k| constexpr std::span next(size_t bytes) { 33| 26.8k| BOTAN_STATE_CHECK(m_buffer.size() >= bytes); ------------------ | | 51| 26.8k| do { \ | | 52| 26.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 26.8k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 26.8k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 26.8k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 26.8k] | | ------------------ ------------------ 34| | 35| 26.8k| const auto result = m_buffer.first(bytes); 36| 26.8k| m_buffer = m_buffer.subspan(bytes); 37| 26.8k| return result; 38| 26.8k| } _ZN5Botan13BufferStuffer6appendENSt3__14spanIKhLm18446744073709551615EEE: 59| 6.15k| constexpr void append(std::span buffer) { 60| 6.15k| const size_t len = buffer.size(); 61| 6.15k| const auto sink = next(len); 62| 185k| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (62:28): [True: 179k, False: 6.15k] ------------------ 63| 179k| sink[i] = buffer[i]; 64| 179k| } 65| 6.15k| } _ZN5Botan13BufferStuffer6appendEhm: 67| 20.6k| constexpr void append(uint8_t val, size_t repeat = 1) { 68| 20.6k| for(auto& b : next(repeat)) { ------------------ | Branch (68:22): [True: 20.6k, False: 20.6k] ------------------ 69| 20.6k| b = val; 70| 20.6k| } 71| 20.6k| } _ZNK5Botan13BufferStuffer4fullEv: 73| 8.73k| constexpr bool full() const { return m_buffer.empty(); } _ZNK5Botan13BufferStuffer18remaining_capacityEv: 75| 6.15k| constexpr size_t remaining_capacity() const { return m_buffer.size(); } _ZN5Botan13BufferStuffer4nextILm32EEENSt3__14spanIhXT_EEEv: 41| 32.1k| constexpr std::span next() { 42| 32.1k| BOTAN_STATE_CHECK(m_buffer.size() >= bytes); ------------------ | | 51| 32.1k| do { \ | | 52| 32.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 32.1k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 32.1k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 32.1k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 32.1k] | | ------------------ ------------------ 43| | 44| 32.1k| const auto result = m_buffer.first(); 45| 32.1k| m_buffer = m_buffer.subspan(bytes); 46| 32.1k| return result; 47| 32.1k| } _ZN5Botan13BufferStuffer4nextILm48EEENSt3__14spanIhXT_EEEv: 41| 4.47k| constexpr std::span next() { 42| 4.47k| BOTAN_STATE_CHECK(m_buffer.size() >= bytes); ------------------ | | 51| 4.47k| do { \ | | 52| 4.47k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 4.47k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 4.47k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 4.47k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 4.47k] | | ------------------ ------------------ 43| | 44| 4.47k| const auto result = m_buffer.first(); 45| 4.47k| m_buffer = m_buffer.subspan(bytes); 46| 4.47k| return result; 47| 4.47k| } _ZN5Botan13BufferStuffer4nextILm64EEENSt3__14spanIhXT_EEEv: 41| 2.39k| constexpr std::span next() { 42| 2.39k| BOTAN_STATE_CHECK(m_buffer.size() >= bytes); ------------------ | | 51| 2.39k| do { \ | | 52| 2.39k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 2.39k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 2.39k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 2.39k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 2.39k] | | ------------------ ------------------ 43| | 44| 2.39k| const auto result = m_buffer.first(); 45| 2.39k| m_buffer = m_buffer.subspan(bytes); 46| 2.39k| return result; 47| 2.39k| } _ZN5Botan13BufferStuffer4nextILm66EEENSt3__14spanIhXT_EEEv: 41| 2.22k| constexpr std::span next() { 42| 2.22k| BOTAN_STATE_CHECK(m_buffer.size() >= bytes); ------------------ | | 51| 2.22k| do { \ | | 52| 2.22k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 2.22k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 2.22k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 2.22k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 2.22k] | | ------------------ ------------------ 43| | 44| 2.22k| const auto result = m_buffer.first(); 45| 2.22k| m_buffer = m_buffer.subspan(bytes); 46| 2.22k| return result; 47| 2.22k| } _ZNK5Botan12Camellia_1284nameEv: 26| 8| std::string name() const override { return "Camellia-128"; } _ZNK5Botan12Camellia_2564nameEv: 106| 7| std::string name() const override { return "Camellia-256"; } _ZN5Botan14CBC_EncryptionC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEENS2_INS_28BlockCipherModePaddingMethodENS4_IS7_EEEE: 79| 23| CBC_Mode(std::move(cipher), std::move(padding)) {} _ZN5Botan14CBC_DecryptionC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEENS2_INS_28BlockCipherModePaddingMethodENS4_IS7_EEEE: 120| 84| CBC_Mode(std::move(cipher), std::move(padding)), m_tempbuf(ideal_granularity()) {} _ZNK5Botan8CBC_Mode6cipherEv: 45| 446| const BlockCipher& cipher() const { return *m_cipher; } _ZNK5Botan8CBC_Mode10block_sizeEv: 52| 160| size_t block_size() const { return m_block_size; } _ZN5Botan8CBC_Mode5stateEv: 54| 117| secure_vector& state() { return m_state; } _ZN5Botan8CBC_Mode9state_ptrEv: 56| 309| uint8_t* state_ptr() { return m_state.data(); } _ZN5Botan14CCM_EncryptionC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEmm: 94| 9| CCM_Mode(std::move(cipher), tag_size, L) {} _ZN5Botan14CCM_DecryptionC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEmm: 117| 37| CCM_Mode(std::move(cipher), tag_size, L) {} _ZNK5Botan8CCM_Mode8tag_sizeEv: 46| 283| size_t tag_size() const final { return m_tag_size; } _ZNK5Botan8CCM_Mode1LEv: 53| 252| size_t L() const { return m_L; } _ZNK5Botan8CCM_Mode6cipherEv: 55| 42| const BlockCipher& cipher() const { return *m_cipher; } _ZNK5Botan8CCM_Mode6ad_bufEv: 61| 42| const secure_vector& ad_buf() const { return m_ad_buf; } _ZN5Botan8CCM_Mode7msg_bufEv: 63| 84| secure_vector& msg_buf() { return m_msg_buf; } _ZNK5Botan14CCM_Decryption18minimum_final_sizeEv: 121| 27| size_t minimum_final_size() const override { return tag_size(); } _ZNK5Botan21ChaCha20Poly1305_Mode8key_specEv: 38| 33| Key_Length_Specification key_spec() const override { return Key_Length_Specification(32); } _ZNK5Botan21ChaCha20Poly1305_Mode8tag_sizeEv: 42| 172| size_t tag_size() const override { return 16; } _ZNK5Botan21ChaCha20Poly1305_Mode12cfrg_versionEv: 60| 123| bool cfrg_version() const { return m_nonce_len == 12 || m_nonce_len == 24; } ------------------ | Branch (60:42): [True: 123, False: 0] | Branch (60:63): [True: 0, False: 0] ------------------ _ZNK5Botan27ChaCha20Poly1305_Decryption18minimum_final_sizeEv: 91| 17| size_t minimum_final_size() const override { return tag_size(); } base64.cpp:_ZN5Botan11base_decodeINS_12_GLOBAL__N_16Base64EEEmRKT_PhPKcmRmbb: 124| 12.5k| bool ignore_ws = true) { 125| | // TODO(Botan4) Check if we can use just base. or Base:: here instead 126| 12.5k| constexpr size_t decoding_bytes_in = std::remove_reference_t::decoding_bytes_in(); 127| 12.5k| constexpr size_t decoding_bytes_out = std::remove_reference_t::decoding_bytes_out(); 128| | 129| 12.5k| input_consumed = 0; 130| | 131| 12.5k| uint8_t* out_ptr = output; 132| 12.5k| std::array decode_buf{}; 133| 12.5k| size_t decode_buf_pos = 0; 134| 12.5k| size_t final_truncate = 0; 135| 12.5k| bool seen_padding = false; 136| | 137| 12.5k| clear_mem(output, base.decode_max_output(input_length)); 138| | 139| 5.20M| for(size_t i = 0; i != input_length; ++i) { ------------------ | Branch (139:22): [True: 5.18M, False: 12.5k] ------------------ 140| 5.18M| const uint8_t bin = base.lookup_binary_value(input[i]); 141| | 142| | // This call might throw Invalid_Argument 143| 5.18M| if(base.check_bad_char(bin, input[i], ignore_ws)) { ------------------ | Branch (143:10): [True: 5.18M, False: 0] ------------------ 144| | // Padding may only appear at the end, so a data symbol must never 145| | // follow one (0x81 marks a padding character) 146| 5.18M| if(seen_padding) { ------------------ | Branch (146:13): [True: 0, False: 5.18M] ------------------ 147| 0| throw Invalid_Argument(base.name() + " decoding failed, data follows padding"); 148| 0| } 149| 5.18M| decode_buf[decode_buf_pos] = bin; 150| 5.18M| ++decode_buf_pos; 151| 5.18M| } else if(bin == 0x81) { ------------------ | Branch (151:17): [True: 0, False: 0] ------------------ 152| 0| seen_padding = true; 153| 0| } 154| | 155| | /* 156| | * If we're at the end of the input, pad with 0s and truncate 157| | */ 158| 5.18M| if(final_inputs && (i == input_length - 1)) { ------------------ | Branch (158:10): [True: 5.18M, False: 0] | Branch (158:26): [True: 12.5k, False: 5.17M] ------------------ 159| 12.5k| if(decode_buf_pos) { ------------------ | Branch (159:13): [True: 12.5k, False: 0] ------------------ 160| 12.5k| const size_t bits_per_symbol = base.bits_consumed(); 161| 12.5k| 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| 12.5k| if(pad_bits >= bits_per_symbol) { ------------------ | Branch (165:16): [True: 0, False: 12.5k] ------------------ 166| 0| throw Invalid_Argument(base.name() + " decoding failed, invalid length"); 167| 0| } 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| 12.5k| const uint8_t pad_mask = static_cast((1U << pad_bits) - 1); 172| 12.5k| if(decode_buf[decode_buf_pos - 1] & pad_mask) { ------------------ | Branch (172:16): [True: 0, False: 12.5k] ------------------ 173| 0| throw Invalid_Argument(base.name() + " decoding failed, nonzero padding bits"); 174| 0| } 175| | 176| 12.5k| for(size_t j = decode_buf_pos; j < decoding_bytes_in; ++j) { ------------------ | Branch (176:44): [True: 0, False: 12.5k] ------------------ 177| 0| decode_buf[j] = 0; 178| 0| } 179| | 180| 12.5k| final_truncate = decoding_bytes_in - decode_buf_pos; 181| 12.5k| decode_buf_pos = decoding_bytes_in; 182| 12.5k| } 183| 12.5k| } 184| | 185| 5.18M| if(decode_buf_pos == decoding_bytes_in) { ------------------ | Branch (185:10): [True: 1.29M, False: 3.89M] ------------------ 186| 1.29M| base.decode(out_ptr, decode_buf.data()); 187| | 188| 1.29M| out_ptr += decoding_bytes_out; 189| 1.29M| decode_buf_pos = 0; 190| 1.29M| input_consumed = i + 1; 191| 1.29M| } 192| 5.18M| } 193| | 194| 12.5k| while(input_consumed < input_length && base.lookup_binary_value(input[input_consumed]) == 0x80) { ------------------ | Branch (194:10): [True: 0, False: 12.5k] | Branch (194:43): [True: 0, False: 0] ------------------ 195| 0| ++input_consumed; 196| 0| } 197| | 198| 12.5k| const size_t written = (out_ptr - output) - base.bytes_to_remove(final_truncate); 199| | 200| 12.5k| return written; 201| 12.5k|} base64.cpp:_ZN5Botan16base_decode_fullINS_12_GLOBAL__N_16Base64EEEmRKT_PhPKcmb: 204| 12.5k|size_t base_decode_full(const Base& base, uint8_t output[], const char input[], size_t input_length, bool ignore_ws) { 205| 12.5k| size_t consumed = 0; 206| 12.5k| const size_t written = base_decode(base, output, input, input_length, consumed, true, ignore_ws); 207| | 208| 12.5k| if(consumed != input_length) { ------------------ | Branch (208:7): [True: 0, False: 12.5k] ------------------ 209| 0| throw Invalid_Argument(base.name() + " decoding failed, input did not have full bytes"); 210| 0| } 211| | 212| 12.5k| return written; 213| 12.5k|} _ZN5Botan6concatINSt3__16vectorIhNS_16secure_allocatorIhEEEETpTkNS_6ranges14spanable_rangeEJRNS1_4spanIKhLm18446744073709551615EEESA_EEEDaDpOT0_Q10all_same_vIDpNS1_11conditionalIXsr21__is_primary_templateINS1_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS1_6ranges5__cpo5beginEEclsr3stdE7declvalIRSB_EEEEEEEEE5valueENS1_26indirectly_readable_traitsISK_EESL_E4type10value_typeEE: 97| 2.57k|{ 98| | if constexpr(std::same_as) { 99| | // Try to auto-detect a reasonable output type given the input ranges 100| | static_assert(sizeof...(Rs) > 0, "Cannot auto-detect the output type if not a single input range is provided."); 101| | using candidate_result_t = std::remove_cvref_t>>; 102| | using result_range_value_t = std::remove_cvref_t>; 103| | 104| | if constexpr((ranges::statically_spanable_range && ...)) { 105| | // If all input ranges have a static extent, we can calculate the total size at compile time 106| | // and therefore can use a statically sized output container. This is constexpr. 107| | constexpr size_t total_size = (decltype(std::span{ranges})::extent + ... + 0); 108| | using out_array_t = std::array; 109| | return detail::concatenate(std::forward(ranges)...); 110| | } else { 111| | // If at least one input range has a dynamic extent, we must use a dynamically allocated output container. 112| | // We assume that the user wants to use the first input range's container type as output type. 113| | static_assert( 114| | concepts::reservable_container, 115| | "First input range has static extent, but a dynamically allocated output range is required. Please explicitly specify a dynamically allocatable output type."); 116| | return detail::concatenate(std::forward(ranges)...); 117| | } 118| 2.57k| } else { 119| | // The caller has explicitly specified the output type 120| 2.57k| return detail::concatenate(std::forward(ranges)...); 121| 2.57k| } 122| 2.57k|} _ZN5Botan6detail11concatenateITkNS_6ranges14spanable_rangeENSt3__16vectorIhNS_16secure_allocatorIhEEEETpTkNS2_14spanable_rangeEJRNS3_4spanIKhLm18446744073709551615EEESB_EEET_DpOT0_Qoosr8conceptsE20reservable_containerISC_Esr6rangesE25statically_spanable_rangeISC_E: 36| 2.57k|{ 37| 2.57k| OutR result{}; 38| | 39| | // Prepare and validate the output range and construct a lambda that does the 40| | // actual filling of the result buffer. 41| | // (if no input ranges are given, GCC claims that fill_fn is unused) 42| | // NOLINTNEXTLINE(*-const-correctness) the fixed-size branch returns a mutable lambda 43| 2.57k| [[maybe_unused]] auto fill_fn = [&] { 44| 2.57k| if constexpr(concepts::reservable_container) { 45| | // dynamically allocate the correct result byte length 46| 2.57k| const size_t total_size = (ranges.size() + ... + 0); 47| 2.57k| result.reserve(total_size); 48| | 49| | // append each input as a whole range, so contiguous byte 50| | // buffers are copied with memcpy rather than element by element 51| 2.57k| return [&result](auto&& range) { 52| 2.57k| auto& out = unwrap_strong_type(result); 53| 2.57k| out.insert(out.end(), std::ranges::begin(range), std::ranges::end(range)); 54| 2.57k| }; 55| 2.57k| } else { 56| 2.57k| if constexpr((ranges::statically_spanable_range && ... && true)) { 57| | // all input ranges have a static extent, so check the total size at compile time 58| | // (work around an issue in MSVC that warns `total_size` is unused) 59| 2.57k| [[maybe_unused]] constexpr size_t total_size = (decltype(std::span{ranges})::extent + ... + 0); 60| 2.57k| static_assert(result.size() == total_size, "size of result buffer does not match the sum of input buffers"); 61| 2.57k| } else { 62| | // at least one input range has a dynamic extent, so check the total size at runtime 63| 2.57k| const size_t total_size = (ranges.size() + ... + 0); 64| 2.57k| BOTAN_ARG_CHECK(result.size() == total_size, 65| 2.57k| "result buffer has static extent that does not match the sum of input buffers"); 66| 2.57k| } 67| | 68| | // fill the result buffer and hold the current output-iterator position 69| 2.57k| return [itr = std::ranges::begin(result)](auto&& range) mutable { 70| 2.57k| std::copy(std::ranges::begin(range), std::ranges::end(range), itr); 71| 2.57k| std::advance(itr, std::ranges::size(range)); 72| 2.57k| }; 73| 2.57k| } 74| 2.57k| }(); 75| | 76| | // perform the actual concatenation 77| 2.57k| (fill_fn(std::forward(ranges)), ...); 78| | 79| 2.57k| return result; 80| 2.57k|} _ZZN5Botan6detail11concatenateITkNS_6ranges14spanable_rangeENSt3__16vectorIhNS_16secure_allocatorIhEEEETpTkNS2_14spanable_rangeEJRNS3_4spanIKhLm18446744073709551615EEESB_EEET_DpOT0_Qoosr8conceptsE20reservable_containerISC_Esr6rangesE25statically_spanable_rangeISC_EENKUlvE_clEv: 43| 2.57k| [[maybe_unused]] auto fill_fn = [&] { 44| 2.57k| if constexpr(concepts::reservable_container) { 45| | // dynamically allocate the correct result byte length 46| 2.57k| const size_t total_size = (ranges.size() + ... + 0); 47| 2.57k| result.reserve(total_size); 48| | 49| | // append each input as a whole range, so contiguous byte 50| | // buffers are copied with memcpy rather than element by element 51| 2.57k| return [&result](auto&& range) { 52| 2.57k| auto& out = unwrap_strong_type(result); 53| 2.57k| out.insert(out.end(), std::ranges::begin(range), std::ranges::end(range)); 54| 2.57k| }; 55| | } else { 56| | if constexpr((ranges::statically_spanable_range && ... && true)) { 57| | // all input ranges have a static extent, so check the total size at compile time 58| | // (work around an issue in MSVC that warns `total_size` is unused) 59| | [[maybe_unused]] constexpr size_t total_size = (decltype(std::span{ranges})::extent + ... + 0); 60| | static_assert(result.size() == total_size, "size of result buffer does not match the sum of input buffers"); 61| | } else { 62| | // at least one input range has a dynamic extent, so check the total size at runtime 63| | const size_t total_size = (ranges.size() + ... + 0); 64| | BOTAN_ARG_CHECK(result.size() == total_size, 65| | "result buffer has static extent that does not match the sum of input buffers"); 66| | } 67| | 68| | // fill the result buffer and hold the current output-iterator position 69| | return [itr = std::ranges::begin(result)](auto&& range) mutable { 70| | std::copy(std::ranges::begin(range), std::ranges::end(range), itr); 71| | std::advance(itr, std::ranges::size(range)); 72| | }; 73| | } 74| 2.57k| }(); _ZZZN5Botan6detail11concatenateITkNS_6ranges14spanable_rangeENSt3__16vectorIhNS_16secure_allocatorIhEEEETpTkNS2_14spanable_rangeEJRNS3_4spanIKhLm18446744073709551615EEESB_EEET_DpOT0_Qoosr8conceptsE20reservable_containerISC_Esr6rangesE25statically_spanable_rangeISC_EENKUlvE_clEvENKUlOSC_E_clISB_EEDaSH_: 51| 5.15k| return [&result](auto&& range) { 52| 5.15k| auto& out = unwrap_strong_type(result); 53| 5.15k| out.insert(out.end(), std::ranges::begin(range), std::ranges::end(range)); 54| 5.15k| }; _ZN5Botan6concatINS_6detail10AutoDetectETpTkNS_6ranges14spanable_rangeEJNSt3__15arrayIhLm1EEENS5_IhLm2EEES7_EEEDaDpOT0_Q10all_same_vIDpNS4_11conditionalIXsr21__is_primary_templateINS4_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS4_6ranges5__cpo5beginEEclsr3stdE7declvalIRS8_EEEEEEEEE5valueENS4_26indirectly_readable_traitsISH_EESI_E4type10value_typeEE: 97| 2.30k|{ 98| 2.30k| if constexpr(std::same_as) { 99| | // Try to auto-detect a reasonable output type given the input ranges 100| 2.30k| static_assert(sizeof...(Rs) > 0, "Cannot auto-detect the output type if not a single input range is provided."); 101| 2.30k| using candidate_result_t = std::remove_cvref_t>>; 102| 2.30k| using result_range_value_t = std::remove_cvref_t>; 103| | 104| 2.30k| if constexpr((ranges::statically_spanable_range && ...)) { 105| | // If all input ranges have a static extent, we can calculate the total size at compile time 106| | // and therefore can use a statically sized output container. This is constexpr. 107| 2.30k| constexpr size_t total_size = (decltype(std::span{ranges})::extent + ... + 0); 108| 2.30k| using out_array_t = std::array; 109| 2.30k| return detail::concatenate(std::forward(ranges)...); 110| | } else { 111| | // If at least one input range has a dynamic extent, we must use a dynamically allocated output container. 112| | // We assume that the user wants to use the first input range's container type as output type. 113| | static_assert( 114| | concepts::reservable_container, 115| | "First input range has static extent, but a dynamically allocated output range is required. Please explicitly specify a dynamically allocatable output type."); 116| | return detail::concatenate(std::forward(ranges)...); 117| | } 118| | } else { 119| | // The caller has explicitly specified the output type 120| | return detail::concatenate(std::forward(ranges)...); 121| | } 122| 2.30k|} _ZN5Botan6detail11concatenateITkNS_6ranges14spanable_rangeENSt3__15arrayIhLm5EEETpTkNS2_14spanable_rangeEJNS4_IhLm1EEENS4_IhLm2EEES7_EEET_DpOT0_Qoosr8conceptsE20reservable_containerIS8_Esr6rangesE25statically_spanable_rangeIS8_E: 36| 2.30k|{ 37| 2.30k| OutR result{}; 38| | 39| | // Prepare and validate the output range and construct a lambda that does the 40| | // actual filling of the result buffer. 41| | // (if no input ranges are given, GCC claims that fill_fn is unused) 42| | // NOLINTNEXTLINE(*-const-correctness) the fixed-size branch returns a mutable lambda 43| 2.30k| [[maybe_unused]] auto fill_fn = [&] { 44| 2.30k| if constexpr(concepts::reservable_container) { 45| | // dynamically allocate the correct result byte length 46| 2.30k| const size_t total_size = (ranges.size() + ... + 0); 47| 2.30k| result.reserve(total_size); 48| | 49| | // append each input as a whole range, so contiguous byte 50| | // buffers are copied with memcpy rather than element by element 51| 2.30k| return [&result](auto&& range) { 52| 2.30k| auto& out = unwrap_strong_type(result); 53| 2.30k| out.insert(out.end(), std::ranges::begin(range), std::ranges::end(range)); 54| 2.30k| }; 55| 2.30k| } else { 56| 2.30k| if constexpr((ranges::statically_spanable_range && ... && true)) { 57| | // all input ranges have a static extent, so check the total size at compile time 58| | // (work around an issue in MSVC that warns `total_size` is unused) 59| 2.30k| [[maybe_unused]] constexpr size_t total_size = (decltype(std::span{ranges})::extent + ... + 0); 60| 2.30k| static_assert(result.size() == total_size, "size of result buffer does not match the sum of input buffers"); 61| 2.30k| } else { 62| | // at least one input range has a dynamic extent, so check the total size at runtime 63| 2.30k| const size_t total_size = (ranges.size() + ... + 0); 64| 2.30k| BOTAN_ARG_CHECK(result.size() == total_size, 65| 2.30k| "result buffer has static extent that does not match the sum of input buffers"); 66| 2.30k| } 67| | 68| | // fill the result buffer and hold the current output-iterator position 69| 2.30k| return [itr = std::ranges::begin(result)](auto&& range) mutable { 70| 2.30k| std::copy(std::ranges::begin(range), std::ranges::end(range), itr); 71| 2.30k| std::advance(itr, std::ranges::size(range)); 72| 2.30k| }; 73| 2.30k| } 74| 2.30k| }(); 75| | 76| | // perform the actual concatenation 77| 2.30k| (fill_fn(std::forward(ranges)), ...); 78| | 79| 2.30k| return result; 80| 2.30k|} _ZZN5Botan6detail11concatenateITkNS_6ranges14spanable_rangeENSt3__15arrayIhLm5EEETpTkNS2_14spanable_rangeEJNS4_IhLm1EEENS4_IhLm2EEES7_EEET_DpOT0_Qoosr8conceptsE20reservable_containerIS8_Esr6rangesE25statically_spanable_rangeIS8_EENKUlvE_clEv: 43| 2.30k| [[maybe_unused]] auto fill_fn = [&] { 44| | if constexpr(concepts::reservable_container) { 45| | // dynamically allocate the correct result byte length 46| | const size_t total_size = (ranges.size() + ... + 0); 47| | result.reserve(total_size); 48| | 49| | // append each input as a whole range, so contiguous byte 50| | // buffers are copied with memcpy rather than element by element 51| | return [&result](auto&& range) { 52| | auto& out = unwrap_strong_type(result); 53| | out.insert(out.end(), std::ranges::begin(range), std::ranges::end(range)); 54| | }; 55| 2.30k| } else { 56| 2.30k| if constexpr((ranges::statically_spanable_range && ... && true)) { 57| | // all input ranges have a static extent, so check the total size at compile time 58| | // (work around an issue in MSVC that warns `total_size` is unused) 59| 2.30k| [[maybe_unused]] constexpr size_t total_size = (decltype(std::span{ranges})::extent + ... + 0); 60| 2.30k| static_assert(result.size() == total_size, "size of result buffer does not match the sum of input buffers"); 61| | } else { 62| | // at least one input range has a dynamic extent, so check the total size at runtime 63| | const size_t total_size = (ranges.size() + ... + 0); 64| | BOTAN_ARG_CHECK(result.size() == total_size, 65| | "result buffer has static extent that does not match the sum of input buffers"); 66| | } 67| | 68| | // fill the result buffer and hold the current output-iterator position 69| 2.30k| return [itr = std::ranges::begin(result)](auto&& range) mutable { 70| 2.30k| std::copy(std::ranges::begin(range), std::ranges::end(range), itr); 71| 2.30k| std::advance(itr, std::ranges::size(range)); 72| 2.30k| }; 73| 2.30k| } 74| 2.30k| }(); _ZZZN5Botan6detail11concatenateITkNS_6ranges14spanable_rangeENSt3__15arrayIhLm5EEETpTkNS2_14spanable_rangeEJNS4_IhLm1EEENS4_IhLm2EEES7_EEET_DpOT0_Qoosr8conceptsE20reservable_containerIS8_Esr6rangesE25statically_spanable_rangeIS8_EENKUlvE_clEvENUlOS8_E_clIS6_EEDaSD_: 69| 2.30k| return [itr = std::ranges::begin(result)](auto&& range) mutable { 70| 2.30k| std::copy(std::ranges::begin(range), std::ranges::end(range), itr); 71| 2.30k| std::advance(itr, std::ranges::size(range)); 72| 2.30k| }; _ZZZN5Botan6detail11concatenateITkNS_6ranges14spanable_rangeENSt3__15arrayIhLm5EEETpTkNS2_14spanable_rangeEJNS4_IhLm1EEENS4_IhLm2EEES7_EEET_DpOT0_Qoosr8conceptsE20reservable_containerIS8_Esr6rangesE25statically_spanable_rangeIS8_EENKUlvE_clEvENUlOS8_E_clIS7_EEDaSD_: 69| 4.61k| return [itr = std::ranges::begin(result)](auto&& range) mutable { 70| 4.61k| std::copy(std::ranges::begin(range), std::ranges::end(range), itr); 71| 4.61k| std::advance(itr, std::ranges::size(range)); 72| 4.61k| }; _ZN5Botan6appendIhNS_16secure_allocatorIhEEQsr3stdE23is_trivially_copyable_vIT_EEEvRNSt3__16vectorIS3_T0_EENS4_13type_identityINS4_4spanIKS3_Lm18446744073709551615EEEE4typeE: 132| 4.61k|void append(std::vector& out, std::type_identity_t> in) { 133| 4.61k| const size_t offset = out.size(); 134| 4.61k| out.resize(offset + in.size()); 135| 4.61k| copy_mem(std::span{out}.subspan(offset), in); 136| 4.61k|} _ZN5Botan5CPUID3hasENS_10CPUFeatureE: 93| 187k| static bool has(CPUID::Feature feat) { return state().has_bit(feat.as_u32()); } _ZN5Botan5CPUID3hasENS_10CPUFeatureES1_: 98| 15.6M| static bool has(CPUID::Feature feat1, CPUID::Feature feat2) { 99| 15.6M| return state().has_bit(feat1.as_u32() | feat2.as_u32()); 100| 15.6M| } _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| } _ZNK5Botan5CPUID10CPUID_Data7has_bitEj: 143| 15.8M| bool has_bit(uint32_t bit) const { return (m_processor_features & bit) == bit; } _ZN5Botan5CPUID5stateEv: 155| 15.8M| static CPUID_Data& state() { 156| 15.8M| static CPUID::CPUID_Data g_cpuid; 157| 15.8M| return g_cpuid; 158| 15.8M| } 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| } _ZN5Botan10CPUFeatureC2ENS0_3BitE: 54| 31.5M| CPUFeature(Bit b) : m_bit(b) {} // NOLINT(*-explicit-conversions,*-explicit-constructor) _ZNK5Botan10CPUFeature6as_u32Ev: 56| 31.5M| uint32_t as_u32() const { return static_cast(m_bit); } _ZN5Botan2CT8is_equalIhEENS0_4MaskIT_EEPKS3_S6_m: 798| 6.93k|constexpr inline CT::Mask is_equal(const T x[], const T y[], size_t len) { 799| 6.93k| if(std::is_constant_evaluated()) { ------------------ | Branch (799:7): [Folded, False: 6.93k] ------------------ 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| 6.93k| } else { 808| 6.93k| volatile T difference = 0; 809| | 810| 420k| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (810:25): [True: 413k, False: 6.93k] ------------------ 811| 413k| difference = difference | (x[i] ^ y[i]); 812| 413k| } 813| | 814| 6.93k| return CT::Mask::is_zero(difference); 815| 6.93k| } 816| 6.93k|} _ZN5Botan2CT4MaskIhE7is_zeroEh: 437| 16.0k| static constexpr Mask is_zero(T x) { return Mask(ct_is_zero(value_barrier(x))); } _ZN5Botan2CT4MaskIhEC2Eh: 637| 16.8k| constexpr explicit Mask(T m) : m_mask(m) {} _ZNK5Botan2CT4MaskIhE7as_boolEv: 614| 6.90k| constexpr bool as_bool() const { return unpoisoned_value() != 0; } _ZNK5Botan2CT4MaskIhE16unpoisoned_valueEv: 598| 15.9k| constexpr T unpoisoned_value() const { 599| 15.9k| T r = value(); 600| 15.9k| CT::unpoison(r); 601| 15.9k| return r; 602| 15.9k| } _ZNK5Botan2CT4MaskIhE5valueEv: 630| 17.3k| constexpr T value() const { return value_barrier(m_mask); } _ZN5Botan2CT8unpoisonITkNSt3__18integralEhEEvRKT_: 112| 16.0k|constexpr void unpoison(const T& p) { 113| 16.0k| unpoison(&p, 1); 114| 16.0k|} _ZN5Botan2CT8unpoisonIhEEvPKT_m: 67| 26.2k|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| 26.2k| BOTAN_UNUSED(p, n); ------------------ | | 151| 26.2k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 75| 26.2k|} _ZN5Botan2CT6Choice9from_maskEm: 303| 19.4M| constexpr static Choice from_mask(underlying_type v) { return Choice(v); } _ZN5Botan2CT6Choice2noEv: 307| 6| constexpr static Choice no() { return Choice(0); } _ZNK5Botan2CT6ChoicentEv: 309| 586k| constexpr Choice operator!() const { return Choice(~value()); } _ZNK5Botan2CT6ChoiceaaERKS1_: 311| 2.33M| constexpr Choice operator&&(const Choice& other) const { return Choice(value() & other.value()); } _ZNK5Botan2CT6ChoiceooERKS1_: 313| 22.7k| constexpr Choice operator||(const Choice& other) const { return Choice(value() | other.value()); } _ZNK5Botan2CT6ChoiceneERKS1_: 315| 1.41k| constexpr Choice operator!=(const Choice& other) const { return Choice(value() ^ other.value()); } _ZNK5Botan2CT6Choice7as_boolEv: 329| 649k| constexpr bool as_bool() const { return m_value != 0; } _ZNK5Botan2CT6Choice5valueEv: 332| 22.9M| constexpr underlying_type value() const { return value_barrier(m_value); } _ZN5Botan2CT6ChoiceC2Em: 341| 22.4M| constexpr explicit Choice(underlying_type v) : m_value(CT::value_barrier(v)) {} _ZN5Botan2CT4MaskImE7is_zeroEm: 437| 39.1M| static constexpr Mask is_zero(T x) { return Mask(ct_is_zero(value_barrier(x))); } _ZNK5Botan2CT4MaskImE5valueEv: 630| 55.6M| constexpr T value() const { return value_barrier(m_mask); } _ZNK5Botan2CT4MaskImEcoEv: 533| 15.2M| constexpr Mask operator~() const { return Mask(~value()); } _ZN5Botan2CT4MaskImE6expandEm: 392| 15.2M| static constexpr Mask expand(T v) { return ~Mask::is_zero(value_barrier(v)); } _ZNK5Botan2CT4MaskImE6selectEmm: 548| 1.46M| constexpr T select(T x, T y) const { return choose(value(), x, y); } _ZNK5Botan2CT4MaskImE16conditional_swapImEEvRT_S5_QlestTL0__stS4_: 587| 113k| { 588| 113k| const auto cnd = Mask(*this); 589| 113k| U t0 = cnd.select(y, x); 590| 113k| U t1 = cnd.select(x, y); 591| 113k| x = t0; 592| 113k| y = t1; 593| 113k| } _ZN5Botan2CT6poisonIhEEvPKT_m: 56| 10.2k|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| 10.2k| BOTAN_UNUSED(p, n); ------------------ | | 151| 10.2k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 64| 10.2k|} _ZN5Botan2CT8unpoisonItEEvPKT_m: 67| 129|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| 129| BOTAN_UNUSED(p, n); ------------------ | | 151| 129|#define BOTAN_UNUSED Botan::ignore_params ------------------ 75| 129|} _ZN5Botan2CT4MaskIhE8is_equalEhh: 442| 8.24k| static constexpr Mask is_equal(T x, T y) { 443| 8.24k| const T diff = value_barrier(x) ^ value_barrier(y); 444| 8.24k| return Mask::is_zero(diff); 445| 8.24k| } _ZN5Botan2CT4MaskImE14expand_top_bitEm: 415| 410k| static constexpr Mask expand_top_bit(T v) { return Mask(ct_expand_top_bit(v)); } _ZN5Botan2CT4MaskImEC2Em: 637| 54.9M| constexpr explicit Mask(T m) : m_mask(m) {} _ZN5Botan2CT4MaskImE5is_ltEmm: 450| 408k| static constexpr Mask is_lt(T x, T y) { 451| 408k| T u = x ^ ((x ^ y) | ((x - y) ^ x)); 452| 408k| return Mask::expand_top_bit(u); 453| 408k| } _ZNK5Botan2CT4MaskImE13if_set_returnEm: 538| 9.12k| constexpr T if_set_return(T x) const { return value() & x; } _ZN5Botan2CT4MaskImE8is_equalEmm: 442| 16.2M| static constexpr Mask is_equal(T x, T y) { 443| 16.2M| const T diff = value_barrier(x) ^ value_barrier(y); 444| 16.2M| return Mask::is_zero(diff); 445| 16.2M| } _ZN5Botan2CT8unpoisonITkNSt3__18integralEmEEvRKT_: 112| 19.6M|constexpr void unpoison(const T& p) { 113| 19.6M| unpoison(&p, 1); 114| 19.6M|} _ZN5Botan2CT8unpoisonImEEvPKT_m: 67| 19.8M|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| 19.8M| BOTAN_UNUSED(p, n); ------------------ | | 151| 19.8M|#define BOTAN_UNUSED Botan::ignore_params ------------------ 75| 19.8M|} _ZN5Botan2CT4MaskImE5is_gtEmm: 458| 1.02k| static constexpr Mask is_gt(T x, T y) { return Mask::is_lt(y, x); } _ZN5Botan2CT4MaskImE6is_gteEmm: 468| 1.77k| static constexpr Mask is_gte(T x, T y) { return ~Mask::is_lt(x, y); } _ZNK5Botan2CT4MaskImE16unpoisoned_valueEv: 598| 19.4M| constexpr T unpoisoned_value() const { 599| 19.4M| T r = value(); 600| 19.4M| CT::unpoison(r); 601| 19.4M| return r; 602| 19.4M| } _ZNK5Botan2CT4MaskImE9as_choiceEv: 619| 19.4M| constexpr CT::Choice as_choice() const { 620| 19.4M| if constexpr(sizeof(T) >= sizeof(Choice::underlying_type)) { 621| 19.4M| return CT::Choice::from_mask(static_cast(unpoisoned_value())); 622| | } else { 623| | return CT::Choice::from_int(unpoisoned_value()); 624| | } 625| 19.4M| } _ZNK5Botan2CT4MaskImE7as_boolEv: 614| 26.9k| constexpr bool as_bool() const { return unpoisoned_value() != 0; } _ZNK5Botan2CT4MaskImE11select_maskES2_S2_: 559| 122k| Mask select_mask(Mask x, Mask y) const { return Mask(select(x.value(), y.value())); } _ZN5Botan2CT4MaskImEaNES2_: 494| 49| Mask& operator&=(Mask o) { 495| 49| m_mask &= o.value(); 496| 49| return (*this); 497| 49| } _ZNK5Botan2CT4MaskImE8select_nEPmPKmS5_m: 565| 9.31M| constexpr void select_n(T output[], const T x[], const T y[], size_t len) const { 566| 9.31M| const T mask = value(); 567| 67.0M| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (567:28): [True: 57.7M, False: 9.31M] ------------------ 568| 57.7M| output[i] = choose(mask, x[i], y[i]); 569| 57.7M| } 570| 9.31M| } _ZN5Botan2CT4MaskIhE6expandEh: 392| 832| static constexpr Mask expand(T v) { return ~Mask::is_zero(value_barrier(v)); } _ZNK5Botan2CT4MaskIhEcoEv: 533| 832| constexpr Mask operator~() const { return Mask(~value()); } _ZNK5Botan2CT4MaskIhE6selectEhh: 548| 472| constexpr T select(T x, T y) const { return choose(value(), x, y); } _ZN5Botan2CT6poisonImEEvPKT_m: 56| 30.4k|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| 30.4k| BOTAN_UNUSED(p, n); ------------------ | | 151| 30.4k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 64| 30.4k|} _ZN5Botan2CTorENS0_4MaskImEES2_: 528| 1.74k| friend constexpr Mask operator|(Mask x, Mask y) { return Mask(x.value() | y.value()); } _ZN5Botan2CTanENS0_4MaskImEES2_: 518| 588| friend constexpr Mask operator&(Mask x, Mask y) { return Mask(x.value() & y.value()); } _ZN5Botan2CT20conditional_copy_memImEENS0_4MaskIT_EES3_PS3_PKS3_S7_m: 738| 48|constexpr inline Mask conditional_copy_mem(T cnd, T* dest, const T* if_set, const T* if_unset, size_t elems) { 739| 48| const auto mask = CT::Mask::expand(cnd); 740| 48| return CT::conditional_copy_mem(mask, dest, if_set, if_unset, elems); 741| 48|} _ZN5Botan2CT20conditional_copy_memImEENS0_4MaskIT_EES4_PS3_PKS3_S7_m: 732| 48|constexpr inline Mask conditional_copy_mem(Mask mask, T* dest, const T* if_set, const T* if_unset, size_t elems) { 733| 48| mask.select_n(dest, if_set, if_unset, elems); 734| 48| return mask; 735| 48|} _ZN5Botan2CTeoENS0_4MaskImEES2_: 523| 510| friend constexpr Mask operator^(Mask x, Mask y) { return Mask(x.value() ^ y.value()); } _ZN5Botan2CT8is_equalIhEENS0_4MaskIT_EENSt3__14spanIKS3_Lm18446744073709551615EEES8_: 825| 494|constexpr inline CT::Mask is_equal(std::span x, std::span y) { 826| 494| if(x.size() != y.size()) { ------------------ | Branch (826:7): [True: 2, False: 492] ------------------ 827| 2| return CT::Mask::cleared(); 828| 2| } 829| | 830| 492| return is_equal(x.data(), y.data(), x.size()); 831| 494|} _ZN5Botan2CT4MaskIhE7clearedEv: 387| 2| static constexpr Mask cleared() { return Mask(0); } _ZN5Botan2CT9all_zerosIhEENS0_4MaskIT_EEPKS3_m: 785| 4|constexpr inline CT::Mask all_zeros(const T elem[], size_t len) { 786| 4| T sum = 0; 787| 180| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (787:22): [True: 176, False: 4] ------------------ 788| 176| sum |= elem[i]; 789| 176| } 790| 4| return CT::Mask::is_zero(sum); 791| 4|} _ZN5Botan2CT6poisonITkNS_6ranges14spanable_rangeENSt3__14spanIKhLm32EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEnt17custom_poisonableISB_EEEvRKSB_: 121| 17|constexpr void poison(const R& r) { 122| 17| const std::span s{r}; 123| 17| poison(s.data(), s.size()); 124| 17|} _ZN5Botan2CT4MaskImE7clearedEv: 387| 20| static constexpr Mask cleared() { return Mask(0); } _ZN5Botan2CT4MaskImE10expand_bitEmm: 421| 510| static constexpr Mask expand_bit(T v, size_t bit) { 422| 510| return CT::Mask::expand_top_bit(v << (sizeof(v) * 8 - 1 - bit)); 423| 510| } _ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__14spanIKhLm32EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISE_EESF_E4type10value_typeEEnt19custom_unpoisonableISB_EEEvRKSB_: 128| 17|constexpr void unpoison(const R& r) { 129| 17| const std::span s{r}; 130| 17| unpoison(s.data(), s.size()); 131| 17|} _ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__14spanIhLm32EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt19custom_unpoisonableISA_EEEvRKSA_: 128| 15|constexpr void unpoison(const R& r) { 129| 15| const std::span s{r}; 130| 15| unpoison(s.data(), s.size()); 131| 15|} _ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__15arrayIhLm56EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt19custom_unpoisonableISA_EEEvRKSA_: 128| 16|constexpr void unpoison(const R& r) { 129| 16| const std::span s{r}; 130| 16| unpoison(s.data(), s.size()); 131| 16|} _ZN5Botan2CT13scoped_poisonIJNSt3__16vectorIhNS_16secure_allocatorIhEEEEEQaaaagtsZT_Li0Efraa10poisonableIT_Efraa12unpoisonableIS7_EEEDaDpRKS7_: 222| 18|[[nodiscard]] constexpr auto scoped_poison(const Ts&... xs) { 223| 18| auto scope = scoped_cleanup([&] { unpoison_all(xs...); }); 224| 18| poison_all(xs...); 225| 18| return scope; 226| 18|} _ZN5Botan2CT10poison_allITpTkNS0_10poisonableEJNSt3__16vectorIhNS_16secure_allocatorIhEEEEEQgtsZT_Li0EEEvDpRKT_: 201| 18|constexpr void poison_all(const Ts&... ts) { 202| 18| (poison(ts), ...); 203| 18|} _ZN5Botan2CT6poisonITkNS_6ranges14spanable_rangeENSt3__16vectorIhNS_16secure_allocatorIhEEEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEnt17custom_poisonableISC_EEEvRKSC_: 121| 18|constexpr void poison(const R& r) { 122| 18| const std::span s{r}; 123| 18| poison(s.data(), s.size()); 124| 18|} _ZZN5Botan2CT13scoped_poisonIJNSt3__16vectorIhNS_16secure_allocatorIhEEEEEQaaaagtsZT_Li0Efraa10poisonableIT_Efraa12unpoisonableIS7_EEEDaDpRKS7_ENKUlvE_clEv: 223| 18| auto scope = scoped_cleanup([&] { unpoison_all(xs...); }); _ZN5Botan2CT12unpoison_allITpTkNS0_12unpoisonableEJNSt3__16vectorIhNS_16secure_allocatorIhEEEEEQgtsZT_Li0EEEvDpRKT_: 207| 18|constexpr void unpoison_all(const Ts&... ts) { 208| 18| (unpoison(ts), ...); 209| 18|} _ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__16vectorIhNS_16secure_allocatorIhEEEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEnt19custom_unpoisonableISC_EEEvRKSC_: 128| 20|constexpr void unpoison(const R& r) { 129| 20| const std::span s{r}; 130| 20| unpoison(s.data(), s.size()); 131| 20|} _ZN5Botan2CT4MaskImEeOES2_: 502| 8.06k| Mask& operator^=(Mask o) { 503| 8.06k| m_mask ^= o.value(); 504| 8.06k| return (*this); 505| 8.06k| } _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| 144|constexpr void unpoison(const R& r) { 129| 144| const std::span s{r}; 130| 144| unpoison(s.data(), s.size()); 131| 144|} _ZN5Botan2CT9all_zerosImEENS0_4MaskIT_EEPKS3_m: 785| 3.56M|constexpr inline CT::Mask all_zeros(const T elem[], size_t len) { 786| 3.56M| T sum = 0; 787| 22.2M| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (787:22): [True: 18.6M, False: 3.56M] ------------------ 788| 18.6M| sum |= elem[i]; 789| 18.6M| } 790| 3.56M| return CT::Mask::is_zero(sum); 791| 3.56M|} _ZN5Botan2CT4MaskItEC2Et: 637| 46.1k| constexpr explicit Mask(T m) : m_mask(m) {} _ZN5Botan2CT4MaskItE14expand_top_bitEt: 415| 9.23k| static constexpr Mask expand_top_bit(T v) { return Mask(ct_expand_top_bit(v)); } _ZNK5Botan2CT4MaskItEcoEv: 533| 18.4k| constexpr Mask operator~() const { return Mask(~value()); } _ZNK5Botan2CT4MaskItE5valueEv: 630| 46.1k| constexpr T value() const { return value_barrier(m_mask); } _ZNK5Botan2CT4MaskItE7as_boolEv: 614| 43| constexpr bool as_bool() const { return unpoisoned_value() != 0; } _ZNK5Botan2CT4MaskItE16unpoisoned_valueEv: 598| 43| constexpr T unpoisoned_value() const { 599| 43| T r = value(); 600| 43| CT::unpoison(r); 601| 43| return r; 602| 43| } _ZN5Botan2CT8unpoisonITkNSt3__18integralEtEEvRKT_: 112| 129|constexpr void unpoison(const T& p) { 113| 129| unpoison(&p, 1); 114| 129|} _ZN5Botan2CT4MaskIhEC2ImEENS1_IT_EE: 375| 472| constexpr explicit Mask(Mask o) : m_mask(static_cast(o.value())) { 376| 472| static_assert(sizeof(U) > sizeof(T), "sizes ok"); 377| 472| } _ZN5Botan2CT6Choice8from_intIjQaasr3stdE17unsigned_integralIT_Entsr3stdE7same_asIbS3_EEES1_S3_: 268| 54| constexpr static Choice from_int(T v) { 269| 54| if constexpr(sizeof(T) <= sizeof(underlying_type)) { 270| 54| 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| 54| } _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| 48|constexpr void poison(const R& r) { 122| 48| const std::span s{r}; 123| 48| poison(s.data(), s.size()); 124| 48|} _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| 48|constexpr void unpoison(const R& r) { 129| 48| const std::span s{r}; 130| 48| unpoison(s.data(), s.size()); 131| 48|} _ZN5Botan2CT22conditional_assign_memImEENS0_4MaskIT_EES3_PS3_PKS3_m: 749| 9.31M|constexpr inline Mask conditional_assign_mem(T cnd, T* dest, const T* src, size_t elems) { 750| 9.31M| const auto mask = CT::Mask::expand(cnd); 751| 9.31M| mask.select_n(dest, src, dest, elems); 752| 9.31M| return mask; 753| 9.31M|} _ZN5Botan2CT8is_equalImEENS0_4MaskIT_EEPKS3_S6_m: 798| 18.2k|constexpr inline CT::Mask is_equal(const T x[], const T y[], size_t len) { 799| 18.2k| if(std::is_constant_evaluated()) { ------------------ | Branch (799:7): [Folded, False: 18.2k] ------------------ 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| 18.2k| } else { 808| 18.2k| volatile T difference = 0; 809| | 810| 101k| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (810:25): [True: 83.2k, False: 18.2k] ------------------ 811| 83.2k| difference = difference | (x[i] ^ y[i]); 812| 83.2k| } 813| | 814| 18.2k| return CT::Mask::is_zero(difference); 815| 18.2k| } 816| 18.2k|} _ZNK5Botan2CT6Choice12into_bitmaskImQaasr3stdE17unsigned_integralIT_Entsr3stdE7same_asIbS3_EEES3_v: 291| 17.6M| constexpr T into_bitmask() const { 292| 17.6M| if constexpr(sizeof(T) <= sizeof(underlying_type)) { 293| | // The inner mask is already |0| or |1| so just truncate 294| 17.6M| return static_cast(value()); 295| | } else { 296| | return ~ct_is_zero(value()); 297| | } 298| 17.6M| } pcurves_brainpool256r1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES4_E11FieldParamsEEEEES9_EEEEvRKT_: 138| 842|constexpr void poison(const T& x) { 139| 842| x._const_time_poison(); 140| 842|} pcurves_brainpool256r1.cpp:_ZN5Botan2CT10poison_allITpTkNS0_10poisonableEJNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES3_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_: 201| 842|constexpr void poison_all(const Ts&... ts) { 202| 842| (poison(ts), ...); 203| 842|} pcurves_brainpool256r1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES3_E11FieldParamsEEEEEEEvRKT_: 138| 2.52k|constexpr void poison(const T& x) { 139| 2.52k| x._const_time_poison(); 140| 2.52k|} _ZN5Botan2CT6poisonITkNS_6ranges14spanable_rangeENSt3__15arrayImLm4EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt17custom_poisonableISA_EEEvRKSA_: 121| 23.7k|constexpr void poison(const R& r) { 122| 23.7k| const std::span s{r}; 123| 23.7k| poison(s.data(), s.size()); 124| 23.7k|} pcurves_brainpool256r1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES4_E11FieldParamsEEEEES9_EEEEvRKT_: 143| 842|constexpr void unpoison(const T& x) { 144| 842| x._const_time_unpoison(); 145| 842|} pcurves_brainpool256r1.cpp:_ZN5Botan2CT12unpoison_allITpTkNS0_12unpoisonableEJNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES3_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_: 207| 842|constexpr void unpoison_all(const Ts&... ts) { 208| 842| (unpoison(ts), ...); 209| 842|} pcurves_brainpool256r1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES3_E11FieldParamsEEEEEEEvRKT_: 143| 2.52k|constexpr void unpoison(const T& x) { 144| 2.52k| x._const_time_unpoison(); 145| 2.52k|} _ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__15arrayImLm4EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt19custom_unpoisonableISA_EEEvRKSA_: 128| 23.7k|constexpr void unpoison(const R& r) { 129| 23.7k| const std::span s{r}; 130| 23.7k| unpoison(s.data(), s.size()); 131| 23.7k|} _ZN5Botan2CT6Choice8from_intIhQaasr3stdE17unsigned_integralIT_Entsr3stdE7same_asIbS3_EEES1_S3_: 268| 9.08k| constexpr static Choice from_int(T v) { 269| 9.08k| if constexpr(sizeof(T) <= sizeof(underlying_type)) { 270| 9.08k| 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.08k| } _ZNK5Botan2CT4MaskIhE9as_choiceEv: 619| 9.08k| 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| 9.08k| } else { 623| 9.08k| return CT::Choice::from_int(unpoisoned_value()); 624| 9.08k| } 625| 9.08k| } pcurves_brainpool256r1.cpp:_ZN5Botan2CT6OptionINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES3_E11FieldParamsEEEEEEC2ESC_NS0_6ChoiceE: 653| 360| constexpr Option(T v, Choice valid) : m_has_value(valid), m_value(std::move(v)) {} pcurves_brainpool256r1.cpp:_ZNK5Botan2CT6OptionINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES3_E11FieldParamsEEEEEE19as_optional_vartimeEv: 710| 360| constexpr std::optional as_optional_vartime() const { 711| 360| if(m_has_value.as_bool()) { ------------------ | Branch (711:13): [True: 299, False: 61] ------------------ 712| 299| return {m_value}; 713| 299| } else { 714| 61| return {}; 715| 61| } 716| 360| } _ZN5Botan2CT6Choice8from_intImQaasr3stdE17unsigned_integralIT_Entsr3stdE7same_asIbS3_EEES1_S3_: 268| 1.41k| constexpr static Choice from_int(T v) { 269| 1.41k| if constexpr(sizeof(T) <= sizeof(underlying_type)) { 270| 1.41k| 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| 1.41k| } pcurves_brainpool384r1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES4_E11FieldParamsEEEEES9_EEEEvRKT_: 138| 519|constexpr void poison(const T& x) { 139| 519| x._const_time_poison(); 140| 519|} pcurves_brainpool384r1.cpp:_ZN5Botan2CT10poison_allITpTkNS0_10poisonableEJNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES3_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_: 201| 519|constexpr void poison_all(const Ts&... ts) { 202| 519| (poison(ts), ...); 203| 519|} pcurves_brainpool384r1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES3_E11FieldParamsEEEEEEEvRKT_: 138| 1.55k|constexpr void poison(const T& x) { 139| 1.55k| x._const_time_poison(); 140| 1.55k|} _ZN5Botan2CT6poisonITkNS_6ranges14spanable_rangeENSt3__15arrayImLm6EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt17custom_poisonableISA_EEEvRKSA_: 121| 3.30k|constexpr void poison(const R& r) { 122| 3.30k| const std::span s{r}; 123| 3.30k| poison(s.data(), s.size()); 124| 3.30k|} pcurves_brainpool384r1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES4_E11FieldParamsEEEEES9_EEEEvRKT_: 143| 519|constexpr void unpoison(const T& x) { 144| 519| x._const_time_unpoison(); 145| 519|} pcurves_brainpool384r1.cpp:_ZN5Botan2CT12unpoison_allITpTkNS0_12unpoisonableEJNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES3_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_: 207| 519|constexpr void unpoison_all(const Ts&... ts) { 208| 519| (unpoison(ts), ...); 209| 519|} pcurves_brainpool384r1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES3_E11FieldParamsEEEEEEEvRKT_: 143| 1.55k|constexpr void unpoison(const T& x) { 144| 1.55k| x._const_time_unpoison(); 145| 1.55k|} _ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__15arrayImLm6EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt19custom_unpoisonableISA_EEEvRKSA_: 128| 3.30k|constexpr void unpoison(const R& r) { 129| 3.30k| const std::span s{r}; 130| 3.30k| unpoison(s.data(), s.size()); 131| 3.30k|} pcurves_brainpool384r1.cpp:_ZN5Botan2CT6OptionINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES3_E11FieldParamsEEEEEEC2ESC_NS0_6ChoiceE: 653| 222| constexpr Option(T v, Choice valid) : m_has_value(valid), m_value(std::move(v)) {} pcurves_brainpool384r1.cpp:_ZNK5Botan2CT6OptionINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES3_E11FieldParamsEEEEEE19as_optional_vartimeEv: 710| 222| constexpr std::optional as_optional_vartime() const { 711| 222| if(m_has_value.as_bool()) { ------------------ | Branch (711:13): [True: 168, False: 54] ------------------ 712| 168| return {m_value}; 713| 168| } else { 714| 54| return {}; 715| 54| } 716| 222| } pcurves_brainpool512r1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES4_E11FieldParamsEEEEES9_EEEEvRKT_: 138| 558|constexpr void poison(const T& x) { 139| 558| x._const_time_poison(); 140| 558|} pcurves_brainpool512r1.cpp:_ZN5Botan2CT10poison_allITpTkNS0_10poisonableEJNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES3_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_: 201| 558|constexpr void poison_all(const Ts&... ts) { 202| 558| (poison(ts), ...); 203| 558|} pcurves_brainpool512r1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES3_E11FieldParamsEEEEEEEvRKT_: 138| 1.67k|constexpr void poison(const T& x) { 139| 1.67k| x._const_time_poison(); 140| 1.67k|} _ZN5Botan2CT6poisonITkNS_6ranges14spanable_rangeENSt3__15arrayImLm8EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt17custom_poisonableISA_EEEvRKSA_: 121| 1.67k|constexpr void poison(const R& r) { 122| 1.67k| const std::span s{r}; 123| 1.67k| poison(s.data(), s.size()); 124| 1.67k|} pcurves_brainpool512r1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES4_E11FieldParamsEEEEES9_EEEEvRKT_: 143| 558|constexpr void unpoison(const T& x) { 144| 558| x._const_time_unpoison(); 145| 558|} pcurves_brainpool512r1.cpp:_ZN5Botan2CT12unpoison_allITpTkNS0_12unpoisonableEJNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES3_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_: 207| 558|constexpr void unpoison_all(const Ts&... ts) { 208| 558| (unpoison(ts), ...); 209| 558|} pcurves_brainpool512r1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES3_E11FieldParamsEEEEEEEvRKT_: 143| 1.67k|constexpr void unpoison(const T& x) { 144| 1.67k| x._const_time_unpoison(); 145| 1.67k|} _ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__15arrayImLm8EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt19custom_unpoisonableISA_EEEvRKSA_: 128| 1.67k|constexpr void unpoison(const R& r) { 129| 1.67k| const std::span s{r}; 130| 1.67k| unpoison(s.data(), s.size()); 131| 1.67k|} pcurves_brainpool512r1.cpp:_ZN5Botan2CT6OptionINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES3_E11FieldParamsEEEEEEC2ESC_NS0_6ChoiceE: 653| 259| constexpr Option(T v, Choice valid) : m_has_value(valid), m_value(std::move(v)) {} pcurves_brainpool512r1.cpp:_ZNK5Botan2CT6OptionINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES3_E11FieldParamsEEEEEE19as_optional_vartimeEv: 710| 259| constexpr std::optional as_optional_vartime() const { 711| 259| if(m_has_value.as_bool()) { ------------------ | Branch (711:13): [True: 213, False: 46] ------------------ 712| 213| return {m_value}; 713| 213| } else { 714| 46| return {}; 715| 46| } 716| 259| } _ZN5Botan2CT6poisonITkNS_6ranges14spanable_rangeENSt3__15arrayImLm9EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt17custom_poisonableISA_EEEvRKSA_: 121| 1.56k|constexpr void poison(const R& r) { 122| 1.56k| const std::span s{r}; 123| 1.56k| poison(s.data(), s.size()); 124| 1.56k|} _ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__15arrayImLm9EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt19custom_unpoisonableISA_EEEvRKSA_: 128| 1.56k|constexpr void unpoison(const R& r) { 129| 1.56k| const std::span s{r}; 130| 1.56k| unpoison(s.data(), s.size()); 131| 1.56k|} pcurves_secp256r1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS5_9secp256r16ParamsES6_E11FieldParamsEEEEES9_EEEEvRKT_: 138| 7.08k|constexpr void poison(const T& x) { 139| 7.08k| x._const_time_poison(); 140| 7.08k|} pcurves_secp256r1.cpp:_ZN5Botan2CT10poison_allITpTkNS0_10poisonableEJNS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS4_9secp256r16ParamsES5_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_: 201| 7.08k|constexpr void poison_all(const Ts&... ts) { 202| 7.08k| (poison(ts), ...); 203| 7.08k|} pcurves_secp256r1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS4_9secp256r16ParamsES5_E11FieldParamsEEEEEEEvRKT_: 138| 21.2k|constexpr void poison(const T& x) { 139| 21.2k| x._const_time_poison(); 140| 21.2k|} pcurves_secp256r1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS5_9secp256r16ParamsES6_E11FieldParamsEEEEES9_EEEEvRKT_: 143| 7.08k|constexpr void unpoison(const T& x) { 144| 7.08k| x._const_time_unpoison(); 145| 7.08k|} pcurves_secp256r1.cpp:_ZN5Botan2CT12unpoison_allITpTkNS0_12unpoisonableEJNS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS4_9secp256r16ParamsES5_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_: 207| 7.08k|constexpr void unpoison_all(const Ts&... ts) { 208| 7.08k| (unpoison(ts), ...); 209| 7.08k|} pcurves_secp256r1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS4_9secp256r16ParamsES5_E11FieldParamsEEEEEEEvRKT_: 143| 21.2k|constexpr void unpoison(const T& x) { 144| 21.2k| x._const_time_unpoison(); 145| 21.2k|} pcurves_secp256r1.cpp:_ZN5Botan2CT6OptionINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS4_9secp256r16ParamsES5_E11FieldParamsEEEEEEC2ESC_NS0_6ChoiceE: 653| 329| constexpr Option(T v, Choice valid) : m_has_value(valid), m_value(std::move(v)) {} pcurves_secp256r1.cpp:_ZNK5Botan2CT6OptionINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS4_9secp256r16ParamsES5_E11FieldParamsEEEEEE19as_optional_vartimeEv: 710| 329| constexpr std::optional as_optional_vartime() const { 711| 329| if(m_has_value.as_bool()) { ------------------ | Branch (711:13): [True: 327, False: 2] ------------------ 712| 327| return {m_value}; 713| 327| } else { 714| 2| return {}; 715| 2| } 716| 329| } pcurves_secp384r1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS5_9secp384r16ParamsES6_E11FieldParamsEEEEES9_EEEEvRKT_: 138| 584|constexpr void poison(const T& x) { 139| 584| x._const_time_poison(); 140| 584|} pcurves_secp384r1.cpp:_ZN5Botan2CT10poison_allITpTkNS0_10poisonableEJNS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_: 201| 584|constexpr void poison_all(const Ts&... ts) { 202| 584| (poison(ts), ...); 203| 584|} pcurves_secp384r1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEEEEvRKT_: 138| 1.75k|constexpr void poison(const T& x) { 139| 1.75k| x._const_time_poison(); 140| 1.75k|} pcurves_secp384r1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS5_9secp384r16ParamsES6_E11FieldParamsEEEEES9_EEEEvRKT_: 143| 584|constexpr void unpoison(const T& x) { 144| 584| x._const_time_unpoison(); 145| 584|} pcurves_secp384r1.cpp:_ZN5Botan2CT12unpoison_allITpTkNS0_12unpoisonableEJNS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_: 207| 584|constexpr void unpoison_all(const Ts&... ts) { 208| 584| (unpoison(ts), ...); 209| 584|} pcurves_secp384r1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEEEEvRKT_: 143| 1.75k|constexpr void unpoison(const T& x) { 144| 1.75k| x._const_time_unpoison(); 145| 1.75k|} pcurves_secp384r1.cpp:_ZN5Botan2CT6OptionINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEEEC2ESC_NS0_6ChoiceE: 653| 213| constexpr Option(T v, Choice valid) : m_has_value(valid), m_value(std::move(v)) {} pcurves_secp384r1.cpp:_ZNK5Botan2CT6OptionINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEEE19as_optional_vartimeEv: 710| 213| constexpr std::optional as_optional_vartime() const { 711| 213| if(m_has_value.as_bool()) { ------------------ | Branch (711:13): [True: 210, False: 3] ------------------ 712| 210| return {m_value}; 713| 210| } else { 714| 3| return {}; 715| 3| } 716| 213| } pcurves_secp521r1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS6_6ParamsES7_E11FieldParamsEEEEES9_EEEEvRKT_: 138| 520|constexpr void poison(const T& x) { 139| 520| x._const_time_poison(); 140| 520|} pcurves_secp521r1.cpp:_ZN5Botan2CT10poison_allITpTkNS0_10poisonableEJNS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_: 201| 520|constexpr void poison_all(const Ts&... ts) { 202| 520| (poison(ts), ...); 203| 520|} pcurves_secp521r1.cpp:_ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEEEEvRKT_: 138| 1.56k|constexpr void poison(const T& x) { 139| 1.56k| x._const_time_poison(); 140| 1.56k|} pcurves_secp521r1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS6_6ParamsES7_E11FieldParamsEEEEES9_EEEEvRKT_: 143| 520|constexpr void unpoison(const T& x) { 144| 520| x._const_time_unpoison(); 145| 520|} pcurves_secp521r1.cpp:_ZN5Botan2CT12unpoison_allITpTkNS0_12unpoisonableEJNS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEESC_SC_EQgtsZT_Li0EEEvDpRKT_: 207| 520|constexpr void unpoison_all(const Ts&... ts) { 208| 520| (unpoison(ts), ...); 209| 520|} pcurves_secp521r1.cpp:_ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEEEEvRKT_: 143| 1.56k|constexpr void unpoison(const T& x) { 144| 1.56k| x._const_time_unpoison(); 145| 1.56k|} pcurves_secp521r1.cpp:_ZN5Botan2CT6OptionINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEEEC2ESC_NS0_6ChoiceE: 653| 203| constexpr Option(T v, Choice valid) : m_has_value(valid), m_value(std::move(v)) {} pcurves_secp521r1.cpp:_ZNK5Botan2CT6OptionINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEEE19as_optional_vartimeEv: 710| 203| constexpr std::optional as_optional_vartime() const { 711| 203| if(m_has_value.as_bool()) { ------------------ | Branch (711:13): [True: 197, False: 6] ------------------ 712| 197| return {m_value}; 713| 197| } else { 714| 6| return {}; 715| 6| } 716| 203| } _ZNK5Botan2CT4MaskItE13if_set_returnEt: 538| 86| constexpr T if_set_return(T x) const { return value() & x; } _ZN5Botan2CT4MaskItE7is_zeroEt: 437| 9.27k| static constexpr Mask is_zero(T x) { return Mask(ct_is_zero(value_barrier(x))); } _ZN5Botan2CT4MaskItE5is_ltEtt: 450| 9.23k| static constexpr Mask is_lt(T x, T y) { 451| 9.23k| T u = x ^ ((x ^ y) | ((x - y) ^ x)); 452| 9.23k| return Mask::expand_top_bit(u); 453| 9.23k| } _ZN5Botan2CT4MaskItE5is_gtEtt: 458| 9.18k| static constexpr Mask is_gt(T x, T y) { return Mask::is_lt(y, x); } _ZN5Botan2CT4MaskItE6is_lteEtt: 463| 9.18k| static constexpr Mask is_lte(T x, T y) { return ~Mask::is_gt(x, y); } _ZN5Botan2CT4MaskItE8is_equalEtt: 442| 9.18k| static constexpr Mask is_equal(T x, T y) { 443| 9.18k| const T diff = value_barrier(x) ^ value_barrier(y); 444| 9.18k| return Mask::is_zero(diff); 445| 9.18k| } _ZN5Botan2CT4MaskItE6expandEt: 392| 43| static constexpr Mask expand(T v) { return ~Mask::is_zero(value_barrier(v)); } _ZN5Botan2CTanENS0_4MaskItEES2_: 518| 9.23k| friend constexpr Mask operator&(Mask x, Mask y) { return Mask(x.value() & y.value()); } _ZNK5Botan2CT4MaskItE17if_not_set_returnEt: 543| 43| constexpr T if_not_set_return(T x) const { return ~value() & x; } _ZN5Botan2CT4MaskItE6expandIhEES2_NS1_IT_EE: 429| 43| static constexpr Mask expand(Mask m) { 430| 43| static_assert(sizeof(U) < sizeof(T), "sizes ok"); 431| 43| return ~Mask::is_zero(m.value()); 432| 43| } _ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS0_4MaskItEEEEvRKT_: 143| 43|constexpr void unpoison(const T& x) { 144| 43| x._const_time_unpoison(); 145| 43|} _ZNK5Botan2CT4MaskItE20_const_time_unpoisonEv: 634| 43| constexpr void _const_time_unpoison() const { CT::unpoison(m_mask); } _ZN5Botan2CT4MaskItEoRES2_: 510| 9.14k| Mask& operator|=(Mask o) { 511| 9.14k| m_mask |= o.value(); 512| 9.14k| return (*this); 513| 9.14k| } _ZN5Botan9Gf448Elem3oneEv: 64| 36| static Gf448Elem one() { return Gf448Elem(1); } _ZN5Botan9Gf448Elem4zeroEv: 59| 18| static Gf448Elem zero() { return Gf448Elem(0); } _ZN5Botan9Gf448Elem5wordsEv: 120| 40.3k| std::span words() { return m_x; } _ZNK5Botan9Gf448Elem5wordsEv: 128| 40.3k| std::span words() const { return m_x; } _ZNK5Botan9TripleDES4nameEv: 50| 45| std::string name() const override { return "TripleDES"; } _ZNK5Botan9TripleDES11parallelismEv: 54| 36| size_t parallelism() const override { return 32; } _ZN5Botan11carry_shiftEom: 139| 28.7k|inline uint64_t carry_shift(const uint128_t a, size_t shift) { 140| 28.7k| return static_cast(a >> shift); 141| 28.7k|} _ZN5Botan13combine_lowerEomom: 143| 8|inline uint64_t combine_lower(const uint128_t a, size_t s1, const uint128_t b, size_t s2) { 144| 8| return static_cast((a >> s1) | (b << s2)); 145| 8|} _ZNK5Botan13EC_Group_Data3oidEv: 166| 30.9k| const OID& oid() const { return m_oid; } _ZNK5Botan13EC_Group_Data1pEv: 170| 32.7k| const BigInt& p() const { return m_p; } _ZNK5Botan13EC_Group_Data5curveEv: 181| 16.3k| const CurveGFp& curve() const { return m_curve; } _ZNK5Botan13EC_Group_Data5montyEv: 185| 81.8k| const Montgomery_Params& monty() const { return m_monty; } _ZNK5Botan13EC_Group_Data12has_cofactorEv: 196| 2.82k| bool has_cofactor() const { return m_has_cofactor; } _ZNK5Botan13EC_Group_Data7p_wordsEv: 202| 16.3k| size_t p_words() const { return m_p_words; } _ZNK5Botan13EC_Group_Data6p_bitsEv: 204| 1.41k| size_t p_bits() const { return m_p_bits; } _ZNK5Botan13EC_Group_Data7p_bytesEv: 206| 11.4k| size_t p_bytes() const { return (m_p_bits + 7) / 8; } _ZNK5Botan13EC_Group_Data11order_bytesEv: 210| 23.6k| size_t order_bytes() const { return m_order_bytes; } _ZNK5Botan13EC_Group_Data6pcurveEv: 297| 109k| const PCurve::PrimeOrderCurve& pcurve() const { 298| 109k| BOTAN_ASSERT_NONNULL(m_pcurve); ------------------ | | 123| 109k| do { \ | | 124| 109k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (124:10): [True: 0, False: 109k] | | ------------------ | | 125| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 126| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 127| 0| } \ | | 128| 109k| } while(0) | | ------------------ | | | Branch (128:12): [Folded, False: 109k] | | ------------------ ------------------ 299| 109k| return *m_pcurve; 300| 109k| } _ZN5Botan19EC_AffinePoint_DataD2Ev: 74| 20.6k| virtual ~EC_AffinePoint_Data() = default; _ZN5Botan14EC_Scalar_DataD2Ev: 39| 16.3k| virtual ~EC_Scalar_Data() = default; _ZNK5Botan17EC_Scalar_Data_PC5valueEv: 53| 17.7k| const auto& value() const { return m_v; } _ZN5Botan17EC_Scalar_Data_PCC2ENSt3__110shared_ptrIKNS_13EC_Group_DataEEENS_6PCurve15PrimeOrderCurve6ScalarE: 19| 16.3k| m_group(std::move(group)), m_v(std::move(v)) {} _ZNK5Botan17EC_PublicKey_Data5groupEv: 30| 12.9k| const EC_Group& group() const { return m_group; } _ZNK5Botan17EC_PublicKey_Data10public_keyEv: 32| 16.3k| const EC_AffinePoint& public_key() const { return m_point; } _ZNK5Botan18EC_PrivateKey_Data11private_keyEv: 73| 1.41k| const EC_Scalar& private_key() const { return m_scalar; } _ZN5Botan20Ed25519_FieldElementC2Ev: 144| 40.1k| constexpr Ed25519_FieldElement() : m_val{} {} _ZN5Botan20Ed25519_FieldElement9from_wordEm: 154| 2| constexpr static Ed25519_FieldElement from_word(word x) { 155| 2| Ed25519_FieldElement r; 156| 2| r.m_val[0] = x; 157| 2| return r; 158| 2| } _ZNK5Botan20Ed25519_FieldElement3sqrEv: 242| 884| constexpr Ed25519_FieldElement sqr() const { 243| 884| std::array z; // NOLINT(*-member-init) 244| 884| comba_sqr(z.data(), m_val.data()); 245| 884| Ed25519_FieldElement r; 246| 884| r.reduce_wide(z); 247| 884| return r; 248| 884| } _ZN5Botan20Ed25519_FieldElement11reduce_wideERKNSt3__15arrayImLm8EEE: 88| 15.3k| constexpr void reduce_wide(const std::array& z) { 89| | // t = lo + 38 * hi < 39 * 2^256, so carry <= 38 90| 15.3k| W carry = 0; 91| 76.7k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (91:28): [True: 61.4k, False: 15.3k] ------------------ 92| 61.4k| m_val[i] = word_madd3(z[i + N], W(38), z[i], &carry); 93| 61.4k| } 94| 15.3k| BOTAN_DEBUG_ASSERT(carry <= 38); ------------------ | | 137| 15.3k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 15.3k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 15.3k] | | ------------------ ------------------ 95| | 96| | // Fold the bits at and above 2^255 back in by 19. The first fold 97| | // leaves at most 19*77 above 2^255, the second leaves none. 98| 46.0k| for(size_t fold = 0; fold != 2; ++fold) { ------------------ | Branch (98:31): [True: 30.7k, False: 15.3k] ------------------ 99| 30.7k| const W top = (carry << 1) | (m_val[N - 1] >> TOP_BIT); 100| 30.7k| m_val[N - 1] &= TOP_MASK; 101| 30.7k| carry = 0; 102| | 103| 30.7k| W c = 0; 104| 30.7k| m_val[0] = word_add(m_val[0], static_cast(top * 19), &c); 105| 122k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (105:31): [True: 92.1k, False: 30.7k] ------------------ 106| 92.1k| m_val[i] = word_add(m_val[i], static_cast(0), &c); 107| 92.1k| } 108| | // The top word was masked below 2^(bits-1) so this cannot carry out 109| 30.7k| BOTAN_DEBUG_ASSERT(c == 0); ------------------ | | 137| 30.7k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 30.7k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 30.7k] | | ------------------ ------------------ 110| 30.7k| } 111| | 112| 15.3k| BOTAN_DEBUG_ASSERT((m_val[N - 1] >> TOP_BIT) == 0); ------------------ | | 137| 15.3k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 15.3k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 15.3k] | | ------------------ ------------------ 113| 15.3k| } _ZN5Botan20Ed25519_FieldElement3oneEv: 148| 1.69k| constexpr static Ed25519_FieldElement one() { 149| 1.69k| Ed25519_FieldElement o; 150| 1.69k| o.m_val[0] = 1; 151| 1.69k| return o; 152| 1.69k| } _ZNK5Botan20Ed25519_FieldElement9pow_22523Ev: 340| 1|constexpr Ed25519_FieldElement Ed25519_FieldElement::pow_22523() const { 341| 1| auto t0 = this->sqr(); 342| 1| auto t1 = t0.sqr_iter(2); 343| 1| t1 = (*this) * t1; 344| 1| t0 = t0 * t1; 345| 1| t0 = t0.sqr(); 346| 1| t0 = t1 * t0; 347| 1| t1 = t0.sqr_iter(5); 348| 1| t0 = t1 * t0; 349| 1| t1 = t0.sqr_iter(10); 350| 1| t1 = t1 * t0; 351| 1| auto t2 = t1.sqr_iter(20); 352| 1| t1 = t2 * t1; 353| 1| t1 = t1.sqr_iter(10); 354| 1| t0 = t1 * t0; 355| 1| t1 = t0.sqr_iter(50); 356| 1| t1 = t1 * t0; 357| 1| t2 = t1.sqr_iter(100); 358| 1| t1 = t2 * t1; 359| 1| t1 = t1.sqr_iter(50); 360| 1| t0 = t1 * t0; 361| 1| t0 = t0.sqr_iter(2); 362| | 363| 1| t0 = t0 * (*this); 364| 1| return t0; 365| 1|} _ZNK5Botan20Ed25519_FieldElement8sqr_iterEm: 250| 144| constexpr Ed25519_FieldElement sqr_iter(size_t iter) const { 251| 144| auto r = *this; 252| 144| std::array z; // NOLINT(*-member-init) 253| 4.17k| for(size_t i = 0; i != iter; ++i) { ------------------ | Branch (253:28): [True: 4.02k, False: 144] ------------------ 254| 4.02k| comba_sqr(z.data(), r.m_val.data()); 255| 4.02k| r.reduce_wide(z); 256| 4.02k| } 257| 144| return r; 258| 144| } _ZNK5Botan20Ed25519_FieldElement11is_negativeEv: 210| 1| constexpr bool is_negative() const { return (canonical()[0] & 1) == 1; } _ZNK5Botan20Ed25519_FieldElement9canonicalEv: 118| 15| constexpr std::array canonical() const { 119| | // Fold the bit at 2^255, leaving a value below 2^255 + 19, then 120| | // conditionally subtract p once 121| 15| std::array t = m_val; 122| | 123| 15| const W top = t[N - 1] >> TOP_BIT; 124| 15| t[N - 1] &= TOP_MASK; 125| 15| W c = 0; 126| 15| t[0] = word_add(t[0], static_cast(top * 19), &c); 127| 60| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (127:28): [True: 45, False: 15] ------------------ 128| 45| t[i] = word_add(t[i], static_cast(0), &c); 129| 45| } 130| | 131| 15| std::array r{}; 132| 15| W borrow = 0; 133| 75| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (133:28): [True: 60, False: 15] ------------------ 134| 60| r[i] = word_sub(t[i], P[i], &borrow); 135| 60| } 136| 15| CT::conditional_assign_mem(borrow, r.data(), t.data(), N); 137| 15| return r; 138| 15| } _ZN5Botan20Ed25519_FieldElement4zeroEv: 146| 1.69k| constexpr static Ed25519_FieldElement zero() { return Ed25519_FieldElement(); } _ZN5Botan20Ed25519_FieldElement18conditional_assignENS_2CT6ChoiceERKS0_: 273| 20.8k| constexpr void conditional_assign(CT::Choice cond, const Ed25519_FieldElement& other) { 274| 20.8k| const W mask = cond.into_bitmask(); 275| 104k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (275:28): [True: 83.2k, False: 20.8k] ------------------ 276| 83.2k| m_val[i] = choose(mask, other.m_val[i], m_val[i]); 277| 83.2k| } 278| 20.8k| } _ZN5Botan20Ed25519_FieldElement16conditional_swapENS_2CT6ChoiceERS0_S3_: 283| 832| static constexpr void conditional_swap(CT::Choice cond, Ed25519_FieldElement& x, Ed25519_FieldElement& y) { 284| 832| const W mask = cond.into_bitmask(); 285| 4.16k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (285:28): [True: 3.32k, False: 832] ------------------ 286| 3.32k| const W nx = choose(mask, y.m_val[i], x.m_val[i]); 287| 3.32k| const W ny = choose(mask, x.m_val[i], y.m_val[i]); 288| 3.32k| x.m_val[i] = nx; 289| 3.32k| y.m_val[i] = ny; 290| 3.32k| } 291| 832| } _ZNK5Botan20Ed25519_FieldElement4sqr2Ev: 261| 212| constexpr Ed25519_FieldElement sqr2() const { 262| 212| const auto z = sqr(); 263| 212| return add(z, z); 264| 212| } _ZN5Botan20Ed25519_FieldElement3addERKS0_S2_: 212| 5.16k| static constexpr Ed25519_FieldElement add(const Ed25519_FieldElement& a, const Ed25519_FieldElement& b) { 213| 5.16k| Ed25519_FieldElement z; 214| 5.16k| W carry = 0; 215| 25.8k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (215:28): [True: 20.6k, False: 5.16k] ------------------ 216| 20.6k| z.m_val[i] = word_add(a.m_val[i], b.m_val[i], &carry); 217| 20.6k| } 218| 5.16k| z.fold_carry(carry); 219| 5.16k| return z; 220| 5.16k| } _ZN5Botan20Ed25519_FieldElement10fold_carryEm: 57| 5.16k| constexpr void fold_carry(W carry) { 58| 15.4k| for(size_t fold = 0; fold != 2; ++fold) { ------------------ | Branch (58:31): [True: 10.3k, False: 5.16k] ------------------ 59| 10.3k| W c = 0; 60| 10.3k| m_val[0] = word_add(m_val[0], carry * 38, &c); 61| 41.2k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (61:31): [True: 30.9k, False: 10.3k] ------------------ 62| 30.9k| m_val[i] = word_add(m_val[i], static_cast(0), &c); 63| 30.9k| } 64| 10.3k| carry = c; 65| 10.3k| } 66| 5.16k| } _ZN5BotanmlERKNS_20Ed25519_FieldElementES2_: 305| 10.4k|inline constexpr Ed25519_FieldElement operator*(const Ed25519_FieldElement& x, const Ed25519_FieldElement& y) { 306| 10.4k| return Ed25519_FieldElement::mul(x, y); 307| 10.4k|} _ZN5Botan20Ed25519_FieldElement3mulERKS0_S2_: 234| 10.4k| static constexpr Ed25519_FieldElement mul(const Ed25519_FieldElement& a, const Ed25519_FieldElement& b) { 235| 10.4k| std::array z; // NOLINT(*-member-init) 236| 10.4k| comba_mul(z.data(), a.m_val.data(), b.m_val.data()); 237| 10.4k| Ed25519_FieldElement r; 238| 10.4k| r.reduce_wide(z); 239| 10.4k| return r; 240| 10.4k| } _ZN5BotanplERKNS_20Ed25519_FieldElementES2_: 297| 4.95k|inline constexpr Ed25519_FieldElement operator+(const Ed25519_FieldElement& x, const Ed25519_FieldElement& y) { 298| 4.95k| return Ed25519_FieldElement::add(x, y); 299| 4.95k|} _ZN5BotanmiERKNS_20Ed25519_FieldElementES2_: 301| 4.10k|inline constexpr Ed25519_FieldElement operator-(const Ed25519_FieldElement& x, const Ed25519_FieldElement& y) { 302| 4.10k| return Ed25519_FieldElement::sub(x, y); 303| 4.10k|} _ZN5Botan20Ed25519_FieldElement3subERKS0_S2_: 222| 4.94k| static constexpr Ed25519_FieldElement sub(const Ed25519_FieldElement& a, const Ed25519_FieldElement& b) { 223| 4.94k| Ed25519_FieldElement z; 224| 4.94k| W borrow = 0; 225| 24.7k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (225:28): [True: 19.7k, False: 4.94k] ------------------ 226| 19.7k| z.m_val[i] = word_sub(a.m_val[i], b.m_val[i], &borrow); 227| 19.7k| } 228| 4.94k| z.fold_borrow(borrow); 229| 4.94k| return z; 230| 4.94k| } _ZN5Botan20Ed25519_FieldElement11fold_borrowEm: 71| 4.94k| constexpr void fold_borrow(W borrow) { 72| 14.8k| for(size_t fold = 0; fold != 2; ++fold) { ------------------ | Branch (72:31): [True: 9.88k, False: 4.94k] ------------------ 73| 9.88k| W b = 0; 74| 9.88k| m_val[0] = word_sub(m_val[0], borrow * 38, &b); 75| 39.5k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (75:31): [True: 29.6k, False: 9.88k] ------------------ 76| 29.6k| m_val[i] = word_sub(m_val[i], static_cast(0), &b); 77| 29.6k| } 78| 9.88k| borrow = b; 79| 9.88k| } 80| 4.94k| } _ZNK5Botan20Ed25519_FieldElement6invertEv: 313| 15|constexpr Ed25519_FieldElement Ed25519_FieldElement::invert() const { 314| 15| auto t0 = this->sqr(); 315| 15| auto t1 = t0.sqr_iter(2); 316| 15| t1 = *this * t1; 317| 15| t0 = t0 * t1; 318| 15| auto t2 = t0.sqr(); 319| 15| t1 = t1 * t2; 320| 15| t2 = t1.sqr_iter(5); 321| 15| t1 = t2 * t1; 322| 15| t2 = t1.sqr_iter(10); 323| 15| t2 = t2 * t1; 324| 15| auto t3 = t2.sqr_iter(20); 325| 15| t2 = t3 * t2; 326| 15| t2 = t2.sqr_iter(10); 327| 15| t1 = t2 * t1; 328| 15| t2 = t1.sqr_iter(50); 329| 15| t2 = t2 * t1; 330| 15| t3 = t2.sqr_iter(100); 331| 15| t2 = t3 * t2; 332| 15| t2 = t2.sqr_iter(50); 333| 15| t1 = t2 * t1; 334| 15| t1 = t1.sqr_iter(5); 335| | 336| 15| t0 = t1 * t0; 337| 15| return t0; 338| 15|} _ZNK5Botan20Ed25519_FieldElement12serialize_toENSt3__14spanIhLm32EEE: 186| 13| void serialize_to(std::span b) const { 187| 13| const auto w = canonical(); 188| 65| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (188:28): [True: 52, False: 13] ------------------ 189| 52| store_le(w[i], b.data() + sizeof(W) * i); 190| 52| } 191| 13| } _ZNK5Botan20Ed25519_FieldElement7is_zeroEv: 193| 1| constexpr bool is_zero() const { 194| 1| const auto w = canonical(); 195| 1| if(std::is_constant_evaluated()) { ------------------ | Branch (195:13): [Folded, False: 1] ------------------ 196| 0| for(const auto x : w) { ------------------ | Branch (196:30): [True: 0, False: 0] ------------------ 197| 0| if(x != 0) { ------------------ | Branch (197:19): [True: 0, False: 0] ------------------ 198| 0| return false; 199| 0| } 200| 0| } 201| 0| return true; 202| 0| } 203| 1| return CT::all_zeros(w.data(), w.size()).as_bool(); 204| 1| } _ZN5BotanngERKNS_20Ed25519_FieldElementE: 309| 833|inline constexpr Ed25519_FieldElement operator-(const Ed25519_FieldElement& x) { 310| 833| return Ed25519_FieldElement::negate(x); 311| 833|} _ZN5Botan20Ed25519_FieldElement6negateERKS0_: 232| 833| static constexpr Ed25519_FieldElement negate(const Ed25519_FieldElement& a) { return sub(zero(), a); } _ZNK5Botan14Ed25519_Scalar8to_bytesEv: 59| 13| std::array to_bytes() const { 60| 13| std::array b; // NOLINT(*-member-init) 61| 13| serialize_to(b); 62| 13| return b; 63| 13| } _ZN5Botan14Ed25519_ScalarC2ERKNSt3__15arrayImLm4EEE: 72| 13| explicit Ed25519_Scalar(const std::array& v) : m_val(v) {} _ZN5Botan3fmtIJNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEES7_NS1_17basic_string_viewIcS4_EEDpRKT_: 53| 12.8k|std::string fmt(std::string_view format, const T&... args) { 54| 12.8k| std::ostringstream oss; 55| 12.8k| oss.imbue(std::locale::classic()); 56| 12.8k| fmt_detail::do_fmt(oss, format, args...); 57| 12.8k| return oss.str(); 58| 12.8k|} _ZN5Botan10fmt_detail6do_fmtINSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEJEEEvRNS2_19basic_ostringstreamIcS5_S7_EENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 12.8k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 12.8k| size_t i = 0; 27| | 28| 128k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 128k, False: 0] ------------------ 29| 128k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 12.8k, False: 115k] | Branch (29:30): [True: 12.8k, False: 0] | Branch (29:59): [True: 12.8k, False: 0] ------------------ 30| 12.8k| oss << val; 31| 12.8k| return do_fmt(oss, format.substr(i + 2), rest...); 32| 115k| } else { 33| 115k| oss << format[i]; 34| 115k| } 35| | 36| 115k| i += 1; 37| 115k| } 38| 12.8k|} _ZN5Botan10fmt_detail6do_fmtERNSt3__119basic_ostringstreamIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EE: 20| 18.0k|inline void do_fmt(std::ostringstream& oss, std::string_view format) { 21| 18.0k| oss << format; 22| 18.0k|} _ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_: 53| 3.45k|std::string fmt(std::string_view format, const T&... args) { 54| 3.45k| std::ostringstream oss; 55| 3.45k| oss.imbue(std::locale::classic()); 56| 3.45k| fmt_detail::do_fmt(oss, format, args...); 57| 3.45k| return oss.str(); 58| 3.45k|} _ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_: 25| 4.22k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 4.22k| size_t i = 0; 27| | 28| 31.4k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 31.4k, False: 0] ------------------ 29| 31.4k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 4.22k, False: 27.2k] | Branch (29:30): [True: 4.22k, False: 0] | Branch (29:59): [True: 4.22k, False: 0] ------------------ 30| 4.22k| oss << val; 31| 4.22k| return do_fmt(oss, format.substr(i + 2), rest...); 32| 27.2k| } else { 33| 27.2k| oss << format[i]; 34| 27.2k| } 35| | 36| 27.2k| i += 1; 37| 27.2k| } 38| 4.22k|} _ZN5Botan10fmt_detail6do_fmtIPKcJEEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 25| 474|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 474| size_t i = 0; 27| | 28| 6.63k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 6.63k, False: 0] ------------------ 29| 6.63k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 474, False: 6.16k] | Branch (29:30): [True: 474, False: 0] | Branch (29:59): [True: 474, False: 0] ------------------ 30| 474| oss << val; 31| 474| return do_fmt(oss, format.substr(i + 2), rest...); 32| 6.16k| } else { 33| 6.16k| oss << format[i]; 34| 6.16k| } 35| | 36| 6.16k| i += 1; 37| 6.16k| } 38| 474|} _ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPKcEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_: 53| 472|std::string fmt(std::string_view format, const T&... args) { 54| 472| std::ostringstream oss; 55| 472| oss.imbue(std::locale::classic()); 56| 472| fmt_detail::do_fmt(oss, format, args...); 57| 472| return oss.str(); 58| 472|} _ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJPKcEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_: 25| 472|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 472| size_t i = 0; 27| | 28| 472| while(i < format.size()) { ------------------ | Branch (28:10): [True: 472, False: 0] ------------------ 29| 472| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 472, False: 0] | Branch (29:30): [True: 472, False: 0] | Branch (29:59): [True: 472, False: 0] ------------------ 30| 472| oss << val; 31| 472| return do_fmt(oss, format.substr(i + 2), rest...); 32| 472| } else { 33| 0| oss << format[i]; 34| 0| } 35| | 36| 0| i += 1; 37| 0| } 38| 472|} _ZN5Botan3fmtIJPKcNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEEEENS3_12basic_stringIcS6_NS3_9allocatorIcEEEES7_DpRKT_: 53| 770|std::string fmt(std::string_view format, const T&... args) { 54| 770| std::ostringstream oss; 55| 770| oss.imbue(std::locale::classic()); 56| 770| fmt_detail::do_fmt(oss, format, args...); 57| 770| return oss.str(); 58| 770|} _ZN5Botan10fmt_detail6do_fmtIPKcJNSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEEEEvRNS4_19basic_ostringstreamIcS7_NS4_9allocatorIcEEEES8_RKT_DpRKT0_: 25| 770|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 770| size_t i = 0; 27| | 28| 5.37k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 5.37k, False: 0] ------------------ 29| 5.37k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 770, False: 4.60k] | Branch (29:30): [True: 770, False: 0] | Branch (29:59): [True: 770, False: 0] ------------------ 30| 770| oss << val; 31| 770| return do_fmt(oss, format.substr(i + 2), rest...); 32| 4.60k| } else { 33| 4.60k| oss << format[i]; 34| 4.60k| } 35| | 36| 4.60k| i += 1; 37| 4.60k| } 38| 770|} _ZN5Botan10fmt_detail6do_fmtImJEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 383|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 383| size_t i = 0; 27| | 28| 9.47k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 9.47k, False: 0] ------------------ 29| 9.47k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 383, False: 9.09k] | Branch (29:30): [True: 383, False: 0] | Branch (29:59): [True: 383, False: 0] ------------------ 30| 383| oss << val; 31| 383| return do_fmt(oss, format.substr(i + 2), rest...); 32| 9.09k| } else { 33| 9.09k| oss << format[i]; 34| 9.09k| } 35| | 36| 9.09k| i += 1; 37| 9.09k| } 38| 383|} _ZN5Botan3fmtIJmmEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 53| 359|std::string fmt(std::string_view format, const T&... args) { 54| 359| std::ostringstream oss; 55| 359| oss.imbue(std::locale::classic()); 56| 359| fmt_detail::do_fmt(oss, format, args...); 57| 359| return oss.str(); 58| 359|} _ZN5Botan10fmt_detail6do_fmtImJmEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 359|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 359| size_t i = 0; 27| | 28| 4.43k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 4.43k, False: 0] ------------------ 29| 4.43k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 359, False: 4.07k] | Branch (29:30): [True: 359, False: 0] | Branch (29:59): [True: 359, False: 0] ------------------ 30| 359| oss << val; 31| 359| return do_fmt(oss, format.substr(i + 2), rest...); 32| 4.07k| } else { 33| 4.07k| oss << format[i]; 34| 4.07k| } 35| | 36| 4.07k| i += 1; 37| 4.07k| } 38| 359|} _ZN5Botan10fmt_detail6do_fmtIjJEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 92|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 92| size_t i = 0; 27| | 28| 219| while(i < format.size()) { ------------------ | Branch (28:10): [True: 219, False: 0] ------------------ 29| 219| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 92, False: 127] | Branch (29:30): [True: 92, False: 0] | Branch (29:59): [True: 92, False: 0] ------------------ 30| 92| oss << val; 31| 92| return do_fmt(oss, format.substr(i + 2), rest...); 32| 127| } else { 33| 127| oss << format[i]; 34| 127| } 35| | 36| 127| i += 1; 37| 127| } 38| 92|} _ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEjEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_: 53| 35|std::string fmt(std::string_view format, const T&... args) { 54| 35| std::ostringstream oss; 55| 35| oss.imbue(std::locale::classic()); 56| 35| fmt_detail::do_fmt(oss, format, args...); 57| 35| return oss.str(); 58| 35|} _ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJjEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_: 25| 35|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 35| size_t i = 0; 27| | 28| 35| while(i < format.size()) { ------------------ | Branch (28:10): [True: 35, False: 0] ------------------ 29| 35| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 35, False: 0] | Branch (29:30): [True: 35, False: 0] | Branch (29:59): [True: 35, False: 0] ------------------ 30| 35| oss << val; 31| 35| return do_fmt(oss, format.substr(i + 2), rest...); 32| 35| } else { 33| 0| oss << format[i]; 34| 0| } 35| | 36| 0| i += 1; 37| 0| } 38| 35|} _ZN5Botan3fmtIJjjEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 53| 57|std::string fmt(std::string_view format, const T&... args) { 54| 57| std::ostringstream oss; 55| 57| oss.imbue(std::locale::classic()); 56| 57| fmt_detail::do_fmt(oss, format, args...); 57| 57| return oss.str(); 58| 57|} _ZN5Botan10fmt_detail6do_fmtIjJjEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 57|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 57| size_t i = 0; 27| | 28| 1.93k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 1.93k, False: 0] ------------------ 29| 1.93k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 57, False: 1.88k] | Branch (29:30): [True: 57, False: 0] | Branch (29:59): [True: 57, False: 0] ------------------ 30| 57| oss << val; 31| 57| return do_fmt(oss, format.substr(i + 2), rest...); 32| 1.88k| } else { 33| 1.88k| oss << format[i]; 34| 1.88k| } 35| | 36| 1.88k| i += 1; 37| 1.88k| } 38| 57|} _ZN5Botan3fmtIJmPKcEEENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS3_17basic_string_viewIcS6_EEDpRKT_: 53| 2|std::string fmt(std::string_view format, const T&... args) { 54| 2| std::ostringstream oss; 55| 2| oss.imbue(std::locale::classic()); 56| 2| fmt_detail::do_fmt(oss, format, args...); 57| 2| return oss.str(); 58| 2|} _ZN5Botan10fmt_detail6do_fmtImJPKcEEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 25| 2|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 2| size_t i = 0; 27| | 28| 28| while(i < format.size()) { ------------------ | Branch (28:10): [True: 28, False: 0] ------------------ 29| 28| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 2, False: 26] | Branch (29:30): [True: 2, False: 0] | Branch (29:59): [True: 2, False: 0] ------------------ 30| 2| oss << val; 31| 2| return do_fmt(oss, format.substr(i + 2), rest...); 32| 26| } else { 33| 26| oss << format[i]; 34| 26| } 35| | 36| 26| i += 1; 37| 26| } 38| 2|} _ZN5Botan3fmtIJjmEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 53| 24|std::string fmt(std::string_view format, const T&... args) { 54| 24| std::ostringstream oss; 55| 24| oss.imbue(std::locale::classic()); 56| 24| fmt_detail::do_fmt(oss, format, args...); 57| 24| return oss.str(); 58| 24|} _ZN5Botan10fmt_detail6do_fmtIjJmEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 24|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 24| size_t i = 0; 27| | 28| 528| while(i < format.size()) { ------------------ | Branch (28:10): [True: 528, False: 0] ------------------ 29| 528| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 24, False: 504] | Branch (29:30): [True: 24, False: 0] | Branch (29:59): [True: 24, False: 0] ------------------ 30| 24| oss << val; 31| 24| return do_fmt(oss, format.substr(i + 2), rest...); 32| 504| } else { 33| 504| oss << format[i]; 34| 504| } 35| | 36| 504| i += 1; 37| 504| } 38| 24|} _ZN5Botan14GCM_EncryptionC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEm: 79| 13| GCM_Mode(std::move(cipher), tag_size) {} _ZN5Botan14GCM_DecryptionC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEm: 100| 84| GCM_Mode(std::move(cipher), tag_size) {} _ZNK5Botan8GCM_Mode8tag_sizeEv: 39| 514| size_t tag_size() const final { return m_tag_size; } _ZNK5Botan14GCM_Decryption18minimum_final_sizeEv: 104| 64| size_t minimum_final_size() const override { return tag_size(); } _ZNK5Botan5GHASH8key_specEv: 42| 97| Key_Length_Specification key_spec() const override { return Key_Length_Specification(16); } _ZN5Botan7swar_ltITkNSt3__117unsigned_integralEtEET_S2_S2_: 121| 325k|constexpr T swar_lt(T a, T b) { 122| | // The constant 0x808080... as a T 123| 325k| constexpr T hi1 = (static_cast(-1) / 255) << 7; 124| | // The constant 0x7F7F7F... as a T 125| 325k| constexpr T lo7 = static_cast(~hi1); 126| 325k| T r = (lo7 - a + b) & hi1; 127| | // Currently the mask is 80 if lt, otherwise 00. Convert to FF/00 128| 325k| return (r << 1) - (r >> 7); 129| 325k|} _ZN5Botan12mul_or_throwITkNSt3__117unsigned_integralEmEET_S2_S2_NS1_17basic_string_viewIcNS1_11char_traitsIcEEEE: 81| 12.5k|constexpr T mul_or_throw(T a, T b, std::string_view msg) { 82| 12.5k| if(auto r = checked_mul(a, b)) { ------------------ | Branch (82:12): [True: 12.5k, False: 0] ------------------ 83| 12.5k| return r.value(); 84| 12.5k| } else { 85| 0| throw Invalid_Argument(msg); 86| 0| } 87| 12.5k|} _ZN5Botan11checked_mulITkNSt3__117unsigned_integralEmEENS1_8optionalIT_EES3_S3_: 46| 683k|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| 683k| 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| 683k| if(a != 0 && r / a != b) { ------------------ | Branch (53:7): [True: 683k, False: 0] | Branch (53:17): [True: 0, False: 683k] ------------------ 54| 0| return {}; 55| 0| } 56| 683k| return r; 57| 683k|} _ZN5Botan13swar_in_rangeITkNSt3__117unsigned_integralEmEET_S2_S2_S2_: 144| 5.27M|constexpr T swar_in_range(T v, T lower, T upper) { 145| | // The constant 0x808080... as a T 146| 5.27M| constexpr T hi1 = (static_cast(-1) / 255) << 7; 147| | // The constant 0x7F7F7F... as a T 148| 5.27M| constexpr T lo7 = ~hi1; 149| | 150| 5.27M| const T sub = ((v | hi1) - (lower & lo7)) ^ ((v ^ (~lower)) & hi1); 151| 5.27M| const T a_lo = sub & lo7; 152| 5.27M| const T a_hi = sub & hi1; 153| 5.27M| return (lo7 - a_lo + upper) & hi1 & ~a_hi; 154| 5.27M|} _ZN5Botan23index_of_first_set_byteITkNSt3__117unsigned_integralEmEEmT_: 160| 90.2k|constexpr size_t index_of_first_set_byte(T v) { 161| | // The constant 0x010101... as a T 162| 90.2k| constexpr T lo1 = (static_cast(-1) / 255); 163| | // The constant 0x808080... as a T 164| 90.2k| constexpr T hi1 = lo1 << 7; 165| | // How many bits to shift in order to get the top byte 166| 90.2k| constexpr size_t bits = (sizeof(T) * 8) - 8; 167| | 168| 90.2k| return static_cast((((((v & hi1) - 1) & lo1) * lo1) >> bits) - 1); 169| 90.2k|} _ZN5Botan15checked_cast_toItmQaasr3stdE8integralINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEsr3stdE8integralINS2_Iu14__remove_cvrefIT0_EE4typeEEEES3_S7_: 104| 2.30k|constexpr RT checked_cast_to(AT i) { 105| 2.30k| return checked_cast_to_or_throw(i, "Error during integer conversion"); 106| 2.30k|} _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| 2.30k|constexpr RT checked_cast_to_or_throw(AT i, std::string_view error_msg_on_fail) { 92| 2.30k| const auto unwrapped_input = unwrap_strong_type(i); 93| | 94| 2.30k| const auto unwrapped_result = static_cast>(unwrapped_input); 95| 2.30k| if(unwrapped_input != static_cast>(unwrapped_result)) [[unlikely]] { ------------------ | Branch (95:7): [True: 0, False: 2.30k] ------------------ 96| 0| throw ExceptionType(error_msg_on_fail); 97| 0| } 98| | 99| 2.30k| return wrap_strong_type(unwrapped_result); 100| 2.30k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEjEENS1_8optionalIT_EES3_S3_: 19| 79.1k|constexpr inline std::optional checked_add(T a, T b) { 20| 79.1k| const T r = a + b; 21| 79.1k| if(r < a || r < b) { ------------------ | Branch (21:7): [True: 0, False: 79.1k] | Branch (21:16): [True: 0, False: 79.1k] ------------------ 22| 0| return {}; 23| 0| } 24| 79.1k| return r; 25| 79.1k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 44.8k|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 44.8k| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 44.8k, False: 0] ------------------ 39| 44.8k| return checked_add(r.value(), rest...); 40| 44.8k| } else { 41| 0| return {}; 42| 0| } 43| 44.8k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmEENS1_8optionalIT_EES3_S3_: 19| 159k|constexpr inline std::optional checked_add(T a, T b) { 20| 159k| const T r = a + b; 21| 159k| if(r < a || r < b) { ------------------ | Branch (21:7): [True: 0, False: 159k] | Branch (21:16): [True: 0, False: 159k] ------------------ 22| 0| return {}; 23| 0| } 24| 159k| return r; 25| 159k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 44.8k|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 44.8k| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 44.8k, False: 0] ------------------ 39| 44.8k| return checked_add(r.value(), rest...); 40| 44.8k| } else { 41| 0| return {}; 42| 0| } 43| 44.8k|} _ZN5Botan12add_or_throwITkNSt3__117unsigned_integralEmEET_S2_S2_NS1_17basic_string_viewIcNS1_11char_traitsIcEEEE: 66| 333|constexpr T add_or_throw(T a, T b, std::string_view msg) { 67| 333| if(auto r = checked_add(a, b)) { ------------------ | Branch (67:12): [True: 333, False: 0] ------------------ 68| 333| return r.value(); 69| 333| } else { 70| 0| throw Invalid_Argument(msg); 71| 0| } 72| 333|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmmmmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 6.26k|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 6.26k| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 6.26k, False: 0] ------------------ 39| 6.26k| return checked_add(r.value(), rest...); 40| 6.26k| } else { 41| 0| return {}; 42| 0| } 43| 6.26k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmmmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 6.26k|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 6.26k| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 6.26k, False: 0] ------------------ 39| 6.26k| return checked_add(r.value(), rest...); 40| 6.26k| } else { 41| 0| return {}; 42| 0| } 43| 6.26k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 6.26k|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 6.26k| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 6.26k, False: 0] ------------------ 39| 6.26k| return checked_add(r.value(), rest...); 40| 6.26k| } else { 41| 0| return {}; 42| 0| } 43| 6.26k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 6.26k|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 6.26k| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 6.26k, False: 0] ------------------ 39| 6.26k| return checked_add(r.value(), rest...); 40| 6.26k| } else { 41| 0| return {}; 42| 0| } 43| 6.26k|} _ZN5Botan8get_byteILm0EtEEhT0_QltT_stS1_: 81| 349k|{ 82| 349k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 349k| return static_cast((input >> shift) & 0xFF); 84| 349k|} _ZN5Botan8get_byteILm1EtEEhT0_QltT_stS1_: 81| 349k|{ 82| 349k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 349k| return static_cast((input >> shift) & 0xFF); 84| 349k|} _ZN5Botan11make_uint16Ehh: 92| 171k|inline constexpr uint16_t make_uint16(uint8_t i0, uint8_t i1) { 93| 171k| return static_cast((static_cast(i0) << 8) | i1); 94| 171k|} _ZN5Botan11make_uint32Ehhhh: 104| 36.3k|inline constexpr uint32_t make_uint32(uint8_t i0, uint8_t i1, uint8_t i2, uint8_t i3) { 105| 36.3k| return ((static_cast(i0) << 24) | (static_cast(i1) << 16) | (static_cast(i2) << 8) | 106| 36.3k| (static_cast(i3))); 107| 36.3k|} _ZN5Botan8store_beINS_6detail10AutoDetectEJRKmPhEEEDaDpOT0_: 745| 94.5k|inline constexpr auto store_be(ParamTs&&... params) { 746| 94.5k| return detail::store_any(std::forward(params)...); 747| 94.5k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEmQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvS6_Ph: 711| 94.8k|inline constexpr void store_any(T in, uint8_t out[]) { 712| | // asserts that *out points to enough bytes to write into 713| 94.8k| store_any(in, std::span(out, sizeof(T))); 714| 94.8k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEEQsr3stdE7same_asIS4_T0_EEEvT1_OT2_: 646| 94.9k|inline constexpr void store_any(T in, OutR&& out_range) { 647| 94.9k| store_any(in, std::forward(out_range)); 648| 94.9k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvS9_OT1_: 525| 443k|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) { 526| 443k| const auto in = detail::unwrap_strong_type_or_enum(wrapped_in); 527| 443k| using InT = decltype(in); 528| 443k| ranges::assert_exact_byte_length(out_range); 529| 443k| 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| 443k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (534:7): [Folded, False: 443k] ------------------ 535| 0| return fallback_store_any(in, std::forward(out_range)); 536| 443k| } 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| 443k| } else { 542| 443k| static_assert(opposite(endianness) == std::endian::native); 543| 443k| typecast_copy(out, reverse_bytes(in)); 544| 443k| } 545| 443k| } 546| 443k|} _ZN5Botan6detail26unwrap_strong_type_or_enumITkNS0_20unsigned_integralishEmEEDaT_: 190| 446k|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| 446k| } else { 195| 446k| return Botan::unwrap_strong_type(t); 196| 446k| } 197| 446k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmEET0_PKhm: 454| 344k|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| 344k| constexpr size_t out_size = sizeof(OutT); 457| 344k| return load_any(std::span(in + off * out_size, out_size)); 458| 344k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 542k|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 542k| using OutT = detail::wrapped_type; 280| 542k| ranges::assert_exact_byte_length(in_range); 281| | 282| 542k| 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| 542k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 542k| return fallback_load_any(std::forward(in_range)); 288| 542k| } else { 289| 542k| const std::span in{in_range}; 290| 542k| if constexpr(sizeof(OutT) == 1) { 291| 542k| return static_cast(in[0]); 292| 542k| } else if constexpr(endianness == std::endian::native) { 293| 542k| return typecast_copy(in); 294| 542k| } else { 295| 542k| static_assert(opposite(endianness) == std::endian::native); 296| 542k| return reverse_bytes(typecast_copy(in)); 297| 542k| } 298| 542k| } 299| 542k| }()); 300| 542k|} _ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEmTkNSt3__117unsigned_integralEmEEDaT0_: 200| 570k|constexpr auto wrap_strong_type_or_enum(T t) { 201| | if constexpr(std::is_enum_v) { 202| | return static_cast(t); 203| 570k| } else { 204| 570k| return Botan::wrap_strong_type(t); 205| 570k| } 206| 570k|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 542k| 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| 542k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 542k] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 542k| } else { 289| 542k| 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| 542k| } else { 295| 542k| static_assert(opposite(endianness) == std::endian::native); 296| 542k| return reverse_bytes(typecast_copy(in)); 297| 542k| } 298| 542k| } 299| 542k| }()); _ZN5Botan8get_byteILm7EmEEhT0_QltT_stS1_: 81| 90|{ 82| 90| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 90| return static_cast((input >> shift) & 0xFF); 84| 90|} _ZN5Botan8get_byteILm6EmEEhT0_QltT_stS1_: 81| 90|{ 82| 90| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 90| return static_cast((input >> shift) & 0xFF); 84| 90|} _ZN5Botan8get_byteILm5EmEEhT0_QltT_stS1_: 81| 90|{ 82| 90| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 90| return static_cast((input >> shift) & 0xFF); 84| 90|} _ZN5Botan8get_byteILm4EmEEhT0_QltT_stS1_: 81| 90|{ 82| 90| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 90| return static_cast((input >> shift) & 0xFF); 84| 90|} _ZN5Botan8get_byteILm3EmEEhT0_QltT_stS1_: 81| 90|{ 82| 90| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 90| return static_cast((input >> shift) & 0xFF); 84| 90|} _ZN5Botan8get_byteILm2EmEEhT0_QltT_stS1_: 81| 90|{ 82| 90| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 90| return static_cast((input >> shift) & 0xFF); 84| 90|} _ZN5Botan8get_byteILm1EmEEhT0_QltT_stS1_: 81| 90|{ 82| 90| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 90| return static_cast((input >> shift) & 0xFF); 84| 90|} _ZN5Botan8get_byteILm0EmEEhT0_QltT_stS1_: 81| 273|{ 82| 273| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 273| return static_cast((input >> shift) & 0xFF); 84| 273|} _ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEtTkNSt3__117unsigned_integralEtEEDaT0_: 200| 209k|constexpr auto wrap_strong_type_or_enum(T t) { 201| | if constexpr(std::is_enum_v) { 202| | return static_cast(t); 203| 209k| } else { 204| 209k| return Botan::wrap_strong_type(t); 205| 209k| } 206| 209k|} _ZN5Botan7load_beItJPKhRmEEEDaDpOT0_: 504| 62.8k|inline constexpr auto load_be(ParamTs&&... params) { 505| 62.8k| return detail::load_any(std::forward(params)...); 506| 62.8k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEtEET0_PKhm: 454| 65.0k|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| 65.0k| constexpr size_t out_size = sizeof(OutT); 457| 65.0k| return load_any(std::span(in + off * out_size, out_size)); 458| 65.0k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEtTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm2EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 209k|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 209k| using OutT = detail::wrapped_type; 280| 209k| ranges::assert_exact_byte_length(in_range); 281| | 282| 209k| 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| 209k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 209k| return fallback_load_any(std::forward(in_range)); 288| 209k| } else { 289| 209k| const std::span in{in_range}; 290| 209k| if constexpr(sizeof(OutT) == 1) { 291| 209k| return static_cast(in[0]); 292| 209k| } else if constexpr(endianness == std::endian::native) { 293| 209k| return typecast_copy(in); 294| 209k| } else { 295| 209k| static_assert(opposite(endianness) == std::endian::native); 296| 209k| return reverse_bytes(typecast_copy(in)); 297| 209k| } 298| 209k| } 299| 209k| }()); 300| 209k|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEtTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm2EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 209k| 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| 209k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 209k] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 209k| } else { 289| 209k| 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| 209k| } else { 295| 209k| static_assert(opposite(endianness) == std::endian::native); 296| 209k| return reverse_bytes(typecast_copy(in)); 297| 209k| } 298| 209k| } 299| 209k| }()); _ZN5Botan7load_beIjJPKhRmEEEDaDpOT0_: 504| 160|inline constexpr auto load_be(ParamTs&&... params) { 505| 160| return detail::load_any(std::forward(params)...); 506| 160|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjEET0_PKhm: 454| 513|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| 513| constexpr size_t out_size = sizeof(OutT); 457| 513| return load_any(std::span(in + off * out_size, out_size)); 458| 513|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm4EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 513|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 513| using OutT = detail::wrapped_type; 280| 513| ranges::assert_exact_byte_length(in_range); 281| | 282| 513| 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| 513| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 513| return fallback_load_any(std::forward(in_range)); 288| 513| } else { 289| 513| const std::span in{in_range}; 290| 513| if constexpr(sizeof(OutT) == 1) { 291| 513| return static_cast(in[0]); 292| 513| } else if constexpr(endianness == std::endian::native) { 293| 513| return typecast_copy(in); 294| 513| } else { 295| 513| static_assert(opposite(endianness) == std::endian::native); 296| 513| return reverse_bytes(typecast_copy(in)); 297| 513| } 298| 513| } 299| 513| }()); 300| 513|} _ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEjTkNSt3__117unsigned_integralEjEEDaT0_: 200| 636|constexpr auto wrap_strong_type_or_enum(T t) { 201| | if constexpr(std::is_enum_v) { 202| | return static_cast(t); 203| 636| } else { 204| 636| return Botan::wrap_strong_type(t); 205| 636| } 206| 636|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm4EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 513| 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| 513| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 513] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 513| } else { 289| 513| 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| 513| } else { 295| 513| static_assert(opposite(endianness) == std::endian::native); 296| 513| return reverse_bytes(typecast_copy(in)); 297| 513| } 298| 513| } 299| 513| }()); _ZN5Botan8get_byteILm0EjEEhT0_QltT_stS1_: 81| 72|{ 82| 72| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 72| return static_cast((input >> shift) & 0xFF); 84| 72|} _ZN5Botan8get_byteILm1EjEEhT0_QltT_stS1_: 81| 13.0k|{ 82| 13.0k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 13.0k| return static_cast((input >> shift) & 0xFF); 84| 13.0k|} _ZN5Botan8get_byteILm2EjEEhT0_QltT_stS1_: 81| 13.0k|{ 82| 13.0k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 13.0k| return static_cast((input >> shift) & 0xFF); 84| 13.0k|} _ZN5Botan8get_byteILm3EjEEhT0_QltT_stS1_: 81| 13.0k|{ 82| 13.0k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 13.0k| return static_cast((input >> shift) & 0xFF); 84| 13.0k|} _ZN5Botan8store_leINS_6detail10AutoDetectEJmEEEDaDpOT0_: 736| 113k|inline constexpr auto store_le(ParamTs&&... params) { 737| 113k| return detail::store_any(std::forward(params)...); 738| 113k|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETpTkNS0_20unsigned_integralishEJmEQ10all_same_vIDpT1_EEEDaS6_: 696| 113k|inline constexpr auto store_any(Ts... ins) { 697| 113k| return store_any(std::array{ins...}); 698| 113k|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS_6ranges14spanable_rangeENS2_5arrayImLm1EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS8_Esr3stdE21default_initializableIS8_Esr8conceptsE21resizable_byte_bufferIS8_EEEDaOT1_: 663| 113k|inline constexpr auto store_any(InR&& in_range) { 664| 113k| auto out = []([[maybe_unused]] const auto& in) { 665| 113k| if constexpr(std::same_as) { 666| 113k| if constexpr(ranges::statically_spanable_range) { 667| 113k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 113k| return std::array(); 669| 113k| } else { 670| 113k| static_assert( 671| 113k| !std::same_as, 672| 113k| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 113k| } 674| 113k| } else if constexpr(concepts::resizable_byte_buffer) { 675| 113k| return OutR(std::span{in}.size_bytes()); 676| 113k| } else { 677| 113k| return OutR{}; 678| 113k| } 679| 113k| }(in_range); 680| | 681| 113k| store_any>(out, std::forward(in_range)); 682| 113k| return out; 683| 113k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS_6ranges14spanable_rangeENS2_5arrayImLm1EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS8_Esr3stdE21default_initializableIS8_Esr8conceptsE21resizable_byte_bufferIS8_EEEDaOT1_ENKUlRKT_E_clIS7_EEDaSD_: 664| 113k| auto out = []([[maybe_unused]] const auto& in) { 665| 113k| if constexpr(std::same_as) { 666| 113k| if constexpr(ranges::statically_spanable_range) { 667| 113k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 113k| 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| 113k| }(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| 113k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 113k| ranges::assert_equal_byte_lengths(out, in); 605| 113k| using element_type = std::ranges::range_value_t; 606| | 607| 113k| const auto store_elementwise = [&] { 608| 113k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 113k| std::span out_s(out); 610| 113k| for(const auto in_elem : in) { 611| 113k| store_any(out_s.template first(), in_elem); 612| 113k| out_s = out_s.subspan(bytes_per_element); 613| 113k| } 614| 113k| }; 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| 113k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 113k] ------------------ 620| 0| store_elementwise(); 621| 113k| } else { 622| 113k| if constexpr(endianness == std::endian::native && !custom_storable) { 623| 113k| typecast_copy(out, in); 624| | } else { 625| | store_elementwise(); 626| | } 627| 113k| } 628| 113k|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvS9_OT1_: 525| 276|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) { 526| 276| const auto in = detail::unwrap_strong_type_or_enum(wrapped_in); 527| 276| using InT = decltype(in); 528| 276| ranges::assert_exact_byte_length(out_range); 529| 276| 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| 276| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (534:7): [Folded, False: 276] ------------------ 535| 0| return fallback_store_any(in, std::forward(out_range)); 536| 276| } else { 537| | if constexpr(sizeof(InT) == 1) { 538| | out[0] = static_cast(in); 539| 276| } else if constexpr(endianness == std::endian::native) { 540| 276| typecast_copy(out, in); 541| | } else { 542| | static_assert(opposite(endianness) == std::endian::native); 543| | typecast_copy(out, reverse_bytes(in)); 544| | } 545| 276| } 546| 276|} _ZN5Botan12get_byte_varImEEhmT_: 69| 149k|inline constexpr uint8_t get_byte_var(size_t byte_num, T input) { 70| 149k| return static_cast(input >> (((~byte_num) & (sizeof(T) - 1)) << 3)); 71| 149k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEtQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvS6_Ph: 711| 19|inline constexpr void store_any(T in, uint8_t out[]) { 712| | // asserts that *out points to enough bytes to write into 713| 19| store_any(in, std::span(out, sizeof(T))); 714| 19|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEtTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm2EEEQsr3stdE7same_asIS4_T0_EEEvT1_OT2_: 646| 19|inline constexpr void store_any(T in, OutR&& out_range) { 647| 19| store_any(in, std::forward(out_range)); 648| 19|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEtTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm2EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvS9_OT1_: 525| 4.63k|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) { 526| 4.63k| const auto in = detail::unwrap_strong_type_or_enum(wrapped_in); 527| 4.63k| using InT = decltype(in); 528| 4.63k| ranges::assert_exact_byte_length(out_range); 529| 4.63k| 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| 4.63k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (534:7): [Folded, False: 4.63k] ------------------ 535| 0| return fallback_store_any(in, std::forward(out_range)); 536| 4.63k| } 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| 4.63k| } else { 542| 4.63k| static_assert(opposite(endianness) == std::endian::native); 543| 4.63k| typecast_copy(out, reverse_bytes(in)); 544| 4.63k| } 545| 4.63k| } 546| 4.63k|} _ZN5Botan6detail26unwrap_strong_type_or_enumITkNS0_20unsigned_integralishEtEEDaT_: 190| 4.63k|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| 4.63k| } else { 195| 4.63k| return Botan::unwrap_strong_type(t); 196| 4.63k| } 197| 4.63k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEjQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvS6_Ph: 711| 9.62k|inline constexpr void store_any(T in, uint8_t out[]) { 712| | // asserts that *out points to enough bytes to write into 713| 9.62k| store_any(in, std::span(out, sizeof(T))); 714| 9.62k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEEQsr3stdE7same_asIS4_T0_EEEvT1_OT2_: 646| 9.62k|inline constexpr void store_any(T in, OutR&& out_range) { 647| 9.62k| store_any(in, std::forward(out_range)); 648| 9.62k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvS9_OT1_: 525| 545k|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) { 526| 545k| const auto in = detail::unwrap_strong_type_or_enum(wrapped_in); 527| 545k| using InT = decltype(in); 528| 545k| ranges::assert_exact_byte_length(out_range); 529| 545k| 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| 545k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (534:7): [Folded, False: 545k] ------------------ 535| 0| return fallback_store_any(in, std::forward(out_range)); 536| 545k| } 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| 545k| } else { 542| 545k| static_assert(opposite(endianness) == std::endian::native); 543| 545k| typecast_copy(out, reverse_bytes(in)); 544| 545k| } 545| 545k| } 546| 545k|} _ZN5Botan6detail26unwrap_strong_type_or_enumITkNS0_20unsigned_integralishEjEEDaT_: 190| 545k|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| 545k| } else { 195| 545k| return Botan::unwrap_strong_type(t); 196| 545k| } 197| 545k|} _ZN5Botan8store_leINS_6detail10AutoDetectEJRmRA8_hEEEDaDpOT0_: 736| 82|inline constexpr auto store_le(ParamTs&&... params) { 737| 82| return detail::store_any(std::forward(params)...); 738| 82|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS0_20unsigned_integralishEmQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvS6_Ph: 711| 186|inline constexpr void store_any(T in, uint8_t out[]) { 712| | // asserts that *out points to enough bytes to write into 713| 186| store_any(in, std::span(out, sizeof(T))); 714| 186|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEEQsr3stdE7same_asIS4_T0_EEEvT1_OT2_: 646| 186|inline constexpr void store_any(T in, OutR&& out_range) { 647| 186| store_any(in, std::forward(out_range)); 648| 186|} _ZN5Botan7load_beImJPKhiEEEDaDpOT0_: 504| 44|inline constexpr auto load_be(ParamTs&&... params) { 505| 44| return detail::load_any(std::forward(params)...); 506| 44|} _ZN5Botan7load_beImJRA32_mRPKhRmEEEDaDpOT0_: 504| 138|inline constexpr auto load_be(ParamTs&&... params) { 505| 138| return detail::load_any(std::forward(params)...); 506| 138|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206EmTkNS0_20unsigned_integralishEmQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asIT1_S5_EEEvPS6_PKhm: 483| 138|inline constexpr void load_any(T out[], const uint8_t in[], size_t count) { 484| | // asserts that *in and *out point to the correct amount of memory 485| 138| load_any(std::span(out, count), std::span(in, count * sizeof(T))); 486| 138|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeENS2_4spanImLm18446744073709551615EEETkNS4_16contiguous_rangeIhEENS5_IKhLm18446744073709551615EEEQaa20unsigned_integralishINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT1_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISH_EESI_E4type10value_typeEEoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISP_SN_EEEvOSE_RKT2_: 355| 138|inline constexpr void load_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 356| 138| ranges::assert_equal_byte_lengths(out, in); 357| 138| using element_type = std::ranges::range_value_t; 358| | 359| 138| const auto load_elementwise = [&] { 360| 138| constexpr size_t bytes_per_element = sizeof(element_type); 361| 138| std::span in_s(in); 362| 138| for(auto& out_elem : out) { 363| 138| out_elem = load_any(in_s.template first()); 364| 138| in_s = in_s.subspan(bytes_per_element); 365| 138| } 366| 138| }; 367| | 368| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 369| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 370| | // in a `constexpr` context. 371| 138| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (371:7): [Folded, False: 138] ------------------ 372| 0| load_elementwise(); 373| 138| } else { 374| | if constexpr(endianness == std::endian::native && !custom_loadable) { 375| | typecast_copy(out, in); 376| 138| } else { 377| 138| load_elementwise(); 378| 138| } 379| 138| } 380| 138|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeENS2_4spanImLm18446744073709551615EEETkNS4_16contiguous_rangeIhEENS5_IKhLm18446744073709551615EEEQaa20unsigned_integralishINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT1_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISH_EESI_E4type10value_typeEEoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISP_SN_EEEvOSE_RKT2_ENKUlvE_clEv: 359| 138| const auto load_elementwise = [&] { 360| 138| constexpr size_t bytes_per_element = sizeof(element_type); 361| 138| std::span in_s(in); 362| 2.51k| for(auto& out_elem : out) { ------------------ | Branch (362:26): [True: 2.51k, False: 138] ------------------ 363| 2.51k| out_elem = load_any(in_s.template first()); 364| 2.51k| in_s = in_s.subspan(bytes_per_element); 365| 2.51k| } 366| 138| }; _ZN5Botan8store_beINS_6detail10AutoDetectEJPhRmEEEDaDpOT0_: 745| 2.51k|inline constexpr auto store_be(ParamTs&&... params) { 746| 2.51k| return detail::store_any(std::forward(params)...); 747| 2.51k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEmTpTkNS0_20unsigned_integralishEJEQaaoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_E10all_same_vIS6_DpT2_EEEvPhS6_S8_: 723| 2.51k|inline constexpr void store_any(uint8_t out[], T0 in0, Ts... ins) { 724| 2.51k| constexpr auto bytes = sizeof(in0) + (sizeof(ins) + ... + 0); 725| | // asserts that *out points to the correct amount of memory 726| 2.51k| store_any(std::span(out, bytes), in0, ins...); 727| 2.51k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEETpTkNS0_20unsigned_integralishEJmEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_: 582| 348k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, Ts... ins) { 583| 348k| ranges::assert_exact_byte_length<(sizeof(Ts) + ...)>(out); 584| 348k| auto store_one = [off = 0](auto o, T i) mutable { 585| 348k| store_any(i, o.subspan(off).template first()); 586| 348k| off += sizeof(T); 587| 348k| }; 588| | 589| 348k| (store_one(std::span{out}, ins), ...); 590| 348k|} _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| 348k| auto store_one = [off = 0](auto o, T i) mutable { 585| 348k| store_any(i, o.subspan(off).template first()); 586| 348k| off += sizeof(T); 587| 348k| }; _ZN5Botan7load_leIjJRPKhiEEEDaDpOT0_: 495| 123|inline constexpr auto load_le(ParamTs&&... params) { 496| 123| return detail::load_any(std::forward(params)...); 497| 123|} _ZN5Botan6detail8load_anyILNSt3__16endianE57005ETkNS0_20unsigned_integralishEjEET0_PKhm: 454| 123|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| 123| constexpr size_t out_size = sizeof(OutT); 457| 123| return load_any(std::span(in + off * out_size, out_size)); 458| 123|} _ZN5Botan6detail8load_anyILNSt3__16endianE57005ETkNS0_20unsigned_integralishEjTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm4EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 123|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 123| using OutT = detail::wrapped_type; 280| 123| ranges::assert_exact_byte_length(in_range); 281| | 282| 123| 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| 123| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 123| return fallback_load_any(std::forward(in_range)); 288| 123| } else { 289| 123| const std::span in{in_range}; 290| 123| if constexpr(sizeof(OutT) == 1) { 291| 123| return static_cast(in[0]); 292| 123| } else if constexpr(endianness == std::endian::native) { 293| 123| return typecast_copy(in); 294| 123| } else { 295| 123| static_assert(opposite(endianness) == std::endian::native); 296| 123| return reverse_bytes(typecast_copy(in)); 297| 123| } 298| 123| } 299| 123| }()); 300| 123|} _ZZN5Botan6detail8load_anyILNSt3__16endianE57005ETkNS0_20unsigned_integralishEjTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm4EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 123| 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| 123| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 123] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 123| } else { 289| 123| const std::span in{in_range}; 290| | if constexpr(sizeof(OutT) == 1) { 291| | return static_cast(in[0]); 292| 123| } else if constexpr(endianness == std::endian::native) { 293| 123| return typecast_copy(in); 294| | } else { 295| | static_assert(opposite(endianness) == std::endian::native); 296| | return reverse_bytes(typecast_copy(in)); 297| | } 298| 123| } 299| 123| }()); _ZN5Botan7load_leImJPKhiEEEDaDpOT0_: 495| 86|inline constexpr auto load_le(ParamTs&&... params) { 496| 86| return detail::load_any(std::forward(params)...); 497| 86|} _ZN5Botan6detail8load_anyILNSt3__16endianE57005ETkNS0_20unsigned_integralishEmEET0_PKhm: 454| 628|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| 628| constexpr size_t out_size = sizeof(OutT); 457| 628| return load_any(std::span(in + off * out_size, out_size)); 458| 628|} _ZN5Botan6detail8load_anyILNSt3__16endianE57005ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 628|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 628| using OutT = detail::wrapped_type; 280| 628| ranges::assert_exact_byte_length(in_range); 281| | 282| 628| 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| 628| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 628| return fallback_load_any(std::forward(in_range)); 288| 628| } else { 289| 628| const std::span in{in_range}; 290| 628| if constexpr(sizeof(OutT) == 1) { 291| 628| return static_cast(in[0]); 292| 628| } else if constexpr(endianness == std::endian::native) { 293| 628| return typecast_copy(in); 294| 628| } else { 295| 628| static_assert(opposite(endianness) == std::endian::native); 296| 628| return reverse_bytes(typecast_copy(in)); 297| 628| } 298| 628| } 299| 628| }()); 300| 628|} _ZZN5Botan6detail8load_anyILNSt3__16endianE57005ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 628| 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| 628| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 628] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 628| } else { 289| 628| const std::span in{in_range}; 290| | if constexpr(sizeof(OutT) == 1) { 291| | return static_cast(in[0]); 292| 628| } else if constexpr(endianness == std::endian::native) { 293| 628| return typecast_copy(in); 294| | } else { 295| | static_assert(opposite(endianness) == std::endian::native); 296| | return reverse_bytes(typecast_copy(in)); 297| | } 298| 628| } 299| 628| }()); _ZN5Botan7load_leImJRPKhiEEEDaDpOT0_: 495| 490|inline constexpr auto load_le(ParamTs&&... params) { 496| 490| return detail::load_any(std::forward(params)...); 497| 490|} _ZN5Botan8store_leINS_6detail10AutoDetectEJRPhRmS5_EEEDaDpOT0_: 736| 41|inline constexpr auto store_le(ParamTs&&... params) { 737| 41| return detail::store_any(std::forward(params)...); 738| 41|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS0_20unsigned_integralishEmTpTkNS0_20unsigned_integralishEJmEQaaoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_E10all_same_vIS6_DpT2_EEEvPhS6_S8_: 723| 41|inline constexpr void store_any(uint8_t out[], T0 in0, Ts... ins) { 724| 41| constexpr auto bytes = sizeof(in0) + (sizeof(ins) + ... + 0); 725| | // asserts that *out points to the correct amount of memory 726| 41| store_any(std::span(out, bytes), in0, ins...); 727| 41|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005EmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm16EEETpTkNS0_20unsigned_integralishEJmmEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_: 582| 41|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, Ts... ins) { 583| 41| ranges::assert_exact_byte_length<(sizeof(Ts) + ...)>(out); 584| 41| auto store_one = [off = 0](auto o, T i) mutable { 585| 41| store_any(i, o.subspan(off).template first()); 586| 41| off += sizeof(T); 587| 41| }; 588| | 589| 41| (store_one(std::span{out}, ins), ...); 590| 41|} _ZZN5Botan6detail9store_anyILNSt3__16endianE57005EmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm16EEETpTkNS0_20unsigned_integralishEJmmEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_ENUlTyS9_T_E_clImS7_EEDaS9_SE_: 584| 82| auto store_one = [off = 0](auto o, T i) mutable { 585| 82| store_any(i, o.subspan(off).template first()); 586| 82| off += sizeof(T); 587| 82| }; _ZN5Botan7load_beIjJPKhiEEEDaDpOT0_: 504| 36|inline constexpr auto load_be(ParamTs&&... params) { 505| 36| return detail::load_any(std::forward(params)...); 506| 36|} _ZN5Botan7load_leImJPKhRmEEEDaDpOT0_: 495| 52|inline constexpr auto load_le(ParamTs&&... params) { 496| 52| return detail::load_any(std::forward(params)...); 497| 52|} _ZN5Botan8store_leINS_6detail10AutoDetectEJRKmPhEEEDaDpOT0_: 736| 104|inline constexpr auto store_le(ParamTs&&... params) { 737| 104| return detail::store_any(std::forward(params)...); 738| 104|} _ZN5Botan12get_byte_varIjEEhmT_: 69| 18|inline constexpr uint8_t get_byte_var(size_t byte_num, T input) { 70| 18| return static_cast(input >> (((~byte_num) & (sizeof(T) - 1)) << 3)); 71| 18|} _ZN5Botan11copy_out_beITkNS_6ranges14spanable_rangeENSt3__16vectorIjNS_16secure_allocatorIjEEEEEEvNS2_4spanIhLm18446744073709551615EEERKT_: 773| 76.3k|inline void copy_out_be(std::span out, const InR& in) { 774| 76.3k| using T = std::ranges::range_value_t; 775| 76.3k| std::span in_s{in}; 776| 76.3k| 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.3k| for(size_t i = 0; i < remaining_bytes; ++i) { ------------------ | Branch (779:22): [True: 0, False: 76.3k] ------------------ 780| 0| out[i] = get_byte_var(i, in_s.front()); 781| 0| } 782| 76.3k|} _ZN5Botan6detail33copy_out_any_word_aligned_portionILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjEEmRNS2_4spanIhLm18446744073709551615EEERNS4_IKT0_Lm18446744073709551615EEE: 752| 76.3k|inline size_t copy_out_any_word_aligned_portion(std::span& out, std::span& in) { 753| 76.3k| const size_t full_words = out.size() / sizeof(T); 754| 76.3k| const size_t full_word_bytes = full_words * sizeof(T); 755| 76.3k| const size_t remaining_bytes = out.size() - full_word_bytes; 756| 76.3k| BOTAN_ASSERT_NOMSG(in.size_bytes() >= full_word_bytes + remaining_bytes); ------------------ | | 84| 76.3k| do { \ | | 85| 76.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 76.3k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 76.3k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 76.3k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 76.3k] | | ------------------ ------------------ 757| | 758| | // copy full words 759| 76.3k| store_any(out.first(full_word_bytes), in.first(full_words)); 760| 76.3k| out = out.subspan(full_word_bytes); 761| 76.3k| in = in.subspan(full_words); 762| | 763| 76.3k| return remaining_bytes; 764| 76.3k|} _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.3k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 76.3k| ranges::assert_equal_byte_lengths(out, in); 605| 76.3k| using element_type = std::ranges::range_value_t; 606| | 607| 76.3k| const auto store_elementwise = [&] { 608| 76.3k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 76.3k| std::span out_s(out); 610| 76.3k| for(const auto in_elem : in) { 611| 76.3k| store_any(out_s.template first(), in_elem); 612| 76.3k| out_s = out_s.subspan(bytes_per_element); 613| 76.3k| } 614| 76.3k| }; 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.3k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 76.3k] ------------------ 620| 0| store_elementwise(); 621| 76.3k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 76.3k| } else { 625| 76.3k| store_elementwise(); 626| 76.3k| } 627| 76.3k| } 628| 76.3k|} _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.3k| const auto store_elementwise = [&] { 608| 76.3k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 76.3k| std::span out_s(out); 610| 535k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 535k, False: 76.3k] ------------------ 611| 535k| store_any(out_s.template first(), in_elem); 612| 535k| out_s = out_s.subspan(bytes_per_element); 613| 535k| } 614| 76.3k| }; _ZN5Botan6detail9store_anyILNSt3__16endianE64206EjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEETpTkNS0_20unsigned_integralishEJjEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_: 582| 535k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, Ts... ins) { 583| 535k| ranges::assert_exact_byte_length<(sizeof(Ts) + ...)>(out); 584| 535k| auto store_one = [off = 0](auto o, T i) mutable { 585| 535k| store_any(i, o.subspan(off).template first()); 586| 535k| off += sizeof(T); 587| 535k| }; 588| | 589| 535k| (store_one(std::span{out}, ins), ...); 590| 535k|} _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| 535k| auto store_one = [off = 0](auto o, T i) mutable { 585| 535k| store_any(i, o.subspan(off).template first()); 586| 535k| off += sizeof(T); 587| 535k| }; _ZN5Botan11copy_out_beITkNS_6ranges14spanable_rangeENSt3__16vectorImNS_16secure_allocatorImEEEEEEvNS2_4spanIhLm18446744073709551615EEERKT_: 773| 5.61k|inline void copy_out_be(std::span out, const InR& in) { 774| 5.61k| using T = std::ranges::range_value_t; 775| 5.61k| std::span in_s{in}; 776| 5.61k| const auto remaining_bytes = detail::copy_out_any_word_aligned_portion(out, in_s); 777| | 778| | // copy remaining bytes as a partial word 779| 5.61k| for(size_t i = 0; i < remaining_bytes; ++i) { ------------------ | Branch (779:22): [True: 0, False: 5.61k] ------------------ 780| 0| out[i] = get_byte_var(i, in_s.front()); 781| 0| } 782| 5.61k|} _ZN5Botan6detail33copy_out_any_word_aligned_portionILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmEEmRNS2_4spanIhLm18446744073709551615EEERNS4_IKT0_Lm18446744073709551615EEE: 752| 5.94k|inline size_t copy_out_any_word_aligned_portion(std::span& out, std::span& in) { 753| 5.94k| const size_t full_words = out.size() / sizeof(T); 754| 5.94k| const size_t full_word_bytes = full_words * sizeof(T); 755| 5.94k| const size_t remaining_bytes = out.size() - full_word_bytes; 756| 5.94k| BOTAN_ASSERT_NOMSG(in.size_bytes() >= full_word_bytes + remaining_bytes); ------------------ | | 84| 5.94k| do { \ | | 85| 5.94k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 5.94k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 5.94k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 5.94k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 5.94k] | | ------------------ ------------------ 757| | 758| | // copy full words 759| 5.94k| store_any(out.first(full_word_bytes), in.first(full_words)); 760| 5.94k| out = out.subspan(full_word_bytes); 761| 5.94k| in = in.subspan(full_words); 762| | 763| 5.94k| return remaining_bytes; 764| 5.94k|} _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| 5.94k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 5.94k| ranges::assert_equal_byte_lengths(out, in); 605| 5.94k| using element_type = std::ranges::range_value_t; 606| | 607| 5.94k| const auto store_elementwise = [&] { 608| 5.94k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 5.94k| std::span out_s(out); 610| 5.94k| for(const auto in_elem : in) { 611| 5.94k| store_any(out_s.template first(), in_elem); 612| 5.94k| out_s = out_s.subspan(bytes_per_element); 613| 5.94k| } 614| 5.94k| }; 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| 5.94k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 5.94k] ------------------ 620| 0| store_elementwise(); 621| 5.94k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 5.94k| } else { 625| 5.94k| store_elementwise(); 626| 5.94k| } 627| 5.94k| } 628| 5.94k|} _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| 5.94k| const auto store_elementwise = [&] { 608| 5.94k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 5.94k| std::span out_s(out); 610| 34.3k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 34.3k, False: 5.94k] ------------------ 611| 34.3k| store_any(out_s.template first(), in_elem); 612| 34.3k| out_s = out_s.subspan(bytes_per_element); 613| 34.3k| } 614| 5.94k| }; _ZN5Botan6detail8load_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS0_20unsigned_integralishEmQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvPS6_PKhm: 483| 3.83k|inline constexpr void load_any(T out[], const uint8_t in[], size_t count) { 484| | // asserts that *in and *out point to the correct amount of memory 485| 3.83k| load_any(std::span(out, count), std::span(in, count * sizeof(T))); 486| 3.83k|} _ZN5Botan6detail8load_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeENS2_4spanImLm18446744073709551615EEETkNS5_16contiguous_rangeIhEENS6_IKhLm18446744073709551615EEEQaa20unsigned_integralishINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT1_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISI_EESJ_E4type10value_typeEEoosr3stdE7same_asIS4_T0_Esr3stdE7same_asISP_SO_EEEvOSF_RKT2_: 355| 3.83k|inline constexpr void load_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 356| 3.83k| ranges::assert_equal_byte_lengths(out, in); 357| 3.83k| using element_type = std::ranges::range_value_t; 358| | 359| 3.83k| const auto load_elementwise = [&] { 360| 3.83k| constexpr size_t bytes_per_element = sizeof(element_type); 361| 3.83k| std::span in_s(in); 362| 3.83k| for(auto& out_elem : out) { 363| 3.83k| out_elem = load_any(in_s.template first()); 364| 3.83k| in_s = in_s.subspan(bytes_per_element); 365| 3.83k| } 366| 3.83k| }; 367| | 368| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 369| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 370| | // in a `constexpr` context. 371| 3.83k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (371:7): [Folded, False: 3.83k] ------------------ 372| 0| load_elementwise(); 373| 3.83k| } else { 374| 3.83k| if constexpr(endianness == std::endian::native && !custom_loadable) { 375| 3.83k| typecast_copy(out, in); 376| | } else { 377| | load_elementwise(); 378| | } 379| 3.83k| } 380| 3.83k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEmQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvPS6_PKhm: 483| 335|inline constexpr void load_any(T out[], const uint8_t in[], size_t count) { 484| | // asserts that *in and *out point to the correct amount of memory 485| 335| load_any(std::span(out, count), std::span(in, count * sizeof(T))); 486| 335|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeENS2_4spanImLm18446744073709551615EEETkNS5_16contiguous_rangeIhEENS6_IKhLm18446744073709551615EEEQaa20unsigned_integralishINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT1_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISI_EESJ_E4type10value_typeEEoosr3stdE7same_asIS4_T0_Esr3stdE7same_asISP_SO_EEEvOSF_RKT2_: 355| 335|inline constexpr void load_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 356| 335| ranges::assert_equal_byte_lengths(out, in); 357| 335| using element_type = std::ranges::range_value_t; 358| | 359| 335| const auto load_elementwise = [&] { 360| 335| constexpr size_t bytes_per_element = sizeof(element_type); 361| 335| std::span in_s(in); 362| 335| for(auto& out_elem : out) { 363| 335| out_elem = load_any(in_s.template first()); 364| 335| in_s = in_s.subspan(bytes_per_element); 365| 335| } 366| 335| }; 367| | 368| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 369| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 370| | // in a `constexpr` context. 371| 335| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (371:7): [Folded, False: 335] ------------------ 372| 0| load_elementwise(); 373| 335| } else { 374| | if constexpr(endianness == std::endian::native && !custom_loadable) { 375| | typecast_copy(out, in); 376| 335| } else { 377| 335| load_elementwise(); 378| 335| } 379| 335| } 380| 335|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeENS2_4spanImLm18446744073709551615EEETkNS5_16contiguous_rangeIhEENS6_IKhLm18446744073709551615EEEQaa20unsigned_integralishINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT1_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISI_EESJ_E4type10value_typeEEoosr3stdE7same_asIS4_T0_Esr3stdE7same_asISP_SO_EEEvOSF_RKT2_ENKUlvE_clEv: 359| 335| const auto load_elementwise = [&] { 360| 335| constexpr size_t bytes_per_element = sizeof(element_type); 361| 335| std::span in_s(in); 362| 670| for(auto& out_elem : out) { ------------------ | Branch (362:26): [True: 670, False: 335] ------------------ 363| 670| out_elem = load_any(in_s.template first()); 364| 670| in_s = in_s.subspan(bytes_per_element); 365| 670| } 366| 335| }; _ZN5Botan7load_beImJNSt3__14spanIKhLm8EEEEEEDaDpOT0_: 504| 195k|inline constexpr auto load_be(ParamTs&&... params) { 505| 195k| return detail::load_any(std::forward(params)...); 506| 195k|} _ZN5Botan7load_beImJRNSt3__15arrayIhLm8EEEEEEDaDpOT0_: 504| 26.4k|inline constexpr auto load_be(ParamTs&&... params) { 505| 26.4k| return detail::load_any(std::forward(params)...); 506| 26.4k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEERNS2_5arrayIhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 26.4k|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 26.4k| using OutT = detail::wrapped_type; 280| 26.4k| ranges::assert_exact_byte_length(in_range); 281| | 282| 26.4k| 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| 26.4k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 26.4k| return fallback_load_any(std::forward(in_range)); 288| 26.4k| } else { 289| 26.4k| const std::span in{in_range}; 290| 26.4k| if constexpr(sizeof(OutT) == 1) { 291| 26.4k| return static_cast(in[0]); 292| 26.4k| } else if constexpr(endianness == std::endian::native) { 293| 26.4k| return typecast_copy(in); 294| 26.4k| } else { 295| 26.4k| static_assert(opposite(endianness) == std::endian::native); 296| 26.4k| return reverse_bytes(typecast_copy(in)); 297| 26.4k| } 298| 26.4k| } 299| 26.4k| }()); 300| 26.4k|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEERNS2_5arrayIhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 26.4k| 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| 26.4k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 26.4k] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 26.4k| } else { 289| 26.4k| 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| 26.4k| } else { 295| 26.4k| static_assert(opposite(endianness) == std::endian::native); 296| 26.4k| return reverse_bytes(typecast_copy(in)); 297| 26.4k| } 298| 26.4k| } 299| 26.4k| }()); _ZN5Botan8store_beINS_6detail10AutoDetectEJRmPhEEEDaDpOT0_: 745| 300|inline constexpr auto store_be(ParamTs&&... params) { 746| 300| return detail::store_any(std::forward(params)...); 747| 300|} _ZN5Botan8store_leINS_6detail10AutoDetectEJPhmmmmEEEDaDpOT0_: 736| 2|inline constexpr auto store_le(ParamTs&&... params) { 737| 2| return detail::store_any(std::forward(params)...); 738| 2|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS0_20unsigned_integralishEmTpTkNS0_20unsigned_integralishEJmmmEQaaoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_E10all_same_vIS6_DpT2_EEEvPhS6_S8_: 723| 2|inline constexpr void store_any(uint8_t out[], T0 in0, Ts... ins) { 724| 2| constexpr auto bytes = sizeof(in0) + (sizeof(ins) + ... + 0); 725| | // asserts that *out points to the correct amount of memory 726| 2| store_any(std::span(out, bytes), in0, ins...); 727| 2|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005EmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm32EEETpTkNS0_20unsigned_integralishEJmmmmEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_: 582| 2|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, Ts... ins) { 583| 2| ranges::assert_exact_byte_length<(sizeof(Ts) + ...)>(out); 584| 2| auto store_one = [off = 0](auto o, T i) mutable { 585| 2| store_any(i, o.subspan(off).template first()); 586| 2| off += sizeof(T); 587| 2| }; 588| | 589| 2| (store_one(std::span{out}, ins), ...); 590| 2|} _ZZN5Botan6detail9store_anyILNSt3__16endianE57005EmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm32EEETpTkNS0_20unsigned_integralishEJmmmmEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_ENUlTyS9_T_E_clImS7_EEDaS9_SE_: 584| 8| auto store_one = [off = 0](auto o, T i) mutable { 585| 8| store_any(i, o.subspan(off).template first()); 586| 8| off += sizeof(T); 587| 8| }; _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeENS2_5arrayIhLm1EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS8_Esr3stdE21default_initializableIS8_Esr8conceptsE21resizable_byte_bufferIS8_EEEDaOT1_ENKUlRKT_E_clIS7_EEDaSD_: 664| 2.30k| auto out = []([[maybe_unused]] const auto& in) { 665| 2.30k| if constexpr(std::same_as) { 666| 2.30k| if constexpr(ranges::statically_spanable_range) { 667| 2.30k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 2.30k| 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.30k| }(in_range); _ZN5Botan6detail26unwrap_strong_type_or_enumITkNS0_20unsigned_integralishEhEEDaT_: 190| 2.30k|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| 2.30k| } else { 195| 2.30k| return Botan::unwrap_strong_type(t); 196| 2.30k| } 197| 2.30k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEhTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm1EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvS9_OT1_: 525| 2.30k|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) { 526| 2.30k| const auto in = detail::unwrap_strong_type_or_enum(wrapped_in); 527| 2.30k| using InT = decltype(in); 528| 2.30k| ranges::assert_exact_byte_length(out_range); 529| 2.30k| 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| 2.30k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (534:7): [Folded, False: 2.30k] ------------------ 535| 0| return fallback_store_any(in, std::forward(out_range)); 536| 2.30k| } else { 537| 2.30k| if constexpr(sizeof(InT) == 1) { 538| 2.30k| out[0] = static_cast(in); 539| | } else if constexpr(endianness == std::endian::native) { 540| | typecast_copy(out, in); 541| | } else { 542| | static_assert(opposite(endianness) == std::endian::native); 543| | typecast_copy(out, reverse_bytes(in)); 544| | } 545| 2.30k| } 546| 2.30k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EhTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm1EEETpTkNS0_20unsigned_integralishEJhEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_ENUlTyS9_T_E_clIhS7_EEDaS9_SE_: 584| 2.30k| auto store_one = [off = 0](auto o, T i) mutable { 585| 2.30k| store_any(i, o.subspan(off).template first()); 586| 2.30k| off += sizeof(T); 587| 2.30k| }; _ZN5Botan6detail9store_anyILNSt3__16endianE64206EhTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm1EEETpTkNS0_20unsigned_integralishEJhEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_: 582| 2.30k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, Ts... ins) { 583| 2.30k| ranges::assert_exact_byte_length<(sizeof(Ts) + ...)>(out); 584| 2.30k| auto store_one = [off = 0](auto o, T i) mutable { 585| 2.30k| store_any(i, o.subspan(off).template first()); 586| 2.30k| off += sizeof(T); 587| 2.30k| }; 588| | 589| 2.30k| (store_one(std::span{out}, ins), ...); 590| 2.30k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206EhTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm1EEETkNS4_14spanable_rangeES7_Qoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISA_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISI_EESJ_E4type10value_typeEEEEvOT1_RKSF_: 603| 2.30k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 2.30k| ranges::assert_equal_byte_lengths(out, in); 605| 2.30k| using element_type = std::ranges::range_value_t; 606| | 607| 2.30k| const auto store_elementwise = [&] { 608| 2.30k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 2.30k| std::span out_s(out); 610| 2.30k| for(const auto in_elem : in) { 611| 2.30k| store_any(out_s.template first(), in_elem); 612| 2.30k| out_s = out_s.subspan(bytes_per_element); 613| 2.30k| } 614| 2.30k| }; 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.30k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 2.30k] ------------------ 620| 0| store_elementwise(); 621| 2.30k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 2.30k| } else { 625| 2.30k| store_elementwise(); 626| 2.30k| } 627| 2.30k| } 628| 2.30k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeENS2_5arrayIhLm1EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS8_Esr3stdE21default_initializableIS8_Esr8conceptsE21resizable_byte_bufferIS8_EEEDaOT1_: 663| 2.30k|inline constexpr auto store_any(InR&& in_range) { 664| 2.30k| auto out = []([[maybe_unused]] const auto& in) { 665| 2.30k| if constexpr(std::same_as) { 666| 2.30k| if constexpr(ranges::statically_spanable_range) { 667| 2.30k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 2.30k| return std::array(); 669| 2.30k| } else { 670| 2.30k| static_assert( 671| 2.30k| !std::same_as, 672| 2.30k| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 2.30k| } 674| 2.30k| } else if constexpr(concepts::resizable_byte_buffer) { 675| 2.30k| return OutR(std::span{in}.size_bytes()); 676| 2.30k| } else { 677| 2.30k| return OutR{}; 678| 2.30k| } 679| 2.30k| }(in_range); 680| | 681| 2.30k| store_any>(out, std::forward(in_range)); 682| 2.30k| return out; 683| 2.30k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETpTkNS0_20unsigned_integralishEJhEQ10all_same_vIDpT1_EEEDaS6_: 696| 2.30k|inline constexpr auto store_any(Ts... ins) { 697| 2.30k| return store_any(std::array{ins...}); 698| 2.30k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeENS2_5arrayItLm1EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS8_Esr3stdE21default_initializableIS8_Esr8conceptsE21resizable_byte_bufferIS8_EEEDaOT1_ENKUlRKT_E_clIS7_EEDaSD_: 664| 4.61k| auto out = []([[maybe_unused]] const auto& in) { 665| 4.61k| if constexpr(std::same_as) { 666| 4.61k| if constexpr(ranges::statically_spanable_range) { 667| 4.61k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 4.61k| 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| 4.61k| }(in_range); _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EtTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm2EEETpTkNS0_20unsigned_integralishEJtEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_ENUlTyS9_T_E_clItS7_EEDaS9_SE_: 584| 4.61k| auto store_one = [off = 0](auto o, T i) mutable { 585| 4.61k| store_any(i, o.subspan(off).template first()); 586| 4.61k| off += sizeof(T); 587| 4.61k| }; _ZN5Botan6detail9store_anyILNSt3__16endianE64206EtTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm2EEETpTkNS0_20unsigned_integralishEJtEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_: 582| 4.61k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, Ts... ins) { 583| 4.61k| ranges::assert_exact_byte_length<(sizeof(Ts) + ...)>(out); 584| 4.61k| auto store_one = [off = 0](auto o, T i) mutable { 585| 4.61k| store_any(i, o.subspan(off).template first()); 586| 4.61k| off += sizeof(T); 587| 4.61k| }; 588| | 589| 4.61k| (store_one(std::span{out}, ins), ...); 590| 4.61k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206EtTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm2EEETkNS4_14spanable_rangeENS6_ItLm1EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_: 603| 4.61k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 4.61k| ranges::assert_equal_byte_lengths(out, in); 605| 4.61k| using element_type = std::ranges::range_value_t; 606| | 607| 4.61k| const auto store_elementwise = [&] { 608| 4.61k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 4.61k| std::span out_s(out); 610| 4.61k| for(const auto in_elem : in) { 611| 4.61k| store_any(out_s.template first(), in_elem); 612| 4.61k| out_s = out_s.subspan(bytes_per_element); 613| 4.61k| } 614| 4.61k| }; 615| | 616| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 617| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 618| | // in a `constexpr` context. 619| 4.61k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 4.61k] ------------------ 620| 0| store_elementwise(); 621| 4.61k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 4.61k| } else { 625| 4.61k| store_elementwise(); 626| 4.61k| } 627| 4.61k| } 628| 4.61k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeENS2_5arrayItLm1EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS8_Esr3stdE21default_initializableIS8_Esr8conceptsE21resizable_byte_bufferIS8_EEEDaOT1_: 663| 4.61k|inline constexpr auto store_any(InR&& in_range) { 664| 4.61k| auto out = []([[maybe_unused]] const auto& in) { 665| 4.61k| if constexpr(std::same_as) { 666| 4.61k| if constexpr(ranges::statically_spanable_range) { 667| 4.61k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 4.61k| return std::array(); 669| 4.61k| } else { 670| 4.61k| static_assert( 671| 4.61k| !std::same_as, 672| 4.61k| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 4.61k| } 674| 4.61k| } else if constexpr(concepts::resizable_byte_buffer) { 675| 4.61k| return OutR(std::span{in}.size_bytes()); 676| 4.61k| } else { 677| 4.61k| return OutR{}; 678| 4.61k| } 679| 4.61k| }(in_range); 680| | 681| 4.61k| store_any>(out, std::forward(in_range)); 682| 4.61k| return out; 683| 4.61k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETpTkNS0_20unsigned_integralishEJtEQ10all_same_vIDpT1_EEEDaS6_: 696| 4.61k|inline constexpr auto store_any(Ts... ins) { 697| 4.61k| return store_any(std::array{ins...}); 698| 4.61k|} _ZN5Botan8store_beINS_6detail10AutoDetectEJtEEEDaDpOT0_: 745| 2.30k|inline constexpr auto store_be(ParamTs&&... params) { 746| 2.30k| return detail::store_any(std::forward(params)...); 747| 2.30k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EhTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm1EEETkNS4_14spanable_rangeES7_Qoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISA_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISI_EESJ_E4type10value_typeEEEEvOT1_RKSF_ENKUlvE_clEv: 607| 2.30k| const auto store_elementwise = [&] { 608| 2.30k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 2.30k| std::span out_s(out); 610| 2.30k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 2.30k, False: 2.30k] ------------------ 611| 2.30k| store_any(out_s.template first(), in_elem); 612| 2.30k| out_s = out_s.subspan(bytes_per_element); 613| 2.30k| } 614| 2.30k| }; _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EtTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm2EEETkNS4_14spanable_rangeENS6_ItLm1EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISB_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEEvOT1_RKSG_ENKUlvE_clEv: 607| 4.61k| const auto store_elementwise = [&] { 608| 4.61k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 4.61k| std::span out_s(out); 610| 4.61k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 4.61k, False: 4.61k] ------------------ 611| 4.61k| store_any(out_s.template first(), in_elem); 612| 4.61k| out_s = out_s.subspan(bytes_per_element); 613| 4.61k| } 614| 4.61k| }; _ZN5Botan8store_beINS_6detail10AutoDetectEJhEEEDaDpOT0_: 745| 2.30k|inline constexpr auto store_be(ParamTs&&... params) { 746| 2.30k| return detail::store_any(std::forward(params)...); 747| 2.30k|} _ZN5Botan8store_beINS_6detail10AutoDetectEJRKjPhEEEDaDpOT0_: 745| 9.10k|inline constexpr auto store_be(ParamTs&&... params) { 746| 9.10k| return detail::store_any(std::forward(params)...); 747| 9.10k|} _ZN5Botan8store_beINS_6detail10AutoDetectEJjPhEEEDaDpOT0_: 745| 520|inline constexpr auto store_be(ParamTs&&... params) { 746| 520| return detail::store_any(std::forward(params)...); 747| 520|} _ZN5Botan7load_leIjJPjPKhmEEEDaDpOT0_: 495| 35|inline constexpr auto load_le(ParamTs&&... params) { 496| 35| return detail::load_any(std::forward(params)...); 497| 35|} _ZN5Botan6detail8load_anyILNSt3__16endianE57005EjTkNS0_20unsigned_integralishEjQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asIT1_S5_EEEvPS6_PKhm: 483| 35|inline constexpr void load_any(T out[], const uint8_t in[], size_t count) { 484| | // asserts that *in and *out point to the correct amount of memory 485| 35| load_any(std::span(out, count), std::span(in, count * sizeof(T))); 486| 35|} _ZN5Botan6detail8load_anyILNSt3__16endianE57005EjTkNS_6ranges23contiguous_output_rangeENS2_4spanIjLm18446744073709551615EEETkNS4_16contiguous_rangeIhEENS5_IKhLm18446744073709551615EEEQaa20unsigned_integralishINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT1_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISH_EESI_E4type10value_typeEEoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISP_SN_EEEvOSE_RKT2_: 355| 35|inline constexpr void load_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 356| 35| ranges::assert_equal_byte_lengths(out, in); 357| 35| using element_type = std::ranges::range_value_t; 358| | 359| 35| const auto load_elementwise = [&] { 360| 35| constexpr size_t bytes_per_element = sizeof(element_type); 361| 35| std::span in_s(in); 362| 35| for(auto& out_elem : out) { 363| 35| out_elem = load_any(in_s.template first()); 364| 35| in_s = in_s.subspan(bytes_per_element); 365| 35| } 366| 35| }; 367| | 368| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 369| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 370| | // in a `constexpr` context. 371| 35| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (371:7): [Folded, False: 35] ------------------ 372| 0| load_elementwise(); 373| 35| } else { 374| 35| if constexpr(endianness == std::endian::native && !custom_loadable) { 375| 35| typecast_copy(out, in); 376| | } else { 377| | load_elementwise(); 378| | } 379| 35| } 380| 35|} _ZN5Botan7load_beIjJPhiEEEDaDpOT0_: 504| 317|inline constexpr auto load_be(ParamTs&&... params) { 505| 317| return detail::load_any(std::forward(params)...); 506| 317|} _ZN5Botan7load_beImJPhiEEEDaDpOT0_: 504| 3.82k|inline constexpr auto load_be(ParamTs&&... params) { 505| 3.82k| return detail::load_any(std::forward(params)...); 506| 3.82k|} _ZN5Botan7load_beIhJPKhRmEEEDaDpOT0_: 504| 956k|inline constexpr auto load_be(ParamTs&&... params) { 505| 956k| return detail::load_any(std::forward(params)...); 506| 956k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEhEET0_PKhm: 454| 956k|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| 956k| constexpr size_t out_size = sizeof(OutT); 457| 956k| return load_any(std::span(in + off * out_size, out_size)); 458| 956k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEhTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm1EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 956k|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 956k| using OutT = detail::wrapped_type; 280| 956k| ranges::assert_exact_byte_length(in_range); 281| | 282| 956k| 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| 956k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 956k| return fallback_load_any(std::forward(in_range)); 288| 956k| } else { 289| 956k| const std::span in{in_range}; 290| 956k| if constexpr(sizeof(OutT) == 1) { 291| 956k| return static_cast(in[0]); 292| 956k| } else if constexpr(endianness == std::endian::native) { 293| 956k| return typecast_copy(in); 294| 956k| } else { 295| 956k| static_assert(opposite(endianness) == std::endian::native); 296| 956k| return reverse_bytes(typecast_copy(in)); 297| 956k| } 298| 956k| } 299| 956k| }()); 300| 956k|} _ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEhTkNSt3__117unsigned_integralEhEEDaT0_: 200| 956k|constexpr auto wrap_strong_type_or_enum(T t) { 201| | if constexpr(std::is_enum_v) { 202| | return static_cast(t); 203| 956k| } else { 204| 956k| return Botan::wrap_strong_type(t); 205| 956k| } 206| 956k|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEhTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm1EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 956k| 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| 956k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 956k] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 956k| } else { 289| 956k| const std::span in{in_range}; 290| 956k| if constexpr(sizeof(OutT) == 1) { 291| 956k| return static_cast(in[0]); 292| | } else if constexpr(endianness == std::endian::native) { 293| | return typecast_copy(in); 294| | } else { 295| | static_assert(opposite(endianness) == std::endian::native); 296| | return reverse_bytes(typecast_copy(in)); 297| | } 298| 956k| } 299| 956k| }()); _ZN5Botan12get_byte_varIhEEhmT_: 69| 419k|inline constexpr uint8_t get_byte_var(size_t byte_num, T input) { 70| 419k| return static_cast(input >> (((~byte_num) & (sizeof(T) - 1)) << 3)); 71| 419k|} _ZN5Botan8store_beINS_6detail10AutoDetectEJRKmRKNSt3__14spanIhLm18446744073709551615EEEEEEDaDpOT0_: 745| 2.60k|inline constexpr auto store_be(ParamTs&&... params) { 746| 2.60k| return detail::store_any(std::forward(params)...); 747| 2.60k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEERKNS2_4spanIhLm18446744073709551615EEEQsr3stdE7same_asIS4_T0_EEEvT1_OT2_: 646| 2.60k|inline constexpr void store_any(T in, OutR&& out_range) { 647| 2.60k| store_any(in, std::forward(out_range)); 648| 2.60k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEERKNS2_4spanIhLm18446744073709551615EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvSB_OT1_: 525| 2.60k|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) { 526| 2.60k| const auto in = detail::unwrap_strong_type_or_enum(wrapped_in); 527| 2.60k| using InT = decltype(in); 528| 2.60k| ranges::assert_exact_byte_length(out_range); 529| 2.60k| 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| 2.60k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (534:7): [Folded, False: 2.60k] ------------------ 535| 0| return fallback_store_any(in, std::forward(out_range)); 536| 2.60k| } 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| 2.60k| } else { 542| 2.60k| static_assert(opposite(endianness) == std::endian::native); 543| 2.60k| typecast_copy(out, reverse_bytes(in)); 544| 2.60k| } 545| 2.60k| } 546| 2.60k|} _ZN5Botan7load_beINS_6detail10AutoDetectEJNSt3__14spanIKhLm2EEEEEEDaDpOT0_: 504| 143k|inline constexpr auto load_be(ParamTs&&... params) { 505| 143k| return detail::load_any(std::forward(params)...); 506| 143k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm2EEEQoosr3stdE7same_asIS4_T0_Eaaoosr6rangesE25statically_spanable_rangeISA_Esr8conceptsE19resizable_containerISA_E20unsigned_integralishINSA_10value_typeEEEEDaOT1_: 397| 143k|inline constexpr auto load_any(InR&& in_range) { 398| 143k| auto out = []([[maybe_unused]] const auto& in) { 399| 143k| if constexpr(std::same_as) { 400| 143k| if constexpr(ranges::statically_spanable_range) { 401| 143k| constexpr size_t extent = decltype(std::span{in})::extent; 402| | 403| | // clang-format off 404| 143k| using type = 405| 143k| std::conditional_t>>>; 409| | // clang-format on 410| | 411| 143k| static_assert( 412| 143k| !std::is_void_v, 413| 143k| "Cannot determine the output type based on a statically sized bytearray with length other than those: 1, 2, 4, 8"); 414| | 415| 143k| return type{}; 416| 143k| } else { 417| 143k| static_assert( 418| 143k| !std::same_as, 419| 143k| "cannot infer return type from a dynamic range at compile time, please specify it explicitly"); 420| 143k| } 421| 143k| } else if constexpr(concepts::resizable_container) { 422| 143k| const size_t in_bytes = std::span{in}.size_bytes(); 423| 143k| constexpr size_t out_elem_bytes = sizeof(typename OutT::value_type); 424| 143k| BOTAN_ARG_CHECK(in_bytes % out_elem_bytes == 0, 425| 143k| "Input range is not word-aligned with the requested output range"); 426| 143k| return OutT(in_bytes / out_elem_bytes); 427| 143k| } else { 428| 143k| return OutT{}; 429| 143k| } 430| 143k| }(in_range); 431| | 432| 143k| using out_type = decltype(out); 433| 143k| if constexpr(unsigned_integralish) { 434| 143k| out = load_any(std::forward(in_range)); 435| | } else { 436| | static_assert(ranges::contiguous_range); 437| | using out_range_type = std::ranges::range_value_t; 438| | load_any(out, std::forward(in_range)); 439| | } 440| 143k| return out; 441| 143k|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm2EEEQoosr3stdE7same_asIS4_T0_Eaaoosr6rangesE25statically_spanable_rangeISA_Esr8conceptsE19resizable_containerISA_E20unsigned_integralishINSA_10value_typeEEEEDaOT1_ENKUlRKT_E_clIS9_EEDaSG_: 398| 143k| auto out = []([[maybe_unused]] const auto& in) { 399| 143k| if constexpr(std::same_as) { 400| 143k| if constexpr(ranges::statically_spanable_range) { 401| 143k| constexpr size_t extent = decltype(std::span{in})::extent; 402| | 403| | // clang-format off 404| 143k| using type = 405| 143k| std::conditional_t>>>; 409| | // clang-format on 410| | 411| 143k| static_assert( 412| 143k| !std::is_void_v, 413| 143k| "Cannot determine the output type based on a statically sized bytearray with length other than those: 1, 2, 4, 8"); 414| | 415| 143k| return type{}; 416| | } else { 417| | static_assert( 418| | !std::same_as, 419| | "cannot infer return type from a dynamic range at compile time, please specify it explicitly"); 420| | } 421| | } else if constexpr(concepts::resizable_container) { 422| | const size_t in_bytes = std::span{in}.size_bytes(); 423| | constexpr size_t out_elem_bytes = sizeof(typename OutT::value_type); 424| | BOTAN_ARG_CHECK(in_bytes % out_elem_bytes == 0, 425| | "Input range is not word-aligned with the requested output range"); 426| | return OutT(in_bytes / out_elem_bytes); 427| | } else { 428| | return OutT{}; 429| | } 430| 143k| }(in_range); _ZN5Botan7load_beItJPKhiEEEDaDpOT0_: 504| 2.22k|inline constexpr auto load_be(ParamTs&&... params) { 505| 2.22k| return detail::load_any(std::forward(params)...); 506| 2.22k|} _ZN5Botan8store_beINS_6detail10AutoDetectEJRtPhEEEDaDpOT0_: 745| 19|inline constexpr auto store_be(ParamTs&&... params) { 746| 19| return detail::store_any(std::forward(params)...); 747| 19|} _ZN5Botan8store_beINS_6detail10AutoDetectEJRmNSt3__14spanIhLm8EEEEEEDaDpOT0_: 745| 119|inline constexpr auto store_be(ParamTs&&... params) { 746| 119| return detail::store_any(std::forward(params)...); 747| 119|} _ZN5Botan8store_beINS_6detail10AutoDetectEJmmEEEDaDpOT0_: 745| 87|inline constexpr auto store_be(ParamTs&&... params) { 746| 87| return detail::store_any(std::forward(params)...); 747| 87|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETpTkNS0_20unsigned_integralishEJmmEQ10all_same_vIDpT1_EEEDaS6_: 696| 87|inline constexpr auto store_any(Ts... ins) { 697| 87| return store_any(std::array{ins...}); 698| 87|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeENS2_5arrayImLm2EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS8_Esr3stdE21default_initializableIS8_Esr8conceptsE21resizable_byte_bufferIS8_EEEDaOT1_: 663| 87|inline constexpr auto store_any(InR&& in_range) { 664| 87| auto out = []([[maybe_unused]] const auto& in) { 665| 87| if constexpr(std::same_as) { 666| 87| if constexpr(ranges::statically_spanable_range) { 667| 87| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 87| return std::array(); 669| 87| } else { 670| 87| static_assert( 671| 87| !std::same_as, 672| 87| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 87| } 674| 87| } else if constexpr(concepts::resizable_byte_buffer) { 675| 87| return OutR(std::span{in}.size_bytes()); 676| 87| } else { 677| 87| return OutR{}; 678| 87| } 679| 87| }(in_range); 680| | 681| 87| store_any>(out, std::forward(in_range)); 682| 87| return out; 683| 87|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeENS2_5arrayImLm2EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS8_Esr3stdE21default_initializableIS8_Esr8conceptsE21resizable_byte_bufferIS8_EEEDaOT1_ENKUlRKT_E_clIS7_EEDaSD_: 664| 87| auto out = []([[maybe_unused]] const auto& in) { 665| 87| if constexpr(std::same_as) { 666| 87| if constexpr(ranges::statically_spanable_range) { 667| 87| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 87| 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| 87| }(in_range); _ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm16EEETkNS4_14spanable_rangeENS6_ImLm2EEEQoosr3stdE7same_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| 87|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 87| ranges::assert_equal_byte_lengths(out, in); 605| 87| using element_type = std::ranges::range_value_t; 606| | 607| 87| const auto store_elementwise = [&] { 608| 87| constexpr size_t bytes_per_element = sizeof(element_type); 609| 87| std::span out_s(out); 610| 87| for(const auto in_elem : in) { 611| 87| store_any(out_s.template first(), in_elem); 612| 87| out_s = out_s.subspan(bytes_per_element); 613| 87| } 614| 87| }; 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| 87| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 87] ------------------ 620| 0| store_elementwise(); 621| 87| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 87| } else { 625| 87| store_elementwise(); 626| 87| } 627| 87| } 628| 87|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_5arrayIhLm16EEETkNS4_14spanable_rangeENS6_ImLm2EEEQoosr3stdE7same_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| 87| const auto store_elementwise = [&] { 608| 87| constexpr size_t bytes_per_element = sizeof(element_type); 609| 87| std::span out_s(out); 610| 174| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 174, False: 87] ------------------ 611| 174| store_any(out_s.template first(), in_elem); 612| 174| out_s = out_s.subspan(bytes_per_element); 613| 174| } 614| 87| }; _ZN5Botan7load_beINS_6detail10AutoDetectEJRA2_mRPKhmEEEDaDpOT0_: 504| 335|inline constexpr auto load_be(ParamTs&&... params) { 505| 335| return detail::load_any(std::forward(params)...); 506| 335|} _ZN5Botan11copy_out_beITkNS_6ranges14spanable_rangeEA2_mEEvNSt3__14spanIhLm18446744073709551615EEERKT_: 773| 335|inline void copy_out_be(std::span out, const InR& in) { 774| 335| using T = std::ranges::range_value_t; 775| 335| std::span in_s{in}; 776| 335| const auto remaining_bytes = detail::copy_out_any_word_aligned_portion(out, in_s); 777| | 778| | // copy remaining bytes as a partial word 779| 335| for(size_t i = 0; i < remaining_bytes; ++i) { ------------------ | Branch (779:22): [True: 0, False: 335] ------------------ 780| 0| out[i] = get_byte_var(i, in_s.front()); 781| 0| } 782| 335|} _ZN5Botan7load_beImJPKhmEEEDaDpOT0_: 504| 340k|inline constexpr auto load_be(ParamTs&&... params) { 505| 340k| return detail::load_any(std::forward(params)...); 506| 340k|} _ZN5Botan7load_leINS_6detail10AutoDetectEJRA4_mPKhRKmEEEDaDpOT0_: 495| 1.65k|inline constexpr auto load_le(ParamTs&&... params) { 496| 1.65k| return detail::load_any(std::forward(params)...); 497| 1.65k|} _ZN5Botan8store_beINSt3__16vectorIhNS1_9allocatorIhEEEEJRA8_mEEEDaDpOT0_: 745| 1.65k|inline constexpr auto store_be(ParamTs&&... params) { 746| 1.65k| return detail::store_any(std::forward(params)...); 747| 1.65k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS2_6vectorIhNS2_9allocatorIhEEEETkNS_6ranges14spanable_rangeERA8_mQoooosr3stdE7same_asINS0_10AutoDetectET0_Eaasr6rangesE25statically_spanable_rangeISC_Esr3stdE21default_initializableISC_Esr8conceptsE21resizable_byte_bufferISC_EEEDaOT1_: 663| 1.65k|inline constexpr auto store_any(InR&& in_range) { 664| 1.65k| auto out = []([[maybe_unused]] const auto& in) { 665| 1.65k| if constexpr(std::same_as) { 666| 1.65k| if constexpr(ranges::statically_spanable_range) { 667| 1.65k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 1.65k| return std::array(); 669| 1.65k| } else { 670| 1.65k| static_assert( 671| 1.65k| !std::same_as, 672| 1.65k| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 1.65k| } 674| 1.65k| } else if constexpr(concepts::resizable_byte_buffer) { 675| 1.65k| return OutR(std::span{in}.size_bytes()); 676| 1.65k| } else { 677| 1.65k| return OutR{}; 678| 1.65k| } 679| 1.65k| }(in_range); 680| | 681| 1.65k| store_any>(out, std::forward(in_range)); 682| 1.65k| return out; 683| 1.65k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS2_6vectorIhNS2_9allocatorIhEEEETkNS_6ranges14spanable_rangeERA8_mQoooosr3stdE7same_asINS0_10AutoDetectET0_Eaasr6rangesE25statically_spanable_rangeISC_Esr3stdE21default_initializableISC_Esr8conceptsE21resizable_byte_bufferISC_EEEDaOT1_ENKUlRKT_E_clIS9_EEDaSH_: 664| 1.65k| auto out = []([[maybe_unused]] const auto& in) { 665| | if constexpr(std::same_as) { 666| | if constexpr(ranges::statically_spanable_range) { 667| | constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| | 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| 1.65k| } else if constexpr(concepts::resizable_byte_buffer) { 675| 1.65k| return OutR(std::span{in}.size_bytes()); 676| | } else { 677| | return OutR{}; 678| | } 679| 1.65k| }(in_range); _ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_6vectorIhNS2_9allocatorIhEEEETkNS4_14spanable_rangeEA8_mQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISD_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISL_EESM_E4type10value_typeEEEEvOT1_RKSI_: 603| 1.65k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 1.65k| ranges::assert_equal_byte_lengths(out, in); 605| 1.65k| using element_type = std::ranges::range_value_t; 606| | 607| 1.65k| const auto store_elementwise = [&] { 608| 1.65k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 1.65k| std::span out_s(out); 610| 1.65k| for(const auto in_elem : in) { 611| 1.65k| store_any(out_s.template first(), in_elem); 612| 1.65k| out_s = out_s.subspan(bytes_per_element); 613| 1.65k| } 614| 1.65k| }; 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.65k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 1.65k] ------------------ 620| 0| store_elementwise(); 621| 1.65k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 1.65k| } else { 625| 1.65k| store_elementwise(); 626| 1.65k| } 627| 1.65k| } 628| 1.65k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_6vectorIhNS2_9allocatorIhEEEETkNS4_14spanable_rangeEA8_mQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISD_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISL_EESM_E4type10value_typeEEEEvOT1_RKSI_ENKUlvE_clEv: 607| 1.65k| const auto store_elementwise = [&] { 608| 1.65k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 1.65k| std::span out_s(out); 610| 13.2k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 13.2k, False: 1.65k] ------------------ 611| 13.2k| store_any(out_s.template first(), in_elem); 612| 13.2k| out_s = out_s.subspan(bytes_per_element); 613| 13.2k| } 614| 1.65k| }; _ZN5Botan8store_beINS_6detail10AutoDetectEJRNSt3__14spanIhLm32EEERNS3_5arrayImLm4EEEEEEDaDpOT0_: 745| 46.3k|inline constexpr auto store_be(ParamTs&&... params) { 746| 46.3k| return detail::store_any(std::forward(params)...); 747| 46.3k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeIhEERNS2_4spanIhLm32EEETkNS5_14spanable_rangeENS2_5arrayImLm4EEEQoosr3stdE7same_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| 46.3k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 46.3k| ranges::assert_equal_byte_lengths(out, in); 605| 46.3k| using element_type = std::ranges::range_value_t; 606| | 607| 46.3k| const auto store_elementwise = [&] { 608| 46.3k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 46.3k| std::span out_s(out); 610| 46.3k| for(const auto in_elem : in) { 611| 46.3k| store_any(out_s.template first(), in_elem); 612| 46.3k| out_s = out_s.subspan(bytes_per_element); 613| 46.3k| } 614| 46.3k| }; 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| 46.3k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 46.3k] ------------------ 620| 0| store_elementwise(); 621| 46.3k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 46.3k| } else { 625| 46.3k| store_elementwise(); 626| 46.3k| } 627| 46.3k| } 628| 46.3k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeIhEERNS2_4spanIhLm32EEETkNS5_14spanable_rangeENS2_5arrayImLm4EEEQoosr3stdE7same_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| 46.3k| const auto store_elementwise = [&] { 608| 46.3k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 46.3k| std::span out_s(out); 610| 185k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 185k, False: 46.3k] ------------------ 611| 185k| store_any(out_s.template first(), in_elem); 612| 185k| out_s = out_s.subspan(bytes_per_element); 613| 185k| } 614| 46.3k| }; _ZN5Botan7load_leINS_6detail10AutoDetectEJRA6_mPKhRKmEEEDaDpOT0_: 495| 1.10k|inline constexpr auto load_le(ParamTs&&... params) { 496| 1.10k| return detail::load_any(std::forward(params)...); 497| 1.10k|} _ZN5Botan8store_beINSt3__16vectorIhNS1_9allocatorIhEEEEJRA12_mEEEDaDpOT0_: 745| 1.10k|inline constexpr auto store_be(ParamTs&&... params) { 746| 1.10k| return detail::store_any(std::forward(params)...); 747| 1.10k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS2_6vectorIhNS2_9allocatorIhEEEETkNS_6ranges14spanable_rangeERA12_mQoooosr3stdE7same_asINS0_10AutoDetectET0_Eaasr6rangesE25statically_spanable_rangeISC_Esr3stdE21default_initializableISC_Esr8conceptsE21resizable_byte_bufferISC_EEEDaOT1_: 663| 1.10k|inline constexpr auto store_any(InR&& in_range) { 664| 1.10k| auto out = []([[maybe_unused]] const auto& in) { 665| 1.10k| if constexpr(std::same_as) { 666| 1.10k| if constexpr(ranges::statically_spanable_range) { 667| 1.10k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 1.10k| return std::array(); 669| 1.10k| } else { 670| 1.10k| static_assert( 671| 1.10k| !std::same_as, 672| 1.10k| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 1.10k| } 674| 1.10k| } else if constexpr(concepts::resizable_byte_buffer) { 675| 1.10k| return OutR(std::span{in}.size_bytes()); 676| 1.10k| } else { 677| 1.10k| return OutR{}; 678| 1.10k| } 679| 1.10k| }(in_range); 680| | 681| 1.10k| store_any>(out, std::forward(in_range)); 682| 1.10k| return out; 683| 1.10k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS2_6vectorIhNS2_9allocatorIhEEEETkNS_6ranges14spanable_rangeERA12_mQoooosr3stdE7same_asINS0_10AutoDetectET0_Eaasr6rangesE25statically_spanable_rangeISC_Esr3stdE21default_initializableISC_Esr8conceptsE21resizable_byte_bufferISC_EEEDaOT1_ENKUlRKT_E_clIS9_EEDaSH_: 664| 1.10k| auto out = []([[maybe_unused]] const auto& in) { 665| | if constexpr(std::same_as) { 666| | if constexpr(ranges::statically_spanable_range) { 667| | constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| | 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| 1.10k| } else if constexpr(concepts::resizable_byte_buffer) { 675| 1.10k| return OutR(std::span{in}.size_bytes()); 676| | } else { 677| | return OutR{}; 678| | } 679| 1.10k| }(in_range); _ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_6vectorIhNS2_9allocatorIhEEEETkNS4_14spanable_rangeEA12_mQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISD_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISL_EESM_E4type10value_typeEEEEvOT1_RKSI_: 603| 1.10k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 1.10k| ranges::assert_equal_byte_lengths(out, in); 605| 1.10k| using element_type = std::ranges::range_value_t; 606| | 607| 1.10k| const auto store_elementwise = [&] { 608| 1.10k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 1.10k| std::span out_s(out); 610| 1.10k| for(const auto in_elem : in) { 611| 1.10k| store_any(out_s.template first(), in_elem); 612| 1.10k| out_s = out_s.subspan(bytes_per_element); 613| 1.10k| } 614| 1.10k| }; 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.10k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 1.10k] ------------------ 620| 0| store_elementwise(); 621| 1.10k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 1.10k| } else { 625| 1.10k| store_elementwise(); 626| 1.10k| } 627| 1.10k| } 628| 1.10k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_6vectorIhNS2_9allocatorIhEEEETkNS4_14spanable_rangeEA12_mQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISD_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISL_EESM_E4type10value_typeEEEEvOT1_RKSI_ENKUlvE_clEv: 607| 1.10k| const auto store_elementwise = [&] { 608| 1.10k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 1.10k| std::span out_s(out); 610| 13.2k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 13.2k, False: 1.10k] ------------------ 611| 13.2k| store_any(out_s.template first(), in_elem); 612| 13.2k| out_s = out_s.subspan(bytes_per_element); 613| 13.2k| } 614| 1.10k| }; _ZN5Botan8store_beINS_6detail10AutoDetectEJRNSt3__14spanIhLm48EEERNS3_5arrayImLm6EEEEEEDaDpOT0_: 745| 5.57k|inline constexpr auto store_be(ParamTs&&... params) { 746| 5.57k| return detail::store_any(std::forward(params)...); 747| 5.57k|} _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| 5.57k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 5.57k| ranges::assert_equal_byte_lengths(out, in); 605| 5.57k| using element_type = std::ranges::range_value_t; 606| | 607| 5.57k| const auto store_elementwise = [&] { 608| 5.57k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 5.57k| std::span out_s(out); 610| 5.57k| for(const auto in_elem : in) { 611| 5.57k| store_any(out_s.template first(), in_elem); 612| 5.57k| out_s = out_s.subspan(bytes_per_element); 613| 5.57k| } 614| 5.57k| }; 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| 5.57k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 5.57k] ------------------ 620| 0| store_elementwise(); 621| 5.57k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 5.57k| } else { 625| 5.57k| store_elementwise(); 626| 5.57k| } 627| 5.57k| } 628| 5.57k|} _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| 5.57k| const auto store_elementwise = [&] { 608| 5.57k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 5.57k| std::span out_s(out); 610| 33.4k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 33.4k, False: 5.57k] ------------------ 611| 33.4k| store_any(out_s.template first(), in_elem); 612| 33.4k| out_s = out_s.subspan(bytes_per_element); 613| 33.4k| } 614| 5.57k| }; _ZN5Botan7load_leINS_6detail10AutoDetectEJRA8_mPKhRKmEEEDaDpOT0_: 495| 558|inline constexpr auto load_le(ParamTs&&... params) { 496| 558| return detail::load_any(std::forward(params)...); 497| 558|} _ZN5Botan8store_beINSt3__16vectorIhNS1_9allocatorIhEEEEJRA16_mEEEDaDpOT0_: 745| 558|inline constexpr auto store_be(ParamTs&&... params) { 746| 558| return detail::store_any(std::forward(params)...); 747| 558|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS2_6vectorIhNS2_9allocatorIhEEEETkNS_6ranges14spanable_rangeERA16_mQoooosr3stdE7same_asINS0_10AutoDetectET0_Eaasr6rangesE25statically_spanable_rangeISC_Esr3stdE21default_initializableISC_Esr8conceptsE21resizable_byte_bufferISC_EEEDaOT1_: 663| 558|inline constexpr auto store_any(InR&& in_range) { 664| 558| auto out = []([[maybe_unused]] const auto& in) { 665| 558| if constexpr(std::same_as) { 666| 558| if constexpr(ranges::statically_spanable_range) { 667| 558| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 558| return std::array(); 669| 558| } else { 670| 558| static_assert( 671| 558| !std::same_as, 672| 558| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 558| } 674| 558| } else if constexpr(concepts::resizable_byte_buffer) { 675| 558| return OutR(std::span{in}.size_bytes()); 676| 558| } else { 677| 558| return OutR{}; 678| 558| } 679| 558| }(in_range); 680| | 681| 558| store_any>(out, std::forward(in_range)); 682| 558| return out; 683| 558|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS2_6vectorIhNS2_9allocatorIhEEEETkNS_6ranges14spanable_rangeERA16_mQoooosr3stdE7same_asINS0_10AutoDetectET0_Eaasr6rangesE25statically_spanable_rangeISC_Esr3stdE21default_initializableISC_Esr8conceptsE21resizable_byte_bufferISC_EEEDaOT1_ENKUlRKT_E_clIS9_EEDaSH_: 664| 558| auto out = []([[maybe_unused]] const auto& in) { 665| | if constexpr(std::same_as) { 666| | if constexpr(ranges::statically_spanable_range) { 667| | constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| | 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| 558| } else if constexpr(concepts::resizable_byte_buffer) { 675| 558| return OutR(std::span{in}.size_bytes()); 676| | } else { 677| | return OutR{}; 678| | } 679| 558| }(in_range); _ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_6vectorIhNS2_9allocatorIhEEEETkNS4_14spanable_rangeEA16_mQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISD_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISL_EESM_E4type10value_typeEEEEvOT1_RKSI_: 603| 558|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 558| ranges::assert_equal_byte_lengths(out, in); 605| 558| using element_type = std::ranges::range_value_t; 606| | 607| 558| const auto store_elementwise = [&] { 608| 558| constexpr size_t bytes_per_element = sizeof(element_type); 609| 558| std::span out_s(out); 610| 558| for(const auto in_elem : in) { 611| 558| store_any(out_s.template first(), in_elem); 612| 558| out_s = out_s.subspan(bytes_per_element); 613| 558| } 614| 558| }; 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| 558| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 558] ------------------ 620| 0| store_elementwise(); 621| 558| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 558| } else { 625| 558| store_elementwise(); 626| 558| } 627| 558| } 628| 558|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_6vectorIhNS2_9allocatorIhEEEETkNS4_14spanable_rangeEA16_mQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISD_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISL_EESM_E4type10value_typeEEEEvOT1_RKSI_ENKUlvE_clEv: 607| 558| const auto store_elementwise = [&] { 608| 558| constexpr size_t bytes_per_element = sizeof(element_type); 609| 558| std::span out_s(out); 610| 8.92k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 8.92k, False: 558] ------------------ 611| 8.92k| store_any(out_s.template first(), in_elem); 612| 8.92k| out_s = out_s.subspan(bytes_per_element); 613| 8.92k| } 614| 558| }; _ZN5Botan8store_beINS_6detail10AutoDetectEJRNSt3__14spanIhLm64EEERNS3_5arrayImLm8EEEEEEDaDpOT0_: 745| 2.95k|inline constexpr auto store_be(ParamTs&&... params) { 746| 2.95k| return detail::store_any(std::forward(params)...); 747| 2.95k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeIhEERNS2_4spanIhLm64EEETkNS5_14spanable_rangeENS2_5arrayImLm8EEEQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asISC_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISK_EESL_E4type10value_typeEEEEvOT1_RKSH_: 603| 2.95k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 2.95k| ranges::assert_equal_byte_lengths(out, in); 605| 2.95k| using element_type = std::ranges::range_value_t; 606| | 607| 2.95k| const auto store_elementwise = [&] { 608| 2.95k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 2.95k| std::span out_s(out); 610| 2.95k| for(const auto in_elem : in) { 611| 2.95k| store_any(out_s.template first(), in_elem); 612| 2.95k| out_s = out_s.subspan(bytes_per_element); 613| 2.95k| } 614| 2.95k| }; 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.95k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 2.95k] ------------------ 620| 0| store_elementwise(); 621| 2.95k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 2.95k| } else { 625| 2.95k| store_elementwise(); 626| 2.95k| } 627| 2.95k| } 628| 2.95k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeIhEERNS2_4spanIhLm64EEETkNS5_14spanable_rangeENS2_5arrayImLm8EEEQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asISC_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISK_EESL_E4type10value_typeEEEEvOT1_RKSH_ENKUlvE_clEv: 607| 2.95k| const auto store_elementwise = [&] { 608| 2.95k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 2.95k| std::span out_s(out); 610| 23.6k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 23.6k, False: 2.95k] ------------------ 611| 23.6k| store_any(out_s.template first(), in_elem); 612| 23.6k| out_s = out_s.subspan(bytes_per_element); 613| 23.6k| } 614| 2.95k| }; _ZN5Botan8store_beINS_6detail10AutoDetectEJRNSt3__15arrayImLm9EEEEEEDaDpOT0_: 745| 2.74k|inline constexpr auto store_be(ParamTs&&... params) { 746| 2.74k| return detail::store_any(std::forward(params)...); 747| 2.74k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeERNS2_5arrayImLm9EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS9_Esr3stdE21default_initializableIS9_Esr8conceptsE21resizable_byte_bufferIS9_EEEDaOT1_: 663| 2.74k|inline constexpr auto store_any(InR&& in_range) { 664| 2.74k| auto out = []([[maybe_unused]] const auto& in) { 665| 2.74k| if constexpr(std::same_as) { 666| 2.74k| if constexpr(ranges::statically_spanable_range) { 667| 2.74k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 2.74k| return std::array(); 669| 2.74k| } else { 670| 2.74k| static_assert( 671| 2.74k| !std::same_as, 672| 2.74k| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 2.74k| } 674| 2.74k| } else if constexpr(concepts::resizable_byte_buffer) { 675| 2.74k| return OutR(std::span{in}.size_bytes()); 676| 2.74k| } else { 677| 2.74k| return OutR{}; 678| 2.74k| } 679| 2.74k| }(in_range); 680| | 681| 2.74k| store_any>(out, std::forward(in_range)); 682| 2.74k| return out; 683| 2.74k|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeERNS2_5arrayImLm9EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS9_Esr3stdE21default_initializableIS9_Esr8conceptsE21resizable_byte_bufferIS9_EEEDaOT1_ENKUlRKT_E_clIS7_EEDaSE_: 664| 2.74k| auto out = []([[maybe_unused]] const auto& in) { 665| 2.74k| if constexpr(std::same_as) { 666| 2.74k| if constexpr(ranges::statically_spanable_range) { 667| 2.74k| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 2.74k| 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.74k| }(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.74k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 2.74k| ranges::assert_equal_byte_lengths(out, in); 605| 2.74k| using element_type = std::ranges::range_value_t; 606| | 607| 2.74k| const auto store_elementwise = [&] { 608| 2.74k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 2.74k| std::span out_s(out); 610| 2.74k| for(const auto in_elem : in) { 611| 2.74k| store_any(out_s.template first(), in_elem); 612| 2.74k| out_s = out_s.subspan(bytes_per_element); 613| 2.74k| } 614| 2.74k| }; 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.74k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 2.74k] ------------------ 620| 0| store_elementwise(); 621| 2.74k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 2.74k| } else { 625| 2.74k| store_elementwise(); 626| 2.74k| } 627| 2.74k| } 628| 2.74k|} _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.74k| const auto store_elementwise = [&] { 608| 2.74k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 2.74k| std::span out_s(out); 610| 24.6k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 24.6k, False: 2.74k] ------------------ 611| 24.6k| store_any(out_s.template first(), in_elem); 612| 24.6k| out_s = out_s.subspan(bytes_per_element); 613| 24.6k| } 614| 2.74k| }; _ZN5Botan7load_leINS_6detail10AutoDetectEJRA9_mPKhRKmEEEDaDpOT0_: 495| 520|inline constexpr auto load_le(ParamTs&&... params) { 496| 520| return detail::load_any(std::forward(params)...); 497| 520|} _ZN5Botan8store_beINSt3__16vectorIhNS1_9allocatorIhEEEEJRA18_mEEEDaDpOT0_: 745| 520|inline constexpr auto store_be(ParamTs&&... params) { 746| 520| return detail::store_any(std::forward(params)...); 747| 520|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS2_6vectorIhNS2_9allocatorIhEEEETkNS_6ranges14spanable_rangeERA18_mQoooosr3stdE7same_asINS0_10AutoDetectET0_Eaasr6rangesE25statically_spanable_rangeISC_Esr3stdE21default_initializableISC_Esr8conceptsE21resizable_byte_bufferISC_EEEDaOT1_: 663| 520|inline constexpr auto store_any(InR&& in_range) { 664| 520| auto out = []([[maybe_unused]] const auto& in) { 665| 520| if constexpr(std::same_as) { 666| 520| if constexpr(ranges::statically_spanable_range) { 667| 520| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 520| return std::array(); 669| 520| } else { 670| 520| static_assert( 671| 520| !std::same_as, 672| 520| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 520| } 674| 520| } else if constexpr(concepts::resizable_byte_buffer) { 675| 520| return OutR(std::span{in}.size_bytes()); 676| 520| } else { 677| 520| return OutR{}; 678| 520| } 679| 520| }(in_range); 680| | 681| 520| store_any>(out, std::forward(in_range)); 682| 520| return out; 683| 520|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS2_6vectorIhNS2_9allocatorIhEEEETkNS_6ranges14spanable_rangeERA18_mQoooosr3stdE7same_asINS0_10AutoDetectET0_Eaasr6rangesE25statically_spanable_rangeISC_Esr3stdE21default_initializableISC_Esr8conceptsE21resizable_byte_bufferISC_EEEDaOT1_ENKUlRKT_E_clIS9_EEDaSH_: 664| 520| auto out = []([[maybe_unused]] const auto& in) { 665| | if constexpr(std::same_as) { 666| | if constexpr(ranges::statically_spanable_range) { 667| | constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| | 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| 520| } else if constexpr(concepts::resizable_byte_buffer) { 675| 520| return OutR(std::span{in}.size_bytes()); 676| | } else { 677| | return OutR{}; 678| | } 679| 520| }(in_range); _ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_6vectorIhNS2_9allocatorIhEEEETkNS4_14spanable_rangeEA18_mQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISD_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISL_EESM_E4type10value_typeEEEEvOT1_RKSI_: 603| 520|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 520| ranges::assert_equal_byte_lengths(out, in); 605| 520| using element_type = std::ranges::range_value_t; 606| | 607| 520| const auto store_elementwise = [&] { 608| 520| constexpr size_t bytes_per_element = sizeof(element_type); 609| 520| std::span out_s(out); 610| 520| for(const auto in_elem : in) { 611| 520| store_any(out_s.template first(), in_elem); 612| 520| out_s = out_s.subspan(bytes_per_element); 613| 520| } 614| 520| }; 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| 520| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 520] ------------------ 620| 0| store_elementwise(); 621| 520| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 520| } else { 625| 520| store_elementwise(); 626| 520| } 627| 520| } 628| 520|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEERNS2_6vectorIhNS2_9allocatorIhEEEETkNS4_14spanable_rangeEA18_mQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISD_NS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT2_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISL_EESM_E4type10value_typeEEEEvOT1_RKSI_ENKUlvE_clEv: 607| 520| const auto store_elementwise = [&] { 608| 520| constexpr size_t bytes_per_element = sizeof(element_type); 609| 520| std::span out_s(out); 610| 9.36k| for(const auto in_elem : in) { ------------------ | Branch (610:30): [True: 9.36k, False: 520] ------------------ 611| 9.36k| store_any(out_s.template first(), in_elem); 612| 9.36k| out_s = out_s.subspan(bytes_per_element); 613| 9.36k| } 614| 520| }; _ZN5Botan7load_leINS_6detail10AutoDetectEJRNSt3__15arrayImLm7EEERNS3_4spanIKhLm56EEEEEEDaDpOT0_: 495| 36|inline constexpr auto load_le(ParamTs&&... params) { 496| 36| return detail::load_any(std::forward(params)...); 497| 36|} _ZN5Botan6detail8load_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeERNS2_5arrayImLm7EEETkNS5_16contiguous_rangeIhEENS2_4spanIKhLm56EEEQaa20unsigned_integralishINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT1_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISK_EESL_E4type10value_typeEEoosr3stdE7same_asIS4_T0_Esr3stdE7same_asISR_SQ_EEEvOSH_RKT2_: 355| 36|inline constexpr void load_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 356| 36| ranges::assert_equal_byte_lengths(out, in); 357| 36| using element_type = std::ranges::range_value_t; 358| | 359| 36| const auto load_elementwise = [&] { 360| 36| constexpr size_t bytes_per_element = sizeof(element_type); 361| 36| std::span in_s(in); 362| 36| for(auto& out_elem : out) { 363| 36| out_elem = load_any(in_s.template first()); 364| 36| in_s = in_s.subspan(bytes_per_element); 365| 36| } 366| 36| }; 367| | 368| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 369| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 370| | // in a `constexpr` context. 371| 36| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (371:7): [Folded, False: 36] ------------------ 372| 0| load_elementwise(); 373| 36| } else { 374| 36| if constexpr(endianness == std::endian::native && !custom_loadable) { 375| 36| typecast_copy(out, in); 376| | } else { 377| | load_elementwise(); 378| | } 379| 36| } 380| 36|} _ZN5Botan8store_leINS_6detail10AutoDetectEJRNSt3__14spanIhLm56EEENS3_5arrayImLm7EEEEEEDaDpOT0_: 736| 18|inline constexpr auto store_le(ParamTs&&... params) { 737| 18| return detail::store_any(std::forward(params)...); 738| 18|} _ZN5Botan6detail9store_anyILNSt3__16endianE57005ENS0_10AutoDetectETkNS_6ranges23contiguous_output_rangeIhEERNS2_4spanIhLm56EEETkNS5_14spanable_rangeENS2_5arrayImLm7EEEQoosr3stdE7same_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| 18|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 18| ranges::assert_equal_byte_lengths(out, in); 605| 18| using element_type = std::ranges::range_value_t; 606| | 607| 18| const auto store_elementwise = [&] { 608| 18| constexpr size_t bytes_per_element = sizeof(element_type); 609| 18| std::span out_s(out); 610| 18| for(const auto in_elem : in) { 611| 18| store_any(out_s.template first(), in_elem); 612| 18| out_s = out_s.subspan(bytes_per_element); 613| 18| } 614| 18| }; 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| 18| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 18] ------------------ 620| 0| store_elementwise(); 621| 18| } else { 622| 18| if constexpr(endianness == std::endian::native && !custom_storable) { 623| 18| typecast_copy(out, in); 624| | } else { 625| | store_elementwise(); 626| | } 627| 18| } 628| 18|} _ZN5Botan8store_beINS_6detail10AutoDetectEJRtEEEDaDpOT0_: 745| 2.30k|inline constexpr auto store_be(ParamTs&&... params) { 746| 2.30k| return detail::store_any(std::forward(params)...); 747| 2.30k|} _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EEC2Ev: 42| 6.33k| MerkleDamgard_Hash() { clear(); } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE5clearEv: 70| 31.5k| void clear() { 71| 31.5k| MD::init(m_digest); 72| 31.5k| m_buffer.clear(); 73| 31.5k| m_count = 0; 74| 31.5k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EEC2Ev: 42| 13.7k| MerkleDamgard_Hash() { clear(); } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE5clearEv: 70| 66.9k| void clear() { 71| 66.9k| MD::init(m_digest); 72| 66.9k| m_buffer.clear(); 73| 66.9k| m_count = 0; 74| 66.9k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EEC2Ev: 42| 652| MerkleDamgard_Hash() { clear(); } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE5clearEv: 70| 6.88k| void clear() { 71| 6.88k| MD::init(m_digest); 72| 6.88k| m_buffer.clear(); 73| 6.88k| m_count = 0; 74| 6.88k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE6updateENSt3__14spanIKhLm18446744073709551615EEE: 44| 25.4k| void update(std::span input) { 45| 25.4k| BufferSlicer in(input); 46| | 47| 63.3k| while(!in.empty()) { ------------------ | Branch (47:16): [True: 37.9k, False: 25.4k] ------------------ 48| 37.9k| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (48:27): [True: 23, False: 37.9k] ------------------ 49| 23| MD::compress_n(m_digest, one_block.value(), 1); 50| 23| } 51| | 52| 37.9k| if(m_buffer.in_alignment()) { ------------------ | Branch (52:16): [True: 12.7k, False: 25.2k] ------------------ 53| 12.7k| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 54| 12.7k| if(full_blocks > 0) { ------------------ | Branch (54:19): [True: 12.7k, False: 3] ------------------ 55| 12.7k| MD::compress_n(m_digest, aligned_data, full_blocks); 56| 12.7k| } 57| 12.7k| } 58| 37.9k| } 59| | 60| 25.4k| m_count += input.size(); 61| 25.4k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE5finalENSt3__14spanIhLm18446744073709551615EEE: 63| 25.1k| void final(std::span output) { 64| 25.1k| append_padding_bit(); 65| 25.1k| append_counter_and_finalize(); 66| 25.1k| copy_output(output); 67| 25.1k| clear(); 68| 25.1k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE18append_padding_bitEv: 77| 25.1k| void append_padding_bit() { 78| 25.1k| BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume()); ------------------ | | 84| 25.1k| do { \ | | 85| 25.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 25.1k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 25.1k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 25.1k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 25.1k] | | ------------------ ------------------ 79| 25.1k| if constexpr(MD::bit_endianness == MD_Endian::Big) { 80| 25.1k| const uint8_t final_byte = 0x80; 81| 25.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| 25.1k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE27append_counter_and_finalizeEv: 88| 25.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| 25.1k| if(m_buffer.elements_until_alignment() < MD::ctr_bytes) { ------------------ | Branch (91:13): [True: 12.5k, False: 12.6k] ------------------ 92| 12.5k| m_buffer.fill_up_with_zeros(); 93| 12.5k| MD::compress_n(m_digest, m_buffer.consume(), 1); 94| 12.5k| } 95| | 96| | // Make sure that any remaining bytes in the very last block are zero. 97| 25.1k| BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes); ------------------ | | 84| 25.1k| do { \ | | 85| 25.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 25.1k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 25.1k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 25.1k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 25.1k] | | ------------------ ------------------ 98| 25.1k| m_buffer.fill_up_with_zeros(); 99| | 100| | // Replace a bunch of the right-most zero-padding with the counter bytes. 101| 25.1k| const uint64_t bit_count = m_count * 8; 102| 25.1k| const auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count)); 103| 25.1k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 104| 25.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| 25.1k| MD::compress_n(m_digest, m_buffer.consume(), 1); 111| 25.1k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE: 113| 25.1k| void copy_output(std::span output) { 114| 25.1k| BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes); ------------------ | | 84| 25.1k| do { \ | | 85| 25.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 25.1k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 25.1k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 25.1k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 25.1k] | | ------------------ ------------------ 115| | 116| 25.1k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 117| 25.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| 25.1k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE6updateENSt3__14spanIKhLm18446744073709551615EEE: 44| 82.4k| void update(std::span input) { 45| 82.4k| BufferSlicer in(input); 46| | 47| 184k| while(!in.empty()) { ------------------ | Branch (47:16): [True: 102k, False: 82.4k] ------------------ 48| 102k| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (48:27): [True: 4.87k, False: 97.3k] ------------------ 49| 4.87k| MD::compress_n(m_digest, one_block.value(), 1); 50| 4.87k| } 51| | 52| 102k| if(m_buffer.in_alignment()) { ------------------ | Branch (52:16): [True: 41.1k, False: 61.0k] ------------------ 53| 41.1k| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 54| 41.1k| if(full_blocks > 0) { ------------------ | Branch (54:19): [True: 36.2k, False: 4.84k] ------------------ 55| 36.2k| MD::compress_n(m_digest, aligned_data, full_blocks); 56| 36.2k| } 57| 41.1k| } 58| 102k| } 59| | 60| 82.4k| m_count += input.size(); 61| 82.4k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE5finalENSt3__14spanIhLm18446744073709551615EEE: 63| 51.2k| void final(std::span output) { 64| 51.2k| append_padding_bit(); 65| 51.2k| append_counter_and_finalize(); 66| 51.2k| copy_output(output); 67| 51.2k| clear(); 68| 51.2k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE18append_padding_bitEv: 77| 51.2k| void append_padding_bit() { 78| 51.2k| BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume()); ------------------ | | 84| 51.2k| do { \ | | 85| 51.2k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 51.2k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 51.2k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 51.2k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 51.2k] | | ------------------ ------------------ 79| 51.2k| if constexpr(MD::bit_endianness == MD_Endian::Big) { 80| 51.2k| const uint8_t final_byte = 0x80; 81| 51.2k| m_buffer.append({&final_byte, 1}); 82| | } else { 83| | const uint8_t final_byte = 0x01; 84| | m_buffer.append({&final_byte, 1}); 85| | } 86| 51.2k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE27append_counter_and_finalizeEv: 88| 51.2k| 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| 51.2k| if(m_buffer.elements_until_alignment() < MD::ctr_bytes) { ------------------ | Branch (91:13): [True: 12.8k, False: 38.3k] ------------------ 92| 12.8k| m_buffer.fill_up_with_zeros(); 93| 12.8k| MD::compress_n(m_digest, m_buffer.consume(), 1); 94| 12.8k| } 95| | 96| | // Make sure that any remaining bytes in the very last block are zero. 97| 51.2k| BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes); ------------------ | | 84| 51.2k| do { \ | | 85| 51.2k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 51.2k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 51.2k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 51.2k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 51.2k] | | ------------------ ------------------ 98| 51.2k| m_buffer.fill_up_with_zeros(); 99| | 100| | // Replace a bunch of the right-most zero-padding with the counter bytes. 101| 51.2k| const uint64_t bit_count = m_count * 8; 102| 51.2k| const auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count)); 103| 51.2k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 104| 51.2k| 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| 51.2k| MD::compress_n(m_digest, m_buffer.consume(), 1); 111| 51.2k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE: 113| 51.2k| void copy_output(std::span output) { 114| 51.2k| BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes); ------------------ | | 84| 51.2k| do { \ | | 85| 51.2k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 51.2k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 51.2k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 51.2k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 51.2k] | | ------------------ ------------------ 115| | 116| 51.2k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 117| 51.2k| 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| 51.2k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE6updateENSt3__14spanIKhLm18446744073709551615EEE: 44| 14.1k| void update(std::span input) { 45| 14.1k| BufferSlicer in(input); 46| | 47| 28.7k| while(!in.empty()) { ------------------ | Branch (47:16): [True: 14.5k, False: 14.1k] ------------------ 48| 14.5k| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (48:27): [True: 9, False: 14.5k] ------------------ 49| 9| MD::compress_n(m_digest, one_block.value(), 1); 50| 9| } 51| | 52| 14.5k| if(m_buffer.in_alignment()) { ------------------ | Branch (52:16): [True: 6.24k, False: 8.27k] ------------------ 53| 6.24k| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 54| 6.24k| if(full_blocks > 0) { ------------------ | Branch (54:19): [True: 6.23k, False: 5] ------------------ 55| 6.23k| MD::compress_n(m_digest, aligned_data, full_blocks); 56| 6.23k| } 57| 6.24k| } 58| 14.5k| } 59| | 60| 14.1k| m_count += input.size(); 61| 14.1k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE5finalENSt3__14spanIhLm18446744073709551615EEE: 63| 5.61k| void final(std::span output) { 64| 5.61k| append_padding_bit(); 65| 5.61k| append_counter_and_finalize(); 66| 5.61k| copy_output(output); 67| 5.61k| clear(); 68| 5.61k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE18append_padding_bitEv: 77| 5.61k| void append_padding_bit() { 78| 5.61k| BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume()); ------------------ | | 84| 5.61k| do { \ | | 85| 5.61k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 5.61k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 5.61k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 5.61k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 5.61k] | | ------------------ ------------------ 79| 5.61k| if constexpr(MD::bit_endianness == MD_Endian::Big) { 80| 5.61k| const uint8_t final_byte = 0x80; 81| 5.61k| m_buffer.append({&final_byte, 1}); 82| | } else { 83| | const uint8_t final_byte = 0x01; 84| | m_buffer.append({&final_byte, 1}); 85| | } 86| 5.61k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE27append_counter_and_finalizeEv: 88| 5.61k| 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| 5.61k| if(m_buffer.elements_until_alignment() < MD::ctr_bytes) { ------------------ | Branch (91:13): [True: 1.37k, False: 4.23k] ------------------ 92| 1.37k| m_buffer.fill_up_with_zeros(); 93| 1.37k| MD::compress_n(m_digest, m_buffer.consume(), 1); 94| 1.37k| } 95| | 96| | // Make sure that any remaining bytes in the very last block are zero. 97| 5.61k| BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes); ------------------ | | 84| 5.61k| do { \ | | 85| 5.61k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 5.61k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 5.61k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 5.61k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 5.61k] | | ------------------ ------------------ 98| 5.61k| m_buffer.fill_up_with_zeros(); 99| | 100| | // Replace a bunch of the right-most zero-padding with the counter bytes. 101| 5.61k| const uint64_t bit_count = m_count * 8; 102| 5.61k| const auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count)); 103| 5.61k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 104| 5.61k| 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| 5.61k| MD::compress_n(m_digest, m_buffer.consume(), 1); 111| 5.61k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE: 113| 5.61k| void copy_output(std::span output) { 114| 5.61k| BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes); ------------------ | | 84| 5.61k| do { \ | | 85| 5.61k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 5.61k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 5.61k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 5.61k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 5.61k] | | ------------------ ------------------ 115| | 116| 5.61k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 117| 5.61k| 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| 5.61k| } _ZN5Botan16as_span_of_bytesENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 68| 16.5k|inline std::span as_span_of_bytes(std::string_view s) { 69| 16.5k| return as_span_of_bytes(s.data(), s.size()); 70| 16.5k|} _ZN5Botan16as_span_of_bytesEPKcm: 59| 16.5k|inline std::span as_span_of_bytes(const char* s, size_t len) { 60| 16.5k| const uint8_t* b = reinterpret_cast(s); 61| 16.5k| return std::span{b, len}; 62| 16.5k|} _ZN5Botan15bytes_to_stringENSt3__14spanIKhLm18446744073709551615EEE: 76| 60.3k|inline std::string bytes_to_string(std::span bytes) { 77| 60.3k| return std::string(reinterpret_cast(bytes.data()), bytes.size()); 78| 60.3k|} _ZN5Botan14zeroize_bufferITkNSt3__117unsigned_integralEhEEvPT_m: 37| 214k|inline void zeroize_buffer(T buf[], size_t n) { 38| 214k| if(n > 0) { ------------------ | Branch (38:7): [True: 214k, False: 0] ------------------ 39| 214k| std::memset(buf, 0, sizeof(T) * n); 40| 214k| } 41| 214k|} _ZN5Botan14zeroize_bufferITkNSt3__117unsigned_integralEmEEvPT_m: 37| 65.6k|inline void zeroize_buffer(T buf[], size_t n) { 38| 65.6k| if(n > 0) { ------------------ | Branch (38:7): [True: 65.6k, False: 0] ------------------ 39| 65.6k| std::memset(buf, 0, sizeof(T) * n); 40| 65.6k| } 41| 65.6k|} _ZNK5Botan12Null_Padding15valid_blocksizeEm: 170| 107| bool valid_blocksize(size_t /*block_size*/) const override { return true; } _ZN5Botan28BlockCipherModePaddingMethodD2Ev: 76| 107| virtual ~BlockCipherModePaddingMethod() = default; _ZNK5Botan17Montgomery_Params1pEv: 41| 32.7k| const BigInt& p() const { return m_data->p(); } _ZNK5Botan17Montgomery_Params2R1Ev: 43| 16.3k| const BigInt& R1() const { return m_data->r1(); } _ZNK5Botan17Montgomery_Params2R2Ev: 45| 32.7k| const BigInt& R2() const { return m_data->r2(); } _ZNK5Botan17Montgomery_Params6p_dashEv: 49| 32.7k| word p_dash() const { return m_data->p_dash(); } _ZNK5Botan17Montgomery_Params7p_wordsEv: 51| 32.7k| size_t p_words() const { return m_data->p_size(); } _ZNK5Botan17Montgomery_Params4Data1pEv: 76| 32.7k| const BigInt& p() const { return m_p; } _ZNK5Botan17Montgomery_Params4Data2r1Ev: 78| 16.3k| const BigInt& r1() const { return m_r1; } _ZNK5Botan17Montgomery_Params4Data2r2Ev: 80| 32.7k| const BigInt& r2() const { return m_r2; } _ZNK5Botan17Montgomery_Params4Data6p_dashEv: 84| 32.7k| word p_dash() const { return m_p_dash; } _ZNK5Botan17Montgomery_Params4Data6p_sizeEv: 86| 32.7k| size_t p_size() const { return m_p_words; } _ZN5Botan10word8_add3ITkNS_8WordTypeEmEET_PS1_PKS1_S4_S1_: 304| 4|inline constexpr auto word8_add3(W z[8], const W x[8], const W y[8], W carry) -> W { 305| 4|#if defined(BOTAN_MP_USE_X86_64_ASM) 306| 4| if constexpr(std::same_as) { 307| 4| if(!std::is_constant_evaluated()) { ------------------ | Branch (307:10): [True: 4, Folded] ------------------ 308| 4| asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "adcq")) 309| 4| : [carry] "=r"(carry) 310| 4| : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry) 311| 4| : "cc", "memory"); 312| 4| return carry; 313| 4| } 314| 4| } 315| 0|#endif 316| | 317| 0| z[0] = word_add(x[0], y[0], &carry); 318| 4| z[1] = word_add(x[1], y[1], &carry); 319| 4| z[2] = word_add(x[2], y[2], &carry); 320| 4| z[3] = word_add(x[3], y[3], &carry); 321| 4| z[4] = word_add(x[4], y[4], &carry); 322| 4| z[5] = word_add(x[5], y[5], &carry); 323| 4| z[6] = word_add(x[6], y[6], &carry); 324| 4| z[7] = word_add(x[7], y[7], &carry); 325| 4| return carry; 326| 4|} _ZN5Botan8word_addITkNS_8WordTypeEmEET_S1_S1_PS1_: 239| 171M|inline constexpr auto word_add(W x, W y, W* carry) -> W { 240| 171M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_addc) 241| 171M| if(!std::is_constant_evaluated()) { ------------------ | Branch (241:7): [True: 171M, Folded] ------------------ 242| | if constexpr(std::same_as) { 243| | return __builtin_addc(x, y, *carry & 1, carry); 244| 171M| } else if constexpr(std::same_as) { 245| 171M| 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| 171M| } 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| 171M| } else { 263| 171M| const W cb = *carry & 1; 264| 171M| W z = x + y; 265| 171M| W c1 = (z < x); 266| 171M| z += cb; 267| 171M| *carry = c1 | (z < cb); 268| 171M| return z; 269| 171M| } 270| 171M|} _ZN5Botan10word8_sub3ITkNS_8WordTypeEmEET_PS1_PKS1_S4_S1_: 385| 2.19k|inline constexpr auto word8_sub3(W z[8], const W x[8], const W y[8], W carry) -> W { 386| 2.19k|#if defined(BOTAN_MP_USE_X86_64_ASM) 387| 2.19k| if constexpr(std::same_as) { 388| 2.19k| if(!std::is_constant_evaluated()) { ------------------ | Branch (388:10): [True: 2.19k, Folded] ------------------ 389| 2.19k| asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "sbbq")) 390| 2.19k| : [carry] "=r"(carry) 391| 2.19k| : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry) 392| 2.19k| : "cc", "memory"); 393| 2.19k| return carry; 394| 2.19k| } 395| 2.19k| } 396| 0|#endif 397| | 398| 0| z[0] = word_sub(x[0], y[0], &carry); 399| 2.19k| z[1] = word_sub(x[1], y[1], &carry); 400| 2.19k| z[2] = word_sub(x[2], y[2], &carry); 401| 2.19k| z[3] = word_sub(x[3], y[3], &carry); 402| 2.19k| z[4] = word_sub(x[4], y[4], &carry); 403| 2.19k| z[5] = word_sub(x[5], y[5], &carry); 404| 2.19k| z[6] = word_sub(x[6], y[6], &carry); 405| 2.19k| z[7] = word_sub(x[7], y[7], &carry); 406| 2.19k| return carry; 407| 2.19k|} _ZN5Botan8word_subITkNS_8WordTypeEmEET_S1_S1_PS1_: 332| 195M|inline constexpr auto word_sub(W x, W y, W* carry) -> W { 333| 195M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_subc) 334| 195M| if(!std::is_constant_evaluated()) { ------------------ | Branch (334:7): [True: 195M, Folded] ------------------ 335| | if constexpr(std::same_as) { 336| | return __builtin_subc(x, y, *carry & 1, carry); 337| 195M| } else if constexpr(std::same_as) { 338| 195M| 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| 195M| } 343| 0|#endif 344| | 345| 0| const W cb = *carry & 1; 346| 195M| W t0 = x - y; 347| 195M| W c1 = (t0 > x); 348| 195M| W z = t0 - cb; 349| 195M| *carry = c1 | (z > t0); 350| 195M| return z; 351| 195M|} _ZN5Botan10word_madd2ITkNS_8WordTypeEmEET_S1_S1_PS1_: 90| 58.1k|inline constexpr auto word_madd2(W a, W b, W* c) -> W { 91| 58.1k|#if defined(BOTAN_MP_USE_X86_64_ASM) 92| 58.1k| if constexpr(std::same_as) { 93| 58.1k| if(!std::is_constant_evaluated()) { ------------------ | Branch (93:10): [True: 58.1k, Folded] ------------------ 94| 58.1k| asm(R"( 95| 58.1k| mulq %[b] 96| 58.1k| addq %[c],%[a] 97| 58.1k| adcq $0,%[carry] 98| 58.1k| )" 99| 58.1k| : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*c) 100| 58.1k| : "0"(a), "1"(b), [c] "g"(*c) 101| 58.1k| : "cc"); 102| | 103| 58.1k| return a; 104| 58.1k| } 105| 58.1k| } 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| 58.1k| const dword s = dword(a) * b + *c; 129| 58.1k| *c = static_cast(s >> WordInfo::bits); 130| 58.1k| return static_cast(s); 131| 58.1k|} _ZN5Botan11word8_madd3ITkNS_8WordTypeEmEET_PS1_PKS1_S1_S1_: 441| 152|inline constexpr auto word8_madd3(W z[8], const W x[8], W y, W carry) -> W { 442| 152|#if defined(BOTAN_MP_USE_X86_64_ASM) 443| 152| if constexpr(std::same_as) { 444| 152| if(!std::is_constant_evaluated()) { ------------------ | Branch (444:10): [True: 152, Folded] ------------------ 445| 152| asm volatile(DO_8_TIMES(MULADD_OP, "") 446| 152| : [carry] "=r"(carry) 447| 152| : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry) 448| 152| : "cc", "%rax", "%rdx", "memory"); 449| 152| return carry; 450| 152| } 451| 152| } 452| 0|#endif 453| | 454| 0| z[0] = word_madd3(x[0], y, z[0], &carry); 455| 152| z[1] = word_madd3(x[1], y, z[1], &carry); 456| 152| z[2] = word_madd3(x[2], y, z[2], &carry); 457| 152| z[3] = word_madd3(x[3], y, z[3], &carry); 458| 152| z[4] = word_madd3(x[4], y, z[4], &carry); 459| 152| z[5] = word_madd3(x[5], y, z[5], &carry); 460| 152| z[6] = word_madd3(x[6], y, z[6], &carry); 461| 152| z[7] = word_madd3(x[7], y, z[7], &carry); 462| 152| return carry; 463| 152|} _ZN5Botan10word_madd3ITkNS_8WordTypeEmEET_S1_S1_S1_PS1_: 137| 61.7k|inline constexpr auto word_madd3(W a, W b, W c, W* d) -> W { 138| 61.7k|#if defined(BOTAN_MP_USE_X86_64_ASM) 139| 61.7k| if constexpr(std::same_as) { 140| 61.7k| if(!std::is_constant_evaluated()) { ------------------ | Branch (140:10): [True: 61.7k, Folded] ------------------ 141| 61.7k| asm(R"( 142| 61.7k| mulq %[b] 143| 61.7k| 144| 61.7k| addq %[c],%[a] 145| 61.7k| adcq $0,%[carry] 146| 61.7k| 147| 61.7k| addq %[d],%[a] 148| 61.7k| adcq $0,%[carry] 149| 61.7k| )" 150| 61.7k| : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*d) 151| 61.7k| : "0"(a), "1"(b), [c] "g"(c), [d] "g"(*d) 152| 61.7k| : "cc"); 153| | 154| 61.7k| return a; 155| 61.7k| } 156| 61.7k| } 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| 61.7k| const dword s = dword(a) * b + c + *d; 182| 61.7k| *d = static_cast(s >> WordInfo::bits); 183| 61.7k| return static_cast(s); 184| 61.7k|} _ZN5Botan10word8_add2ITkNS_8WordTypeEmEET_PS1_PKS1_S1_: 276| 1.54k|inline constexpr auto word8_add2(W x[8], const W y[8], W carry) -> W { 277| 1.54k|#if defined(BOTAN_MP_USE_X86_64_ASM) 278| 1.54k| if constexpr(std::same_as) { 279| 1.54k| if(!std::is_constant_evaluated()) { ------------------ | Branch (279:10): [True: 1.54k, Folded] ------------------ 280| 1.54k| asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "adcq")) 281| 1.54k| : [carry] "=r"(carry) 282| 1.54k| : [x] "r"(x), [y] "r"(y), "0"(carry) 283| 1.54k| : "cc", "memory"); 284| 1.54k| return carry; 285| 1.54k| } 286| 1.54k| } 287| 0|#endif 288| | 289| 0| x[0] = word_add(x[0], y[0], &carry); 290| 1.54k| x[1] = word_add(x[1], y[1], &carry); 291| 1.54k| x[2] = word_add(x[2], y[2], &carry); 292| 1.54k| x[3] = word_add(x[3], y[3], &carry); 293| 1.54k| x[4] = word_add(x[4], y[4], &carry); 294| 1.54k| x[5] = word_add(x[5], y[5], &carry); 295| 1.54k| x[6] = word_add(x[6], y[6], &carry); 296| 1.54k| x[7] = word_add(x[7], y[7], &carry); 297| 1.54k| return carry; 298| 1.54k|} _ZN5Botan10word8_sub2ITkNS_8WordTypeEmEET_PS1_PKS1_S1_: 357| 32|inline constexpr auto word8_sub2(W x[8], const W y[8], W carry) -> W { 358| 32|#if defined(BOTAN_MP_USE_X86_64_ASM) 359| 32| if constexpr(std::same_as) { 360| 32| if(!std::is_constant_evaluated()) { ------------------ | Branch (360:10): [True: 32, Folded] ------------------ 361| 32| asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "sbbq")) 362| 32| : [carry] "=r"(carry) 363| 32| : [x] "r"(x), [y] "r"(y), "0"(carry) 364| 32| : "cc", "memory"); 365| 32| return carry; 366| 32| } 367| 32| } 368| 0|#endif 369| | 370| 0| x[0] = word_sub(x[0], y[0], &carry); 371| 32| x[1] = word_sub(x[1], y[1], &carry); 372| 32| x[2] = word_sub(x[2], y[2], &carry); 373| 32| x[3] = word_sub(x[3], y[3], &carry); 374| 32| x[4] = word_sub(x[4], y[4], &carry); 375| 32| x[5] = word_sub(x[5], y[5], &carry); 376| 32| x[6] = word_sub(x[6], y[6], &carry); 377| 32| x[7] = word_sub(x[7], y[7], &carry); 378| 32| return carry; 379| 32|} _ZN5Botan5word3ImEC2Ev: 478| 5.69M| constexpr word3() : m_w(0) {} _ZN5Botan5word3ImE3mulEmm: 480| 234M| inline constexpr void mul(W x, W y) { m_w += static_cast(x) * y; } _ZN5Botan5word3ImE7extractEv: 486| 41.5M| inline constexpr W extract() { 487| 41.5M| W r = static_cast(m_w); 488| 41.5M| m_w >>= WordInfo::bits; 489| 41.5M| return r; 490| 41.5M| } _ZN5Botan5word3ImE6mul_x2Emm: 482| 846k| inline constexpr void mul_x2(W x, W y) { m_w += static_cast(x) * y * 2; } _ZN5Botan5word3ImE3addEm: 484| 69.6M| inline constexpr void add(W x) { m_w += x; } _ZN5Botan5word3ImE10monty_stepEmm: 492| 34.8M| inline constexpr W monty_step(W p0, W p_dash) { 493| 34.8M| const W w0 = static_cast(m_w); 494| 34.8M| const W r = w0 * p_dash; 495| 34.8M| mul(r, p0); 496| 34.8M| m_w >>= WordInfo::bits; 497| 34.8M| return r; 498| 34.8M| } _ZN5Botan11bigint_add3ITkNS_8WordTypeEmEET_PS1_PKS1_mS4_m: 123| 12|inline constexpr auto bigint_add3(W z[], const W x[], size_t x_size, const W y[], size_t y_size) -> W { 124| 12| if(x_size < y_size) { ------------------ | Branch (124:7): [True: 0, False: 12] ------------------ 125| 0| return bigint_add3(z, y, y_size, x, x_size); 126| 0| } 127| | 128| 12| W carry = 0; 129| | 130| 12| const size_t blocks = y_size - (y_size % 8); 131| | 132| 16| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (132:22): [True: 4, False: 12] ------------------ 133| 4| carry = word8_add3(z + i, x + i, y + i, carry); 134| 4| } 135| | 136| 54| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (136:27): [True: 42, False: 12] ------------------ 137| 42| z[i] = word_add(x[i], y[i], &carry); 138| 42| } 139| | 140| 12| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (140:27): [True: 0, False: 12] ------------------ 141| 0| z[i] = word_add(x[i], static_cast(0), &carry); 142| 0| } 143| | 144| 12| return carry; 145| 12|} _ZN5Botan10bigint_cmpITkNS_8WordTypeEmEEiPKT_mS3_m: 462| 44.5k|inline constexpr int32_t bigint_cmp(const W x[], size_t x_size, const W y[], size_t y_size) { 463| 44.5k| static_assert(sizeof(W) >= sizeof(uint32_t), "Size assumption"); 464| | 465| 44.5k| const W LT = static_cast(-1); 466| 44.5k| const W EQ = 0; 467| 44.5k| const W GT = 1; 468| | 469| 44.5k| const size_t common_elems = std::min(x_size, y_size); 470| | 471| 44.5k| W result = EQ; // until found otherwise 472| | 473| 327k| for(size_t i = 0; i != common_elems; i++) { ------------------ | Branch (473:22): [True: 282k, False: 44.5k] ------------------ 474| 282k| const auto is_eq = CT::Mask::is_equal(x[i], y[i]); 475| 282k| const auto is_lt = CT::Mask::is_lt(x[i], y[i]); 476| | 477| 282k| result = is_eq.select(result, is_lt.select(LT, GT)); 478| 282k| } 479| | 480| 44.5k| if(x_size < y_size) { ------------------ | Branch (480:7): [True: 4, False: 44.5k] ------------------ 481| 4| W mask = 0; 482| 8| for(size_t i = x_size; i != y_size; i++) { ------------------ | Branch (482:30): [True: 4, False: 4] ------------------ 483| 4| mask |= y[i]; 484| 4| } 485| | 486| | // If any bits were set in high part of y, then x < y 487| 4| result = CT::Mask::is_zero(mask).select(result, LT); 488| 44.5k| } else if(y_size < x_size) { ------------------ | Branch (488:14): [True: 6, False: 44.5k] ------------------ 489| 6| W mask = 0; 490| 37| for(size_t i = y_size; i != x_size; i++) { ------------------ | Branch (490:30): [True: 31, False: 6] ------------------ 491| 31| mask |= x[i]; 492| 31| } 493| | 494| | // If any bits were set in high part of x, then x > y 495| 6| result = CT::Mask::is_zero(mask).select(result, GT); 496| 6| } 497| | 498| 44.5k| CT::unpoison(result); 499| 44.5k| BOTAN_DEBUG_ASSERT(result == LT || result == GT || result == EQ); ------------------ | | 137| 44.5k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 44.5k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 44.5k] | | ------------------ ------------------ 500| 44.5k| return static_cast(result); 501| 44.5k|} _ZN5Botan11bigint_sub3ITkNS_8WordTypeEmEET_PS1_PKS1_mS4_m: 195| 2.48k|inline constexpr auto bigint_sub3(W z[], const W x[], size_t x_size, const W y[], size_t y_size) -> W { 196| 2.48k| W borrow = 0; 197| | 198| 2.48k| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 71| 2.48k| do { \ | | 72| 2.48k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 2.48k| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 2.48k] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 2.48k| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 2.48k] | | ------------------ ------------------ 199| | 200| 2.48k| const size_t blocks = y_size - (y_size % 8); 201| | 202| 3.60k| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (202:22): [True: 1.11k, False: 2.48k] ------------------ 203| 1.11k| borrow = word8_sub3(z + i, x + i, y + i, borrow); 204| 1.11k| } 205| | 206| 10.1k| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (206:27): [True: 7.63k, False: 2.48k] ------------------ 207| 7.63k| z[i] = word_sub(x[i], y[i], &borrow); 208| 7.63k| } 209| | 210| 2.61k| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (210:27): [True: 127, False: 2.48k] ------------------ 211| 127| z[i] = word_sub(x[i], static_cast(0), &borrow); 212| 127| } 213| | 214| 2.48k| return borrow; 215| 2.48k|} _ZN5Botan14divide_precompImEC2Emmmm: 771| 18| m_divisor(divisor), m_shift(shift), m_norm_divisor(norm_divisor), m_reciprocal(reciprocal) {} _ZNK5Botan14divide_precompImE14divmod_2to1_ctEmm: 731| 147| 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| 147| n1 <<= m_shift; 737| 147| 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| 147| n1 |= (n0 >> 1) >> (rshift - 1); 748| 147| n0 <<= m_shift; 749| | 750| 147| const auto [q, scaled_r] = div2by1_preinv(n1, n0, m_norm_divisor, m_reciprocal); 751| 147| const W r = scaled_r >> m_shift; 752| 147| return std::make_pair(q, r); 753| 147| } _ZN5Botan14divide_precompImE14div2by1_preinvEmmmm: 782| 147| static constexpr std::pair div2by1_preinv(W u1, W u0, W D, W v) { 783| | // Steps 1-3: = v*u1; += ; q1 += 1 784| 147| W q1 = u0; 785| 147| const W q0 = word_madd2(u1, v, &q1); // = u1*v + u0 786| 147| q1 += u1 + 1; 787| | 788| | // Step 4 789| 147| W r = u0 - q1 * D; 790| | 791| | // Steps 5-7: If r >= q0 { q1 -= 1; r += d; } 792| 147| const auto fix_down = CT::Mask::is_gt(r, q0); 793| 147| q1 -= fix_down.if_set_return(1); 794| 147| r += fix_down.if_set_return(D); 795| | 796| | // Steps 8-10: if r >= D { q1 += 1; r -= D; } 797| 147| const auto fix_up = CT::Mask::is_gte(r, D); 798| 147| q1 += fix_up.if_set_return(1); 799| 147| r -= fix_up.if_set_return(D); 800| | 801| | // Step 11 802| 147| return std::make_pair(q1, r); 803| 147| } _ZN5Botan17bigint_monty_redcEPmPKmS2_mmS0_m: 1077| 32.7k| word r[], const word z[], const word p[], size_t p_size, word p_dash, word ws[], size_t ws_size) { 1078| 32.7k| const size_t z_size = 2 * p_size; 1079| | 1080| 32.7k| BOTAN_ARG_CHECK(ws_size >= p_size, "Montgomery reduction workspace too small"); ------------------ | | 35| 32.7k| do { \ | | 36| 32.7k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 32.7k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 32.7k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 32.7k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 32.7k] | | ------------------ ------------------ 1081| | 1082| 32.7k| if(p_size == 4) { ------------------ | Branch (1082:7): [True: 28.4k, False: 4.37k] ------------------ 1083| 28.4k| bigint_monty_redc_4(r, z, p, p_dash, ws); 1084| 28.4k| } else if(p_size == 6) { ------------------ | Branch (1084:14): [True: 2.21k, False: 2.16k] ------------------ 1085| 2.21k| bigint_monty_redc_6(r, z, p, p_dash, ws); 1086| 2.21k| } else if(p_size == 8) { ------------------ | Branch (1086:14): [True: 1.12k, False: 1.04k] ------------------ 1087| 1.12k| bigint_monty_redc_8(r, z, p, p_dash, ws); 1088| 1.12k| } else if(p_size == 12) { ------------------ | Branch (1088:14): [True: 0, False: 1.04k] ------------------ 1089| 0| bigint_monty_redc_12(r, z, p, p_dash, ws); 1090| 1.04k| } else if(p_size == 16) { ------------------ | Branch (1090:14): [True: 0, False: 1.04k] ------------------ 1091| 0| bigint_monty_redc_16(r, z, p, p_dash, ws); 1092| 1.04k| } else if(p_size == 24) { ------------------ | Branch (1092:14): [True: 0, False: 1.04k] ------------------ 1093| 0| bigint_monty_redc_24(r, z, p, p_dash, ws); 1094| 1.04k| } else if(p_size == 32) { ------------------ | Branch (1094:14): [True: 0, False: 1.04k] ------------------ 1095| 0| bigint_monty_redc_32(r, z, p, p_dash, ws); 1096| 1.04k| } else { 1097| 1.04k| bigint_monty_redc_generic(r, z, z_size, p, p_size, p_dash, ws); 1098| 1.04k| } 1099| 32.7k|} _ZN5Botan25bigint_monty_redc_inplaceEPmPKmmmS0_m: 1101| 32.7k|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| 32.7k| bigint_monty_redc(z, z, p, p_size, p_dash, ws, ws_size); 1103| 32.7k| zeroize_buffer(z + p_size, p_size); 1104| 32.7k|} _ZN5Botan12booth_recodeEmm: 1302| 554k|inline constexpr std::pair booth_recode(size_t x, size_t window_bits) { 1303| 554k| const auto sign = CT::Mask::expand(x >> window_bits); 1304| 554k| const size_t neg_x = (static_cast(1) << (window_bits + 1)) - x - 1; 1305| 554k| size_t digit = sign.select(neg_x, x); 1306| 554k| digit = (digit >> 1) + (digit & 1); 1307| 554k| return {digit, sign.as_choice()}; 1308| 554k|} _ZN5Botan15bigint_ct_is_eqITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPKS3_mS6_m: 542| 12|inline constexpr auto bigint_ct_is_eq(const W x[], size_t x_size, const W y[], size_t y_size) -> CT::Mask { 543| 12| const size_t common_elems = std::min(x_size, y_size); 544| | 545| 12| W diff = 0; 546| | 547| 166| for(size_t i = 0; i != common_elems; i++) { ------------------ | Branch (547:22): [True: 154, False: 12] ------------------ 548| 154| diff |= (x[i] ^ y[i]); 549| 154| } 550| | 551| | // If any bits were set in high part of x/y, then they are not equal 552| 12| if(x_size < y_size) { ------------------ | Branch (552:7): [True: 1, False: 11] ------------------ 553| 9| for(size_t i = x_size; i != y_size; i++) { ------------------ | Branch (553:30): [True: 8, False: 1] ------------------ 554| 8| diff |= y[i]; 555| 8| } 556| 11| } else if(y_size < x_size) { ------------------ | Branch (556:14): [True: 0, False: 11] ------------------ 557| 0| for(size_t i = y_size; i != x_size; i++) { ------------------ | Branch (557:30): [True: 0, False: 0] ------------------ 558| 0| diff |= x[i]; 559| 0| } 560| 0| } 561| | 562| 12| return CT::Mask::is_zero(diff); 563| 12|} _ZN5Botan15bigint_ct_is_ltITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPKS3_mS6_mb: 510| 26.9k| -> CT::Mask { 511| 26.9k| const size_t common_elems = std::min(x_size, y_size); 512| | 513| 26.9k| auto is_lt = CT::Mask::expand(lt_or_equal); 514| | 515| 149k| for(size_t i = 0; i != common_elems; i++) { ------------------ | Branch (515:22): [True: 122k, False: 26.9k] ------------------ 516| 122k| const auto eq = CT::Mask::is_equal(x[i], y[i]); 517| 122k| const auto lt = CT::Mask::is_lt(x[i], y[i]); 518| 122k| is_lt = eq.select_mask(is_lt, lt); 519| 122k| } 520| | 521| 26.9k| if(x_size < y_size) { ------------------ | Branch (521:7): [True: 0, False: 26.9k] ------------------ 522| 0| W mask = 0; 523| 0| for(size_t i = x_size; i != y_size; i++) { ------------------ | Branch (523:30): [True: 0, False: 0] ------------------ 524| 0| mask |= y[i]; 525| 0| } 526| | // If any bits were set in high part of y, then is_lt should be forced true 527| 0| is_lt |= CT::Mask::expand(mask); 528| 26.9k| } else if(y_size < x_size) { ------------------ | Branch (528:14): [True: 49, False: 26.9k] ------------------ 529| 49| W mask = 0; 530| 388| for(size_t i = y_size; i != x_size; i++) { ------------------ | Branch (530:30): [True: 339, False: 49] ------------------ 531| 339| mask |= x[i]; 532| 339| } 533| | 534| | // If any bits were set in high part of x, then is_lt should be false 535| 49| is_lt &= CT::Mask::is_zero(mask); 536| 49| } 537| | 538| 26.9k| return is_lt; 539| 26.9k|} _ZN5Botan14divide_precompImE5setupEm: 694| 18| static constexpr divide_precomp setup(W divisor) { 695| 18| const size_t shift = WordInfo::bits - high_bit(divisor); 696| 18| const W norm_divisor = divisor << shift; 697| 18| const W reciprocal = reciprocal_word_ct(norm_divisor); 698| 18| return divide_precomp(divisor, shift, norm_divisor, reciprocal); 699| 18| } _ZN5Botan18reciprocal_word_ctITkNS_8WordTypeEmEET_S1_: 649| 18|constexpr W reciprocal_word_ct(W D) { 650| 18| BOTAN_DEBUG_ASSERT((D & WordInfo::top_bit) != 0); ------------------ | | 137| 18| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 18| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 18] | | ------------------ ------------------ 651| | 652| | // Bit serial long division of ((~D) || (2^b - 1)) / D, with all of the 653| | // conditional logic computed via masks 654| 18| W remainder = static_cast(~D); 655| 18| W quotient = 0; 656| | 657| 1.17k| for(size_t i = 0; i != WordInfo::bits; ++i) { ------------------ | Branch (657:22): [True: 1.15k, False: 18] ------------------ 658| 1.15k| const auto carry = CT::Mask::expand_top_bit(remainder); 659| 1.15k| remainder = static_cast((remainder << 1) | 1); 660| 1.15k| quotient <<= 1; 661| | 662| 1.15k| const auto sub = carry | CT::Mask::is_gte(remainder, D); 663| 1.15k| remainder -= sub.if_set_return(D); 664| 1.15k| quotient |= sub.if_set_return(1); 665| 1.15k| } 666| | 667| 18| return quotient; 668| 18|} _ZN5Botan13bigint_submulITkNS_8WordTypeEmEET_PS1_PKS1_mS1_: 442| 147|inline constexpr auto bigint_submul(W z[], const W y[], size_t N, W q) -> W { 443| 147| W mul_carry = 0; 444| 147| W borrow = 0; 445| | 446| 1.11k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (446:22): [True: 969, False: 147] ------------------ 447| 969| const W t = word_madd2(y[i], q, &mul_carry); 448| 969| z[i] = word_sub(z[i], t, &borrow); 449| 969| } 450| | 451| | // Both mul_carry <= W_max - 1 and borrow <= 1, so this cannot overflow 452| 147| return mul_carry + borrow; 453| 147|} _ZN5Botan14bigint_cnd_addITkNS_8WordTypeEmEET_S1_PS1_PKS1_m: 48| 147|inline constexpr W bigint_cnd_add(W cnd, W x[], const W y[], size_t size) { 49| 147| const auto mask = CT::Mask::expand(cnd).value(); 50| | 51| 147| W carry = 0; 52| | 53| 1.11k| for(size_t i = 0; i != size; ++i) { ------------------ | Branch (53:22): [True: 969, False: 147] ------------------ 54| 969| x[i] = word_add(x[i], y[i] & mask, &carry); 55| 969| } 56| | 57| 147| return (mask & carry); 58| 147|} _ZN5Botan14bigint_sub_absITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPS3_PKS3_S7_mS5_: 282| 48|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| 48| W* ws0 = ws; 286| 48| W* ws1 = ws + N; 287| | 288| 48| W borrow0 = 0; 289| 48| W borrow1 = 0; 290| | 291| 48| const size_t blocks = N - (N % 8); 292| | 293| 64| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (293:22): [True: 16, False: 48] ------------------ 294| 16| borrow0 = word8_sub3(ws0 + i, x + i, y + i, borrow0); 295| 16| borrow1 = word8_sub3(ws1 + i, y + i, x + i, borrow1); 296| 16| } 297| | 298| 264| for(size_t i = blocks; i != N; ++i) { ------------------ | Branch (298:27): [True: 216, False: 48] ------------------ 299| 216| ws0[i] = word_sub(x[i], y[i], &borrow0); 300| 216| ws1[i] = word_sub(y[i], x[i], &borrow1); 301| 216| } 302| | 303| 48| return CT::conditional_copy_mem(borrow0, z, ws1, ws0, N); 304| 48|} _ZN5Botan11bigint_add2ITkNS_8WordTypeEmEET_PS1_mPKS1_m: 97| 5.17k|inline constexpr auto bigint_add2(W x[], size_t x_size, const W y[], size_t y_size) -> W { 98| 5.17k| W carry = 0; 99| | 100| 5.17k| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 71| 5.17k| do { \ | | 72| 5.17k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 5.17k| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 5.17k] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 5.17k| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 5.17k] | | ------------------ ------------------ 101| | 102| 5.17k| const size_t blocks = y_size - (y_size % 8); 103| | 104| 6.71k| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (104:22): [True: 1.54k, False: 5.17k] ------------------ 105| 1.54k| carry = word8_add2(x + i, y + i, carry); 106| 1.54k| } 107| | 108| 23.5k| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (108:27): [True: 18.3k, False: 5.17k] ------------------ 109| 18.3k| x[i] = word_add(x[i], y[i], &carry); 110| 18.3k| } 111| | 112| 27.5k| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (112:27): [True: 22.3k, False: 5.17k] ------------------ 113| 22.3k| x[i] = word_add(x[i], static_cast(0), &carry); 114| 22.3k| } 115| | 116| 5.17k| return carry; 117| 5.17k|} _ZN5Botan11bigint_sub2ITkNS_8WordTypeEmEET_PS1_mPKS1_m: 151| 48|inline constexpr auto bigint_sub2(W x[], size_t x_size, const W y[], size_t y_size) -> W { 152| 48| W borrow = 0; 153| | 154| 48| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 71| 48| do { \ | | 72| 48| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 48| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 48] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 48| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 48] | | ------------------ ------------------ 155| | 156| 48| const size_t blocks = y_size - (y_size % 8); 157| | 158| 80| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (158:22): [True: 32, False: 48] ------------------ 159| 32| borrow = word8_sub2(x + i, y + i, borrow); 160| 32| } 161| | 162| 184| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (162:27): [True: 136, False: 48] ------------------ 163| 136| x[i] = word_sub(x[i], y[i], &borrow); 164| 136| } 165| | 166| 48| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (166:27): [True: 0, False: 48] ------------------ 167| 0| x[i] = word_sub(x[i], static_cast(0), &borrow); 168| 0| } 169| | 170| 48| return borrow; 171| 48|} _ZN5Botan13monty_inverseITkNS_8WordTypeEmEET_S1_: 856| 6|inline constexpr auto monty_inverse(W a) -> W { 857| 6| BOTAN_ARG_CHECK(a % 2 == 1, "Cannot compute Montgomery inverse of an even integer"); ------------------ | | 35| 6| do { \ | | 36| 6| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 6| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 6] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 6| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 6] | | ------------------ ------------------ 858| | 859| | // Newton's Method, following https://lemire.me/blog/2017/09/18/computing-the-inverse-of-odd-integers/ 860| | 861| 6| 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| 6| W r = (3 * a) ^ 2; 865| | 866| | // Each iteration doubles the accuracy 867| 30| for(size_t i = 0; i != iter; ++i) { ------------------ | Branch (867:22): [True: 24, False: 6] ------------------ 868| 24| r = r * (2 - r * a); 869| 24| } 870| | 871| | // Now invert in addition space 872| 6| r = (WordInfo::max - r) + 1; 873| | 874| 6| return r; 875| 6|} _ZN5Botan22bigint_monty_maybe_subITkNS_8WordTypeEmEEvmPT_S1_PKS1_S4_: 228| 1.04k|inline constexpr void bigint_monty_maybe_sub(size_t N, W z[], W x0, const W x[], const W p[]) { 229| 1.04k| W borrow = 0; 230| | 231| 1.04k| const size_t blocks = N - (N % 8); 232| | 233| 2.08k| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (233:22): [True: 1.04k, False: 1.04k] ------------------ 234| 1.04k| borrow = word8_sub3(z + i, x + i, p + i, borrow); 235| 1.04k| } 236| | 237| 2.08k| for(size_t i = blocks; i != N; ++i) { ------------------ | Branch (237:27): [True: 1.04k, False: 1.04k] ------------------ 238| 1.04k| z[i] = word_sub(x[i], p[i], &borrow); 239| 1.04k| } 240| | 241| 1.04k| borrow = (x0 - borrow) > x0; 242| | 243| 1.04k| CT::conditional_assign_mem(borrow, z, x, N); 244| 1.04k|} _ZN5Botan9comba_sqrILm4ETkNS_8WordTypeEmEEvPT0_PKS1_: 1007| 4.13M|constexpr inline void comba_sqr(W z[2 * N], const W x[N]) { 1008| 4.13M| if(!std::is_constant_evaluated()) { ------------------ | Branch (1008:7): [True: 4.13M, Folded] ------------------ 1009| 4.13M| if constexpr(std::same_as && N == 4) { 1010| 4.13M| return bigint_comba_sqr4(z, x); 1011| 4.13M| } 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| 4.13M| } 1028| | 1029| 0| word3 accum; 1030| | 1031| 4.13M| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (1031:22): [True: 0, False: 4.13M] ------------------ 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| 4.13M|} _ZN5Botan22bigint_monty_maybe_subILm4ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 257| 3.11M|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 258| 3.11M| W borrow = 0; 259| | 260| 15.5M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (260:22): [True: 12.4M, False: 3.11M] ------------------ 261| 12.4M| z[i] = word_sub(x[i], y[i], &borrow); 262| 12.4M| } 263| | 264| 3.11M| borrow = (x0 - borrow) > x0; 265| | 266| 3.11M| CT::conditional_assign_mem(borrow, z, x, N); 267| 3.11M|} _ZN5Botan9comba_mulILm4ETkNS_8WordTypeEmEEvPT0_PKS1_S4_: 971| 3.92M|constexpr inline void comba_mul(W z[2 * N], const W x[N], const W y[N]) { 972| 3.92M| if(!std::is_constant_evaluated()) { ------------------ | Branch (972:7): [True: 3.92M, Folded] ------------------ 973| 3.92M| if constexpr(std::same_as && N == 4) { 974| 3.92M| return bigint_comba_mul4(z, x, y); 975| 3.92M| } 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| 3.92M| } 992| | 993| 0| word3 accum; 994| | 995| 3.92M| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (995:22): [True: 0, False: 3.92M] ------------------ 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| 3.92M|} _ZN5Botan10shift_leftILm1ETkNS_8WordTypeEmLm4EEET0_RNSt3__15arrayIS1_XT1_EEE: 878| 589k|inline constexpr W shift_left(std::array& x) { 879| 589k| static_assert(N >= 1, "Invalid input size"); 880| 589k| static_assert(S > 0, "Zero shift not supported"); 881| 589k| static_assert(S < WordInfo::bits, "Shift too large"); 882| | 883| 589k| const W carry = x[N - 1] >> (WordInfo::bits - S); 884| | 885| 2.35M| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (885:26): [True: 1.76M, False: 589k] ------------------ 886| 1.76M| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 887| 1.76M| } 888| 589k| x[0] <<= S; 889| | 890| 589k| return carry; 891| 589k|} _ZN5Botan16read_window_bitsILm4EmLm4EEEmNSt3__14spanIKT0_XT1_EEEm: 1274| 76.9k|constexpr size_t read_window_bits(std::span words, size_t offset) { 1275| 76.9k| static_assert(WindowBits >= 1 && WindowBits <= 7); 1276| | 1277| 76.9k| constexpr uint8_t WindowMask = static_cast(1 << WindowBits) - 1; 1278| | 1279| 76.9k| constexpr size_t W_bits = sizeof(W) * 8; 1280| 76.9k| const auto bit_shift = offset % W_bits; 1281| 76.9k| const auto word_offset = words.size() - 1 - (offset / W_bits); 1282| | 1283| 76.9k| const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0; ------------------ | Branch (1283:36): [True: 76.9k, False: 0] | Branch (1283:74): [True: 0, False: 0] ------------------ 1284| | 1285| 76.9k| const auto w0 = words[word_offset]; 1286| | 1287| 76.9k| if(single_byte_window) { ------------------ | Branch (1287:7): [True: 76.9k, False: 0] ------------------ 1288| 76.9k| return (w0 >> bit_shift) & WindowMask; 1289| 76.9k| } 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| 76.9k|} _ZN5Botan11shift_rightILm1ETkNS_8WordTypeEmLm4EEET0_RNSt3__15arrayIS1_XT1_EEE: 894| 37.1k|inline constexpr W shift_right(std::array& x) { 895| 37.1k| static_assert(N >= 1, "Invalid input size"); 896| 37.1k| static_assert(S > 0, "Zero shift not supported"); 897| 37.1k| static_assert(S < WordInfo::bits, "Shift too large"); 898| | 899| 37.1k| const W carry = x[0] << (WordInfo::bits - S); 900| | 901| 148k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (901:22): [True: 111k, False: 37.1k] ------------------ 902| 111k| x[i] = (x[i] >> S) | (x[i + 1] << (WordInfo::bits - S)); 903| 111k| } 904| 37.1k| x[N - 1] >>= S; 905| | 906| 37.1k| return carry; 907| 37.1k|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm8ELm64EEEDaNSt3__14spanIKhXT1_EEE: 1245| 9.50k|inline constexpr auto bytes_to_words(std::span bytes) { 1246| 9.50k| static_assert(L <= WordInfo::bytes * N); 1247| | 1248| 9.50k| std::array r = {}; 1249| | 1250| 9.50k| constexpr size_t full_words = L / WordInfo::bytes; 1251| 9.50k| constexpr size_t extra_bytes = L % WordInfo::bytes; 1252| | 1253| 9.50k| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 1254| | 1255| 85.5k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (1255:22): [True: 76.0k, False: 9.50k] ------------------ 1256| 76.0k| r[i] = load_be(bytes.data(), full_words - 1 - i); 1257| 76.0k| } 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| 9.50k| return r; 1270| 9.50k|} _ZN5Botan16read_window_bitsILm7EhLm18446744073709551615EEEmNSt3__14spanIKT0_XT1_EEEm: 1274| 437k|constexpr size_t read_window_bits(std::span words, size_t offset) { 1275| 437k| static_assert(WindowBits >= 1 && WindowBits <= 7); 1276| | 1277| 437k| constexpr uint8_t WindowMask = static_cast(1 << WindowBits) - 1; 1278| | 1279| 437k| constexpr size_t W_bits = sizeof(W) * 8; 1280| 437k| const auto bit_shift = offset % W_bits; 1281| 437k| const auto word_offset = words.size() - 1 - (offset / W_bits); 1282| | 1283| 437k| const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0; ------------------ | Branch (1283:36): [True: 112k, False: 324k] | Branch (1283:74): [True: 6.26k, False: 318k] ------------------ 1284| | 1285| 437k| const auto w0 = words[word_offset]; 1286| | 1287| 437k| if(single_byte_window) { ------------------ | Branch (1287:7): [True: 119k, False: 318k] ------------------ 1288| 119k| return (w0 >> bit_shift) & WindowMask; 1289| 318k| } else { 1290| | // Otherwise we must join two words and extract the result 1291| 318k| const auto w1 = words[word_offset - 1]; 1292| 318k| const auto combined = ((w0 >> bit_shift) | (w1 << (W_bits - bit_shift))); 1293| 318k| return combined & WindowMask; 1294| 318k| } 1295| 437k|} _ZN5Botan12booth_recodeILm6ETkNSt3__117unsigned_integralEmEENS1_4pairImNS_2CT6ChoiceEEET0_: 1311| 437k|constexpr std::pair booth_recode(T x) { 1312| 437k| static_assert(WindowBits >= 1 && WindowBits <= 16); 1313| 437k| return booth_recode(static_cast(x), WindowBits); 1314| 437k|} _ZN5Botan16read_window_bitsILm6EhLm18446744073709551615EEEmNSt3__14spanIKT0_XT1_EEEm: 1274| 116k|constexpr size_t read_window_bits(std::span words, size_t offset) { 1275| 116k| static_assert(WindowBits >= 1 && WindowBits <= 7); 1276| | 1277| 116k| constexpr uint8_t WindowMask = static_cast(1 << WindowBits) - 1; 1278| | 1279| 116k| constexpr size_t W_bits = sizeof(W) * 8; 1280| 116k| const auto bit_shift = offset % W_bits; 1281| 116k| const auto word_offset = words.size() - 1 - (offset / W_bits); 1282| | 1283| 116k| const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0; ------------------ | Branch (1283:36): [True: 44.2k, False: 72.4k] | Branch (1283:74): [True: 0, False: 72.4k] ------------------ 1284| | 1285| 116k| const auto w0 = words[word_offset]; 1286| | 1287| 116k| if(single_byte_window) { ------------------ | Branch (1287:7): [True: 44.2k, False: 72.4k] ------------------ 1288| 44.2k| return (w0 >> bit_shift) & WindowMask; 1289| 72.4k| } else { 1290| | // Otherwise we must join two words and extract the result 1291| 72.4k| const auto w1 = words[word_offset - 1]; 1292| 72.4k| const auto combined = ((w0 >> bit_shift) | (w1 << (W_bits - bit_shift))); 1293| 72.4k| return combined & WindowMask; 1294| 72.4k| } 1295| 116k|} _ZN5Botan12booth_recodeILm5ETkNSt3__117unsigned_integralEmEENS1_4pairImNS_2CT6ChoiceEEET0_: 1311| 116k|constexpr std::pair booth_recode(T x) { 1312| 116k| static_assert(WindowBits >= 1 && WindowBits <= 16); 1313| 116k| return booth_recode(static_cast(x), WindowBits); 1314| 116k|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm4ELm32EEEDaNSt3__14spanIKhXT1_EEE: 1245| 22.2k|inline constexpr auto bytes_to_words(std::span bytes) { 1246| 22.2k| static_assert(L <= WordInfo::bytes * N); 1247| | 1248| 22.2k| std::array r = {}; 1249| | 1250| 22.2k| constexpr size_t full_words = L / WordInfo::bytes; 1251| 22.2k| constexpr size_t extra_bytes = L % WordInfo::bytes; 1252| | 1253| 22.2k| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 1254| | 1255| 111k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (1255:22): [True: 89.0k, False: 22.2k] ------------------ 1256| 89.0k| r[i] = load_be(bytes.data(), full_words - 1 - i); 1257| 89.0k| } 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| 22.2k| return r; 1270| 22.2k|} _ZN5Botan9comba_sqrILm6ETkNS_8WordTypeEmEEvPT0_PKS1_: 1007| 1.62M|constexpr inline void comba_sqr(W z[2 * N], const W x[N]) { 1008| 1.62M| if(!std::is_constant_evaluated()) { ------------------ | Branch (1008:7): [True: 1.62M, Folded] ------------------ 1009| | if constexpr(std::same_as && N == 4) { 1010| | return bigint_comba_sqr4(z, x); 1011| | } 1012| 1.62M| if constexpr(std::same_as && N == 6) { 1013| 1.62M| return bigint_comba_sqr6(z, x); 1014| 1.62M| } 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.62M| } 1028| | 1029| 0| word3 accum; 1030| | 1031| 1.62M| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (1031:22): [True: 0, False: 1.62M] ------------------ 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.62M|} _ZN5Botan22bigint_monty_maybe_subILm6ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 257| 2.48M|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 258| 2.48M| W borrow = 0; 259| | 260| 17.4M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (260:22): [True: 14.9M, False: 2.48M] ------------------ 261| 14.9M| z[i] = word_sub(x[i], y[i], &borrow); 262| 14.9M| } 263| | 264| 2.48M| borrow = (x0 - borrow) > x0; 265| | 266| 2.48M| CT::conditional_assign_mem(borrow, z, x, N); 267| 2.48M|} _ZN5Botan9comba_mulILm6ETkNS_8WordTypeEmEEvPT0_PKS1_S4_: 971| 1.56M|constexpr inline void comba_mul(W z[2 * N], const W x[N], const W y[N]) { 972| 1.56M| if(!std::is_constant_evaluated()) { ------------------ | Branch (972:7): [True: 1.56M, Folded] ------------------ 973| | if constexpr(std::same_as && N == 4) { 974| | return bigint_comba_mul4(z, x, y); 975| | } 976| 1.56M| if constexpr(std::same_as && N == 6) { 977| 1.56M| return bigint_comba_mul6(z, x, y); 978| 1.56M| } 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.56M| } 992| | 993| 0| word3 accum; 994| | 995| 1.56M| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (995:22): [True: 0, False: 1.56M] ------------------ 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.56M|} _ZN5Botan10shift_leftILm1ETkNS_8WordTypeEmLm6EEET0_RNSt3__15arrayIS1_XT1_EEE: 878| 543k|inline constexpr W shift_left(std::array& x) { 879| 543k| static_assert(N >= 1, "Invalid input size"); 880| 543k| static_assert(S > 0, "Zero shift not supported"); 881| 543k| static_assert(S < WordInfo::bits, "Shift too large"); 882| | 883| 543k| const W carry = x[N - 1] >> (WordInfo::bits - S); 884| | 885| 3.25M| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (885:26): [True: 2.71M, False: 543k] ------------------ 886| 2.71M| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 887| 2.71M| } 888| 543k| x[0] <<= S; 889| | 890| 543k| return carry; 891| 543k|} _ZN5Botan16read_window_bitsILm5EmLm6EEEmNSt3__14spanIKT0_XT1_EEEm: 1274| 57.0k|constexpr size_t read_window_bits(std::span words, size_t offset) { 1275| 57.0k| static_assert(WindowBits >= 1 && WindowBits <= 7); 1276| | 1277| 57.0k| constexpr uint8_t WindowMask = static_cast(1 << WindowBits) - 1; 1278| | 1279| 57.0k| constexpr size_t W_bits = sizeof(W) * 8; 1280| 57.0k| const auto bit_shift = offset % W_bits; 1281| 57.0k| const auto word_offset = words.size() - 1 - (offset / W_bits); 1282| | 1283| 57.0k| const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0; ------------------ | Branch (1283:36): [True: 53.3k, False: 3.70k] | Branch (1283:74): [True: 741, False: 2.96k] ------------------ 1284| | 1285| 57.0k| const auto w0 = words[word_offset]; 1286| | 1287| 57.0k| if(single_byte_window) { ------------------ | Branch (1287:7): [True: 54.0k, False: 2.96k] ------------------ 1288| 54.0k| return (w0 >> bit_shift) & WindowMask; 1289| 54.0k| } else { 1290| | // Otherwise we must join two words and extract the result 1291| 2.96k| const auto w1 = words[word_offset - 1]; 1292| 2.96k| const auto combined = ((w0 >> bit_shift) | (w1 << (W_bits - bit_shift))); 1293| 2.96k| return combined & WindowMask; 1294| 2.96k| } 1295| 57.0k|} _ZN5Botan11shift_rightILm1ETkNS_8WordTypeEmLm6EEET0_RNSt3__15arrayIS1_XT1_EEE: 894| 34.7k|inline constexpr W shift_right(std::array& x) { 895| 34.7k| static_assert(N >= 1, "Invalid input size"); 896| 34.7k| static_assert(S > 0, "Zero shift not supported"); 897| 34.7k| static_assert(S < WordInfo::bits, "Shift too large"); 898| | 899| 34.7k| const W carry = x[0] << (WordInfo::bits - S); 900| | 901| 208k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (901:22): [True: 173k, False: 34.7k] ------------------ 902| 173k| x[i] = (x[i] >> S) | (x[i + 1] << (WordInfo::bits - S)); 903| 173k| } 904| 34.7k| x[N - 1] >>= S; 905| | 906| 34.7k| return carry; 907| 34.7k|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm12ELm96EEEDaNSt3__14spanIKhXT1_EEE: 1245| 5.51k|inline constexpr auto bytes_to_words(std::span bytes) { 1246| 5.51k| static_assert(L <= WordInfo::bytes * N); 1247| | 1248| 5.51k| std::array r = {}; 1249| | 1250| 5.51k| constexpr size_t full_words = L / WordInfo::bytes; 1251| 5.51k| constexpr size_t extra_bytes = L % WordInfo::bytes; 1252| | 1253| 5.51k| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 1254| | 1255| 71.6k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (1255:22): [True: 66.1k, False: 5.51k] ------------------ 1256| 66.1k| r[i] = load_be(bytes.data(), full_words - 1 - i); 1257| 66.1k| } 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| 5.51k| return r; 1270| 5.51k|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm6ELm48EEEDaNSt3__14spanIKhXT1_EEE: 1245| 2.37k|inline constexpr auto bytes_to_words(std::span bytes) { 1246| 2.37k| static_assert(L <= WordInfo::bytes * N); 1247| | 1248| 2.37k| std::array r = {}; 1249| | 1250| 2.37k| constexpr size_t full_words = L / WordInfo::bytes; 1251| 2.37k| constexpr size_t extra_bytes = L % WordInfo::bytes; 1252| | 1253| 2.37k| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 1254| | 1255| 16.6k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (1255:22): [True: 14.2k, False: 2.37k] ------------------ 1256| 14.2k| r[i] = load_be(bytes.data(), full_words - 1 - i); 1257| 14.2k| } 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| 2.37k| return r; 1270| 2.37k|} _ZN5Botan9comba_sqrILm8ETkNS_8WordTypeEmEEvPT0_PKS1_: 1007| 1.17M|constexpr inline void comba_sqr(W z[2 * N], const W x[N]) { 1008| 1.17M| if(!std::is_constant_evaluated()) { ------------------ | Branch (1008:7): [True: 1.17M, 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| 1.17M| if constexpr(std::same_as && N == 8) { 1019| 1.17M| return bigint_comba_sqr8(z, x); 1020| 1.17M| } 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.17M| } 1028| | 1029| 0| word3 accum; 1030| | 1031| 1.17M| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (1031:22): [True: 0, False: 1.17M] ------------------ 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.17M|} _ZN5Botan22bigint_monty_maybe_subILm8ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 257| 3.04M|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 258| 3.04M| W borrow = 0; 259| | 260| 27.4M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (260:22): [True: 24.3M, False: 3.04M] ------------------ 261| 24.3M| z[i] = word_sub(x[i], y[i], &borrow); 262| 24.3M| } 263| | 264| 3.04M| borrow = (x0 - borrow) > x0; 265| | 266| 3.04M| CT::conditional_assign_mem(borrow, z, x, N); 267| 3.04M|} _ZN5Botan9comba_mulILm8ETkNS_8WordTypeEmEEvPT0_PKS1_S4_: 971| 1.14M|constexpr inline void comba_mul(W z[2 * N], const W x[N], const W y[N]) { 972| 1.14M| if(!std::is_constant_evaluated()) { ------------------ | Branch (972:7): [True: 1.14M, 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| 1.14M| if constexpr(std::same_as && N == 8) { 983| 1.14M| return bigint_comba_mul8(z, x, y); 984| 1.14M| } 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.14M| } 992| | 993| 0| word3 accum; 994| | 995| 1.14M| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (995:22): [True: 0, False: 1.14M] ------------------ 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.14M|} _ZN5Botan10shift_leftILm1ETkNS_8WordTypeEmLm8EEET0_RNSt3__15arrayIS1_XT1_EEE: 878| 406k|inline constexpr W shift_left(std::array& x) { 879| 406k| static_assert(N >= 1, "Invalid input size"); 880| 406k| static_assert(S > 0, "Zero shift not supported"); 881| 406k| static_assert(S < WordInfo::bits, "Shift too large"); 882| | 883| 406k| const W carry = x[N - 1] >> (WordInfo::bits - S); 884| | 885| 3.25M| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (885:26): [True: 2.84M, False: 406k] ------------------ 886| 2.84M| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 887| 2.84M| } 888| 406k| x[0] <<= S; 889| | 890| 406k| return carry; 891| 406k|} _ZN5Botan16read_window_bitsILm5EmLm8EEEmNSt3__14spanIKT0_XT1_EEEm: 1274| 84.1k|constexpr size_t read_window_bits(std::span words, size_t offset) { 1275| 84.1k| static_assert(WindowBits >= 1 && WindowBits <= 7); 1276| | 1277| 84.1k| constexpr uint8_t WindowMask = static_cast(1 << WindowBits) - 1; 1278| | 1279| 84.1k| constexpr size_t W_bits = sizeof(W) * 8; 1280| 84.1k| const auto bit_shift = offset % W_bits; 1281| 84.1k| const auto word_offset = words.size() - 1 - (offset / W_bits); 1282| | 1283| 84.1k| const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0; ------------------ | Branch (1283:36): [True: 78.4k, False: 5.71k] | Branch (1283:74): [True: 817, False: 4.90k] ------------------ 1284| | 1285| 84.1k| const auto w0 = words[word_offset]; 1286| | 1287| 84.1k| if(single_byte_window) { ------------------ | Branch (1287:7): [True: 79.2k, False: 4.90k] ------------------ 1288| 79.2k| return (w0 >> bit_shift) & WindowMask; 1289| 79.2k| } else { 1290| | // Otherwise we must join two words and extract the result 1291| 4.90k| const auto w1 = words[word_offset - 1]; 1292| 4.90k| const auto combined = ((w0 >> bit_shift) | (w1 << (W_bits - bit_shift))); 1293| 4.90k| return combined & WindowMask; 1294| 4.90k| } 1295| 84.1k|} _ZN5Botan11shift_rightILm1ETkNS_8WordTypeEmLm8EEET0_RNSt3__15arrayIS1_XT1_EEE: 894| 25.9k|inline constexpr W shift_right(std::array& x) { 895| 25.9k| static_assert(N >= 1, "Invalid input size"); 896| 25.9k| static_assert(S > 0, "Zero shift not supported"); 897| 25.9k| static_assert(S < WordInfo::bits, "Shift too large"); 898| | 899| 25.9k| const W carry = x[0] << (WordInfo::bits - S); 900| | 901| 207k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (901:22): [True: 181k, False: 25.9k] ------------------ 902| 181k| x[i] = (x[i] >> S) | (x[i + 1] << (WordInfo::bits - S)); 903| 181k| } 904| 25.9k| x[N - 1] >>= S; 905| | 906| 25.9k| return carry; 907| 25.9k|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm16ELm128EEEDaNSt3__14spanIKhXT1_EEE: 1245| 2.79k|inline constexpr auto bytes_to_words(std::span bytes) { 1246| 2.79k| static_assert(L <= WordInfo::bytes * N); 1247| | 1248| 2.79k| std::array r = {}; 1249| | 1250| 2.79k| constexpr size_t full_words = L / WordInfo::bytes; 1251| 2.79k| constexpr size_t extra_bytes = L % WordInfo::bytes; 1252| | 1253| 2.79k| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 1254| | 1255| 47.4k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (1255:22): [True: 44.6k, False: 2.79k] ------------------ 1256| 44.6k| r[i] = load_be(bytes.data(), full_words - 1 - i); 1257| 44.6k| } 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| 2.79k| return r; 1270| 2.79k|} _ZN5Botan10shift_leftILm1ETkNS_8WordTypeEmLm9EEET0_RNSt3__15arrayIS1_XT1_EEE: 878| 377k|inline constexpr W shift_left(std::array& x) { 879| 377k| static_assert(N >= 1, "Invalid input size"); 880| 377k| static_assert(S > 0, "Zero shift not supported"); 881| 377k| static_assert(S < WordInfo::bits, "Shift too large"); 882| | 883| 377k| const W carry = x[N - 1] >> (WordInfo::bits - S); 884| | 885| 3.39M| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (885:26): [True: 3.01M, False: 377k] ------------------ 886| 3.01M| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 887| 3.01M| } 888| 377k| x[0] <<= S; 889| | 890| 377k| return carry; 891| 377k|} _ZN5Botan22bigint_monty_maybe_subILm9ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 257| 668k|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 258| 668k| W borrow = 0; 259| | 260| 6.68M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (260:22): [True: 6.01M, False: 668k] ------------------ 261| 6.01M| z[i] = word_sub(x[i], y[i], &borrow); 262| 6.01M| } 263| | 264| 668k| borrow = (x0 - borrow) > x0; 265| | 266| 668k| CT::conditional_assign_mem(borrow, z, x, N); 267| 668k|} _ZN5Botan11shift_rightILm1ETkNS_8WordTypeEmLm9EEET0_RNSt3__15arrayIS1_XT1_EEE: 894| 24.1k|inline constexpr W shift_right(std::array& x) { 895| 24.1k| static_assert(N >= 1, "Invalid input size"); 896| 24.1k| static_assert(S > 0, "Zero shift not supported"); 897| 24.1k| static_assert(S < WordInfo::bits, "Shift too large"); 898| | 899| 24.1k| const W carry = x[0] << (WordInfo::bits - S); 900| | 901| 217k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (901:22): [True: 193k, False: 24.1k] ------------------ 902| 193k| x[i] = (x[i] >> S) | (x[i + 1] << (WordInfo::bits - S)); 903| 193k| } 904| 24.1k| x[N - 1] >>= S; 905| | 906| 24.1k| return carry; 907| 24.1k|} _ZN5Botan9comba_sqrILm9ETkNS_8WordTypeEmEEvPT0_PKS1_: 1007| 1.06M|constexpr inline void comba_sqr(W z[2 * N], const W x[N]) { 1008| 1.06M| if(!std::is_constant_evaluated()) { ------------------ | Branch (1008:7): [True: 1.06M, 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| 1.06M| if constexpr(std::same_as && N == 9) { 1022| 1.06M| return bigint_comba_sqr9(z, x); 1023| 1.06M| } 1024| | if constexpr(std::same_as && N == 16) { 1025| | return bigint_comba_sqr16(z, x); 1026| | } 1027| 1.06M| } 1028| | 1029| 0| word3 accum; 1030| | 1031| 1.06M| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (1031:22): [True: 0, False: 1.06M] ------------------ 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.06M|} _ZN5Botan9comba_mulILm9ETkNS_8WordTypeEmEEvPT0_PKS1_S4_: 971| 978k|constexpr inline void comba_mul(W z[2 * N], const W x[N], const W y[N]) { 972| 978k| if(!std::is_constant_evaluated()) { ------------------ | Branch (972:7): [True: 978k, 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| 978k| if constexpr(std::same_as && N == 9) { 986| 978k| return bigint_comba_mul9(z, x, y); 987| 978k| } 988| | if constexpr(std::same_as && N == 16) { 989| | return bigint_comba_mul16(z, x, y); 990| | } 991| 978k| } 992| | 993| 0| word3 accum; 994| | 995| 978k| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (995:22): [True: 0, False: 978k] ------------------ 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| 978k|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm18ELm132EEEDaNSt3__14spanIKhXT1_EEE: 1245| 2.60k|inline constexpr auto bytes_to_words(std::span bytes) { 1246| 2.60k| static_assert(L <= WordInfo::bytes * N); 1247| | 1248| 2.60k| std::array r = {}; 1249| | 1250| 2.60k| constexpr size_t full_words = L / WordInfo::bytes; 1251| 2.60k| constexpr size_t extra_bytes = L % WordInfo::bytes; 1252| | 1253| 2.60k| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 1254| | 1255| 44.2k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (1255:22): [True: 41.6k, False: 2.60k] ------------------ 1256| 41.6k| r[i] = load_be(bytes.data(), full_words - 1 - i); 1257| 41.6k| } 1258| | 1259| 2.60k| if constexpr(extra_bytes > 0) { 1260| 2.60k| constexpr size_t shift = extra_bytes * 8; 1261| 2.60k| shift_left(r); 1262| | 1263| 13.0k| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (1263:25): [True: 10.4k, False: 2.60k] ------------------ 1264| 10.4k| const W b0 = bytes[WordInfo::bytes * full_words + i]; 1265| 10.4k| r[0] |= (b0 << (8 * (extra_bytes - 1 - i))); 1266| 10.4k| } 1267| 2.60k| } 1268| | 1269| 2.60k| return r; 1270| 2.60k|} _ZN5Botan10shift_leftILm32ETkNS_8WordTypeEmLm18EEET0_RNSt3__15arrayIS1_XT1_EEE: 878| 2.60k|inline constexpr W shift_left(std::array& x) { 879| 2.60k| static_assert(N >= 1, "Invalid input size"); 880| 2.60k| static_assert(S > 0, "Zero shift not supported"); 881| 2.60k| static_assert(S < WordInfo::bits, "Shift too large"); 882| | 883| 2.60k| const W carry = x[N - 1] >> (WordInfo::bits - S); 884| | 885| 46.8k| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (885:26): [True: 44.2k, False: 2.60k] ------------------ 886| 44.2k| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 887| 44.2k| } 888| 2.60k| x[0] <<= S; 889| | 890| 2.60k| return carry; 891| 2.60k|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm9ELm66EEEDaNSt3__14spanIKhXT1_EEE: 1245| 1.05k|inline constexpr auto bytes_to_words(std::span bytes) { 1246| 1.05k| static_assert(L <= WordInfo::bytes * N); 1247| | 1248| 1.05k| std::array r = {}; 1249| | 1250| 1.05k| constexpr size_t full_words = L / WordInfo::bytes; 1251| 1.05k| constexpr size_t extra_bytes = L % WordInfo::bytes; 1252| | 1253| 1.05k| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 1254| | 1255| 9.45k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (1255:22): [True: 8.40k, False: 1.05k] ------------------ 1256| 8.40k| r[i] = load_be(bytes.data(), full_words - 1 - i); 1257| 8.40k| } 1258| | 1259| 1.05k| if constexpr(extra_bytes > 0) { 1260| 1.05k| constexpr size_t shift = extra_bytes * 8; 1261| 1.05k| shift_left(r); 1262| | 1263| 3.15k| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (1263:25): [True: 2.10k, False: 1.05k] ------------------ 1264| 2.10k| const W b0 = bytes[WordInfo::bytes * full_words + i]; 1265| 2.10k| r[0] |= (b0 << (8 * (extra_bytes - 1 - i))); 1266| 2.10k| } 1267| 1.05k| } 1268| | 1269| 1.05k| return r; 1270| 1.05k|} _ZN5Botan10shift_leftILm16ETkNS_8WordTypeEmLm9EEET0_RNSt3__15arrayIS1_XT1_EEE: 878| 1.05k|inline constexpr W shift_left(std::array& x) { 879| 1.05k| static_assert(N >= 1, "Invalid input size"); 880| 1.05k| static_assert(S > 0, "Zero shift not supported"); 881| 1.05k| static_assert(S < WordInfo::bits, "Shift too large"); 882| | 883| 1.05k| const W carry = x[N - 1] >> (WordInfo::bits - S); 884| | 885| 9.45k| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (885:26): [True: 8.40k, False: 1.05k] ------------------ 886| 8.40k| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 887| 8.40k| } 888| 1.05k| x[0] <<= S; 889| | 890| 1.05k| return carry; 891| 1.05k|} _ZN5Botan9comba_mulILm7ETkNS_8WordTypeEmEEvPT0_PKS1_S4_: 971| 40.5k|constexpr inline void comba_mul(W z[2 * N], const W x[N], const W y[N]) { 972| 40.5k| if(!std::is_constant_evaluated()) { ------------------ | Branch (972:7): [True: 40.5k, 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| 40.5k| if constexpr(std::same_as && N == 7) { 980| 40.5k| return bigint_comba_mul7(z, x, y); 981| 40.5k| } 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| 40.5k| } 992| | 993| 0| word3 accum; 994| | 995| 40.5k| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (995:22): [True: 0, False: 40.5k] ------------------ 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| 40.5k|} _ZN5Botan9comba_sqrILm7ETkNS_8WordTypeEmEEvPT0_PKS1_: 1007| 40.3k|constexpr inline void comba_sqr(W z[2 * N], const W x[N]) { 1008| 40.3k| if(!std::is_constant_evaluated()) { ------------------ | Branch (1008:7): [True: 40.3k, 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| 40.3k| if constexpr(std::same_as && N == 7) { 1016| 40.3k| return bigint_comba_sqr7(z, x); 1017| 40.3k| } 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| 40.3k| } 1028| | 1029| 0| word3 accum; 1030| | 1031| 40.3k| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (1031:22): [True: 0, False: 40.3k] ------------------ 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| 40.3k|} _ZN5Botan14OCB_EncryptionC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEm: 101| 5| OCB_Mode(std::move(cipher), tag_size) {} _ZN5Botan14OCB_DecryptionC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEm: 120| 32| OCB_Mode(std::move(cipher), tag_size) {} _ZNK5Botan8OCB_Mode8tag_sizeEv: 46| 211| size_t tag_size() const final { return m_tag_size; } _ZNK5Botan8OCB_Mode10block_sizeEv: 63| 175| size_t block_size() const { return m_block_size; } _ZNK5Botan8OCB_Mode10par_blocksEv: 65| 83| size_t par_blocks() const { return m_par_blocks; } _ZNK5Botan14OCB_Decryption18minimum_final_sizeEv: 124| 28| size_t minimum_final_size() const override { return tag_size(); } _ZN5Botan6PCurve15PrimeOrderCurve6ScalarD2Ev: 73| 47.7k| ~Scalar() { _zeroize(); } _ZN5Botan6PCurve15PrimeOrderCurve11AffinePointD2Ev: 101| 68.1k| ~AffinePoint() = default; _ZN5Botan6PCurve15PrimeOrderCurve15ProjectivePointD2Ev: 135| 8.69k| ~ProjectivePoint() = default; _ZN5Botan6PCurve15PrimeOrderCurve6ScalarC2EOS2_: 68| 25.0k| Scalar(Scalar&& other) = default; _ZN5Botan6PCurve15PrimeOrderCurve6ScalarC2ERKS2_: 67| 13.9k| Scalar(const Scalar& other) = default; _ZN5Botan6PCurve15PrimeOrderCurve11AffinePointC2EOS2_: 98| 47.4k| AffinePoint(AffinePoint&& other) = default; _ZN5Botan6PCurve15PrimeOrderCurve11AffinePointC2ERKS2_: 97| 2.82k| AffinePoint(const AffinePoint& other) = default; _ZNK5Botan6PCurve15PrimeOrderCurve6Scalar6_curveEv: 77| 27.4k| const auto& _curve() const { return m_curve; } _ZNK5Botan6PCurve15PrimeOrderCurve6Scalar6_valueEv: 79| 27.4k| const auto& _value() const { return m_value; } _ZN5Botan6PCurve15PrimeOrderCurve6Scalar7_createENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEE: 81| 8.69k| static Scalar _create(CurvePtr curve, StorageUnit v) { return Scalar(std::move(curve), v); } _ZN5Botan6PCurve15PrimeOrderCurve6ScalarC2ENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEE: 84| 8.69k| Scalar(CurvePtr curve, StorageUnit v) : m_curve(std::move(curve)), m_value(v) {} _ZNK5Botan6PCurve15PrimeOrderCurve11AffinePoint6_curveEv: 105| 42.6k| const auto& _curve() const { return m_curve; } _ZNK5Botan6PCurve15PrimeOrderCurve11AffinePoint2_xEv: 107| 42.6k| const auto& _x() const { return m_x; } _ZNK5Botan6PCurve15PrimeOrderCurve11AffinePoint2_yEv: 109| 42.6k| const auto& _y() const { return m_y; } _ZN5Botan6PCurve15PrimeOrderCurve11AffinePoint7_createENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEES8_: 111| 17.7k| static AffinePoint _create(CurvePtr curve, StorageUnit x, StorageUnit y) { 112| 17.7k| return AffinePoint(std::move(curve), x, y); 113| 17.7k| } _ZN5Botan6PCurve15PrimeOrderCurve11AffinePointC2ENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEES8_: 116| 17.7k| AffinePoint(CurvePtr curve, StorageUnit x, StorageUnit y) : m_curve(std::move(curve)), m_x(x), m_y(y) {} _ZNK5Botan6PCurve15PrimeOrderCurve15ProjectivePoint6_curveEv: 137| 8.69k| const auto& _curve() const { return m_curve; } _ZNK5Botan6PCurve15PrimeOrderCurve15ProjectivePoint2_xEv: 139| 8.69k| const auto& _x() const { return m_x; } _ZNK5Botan6PCurve15PrimeOrderCurve15ProjectivePoint2_yEv: 141| 8.69k| const auto& _y() const { return m_y; } _ZNK5Botan6PCurve15PrimeOrderCurve15ProjectivePoint2_zEv: 143| 8.69k| const auto& _z() const { return m_z; } _ZN5Botan6PCurve15PrimeOrderCurve15ProjectivePoint7_createENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEES8_S8_: 145| 8.69k| static ProjectivePoint _create(CurvePtr curve, StorageUnit x, StorageUnit y, StorageUnit z) { 146| 8.69k| return ProjectivePoint(std::move(curve), x, y, z); 147| 8.69k| } _ZN5Botan6PCurve15PrimeOrderCurve15ProjectivePointC2ENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEES8_S8_: 151| 8.69k| m_curve(std::move(curve)), m_x(x), m_y(y), m_z(z) {} _ZN5Botan6PCurve15PrimeOrderCurveD2Ev: 164| 6| virtual ~PrimeOrderCurve() = default; pcurves_brainpool256r1.cpp:_ZN5Botan11dbl_genericINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES3_E11FieldParamsEEEEES8_EESC_EET_RKSE_RKT0_: 419| 1.13k|inline constexpr ProjectivePoint dbl_generic(const ProjectivePoint& pt, const FieldElement& A) { 420| | // Cost: 1M + 3S + 1A + 1*3 421| 1.13k| const auto z2 = pt.z().square(); 422| 1.13k| const auto m = pt.x().square().mul3() + A * z2.square(); 423| | 424| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 425| 1.13k| const auto y2 = pt.y().square(); 426| 1.13k| const auto s = pt.x().mul4() * y2; 427| 1.13k| const auto nx = m.square() - s.mul2(); 428| 1.13k| const auto ny = m * (s - nx) - y2.square().mul8(); 429| 1.13k| const auto nz = pt.y().mul2() * pt.z(); 430| | 431| 1.13k| return ProjectivePoint(nx, ny, nz); 432| 1.13k|} pcurves_brainpool256r1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES3_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_brainpool256r1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELb1EEEDaNSt3__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_brainpool256r1.cpp:_ZN5Botan9to_affineINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveEEEDaRKNT_15ProjectivePointE: 77| 543|inline constexpr auto to_affine(const typename C::ProjectivePoint& pt) { 78| | // Not strictly required right? - default should work as long 79| | // as (0,0) is identity and invert returns 0 on 0 80| | 81| | if constexpr(curve_supports_fe_invert2) { 82| | const auto z2_inv = C::fe_invert2(pt.z()); 83| | const auto z3_inv = z2_inv.square() * pt.z(); 84| | return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv); 85| 543| } else { 86| 543| const auto z_inv = invert_field_element(pt.z()); 87| 543| const auto z2_inv = z_inv.square(); 88| 543| const auto z3_inv = z_inv * z2_inv; 89| 543| return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv); 90| 543| } 91| 543|} pcurves_brainpool256r1.cpp:_ZN5Botan20invert_field_elementINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveEEEDaRKNT_12FieldElementE: 36| 842|inline constexpr auto invert_field_element(const typename C::FieldElement& fe) { 37| | if constexpr(curve_supports_fe_invert2) { 38| | return C::fe_invert2(fe) * fe; 39| 842| } else { 40| 842| return fe.invert(); 41| 842| } 42| 842|} pcurves_brainpool256r1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELb1EEEDaNSt3__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_brainpool256r1.cpp:_ZN5Botan22point_add_or_sub_mixedINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES3_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EET_RKSG_RKT0_NS_2CT6ChoiceERKT1_SQ_: 318| 43.1k| const FieldElement& curve_a) { 319| 43.1k| const auto a_is_identity = a.is_identity(); 320| 43.1k| 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| 43.1k| auto by = b.y(); 329| 43.1k| by.conditional_assign(sub, by.negate()); 330| | 331| 43.1k| const auto Z1Z1 = a.z().square(); 332| 43.1k| const auto U2 = b.x() * Z1Z1; 333| 43.1k| const auto S2 = by * a.z() * Z1Z1; 334| 43.1k| const auto H = U2 - a.x(); 335| 43.1k| 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| 43.1k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (347:7): [True: 0, False: 43.1k] ------------------ 348| 0| return a.dbl_iso(curve_a); 349| 0| } 350| | 351| 43.1k| const auto HH = H.square(); 352| 43.1k| const auto HHH = H * HH; 353| 43.1k| const auto V = a.x() * HH; 354| 43.1k| const auto t2 = r.square(); 355| 43.1k| const auto t3 = V + V; 356| 43.1k| const auto t4 = t2 - HHH; 357| 43.1k| auto X3 = t4 - t3; 358| 43.1k| const auto t5 = V - X3; 359| 43.1k| const auto t6 = a.y() * HHH; 360| 43.1k| const auto t7 = r * t5; 361| 43.1k| auto Y3 = t7 - t6; 362| 43.1k| auto Z3 = a.z() * H; 363| | 364| | // if a is identity then return b 365| 43.1k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), by, one); 366| | 367| | // if b is identity then return a 368| 43.1k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 369| | 370| 43.1k| return ProjectivePoint(X3, Y3, Z3); 371| 43.1k|} pcurves_brainpool256r1.cpp:_ZN5Botan11to_affine_xINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveEEEDaRKNT_15ProjectivePointE: 97| 299|auto to_affine_x(const typename C::ProjectivePoint& pt) { 98| | if constexpr(curve_supports_fe_invert2) { 99| | return pt.x() * C::fe_invert2(pt.z()); 100| 299| } else { 101| 299| const auto z_inv = invert_field_element(pt.z()); 102| 299| const auto z2_inv = z_inv.square(); 103| 299| return pt.x() * z2_inv; 104| 299| } 105| 299|} pcurves_brainpool256r1.cpp:_ZN5Botan17point_add_mixed_hINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES3_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EENSt3__14pairIT_T1_EERKSI_RKT0_RKSJ_SR_: 250| 4.18k| const FieldElement& curve_a) { 251| 4.18k| const auto a_is_identity = a.is_identity(); 252| 4.18k| 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| 4.18k| const auto Z1Z1 = a.z().square(); 261| 4.18k| const auto U2 = b.x() * Z1Z1; 262| 4.18k| const auto S2 = b.y() * a.z() * Z1Z1; 263| 4.18k| const auto H = U2 - a.x(); 264| 4.18k| 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| 4.18k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (276:7): [True: 0, False: 4.18k] ------------------ 277| 0| return {a.dbl_iso(curve_a), H}; 278| 0| } 279| | 280| 4.18k| const auto HH = H.square(); 281| 4.18k| const auto HHH = H * HH; 282| 4.18k| const auto V = a.x() * HH; 283| 4.18k| const auto t2 = r.square(); 284| 4.18k| const auto t3 = V + V; 285| 4.18k| const auto t4 = t2 - HHH; 286| 4.18k| auto X3 = t4 - t3; 287| 4.18k| const auto t5 = V - X3; 288| 4.18k| const auto t6 = a.y() * HHH; 289| 4.18k| const auto t7 = r * t5; 290| 4.18k| auto Y3 = t7 - t6; 291| 4.18k| auto Z3 = a.z() * H; 292| | 293| | // if a is identity then return b 294| 4.18k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), one); 295| | 296| | // if b is identity then return a 297| 4.18k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 298| | 299| 4.18k| return {ProjectivePoint(X3, Y3, Z3), H}; 300| 4.18k|} pcurves_brainpool256r1.cpp:_ZN5Botan13dbl_n_genericINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES3_E11FieldParamsEEEEES8_EESC_EET_RKSE_RKT0_m: 499| 17.0k|inline constexpr ProjectivePoint dbl_n_generic(const ProjectivePoint& pt, const FieldElement& A, size_t n) { 500| 17.0k| auto nx = pt.x(); 501| 17.0k| auto ny = pt.y().mul2(); 502| 17.0k| auto nz = pt.z(); 503| 17.0k| auto w = nz.square().square() * A; 504| | 505| | // Conditional ok: loop iteration count is public 506| 102k| while(n > 0) { ------------------ | Branch (506:10): [True: 85.2k, False: 17.0k] ------------------ 507| 85.2k| const auto ny2 = ny.square(); 508| 85.2k| const auto ny4 = ny2.square(); 509| 85.2k| const auto t1 = nx.square().mul3() + w; 510| 85.2k| const auto t2 = nx * ny2; 511| 85.2k| nx = t1.square() - t2.mul2(); 512| 85.2k| nz *= ny; 513| 85.2k| ny = t1 * (t2 - nx).mul2() - ny4; 514| 85.2k| n--; 515| | // Conditional ok: loop iteration count is public 516| 85.2k| if(n > 0) { ------------------ | Branch (516:10): [True: 68.1k, False: 17.0k] ------------------ 517| 68.1k| w *= ny4; 518| 68.1k| } 519| 85.2k| } 520| 17.0k| return ProjectivePoint(nx, ny.div2(), nz); 521| 17.0k|} pcurves_brainpool256r1.cpp:_ZN5Botan18sqrt_field_elementINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveEEENS_2CT6OptionINT_12FieldElementEEERKS8_: 61| 360|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| 360| } else { 69| 360| return fe.sqrt(); 70| 360| } 71| 360|} pcurves_brainpool384r1.cpp:_ZN5Botan11dbl_genericINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES3_E11FieldParamsEEEEES8_EESC_EET_RKSE_RKT0_: 419| 1.40k|inline constexpr ProjectivePoint dbl_generic(const ProjectivePoint& pt, const FieldElement& A) { 420| | // Cost: 1M + 3S + 1A + 1*3 421| 1.40k| const auto z2 = pt.z().square(); 422| 1.40k| const auto m = pt.x().square().mul3() + A * z2.square(); 423| | 424| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 425| 1.40k| const auto y2 = pt.y().square(); 426| 1.40k| const auto s = pt.x().mul4() * y2; 427| 1.40k| const auto nx = m.square() - s.mul2(); 428| 1.40k| const auto ny = m * (s - nx) - y2.square().mul8(); 429| 1.40k| const auto nz = pt.y().mul2() * pt.z(); 430| | 431| 1.40k| return ProjectivePoint(nx, ny, nz); 432| 1.40k|} pcurves_brainpool384r1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES3_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_: 188| 1.09k|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 189| 1.09k| const auto a_is_identity = a.is_identity(); 190| 1.09k| const auto b_is_identity = b.is_identity(); 191| | 192| 1.09k| const auto Z1Z1 = a.z().square(); 193| 1.09k| const auto Z2Z2 = b.z().square(); 194| 1.09k| const auto U1 = a.x() * Z2Z2; 195| 1.09k| const auto U2 = b.x() * Z1Z1; 196| 1.09k| const auto S1 = a.y() * b.z() * Z2Z2; 197| 1.09k| const auto S2 = b.y() * a.z() * Z1Z1; 198| 1.09k| const auto H = U2 - U1; 199| 1.09k| 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| 1.09k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (211:7): [True: 0, False: 1.09k] ------------------ 212| 0| return a.dbl(); 213| 0| } 214| | 215| 1.09k| const auto HH = H.square(); 216| 1.09k| const auto HHH = H * HH; 217| 1.09k| const auto V = U1 * HH; 218| 1.09k| const auto t2 = r.square(); 219| 1.09k| const auto t3 = V + V; 220| 1.09k| const auto t4 = t2 - HHH; 221| 1.09k| auto X3 = t4 - t3; 222| 1.09k| const auto t5 = V - X3; 223| 1.09k| const auto t6 = S1 * HHH; 224| 1.09k| const auto t7 = r * t5; 225| 1.09k| auto Y3 = t7 - t6; 226| 1.09k| const auto t8 = b.z() * H; 227| 1.09k| auto Z3 = a.z() * t8; 228| | 229| | // if a is identity then return b 230| 1.09k| 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| 1.09k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 234| | 235| 1.09k| return ProjectivePoint(X3, Y3, Z3); 236| 1.09k|} pcurves_brainpool384r1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELb1EEEDaNSt3__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| 2.33k| for(const auto& pt : projective) { ------------------ | Branch (117:23): [True: 2.33k, False: 1] ------------------ 118| 2.33k| any_identity = any_identity || pt.is_identity(); 119| 2.33k| } 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| 2.33k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (146:25): [True: 2.33k, False: 1] ------------------ 147| 2.33k| c.push_back(c[i - 1] * projective[i].z()); 148| 2.33k| } 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| 2.33k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (158:29): [True: 2.33k, False: 1] ------------------ 159| 2.33k| const auto& p = projective[i]; 160| | 161| 2.33k| const auto z_inv = s_inv * c[i - 1]; 162| 2.33k| const auto z2_inv = z_inv.square(); 163| 2.33k| const auto z3_inv = z_inv * z2_inv; 164| | 165| 2.33k| s_inv = s_inv * p.z(); 166| | 167| 2.33k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 168| 2.33k| } 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_brainpool384r1.cpp:_ZN5Botan9to_affineINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveEEEDaRKNT_15ProjectivePointE: 77| 351|inline constexpr auto to_affine(const typename C::ProjectivePoint& pt) { 78| | // Not strictly required right? - default should work as long 79| | // as (0,0) is identity and invert returns 0 on 0 80| | 81| | if constexpr(curve_supports_fe_invert2) { 82| | const auto z2_inv = C::fe_invert2(pt.z()); 83| | const auto z3_inv = z2_inv.square() * pt.z(); 84| | return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv); 85| 351| } else { 86| 351| const auto z_inv = invert_field_element(pt.z()); 87| 351| const auto z2_inv = z_inv.square(); 88| 351| const auto z3_inv = z_inv * z2_inv; 89| 351| return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv); 90| 351| } 91| 351|} pcurves_brainpool384r1.cpp:_ZN5Botan20invert_field_elementINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveEEEDaRKNT_12FieldElementE: 36| 519|inline constexpr auto invert_field_element(const typename C::FieldElement& fe) { 37| | if constexpr(curve_supports_fe_invert2) { 38| | return C::fe_invert2(fe) * fe; 39| 519| } else { 40| 519| return fe.invert(); 41| 519| } 42| 519|} pcurves_brainpool384r1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELb1EEEDaNSt3__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_brainpool384r1.cpp:_ZN5Botan22point_add_or_sub_mixedINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES3_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EET_RKSG_RKT0_NS_2CT6ChoiceERKT1_SQ_: 318| 39.7k| const FieldElement& curve_a) { 319| 39.7k| const auto a_is_identity = a.is_identity(); 320| 39.7k| 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| 39.7k| auto by = b.y(); 329| 39.7k| by.conditional_assign(sub, by.negate()); 330| | 331| 39.7k| const auto Z1Z1 = a.z().square(); 332| 39.7k| const auto U2 = b.x() * Z1Z1; 333| 39.7k| const auto S2 = by * a.z() * Z1Z1; 334| 39.7k| const auto H = U2 - a.x(); 335| 39.7k| 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| 39.7k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (347:7): [True: 0, False: 39.7k] ------------------ 348| 0| return a.dbl_iso(curve_a); 349| 0| } 350| | 351| 39.7k| const auto HH = H.square(); 352| 39.7k| const auto HHH = H * HH; 353| 39.7k| const auto V = a.x() * HH; 354| 39.7k| const auto t2 = r.square(); 355| 39.7k| const auto t3 = V + V; 356| 39.7k| const auto t4 = t2 - HHH; 357| 39.7k| auto X3 = t4 - t3; 358| 39.7k| const auto t5 = V - X3; 359| 39.7k| const auto t6 = a.y() * HHH; 360| 39.7k| const auto t7 = r * t5; 361| 39.7k| auto Y3 = t7 - t6; 362| 39.7k| auto Z3 = a.z() * H; 363| | 364| | // if a is identity then return b 365| 39.7k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), by, one); 366| | 367| | // if b is identity then return a 368| 39.7k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 369| | 370| 39.7k| return ProjectivePoint(X3, Y3, Z3); 371| 39.7k|} pcurves_brainpool384r1.cpp:_ZN5Botan11to_affine_xINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveEEEDaRKNT_15ProjectivePointE: 97| 168|auto to_affine_x(const typename C::ProjectivePoint& pt) { 98| | if constexpr(curve_supports_fe_invert2) { 99| | return pt.x() * C::fe_invert2(pt.z()); 100| 168| } else { 101| 168| const auto z_inv = invert_field_element(pt.z()); 102| 168| const auto z2_inv = z_inv.square(); 103| 168| return pt.x() * z2_inv; 104| 168| } 105| 168|} pcurves_brainpool384r1.cpp:_ZN5Botan17point_add_mixed_hINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES3_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EENSt3__14pairIT_T1_EERKSI_RKT0_RKSJ_SR_: 250| 2.35k| const FieldElement& curve_a) { 251| 2.35k| const auto a_is_identity = a.is_identity(); 252| 2.35k| 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| 2.35k| const auto Z1Z1 = a.z().square(); 261| 2.35k| const auto U2 = b.x() * Z1Z1; 262| 2.35k| const auto S2 = b.y() * a.z() * Z1Z1; 263| 2.35k| const auto H = U2 - a.x(); 264| 2.35k| 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| 2.35k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (276:7): [True: 0, False: 2.35k] ------------------ 277| 0| return {a.dbl_iso(curve_a), H}; 278| 0| } 279| | 280| 2.35k| const auto HH = H.square(); 281| 2.35k| const auto HHH = H * HH; 282| 2.35k| const auto V = a.x() * HH; 283| 2.35k| const auto t2 = r.square(); 284| 2.35k| const auto t3 = V + V; 285| 2.35k| const auto t4 = t2 - HHH; 286| 2.35k| auto X3 = t4 - t3; 287| 2.35k| const auto t5 = V - X3; 288| 2.35k| const auto t6 = a.y() * HHH; 289| 2.35k| const auto t7 = r * t5; 290| 2.35k| auto Y3 = t7 - t6; 291| 2.35k| auto Z3 = a.z() * H; 292| | 293| | // if a is identity then return b 294| 2.35k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), one); 295| | 296| | // if b is identity then return a 297| 2.35k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 298| | 299| 2.35k| return {ProjectivePoint(X3, Y3, Z3), H}; 300| 2.35k|} pcurves_brainpool384r1.cpp:_ZN5Botan13dbl_n_genericINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES3_E11FieldParamsEEEEES8_EESC_EET_RKSE_RKT0_m: 499| 14.4k|inline constexpr ProjectivePoint dbl_n_generic(const ProjectivePoint& pt, const FieldElement& A, size_t n) { 500| 14.4k| auto nx = pt.x(); 501| 14.4k| auto ny = pt.y().mul2(); 502| 14.4k| auto nz = pt.z(); 503| 14.4k| auto w = nz.square().square() * A; 504| | 505| | // Conditional ok: loop iteration count is public 506| 86.6k| while(n > 0) { ------------------ | Branch (506:10): [True: 72.2k, False: 14.4k] ------------------ 507| 72.2k| const auto ny2 = ny.square(); 508| 72.2k| const auto ny4 = ny2.square(); 509| 72.2k| const auto t1 = nx.square().mul3() + w; 510| 72.2k| const auto t2 = nx * ny2; 511| 72.2k| nx = t1.square() - t2.mul2(); 512| 72.2k| nz *= ny; 513| 72.2k| ny = t1 * (t2 - nx).mul2() - ny4; 514| 72.2k| n--; 515| | // Conditional ok: loop iteration count is public 516| 72.2k| if(n > 0) { ------------------ | Branch (516:10): [True: 57.7k, False: 14.4k] ------------------ 517| 57.7k| w *= ny4; 518| 57.7k| } 519| 72.2k| } 520| 14.4k| return ProjectivePoint(nx, ny.div2(), nz); 521| 14.4k|} pcurves_brainpool384r1.cpp:_ZN5Botan18sqrt_field_elementINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveEEENS_2CT6OptionINT_12FieldElementEEERKS8_: 61| 222|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| 222| } else { 69| 222| return fe.sqrt(); 70| 222| } 71| 222|} pcurves_brainpool512r1.cpp:_ZN5Botan11dbl_genericINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES3_E11FieldParamsEEEEES8_EESC_EET_RKSE_RKT0_: 419| 1.86k|inline constexpr ProjectivePoint dbl_generic(const ProjectivePoint& pt, const FieldElement& A) { 420| | // Cost: 1M + 3S + 1A + 1*3 421| 1.86k| const auto z2 = pt.z().square(); 422| 1.86k| const auto m = pt.x().square().mul3() + A * z2.square(); 423| | 424| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 425| 1.86k| const auto y2 = pt.y().square(); 426| 1.86k| const auto s = pt.x().mul4() * y2; 427| 1.86k| const auto nx = m.square() - s.mul2(); 428| 1.86k| const auto ny = m * (s - nx) - y2.square().mul8(); 429| 1.86k| const auto nz = pt.y().mul2() * pt.z(); 430| | 431| 1.86k| return ProjectivePoint(nx, ny, nz); 432| 1.86k|} pcurves_brainpool512r1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES3_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_: 188| 1.45k|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 189| 1.45k| const auto a_is_identity = a.is_identity(); 190| 1.45k| const auto b_is_identity = b.is_identity(); 191| | 192| 1.45k| const auto Z1Z1 = a.z().square(); 193| 1.45k| const auto Z2Z2 = b.z().square(); 194| 1.45k| const auto U1 = a.x() * Z2Z2; 195| 1.45k| const auto U2 = b.x() * Z1Z1; 196| 1.45k| const auto S1 = a.y() * b.z() * Z2Z2; 197| 1.45k| const auto S2 = b.y() * a.z() * Z1Z1; 198| 1.45k| const auto H = U2 - U1; 199| 1.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| 1.45k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (211:7): [True: 0, False: 1.45k] ------------------ 212| 0| return a.dbl(); 213| 0| } 214| | 215| 1.45k| const auto HH = H.square(); 216| 1.45k| const auto HHH = H * HH; 217| 1.45k| const auto V = U1 * HH; 218| 1.45k| const auto t2 = r.square(); 219| 1.45k| const auto t3 = V + V; 220| 1.45k| const auto t4 = t2 - HHH; 221| 1.45k| auto X3 = t4 - t3; 222| 1.45k| const auto t5 = V - X3; 223| 1.45k| const auto t6 = S1 * HHH; 224| 1.45k| const auto t7 = r * t5; 225| 1.45k| auto Y3 = t7 - t6; 226| 1.45k| const auto t8 = b.z() * H; 227| 1.45k| auto Z3 = a.z() * t8; 228| | 229| | // if a is identity then return b 230| 1.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| 1.45k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 234| | 235| 1.45k| return ProjectivePoint(X3, Y3, Z3); 236| 1.45k|} pcurves_brainpool512r1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELb1EEEDaNSt3__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| 3.10k| for(const auto& pt : projective) { ------------------ | Branch (117:23): [True: 3.10k, False: 1] ------------------ 118| 3.10k| any_identity = any_identity || pt.is_identity(); 119| 3.10k| } 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| 3.10k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (146:25): [True: 3.10k, False: 1] ------------------ 147| 3.10k| c.push_back(c[i - 1] * projective[i].z()); 148| 3.10k| } 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| 3.10k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (158:29): [True: 3.10k, False: 1] ------------------ 159| 3.10k| const auto& p = projective[i]; 160| | 161| 3.10k| const auto z_inv = s_inv * c[i - 1]; 162| 3.10k| const auto z2_inv = z_inv.square(); 163| 3.10k| const auto z3_inv = z_inv * z2_inv; 164| | 165| 3.10k| s_inv = s_inv * p.z(); 166| | 167| 3.10k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 168| 3.10k| } 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_brainpool512r1.cpp:_ZN5Botan9to_affineINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveEEEDaRKNT_15ProjectivePointE: 77| 345|inline constexpr auto to_affine(const typename C::ProjectivePoint& pt) { 78| | // Not strictly required right? - default should work as long 79| | // as (0,0) is identity and invert returns 0 on 0 80| | 81| | if constexpr(curve_supports_fe_invert2) { 82| | const auto z2_inv = C::fe_invert2(pt.z()); 83| | const auto z3_inv = z2_inv.square() * pt.z(); 84| | return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv); 85| 345| } else { 86| 345| const auto z_inv = invert_field_element(pt.z()); 87| 345| const auto z2_inv = z_inv.square(); 88| 345| const auto z3_inv = z_inv * z2_inv; 89| 345| return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv); 90| 345| } 91| 345|} pcurves_brainpool512r1.cpp:_ZN5Botan20invert_field_elementINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveEEEDaRKNT_12FieldElementE: 36| 558|inline constexpr auto invert_field_element(const typename C::FieldElement& fe) { 37| | if constexpr(curve_supports_fe_invert2) { 38| | return C::fe_invert2(fe) * fe; 39| 558| } else { 40| 558| return fe.invert(); 41| 558| } 42| 558|} pcurves_brainpool512r1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELb1EEEDaNSt3__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_brainpool512r1.cpp:_ZN5Botan22point_add_or_sub_mixedINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES3_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EET_RKSG_RKT0_NS_2CT6ChoiceERKT1_SQ_: 318| 57.6k| const FieldElement& curve_a) { 319| 57.6k| const auto a_is_identity = a.is_identity(); 320| 57.6k| 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| 57.6k| auto by = b.y(); 329| 57.6k| by.conditional_assign(sub, by.negate()); 330| | 331| 57.6k| const auto Z1Z1 = a.z().square(); 332| 57.6k| const auto U2 = b.x() * Z1Z1; 333| 57.6k| const auto S2 = by * a.z() * Z1Z1; 334| 57.6k| const auto H = U2 - a.x(); 335| 57.6k| 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| 57.6k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (347:7): [True: 0, False: 57.6k] ------------------ 348| 0| return a.dbl_iso(curve_a); 349| 0| } 350| | 351| 57.6k| const auto HH = H.square(); 352| 57.6k| const auto HHH = H * HH; 353| 57.6k| const auto V = a.x() * HH; 354| 57.6k| const auto t2 = r.square(); 355| 57.6k| const auto t3 = V + V; 356| 57.6k| const auto t4 = t2 - HHH; 357| 57.6k| auto X3 = t4 - t3; 358| 57.6k| const auto t5 = V - X3; 359| 57.6k| const auto t6 = a.y() * HHH; 360| 57.6k| const auto t7 = r * t5; 361| 57.6k| auto Y3 = t7 - t6; 362| 57.6k| auto Z3 = a.z() * H; 363| | 364| | // if a is identity then return b 365| 57.6k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), by, one); 366| | 367| | // if b is identity then return a 368| 57.6k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 369| | 370| 57.6k| return ProjectivePoint(X3, Y3, Z3); 371| 57.6k|} pcurves_brainpool512r1.cpp:_ZN5Botan11to_affine_xINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveEEEDaRKNT_15ProjectivePointE: 97| 213|auto to_affine_x(const typename C::ProjectivePoint& pt) { 98| | if constexpr(curve_supports_fe_invert2) { 99| | return pt.x() * C::fe_invert2(pt.z()); 100| 213| } else { 101| 213| const auto z_inv = invert_field_element(pt.z()); 102| 213| const auto z2_inv = z_inv.square(); 103| 213| return pt.x() * z2_inv; 104| 213| } 105| 213|} pcurves_brainpool512r1.cpp:_ZN5Botan17point_add_mixed_hINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES3_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EENSt3__14pairIT_T1_EERKSI_RKT0_RKSJ_SR_: 250| 2.98k| const FieldElement& curve_a) { 251| 2.98k| const auto a_is_identity = a.is_identity(); 252| 2.98k| 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| 2.98k| const auto Z1Z1 = a.z().square(); 261| 2.98k| const auto U2 = b.x() * Z1Z1; 262| 2.98k| const auto S2 = b.y() * a.z() * Z1Z1; 263| 2.98k| const auto H = U2 - a.x(); 264| 2.98k| 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| 2.98k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (276:7): [True: 0, False: 2.98k] ------------------ 277| 0| return {a.dbl_iso(curve_a), H}; 278| 0| } 279| | 280| 2.98k| const auto HH = H.square(); 281| 2.98k| const auto HHH = H * HH; 282| 2.98k| const auto V = a.x() * HH; 283| 2.98k| const auto t2 = r.square(); 284| 2.98k| const auto t3 = V + V; 285| 2.98k| const auto t4 = t2 - HHH; 286| 2.98k| auto X3 = t4 - t3; 287| 2.98k| const auto t5 = V - X3; 288| 2.98k| const auto t6 = a.y() * HHH; 289| 2.98k| const auto t7 = r * t5; 290| 2.98k| auto Y3 = t7 - t6; 291| 2.98k| auto Z3 = a.z() * H; 292| | 293| | // if a is identity then return b 294| 2.98k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), one); 295| | 296| | // if b is identity then return a 297| 2.98k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 298| | 299| 2.98k| return {ProjectivePoint(X3, Y3, Z3), H}; 300| 2.98k|} pcurves_brainpool512r1.cpp:_ZN5Botan13dbl_n_genericINS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES3_E11FieldParamsEEEEES8_EESC_EET_RKSE_RKT0_m: 499| 24.4k|inline constexpr ProjectivePoint dbl_n_generic(const ProjectivePoint& pt, const FieldElement& A, size_t n) { 500| 24.4k| auto nx = pt.x(); 501| 24.4k| auto ny = pt.y().mul2(); 502| 24.4k| auto nz = pt.z(); 503| 24.4k| auto w = nz.square().square() * A; 504| | 505| | // Conditional ok: loop iteration count is public 506| 146k| while(n > 0) { ------------------ | Branch (506:10): [True: 122k, False: 24.4k] ------------------ 507| 122k| const auto ny2 = ny.square(); 508| 122k| const auto ny4 = ny2.square(); 509| 122k| const auto t1 = nx.square().mul3() + w; 510| 122k| const auto t2 = nx * ny2; 511| 122k| nx = t1.square() - t2.mul2(); 512| 122k| nz *= ny; 513| 122k| ny = t1 * (t2 - nx).mul2() - ny4; 514| 122k| n--; 515| | // Conditional ok: loop iteration count is public 516| 122k| if(n > 0) { ------------------ | Branch (516:10): [True: 97.9k, False: 24.4k] ------------------ 517| 97.9k| w *= ny4; 518| 97.9k| } 519| 122k| } 520| 24.4k| return ProjectivePoint(nx, ny.div2(), nz); 521| 24.4k|} pcurves_brainpool512r1.cpp:_ZN5Botan18sqrt_field_elementINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveEEENS_2CT6OptionINT_12FieldElementEEERKS8_: 61| 259|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| 259| } else { 69| 259| return fe.sqrt(); 70| 259| } 71| 259|} pcurves_secp256r1.cpp:_ZN5Botan13dbl_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS4_9secp256r16ParamsES5_E11FieldParamsEEEEES8_EEEET_RKSE_: 384| 1.16k|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.16k| const auto z2 = pt.z().square(); 390| 1.16k| 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.16k| const auto y2 = pt.y().square(); 394| 1.16k| const auto s = pt.x().mul4() * y2; 395| 1.16k| const auto nx = m.square() - s.mul2(); 396| 1.16k| const auto ny = m * (s - nx) - y2.square().mul8(); 397| 1.16k| const auto nz = pt.y().mul2() * pt.z(); 398| | 399| 1.16k| return ProjectivePoint(nx, ny, nz); 400| 1.16k|} pcurves_secp256r1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS4_9secp256r16ParamsES5_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_secp256r1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp256r15CurveELb1EEEDaNSt3__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_secp256r1.cpp:_ZN5Botan9to_affineINS_6PCurve12_GLOBAL__N_19secp256r15CurveEEEDaRKNT_15ProjectivePointE: 77| 6.75k|inline constexpr auto to_affine(const typename C::ProjectivePoint& pt) { 78| | // Not strictly required right? - default should work as long 79| | // as (0,0) is identity and invert returns 0 on 0 80| | 81| 6.75k| if constexpr(curve_supports_fe_invert2) { 82| 6.75k| const auto z2_inv = C::fe_invert2(pt.z()); 83| 6.75k| const auto z3_inv = z2_inv.square() * pt.z(); 84| 6.75k| return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv); 85| | } else { 86| | const auto z_inv = invert_field_element(pt.z()); 87| | const auto z2_inv = z_inv.square(); 88| | const auto z3_inv = z_inv * z2_inv; 89| | return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv); 90| | } 91| 6.75k|} pcurves_secp256r1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp256r15CurveELb1EEEDaNSt3__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_secp256r1.cpp:_ZN5Botan22point_add_or_sub_mixedINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS4_9secp256r16ParamsES5_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EET_RKSG_RKT0_NS_2CT6ChoiceERKT1_SQ_: 318| 305k| const FieldElement& curve_a) { 319| 305k| const auto a_is_identity = a.is_identity(); 320| 305k| 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| 305k| auto by = b.y(); 329| 305k| by.conditional_assign(sub, by.negate()); 330| | 331| 305k| const auto Z1Z1 = a.z().square(); 332| 305k| const auto U2 = b.x() * Z1Z1; 333| 305k| const auto S2 = by * a.z() * Z1Z1; 334| 305k| const auto H = U2 - a.x(); 335| 305k| 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| 305k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (347:7): [True: 0, False: 305k] ------------------ 348| 0| return a.dbl_iso(curve_a); 349| 0| } 350| | 351| 305k| const auto HH = H.square(); 352| 305k| const auto HHH = H * HH; 353| 305k| const auto V = a.x() * HH; 354| 305k| const auto t2 = r.square(); 355| 305k| const auto t3 = V + V; 356| 305k| const auto t4 = t2 - HHH; 357| 305k| auto X3 = t4 - t3; 358| 305k| const auto t5 = V - X3; 359| 305k| const auto t6 = a.y() * HHH; 360| 305k| const auto t7 = r * t5; 361| 305k| auto Y3 = t7 - t6; 362| 305k| auto Z3 = a.z() * H; 363| | 364| | // if a is identity then return b 365| 305k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), by, one); 366| | 367| | // if b is identity then return a 368| 305k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 369| | 370| 305k| return ProjectivePoint(X3, Y3, Z3); 371| 305k|} pcurves_secp256r1.cpp:_ZN5Botan11to_affine_xINS_6PCurve12_GLOBAL__N_19secp256r15CurveEEEDaRKNT_15ProjectivePointE: 97| 327|auto to_affine_x(const typename C::ProjectivePoint& pt) { 98| 327| if constexpr(curve_supports_fe_invert2) { 99| 327| return pt.x() * C::fe_invert2(pt.z()); 100| | } else { 101| | const auto z_inv = invert_field_element(pt.z()); 102| | const auto z2_inv = z_inv.square(); 103| | return pt.x() * z2_inv; 104| | } 105| 327|} pcurves_secp256r1.cpp:_ZN5Botan17point_add_mixed_hINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS4_9secp256r16ParamsES5_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EENSt3__14pairIT_T1_EERKSI_RKT0_RKSJ_SR_: 250| 4.57k| const FieldElement& curve_a) { 251| 4.57k| const auto a_is_identity = a.is_identity(); 252| 4.57k| 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| 4.57k| const auto Z1Z1 = a.z().square(); 261| 4.57k| const auto U2 = b.x() * Z1Z1; 262| 4.57k| const auto S2 = b.y() * a.z() * Z1Z1; 263| 4.57k| const auto H = U2 - a.x(); 264| 4.57k| 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| 4.57k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (276:7): [True: 0, False: 4.57k] ------------------ 277| 0| return {a.dbl_iso(curve_a), H}; 278| 0| } 279| | 280| 4.57k| const auto HH = H.square(); 281| 4.57k| const auto HHH = H * HH; 282| 4.57k| const auto V = a.x() * HH; 283| 4.57k| const auto t2 = r.square(); 284| 4.57k| const auto t3 = V + V; 285| 4.57k| const auto t4 = t2 - HHH; 286| 4.57k| auto X3 = t4 - t3; 287| 4.57k| const auto t5 = V - X3; 288| 4.57k| const auto t6 = a.y() * HHH; 289| 4.57k| const auto t7 = r * t5; 290| 4.57k| auto Y3 = t7 - t6; 291| 4.57k| auto Z3 = a.z() * H; 292| | 293| | // if a is identity then return b 294| 4.57k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), one); 295| | 296| | // if b is identity then return a 297| 4.57k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 298| | 299| 4.57k| return {ProjectivePoint(X3, Y3, Z3), H}; 300| 4.57k|} pcurves_secp256r1.cpp:_ZN5Botan13dbl_n_genericINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS4_9secp256r16ParamsES5_E11FieldParamsEEEEES8_EESC_EET_RKSE_RKT0_m: 499| 18.6k|inline constexpr ProjectivePoint dbl_n_generic(const ProjectivePoint& pt, const FieldElement& A, size_t n) { 500| 18.6k| auto nx = pt.x(); 501| 18.6k| auto ny = pt.y().mul2(); 502| 18.6k| auto nz = pt.z(); 503| 18.6k| auto w = nz.square().square() * A; 504| | 505| | // Conditional ok: loop iteration count is public 506| 111k| while(n > 0) { ------------------ | Branch (506:10): [True: 93.1k, False: 18.6k] ------------------ 507| 93.1k| const auto ny2 = ny.square(); 508| 93.1k| const auto ny4 = ny2.square(); 509| 93.1k| const auto t1 = nx.square().mul3() + w; 510| 93.1k| const auto t2 = nx * ny2; 511| 93.1k| nx = t1.square() - t2.mul2(); 512| 93.1k| nz *= ny; 513| 93.1k| ny = t1 * (t2 - nx).mul2() - ny4; 514| 93.1k| n--; 515| | // Conditional ok: loop iteration count is public 516| 93.1k| if(n > 0) { ------------------ | Branch (516:10): [True: 74.5k, False: 18.6k] ------------------ 517| 74.5k| w *= ny4; 518| 74.5k| } 519| 93.1k| } 520| 18.6k| return ProjectivePoint(nx, ny.div2(), nz); 521| 18.6k|} pcurves_secp256r1.cpp:_ZN5Botan18sqrt_field_elementINS_6PCurve12_GLOBAL__N_19secp256r15CurveEEENS_2CT6OptionINT_12FieldElementEEERKS8_: 61| 329|inline constexpr CT::Option sqrt_field_element(const typename C::FieldElement& fe) { 62| 329| if constexpr(curve_supports_fe_sqrt) { 63| 329| auto z = C::fe_sqrt(fe); 64| | // Zero out the return value if it would otherwise be incorrect 65| 329| const CT::Choice correct = (z.square() == fe); 66| 329| z.conditional_assign(!correct, C::FieldElement::zero()); 67| 329| return CT::Option(z, correct); 68| | } else { 69| | return fe.sqrt(); 70| | } 71| 329|} pcurves_secp384r1.cpp:_ZN5Botan13dbl_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEES8_EEEET_RKSE_: 384| 1.45k|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.45k| const auto z2 = pt.z().square(); 390| 1.45k| 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.45k| const auto y2 = pt.y().square(); 394| 1.45k| const auto s = pt.x().mul4() * y2; 395| 1.45k| const auto nx = m.square() - s.mul2(); 396| 1.45k| const auto ny = m * (s - nx) - y2.square().mul8(); 397| 1.45k| const auto nz = pt.y().mul2() * pt.z(); 398| | 399| 1.45k| return ProjectivePoint(nx, ny, nz); 400| 1.45k|} pcurves_secp384r1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_: 188| 1.09k|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 189| 1.09k| const auto a_is_identity = a.is_identity(); 190| 1.09k| const auto b_is_identity = b.is_identity(); 191| | 192| 1.09k| const auto Z1Z1 = a.z().square(); 193| 1.09k| const auto Z2Z2 = b.z().square(); 194| 1.09k| const auto U1 = a.x() * Z2Z2; 195| 1.09k| const auto U2 = b.x() * Z1Z1; 196| 1.09k| const auto S1 = a.y() * b.z() * Z2Z2; 197| 1.09k| const auto S2 = b.y() * a.z() * Z1Z1; 198| 1.09k| const auto H = U2 - U1; 199| 1.09k| 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| 1.09k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (211:7): [True: 0, False: 1.09k] ------------------ 212| 0| return a.dbl(); 213| 0| } 214| | 215| 1.09k| const auto HH = H.square(); 216| 1.09k| const auto HHH = H * HH; 217| 1.09k| const auto V = U1 * HH; 218| 1.09k| const auto t2 = r.square(); 219| 1.09k| const auto t3 = V + V; 220| 1.09k| const auto t4 = t2 - HHH; 221| 1.09k| auto X3 = t4 - t3; 222| 1.09k| const auto t5 = V - X3; 223| 1.09k| const auto t6 = S1 * HHH; 224| 1.09k| const auto t7 = r * t5; 225| 1.09k| auto Y3 = t7 - t6; 226| 1.09k| const auto t8 = b.z() * H; 227| 1.09k| auto Z3 = a.z() * t8; 228| | 229| | // if a is identity then return b 230| 1.09k| 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| 1.09k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 234| | 235| 1.09k| return ProjectivePoint(X3, Y3, Z3); 236| 1.09k|} pcurves_secp384r1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp384r15CurveELb1EEEDaNSt3__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| 2.33k| for(const auto& pt : projective) { ------------------ | Branch (117:23): [True: 2.33k, False: 1] ------------------ 118| 2.33k| any_identity = any_identity || pt.is_identity(); 119| 2.33k| } 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| 2.33k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (146:25): [True: 2.33k, False: 1] ------------------ 147| 2.33k| c.push_back(c[i - 1] * projective[i].z()); 148| 2.33k| } 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| 2.33k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (158:29): [True: 2.33k, False: 1] ------------------ 159| 2.33k| const auto& p = projective[i]; 160| | 161| 2.33k| const auto z_inv = s_inv * c[i - 1]; 162| 2.33k| const auto z2_inv = z_inv.square(); 163| 2.33k| const auto z3_inv = z_inv * z2_inv; 164| | 165| 2.33k| s_inv = s_inv * p.z(); 166| | 167| 2.33k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 168| 2.33k| } 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_secp384r1.cpp:_ZN5Botan9to_affineINS_6PCurve12_GLOBAL__N_19secp384r15CurveEEEDaRKNT_15ProjectivePointE: 77| 374|inline constexpr auto to_affine(const typename C::ProjectivePoint& pt) { 78| | // Not strictly required right? - default should work as long 79| | // as (0,0) is identity and invert returns 0 on 0 80| | 81| 374| if constexpr(curve_supports_fe_invert2) { 82| 374| const auto z2_inv = C::fe_invert2(pt.z()); 83| 374| const auto z3_inv = z2_inv.square() * pt.z(); 84| 374| return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv); 85| | } else { 86| | const auto z_inv = invert_field_element(pt.z()); 87| | const auto z2_inv = z_inv.square(); 88| | const auto z3_inv = z_inv * z2_inv; 89| | return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv); 90| | } 91| 374|} pcurves_secp384r1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp384r15CurveELb1EEEDaNSt3__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:_ZN5Botan22point_add_or_sub_mixedINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EET_RKSG_RKT0_NS_2CT6ChoiceERKT1_SQ_: 318| 44.9k| const FieldElement& curve_a) { 319| 44.9k| const auto a_is_identity = a.is_identity(); 320| 44.9k| 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| 44.9k| auto by = b.y(); 329| 44.9k| by.conditional_assign(sub, by.negate()); 330| | 331| 44.9k| const auto Z1Z1 = a.z().square(); 332| 44.9k| const auto U2 = b.x() * Z1Z1; 333| 44.9k| const auto S2 = by * a.z() * Z1Z1; 334| 44.9k| const auto H = U2 - a.x(); 335| 44.9k| 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| 44.9k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (347:7): [True: 0, False: 44.9k] ------------------ 348| 0| return a.dbl_iso(curve_a); 349| 0| } 350| | 351| 44.9k| const auto HH = H.square(); 352| 44.9k| const auto HHH = H * HH; 353| 44.9k| const auto V = a.x() * HH; 354| 44.9k| const auto t2 = r.square(); 355| 44.9k| const auto t3 = V + V; 356| 44.9k| const auto t4 = t2 - HHH; 357| 44.9k| auto X3 = t4 - t3; 358| 44.9k| const auto t5 = V - X3; 359| 44.9k| const auto t6 = a.y() * HHH; 360| 44.9k| const auto t7 = r * t5; 361| 44.9k| auto Y3 = t7 - t6; 362| 44.9k| auto Z3 = a.z() * H; 363| | 364| | // if a is identity then return b 365| 44.9k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), by, one); 366| | 367| | // if b is identity then return a 368| 44.9k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 369| | 370| 44.9k| return ProjectivePoint(X3, Y3, Z3); 371| 44.9k|} pcurves_secp384r1.cpp:_ZN5Botan11to_affine_xINS_6PCurve12_GLOBAL__N_19secp384r15CurveEEEDaRKNT_15ProjectivePointE: 97| 210|auto to_affine_x(const typename C::ProjectivePoint& pt) { 98| 210| if constexpr(curve_supports_fe_invert2) { 99| 210| return pt.x() * C::fe_invert2(pt.z()); 100| | } else { 101| | const auto z_inv = invert_field_element(pt.z()); 102| | const auto z2_inv = z_inv.square(); 103| | return pt.x() * z2_inv; 104| | } 105| 210|} pcurves_secp384r1.cpp:_ZN5Botan17point_add_mixed_hINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EENSt3__14pairIT_T1_EERKSI_RKT0_RKSJ_SR_: 250| 2.94k| const FieldElement& curve_a) { 251| 2.94k| const auto a_is_identity = a.is_identity(); 252| 2.94k| 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| 2.94k| const auto Z1Z1 = a.z().square(); 261| 2.94k| const auto U2 = b.x() * Z1Z1; 262| 2.94k| const auto S2 = b.y() * a.z() * Z1Z1; 263| 2.94k| const auto H = U2 - a.x(); 264| 2.94k| 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| 2.94k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (276:7): [True: 0, False: 2.94k] ------------------ 277| 0| return {a.dbl_iso(curve_a), H}; 278| 0| } 279| | 280| 2.94k| const auto HH = H.square(); 281| 2.94k| const auto HHH = H * HH; 282| 2.94k| const auto V = a.x() * HH; 283| 2.94k| const auto t2 = r.square(); 284| 2.94k| const auto t3 = V + V; 285| 2.94k| const auto t4 = t2 - HHH; 286| 2.94k| auto X3 = t4 - t3; 287| 2.94k| const auto t5 = V - X3; 288| 2.94k| const auto t6 = a.y() * HHH; 289| 2.94k| const auto t7 = r * t5; 290| 2.94k| auto Y3 = t7 - t6; 291| 2.94k| auto Z3 = a.z() * H; 292| | 293| | // if a is identity then return b 294| 2.94k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), one); 295| | 296| | // if b is identity then return a 297| 2.94k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 298| | 299| 2.94k| return {ProjectivePoint(X3, Y3, Z3), H}; 300| 2.94k|} pcurves_secp384r1.cpp:_ZN5Botan13dbl_n_genericINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEES8_EESC_EET_RKSE_RKT0_m: 499| 18.0k|inline constexpr ProjectivePoint dbl_n_generic(const ProjectivePoint& pt, const FieldElement& A, size_t n) { 500| 18.0k| auto nx = pt.x(); 501| 18.0k| auto ny = pt.y().mul2(); 502| 18.0k| auto nz = pt.z(); 503| 18.0k| auto w = nz.square().square() * A; 504| | 505| | // Conditional ok: loop iteration count is public 506| 108k| while(n > 0) { ------------------ | Branch (506:10): [True: 90.3k, False: 18.0k] ------------------ 507| 90.3k| const auto ny2 = ny.square(); 508| 90.3k| const auto ny4 = ny2.square(); 509| 90.3k| const auto t1 = nx.square().mul3() + w; 510| 90.3k| const auto t2 = nx * ny2; 511| 90.3k| nx = t1.square() - t2.mul2(); 512| 90.3k| nz *= ny; 513| 90.3k| ny = t1 * (t2 - nx).mul2() - ny4; 514| 90.3k| n--; 515| | // Conditional ok: loop iteration count is public 516| 90.3k| if(n > 0) { ------------------ | Branch (516:10): [True: 72.2k, False: 18.0k] ------------------ 517| 72.2k| w *= ny4; 518| 72.2k| } 519| 90.3k| } 520| 18.0k| return ProjectivePoint(nx, ny.div2(), nz); 521| 18.0k|} pcurves_secp384r1.cpp:_ZN5Botan18sqrt_field_elementINS_6PCurve12_GLOBAL__N_19secp384r15CurveEEENS_2CT6OptionINT_12FieldElementEEERKS8_: 61| 213|inline constexpr CT::Option sqrt_field_element(const typename C::FieldElement& fe) { 62| 213| if constexpr(curve_supports_fe_sqrt) { 63| 213| auto z = C::fe_sqrt(fe); 64| | // Zero out the return value if it would otherwise be incorrect 65| 213| const CT::Choice correct = (z.square() == fe); 66| 213| z.conditional_assign(!correct, C::FieldElement::zero()); 67| 213| return CT::Option(z, correct); 68| | } else { 69| | return fe.sqrt(); 70| | } 71| 213|} pcurves_secp521r1.cpp:_ZN5Botan13dbl_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EEEET_RKSE_: 384| 1.84k|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.84k| const auto z2 = pt.z().square(); 390| 1.84k| 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.84k| const auto y2 = pt.y().square(); 394| 1.84k| const auto s = pt.x().mul4() * y2; 395| 1.84k| const auto nx = m.square() - s.mul2(); 396| 1.84k| const auto ny = m * (s - nx) - y2.square().mul8(); 397| 1.84k| const auto nz = pt.y().mul2() * pt.z(); 398| | 399| 1.84k| return ProjectivePoint(nx, ny, nz); 400| 1.84k|} pcurves_secp521r1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_: 188| 1.45k|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 189| 1.45k| const auto a_is_identity = a.is_identity(); 190| 1.45k| const auto b_is_identity = b.is_identity(); 191| | 192| 1.45k| const auto Z1Z1 = a.z().square(); 193| 1.45k| const auto Z2Z2 = b.z().square(); 194| 1.45k| const auto U1 = a.x() * Z2Z2; 195| 1.45k| const auto U2 = b.x() * Z1Z1; 196| 1.45k| const auto S1 = a.y() * b.z() * Z2Z2; 197| 1.45k| const auto S2 = b.y() * a.z() * Z1Z1; 198| 1.45k| const auto H = U2 - U1; 199| 1.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| 1.45k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (211:7): [True: 0, False: 1.45k] ------------------ 212| 0| return a.dbl(); 213| 0| } 214| | 215| 1.45k| const auto HH = H.square(); 216| 1.45k| const auto HHH = H * HH; 217| 1.45k| const auto V = U1 * HH; 218| 1.45k| const auto t2 = r.square(); 219| 1.45k| const auto t3 = V + V; 220| 1.45k| const auto t4 = t2 - HHH; 221| 1.45k| auto X3 = t4 - t3; 222| 1.45k| const auto t5 = V - X3; 223| 1.45k| const auto t6 = S1 * HHH; 224| 1.45k| const auto t7 = r * t5; 225| 1.45k| auto Y3 = t7 - t6; 226| 1.45k| const auto t8 = b.z() * H; 227| 1.45k| auto Z3 = a.z() * t8; 228| | 229| | // if a is identity then return b 230| 1.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| 1.45k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 234| | 235| 1.45k| return ProjectivePoint(X3, Y3, Z3); 236| 1.45k|} pcurves_secp521r1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp521r15CurveELb1EEEDaNSt3__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| 3.10k| for(const auto& pt : projective) { ------------------ | Branch (117:23): [True: 3.10k, False: 1] ------------------ 118| 3.10k| any_identity = any_identity || pt.is_identity(); 119| 3.10k| } 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| 3.10k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (146:25): [True: 3.10k, False: 1] ------------------ 147| 3.10k| c.push_back(c[i - 1] * projective[i].z()); 148| 3.10k| } 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| 3.10k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (158:29): [True: 3.10k, False: 1] ------------------ 159| 3.10k| const auto& p = projective[i]; 160| | 161| 3.10k| const auto z_inv = s_inv * c[i - 1]; 162| 3.10k| const auto z2_inv = z_inv.square(); 163| 3.10k| const auto z3_inv = z_inv * z2_inv; 164| | 165| 3.10k| s_inv = s_inv * p.z(); 166| | 167| 3.10k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 168| 3.10k| } 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_secp521r1.cpp:_ZN5Botan9to_affineINS_6PCurve12_GLOBAL__N_19secp521r15CurveEEEDaRKNT_15ProjectivePointE: 77| 323|inline constexpr auto to_affine(const typename C::ProjectivePoint& pt) { 78| | // Not strictly required right? - default should work as long 79| | // as (0,0) is identity and invert returns 0 on 0 80| | 81| 323| if constexpr(curve_supports_fe_invert2) { 82| 323| const auto z2_inv = C::fe_invert2(pt.z()); 83| 323| const auto z3_inv = z2_inv.square() * pt.z(); 84| 323| return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv); 85| | } else { 86| | const auto z_inv = invert_field_element(pt.z()); 87| | const auto z2_inv = z_inv.square(); 88| | const auto z3_inv = z_inv * z2_inv; 89| | return typename C::AffinePoint(pt.x() * z2_inv, pt.y() * z3_inv); 90| | } 91| 323|} pcurves_secp521r1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp521r15CurveELb1EEEDaNSt3__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_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| 53.6k| const FieldElement& curve_a) { 319| 53.6k| const auto a_is_identity = a.is_identity(); 320| 53.6k| 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| 53.6k| auto by = b.y(); 329| 53.6k| by.conditional_assign(sub, by.negate()); 330| | 331| 53.6k| const auto Z1Z1 = a.z().square(); 332| 53.6k| const auto U2 = b.x() * Z1Z1; 333| 53.6k| const auto S2 = by * a.z() * Z1Z1; 334| 53.6k| const auto H = U2 - a.x(); 335| 53.6k| 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| 53.6k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (347:7): [True: 0, False: 53.6k] ------------------ 348| 0| return a.dbl_iso(curve_a); 349| 0| } 350| | 351| 53.6k| const auto HH = H.square(); 352| 53.6k| const auto HHH = H * HH; 353| 53.6k| const auto V = a.x() * HH; 354| 53.6k| const auto t2 = r.square(); 355| 53.6k| const auto t3 = V + V; 356| 53.6k| const auto t4 = t2 - HHH; 357| 53.6k| auto X3 = t4 - t3; 358| 53.6k| const auto t5 = V - X3; 359| 53.6k| const auto t6 = a.y() * HHH; 360| 53.6k| const auto t7 = r * t5; 361| 53.6k| auto Y3 = t7 - t6; 362| 53.6k| auto Z3 = a.z() * H; 363| | 364| | // if a is identity then return b 365| 53.6k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), by, one); 366| | 367| | // if b is identity then return a 368| 53.6k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 369| | 370| 53.6k| return ProjectivePoint(X3, Y3, Z3); 371| 53.6k|} pcurves_secp521r1.cpp:_ZN5Botan11to_affine_xINS_6PCurve12_GLOBAL__N_19secp521r15CurveEEEDaRKNT_15ProjectivePointE: 97| 197|auto to_affine_x(const typename C::ProjectivePoint& pt) { 98| 197| if constexpr(curve_supports_fe_invert2) { 99| 197| return pt.x() * C::fe_invert2(pt.z()); 100| | } else { 101| | const auto z_inv = invert_field_element(pt.z()); 102| | const auto z2_inv = z_inv.square(); 103| | return pt.x() * z2_inv; 104| | } 105| 197|} pcurves_secp521r1.cpp:_ZN5Botan17point_add_mixed_hINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EENS_16AffineCurvePointISC_EESC_EENSt3__14pairIT_T1_EERKSI_RKT0_RKSJ_SR_: 250| 2.75k| const FieldElement& curve_a) { 251| 2.75k| const auto a_is_identity = a.is_identity(); 252| 2.75k| 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| 2.75k| const auto Z1Z1 = a.z().square(); 261| 2.75k| const auto U2 = b.x() * Z1Z1; 262| 2.75k| const auto S2 = b.y() * a.z() * Z1Z1; 263| 2.75k| const auto H = U2 - a.x(); 264| 2.75k| 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| 2.75k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (276:7): [True: 0, False: 2.75k] ------------------ 277| 0| return {a.dbl_iso(curve_a), H}; 278| 0| } 279| | 280| 2.75k| const auto HH = H.square(); 281| 2.75k| const auto HHH = H * HH; 282| 2.75k| const auto V = a.x() * HH; 283| 2.75k| const auto t2 = r.square(); 284| 2.75k| const auto t3 = V + V; 285| 2.75k| const auto t4 = t2 - HHH; 286| 2.75k| auto X3 = t4 - t3; 287| 2.75k| const auto t5 = V - X3; 288| 2.75k| const auto t6 = a.y() * HHH; 289| 2.75k| const auto t7 = r * t5; 290| 2.75k| auto Y3 = t7 - t6; 291| 2.75k| auto Z3 = a.z() * H; 292| | 293| | // if a is identity then return b 294| 2.75k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), one); 295| | 296| | // if b is identity then return a 297| 2.75k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 298| | 299| 2.75k| return {ProjectivePoint(X3, Y3, Z3), H}; 300| 2.75k|} pcurves_secp521r1.cpp:_ZN5Botan13dbl_n_genericINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EESC_EET_RKSE_RKT0_m: 499| 22.6k|inline constexpr ProjectivePoint dbl_n_generic(const ProjectivePoint& pt, const FieldElement& A, size_t n) { 500| 22.6k| auto nx = pt.x(); 501| 22.6k| auto ny = pt.y().mul2(); 502| 22.6k| auto nz = pt.z(); 503| 22.6k| auto w = nz.square().square() * A; 504| | 505| | // Conditional ok: loop iteration count is public 506| 135k| while(n > 0) { ------------------ | Branch (506:10): [True: 113k, False: 22.6k] ------------------ 507| 113k| const auto ny2 = ny.square(); 508| 113k| const auto ny4 = ny2.square(); 509| 113k| const auto t1 = nx.square().mul3() + w; 510| 113k| const auto t2 = nx * ny2; 511| 113k| nx = t1.square() - t2.mul2(); 512| 113k| nz *= ny; 513| 113k| ny = t1 * (t2 - nx).mul2() - ny4; 514| 113k| n--; 515| | // Conditional ok: loop iteration count is public 516| 113k| if(n > 0) { ------------------ | Branch (516:10): [True: 90.6k, False: 22.6k] ------------------ 517| 90.6k| w *= ny4; 518| 90.6k| } 519| 113k| } 520| 22.6k| return ProjectivePoint(nx, ny.div2(), nz); 521| 22.6k|} pcurves_secp521r1.cpp:_ZN5Botan18sqrt_field_elementINS_6PCurve12_GLOBAL__N_19secp521r15CurveEEENS_2CT6OptionINT_12FieldElementEEERKS8_: 61| 203|inline constexpr CT::Option sqrt_field_element(const typename C::FieldElement& fe) { 62| 203| if constexpr(curve_supports_fe_sqrt) { 63| 203| auto z = C::fe_sqrt(fe); 64| | // Zero out the return value if it would otherwise be incorrect 65| 203| const CT::Choice correct = (z.square() == fe); 66| 203| z.conditional_assign(!correct, C::FieldElement::zero()); 67| 203| return CT::Option(z, correct); 68| | } else { 69| | return fe.sqrt(); 70| | } 71| 203|} pcurves_brainpool256r1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1630| 1| m_table(basemul_booth_setup(p, BlindedScalar::Bits + 1)) {} pcurves_brainpool256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E11from_affineERKNS_16AffineCurvePointISB_EE: 1027| 1.14k| 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.14k| const auto x = pt.x(); 1038| 1.14k| auto y = pt.y(); 1039| 1.14k| auto z = FieldElement::one(); 1040| | 1041| 1.14k| FieldElement::conditional_swap(pt.is_identity(), y, z); 1042| | 1043| 1.14k| return ProjectiveCurvePoint(x, y, z); 1044| 1.14k| } pcurves_brainpool256r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEEE1xEv: 982| 1.28M| constexpr const FieldElement& x() const { return m_x; } pcurves_brainpool256r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEEE1yEv: 987| 1.23M| constexpr const FieldElement& y() const { return m_y; } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE3oneEv: 202| 51.6k| static constexpr Self one() { return Self(Rep::one()); } pcurves_brainpool256r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES0_E11FieldParamsEE3oneEv: 101| 51.6k| constexpr static std::array one() { return R1; } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEEC2ENSt3__15arrayImLm4EEE: 908| 2.43M| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 412| 1.14k| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 413| 1.14k| const W mask = cond.into_bitmask(); 414| | 415| 5.71k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (415:28): [True: 4.56k, False: 1.14k] ------------------ 416| 4.56k| const auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 417| 4.56k| const auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 418| 4.56k| x.m_val[i] = nx; 419| 4.56k| y.m_val[i] = ny; 420| 4.56k| } 421| 1.14k| } pcurves_brainpool256r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEEE11is_identityEv: 939| 52.4k| constexpr CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE7is_zeroEv: 227| 252k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_brainpool256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_EC2ERKSB_SE_SE_: 1067| 69.3k| m_x(x), m_y(y), m_z(z) {} pcurves_brainpool256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E3dblEv: 1181| 1.13k| constexpr Self dbl() const { 1182| | if constexpr(Self::A_is_minus_3) { 1183| | return dbl_a_minus_3(*this); 1184| | } else if constexpr(Self::A_is_zero) { 1185| | return dbl_a_zero(*this); 1186| 1.13k| } else { 1187| 1.13k| return dbl_generic(*this, A); 1188| 1.13k| } 1189| 1.13k| } pcurves_brainpool256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E1zEv: 1224| 271k| constexpr const FieldElement& z() const { return m_z; } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE6squareEv: 428| 548k| constexpr BOTAN_FORCE_INLINE Self square() const { 429| 548k| std::array z; // NOLINT(*-member-init) 430| 548k| comba_sqr(z.data(), this->data()); 431| 548k| return Self(Rep::redc(z)); 432| 548k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE4dataEv: 898| 2.61M| constexpr const W* data() const { return m_val.data(); } pcurves_brainpool256r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES0_E11FieldParamsEE4redcERKNSt3__15arrayImLm8EEE: 106| 1.72M| constexpr static std::array redc(const std::array& z) { 107| | if constexpr(P_dash == 1) { 108| | return monty_redc_pdash1(z, P); 109| 1.72M| } else { 110| 1.72M| return monty_redc(z, P, P_dash); 111| 1.72M| } 112| 1.72M| } pcurves_brainpool256r1.cpp:_ZN5BotanplERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEEESC_: 267| 223k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 268| 223k| std::array t; // NOLINT(*-member-init) 269| | 270| 223k| W carry = 0; 271| 1.11M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (271:28): [True: 893k, False: 223k] ------------------ 272| 893k| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 273| 893k| } 274| | 275| 223k| std::array r; // NOLINT(*-member-init) 276| 223k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 277| 223k| return Self(r); 278| 223k| } pcurves_brainpool256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E1xEv: 1214| 173k| constexpr const FieldElement& x() const { return m_x; } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE4mul3Ev: 337| 86.3k| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_brainpool256r1.cpp:_ZN5BotanmlERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEEESC_: 348| 619k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 349| 619k| std::array z; // NOLINT(*-member-init) 350| 619k| comba_mul(z.data(), a.data(), b.data()); 351| 619k| return Self(Rep::redc(z)); 352| 619k| } pcurves_brainpool256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E1yEv: 1219| 173k| constexpr const FieldElement& y() const { return m_y; } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE4mul4Ev: 340| 1.13k| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_brainpool256r1.cpp:_ZN5BotanmiERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEEESC_: 283| 547k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 284| 547k| std::array r; // NOLINT(*-member-init) 285| 547k| W carry = 0; 286| 2.73M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (286:28): [True: 2.18M, False: 547k] ------------------ 287| 2.18M| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 288| 2.18M| } 289| | 290| 547k| const auto mask = CT::Mask::expand(carry).value(); 291| | 292| 547k| carry = 0; 293| | 294| 2.73M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (294:28): [True: 2.18M, False: 547k] ------------------ 295| 2.18M| r[i] = word_add(r[i], P[i] & mask, &carry); 296| 2.18M| } 297| | 298| 547k| return Self(r); 299| 547k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE4mul2Ev: 327| 281k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 328| 281k| std::array t = value(); 329| 281k| const W carry = shift_left<1>(t); 330| | 331| 281k| std::array r; // NOLINT(*-member-init) 332| 281k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 333| 281k| return Self(r); 334| 281k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE5valueEv: 896| 298k| constexpr const std::array& value() const { return m_val; } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE4mul8Ev: 343| 1.13k| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_brainpool256r1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_EESE_: 1075| 735| friend constexpr Self operator+(const Self& a, const Self& b) { return Self::add(a, b); } pcurves_brainpool256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E3addERKSC_SE_: 1138| 735| constexpr static Self add(const Self& a, const Self& b) { return point_add(a, b); } pcurves_brainpool256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E11is_identityEv: 1093| 50.6k| constexpr CT::Choice is_identity() const { return z().is_zero(); } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE18conditional_assignERSA_SB_SB_NS_2CT6ChoiceERKSA_SF_SF_: 397| 96.8k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 398| 96.8k| const W mask = cond.into_bitmask(); 399| | 400| 484k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (400:28): [True: 387k, False: 96.8k] ------------------ 401| 387k| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 402| 387k| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 403| 387k| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 404| 387k| } 405| 96.8k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE6invertEv: 540| 842| constexpr Self invert() const { return pow_vartime(Self::P_MINUS_2); } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE11pow_vartimeERKNSt3__15arrayImLm4EEE: 479| 1.20k| constexpr Self pow_vartime(const std::array& exp) const { 480| 1.20k| constexpr size_t WindowBits = (Self::BITS <= 256) ? 4 : 5; ------------------ | Branch (480:40): [True: 0, Folded] ------------------ 481| 1.20k| constexpr size_t WindowElements = (1 << WindowBits) - 1; 482| | 483| 1.20k| 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| 1.20k| std::array tbl; 492| | 493| 1.20k| tbl[0] = (*this); 494| | 495| 18.0k| for(size_t i = 1; i != WindowElements; ++i) { ------------------ | Branch (495:28): [True: 16.8k, False: 1.20k] ------------------ 496| | // Conditional ok: table indexes are public here 497| 16.8k| if(i % 2 == 1) { ------------------ | Branch (497:16): [True: 8.41k, False: 8.41k] ------------------ 498| 8.41k| tbl[i] = tbl[i / 2].square(); 499| 8.41k| } else { 500| 8.41k| tbl[i] = tbl[i - 1] * tbl[0]; 501| 8.41k| } 502| 16.8k| } 503| | 504| 1.20k| auto r = Self::one(); 505| | 506| 1.20k| const size_t w0 = read_window_bits(std::span{exp}, (Windows - 1) * WindowBits); 507| | 508| | // Conditional ok: this function is variable time 509| 1.20k| if(w0 > 0) { ------------------ | Branch (509:13): [True: 1.20k, False: 0] ------------------ 510| 1.20k| r = tbl[w0 - 1]; 511| 1.20k| } 512| | 513| 76.9k| for(size_t i = 1; i != Windows; ++i) { ------------------ | Branch (513:28): [True: 75.7k, False: 1.20k] ------------------ 514| 75.7k| r.square_n(WindowBits); 515| | 516| 75.7k| const size_t w = read_window_bits(std::span{exp}, (Windows - i - 1) * WindowBits); 517| | 518| | // Conditional ok: this function is variable time 519| 75.7k| if(w > 0) { ------------------ | Branch (519:16): [True: 70.1k, False: 5.52k] ------------------ 520| 70.1k| r *= tbl[w - 1]; 521| 70.1k| } 522| 75.7k| } 523| | 524| 1.20k| return r; 525| 1.20k| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEEC2Ev: 182| 21.3k| constexpr IntMod() : m_val({}) {} pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE8square_nEm: 441| 75.7k| constexpr void square_n(size_t n) { 442| 75.7k| std::array z; // NOLINT(*-member-init) 443| 378k| for(size_t i = 0; i != n; ++i) { ------------------ | Branch (443:28): [True: 302k, False: 75.7k] ------------------ 444| 302k| comba_sqr(z.data(), this->data()); 445| 302k| m_val = Rep::redc(z); 446| 302k| } 447| 75.7k| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEEmLERKSA_: 357| 237k| constexpr BOTAN_FORCE_INLINE Self& operator*=(const Self& other) { 358| 237k| std::array z; // NOLINT(*-member-init) 359| 237k| comba_mul(z.data(), data(), other.data()); 360| 237k| m_val = Rep::redc(z); 361| 237k| return (*this); 362| 237k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_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| 177| for(;;) { 620| | // Conditional ok: this function is variable time 621| 177| if(a.m_val == b.m_val) { ------------------ | Branch (621:16): [True: 1, False: 176] ------------------ 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| 176| 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| 176| std::array r; // NOLINT(*-member-init) 642| 176| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 643| | 644| | // Conditional ok: this function is variable time 645| 176| if(carry == 0) { ------------------ | Branch (645:16): [True: 94, False: 82] ------------------ 646| | // b > a 647| 94| b.m_val = r; 648| 94| x = nx; 649| 94| Self::_invert_vartime_div2_helper(b, x); 650| 94| } else { 651| | // We know this can't underflow because a > b 652| 82| bigint_sub3(r.data(), a.data(), N, b.data(), N); 653| 82| a.m_val = r; 654| 82| y = nx; 655| 82| Self::_invert_vartime_div2_helper(a, y); 656| 82| } 657| 176| } 658| 1| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE4zeroEv: 197| 88.8k| static constexpr Self zero() { return Self(std::array{0}); } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE8to_wordsEv: 736| 1| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_brainpool256r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES0_E11FieldParamsEE8from_repERKNSt3__15arrayImLm4EEE: 139| 4.07k| constexpr static std::array from_rep(const std::array& z) { 140| 4.07k| std::array ze = {}; 141| 4.07k| copy_mem(std::span{ze}.template first(), z); 142| 4.07k| return Self::redc(ze); 143| 4.07k| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE27_invert_vartime_div2_helperERSA_SB_: 549| 178| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 550| 178| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 551| | 552| | // Conditional ok: this function is variable time 553| 553| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (553:16): [True: 375, False: 178] ------------------ 554| 375| shift_right<1>(a.m_val); 555| | 556| 375| const W borrow = shift_right<1>(x.m_val); 557| | 558| | // Conditional ok: this function is variable time 559| 375| if(borrow) { ------------------ | Branch (559:16): [True: 193, False: 182] ------------------ 560| 193| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 561| 193| } 562| 375| } 563| 178| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE6negateEv: 454| 44.2k| constexpr Self negate() const { 455| 44.2k| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 456| | 457| 44.2k| std::array r; // NOLINT(*-member-init) 458| 44.2k| W carry = 0; 459| 221k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (459:28): [True: 177k, False: 44.2k] ------------------ 460| 177k| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 461| 177k| } 462| | 463| 44.2k| return Self(r); 464| 44.2k| } pcurves_brainpool256r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES0_E11FieldParamsEE6to_repERKNSt3__15arrayImLm4EEE: 117| 1.07k| constexpr static std::array to_rep(const std::array& x) { 118| 1.07k| std::array z; // NOLINT(*-member-init) 119| 1.07k| comba_mul(z.data(), x.data(), R2.data()); 120| 1.07k| return Self::redc(z); 121| 1.07k| } pcurves_brainpool256r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEEEC2ERKSB_SE_: 928| 55.2k| constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {} pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 3.91k| std::array stash_value() const { 762| 3.91k| static_assert(L >= N); 763| 3.91k| std::array stash = {}; 764| 19.5k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 15.6k, False: 3.91k] ------------------ 765| 15.6k| stash[i] = m_val[i]; 766| 15.6k| } 767| 3.91k| return stash; 768| 3.91k| } pcurves_brainpool256r1.cpp:_ZNK5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6EE3mulERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES7_E12ScalarParamsEEEEERNS_21RandomNumberGeneratorE: 1632| 543| ProjectivePoint mul(const Scalar& s, RandomNumberGenerator& rng) const { 1633| 543| const BlindingRandomness blinding(rng); 1634| 543| const BlindedScalar scalar(s, blinding); 1635| 543| return basemul_booth_exec(m_table, scalar, blinding); 1636| 543| } pcurves_brainpool256r1.cpp:_ZN5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm7EEELm1EEC2ERNS_21RandomNumberGeneratorE: 1455| 543| explicit BlindingRandomness(RandomNumberGenerator& rng) : m_seeded(rng.is_seeded()) { 1456| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1457| 543| if(m_seeded) { ------------------ | Branch (1457:13): [True: 543, False: 0] ------------------ 1458| 543| std::array buf{}; 1459| 543| rng.randomize(buf); 1460| | 1461| 543| const std::span bytes(buf); 1462| | 1463| 543| copy_mem(m_masks, bytes.first()); 1464| | 1465| 2.71k| for(size_t i = 0; i != Rerandomizations; ++i) { ------------------ | Branch (1465:31): [True: 2.17k, False: 543] ------------------ 1466| 2.17k| const auto wide = bytes.subspan(Scalars * MaskBytes + i * WideBytes).first(); 1467| 2.17k| m_rerandomizers[i] = FieldElement::from_wide_bytes(wide); 1468| 2.17k| } 1469| | 1470| 543| const auto iso = bytes.subspan(Scalars * MaskBytes + Rerandomizations * WideBytes).first(); 1471| 543| m_isomorphism = FieldElement::from_wide_bytes(iso); 1472| 543| m_isomorphism.conditional_assign(m_isomorphism.is_zero(), FieldElement::one()); 1473| 543| } 1474| 543| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE15from_wide_bytesILm40EEESA_NSt3__14spanIKhXT_EEE: 818| 4.21k| static constexpr Self from_wide_bytes(std::span bytes) { 819| 4.21k| static_assert(8 * L <= 2 * Self::BITS); 820| 4.21k| std::array padded_bytes = {}; 821| 4.21k| copy_mem(std::span{padded_bytes}.template last(), bytes); 822| 4.21k| return Self(Rep::wide_to_rep(bytes_to_words(std::span{padded_bytes}))); 823| 4.21k| } pcurves_brainpool256r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES0_E11FieldParamsEE11wide_to_repERKNSt3__15arrayImLm8EEE: 129| 4.21k| constexpr static std::array wide_to_rep(const std::array& x) { 130| 4.21k| auto redc_x = Self::redc(x); 131| 4.21k| std::array z; // NOLINT(*-member-init) 132| 4.21k| comba_mul(z.data(), redc_x.data(), R3.data()); 133| 4.21k| return Self::redc(z); 134| 4.21k| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE18conditional_assignENS_2CT6ChoiceERKSA_: 369| 44.6k| constexpr void conditional_assign(CT::Choice cond, const Self& nx) { 370| 44.6k| const W mask = cond.into_bitmask(); 371| | 372| 223k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (372:28): [True: 178k, False: 44.6k] ------------------ 373| 178k| m_val[i] = Botan::choose(mask, nx.m_val[i], m_val[i]); 374| 178k| } 375| 44.6k| } pcurves_brainpool256r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm7EEC2INS_18BlindingRandomnessIS5_Lm1EEEEERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsESA_E12ScalarParamsEEEEERKT_m: 1368| 543| BlindedScalarBits(const typename C::Scalar& scalar, const Randomness& randomness, size_t idx = 0) { 1369| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1370| 543| if(BlindingBits > 0 && randomness.seeded()) { ------------------ | Branch (1370:13): [True: 543, Folded] | Branch (1370:33): [True: 543, False: 0] ------------------ 1371| 543| constexpr size_t n_words = C::Words; 1372| | 1373| 543| W mask[n_words] = {0}; 1374| 543| load_le(mask, randomness.mask(idx).data(), MaskWords); 1375| | 1376| | // Mask to exactly BlindingBits 1377| 543| constexpr size_t ExcessBits = MaskWords * WordInfo::bits - BlindingBits; 1378| 543| if constexpr(ExcessBits > 0) { 1379| 543| constexpr W ExcessMask = (static_cast(1) << (WordInfo::bits - ExcessBits)) - 1; 1380| 543| mask[MaskWords - 1] &= ExcessMask; 1381| 543| } 1382| | 1383| | // Set top and bottom bits of mask 1384| 543| constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo::bits; 1385| 543| mask[(BlindingBits - 1) / WordInfo::bits] |= static_cast(1) << TopMaskBit; 1386| 543| mask[0] |= 1; 1387| | 1388| 543| W mask_n[2 * n_words] = {0}; 1389| | 1390| 543| const auto sw = scalar.to_words(); 1391| | 1392| | // Compute masked scalar s + k*n 1393| 543| comba_mul(mask_n, mask, C::NW.data()); 1394| 543| bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size()); 1395| | 1396| 543| std::reverse(mask_n, mask_n + 2 * n_words); 1397| 543| m_bytes = store_be>(mask_n); 1398| 543| m_bits = C::Scalar::BITS + BlindingBits; 1399| 543| } else { 1400| | // No RNG available, skip blinding 1401| 0| m_bytes.resize(C::Scalar::BYTES); 1402| 0| scalar.serialize_to(std::span{m_bytes}.template first()); 1403| 0| m_bits = C::Scalar::BITS; 1404| 0| } 1405| | 1406| 543| CT::poison(m_bytes.data(), m_bytes.size()); 1407| 543| } pcurves_brainpool256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm7EEELm1EE6seededEv: 1476| 543| bool seeded() const { return m_seeded; } pcurves_brainpool256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm7EEELm1EE4maskEm: 1478| 543| std::span mask(size_t idx) const { 1479| 543| BOTAN_ASSERT_NOMSG(idx < Scalars); ------------------ | | 84| 543| do { \ | | 85| 543| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 543| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 543] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 543| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 543] | | ------------------ ------------------ 1480| 543| return std::span{m_masks}.subspan(idx * MaskBytes).template first(); 1481| 543| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E12ScalarParamsEEEE8to_wordsEv: 736| 842| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_brainpool256r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES0_E12ScalarParamsEE8from_repERKNSt3__15arrayImLm4EEE: 139| 1.38k| constexpr static std::array from_rep(const std::array& z) { 140| 1.38k| std::array ze = {}; 141| 1.38k| copy_mem(std::span{ze}.template first(), z); 142| 1.38k| return Self::redc(ze); 143| 1.38k| } pcurves_brainpool256r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES0_E12ScalarParamsEE4redcERKNSt3__15arrayImLm8EEE: 106| 1.92k| constexpr static std::array redc(const std::array& z) { 107| | if constexpr(P_dash == 1) { 108| | return monty_redc_pdash1(z, P); 109| 1.92k| } else { 110| 1.92k| return monty_redc(z, P, P_dash); 111| 1.92k| } 112| 1.92k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E12ScalarParamsEEEE12serialize_toENSt3__14spanIhLm32EEE: 741| 543| constexpr void serialize_to(std::span bytes) const { 742| 543| auto v = Rep::from_rep(m_val); 743| 543| std::reverse(v.begin(), v.end()); 744| | 745| 543| if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| 543| 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| 543| } pcurves_brainpool256r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm7EE4bitsEv: 1362| 543| size_t bits() const { return m_bits; } pcurves_brainpool256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E18conditional_assignENS_2CT6ChoiceERKSC_: 1095| 842| constexpr void conditional_assign(CT::Choice cond, const Self& pt) { 1096| 842| FieldElement::conditional_assign(m_x, m_y, m_z, cond, pt.x(), pt.y(), pt.z()); 1097| 842| } pcurves_brainpool256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E6negateEv: 1194| 842| constexpr Self negate() const { return Self(x(), y().negate(), z()); } pcurves_brainpool256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E18_const_time_poisonEv: 1226| 842| constexpr void _const_time_poison() const { CT::poison_all(m_x, m_y, m_z); } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE18_const_time_poisonEv: 891| 2.52k| constexpr void _const_time_poison() const { CT::poison(m_val); } pcurves_brainpool256r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm7EE10get_windowEm: 1409| 26.6k| size_t get_window(size_t offset) const { 1410| | // Extract a WindowBits sized window out of s, depending on offset. 1411| 26.6k| return read_window_bits(std::span{m_bytes}, offset); 1412| 26.6k| } pcurves_brainpool256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E10add_or_subERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceE: 1121| 26.0k| constexpr static Self add_or_sub(const Self& a, const AffinePoint& b, CT::Choice sub) { 1122| 26.0k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), A); 1123| 26.0k| } pcurves_brainpool256r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEEE9ct_selectENSt3__14spanIKSC_Lm18446744073709551615EEEm: 966| 43.9k| static constexpr auto ct_select(std::span pts, size_t idx) { 967| 43.9k| auto result = Self::identity(pts[0]); 968| | 969| | // Intentionally wrapping; set to maximum size_t if idx == 0 970| 43.9k| const size_t idx1 = idx - 1; 971| 1.17M| for(size_t i = 0; i != pts.size(); ++i) { ------------------ | Branch (971:28): [True: 1.12M, False: 43.9k] ------------------ 972| 1.12M| const auto found = CT::Mask::is_equal(idx1, i).as_choice(); 973| 1.12M| result.conditional_assign(found, pts[i]); 974| 1.12M| } 975| | 976| 43.9k| return result; 977| 43.9k| } pcurves_brainpool256r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEEE8identityERKSC_: 935| 43.9k| static constexpr Self identity(const Self& /*unused*/) { 936| 43.9k| return Self(FieldElement::zero(), FieldElement::zero()); 937| 43.9k| } pcurves_brainpool256r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEEE18conditional_assignENS_2CT6ChoiceERKSC_: 992| 1.12M| constexpr void conditional_assign(CT::Choice cond, const Self& pt) { 993| 1.12M| FieldElement::conditional_assign(m_x, m_y, cond, pt.x(), pt.y()); 994| 1.12M| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE18conditional_assignERSA_SB_NS_2CT6ChoiceERKSA_SF_: 382| 1.12M| static constexpr void conditional_assign(Self& x, Self& y, CT::Choice cond, const Self& nx, const Self& ny) { 383| 1.12M| const W mask = cond.into_bitmask(); 384| | 385| 5.64M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (385:28): [True: 4.51M, False: 1.12M] ------------------ 386| 4.51M| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 387| 4.51M| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 388| 4.51M| } 389| 1.12M| } pcurves_brainpool256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm7EEELm1EE13randomize_repERNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS4_6ParamsESA_E11FieldParamsEEEEESC_EEm: 1486| 2.17k| void randomize_rep(typename C::ProjectivePoint& pt, size_t idx) const { 1487| 2.17k| BOTAN_ASSERT_NOMSG(idx < Rerandomizations); ------------------ | | 84| 2.17k| do { \ | | 85| 2.17k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 2.17k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 2.17k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 2.17k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 2.17k] | | ------------------ ------------------ 1488| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1489| 2.17k| if(m_seeded) { ------------------ | Branch (1489:13): [True: 2.17k, False: 0] ------------------ 1490| 2.17k| pt.randomize_rep(m_rerandomizers[idx]); 1491| 2.17k| } 1492| 2.17k| } pcurves_brainpool256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E13randomize_repERKSB_: 1202| 3.36k| void randomize_rep(const FieldElement& r) { 1203| 3.36k| const auto r2 = r.square(); 1204| 3.36k| const auto r3 = r2 * r; 1205| | 1206| 3.36k| m_x *= r2; 1207| 3.36k| m_y *= r3; 1208| 3.36k| m_z *= r; 1209| 3.36k| } pcurves_brainpool256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E20_const_time_unpoisonEv: 1228| 842| constexpr void _const_time_unpoison() const { CT::unpoison_all(m_x, m_y, m_z); } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE20_const_time_unpoisonEv: 893| 2.52k| constexpr void _const_time_unpoison() const { CT::unpoison(m_val); } pcurves_brainpool256r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm7EED2Ev: 1414| 543| ~BlindedScalarBits() { 1415| 543| secure_zeroize_buffer(m_bytes.data(), m_bytes.size()); 1416| 543| CT::unpoison(m_bytes.data(), m_bytes.size()); 1417| 543| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E12ScalarParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE: 776| 1.92k| static Self from_stash(const std::array& stash) { 777| 1.92k| static_assert(L >= N); 778| 1.92k| std::array val = {}; 779| 9.64k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 7.71k, False: 1.92k] ------------------ 780| 7.71k| val[i] = stash[i]; 781| 7.71k| } 782| 1.92k| return Self(val); 783| 1.92k| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E12ScalarParamsEEEEC2ENSt3__15arrayImLm4EEE: 908| 2.47k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE12serialize_toENSt3__14spanIhLm32EEE: 741| 3.77k| constexpr void serialize_to(std::span bytes) const { 742| 3.77k| auto v = Rep::from_rep(m_val); 743| 3.77k| std::reverse(v.begin(), v.end()); 744| | 745| 3.77k| if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| 3.77k| 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| 3.77k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E12ScalarParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 543| std::array stash_value() const { 762| 543| static_assert(L >= N); 763| 543| std::array stash = {}; 764| 2.71k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 2.17k, False: 543] ------------------ 765| 2.17k| stash[i] = m_val[i]; 766| 2.17k| } 767| 543| return stash; 768| 543| } pcurves_brainpool256r1.cpp:_ZN5Botan12varpoint_mulINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm4EEENT_15ProjectivePointERKNS5_11AffinePointERKNS5_6ScalarERNS_21RandomNumberGeneratorE: 1680| 299| RandomNumberGenerator& rng) { 1681| 299| using ProjectivePoint = typename C::ProjectivePoint; 1682| | 1683| 299| constexpr size_t TableBits = W; 1684| 299| static_assert(TableBits >= 1 && TableBits <= 7); 1685| | 1686| 299| constexpr size_t WindowBits = TableBits + 1; 1687| | 1688| 299| using BlindedScalar = BlindedScalarBits; 1689| 299| using Blinding = BlindingRandomness; 1690| | 1691| | // 2^W elements [1*P, 2*P, ..., 2^W*P] 1692| 299| constexpr size_t TableSize = 1 << TableBits; 1693| | 1694| 299| const Blinding blinding(rng); 1695| 299| const SharedZPointTable table(p, TableSize, C::A, blinding.isomorphism()); 1696| 299| const BlindedScalar bits(s, blinding); 1697| | 1698| 299| const size_t scalar_bits = bits.bits(); 1699| 299| const size_t full_windows = booth_full_windows(scalar_bits + 1, WindowBits); 1700| 299| const size_t initial_shift = booth_initial_shift(scalar_bits + 1, WindowBits); 1701| | 1702| 299| BOTAN_DEBUG_ASSERT(full_windows * WindowBits + initial_shift == scalar_bits + 1); ------------------ | | 137| 299| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 299| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 299] | | ------------------ ------------------ 1703| 299| BOTAN_DEBUG_ASSERT(initial_shift > 0); ------------------ | | 137| 299| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 299| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 299] | | ------------------ ------------------ 1704| | 1705| 299| auto accum = ProjectivePoint::identity(); 1706| 299| CT::poison(accum); 1707| | 1708| 17.3k| for(size_t i = 0; i != full_windows; ++i) { ------------------ | Branch (1708:22): [True: 17.0k, False: 299] ------------------ 1709| 17.0k| const size_t idx = scalar_bits - initial_shift - WindowBits * i; 1710| | 1711| 17.0k| const size_t w_i = bits.get_window(idx); 1712| 17.0k| const auto [tidx, tneg] = booth_recode(w_i); 1713| | 1714| | // Conditional ok: loop iteration count is public 1715| 17.0k| if(i == 0) { ------------------ | Branch (1715:10): [True: 299, False: 16.7k] ------------------ 1716| 299| accum = ProjectivePoint::from_affine(table.ct_select(tidx)); 1717| 299| accum.conditional_assign(tneg, accum.negate()); 1718| 16.7k| } else { 1719| 16.7k| accum = ProjectivePoint::add_or_sub_iso(accum, table.ct_select(tidx), tneg, table.a()); 1720| 16.7k| } 1721| | 1722| 17.0k| accum = accum.dbl_n_iso(table.a(), WindowBits); 1723| | 1724| | // Conditional ok: loop iteration count is public 1725| 17.0k| if(i < Blinding::Rerandomizations) { ------------------ | Branch (1725:10): [True: 1.19k, False: 15.8k] ------------------ 1726| 1.19k| blinding.randomize_rep(accum, i); 1727| 1.19k| } 1728| 17.0k| } 1729| | 1730| | // final window (note one bit shorter than previous reads) 1731| 299| const size_t w_l = bits.get_window(0) & ((1 << WindowBits) - 1); 1732| 299| const auto [tidx, tneg] = booth_recode(w_l << 1); 1733| 299| accum = ProjectivePoint::add_or_sub_iso(accum, table.ct_select(tidx), tneg, table.a()); 1734| | 1735| 299| CT::unpoison(accum); 1736| | 1737| | // Map back from the isomorphic curve 1738| 299| return ProjectivePoint(accum.x(), accum.y(), accum.z() * table.z()); 1739| 299|} pcurves_brainpool256r1.cpp:_ZN5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6EEELm1EEC2ERNS_21RandomNumberGeneratorE: 1455| 299| explicit BlindingRandomness(RandomNumberGenerator& rng) : m_seeded(rng.is_seeded()) { 1456| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1457| 299| if(m_seeded) { ------------------ | Branch (1457:13): [True: 299, False: 0] ------------------ 1458| 299| std::array buf{}; 1459| 299| rng.randomize(buf); 1460| | 1461| 299| const std::span bytes(buf); 1462| | 1463| 299| copy_mem(m_masks, bytes.first()); 1464| | 1465| 1.49k| for(size_t i = 0; i != Rerandomizations; ++i) { ------------------ | Branch (1465:31): [True: 1.19k, False: 299] ------------------ 1466| 1.19k| const auto wide = bytes.subspan(Scalars * MaskBytes + i * WideBytes).first(); 1467| 1.19k| m_rerandomizers[i] = FieldElement::from_wide_bytes(wide); 1468| 1.19k| } 1469| | 1470| 299| const auto iso = bytes.subspan(Scalars * MaskBytes + Rerandomizations * WideBytes).first(); 1471| 299| m_isomorphism = FieldElement::from_wide_bytes(iso); 1472| 299| m_isomorphism.conditional_assign(m_isomorphism.is_zero(), FieldElement::one()); 1473| 299| } 1474| 299| } pcurves_brainpool256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6EEELm1EE11isomorphismEv: 1497| 299| const FieldElement& isomorphism() const { return m_isomorphism; } pcurves_brainpool256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E11add_mixed_hERKSC_RKNS_16AffineCurvePointISB_EE: 1116| 4.18k| constexpr static std::pair add_mixed_h(const Self& a, const AffinePoint& b) { 1117| 4.18k| return point_add_mixed_h(a, b, FieldElement::one(), A); 1118| 4.18k| } pcurves_brainpool256r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6EEC2INS_18BlindingRandomnessIS5_Lm1EEEEERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsESA_E12ScalarParamsEEEEERKT_m: 1368| 299| BlindedScalarBits(const typename C::Scalar& scalar, const Randomness& randomness, size_t idx = 0) { 1369| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1370| 299| if(BlindingBits > 0 && randomness.seeded()) { ------------------ | Branch (1370:13): [True: 299, Folded] | Branch (1370:33): [True: 299, False: 0] ------------------ 1371| 299| constexpr size_t n_words = C::Words; 1372| | 1373| 299| W mask[n_words] = {0}; 1374| 299| load_le(mask, randomness.mask(idx).data(), MaskWords); 1375| | 1376| | // Mask to exactly BlindingBits 1377| 299| constexpr size_t ExcessBits = MaskWords * WordInfo::bits - BlindingBits; 1378| 299| if constexpr(ExcessBits > 0) { 1379| 299| constexpr W ExcessMask = (static_cast(1) << (WordInfo::bits - ExcessBits)) - 1; 1380| 299| mask[MaskWords - 1] &= ExcessMask; 1381| 299| } 1382| | 1383| | // Set top and bottom bits of mask 1384| 299| constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo::bits; 1385| 299| mask[(BlindingBits - 1) / WordInfo::bits] |= static_cast(1) << TopMaskBit; 1386| 299| mask[0] |= 1; 1387| | 1388| 299| W mask_n[2 * n_words] = {0}; 1389| | 1390| 299| const auto sw = scalar.to_words(); 1391| | 1392| | // Compute masked scalar s + k*n 1393| 299| comba_mul(mask_n, mask, C::NW.data()); 1394| 299| bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size()); 1395| | 1396| 299| std::reverse(mask_n, mask_n + 2 * n_words); 1397| 299| m_bytes = store_be>(mask_n); 1398| 299| m_bits = C::Scalar::BITS + BlindingBits; 1399| 299| } else { 1400| | // No RNG available, skip blinding 1401| 0| m_bytes.resize(C::Scalar::BYTES); 1402| 0| scalar.serialize_to(std::span{m_bytes}.template first()); 1403| 0| m_bits = C::Scalar::BITS; 1404| 0| } 1405| | 1406| 299| CT::poison(m_bytes.data(), m_bytes.size()); 1407| 299| } pcurves_brainpool256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6EEELm1EE6seededEv: 1476| 299| bool seeded() const { return m_seeded; } pcurves_brainpool256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6EEELm1EE4maskEm: 1478| 299| std::span mask(size_t idx) const { 1479| 299| BOTAN_ASSERT_NOMSG(idx < Scalars); ------------------ | | 84| 299| do { \ | | 85| 299| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 299| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 299] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 299| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 299] | | ------------------ ------------------ 1480| 299| return std::span{m_masks}.subspan(idx * MaskBytes).template first(); 1481| 299| } pcurves_brainpool256r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6EE4bitsEv: 1362| 299| size_t bits() const { return m_bits; } _ZN5Botan18booth_full_windowsEmm: 1653| 1.41k|constexpr size_t booth_full_windows(size_t sb, size_t wb) { 1654| 1.41k| if(sb % wb == 0) { ------------------ | Branch (1654:7): [True: 0, False: 1.41k] ------------------ 1655| 0| return (sb - 1) / wb; 1656| 1.41k| } else { 1657| 1.41k| return sb / wb; 1658| 1.41k| } 1659| 1.41k|} _ZN5Botan19booth_initial_shiftEmm: 1661| 1.41k|constexpr size_t booth_initial_shift(size_t sb, size_t wb) { 1662| 1.41k| if(sb % wb == 0) { ------------------ | Branch (1662:7): [True: 0, False: 1.41k] ------------------ 1663| 0| return wb; 1664| 1.41k| } else { 1665| 1.41k| return sb - (sb / wb) * wb; 1666| 1.41k| } 1667| 1.41k|} pcurves_brainpool256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E8identityEv: 1049| 299| static constexpr Self identity() { return Self(FieldElement::zero(), FieldElement::one(), FieldElement::zero()); } pcurves_brainpool256r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6EE10get_windowEm: 1409| 17.3k| size_t get_window(size_t offset) const { 1410| | // Extract a WindowBits sized window out of s, depending on offset. 1411| 17.3k| return read_window_bits(std::span{m_bytes}, offset); 1412| 17.3k| } pcurves_brainpool256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E14add_or_sub_isoERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceERKSB_: 1131| 17.0k| const FieldElement& curve_a) { 1132| 17.0k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), curve_a); 1133| 17.0k| } pcurves_brainpool256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEES7_E9dbl_n_isoERKSB_m: 1159| 17.0k| constexpr Self dbl_n_iso(const FieldElement& a, size_t n) const { 1160| | if constexpr(Self::A_is_zero) { 1161| | return dbl_n_a_zero(*this, n); 1162| 17.0k| } else { 1163| 17.0k| return dbl_n_generic(*this, a, n); 1164| 17.0k| } 1165| 17.0k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE4div2Ev: 304| 17.0k| 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| 17.0k| 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| 17.0k| std::array t = value(); 312| 17.0k| const W borrow = shift_right<1>(t); 313| | 314| | // If value was odd, add (P/2)+1 315| 17.0k| const auto mask = CT::Mask::expand(borrow).value(); 316| | 317| 17.0k| W carry = 0; 318| | 319| 85.2k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (319:28): [True: 68.1k, False: 17.0k] ------------------ 320| 68.1k| t[i] = word_add(t[i], INV_2[i] & mask, &carry); 321| 68.1k| } 322| | 323| 17.0k| return Self(t); 324| 17.0k| } pcurves_brainpool256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6EEELm1EE13randomize_repERNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS4_6ParamsESA_E11FieldParamsEEEEESC_EEm: 1486| 1.19k| void randomize_rep(typename C::ProjectivePoint& pt, size_t idx) const { 1487| 1.19k| BOTAN_ASSERT_NOMSG(idx < Rerandomizations); ------------------ | | 84| 1.19k| do { \ | | 85| 1.19k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 1.19k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 1.19k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 1.19k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 1.19k] | | ------------------ ------------------ 1488| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1489| 1.19k| if(m_seeded) { ------------------ | Branch (1489:13): [True: 1.19k, False: 0] ------------------ 1490| 1.19k| pt.randomize_rep(m_rerandomizers[idx]); 1491| 1.19k| } 1492| 1.19k| } pcurves_brainpool256r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6EED2Ev: 1414| 299| ~BlindedScalarBits() { 1415| 299| secure_zeroize_buffer(m_bytes.data(), m_bytes.size()); 1416| 299| CT::unpoison(m_bytes.data(), m_bytes.size()); 1417| 299| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE: 776| 9.18k| static Self from_stash(const std::array& stash) { 777| 9.18k| static_assert(L >= N); 778| 9.18k| std::array val = {}; 779| 45.9k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 36.7k, False: 9.18k] ------------------ 780| 36.7k| val[i] = stash[i]; 781| 36.7k| } 782| 9.18k| return Self(val); 783| 9.18k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E12ScalarParamsEEEE7is_zeroEv: 227| 1.08k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 1.07k| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 1.07k| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 1.07k] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 1.07k| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 1.07k| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 6, False: 1.07k] ------------------ 804| 6| return {}; 805| 6| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 1.07k| return Self::from_words(words); 809| 1.07k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEEeqERKSA_: 724| 1.25k| constexpr CT::Choice operator==(const Self& other) const { 725| 1.25k| return CT::is_equal(this->data(), other.data(), N).as_choice(); 726| 1.25k| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE10from_wordsILm4EEESA_NSt3__15arrayImXT_EEE: 213| 1.07k| static constexpr Self from_words(std::array w) { 214| 1.07k| if constexpr(L == N) { 215| 1.07k| 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.07k| } pcurves_brainpool256r1.cpp:_ZN5Botan13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsENS_13MontgomeryRepEE7x3_ax_bERKNS_6IntModINS5_INS6_11FieldParamsEEEEE: 1327| 1.25k| static constexpr FieldElement x3_ax_b(const FieldElement& x) { return (x.square() + A) * x + B; } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE4sqrtEv: 665| 360| constexpr CT::Option sqrt() const { 666| 360| if constexpr(Self::P_MOD_4 == 3) { 667| | // The easy case for square root is when p == 3 (mod 4) 668| | 669| 360| constexpr auto P_PLUS_1_OVER_4 = p_plus_1_over_4(P); 670| 360| auto z = pow_vartime(P_PLUS_1_OVER_4); 671| | 672| | // Zero out the return value if it would otherwise be incorrect 673| 360| const CT::Choice correct = (z.square() == *this); 674| 360| z.conditional_assign(!correct, Self::zero()); 675| 360| return CT::Option(z, correct); 676| | } 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| | constexpr auto C1_C2 = shanks_tonelli_c1c2(Self::P); 688| | constexpr std::array C3 = shanks_tonelli_c3(C1_C2.second); 689| | constexpr std::array P_MINUS_1_OVER_2 = p_minus_1_over_2(Self::P); 690| | constexpr Self C4 = shanks_tonelli_c4(P_MINUS_1_OVER_2); 691| | constexpr Self C5 = C4.pow_vartime(C1_C2.second); 692| | 693| | const Self& x = (*this); 694| | 695| | auto z = x.pow_vartime(C3); 696| | auto t = z.square(); 697| | t *= x; 698| | z *= x; 699| | auto b = t; 700| | auto c = C5; 701| | 702| | for(size_t i = C1_C2.first; i >= 2; i--) { 703| | b.square_n(i - 2); 704| | const CT::Choice e = b.is_one(); 705| | z.conditional_assign(!e, z * c); 706| | c.square_n(1); 707| | t.conditional_assign(!e, t * c); 708| | b = t; 709| | } 710| | 711| | // Zero out the return value if it would otherwise be incorrect 712| | const CT::Choice correct = (z.square() == *this); 713| | z.conditional_assign(!correct, Self::zero()); 714| | return CT::Option(z, correct); 715| | } 716| 360| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE12correct_signENS_2CT6ChoiceE: 250| 299| constexpr Self correct_sign(CT::Choice even) const { 251| 299| const auto flip = (even != this->is_even()); 252| 299| return Self::choose(flip, this->negate(), *this); 253| 299| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE7is_evenEv: 242| 299| constexpr CT::Choice is_even() const { 243| 299| auto v = Rep::from_rep(m_val); 244| 299| return !CT::Choice::from_int(v[0] & 0x01); 245| 299| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E11FieldParamsEEEE6chooseENS_2CT6ChoiceERKSA_SE_: 258| 299| static constexpr Self choose(CT::Choice choice, const Self& x, const Self& y) { 259| 299| auto r = y; 260| 299| r.conditional_assign(choice, x); 261| 299| return r; 262| 299| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E12ScalarParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 792| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 792| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 792] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 792| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 792| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 249, False: 543] ------------------ 804| 249| return {}; 805| 249| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 543| return Self::from_words(words); 809| 792| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E12ScalarParamsEEEE10from_wordsILm4EEESA_NSt3__15arrayImXT_EEE: 213| 543| static constexpr Self from_words(std::array w) { 214| 543| if constexpr(L == N) { 215| 543| 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| 543| } pcurves_brainpool256r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES0_E12ScalarParamsEE6to_repERKNSt3__15arrayImLm4EEE: 117| 543| constexpr static std::array to_rep(const std::array& x) { 118| 543| std::array z; // NOLINT(*-member-init) 119| 543| comba_mul(z.data(), x.data(), R2.data()); 120| 543| return Self::redc(z); 121| 543| } pcurves_brainpool256r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES2_E11FieldParamsEEEEEE12serialize_toENSt3__14spanIhLm65EEE: 952| 1.73k| constexpr void serialize_to(std::span bytes) const { 953| 1.73k| BOTAN_STATE_CHECK(this->is_identity().as_bool() == false); ------------------ | | 51| 1.73k| do { \ | | 52| 1.73k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 1.73k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 1.73k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 1.73k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 1.73k] | | ------------------ ------------------ 954| 1.73k| BufferStuffer pack(bytes); 955| 1.73k| pack.append(0x04); 956| 1.73k| x().serialize_to(pack.next()); 957| 1.73k| y().serialize_to(pack.next()); 958| 1.73k| BOTAN_DEBUG_ASSERT(pack.full()); ------------------ | | 137| 1.73k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.73k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.73k] | | ------------------ ------------------ 959| 1.73k| } pcurves_brainpool256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E12ScalarParamsEEEE6randomERNS_21RandomNumberGeneratorE: 853| 543| static Self random(RandomNumberGenerator& rng) { 854| 543| constexpr size_t MAX_ATTEMPTS = 1000; 855| | 856| 543| std::array buf{}; 857| | 858| 792| for(size_t i = 0; i != MAX_ATTEMPTS; ++i) { ------------------ | Branch (858:28): [True: 792, False: 0] ------------------ 859| 792| rng.randomize(buf); 860| | 861| | // Zero off high bits that if set would certainly cause us 862| | // to be out of range 863| | if constexpr(Self::BITS % 8 != 0) { 864| | constexpr uint8_t mask = 0xFF >> (8 - (Self::BITS % 8)); 865| | buf[0] &= mask; 866| | } 867| | 868| | // Conditionals ok: rejection sampling reveals only values we didn't use 869| 792| if(auto s = Self::deserialize(buf)) { ------------------ | Branch (869:21): [True: 543, False: 249] ------------------ 870| 543| if(s.value().is_nonzero().as_bool()) { ------------------ | Branch (870:19): [True: 543, False: 0] ------------------ 871| 543| return s.value(); 872| 543| } 873| 543| } 874| 792| } 875| | 876| 0| throw Internal_Error("Failed to generate random Scalar within bounded number of attempts"); 877| 543| } pcurves_brainpool256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool256r16ParamsES1_E12ScalarParamsEEEE10is_nonzeroEv: 232| 543| constexpr CT::Choice is_nonzero() const { return !is_zero(); } pcurves_brainpool384r1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1630| 1| m_table(basemul_booth_setup(p, BlindedScalar::Bits + 1)) {} pcurves_brainpool384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E11from_affineERKNS_16AffineCurvePointISB_EE: 1027| 688| 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| 688| const auto x = pt.x(); 1038| 688| auto y = pt.y(); 1039| 688| auto z = FieldElement::one(); 1040| | 1041| 688| FieldElement::conditional_swap(pt.is_identity(), y, z); 1042| | 1043| 688| return ProjectiveCurvePoint(x, y, z); 1044| 688| } pcurves_brainpool384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEEE1xEv: 982| 1.18M| constexpr const FieldElement& x() const { return m_x; } pcurves_brainpool384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEEE1yEv: 987| 1.14M| constexpr const FieldElement& y() const { return m_y; } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE3oneEv: 202| 44.7k| static constexpr Self one() { return Self(Rep::one()); } pcurves_brainpool384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES0_E11FieldParamsEE3oneEv: 101| 44.7k| constexpr static std::array one() { return R1; } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEEC2ENSt3__15arrayImLm6EEE: 908| 2.13M| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 412| 688| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 413| 688| const W mask = cond.into_bitmask(); 414| | 415| 4.81k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (415:28): [True: 4.12k, False: 688] ------------------ 416| 4.12k| const auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 417| 4.12k| const auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 418| 4.12k| x.m_val[i] = nx; 419| 4.12k| y.m_val[i] = ny; 420| 4.12k| } 421| 688| } pcurves_brainpool384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEEE11is_identityEv: 939| 45.1k| constexpr CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE7is_zeroEv: 227| 223k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_brainpool384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_EC2ERKSB_SE_SE_: 1067| 60.9k| m_x(x), m_y(y), m_z(z) {} pcurves_brainpool384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E3dblEv: 1181| 1.40k| constexpr Self dbl() const { 1182| | if constexpr(Self::A_is_minus_3) { 1183| | return dbl_a_minus_3(*this); 1184| | } else if constexpr(Self::A_is_zero) { 1185| | return dbl_a_zero(*this); 1186| 1.40k| } else { 1187| 1.40k| return dbl_generic(*this, A); 1188| 1.40k| } 1189| 1.40k| } pcurves_brainpool384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E1zEv: 1224| 247k| constexpr const FieldElement& z() const { return m_z; } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE6squareEv: 428| 477k| constexpr BOTAN_FORCE_INLINE Self square() const { 429| 477k| std::array z; // NOLINT(*-member-init) 430| 477k| comba_sqr(z.data(), this->data()); 431| 477k| return Self(Rep::redc(z)); 432| 477k| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE4dataEv: 898| 2.29M| constexpr const W* data() const { return m_val.data(); } pcurves_brainpool384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES0_E11FieldParamsEE4redcERKNSt3__15arrayImLm12EEE: 106| 1.51M| constexpr static std::array redc(const std::array& z) { 107| | if constexpr(P_dash == 1) { 108| | return monty_redc_pdash1(z, P); 109| 1.51M| } else { 110| 1.51M| return monty_redc(z, P, P_dash); 111| 1.51M| } 112| 1.51M| } pcurves_brainpool384r1.cpp:_ZN5BotanplERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEEESC_: 267| 192k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 268| 192k| std::array t; // NOLINT(*-member-init) 269| | 270| 192k| W carry = 0; 271| 1.34M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (271:28): [True: 1.15M, False: 192k] ------------------ 272| 1.15M| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 273| 1.15M| } 274| | 275| 192k| std::array r; // NOLINT(*-member-init) 276| 192k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 277| 192k| return Self(r); 278| 192k| } pcurves_brainpool384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E1xEv: 1214| 154k| constexpr const FieldElement& x() const { return m_x; } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE4mul3Ev: 337| 73.6k| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_brainpool384r1.cpp:_ZN5BotanmlERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEEESC_: 348| 552k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 349| 552k| std::array z; // NOLINT(*-member-init) 350| 552k| comba_mul(z.data(), a.data(), b.data()); 351| 552k| return Self(Rep::redc(z)); 352| 552k| } pcurves_brainpool384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E1yEv: 1219| 154k| constexpr const FieldElement& y() const { return m_y; } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE4mul4Ev: 340| 1.40k| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_brainpool384r1.cpp:_ZN5BotanmiERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEEESC_: 283| 479k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 284| 479k| std::array r; // NOLINT(*-member-init) 285| 479k| W carry = 0; 286| 3.35M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (286:28): [True: 2.87M, False: 479k] ------------------ 287| 2.87M| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 288| 2.87M| } 289| | 290| 479k| const auto mask = CT::Mask::expand(carry).value(); 291| | 292| 479k| carry = 0; 293| | 294| 3.35M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (294:28): [True: 2.87M, False: 479k] ------------------ 295| 2.87M| r[i] = word_add(r[i], P[i] & mask, &carry); 296| 2.87M| } 297| | 298| 479k| return Self(r); 299| 479k| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE4mul2Ev: 327| 242k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 328| 242k| std::array t = value(); 329| 242k| const W carry = shift_left<1>(t); 330| | 331| 242k| std::array r; // NOLINT(*-member-init) 332| 242k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 333| 242k| return Self(r); 334| 242k| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE5valueEv: 896| 256k| constexpr const std::array& value() const { return m_val; } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE4mul8Ev: 343| 1.40k| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_brainpool384r1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_EESE_: 1075| 1.09k| friend constexpr Self operator+(const Self& a, const Self& b) { return Self::add(a, b); } pcurves_brainpool384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E3addERKSC_SE_: 1138| 1.09k| constexpr static Self add(const Self& a, const Self& b) { return point_add(a, b); } pcurves_brainpool384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E11is_identityEv: 1093| 46.7k| constexpr CT::Choice is_identity() const { return z().is_zero(); } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE18conditional_assignERSA_SB_SB_NS_2CT6ChoiceERKSA_SF_SF_: 397| 86.8k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 398| 86.8k| const W mask = cond.into_bitmask(); 399| | 400| 607k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (400:28): [True: 521k, False: 86.8k] ------------------ 401| 521k| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 402| 521k| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 403| 521k| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 404| 521k| } 405| 86.8k| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE6invertEv: 540| 519| constexpr Self invert() const { return pow_vartime(Self::P_MINUS_2); } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE11pow_vartimeERKNSt3__15arrayImLm6EEE: 479| 741| constexpr Self pow_vartime(const std::array& exp) const { 480| 741| constexpr size_t WindowBits = (Self::BITS <= 256) ? 4 : 5; ------------------ | Branch (480:40): [Folded, False: 741] ------------------ 481| 741| constexpr size_t WindowElements = (1 << WindowBits) - 1; 482| | 483| 741| 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| 741| std::array tbl; 492| | 493| 741| tbl[0] = (*this); 494| | 495| 22.9k| for(size_t i = 1; i != WindowElements; ++i) { ------------------ | Branch (495:28): [True: 22.2k, False: 741] ------------------ 496| | // Conditional ok: table indexes are public here 497| 22.2k| if(i % 2 == 1) { ------------------ | Branch (497:16): [True: 11.1k, False: 11.1k] ------------------ 498| 11.1k| tbl[i] = tbl[i / 2].square(); 499| 11.1k| } else { 500| 11.1k| tbl[i] = tbl[i - 1] * tbl[0]; 501| 11.1k| } 502| 22.2k| } 503| | 504| 741| auto r = Self::one(); 505| | 506| 741| const size_t w0 = read_window_bits(std::span{exp}, (Windows - 1) * WindowBits); 507| | 508| | // Conditional ok: this function is variable time 509| 741| if(w0 > 0) { ------------------ | Branch (509:13): [True: 741, False: 0] ------------------ 510| 741| r = tbl[w0 - 1]; 511| 741| } 512| | 513| 57.0k| for(size_t i = 1; i != Windows; ++i) { ------------------ | Branch (513:28): [True: 56.3k, False: 741] ------------------ 514| 56.3k| r.square_n(WindowBits); 515| | 516| 56.3k| const size_t w = read_window_bits(std::span{exp}, (Windows - i - 1) * WindowBits); 517| | 518| | // Conditional ok: this function is variable time 519| 56.3k| if(w > 0) { ------------------ | Branch (519:16): [True: 53.8k, False: 2.44k] ------------------ 520| 53.8k| r *= tbl[w - 1]; 521| 53.8k| } 522| 56.3k| } 523| | 524| 741| return r; 525| 741| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEEC2Ev: 182| 25.0k| constexpr IntMod() : m_val({}) {} pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE8square_nEm: 441| 56.3k| constexpr void square_n(size_t n) { 442| 56.3k| std::array z; // NOLINT(*-member-init) 443| 337k| for(size_t i = 0; i != n; ++i) { ------------------ | Branch (443:28): [True: 281k, False: 56.3k] ------------------ 444| 281k| comba_sqr(z.data(), this->data()); 445| 281k| m_val = Rep::redc(z); 446| 281k| } 447| 56.3k| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEEmLERKSA_: 357| 192k| constexpr BOTAN_FORCE_INLINE Self& operator*=(const Self& other) { 358| 192k| std::array z; // NOLINT(*-member-init) 359| 192k| comba_mul(z.data(), data(), other.data()); 360| 192k| m_val = Rep::redc(z); 361| 192k| return (*this); 362| 192k| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_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| 262| for(;;) { 620| | // Conditional ok: this function is variable time 621| 262| if(a.m_val == b.m_val) { ------------------ | Branch (621:16): [True: 1, False: 261] ------------------ 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| 261| 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| 261| std::array r; // NOLINT(*-member-init) 642| 261| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 643| | 644| | // Conditional ok: this function is variable time 645| 261| if(carry == 0) { ------------------ | Branch (645:16): [True: 128, False: 133] ------------------ 646| | // b > a 647| 128| b.m_val = r; 648| 128| x = nx; 649| 128| Self::_invert_vartime_div2_helper(b, x); 650| 133| } else { 651| | // We know this can't underflow because a > b 652| 133| bigint_sub3(r.data(), a.data(), N, b.data(), N); 653| 133| a.m_val = r; 654| 133| y = nx; 655| 133| Self::_invert_vartime_div2_helper(a, y); 656| 133| } 657| 261| } 658| 1| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE4zeroEv: 197| 81.0k| static constexpr Self zero() { return Self(std::array{0}); } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE8to_wordsEv: 736| 1| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_brainpool384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES0_E11FieldParamsEE8from_repERKNSt3__15arrayImLm6EEE: 139| 2.38k| constexpr static std::array from_rep(const std::array& z) { 140| 2.38k| std::array ze = {}; 141| 2.38k| copy_mem(std::span{ze}.template first(), z); 142| 2.38k| return Self::redc(ze); 143| 2.38k| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE27_invert_vartime_div2_helperERSA_SB_: 549| 263| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 550| 263| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 551| | 552| | // Conditional ok: this function is variable time 553| 814| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (553:16): [True: 551, False: 263] ------------------ 554| 551| shift_right<1>(a.m_val); 555| | 556| 551| const W borrow = shift_right<1>(x.m_val); 557| | 558| | // Conditional ok: this function is variable time 559| 551| if(borrow) { ------------------ | Branch (559:16): [True: 291, False: 260] ------------------ 560| 291| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 561| 291| } 562| 551| } 563| 263| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE6negateEv: 454| 40.4k| constexpr Self negate() const { 455| 40.4k| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 456| | 457| 40.4k| std::array r; // NOLINT(*-member-init) 458| 40.4k| W carry = 0; 459| 282k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (459:28): [True: 242k, False: 40.4k] ------------------ 460| 242k| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 461| 242k| } 462| | 463| 40.4k| return Self(r); 464| 40.4k| } pcurves_brainpool384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES0_E11FieldParamsEE6to_repERKNSt3__15arrayImLm6EEE: 117| 575| constexpr static std::array to_rep(const std::array& x) { 118| 575| std::array z; // NOLINT(*-member-init) 119| 575| comba_mul(z.data(), x.data(), R2.data()); 120| 575| return Self::redc(z); 121| 575| } pcurves_brainpool384r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEEEC2ERKSB_SE_: 928| 48.1k| constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {} pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 2.42k| std::array stash_value() const { 762| 2.42k| static_assert(L >= N); 763| 2.42k| std::array stash = {}; 764| 16.9k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 14.5k, False: 2.42k] ------------------ 765| 14.5k| stash[i] = m_val[i]; 766| 14.5k| } 767| 2.42k| return stash; 768| 2.42k| } pcurves_brainpool384r1.cpp:_ZNK5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6EE3mulERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES7_E12ScalarParamsEEEEERNS_21RandomNumberGeneratorE: 1632| 351| ProjectivePoint mul(const Scalar& s, RandomNumberGenerator& rng) const { 1633| 351| const BlindingRandomness blinding(rng); 1634| 351| const BlindedScalar scalar(s, blinding); 1635| 351| return basemul_booth_exec(m_table, scalar, blinding); 1636| 351| } pcurves_brainpool384r1.cpp:_ZN5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm7EEELm1EEC2ERNS_21RandomNumberGeneratorE: 1455| 351| explicit BlindingRandomness(RandomNumberGenerator& rng) : m_seeded(rng.is_seeded()) { 1456| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1457| 351| if(m_seeded) { ------------------ | Branch (1457:13): [True: 351, False: 0] ------------------ 1458| 351| std::array buf{}; 1459| 351| rng.randomize(buf); 1460| | 1461| 351| const std::span bytes(buf); 1462| | 1463| 351| copy_mem(m_masks, bytes.first()); 1464| | 1465| 1.75k| for(size_t i = 0; i != Rerandomizations; ++i) { ------------------ | Branch (1465:31): [True: 1.40k, False: 351] ------------------ 1466| 1.40k| const auto wide = bytes.subspan(Scalars * MaskBytes + i * WideBytes).first(); 1467| 1.40k| m_rerandomizers[i] = FieldElement::from_wide_bytes(wide); 1468| 1.40k| } 1469| | 1470| 351| const auto iso = bytes.subspan(Scalars * MaskBytes + Rerandomizations * WideBytes).first(); 1471| 351| m_isomorphism = FieldElement::from_wide_bytes(iso); 1472| 351| m_isomorphism.conditional_assign(m_isomorphism.is_zero(), FieldElement::one()); 1473| 351| } 1474| 351| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE15from_wide_bytesILm56EEESA_NSt3__14spanIKhXT_EEE: 818| 2.59k| static constexpr Self from_wide_bytes(std::span bytes) { 819| 2.59k| static_assert(8 * L <= 2 * Self::BITS); 820| 2.59k| std::array padded_bytes = {}; 821| 2.59k| copy_mem(std::span{padded_bytes}.template last(), bytes); 822| 2.59k| return Self(Rep::wide_to_rep(bytes_to_words(std::span{padded_bytes}))); 823| 2.59k| } pcurves_brainpool384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES0_E11FieldParamsEE11wide_to_repERKNSt3__15arrayImLm12EEE: 129| 2.59k| constexpr static std::array wide_to_rep(const std::array& x) { 130| 2.59k| auto redc_x = Self::redc(x); 131| 2.59k| std::array z; // NOLINT(*-member-init) 132| 2.59k| comba_mul(z.data(), redc_x.data(), R3.data()); 133| 2.59k| return Self::redc(z); 134| 2.59k| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE18conditional_assignENS_2CT6ChoiceERKSA_: 369| 40.6k| constexpr void conditional_assign(CT::Choice cond, const Self& nx) { 370| 40.6k| const W mask = cond.into_bitmask(); 371| | 372| 284k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (372:28): [True: 243k, False: 40.6k] ------------------ 373| 243k| m_val[i] = Botan::choose(mask, nx.m_val[i], m_val[i]); 374| 243k| } 375| 40.6k| } pcurves_brainpool384r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm7EEC2INS_18BlindingRandomnessIS5_Lm1EEEEERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsESA_E12ScalarParamsEEEEERKT_m: 1368| 351| BlindedScalarBits(const typename C::Scalar& scalar, const Randomness& randomness, size_t idx = 0) { 1369| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1370| 351| if(BlindingBits > 0 && randomness.seeded()) { ------------------ | Branch (1370:13): [True: 351, Folded] | Branch (1370:33): [True: 351, False: 0] ------------------ 1371| 351| constexpr size_t n_words = C::Words; 1372| | 1373| 351| W mask[n_words] = {0}; 1374| 351| load_le(mask, randomness.mask(idx).data(), MaskWords); 1375| | 1376| | // Mask to exactly BlindingBits 1377| 351| constexpr size_t ExcessBits = MaskWords * WordInfo::bits - BlindingBits; 1378| 351| if constexpr(ExcessBits > 0) { 1379| 351| constexpr W ExcessMask = (static_cast(1) << (WordInfo::bits - ExcessBits)) - 1; 1380| 351| mask[MaskWords - 1] &= ExcessMask; 1381| 351| } 1382| | 1383| | // Set top and bottom bits of mask 1384| 351| constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo::bits; 1385| 351| mask[(BlindingBits - 1) / WordInfo::bits] |= static_cast(1) << TopMaskBit; 1386| 351| mask[0] |= 1; 1387| | 1388| 351| W mask_n[2 * n_words] = {0}; 1389| | 1390| 351| const auto sw = scalar.to_words(); 1391| | 1392| | // Compute masked scalar s + k*n 1393| 351| comba_mul(mask_n, mask, C::NW.data()); 1394| 351| bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size()); 1395| | 1396| 351| std::reverse(mask_n, mask_n + 2 * n_words); 1397| 351| m_bytes = store_be>(mask_n); 1398| 351| m_bits = C::Scalar::BITS + BlindingBits; 1399| 351| } else { 1400| | // No RNG available, skip blinding 1401| 0| m_bytes.resize(C::Scalar::BYTES); 1402| 0| scalar.serialize_to(std::span{m_bytes}.template first()); 1403| 0| m_bits = C::Scalar::BITS; 1404| 0| } 1405| | 1406| 351| CT::poison(m_bytes.data(), m_bytes.size()); 1407| 351| } pcurves_brainpool384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm7EEELm1EE6seededEv: 1476| 351| bool seeded() const { return m_seeded; } pcurves_brainpool384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm7EEELm1EE4maskEm: 1478| 351| std::span mask(size_t idx) const { 1479| 351| BOTAN_ASSERT_NOMSG(idx < Scalars); ------------------ | | 84| 351| do { \ | | 85| 351| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 351| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 351] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 351| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 351] | | ------------------ ------------------ 1480| 351| return std::span{m_masks}.subspan(idx * MaskBytes).template first(); 1481| 351| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E12ScalarParamsEEEE8to_wordsEv: 736| 519| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_brainpool384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES0_E12ScalarParamsEE8from_repERKNSt3__15arrayImLm6EEE: 139| 870| constexpr static std::array from_rep(const std::array& z) { 140| 870| std::array ze = {}; 141| 870| copy_mem(std::span{ze}.template first(), z); 142| 870| return Self::redc(ze); 143| 870| } pcurves_brainpool384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES0_E12ScalarParamsEE4redcERKNSt3__15arrayImLm12EEE: 106| 1.22k| constexpr static std::array redc(const std::array& z) { 107| | if constexpr(P_dash == 1) { 108| | return monty_redc_pdash1(z, P); 109| 1.22k| } else { 110| 1.22k| return monty_redc(z, P, P_dash); 111| 1.22k| } 112| 1.22k| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E12ScalarParamsEEEE12serialize_toENSt3__14spanIhLm48EEE: 741| 351| constexpr void serialize_to(std::span bytes) const { 742| 351| auto v = Rep::from_rep(m_val); 743| 351| std::reverse(v.begin(), v.end()); 744| | 745| 351| if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| 351| 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| 351| } pcurves_brainpool384r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm7EE4bitsEv: 1362| 351| size_t bits() const { return m_bits; } pcurves_brainpool384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E18conditional_assignENS_2CT6ChoiceERKSC_: 1095| 519| constexpr void conditional_assign(CT::Choice cond, const Self& pt) { 1096| 519| FieldElement::conditional_assign(m_x, m_y, m_z, cond, pt.x(), pt.y(), pt.z()); 1097| 519| } pcurves_brainpool384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E6negateEv: 1194| 519| constexpr Self negate() const { return Self(x(), y().negate(), z()); } pcurves_brainpool384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E18_const_time_poisonEv: 1226| 519| constexpr void _const_time_poison() const { CT::poison_all(m_x, m_y, m_z); } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE18_const_time_poisonEv: 891| 1.55k| constexpr void _const_time_poison() const { CT::poison(m_val); } pcurves_brainpool384r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm7EE10get_windowEm: 1409| 25.6k| size_t get_window(size_t offset) const { 1410| | // Extract a WindowBits sized window out of s, depending on offset. 1411| 25.6k| return read_window_bits(std::span{m_bytes}, offset); 1412| 25.6k| } pcurves_brainpool384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E10add_or_subERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceE: 1121| 25.2k| constexpr static Self add_or_sub(const Self& a, const AffinePoint& b, CT::Choice sub) { 1122| 25.2k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), A); 1123| 25.2k| } pcurves_brainpool384r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEEE9ct_selectENSt3__14spanIKSC_Lm18446744073709551615EEEm: 966| 40.2k| static constexpr auto ct_select(std::span pts, size_t idx) { 967| 40.2k| auto result = Self::identity(pts[0]); 968| | 969| | // Intentionally wrapping; set to maximum size_t if idx == 0 970| 40.2k| const size_t idx1 = idx - 1; 971| 1.09M| for(size_t i = 0; i != pts.size(); ++i) { ------------------ | Branch (971:28): [True: 1.05M, False: 40.2k] ------------------ 972| 1.05M| const auto found = CT::Mask::is_equal(idx1, i).as_choice(); 973| 1.05M| result.conditional_assign(found, pts[i]); 974| 1.05M| } 975| | 976| 40.2k| return result; 977| 40.2k| } pcurves_brainpool384r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEEE8identityERKSC_: 935| 40.2k| static constexpr Self identity(const Self& /*unused*/) { 936| 40.2k| return Self(FieldElement::zero(), FieldElement::zero()); 937| 40.2k| } pcurves_brainpool384r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEEE18conditional_assignENS_2CT6ChoiceERKSC_: 992| 1.05M| constexpr void conditional_assign(CT::Choice cond, const Self& pt) { 993| 1.05M| FieldElement::conditional_assign(m_x, m_y, cond, pt.x(), pt.y()); 994| 1.05M| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE18conditional_assignERSA_SB_NS_2CT6ChoiceERKSA_SF_: 382| 1.05M| static constexpr void conditional_assign(Self& x, Self& y, CT::Choice cond, const Self& nx, const Self& ny) { 383| 1.05M| const W mask = cond.into_bitmask(); 384| | 385| 7.37M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (385:28): [True: 6.32M, False: 1.05M] ------------------ 386| 6.32M| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 387| 6.32M| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 388| 6.32M| } 389| 1.05M| } pcurves_brainpool384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm7EEELm1EE13randomize_repERNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS4_6ParamsESA_E11FieldParamsEEEEESC_EEm: 1486| 1.40k| void randomize_rep(typename C::ProjectivePoint& pt, size_t idx) const { 1487| 1.40k| BOTAN_ASSERT_NOMSG(idx < Rerandomizations); ------------------ | | 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] | | ------------------ ------------------ 1488| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1489| 1.40k| if(m_seeded) { ------------------ | Branch (1489:13): [True: 1.40k, False: 0] ------------------ 1490| 1.40k| pt.randomize_rep(m_rerandomizers[idx]); 1491| 1.40k| } 1492| 1.40k| } pcurves_brainpool384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E13randomize_repERKSB_: 1202| 2.07k| void randomize_rep(const FieldElement& r) { 1203| 2.07k| const auto r2 = r.square(); 1204| 2.07k| const auto r3 = r2 * r; 1205| | 1206| 2.07k| m_x *= r2; 1207| 2.07k| m_y *= r3; 1208| 2.07k| m_z *= r; 1209| 2.07k| } pcurves_brainpool384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E20_const_time_unpoisonEv: 1228| 519| constexpr void _const_time_unpoison() const { CT::unpoison_all(m_x, m_y, m_z); } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE20_const_time_unpoisonEv: 893| 1.55k| constexpr void _const_time_unpoison() const { CT::unpoison(m_val); } pcurves_brainpool384r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm7EED2Ev: 1414| 351| ~BlindedScalarBits() { 1415| 351| secure_zeroize_buffer(m_bytes.data(), m_bytes.size()); 1416| 351| CT::unpoison(m_bytes.data(), m_bytes.size()); 1417| 351| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E12ScalarParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE: 776| 1.22k| static Self from_stash(const std::array& stash) { 777| 1.22k| static_assert(L >= N); 778| 1.22k| std::array val = {}; 779| 8.54k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 7.32k, False: 1.22k] ------------------ 780| 7.32k| val[i] = stash[i]; 781| 7.32k| } 782| 1.22k| return Self(val); 783| 1.22k| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E12ScalarParamsEEEEC2ENSt3__15arrayImLm6EEE: 908| 1.57k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE12serialize_toENSt3__14spanIhLm48EEE: 741| 2.21k| constexpr void serialize_to(std::span bytes) const { 742| 2.21k| auto v = Rep::from_rep(m_val); 743| 2.21k| std::reverse(v.begin(), v.end()); 744| | 745| 2.21k| if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| 2.21k| 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| 2.21k| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E12ScalarParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 351| std::array stash_value() const { 762| 351| static_assert(L >= N); 763| 351| std::array stash = {}; 764| 2.45k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 2.10k, False: 351] ------------------ 765| 2.10k| stash[i] = m_val[i]; 766| 2.10k| } 767| 351| return stash; 768| 351| } pcurves_brainpool384r1.cpp:_ZN5Botan12varpoint_mulINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm4EEENT_15ProjectivePointERKNS5_11AffinePointERKNS5_6ScalarERNS_21RandomNumberGeneratorE: 1680| 168| RandomNumberGenerator& rng) { 1681| 168| using ProjectivePoint = typename C::ProjectivePoint; 1682| | 1683| 168| constexpr size_t TableBits = W; 1684| 168| static_assert(TableBits >= 1 && TableBits <= 7); 1685| | 1686| 168| constexpr size_t WindowBits = TableBits + 1; 1687| | 1688| 168| using BlindedScalar = BlindedScalarBits; 1689| 168| using Blinding = BlindingRandomness; 1690| | 1691| | // 2^W elements [1*P, 2*P, ..., 2^W*P] 1692| 168| constexpr size_t TableSize = 1 << TableBits; 1693| | 1694| 168| const Blinding blinding(rng); 1695| 168| const SharedZPointTable table(p, TableSize, C::A, blinding.isomorphism()); 1696| 168| const BlindedScalar bits(s, blinding); 1697| | 1698| 168| const size_t scalar_bits = bits.bits(); 1699| 168| const size_t full_windows = booth_full_windows(scalar_bits + 1, WindowBits); 1700| 168| const size_t initial_shift = booth_initial_shift(scalar_bits + 1, WindowBits); 1701| | 1702| 168| BOTAN_DEBUG_ASSERT(full_windows * WindowBits + initial_shift == scalar_bits + 1); ------------------ | | 137| 168| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 168| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 168] | | ------------------ ------------------ 1703| 168| BOTAN_DEBUG_ASSERT(initial_shift > 0); ------------------ | | 137| 168| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 168| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 168] | | ------------------ ------------------ 1704| | 1705| 168| auto accum = ProjectivePoint::identity(); 1706| 168| CT::poison(accum); 1707| | 1708| 14.6k| for(size_t i = 0; i != full_windows; ++i) { ------------------ | Branch (1708:22): [True: 14.4k, False: 168] ------------------ 1709| 14.4k| const size_t idx = scalar_bits - initial_shift - WindowBits * i; 1710| | 1711| 14.4k| const size_t w_i = bits.get_window(idx); 1712| 14.4k| const auto [tidx, tneg] = booth_recode(w_i); 1713| | 1714| | // Conditional ok: loop iteration count is public 1715| 14.4k| if(i == 0) { ------------------ | Branch (1715:10): [True: 168, False: 14.2k] ------------------ 1716| 168| accum = ProjectivePoint::from_affine(table.ct_select(tidx)); 1717| 168| accum.conditional_assign(tneg, accum.negate()); 1718| 14.2k| } else { 1719| 14.2k| accum = ProjectivePoint::add_or_sub_iso(accum, table.ct_select(tidx), tneg, table.a()); 1720| 14.2k| } 1721| | 1722| 14.4k| accum = accum.dbl_n_iso(table.a(), WindowBits); 1723| | 1724| | // Conditional ok: loop iteration count is public 1725| 14.4k| if(i < Blinding::Rerandomizations) { ------------------ | Branch (1725:10): [True: 672, False: 13.7k] ------------------ 1726| 672| blinding.randomize_rep(accum, i); 1727| 672| } 1728| 14.4k| } 1729| | 1730| | // final window (note one bit shorter than previous reads) 1731| 168| const size_t w_l = bits.get_window(0) & ((1 << WindowBits) - 1); 1732| 168| const auto [tidx, tneg] = booth_recode(w_l << 1); 1733| 168| accum = ProjectivePoint::add_or_sub_iso(accum, table.ct_select(tidx), tneg, table.a()); 1734| | 1735| 168| CT::unpoison(accum); 1736| | 1737| | // Map back from the isomorphic curve 1738| 168| return ProjectivePoint(accum.x(), accum.y(), accum.z() * table.z()); 1739| 168|} pcurves_brainpool384r1.cpp:_ZN5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6EEELm1EEC2ERNS_21RandomNumberGeneratorE: 1455| 168| explicit BlindingRandomness(RandomNumberGenerator& rng) : m_seeded(rng.is_seeded()) { 1456| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1457| 168| if(m_seeded) { ------------------ | Branch (1457:13): [True: 168, False: 0] ------------------ 1458| 168| std::array buf{}; 1459| 168| rng.randomize(buf); 1460| | 1461| 168| const std::span bytes(buf); 1462| | 1463| 168| copy_mem(m_masks, bytes.first()); 1464| | 1465| 840| for(size_t i = 0; i != Rerandomizations; ++i) { ------------------ | Branch (1465:31): [True: 672, False: 168] ------------------ 1466| 672| const auto wide = bytes.subspan(Scalars * MaskBytes + i * WideBytes).first(); 1467| 672| m_rerandomizers[i] = FieldElement::from_wide_bytes(wide); 1468| 672| } 1469| | 1470| 168| const auto iso = bytes.subspan(Scalars * MaskBytes + Rerandomizations * WideBytes).first(); 1471| 168| m_isomorphism = FieldElement::from_wide_bytes(iso); 1472| 168| m_isomorphism.conditional_assign(m_isomorphism.is_zero(), FieldElement::one()); 1473| 168| } 1474| 168| } pcurves_brainpool384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6EEELm1EE11isomorphismEv: 1497| 168| const FieldElement& isomorphism() const { return m_isomorphism; } pcurves_brainpool384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E11add_mixed_hERKSC_RKNS_16AffineCurvePointISB_EE: 1116| 2.35k| constexpr static std::pair add_mixed_h(const Self& a, const AffinePoint& b) { 1117| 2.35k| return point_add_mixed_h(a, b, FieldElement::one(), A); 1118| 2.35k| } pcurves_brainpool384r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6EEC2INS_18BlindingRandomnessIS5_Lm1EEEEERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsESA_E12ScalarParamsEEEEERKT_m: 1368| 168| BlindedScalarBits(const typename C::Scalar& scalar, const Randomness& randomness, size_t idx = 0) { 1369| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1370| 168| if(BlindingBits > 0 && randomness.seeded()) { ------------------ | Branch (1370:13): [True: 168, Folded] | Branch (1370:33): [True: 168, False: 0] ------------------ 1371| 168| constexpr size_t n_words = C::Words; 1372| | 1373| 168| W mask[n_words] = {0}; 1374| 168| load_le(mask, randomness.mask(idx).data(), MaskWords); 1375| | 1376| | // Mask to exactly BlindingBits 1377| 168| constexpr size_t ExcessBits = MaskWords * WordInfo::bits - BlindingBits; 1378| 168| if constexpr(ExcessBits > 0) { 1379| 168| constexpr W ExcessMask = (static_cast(1) << (WordInfo::bits - ExcessBits)) - 1; 1380| 168| mask[MaskWords - 1] &= ExcessMask; 1381| 168| } 1382| | 1383| | // Set top and bottom bits of mask 1384| 168| constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo::bits; 1385| 168| mask[(BlindingBits - 1) / WordInfo::bits] |= static_cast(1) << TopMaskBit; 1386| 168| mask[0] |= 1; 1387| | 1388| 168| W mask_n[2 * n_words] = {0}; 1389| | 1390| 168| const auto sw = scalar.to_words(); 1391| | 1392| | // Compute masked scalar s + k*n 1393| 168| comba_mul(mask_n, mask, C::NW.data()); 1394| 168| bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size()); 1395| | 1396| 168| std::reverse(mask_n, mask_n + 2 * n_words); 1397| 168| m_bytes = store_be>(mask_n); 1398| 168| m_bits = C::Scalar::BITS + BlindingBits; 1399| 168| } else { 1400| | // No RNG available, skip blinding 1401| 0| m_bytes.resize(C::Scalar::BYTES); 1402| 0| scalar.serialize_to(std::span{m_bytes}.template first()); 1403| 0| m_bits = C::Scalar::BITS; 1404| 0| } 1405| | 1406| 168| CT::poison(m_bytes.data(), m_bytes.size()); 1407| 168| } pcurves_brainpool384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6EEELm1EE6seededEv: 1476| 168| bool seeded() const { return m_seeded; } pcurves_brainpool384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6EEELm1EE4maskEm: 1478| 168| std::span mask(size_t idx) const { 1479| 168| BOTAN_ASSERT_NOMSG(idx < Scalars); ------------------ | | 84| 168| do { \ | | 85| 168| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 168| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 168] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 168| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 168] | | ------------------ ------------------ 1480| 168| return std::span{m_masks}.subspan(idx * MaskBytes).template first(); 1481| 168| } pcurves_brainpool384r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6EE4bitsEv: 1362| 168| size_t bits() const { return m_bits; } pcurves_brainpool384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E8identityEv: 1049| 168| static constexpr Self identity() { return Self(FieldElement::zero(), FieldElement::one(), FieldElement::zero()); } pcurves_brainpool384r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6EE10get_windowEm: 1409| 14.6k| size_t get_window(size_t offset) const { 1410| | // Extract a WindowBits sized window out of s, depending on offset. 1411| 14.6k| return read_window_bits(std::span{m_bytes}, offset); 1412| 14.6k| } pcurves_brainpool384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E14add_or_sub_isoERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceERKSB_: 1131| 14.4k| const FieldElement& curve_a) { 1132| 14.4k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), curve_a); 1133| 14.4k| } pcurves_brainpool384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEES7_E9dbl_n_isoERKSB_m: 1159| 14.4k| constexpr Self dbl_n_iso(const FieldElement& a, size_t n) const { 1160| | if constexpr(Self::A_is_zero) { 1161| | return dbl_n_a_zero(*this, n); 1162| 14.4k| } else { 1163| 14.4k| return dbl_n_generic(*this, a, n); 1164| 14.4k| } 1165| 14.4k| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE4div2Ev: 304| 14.4k| 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| 14.4k| 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| 14.4k| std::array t = value(); 312| 14.4k| const W borrow = shift_right<1>(t); 313| | 314| | // If value was odd, add (P/2)+1 315| 14.4k| const auto mask = CT::Mask::expand(borrow).value(); 316| | 317| 14.4k| W carry = 0; 318| | 319| 101k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (319:28): [True: 86.6k, False: 14.4k] ------------------ 320| 86.6k| t[i] = word_add(t[i], INV_2[i] & mask, &carry); 321| 86.6k| } 322| | 323| 14.4k| return Self(t); 324| 14.4k| } pcurves_brainpool384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6EEELm1EE13randomize_repERNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS4_6ParamsESA_E11FieldParamsEEEEESC_EEm: 1486| 672| void randomize_rep(typename C::ProjectivePoint& pt, size_t idx) const { 1487| 672| BOTAN_ASSERT_NOMSG(idx < Rerandomizations); ------------------ | | 84| 672| do { \ | | 85| 672| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 672| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 672] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 672| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 672] | | ------------------ ------------------ 1488| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1489| 672| if(m_seeded) { ------------------ | Branch (1489:13): [True: 672, False: 0] ------------------ 1490| 672| pt.randomize_rep(m_rerandomizers[idx]); 1491| 672| } 1492| 672| } pcurves_brainpool384r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6EED2Ev: 1414| 168| ~BlindedScalarBits() { 1415| 168| secure_zeroize_buffer(m_bytes.data(), m_bytes.size()); 1416| 168| CT::unpoison(m_bytes.data(), m_bytes.size()); 1417| 168| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE: 776| 5.48k| static Self from_stash(const std::array& stash) { 777| 5.48k| static_assert(L >= N); 778| 5.48k| std::array val = {}; 779| 38.3k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 32.8k, False: 5.48k] ------------------ 780| 32.8k| val[i] = stash[i]; 781| 32.8k| } 782| 5.48k| return Self(val); 783| 5.48k| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E12ScalarParamsEEEE7is_zeroEv: 227| 702| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 593| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 593| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 593] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 593| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 593| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 19, False: 574] ------------------ 804| 19| return {}; 805| 19| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 574| return Self::from_words(words); 809| 593| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEEeqERKSA_: 724| 748| constexpr CT::Choice operator==(const Self& other) const { 725| 748| return CT::is_equal(this->data(), other.data(), N).as_choice(); 726| 748| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE10from_wordsILm6EEESA_NSt3__15arrayImXT_EEE: 213| 574| static constexpr Self from_words(std::array w) { 214| 574| if constexpr(L == N) { 215| 574| 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| 574| } pcurves_brainpool384r1.cpp:_ZN5Botan13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsENS_13MontgomeryRepEE7x3_ax_bERKNS_6IntModINS5_INS6_11FieldParamsEEEEE: 1327| 748| static constexpr FieldElement x3_ax_b(const FieldElement& x) { return (x.square() + A) * x + B; } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE4sqrtEv: 665| 222| constexpr CT::Option sqrt() const { 666| 222| if constexpr(Self::P_MOD_4 == 3) { 667| | // The easy case for square root is when p == 3 (mod 4) 668| | 669| 222| constexpr auto P_PLUS_1_OVER_4 = p_plus_1_over_4(P); 670| 222| auto z = pow_vartime(P_PLUS_1_OVER_4); 671| | 672| | // Zero out the return value if it would otherwise be incorrect 673| 222| const CT::Choice correct = (z.square() == *this); 674| 222| z.conditional_assign(!correct, Self::zero()); 675| 222| return CT::Option(z, correct); 676| | } 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| | constexpr auto C1_C2 = shanks_tonelli_c1c2(Self::P); 688| | constexpr std::array C3 = shanks_tonelli_c3(C1_C2.second); 689| | constexpr std::array P_MINUS_1_OVER_2 = p_minus_1_over_2(Self::P); 690| | constexpr Self C4 = shanks_tonelli_c4(P_MINUS_1_OVER_2); 691| | constexpr Self C5 = C4.pow_vartime(C1_C2.second); 692| | 693| | const Self& x = (*this); 694| | 695| | auto z = x.pow_vartime(C3); 696| | auto t = z.square(); 697| | t *= x; 698| | z *= x; 699| | auto b = t; 700| | auto c = C5; 701| | 702| | for(size_t i = C1_C2.first; i >= 2; i--) { 703| | b.square_n(i - 2); 704| | const CT::Choice e = b.is_one(); 705| | z.conditional_assign(!e, z * c); 706| | c.square_n(1); 707| | t.conditional_assign(!e, t * c); 708| | b = t; 709| | } 710| | 711| | // Zero out the return value if it would otherwise be incorrect 712| | const CT::Choice correct = (z.square() == *this); 713| | z.conditional_assign(!correct, Self::zero()); 714| | return CT::Option(z, correct); 715| | } 716| 222| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE12correct_signENS_2CT6ChoiceE: 250| 168| constexpr Self correct_sign(CT::Choice even) const { 251| 168| const auto flip = (even != this->is_even()); 252| 168| return Self::choose(flip, this->negate(), *this); 253| 168| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE7is_evenEv: 242| 168| constexpr CT::Choice is_even() const { 243| 168| auto v = Rep::from_rep(m_val); 244| 168| return !CT::Choice::from_int(v[0] & 0x01); 245| 168| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E11FieldParamsEEEE6chooseENS_2CT6ChoiceERKSA_SE_: 258| 168| static constexpr Self choose(CT::Choice choice, const Self& x, const Self& y) { 259| 168| auto r = y; 260| 168| r.conditional_assign(choice, x); 261| 168| return r; 262| 168| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E12ScalarParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 652| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 652| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 652] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 652| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 652| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 301, False: 351] ------------------ 804| 301| return {}; 805| 301| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 351| return Self::from_words(words); 809| 652| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E12ScalarParamsEEEE10from_wordsILm6EEESA_NSt3__15arrayImXT_EEE: 213| 351| static constexpr Self from_words(std::array w) { 214| 351| if constexpr(L == N) { 215| 351| 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| 351| } pcurves_brainpool384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES0_E12ScalarParamsEE6to_repERKNSt3__15arrayImLm6EEE: 117| 351| constexpr static std::array to_rep(const std::array& x) { 118| 351| std::array z; // NOLINT(*-member-init) 119| 351| comba_mul(z.data(), x.data(), R2.data()); 120| 351| return Self::redc(z); 121| 351| } pcurves_brainpool384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES2_E11FieldParamsEEEEEE12serialize_toENSt3__14spanIhLm97EEE: 952| 1.02k| constexpr void serialize_to(std::span bytes) const { 953| 1.02k| BOTAN_STATE_CHECK(this->is_identity().as_bool() == false); ------------------ | | 51| 1.02k| do { \ | | 52| 1.02k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 1.02k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 1.02k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 1.02k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 1.02k] | | ------------------ ------------------ 954| 1.02k| BufferStuffer pack(bytes); 955| 1.02k| pack.append(0x04); 956| 1.02k| x().serialize_to(pack.next()); 957| 1.02k| y().serialize_to(pack.next()); 958| 1.02k| BOTAN_DEBUG_ASSERT(pack.full()); ------------------ | | 137| 1.02k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.02k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.02k] | | ------------------ ------------------ 959| 1.02k| } pcurves_brainpool384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E12ScalarParamsEEEE6randomERNS_21RandomNumberGeneratorE: 853| 351| static Self random(RandomNumberGenerator& rng) { 854| 351| constexpr size_t MAX_ATTEMPTS = 1000; 855| | 856| 351| std::array buf{}; 857| | 858| 652| for(size_t i = 0; i != MAX_ATTEMPTS; ++i) { ------------------ | Branch (858:28): [True: 652, False: 0] ------------------ 859| 652| rng.randomize(buf); 860| | 861| | // Zero off high bits that if set would certainly cause us 862| | // to be out of range 863| | if constexpr(Self::BITS % 8 != 0) { 864| | constexpr uint8_t mask = 0xFF >> (8 - (Self::BITS % 8)); 865| | buf[0] &= mask; 866| | } 867| | 868| | // Conditionals ok: rejection sampling reveals only values we didn't use 869| 652| if(auto s = Self::deserialize(buf)) { ------------------ | Branch (869:21): [True: 351, False: 301] ------------------ 870| 351| if(s.value().is_nonzero().as_bool()) { ------------------ | Branch (870:19): [True: 351, False: 0] ------------------ 871| 351| return s.value(); 872| 351| } 873| 351| } 874| 652| } 875| | 876| 0| throw Internal_Error("Failed to generate random Scalar within bounded number of attempts"); 877| 351| } pcurves_brainpool384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool384r16ParamsES1_E12ScalarParamsEEEE10is_nonzeroEv: 232| 351| constexpr CT::Choice is_nonzero() const { return !is_zero(); } pcurves_brainpool512r1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1630| 1| m_table(basemul_booth_setup(p, BlindedScalar::Bits + 1)) {} pcurves_brainpool512r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E11from_affineERKNS_16AffineCurvePointISB_EE: 1027| 772| 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| 772| const auto x = pt.x(); 1038| 772| auto y = pt.y(); 1039| 772| auto z = FieldElement::one(); 1040| | 1041| 772| FieldElement::conditional_swap(pt.is_identity(), y, z); 1042| | 1043| 772| return ProjectiveCurvePoint(x, y, z); 1044| 772| } pcurves_brainpool512r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEEE1xEv: 982| 1.65M| constexpr const FieldElement& x() const { return m_x; } pcurves_brainpool512r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEEE1yEv: 987| 1.59M| constexpr const FieldElement& y() const { return m_y; } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE3oneEv: 202| 63.5k| static constexpr Self one() { return Self(Rep::one()); } pcurves_brainpool512r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES0_E11FieldParamsEE3oneEv: 101| 63.5k| constexpr static std::array one() { return R1; } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEEC2ENSt3__15arrayImLm8EEE: 908| 3.32M| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 412| 772| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 413| 772| const W mask = cond.into_bitmask(); 414| | 415| 6.94k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (415:28): [True: 6.17k, False: 772] ------------------ 416| 6.17k| const auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 417| 6.17k| const auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 418| 6.17k| x.m_val[i] = nx; 419| 6.17k| y.m_val[i] = ny; 420| 6.17k| } 421| 772| } pcurves_brainpool512r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEEE11is_identityEv: 939| 64.1k| constexpr CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE7is_zeroEv: 227| 319k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_brainpool512r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_EC2ERKSB_SE_SE_: 1067| 90.5k| m_x(x), m_y(y), m_z(z) {} pcurves_brainpool512r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E3dblEv: 1181| 1.86k| constexpr Self dbl() const { 1182| | if constexpr(Self::A_is_minus_3) { 1183| | return dbl_a_minus_3(*this); 1184| | } else if constexpr(Self::A_is_zero) { 1185| | return dbl_a_zero(*this); 1186| 1.86k| } else { 1187| 1.86k| return dbl_generic(*this, A); 1188| 1.86k| } 1189| 1.86k| } pcurves_brainpool512r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E1zEv: 1224| 357k| constexpr const FieldElement& z() const { return m_z; } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE6squareEv: 428| 761k| constexpr BOTAN_FORCE_INLINE Self square() const { 429| 761k| std::array z; // NOLINT(*-member-init) 430| 761k| comba_sqr(z.data(), this->data()); 431| 761k| return Self(Rep::redc(z)); 432| 761k| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE4dataEv: 898| 3.51M| constexpr const W* data() const { return m_val.data(); } pcurves_brainpool512r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES0_E11FieldParamsEE4redcERKNSt3__15arrayImLm16EEE: 106| 2.32M| constexpr static std::array redc(const std::array& z) { 107| | if constexpr(P_dash == 1) { 108| | return monty_redc_pdash1(z, P); 109| 2.32M| } else { 110| 2.32M| return monty_redc(z, P, P_dash); 111| 2.32M| } 112| 2.32M| } pcurves_brainpool512r1.cpp:_ZN5BotanplERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEEESC_: 267| 312k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 268| 312k| std::array t; // NOLINT(*-member-init) 269| | 270| 312k| W carry = 0; 271| 2.81M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (271:28): [True: 2.50M, False: 312k] ------------------ 272| 2.50M| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 273| 2.50M| } 274| | 275| 312k| std::array r; // NOLINT(*-member-init) 276| 312k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 277| 312k| return Self(r); 278| 312k| } pcurves_brainpool512r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E1xEv: 1214| 224k| constexpr const FieldElement& x() const { return m_x; } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE4mul3Ev: 337| 124k| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_brainpool512r1.cpp:_ZN5BotanmlERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEEESC_: 348| 825k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 349| 825k| std::array z; // NOLINT(*-member-init) 350| 825k| comba_mul(z.data(), a.data(), b.data()); 351| 825k| return Self(Rep::redc(z)); 352| 825k| } pcurves_brainpool512r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E1yEv: 1219| 224k| constexpr const FieldElement& y() const { return m_y; } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE4mul4Ev: 340| 1.86k| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_brainpool512r1.cpp:_ZN5BotanmiERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEEESC_: 283| 745k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 284| 745k| std::array r; // NOLINT(*-member-init) 285| 745k| W carry = 0; 286| 6.70M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (286:28): [True: 5.96M, False: 745k] ------------------ 287| 5.96M| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 288| 5.96M| } 289| | 290| 745k| const auto mask = CT::Mask::expand(carry).value(); 291| | 292| 745k| carry = 0; 293| | 294| 6.70M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (294:28): [True: 5.96M, False: 745k] ------------------ 295| 5.96M| r[i] = word_add(r[i], P[i] & mask, &carry); 296| 5.96M| } 297| | 298| 745k| return Self(r); 299| 745k| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE4mul2Ev: 327| 406k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 328| 406k| std::array t = value(); 329| 406k| const W carry = shift_left<1>(t); 330| | 331| 406k| std::array r; // NOLINT(*-member-init) 332| 406k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 333| 406k| return Self(r); 334| 406k| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE5valueEv: 896| 431k| constexpr const std::array& value() const { return m_val; } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE4mul8Ev: 343| 1.86k| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_brainpool512r1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_EESE_: 1075| 1.45k| friend constexpr Self operator+(const Self& a, const Self& b) { return Self::add(a, b); } pcurves_brainpool512r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E3addERKSC_SE_: 1138| 1.45k| constexpr static Self add(const Self& a, const Self& b) { return point_add(a, b); } pcurves_brainpool512r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E11is_identityEv: 1093| 66.8k| constexpr CT::Choice is_identity() const { return z().is_zero(); } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE18conditional_assignERSA_SB_SB_NS_2CT6ChoiceERKSA_SF_SF_: 397| 124k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 398| 124k| const W mask = cond.into_bitmask(); 399| | 400| 1.12M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (400:28): [True: 997k, False: 124k] ------------------ 401| 997k| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 402| 997k| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 403| 997k| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 404| 997k| } 405| 124k| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE6invertEv: 540| 558| constexpr Self invert() const { return pow_vartime(Self::P_MINUS_2); } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE11pow_vartimeERKNSt3__15arrayImLm8EEE: 479| 817| constexpr Self pow_vartime(const std::array& exp) const { 480| 817| constexpr size_t WindowBits = (Self::BITS <= 256) ? 4 : 5; ------------------ | Branch (480:40): [Folded, False: 817] ------------------ 481| 817| constexpr size_t WindowElements = (1 << WindowBits) - 1; 482| | 483| 817| 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| 817| std::array tbl; 492| | 493| 817| tbl[0] = (*this); 494| | 495| 25.3k| for(size_t i = 1; i != WindowElements; ++i) { ------------------ | Branch (495:28): [True: 24.5k, False: 817] ------------------ 496| | // Conditional ok: table indexes are public here 497| 24.5k| if(i % 2 == 1) { ------------------ | Branch (497:16): [True: 12.2k, False: 12.2k] ------------------ 498| 12.2k| tbl[i] = tbl[i / 2].square(); 499| 12.2k| } else { 500| 12.2k| tbl[i] = tbl[i - 1] * tbl[0]; 501| 12.2k| } 502| 24.5k| } 503| | 504| 817| auto r = Self::one(); 505| | 506| 817| const size_t w0 = read_window_bits(std::span{exp}, (Windows - 1) * WindowBits); 507| | 508| | // Conditional ok: this function is variable time 509| 817| if(w0 > 0) { ------------------ | Branch (509:13): [True: 558, False: 259] ------------------ 510| 558| r = tbl[w0 - 1]; 511| 558| } 512| | 513| 84.1k| for(size_t i = 1; i != Windows; ++i) { ------------------ | Branch (513:28): [True: 83.3k, False: 817] ------------------ 514| 83.3k| r.square_n(WindowBits); 515| | 516| 83.3k| const size_t w = read_window_bits(std::span{exp}, (Windows - i - 1) * WindowBits); 517| | 518| | // Conditional ok: this function is variable time 519| 83.3k| if(w > 0) { ------------------ | Branch (519:16): [True: 80.9k, False: 2.41k] ------------------ 520| 80.9k| r *= tbl[w - 1]; 521| 80.9k| } 522| 83.3k| } 523| | 524| 817| return r; 525| 817| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEEC2Ev: 182| 27.5k| constexpr IntMod() : m_val({}) {} pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE8square_nEm: 441| 83.3k| constexpr void square_n(size_t n) { 442| 83.3k| std::array z; // NOLINT(*-member-init) 443| 500k| for(size_t i = 0; i != n; ++i) { ------------------ | Branch (443:28): [True: 416k, False: 83.3k] ------------------ 444| 416k| comba_sqr(z.data(), this->data()); 445| 416k| m_val = Rep::redc(z); 446| 416k| } 447| 83.3k| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEEmLERKSA_: 357| 310k| constexpr BOTAN_FORCE_INLINE Self& operator*=(const Self& other) { 358| 310k| std::array z; // NOLINT(*-member-init) 359| 310k| comba_mul(z.data(), data(), other.data()); 360| 310k| m_val = Rep::redc(z); 361| 310k| return (*this); 362| 310k| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_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| 366| for(;;) { 620| | // Conditional ok: this function is variable time 621| 366| if(a.m_val == b.m_val) { ------------------ | Branch (621:16): [True: 1, False: 365] ------------------ 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| 365| 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| 365| std::array r; // NOLINT(*-member-init) 642| 365| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 643| | 644| | // Conditional ok: this function is variable time 645| 365| if(carry == 0) { ------------------ | Branch (645:16): [True: 175, False: 190] ------------------ 646| | // b > a 647| 175| b.m_val = r; 648| 175| x = nx; 649| 175| Self::_invert_vartime_div2_helper(b, x); 650| 190| } else { 651| | // We know this can't underflow because a > b 652| 190| bigint_sub3(r.data(), a.data(), N, b.data(), N); 653| 190| a.m_val = r; 654| 190| y = nx; 655| 190| Self::_invert_vartime_div2_helper(a, y); 656| 190| } 657| 365| } 658| 1| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE4zeroEv: 197| 117k| static constexpr Self zero() { return Self(std::array{0}); } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE8to_wordsEv: 736| 1| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_brainpool512r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES0_E11FieldParamsEE8from_repERKNSt3__15arrayImLm8EEE: 139| 2.82k| constexpr static std::array from_rep(const std::array& z) { 140| 2.82k| std::array ze = {}; 141| 2.82k| copy_mem(std::span{ze}.template first(), z); 142| 2.82k| return Self::redc(ze); 143| 2.82k| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE27_invert_vartime_div2_helperERSA_SB_: 549| 367| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 550| 367| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 551| | 552| | // Conditional ok: this function is variable time 553| 1.08k| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (553:16): [True: 713, False: 367] ------------------ 554| 713| shift_right<1>(a.m_val); 555| | 556| 713| const W borrow = shift_right<1>(x.m_val); 557| | 558| | // Conditional ok: this function is variable time 559| 713| if(borrow) { ------------------ | Branch (559:16): [True: 362, False: 351] ------------------ 560| 362| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 561| 362| } 562| 713| } 563| 367| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE6negateEv: 454| 58.3k| constexpr Self negate() const { 455| 58.3k| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 456| | 457| 58.3k| std::array r; // NOLINT(*-member-init) 458| 58.3k| W carry = 0; 459| 525k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (459:28): [True: 467k, False: 58.3k] ------------------ 460| 467k| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 461| 467k| } 462| | 463| 58.3k| return Self(r); 464| 58.3k| } pcurves_brainpool512r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES0_E11FieldParamsEE6to_repERKNSt3__15arrayImLm8EEE: 117| 708| constexpr static std::array to_rep(const std::array& x) { 118| 708| std::array z; // NOLINT(*-member-init) 119| 708| comba_mul(z.data(), x.data(), R2.data()); 120| 708| return Self::redc(z); 121| 708| } pcurves_brainpool512r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEEEC2ERKSB_SE_: 928| 68.0k| constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {} pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 2.57k| std::array stash_value() const { 762| 2.57k| static_assert(L >= N); 763| 2.57k| std::array stash = {}; 764| 23.1k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 20.6k, False: 2.57k] ------------------ 765| 20.6k| stash[i] = m_val[i]; 766| 20.6k| } 767| 2.57k| return stash; 768| 2.57k| } pcurves_brainpool512r1.cpp:_ZNK5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6EE3mulERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES7_E12ScalarParamsEEEEERNS_21RandomNumberGeneratorE: 1632| 345| ProjectivePoint mul(const Scalar& s, RandomNumberGenerator& rng) const { 1633| 345| const BlindingRandomness blinding(rng); 1634| 345| const BlindedScalar scalar(s, blinding); 1635| 345| return basemul_booth_exec(m_table, scalar, blinding); 1636| 345| } pcurves_brainpool512r1.cpp:_ZN5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm7EEELm1EEC2ERNS_21RandomNumberGeneratorE: 1455| 345| explicit BlindingRandomness(RandomNumberGenerator& rng) : m_seeded(rng.is_seeded()) { 1456| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1457| 345| if(m_seeded) { ------------------ | Branch (1457:13): [True: 345, False: 0] ------------------ 1458| 345| std::array buf{}; 1459| 345| rng.randomize(buf); 1460| | 1461| 345| const std::span bytes(buf); 1462| | 1463| 345| copy_mem(m_masks, bytes.first()); 1464| | 1465| 1.72k| for(size_t i = 0; i != Rerandomizations; ++i) { ------------------ | Branch (1465:31): [True: 1.38k, False: 345] ------------------ 1466| 1.38k| const auto wide = bytes.subspan(Scalars * MaskBytes + i * WideBytes).first(); 1467| 1.38k| m_rerandomizers[i] = FieldElement::from_wide_bytes(wide); 1468| 1.38k| } 1469| | 1470| 345| const auto iso = bytes.subspan(Scalars * MaskBytes + Rerandomizations * WideBytes).first(); 1471| 345| m_isomorphism = FieldElement::from_wide_bytes(iso); 1472| 345| m_isomorphism.conditional_assign(m_isomorphism.is_zero(), FieldElement::one()); 1473| 345| } 1474| 345| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE15from_wide_bytesILm72EEESA_NSt3__14spanIKhXT_EEE: 818| 2.79k| static constexpr Self from_wide_bytes(std::span bytes) { 819| 2.79k| static_assert(8 * L <= 2 * Self::BITS); 820| 2.79k| std::array padded_bytes = {}; 821| 2.79k| copy_mem(std::span{padded_bytes}.template last(), bytes); 822| 2.79k| return Self(Rep::wide_to_rep(bytes_to_words(std::span{padded_bytes}))); 823| 2.79k| } pcurves_brainpool512r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES0_E11FieldParamsEE11wide_to_repERKNSt3__15arrayImLm16EEE: 129| 2.79k| constexpr static std::array wide_to_rep(const std::array& x) { 130| 2.79k| auto redc_x = Self::redc(x); 131| 2.79k| std::array z; // NOLINT(*-member-init) 132| 2.79k| comba_mul(z.data(), redc_x.data(), R3.data()); 133| 2.79k| return Self::redc(z); 134| 2.79k| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE18conditional_assignENS_2CT6ChoiceERKSA_: 369| 58.6k| constexpr void conditional_assign(CT::Choice cond, const Self& nx) { 370| 58.6k| const W mask = cond.into_bitmask(); 371| | 372| 527k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (372:28): [True: 469k, False: 58.6k] ------------------ 373| 469k| m_val[i] = Botan::choose(mask, nx.m_val[i], m_val[i]); 374| 469k| } 375| 58.6k| } pcurves_brainpool512r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm7EEC2INS_18BlindingRandomnessIS5_Lm1EEEEERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsESA_E12ScalarParamsEEEEERKT_m: 1368| 345| BlindedScalarBits(const typename C::Scalar& scalar, const Randomness& randomness, size_t idx = 0) { 1369| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1370| 345| if(BlindingBits > 0 && randomness.seeded()) { ------------------ | Branch (1370:13): [True: 345, Folded] | Branch (1370:33): [True: 345, False: 0] ------------------ 1371| 345| constexpr size_t n_words = C::Words; 1372| | 1373| 345| W mask[n_words] = {0}; 1374| 345| load_le(mask, randomness.mask(idx).data(), MaskWords); 1375| | 1376| | // Mask to exactly BlindingBits 1377| 345| constexpr size_t ExcessBits = MaskWords * WordInfo::bits - BlindingBits; 1378| | if constexpr(ExcessBits > 0) { 1379| | constexpr W ExcessMask = (static_cast(1) << (WordInfo::bits - ExcessBits)) - 1; 1380| | mask[MaskWords - 1] &= ExcessMask; 1381| | } 1382| | 1383| | // Set top and bottom bits of mask 1384| 345| constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo::bits; 1385| 345| mask[(BlindingBits - 1) / WordInfo::bits] |= static_cast(1) << TopMaskBit; 1386| 345| mask[0] |= 1; 1387| | 1388| 345| W mask_n[2 * n_words] = {0}; 1389| | 1390| 345| const auto sw = scalar.to_words(); 1391| | 1392| | // Compute masked scalar s + k*n 1393| 345| comba_mul(mask_n, mask, C::NW.data()); 1394| 345| bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size()); 1395| | 1396| 345| std::reverse(mask_n, mask_n + 2 * n_words); 1397| 345| m_bytes = store_be>(mask_n); 1398| 345| m_bits = C::Scalar::BITS + BlindingBits; 1399| 345| } else { 1400| | // No RNG available, skip blinding 1401| 0| m_bytes.resize(C::Scalar::BYTES); 1402| 0| scalar.serialize_to(std::span{m_bytes}.template first()); 1403| 0| m_bits = C::Scalar::BITS; 1404| 0| } 1405| | 1406| 345| CT::poison(m_bytes.data(), m_bytes.size()); 1407| 345| } pcurves_brainpool512r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm7EEELm1EE6seededEv: 1476| 345| bool seeded() const { return m_seeded; } pcurves_brainpool512r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm7EEELm1EE4maskEm: 1478| 345| std::span mask(size_t idx) const { 1479| 345| BOTAN_ASSERT_NOMSG(idx < Scalars); ------------------ | | 84| 345| do { \ | | 85| 345| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 345| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 345] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 345| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 345] | | ------------------ ------------------ 1480| 345| return std::span{m_masks}.subspan(idx * MaskBytes).template first(); 1481| 345| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E12ScalarParamsEEEE8to_wordsEv: 736| 558| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_brainpool512r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES0_E12ScalarParamsEE8from_repERKNSt3__15arrayImLm8EEE: 139| 903| constexpr static std::array from_rep(const std::array& z) { 140| 903| std::array ze = {}; 141| 903| copy_mem(std::span{ze}.template first(), z); 142| 903| return Self::redc(ze); 143| 903| } pcurves_brainpool512r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES0_E12ScalarParamsEE4redcERKNSt3__15arrayImLm16EEE: 106| 1.24k| constexpr static std::array redc(const std::array& z) { 107| | if constexpr(P_dash == 1) { 108| | return monty_redc_pdash1(z, P); 109| 1.24k| } else { 110| 1.24k| return monty_redc(z, P, P_dash); 111| 1.24k| } 112| 1.24k| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E12ScalarParamsEEEE12serialize_toENSt3__14spanIhLm64EEE: 741| 345| constexpr void serialize_to(std::span bytes) const { 742| 345| auto v = Rep::from_rep(m_val); 743| 345| std::reverse(v.begin(), v.end()); 744| | 745| 345| if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| 345| 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| 345| } pcurves_brainpool512r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm7EE4bitsEv: 1362| 345| size_t bits() const { return m_bits; } pcurves_brainpool512r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E18conditional_assignENS_2CT6ChoiceERKSC_: 1095| 558| constexpr void conditional_assign(CT::Choice cond, const Self& pt) { 1096| 558| FieldElement::conditional_assign(m_x, m_y, m_z, cond, pt.x(), pt.y(), pt.z()); 1097| 558| } pcurves_brainpool512r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E6negateEv: 1194| 558| constexpr Self negate() const { return Self(x(), y().negate(), z()); } pcurves_brainpool512r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E18_const_time_poisonEv: 1226| 558| constexpr void _const_time_poison() const { CT::poison_all(m_x, m_y, m_z); } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE18_const_time_poisonEv: 891| 1.67k| constexpr void _const_time_poison() const { CT::poison(m_val); } pcurves_brainpool512r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm7EE10get_windowEm: 1409| 33.4k| size_t get_window(size_t offset) const { 1410| | // Extract a WindowBits sized window out of s, depending on offset. 1411| 33.4k| return read_window_bits(std::span{m_bytes}, offset); 1412| 33.4k| } pcurves_brainpool512r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E10add_or_subERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceE: 1121| 33.1k| constexpr static Self add_or_sub(const Self& a, const AffinePoint& b, CT::Choice sub) { 1122| 33.1k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), A); 1123| 33.1k| } pcurves_brainpool512r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEEE9ct_selectENSt3__14spanIKSC_Lm18446744073709551615EEEm: 966| 58.1k| static constexpr auto ct_select(std::span pts, size_t idx) { 967| 58.1k| auto result = Self::identity(pts[0]); 968| | 969| | // Intentionally wrapping; set to maximum size_t if idx == 0 970| 58.1k| const size_t idx1 = idx - 1; 971| 1.52M| for(size_t i = 0; i != pts.size(); ++i) { ------------------ | Branch (971:28): [True: 1.46M, False: 58.1k] ------------------ 972| 1.46M| const auto found = CT::Mask::is_equal(idx1, i).as_choice(); 973| 1.46M| result.conditional_assign(found, pts[i]); 974| 1.46M| } 975| | 976| 58.1k| return result; 977| 58.1k| } pcurves_brainpool512r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEEE8identityERKSC_: 935| 58.1k| static constexpr Self identity(const Self& /*unused*/) { 936| 58.1k| return Self(FieldElement::zero(), FieldElement::zero()); 937| 58.1k| } pcurves_brainpool512r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEEE18conditional_assignENS_2CT6ChoiceERKSC_: 992| 1.46M| constexpr void conditional_assign(CT::Choice cond, const Self& pt) { 993| 1.46M| FieldElement::conditional_assign(m_x, m_y, cond, pt.x(), pt.y()); 994| 1.46M| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE18conditional_assignERSA_SB_NS_2CT6ChoiceERKSA_SF_: 382| 1.46M| static constexpr void conditional_assign(Self& x, Self& y, CT::Choice cond, const Self& nx, const Self& ny) { 383| 1.46M| const W mask = cond.into_bitmask(); 384| | 385| 13.1M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (385:28): [True: 11.7M, False: 1.46M] ------------------ 386| 11.7M| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 387| 11.7M| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 388| 11.7M| } 389| 1.46M| } pcurves_brainpool512r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm7EEELm1EE13randomize_repERNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS4_6ParamsESA_E11FieldParamsEEEEESC_EEm: 1486| 1.38k| void randomize_rep(typename C::ProjectivePoint& pt, size_t idx) const { 1487| 1.38k| BOTAN_ASSERT_NOMSG(idx < Rerandomizations); ------------------ | | 84| 1.38k| do { \ | | 85| 1.38k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 1.38k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 1.38k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 1.38k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 1.38k] | | ------------------ ------------------ 1488| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1489| 1.38k| if(m_seeded) { ------------------ | Branch (1489:13): [True: 1.38k, False: 0] ------------------ 1490| 1.38k| pt.randomize_rep(m_rerandomizers[idx]); 1491| 1.38k| } 1492| 1.38k| } pcurves_brainpool512r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E13randomize_repERKSB_: 1202| 2.23k| void randomize_rep(const FieldElement& r) { 1203| 2.23k| const auto r2 = r.square(); 1204| 2.23k| const auto r3 = r2 * r; 1205| | 1206| 2.23k| m_x *= r2; 1207| 2.23k| m_y *= r3; 1208| 2.23k| m_z *= r; 1209| 2.23k| } pcurves_brainpool512r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E20_const_time_unpoisonEv: 1228| 558| constexpr void _const_time_unpoison() const { CT::unpoison_all(m_x, m_y, m_z); } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE20_const_time_unpoisonEv: 893| 1.67k| constexpr void _const_time_unpoison() const { CT::unpoison(m_val); } pcurves_brainpool512r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm7EED2Ev: 1414| 345| ~BlindedScalarBits() { 1415| 345| secure_zeroize_buffer(m_bytes.data(), m_bytes.size()); 1416| 345| CT::unpoison(m_bytes.data(), m_bytes.size()); 1417| 345| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E12ScalarParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE: 776| 1.24k| static Self from_stash(const std::array& stash) { 777| 1.24k| static_assert(L >= N); 778| 1.24k| std::array val = {}; 779| 11.2k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 9.98k, False: 1.24k] ------------------ 780| 9.98k| val[i] = stash[i]; 781| 9.98k| } 782| 1.24k| return Self(val); 783| 1.24k| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E12ScalarParamsEEEEC2ENSt3__15arrayImLm8EEE: 908| 1.59k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE12serialize_toENSt3__14spanIhLm64EEE: 741| 2.60k| constexpr void serialize_to(std::span bytes) const { 742| 2.60k| auto v = Rep::from_rep(m_val); 743| 2.60k| std::reverse(v.begin(), v.end()); 744| | 745| 2.60k| if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| 2.60k| 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| 2.60k| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E12ScalarParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 345| std::array stash_value() const { 762| 345| static_assert(L >= N); 763| 345| std::array stash = {}; 764| 3.10k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 2.76k, False: 345] ------------------ 765| 2.76k| stash[i] = m_val[i]; 766| 2.76k| } 767| 345| return stash; 768| 345| } pcurves_brainpool512r1.cpp:_ZN5Botan12varpoint_mulINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm4EEENT_15ProjectivePointERKNS5_11AffinePointERKNS5_6ScalarERNS_21RandomNumberGeneratorE: 1680| 213| RandomNumberGenerator& rng) { 1681| 213| using ProjectivePoint = typename C::ProjectivePoint; 1682| | 1683| 213| constexpr size_t TableBits = W; 1684| 213| static_assert(TableBits >= 1 && TableBits <= 7); 1685| | 1686| 213| constexpr size_t WindowBits = TableBits + 1; 1687| | 1688| 213| using BlindedScalar = BlindedScalarBits; 1689| 213| using Blinding = BlindingRandomness; 1690| | 1691| | // 2^W elements [1*P, 2*P, ..., 2^W*P] 1692| 213| constexpr size_t TableSize = 1 << TableBits; 1693| | 1694| 213| const Blinding blinding(rng); 1695| 213| const SharedZPointTable table(p, TableSize, C::A, blinding.isomorphism()); 1696| 213| const BlindedScalar bits(s, blinding); 1697| | 1698| 213| const size_t scalar_bits = bits.bits(); 1699| 213| const size_t full_windows = booth_full_windows(scalar_bits + 1, WindowBits); 1700| 213| const size_t initial_shift = booth_initial_shift(scalar_bits + 1, WindowBits); 1701| | 1702| 213| BOTAN_DEBUG_ASSERT(full_windows * WindowBits + initial_shift == scalar_bits + 1); ------------------ | | 137| 213| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 213| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 213] | | ------------------ ------------------ 1703| 213| BOTAN_DEBUG_ASSERT(initial_shift > 0); ------------------ | | 137| 213| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 213| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 213] | | ------------------ ------------------ 1704| | 1705| 213| auto accum = ProjectivePoint::identity(); 1706| 213| CT::poison(accum); 1707| | 1708| 24.7k| for(size_t i = 0; i != full_windows; ++i) { ------------------ | Branch (1708:22): [True: 24.4k, False: 213] ------------------ 1709| 24.4k| const size_t idx = scalar_bits - initial_shift - WindowBits * i; 1710| | 1711| 24.4k| const size_t w_i = bits.get_window(idx); 1712| 24.4k| const auto [tidx, tneg] = booth_recode(w_i); 1713| | 1714| | // Conditional ok: loop iteration count is public 1715| 24.4k| if(i == 0) { ------------------ | Branch (1715:10): [True: 213, False: 24.2k] ------------------ 1716| 213| accum = ProjectivePoint::from_affine(table.ct_select(tidx)); 1717| 213| accum.conditional_assign(tneg, accum.negate()); 1718| 24.2k| } else { 1719| 24.2k| accum = ProjectivePoint::add_or_sub_iso(accum, table.ct_select(tidx), tneg, table.a()); 1720| 24.2k| } 1721| | 1722| 24.4k| accum = accum.dbl_n_iso(table.a(), WindowBits); 1723| | 1724| | // Conditional ok: loop iteration count is public 1725| 24.4k| if(i < Blinding::Rerandomizations) { ------------------ | Branch (1725:10): [True: 852, False: 23.6k] ------------------ 1726| 852| blinding.randomize_rep(accum, i); 1727| 852| } 1728| 24.4k| } 1729| | 1730| | // final window (note one bit shorter than previous reads) 1731| 213| const size_t w_l = bits.get_window(0) & ((1 << WindowBits) - 1); 1732| 213| const auto [tidx, tneg] = booth_recode(w_l << 1); 1733| 213| accum = ProjectivePoint::add_or_sub_iso(accum, table.ct_select(tidx), tneg, table.a()); 1734| | 1735| 213| CT::unpoison(accum); 1736| | 1737| | // Map back from the isomorphic curve 1738| 213| return ProjectivePoint(accum.x(), accum.y(), accum.z() * table.z()); 1739| 213|} pcurves_brainpool512r1.cpp:_ZN5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6EEELm1EEC2ERNS_21RandomNumberGeneratorE: 1455| 213| explicit BlindingRandomness(RandomNumberGenerator& rng) : m_seeded(rng.is_seeded()) { 1456| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1457| 213| if(m_seeded) { ------------------ | Branch (1457:13): [True: 213, False: 0] ------------------ 1458| 213| std::array buf{}; 1459| 213| rng.randomize(buf); 1460| | 1461| 213| const std::span bytes(buf); 1462| | 1463| 213| copy_mem(m_masks, bytes.first()); 1464| | 1465| 1.06k| for(size_t i = 0; i != Rerandomizations; ++i) { ------------------ | Branch (1465:31): [True: 852, False: 213] ------------------ 1466| 852| const auto wide = bytes.subspan(Scalars * MaskBytes + i * WideBytes).first(); 1467| 852| m_rerandomizers[i] = FieldElement::from_wide_bytes(wide); 1468| 852| } 1469| | 1470| 213| const auto iso = bytes.subspan(Scalars * MaskBytes + Rerandomizations * WideBytes).first(); 1471| 213| m_isomorphism = FieldElement::from_wide_bytes(iso); 1472| 213| m_isomorphism.conditional_assign(m_isomorphism.is_zero(), FieldElement::one()); 1473| 213| } 1474| 213| } pcurves_brainpool512r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6EEELm1EE11isomorphismEv: 1497| 213| const FieldElement& isomorphism() const { return m_isomorphism; } pcurves_brainpool512r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E11add_mixed_hERKSC_RKNS_16AffineCurvePointISB_EE: 1116| 2.98k| constexpr static std::pair add_mixed_h(const Self& a, const AffinePoint& b) { 1117| 2.98k| return point_add_mixed_h(a, b, FieldElement::one(), A); 1118| 2.98k| } pcurves_brainpool512r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6EEC2INS_18BlindingRandomnessIS5_Lm1EEEEERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsESA_E12ScalarParamsEEEEERKT_m: 1368| 213| BlindedScalarBits(const typename C::Scalar& scalar, const Randomness& randomness, size_t idx = 0) { 1369| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1370| 213| if(BlindingBits > 0 && randomness.seeded()) { ------------------ | Branch (1370:13): [True: 213, Folded] | Branch (1370:33): [True: 213, False: 0] ------------------ 1371| 213| constexpr size_t n_words = C::Words; 1372| | 1373| 213| W mask[n_words] = {0}; 1374| 213| load_le(mask, randomness.mask(idx).data(), MaskWords); 1375| | 1376| | // Mask to exactly BlindingBits 1377| 213| constexpr size_t ExcessBits = MaskWords * WordInfo::bits - BlindingBits; 1378| | if constexpr(ExcessBits > 0) { 1379| | constexpr W ExcessMask = (static_cast(1) << (WordInfo::bits - ExcessBits)) - 1; 1380| | mask[MaskWords - 1] &= ExcessMask; 1381| | } 1382| | 1383| | // Set top and bottom bits of mask 1384| 213| constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo::bits; 1385| 213| mask[(BlindingBits - 1) / WordInfo::bits] |= static_cast(1) << TopMaskBit; 1386| 213| mask[0] |= 1; 1387| | 1388| 213| W mask_n[2 * n_words] = {0}; 1389| | 1390| 213| const auto sw = scalar.to_words(); 1391| | 1392| | // Compute masked scalar s + k*n 1393| 213| comba_mul(mask_n, mask, C::NW.data()); 1394| 213| bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size()); 1395| | 1396| 213| std::reverse(mask_n, mask_n + 2 * n_words); 1397| 213| m_bytes = store_be>(mask_n); 1398| 213| m_bits = C::Scalar::BITS + BlindingBits; 1399| 213| } else { 1400| | // No RNG available, skip blinding 1401| 0| m_bytes.resize(C::Scalar::BYTES); 1402| 0| scalar.serialize_to(std::span{m_bytes}.template first()); 1403| 0| m_bits = C::Scalar::BITS; 1404| 0| } 1405| | 1406| 213| CT::poison(m_bytes.data(), m_bytes.size()); 1407| 213| } pcurves_brainpool512r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6EEELm1EE6seededEv: 1476| 213| bool seeded() const { return m_seeded; } pcurves_brainpool512r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6EEELm1EE4maskEm: 1478| 213| std::span mask(size_t idx) const { 1479| 213| BOTAN_ASSERT_NOMSG(idx < Scalars); ------------------ | | 84| 213| do { \ | | 85| 213| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 213| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 213] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 213| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 213] | | ------------------ ------------------ 1480| 213| return std::span{m_masks}.subspan(idx * MaskBytes).template first(); 1481| 213| } pcurves_brainpool512r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6EE4bitsEv: 1362| 213| size_t bits() const { return m_bits; } pcurves_brainpool512r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E8identityEv: 1049| 213| static constexpr Self identity() { return Self(FieldElement::zero(), FieldElement::one(), FieldElement::zero()); } pcurves_brainpool512r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6EE10get_windowEm: 1409| 24.7k| size_t get_window(size_t offset) const { 1410| | // Extract a WindowBits sized window out of s, depending on offset. 1411| 24.7k| return read_window_bits(std::span{m_bytes}, offset); 1412| 24.7k| } pcurves_brainpool512r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E14add_or_sub_isoERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceERKSB_: 1131| 24.4k| const FieldElement& curve_a) { 1132| 24.4k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), curve_a); 1133| 24.4k| } pcurves_brainpool512r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEES7_E9dbl_n_isoERKSB_m: 1159| 24.4k| constexpr Self dbl_n_iso(const FieldElement& a, size_t n) const { 1160| | if constexpr(Self::A_is_zero) { 1161| | return dbl_n_a_zero(*this, n); 1162| 24.4k| } else { 1163| 24.4k| return dbl_n_generic(*this, a, n); 1164| 24.4k| } 1165| 24.4k| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE4div2Ev: 304| 24.4k| 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.4k| 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.4k| std::array t = value(); 312| 24.4k| const W borrow = shift_right<1>(t); 313| | 314| | // If value was odd, add (P/2)+1 315| 24.4k| const auto mask = CT::Mask::expand(borrow).value(); 316| | 317| 24.4k| W carry = 0; 318| | 319| 220k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (319:28): [True: 195k, False: 24.4k] ------------------ 320| 195k| t[i] = word_add(t[i], INV_2[i] & mask, &carry); 321| 195k| } 322| | 323| 24.4k| return Self(t); 324| 24.4k| } pcurves_brainpool512r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6EEELm1EE13randomize_repERNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS4_6ParamsESA_E11FieldParamsEEEEESC_EEm: 1486| 852| void randomize_rep(typename C::ProjectivePoint& pt, size_t idx) const { 1487| 852| BOTAN_ASSERT_NOMSG(idx < Rerandomizations); ------------------ | | 84| 852| do { \ | | 85| 852| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 852| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 852] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 852| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 852] | | ------------------ ------------------ 1488| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1489| 852| if(m_seeded) { ------------------ | Branch (1489:13): [True: 852, False: 0] ------------------ 1490| 852| pt.randomize_rep(m_rerandomizers[idx]); 1491| 852| } 1492| 852| } pcurves_brainpool512r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6EED2Ev: 1414| 213| ~BlindedScalarBits() { 1415| 213| secure_zeroize_buffer(m_bytes.data(), m_bytes.size()); 1416| 213| CT::unpoison(m_bytes.data(), m_bytes.size()); 1417| 213| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE: 776| 6.24k| static Self from_stash(const std::array& stash) { 777| 6.24k| static_assert(L >= N); 778| 6.24k| std::array val = {}; 779| 56.2k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 49.9k, False: 6.24k] ------------------ 780| 49.9k| val[i] = stash[i]; 781| 49.9k| } 782| 6.24k| return Self(val); 783| 6.24k| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E12ScalarParamsEEEE7is_zeroEv: 227| 690| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 721| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 721| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 721] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 721| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 721| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 14, False: 707] ------------------ 804| 14| return {}; 805| 14| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 707| return Self::from_words(words); 809| 721| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEEeqERKSA_: 724| 823| constexpr CT::Choice operator==(const Self& other) const { 725| 823| return CT::is_equal(this->data(), other.data(), N).as_choice(); 726| 823| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE10from_wordsILm8EEESA_NSt3__15arrayImXT_EEE: 213| 707| static constexpr Self from_words(std::array w) { 214| 707| if constexpr(L == N) { 215| 707| 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| 707| } pcurves_brainpool512r1.cpp:_ZN5Botan13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsENS_13MontgomeryRepEE7x3_ax_bERKNS_6IntModINS5_INS6_11FieldParamsEEEEE: 1327| 823| static constexpr FieldElement x3_ax_b(const FieldElement& x) { return (x.square() + A) * x + B; } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE4sqrtEv: 665| 259| constexpr CT::Option sqrt() const { 666| 259| if constexpr(Self::P_MOD_4 == 3) { 667| | // The easy case for square root is when p == 3 (mod 4) 668| | 669| 259| constexpr auto P_PLUS_1_OVER_4 = p_plus_1_over_4(P); 670| 259| auto z = pow_vartime(P_PLUS_1_OVER_4); 671| | 672| | // Zero out the return value if it would otherwise be incorrect 673| 259| const CT::Choice correct = (z.square() == *this); 674| 259| z.conditional_assign(!correct, Self::zero()); 675| 259| return CT::Option(z, correct); 676| | } 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| | constexpr auto C1_C2 = shanks_tonelli_c1c2(Self::P); 688| | constexpr std::array C3 = shanks_tonelli_c3(C1_C2.second); 689| | constexpr std::array P_MINUS_1_OVER_2 = p_minus_1_over_2(Self::P); 690| | constexpr Self C4 = shanks_tonelli_c4(P_MINUS_1_OVER_2); 691| | constexpr Self C5 = C4.pow_vartime(C1_C2.second); 692| | 693| | const Self& x = (*this); 694| | 695| | auto z = x.pow_vartime(C3); 696| | auto t = z.square(); 697| | t *= x; 698| | z *= x; 699| | auto b = t; 700| | auto c = C5; 701| | 702| | for(size_t i = C1_C2.first; i >= 2; i--) { 703| | b.square_n(i - 2); 704| | const CT::Choice e = b.is_one(); 705| | z.conditional_assign(!e, z * c); 706| | c.square_n(1); 707| | t.conditional_assign(!e, t * c); 708| | b = t; 709| | } 710| | 711| | // Zero out the return value if it would otherwise be incorrect 712| | const CT::Choice correct = (z.square() == *this); 713| | z.conditional_assign(!correct, Self::zero()); 714| | return CT::Option(z, correct); 715| | } 716| 259| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE12correct_signENS_2CT6ChoiceE: 250| 213| constexpr Self correct_sign(CT::Choice even) const { 251| 213| const auto flip = (even != this->is_even()); 252| 213| return Self::choose(flip, this->negate(), *this); 253| 213| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE7is_evenEv: 242| 213| constexpr CT::Choice is_even() const { 243| 213| auto v = Rep::from_rep(m_val); 244| 213| return !CT::Choice::from_int(v[0] & 0x01); 245| 213| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E11FieldParamsEEEE6chooseENS_2CT6ChoiceERKSA_SE_: 258| 213| static constexpr Self choose(CT::Choice choice, const Self& x, const Self& y) { 259| 213| auto r = y; 260| 213| r.conditional_assign(choice, x); 261| 213| return r; 262| 213| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E12ScalarParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 501| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 501| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 501] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 501| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 501| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 156, False: 345] ------------------ 804| 156| return {}; 805| 156| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 345| return Self::from_words(words); 809| 501| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E12ScalarParamsEEEE10from_wordsILm8EEESA_NSt3__15arrayImXT_EEE: 213| 345| static constexpr Self from_words(std::array w) { 214| 345| if constexpr(L == N) { 215| 345| 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| 345| } pcurves_brainpool512r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES0_E12ScalarParamsEE6to_repERKNSt3__15arrayImLm8EEE: 117| 345| constexpr static std::array to_rep(const std::array& x) { 118| 345| std::array z; // NOLINT(*-member-init) 119| 345| comba_mul(z.data(), x.data(), R2.data()); 120| 345| return Self::redc(z); 121| 345| } pcurves_brainpool512r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES2_E11FieldParamsEEEEEE12serialize_toENSt3__14spanIhLm129EEE: 952| 1.19k| constexpr void serialize_to(std::span bytes) const { 953| 1.19k| BOTAN_STATE_CHECK(this->is_identity().as_bool() == false); ------------------ | | 51| 1.19k| do { \ | | 52| 1.19k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 1.19k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 1.19k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 1.19k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 1.19k] | | ------------------ ------------------ 954| 1.19k| BufferStuffer pack(bytes); 955| 1.19k| pack.append(0x04); 956| 1.19k| x().serialize_to(pack.next()); 957| 1.19k| y().serialize_to(pack.next()); 958| 1.19k| BOTAN_DEBUG_ASSERT(pack.full()); ------------------ | | 137| 1.19k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.19k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.19k] | | ------------------ ------------------ 959| 1.19k| } pcurves_brainpool512r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E12ScalarParamsEEEE6randomERNS_21RandomNumberGeneratorE: 853| 345| static Self random(RandomNumberGenerator& rng) { 854| 345| constexpr size_t MAX_ATTEMPTS = 1000; 855| | 856| 345| std::array buf{}; 857| | 858| 501| for(size_t i = 0; i != MAX_ATTEMPTS; ++i) { ------------------ | Branch (858:28): [True: 501, False: 0] ------------------ 859| 501| rng.randomize(buf); 860| | 861| | // Zero off high bits that if set would certainly cause us 862| | // to be out of range 863| | if constexpr(Self::BITS % 8 != 0) { 864| | constexpr uint8_t mask = 0xFF >> (8 - (Self::BITS % 8)); 865| | buf[0] &= mask; 866| | } 867| | 868| | // Conditionals ok: rejection sampling reveals only values we didn't use 869| 501| if(auto s = Self::deserialize(buf)) { ------------------ | Branch (869:21): [True: 345, False: 156] ------------------ 870| 345| if(s.value().is_nonzero().as_bool()) { ------------------ | Branch (870:19): [True: 345, False: 0] ------------------ 871| 345| return s.value(); 872| 345| } 873| 345| } 874| 501| } 875| | 876| 0| throw Internal_Error("Failed to generate random Scalar within bounded number of attempts"); 877| 345| } pcurves_brainpool512r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_114brainpool512r16ParamsES1_E12ScalarParamsEEEE10is_nonzeroEv: 232| 345| constexpr CT::Choice is_nonzero() const { return !is_zero(); } pcurves_secp256r1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS2_22Secp256r1MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1630| 1| m_table(basemul_booth_setup(p, BlindedScalar::Bits + 1)) {} pcurves_secp256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E11from_affineERKNS_16AffineCurvePointISB_EE: 1027| 7.41k| 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| 7.41k| const auto x = pt.x(); 1038| 7.41k| auto y = pt.y(); 1039| 7.41k| auto z = FieldElement::one(); 1040| | 1041| 7.41k| FieldElement::conditional_swap(pt.is_identity(), y, z); 1042| | 1043| 7.41k| return ProjectiveCurvePoint(x, y, z); 1044| 7.41k| } pcurves_secp256r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEEE1xEv: 982| 10.7M| constexpr const FieldElement& x() const { return m_x; } pcurves_secp256r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEEE1yEv: 987| 10.4M| constexpr const FieldElement& y() const { return m_y; } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE3oneEv: 202| 325k| static constexpr Self one() { return Self(Rep::one()); } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEEC2ENSt3__15arrayImLm4EEE: 908| 8.53M| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 412| 7.41k| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 413| 7.41k| const W mask = cond.into_bitmask(); 414| | 415| 37.0k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (415:28): [True: 29.6k, False: 7.41k] ------------------ 416| 29.6k| const auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 417| 29.6k| const auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 418| 29.6k| x.m_val[i] = nx; 419| 29.6k| y.m_val[i] = ny; 420| 29.6k| } 421| 7.41k| } pcurves_secp256r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEEE11is_identityEv: 939| 352k| constexpr CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE7is_zeroEv: 227| 1.64M| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_secp256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_EC2ERKSB_SE_SE_: 1067| 352k| m_x(x), m_y(y), m_z(z) {} pcurves_secp256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E3dblEv: 1181| 1.16k| constexpr Self dbl() const { 1182| 1.16k| if constexpr(Self::A_is_minus_3) { 1183| 1.16k| 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.16k| } pcurves_secp256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E1zEv: 1224| 1.61M| constexpr const FieldElement& z() const { return m_z; } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE6squareEv: 428| 1.41M| constexpr BOTAN_FORCE_INLINE Self square() const { 429| 1.41M| std::array z; // NOLINT(*-member-init) 430| 1.41M| comba_sqr(z.data(), this->data()); 431| 1.41M| return Self(Rep::redc(z)); 432| 1.41M| } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE4dataEv: 898| 9.66M| constexpr const W* data() const { return m_val.data(); } pcurves_secp256r1.cpp:_ZN5BotanmlERKNS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEEESC_: 348| 2.76M| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 349| 2.76M| std::array z; // NOLINT(*-member-init) 350| 2.76M| comba_mul(z.data(), a.data(), b.data()); 351| 2.76M| return Self(Rep::redc(z)); 352| 2.76M| } pcurves_secp256r1.cpp:_ZN5BotanmiERKNS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEEESC_: 283| 2.14M| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 284| 2.14M| std::array r; // NOLINT(*-member-init) 285| 2.14M| W carry = 0; 286| 10.7M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (286:28): [True: 8.59M, False: 2.14M] ------------------ 287| 8.59M| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 288| 8.59M| } 289| | 290| 2.14M| const auto mask = CT::Mask::expand(carry).value(); 291| | 292| 2.14M| carry = 0; 293| | 294| 10.7M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (294:28): [True: 8.59M, False: 2.14M] ------------------ 295| 8.59M| r[i] = word_add(r[i], P[i] & mask, &carry); 296| 8.59M| } 297| | 298| 2.14M| return Self(r); 299| 2.14M| } pcurves_secp256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E1xEv: 1214| 989k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE4mul3Ev: 337| 94.3k| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_secp256r1.cpp:_ZN5BotanplERKNS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEEESC_: 267| 526k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 268| 526k| std::array t; // NOLINT(*-member-init) 269| | 270| 526k| W carry = 0; 271| 2.63M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (271:28): [True: 2.10M, False: 526k] ------------------ 272| 2.10M| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 273| 2.10M| } 274| | 275| 526k| std::array r; // NOLINT(*-member-init) 276| 526k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 277| 526k| return Self(r); 278| 526k| } pcurves_secp256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E1yEv: 1219| 988k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE4mul4Ev: 340| 1.16k| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE4mul2Ev: 327| 307k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 328| 307k| std::array t = value(); 329| 307k| const W carry = shift_left<1>(t); 330| | 331| 307k| std::array r; // NOLINT(*-member-init) 332| 307k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 333| 307k| return Self(r); 334| 307k| } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE5valueEv: 896| 326k| constexpr const std::array& value() const { return m_val; } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE4mul8Ev: 343| 1.16k| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_secp256r1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_EESE_: 1075| 735| friend constexpr Self operator+(const Self& a, const Self& b) { return Self::add(a, b); } pcurves_secp256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E3addERKSC_SE_: 1138| 735| constexpr static Self add(const Self& a, const Self& b) { return point_add(a, b); } pcurves_secp256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E11is_identityEv: 1093| 313k| constexpr CT::Choice is_identity() const { return z().is_zero(); } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE18conditional_assignERSA_SB_SB_NS_2CT6ChoiceERKSA_SF_SF_: 397| 628k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 398| 628k| const W mask = cond.into_bitmask(); 399| | 400| 3.14M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (400:28): [True: 2.51M, False: 628k] ------------------ 401| 2.51M| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 402| 2.51M| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 403| 2.51M| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 404| 2.51M| } 405| 628k| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_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_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE8square_nEm: 441| 66.0k| constexpr void square_n(size_t n) { 442| 66.0k| std::array z; // NOLINT(*-member-init) 443| 1.93M| for(size_t i = 0; i != n; ++i) { ------------------ | Branch (443:28): [True: 1.86M, False: 66.0k] ------------------ 444| 1.86M| comba_sqr(z.data(), this->data()); 445| 1.86M| m_val = Rep::redc(z); 446| 1.86M| } 447| 66.0k| } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_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: 85, False: 90] ------------------ 646| | // b > a 647| 85| b.m_val = r; 648| 85| x = nx; 649| 85| Self::_invert_vartime_div2_helper(b, x); 650| 90| } else { 651| | // We know this can't underflow because a > b 652| 90| bigint_sub3(r.data(), a.data(), N, b.data(), N); 653| 90| a.m_val = r; 654| 90| y = nx; 655| 90| Self::_invert_vartime_div2_helper(a, y); 656| 90| } 657| 175| } 658| 1| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE4zeroEv: 197| 625k| static constexpr Self zero() { return Self(std::array{0}); } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE8to_wordsEv: 736| 1| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_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| 545| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (553:16): [True: 368, False: 177] ------------------ 554| 368| shift_right<1>(a.m_val); 555| | 556| 368| const W borrow = shift_right<1>(x.m_val); 557| | 558| | // Conditional ok: this function is variable time 559| 368| if(borrow) { ------------------ | Branch (559:16): [True: 129, False: 239] ------------------ 560| 129| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 561| 129| } 562| 368| } 563| 177| } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE6negateEv: 454| 312k| constexpr Self negate() const { 455| 312k| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 456| | 457| 312k| std::array r; // NOLINT(*-member-init) 458| 312k| W carry = 0; 459| 1.56M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (459:28): [True: 1.25M, False: 312k] ------------------ 460| 1.25M| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 461| 1.25M| } 462| | 463| 312k| return Self(r); 464| 312k| } pcurves_secp256r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEEEC2ERKSB_SE_: 928| 361k| constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {} pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 47.6k| std::array stash_value() const { 762| 47.6k| static_assert(L >= N); 763| 47.6k| std::array stash = {}; 764| 238k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 190k, False: 47.6k] ------------------ 765| 190k| stash[i] = m_val[i]; 766| 190k| } 767| 47.6k| return stash; 768| 47.6k| } pcurves_secp256r1.cpp:_ZNK5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6EE3mulERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_22Secp256r1MontgomeryRepEE12ScalarParamsEEEEERNS_21RandomNumberGeneratorE: 1632| 6.75k| ProjectivePoint mul(const Scalar& s, RandomNumberGenerator& rng) const { 1633| 6.75k| const BlindingRandomness blinding(rng); 1634| 6.75k| const BlindedScalar scalar(s, blinding); 1635| 6.75k| return basemul_booth_exec(m_table, scalar, blinding); 1636| 6.75k| } pcurves_secp256r1.cpp:_ZN5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm7EEELm1EEC2ERNS_21RandomNumberGeneratorE: 1455| 6.75k| explicit BlindingRandomness(RandomNumberGenerator& rng) : m_seeded(rng.is_seeded()) { 1456| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1457| 6.75k| if(m_seeded) { ------------------ | Branch (1457:13): [True: 488, False: 6.26k] ------------------ 1458| 488| std::array buf{}; 1459| 488| rng.randomize(buf); 1460| | 1461| 488| const std::span bytes(buf); 1462| | 1463| 488| copy_mem(m_masks, bytes.first()); 1464| | 1465| 2.44k| for(size_t i = 0; i != Rerandomizations; ++i) { ------------------ | Branch (1465:31): [True: 1.95k, False: 488] ------------------ 1466| 1.95k| const auto wide = bytes.subspan(Scalars * MaskBytes + i * WideBytes).first(); 1467| 1.95k| m_rerandomizers[i] = FieldElement::from_wide_bytes(wide); 1468| 1.95k| } 1469| | 1470| 488| const auto iso = bytes.subspan(Scalars * MaskBytes + Rerandomizations * WideBytes).first(); 1471| 488| m_isomorphism = FieldElement::from_wide_bytes(iso); 1472| 488| m_isomorphism.conditional_assign(m_isomorphism.is_zero(), FieldElement::one()); 1473| 488| } 1474| 6.75k| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEEC2Ev: 182| 28.3k| constexpr IntMod() : m_val({}) {} pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE15from_wide_bytesILm40EEESA_NSt3__14spanIKhXT_EEE: 818| 4.07k| static constexpr Self from_wide_bytes(std::span bytes) { 819| 4.07k| static_assert(8 * L <= 2 * Self::BITS); 820| 4.07k| std::array padded_bytes = {}; 821| 4.07k| copy_mem(std::span{padded_bytes}.template last(), bytes); 822| 4.07k| return Self(Rep::wide_to_rep(bytes_to_words(std::span{padded_bytes}))); 823| 4.07k| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE18conditional_assignENS_2CT6ChoiceERKSA_: 369| 306k| constexpr void conditional_assign(CT::Choice cond, const Self& nx) { 370| 306k| const W mask = cond.into_bitmask(); 371| | 372| 1.53M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (372:28): [True: 1.22M, False: 306k] ------------------ 373| 1.22M| m_val[i] = Botan::choose(mask, nx.m_val[i], m_val[i]); 374| 1.22M| } 375| 306k| } pcurves_secp256r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm7EEC2INS_18BlindingRandomnessIS5_Lm1EEEEERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_22Secp256r1MontgomeryRepEE12ScalarParamsEEEEERKT_m: 1368| 6.75k| BlindedScalarBits(const typename C::Scalar& scalar, const Randomness& randomness, size_t idx = 0) { 1369| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1370| 6.75k| if(BlindingBits > 0 && randomness.seeded()) { ------------------ | Branch (1370:13): [True: 6.75k, Folded] | Branch (1370:33): [True: 488, False: 6.26k] ------------------ 1371| 488| constexpr size_t n_words = C::Words; 1372| | 1373| 488| W mask[n_words] = {0}; 1374| 488| load_le(mask, randomness.mask(idx).data(), MaskWords); 1375| | 1376| | // Mask to exactly BlindingBits 1377| 488| constexpr size_t ExcessBits = MaskWords * WordInfo::bits - BlindingBits; 1378| 488| if constexpr(ExcessBits > 0) { 1379| 488| constexpr W ExcessMask = (static_cast(1) << (WordInfo::bits - ExcessBits)) - 1; 1380| 488| mask[MaskWords - 1] &= ExcessMask; 1381| 488| } 1382| | 1383| | // Set top and bottom bits of mask 1384| 488| constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo::bits; 1385| 488| mask[(BlindingBits - 1) / WordInfo::bits] |= static_cast(1) << TopMaskBit; 1386| 488| mask[0] |= 1; 1387| | 1388| 488| W mask_n[2 * n_words] = {0}; 1389| | 1390| 488| const auto sw = scalar.to_words(); 1391| | 1392| | // Compute masked scalar s + k*n 1393| 488| comba_mul(mask_n, mask, C::NW.data()); 1394| 488| bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size()); 1395| | 1396| 488| std::reverse(mask_n, mask_n + 2 * n_words); 1397| 488| m_bytes = store_be>(mask_n); 1398| 488| m_bits = C::Scalar::BITS + BlindingBits; 1399| 6.26k| } else { 1400| | // No RNG available, skip blinding 1401| 6.26k| m_bytes.resize(C::Scalar::BYTES); 1402| 6.26k| scalar.serialize_to(std::span{m_bytes}.template first()); 1403| 6.26k| m_bits = C::Scalar::BITS; 1404| 6.26k| } 1405| | 1406| 6.75k| CT::poison(m_bytes.data(), m_bytes.size()); 1407| 6.75k| } pcurves_secp256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm7EEELm1EE6seededEv: 1476| 6.75k| bool seeded() const { return m_seeded; } pcurves_secp256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm7EEELm1EE4maskEm: 1478| 488| std::span mask(size_t idx) const { 1479| 488| BOTAN_ASSERT_NOMSG(idx < Scalars); ------------------ | | 84| 488| do { \ | | 85| 488| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 488| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 488] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 488| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 488] | | ------------------ ------------------ 1480| 488| return std::span{m_masks}.subspan(idx * MaskBytes).template first(); 1481| 488| } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS4_22Secp256r1MontgomeryRepEE12ScalarParamsEEEE8to_wordsEv: 736| 815| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_secp256r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS3_22Secp256r1MontgomeryRepEE12ScalarParamsEE8from_repERKNSt3__15arrayImLm4EEE: 139| 13.8k| constexpr static std::array from_rep(const std::array& z) { 140| 13.8k| std::array ze = {}; 141| 13.8k| copy_mem(std::span{ze}.template first(), z); 142| 13.8k| return Self::redc(ze); 143| 13.8k| } pcurves_secp256r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS3_22Secp256r1MontgomeryRepEE12ScalarParamsEE4redcERKNSt3__15arrayImLm8EEE: 106| 20.5k| constexpr static std::array redc(const std::array& z) { 107| | if constexpr(P_dash == 1) { 108| | return monty_redc_pdash1(z, P); 109| 20.5k| } else { 110| 20.5k| return monty_redc(z, P, P_dash); 111| 20.5k| } 112| 20.5k| } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS4_22Secp256r1MontgomeryRepEE12ScalarParamsEEEE12serialize_toENSt3__14spanIhLm32EEE: 741| 13.0k| constexpr void serialize_to(std::span bytes) const { 742| 13.0k| auto v = Rep::from_rep(m_val); 743| 13.0k| std::reverse(v.begin(), v.end()); 744| | 745| 13.0k| if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| 13.0k| 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| 13.0k| } pcurves_secp256r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm7EE4bitsEv: 1362| 6.75k| size_t bits() const { return m_bits; } pcurves_secp256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E18conditional_assignENS_2CT6ChoiceERKSC_: 1095| 7.08k| constexpr void conditional_assign(CT::Choice cond, const Self& pt) { 1096| 7.08k| FieldElement::conditional_assign(m_x, m_y, m_z, cond, pt.x(), pt.y(), pt.z()); 1097| 7.08k| } pcurves_secp256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E6negateEv: 1194| 7.08k| constexpr Self negate() const { return Self(x(), y().negate(), z()); } pcurves_secp256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E18_const_time_poisonEv: 1226| 7.08k| constexpr void _const_time_poison() const { CT::poison_all(m_x, m_y, m_z); } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE18_const_time_poisonEv: 891| 21.2k| constexpr void _const_time_poison() const { CT::poison(m_val); } pcurves_secp256r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm7EE10get_windowEm: 1409| 293k| size_t get_window(size_t offset) const { 1410| | // Extract a WindowBits sized window out of s, depending on offset. 1411| 293k| return read_window_bits(std::span{m_bytes}, offset); 1412| 293k| } pcurves_secp256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E10add_or_subERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceE: 1121| 286k| constexpr static Self add_or_sub(const Self& a, const AffinePoint& b, CT::Choice sub) { 1122| 286k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), A); 1123| 286k| } pcurves_secp256r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEEE9ct_selectENSt3__14spanIKSC_Lm18446744073709551615EEEm: 966| 312k| static constexpr auto ct_select(std::span pts, size_t idx) { 967| 312k| auto result = Self::identity(pts[0]); 968| | 969| | // Intentionally wrapping; set to maximum size_t if idx == 0 970| 312k| const size_t idx1 = idx - 1; 971| 10.0M| for(size_t i = 0; i != pts.size(); ++i) { ------------------ | Branch (971:28): [True: 9.69M, False: 312k] ------------------ 972| 9.69M| const auto found = CT::Mask::is_equal(idx1, i).as_choice(); 973| 9.69M| result.conditional_assign(found, pts[i]); 974| 9.69M| } 975| | 976| 312k| return result; 977| 312k| } pcurves_secp256r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEEE8identityERKSC_: 935| 312k| static constexpr Self identity(const Self& /*unused*/) { 936| 312k| return Self(FieldElement::zero(), FieldElement::zero()); 937| 312k| } pcurves_secp256r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEEE18conditional_assignENS_2CT6ChoiceERKSC_: 992| 9.69M| constexpr void conditional_assign(CT::Choice cond, const Self& pt) { 993| 9.69M| FieldElement::conditional_assign(m_x, m_y, cond, pt.x(), pt.y()); 994| 9.69M| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE18conditional_assignERSA_SB_NS_2CT6ChoiceERKSA_SF_: 382| 9.69M| static constexpr void conditional_assign(Self& x, Self& y, CT::Choice cond, const Self& nx, const Self& ny) { 383| 9.69M| const W mask = cond.into_bitmask(); 384| | 385| 48.4M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (385:28): [True: 38.7M, False: 9.69M] ------------------ 386| 38.7M| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 387| 38.7M| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 388| 38.7M| } 389| 9.69M| } pcurves_secp256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm7EEELm1EE13randomize_repERNS_20ProjectiveCurvePointINS_6IntModINS3_22Secp256r1MontgomeryRepINS_13EllipticCurveINS4_6ParamsESA_E11FieldParamsEEEEESC_EEm: 1486| 27.0k| void randomize_rep(typename C::ProjectivePoint& pt, size_t idx) const { 1487| 27.0k| BOTAN_ASSERT_NOMSG(idx < Rerandomizations); ------------------ | | 84| 27.0k| do { \ | | 85| 27.0k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 27.0k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 27.0k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 27.0k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 27.0k] | | ------------------ ------------------ 1488| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1489| 27.0k| if(m_seeded) { ------------------ | Branch (1489:13): [True: 1.95k, False: 25.0k] ------------------ 1490| 1.95k| pt.randomize_rep(m_rerandomizers[idx]); 1491| 1.95k| } 1492| 27.0k| } pcurves_secp256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E13randomize_repERKSB_: 1202| 3.26k| void randomize_rep(const FieldElement& r) { 1203| 3.26k| const auto r2 = r.square(); 1204| 3.26k| const auto r3 = r2 * r; 1205| | 1206| 3.26k| m_x *= r2; 1207| 3.26k| m_y *= r3; 1208| 3.26k| m_z *= r; 1209| 3.26k| } pcurves_secp256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E20_const_time_unpoisonEv: 1228| 7.08k| constexpr void _const_time_unpoison() const { CT::unpoison_all(m_x, m_y, m_z); } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE20_const_time_unpoisonEv: 893| 21.2k| constexpr void _const_time_unpoison() const { CT::unpoison(m_val); } pcurves_secp256r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm7EED2Ev: 1414| 6.75k| ~BlindedScalarBits() { 1415| 6.75k| secure_zeroize_buffer(m_bytes.data(), m_bytes.size()); 1416| 6.75k| CT::unpoison(m_bytes.data(), m_bytes.size()); 1417| 6.75k| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS4_22Secp256r1MontgomeryRepEE12ScalarParamsEEEE10from_stashILm9EEESB_RKNSt3__15arrayImXT_EEE: 776| 20.5k| static Self from_stash(const std::array& stash) { 777| 20.5k| static_assert(L >= N); 778| 20.5k| std::array val = {}; 779| 102k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 82.3k, False: 20.5k] ------------------ 780| 82.3k| val[i] = stash[i]; 781| 82.3k| } 782| 20.5k| return Self(val); 783| 20.5k| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS4_22Secp256r1MontgomeryRepEE12ScalarParamsEEEEC2ENSt3__15arrayImLm4EEE: 908| 27.3k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE12serialize_toENSt3__14spanIhLm32EEE: 741| 28.9k| constexpr void serialize_to(std::span bytes) const { 742| 28.9k| auto v = Rep::from_rep(m_val); 743| 28.9k| std::reverse(v.begin(), v.end()); 744| | 745| 28.9k| if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| 28.9k| 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| 28.9k| } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS4_22Secp256r1MontgomeryRepEE12ScalarParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 6.75k| std::array stash_value() const { 762| 6.75k| static_assert(L >= N); 763| 6.75k| std::array stash = {}; 764| 33.7k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 27.0k, False: 6.75k] ------------------ 765| 27.0k| stash[i] = m_val[i]; 766| 27.0k| } 767| 6.75k| return stash; 768| 6.75k| } pcurves_secp256r1.cpp:_ZN5Botan12varpoint_mulINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm4EEENT_15ProjectivePointERKNS5_11AffinePointERKNS5_6ScalarERNS_21RandomNumberGeneratorE: 1680| 327| RandomNumberGenerator& rng) { 1681| 327| using ProjectivePoint = typename C::ProjectivePoint; 1682| | 1683| 327| constexpr size_t TableBits = W; 1684| 327| static_assert(TableBits >= 1 && TableBits <= 7); 1685| | 1686| 327| constexpr size_t WindowBits = TableBits + 1; 1687| | 1688| 327| using BlindedScalar = BlindedScalarBits; 1689| 327| using Blinding = BlindingRandomness; 1690| | 1691| | // 2^W elements [1*P, 2*P, ..., 2^W*P] 1692| 327| constexpr size_t TableSize = 1 << TableBits; 1693| | 1694| 327| const Blinding blinding(rng); 1695| 327| const SharedZPointTable table(p, TableSize, C::A, blinding.isomorphism()); 1696| 327| const BlindedScalar bits(s, blinding); 1697| | 1698| 327| const size_t scalar_bits = bits.bits(); 1699| 327| const size_t full_windows = booth_full_windows(scalar_bits + 1, WindowBits); 1700| 327| const size_t initial_shift = booth_initial_shift(scalar_bits + 1, WindowBits); 1701| | 1702| 327| BOTAN_DEBUG_ASSERT(full_windows * WindowBits + initial_shift == scalar_bits + 1); ------------------ | | 137| 327| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 327| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 327] | | ------------------ ------------------ 1703| 327| BOTAN_DEBUG_ASSERT(initial_shift > 0); ------------------ | | 137| 327| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 327| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 327] | | ------------------ ------------------ 1704| | 1705| 327| auto accum = ProjectivePoint::identity(); 1706| 327| CT::poison(accum); 1707| | 1708| 18.9k| for(size_t i = 0; i != full_windows; ++i) { ------------------ | Branch (1708:22): [True: 18.6k, False: 327] ------------------ 1709| 18.6k| const size_t idx = scalar_bits - initial_shift - WindowBits * i; 1710| | 1711| 18.6k| const size_t w_i = bits.get_window(idx); 1712| 18.6k| const auto [tidx, tneg] = booth_recode(w_i); 1713| | 1714| | // Conditional ok: loop iteration count is public 1715| 18.6k| if(i == 0) { ------------------ | Branch (1715:10): [True: 327, False: 18.3k] ------------------ 1716| 327| accum = ProjectivePoint::from_affine(table.ct_select(tidx)); 1717| 327| accum.conditional_assign(tneg, accum.negate()); 1718| 18.3k| } else { 1719| 18.3k| accum = ProjectivePoint::add_or_sub_iso(accum, table.ct_select(tidx), tneg, table.a()); 1720| 18.3k| } 1721| | 1722| 18.6k| accum = accum.dbl_n_iso(table.a(), WindowBits); 1723| | 1724| | // Conditional ok: loop iteration count is public 1725| 18.6k| if(i < Blinding::Rerandomizations) { ------------------ | Branch (1725:10): [True: 1.30k, False: 17.3k] ------------------ 1726| 1.30k| blinding.randomize_rep(accum, i); 1727| 1.30k| } 1728| 18.6k| } 1729| | 1730| | // final window (note one bit shorter than previous reads) 1731| 327| const size_t w_l = bits.get_window(0) & ((1 << WindowBits) - 1); 1732| 327| const auto [tidx, tneg] = booth_recode(w_l << 1); 1733| 327| accum = ProjectivePoint::add_or_sub_iso(accum, table.ct_select(tidx), tneg, table.a()); 1734| | 1735| 327| CT::unpoison(accum); 1736| | 1737| | // Map back from the isomorphic curve 1738| 327| return ProjectivePoint(accum.x(), accum.y(), accum.z() * table.z()); 1739| 327|} pcurves_secp256r1.cpp:_ZN5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6EEELm1EEC2ERNS_21RandomNumberGeneratorE: 1455| 327| explicit BlindingRandomness(RandomNumberGenerator& rng) : m_seeded(rng.is_seeded()) { 1456| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1457| 327| if(m_seeded) { ------------------ | Branch (1457:13): [True: 327, False: 0] ------------------ 1458| 327| std::array buf{}; 1459| 327| rng.randomize(buf); 1460| | 1461| 327| const std::span bytes(buf); 1462| | 1463| 327| copy_mem(m_masks, bytes.first()); 1464| | 1465| 1.63k| for(size_t i = 0; i != Rerandomizations; ++i) { ------------------ | Branch (1465:31): [True: 1.30k, False: 327] ------------------ 1466| 1.30k| const auto wide = bytes.subspan(Scalars * MaskBytes + i * WideBytes).first(); 1467| 1.30k| m_rerandomizers[i] = FieldElement::from_wide_bytes(wide); 1468| 1.30k| } 1469| | 1470| 327| const auto iso = bytes.subspan(Scalars * MaskBytes + Rerandomizations * WideBytes).first(); 1471| 327| m_isomorphism = FieldElement::from_wide_bytes(iso); 1472| 327| m_isomorphism.conditional_assign(m_isomorphism.is_zero(), FieldElement::one()); 1473| 327| } 1474| 327| } pcurves_secp256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6EEELm1EE11isomorphismEv: 1497| 327| const FieldElement& isomorphism() const { return m_isomorphism; } pcurves_secp256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E11add_mixed_hERKSC_RKNS_16AffineCurvePointISB_EE: 1116| 4.57k| constexpr static std::pair add_mixed_h(const Self& a, const AffinePoint& b) { 1117| 4.57k| return point_add_mixed_h(a, b, FieldElement::one(), A); 1118| 4.57k| } pcurves_secp256r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6EEC2INS_18BlindingRandomnessIS5_Lm1EEEEERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_22Secp256r1MontgomeryRepEE12ScalarParamsEEEEERKT_m: 1368| 327| BlindedScalarBits(const typename C::Scalar& scalar, const Randomness& randomness, size_t idx = 0) { 1369| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1370| 327| if(BlindingBits > 0 && randomness.seeded()) { ------------------ | Branch (1370:13): [True: 327, Folded] | Branch (1370:33): [True: 327, False: 0] ------------------ 1371| 327| constexpr size_t n_words = C::Words; 1372| | 1373| 327| W mask[n_words] = {0}; 1374| 327| load_le(mask, randomness.mask(idx).data(), MaskWords); 1375| | 1376| | // Mask to exactly BlindingBits 1377| 327| constexpr size_t ExcessBits = MaskWords * WordInfo::bits - BlindingBits; 1378| 327| if constexpr(ExcessBits > 0) { 1379| 327| constexpr W ExcessMask = (static_cast(1) << (WordInfo::bits - ExcessBits)) - 1; 1380| 327| mask[MaskWords - 1] &= ExcessMask; 1381| 327| } 1382| | 1383| | // Set top and bottom bits of mask 1384| 327| constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo::bits; 1385| 327| mask[(BlindingBits - 1) / WordInfo::bits] |= static_cast(1) << TopMaskBit; 1386| 327| mask[0] |= 1; 1387| | 1388| 327| W mask_n[2 * n_words] = {0}; 1389| | 1390| 327| const auto sw = scalar.to_words(); 1391| | 1392| | // Compute masked scalar s + k*n 1393| 327| comba_mul(mask_n, mask, C::NW.data()); 1394| 327| bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size()); 1395| | 1396| 327| std::reverse(mask_n, mask_n + 2 * n_words); 1397| 327| m_bytes = store_be>(mask_n); 1398| 327| m_bits = C::Scalar::BITS + BlindingBits; 1399| 327| } else { 1400| | // No RNG available, skip blinding 1401| 0| m_bytes.resize(C::Scalar::BYTES); 1402| 0| scalar.serialize_to(std::span{m_bytes}.template first()); 1403| 0| m_bits = C::Scalar::BITS; 1404| 0| } 1405| | 1406| 327| CT::poison(m_bytes.data(), m_bytes.size()); 1407| 327| } pcurves_secp256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6EEELm1EE6seededEv: 1476| 327| bool seeded() const { return m_seeded; } pcurves_secp256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6EEELm1EE4maskEm: 1478| 327| std::span mask(size_t idx) const { 1479| 327| BOTAN_ASSERT_NOMSG(idx < Scalars); ------------------ | | 84| 327| do { \ | | 85| 327| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 327| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 327] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 327| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 327] | | ------------------ ------------------ 1480| 327| return std::span{m_masks}.subspan(idx * MaskBytes).template first(); 1481| 327| } pcurves_secp256r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6EE4bitsEv: 1362| 327| size_t bits() const { return m_bits; } pcurves_secp256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E8identityEv: 1049| 327| static constexpr Self identity() { return Self(FieldElement::zero(), FieldElement::one(), FieldElement::zero()); } pcurves_secp256r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6EE10get_windowEm: 1409| 18.9k| size_t get_window(size_t offset) const { 1410| | // Extract a WindowBits sized window out of s, depending on offset. 1411| 18.9k| return read_window_bits(std::span{m_bytes}, offset); 1412| 18.9k| } pcurves_secp256r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E14add_or_sub_isoERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceERKSB_: 1131| 18.6k| const FieldElement& curve_a) { 1132| 18.6k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), curve_a); 1133| 18.6k| } pcurves_secp256r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEES7_E9dbl_n_isoERKSB_m: 1159| 18.6k| constexpr Self dbl_n_iso(const FieldElement& a, size_t n) const { 1160| | if constexpr(Self::A_is_zero) { 1161| | return dbl_n_a_zero(*this, n); 1162| 18.6k| } else { 1163| 18.6k| return dbl_n_generic(*this, a, n); 1164| 18.6k| } 1165| 18.6k| } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE4div2Ev: 304| 18.6k| 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| 18.6k| 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| 18.6k| std::array t = value(); 312| 18.6k| const W borrow = shift_right<1>(t); 313| | 314| | // If value was odd, add (P/2)+1 315| 18.6k| const auto mask = CT::Mask::expand(borrow).value(); 316| | 317| 18.6k| W carry = 0; 318| | 319| 93.1k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (319:28): [True: 74.5k, False: 18.6k] ------------------ 320| 74.5k| t[i] = word_add(t[i], INV_2[i] & mask, &carry); 321| 74.5k| } 322| | 323| 18.6k| return Self(t); 324| 18.6k| } pcurves_secp256r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6EEELm1EE13randomize_repERNS_20ProjectiveCurvePointINS_6IntModINS3_22Secp256r1MontgomeryRepINS_13EllipticCurveINS4_6ParamsESA_E11FieldParamsEEEEESC_EEm: 1486| 1.30k| void randomize_rep(typename C::ProjectivePoint& pt, size_t idx) const { 1487| 1.30k| BOTAN_ASSERT_NOMSG(idx < Rerandomizations); ------------------ | | 84| 1.30k| do { \ | | 85| 1.30k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 1.30k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 1.30k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 1.30k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 1.30k] | | ------------------ ------------------ 1488| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1489| 1.30k| if(m_seeded) { ------------------ | Branch (1489:13): [True: 1.30k, False: 0] ------------------ 1490| 1.30k| pt.randomize_rep(m_rerandomizers[idx]); 1491| 1.30k| } 1492| 1.30k| } pcurves_secp256r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6EED2Ev: 1414| 327| ~BlindedScalarBits() { 1415| 327| secure_zeroize_buffer(m_bytes.data(), m_bytes.size()); 1416| 327| CT::unpoison(m_bytes.data(), m_bytes.size()); 1417| 327| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE: 776| 78.2k| static Self from_stash(const std::array& stash) { 777| 78.2k| static_assert(L >= N); 778| 78.2k| std::array val = {}; 779| 391k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 312k, False: 78.2k] ------------------ 780| 312k| val[i] = stash[i]; 781| 312k| } 782| 78.2k| return Self(val); 783| 78.2k| } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS4_22Secp256r1MontgomeryRepEE12ScalarParamsEEEE7is_zeroEv: 227| 13.5k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 13.6k| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 13.6k| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 13.6k] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 13.6k| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 13.6k| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 4, False: 13.6k] ------------------ 804| 4| return {}; 805| 4| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 13.6k| return Self::from_words(words); 809| 13.6k| } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEEeqERKSA_: 724| 13.7k| constexpr CT::Choice operator==(const Self& other) const { 725| 13.7k| return CT::is_equal(this->data(), other.data(), N).as_choice(); 726| 13.7k| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE10from_wordsILm4EEESA_NSt3__15arrayImXT_EEE: 213| 13.6k| static constexpr Self from_words(std::array w) { 214| 13.6k| if constexpr(L == N) { 215| 13.6k| 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| 13.6k| } pcurves_secp256r1.cpp:_ZN5Botan13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS2_22Secp256r1MontgomeryRepEE7x3_ax_bERKNS_6IntModINS5_INS6_11FieldParamsEEEEE: 1327| 13.7k| static constexpr FieldElement x3_ax_b(const FieldElement& x) { return (x.square() + A) * x + B; } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE12correct_signENS_2CT6ChoiceE: 250| 327| constexpr Self correct_sign(CT::Choice even) const { 251| 327| const auto flip = (even != this->is_even()); 252| 327| return Self::choose(flip, this->negate(), *this); 253| 327| } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE7is_evenEv: 242| 327| constexpr CT::Choice is_even() const { 243| 327| auto v = Rep::from_rep(m_val); 244| 327| return !CT::Choice::from_int(v[0] & 0x01); 245| 327| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS2_9secp256r16ParamsES3_E11FieldParamsEEEE6chooseENS_2CT6ChoiceERKSA_SE_: 258| 327| static constexpr Self choose(CT::Choice choice, const Self& x, const Self& y) { 259| 327| auto r = y; 260| 327| r.conditional_assign(choice, x); 261| 327| return r; 262| 327| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS4_22Secp256r1MontgomeryRepEE12ScalarParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 6.75k| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 6.75k| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 6.75k] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 6.75k| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 6.75k| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 0, False: 6.75k] ------------------ 804| 0| return {}; 805| 0| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 6.75k| return Self::from_words(words); 809| 6.75k| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS4_22Secp256r1MontgomeryRepEE12ScalarParamsEEEE10from_wordsILm4EEESB_NSt3__15arrayImXT_EEE: 213| 6.75k| static constexpr Self from_words(std::array w) { 214| 6.75k| if constexpr(L == N) { 215| 6.75k| 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| 6.75k| } pcurves_secp256r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS3_22Secp256r1MontgomeryRepEE12ScalarParamsEE6to_repERKNSt3__15arrayImLm4EEE: 117| 6.75k| constexpr static std::array to_rep(const std::array& x) { 118| 6.75k| std::array z; // NOLINT(*-member-init) 119| 6.75k| comba_mul(z.data(), x.data(), R2.data()); 120| 6.75k| return Self::redc(z); 121| 6.75k| } pcurves_secp256r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS3_9secp256r16ParamsES4_E11FieldParamsEEEEEE12serialize_toENSt3__14spanIhLm65EEE: 952| 14.3k| constexpr void serialize_to(std::span bytes) const { 953| 14.3k| BOTAN_STATE_CHECK(this->is_identity().as_bool() == false); ------------------ | | 51| 14.3k| do { \ | | 52| 14.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 14.3k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 14.3k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 14.3k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 14.3k] | | ------------------ ------------------ 954| 14.3k| BufferStuffer pack(bytes); 955| 14.3k| pack.append(0x04); 956| 14.3k| x().serialize_to(pack.next()); 957| 14.3k| y().serialize_to(pack.next()); 958| 14.3k| BOTAN_DEBUG_ASSERT(pack.full()); ------------------ | | 137| 14.3k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 14.3k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 14.3k] | | ------------------ ------------------ 959| 14.3k| } pcurves_secp256r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS4_22Secp256r1MontgomeryRepEE12ScalarParamsEEEE6randomERNS_21RandomNumberGeneratorE: 853| 488| static Self random(RandomNumberGenerator& rng) { 854| 488| constexpr size_t MAX_ATTEMPTS = 1000; 855| | 856| 488| std::array buf{}; 857| | 858| 488| for(size_t i = 0; i != MAX_ATTEMPTS; ++i) { ------------------ | Branch (858:28): [True: 488, False: 0] ------------------ 859| 488| rng.randomize(buf); 860| | 861| | // Zero off high bits that if set would certainly cause us 862| | // to be out of range 863| | if constexpr(Self::BITS % 8 != 0) { 864| | constexpr uint8_t mask = 0xFF >> (8 - (Self::BITS % 8)); 865| | buf[0] &= mask; 866| | } 867| | 868| | // Conditionals ok: rejection sampling reveals only values we didn't use 869| 488| if(auto s = Self::deserialize(buf)) { ------------------ | Branch (869:21): [True: 488, False: 0] ------------------ 870| 488| if(s.value().is_nonzero().as_bool()) { ------------------ | Branch (870:19): [True: 488, False: 0] ------------------ 871| 488| return s.value(); 872| 488| } 873| 488| } 874| 488| } 875| | 876| 0| throw Internal_Error("Failed to generate random Scalar within bounded number of attempts"); 877| 488| } pcurves_secp256r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp256r16ParamsENS4_22Secp256r1MontgomeryRepEE12ScalarParamsEEEE10is_nonzeroEv: 232| 488| constexpr CT::Choice is_nonzero() const { return !is_zero(); } 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| 795| 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| 795| const auto x = pt.x(); 1038| 795| auto y = pt.y(); 1039| 795| auto z = FieldElement::one(); 1040| | 1041| 795| FieldElement::conditional_swap(pt.is_identity(), y, z); 1042| | 1043| 795| return ProjectiveCurvePoint(x, y, z); 1044| 795| } pcurves_secp384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE1xEv: 982| 1.31M| constexpr const FieldElement& x() const { return m_x; } pcurves_secp384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE1yEv: 987| 1.27M| constexpr const FieldElement& y() const { return m_y; } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE3oneEv: 202| 50.1k| static constexpr Self one() { return Self(Rep::one()); } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEC2ENSt3__15arrayImLm6EEE: 908| 2.51M| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 412| 795| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 413| 795| const W mask = cond.into_bitmask(); 414| | 415| 5.56k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (415:28): [True: 4.77k, False: 795] ------------------ 416| 4.77k| const auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 417| 4.77k| const auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 418| 4.77k| x.m_val[i] = nx; 419| 4.77k| y.m_val[i] = ny; 420| 4.77k| } 421| 795| } pcurves_secp384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE11is_identityEv: 939| 51.5k| 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| 254k| 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| 70.7k| m_x(x), m_y(y), m_z(z) {} pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E3dblEv: 1181| 1.45k| constexpr Self dbl() const { 1182| 1.45k| if constexpr(Self::A_is_minus_3) { 1183| 1.45k| 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.45k| } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E1zEv: 1224| 281k| constexpr const FieldElement& z() const { return m_z; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE6squareEv: 428| 563k| constexpr BOTAN_FORCE_INLINE Self square() const { 429| 563k| std::array z; // NOLINT(*-member-init) 430| 563k| comba_sqr(z.data(), this->data()); 431| 563k| return Self(Rep::redc(z)); 432| 563k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4dataEv: 898| 2.54M| constexpr const W* data() const { return m_val.data(); } pcurves_secp384r1.cpp:_ZN5BotanmlERKNS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEESC_: 348| 631k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 349| 631k| std::array z; // NOLINT(*-member-init) 350| 631k| comba_mul(z.data(), a.data(), b.data()); 351| 631k| return Self(Rep::redc(z)); 352| 631k| } pcurves_secp384r1.cpp:_ZN5BotanmiERKNS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEESC_: 283| 570k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 284| 570k| std::array r; // NOLINT(*-member-init) 285| 570k| W carry = 0; 286| 3.99M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (286:28): [True: 3.42M, False: 570k] ------------------ 287| 3.42M| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 288| 3.42M| } 289| | 290| 570k| const auto mask = CT::Mask::expand(carry).value(); 291| | 292| 570k| carry = 0; 293| | 294| 3.99M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (294:28): [True: 3.42M, False: 570k] ------------------ 295| 3.42M| r[i] = word_add(r[i], P[i] & mask, &carry); 296| 3.42M| } 297| | 298| 570k| return Self(r); 299| 570k| } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E1xEv: 1214| 178k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4mul3Ev: 337| 91.7k| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_secp384r1.cpp:_ZN5BotanplERKNS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEESC_: 267| 234k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 268| 234k| std::array t; // NOLINT(*-member-init) 269| | 270| 234k| W carry = 0; 271| 1.64M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (271:28): [True: 1.40M, False: 234k] ------------------ 272| 1.40M| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 273| 1.40M| } 274| | 275| 234k| std::array r; // NOLINT(*-member-init) 276| 234k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 277| 234k| return Self(r); 278| 234k| } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E1yEv: 1219| 176k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4mul4Ev: 340| 1.45k| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4mul2Ev: 327| 300k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 328| 300k| std::array t = value(); 329| 300k| const W carry = shift_left<1>(t); 330| | 331| 300k| std::array r; // NOLINT(*-member-init) 332| 300k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 333| 300k| return Self(r); 334| 300k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE5valueEv: 896| 318k| constexpr const std::array& value() const { return m_val; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4mul8Ev: 343| 1.45k| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_secp384r1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_EESE_: 1075| 1.09k| 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| 1.09k| 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| 52.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| 98.6k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 398| 98.6k| const W mask = cond.into_bitmask(); 399| | 400| 690k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (400:28): [True: 591k, False: 98.6k] ------------------ 401| 591k| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 402| 591k| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 403| 591k| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 404| 591k| } 405| 98.6k| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEmLERKSA_: 357| 182k| constexpr BOTAN_FORCE_INLINE Self& operator*=(const Self& other) { 358| 182k| std::array z; // NOLINT(*-member-init) 359| 182k| comba_mul(z.data(), data(), other.data()); 360| 182k| m_val = Rep::redc(z); 361| 182k| return (*this); 362| 182k| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE8square_nEm: 441| 9.35k| constexpr void square_n(size_t n) { 442| 9.35k| std::array z; // NOLINT(*-member-init) 443| 312k| for(size_t i = 0; i != n; ++i) { ------------------ | Branch (443:28): [True: 302k, False: 9.35k] ------------------ 444| 302k| comba_sqr(z.data(), this->data()); 445| 302k| m_val = Rep::redc(z); 446| 302k| } 447| 9.35k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_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| 252| for(;;) { 620| | // Conditional ok: this function is variable time 621| 252| if(a.m_val == b.m_val) { ------------------ | Branch (621:16): [True: 1, False: 251] ------------------ 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| 251| 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| 251| std::array r; // NOLINT(*-member-init) 642| 251| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 643| | 644| | // Conditional ok: this function is variable time 645| 251| if(carry == 0) { ------------------ | Branch (645:16): [True: 118, False: 133] ------------------ 646| | // b > a 647| 118| b.m_val = r; 648| 118| x = nx; 649| 118| Self::_invert_vartime_div2_helper(b, x); 650| 133| } else { 651| | // We know this can't underflow because a > b 652| 133| bigint_sub3(r.data(), a.data(), N, b.data(), N); 653| 133| a.m_val = r; 654| 133| y = nx; 655| 133| Self::_invert_vartime_div2_helper(a, y); 656| 133| } 657| 251| } 658| 1| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4zeroEv: 197| 91.7k| static constexpr Self zero() { return Self(std::array{0}); } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE8to_wordsEv: 736| 1| 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| 253| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 550| 253| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 551| | 552| | // Conditional ok: this function is variable time 553| 809| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (553:16): [True: 556, False: 253] ------------------ 554| 556| shift_right<1>(a.m_val); 555| | 556| 556| const W borrow = shift_right<1>(x.m_val); 557| | 558| | // Conditional ok: this function is variable time 559| 556| if(borrow) { ------------------ | Branch (559:16): [True: 248, False: 308] ------------------ 560| 248| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 561| 248| } 562| 556| } 563| 253| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE6negateEv: 454| 45.7k| constexpr Self negate() const { 455| 45.7k| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 456| | 457| 45.7k| std::array r; // NOLINT(*-member-init) 458| 45.7k| W carry = 0; 459| 320k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (459:28): [True: 274k, False: 45.7k] ------------------ 460| 274k| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 461| 274k| } 462| | 463| 45.7k| return Self(r); 464| 45.7k| } pcurves_secp384r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEEC2ERKSB_SE_: 928| 54.7k| 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| 2.71k| std::array stash_value() const { 762| 2.71k| static_assert(L >= N); 763| 2.71k| std::array stash = {}; 764| 18.9k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 16.2k, False: 2.71k] ------------------ 765| 16.2k| stash[i] = m_val[i]; 766| 16.2k| } 767| 2.71k| return stash; 768| 2.71k| } pcurves_secp384r1.cpp:_ZNK5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EE3mulERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_12Secp384r1RepEE12ScalarParamsEEEEERNS_21RandomNumberGeneratorE: 1632| 374| ProjectivePoint mul(const Scalar& s, RandomNumberGenerator& rng) const { 1633| 374| const BlindingRandomness blinding(rng); 1634| 374| const BlindedScalar scalar(s, blinding); 1635| 374| return basemul_booth_exec(m_table, scalar, blinding); 1636| 374| } pcurves_secp384r1.cpp:_ZN5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm7EEELm1EEC2ERNS_21RandomNumberGeneratorE: 1455| 374| explicit BlindingRandomness(RandomNumberGenerator& rng) : m_seeded(rng.is_seeded()) { 1456| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1457| 374| if(m_seeded) { ------------------ | Branch (1457:13): [True: 374, False: 0] ------------------ 1458| 374| std::array buf{}; 1459| 374| rng.randomize(buf); 1460| | 1461| 374| const std::span bytes(buf); 1462| | 1463| 374| copy_mem(m_masks, bytes.first()); 1464| | 1465| 1.87k| for(size_t i = 0; i != Rerandomizations; ++i) { ------------------ | Branch (1465:31): [True: 1.49k, False: 374] ------------------ 1466| 1.49k| const auto wide = bytes.subspan(Scalars * MaskBytes + i * WideBytes).first(); 1467| 1.49k| m_rerandomizers[i] = FieldElement::from_wide_bytes(wide); 1468| 1.49k| } 1469| | 1470| 374| const auto iso = bytes.subspan(Scalars * MaskBytes + Rerandomizations * WideBytes).first(); 1471| 374| m_isomorphism = FieldElement::from_wide_bytes(iso); 1472| 374| m_isomorphism.conditional_assign(m_isomorphism.is_zero(), FieldElement::one()); 1473| 374| } 1474| 374| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEC2Ev: 182| 2.33k| constexpr IntMod() : m_val({}) {} pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE15from_wide_bytesILm56EEESA_NSt3__14spanIKhXT_EEE: 818| 2.92k| static constexpr Self from_wide_bytes(std::span bytes) { 819| 2.92k| static_assert(8 * L <= 2 * Self::BITS); 820| 2.92k| std::array padded_bytes = {}; 821| 2.92k| copy_mem(std::span{padded_bytes}.template last(), bytes); 822| 2.92k| return Self(Rep::wide_to_rep(bytes_to_words(std::span{padded_bytes}))); 823| 2.92k| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE18conditional_assignENS_2CT6ChoiceERKSA_: 369| 45.9k| constexpr void conditional_assign(CT::Choice cond, const Self& nx) { 370| 45.9k| const W mask = cond.into_bitmask(); 371| | 372| 321k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (372:28): [True: 275k, False: 45.9k] ------------------ 373| 275k| m_val[i] = Botan::choose(mask, nx.m_val[i], m_val[i]); 374| 275k| } 375| 45.9k| } pcurves_secp384r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm7EEC2INS_18BlindingRandomnessIS5_Lm1EEEEERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_12Secp384r1RepEE12ScalarParamsEEEEERKT_m: 1368| 374| BlindedScalarBits(const typename C::Scalar& scalar, const Randomness& randomness, size_t idx = 0) { 1369| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1370| 374| if(BlindingBits > 0 && randomness.seeded()) { ------------------ | Branch (1370:13): [True: 374, Folded] | Branch (1370:33): [True: 374, False: 0] ------------------ 1371| 374| constexpr size_t n_words = C::Words; 1372| | 1373| 374| W mask[n_words] = {0}; 1374| 374| load_le(mask, randomness.mask(idx).data(), MaskWords); 1375| | 1376| | // Mask to exactly BlindingBits 1377| 374| constexpr size_t ExcessBits = MaskWords * WordInfo::bits - BlindingBits; 1378| 374| if constexpr(ExcessBits > 0) { 1379| 374| constexpr W ExcessMask = (static_cast(1) << (WordInfo::bits - ExcessBits)) - 1; 1380| 374| mask[MaskWords - 1] &= ExcessMask; 1381| 374| } 1382| | 1383| | // Set top and bottom bits of mask 1384| 374| constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo::bits; 1385| 374| mask[(BlindingBits - 1) / WordInfo::bits] |= static_cast(1) << TopMaskBit; 1386| 374| mask[0] |= 1; 1387| | 1388| 374| W mask_n[2 * n_words] = {0}; 1389| | 1390| 374| const auto sw = scalar.to_words(); 1391| | 1392| | // Compute masked scalar s + k*n 1393| 374| comba_mul(mask_n, mask, C::NW.data()); 1394| 374| bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size()); 1395| | 1396| 374| std::reverse(mask_n, mask_n + 2 * n_words); 1397| 374| m_bytes = store_be>(mask_n); 1398| 374| m_bits = C::Scalar::BITS + BlindingBits; 1399| 374| } else { 1400| | // No RNG available, skip blinding 1401| 0| m_bytes.resize(C::Scalar::BYTES); 1402| 0| scalar.serialize_to(std::span{m_bytes}.template first()); 1403| 0| m_bits = C::Scalar::BITS; 1404| 0| } 1405| | 1406| 374| CT::poison(m_bytes.data(), m_bytes.size()); 1407| 374| } pcurves_secp384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm7EEELm1EE6seededEv: 1476| 374| bool seeded() const { return m_seeded; } pcurves_secp384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm7EEELm1EE4maskEm: 1478| 374| std::span mask(size_t idx) const { 1479| 374| BOTAN_ASSERT_NOMSG(idx < Scalars); ------------------ | | 84| 374| do { \ | | 85| 374| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 374| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 374] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 374| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 374] | | ------------------ ------------------ 1480| 374| return std::span{m_masks}.subspan(idx * MaskBytes).template first(); 1481| 374| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE8to_wordsEv: 736| 584| 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| 958| constexpr static std::array from_rep(const std::array& z) { 140| 958| std::array ze = {}; 141| 958| copy_mem(std::span{ze}.template first(), z); 142| 958| return Self::redc(ze); 143| 958| } pcurves_secp384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS3_12Secp384r1RepEE12ScalarParamsEE4redcERKNSt3__15arrayImLm12EEE: 106| 1.33k| constexpr static std::array redc(const std::array& z) { 107| | if constexpr(P_dash == 1) { 108| | return monty_redc_pdash1(z, P); 109| 1.33k| } else { 110| 1.33k| return monty_redc(z, P, P_dash); 111| 1.33k| } 112| 1.33k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE12serialize_toENSt3__14spanIhLm48EEE: 741| 374| constexpr void serialize_to(std::span bytes) const { 742| 374| auto v = Rep::from_rep(m_val); 743| 374| std::reverse(v.begin(), v.end()); 744| | 745| 374| if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| 374| 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| 374| } pcurves_secp384r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm7EE4bitsEv: 1362| 374| size_t bits() const { return m_bits; } pcurves_secp384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E18conditional_assignENS_2CT6ChoiceERKSC_: 1095| 584| constexpr void conditional_assign(CT::Choice cond, const Self& pt) { 1096| 584| FieldElement::conditional_assign(m_x, m_y, m_z, cond, pt.x(), pt.y(), pt.z()); 1097| 584| } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E6negateEv: 1194| 584| constexpr Self negate() const { return Self(x(), y().negate(), z()); } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E18_const_time_poisonEv: 1226| 584| constexpr void _const_time_poison() const { CT::poison_all(m_x, m_y, m_z); } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE18_const_time_poisonEv: 891| 1.75k| constexpr void _const_time_poison() const { CT::poison(m_val); } pcurves_secp384r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm7EE10get_windowEm: 1409| 27.3k| size_t get_window(size_t offset) const { 1410| | // Extract a WindowBits sized window out of s, depending on offset. 1411| 27.3k| return read_window_bits(std::span{m_bytes}, offset); 1412| 27.3k| } pcurves_secp384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E10add_or_subERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceE: 1121| 26.9k| constexpr static Self add_or_sub(const Self& a, const AffinePoint& b, CT::Choice sub) { 1122| 26.9k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), A); 1123| 26.9k| } pcurves_secp384r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE9ct_selectENSt3__14spanIKSC_Lm18446744073709551615EEEm: 966| 45.5k| static constexpr auto ct_select(std::span pts, size_t idx) { 967| 45.5k| auto result = Self::identity(pts[0]); 968| | 969| | // Intentionally wrapping; set to maximum size_t if idx == 0 970| 45.5k| const size_t idx1 = idx - 1; 971| 1.21M| for(size_t i = 0; i != pts.size(); ++i) { ------------------ | Branch (971:28): [True: 1.16M, False: 45.5k] ------------------ 972| 1.16M| const auto found = CT::Mask::is_equal(idx1, i).as_choice(); 973| 1.16M| result.conditional_assign(found, pts[i]); 974| 1.16M| } 975| | 976| 45.5k| return result; 977| 45.5k| } pcurves_secp384r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE8identityERKSC_: 935| 45.5k| static constexpr Self identity(const Self& /*unused*/) { 936| 45.5k| return Self(FieldElement::zero(), FieldElement::zero()); 937| 45.5k| } pcurves_secp384r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE18conditional_assignENS_2CT6ChoiceERKSC_: 992| 1.16M| constexpr void conditional_assign(CT::Choice cond, const Self& pt) { 993| 1.16M| FieldElement::conditional_assign(m_x, m_y, cond, pt.x(), pt.y()); 994| 1.16M| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE18conditional_assignERSA_SB_NS_2CT6ChoiceERKSA_SF_: 382| 1.16M| static constexpr void conditional_assign(Self& x, Self& y, CT::Choice cond, const Self& nx, const Self& ny) { 383| 1.16M| const W mask = cond.into_bitmask(); 384| | 385| 8.16M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (385:28): [True: 6.99M, False: 1.16M] ------------------ 386| 6.99M| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 387| 6.99M| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 388| 6.99M| } 389| 1.16M| } pcurves_secp384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm7EEELm1EE13randomize_repERNS_20ProjectiveCurvePointINS_6IntModINS3_12Secp384r1RepINS_13EllipticCurveINS4_6ParamsESA_E11FieldParamsEEEEESC_EEm: 1486| 1.49k| void randomize_rep(typename C::ProjectivePoint& pt, size_t idx) const { 1487| 1.49k| BOTAN_ASSERT_NOMSG(idx < Rerandomizations); ------------------ | | 84| 1.49k| do { \ | | 85| 1.49k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 1.49k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 1.49k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 1.49k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 1.49k] | | ------------------ ------------------ 1488| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1489| 1.49k| if(m_seeded) { ------------------ | Branch (1489:13): [True: 1.49k, False: 0] ------------------ 1490| 1.49k| pt.randomize_rep(m_rerandomizers[idx]); 1491| 1.49k| } 1492| 1.49k| } pcurves_secp384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E13randomize_repERKSB_: 1202| 2.33k| void randomize_rep(const FieldElement& r) { 1203| 2.33k| const auto r2 = r.square(); 1204| 2.33k| const auto r3 = r2 * r; 1205| | 1206| 2.33k| m_x *= r2; 1207| 2.33k| m_y *= r3; 1208| 2.33k| m_z *= r; 1209| 2.33k| } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E20_const_time_unpoisonEv: 1228| 584| constexpr void _const_time_unpoison() const { CT::unpoison_all(m_x, m_y, m_z); } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE20_const_time_unpoisonEv: 893| 1.75k| constexpr void _const_time_unpoison() const { CT::unpoison(m_val); } pcurves_secp384r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm7EED2Ev: 1414| 374| ~BlindedScalarBits() { 1415| 374| secure_zeroize_buffer(m_bytes.data(), m_bytes.size()); 1416| 374| CT::unpoison(m_bytes.data(), m_bytes.size()); 1417| 374| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE10from_stashILm9EEESB_RKNSt3__15arrayImXT_EEE: 776| 1.33k| static Self from_stash(const std::array& stash) { 777| 1.33k| static_assert(L >= N); 778| 1.33k| std::array val = {}; 779| 9.32k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 7.99k, False: 1.33k] ------------------ 780| 7.99k| val[i] = stash[i]; 781| 7.99k| } 782| 1.33k| return Self(val); 783| 1.33k| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEEC2ENSt3__15arrayImLm6EEE: 908| 1.70k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE12serialize_toENSt3__14spanIhLm48EEE: 741| 2.63k| constexpr void serialize_to(std::span bytes) const { 742| 2.63k| auto v = Rep::from_rep(m_val); 743| 2.63k| std::reverse(v.begin(), v.end()); 744| | 745| 2.63k| if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| 2.63k| 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| 2.63k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 374| std::array stash_value() const { 762| 374| static_assert(L >= N); 763| 374| std::array stash = {}; 764| 2.61k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 2.24k, False: 374] ------------------ 765| 2.24k| stash[i] = m_val[i]; 766| 2.24k| } 767| 374| return stash; 768| 374| } pcurves_secp384r1.cpp:_ZN5Botan12varpoint_mulINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm4EEENT_15ProjectivePointERKNS5_11AffinePointERKNS5_6ScalarERNS_21RandomNumberGeneratorE: 1680| 210| RandomNumberGenerator& rng) { 1681| 210| using ProjectivePoint = typename C::ProjectivePoint; 1682| | 1683| 210| constexpr size_t TableBits = W; 1684| 210| static_assert(TableBits >= 1 && TableBits <= 7); 1685| | 1686| 210| constexpr size_t WindowBits = TableBits + 1; 1687| | 1688| 210| using BlindedScalar = BlindedScalarBits; 1689| 210| using Blinding = BlindingRandomness; 1690| | 1691| | // 2^W elements [1*P, 2*P, ..., 2^W*P] 1692| 210| constexpr size_t TableSize = 1 << TableBits; 1693| | 1694| 210| const Blinding blinding(rng); 1695| 210| const SharedZPointTable table(p, TableSize, C::A, blinding.isomorphism()); 1696| 210| const BlindedScalar bits(s, blinding); 1697| | 1698| 210| const size_t scalar_bits = bits.bits(); 1699| 210| const size_t full_windows = booth_full_windows(scalar_bits + 1, WindowBits); 1700| 210| const size_t initial_shift = booth_initial_shift(scalar_bits + 1, WindowBits); 1701| | 1702| 210| BOTAN_DEBUG_ASSERT(full_windows * WindowBits + initial_shift == scalar_bits + 1); ------------------ | | 137| 210| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 210| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 210] | | ------------------ ------------------ 1703| 210| BOTAN_DEBUG_ASSERT(initial_shift > 0); ------------------ | | 137| 210| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 210| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 210] | | ------------------ ------------------ 1704| | 1705| 210| auto accum = ProjectivePoint::identity(); 1706| 210| CT::poison(accum); 1707| | 1708| 18.2k| for(size_t i = 0; i != full_windows; ++i) { ------------------ | Branch (1708:22): [True: 18.0k, False: 210] ------------------ 1709| 18.0k| const size_t idx = scalar_bits - initial_shift - WindowBits * i; 1710| | 1711| 18.0k| const size_t w_i = bits.get_window(idx); 1712| 18.0k| const auto [tidx, tneg] = booth_recode(w_i); 1713| | 1714| | // Conditional ok: loop iteration count is public 1715| 18.0k| if(i == 0) { ------------------ | Branch (1715:10): [True: 210, False: 17.8k] ------------------ 1716| 210| accum = ProjectivePoint::from_affine(table.ct_select(tidx)); 1717| 210| accum.conditional_assign(tneg, accum.negate()); 1718| 17.8k| } else { 1719| 17.8k| accum = ProjectivePoint::add_or_sub_iso(accum, table.ct_select(tidx), tneg, table.a()); 1720| 17.8k| } 1721| | 1722| 18.0k| accum = accum.dbl_n_iso(table.a(), WindowBits); 1723| | 1724| | // Conditional ok: loop iteration count is public 1725| 18.0k| if(i < Blinding::Rerandomizations) { ------------------ | Branch (1725:10): [True: 840, False: 17.2k] ------------------ 1726| 840| blinding.randomize_rep(accum, i); 1727| 840| } 1728| 18.0k| } 1729| | 1730| | // final window (note one bit shorter than previous reads) 1731| 210| const size_t w_l = bits.get_window(0) & ((1 << WindowBits) - 1); 1732| 210| const auto [tidx, tneg] = booth_recode(w_l << 1); 1733| 210| accum = ProjectivePoint::add_or_sub_iso(accum, table.ct_select(tidx), tneg, table.a()); 1734| | 1735| 210| CT::unpoison(accum); 1736| | 1737| | // Map back from the isomorphic curve 1738| 210| return ProjectivePoint(accum.x(), accum.y(), accum.z() * table.z()); 1739| 210|} pcurves_secp384r1.cpp:_ZN5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EEELm1EEC2ERNS_21RandomNumberGeneratorE: 1455| 210| explicit BlindingRandomness(RandomNumberGenerator& rng) : m_seeded(rng.is_seeded()) { 1456| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1457| 210| if(m_seeded) { ------------------ | Branch (1457:13): [True: 210, False: 0] ------------------ 1458| 210| std::array buf{}; 1459| 210| rng.randomize(buf); 1460| | 1461| 210| const std::span bytes(buf); 1462| | 1463| 210| copy_mem(m_masks, bytes.first()); 1464| | 1465| 1.05k| for(size_t i = 0; i != Rerandomizations; ++i) { ------------------ | Branch (1465:31): [True: 840, False: 210] ------------------ 1466| 840| const auto wide = bytes.subspan(Scalars * MaskBytes + i * WideBytes).first(); 1467| 840| m_rerandomizers[i] = FieldElement::from_wide_bytes(wide); 1468| 840| } 1469| | 1470| 210| const auto iso = bytes.subspan(Scalars * MaskBytes + Rerandomizations * WideBytes).first(); 1471| 210| m_isomorphism = FieldElement::from_wide_bytes(iso); 1472| 210| m_isomorphism.conditional_assign(m_isomorphism.is_zero(), FieldElement::one()); 1473| 210| } 1474| 210| } pcurves_secp384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EEELm1EE11isomorphismEv: 1497| 210| const FieldElement& isomorphism() const { return m_isomorphism; } pcurves_secp384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E11add_mixed_hERKSC_RKNS_16AffineCurvePointISB_EE: 1116| 2.94k| constexpr static std::pair add_mixed_h(const Self& a, const AffinePoint& b) { 1117| 2.94k| return point_add_mixed_h(a, b, FieldElement::one(), A); 1118| 2.94k| } pcurves_secp384r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EEC2INS_18BlindingRandomnessIS5_Lm1EEEEERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_12Secp384r1RepEE12ScalarParamsEEEEERKT_m: 1368| 210| BlindedScalarBits(const typename C::Scalar& scalar, const Randomness& randomness, size_t idx = 0) { 1369| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1370| 210| if(BlindingBits > 0 && randomness.seeded()) { ------------------ | Branch (1370:13): [True: 210, Folded] | Branch (1370:33): [True: 210, False: 0] ------------------ 1371| 210| constexpr size_t n_words = C::Words; 1372| | 1373| 210| W mask[n_words] = {0}; 1374| 210| load_le(mask, randomness.mask(idx).data(), MaskWords); 1375| | 1376| | // Mask to exactly BlindingBits 1377| 210| constexpr size_t ExcessBits = MaskWords * WordInfo::bits - BlindingBits; 1378| 210| if constexpr(ExcessBits > 0) { 1379| 210| constexpr W ExcessMask = (static_cast(1) << (WordInfo::bits - ExcessBits)) - 1; 1380| 210| mask[MaskWords - 1] &= ExcessMask; 1381| 210| } 1382| | 1383| | // Set top and bottom bits of mask 1384| 210| constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo::bits; 1385| 210| mask[(BlindingBits - 1) / WordInfo::bits] |= static_cast(1) << TopMaskBit; 1386| 210| mask[0] |= 1; 1387| | 1388| 210| W mask_n[2 * n_words] = {0}; 1389| | 1390| 210| const auto sw = scalar.to_words(); 1391| | 1392| | // Compute masked scalar s + k*n 1393| 210| comba_mul(mask_n, mask, C::NW.data()); 1394| 210| bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size()); 1395| | 1396| 210| std::reverse(mask_n, mask_n + 2 * n_words); 1397| 210| m_bytes = store_be>(mask_n); 1398| 210| m_bits = C::Scalar::BITS + BlindingBits; 1399| 210| } else { 1400| | // No RNG available, skip blinding 1401| 0| m_bytes.resize(C::Scalar::BYTES); 1402| 0| scalar.serialize_to(std::span{m_bytes}.template first()); 1403| 0| m_bits = C::Scalar::BITS; 1404| 0| } 1405| | 1406| 210| CT::poison(m_bytes.data(), m_bytes.size()); 1407| 210| } pcurves_secp384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EEELm1EE6seededEv: 1476| 210| bool seeded() const { return m_seeded; } pcurves_secp384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EEELm1EE4maskEm: 1478| 210| std::span mask(size_t idx) const { 1479| 210| BOTAN_ASSERT_NOMSG(idx < Scalars); ------------------ | | 84| 210| do { \ | | 85| 210| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 210| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 210] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 210| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 210] | | ------------------ ------------------ 1480| 210| return std::span{m_masks}.subspan(idx * MaskBytes).template first(); 1481| 210| } pcurves_secp384r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EE4bitsEv: 1362| 210| size_t bits() const { return m_bits; } pcurves_secp384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E8identityEv: 1049| 210| static constexpr Self identity() { return Self(FieldElement::zero(), FieldElement::one(), FieldElement::zero()); } pcurves_secp384r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EE10get_windowEm: 1409| 18.2k| size_t get_window(size_t offset) const { 1410| | // Extract a WindowBits sized window out of s, depending on offset. 1411| 18.2k| return read_window_bits(std::span{m_bytes}, offset); 1412| 18.2k| } pcurves_secp384r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E14add_or_sub_isoERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceERKSB_: 1131| 18.0k| const FieldElement& curve_a) { 1132| 18.0k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), curve_a); 1133| 18.0k| } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E9dbl_n_isoERKSB_m: 1159| 18.0k| constexpr Self dbl_n_iso(const FieldElement& a, size_t n) const { 1160| | if constexpr(Self::A_is_zero) { 1161| | return dbl_n_a_zero(*this, n); 1162| 18.0k| } else { 1163| 18.0k| return dbl_n_generic(*this, a, n); 1164| 18.0k| } 1165| 18.0k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4div2Ev: 304| 18.0k| 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| 18.0k| 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| 18.0k| std::array t = value(); 312| 18.0k| const W borrow = shift_right<1>(t); 313| | 314| | // If value was odd, add (P/2)+1 315| 18.0k| const auto mask = CT::Mask::expand(borrow).value(); 316| | 317| 18.0k| W carry = 0; 318| | 319| 126k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (319:28): [True: 108k, False: 18.0k] ------------------ 320| 108k| t[i] = word_add(t[i], INV_2[i] & mask, &carry); 321| 108k| } 322| | 323| 18.0k| return Self(t); 324| 18.0k| } pcurves_secp384r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EEELm1EE13randomize_repERNS_20ProjectiveCurvePointINS_6IntModINS3_12Secp384r1RepINS_13EllipticCurveINS4_6ParamsESA_E11FieldParamsEEEEESC_EEm: 1486| 840| void randomize_rep(typename C::ProjectivePoint& pt, size_t idx) const { 1487| 840| BOTAN_ASSERT_NOMSG(idx < Rerandomizations); ------------------ | | 84| 840| do { \ | | 85| 840| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 840| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 840] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 840| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 840] | | ------------------ ------------------ 1488| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1489| 840| if(m_seeded) { ------------------ | Branch (1489:13): [True: 840, False: 0] ------------------ 1490| 840| pt.randomize_rep(m_rerandomizers[idx]); 1491| 840| } 1492| 840| } pcurves_secp384r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EED2Ev: 1414| 210| ~BlindedScalarBits() { 1415| 210| secure_zeroize_buffer(m_bytes.data(), m_bytes.size()); 1416| 210| CT::unpoison(m_bytes.data(), m_bytes.size()); 1417| 210| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE: 776| 6.39k| static Self from_stash(const std::array& stash) { 777| 6.39k| static_assert(L >= N); 778| 6.39k| std::array val = {}; 779| 44.7k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 38.3k, False: 6.39k] ------------------ 780| 38.3k| val[i] = stash[i]; 781| 38.3k| } 782| 6.39k| return Self(val); 783| 6.39k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE7is_zeroEv: 227| 748| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 756| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 756| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 756] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 756| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 756| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 4, False: 752] ------------------ 804| 4| return {}; 805| 4| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 752| return Self::from_words(words); 809| 756| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEeqERKSA_: 724| 856| constexpr CT::Choice operator==(const Self& other) const { 725| 856| return CT::is_equal(this->data(), other.data(), N).as_choice(); 726| 856| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE10from_wordsILm6EEESA_NSt3__15arrayImXT_EEE: 213| 752| static constexpr Self from_words(std::array w) { 214| 752| if constexpr(L == N) { 215| 752| 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| 752| } pcurves_secp384r1.cpp:_ZN5Botan13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS2_12Secp384r1RepEE7x3_ax_bERKNS_6IntModINS5_INS6_11FieldParamsEEEEE: 1327| 856| static constexpr FieldElement x3_ax_b(const FieldElement& x) { return (x.square() + A) * x + B; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE12correct_signENS_2CT6ChoiceE: 250| 210| constexpr Self correct_sign(CT::Choice even) const { 251| 210| const auto flip = (even != this->is_even()); 252| 210| return Self::choose(flip, this->negate(), *this); 253| 210| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE7is_evenEv: 242| 210| constexpr CT::Choice is_even() const { 243| 210| auto v = Rep::from_rep(m_val); 244| 210| return !CT::Choice::from_int(v[0] & 0x01); 245| 210| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE6chooseENS_2CT6ChoiceERKSA_SE_: 258| 210| static constexpr Self choose(CT::Choice choice, const Self& x, const Self& y) { 259| 210| auto r = y; 260| 210| r.conditional_assign(choice, x); 261| 210| return r; 262| 210| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 374| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 374| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 374] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 374| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 374| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 0, False: 374] ------------------ 804| 0| return {}; 805| 0| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 374| return Self::from_words(words); 809| 374| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE10from_wordsILm6EEESB_NSt3__15arrayImXT_EEE: 213| 374| static constexpr Self from_words(std::array w) { 214| 374| if constexpr(L == N) { 215| 374| 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| 374| } pcurves_secp384r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS3_12Secp384r1RepEE12ScalarParamsEE6to_repERKNSt3__15arrayImLm6EEE: 117| 374| constexpr static std::array to_rep(const std::array& x) { 118| 374| std::array z; // NOLINT(*-member-init) 119| 374| comba_mul(z.data(), x.data(), R2.data()); 120| 374| return Self::redc(z); 121| 374| } pcurves_secp384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE12serialize_toENSt3__14spanIhLm97EEE: 952| 1.21k| constexpr void serialize_to(std::span bytes) const { 953| 1.21k| BOTAN_STATE_CHECK(this->is_identity().as_bool() == false); ------------------ | | 51| 1.21k| do { \ | | 52| 1.21k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 1.21k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 1.21k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 1.21k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 1.21k] | | ------------------ ------------------ 954| 1.21k| BufferStuffer pack(bytes); 955| 1.21k| pack.append(0x04); 956| 1.21k| x().serialize_to(pack.next()); 957| 1.21k| y().serialize_to(pack.next()); 958| 1.21k| BOTAN_DEBUG_ASSERT(pack.full()); ------------------ | | 137| 1.21k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.21k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.21k] | | ------------------ ------------------ 959| 1.21k| } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE6randomERNS_21RandomNumberGeneratorE: 853| 374| static Self random(RandomNumberGenerator& rng) { 854| 374| constexpr size_t MAX_ATTEMPTS = 1000; 855| | 856| 374| std::array buf{}; 857| | 858| 374| for(size_t i = 0; i != MAX_ATTEMPTS; ++i) { ------------------ | Branch (858:28): [True: 374, False: 0] ------------------ 859| 374| rng.randomize(buf); 860| | 861| | // Zero off high bits that if set would certainly cause us 862| | // to be out of range 863| | if constexpr(Self::BITS % 8 != 0) { 864| | constexpr uint8_t mask = 0xFF >> (8 - (Self::BITS % 8)); 865| | buf[0] &= mask; 866| | } 867| | 868| | // Conditionals ok: rejection sampling reveals only values we didn't use 869| 374| if(auto s = Self::deserialize(buf)) { ------------------ | Branch (869:21): [True: 374, False: 0] ------------------ 870| 374| if(s.value().is_nonzero().as_bool()) { ------------------ | Branch (870:19): [True: 374, False: 0] ------------------ 871| 374| return s.value(); 872| 374| } 873| 374| } 874| 374| } 875| | 876| 0| throw Internal_Error("Failed to generate random Scalar within bounded number of attempts"); 877| 374| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp384r16ParamsENS4_12Secp384r1RepEE12ScalarParamsEEEE10is_nonzeroEv: 232| 374| constexpr CT::Choice is_nonzero() const { return !is_zero(); } 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| 718| 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| 718| const auto x = pt.x(); 1038| 718| auto y = pt.y(); 1039| 718| auto z = FieldElement::one(); 1040| | 1041| 718| FieldElement::conditional_swap(pt.is_identity(), y, z); 1042| | 1043| 718| return ProjectiveCurvePoint(x, y, z); 1044| 718| } pcurves_secp521r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1xEv: 982| 1.54M| constexpr const FieldElement& x() const { return m_x; } pcurves_secp521r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1yEv: 987| 1.48M| constexpr const FieldElement& y() const { return m_y; } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE3oneEv: 202| 58.3k| static constexpr Self one() { return Self(Rep::one()); } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEC2ENSt3__15arrayImLm9EEE: 908| 3.06M| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 412| 718| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 413| 718| const W mask = cond.into_bitmask(); 414| | 415| 7.18k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (415:28): [True: 6.46k, False: 718] ------------------ 416| 6.46k| const auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 417| 6.46k| const auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 418| 6.46k| x.m_val[i] = nx; 419| 6.46k| y.m_val[i] = ny; 420| 6.46k| } 421| 718| } pcurves_secp521r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE11is_identityEv: 939| 59.6k| 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| 298k| 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| 84.3k| m_x(x), m_y(y), m_z(z) {} pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3dblEv: 1181| 1.84k| constexpr Self dbl() const { 1182| 1.84k| if constexpr(Self::A_is_minus_3) { 1183| 1.84k| 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.84k| } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1zEv: 1224| 335k| constexpr const FieldElement& z() const { return m_z; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6squareEv: 428| 692k| constexpr BOTAN_FORCE_INLINE Self square() const { 429| 692k| std::array z; // NOLINT(*-member-init) 430| 692k| comba_sqr(z.data(), this->data()); 431| 692k| return Self(Rep::redc(z)); 432| 692k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4dataEv: 898| 3.07M| constexpr const W* data() const { return m_val.data(); } pcurves_secp521r1.cpp:_ZN5BotanmlERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 348| 758k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 349| 758k| std::array z; // NOLINT(*-member-init) 350| 758k| comba_mul(z.data(), a.data(), b.data()); 351| 758k| return Self(Rep::redc(z)); 352| 758k| } pcurves_secp521r1.cpp:_ZN5BotanmiERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 283| 694k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 284| 694k| std::array r; // NOLINT(*-member-init) 285| 694k| W carry = 0; 286| 6.94M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (286:28): [True: 6.25M, False: 694k] ------------------ 287| 6.25M| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 288| 6.25M| } 289| | 290| 694k| const auto mask = CT::Mask::expand(carry).value(); 291| | 292| 694k| carry = 0; 293| | 294| 6.94M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (294:28): [True: 6.25M, False: 694k] ------------------ 295| 6.25M| r[i] = word_add(r[i], P[i] & mask, &carry); 296| 6.25M| } 297| | 298| 694k| return Self(r); 299| 694k| } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1xEv: 1214| 211k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul3Ev: 337| 115k| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_secp521r1.cpp:_ZN5BotanplERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 267| 290k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 268| 290k| std::array t; // NOLINT(*-member-init) 269| | 270| 290k| W carry = 0; 271| 2.90M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (271:28): [True: 2.61M, False: 290k] ------------------ 272| 2.61M| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 273| 2.61M| } 274| | 275| 290k| std::array r; // NOLINT(*-member-init) 276| 290k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 277| 290k| return Self(r); 278| 290k| } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1yEv: 1219| 209k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul4Ev: 340| 1.84k| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul2Ev: 327| 377k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 328| 377k| std::array t = value(); 329| 377k| const W carry = shift_left<1>(t); 330| | 331| 377k| std::array r; // NOLINT(*-member-init) 332| 377k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 333| 377k| return Self(r); 334| 377k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE5valueEv: 896| 399k| constexpr const std::array& value() const { return m_val; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul8Ev: 343| 1.84k| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_secp521r1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EESE_: 1075| 1.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| 1.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| 62.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| 116k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 398| 116k| const W mask = cond.into_bitmask(); 399| | 400| 1.16M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (400:28): [True: 1.04M, False: 116k] ------------------ 401| 1.04M| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 402| 1.04M| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 403| 1.04M| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 404| 1.04M| } 405| 116k| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEmLERKSA_: 357| 218k| constexpr BOTAN_FORCE_INLINE Self& operator*=(const Self& other) { 358| 218k| std::array z; // NOLINT(*-member-init) 359| 218k| comba_mul(z.data(), data(), other.data()); 360| 218k| m_val = Rep::redc(z); 361| 218k| return (*this); 362| 218k| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE8square_nEm: 441| 5.92k| constexpr void square_n(size_t n) { 442| 5.92k| std::array z; // NOLINT(*-member-init) 443| 380k| for(size_t i = 0; i != n; ++i) { ------------------ | Branch (443:28): [True: 374k, False: 5.92k] ------------------ 444| 374k| comba_sqr(z.data(), this->data()); 445| 374k| m_val = Rep::redc(z); 446| 374k| } 447| 5.92k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_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| 350| for(;;) { 620| | // Conditional ok: this function is variable time 621| 350| if(a.m_val == b.m_val) { ------------------ | Branch (621:16): [True: 1, False: 349] ------------------ 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| 349| 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| 349| std::array r; // NOLINT(*-member-init) 642| 349| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 643| | 644| | // Conditional ok: this function is variable time 645| 349| if(carry == 0) { ------------------ | Branch (645:16): [True: 170, False: 179] ------------------ 646| | // b > a 647| 170| b.m_val = r; 648| 170| x = nx; 649| 170| Self::_invert_vartime_div2_helper(b, x); 650| 179| } else { 651| | // We know this can't underflow because a > b 652| 179| bigint_sub3(r.data(), a.data(), N, b.data(), N); 653| 179| a.m_val = r; 654| 179| y = nx; 655| 179| Self::_invert_vartime_div2_helper(a, y); 656| 179| } 657| 349| } 658| 1| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4zeroEv: 197| 108k| static constexpr Self zero() { return Self(std::array{0}); } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE8to_wordsEv: 736| 1| 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| 351| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 550| 351| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 551| | 552| | // Conditional ok: this function is variable time 553| 1.09k| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (553:16): [True: 742, False: 351] ------------------ 554| 742| shift_right<1>(a.m_val); 555| | 556| 742| const W borrow = shift_right<1>(x.m_val); 557| | 558| | // Conditional ok: this function is variable time 559| 742| if(borrow) { ------------------ | Branch (559:16): [True: 109, False: 633] ------------------ 560| 109| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 561| 109| } 562| 742| } 563| 351| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6negateEv: 454| 54.3k| constexpr Self negate() const { 455| 54.3k| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 456| | 457| 54.3k| std::array r; // NOLINT(*-member-init) 458| 54.3k| W carry = 0; 459| 543k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (459:28): [True: 489k, False: 54.3k] ------------------ 460| 489k| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 461| 489k| } 462| | 463| 54.3k| return Self(r); 464| 54.3k| } pcurves_secp521r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEEC2ERKSB_SE_: 928| 63.5k| 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| 2.40k| std::array stash_value() const { 762| 2.40k| static_assert(L >= N); 763| 2.40k| std::array stash = {}; 764| 24.0k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 21.6k, False: 2.40k] ------------------ 765| 21.6k| stash[i] = m_val[i]; 766| 21.6k| } 767| 2.40k| return stash; 768| 2.40k| } pcurves_secp521r1.cpp:_ZNK5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EE3mulERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_7P521RepEE12ScalarParamsEEEEERNS_21RandomNumberGeneratorE: 1632| 323| ProjectivePoint mul(const Scalar& s, RandomNumberGenerator& rng) const { 1633| 323| const BlindingRandomness blinding(rng); 1634| 323| const BlindedScalar scalar(s, blinding); 1635| 323| return basemul_booth_exec(m_table, scalar, blinding); 1636| 323| } pcurves_secp521r1.cpp:_ZN5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm7EEELm1EEC2ERNS_21RandomNumberGeneratorE: 1455| 323| explicit BlindingRandomness(RandomNumberGenerator& rng) : m_seeded(rng.is_seeded()) { 1456| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1457| 323| if(m_seeded) { ------------------ | Branch (1457:13): [True: 323, False: 0] ------------------ 1458| 323| std::array buf{}; 1459| 323| rng.randomize(buf); 1460| | 1461| 323| const std::span bytes(buf); 1462| | 1463| 323| copy_mem(m_masks, bytes.first()); 1464| | 1465| 1.61k| for(size_t i = 0; i != Rerandomizations; ++i) { ------------------ | Branch (1465:31): [True: 1.29k, False: 323] ------------------ 1466| 1.29k| const auto wide = bytes.subspan(Scalars * MaskBytes + i * WideBytes).first(); 1467| 1.29k| m_rerandomizers[i] = FieldElement::from_wide_bytes(wide); 1468| 1.29k| } 1469| | 1470| 323| const auto iso = bytes.subspan(Scalars * MaskBytes + Rerandomizations * WideBytes).first(); 1471| 323| m_isomorphism = FieldElement::from_wide_bytes(iso); 1472| 323| m_isomorphism.conditional_assign(m_isomorphism.is_zero(), FieldElement::one()); 1473| 323| } 1474| 323| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEC2Ev: 182| 2.08k| constexpr IntMod() : m_val({}) {} pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE15from_wide_bytesILm74EEESA_NSt3__14spanIKhXT_EEE: 818| 2.60k| static constexpr Self from_wide_bytes(std::span bytes) { 819| 2.60k| static_assert(8 * L <= 2 * Self::BITS); 820| 2.60k| std::array padded_bytes = {}; 821| 2.60k| copy_mem(std::span{padded_bytes}.template last(), bytes); 822| 2.60k| return Self(Rep::wide_to_rep(bytes_to_words(std::span{padded_bytes}))); 823| 2.60k| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18conditional_assignENS_2CT6ChoiceERKSA_: 369| 54.5k| constexpr void conditional_assign(CT::Choice cond, const Self& nx) { 370| 54.5k| const W mask = cond.into_bitmask(); 371| | 372| 545k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (372:28): [True: 491k, False: 54.5k] ------------------ 373| 491k| m_val[i] = Botan::choose(mask, nx.m_val[i], m_val[i]); 374| 491k| } 375| 54.5k| } pcurves_secp521r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm7EEC2INS_18BlindingRandomnessIS5_Lm1EEEEERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_7P521RepEE12ScalarParamsEEEEERKT_m: 1368| 323| BlindedScalarBits(const typename C::Scalar& scalar, const Randomness& randomness, size_t idx = 0) { 1369| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1370| 323| if(BlindingBits > 0 && randomness.seeded()) { ------------------ | Branch (1370:13): [True: 323, Folded] | Branch (1370:33): [True: 323, False: 0] ------------------ 1371| 323| constexpr size_t n_words = C::Words; 1372| | 1373| 323| W mask[n_words] = {0}; 1374| 323| load_le(mask, randomness.mask(idx).data(), MaskWords); 1375| | 1376| | // Mask to exactly BlindingBits 1377| 323| constexpr size_t ExcessBits = MaskWords * WordInfo::bits - BlindingBits; 1378| 323| if constexpr(ExcessBits > 0) { 1379| 323| constexpr W ExcessMask = (static_cast(1) << (WordInfo::bits - ExcessBits)) - 1; 1380| 323| mask[MaskWords - 1] &= ExcessMask; 1381| 323| } 1382| | 1383| | // Set top and bottom bits of mask 1384| 323| constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo::bits; 1385| 323| mask[(BlindingBits - 1) / WordInfo::bits] |= static_cast(1) << TopMaskBit; 1386| 323| mask[0] |= 1; 1387| | 1388| 323| W mask_n[2 * n_words] = {0}; 1389| | 1390| 323| const auto sw = scalar.to_words(); 1391| | 1392| | // Compute masked scalar s + k*n 1393| 323| comba_mul(mask_n, mask, C::NW.data()); 1394| 323| bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size()); 1395| | 1396| 323| std::reverse(mask_n, mask_n + 2 * n_words); 1397| 323| m_bytes = store_be>(mask_n); 1398| 323| m_bits = C::Scalar::BITS + BlindingBits; 1399| 323| } else { 1400| | // No RNG available, skip blinding 1401| 0| m_bytes.resize(C::Scalar::BYTES); 1402| 0| scalar.serialize_to(std::span{m_bytes}.template first()); 1403| 0| m_bits = C::Scalar::BITS; 1404| 0| } 1405| | 1406| 323| CT::poison(m_bytes.data(), m_bytes.size()); 1407| 323| } pcurves_secp521r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm7EEELm1EE6seededEv: 1476| 323| bool seeded() const { return m_seeded; } pcurves_secp521r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm7EEELm1EE4maskEm: 1478| 323| std::span mask(size_t idx) const { 1479| 323| BOTAN_ASSERT_NOMSG(idx < Scalars); ------------------ | | 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] | | ------------------ ------------------ 1480| 323| return std::span{m_masks}.subspan(idx * MaskBytes).template first(); 1481| 323| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE8to_wordsEv: 736| 520| 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| 843| constexpr static std::array from_rep(const std::array& z) { 140| 843| std::array ze = {}; 141| 843| copy_mem(std::span{ze}.template first(), z); 142| 843| return Self::redc(ze); 143| 843| } pcurves_secp521r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS4_7P521RepEE12ScalarParamsEE4redcERKNSt3__15arrayImLm18EEE: 106| 1.16k| constexpr static std::array redc(const std::array& z) { 107| | if constexpr(P_dash == 1) { 108| | return monty_redc_pdash1(z, P); 109| 1.16k| } else { 110| 1.16k| return monty_redc(z, P, P_dash); 111| 1.16k| } 112| 1.16k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE12serialize_toENSt3__14spanIhLm66EEE: 741| 323| constexpr void serialize_to(std::span bytes) const { 742| 323| auto v = Rep::from_rep(m_val); 743| 323| std::reverse(v.begin(), v.end()); 744| | 745| | if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| | store_be(bytes, v); 747| 323| } else { 748| | // Remove leading zero bytes 749| 323| const auto padded_bytes = store_be(v); 750| 323| constexpr size_t extra = N * WordInfo::bytes - Self::BYTES; 751| 323| copy_mem(bytes, std::span{padded_bytes}.template subspan()); 752| 323| } 753| 323| } pcurves_secp521r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm7EE4bitsEv: 1362| 323| size_t bits() const { return m_bits; } pcurves_secp521r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E18conditional_assignENS_2CT6ChoiceERKSC_: 1095| 520| constexpr void conditional_assign(CT::Choice cond, const Self& pt) { 1096| 520| FieldElement::conditional_assign(m_x, m_y, m_z, cond, pt.x(), pt.y(), pt.z()); 1097| 520| } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E6negateEv: 1194| 520| constexpr Self negate() const { return Self(x(), y().negate(), z()); } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E18_const_time_poisonEv: 1226| 520| constexpr void _const_time_poison() const { CT::poison_all(m_x, m_y, m_z); } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18_const_time_poisonEv: 891| 1.56k| constexpr void _const_time_poison() const { CT::poison(m_val); } pcurves_secp521r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm7EE10get_windowEm: 1409| 31.3k| size_t get_window(size_t offset) const { 1410| | // Extract a WindowBits sized window out of s, depending on offset. 1411| 31.3k| return read_window_bits(std::span{m_bytes}, offset); 1412| 31.3k| } pcurves_secp521r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E10add_or_subERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceE: 1121| 31.0k| constexpr static Self add_or_sub(const Self& a, const AffinePoint& b, CT::Choice sub) { 1122| 31.0k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), A); 1123| 31.0k| } pcurves_secp521r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE9ct_selectENSt3__14spanIKSC_Lm18446744073709551615EEEm: 966| 54.1k| static constexpr auto ct_select(std::span pts, size_t idx) { 967| 54.1k| auto result = Self::identity(pts[0]); 968| | 969| | // Intentionally wrapping; set to maximum size_t if idx == 0 970| 54.1k| const size_t idx1 = idx - 1; 971| 1.42M| for(size_t i = 0; i != pts.size(); ++i) { ------------------ | Branch (971:28): [True: 1.36M, False: 54.1k] ------------------ 972| 1.36M| const auto found = CT::Mask::is_equal(idx1, i).as_choice(); 973| 1.36M| result.conditional_assign(found, pts[i]); 974| 1.36M| } 975| | 976| 54.1k| return result; 977| 54.1k| } pcurves_secp521r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE8identityERKSC_: 935| 54.1k| static constexpr Self identity(const Self& /*unused*/) { 936| 54.1k| return Self(FieldElement::zero(), FieldElement::zero()); 937| 54.1k| } pcurves_secp521r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE18conditional_assignENS_2CT6ChoiceERKSC_: 992| 1.36M| constexpr void conditional_assign(CT::Choice cond, const Self& pt) { 993| 1.36M| FieldElement::conditional_assign(m_x, m_y, cond, pt.x(), pt.y()); 994| 1.36M| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18conditional_assignERSA_SB_NS_2CT6ChoiceERKSA_SF_: 382| 1.36M| static constexpr void conditional_assign(Self& x, Self& y, CT::Choice cond, const Self& nx, const Self& ny) { 383| 1.36M| const W mask = cond.into_bitmask(); 384| | 385| 13.6M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (385:28): [True: 12.3M, False: 1.36M] ------------------ 386| 12.3M| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 387| 12.3M| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 388| 12.3M| } 389| 1.36M| } pcurves_secp521r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm7EEELm1EE13randomize_repERNS_20ProjectiveCurvePointINS_6IntModINS4_7P521RepINS_13EllipticCurveINS4_6ParamsESA_E11FieldParamsEEEEESC_EEm: 1486| 1.29k| void randomize_rep(typename C::ProjectivePoint& pt, size_t idx) const { 1487| 1.29k| BOTAN_ASSERT_NOMSG(idx < Rerandomizations); ------------------ | | 84| 1.29k| do { \ | | 85| 1.29k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 1.29k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 1.29k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 1.29k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 1.29k] | | ------------------ ------------------ 1488| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1489| 1.29k| if(m_seeded) { ------------------ | Branch (1489:13): [True: 1.29k, False: 0] ------------------ 1490| 1.29k| pt.randomize_rep(m_rerandomizers[idx]); 1491| 1.29k| } 1492| 1.29k| } pcurves_secp521r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E13randomize_repERKSB_: 1202| 2.08k| void randomize_rep(const FieldElement& r) { 1203| 2.08k| const auto r2 = r.square(); 1204| 2.08k| const auto r3 = r2 * r; 1205| | 1206| 2.08k| m_x *= r2; 1207| 2.08k| m_y *= r3; 1208| 2.08k| m_z *= r; 1209| 2.08k| } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E20_const_time_unpoisonEv: 1228| 520| constexpr void _const_time_unpoison() const { CT::unpoison_all(m_x, m_y, m_z); } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE20_const_time_unpoisonEv: 893| 1.56k| constexpr void _const_time_unpoison() const { CT::unpoison(m_val); } pcurves_secp521r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm7EED2Ev: 1414| 323| ~BlindedScalarBits() { 1415| 323| secure_zeroize_buffer(m_bytes.data(), m_bytes.size()); 1416| 323| CT::unpoison(m_bytes.data(), m_bytes.size()); 1417| 323| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE10from_stashILm9EEESB_RKNSt3__15arrayImXT_EEE: 776| 1.16k| static Self from_stash(const std::array& stash) { 777| 1.16k| static_assert(L >= N); 778| 1.16k| std::array val = {}; 779| 11.6k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 10.4k, False: 1.16k] ------------------ 780| 10.4k| val[i] = stash[i]; 781| 10.4k| } 782| 1.16k| return Self(val); 783| 1.16k| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEEC2ENSt3__15arrayImLm9EEE: 908| 1.48k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE12serialize_toENSt3__14spanIhLm66EEE: 741| 2.41k| constexpr void serialize_to(std::span bytes) const { 742| 2.41k| auto v = Rep::from_rep(m_val); 743| 2.41k| std::reverse(v.begin(), v.end()); 744| | 745| | if constexpr(Self::BYTES == N * WordInfo::bytes) { 746| | store_be(bytes, v); 747| 2.41k| } else { 748| | // Remove leading zero bytes 749| 2.41k| const auto padded_bytes = store_be(v); 750| 2.41k| constexpr size_t extra = N * WordInfo::bytes - Self::BYTES; 751| 2.41k| copy_mem(bytes, std::span{padded_bytes}.template subspan()); 752| 2.41k| } 753| 2.41k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE11stash_valueILm9EEENSt3__15arrayImXT_EEEv: 761| 323| std::array stash_value() const { 762| 323| static_assert(L >= N); 763| 323| std::array stash = {}; 764| 3.23k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (764:28): [True: 2.90k, False: 323] ------------------ 765| 2.90k| stash[i] = m_val[i]; 766| 2.90k| } 767| 323| return stash; 768| 323| } pcurves_secp521r1.cpp:_ZN5Botan12varpoint_mulINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm4EEENT_15ProjectivePointERKNS5_11AffinePointERKNS5_6ScalarERNS_21RandomNumberGeneratorE: 1680| 197| RandomNumberGenerator& rng) { 1681| 197| using ProjectivePoint = typename C::ProjectivePoint; 1682| | 1683| 197| constexpr size_t TableBits = W; 1684| 197| static_assert(TableBits >= 1 && TableBits <= 7); 1685| | 1686| 197| constexpr size_t WindowBits = TableBits + 1; 1687| | 1688| 197| using BlindedScalar = BlindedScalarBits; 1689| 197| using Blinding = BlindingRandomness; 1690| | 1691| | // 2^W elements [1*P, 2*P, ..., 2^W*P] 1692| 197| constexpr size_t TableSize = 1 << TableBits; 1693| | 1694| 197| const Blinding blinding(rng); 1695| 197| const SharedZPointTable table(p, TableSize, C::A, blinding.isomorphism()); 1696| 197| const BlindedScalar bits(s, blinding); 1697| | 1698| 197| const size_t scalar_bits = bits.bits(); 1699| 197| const size_t full_windows = booth_full_windows(scalar_bits + 1, WindowBits); 1700| 197| const size_t initial_shift = booth_initial_shift(scalar_bits + 1, WindowBits); 1701| | 1702| 197| BOTAN_DEBUG_ASSERT(full_windows * WindowBits + initial_shift == scalar_bits + 1); ------------------ | | 137| 197| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 197| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 197] | | ------------------ ------------------ 1703| 197| BOTAN_DEBUG_ASSERT(initial_shift > 0); ------------------ | | 137| 197| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 197| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 197] | | ------------------ ------------------ 1704| | 1705| 197| auto accum = ProjectivePoint::identity(); 1706| 197| CT::poison(accum); 1707| | 1708| 22.8k| for(size_t i = 0; i != full_windows; ++i) { ------------------ | Branch (1708:22): [True: 22.6k, False: 197] ------------------ 1709| 22.6k| const size_t idx = scalar_bits - initial_shift - WindowBits * i; 1710| | 1711| 22.6k| const size_t w_i = bits.get_window(idx); 1712| 22.6k| const auto [tidx, tneg] = booth_recode(w_i); 1713| | 1714| | // Conditional ok: loop iteration count is public 1715| 22.6k| if(i == 0) { ------------------ | Branch (1715:10): [True: 197, False: 22.4k] ------------------ 1716| 197| accum = ProjectivePoint::from_affine(table.ct_select(tidx)); 1717| 197| accum.conditional_assign(tneg, accum.negate()); 1718| 22.4k| } else { 1719| 22.4k| accum = ProjectivePoint::add_or_sub_iso(accum, table.ct_select(tidx), tneg, table.a()); 1720| 22.4k| } 1721| | 1722| 22.6k| accum = accum.dbl_n_iso(table.a(), WindowBits); 1723| | 1724| | // Conditional ok: loop iteration count is public 1725| 22.6k| if(i < Blinding::Rerandomizations) { ------------------ | Branch (1725:10): [True: 788, False: 21.8k] ------------------ 1726| 788| blinding.randomize_rep(accum, i); 1727| 788| } 1728| 22.6k| } 1729| | 1730| | // final window (note one bit shorter than previous reads) 1731| 197| const size_t w_l = bits.get_window(0) & ((1 << WindowBits) - 1); 1732| 197| const auto [tidx, tneg] = booth_recode(w_l << 1); 1733| 197| accum = ProjectivePoint::add_or_sub_iso(accum, table.ct_select(tidx), tneg, table.a()); 1734| | 1735| 197| CT::unpoison(accum); 1736| | 1737| | // Map back from the isomorphic curve 1738| 197| return ProjectivePoint(accum.x(), accum.y(), accum.z() * table.z()); 1739| 197|} pcurves_secp521r1.cpp:_ZN5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EEELm1EEC2ERNS_21RandomNumberGeneratorE: 1455| 197| explicit BlindingRandomness(RandomNumberGenerator& rng) : m_seeded(rng.is_seeded()) { 1456| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1457| 197| if(m_seeded) { ------------------ | Branch (1457:13): [True: 197, False: 0] ------------------ 1458| 197| std::array buf{}; 1459| 197| rng.randomize(buf); 1460| | 1461| 197| const std::span bytes(buf); 1462| | 1463| 197| copy_mem(m_masks, bytes.first()); 1464| | 1465| 985| for(size_t i = 0; i != Rerandomizations; ++i) { ------------------ | Branch (1465:31): [True: 788, False: 197] ------------------ 1466| 788| const auto wide = bytes.subspan(Scalars * MaskBytes + i * WideBytes).first(); 1467| 788| m_rerandomizers[i] = FieldElement::from_wide_bytes(wide); 1468| 788| } 1469| | 1470| 197| const auto iso = bytes.subspan(Scalars * MaskBytes + Rerandomizations * WideBytes).first(); 1471| 197| m_isomorphism = FieldElement::from_wide_bytes(iso); 1472| 197| m_isomorphism.conditional_assign(m_isomorphism.is_zero(), FieldElement::one()); 1473| 197| } 1474| 197| } pcurves_secp521r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EEELm1EE11isomorphismEv: 1497| 197| const FieldElement& isomorphism() const { return m_isomorphism; } pcurves_secp521r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11add_mixed_hERKSC_RKNS_16AffineCurvePointISB_EE: 1116| 2.75k| constexpr static std::pair add_mixed_h(const Self& a, const AffinePoint& b) { 1117| 2.75k| return point_add_mixed_h(a, b, FieldElement::one(), A); 1118| 2.75k| } pcurves_secp521r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EEC2INS_18BlindingRandomnessIS5_Lm1EEEEERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_7P521RepEE12ScalarParamsEEEEERKT_m: 1368| 197| BlindedScalarBits(const typename C::Scalar& scalar, const Randomness& randomness, size_t idx = 0) { 1369| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1370| 197| if(BlindingBits > 0 && randomness.seeded()) { ------------------ | Branch (1370:13): [True: 197, Folded] | Branch (1370:33): [True: 197, False: 0] ------------------ 1371| 197| constexpr size_t n_words = C::Words; 1372| | 1373| 197| W mask[n_words] = {0}; 1374| 197| load_le(mask, randomness.mask(idx).data(), MaskWords); 1375| | 1376| | // Mask to exactly BlindingBits 1377| 197| constexpr size_t ExcessBits = MaskWords * WordInfo::bits - BlindingBits; 1378| 197| if constexpr(ExcessBits > 0) { 1379| 197| constexpr W ExcessMask = (static_cast(1) << (WordInfo::bits - ExcessBits)) - 1; 1380| 197| mask[MaskWords - 1] &= ExcessMask; 1381| 197| } 1382| | 1383| | // Set top and bottom bits of mask 1384| 197| constexpr size_t TopMaskBit = (BlindingBits - 1) % WordInfo::bits; 1385| 197| mask[(BlindingBits - 1) / WordInfo::bits] |= static_cast(1) << TopMaskBit; 1386| 197| mask[0] |= 1; 1387| | 1388| 197| W mask_n[2 * n_words] = {0}; 1389| | 1390| 197| const auto sw = scalar.to_words(); 1391| | 1392| | // Compute masked scalar s + k*n 1393| 197| comba_mul(mask_n, mask, C::NW.data()); 1394| 197| bigint_add2(mask_n, 2 * n_words, sw.data(), sw.size()); 1395| | 1396| 197| std::reverse(mask_n, mask_n + 2 * n_words); 1397| 197| m_bytes = store_be>(mask_n); 1398| 197| m_bits = C::Scalar::BITS + BlindingBits; 1399| 197| } else { 1400| | // No RNG available, skip blinding 1401| 0| m_bytes.resize(C::Scalar::BYTES); 1402| 0| scalar.serialize_to(std::span{m_bytes}.template first()); 1403| 0| m_bits = C::Scalar::BITS; 1404| 0| } 1405| | 1406| 197| CT::poison(m_bytes.data(), m_bytes.size()); 1407| 197| } pcurves_secp521r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EEELm1EE6seededEv: 1476| 197| bool seeded() const { return m_seeded; } pcurves_secp521r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EEELm1EE4maskEm: 1478| 197| std::span mask(size_t idx) const { 1479| 197| BOTAN_ASSERT_NOMSG(idx < Scalars); ------------------ | | 84| 197| do { \ | | 85| 197| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 197| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 197] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 197| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 197] | | ------------------ ------------------ 1480| 197| return std::span{m_masks}.subspan(idx * MaskBytes).template first(); 1481| 197| } pcurves_secp521r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EE4bitsEv: 1362| 197| size_t bits() const { return m_bits; } pcurves_secp521r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E8identityEv: 1049| 197| static constexpr Self identity() { return Self(FieldElement::zero(), FieldElement::one(), FieldElement::zero()); } pcurves_secp521r1.cpp:_ZNK5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EE10get_windowEm: 1409| 22.8k| size_t get_window(size_t offset) const { 1410| | // Extract a WindowBits sized window out of s, depending on offset. 1411| 22.8k| return read_window_bits(std::span{m_bytes}, offset); 1412| 22.8k| } pcurves_secp521r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E14add_or_sub_isoERKSC_RKNS_16AffineCurvePointISB_EENS_2CT6ChoiceERKSB_: 1131| 22.6k| const FieldElement& curve_a) { 1132| 22.6k| return point_add_or_sub_mixed(a, b, sub, FieldElement::one(), curve_a); 1133| 22.6k| } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E9dbl_n_isoERKSB_m: 1159| 22.6k| constexpr Self dbl_n_iso(const FieldElement& a, size_t n) const { 1160| | if constexpr(Self::A_is_zero) { 1161| | return dbl_n_a_zero(*this, n); 1162| 22.6k| } else { 1163| 22.6k| return dbl_n_generic(*this, a, n); 1164| 22.6k| } 1165| 22.6k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4div2Ev: 304| 22.6k| 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| 22.6k| 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| 22.6k| std::array t = value(); 312| 22.6k| const W borrow = shift_right<1>(t); 313| | 314| | // If value was odd, add (P/2)+1 315| 22.6k| const auto mask = CT::Mask::expand(borrow).value(); 316| | 317| 22.6k| W carry = 0; 318| | 319| 226k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (319:28): [True: 203k, False: 22.6k] ------------------ 320| 203k| t[i] = word_add(t[i], INV_2[i] & mask, &carry); 321| 203k| } 322| | 323| 22.6k| return Self(t); 324| 22.6k| } pcurves_secp521r1.cpp:_ZNK5Botan18BlindingRandomnessINS_17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EEELm1EE13randomize_repERNS_20ProjectiveCurvePointINS_6IntModINS4_7P521RepINS_13EllipticCurveINS4_6ParamsESA_E11FieldParamsEEEEESC_EEm: 1486| 788| void randomize_rep(typename C::ProjectivePoint& pt, size_t idx) const { 1487| 788| BOTAN_ASSERT_NOMSG(idx < Rerandomizations); ------------------ | | 84| 788| do { \ | | 85| 788| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 788| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 788] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 788| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 788] | | ------------------ ------------------ 1488| | // Conditional ok: caller's RNG state (seeded vs not) is presumed public 1489| 788| if(m_seeded) { ------------------ | Branch (1489:13): [True: 788, False: 0] ------------------ 1490| 788| pt.randomize_rep(m_rerandomizers[idx]); 1491| 788| } 1492| 788| } pcurves_secp521r1.cpp:_ZN5Botan17BlindedScalarBitsINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EED2Ev: 1414| 197| ~BlindedScalarBits() { 1415| 197| secure_zeroize_buffer(m_bytes.data(), m_bytes.size()); 1416| 197| CT::unpoison(m_bytes.data(), m_bytes.size()); 1417| 197| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE10from_stashILm9EEESA_RKNSt3__15arrayImXT_EEE: 776| 5.80k| static Self from_stash(const std::array& stash) { 777| 5.80k| static_assert(L >= N); 778| 5.80k| std::array val = {}; 779| 58.0k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (779:28): [True: 52.2k, False: 5.80k] ------------------ 780| 52.2k| val[i] = stash[i]; 781| 52.2k| } 782| 5.80k| return Self(val); 783| 5.80k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE7is_zeroEv: 227| 646| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 728| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 728| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 728] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 728| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 728| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 8, False: 720] ------------------ 804| 8| return {}; 805| 8| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 720| return Self::from_words(words); 809| 728| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEeqERKSA_: 724| 783| constexpr CT::Choice operator==(const Self& other) const { 725| 783| return CT::is_equal(this->data(), other.data(), N).as_choice(); 726| 783| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE10from_wordsILm9EEESA_NSt3__15arrayImXT_EEE: 213| 720| static constexpr Self from_words(std::array w) { 214| 720| if constexpr(L == N) { 215| 720| 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| 720| } pcurves_secp521r1.cpp:_ZN5Botan13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS3_7P521RepEE7x3_ax_bERKNS_6IntModINS5_INS6_11FieldParamsEEEEE: 1327| 783| static constexpr FieldElement x3_ax_b(const FieldElement& x) { return (x.square() + A) * x + B; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE12correct_signENS_2CT6ChoiceE: 250| 197| constexpr Self correct_sign(CT::Choice even) const { 251| 197| const auto flip = (even != this->is_even()); 252| 197| return Self::choose(flip, this->negate(), *this); 253| 197| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE7is_evenEv: 242| 197| constexpr CT::Choice is_even() const { 243| 197| auto v = Rep::from_rep(m_val); 244| 197| return !CT::Choice::from_int(v[0] & 0x01); 245| 197| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6chooseENS_2CT6ChoiceERKSA_SE_: 258| 197| static constexpr Self choose(CT::Choice choice, const Self& x, const Self& y) { 259| 197| auto r = y; 260| 197| r.conditional_assign(choice, x); 261| 197| return r; 262| 197| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 794| 323| static std::optional deserialize(std::span bytes) { 795| | // Conditional ok: input length is public 796| 323| if(bytes.size() != Self::BYTES) { ------------------ | Branch (796:13): [True: 0, False: 323] ------------------ 797| 0| return {}; 798| 0| } 799| | 800| 323| const auto words = bytes_to_words(bytes.first()); 801| | 802| | // Conditional acceptable: std::optional is implicitly not constant time 803| 323| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (803:13): [True: 0, False: 323] ------------------ 804| 0| return {}; 805| 0| } 806| | 807| | // Safe because we checked above that words is an integer < P 808| 323| return Self::from_words(words); 809| 323| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE10from_wordsILm9EEESB_NSt3__15arrayImXT_EEE: 213| 323| static constexpr Self from_words(std::array w) { 214| 323| if constexpr(L == N) { 215| 323| 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| 323| } pcurves_secp521r1.cpp:_ZN5Botan13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS4_7P521RepEE12ScalarParamsEE6to_repERKNSt3__15arrayImLm9EEE: 117| 323| constexpr static std::array to_rep(const std::array& x) { 118| 323| std::array z; // NOLINT(*-member-init) 119| 323| comba_mul(z.data(), x.data(), R2.data()); 120| 323| return Self::redc(z); 121| 323| } pcurves_secp521r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE12serialize_toENSt3__14spanIhLm133EEE: 952| 1.11k| constexpr void serialize_to(std::span bytes) const { 953| 1.11k| BOTAN_STATE_CHECK(this->is_identity().as_bool() == false); ------------------ | | 51| 1.11k| do { \ | | 52| 1.11k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 1.11k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 1.11k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 1.11k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 1.11k] | | ------------------ ------------------ 954| 1.11k| BufferStuffer pack(bytes); 955| 1.11k| pack.append(0x04); 956| 1.11k| x().serialize_to(pack.next()); 957| 1.11k| y().serialize_to(pack.next()); 958| 1.11k| BOTAN_DEBUG_ASSERT(pack.full()); ------------------ | | 137| 1.11k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.11k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.11k] | | ------------------ ------------------ 959| 1.11k| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE6randomERNS_21RandomNumberGeneratorE: 853| 323| static Self random(RandomNumberGenerator& rng) { 854| 323| constexpr size_t MAX_ATTEMPTS = 1000; 855| | 856| 323| std::array buf{}; 857| | 858| 323| for(size_t i = 0; i != MAX_ATTEMPTS; ++i) { ------------------ | Branch (858:28): [True: 323, False: 0] ------------------ 859| 323| rng.randomize(buf); 860| | 861| | // Zero off high bits that if set would certainly cause us 862| | // to be out of range 863| 323| if constexpr(Self::BITS % 8 != 0) { 864| 323| constexpr uint8_t mask = 0xFF >> (8 - (Self::BITS % 8)); 865| 323| buf[0] &= mask; 866| 323| } 867| | 868| | // Conditionals ok: rejection sampling reveals only values we didn't use 869| 323| if(auto s = Self::deserialize(buf)) { ------------------ | Branch (869:21): [True: 323, False: 0] ------------------ 870| 323| if(s.value().is_nonzero().as_bool()) { ------------------ | Branch (870:19): [True: 323, False: 0] ------------------ 871| 323| return s.value(); 872| 323| } 873| 323| } 874| 323| } 875| | 876| 0| throw Internal_Error("Failed to generate random Scalar within bounded number of attempts"); 877| 323| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_13MontgomeryRepINS_13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS5_7P521RepEE12ScalarParamsEEEE10is_nonzeroEv: 232| 323| constexpr CT::Choice is_nonzero() const { return !is_zero(); } pcurves_brainpool256r1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6EEENSt3__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_brainpool256r1.cpp:_ZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEENS_18BlindingRandomnessIS6_Lm1EEEEENT_15ProjectivePointENSt3__14spanIKNS9_11AffinePointELm18446744073709551615EEERKT1_RKT2_: 219| 543| const Blinding& blinding) { 220| 543| static constexpr size_t WindowElements = 1 << (WindowBits - 1); 221| | 222| 543| const size_t windows = (scalar.bits() + WindowBits) / WindowBits; 223| | 224| 543| auto accum = [&]() { 225| | // First window: extract W bits, shift left 1 to insert implicit carry in of zero 226| 543| const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1); 227| 543| const size_t raw = w_bits << 1; 228| 543| const auto [tidx, tneg] = booth_recode(raw); 229| 543| const auto tbl_0 = table.first(WindowElements); 230| | 231| 543| auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx)); 232| 543| pt.conditional_assign(tneg, pt.negate()); 233| 543| CT::poison(pt); 234| 543| blinding.randomize_rep(pt, 0); 235| 543| return pt; 236| 543| }(); 237| | 238| 26.6k| for(size_t i = 1; i != windows; ++i) { ------------------ | Branch (238:22): [True: 26.0k, False: 543] ------------------ 239| | // Extract W+1 bits overlapping by 1 with the previous window 240| 26.0k| const size_t bit_pos = WindowBits * i - 1; 241| 26.0k| const size_t raw = scalar.get_window(bit_pos); 242| 26.0k| const auto [tidx, tneg] = booth_recode(raw); 243| | 244| 26.0k| const auto tbl_i = table.subspan(WindowElements * i, WindowElements); 245| | 246| 26.0k| accum = C::ProjectivePoint::add_or_sub(accum, C::AffinePoint::ct_select(tbl_i, tidx), tneg); 247| | 248| | // Conditional ok: loop iteration count is public 249| 26.0k| if(i < Blinding::Rerandomizations) { ------------------ | Branch (249:10): [True: 1.62k, False: 24.4k] ------------------ 250| 1.62k| blinding.randomize_rep(accum, i); 251| 1.62k| } 252| 26.0k| } 253| | 254| 543| CT::unpoison(accum); 255| 543| return accum; 256| 543|} pcurves_brainpool256r1.cpp:_ZZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEENS_18BlindingRandomnessIS6_Lm1EEEEENT_15ProjectivePointENSt3__14spanIKNS9_11AffinePointELm18446744073709551615EEERKT1_RKT2_ENKUlvE_clEv: 224| 543| auto accum = [&]() { 225| | // First window: extract W bits, shift left 1 to insert implicit carry in of zero 226| 543| const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1); 227| 543| const size_t raw = w_bits << 1; 228| 543| const auto [tidx, tneg] = booth_recode(raw); 229| 543| const auto tbl_0 = table.first(WindowElements); 230| | 231| 543| auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx)); 232| 543| pt.conditional_assign(tneg, pt.negate()); 233| 543| CT::poison(pt); 234| 543| blinding.randomize_rep(pt, 0); 235| 543| return pt; 236| 543| }(); pcurves_brainpool256r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveEEC2ERKNS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEEmRKSE_SJ_: 332| 299| SharedZPointTable(build(p, n, a, u)) {} pcurves_brainpool256r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveEE5buildERKNS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEEmRKSE_SJ_: 388| 299| static Table build(const AffinePoint& p, size_t n, const FieldElement& a, const FieldElement& u) { 389| 299| BOTAN_ASSERT_NOMSG(n > 2); ------------------ | | 84| 299| do { \ | | 85| 299| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 299| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 299] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 299| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 299] | | ------------------ ------------------ 390| | 391| | // Chain P, 2*P, 3*P, ... where Z_i = Z_{i-1} * H_i for i >= 2 392| 299| std::vector chain; 393| 299| chain.reserve(n); 394| | // h[i - 2] = H_i 395| 299| std::vector h; 396| 299| h.reserve(n - 2); 397| | 398| 299| chain.push_back(ProjectivePoint::from_affine(p)); 399| 299| chain.push_back(chain[0].dbl()); 400| 4.48k| for(size_t i = 2; i != n; ++i) { ------------------ | Branch (400:28): [True: 4.18k, False: 299] ------------------ 401| 4.18k| const auto pt_h = ProjectivePoint::add_mixed_h(chain[i - 1], p); 402| 4.18k| chain.push_back(pt_h.first); 403| 4.18k| h.push_back(pt_h.second); 404| 4.18k| } 405| | 406| | // The shared Z is u * Z_{n-1} 407| 299| const FieldElement zt = u * chain[n - 1].z(); 408| | 409| | // Built in reverse order since the scaling factors are suffix products 410| 299| std::vector pts; 411| 299| pts.reserve(n); 412| | 413| | // The last entry is scaled by u alone 414| 299| pts.push_back(rescale(chain[n - 1], u)); 415| | 416| | // Entry i is scaled by Zt/Z_i = u * H_{i+1} * ... * H_{n-1} 417| 299| FieldElement mu = u * h[n - 3]; 418| 4.48k| for(size_t i = n - 2; i > 0; --i) { ------------------ | Branch (418:32): [True: 4.18k, False: 299] ------------------ 419| | // Conditional ok: loop iteration count is public 420| 4.18k| if(i != n - 2) { ------------------ | Branch (420:16): [True: 3.88k, False: 299] ------------------ 421| 3.88k| mu *= h[i - 1]; 422| 3.88k| } 423| 4.18k| pts.push_back(rescale(chain[i], mu)); 424| 4.18k| } 425| | 426| | // Entry 0 is P itself with Z = 1, so it is scaled by Zt 427| 299| pts.push_back(rescale(chain[0], zt)); 428| | 429| 299| std::reverse(pts.begin(), pts.end()); 430| | 431| 299| return finish(std::move(pts), zt, a); 432| 299| } pcurves_brainpool256r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveEE7rescaleERKNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EERKSE_: 377| 4.78k| static AffinePoint rescale(const ProjectivePoint& pt, const FieldElement& f) { 378| 4.78k| const auto f2 = f.square(); 379| 4.78k| const auto f3 = f2 * f; 380| 4.78k| return AffinePoint(pt.x() * f2, pt.y() * f3); 381| 4.78k| } pcurves_brainpool256r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveEE6finishENSt3__16vectorINS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsESA_E11FieldParamsEEEEEEENS6_9allocatorISH_EEEERKSG_SM_: 383| 299| static Table finish(std::vector pts, const FieldElement& zt, const FieldElement& a) { 384| 299| const auto zt2 = zt.square(); 385| 299| return Table{std::move(pts), zt, a * zt2.square()}; 386| 299| } pcurves_brainpool256r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveEEC2ENS5_5TableE: 374| 299| explicit SharedZPointTable(Table t) : m_table(std::move(t.pts)), m_z(t.z), m_a(t.a) {} pcurves_brainpool256r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveEE9ct_selectEm: 355| 17.3k| AffinePoint ct_select(size_t idx) const { return AffinePoint::ct_select(m_table, idx); } pcurves_brainpool256r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveEE1aEv: 365| 34.0k| const FieldElement& a() const { return m_a; } pcurves_brainpool256r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool256r15CurveEE1zEv: 360| 299| const FieldElement& z() const { return m_z; } pcurves_brainpool384r1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6EEENSt3__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_brainpool384r1.cpp:_ZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEENS_18BlindingRandomnessIS6_Lm1EEEEENT_15ProjectivePointENSt3__14spanIKNS9_11AffinePointELm18446744073709551615EEERKT1_RKT2_: 219| 351| const Blinding& blinding) { 220| 351| static constexpr size_t WindowElements = 1 << (WindowBits - 1); 221| | 222| 351| const size_t windows = (scalar.bits() + WindowBits) / WindowBits; 223| | 224| 351| auto accum = [&]() { 225| | // First window: extract W bits, shift left 1 to insert implicit carry in of zero 226| 351| const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1); 227| 351| const size_t raw = w_bits << 1; 228| 351| const auto [tidx, tneg] = booth_recode(raw); 229| 351| const auto tbl_0 = table.first(WindowElements); 230| | 231| 351| auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx)); 232| 351| pt.conditional_assign(tneg, pt.negate()); 233| 351| CT::poison(pt); 234| 351| blinding.randomize_rep(pt, 0); 235| 351| return pt; 236| 351| }(); 237| | 238| 25.6k| for(size_t i = 1; i != windows; ++i) { ------------------ | Branch (238:22): [True: 25.2k, False: 351] ------------------ 239| | // Extract W+1 bits overlapping by 1 with the previous window 240| 25.2k| const size_t bit_pos = WindowBits * i - 1; 241| 25.2k| const size_t raw = scalar.get_window(bit_pos); 242| 25.2k| const auto [tidx, tneg] = booth_recode(raw); 243| | 244| 25.2k| const auto tbl_i = table.subspan(WindowElements * i, WindowElements); 245| | 246| 25.2k| accum = C::ProjectivePoint::add_or_sub(accum, C::AffinePoint::ct_select(tbl_i, tidx), tneg); 247| | 248| | // Conditional ok: loop iteration count is public 249| 25.2k| if(i < Blinding::Rerandomizations) { ------------------ | Branch (249:10): [True: 1.05k, False: 24.2k] ------------------ 250| 1.05k| blinding.randomize_rep(accum, i); 251| 1.05k| } 252| 25.2k| } 253| | 254| 351| CT::unpoison(accum); 255| 351| return accum; 256| 351|} pcurves_brainpool384r1.cpp:_ZZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEENS_18BlindingRandomnessIS6_Lm1EEEEENT_15ProjectivePointENSt3__14spanIKNS9_11AffinePointELm18446744073709551615EEERKT1_RKT2_ENKUlvE_clEv: 224| 351| auto accum = [&]() { 225| | // First window: extract W bits, shift left 1 to insert implicit carry in of zero 226| 351| const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1); 227| 351| const size_t raw = w_bits << 1; 228| 351| const auto [tidx, tneg] = booth_recode(raw); 229| 351| const auto tbl_0 = table.first(WindowElements); 230| | 231| 351| auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx)); 232| 351| pt.conditional_assign(tneg, pt.negate()); 233| 351| CT::poison(pt); 234| 351| blinding.randomize_rep(pt, 0); 235| 351| return pt; 236| 351| }(); pcurves_brainpool384r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveEEC2ERKNS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEEmRKSE_SJ_: 332| 168| SharedZPointTable(build(p, n, a, u)) {} pcurves_brainpool384r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveEE5buildERKNS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEEmRKSE_SJ_: 388| 168| static Table build(const AffinePoint& p, size_t n, const FieldElement& a, const FieldElement& u) { 389| 168| BOTAN_ASSERT_NOMSG(n > 2); ------------------ | | 84| 168| do { \ | | 85| 168| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 168| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 168] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 168| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 168] | | ------------------ ------------------ 390| | 391| | // Chain P, 2*P, 3*P, ... where Z_i = Z_{i-1} * H_i for i >= 2 392| 168| std::vector chain; 393| 168| chain.reserve(n); 394| | // h[i - 2] = H_i 395| 168| std::vector h; 396| 168| h.reserve(n - 2); 397| | 398| 168| chain.push_back(ProjectivePoint::from_affine(p)); 399| 168| chain.push_back(chain[0].dbl()); 400| 2.52k| for(size_t i = 2; i != n; ++i) { ------------------ | Branch (400:28): [True: 2.35k, False: 168] ------------------ 401| 2.35k| const auto pt_h = ProjectivePoint::add_mixed_h(chain[i - 1], p); 402| 2.35k| chain.push_back(pt_h.first); 403| 2.35k| h.push_back(pt_h.second); 404| 2.35k| } 405| | 406| | // The shared Z is u * Z_{n-1} 407| 168| const FieldElement zt = u * chain[n - 1].z(); 408| | 409| | // Built in reverse order since the scaling factors are suffix products 410| 168| std::vector pts; 411| 168| pts.reserve(n); 412| | 413| | // The last entry is scaled by u alone 414| 168| pts.push_back(rescale(chain[n - 1], u)); 415| | 416| | // Entry i is scaled by Zt/Z_i = u * H_{i+1} * ... * H_{n-1} 417| 168| FieldElement mu = u * h[n - 3]; 418| 2.52k| for(size_t i = n - 2; i > 0; --i) { ------------------ | Branch (418:32): [True: 2.35k, False: 168] ------------------ 419| | // Conditional ok: loop iteration count is public 420| 2.35k| if(i != n - 2) { ------------------ | Branch (420:16): [True: 2.18k, False: 168] ------------------ 421| 2.18k| mu *= h[i - 1]; 422| 2.18k| } 423| 2.35k| pts.push_back(rescale(chain[i], mu)); 424| 2.35k| } 425| | 426| | // Entry 0 is P itself with Z = 1, so it is scaled by Zt 427| 168| pts.push_back(rescale(chain[0], zt)); 428| | 429| 168| std::reverse(pts.begin(), pts.end()); 430| | 431| 168| return finish(std::move(pts), zt, a); 432| 168| } pcurves_brainpool384r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveEE7rescaleERKNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EERKSE_: 377| 2.68k| static AffinePoint rescale(const ProjectivePoint& pt, const FieldElement& f) { 378| 2.68k| const auto f2 = f.square(); 379| 2.68k| const auto f3 = f2 * f; 380| 2.68k| return AffinePoint(pt.x() * f2, pt.y() * f3); 381| 2.68k| } pcurves_brainpool384r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveEE6finishENSt3__16vectorINS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsESA_E11FieldParamsEEEEEEENS6_9allocatorISH_EEEERKSG_SM_: 383| 168| static Table finish(std::vector pts, const FieldElement& zt, const FieldElement& a) { 384| 168| const auto zt2 = zt.square(); 385| 168| return Table{std::move(pts), zt, a * zt2.square()}; 386| 168| } pcurves_brainpool384r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveEEC2ENS5_5TableE: 374| 168| explicit SharedZPointTable(Table t) : m_table(std::move(t.pts)), m_z(t.z), m_a(t.a) {} pcurves_brainpool384r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveEE9ct_selectEm: 355| 14.6k| AffinePoint ct_select(size_t idx) const { return AffinePoint::ct_select(m_table, idx); } pcurves_brainpool384r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveEE1aEv: 365| 28.8k| const FieldElement& a() const { return m_a; } pcurves_brainpool384r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool384r15CurveEE1zEv: 360| 168| const FieldElement& z() const { return m_z; } pcurves_brainpool512r1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6EEENSt3__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_brainpool512r1.cpp:_ZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEENS_18BlindingRandomnessIS6_Lm1EEEEENT_15ProjectivePointENSt3__14spanIKNS9_11AffinePointELm18446744073709551615EEERKT1_RKT2_: 219| 345| const Blinding& blinding) { 220| 345| static constexpr size_t WindowElements = 1 << (WindowBits - 1); 221| | 222| 345| const size_t windows = (scalar.bits() + WindowBits) / WindowBits; 223| | 224| 345| auto accum = [&]() { 225| | // First window: extract W bits, shift left 1 to insert implicit carry in of zero 226| 345| const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1); 227| 345| const size_t raw = w_bits << 1; 228| 345| const auto [tidx, tneg] = booth_recode(raw); 229| 345| const auto tbl_0 = table.first(WindowElements); 230| | 231| 345| auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx)); 232| 345| pt.conditional_assign(tneg, pt.negate()); 233| 345| CT::poison(pt); 234| 345| blinding.randomize_rep(pt, 0); 235| 345| return pt; 236| 345| }(); 237| | 238| 33.4k| for(size_t i = 1; i != windows; ++i) { ------------------ | Branch (238:22): [True: 33.1k, False: 345] ------------------ 239| | // Extract W+1 bits overlapping by 1 with the previous window 240| 33.1k| const size_t bit_pos = WindowBits * i - 1; 241| 33.1k| const size_t raw = scalar.get_window(bit_pos); 242| 33.1k| const auto [tidx, tneg] = booth_recode(raw); 243| | 244| 33.1k| const auto tbl_i = table.subspan(WindowElements * i, WindowElements); 245| | 246| 33.1k| accum = C::ProjectivePoint::add_or_sub(accum, C::AffinePoint::ct_select(tbl_i, tidx), tneg); 247| | 248| | // Conditional ok: loop iteration count is public 249| 33.1k| if(i < Blinding::Rerandomizations) { ------------------ | Branch (249:10): [True: 1.03k, False: 32.0k] ------------------ 250| 1.03k| blinding.randomize_rep(accum, i); 251| 1.03k| } 252| 33.1k| } 253| | 254| 345| CT::unpoison(accum); 255| 345| return accum; 256| 345|} pcurves_brainpool512r1.cpp:_ZZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEENS_18BlindingRandomnessIS6_Lm1EEEEENT_15ProjectivePointENSt3__14spanIKNS9_11AffinePointELm18446744073709551615EEERKT1_RKT2_ENKUlvE_clEv: 224| 345| auto accum = [&]() { 225| | // First window: extract W bits, shift left 1 to insert implicit carry in of zero 226| 345| const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1); 227| 345| const size_t raw = w_bits << 1; 228| 345| const auto [tidx, tneg] = booth_recode(raw); 229| 345| const auto tbl_0 = table.first(WindowElements); 230| | 231| 345| auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx)); 232| 345| pt.conditional_assign(tneg, pt.negate()); 233| 345| CT::poison(pt); 234| 345| blinding.randomize_rep(pt, 0); 235| 345| return pt; 236| 345| }(); pcurves_brainpool512r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveEEC2ERKNS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEEmRKSE_SJ_: 332| 213| SharedZPointTable(build(p, n, a, u)) {} pcurves_brainpool512r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveEE5buildERKNS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEEmRKSE_SJ_: 388| 213| static Table build(const AffinePoint& p, size_t n, const FieldElement& a, const FieldElement& u) { 389| 213| BOTAN_ASSERT_NOMSG(n > 2); ------------------ | | 84| 213| do { \ | | 85| 213| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 213| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 213] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 213| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 213] | | ------------------ ------------------ 390| | 391| | // Chain P, 2*P, 3*P, ... where Z_i = Z_{i-1} * H_i for i >= 2 392| 213| std::vector chain; 393| 213| chain.reserve(n); 394| | // h[i - 2] = H_i 395| 213| std::vector h; 396| 213| h.reserve(n - 2); 397| | 398| 213| chain.push_back(ProjectivePoint::from_affine(p)); 399| 213| chain.push_back(chain[0].dbl()); 400| 3.19k| for(size_t i = 2; i != n; ++i) { ------------------ | Branch (400:28): [True: 2.98k, False: 213] ------------------ 401| 2.98k| const auto pt_h = ProjectivePoint::add_mixed_h(chain[i - 1], p); 402| 2.98k| chain.push_back(pt_h.first); 403| 2.98k| h.push_back(pt_h.second); 404| 2.98k| } 405| | 406| | // The shared Z is u * Z_{n-1} 407| 213| const FieldElement zt = u * chain[n - 1].z(); 408| | 409| | // Built in reverse order since the scaling factors are suffix products 410| 213| std::vector pts; 411| 213| pts.reserve(n); 412| | 413| | // The last entry is scaled by u alone 414| 213| pts.push_back(rescale(chain[n - 1], u)); 415| | 416| | // Entry i is scaled by Zt/Z_i = u * H_{i+1} * ... * H_{n-1} 417| 213| FieldElement mu = u * h[n - 3]; 418| 3.19k| for(size_t i = n - 2; i > 0; --i) { ------------------ | Branch (418:32): [True: 2.98k, False: 213] ------------------ 419| | // Conditional ok: loop iteration count is public 420| 2.98k| if(i != n - 2) { ------------------ | Branch (420:16): [True: 2.76k, False: 213] ------------------ 421| 2.76k| mu *= h[i - 1]; 422| 2.76k| } 423| 2.98k| pts.push_back(rescale(chain[i], mu)); 424| 2.98k| } 425| | 426| | // Entry 0 is P itself with Z = 1, so it is scaled by Zt 427| 213| pts.push_back(rescale(chain[0], zt)); 428| | 429| 213| std::reverse(pts.begin(), pts.end()); 430| | 431| 213| return finish(std::move(pts), zt, a); 432| 213| } pcurves_brainpool512r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveEE7rescaleERKNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EERKSE_: 377| 3.40k| static AffinePoint rescale(const ProjectivePoint& pt, const FieldElement& f) { 378| 3.40k| const auto f2 = f.square(); 379| 3.40k| const auto f3 = f2 * f; 380| 3.40k| return AffinePoint(pt.x() * f2, pt.y() * f3); 381| 3.40k| } pcurves_brainpool512r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveEE6finishENSt3__16vectorINS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsESA_E11FieldParamsEEEEEEENS6_9allocatorISH_EEEERKSG_SM_: 383| 213| static Table finish(std::vector pts, const FieldElement& zt, const FieldElement& a) { 384| 213| const auto zt2 = zt.square(); 385| 213| return Table{std::move(pts), zt, a * zt2.square()}; 386| 213| } pcurves_brainpool512r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveEEC2ENS5_5TableE: 374| 213| explicit SharedZPointTable(Table t) : m_table(std::move(t.pts)), m_z(t.z), m_a(t.a) {} pcurves_brainpool512r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveEE9ct_selectEm: 355| 24.7k| AffinePoint ct_select(size_t idx) const { return AffinePoint::ct_select(m_table, idx); } pcurves_brainpool512r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveEE1aEv: 365| 48.9k| const FieldElement& a() const { return m_a; } pcurves_brainpool512r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_114brainpool512r15CurveEE1zEv: 360| 213| const FieldElement& z() const { return m_z; } pcurves_secp256r1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6EEENSt3__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_secp256r1.cpp:_ZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEENS_18BlindingRandomnessIS6_Lm1EEEEENT_15ProjectivePointENSt3__14spanIKNS9_11AffinePointELm18446744073709551615EEERKT1_RKT2_: 219| 6.75k| const Blinding& blinding) { 220| 6.75k| static constexpr size_t WindowElements = 1 << (WindowBits - 1); 221| | 222| 6.75k| const size_t windows = (scalar.bits() + WindowBits) / WindowBits; 223| | 224| 6.75k| auto accum = [&]() { 225| | // First window: extract W bits, shift left 1 to insert implicit carry in of zero 226| 6.75k| const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1); 227| 6.75k| const size_t raw = w_bits << 1; 228| 6.75k| const auto [tidx, tneg] = booth_recode(raw); 229| 6.75k| const auto tbl_0 = table.first(WindowElements); 230| | 231| 6.75k| auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx)); 232| 6.75k| pt.conditional_assign(tneg, pt.negate()); 233| 6.75k| CT::poison(pt); 234| 6.75k| blinding.randomize_rep(pt, 0); 235| 6.75k| return pt; 236| 6.75k| }(); 237| | 238| 293k| for(size_t i = 1; i != windows; ++i) { ------------------ | Branch (238:22): [True: 286k, False: 6.75k] ------------------ 239| | // Extract W+1 bits overlapping by 1 with the previous window 240| 286k| const size_t bit_pos = WindowBits * i - 1; 241| 286k| const size_t raw = scalar.get_window(bit_pos); 242| 286k| const auto [tidx, tneg] = booth_recode(raw); 243| | 244| 286k| const auto tbl_i = table.subspan(WindowElements * i, WindowElements); 245| | 246| 286k| accum = C::ProjectivePoint::add_or_sub(accum, C::AffinePoint::ct_select(tbl_i, tidx), tneg); 247| | 248| | // Conditional ok: loop iteration count is public 249| 286k| if(i < Blinding::Rerandomizations) { ------------------ | Branch (249:10): [True: 20.2k, False: 266k] ------------------ 250| 20.2k| blinding.randomize_rep(accum, i); 251| 20.2k| } 252| 286k| } 253| | 254| 6.75k| CT::unpoison(accum); 255| 6.75k| return accum; 256| 6.75k|} pcurves_secp256r1.cpp:_ZZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_19secp256r15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEENS_18BlindingRandomnessIS6_Lm1EEEEENT_15ProjectivePointENSt3__14spanIKNS9_11AffinePointELm18446744073709551615EEERKT1_RKT2_ENKUlvE_clEv: 224| 6.75k| auto accum = [&]() { 225| | // First window: extract W bits, shift left 1 to insert implicit carry in of zero 226| 6.75k| const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1); 227| 6.75k| const size_t raw = w_bits << 1; 228| 6.75k| const auto [tidx, tneg] = booth_recode(raw); 229| 6.75k| const auto tbl_0 = table.first(WindowElements); 230| | 231| 6.75k| auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx)); 232| 6.75k| pt.conditional_assign(tneg, pt.negate()); 233| 6.75k| CT::poison(pt); 234| 6.75k| blinding.randomize_rep(pt, 0); 235| 6.75k| return pt; 236| 6.75k| }(); pcurves_secp256r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp256r15CurveEEC2ERKNS_16AffineCurvePointINS_6IntModINS2_22Secp256r1MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEEmRKSE_SJ_: 332| 327| SharedZPointTable(build(p, n, a, u)) {} pcurves_secp256r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp256r15CurveEE5buildERKNS_16AffineCurvePointINS_6IntModINS2_22Secp256r1MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEEmRKSE_SJ_: 388| 327| static Table build(const AffinePoint& p, size_t n, const FieldElement& a, const FieldElement& u) { 389| 327| BOTAN_ASSERT_NOMSG(n > 2); ------------------ | | 84| 327| do { \ | | 85| 327| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 327| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 327] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 327| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 327] | | ------------------ ------------------ 390| | 391| | // Chain P, 2*P, 3*P, ... where Z_i = Z_{i-1} * H_i for i >= 2 392| 327| std::vector chain; 393| 327| chain.reserve(n); 394| | // h[i - 2] = H_i 395| 327| std::vector h; 396| 327| h.reserve(n - 2); 397| | 398| 327| chain.push_back(ProjectivePoint::from_affine(p)); 399| 327| chain.push_back(chain[0].dbl()); 400| 4.90k| for(size_t i = 2; i != n; ++i) { ------------------ | Branch (400:28): [True: 4.57k, False: 327] ------------------ 401| 4.57k| const auto pt_h = ProjectivePoint::add_mixed_h(chain[i - 1], p); 402| 4.57k| chain.push_back(pt_h.first); 403| 4.57k| h.push_back(pt_h.second); 404| 4.57k| } 405| | 406| | // The shared Z is u * Z_{n-1} 407| 327| const FieldElement zt = u * chain[n - 1].z(); 408| | 409| | // Built in reverse order since the scaling factors are suffix products 410| 327| std::vector pts; 411| 327| pts.reserve(n); 412| | 413| | // The last entry is scaled by u alone 414| 327| pts.push_back(rescale(chain[n - 1], u)); 415| | 416| | // Entry i is scaled by Zt/Z_i = u * H_{i+1} * ... * H_{n-1} 417| 327| FieldElement mu = u * h[n - 3]; 418| 4.90k| for(size_t i = n - 2; i > 0; --i) { ------------------ | Branch (418:32): [True: 4.57k, False: 327] ------------------ 419| | // Conditional ok: loop iteration count is public 420| 4.57k| if(i != n - 2) { ------------------ | Branch (420:16): [True: 4.25k, False: 327] ------------------ 421| 4.25k| mu *= h[i - 1]; 422| 4.25k| } 423| 4.57k| pts.push_back(rescale(chain[i], mu)); 424| 4.57k| } 425| | 426| | // Entry 0 is P itself with Z = 1, so it is scaled by Zt 427| 327| pts.push_back(rescale(chain[0], zt)); 428| | 429| 327| std::reverse(pts.begin(), pts.end()); 430| | 431| 327| return finish(std::move(pts), zt, a); 432| 327| } pcurves_secp256r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp256r15CurveEE7rescaleERKNS_20ProjectiveCurvePointINS_6IntModINS2_22Secp256r1MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EERKSE_: 377| 5.23k| static AffinePoint rescale(const ProjectivePoint& pt, const FieldElement& f) { 378| 5.23k| const auto f2 = f.square(); 379| 5.23k| const auto f3 = f2 * f; 380| 5.23k| return AffinePoint(pt.x() * f2, pt.y() * f3); 381| 5.23k| } pcurves_secp256r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp256r15CurveEE6finishENSt3__16vectorINS_16AffineCurvePointINS_6IntModINS2_22Secp256r1MontgomeryRepINS_13EllipticCurveINS3_6ParamsESA_E11FieldParamsEEEEEEENS6_9allocatorISH_EEEERKSG_SM_: 383| 327| static Table finish(std::vector pts, const FieldElement& zt, const FieldElement& a) { 384| 327| const auto zt2 = zt.square(); 385| 327| return Table{std::move(pts), zt, a * zt2.square()}; 386| 327| } pcurves_secp256r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp256r15CurveEEC2ENS5_5TableE: 374| 327| explicit SharedZPointTable(Table t) : m_table(std::move(t.pts)), m_z(t.z), m_a(t.a) {} pcurves_secp256r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp256r15CurveEE9ct_selectEm: 355| 18.9k| AffinePoint ct_select(size_t idx) const { return AffinePoint::ct_select(m_table, idx); } pcurves_secp256r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp256r15CurveEE1aEv: 365| 37.2k| const FieldElement& a() const { return m_a; } pcurves_secp256r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp256r15CurveEE1zEv: 360| 327| const FieldElement& z() const { return m_z; } 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:_ZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEENS_18BlindingRandomnessIS6_Lm1EEEEENT_15ProjectivePointENSt3__14spanIKNS9_11AffinePointELm18446744073709551615EEERKT1_RKT2_: 219| 374| const Blinding& blinding) { 220| 374| static constexpr size_t WindowElements = 1 << (WindowBits - 1); 221| | 222| 374| const size_t windows = (scalar.bits() + WindowBits) / WindowBits; 223| | 224| 374| auto accum = [&]() { 225| | // First window: extract W bits, shift left 1 to insert implicit carry in of zero 226| 374| const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1); 227| 374| const size_t raw = w_bits << 1; 228| 374| const auto [tidx, tneg] = booth_recode(raw); 229| 374| const auto tbl_0 = table.first(WindowElements); 230| | 231| 374| auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx)); 232| 374| pt.conditional_assign(tneg, pt.negate()); 233| 374| CT::poison(pt); 234| 374| blinding.randomize_rep(pt, 0); 235| 374| return pt; 236| 374| }(); 237| | 238| 27.3k| for(size_t i = 1; i != windows; ++i) { ------------------ | Branch (238:22): [True: 26.9k, False: 374] ------------------ 239| | // Extract W+1 bits overlapping by 1 with the previous window 240| 26.9k| const size_t bit_pos = WindowBits * i - 1; 241| 26.9k| const size_t raw = scalar.get_window(bit_pos); 242| 26.9k| const auto [tidx, tneg] = booth_recode(raw); 243| | 244| 26.9k| const auto tbl_i = table.subspan(WindowElements * i, WindowElements); 245| | 246| 26.9k| accum = C::ProjectivePoint::add_or_sub(accum, C::AffinePoint::ct_select(tbl_i, tidx), tneg); 247| | 248| | // Conditional ok: loop iteration count is public 249| 26.9k| if(i < Blinding::Rerandomizations) { ------------------ | Branch (249:10): [True: 1.12k, False: 25.8k] ------------------ 250| 1.12k| blinding.randomize_rep(accum, i); 251| 1.12k| } 252| 26.9k| } 253| | 254| 374| CT::unpoison(accum); 255| 374| return accum; 256| 374|} pcurves_secp384r1.cpp:_ZZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEENS_18BlindingRandomnessIS6_Lm1EEEEENT_15ProjectivePointENSt3__14spanIKNS9_11AffinePointELm18446744073709551615EEERKT1_RKT2_ENKUlvE_clEv: 224| 374| auto accum = [&]() { 225| | // First window: extract W bits, shift left 1 to insert implicit carry in of zero 226| 374| const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1); 227| 374| const size_t raw = w_bits << 1; 228| 374| const auto [tidx, tneg] = booth_recode(raw); 229| 374| const auto tbl_0 = table.first(WindowElements); 230| | 231| 374| auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx)); 232| 374| pt.conditional_assign(tneg, pt.negate()); 233| 374| CT::poison(pt); 234| 374| blinding.randomize_rep(pt, 0); 235| 374| return pt; 236| 374| }(); pcurves_secp384r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp384r15CurveEEC2ERKNS_16AffineCurvePointINS_6IntModINS2_12Secp384r1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEEmRKSE_SJ_: 332| 210| SharedZPointTable(build(p, n, a, u)) {} pcurves_secp384r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp384r15CurveEE5buildERKNS_16AffineCurvePointINS_6IntModINS2_12Secp384r1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEEmRKSE_SJ_: 388| 210| static Table build(const AffinePoint& p, size_t n, const FieldElement& a, const FieldElement& u) { 389| 210| BOTAN_ASSERT_NOMSG(n > 2); ------------------ | | 84| 210| do { \ | | 85| 210| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 210| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 210] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 210| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 210] | | ------------------ ------------------ 390| | 391| | // Chain P, 2*P, 3*P, ... where Z_i = Z_{i-1} * H_i for i >= 2 392| 210| std::vector chain; 393| 210| chain.reserve(n); 394| | // h[i - 2] = H_i 395| 210| std::vector h; 396| 210| h.reserve(n - 2); 397| | 398| 210| chain.push_back(ProjectivePoint::from_affine(p)); 399| 210| chain.push_back(chain[0].dbl()); 400| 3.15k| for(size_t i = 2; i != n; ++i) { ------------------ | Branch (400:28): [True: 2.94k, False: 210] ------------------ 401| 2.94k| const auto pt_h = ProjectivePoint::add_mixed_h(chain[i - 1], p); 402| 2.94k| chain.push_back(pt_h.first); 403| 2.94k| h.push_back(pt_h.second); 404| 2.94k| } 405| | 406| | // The shared Z is u * Z_{n-1} 407| 210| const FieldElement zt = u * chain[n - 1].z(); 408| | 409| | // Built in reverse order since the scaling factors are suffix products 410| 210| std::vector pts; 411| 210| pts.reserve(n); 412| | 413| | // The last entry is scaled by u alone 414| 210| pts.push_back(rescale(chain[n - 1], u)); 415| | 416| | // Entry i is scaled by Zt/Z_i = u * H_{i+1} * ... * H_{n-1} 417| 210| FieldElement mu = u * h[n - 3]; 418| 3.15k| for(size_t i = n - 2; i > 0; --i) { ------------------ | Branch (418:32): [True: 2.94k, False: 210] ------------------ 419| | // Conditional ok: loop iteration count is public 420| 2.94k| if(i != n - 2) { ------------------ | Branch (420:16): [True: 2.73k, False: 210] ------------------ 421| 2.73k| mu *= h[i - 1]; 422| 2.73k| } 423| 2.94k| pts.push_back(rescale(chain[i], mu)); 424| 2.94k| } 425| | 426| | // Entry 0 is P itself with Z = 1, so it is scaled by Zt 427| 210| pts.push_back(rescale(chain[0], zt)); 428| | 429| 210| std::reverse(pts.begin(), pts.end()); 430| | 431| 210| return finish(std::move(pts), zt, a); 432| 210| } pcurves_secp384r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp384r15CurveEE7rescaleERKNS_20ProjectiveCurvePointINS_6IntModINS2_12Secp384r1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EERKSE_: 377| 3.36k| static AffinePoint rescale(const ProjectivePoint& pt, const FieldElement& f) { 378| 3.36k| const auto f2 = f.square(); 379| 3.36k| const auto f3 = f2 * f; 380| 3.36k| return AffinePoint(pt.x() * f2, pt.y() * f3); 381| 3.36k| } pcurves_secp384r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp384r15CurveEE6finishENSt3__16vectorINS_16AffineCurvePointINS_6IntModINS2_12Secp384r1RepINS_13EllipticCurveINS3_6ParamsESA_E11FieldParamsEEEEEEENS6_9allocatorISH_EEEERKSG_SM_: 383| 210| static Table finish(std::vector pts, const FieldElement& zt, const FieldElement& a) { 384| 210| const auto zt2 = zt.square(); 385| 210| return Table{std::move(pts), zt, a * zt2.square()}; 386| 210| } pcurves_secp384r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp384r15CurveEEC2ENS5_5TableE: 374| 210| explicit SharedZPointTable(Table t) : m_table(std::move(t.pts)), m_z(t.z), m_a(t.a) {} pcurves_secp384r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp384r15CurveEE9ct_selectEm: 355| 18.2k| AffinePoint ct_select(size_t idx) const { return AffinePoint::ct_select(m_table, idx); } pcurves_secp384r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp384r15CurveEE1aEv: 365| 36.1k| const FieldElement& a() const { return m_a; } pcurves_secp384r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp384r15CurveEE1zEv: 360| 210| const FieldElement& z() const { return m_z; } 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:_ZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEENS_18BlindingRandomnessIS6_Lm1EEEEENT_15ProjectivePointENSt3__14spanIKNS9_11AffinePointELm18446744073709551615EEERKT1_RKT2_: 219| 323| const Blinding& blinding) { 220| 323| static constexpr size_t WindowElements = 1 << (WindowBits - 1); 221| | 222| 323| const size_t windows = (scalar.bits() + WindowBits) / WindowBits; 223| | 224| 323| auto accum = [&]() { 225| | // First window: extract W bits, shift left 1 to insert implicit carry in of zero 226| 323| const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1); 227| 323| const size_t raw = w_bits << 1; 228| 323| const auto [tidx, tneg] = booth_recode(raw); 229| 323| const auto tbl_0 = table.first(WindowElements); 230| | 231| 323| auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx)); 232| 323| pt.conditional_assign(tneg, pt.negate()); 233| 323| CT::poison(pt); 234| 323| blinding.randomize_rep(pt, 0); 235| 323| return pt; 236| 323| }(); 237| | 238| 31.3k| for(size_t i = 1; i != windows; ++i) { ------------------ | Branch (238:22): [True: 31.0k, False: 323] ------------------ 239| | // Extract W+1 bits overlapping by 1 with the previous window 240| 31.0k| const size_t bit_pos = WindowBits * i - 1; 241| 31.0k| const size_t raw = scalar.get_window(bit_pos); 242| 31.0k| const auto [tidx, tneg] = booth_recode(raw); 243| | 244| 31.0k| const auto tbl_i = table.subspan(WindowElements * i, WindowElements); 245| | 246| 31.0k| accum = C::ProjectivePoint::add_or_sub(accum, C::AffinePoint::ct_select(tbl_i, tidx), tneg); 247| | 248| | // Conditional ok: loop iteration count is public 249| 31.0k| if(i < Blinding::Rerandomizations) { ------------------ | Branch (249:10): [True: 969, False: 30.0k] ------------------ 250| 969| blinding.randomize_rep(accum, i); 251| 969| } 252| 31.0k| } 253| | 254| 323| CT::unpoison(accum); 255| 323| return accum; 256| 323|} pcurves_secp521r1.cpp:_ZZN5Botan18basemul_booth_execINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6ENS_17BlindedScalarBitsIS4_Lm7EEENS_18BlindingRandomnessIS6_Lm1EEEEENT_15ProjectivePointENSt3__14spanIKNS9_11AffinePointELm18446744073709551615EEERKT1_RKT2_ENKUlvE_clEv: 224| 323| auto accum = [&]() { 225| | // First window: extract W bits, shift left 1 to insert implicit carry in of zero 226| 323| const size_t w_bits = scalar.get_window(0) & ((1 << WindowBits) - 1); 227| 323| const size_t raw = w_bits << 1; 228| 323| const auto [tidx, tneg] = booth_recode(raw); 229| 323| const auto tbl_0 = table.first(WindowElements); 230| | 231| 323| auto pt = C::ProjectivePoint::from_affine(C::AffinePoint::ct_select(tbl_0, tidx)); 232| 323| pt.conditional_assign(tneg, pt.negate()); 233| 323| CT::poison(pt); 234| 323| blinding.randomize_rep(pt, 0); 235| 323| return pt; 236| 323| }(); pcurves_secp521r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp521r15CurveEEC2ERKNS_16AffineCurvePointINS_6IntModINS3_7P521RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEEmRKSE_SJ_: 332| 197| SharedZPointTable(build(p, n, a, u)) {} pcurves_secp521r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp521r15CurveEE5buildERKNS_16AffineCurvePointINS_6IntModINS3_7P521RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEEmRKSE_SJ_: 388| 197| static Table build(const AffinePoint& p, size_t n, const FieldElement& a, const FieldElement& u) { 389| 197| BOTAN_ASSERT_NOMSG(n > 2); ------------------ | | 84| 197| do { \ | | 85| 197| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 197| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 197] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 197| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 197] | | ------------------ ------------------ 390| | 391| | // Chain P, 2*P, 3*P, ... where Z_i = Z_{i-1} * H_i for i >= 2 392| 197| std::vector chain; 393| 197| chain.reserve(n); 394| | // h[i - 2] = H_i 395| 197| std::vector h; 396| 197| h.reserve(n - 2); 397| | 398| 197| chain.push_back(ProjectivePoint::from_affine(p)); 399| 197| chain.push_back(chain[0].dbl()); 400| 2.95k| for(size_t i = 2; i != n; ++i) { ------------------ | Branch (400:28): [True: 2.75k, False: 197] ------------------ 401| 2.75k| const auto pt_h = ProjectivePoint::add_mixed_h(chain[i - 1], p); 402| 2.75k| chain.push_back(pt_h.first); 403| 2.75k| h.push_back(pt_h.second); 404| 2.75k| } 405| | 406| | // The shared Z is u * Z_{n-1} 407| 197| const FieldElement zt = u * chain[n - 1].z(); 408| | 409| | // Built in reverse order since the scaling factors are suffix products 410| 197| std::vector pts; 411| 197| pts.reserve(n); 412| | 413| | // The last entry is scaled by u alone 414| 197| pts.push_back(rescale(chain[n - 1], u)); 415| | 416| | // Entry i is scaled by Zt/Z_i = u * H_{i+1} * ... * H_{n-1} 417| 197| FieldElement mu = u * h[n - 3]; 418| 2.95k| for(size_t i = n - 2; i > 0; --i) { ------------------ | Branch (418:32): [True: 2.75k, False: 197] ------------------ 419| | // Conditional ok: loop iteration count is public 420| 2.75k| if(i != n - 2) { ------------------ | Branch (420:16): [True: 2.56k, False: 197] ------------------ 421| 2.56k| mu *= h[i - 1]; 422| 2.56k| } 423| 2.75k| pts.push_back(rescale(chain[i], mu)); 424| 2.75k| } 425| | 426| | // Entry 0 is P itself with Z = 1, so it is scaled by Zt 427| 197| pts.push_back(rescale(chain[0], zt)); 428| | 429| 197| std::reverse(pts.begin(), pts.end()); 430| | 431| 197| return finish(std::move(pts), zt, a); 432| 197| } pcurves_secp521r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp521r15CurveEE7rescaleERKNS_20ProjectiveCurvePointINS_6IntModINS3_7P521RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EERKSE_: 377| 3.15k| static AffinePoint rescale(const ProjectivePoint& pt, const FieldElement& f) { 378| 3.15k| const auto f2 = f.square(); 379| 3.15k| const auto f3 = f2 * f; 380| 3.15k| return AffinePoint(pt.x() * f2, pt.y() * f3); 381| 3.15k| } pcurves_secp521r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp521r15CurveEE6finishENSt3__16vectorINS_16AffineCurvePointINS_6IntModINS3_7P521RepINS_13EllipticCurveINS3_6ParamsESA_E11FieldParamsEEEEEEENS6_9allocatorISH_EEEERKSG_SM_: 383| 197| static Table finish(std::vector pts, const FieldElement& zt, const FieldElement& a) { 384| 197| const auto zt2 = zt.square(); 385| 197| return Table{std::move(pts), zt, a * zt2.square()}; 386| 197| } pcurves_secp521r1.cpp:_ZN5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp521r15CurveEEC2ENS5_5TableE: 374| 197| explicit SharedZPointTable(Table t) : m_table(std::move(t.pts)), m_z(t.z), m_a(t.a) {} pcurves_secp521r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp521r15CurveEE9ct_selectEm: 355| 22.8k| AffinePoint ct_select(size_t idx) const { return AffinePoint::ct_select(m_table, idx); } pcurves_secp521r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp521r15CurveEE1aEv: 365| 45.3k| const FieldElement& a() const { return m_a; } pcurves_secp521r1.cpp:_ZNK5Botan17SharedZPointTableINS_6PCurve12_GLOBAL__N_19secp521r15CurveEE1zEv: 360| 197| const FieldElement& z() const { return m_z; } _ZN5Botan10get_uint32ITkNS_8WordTypeEmEEjPKT_m: 33| 40.3M|constexpr uint32_t get_uint32(const W xw[], size_t i) { 34| 40.3M| static_assert(WordInfo::bits == 32 || WordInfo::bits == 64); 35| | 36| | if constexpr(WordInfo::bits == 32) { 37| | return xw[i]; 38| 40.3M| } else { 39| 40.3M| return static_cast(xw[i / 2] >> ((i % 2) * 32)); 40| 40.3M| } 41| 40.3M|} _ZN5Botan12SolinasAccumImLm6EEC2ERNSt3__15arrayImLm6EEE: 50| 1.68M| constexpr explicit SolinasAccum(std::array& r) : m_r(r) {} _ZN5Botan12SolinasAccumImLm6EE5accumEl: 52| 20.1M| constexpr void accum(int64_t v) { 53| 20.1M| BOTAN_DEBUG_ASSERT(m_idx < N32); ------------------ | | 137| 20.1M| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 20.1M| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 20.1M] | | ------------------ ------------------ 54| | 55| 20.1M| m_S += v; 56| 20.1M| const uint32_t r = static_cast(m_S); 57| 20.1M| m_S >>= 32; 58| | 59| | if constexpr(WordInfo::bits == 32) { 60| | m_r[m_idx] = r; 61| 20.1M| } else { 62| 20.1M| m_r[m_idx / 2] |= static_cast(r) << (32 * (m_idx % 2)); 63| 20.1M| } 64| | 65| 20.1M| m_idx += 1; 66| 20.1M| } _ZN5Botan12SolinasAccumImLm6EE11final_carryEl: 68| 1.68M| constexpr W final_carry(int64_t C) { 69| 1.68M| m_S += C; 70| 1.68M| BOTAN_DEBUG_ASSERT(m_S >= 0); ------------------ | | 137| 1.68M| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.68M| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.68M] | | ------------------ ------------------ 71| 1.68M| return static_cast(m_S); 72| 1.68M| } _ZN5Botan20solinas_correct_redcILm6ETkNS_8WordTypeEmEEvRNSt3__15arrayIT0_XT_EEERKS4_S7_: 84| 1.68M|constexpr inline void solinas_correct_redc(std::array& r, const std::array& P, const std::array& C) { 85| 1.68M| W borrow = 0; 86| 11.7M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (86:22): [True: 10.0M, False: 1.68M] ------------------ 87| 10.0M| r[i] = word_sub(r[i], C[i], &borrow); 88| 10.0M| } 89| | 90| | // borrow is either 0 or 1, perfect for setting up a mask without extra work 91| 1.68M| const W mask = CT::value_barrier(0 - borrow); 92| | 93| 1.68M| W carry = 0; 94| | 95| 11.7M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (95:22): [True: 10.0M, False: 1.68M] ------------------ 96| 10.0M| r[i] = word_add(r[i], P[i] & mask, &carry); 97| 10.0M| } 98| 1.68M|} _ZN5Botan10monty_redcITkNS_8WordTypeEmLm4EEENSt3__15arrayIT_XT0_EEERKNS2_IS3_XmlLi2ET0_EEERKS4_S3_: 110| 1.74M| -> std::array { 111| 1.74M| static_assert(N >= 1); 112| | 113| 1.74M| std::array ws; // NOLINT(*-member-init) 114| 1.74M| std::array r; // NOLINT(*-member-init) 115| | 116| | // Conditional ok: the parameter size is public 117| 1.74M| if(!std::is_constant_evaluated()) { ------------------ | Branch (117:7): [True: 1.74M, Folded] ------------------ 118| | // This range ensures we cover fields of 256, 384 and 512 bits for both 32 and 64 bit words 119| 1.74M| if constexpr(N == 4) { 120| 1.74M| bigint_monty_redc_4(r.data(), z.data(), p.data(), p_dash, ws.data()); 121| 1.74M| 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| | } 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| 1.74M| } 136| | 137| 0| word3 accum; 138| | 139| 1.74M| accum.add(z[0]); 140| | 141| 1.74M| ws[0] = accum.monty_step(p[0], p_dash); 142| | 143| 1.74M| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (143:22): [True: 0, False: 1.74M] ------------------ 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| 1.74M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (153:22): [True: 0, False: 1.74M] ------------------ 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| 1.74M| accum.add(z[2 * N - 1]); 164| | 165| 1.74M| ws[N - 1] = accum.extract(); 166| | // w1 is the final part, which is not stored in the workspace 167| 1.74M| const W w1 = accum.extract(); 168| | 169| 1.74M| bigint_monty_maybe_sub(r.data(), w1, ws.data(), p.data()); 170| | 171| 1.74M| return r; 172| 1.74M|} _ZN5Botan10monty_redcITkNS_8WordTypeEmLm6EEENSt3__15arrayIT_XT0_EEERKNS2_IS3_XmlLi2ET0_EEERKS4_S3_: 110| 1.51M| -> std::array { 111| 1.51M| static_assert(N >= 1); 112| | 113| 1.51M| std::array ws; // NOLINT(*-member-init) 114| 1.51M| std::array r; // NOLINT(*-member-init) 115| | 116| | // Conditional ok: the parameter size is public 117| 1.51M| if(!std::is_constant_evaluated()) { ------------------ | Branch (117:7): [True: 1.51M, 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| 1.51M| } else if constexpr(N == 6) { 123| 1.51M| bigint_monty_redc_6(r.data(), z.data(), p.data(), p_dash, ws.data()); 124| 1.51M| 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| 1.51M| } 136| | 137| 0| word3 accum; 138| | 139| 1.51M| accum.add(z[0]); 140| | 141| 1.51M| ws[0] = accum.monty_step(p[0], p_dash); 142| | 143| 1.51M| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (143:22): [True: 0, False: 1.51M] ------------------ 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| 1.51M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (153:22): [True: 0, False: 1.51M] ------------------ 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| 1.51M| accum.add(z[2 * N - 1]); 164| | 165| 1.51M| ws[N - 1] = accum.extract(); 166| | // w1 is the final part, which is not stored in the workspace 167| 1.51M| const W w1 = accum.extract(); 168| | 169| 1.51M| bigint_monty_maybe_sub(r.data(), w1, ws.data(), p.data()); 170| | 171| 1.51M| return r; 172| 1.51M|} _ZN5Botan10monty_redcITkNS_8WordTypeEmLm8EEENSt3__15arrayIT_XT0_EEERKNS2_IS3_XmlLi2ET0_EEERKS4_S3_: 110| 2.32M| -> std::array { 111| 2.32M| static_assert(N >= 1); 112| | 113| 2.32M| std::array ws; // NOLINT(*-member-init) 114| 2.32M| std::array r; // NOLINT(*-member-init) 115| | 116| | // Conditional ok: the parameter size is public 117| 2.32M| if(!std::is_constant_evaluated()) { ------------------ | Branch (117:7): [True: 2.32M, 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| 2.32M| } else if constexpr(N == 8) { 126| 2.32M| bigint_monty_redc_8(r.data(), z.data(), p.data(), p_dash, ws.data()); 127| 2.32M| 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| 2.32M| } 136| | 137| 0| word3 accum; 138| | 139| 2.32M| accum.add(z[0]); 140| | 141| 2.32M| ws[0] = accum.monty_step(p[0], p_dash); 142| | 143| 2.32M| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (143:22): [True: 0, False: 2.32M] ------------------ 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| 2.32M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (153:22): [True: 0, False: 2.32M] ------------------ 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| 2.32M| accum.add(z[2 * N - 1]); 164| | 165| 2.32M| ws[N - 1] = accum.extract(); 166| | // w1 is the final part, which is not stored in the workspace 167| 2.32M| const W w1 = accum.extract(); 168| | 169| 2.32M| bigint_monty_maybe_sub(r.data(), w1, ws.data(), p.data()); 170| | 171| 2.32M| return r; 172| 2.32M|} _ZN5Botan10monty_redcITkNS_8WordTypeEmLm9EEENSt3__15arrayIT_XT0_EEERKNS2_IS3_XmlLi2ET0_EEERKS4_S3_: 110| 1.16k| -> std::array { 111| 1.16k| static_assert(N >= 1); 112| | 113| 1.16k| std::array ws; // NOLINT(*-member-init) 114| 1.16k| std::array r; // NOLINT(*-member-init) 115| | 116| | // Conditional ok: the parameter size is public 117| 1.16k| if(!std::is_constant_evaluated()) { ------------------ | Branch (117:7): [True: 1.16k, 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| 1.16k| } else if constexpr(N == 16) { 132| 1.16k| bigint_monty_redc_16(r.data(), z.data(), p.data(), p_dash, ws.data()); 133| 1.16k| return r; 134| 1.16k| } 135| 1.16k| } 136| | 137| 1.16k| word3 accum; 138| | 139| 1.16k| accum.add(z[0]); 140| | 141| 1.16k| ws[0] = accum.monty_step(p[0], p_dash); 142| | 143| 10.4k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (143:22): [True: 9.32k, False: 1.16k] ------------------ 144| 51.3k| for(size_t j = 0; j < i; ++j) { ------------------ | Branch (144:25): [True: 41.9k, False: 9.32k] ------------------ 145| 41.9k| accum.mul(ws[j], p[i - j]); 146| 41.9k| } 147| | 148| 9.32k| accum.add(z[i]); 149| | 150| 9.32k| ws[i] = accum.monty_step(p[0], p_dash); 151| 9.32k| } 152| | 153| 10.4k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (153:22): [True: 9.32k, False: 1.16k] ------------------ 154| 51.3k| for(size_t j = i + 1; j != N; ++j) { ------------------ | Branch (154:29): [True: 41.9k, False: 9.32k] ------------------ 155| 41.9k| accum.mul(ws[j], p[N + i - j]); 156| 41.9k| } 157| | 158| 9.32k| accum.add(z[N + i]); 159| | 160| 9.32k| ws[i] = accum.extract(); 161| 9.32k| } 162| | 163| 1.16k| accum.add(z[2 * N - 1]); 164| | 165| 1.16k| ws[N - 1] = accum.extract(); 166| | // w1 is the final part, which is not stored in the workspace 167| 1.16k| const W w1 = accum.extract(); 168| | 169| 1.16k| bigint_monty_maybe_sub(r.data(), w1, ws.data(), p.data()); 170| | 171| 1.16k| return r; 172| 1.16k|} pcurves_brainpool256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE8instanceEv: 341| 8.47k| static std::shared_ptr instance() { 342| 8.47k| static const auto g_curve = std::make_shared>(); 343| 8.47k| return g_curve; 344| 8.47k| } pcurves_brainpool256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEEC2Ev: 339| 1| PrimeOrderCurveImpl() : m_mul_by_g(C::G) {} pcurves_brainpool256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE19field_element_bytesEv: 36| 4.27k| size_t field_element_bytes() const override { return C::FieldElement::BYTES; } pcurves_brainpool256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE8mul_by_gERKNS0_15PrimeOrderCurve6ScalarERNS_21RandomNumberGeneratorE: 38| 543| ProjectivePoint mul_by_g(const Scalar& scalar, RandomNumberGenerator& rng) const override { 39| 543| return stash(m_mul_by_g.mul(from_stash(scalar), rng)); 40| 543| } pcurves_brainpool256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE5stashERKNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EE: 373| 543| static ProjectivePoint stash(const typename C::ProjectivePoint& pt) { 374| 543| const auto x_w = pt.x().template stash_value(); 375| 543| const auto y_w = pt.y().template stash_value(); 376| 543| const auto z_w = pt.z().template stash_value(); 377| 543| return ProjectivePoint::_create(instance(), x_w, y_w, z_w); 378| 543| } pcurves_brainpool256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE10from_stashERKNS0_15PrimeOrderCurve6ScalarE: 351| 1.92k| static typename C::Scalar from_stash(const Scalar& s) { 352| 1.92k| if(s._curve() != instance()) { ------------------ | Branch (352:13): [True: 0, False: 1.92k] ------------------ 353| 0| throw Invalid_Argument("Curve mismatch"); 354| 0| } 355| 1.92k| return C::Scalar::from_stash(s._value()); 356| 1.92k| } pcurves_brainpool256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE5stashERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES7_E12ScalarParamsEEEEE: 347| 543| static Scalar stash(const typename C::Scalar& s) { 348| 543| return Scalar::_create(instance(), s.template stash_value()); 349| 543| } pcurves_brainpool256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE10from_stashERKNS0_15PrimeOrderCurve11AffinePointE: 364| 3.77k| static typename C::AffinePoint from_stash(const AffinePoint& pt) { 365| 3.77k| if(pt._curve() != instance()) { ------------------ | Branch (365:13): [True: 0, False: 3.77k] ------------------ 366| 0| throw Invalid_Argument("Curve mismatch"); 367| 0| } 368| 3.77k| const auto x = C::FieldElement::from_stash(pt._x()); 369| 3.77k| const auto y = C::FieldElement::from_stash(pt._y()); 370| 3.77k| return typename C::AffinePoint(x, y); 371| 3.77k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE10mul_x_onlyERKNS0_15PrimeOrderCurve11AffinePointERKNS6_6ScalarERNS_21RandomNumberGeneratorE: 48| 299| RandomNumberGenerator& rng) const override { 49| 299| const auto result = varpoint_mul(from_stash(pt), from_stash(scalar), rng); 50| 299| BOTAN_STATE_CHECK(!result.is_identity().as_bool()); ------------------ | | 51| 299| do { \ | | 52| 299| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 299| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 299] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 299| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 299] | | ------------------ ------------------ 51| 299| const auto pt_x = to_affine_x(result); 52| 299| secure_vector x_bytes(C::FieldElement::BYTES); 53| 299| pt_x.serialize_to(std::span{x_bytes}); 54| 299| return x_bytes; 55| 299| } pcurves_brainpool256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE5stashERKNS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 358| 1.14k| static AffinePoint stash(const typename C::AffinePoint& pt) { 359| 1.14k| const auto x_w = pt.x().template stash_value(); 360| 1.14k| const auto y_w = pt.y().template stash_value(); 361| 1.14k| return AffinePoint::_create(instance(), x_w, y_w); 362| 1.14k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE30deserialize_point_uncompressedENSt3__14spanIKhLm18446744073709551615EEE: 241| 359| std::optional deserialize_point_uncompressed(std::span bytes) const override { 242| 359| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 243| 359| constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1; 244| | 245| 359| if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) { ------------------ | Branch (245:13): [True: 359, False: 0] | Branch (245:50): [True: 359, False: 0] ------------------ 246| 359| const auto encoded_point = bytes.subspan(1); 247| 359| auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes)); 248| 359| auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes)); 249| | 250| 359| if(x && y) { ------------------ | Branch (250:16): [True: 356, False: 3] | Branch (250:21): [True: 355, False: 1] ------------------ 251| | // Check that y^2 = x^3 + ax + b 252| 355| const auto lhs = (*y).square(); 253| 355| const auto rhs = C::x3_ax_b(*x); 254| 355| const auto valid = (lhs == rhs); 255| 355| if(valid.as_bool()) { ------------------ | Branch (255:19): [True: 299, False: 56] ------------------ 256| 299| return stash(typename C::AffinePoint(*x, *y)); 257| 299| } 258| 355| } 259| 359| } 260| | 261| 60| return {}; 262| 359| } pcurves_brainpool256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE28deserialize_point_compressedENSt3__14spanIKhLm18446744073709551615EEE: 264| 361| std::optional deserialize_point_compressed(std::span bytes) const override { 265| 361| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 266| 361| constexpr size_t CompressedBytes = C::FieldElement::BYTES + 1; 267| | 268| 361| if(bytes.size() == CompressedBytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) { ------------------ | Branch (268:13): [True: 361, False: 0] | Branch (268:49): [True: 97, False: 264] | Branch (268:69): [True: 264, False: 0] ------------------ 269| 361| const CT::Choice y_is_even = CT::Mask::is_equal(bytes[0], 0x02).as_choice(); 270| | 271| 361| if(auto x = C::FieldElement::deserialize(bytes.subspan(1, FieldElementBytes))) { ------------------ | Branch (271:21): [True: 360, False: 1] ------------------ 272| 360| if(auto y = sqrt_field_element(C::x3_ax_b(*x)).as_optional_vartime()) { ------------------ | Branch (272:24): [True: 299, False: 61] ------------------ 273| 299| return stash(typename C::AffinePoint(*x, y->correct_sign(y_is_even))); 274| 299| } 275| 360| } 276| 361| } 277| | 278| 62| return {}; 279| 361| } pcurves_brainpool256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE15point_to_affineERKNS0_15PrimeOrderCurve15ProjectivePointE: 189| 543| AffinePoint point_to_affine(const ProjectivePoint& pt) const override { 190| 543| const auto affine = to_affine(from_stash(pt)); 191| | 192| 543| const auto y2 = affine.y().square(); 193| 543| const auto x3_ax_b = C::x3_ax_b(affine.x()); 194| 543| const auto valid_point = affine.is_identity() || (y2 == x3_ax_b); 195| | 196| 543| BOTAN_ASSERT(valid_point.as_bool(), "Computed point is on the curve"); ------------------ | | 71| 543| do { \ | | 72| 543| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 543| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 543] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 543| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 543] | | ------------------ ------------------ 197| | 198| 543| return stash(affine); 199| 543| } pcurves_brainpool256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE10from_stashERKNS0_15PrimeOrderCurve15ProjectivePointE: 380| 543| static typename C::ProjectivePoint from_stash(const ProjectivePoint& pt) { 381| 543| if(pt._curve() != instance()) { ------------------ | Branch (381:13): [True: 0, False: 543] ------------------ 382| 0| throw Invalid_Argument("Curve mismatch"); 383| 0| } 384| 543| const auto x = C::FieldElement::from_stash(pt._x()); 385| 543| const auto y = C::FieldElement::from_stash(pt._y()); 386| 543| const auto z = C::FieldElement::from_stash(pt._z()); 387| 543| return typename C::ProjectivePoint(x, y, z); 388| 543| } pcurves_brainpool256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE24affine_point_is_identityERKNS0_15PrimeOrderCurve11AffinePointE: 207| 1.73k| bool affine_point_is_identity(const AffinePoint& pt) const override { 208| 1.73k| return from_stash(pt).is_identity().as_bool(); 209| 1.73k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE15serialize_pointENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve11AffinePointE: 211| 1.73k| void serialize_point(std::span bytes, const AffinePoint& pt) const override { 212| 1.73k| BOTAN_ARG_CHECK(bytes.size() == C::AffinePoint::BYTES, "Invalid length for serialize_point"); ------------------ | | 35| 1.73k| do { \ | | 36| 1.73k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.73k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.73k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.73k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.73k] | | ------------------ ------------------ 213| 1.73k| from_stash(pt).serialize_to(bytes.subspan<0, C::AffinePoint::BYTES>()); 214| 1.73k| } pcurves_brainpool256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE16serialize_scalarENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve6ScalarE: 216| 543| void serialize_scalar(std::span bytes, const Scalar& scalar) const override { 217| 543| BOTAN_ARG_CHECK(bytes.size() == C::Scalar::BYTES, "Invalid length to serialize_scalar"); ------------------ | | 35| 543| do { \ | | 36| 543| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 543| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 543] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 543| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 543] | | ------------------ ------------------ 218| 543| return from_stash(scalar).serialize_to(bytes.subspan<0, C::Scalar::BYTES>()); 219| 543| } pcurves_brainpool256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE14scalar_is_zeroERKNS0_15PrimeOrderCurve6ScalarE: 329| 543| bool scalar_is_zero(const Scalar& s) const override { return from_stash(s).is_zero().as_bool(); } pcurves_brainpool256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool256r15CurveEE13random_scalarERNS_21RandomNumberGeneratorE: 337| 543| Scalar random_scalar(RandomNumberGenerator& rng) const override { return stash(C::Scalar::random(rng)); } pcurves_brainpool384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE8instanceEv: 341| 5.17k| static std::shared_ptr instance() { 342| 5.17k| static const auto g_curve = std::make_shared>(); 343| 5.17k| return g_curve; 344| 5.17k| } pcurves_brainpool384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEEC2Ev: 339| 1| PrimeOrderCurveImpl() : m_mul_by_g(C::G) {} pcurves_brainpool384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE19field_element_bytesEv: 36| 2.58k| size_t field_element_bytes() const override { return C::FieldElement::BYTES; } pcurves_brainpool384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE8mul_by_gERKNS0_15PrimeOrderCurve6ScalarERNS_21RandomNumberGeneratorE: 38| 351| ProjectivePoint mul_by_g(const Scalar& scalar, RandomNumberGenerator& rng) const override { 39| 351| return stash(m_mul_by_g.mul(from_stash(scalar), rng)); 40| 351| } pcurves_brainpool384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE5stashERKNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EE: 373| 351| static ProjectivePoint stash(const typename C::ProjectivePoint& pt) { 374| 351| const auto x_w = pt.x().template stash_value(); 375| 351| const auto y_w = pt.y().template stash_value(); 376| 351| const auto z_w = pt.z().template stash_value(); 377| 351| return ProjectivePoint::_create(instance(), x_w, y_w, z_w); 378| 351| } pcurves_brainpool384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE10from_stashERKNS0_15PrimeOrderCurve6ScalarE: 351| 1.22k| static typename C::Scalar from_stash(const Scalar& s) { 352| 1.22k| if(s._curve() != instance()) { ------------------ | Branch (352:13): [True: 0, False: 1.22k] ------------------ 353| 0| throw Invalid_Argument("Curve mismatch"); 354| 0| } 355| 1.22k| return C::Scalar::from_stash(s._value()); 356| 1.22k| } pcurves_brainpool384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE5stashERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES7_E12ScalarParamsEEEEE: 347| 351| static Scalar stash(const typename C::Scalar& s) { 348| 351| return Scalar::_create(instance(), s.template stash_value()); 349| 351| } pcurves_brainpool384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE10from_stashERKNS0_15PrimeOrderCurve11AffinePointE: 364| 2.21k| static typename C::AffinePoint from_stash(const AffinePoint& pt) { 365| 2.21k| if(pt._curve() != instance()) { ------------------ | Branch (365:13): [True: 0, False: 2.21k] ------------------ 366| 0| throw Invalid_Argument("Curve mismatch"); 367| 0| } 368| 2.21k| const auto x = C::FieldElement::from_stash(pt._x()); 369| 2.21k| const auto y = C::FieldElement::from_stash(pt._y()); 370| 2.21k| return typename C::AffinePoint(x, y); 371| 2.21k| } pcurves_brainpool384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE10mul_x_onlyERKNS0_15PrimeOrderCurve11AffinePointERKNS6_6ScalarERNS_21RandomNumberGeneratorE: 48| 168| RandomNumberGenerator& rng) const override { 49| 168| const auto result = varpoint_mul(from_stash(pt), from_stash(scalar), rng); 50| 168| BOTAN_STATE_CHECK(!result.is_identity().as_bool()); ------------------ | | 51| 168| do { \ | | 52| 168| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 168| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 168] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 168| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 168] | | ------------------ ------------------ 51| 168| const auto pt_x = to_affine_x(result); 52| 168| secure_vector x_bytes(C::FieldElement::BYTES); 53| 168| pt_x.serialize_to(std::span{x_bytes}); 54| 168| return x_bytes; 55| 168| } pcurves_brainpool384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE5stashERKNS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 358| 687| static AffinePoint stash(const typename C::AffinePoint& pt) { 359| 687| const auto x_w = pt.x().template stash_value(); 360| 687| const auto y_w = pt.y().template stash_value(); 361| 687| return AffinePoint::_create(instance(), x_w, y_w); 362| 687| } pcurves_brainpool384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE30deserialize_point_uncompressedENSt3__14spanIKhLm18446744073709551615EEE: 241| 185| std::optional deserialize_point_uncompressed(std::span bytes) const override { 242| 185| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 243| 185| constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1; 244| | 245| 185| if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) { ------------------ | Branch (245:13): [True: 185, False: 0] | Branch (245:50): [True: 185, False: 0] ------------------ 246| 185| const auto encoded_point = bytes.subspan(1); 247| 185| auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes)); 248| 185| auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes)); 249| | 250| 185| if(x && y) { ------------------ | Branch (250:16): [True: 177, False: 8] | Branch (250:21): [True: 175, False: 2] ------------------ 251| | // Check that y^2 = x^3 + ax + b 252| 175| const auto lhs = (*y).square(); 253| 175| const auto rhs = C::x3_ax_b(*x); 254| 175| const auto valid = (lhs == rhs); 255| 175| if(valid.as_bool()) { ------------------ | Branch (255:19): [True: 168, False: 7] ------------------ 256| 168| return stash(typename C::AffinePoint(*x, *y)); 257| 168| } 258| 175| } 259| 185| } 260| | 261| 17| return {}; 262| 185| } pcurves_brainpool384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE28deserialize_point_compressedENSt3__14spanIKhLm18446744073709551615EEE: 264| 223| std::optional deserialize_point_compressed(std::span bytes) const override { 265| 223| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 266| 223| constexpr size_t CompressedBytes = C::FieldElement::BYTES + 1; 267| | 268| 223| if(bytes.size() == CompressedBytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) { ------------------ | Branch (268:13): [True: 223, False: 0] | Branch (268:49): [True: 193, False: 30] | Branch (268:69): [True: 30, False: 0] ------------------ 269| 223| const CT::Choice y_is_even = CT::Mask::is_equal(bytes[0], 0x02).as_choice(); 270| | 271| 223| if(auto x = C::FieldElement::deserialize(bytes.subspan(1, FieldElementBytes))) { ------------------ | Branch (271:21): [True: 222, False: 1] ------------------ 272| 222| if(auto y = sqrt_field_element(C::x3_ax_b(*x)).as_optional_vartime()) { ------------------ | Branch (272:24): [True: 168, False: 54] ------------------ 273| 168| return stash(typename C::AffinePoint(*x, y->correct_sign(y_is_even))); 274| 168| } 275| 222| } 276| 223| } 277| | 278| 55| return {}; 279| 223| } pcurves_brainpool384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE15point_to_affineERKNS0_15PrimeOrderCurve15ProjectivePointE: 189| 351| AffinePoint point_to_affine(const ProjectivePoint& pt) const override { 190| 351| const auto affine = to_affine(from_stash(pt)); 191| | 192| 351| const auto y2 = affine.y().square(); 193| 351| const auto x3_ax_b = C::x3_ax_b(affine.x()); 194| 351| const auto valid_point = affine.is_identity() || (y2 == x3_ax_b); 195| | 196| 351| BOTAN_ASSERT(valid_point.as_bool(), "Computed point is on the curve"); ------------------ | | 71| 351| do { \ | | 72| 351| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 351| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 351] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 351| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 351] | | ------------------ ------------------ 197| | 198| 351| return stash(affine); 199| 351| } pcurves_brainpool384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE10from_stashERKNS0_15PrimeOrderCurve15ProjectivePointE: 380| 351| static typename C::ProjectivePoint from_stash(const ProjectivePoint& pt) { 381| 351| if(pt._curve() != instance()) { ------------------ | Branch (381:13): [True: 0, False: 351] ------------------ 382| 0| throw Invalid_Argument("Curve mismatch"); 383| 0| } 384| 351| const auto x = C::FieldElement::from_stash(pt._x()); 385| 351| const auto y = C::FieldElement::from_stash(pt._y()); 386| 351| const auto z = C::FieldElement::from_stash(pt._z()); 387| 351| return typename C::ProjectivePoint(x, y, z); 388| 351| } pcurves_brainpool384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE24affine_point_is_identityERKNS0_15PrimeOrderCurve11AffinePointE: 207| 1.02k| bool affine_point_is_identity(const AffinePoint& pt) const override { 208| 1.02k| return from_stash(pt).is_identity().as_bool(); 209| 1.02k| } pcurves_brainpool384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE15serialize_pointENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve11AffinePointE: 211| 1.02k| void serialize_point(std::span bytes, const AffinePoint& pt) const override { 212| 1.02k| BOTAN_ARG_CHECK(bytes.size() == C::AffinePoint::BYTES, "Invalid length for serialize_point"); ------------------ | | 35| 1.02k| do { \ | | 36| 1.02k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.02k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.02k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.02k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.02k] | | ------------------ ------------------ 213| 1.02k| from_stash(pt).serialize_to(bytes.subspan<0, C::AffinePoint::BYTES>()); 214| 1.02k| } pcurves_brainpool384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE16serialize_scalarENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve6ScalarE: 216| 351| void serialize_scalar(std::span bytes, const Scalar& scalar) const override { 217| 351| BOTAN_ARG_CHECK(bytes.size() == C::Scalar::BYTES, "Invalid length to serialize_scalar"); ------------------ | | 35| 351| do { \ | | 36| 351| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 351| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 351] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 351| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 351] | | ------------------ ------------------ 218| 351| return from_stash(scalar).serialize_to(bytes.subspan<0, C::Scalar::BYTES>()); 219| 351| } pcurves_brainpool384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE14scalar_is_zeroERKNS0_15PrimeOrderCurve6ScalarE: 329| 351| bool scalar_is_zero(const Scalar& s) const override { return from_stash(s).is_zero().as_bool(); } pcurves_brainpool384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool384r15CurveEE13random_scalarERNS_21RandomNumberGeneratorE: 337| 351| Scalar random_scalar(RandomNumberGenerator& rng) const override { return stash(C::Scalar::random(rng)); } pcurves_brainpool512r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE8instanceEv: 341| 5.66k| static std::shared_ptr instance() { 342| 5.66k| static const auto g_curve = std::make_shared>(); 343| 5.66k| return g_curve; 344| 5.66k| } pcurves_brainpool512r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEEC2Ev: 339| 1| PrimeOrderCurveImpl() : m_mul_by_g(C::G) {} pcurves_brainpool512r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE19field_element_bytesEv: 36| 2.87k| size_t field_element_bytes() const override { return C::FieldElement::BYTES; } pcurves_brainpool512r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE8mul_by_gERKNS0_15PrimeOrderCurve6ScalarERNS_21RandomNumberGeneratorE: 38| 345| ProjectivePoint mul_by_g(const Scalar& scalar, RandomNumberGenerator& rng) const override { 39| 345| return stash(m_mul_by_g.mul(from_stash(scalar), rng)); 40| 345| } pcurves_brainpool512r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE5stashERKNS_20ProjectiveCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EE: 373| 345| static ProjectivePoint stash(const typename C::ProjectivePoint& pt) { 374| 345| const auto x_w = pt.x().template stash_value(); 375| 345| const auto y_w = pt.y().template stash_value(); 376| 345| const auto z_w = pt.z().template stash_value(); 377| 345| return ProjectivePoint::_create(instance(), x_w, y_w, z_w); 378| 345| } pcurves_brainpool512r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE10from_stashERKNS0_15PrimeOrderCurve6ScalarE: 351| 1.24k| static typename C::Scalar from_stash(const Scalar& s) { 352| 1.24k| if(s._curve() != instance()) { ------------------ | Branch (352:13): [True: 0, False: 1.24k] ------------------ 353| 0| throw Invalid_Argument("Curve mismatch"); 354| 0| } 355| 1.24k| return C::Scalar::from_stash(s._value()); 356| 1.24k| } pcurves_brainpool512r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE5stashERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES7_E12ScalarParamsEEEEE: 347| 345| static Scalar stash(const typename C::Scalar& s) { 348| 345| return Scalar::_create(instance(), s.template stash_value()); 349| 345| } pcurves_brainpool512r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE10from_stashERKNS0_15PrimeOrderCurve11AffinePointE: 364| 2.60k| static typename C::AffinePoint from_stash(const AffinePoint& pt) { 365| 2.60k| if(pt._curve() != instance()) { ------------------ | Branch (365:13): [True: 0, False: 2.60k] ------------------ 366| 0| throw Invalid_Argument("Curve mismatch"); 367| 0| } 368| 2.60k| const auto x = C::FieldElement::from_stash(pt._x()); 369| 2.60k| const auto y = C::FieldElement::from_stash(pt._y()); 370| 2.60k| return typename C::AffinePoint(x, y); 371| 2.60k| } pcurves_brainpool512r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE10mul_x_onlyERKNS0_15PrimeOrderCurve11AffinePointERKNS6_6ScalarERNS_21RandomNumberGeneratorE: 48| 213| RandomNumberGenerator& rng) const override { 49| 213| const auto result = varpoint_mul(from_stash(pt), from_stash(scalar), rng); 50| 213| BOTAN_STATE_CHECK(!result.is_identity().as_bool()); ------------------ | | 51| 213| do { \ | | 52| 213| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 213| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 213] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 213| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 213] | | ------------------ ------------------ 51| 213| const auto pt_x = to_affine_x(result); 52| 213| secure_vector x_bytes(C::FieldElement::BYTES); 53| 213| pt_x.serialize_to(std::span{x_bytes}); 54| 213| return x_bytes; 55| 213| } pcurves_brainpool512r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE5stashERKNS_16AffineCurvePointINS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 358| 771| static AffinePoint stash(const typename C::AffinePoint& pt) { 359| 771| const auto x_w = pt.x().template stash_value(); 360| 771| const auto y_w = pt.y().template stash_value(); 361| 771| return AffinePoint::_create(instance(), x_w, y_w); 362| 771| } pcurves_brainpool512r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE30deserialize_point_uncompressedENSt3__14spanIKhLm18446744073709551615EEE: 241| 230| std::optional deserialize_point_uncompressed(std::span bytes) const override { 242| 230| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 243| 230| constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1; 244| | 245| 230| if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) { ------------------ | Branch (245:13): [True: 230, False: 0] | Branch (245:50): [True: 230, False: 0] ------------------ 246| 230| const auto encoded_point = bytes.subspan(1); 247| 230| auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes)); 248| 230| auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes)); 249| | 250| 230| if(x && y) { ------------------ | Branch (250:16): [True: 229, False: 1] | Branch (250:21): [True: 219, False: 10] ------------------ 251| | // Check that y^2 = x^3 + ax + b 252| 219| const auto lhs = (*y).square(); 253| 219| const auto rhs = C::x3_ax_b(*x); 254| 219| const auto valid = (lhs == rhs); 255| 219| if(valid.as_bool()) { ------------------ | Branch (255:19): [True: 213, False: 6] ------------------ 256| 213| return stash(typename C::AffinePoint(*x, *y)); 257| 213| } 258| 219| } 259| 230| } 260| | 261| 17| return {}; 262| 230| } pcurves_brainpool512r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE28deserialize_point_compressedENSt3__14spanIKhLm18446744073709551615EEE: 264| 261| std::optional deserialize_point_compressed(std::span bytes) const override { 265| 261| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 266| 261| constexpr size_t CompressedBytes = C::FieldElement::BYTES + 1; 267| | 268| 261| if(bytes.size() == CompressedBytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) { ------------------ | Branch (268:13): [True: 261, False: 0] | Branch (268:49): [True: 234, False: 27] | Branch (268:69): [True: 27, False: 0] ------------------ 269| 261| const CT::Choice y_is_even = CT::Mask::is_equal(bytes[0], 0x02).as_choice(); 270| | 271| 261| if(auto x = C::FieldElement::deserialize(bytes.subspan(1, FieldElementBytes))) { ------------------ | Branch (271:21): [True: 259, False: 2] ------------------ 272| 259| if(auto y = sqrt_field_element(C::x3_ax_b(*x)).as_optional_vartime()) { ------------------ | Branch (272:24): [True: 213, False: 46] ------------------ 273| 213| return stash(typename C::AffinePoint(*x, y->correct_sign(y_is_even))); 274| 213| } 275| 259| } 276| 261| } 277| | 278| 48| return {}; 279| 261| } pcurves_brainpool512r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE15point_to_affineERKNS0_15PrimeOrderCurve15ProjectivePointE: 189| 345| AffinePoint point_to_affine(const ProjectivePoint& pt) const override { 190| 345| const auto affine = to_affine(from_stash(pt)); 191| | 192| 345| const auto y2 = affine.y().square(); 193| 345| const auto x3_ax_b = C::x3_ax_b(affine.x()); 194| 345| const auto valid_point = affine.is_identity() || (y2 == x3_ax_b); 195| | 196| 345| BOTAN_ASSERT(valid_point.as_bool(), "Computed point is on the curve"); ------------------ | | 71| 345| do { \ | | 72| 345| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 345| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 345] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 345| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 345] | | ------------------ ------------------ 197| | 198| 345| return stash(affine); 199| 345| } pcurves_brainpool512r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE10from_stashERKNS0_15PrimeOrderCurve15ProjectivePointE: 380| 345| static typename C::ProjectivePoint from_stash(const ProjectivePoint& pt) { 381| 345| if(pt._curve() != instance()) { ------------------ | Branch (381:13): [True: 0, False: 345] ------------------ 382| 0| throw Invalid_Argument("Curve mismatch"); 383| 0| } 384| 345| const auto x = C::FieldElement::from_stash(pt._x()); 385| 345| const auto y = C::FieldElement::from_stash(pt._y()); 386| 345| const auto z = C::FieldElement::from_stash(pt._z()); 387| 345| return typename C::ProjectivePoint(x, y, z); 388| 345| } pcurves_brainpool512r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE24affine_point_is_identityERKNS0_15PrimeOrderCurve11AffinePointE: 207| 1.19k| bool affine_point_is_identity(const AffinePoint& pt) const override { 208| 1.19k| return from_stash(pt).is_identity().as_bool(); 209| 1.19k| } pcurves_brainpool512r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE15serialize_pointENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve11AffinePointE: 211| 1.19k| void serialize_point(std::span bytes, const AffinePoint& pt) const override { 212| 1.19k| BOTAN_ARG_CHECK(bytes.size() == C::AffinePoint::BYTES, "Invalid length for serialize_point"); ------------------ | | 35| 1.19k| do { \ | | 36| 1.19k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.19k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.19k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.19k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.19k] | | ------------------ ------------------ 213| 1.19k| from_stash(pt).serialize_to(bytes.subspan<0, C::AffinePoint::BYTES>()); 214| 1.19k| } pcurves_brainpool512r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE16serialize_scalarENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve6ScalarE: 216| 345| void serialize_scalar(std::span bytes, const Scalar& scalar) const override { 217| 345| BOTAN_ARG_CHECK(bytes.size() == C::Scalar::BYTES, "Invalid length to serialize_scalar"); ------------------ | | 35| 345| do { \ | | 36| 345| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 345| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 345] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 345| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 345] | | ------------------ ------------------ 218| 345| return from_stash(scalar).serialize_to(bytes.subspan<0, C::Scalar::BYTES>()); 219| 345| } pcurves_brainpool512r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE14scalar_is_zeroERKNS0_15PrimeOrderCurve6ScalarE: 329| 345| bool scalar_is_zero(const Scalar& s) const override { return from_stash(s).is_zero().as_bool(); } pcurves_brainpool512r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_114brainpool512r15CurveEE13random_scalarERNS_21RandomNumberGeneratorE: 337| 345| Scalar random_scalar(RandomNumberGenerator& rng) const override { return stash(C::Scalar::random(rng)); } pcurves_secp256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE8instanceEv: 341| 83.5k| static std::shared_ptr instance() { 342| 83.5k| static const auto g_curve = std::make_shared>(); 343| 83.5k| return g_curve; 344| 83.5k| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEEC2Ev: 339| 1| PrimeOrderCurveImpl() : m_mul_by_g(C::G) {} pcurves_secp256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE19field_element_bytesEv: 36| 54.3k| size_t field_element_bytes() const override { return C::FieldElement::BYTES; } pcurves_secp256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE8mul_by_gERKNS0_15PrimeOrderCurve6ScalarERNS_21RandomNumberGeneratorE: 38| 6.75k| ProjectivePoint mul_by_g(const Scalar& scalar, RandomNumberGenerator& rng) const override { 39| 6.75k| return stash(m_mul_by_g.mul(from_stash(scalar), rng)); 40| 6.75k| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE5stashERKNS_20ProjectiveCurvePointINS_6IntModINS2_22Secp256r1MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EE: 373| 6.75k| static ProjectivePoint stash(const typename C::ProjectivePoint& pt) { 374| 6.75k| const auto x_w = pt.x().template stash_value(); 375| 6.75k| const auto y_w = pt.y().template stash_value(); 376| 6.75k| const auto z_w = pt.z().template stash_value(); 377| 6.75k| return ProjectivePoint::_create(instance(), x_w, y_w, z_w); 378| 6.75k| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE10from_stashERKNS0_15PrimeOrderCurve6ScalarE: 351| 20.5k| static typename C::Scalar from_stash(const Scalar& s) { 352| 20.5k| if(s._curve() != instance()) { ------------------ | Branch (352:13): [True: 0, False: 20.5k] ------------------ 353| 0| throw Invalid_Argument("Curve mismatch"); 354| 0| } 355| 20.5k| return C::Scalar::from_stash(s._value()); 356| 20.5k| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE5stashERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_22Secp256r1MontgomeryRepEE12ScalarParamsEEEEE: 347| 6.75k| static Scalar stash(const typename C::Scalar& s) { 348| 6.75k| return Scalar::_create(instance(), s.template stash_value()); 349| 6.75k| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE10from_stashERKNS0_15PrimeOrderCurve11AffinePointE: 364| 28.9k| static typename C::AffinePoint from_stash(const AffinePoint& pt) { 365| 28.9k| if(pt._curve() != instance()) { ------------------ | Branch (365:13): [True: 0, False: 28.9k] ------------------ 366| 0| throw Invalid_Argument("Curve mismatch"); 367| 0| } 368| 28.9k| const auto x = C::FieldElement::from_stash(pt._x()); 369| 28.9k| const auto y = C::FieldElement::from_stash(pt._y()); 370| 28.9k| return typename C::AffinePoint(x, y); 371| 28.9k| } pcurves_secp256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE10mul_x_onlyERKNS0_15PrimeOrderCurve11AffinePointERKNS6_6ScalarERNS_21RandomNumberGeneratorE: 48| 327| RandomNumberGenerator& rng) const override { 49| 327| const auto result = varpoint_mul(from_stash(pt), from_stash(scalar), rng); 50| 327| BOTAN_STATE_CHECK(!result.is_identity().as_bool()); ------------------ | | 51| 327| do { \ | | 52| 327| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 327| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 327] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 327| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 327] | | ------------------ ------------------ 51| 327| const auto pt_x = to_affine_x(result); 52| 327| secure_vector x_bytes(C::FieldElement::BYTES); 53| 327| pt_x.serialize_to(std::span{x_bytes}); 54| 327| return x_bytes; 55| 327| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE5stashERKNS_16AffineCurvePointINS_6IntModINS2_22Secp256r1MontgomeryRepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 358| 13.6k| static AffinePoint stash(const typename C::AffinePoint& pt) { 359| 13.6k| const auto x_w = pt.x().template stash_value(); 360| 13.6k| const auto y_w = pt.y().template stash_value(); 361| 13.6k| return AffinePoint::_create(instance(), x_w, y_w); 362| 13.6k| } pcurves_secp256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE30deserialize_point_uncompressedENSt3__14spanIKhLm18446744073709551615EEE: 241| 6.65k| std::optional deserialize_point_uncompressed(std::span bytes) const override { 242| 6.65k| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 243| 6.65k| constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1; 244| | 245| 6.65k| if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) { ------------------ | Branch (245:13): [True: 6.65k, False: 0] | Branch (245:50): [True: 6.65k, False: 0] ------------------ 246| 6.65k| const auto encoded_point = bytes.subspan(1); 247| 6.65k| auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes)); 248| 6.65k| auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes)); 249| | 250| 6.65k| if(x && y) { ------------------ | Branch (250:16): [True: 6.65k, False: 1] | Branch (250:21): [True: 6.65k, False: 1] ------------------ 251| | // Check that y^2 = x^3 + ax + b 252| 6.65k| const auto lhs = (*y).square(); 253| 6.65k| const auto rhs = C::x3_ax_b(*x); 254| 6.65k| const auto valid = (lhs == rhs); 255| 6.65k| if(valid.as_bool()) { ------------------ | Branch (255:19): [True: 6.59k, False: 59] ------------------ 256| 6.59k| return stash(typename C::AffinePoint(*x, *y)); 257| 6.59k| } 258| 6.65k| } 259| 6.65k| } 260| | 261| 61| return {}; 262| 6.65k| } pcurves_secp256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE28deserialize_point_compressedENSt3__14spanIKhLm18446744073709551615EEE: 264| 330| std::optional deserialize_point_compressed(std::span bytes) const override { 265| 330| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 266| 330| constexpr size_t CompressedBytes = C::FieldElement::BYTES + 1; 267| | 268| 330| if(bytes.size() == CompressedBytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) { ------------------ | Branch (268:13): [True: 330, False: 0] | Branch (268:49): [True: 20, False: 310] | Branch (268:69): [True: 310, False: 0] ------------------ 269| 330| const CT::Choice y_is_even = CT::Mask::is_equal(bytes[0], 0x02).as_choice(); 270| | 271| 330| if(auto x = C::FieldElement::deserialize(bytes.subspan(1, FieldElementBytes))) { ------------------ | Branch (271:21): [True: 329, False: 1] ------------------ 272| 329| if(auto y = sqrt_field_element(C::x3_ax_b(*x)).as_optional_vartime()) { ------------------ | Branch (272:24): [True: 327, False: 2] ------------------ 273| 327| return stash(typename C::AffinePoint(*x, y->correct_sign(y_is_even))); 274| 327| } 275| 329| } 276| 330| } 277| | 278| 3| return {}; 279| 330| } pcurves_secp256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE18deserialize_scalarENSt3__14spanIKhLm18446744073709551615EEE: 221| 6.26k| std::optional deserialize_scalar(std::span bytes) const override { 222| 6.26k| if(auto scalar = C::Scalar::deserialize(bytes)) { ------------------ | Branch (222:18): [True: 6.26k, False: 0] ------------------ 223| 6.26k| if(!scalar->is_zero().as_bool()) { ------------------ | Branch (223:16): [True: 6.26k, False: 0] ------------------ 224| 6.26k| return stash(*scalar); 225| 6.26k| } 226| 6.26k| } 227| | 228| 0| return {}; 229| 6.26k| } pcurves_secp256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE15point_to_affineERKNS0_15PrimeOrderCurve15ProjectivePointE: 189| 6.75k| AffinePoint point_to_affine(const ProjectivePoint& pt) const override { 190| 6.75k| const auto affine = to_affine(from_stash(pt)); 191| | 192| 6.75k| const auto y2 = affine.y().square(); 193| 6.75k| const auto x3_ax_b = C::x3_ax_b(affine.x()); 194| 6.75k| const auto valid_point = affine.is_identity() || (y2 == x3_ax_b); 195| | 196| 6.75k| BOTAN_ASSERT(valid_point.as_bool(), "Computed point is on the curve"); ------------------ | | 71| 6.75k| do { \ | | 72| 6.75k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 6.75k| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 6.75k] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 6.75k| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 6.75k] | | ------------------ ------------------ 197| | 198| 6.75k| return stash(affine); 199| 6.75k| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE10from_stashERKNS0_15PrimeOrderCurve15ProjectivePointE: 380| 6.75k| static typename C::ProjectivePoint from_stash(const ProjectivePoint& pt) { 381| 6.75k| if(pt._curve() != instance()) { ------------------ | Branch (381:13): [True: 0, False: 6.75k] ------------------ 382| 0| throw Invalid_Argument("Curve mismatch"); 383| 0| } 384| 6.75k| const auto x = C::FieldElement::from_stash(pt._x()); 385| 6.75k| const auto y = C::FieldElement::from_stash(pt._y()); 386| 6.75k| const auto z = C::FieldElement::from_stash(pt._z()); 387| 6.75k| return typename C::ProjectivePoint(x, y, z); 388| 6.75k| } pcurves_secp256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE24affine_point_is_identityERKNS0_15PrimeOrderCurve11AffinePointE: 207| 14.3k| bool affine_point_is_identity(const AffinePoint& pt) const override { 208| 14.3k| return from_stash(pt).is_identity().as_bool(); 209| 14.3k| } pcurves_secp256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE15serialize_pointENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve11AffinePointE: 211| 14.3k| void serialize_point(std::span bytes, const AffinePoint& pt) const override { 212| 14.3k| BOTAN_ARG_CHECK(bytes.size() == C::AffinePoint::BYTES, "Invalid length for serialize_point"); ------------------ | | 35| 14.3k| do { \ | | 36| 14.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 14.3k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 14.3k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 14.3k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 14.3k] | | ------------------ ------------------ 213| 14.3k| from_stash(pt).serialize_to(bytes.subspan<0, C::AffinePoint::BYTES>()); 214| 14.3k| } pcurves_secp256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE16serialize_scalarENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve6ScalarE: 216| 6.75k| void serialize_scalar(std::span bytes, const Scalar& scalar) const override { 217| 6.75k| BOTAN_ARG_CHECK(bytes.size() == C::Scalar::BYTES, "Invalid length to serialize_scalar"); ------------------ | | 35| 6.75k| do { \ | | 36| 6.75k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 6.75k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 6.75k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 6.75k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 6.75k] | | ------------------ ------------------ 218| 6.75k| return from_stash(scalar).serialize_to(bytes.subspan<0, C::Scalar::BYTES>()); 219| 6.75k| } pcurves_secp256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE14scalar_is_zeroERKNS0_15PrimeOrderCurve6ScalarE: 329| 6.75k| bool scalar_is_zero(const Scalar& s) const override { return from_stash(s).is_zero().as_bool(); } pcurves_secp256r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256r15CurveEE13random_scalarERNS_21RandomNumberGeneratorE: 337| 488| Scalar random_scalar(RandomNumberGenerator& rng) const override { return stash(C::Scalar::random(rng)); } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE8instanceEv: 341| 5.88k| static std::shared_ptr instance() { 342| 5.88k| static const auto g_curve = std::make_shared>(); 343| 5.88k| return g_curve; 344| 5.88k| } 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| 2.96k| size_t field_element_bytes() const override { return C::FieldElement::BYTES; } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE8mul_by_gERKNS0_15PrimeOrderCurve6ScalarERNS_21RandomNumberGeneratorE: 38| 374| ProjectivePoint mul_by_g(const Scalar& scalar, RandomNumberGenerator& rng) const override { 39| 374| return stash(m_mul_by_g.mul(from_stash(scalar), rng)); 40| 374| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE5stashERKNS_20ProjectiveCurvePointINS_6IntModINS2_12Secp384r1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EE: 373| 374| static ProjectivePoint stash(const typename C::ProjectivePoint& pt) { 374| 374| const auto x_w = pt.x().template stash_value(); 375| 374| const auto y_w = pt.y().template stash_value(); 376| 374| const auto z_w = pt.z().template stash_value(); 377| 374| return ProjectivePoint::_create(instance(), x_w, y_w, z_w); 378| 374| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE10from_stashERKNS0_15PrimeOrderCurve6ScalarE: 351| 1.33k| static typename C::Scalar from_stash(const Scalar& s) { 352| 1.33k| if(s._curve() != instance()) { ------------------ | Branch (352:13): [True: 0, False: 1.33k] ------------------ 353| 0| throw Invalid_Argument("Curve mismatch"); 354| 0| } 355| 1.33k| return C::Scalar::from_stash(s._value()); 356| 1.33k| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE5stashERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS2_12Secp384r1RepEE12ScalarParamsEEEEE: 347| 374| static Scalar stash(const typename C::Scalar& s) { 348| 374| return Scalar::_create(instance(), s.template stash_value()); 349| 374| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE10from_stashERKNS0_15PrimeOrderCurve11AffinePointE: 364| 2.63k| static typename C::AffinePoint from_stash(const AffinePoint& pt) { 365| 2.63k| if(pt._curve() != instance()) { ------------------ | Branch (365:13): [True: 0, False: 2.63k] ------------------ 366| 0| throw Invalid_Argument("Curve mismatch"); 367| 0| } 368| 2.63k| const auto x = C::FieldElement::from_stash(pt._x()); 369| 2.63k| const auto y = C::FieldElement::from_stash(pt._y()); 370| 2.63k| return typename C::AffinePoint(x, y); 371| 2.63k| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE10mul_x_onlyERKNS0_15PrimeOrderCurve11AffinePointERKNS6_6ScalarERNS_21RandomNumberGeneratorE: 48| 210| RandomNumberGenerator& rng) const override { 49| 210| const auto result = varpoint_mul(from_stash(pt), from_stash(scalar), rng); 50| 210| BOTAN_STATE_CHECK(!result.is_identity().as_bool()); ------------------ | | 51| 210| do { \ | | 52| 210| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 210| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 210] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 210| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 210] | | ------------------ ------------------ 51| 210| const auto pt_x = to_affine_x(result); 52| 210| secure_vector x_bytes(C::FieldElement::BYTES); 53| 210| pt_x.serialize_to(std::span{x_bytes}); 54| 210| return x_bytes; 55| 210| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE5stashERKNS_16AffineCurvePointINS_6IntModINS2_12Secp384r1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 358| 794| static AffinePoint stash(const typename C::AffinePoint& pt) { 359| 794| const auto x_w = pt.x().template stash_value(); 360| 794| const auto y_w = pt.y().template stash_value(); 361| 794| return AffinePoint::_create(instance(), x_w, y_w); 362| 794| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE30deserialize_point_uncompressedENSt3__14spanIKhLm18446744073709551615EEE: 241| 271| std::optional deserialize_point_uncompressed(std::span bytes) const override { 242| 271| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 243| 271| constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1; 244| | 245| 271| if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) { ------------------ | Branch (245:13): [True: 271, False: 0] | Branch (245:50): [True: 271, False: 0] ------------------ 246| 271| const auto encoded_point = bytes.subspan(1); 247| 271| auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes)); 248| 271| auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes)); 249| | 250| 271| if(x && y) { ------------------ | Branch (250:16): [True: 270, False: 1] | Branch (250:21): [True: 269, False: 1] ------------------ 251| | // Check that y^2 = x^3 + ax + b 252| 269| const auto lhs = (*y).square(); 253| 269| const auto rhs = C::x3_ax_b(*x); 254| 269| const auto valid = (lhs == rhs); 255| 269| if(valid.as_bool()) { ------------------ | Branch (255:19): [True: 210, False: 59] ------------------ 256| 210| return stash(typename C::AffinePoint(*x, *y)); 257| 210| } 258| 269| } 259| 271| } 260| | 261| 61| return {}; 262| 271| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE28deserialize_point_compressedENSt3__14spanIKhLm18446744073709551615EEE: 264| 214| std::optional deserialize_point_compressed(std::span bytes) const override { 265| 214| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 266| 214| constexpr size_t CompressedBytes = C::FieldElement::BYTES + 1; 267| | 268| 214| if(bytes.size() == CompressedBytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) { ------------------ | Branch (268:13): [True: 214, False: 0] | Branch (268:49): [True: 187, False: 27] | Branch (268:69): [True: 27, False: 0] ------------------ 269| 214| const CT::Choice y_is_even = CT::Mask::is_equal(bytes[0], 0x02).as_choice(); 270| | 271| 214| if(auto x = C::FieldElement::deserialize(bytes.subspan(1, FieldElementBytes))) { ------------------ | Branch (271:21): [True: 213, False: 1] ------------------ 272| 213| if(auto y = sqrt_field_element(C::x3_ax_b(*x)).as_optional_vartime()) { ------------------ | Branch (272:24): [True: 210, False: 3] ------------------ 273| 210| return stash(typename C::AffinePoint(*x, y->correct_sign(y_is_even))); 274| 210| } 275| 213| } 276| 214| } 277| | 278| 4| return {}; 279| 214| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE15point_to_affineERKNS0_15PrimeOrderCurve15ProjectivePointE: 189| 374| AffinePoint point_to_affine(const ProjectivePoint& pt) const override { 190| 374| const auto affine = to_affine(from_stash(pt)); 191| | 192| 374| const auto y2 = affine.y().square(); 193| 374| const auto x3_ax_b = C::x3_ax_b(affine.x()); 194| 374| const auto valid_point = affine.is_identity() || (y2 == x3_ax_b); 195| | 196| 374| BOTAN_ASSERT(valid_point.as_bool(), "Computed point is on the curve"); ------------------ | | 71| 374| do { \ | | 72| 374| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 374| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 374] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 374| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 374] | | ------------------ ------------------ 197| | 198| 374| return stash(affine); 199| 374| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE10from_stashERKNS0_15PrimeOrderCurve15ProjectivePointE: 380| 374| static typename C::ProjectivePoint from_stash(const ProjectivePoint& pt) { 381| 374| if(pt._curve() != instance()) { ------------------ | Branch (381:13): [True: 0, False: 374] ------------------ 382| 0| throw Invalid_Argument("Curve mismatch"); 383| 0| } 384| 374| const auto x = C::FieldElement::from_stash(pt._x()); 385| 374| const auto y = C::FieldElement::from_stash(pt._y()); 386| 374| const auto z = C::FieldElement::from_stash(pt._z()); 387| 374| return typename C::ProjectivePoint(x, y, z); 388| 374| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE24affine_point_is_identityERKNS0_15PrimeOrderCurve11AffinePointE: 207| 1.21k| bool affine_point_is_identity(const AffinePoint& pt) const override { 208| 1.21k| return from_stash(pt).is_identity().as_bool(); 209| 1.21k| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE15serialize_pointENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve11AffinePointE: 211| 1.21k| void serialize_point(std::span bytes, const AffinePoint& pt) const override { 212| 1.21k| BOTAN_ARG_CHECK(bytes.size() == C::AffinePoint::BYTES, "Invalid length for serialize_point"); ------------------ | | 35| 1.21k| do { \ | | 36| 1.21k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.21k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.21k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.21k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.21k] | | ------------------ ------------------ 213| 1.21k| from_stash(pt).serialize_to(bytes.subspan<0, C::AffinePoint::BYTES>()); 214| 1.21k| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE16serialize_scalarENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve6ScalarE: 216| 374| void serialize_scalar(std::span bytes, const Scalar& scalar) const override { 217| 374| BOTAN_ARG_CHECK(bytes.size() == C::Scalar::BYTES, "Invalid length to serialize_scalar"); ------------------ | | 35| 374| do { \ | | 36| 374| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 374| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 374] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 374| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 374] | | ------------------ ------------------ 218| 374| return from_stash(scalar).serialize_to(bytes.subspan<0, C::Scalar::BYTES>()); 219| 374| } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE14scalar_is_zeroERKNS0_15PrimeOrderCurve6ScalarE: 329| 374| bool scalar_is_zero(const Scalar& s) const override { return from_stash(s).is_zero().as_bool(); } pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE13random_scalarERNS_21RandomNumberGeneratorE: 337| 374| Scalar random_scalar(RandomNumberGenerator& rng) const override { return stash(C::Scalar::random(rng)); } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE8instanceEv: 341| 5.27k| static std::shared_ptr instance() { 342| 5.27k| static const auto g_curve = std::make_shared>(); 343| 5.27k| return g_curve; 344| 5.27k| } 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| 2.67k| size_t field_element_bytes() const override { return C::FieldElement::BYTES; } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE8mul_by_gERKNS0_15PrimeOrderCurve6ScalarERNS_21RandomNumberGeneratorE: 38| 323| ProjectivePoint mul_by_g(const Scalar& scalar, RandomNumberGenerator& rng) const override { 39| 323| return stash(m_mul_by_g.mul(from_stash(scalar), rng)); 40| 323| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE5stashERKNS_20ProjectiveCurvePointINS_6IntModINS3_7P521RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEESA_EE: 373| 323| static ProjectivePoint stash(const typename C::ProjectivePoint& pt) { 374| 323| const auto x_w = pt.x().template stash_value(); 375| 323| const auto y_w = pt.y().template stash_value(); 376| 323| const auto z_w = pt.z().template stash_value(); 377| 323| return ProjectivePoint::_create(instance(), x_w, y_w, z_w); 378| 323| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE10from_stashERKNS0_15PrimeOrderCurve6ScalarE: 351| 1.16k| static typename C::Scalar from_stash(const Scalar& s) { 352| 1.16k| if(s._curve() != instance()) { ------------------ | Branch (352:13): [True: 0, False: 1.16k] ------------------ 353| 0| throw Invalid_Argument("Curve mismatch"); 354| 0| } 355| 1.16k| return C::Scalar::from_stash(s._value()); 356| 1.16k| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE5stashERKNS_6IntModINS_13MontgomeryRepINS_13EllipticCurveINS3_6ParamsENS3_7P521RepEE12ScalarParamsEEEEE: 347| 323| static Scalar stash(const typename C::Scalar& s) { 348| 323| return Scalar::_create(instance(), s.template stash_value()); 349| 323| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE10from_stashERKNS0_15PrimeOrderCurve11AffinePointE: 364| 2.41k| static typename C::AffinePoint from_stash(const AffinePoint& pt) { 365| 2.41k| if(pt._curve() != instance()) { ------------------ | Branch (365:13): [True: 0, False: 2.41k] ------------------ 366| 0| throw Invalid_Argument("Curve mismatch"); 367| 0| } 368| 2.41k| const auto x = C::FieldElement::from_stash(pt._x()); 369| 2.41k| const auto y = C::FieldElement::from_stash(pt._y()); 370| 2.41k| return typename C::AffinePoint(x, y); 371| 2.41k| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE10mul_x_onlyERKNS0_15PrimeOrderCurve11AffinePointERKNS6_6ScalarERNS_21RandomNumberGeneratorE: 48| 197| RandomNumberGenerator& rng) const override { 49| 197| const auto result = varpoint_mul(from_stash(pt), from_stash(scalar), rng); 50| 197| BOTAN_STATE_CHECK(!result.is_identity().as_bool()); ------------------ | | 51| 197| do { \ | | 52| 197| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 197| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 197] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 197| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 197] | | ------------------ ------------------ 51| 197| const auto pt_x = to_affine_x(result); 52| 197| secure_vector x_bytes(C::FieldElement::BYTES); 53| 197| pt_x.serialize_to(std::span{x_bytes}); 54| 197| return x_bytes; 55| 197| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE5stashERKNS_16AffineCurvePointINS_6IntModINS3_7P521RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 358| 717| static AffinePoint stash(const typename C::AffinePoint& pt) { 359| 717| const auto x_w = pt.x().template stash_value(); 360| 717| const auto y_w = pt.y().template stash_value(); 361| 717| return AffinePoint::_create(instance(), x_w, y_w); 362| 717| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE30deserialize_point_uncompressedENSt3__14spanIKhLm18446744073709551615EEE: 241| 262| std::optional deserialize_point_uncompressed(std::span bytes) const override { 242| 262| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 243| 262| constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1; 244| | 245| 262| if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) { ------------------ | Branch (245:13): [True: 262, False: 0] | Branch (245:50): [True: 262, False: 0] ------------------ 246| 262| const auto encoded_point = bytes.subspan(1); 247| 262| auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes)); 248| 262| auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes)); 249| | 250| 262| if(x && y) { ------------------ | Branch (250:16): [True: 259, False: 3] | Branch (250:21): [True: 257, False: 2] ------------------ 251| | // Check that y^2 = x^3 + ax + b 252| 257| const auto lhs = (*y).square(); 253| 257| const auto rhs = C::x3_ax_b(*x); 254| 257| const auto valid = (lhs == rhs); 255| 257| if(valid.as_bool()) { ------------------ | Branch (255:19): [True: 197, False: 60] ------------------ 256| 197| return stash(typename C::AffinePoint(*x, *y)); 257| 197| } 258| 257| } 259| 262| } 260| | 261| 65| return {}; 262| 262| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE28deserialize_point_compressedENSt3__14spanIKhLm18446744073709551615EEE: 264| 204| std::optional deserialize_point_compressed(std::span bytes) const override { 265| 204| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 266| 204| constexpr size_t CompressedBytes = C::FieldElement::BYTES + 1; 267| | 268| 204| if(bytes.size() == CompressedBytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) { ------------------ | Branch (268:13): [True: 204, False: 0] | Branch (268:49): [True: 5, False: 199] | Branch (268:69): [True: 199, False: 0] ------------------ 269| 204| const CT::Choice y_is_even = CT::Mask::is_equal(bytes[0], 0x02).as_choice(); 270| | 271| 204| if(auto x = C::FieldElement::deserialize(bytes.subspan(1, FieldElementBytes))) { ------------------ | Branch (271:21): [True: 203, False: 1] ------------------ 272| 203| if(auto y = sqrt_field_element(C::x3_ax_b(*x)).as_optional_vartime()) { ------------------ | Branch (272:24): [True: 197, False: 6] ------------------ 273| 197| return stash(typename C::AffinePoint(*x, y->correct_sign(y_is_even))); 274| 197| } 275| 203| } 276| 204| } 277| | 278| 7| return {}; 279| 204| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE15point_to_affineERKNS0_15PrimeOrderCurve15ProjectivePointE: 189| 323| AffinePoint point_to_affine(const ProjectivePoint& pt) const override { 190| 323| const auto affine = to_affine(from_stash(pt)); 191| | 192| 323| const auto y2 = affine.y().square(); 193| 323| const auto x3_ax_b = C::x3_ax_b(affine.x()); 194| 323| const auto valid_point = affine.is_identity() || (y2 == x3_ax_b); 195| | 196| 323| BOTAN_ASSERT(valid_point.as_bool(), "Computed point is on the curve"); ------------------ | | 71| 323| do { \ | | 72| 323| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 323| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 323] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 323| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 323] | | ------------------ ------------------ 197| | 198| 323| return stash(affine); 199| 323| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE10from_stashERKNS0_15PrimeOrderCurve15ProjectivePointE: 380| 323| static typename C::ProjectivePoint from_stash(const ProjectivePoint& pt) { 381| 323| if(pt._curve() != instance()) { ------------------ | Branch (381:13): [True: 0, False: 323] ------------------ 382| 0| throw Invalid_Argument("Curve mismatch"); 383| 0| } 384| 323| const auto x = C::FieldElement::from_stash(pt._x()); 385| 323| const auto y = C::FieldElement::from_stash(pt._y()); 386| 323| const auto z = C::FieldElement::from_stash(pt._z()); 387| 323| return typename C::ProjectivePoint(x, y, z); 388| 323| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE24affine_point_is_identityERKNS0_15PrimeOrderCurve11AffinePointE: 207| 1.11k| bool affine_point_is_identity(const AffinePoint& pt) const override { 208| 1.11k| return from_stash(pt).is_identity().as_bool(); 209| 1.11k| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE15serialize_pointENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve11AffinePointE: 211| 1.11k| void serialize_point(std::span bytes, const AffinePoint& pt) const override { 212| 1.11k| BOTAN_ARG_CHECK(bytes.size() == C::AffinePoint::BYTES, "Invalid length for serialize_point"); ------------------ | | 35| 1.11k| do { \ | | 36| 1.11k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.11k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.11k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.11k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.11k] | | ------------------ ------------------ 213| 1.11k| from_stash(pt).serialize_to(bytes.subspan<0, C::AffinePoint::BYTES>()); 214| 1.11k| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE16serialize_scalarENSt3__14spanIhLm18446744073709551615EEERKNS0_15PrimeOrderCurve6ScalarE: 216| 323| void serialize_scalar(std::span bytes, const Scalar& scalar) const override { 217| 323| BOTAN_ARG_CHECK(bytes.size() == C::Scalar::BYTES, "Invalid length to serialize_scalar"); ------------------ | | 35| 323| do { \ | | 36| 323| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 323| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 323] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 323| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 323] | | ------------------ ------------------ 218| 323| return from_stash(scalar).serialize_to(bytes.subspan<0, C::Scalar::BYTES>()); 219| 323| } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE14scalar_is_zeroERKNS0_15PrimeOrderCurve6ScalarE: 329| 323| bool scalar_is_zero(const Scalar& s) const override { return from_stash(s).is_zero().as_bool(); } pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE13random_scalarERNS_21RandomNumberGeneratorE: 337| 323| Scalar random_scalar(RandomNumberGenerator& rng) const override { return stash(C::Scalar::random(rng)); } _ZN5Botan25require_software_providerINS_31PK_Key_Agreement_Options_ReaderEEEvRKT_NSt3__117basic_string_viewIcNS5_11char_traitsIcEEEE: 87| 1.41k|void require_software_provider(const OptionsT& options, std::string_view algo_name) { 88| 1.41k| if(options.using_provider()) { ------------------ | Branch (88:7): [True: 0, False: 1.41k] ------------------ 89| 0| throw Provider_Not_Found(algo_name, options.provider().value()); 90| 0| } 91| 1.41k|} _ZNK5Botan8Poly130513output_lengthEv: 31| 41| size_t output_length() const override { return 16; } _ZNK5Botan8Poly13058key_specEv: 33| 41| Key_Length_Specification key_spec() const override { return Key_Length_Specification(32); } _ZN5Botan16polyval_multiplyERKNS_9SIMD_4x32ES2_: 140| 821|BOTAN_FORCE_INLINE SIMD_4x32 BOTAN_FN_ISA_CLMUL polyval_multiply(const SIMD_4x32& H, const SIMD_4x32& x) { 141| 821| SIMD_4x32 hi = clmul<0x11>(H, x); 142| 821| const SIMD_4x32 mid = clmul<0x10>(H, x) ^ clmul<0x01>(H, x); 143| 821| SIMD_4x32 lo = clmul<0x00>(H, x); 144| | 145| 821| hi ^= mid.shift_elems_right<2>(); 146| 821| lo ^= mid.shift_elems_left<2>(); 147| | 148| 821| return polyval_reduce(hi, lo); 149| 821|} _ZN5Botan5clmulILi17EEENS_9SIMD_4x32ERKS1_S3_: 21| 3.01k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_CLMUL SIMD_4x32 clmul(const SIMD_4x32& H, const SIMD_4x32& x) { 22| 3.01k| static_assert(M == 0x00 || M == 0x01 || M == 0x10 || M == 0x11, "Valid clmul mode"); 23| | 24| 3.01k|#if defined(BOTAN_SIMD_USE_SSSE3) 25| 3.01k| return SIMD_4x32(_mm_clmulepi64_si128(x.raw(), H.raw(), M)); 26| |#elif defined(BOTAN_SIMD_USE_NEON) 27| | const uint64_t a = vgetq_lane_u64(vreinterpretq_u64_u32(x.raw()), M & 0x01); 28| | const uint64_t b = vgetq_lane_u64(vreinterpretq_u64_u32(H.raw()), (M & 0x10) >> 4); 29| | 30| | #if defined(BOTAN_BUILD_COMPILER_IS_MSVC) 31| | __n64 a1 = {a}, b1 = {b}; 32| | return SIMD_4x32(vmull_p64(a1, b1)); 33| | #else 34| | return SIMD_4x32(reinterpret_cast(vmull_p64(a, b))); 35| | #endif 36| | 37| |#elif defined(BOTAN_SIMD_USE_VSX) 38| | const SIMD_4x32 mask_lo = SIMD_4x32(0, 0, 0xFFFFFFFF, 0xFFFFFFFF); 39| | constexpr uint8_t flip = (std::endian::native == std::endian::big) ? 0x11 : 0x00; 40| | 41| | SIMD_4x32 i1 = x; 42| | SIMD_4x32 i2 = H; 43| | 44| | if constexpr(std::endian::native == std::endian::big) { 45| | i1 = i1.reverse_all_bytes().bswap(); 46| | i2 = i2.reverse_all_bytes().bswap(); 47| | } 48| | 49| | if constexpr(M == (0x11 ^ flip)) { 50| | i1 &= mask_lo; 51| | i2 &= mask_lo; 52| | } else if constexpr(M == (0x10 ^ flip)) { 53| | i1 = i1.shift_elems_left<2>(); 54| | } else if constexpr(M == (0x01 ^ flip)) { 55| | i2 = i2.shift_elems_left<2>(); 56| | } else if constexpr(M == (0x00 ^ flip)) { 57| | i1 = mask_lo.andc(i1); 58| | i2 = mask_lo.andc(i2); 59| | } 60| | 61| | auto i1v = reinterpret_cast<__vector unsigned long long>(i1.raw()); 62| | auto i2v = reinterpret_cast<__vector unsigned long long>(i2.raw()); 63| | 64| | #if BOTAN_COMPILER_HAS_BUILTIN(__builtin_crypto_vpmsumd) 65| | auto rv = __builtin_crypto_vpmsumd(i1v, i2v); 66| | #else 67| | auto rv = __builtin_altivec_crypto_vpmsumd(i1v, i2v); 68| | #endif 69| | 70| | auto z = SIMD_4x32(reinterpret_cast<__vector unsigned int>(rv)); 71| | 72| | if constexpr(std::endian::native == std::endian::big) { 73| | z = z.reverse_all_bytes().bswap(); 74| | } 75| | 76| | return z; 77| |#endif 78| 3.01k|} _ZN5Botan5clmulILi16EEENS_9SIMD_4x32ERKS1_S3_: 21| 821|BOTAN_FORCE_INLINE BOTAN_FN_ISA_CLMUL SIMD_4x32 clmul(const SIMD_4x32& H, const SIMD_4x32& x) { 22| 821| static_assert(M == 0x00 || M == 0x01 || M == 0x10 || M == 0x11, "Valid clmul mode"); 23| | 24| 821|#if defined(BOTAN_SIMD_USE_SSSE3) 25| 821| return SIMD_4x32(_mm_clmulepi64_si128(x.raw(), H.raw(), M)); 26| |#elif defined(BOTAN_SIMD_USE_NEON) 27| | const uint64_t a = vgetq_lane_u64(vreinterpretq_u64_u32(x.raw()), M & 0x01); 28| | const uint64_t b = vgetq_lane_u64(vreinterpretq_u64_u32(H.raw()), (M & 0x10) >> 4); 29| | 30| | #if defined(BOTAN_BUILD_COMPILER_IS_MSVC) 31| | __n64 a1 = {a}, b1 = {b}; 32| | return SIMD_4x32(vmull_p64(a1, b1)); 33| | #else 34| | return SIMD_4x32(reinterpret_cast(vmull_p64(a, b))); 35| | #endif 36| | 37| |#elif defined(BOTAN_SIMD_USE_VSX) 38| | const SIMD_4x32 mask_lo = SIMD_4x32(0, 0, 0xFFFFFFFF, 0xFFFFFFFF); 39| | constexpr uint8_t flip = (std::endian::native == std::endian::big) ? 0x11 : 0x00; 40| | 41| | SIMD_4x32 i1 = x; 42| | SIMD_4x32 i2 = H; 43| | 44| | if constexpr(std::endian::native == std::endian::big) { 45| | i1 = i1.reverse_all_bytes().bswap(); 46| | i2 = i2.reverse_all_bytes().bswap(); 47| | } 48| | 49| | if constexpr(M == (0x11 ^ flip)) { 50| | i1 &= mask_lo; 51| | i2 &= mask_lo; 52| | } else if constexpr(M == (0x10 ^ flip)) { 53| | i1 = i1.shift_elems_left<2>(); 54| | } else if constexpr(M == (0x01 ^ flip)) { 55| | i2 = i2.shift_elems_left<2>(); 56| | } else if constexpr(M == (0x00 ^ flip)) { 57| | i1 = mask_lo.andc(i1); 58| | i2 = mask_lo.andc(i2); 59| | } 60| | 61| | auto i1v = reinterpret_cast<__vector unsigned long long>(i1.raw()); 62| | auto i2v = reinterpret_cast<__vector unsigned long long>(i2.raw()); 63| | 64| | #if BOTAN_COMPILER_HAS_BUILTIN(__builtin_crypto_vpmsumd) 65| | auto rv = __builtin_crypto_vpmsumd(i1v, i2v); 66| | #else 67| | auto rv = __builtin_altivec_crypto_vpmsumd(i1v, i2v); 68| | #endif 69| | 70| | auto z = SIMD_4x32(reinterpret_cast<__vector unsigned int>(rv)); 71| | 72| | if constexpr(std::endian::native == std::endian::big) { 73| | z = z.reverse_all_bytes().bswap(); 74| | } 75| | 76| | return z; 77| |#endif 78| 821|} _ZN5Botan5clmulILi1EEENS_9SIMD_4x32ERKS1_S3_: 21| 821|BOTAN_FORCE_INLINE BOTAN_FN_ISA_CLMUL SIMD_4x32 clmul(const SIMD_4x32& H, const SIMD_4x32& x) { 22| 821| static_assert(M == 0x00 || M == 0x01 || M == 0x10 || M == 0x11, "Valid clmul mode"); 23| | 24| 821|#if defined(BOTAN_SIMD_USE_SSSE3) 25| 821| return SIMD_4x32(_mm_clmulepi64_si128(x.raw(), H.raw(), M)); 26| |#elif defined(BOTAN_SIMD_USE_NEON) 27| | const uint64_t a = vgetq_lane_u64(vreinterpretq_u64_u32(x.raw()), M & 0x01); 28| | const uint64_t b = vgetq_lane_u64(vreinterpretq_u64_u32(H.raw()), (M & 0x10) >> 4); 29| | 30| | #if defined(BOTAN_BUILD_COMPILER_IS_MSVC) 31| | __n64 a1 = {a}, b1 = {b}; 32| | return SIMD_4x32(vmull_p64(a1, b1)); 33| | #else 34| | return SIMD_4x32(reinterpret_cast(vmull_p64(a, b))); 35| | #endif 36| | 37| |#elif defined(BOTAN_SIMD_USE_VSX) 38| | const SIMD_4x32 mask_lo = SIMD_4x32(0, 0, 0xFFFFFFFF, 0xFFFFFFFF); 39| | constexpr uint8_t flip = (std::endian::native == std::endian::big) ? 0x11 : 0x00; 40| | 41| | SIMD_4x32 i1 = x; 42| | SIMD_4x32 i2 = H; 43| | 44| | if constexpr(std::endian::native == std::endian::big) { 45| | i1 = i1.reverse_all_bytes().bswap(); 46| | i2 = i2.reverse_all_bytes().bswap(); 47| | } 48| | 49| | if constexpr(M == (0x11 ^ flip)) { 50| | i1 &= mask_lo; 51| | i2 &= mask_lo; 52| | } else if constexpr(M == (0x10 ^ flip)) { 53| | i1 = i1.shift_elems_left<2>(); 54| | } else if constexpr(M == (0x01 ^ flip)) { 55| | i2 = i2.shift_elems_left<2>(); 56| | } else if constexpr(M == (0x00 ^ flip)) { 57| | i1 = mask_lo.andc(i1); 58| | i2 = mask_lo.andc(i2); 59| | } 60| | 61| | auto i1v = reinterpret_cast<__vector unsigned long long>(i1.raw()); 62| | auto i2v = reinterpret_cast<__vector unsigned long long>(i2.raw()); 63| | 64| | #if BOTAN_COMPILER_HAS_BUILTIN(__builtin_crypto_vpmsumd) 65| | auto rv = __builtin_crypto_vpmsumd(i1v, i2v); 66| | #else 67| | auto rv = __builtin_altivec_crypto_vpmsumd(i1v, i2v); 68| | #endif 69| | 70| | auto z = SIMD_4x32(reinterpret_cast<__vector unsigned int>(rv)); 71| | 72| | if constexpr(std::endian::native == std::endian::big) { 73| | z = z.reverse_all_bytes().bswap(); 74| | } 75| | 76| | return z; 77| |#endif 78| 821|} _ZN5Botan5clmulILi0EEENS_9SIMD_4x32ERKS1_S3_: 21| 7.42k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_CLMUL SIMD_4x32 clmul(const SIMD_4x32& H, const SIMD_4x32& x) { 22| 7.42k| static_assert(M == 0x00 || M == 0x01 || M == 0x10 || M == 0x11, "Valid clmul mode"); 23| | 24| 7.42k|#if defined(BOTAN_SIMD_USE_SSSE3) 25| 7.42k| return SIMD_4x32(_mm_clmulepi64_si128(x.raw(), H.raw(), M)); 26| |#elif defined(BOTAN_SIMD_USE_NEON) 27| | const uint64_t a = vgetq_lane_u64(vreinterpretq_u64_u32(x.raw()), M & 0x01); 28| | const uint64_t b = vgetq_lane_u64(vreinterpretq_u64_u32(H.raw()), (M & 0x10) >> 4); 29| | 30| | #if defined(BOTAN_BUILD_COMPILER_IS_MSVC) 31| | __n64 a1 = {a}, b1 = {b}; 32| | return SIMD_4x32(vmull_p64(a1, b1)); 33| | #else 34| | return SIMD_4x32(reinterpret_cast(vmull_p64(a, b))); 35| | #endif 36| | 37| |#elif defined(BOTAN_SIMD_USE_VSX) 38| | const SIMD_4x32 mask_lo = SIMD_4x32(0, 0, 0xFFFFFFFF, 0xFFFFFFFF); 39| | constexpr uint8_t flip = (std::endian::native == std::endian::big) ? 0x11 : 0x00; 40| | 41| | SIMD_4x32 i1 = x; 42| | SIMD_4x32 i2 = H; 43| | 44| | if constexpr(std::endian::native == std::endian::big) { 45| | i1 = i1.reverse_all_bytes().bswap(); 46| | i2 = i2.reverse_all_bytes().bswap(); 47| | } 48| | 49| | if constexpr(M == (0x11 ^ flip)) { 50| | i1 &= mask_lo; 51| | i2 &= mask_lo; 52| | } else if constexpr(M == (0x10 ^ flip)) { 53| | i1 = i1.shift_elems_left<2>(); 54| | } else if constexpr(M == (0x01 ^ flip)) { 55| | i2 = i2.shift_elems_left<2>(); 56| | } else if constexpr(M == (0x00 ^ flip)) { 57| | i1 = mask_lo.andc(i1); 58| | i2 = mask_lo.andc(i2); 59| | } 60| | 61| | auto i1v = reinterpret_cast<__vector unsigned long long>(i1.raw()); 62| | auto i2v = reinterpret_cast<__vector unsigned long long>(i2.raw()); 63| | 64| | #if BOTAN_COMPILER_HAS_BUILTIN(__builtin_crypto_vpmsumd) 65| | auto rv = __builtin_crypto_vpmsumd(i1v, i2v); 66| | #else 67| | auto rv = __builtin_altivec_crypto_vpmsumd(i1v, i2v); 68| | #endif 69| | 70| | auto z = SIMD_4x32(reinterpret_cast<__vector unsigned int>(rv)); 71| | 72| | if constexpr(std::endian::native == std::endian::big) { 73| | z = z.reverse_all_bytes().bswap(); 74| | } 75| | 76| | return z; 77| |#endif 78| 7.42k|} _ZN5Botan14polyval_reduceERKNS_9SIMD_4x32ES2_: 119| 1.11k|BOTAN_FORCE_INLINE SIMD_4x32 BOTAN_FN_ISA_CLMUL polyval_reduce(const SIMD_4x32& hi, const SIMD_4x32& lo) { 120| 1.11k| const SIMD_4x32 V(0, 0xC2000000, 0, 0); 121| | 122| | /* 123| | Montgomery reduction 124| | Input: 256-bit operand [X3 : X2 : X1 : X0] 125| | [A1 : A0] = X0 * 0xc200000000000000 126| | [B1 : B0] = [X0 + A1 : X1 + A0] 127| | [C1 : C0] = B0 * 0xc200000000000000 128| | [D1 : D0] = [B0 + C1 : B1 + C0] 129| | Output: [D1 + X3 : D0 + X2] 130| | */ 131| | 132| 1.11k| const auto A = clmul<0x00>(lo, V); 133| 1.11k| const auto B = A ^ lo.swap_halves(); 134| 1.11k| const auto C = clmul<0x00>(B, V); 135| 1.11k| const auto D = C ^ B.swap_halves(); 136| | 137| 1.11k| return D ^ hi; 138| 1.11k|} _ZN5Botan12mulx_polyvalERKNS_9SIMD_4x32E: 104| 97|BOTAN_FORCE_INLINE SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 mulx_polyval(const SIMD_4x32& h) { 105| 97| const auto V = SIMD_4x32(0x00000001, 0x00000000, 0x00000000, 0xc2000000); 106| | 107| | // Bitmask set iff the top bit of h is set 108| 97| const auto mask = h.top_bit_mask(); 109| | 110| | // Extract the top bits of the words and move them into place as the low bit of the next word 111| 97| const auto top_bits = h.shr<31>().shift_elems_left<1>(); 112| | 113| | // The main shift, adding back in the top bits that are otherwise lost 114| 97| const auto shifted_h = h.shl<1>() | top_bits; 115| | 116| 97| return shifted_h ^ (mask & V); 117| 97|} _ZN5Botan10load_blockILb1EEENS_9SIMD_4x32EPKh: 87| 2.85k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32 load_block(const uint8_t in[]) { 88| 2.85k| if constexpr(BSWAP) { 89| 2.85k| return SIMD_4x32::load_le(in).reverse_all_bytes(); 90| | } else { 91| | return SIMD_4x32::load_le(in); 92| | } 93| 2.85k|} _ZN5Botan11store_blockILb1EEEvRKNS_9SIMD_4x32EPh: 96| 318|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SIMD_4X32 void store_block(const SIMD_4x32& b, uint8_t out[]) { 97| 318| if constexpr(BSWAP) { 98| 318| b.reverse_all_bytes().store_le(out); 99| | } else { 100| | b.store_le(out); 101| | } 102| 318|} _ZN5Botan15prefetch_arraysITkNSt3__117unsigned_integralEKhJLm256ELm256ELm256ELm256EEEET_DpRAT0__S3_: 34| 6|T prefetch_arrays(T (&... arr)[Ns]) noexcept { 35| 6| return (static_cast(prefetch_array_raw(sizeof(T) * Ns, arr)) & ...); 36| 6|} _ZN5Botan15prefetch_arraysITkNSt3__117unsigned_integralEKhJLm256EEEET_DpRAT0__S3_: 34| 15|T prefetch_arrays(T (&... arr)[Ns]) noexcept { 35| 15| return (static_cast(prefetch_array_raw(sizeof(T) * Ns, arr)) & ...); 36| 15|} _ZN5Botan10TLS_12_PRFC2ENSt3__110unique_ptrINS_25MessageAuthenticationCodeENS1_14default_deleteIS3_EEEE: 28| 1.35k| explicit TLS_12_PRF(std::unique_ptr mac) : m_mac(std::move(mac)) {} _ZN5Botan4rotlILm1ETkNSt3__117unsigned_integralEhEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 25| 360|{ 26| 360| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 27| 360|} _ZN5Botan4rotlILm7ETkNSt3__117unsigned_integralEhEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 25| 180|{ 26| 180| return static_cast((input << ROT) | (input >> (8 * sizeof(T) - ROT))); 27| 180|} _ZN5Botan4rotrILm8ETkNSt3__117unsigned_integralEjEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 312|{ 38| 312| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 312|} _ZN5Botan4rotrILm16ETkNSt3__117unsigned_integralEjEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 408|{ 38| 408| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 408|} _ZN5Botan4rotrILm24ETkNSt3__117unsigned_integralEjEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 312|{ 38| 312| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 312|} _ZN5Botan4rotrILm39ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 1.10M|{ 38| 1.10M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 1.10M|} _ZN5Botan4rotrILm34ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 1.10M|{ 38| 1.10M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 1.10M|} _ZN5Botan4rotrILm14ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 1.10M|{ 38| 1.10M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 1.10M|} _ZN5Botan3rhoILm14ELm18ELm41ETkNSt3__117unsigned_integralEmEET2_S2_: 53| 1.10M|BOTAN_FORCE_INLINE constexpr T rho(T x) { 54| 1.10M| return rotr(x) ^ rotr(x) ^ rotr(x); 55| 1.10M|} _ZN5Botan4rotrILm18ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 1.10M|{ 38| 1.10M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 1.10M|} _ZN5Botan4rotrILm41ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 1.10M|{ 38| 1.10M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 1.10M|} _ZN5Botan3rhoILm28ELm34ELm39ETkNSt3__117unsigned_integralEmEET2_S2_: 53| 1.10M|BOTAN_FORCE_INLINE constexpr T rho(T x) { 54| 1.10M| return rotr(x) ^ rotr(x) ^ rotr(x); 55| 1.10M|} _ZN5Botan4rotrILm28ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 1.10M|{ 38| 1.10M| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 1.10M|} _ZN5Botan14scoped_cleanupIZNS_2CT13scoped_poisonIJNSt3__16vectorIhNS_16secure_allocatorIhEEEEEQaaaagtsZT_Li0Efraa10poisonableIT_Efraa12unpoisonableIS8_EEEDaDpRKS8_EUlvE_EC2ESC_: 26| 18| explicit scoped_cleanup(FunT cleanup) : m_cleanup(std::move(cleanup)) {} _ZN5Botan14scoped_cleanupIZNS_2CT13scoped_poisonIJNSt3__16vectorIhNS_16secure_allocatorIhEEEEEQaaaagtsZT_Li0Efraa10poisonableIT_Efraa12unpoisonableIS8_EEEDaDpRKS8_EUlvE_EC2EOSD_: 32| 18| scoped_cleanup(scoped_cleanup&& other) noexcept : m_cleanup(std::move(other.m_cleanup)) { other.disengage(); } _ZN5Botan14scoped_cleanupIZNS_2CT13scoped_poisonIJNSt3__16vectorIhNS_16secure_allocatorIhEEEEEQaaaagtsZT_Li0Efraa10poisonableIT_Efraa12unpoisonableIS8_EEEDaDpRKS8_EUlvE_E9disengageEv: 43| 18| void disengage() noexcept { m_cleanup.reset(); } _ZN5Botan14scoped_cleanupIZNS_2CT13scoped_poisonIJNSt3__16vectorIhNS_16secure_allocatorIhEEEEEQaaaagtsZT_Li0Efraa10poisonableIT_Efraa12unpoisonableIS8_EEEDaDpRKS8_EUlvE_ED2Ev: 34| 36| ~scoped_cleanup() { 35| 36| if(m_cleanup.has_value()) { ------------------ | Branch (35:13): [True: 18, False: 18] ------------------ 36| 18| (*m_cleanup)(); // NOLINT(bugprone-exception-escape) clang-tidy bug 37| 18| } 38| 36| } _ZNK5Botan5SHA_14nameEv: 32| 91| std::string name() const override { return "SHA-1"; } _ZNK5Botan5SHA_113output_lengthEv: 34| 44.1k| size_t output_length() const override { return 20; } _ZNK5Botan5SHA_115hash_block_sizeEv: 36| 65| size_t hash_block_size() const override { return block_bytes; } _ZN5Botan5SHA_15clearEv: 47| 65| void clear() override { m_md.clear(); } _ZNK5Botan7SHA_2564nameEv: 73| 24| std::string name() const override { return "SHA-256"; } _ZNK5Botan7SHA_25613output_lengthEv: 75| 84.1k| size_t output_length() const override { return output_bytes; } _ZNK5Botan7SHA_25615hash_block_sizeEv: 77| 1.05k| size_t hash_block_size() const override { return block_bytes; } _ZN5Botan7SHA_2565clearEv: 83| 1.99k| void clear() override { m_md.clear(); } _ZNK5Botan7SHA_3844nameEv: 32| 35| std::string name() const override { return "SHA-384"; } _ZNK5Botan7SHA_38413output_lengthEv: 34| 11.2k| size_t output_length() const override { return output_bytes; } _ZNK5Botan7SHA_38415hash_block_sizeEv: 36| 339| size_t hash_block_size() const override { return block_bytes; } _ZN5Botan7SHA_3845clearEv: 44| 624| void clear() override { m_md.clear(); } _ZN5Botan9SHA2_64_FEmmmRmmmmS0_m: 64| 1.10M| 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| 1.10M| H += rho<14, 18, 41>(E) + choose(E, F, G) + M; 66| 1.10M| D += H; 67| 1.10M| H += rho<28, 34, 39>(A) + majority(A, B, C); 68| 1.10M|} _ZN5Botan9SIMD_2x64C2Ev: 61| 104k| 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| 104k| { 70| 104k| } _ZN5Botan9SIMD_2x647load_beEPKv: 132| 104k| 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| 104k| } else { 136| 104k| return SIMD_2x64::load_native(in).bswap(); 137| 104k| } 138| 104k| } _ZN5Botan9SIMD_2x6411load_nativeEPKv: 112| 626k| static SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 load_native(const void* in) { 113| 626k|#if defined(BOTAN_SIMD_USE_SSSE3) 114| 626k| 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| 626k| } _ZN5Botan9SIMD_2x64C2EDv2_x: 507| 4.07M| explicit BOTAN_FN_ISA_SIMD_2X64 SIMD_2x64(native_simd_type x) : m_simd(x) {} _ZNK5Botan9SIMD_2x645bswapEv: 148| 104k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 bswap() const { 149| 104k|#if defined(BOTAN_SIMD_USE_SSSE3) 150| 104k| const auto idx = _mm_set_epi8(8, 9, 10, 11, 12, 13, 14, 15, 0, 1, 2, 3, 4, 5, 6, 7); 151| 104k| 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| 104k| } _ZNK5Botan9SIMD_2x64plERKS0_: 224| 1.77M| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 operator+(const SIMD_2x64& other) const { 225| 1.77M| SIMD_2x64 retval(*this); 226| 1.77M| retval += other; 227| 1.77M| return retval; 228| 1.77M| } _ZN5Botan9SIMD_2x64pLERKS0_: 254| 1.77M| void BOTAN_FN_ISA_SIMD_2X64 operator+=(const SIMD_2x64& other) { 255| 1.77M|#if defined(BOTAN_SIMD_USE_SSSE3) 256| 1.77M| 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| 1.77M| } _ZN5Botan9SIMD_2x647load_leEPKv: 124| 522k| static SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 load_le(const void* in) { 125| 522k| if constexpr(std::endian::native == std::endian::little) { 126| 522k| return SIMD_2x64::load_native(in); 127| | } else { 128| | return SIMD_2x64::load_native(in).bswap(); 129| | } 130| 522k| } _ZNK5Botan9SIMD_2x648store_leEPm: 200| 522k| void BOTAN_FN_ISA_SIMD_2X64 store_le(uint64_t out[2]) const { this->store_le(reinterpret_cast(out)); } _ZNK5Botan9SIMD_2x648store_leEPh: 202| 522k| void BOTAN_FN_ISA_SIMD_2X64 store_le(uint8_t out[]) const { 203| 522k| if constexpr(std::endian::native == std::endian::little) { 204| 522k| this->store_native(out); 205| | } else { 206| | this->bswap().store_native(out); 207| | } 208| 522k| } _ZNK5Botan9SIMD_2x6412store_nativeEPv: 188| 522k| void BOTAN_FN_ISA_SIMD_2X64 store_native(void* out) const { 189| 522k|#if defined(BOTAN_SIMD_USE_SSSE3) 190| 522k| _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| 522k| } _ZN5Botan9SIMD_2x647alignr8ERKS0_S2_: 401| 835k| static SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 alignr8(const SIMD_2x64& a, const SIMD_2x64& b) { 402| 835k|#if defined(BOTAN_SIMD_USE_SSSE3) 403| 835k| 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| 835k| } _ZNK5Botan9SIMD_2x644rotrILm1EEES0_vQaagtT_Li0EltT_Li64E: 296| 417k| { 297| 417k|#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| 417k| } else { 311| 417k| return SIMD_2x64(_mm_or_si128(_mm_srli_epi64(m_simd, static_cast(ROT)), 312| 417k| _mm_slli_epi64(m_simd, static_cast(64 - ROT)))); 313| 417k| } 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| 417k| } _ZNK5Botan9SIMD_2x64eoERKS0_: 230| 1.67M| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 operator^(const SIMD_2x64& other) const { 231| 1.67M| SIMD_2x64 retval(*this); 232| 1.67M| retval ^= other; 233| 1.67M| return retval; 234| 1.67M| } _ZN5Botan9SIMD_2x64eOERKS0_: 266| 1.67M| void BOTAN_FN_ISA_SIMD_2X64 operator^=(const SIMD_2x64& other) { 267| 1.67M|#if defined(BOTAN_SIMD_USE_SSSE3) 268| 1.67M| 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| 1.67M| } _ZNK5Botan9SIMD_2x644rotrILm8EEES0_vQaagtT_Li0EltT_Li64E: 296| 417k| { 297| 417k|#if defined(BOTAN_SIMD_USE_SSSE3) 298| 417k| if constexpr(ROT == 8) { 299| 417k| const auto tab = _mm_setr_epi8(1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8); 300| 417k| 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| 417k| } _ZNK5Botan9SIMD_2x643shrILi7EEES0_v: 376| 417k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 shr() const noexcept { 377| 417k|#if defined(BOTAN_SIMD_USE_SSSE3) 378| 417k| 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| 417k| } _ZNK5Botan9SIMD_2x644rotrILm19EEES0_vQaagtT_Li0EltT_Li64E: 296| 417k| { 297| 417k|#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| 417k| } else { 311| 417k| return SIMD_2x64(_mm_or_si128(_mm_srli_epi64(m_simd, static_cast(ROT)), 312| 417k| _mm_slli_epi64(m_simd, static_cast(64 - ROT)))); 313| 417k| } 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| 417k| } _ZNK5Botan9SIMD_2x644rotrILm61EEES0_vQaagtT_Li0EltT_Li64E: 296| 417k| { 297| 417k|#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| 417k| } else { 311| 417k| return SIMD_2x64(_mm_or_si128(_mm_srli_epi64(m_simd, static_cast(ROT)), 312| 417k| _mm_slli_epi64(m_simd, static_cast(64 - ROT)))); 313| 417k| } 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| 417k| } _ZNK5Botan9SIMD_2x643shrILi6EEES0_v: 376| 417k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 shr() const noexcept { 377| 417k|#if defined(BOTAN_SIMD_USE_SSSE3) 378| 417k| 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| 417k| } _ZN5Botan9SIMD_4x32C2Ev: 82| 787| BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32() noexcept { 83| 787|#if defined(BOTAN_SIMD_USE_SSSE3) 84| 787| m_simd = _mm_setzero_si128(); 85| |#elif defined(BOTAN_SIMD_USE_VSX) 86| | m_simd = vec_splat_u32(0); 87| |#elif defined(BOTAN_SIMD_USE_NEON) 88| | m_simd = vdupq_n_u32(0); 89| |#elif defined(BOTAN_SIMD_USE_LSX) 90| | m_simd = __lsx_vldi(0); 91| |#elif defined(BOTAN_SIMD_USE_SIMD128) 92| | m_simd = wasm_u32x4_const_splat(0); 93| |#endif 94| 787| } _ZN5Botan9SIMD_4x3212byte_shuffleERKS0_S2_: 796| 112k| static inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 byte_shuffle(const SIMD_4x32& tbl, const SIMD_4x32& idx) { 797| 112k|#if defined(BOTAN_SIMD_USE_SSSE3) 798| 112k| return SIMD_4x32(_mm_shuffle_epi8(tbl.raw(), idx.raw())); 799| |#elif defined(BOTAN_SIMD_USE_NEON) 800| | const uint8x16_t tbl8 = vreinterpretq_u8_u32(tbl.raw()); 801| | const uint8x16_t idx8 = vreinterpretq_u8_u32(idx.raw()); 802| | 803| | #if defined(BOTAN_TARGET_ARCH_IS_ARM32) 804| | const uint8x8x2_t tbl2 = {vget_low_u8(tbl8), vget_high_u8(tbl8)}; 805| | 806| | return SIMD_4x32( 807| | vreinterpretq_u32_u8(vcombine_u8(vtbl2_u8(tbl2, vget_low_u8(idx8)), vtbl2_u8(tbl2, vget_high_u8(idx8))))); 808| | #else 809| | return SIMD_4x32(vreinterpretq_u32_u8(vqtbl1q_u8(tbl8, idx8))); 810| | #endif 811| | 812| |#elif defined(BOTAN_SIMD_USE_VSX) 813| | if constexpr(std::endian::native == std::endian::big) { 814| | // vec_perm numbers the bytes in big-endian order 815| | return SIMD_4x32::altivec_perm(tbl.bswap(), idx.bswap()).bswap(); 816| | } else { 817| | return SIMD_4x32::altivec_perm(tbl, idx); 818| | } 819| |#elif defined(BOTAN_SIMD_USE_LSX) 820| | return SIMD_4x32(__lsx_vshuf_b(tbl.raw(), tbl.raw(), idx.raw())); 821| |#elif defined(BOTAN_SIMD_USE_SIMD128) 822| | return SIMD_4x32(wasm_i8x16_swizzle(tbl.raw(), idx.raw())); 823| |#endif 824| 112k| } _ZNK5Botan9SIMD_4x323rawEv: 964| 44.5M| native_simd_type BOTAN_FN_ISA_SIMD_4X32 raw() const noexcept { return m_simd; } _ZN5Botan9SIMD_4x32C2EDv2_x: 966| 25.5M| explicit BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32(native_simd_type x) noexcept : m_simd(x) {} _ZN5Botan9SIMD_4x327load_leEPKv: 183| 2.70M| static SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 load_le(const void* in) noexcept { 184| 2.70M| if constexpr(std::endian::native == std::endian::little) { 185| 2.70M| return SIMD_4x32::load_native(in); 186| | } else { 187| | return SIMD_4x32::load_native(in).bswap(); 188| | } 189| 2.70M| } _ZN5Botan9SIMD_4x3211load_nativeEPKv: 166| 3.64M| static SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 load_native(const void* in) noexcept { 167| 3.64M|#if defined(BOTAN_SIMD_USE_SSSE3) 168| 3.64M| 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.64M| } _ZN5Botan9SIMD_4x32C2Ejjjj: 99| 187k| BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32(uint32_t B0, uint32_t B1, uint32_t B2, uint32_t B3) noexcept { 100| 187k|#if defined(BOTAN_SIMD_USE_SSSE3) 101| 187k| 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| 187k| } _ZN5Botan9SIMD_4x3210byte_blendERKS0_S2_S2_: 755| 17.8k| const SIMD_4x32& b) noexcept { 756| | // TODO(SSE4.1) could use _mm_blendv_epi8 here 757| 17.8k| return SIMD_4x32::choose(mask, a, b); 758| 17.8k| } _ZN5Botan9SIMD_4x326chooseERKS0_S2_S2_: 732| 17.8k| const SIMD_4x32& b) noexcept { 733| |#if defined(BOTAN_SIMD_USE_VSX) 734| | return SIMD_4x32(vec_sel(b.raw(), a.raw(), mask.raw())); 735| |#elif defined(BOTAN_SIMD_USE_NEON) 736| | return SIMD_4x32(vbslq_u32(mask.raw(), a.raw(), b.raw())); 737| |#elif defined(BOTAN_SIMD_USE_LSX) 738| | return SIMD_4x32(__lsx_vbitsel_v(b.raw(), a.raw(), mask.raw())); 739| |#elif defined(BOTAN_SIMD_USE_SIMD128) 740| | return SIMD_4x32(wasm_v128_bitselect(a.raw(), b.raw(), mask.raw())); 741| |#else 742| 17.8k| return (mask & a) ^ mask.andc(b); 743| 17.8k|#endif 744| 17.8k| } _ZNK5Botan9SIMD_4x32anERKS0_: 388| 75.3k| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 operator&(const SIMD_4x32& other) const noexcept { 389| 75.3k| SIMD_4x32 retval(*this); 390| 75.3k| retval &= other; 391| 75.3k| return retval; 392| 75.3k| } _ZN5Botan9SIMD_4x32aNERKS0_: 452| 75.3k| void BOTAN_FN_ISA_SIMD_4X32 operator&=(const SIMD_4x32& other) noexcept { 453| 75.3k|#if defined(BOTAN_SIMD_USE_SSSE3) 454| 75.3k| m_simd = _mm_and_si128(m_simd, other.m_simd); 455| |#elif defined(BOTAN_SIMD_USE_VSX) 456| | m_simd = vec_and(m_simd, other.m_simd); 457| |#elif defined(BOTAN_SIMD_USE_NEON) 458| | m_simd = vandq_u32(m_simd, other.m_simd); 459| |#elif defined(BOTAN_SIMD_USE_LSX) 460| | m_simd = __lsx_vand_v(m_simd, other.m_simd); 461| |#elif defined(BOTAN_SIMD_USE_SIMD128) 462| | m_simd = wasm_v128_and(m_simd, other.m_simd); 463| |#endif 464| 75.3k| } _ZNK5Botan9SIMD_4x32eoERKS0_: 370| 97.9k| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 operator^(const SIMD_4x32& other) const noexcept { 371| 97.9k| SIMD_4x32 retval(*this); 372| 97.9k| retval ^= other; 373| 97.9k| return retval; 374| 97.9k| } _ZNK5Botan9SIMD_4x324andcERKS0_: 515| 17.8k| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 andc(const SIMD_4x32& other) const noexcept { 516| 17.8k|#if defined(BOTAN_SIMD_USE_SSSE3) 517| 17.8k| return SIMD_4x32(_mm_andnot_si128(m_simd, other.m_simd)); 518| |#elif defined(BOTAN_SIMD_USE_VSX) 519| | /* 520| | AltiVec does arg1 & ~arg2 rather than SSE's ~arg1 & arg2 521| | so swap the arguments 522| | */ 523| | return SIMD_4x32(vec_andc(other.m_simd, m_simd)); 524| |#elif defined(BOTAN_SIMD_USE_NEON) 525| | // NEON is also a & ~b 526| | return SIMD_4x32(vbicq_u32(other.m_simd, m_simd)); 527| |#elif defined(BOTAN_SIMD_USE_LSX) 528| | // LSX is ~a & b 529| | return SIMD_4x32(__lsx_vandn_v(m_simd, other.m_simd)); 530| |#elif defined(BOTAN_SIMD_USE_SIMD128) 531| | // SIMD128 is a & ~b 532| | return SIMD_4x32(wasm_v128_andnot(other.m_simd, m_simd)); 533| |#endif 534| 17.8k| } _ZNK5Botan9SIMD_4x3211swap_halvesEv: 930| 3.21k| inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 swap_halves() const { 931| 3.21k|#if defined(BOTAN_SIMD_USE_SSSE3) 932| 3.21k| return SIMD_4x32(_mm_shuffle_epi32(raw(), 0b01001110)); 933| |#else 934| | return SIMD_4x32::alignr8(*this, *this); 935| |#endif 936| 3.21k| } _ZN5Botan9SIMD_4x32eOERKS0_: 422| 1.65M| void BOTAN_FN_ISA_SIMD_4X32 operator^=(const SIMD_4x32& other) noexcept { 423| 1.65M|#if defined(BOTAN_SIMD_USE_SSSE3) 424| 1.65M| 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| 1.65M| } _ZN5Botan9SIMD_4x328splat_u8Eh: 140| 28.0k| static SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 splat_u8(uint8_t B) noexcept { 141| 28.0k|#if defined(BOTAN_SIMD_USE_SSSE3) 142| 28.0k| return SIMD_4x32(_mm_set1_epi8(B)); 143| |#elif defined(BOTAN_SIMD_USE_NEON) 144| | /* 145| | * Do not use vdupq_n_u8 here. MSVC ARM64 (VS 17.13 through at least 146| | * VS 18.6) can fold vand(vdupq_n_u8(k), vdupq_n_u32(x)) into a scalar 147| | * and+dup which wrongly uses the 8-bit k as the 32-bit immediate, 148| | * computing dup(x & k) instead of dup(x) & splat_u8(k). This 149| | * miscompiled the SM4 key schedule. Broadcasting an explicitly 150| | * replicated 32-bit value avoids the bad fold; GCC and Clang generate 151| | * identical code either way. 152| | */ 153| | return SIMD_4x32(vdupq_n_u32(static_cast(B) * 0x01010101U)); 154| |#elif defined(BOTAN_SIMD_USE_LSX) 155| | return SIMD_4x32(__lsx_vreplgr2vr_b(B)); 156| |#elif defined(BOTAN_SIMD_USE_SIMD128) 157| | return SIMD_4x32(wasm_u8x16_splat(B)); 158| |#elif defined(BOTAN_SIMD_USE_VSX) 159| | return SIMD_4x32(reinterpret_cast<__vector unsigned int>(vec_splats(static_cast(B)))); 160| |#endif 161| 28.0k| } _ZNK5Botan9SIMD_4x323shrILi4EEES0_v: 485| 28.0k| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 shr() const noexcept { 486| 28.0k|#if defined(BOTAN_SIMD_USE_SSSE3) 487| 28.0k| return SIMD_4x32(_mm_srli_epi32(m_simd, SHIFT)); 488| | 489| |#elif defined(BOTAN_SIMD_USE_VSX) 490| | return SIMD_4x32(vec_sr(m_simd, vec_splats(static_cast(SHIFT)))); 491| |#elif defined(BOTAN_SIMD_USE_NEON) 492| | return SIMD_4x32(vshrq_n_u32(m_simd, SHIFT)); 493| |#elif defined(BOTAN_SIMD_USE_LSX) 494| | return SIMD_4x32(__lsx_vsrli_w(m_simd, SHIFT)); 495| |#elif defined(BOTAN_SIMD_USE_SIMD128) 496| | return SIMD_4x32(wasm_u32x4_shr(m_simd, SHIFT)); 497| |#endif 498| 28.0k| } _ZN5Botan9SIMD_4x3219masked_byte_shuffleERKS0_S2_: 836| 5.20k| inline static SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 masked_byte_shuffle(const SIMD_4x32& tbl, const SIMD_4x32& idx) { 837| |#if defined(BOTAN_SIMD_USE_VSX) 838| | if constexpr(std::endian::native == std::endian::big) { 839| | // vec_perm numbers the bytes in big-endian order 840| | return SIMD_4x32::altivec_masked_perm(tbl.bswap(), idx.bswap()).bswap(); 841| | } else { 842| | return SIMD_4x32::altivec_masked_perm(tbl, idx); 843| | } 844| |#elif defined(BOTAN_SIMD_USE_LSX) 845| | /* 846| | * The behavior of vshuf.b unfortunately differs among microarchitectures 847| | * when the index is larger than the available elements. In LA664 CPUs, 848| | * larger indices result in a zero byte, which is exactly what we want. 849| | * Unfortunately on LA464 machines, the output is instead undefined. 850| | * 851| | * So we must use a slower sequence that handles the larger indices. 852| | * If we had a way of knowing at compile time that we are on an LA664 853| | * or later, we could use __lsx_vshuf_b without the comparison or select. 854| | */ 855| | const auto zero = __lsx_vldi(0); 856| | const auto r = __lsx_vshuf_b(zero, tbl.raw(), idx.raw()); 857| | const auto mask = __lsx_vslti_bu(idx.raw(), 16); 858| | return SIMD_4x32(__lsx_vbitsel_v(zero, r, mask)); 859| |#else 860| | // ARM, x86 and Wasm byte shuffles have the behavior we want for out of range idx 861| 5.20k| return SIMD_4x32::byte_shuffle(tbl, idx); 862| 5.20k|#endif 863| 5.20k| } _ZN5Botan9SIMD_4x325splatEj: 123| 6.80k| static SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 splat(uint32_t B) noexcept { 124| 6.80k|#if defined(BOTAN_SIMD_USE_SSSE3) 125| 6.80k| return SIMD_4x32(_mm_set1_epi32(B)); 126| |#elif defined(BOTAN_SIMD_USE_NEON) 127| | return SIMD_4x32(vdupq_n_u32(B)); 128| |#elif defined(BOTAN_SIMD_USE_LSX) 129| | return SIMD_4x32(__lsx_vreplgr2vr_w(B)); 130| |#elif defined(BOTAN_SIMD_USE_SIMD128) 131| | return SIMD_4x32(wasm_u32x4_splat(B)); 132| |#elif defined(BOTAN_SIMD_USE_VSX) 133| | return SIMD_4x32(vec_splats(static_cast(B))); 134| |#endif 135| 6.80k| } _ZNK5Botan9SIMD_4x324rotlILm1EEES0_vQaagtT_Li0EltT_Li32E: 299| 1.24k| { 300| 1.24k|#if defined(BOTAN_SIMD_USE_SSSE3) 301| | if constexpr(ROT == 8) { 302| | const auto shuf_rotl_8 = _mm_set_epi64x(0x0e0d0c0f0a09080b, 0x0605040702010003); 303| | return SIMD_4x32(_mm_shuffle_epi8(raw(), shuf_rotl_8)); 304| | } else if constexpr(ROT == 16) { 305| | const auto shuf_rotl_16 = _mm_set_epi64x(0x0d0c0f0e09080b0a, 0x0504070601000302); 306| | return SIMD_4x32(_mm_shuffle_epi8(raw(), shuf_rotl_16)); 307| | } else if constexpr(ROT == 24) { 308| | const auto shuf_rotl_24 = _mm_set_epi64x(0x0c0f0e0d080b0a09, 0x0407060500030201); 309| | return SIMD_4x32(_mm_shuffle_epi8(raw(), shuf_rotl_24)); 310| 1.24k| } else { 311| 1.24k| return SIMD_4x32(_mm_xor_si128(_mm_slli_epi32(raw(), static_cast(ROT)), 312| 1.24k| _mm_srli_epi32(raw(), static_cast(32 - ROT)))); 313| 1.24k| } 314| | 315| |#elif defined(BOTAN_SIMD_USE_VSX) 316| | 317| | return SIMD_4x32(vec_rl(m_simd, vec_splats(static_cast(ROT)))); 318| | 319| |#elif defined(BOTAN_SIMD_USE_NEON) && defined(BOTAN_TARGET_ARCH_IS_ARM64) 320| | 321| | if constexpr(ROT == 8) { 322| | const uint8_t maskb[16] = {3, 0, 1, 2, 7, 4, 5, 6, 11, 8, 9, 10, 15, 12, 13, 14}; 323| | const uint8x16_t mask = vld1q_u8(maskb); 324| | return SIMD_4x32(vreinterpretq_u32_u8(vqtbl1q_u8(vreinterpretq_u8_u32(m_simd), mask))); 325| | } else if constexpr(ROT == 16) { 326| | return SIMD_4x32(vreinterpretq_u32_u16(vrev32q_u16(vreinterpretq_u16_u32(m_simd)))); 327| | } else { 328| | return SIMD_4x32( 329| | vorrq_u32(vshlq_n_u32(m_simd, static_cast(ROT)), vshrq_n_u32(m_simd, static_cast(32 - ROT)))); 330| | } 331| |#elif defined(BOTAN_SIMD_USE_NEON) 332| | return SIMD_4x32( 333| | vorrq_u32(vshlq_n_u32(m_simd, static_cast(ROT)), vshrq_n_u32(m_simd, static_cast(32 - ROT)))); 334| |#elif defined(BOTAN_SIMD_USE_LSX) 335| | return SIMD_4x32(__lsx_vrotri_w(raw(), 32 - ROT)); 336| |#elif defined(BOTAN_SIMD_USE_SIMD128) 337| | return SIMD_4x32(wasm_v128_or(wasm_i32x4_shl(m_simd, ROT), wasm_u32x4_shr(m_simd, 32 - ROT))); 338| |#endif 339| 1.24k| } _ZNK5Botan9SIMD_4x32orERKS0_: 379| 1.33k| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 operator|(const SIMD_4x32& other) const noexcept { 380| 1.33k| SIMD_4x32 retval(*this); 381| 1.33k| retval |= other; 382| 1.33k| return retval; 383| 1.33k| } _ZN5Botan9SIMD_4x32oRERKS0_: 438| 1.33k| void BOTAN_FN_ISA_SIMD_4X32 operator|=(const SIMD_4x32& other) noexcept { 439| 1.33k|#if defined(BOTAN_SIMD_USE_SSSE3) 440| 1.33k| m_simd = _mm_or_si128(m_simd, other.m_simd); 441| |#elif defined(BOTAN_SIMD_USE_VSX) 442| | m_simd = vec_or(m_simd, other.m_simd); 443| |#elif defined(BOTAN_SIMD_USE_NEON) 444| | m_simd = vorrq_u32(m_simd, other.m_simd); 445| |#elif defined(BOTAN_SIMD_USE_LSX) 446| | m_simd = __lsx_vor_v(m_simd, other.m_simd); 447| |#elif defined(BOTAN_SIMD_USE_SIMD128) 448| | m_simd = wasm_v128_or(m_simd, other.m_simd); 449| |#endif 450| 1.33k| } _ZNK5Botan9SIMD_4x328store_leEPh: 242| 279k| void BOTAN_FN_ISA_SIMD_4X32 store_le(uint8_t out[]) const noexcept { 243| 279k| if constexpr(std::endian::native == std::endian::little) { 244| 279k| this->store_native(out); 245| | } else { 246| | this->bswap().store_native(out); 247| | } 248| 279k| } _ZNK5Botan9SIMD_4x3212store_nativeEPv: 225| 280k| void BOTAN_FN_ISA_SIMD_4X32 store_native(void* out) const noexcept { 226| 280k|#if defined(BOTAN_SIMD_USE_SSSE3) 227| 280k| _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| 280k| } _ZN5Botan9SIMD_4x327load_beEPKv: 194| 947k| 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| 947k| } else { 198| 947k| return SIMD_4x32::load_native(in).bswap(); 199| 947k| } 200| 947k| } _ZNK5Botan9SIMD_4x328store_leEPj: 210| 266k| void BOTAN_FN_ISA_SIMD_4X32 store_le(uint32_t out[4]) const noexcept { 211| 266k| this->store_le(reinterpret_cast(out)); 212| 266k| } _ZNK5Botan9SIMD_4x328store_leEPm: 218| 572| void BOTAN_FN_ISA_SIMD_4X32 store_le(uint64_t out[2]) const noexcept { 219| 572| this->store_le(reinterpret_cast(out)); 220| 572| } _ZNK5Botan9SIMD_4x328store_beEPh: 253| 288| void BOTAN_FN_ISA_SIMD_4X32 store_be(uint8_t out[]) const noexcept { 254| | if constexpr(std::endian::native == std::endian::big) { 255| | this->store_native(out); 256| 288| } else { 257| 288| this->bswap().store_native(out); 258| 288| } 259| 288| } _ZNK5Botan9SIMD_4x32plERKS0_: 352| 2.46M| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 operator+(const SIMD_4x32& other) const noexcept { 353| 2.46M| SIMD_4x32 retval(*this); 354| 2.46M| retval += other; 355| 2.46M| return retval; 356| 2.46M| } _ZN5Botan9SIMD_4x32pLERKS0_: 394| 4.62M| void BOTAN_FN_ISA_SIMD_4X32 operator+=(const SIMD_4x32& other) noexcept { 395| 4.62M|#if defined(BOTAN_SIMD_USE_SSSE3) 396| 4.62M| 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.62M| } _ZNK5Botan9SIMD_4x3217reverse_all_bytesEv: 536| 3.27k| BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32 reverse_all_bytes() const { 537| 3.27k| const auto rev_idx = SIMD_4x32(0x0C0D0E0F, 0x08090A0B, 0x04050607, 0x00010203); 538| 3.27k| return SIMD_4x32::byte_shuffle(*this, rev_idx); 539| 3.27k| } _ZNK5Botan9SIMD_4x325bswapEv: 544| 949k| BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32 bswap() const noexcept { 545| 949k|#if defined(BOTAN_SIMD_USE_SSSE3) 546| 949k| const auto idx = _mm_set_epi8(12, 13, 14, 15, 8, 9, 10, 11, 4, 5, 6, 7, 0, 1, 2, 3); 547| | 548| 949k| 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| 949k| } _ZN5Botan9SIMD_4x329transposeERS0_S1_S1_S1_: 644| 2.16k| SIMD_4x32& B3) noexcept { 645| 2.16k|#if defined(BOTAN_SIMD_USE_SSSE3) 646| 2.16k| const __m128i T0 = _mm_unpacklo_epi32(B0.m_simd, B1.m_simd); 647| 2.16k| const __m128i T1 = _mm_unpacklo_epi32(B2.m_simd, B3.m_simd); 648| 2.16k| const __m128i T2 = _mm_unpackhi_epi32(B0.m_simd, B1.m_simd); 649| 2.16k| const __m128i T3 = _mm_unpackhi_epi32(B2.m_simd, B3.m_simd); 650| | 651| 2.16k| B0.m_simd = _mm_unpacklo_epi64(T0, T1); 652| 2.16k| B1.m_simd = _mm_unpackhi_epi64(T0, T1); 653| 2.16k| B2.m_simd = _mm_unpacklo_epi64(T2, T3); 654| 2.16k| B3.m_simd = _mm_unpackhi_epi64(T2, T3); 655| |#elif defined(BOTAN_SIMD_USE_VSX) 656| | const __vector unsigned int T0 = vec_mergeh(B0.m_simd, B2.m_simd); 657| | const __vector unsigned int T1 = vec_mergeh(B1.m_simd, B3.m_simd); 658| | const __vector unsigned int T2 = vec_mergel(B0.m_simd, B2.m_simd); 659| | const __vector unsigned int T3 = vec_mergel(B1.m_simd, B3.m_simd); 660| | 661| | B0.m_simd = vec_mergeh(T0, T1); 662| | B1.m_simd = vec_mergel(T0, T1); 663| | B2.m_simd = vec_mergeh(T2, T3); 664| | B3.m_simd = vec_mergel(T2, T3); 665| | 666| |#elif defined(BOTAN_SIMD_USE_NEON) && defined(BOTAN_TARGET_ARCH_IS_ARM32) 667| | const uint32x4x2_t T0 = vzipq_u32(B0.m_simd, B2.m_simd); 668| | const uint32x4x2_t T1 = vzipq_u32(B1.m_simd, B3.m_simd); 669| | const uint32x4x2_t O0 = vzipq_u32(T0.val[0], T1.val[0]); 670| | const uint32x4x2_t O1 = vzipq_u32(T0.val[1], T1.val[1]); 671| | 672| | B0.m_simd = O0.val[0]; 673| | B1.m_simd = O0.val[1]; 674| | B2.m_simd = O1.val[0]; 675| | B3.m_simd = O1.val[1]; 676| | 677| |#elif defined(BOTAN_SIMD_USE_NEON) && defined(BOTAN_TARGET_ARCH_IS_ARM64) 678| | const uint32x4_t T0 = vzip1q_u32(B0.m_simd, B2.m_simd); 679| | const uint32x4_t T2 = vzip2q_u32(B0.m_simd, B2.m_simd); 680| | const uint32x4_t T1 = vzip1q_u32(B1.m_simd, B3.m_simd); 681| | const uint32x4_t T3 = vzip2q_u32(B1.m_simd, B3.m_simd); 682| | 683| | B0.m_simd = vzip1q_u32(T0, T1); 684| | B1.m_simd = vzip2q_u32(T0, T1); 685| | B2.m_simd = vzip1q_u32(T2, T3); 686| | B3.m_simd = vzip2q_u32(T2, T3); 687| |#elif defined(BOTAN_SIMD_USE_LSX) 688| | const __m128i T0 = __lsx_vilvl_w(B2.raw(), B0.raw()); 689| | const __m128i T1 = __lsx_vilvh_w(B2.raw(), B0.raw()); 690| | const __m128i T2 = __lsx_vilvl_w(B3.raw(), B1.raw()); 691| | const __m128i T3 = __lsx_vilvh_w(B3.raw(), B1.raw()); 692| | B0.m_simd = __lsx_vilvl_w(T2, T0); 693| | B1.m_simd = __lsx_vilvh_w(T2, T0); 694| | B2.m_simd = __lsx_vilvl_w(T3, T1); 695| | B3.m_simd = __lsx_vilvh_w(T3, T1); 696| |#elif defined(BOTAN_SIMD_USE_SIMD128) 697| | const auto T0 = wasm_i32x4_shuffle(B0.m_simd, B2.m_simd, 0, 4, 1, 5); 698| | const auto T2 = wasm_i32x4_shuffle(B0.m_simd, B2.m_simd, 2, 6, 3, 7); 699| | const auto T1 = wasm_i32x4_shuffle(B1.m_simd, B3.m_simd, 0, 4, 1, 5); 700| | const auto T3 = wasm_i32x4_shuffle(B1.m_simd, B3.m_simd, 2, 6, 3, 7); 701| | 702| | B0.m_simd = wasm_i32x4_shuffle(T0, T1, 0, 4, 1, 5); 703| | B1.m_simd = wasm_i32x4_shuffle(T0, T1, 2, 6, 3, 7); 704| | B2.m_simd = wasm_i32x4_shuffle(T2, T3, 0, 4, 1, 5); 705| | B3.m_simd = wasm_i32x4_shuffle(T2, T3, 2, 6, 3, 7); 706| |#endif 707| 2.16k| } _ZN5Botan9SIMD_4x327alignr4ERKS0_S2_: 865| 1.78M| static inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 alignr4(const SIMD_4x32& a, const SIMD_4x32& b) { 866| 1.78M|#if defined(BOTAN_SIMD_USE_SSSE3) 867| 1.78M| 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.78M| } _ZN5Botan9SIMD_4x327alignr8ERKS0_S2_: 882| 210k| static inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 alignr8(const SIMD_4x32& a, const SIMD_4x32& b) { 883| 210k|#if defined(BOTAN_SIMD_USE_SSSE3) 884| 210k| 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| 210k| } _ZNK5Botan9SIMD_4x3212top_bit_maskEv: 905| 97| inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 top_bit_mask() const { 906| 97|#if defined(BOTAN_SIMD_USE_SSSE3) 907| 97| return SIMD_4x32(_mm_shuffle_epi32(_mm_srai_epi32(raw(), 31), 0b11111111)); 908| |#elif defined(BOTAN_SIMD_USE_NEON) 909| | #if defined(BOTAN_TARGET_ARCH_IS_ARM32) 910| | int32x4_t v = vshrq_n_s32(vreinterpretq_s32_u32(raw()), 31); 911| | int32x2_t hi = vget_high_s32(v); 912| | return SIMD_4x32(vreinterpretq_u32_s32(vdupq_lane_s32(hi, 1))); 913| | #else 914| | return SIMD_4x32(vreinterpretq_u32_s32(vdupq_laneq_s32(vshrq_n_s32(vreinterpretq_s32_u32(raw()), 31), 3))); 915| | #endif 916| |#elif defined(BOTAN_SIMD_USE_VSX) 917| | const __vector unsigned int shift = vec_splats(31U); 918| | const __vector signed int shifted = vec_sra(reinterpret_cast<__vector signed int>(raw()), shift); 919| | return SIMD_4x32(reinterpret_cast<__vector unsigned int>(vec_splat(shifted, 3))); 920| |#elif defined(BOTAN_SIMD_USE_LSX) 921| | return SIMD_4x32(__lsx_vshuf4i_w(__lsx_vsrai_w(raw(), 31), 0xFF)); 922| |#elif defined(BOTAN_SIMD_USE_SIMD128) 923| | return SIMD_4x32(wasm_i32x4_splat(wasm_i32x4_extract_lane(wasm_i32x4_shr(raw(), 31), 3))); 924| |#endif 925| 97| } _ZNK5Botan9SIMD_4x324rotlILm8EEES0_vQaagtT_Li0EltT_Li32E: 299| 3.74k| { 300| 3.74k|#if defined(BOTAN_SIMD_USE_SSSE3) 301| 3.74k| if constexpr(ROT == 8) { 302| 3.74k| const auto shuf_rotl_8 = _mm_set_epi64x(0x0e0d0c0f0a09080b, 0x0605040702010003); 303| 3.74k| return SIMD_4x32(_mm_shuffle_epi8(raw(), shuf_rotl_8)); 304| | } else if constexpr(ROT == 16) { 305| | const auto shuf_rotl_16 = _mm_set_epi64x(0x0d0c0f0e09080b0a, 0x0504070601000302); 306| | return SIMD_4x32(_mm_shuffle_epi8(raw(), shuf_rotl_16)); 307| | } else if constexpr(ROT == 24) { 308| | const auto shuf_rotl_24 = _mm_set_epi64x(0x0c0f0e0d080b0a09, 0x0407060500030201); 309| | return SIMD_4x32(_mm_shuffle_epi8(raw(), shuf_rotl_24)); 310| | } else { 311| | return SIMD_4x32(_mm_xor_si128(_mm_slli_epi32(raw(), static_cast(ROT)), 312| | _mm_srli_epi32(raw(), static_cast(32 - ROT)))); 313| | } 314| | 315| |#elif defined(BOTAN_SIMD_USE_VSX) 316| | 317| | return SIMD_4x32(vec_rl(m_simd, vec_splats(static_cast(ROT)))); 318| | 319| |#elif defined(BOTAN_SIMD_USE_NEON) && defined(BOTAN_TARGET_ARCH_IS_ARM64) 320| | 321| | if constexpr(ROT == 8) { 322| | const uint8_t maskb[16] = {3, 0, 1, 2, 7, 4, 5, 6, 11, 8, 9, 10, 15, 12, 13, 14}; 323| | const uint8x16_t mask = vld1q_u8(maskb); 324| | return SIMD_4x32(vreinterpretq_u32_u8(vqtbl1q_u8(vreinterpretq_u8_u32(m_simd), mask))); 325| | } else if constexpr(ROT == 16) { 326| | return SIMD_4x32(vreinterpretq_u32_u16(vrev32q_u16(vreinterpretq_u16_u32(m_simd)))); 327| | } else { 328| | return SIMD_4x32( 329| | vorrq_u32(vshlq_n_u32(m_simd, static_cast(ROT)), vshrq_n_u32(m_simd, static_cast(32 - ROT)))); 330| | } 331| |#elif defined(BOTAN_SIMD_USE_NEON) 332| | return SIMD_4x32( 333| | vorrq_u32(vshlq_n_u32(m_simd, static_cast(ROT)), vshrq_n_u32(m_simd, static_cast(32 - ROT)))); 334| |#elif defined(BOTAN_SIMD_USE_LSX) 335| | return SIMD_4x32(__lsx_vrotri_w(raw(), 32 - ROT)); 336| |#elif defined(BOTAN_SIMD_USE_SIMD128) 337| | return SIMD_4x32(wasm_v128_or(wasm_i32x4_shl(m_simd, ROT), wasm_u32x4_shr(m_simd, 32 - ROT))); 338| |#endif 339| 3.74k| } _ZNK5Botan9SIMD_4x324rotlILm24EEES0_vQaagtT_Li0EltT_Li32E: 299| 3.74k| { 300| 3.74k|#if defined(BOTAN_SIMD_USE_SSSE3) 301| | if constexpr(ROT == 8) { 302| | const auto shuf_rotl_8 = _mm_set_epi64x(0x0e0d0c0f0a09080b, 0x0605040702010003); 303| | return SIMD_4x32(_mm_shuffle_epi8(raw(), shuf_rotl_8)); 304| | } else if constexpr(ROT == 16) { 305| | const auto shuf_rotl_16 = _mm_set_epi64x(0x0d0c0f0e09080b0a, 0x0504070601000302); 306| | return SIMD_4x32(_mm_shuffle_epi8(raw(), shuf_rotl_16)); 307| 3.74k| } else if constexpr(ROT == 24) { 308| 3.74k| const auto shuf_rotl_24 = _mm_set_epi64x(0x0c0f0e0d080b0a09, 0x0407060500030201); 309| 3.74k| return SIMD_4x32(_mm_shuffle_epi8(raw(), shuf_rotl_24)); 310| | } else { 311| | return SIMD_4x32(_mm_xor_si128(_mm_slli_epi32(raw(), static_cast(ROT)), 312| | _mm_srli_epi32(raw(), static_cast(32 - ROT)))); 313| | } 314| | 315| |#elif defined(BOTAN_SIMD_USE_VSX) 316| | 317| | return SIMD_4x32(vec_rl(m_simd, vec_splats(static_cast(ROT)))); 318| | 319| |#elif defined(BOTAN_SIMD_USE_NEON) && defined(BOTAN_TARGET_ARCH_IS_ARM64) 320| | 321| | if constexpr(ROT == 8) { 322| | const uint8_t maskb[16] = {3, 0, 1, 2, 7, 4, 5, 6, 11, 8, 9, 10, 15, 12, 13, 14}; 323| | const uint8x16_t mask = vld1q_u8(maskb); 324| | return SIMD_4x32(vreinterpretq_u32_u8(vqtbl1q_u8(vreinterpretq_u8_u32(m_simd), mask))); 325| | } else if constexpr(ROT == 16) { 326| | return SIMD_4x32(vreinterpretq_u32_u16(vrev32q_u16(vreinterpretq_u16_u32(m_simd)))); 327| | } else { 328| | return SIMD_4x32( 329| | vorrq_u32(vshlq_n_u32(m_simd, static_cast(ROT)), vshrq_n_u32(m_simd, static_cast(32 - ROT)))); 330| | } 331| |#elif defined(BOTAN_SIMD_USE_NEON) 332| | return SIMD_4x32( 333| | vorrq_u32(vshlq_n_u32(m_simd, static_cast(ROT)), vshrq_n_u32(m_simd, static_cast(32 - ROT)))); 334| |#elif defined(BOTAN_SIMD_USE_LSX) 335| | return SIMD_4x32(__lsx_vrotri_w(raw(), 32 - ROT)); 336| |#elif defined(BOTAN_SIMD_USE_SIMD128) 337| | return SIMD_4x32(wasm_v128_or(wasm_i32x4_shl(m_simd, ROT), wasm_u32x4_shr(m_simd, 32 - ROT))); 338| |#endif 339| 3.74k| } _ZNK5Botan9SIMD_4x3212extract_wordILm3EEEjv: 942| 50.4k| inline uint32_t BOTAN_FN_ISA_SIMD_4X32 extract_word() const noexcept { 943| 50.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| 50.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| 50.4k| } 961| 50.4k|#endif 962| 50.4k| } _ZNK5Botan9SIMD_4x3217shift_elems_rightILm2EEES0_vQleT_Li3E: 601| 2.38M| { 602| 2.38M|#if defined(BOTAN_SIMD_USE_SSSE3) 603| 2.38M| 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.38M| } _ZNK5Botan9SIMD_4x324rotlILm16EEES0_vQaagtT_Li0EltT_Li32E: 299| 2.95k| { 300| 2.95k|#if defined(BOTAN_SIMD_USE_SSSE3) 301| | if constexpr(ROT == 8) { 302| | const auto shuf_rotl_8 = _mm_set_epi64x(0x0e0d0c0f0a09080b, 0x0605040702010003); 303| | return SIMD_4x32(_mm_shuffle_epi8(raw(), shuf_rotl_8)); 304| 2.95k| } else if constexpr(ROT == 16) { 305| 2.95k| const auto shuf_rotl_16 = _mm_set_epi64x(0x0d0c0f0e09080b0a, 0x0504070601000302); 306| 2.95k| return SIMD_4x32(_mm_shuffle_epi8(raw(), shuf_rotl_16)); 307| | } else if constexpr(ROT == 24) { 308| | const auto shuf_rotl_24 = _mm_set_epi64x(0x0c0f0e0d080b0a09, 0x0407060500030201); 309| | return SIMD_4x32(_mm_shuffle_epi8(raw(), shuf_rotl_24)); 310| | } else { 311| | return SIMD_4x32(_mm_xor_si128(_mm_slli_epi32(raw(), static_cast(ROT)), 312| | _mm_srli_epi32(raw(), static_cast(32 - ROT)))); 313| | } 314| | 315| |#elif defined(BOTAN_SIMD_USE_VSX) 316| | 317| | return SIMD_4x32(vec_rl(m_simd, vec_splats(static_cast(ROT)))); 318| | 319| |#elif defined(BOTAN_SIMD_USE_NEON) && defined(BOTAN_TARGET_ARCH_IS_ARM64) 320| | 321| | if constexpr(ROT == 8) { 322| | const uint8_t maskb[16] = {3, 0, 1, 2, 7, 4, 5, 6, 11, 8, 9, 10, 15, 12, 13, 14}; 323| | const uint8x16_t mask = vld1q_u8(maskb); 324| | return SIMD_4x32(vreinterpretq_u32_u8(vqtbl1q_u8(vreinterpretq_u8_u32(m_simd), mask))); 325| | } else if constexpr(ROT == 16) { 326| | return SIMD_4x32(vreinterpretq_u32_u16(vrev32q_u16(vreinterpretq_u16_u32(m_simd)))); 327| | } else { 328| | return SIMD_4x32( 329| | vorrq_u32(vshlq_n_u32(m_simd, static_cast(ROT)), vshrq_n_u32(m_simd, static_cast(32 - ROT)))); 330| | } 331| |#elif defined(BOTAN_SIMD_USE_NEON) 332| | return SIMD_4x32( 333| | vorrq_u32(vshlq_n_u32(m_simd, static_cast(ROT)), vshrq_n_u32(m_simd, static_cast(32 - ROT)))); 334| |#elif defined(BOTAN_SIMD_USE_LSX) 335| | return SIMD_4x32(__lsx_vrotri_w(raw(), 32 - ROT)); 336| |#elif defined(BOTAN_SIMD_USE_SIMD128) 337| | return SIMD_4x32(wasm_v128_or(wasm_i32x4_shl(m_simd, ROT), wasm_u32x4_shr(m_simd, 32 - ROT))); 338| |#endif 339| 2.95k| } _ZNK5Botan9SIMD_4x3216shift_elems_leftILm2EEES0_vQleT_Li3E: 564| 1.11k| { 565| 1.11k|#if defined(BOTAN_SIMD_USE_SSSE3) 566| 1.11k| return SIMD_4x32(_mm_slli_si128(raw(), 4 * I)); 567| |#elif defined(BOTAN_SIMD_USE_NEON) 568| | return SIMD_4x32(vextq_u32(vdupq_n_u32(0), raw(), 4 - I)); 569| |#elif defined(BOTAN_SIMD_USE_VSX) 570| | const __vector unsigned int zero = vec_splat_u32(0); 571| | 572| | const __vector unsigned char shuf[3] = { 573| | {16, 17, 18, 19, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}, 574| | {16, 17, 18, 19, 20, 21, 22, 23, 0, 1, 2, 3, 4, 5, 6, 7}, 575| | {16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 0, 1, 2, 3}, 576| | }; 577| | 578| | return SIMD_4x32(vec_perm(raw(), zero, shuf[I - 1])); 579| |#elif defined(BOTAN_SIMD_USE_LSX) 580| | return SIMD_4x32(__lsx_vbsll_v(raw(), 4 * I)); 581| |#elif defined(BOTAN_SIMD_USE_SIMD128) 582| | if constexpr(I == 0) { 583| | return SIMD_4x32(m_simd); 584| | } 585| | 586| | const auto zero = wasm_u32x4_const_splat(0); 587| | if constexpr(I == 1) { 588| | return SIMD_4x32(wasm_i8x16_shuffle(m_simd, zero, 16, 16, 16, 16, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11)); 589| | } 590| | if constexpr(I == 2) { 591| | return SIMD_4x32(wasm_i8x16_shuffle(m_simd, zero, 16, 16, 16, 16, 16, 16, 16, 16, 0, 1, 2, 3, 4, 5, 6, 7)); 592| | } 593| | 594| | return SIMD_4x32(wasm_i8x16_shuffle(m_simd, zero, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 0, 1, 2, 3)); 595| |#endif 596| 1.11k| } _ZNK5Botan9SIMD_4x323shrILi31EEES0_v: 485| 97| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 shr() const noexcept { 486| 97|#if defined(BOTAN_SIMD_USE_SSSE3) 487| 97| return SIMD_4x32(_mm_srli_epi32(m_simd, SHIFT)); 488| | 489| |#elif defined(BOTAN_SIMD_USE_VSX) 490| | return SIMD_4x32(vec_sr(m_simd, vec_splats(static_cast(SHIFT)))); 491| |#elif defined(BOTAN_SIMD_USE_NEON) 492| | return SIMD_4x32(vshrq_n_u32(m_simd, SHIFT)); 493| |#elif defined(BOTAN_SIMD_USE_LSX) 494| | return SIMD_4x32(__lsx_vsrli_w(m_simd, SHIFT)); 495| |#elif defined(BOTAN_SIMD_USE_SIMD128) 496| | return SIMD_4x32(wasm_u32x4_shr(m_simd, SHIFT)); 497| |#endif 498| 97| } _ZNK5Botan9SIMD_4x3216shift_elems_leftILm1EEES0_vQleT_Li3E: 564| 7.86k| { 565| 7.86k|#if defined(BOTAN_SIMD_USE_SSSE3) 566| 7.86k| return SIMD_4x32(_mm_slli_si128(raw(), 4 * I)); 567| |#elif defined(BOTAN_SIMD_USE_NEON) 568| | return SIMD_4x32(vextq_u32(vdupq_n_u32(0), raw(), 4 - I)); 569| |#elif defined(BOTAN_SIMD_USE_VSX) 570| | const __vector unsigned int zero = vec_splat_u32(0); 571| | 572| | const __vector unsigned char shuf[3] = { 573| | {16, 17, 18, 19, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}, 574| | {16, 17, 18, 19, 20, 21, 22, 23, 0, 1, 2, 3, 4, 5, 6, 7}, 575| | {16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 0, 1, 2, 3}, 576| | }; 577| | 578| | return SIMD_4x32(vec_perm(raw(), zero, shuf[I - 1])); 579| |#elif defined(BOTAN_SIMD_USE_LSX) 580| | return SIMD_4x32(__lsx_vbsll_v(raw(), 4 * I)); 581| |#elif defined(BOTAN_SIMD_USE_SIMD128) 582| | if constexpr(I == 0) { 583| | return SIMD_4x32(m_simd); 584| | } 585| | 586| | const auto zero = wasm_u32x4_const_splat(0); 587| | if constexpr(I == 1) { 588| | return SIMD_4x32(wasm_i8x16_shuffle(m_simd, zero, 16, 16, 16, 16, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11)); 589| | } 590| | if constexpr(I == 2) { 591| | return SIMD_4x32(wasm_i8x16_shuffle(m_simd, zero, 16, 16, 16, 16, 16, 16, 16, 16, 0, 1, 2, 3, 4, 5, 6, 7)); 592| | } 593| | 594| | return SIMD_4x32(wasm_i8x16_shuffle(m_simd, zero, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 0, 1, 2, 3)); 595| |#endif 596| 7.86k| } _ZNK5Botan9SIMD_4x323shlILi1EEES0_vQaagtT_Li0EltT_Li32E: 469| 97| { 470| 97|#if defined(BOTAN_SIMD_USE_SSSE3) 471| 97| return SIMD_4x32(_mm_slli_epi32(m_simd, SHIFT)); 472| | 473| |#elif defined(BOTAN_SIMD_USE_VSX) 474| | return SIMD_4x32(vec_sl(m_simd, vec_splats(static_cast(SHIFT)))); 475| |#elif defined(BOTAN_SIMD_USE_NEON) 476| | return SIMD_4x32(vshlq_n_u32(m_simd, SHIFT)); 477| |#elif defined(BOTAN_SIMD_USE_LSX) 478| | return SIMD_4x32(__lsx_vslli_w(m_simd, SHIFT)); 479| |#elif defined(BOTAN_SIMD_USE_SIMD128) 480| | return SIMD_4x32(wasm_i32x4_shl(m_simd, SHIFT)); 481| |#endif 482| 97| } _ZN5Botan9SIMD_4x64C2Ev: 33| 3.07k| BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64() : m_simd(_mm256_setzero_si256()) {} _ZNK5Botan9SIMD_4x645bswapEv: 65| 3.07k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 bswap() const { 66| 3.07k| const auto idx = _mm256_set_epi8( 67| 3.07k| 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.07k| return SIMD_4x64(_mm256_shuffle_epi8(m_simd, idx)); 70| 3.07k| } _ZN5Botan9SIMD_4x64C2EDv4_x: 267| 119k| explicit BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64(__m256i x) : m_simd(x) {} _ZN5Botan9SIMD_4x64eOERKS0_: 112| 49.1k| BOTAN_FN_ISA_SIMD_4X64 void operator^=(const SIMD_4x64& other) { 113| 49.1k| m_simd = _mm256_xor_si256(m_simd, other.m_simd); 114| 49.1k| } _ZNK5Botan9SIMD_4x64eoERKS0_: 90| 49.1k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 operator^(const SIMD_4x64& other) const { 91| 49.1k| SIMD_4x64 retval(*this); 92| 49.1k| retval ^= other; 93| 49.1k| return retval; 94| 49.1k| } _ZN5Botan9SIMD_4x648load_le2EPKvS2_: 36| 3.07k| static BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64 load_le2(const void* lo, const void* hi) { 37| 3.07k| return SIMD_4x64( 38| 3.07k| _mm256_loadu2_m128i(reinterpret_cast(lo), reinterpret_cast(hi))); 39| 3.07k| } _ZN5Botan9SIMD_4x648load_be2EPKvS2_: 41| 3.07k| static BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64 load_be2(const void* lo, const void* hi) { 42| 3.07k| return SIMD_4x64::load_le2(lo, hi).bswap(); 43| 3.07k| } _ZN5Botan9SIMD_4x6414broadcast_2x64EPKm: 61| 15.3k| static BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64 broadcast_2x64(const uint64_t* in) { 62| 15.3k| return SIMD_4x64(_mm256_broadcastsi128_si256(_mm_loadu_si128(reinterpret_cast(in)))); 63| 15.3k| } _ZN5Botan9SIMD_4x649store_le2EPvS1_: 78| 15.3k| BOTAN_FN_ISA_SIMD_4X64 void store_le2(void* outh, void* outl) { 79| 15.3k| _mm256_storeu2_m128i(reinterpret_cast<__m128i*>(outh), reinterpret_cast<__m128i*>(outl), m_simd); 80| 15.3k| } _ZNK5Botan9SIMD_4x64plERKS0_: 84| 52.2k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 operator+(const SIMD_4x64& other) const { 85| 52.2k| SIMD_4x64 retval(*this); 86| 52.2k| retval += other; 87| 52.2k| return retval; 88| 52.2k| } _ZN5Botan9SIMD_4x64pLERKS0_: 108| 52.2k| BOTAN_FN_ISA_SIMD_4X64 void operator+=(const SIMD_4x64& other) { 109| 52.2k| m_simd = _mm256_add_epi64(m_simd, other.m_simd); 110| 52.2k| } _ZN5Botan9SIMD_4x647alignr8ERKS0_S2_: 233| 24.5k| 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.5k| } _ZNK5Botan9SIMD_4x644rotrILm1EEES0_vQaagtT_Li0EltT_Li64E: 130| 12.2k| { 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.2k| } else { 155| 12.2k| return SIMD_4x64(_mm256_or_si256(_mm256_srli_epi64(m_simd, static_cast(ROT)), 156| 12.2k| _mm256_slli_epi64(m_simd, static_cast(64 - ROT)))); 157| 12.2k| } 158| 12.2k|#endif 159| 12.2k| } _ZNK5Botan9SIMD_4x644rotrILm8EEES0_vQaagtT_Li0EltT_Li64E: 130| 12.2k| { 131| |#if defined(__AVX512VL__) 132| | return SIMD_4x64(_mm256_ror_epi64(m_simd, ROT)); 133| |#else 134| 12.2k| if constexpr(ROT == 8) { 135| 12.2k| const auto shuf_rot_8 = 136| 12.2k| _mm256_set_epi64x(0x080f0e0d0c0b0a09, 0x0007060504030201, 0x080f0e0d0c0b0a09, 0x0007060504030201); 137| | 138| 12.2k| 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.2k|#endif 159| 12.2k| } _ZNK5Botan9SIMD_4x643shrILi7EEES0_v: 224| 12.2k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 shr() const noexcept { 225| 12.2k| return SIMD_4x64(_mm256_srli_epi64(m_simd, SHIFT)); 226| 12.2k| } _ZNK5Botan9SIMD_4x644rotrILm19EEES0_vQaagtT_Li0EltT_Li64E: 130| 12.2k| { 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.2k| } else { 155| 12.2k| return SIMD_4x64(_mm256_or_si256(_mm256_srli_epi64(m_simd, static_cast(ROT)), 156| 12.2k| _mm256_slli_epi64(m_simd, static_cast(64 - ROT)))); 157| 12.2k| } 158| 12.2k|#endif 159| 12.2k| } _ZNK5Botan9SIMD_4x644rotrILm61EEES0_vQaagtT_Li0EltT_Li64E: 130| 12.2k| { 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.2k| } else { 155| 12.2k| return SIMD_4x64(_mm256_or_si256(_mm256_srli_epi64(m_simd, static_cast(ROT)), 156| 12.2k| _mm256_slli_epi64(m_simd, static_cast(64 - ROT)))); 157| 12.2k| } 158| 12.2k|#endif 159| 12.2k| } _ZNK5Botan9SIMD_4x643shrILi6EEES0_v: 224| 12.2k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 shr() const noexcept { 225| 12.2k| return SIMD_4x64(_mm256_srli_epi64(m_simd, SHIFT)); 226| 12.2k| } _ZN5Botan9SIMD_8x32C2Ejjjjjjjj: 46| 2.84k| uint32_t B7) noexcept { 47| | // NOLINTNEXTLINE(*-prefer-member-initializer) 48| 2.84k| m_avx2 = _mm256_set_epi32(B7, B6, B5, B4, B3, B2, B1, B0); 49| 2.84k| } _ZN5Botan9SIMD_8x32C2Ejjjj: 52| 27| explicit SIMD_8x32(uint32_t B0, uint32_t B1, uint32_t B2, uint32_t B3) noexcept { 53| | // NOLINTNEXTLINE(*-prefer-member-initializer) 54| 27| m_avx2 = _mm256_set_epi32(B3, B2, B1, B0, B3, B2, B1, B0); 55| 27| } _ZN5Botan9SIMD_8x325splatEj: 58| 85.8k| static SIMD_8x32 splat(uint32_t B) noexcept { return SIMD_8x32(_mm256_set1_epi32(B)); } _ZN5Botan9SIMD_8x327load_leEPKh: 61| 1.40k| static SIMD_8x32 load_le(const uint8_t* in) noexcept { 62| 1.40k| return SIMD_8x32(_mm256_loadu_si256(reinterpret_cast(in))); 63| 1.40k| } _ZN5Botan9SIMD_8x3210load_le128EPKh: 71| 27| static SIMD_8x32 load_le128(const uint8_t* in) noexcept { 72| 27| return SIMD_8x32(_mm256_broadcastsi128_si256(_mm_loadu_si128(reinterpret_cast(in)))); 73| 27| } _ZNK5Botan9SIMD_8x328store_leEPh: 94| 45.6k| void store_le(uint8_t out[]) const noexcept { _mm256_storeu_si256(reinterpret_cast<__m256i*>(out), m_avx2); } _ZNK5Botan9SIMD_8x32plERKS0_: 174| 2.82k| SIMD_8x32 operator+(const SIMD_8x32& other) const noexcept { 175| 2.82k| SIMD_8x32 retval(*this); 176| 2.82k| retval += other; 177| 2.82k| return retval; 178| 2.82k| } _ZNK5Botan9SIMD_8x32miERKS0_: 181| 2.76k| SIMD_8x32 operator-(const SIMD_8x32& other) const noexcept { 182| 2.76k| SIMD_8x32 retval(*this); 183| 2.76k| retval -= other; 184| 2.76k| return retval; 185| 2.76k| } _ZN5Botan9SIMD_8x32pLERKS0_: 209| 933k| void operator+=(const SIMD_8x32& other) { m_avx2 = _mm256_add_epi32(m_avx2, other.m_avx2); } _ZN5Botan9SIMD_8x32mIERKS0_: 212| 2.76k| void operator-=(const SIMD_8x32& other) { m_avx2 = _mm256_sub_epi32(m_avx2, other.m_avx2); } _ZN5Botan9SIMD_8x32eOERKS0_: 215| 886k| void operator^=(const SIMD_8x32& other) { m_avx2 = _mm256_xor_si256(m_avx2, other.m_avx2); } _ZN5Botan9SIMD_8x329transposeERS0_S1_S1_S1_: 274| 11.0k| static void transpose(SIMD_8x32& B0, SIMD_8x32& B1, SIMD_8x32& B2, SIMD_8x32& B3) noexcept { 275| 11.0k| const __m256i T0 = _mm256_unpacklo_epi32(B0.m_avx2, B1.m_avx2); 276| 11.0k| const __m256i T1 = _mm256_unpacklo_epi32(B2.m_avx2, B3.m_avx2); 277| 11.0k| const __m256i T2 = _mm256_unpackhi_epi32(B0.m_avx2, B1.m_avx2); 278| 11.0k| const __m256i T3 = _mm256_unpackhi_epi32(B2.m_avx2, B3.m_avx2); 279| | 280| 11.0k| B0.m_avx2 = _mm256_unpacklo_epi64(T0, T1); 281| 11.0k| B1.m_avx2 = _mm256_unpackhi_epi64(T0, T1); 282| 11.0k| B2.m_avx2 = _mm256_unpacklo_epi64(T2, T3); 283| 11.0k| B3.m_avx2 = _mm256_unpackhi_epi64(T2, T3); 284| 11.0k| } _ZN5Botan9SIMD_8x329transposeERS0_S1_S1_S1_S1_S1_S1_S1_: 312| 5.53k| SIMD_8x32& B7) noexcept { 313| 5.53k| transpose(B0, B1, B2, B3); 314| 5.53k| transpose(B4, B5, B6, B7); 315| | 316| 5.53k| swap_tops(B0, B4); 317| 5.53k| swap_tops(B1, B5); 318| 5.53k| swap_tops(B2, B6); 319| 5.53k| swap_tops(B3, B7); 320| 5.53k| } _ZNK5Botan9SIMD_8x3211unsigned_ltERKS0_: 327| 2.76k| SIMD_8x32 BOTAN_FN_ISA_SIMD_8X32 unsigned_lt(const SIMD_8x32& other) const noexcept { 328| | // No unsigned comparison before AVX-512; bias into the signed domain 329| 2.76k| const __m256i bias = _mm256_set1_epi32(static_cast(0x80000000)); 330| 2.76k| return SIMD_8x32(_mm256_cmpgt_epi32(_mm256_xor_si256(other.raw(), bias), _mm256_xor_si256(raw(), bias))); 331| 2.76k| } _ZN5Botan9SIMD_8x3212byte_shuffleERKS0_S2_: 351| 731| static inline SIMD_8x32 BOTAN_FN_ISA_SIMD_8X32 byte_shuffle(const SIMD_8x32& tbl, const SIMD_8x32& idx) { 352| 731| return SIMD_8x32(_mm256_shuffle_epi8(tbl.raw(), idx.raw())); 353| 731| } _ZN5Botan9SIMD_8x3215reset_registersEv: 385| 2.76k| static void reset_registers() noexcept { _mm256_zeroupper(); } _ZN5Botan9SIMD_8x3214zero_registersEv: 388| 2.76k| static void zero_registers() noexcept { _mm256_zeroall(); } _ZNK5Botan9SIMD_8x323rawEv: 390| 95.5k| __m256i BOTAN_FN_ISA_SIMD_8X32 raw() const noexcept { return m_avx2; } _ZN5Botan9SIMD_8x32C2EDv4_x: 393| 1.02M| explicit SIMD_8x32(__m256i x) noexcept : m_avx2(x) {} _ZN5Botan9SIMD_8x329swap_topsERS0_S1_: 397| 22.1k| static void swap_tops(SIMD_8x32& A, SIMD_8x32& B) { 398| 22.1k| const auto T0 = SIMD_8x32(_mm256_permute2x128_si256(A.raw(), B.raw(), 0 + (2 << 4))); 399| | const auto T1 = SIMD_8x32(_mm256_permute2x128_si256(A.raw(), B.raw(), 1 + (3 << 4))); 400| 22.1k| A = T0; 401| 22.1k| B = T1; 402| 22.1k| } _ZNK5Botan9SIMD_8x324rotlILm7EEES0_vQaagtT_Li0EltT_Li32E: 128| 221k| { 129| |#if defined(__AVX512VL__) 130| | return SIMD_8x32(_mm256_rol_epi32(m_avx2, ROT)); 131| |#else 132| | if constexpr(ROT == 8) { 133| | const __m256i shuf_rotl_8 = 134| | _mm256_set_epi64x(0x0e0d0c0f'0a09080b, 0x06050407'02010003, 0x0e0d0c0f'0a09080b, 0x06050407'02010003); 135| | 136| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_8)); 137| | } else if constexpr(ROT == 16) { 138| | const __m256i shuf_rotl_16 = 139| | _mm256_set_epi64x(0x0d0c0f0e'09080b0a, 0x05040706'01000302, 0x0d0c0f0e'09080b0a, 0x05040706'01000302); 140| | 141| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_16)); 142| | } else if constexpr(ROT == 24) { 143| | const __m256i shuf_rotl_24 = 144| | _mm256_set_epi64x(0x0c0f0e0d'080b0a09, 0x04070605'00030201, 0x0c0f0e0d'080b0a09, 0x04070605'00030201); 145| | 146| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_24)); 147| 221k| } else { 148| 221k| return SIMD_8x32(_mm256_xor_si256(_mm256_slli_epi32(m_avx2, static_cast(ROT)), 149| 221k| _mm256_srli_epi32(m_avx2, static_cast(32 - ROT)))); 150| 221k| } 151| 221k|#endif 152| 221k| } _ZNK5Botan9SIMD_8x324rotlILm16EEES0_vQaagtT_Li0EltT_Li32E: 128| 221k| { 129| |#if defined(__AVX512VL__) 130| | return SIMD_8x32(_mm256_rol_epi32(m_avx2, ROT)); 131| |#else 132| | if constexpr(ROT == 8) { 133| | const __m256i shuf_rotl_8 = 134| | _mm256_set_epi64x(0x0e0d0c0f'0a09080b, 0x06050407'02010003, 0x0e0d0c0f'0a09080b, 0x06050407'02010003); 135| | 136| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_8)); 137| 221k| } else if constexpr(ROT == 16) { 138| 221k| const __m256i shuf_rotl_16 = 139| 221k| _mm256_set_epi64x(0x0d0c0f0e'09080b0a, 0x05040706'01000302, 0x0d0c0f0e'09080b0a, 0x05040706'01000302); 140| | 141| 221k| return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_16)); 142| | } else if constexpr(ROT == 24) { 143| | const __m256i shuf_rotl_24 = 144| | _mm256_set_epi64x(0x0c0f0e0d'080b0a09, 0x04070605'00030201, 0x0c0f0e0d'080b0a09, 0x04070605'00030201); 145| | 146| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_24)); 147| | } else { 148| | return SIMD_8x32(_mm256_xor_si256(_mm256_slli_epi32(m_avx2, static_cast(ROT)), 149| | _mm256_srli_epi32(m_avx2, static_cast(32 - ROT)))); 150| | } 151| 221k|#endif 152| 221k| } _ZNK5Botan9SIMD_8x324rotlILm12EEES0_vQaagtT_Li0EltT_Li32E: 128| 221k| { 129| |#if defined(__AVX512VL__) 130| | return SIMD_8x32(_mm256_rol_epi32(m_avx2, ROT)); 131| |#else 132| | if constexpr(ROT == 8) { 133| | const __m256i shuf_rotl_8 = 134| | _mm256_set_epi64x(0x0e0d0c0f'0a09080b, 0x06050407'02010003, 0x0e0d0c0f'0a09080b, 0x06050407'02010003); 135| | 136| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_8)); 137| | } else if constexpr(ROT == 16) { 138| | const __m256i shuf_rotl_16 = 139| | _mm256_set_epi64x(0x0d0c0f0e'09080b0a, 0x05040706'01000302, 0x0d0c0f0e'09080b0a, 0x05040706'01000302); 140| | 141| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_16)); 142| | } else if constexpr(ROT == 24) { 143| | const __m256i shuf_rotl_24 = 144| | _mm256_set_epi64x(0x0c0f0e0d'080b0a09, 0x04070605'00030201, 0x0c0f0e0d'080b0a09, 0x04070605'00030201); 145| | 146| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_24)); 147| 221k| } else { 148| 221k| return SIMD_8x32(_mm256_xor_si256(_mm256_slli_epi32(m_avx2, static_cast(ROT)), 149| 221k| _mm256_srli_epi32(m_avx2, static_cast(32 - ROT)))); 150| 221k| } 151| 221k|#endif 152| 221k| } _ZNK5Botan9SIMD_8x324rotlILm8EEES0_vQaagtT_Li0EltT_Li32E: 128| 221k| { 129| |#if defined(__AVX512VL__) 130| | return SIMD_8x32(_mm256_rol_epi32(m_avx2, ROT)); 131| |#else 132| 221k| if constexpr(ROT == 8) { 133| 221k| const __m256i shuf_rotl_8 = 134| 221k| _mm256_set_epi64x(0x0e0d0c0f'0a09080b, 0x06050407'02010003, 0x0e0d0c0f'0a09080b, 0x06050407'02010003); 135| | 136| 221k| return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_8)); 137| | } else if constexpr(ROT == 16) { 138| | const __m256i shuf_rotl_16 = 139| | _mm256_set_epi64x(0x0d0c0f0e'09080b0a, 0x05040706'01000302, 0x0d0c0f0e'09080b0a, 0x05040706'01000302); 140| | 141| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_16)); 142| | } else if constexpr(ROT == 24) { 143| | const __m256i shuf_rotl_24 = 144| | _mm256_set_epi64x(0x0c0f0e0d'080b0a09, 0x04070605'00030201, 0x0c0f0e0d'080b0a09, 0x04070605'00030201); 145| | 146| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_24)); 147| | } else { 148| | return SIMD_8x32(_mm256_xor_si256(_mm256_slli_epi32(m_avx2, static_cast(ROT)), 149| | _mm256_srli_epi32(m_avx2, static_cast(32 - ROT)))); 150| | } 151| 221k|#endif 152| 221k| } _ZNK5Botan23Gf2AffineTransformation16affine_transformENS_9SIMD_4x32E: 194| 28.0k| inline SIMD_4x32 BOTAN_FN_ISA_HWAES affine_transform(SIMD_4x32 x) const { 195| 28.0k| const SIMD_4x32 tbl_lo(lo[0], lo[1], lo[2], lo[3]); 196| 28.0k| const SIMD_4x32 tbl_hi(hi[0], hi[1], hi[2], hi[3]); 197| 28.0k| const auto lo_mask = SIMD_4x32::splat_u8(0x0F); 198| | 199| 28.0k| return SIMD_4x32::byte_shuffle(tbl_lo, lo_mask & x) ^ SIMD_4x32::byte_shuffle(tbl_hi, lo_mask & x.shr<4>()); 200| 28.0k| } _ZN5Botan11hw_aes_sboxENS_9SIMD_4x32E: 27| 7.22k|inline SIMD_4x32 BOTAN_FN_ISA_HWAES hw_aes_sbox(SIMD_4x32 x) { 28| |#if defined(BOTAN_TARGET_ARCH_IS_PPC64) 29| | // vsbox is SubBytes alone so no shuffle is required 30| | #if defined(__clang__) 31| | return SIMD_4x32(reinterpret_cast<__vector unsigned int>( 32| | __builtin_crypto_vsbox(reinterpret_cast<__vector unsigned char>(x.raw())))); 33| | #else 34| | return SIMD_4x32(reinterpret_cast<__vector unsigned int>( 35| | __builtin_crypto_vsbox(reinterpret_cast<__vector unsigned long long>(x.raw())))); 36| | #endif 37| |#else 38| | // Undo the ShiftRows with a byte shuffle implementing InvShiftRows 39| 7.22k| const auto inv_sr = SIMD_4x32(0x070A0D00, 0x0B0E0104, 0x0F020508, 0x0306090C); 40| | 41| 7.22k| #if defined(BOTAN_TARGET_ARCH_IS_X86_FAMILY) 42| 7.22k| const auto enc = SIMD_4x32(_mm_aesenclast_si128(x.raw(), _mm_setzero_si128())); 43| | #elif defined(BOTAN_TARGET_ARCH_IS_ARM64) 44| | const auto enc = SIMD_4x32(vreinterpretq_u32_u8(vaeseq_u8(vreinterpretq_u8_u32(x.raw()), vdupq_n_u8(0)))); 45| | #else 46| | #error "hw_aes_sbox not implemented for this architecture" 47| | #endif 48| | 49| 7.22k| return SIMD_4x32::byte_shuffle(enc, inv_sr); 50| 7.22k|#endif 51| 7.22k|} _ZN5Botan15hw_aes_inv_sboxENS_9SIMD_4x32E: 56| 2.01k|inline SIMD_4x32 BOTAN_FN_ISA_HWAES hw_aes_inv_sbox(SIMD_4x32 x) { 57| |#if defined(BOTAN_TARGET_ARCH_IS_PPC64) 58| | /* 59| | * Undo the InvShiftRows with a byte shuffle implementing ShiftRows. POWER 60| | * numbers the AES state bytes starting from the most significant byte of the 61| | * register, so the indices differ from x86/ARM and depend on endianness. 62| | */ 63| | const auto sr = (std::endian::native == std::endian::little) 64| | ? SIMD_4x32(0x030E0904, 0x07020D08, 0x0B06010C, 0x0F0A0500) 65| | : SIMD_4x32(0x0306090C, 0x070A0D00, 0x0B0E0104, 0x0F020508); 66| |#else 67| | // Undo the InvShiftRows with a byte shuffle implementing ShiftRows 68| 2.01k| const auto sr = SIMD_4x32(0x0F0A0500, 0x030E0904, 0x07020D08, 0x0B06010C); 69| 2.01k|#endif 70| | 71| 2.01k|#if defined(BOTAN_TARGET_ARCH_IS_X86_FAMILY) 72| 2.01k| const auto dec = SIMD_4x32(_mm_aesdeclast_si128(x.raw(), _mm_setzero_si128())); 73| |#elif defined(BOTAN_TARGET_ARCH_IS_ARM64) 74| | const auto dec = SIMD_4x32(vreinterpretq_u32_u8(vaesdq_u8(vreinterpretq_u8_u32(x.raw()), vdupq_n_u8(0)))); 75| |#elif defined(BOTAN_TARGET_ARCH_IS_PPC64) 76| | #if defined(__clang__) 77| | const auto dec = SIMD_4x32(reinterpret_cast<__vector unsigned int>(__builtin_crypto_vncipherlast( 78| | reinterpret_cast<__vector unsigned char>(x.raw()), reinterpret_cast<__vector unsigned char>(SIMD_4x32().raw())))); 79| | #else 80| | const auto dec = SIMD_4x32(reinterpret_cast<__vector unsigned int>( 81| | __builtin_crypto_vncipherlast(reinterpret_cast<__vector unsigned long long>(x.raw()), 82| | reinterpret_cast<__vector unsigned long long>(SIMD_4x32().raw())))); 83| | #endif 84| |#else 85| | #error "hw_aes_inv_sbox not implemented for this architecture" 86| |#endif 87| | 88| 2.01k| return SIMD_4x32::byte_shuffle(dec, sr); 89| 2.01k|} _ZN5Botan12value_existsINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEEEbRKNS1_6vectorIT_NS5_ISB_EEEERKT0_: 44| 135k|bool value_exists(const std::vector& vec, const V& val) { 45| 243k| for(const auto& elem : vec) { ------------------ | Branch (45:25): [True: 243k, False: 0] ------------------ 46| 243k| if(elem == val) { ------------------ | Branch (46:10): [True: 135k, False: 107k] ------------------ 47| 135k| return true; 48| 135k| } 49| 243k| } 50| 0| return false; 51| 135k|} _ZN5Botan12value_existsINS_3TLS12Group_ParamsES2_EEbRKNSt3__16vectorIT_NS3_9allocatorIS5_EEEERKT0_: 44| 44.3k|bool value_exists(const std::vector& vec, const V& val) { 45| 48.0k| for(const auto& elem : vec) { ------------------ | Branch (45:25): [True: 48.0k, False: 39.4k] ------------------ 46| 48.0k| if(elem == val) { ------------------ | Branch (46:10): [True: 4.93k, False: 43.1k] ------------------ 47| 4.93k| return true; 48| 4.93k| } 49| 48.0k| } 50| 39.4k| return false; 51| 44.3k|} _ZN5Botan12value_existsINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEES7_EEbRKNS1_6vectorIT_NS5_IS9_EEEERKT0_: 44| 31|bool value_exists(const std::vector& vec, const V& val) { 45| 31| for(const auto& elem : vec) { ------------------ | Branch (45:25): [True: 31, False: 2] ------------------ 46| 31| if(elem == val) { ------------------ | Branch (46:10): [True: 29, False: 2] ------------------ 47| 29| return true; 48| 29| } 49| 31| } 50| 2| return false; 51| 31|} tls_channel_impl_12.cpp:_ZN5Botan13map_remove_ifINSt3__13mapItNS1_10shared_ptrINS_3TLS23Connection_Cipher_StateEEENS1_4lessItEENS1_9allocatorINS1_4pairIKtS6_EEEEEEZNS4_15Channel_Impl_1216activate_sessionEvE3$_0EEvT0_RT_: 54| 63|void map_remove_if(Pred pred, T& assoc) { 55| 63| auto i = assoc.begin(); 56| 189| while(i != assoc.end()) { ------------------ | Branch (56:10): [True: 126, False: 63] ------------------ 57| 126| if(pred(i->first)) { ------------------ | Branch (57:10): [True: 63, False: 63] ------------------ 58| 63| assoc.erase(i++); 59| 63| } else { 60| 63| i++; 61| 63| } 62| 126| } 63| 63|} tls_channel_impl_12.cpp:_ZN5Botan13map_remove_ifINSt3__13mapItNS_3TLS15Channel_Impl_1226Retained_Read_Cipher_StateENS1_4lessItEENS1_9allocatorINS1_4pairIKtS5_EEEEEEZNS4_16activate_sessionEvE3$_0EEvT0_RT_: 54| 63|void map_remove_if(Pred pred, T& assoc) { 55| 63| auto i = assoc.begin(); 56| 189| while(i != assoc.end()) { ------------------ | Branch (56:10): [True: 126, False: 63] ------------------ 57| 126| if(pred(i->first)) { ------------------ | Branch (57:10): [True: 63, False: 63] ------------------ 58| 63| assoc.erase(i++); 59| 63| } else { 60| 63| i++; 61| 63| } 62| 126| } 63| 63|} _ZN5Botan12value_existsINS_3TLS16Protocol_VersionES2_EEbRKNSt3__16vectorIT_NS3_9allocatorIS5_EEEERKT0_: 44| 22|bool value_exists(const std::vector& vec, const V& val) { 45| 230| for(const auto& elem : vec) { ------------------ | Branch (45:25): [True: 230, False: 17] ------------------ 46| 230| if(elem == val) { ------------------ | Branch (46:10): [True: 5, False: 225] ------------------ 47| 5| return true; 48| 5| } 49| 230| } 50| 17| return false; 51| 22|} _ZN5Botan12value_existsIhhEEbRKNSt3__16vectorIT_NS1_9allocatorIS3_EEEERKT0_: 44| 2.92k|bool value_exists(const std::vector& vec, const V& val) { 45| 3.49k| for(const auto& elem : vec) { ------------------ | Branch (45:25): [True: 3.49k, False: 49] ------------------ 46| 3.49k| if(elem == val) { ------------------ | Branch (46:10): [True: 2.88k, False: 612] ------------------ 47| 2.88k| return true; 48| 2.88k| } 49| 3.49k| } 50| 49| return false; 51| 2.92k|} _ZN5Botan12holds_any_ofIJNS_3TLS20Client_Hello_12_ShimENS1_15Client_Hello_13ENS1_15Server_Hello_13ENS1_19Hello_Retry_RequestENS1_11Finished_13EEJS3_S2_S4_NS1_20Server_Hello_12_ShimES5_NS1_20Encrypted_ExtensionsENS1_14Certificate_13ENS1_22Certificate_Request_13ENS1_21Certificate_Verify_13ES6_EEEbRKNSt3__17variantIJDpT0_EEE: 66| 3.18k|constexpr bool holds_any_of(const std::variant& v) noexcept { 67| 4.65k| return (std::holds_alternative(v) || ...); ------------------ | Branch (67:12): [True: 0, False: 210] | Branch (67:12): [True: 10, False: 200] | Branch (67:12): [True: 0, False: 210] | Branch (67:12): [True: 0, False: 210] | Branch (67:12): [True: 2.97k, False: 210] ------------------ 68| 3.18k|} _ZN5Botan13to_underlyingINS_3TLS11Record_TypeEQsr3stdE9is_enum_vIT_EEEDaS3_: 158| 2.30k|auto to_underlying(T e) noexcept { 159| 2.30k| return static_cast>(e); 160| 2.30k|} _ZN5Botan13generalize_toINSt3__17variantIJNS_3TLS15Client_Hello_13ENS3_20Client_Hello_12_ShimENS3_15Server_Hello_13ENS3_20Server_Hello_12_ShimENS3_19Hello_Retry_RequestENS3_20Encrypted_ExtensionsENS3_14Certificate_13ENS3_22Certificate_Request_13ENS3_21Certificate_Verify_13ENS3_11Finished_13EEEEJS4_S5_EEET_NS2_IJDpT0_EEE: 102| 2.97k|constexpr GeneralVariantT generalize_to(std::variant specific) { 103| 2.97k| static_assert( 104| 2.97k| is_generalizable_to(specific), 105| 2.97k| "Desired general type must be implicitly constructible by all types of the specialized std::variant<>"); 106| 2.97k| return std::visit([](auto s) -> GeneralVariantT { return s; }, std::move(specific)); 107| 2.97k|} _ZZN5Botan13generalize_toINSt3__17variantIJNS_3TLS15Client_Hello_13ENS3_20Client_Hello_12_ShimENS3_15Server_Hello_13ENS3_20Server_Hello_12_ShimENS3_19Hello_Retry_RequestENS3_20Encrypted_ExtensionsENS3_14Certificate_13ENS3_22Certificate_Request_13ENS3_21Certificate_Verify_13ENS3_11Finished_13EEEEJS4_S5_EEET_NS2_IJDpT0_EEEENKUlSF_E_clIS5_EESE_SF_: 106| 2.97k| return std::visit([](auto s) -> GeneralVariantT { return s; }, std::move(specific)); _ZN5Botan13generalize_toINSt3__17variantIJNS_3TLS15Client_Hello_13ENS3_20Client_Hello_12_ShimENS3_15Server_Hello_13ENS3_20Server_Hello_12_ShimENS3_19Hello_Retry_RequestENS3_20Encrypted_ExtensionsENS3_14Certificate_13ENS3_22Certificate_Request_13ENS3_21Certificate_Verify_13ENS3_11Finished_13EEEEJS8_S6_S7_EEET_NS2_IJDpT0_EEE: 102| 16|constexpr GeneralVariantT generalize_to(std::variant specific) { 103| 16| static_assert( 104| 16| is_generalizable_to(specific), 105| 16| "Desired general type must be implicitly constructible by all types of the specialized std::variant<>"); 106| 16| return std::visit([](auto s) -> GeneralVariantT { return s; }, std::move(specific)); 107| 16|} _ZZN5Botan13generalize_toINSt3__17variantIJNS_3TLS15Client_Hello_13ENS3_20Client_Hello_12_ShimENS3_15Server_Hello_13ENS3_20Server_Hello_12_ShimENS3_19Hello_Retry_RequestENS3_20Encrypted_ExtensionsENS3_14Certificate_13ENS3_22Certificate_Request_13ENS3_21Certificate_Verify_13ENS3_11Finished_13EEEEJS8_S6_S7_EEET_NS2_IJDpT0_EEEENKUlSF_E_clIS7_EESE_SF_: 106| 16| return std::visit([](auto s) -> GeneralVariantT { return s; }, std::move(specific)); _ZN5Botan13generalize_toINSt3__17variantIJNS_3TLS23ChangeCipherSpec_RecordENS3_12Alert_RecordENS3_16Handshake_RecordENS3_22ApplicationData_RecordEmEEEJS4_S5_S6_S7_EEET_NS2_IJDpT0_EEE: 102| 21.5k|constexpr GeneralVariantT generalize_to(std::variant specific) { 103| 21.5k| static_assert( 104| 21.5k| is_generalizable_to(specific), 105| 21.5k| "Desired general type must be implicitly constructible by all types of the specialized std::variant<>"); 106| 21.5k| return std::visit([](auto s) -> GeneralVariantT { return s; }, std::move(specific)); 107| 21.5k|} _ZZN5Botan13generalize_toINSt3__17variantIJNS_3TLS23ChangeCipherSpec_RecordENS3_12Alert_RecordENS3_16Handshake_RecordENS3_22ApplicationData_RecordEmEEEJS4_S5_S6_S7_EEET_NS2_IJDpT0_EEEENKUlS9_E_clIS4_EES8_S9_: 106| 2| return std::visit([](auto s) -> GeneralVariantT { return s; }, std::move(specific)); _ZZN5Botan13generalize_toINSt3__17variantIJNS_3TLS23ChangeCipherSpec_RecordENS3_12Alert_RecordENS3_16Handshake_RecordENS3_22ApplicationData_RecordEmEEEJS4_S5_S6_S7_EEET_NS2_IJDpT0_EEEENKUlS9_E_clIS5_EES8_S9_: 106| 543| return std::visit([](auto s) -> GeneralVariantT { return s; }, std::move(specific)); _ZZN5Botan13generalize_toINSt3__17variantIJNS_3TLS23ChangeCipherSpec_RecordENS3_12Alert_RecordENS3_16Handshake_RecordENS3_22ApplicationData_RecordEmEEEJS4_S5_S6_S7_EEET_NS2_IJDpT0_EEEENKUlS9_E_clIS6_EES8_S9_: 106| 20.9k| return std::visit([](auto s) -> GeneralVariantT { return s; }, std::move(specific)); _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode8tag_sizeEv: 43| 605| size_t tag_size() const final { return m_tag_size; } _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode7iv_sizeEv: 74| 50| size_t iv_size() const { return m_iv_size; } _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode10block_sizeEv: 76| 475| size_t block_size() const { return m_block_size; } _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode20use_encrypt_then_macEv: 78| 290| bool use_encrypt_then_mac() const { return m_use_encrypt_then_mac; } _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode20is_datagram_protocolEv: 80| 43| bool is_datagram_protocol() const { return m_is_datagram; } _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode3cbcEv: 82| 267| Cipher_Mode& cbc() const { return *m_cbc; } _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode3macEv: 84| 463| MessageAuthenticationCode& mac() const { return *m_mac; } _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode9cbc_stateEv: 86| 178| secure_vector& cbc_state() { return m_cbc_state; } _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode10assoc_dataEv: 88| 93| std::vector& assoc_data() { return m_ad; } _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode3msgEv: 90| 190| secure_vector& msg() { return m_msg; } _ZNK5Botan3TLS28TLS_CBC_HMAC_AEAD_Decryption18minimum_final_sizeEv: 159| 59| size_t minimum_final_size() const override { return tag_size(); } _ZNK5Botan3TLS12Channel_Impl17expects_downgradeEv: 314| 17.3k| bool expects_downgrade() const { 315| 17.3k|#if defined(BOTAN_HAS_TLS_DOWNGRADE_SUPPORT) 316| 17.3k| return m_downgrade_info != nullptr; 317| |#else 318| | return false; 319| |#endif 320| 17.3k| } _ZN5Botan3TLS12Channel_Impl18set_io_buffer_sizeEm: 267| 5.50k| void set_io_buffer_size(size_t io_buf_sz) { 268| 5.50k| BOTAN_STATE_CHECK(m_downgrade_info); ------------------ | | 51| 5.50k| do { \ | | 52| 5.50k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 5.50k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 5.50k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 5.50k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 5.50k] | | ------------------ ------------------ 269| 5.50k| m_downgrade_info->io_buffer_size = io_buf_sz; 270| 5.50k| } _ZNK5Botan3TLS12Channel_Impl14is_downgradingEv: 306| 12.0k| bool is_downgrading() const { 307| 12.0k|#if defined(BOTAN_HAS_TLS_DOWNGRADE_SUPPORT) 308| 12.0k| return m_downgrade_info && m_downgrade_info->will_downgrade; ------------------ | Branch (308:17): [True: 11.6k, False: 356] | Branch (308:37): [True: 5.93k, False: 5.74k] ------------------ 309| |#else 310| | return false; 311| |#endif 312| 12.0k| } _ZN5Botan3TLS12Channel_Impl22extract_downgrade_infoEv: 297| 2.96k| std::unique_ptr extract_downgrade_info() { return std::exchange(m_downgrade_info, {}); } _ZN5Botan3TLS12Channel_Impl18send_warning_alertENS0_9AlertTypeE: 80| 270| void send_warning_alert(Alert::Type type) { send_alert(Alert(type, false)); } _ZN5Botan3TLS12Channel_Impl16send_fatal_alertENS0_9AlertTypeE: 85| 4.14k| void send_fatal_alert(Alert::Type type) { send_alert(Alert(type, true)); } _ZN5Botan3TLS12Channel_Impl5closeEv: 90| 9| void close() { send_warning_alert(Alert::CloseNotify); } _ZN5Botan3TLS12Channel_Impl21reset_useless_recordsEv: 211| 10.3k| void reset_useless_records() { m_useless_records = 0; } _ZN5Botan3TLS12Channel_Impl24preserve_peer_transcriptENSt3__14spanIKhLm18446744073709551615EEE: 254| 5.50k| void preserve_peer_transcript(std::span input) { 255| 5.50k| BOTAN_STATE_CHECK(m_downgrade_info); ------------------ | | 51| 5.50k| do { \ | | 52| 5.50k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 5.50k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 5.50k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 5.50k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 5.50k] | | ------------------ ------------------ 256| 5.50k| m_downgrade_info->peer_transcript.insert(m_downgrade_info->peer_transcript.end(), input.begin(), input.end()); 257| 5.50k| } _ZN5Botan3TLS12Channel_Impl17request_downgradeEv: 280| 2.96k| void request_downgrade() { 281| 2.96k| BOTAN_STATE_CHECK(m_downgrade_info && !m_downgrade_info->will_downgrade); ------------------ | | 51| 2.96k| do { \ | | 52| 2.96k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 5.93k| if(!(expr)) { \ | | ------------------ | | | Branch (53:12): [True: 2.96k, False: 0] | | | Branch (53:12): [True: 2.96k, False: 0] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 2.96k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 2.96k] | | ------------------ ------------------ 282| 2.96k| m_downgrade_info->will_downgrade = true; 283| 2.96k| } _ZN5Botan3TLS12Channel_ImplC2Ev: 199| 9.23k| Channel_Impl() = default; _ZN5Botan3TLS12Channel_ImplD2Ev: 50| 9.23k| virtual ~Channel_Impl() = default; _ZNK5Botan3TLS15Channel_Impl_1212active_stateEv: 154| 8.73k| const std::optional& active_state() const { return m_active_state; } _ZN5Botan3TLS15Channel_Impl_123rngEv: 194| 9.88k| RandomNumberGenerator& rng() { return *m_rng; } _ZN5Botan3TLS15Channel_Impl_1215session_managerEv: 196| 2.77k| Session_Manager& session_manager() { return *m_session_manager; } _ZNK5Botan3TLS15Channel_Impl_126policyEv: 198| 45.8k| const Policy& policy() const { return *m_policy; } _ZNK5Botan3TLS15Channel_Impl_129callbacksEv: 200| 22.6k| Callbacks& callbacks() const { return *m_callbacks; } _ZNK5Botan3TLS15Channel_Impl_126flavorEv: 202| 2.60k| TLS_Flavor flavor() const { return m_flavor; } _ZNK5Botan3TLS15Channel_Impl_1213pending_stateEv: 240| 21.7k| const Handshake_State* pending_state() const { return m_pending_state.get(); } _ZNK5Botan3TLS15Channel_Impl_139callbacksEv: 146| 3.49k| Callbacks& callbacks() const { return *m_callbacks; } _ZNK5Botan3TLS15Channel_Impl_136policyEv: 154| 504| const Policy& policy() const { return *m_policy; } _ZN5Botan3TLS10Channel_IOC2ENS0_15Connection_SideENSt3__110shared_ptrIKNS0_6PolicyEEENS4_INS0_9CallbacksEEE: 46| 5.50k| m_policy(std::move(policy)), m_callbacks(std::move(callbacks)), m_side(side) {} _ZNK5Botan3TLS10Channel_IO6policyEv: 141| 52.4k| const Policy& policy() const { return *m_policy; } _ZN5Botan3TLS10Channel_IO9callbacksEv: 145| 2.30k| Callbacks& callbacks() { return *m_callbacks; } _ZN5Botan3TLS10Channel_IOD2Ev: 54| 5.50k| virtual ~Channel_IO() = default; _ZN5Botan3TLS19as_tls_cipher_stateEPNS0_12Cipher_StateE: 499| 24.0k|inline TLS_Cipher_State* as_tls_cipher_state(Cipher_State* cs) { 500| 24.0k| auto* tls_cs = dynamic_cast(cs); 501| 24.0k| BOTAN_ASSERT_IMPLICATION( ------------------ | | 110| 24.0k| do { \ | | 111| 24.0k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 112| 24.0k| if((expr1) && !(expr2)) { \ | | ------------------ | | | Branch (112:10): [True: 24.0k, False: 0] | | | Branch (112:21): [True: 0, False: 24.0k] | | ------------------ | | 113| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 114| 0| Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \ | | 115| 0| } \ | | 116| 24.0k| } while(0) | | ------------------ | | | Branch (116:12): [Folded, False: 24.0k] | | ------------------ ------------------ 502| 24.0k| tls_cs == nullptr, cs == nullptr, "If the cipher state is not a TLS_Cipher_State, it must be null"); 503| 24.0k| return tls_cs; 504| 24.0k|} _ZNK5Botan3TLS26Active_Connection_State_127versionEv: 48| 48| Protocol_Version version() const { return m_version; } _ZNK5Botan3TLS26Active_Connection_State_1210session_idEv: 62| 48| const Session_ID& session_id() const { return m_session_id; } _ZN5Botan3TLS14Handshake_Hash6updateERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 23| 12.8k| void update(const std::vector& in) { m_data += in; } _ZN5Botan3TLS12Handshake_IOD2Ev: 84| 3.57k| virtual ~Handshake_IO() = default; _ZN5Botan3TLS19Stream_Handshake_IOC2ENSt3__18functionIFvNS0_11Record_TypeERKNS2_6vectorIhNS2_9allocatorIhEEEEEEE: 94| 2.96k| explicit Stream_Handshake_IO(writer_fn writer) : m_send_hs(std::move(writer)) {} _ZN5Botan3TLS12Handshake_IOC2Ev: 77| 3.57k| Handshake_IO() = default; _ZNK5Botan3TLS19Stream_Handshake_IO14have_more_dataEv: 102| 3.03k| bool have_more_data() const override { return !m_queue.empty(); } _ZNK5Botan3TLS21Datagram_Handshake_IO20Handshake_Reassembly11initializedEv: 246| 1.56k| bool initialized() const { return m_msg_type != Handshake_Type::None; } _ZNK5Botan3TLS21Datagram_Handshake_IO20Handshake_Reassembly5epochEv: 250| 156| uint16_t epoch() const { return m_epoch; } _ZNK5Botan3TLS21Datagram_Handshake_IO20Handshake_Reassembly10msg_lengthEv: 253| 156| size_t msg_length() const { return m_msg_length; } _ZN5Botan3TLS15Handshake_LayerC2ENS0_15Connection_SideE: 33| 5.50k| m_peer(whoami == Connection_Side::Server ? Connection_Side::Client : Connection_Side::Server) ------------------ | Branch (33:20): [True: 5.50k, False: 0] ------------------ 34| | // RFC 8446 4.4.2 35| | // If the corresponding certificate type extension 36| | // ("server_certificate_type" or "client_certificate_type") was not 37| | // negotiated in EncryptedExtensions, or the X.509 certificate type 38| | // was negotiated, then each CertificateEntry contains a DER-encoded 39| | // X.509 certificate. 40| | // 41| | // We need the certificate_type info to parse Certificate messages. 42| | , 43| 5.50k| m_certificate_type(Certificate_Type::X509) {} _ZNK5Botan3TLS15Handshake_Layer4peerEv: 126| 594| Connection_Side peer() const { return m_peer; } _ZNK5Botan3TLS15Handshake_Layer16certificate_typeEv: 128| 525| Certificate_Type certificate_type() const { return m_certificate_type; } _ZN5Botan3TLS19TLS_Handshake_LayerC2ENS0_15Connection_SideE: 143| 5.50k| explicit TLS_Handshake_Layer(Connection_Side whoami) : Handshake_Layer(whoami) {} _ZNK5Botan3TLS19TLS_Handshake_Layer16has_pending_dataEv: 150| 3.53k| bool has_pending_data() const override { return m_read_offset < m_read_buffer.size(); } _ZN5Botan3TLS15Handshake_LayerD2Ev: 56| 5.50k| virtual ~Handshake_Layer() = default; _ZN5Botan3TLS15Handshake_State12handshake_ioEv: 71| 26.1k| Handshake_IO& handshake_io() { return *m_handshake_io; } _ZNK5Botan3TLS15Handshake_State12server_helloEv: 137| 14.8k| const Server_Hello_12* server_hello() const { return m_server_hello.get(); } _ZNK5Botan3TLS15Handshake_State7versionEv: 110| 19.5k| Protocol_Version version() const { return m_version; } _ZNK5Botan3TLS15Handshake_State12session_keysEv: 169| 572| const Session_Keys& session_keys() const { return m_session_keys; } _ZNK5Botan3TLS15Handshake_State12client_helloEv: 135| 46.1k| const Client_Hello_12* client_hello() const { return m_client_hello.get(); } _ZNK5Botan3TLS15Handshake_State12server_certsEv: 139| 3| const Certificate_12* server_certs() const { return m_server_certs.get(); } _ZNK5Botan3TLS15Handshake_State10server_kexEv: 141| 3.79k| const Server_Key_Exchange* server_kex() const { return m_server_kex.get(); } _ZNK5Botan3TLS15Handshake_State12client_certsEv: 147| 126| const Certificate_12* client_certs() const { return m_client_certs.get(); } _ZNK5Botan3TLS15Handshake_State10client_kexEv: 149| 2.45k| const Client_Key_Exchange* client_kex() const { return m_client_kex.get(); } _ZNK5Botan3TLS15Handshake_State18new_session_ticketEv: 157| 63| const New_Session_Ticket_12* new_session_ticket() const { return m_new_session_ticket.get(); } _ZNK5Botan3TLS15Handshake_State15server_finishedEv: 159| 126| const Finished_12* server_finished() const { return m_server_finished.get(); } _ZNK5Botan3TLS15Handshake_State15client_finishedEv: 161| 126| const Finished_12* client_finished() const { return m_client_finished.get(); } _ZNK5Botan3TLS15Handshake_State9callbacksEv: 171| 4.34k| Callbacks& callbacks() const { return m_callbacks; } _ZN5Botan3TLS15Handshake_State4hashEv: 177| 12.8k| Handshake_Hash& hash() { return m_handshake_hash; } _ZNK5Botan3TLS15Handshake_State4hashEv: 179| 1.35k| const Handshake_Hash& hash() const { return m_handshake_hash; } _ZNK5Botan3TLS8Internal23Handshake_State_13_Base16has_client_helloEv: 25| 2.30k| bool has_client_hello() const { return m_client_hello.has_value(); } _ZNK5Botan3TLS8Internal23Handshake_State_13_Base23has_hello_retry_requestEv: 33| 2.96k| bool has_hello_retry_request() const { return m_hello_retry_request.has_value(); } _ZNK5Botan3TLS8Internal23Handshake_State_13_Base19has_server_finishedEv: 37| 5.95k| bool has_server_finished() const { return m_server_finished.has_value(); } _ZNK5Botan3TLS8Internal23Handshake_State_13_Base18handshake_finishedEv: 41| 5.95k| bool handshake_finished() const { 42| 5.95k| return has_server_finished() && has_client_finished() && m_peer_finished_verified; ------------------ | Branch (42:17): [True: 0, False: 5.95k] | Branch (42:42): [True: 0, False: 0] | Branch (42:67): [True: 0, False: 0] ------------------ 43| 5.95k| } _ZN5Botan3TLS8Internal23Handshake_State_13_BaseC2ENS0_15Connection_SideE: 90| 5.50k| explicit Handshake_State_13_Base(Connection_Side whoami) : m_side(whoami) {} _ZN5Botan3TLS18Handshake_State_13ILNS0_15Connection_SideE2ENSt3__17variantIJNS0_15Server_Hello_13ENS0_20Server_Hello_12_ShimENS0_19Hello_Retry_RequestENS0_20Encrypted_ExtensionsENS0_14Certificate_13ENS0_22Certificate_Request_13ENS0_21Certificate_Verify_13ENS0_11Finished_13EEEENS4_IJNS0_15Client_Hello_13ENS0_20Client_Hello_12_ShimES9_SB_SC_EEENS4_IJNS0_10Key_UpdateEEEEE8receivedENS4_IJSE_SF_S5_S6_S7_S8_S9_SA_SB_SC_EEE: 176| 2.96k| decltype(auto) received(Handshake_Message_13 message) { 177| 2.96k| return std::visit( 178| 2.96k| [&](auto msg) -> detail::as_wrapped_references_t { 179| 2.96k| if constexpr(std::is_constructible_v) { 180| 2.96k| return std::reference_wrapper(store(std::move(msg), true)); 181| 2.96k| } else { 182| 2.96k| throw TLS_Exception(AlertType::UnexpectedMessage, "received an illegal handshake message"); 183| 2.96k| } 184| 2.96k| }, 185| 2.96k| std::move(message)); 186| 2.96k| } _ZZN5Botan3TLS18Handshake_State_13ILNS0_15Connection_SideE2ENSt3__17variantIJNS0_15Server_Hello_13ENS0_20Server_Hello_12_ShimENS0_19Hello_Retry_RequestENS0_20Encrypted_ExtensionsENS0_14Certificate_13ENS0_22Certificate_Request_13ENS0_21Certificate_Verify_13ENS0_11Finished_13EEEENS4_IJNS0_15Client_Hello_13ENS0_20Client_Hello_12_ShimES9_SB_SC_EEENS4_IJNS0_10Key_UpdateEEEEE8receivedENS4_IJSE_SF_S5_S6_S7_S8_S9_SA_SB_SC_EEEENKUlT_E_clISF_EENS4_IJNS3_17reference_wrapperISE_EENSO_ISF_EENSO_IS9_EENSO_ISB_EENSO_ISC_EEEEESL_: 178| 2.96k| [&](auto msg) -> detail::as_wrapped_references_t { 179| 2.96k| if constexpr(std::is_constructible_v) { 180| 2.96k| return std::reference_wrapper(store(std::move(msg), true)); 181| | } else { 182| | throw TLS_Exception(AlertType::UnexpectedMessage, "received an illegal handshake message"); 183| | } 184| 2.96k| }, _ZN5Botan3TLS18Handshake_State_13ILNS0_15Connection_SideE2ENSt3__17variantIJNS0_15Server_Hello_13ENS0_20Server_Hello_12_ShimENS0_19Hello_Retry_RequestENS0_20Encrypted_ExtensionsENS0_14Certificate_13ENS0_22Certificate_Request_13ENS0_21Certificate_Verify_13ENS0_11Finished_13EEEENS4_IJNS0_15Client_Hello_13ENS0_20Client_Hello_12_ShimES9_SB_SC_EEENS4_IJNS0_10Key_UpdateEEEEEC2Ev: 156| 5.50k| Handshake_State_13() : Handshake_State_13_Base(whoami) {} _ZNK5Botan3TLS21Client_Hello_Internal10extensionsEv: 101| 3.06k| const Extensions& extensions() const { return m_extensions; } _ZNK5Botan3TLS21Client_Hello_Internal14legacy_versionEv: 87| 3.01k| Protocol_Version legacy_version() const { return m_legacy_version; } _ZNK5Botan3TLS21Client_Hello_Internal6randomEv: 91| 1.28k| const std::vector& random() const { return m_random; } _ZNK5Botan3TLS21Client_Hello_Internal10session_idEv: 89| 2.75k| const Session_ID& session_id() const { return m_session_id; } _ZNK5Botan3TLS21Client_Hello_Internal12comp_methodsEv: 95| 2.94k| const std::vector& comp_methods() const { return m_comp_methods; } _ZNK5Botan3TLS21Client_Hello_Internal12ciphersuitesEv: 93| 11.7k| const std::vector& ciphersuites() const { return m_suites; } _ZN5Botan3TLS21Client_Hello_Internal10extensionsEv: 103| 61.3k| Extensions& extensions() { return m_extensions; } _ZN5Botan3TLS21Server_Hello_InternalC2ENS0_16Protocol_VersionENS_6StrongINSt3__16vectorIhNS4_9allocatorIhEEEENS0_11Session_ID_EJEEES8_thb: 136| 2.60k| m_legacy_version(lv), 137| 2.60k| m_session_id(std::move(sid)), 138| 2.60k| m_random(std::move(r)), 139| 2.60k| m_is_hello_retry_request(is_hrr), 140| 2.60k| m_ciphersuite(cs), 141| 2.60k| m_comp_method(cm) {} _ZNK5Botan3TLS21Server_Hello_Internal14legacy_versionEv: 145| 7.90k| Protocol_Version legacy_version() const { return m_legacy_version; } _ZNK5Botan3TLS21Server_Hello_Internal10session_idEv: 147| 2.79k| const Session_ID& session_id() const { return m_session_id; } _ZNK5Botan3TLS21Server_Hello_Internal6randomEv: 149| 3.89k| const std::vector& random() const { return m_random; } _ZNK5Botan3TLS21Server_Hello_Internal11ciphersuiteEv: 151| 10.5k| uint16_t ciphersuite() const { return m_ciphersuite; } _ZNK5Botan3TLS21Server_Hello_Internal11comp_methodEv: 153| 2.93k| uint8_t comp_method() const { return m_comp_method; } _ZNK5Botan3TLS21Server_Hello_Internal22is_hello_retry_requestEv: 155| 44| bool is_hello_retry_request() const { return m_is_hello_retry_request; } _ZNK5Botan3TLS21Server_Hello_Internal10extensionsEv: 157| 2.71k| const Extensions& extensions() const { return m_extensions; } _ZN5Botan3TLS21Server_Hello_Internal10extensionsEv: 159| 13.0k| Extensions& extensions() { return m_extensions; } _ZN5Botan3TLS15TLS_Data_ReaderC2EPKcNSt3__14spanIKhLm18446744073709551615EEE: 27| 50.8k| m_typename(type), m_buf(buf_in), m_offset(0) {} _ZN5Botan3TLS15TLS_Data_Reader8get_byteEv: 83| 35.5k| uint8_t get_byte() { 84| 35.5k| assert_at_least(1); 85| 35.5k| const uint8_t result = m_buf[m_offset]; 86| 35.5k| m_offset += 1; 87| 35.5k| return result; 88| 35.5k| } _ZN5Botan3TLS15TLS_Data_Reader20get_data_read_so_farEv: 46| 160| std::vector get_data_read_so_far() { 47| 160| const std::span first = m_buf.first(m_offset); 48| 160| return std::vector(first.begin(), first.end()); 49| 160| } _ZN5Botan3TLS15TLS_Data_Reader13get_remainingEv: 41| 154| std::vector get_remaining() { 42| 154| const std::span rest = m_buf.subspan(m_offset); 43| 154| return std::vector(rest.begin(), rest.end()); 44| 154| } _ZN5Botan3TLS15TLS_Data_Reader9get_fixedIhEENSt3__16vectorIT_NS3_9allocatorIS5_EEEEm: 129| 76.6k| std::vector get_fixed(size_t size) { 130| 76.6k| return get_elem>(size); 131| 76.6k| } _ZN5Botan3TLS15TLS_Data_Reader8get_elemIhNSt3__16vectorIhNS3_9allocatorIhEEEEEET0_m: 91| 97.3k| Container get_elem(size_t num_elems) { 92| 97.3k| assert_at_least(num_elems * sizeof(T)); 93| | 94| 97.3k| Container result(num_elems); 95| | 96| 1.05M| for(size_t i = 0; i != num_elems; ++i) { ------------------ | Branch (96:28): [True: 956k, False: 97.3k] ------------------ 97| 956k| result[i] = load_be(&m_buf[m_offset], i); 98| 956k| } 99| | 100| 97.3k| m_offset += num_elems * sizeof(T); 101| | 102| 97.3k| return result; 103| 97.3k| } _ZN5Botan3TLS15TLS_Data_Reader16get_range_vectorIhEENSt3__16vectorIT_NS3_9allocatorIS5_EEEEmmm: 117| 10.3k| std::vector get_range_vector(size_t len_bytes, size_t min_elems, size_t max_elems) { 118| 10.3k| const size_t num_elems = get_num_elems(len_bytes, sizeof(T), min_elems, max_elems); 119| | 120| 10.3k| return get_elem>(num_elems); 121| 10.3k| } _ZN5Botan3TLS15TLS_Data_Reader13get_num_elemsEmmmm: 148| 27.4k| size_t get_num_elems(size_t len_bytes, size_t T_size, size_t min_elems, size_t max_elems) { 149| 27.4k| const size_t byte_length = get_length_field(len_bytes); 150| | 151| 27.4k| if(byte_length % T_size != 0) { ------------------ | Branch (151:13): [True: 6, False: 27.4k] ------------------ 152| 6| throw_decode_error("Size isn't multiple of T"); 153| 6| } 154| | 155| 27.4k| const size_t num_elems = byte_length / T_size; 156| | 157| 27.4k| if(num_elems < min_elems || num_elems > max_elems) { ------------------ | Branch (157:13): [True: 49, False: 27.4k] | Branch (157:38): [True: 25, False: 27.4k] ------------------ 158| 47| throw_decode_error("Length field outside parameters"); 159| 47| } 160| | 161| 27.4k| return num_elems; 162| 27.4k| } _ZN5Botan3TLS15TLS_Data_Reader16get_length_fieldEm: 134| 28.7k| size_t get_length_field(size_t len_bytes) { 135| 28.7k| assert_at_least(len_bytes); 136| | 137| 28.7k| if(len_bytes == 1) { ------------------ | Branch (137:13): [True: 18.2k, False: 10.5k] ------------------ 138| 18.2k| return get_byte(); 139| 18.2k| } else if(len_bytes == 2) { ------------------ | Branch (139:20): [True: 10.0k, False: 506] ------------------ 140| 10.0k| return get_uint16_t(); 141| 10.0k| } else if(len_bytes == 3) { ------------------ | Branch (141:20): [True: 484, False: 22] ------------------ 142| 484| return get_uint24_t(); 143| 484| } 144| | 145| 22| throw_decode_error("Bad length size"); 146| 22| } _ZN5Botan3TLS15TLS_Data_Reader12get_uint16_tEv: 71| 159k| uint16_t get_uint16_t() { 72| 159k| assert_at_least(2); 73| 159k| const uint16_t result = make_uint16(m_buf[m_offset], m_buf[m_offset + 1]); 74| 159k| m_offset += 2; 75| 159k| return result; 76| 159k| } _ZN5Botan3TLS15TLS_Data_Reader12get_uint24_tEv: 64| 1.00k| uint32_t get_uint24_t() { 65| 1.00k| assert_at_least(3); 66| 1.00k| const uint32_t result = make_uint32(0, m_buf[m_offset], m_buf[m_offset + 1], m_buf[m_offset + 2]); 67| 1.00k| m_offset += 3; 68| 1.00k| return result; 69| 1.00k| } _ZN5Botan3TLS15TLS_Data_Reader9get_rangeIhEENSt3__16vectorIT_NS3_9allocatorIS5_EEEEmmm: 110| 10.2k| std::vector get_range(size_t len_bytes, size_t min_elems, size_t max_elems) { 111| 10.2k| const size_t num_elems = get_num_elems(len_bytes, sizeof(T), min_elems, max_elems); 112| | 113| 10.2k| return get_elem>(num_elems); 114| 10.2k| } _ZN5Botan3TLS15TLS_Data_Reader16get_range_vectorItEENSt3__16vectorIT_NS3_9allocatorIS5_EEEEmmm: 117| 6.72k| std::vector get_range_vector(size_t len_bytes, size_t min_elems, size_t max_elems) { 118| 6.72k| const size_t num_elems = get_num_elems(len_bytes, sizeof(T), min_elems, max_elems); 119| | 120| 6.72k| return get_elem>(num_elems); 121| 6.72k| } _ZN5Botan3TLS15TLS_Data_Reader8get_elemItNSt3__16vectorItNS3_9allocatorItEEEEEET0_m: 91| 6.82k| Container get_elem(size_t num_elems) { 92| 6.82k| assert_at_least(num_elems * sizeof(T)); 93| | 94| 6.82k| Container result(num_elems); 95| | 96| 69.5k| for(size_t i = 0; i != num_elems; ++i) { ------------------ | Branch (96:28): [True: 62.6k, False: 6.82k] ------------------ 97| 62.6k| result[i] = load_be(&m_buf[m_offset], i); 98| 62.6k| } 99| | 100| 6.82k| m_offset += num_elems * sizeof(T); 101| | 102| 6.82k| return result; 103| 6.82k| } _ZN5Botan3TLS23append_tls_length_valueIhNSt3__19allocatorIhEES4_EEvRNS2_6vectorIhT0_EERKNS5_IT_T1_EEm: 209| 5.23k| size_t tag_size) { 210| 5.23k| append_tls_length_value(buf, std::span{vals}, tag_size); 211| 5.23k|} _ZN5Botan3TLS23append_tls_length_valueIhNSt3__19allocatorIhEEEEvRNS2_6vectorIhT0_EENS2_4spanIKT_Lm18446744073709551615EEEm: 202| 7.85k|inline void append_tls_length_value(std::vector& buf, std::span vals, size_t tag_size) { 203| 7.85k| append_tls_length_value(buf, vals.data(), vals.size(), tag_size); 204| 7.85k|} _ZN5Botan3TLS23append_tls_length_valueIhNSt3__19allocatorIhEEEEvRNS2_6vectorIhT0_EEPKT_mm: 180| 7.85k| size_t tag_size) { 181| 7.85k| const size_t T_size = sizeof(T); 182| 7.85k| const size_t val_bytes = T_size * vals_size; 183| | 184| 7.85k| BOTAN_ARG_CHECK(tag_size == 1 || tag_size == 2 || tag_size == 3, "Invalid TLS tag size"); ------------------ | | 35| 7.85k| do { \ | | 36| 7.85k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 18.3k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 5.25k, False: 2.60k] | | | Branch (37:12): [True: 2.60k, 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| 7.85k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 7.85k] | | ------------------ ------------------ 185| | 186| 7.85k| const size_t max_possible_size = (1 << (8 * tag_size)) - 1; 187| | 188| 7.85k| BOTAN_ARG_CHECK(val_bytes <= max_possible_size, "Value too large to encode"); ------------------ | | 35| 7.85k| do { \ | | 36| 7.85k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 7.85k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 7.85k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 7.85k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 7.85k] | | ------------------ ------------------ 189| | 190| 18.3k| for(size_t i = 0; i != tag_size; ++i) { ------------------ | Branch (190:22): [True: 10.4k, False: 7.85k] ------------------ 191| 10.4k| buf.push_back(get_byte_var(sizeof(val_bytes) - tag_size + i, val_bytes)); 192| 10.4k| } 193| | 194| 338k| for(size_t i = 0; i != vals_size; ++i) { ------------------ | Branch (194:22): [True: 330k, False: 7.85k] ------------------ 195| 661k| for(size_t j = 0; j != T_size; ++j) { ------------------ | Branch (195:25): [True: 330k, False: 330k] ------------------ 196| 330k| buf.push_back(get_byte_var(j, vals[i])); 197| 330k| } 198| 330k| } 199| 7.85k|} _ZNK5Botan3TLS15TLS_Data_Reader11assert_doneEv: 29| 41.5k| void assert_done() const { 30| 41.5k| if(has_remaining()) { ------------------ | Branch (30:13): [True: 234, False: 41.2k] ------------------ 31| 234| throw_decode_error("Extra bytes at end of message"); 32| 234| } 33| 41.5k| } _ZNK5Botan3TLS15TLS_Data_Reader11read_so_farEv: 35| 935| size_t read_so_far() const { return m_offset; } _ZNK5Botan3TLS15TLS_Data_Reader15remaining_bytesEv: 37| 477k| size_t remaining_bytes() const { return m_buf.size() - m_offset; } _ZNK5Botan3TLS15TLS_Data_Reader13has_remainingEv: 39| 98.1k| bool has_remaining() const { return (remaining_bytes() > 0); } _ZN5Botan3TLS15TLS_Data_Reader12discard_nextEm: 51| 379| void discard_next(size_t bytes) { 52| 379| assert_at_least(bytes); 53| 379| m_offset += bytes; 54| 379| } _ZN5Botan3TLS15TLS_Data_Reader12get_uint32_tEv: 56| 448| uint32_t get_uint32_t() { 57| 448| assert_at_least(4); 58| 448| const uint32_t result = 59| 448| make_uint32(m_buf[m_offset], m_buf[m_offset + 1], m_buf[m_offset + 2], m_buf[m_offset + 3]); 60| 448| m_offset += 4; 61| 448| return result; 62| 448| } _ZN5Botan3TLS15TLS_Data_Reader20get_tls_length_valueEm: 105| 1.26k| std::vector get_tls_length_value(size_t len_bytes) { 106| 1.26k| return get_fixed(get_length_field(len_bytes)); 107| 1.26k| } _ZN5Botan3TLS15TLS_Data_Reader10get_stringEmmm: 123| 3.66k| std::string get_string(size_t len_bytes, size_t min_bytes, size_t max_bytes) { 124| 3.66k| std::vector v = get_range_vector(len_bytes, min_bytes, max_bytes); 125| 3.66k| return bytes_to_string(v); 126| 3.66k| } _ZN5Botan3TLS23append_tls_length_valueINSt3__19allocatorIhEEEEvRNS2_6vectorIhT_EENS2_17basic_string_viewIcNS2_11char_traitsIcEEEEm: 214| 2.62k|inline void append_tls_length_value(std::vector& buf, std::string_view str, size_t tag_size) { 215| 2.62k| append_tls_length_value(buf, as_span_of_bytes(str), tag_size); 216| 2.62k|} _ZN5Botan3TLS15TLS_Data_Reader9get_rangeItEENSt3__16vectorIT_NS3_9allocatorIS5_EEEEmmm: 110| 146| std::vector get_range(size_t len_bytes, size_t min_elems, size_t max_elems) { 111| 146| const size_t num_elems = get_num_elems(len_bytes, sizeof(T), min_elems, max_elems); 112| | 113| 146| return get_elem>(num_elems); 114| 146| } _ZN5Botan3TLS23append_tls_length_valueIhNS_16secure_allocatorIhEENSt3__19allocatorIhEEEEvRNS4_6vectorIhT0_EERKNS7_IT_T1_EEm: 209| 30| size_t tag_size) { 210| 30| append_tls_length_value(buf, std::span{vals}, tag_size); 211| 30|} _ZN5Botan3TLS23append_tls_length_valueIhNS_16secure_allocatorIhEEEEvRNSt3__16vectorIhT0_EENS4_4spanIKT_Lm18446744073709551615EEEm: 202| 2.89k|inline void append_tls_length_value(std::vector& buf, std::span vals, size_t tag_size) { 203| 2.89k| append_tls_length_value(buf, vals.data(), vals.size(), tag_size); 204| 2.89k|} _ZN5Botan3TLS23append_tls_length_valueIhNS_16secure_allocatorIhEEEEvRNSt3__16vectorIhT0_EEPKT_mm: 180| 2.89k| size_t tag_size) { 181| 2.89k| const size_t T_size = sizeof(T); 182| 2.89k| const size_t val_bytes = T_size * vals_size; 183| | 184| 2.89k| BOTAN_ARG_CHECK(tag_size == 1 || tag_size == 2 || tag_size == 3, "Invalid TLS tag size"); ------------------ | | 35| 2.89k| do { \ | | 36| 2.89k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 8.67k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 0, False: 2.89k] | | | Branch (37:12): [True: 2.89k, 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| 2.89k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.89k] | | ------------------ ------------------ 185| | 186| 2.89k| const size_t max_possible_size = (1 << (8 * tag_size)) - 1; 187| | 188| 2.89k| BOTAN_ARG_CHECK(val_bytes <= max_possible_size, "Value too large to encode"); ------------------ | | 35| 2.89k| do { \ | | 36| 2.89k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.89k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2.89k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2.89k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.89k] | | ------------------ ------------------ 189| | 190| 8.67k| for(size_t i = 0; i != tag_size; ++i) { ------------------ | Branch (190:22): [True: 5.78k, False: 2.89k] ------------------ 191| 5.78k| buf.push_back(get_byte_var(sizeof(val_bytes) - tag_size + i, val_bytes)); 192| 5.78k| } 193| | 194| 91.4k| for(size_t i = 0; i != vals_size; ++i) { ------------------ | Branch (194:22): [True: 88.5k, False: 2.89k] ------------------ 195| 177k| for(size_t j = 0; j != T_size; ++j) { ------------------ | Branch (195:25): [True: 88.5k, False: 88.5k] ------------------ 196| 88.5k| buf.push_back(get_byte_var(j, vals[i])); 197| 88.5k| } 198| 88.5k| } 199| 2.89k|} _ZN5Botan3TLS23append_tls_length_valueIhNS_16secure_allocatorIhEES3_EEvRNSt3__16vectorIhT0_EERKNS5_IT_T1_EEm: 209| 2.86k| size_t tag_size) { 210| 2.86k| append_tls_length_value(buf, std::span{vals}, tag_size); 211| 2.86k|} _ZNK5Botan3TLS13Record_Header6neededEv: 117| 11.6k| size_t needed() const { return m_needed; } _ZNK5Botan3TLS13Record_Header4typeEv: 131| 50.8k| Record_Type type() const { 132| 50.8k| BOTAN_ASSERT_NOMSG(m_needed == 0); ------------------ | | 84| 50.8k| do { \ | | 85| 50.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 50.8k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 50.8k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 50.8k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 50.8k] | | ------------------ ------------------ 133| 50.8k| return m_type; 134| 50.8k| } _ZNK5Botan3TLS13Record_Header5epochEv: 129| 7.41k| uint16_t epoch() const { return static_cast(sequence() >> 48); } _ZNK5Botan3TLS13Record_Header7versionEv: 119| 18.8k| Protocol_Version version() const { 120| 18.8k| BOTAN_ASSERT_NOMSG(m_needed == 0); ------------------ | | 84| 18.8k| do { \ | | 85| 18.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 18.8k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 18.8k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 18.8k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 18.8k] | | ------------------ ------------------ 121| 18.8k| return m_version; 122| 18.8k| } _ZNK5Botan3TLS13Record_Header8sequenceEv: 124| 17.5k| uint64_t sequence() const { 125| 17.5k| BOTAN_ASSERT_NOMSG(m_needed == 0); ------------------ | | 84| 17.5k| do { \ | | 85| 17.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 17.5k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 17.5k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 17.5k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 17.5k] | | ------------------ ------------------ 126| 17.5k| return m_sequence; 127| 17.5k| } _ZN5Botan3TLS12Record_NonceC2Em: 47| 308| explicit Record_Nonce(size_t len) : m_len(len) { BOTAN_ARG_CHECK(len <= MAX_NONCE_LEN, "Nonce is too long"); } ------------------ | | 35| 308| do { \ | | 36| 308| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 308| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 308] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 308| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 308] | | ------------------ ------------------ _ZN5Botan3TLS12Record_Nonce3getEv: 49| 518| std::span get() { return std::span{m_nonce}.first(m_len); } _ZNK5Botan3TLS12Record_Nonce3getEv: 51| 377| std::span get() const { return std::span{m_nonce}.first(m_len); } _ZN5Botan3TLS23Connection_Cipher_State4aeadEv: 81| 315| AEAD_Mode& aead() { 82| 315| BOTAN_ASSERT_NONNULL(m_aead.get()); ------------------ | | 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] | | ------------------ ------------------ 83| 315| return *m_aead; 84| 315| } _ZNK5Botan3TLS23Connection_Cipher_State26nonce_bytes_from_handshakeEv: 95| 131| size_t nonce_bytes_from_handshake() const { return m_nonce_bytes_from_handshake; } _ZNK5Botan3TLS23Connection_Cipher_State23nonce_bytes_from_recordEv: 97| 868| size_t nonce_bytes_from_record() const { return m_nonce_bytes_from_record; } _ZNK5Botan3TLS23Connection_Cipher_State12nonce_formatEv: 99| 610| Nonce_Format nonce_format() const { return m_nonce_format; } _ZN5Botan3TLS13Record_HeaderC2EmNS0_16Protocol_VersionENS0_11Record_TypeE: 113| 11.1k| m_needed(0), m_sequence(sequence), m_version(version), m_type(type) {} _ZN5Botan3TLS13Record_HeaderC2Em: 115| 461| explicit Record_Header(size_t needed) : m_needed(needed), m_sequence(0), m_type(Record_Type::Invalid) {} _ZNK5Botan3TLS10Record_TLS15header_completeEv: 88| 424k| bool header_complete() const { return m_header_bytes_stored == TLS_HEADER_SIZE; } _ZNK5Botan3TLS10Record_TLS8completeEv: 91| 109k| bool complete() const { return missing_bytes_hint() == 0; } _ZN5Botan3TLS10Record_TLSD2Ev: 67| 57.3k| ~Record_TLS() = default; _ZN5Botan3TLS10Record_TLSC2Ev: 61| 35.8k| Record_TLS() = default; _ZN5Botan3TLS10Record_TLSC2EOS1_: 64| 21.5k| Record_TLS(Record_TLS&&) = default; _ZN5Botan3TLS12Record_Layer29disable_receiving_compat_modeEv: 133| 3.17k| void disable_receiving_compat_mode() noexcept { m_receiving_compat_mode = false; } _ZN5Botan3TLS12Record_LayerD2Ev: 38| 5.50k| virtual ~Record_Layer() = default; _ZNK5Botan3TLS12Record_Layer21receiving_compat_modeEv: 135| 21.5k| bool receiving_compat_mode() const noexcept { return m_receiving_compat_mode; } _ZN5Botan3TLS25Datagram_Sequence_NumbersC2Emm: 90| 610| uint64_t initial_write_sequence_number = 0) { 91| 610| Datagram_Sequence_Numbers::reset(); 92| | 93| 610| const auto is_epoch0 = ((initial_read_sequence_number >> 48) + (initial_write_sequence_number >> 48)) == 0; 94| 610| BOTAN_ARG_CHECK(is_epoch0, "Initial sequence numbers must be in epoch 0"); ------------------ | | 35| 610| do { \ | | 36| 610| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 610| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 610] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 610| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 610] | | ------------------ ------------------ 95| | 96| 610| m_write_seqs[0] = initial_write_sequence_number; 97| 610| } _ZN5Botan3TLS25Datagram_Sequence_Numbers5resetEv: 99| 610| void reset() override { 100| 610| m_write_seqs.clear(); 101| 610| m_write_seqs[0] = 0; 102| 610| m_write_epoch = 0; 103| 610| m_read_epoch = 0; 104| 610| m_read_windows.clear(); 105| 610| m_read_windows[0] = Replay_Window{}; 106| 610| } _ZN5Botan3TLS27Connection_Sequence_NumbersD2Ev: 20| 3.57k| virtual ~Connection_Sequence_Numbers() = default; _ZNK5Botan3TLS25Datagram_Sequence_Numbers18current_read_epochEv: 120| 610| uint16_t current_read_epoch() const override { return m_read_epoch; } _ZNK5Botan3TLS25Datagram_Sequence_Numbers19current_write_epochEv: 122| 980| uint16_t current_write_epoch() const override { return m_write_epoch; } _ZN5Botan3TLS25Datagram_Sequence_Numbers19next_write_sequenceEt: 124| 370| uint64_t next_write_sequence(uint16_t epoch) override { 125| 370| const auto i = m_write_seqs.find(epoch); 126| 370| if(i == m_write_seqs.end()) { ------------------ | Branch (126:13): [True: 0, False: 370] ------------------ 127| 0| throw Invalid_State("DTLS epoch not found"); 128| 0| } 129| 370| if(i->second > 0x0000FFFFFFFFFFFF) { ------------------ | Branch (129:13): [True: 0, False: 370] ------------------ 130| 0| throw Invalid_State("DTLS write sequence number overflow"); 131| 0| } 132| 370| return (static_cast(epoch) << 48) | i->second++; 133| 370| } _ZNK5Botan3TLS25Datagram_Sequence_Numbers12already_seenEm: 137| 2.47k| bool already_seen(uint64_t sequence) const override { 138| 2.47k| const uint16_t epoch = static_cast(sequence >> 48); 139| 2.47k| const uint64_t record_sequence = sequence & 0x0000FFFFFFFFFFFF; 140| 2.47k| const auto window = m_read_windows.find(epoch); 141| | 142| 2.47k| if(window == m_read_windows.end()) { ------------------ | Branch (142:13): [True: 12, False: 2.45k] ------------------ 143| 12| return false; 144| 12| } 145| | 146| 2.45k| const size_t window_size = sizeof(window->second.bits) * 8; 147| | 148| 2.45k| if(record_sequence > window->second.highest) { ------------------ | Branch (148:13): [True: 2.01k, False: 446] ------------------ 149| 2.01k| return false; 150| 2.01k| } 151| | 152| 446| const uint64_t offset = window->second.highest - record_sequence; 153| | 154| 446| if(offset >= window_size) { ------------------ | Branch (154:13): [True: 0, False: 446] ------------------ 155| 0| return true; // really old? 156| 0| } 157| | 158| 446| return (((window->second.bits >> offset) & 1) == 1); 159| 446| } _ZN5Botan3TLS23Stream_Sequence_NumbersC2Ev: 39| 2.96k| Stream_Sequence_Numbers() : m_write_seq_no(0), m_read_seq_no(0), m_read_epoch(0), m_write_epoch(0) {} _ZN5Botan3TLS23Stream_Sequence_Numbers21new_read_cipher_stateEv: 48| 257| void new_read_cipher_state() override { 49| 257| m_read_seq_no = 0; 50| 257| m_read_epoch++; 51| 257| } _ZN5Botan3TLS23Stream_Sequence_Numbers22new_write_cipher_stateEv: 53| 63| void new_write_cipher_state() override { 54| 63| m_write_seq_no = 0; 55| 63| m_write_epoch++; 56| 63| } _ZNK5Botan3TLS23Stream_Sequence_Numbers18current_read_epochEv: 58| 7.62k| uint16_t current_read_epoch() const override { return m_read_epoch; } _ZNK5Botan3TLS23Stream_Sequence_Numbers19current_write_epochEv: 60| 12.4k| uint16_t current_write_epoch() const override { return m_write_epoch; } _ZN5Botan3TLS23Stream_Sequence_Numbers19next_write_sequenceEt: 62| 9.37k| uint64_t next_write_sequence(uint16_t /*epoch*/) override { 63| 9.37k| if(m_write_seq_no == std::numeric_limits::max()) { ------------------ | Branch (63:13): [True: 0, False: 9.37k] ------------------ 64| 0| throw Invalid_State("TLS 1.2 write sequence number overflow"); 65| 0| } 66| 9.37k| return m_write_seq_no++; 67| 9.37k| } _ZN5Botan3TLS23Stream_Sequence_Numbers18next_read_sequenceEv: 69| 4.39k| uint64_t next_read_sequence() override { return m_read_seq_no; } _ZN5Botan3TLS14Server_Impl_1220create_for_downgradeERKNS0_12Channel_Impl21Downgrade_InformationE: 68| 2.96k| const Channel_Impl::Downgrade_Information& downgrade_info) { 69| 2.96k| return std::make_shared(Private{}, downgrade_info); 70| 2.96k| } _ZN5Botan3TLS14Server_Impl_12C2ENS0_12Channel_Impl7PrivateERKNS2_21Downgrade_InformationE: 73| 2.96k| Channel_Impl_12(downgrade_info.callbacks, 74| 2.96k| downgrade_info.session_manager, 75| 2.96k| downgrade_info.rng, 76| 2.96k| downgrade_info.policy, 77| 2.96k| true /* is_server*/, 78| 2.96k| downgrade_info.flavor, 79| 2.96k| downgrade_info.io_buffer_size), 80| 2.96k| m_creds(downgrade_info.creds) {} _ZN5Botan3TLS14Server_Impl_12C2ENS0_12Channel_Impl7PrivateERKNSt3__110shared_ptrINS0_9CallbacksEEERKNS5_INS0_15Session_ManagerEEERKNS5_INS_19Credentials_ManagerEEERKNS5_IKNS0_6PolicyEEERKNS5_INS_21RandomNumberGeneratorEEENS0_10TLS_FlavorEm: 62| 759| Channel_Impl_12(callbacks, session_manager, rng, policy, true, flavor, reserved_io_buffer_size), 63| 759| m_creds(creds) {} _ZNK5Botan3TLS14Server_Impl_1220application_protocolEv: 91| 63| std::string application_protocol() const override { return m_next_protocol; } _ZN5Botan3TLS14Server_Impl_13C2ENS0_12Channel_Impl7PrivateERKNSt3__110shared_ptrINS0_9CallbacksEEERKNS5_INS0_15Session_ManagerEEERKNS5_INS_19Credentials_ManagerEEERKNS5_IKNS0_6PolicyEEERKNS5_INS_21RandomNumberGeneratorEEE: 35| 5.50k| Channel_Impl_13(callbacks, session_manager, credentials_manager, rng, policy, true /* is_server */), 36| 5.50k| m_handshake(std::make_unique()) {} _ZNK5Botan3TLS12Session_Keys15client_aead_keyEv: 26| 257| const secure_vector& client_aead_key() const { return m_c_aead; } _ZNK5Botan3TLS12Session_Keys15server_aead_keyEv: 31| 63| const secure_vector& server_aead_key() const { return m_s_aead; } _ZNK5Botan3TLS12Session_Keys12client_nonceEv: 36| 257| const std::vector& client_nonce() const { return m_c_nonce; } _ZNK5Botan3TLS12Session_Keys12server_nonceEv: 41| 63| const std::vector& server_nonce() const { return m_s_nonce; } _ZNK5Botan3TLS12Session_Keys13master_secretEv: 46| 252| const secure_vector& master_secret() const { return m_master_sec; } _ZNK5Botan3TLS12Session_Keys8aead_keyENS0_15Connection_SideE: 48| 320| const secure_vector& aead_key(Connection_Side side) const { 49| 320| return (side == Connection_Side::Client) ? client_aead_key() : server_aead_key(); ------------------ | Branch (49:17): [True: 257, False: 63] ------------------ 50| 320| } _ZNK5Botan3TLS12Session_Keys5nonceENS0_15Connection_SideE: 52| 320| const std::vector& nonce(Connection_Side side) const { 53| 320| return (side == Connection_Side::Client) ? client_nonce() : server_nonce(); ------------------ | Branch (53:17): [True: 257, False: 63] ------------------ 54| 320| } _ZN5Botan3TLS12Session_KeysC2Ev: 56| 3.57k| Session_Keys() = default; _ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEhQntsr3stdE7same_asIbT_EEES3_S3_: 43| 66.7k|constexpr inline T value_barrier(T x) { 44| 66.7k| if(std::is_constant_evaluated()) { ------------------ | Branch (44:7): [Folded, False: 66.7k] ------------------ 45| 0| return x; 46| 66.7k| } else { 47| 66.7k|#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| 66.7k| asm("" : "+r"(x) : /* no input */); // NOLINT(*-no-assembler) 56| 66.7k| 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| 66.7k| } 64| 66.7k|} _ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEmQntsr3stdE7same_asIbT_EEES3_S3_: 43| 236M|constexpr inline T value_barrier(T x) { 44| 236M| if(std::is_constant_evaluated()) { ------------------ | Branch (44:7): [Folded, False: 236M] ------------------ 45| 0| return x; 46| 236M| } else { 47| 236M|#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| 236M| asm("" : "+r"(x) : /* no input */); // NOLINT(*-no-assembler) 56| 236M| 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| 236M| } 64| 236M|} _ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEjQntsr3stdE7same_asIbT_EEES3_S3_: 43| 296k|constexpr inline T value_barrier(T x) { 44| 296k| if(std::is_constant_evaluated()) { ------------------ | Branch (44:7): [Folded, False: 296k] ------------------ 45| 0| return x; 46| 296k| } else { 47| 296k|#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| 296k| asm("" : "+r"(x) : /* no input */); // NOLINT(*-no-assembler) 56| 296k| 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| 296k| } 64| 296k|} _ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEtQntsr3stdE7same_asIbT_EEES3_S3_: 43| 92.3k|constexpr inline T value_barrier(T x) { 44| 92.3k| if(std::is_constant_evaluated()) { ------------------ | Branch (44:7): [Folded, False: 92.3k] ------------------ 45| 0| return x; 46| 92.3k| } else { 47| 92.3k|#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| 92.3k| asm("" : "+r"(x) : /* no input */); // NOLINT(*-no-assembler) 56| 92.3k| 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| 92.3k| } 64| 92.3k|} _ZN5Botan13x25519_ladderENSt3__14spanIhLm32EEENS1_IKhLm32EEES4_: 347| 2| std::span u) { 348| 2| const auto x1 = X25519_FE::decode(u); 349| | 350| 2| auto x2 = X25519_FE::one(); 351| 2| auto z2 = X25519_FE(); 352| 2| auto x3 = x1; 353| 2| auto z3 = X25519_FE::one(); 354| | 355| 2| auto swap = CT::Mask::cleared(); 356| | 357| | // Bit 255 of a clamped scalar is always zero, so start at bit 254 358| 512| for(size_t t = 255; t-- > 0;) { ------------------ | Branch (358:24): [True: 510, False: 2] ------------------ 359| 510| const auto kt = CT::Mask::expand_bit(static_cast(k[t / 8]), t % 8); 360| 510| swap = swap ^ kt; 361| 510| X25519_FE::conditional_swap(swap, x2, x3); 362| 510| X25519_FE::conditional_swap(swap, z2, z3); 363| 510| swap = kt; 364| | 365| 510| const auto A = x2 + z2; 366| 510| const auto B = x2 - z2; 367| 510| const auto C = x3 + z3; 368| 510| const auto D = x3 - z3; 369| 510| const auto AA = A.sqr(); 370| 510| const auto BB = B.sqr(); 371| 510| const auto E = AA - BB; 372| 510| const auto DA = D * A; 373| 510| const auto CB = C * B; 374| | 375| 510| x3 = (DA + CB).sqr(); 376| 510| z3 = x1 * (DA - CB).sqr(); 377| 510| x2 = AA * BB; 378| 510| z2 = E * (AA + E.mul_a24()); 379| 510| } 380| | 381| 2| X25519_FE::conditional_swap(swap, x2, x3); 382| 2| X25519_FE::conditional_swap(swap, z2, z3); 383| | 384| 2| const auto result = x2 * z2.invert(); 385| 2| result.encode(out); 386| 2|} _ZN5Botan9X25519_FE6decodeENSt3__14spanIKhLm32EEE: 74| 2| BOTAN_FORCE_INLINE static X25519_FE decode(std::span in) { 75| 2| X25519_FE r; 76| 2| r.m_v[0] = load_le(in.data(), 0) & MASK_51; 77| 2| r.m_v[1] = (load_le(in.data() + 6, 0) >> 3) & MASK_51; 78| 2| r.m_v[2] = (load_le(in.data() + 12, 0) >> 6) & MASK_51; 79| 2| r.m_v[3] = (load_le(in.data() + 19, 0) >> 1) & MASK_51; 80| 2| r.m_v[4] = (load_le(in.data() + 24, 0) >> 12) & MASK_51; 81| 2| return r; 82| 2| } _ZN5Botan9X25519_FE3oneEv: 61| 4| constexpr static X25519_FE one() { 62| 4| X25519_FE r; 63| 4| r.m_v[0] = 1; 64| 4| return r; 65| 4| } _ZN5Botan9X25519_FEC2Ev: 59| 9.72k| constexpr X25519_FE() : m_v{} {} _ZN5Botan9X25519_FE16conditional_swapENS_2CT4MaskImEERS0_S4_: 298| 1.02k| BOTAN_FORCE_INLINE static void conditional_swap(CT::Mask swap, X25519_FE& a, X25519_FE& b) { 299| 6.14k| for(size_t i = 0; i != 5; ++i) { ------------------ | Branch (299:28): [True: 5.12k, False: 1.02k] ------------------ 300| 5.12k| const uint64_t x = swap.if_set_return(a.m_v[i] ^ b.m_v[i]); 301| 5.12k| a.m_v[i] ^= x; 302| 5.12k| b.m_v[i] ^= x; 303| 5.12k| } 304| 1.02k| } _ZN5BotanplERKNS_9X25519_FEES2_: 150| 2.04k| BOTAN_FORCE_INLINE friend X25519_FE operator+(const X25519_FE& a, const X25519_FE& b) { 151| 2.04k| X25519_FE r; 152| 12.2k| for(size_t i = 0; i != 5; ++i) { ------------------ | Branch (152:28): [True: 10.2k, False: 2.04k] ------------------ 153| 10.2k| r.m_v[i] = a.m_v[i] + b.m_v[i]; 154| 10.2k| } 155| 2.04k| return r; 156| 2.04k| } _ZN5BotanmiERKNS_9X25519_FEES2_: 161| 2.04k| BOTAN_FORCE_INLINE friend X25519_FE operator-(const X25519_FE& a, const X25519_FE& b) { 162| | // 8p = 2^258 - 152 in radix 2^51, with each limb biased to be positive 163| 2.04k| constexpr uint64_t two54m152 = (static_cast(1) << 54) - 152; 164| 2.04k| constexpr uint64_t two54m8 = (static_cast(1) << 54) - 8; 165| | 166| 2.04k| X25519_FE r; 167| 2.04k| r.m_v[0] = a.m_v[0] + two54m152 - b.m_v[0]; 168| 2.04k| r.m_v[1] = a.m_v[1] + two54m8 - b.m_v[1]; 169| 2.04k| r.m_v[2] = a.m_v[2] + two54m8 - b.m_v[2]; 170| 2.04k| r.m_v[3] = a.m_v[3] + two54m8 - b.m_v[3]; 171| 2.04k| r.m_v[4] = a.m_v[4] + two54m8 - b.m_v[4]; 172| 2.04k| return r; 173| 2.04k| } _ZNK5Botan9X25519_FE3sqrEv: 203| 2.54k| BOTAN_FORCE_INLINE X25519_FE sqr() const { 204| 2.54k| const uint64_t a0 = m_v[0]; 205| 2.54k| const uint64_t a1 = m_v[1]; 206| 2.54k| const uint64_t a2 = m_v[2]; 207| 2.54k| const uint64_t a3 = m_v[3]; 208| 2.54k| const uint64_t a4 = m_v[4]; 209| | 210| 2.54k| const uint64_t a0_2 = a0 * 2; 211| 2.54k| const uint64_t a1_2 = a1 * 2; 212| 2.54k| const uint64_t a2_38 = a2 * 38; 213| 2.54k| const uint64_t a3_19 = a3 * 19; 214| 2.54k| const uint64_t a4_19 = a4 * 19; 215| 2.54k| const uint64_t a4_38 = a4_19 * 2; 216| | 217| 2.54k| const uint128_t t0 = mul(a0, a0) + mul(a1, a4_38) + mul(a3, a2_38); 218| 2.54k| const uint128_t t1 = mul(a0_2, a1) + mul(a2, a4_38) + mul(a3, a3_19); 219| 2.54k| const uint128_t t2 = mul(a0_2, a2) + mul(a1, a1) + mul(a3, a4_38); 220| 2.54k| const uint128_t t3 = mul(a0_2, a3) + mul(a1_2, a2) + mul(a4, a4_19); 221| 2.54k| const uint128_t t4 = mul(a0_2, a4) + mul(a1_2, a3) + mul(a2, a2); 222| | 223| 2.54k| return carry(t0, t1, t2, t3, t4); 224| 2.54k| } _ZN5Botan9X25519_FE3mulEmm: 309| 105k| BOTAN_FORCE_INLINE static uint128_t mul(uint64_t a, uint64_t b) { return uint128_t(a) * b; } _ZN5Botan9X25519_FE5carryERKooooo: 315| 5.12k| const uint128_t& t0, uint128_t t1, uint128_t t2, uint128_t t3, uint128_t t4) { 316| 5.12k| X25519_FE r; 317| | 318| 5.12k| r.m_v[0] = t0 & MASK_51; 319| 5.12k| t1 += carry_shift(t0, 51); 320| 5.12k| r.m_v[1] = t1 & MASK_51; 321| 5.12k| t2 += carry_shift(t1, 51); 322| 5.12k| r.m_v[2] = t2 & MASK_51; 323| 5.12k| t3 += carry_shift(t2, 51); 324| 5.12k| r.m_v[3] = t3 & MASK_51; 325| 5.12k| t4 += carry_shift(t3, 51); 326| 5.12k| r.m_v[4] = t4 & MASK_51; 327| | 328| | // The carry out of the top limb wraps to 2^255 == 19 329| 5.12k| r.m_v[0] += carry_shift(t4, 51) * 19; 330| 5.12k| r.m_v[1] += r.m_v[0] >> 51; 331| 5.12k| r.m_v[0] &= MASK_51; 332| | 333| 5.12k| return r; 334| 5.12k| } _ZN5BotanmlERKNS_9X25519_FEES2_: 175| 2.57k| BOTAN_FORCE_INLINE friend X25519_FE operator*(const X25519_FE& a, const X25519_FE& b) { 176| 2.57k| const uint64_t a0 = a.m_v[0]; 177| 2.57k| const uint64_t a1 = a.m_v[1]; 178| 2.57k| const uint64_t a2 = a.m_v[2]; 179| 2.57k| const uint64_t a3 = a.m_v[3]; 180| 2.57k| const uint64_t a4 = a.m_v[4]; 181| | 182| 2.57k| const uint64_t b0 = b.m_v[0]; 183| 2.57k| const uint64_t b1 = b.m_v[1]; 184| 2.57k| const uint64_t b2 = b.m_v[2]; 185| 2.57k| const uint64_t b3 = b.m_v[3]; 186| 2.57k| const uint64_t b4 = b.m_v[4]; 187| | 188| | // Products that wrap past 2^255 are multiplied by 19 since 2^255 == 19 (mod p) 189| 2.57k| const uint64_t b1_19 = b1 * 19; 190| 2.57k| const uint64_t b2_19 = b2 * 19; 191| 2.57k| const uint64_t b3_19 = b3 * 19; 192| 2.57k| const uint64_t b4_19 = b4 * 19; 193| | 194| 2.57k| const uint128_t t0 = mul(a0, b0) + mul(a1, b4_19) + mul(a2, b3_19) + mul(a3, b2_19) + mul(a4, b1_19); 195| 2.57k| const uint128_t t1 = mul(a0, b1) + mul(a1, b0) + mul(a2, b4_19) + mul(a3, b3_19) + mul(a4, b2_19); 196| 2.57k| const uint128_t t2 = mul(a0, b2) + mul(a1, b1) + mul(a2, b0) + mul(a3, b4_19) + mul(a4, b3_19); 197| 2.57k| const uint128_t t3 = mul(a0, b3) + mul(a1, b2) + mul(a2, b1) + mul(a3, b0) + mul(a4, b4_19); 198| 2.57k| const uint128_t t4 = mul(a0, b4) + mul(a1, b3) + mul(a2, b2) + mul(a3, b1) + mul(a4, b0); 199| | 200| 2.57k| return carry(t0, t1, t2, t3, t4); 201| 2.57k| } _ZNK5Botan9X25519_FE7mul_a24Ev: 237| 510| BOTAN_FORCE_INLINE X25519_FE mul_a24() const { 238| 510| constexpr uint64_t a24 = 121665; 239| | 240| 510| X25519_FE r; 241| | 242| 510| uint128_t t = mul(m_v[0], a24); 243| 510| r.m_v[0] = t & MASK_51; 244| | 245| 510| t = mul(m_v[1], a24) + carry_shift(t, 51); 246| 510| r.m_v[1] = t & MASK_51; 247| | 248| 510| t = mul(m_v[2], a24) + carry_shift(t, 51); 249| 510| r.m_v[2] = t & MASK_51; 250| | 251| 510| t = mul(m_v[3], a24) + carry_shift(t, 51); 252| 510| r.m_v[3] = t & MASK_51; 253| | 254| 510| t = mul(m_v[4], a24) + carry_shift(t, 51); 255| 510| r.m_v[4] = t & MASK_51; 256| | 257| 510| r.m_v[0] += carry_shift(t, 51) * 19; 258| | 259| 510| return r; 260| 510| } _ZNK5Botan9X25519_FE6invertEv: 268| 2| BOTAN_FORCE_INLINE X25519_FE invert() const { 269| 2| const auto& z = *this; 270| | 271| 2| auto a = z.sqr(); // 2 272| 2| auto t = a.sqr_n(2); // 8 273| 2| auto b = t * z; // 9 274| 2| a = b * a; // 11 275| 2| t = a.sqr(); // 22 276| 2| b = t * b; // 2^5 - 2^0 = 31 277| 2| t = b.sqr_n(5); // 2^10 - 2^5 278| 2| b = t * b; // 2^10 - 2^0 279| 2| t = b.sqr_n(10); // 2^20 - 2^10 280| 2| auto c = t * b; // 2^20 - 2^0 281| 2| t = c.sqr_n(20); // 2^40 - 2^20 282| 2| t = t * c; // 2^40 - 2^0 283| 2| t = t.sqr_n(10); // 2^50 - 2^10 284| 2| b = t * b; // 2^50 - 2^0 285| 2| t = b.sqr_n(50); // 2^100 - 2^50 286| 2| c = t * b; // 2^100 - 2^0 287| 2| t = c.sqr_n(100); // 2^200 - 2^100 288| 2| t = t * c; // 2^200 - 2^0 289| 2| t = t.sqr_n(50); // 2^250 - 2^50 290| 2| t = t * b; // 2^250 - 2^0 291| 2| t = t.sqr_n(5); // 2^255 - 2^5 292| 2| return t * a; // 2^255 - 21 293| 2| } _ZNK5Botan9X25519_FE5sqr_nEm: 226| 18| BOTAN_FORCE_INLINE X25519_FE sqr_n(size_t n) const { 227| 18| X25519_FE r = *this; 228| 522| for(size_t i = 0; i != n; ++i) { ------------------ | Branch (228:28): [True: 504, False: 18] ------------------ 229| 504| r = r.sqr(); 230| 504| } 231| 18| return r; 232| 18| } _ZNK5Botan9X25519_FE6encodeENSt3__14spanIhLm32EEE: 87| 2| BOTAN_FORCE_INLINE void encode(std::span out) const { 88| 2| auto t0 = uint128_t(m_v[0]); 89| 2| auto t1 = uint128_t(m_v[1]); 90| 2| auto t2 = uint128_t(m_v[2]); 91| 2| auto t3 = uint128_t(m_v[3]); 92| 2| auto t4 = uint128_t(m_v[4]); 93| | 94| 6| for(size_t i = 0; i != 2; ++i) { ------------------ | Branch (94:28): [True: 4, False: 2] ------------------ 95| 4| t1 += t0 >> 51U; 96| 4| t0 &= MASK_51; 97| 4| t2 += t1 >> 51U; 98| 4| t1 &= MASK_51; 99| 4| t3 += t2 >> 51U; 100| 4| t2 &= MASK_51; 101| 4| t4 += t3 >> 51U; 102| 4| t3 &= MASK_51; 103| 4| t0 += (t4 >> 51U) * 19; 104| 4| t4 &= MASK_51; 105| 4| } 106| | 107| | /* now t is between 0 and 2^255-1, properly carried. */ 108| | /* case 1: between 0 and 2^255-20. case 2: between 2^255-19 and 2^255-1. */ 109| | 110| 2| t0 += 19; 111| | 112| 2| t1 += t0 >> 51U; 113| 2| t0 &= MASK_51; 114| 2| t2 += t1 >> 51U; 115| 2| t1 &= MASK_51; 116| 2| t3 += t2 >> 51U; 117| 2| t2 &= MASK_51; 118| 2| t4 += t3 >> 51U; 119| 2| t3 &= MASK_51; 120| 2| t0 += (t4 >> 51U) * 19; 121| 2| t4 &= MASK_51; 122| | 123| | /* now between 19 and 2^255-1 in both cases, and offset by 19. */ 124| | 125| 2| t0 += 0x8000000000000 - 19; 126| 2| t1 += 0x8000000000000 - 1; 127| 2| t2 += 0x8000000000000 - 1; 128| 2| t3 += 0x8000000000000 - 1; 129| 2| t4 += 0x8000000000000 - 1; 130| | 131| | /* now between 2^255 and 2^256-20, and offset by 2^255. */ 132| | 133| 2| t1 += t0 >> 51U; 134| 2| t0 &= MASK_51; 135| 2| t2 += t1 >> 51U; 136| 2| t1 &= MASK_51; 137| 2| t3 += t2 >> 51U; 138| 2| t2 &= MASK_51; 139| 2| t4 += t3 >> 51U; 140| 2| t3 &= MASK_51; 141| 2| t4 &= MASK_51; 142| | 143| 2| store_le(out.data(), 144| 2| combine_lower(t0, 0, t1, 51), 145| 2| combine_lower(t1, 13, t2, 38), 146| 2| combine_lower(t2, 26, t3, 25), 147| 2| combine_lower(t3, 39, t4, 12)); 148| 2| } _ZN5Botan17is_sub_element_ofERKNS_3OIDESt16initializer_listIjE: 22| 25.0k|inline std::optional is_sub_element_of(const OID& oid, std::initializer_list prefix) { 23| 25.0k| const auto& c = oid.get_components(); 24| | 25| 25.0k| if(c.size() != prefix.size() + 1) { ------------------ | Branch (25:7): [True: 0, False: 25.0k] ------------------ 26| 0| return {}; 27| 0| } 28| | 29| 25.0k| if(!std::equal(c.begin(), c.end() - 1, prefix.begin(), prefix.end())) { ------------------ | Branch (29:7): [True: 0, False: 25.0k] ------------------ 30| 0| return {}; 31| 0| } 32| | 33| 25.0k| return c[c.size() - 1]; 34| 25.0k|} _ZN5Botan9AEAD_Mode19set_associated_dataENSt3__14spanIKhLm18446744073709551615EEE: 59| 300| void set_associated_data(std::span ad) { set_associated_data_n(0, ad); } _ZN5Botan21Allocator_InitializerC2Ev: 57| 1| Allocator_Initializer() { initialize_allocator(); } _ZN5Botan11ASN1_ObjectC2ERKS0_: 151| 126k| ASN1_Object(const ASN1_Object&) = default; _ZN5Botan11ASN1_ObjectD2Ev: 168| 930k| virtual ~ASN1_Object() = default; _ZN5Botan11ASN1_ObjectC2EOS0_: 161| 327k| ASN1_Object(ASN1_Object&&) = default; _ZNK5Botan14ASN1_BitString5bytesEv: 206| 37.8k| std::span bytes() const { return std::span{m_bytes}; } _ZNK5Botan14ASN1_BitString11unused_bitsEv: 211| 18.9k| size_t unused_bits() const { return m_unused_bits; } _ZNK5Botan10BER_Object6is_setEv: 267| 1.42M| bool is_set() const { return m_type_tag != ASN1_Type::NoObject; } _ZNK5Botan10BER_Object7taggingEv: 272| 568k| uint32_t tagging() const { return type_tag() | class_tag(); } _ZNK5Botan10BER_Object8type_tagEv: 277| 575k| ASN1_Type type_tag() const { return m_type_tag; } _ZNK5Botan10BER_Object9class_tagEv: 282| 656k| ASN1_Class class_tag() const { return m_class_tag; } _ZNK5Botan10BER_Object4typeEv: 287| 101k| ASN1_Type type() const { return m_type_tag; } _ZNK5Botan10BER_Object9get_classEv: 292| 50.6k| ASN1_Class get_class() const { return m_class_tag; } _ZNK5Botan10BER_Object4bitsEv: 298| 1.37M| const uint8_t* bits() const { return m_value.data(); } _ZNK5Botan10BER_Object6lengthEv: 303| 3.45M| size_t length() const { return m_value.size(); } _ZNK5Botan10BER_Object4dataEv: 308| 195k| std::span data() const { return std::span{m_value}; } _ZN5Botan10BER_Object12mutable_bitsEm: 344| 473k| uint8_t* mutable_bits(size_t length) { 345| 473k| m_value.resize(length); 346| 473k| return m_value.data(); 347| 473k| } _ZNK5Botan3OID5emptyEv: 468| 69.2k| bool empty() const { return m_id.empty(); } _ZNK5Botan3OID9has_valueEv: 474| 52.8k| bool has_value() const { return !empty(); } _ZNK5Botan3OIDeqERKS0_: 510| 33.3k| bool operator==(const OID& other) const { return m_id == other.m_id; } _ZNK5Botan3OID14get_componentsEv: 530| 728k| const std::vector& get_components() const { 531| 728k| return m_id; 532| 728k| } _ZNK5Botan11ASN1_String5valueEv: 590| 37.9k| const std::string& value() const { return m_utf8_str; } _ZNK5Botan19AlgorithmIdentifier3oidEv: 688| 72.5k| const OID& oid() const { return m_oid; } _ZNK5Botan19AlgorithmIdentifier10parametersEv: 693| 60.0k| const std::vector& parameters() const { return m_parameters; } _ZNK5Botan19AlgorithmIdentifier20parameters_are_emptyEv: 715| 31.5k| bool parameters_are_empty() const { return m_parameters.empty(); } _ZNK5Botan19AlgorithmIdentifier28parameters_are_null_or_emptyEv: 720| 25.2k| bool parameters_are_null_or_empty() const { return parameters_are_empty() || parameters_are_null(); } ------------------ | Branch (720:58): [True: 12.6k, False: 12.6k] | Branch (720:84): [True: 0, False: 12.6k] ------------------ _ZN5BotanorENS_10ASN1_ClassES0_: 91| 328k|inline ASN1_Class operator|(ASN1_Class x, ASN1_Class y) { 92| 328k| return static_cast(static_cast(x) | static_cast(y)); 93| 328k|} _ZN5BotanorENS_9ASN1_TypeENS_10ASN1_ClassE: 98| 568k|inline uint32_t operator|(ASN1_Type x, ASN1_Class y) { 99| 568k| return static_cast(x) | static_cast(y); 100| 568k|} _ZN5BotanorENS_10ASN1_ClassENS_9ASN1_TypeE: 105| 94.7k|inline uint32_t operator|(ASN1_Class x, ASN1_Type y) { 106| 94.7k| return static_cast(x) | static_cast(y); 107| 94.7k|} _ZN5BotanneERKNS_3OIDES2_: 561| 6.27k|inline bool operator!=(const OID& a, const OID& b) { 562| 6.27k| return !(a == b); 563| 6.27k|} _ZNKSt3__14hashIN5Botan3OIDEEclERKS2_: 761| 4| size_t operator()(const Botan::OID& oid) const noexcept { return static_cast(oid.hash_code()); } _ZN5Botan19AlgorithmIdentifierC2Ev: 655| 45.4k| AlgorithmIdentifier() = default; _ZN5Botan11ASN1_ObjectC2Ev: 146| 476k| ASN1_Object() = default; _ZN5Botan3OIDC2Ev: 423| 127k| explicit OID() = default; _ZN5Botan11ASN1_ObjectaSERKS0_: 156| 12.5k| ASN1_Object& operator=(const ASN1_Object&) = default; _ZN5Botan11ASN1_ObjectaSEOS0_: 166| 19.0k| ASN1_Object& operator=(ASN1_Object&&) = default; _ZN5Botan10BER_ObjectC2Ev: 239| 866k| BER_Object() = default; _ZN5Botan10BER_ObjectaSEOS0_: 259| 213k| BER_Object& operator=(BER_Object&& other) = default; _ZN5Botan14ASN1_BitStringC2Ev: 179| 18.9k| ASN1_BitString() = default; _ZN5Botan10BER_ObjectC2EOS0_: 249| 252k| BER_Object(BER_Object&& other) = default; _ZN5Botan9ASN1_TimeC2Ev: 42| 12.7k| ASN1_Time() = default; _ZN5Botan13ignore_paramsIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEEEEvDpRKT_: 149| 213|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJNS_3TLS15Session_SummaryEEEEvDpRKT_: 149| 63|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJNSt3__16vectorINS_16X509_CertificateENS1_9allocatorIS3_EEEENS_3TLS26Certificate_Status_RequestEEEEvDpRKT_: 149| 2|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJNS_3TLS16Protocol_VersionEEEEvDpRKT_: 149| 320|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJPKhmEEEvDpRKT_: 149| 36.5k|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJjEEEvDpRKT_: 149| 213k|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJPKtmEEEvDpRKT_: 149| 129|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJPKmmEEEvDpRKT_: 149| 19.9M|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJNS_3TLS10TLS_FlavorEEEEvDpRKT_: 149| 2.60k|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJNS_3TLS20Client_Hello_12_ShimEEEEvDpRKT_: 149| 2.96k|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJNS_3TLS23ChangeCipherSpec_RecordEEEEvDpRKT_: 149| 1|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJNS_3TLS6PolicyEEEEvDpRKT_: 149| 25.5k|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan11BER_Decoder6Limits3DEREv: 44| 70.0k| static Limits DER() { return Limits(false, 0, false, DefaultMaxObjectSize, false); } _ZN5Botan11BER_Decoder6LimitsC2EbmbNSt3__18optionalImEEb: 135| 70.0k| m_allow_ber(allow_ber), 136| 70.0k| m_max_nested_indef(max_nested_indef), 137| 70.0k| m_allow_standalone_eoc(allow_standalone_eoc), 138| 70.0k| m_max_object_size(max_object_size), 139| 70.0k| m_reject_default_value_encoding(reject_default_value_encoding) {} _ZN5Botan11BER_Decoder14start_sequenceEv: 277| 158k| BER_Decoder start_sequence() { return start_cons(ASN1_Type::Sequence, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder16decode_and_checkImEERS0_RKT_NSt3__117basic_string_viewIcNS6_11char_traitsIcEEEE: 696| 12.5k| BER_Decoder& decode_and_check(const T& expected, std::string_view error_msg) { 697| 12.5k| T actual; 698| 12.5k| decode(actual); 699| | 700| 12.5k| if(actual != expected) { ------------------ | Branch (700:13): [True: 0, False: 12.5k] ------------------ 701| 0| throw Decoding_Error(error_msg); 702| 0| } 703| | 704| 12.5k| return (*this); 705| 12.5k| } _ZN5Botan11BER_Decoder6decodeERm: 364| 18.8k| BER_Decoder& decode(size_t& out) { return decode(out, ASN1_Type::Integer, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder6decodeINSt3__16vectorIhNS_16secure_allocatorIhEEEEQsr8conceptsE20ordinary_byte_vectorINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEEERS0_RS9_NS_9ASN1_TypeE: 388| 12.5k| BER_Decoder& decode(T& out, ASN1_Type real_type) { 389| 12.5k| return decode(unwrap_strong_type(out), real_type, real_type, ASN1_Class::Universal); 390| 12.5k| } _ZN5Botan11BER_Decoder6decodeINSt3__16vectorIhNS_16secure_allocatorIhEEEEQsr8conceptsE20ordinary_byte_vectorINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEEERS0_RS9_NS_9ASN1_TypeESF_NS_10ASN1_ClassE: 405| 12.5k| ASN1_Class class_tag = ASN1_Class::ContextSpecific) { 406| 12.5k| return decode_into_byte_vector(unwrap_strong_type(v), real_type, type_tag, class_tag); 407| 12.5k| } _ZNK5Botan11BER_Decoder6Limits18allow_ber_encodingEv: 58| 1.19M| bool allow_ber_encoding() const { return m_allow_ber; } _ZNK5Botan11BER_Decoder6Limits20require_der_encodingEv: 63| 721k| bool require_der_encoding() const { return !allow_ber_encoding(); } _ZNK5Botan11BER_Decoder6Limits15max_object_sizeEv: 82| 474k| std::optional max_object_size() const { return m_max_object_size; } _ZN5Botan11BER_DecoderC2ERKNS_10BER_ObjectENS0_6LimitsE: 169| 18.8k| BER_Decoder(obj.data(), limits) {} _ZNK5Botan11BER_Decoder6limitsEv: 199| 209k| Limits limits() const { return m_limits; } _ZN5Botan11BER_Decoder8get_nextERNS_10BER_ObjectE: 212| 12.5k| BER_Decoder& get_next(BER_Object& ber) { 213| 12.5k| ber = get_next_object(); 214| 12.5k| return (*this); 215| 12.5k| } _ZN5Botan11BER_Decoder9start_setEv: 283| 38.0k| BER_Decoder start_set() { return start_cons(ASN1_Type::Set, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder6decodeERNS_6BigIntE: 369| 6.36k| 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| 37.6k| ASN1_Class class_tag = ASN1_Class::ContextSpecific) { 406| 37.6k| return decode_into_byte_vector(unwrap_strong_type(v), real_type, type_tag, class_tag); 407| 37.6k| } _ZN5Botan11BER_Decoder9raw_bytesINSt3__16vectorIhNS2_9allocatorIhEEEEQsr8conceptsE20ordinary_byte_vectorINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEEERS0_RS9_: 341| 44.8k| BER_Decoder& raw_bytes(T& out_wrapped) { 342| 44.8k| auto& out = unwrap_strong_type(out_wrapped); 343| 44.8k| out.clear(); 344| 44.8k| uint8_t buf[64]; 345| 114k| while(const size_t got = this->read_bytes(std::span{buf})) { ------------------ | Branch (345:29): [True: 69.7k, False: 44.8k] ------------------ 346| 69.7k| out.insert(out.end(), buf, buf + got); 347| 69.7k| } 348| 44.8k| return (*this); 349| 44.8k| } _ZN5Botan11BER_Decoder30decode_octet_aligned_bitstringINSt3__16vectorIhNS2_9allocatorIhEEEEQsr8conceptsE20ordinary_byte_vectorINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEEERS0_RS9_NS_9ASN1_TypeENS_10ASN1_ClassE: 458| 12.6k| ASN1_Class class_tag = ASN1_Class::Universal) { 459| 12.6k| auto& out = unwrap_strong_type(out_wrapped); 460| 12.6k| ASN1_BitString bits; 461| 12.6k| decode_bitstring(bits, type_tag, class_tag); 462| | 463| 12.6k| if(bits.unused_bits() != 0) { ------------------ | Branch (463:13): [True: 3, False: 12.6k] ------------------ 464| 3| throw Decoding_Error("Expected octet-aligned BIT STRING"); 465| 3| } 466| | 467| 12.6k| out.assign(bits.bytes().begin(), bits.bytes().end()); 468| 12.6k| return (*this); 469| 12.6k| } _ZN5Botan11BER_Decoder15decode_optionalImEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS3_: 548| 6.36k| BER_Decoder& decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value = T()) { 549| 6.36k| std::optional optval; 550| 6.36k| this->decode_optional(optval, type_tag, class_tag); 551| 6.36k| out = optval ? *optval : default_value; ------------------ | Branch (551:16): [True: 6.26k, False: 98] ------------------ 552| 6.36k| return (*this); 553| 6.36k| } _ZN5Botan11BER_Decoder15decode_optionalImEERS0_RNSt3__18optionalIT_EENS_9ASN1_TypeENS_10ASN1_ClassE: 840| 12.6k|BER_Decoder& BER_Decoder::decode_optional(std::optional& optval, ASN1_Type type_tag, ASN1_Class class_tag) { 841| 12.6k| BER_Object obj = get_next_object(); 842| | 843| 12.6k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (843:7): [True: 6.26k, False: 6.36k] ------------------ 844| 6.26k| T out{}; 845| 6.26k| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (845:10): [True: 6.26k, False: 0] ------------------ 846| 6.26k| BER_Decoder(obj, m_limits).decode(out).verify_end(); 847| 6.26k| } else { 848| 0| 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| 0| } else { 854| 0| this->decode(out, type_tag, class_tag); 855| 0| } 856| 0| } 857| 6.26k| optval = std::move(out); 858| 6.36k| } else { 859| 6.36k| this->push_back(std::move(obj)); 860| 6.36k| optval = std::nullopt; 861| 6.36k| } 862| | 863| 12.6k| return (*this); 864| 12.6k|} _ZN5Botan11BER_Decoder22decode_optional_stringINSt3__16vectorIhNS2_9allocatorIhEEEEQsr8conceptsE20ordinary_byte_vectorINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEEERS0_RS9_NS_9ASN1_TypeEjNS_10ASN1_ClassE: 720| 12.5k| ASN1_Class class_tag = ASN1_Class::ContextSpecific) { 721| 12.5k| BER_Object obj = get_next_object(); 722| 12.5k| auto& out = unwrap_strong_type(out_wrapped); 723| | 724| 12.5k| const ASN1_Type type_tag = static_cast(expected_tag); 725| | 726| 12.5k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (726:13): [True: 0, False: 12.5k] ------------------ 727| 0| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (727:16): [True: 0, False: 0] ------------------ 728| 0| BER_Decoder(obj, m_limits).decode(out, real_type).verify_end(); 729| 0| } else { 730| 0| push_back(std::move(obj)); 731| 0| decode(out, real_type, type_tag, class_tag); 732| 0| } 733| 12.5k| } else { 734| 12.5k| out.clear(); 735| 12.5k| push_back(std::move(obj)); 736| 12.5k| } 737| | 738| 12.5k| return (*this); 739| 12.5k| } _ZN5Botan11BER_Decoder15decode_optionalIbEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS3_: 548| 31.3k| BER_Decoder& decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value = T()) { 549| 31.3k| std::optional optval; 550| 31.3k| this->decode_optional(optval, type_tag, class_tag); 551| 31.3k| out = optval ? *optval : default_value; ------------------ | Branch (551:16): [True: 6.26k, False: 25.0k] ------------------ 552| 31.3k| return (*this); 553| 31.3k| } _ZN5Botan11BER_Decoder15decode_optionalIbEERS0_RNSt3__18optionalIT_EENS_9ASN1_TypeENS_10ASN1_ClassE: 840| 31.3k|BER_Decoder& BER_Decoder::decode_optional(std::optional& optval, ASN1_Type type_tag, ASN1_Class class_tag) { 841| 31.3k| BER_Object obj = get_next_object(); 842| | 843| 31.3k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (843:7): [True: 6.26k, False: 25.0k] ------------------ 844| 6.26k| T out{}; 845| 6.26k| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (845:10): [True: 0, False: 6.26k] ------------------ 846| 0| BER_Decoder(obj, m_limits).decode(out).verify_end(); 847| 6.26k| } else { 848| 6.26k| 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.26k| } else { 854| 6.26k| this->decode(out, type_tag, class_tag); 855| 6.26k| } 856| 6.26k| } 857| 6.26k| optval = std::move(out); 858| 25.0k| } else { 859| 25.0k| this->push_back(std::move(obj)); 860| 25.0k| optval = std::nullopt; 861| 25.0k| } 862| | 863| 31.3k| return (*this); 864| 31.3k|} x509_ext.cpp:_ZN5Botan11BER_Decoder21decode_optional_fieldIZNS_14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS4_9allocatorIhEEEEE3$_0EERS0_jNS_10ASN1_ClassEOT_: 621| 6.26k| BER_Decoder& decode_optional_field(uint32_t tag_no, ASN1_Class class_tag, F&& fn) { 622| 6.26k| if(peek_next_object().is_a(tag_no, class_tag)) { ------------------ | Branch (622:13): [True: 6.26k, False: 0] ------------------ 623| 6.26k| std::forward(fn)(*this); 624| 6.26k| } 625| 6.26k| return (*this); 626| 6.26k| } x509_ext.cpp:_ZN5Botan11BER_Decoder21decode_optional_fieldIZNS_14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS4_9allocatorIhEEEEE3$_1EERS0_jNS_10ASN1_ClassEOT_: 621| 6.26k| BER_Decoder& decode_optional_field(uint32_t tag_no, ASN1_Class class_tag, F&& fn) { 622| 6.26k| if(peek_next_object().is_a(tag_no, class_tag)) { ------------------ | Branch (622:13): [True: 0, False: 6.26k] ------------------ 623| 0| std::forward(fn)(*this); 624| 0| } 625| 6.26k| return (*this); 626| 6.26k| } x509_ext.cpp:_ZN5Botan11BER_Decoder21decode_optional_fieldIZNS_14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS4_9allocatorIhEEEEE3$_2EERS0_jNS_10ASN1_ClassEOT_: 621| 6.26k| BER_Decoder& decode_optional_field(uint32_t tag_no, ASN1_Class class_tag, F&& fn) { 622| 6.26k| if(peek_next_object().is_a(tag_no, class_tag)) { ------------------ | Branch (622:13): [True: 0, False: 6.26k] ------------------ 623| 0| std::forward(fn)(*this); 624| 0| } 625| 6.26k| return (*this); 626| 6.26k| } _ZN5Botan11BER_Decoder15decode_optionalINS_3OIDEEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS4_: 548| 6.26k| BER_Decoder& decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value = T()) { 549| 6.26k| std::optional optval; 550| 6.26k| this->decode_optional(optval, type_tag, class_tag); 551| 6.26k| out = optval ? *optval : default_value; ------------------ | Branch (551:16): [True: 0, False: 6.26k] ------------------ 552| 6.26k| return (*this); 553| 6.26k| } _ZN5Botan11BER_Decoder15decode_optionalINS_3OIDEEERS0_RNSt3__18optionalIT_EENS_9ASN1_TypeENS_10ASN1_ClassE: 840| 6.26k|BER_Decoder& BER_Decoder::decode_optional(std::optional& optval, ASN1_Type type_tag, ASN1_Class class_tag) { 841| 6.26k| BER_Object obj = get_next_object(); 842| | 843| 6.26k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (843:7): [True: 0, False: 6.26k] ------------------ 844| 0| T out{}; 845| 0| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (845:10): [True: 0, False: 0] ------------------ 846| 0| BER_Decoder(obj, m_limits).decode(out).verify_end(); 847| 0| } 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| 0| optval = std::move(out); 858| 6.26k| } else { 859| 6.26k| this->push_back(std::move(obj)); 860| 6.26k| optval = std::nullopt; 861| 6.26k| } 862| | 863| 6.26k| return (*this); 864| 6.26k|} _ZN5Botan11BER_Decoder39decode_optional_octet_aligned_bitstringINSt3__16vectorIhNS_16secure_allocatorIhEEEEQsr8conceptsE20ordinary_byte_vectorINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEEERS0_RS9_jNS_10ASN1_ClassE: 770| 6.26k| ASN1_Class class_tag = ASN1_Class::ContextSpecific) { 771| 6.26k| BER_Object obj = get_next_object(); 772| 6.26k| auto& out = unwrap_strong_type(out_wrapped); 773| | 774| 6.26k| const ASN1_Type type_tag = static_cast(expected_tag); 775| | 776| 6.26k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (776:13): [True: 6.26k, False: 0] ------------------ 777| 6.26k| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (777:16): [True: 6.26k, False: 0] ------------------ 778| 6.26k| BER_Decoder(obj, m_limits).decode_octet_aligned_bitstring(out).verify_end(); 779| 6.26k| } else { 780| 0| push_back(std::move(obj)); 781| 0| decode_octet_aligned_bitstring(out, type_tag, class_tag); 782| 0| } 783| 6.26k| } else { 784| 0| out.clear(); 785| 0| push_back(std::move(obj)); 786| 0| } 787| | 788| 6.26k| return (*this); 789| 6.26k| } _ZN5Botan11BER_Decoder30decode_octet_aligned_bitstringINSt3__16vectorIhNS_16secure_allocatorIhEEEEQsr8conceptsE20ordinary_byte_vectorINS_6detail19wrapped_type_helperIu14__remove_cvrefIT_EE4typeEEEERS0_RS9_NS_9ASN1_TypeENS_10ASN1_ClassE: 458| 6.26k| ASN1_Class class_tag = ASN1_Class::Universal) { 459| 6.26k| auto& out = unwrap_strong_type(out_wrapped); 460| 6.26k| ASN1_BitString bits; 461| 6.26k| decode_bitstring(bits, type_tag, class_tag); 462| | 463| 6.26k| if(bits.unused_bits() != 0) { ------------------ | Branch (463:13): [True: 0, False: 6.26k] ------------------ 464| 0| throw Decoding_Error("Expected octet-aligned BIT STRING"); 465| 0| } 466| | 467| 6.26k| out.assign(bits.bytes().begin(), bits.bytes().end()); 468| 6.26k| return (*this); 469| 6.26k| } _ZN5BotangeERKNS_6BigIntES2_: 1343| 32.7k|inline bool operator>=(const BigInt& a, const BigInt& b) { 1344| 32.7k| return (a.cmp(b) >= 0); 1345| 32.7k|} _ZN5BotanmiERKNS_6BigIntEm: 1229| 6|inline BigInt operator-(const BigInt& x, word y) { 1230| 6| return BigInt::add2(x, &y, 1, BigInt::Negative); 1231| 6|} _ZN5Botan6BigIntD2Ev: 185| 202k| ~BigInt() { _const_time_unpoison(); } _ZN5Botan6BigIntC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 98| 36| explicit BigInt(std::string_view str) { *this = BigInt::from_string(str); } _ZN5Botan6BigIntC2EOS0_: 183| 32.7k| BigInt(BigInt&& other) noexcept { this->swap(other); } _ZN5Botan6BigIntaSEOS0_: 190| 25.2k| BigInt& operator=(BigInt&& other) noexcept { 191| 25.2k| if(this != &other) { ------------------ | Branch (191:13): [True: 25.2k, False: 0] ------------------ 192| 25.2k| this->swap(other); 193| 25.2k| } 194| | 195| 25.2k| return (*this); 196| 25.2k| } _ZN5Botan6BigInt4swapERS0_: 207| 107k| void swap(BigInt& other) noexcept { 208| 107k| m_data.swap(other.m_data); 209| 107k| std::swap(m_signedness, other.m_signedness); 210| 107k| } _ZN5Botan6BigInt5clearEv: 441| 66.5k| void clear() { 442| 66.5k| m_data.set_to_zero(); 443| 66.5k| m_signedness = Positive; 444| 66.5k| } _ZNK5Botan6BigInt7is_evenEv: 481| 6| bool is_even() const { return !get_bit(0); } _ZNK5Botan6BigInt6signumEv: 493| 218k| int signum() const { 494| 218k| if(sig_words() == 0) { ------------------ | Branch (494:13): [True: 6.27k, False: 212k] ------------------ 495| 6.27k| return 0; 496| 6.27k| } 497| 212k| return (sign() == Negative) ? -1 : 1; ------------------ | Branch (497:17): [True: 42, False: 212k] ------------------ 498| 218k| } _ZNK5Botan6BigInt7is_zeroEv: 510| 27| bool is_zero() const { return sig_words() == 0; } _ZN5Botan6BigInt7set_bitEm: 516| 24| void set_bit(size_t n) { conditionally_set_bit(n, true); } _ZN5Botan6BigInt21conditionally_set_bitEmb: 526| 24| void conditionally_set_bit(size_t n, bool set_it) { 527| 24| const size_t which = n / (sizeof(word) * 8); 528| 24| const word mask = static_cast(set_it) << (n % (sizeof(word) * 8)); 529| 24| m_data.set_word_at(which, word_at(which) | mask); 530| 24| } _ZNK5Botan6BigInt7get_bitEm: 549| 6| bool get_bit(size_t n) const { return ((word_at(n / (sizeof(word) * 8)) >> (n % (sizeof(word) * 8))) & 1) == 1; } _ZNK5Botan6BigInt7word_atEm: 601| 154k| word word_at(size_t n) const { return m_data.get_word_at(n); } _ZNK5Botan6BigInt4signEv: 641| 212k| Sign sign() const { return (m_signedness); } _ZN5Botan6BigInt8set_signENS0_4SignE: 663| 75| void set_sign(Sign sign) { 664| 75| if(sign == Negative && is_zero()) { ------------------ | Branch (664:13): [True: 21, False: 54] | Branch (664:33): [True: 0, False: 21] ------------------ 665| 0| sign = Positive; 666| 0| } 667| | 668| 75| m_signedness = sign; 669| 75| } _ZNK5Botan6BigInt4sizeEv: 681| 229k| size_t size() const { return m_data.size(); } _ZNK5Botan6BigInt9sig_wordsEv: 687| 372k| size_t sig_words() const { return m_data.sig_words(); } _ZN5Botan6BigInt12mutable_dataEv: 712| 32.8k| BOTAN_DEPRECATED("Deprecated no replacement") word* mutable_data() { return m_data.mutable_data(); } _ZNK5Botan6BigInt4dataEv: 718| 12| BOTAN_DEPRECATED("Deprecated no replacement") const word* data() const { return m_data.const_data(); } _ZNK5Botan6BigInt7grow_toEm: 738| 4.44k| BOTAN_DEPRECATED("Deprecated no replacement") void grow_to(size_t n) const { m_data.grow_to(n); } _ZN5Botan6BigInt10power_of_2Em: 906| 24| static BigInt power_of_2(size_t n) { 907| 24| BigInt b; 908| 24| b.set_bit(n); 909| 24| return b; 910| 24| } _ZNK5Botan6BigInt8_as_spanEv: 1023| 12| std::span _as_span() const { return m_data.const_span(); } _ZNK5Botan6BigInt5_dataEv: 1033| 176k| const word* _data() const { return m_data.const_data(); } _ZN5Botan6BigInt18_assign_from_bytesENSt3__14spanIKhLm18446744073709551615EEE: 1044| 25.1k| void _assign_from_bytes(std::span bytes) { assign_from_bytes(bytes); } _ZN5Botan6BigInt11_from_wordsERNSt3__16vectorImNS_16secure_allocatorImEEEE: 1052| 84| static BigInt _from_words(secure_vector& words) { 1053| 84| BigInt bn; 1054| 84| bn.m_data.swap(words); 1055| 84| return bn; 1056| 84| } _ZN5Botan6BigInt4Data12mutable_dataEv: 1083| 32.8k| word* mutable_data() { 1084| 32.8k| invalidate_sig_words(); 1085| 32.8k| return m_reg.data(); 1086| 32.8k| } _ZNK5Botan6BigInt4Data10const_dataEv: 1088| 378k| const word* const_data() const { return m_reg.data(); } _ZNK5Botan6BigInt4Data10const_spanEv: 1090| 12| std::span const_span() const { return std::span{m_reg}; } _ZNK5Botan6BigInt4Data11get_word_atEm: 1099| 154k| word get_word_at(size_t n) const { 1100| 154k| if(n < m_reg.size()) { ------------------ | Branch (1100:19): [True: 154k, False: 24] ------------------ 1101| 154k| return m_reg[n]; 1102| 154k| } 1103| 24| return 0; 1104| 154k| } _ZN5Botan6BigInt4Data11set_word_atEmm: 1106| 11.6k| void set_word_at(size_t i, word w) { 1107| 11.6k| invalidate_sig_words(); 1108| 11.6k| if(i >= m_reg.size()) { ------------------ | Branch (1108:19): [True: 11.6k, False: 0] ------------------ 1109| 11.6k| if(w == 0) { ------------------ | Branch (1109:22): [True: 0, False: 11.6k] ------------------ 1110| 0| return; 1111| 0| } 1112| 11.6k| grow_to(i + 1); 1113| 11.6k| } 1114| 11.6k| m_reg[i] = w; 1115| 11.6k| } _ZNK5Botan6BigInt4Data7grow_toEm: 1126| 16.1k| void grow_to(size_t n) const { 1127| 16.1k| if(n > size()) { ------------------ | Branch (1127:19): [True: 16.1k, False: 6] ------------------ 1128| 16.1k| if(n <= m_reg.capacity()) { ------------------ | Branch (1128:22): [True: 0, False: 16.1k] ------------------ 1129| 0| m_reg.resize(n); 1130| 16.1k| } else { 1131| 16.1k| m_reg.resize(n + (8 - (n % 8))); 1132| 16.1k| } 1133| 16.1k| } 1134| 16.1k| } _ZNK5Botan6BigInt4Data4sizeEv: 1136| 447k| size_t size() const { return m_reg.size(); } _ZN5Botan6BigInt4Data4swapERS1_: 1151| 107k| void swap(Data& other) noexcept { 1152| 107k| m_reg.swap(other.m_reg); 1153| 107k| std::swap(m_sig_words, other.m_sig_words); 1154| 107k| } _ZN5Botan6BigInt4Data4swapERNSt3__16vectorImNS_16secure_allocatorImEEEE: 1156| 66.6k| void swap(secure_vector& reg) noexcept { 1157| 66.6k| m_reg.swap(reg); 1158| 66.6k| invalidate_sig_words(); 1159| 66.6k| } _ZNK5Botan6BigInt4Data20invalidate_sig_wordsEv: 1161| 111k| void invalidate_sig_words() const noexcept { m_sig_words = sig_words_npos; } _ZNK5Botan6BigInt4Data9sig_wordsEv: 1163| 372k| size_t sig_words() const { 1164| 372k| if(m_sig_words == sig_words_npos) { ------------------ | Branch (1164:19): [True: 69.6k, False: 303k] ------------------ 1165| 69.6k| m_sig_words = calc_sig_words(); 1166| 69.6k| } 1167| 372k| return m_sig_words; 1168| 372k| } _ZN5BotanplERKNS_6BigIntES2_: 1189| 12|inline BigInt operator+(const BigInt& x, const BigInt& y) { 1190| 12| return BigInt::add2(x, y._data(), y.sig_words(), y.sign()); 1191| 12|} _ZN5BotaneqERKNS_6BigIntES2_: 1313| 6|inline bool operator==(const BigInt& a, const BigInt& b) { 1314| 6| return a.is_equal(b); 1315| 6|} _ZN5BotanneERKNS_6BigIntES2_: 1323| 6|inline bool operator!=(const BigInt& a, const BigInt& b) { 1324| 6| return !a.is_equal(b); 1325| 6|} _ZN5BotanltERKNS_6BigIntES2_: 1353| 6|inline bool operator<(const BigInt& a, const BigInt& b) { 1354| 6| return a.is_less_than(b); 1355| 6|} _ZN5BotaneqERKNS_6BigIntEm: 1373| 17.9k|inline bool operator==(const BigInt& a, word b) { 1374| 17.9k| return (a.cmp_word(b) == 0); 1375| 17.9k|} _ZN5BotanneERKNS_6BigIntEm: 1383| 6|inline bool operator!=(const BigInt& a, word b) { 1384| 6| return (a.cmp_word(b) != 0); 1385| 6|} _ZN5BotanltERKNS_6BigIntEm: 1413| 32.7k|inline bool operator<(const BigInt& a, word b) { 1414| 32.7k| return (a.cmp_word(b) < 0); 1415| 32.7k|} _ZNK5Botan6BigInt9serializeINSt3__16vectorIhNS2_9allocatorIhEEEEEET_m: 790| 17.9k| 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| 17.9k| T out(len); 795| 17.9k| this->serialize_to(out); 796| 17.9k| return out; 797| 17.9k| } _ZN5Botan6BigIntC2Ev: 45| 141k| BigInt() = default; _ZN5Botan6BigIntC2ERKS0_: 88| 16.4k| BigInt(const BigInt& other) = default; _ZN5Botan6BigIntaSERKS0_: 201| 6| BigInt& operator=(const BigInt&) = default; _ZNK5Botan11BlockCipher14parallel_bytesEv: 71| 389| size_t parallel_bytes() const { return parallelism() * block_size() * BlockCipher::ParallelismMult; } _ZNK5Botan11BlockCipher7encryptEPh: 104| 119| void encrypt(uint8_t block[]) const { encrypt_n(block, block, 1); } _ZNK5Botan11BlockCipher7encryptENSt3__14spanIhLm18446744073709551615EEE: 118| 1.89k| void encrypt(std::span block) const { 119| 1.89k| return encrypt_n(block.data(), block.data(), block.size() / block_size()); 120| 1.89k| } _ZNK5Botan11BlockCipher7encryptENSt3__14spanIKhLm18446744073709551615EEENS2_IhLm18446744073709551615EEE: 135| 1.82k| void encrypt(std::span in, std::span out) const { 136| 1.82k| return encrypt_n(in.data(), out.data(), in.size() / block_size()); 137| 1.82k| } _ZNK5Botan25Block_Cipher_Fixed_ParamsILm16ELm16ELm0ELm1ENS_11BlockCipherEE8key_specEv: 246| 274| Key_Length_Specification key_spec() const final { return Key_Length_Specification(KMIN, KMAX, KMOD); } _ZNK5Botan25Block_Cipher_Fixed_ParamsILm16ELm16ELm0ELm1ENS_11BlockCipherEE10block_sizeEv: 240| 3.75k| size_t block_size() const final { return BS; } _ZNK5Botan25Block_Cipher_Fixed_ParamsILm16ELm32ELm0ELm1ENS_11BlockCipherEE8key_specEv: 246| 369| Key_Length_Specification key_spec() const final { return Key_Length_Specification(KMIN, KMAX, KMOD); } _ZNK5Botan25Block_Cipher_Fixed_ParamsILm16ELm32ELm0ELm1ENS_11BlockCipherEE10block_sizeEv: 240| 831| size_t block_size() const final { return BS; } _ZNK5Botan25Block_Cipher_Fixed_ParamsILm8ELm16ELm24ELm8ENS_11BlockCipherEE8key_specEv: 246| 135| Key_Length_Specification key_spec() const final { return Key_Length_Specification(KMIN, KMAX, KMOD); } _ZNK5Botan25Block_Cipher_Fixed_ParamsILm8ELm16ELm24ELm8ENS_11BlockCipherEE10block_sizeEv: 240| 126| size_t block_size() const final { return BS; } _ZN5Botan20Buffered_Computation6updateEPKhm: 35| 273| void update(const uint8_t in[], size_t length) { add_data({in, length}); } _ZN5Botan20Buffered_Computation6updateENSt3__14spanIKhLm18446744073709551615EEE: 41| 146k| void update(std::span in) { add_data(in); } _ZN5Botan20Buffered_Computation5finalEPh: 97| 490| void final(uint8_t out[]) { final_result({out, output_length()}); } _ZN5Botan20Buffered_Computation12final_stdvecEv: 114| 18.9k| std::vector final_stdvec() { return final>(); } _ZN5Botan20Buffered_Computation5finalITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEEET_v: 104| 18.9k| T final() { 105| 18.9k| T output(output_length()); 106| 18.9k| final_result(output); 107| 18.9k| return output; 108| 18.9k| } _ZN5Botan20Buffered_Computation5finalITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_v: 104| 7.50k| T final() { 105| 7.50k| T output(output_length()); 106| 7.50k| final_result(output); 107| 7.50k| return output; 108| 7.50k| } _ZN5Botan20Buffered_ComputationD2Ev: 169| 22.2k| virtual ~Buffered_Computation() = default; _ZN5Botan20Buffered_Computation5finalITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEEvRT_: 127| 6.15k| void final(T& out) { 128| 6.15k| out.resize(output_length()); 129| 6.15k| final_result(out); 130| 6.15k| } _ZN5Botan20Buffered_Computation7processITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_NS3_4spanIKhLm18446744073709551615EEE: 164| 6.15k| T process(std::span in) { 165| 6.15k| update(in); 166| 6.15k| return final(); 167| 6.15k| } _ZN5Botan20Buffered_Computation5finalITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEEEvRT_: 127| 5.20k| void final(T& out) { 128| 5.20k| out.resize(output_length()); 129| 5.20k| final_result(out); 130| 5.20k| } _ZNK5Botan10ChaCha_RNG31max_number_of_bytes_per_requestEv: 120| 12.2k| size_t max_number_of_bytes_per_request() const override { return 0; } _ZN5Botan11Cipher_Mode5startENSt3__14spanIKhLm18446744073709551615EEE: 98| 380| void start(std::span nonce) { start_msg(nonce.data(), nonce.size()); } _ZN5Botan11Cipher_Mode6finishERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 185| 300| void finish(secure_vector& final_block, size_t offset = 0) { finish_msg(final_block, offset); } _ZN5Botan11Cipher_Mode7processENSt3__14spanIhLm18446744073709551615EEE: 132| 120| size_t process(std::span msg) { return this->process_msg(msg.data(), msg.size()); } _ZN5Botan11Cipher_Mode7processEPhm: 140| 80| size_t process(uint8_t msg[], size_t msg_len) { return this->process_msg(msg, msg_len); } _ZN5Botan11Cipher_Mode6updateITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEEvRT_m: 155| 120| void update(T& buffer, size_t offset = 0) { 156| 120| const size_t written = process(std::span(buffer).subspan(offset)); 157| 120| buffer.resize(offset + written); 158| 120| } _ZN5Botan19Credentials_ManagerD2Ev: 42| 6.26k| virtual ~Credentials_Manager() = default; _ZN5Botan8CurveGFp4swapERS0_: 82| 16.3k| void swap(CurveGFp& other) noexcept { std::swap(m_group, other.m_group); } _ZN5Botan8CurveGFpC2Ev: 75| 16.3k| CurveGFp() = default; _ZN5Botan10DataSourceD2Ev: 109| 304k| virtual ~DataSource() = default; _ZN5Botan17DataSource_MemoryC2ENSt3__16vectorIhNS_16secure_allocatorIhEEEE: 175| 6.26k| explicit DataSource_Memory(secure_vector in) : m_source(std::move(in)), m_offset(0) {} _ZN5Botan17DataSource_MemoryC2ENSt3__14spanIKhLm18446744073709551615EEE: 181| 101k| explicit DataSource_Memory(std::span in) : m_offset(0) { 182| | // Guard against forming a range from a null pointer (eg an empty span) 183| 101k| if(!in.empty()) { ------------------ | Branch (183:13): [True: 101k, False: 17] ------------------ 184| 101k| m_source.assign(in.begin(), in.end()); 185| 101k| } 186| 101k| } _ZN5Botan10DataSourceC2Ev: 107| 367k| DataSource() = default; _ZN5Botan11DER_Encoder14start_sequenceEv: 86| 65.3k| DER_Encoder& start_sequence() { return start_cons(ASN1_Type::Sequence, ASN1_Class::Universal); } _ZN5Botan11DER_Encoder12DER_SequenceD2Ev: 504| 342k| ~DER_Sequence() = default; _ZN5Botan11DER_Encoder22start_context_specificEj: 113| 34.9k| DER_Encoder& start_context_specific(uint32_t tag) { 114| 34.9k| return start_cons(ASN1_Type(tag), ASN1_Class::ContextSpecific); 115| 34.9k| } _ZN5Botan11DER_Encoder9raw_bytesENSt3__14spanIKhLm18446744073709551615EEE: 154| 47.4k| 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| 6.27k| ASN1_Class class_tag = ASN1_Class::Universal) { 213| 6.27k| return encode_bitstring(bytes, 0, type_tag, class_tag); 214| 6.27k| } _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassENSt3__14spanIKhLm18446744073709551615EEE: 410| 97.0k| DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, std::span rep) { 411| 97.0k| return add_object(type_tag, class_tag, rep.data(), rep.size()); 412| 97.0k| } _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassERKNSt3__16vectorIhNS3_9allocatorIhEEEE: 421| 90.7k| DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, const std::vector& rep) { 422| 90.7k| return add_object(type_tag, class_tag, std::span{rep}); 423| 90.7k| } _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassERKNSt3__16vectorIhNS_16secure_allocatorIhEEEE: 432| 6.27k| DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, const secure_vector& rep) { 433| 6.27k| return add_object(type_tag, class_tag, std::span{rep}); 434| 6.27k| } _ZN5Botan11DER_Encoder12DER_SequenceC2EOS1_: 487| 241k| m_type_tag(seq.m_type_tag), 488| 241k| m_class_tag(seq.m_class_tag), 489| 241k| m_sort_contents(seq.m_sort_contents), 490| 241k| m_contents(std::move(seq.m_contents)), 491| 241k| m_set_contents(std::move(seq.m_set_contents)) {} _ZNK5Botan7DNSName9to_stringEv: 51| 17| const std::string& to_string() const { return m_name; } _ZN5Botan7DNSNameC2ENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEE: 101| 6.28k| explicit DNSName(std::string canonical) : m_name(std::move(canonical)) {} _ZNK5Botan14EC_AffinePointneERKS0_: 263| 6.26k| bool operator!=(const EC_AffinePoint& other) const { return !(*this == other); } _ZNK5Botan14EC_AffinePoint5innerEv: 357| 96.2k| const EC_AffinePoint_Data& inner() const { return *m_point; } _ZNK5Botan14EC_AffinePoint22serialize_uncompressedITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEEET_v: 235| 16.3k| T serialize_uncompressed() const { 236| 16.3k| T bytes(1 + 2 * this->field_element_bytes()); 237| 16.3k| this->serialize_uncompressed_to(bytes); 238| 16.3k| return bytes; 239| 16.3k| } _ZNK5Botan14EC_AffinePoint20serialize_compressedITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEEET_v: 245| 27| T serialize_compressed() const { 246| 27| T bytes(1 + this->field_element_bytes()); 247| 27| this->serialize_compressed_to(bytes); 248| 27| return bytes; 249| 27| } _ZNK5Botan8EC_Group5_dataEv: 604| 53.9k| const std::shared_ptr& _data() const { return m_data; } _ZN5Botan8EC_GroupC2EOS0_: 297| 25.0k| EC_Group(EC_Group&&) = default; _ZN5Botan8EC_PointaSEOS0_: 75| 16.3k| EC_Point& operator=(EC_Point&& other) noexcept { 76| 16.3k| if(this != &other) { ------------------ | Branch (76:13): [True: 16.3k, False: 0] ------------------ 77| 16.3k| this->swap(other); 78| 16.3k| } 79| 16.3k| return (*this); 80| 16.3k| } _ZN5Botan8EC_PointD2Ev: 82| 32.7k| ~EC_Point() = default; _ZN5Botan8EC_PointC2Ev: 49| 16.3k| EC_Point() = default; _ZNK5Botan9EC_Scalar6_innerEv: 282| 10.1k| const EC_Scalar_Data& _inner() const { return inner(); } _ZNK5Botan9EC_Scalar5innerEv: 296| 43.8k| const EC_Scalar_Data& inner() const { return *m_scalar; } _ZN5Botan12EC_PublicKeyC2Ev: 140| 8.69k| EC_PublicKey() = default; _ZN5Botan12EC_PublicKeyD2Ev: 42| 10.1k| ~EC_PublicKey() override = default; _ZN5Botan13EC_PrivateKeyD2Ev: 173| 8.69k| ~EC_PrivateKey() override = default; _ZNK5Botan12EC_PublicKey14point_encodingEv: 102| 3.83k| EC_Point_Format point_encoding() const { return m_point_encoding; } _ZN5Botan14ECDH_PublicKeyC1ERKNS_8EC_GroupERKNS_14EC_AffinePointE: 44| 1.41k| ECDH_PublicKey(const EC_Group& group, const EC_AffinePoint& public_key) : EC_PublicKey(group, public_key) {} _ZN5Botan15ECDH_PrivateKeyC1ERNS_21RandomNumberGeneratorERKNS_8EC_GroupE: 101| 2.42k| ECDH_PrivateKey(RandomNumberGenerator& rng, const EC_Group& group) : EC_PrivateKey(rng, group) {} _ZN5Botan14ECDH_PublicKeyC2Ev: 67| 2.42k| ECDH_PublicKey() = default; _ZNK5Botan14ECDH_PublicKey9algo_nameEv: 50| 7.54k| std::string algo_name() const override { return "ECDH"; } _ZN5Botan16ECDSA_PrivateKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 98| 6.26k| EC_PrivateKey(assert_algorithm_identifier(alg_id, "ECDSA"), key_bits) {} _ZN5Botan15ECDSA_PublicKeyC2Ev: 79| 6.26k| ECDSA_PublicKey() = default; _ZNK5Botan9Exception4whatEv: 94| 1.42k| const char* what() const noexcept override { return m_msg.c_str(); } _ZN5Botan13Invalid_StateC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 284| 20| explicit Invalid_State(std::string_view err) : Exception(err) {} _ZN5Botan10hex_encodeENSt3__14spanIKhLm18446744073709551615EEEb: 43| 12.5k|inline std::string hex_encode(std::span input, bool uppercase = true) { 44| 12.5k| return hex_encode(input.data(), input.size(), uppercase); 45| 12.5k|} _ZN5Botan3KDFD2Ev: 27| 1.35k| virtual ~KDF() = default; _ZNK5Botan3KDF10derive_keyITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_mNS3_4spanIKhLm18446744073709551615EEESB_SB_: 145| 2.57k| std::span label) const { 146| 2.57k| T key(key_len); 147| 2.57k| perform_kdf(key, secret, salt, label); 148| 2.57k| return key; 149| 2.57k| } _ZNK5Botan3KDF10derive_keyITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_mPKhmSA_mSA_m: 99| 1.22k| size_t label_len = 0) const { 100| 1.22k| return derive_key(key_len, {secret, secret_len}, {salt, salt_len}, {label, label_len}); 101| 1.22k| } _ZN5Botan9clear_memIhEEvPT_m: 118| 20.7k|inline constexpr void clear_mem(T* ptr, size_t n) { 119| 20.7k| clear_bytes(ptr, sizeof(T) * n); 120| 20.7k|} _ZN5Botan11clear_bytesEPvm: 101| 232k|inline constexpr void clear_bytes(void* ptr, size_t bytes) { 102| 232k| if(bytes > 0) { ------------------ | Branch (102:7): [True: 166k, False: 66.5k] ------------------ 103| 166k| std::memset(ptr, 0, bytes); 104| 166k| } 105| 232k|} _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| 2.77k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 2.77k| ranges::assert_equal_byte_lengths(out, in); 178| 2.77k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 2.77k|} _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| 2.77k|inline constexpr ToT typecast_copy(const FromR& src) { 211| 2.77k| ToT dst; // NOLINT(*-member-init) 212| 2.77k| typecast_copy(dst, src); 213| 2.77k| return dst; 214| 2.77k|} _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| 3.80k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 3.80k| ranges::assert_equal_byte_lengths(out, in); 178| 3.80k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 3.80k|} _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| 3.80k|inline constexpr ToT typecast_copy(const FromR& src) { 211| 3.80k| ToT dst; // NOLINT(*-member-init) 212| 3.80k| typecast_copy(dst, src); 213| 3.80k| return dst; 214| 3.80k|} _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| 3.29k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 3.29k| ranges::assert_equal_byte_lengths(out, in); 178| 3.29k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 3.29k|} _ZN5Botan7xor_bufITkNS_6ranges23contiguous_output_rangeIhEENSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeIhEENS4_IKhLm18446744073709551615EEEEEvOT_OT0_: 404| 5.30k| ranges::contiguous_range auto&& in) { 405| 5.30k| ranges::assert_equal_byte_lengths(out, in); 406| | 407| 5.30k| std::span o(out); 408| 5.30k| std::span i(in); 409| | 410| 8.08k| for(; o.size_bytes() >= 32; o = o.subspan(32), i = i.subspan(32)) { ------------------ | Branch (410:10): [True: 2.77k, False: 5.30k] ------------------ 411| 2.77k| auto x = typecast_copy>(o.template first<32>()); 412| 2.77k| const auto y = typecast_copy>(i.template first<32>()); 413| | 414| 2.77k| x[0] ^= y[0]; 415| 2.77k| x[1] ^= y[1]; 416| 2.77k| x[2] ^= y[2]; 417| 2.77k| x[3] ^= y[3]; 418| | 419| 2.77k| typecast_copy(o.template first<32>(), x); 420| 2.77k| } 421| | 422| 85.0k| for(size_t off = 0; off != o.size_bytes(); ++off) { ------------------ | Branch (422:24): [True: 79.7k, False: 5.30k] ------------------ 423| 79.7k| o[off] ^= i[off]; 424| 79.7k| } 425| 5.30k|} _ZN5Botan7xor_bufITkNS_6ranges23contiguous_output_rangeIhEENSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeIhEENS4_IKhLm18446744073709551615EEETkNS6_IhEES8_EEvOT_OT0_OT1_: 435| 843| ranges::contiguous_range auto&& in2) { 436| 843| ranges::assert_equal_byte_lengths(out, in1, in2); 437| | 438| 843| std::span o{out}; 439| 843| std::span i1{in1}; 440| 843| std::span i2{in2}; 441| | 442| 1.36k| for(; o.size_bytes() >= 32; o = o.subspan(32), i1 = i1.subspan(32), i2 = i2.subspan(32)) { ------------------ | Branch (442:10): [True: 518, False: 843] ------------------ 443| 518| auto x = typecast_copy>(i1.template first<32>()); 444| 518| const auto y = typecast_copy>(i2.template first<32>()); 445| | 446| 518| x[0] ^= y[0]; 447| 518| x[1] ^= y[1]; 448| 518| x[2] ^= y[2]; 449| 518| x[3] ^= y[3]; 450| | 451| 518| typecast_copy(o.template first<32>(), x); 452| 518| } 453| | 454| 13.9k| for(size_t off = 0; off != o.size_bytes(); ++off) { ------------------ | Branch (454:24): [True: 13.0k, False: 843] ------------------ 455| 13.0k| o[off] = i1[off] ^ i2[off]; 456| 13.0k| } 457| 843|} _ZN5Botan7xor_bufEPhPKhm: 465| 5.30k|inline void xor_buf(uint8_t out[], const uint8_t in[], size_t length) { 466| | // simply assumes that *out and *in point to "length" allocated bytes at least 467| 5.30k| xor_buf(std::span{out, length}, std::span{in, length}); 468| 5.30k|} _ZN5Botan7xor_bufEPhPKhS2_m: 477| 843|inline void xor_buf(uint8_t out[], const uint8_t in[], const uint8_t in2[], size_t length) { 478| | // simply assumes that *out, *in, and *in2 point to "length" allocated bytes at least 479| 843| xor_buf(std::span{out, length}, std::span{in, length}, std::span{in2, length}); 480| 843|} _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| 444k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromT& in) { 200| 444k| typecast_copy(out, std::span(&in, 1)); 201| 444k|} _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| 444k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 444k| ranges::assert_equal_byte_lengths(out, in); 178| 444k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 444k|} _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| 543k|inline constexpr ToT typecast_copy(const FromR& src) { 211| 543k| ToT dst; // NOLINT(*-member-init) 212| 543k| typecast_copy(dst, src); 213| 543k| return dst; 214| 543k|} _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| 543k|inline constexpr void typecast_copy(ToT& out, const FromR& in) { 189| 543k| typecast_copy(std::span(&out, 1), in); 190| 543k|} _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| 543k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 543k| ranges::assert_equal_byte_lengths(out, in); 178| 543k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 543k|} _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| 209k|inline constexpr ToT typecast_copy(const FromR& src) { 211| 209k| ToT dst; // NOLINT(*-member-init) 212| 209k| typecast_copy(dst, src); 213| 209k| return dst; 214| 209k|} _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| 209k|inline constexpr void typecast_copy(ToT& out, const FromR& in) { 189| 209k| typecast_copy(std::span(&out, 1), in); 190| 209k|} _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| 209k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 209k| ranges::assert_equal_byte_lengths(out, in); 178| 209k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 209k|} _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| 636|inline constexpr ToT typecast_copy(const FromR& src) { 211| 636| ToT dst; // NOLINT(*-member-init) 212| 636| typecast_copy(dst, src); 213| 636| return dst; 214| 636|} _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| 636|inline constexpr void typecast_copy(ToT& out, const FromR& in) { 189| 636| typecast_copy(std::span(&out, 1), in); 190| 636|} _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| 636|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 636| ranges::assert_equal_byte_lengths(out, in); 178| 636| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 636|} _ZN5Botan8copy_memIhQsr3stdE12is_trivial_vIu7__decayIT_EEEEvPS1_PKS1_m: 144| 7.60M|inline constexpr void copy_mem(T* out, const T* in, size_t n) { 145| 7.60M| BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null"); ------------------ | | 110| 7.60M| do { \ | | 111| 7.60M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 112| 15.0M| if((expr1) && !(expr2)) { \ | | ------------------ | | | Branch (112:10): [True: 7.52M, False: 84.2k] | | | Branch (112:23): [True: 7.52M, False: 0] | | | Branch (112:23): [True: 7.52M, False: 0] | | ------------------ | | 113| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 114| 0| Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \ | | 115| 0| } \ | | 116| 7.60M| } while(0) | | ------------------ | | | Branch (116:12): [Folded, False: 7.60M] | | ------------------ ------------------ 146| | 147| 7.60M| if(in != nullptr && out != nullptr && n > 0) { ------------------ | Branch (147:7): [True: 7.59M, False: 12.6k] | Branch (147:24): [True: 7.58M, False: 6.61k] | Branch (147:42): [True: 7.52M, False: 64.9k] ------------------ 148| 7.52M| std::memmove(out, in, sizeof(T) * n); 149| 7.52M| } 150| 7.60M|} _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| 113k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 113k| ranges::assert_equal_byte_lengths(out, in); 178| 113k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 113k|} _ZN5Botan19secure_scrub_memoryITkNS_6ranges23contiguous_output_rangeERNSt3__16vectorIhNS2_9allocatorIhEEEEEEvOT_: 59| 1.11M|void secure_scrub_memory(ranges::contiguous_output_range auto&& data) { 60| 1.11M| secure_scrub_memory(std::ranges::data(data), ranges::size_bytes(data)); 61| 1.11M|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERKNSt3__14spanIhLm2EEEtQaaaasr3stdE23is_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| 4.63k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromT& in) { 200| 4.63k| typecast_copy(out, std::span(&in, 1)); 201| 4.63k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERKNSt3__14spanIhLm2EEETkNS1_16contiguous_rangeENS3_IKtLm1EEEQaasr3stdE23is_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| 4.63k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 4.63k| ranges::assert_equal_byte_lengths(out, in); 178| 4.63k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 4.63k|} _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| 545k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromT& in) { 200| 545k| typecast_copy(out, std::span(&in, 1)); 201| 545k|} _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| 545k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 545k| ranges::assert_equal_byte_lengths(out, in); 178| 545k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 545k|} _ZN5Botan9clear_memIjEEvPT_m: 118| 6|inline constexpr void clear_mem(T* ptr, size_t n) { 119| 6| clear_bytes(ptr, sizeof(T) * n); 120| 6|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNSt3__14spanImLm18446744073709551615EEETkNS1_16contiguous_rangeENS3_IKhLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS8_IXsr21__is_primary_templateINS9_Iu14__remove_cvrefIDTclL_ZNSB_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSH_ISP_EESQ_E4type10value_typeEEEEvOSM_RKSC_: 176| 3.83k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 3.83k| ranges::assert_equal_byte_lengths(out, in); 178| 3.83k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 3.83k|} _ZN5Botan8copy_memImQsr3stdE12is_trivial_vIu7__decayIT_EEEEvPS1_PKS1_m: 144| 1.01M|inline constexpr void copy_mem(T* out, const T* in, size_t n) { 145| 1.01M| BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null"); ------------------ | | 110| 1.01M| do { \ | | 111| 1.01M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 112| 2.02M| if((expr1) && !(expr2)) { \ | | ------------------ | | | Branch (112:10): [True: 1.01M, False: 0] | | | Branch (112:23): [True: 1.01M, False: 0] | | | Branch (112:23): [True: 1.01M, 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.01M| } while(0) | | ------------------ | | | Branch (116:12): [Folded, False: 1.01M] | | ------------------ ------------------ 146| | 147| 1.01M| if(in != nullptr && out != nullptr && n > 0) { ------------------ | Branch (147:7): [True: 1.01M, False: 0] | Branch (147:24): [True: 1.01M, False: 0] | Branch (147:42): [True: 1.01M, False: 0] ------------------ 148| 1.01M| std::memmove(out, in, sizeof(T) * n); 149| 1.01M| } 150| 1.01M|} _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| 27|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 27| ranges::assert_equal_byte_lengths(out, in); 162| 27| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 27] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 27| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 27, False: 0] ------------------ 165| 27| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 27| } 167| 27|} _ZN5Botan9clear_memImEEvPT_m: 118| 66.6k|inline constexpr void clear_mem(T* ptr, size_t n) { 119| 66.6k| clear_bytes(ptr, sizeof(T) * n); 120| 66.6k|} _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| 33.5k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 33.5k| ranges::assert_equal_byte_lengths(out, in); 162| 33.5k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 33.5k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 33.5k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 33.5k, False: 0] ------------------ 165| 33.5k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 33.5k| } 167| 33.5k|} _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| 26.4k|inline constexpr ToT typecast_copy(const FromR& src) { 211| 26.4k| ToT dst; // NOLINT(*-member-init) 212| 26.4k| typecast_copy(dst, src); 213| 26.4k| return dst; 214| 26.4k|} _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| 26.4k|inline constexpr void typecast_copy(ToT& out, const FromR& in) { 189| 26.4k| typecast_copy(std::span(&out, 1), in); 190| 26.4k|} _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| 26.4k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 26.4k| ranges::assert_equal_byte_lengths(out, in); 178| 26.4k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 26.4k|} _ZN5Botan9clear_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanIhLm18446744073709551615EEEEEvOT_Qsr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRS5_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISD_EESE_E4type10value_typeEE: 132| 131|{ 133| 131| clear_bytes(std::ranges::data(mem), ranges::size_bytes(mem)); 134| 131|} _ZN5BotaneOINS_16secure_allocatorIhEES2_EERNSt3__16vectorIhT_EES7_RKNS4_IhT0_EE: 532| 215|std::vector& operator^=(std::vector& out, const std::vector& in) { 533| 215| if(out.size() < in.size()) { ------------------ | Branch (533:7): [True: 0, False: 215] ------------------ 534| 0| out.resize(in.size()); 535| 0| } 536| | 537| 215| xor_buf(std::span{out}.first(in.size()), in); 538| 215| return out; 539| 215|} _ZN5Botan7xor_bufITkNS_6ranges23contiguous_output_rangeIhEENSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeIhEERKNS3_6vectorIhNS_16secure_allocatorIhEEEEEEvOT_OT0_: 404| 215| ranges::contiguous_range auto&& in) { 405| 215| ranges::assert_equal_byte_lengths(out, in); 406| | 407| 215| std::span o(out); 408| 215| std::span i(in); 409| | 410| 215| for(; o.size_bytes() >= 32; o = o.subspan(32), i = i.subspan(32)) { ------------------ | Branch (410:10): [True: 0, False: 215] ------------------ 411| 0| auto x = typecast_copy>(o.template first<32>()); 412| 0| const auto y = typecast_copy>(i.template first<32>()); 413| | 414| 0| x[0] ^= y[0]; 415| 0| x[1] ^= y[1]; 416| 0| x[2] ^= y[2]; 417| 0| x[3] ^= y[3]; 418| | 419| 0| typecast_copy(o.template first<32>(), x); 420| 0| } 421| | 422| 3.65k| for(size_t off = 0; off != o.size_bytes(); ++off) { ------------------ | Branch (422:24): [True: 3.44k, False: 215] ------------------ 423| 3.44k| o[off] ^= i[off]; 424| 3.44k| } 425| 215|} _ZN5Botan19secure_scrub_memoryITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayIhLm16EEEEEvOT_: 59| 271|void secure_scrub_memory(ranges::contiguous_output_range auto&& data) { 60| 271| secure_scrub_memory(std::ranges::data(data), ranges::size_bytes(data)); 61| 271|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayIhLm32EEETkNS1_16contiguous_rangeENS2_4spanIKhLm32EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISG_EESH_E4type10value_typeENS9_IXsr21__is_primary_templateINSA_Iu14__remove_cvrefIDTclL_ZNSC_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSI_ISQ_EESR_E4type10value_typeEEsr3stdE23is_trivially_copyable_vISV_EEEvOSD_RKSN_: 160| 15|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 15| ranges::assert_equal_byte_lengths(out, in); 162| 15| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 15] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 15| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 15, False: 0] ------------------ 165| 15| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 15| } 167| 15|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayIhLm56EEETkNS1_16contiguous_rangeENS2_4spanIKhLm18446744073709551615EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISG_EESH_E4type10value_typeENS9_IXsr21__is_primary_templateINSA_Iu14__remove_cvrefIDTclL_ZNSC_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSI_ISQ_EESR_E4type10value_typeEEsr3stdE23is_trivially_copyable_vISV_EEEvOSD_RKSN_: 160| 2|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 2| ranges::assert_equal_byte_lengths(out, in); 162| 2| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 2] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 2| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 2, False: 0] ------------------ 165| 2| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 2| } 167| 2|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeERNSt3__14spanIhLm56EEETkNS1_16contiguous_rangeENS2_6vectorIhNS_16secure_allocatorIhEEEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISH_EESI_E4type10value_typeENSA_IXsr21__is_primary_templateINSB_Iu14__remove_cvrefIDTclL_ZNSD_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSJ_ISR_EESS_E4type10value_typeEEsr3stdE23is_trivially_copyable_vISW_EEEvOSE_RKSO_: 160| 16|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 16| ranges::assert_equal_byte_lengths(out, in); 162| 16| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 16] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 16| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 16, False: 0] ------------------ 165| 16| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 16| } 167| 16|} _ZN5Botan13typecast_copyINS_6StrongINSt3__15arrayIhLm56EEENS_9Point448_EJEEETkNS_6ranges16contiguous_rangeENS2_4spanIKhLm18446744073709551615EEEQaaaasr3stdE26is_default_constructible_vIT_Esr3stdE23is_trivially_copyable_vISB_Esr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEESB_RKSG_: 210| 2|inline constexpr ToT typecast_copy(const FromR& src) { 211| 2| ToT dst; // NOLINT(*-member-init) 212| 2| typecast_copy(dst, src); 213| 2| return dst; 214| 2|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNS_6StrongINSt3__15arrayIhLm56EEENS_9Point448_EJEEETkNS1_16contiguous_rangeENS3_4spanIKhLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINSC_IXsr21__is_primary_templateINSD_Iu14__remove_cvrefIDTclL_ZNSF_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSL_IST_EESU_E4type10value_typeEEEEvOSQ_RKSG_: 176| 2|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 2| ranges::assert_equal_byte_lengths(out, in); 178| 2| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 2|} _ZN5Botan13typecast_copyINS_6StrongINSt3__15arrayIhLm56EEENS_11ScalarX448_EJEEETkNS_6ranges16contiguous_rangeENS2_4spanIKhLm18446744073709551615EEEQaaaasr3stdE26is_default_constructible_vIT_Esr3stdE23is_trivially_copyable_vISB_Esr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEEESB_RKSG_: 210| 18|inline constexpr ToT typecast_copy(const FromR& src) { 211| 18| ToT dst; // NOLINT(*-member-init) 212| 18| typecast_copy(dst, src); 213| 18| return dst; 214| 18|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNS_6StrongINSt3__15arrayIhLm56EEENS_11ScalarX448_EJEEETkNS1_16contiguous_rangeENS3_4spanIKhLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINSC_IXsr21__is_primary_templateINSD_Iu14__remove_cvrefIDTclL_ZNSF_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSL_IST_EESU_E4type10value_typeEEEEvOSQ_RKSG_: 176| 18|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 18| ranges::assert_equal_byte_lengths(out, in); 178| 18| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 18|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeERNSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeENS2_6vectorIhNS_16secure_allocatorIhEEEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISH_EESI_E4type10value_typeENSA_IXsr21__is_primary_templateINSB_Iu14__remove_cvrefIDTclL_ZNSD_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSJ_ISR_EESS_E4type10value_typeEEsr3stdE23is_trivially_copyable_vISW_EEEvOSE_RKSO_: 160| 16.3k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 16.3k| ranges::assert_equal_byte_lengths(out, in); 162| 16.3k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 16.3k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 16.3k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 16.3k, False: 0] ------------------ 165| 16.3k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 16.3k| } 167| 16.3k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNSt3__14spanIjLm18446744073709551615EEETkNS1_16contiguous_rangeENS3_IKhLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS8_IXsr21__is_primary_templateINS9_Iu14__remove_cvrefIDTclL_ZNSB_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSH_ISP_EESQ_E4type10value_typeEEEEvOSM_RKSC_: 176| 35|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 35| ranges::assert_equal_byte_lengths(out, in); 178| 35| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 35|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERKNSt3__14spanIhLm18446744073709551615EEEmQaaaasr3stdE23is_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| 2.60k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromT& in) { 200| 2.60k| typecast_copy(out, std::span(&in, 1)); 201| 2.60k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERKNSt3__14spanIhLm18446744073709551615EEETkNS1_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| 2.60k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 2.60k| ranges::assert_equal_byte_lengths(out, in); 178| 2.60k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 2.60k|} _ZN5Botan7xor_bufITkNS_6ranges23contiguous_output_rangeIhEENSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeIhEERKNS3_6vectorIhNS3_9allocatorIhEEEEEEvOT_OT0_: 404| 79| ranges::contiguous_range auto&& in) { 405| 79| ranges::assert_equal_byte_lengths(out, in); 406| | 407| 79| std::span o(out); 408| 79| std::span i(in); 409| | 410| 79| for(; o.size_bytes() >= 32; o = o.subspan(32), i = i.subspan(32)) { ------------------ | Branch (410:10): [True: 0, False: 79] ------------------ 411| 0| auto x = typecast_copy>(o.template first<32>()); 412| 0| const auto y = typecast_copy>(i.template first<32>()); 413| | 414| 0| x[0] ^= y[0]; 415| 0| x[1] ^= y[1]; 416| 0| x[2] ^= y[2]; 417| 0| x[3] ^= y[3]; 418| | 419| 0| typecast_copy(o.template first<32>(), x); 420| 0| } 421| | 422| 1.02k| for(size_t off = 0; off != o.size_bytes(); ++off) { ------------------ | Branch (422:24): [True: 948, False: 79] ------------------ 423| 948| o[off] ^= i[off]; 424| 948| } 425| 79|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanIhLm4EEETkNS1_16contiguous_rangeENS2_6vectorIhNS2_9allocatorIhEEEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISG_EESH_E4type10value_typeENS9_IXsr21__is_primary_templateINSA_Iu14__remove_cvrefIDTclL_ZNSC_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSI_ISQ_EESR_E4type10value_typeEEsr3stdE23is_trivially_copyable_vISV_EEEvOSD_RKSN_: 160| 131|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 131| ranges::assert_equal_byte_lengths(out, in); 162| 131| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 131] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 131| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 131, False: 0] ------------------ 165| 131| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 131| } 167| 131|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayIhLm16EEETkNS1_16contiguous_rangeENS2_4spanIKhLm18446744073709551615EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISG_EESH_E4type10value_typeENS9_IXsr21__is_primary_templateINSA_Iu14__remove_cvrefIDTclL_ZNSC_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSI_ISQ_EESR_E4type10value_typeEEsr3stdE23is_trivially_copyable_vISV_EEEvOSD_RKSN_: 160| 87|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 87| ranges::assert_equal_byte_lengths(out, in); 162| 87| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 87] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 87| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 87, False: 0] ------------------ 165| 87| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 87| } 167| 87|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayIhLm16EEETkNS1_16contiguous_rangeES4_Qaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISD_EESE_E4type10value_typeENS6_IXsr21__is_primary_templateINS7_Iu14__remove_cvrefIDTclL_ZNS9_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSF_ISN_EESO_E4type10value_typeEEsr3stdE23is_trivially_copyable_vISS_EEEvOSA_RKSK_: 160| 87|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 87| ranges::assert_equal_byte_lengths(out, in); 162| 87| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 87] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 87| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 87, False: 0] ------------------ 165| 87| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 87| } 167| 87|} _ZN5Botan7xor_bufITkNS_6ranges23contiguous_output_rangeIhEERNSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeIhEES5_TkNS7_IhEES5_EEvOT_OT0_OT1_: 435| 87| ranges::contiguous_range auto&& in2) { 436| 87| ranges::assert_equal_byte_lengths(out, in1, in2); 437| | 438| 87| std::span o{out}; 439| 87| std::span i1{in1}; 440| 87| std::span i2{in2}; 441| | 442| 87| for(; o.size_bytes() >= 32; o = o.subspan(32), i1 = i1.subspan(32), i2 = i2.subspan(32)) { ------------------ | Branch (442:10): [True: 0, False: 87] ------------------ 443| 0| auto x = typecast_copy>(i1.template first<32>()); 444| 0| const auto y = typecast_copy>(i2.template first<32>()); 445| | 446| 0| x[0] ^= y[0]; 447| 0| x[1] ^= y[1]; 448| 0| x[2] ^= y[2]; 449| 0| x[3] ^= y[3]; 450| | 451| 0| typecast_copy(o.template first<32>(), x); 452| 0| } 453| | 454| 1.47k| for(size_t off = 0; off != o.size_bytes(); ++off) { ------------------ | Branch (454:24): [True: 1.39k, False: 87] ------------------ 455| 1.39k| o[off] = i1[off] ^ i2[off]; 456| 1.39k| } 457| 87|} _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| 48|{ 133| 48| clear_bytes(std::ranges::data(mem), ranges::size_bytes(mem)); 134| 48|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm4EEETkNS1_16contiguous_rangeENS2_5arrayImLm4EEEQaasr3stdE9is_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| 48.6k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 48.6k| ranges::assert_equal_byte_lengths(out, in); 162| 48.6k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 48.6k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 48.6k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 48.6k, False: 0] ------------------ 165| 48.6k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 48.6k| } 167| 48.6k|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayIhLm8EEETkNS1_16contiguous_rangeENS2_4spanIKhLm8EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISG_EESH_E4type10value_typeENS9_IXsr21__is_primary_templateINSA_Iu14__remove_cvrefIDTclL_ZNSC_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSI_ISQ_EESR_E4type10value_typeEEsr3stdE23is_trivially_copyable_vISV_EEEvOSD_RKSN_: 160| 3.83k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 3.83k| ranges::assert_equal_byte_lengths(out, in); 162| 3.83k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 3.83k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 3.83k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 3.83k, False: 0] ------------------ 165| 3.83k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 3.83k| } 167| 3.83k|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanIhLm40EEETkNS1_16contiguous_rangeENS3_IKhLm40EEEQaasr3stdE9is_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| 8.28k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 8.28k| ranges::assert_equal_byte_lengths(out, in); 162| 8.28k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 8.28k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 8.28k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 8.28k, False: 0] ------------------ 165| 8.28k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 8.28k| } 167| 8.28k|} _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| 4.21k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 4.21k| ranges::assert_equal_byte_lengths(out, in); 162| 4.21k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 4.21k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 4.21k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 4.21k, False: 0] ------------------ 165| 4.21k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 4.21k| } 167| 4.21k|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanIhLm56EEETkNS1_16contiguous_rangeENS3_IKhLm56EEEQaasr3stdE9is_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| 5.51k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 5.51k| ranges::assert_equal_byte_lengths(out, in); 162| 5.51k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 5.51k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 5.51k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 5.51k, False: 0] ------------------ 165| 5.51k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 5.51k| } 167| 5.51k|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanIhLm72EEETkNS1_16contiguous_rangeENS3_IKhLm72EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeENS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIST_EEEvOSB_RKSL_: 160| 2.79k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 2.79k| ranges::assert_equal_byte_lengths(out, in); 162| 2.79k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 2.79k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 2.79k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 2.79k, False: 0] ------------------ 165| 2.79k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 2.79k| } 167| 2.79k|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm8EEETkNS1_16contiguous_rangeENS2_5arrayImLm8EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeENS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIST_EEEvOSB_RKSL_: 160| 3.72k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 3.72k| ranges::assert_equal_byte_lengths(out, in); 162| 3.72k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 3.72k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 3.72k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 3.72k, False: 0] ------------------ 165| 3.72k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 3.72k| } 167| 3.72k|} _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| 843|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 843| ranges::assert_equal_byte_lengths(out, in); 162| 843| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 843] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 843| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 843, False: 0] ------------------ 165| 843| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 843| } 167| 843|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanIhLm74EEETkNS1_16contiguous_rangeENS3_IKhLm74EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeENS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIST_EEEvOSB_RKSL_: 160| 2.60k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 2.60k| ranges::assert_equal_byte_lengths(out, in); 162| 2.60k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 2.60k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 2.60k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 2.60k, False: 0] ------------------ 165| 2.60k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 2.60k| } 167| 2.60k|} _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| 2.74k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 2.74k| ranges::assert_equal_byte_lengths(out, in); 162| 2.74k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 2.74k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 2.74k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 2.74k, False: 0] ------------------ 165| 2.74k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 2.74k| } 167| 2.74k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayImLm7EEETkNS1_16contiguous_rangeENS2_4spanIKhLm56EEEQaasr3stdE23is_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| 36|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 36| ranges::assert_equal_byte_lengths(out, in); 178| 36| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 36|} _ZN5Botan9clear_memITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayImLm7EEEEEvOT_Qsr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRS6_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEE: 132| 145k|{ 133| 145k| clear_bytes(std::ranges::data(mem), ranges::size_bytes(mem)); 134| 145k|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNSt3__14spanIhLm56EEETkNS1_16contiguous_rangeENS2_5arrayImLm7EEEQaasr3stdE23is_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| 18|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 18| ranges::assert_equal_byte_lengths(out, in); 178| 18| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 18|} _ZN5Botan14Asymmetric_KeyD2Ev: 66| 10.1k| virtual ~Asymmetric_Key() = default; _ZN5Botan6PK_Ops13Key_AgreementD2Ev: 153| 1.41k| virtual ~Key_Agreement() = default; _ZN5Botan24PK_Key_Agreement_OptionsC2Ev: 353| 1.41k| PK_Key_Agreement_Options() = default; _ZN5Botan24PK_Key_Agreement_OptionsC2ERKS0_: 358| 1.41k| PK_Key_Agreement_Options(const PK_Key_Agreement_Options&) = default; _ZNK5Botan31PK_Key_Agreement_Options_Reader13note_examinedENS0_6OptionE: 369| 4.25k| void note_examined(Option option) const { m_examined |= static_cast(option); } _ZNK5Botan31PK_Key_Agreement_Options_Reader3kdfEv: 338| 1.41k| const std::optional& kdf() const { 339| 1.41k| note_examined(Option::Kdf); 340| 1.41k| return m_options.m_kdf; 341| 1.41k| } _ZNK5Botan31PK_Key_Agreement_Options_Reader9using_kdfEv: 343| 1.41k| bool using_kdf() const { return kdf().has_value(); } _ZNK5Botan31PK_Key_Agreement_Options_Reader20using_raw_shared_keyEv: 345| 1.41k| bool using_raw_shared_key() const { 346| 1.41k| note_examined(Option::RawSharedKey); 347| 1.41k| return m_options.m_raw_shared_key; 348| 1.41k| } _ZN5Botan31PK_Key_Agreement_Options_ReaderC2ERKNS_24PK_Key_Agreement_OptionsE: 361| 1.41k| explicit PK_Key_Agreement_Options_Reader(const PK_Key_Agreement_Options& options) : m_options(options) {} _ZN5Botan15Key_ConstraintsC2Ev: 167| 6.36k| Key_Constraints() : m_value(0) {} _ZN5Botan18X509_Serial_NumberC2Ev: 70| 6.36k| X509_Serial_Number() : m_contents{0x00} {} _ZNK5Botan7X509_DN8get_bitsEv: 198| 12.5k| const std::vector& get_bits() const { return m_dn_bits; } _ZNK5Botan7X509_DN16_canonical_bytesEv: 274| 12.5k| const std::vector& _canonical_bytes() const { return m_canonical_dn_bits; } _ZN5Botan10Extensions15Extensions_InfoC2EbNSt3__16vectorIhNS2_9allocatorIhEEEENS2_10unique_ptrINS_21Certificate_ExtensionENS2_14default_deleteIS8_EEEE: 1049| 25.0k| m_obj(std::move(ext)), m_bits(std::move(encoding)), m_critical(critical) {} _ZN5Botan10ExtensionsC2Ev: 1027| 6.36k| Extensions() = default; _ZN5Botan10ExtensionsD2Ev: 1035| 6.36k| ~Extensions() override = default; _ZN5Botan7X509_DNC2Ev: 159| 13.3k| X509_DN() = default; _ZN5Botan15NameConstraintsC2Ev: 753| 6.36k| NameConstraints() = default; _ZN5Botan21Certificate_ExtensionD2Ev: 856| 25.0k| virtual ~Certificate_Extension() = default; _ZN5Botan15AlternativeNameC2Ev: 336| 18.9k| AlternativeName() = default; _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension17Basic_ConstraintsEEEPKT_RKNS_3OIDE: 882| 6.26k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 6.26k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 6.26k, False: 0] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 6.26k| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 0, False: 6.26k] ------------------ 886| 0| return nullptr; 887| 6.26k| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 6.26k, False: 0] ------------------ 888| 6.26k| return extn_as_T; 889| 6.26k| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 6.26k| } 893| | 894| 0| return nullptr; 895| 6.26k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension28Authority_Information_AccessEEEPKT_RKNS_3OIDE: 882| 6.26k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 6.26k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 0, False: 6.26k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 0| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 0, False: 0] ------------------ 886| 0| return nullptr; 887| 0| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 0, False: 0] ------------------ 888| 0| return extn_as_T; 889| 0| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 0| } 893| | 894| 6.26k| return nullptr; 895| 6.26k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension9Key_UsageEEEPKT_RKNS_3OIDE: 882| 6.26k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 6.26k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 0, False: 6.26k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 0| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 0, False: 0] ------------------ 886| 0| return nullptr; 887| 0| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 0, False: 0] ------------------ 888| 0| return extn_as_T; 889| 0| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 0| } 893| | 894| 6.26k| return nullptr; 895| 6.26k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension14Subject_Key_IDEEEPKT_RKNS_3OIDE: 882| 6.26k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 6.26k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 6.26k, False: 0] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 6.26k| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 0, False: 6.26k] ------------------ 886| 0| return nullptr; 887| 6.26k| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 6.26k, False: 0] ------------------ 888| 6.26k| return extn_as_T; 889| 6.26k| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 6.26k| } 893| | 894| 0| return nullptr; 895| 6.26k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension16Authority_Key_IDEEEPKT_RKNS_3OIDE: 882| 6.26k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 6.26k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 6.26k, False: 0] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 6.26k| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 0, False: 6.26k] ------------------ 886| 0| return nullptr; 887| 6.26k| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 6.26k, False: 0] ------------------ 888| 6.26k| return extn_as_T; 889| 6.26k| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 6.26k| } 893| | 894| 0| return nullptr; 895| 6.26k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension16Name_ConstraintsEEEPKT_RKNS_3OIDE: 882| 6.26k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 6.26k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 0, False: 6.26k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 0| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 0, False: 0] ------------------ 886| 0| return nullptr; 887| 0| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 0, False: 0] ------------------ 888| 0| return extn_as_T; 889| 0| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 0| } 893| | 894| 6.26k| return nullptr; 895| 6.26k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension18Extended_Key_UsageEEEPKT_RKNS_3OIDE: 882| 6.26k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 6.26k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 0, False: 6.26k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 0| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 0, False: 0] ------------------ 886| 0| return nullptr; 887| 0| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 0, False: 0] ------------------ 888| 0| return extn_as_T; 889| 0| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 0| } 893| | 894| 6.26k| return nullptr; 895| 6.26k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension23Issuer_Alternative_NameEEEPKT_RKNS_3OIDE: 882| 6.26k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 6.26k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 0, False: 6.26k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 0| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 0, False: 0] ------------------ 886| 0| return nullptr; 887| 0| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 0, False: 0] ------------------ 888| 0| return extn_as_T; 889| 0| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 0| } 893| | 894| 6.26k| return nullptr; 895| 6.26k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension24Subject_Alternative_NameEEEPKT_RKNS_3OIDE: 882| 6.26k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 6.26k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 6.26k, False: 0] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 6.26k| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 0, False: 6.26k] ------------------ 886| 0| return nullptr; 887| 6.26k| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 6.26k, False: 0] ------------------ 888| 6.26k| return extn_as_T; 889| 6.26k| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 6.26k| } 893| | 894| 0| return nullptr; 895| 6.26k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension20Certificate_PoliciesEEEPKT_RKNS_3OIDE: 882| 6.26k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 6.26k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 0, False: 6.26k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 0| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 0, False: 0] ------------------ 886| 0| return nullptr; 887| 0| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 0, False: 0] ------------------ 888| 0| return extn_as_T; 889| 0| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 0| } 893| | 894| 6.26k| return nullptr; 895| 6.26k| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension23CRL_Distribution_PointsEEEPKT_RKNS_3OIDE: 882| 6.26k| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 883| 6.26k| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (883:42): [True: 0, False: 6.26k] ------------------ 884| | // Unknown_Extension oid_name is empty 885| 0| if(extn->oid_name().empty()) { ------------------ | Branch (885:16): [True: 0, False: 0] ------------------ 886| 0| return nullptr; 887| 0| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (887:32): [True: 0, False: 0] ------------------ 888| 0| return extn_as_T; 889| 0| } else { 890| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 891| 0| } 892| 0| } 893| | 894| 6.26k| return nullptr; 895| 6.26k| } _ZN5Botan6ranges24assert_exact_byte_lengthILm32ETkNS0_14spanable_rangeENSt3__14spanIhLm32EEEEEvRKT0_: 77| 2.77k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 2.77k| const std::span s{r}; 79| 2.77k| if constexpr(statically_spanable_range) { 80| 2.77k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 2.77k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayImLm4EEETpTkNS0_14spanable_rangeEJNS2_4spanIhLm32EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 2.77k|{ 101| 2.77k| const std::span s0{r0}; 102| | 103| 2.77k| if constexpr(statically_spanable_range) { 104| 2.77k| constexpr size_t expected_size = s0.size_bytes(); 105| 2.77k| (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.77k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__15arrayImLm4EEEEEmRKT_: 59| 6.58k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 6.58k| return std::span{r}.size_bytes(); 61| 6.58k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm32ETkNS0_14spanable_rangeENSt3__14spanIKhLm32EEEEEvRKT0_: 77| 3.82k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 3.82k| const std::span s{r}; 79| 3.82k| if constexpr(statically_spanable_range) { 80| 3.82k| 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.82k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayImLm4EEETpTkNS0_14spanable_rangeEJNS2_4spanIKhLm32EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 3.80k|{ 101| 3.80k| const std::span s0{r0}; 102| | 103| 3.80k| if constexpr(statically_spanable_range) { 104| 3.80k| constexpr size_t expected_size = s0.size_bytes(); 105| 3.80k| (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.80k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm32ETkNS0_14spanable_rangeENSt3__15arrayImLm4EEEEEvRKT0_: 77| 98.2k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 98.2k| const std::span s{r}; 79| 98.2k| if constexpr(statically_spanable_range) { 80| 98.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| 98.2k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm32EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm4EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 49.6k|{ 101| 49.6k| const std::span s0{r0}; 102| | 103| 49.6k| if constexpr(statically_spanable_range) { 104| 49.6k| constexpr size_t expected_size = s0.size_bytes(); 105| 49.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| 49.6k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm32EEEEEmRKT_: 59| 3.29k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 3.29k| return std::span{r}.size_bytes(); 61| 3.29k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 38.9k|{ 101| 38.9k| 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| 38.9k| } else { 107| 38.9k| const size_t expected_size = s0.size_bytes(); 108| 38.9k| const bool correct_size = 109| 38.9k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 38.9k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 38.9k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 38.9k| } 115| 38.9k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEES6_EEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 843|{ 101| 843| 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| 843| } else { 107| 843| const size_t expected_size = s0.size_bytes(); 108| 843| const bool correct_size = 109| 1.68k| ((std::span>{rs}.size_bytes() == expected_size) && ...); ------------------ | Branch (109:11): [True: 843, False: 0] | Branch (109:11): [True: 843, False: 0] ------------------ 110| | 111| 843| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 843] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 843| } 115| 843|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIhLm8EEEEEvRKT0_: 77| 819k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 819k| const std::span s{r}; 79| 819k| if constexpr(statically_spanable_range) { 80| 819k| 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| 819k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm8EEETpTkNS0_14spanable_rangeEJNS3_IKmLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 444k|{ 101| 444k| const std::span s0{r0}; 102| | 103| 444k| if constexpr(statically_spanable_range) { 104| 444k| constexpr size_t expected_size = s0.size_bytes(); 105| 444k| (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| 444k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIKmLm1EEEEEvRKT0_: 77| 444k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 444k| const std::span s{r}; 79| 444k| if constexpr(statically_spanable_range) { 80| 444k| 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| 444k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm8EEEEEmRKT_: 59| 444k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 444k| return std::span{r}.size_bytes(); 61| 444k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIKhLm8EEEEEvRKT0_: 77| 1.09M|inline constexpr void assert_exact_byte_length(const R& r) { 78| 1.09M| const std::span s{r}; 79| 1.09M| if constexpr(statically_spanable_range) { 80| 1.09M| 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.09M|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm1EEETpTkNS0_14spanable_rangeEJNS3_IKhLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 543k|{ 101| 543k| const std::span s0{r0}; 102| | 103| 543k| if constexpr(statically_spanable_range) { 104| 543k| constexpr size_t expected_size = s0.size_bytes(); 105| 543k| (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| 543k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm1EEEEEmRKT_: 59| 570k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 570k| return std::span{r}.size_bytes(); 61| 570k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm2ETkNS0_14spanable_rangeENSt3__14spanIhLm2EEEEEvRKT0_: 77| 9.25k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 9.25k| const std::span s{r}; 79| 9.25k| if constexpr(statically_spanable_range) { 80| 9.25k| 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| 9.25k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanItLm1EEEEEmRKT_: 59| 209k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 209k| return std::span{r}.size_bytes(); 61| 209k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm2ETkNS0_14spanable_rangeENSt3__14spanIKhLm2EEEEEvRKT0_: 77| 418k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 418k| const std::span s{r}; 79| 418k| if constexpr(statically_spanable_range) { 80| 418k| 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| 418k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanItLm1EEETpTkNS0_14spanable_rangeEJNS3_IKhLm2EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 209k|{ 101| 209k| const std::span s0{r0}; 102| | 103| 209k| if constexpr(statically_spanable_range) { 104| 209k| constexpr size_t expected_size = s0.size_bytes(); 105| 209k| (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| 209k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__14spanIKhLm4EEEEEvRKT0_: 77| 1.27k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 1.27k| const std::span s{r}; 79| 1.27k| if constexpr(statically_spanable_range) { 80| 1.27k| 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.27k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIjLm1EEETpTkNS0_14spanable_rangeEJNS3_IKhLm4EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 636|{ 101| 636| const std::span s0{r0}; 102| | 103| 636| if constexpr(statically_spanable_range) { 104| 636| constexpr size_t expected_size = s0.size_bytes(); 105| 636| (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| 636|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIjLm1EEEEEmRKT_: 59| 636|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 636| return std::span{r}.size_bytes(); 61| 636|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm8EEETpTkNS0_14spanable_rangeEJNS3_ImLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 227k|{ 101| 227k| const std::span s0{r0}; 102| | 103| 227k| if constexpr(statically_spanable_range) { 104| 227k| constexpr size_t expected_size = s0.size_bytes(); 105| 227k| (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| 227k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__15arrayImLm1EEEEEvRKT0_: 77| 227k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 227k| const std::span s{r}; 79| 227k| if constexpr(statically_spanable_range) { 80| 227k| 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| 227k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__15arrayIhLm8EEEEEmRKT_: 59| 121k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 121k| return std::span{r}.size_bytes(); 61| 121k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__16vectorIhNS2_9allocatorIhEEEEEEmRKT_: 59| 1.11M|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 1.11M| return std::span{r}.size_bytes(); 61| 1.11M|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm2EEETpTkNS0_14spanable_rangeEJNS3_IKtLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 4.63k|{ 101| 4.63k| const std::span s0{r0}; 102| | 103| 4.63k| if constexpr(statically_spanable_range) { 104| 4.63k| constexpr size_t expected_size = s0.size_bytes(); 105| 4.63k| (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| 4.63k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm2ETkNS0_14spanable_rangeENSt3__14spanIKtLm1EEEEEvRKT0_: 77| 4.63k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 4.63k| const std::span s{r}; 79| 4.63k| if constexpr(statically_spanable_range) { 80| 4.63k| 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| 4.63k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm2EEEEEmRKT_: 59| 4.63k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 4.63k| return std::span{r}.size_bytes(); 61| 4.63k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__14spanIhLm4EEEEEvRKT0_: 77| 1.08M|inline constexpr void assert_exact_byte_length(const R& r) { 78| 1.08M| const std::span s{r}; 79| 1.08M| if constexpr(statically_spanable_range) { 80| 1.08M| 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.08M|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm4EEETpTkNS0_14spanable_rangeEJNS3_IKjLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 545k|{ 101| 545k| const std::span s0{r0}; 102| | 103| 545k| if constexpr(statically_spanable_range) { 104| 545k| constexpr size_t expected_size = s0.size_bytes(); 105| 545k| (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| 545k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__14spanIKjLm1EEEEEvRKT0_: 77| 545k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 545k| const std::span s{r}; 79| 545k| if constexpr(statically_spanable_range) { 80| 545k| 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| 545k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm4EEEEEmRKT_: 59| 545k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 545k| return std::span{r}.size_bytes(); 61| 545k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm16ETkNS0_14spanable_rangeENSt3__14spanIhLm16EEEEEvRKT0_: 77| 41|inline constexpr void assert_exact_byte_length(const R& r) { 78| 41| const std::span s{r}; 79| 41| if constexpr(statically_spanable_range) { 80| 41| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 41|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 8.14k|{ 101| 8.14k| 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| 8.14k| } else { 107| 8.14k| const size_t expected_size = s0.size_bytes(); 108| 8.14k| const bool correct_size = 109| 8.14k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 8.14k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 8.14k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 8.14k| } 115| 8.14k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIjLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 70|{ 101| 70| 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| 70| } else { 107| 70| const size_t expected_size = s0.size_bytes(); 108| 70| const bool correct_size = 109| 70| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 70| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 70] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 70| } 115| 70|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKjLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 76.3k|{ 101| 76.3k| 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.3k| } else { 107| 76.3k| const size_t expected_size = s0.size_bytes(); 108| 76.3k| const bool correct_size = 109| 76.3k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 76.3k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 76.3k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 76.3k| } 115| 76.3k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEEEEmRKT_: 59| 102k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 102k| return std::span{r}.size_bytes(); 61| 102k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKmLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 5.94k|{ 101| 5.94k| 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| 5.94k| } else { 107| 5.94k| const size_t expected_size = s0.size_bytes(); 108| 5.94k| const bool correct_size = 109| 5.94k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 5.94k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 5.94k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 5.94k| } 115| 5.94k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm18446744073709551615EEEEEmRKT_: 59| 3.88k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 3.88k| return std::span{r}.size_bytes(); 61| 3.88k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__15arrayIhLm8EEEEEvRKT0_: 77| 26.4k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 26.4k| const std::span s{r}; 79| 26.4k| if constexpr(statically_spanable_range) { 80| 26.4k| 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| 26.4k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm1EEETpTkNS0_14spanable_rangeEJNS3_IhLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 26.4k|{ 101| 26.4k| const std::span s0{r0}; 102| | 103| 26.4k| if constexpr(statically_spanable_range) { 104| 26.4k| constexpr size_t expected_size = s0.size_bytes(); 105| 26.4k| (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| 26.4k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__15arrayIhLm16EEEEEmRKT_: 59| 619|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 619| return std::span{r}.size_bytes(); 61| 619|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS2_6vectorIhNS_16secure_allocatorIhEEEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 16.5k|{ 101| 16.5k| 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| 16.5k| } else { 107| 16.5k| const size_t expected_size = s0.size_bytes(); 108| 16.5k| const bool correct_size = 109| 16.5k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 16.5k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 16.5k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 16.5k| } 115| 16.5k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm16EEETpTkNS0_14spanable_rangeEJNS3_ImLm2EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 87|{ 101| 87| const std::span s0{r0}; 102| | 103| 87| if constexpr(statically_spanable_range) { 104| 87| constexpr size_t expected_size = s0.size_bytes(); 105| 87| (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| 87|} _ZN5Botan6ranges24assert_exact_byte_lengthILm16ETkNS0_14spanable_rangeENSt3__15arrayImLm2EEEEEvRKT0_: 77| 87|inline constexpr void assert_exact_byte_length(const R& r) { 78| 87| const std::span s{r}; 79| 87| if constexpr(statically_spanable_range) { 80| 87| 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| 87|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm32EEETpTkNS0_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|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__15arrayIhLm32EEEEEmRKT_: 59| 30|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 30| return std::span{r}.size_bytes(); 61| 30|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm56EEETpTkNS0_14spanable_rangeEJNS2_4spanIKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 2|{ 101| 2| const std::span s0{r0}; 102| | 103| 2| if constexpr(statically_spanable_range) { 104| 2| constexpr size_t expected_size = s0.size_bytes(); 105| 2| (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|} _ZN5Botan6ranges24assert_exact_byte_lengthILm56ETkNS0_14spanable_rangeENSt3__14spanIKhLm18446744073709551615EEEEEvRKT0_: 77| 2|inline constexpr void assert_exact_byte_length(const R& r) { 78| 2| 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| } else { 82| 2| if(s.size_bytes() != expected) { ------------------ | Branch (82:10): [True: 0, False: 2] ------------------ 83| 0| memory_region_size_violation(); 84| 0| } 85| 2| } 86| 2|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__15arrayIhLm56EEEEEmRKT_: 59| 4|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 4| return std::span{r}.size_bytes(); 61| 4|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm56EEETpTkNS0_14spanable_rangeEJNS2_6vectorIhNS_16secure_allocatorIhEEEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 16|{ 101| 16| const std::span s0{r0}; 102| | 103| 16| if constexpr(statically_spanable_range) { 104| 16| constexpr size_t expected_size = s0.size_bytes(); 105| 16| (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| 16|} _ZN5Botan6ranges24assert_exact_byte_lengthILm56ETkNS0_14spanable_rangeENSt3__16vectorIhNS_16secure_allocatorIhEEEEEEvRKT0_: 77| 16|inline constexpr void assert_exact_byte_length(const R& r) { 78| 16| 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| 16| } else { 82| 16| if(s.size_bytes() != expected) { ------------------ | Branch (82:10): [True: 0, False: 16] ------------------ 83| 0| memory_region_size_violation(); 84| 0| } 85| 16| } 86| 16|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm56EEEEEmRKT_: 59| 11.0k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 11.0k| return std::span{r}.size_bytes(); 61| 11.0k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENS_6StrongINSt3__15arrayIhLm56EEENS_9Point448_EJEEETpTkNS0_14spanable_rangeEJNS3_4spanIKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 2|{ 101| 2| 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| 2| } else { 107| 2| const size_t expected_size = s0.size_bytes(); 108| 2| const bool correct_size = 109| 2| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 2| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 2] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 2| } 115| 2|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENS_6StrongINSt3__15arrayIhLm56EEENS_9Point448_EJEEEEEmRKT_: 59| 2|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 2| return std::span{r}.size_bytes(); 61| 2|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENS_6StrongINSt3__15arrayIhLm56EEENS_11ScalarX448_EJEEETpTkNS0_14spanable_rangeEJNS3_4spanIKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 18|{ 101| 18| 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| 18| } else { 107| 18| const size_t expected_size = s0.size_bytes(); 108| 18| const bool correct_size = 109| 18| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 18| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 18] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 18| } 115| 18|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENS_6StrongINSt3__15arrayIhLm56EEENS_11ScalarX448_EJEEEEEmRKT_: 59| 18|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 18| return std::span{r}.size_bytes(); 61| 18|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__15arrayImLm7EEEEEmRKT_: 59| 145k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 145k| return std::span{r}.size_bytes(); 61| 145k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm1ETkNS0_14spanable_rangeENSt3__15arrayIhLm1EEEEEvRKT0_: 77| 2.30k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 2.30k| const std::span s{r}; 79| 2.30k| if constexpr(statically_spanable_range) { 80| 2.30k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 2.30k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm1EEETpTkNS0_14spanable_rangeEJS4_EEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 2.30k|{ 101| 2.30k| const std::span s0{r0}; 102| | 103| 2.30k| if constexpr(statically_spanable_range) { 104| 2.30k| constexpr size_t expected_size = s0.size_bytes(); 105| 2.30k| (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.30k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm1ETkNS0_14spanable_rangeENSt3__14spanIhLm1EEEEEvRKT0_: 77| 4.61k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 4.61k| const std::span s{r}; 79| 4.61k| if constexpr(statically_spanable_range) { 80| 4.61k| 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| 4.61k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm2ETkNS0_14spanable_rangeENSt3__15arrayItLm1EEEEEvRKT0_: 77| 4.61k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 4.61k| const std::span s{r}; 79| 4.61k| if constexpr(statically_spanable_range) { 80| 4.61k| 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| 4.61k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm2EEETpTkNS0_14spanable_rangeEJNS3_ItLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 4.61k|{ 101| 4.61k| const std::span s0{r0}; 102| | 103| 4.61k| if constexpr(statically_spanable_range) { 104| 4.61k| constexpr size_t expected_size = s0.size_bytes(); 105| 4.61k| (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| 4.61k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm16ETkNS0_14spanable_rangeENSt3__15arrayIhLm16EEEEEvRKT0_: 77| 87|inline constexpr void assert_exact_byte_length(const R& r) { 78| 87| const std::span s{r}; 79| 87| if constexpr(statically_spanable_range) { 80| 87| 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| 87|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIjLm18446744073709551615EEEEEmRKT_: 59| 35|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 35| return std::span{r}.size_bytes(); 61| 35|} _ZN5Botan6ranges24assert_exact_byte_lengthILm1ETkNS0_14spanable_rangeENSt3__14spanIKhLm1EEEEEvRKT0_: 77| 956k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 956k| const std::span s{r}; 79| 956k| if constexpr(statically_spanable_range) { 80| 956k| 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| 956k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEEEEvRKT0_: 77| 2.60k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 2.60k| 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.60k| } else { 82| 2.60k| if(s.size_bytes() != expected) { ------------------ | Branch (82:10): [True: 0, False: 2.60k] ------------------ 83| 0| memory_region_size_violation(); 84| 0| } 85| 2.60k| } 86| 2.60k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKmLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 2.60k|{ 101| 2.60k| 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| 2.60k| } else { 107| 2.60k| const size_t expected_size = s0.size_bytes(); 108| 2.60k| const bool correct_size = 109| 2.60k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 2.60k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 2.60k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 2.60k| } 115| 2.60k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS2_6vectorIhNS2_9allocatorIhEEEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 79|{ 101| 79| 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| 79| } else { 107| 79| const size_t expected_size = s0.size_bytes(); 108| 79| const bool correct_size = 109| 79| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 79| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 79] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 79| } 115| 79|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm4EEETpTkNS0_14spanable_rangeEJNS2_6vectorIhNS2_9allocatorIhEEEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 131|{ 101| 131| const std::span s0{r0}; 102| | 103| 131| if constexpr(statically_spanable_range) { 104| 131| constexpr size_t expected_size = s0.size_bytes(); 105| 131| (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| 131|} _ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__16vectorIhNS2_9allocatorIhEEEEEEvRKT0_: 77| 131|inline constexpr void assert_exact_byte_length(const R& r) { 78| 131| 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| 131| } else { 82| 131| if(s.size_bytes() != expected) { ------------------ | Branch (82:10): [True: 0, False: 131] ------------------ 83| 0| memory_region_size_violation(); 84| 0| } 85| 131| } 86| 131|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm16EEETpTkNS0_14spanable_rangeEJNS2_4spanIKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 87|{ 101| 87| const std::span s0{r0}; 102| | 103| 87| if constexpr(statically_spanable_range) { 104| 87| constexpr size_t expected_size = s0.size_bytes(); 105| 87| (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| 87|} _ZN5Botan6ranges24assert_exact_byte_lengthILm16ETkNS0_14spanable_rangeENSt3__14spanIKhLm18446744073709551615EEEEEvRKT0_: 77| 87|inline constexpr void assert_exact_byte_length(const R& r) { 78| 87| 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| 87| } else { 82| 87| if(s.size_bytes() != expected) { ------------------ | Branch (82:10): [True: 0, False: 87] ------------------ 83| 0| memory_region_size_violation(); 84| 0| } 85| 87| } 86| 87|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm16EEETpTkNS0_14spanable_rangeEJS4_EEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 87|{ 101| 87| const std::span s0{r0}; 102| | 103| 87| if constexpr(statically_spanable_range) { 104| 87| constexpr size_t expected_size = s0.size_bytes(); 105| 87| (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| 87|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJS4_S4_EEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 87|{ 101| 87| 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| 87| } else { 107| 87| const size_t expected_size = s0.size_bytes(); 108| 87| const bool correct_size = 109| 174| ((std::span>{rs}.size_bytes() == expected_size) && ...); ------------------ | Branch (109:11): [True: 87, False: 0] | Branch (109:11): [True: 87, False: 0] ------------------ 110| | 111| 87| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 87] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 87| } 115| 87|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm4EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm4EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 48.6k|{ 101| 48.6k| const std::span s0{r0}; 102| | 103| 48.6k| if constexpr(statically_spanable_range) { 104| 48.6k| constexpr size_t expected_size = s0.size_bytes(); 105| 48.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| 48.6k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm4EEEEEmRKT_: 59| 97.2k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 97.2k| return std::span{r}.size_bytes(); 61| 97.2k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm8EEETpTkNS0_14spanable_rangeEJNS2_4spanIKhLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 3.83k|{ 101| 3.83k| const std::span s0{r0}; 102| | 103| 3.83k| if constexpr(statically_spanable_range) { 104| 3.83k| constexpr size_t expected_size = s0.size_bytes(); 105| 3.83k| (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.83k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm40EEETpTkNS0_14spanable_rangeEJNS3_IKhLm40EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 8.28k|{ 101| 8.28k| const std::span s0{r0}; 102| | 103| 8.28k| if constexpr(statically_spanable_range) { 104| 8.28k| constexpr size_t expected_size = s0.size_bytes(); 105| 8.28k| (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| 8.28k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm40ETkNS0_14spanable_rangeENSt3__14spanIKhLm40EEEEEvRKT0_: 77| 8.28k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 8.28k| const std::span s{r}; 79| 8.28k| if constexpr(statically_spanable_range) { 80| 8.28k| 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| 8.28k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm40EEEEEmRKT_: 59| 16.5k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 16.5k| return std::span{r}.size_bytes(); 61| 16.5k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__16vectorIhNS2_9allocatorIhEEEETpTkNS0_14spanable_rangeEJA8_mEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 1.65k|{ 101| 1.65k| 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| 1.65k| } else { 107| 1.65k| const size_t expected_size = s0.size_bytes(); 108| 1.65k| const bool correct_size = 109| 1.65k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 1.65k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 1.65k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 1.65k| } 115| 1.65k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm6EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm6EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 4.21k|{ 101| 4.21k| const std::span s0{r0}; 102| | 103| 4.21k| if constexpr(statically_spanable_range) { 104| 4.21k| constexpr size_t expected_size = s0.size_bytes(); 105| 4.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| 4.21k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm48ETkNS0_14spanable_rangeENSt3__15arrayImLm6EEEEEvRKT0_: 77| 9.78k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 9.78k| const std::span s{r}; 79| 9.78k| if constexpr(statically_spanable_range) { 80| 9.78k| 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| 9.78k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm6EEEEEmRKT_: 59| 8.42k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 8.42k| return std::span{r}.size_bytes(); 61| 8.42k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm56EEETpTkNS0_14spanable_rangeEJNS3_IKhLm56EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 5.51k|{ 101| 5.51k| const std::span s0{r0}; 102| | 103| 5.51k| if constexpr(statically_spanable_range) { 104| 5.51k| constexpr size_t expected_size = s0.size_bytes(); 105| 5.51k| (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| 5.51k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm56ETkNS0_14spanable_rangeENSt3__14spanIKhLm56EEEEEvRKT0_: 77| 5.58k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 5.58k| const std::span s{r}; 79| 5.58k| if constexpr(statically_spanable_range) { 80| 5.58k| 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.58k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__16vectorIhNS2_9allocatorIhEEEETpTkNS0_14spanable_rangeEJA12_mEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 1.10k|{ 101| 1.10k| 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| 1.10k| } else { 107| 1.10k| const size_t expected_size = s0.size_bytes(); 108| 1.10k| const bool correct_size = 109| 1.10k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 1.10k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 1.10k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 1.10k| } 115| 1.10k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm48EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm6EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 5.57k|{ 101| 5.57k| const std::span s0{r0}; 102| | 103| 5.57k| if constexpr(statically_spanable_range) { 104| 5.57k| constexpr size_t expected_size = s0.size_bytes(); 105| 5.57k| (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| 5.57k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm72EEETpTkNS0_14spanable_rangeEJNS3_IKhLm72EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 2.79k|{ 101| 2.79k| const std::span s0{r0}; 102| | 103| 2.79k| if constexpr(statically_spanable_range) { 104| 2.79k| constexpr size_t expected_size = s0.size_bytes(); 105| 2.79k| (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.79k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm72ETkNS0_14spanable_rangeENSt3__14spanIKhLm72EEEEEvRKT0_: 77| 2.79k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 2.79k| const std::span s{r}; 79| 2.79k| if constexpr(statically_spanable_range) { 80| 2.79k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 2.79k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm72EEEEEmRKT_: 59| 5.58k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 5.58k| return std::span{r}.size_bytes(); 61| 5.58k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm8EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 3.72k|{ 101| 3.72k| const std::span s0{r0}; 102| | 103| 3.72k| if constexpr(statically_spanable_range) { 104| 3.72k| constexpr size_t expected_size = s0.size_bytes(); 105| 3.72k| (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.72k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm64ETkNS0_14spanable_rangeENSt3__15arrayImLm8EEEEEvRKT0_: 77| 6.67k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 6.67k| const std::span s{r}; 79| 6.67k| if constexpr(statically_spanable_range) { 80| 6.67k| 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.67k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm8EEEEEmRKT_: 59| 7.44k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 7.44k| return std::span{r}.size_bytes(); 61| 7.44k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__16vectorIhNS2_9allocatorIhEEEETpTkNS0_14spanable_rangeEJA16_mEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 558|{ 101| 558| 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| 558| } else { 107| 558| const size_t expected_size = s0.size_bytes(); 108| 558| const bool correct_size = 109| 558| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 558| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 558] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 558| } 115| 558|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm64EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 2.95k|{ 101| 2.95k| const std::span s0{r0}; 102| | 103| 2.95k| if constexpr(statically_spanable_range) { 104| 2.95k| constexpr size_t expected_size = s0.size_bytes(); 105| 2.95k| (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.95k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm9EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm9EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 843|{ 101| 843| const std::span s0{r0}; 102| | 103| 843| if constexpr(statically_spanable_range) { 104| 843| constexpr size_t expected_size = s0.size_bytes(); 105| 843| (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| 843|} _ZN5Botan6ranges24assert_exact_byte_lengthILm72ETkNS0_14spanable_rangeENSt3__15arrayImLm9EEEEEvRKT0_: 77| 3.58k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 3.58k| const std::span s{r}; 79| 3.58k| if constexpr(statically_spanable_range) { 80| 3.58k| 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.58k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm9EEEEEmRKT_: 59| 1.68k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 1.68k| return std::span{r}.size_bytes(); 61| 1.68k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm72EEETpTkNS0_14spanable_rangeEJNS3_ImLm9EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 2.74k|{ 101| 2.74k| const std::span s0{r0}; 102| | 103| 2.74k| if constexpr(statically_spanable_range) { 104| 2.74k| constexpr size_t expected_size = s0.size_bytes(); 105| 2.74k| (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.74k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm74EEETpTkNS0_14spanable_rangeEJNS3_IKhLm74EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 2.60k|{ 101| 2.60k| const std::span s0{r0}; 102| | 103| 2.60k| if constexpr(statically_spanable_range) { 104| 2.60k| constexpr size_t expected_size = s0.size_bytes(); 105| 2.60k| (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.60k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm74ETkNS0_14spanable_rangeENSt3__14spanIKhLm74EEEEEvRKT0_: 77| 2.60k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 2.60k| const std::span s{r}; 79| 2.60k| if constexpr(statically_spanable_range) { 80| 2.60k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 2.60k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm74EEEEEmRKT_: 59| 5.20k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 5.20k| return std::span{r}.size_bytes(); 61| 5.20k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__16vectorIhNS2_9allocatorIhEEEETpTkNS0_14spanable_rangeEJA18_mEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 520|{ 101| 520| 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| 520| } else { 107| 520| const size_t expected_size = s0.size_bytes(); 108| 520| const bool correct_size = 109| 520| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 520| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 520] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 520| } 115| 520|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm66EEETpTkNS0_14spanable_rangeEJNS3_IKhLm66EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 2.74k|{ 101| 2.74k| const std::span s0{r0}; 102| | 103| 2.74k| if constexpr(statically_spanable_range) { 104| 2.74k| constexpr size_t expected_size = s0.size_bytes(); 105| 2.74k| (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.74k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm66ETkNS0_14spanable_rangeENSt3__14spanIKhLm66EEEEEvRKT0_: 77| 2.74k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 2.74k| const std::span s{r}; 79| 2.74k| if constexpr(statically_spanable_range) { 80| 2.74k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 2.74k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm66EEEEEmRKT_: 59| 5.48k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 5.48k| return std::span{r}.size_bytes(); 61| 5.48k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayImLm7EEETpTkNS0_14spanable_rangeEJNS2_4spanIKhLm56EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 72|{ 101| 72| const std::span s0{r0}; 102| | 103| 72| if constexpr(statically_spanable_range) { 104| 72| constexpr size_t expected_size = s0.size_bytes(); 105| 72| (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| 72|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm56EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm7EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 36|{ 101| 36| const std::span s0{r0}; 102| | 103| 36| if constexpr(statically_spanable_range) { 104| 36| constexpr size_t expected_size = s0.size_bytes(); 105| 36| (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| 36|} _ZN5Botan6ranges24assert_exact_byte_lengthILm56ETkNS0_14spanable_rangeENSt3__15arrayImLm7EEEEEvRKT0_: 77| 36|inline constexpr void assert_exact_byte_length(const R& r) { 78| 36| const std::span s{r}; 79| 36| if constexpr(statically_spanable_range) { 80| 36| 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| 36|} _ZN5Botan21RandomNumberGenerator9randomizeENSt3__14spanIhLm18446744073709551615EEE: 86| 12.2k| void randomize(std::span output) { this->fill_bytes_with_input(output, {}); } _ZN5Botan21RandomNumberGenerator11add_entropyENSt3__14spanIKhLm18446744073709551615EEE: 121| 1| void add_entropy(std::span input) { this->accept_seed_material(input); } _ZN5Botan21RandomNumberGenerator10random_vecENSt3__14spanIhLm18446744073709551615EEE: 254| 5.23k| void random_vec(std::span v) { this->randomize(v); } _ZNK5Botan8Null_RNG9is_seededEv: 420| 6.26k| bool is_seeded() const override { return false; } _ZN5Botan21RandomNumberGeneratorC2Ev: 57| 12.5k| RandomNumberGenerator() = default; _ZN5Botan21RandomNumberGeneratorD2Ev: 52| 6.26k| virtual ~RandomNumberGenerator() = default; _ZN5Botan21RandomNumberGenerator10random_vecITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEQsr3stdE21default_initializableIT_EEES8_m: 280| 29| T random_vec(size_t bytes) { 281| 29| T result; 282| 29| random_vec(result, bytes); 283| 29| return result; 284| 29| } _ZN5Botan21RandomNumberGenerator10random_vecITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEEvRT_m: 265| 29| void random_vec(T& v, size_t bytes) { 266| 29| v.resize(bytes); 267| 29| random_vec(v); 268| 29| } _ZN5Botan21RandomNumberGenerator10random_vecITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEEEvRT_m: 265| 5.20k| void random_vec(T& v, size_t bytes) { 266| 5.20k| v.resize(bytes); 267| 5.20k| random_vec(v); 268| 5.20k| } _ZN5Botan21RandomNumberGenerator10random_vecITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEQsr3stdE21default_initializableIT_EEES8_m: 280| 5.20k| T random_vec(size_t bytes) { 281| 5.20k| T result; 282| 5.20k| random_vec(result, bytes); 283| 5.20k| return result; 284| 5.20k| } _ZN5Botan16secure_allocatorIhE8allocateEm: 95| 517k| T* allocate(std::size_t n) { return static_cast(allocate_memory(n, sizeof(T))); } _ZN5Botan16secure_allocatorIhE10deallocateEPhm: 102| 517k| void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); } _ZN5BotanneIhhEEbRKNS_16secure_allocatorIT_EERKNS1_IT0_EE: 123| 42.8k|inline bool operator!=(const secure_allocator& /*a*/, const secure_allocator& /*b*/) { 124| 42.8k| return false; 125| 42.8k|} _ZN5Botan16secure_allocatorIjE10deallocateEPjm: 102| 20.6k| void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); } _ZN5Botan16secure_allocatorImE10deallocateEPmm: 102| 132k| void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); } _ZN5Botan16secure_allocatorImE8allocateEm: 95| 132k| T* allocate(std::size_t n) { return static_cast(allocate_memory(n, sizeof(T))); } _ZN5BotanpLIhNSt3__19allocatorIhEES3_EERNS1_6vectorIT_T0_EES8_RKNS4_IS5_T1_EE: 168| 23.5k|std::vector& operator+=(std::vector& out, const std::vector& in) { 169| 23.5k| out.insert(out.end(), in.begin(), in.end()); 170| 23.5k| return out; 171| 23.5k|} _ZN5BotanpLIhNSt3__19allocatorIhEENS_16secure_allocatorIhEEEERNS1_6vectorIT_T0_EESA_RKNS6_IS7_T1_EE: 168| 1.35k|std::vector& operator+=(std::vector& out, const std::vector& in) { 169| 1.35k| out.insert(out.end(), in.begin(), in.end()); 170| 1.35k| return out; 171| 1.35k|} _ZN5BotanpLIhNS_16secure_allocatorIhEES2_EERNSt3__16vectorIT_T0_EES8_RKNS4_IS5_T1_EE: 168| 5|std::vector& operator+=(std::vector& out, const std::vector& in) { 169| 5| out.insert(out.end(), in.begin(), in.end()); 170| 5| return out; 171| 5|} _ZN5BotanpLIhNS_16secure_allocatorIhEEmEERNSt3__16vectorIT_T0_EES8_RKNS3_4pairIPKS5_T1_EE: 204| 307k|std::vector& operator+=(std::vector& out, const std::pair& in) { 205| 307k| if(in.second > 0) { ------------------ | Branch (205:7): [True: 301k, False: 6.27k] ------------------ 206| 301k| out.insert(out.end(), in.first, in.first + in.second); 207| 301k| } 208| 307k| return out; 209| 307k|} _ZN5Botan16secure_allocatorIjE8allocateEm: 95| 20.6k| T* allocate(std::size_t n) { return static_cast(allocate_memory(n, sizeof(T))); } _ZN5Botan3zapImNS_16secure_allocatorImEEEEvRNSt3__16vectorIT_T0_EE: 261| 97|void zap(std::vector& vec) { 262| 97| zeroise(vec); 263| 97| vec.clear(); 264| 97| vec.shrink_to_fit(); 265| 97|} _ZN5Botan7zeroiseImNS_16secure_allocatorImEEEEvRNSt3__16vectorIT_T0_EE: 241| 97|void zeroise(std::vector& vec) { 242| 97| for(size_t i = 0; i != vec.size(); ++i) { ------------------ | Branch (242:22): [True: 0, False: 97] ------------------ 243| 0| vec[i] = static_cast(0); 244| 0| } 245| 97|} _ZN5Botan7zeroiseIhNS_16secure_allocatorIhEEEEvRNSt3__16vectorIT_T0_EE: 241| 569|void zeroise(std::vector& vec) { 242| 96.8k| for(size_t i = 0; i != vec.size(); ++i) { ------------------ | Branch (242:22): [True: 96.3k, False: 569] ------------------ 243| 96.3k| vec[i] = static_cast(0); 244| 96.3k| } 245| 569|} _ZN5BotanpLIhNS_16secure_allocatorIhEEmEERNSt3__16vectorIT_T0_EES8_RKNS3_4pairIPS5_T1_EE: 218| 49|std::vector& operator+=(std::vector& out, const std::pair& in) { 219| 49| if(in.second > 0) { ------------------ | Branch (219:7): [True: 49, False: 0] ------------------ 220| 49| out.insert(out.end(), in.first, in.first + in.second); 221| 49| } 222| 49| return out; 223| 49|} _ZN5Botan6unlockIhEENSt3__16vectorIT_NS1_9allocatorIS3_EEEERKNS2_IS3_NS_16secure_allocatorIS3_EEEE: 155| 126|std::vector unlock(const secure_vector& in) { 156| 126| return std::vector(in.begin(), in.end()); 157| 126|} _ZN5Botan7zeroiseIhNSt3__19allocatorIhEEEEvRNS1_6vectorIT_T0_EE: 241| 281|void zeroise(std::vector& vec) { 242| 4.77k| for(size_t i = 0; i != vec.size(); ++i) { ------------------ | Branch (242:22): [True: 4.49k, False: 281] ------------------ 243| 4.49k| vec[i] = static_cast(0); 244| 4.49k| } 245| 281|} _ZN5BotanpLIhNSt3__19allocatorIhEEmEERNS1_6vectorIT_T0_EES8_RKNS1_4pairIPKS5_T1_EE: 204| 126|std::vector& operator+=(std::vector& out, const std::pair& in) { 205| 126| if(in.second > 0) { ------------------ | Branch (205:7): [True: 126, False: 0] ------------------ 206| 126| out.insert(out.end(), in.first, in.first + in.second); 207| 126| } 208| 126| return out; 209| 126|} _ZN5BotanpLIhNS_16secure_allocatorIhEEEERNSt3__16vectorIT_T0_EES8_NS3_4spanIKS5_Lm18446744073709551615EEE: 180| 77|std::vector& operator+=(std::vector& out, std::span in) { 181| 77| out.insert(out.end(), in.begin(), in.end()); 182| 77| return out; 183| 77|} _ZN5Botan12StreamCipher6cipherEPKhPhm: 61| 311| void cipher(const uint8_t in[], uint8_t out[], size_t len) { cipher_bytes(in, out, len); } _ZN5Botan12StreamCipher15write_keystreamEPhm: 79| 41| void write_keystream(uint8_t out[], size_t len) { generate_keystream(out, len); } _ZN5Botan12StreamCipher15write_keystreamENSt3__14spanIhLm18446744073709551615EEE: 88| 12.2k| void write_keystream(std::span out) { generate_keystream(out.data(), out.size()); } _ZN5Botan12StreamCipher7cipher1EPhm: 110| 41| void cipher1(uint8_t buf[], size_t len) { cipher(buf, buf, len); } _ZN5Botan12StreamCipher8encipherENSt3__14spanIhLm18446744073709551615EEE: 124| 184| void encipher(std::span inout) { cipher(inout.data(), inout.data(), inout.size()); } _ZN5Botan12StreamCipher6set_ivEPKhm: 168| 260| void set_iv(const uint8_t iv[], size_t iv_len) { set_iv_bytes(iv, iv_len); } _ZN5Botan12StreamCipher6set_ivENSt3__14spanIKhLm18446744073709551615EEE: 175| 97| void set_iv(std::span iv) { set_iv_bytes(iv.data(), iv.size()); } _ZN5Botan12StreamCipher15keystream_bytesITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_m: 98| 1| T keystream_bytes(size_t bytes) { 99| 1| T out(bytes); 100| 1| write_keystream(out); 101| 1| return out; 102| 1| } _ZNKR5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEE3getEv: 85| 19.9k| constexpr const T& get() const& { return m_value; } _ZNK5Botan6detail14Strong_AdapterINSt3__16vectorIhNS2_9allocatorIhEEEEE4dataEv: 253| 3.18k| decltype(auto) data() const noexcept(noexcept(this->get().data())) { return this->get().data(); } _ZNR5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEE3getEv: 81| 5.12k| constexpr T& get() & { return m_value; } _ZN5Botan6detail14Strong_AdapterINSt3__16vectorIhNS2_9allocatorIhEEEEE4dataEv: 251| 5.12k| decltype(auto) data() noexcept(noexcept(this->get().data())) { return this->get().data(); } _ZNK5Botan6detail29Container_Strong_Adapter_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEE4sizeEv: 182| 8.41k| size_type size() const noexcept(noexcept(this->get().size())) { return this->get().size(); } _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEED2Ev: 73| 41.1k| ~Strong_Base() = default; _ZNK5Botan6detail29Container_Strong_Adapter_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEE5emptyEvQsr8conceptsE9has_emptyIT_E: 188| 5.69k| { 189| 5.69k| return this->get().empty(); 190| 5.69k| } _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEC2ES6_: 77| 17.8k| constexpr explicit Strong_Base(T v) : m_value(std::move(v)) {} _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEC2EOS7_: 63| 10.5k| Strong_Base(Strong_Base&&) noexcept = default; _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEC2ERKS7_: 60| 2.94k| Strong_Base(const Strong_Base&) = default; _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEC2Ev: 57| 9.79k| Strong_Base() = default; _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEaSEOS7_: 71| 7.02k| Strong_Base& operator=(Strong_Base&&) noexcept = default; _ZNK5Botan6detail29Container_Strong_Adapter_BaseINSt3__15arrayIhLm56EEEE5beginEv: 154| 18| decltype(auto) begin() const noexcept(noexcept(this->get().begin())) { return this->get().begin(); } _ZNK5Botan6detail29Container_Strong_Adapter_BaseINSt3__15arrayIhLm56EEEE3endEv: 162| 18| decltype(auto) end() const noexcept(noexcept(this->get().end())) { return this->get().end(); } _ZNK5Botan6detail14Strong_AdapterINSt3__15arrayIhLm56EEEE4dataEv: 253| 40| decltype(auto) data() const noexcept(noexcept(this->get().data())) { return this->get().data(); } _ZNK5Botan6detail29Container_Strong_Adapter_BaseINSt3__15arrayIhLm56EEEE4sizeEv: 182| 40| size_type size() const noexcept(noexcept(this->get().size())) { return this->get().size(); } _ZN5Botan6detail14Strong_AdapterINSt3__15arrayIhLm56EEEE4dataEv: 251| 20| decltype(auto) data() noexcept(noexcept(this->get().data())) { return this->get().data(); } _ZNR5Botan6detail11Strong_BaseINSt3__15arrayIhLm56EEEE3getEv: 81| 56| constexpr T& get() & { return m_value; } _ZN5Botan6detail29Container_Strong_Adapter_BaseINSt3__15arrayIhLm56EEEEixIiEEDcOT_: 220| 36| decltype(auto) operator[](U&& i) noexcept(noexcept(this->get().operator[](i))) { 221| 36| return this->get()[std::forward(i)]; 222| 36| } _ZNKR5Botan6detail11Strong_BaseINSt3__15arrayIhLm56EEEE3getEv: 85| 8.21k| constexpr const T& get() const& { return m_value; } _ZNK5Botan6detail29Container_Strong_Adapter_BaseINSt3__15arrayIhLm56EEEEixImEEDcOT_: 212| 8.06k| decltype(auto) operator[](U&& i) const noexcept(noexcept(this->get().operator[](i))) { 213| 8.06k| return this->get()[std::forward(i)]; 214| 8.06k| } _ZN5Botan6detail11Strong_BaseINSt3__15arrayIhLm56EEEEC2ES4_: 77| 18| constexpr explicit Strong_Base(T v) : m_value(std::move(v)) {} _ZN5Botan6detail29Container_Strong_Adapter_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEC2INS2_11__wrap_iterIPKhEEEET_SD_: 145| 5.12k| Container_Strong_Adapter_Base(InputIt begin, InputIt end) : Container_Strong_Adapter_Base(T(begin, end)) {} _ZN5Botan6detail14Strong_AdapterINSt3__16vectorIhNS2_9allocatorIhEEEEEC2ENS2_4spanIKhLm18446744073709551615EEE: 241| 3.18k| Strong_Adapter(T(span.begin(), span.end())) {} _ZNKR5Botan6detail11Strong_BaseINSt3__15arrayIhLm4EEEE3getEv: 85| 20.8k| constexpr const T& get() const& { return m_value; } _ZNK5Botan6detail29Container_Strong_Adapter_BaseINSt3__15arrayIhLm4EEEE4sizeEv: 182| 20.8k| size_type size() const noexcept(noexcept(this->get().size())) { return this->get().size(); } _ZN5Botan6detail14Strong_AdapterINSt3__15arrayIhLm4EEEE4dataEv: 251| 20.8k| decltype(auto) data() noexcept(noexcept(this->get().data())) { return this->get().data(); } _ZNR5Botan6detail11Strong_BaseINSt3__15arrayIhLm4EEEE3getEv: 81| 104k| constexpr T& get() & { return m_value; } _ZN5Botan6detail29Container_Strong_Adapter_BaseINSt3__15arrayIhLm4EEEEixIiEEDcOT_: 220| 83.2k| decltype(auto) operator[](U&& i) noexcept(noexcept(this->get().operator[](i))) { 221| 83.2k| return this->get()[std::forward(i)]; 222| 83.2k| } _ZN5Botan10StrongSpanIKNS_6StrongINSt3__16vectorIhNS2_9allocatorIhEEEENS_3TLS27SerializedHandshakeMessage_EJEEEE4dataEv: 1053| 3.18k| decltype(auto) data() noexcept(noexcept(this->m_span.data())) { return this->m_span.data(); } _ZNK5Botan10StrongSpanIKNS_6StrongINSt3__16vectorIhNS2_9allocatorIhEEEENS_3TLS27SerializedHandshakeMessage_EJEEEE4sizeEv: 1061| 3.18k| decltype(auto) size() const noexcept(noexcept(this->m_span.size())) { return this->m_span.size(); } _ZN5Botan10StrongSpanIKNS_6StrongINSt3__16vectorIhNS2_9allocatorIhEEEENS_3TLS27SerializedHandshakeMessage_EJEEEEC2ERSA_: 999| 3.18k| StrongSpan(T& strong) : m_span(strong) {} _ZN5Botan18unwrap_strong_typeIRNSt3__16vectorIhNS_16secure_allocatorIhEEEEEEDcOT_: 119| 42.7k|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) { 120| 42.7k| if constexpr(!concepts::strong_type>) { 121| | // If the parameter type isn't a strong type, return it as is. 122| 42.7k| return std::forward(t); 123| | } else { 124| | // Unwrap the strong type and return the underlying value. 125| | return std::forward(t).get(); 126| | } 127| 42.7k|} _ZN5Botan18unwrap_strong_typeIRNSt3__16vectorIhNS1_9allocatorIhEEEEEEDcOT_: 119| 138k|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) { 120| 138k| if constexpr(!concepts::strong_type>) { 121| | // If the parameter type isn't a strong type, return it as is. 122| 138k| return std::forward(t); 123| | } else { 124| | // Unwrap the strong type and return the underlying value. 125| | return std::forward(t).get(); 126| | } 127| 138k|} _ZN5Botan18unwrap_strong_typeIRmEEDcOT_: 119| 449k|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) { 120| 449k| if constexpr(!concepts::strong_type>) { 121| | // If the parameter type isn't a strong type, return it as is. 122| 449k| return std::forward(t); 123| | } else { 124| | // Unwrap the strong type and return the underlying value. 125| | return std::forward(t).get(); 126| | } 127| 449k|} _ZN5Botan16wrap_strong_typeImRmQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_: 144| 570k|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 145| 570k| if constexpr(std::same_as, T>) { 146| | // Noop, if the parameter type already is the desired return type. 147| 570k| 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| 570k|} _ZN5Botan16wrap_strong_typeItRtQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_: 144| 209k|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 145| 209k| if constexpr(std::same_as, T>) { 146| | // Noop, if the parameter type already is the desired return type. 147| 209k| 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| 209k|} _ZN5Botan16wrap_strong_typeIjRjQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_: 144| 636|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 145| 636| if constexpr(std::same_as, T>) { 146| | // Noop, if the parameter type already is the desired return type. 147| 636| 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| 636|} _ZN5Botan16wrap_strong_typeItRKtQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS3_Esr3stdE18constructible_fromINS3_12wrapped_typeES4_EEEDcOS4_: 144| 2.30k|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 145| 2.30k| if constexpr(std::same_as, T>) { 146| | // Noop, if the parameter type already is the desired return type. 147| 2.30k| 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| 2.30k|} _ZN5Botan18unwrap_strong_typeIRtEEDcOT_: 119| 4.63k|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) { 120| 4.63k| if constexpr(!concepts::strong_type>) { 121| | // If the parameter type isn't a strong type, return it as is. 122| 4.63k| return std::forward(t); 123| | } else { 124| | // Unwrap the strong type and return the underlying value. 125| | return std::forward(t).get(); 126| | } 127| 4.63k|} _ZN5Botan18unwrap_strong_typeIRjEEDcOT_: 119| 545k|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) { 120| 545k| if constexpr(!concepts::strong_type>) { 121| | // If the parameter type isn't a strong type, return it as is. 122| 545k| return std::forward(t); 123| | } else { 124| | // Unwrap the strong type and return the underlying value. 125| | return std::forward(t).get(); 126| | } 127| 545k|} _ZN5Botan18unwrap_strong_typeIRhEEDcOT_: 119| 2.30k|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) { 120| 2.30k| if constexpr(!concepts::strong_type>) { 121| | // If the parameter type isn't a strong type, return it as is. 122| 2.30k| return std::forward(t); 123| | } else { 124| | // Unwrap the strong type and return the underlying value. 125| | return std::forward(t).get(); 126| | } 127| 2.30k|} _ZN5Botan16wrap_strong_typeIhRhQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_: 144| 956k|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 145| 956k| if constexpr(std::same_as, T>) { 146| | // Noop, if the parameter type already is the desired return type. 147| 956k| 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| 956k|} _ZN5Botan24Key_Length_SpecificationC2Em: 28| 278| explicit Key_Length_Specification(size_t keylen) : m_min_keylen(keylen), m_max_keylen(keylen), m_keylen_mod(1) {} _ZN5Botan24Key_Length_SpecificationC2Emmm: 37| 3.60k| m_min_keylen(min_k), m_max_keylen(max_k > 0 ? max_k : min_k), m_keylen_mod(k_mod) {} ------------------ | Branch (37:47): [True: 2.96k, False: 643] ------------------ _ZNK5Botan24Key_Length_Specification15valid_keylengthEm: 44| 3.88k| bool valid_keylength(size_t length) const { 45| 3.88k| return ((length >= m_min_keylen) && (length <= m_max_keylen) && (length % m_keylen_mod == 0)); ------------------ | Branch (45:18): [True: 3.88k, False: 0] | Branch (45:46): [True: 3.88k, False: 0] | Branch (45:74): [True: 3.88k, False: 0] ------------------ 46| 3.88k| } _ZNK5Botan18SymmetricAlgorithm15valid_keylengthEm: 143| 3.88k| bool valid_keylength(size_t length) const { return key_spec().valid_keylength(length); } _ZN5Botan18SymmetricAlgorithm7set_keyEPKhm: 162| 41| void set_key(const uint8_t key[], size_t length) { set_key(std::span{key, length}); } _ZNK5Botan18SymmetricAlgorithm23assert_key_material_setEv: 180| 55.3k| void assert_key_material_set() const { assert_key_material_set(has_keying_material()); } _ZNK5Botan18SymmetricAlgorithm23assert_key_material_setEb: 186| 55.3k| void assert_key_material_set(bool predicate) const { 187| 55.3k| if(!predicate) { ------------------ | Branch (187:13): [True: 0, False: 55.3k] ------------------ 188| 0| throw_key_not_set_error(); 189| 0| } 190| 55.3k| } _ZN5Botan18SymmetricAlgorithmD2Ev: 90| 2.43k| virtual ~SymmetricAlgorithm() = default; _ZN5Botan18SymmetricAlgorithmC2Ev: 88| 2.43k| SymmetricAlgorithm() = default; _ZNK5Botan11OctetString6lengthEv: 28| 30| size_t length() const { return m_data.size(); } _ZNK5Botan11OctetString5emptyEv: 40| 1.95k| bool empty() const { return m_data.empty(); } _ZNK5Botan11OctetString7bits_ofEv: 46| 3.64k| secure_vector bits_of() const { return m_data; } _ZN5Botan11OctetStringC2ENSt3__16vectorIhNS_16secure_allocatorIhEEEE: 112| 4.12k| explicit OctetString(secure_vector in) : m_data(std::move(in)) {} _ZNK5Botan3TLS5Alert8is_validEv: 78| 4.41k| bool is_valid() const { return (m_type_code != AlertType::None); } _ZNK5Botan3TLS5Alert8is_fatalEv: 93| 10.8k| bool is_fatal() const { return m_fatal; } _ZNK5Botan3TLS5Alert4typeEv: 100| 22.0k| Type type() const { return m_type_code; } _ZN5Botan3TLS5AlertC2ENS0_9AlertTypeEb: 126| 4.41k| m_fatal(fatal), m_type_code(type_code) {} _ZN5Botan3TLS12Group_ParamsC2Ev: 145| 93| constexpr Group_Params() : m_code(Group_Params_Code::NONE) {} _ZN5Botan3TLS12Group_ParamsC2ENS0_17Group_Params_CodeE: 148| 3.10k| constexpr Group_Params(Group_Params_Code code) : m_code(code) {} _ZN5Botan3TLS12Group_ParamsC2Et: 151| 27.2k| constexpr Group_Params(uint16_t code) : m_code(static_cast(code)) {} _ZNK5Botan3TLS12Group_ParamseqENS0_17Group_Params_CodeE: 158| 9.93k| constexpr bool operator==(Group_Params_Code code) const { return m_code == code; } _ZNK5Botan3TLS12Group_ParamseqES1_: 160| 48.0k| constexpr bool operator==(Group_Params other) const { return m_code == other.m_code; } _ZNK5Botan3TLS12Group_Params9wire_codeEv: 166| 69.5k| constexpr uint16_t wire_code() const { return static_cast(m_code); } _ZNK5Botan3TLS12Group_Params9is_x25519Ev: 173| 22.9k| constexpr bool is_x25519() const { return m_code == Group_Params_Code::X25519; } _ZNK5Botan3TLS12Group_Params7is_x448Ev: 175| 22.8k| constexpr bool is_x448() const { return m_code == Group_Params_Code::X448; } _ZNK5Botan3TLS12Group_Params19is_ecdh_named_curveEv: 177| 29.6k| constexpr bool is_ecdh_named_curve() const { 178| 29.6k| return m_code == Group_Params_Code::SECP256R1 || m_code == Group_Params_Code::SECP384R1 || ------------------ | Branch (178:17): [True: 2.35k, False: 27.2k] | Branch (178:59): [True: 1.81k, False: 25.4k] ------------------ 179| 25.4k| m_code == Group_Params_Code::SECP521R1 || m_code == Group_Params_Code::BRAINPOOL256R1 || ------------------ | Branch (179:17): [True: 1.59k, False: 23.8k] | Branch (179:59): [True: 1.83k, False: 22.0k] ------------------ 180| 22.0k| m_code == Group_Params_Code::BRAINPOOL384R1 || m_code == Group_Params_Code::BRAINPOOL512R1 || ------------------ | Branch (180:17): [True: 1.48k, False: 20.5k] | Branch (180:64): [True: 1.59k, False: 18.9k] ------------------ 181| 18.9k| m_code == Group_Params_Code::BRAINPOOL256R1TLS13 || m_code == Group_Params_Code::BRAINPOOL384R1TLS13 || ------------------ | Branch (181:17): [True: 859, False: 18.0k] | Branch (181:69): [True: 248, False: 17.8k] ------------------ 182| 17.8k| m_code == Group_Params_Code::BRAINPOOL512R1TLS13; ------------------ | Branch (182:17): [True: 134, False: 17.7k] ------------------ 183| 29.6k| } _ZNK5Botan3TLS12Group_Params17is_in_ffdhe_rangeEv: 185| 23.9k| constexpr bool is_in_ffdhe_range() const { 186| | // See RFC 7919 187| 23.9k| return wire_code() >= 256 && wire_code() < 512; ------------------ | Branch (187:17): [True: 15.8k, False: 8.11k] | Branch (187:39): [True: 1.00k, False: 14.8k] ------------------ 188| 23.9k| } _ZNK5Botan3TLS12Group_Params17is_dh_named_groupEv: 190| 4.34k| constexpr bool is_dh_named_group() const { 191| 4.34k| return m_code == Group_Params_Code::FFDHE_2048 || m_code == Group_Params_Code::FFDHE_3072 || ------------------ | Branch (191:17): [True: 0, False: 4.34k] | Branch (191:60): [True: 0, False: 4.34k] ------------------ 192| 4.34k| m_code == Group_Params_Code::FFDHE_4096 || m_code == Group_Params_Code::FFDHE_6144 || ------------------ | Branch (192:17): [True: 0, False: 4.34k] | Branch (192:60): [True: 0, False: 4.34k] ------------------ 193| 4.34k| m_code == Group_Params_Code::FFDHE_8192; ------------------ | Branch (193:17): [True: 0, False: 4.34k] ------------------ 194| 4.34k| } _ZNK5Botan3TLS12Group_Params14is_pure_ml_kemEv: 196| 5.75k| constexpr bool is_pure_ml_kem() const { 197| 5.75k| return m_code == Group_Params_Code::ML_KEM_512 || m_code == Group_Params_Code::ML_KEM_768 || ------------------ | Branch (197:17): [True: 0, False: 5.75k] | Branch (197:60): [True: 0, False: 5.75k] ------------------ 198| 5.75k| m_code == Group_Params_Code::ML_KEM_1024; ------------------ | Branch (198:17): [True: 0, False: 5.75k] ------------------ 199| 5.75k| } _ZNK5Botan3TLS12Group_Params16is_pure_frodokemEv: 201| 5.75k| constexpr bool is_pure_frodokem() const { 202| 5.75k| return m_code == Group_Params_Code::eFRODOKEM_640_SHAKE_OQS || ------------------ | Branch (202:17): [True: 0, False: 5.75k] ------------------ 203| 5.75k| m_code == Group_Params_Code::eFRODOKEM_976_SHAKE_OQS || ------------------ | Branch (203:17): [True: 0, False: 5.75k] ------------------ 204| 5.75k| m_code == Group_Params_Code::eFRODOKEM_1344_SHAKE_OQS || ------------------ | Branch (204:17): [True: 0, False: 5.75k] ------------------ 205| 5.75k| m_code == Group_Params_Code::eFRODOKEM_640_AES_OQS || ------------------ | Branch (205:17): [True: 0, False: 5.75k] ------------------ 206| 5.75k| m_code == Group_Params_Code::eFRODOKEM_976_AES_OQS || ------------------ | Branch (206:17): [True: 0, False: 5.75k] ------------------ 207| 5.75k| m_code == Group_Params_Code::eFRODOKEM_1344_AES_OQS; ------------------ | Branch (207:17): [True: 0, False: 5.75k] ------------------ 208| 5.75k| } _ZNK5Botan3TLS12Group_Params17is_pure_ecc_groupEv: 210| 22.8k| constexpr bool is_pure_ecc_group() const { return is_x25519() || is_x448() || is_ecdh_named_curve(); } ------------------ | Branch (210:57): [True: 28, False: 22.8k] | Branch (210:72): [True: 40, False: 22.8k] | Branch (210:85): [True: 5.17k, False: 17.6k] ------------------ _ZNK5Botan3TLS12Group_Params15is_post_quantumEv: 212| 5.75k| constexpr bool is_post_quantum() const { 213| 5.75k| BOTAN_DIAGNOSTIC_PUSH 214| 5.75k| BOTAN_DIAGNOSTIC_IGNORE_DEPRECATED_DECLARATIONS 215| | 216| 5.75k| return is_pure_ml_kem() || is_pure_frodokem() || is_pqc_hybrid(); ------------------ | Branch (216:17): [True: 0, False: 5.75k] | Branch (216:37): [True: 0, False: 5.75k] | Branch (216:59): [True: 0, False: 5.75k] ------------------ 217| | 218| 5.75k| BOTAN_DIAGNOSTIC_POP 219| 5.75k| } _ZNK5Botan3TLS12Group_Params20is_pqc_hybrid_ml_kemEv: 221| 5.75k| constexpr bool is_pqc_hybrid_ml_kem() const { 222| 5.75k| return m_code == Group_Params_Code::HYBRID_SECP256R1_ML_KEM_768 || ------------------ | Branch (222:17): [True: 0, False: 5.75k] ------------------ 223| 5.75k| m_code == Group_Params_Code::HYBRID_SECP384R1_ML_KEM_1024 || ------------------ | Branch (223:17): [True: 0, False: 5.75k] ------------------ 224| 5.75k| m_code == Group_Params_Code::HYBRID_X25519_ML_KEM_768; ------------------ | Branch (224:17): [True: 0, False: 5.75k] ------------------ 225| 5.75k| } _ZNK5Botan3TLS12Group_Params22is_pqc_hybrid_frodokemEv: 227| 5.75k| constexpr bool is_pqc_hybrid_frodokem() const { 228| 5.75k| return m_code == Group_Params_Code::HYBRID_X25519_eFRODOKEM_640_SHAKE_OQS || ------------------ | Branch (228:17): [True: 0, False: 5.75k] ------------------ 229| 5.75k| m_code == Group_Params_Code::HYBRID_X25519_eFRODOKEM_640_AES_OQS || ------------------ | Branch (229:17): [True: 0, False: 5.75k] ------------------ 230| 5.75k| m_code == Group_Params_Code::HYBRID_X448_eFRODOKEM_976_SHAKE_OQS || ------------------ | Branch (230:17): [True: 0, False: 5.75k] ------------------ 231| 5.75k| m_code == Group_Params_Code::HYBRID_X448_eFRODOKEM_976_AES_OQS || ------------------ | Branch (231:17): [True: 0, False: 5.75k] ------------------ 232| 5.75k| m_code == Group_Params_Code::HYBRID_SECP256R1_eFRODOKEM_640_SHAKE_OQS || ------------------ | Branch (232:17): [True: 0, False: 5.75k] ------------------ 233| 5.75k| m_code == Group_Params_Code::HYBRID_SECP256R1_eFRODOKEM_640_AES_OQS || ------------------ | Branch (233:17): [True: 0, False: 5.75k] ------------------ 234| 5.75k| m_code == Group_Params_Code::HYBRID_SECP384R1_eFRODOKEM_976_SHAKE_OQS || ------------------ | Branch (234:17): [True: 0, False: 5.75k] ------------------ 235| 5.75k| m_code == Group_Params_Code::HYBRID_SECP384R1_eFRODOKEM_976_AES_OQS || ------------------ | Branch (235:17): [True: 0, False: 5.75k] ------------------ 236| 5.75k| m_code == Group_Params_Code::HYBRID_SECP521R1_eFRODOKEM_1344_SHAKE_OQS || ------------------ | Branch (236:17): [True: 0, False: 5.75k] ------------------ 237| 5.75k| m_code == Group_Params_Code::HYBRID_SECP521R1_eFRODOKEM_1344_AES_OQS; ------------------ | Branch (237:17): [True: 0, False: 5.75k] ------------------ 238| 5.75k| } _ZNK5Botan3TLS12Group_Params13is_pqc_hybridEv: 240| 5.75k| constexpr bool is_pqc_hybrid() const { return is_pqc_hybrid_ml_kem() || is_pqc_hybrid_frodokem(); } ------------------ | Branch (240:53): [True: 0, False: 5.75k] | Branch (240:79): [True: 0, False: 5.75k] ------------------ _ZN5Botan3TLS19key_exchange_is_pskENS0_8Kex_AlgoE: 284| 1.97k|inline bool key_exchange_is_psk(Kex_Algo m) { 285| 1.97k| return (m == Kex_Algo::PSK || m == Kex_Algo::ECDHE_PSK || m == Kex_Algo::DHE_PSK); ------------------ | Branch (285:12): [True: 34, False: 1.93k] | Branch (285:34): [True: 1.93k, False: 0] | Branch (285:62): [True: 0, False: 0] ------------------ 286| 1.97k|} _ZN5Botan3TLS9CallbacksD2Ev: 60| 6.26k| virtual ~Callbacks() = default; _ZN5Botan3TLS9Callbacks21tls_session_activatedEv: 155| 63| virtual void tls_session_activated() {} _ZN5Botan3TLS9Callbacks26tls_peer_closed_connectionEv: 177| 270| virtual bool tls_peer_closed_connection() { return true; } _ZN5Botan3TLS7Channel13received_dataENSt3__14spanIKhLm18446744073709551615EEE: 59| 6.26k| size_t received_data(std::span data) { return this->from_peer(data); } _ZN5Botan3TLS7ChannelC2Ev: 48| 6.26k| Channel() = default; _ZN5Botan3TLS7ChannelD2Ev: 40| 6.26k| virtual ~Channel() = default; _ZNK5Botan3TLS11Ciphersuite5validEv: 147| 289k| bool valid() const { return m_usable; } _ZNK5Botan3TLS11Ciphersuite16ciphersuite_codeEv: 62| 575k| uint16_t ciphersuite_code() const { return m_ciphersuite_code; } _ZNK5Botan3TLS11Ciphersuite8kex_algoEv: 108| 63| std::string kex_algo() const { return kex_method_to_string(kex_method()); } _ZNK5Botan3TLS11Ciphersuite10kex_methodEv: 110| 21.6k| Kex_Algo kex_method() const { return m_kex_algo; } _ZNK5Botan3TLS11Ciphersuite8sig_algoEv: 115| 289| std::string sig_algo() const { return auth_method_to_string(auth_method()); } _ZNK5Botan3TLS11Ciphersuite11auth_methodEv: 117| 12.1k| Auth_Method auth_method() const { return m_auth_method; } _ZNK5Botan3TLS11Ciphersuite11cipher_algoEv: 122| 2.03k| std::string cipher_algo() const { return m_cipher_algo; } _ZNK5Botan3TLS11Ciphersuite8mac_algoEv: 127| 2.71k| std::string mac_algo() const { return m_mac_algo; } _ZNK5Botan3TLS11Ciphersuite8prf_algoEv: 129| 2.76k| std::string prf_algo() const { return kdf_algo_to_string(m_prf_algo); } _ZNK5Botan3TLS11Ciphersuite13cipher_keylenEv: 134| 1.33k| size_t cipher_keylen() const { return m_cipher_keylen; } _ZNK5Botan3TLS11Ciphersuite12nonce_formatEv: 140| 320| Nonce_Format nonce_format() const { return m_nonce_format; } _ZNK5Botan3TLS11Ciphersuite10mac_keylenEv: 142| 1.33k| size_t mac_keylen() const { return m_mac_keylen; } _ZNK5Botan3TLS11CiphersuiteltEt: 153| 56.1k| bool operator<(const uint16_t c) const { return ciphersuite_code() < c; } _ZN5Botan3TLS11CiphersuiteC2EtPKcNS0_11Auth_MethodENS0_8Kex_AlgoES3_mS3_mNS0_8KDF_AlgoENS0_12Nonce_FormatE: 168| 102| m_ciphersuite_code(ciphersuite_code), 169| 102| m_iana_id(iana_id), 170| 102| m_auth_method(auth_method), 171| 102| m_kex_algo(kex_algo), 172| 102| m_prf_algo(prf_algo), 173| 102| m_nonce_format(nonce_format), 174| 102| m_cipher_algo(cipher_algo), 175| 102| m_mac_algo(mac_algo), 176| 102| m_cipher_keylen(cipher_keylen), 177| 102| m_mac_keylen(mac_keylen), 178| 102| m_usable(is_known_usable(ciphersuite_code)) {} _ZN5Botan3TLS13TLS_ExceptionC2ENS0_9AlertTypeENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE: 24| 2.40k| Exception(err_msg), m_alert_type(type) {} _ZNK5Botan3TLS13TLS_Exception4typeEv: 21| 2.40k| Alert::Type type() const { return m_alert_type; } _ZN5Botan3TLS18Unexpected_MessageC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 39| 305| explicit Unexpected_Message(std::string_view err) : TLS_Exception(AlertType::UnexpectedMessage, err) {} _ZNK5Botan3TLS9Extension14is_implementedEv: 113| 53| virtual bool is_implemented() const { return true; } _ZN5Botan3TLS21Server_Name_Indicator11static_typeEv: 123| 7.48k| static Extension_Code static_type() { return Extension_Code::ServerNameIndication; } _ZNK5Botan3TLS21Server_Name_Indicator4typeEv: 125| 74| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS21Server_Name_Indicator9host_nameEv: 140| 9| std::string host_name() const { return m_sni_host_name; } _ZNK5Botan3TLS21Server_Name_Indicator5emptyEv: 144| 25| bool empty() const override { return false; } _ZN5Botan3TLS39Application_Layer_Protocol_Notification11static_typeEv: 157| 2.96k| static Extension_Code static_type() { return Extension_Code::ApplicationLayerProtocolNegotiation; } _ZNK5Botan3TLS39Application_Layer_Protocol_Notification4typeEv: 159| 113| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS39Application_Layer_Protocol_Notification9protocolsEv: 161| 31| const std::vector& protocols() const { return m_protocols; } _ZNK5Botan3TLS39Application_Layer_Protocol_Notification5emptyEv: 179| 35| bool empty() const override { return m_protocols.empty(); } _ZNK5Botan3TLS21Certificate_Type_Base5emptyEv: 211| 34| bool empty() const override { 212| | // RFC 7250 4.1 213| | // If the client has no remaining certificate types to send in the 214| | // client hello, other than the default X.509 type, it MUST omit the 215| | // entire client[/server]_certificate_type extension [...]. 216| 34| return m_from == Connection_Side::Client && m_certificate_types.size() == 1 && ------------------ | Branch (216:17): [True: 23, False: 11] | Branch (216:54): [True: 3, False: 20] ------------------ 217| 3| m_certificate_types.front() == Certificate_Type::X509; ------------------ | Branch (217:17): [True: 0, False: 3] ------------------ 218| 34| } _ZN5Botan3TLS23Client_Certificate_Type11static_typeEv: 234| 15| static Extension_Code static_type() { return Extension_Code::ClientCertificateType; } _ZNK5Botan3TLS23Client_Certificate_Type4typeEv: 236| 15| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS23Server_Certificate_Type11static_typeEv: 248| 57| static Extension_Code static_type() { return Extension_Code::ServerCertificateType; } _ZNK5Botan3TLS23Server_Certificate_Type4typeEv: 250| 57| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS16Supported_Groups11static_typeEv: 258| 15.9k| static Extension_Code static_type() { return Extension_Code::SupportedGroups; } _ZNK5Botan3TLS16Supported_Groups4typeEv: 260| 5.12k| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS16Supported_Groups5emptyEv: 276| 2.48k| bool empty() const override { return m_groups.empty(); } _ZN5Botan3TLS20Signature_Algorithms11static_typeEv: 287| 5.89k| static Extension_Code static_type() { return Extension_Code::SignatureAlgorithms; } _ZNK5Botan3TLS20Signature_Algorithms4typeEv: 289| 305| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS20Signature_Algorithms17supported_schemesEv: 291| 295| const std::vector& supported_schemes() const { return m_schemes; } _ZNK5Botan3TLS20Signature_Algorithms5emptyEv: 295| 10| bool empty() const override { return m_schemes.empty(); } _ZN5Botan3TLS25Signature_Algorithms_Cert11static_typeEv: 320| 2.80k| static Extension_Code static_type() { return Extension_Code::CertSignatureAlgorithms; } _ZNK5Botan3TLS25Signature_Algorithms_Cert4typeEv: 322| 15| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS25Signature_Algorithms_Cert17supported_schemesEv: 324| 3| const std::vector& supported_schemes() const { return m_schemes; } _ZNK5Botan3TLS25Signature_Algorithms_Cert5emptyEv: 328| 4| bool empty() const override { return m_schemes.empty(); } _ZN5Botan3TLS24SRTP_Protection_Profiles11static_typeEv: 343| 81| static Extension_Code static_type() { return Extension_Code::UseSrtp; } _ZNK5Botan3TLS24SRTP_Protection_Profiles4typeEv: 345| 18| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS24SRTP_Protection_Profiles5emptyEv: 351| 13| bool empty() const override { return m_pp.empty(); } _ZN5Botan3TLS26Certificate_Status_Request11static_typeEv: 370| 2.96k| static Extension_Code static_type() { return Extension_Code::CertificateStatusRequest; } _ZNK5Botan3TLS26Certificate_Status_Request4typeEv: 372| 354| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS26Certificate_Status_Request5emptyEv: 376| 205| bool empty() const override { return false; } _ZN5Botan3TLS18Supported_Versions11static_typeEv: 408| 8.87k| static Extension_Code static_type() { return Extension_Code::SupportedVersions; } _ZNK5Botan3TLS18Supported_Versions4typeEv: 410| 103| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS18Supported_Versions5emptyEv: 414| 3| bool empty() const override { return m_versions.empty(); } _ZNK5Botan3TLS18Supported_Versions8versionsEv: 424| 28| const std::vector& versions() const { return m_versions; } _ZN5Botan3TLS17Record_Size_Limit11static_typeEv: 439| 28| static Extension_Code static_type() { return Extension_Code::RecordSizeLimit; } _ZNK5Botan3TLS17Record_Size_Limit4typeEv: 441| 28| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS17Record_Size_Limit5emptyEv: 451| 19| bool empty() const override { return m_limit == 0; } _ZNK5Botan3TLS17Unknown_Extension5emptyEv: 468| 12.6k| bool empty() const override { return false; } _ZNK5Botan3TLS17Unknown_Extension4typeEv: 470| 27.5k| Extension_Code type() const override { return m_type; } _ZNK5Botan3TLS17Unknown_Extension14is_implementedEv: 472| 431| bool is_implemented() const override { return false; } _ZN5Botan3TLS10Extensions3addEPNS0_9ExtensionE: 504| 3.22k| void add(Extension* extn) { add(std::unique_ptr(extn)); } _ZNK5Botan3TLS10Extensions42contains_implemented_extensions_other_thanERKNSt3__13setINS0_14Extension_CodeENS2_4lessIS4_EENS2_9allocatorIS4_EEEE: 525| 226| bool contains_implemented_extensions_other_than(const std::set& allowed_extensions) const { 526| 226| return contains_other_than(allowed_extensions, true); 527| 226| } _ZNK5Botan3TLS10Extensions3getINS0_9Key_ShareEEEPT_v: 487| 1| T* get() const { 488| 1| return dynamic_cast(get(T::static_type())); 489| 1| } _ZN5Botan3TLS10ExtensionsC2Ev: 557| 10.5k| Extensions() = default; _ZNK5Botan3TLS10Extensions3hasINS0_18Supported_VersionsEEEbv: 492| 5.76k| bool has() const { 493| 5.76k| return get() != nullptr; 494| 5.76k| } _ZNK5Botan3TLS10Extensions3getINS0_18Supported_VersionsEEEPT_v: 487| 8.77k| T* get() const { 488| 8.77k| return dynamic_cast(get(T::static_type())); 489| 8.77k| } _ZNK5Botan3TLS10Extensions3getINS0_20Signature_AlgorithmsEEEPT_v: 487| 5.58k| T* get() const { 488| 5.58k| return dynamic_cast(get(T::static_type())); 489| 5.58k| } _ZNK5Botan3TLS10Extensions3getINS0_25Signature_Algorithms_CertEEEPT_v: 487| 2.79k| T* get() const { 488| 2.79k| return dynamic_cast(get(T::static_type())); 489| 2.79k| } _ZNK5Botan3TLS10Extensions3getINS0_16Supported_GroupsEEEPT_v: 487| 10.8k| T* get() const { 488| 10.8k| return dynamic_cast(get(T::static_type())); 489| 10.8k| } _ZNK5Botan3TLS10Extensions3getINS0_21Server_Name_IndicatorEEEPT_v: 487| 7.41k| T* get() const { 488| 7.41k| return dynamic_cast(get(T::static_type())); 489| 7.41k| } _ZNK5Botan3TLS10Extensions3hasINS0_39Application_Layer_Protocol_NotificationEEEbv: 492| 2.81k| bool has() const { 493| 2.81k| return get() != nullptr; 494| 2.81k| } _ZNK5Botan3TLS10Extensions3hasINS0_20Signature_AlgorithmsEEEbv: 492| 2| bool has() const { 493| 2| return get() != nullptr; 494| 2| } _ZNK5Botan3TLS10Extensions3getINS0_39Application_Layer_Protocol_NotificationEEEPT_v: 487| 2.84k| T* get() const { 488| 2.84k| return dynamic_cast(get(T::static_type())); 489| 2.84k| } _ZNK5Botan3TLS10Extensions3getINS0_24SRTP_Protection_ProfilesEEEPT_v: 487| 63| T* get() const { 488| 63| return dynamic_cast(get(T::static_type())); 489| 63| } _ZNK5Botan3TLS10Extensions3getINS0_26Certificate_Status_RequestEEEPT_v: 487| 2.60k| T* get() const { 488| 2.60k| return dynamic_cast(get(T::static_type())); 489| 2.60k| } _ZN5Botan3TLS9ExtensionD2Ev: 115| 44.0k| virtual ~Extension() = default; _ZNK5Botan3TLS10Extensions3hasINS0_16Supported_GroupsEEEbv: 492| 4| bool has() const { 493| 4| return get() != nullptr; 494| 4| } _ZNK5Botan3TLS10Extensions3hasINS0_9Key_ShareEEEbv: 492| 1| bool has() const { 493| 1| return get() != nullptr; 494| 1| } _ZNK5Botan3TLS10Extensions3hasINS0_3PSKEEEbv: 492| 6| bool has() const { 493| 6| return get() != nullptr; 494| 6| } _ZNK5Botan3TLS10Extensions3getINS0_3PSKEEEPT_v: 487| 6| T* get() const { 488| 6| return dynamic_cast(get(T::static_type())); 489| 6| } _ZN5Botan3TLS10ExtensionsC2EOS1_: 560| 1.03k| Extensions(Extensions&&) = default; _ZNK5Botan3TLS10Extensions3hasINS0_26Certificate_Status_RequestEEEbv: 492| 2.60k| bool has() const { 493| 2.60k| return get() != nullptr; 494| 2.60k| } _ZNK5Botan3TLS10Extensions3getINS0_23Supported_Point_FormatsEEEPT_v: 487| 2.42k| T* get() const { 488| 2.42k| return dynamic_cast(get(T::static_type())); 489| 2.42k| } _ZNK5Botan3TLS10Extensions3hasINS0_23Renegotiation_ExtensionEEEbv: 492| 8.19k| bool has() const { 493| 8.19k| return get() != nullptr; 494| 8.19k| } _ZNK5Botan3TLS10Extensions3getINS0_23Renegotiation_ExtensionEEEPT_v: 487| 8.81k| T* get() const { 488| 8.81k| return dynamic_cast(get(T::static_type())); 489| 8.81k| } _ZNK5Botan3TLS10Extensions3hasINS0_24Session_Ticket_ExtensionEEEbv: 492| 2.79k| bool has() const { 493| 2.79k| return get() != nullptr; 494| 2.79k| } _ZNK5Botan3TLS10Extensions3getINS0_24Session_Ticket_ExtensionEEEPT_v: 487| 5.58k| T* get() const { 488| 5.58k| return dynamic_cast(get(T::static_type())); 489| 5.58k| } _ZNK5Botan3TLS10Extensions3hasINS0_22Extended_Master_SecretEEEbv: 492| 6.81k| bool has() const { 493| 6.81k| return get() != nullptr; 494| 6.81k| } _ZNK5Botan3TLS10Extensions3getINS0_22Extended_Master_SecretEEEPT_v: 487| 6.81k| T* get() const { 488| 6.81k| return dynamic_cast(get(T::static_type())); 489| 6.81k| } _ZNK5Botan3TLS10Extensions3hasINS0_16Encrypt_then_MACEEEbv: 492| 1.99k| bool has() const { 493| 1.99k| return get() != nullptr; 494| 1.99k| } _ZNK5Botan3TLS10Extensions3getINS0_16Encrypt_then_MACEEEPT_v: 487| 1.99k| T* get() const { 488| 1.99k| return dynamic_cast(get(T::static_type())); 489| 1.99k| } _ZN5Botan3TLS23Renegotiation_Extension11static_typeEv: 31| 9.23k| static Extension_Code static_type() { return Extension_Code::SafeRenegotiation; } _ZNK5Botan3TLS23Renegotiation_Extension4typeEv: 33| 418| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS23Renegotiation_ExtensionC2ENSt3__16vectorIhNS2_9allocatorIhEEEE: 37| 175| explicit Renegotiation_Extension(std::vector bits) : m_reneg_data(std::move(bits)) {} _ZNK5Botan3TLS23Renegotiation_Extension18renegotiation_infoEv: 41| 399| const std::vector& renegotiation_info() const { return m_reneg_data; } _ZNK5Botan3TLS23Renegotiation_Extension5emptyEv: 45| 281| bool empty() const override { return false; } // always send this _ZN5Botan3TLS24Session_Ticket_Extension11static_typeEv: 56| 5.72k| static Extension_Code static_type() { return Extension_Code::SessionTicket; } _ZNK5Botan3TLS24Session_Ticket_Extension4typeEv: 58| 134| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS24Session_Ticket_Extension8contentsEv: 63| 50| const Session_Ticket& contents() const { return m_ticket; } _ZNK5Botan3TLS24Session_Ticket_Extension5emptyEv: 82| 43| bool empty() const override { return false; } _ZN5Botan3TLS23Supported_Point_Formats11static_typeEv: 99| 2.58k| static Extension_Code static_type() { return Extension_Code::EcPointFormats; } _ZNK5Botan3TLS23Supported_Point_Formats4typeEv: 101| 162| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS23Supported_Point_FormatsC2Eb: 105| 48| explicit Supported_Point_Formats(bool prefer_compressed) : m_prefers_compressed(prefer_compressed) {} _ZNK5Botan3TLS23Supported_Point_Formats5emptyEv: 109| 104| bool empty() const override { return false; } _ZNK5Botan3TLS23Supported_Point_Formats18prefers_compressedEv: 111| 48| bool prefers_compressed() const { return m_prefers_compressed; } _ZN5Botan3TLS22Extended_Master_Secret11static_typeEv: 122| 15.0k| static Extension_Code static_type() { return Extension_Code::ExtendedMasterSecret; } _ZNK5Botan3TLS22Extended_Master_Secret4typeEv: 124| 8.23k| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS22Extended_Master_Secret5emptyEv: 128| 5.06k| bool empty() const override { return false; } _ZN5Botan3TLS16Encrypt_then_MAC11static_typeEv: 140| 2.21k| static Extension_Code static_type() { return Extension_Code::EncryptThenMac; } _ZNK5Botan3TLS16Encrypt_then_MAC4typeEv: 142| 223| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS16Encrypt_then_MAC5emptyEv: 146| 104| bool empty() const override { return false; } _ZN5Botan3TLS22Extended_Master_SecretC2Ev: 130| 2.60k| Extended_Master_Secret() = default; _ZN5Botan3TLS16Encrypt_then_MACC2Ev: 148| 51| Encrypt_then_MAC() = default; _ZN5Botan3TLS23Renegotiation_ExtensionC2Ev: 35| 223| Renegotiation_Extension() = default; _ZN5Botan3TLS9Key_Share11static_typeEv: 212| 39| static Extension_Code static_type() { return Extension_Code::KeyShare; } _ZN5Botan3TLS6Cookie11static_typeEv: 44| 12| static Extension_Code static_type() { return Extension_Code::Cookie; } _ZNK5Botan3TLS6Cookie4typeEv: 46| 12| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS6Cookie5emptyEv: 50| 6| bool empty() const override { return m_cookie.empty(); } _ZN5Botan3TLS22PSK_Key_Exchange_Modes11static_typeEv: 67| 54| static Extension_Code static_type() { return Extension_Code::PskKeyExchangeModes; } _ZNK5Botan3TLS22PSK_Key_Exchange_Modes4typeEv: 69| 54| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS22PSK_Key_Exchange_Modes5emptyEv: 73| 27| bool empty() const override { return m_modes.empty(); } _ZN5Botan3TLS23Certificate_Authorities11static_typeEv: 90| 3| static Extension_Code static_type() { return Extension_Code::CertificateAuthorities; } _ZNK5Botan3TLS23Certificate_Authorities4typeEv: 92| 3| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS23Certificate_Authorities5emptyEv: 96| 1| bool empty() const override { return m_distinguished_names.empty(); } _ZN5Botan3TLS3PSK11static_typeEv: 112| 17| static Extension_Code static_type() { return Extension_Code::PresharedKey; } _ZNK5Botan3TLS3PSK4typeEv: 114| 11| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS9Key_Share4typeEv: 214| 38| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS19EarlyDataIndication11static_typeEv: 306| 36| static Extension_Code static_type() { return Extension_Code::EarlyData; } _ZNK5Botan3TLS19EarlyDataIndication4typeEv: 308| 36| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS11ExternalPSKC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEES6_NS2_6vectorIhNS_16secure_allocatorIhEEEE: 31| 1.93k| m_identity(identity), m_prf_algo(prf_algo), m_master_secret(std::move(psk)), m_is_imported(false) {} _ZN5Botan3TLS11ExternalPSKD2Ev: 28| 1.93k| ~ExternalPSK() = default; _ZNK5Botan3TLS17Handshake_Message9wire_typeEv: 47| 7.86k| virtual Handshake_Type wire_type() const { return type(); } _ZN5Botan3TLS17Handshake_MessageC2EOS1_: 57| 36.9k| Handshake_Message(Handshake_Message&&) = default; _ZN5Botan3TLS17Handshake_MessageD2Ev: 54| 54.1k| virtual ~Handshake_Message() = default; _ZN5Botan3TLS17Handshake_MessageC2Ev: 55| 17.2k| Handshake_Message() = default; _ZNK5Botan3TLS18Certificate_Verify4typeEv: 253| 8| Handshake_Type type() const override { return Handshake_Type::CertificateVerify; } _ZN5Botan3TLS8FinishedC2ENSt3__16vectorIhNS2_9allocatorIhEEEE: 272| 73| explicit Finished(std::vector buf) : m_verification_data(std::move(buf)) {} _ZNK5Botan3TLS8Finished4typeEv: 274| 130| Handshake_Type type() const override { return Handshake_Type::Finished; } _ZNK5Botan3TLS8Finished11verify_dataEv: 276| 126| std::vector verify_data() const { return m_verification_data; } _ZNK5Botan3TLS8Finished9serializeEv: 278| 63| std::vector serialize() const override { return m_verification_data; } _ZN5Botan3TLS15Server_Hello_128SettingsC2ENS_6StrongINSt3__16vectorIhNS4_9allocatorIhEEEENS0_11Session_ID_EJEEENS0_16Protocol_VersionEtb: 109| 2.60k| m_new_session_id(std::move(new_session_id)), 110| 2.60k| m_new_session_version(new_session_version), 111| 2.60k| m_ciphersuite(ciphersuite), 112| 2.60k| m_offer_session_ticket(offer_session_ticket) {} _ZNK5Botan3TLS15Server_Hello_128Settings10session_idEv: 114| 2.60k| const Session_ID& session_id() const { return m_new_session_id; } _ZNK5Botan3TLS15Server_Hello_128Settings16protocol_versionEv: 116| 5.20k| Protocol_Version protocol_version() const { return m_new_session_version; } _ZNK5Botan3TLS15Server_Hello_128Settings11ciphersuiteEv: 118| 2.60k| uint16_t ciphersuite() const { return m_ciphersuite; } _ZNK5Botan3TLS15Server_Hello_128Settings20offer_session_ticketEv: 120| 42| bool offer_session_ticket() const { return m_offer_session_ticket; } _ZNK5Botan3TLS19Client_Key_Exchange17pre_master_secretEv: 188| 1.22k| const secure_vector& pre_master_secret() const { return m_pre_master; } _ZNK5Botan3TLS19Client_Key_Exchange12psk_identityEv: 193| 126| const std::optional& psk_identity() const { return m_psk_identity; } _ZNK5Botan3TLS14Certificate_124typeEv: 223| 6| Handshake_Type type() const override { return Handshake_Type::Certificate; } _ZNK5Botan3TLS14Certificate_1210cert_chainEv: 225| 3| const std::vector& cert_chain() const { return m_certs; } _ZNK5Botan3TLS19Server_Key_Exchange4typeEv: 338| 5.20k| Handshake_Type type() const override { return Handshake_Type::ServerKeyExchange; } _ZNK5Botan3TLS19Server_Key_Exchange6paramsEv: 340| 2.60k| const std::vector& params() const { return m_params; } _ZNK5Botan3TLS19Server_Key_Exchange12shared_groupEv: 351| 1.89k| const std::optional& shared_group() const { return m_shared_group; } _ZNK5Botan3TLS17Server_Hello_Done4typeEv: 389| 5.20k| Handshake_Type type() const override { return Handshake_Type::ServerHelloDone; } _ZNK5Botan3TLS18Change_Cipher_Spec4typeEv: 430| 63| Handshake_Type type() const override { return Handshake_Type::HandshakeCCS; } _ZNK5Botan3TLS18Change_Cipher_Spec9serializeEv: 432| 63| std::vector serialize() const override { return std::vector(1, 1); } _ZNK5Botan3TLS20Encrypted_Extensions4typeEv: 169| 823| Handshake_Type type() const override { return Handshake_Type::EncryptedExtensions; } _ZNK5Botan3TLS14Certificate_134typeEv: 218| 3| Handshake_Type type() const override { return Handshake_Type::Certificate; } _ZN5Botan3TLS6PolicyD2Ev: 709| 6.26k| virtual ~Policy() = default; _ZN5Botan3TLS11PskIdentityC2ENSt3__16vectorIhNS2_9allocatorIhEEEEj: 41| 439| m_identity(std::move(identity)), m_obfuscated_age(obfuscated_age) {} _ZN5Botan3TLS18Server_InformationC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEt: 32| 6.33k| m_hostname(hostname), m_port(port) {} _ZN5Botan3TLS18Server_InformationC2Ev: 24| 5.50k| Server_Information() = default; _ZNK5Botan3TLS7Session13lifetime_hintEv: 366| 63| std::chrono::seconds lifetime_hint() const { return m_lifetime_hint; } _ZNK5Botan3TLS12Session_Base7versionEv: 74| 63| Protocol_Version version() const { return m_version; } _ZN5Botan3TLS15Session_Summary14set_session_idENS_6StrongINSt3__16vectorIhNS3_9allocatorIhEEEENS0_11Session_ID_EJEEE: 236| 63| void set_session_id(Session_ID id) { m_session_id = std::move(id); } _ZN5Botan3TLS14Session_HandleC2ENS_6StrongINSt3__16vectorIhNS3_9allocatorIhEEEENS0_11Session_ID_EJEEE: 59| 61| Session_Handle(Session_ID id) : m_handle(std::move(id)) { validate_constraints(); } _ZN5Botan3TLS14Session_HandleC2ENS_6StrongINSt3__16vectorIhNS3_9allocatorIhEEEENS0_15Session_Ticket_EJEEE: 70| 43| Session_Handle(Session_Ticket ticket) : m_handle(std::move(ticket)) { validate_constraints(); } _ZN5Botan3TLS15Session_ManagerD2Ev: 234| 6.26k| virtual ~Session_Manager() = default; _ZN5Botan3TLS15Session_Manager21emits_session_ticketsEv: 232| 2.60k| virtual bool emits_session_tickets() { return false; } _ZN5Botan3TLS20Session_Manager_Noop6removeERKNS0_14Session_HandleE: 33| 48| size_t remove(const Session_Handle& /*session*/) override { return 0; } _ZNK5Botan3TLS16Signature_Scheme9wire_codeEv: 104| 39.7k| Signature_Scheme::Code wire_code() const noexcept { return m_code; } _ZN5Botan3TLS16Protocol_VersionC2Ev: 58| 10.2k| Protocol_Version() : m_version(0) {} _ZN5Botan3TLS16Protocol_VersionC2Et: 60| 367k| explicit Protocol_Version(uint16_t code) : m_version(code) {} _ZN5Botan3TLS16Protocol_VersionC2ENS0_12Version_CodeE: 66| 313k| Protocol_Version(static_cast(named_version)) {} _ZN5Botan3TLS16Protocol_VersionC2Ehh: 73| 18.4k| Protocol_Version(static_cast((static_cast(major) << 8) | minor)) {} _ZNK5Botan3TLS16Protocol_Version13major_versionEv: 88| 426k| uint8_t major_version() const { return static_cast(m_version >> 8); } _ZNK5Botan3TLS16Protocol_Version13minor_versionEv: 93| 15.7k| uint8_t minor_version() const { return static_cast(m_version & 0xFF); } _ZNK5Botan3TLS16Protocol_Version12version_codeEv: 98| 2.30k| uint16_t version_code() const { return m_version; } _ZNK5Botan3TLS16Protocol_VersioneqERKS1_: 127| 295k| bool operator==(const Protocol_Version& other) const { return (m_version == other.m_version); } _ZNK5Botan3TLS16Protocol_VersionneERKS1_: 132| 4.05k| bool operator!=(const Protocol_Version& other) const { return (m_version != other.m_version); } _ZNK5Botan3TLS16Protocol_VersiongeERKS1_: 142| 8.59k| bool operator>=(const Protocol_Version& other) const { return (*this == other || *this > other); } ------------------ | Branch (142:70): [True: 10, False: 8.58k] | Branch (142:88): [True: 8.53k, False: 47] ------------------ _ZNK5Botan3TLS16Protocol_VersionltERKS1_: 147| 5.63k| bool operator<(const Protocol_Version& other) const { return !(*this >= other); } _ZNK5Botan3TLS16Protocol_VersionleERKS1_: 152| 278k| bool operator<=(const Protocol_Version& other) const { return (*this == other || *this < other); } ------------------ | Branch (152:70): [True: 272k, False: 5.63k] | Branch (152:88): [True: 28, False: 5.61k] ------------------ _ZNK5Botan16X25519_PublicKey9algo_nameEv: 21| 11| std::string algo_name() const override { return "X25519"; } _ZNK5Botan16X25519_PublicKey10key_lengthEv: 25| 2| size_t key_length() const override { return 255; } _ZN5Botan16X25519_PublicKeyC2Ev: 57| 13| X25519_PublicKey() = default; _ZNK5Botan14X448_PublicKey9algo_nameEv: 39| 10| std::string algo_name() const override { return "X448"; } _ZNK5Botan14X448_PublicKey10key_lengthEv: 43| 2| size_t key_length() const override { return 448; } _ZN5Botan14X448_PublicKeyC2Ev: 62| 16| X448_PublicKey() = default; _ZNK5Botan14Cert_Extension17Basic_Constraints5is_caEv: 58| 6.26k| bool is_ca() const { return m_is_ca; } _ZN5Botan14Cert_Extension17Basic_Constraints10static_oidEv: 62| 6.26k| static OID static_oid() { return OID({2, 5, 29, 19}); } _ZNK5Botan14Cert_Extension17Basic_Constraints8oid_nameEv: 67| 12.5k| std::string oid_name() const override { return "X509v3.BasicConstraints"; } _ZN5Botan14Cert_Extension9Key_Usage10static_oidEv: 93| 6.26k| static OID static_oid() { return OID({2, 5, 29, 15}); } _ZNK5Botan14Cert_Extension14Subject_Key_ID10get_key_idEv: 136| 6.26k| const std::vector& get_key_id() const { return m_key_id; } _ZN5Botan14Cert_Extension14Subject_Key_ID10static_oidEv: 138| 6.26k| static OID static_oid() { return OID({2, 5, 29, 14}); } _ZNK5Botan14Cert_Extension14Subject_Key_ID8oid_nameEv: 143| 6.26k| std::string oid_name() const override { return "X509v3.SubjectKeyIdentifier"; } _ZNK5Botan14Cert_Extension16Authority_Key_ID10get_key_idEv: 178| 6.26k| const std::vector& get_key_id() const { return m_key_id; } _ZN5Botan14Cert_Extension16Authority_Key_ID10static_oidEv: 185| 6.26k| static OID static_oid() { return OID({2, 5, 29, 35}); } _ZNK5Botan14Cert_Extension16Authority_Key_ID8oid_nameEv: 190| 6.26k| std::string oid_name() const override { return "X509v3.AuthorityKeyIdentifier"; } _ZNK5Botan14Cert_Extension24Subject_Alternative_Name12get_alt_nameEv: 208| 6.26k| const AlternativeName& get_alt_name() const { return m_alt_name; } _ZN5Botan14Cert_Extension24Subject_Alternative_Name10static_oidEv: 210| 6.26k| static OID static_oid() { return OID({2, 5, 29, 17}); } _ZN5Botan14Cert_Extension24Subject_Alternative_NameC2ERKNS_15AlternativeNameE: 218| 6.26k| explicit Subject_Alternative_Name(const AlternativeName& name = AlternativeName()) : m_alt_name(name) {} _ZNK5Botan14Cert_Extension24Subject_Alternative_Name8oid_nameEv: 221| 6.26k| std::string oid_name() const override { return "X509v3.SubjectAlternativeName"; } _ZN5Botan14Cert_Extension23Issuer_Alternative_Name10static_oidEv: 240| 6.26k| static OID static_oid() { return OID({2, 5, 29, 18}); } _ZN5Botan14Cert_Extension18Extended_Key_Usage10static_oidEv: 278| 6.26k| static OID static_oid() { return OID({2, 5, 29, 37}); } _ZN5Botan14Cert_Extension16Name_Constraints10static_oidEv: 316| 6.26k| static OID static_oid() { return OID({2, 5, 29, 30}); } _ZN5Botan14Cert_Extension20Certificate_Policies10static_oidEv: 348| 6.26k| static OID static_oid() { return OID({2, 5, 29, 32}); } _ZN5Botan14Cert_Extension28Authority_Information_Access10static_oidEv: 473| 6.26k| static OID static_oid() { return OID({1, 3, 6, 1, 5, 5, 7, 1, 1}); } _ZN5Botan14Cert_Extension23CRL_Distribution_Points10static_oidEv: 667| 6.26k| static OID static_oid() { return OID({2, 5, 29, 31}); } _ZN5Botan14Cert_Extension12OCSP_NoCheck10static_oidEv: 796| 6.26k| static OID static_oid() { return OID({1, 3, 6, 1, 5, 5, 7, 48, 1, 5}); } _ZN5Botan14Cert_Extension21NoRevocationAvailable10static_oidEv: 839| 6.26k| static OID static_oid() { return OID({2, 5, 29, 56}); } _ZN5Botan14Cert_Extension14Subject_Key_IDC2Ev: 115| 6.26k| Subject_Key_ID() = default; _ZN5Botan14Cert_Extension16Authority_Key_IDC2Ev: 162| 6.26k| Authority_Key_ID() = default; _ZN5Botan11X509_ObjectC2Ev: 120| 6.74k| X509_Object() = default; _ZN5Botan16X509_CertificateC2ERKS0_: 559| 5.58k| X509_Certificate(const X509_Certificate& other) = default; 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| 6.27k|extern "C" int LLVMFuzzerTestOneInput(const uint8_t in[], size_t len) { 40| 6.27k| if(len <= max_fuzzer_input_size) { ------------------ | Branch (40:7): [True: 6.26k, False: 3] ------------------ 41| 6.26k| try { 42| 6.26k| fuzz(std::span(in, len)); 43| 6.26k| } 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| 6.26k| } 51| 6.27k| return 0; 52| 6.27k|} _Z20fuzzer_rng_as_sharedv: 56| 6.26k|inline std::shared_ptr fuzzer_rng_as_shared() { 57| 6.26k| static const std::shared_ptr rng = 58| 6.26k| std::make_shared(Botan::secure_vector(32)); 59| 6.26k| return rng; 60| 6.26k|} _Z4fuzzNSt3__14spanIKhLm18446744073709551615EEE: 175| 6.26k|void fuzz(std::span in) { 176| 6.26k| if(in.size() <= 1) { ------------------ | Branch (176:7): [True: 1, False: 6.26k] ------------------ 177| 1| return; 178| 1| } 179| | 180| 6.26k| auto session_manager = std::make_shared(); 181| 6.26k| auto policy = std::make_shared(); 182| 6.26k| const Botan::TLS::Server_Information info("server.name", 443); 183| 6.26k| auto creds = std::make_shared(); 184| 6.26k| auto callbacks = std::make_shared(); 185| | 186| 6.26k| const bool is_datagram = (in[0] & 1) == 1; 187| | 188| 6.26k| Botan::TLS::Server server(callbacks, session_manager, creds, policy, fuzzer_rng_as_shared(), is_datagram); 189| | 190| 6.26k| try { 191| 6.26k| server.received_data(in.subspan(1, in.size() - 1)); 192| 6.26k| } catch(const std::exception& e) {} 193| 6.26k|} tls_server.cpp:_ZNK12_GLOBAL__N_117Fuzzer_TLS_Policy16ciphersuite_listEN5Botan3TLS16Protocol_VersionE: 122| 2.79k| std::vector ciphersuite_list(Botan::TLS::Protocol_Version version) const override { 123| 2.79k| std::vector ciphersuites; 124| | 125| 284k| for(auto&& suite : Botan::TLS::Ciphersuite::all_known_ciphersuites()) { ------------------ | Branch (125:27): [True: 284k, False: 2.79k] ------------------ 126| 284k| if(suite.valid() and suite.usable_in_version(version)) { ------------------ | Branch (126:16): [True: 262k, False: 22.3k] | Branch (126:34): [True: 248k, False: 13.9k] ------------------ 127| 248k| ciphersuites.push_back(suite.ciphersuite_code()); 128| 248k| } 129| 284k| } 130| | 131| 2.79k| return ciphersuites; 132| 2.79k| } tls_server.cpp:_ZN12_GLOBAL__N_123Fuzzer_TLS_Server_CredsC2Ev: 49| 6.26k| Fuzzer_TLS_Server_Creds() { 50| 6.26k| Botan::DataSource_Memory cert_in(fixed_ecdsa_cert); 51| 6.26k| m_ecdsa_cert = std::make_unique(cert_in); 52| | 53| 6.26k| Botan::DataSource_Memory key_in(fixed_ecdsa_key); 54| 6.26k| m_ecdsa_key.reset(Botan::PKCS8::load_key(key_in).release()); 55| 6.26k| } tls_server.cpp:_ZN12_GLOBAL__N_123Fuzzer_TLS_Server_Creds10cert_chainERKNSt3__16vectorINS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS6_IS8_EEEERKNS2_IN5Botan19AlgorithmIdentifierENS6_ISE_EEEERKS8_SK_: 61| 5.58k| const std::string& /*hostname*/) override { 62| 5.58k| std::vector v; 63| | 64| 5.58k| for(const auto& algo : algos) { ------------------ | Branch (64:31): [True: 5.58k, False: 2.79k] ------------------ 65| 5.58k| if(algo == "ECDSA") { ------------------ | Branch (65:16): [True: 2.79k, False: 2.79k] ------------------ 66| 2.79k| v.push_back(*m_ecdsa_cert); 67| 2.79k| break; 68| 2.79k| } 69| 5.58k| } 70| | 71| 5.58k| return v; 72| 5.58k| } tls_server.cpp:_ZN12_GLOBAL__N_123Fuzzer_TLS_Server_Creds15private_key_forERKN5Botan16X509_CertificateERKNSt3__112basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEESD_: 76| 3| const std::string& /*context*/) override { 77| 3| if(type == "ECDSA") { ------------------ | Branch (77:13): [True: 0, False: 3] ------------------ 78| 0| return m_ecdsa_key; 79| 0| } 80| 3| return nullptr; 81| 3| } tls_server.cpp:_ZN12_GLOBAL__N_123Fuzzer_TLS_Server_Creds18dtls_cookie_secretEv: 87| 779| Botan::secure_vector dtls_cookie_secret() override { 88| 779| return Botan::hex_decode_locked("AABBCCDDEEFF00112233445566778899"); 89| 779| } tls_server.cpp:_ZN12_GLOBAL__N_123Fuzzer_TLS_Server_Creds17psk_identity_hintERKNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEES9_: 91| 2.60k| std::string psk_identity_hint(const std::string& /*type*/, const std::string& /*context*/) override { 92| 2.60k| return "psk_hint"; 93| 2.60k| } tls_server.cpp:_ZN12_GLOBAL__N_123Fuzzer_TLS_Server_Creds19find_preshared_keysENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEN5Botan3TLS15Connection_SideERKNS1_6vectorINS1_12basic_stringIcS4_NS1_9allocatorIcEEEENSB_ISD_EEEERKNS1_8optionalISD_EE: 105| 1.95k| const std::optional& prf = std::nullopt) override { 106| 1.95k| if(!identities.empty() && std::find(identities.begin(), identities.end(), "psk_id") == identities.end()) { ------------------ | Branch (106:13): [True: 1.95k, False: 0] | Branch (106:13): [True: 25, False: 1.93k] | Branch (106:36): [True: 25, False: 1.93k] ------------------ 107| 25| return Botan::Credentials_Manager::find_preshared_keys(host, whoami, identities, prf); 108| 25| } 109| | 110| 1.93k| std::vector psks; 111| 1.93k| psks.emplace_back("psk_id", "SHA-256", Botan::hex_decode_locked("AABBCCDDEEFF00112233445566778899")); 112| 1.93k| return psks; 113| 1.95k| } tls_server.cpp:_ZN12_GLOBAL__N_127Fuzzer_TLS_Server_Callbacks13tls_emit_dataENSt3__14spanIKhLm18446744073709551615EEE: 137| 12.0k| void tls_emit_data(std::span /*data*/) override { 138| | // discard 139| 12.0k| } tls_server.cpp:_ZN12_GLOBAL__N_127Fuzzer_TLS_Server_Callbacks9tls_alertEN5Botan3TLS5AlertE: 145| 1.22k| void tls_alert(Botan::TLS::Alert /*alert*/) override { 146| | // ignore alert 147| 1.22k| } tls_server.cpp:_ZN12_GLOBAL__N_127Fuzzer_TLS_Server_Callbacks30tls_server_choose_app_protocolERKNSt3__16vectorINS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS6_IS8_EEEE: 149| 31| std::string tls_server_choose_app_protocol(const std::vector& client_protos) override { 150| 31| if(client_protos.size() > 1) { ------------------ | Branch (150:13): [True: 29, False: 2] ------------------ 151| 29| return client_protos[0]; 152| 29| } else { 153| 2| return "fuzzy"; 154| 2| } 155| 31| } _ZN5Botan19AlgorithmIdentifierC2ERKNS_3OIDERKNSt3__16vectorIhNS4_9allocatorIhEEEE: 20| 23.2k| m_oid(oid), m_parameters(param) {} _ZN5Botan19AlgorithmIdentifierC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKNS1_6vectorIhNS1_9allocatorIhEEEE: 26| 11.6k| AlgorithmIdentifier(OID::from_string(oid), param) {} _ZN5Botan19AlgorithmIdentifierC2ERKNS_3OIDENS0_15Encoding_OptionE: 31| 1.06k|AlgorithmIdentifier::AlgorithmIdentifier(const OID& oid, Encoding_Option option) : m_oid(oid) { 32| 1.06k| constexpr uint8_t DER_NULL[] = {0x05, 0x00}; 33| | 34| 1.06k| if(option == USE_NULL_PARAM) { ------------------ | Branch (34:7): [True: 454, False: 610] ------------------ 35| 454| m_parameters.assign(DER_NULL, DER_NULL + 2); 36| 454| } 37| 1.06k|} _ZN5Botan19AlgorithmIdentifierC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS0_15Encoding_OptionE: 42| 11.6k|AlgorithmIdentifier::AlgorithmIdentifier(std::string_view oid, Encoding_Option option) : m_oid(OID::from_string(oid)) { 43| 11.6k| constexpr uint8_t DER_NULL[2] = {0x05, 0x00}; 44| | 45| 11.6k| if(option == USE_NULL_PARAM) { ------------------ | Branch (45:7): [True: 11.6k, False: 0] ------------------ 46| 11.6k| m_parameters.assign(DER_NULL, DER_NULL + 2); 47| 11.6k| } 48| 11.6k|} _ZNK5Botan19AlgorithmIdentifier19parameters_are_nullEv: 50| 12.6k|bool AlgorithmIdentifier::parameters_are_null() const { 51| 12.6k| return (m_parameters.size() == 2 && (m_parameters[0] == 0x05) && (m_parameters[1] == 0x00)); ------------------ | Branch (51:12): [True: 14, False: 12.6k] | Branch (51:40): [True: 3, False: 11] | Branch (51:69): [True: 0, False: 3] ------------------ 52| 12.6k|} _ZN5BotaneqERKNS_19AlgorithmIdentifierES2_: 54| 6.26k|bool operator==(const AlgorithmIdentifier& x, const AlgorithmIdentifier& y) { 55| 6.26k| return (x.oid() == y.oid() && x.parameters() == y.parameters()); ------------------ | Branch (55:12): [True: 6.26k, False: 0] | Branch (55:34): [True: 6.26k, False: 0] ------------------ 56| 6.26k|} _ZN5BotanneERKNS_19AlgorithmIdentifierES2_: 58| 6.26k|bool operator!=(const AlgorithmIdentifier& x, const AlgorithmIdentifier& y) { 59| 6.26k| return !(x == y); 60| 6.26k|} _ZNK5Botan19AlgorithmIdentifier11encode_intoERNS_11DER_EncoderE: 65| 41.2k|void AlgorithmIdentifier::encode_into(DER_Encoder& codec) const { 66| 41.2k| codec.start_sequence().encode(oid()).raw_bytes(parameters()).end_cons(); 67| 41.2k|} _ZN5Botan19AlgorithmIdentifier11decode_fromERNS_11BER_DecoderE: 72| 25.3k|void AlgorithmIdentifier::decode_from(BER_Decoder& codec) { 73| 25.3k| 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| 25.3k| const bool acceptable_parameters = [&]() { 89| 25.3k| if(this->parameters_are_null_or_empty()) { 90| 25.3k| return true; 91| 25.3k| } 92| 25.3k| if(ASN1::is_der_sequence_header(m_parameters)) { 93| 25.3k| return true; 94| 25.3k| } 95| 25.3k| if(ASN1::is_single_der_object(m_parameters, ASN1_Type::ObjectId, ASN1_Class::Universal)) { 96| 25.3k| return true; 97| 25.3k| } 98| 25.3k| if(ASN1::is_single_der_object(m_parameters, ASN1_Type::OctetString, ASN1_Class::Universal)) { 99| 25.3k| return true; 100| 25.3k| } 101| 25.3k| return false; 102| 25.3k| }(); 103| | 104| 25.3k| if(!acceptable_parameters) { ------------------ | Branch (104:7): [True: 82, False: 25.3k] ------------------ 105| 82| throw Decoding_Error("AlgorithmIdentifier parameters were not NULL, a SEQUENCE, an OID, or an OCTET STRING"); 106| 82| } 107| 25.3k|} alg_id.cpp:_ZZN5Botan19AlgorithmIdentifier11decode_fromERNS_11BER_DecoderEENK3$_0clEv: 88| 25.2k| const bool acceptable_parameters = [&]() { 89| 25.2k| if(this->parameters_are_null_or_empty()) { ------------------ | Branch (89:10): [True: 12.6k, False: 12.6k] ------------------ 90| 12.6k| return true; 91| 12.6k| } 92| 12.6k| if(ASN1::is_der_sequence_header(m_parameters)) { ------------------ | Branch (92:10): [True: 1, False: 12.6k] ------------------ 93| 1| return true; 94| 1| } 95| 12.6k| if(ASN1::is_single_der_object(m_parameters, ASN1_Type::ObjectId, ASN1_Class::Universal)) { ------------------ | Branch (95:10): [True: 12.5k, False: 83] ------------------ 96| 12.5k| return true; 97| 12.5k| } 98| 83| if(ASN1::is_single_der_object(m_parameters, ASN1_Type::OctetString, ASN1_Class::Universal)) { ------------------ | Branch (98:10): [True: 1, False: 82] ------------------ 99| 1| return true; 100| 1| } 101| 82| return false; 102| 83| }(); _ZNK5Botan11ASN1_Object10BER_encodeEv: 21| 55.8k|std::vector ASN1_Object::BER_encode() const { 22| 55.8k| std::vector output; 23| 55.8k| DER_Encoder der(output); 24| 55.8k| this->encode_into(der); 25| 55.8k| return output; 26| 55.8k|} _ZN5Botan14ASN1_BitStringC2ENSt3__16vectorIhNS1_9allocatorIhEEEEm: 29| 18.9k| m_bytes(std::move(bytes)), m_unused_bits(unused_bits) { 30| 18.9k| if(m_unused_bits >= 8) { ------------------ | Branch (30:7): [True: 0, False: 18.9k] ------------------ 31| 0| throw Invalid_Argument("ASN1_BitString: Invalid unused bit count"); 32| 0| } 33| | 34| 18.9k| if(m_bytes.empty() && m_unused_bits != 0) { ------------------ | Branch (34:7): [True: 2, False: 18.9k] | Branch (34:26): [True: 0, False: 2] ------------------ 35| 0| throw Invalid_Argument("ASN1_BitString: Empty BIT STRING cannot have unused bits"); 36| 0| } 37| | 38| 18.9k| if(m_unused_bits > 0 && (m_bytes.back() & ((1U << m_unused_bits) - 1)) != 0) { ------------------ | Branch (38:7): [True: 3, False: 18.9k] | Branch (38:28): [True: 0, False: 3] ------------------ 39| 0| throw Invalid_Argument("ASN1_BitString: Unused bits must be zero"); 40| 0| } 41| 18.9k|} _ZN5Botan10BER_ObjectD2Ev: 58| 1.11M|BER_Object::~BER_Object() { 59| 1.11M| secure_scrub_memory(m_value); 60| 1.11M|} _ZNK5Botan10BER_Object11assert_is_aENS_9ASN1_TypeENS_10ASN1_ClassENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE: 65| 303k|void BER_Object::assert_is_a(ASN1_Type expected_type_tag, ASN1_Class expected_class_tag, std::string_view descr) const { 66| 303k| if(!this->is_a(expected_type_tag, expected_class_tag)) { ------------------ | Branch (66:7): [True: 191, False: 303k] ------------------ 67| 191| std::stringstream msg; 68| | 69| 191| msg << "Tag mismatch when decoding " << descr << " got "; 70| | 71| 191| if(m_class_tag == ASN1_Class::NoObject && m_type_tag == ASN1_Type::NoObject) { ------------------ | Branch (71:10): [True: 12, False: 179] | Branch (71:49): [True: 12, False: 0] ------------------ 72| 12| msg << "EOF"; 73| 179| } else { 74| 179| if(m_class_tag == ASN1_Class::Universal || m_class_tag == ASN1_Class::Constructed) { ------------------ | Branch (74:13): [True: 31, False: 148] | Branch (74:53): [True: 97, False: 51] ------------------ 75| 128| msg << asn1_tag_to_string(m_type_tag); 76| 128| } else { 77| 51| msg << std::to_string(static_cast(m_type_tag)); 78| 51| } 79| | 80| 179| msg << "/" << asn1_class_to_string(m_class_tag); 81| 179| } 82| | 83| 191| msg << " expected "; 84| | 85| 191| if(expected_class_tag == ASN1_Class::Universal || expected_class_tag == ASN1_Class::Constructed) { ------------------ | Branch (85:10): [True: 42, False: 149] | Branch (85:57): [True: 149, False: 0] ------------------ 86| 191| msg << asn1_tag_to_string(expected_type_tag); 87| 191| } else { 88| 0| msg << std::to_string(static_cast(expected_type_tag)); 89| 0| } 90| | 91| 191| msg << "/" << asn1_class_to_string(expected_class_tag); 92| | 93| 191| throw BER_Decoding_Error(msg.str()); 94| 191| } 95| 303k|} _ZNK5Botan10BER_Object4is_aENS_9ASN1_TypeENS_10ASN1_ClassE: 97| 416k|bool BER_Object::is_a(ASN1_Type expected_type_tag, ASN1_Class expected_class_tag) const { 98| 416k| return (m_type_tag == expected_type_tag && m_class_tag == expected_class_tag); ------------------ | Branch (98:12): [True: 340k, False: 75.4k] | Branch (98:47): [True: 340k, False: 7] ------------------ 99| 416k|} _ZNK5Botan10BER_Object4is_aEiNS_10ASN1_ClassE: 101| 43.8k|bool BER_Object::is_a(int expected_type_tag, ASN1_Class expected_class_tag) const { 102| 43.8k| return is_a(ASN1_Type(expected_type_tag), expected_class_tag); 103| 43.8k|} _ZN5Botan10BER_Object11set_taggingENS_9ASN1_TypeENS_10ASN1_ClassE: 105| 499k|void BER_Object::set_tagging(ASN1_Type type_tag, ASN1_Class class_tag) { 106| 499k| m_type_tag = type_tag; 107| 499k| m_class_tag = class_tag; 108| 499k|} _ZN5Botan20asn1_class_to_stringENS_10ASN1_ClassE: 110| 370|std::string asn1_class_to_string(ASN1_Class type) { 111| 370| switch(type) { 112| 73| case ASN1_Class::Universal: ------------------ | Branch (112:7): [True: 73, False: 297] ------------------ 113| 73| return "UNIVERSAL"; 114| 246| case ASN1_Class::Constructed: ------------------ | Branch (114:7): [True: 246, False: 124] ------------------ 115| 246| return "CONSTRUCTED"; 116| 1| case ASN1_Class::ContextSpecific: ------------------ | Branch (116:7): [True: 1, False: 369] ------------------ 117| 1| return "CONTEXT_SPECIFIC"; 118| 4| case ASN1_Class::Application: ------------------ | Branch (118:7): [True: 4, False: 366] ------------------ 119| 4| return "APPLICATION"; 120| 3| case ASN1_Class::Private: ------------------ | Branch (120:7): [True: 3, False: 367] ------------------ 121| 3| return "PRIVATE"; 122| 0| case ASN1_Class::NoObject: ------------------ | Branch (122:7): [True: 0, False: 370] ------------------ 123| 0| return "NO_OBJECT"; 124| 43| default: ------------------ | Branch (124:7): [True: 43, False: 327] ------------------ 125| 43| return "CLASS(" + std::to_string(static_cast(type)) + ")"; 126| 370| } 127| 370|} _ZN5Botan18asn1_tag_to_stringENS_9ASN1_TypeE: 129| 349|std::string asn1_tag_to_string(ASN1_Type type) { 130| 349| switch(type) { 131| 147| case ASN1_Type::Sequence: ------------------ | Branch (131:7): [True: 147, False: 202] ------------------ 132| 147| return "SEQUENCE"; 133| | 134| 5| case ASN1_Type::Set: ------------------ | Branch (134:7): [True: 5, False: 344] ------------------ 135| 5| return "SET"; 136| | 137| 2| case ASN1_Type::PrintableString: ------------------ | Branch (137:7): [True: 2, False: 347] ------------------ 138| 2| return "PRINTABLE STRING"; 139| | 140| 1| case ASN1_Type::NumericString: ------------------ | Branch (140:7): [True: 1, False: 348] ------------------ 141| 1| return "NUMERIC STRING"; 142| | 143| 3| case ASN1_Type::Ia5String: ------------------ | Branch (143:7): [True: 3, False: 346] ------------------ 144| 3| return "IA5 STRING"; 145| | 146| 1| case ASN1_Type::TeletexString: ------------------ | Branch (146:7): [True: 1, False: 348] ------------------ 147| 1| return "T61 STRING"; 148| | 149| 29| case ASN1_Type::Utf8String: ------------------ | Branch (149:7): [True: 29, False: 320] ------------------ 150| 29| return "UTF8 STRING"; 151| | 152| 2| case ASN1_Type::VisibleString: ------------------ | Branch (152:7): [True: 2, False: 347] ------------------ 153| 2| return "VISIBLE STRING"; 154| | 155| 1| case ASN1_Type::BmpString: ------------------ | Branch (155:7): [True: 1, False: 348] ------------------ 156| 1| return "BMP STRING"; 157| | 158| 1| case ASN1_Type::UniversalString: ------------------ | Branch (158:7): [True: 1, False: 348] ------------------ 159| 1| return "UNIVERSAL STRING"; 160| | 161| 2| case ASN1_Type::UtcTime: ------------------ | Branch (161:7): [True: 2, False: 347] ------------------ 162| 2| return "UTC TIME"; 163| | 164| 2| case ASN1_Type::GeneralizedTime: ------------------ | Branch (164:7): [True: 2, False: 347] ------------------ 165| 2| return "GENERALIZED TIME"; 166| | 167| 2| case ASN1_Type::OctetString: ------------------ | Branch (167:7): [True: 2, False: 347] ------------------ 168| 2| return "OCTET STRING"; 169| | 170| 4| case ASN1_Type::BitString: ------------------ | Branch (170:7): [True: 4, False: 345] ------------------ 171| 4| return "BIT STRING"; 172| | 173| 1| case ASN1_Type::Enumerated: ------------------ | Branch (173:7): [True: 1, False: 348] ------------------ 174| 1| return "ENUMERATED"; 175| | 176| 43| case ASN1_Type::Integer: ------------------ | Branch (176:7): [True: 43, False: 306] ------------------ 177| 43| return "INTEGER"; 178| | 179| 2| case ASN1_Type::Null: ------------------ | Branch (179:7): [True: 2, False: 347] ------------------ 180| 2| return "NULL"; 181| | 182| 1| case ASN1_Type::ObjectId: ------------------ | Branch (182:7): [True: 1, False: 348] ------------------ 183| 1| return "OBJECT"; 184| | 185| 1| case ASN1_Type::Boolean: ------------------ | Branch (185:7): [True: 1, False: 348] ------------------ 186| 1| return "BOOLEAN"; 187| | 188| 0| case ASN1_Type::NoObject: ------------------ | Branch (188:7): [True: 0, False: 349] ------------------ 189| 0| return "NO_OBJECT"; 190| | 191| 99| default: ------------------ | Branch (191:7): [True: 99, False: 250] ------------------ 192| 99| return "TAG(" + std::to_string(static_cast(type)) + ")"; 193| 349| } 194| 349|} _ZN5Botan18BER_Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 199| 670|BER_Decoding_Error::BER_Decoding_Error(std::string_view err) : Decoding_Error(fmt("BER: {}", err)) {} _ZN5Botan11BER_Bad_TagC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEj: 201| 35|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| 18.8k|std::vector put_in_sequence(const std::vector& contents) { 209| 18.8k| return ASN1::put_in_sequence(contents.data(), contents.size()); 210| 18.8k|} _ZN5Botan4ASN115put_in_sequenceEPKhm: 212| 18.8k|std::vector put_in_sequence(const uint8_t bits[], size_t len) { 213| 18.8k| std::vector output = der_sequence_header(len); 214| 18.8k| output.reserve(output.size() + len); 215| 18.8k| if(len > 0) { ------------------ | Branch (215:7): [True: 18.8k, False: 0] ------------------ 216| 18.8k| output.insert(output.end(), bits, bits + len); 217| 18.8k| } 218| 18.8k| return output; 219| 18.8k|} _ZN5Botan4ASN19to_stringERKNS_10BER_ObjectE: 224| 56.6k|std::string to_string(const BER_Object& obj) { 225| 56.6k| return bytes_to_string(obj.data()); 226| 56.6k|} _ZN5Botan4ASN19maybe_BERERNS_10DataSourceE: 231| 13.0k|bool maybe_BER(DataSource& source) { 232| 13.0k| uint8_t first_u8 = 0; 233| 13.0k| if(source.peek_byte(first_u8) == 0) { ------------------ | Branch (233:7): [True: 1, False: 13.0k] ------------------ 234| 1| BOTAN_ASSERT_EQUAL(source.read_byte(first_u8), 0, "Expected EOF"); ------------------ | | 97| 1| do { \ | | 98| 1| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 99| 1| if((expr1) != (expr2)) { \ | | ------------------ | | | Branch (99:10): [True: 0, False: 1] | | ------------------ | | 100| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 101| 0| Botan::assertion_failure(#expr1 " == " #expr2, assertion_made, __func__, __FILE__, __LINE__); \ | | 102| 0| } \ | | 103| 1| } while(0) | | ------------------ | | | Branch (103:12): [Folded, False: 1] | | ------------------ ------------------ 235| 1| throw Stream_IO_Error("ASN1::maybe_BER: Source was empty"); 236| 1| } 237| | 238| 13.0k| const auto cons_seq = static_cast(ASN1_Class::Constructed) | static_cast(ASN1_Type::Sequence); 239| 13.0k| return first_u8 == cons_seq; 240| 13.0k|} _ZN5Botan3OID9from_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 66| 4.31k|std::optional OID::from_name(std::string_view name) { 67| 4.31k| if(name.empty()) { ------------------ | Branch (67:7): [True: 0, False: 4.31k] ------------------ 68| 0| throw Invalid_Argument("OID::from_name argument must be non-empty"); 69| 0| } 70| | 71| 4.31k| OID o = OID_Map::global_registry().str2oid(name); 72| 4.31k| if(o.has_value()) { ------------------ | Branch (72:7): [True: 4.31k, False: 0] ------------------ 73| 4.31k| return std::optional(o); 74| 4.31k| } 75| | 76| 0| return std::nullopt; 77| 4.31k|} _ZN5Botan3OID11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 80| 48.5k|OID OID::from_string(std::string_view str) { 81| 48.5k| if(str.empty()) { ------------------ | Branch (81:7): [True: 0, False: 48.5k] ------------------ 82| 0| throw Invalid_Argument("OID::from_string argument must be non-empty"); 83| 0| } 84| | 85| 48.5k| OID o = OID_Map::global_registry().str2oid(str); 86| 48.5k| if(o.has_value()) { ------------------ | Branch (86:7): [True: 48.5k, False: 0] ------------------ 87| 48.5k| return o; 88| 48.5k| } 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| 134k|OID::OID(std::initializer_list init) : m_id(init) { 99| 134k| oid_valid_check(m_id); 100| 134k|} _ZNK5Botan3OID15registered_nameEv: 149| 12.5k|std::optional OID::registered_name() const { 150| 12.5k| return OID_Map::global_registry().oid2str(*this); 151| 12.5k|} _ZNK5Botan3OID7matchesESt16initializer_listIjE: 157| 12.5k|bool OID::matches(std::initializer_list other) const { 158| | // TODO: once all target compilers support it, use std::ranges::equal 159| 12.5k| return std::equal(m_id.begin(), m_id.end(), other.begin(), other.end()); 160| 12.5k|} _ZNK5Botan3OID9hash_codeEv: 162| 12.5k|uint64_t OID::hash_code() const { 163| | // If this is changed also update gen_oids.py to match 164| 12.5k| uint64_t hash = 0x621F302327D9A49A; 165| 75.2k| for(const auto id : m_id) { ------------------ | Branch (165:22): [True: 75.2k, False: 12.5k] ------------------ 166| 75.2k| hash *= 193; 167| 75.2k| hash += id; 168| 75.2k| } 169| 12.5k| return hash; 170| 12.5k|} _ZN5BotanltERKNS_3OIDES2_: 175| 351k|bool operator<(const OID& a, const OID& b) { 176| 351k| const std::vector& oid1 = a.get_components(); 177| 351k| const std::vector& oid2 = b.get_components(); 178| | 179| 351k| return std::lexicographical_compare(oid1.begin(), oid1.end(), oid2.begin(), oid2.end()); 180| 351k|} _ZNK5Botan3OID11encode_intoERNS_11DER_EncoderE: 185| 79.1k|void OID::encode_into(DER_Encoder& der) const { 186| 79.1k| if(m_id.size() < 2) { ------------------ | Branch (186:7): [True: 0, False: 79.1k] ------------------ 187| 0| throw Invalid_Argument("OID::encode_into: OID is invalid"); 188| 0| } 189| | 190| 79.1k| const auto append = [](std::vector& encoding, uint32_t z) { 191| 79.1k| if(z <= 0x7F) { 192| 79.1k| encoding.push_back(static_cast(z)); 193| 79.1k| } else { 194| 79.1k| const size_t z7 = (high_bit(z) + 7 - 1) / 7; 195| | 196| 79.1k| for(size_t j = 0; j != z7; ++j) { 197| 79.1k| uint8_t zp = static_cast(z >> (7 * (z7 - j - 1)) & 0x7F); 198| | 199| 79.1k| if(j != z7 - 1) { 200| 79.1k| zp |= 0x80; 201| 79.1k| } 202| | 203| 79.1k| encoding.push_back(zp); 204| 79.1k| } 205| 79.1k| } 206| 79.1k| }; 207| | 208| 79.1k| std::vector encoding; 209| | 210| | // We know 40 * root can't overflow because root is between 0 and 2 211| 79.1k| auto first = checked_add(40 * m_id[0], m_id[1]); 212| 79.1k| BOTAN_ASSERT_NOMSG(first.has_value()); ------------------ | | 84| 79.1k| do { \ | | 85| 79.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 79.1k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 79.1k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 79.1k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 79.1k] | | ------------------ ------------------ 213| | 214| 79.1k| append(encoding, *first); 215| | 216| 407k| for(size_t i = 2; i != m_id.size(); ++i) { ------------------ | Branch (216:22): [True: 328k, False: 79.1k] ------------------ 217| 328k| append(encoding, m_id[i]); 218| 328k| } 219| 79.1k| der.add_object(ASN1_Type::ObjectId, ASN1_Class::Universal, encoding); 220| 79.1k|} _ZN5Botan3OID11decode_fromERNS_11BER_DecoderE: 225| 94.7k|void OID::decode_from(BER_Decoder& decoder) { 226| 94.7k| const BER_Object obj = decoder.get_next_object(); 227| 94.7k| if(obj.tagging() != (ASN1_Class::Universal | ASN1_Type::ObjectId)) { ------------------ | Branch (227:7): [True: 35, False: 94.7k] ------------------ 228| 35| throw BER_Bad_Tag("Error decoding OID, unknown tag", obj.tagging()); 229| 35| } 230| | 231| 94.7k| if(obj.length() == 0) { ------------------ | Branch (231:7): [True: 1, False: 94.7k] ------------------ 232| 1| throw BER_Decoding_Error("OID encoding is too short"); 233| 1| } 234| | 235| 94.7k| const auto consume = [](BufferSlicer& data) -> uint32_t { 236| 94.7k| BOTAN_ASSERT_NOMSG(!data.empty()); 237| 94.7k| uint32_t b = data.take_byte(); 238| | 239| 94.7k| if(b > 0x7F) { 240| 94.7k| 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| 94.7k| if(b == 0) { 246| 94.7k| throw Decoding_Error("Leading zero byte in multibyte OID encoding"); 247| 94.7k| } 248| | 249| 94.7k| while(true) { 250| 94.7k| if(data.empty()) { 251| 94.7k| throw Decoding_Error("Truncated OID value"); 252| 94.7k| } 253| | 254| 94.7k| const uint8_t next = data.take_byte(); 255| 94.7k| const bool more = (next & 0x80) == 0x80; 256| 94.7k| const uint8_t value = next & 0x7F; 257| | 258| 94.7k| if((b >> (32 - 7)) != 0) { 259| 94.7k| throw Decoding_Error("OID component overflow"); 260| 94.7k| } 261| | 262| 94.7k| b = (b << 7) | value; 263| | 264| 94.7k| if(!more) { 265| 94.7k| break; 266| 94.7k| } 267| 94.7k| } 268| 94.7k| } 269| | 270| 94.7k| return b; 271| 94.7k| }; 272| | 273| 94.7k| BufferSlicer data(obj.data()); 274| 94.7k| 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| 94.7k| parts.reserve(std::min(16, obj.length() + 1)); 280| | 281| 462k| while(!data.empty()) { ------------------ | Branch (281:10): [True: 367k, False: 94.7k] ------------------ 282| 367k| const uint32_t comp = consume(data); 283| | 284| 367k| if(parts.empty()) { ------------------ | Branch (284:10): [True: 94.7k, False: 272k] ------------------ 285| | // divide into root and second arc 286| | 287| 94.7k| const uint32_t root_arc = [](uint32_t b0) -> uint32_t { 288| 94.7k| if(b0 < 40) { 289| 94.7k| return 0; 290| 94.7k| } else if(b0 < 80) { 291| 94.7k| return 1; 292| 94.7k| } else { 293| 94.7k| return 2; 294| 94.7k| } 295| 94.7k| }(comp); 296| | 297| 94.7k| parts.push_back(root_arc); 298| 94.7k| BOTAN_ASSERT_NOMSG(comp >= 40 * root_arc); ------------------ | | 84| 94.7k| do { \ | | 85| 94.7k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 94.7k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 94.7k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 94.7k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 94.7k] | | ------------------ ------------------ 299| 94.7k| parts.push_back(comp - 40 * root_arc); 300| 272k| } else { 301| 272k| parts.push_back(comp); 302| 272k| } 303| 367k| } 304| | 305| 94.7k| m_id = std::move(parts); 306| 94.7k|} asn1_oid.cpp:_ZN5Botan12_GLOBAL__N_115oid_valid_checkENSt3__14spanIKjLm18446744073709551615EEE: 26| 134k|void oid_valid_check(std::span oid) { 27| 134k| BOTAN_ARG_CHECK(oid.size() >= 2, "OID too short to be valid"); ------------------ | | 35| 134k| do { \ | | 36| 134k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 134k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 134k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 134k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 134k] | | ------------------ ------------------ 28| 134k| BOTAN_ARG_CHECK(oid[0] <= 2, "OID root out of range"); ------------------ | | 35| 134k| do { \ | | 36| 134k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 134k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 134k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 134k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 134k] | | ------------------ ------------------ 29| 134k| BOTAN_ARG_CHECK(oid[1] <= 39 || oid[0] == 2, "OID second arc too large"); ------------------ | | 35| 134k| do { \ | | 36| 134k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 134k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 134k, 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| 134k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 134k] | | ------------------ ------------------ 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| 134k| BOTAN_ARG_CHECK(oid[1] <= 0xFFFFFFAF, "OID second arc too large"); ------------------ | | 35| 134k| do { \ | | 36| 134k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 134k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 134k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 134k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 134k] | | ------------------ ------------------ 33| 134k|} asn1_oid.cpp:_ZZNK5Botan3OID11encode_intoERNS_11DER_EncoderEENK3$_0clERNSt3__16vectorIhNS4_9allocatorIhEEEEj: 190| 407k| const auto append = [](std::vector& encoding, uint32_t z) { 191| 407k| if(z <= 0x7F) { ------------------ | Branch (191:10): [True: 348k, False: 59.3k] ------------------ 192| 348k| encoding.push_back(static_cast(z)); 193| 348k| } else { 194| 59.3k| const size_t z7 = (high_bit(z) + 7 - 1) / 7; 195| | 196| 190k| for(size_t j = 0; j != z7; ++j) { ------------------ | Branch (196:28): [True: 130k, False: 59.3k] ------------------ 197| 130k| uint8_t zp = static_cast(z >> (7 * (z7 - j - 1)) & 0x7F); 198| | 199| 130k| if(j != z7 - 1) { ------------------ | Branch (199:16): [True: 71.2k, False: 59.3k] ------------------ 200| 71.2k| zp |= 0x80; 201| 71.2k| } 202| | 203| 130k| encoding.push_back(zp); 204| 130k| } 205| 59.3k| } 206| 407k| }; asn1_oid.cpp:_ZZN5Botan3OID11decode_fromERNS_11BER_DecoderEENK3$_0clERNS_12BufferSlicerE: 235| 367k| const auto consume = [](BufferSlicer& data) -> uint32_t { 236| 367k| BOTAN_ASSERT_NOMSG(!data.empty()); ------------------ | | 84| 367k| do { \ | | 85| 367k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 367k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 367k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 367k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 367k] | | ------------------ ------------------ 237| 367k| uint32_t b = data.take_byte(); 238| | 239| 367k| if(b > 0x7F) { ------------------ | Branch (239:10): [True: 63.6k, False: 303k] ------------------ 240| 63.6k| 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| 63.6k| if(b == 0) { ------------------ | Branch (245:13): [True: 1, False: 63.6k] ------------------ 246| 1| throw Decoding_Error("Leading zero byte in multibyte OID encoding"); 247| 1| } 248| | 249| 64.2k| while(true) { ------------------ | Branch (249:16): [True: 64.2k, Folded] ------------------ 250| 64.2k| if(data.empty()) { ------------------ | Branch (250:16): [True: 9, False: 64.2k] ------------------ 251| 9| throw Decoding_Error("Truncated OID value"); 252| 9| } 253| | 254| 64.2k| const uint8_t next = data.take_byte(); 255| 64.2k| const bool more = (next & 0x80) == 0x80; 256| 64.2k| const uint8_t value = next & 0x7F; 257| | 258| 64.2k| if((b >> (32 - 7)) != 0) { ------------------ | Branch (258:16): [True: 15, False: 64.2k] ------------------ 259| 15| throw Decoding_Error("OID component overflow"); 260| 15| } 261| | 262| 64.2k| b = (b << 7) | value; 263| | 264| 64.2k| if(!more) { ------------------ | Branch (264:16): [True: 63.6k, False: 654] ------------------ 265| 63.6k| break; 266| 63.6k| } 267| 64.2k| } 268| 63.6k| } 269| | 270| 367k| return b; 271| 367k| }; asn1_oid.cpp:_ZZN5Botan3OID11decode_fromERNS_11BER_DecoderEENK3$_1clEj: 287| 94.7k| const uint32_t root_arc = [](uint32_t b0) -> uint32_t { 288| 94.7k| if(b0 < 40) { ------------------ | Branch (288:16): [True: 249, False: 94.4k] ------------------ 289| 249| return 0; 290| 94.4k| } else if(b0 < 80) { ------------------ | Branch (290:23): [True: 31.3k, False: 63.0k] ------------------ 291| 31.3k| return 1; 292| 63.0k| } else { 293| 63.0k| return 2; 294| 63.0k| } 295| 94.7k| }(comp); _ZN5Botan11ASN1_StringC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_9ASN1_TypeE: 135| 38.1k|ASN1_String::ASN1_String(std::string_view str, ASN1_Type t) : m_utf8_str(str), m_tag(t) { 136| 38.1k| if(!is_utf8_subset_string_type(m_tag)) { ------------------ | Branch (136:7): [True: 0, False: 38.1k] ------------------ 137| 0| throw Invalid_Argument("ASN1_String only supports encoding to UTF-8 or a UTF-8 subset"); 138| 0| } 139| | 140| 38.1k| if(!is_valid_asn1_string_content(m_utf8_str, m_tag)) { ------------------ | Branch (140:7): [True: 0, False: 38.1k] ------------------ 141| 0| throw Invalid_Argument(fmt("ASN1_String: Invalid {} encoding", asn1_tag_to_string(m_tag))); 142| 0| } 143| 38.1k|} _ZN5Botan11ASN1_StringC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 145| 38.1k|ASN1_String::ASN1_String(std::string_view str) : ASN1_String(str, choose_encoding(str)) {} _ZN5Botan11ASN1_String11decode_fromERNS_11BER_DecoderE: 162| 38.1k|void ASN1_String::decode_from(BER_Decoder& source) { 163| 38.1k| const BER_Object obj = source.get_next_object(); 164| | 165| 38.1k| if(obj.get_class() != ASN1_Class::Universal || !is_asn1_string_type(obj.type())) { ------------------ | Branch (165:7): [True: 6, False: 38.1k] | Branch (165:51): [True: 55, False: 38.0k] ------------------ 166| 57| auto typ = static_cast(obj.type()); 167| 57| auto cls = static_cast(obj.get_class()); 168| 57| throw Decoding_Error(fmt("ASN1_String: Unknown string type {}/{}", typ, cls)); 169| 57| } 170| | 171| 38.0k| m_tag = obj.type(); 172| 38.0k| m_data.assign(obj.bits(), obj.bits() + obj.length()); 173| | 174| 38.0k| if(m_tag == ASN1_Type::BmpString) { ------------------ | Branch (174:7): [True: 32, False: 38.0k] ------------------ 175| 32| m_utf8_str = ucs2_to_utf8(m_data); 176| 38.0k| } else if(m_tag == ASN1_Type::UniversalString) { ------------------ | Branch (176:14): [True: 53, False: 37.9k] ------------------ 177| 53| m_utf8_str = ucs4_to_utf8(m_data); 178| 37.9k| } else if(m_tag == ASN1_Type::TeletexString) { ------------------ | Branch (178:14): [True: 80, False: 37.8k] ------------------ 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| 80| m_utf8_str = latin1_to_utf8(m_data); 184| 37.8k| } else { 185| | // All other supported string types are UTF-8 or some subset thereof 186| 37.8k| m_utf8_str = ASN1::to_string(obj); 187| | 188| 37.8k| if(!is_valid_asn1_string_content(m_utf8_str, m_tag)) { ------------------ | Branch (188:10): [True: 30, False: 37.8k] ------------------ 189| 30| throw Decoding_Error(fmt("ASN1_String: Invalid {} encoding", asn1_tag_to_string(m_tag))); 190| 30| } 191| 37.8k| } 192| 38.0k|} asn1_str.cpp:_ZN5Botan12_GLOBAL__N_119is_asn1_string_typeENS_9ASN1_TypeE: 99| 38.1k|bool is_asn1_string_type(ASN1_Type tag) { 100| 38.1k| return (is_utf8_subset_string_type(tag) || tag == ASN1_Type::TeletexString || tag == ASN1_Type::BmpString || ------------------ | Branch (100:12): [True: 37.8k, False: 220] | Branch (100:47): [True: 80, False: 140] | Branch (100:82): [True: 32, False: 108] ------------------ 101| 108| tag == ASN1_Type::UniversalString); ------------------ | Branch (101:12): [True: 53, False: 55] ------------------ 102| 38.1k|} asn1_str.cpp:_ZN5Botan12_GLOBAL__N_126is_utf8_subset_string_typeENS_9ASN1_TypeE: 94| 152k|bool is_utf8_subset_string_type(ASN1_Type tag) { 95| 152k| return (tag == ASN1_Type::NumericString || tag == ASN1_Type::PrintableString || tag == ASN1_Type::VisibleString || ------------------ | Branch (95:12): [True: 34, False: 152k] | Branch (95:47): [True: 126k, False: 25.8k] | Branch (95:84): [True: 32, False: 25.7k] ------------------ 96| 25.7k| tag == ASN1_Type::Ia5String || tag == ASN1_Type::Utf8String); ------------------ | Branch (96:12): [True: 40, False: 25.7k] | Branch (96:43): [True: 25.5k, False: 220] ------------------ 97| 152k|} asn1_str.cpp:_ZN5Botan12_GLOBAL__N_128is_valid_asn1_string_contentERKNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS_9ASN1_TypeE: 104| 76.0k|bool is_valid_asn1_string_content(const std::string& str, ASN1_Type tag) { 105| 76.0k| BOTAN_ASSERT_NOMSG(is_utf8_subset_string_type(tag)); ------------------ | | 84| 76.0k| do { \ | | 85| 76.0k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 76.0k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 76.0k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 76.0k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 76.0k] | | ------------------ ------------------ 106| | 107| 76.0k| switch(tag) { 108| 12.7k| case ASN1_Type::Utf8String: ------------------ | Branch (108:7): [True: 12.7k, False: 63.2k] ------------------ 109| 12.7k| return is_valid_utf8(str); 110| 17| case ASN1_Type::NumericString: ------------------ | Branch (110:7): [True: 17, False: 75.9k] ------------------ 111| 63.2k| case ASN1_Type::PrintableString: ------------------ | Branch (111:7): [True: 63.1k, False: 12.8k] ------------------ 112| 63.2k| case ASN1_Type::Ia5String: ------------------ | Branch (112:7): [True: 20, False: 75.9k] ------------------ 113| 63.2k| case ASN1_Type::VisibleString: ------------------ | Branch (113:7): [True: 16, False: 75.9k] ------------------ 114| 63.2k| return g_char_validator.valid_encoding(str, tag); 115| 0| default: ------------------ | Branch (115:7): [True: 0, False: 76.0k] ------------------ 116| 0| return false; 117| 76.0k| } 118| 76.0k|} asn1_str.cpp:_ZNK5Botan12_GLOBAL__N_131ASN1_String_Codepoint_Validator14valid_encodingENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEENS_9ASN1_TypeE: 25| 101k| constexpr bool valid_encoding(std::string_view str, ASN1_Type tag) const { 26| 101k| const uint8_t mask = mask_for(tag); 27| 101k| for(const char c : str) { ------------------ | Branch (27:27): [True: 87.8k, False: 101k] ------------------ 28| 87.8k| const uint8_t codepoint = static_cast(c); 29| 87.8k| const bool is_valid = (m_table[codepoint] & mask) != 0; 30| | 31| 87.8k| if(!is_valid) { ------------------ | Branch (31:16): [True: 3, False: 87.8k] ------------------ 32| 3| return false; 33| 3| } 34| 87.8k| } 35| | 36| 101k| return true; 37| 101k| } asn1_str.cpp:_ZN5Botan12_GLOBAL__N_131ASN1_String_Codepoint_Validator8mask_forENS_9ASN1_TypeE: 45| 101k| static constexpr uint8_t mask_for(ASN1_Type tag) { 46| 101k| switch(tag) { 47| 17| case ASN1_Type::NumericString: ------------------ | Branch (47:13): [True: 17, False: 101k] ------------------ 48| 17| return Numeric_String; 49| 101k| case ASN1_Type::PrintableString: ------------------ | Branch (49:13): [True: 101k, False: 53] ------------------ 50| 101k| return Printable_String; 51| 20| case ASN1_Type::Ia5String: ------------------ | Branch (51:13): [True: 20, False: 101k] ------------------ 52| 20| return IA5_String; 53| 16| case ASN1_Type::VisibleString: ------------------ | Branch (53:13): [True: 16, False: 101k] ------------------ 54| 16| return Visible_String; 55| 0| default: ------------------ | Branch (55:13): [True: 0, False: 101k] ------------------ 56| 0| return 0; 57| 101k| } 58| 101k| } asn1_str.cpp:_ZN5Botan12_GLOBAL__N_115choose_encodingENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 120| 38.1k|ASN1_Type choose_encoding(std::string_view str) { 121| 38.1k| if(g_char_validator.valid_encoding(str, ASN1_Type::PrintableString)) { ------------------ | Branch (121:7): [True: 38.1k, False: 0] ------------------ 122| 38.1k| return ASN1_Type::PrintableString; 123| 38.1k| } else { 124| 0| return ASN1_Type::Utf8String; 125| 0| } 126| 38.1k|} _ZN5Botan9ASN1_TimeC2EthhhhhNS_9ASN1_TypeE: 43| 12.5k| m_year(year), m_month(month), m_day(day), m_hour(hour), m_minute(minute), m_second(second), m_tag(tag) { 44| 12.5k| if(tag != ASN1_Type::UtcTime && tag != ASN1_Type::GeneralizedTime) { ------------------ | Branch (44:7): [True: 0, False: 12.5k] | Branch (44:36): [True: 0, False: 0] ------------------ 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| 12.5k| const uint16_t min_year = 1950; 55| 12.5k| const uint16_t max_year = (tag == ASN1_Type::UtcTime) ? 2049 : 9999; ------------------ | Branch (55:30): [True: 12.5k, False: 0] ------------------ 56| | 57| 12.5k| if(m_year < min_year || m_year > max_year) { ------------------ | Branch (57:7): [True: 0, False: 12.5k] | Branch (57:28): [True: 0, False: 12.5k] ------------------ 58| 0| throw Invalid_Argument(fmt("ASN1_Time year {} is out of range ({} to {})", m_year, min_year, max_year)); 59| 0| } 60| | 61| 12.5k| if(m_month < 1 || m_month > 12) { ------------------ | Branch (61:7): [True: 0, False: 12.5k] | Branch (61:22): [True: 0, False: 12.5k] ------------------ 62| 0| throw Invalid_Argument(fmt("ASN1_Time month {} is out of range", static_cast(m_month))); 63| 0| } 64| | 65| 12.5k| constexpr uint8_t days_in_month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; 66| | 67| 12.5k| const bool is_leap_year = (m_year % 4 == 0) && (m_year % 100 != 0 || m_year % 400 == 0); ------------------ | Branch (67:30): [True: 0, False: 12.5k] | Branch (67:52): [True: 0, False: 0] | Branch (67:73): [True: 0, False: 0] ------------------ 68| 12.5k| const uint8_t max_day = (m_month == 2 && is_leap_year) ? 29 : days_in_month[m_month - 1]; ------------------ | Branch (68:29): [True: 0, False: 12.5k] | Branch (68:45): [True: 0, False: 0] ------------------ 69| | 70| 12.5k| if(m_day < 1 || m_day > max_day) { ------------------ | Branch (70:7): [True: 0, False: 12.5k] | Branch (70:20): [True: 0, False: 12.5k] ------------------ 71| 0| throw Invalid_Argument(fmt("ASN1_Time day {} is out of range for month {}", 72| 0| static_cast(m_day), 73| 0| static_cast(m_month))); 74| 0| } 75| | 76| 12.5k| if(m_hour > 23) { ------------------ | Branch (76:7): [True: 0, False: 12.5k] ------------------ 77| 0| throw Invalid_Argument(fmt("ASN1_Time hour {} is out of range", static_cast(m_hour))); 78| 0| } 79| | 80| 12.5k| if(m_minute > 59) { ------------------ | Branch (80:7): [True: 0, False: 12.5k] ------------------ 81| 0| throw Invalid_Argument(fmt("ASN1_Time minute {} is out of range", static_cast(m_minute))); 82| 0| } 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| 12.5k| if(m_second > 59) { ------------------ | Branch (88:7): [True: 0, False: 12.5k] ------------------ 89| 0| throw Invalid_Argument(fmt("ASN1_Time second {} is out of range", static_cast(m_second))); 90| 0| } 91| 12.5k|} _ZN5Botan9ASN1_Time11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_9ASN1_TypeE: 109| 12.5k|ASN1_Time ASN1_Time::from_string(std::string_view t_spec, ASN1_Type tag) { 110| 12.5k| BOTAN_ARG_CHECK(tag == ASN1_Type::UtcTime || tag == ASN1_Type::GeneralizedTime, "Invalid tag for ASN1_Time"); ------------------ | | 35| 12.5k| do { \ | | 36| 12.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 12.5k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 12.5k, 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.5k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 12.5k] | | ------------------ ------------------ 111| | 112| 12.5k| if(tag == ASN1_Type::GeneralizedTime) { ------------------ | Branch (112:7): [True: 0, False: 12.5k] ------------------ 113| 0| BOTAN_ARG_CHECK(t_spec.size() == 15, "Invalid GeneralizedTime input string"); ------------------ | | 35| 0| do { \ | | 36| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 0| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [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] | | ------------------ ------------------ 114| 12.5k| } else { 115| 12.5k| BOTAN_ARG_CHECK(t_spec.size() == 13, "Invalid UTCTime input string"); ------------------ | | 35| 12.5k| do { \ | | 36| 12.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 12.5k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 12.5k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 12.5k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 12.5k] | | ------------------ ------------------ 116| 12.5k| } 117| | 118| 12.5k| BOTAN_ARG_CHECK(t_spec.back() == 'Z', "Botan does not support ASN1 times with timezones other than Z"); ------------------ | | 35| 12.5k| do { \ | | 36| 12.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 12.5k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 12.5k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 12.5k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 12.5k] | | ------------------ ------------------ 119| | 120| 12.5k| const size_t field_len = 2; 121| 12.5k| const size_t year_len = (tag == ASN1_Type::UtcTime) ? 2 : 4; ------------------ | Branch (121:28): [True: 12.5k, False: 0] ------------------ 122| | 123| 12.5k| const size_t year_start = 0; 124| 12.5k| const size_t month_start = year_start + year_len; 125| 12.5k| const size_t day_start = month_start + field_len; 126| 12.5k| const size_t hour_start = day_start + field_len; 127| 12.5k| const size_t min_start = hour_start + field_len; 128| 12.5k| const size_t sec_start = min_start + field_len; 129| | 130| 12.5k| uint32_t year = to_u32bit(t_spec.substr(year_start, year_len)); 131| 12.5k| const uint32_t month = to_u32bit(t_spec.substr(month_start, field_len)); 132| 12.5k| const uint32_t day = to_u32bit(t_spec.substr(day_start, field_len)); 133| 12.5k| const uint32_t hour = to_u32bit(t_spec.substr(hour_start, field_len)); 134| 12.5k| const uint32_t minute = to_u32bit(t_spec.substr(min_start, field_len)); 135| 12.5k| const uint32_t second = to_u32bit(t_spec.substr(sec_start, field_len)); 136| | 137| 12.5k| if(tag == ASN1_Type::UtcTime) { ------------------ | Branch (137:7): [True: 12.5k, False: 0] ------------------ 138| | // Interpret the two digit year by the 1950/2050 split (RFC 5280 Section 4.1.2.5.1) 139| 12.5k| year += (year >= 50) ? 1900 : 2000; ------------------ | Branch (139:15): [True: 0, False: 12.5k] ------------------ 140| 12.5k| } 141| | 142| 12.5k| return ASN1_Time(static_cast(year), 143| 12.5k| static_cast(month), 144| 12.5k| static_cast(day), 145| 12.5k| static_cast(hour), 146| 12.5k| static_cast(minute), 147| 12.5k| static_cast(second), 148| 12.5k| tag); 149| 12.5k|} _ZN5Botan9ASN1_Time11decode_fromERNS_11BER_DecoderE: 168| 12.5k|void ASN1_Time::decode_from(BER_Decoder& source) { 169| 12.5k| const BER_Object ber_time = source.get_next_object(); 170| | 171| 12.5k| if(ber_time.get_class() != ASN1_Class::Universal || ------------------ | Branch (171:7): [True: 0, False: 12.5k] ------------------ 172| 12.5k| (ber_time.type() != ASN1_Type::UtcTime && ber_time.type() != ASN1_Type::GeneralizedTime)) { ------------------ | Branch (172:8): [True: 0, False: 12.5k] | Branch (172:49): [True: 0, False: 0] ------------------ 173| 0| throw Decoding_Error(fmt("ASN1_Time: Unexpected tag {}/{}", 174| 0| static_cast(ber_time.type()), 175| 0| static_cast(ber_time.get_class()))); 176| 0| } 177| | 178| 12.5k| try { 179| | // Assigning only after a successful parse means that a decoding error 180| | // cannot leave this object in a partially written state 181| 12.5k| *this = ASN1_Time::from_string(ASN1::to_string(ber_time), ber_time.type()); 182| 12.5k| } catch(Invalid_Argument& e) { 183| 0| throw Decoding_Error(fmt("Invalid ASN1_Time encoding: {}", e.what())); 184| 0| } 185| 12.5k|} _ZN5Botan11BER_DecoderD2Ev: 456| 292k|BER_Decoder::~BER_Decoder() = default; _ZNK5Botan11BER_Decoder10more_itemsEv: 461| 170k|bool BER_Decoder::more_items() const { 462| 170k| if(m_source->end_of_data() && !m_pushed.is_set()) { ------------------ | Branch (462:7): [True: 62.9k, False: 107k] | Branch (462:34): [True: 62.9k, False: 0] ------------------ 463| 62.9k| return false; 464| 62.9k| } 465| 107k| return true; 466| 170k|} _ZN5Botan11BER_Decoder10verify_endEv: 471| 75.3k|BER_Decoder& BER_Decoder::verify_end() { 472| 75.3k| return verify_end("BER_Decoder::verify_end called, but data remains"); 473| 75.3k|} _ZN5Botan11BER_Decoder10verify_endENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 478| 81.6k|BER_Decoder& BER_Decoder::verify_end(std::string_view err) { 479| 81.6k| if(!m_source->end_of_data() || m_pushed.is_set()) { ------------------ | Branch (479:7): [True: 99, False: 81.5k] | Branch (479:35): [True: 0, False: 81.5k] ------------------ 480| 99| throw Decoding_Error(err); 481| 99| } 482| 81.5k| return (*this); 483| 81.6k|} _ZN5Botan11BER_Decoder17discard_remainingEv: 488| 6.26k|BER_Decoder& BER_Decoder::discard_remaining() { 489| 6.26k| m_pushed = BER_Object(); 490| 6.26k| uint8_t buf[64]; 491| 6.26k| while(m_source->read(buf, sizeof(buf)) != 0) {} ------------------ | Branch (491:10): [True: 0, False: 6.26k] ------------------ 492| 6.26k| return (*this); 493| 6.26k|} _ZN5Botan11BER_Decoder10read_bytesENSt3__14spanIhLm18446744073709551615EEE: 505| 114k|size_t BER_Decoder::read_bytes(std::span out) { 506| 114k| BOTAN_ASSERT_NOMSG(m_source != nullptr); ------------------ | | 84| 114k| do { \ | | 85| 114k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 114k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 114k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 114k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 114k] | | ------------------ ------------------ 507| 114k| return m_source->read(out.data(), out.size()); 508| 114k|} _ZN5Botan11BER_Decoder16peek_next_objectEv: 510| 25.0k|const BER_Object& BER_Decoder::peek_next_object() { 511| 25.0k| if(!m_pushed.is_set()) { ------------------ | Branch (511:7): [True: 25.0k, False: 0] ------------------ 512| 25.0k| m_pushed = get_next_object(); 513| 25.0k| } 514| | 515| 25.0k| return m_pushed; 516| 25.0k|} _ZN5Botan11BER_Decoder15get_next_objectEv: 521| 555k|BER_Object BER_Decoder::get_next_object() { 522| 555k| BER_Object next; 523| | 524| 555k| if(m_pushed.is_set()) { ------------------ | Branch (524:7): [True: 56.4k, False: 499k] ------------------ 525| 56.4k| std::swap(next, m_pushed); 526| 56.4k| return next; 527| 56.4k| } 528| | 529| 499k| for(;;) { 530| 499k| ASN1_Type type_tag = ASN1_Type::NoObject; 531| 499k| ASN1_Class class_tag = ASN1_Class::NoObject; 532| 499k| decode_tag(m_source, type_tag, class_tag); 533| 499k| next.set_tagging(type_tag, class_tag); 534| 499k| if(next.is_set() == false) { // no more objects ------------------ | Branch (534:10): [True: 25.0k, False: 474k] ------------------ 535| 25.0k| return next; 536| 25.0k| } 537| | 538| 474k| const size_t allow_indef = m_limits.allow_ber_encoding() ? m_limits.max_nested_indefinite_length() : 0; ------------------ | Branch (538:34): [True: 0, False: 474k] ------------------ 539| 474k| const bool der_mode = m_limits.require_der_encoding(); 540| 474k| 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| 474k| if(type_tag == ASN1_Type::Eoc && class_tag == ASN1_Class::Universal && ------------------ | Branch (545:10): [True: 12.5k, False: 461k] | Branch (545:40): [True: 44, False: 12.5k] ------------------ 546| 44| (dl.content_length() != 0 || dl.indefinite_length())) { ------------------ | Branch (546:11): [True: 37, False: 7] | Branch (546:39): [True: 0, False: 7] ------------------ 547| 37| throw BER_Decoding_Error("EOC marker with non-zero length"); 548| 37| } 549| | 550| 474k| if(const auto max_size = m_limits.max_object_size(); max_size && dl.content_length() > *max_size) { ------------------ | Branch (550:60): [True: 474k, False: 86] | Branch (550:72): [True: 21, False: 474k] ------------------ 551| 21| throw BER_Decoding_Error("Encoded object exceeds maximum size"); 552| 21| } 553| | 554| 474k| if(!m_source->check_available(dl.total_length())) { ------------------ | Branch (554:10): [True: 89, False: 474k] ------------------ 555| 89| throw BER_Decoding_Error("Value truncated"); 556| 89| } 557| | 558| 474k| uint8_t* out = next.mutable_bits(dl.content_length()); 559| 474k| if(m_source->read(out, dl.content_length()) != dl.content_length()) { ------------------ | Branch (559:10): [True: 0, False: 474k] ------------------ 560| 0| throw BER_Decoding_Error("Value truncated"); 561| 0| } 562| | 563| 474k| if(dl.indefinite_length()) { ------------------ | Branch (563:10): [True: 0, False: 474k] ------------------ 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| 474k| if(next.tagging() == static_cast(ASN1_Type::Eoc)) { ------------------ | Branch (571:10): [True: 7, False: 474k] ------------------ 572| 7| if(m_limits.require_der_encoding()) { ------------------ | Branch (572:13): [True: 7, False: 0] ------------------ 573| 7| throw BER_Decoding_Error("Detected EOC marker in DER structure"); 574| 7| } 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| 474k| break; 585| 474k| } 586| | 587| 474k| return next; 588| 499k|} _ZN5Botan11BER_Decoder9push_backEONS_10BER_ObjectE: 612| 56.4k|void BER_Decoder::push_back(BER_Object&& obj) { 613| 56.4k| if(m_pushed.is_set()) { ------------------ | Branch (613:7): [True: 0, False: 56.4k] ------------------ 614| 0| throw Invalid_State("BER_Decoder: Only one push back is allowed"); 615| 0| } 616| 56.4k| m_pushed = std::move(obj); 617| 56.4k|} _ZN5Botan11BER_Decoder10start_consENS_9ASN1_TypeENS_10ASN1_ClassE: 619| 196k|BER_Decoder BER_Decoder::start_cons(ASN1_Type type_tag, ASN1_Class class_tag) { 620| 196k| BER_Object obj = get_next_object(); 621| 196k| 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| 196k| if(m_limits.require_der_encoding() && type_tag == ASN1_Type::Set && class_tag == ASN1_Class::Universal) { ------------------ | Branch (624:7): [True: 196k, False: 374] | Branch (624:42): [True: 38.0k, False: 158k] | Branch (624:72): [True: 38.0k, False: 0] ------------------ 625| 38.0k| verify_set_is_sorted(std::span{obj.bits(), obj.length()}); 626| 38.0k| } 627| | 628| 196k| BER_Decoder child(std::move(obj), this); 629| 196k| return child; 630| 196k|} _ZN5Botan11BER_Decoder8end_consEv: 635| 145k|BER_Decoder& BER_Decoder::end_cons() { 636| 145k| if(m_parent == nullptr) { ------------------ | Branch (636:7): [True: 0, False: 145k] ------------------ 637| 0| throw Invalid_State("BER_Decoder::end_cons called with null parent"); 638| 0| } 639| 145k| if(!m_source->end_of_data() || m_pushed.is_set()) { ------------------ | Branch (639:7): [True: 12, False: 145k] | Branch (639:35): [True: 0, False: 145k] ------------------ 640| 12| throw Decoding_Error("BER_Decoder::end_cons called with data left"); 641| 12| } 642| 145k| return (*m_parent); 643| 145k|} _ZN5Botan11BER_DecoderC2EONS_10BER_ObjectEPS0_: 646| 196k| m_limits(parent != nullptr ? parent->limits() : BER_Decoder::Limits::BER()), m_parent(parent) { ------------------ | Branch (646:16): [True: 196k, False: 0] ------------------ 647| 196k| m_data_src = std::make_unique(std::move(obj)); 648| 196k| m_source = m_data_src.get(); 649| 196k|} _ZN5Botan11BER_DecoderC2ERNS_10DataSourceENS0_6LimitsE: 659| 6.70k|BER_Decoder::BER_Decoder(DataSource& src, Limits limits) : m_limits(limits), m_source(&src) {} _ZN5Botan11BER_DecoderC2ENSt3__14spanIKhLm18446744073709551615EEENS0_6LimitsE: 664| 88.8k|BER_Decoder::BER_Decoder(std::span buf, Limits limits) : m_limits(limits) { 665| 88.8k| m_data_src = std::make_unique(buf); 666| 88.8k| m_source = m_data_src.get(); 667| 88.8k|} _ZN5Botan11BER_Decoder6decodeERNS_11ASN1_ObjectENS_9ASN1_TypeENS_10ASN1_ClassE: 676| 196k|BER_Decoder& BER_Decoder::decode(ASN1_Object& obj, ASN1_Type type_tag, ASN1_Class class_tag) { 677| | // TODO support this case properly 678| 196k| if(type_tag != ASN1_Type::NoObject || class_tag != ASN1_Class::NoObject) { ------------------ | Branch (678:7): [True: 0, False: 196k] | Branch (678:42): [True: 0, False: 196k] ------------------ 679| 0| throw Not_Implemented("BER_Decoder::decode(ASN1_Object) does not support implicit tagged decoding"); 680| 0| } 681| 196k| obj.decode_from(*this); 682| 196k| return (*this); 683| 196k|} _ZN5Botan11BER_Decoder6decodeERbNS_9ASN1_TypeENS_10ASN1_ClassE: 707| 6.26k|BER_Decoder& BER_Decoder::decode(bool& out, ASN1_Type type_tag, ASN1_Class class_tag) { 708| 6.26k| const BER_Object obj = get_next_object(); 709| 6.26k| obj.assert_is_a(type_tag, class_tag); 710| | 711| 6.26k| if(obj.length() != 1) { ------------------ | Branch (711:7): [True: 0, False: 6.26k] ------------------ 712| 0| throw BER_Decoding_Error("BER boolean value had invalid size"); 713| 0| } 714| | 715| 6.26k| const uint8_t val = obj.bits()[0]; 716| | 717| | // DER requires boolean values to be exactly 0x00 or 0xFF 718| 6.26k| if(m_limits.require_der_encoding() && val != 0x00 && val != 0xFF) { ------------------ | Branch (718:7): [True: 6.26k, False: 0] | Branch (718:42): [True: 6.26k, False: 0] | Branch (718:57): [True: 0, False: 6.26k] ------------------ 719| 0| throw BER_Decoding_Error("Detected non-canonical boolean encoding in DER structure"); 720| 0| } 721| | 722| 6.26k| out = (val != 0) ? true : false; ------------------ | Branch (722:10): [True: 6.26k, False: 0] ------------------ 723| | 724| 6.26k| return (*this); 725| 6.26k|} _ZN5Botan11BER_Decoder6decodeERmNS_9ASN1_TypeENS_10ASN1_ClassE: 730| 18.8k|BER_Decoder& BER_Decoder::decode(size_t& out, ASN1_Type type_tag, ASN1_Class class_tag) { 731| 18.8k| BigInt integer; 732| 18.8k| decode(integer, type_tag, class_tag); 733| | 734| 18.8k| if(integer.signum() < 0) { ------------------ | Branch (734:7): [True: 0, False: 18.8k] ------------------ 735| 0| throw BER_Decoding_Error("Decoded small integer value was negative"); 736| 0| } 737| | 738| 18.8k| if(integer.bits() > 32) { ------------------ | Branch (738:7): [True: 0, False: 18.8k] ------------------ 739| 0| throw BER_Decoding_Error("Decoded integer value larger than expected"); 740| 0| } 741| | 742| 18.8k| out = 0; 743| 94.0k| for(size_t i = 0; i != 4; ++i) { ------------------ | Branch (743:22): [True: 75.2k, False: 18.8k] ------------------ 744| 75.2k| out = (out << 8) | integer.byte_at(3 - i); 745| 75.2k| } 746| | 747| 18.8k| return (*this); 748| 18.8k|} _ZN5Botan11BER_Decoder6decodeERNS_6BigIntENS_9ASN1_TypeENS_10ASN1_ClassE: 780| 25.1k|BER_Decoder& BER_Decoder::decode(BigInt& out, ASN1_Type type_tag, ASN1_Class class_tag) { 781| 25.1k| const BER_Object obj = get_next_object(); 782| 25.1k| 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.1k| if(obj.length() == 0) { ------------------ | Branch (785:7): [True: 1, False: 25.1k] ------------------ 786| 1| throw BER_Decoding_Error("INTEGER encoding has no content octets"); 787| 1| } 788| | 789| | // DER requires minimal INTEGER encoding (X.690 section 8.3.2) 790| 25.1k| if(m_limits.require_der_encoding()) { ------------------ | Branch (790:7): [True: 25.1k, False: 42] ------------------ 791| 25.1k| if(obj.length() > 1) { ------------------ | Branch (791:10): [True: 6.31k, False: 18.8k] ------------------ 792| 6.31k| if(obj.bits()[0] == 0x00 && (obj.bits()[1] & 0x80) == 0) { ------------------ | Branch (792:13): [True: 6.28k, False: 39] | Branch (792:38): [True: 1, False: 6.27k] ------------------ 793| 1| throw BER_Decoding_Error("Detected non-minimal INTEGER encoding in DER structure"); 794| 1| } 795| 6.31k| if(obj.bits()[0] == 0xFF && (obj.bits()[1] & 0x80) != 0) { ------------------ | Branch (795:13): [True: 12, False: 6.30k] | Branch (795:38): [True: 2, False: 10] ------------------ 796| 2| throw BER_Decoding_Error("Detected non-minimal INTEGER encoding in DER structure"); 797| 2| } 798| 6.31k| } 799| 25.1k| } 800| | 801| 25.1k| out = ASN1::integer_from_contents(obj.data()); 802| | 803| 25.1k| return (*this); 804| 25.1k|} _ZN5Botan4ASN121integer_from_contentsENSt3__14spanIKhLm18446744073709551615EEE: 806| 25.1k|BigInt ASN1::integer_from_contents(std::span contents) { 807| 25.1k| if(contents.empty()) { ------------------ | Branch (807:7): [True: 0, False: 25.1k] ------------------ 808| 0| throw BER_Decoding_Error("INTEGER encoding has no content octets"); 809| 0| } 810| | 811| 25.1k| BigInt out; 812| | 813| 25.1k| const bool negative = (contents[0] & 0x80) == 0x80; 814| | 815| 25.1k| if(negative) { ------------------ | Branch (815:7): [True: 21, False: 25.0k] ------------------ 816| 21| secure_vector vec(contents.begin(), contents.end()); 817| 41| for(size_t i = vec.size(); i > 0; --i) { ------------------ | Branch (817:34): [True: 41, False: 0] ------------------ 818| 41| const bool gt0 = (vec[i - 1] > 0); 819| 41| vec[i - 1] -= 1; 820| 41| if(gt0) { ------------------ | Branch (820:13): [True: 21, False: 20] ------------------ 821| 21| break; 822| 21| } 823| 41| } 824| 93| for(auto& byte : vec) { ------------------ | Branch (824:22): [True: 93, False: 21] ------------------ 825| 93| byte = ~byte; 826| 93| } 827| 21| out._assign_from_bytes(vec); 828| 21| out.set_sign(BigInt::Negative); 829| 25.0k| } else { 830| 25.0k| out._assign_from_bytes(contents); 831| 25.0k| } 832| | 833| 25.1k| return out; 834| 25.1k|} _ZN5Botan11BER_Decoder23decode_into_byte_vectorERNSt3__16vectorIhNS_16secure_allocatorIhEEEENS_9ASN1_TypeES7_NS_10ASN1_ClassE: 1026| 12.5k| ASN1_Class class_tag) { 1027| 12.5k| if(real_type != ASN1_Type::OctetString && real_type != ASN1_Type::BitString) { ------------------ | Branch (1027:7): [True: 0, False: 12.5k] | Branch (1027:46): [True: 0, False: 0] ------------------ 1028| 0| throw BER_Bad_Tag("Bad tag for {BIT,OCTET} STRING", static_cast(real_type)); 1029| 0| } 1030| | 1031| 12.5k| asn1_decode_binary_string(buffer, get_next_object(), real_type, type_tag, class_tag, m_limits); 1032| 12.5k| return (*this); 1033| 12.5k|} _ZN5Botan11BER_Decoder23decode_into_byte_vectorERNSt3__16vectorIhNS1_9allocatorIhEEEENS_9ASN1_TypeES7_NS_10ASN1_ClassE: 1038| 37.6k| ASN1_Class class_tag) { 1039| 37.6k| if(real_type != ASN1_Type::OctetString && real_type != ASN1_Type::BitString) { ------------------ | Branch (1039:7): [True: 0, False: 37.6k] | Branch (1039:46): [True: 0, False: 0] ------------------ 1040| 0| throw BER_Bad_Tag("Bad tag for {BIT,OCTET} STRING", static_cast(real_type)); 1041| 0| } 1042| | 1043| 37.6k| asn1_decode_binary_string(buffer, get_next_object(), real_type, type_tag, class_tag, m_limits); 1044| 37.6k| return (*this); 1045| 37.6k|} _ZN5Botan11BER_Decoder16decode_bitstringERNS_14ASN1_BitStringENS_9ASN1_TypeENS_10ASN1_ClassE: 1047| 18.9k|BER_Decoder& BER_Decoder::decode_bitstring(ASN1_BitString& out, ASN1_Type type_tag, ASN1_Class class_tag) { 1048| 18.9k| const BER_Object obj = get_next_object(); 1049| | 1050| 18.9k| std::vector bits; 1051| 18.9k| uint8_t unused_bits = 0; 1052| | 1053| 18.9k| if(is_constructed(obj.class_tag())) { ------------------ | Branch (1053:7): [True: 3, False: 18.9k] ------------------ 1054| 3| obj.assert_is_a(type_tag, class_tag | ASN1_Class::Constructed); 1055| 3| if(m_limits.require_der_encoding()) { ------------------ | Branch (1055:10): [True: 2, False: 1] ------------------ 1056| 2| throw BER_Decoding_Error("Detected constructed string encoding in DER structure"); 1057| 2| } 1058| 1| bits.reserve(obj.length()); // upper possible bound on the output size 1059| 1| unused_bits = asn1_concat_constructed_bit_string(bits, obj, m_limits, 0); 1060| 18.9k| } else { 1061| 18.9k| unused_bits = asn1_bitstring_unused_bits(obj, type_tag, class_tag, m_limits.require_der_encoding()); 1062| 18.9k| bits.assign(obj.bits() + 1, obj.bits() + obj.length()); 1063| 18.9k| } 1064| | 1065| 18.9k| if(unused_bits > 0 && !bits.empty()) { ------------------ | Branch (1065:7): [True: 3, False: 18.9k] | Branch (1065:26): [True: 3, False: 0] ------------------ 1066| 3| bits.back() &= static_cast(0xFF << unused_bits); 1067| 3| } 1068| | 1069| 18.9k| out = ASN1_BitString(std::move(bits), unused_bits); 1070| 18.9k| return (*this); 1071| 18.9k|} _ZN5Botan4ASN120is_single_der_objectENSt3__14spanIKhLm18446744073709551615EEENS_9ASN1_TypeENS_10ASN1_ClassE: 1105| 25.3k|bool is_single_der_object(std::span bytes, ASN1_Type expected_type, ASN1_Class expected_class) { 1106| 25.3k| if(bytes.empty()) { ------------------ | Branch (1106:7): [True: 0, False: 25.3k] ------------------ 1107| 0| return false; 1108| 0| } 1109| | 1110| 25.3k| try { 1111| 25.3k| DataSource_Span src(bytes); 1112| | 1113| 25.3k| ASN1_Type type_tag = ASN1_Type::NoObject; 1114| 25.3k| ASN1_Class class_tag = ASN1_Class::NoObject; 1115| 25.3k| const size_t tag_bytes = decode_tag(&src, type_tag, class_tag); 1116| | 1117| 25.3k| if(type_tag != expected_type || class_tag != expected_class) { ------------------ | Branch (1117:10): [True: 12.7k, False: 12.5k] | Branch (1117:39): [True: 2, False: 12.5k] ------------------ 1118| 12.7k| return false; 1119| 12.7k| } 1120| | 1121| 12.5k| const auto dl = decode_length(&src, /*allow_indef=*/0, /*der_mode=*/true, is_constructed(expected_class)); 1122| | 1123| 12.5k| const size_t header_bytes = tag_bytes + dl.field_length(); 1124| 12.5k| if(header_bytes > bytes.size()) { ------------------ | Branch (1124:10): [True: 0, False: 12.5k] ------------------ 1125| 0| return false; 1126| 0| } 1127| 12.5k| return dl.content_length() == bytes.size() - header_bytes; 1128| 12.5k| } catch(Decoding_Error&) { 1129| 23| return false; 1130| 23| } 1131| 25.3k|} _ZN5Botan4ASN122is_der_sequence_headerENSt3__14spanIKhLm18446744073709551615EEE: 1133| 12.6k|bool is_der_sequence_header(std::span bytes) { 1134| 12.6k| return is_single_der_object(bytes, ASN1_Type::Sequence, ASN1_Class::Universal | ASN1_Class::Constructed); 1135| 12.6k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_110decode_tagEPNS_10DataSourceERNS_9ASN1_TypeERNS_10ASN1_ClassE: 29| 524k|size_t decode_tag(DataSource* ber, ASN1_Type& type_tag, ASN1_Class& class_tag) { 30| 524k| auto b = ber->read_byte(); 31| | 32| 524k| if(!b) { ------------------ | Branch (32:7): [True: 25.0k, False: 499k] ------------------ 33| 25.0k| type_tag = ASN1_Type::NoObject; 34| 25.0k| class_tag = ASN1_Class::NoObject; 35| 25.0k| return 0; 36| 25.0k| } 37| | 38| 499k| if((*b & 0x1F) != 0x1F) { ------------------ | Branch (38:7): [True: 499k, False: 372] ------------------ 39| 499k| type_tag = ASN1_Type(*b & 0x1F); 40| 499k| 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| 499k| if(type_tag == ASN1_Type::Eoc && class_tag == ASN1_Class::Constructed) { ------------------ | Branch (44:10): [True: 12.6k, False: 486k] | Branch (44:40): [True: 4, False: 12.6k] ------------------ 45| 4| throw BER_Decoding_Error("EOC tag with constructed encoding"); 46| 4| } 47| 499k| return 1; 48| 499k| } 49| | 50| 372| size_t tag_bytes = 1; 51| 372| class_tag = ASN1_Class(*b & 0xE0); 52| | 53| 372| uint32_t tag_buf = 0; 54| 1.35k| while(true) { ------------------ | Branch (54:10): [True: 1.35k, Folded] ------------------ 55| 1.35k| b = ber->read_byte(); 56| 1.35k| if(!b) { ------------------ | Branch (56:10): [True: 15, False: 1.34k] ------------------ 57| 15| throw BER_Decoding_Error("Long-form tag truncated"); 58| 15| } 59| | // Reject if shifting in another 7 bits would overflow the uint32_t tag 60| 1.34k| if((tag_buf >> 25) != 0) { ------------------ | Branch (60:10): [True: 11, False: 1.33k] ------------------ 61| 11| throw BER_Decoding_Error("Long-form tag overflowed 32 bits"); 62| 11| } 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| 1.33k| if(tag_bytes == 1 && (*b & 0x7F) == 0) { ------------------ | Branch (67:10): [True: 360, False: 973] | Branch (67:28): [True: 5, False: 355] ------------------ 68| 5| throw BER_Decoding_Error("Long form tag with leading zero"); 69| 5| } 70| 1.32k| ++tag_bytes; 71| 1.32k| tag_buf = (tag_buf << 7) | (*b & 0x7F); 72| 1.32k| if((*b & 0x80) == 0) { ------------------ | Branch (72:10): [True: 341, False: 987] ------------------ 73| 341| break; 74| 341| } 75| 1.32k| } 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| 341| if(tag_buf <= 30) { ------------------ | Branch (79:7): [True: 9, False: 332] ------------------ 80| 9| throw BER_Decoding_Error("Long-form tag encoding used for small tag value"); 81| 9| } 82| | 83| 332| if(tag_buf == static_cast(ASN1_Type::NoObject)) { ------------------ | Branch (83:7): [True: 4, False: 328] ------------------ 84| 4| throw BER_Decoding_Error("Tag value collides with internal sentinel"); 85| 4| } 86| | 87| | // NOLINTNEXTLINE(clang-analyzer-optin.core.EnumCastOutOfRange) 88| 328| type_tag = ASN1_Type(tag_buf); 89| 328| return tag_bytes; 90| 332|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_113decode_lengthEPNS_10DataSourceEmbb: 135| 486k|BerDecodedLength decode_length(DataSource* ber, size_t allow_indef, bool der_mode, bool constructed) { 136| 486k| uint8_t b = 0; 137| 486k| if(ber->read_byte(b) == 0) { ------------------ | Branch (137:7): [True: 39, False: 486k] ------------------ 138| 39| throw BER_Decoding_Error("Length field not found"); 139| 39| } 140| 486k| if((b & 0x80) == 0) { ------------------ | Branch (140:7): [True: 467k, False: 18.9k] ------------------ 141| 467k| return BerDecodedLength(b, 1); 142| 467k| } 143| | 144| 18.9k| const size_t num_length_bytes = (b & 0x7F); 145| 18.9k| if(num_length_bytes > 4) { ------------------ | Branch (145:7): [True: 10, False: 18.9k] ------------------ 146| 10| throw BER_Decoding_Error("Length field is too large"); 147| 10| } 148| | 149| 18.9k| const size_t field_size = 1 + num_length_bytes; 150| | 151| 18.9k| if(num_length_bytes == 0) { ------------------ | Branch (151:7): [True: 8, False: 18.9k] ------------------ 152| 8| if(der_mode) { ------------------ | Branch (152:10): [True: 8, False: 0] ------------------ 153| 8| throw BER_Decoding_Error("Detected indefinite-length encoding in DER structure"); 154| 8| } 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| 8| } 169| | 170| 18.9k| size_t length = 0; 171| | 172| 50.7k| for(size_t i = 0; i != num_length_bytes; ++i) { ------------------ | Branch (172:22): [True: 31.8k, False: 18.9k] ------------------ 173| 31.8k| if(ber->read_byte(b) == 0) { ------------------ | Branch (173:10): [True: 2, False: 31.8k] ------------------ 174| 2| throw BER_Decoding_Error("Corrupted length field"); 175| 2| } 176| | // Can't overflow since we already checked that num_length_bytes <= 4 177| 31.8k| length = (length << 8) | b; 178| 31.8k| } 179| | 180| | // DER requires shortest possible length encoding 181| 18.9k| if(der_mode) { ------------------ | Branch (181:7): [True: 18.9k, False: 0] ------------------ 182| 18.9k| if(length < 128) { ------------------ | Branch (182:10): [True: 1, False: 18.9k] ------------------ 183| 1| throw BER_Decoding_Error("Detected non-canonical length encoding in DER structure"); 184| 1| } 185| 18.9k| if(num_length_bytes > 1 && length < (size_t(1) << ((num_length_bytes - 1) * 8))) { ------------------ | Branch (185:10): [True: 12.6k, False: 6.28k] | Branch (185:34): [True: 1, False: 12.6k] ------------------ 186| 1| throw BER_Decoding_Error("Detected non-canonical length encoding in DER structure"); 187| 1| } 188| 18.9k| } 189| | 190| 18.9k| return BerDecodedLength(length, field_size); 191| 18.9k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_116BerDecodedLengthC2Emm: 108| 486k| BerDecodedLength(content_length, field_length, false) {} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_116BerDecodedLengthC2Emmb: 125| 486k| 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| 38.6k|size_t peek_tag(const DataSource* src, size_t offset, ASN1_Type& type_tag, ASN1_Class& class_tag) { 198| 38.6k| uint8_t b = 0; 199| 38.6k| if(src->peek(&b, 1, offset) == 0) { ------------------ | Branch (199:7): [True: 0, False: 38.6k] ------------------ 200| 0| type_tag = ASN1_Type::NoObject; 201| 0| class_tag = ASN1_Class::NoObject; 202| 0| return 0; 203| 0| } 204| | 205| 38.6k| if((b & 0x1F) != 0x1F) { ------------------ | Branch (205:7): [True: 38.5k, False: 87] ------------------ 206| 38.5k| type_tag = ASN1_Type(b & 0x1F); 207| 38.5k| 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| 38.5k| if(type_tag == ASN1_Type::Eoc && class_tag == ASN1_Class::Constructed) { ------------------ | Branch (211:10): [True: 125, False: 38.3k] | Branch (211:40): [True: 1, False: 124] ------------------ 212| 1| throw BER_Decoding_Error("EOC tag with constructed encoding"); 213| 1| } 214| 38.5k| return 1; 215| 38.5k| } 216| | 217| 87| class_tag = ASN1_Class(b & 0xE0); 218| 87| size_t tag_bytes = 1; 219| 87| uint32_t tag_buf = 0; 220| | 221| 302| while(true) { ------------------ | Branch (221:10): [True: 302, Folded] ------------------ 222| 302| if(src->peek(&b, 1, offset + tag_bytes) == 0) { ------------------ | Branch (222:10): [True: 1, False: 301] ------------------ 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| 301| if((tag_buf >> 25) != 0) { ------------------ | Branch (226:10): [True: 9, False: 292] ------------------ 227| 9| throw BER_Decoding_Error("Long-form tag overflowed 32 bits"); 228| 9| } 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| 292| if(tag_bytes == 1 && (b & 0x7F) == 0) { ------------------ | Branch (233:10): [True: 87, False: 205] | Branch (233:28): [True: 2, False: 85] ------------------ 234| 2| throw BER_Decoding_Error("Long form tag with leading zero"); 235| 2| } 236| 290| ++tag_bytes; 237| 290| tag_buf = (tag_buf << 7) | (b & 0x7F); 238| 290| if((b & 0x80) == 0) { ------------------ | Branch (238:10): [True: 75, False: 215] ------------------ 239| 75| break; 240| 75| } 241| 290| } 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| 75| if(tag_buf <= 30) { ------------------ | Branch (246:7): [True: 4, False: 71] ------------------ 247| 4| throw BER_Decoding_Error("Long-form tag encoding used for small tag value"); 248| 4| } 249| | 250| 71| if(tag_buf == static_cast(ASN1_Type::NoObject)) { ------------------ | Branch (250:7): [True: 1, False: 70] ------------------ 251| 1| throw BER_Decoding_Error("Tag value collides with internal sentinel"); 252| 1| } 253| | 254| | // NOLINTNEXTLINE(clang-analyzer-optin.core.EnumCastOutOfRange) 255| 70| type_tag = ASN1_Type(tag_buf); 256| 70| return tag_bytes; 257| 71|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_111peek_lengthEPNS_10DataSourceEmRmmbb: 265| 38.5k| DataSource* src, size_t offset, size_t& field_size, size_t allow_indef, bool constructed, bool der_mode) { 266| 38.5k| uint8_t b = 0; 267| 38.5k| if(src->peek(&b, 1, offset) == 0) { ------------------ | Branch (267:7): [True: 1, False: 38.5k] ------------------ 268| 1| throw BER_Decoding_Error("Length field not found"); 269| 1| } 270| | 271| 38.5k| field_size = 1; 272| 38.5k| if((b & 0x80) == 0) { ------------------ | Branch (272:7): [True: 38.5k, False: 76] ------------------ 273| 38.5k| return b; 274| 38.5k| } 275| | 276| 76| const size_t num_length_bytes = (b & 0x7F); 277| 76| field_size += num_length_bytes; 278| 76| if(field_size > 5) { ------------------ | Branch (278:7): [True: 16, False: 60] ------------------ 279| 16| throw BER_Decoding_Error("Length field is too large"); 280| 16| } 281| | 282| 60| if(num_length_bytes == 0) { ------------------ | Branch (282:7): [True: 1, False: 59] ------------------ 283| | // Indefinite length is not allowed in DER 284| 1| if(der_mode) { ------------------ | Branch (284:10): [True: 1, False: 0] ------------------ 285| 1| throw BER_Decoding_Error("Detected indefinite-length encoding in DER structure"); 286| 1| } 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| 59| size_t length = 0; 298| 242| for(size_t i = 0; i < num_length_bytes; ++i) { ------------------ | Branch (298:22): [True: 184, False: 58] ------------------ 299| 184| if(src->peek(&b, 1, offset + 1 + i) == 0) { ------------------ | Branch (299:10): [True: 1, False: 183] ------------------ 300| 1| throw BER_Decoding_Error("Corrupted length field"); 301| 1| } 302| 183| if(get_byte<0>(length) != 0) { ------------------ | Branch (302:10): [True: 0, False: 183] ------------------ 303| 0| throw BER_Decoding_Error("Field length overflow"); 304| 0| } 305| 183| length = (length << 8) | b; 306| 183| } 307| 58| return length; 308| 59|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_114is_constructedENS_10ASN1_ClassE: 22| 613k|bool is_constructed(ASN1_Class class_tag) { 23| 613k| return (static_cast(class_tag) & static_cast(ASN1_Class::Constructed)) != 0; 24| 613k|} ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_116BerDecodedLength14content_lengthEv: 114| 1.90M| size_t content_length() const { return m_content_length; } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_116BerDecodedLength17indefinite_lengthEv: 121| 473k| bool indefinite_length() const { return m_indefinite; } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_116BerDecodedLength12total_lengthEv: 117| 474k| size_t total_length() const { return m_indefinite ? m_content_length + 2 : m_content_length; } ------------------ | Branch (117:44): [True: 0, False: 474k] ------------------ ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120verify_set_is_sortedENSt3__14spanIKhLm18446744073709551615EEE: 426| 38.0k|void verify_set_is_sorted(std::span content) { 427| 38.0k| DataSource_Span src(content); 428| 38.0k| size_t offset = 0; 429| 38.0k| std::optional> prev; 430| | 431| 76.5k| while(offset < content.size()) { ------------------ | Branch (431:10): [True: 38.6k, False: 37.9k] ------------------ 432| 38.6k| ASN1_Type type_tag = ASN1_Type::NoObject; 433| 38.6k| ASN1_Class class_tag = ASN1_Class::NoObject; 434| 38.6k| const size_t tag_size = peek_tag(&src, offset, type_tag, class_tag); 435| | 436| 38.6k| size_t length_size = 0; 437| 38.6k| const size_t item_size = 438| 38.6k| peek_length(&src, offset + tag_size, length_size, /*allow_indef=*/0, is_constructed(class_tag), true); 439| | 440| 38.6k| const auto end = checked_add(offset, tag_size, length_size, item_size); 441| 38.6k| if(!end || *end > content.size()) { ------------------ | Branch (441:10): [True: 37, False: 38.5k] | Branch (441:18): [True: 63, False: 38.5k] ------------------ 442| 63| throw BER_Decoding_Error("SET element exceeds available data"); 443| 63| } 444| | 445| 38.5k| const auto elem = content.subspan(offset, *end - offset); 446| 38.5k| if(prev && std::lexicographical_compare(elem.begin(), elem.end(), prev->begin(), prev->end())) { ------------------ | Branch (446:10): [True: 500, False: 38.0k] | Branch (446:18): [True: 66, False: 434] ------------------ 447| 66| throw BER_Decoding_Error("Detected unsorted SET in DER structure"); 448| 66| } 449| 38.4k| prev = elem; 450| 38.4k| offset = *end; 451| 38.4k| } 452| 38.0k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_126asn1_bitstring_unused_bitsERKNS_10BER_ObjectENS_9ASN1_TypeENS_10ASN1_ClassEb: 990| 18.9k|uint8_t asn1_bitstring_unused_bits(const BER_Object& obj, ASN1_Type type_tag, ASN1_Class class_tag, bool require_der) { 991| 18.9k| obj.assert_is_a(type_tag, class_tag); 992| 18.9k| BOTAN_ASSERT_NOMSG(!is_constructed(obj)); ------------------ | | 84| 18.9k| do { \ | | 85| 18.9k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 18.9k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 18.9k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 18.9k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 18.9k] | | ------------------ ------------------ 993| | 994| 18.9k| if(obj.length() == 0) { ------------------ | Branch (994:7): [True: 1, False: 18.9k] ------------------ 995| 1| throw BER_Decoding_Error("Invalid BIT STRING"); 996| 1| } 997| | 998| 18.9k| const uint8_t unused_bits = obj.bits()[0]; 999| | 1000| 18.9k| if(unused_bits >= 8) { ------------------ | Branch (1000:7): [True: 4, False: 18.9k] ------------------ 1001| 4| throw BER_Decoding_Error("Invalid number of unused bits in BIT STRING"); 1002| 4| } 1003| | 1004| 18.9k| if(obj.length() == 1 && unused_bits != 0) { ------------------ | Branch (1004:7): [True: 3, False: 18.9k] | Branch (1004:28): [True: 1, False: 2] ------------------ 1005| 1| throw BER_Decoding_Error("Invalid BIT STRING"); 1006| 1| } 1007| | 1008| 18.9k| if(require_der && unused_bits > 0) { ------------------ | Branch (1008:7): [True: 18.9k, False: 1] | Branch (1008:22): [True: 5, False: 18.9k] ------------------ 1009| 5| const uint8_t last_byte = obj.bits()[obj.length() - 1]; 1010| 5| if((last_byte & ((1 << unused_bits) - 1)) != 0) { ------------------ | Branch (1010:10): [True: 2, False: 3] ------------------ 1011| 2| throw BER_Decoding_Error("Detected non-zero padding bits in BIT STRING in DER structure"); 1012| 2| } 1013| 5| } 1014| | 1015| 18.9k| return unused_bits; 1016| 18.9k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_114is_constructedERKNS_10BER_ObjectE: 838| 69.0k|bool is_constructed(const BER_Object& obj) { 839| 69.0k| return is_constructed(obj.class_tag()); 840| 69.0k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_115DataSource_SpanC2ENSt3__14spanIKhLm18446744073709551615EEE: 414| 63.3k| explicit DataSource_Span(std::span buf) : m_buf(buf) {} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_115DataSource_Span4readEPhm: 392| 38.3k| size_t read(uint8_t out[], size_t length) override { 393| 38.3k| const size_t got = std::min(m_buf.size() - m_offset, length); 394| 38.3k| copy_mem(out, m_buf.data() + m_offset, got); 395| 38.3k| m_offset += got; 396| 38.3k| return got; 397| 38.3k| } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_115DataSource_Span4peekEPhmm: 399| 77.6k| size_t peek(uint8_t out[], size_t length, size_t peek_offset) const override { 400| 77.6k| if(peek_offset >= m_buf.size() - m_offset) { ------------------ | Branch (400:13): [True: 3, False: 77.6k] ------------------ 401| 3| return 0; 402| 3| } 403| 77.6k| const size_t got = std::min(m_buf.size() - m_offset - peek_offset, length); 404| 77.6k| copy_mem(out, m_buf.data() + m_offset + peek_offset, got); 405| 77.6k| return got; 406| 77.6k| } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_116BerDecodedLength12field_lengthEv: 119| 12.5k| size_t field_length() const { return m_field_length; } ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObjectC2EONS_10BER_ObjectE: 379| 196k| explicit DataSource_BERObject(BER_Object&& obj) : m_obj(std::move(obj)) {} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObject4readEPhm: 349| 1.06M| size_t read(uint8_t out[], size_t length) override { 350| 1.06M| BOTAN_ASSERT_NOMSG(m_offset <= m_obj.length()); ------------------ | | 84| 1.06M| do { \ | | 85| 1.06M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 1.06M| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 1.06M] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 1.06M| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 1.06M] | | ------------------ ------------------ 351| 1.06M| const size_t got = std::min(m_obj.length() - m_offset, length); 352| 1.06M| copy_mem(out, m_obj.bits() + m_offset, got); 353| 1.06M| m_offset += got; 354| 1.06M| return got; 355| 1.06M| } ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObject15check_availableEm: 370| 303k| bool check_available(size_t n) override { 371| 303k| BOTAN_ASSERT_NOMSG(m_offset <= m_obj.length()); ------------------ | | 84| 303k| do { \ | | 85| 303k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 303k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 303k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 303k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 303k] | | ------------------ ------------------ 372| 303k| return (n <= (m_obj.length() - m_offset)); 373| 303k| } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_120DataSource_BERObject11end_of_dataEv: 375| 271k| bool end_of_data() const override { return get_bytes_read() == m_obj.length(); } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_120DataSource_BERObject14get_bytes_readEv: 377| 271k| size_t get_bytes_read() const override { return m_offset; } ber_dec.cpp:_ZN5Botan12_GLOBAL__N_125asn1_decode_binary_stringINS_16secure_allocatorIhEEEEvRNSt3__16vectorIhT_EERKNS_10BER_ObjectENS_9ASN1_TypeESC_NS_10ASN1_ClassERKNS_11BER_Decoder6LimitsE: 932| 12.5k| 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| 12.5k| if(is_constructed(obj)) { ------------------ | Branch (935:7): [True: 0, False: 12.5k] ------------------ 936| 0| obj.assert_is_a(type_tag, class_tag | ASN1_Class::Constructed); 937| | 938| 0| if(limits.require_der_encoding()) { ------------------ | Branch (938:10): [True: 0, False: 0] ------------------ 939| 0| throw BER_Decoding_Error("Detected constructed string encoding in DER structure"); 940| 0| } 941| | 942| | // Concatenate into a temporary so a failed decode leaves buffer unmodified 943| 0| std::vector concat; 944| 0| concat.reserve(obj.length()); // upper possible bound on the output size 945| 0| if(real_type == ASN1_Type::OctetString) { ------------------ | Branch (945:10): [True: 0, False: 0] ------------------ 946| 0| asn1_concat_constructed_octet_string(concat, obj, limits, 0); 947| 0| } else { 948| 0| asn1_concat_constructed_bit_string(concat, obj, limits, 0); 949| 0| } 950| 0| buffer = std::move(concat); 951| 0| return; 952| 0| } 953| | 954| 12.5k| obj.assert_is_a(type_tag, class_tag); 955| | 956| 12.5k| if(real_type == ASN1_Type::OctetString) { ------------------ | Branch (956:7): [True: 12.5k, False: 0] ------------------ 957| 12.5k| buffer.assign(obj.bits(), obj.bits() + obj.length()); 958| 12.5k| } else { 959| 0| if(obj.length() == 0) { ------------------ | Branch (959:10): [True: 0, False: 0] ------------------ 960| 0| throw BER_Decoding_Error("Invalid BIT STRING"); 961| 0| } 962| | 963| 0| const uint8_t unused_bits = obj.bits()[0]; 964| | 965| 0| if(unused_bits >= 8) { ------------------ | Branch (965:10): [True: 0, False: 0] ------------------ 966| 0| throw BER_Decoding_Error("Bad number of unused bits in BIT STRING"); 967| 0| } 968| | 969| | // Empty BIT STRING with unused bits > 0 ... 970| 0| if(unused_bits > 0 && obj.length() < 2) { ------------------ | Branch (970:10): [True: 0, False: 0] | Branch (970:29): [True: 0, False: 0] ------------------ 971| 0| throw BER_Decoding_Error("Invalid BIT STRING"); 972| 0| } 973| | 974| | // DER requires unused bits in BIT STRING to be zero (X.690 section 11.2.2) 975| 0| if(limits.require_der_encoding() && unused_bits > 0) { ------------------ | Branch (975:10): [True: 0, False: 0] | Branch (975:43): [True: 0, False: 0] ------------------ 976| 0| const uint8_t last_byte = obj.bits()[obj.length() - 1]; 977| 0| if((last_byte & ((1 << unused_bits) - 1)) != 0) { ------------------ | Branch (977:13): [True: 0, False: 0] ------------------ 978| 0| throw BER_Decoding_Error("Detected non-zero padding bits in BIT STRING in DER structure"); 979| 0| } 980| 0| } 981| | 982| 0| buffer.resize(obj.length() - 1); 983| | 984| 0| if(obj.length() > 1) { ------------------ | Branch (984:10): [True: 0, False: 0] ------------------ 985| 0| copy_mem(buffer.data(), obj.bits() + 1, obj.length() - 1); 986| 0| } 987| 0| } 988| 12.5k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_125asn1_decode_binary_stringINSt3__19allocatorIhEEEEvRNS2_6vectorIhT_EERKNS_10BER_ObjectENS_9ASN1_TypeESC_NS_10ASN1_ClassERKNS_11BER_Decoder6LimitsE: 932| 37.6k| 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| 37.6k| if(is_constructed(obj)) { ------------------ | Branch (935:7): [True: 0, False: 37.6k] ------------------ 936| 0| obj.assert_is_a(type_tag, class_tag | ASN1_Class::Constructed); 937| | 938| 0| if(limits.require_der_encoding()) { ------------------ | Branch (938:10): [True: 0, False: 0] ------------------ 939| 0| throw BER_Decoding_Error("Detected constructed string encoding in DER structure"); 940| 0| } 941| | 942| | // Concatenate into a temporary so a failed decode leaves buffer unmodified 943| 0| std::vector concat; 944| 0| concat.reserve(obj.length()); // upper possible bound on the output size 945| 0| if(real_type == ASN1_Type::OctetString) { ------------------ | Branch (945:10): [True: 0, False: 0] ------------------ 946| 0| asn1_concat_constructed_octet_string(concat, obj, limits, 0); 947| 0| } else { 948| 0| asn1_concat_constructed_bit_string(concat, obj, limits, 0); 949| 0| } 950| 0| buffer = std::move(concat); 951| 0| return; 952| 0| } 953| | 954| 37.6k| obj.assert_is_a(type_tag, class_tag); 955| | 956| 37.6k| if(real_type == ASN1_Type::OctetString) { ------------------ | Branch (956:7): [True: 37.6k, False: 0] ------------------ 957| 37.6k| buffer.assign(obj.bits(), obj.bits() + obj.length()); 958| 37.6k| } else { 959| 0| if(obj.length() == 0) { ------------------ | Branch (959:10): [True: 0, False: 0] ------------------ 960| 0| throw BER_Decoding_Error("Invalid BIT STRING"); 961| 0| } 962| | 963| 0| const uint8_t unused_bits = obj.bits()[0]; 964| | 965| 0| if(unused_bits >= 8) { ------------------ | Branch (965:10): [True: 0, False: 0] ------------------ 966| 0| throw BER_Decoding_Error("Bad number of unused bits in BIT STRING"); 967| 0| } 968| | 969| | // Empty BIT STRING with unused bits > 0 ... 970| 0| if(unused_bits > 0 && obj.length() < 2) { ------------------ | Branch (970:10): [True: 0, False: 0] | Branch (970:29): [True: 0, False: 0] ------------------ 971| 0| throw BER_Decoding_Error("Invalid BIT STRING"); 972| 0| } 973| | 974| | // DER requires unused bits in BIT STRING to be zero (X.690 section 11.2.2) 975| 0| if(limits.require_der_encoding() && unused_bits > 0) { ------------------ | Branch (975:10): [True: 0, False: 0] | Branch (975:43): [True: 0, False: 0] ------------------ 976| 0| const uint8_t last_byte = obj.bits()[obj.length() - 1]; 977| 0| if((last_byte & ((1 << unused_bits) - 1)) != 0) { ------------------ | Branch (977:13): [True: 0, False: 0] ------------------ 978| 0| throw BER_Decoding_Error("Detected non-zero padding bits in BIT STRING in DER structure"); 979| 0| } 980| 0| } 981| | 982| 0| buffer.resize(obj.length() - 1); 983| | 984| 0| if(obj.length() > 1) { ------------------ | Branch (984:10): [True: 0, False: 0] ------------------ 985| 0| copy_mem(buffer.data(), obj.bits() + 1, obj.length() - 1); 986| 0| } 987| 0| } 988| 37.6k|} _ZN5Botan4ASN119der_sequence_headerEm: 71| 18.8k|std::vector der_sequence_header(size_t contents_len) { 72| 18.8k| std::vector header; 73| 18.8k| header.reserve(2 + sizeof(contents_len)); 74| 18.8k| encode_tag(header, ASN1_Type::Sequence, ASN1_Class::Constructed); 75| 18.8k| encode_length(header, contents_len); 76| 18.8k| return header; 77| 18.8k|} _ZN5Botan11DER_EncoderC2ERNSt3__16vectorIhNS1_9allocatorIhEEEE: 89| 67.4k|DER_Encoder::DER_Encoder(std::vector& vec) { 90| 67.4k| m_append_output = [&vec](const uint8_t b[], size_t l) { 91| 67.4k| if(l > 0) { 92| 67.4k| vec.insert(vec.end(), b, b + l); 93| 67.4k| } 94| 67.4k| }; 95| 67.4k|} _ZN5Botan11DER_Encoder12DER_Sequence13push_contentsERS0_: 100| 100k|void DER_Encoder::DER_Sequence::push_contents(DER_Encoder& der) { 101| 100k| const auto real_class_tag = m_class_tag | ASN1_Class::Constructed; 102| | 103| 100k| if(m_sort_contents) { ------------------ | Branch (103:7): [True: 0, False: 100k] ------------------ 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| 100k| der.add_object(m_type_tag, real_class_tag, m_contents.data(), m_contents.size()); 112| 100k| m_contents.clear(); 113| 100k|} _ZN5Botan11DER_Encoder12DER_Sequence9add_bytesEPKhm: 118| 47.4k|void DER_Encoder::DER_Sequence::add_bytes(const uint8_t data[], size_t length) { 119| 47.4k| if(m_sort_contents) { ------------------ | Branch (119:7): [True: 0, False: 47.4k] ------------------ 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| 47.4k| } else { 126| 47.4k| m_contents += std::make_pair(data, length); 127| 47.4k| } 128| 47.4k|} _ZN5Botan11DER_Encoder12DER_Sequence9add_bytesEPKhmS3_m: 130| 129k|void DER_Encoder::DER_Sequence::add_bytes(const uint8_t hdr[], size_t hdr_len, const uint8_t val[], size_t val_len) { 131| 129k| if(m_sort_contents) { ------------------ | Branch (131:7): [True: 0, False: 129k] ------------------ 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| 129k| } else { 138| 129k| m_contents += std::make_pair(hdr, hdr_len); 139| 129k| m_contents += std::make_pair(val, val_len); 140| 129k| } 141| 129k|} _ZN5Botan11DER_Encoder12DER_SequenceC2ENS_9ASN1_TypeENS_10ASN1_ClassEb: 154| 100k| m_type_tag(type_tag), 155| 100k| m_class_tag(class_tag), 156| 100k| m_sort_contents(sort_contents || (type_tag == ASN1_Type::Set && class_tag == ASN1_Class::Universal)) {} ------------------ | Branch (156:23): [True: 0, False: 100k] | Branch (156:41): [True: 0, False: 100k] | Branch (156:71): [True: 0, False: 0] ------------------ _ZN5Botan11DER_Encoder10start_consENS_9ASN1_TypeENS_10ASN1_ClassE: 192| 100k|DER_Encoder& DER_Encoder::start_cons(ASN1_Type type_tag, ASN1_Class class_tag) { 193| 100k| return start_cons(type_tag, class_tag, false); 194| 100k|} _ZN5Botan11DER_Encoder10start_consENS_9ASN1_TypeENS_10ASN1_ClassEb: 200| 100k|DER_Encoder& DER_Encoder::start_cons(ASN1_Type type_tag, ASN1_Class class_tag, bool sort_contents) { 201| 100k| m_subsequences.push_back(DER_Sequence(type_tag, class_tag, sort_contents)); 202| 100k| return (*this); 203| 100k|} _ZN5Botan11DER_Encoder8end_consEv: 208| 100k|DER_Encoder& DER_Encoder::end_cons() { 209| 100k| if(m_subsequences.empty()) { ------------------ | Branch (209:7): [True: 0, False: 100k] ------------------ 210| 0| throw Invalid_State("DER_Encoder::end_cons: No such sequence"); 211| 0| } 212| | 213| 100k| DER_Sequence last_seq = std::move(m_subsequences[m_subsequences.size() - 1]); 214| 100k| m_subsequences.pop_back(); 215| 100k| last_seq.push_contents(*this); 216| | 217| 100k| return (*this); 218| 100k|} _ZN5Botan11DER_Encoder9raw_bytesEPKhm: 237| 47.4k|DER_Encoder& DER_Encoder::raw_bytes(const uint8_t bytes[], size_t length) { 238| 47.4k| if(!m_subsequences.empty()) { ------------------ | Branch (238:7): [True: 47.4k, False: 0] ------------------ 239| 47.4k| m_subsequences[m_subsequences.size() - 1].add_bytes(bytes, length); 240| 47.4k| } 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| 47.4k| return (*this); 247| 47.4k|} _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassEPKhm: 285| 197k|DER_Encoder& DER_Encoder::add_object(ASN1_Type type_tag, ASN1_Class class_tag, const uint8_t rep[], size_t length) { 286| 197k| std::vector hdr; 287| 197k| encode_tag(hdr, type_tag, class_tag); 288| 197k| encode_length(hdr, length); 289| | 290| 197k| if(!m_subsequences.empty()) { ------------------ | Branch (290:7): [True: 129k, False: 67.4k] ------------------ 291| 129k| m_subsequences[m_subsequences.size() - 1].add_bytes(hdr.data(), hdr.size(), rep, length); 292| 129k| } else if(m_append_output) { ------------------ | Branch (292:14): [True: 67.4k, False: 0] ------------------ 293| 67.4k| m_append_output(hdr.data(), hdr.size()); 294| 67.4k| m_append_output(rep, length); 295| 67.4k| } else { 296| 0| m_default_outbuf += hdr; 297| 0| m_default_outbuf += std::make_pair(rep, length); 298| 0| } 299| | 300| 197k| return (*this); 301| 197k|} _ZN5Botan11DER_Encoder6encodeEm: 320| 11.6k|DER_Encoder& DER_Encoder::encode(size_t n) { 321| 11.6k| return encode(BigInt::from_u64(n), ASN1_Type::Integer, ASN1_Class::Universal); 322| 11.6k|} _ZN5Botan4ASN116integer_contentsERKNS_6BigIntE: 356| 17.9k|std::vector ASN1::integer_contents(const BigInt& n) { 357| 17.9k| if(n == 0) { ------------------ | Branch (357:7): [True: 1, False: 17.9k] ------------------ 358| 1| return {0x00}; 359| 1| } 360| | 361| | // Serialize magnitude with one extra leading byte 362| 17.9k| auto contents = n.serialize(n.bytes() + 1); 363| | 364| 17.9k| if(n.signum() < 0) { ------------------ | Branch (364:7): [True: 21, False: 17.9k] ------------------ 365| | // Two's complement: bitwise NOT then increment 366| 105| for(auto& byte : contents) { ------------------ | Branch (366:22): [True: 105, False: 21] ------------------ 367| 105| byte = ~byte; 368| 105| } 369| 41| for(size_t i = contents.size(); i > 0; --i) { ------------------ | Branch (369:39): [True: 41, False: 0] ------------------ 370| 41| if(++contents[i - 1] != 0) { ------------------ | Branch (370:13): [True: 21, False: 20] ------------------ 371| 21| break; 372| 21| } 373| 41| } 374| 21| } 375| | 376| | /* 377| | * DER requires the leading byte be emitted only if it required 378| | */ 379| 17.9k| BOTAN_ASSERT_NOMSG(contents.size() >= 2); ------------------ | | 84| 17.9k| do { \ | | 85| 17.9k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 17.9k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 17.9k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 17.9k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 17.9k] | | ------------------ ------------------ 380| 17.9k| const bool leading_byte_redundant = 381| 17.9k| (contents[0] == 0x00 && (contents[1] & 0x80) == 0) || (contents[0] == 0xFF && (contents[1] & 0x80) != 0); ------------------ | Branch (381:8): [True: 17.9k, False: 21] | Branch (381:31): [True: 11.6k, False: 6.27k] | Branch (381:62): [True: 21, False: 6.27k] | Branch (381:85): [True: 12, False: 9] ------------------ 382| | 383| 17.9k| if(leading_byte_redundant) { ------------------ | Branch (383:7): [True: 11.6k, False: 6.28k] ------------------ 384| 11.6k| contents.erase(contents.begin()); 385| 11.6k| } 386| 17.9k| return contents; 387| 17.9k|} _ZN5Botan11DER_Encoder6encodeERKNS_6BigIntENS_9ASN1_TypeENS_10ASN1_ClassE: 389| 11.6k|DER_Encoder& DER_Encoder::encode(const BigInt& n, ASN1_Type type_tag, ASN1_Class class_tag) { 390| 11.6k| return add_object(type_tag, class_tag, ASN1::integer_contents(n)); 391| 11.6k|} _ZN5Botan11DER_Encoder16encode_bitstringENSt3__14spanIKhLm18446744073709551615EEEmNS_9ASN1_TypeENS_10ASN1_ClassE: 414| 6.27k| ASN1_Class class_tag) { 415| 6.27k| if(unused_bits >= 8) { ------------------ | Branch (415:7): [True: 0, False: 6.27k] ------------------ 416| 0| throw Invalid_Argument("DER_Encoder: Invalid unused bit count for BIT STRING"); 417| 0| } 418| | 419| 6.27k| if(bits.empty() && unused_bits != 0) { ------------------ | Branch (419:7): [True: 0, False: 6.27k] | Branch (419:23): [True: 0, False: 0] ------------------ 420| 0| throw Invalid_Argument("DER_Encoder: Empty BIT STRING cannot have unused bits"); 421| 0| } 422| | 423| 6.27k| if(unused_bits > 0 && (bits.back() & ((1U << unused_bits) - 1)) != 0) { ------------------ | Branch (423:7): [True: 0, False: 6.27k] | 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| 6.27k| secure_vector encoded; 428| 6.27k| encoded.reserve(1 + bits.size()); 429| 6.27k| encoded.push_back(static_cast(unused_bits)); 430| 6.27k| encoded.insert(encoded.end(), bits.begin(), bits.end()); 431| 6.27k| return add_object(type_tag, class_tag, encoded); 432| 6.27k|} _ZN5Botan11DER_Encoder6encodeERKNS_11ASN1_ObjectE: 467| 82.4k|DER_Encoder& DER_Encoder::encode(const ASN1_Object& obj) { 468| 82.4k| obj.encode_into(*this); 469| 82.4k| return (*this); 470| 82.4k|} der_enc.cpp:_ZN5Botan12_GLOBAL__N_110encode_tagERNSt3__16vectorIhNS1_9allocatorIhEEEENS_9ASN1_TypeENS_10ASN1_ClassE: 26| 216k|void encode_tag(std::vector& encoded_tag, ASN1_Type type_tag_e, ASN1_Class class_tag_e) { 27| 216k| const uint32_t type_tag = static_cast(type_tag_e); 28| 216k| const uint32_t class_tag = static_cast(class_tag_e); 29| | 30| 216k| if((class_tag | 0xE0) != 0xE0) { ------------------ | Branch (30:7): [True: 0, False: 216k] ------------------ 31| 0| throw Encoding_Error(fmt("DER_Encoder: Invalid class tag {}", std::to_string(class_tag))); 32| 0| } 33| | 34| 216k| if(type_tag <= 30) { ------------------ | Branch (34:7): [True: 216k, False: 0] ------------------ 35| 216k| encoded_tag.push_back(static_cast(type_tag | class_tag)); 36| 216k| } else { 37| 0| size_t blocks = high_bit(static_cast(type_tag)) + 6; 38| 0| blocks = (blocks - (blocks % 7)) / 7; 39| | 40| 0| BOTAN_ASSERT_NOMSG(blocks > 0); ------------------ | | 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] | | ------------------ ------------------ 41| | 42| 0| encoded_tag.push_back(static_cast(class_tag | 0x1F)); 43| 0| for(size_t i = 0; i != blocks - 1; ++i) { ------------------ | Branch (43:25): [True: 0, False: 0] ------------------ 44| 0| encoded_tag.push_back(0x80 | ((type_tag >> 7 * (blocks - i - 1)) & 0x7F)); 45| 0| } 46| 0| encoded_tag.push_back(type_tag & 0x7F); 47| 0| } 48| 216k|} der_enc.cpp:_ZN5Botan12_GLOBAL__N_113encode_lengthERNSt3__16vectorIhNS1_9allocatorIhEEEEm: 53| 216k|void encode_length(std::vector& encoded_length, size_t length) { 54| 216k| if(length <= 127) { ------------------ | Branch (54:7): [True: 203k, False: 12.5k] ------------------ 55| 203k| encoded_length.push_back(static_cast(length)); 56| 203k| } else { 57| 12.5k| const size_t bytes_needed = significant_bytes(length); 58| | 59| 12.5k| encoded_length.push_back(static_cast(0x80 | bytes_needed)); 60| | 61| 37.6k| for(size_t i = sizeof(length) - bytes_needed; i < sizeof(length); ++i) { ------------------ | Branch (61:53): [True: 25.0k, False: 12.5k] ------------------ 62| 25.0k| encoded_length.push_back(get_byte_var(i, length)); 63| 25.0k| } 64| 12.5k| } 65| 216k|} der_enc.cpp:_ZZN5Botan11DER_EncoderC1ERNSt3__16vectorIhNS1_9allocatorIhEEEEENK3$_0clEPKhm: 90| 134k| m_append_output = [&vec](const uint8_t b[], size_t l) { 91| 134k| if(l > 0) { ------------------ | Branch (91:10): [True: 134k, False: 0] ------------------ 92| 134k| vec.insert(vec.end(), b, b + l); 93| 134k| } 94| 134k| }; _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| 65.3k|OID_Map& OID_Map::global_registry() { 17| 65.3k| static OID_Map g_map; 18| 65.3k| return g_map; 19| 65.3k|} _ZN5Botan7OID_Map7oid2strERKNS_3OIDE: 73| 12.5k|std::optional OID_Map::oid2str(const OID& oid) { 74| 12.5k| if(auto name = lookup_static_oid(oid)) { ------------------ | Branch (74:12): [True: 12.5k, False: 0] ------------------ 75| 12.5k| return std::string(*name); 76| 12.5k| } 77| | 78| 0| const lock_guard_type lock(m_mutex); 79| | 80| 0| const auto i = m_oid2str.find(oid); 81| 0| if(i != m_oid2str.end()) { ------------------ | Branch (81:7): [True: 0, False: 0] ------------------ 82| 0| return i->second; 83| 0| } 84| | 85| 0| return {}; 86| 0|} _ZN5Botan7OID_Map7str2oidENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 88| 52.8k|OID OID_Map::str2oid(std::string_view str) { 89| 52.8k| if(auto oid = lookup_static_oid_name(str)) { ------------------ | Branch (89:12): [True: 52.8k, False: 0] ------------------ 90| 52.8k| return std::move(*oid); 91| 52.8k| } 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__117basic_string_viewIcNS1_11char_traitsIcEEEEm: 31| 11.6k| m_hash(hash_fn, AlgorithmIdentifier::USE_NULL_PARAM), 32| 11.6k| m_mgf("MGF1", m_hash.BER_encode()), 33| 11.6k| m_mgf_hash(m_hash), 34| 11.6k| m_salt_len(salt_len), 35| 11.6k| m_trailer_field(1) {} _ZNK5Botan10PSS_Params9serializeEv: 43| 11.6k|std::vector PSS_Params::serialize() const { 44| 11.6k| std::vector output; 45| 11.6k| DER_Encoder(output).encode(*this); 46| 11.6k| return output; 47| 11.6k|} _ZNK5Botan10PSS_Params11encode_intoERNS_11DER_EncoderE: 49| 11.6k|void PSS_Params::encode_into(DER_Encoder& to) const { 50| 11.6k| to.start_sequence() 51| 11.6k| .start_context_specific(0) 52| 11.6k| .encode(m_hash) 53| 11.6k| .end_cons() 54| 11.6k| .start_context_specific(1) 55| 11.6k| .encode(m_mgf) 56| 11.6k| .end_cons() 57| 11.6k| .start_context_specific(2) 58| 11.6k| .encode(m_salt_len) 59| 11.6k| .end_cons() 60| 11.6k| .end_cons(); 61| 11.6k|} _ZN5Botan7OID_Map17lookup_static_oidERKNS_3OIDE: 48| 12.5k|std::optional OID_Map::lookup_static_oid(const OID& oid) { 49| 12.5k| const uint32_t hc = static_cast(oid.hash_code() % 858701); 50| | 51| 12.5k| switch(hc) { 52| 0| case 0x01506: ------------------ | Branch (52:7): [True: 0, False: 12.5k] ------------------ 53| 0| return if_match(oid, {1, 2, 840, 10045, 4, 3, 1}, "ECDSA/SHA-224"); 54| 0| case 0x01507: ------------------ | Branch (54:7): [True: 0, False: 12.5k] ------------------ 55| 0| return if_match(oid, {1, 2, 840, 10045, 4, 3, 2}, "ECDSA/SHA-256"); 56| 0| case 0x01508: ------------------ | Branch (56:7): [True: 0, False: 12.5k] ------------------ 57| 0| return if_match(oid, {1, 2, 840, 10045, 4, 3, 3}, "ECDSA/SHA-384"); 58| 0| case 0x01509: ------------------ | Branch (58:7): [True: 0, False: 12.5k] ------------------ 59| 0| return if_match(oid, {1, 2, 840, 10045, 4, 3, 4}, "ECDSA/SHA-512"); 60| 0| case 0x04C1E: ------------------ | Branch (60:7): [True: 0, False: 12.5k] ------------------ 61| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 3029, 1, 2, 1}, "ElGamal"); 62| 0| case 0x04E61: ------------------ | Branch (62:7): [True: 0, False: 12.5k] ------------------ 63| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 3029, 1, 5, 1}, "OpenPGP.Curve25519"); 64| 0| case 0x0779B: ------------------ | Branch (64:7): [True: 0, False: 12.5k] ------------------ 65| 0| return if_match(oid, {1, 2, 840, 113549, 2, 5}, "MD5"); 66| 0| case 0x0779D: ------------------ | Branch (66:7): [True: 0, False: 12.5k] ------------------ 67| 0| return if_match(oid, {1, 2, 840, 113549, 2, 7}, "HMAC(SHA-1)"); 68| 0| case 0x0779E: ------------------ | Branch (68:7): [True: 0, False: 12.5k] ------------------ 69| 0| return if_match(oid, {1, 2, 840, 113549, 2, 8}, "HMAC(SHA-224)"); 70| 0| case 0x0779F: ------------------ | Branch (70:7): [True: 0, False: 12.5k] ------------------ 71| 0| return if_match(oid, {1, 2, 840, 113549, 2, 9}, "HMAC(SHA-256)"); 72| 0| case 0x077A0: ------------------ | Branch (72:7): [True: 0, False: 12.5k] ------------------ 73| 0| return if_match(oid, {1, 2, 840, 113549, 2, 10}, "HMAC(SHA-384)"); 74| 0| case 0x077A1: ------------------ | Branch (74:7): [True: 0, False: 12.5k] ------------------ 75| 0| return if_match(oid, {1, 2, 840, 113549, 2, 11}, "HMAC(SHA-512)"); 76| 0| case 0x077A3: ------------------ | Branch (76:7): [True: 0, False: 12.5k] ------------------ 77| 0| return if_match(oid, {1, 2, 840, 113549, 2, 13}, "HMAC(SHA-512-256)"); 78| 0| case 0x0785E: ------------------ | Branch (78:7): [True: 0, False: 12.5k] ------------------ 79| 0| return if_match(oid, {1, 2, 840, 113549, 3, 7}, "TripleDES/CBC"); 80| 0| case 0x0C904: ------------------ | Branch (80:7): [True: 0, False: 12.5k] ------------------ 81| 0| return if_match(oid, {1, 0, 14888, 3, 0, 5}, "ECKCDSA"); 82| 0| case 0x11547: ------------------ | Branch (82:7): [True: 0, False: 12.5k] ------------------ 83| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 1}, "SphincsPlus-shake-128s-r3.1"); 84| 0| case 0x11548: ------------------ | Branch (84:7): [True: 0, False: 12.5k] ------------------ 85| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 2}, "SphincsPlus-shake-128f-r3.1"); 86| 0| case 0x11549: ------------------ | Branch (86:7): [True: 0, False: 12.5k] ------------------ 87| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 3}, "SphincsPlus-shake-192s-r3.1"); 88| 0| case 0x1154A: ------------------ | Branch (88:7): [True: 0, False: 12.5k] ------------------ 89| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 4}, "SphincsPlus-shake-192f-r3.1"); 90| 0| case 0x1154B: ------------------ | Branch (90:7): [True: 0, False: 12.5k] ------------------ 91| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 5}, "SphincsPlus-shake-256s-r3.1"); 92| 0| case 0x1154C: ------------------ | Branch (92:7): [True: 0, False: 12.5k] ------------------ 93| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 6}, "SphincsPlus-shake-256f-r3.1"); 94| 0| case 0x11608: ------------------ | Branch (94:7): [True: 0, False: 12.5k] ------------------ 95| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 1}, "SphincsPlus-sha2-128s-r3.1"); 96| 0| case 0x11609: ------------------ | Branch (96:7): [True: 0, False: 12.5k] ------------------ 97| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 2}, "SphincsPlus-sha2-128f-r3.1"); 98| 0| case 0x1160A: ------------------ | Branch (98:7): [True: 0, False: 12.5k] ------------------ 99| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 3}, "SphincsPlus-sha2-192s-r3.1"); 100| 0| case 0x1160B: ------------------ | Branch (100:7): [True: 0, False: 12.5k] ------------------ 101| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 4}, "SphincsPlus-sha2-192f-r3.1"); 102| 0| case 0x1160C: ------------------ | Branch (102:7): [True: 0, False: 12.5k] ------------------ 103| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 5}, "SphincsPlus-sha2-256s-r3.1"); 104| 0| case 0x1160D: ------------------ | Branch (104:7): [True: 0, False: 12.5k] ------------------ 105| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 6}, "SphincsPlus-sha2-256f-r3.1"); 106| 0| case 0x116C9: ------------------ | Branch (106:7): [True: 0, False: 12.5k] ------------------ 107| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 1}, "SphincsPlus-haraka-128s-r3.1"); 108| 0| case 0x116CA: ------------------ | Branch (108:7): [True: 0, False: 12.5k] ------------------ 109| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 2}, "SphincsPlus-haraka-128f-r3.1"); 110| 0| case 0x116CB: ------------------ | Branch (110:7): [True: 0, False: 12.5k] ------------------ 111| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 3}, "SphincsPlus-haraka-192s-r3.1"); 112| 0| case 0x116CC: ------------------ | Branch (112:7): [True: 0, False: 12.5k] ------------------ 113| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 4}, "SphincsPlus-haraka-192f-r3.1"); 114| 0| case 0x116CD: ------------------ | Branch (114:7): [True: 0, False: 12.5k] ------------------ 115| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 5}, "SphincsPlus-haraka-256s-r3.1"); 116| 0| case 0x116CE: ------------------ | Branch (116:7): [True: 0, False: 12.5k] ------------------ 117| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 6}, "SphincsPlus-haraka-256f-r3.1"); 118| 0| case 0x1533B: ------------------ | Branch (118:7): [True: 0, False: 12.5k] ------------------ 119| 0| return if_match(oid, {1, 2, 156, 10197, 1, 104, 2}, "SM4/CBC"); 120| 0| case 0x15341: ------------------ | Branch (120:7): [True: 0, False: 12.5k] ------------------ 121| 0| return if_match(oid, {1, 2, 156, 10197, 1, 104, 8}, "SM4/GCM"); 122| 0| case 0x1539D: ------------------ | Branch (122:7): [True: 0, False: 12.5k] ------------------ 123| 0| return if_match(oid, {1, 2, 156, 10197, 1, 104, 100}, "SM4/OCB"); 124| 0| case 0x187D7: ------------------ | Branch (124:7): [True: 0, False: 12.5k] ------------------ 125| 0| return if_match(oid, {1, 3, 14, 3, 2, 7}, "DES/CBC"); 126| 0| case 0x187EA: ------------------ | Branch (126:7): [True: 0, False: 12.5k] ------------------ 127| 0| return if_match(oid, {1, 3, 14, 3, 2, 26}, "SHA-1"); 128| 0| case 0x19933: ------------------ | Branch (128:7): [True: 0, False: 12.5k] ------------------ 129| 0| return if_match(oid, {1, 3, 132, 0, 8}, "secp160r1"); 130| 0| case 0x19934: ------------------ | Branch (130:7): [True: 0, False: 12.5k] ------------------ 131| 0| return if_match(oid, {1, 3, 132, 0, 9}, "secp160k1"); 132| 0| case 0x19935: ------------------ | Branch (132:7): [True: 0, False: 12.5k] ------------------ 133| 0| return if_match(oid, {1, 3, 132, 0, 10}, "secp256k1"); 134| 0| case 0x19949: ------------------ | Branch (134:7): [True: 0, False: 12.5k] ------------------ 135| 0| return if_match(oid, {1, 3, 132, 0, 30}, "secp160r2"); 136| 0| case 0x1994A: ------------------ | Branch (136:7): [True: 0, False: 12.5k] ------------------ 137| 0| return if_match(oid, {1, 3, 132, 0, 31}, "secp192k1"); 138| 0| case 0x1994B: ------------------ | Branch (138:7): [True: 0, False: 12.5k] ------------------ 139| 0| return if_match(oid, {1, 3, 132, 0, 32}, "secp224k1"); 140| 0| case 0x1994C: ------------------ | Branch (140:7): [True: 0, False: 12.5k] ------------------ 141| 0| return if_match(oid, {1, 3, 132, 0, 33}, "secp224r1"); 142| 1| case 0x1994D: ------------------ | Branch (142:7): [True: 1, False: 12.5k] ------------------ 143| 1| return if_match(oid, {1, 3, 132, 0, 34}, "secp384r1"); 144| 1| case 0x1994E: ------------------ | Branch (144:7): [True: 1, False: 12.5k] ------------------ 145| 1| return if_match(oid, {1, 3, 132, 0, 35}, "secp521r1"); 146| 0| case 0x199F8: ------------------ | Branch (146:7): [True: 0, False: 12.5k] ------------------ 147| 0| return if_match(oid, {1, 3, 132, 1, 12}, "ECDH"); 148| 0| case 0x1E7BF: ------------------ | Branch (148:7): [True: 0, False: 12.5k] ------------------ 149| 0| return if_match(oid, {1, 2, 156, 10197, 1, 301, 1}, "SM2"); 150| 0| case 0x1E7C0: ------------------ | Branch (150:7): [True: 0, False: 12.5k] ------------------ 151| 0| return if_match(oid, {1, 2, 156, 10197, 1, 301, 2}, "SM2_Kex"); 152| 0| case 0x1E7C1: ------------------ | Branch (152:7): [True: 0, False: 12.5k] ------------------ 153| 0| return if_match(oid, {1, 2, 156, 10197, 1, 301, 3}, "SM2_Enc"); 154| 0| case 0x21960: ------------------ | Branch (154:7): [True: 0, False: 12.5k] ------------------ 155| 0| return if_match(oid, {1, 3, 36, 3, 3, 1, 2}, "RSA/PKCS1v15(RIPEMD-160)"); 156| 0| case 0x2198A: ------------------ | Branch (156:7): [True: 0, False: 12.5k] ------------------ 157| 0| return if_match(oid, {1, 2, 840, 113533, 7, 66, 10}, "CAST-128/CBC"); 158| 0| case 0x2198F: ------------------ | Branch (158:7): [True: 0, False: 12.5k] ------------------ 159| 0| return if_match(oid, {1, 2, 840, 113533, 7, 66, 15}, "KeyWrap.CAST-128"); 160| 0| case 0x227C0: ------------------ | Branch (160:7): [True: 0, False: 12.5k] ------------------ 161| 0| return if_match(oid, {1, 3, 101, 110}, "X25519"); 162| 0| case 0x227C1: ------------------ | Branch (162:7): [True: 0, False: 12.5k] ------------------ 163| 0| return if_match(oid, {1, 3, 101, 111}, "X448"); 164| 0| case 0x227C2: ------------------ | Branch (164:7): [True: 0, False: 12.5k] ------------------ 165| 0| return if_match(oid, {1, 3, 101, 112}, "Ed25519"); 166| 0| case 0x227C3: ------------------ | Branch (166:7): [True: 0, False: 12.5k] ------------------ 167| 0| return if_match(oid, {1, 3, 101, 113}, "Ed448"); 168| 0| case 0x27565: ------------------ | Branch (168:7): [True: 0, False: 12.5k] ------------------ 169| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1, 1}, "PKIX.OCSP.BasicResponse"); 170| 0| case 0x27566: ------------------ | Branch (170:7): [True: 0, False: 12.5k] ------------------ 171| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1, 2}, "PKIX.OCSP.Nonce"); 172| 0| case 0x27569: ------------------ | Branch (172:7): [True: 0, False: 12.5k] ------------------ 173| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1, 5}, "PKIX.OCSP.NoCheck"); 174| 0| case 0x29F7C: ------------------ | Branch (174:7): [True: 0, False: 12.5k] ------------------ 175| 0| return if_match(oid, {1, 2, 410, 200004, 1, 100, 4, 3}, "ECKCDSA/SHA-1"); 176| 0| case 0x29F7D: ------------------ | Branch (176:7): [True: 0, False: 12.5k] ------------------ 177| 0| return if_match(oid, {1, 2, 410, 200004, 1, 100, 4, 4}, "ECKCDSA/SHA-224"); 178| 0| case 0x29F7E: ------------------ | Branch (178:7): [True: 0, False: 12.5k] ------------------ 179| 0| return if_match(oid, {1, 2, 410, 200004, 1, 100, 4, 5}, "ECKCDSA/SHA-256"); 180| 0| case 0x2AC3B: ------------------ | Branch (180:7): [True: 0, False: 12.5k] ------------------ 181| 0| return if_match(oid, {2, 5, 29, 32, 0}, "X509v3.AnyPolicy"); 182| 0| case 0x2B000: ------------------ | Branch (182:7): [True: 0, False: 12.5k] ------------------ 183| 0| return if_match(oid, {2, 5, 29, 37, 0}, "X509v3.AnyExtendedKeyUsage"); 184| 12.5k| case 0x2B5C9: ------------------ | Branch (184:7): [True: 12.5k, False: 6] ------------------ 185| 12.5k| return if_match(oid, {1, 2, 840, 10045, 2, 1}, "ECDSA"); 186| 0| case 0x2B74B: ------------------ | Branch (186:7): [True: 0, False: 12.5k] ------------------ 187| 0| return if_match(oid, {1, 2, 840, 10045, 4, 1}, "ECDSA/SHA-1"); 188| 0| case 0x3474A: ------------------ | Branch (188:7): [True: 0, False: 12.5k] ------------------ 189| 0| return if_match(oid, {1, 2, 840, 10046, 2, 1}, "DH"); 190| 0| case 0x38D6D: ------------------ | Branch (190:7): [True: 0, False: 12.5k] ------------------ 191| 0| return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 1, 1}, "gost_256A"); 192| 0| case 0x38D6E: ------------------ | Branch (192:7): [True: 0, False: 12.5k] ------------------ 193| 0| return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 1, 2}, "gost_256B"); 194| 0| case 0x38E2E: ------------------ | Branch (194:7): [True: 0, False: 12.5k] ------------------ 195| 0| return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 2, 1}, "gost_512A"); 196| 0| case 0x38E2F: ------------------ | Branch (196:7): [True: 0, False: 12.5k] ------------------ 197| 0| return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 2, 2}, "gost_512B"); 198| 0| case 0x38F2C: ------------------ | Branch (198:7): [True: 0, False: 12.5k] ------------------ 199| 0| return if_match(oid, {1, 2, 643, 2, 2, 3}, "GOST-34.10/GOST-R-34.11-94"); 200| 0| case 0x38F3C: ------------------ | Branch (200:7): [True: 0, False: 12.5k] ------------------ 201| 0| return if_match(oid, {1, 2, 643, 2, 2, 19}, "GOST-34.10"); 202| 0| case 0x3D7B8: ------------------ | Branch (202:7): [True: 0, False: 12.5k] ------------------ 203| 0| return if_match(oid, {0, 3, 4401, 5, 3, 1, 9, 6}, "Camellia-128/GCM"); 204| 0| case 0x3D7CC: ------------------ | Branch (204:7): [True: 0, False: 12.5k] ------------------ 205| 0| return if_match(oid, {0, 3, 4401, 5, 3, 1, 9, 26}, "Camellia-192/GCM"); 206| 0| case 0x3D7E0: ------------------ | Branch (206:7): [True: 0, False: 12.5k] ------------------ 207| 0| return if_match(oid, {0, 3, 4401, 5, 3, 1, 9, 46}, "Camellia-256/GCM"); 208| 0| case 0x3F20F: ------------------ | Branch (208:7): [True: 0, False: 12.5k] ------------------ 209| 0| return if_match(oid, {1, 3, 36, 3, 2, 1}, "RIPEMD-160"); 210| 0| case 0x4266E: ------------------ | Branch (210:7): [True: 0, False: 12.5k] ------------------ 211| 0| return if_match(oid, {0, 4, 0, 127, 0, 15, 1, 1, 13, 0}, "XMSS"); 212| 0| case 0x478C4: ------------------ | Branch (212:7): [True: 0, False: 12.5k] ------------------ 213| 0| return if_match(oid, {1, 2, 410, 200004, 1, 4}, "SEED/CBC"); 214| 0| case 0x47D98: ------------------ | Branch (214:7): [True: 0, False: 12.5k] ------------------ 215| 0| return if_match(oid, {1, 2, 156, 10197, 1, 301}, "sm2p256v1"); 216| 0| case 0x47DFC: ------------------ | Branch (216:7): [True: 0, False: 12.5k] ------------------ 217| 0| return if_match(oid, {1, 2, 156, 10197, 1, 401}, "SM3"); 218| 0| case 0x47E60: ------------------ | Branch (218:7): [True: 0, False: 12.5k] ------------------ 219| 0| return if_match(oid, {1, 2, 156, 10197, 1, 501}, "SM2_Sig/SM3"); 220| 0| case 0x47E63: ------------------ | Branch (220:7): [True: 0, False: 12.5k] ------------------ 221| 0| return if_match(oid, {1, 2, 156, 10197, 1, 504}, "RSA/PKCS1v15(SM3)"); 222| 0| case 0x52B13: ------------------ | Branch (222:7): [True: 0, False: 12.5k] ------------------ 223| 0| return if_match(oid, {1, 2, 643, 3, 131, 1, 1}, "GOST.INN"); 224| 0| case 0x635AE: ------------------ | Branch (224:7): [True: 0, False: 12.5k] ------------------ 225| 0| return if_match(oid, {1, 2, 250, 1, 223, 101, 256, 1}, "frp256v1"); 226| 0| case 0x6A784: ------------------ | Branch (226:7): [True: 0, False: 12.5k] ------------------ 227| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 1}, "PKCS12.KeyBag"); 228| 0| case 0x6A785: ------------------ | Branch (228:7): [True: 0, False: 12.5k] ------------------ 229| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 2}, "PKCS12.PKCS8ShroudedKeyBag"); 230| 0| case 0x6A786: ------------------ | Branch (230:7): [True: 0, False: 12.5k] ------------------ 231| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 3}, "PKCS12.CertBag"); 232| 0| case 0x6A787: ------------------ | Branch (232:7): [True: 0, False: 12.5k] ------------------ 233| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 4}, "PKCS12.CRLBag"); 234| 0| case 0x6A788: ------------------ | Branch (234:7): [True: 0, False: 12.5k] ------------------ 235| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 5}, "PKCS12.SecretBag"); 236| 0| case 0x6A789: ------------------ | Branch (236:7): [True: 0, False: 12.5k] ------------------ 237| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 6}, "PKCS12.SafeContentsBag"); 238| 0| case 0x6EB86: ------------------ | Branch (238:7): [True: 0, False: 12.5k] ------------------ 239| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 6, 1}, "GOST-34.10-2012-256/SHA-256"); 240| 0| case 0x6EC47: ------------------ | Branch (240:7): [True: 0, False: 12.5k] ------------------ 241| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 7, 1}, "Kyber-512-r3"); 242| 0| case 0x6EC48: ------------------ | Branch (242:7): [True: 0, False: 12.5k] ------------------ 243| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 7, 2}, "Kyber-768-r3"); 244| 0| case 0x6EC49: ------------------ | Branch (244:7): [True: 0, False: 12.5k] ------------------ 245| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 7, 3}, "Kyber-1024-r3"); 246| 0| case 0x6EDC9: ------------------ | Branch (246:7): [True: 0, False: 12.5k] ------------------ 247| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 9, 1}, "Dilithium-4x4-r3"); 248| 0| case 0x6EDCA: ------------------ | Branch (248:7): [True: 0, False: 12.5k] ------------------ 249| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 9, 2}, "Dilithium-6x5-r3"); 250| 0| case 0x6EDCB: ------------------ | Branch (250:7): [True: 0, False: 12.5k] ------------------ 251| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 9, 3}, "Dilithium-8x7-r3"); 252| 0| case 0x6EE8A: ------------------ | Branch (252:7): [True: 0, False: 12.5k] ------------------ 253| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 10, 1}, "Dilithium-4x4-AES-r3"); 254| 0| case 0x6EE8B: ------------------ | Branch (254:7): [True: 0, False: 12.5k] ------------------ 255| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 10, 2}, "Dilithium-6x5-AES-r3"); 256| 0| case 0x6EE8C: ------------------ | Branch (256:7): [True: 0, False: 12.5k] ------------------ 257| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 10, 3}, "Dilithium-8x7-AES-r3"); 258| 0| case 0x6EF4B: ------------------ | Branch (258:7): [True: 0, False: 12.5k] ------------------ 259| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 11, 1}, "Kyber-512-90s-r3"); 260| 0| case 0x6EF4C: ------------------ | Branch (260:7): [True: 0, False: 12.5k] ------------------ 261| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 11, 2}, "Kyber-768-90s-r3"); 262| 0| case 0x6EF4D: ------------------ | Branch (262:7): [True: 0, False: 12.5k] ------------------ 263| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 11, 3}, "Kyber-1024-90s-r3"); 264| 0| case 0x6F18E: ------------------ | Branch (264:7): [True: 0, False: 12.5k] ------------------ 265| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 14, 1}, "FrodoKEM-640-SHAKE"); 266| 0| case 0x6F18F: ------------------ | Branch (266:7): [True: 0, False: 12.5k] ------------------ 267| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 14, 2}, "FrodoKEM-976-SHAKE"); 268| 0| case 0x6F190: ------------------ | Branch (268:7): [True: 0, False: 12.5k] ------------------ 269| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 14, 3}, "FrodoKEM-1344-SHAKE"); 270| 0| case 0x6F24F: ------------------ | Branch (270:7): [True: 0, False: 12.5k] ------------------ 271| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 15, 1}, "FrodoKEM-640-AES"); 272| 0| case 0x6F250: ------------------ | Branch (272:7): [True: 0, False: 12.5k] ------------------ 273| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 15, 2}, "FrodoKEM-976-AES"); 274| 0| case 0x6F251: ------------------ | Branch (274:7): [True: 0, False: 12.5k] ------------------ 275| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 15, 3}, "FrodoKEM-1344-AES"); 276| 0| case 0x6F310: ------------------ | Branch (276:7): [True: 0, False: 12.5k] ------------------ 277| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 16, 1}, "eFrodoKEM-640-SHAKE"); 278| 0| case 0x6F311: ------------------ | Branch (278:7): [True: 0, False: 12.5k] ------------------ 279| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 16, 2}, "eFrodoKEM-976-SHAKE"); 280| 0| case 0x6F312: ------------------ | Branch (280:7): [True: 0, False: 12.5k] ------------------ 281| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 16, 3}, "eFrodoKEM-1344-SHAKE"); 282| 0| case 0x6F3D1: ------------------ | Branch (282:7): [True: 0, False: 12.5k] ------------------ 283| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 17, 1}, "eFrodoKEM-640-AES"); 284| 0| case 0x6F3D2: ------------------ | Branch (284:7): [True: 0, False: 12.5k] ------------------ 285| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 17, 2}, "eFrodoKEM-976-AES"); 286| 0| case 0x6F3D3: ------------------ | Branch (286:7): [True: 0, False: 12.5k] ------------------ 287| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 17, 3}, "eFrodoKEM-1344-AES"); 288| 0| case 0x6F492: ------------------ | Branch (288:7): [True: 0, False: 12.5k] ------------------ 289| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 1}, "ClassicMcEliece_6688128pc"); 290| 0| case 0x6F493: ------------------ | Branch (290:7): [True: 0, False: 12.5k] ------------------ 291| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 2}, "ClassicMcEliece_6688128pcf"); 292| 0| case 0x6F494: ------------------ | Branch (292:7): [True: 0, False: 12.5k] ------------------ 293| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 3}, "ClassicMcEliece_6960119pc"); 294| 0| case 0x6F495: ------------------ | Branch (294:7): [True: 0, False: 12.5k] ------------------ 295| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 4}, "ClassicMcEliece_6960119pcf"); 296| 0| case 0x6F496: ------------------ | Branch (296:7): [True: 0, False: 12.5k] ------------------ 297| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 5}, "ClassicMcEliece_8192128pc"); 298| 0| case 0x6F497: ------------------ | Branch (298:7): [True: 0, False: 12.5k] ------------------ 299| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 6}, "ClassicMcEliece_8192128pcf"); 300| 0| case 0x6F79D: ------------------ | Branch (300:7): [True: 0, False: 12.5k] ------------------ 301| 0| return if_match(oid, {2, 16, 840, 1, 113730, 1, 13}, "Certificate Comment"); 302| 0| case 0x701A0: ------------------ | Branch (302:7): [True: 0, False: 12.5k] ------------------ 303| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 2, 1}, "ECGDSA"); 304| 0| case 0x70322: ------------------ | Branch (304:7): [True: 0, False: 12.5k] ------------------ 305| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 1}, "ECGDSA/RIPEMD-160"); 306| 0| case 0x70323: ------------------ | Branch (306:7): [True: 0, False: 12.5k] ------------------ 307| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 2}, "ECGDSA/SHA-1"); 308| 0| case 0x70324: ------------------ | Branch (308:7): [True: 0, False: 12.5k] ------------------ 309| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 3}, "ECGDSA/SHA-224"); 310| 0| case 0x70325: ------------------ | Branch (310:7): [True: 0, False: 12.5k] ------------------ 311| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 4}, "ECGDSA/SHA-256"); 312| 0| case 0x70326: ------------------ | Branch (312:7): [True: 0, False: 12.5k] ------------------ 313| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 5}, "ECGDSA/SHA-384"); 314| 0| case 0x70327: ------------------ | Branch (314:7): [True: 0, False: 12.5k] ------------------ 315| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 6}, "ECGDSA/SHA-512"); 316| 0| case 0x72B21: ------------------ | Branch (316:7): [True: 0, False: 12.5k] ------------------ 317| 0| return if_match(oid, {1, 2, 643, 7, 1, 1, 1, 1}, "GOST-34.10-2012-256"); 318| 0| case 0x72B22: ------------------ | Branch (318:7): [True: 0, False: 12.5k] ------------------ 319| 0| return if_match(oid, {1, 2, 643, 7, 1, 1, 1, 2}, "GOST-34.10-2012-512"); 320| 0| case 0x72BE3: ------------------ | Branch (320:7): [True: 0, False: 12.5k] ------------------ 321| 0| return if_match(oid, {1, 2, 643, 7, 1, 1, 2, 2}, "Streebog-256"); 322| 0| case 0x72BE4: ------------------ | Branch (322:7): [True: 0, False: 12.5k] ------------------ 323| 0| return if_match(oid, {1, 2, 643, 7, 1, 1, 2, 3}, "Streebog-512"); 324| 0| case 0x72CA4: ------------------ | Branch (324:7): [True: 0, False: 12.5k] ------------------ 325| 0| return if_match(oid, {1, 2, 643, 7, 1, 1, 3, 2}, "GOST-34.10-2012-256/Streebog-256"); 326| 0| case 0x72CA5: ------------------ | Branch (326:7): [True: 0, False: 12.5k] ------------------ 327| 0| return if_match(oid, {1, 2, 643, 7, 1, 1, 3, 3}, "GOST-34.10-2012-512/Streebog-512"); 328| 0| case 0x7C7C7: ------------------ | Branch (328:7): [True: 0, False: 12.5k] ------------------ 329| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 22, 1}, "PKCS9.X509Certificate"); 330| 0| case 0x7C7C8: ------------------ | Branch (330:7): [True: 0, False: 12.5k] ------------------ 331| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 22, 2}, "PKCS9.SDSICertificate"); 332| 0| case 0x7C888: ------------------ | Branch (332:7): [True: 0, False: 12.5k] ------------------ 333| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 23, 1}, "PKCS9.X509CRL"); 334| 0| case 0x7E10F: ------------------ | Branch (334:7): [True: 0, False: 12.5k] ------------------ 335| 0| return if_match(oid, {2, 5, 4, 3}, "X520.CommonName"); 336| 0| case 0x7E110: ------------------ | Branch (336:7): [True: 0, False: 12.5k] ------------------ 337| 0| return if_match(oid, {2, 5, 4, 4}, "X520.Surname"); 338| 0| case 0x7E111: ------------------ | Branch (338:7): [True: 0, False: 12.5k] ------------------ 339| 0| return if_match(oid, {2, 5, 4, 5}, "X520.SerialNumber"); 340| 0| case 0x7E112: ------------------ | Branch (340:7): [True: 0, False: 12.5k] ------------------ 341| 0| return if_match(oid, {2, 5, 4, 6}, "X520.Country"); 342| 0| case 0x7E113: ------------------ | Branch (342:7): [True: 0, False: 12.5k] ------------------ 343| 0| return if_match(oid, {2, 5, 4, 7}, "X520.Locality"); 344| 0| case 0x7E114: ------------------ | Branch (344:7): [True: 0, False: 12.5k] ------------------ 345| 0| return if_match(oid, {2, 5, 4, 8}, "X520.State"); 346| 0| case 0x7E115: ------------------ | Branch (346:7): [True: 0, False: 12.5k] ------------------ 347| 0| return if_match(oid, {2, 5, 4, 9}, "X520.StreetAddress"); 348| 0| case 0x7E116: ------------------ | Branch (348:7): [True: 0, False: 12.5k] ------------------ 349| 0| return if_match(oid, {2, 5, 4, 10}, "X520.Organization"); 350| 0| case 0x7E117: ------------------ | Branch (350:7): [True: 0, False: 12.5k] ------------------ 351| 0| return if_match(oid, {2, 5, 4, 11}, "X520.OrganizationalUnit"); 352| 0| case 0x7E118: ------------------ | Branch (352:7): [True: 0, False: 12.5k] ------------------ 353| 0| return if_match(oid, {2, 5, 4, 12}, "X520.Title"); 354| 0| case 0x7E136: ------------------ | Branch (354:7): [True: 0, False: 12.5k] ------------------ 355| 0| return if_match(oid, {2, 5, 4, 42}, "X520.GivenName"); 356| 0| case 0x7E137: ------------------ | Branch (356:7): [True: 0, False: 12.5k] ------------------ 357| 0| return if_match(oid, {2, 5, 4, 43}, "X520.Initials"); 358| 0| case 0x7E138: ------------------ | Branch (358:7): [True: 0, False: 12.5k] ------------------ 359| 0| return if_match(oid, {2, 5, 4, 44}, "X520.GenerationalQualifier"); 360| 0| case 0x7E13A: ------------------ | Branch (360:7): [True: 0, False: 12.5k] ------------------ 361| 0| return if_match(oid, {2, 5, 4, 46}, "X520.DNQualifier"); 362| 0| case 0x7E14D: ------------------ | Branch (362:7): [True: 0, False: 12.5k] ------------------ 363| 0| return if_match(oid, {2, 5, 4, 65}, "X520.Pseudonym"); 364| 0| case 0x7F3F3: ------------------ | Branch (364:7): [True: 0, False: 12.5k] ------------------ 365| 0| return if_match(oid, {2, 5, 29, 14}, "X509v3.SubjectKeyIdentifier"); 366| 0| case 0x7F3F4: ------------------ | Branch (366:7): [True: 0, False: 12.5k] ------------------ 367| 0| return if_match(oid, {2, 5, 29, 15}, "X509v3.KeyUsage"); 368| 0| case 0x7F3F5: ------------------ | Branch (368:7): [True: 0, False: 12.5k] ------------------ 369| 0| return if_match(oid, {2, 5, 29, 16}, "X509v3.PrivateKeyUsagePeriod"); 370| 0| case 0x7F3F6: ------------------ | Branch (370:7): [True: 0, False: 12.5k] ------------------ 371| 0| return if_match(oid, {2, 5, 29, 17}, "X509v3.SubjectAlternativeName"); 372| 0| case 0x7F3F7: ------------------ | Branch (372:7): [True: 0, False: 12.5k] ------------------ 373| 0| return if_match(oid, {2, 5, 29, 18}, "X509v3.IssuerAlternativeName"); 374| 0| case 0x7F3F8: ------------------ | Branch (374:7): [True: 0, False: 12.5k] ------------------ 375| 0| return if_match(oid, {2, 5, 29, 19}, "X509v3.BasicConstraints"); 376| 0| case 0x7F3F9: ------------------ | Branch (376:7): [True: 0, False: 12.5k] ------------------ 377| 0| return if_match(oid, {2, 5, 29, 20}, "X509v3.CRLNumber"); 378| 0| case 0x7F3FA: ------------------ | Branch (378:7): [True: 0, False: 12.5k] ------------------ 379| 0| return if_match(oid, {2, 5, 29, 21}, "X509v3.ReasonCode"); 380| 0| case 0x7F3FC: ------------------ | Branch (380:7): [True: 0, False: 12.5k] ------------------ 381| 0| return if_match(oid, {2, 5, 29, 23}, "X509v3.HoldInstructionCode"); 382| 0| case 0x7F3FD: ------------------ | Branch (382:7): [True: 0, False: 12.5k] ------------------ 383| 0| return if_match(oid, {2, 5, 29, 24}, "X509v3.InvalidityDate"); 384| 0| case 0x7F401: ------------------ | Branch (384:7): [True: 0, False: 12.5k] ------------------ 385| 0| return if_match(oid, {2, 5, 29, 28}, "X509v3.CRLIssuingDistributionPoint"); 386| 0| case 0x7F403: ------------------ | Branch (386:7): [True: 0, False: 12.5k] ------------------ 387| 0| return if_match(oid, {2, 5, 29, 30}, "X509v3.NameConstraints"); 388| 0| case 0x7F404: ------------------ | Branch (388:7): [True: 0, False: 12.5k] ------------------ 389| 0| return if_match(oid, {2, 5, 29, 31}, "X509v3.CRLDistributionPoints"); 390| 0| case 0x7F405: ------------------ | Branch (390:7): [True: 0, False: 12.5k] ------------------ 391| 0| return if_match(oid, {2, 5, 29, 32}, "X509v3.CertificatePolicies"); 392| 0| case 0x7F408: ------------------ | Branch (392:7): [True: 0, False: 12.5k] ------------------ 393| 0| return if_match(oid, {2, 5, 29, 35}, "X509v3.AuthorityKeyIdentifier"); 394| 0| case 0x7F409: ------------------ | Branch (394:7): [True: 0, False: 12.5k] ------------------ 395| 0| return if_match(oid, {2, 5, 29, 36}, "X509v3.PolicyConstraints"); 396| 0| case 0x7F40A: ------------------ | Branch (396:7): [True: 0, False: 12.5k] ------------------ 397| 0| return if_match(oid, {2, 5, 29, 37}, "X509v3.ExtendedKeyUsage"); 398| 0| case 0x7F41D: ------------------ | Branch (398:7): [True: 0, False: 12.5k] ------------------ 399| 0| return if_match(oid, {2, 5, 29, 56}, "X509v3.NoRevocationAvailable"); 400| 0| case 0x80B84: ------------------ | Branch (400:7): [True: 0, False: 12.5k] ------------------ 401| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 1}, "AES-128/OCB"); 402| 0| case 0x80B85: ------------------ | Branch (402:7): [True: 0, False: 12.5k] ------------------ 403| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 2}, "AES-192/OCB"); 404| 0| case 0x80B86: ------------------ | Branch (404:7): [True: 0, False: 12.5k] ------------------ 405| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 3}, "AES-256/OCB"); 406| 0| case 0x80B87: ------------------ | Branch (406:7): [True: 0, False: 12.5k] ------------------ 407| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 4}, "Serpent/OCB"); 408| 0| case 0x80B88: ------------------ | Branch (408:7): [True: 0, False: 12.5k] ------------------ 409| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 5}, "Twofish/OCB"); 410| 0| case 0x80B89: ------------------ | Branch (410:7): [True: 0, False: 12.5k] ------------------ 411| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 6}, "Camellia-128/OCB"); 412| 0| case 0x80B8A: ------------------ | Branch (412:7): [True: 0, False: 12.5k] ------------------ 413| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 7}, "Camellia-192/OCB"); 414| 0| case 0x80B8B: ------------------ | Branch (414:7): [True: 0, False: 12.5k] ------------------ 415| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 8}, "Camellia-256/OCB"); 416| 0| case 0x80D06: ------------------ | Branch (416:7): [True: 0, False: 12.5k] ------------------ 417| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 1}, "AES-128/SIV"); 418| 0| case 0x80D07: ------------------ | Branch (418:7): [True: 0, False: 12.5k] ------------------ 419| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 2}, "AES-192/SIV"); 420| 0| case 0x80D08: ------------------ | Branch (420:7): [True: 0, False: 12.5k] ------------------ 421| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 3}, "AES-256/SIV"); 422| 0| case 0x80D09: ------------------ | Branch (422:7): [True: 0, False: 12.5k] ------------------ 423| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 4}, "Serpent/SIV"); 424| 0| case 0x80D0A: ------------------ | Branch (424:7): [True: 0, False: 12.5k] ------------------ 425| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 5}, "Twofish/SIV"); 426| 0| case 0x80D0B: ------------------ | Branch (426:7): [True: 0, False: 12.5k] ------------------ 427| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 6}, "Camellia-128/SIV"); 428| 0| case 0x80D0C: ------------------ | Branch (428:7): [True: 0, False: 12.5k] ------------------ 429| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 7}, "Camellia-192/SIV"); 430| 0| case 0x80D0D: ------------------ | Branch (430:7): [True: 0, False: 12.5k] ------------------ 431| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 8}, "Camellia-256/SIV"); 432| 0| case 0x80D0E: ------------------ | Branch (432:7): [True: 0, False: 12.5k] ------------------ 433| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 9}, "SM4/SIV"); 434| 0| case 0x84C6A: ------------------ | Branch (434:7): [True: 0, False: 12.5k] ------------------ 435| 0| return if_match(oid, {1, 2, 392, 200011, 61, 1, 1, 1, 2}, "Camellia-128/CBC"); 436| 0| case 0x84C6B: ------------------ | Branch (436:7): [True: 0, False: 12.5k] ------------------ 437| 0| return if_match(oid, {1, 2, 392, 200011, 61, 1, 1, 1, 3}, "Camellia-192/CBC"); 438| 0| case 0x84C6C: ------------------ | Branch (438:7): [True: 0, False: 12.5k] ------------------ 439| 0| return if_match(oid, {1, 2, 392, 200011, 61, 1, 1, 1, 4}, "Camellia-256/CBC"); 440| 0| case 0x88CD3: ------------------ | Branch (440:7): [True: 0, False: 12.5k] ------------------ 441| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 6}, "KeyWrap.TripleDES"); 442| 0| case 0x88CD5: ------------------ | Branch (442:7): [True: 0, False: 12.5k] ------------------ 443| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 8}, "Compression.Zlib"); 444| 0| case 0x88CDE: ------------------ | Branch (444:7): [True: 0, False: 12.5k] ------------------ 445| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 17}, "HSS-LMS"); 446| 0| case 0x88CDF: ------------------ | Branch (446:7): [True: 0, False: 12.5k] ------------------ 447| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 18}, "ChaCha20Poly1305"); 448| 0| case 0x92296: ------------------ | Branch (448:7): [True: 0, False: 12.5k] ------------------ 449| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 2}, "AES-128/CBC"); 450| 0| case 0x92299: ------------------ | Branch (450:7): [True: 0, False: 12.5k] ------------------ 451| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 5}, "KeyWrap.AES-128"); 452| 0| case 0x9229A: ------------------ | Branch (452:7): [True: 0, False: 12.5k] ------------------ 453| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 6}, "AES-128/GCM"); 454| 0| case 0x9229B: ------------------ | Branch (454:7): [True: 0, False: 12.5k] ------------------ 455| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 7}, "AES-128/CCM"); 456| 0| case 0x922AA: ------------------ | Branch (456:7): [True: 0, False: 12.5k] ------------------ 457| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 22}, "AES-192/CBC"); 458| 0| case 0x922AD: ------------------ | Branch (458:7): [True: 0, False: 12.5k] ------------------ 459| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 25}, "KeyWrap.AES-192"); 460| 0| case 0x922AE: ------------------ | Branch (460:7): [True: 0, False: 12.5k] ------------------ 461| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 26}, "AES-192/GCM"); 462| 0| case 0x922AF: ------------------ | Branch (462:7): [True: 0, False: 12.5k] ------------------ 463| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 27}, "AES-192/CCM"); 464| 0| case 0x922BE: ------------------ | Branch (464:7): [True: 0, False: 12.5k] ------------------ 465| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 42}, "AES-256/CBC"); 466| 0| case 0x922C1: ------------------ | Branch (466:7): [True: 0, False: 12.5k] ------------------ 467| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 45}, "KeyWrap.AES-256"); 468| 0| case 0x922C2: ------------------ | Branch (468:7): [True: 0, False: 12.5k] ------------------ 469| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 46}, "AES-256/GCM"); 470| 0| case 0x922C3: ------------------ | Branch (470:7): [True: 0, False: 12.5k] ------------------ 471| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 47}, "AES-256/CCM"); 472| 0| case 0x92356: ------------------ | Branch (472:7): [True: 0, False: 12.5k] ------------------ 473| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 1}, "SHA-256"); 474| 0| case 0x92357: ------------------ | Branch (474:7): [True: 0, False: 12.5k] ------------------ 475| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 2}, "SHA-384"); 476| 0| case 0x92358: ------------------ | Branch (476:7): [True: 0, False: 12.5k] ------------------ 477| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 3}, "SHA-512"); 478| 0| case 0x92359: ------------------ | Branch (478:7): [True: 0, False: 12.5k] ------------------ 479| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 4}, "SHA-224"); 480| 0| case 0x9235B: ------------------ | Branch (480:7): [True: 0, False: 12.5k] ------------------ 481| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 6}, "SHA-512-256"); 482| 0| case 0x9235C: ------------------ | Branch (482:7): [True: 0, False: 12.5k] ------------------ 483| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 7}, "SHA-3(224)"); 484| 0| case 0x9235D: ------------------ | Branch (484:7): [True: 0, False: 12.5k] ------------------ 485| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 8}, "SHA-3(256)"); 486| 0| case 0x9235E: ------------------ | Branch (486:7): [True: 0, False: 12.5k] ------------------ 487| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 9}, "SHA-3(384)"); 488| 0| case 0x9235F: ------------------ | Branch (488:7): [True: 0, False: 12.5k] ------------------ 489| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 10}, "SHA-3(512)"); 490| 0| case 0x92360: ------------------ | Branch (490:7): [True: 0, False: 12.5k] ------------------ 491| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 11}, "SHAKE-128"); 492| 0| case 0x92361: ------------------ | Branch (492:7): [True: 0, False: 12.5k] ------------------ 493| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 12}, "SHAKE-256"); 494| 0| case 0x92417: ------------------ | Branch (494:7): [True: 0, False: 12.5k] ------------------ 495| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 1}, "DSA/SHA-224"); 496| 0| case 0x92418: ------------------ | Branch (496:7): [True: 0, False: 12.5k] ------------------ 497| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 2}, "DSA/SHA-256"); 498| 0| case 0x92419: ------------------ | Branch (498:7): [True: 0, False: 12.5k] ------------------ 499| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 3}, "DSA/SHA-384"); 500| 0| case 0x9241A: ------------------ | Branch (500:7): [True: 0, False: 12.5k] ------------------ 501| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 4}, "DSA/SHA-512"); 502| 0| case 0x9241B: ------------------ | Branch (502:7): [True: 0, False: 12.5k] ------------------ 503| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 5}, "DSA/SHA-3(224)"); 504| 0| case 0x9241C: ------------------ | Branch (504:7): [True: 0, False: 12.5k] ------------------ 505| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 6}, "DSA/SHA-3(256)"); 506| 0| case 0x9241D: ------------------ | Branch (506:7): [True: 0, False: 12.5k] ------------------ 507| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 7}, "DSA/SHA-3(384)"); 508| 0| case 0x9241E: ------------------ | Branch (508:7): [True: 0, False: 12.5k] ------------------ 509| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 8}, "DSA/SHA-3(512)"); 510| 0| case 0x9241F: ------------------ | Branch (510:7): [True: 0, False: 12.5k] ------------------ 511| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 9}, "ECDSA/SHA-3(224)"); 512| 0| case 0x92420: ------------------ | Branch (512:7): [True: 0, False: 12.5k] ------------------ 513| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 10}, "ECDSA/SHA-3(256)"); 514| 0| case 0x92421: ------------------ | Branch (514:7): [True: 0, False: 12.5k] ------------------ 515| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 11}, "ECDSA/SHA-3(384)"); 516| 0| case 0x92422: ------------------ | Branch (516:7): [True: 0, False: 12.5k] ------------------ 517| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 12}, "ECDSA/SHA-3(512)"); 518| 0| case 0x92423: ------------------ | Branch (518:7): [True: 0, False: 12.5k] ------------------ 519| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 13}, "RSA/PKCS1v15(SHA-3(224))"); 520| 0| case 0x92424: ------------------ | Branch (520:7): [True: 0, False: 12.5k] ------------------ 521| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 14}, "RSA/PKCS1v15(SHA-3(256))"); 522| 0| case 0x92425: ------------------ | Branch (522:7): [True: 0, False: 12.5k] ------------------ 523| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 15}, "RSA/PKCS1v15(SHA-3(384))"); 524| 0| case 0x92426: ------------------ | Branch (524:7): [True: 0, False: 12.5k] ------------------ 525| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 16}, "RSA/PKCS1v15(SHA-3(512))"); 526| 0| case 0x92427: ------------------ | Branch (526:7): [True: 0, False: 12.5k] ------------------ 527| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 17}, "ML-DSA-4x4"); 528| 0| case 0x92428: ------------------ | Branch (528:7): [True: 0, False: 12.5k] ------------------ 529| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 18}, "ML-DSA-6x5"); 530| 0| case 0x92429: ------------------ | Branch (530:7): [True: 0, False: 12.5k] ------------------ 531| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 19}, "ML-DSA-8x7"); 532| 0| case 0x9242A: ------------------ | Branch (532:7): [True: 0, False: 12.5k] ------------------ 533| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 20}, "SLH-DSA-SHA2-128s"); 534| 0| case 0x9242B: ------------------ | Branch (534:7): [True: 0, False: 12.5k] ------------------ 535| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 21}, "SLH-DSA-SHA2-128f"); 536| 0| case 0x9242C: ------------------ | Branch (536:7): [True: 0, False: 12.5k] ------------------ 537| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 22}, "SLH-DSA-SHA2-192s"); 538| 0| case 0x9242D: ------------------ | Branch (538:7): [True: 0, False: 12.5k] ------------------ 539| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 23}, "SLH-DSA-SHA2-192f"); 540| 0| case 0x9242E: ------------------ | Branch (540:7): [True: 0, False: 12.5k] ------------------ 541| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 24}, "SLH-DSA-SHA2-256s"); 542| 0| case 0x9242F: ------------------ | Branch (542:7): [True: 0, False: 12.5k] ------------------ 543| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 25}, "SLH-DSA-SHA2-256f"); 544| 0| case 0x92430: ------------------ | Branch (544:7): [True: 0, False: 12.5k] ------------------ 545| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 26}, "SLH-DSA-SHAKE-128s"); 546| 0| case 0x92431: ------------------ | Branch (546:7): [True: 0, False: 12.5k] ------------------ 547| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 27}, "SLH-DSA-SHAKE-128f"); 548| 0| case 0x92432: ------------------ | Branch (548:7): [True: 0, False: 12.5k] ------------------ 549| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 28}, "SLH-DSA-SHAKE-192s"); 550| 0| case 0x92433: ------------------ | Branch (550:7): [True: 0, False: 12.5k] ------------------ 551| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 29}, "SLH-DSA-SHAKE-192f"); 552| 0| case 0x92434: ------------------ | Branch (552:7): [True: 0, False: 12.5k] ------------------ 553| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 30}, "SLH-DSA-SHAKE-256s"); 554| 0| case 0x92435: ------------------ | Branch (554:7): [True: 0, False: 12.5k] ------------------ 555| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 31}, "SLH-DSA-SHAKE-256f"); 556| 0| case 0x924D8: ------------------ | Branch (556:7): [True: 0, False: 12.5k] ------------------ 557| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 4, 1}, "ML-KEM-512"); 558| 0| case 0x924D9: ------------------ | Branch (558:7): [True: 0, False: 12.5k] ------------------ 559| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 4, 2}, "ML-KEM-768"); 560| 0| case 0x924DA: ------------------ | Branch (560:7): [True: 0, False: 12.5k] ------------------ 561| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 4, 3}, "ML-KEM-1024"); 562| 0| case 0x9479F: ------------------ | Branch (562:7): [True: 0, False: 12.5k] ------------------ 563| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 1}, "PKIX.AuthorityInformationAccess"); 564| 0| case 0x947A5: ------------------ | Branch (564:7): [True: 0, False: 12.5k] ------------------ 565| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 7}, "PKIX.IpAddrBlocks"); 566| 0| case 0x947A6: ------------------ | Branch (566:7): [True: 0, False: 12.5k] ------------------ 567| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 8}, "PKIX.AutonomousSysIds"); 568| 0| case 0x947B8: ------------------ | Branch (568:7): [True: 0, False: 12.5k] ------------------ 569| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 26}, "PKIX.TNAuthList"); 570| 0| case 0x94921: ------------------ | Branch (570:7): [True: 0, False: 12.5k] ------------------ 571| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 1}, "PKIX.ServerAuth"); 572| 0| case 0x94922: ------------------ | Branch (572:7): [True: 0, False: 12.5k] ------------------ 573| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 2}, "PKIX.ClientAuth"); 574| 0| case 0x94923: ------------------ | Branch (574:7): [True: 0, False: 12.5k] ------------------ 575| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 3}, "PKIX.CodeSigning"); 576| 0| case 0x94924: ------------------ | Branch (576:7): [True: 0, False: 12.5k] ------------------ 577| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 4}, "PKIX.EmailProtection"); 578| 0| case 0x94925: ------------------ | Branch (578:7): [True: 0, False: 12.5k] ------------------ 579| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 5}, "PKIX.IPsecEndSystem"); 580| 0| case 0x94926: ------------------ | Branch (580:7): [True: 0, False: 12.5k] ------------------ 581| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 6}, "PKIX.IPsecTunnel"); 582| 0| case 0x94927: ------------------ | Branch (582:7): [True: 0, False: 12.5k] ------------------ 583| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 7}, "PKIX.IPsecUser"); 584| 0| case 0x94928: ------------------ | Branch (584:7): [True: 0, False: 12.5k] ------------------ 585| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 8}, "PKIX.TimeStamping"); 586| 0| case 0x94929: ------------------ | Branch (586:7): [True: 0, False: 12.5k] ------------------ 587| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 9}, "PKIX.OCSPSigning"); 588| 0| case 0x94CEA: ------------------ | Branch (588:7): [True: 0, False: 12.5k] ------------------ 589| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 8, 5}, "PKIX.XMPPAddr"); 590| 0| case 0x94CEE: ------------------ | Branch (590:7): [True: 0, False: 12.5k] ------------------ 591| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 8, 9}, "PKIX.SmtpUTF8Mailbox"); 592| 0| case 0x954DB: ------------------ | Branch (592:7): [True: 0, False: 12.5k] ------------------ 593| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 311, 20, 2, 2}, "Microsoft SmartcardLogon"); 594| 0| case 0x954DC: ------------------ | Branch (594:7): [True: 0, False: 12.5k] ------------------ 595| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 311, 20, 2, 3}, "Microsoft UPN"); 596| 0| case 0x96B0E: ------------------ | Branch (596:7): [True: 0, False: 12.5k] ------------------ 597| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1}, "PKIX.OCSP"); 598| 0| case 0x96B0F: ------------------ | Branch (598:7): [True: 0, False: 12.5k] ------------------ 599| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 2}, "PKIX.CertificateAuthorityIssuers"); 600| 0| case 0x96B1B: ------------------ | Branch (600:7): [True: 0, False: 12.5k] ------------------ 601| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 14}, "PKIX.STIRTNList"); 602| 0| case 0x96C77: ------------------ | Branch (602:7): [True: 0, False: 12.5k] ------------------ 603| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 1, 3}, "PBE-SHA1-3DES"); 604| 0| case 0x96C78: ------------------ | Branch (604:7): [True: 0, False: 12.5k] ------------------ 605| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 1, 4}, "PBE-SHA1-2DES"); 606| 0| case 0x9A008: ------------------ | Branch (606:7): [True: 0, False: 12.5k] ------------------ 607| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 1}, "brainpool160r1"); 608| 0| case 0x9A00A: ------------------ | Branch (608:7): [True: 0, False: 12.5k] ------------------ 609| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 3}, "brainpool192r1"); 610| 0| case 0x9A00C: ------------------ | Branch (610:7): [True: 0, False: 12.5k] ------------------ 611| 0| 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: 12.5k] ------------------ 613| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 7}, "brainpool256r1"); 614| 0| case 0x9A010: ------------------ | Branch (614:7): [True: 0, False: 12.5k] ------------------ 615| 0| 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: 12.5k] ------------------ 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: 12.5k] ------------------ 619| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 13}, "brainpool512r1"); 620| 0| case 0xA0D61: ------------------ | Branch (620:7): [True: 0, False: 12.5k] ------------------ 621| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 3}, "McEliece"); 622| 0| case 0xA0D63: ------------------ | Branch (622:7): [True: 0, False: 12.5k] ------------------ 623| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 5}, "XMSS-draft6"); 624| 0| case 0xA0D66: ------------------ | Branch (624:7): [True: 0, False: 12.5k] ------------------ 625| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 8}, "XMSS-draft12"); 626| 0| case 0xA0D6B: ------------------ | Branch (626:7): [True: 0, False: 12.5k] ------------------ 627| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 13}, "HSS-LMS-Private-Key"); 628| 0| case 0xA0EE1: ------------------ | Branch (628:7): [True: 0, False: 12.5k] ------------------ 629| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 1}, "Serpent/CBC"); 630| 0| case 0xA0EE2: ------------------ | Branch (630:7): [True: 0, False: 12.5k] ------------------ 631| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2}, "Threefish-512/CBC"); 632| 0| case 0xA0EE3: ------------------ | Branch (632:7): [True: 0, False: 12.5k] ------------------ 633| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 3}, "Twofish/CBC"); 634| 0| case 0xA0F45: ------------------ | Branch (634:7): [True: 0, False: 12.5k] ------------------ 635| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 101}, "Serpent/GCM"); 636| 0| case 0xA0F46: ------------------ | Branch (636:7): [True: 0, False: 12.5k] ------------------ 637| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 102}, "Twofish/GCM"); 638| 0| case 0xA0FA2: ------------------ | Branch (638:7): [True: 0, False: 12.5k] ------------------ 639| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 4, 1}, "numsp256d1"); 640| 0| case 0xA0FA3: ------------------ | Branch (640:7): [True: 0, False: 12.5k] ------------------ 641| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 4, 2}, "numsp384d1"); 642| 0| case 0xA0FA4: ------------------ | Branch (642:7): [True: 0, False: 12.5k] ------------------ 643| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 4, 3}, "numsp512d1"); 644| 0| case 0xA244B: ------------------ | Branch (644:7): [True: 0, False: 12.5k] ------------------ 645| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 1}, "ClassicMcEliece_348864"); 646| 0| case 0xA244C: ------------------ | Branch (646:7): [True: 0, False: 12.5k] ------------------ 647| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 2}, "ClassicMcEliece_348864f"); 648| 0| case 0xA244D: ------------------ | Branch (648:7): [True: 0, False: 12.5k] ------------------ 649| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 3}, "ClassicMcEliece_460896"); 650| 0| case 0xA244E: ------------------ | Branch (650:7): [True: 0, False: 12.5k] ------------------ 651| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 4}, "ClassicMcEliece_460896f"); 652| 0| case 0xA244F: ------------------ | Branch (652:7): [True: 0, False: 12.5k] ------------------ 653| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 5}, "ClassicMcEliece_6688128"); 654| 0| case 0xA2450: ------------------ | Branch (654:7): [True: 0, False: 12.5k] ------------------ 655| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 6}, "ClassicMcEliece_6688128f"); 656| 0| case 0xA2451: ------------------ | Branch (656:7): [True: 0, False: 12.5k] ------------------ 657| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 7}, "ClassicMcEliece_6960119"); 658| 0| case 0xA2452: ------------------ | Branch (658:7): [True: 0, False: 12.5k] ------------------ 659| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 8}, "ClassicMcEliece_6960119f"); 660| 0| case 0xA2453: ------------------ | Branch (660:7): [True: 0, False: 12.5k] ------------------ 661| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 9}, "ClassicMcEliece_8192128"); 662| 0| case 0xA2454: ------------------ | Branch (662:7): [True: 0, False: 12.5k] ------------------ 663| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 10}, "ClassicMcEliece_8192128f"); 664| 0| case 0xAF989: ------------------ | Branch (664:7): [True: 0, False: 12.5k] ------------------ 665| 0| return if_match(oid, {1, 2, 840, 113549, 1, 1, 1}, "RSA"); 666| 0| case 0xAF98A: ------------------ | Branch (666:7): [True: 0, False: 12.5k] ------------------ 667| 0| return if_match(oid, {1, 2, 840, 113549, 1, 1, 2}, "RSA/PKCS1v15(MD2)"); 668| 0| case 0xAF98C: ------------------ | Branch (668:7): [True: 0, False: 12.5k] ------------------ 669| 0| return if_match(oid, {1, 2, 840, 113549, 1, 1, 4}, "RSA/PKCS1v15(MD5)"); 670| 0| case 0xAF98D: ------------------ | Branch (670:7): [True: 0, False: 12.5k] ------------------ 671| 0| return if_match(oid, {1, 2, 840, 113549, 1, 1, 5}, "RSA/PKCS1v15(SHA-1)"); 672| 0| case 0xAF98F: ------------------ | Branch (672:7): [True: 0, False: 12.5k] ------------------ 673| 0| return if_match(oid, {1, 2, 840, 113549, 1, 1, 7}, "RSA/OAEP"); 674| 0| case 0xAF990: ------------------ | Branch (674:7): [True: 0, False: 12.5k] ------------------ 675| 0| return if_match(oid, {1, 2, 840, 113549, 1, 1, 8}, "MGF1"); 676| 0| case 0xAF992: ------------------ | Branch (676:7): [True: 0, False: 12.5k] ------------------ 677| 0| return if_match(oid, {1, 2, 840, 113549, 1, 1, 10}, "RSA/PSS"); 678| 0| case 0xAF993: ------------------ | Branch (678:7): [True: 0, False: 12.5k] ------------------ 679| 0| return if_match(oid, {1, 2, 840, 113549, 1, 1, 11}, "RSA/PKCS1v15(SHA-256)"); 680| 0| case 0xAF994: ------------------ | Branch (680:7): [True: 0, False: 12.5k] ------------------ 681| 0| return if_match(oid, {1, 2, 840, 113549, 1, 1, 12}, "RSA/PKCS1v15(SHA-384)"); 682| 0| case 0xAF995: ------------------ | Branch (682:7): [True: 0, False: 12.5k] ------------------ 683| 0| return if_match(oid, {1, 2, 840, 113549, 1, 1, 13}, "RSA/PKCS1v15(SHA-512)"); 684| 0| case 0xAF996: ------------------ | Branch (684:7): [True: 0, False: 12.5k] ------------------ 685| 0| return if_match(oid, {1, 2, 840, 113549, 1, 1, 14}, "RSA/PKCS1v15(SHA-224)"); 686| 0| case 0xAF998: ------------------ | Branch (686:7): [True: 0, False: 12.5k] ------------------ 687| 0| return if_match(oid, {1, 2, 840, 113549, 1, 1, 16}, "RSA/PKCS1v15(SHA-512-256)"); 688| 0| case 0xAFC98: ------------------ | Branch (688:7): [True: 0, False: 12.5k] ------------------ 689| 0| return if_match(oid, {1, 2, 840, 113549, 1, 5, 12}, "PKCS5.PBKDF2"); 690| 0| case 0xAFC99: ------------------ | Branch (690:7): [True: 0, False: 12.5k] ------------------ 691| 0| return if_match(oid, {1, 2, 840, 113549, 1, 5, 13}, "PBE-PKCS5v20"); 692| 0| case 0xAFE0F: ------------------ | Branch (692:7): [True: 0, False: 12.5k] ------------------ 693| 0| return if_match(oid, {1, 2, 840, 113549, 1, 7, 1}, "PKCS7.Data"); 694| 0| case 0xAFE14: ------------------ | Branch (694:7): [True: 0, False: 12.5k] ------------------ 695| 0| return if_match(oid, {1, 2, 840, 113549, 1, 7, 6}, "PKCS7.EncryptedData"); 696| 0| case 0xAFF91: ------------------ | Branch (696:7): [True: 0, False: 12.5k] ------------------ 697| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 1}, "PKCS9.EmailAddress"); 698| 0| case 0xAFF92: ------------------ | Branch (698:7): [True: 0, False: 12.5k] ------------------ 699| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 2}, "PKCS9.UnstructuredName"); 700| 0| case 0xAFF93: ------------------ | Branch (700:7): [True: 0, False: 12.5k] ------------------ 701| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 3}, "PKCS9.ContentType"); 702| 0| case 0xAFF94: ------------------ | Branch (702:7): [True: 0, False: 12.5k] ------------------ 703| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 4}, "PKCS9.MessageDigest"); 704| 0| case 0xAFF97: ------------------ | Branch (704:7): [True: 0, False: 12.5k] ------------------ 705| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 7}, "PKCS9.ChallengePassword"); 706| 0| case 0xAFF9E: ------------------ | Branch (706:7): [True: 0, False: 12.5k] ------------------ 707| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 14}, "PKCS9.ExtensionRequest"); 708| 0| case 0xAFFA4: ------------------ | Branch (708:7): [True: 0, False: 12.5k] ------------------ 709| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 20}, "PKCS9.FriendlyName"); 710| 0| case 0xAFFA5: ------------------ | Branch (710:7): [True: 0, False: 12.5k] ------------------ 711| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 21}, "PKCS9.LocalKeyId"); 712| 0| case 0xC0226: ------------------ | Branch (712:7): [True: 0, False: 12.5k] ------------------ 713| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 11591, 4, 11}, "Scrypt"); 714| 0| case 0xC0A67: ------------------ | Branch (714:7): [True: 0, False: 12.5k] ------------------ 715| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 11591, 15, 1}, "OpenPGP.Ed25519"); 716| 0| case 0xC4CE5: ------------------ | Branch (716:7): [True: 0, False: 12.5k] ------------------ 717| 0| return if_match(oid, {1, 2, 643, 100, 1}, "GOST.OGRN"); 718| 0| case 0xC4D53: ------------------ | Branch (718:7): [True: 0, False: 12.5k] ------------------ 719| 0| return if_match(oid, {1, 2, 643, 100, 111}, "GOST.SubjectSigningTool"); 720| 0| case 0xC4D54: ------------------ | Branch (720:7): [True: 0, False: 12.5k] ------------------ 721| 0| return if_match(oid, {1, 2, 643, 100, 112}, "GOST.IssuerSigningTool"); 722| 0| case 0xC9C50: ------------------ | Branch (722:7): [True: 0, False: 12.5k] ------------------ 723| 0| return if_match(oid, {1, 2, 840, 10045, 3, 1, 1}, "secp192r1"); 724| 0| case 0xC9C51: ------------------ | Branch (724:7): [True: 0, False: 12.5k] ------------------ 725| 0| return if_match(oid, {1, 2, 840, 10045, 3, 1, 2}, "x962_p192v2"); 726| 0| case 0xC9C52: ------------------ | Branch (726:7): [True: 0, False: 12.5k] ------------------ 727| 0| return if_match(oid, {1, 2, 840, 10045, 3, 1, 3}, "x962_p192v3"); 728| 0| case 0xC9C53: ------------------ | Branch (728:7): [True: 0, False: 12.5k] ------------------ 729| 0| return if_match(oid, {1, 2, 840, 10045, 3, 1, 4}, "x962_p239v1"); 730| 0| case 0xC9C54: ------------------ | Branch (730:7): [True: 0, False: 12.5k] ------------------ 731| 0| return if_match(oid, {1, 2, 840, 10045, 3, 1, 5}, "x962_p239v2"); 732| 0| case 0xC9C55: ------------------ | Branch (732:7): [True: 0, False: 12.5k] ------------------ 733| 0| return if_match(oid, {1, 2, 840, 10045, 3, 1, 6}, "x962_p239v3"); 734| 1| case 0xC9C56: ------------------ | Branch (734:7): [True: 1, False: 12.5k] ------------------ 735| 1| return if_match(oid, {1, 2, 840, 10045, 3, 1, 7}, "secp256r1"); 736| 0| case 0xCFA13: ------------------ | Branch (736:7): [True: 0, False: 12.5k] ------------------ 737| 0| return if_match(oid, {1, 2, 840, 10040, 4, 1}, "DSA"); 738| 0| case 0xCFA15: ------------------ | Branch (738:7): [True: 0, False: 12.5k] ------------------ 739| 0| return if_match(oid, {1, 2, 840, 10040, 4, 3}, "DSA/SHA-1"); 740| 0| default: ------------------ | Branch (740:7): [True: 0, False: 12.5k] ------------------ 741| 0| return {}; 742| 12.5k| } 743| 12.5k|} _ZN5Botan7OID_Map22lookup_static_oid_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 746| 52.8k|std::optional OID_Map::lookup_static_oid_name(std::string_view req) { 747| 52.8k| const uint32_t hc = hash_oid_name(req); 748| | 749| 52.8k| switch(hc) { 750| 0| case 0x00545: ------------------ | Branch (750:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 757| 0| return if_match(req, "MD5", {1, 2, 840, 113549, 2, 5}); 758| 0| case 0x02293: ------------------ | Branch (758:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 763| 0| return if_match(req, "secp160k1", {1, 3, 132, 0, 9}); 764| 0| case 0x044B3: ------------------ | Branch (764:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 767| 0| return if_match(req, "secp160r1", {1, 3, 132, 0, 8}); 768| 0| case 0x048B3: ------------------ | Branch (768:7): [True: 0, False: 52.8k] ------------------ 769| 0| return if_match(req, "secp160r2", {1, 3, 132, 0, 30}); 770| 0| case 0x05CDA: ------------------ | Branch (770:7): [True: 0, False: 52.8k] ------------------ 771| 0| return if_match(req, "X520.Country", {2, 5, 4, 6}); 772| 0| case 0x07783: ------------------ | Branch (772:7): [True: 0, False: 52.8k] ------------------ 773| 0| 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: 52.8k] ------------------ 775| 0| return if_match(req, "numsp384d1", {1, 3, 6, 1, 4, 1, 25258, 4, 2}); 776| 100| case 0x08A92: ------------------ | Branch (776:7): [True: 100, False: 52.7k] ------------------ 777| 100| 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: 52.8k] ------------------ 779| 0| return if_match(req, "DES/CBC", {1, 3, 14, 3, 2, 7}); 780| 0| case 0x0B2D6: ------------------ | Branch (780:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 801| 0| return if_match(req, "secp192k1", {1, 3, 132, 0, 31}); 802| 0| case 0x113D6: ------------------ | Branch (802:7): [True: 0, False: 52.8k] ------------------ 803| 0| return if_match(req, "X520.DNQualifier", {2, 5, 4, 46}); 804| 0| case 0x11A7A: ------------------ | Branch (804:7): [True: 0, False: 52.8k] ------------------ 805| 0| return if_match(req, "secp192r1", {1, 2, 840, 10045, 3, 1, 1}); 806| 0| case 0x12096: ------------------ | Branch (806:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 809| 0| return if_match(req, "X520.GenerationalQualifier", {2, 5, 4, 44}); 810| 0| case 0x1445B: ------------------ | Branch (810:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 819| 0| return if_match(req, "Compression.Zlib", {1, 2, 840, 113549, 1, 9, 16, 3, 8}); 820| 0| case 0x1579E: ------------------ | Branch (820:7): [True: 0, False: 52.8k] ------------------ 821| 0| return if_match(req, "Streebog-512", {1, 2, 643, 7, 1, 1, 2, 3}); 822| 0| case 0x1701A: ------------------ | Branch (822:7): [True: 0, False: 52.8k] ------------------ 823| 0| return if_match(req, "X509v3.AnyExtendedKeyUsage", {2, 5, 29, 37, 0}); 824| 0| case 0x175EF: ------------------ | Branch (824:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 827| 0| return if_match(req, "X520.GivenName", {2, 5, 4, 42}); 828| 0| case 0x17AD9: ------------------ | Branch (828:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 839| 0| return if_match(req, "X509v3.InvalidityDate", {2, 5, 29, 24}); 840| 0| case 0x19851: ------------------ | Branch (840:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 851| 0| return if_match(req, "ML-KEM-512", {2, 16, 840, 1, 101, 3, 4, 4, 1}); 852| 0| case 0x2216B: ------------------ | Branch (852:7): [True: 0, False: 52.8k] ------------------ 853| 0| 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: 52.8k] ------------------ 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: 52.8k] ------------------ 857| 0| return if_match(req, "X520.Initials", {2, 5, 4, 43}); 858| 0| case 0x271AC: ------------------ | Branch (858:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 869| 0| return if_match(req, "SHA-224", {2, 16, 840, 1, 101, 3, 4, 2, 4}); 870| 8.44k| case 0x2AB30: ------------------ | Branch (870:7): [True: 8.44k, False: 44.3k] ------------------ 871| 8.44k| 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 897| 0| return if_match(req, "HMAC(SHA-512)", {1, 2, 840, 113549, 2, 11}); 898| 651| case 0x31C6D: ------------------ | Branch (898:7): [True: 651, False: 52.1k] ------------------ 899| 651| return if_match(req, "secp384r1", {1, 3, 132, 0, 34}); 900| 0| case 0x32899: ------------------ | Branch (900:7): [True: 0, False: 52.8k] ------------------ 901| 0| return if_match(req, "TripleDES/CBC", {1, 2, 840, 113549, 3, 7}); 902| 0| case 0x33C9C: ------------------ | Branch (902:7): [True: 0, False: 52.8k] ------------------ 903| 0| 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 909| 0| return if_match(req, "Ed25519", {1, 3, 101, 112}); 910| 0| case 0x3649D: ------------------ | Branch (910:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 919| 0| return if_match(req, "Ed448", {1, 3, 101, 113}); 920| 2.80k| case 0x3A438: ------------------ | Branch (920:7): [True: 2.80k, False: 50.0k] ------------------ 921| 2.80k| 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: 52.8k] ------------------ 923| 0| return if_match(req, "DH", {1, 2, 840, 10046, 2, 1}); 924| 11.6k| case 0x3AC83: ------------------ | Branch (924:7): [True: 11.6k, False: 41.1k] ------------------ 925| 11.6k| return if_match(req, "MGF1", {1, 2, 840, 113549, 1, 1, 8}); 926| 0| case 0x3ACBA: ------------------ | Branch (926:7): [True: 0, False: 52.8k] ------------------ 927| 0| return if_match(req, "X509v3.IssuerAlternativeName", {2, 5, 29, 18}); 928| 0| case 0x3B273: ------------------ | Branch (928:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 931| 0| return if_match(req, "X509v3.PrivateKeyUsagePeriod", {2, 5, 29, 16}); 932| 0| case 0x3BC8A: ------------------ | Branch (932:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 937| 0| return if_match(req, "DSA", {1, 2, 840, 10040, 4, 1}); 938| 0| case 0x3E249: ------------------ | Branch (938:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 943| 0| return if_match(req, "GOST.OGRN", {1, 2, 643, 100, 1}); 944| 0| case 0x3F99F: ------------------ | Branch (944:7): [True: 0, False: 52.8k] ------------------ 945| 0| return if_match(req, "X509v3.BasicConstraints", {2, 5, 29, 19}); 946| 0| case 0x40726: ------------------ | Branch (946:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 953| 0| return if_match(req, "X509v3.CRLDistributionPoints", {2, 5, 29, 31}); 954| 0| case 0x437FB: ------------------ | Branch (954:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 969| 0| return if_match(req, "X509v3.ReasonCode", {2, 5, 29, 21}); 970| 0| case 0x45DA5: ------------------ | Branch (970:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 973| 0| return if_match(req, "X509v3.PolicyConstraints", {2, 5, 29, 36}); 974| 0| case 0x480F7: ------------------ | Branch (974:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 993| 0| return if_match(req, "X509v3.AnyPolicy", {2, 5, 29, 32, 0}); 994| 124| case 0x4DE49: ------------------ | Branch (994:7): [True: 124, False: 52.7k] ------------------ 995| 124| 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: 52.8k] ------------------ 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: 52.8k] ------------------ 999| 0| return if_match(req, "RSA", {1, 2, 840, 113549, 1, 1, 1}); 1000| 0| case 0x501CB: ------------------ | Branch (1000:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 1003| 0| return if_match(req, "GOST-34.10/GOST-R-34.11-94", {1, 2, 643, 2, 2, 3}); 1004| 248| case 0x504BE: ------------------ | Branch (1004:7): [True: 248, False: 52.5k] ------------------ 1005| 248| return if_match(req, "ECDSA/SHA-256", {1, 2, 840, 10045, 4, 3, 2}); 1006| 0| case 0x509C3: ------------------ | Branch (1006:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1041| 0| return if_match(req, "ECGDSA/SHA-256", {1, 3, 36, 3, 3, 2, 5, 4, 4}); 1042| 398| case 0x5898B: ------------------ | Branch (1042:7): [True: 398, False: 52.4k] ------------------ 1043| 398| 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1047| 0| return if_match(req, "X509v3.SubjectKeyIdentifier", {2, 5, 29, 14}); 1048| 0| case 0x5A1E1: ------------------ | Branch (1048:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 1051| 0| return if_match(req, "X520.CommonName", {2, 5, 4, 3}); 1052| 0| case 0x5A990: ------------------ | Branch (1052:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1057| 0| return if_match(req, "X520.Surname", {2, 5, 4, 4}); 1058| 0| case 0x5AF2C: ------------------ | Branch (1058:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 1061| 0| return if_match(req, "X509v3.KeyUsage", {2, 5, 29, 15}); 1062| 0| case 0x5BDDB: ------------------ | Branch (1062:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1071| 0| return if_match(req, "X520.SerialNumber", {2, 5, 4, 5}); 1072| 0| case 0x5D375: ------------------ | Branch (1072:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1081| 0| return if_match(req, "SM2", {1, 2, 156, 10197, 1, 301, 1}); 1082| 0| case 0x5ED05: ------------------ | Branch (1082:7): [True: 0, False: 52.8k] ------------------ 1083| 0| return if_match(req, "SM3", {1, 2, 156, 10197, 1, 401}); 1084| 126| case 0x5FDC6: ------------------ | Branch (1084:7): [True: 126, False: 52.7k] ------------------ 1085| 126| return if_match(req, "ECDSA/SHA-384", {1, 2, 840, 10045, 4, 3, 3}); 1086| 0| case 0x6199F: ------------------ | Branch (1086:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1095| 0| return if_match(req, "sm2p256v1", {1, 2, 156, 10197, 1, 301}); 1096| 0| case 0x6697B: ------------------ | Branch (1096:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 1099| 0| return if_match(req, "X520.State", {2, 5, 4, 8}); 1100| 0| case 0x67B9B: ------------------ | Branch (1100:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1107| 0| return if_match(req, "PKCS9.ExtensionRequest", {1, 2, 840, 113549, 1, 9, 14}); 1108| 6.26k| case 0x69126: ------------------ | Branch (1108:7): [True: 6.26k, False: 46.5k] ------------------ 1109| 6.26k| return if_match(req, "X509v3.SubjectAlternativeName", {2, 5, 29, 17}); 1110| 0| case 0x692F8: ------------------ | Branch (1110:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1115| 0| return if_match(req, "PKIX.IpAddrBlocks", {1, 3, 6, 1, 5, 5, 7, 1, 7}); 1116| 6.26k| case 0x6A7CA: ------------------ | Branch (1116:7): [True: 6.26k, False: 46.5k] ------------------ 1117| 6.26k| return if_match(req, "ECDSA", {1, 2, 840, 10045, 2, 1}); 1118| 0| case 0x6BD26: ------------------ | Branch (1118:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1129| 0| return if_match(req, "PKIX.AuthorityInformationAccess", {1, 3, 6, 1, 5, 5, 7, 1, 1}); 1130| 593| case 0x70BB6: ------------------ | Branch (1130:7): [True: 593, False: 52.2k] ------------------ 1131| 593| 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1155| 0| return if_match(req, "PKCS9.LocalKeyId", {1, 2, 840, 113549, 1, 9, 21}); 1156| 626| case 0x76A19: ------------------ | Branch (1156:7): [True: 626, False: 52.2k] ------------------ 1157| 626| 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1161| 0| return if_match(req, "secp224k1", {1, 3, 132, 0, 32}); 1162| 0| case 0x781B9: ------------------ | Branch (1162:7): [True: 0, False: 52.8k] ------------------ 1163| 0| return if_match(req, "secp224r1", {1, 3, 132, 0, 33}); 1164| 0| case 0x78ABE: ------------------ | Branch (1164:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1171| 0| return if_match(req, "X509v3.ExtendedKeyUsage", {2, 5, 29, 37}); 1172| 0| case 0x7AE67: ------------------ | Branch (1172:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1187| 0| return if_match(req, "SphincsPlus-shake-192s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 3}); 1188| 0| case 0x7DB91: ------------------ | Branch (1188:7): [True: 0, False: 52.8k] ------------------ 1189| 0| return if_match(req, "GOST-34.10", {1, 2, 643, 2, 2, 19}); 1190| 174| case 0x7E319: ------------------ | Branch (1190:7): [True: 174, False: 52.6k] ------------------ 1191| 174| return if_match(req, "ECDSA/SHA-512", {1, 2, 840, 10045, 4, 3, 4}); 1192| 0| case 0x7E874: ------------------ | Branch (1192:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1199| 0| return if_match(req, "X520.Organization", {2, 5, 4, 10}); 1200| 0| case 0x80340: ------------------ | Branch (1200:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1211| 0| return if_match(req, "Threefish-512/CBC", {1, 3, 6, 1, 4, 1, 25258, 3, 2}); 1212| 114| case 0x83EA7: ------------------ | Branch (1212:7): [True: 114, False: 52.7k] ------------------ 1213| 114| 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1219| 0| return if_match(req, "secp256k1", {1, 3, 132, 0, 10}); 1220| 882| case 0x85381: ------------------ | Branch (1220:7): [True: 882, False: 51.9k] ------------------ 1221| 882| return if_match(req, "secp256r1", {1, 2, 840, 10045, 3, 1, 7}); 1222| 0| case 0x854FC: ------------------ | Branch (1222:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1231| 0| return if_match(req, "PKCS9.EmailAddress", {1, 2, 840, 113549, 1, 9, 1}); 1232| 0| case 0x87D27: ------------------ | Branch (1232:7): [True: 0, False: 52.8k] ------------------ 1233| 0| 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: 52.8k] ------------------ 1235| 0| return if_match(req, "X509v3.AuthorityKeyIdentifier", {2, 5, 29, 35}); 1236| 62| case 0x889B1: ------------------ | Branch (1236:7): [True: 62, False: 52.7k] ------------------ 1237| 62| return if_match(req, "ECDSA/SHA-1", {1, 2, 840, 10045, 4, 1}); 1238| 0| case 0x89658: ------------------ | Branch (1238:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1247| 0| return if_match(req, "X509v3.NoRevocationAvailable", {2, 5, 29, 56}); 1248| 0| case 0x8CE3D: ------------------ | Branch (1248:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 1251| 0| return if_match(req, "ECKCDSA", {1, 0, 14888, 3, 0, 5}); 1252| 0| case 0x8E0C1: ------------------ | Branch (1252:7): [True: 0, False: 52.8k] ------------------ 1253| 0| return if_match(req, "X509v3.CertificatePolicies", {2, 5, 29, 32}); 1254| 0| case 0x8E39A: ------------------ | Branch (1254:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1267| 0| return if_match(req, "X25519", {1, 3, 101, 110}); 1268| 0| case 0x91DC4: ------------------ | Branch (1268:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1277| 0| return if_match(req, "SLH-DSA-SHAKE-128s", {2, 16, 840, 1, 101, 3, 4, 3, 26}); 1278| 0| case 0x952D6: ------------------ | Branch (1278:7): [True: 0, False: 52.8k] ------------------ 1279| 0| 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1287| 0| return if_match(req, "SEED/CBC", {1, 2, 410, 200004, 1, 4}); 1288| 0| case 0x980E7: ------------------ | Branch (1288:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 1291| 0| return if_match(req, "GOST.SubjectSigningTool", {1, 2, 643, 100, 111}); 1292| 0| case 0x98B03: ------------------ | Branch (1292:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1301| 0| return if_match(req, "X520.OrganizationalUnit", {2, 5, 4, 11}); 1302| 0| case 0x9B851: ------------------ | Branch (1302:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1315| 0| return if_match(req, "RIPEMD-160", {1, 3, 36, 3, 2, 1}); 1316| 116| case 0x9D503: ------------------ | Branch (1316:7): [True: 116, False: 52.7k] ------------------ 1317| 116| 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1323| 0| return if_match(req, "X448", {1, 3, 101, 111}); 1324| 0| case 0x9F7E2: ------------------ | Branch (1324:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1331| 0| return if_match(req, "X509v3.CRLNumber", {2, 5, 29, 20}); 1332| 0| case 0xA3005: ------------------ | Branch (1332:7): [True: 0, False: 52.8k] ------------------ 1333| 0| return if_match(req, "X520.Title", {2, 5, 4, 12}); 1334| 0| case 0xA323F: ------------------ | Branch (1334:7): [True: 0, False: 52.8k] ------------------ 1335| 0| return if_match(req, "X509v3.NameConstraints", {2, 5, 29, 30}); 1336| 0| case 0xA3C55: ------------------ | Branch (1336:7): [True: 0, False: 52.8k] ------------------ 1337| 0| return if_match(req, "X520.Pseudonym", {2, 5, 4, 65}); 1338| 0| case 0xA4809: ------------------ | Branch (1338:7): [True: 0, False: 52.8k] ------------------ 1339| 0| return if_match(req, "SphincsPlus-sha2-256f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 6}); 1340| 594| case 0xA57AF: ------------------ | Branch (1340:7): [True: 594, False: 52.2k] ------------------ 1341| 594| return if_match(req, "secp521r1", {1, 3, 132, 0, 35}); 1342| 0| case 0xA5DA9: ------------------ | Branch (1342:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1357| 0| return if_match(req, "GOST.IssuerSigningTool", {1, 2, 643, 100, 112}); 1358| 0| case 0xABD24: ------------------ | Branch (1358:7): [True: 0, False: 52.8k] ------------------ 1359| 0| return if_match(req, "RSA/OAEP", {1, 2, 840, 113549, 1, 1, 7}); 1360| 0| case 0xAC2EC: ------------------ | Branch (1360:7): [True: 0, False: 52.8k] ------------------ 1361| 0| return if_match(req, "Streebog-256", {1, 2, 643, 7, 1, 1, 2, 2}); 1362| 0| case 0xAC3DD: ------------------ | Branch (1362:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 1365| 0| return if_match(req, "PBE-SHA1-3DES", {1, 2, 840, 113549, 1, 12, 1, 3}); 1366| 0| case 0xAE6FE: ------------------ | Branch (1366:7): [True: 0, False: 52.8k] ------------------ 1367| 0| 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1371| 0| return if_match(req, "ECDH", {1, 3, 132, 1, 12}); 1372| 0| case 0xAFA6A: ------------------ | Branch (1372:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1379| 0| return if_match(req, "X520.Locality", {2, 5, 4, 7}); 1380| 0| case 0xB2FBD: ------------------ | Branch (1380:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1395| 0| return if_match(req, "X509v3.CRLIssuingDistributionPoint", {2, 5, 29, 28}); 1396| 0| case 0xB72D4: ------------------ | Branch (1396:7): [True: 0, False: 52.8k] ------------------ 1397| 0| return if_match(req, "Microsoft UPN", {1, 3, 6, 1, 4, 1, 311, 20, 2, 3}); 1398| 11.6k| case 0xB73A5: ------------------ | Branch (1398:7): [True: 11.6k, False: 41.1k] ------------------ 1399| 11.6k| return if_match(req, "RSA/PSS", {1, 2, 840, 113549, 1, 1, 10}); 1400| 0| case 0xB84B3: ------------------ | Branch (1400:7): [True: 0, False: 52.8k] ------------------ 1401| 0| return if_match(req, "PKIX.CodeSigning", {1, 3, 6, 1, 5, 5, 7, 3, 3}); 1402| 0| case 0xB8CB9: ------------------ | Branch (1402:7): [True: 0, False: 52.8k] ------------------ 1403| 0| 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1411| 0| return if_match(req, "X520.StreetAddress", {2, 5, 4, 9}); 1412| 0| case 0xBCB45: ------------------ | Branch (1412:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1421| 0| return if_match(req, "X509v3.HoldInstructionCode", {2, 5, 29, 23}); 1422| 0| case 0xBDCA9: ------------------ | Branch (1422:7): [True: 0, False: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 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: 52.8k] ------------------ 1431| 0| return if_match(req, "SphincsPlus-haraka-256f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 6}); 1432| 0| case 0xC1875: ------------------ | Branch (1432:7): [True: 0, False: 52.8k] ------------------ 1433| 0| return if_match(req, "SHA-1", {1, 3, 14, 3, 2, 26}); 1434| 0| case 0xC28D1: ------------------ | Branch (1434:7): [True: 0, False: 52.8k] ------------------ 1435| 0| return if_match(req, "PKIX.OCSPSigning", {1, 3, 6, 1, 5, 5, 7, 3, 9}); 1436| 967| case 0xC42CA: ------------------ | Branch (1436:7): [True: 967, False: 51.8k] ------------------ 1437| 967| return if_match(req, "brainpool256r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 7}); 1438| 0| default: ------------------ | Branch (1438:7): [True: 0, False: 52.8k] ------------------ 1439| 0| return {}; 1440| 52.8k| } 1441| 52.8k|} _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| 12.5k|std::optional if_match(const OID& oid, std::initializer_list val, std::string_view name) { 19| 12.5k| if(oid.matches(val)) { ------------------ | Branch (19:7): [True: 12.5k, False: 0] ------------------ 20| 12.5k| return name; 21| 12.5k| } else { 22| 0| return {}; 23| 0| } 24| 12.5k|} static_oids.cpp:_ZN5Botan12_GLOBAL__N_113hash_oid_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 34| 52.8k|uint32_t hash_oid_name(std::string_view s) { 35| 52.8k| uint64_t hash = 0x8188B31879A4879A; 36| | 37| 489k| for(const char c : s) { ------------------ | Branch (37:21): [True: 489k, False: 52.8k] ------------------ 38| 489k| hash *= 251; 39| 489k| hash += c; 40| 489k| } 41| | 42| 52.8k| return static_cast(hash % 805289); 43| 52.8k|} static_oids.cpp:_ZN5Botan12_GLOBAL__N_18if_matchENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_St16initializer_listIjE: 26| 52.8k|std::optional if_match(std::string_view req, std::string_view actual, std::initializer_list oid) { 27| 52.8k| if(req == actual) { ------------------ | Branch (27:7): [True: 52.8k, False: 0] ------------------ 28| 52.8k| return OID(oid); 29| 52.8k| } else { 30| 0| return {}; 31| 0| } 32| 52.8k|} _ZN5Botan20Buffered_Computation5finalENSt3__14spanIhLm18446744073709551615EEE: 54| 56.1k|void Buffered_Computation::final(std::span out) { 55| 56.1k| BOTAN_ARG_CHECK(out.size() >= output_length(), "Output buffer has insufficient capacity"); ------------------ | | 35| 56.1k| do { \ | | 36| 56.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 56.1k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 56.1k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 56.1k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 56.1k] | | ------------------ ------------------ 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| 56.1k| final_result(out.first(output_length())); 59| 56.1k|} _ZN5Botan18SymmetricAlgorithm7set_keyENSt3__14spanIKhLm18446744073709551615EEE: 22| 3.67k|void SymmetricAlgorithm::set_key(std::span key) { 23| 3.67k| if(!valid_keylength(key.size())) { ------------------ | Branch (23:7): [True: 0, False: 3.67k] ------------------ 24| 0| throw Invalid_Key_Length(name(), key.size()); 25| 0| } 26| 3.67k| key_schedule(key); 27| 3.67k|} _ZN5Botan11OctetStringC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 27| 1.97k|OctetString::OctetString(std::string_view hex_string) { 28| 1.97k| if(!hex_string.empty()) { ------------------ | Branch (28:7): [True: 0, False: 1.97k] ------------------ 29| 0| m_data.resize(1 + hex_string.length() / 2); 30| 0| m_data.resize(hex_decode(m_data.data(), hex_string)); 31| 0| } 32| 1.97k|} _ZNK5Botan7AES_12811parallelismEv: 867| 74|size_t AES_128::parallelism() const { 868| 74| return aes_parallelism(); 869| 74|} _ZNK5Botan7AES_25611parallelismEv: 875| 237|size_t AES_256::parallelism() const { 876| 237| return aes_parallelism(); 877| 237|} _ZNK5Botan7AES_12819has_keying_materialEv: 879| 3.81k|bool AES_128::has_keying_material() const { 880| 3.81k| return !m_EK.empty(); 881| 3.81k|} _ZNK5Botan7AES_25619has_keying_materialEv: 887| 1.07k|bool AES_256::has_keying_material() const { 888| 1.07k| return !m_EK.empty(); 889| 1.07k|} _ZNK5Botan7AES_1289encrypt_nEPKhPhm: 891| 3.59k|void AES_128::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 892| 3.59k| assert_key_material_set(); 893| | 894| 3.59k|#if defined(BOTAN_HAS_AES_VAES) 895| 3.59k| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (895:7): [True: 0, False: 3.59k] ------------------ 896| 0| return x86_vaes_encrypt_n(in, out, blocks); 897| 0| } 898| 3.59k|#endif 899| | 900| 3.59k|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 901| 3.59k| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (901:7): [True: 3.59k, False: 0] ------------------ 902| 3.59k| return hw_aes_encrypt_n(in, out, blocks); 903| 3.59k| } 904| 0|#endif 905| | 906| 0|#if defined(BOTAN_HAS_AES_VPERM) 907| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (907:7): [True: 0, False: 0] ------------------ 908| 0| return vperm_encrypt_n(in, out, blocks); 909| 0| } 910| 0|#endif 911| | 912| 0| aes_encrypt_n(in, out, blocks, m_EK); 913| 0|} _ZNK5Botan7AES_1289decrypt_nEPKhPhm: 915| 55|void AES_128::decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 916| 55| assert_key_material_set(); 917| | 918| 55|#if defined(BOTAN_HAS_AES_VAES) 919| 55| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (919:7): [True: 0, False: 55] ------------------ 920| 0| return x86_vaes_decrypt_n(in, out, blocks); 921| 0| } 922| 55|#endif 923| | 924| 55|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 925| 55| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (925:7): [True: 55, False: 0] ------------------ 926| 55| return hw_aes_decrypt_n(in, out, blocks); 927| 55| } 928| 0|#endif 929| | 930| 0|#if defined(BOTAN_HAS_AES_VPERM) 931| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (931:7): [True: 0, False: 0] ------------------ 932| 0| return vperm_decrypt_n(in, out, blocks); 933| 0| } 934| 0|#endif 935| | 936| 0| aes_decrypt_n(in, out, blocks, m_DK); 937| 0|} _ZN5Botan7AES_12812key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 939| 95|void AES_128::key_schedule(std::span key) { 940| 95|#if defined(BOTAN_HAS_AES_NI) 941| 95| if(CPUID::has(CPUID::Feature::AESNI)) { ------------------ | Branch (941:7): [True: 95, False: 0] ------------------ 942| 95| return aesni_key_schedule(key.data(), key.size()); 943| 95| } 944| 0|#endif 945| | 946| 0|#if defined(BOTAN_HAS_AES_VAES) 947| 0| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (947:7): [True: 0, False: 0] ------------------ 948| 0| return aes_key_schedule(key.data(), key.size(), m_EK, m_DK, true); 949| 0| } 950| 0|#endif 951| | 952| 0|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 953| 0| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (953:7): [True: 0, False: 0] ------------------ 954| 0| constexpr bool is_little_endian = std::endian::native == std::endian::little; 955| 0| return aes_key_schedule(key.data(), key.size(), m_EK, m_DK, is_little_endian); 956| 0| } 957| 0|#endif 958| | 959| 0|#if defined(BOTAN_HAS_AES_VPERM) 960| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (960:7): [True: 0, False: 0] ------------------ 961| 0| return vperm_key_schedule(key.data(), key.size()); 962| 0| } 963| 0|#endif 964| | 965| 0| aes_key_schedule(key.data(), key.size(), m_EK, m_DK); 966| 0|} _ZNK5Botan7AES_2569encrypt_nEPKhPhm: 1055| 525|void AES_256::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 1056| 525| assert_key_material_set(); 1057| | 1058| 525|#if defined(BOTAN_HAS_AES_VAES) 1059| 525| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (1059:7): [True: 0, False: 525] ------------------ 1060| 0| return x86_vaes_encrypt_n(in, out, blocks); 1061| 0| } 1062| 525|#endif 1063| | 1064| 525|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 1065| 525| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (1065:7): [True: 525, False: 0] ------------------ 1066| 525| return hw_aes_encrypt_n(in, out, blocks); 1067| 525| } 1068| 0|#endif 1069| | 1070| 0|#if defined(BOTAN_HAS_AES_VPERM) 1071| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (1071:7): [True: 0, False: 0] ------------------ 1072| 0| return vperm_encrypt_n(in, out, blocks); 1073| 0| } 1074| 0|#endif 1075| | 1076| 0| aes_encrypt_n(in, out, blocks, m_EK); 1077| 0|} _ZNK5Botan7AES_2569decrypt_nEPKhPhm: 1079| 127|void AES_256::decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 1080| 127| assert_key_material_set(); 1081| | 1082| 127|#if defined(BOTAN_HAS_AES_VAES) 1083| 127| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (1083:7): [True: 0, False: 127] ------------------ 1084| 0| return x86_vaes_decrypt_n(in, out, blocks); 1085| 0| } 1086| 127|#endif 1087| | 1088| 127|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 1089| 127| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (1089:7): [True: 127, False: 0] ------------------ 1090| 127| return hw_aes_decrypt_n(in, out, blocks); 1091| 127| } 1092| 0|#endif 1093| | 1094| 0|#if defined(BOTAN_HAS_AES_VPERM) 1095| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (1095:7): [True: 0, False: 0] ------------------ 1096| 0| return vperm_decrypt_n(in, out, blocks); 1097| 0| } 1098| 0|#endif 1099| | 1100| 0| aes_decrypt_n(in, out, blocks, m_DK); 1101| 0|} _ZN5Botan7AES_25612key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 1103| 126|void AES_256::key_schedule(std::span key) { 1104| 126|#if defined(BOTAN_HAS_AES_NI) 1105| 126| if(CPUID::has(CPUID::Feature::AESNI)) { ------------------ | Branch (1105:7): [True: 126, False: 0] ------------------ 1106| 126| return aesni_key_schedule(key.data(), key.size()); 1107| 126| } 1108| 0|#endif 1109| | 1110| 0|#if defined(BOTAN_HAS_AES_VAES) 1111| 0| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (1111:7): [True: 0, False: 0] ------------------ 1112| 0| return aes_key_schedule(key.data(), key.size(), m_EK, m_DK, true); 1113| 0| } 1114| 0|#endif 1115| | 1116| 0|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 1117| 0| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (1117:7): [True: 0, False: 0] ------------------ 1118| 0| constexpr bool is_little_endian = std::endian::native == std::endian::little; 1119| 0| return aes_key_schedule(key.data(), key.size(), m_EK, m_DK, is_little_endian); 1120| 0| } 1121| 0|#endif 1122| | 1123| 0|#if defined(BOTAN_HAS_AES_VPERM) 1124| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (1124:7): [True: 0, False: 0] ------------------ 1125| 0| return vperm_key_schedule(key.data(), key.size()); 1126| 0| } 1127| 0|#endif 1128| | 1129| 0| aes_key_schedule(key.data(), key.size(), m_EK, m_DK); 1130| 0|} aes.cpp:_ZN5Botan12_GLOBAL__N_115aes_parallelismEv: 808| 311|size_t aes_parallelism() { 809| 311|#if defined(BOTAN_HAS_AES_VAES) 810| 311| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (810:7): [True: 0, False: 311] ------------------ 811| 0| return 8; // pipelined 812| 0| } 813| 311|#endif 814| | 815| 311|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 816| 311| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (816:7): [True: 311, False: 0] ------------------ 817| 311| return 4; // pipelined 818| 311| } 819| 0|#endif 820| | 821| 0|#if defined(BOTAN_HAS_AES_VPERM) 822| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (822:7): [True: 0, False: 0] ------------------ 823| 0| return 2; // pipelined 824| 0| } 825| 0|#endif 826| | 827| | // bitsliced: 828| 0| return AES_BITSLICED_BLOCKS; 829| 0|} _ZNK5Botan7AES_12816hw_aes_encrypt_nEPKhPhm: 135| 3.59k|BOTAN_FN_ISA_AESNI void AES_128::hw_aes_encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 136| 3.59k| const SIMD_4x32 K0 = SIMD_4x32::load_le(&m_EK[4 * 0]); 137| 3.59k| const SIMD_4x32 K1 = SIMD_4x32::load_le(&m_EK[4 * 1]); 138| 3.59k| const SIMD_4x32 K2 = SIMD_4x32::load_le(&m_EK[4 * 2]); 139| 3.59k| const SIMD_4x32 K3 = SIMD_4x32::load_le(&m_EK[4 * 3]); 140| 3.59k| const SIMD_4x32 K4 = SIMD_4x32::load_le(&m_EK[4 * 4]); 141| 3.59k| const SIMD_4x32 K5 = SIMD_4x32::load_le(&m_EK[4 * 5]); 142| 3.59k| const SIMD_4x32 K6 = SIMD_4x32::load_le(&m_EK[4 * 6]); 143| 3.59k| const SIMD_4x32 K7 = SIMD_4x32::load_le(&m_EK[4 * 7]); 144| 3.59k| const SIMD_4x32 K8 = SIMD_4x32::load_le(&m_EK[4 * 8]); 145| 3.59k| const SIMD_4x32 K9 = SIMD_4x32::load_le(&m_EK[4 * 9]); 146| 3.59k| const SIMD_4x32 K10 = SIMD_4x32::load_le(&m_EK[4 * 10]); 147| | 148| 3.99k| while(blocks >= 4) { ------------------ | Branch (148:10): [True: 392, False: 3.59k] ------------------ 149| 392| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * 0); 150| 392| SIMD_4x32 B1 = SIMD_4x32::load_le(in + 16 * 1); 151| 392| SIMD_4x32 B2 = SIMD_4x32::load_le(in + 16 * 2); 152| 392| SIMD_4x32 B3 = SIMD_4x32::load_le(in + 16 * 3); 153| | 154| 392| keyxor(K0, B0, B1, B2, B3); 155| 392| aesenc(K1, B0, B1, B2, B3); 156| 392| aesenc(K2, B0, B1, B2, B3); 157| 392| aesenc(K3, B0, B1, B2, B3); 158| 392| aesenc(K4, B0, B1, B2, B3); 159| 392| aesenc(K5, B0, B1, B2, B3); 160| 392| aesenc(K6, B0, B1, B2, B3); 161| 392| aesenc(K7, B0, B1, B2, B3); 162| 392| aesenc(K8, B0, B1, B2, B3); 163| 392| aesenc(K9, B0, B1, B2, B3); 164| 392| aesenclast(K10, B0, B1, B2, B3); 165| | 166| 392| B0.store_le(out + 16 * 0); 167| 392| B1.store_le(out + 16 * 1); 168| 392| B2.store_le(out + 16 * 2); 169| 392| B3.store_le(out + 16 * 3); 170| | 171| 392| blocks -= 4; 172| 392| in += 4 * 16; 173| 392| out += 4 * 16; 174| 392| } 175| | 176| 7.09k| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (176:22): [True: 3.50k, False: 3.59k] ------------------ 177| 3.50k| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * i); 178| | 179| 3.50k| B0 ^= K0; 180| 3.50k| aesenc(K1, B0); 181| 3.50k| aesenc(K2, B0); 182| 3.50k| aesenc(K3, B0); 183| 3.50k| aesenc(K4, B0); 184| 3.50k| aesenc(K5, B0); 185| 3.50k| aesenc(K6, B0); 186| 3.50k| aesenc(K7, B0); 187| 3.50k| aesenc(K8, B0); 188| 3.50k| aesenc(K9, B0); 189| 3.50k| aesenclast(K10, B0); 190| | 191| 3.50k| B0.store_le(out + 16 * i); 192| 3.50k| } 193| 3.59k|} _ZNK5Botan7AES_12816hw_aes_decrypt_nEPKhPhm: 198| 55|BOTAN_FN_ISA_AESNI void AES_128::hw_aes_decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 199| 55| const SIMD_4x32 K0 = SIMD_4x32::load_le(&m_DK[4 * 0]); 200| 55| const SIMD_4x32 K1 = SIMD_4x32::load_le(&m_DK[4 * 1]); 201| 55| const SIMD_4x32 K2 = SIMD_4x32::load_le(&m_DK[4 * 2]); 202| 55| const SIMD_4x32 K3 = SIMD_4x32::load_le(&m_DK[4 * 3]); 203| 55| const SIMD_4x32 K4 = SIMD_4x32::load_le(&m_DK[4 * 4]); 204| 55| const SIMD_4x32 K5 = SIMD_4x32::load_le(&m_DK[4 * 5]); 205| 55| const SIMD_4x32 K6 = SIMD_4x32::load_le(&m_DK[4 * 6]); 206| 55| const SIMD_4x32 K7 = SIMD_4x32::load_le(&m_DK[4 * 7]); 207| 55| const SIMD_4x32 K8 = SIMD_4x32::load_le(&m_DK[4 * 8]); 208| 55| const SIMD_4x32 K9 = SIMD_4x32::load_le(&m_DK[4 * 9]); 209| 55| const SIMD_4x32 K10 = SIMD_4x32::load_le(&m_DK[4 * 10]); 210| | 211| 247| while(blocks >= 4) { ------------------ | Branch (211:10): [True: 192, False: 55] ------------------ 212| 192| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * 0); 213| 192| SIMD_4x32 B1 = SIMD_4x32::load_le(in + 16 * 1); 214| 192| SIMD_4x32 B2 = SIMD_4x32::load_le(in + 16 * 2); 215| 192| SIMD_4x32 B3 = SIMD_4x32::load_le(in + 16 * 3); 216| | 217| 192| keyxor(K0, B0, B1, B2, B3); 218| 192| aesdec(K1, B0, B1, B2, B3); 219| 192| aesdec(K2, B0, B1, B2, B3); 220| 192| aesdec(K3, B0, B1, B2, B3); 221| 192| aesdec(K4, B0, B1, B2, B3); 222| 192| aesdec(K5, B0, B1, B2, B3); 223| 192| aesdec(K6, B0, B1, B2, B3); 224| 192| aesdec(K7, B0, B1, B2, B3); 225| 192| aesdec(K8, B0, B1, B2, B3); 226| 192| aesdec(K9, B0, B1, B2, B3); 227| 192| aesdeclast(K10, B0, B1, B2, B3); 228| | 229| 192| B0.store_le(out + 16 * 0); 230| 192| B1.store_le(out + 16 * 1); 231| 192| B2.store_le(out + 16 * 2); 232| 192| B3.store_le(out + 16 * 3); 233| | 234| 192| blocks -= 4; 235| 192| in += 4 * 16; 236| 192| out += 4 * 16; 237| 192| } 238| | 239| 81| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (239:22): [True: 26, False: 55] ------------------ 240| 26| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * i); 241| | 242| 26| B0 ^= K0; 243| 26| aesdec(K1, B0); 244| 26| aesdec(K2, B0); 245| 26| aesdec(K3, B0); 246| 26| aesdec(K4, B0); 247| 26| aesdec(K5, B0); 248| 26| aesdec(K6, B0); 249| 26| aesdec(K7, B0); 250| 26| aesdec(K8, B0); 251| 26| aesdec(K9, B0); 252| 26| aesdeclast(K10, B0); 253| | 254| 26| B0.store_le(out + 16 * i); 255| 26| } 256| 55|} _ZN5Botan7AES_12818aesni_key_scheduleEPKhm: 261| 95|BOTAN_FN_ISA_AESNI void AES_128::aesni_key_schedule(const uint8_t key[], size_t /*length*/) { 262| 95| m_EK.resize(44); 263| 95| m_DK.resize(44); 264| | 265| 95| const SIMD_4x32 K0 = SIMD_4x32::load_le(key); 266| 95| const SIMD_4x32 K1 = aes_128_key_expansion<0x01>(K0, K0); 267| 95| const SIMD_4x32 K2 = aes_128_key_expansion<0x02>(K1, K1); 268| 95| const SIMD_4x32 K3 = aes_128_key_expansion<0x04>(K2, K2); 269| 95| const SIMD_4x32 K4 = aes_128_key_expansion<0x08>(K3, K3); 270| 95| const SIMD_4x32 K5 = aes_128_key_expansion<0x10>(K4, K4); 271| 95| const SIMD_4x32 K6 = aes_128_key_expansion<0x20>(K5, K5); 272| 95| const SIMD_4x32 K7 = aes_128_key_expansion<0x40>(K6, K6); 273| 95| const SIMD_4x32 K8 = aes_128_key_expansion<0x80>(K7, K7); 274| 95| const SIMD_4x32 K9 = aes_128_key_expansion<0x1B>(K8, K8); 275| 95| const SIMD_4x32 K10 = aes_128_key_expansion<0x36>(K9, K9); 276| | 277| 95| K0.store_le(&m_EK[4 * 0]); 278| 95| K1.store_le(&m_EK[4 * 1]); 279| 95| K2.store_le(&m_EK[4 * 2]); 280| 95| K3.store_le(&m_EK[4 * 3]); 281| 95| K4.store_le(&m_EK[4 * 4]); 282| 95| K5.store_le(&m_EK[4 * 5]); 283| 95| K6.store_le(&m_EK[4 * 6]); 284| 95| K7.store_le(&m_EK[4 * 7]); 285| 95| K8.store_le(&m_EK[4 * 8]); 286| 95| K9.store_le(&m_EK[4 * 9]); 287| 95| K10.store_le(&m_EK[4 * 10]); 288| | 289| | // Now generate decryption keys 290| 95| K10.store_le(&m_DK[4 * 0]); 291| 95| aesimc(K9).store_le(&m_DK[4 * 1]); 292| 95| aesimc(K8).store_le(&m_DK[4 * 2]); 293| 95| aesimc(K7).store_le(&m_DK[4 * 3]); 294| 95| aesimc(K6).store_le(&m_DK[4 * 4]); 295| 95| aesimc(K5).store_le(&m_DK[4 * 5]); 296| 95| aesimc(K4).store_le(&m_DK[4 * 6]); 297| 95| aesimc(K3).store_le(&m_DK[4 * 7]); 298| 95| aesimc(K2).store_le(&m_DK[4 * 8]); 299| 95| aesimc(K1).store_le(&m_DK[4 * 9]); 300| 95| K0.store_le(&m_DK[4 * 10]); 301| 95|} _ZNK5Botan7AES_25616hw_aes_encrypt_nEPKhPhm: 483| 525|BOTAN_FN_ISA_AESNI void AES_256::hw_aes_encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 484| 525| const SIMD_4x32 K0 = SIMD_4x32::load_le(&m_EK[4 * 0]); 485| 525| const SIMD_4x32 K1 = SIMD_4x32::load_le(&m_EK[4 * 1]); 486| 525| const SIMD_4x32 K2 = SIMD_4x32::load_le(&m_EK[4 * 2]); 487| 525| const SIMD_4x32 K3 = SIMD_4x32::load_le(&m_EK[4 * 3]); 488| 525| const SIMD_4x32 K4 = SIMD_4x32::load_le(&m_EK[4 * 4]); 489| 525| const SIMD_4x32 K5 = SIMD_4x32::load_le(&m_EK[4 * 5]); 490| 525| const SIMD_4x32 K6 = SIMD_4x32::load_le(&m_EK[4 * 6]); 491| 525| const SIMD_4x32 K7 = SIMD_4x32::load_le(&m_EK[4 * 7]); 492| 525| const SIMD_4x32 K8 = SIMD_4x32::load_le(&m_EK[4 * 8]); 493| 525| const SIMD_4x32 K9 = SIMD_4x32::load_le(&m_EK[4 * 9]); 494| 525| const SIMD_4x32 K10 = SIMD_4x32::load_le(&m_EK[4 * 10]); 495| 525| const SIMD_4x32 K11 = SIMD_4x32::load_le(&m_EK[4 * 11]); 496| 525| const SIMD_4x32 K12 = SIMD_4x32::load_le(&m_EK[4 * 12]); 497| 525| const SIMD_4x32 K13 = SIMD_4x32::load_le(&m_EK[4 * 13]); 498| 525| const SIMD_4x32 K14 = SIMD_4x32::load_le(&m_EK[4 * 14]); 499| | 500| 1.46k| while(blocks >= 4) { ------------------ | Branch (500:10): [True: 940, False: 525] ------------------ 501| 940| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * 0); 502| 940| SIMD_4x32 B1 = SIMD_4x32::load_le(in + 16 * 1); 503| 940| SIMD_4x32 B2 = SIMD_4x32::load_le(in + 16 * 2); 504| 940| SIMD_4x32 B3 = SIMD_4x32::load_le(in + 16 * 3); 505| | 506| 940| keyxor(K0, B0, B1, B2, B3); 507| 940| aesenc(K1, B0, B1, B2, B3); 508| 940| aesenc(K2, B0, B1, B2, B3); 509| 940| aesenc(K3, B0, B1, B2, B3); 510| 940| aesenc(K4, B0, B1, B2, B3); 511| 940| aesenc(K5, B0, B1, B2, B3); 512| 940| aesenc(K6, B0, B1, B2, B3); 513| 940| aesenc(K7, B0, B1, B2, B3); 514| 940| aesenc(K8, B0, B1, B2, B3); 515| 940| aesenc(K9, B0, B1, B2, B3); 516| 940| aesenc(K10, B0, B1, B2, B3); 517| 940| aesenc(K11, B0, B1, B2, B3); 518| 940| aesenc(K12, B0, B1, B2, B3); 519| 940| aesenc(K13, B0, B1, B2, B3); 520| 940| aesenclast(K14, B0, B1, B2, B3); 521| | 522| 940| B0.store_le(out + 16 * 0); 523| 940| B1.store_le(out + 16 * 1); 524| 940| B2.store_le(out + 16 * 2); 525| 940| B3.store_le(out + 16 * 3); 526| | 527| 940| blocks -= 4; 528| 940| in += 4 * 16; 529| 940| out += 4 * 16; 530| 940| } 531| | 532| 815| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (532:22): [True: 290, False: 525] ------------------ 533| 290| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * i); 534| | 535| 290| B0 ^= K0; 536| | 537| 290| aesenc(K1, B0); 538| 290| aesenc(K2, B0); 539| 290| aesenc(K3, B0); 540| 290| aesenc(K4, B0); 541| 290| aesenc(K5, B0); 542| 290| aesenc(K6, B0); 543| 290| aesenc(K7, B0); 544| 290| aesenc(K8, B0); 545| 290| aesenc(K9, B0); 546| 290| aesenc(K10, B0); 547| 290| aesenc(K11, B0); 548| 290| aesenc(K12, B0); 549| 290| aesenc(K13, B0); 550| 290| aesenclast(K14, B0); 551| | 552| 290| B0.store_le(out + 16 * i); 553| 290| } 554| 525|} _ZNK5Botan7AES_25616hw_aes_decrypt_nEPKhPhm: 559| 127|BOTAN_FN_ISA_AESNI void AES_256::hw_aes_decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 560| 127| const SIMD_4x32 K0 = SIMD_4x32::load_le(&m_DK[4 * 0]); 561| 127| const SIMD_4x32 K1 = SIMD_4x32::load_le(&m_DK[4 * 1]); 562| 127| const SIMD_4x32 K2 = SIMD_4x32::load_le(&m_DK[4 * 2]); 563| 127| const SIMD_4x32 K3 = SIMD_4x32::load_le(&m_DK[4 * 3]); 564| 127| const SIMD_4x32 K4 = SIMD_4x32::load_le(&m_DK[4 * 4]); 565| 127| const SIMD_4x32 K5 = SIMD_4x32::load_le(&m_DK[4 * 5]); 566| 127| const SIMD_4x32 K6 = SIMD_4x32::load_le(&m_DK[4 * 6]); 567| 127| const SIMD_4x32 K7 = SIMD_4x32::load_le(&m_DK[4 * 7]); 568| 127| const SIMD_4x32 K8 = SIMD_4x32::load_le(&m_DK[4 * 8]); 569| 127| const SIMD_4x32 K9 = SIMD_4x32::load_le(&m_DK[4 * 9]); 570| 127| const SIMD_4x32 K10 = SIMD_4x32::load_le(&m_DK[4 * 10]); 571| 127| const SIMD_4x32 K11 = SIMD_4x32::load_le(&m_DK[4 * 11]); 572| 127| const SIMD_4x32 K12 = SIMD_4x32::load_le(&m_DK[4 * 12]); 573| 127| const SIMD_4x32 K13 = SIMD_4x32::load_le(&m_DK[4 * 13]); 574| 127| const SIMD_4x32 K14 = SIMD_4x32::load_le(&m_DK[4 * 14]); 575| | 576| 553| while(blocks >= 4) { ------------------ | Branch (576:10): [True: 426, False: 127] ------------------ 577| 426| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * 0); 578| 426| SIMD_4x32 B1 = SIMD_4x32::load_le(in + 16 * 1); 579| 426| SIMD_4x32 B2 = SIMD_4x32::load_le(in + 16 * 2); 580| 426| SIMD_4x32 B3 = SIMD_4x32::load_le(in + 16 * 3); 581| | 582| 426| keyxor(K0, B0, B1, B2, B3); 583| 426| aesdec(K1, B0, B1, B2, B3); 584| 426| aesdec(K2, B0, B1, B2, B3); 585| 426| aesdec(K3, B0, B1, B2, B3); 586| 426| aesdec(K4, B0, B1, B2, B3); 587| 426| aesdec(K5, B0, B1, B2, B3); 588| 426| aesdec(K6, B0, B1, B2, B3); 589| 426| aesdec(K7, B0, B1, B2, B3); 590| 426| aesdec(K8, B0, B1, B2, B3); 591| 426| aesdec(K9, B0, B1, B2, B3); 592| 426| aesdec(K10, B0, B1, B2, B3); 593| 426| aesdec(K11, B0, B1, B2, B3); 594| 426| aesdec(K12, B0, B1, B2, B3); 595| 426| aesdec(K13, B0, B1, B2, B3); 596| 426| aesdeclast(K14, B0, B1, B2, B3); 597| | 598| 426| B0.store_le(out + 16 * 0); 599| 426| B1.store_le(out + 16 * 1); 600| 426| B2.store_le(out + 16 * 2); 601| 426| B3.store_le(out + 16 * 3); 602| | 603| 426| blocks -= 4; 604| 426| in += 4 * 16; 605| 426| out += 4 * 16; 606| 426| } 607| | 608| 186| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (608:22): [True: 59, False: 127] ------------------ 609| 59| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * i); 610| | 611| 59| B0 ^= K0; 612| | 613| 59| aesdec(K1, B0); 614| 59| aesdec(K2, B0); 615| 59| aesdec(K3, B0); 616| 59| aesdec(K4, B0); 617| 59| aesdec(K5, B0); 618| 59| aesdec(K6, B0); 619| 59| aesdec(K7, B0); 620| 59| aesdec(K8, B0); 621| 59| aesdec(K9, B0); 622| 59| aesdec(K10, B0); 623| 59| aesdec(K11, B0); 624| 59| aesdec(K12, B0); 625| 59| aesdec(K13, B0); 626| 59| aesdeclast(K14, B0); 627| | 628| 59| B0.store_le(out + 16 * i); 629| 59| } 630| 127|} _ZN5Botan7AES_25618aesni_key_scheduleEPKhm: 635| 126|BOTAN_FN_ISA_AESNI void AES_256::aesni_key_schedule(const uint8_t key[], size_t /*length*/) { 636| 126| m_EK.resize(60); 637| 126| m_DK.resize(60); 638| | 639| 126| const SIMD_4x32 K0 = SIMD_4x32::load_le(key); 640| 126| const SIMD_4x32 K1 = SIMD_4x32::load_le(key + 16); 641| | 642| 126| const SIMD_4x32 K2 = aes_128_key_expansion<0x01>(K0, K1); 643| 126| const SIMD_4x32 K3 = aes_256_key_expansion(K1, K2); 644| | 645| 126| const SIMD_4x32 K4 = aes_128_key_expansion<0x02>(K2, K3); 646| 126| const SIMD_4x32 K5 = aes_256_key_expansion(K3, K4); 647| | 648| 126| const SIMD_4x32 K6 = aes_128_key_expansion<0x04>(K4, K5); 649| 126| const SIMD_4x32 K7 = aes_256_key_expansion(K5, K6); 650| | 651| 126| const SIMD_4x32 K8 = aes_128_key_expansion<0x08>(K6, K7); 652| 126| const SIMD_4x32 K9 = aes_256_key_expansion(K7, K8); 653| | 654| 126| const SIMD_4x32 K10 = aes_128_key_expansion<0x10>(K8, K9); 655| 126| const SIMD_4x32 K11 = aes_256_key_expansion(K9, K10); 656| | 657| 126| const SIMD_4x32 K12 = aes_128_key_expansion<0x20>(K10, K11); 658| 126| const SIMD_4x32 K13 = aes_256_key_expansion(K11, K12); 659| | 660| 126| const SIMD_4x32 K14 = aes_128_key_expansion<0x40>(K12, K13); 661| | 662| 126| K0.store_le(&m_EK[4 * 0]); 663| 126| K1.store_le(&m_EK[4 * 1]); 664| 126| K2.store_le(&m_EK[4 * 2]); 665| 126| K3.store_le(&m_EK[4 * 3]); 666| 126| K4.store_le(&m_EK[4 * 4]); 667| 126| K5.store_le(&m_EK[4 * 5]); 668| 126| K6.store_le(&m_EK[4 * 6]); 669| 126| K7.store_le(&m_EK[4 * 7]); 670| 126| K8.store_le(&m_EK[4 * 8]); 671| 126| K9.store_le(&m_EK[4 * 9]); 672| 126| K10.store_le(&m_EK[4 * 10]); 673| 126| K11.store_le(&m_EK[4 * 11]); 674| 126| K12.store_le(&m_EK[4 * 12]); 675| 126| K13.store_le(&m_EK[4 * 13]); 676| 126| K14.store_le(&m_EK[4 * 14]); 677| | 678| 126| K14.store_le(&m_DK[4 * 0]); 679| 126| aesimc(K13).store_le(&m_DK[4 * 1]); 680| 126| aesimc(K12).store_le(&m_DK[4 * 2]); 681| 126| aesimc(K11).store_le(&m_DK[4 * 3]); 682| 126| aesimc(K10).store_le(&m_DK[4 * 4]); 683| 126| aesimc(K9).store_le(&m_DK[4 * 5]); 684| 126| aesimc(K8).store_le(&m_DK[4 * 6]); 685| 126| aesimc(K7).store_le(&m_DK[4 * 7]); 686| 126| aesimc(K6).store_le(&m_DK[4 * 8]); 687| 126| aesimc(K5).store_le(&m_DK[4 * 9]); 688| 126| aesimc(K4).store_le(&m_DK[4 * 10]); 689| 126| aesimc(K3).store_le(&m_DK[4 * 11]); 690| 126| aesimc(K2).store_le(&m_DK[4 * 12]); 691| 126| aesimc(K1).store_le(&m_DK[4 * 13]); 692| 126| K0.store_le(&m_DK[4 * 14]); 693| 126|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_16keyxorENS_9SIMD_4x32ERS1_S2_S2_S2_: 69| 1.95k| SIMD_4x32 K, SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 70| 1.95k| B0 ^= K; 71| 1.95k| B1 ^= K; 72| 1.95k| B2 ^= K; 73| 1.95k| B3 ^= K; 74| 1.95k|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_16aesencENS_9SIMD_4x32ERS1_S2_S2_S2_: 81| 15.7k| SIMD_4x32 K, SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 82| 15.7k| B0 = SIMD_4x32(_mm_aesenc_si128(B0.raw(), K.raw())); 83| 15.7k| B1 = SIMD_4x32(_mm_aesenc_si128(B1.raw(), K.raw())); 84| 15.7k| B2 = SIMD_4x32(_mm_aesenc_si128(B2.raw(), K.raw())); 85| 15.7k| B3 = SIMD_4x32(_mm_aesenc_si128(B3.raw(), K.raw())); 86| 15.7k|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_110aesenclastENS_9SIMD_4x32ERS1_S2_S2_S2_: 93| 1.33k| SIMD_4x32 K, SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 94| 1.33k| B0 = SIMD_4x32(_mm_aesenclast_si128(B0.raw(), K.raw())); 95| 1.33k| B1 = SIMD_4x32(_mm_aesenclast_si128(B1.raw(), K.raw())); 96| 1.33k| B2 = SIMD_4x32(_mm_aesenclast_si128(B2.raw(), K.raw())); 97| 1.33k| B3 = SIMD_4x32(_mm_aesenclast_si128(B3.raw(), K.raw())); 98| 1.33k|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_16aesencENS_9SIMD_4x32ERS1_: 76| 35.2k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AESNI void aesenc(SIMD_4x32 K, SIMD_4x32& B) { 77| 35.2k| B = SIMD_4x32(_mm_aesenc_si128(B.raw(), K.raw())); 78| 35.2k|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_110aesenclastENS_9SIMD_4x32ERS1_: 88| 3.79k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AESNI void aesenclast(SIMD_4x32 K, SIMD_4x32& B) { 89| 3.79k| B = SIMD_4x32(_mm_aesenclast_si128(B.raw(), K.raw())); 90| 3.79k|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_16aesdecENS_9SIMD_4x32ERS1_S2_S2_S2_: 105| 7.26k| SIMD_4x32 K, SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 106| 7.26k| B0 = SIMD_4x32(_mm_aesdec_si128(B0.raw(), K.raw())); 107| 7.26k| B1 = SIMD_4x32(_mm_aesdec_si128(B1.raw(), K.raw())); 108| 7.26k| B2 = SIMD_4x32(_mm_aesdec_si128(B2.raw(), K.raw())); 109| 7.26k| B3 = SIMD_4x32(_mm_aesdec_si128(B3.raw(), K.raw())); 110| 7.26k|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_110aesdeclastENS_9SIMD_4x32ERS1_S2_S2_S2_: 117| 618| SIMD_4x32 K, SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 118| 618| B0 = SIMD_4x32(_mm_aesdeclast_si128(B0.raw(), K.raw())); 119| 618| B1 = SIMD_4x32(_mm_aesdeclast_si128(B1.raw(), K.raw())); 120| 618| B2 = SIMD_4x32(_mm_aesdeclast_si128(B2.raw(), K.raw())); 121| 618| B3 = SIMD_4x32(_mm_aesdeclast_si128(B3.raw(), K.raw())); 122| 618|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_16aesdecENS_9SIMD_4x32ERS1_: 100| 1.00k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AESNI void aesdec(SIMD_4x32 K, SIMD_4x32& B) { 101| 1.00k| B = SIMD_4x32(_mm_aesdec_si128(B.raw(), K.raw())); 102| 1.00k|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_110aesdeclastENS_9SIMD_4x32ERS1_: 112| 85|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AESNI void aesdeclast(SIMD_4x32 K, SIMD_4x32& B) { 113| 85| B = SIMD_4x32(_mm_aesdeclast_si128(B.raw(), K.raw())); 114| 85|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_16aesimcENS_9SIMD_4x32E: 124| 2.49k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AESNI SIMD_4x32 aesimc(SIMD_4x32 B) { 125| 2.49k| return SIMD_4x32(_mm_aesimc_si128(B.raw())); 126| 2.49k|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_256_key_expansionENS_9SIMD_4x32ES1_: 57| 756|BOTAN_FN_ISA_AESNI SIMD_4x32 aes_256_key_expansion(SIMD_4x32 key, SIMD_4x32 key2) { 58| 756| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key2.raw(), 0x00); 59| 756| key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(2, 2, 2, 2)); 60| | 61| 756| key ^= key.shift_elems_left<1>(); 62| 756| key ^= key.shift_elems_left<1>(); 63| 756| key ^= key.shift_elems_left<1>(); 64| 756| key ^= SIMD_4x32(key_with_rcon); 65| 756| return key; 66| 756|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh1EEENS_9SIMD_4x32ES2_S2_: 22| 221|BOTAN_FN_ISA_AESNI inline SIMD_4x32 aes_128_key_expansion(SIMD_4x32 key, SIMD_4x32 key_getting_rcon) { 23| 221| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon.raw(), RC); 24| | key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 221| key ^= key.shift_elems_left<1>(); 26| 221| key ^= key.shift_elems_left<1>(); 27| 221| key ^= key.shift_elems_left<1>(); 28| 221| key ^= SIMD_4x32(key_with_rcon); 29| 221| return key; 30| 221|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh2EEENS_9SIMD_4x32ES2_S2_: 22| 221|BOTAN_FN_ISA_AESNI inline SIMD_4x32 aes_128_key_expansion(SIMD_4x32 key, SIMD_4x32 key_getting_rcon) { 23| 221| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon.raw(), RC); 24| | key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 221| key ^= key.shift_elems_left<1>(); 26| 221| key ^= key.shift_elems_left<1>(); 27| 221| key ^= key.shift_elems_left<1>(); 28| 221| key ^= SIMD_4x32(key_with_rcon); 29| 221| return key; 30| 221|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh4EEENS_9SIMD_4x32ES2_S2_: 22| 221|BOTAN_FN_ISA_AESNI inline SIMD_4x32 aes_128_key_expansion(SIMD_4x32 key, SIMD_4x32 key_getting_rcon) { 23| 221| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon.raw(), RC); 24| | key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 221| key ^= key.shift_elems_left<1>(); 26| 221| key ^= key.shift_elems_left<1>(); 27| 221| key ^= key.shift_elems_left<1>(); 28| 221| key ^= SIMD_4x32(key_with_rcon); 29| 221| return key; 30| 221|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh8EEENS_9SIMD_4x32ES2_S2_: 22| 221|BOTAN_FN_ISA_AESNI inline SIMD_4x32 aes_128_key_expansion(SIMD_4x32 key, SIMD_4x32 key_getting_rcon) { 23| 221| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon.raw(), RC); 24| | key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 221| key ^= key.shift_elems_left<1>(); 26| 221| key ^= key.shift_elems_left<1>(); 27| 221| key ^= key.shift_elems_left<1>(); 28| 221| key ^= SIMD_4x32(key_with_rcon); 29| 221| return key; 30| 221|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh16EEENS_9SIMD_4x32ES2_S2_: 22| 221|BOTAN_FN_ISA_AESNI inline SIMD_4x32 aes_128_key_expansion(SIMD_4x32 key, SIMD_4x32 key_getting_rcon) { 23| 221| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon.raw(), RC); 24| | key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 221| key ^= key.shift_elems_left<1>(); 26| 221| key ^= key.shift_elems_left<1>(); 27| 221| key ^= key.shift_elems_left<1>(); 28| 221| key ^= SIMD_4x32(key_with_rcon); 29| 221| return key; 30| 221|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh32EEENS_9SIMD_4x32ES2_S2_: 22| 221|BOTAN_FN_ISA_AESNI inline SIMD_4x32 aes_128_key_expansion(SIMD_4x32 key, SIMD_4x32 key_getting_rcon) { 23| 221| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon.raw(), RC); 24| | key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 221| key ^= key.shift_elems_left<1>(); 26| 221| key ^= key.shift_elems_left<1>(); 27| 221| key ^= key.shift_elems_left<1>(); 28| 221| key ^= SIMD_4x32(key_with_rcon); 29| 221| return key; 30| 221|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh64EEENS_9SIMD_4x32ES2_S2_: 22| 221|BOTAN_FN_ISA_AESNI inline SIMD_4x32 aes_128_key_expansion(SIMD_4x32 key, SIMD_4x32 key_getting_rcon) { 23| 221| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon.raw(), RC); 24| | key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 221| key ^= key.shift_elems_left<1>(); 26| 221| key ^= key.shift_elems_left<1>(); 27| 221| key ^= key.shift_elems_left<1>(); 28| 221| key ^= SIMD_4x32(key_with_rcon); 29| 221| return key; 30| 221|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh128EEENS_9SIMD_4x32ES2_S2_: 22| 95|BOTAN_FN_ISA_AESNI inline SIMD_4x32 aes_128_key_expansion(SIMD_4x32 key, SIMD_4x32 key_getting_rcon) { 23| 95| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon.raw(), RC); 24| | key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 95| key ^= key.shift_elems_left<1>(); 26| 95| key ^= key.shift_elems_left<1>(); 27| 95| key ^= key.shift_elems_left<1>(); 28| 95| key ^= SIMD_4x32(key_with_rcon); 29| 95| return key; 30| 95|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh27EEENS_9SIMD_4x32ES2_S2_: 22| 95|BOTAN_FN_ISA_AESNI inline SIMD_4x32 aes_128_key_expansion(SIMD_4x32 key, SIMD_4x32 key_getting_rcon) { 23| 95| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon.raw(), RC); 24| | key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 95| key ^= key.shift_elems_left<1>(); 26| 95| key ^= key.shift_elems_left<1>(); 27| 95| key ^= key.shift_elems_left<1>(); 28| 95| key ^= SIMD_4x32(key_with_rcon); 29| 95| return key; 30| 95|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh54EEENS_9SIMD_4x32ES2_S2_: 22| 95|BOTAN_FN_ISA_AESNI inline SIMD_4x32 aes_128_key_expansion(SIMD_4x32 key, SIMD_4x32 key_getting_rcon) { 23| 95| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon.raw(), RC); 24| | key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 95| key ^= key.shift_elems_left<1>(); 26| 95| key ^= key.shift_elems_left<1>(); 27| 95| key ^= key.shift_elems_left<1>(); 28| 95| key ^= SIMD_4x32(key_with_rcon); 29| 95| return key; 30| 95|} _ZNK5Botan8ARIA_1289encrypt_nEPKhPhm: 372| 9|void ARIA_128::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 373| 9| assert_key_material_set(); 374| | 375| 9|#if defined(BOTAN_HAS_ARIA_AVX512_GFNI) 376| 9| if(CPUID::has(CPUID::Feature::AVX512, CPUID::Feature::GFNI)) { ------------------ | Branch (376:7): [True: 0, False: 9] ------------------ 377| 0| return aria_avx512_gfni_encrypt(in, out, blocks); 378| 0| } 379| 9|#endif 380| | 381| 9|#if defined(BOTAN_HAS_ARIA_HWAES) 382| 9| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (382:7): [True: 9, False: 0] ------------------ 383| 9| return aria_hwaes_encrypt(in, out, blocks); 384| 9| } 385| 0|#endif 386| | 387| 0| ARIA_F::transform(in, out, blocks, m_ERK); 388| 0|} _ZNK5Botan8ARIA_2569encrypt_nEPKhPhm: 408| 9|void ARIA_256::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 409| 9| assert_key_material_set(); 410| | 411| 9|#if defined(BOTAN_HAS_ARIA_AVX512_GFNI) 412| 9| if(CPUID::has(CPUID::Feature::AVX512, CPUID::Feature::GFNI)) { ------------------ | Branch (412:7): [True: 0, False: 9] ------------------ 413| 0| return aria_avx512_gfni_encrypt(in, out, blocks); 414| 0| } 415| 9|#endif 416| | 417| 9|#if defined(BOTAN_HAS_ARIA_HWAES) 418| 9| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (418:7): [True: 9, False: 0] ------------------ 419| 9| return aria_hwaes_encrypt(in, out, blocks); 420| 9| } 421| 0|#endif 422| | 423| 0| ARIA_F::transform(in, out, blocks, m_ERK); 424| 0|} _ZNK5Botan8ARIA_12819has_keying_materialEv: 480| 24|bool ARIA_128::has_keying_material() const { 481| 24| return !m_ERK.empty(); 482| 24|} _ZNK5Botan8ARIA_25619has_keying_materialEv: 488| 24|bool ARIA_256::has_keying_material() const { 489| 24| return !m_ERK.empty(); 490| 24|} _ZNK5Botan8ARIA_12811parallelismEv: 528| 6|size_t ARIA_128::parallelism() const { 529| 6| return aria_parallelism(); 530| 6|} _ZNK5Botan8ARIA_25611parallelismEv: 544| 6|size_t ARIA_256::parallelism() const { 545| 6| return aria_parallelism(); 546| 6|} _ZN5Botan8ARIA_12812key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 552| 3|void ARIA_128::key_schedule(std::span key) { 553| 3| ARIA_F::key_schedule(m_ERK, m_DRK, key); 554| 3|} _ZN5Botan8ARIA_25612key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 560| 3|void ARIA_256::key_schedule(std::span key) { 561| 3| ARIA_F::key_schedule(m_ERK, m_DRK, key); 562| 3|} aria.cpp:_ZN5Botan12_GLOBAL__N_16ARIA_F7ARIA_FOERjS2_S2_S2_: 118| 12|inline void ARIA_FO(uint32_t& T0, uint32_t& T1, uint32_t& T2, uint32_t& T3) { 119| 12| T0 = ARIA_F1(T0); 120| 12| T1 = ARIA_F1(T1); 121| 12| T2 = ARIA_F1(T2); 122| 12| T3 = ARIA_F1(T3); 123| | 124| 12| T1 ^= T2; 125| 12| T2 ^= T3; 126| 12| T0 ^= T1; 127| 12| T3 ^= T1; 128| 12| T2 ^= T0; 129| 12| T1 ^= T2; 130| | 131| 12| T1 = ((T1 << 8) & 0xFF00FF00) | ((T1 >> 8) & 0x00FF00FF); 132| 12| T2 = rotr<16>(T2); 133| 12| T3 = reverse_bytes(T3); 134| | 135| 12| T1 ^= T2; 136| 12| T2 ^= T3; 137| 12| T0 ^= T1; 138| 12| T3 ^= T1; 139| 12| T2 ^= T0; 140| 12| T1 ^= T2; 141| 12|} aria.cpp:_ZN5Botan12_GLOBAL__N_16ARIA_F7ARIA_F1Ej: 100| 48|inline uint32_t ARIA_F1(uint32_t X) { 101| 48| const uint32_t M1 = 0x00010101; 102| 48| const uint32_t M2 = 0x01000101; 103| 48| const uint32_t M3 = 0x01010001; 104| 48| const uint32_t M4 = 0x01010100; 105| | 106| 48| return (S1[get_byte<0>(X)] * M1) ^ (S2[get_byte<1>(X)] * M2) ^ (X1[get_byte<2>(X)] * M3) ^ (X2[get_byte<3>(X)] * M4); 107| 48|} aria.cpp:_ZN5Botan12_GLOBAL__N_16ARIA_F7ARIA_FEERjS2_S2_S2_: 143| 6|inline void ARIA_FE(uint32_t& T0, uint32_t& T1, uint32_t& T2, uint32_t& T3) { 144| 6| T0 = ARIA_F2(T0); 145| 6| T1 = ARIA_F2(T1); 146| 6| T2 = ARIA_F2(T2); 147| 6| T3 = ARIA_F2(T3); 148| | 149| 6| T1 ^= T2; 150| 6| T2 ^= T3; 151| 6| T0 ^= T1; 152| 6| T3 ^= T1; 153| 6| T2 ^= T0; 154| 6| T1 ^= T2; 155| | 156| 6| T3 = ((T3 << 8) & 0xFF00FF00) | ((T3 >> 8) & 0x00FF00FF); 157| 6| T0 = rotr<16>(T0); 158| 6| T1 = reverse_bytes(T1); 159| | 160| 6| T1 ^= T2; 161| 6| T2 ^= T3; 162| 6| T0 ^= T1; 163| 6| T3 ^= T1; 164| 6| T2 ^= T0; 165| 6| T1 ^= T2; 166| 6|} aria.cpp:_ZN5Botan12_GLOBAL__N_16ARIA_F7ARIA_F2Ej: 109| 24|inline uint32_t ARIA_F2(uint32_t X) { 110| 24| const uint32_t M1 = 0x00010101; 111| 24| const uint32_t M2 = 0x01000101; 112| 24| const uint32_t M3 = 0x01010001; 113| 24| const uint32_t M4 = 0x01010100; 114| | 115| 24| return (X1[get_byte<0>(X)] * M3) ^ (X2[get_byte<1>(X)] * M4) ^ (S1[get_byte<2>(X)] * M1) ^ (S2[get_byte<3>(X)] * M2); 116| 24|} aria.cpp:_ZN5Botan12_GLOBAL__N_116aria_parallelismEv: 494| 12|size_t aria_parallelism() { 495| 12|#if defined(BOTAN_HAS_ARIA_AVX512_GFNI) 496| 12| if(CPUID::has(CPUID::Feature::AVX512, CPUID::Feature::GFNI)) { ------------------ | Branch (496:7): [True: 0, False: 12] ------------------ 497| 0| return 16; 498| 0| } 499| 12|#endif 500| | 501| 12|#if defined(BOTAN_HAS_ARIA_HWAES) 502| 12| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (502:7): [True: 12, False: 0] ------------------ 503| 12| return 4; 504| 12| } 505| 0|#endif 506| | 507| 0| return 1; 508| 12|} aria.cpp:_ZN5Botan12_GLOBAL__N_16ARIA_F12key_scheduleERNSt3__16vectorIjNS_16secure_allocatorIjEEEES7_NS2_4spanIKhLm18446744073709551615EEE: 260| 6|void key_schedule(secure_vector& ERK, secure_vector& DRK, std::span key) { 261| 6| prefetch_arrays(S1, S2, X1, X2); 262| | 263| 6| const uint32_t KRK[3][4] = {{0x517cc1b7, 0x27220a94, 0xfe13abe8, 0xfa9a6ee0}, 264| 6| {0x6db14acc, 0x9e21c820, 0xff28b1d5, 0xef5de2b0}, 265| 6| {0xdb92371d, 0x2126e970, 0x03249775, 0x04e8c90e}}; 266| | 267| 6| const size_t CK0 = (key.size() / 8) - 2; 268| 6| const size_t CK1 = (CK0 + 1) % 3; 269| 6| const size_t CK2 = (CK1 + 1) % 3; 270| | 271| 6| uint32_t w0[4]; 272| 6| uint32_t w1[4]; 273| 6| uint32_t w2[4]; 274| 6| uint32_t w3[4]; 275| | 276| 6| w0[0] = load_be(key.data(), 0); 277| 6| w0[1] = load_be(key.data(), 1); 278| 6| w0[2] = load_be(key.data(), 2); 279| 6| w0[3] = load_be(key.data(), 3); 280| | 281| 6| w1[0] = w0[0] ^ KRK[CK0][0]; 282| 6| w1[1] = w0[1] ^ KRK[CK0][1]; 283| 6| w1[2] = w0[2] ^ KRK[CK0][2]; 284| 6| w1[3] = w0[3] ^ KRK[CK0][3]; 285| | 286| 6| ARIA_FO(w1[0], w1[1], w1[2], w1[3]); 287| | 288| 6| if(key.size() == 24 || key.size() == 32) { ------------------ | Branch (288:7): [True: 0, False: 6] | Branch (288:27): [True: 3, False: 3] ------------------ 289| 3| w1[0] ^= load_be(key.data(), 4); 290| 3| w1[1] ^= load_be(key.data(), 5); 291| 3| } 292| 6| if(key.size() == 32) { ------------------ | Branch (292:7): [True: 3, False: 3] ------------------ 293| 3| w1[2] ^= load_be(key.data(), 6); 294| 3| w1[3] ^= load_be(key.data(), 7); 295| 3| } 296| | 297| 6| w2[0] = w1[0] ^ KRK[CK1][0]; 298| 6| w2[1] = w1[1] ^ KRK[CK1][1]; 299| 6| w2[2] = w1[2] ^ KRK[CK1][2]; 300| 6| w2[3] = w1[3] ^ KRK[CK1][3]; 301| | 302| 6| ARIA_FE(w2[0], w2[1], w2[2], w2[3]); 303| | 304| 6| w2[0] ^= w0[0]; 305| 6| w2[1] ^= w0[1]; 306| 6| w2[2] ^= w0[2]; 307| 6| w2[3] ^= w0[3]; 308| | 309| 6| w3[0] = w2[0] ^ KRK[CK2][0]; 310| 6| w3[1] = w2[1] ^ KRK[CK2][1]; 311| 6| w3[2] = w2[2] ^ KRK[CK2][2]; 312| 6| w3[3] = w2[3] ^ KRK[CK2][3]; 313| | 314| 6| ARIA_FO(w3[0], w3[1], w3[2], w3[3]); 315| | 316| 6| w3[0] ^= w1[0]; 317| 6| w3[1] ^= w1[1]; 318| 6| w3[2] ^= w1[2]; 319| 6| w3[3] ^= w1[3]; 320| | 321| 6| if(key.size() == 16) { ------------------ | Branch (321:7): [True: 3, False: 3] ------------------ 322| 3| ERK.resize(4 * 13); 323| 3| } else if(key.size() == 24) { ------------------ | Branch (323:14): [True: 0, False: 3] ------------------ 324| 0| ERK.resize(4 * 15); 325| 3| } else if(key.size() == 32) { ------------------ | Branch (325:14): [True: 3, False: 0] ------------------ 326| 3| ERK.resize(4 * 17); 327| 3| } 328| | 329| 6| ARIA_ROL128<19>(w0, w1, &ERK[0]); // NOLINT(*-container-data-pointer) 330| 6| ARIA_ROL128<19>(w1, w2, &ERK[4]); 331| 6| ARIA_ROL128<19>(w2, w3, &ERK[8]); 332| 6| ARIA_ROL128<19>(w3, w0, &ERK[12]); 333| 6| ARIA_ROL128<31>(w0, w1, &ERK[16]); 334| 6| ARIA_ROL128<31>(w1, w2, &ERK[20]); 335| 6| ARIA_ROL128<31>(w2, w3, &ERK[24]); 336| 6| ARIA_ROL128<31>(w3, w0, &ERK[28]); 337| 6| ARIA_ROL128<67>(w0, w1, &ERK[32]); 338| 6| ARIA_ROL128<67>(w1, w2, &ERK[36]); 339| 6| ARIA_ROL128<67>(w2, w3, &ERK[40]); 340| 6| ARIA_ROL128<67>(w3, w0, &ERK[44]); 341| 6| ARIA_ROL128<97>(w0, w1, &ERK[48]); 342| | 343| 6| if(key.size() == 24 || key.size() == 32) { ------------------ | Branch (343:7): [True: 0, False: 6] | Branch (343:27): [True: 3, False: 3] ------------------ 344| 3| ARIA_ROL128<97>(w1, w2, &ERK[52]); 345| 3| ARIA_ROL128<97>(w2, w3, &ERK[56]); 346| | 347| 3| if(key.size() == 32) { ------------------ | Branch (347:10): [True: 3, False: 0] ------------------ 348| 3| ARIA_ROL128<97>(w3, w0, &ERK[60]); 349| 3| ARIA_ROL128<109>(w0, w1, &ERK[64]); 350| 3| } 351| 3| } 352| | 353| | // Now create the decryption key schedule 354| 6| DRK.resize(ERK.size()); 355| | 356| 96| for(size_t i = 0; i != DRK.size(); i += 4) { ------------------ | Branch (356:22): [True: 90, False: 6] ------------------ 357| 90| DRK[i] = ERK[ERK.size() - 4 - i]; 358| 90| DRK[i + 1] = ERK[ERK.size() - 3 - i]; 359| 90| DRK[i + 2] = ERK[ERK.size() - 2 - i]; 360| 90| DRK[i + 3] = ERK[ERK.size() - 1 - i]; 361| 90| } 362| | 363| 84| for(size_t i = 4; i != DRK.size() - 4; i += 4) { ------------------ | Branch (363:22): [True: 78, False: 6] ------------------ 364| 78| aria_ks_dk_transform(DRK[i + 0], DRK[i + 1], DRK[i + 2], DRK[i + 3]); 365| 78| } 366| 6|} aria.cpp:_ZN5Botan12_GLOBAL__N_16ARIA_F11ARIA_ROL128ILm19EEEvPKjS4_Pj: 221| 24|inline void ARIA_ROL128(const uint32_t X[4], const uint32_t Y[4], uint32_t KS[4]) { 222| | // MSVC is not generating a "rotate immediate". Constify to help it along. 223| 24| static const size_t Q = 4 - (N / 32); 224| 24| static const size_t R = N % 32; 225| 24| static_assert(R > 0 && R < 32, "Rotation in range for type"); 226| 24| KS[0] = (X[0]) ^ ((Y[(Q) % 4]) >> R) ^ ((Y[(Q + 3) % 4]) << (32 - R)); 227| 24| KS[1] = (X[1]) ^ ((Y[(Q + 1) % 4]) >> R) ^ ((Y[(Q) % 4]) << (32 - R)); 228| 24| KS[2] = (X[2]) ^ ((Y[(Q + 2) % 4]) >> R) ^ ((Y[(Q + 1) % 4]) << (32 - R)); 229| 24| KS[3] = (X[3]) ^ ((Y[(Q + 3) % 4]) >> R) ^ ((Y[(Q + 2) % 4]) << (32 - R)); 230| 24|} aria.cpp:_ZN5Botan12_GLOBAL__N_16ARIA_F11ARIA_ROL128ILm31EEEvPKjS4_Pj: 221| 24|inline void ARIA_ROL128(const uint32_t X[4], const uint32_t Y[4], uint32_t KS[4]) { 222| | // MSVC is not generating a "rotate immediate". Constify to help it along. 223| 24| static const size_t Q = 4 - (N / 32); 224| 24| static const size_t R = N % 32; 225| 24| static_assert(R > 0 && R < 32, "Rotation in range for type"); 226| 24| KS[0] = (X[0]) ^ ((Y[(Q) % 4]) >> R) ^ ((Y[(Q + 3) % 4]) << (32 - R)); 227| 24| KS[1] = (X[1]) ^ ((Y[(Q + 1) % 4]) >> R) ^ ((Y[(Q) % 4]) << (32 - R)); 228| 24| KS[2] = (X[2]) ^ ((Y[(Q + 2) % 4]) >> R) ^ ((Y[(Q + 1) % 4]) << (32 - R)); 229| 24| KS[3] = (X[3]) ^ ((Y[(Q + 3) % 4]) >> R) ^ ((Y[(Q + 2) % 4]) << (32 - R)); 230| 24|} aria.cpp:_ZN5Botan12_GLOBAL__N_16ARIA_F11ARIA_ROL128ILm67EEEvPKjS4_Pj: 221| 24|inline void ARIA_ROL128(const uint32_t X[4], const uint32_t Y[4], uint32_t KS[4]) { 222| | // MSVC is not generating a "rotate immediate". Constify to help it along. 223| 24| static const size_t Q = 4 - (N / 32); 224| 24| static const size_t R = N % 32; 225| 24| static_assert(R > 0 && R < 32, "Rotation in range for type"); 226| 24| KS[0] = (X[0]) ^ ((Y[(Q) % 4]) >> R) ^ ((Y[(Q + 3) % 4]) << (32 - R)); 227| 24| KS[1] = (X[1]) ^ ((Y[(Q + 1) % 4]) >> R) ^ ((Y[(Q) % 4]) << (32 - R)); 228| 24| KS[2] = (X[2]) ^ ((Y[(Q + 2) % 4]) >> R) ^ ((Y[(Q + 1) % 4]) << (32 - R)); 229| 24| KS[3] = (X[3]) ^ ((Y[(Q + 3) % 4]) >> R) ^ ((Y[(Q + 2) % 4]) << (32 - R)); 230| 24|} aria.cpp:_ZN5Botan12_GLOBAL__N_16ARIA_F11ARIA_ROL128ILm97EEEvPKjS4_Pj: 221| 15|inline void ARIA_ROL128(const uint32_t X[4], const uint32_t Y[4], uint32_t KS[4]) { 222| | // MSVC is not generating a "rotate immediate". Constify to help it along. 223| 15| static const size_t Q = 4 - (N / 32); 224| 15| static const size_t R = N % 32; 225| 15| static_assert(R > 0 && R < 32, "Rotation in range for type"); 226| 15| KS[0] = (X[0]) ^ ((Y[(Q) % 4]) >> R) ^ ((Y[(Q + 3) % 4]) << (32 - R)); 227| 15| KS[1] = (X[1]) ^ ((Y[(Q + 1) % 4]) >> R) ^ ((Y[(Q) % 4]) << (32 - R)); 228| 15| KS[2] = (X[2]) ^ ((Y[(Q + 2) % 4]) >> R) ^ ((Y[(Q + 1) % 4]) << (32 - R)); 229| 15| KS[3] = (X[3]) ^ ((Y[(Q + 3) % 4]) >> R) ^ ((Y[(Q + 2) % 4]) << (32 - R)); 230| 15|} aria.cpp:_ZN5Botan12_GLOBAL__N_16ARIA_F11ARIA_ROL128ILm109EEEvPKjS4_Pj: 221| 3|inline void ARIA_ROL128(const uint32_t X[4], const uint32_t Y[4], uint32_t KS[4]) { 222| | // MSVC is not generating a "rotate immediate". Constify to help it along. 223| 3| static const size_t Q = 4 - (N / 32); 224| 3| static const size_t R = N % 32; 225| 3| static_assert(R > 0 && R < 32, "Rotation in range for type"); 226| 3| KS[0] = (X[0]) ^ ((Y[(Q) % 4]) >> R) ^ ((Y[(Q + 3) % 4]) << (32 - R)); 227| 3| KS[1] = (X[1]) ^ ((Y[(Q + 1) % 4]) >> R) ^ ((Y[(Q) % 4]) << (32 - R)); 228| 3| KS[2] = (X[2]) ^ ((Y[(Q + 2) % 4]) >> R) ^ ((Y[(Q + 1) % 4]) << (32 - R)); 229| 3| KS[3] = (X[3]) ^ ((Y[(Q + 3) % 4]) >> R) ^ ((Y[(Q + 2) % 4]) << (32 - R)); 230| 3|} aria.cpp:_ZN5Botan12_GLOBAL__N_16ARIA_F20aria_ks_dk_transformERjS2_S2_S2_: 232| 78|void aria_ks_dk_transform(uint32_t& K0, uint32_t& K1, uint32_t& K2, uint32_t& K3) { 233| 78| K0 = rotr<8>(K0) ^ rotr<16>(K0) ^ rotr<24>(K0); 234| 78| K1 = rotr<8>(K1) ^ rotr<16>(K1) ^ rotr<24>(K1); 235| 78| K2 = rotr<8>(K2) ^ rotr<16>(K2) ^ rotr<24>(K2); 236| 78| K3 = rotr<8>(K3) ^ rotr<16>(K3) ^ rotr<24>(K3); 237| | 238| 78| K1 ^= K2; 239| 78| K2 ^= K3; 240| 78| K0 ^= K1; 241| 78| K3 ^= K1; 242| 78| K2 ^= K0; 243| 78| K1 ^= K2; 244| | 245| 78| K1 = ((K1 << 8) & 0xFF00FF00) | ((K1 >> 8) & 0x00FF00FF); 246| 78| K2 = rotr<16>(K2); 247| 78| K3 = reverse_bytes(K3); 248| | 249| 78| K1 ^= K2; 250| 78| K2 ^= K3; 251| 78| K0 ^= K1; 252| 78| K3 ^= K1; 253| 78| K2 ^= K0; 254| 78| K1 ^= K2; 255| 78|} _ZNK5Botan8ARIA_12818aria_hwaes_encryptEPKhPhm: 224| 9|void BOTAN_FN_ISA_HWAES ARIA_128::aria_hwaes_encrypt(const uint8_t in[], uint8_t out[], size_t blocks) const { 225| 9| ARIA_HWAES::aria_transform(in, out, blocks, m_ERK); 226| 9|} _ZNK5Botan8ARIA_25618aria_hwaes_encryptEPKhPhm: 240| 9|void BOTAN_FN_ISA_HWAES ARIA_256::aria_hwaes_encrypt(const uint8_t in[], uint8_t out[], size_t blocks) const { 241| 9| ARIA_HWAES::aria_transform(in, out, blocks, m_ERK); 242| 9|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_114aria_transformEPKhPhmNSt3__14spanIKjLm18446744073709551615EEE: 203| 18|void BOTAN_FN_ISA_HWAES aria_transform(const uint8_t in[], uint8_t out[], size_t blocks, std::span KS) { 204| 90| while(blocks >= 4) { ------------------ | Branch (204:10): [True: 72, False: 18] ------------------ 205| 72| transform_4(in, out, KS); 206| 72| in += 4 * 16; 207| 72| out += 4 * 16; 208| 72| blocks -= 4; 209| 72| } 210| | 211| 18| if(blocks > 0) { ------------------ | Branch (211:7): [True: 0, False: 18] ------------------ 212| 0| uint8_t ibuf[4 * 16] = {0}; 213| 0| uint8_t obuf[4 * 16] = {0}; 214| 0| copy_mem(ibuf, in, blocks * 16); 215| 0| transform_4(ibuf, obuf, KS); 216| 0| copy_mem(out, obuf, blocks * 16); 217| 0| } 218| 18|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_111transform_4EPKhPhNSt3__14spanIKjLm18446744073709551615EEE: 159| 72|BOTAN_FN_ISA_HWAES void transform_4(const uint8_t in[], uint8_t out[], std::span KS) { 160| 72| const size_t ROUNDS = (KS.size() / 4) - 1; 161| | 162| 72| auto B0 = SIMD_4x32::load_be(in); 163| 72| auto B1 = SIMD_4x32::load_be(in + 16); 164| 72| auto B2 = SIMD_4x32::load_be(in + 32); 165| 72| auto B3 = SIMD_4x32::load_be(in + 48); 166| | 167| 72| SIMD_4x32::transpose(B0, B1, B2, B3); 168| | 169| 576| for(size_t r = 0; r != ROUNDS; r += 2) { ------------------ | Branch (169:22): [True: 504, False: 72] ------------------ 170| 504| B0 ^= SIMD_4x32::splat(KS[4 * r]); 171| 504| B1 ^= SIMD_4x32::splat(KS[4 * r + 1]); 172| 504| B2 ^= SIMD_4x32::splat(KS[4 * r + 2]); 173| 504| B3 ^= SIMD_4x32::splat(KS[4 * r + 3]); 174| | 175| 504| aria_fo(B0, B1, B2, B3); 176| | 177| 504| B0 ^= SIMD_4x32::splat(KS[4 * r + 4]); 178| 504| B1 ^= SIMD_4x32::splat(KS[4 * r + 5]); 179| 504| B2 ^= SIMD_4x32::splat(KS[4 * r + 6]); 180| 504| B3 ^= SIMD_4x32::splat(KS[4 * r + 7]); 181| | 182| 504| if(r != ROUNDS - 2) { ------------------ | Branch (182:10): [True: 432, False: 72] ------------------ 183| 432| aria_fe(B0, B1, B2, B3); 184| 432| } 185| 504| } 186| | 187| | // Last half-round: FE sbox only 188| 72| aria_fe_sbox(B0, B1, B2, B3); 189| | 190| 72| B0 ^= SIMD_4x32::splat(KS[4 * ROUNDS]); 191| 72| B1 ^= SIMD_4x32::splat(KS[4 * ROUNDS + 1]); 192| 72| B2 ^= SIMD_4x32::splat(KS[4 * ROUNDS + 2]); 193| 72| B3 ^= SIMD_4x32::splat(KS[4 * ROUNDS + 3]); 194| | 195| 72| SIMD_4x32::transpose(B0, B1, B2, B3); 196| | 197| 72| B0.store_be(out); 198| 72| B1.store_be(out + 16); 199| 72| B2.store_be(out + 32); 200| 72| B3.store_be(out + 48); 201| 72|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_17aria_foERNS_9SIMD_4x32ES3_S3_S3_: 125| 504|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES void aria_fo(SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 126| 504| aria_fo_sbox(B0, B1, B2, B3); 127| | 128| 504| B0 = aria_fo_m(B0); 129| 504| B1 = aria_fo_m(B1); 130| 504| B2 = aria_fo_m(B2); 131| 504| B3 = aria_fo_m(B3); 132| | 133| 504| aria_mix(B0, B1, B2, B3); 134| | 135| 504| B1 = swap_abcd_badc(B1); 136| 504| B2 = B2.rotl<16>(); 137| 504| B3 = B3.bswap(); 138| | 139| 504| aria_mix(B0, B1, B2, B3); 140| 504|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_112aria_fo_sboxERNS_9SIMD_4x32ES3_S3_S3_: 87| 504|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES void aria_fo_sbox(SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 88| 504| B0 = byte_transpose(B0); 89| 504| B1 = byte_transpose(B1); 90| 504| B2 = byte_transpose(B2); 91| 504| B3 = byte_transpose(B3); 92| 504| SIMD_4x32::transpose(B0, B1, B2, B3); 93| | 94| 504| B3 = aria_s1(B3); 95| 504| B2 = aria_s2(B2); 96| 504| B1 = aria_x1(B1); 97| 504| B0 = aria_x2(B0); 98| | 99| 504| SIMD_4x32::transpose(B0, B1, B2, B3); 100| 504| B0 = byte_transpose(B0); 101| 504| B1 = byte_transpose(B1); 102| 504| B2 = byte_transpose(B2); 103| 504| B3 = byte_transpose(B3); 104| 504|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_114byte_transposeENS_9SIMD_4x32E: 82| 8.06k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 byte_transpose(SIMD_4x32 v) { 83| 8.06k| const SIMD_4x32 tbl(0x0C080400, 0x0D090501, 0x0E0A0602, 0x0F0B0703); 84| 8.06k| return SIMD_4x32::byte_shuffle(v, tbl); 85| 8.06k|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_17aria_s1ENS_9SIMD_4x32E: 21| 1.00k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 aria_s1(SIMD_4x32 v) { 22| 1.00k| return hw_aes_sbox(v); 23| 1.00k|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_17aria_s2ENS_9SIMD_4x32E: 25| 1.00k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 aria_s2(SIMD_4x32 v) { 26| 1.00k| constexpr uint64_t AFF_S2 = gfni_matrix(R"( 27| 1.00k| 0 1 0 1 0 1 1 1 28| 1.00k| 0 0 1 1 1 1 1 1 29| 1.00k| 1 1 1 0 1 1 0 1 30| 1.00k| 1 1 0 0 0 0 1 1 31| 1.00k| 0 1 0 0 0 0 1 1 32| 1.00k| 1 1 0 0 1 1 1 0 33| 1.00k| 0 1 1 0 0 0 1 1 34| 1.00k| 1 1 1 1 0 1 1 0)"); 35| | 36| 1.00k| constexpr auto POST_S2 = Gf2AffineTransformation::post_sbox(AFF_S2, 0xE2); 37| 1.00k| return POST_S2.affine_transform(hw_aes_sbox(v)); 38| 1.00k|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_17aria_x1ENS_9SIMD_4x32E: 41| 1.00k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 aria_x1(SIMD_4x32 v) { 42| 1.00k| return hw_aes_inv_sbox(v); 43| 1.00k|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_17aria_x2ENS_9SIMD_4x32E: 45| 1.00k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 aria_x2(SIMD_4x32 v) { 46| 1.00k| constexpr uint64_t AFF_X2 = gfni_matrix(R"( 47| 1.00k| 0 0 0 1 1 0 0 0 48| 1.00k| 0 0 1 0 0 1 1 0 49| 1.00k| 0 0 0 0 1 0 1 0 50| 1.00k| 1 1 1 0 0 0 1 1 51| 1.00k| 1 1 1 0 1 1 0 0 52| 1.00k| 0 1 1 0 1 0 1 1 53| 1.00k| 1 0 1 1 1 1 0 1 54| 1.00k| 1 0 0 1 0 0 1 1)"); 55| 1.00k| constexpr auto PRE_X2D = Gf2AffineTransformation::post_inv_sbox(AFF_X2, 0x2C); 56| | 57| 1.00k| return hw_aes_inv_sbox(PRE_X2D.affine_transform(v)); 58| 1.00k|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_19aria_fo_mENS_9SIMD_4x32E: 60| 2.01k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 aria_fo_m(SIMD_4x32 x) { 61| 2.01k| return x.rotl<8>() ^ x.rotl<16>() ^ x.rotl<24>(); 62| 2.01k|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_18aria_mixERNS_9SIMD_4x32ES3_S3_S3_: 68| 1.87k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES void aria_mix(SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 69| 1.87k| B1 ^= B2; 70| 1.87k| B2 ^= B3; 71| 1.87k| B0 ^= B1; 72| 1.87k| B3 ^= B1; 73| 1.87k| B2 ^= B0; 74| 1.87k| B1 ^= B2; 75| 1.87k|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_114swap_abcd_badcENS_9SIMD_4x32E: 77| 936|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 swap_abcd_badc(SIMD_4x32 x) { 78| 936| const auto shuf = SIMD_4x32(0x02030001, 0x06070405, 0x0A0B0809, 0x0E0F0C0D); 79| 936| return SIMD_4x32::byte_shuffle(x, shuf); 80| 936|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_17aria_feERNS_9SIMD_4x32ES3_S3_S3_: 142| 432|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES void aria_fe(SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 143| 432| aria_fe_sbox(B0, B1, B2, B3); 144| | 145| 432| B0 = aria_fe_m(B0); 146| 432| B1 = aria_fe_m(B1); 147| 432| B2 = aria_fe_m(B2); 148| 432| B3 = aria_fe_m(B3); 149| | 150| 432| aria_mix(B0, B1, B2, B3); 151| | 152| 432| B3 = swap_abcd_badc(B3); 153| 432| B0 = B0.rotl<16>(); 154| 432| B1 = B1.bswap(); 155| | 156| 432| aria_mix(B0, B1, B2, B3); 157| 432|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_19aria_fe_mENS_9SIMD_4x32E: 64| 1.72k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 aria_fe_m(SIMD_4x32 x) { 65| 1.72k| return x ^ x.rotl<8>() ^ x.rotl<24>(); 66| 1.72k|} aria_hwaes.cpp:_ZN5Botan10ARIA_HWAES12_GLOBAL__N_112aria_fe_sboxERNS_9SIMD_4x32ES3_S3_S3_: 106| 504|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES void aria_fe_sbox(SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 107| 504| B0 = byte_transpose(B0); 108| 504| B1 = byte_transpose(B1); 109| 504| B2 = byte_transpose(B2); 110| 504| B3 = byte_transpose(B3); 111| 504| SIMD_4x32::transpose(B0, B1, B2, B3); 112| | 113| 504| B3 = aria_x1(B3); 114| 504| B2 = aria_x2(B2); 115| 504| B1 = aria_s1(B1); 116| 504| B0 = aria_s2(B0); 117| | 118| 504| SIMD_4x32::transpose(B0, B1, B2, B3); 119| 504| B0 = byte_transpose(B0); 120| 504| B1 = byte_transpose(B1); 121| 504| B2 = byte_transpose(B2); 122| 504| B3 = byte_transpose(B3); 123| 504|} _ZN5Botan11BlockCipher6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 97| 287|std::unique_ptr BlockCipher::create(std::string_view algo, std::string_view provider) { 98| |#if defined(BOTAN_HAS_COMMONCRYPTO) 99| | if(provider.empty() || provider == "commoncrypto") { 100| | if(auto bc = make_commoncrypto_block_cipher(algo)) 101| | return bc; 102| | 103| | if(!provider.empty()) 104| | return nullptr; 105| | } 106| |#endif 107| | 108| | // TODO: CryptoAPI 109| | // TODO: /dev/crypto 110| | 111| | // Only base providers from here on out 112| 287| if(provider.empty() == false && provider != "base") { ------------------ | Branch (112:7): [True: 0, False: 287] | Branch (112:36): [True: 0, False: 0] ------------------ 113| 0| return nullptr; 114| 0| } 115| | 116| 287|#if defined(BOTAN_HAS_AES) 117| 287| if(algo == "AES-128") { ------------------ | Branch (117:7): [True: 95, False: 192] ------------------ 118| 95| return std::make_unique(); 119| 95| } 120| | 121| 192| if(algo == "AES-192") { ------------------ | Branch (121:7): [True: 0, False: 192] ------------------ 122| 0| return std::make_unique(); 123| 0| } 124| | 125| 192| if(algo == "AES-256") { ------------------ | Branch (125:7): [True: 126, False: 66] ------------------ 126| 126| return std::make_unique(); 127| 126| } 128| 66|#endif 129| | 130| 66|#if defined(BOTAN_HAS_ARIA) 131| 66| if(algo == "ARIA-128") { ------------------ | Branch (131:7): [True: 3, False: 63] ------------------ 132| 3| return std::make_unique(); 133| 3| } 134| | 135| 63| if(algo == "ARIA-192") { ------------------ | Branch (135:7): [True: 0, False: 63] ------------------ 136| 0| return std::make_unique(); 137| 0| } 138| | 139| 63| if(algo == "ARIA-256") { ------------------ | Branch (139:7): [True: 3, False: 60] ------------------ 140| 3| return std::make_unique(); 141| 3| } 142| 60|#endif 143| | 144| 60|#if defined(BOTAN_HAS_SERPENT) 145| 60| if(algo == "Serpent") { ------------------ | Branch (145:7): [True: 0, False: 60] ------------------ 146| 0| return std::make_unique(); 147| 0| } 148| 60|#endif 149| | 150| 60|#if defined(BOTAN_HAS_SHACAL2) 151| 60| if(algo == "SHACAL2") { ------------------ | Branch (151:7): [True: 0, False: 60] ------------------ 152| 0| return std::make_unique(); 153| 0| } 154| 60|#endif 155| | 156| 60|#if defined(BOTAN_HAS_TWOFISH) 157| 60| if(algo == "Twofish") { ------------------ | Branch (157:7): [True: 0, False: 60] ------------------ 158| 0| return std::make_unique(); 159| 0| } 160| 60|#endif 161| | 162| 60|#if defined(BOTAN_HAS_THREEFISH_512) 163| 60| if(algo == "Threefish-512") { ------------------ | Branch (163:7): [True: 0, False: 60] ------------------ 164| 0| return std::make_unique(); 165| 0| } 166| 60|#endif 167| | 168| 60|#if defined(BOTAN_HAS_BLOWFISH) 169| 60| if(algo == "Blowfish") { ------------------ | Branch (169:7): [True: 0, False: 60] ------------------ 170| 0| return std::make_unique(); 171| 0| } 172| 60|#endif 173| | 174| 60|#if defined(BOTAN_HAS_CAMELLIA) 175| 60| if(algo == "Camellia-128") { ------------------ | Branch (175:7): [True: 8, False: 52] ------------------ 176| 8| return std::make_unique(); 177| 8| } 178| | 179| 52| if(algo == "Camellia-192") { ------------------ | Branch (179:7): [True: 0, False: 52] ------------------ 180| 0| return std::make_unique(); 181| 0| } 182| | 183| 52| if(algo == "Camellia-256") { ------------------ | Branch (183:7): [True: 7, False: 45] ------------------ 184| 7| return std::make_unique(); 185| 7| } 186| 45|#endif 187| | 188| 45|#if defined(BOTAN_HAS_DES) 189| 45| if(algo == "DES") { ------------------ | Branch (189:7): [True: 0, False: 45] ------------------ 190| 0| return std::make_unique(); 191| 0| } 192| | 193| 45| if(algo == "TripleDES" || algo == "3DES" || algo == "DES-EDE") { ------------------ | Branch (193:7): [True: 0, False: 45] | Branch (193:30): [True: 45, False: 0] | Branch (193:48): [True: 0, False: 0] ------------------ 194| 45| return std::make_unique(); 195| 45| } 196| 0|#endif 197| | 198| 0|#if defined(BOTAN_HAS_NOEKEON) 199| 0| if(algo == "Noekeon") { ------------------ | Branch (199:7): [True: 0, False: 0] ------------------ 200| 0| return std::make_unique(); 201| 0| } 202| 0|#endif 203| | 204| 0|#if defined(BOTAN_HAS_CAST_128) 205| 0| if(algo == "CAST-128" || algo == "CAST5") { ------------------ | Branch (205:7): [True: 0, False: 0] | Branch (205:29): [True: 0, False: 0] ------------------ 206| 0| return std::make_unique(); 207| 0| } 208| 0|#endif 209| | 210| 0|#if defined(BOTAN_HAS_IDEA) 211| 0| if(algo == "IDEA") { ------------------ | Branch (211:7): [True: 0, False: 0] ------------------ 212| 0| return std::make_unique(); 213| 0| } 214| 0|#endif 215| | 216| 0|#if defined(BOTAN_HAS_KUZNYECHIK) 217| 0| if(algo == "Kuznyechik") { ------------------ | Branch (217:7): [True: 0, False: 0] ------------------ 218| 0| return std::make_unique(); 219| 0| } 220| 0|#endif 221| | 222| 0|#if defined(BOTAN_HAS_SEED) 223| 0| if(algo == "SEED") { ------------------ | Branch (223:7): [True: 0, False: 0] ------------------ 224| 0| return std::make_unique(); 225| 0| } 226| 0|#endif 227| | 228| 0|#if defined(BOTAN_HAS_SM4) 229| 0| if(algo == "SM4") { ------------------ | Branch (229:7): [True: 0, False: 0] ------------------ 230| 0| return std::make_unique(); 231| 0| } 232| 0|#endif 233| | 234| 0| const AlgorithmSpec req(algo); 235| | 236| 0|#if defined(BOTAN_HAS_GOST_28147_89) 237| 0| if(auto m = req.match("GOST-28147-89({params:str=R3411_94_TestParam})")) { ------------------ | Branch (237:12): [True: 0, False: 0] ------------------ 238| 0| return std::make_unique(m->str("params")); 239| 0| } 240| 0|#endif 241| | 242| 0|#if defined(BOTAN_HAS_CASCADE) 243| 0| if(auto m = req.match("Cascade({cipher1},{cipher2})")) { ------------------ | Branch (243:12): [True: 0, False: 0] ------------------ 244| 0| auto c1 = BlockCipher::create(m->str("cipher1")); 245| 0| auto c2 = BlockCipher::create(m->str("cipher2")); 246| | 247| 0| if(c1 && c2) { ------------------ | Branch (247:10): [True: 0, False: 0] | Branch (247:16): [True: 0, False: 0] ------------------ 248| 0| return std::make_unique(std::move(c1), std::move(c2)); 249| 0| } 250| 0| } 251| 0|#endif 252| | 253| 0|#if defined(BOTAN_HAS_LION) 254| 0| if(auto m = req.match("Lion({hash},{stream},{block_size:int=1024})")) { ------------------ | Branch (254:12): [True: 0, False: 0] ------------------ 255| 0| auto hash = HashFunction::create(m->str("hash")); 256| 0| auto stream = StreamCipher::create(m->str("stream")); 257| | 258| 0| if(hash && stream) { ------------------ | Branch (258:10): [True: 0, False: 0] | Branch (258:18): [True: 0, False: 0] ------------------ 259| 0| return std::make_unique(std::move(hash), std::move(stream), m->integer("block_size")); 260| 0| } 261| 0| } 262| 0|#endif 263| | 264| 0| BOTAN_UNUSED(req); ------------------ | | 151| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 265| 0| BOTAN_UNUSED(provider); ------------------ | | 151| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 266| | 267| 0| return nullptr; 268| 0|} _ZN5Botan11BlockCipher15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 271| 107|std::unique_ptr BlockCipher::create_or_throw(std::string_view algo, std::string_view provider) { 272| 107| if(auto bc = BlockCipher::create(algo, provider)) { ------------------ | Branch (272:12): [True: 107, False: 0] ------------------ 273| 107| return bc; 274| 107| } 275| 0| throw Lookup_Error("Block cipher", algo, provider); 276| 107|} _ZNK5Botan12Camellia_1289encrypt_nEPKhPhm: 431| 31|void Camellia_128::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 432| 31| assert_key_material_set(); 433| | 434| 31|#if defined(BOTAN_HAS_CAMELLIA_AVX512_GFNI) 435| 31| if(CPUID::has(CPUID::Feature::AVX512, CPUID::Feature::GFNI)) { ------------------ | Branch (435:7): [True: 0, False: 31] ------------------ 436| 0| return avx512_gfni_encrypt(in, out, blocks, m_SK); 437| 0| } 438| 31|#endif 439| | 440| 31|#if defined(BOTAN_HAS_CAMELLIA_AVX2_GFNI) 441| 31| if(CPUID::has(CPUID::Feature::GFNI)) { ------------------ | Branch (441:7): [True: 0, False: 31] ------------------ 442| 0| return avx2_gfni_encrypt(in, out, blocks, m_SK); 443| 0| } 444| 31|#endif 445| | 446| 31|#if defined(BOTAN_HAS_CAMELLIA_HWAES) 447| 31| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (447:7): [True: 31, False: 0] ------------------ 448| 31| return hwaes_encrypt(in, out, blocks, m_SK); 449| 31| } 450| 0|#endif 451| | 452| 0| Camellia_F::encrypt(in, out, blocks, m_SK, 9); 453| 0|} _ZNK5Botan12Camellia_2569encrypt_nEPKhPhm: 479| 31|void Camellia_256::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 480| 31| assert_key_material_set(); 481| | 482| 31|#if defined(BOTAN_HAS_CAMELLIA_AVX512_GFNI) 483| 31| if(CPUID::has(CPUID::Feature::AVX512, CPUID::Feature::GFNI)) { ------------------ | Branch (483:7): [True: 0, False: 31] ------------------ 484| 0| return avx512_gfni_encrypt(in, out, blocks, m_SK); 485| 0| } 486| 31|#endif 487| | 488| 31|#if defined(BOTAN_HAS_CAMELLIA_AVX2_GFNI) 489| 31| if(CPUID::has(CPUID::Feature::GFNI)) { ------------------ | Branch (489:7): [True: 0, False: 31] ------------------ 490| 0| return avx2_gfni_encrypt(in, out, blocks, m_SK); 491| 0| } 492| 31|#endif 493| | 494| 31|#if defined(BOTAN_HAS_CAMELLIA_HWAES) 495| 31| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (495:7): [True: 31, False: 0] ------------------ 496| 31| return hwaes_encrypt(in, out, blocks, m_SK); 497| 31| } 498| 0|#endif 499| | 500| 0| Camellia_F::encrypt(in, out, blocks, m_SK, 12); 501| 0|} _ZNK5Botan12Camellia_12819has_keying_materialEv: 575| 67|bool Camellia_128::has_keying_material() const { 576| 67| return !m_SK.empty(); 577| 67|} _ZNK5Botan12Camellia_25619has_keying_materialEv: 583| 67|bool Camellia_256::has_keying_material() const { 584| 67| return !m_SK.empty(); 585| 67|} _ZN5Botan12Camellia_12812key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 587| 8|void Camellia_128::key_schedule(std::span key) { 588| 8| Camellia_F::key_schedule(m_SK, key); 589| 8|} _ZN5Botan12Camellia_25612key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 595| 7|void Camellia_256::key_schedule(std::span key) { 596| 7| Camellia_F::key_schedule(m_SK, key); 597| 7|} _ZNK5Botan12Camellia_12811parallelismEv: 623| 16|size_t Camellia_128::parallelism() const { 624| 16| return Camellia_F::parallelism(); 625| 16|} _ZNK5Botan12Camellia_25611parallelismEv: 631| 14|size_t Camellia_256::parallelism() const { 632| 14| return Camellia_F::parallelism(); 633| 14|} camellia.cpp:_ZN5Botan12_GLOBAL__N_110Camellia_F1PEhhhhhhhh: 96| 90|inline uint64_t P(uint8_t z1, uint8_t z2, uint8_t z3, uint8_t z4, uint8_t z5, uint8_t z6, uint8_t z7, uint8_t z8) { 97| 90| constexpr uint64_t M1 = 0x0101010001000001; 98| 90| constexpr uint64_t M2 = 0x0001010101010000; 99| 90| constexpr uint64_t M3 = 0x0100010100010100; 100| 90| constexpr uint64_t M4 = 0x0101000100000101; 101| 90| constexpr uint64_t M5 = 0x0001010100010101; 102| 90| constexpr uint64_t M6 = 0x0100010101000101; 103| 90| constexpr uint64_t M7 = 0x0101000101010001; 104| 90| constexpr uint64_t M8 = 0x0101010001010100; 105| | 106| 90| const uint64_t Z1 = M1 * z1; 107| 90| const uint64_t Z2 = M2 * z2; 108| 90| const uint64_t Z3 = M3 * z3; 109| 90| const uint64_t Z4 = M4 * z4; 110| 90| const uint64_t Z5 = M5 * z5; 111| 90| const uint64_t Z6 = M6 * z6; 112| 90| const uint64_t Z7 = M7 * z7; 113| 90| const uint64_t Z8 = M8 * z8; 114| | 115| 90| return Z1 ^ Z2 ^ Z3 ^ Z4 ^ Z5 ^ Z6 ^ Z7 ^ Z8; 116| 90|} camellia.cpp:_ZN5Botan12_GLOBAL__N_110Camellia_F12key_scheduleERNSt3__16vectorImNS_16secure_allocatorImEEEENS2_4spanIKhLm18446744073709551615EEE: 263| 15|void key_schedule(secure_vector& SK, std::span key) { 264| 15| prefetch_arrays(SBOX1); 265| | 266| 15| constexpr uint64_t Sigma1 = 0xA09E667F3BCC908B; 267| 15| constexpr uint64_t Sigma2 = 0xB67AE8584CAA73B2; 268| 15| constexpr uint64_t Sigma3 = 0xC6EF372FE94F82BE; 269| 15| constexpr uint64_t Sigma4 = 0x54FF53A5F1D36F1C; 270| 15| constexpr uint64_t Sigma5 = 0x10E527FADE682D1D; 271| 15| constexpr uint64_t Sigma6 = 0xB05688C2B3E6C1FD; 272| | 273| 15| const uint64_t KL_H = load_be(key.data(), 0); 274| 15| const uint64_t KL_L = load_be(key.data(), 1); 275| | 276| 15| const uint64_t KR_H = (key.size() >= 24) ? load_be(key.data(), 2) : 0; ------------------ | Branch (276:26): [True: 7, False: 8] ------------------ 277| | 278| 15| const uint64_t KR_L = [&]() -> uint64_t { 279| 15| if(key.size() == 32) { 280| 15| return load_be(key.data(), 3); 281| 15| } else if(key.size() == 24) { 282| 15| return ~KR_H; 283| 15| } else { 284| 15| return 0; 285| 15| } 286| 15| }(); 287| | 288| 15| uint64_t D1 = KL_H ^ KR_H; 289| 15| uint64_t D2 = KL_L ^ KR_L; 290| 15| D2 ^= F_1tab(D1, Sigma1); 291| 15| D1 ^= F_1tab(D2, Sigma2); 292| 15| D1 ^= KL_H; 293| 15| D2 ^= KL_L; 294| 15| D2 ^= F_1tab(D1, Sigma3); 295| 15| D1 ^= F_1tab(D2, Sigma4); 296| | 297| 15| const uint64_t KA_H = D1; 298| 15| const uint64_t KA_L = D2; 299| | 300| 15| D1 = KA_H ^ KR_H; 301| 15| D2 = KA_L ^ KR_L; 302| 15| D2 ^= F_1tab(D1, Sigma5); 303| 15| D1 ^= F_1tab(D2, Sigma6); 304| | 305| 15| const uint64_t KB_H = D1; 306| 15| const uint64_t KB_L = D2; 307| | 308| 15| if(key.size() == 16) { ------------------ | Branch (308:7): [True: 8, False: 7] ------------------ 309| 8| SK.resize(26); 310| | 311| 8| SK[0] = KL_H; 312| 8| SK[1] = KL_L; 313| 8| SK[2] = KA_H; 314| 8| SK[3] = KA_L; 315| 8| SK[4] = left_rot_hi(KL_H, KL_L, 15); 316| 8| SK[5] = left_rot_lo(KL_H, KL_L, 15); 317| 8| SK[6] = left_rot_hi(KA_H, KA_L, 15); 318| 8| SK[7] = left_rot_lo(KA_H, KA_L, 15); 319| 8| SK[8] = left_rot_hi(KA_H, KA_L, 30); 320| 8| SK[9] = left_rot_lo(KA_H, KA_L, 30); 321| 8| SK[10] = left_rot_hi(KL_H, KL_L, 45); 322| 8| SK[11] = left_rot_lo(KL_H, KL_L, 45); 323| 8| SK[12] = left_rot_hi(KA_H, KA_L, 45); 324| 8| SK[13] = left_rot_lo(KL_H, KL_L, 60); 325| 8| SK[14] = left_rot_hi(KA_H, KA_L, 60); 326| 8| SK[15] = left_rot_lo(KA_H, KA_L, 60); 327| 8| SK[16] = left_rot_lo(KL_H, KL_L, 77); 328| 8| SK[17] = left_rot_hi(KL_H, KL_L, 77); 329| 8| SK[18] = left_rot_lo(KL_H, KL_L, 94); 330| 8| SK[19] = left_rot_hi(KL_H, KL_L, 94); 331| 8| SK[20] = left_rot_lo(KA_H, KA_L, 94); 332| 8| SK[21] = left_rot_hi(KA_H, KA_L, 94); 333| 8| SK[22] = left_rot_lo(KL_H, KL_L, 111); 334| 8| SK[23] = left_rot_hi(KL_H, KL_L, 111); 335| 8| SK[24] = left_rot_lo(KA_H, KA_L, 111); 336| 8| SK[25] = left_rot_hi(KA_H, KA_L, 111); 337| 8| } else { 338| 7| SK.resize(34); 339| | 340| 7| SK[0] = KL_H; 341| 7| SK[1] = KL_L; 342| 7| SK[2] = KB_H; 343| 7| SK[3] = KB_L; 344| | 345| 7| SK[4] = left_rot_hi(KR_H, KR_L, 15); 346| 7| SK[5] = left_rot_lo(KR_H, KR_L, 15); 347| 7| SK[6] = left_rot_hi(KA_H, KA_L, 15); 348| 7| SK[7] = left_rot_lo(KA_H, KA_L, 15); 349| | 350| 7| SK[8] = left_rot_hi(KR_H, KR_L, 30); 351| 7| SK[9] = left_rot_lo(KR_H, KR_L, 30); 352| 7| SK[10] = left_rot_hi(KB_H, KB_L, 30); 353| 7| SK[11] = left_rot_lo(KB_H, KB_L, 30); 354| | 355| 7| SK[12] = left_rot_hi(KL_H, KL_L, 45); 356| 7| SK[13] = left_rot_lo(KL_H, KL_L, 45); 357| 7| SK[14] = left_rot_hi(KA_H, KA_L, 45); 358| 7| SK[15] = left_rot_lo(KA_H, KA_L, 45); 359| | 360| 7| SK[16] = left_rot_hi(KL_H, KL_L, 60); 361| 7| SK[17] = left_rot_lo(KL_H, KL_L, 60); 362| 7| SK[18] = left_rot_hi(KR_H, KR_L, 60); 363| 7| SK[19] = left_rot_lo(KR_H, KR_L, 60); 364| 7| SK[20] = left_rot_hi(KB_H, KB_L, 60); 365| 7| SK[21] = left_rot_lo(KB_H, KB_L, 60); 366| | 367| 7| SK[22] = left_rot_lo(KL_H, KL_L, 77); 368| 7| SK[23] = left_rot_hi(KL_H, KL_L, 77); 369| 7| SK[24] = left_rot_lo(KA_H, KA_L, 77); 370| 7| SK[25] = left_rot_hi(KA_H, KA_L, 77); 371| | 372| 7| SK[26] = left_rot_lo(KR_H, KR_L, 94); 373| 7| SK[27] = left_rot_hi(KR_H, KR_L, 94); 374| 7| SK[28] = left_rot_lo(KA_H, KA_L, 94); 375| 7| SK[29] = left_rot_hi(KA_H, KA_L, 94); 376| 7| SK[30] = left_rot_lo(KL_H, KL_L, 111); 377| 7| SK[31] = left_rot_hi(KL_H, KL_L, 111); 378| 7| SK[32] = left_rot_lo(KB_H, KB_L, 111); 379| 7| SK[33] = left_rot_hi(KB_H, KB_L, 111); 380| 7| } 381| 15|} camellia.cpp:_ZZN5Botan12_GLOBAL__N_110Camellia_F12key_scheduleERNSt3__16vectorImNS_16secure_allocatorImEEEENS2_4spanIKhLm18446744073709551615EEEENK3$_0clEv: 278| 15| const uint64_t KR_L = [&]() -> uint64_t { 279| 15| if(key.size() == 32) { ------------------ | Branch (279:10): [True: 7, False: 8] ------------------ 280| 7| return load_be(key.data(), 3); 281| 8| } else if(key.size() == 24) { ------------------ | Branch (281:17): [True: 0, False: 8] ------------------ 282| 0| return ~KR_H; 283| 8| } else { 284| 8| return 0; 285| 8| } 286| 15| }(); camellia.cpp:_ZN5Botan12_GLOBAL__N_110Camellia_F6F_1tabEmm: 131| 90|uint64_t F_1tab(uint64_t v, uint64_t K) { 132| 90| const uint64_t x = v ^ K; 133| | 134| 90| return P(SBOX1[get_byte<0>(x)], 135| 90| rotl<1>(SBOX1[get_byte<1>(x)]), 136| 90| rotl<7>(SBOX1[get_byte<2>(x)]), 137| 90| SBOX1[rotl<1>(get_byte<3>(x))], 138| 90| rotl<1>(SBOX1[get_byte<4>(x)]), 139| 90| rotl<7>(SBOX1[get_byte<5>(x)]), 140| 90| SBOX1[rotl<1>(get_byte<6>(x))], 141| 90| SBOX1[get_byte<7>(x)]); 142| 90|} camellia.cpp:_ZN5Botan12_GLOBAL__N_110Camellia_F11left_rot_hiEmmm: 246| 193|inline uint64_t left_rot_hi(uint64_t h, uint64_t l, size_t shift) { 247| 193| if(shift >= 64) { ------------------ | Branch (247:7): [True: 82, False: 111] ------------------ 248| 82| shift -= 64; 249| 82| } 250| 193| return (h << shift) | (l >> (64 - shift)); 251| 193|} camellia.cpp:_ZN5Botan12_GLOBAL__N_110Camellia_F11left_rot_loEmmm: 253| 193|inline uint64_t left_rot_lo(uint64_t h, uint64_t l, size_t shift) { 254| 193| if(shift >= 64) { ------------------ | Branch (254:7): [True: 82, False: 111] ------------------ 255| 82| shift -= 64; 256| 82| } 257| 193| return (h >> (64 - shift)) | (l << shift); 258| 193|} camellia.cpp:_ZN5Botan12_GLOBAL__N_110Camellia_F11parallelismEv: 405| 30|size_t parallelism() { 406| 30|#if defined(BOTAN_HAS_CAMELLIA_AVX512_GFNI) 407| 30| if(CPUID::has(CPUID::Feature::AVX512, CPUID::Feature::GFNI)) { ------------------ | Branch (407:7): [True: 0, False: 30] ------------------ 408| 0| return 16; 409| 0| } 410| 30|#endif 411| | 412| 30|#if defined(BOTAN_HAS_CAMELLIA_AVX2_GFNI) 413| 30| if(CPUID::has(CPUID::Feature::GFNI)) { ------------------ | Branch (413:7): [True: 0, False: 30] ------------------ 414| 0| return 4; 415| 0| } 416| 30|#endif 417| | 418| 30|#if defined(BOTAN_HAS_CAMELLIA_HWAES) 419| 30| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (419:7): [True: 30, False: 0] ------------------ 420| 30| return 2; 421| 30| } 422| 0|#endif 423| | 424| 0| return 1; 425| 30|} _ZN5Botan12Camellia_12813hwaes_encryptEPKhPhmNSt3__14spanIKmLm18446744073709551615EEE: 315| 31| std::span SK) { 316| 155| while(blocks >= 2) { ------------------ | Branch (316:10): [True: 124, False: 31] ------------------ 317| 124| Camellia_HWAES::camellia_encrypt_x2_18r(in, out, SK); 318| 124| in += 2 * 16; 319| 124| out += 2 * 16; 320| 124| blocks -= 2; 321| 124| } 322| | 323| 31| if(blocks > 0) { ------------------ | Branch (323:7): [True: 0, False: 31] ------------------ 324| 0| uint8_t ibuf[2 * 16] = {0}; 325| 0| uint8_t obuf[2 * 16] = {0}; 326| 0| copy_mem(ibuf, in, 16); 327| 0| Camellia_HWAES::camellia_encrypt_x2_18r(ibuf, obuf, SK); 328| 0| copy_mem(out, obuf, 16); 329| 0| } 330| 31|} _ZN5Botan12Camellia_25613hwaes_encryptEPKhPhmNSt3__14spanIKmLm18446744073709551615EEE: 399| 31| std::span SK) { 400| 155| while(blocks >= 2) { ------------------ | Branch (400:10): [True: 124, False: 31] ------------------ 401| 124| Camellia_HWAES::camellia_encrypt_x2_24r(in, out, SK); 402| 124| in += 2 * 16; 403| 124| out += 2 * 16; 404| 124| blocks -= 2; 405| 124| } 406| | 407| 31| if(blocks > 0) { ------------------ | Branch (407:7): [True: 0, False: 31] ------------------ 408| 0| uint8_t ibuf[2 * 16] = {0}; 409| 0| uint8_t obuf[2 * 16] = {0}; 410| 0| copy_mem(ibuf, in, 16); 411| 0| Camellia_HWAES::camellia_encrypt_x2_24r(ibuf, obuf, SK); 412| 0| copy_mem(out, obuf, 16); 413| 0| } 414| 31|} camellia_hwaes.cpp:_ZN5Botan14Camellia_HWAES12_GLOBAL__N_123camellia_encrypt_x2_18rEPKhPhNSt3__14spanIKmLm18446744073709551615EEE: 213| 124|BOTAN_FN_ISA_HWAES void camellia_encrypt_x2_18r(const uint8_t in[], uint8_t out[], std::span SK) { 214| 124| SIMD_4x32 L; 215| 124| SIMD_4x32 R; 216| 124| load_and_deinterleave(in, L, R); 217| | 218| 124| L ^= splat64(SK[0]); 219| 124| R ^= splat64(SK[1]); 220| | 221| 124| six_e_rounds(L, R, &SK[2]); 222| 124| L = FL_2(L, SK[8]); 223| 124| R = FLINV_2(R, SK[9]); 224| 124| six_e_rounds(L, R, &SK[10]); 225| 124| L = FL_2(L, SK[16]); 226| 124| R = FLINV_2(R, SK[17]); 227| 124| six_e_rounds(L, R, &SK[18]); 228| | 229| 124| R ^= splat64(SK[24]); 230| 124| L ^= splat64(SK[25]); 231| | 232| 124| interleave_and_store(out, L, R); 233| 124|} camellia_hwaes.cpp:_ZN5Botan14Camellia_HWAES12_GLOBAL__N_121load_and_deinterleaveEPKhRNS_9SIMD_4x32ES5_: 178| 248|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES void load_and_deinterleave(const uint8_t in[], SIMD_4x32& L, SIMD_4x32& R) { 179| 248| const auto A = load_be64(in); // block 0: [L0, R0] 180| 248| const auto B = load_be64(in + 16); // block 1: [L1, R1] 181| 248| const auto mask_upper = SIMD_4x32(0x00000000, 0x00000000, 0xFFFFFFFF, 0xFFFFFFFF); 182| 248| L = SIMD_4x32::byte_blend(mask_upper, B.swap_halves(), A); // [L0, L1] 183| 248| R = SIMD_4x32::byte_blend(mask_upper, B, A.swap_halves()); // [R0, R1] 184| 248|} camellia_hwaes.cpp:_ZN5Botan14Camellia_HWAES12_GLOBAL__N_19load_be64EPKh: 20| 496|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 load_be64(const uint8_t* in) { 21| 496| const auto bswap64 = SIMD_4x32(0x04050607, 0x00010203, 0x0C0D0E0F, 0x08090A0B); 22| 496| return SIMD_4x32::byte_shuffle(SIMD_4x32::load_le(in), bswap64); 23| 496|} camellia_hwaes.cpp:_ZN5Botan14Camellia_HWAES12_GLOBAL__N_17splat64Em: 30| 6.20k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 splat64(uint64_t v) { 31| 6.20k| const uint32_t lo = static_cast(v); 32| 6.20k| const uint32_t hi = static_cast(v >> 32); 33| 6.20k| return SIMD_4x32(lo, hi, lo, hi); 34| 6.20k|} camellia_hwaes.cpp:_ZN5Botan14Camellia_HWAES12_GLOBAL__N_112six_e_roundsERNS_9SIMD_4x32ES3_PKm: 195| 868|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES void six_e_rounds(SIMD_4x32& L, SIMD_4x32& R, const uint64_t SK[]) { 196| 868| R ^= camellia_f(L ^ splat64(SK[0])); 197| 868| L ^= camellia_f(R ^ splat64(SK[1])); 198| 868| R ^= camellia_f(L ^ splat64(SK[2])); 199| 868| L ^= camellia_f(R ^ splat64(SK[3])); 200| 868| R ^= camellia_f(L ^ splat64(SK[4])); 201| 868| L ^= camellia_f(R ^ splat64(SK[5])); 202| 868|} camellia_hwaes.cpp:_ZN5Botan14Camellia_HWAES12_GLOBAL__N_110camellia_fENS_9SIMD_4x32E: 37| 5.20k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 camellia_f(SIMD_4x32 x) { 38| | // Pre-affine shared by S1/S2/S3 39| 5.20k| constexpr uint64_t pre123_a = gfni_matrix(R"( 40| 5.20k| 1 1 1 0 1 1 0 1 41| 5.20k| 0 0 1 1 0 0 1 0 42| 5.20k| 1 1 0 1 0 0 0 0 43| 5.20k| 1 0 1 1 0 0 1 1 44| 5.20k| 0 0 0 0 1 1 0 0 45| 5.20k| 1 0 1 0 0 1 0 0 46| 5.20k| 0 0 1 0 1 1 0 0 47| 5.20k| 1 0 0 0 0 1 1 0)"); 48| | 49| | // Pre-affine for S4 50| 5.20k| constexpr uint64_t pre4_a = gfni_matrix(R"( 51| 5.20k| 1 1 0 1 1 0 1 1 52| 5.20k| 0 1 1 0 0 1 0 0 53| 5.20k| 1 0 1 0 0 0 0 1 54| 5.20k| 0 1 1 0 0 1 1 1 55| 5.20k| 0 0 0 1 1 0 0 0 56| 5.20k| 0 1 0 0 1 0 0 1 57| 5.20k| 0 1 0 1 1 0 0 0 58| 5.20k| 0 0 0 0 1 1 0 1)"); 59| | 60| 5.20k| constexpr uint8_t pre_c = 0x45; 61| | 62| | // Post-affine for S1 and S4 63| 5.20k| constexpr uint64_t post14_a = gfni_matrix(R"( 64| 5.20k| 0 0 0 0 0 0 0 1 65| 5.20k| 0 1 1 0 0 1 1 0 66| 5.20k| 1 0 1 1 1 1 1 0 67| 5.20k| 0 0 0 1 1 0 1 1 68| 5.20k| 1 0 0 0 1 1 1 0 69| 5.20k| 0 1 0 1 1 1 1 0 70| 5.20k| 0 1 1 1 1 1 1 1 71| 5.20k| 0 0 0 1 1 1 0 0)"); 72| 5.20k| constexpr uint8_t post14_c = 0x6E; 73| | 74| | // Post-affine for S2 75| 5.20k| constexpr uint64_t post2_a = gfni_matrix(R"( 76| 5.20k| 0 0 0 1 1 1 0 0 77| 5.20k| 0 0 0 0 0 0 0 1 78| 5.20k| 0 1 1 0 0 1 1 0 79| 5.20k| 1 0 1 1 1 1 1 0 80| 5.20k| 0 0 0 1 1 0 1 1 81| 5.20k| 1 0 0 0 1 1 1 0 82| 5.20k| 0 1 0 1 1 1 1 0 83| 5.20k| 0 1 1 1 1 1 1 1)"); 84| 5.20k| constexpr uint8_t post2_c = 0xDC; 85| | 86| | // Post-affine for S3 87| 5.20k| constexpr uint64_t post3_a = gfni_matrix(R"( 88| 5.20k| 0 1 1 0 0 1 1 0 89| 5.20k| 1 0 1 1 1 1 1 0 90| 5.20k| 0 0 0 1 1 0 1 1 91| 5.20k| 1 0 0 0 1 1 1 0 92| 5.20k| 0 1 0 1 1 1 1 0 93| 5.20k| 0 1 1 1 1 1 1 1 94| 5.20k| 0 0 0 1 1 1 0 0 95| 5.20k| 0 0 0 0 0 0 0 1)"); 96| 5.20k| constexpr uint8_t post3_c = 0x37; 97| | 98| 5.20k| constexpr auto PRE123 = Gf2AffineTransformation(pre123_a, pre_c); 99| 5.20k| constexpr auto PRE4 = Gf2AffineTransformation(pre4_a, pre_c); 100| 5.20k| constexpr auto POST14 = Gf2AffineTransformation::post_sbox(post14_a, post14_c); 101| 5.20k| constexpr auto POST2 = Gf2AffineTransformation::post_sbox(post2_a, post2_c); 102| 5.20k| constexpr auto POST3 = Gf2AffineTransformation::post_sbox(post3_a, post3_c); 103| | 104| 5.20k| const auto mask_s2 = SIMD_4x32(0xFF000000, 0x00FF0000, 0xFF000000, 0x00FF0000); 105| 5.20k| const auto mask_s3 = SIMD_4x32(0x00FF0000, 0x0000FF00, 0x00FF0000, 0x0000FF00); 106| 5.20k| const auto mask_s4 = SIMD_4x32(0x0000FF00, 0x000000FF, 0x0000FF00, 0x000000FF); 107| | 108| 5.20k| const auto pre123 = PRE123.affine_transform(x); 109| 5.20k| const auto pre4 = PRE4.affine_transform(x); 110| | 111| 5.20k| const auto sub = hw_aes_sbox(SIMD_4x32::byte_blend(mask_s4, pre4, pre123)); 112| | 113| 5.20k| const auto s14 = POST14.affine_transform(sub); 114| 5.20k| const auto s2 = POST2.affine_transform(sub); 115| 5.20k| const auto s3 = POST3.affine_transform(sub); 116| | 117| | // Final merged Sbox output for all bytes 118| 5.20k| const auto sbox = SIMD_4x32::byte_blend(mask_s3, s3, SIMD_4x32::byte_blend(mask_s2, s2, s14)); 119| | 120| | // The linear mixing step 121| 5.20k| const auto P1 = SIMD_4x32(0x00000001, 0x00000001, 0x08080809, 0x08080809); 122| 5.20k| const auto P2 = SIMD_4x32(0x01010202, 0x01010202, 0x09090A0A, 0x09090A0A); 123| 5.20k| const auto P3 = SIMD_4x32(0x02030303, 0x02030303, 0x0A0B0B0B, 0x0A0B0B0B); 124| 5.20k| const auto P4 = SIMD_4x32(0x06050404, 0x04040504, 0x0E0D0C0C, 0x0C0C0D0C); 125| 5.20k| const auto P5 = SIMD_4x32(0x07060507, 0x05060605, 0x0F0E0D0F, 0x0D0E0E0D); 126| 5.20k| const auto P6 = SIMD_4x32(0xFFFFFFFF, 0x07070706, 0xFFFFFFFF, 0x0F0F0F0E); 127| | 128| 5.20k| const auto sxp1 = SIMD_4x32::byte_shuffle(sbox, P1); 129| 5.20k| const auto sxp2 = SIMD_4x32::byte_shuffle(sbox, P2); 130| 5.20k| const auto sxp3 = SIMD_4x32::byte_shuffle(sbox, P3); 131| 5.20k| const auto sxp4 = SIMD_4x32::byte_shuffle(sbox, P4); 132| 5.20k| const auto sxp5 = SIMD_4x32::byte_shuffle(sbox, P5); 133| 5.20k| const auto sxp6 = SIMD_4x32::masked_byte_shuffle(sbox, P6); 134| | 135| 5.20k| return (sxp1 ^ sxp2 ^ sxp3 ^ sxp4 ^ sxp5 ^ sxp6); 136| 5.20k|} camellia_hwaes.cpp:_ZN5Botan14Camellia_HWAES12_GLOBAL__N_14FL_2ENS_9SIMD_4x32Em: 142| 620|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 FL_2(SIMD_4x32 v, uint64_t K) { 143| 620| const uint32_t k1 = static_cast(K >> 32); 144| 620| const uint32_t k2 = static_cast(K); 145| | 146| | // Broadcast upper/lower 32-bit halves of each 64-bit element 147| 620| const auto shuf_hi = SIMD_4x32(0x07060504, 0x07060504, 0x0F0E0D0C, 0x0F0E0D0C); 148| 620| const auto shuf_lo = SIMD_4x32(0x03020100, 0x03020100, 0x0B0A0908, 0x0B0A0908); 149| | 150| 620| auto x1 = SIMD_4x32::byte_shuffle(v, shuf_hi); 151| 620| auto x2 = SIMD_4x32::byte_shuffle(v, shuf_lo); 152| | 153| 620| x2 ^= (x1 & SIMD_4x32::splat(k1)).rotl<1>(); 154| 620| x1 ^= x2 | SIMD_4x32::splat(k2); 155| | 156| | // Recombine: lo from x2, hi from x1 157| 620| const auto mask_hi = SIMD_4x32(0x00000000, 0xFFFFFFFF, 0x00000000, 0xFFFFFFFF); 158| 620| return SIMD_4x32::byte_blend(mask_hi, x1, x2); 159| 620|} camellia_hwaes.cpp:_ZN5Botan14Camellia_HWAES12_GLOBAL__N_17FLINV_2ENS_9SIMD_4x32Em: 161| 620|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES SIMD_4x32 FLINV_2(SIMD_4x32 v, uint64_t K) { 162| 620| const uint32_t k1 = static_cast(K >> 32); 163| 620| const uint32_t k2 = static_cast(K); 164| | 165| 620| const auto shuf_hi = SIMD_4x32(0x07060504, 0x07060504, 0x0F0E0D0C, 0x0F0E0D0C); 166| 620| const auto shuf_lo = SIMD_4x32(0x03020100, 0x03020100, 0x0B0A0908, 0x0B0A0908); 167| | 168| 620| auto x1 = SIMD_4x32::byte_shuffle(v, shuf_hi); 169| 620| auto x2 = SIMD_4x32::byte_shuffle(v, shuf_lo); 170| | 171| 620| x1 ^= x2 | SIMD_4x32::splat(k2); 172| 620| x2 ^= (x1 & SIMD_4x32::splat(k1)).rotl<1>(); 173| | 174| 620| const auto mask_hi = SIMD_4x32(0x00000000, 0xFFFFFFFF, 0x00000000, 0xFFFFFFFF); 175| 620| return SIMD_4x32::byte_blend(mask_hi, x1, x2); 176| 620|} camellia_hwaes.cpp:_ZN5Botan14Camellia_HWAES12_GLOBAL__N_120interleave_and_storeEPhNS_9SIMD_4x32ES3_: 186| 248|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES void interleave_and_store(uint8_t out[], SIMD_4x32 L, SIMD_4x32 R) { 187| | // Camellia output swaps L and R 188| 248| const auto mask_upper = SIMD_4x32(0x00000000, 0x00000000, 0xFFFFFFFF, 0xFFFFFFFF); 189| 248| const auto A = SIMD_4x32::byte_blend(mask_upper, L.swap_halves(), R); // [R0, L0] 190| 248| const auto B = SIMD_4x32::byte_blend(mask_upper, L, R.swap_halves()); // [R1, L1] 191| 248| store_be64(out, A); 192| 248| store_be64(out + 16, B); 193| 248|} camellia_hwaes.cpp:_ZN5Botan14Camellia_HWAES12_GLOBAL__N_110store_be64EPhNS_9SIMD_4x32E: 25| 496|BOTAN_FORCE_INLINE BOTAN_FN_ISA_HWAES void store_be64(uint8_t* out, SIMD_4x32 v) { 26| 496| const auto bswap64 = SIMD_4x32(0x04050607, 0x00010203, 0x0C0D0E0F, 0x08090A0B); 27| 496| SIMD_4x32::byte_shuffle(v, bswap64).store_le(out); 28| 496|} camellia_hwaes.cpp:_ZN5Botan14Camellia_HWAES12_GLOBAL__N_123camellia_encrypt_x2_24rEPKhPhNSt3__14spanIKmLm18446744073709551615EEE: 257| 124|BOTAN_FN_ISA_HWAES void camellia_encrypt_x2_24r(const uint8_t in[], uint8_t out[], std::span SK) { 258| 124| SIMD_4x32 L; 259| 124| SIMD_4x32 R; 260| 124| load_and_deinterleave(in, L, R); 261| | 262| 124| L ^= splat64(SK[0]); 263| 124| R ^= splat64(SK[1]); 264| | 265| 124| six_e_rounds(L, R, &SK[2]); 266| 124| L = FL_2(L, SK[8]); 267| 124| R = FLINV_2(R, SK[9]); 268| 124| six_e_rounds(L, R, &SK[10]); 269| 124| L = FL_2(L, SK[16]); 270| 124| R = FLINV_2(R, SK[17]); 271| 124| six_e_rounds(L, R, &SK[18]); 272| 124| L = FL_2(L, SK[24]); 273| 124| R = FLINV_2(R, SK[25]); 274| 124| six_e_rounds(L, R, &SK[26]); 275| | 276| 124| R ^= splat64(SK[32]); 277| 124| L ^= splat64(SK[33]); 278| | 279| 124| interleave_and_store(out, L, R); 280| 124|} _ZNK5Botan9TripleDES9encrypt_nEPKhPhm: 769| 53|void TripleDES::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 770| 53| assert_key_material_set(); 771| | 772| 53| const uint32_t* k1 = m_round_key.data(); 773| 53| const uint32_t* k2 = k1 + 16 * 48; 774| 53| const uint32_t* k3 = k2 + 16 * 48; 775| | 776| 53| uint32_t B[64]; 777| | 778| 53| while(blocks >= 32) { ------------------ | Branch (778:10): [True: 0, False: 53] ------------------ 779| 0| transpose_in(B, in, 32); 780| 0| des_encrypt(&B[0], &B[32], k1); 781| 0| des_decrypt(&B[32], &B[0], k2); 782| 0| des_encrypt(&B[0], &B[32], k3); 783| 0| transpose_out(out, B, 32); 784| | 785| 0| in += 32 * BLOCK_SIZE; 786| 0| out += 32 * BLOCK_SIZE; 787| 0| blocks -= 32; 788| 0| } 789| | 790| 53| if(blocks > 0) { ------------------ | Branch (790:7): [True: 53, False: 0] ------------------ 791| 53| transpose_in(B, in, blocks); 792| 53| des_encrypt(&B[0], &B[32], k1); 793| 53| des_decrypt(&B[32], &B[0], k2); 794| 53| des_encrypt(&B[0], &B[32], k3); 795| 53| transpose_out(out, B, blocks); 796| 53| } 797| 53|} _ZNK5Botan9TripleDES9decrypt_nEPKhPhm: 802| 32|void TripleDES::decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 803| 32| assert_key_material_set(); 804| | 805| 32| const uint32_t* k1 = m_round_key.data(); 806| 32| const uint32_t* k2 = k1 + 16 * 48; 807| 32| const uint32_t* k3 = k2 + 16 * 48; 808| | 809| 32| uint32_t B[64]; 810| | 811| 98| while(blocks >= 32) { ------------------ | Branch (811:10): [True: 66, False: 32] ------------------ 812| 66| transpose_in(B, in, 32); 813| 66| des_decrypt(&B[0], &B[32], k3); 814| 66| des_encrypt(&B[32], &B[0], k2); 815| 66| des_decrypt(&B[0], &B[32], k1); 816| 66| transpose_out(out, B, 32); 817| | 818| 66| in += 32 * BLOCK_SIZE; 819| 66| out += 32 * BLOCK_SIZE; 820| 66| blocks -= 32; 821| 66| } 822| | 823| 32| if(blocks > 0) { ------------------ | Branch (823:7): [True: 19, False: 13] ------------------ 824| 19| transpose_in(B, in, blocks); 825| 19| des_decrypt(&B[0], &B[32], k3); 826| 19| des_encrypt(&B[32], &B[0], k2); 827| 19| des_decrypt(&B[0], &B[32], k1); 828| 19| transpose_out(out, B, blocks); 829| 19| } 830| 32|} _ZNK5Botan9TripleDES19has_keying_materialEv: 832| 85|bool TripleDES::has_keying_material() const { 833| 85| return !m_round_key.empty(); 834| 85|} _ZN5Botan9TripleDES12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 839| 45|void TripleDES::key_schedule(std::span key) { 840| 45| m_round_key.resize(3 * 16 * 48); 841| 45| des_key_schedule(m_round_key.data(), key.first(8).data()); 842| 45| des_key_schedule(m_round_key.data() + 16 * 48, key.subspan(8, 8).data()); 843| | 844| 45| if(key.size() == 24) { ------------------ | Branch (844:7): [True: 45, False: 0] ------------------ 845| 45| des_key_schedule(m_round_key.data() + 2 * 16 * 48, key.last(8).data()); 846| 45| } else { 847| 0| copy_mem(m_round_key.data() + 2 * 16 * 48, m_round_key.data(), 16 * 48); 848| 0| } 849| 45|} des.cpp:_ZN5Botan12_GLOBAL__N_112transpose_inEPjPKhm: 537| 138|void transpose_in(uint32_t B[64], const uint8_t in[], size_t n_blocks) { 538| 138| uint64_t M[32] = {}; 539| | 540| 138| load_be(M, in, n_blocks); 541| | 542| 138| des_transpose(M); 543| | 544| | // clang-format off 545| 138| static constexpr uint8_t IP[64] = { 546| 138| 57, 49, 41, 33, 25, 17, 9, 1, 547| 138| 59, 51, 43, 35, 27, 19, 11, 3, 548| 138| 61, 53, 45, 37, 29, 21, 13, 5, 549| 138| 63, 55, 47, 39, 31, 23, 15, 7, 550| 138| 56, 48, 40, 32, 24, 16, 8, 0, 551| 138| 58, 50, 42, 34, 26, 18, 10, 2, 552| 138| 60, 52, 44, 36, 28, 20, 12, 4, 553| 138| 62, 54, 46, 38, 30, 22, 14, 6 554| 138| }; 555| | // clang-format on 556| | 557| 8.97k| for(size_t i = 0; i < 64; ++i) { ------------------ | Branch (557:22): [True: 8.83k, False: 138] ------------------ 558| 8.83k| const uint8_t src = IP[i]; 559| 8.83k| if(src < 32) { ------------------ | Branch (559:10): [True: 4.41k, False: 4.41k] ------------------ 560| 4.41k| B[i] = static_cast(M[31 - src] >> 32); 561| 4.41k| } else { 562| 4.41k| B[i] = static_cast(M[63 - src]); 563| 4.41k| } 564| 8.83k| } 565| 138|} des.cpp:_ZN5Botan12_GLOBAL__N_113des_transposeEPm: 509| 276|void des_transpose(uint64_t M[32]) { 510| 4.69k| for(size_t i = 0; i != 16; ++i) { ------------------ | Branch (510:22): [True: 4.41k, False: 276] ------------------ 511| 4.41k| swap_bits(M[i], M[i + 16], 0x0000FFFF0000FFFF, 16); 512| 4.41k| } 513| | 514| 828| for(size_t i = 0; i != 32; i += 16) { ------------------ | Branch (514:22): [True: 552, False: 276] ------------------ 515| 4.96k| for(size_t j = 0; j != 8; ++j) { ------------------ | Branch (515:25): [True: 4.41k, False: 552] ------------------ 516| 4.41k| swap_bits(M[i + j], M[i + j + 8], 0x00FF00FF00FF00FF, 8); 517| 4.41k| } 518| 552| } 519| | 520| 1.38k| for(size_t i = 0; i != 32; i += 8) { ------------------ | Branch (520:22): [True: 1.10k, False: 276] ------------------ 521| 5.52k| for(size_t j = 0; j != 4; ++j) { ------------------ | Branch (521:25): [True: 4.41k, False: 1.10k] ------------------ 522| 4.41k| swap_bits(M[i + j + 0], M[i + j + 4], 0x0F0F0F0F0F0F0F0F, 4); 523| 4.41k| } 524| 1.10k| } 525| | 526| 2.48k| for(size_t i = 0; i != 32; i += 4) { ------------------ | Branch (526:22): [True: 2.20k, False: 276] ------------------ 527| 6.62k| for(size_t j = 0; j != 2; ++j) { ------------------ | Branch (527:25): [True: 4.41k, False: 2.20k] ------------------ 528| 4.41k| swap_bits(M[i + j + 0], M[i + j + 2], 0x3333333333333333, 2); 529| 4.41k| } 530| 2.20k| } 531| | 532| 4.69k| for(size_t i = 0; i != 32; i += 2) { ------------------ | Branch (532:22): [True: 4.41k, False: 276] ------------------ 533| 4.41k| swap_bits(M[i], M[i + 1], 0x5555555555555555, 1); 534| 4.41k| } 535| 276|} des.cpp:_ZN5Botan12_GLOBAL__N_111des_encryptEPjS1_PKj: 638| 191|void des_encrypt(uint32_t L[32], uint32_t R[32], const uint32_t round_key[]) { 639| 1.71k| for(size_t round = 0; round < 16; round += 2) { ------------------ | Branch (639:26): [True: 1.52k, False: 191] ------------------ 640| 1.52k| des_round(L, R, &round_key[round * 48]); 641| 1.52k| des_round(R, L, &round_key[(round + 1) * 48]); 642| 1.52k| } 643| 191|} des.cpp:_ZN5Botan12_GLOBAL__N_19des_roundEPjPKjS3_: 602| 6.62k|void des_round(uint32_t L[32], const uint32_t R[32], const uint32_t RK[48]) { 603| | // clang-format off 604| 6.62k| SBox1(R[31] ^ RK[ 0], R[ 0] ^ RK[ 1], R[ 1] ^ RK[ 2], 605| 6.62k| R[ 2] ^ RK[ 3], R[ 3] ^ RK[ 4], R[ 4] ^ RK[ 5], 606| 6.62k| L[ 8], L[16], L[22], L[30]); 607| | 608| 6.62k| SBox2(R[ 3] ^ RK[ 6], R[ 4] ^ RK[ 7], R[ 5] ^ RK[ 8], 609| 6.62k| R[ 6] ^ RK[ 9], R[ 7] ^ RK[10], R[ 8] ^ RK[11], 610| 6.62k| L[12], L[27], L[ 1], L[17]); 611| | 612| 6.62k| SBox3(R[ 7] ^ RK[12], R[ 8] ^ RK[13], R[ 9] ^ RK[14], 613| 6.62k| R[10] ^ RK[15], R[11] ^ RK[16], R[12] ^ RK[17], 614| 6.62k| L[23], L[15], L[29], L[ 5]); 615| | 616| 6.62k| SBox4(R[11] ^ RK[18], R[12] ^ RK[19], R[13] ^ RK[20], 617| 6.62k| R[14] ^ RK[21], R[15] ^ RK[22], R[16] ^ RK[23], 618| 6.62k| L[25], L[19], L[ 9], L[ 0]); 619| | 620| 6.62k| SBox5(R[15] ^ RK[24], R[16] ^ RK[25], R[17] ^ RK[26], 621| 6.62k| R[18] ^ RK[27], R[19] ^ RK[28], R[20] ^ RK[29], 622| 6.62k| L[ 7], L[13], L[24], L[ 2]); 623| | 624| 6.62k| SBox6(R[19] ^ RK[30], R[20] ^ RK[31], R[21] ^ RK[32], 625| 6.62k| R[22] ^ RK[33], R[23] ^ RK[34], R[24] ^ RK[35], 626| 6.62k| L[ 3], L[28], L[10], L[18]); 627| | 628| 6.62k| SBox7(R[23] ^ RK[36], R[24] ^ RK[37], R[25] ^ RK[38], 629| 6.62k| R[26] ^ RK[39], R[27] ^ RK[40], R[28] ^ RK[41], 630| 6.62k| L[31], L[11], L[21], L[ 6]); 631| | 632| 6.62k| SBox8(R[27] ^ RK[42], R[28] ^ RK[43], R[29] ^ RK[44], 633| 6.62k| R[30] ^ RK[45], R[31] ^ RK[46], R[ 0] ^ RK[47], 634| 6.62k| L[ 4], L[26], L[14], L[20]); 635| | // clang-format on 636| 6.62k|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox1ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 38| 6.62k|BOTAN_FORCE_INLINE void SBox1(T a1, T a2, T a3, T a4, T a5, T a6, T& out1, T& out2, T& out3, T& out4) { 39| 6.62k| const T x1 = a1 & ~a5; 40| 6.62k| const T x2 = a4 ^ x1; 41| 6.62k| const T x3 = a3 | a6; 42| 6.62k| const T x4 = a1 ^ a3; 43| 6.62k| const T x5 = x3 & x4; 44| 6.62k| const T x6 = a4 ^ x5; 45| 6.62k| const T x7 = x6 & ~x2; 46| | 47| 6.62k| const T x8 = a5 ^ a6; 48| 6.62k| const T x9 = a3 ^ x8; 49| 6.62k| const T x10 = x2 & ~x9; 50| 6.62k| const T x11 = a6 | x5; 51| 6.62k| const T x12 = x10 ^ x11; 52| 6.62k| const T x13 = x12 & ~x7; 53| | 54| 6.62k| const T x14 = a1 | a6; 55| 6.62k| const T x15 = x12 | x14; 56| 6.62k| const T x16 = a5 & ~x6; 57| 6.62k| const T x17 = x15 ^ x16; 58| | 59| 6.62k| const T x18 = a4 & ~x14; 60| 6.62k| const T x19 = x16 ^ x18; 61| 6.62k| const T x20 = x8 & ~x4; 62| 6.62k| const T x21 = x19 | x20; 63| | 64| 6.62k| const T x22 = a3 & ~x1; 65| 6.62k| const T x23 = x2 ^ x15; 66| 6.62k| const T x24 = x23 & ~x22; 67| 6.62k| const T x25 = ~x24; 68| 6.62k| const T x26 = x3 & x12; 69| 6.62k| const T x27 = x25 ^ x26; 70| 6.62k| const T x28 = x17 & ~a2; 71| 6.62k| const T x29 = x28 ^ x27; 72| 6.62k| out3 ^= x29; 73| | 74| 6.62k| const T x30 = x8 ^ x24; 75| 6.62k| const T x31 = x16 | x30; 76| 6.62k| const T x32 = x3 ^ x31; 77| 6.62k| const T x33 = a1 ^ x32; 78| 6.62k| const T x34 = x27 ^ x33; 79| 6.62k| const T x35 = x7 | a2; 80| 6.62k| const T x36 = x35 ^ x34; 81| 6.62k| out1 ^= x36; 82| | 83| 6.62k| const T x37 = x2 & ~x21; 84| 6.62k| const T x38 = x30 ^ x37; 85| 6.62k| const T x39 = x16 ^ x32; 86| 6.62k| const T x40 = x34 & ~x39; 87| 6.62k| const T x41 = x38 ^ x40; 88| 6.62k| const T x42 = a2 & ~x13; 89| 6.62k| const T x43 = x42 ^ x41; 90| 6.62k| out2 ^= x43; 91| | 92| 6.62k| const T x44 = x9 ^ x20; 93| 6.62k| const T x45 = x14 ^ x40; 94| 6.62k| const T x46 = x45 & ~x44; 95| 6.62k| const T x47 = x41 ^ x46; 96| 6.62k| const T x48 = x47 | a2; 97| 6.62k| const T x49 = x48 ^ x21; 98| 6.62k| out4 ^= x49; 99| 6.62k|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox2ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 102| 6.62k|BOTAN_FORCE_INLINE void SBox2(T a1, T a2, T a3, T a4, T a5, T a6, T& out1, T& out2, T& out3, T& out4) { 103| 6.62k| const T x1 = a2 ^ a5; 104| | 105| 6.62k| const T x2 = a1 & ~a6; 106| 6.62k| const T x3 = a5 & ~x2; 107| 6.62k| const T x4 = a2 | x3; 108| | 109| 6.62k| const T x5 = x1 & ~a6; 110| 6.62k| const T x6 = a1 & x1; 111| 6.62k| const T x7 = a5 ^ x6; 112| 6.62k| const T x8 = x7 & ~x5; 113| | 114| 6.62k| const T x9 = a3 & a6; 115| 6.62k| const T x10 = x3 ^ x5; 116| 6.62k| const T x11 = x4 & x10; 117| 6.62k| const T x12 = x11 & ~x9; 118| | 119| 6.62k| const T x13 = a3 & x11; 120| 6.62k| const T x14 = ~a1; 121| 6.62k| const T x15 = x13 ^ x14; 122| 6.62k| const T x16 = a6 ^ x1; 123| 6.62k| const T x17 = x16 & ~x9; 124| 6.62k| const T x18 = x15 ^ x17; 125| 6.62k| const T x19 = a4 & ~x12; 126| 6.62k| const T x20 = x19 ^ x18; 127| 6.62k| out2 ^= x20; 128| | 129| 6.62k| const T x21 = a2 & ~x17; 130| 6.62k| const T x22 = x7 ^ x21; 131| 6.62k| const T x23 = x15 & ~x22; 132| 6.62k| const T x24 = a3 ^ x16; 133| 6.62k| const T x25 = x23 ^ x24; 134| 6.62k| const T x26 = x4 & ~a4; 135| 6.62k| const T x27 = x26 ^ x25; 136| 6.62k| out1 ^= x27; 137| | 138| 6.62k| const T x28 = a2 & ~x9; 139| 6.62k| const T x29 = x24 | x28; 140| 6.62k| const T x30 = x4 ^ x18; 141| 6.62k| const T x31 = x9 | x30; 142| 6.62k| const T x32 = x29 ^ x31; 143| | 144| 6.62k| const T x33 = x11 ^ x18; 145| 6.62k| const T x34 = x25 ^ x33; 146| 6.62k| const T x35 = x31 & x34; 147| 6.62k| const T x36 = x1 & x29; 148| 6.62k| const T x37 = x35 ^ x36; 149| 6.62k| const T x38 = x37 | a4; 150| 6.62k| const T x39 = x38 ^ x32; 151| 6.62k| out3 ^= x39; 152| | 153| 6.62k| const T x40 = x37 & ~x22; 154| 6.62k| const T x41 = x16 | x30; 155| 6.62k| const T x42 = x40 ^ x41; 156| 6.62k| const T x43 = x8 | a4; 157| 6.62k| const T x44 = x43 ^ x42; 158| 6.62k| out4 ^= x44; 159| 6.62k|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox3ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 162| 6.62k|BOTAN_FORCE_INLINE void SBox3(T a1, T a2, T a3, T a4, T a5, T a6, T& out1, T& out2, T& out3, T& out4) { 163| 6.62k| const T x1 = a1 & ~a2; 164| 6.62k| const T x2 = a3 ^ a6; 165| 6.62k| const T x3 = x1 | x2; 166| 6.62k| const T x4 = a4 ^ a6; 167| 6.62k| const T x5 = x4 & ~a1; 168| 6.62k| const T x6 = x3 ^ x5; 169| | 170| 6.62k| const T x7 = a2 ^ x2; 171| 6.62k| const T x8 = x7 & ~a6; 172| 6.62k| const T x9 = x3 ^ x8; 173| 6.62k| const T x10 = x6 & ~x9; 174| | 175| 6.62k| const T x11 = a6 & x6; 176| 6.62k| const T x12 = a4 | x11; 177| 6.62k| const T x13 = a1 & x12; 178| 6.62k| const T x14 = x7 ^ x13; 179| 6.62k| const T x15 = x6 & ~a5; 180| 6.62k| const T x16 = x15 ^ x14; 181| 6.62k| out4 ^= x16; 182| | 183| 6.62k| const T x17 = x2 & x4; 184| 6.62k| const T x18 = a1 ^ a4; 185| 6.62k| const T x19 = x9 ^ x18; 186| 6.62k| const T x20 = a3 | x19; 187| 6.62k| const T x21 = x20 & ~x17; 188| | 189| 6.62k| const T x22 = x5 | x18; 190| 6.62k| const T x23 = x14 & ~x22; 191| 6.62k| const T x24 = a4 & a6; 192| 6.62k| const T x25 = x24 & ~a2; 193| 6.62k| const T x26 = x23 ^ x25; 194| | 195| 6.62k| const T x27 = x9 & x26; 196| 6.62k| const T x28 = x7 | x24; 197| 6.62k| const T x29 = x28 & ~x27; 198| 6.62k| const T x30 = a1 ^ x29; 199| 6.62k| const T x31 = x21 & a5; 200| 6.62k| const T x32 = x31 ^ x30; 201| 6.62k| out2 ^= x32; 202| | 203| 6.62k| const T x33 = x6 & ~a2; 204| 6.62k| const T x34 = x33 & ~a3; 205| 6.62k| const T x35 = ~x7; 206| 6.62k| const T x36 = x22 ^ x35; 207| 6.62k| const T x37 = x34 ^ x36; 208| 6.62k| const T x38 = a5 & ~x10; 209| 6.62k| const T x39 = x38 ^ x37; 210| 6.62k| out1 ^= x39; 211| | 212| 6.62k| const T x40 = x34 | x36; 213| 6.62k| const T x41 = x5 | x33; 214| 6.62k| const T x42 = x40 ^ x41; 215| 6.62k| const T x43 = a4 & ~x6; 216| 6.62k| const T x44 = x42 | x43; 217| 6.62k| const T x45 = a5 & ~x26; 218| 6.62k| const T x46 = x45 ^ x44; 219| 6.62k| out3 ^= x46; 220| 6.62k|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox4ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 223| 6.62k|BOTAN_FORCE_INLINE void SBox4(T a1, T a2, T a3, T a4, T a5, T a6, T& out1, T& out2, T& out3, T& out4) { 224| 6.62k| const T x1 = a1 ^ a3; 225| 6.62k| const T x2 = a3 ^ a5; 226| 6.62k| const T x3 = a2 | a4; 227| 6.62k| const T x4 = a5 ^ x3; 228| 6.62k| const T x5 = x2 & ~x4; 229| 6.62k| const T x6 = x2 & ~a2; 230| 6.62k| const T x7 = a4 ^ x6; 231| 6.62k| const T x8 = x1 | x7; 232| 6.62k| const T x9 = x8 & ~x5; 233| 6.62k| const T x10 = a2 ^ x9; 234| | 235| 6.62k| const T x11 = x7 & x10; 236| 6.62k| const T x12 = x2 & ~x11; 237| 6.62k| const T x13 = x1 ^ x10; 238| 6.62k| const T x14 = x13 & ~x12; 239| 6.62k| const T x15 = x5 ^ x14; 240| | 241| 6.62k| const T x16 = a2 ^ a4; 242| 6.62k| const T x17 = a5 | x6; 243| 6.62k| const T x18 = x13 ^ x17; 244| 6.62k| const T x19 = x18 & ~x16; 245| 6.62k| const T x20 = x9 ^ x19; 246| 6.62k| const T x21 = a6 & ~x15; 247| 6.62k| const T x22 = x21 ^ x20; 248| 6.62k| out1 ^= x22; 249| | 250| 6.62k| const T x23 = ~x20; 251| 6.62k| const T x24 = x15 & ~a6; 252| 6.62k| const T x25 = x24 ^ x23; 253| 6.62k| out2 ^= x25; 254| | 255| 6.62k| const T x26 = x15 ^ x23; 256| 6.62k| const T x27 = x26 & ~x16; 257| 6.62k| const T x28 = x11 | x27; 258| 6.62k| const T x29 = x18 ^ x28; 259| 6.62k| const T x30 = x10 | a6; 260| 6.62k| const T x31 = x30 ^ x29; 261| 6.62k| out3 ^= x31; 262| | 263| 6.62k| const T x32 = a6 & x10; 264| 6.62k| const T x33 = x32 ^ x29; 265| 6.62k| out4 ^= x33; 266| 6.62k|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox5ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 269| 6.62k|BOTAN_FORCE_INLINE void SBox5(T a1, T a2, T a3, T a4, T a5, T a6, T& out1, T& out2, T& out3, T& out4) { 270| 6.62k| const T x1 = a1 | a3; 271| 6.62k| const T x2 = x1 & ~a6; 272| 6.62k| const T x3 = a1 ^ x2; 273| 6.62k| const T x4 = a3 ^ x3; 274| 6.62k| const T x5 = a4 | x4; 275| | 276| 6.62k| const T x6 = x2 & ~a4; 277| 6.62k| const T x7 = a3 ^ x6; 278| 6.62k| const T x8 = a5 & x7; 279| 6.62k| const T x9 = a1 | x4; 280| 6.62k| const T x10 = x8 ^ x9; 281| 6.62k| const T x11 = a4 ^ x10; 282| | 283| 6.62k| const T x12 = a6 ^ x11; 284| 6.62k| const T x13 = x3 | x12; 285| 6.62k| const T x14 = a5 & x13; 286| 6.62k| const T x15 = x3 ^ x14; 287| 6.62k| const T x16 = a4 & x9; 288| 6.62k| const T x17 = x15 ^ x16; 289| | 290| 6.62k| const T x18 = x13 & ~a1; 291| 6.62k| const T x19 = x7 ^ x18; 292| 6.62k| const T x20 = a5 ^ x5; 293| 6.62k| const T x21 = x20 & ~x19; 294| 6.62k| const T x22 = ~x21; 295| 6.62k| const T x23 = x22 & ~a2; 296| 6.62k| const T x24 = x23 ^ x11; 297| 6.62k| out3 ^= x24; 298| | 299| 6.62k| const T x25 = x7 & ~x14; 300| 6.62k| const T x26 = x18 ^ x20; 301| 6.62k| const T x27 = x17 | x26; 302| 6.62k| const T x28 = x27 & ~x25; 303| 6.62k| const T x29 = x5 & ~x28; 304| | 305| 6.62k| const T x30 = x12 & x28; 306| 6.62k| const T x31 = x20 ^ x30; 307| 6.62k| const T x32 = x7 & x9; 308| 6.62k| const T x33 = x31 | x32; 309| 6.62k| const T x34 = x14 ^ x33; 310| 6.62k| const T x35 = x34 & a2; 311| 6.62k| const T x36 = x35 ^ x17; 312| 6.62k| out4 ^= x36; 313| | 314| 6.62k| const T x37 = x1 ^ x28; 315| 6.62k| const T x38 = a1 ^ x37; 316| 6.62k| const T x39 = a4 & x31; 317| 6.62k| const T x40 = x38 ^ x39; 318| 6.62k| const T x41 = x29 | a2; 319| 6.62k| const T x42 = x41 ^ x40; 320| 6.62k| out1 ^= x42; 321| | 322| 6.62k| const T x43 = x5 ^ x7; 323| 6.62k| const T x44 = x43 & ~x40; 324| 6.62k| const T x45 = x3 ^ x31; 325| 6.62k| const T x46 = x44 ^ x45; 326| 6.62k| const T x47 = x5 & a2; 327| 6.62k| const T x48 = x47 ^ x46; 328| 6.62k| out2 ^= x48; 329| 6.62k|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox6ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 332| 6.62k|BOTAN_FORCE_INLINE void SBox6(T a1, T a2, T a3, T a4, T a5, T a6, T& out1, T& out2, T& out3, T& out4) { 333| 6.62k| const T x1 = a2 ^ a5; 334| | 335| 6.62k| const T x2 = a2 | a6; 336| 6.62k| const T x3 = a1 & x2; 337| 6.62k| const T x4 = x1 ^ x3; 338| 6.62k| const T x5 = a6 ^ x4; 339| 6.62k| const T x6 = a5 & ~x5; 340| | 341| 6.62k| const T x7 = a1 & x5; 342| 6.62k| const T x8 = a2 ^ x7; 343| 6.62k| const T x9 = a1 ^ a3; 344| 6.62k| const T x10 = x8 | x9; 345| 6.62k| const T x11 = x4 ^ x10; 346| | 347| 6.62k| const T x12 = a3 & x11; 348| 6.62k| const T x13 = x12 & ~a6; 349| 6.62k| const T x14 = x6 | x8; 350| 6.62k| const T x15 = x13 ^ x14; 351| 6.62k| const T x16 = x15 & a4; 352| 6.62k| const T x17 = x16 ^ x11; 353| 6.62k| out4 ^= x17; 354| | 355| 6.62k| const T x18 = a2 ^ x10; 356| 6.62k| const T x19 = a6 & ~x18; 357| 6.62k| const T x20 = a3 ^ x19; 358| 6.62k| const T x21 = a5 & ~x12; 359| 6.62k| const T x22 = x20 | x21; 360| | 361| 6.62k| const T x23 = a2 | x9; 362| 6.62k| const T x24 = x15 ^ x23; 363| 6.62k| const T x25 = x3 | x22; 364| 6.62k| const T x26 = x24 ^ x25; 365| | 366| 6.62k| const T x27 = a1 | x11; 367| 6.62k| const T x28 = x14 & x27; 368| 6.62k| const T x29 = x20 ^ x28; 369| 6.62k| const T x30 = x29 & ~x13; 370| 6.62k| const T x31 = x6 | a4; 371| 6.62k| const T x32 = x31 ^ x30; 372| 6.62k| out3 ^= x32; 373| | 374| 6.62k| const T x33 = x4 ^ x29; 375| 6.62k| const T x34 = a5 & ~x33; 376| 6.62k| const T x35 = ~x23; 377| 6.62k| const T x36 = x18 ^ x35; 378| 6.62k| const T x37 = x34 ^ x36; 379| 6.62k| const T x38 = x37 & ~a4; 380| 6.62k| const T x39 = x38 ^ x26; 381| 6.62k| out2 ^= x39; 382| | 383| 6.62k| const T x40 = a6 ^ x7; 384| 6.62k| const T x41 = a1 ^ x20; 385| 6.62k| const T x42 = x40 & x41; 386| 6.62k| const T x43 = x12 ^ x36; 387| 6.62k| const T x44 = x42 ^ x43; 388| 6.62k| const T x45 = x22 & ~a4; 389| 6.62k| const T x46 = x45 ^ x44; 390| 6.62k| out1 ^= x46; 391| 6.62k|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox7ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 394| 6.62k|BOTAN_FORCE_INLINE void SBox7(T a1, T a2, T a3, T a4, T a5, T a6, T& out1, T& out2, T& out3, T& out4) { 395| 6.62k| const T x1 = a4 ^ a5; 396| 6.62k| const T x2 = a3 ^ x1; 397| 6.62k| const T x3 = a6 & x2; 398| 6.62k| const T x4 = a4 & x1; 399| 6.62k| const T x5 = a2 ^ x4; 400| 6.62k| const T x6 = x3 & x5; 401| | 402| 6.62k| const T x7 = a6 & x4; 403| 6.62k| const T x8 = a3 ^ x7; 404| 6.62k| const T x9 = x5 | x8; 405| 6.62k| const T x10 = a6 ^ x1; 406| 6.62k| const T x11 = x9 ^ x10; 407| 6.62k| const T x12 = a1 & ~x6; 408| 6.62k| const T x13 = x12 ^ x11; 409| 6.62k| out4 ^= x13; 410| | 411| 6.62k| const T x14 = a5 & ~x2; 412| 6.62k| const T x15 = x5 | x14; 413| 6.62k| const T x16 = x3 ^ x8; 414| 6.62k| const T x17 = x15 ^ x16; 415| | 416| 6.62k| const T x18 = x3 ^ x10; 417| 6.62k| const T x19 = a4 & ~x18; 418| 6.62k| const T x20 = x5 & ~x19; 419| 6.62k| const T x21 = a5 ^ x16; 420| 6.62k| const T x22 = x20 ^ x21; 421| | 422| 6.62k| const T x23 = x18 & ~x7; 423| 6.62k| const T x24 = x19 | x23; 424| 6.62k| const T x25 = a2 ^ x9; 425| 6.62k| const T x26 = x22 & x25; 426| 6.62k| const T x27 = x24 ^ x26; 427| 6.62k| const T x28 = x27 & a1; 428| 6.62k| const T x29 = x28 ^ x22; 429| 6.62k| out3 ^= x29; 430| | 431| 6.62k| const T x30 = x5 & ~a3; 432| 6.62k| const T x31 = x23 | x30; 433| 6.62k| const T x32 = x4 | x22; 434| 6.62k| const T x33 = x31 & x32; 435| 6.62k| const T x34 = x27 ^ x33; 436| | 437| 6.62k| const T x35 = x17 | x24; 438| 6.62k| const T x36 = x14 ^ x35; 439| 6.62k| const T x37 = a6 & x36; 440| 6.62k| const T x38 = x33 ^ x37; 441| 6.62k| const T x39 = x38 & ~a1; 442| 6.62k| const T x40 = x39 ^ x17; 443| 6.62k| out1 ^= x40; 444| | 445| 6.62k| const T x41 = ~x37; 446| 6.62k| const T x42 = a2 | x41; 447| 6.62k| const T x43 = x17 ^ x33; 448| 6.62k| const T x44 = x42 ^ x43; 449| 6.62k| const T x45 = x34 | a1; 450| 6.62k| const T x46 = x45 ^ x44; 451| 6.62k| out2 ^= x46; 452| 6.62k|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox8ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 455| 6.62k|BOTAN_FORCE_INLINE void SBox8(T a1, T a2, T a3, T a4, T a5, T a6, T& out1, T& out2, T& out3, T& out4) { 456| 6.62k| const T x1 = a3 & ~a2; 457| 6.62k| const T x2 = a5 & ~a3; 458| 6.62k| const T x3 = a4 ^ x2; 459| 6.62k| const T x4 = a1 & x3; 460| 6.62k| const T x5 = x4 & ~x1; 461| | 462| 6.62k| const T x6 = a2 & ~x3; 463| 6.62k| const T x7 = a1 | x6; 464| 6.62k| const T x8 = a2 & ~a3; 465| 6.62k| const T x9 = a5 ^ x8; 466| 6.62k| const T x10 = x7 & x9; 467| 6.62k| const T x11 = x4 | x10; 468| | 469| 6.62k| const T x12 = ~x3; 470| 6.62k| const T x13 = x10 ^ x12; 471| 6.62k| const T x14 = a3 & ~x7; 472| 6.62k| const T x15 = x13 ^ x14; 473| 6.62k| const T x16 = x1 ^ x15; 474| 6.62k| const T x17 = x5 | a6; 475| 6.62k| const T x18 = x17 ^ x16; 476| 6.62k| out2 ^= x18; 477| | 478| 6.62k| const T x19 = a1 ^ x16; 479| 6.62k| const T x20 = a5 & x19; 480| 6.62k| const T x21 = a2 ^ x15; 481| 6.62k| const T x22 = x20 ^ x21; 482| 6.62k| const T x23 = x6 ^ x22; 483| | 484| 6.62k| const T x24 = x11 ^ x22; 485| 6.62k| const T x25 = a2 | x24; 486| 6.62k| const T x26 = a5 ^ x19; 487| 6.62k| const T x27 = x25 ^ x26; 488| 6.62k| const T x28 = x11 & a6; 489| 6.62k| const T x29 = x28 ^ x27; 490| 6.62k| out3 ^= x29; 491| | 492| 6.62k| const T x30 = x9 ^ x23; 493| 6.62k| const T x31 = a4 | x21; 494| 6.62k| const T x32 = x30 ^ x31; 495| 6.62k| const T x33 = a1 ^ x32; 496| 6.62k| const T x34 = x33 & a6; 497| 6.62k| const T x35 = x34 ^ x23; 498| 6.62k| out4 ^= x35; 499| | 500| 6.62k| const T x36 = x30 & ~a4; 501| 6.62k| const T x37 = x27 & x36; 502| 6.62k| const T x38 = x5 ^ x32; 503| 6.62k| const T x39 = x37 ^ x38; 504| 6.62k| const T x40 = x39 | a6; 505| 6.62k| const T x41 = x40 ^ x23; 506| 6.62k| out1 ^= x41; 507| 6.62k|} des.cpp:_ZN5Botan12_GLOBAL__N_113transpose_outEPhPKjm: 567| 138|void transpose_out(uint8_t out[], const uint32_t B[64], size_t n_blocks) { 568| | // clang-format off 569| 138| static constexpr uint8_t FP[64] = { 570| 138| 39, 7, 47, 15, 55, 23, 63, 31, 571| 138| 38, 6, 46, 14, 54, 22, 62, 30, 572| 138| 37, 5, 45, 13, 53, 21, 61, 29, 573| 138| 36, 4, 44, 12, 52, 20, 60, 28, 574| 138| 35, 3, 43, 11, 51, 19, 59, 27, 575| 138| 34, 2, 42, 10, 50, 18, 58, 26, 576| 138| 33, 1, 41, 9, 49, 17, 57, 25, 577| 138| 32, 0, 40, 8, 48, 16, 56, 24 578| 138| }; 579| | // clang-format on 580| | 581| 138| uint64_t M[32]; 582| 4.55k| for(size_t i = 0; i != 32; ++i) { ------------------ | Branch (582:22): [True: 4.41k, False: 138] ------------------ 583| | // XOR with 32 here absorbs the DES output swap into the FP 584| 4.41k| M[i] = (static_cast(B[FP[31 - i] ^ 32]) << 32) | B[FP[63 - i] ^ 32]; 585| 4.41k| } 586| | 587| 138| des_transpose(M); 588| | 589| 2.64k| for(size_t i = 0; i != n_blocks; ++i) { ------------------ | Branch (589:22): [True: 2.51k, False: 138] ------------------ 590| 2.51k| store_be(out + i * 8, M[i]); 591| 2.51k| } 592| 138|} des.cpp:_ZN5Botan12_GLOBAL__N_111des_decryptEPjS1_PKj: 645| 223|void des_decrypt(uint32_t L[32], uint32_t R[32], const uint32_t round_key[]) { 646| 2.00k| for(size_t round = 16; round > 0; round -= 2) { ------------------ | Branch (646:27): [True: 1.78k, False: 223] ------------------ 647| 1.78k| des_round(L, R, &round_key[(round - 1) * 48]); 648| 1.78k| des_round(R, L, &round_key[(round - 2) * 48]); 649| 1.78k| } 650| 223|} des.cpp:_ZN5Botan12_GLOBAL__N_116des_key_scheduleEPjPKh: 656| 135|void des_key_schedule(uint32_t round_key[], const uint8_t key[8]) { 657| 135| static const uint8_t ROT[16] = {1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1}; 658| | 659| 135| uint32_t C = ((key[7] & 0x80) << 20) | ((key[6] & 0x80) << 19) | ((key[5] & 0x80) << 18) | ((key[4] & 0x80) << 17) | 660| 135| ((key[3] & 0x80) << 16) | ((key[2] & 0x80) << 15) | ((key[1] & 0x80) << 14) | ((key[0] & 0x80) << 13) | 661| 135| ((key[7] & 0x40) << 13) | ((key[6] & 0x40) << 12) | ((key[5] & 0x40) << 11) | ((key[4] & 0x40) << 10) | 662| 135| ((key[3] & 0x40) << 9) | ((key[2] & 0x40) << 8) | ((key[1] & 0x40) << 7) | ((key[0] & 0x40) << 6) | 663| 135| ((key[7] & 0x20) << 6) | ((key[6] & 0x20) << 5) | ((key[5] & 0x20) << 4) | ((key[4] & 0x20) << 3) | 664| 135| ((key[3] & 0x20) << 2) | ((key[2] & 0x20) << 1) | ((key[1] & 0x20)) | ((key[0] & 0x20) >> 1) | 665| 135| ((key[7] & 0x10) >> 1) | ((key[6] & 0x10) >> 2) | ((key[5] & 0x10) >> 3) | ((key[4] & 0x10) >> 4); 666| 135| uint32_t D = ((key[7] & 0x02) << 26) | ((key[6] & 0x02) << 25) | ((key[5] & 0x02) << 24) | ((key[4] & 0x02) << 23) | 667| 135| ((key[3] & 0x02) << 22) | ((key[2] & 0x02) << 21) | ((key[1] & 0x02) << 20) | ((key[0] & 0x02) << 19) | 668| 135| ((key[7] & 0x04) << 17) | ((key[6] & 0x04) << 16) | ((key[5] & 0x04) << 15) | ((key[4] & 0x04) << 14) | 669| 135| ((key[3] & 0x04) << 13) | ((key[2] & 0x04) << 12) | ((key[1] & 0x04) << 11) | ((key[0] & 0x04) << 10) | 670| 135| ((key[7] & 0x08) << 8) | ((key[6] & 0x08) << 7) | ((key[5] & 0x08) << 6) | ((key[4] & 0x08) << 5) | 671| 135| ((key[3] & 0x08) << 4) | ((key[2] & 0x08) << 3) | ((key[1] & 0x08) << 2) | ((key[0] & 0x08) << 1) | 672| 135| ((key[3] & 0x10) >> 1) | ((key[2] & 0x10) >> 2) | ((key[1] & 0x10) >> 3) | ((key[0] & 0x10) >> 4); 673| | 674| 135| static const uint8_t PC2_C[24] = {13, 16, 10, 23, 0, 4, 2, 27, 14, 5, 20, 9, 675| 135| 22, 18, 11, 3, 25, 7, 15, 6, 26, 19, 12, 1}; 676| | 677| 135| static const uint8_t PC2_D[24] = {12, 23, 2, 8, 18, 26, 1, 11, 22, 16, 4, 19, 678| 135| 15, 20, 10, 27, 5, 24, 17, 13, 21, 7, 0, 3}; 679| | 680| 2.29k| for(size_t i = 0; i != 16; ++i) { ------------------ | Branch (680:22): [True: 2.16k, False: 135] ------------------ 681| 2.16k| C = ((C << ROT[i]) | (C >> (28 - ROT[i]))) & 0x0FFFFFFF; 682| 2.16k| D = ((D << ROT[i]) | (D >> (28 - ROT[i]))) & 0x0FFFFFFF; 683| | 684| 2.16k| uint32_t* rk = &round_key[i * 48]; 685| | 686| 54.0k| for(size_t j = 0; j < 24; ++j) { ------------------ | Branch (686:25): [True: 51.8k, False: 2.16k] ------------------ 687| 51.8k| const uint32_t bit = (C >> (27 - PC2_C[j])) & 1; 688| 51.8k| rk[j] = static_cast(0) - bit; 689| 51.8k| } 690| | 691| 54.0k| for(size_t j = 0; j < 24; ++j) { ------------------ | Branch (691:25): [True: 51.8k, False: 2.16k] ------------------ 692| 51.8k| const uint32_t bit = (D >> (27 - PC2_D[j])) & 1; 693| 51.8k| rk[24 + j] = static_cast(0) - bit; 694| 51.8k| } 695| 2.16k| } 696| 135|} _ZN5Botan13base64_decodeEPhPKcmb: 208| 12.5k|size_t base64_decode(uint8_t output[], const char input[], size_t input_length, bool ignore_ws) { 209| 12.5k|#if defined(BOTAN_HAS_BASE64_AVX512) 210| 12.5k| if(input_length >= 128 && CPUID::has(CPUID::Feature::AVX512, CPUID::Feature::POPCNT)) { ------------------ | Branch (210:7): [True: 12.5k, False: 0] | Branch (210:30): [True: 0, False: 12.5k] ------------------ 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| 12.5k|#endif 243| | 244| 12.5k| return base_decode_full(Base64(), output, input, input_length, ignore_ws); 245| 12.5k|} _ZN5Botan13base64_decodeEPKcmb: 258| 12.5k|secure_vector base64_decode(const char input[], size_t input_length, bool ignore_ws) { 259| 12.5k| secure_vector bin(Base64::decode_max_output(input_length)); 260| 12.5k| const size_t written = base64_decode(bin.data(), input, input_length, ignore_ws); 261| 12.5k| bin.resize(written); 262| 12.5k| return bin; 263| 12.5k|} base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6417decode_max_outputEm: 49| 25.0k| static constexpr size_t decode_max_output(size_t input_length) { 50| | // Cannot overflow since each block shrinks when decoded 51| 25.0k| return ceil_division(input_length, m_encoding_bytes_out) * m_encoding_bytes_in; 52| 25.0k| } base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6413bits_consumedEv: 40| 12.5k| static constexpr size_t bits_consumed() noexcept { return m_encoding_bits; } base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6419lookup_binary_valueEc: 118| 5.18M|uint8_t Base64::lookup_binary_value(char input) noexcept { 119| 5.18M| const auto has_zero_byte = [](uint64_t v) { return ((v - 0x0101010101010101) & ~(v) & 0x8080808080808080); }; 120| | 121| | // Assumes each byte is either 0x00 or 0x80 122| 5.18M| const auto index_of_first_set_byte = [](uint64_t v) { 123| 5.18M| return ((((v - 1) & 0x0101010101010101) * 0x0101010101010101) >> 56) - 1; 124| 5.18M| }; 125| | 126| 5.18M| constexpr uint64_t lo = 0x0101010101010101; 127| | 128| 5.18M| const uint8_t x = static_cast(input); 129| | 130| 5.18M| const uint64_t x8 = x * lo; 131| | 132| | // Defines the valid ASCII ranges of base64, except the special chars (below) 133| 5.18M| constexpr uint64_t val_l = make_uint64(0, 0, 0, 0, 0, 'A', 'a', '0'); 134| 5.18M| 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| 5.18M| 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| 5.18M| const uint64_t val_v = 0xbfb904 ^ (0xFF000000 - (x << 24)); 142| | 143| 5.18M| 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| 5.18M| constexpr uint64_t specials_i = make_uint64(0, '+', '/', '=', ' ', '\n', '\t', '\r'); 147| | 148| 5.18M| const uint64_t specials_v = 0x3e3f8180808080 ^ (static_cast(z) << 56); 149| | 150| 5.18M| const uint64_t smask = has_zero_byte(x8 ^ specials_i) ^ 0x8000000000000000; 151| | 152| 5.18M| return static_cast(specials_v >> (8 * index_of_first_set_byte(smask))); 153| 5.18M|} base64.cpp:_ZZN5Botan12_GLOBAL__N_16Base6419lookup_binary_valueEcENK3$_0clEm: 122| 10.3M| const auto index_of_first_set_byte = [](uint64_t v) { 123| 10.3M| return ((((v - 1) & 0x0101010101010101) * 0x0101010101010101) >> 56) - 1; 124| 10.3M| }; base64.cpp:_ZZN5Botan12_GLOBAL__N_16Base6419lookup_binary_valueEcENK3$_1clEm: 119| 5.18M| const auto has_zero_byte = [](uint64_t v) { return ((v - 0x0101010101010101) & ~(v) & 0x8080808080808080); }; base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6414check_bad_charEhcb: 156| 5.18M|bool Base64::check_bad_char(uint8_t bin, char input, bool ignore_ws) { 157| 5.18M| if(bin <= 0x3F) { ------------------ | Branch (157:7): [True: 5.18M, False: 0] ------------------ 158| 5.18M| return true; 159| 5.18M| } else if(!(bin == 0x81 || (bin == 0x80 && ignore_ws))) { ------------------ | Branch (159:16): [True: 0, False: 0] | Branch (159:32): [True: 0, False: 0] | Branch (159:47): [True: 0, False: 0] ------------------ 160| 0| throw Invalid_Argument(fmt("base64_decode: invalid character '{}'", format_char_for_display(input))); 161| 0| } 162| 0| return false; 163| 5.18M|} base64.cpp:_ZN5Botan12_GLOBAL__N_16Base646decodeEPhPKh: 60| 1.29M| static void decode(uint8_t* out_ptr, const uint8_t decode_buf[4]) { 61| 1.29M| out_ptr[0] = (decode_buf[0] << 2) | (decode_buf[1] >> 4); 62| 1.29M| out_ptr[1] = (decode_buf[1] << 4) | (decode_buf[2] >> 2); 63| 1.29M| out_ptr[2] = (decode_buf[2] << 6) | decode_buf[3]; 64| 1.29M| } base64.cpp:_ZN5Botan12_GLOBAL__N_16Base6415bytes_to_removeEm: 66| 12.5k| static size_t bytes_to_remove(size_t final_truncate) { return final_truncate; } _ZN5Botan10hex_encodeEPcPKhmb: 34| 12.5k|void hex_encode(char output[], const uint8_t input[], size_t input_length, bool uppercase) { 35| 338k| for(size_t i = 0; i != input_length; ++i) { ------------------ | Branch (35:22): [True: 325k, False: 12.5k] ------------------ 36| 325k| const uint16_t h = hex_encode_2nibble(input[i], uppercase); 37| 325k| output[2 * i] = get_byte<0>(h); 38| 325k| output[2 * i + 1] = get_byte<1>(h); 39| 325k| } 40| 12.5k|} _ZN5Botan10hex_encodeEPKhmb: 42| 12.5k|std::string hex_encode(const uint8_t input[], size_t input_length, bool uppercase) { 43| 12.5k| const size_t output_length = mul_or_throw(2, input_length, "Input too large to hex encode"); 44| 12.5k| std::string output(output_length, 0); 45| | 46| 12.5k| if(input_length > 0) { ------------------ | Branch (46:7): [True: 12.5k, False: 0] ------------------ 47| 12.5k| hex_encode(&output.front(), input, input_length, uppercase); 48| 12.5k| } 49| | 50| 12.5k| return output; 51| 12.5k|} _ZN5Botan10hex_decodeEPhPKcmRmb: 75| 2.75k|size_t hex_decode(uint8_t output[], const char input[], size_t input_length, size_t& input_consumed, bool ignore_ws) { 76| 2.75k| uint8_t* out_ptr = output; 77| 2.75k| bool top_nibble = true; 78| 2.75k| uint8_t next = 0; 79| | 80| 2.75k| input_consumed = 0; 81| | 82| 2.75k| clear_mem(output, input_length / 2); 83| | 84| 92.9k| for(size_t i = 0; i != input_length; ++i) { ------------------ | Branch (84:22): [True: 90.2k, False: 2.75k] ------------------ 85| 90.2k| const uint8_t bin = hex_char_to_bin(input[i]); 86| | 87| 90.2k| if(bin >= 0x10) { ------------------ | Branch (87:10): [True: 0, False: 90.2k] ------------------ 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| 90.2k| if(top_nibble) { ------------------ | Branch (95:10): [True: 45.1k, False: 45.1k] ------------------ 96| 45.1k| next = bin << 4; 97| 45.1k| } else { 98| 45.1k| next |= bin; 99| 45.1k| *out_ptr = next; 100| 45.1k| } 101| | 102| 90.2k| top_nibble = !top_nibble; 103| 90.2k| if(top_nibble) { ------------------ | Branch (103:10): [True: 45.1k, False: 45.1k] ------------------ 104| 45.1k| ++out_ptr; 105| 45.1k| input_consumed = i + 1; 106| 45.1k| } 107| 90.2k| } 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| 2.75k| while(input_consumed < input_length && hex_char_to_bin(input[input_consumed]) == 0x80) { ------------------ | Branch (113:10): [True: 0, False: 2.75k] | Branch (113:43): [True: 0, False: 0] ------------------ 114| 0| ++input_consumed; 115| 0| } 116| | 117| 2.75k| return (out_ptr - output); 118| 2.75k|} _ZN5Botan10hex_decodeEPhPKcmb: 120| 2.75k|size_t hex_decode(uint8_t output[], const char input[], size_t input_length, bool ignore_ws) { 121| 2.75k| size_t consumed = 0; 122| 2.75k| const size_t written = hex_decode(output, input, input_length, consumed, ignore_ws); 123| | 124| 2.75k| if(consumed != input_length) { ------------------ | Branch (124:7): [True: 0, False: 2.75k] ------------------ 125| 0| throw Invalid_Argument("hex_decode: input did not have full bytes"); 126| 0| } 127| | 128| 2.75k| return written; 129| 2.75k|} _ZN5Botan17hex_decode_lockedEPKcmb: 142| 2.75k|secure_vector hex_decode_locked(const char input[], size_t input_length, bool ignore_ws) { 143| 2.75k| secure_vector bin(1 + input_length / 2); 144| | 145| 2.75k| const size_t written = hex_decode(bin.data(), input, input_length, ignore_ws); 146| | 147| 2.75k| bin.resize(written); 148| 2.75k| return bin; 149| 2.75k|} _ZN5Botan17hex_decode_lockedENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEb: 151| 2.74k|secure_vector hex_decode_locked(std::string_view input, bool ignore_ws) { 152| 2.74k| return hex_decode_locked(input.data(), input.size(), ignore_ws); 153| 2.74k|} hex.cpp:_ZN5Botan12_GLOBAL__N_118hex_encode_2nibbleEhb: 21| 325k|uint16_t hex_encode_2nibble(uint8_t n8, bool uppercase) { 22| | // Offset for upper or lower case 'a' resp 23| 325k| const uint16_t a_mask = uppercase ? 0x0707 : 0x2727; ------------------ | Branch (23:28): [True: 325k, False: 0] ------------------ 24| | 25| 325k| const uint16_t n = (static_cast(n8 & 0xF0) << 4) | (n8 & 0x0F); 26| | // n >= 10? If so add offset 27| 325k| const uint16_t diff = swar_lt(0x0909, n) & a_mask; 28| | // Can't overflow between bytes, so don't need explicit SWAR addition: 29| 325k| return n + 0x3030 + diff; 30| 325k|} hex.cpp:_ZN5Botan12_GLOBAL__N_115hex_char_to_binEc: 55| 90.2k|uint8_t hex_char_to_bin(char input) { 56| | // Starts of valid value ranges (v_lo) and their lengths (v_range) 57| 90.2k| constexpr uint64_t v_lo = make_uint64(0, '0', 'a', 'A', ' ', '\n', '\t', '\r'); 58| 90.2k| constexpr uint64_t v_range = make_uint64(0, 10, 6, 6, 1, 1, 1, 1); 59| 90.2k| constexpr uint64_t expand8 = 0x0101010101010101; 60| 90.2k| constexpr uint64_t top64 = 0x8000000000000000; 61| | 62| 90.2k| const uint8_t x = static_cast(input); 63| 90.2k| const uint64_t x8 = x * expand8; 64| | 65| 90.2k| 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| 90.2k| const uint64_t val_v = 0xd0a9c960767773 ^ static_cast(0xFF - x) << 56; 69| | 70| 90.2k| return x + static_cast(val_v >> (8 * index_of_first_set_byte(v_mask))); 71| 90.2k|} _ZN5Botan12HashFunction6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 112| 20.7k|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.7k| if(provider.empty() == false && provider != "base") { ------------------ | Branch (123:7): [True: 0, False: 20.7k] | Branch (123:36): [True: 0, False: 0] ------------------ 124| 0| return nullptr; // unknown provider 125| 0| } 126| | 127| 20.7k|#if defined(BOTAN_HAS_SHA1) 128| 20.7k| if(algo_spec == "SHA-1") { ------------------ | Branch (128:7): [True: 6.33k, False: 14.3k] ------------------ 129| 6.33k| return std::make_unique(); 130| 6.33k| } 131| 14.3k|#endif 132| | 133| 14.3k|#if defined(BOTAN_HAS_SHA2_32) 134| 14.3k| if(algo_spec == "SHA-224") { ------------------ | Branch (134:7): [True: 0, False: 14.3k] ------------------ 135| 0| return std::make_unique(); 136| 0| } 137| | 138| 14.3k| if(algo_spec == "SHA-256") { ------------------ | Branch (138:7): [True: 13.7k, False: 652] ------------------ 139| 13.7k| return std::make_unique(); 140| 13.7k| } 141| 652|#endif 142| | 143| 652|#if defined(BOTAN_HAS_SHA2_64) 144| 652| if(algo_spec == "SHA-384") { ------------------ | Branch (144:7): [True: 652, False: 0] ------------------ 145| 652| return std::make_unique(); 146| 652| } 147| | 148| 0| if(algo_spec == "SHA-512") { ------------------ | Branch (148:7): [True: 0, False: 0] ------------------ 149| 0| return std::make_unique(); 150| 0| } 151| | 152| 0| if(algo_spec == "SHA-512-256") { ------------------ | Branch (152:7): [True: 0, False: 0] ------------------ 153| 0| return std::make_unique(); 154| 0| } 155| 0|#endif 156| | 157| 0|#if defined(BOTAN_HAS_RIPEMD_160) 158| 0| if(algo_spec == "RIPEMD-160") { ------------------ | Branch (158:7): [True: 0, False: 0] ------------------ 159| 0| return std::make_unique(); 160| 0| } 161| 0|#endif 162| | 163| 0|#if defined(BOTAN_HAS_WHIRLPOOL) 164| 0| if(algo_spec == "Whirlpool") { ------------------ | Branch (164:7): [True: 0, False: 0] ------------------ 165| 0| return std::make_unique(); 166| 0| } 167| 0|#endif 168| | 169| 0|#if defined(BOTAN_HAS_MD5) 170| 0| if(algo_spec == "MD5") { ------------------ | Branch (170:7): [True: 0, False: 0] ------------------ 171| 0| return std::make_unique(); 172| 0| } 173| 0|#endif 174| | 175| 0|#if defined(BOTAN_HAS_MD4) 176| 0| if(algo_spec == "MD4") { ------------------ | Branch (176:7): [True: 0, False: 0] ------------------ 177| 0| return std::make_unique(); 178| 0| } 179| 0|#endif 180| | 181| 0|#if defined(BOTAN_HAS_GOST_34_11) 182| 0| if(algo_spec == "GOST-R-34.11-94" || algo_spec == "GOST-34.11") { ------------------ | Branch (182:7): [True: 0, False: 0] | Branch (182:41): [True: 0, False: 0] ------------------ 183| 0| return std::make_unique(); 184| 0| } 185| 0|#endif 186| | 187| 0|#if defined(BOTAN_HAS_ADLER32) 188| 0| if(algo_spec == "Adler32") { ------------------ | Branch (188:7): [True: 0, False: 0] ------------------ 189| 0| return std::make_unique(); 190| 0| } 191| 0|#endif 192| | 193| 0|#if defined(BOTAN_HAS_ASCON_HASH256) 194| 0| if(algo_spec == "Ascon-Hash256") { ------------------ | Branch (194:7): [True: 0, False: 0] ------------------ 195| 0| return std::make_unique(); 196| 0| } 197| 0|#endif 198| | 199| 0|#if defined(BOTAN_HAS_CRC24) 200| 0| if(algo_spec == "CRC24") { ------------------ | Branch (200:7): [True: 0, False: 0] ------------------ 201| 0| return std::make_unique(); 202| 0| } 203| 0|#endif 204| | 205| 0|#if defined(BOTAN_HAS_CRC32) 206| 0| if(algo_spec == "CRC32") { ------------------ | Branch (206:7): [True: 0, False: 0] ------------------ 207| 0| return std::make_unique(); 208| 0| } 209| 0|#endif 210| | 211| 0|#if defined(BOTAN_HAS_STREEBOG) 212| 0| if(algo_spec == "Streebog-256") { ------------------ | Branch (212:7): [True: 0, False: 0] ------------------ 213| 0| return std::make_unique(256); 214| 0| } 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| 12.9k|std::unique_ptr HashFunction::create_or_throw(std::string_view algo, std::string_view provider) { 312| 12.9k| if(auto hash = HashFunction::create(algo, provider)) { ------------------ | Branch (312:12): [True: 12.9k, False: 0] ------------------ 313| 12.9k| return hash; 314| 12.9k| } 315| 0| throw Lookup_Error("Hash", algo, provider); 316| 12.9k|} _ZN5Botan5SHA_110compress_nERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 24| 50.4k|void SHA_1::compress_n(digest_type& digest, std::span input, size_t blocks) { 25| 50.4k| using namespace SHA1_F; 26| | 27| 50.4k|#if defined(BOTAN_HAS_SHA1_X86_SHA_NI) 28| 50.4k| if(CPUID::has(CPUID::Feature::SHA)) { ------------------ | Branch (28:7): [True: 50.4k, False: 0] ------------------ 29| 50.4k| return sha1_compress_x86(digest, input, blocks); 30| 50.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| 31.5k|void SHA_1::init(digest_type& digest) { 175| 31.5k| digest.assign({0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0}); 176| 31.5k|} _ZN5Botan5SHA_18add_dataENSt3__14spanIKhLm18446744073709551615EEE: 214| 25.4k|void SHA_1::add_data(std::span input) { 215| 25.4k| m_md.update(input); 216| 25.4k|} _ZN5Botan5SHA_112final_resultENSt3__14spanIhLm18446744073709551615EEE: 218| 25.1k|void SHA_1::final_result(std::span output) { 219| 25.1k| m_md.final(output); 220| 25.1k|} _ZN5Botan5SHA_117sha1_compress_x86ERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 76| 50.4k| size_t blocks) { 77| 50.4k| const uint8_t* input = input_span.data(); 78| | 79| 50.4k| SIMD_4x32 ABCD = rev_words(SIMD_4x32::load_le(&digest[0])); // NOLINT(*-container-data-pointer) 80| 50.4k| SIMD_4x32 E0 = SIMD_4x32(0, 0, 0, digest[4]); 81| | 82| 138k| while(blocks > 0) { ------------------ | Branch (82:10): [True: 88.4k, False: 50.4k] ------------------ 83| | // Save current hash 84| 88.4k| const auto ABCD_SAVE = ABCD; 85| 88.4k| const auto E0_SAVE = E0; 86| | 87| 88.4k| auto W0 = rev_words(SIMD_4x32::load_be(input)); 88| 88.4k| auto W1 = rev_words(SIMD_4x32::load_be(input + 16)); 89| 88.4k| auto W2 = rev_words(SIMD_4x32::load_be(input + 32)); 90| 88.4k| auto W3 = rev_words(SIMD_4x32::load_be(input + 48)); 91| | 92| 88.4k| sha1_x86_first8<0>(ABCD, E0, W0, W1); 93| 88.4k| sha1_x86_rnds8<0>(ABCD, E0, W2, W3); 94| | 95| 88.4k| W0 = sha1_x86_msg1(W0, W1); 96| 88.4k| W1 = sha1_x86_msg1(W1, W2); 97| 88.4k| W0 ^= W2; 98| | 99| 88.4k| sha1_x86_next_msg(W3, W0, W1, W2); 100| 88.4k| sha1_x86_next_msg(W0, W1, W2, W3); 101| 88.4k| sha1_x86_rnds8<0, 1>(ABCD, E0, W0, W1); 102| | 103| 88.4k| sha1_x86_next_msg(W1, W2, W3, W0); 104| 88.4k| sha1_x86_next_msg(W2, W3, W0, W1); 105| 88.4k| sha1_x86_rnds8<1>(ABCD, E0, W2, W3); 106| | 107| 88.4k| sha1_x86_next_msg(W3, W0, W1, W2); 108| 88.4k| sha1_x86_next_msg(W0, W1, W2, W3); 109| 88.4k| sha1_x86_rnds8<1>(ABCD, E0, W0, W1); 110| | 111| 88.4k| sha1_x86_next_msg(W1, W2, W3, W0); 112| 88.4k| sha1_x86_next_msg(W2, W3, W0, W1); 113| 88.4k| sha1_x86_rnds8<2>(ABCD, E0, W2, W3); 114| | 115| 88.4k| sha1_x86_next_msg(W3, W0, W1, W2); 116| 88.4k| sha1_x86_next_msg(W0, W1, W2, W3); 117| 88.4k| sha1_x86_rnds8<2>(ABCD, E0, W0, W1); 118| | 119| 88.4k| sha1_x86_next_msg(W1, W2, W3, W0); 120| 88.4k| sha1_x86_next_msg(W2, W3, W0, W1); 121| 88.4k| sha1_x86_rnds8<2, 3>(ABCD, E0, W2, W3); 122| | 123| 88.4k| sha1_x86_next_msg(W3, W0, W1, W2); 124| 88.4k| sha1_x86_next_msg(W0, W1, W2, W3); 125| 88.4k| sha1_x86_rnds8<3>(ABCD, E0, W0, W1); 126| | 127| 88.4k| sha1_x86_next_msg(W1, W2, W3, W0); 128| 88.4k| sha1_x86_next_msg(W2, W3, W0, W1); 129| 88.4k| sha1_x86_rnds8<3>(ABCD, E0, W2, W3); 130| | 131| 88.4k| ABCD += ABCD_SAVE; 132| 88.4k| E0 = sha1_x86_nexte(E0, E0_SAVE); 133| | 134| 88.4k| input += 64; 135| 88.4k| blocks--; 136| 88.4k| } 137| | 138| 50.4k| rev_words(ABCD).store_le(&digest[0]); // NOLINT(*-container-data-pointer) 139| 50.4k| digest[4] = E0.extract_word<3>(); 140| 50.4k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_19rev_wordsERKNS_9SIMD_4x32E: 66| 454k|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| 454k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_113sha1_x86_msg1ERKNS_9SIMD_4x32ES3_: 29| 176k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI SIMD_4x32 sha1_x86_msg1(const SIMD_4x32& W0, const SIMD_4x32& W1) { 30| 176k| return SIMD_4x32(_mm_sha1msg1_epu32(W0.raw(), W1.raw())); 31| 176k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_117sha1_x86_next_msgERKNS_9SIMD_4x32ERS1_S4_S4_: 36| 1.41M| SIMD_4x32& W3) { 37| 1.41M| W3 = SIMD_4x32(_mm_sha1msg1_epu32(W3.raw(), W0.raw())); 38| 1.41M| W1 = SIMD_4x32(_mm_sha1msg2_epu32(W1.raw(), W0.raw())); 39| 1.41M| W2 ^= W0; 40| 1.41M|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_nexteERKNS_9SIMD_4x32ES3_: 25| 1.76M|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI SIMD_4x32 sha1_x86_nexte(const SIMD_4x32& x, const SIMD_4x32& y) { 26| 1.76M| return SIMD_4x32(_mm_sha1nexte_epu32(x.raw(), y.raw())); 27| 1.76M|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_115sha1_x86_first8ILh0ELh0EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 46| 88.4k| const SIMD_4x32& W1) { 47| 88.4k| const auto TE = ABCD; 48| 88.4k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), (E + W0).raw(), R1)); 49| | 50| 88.4k| E = ABCD; 51| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 52| 88.4k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh0ELh0EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 88.4k| const SIMD_4x32& W1) { 59| 88.4k| const auto TE = ABCD; 60| 88.4k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 88.4k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 88.4k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh0ELh1EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 88.4k| const SIMD_4x32& W1) { 59| 88.4k| const auto TE = ABCD; 60| 88.4k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 88.4k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 88.4k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh1ELh1EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 176k| const SIMD_4x32& W1) { 59| 176k| const auto TE = ABCD; 60| 176k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 176k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 176k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh2ELh2EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 176k| const SIMD_4x32& W1) { 59| 176k| const auto TE = ABCD; 60| 176k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 176k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 176k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh2ELh3EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 88.4k| const SIMD_4x32& W1) { 59| 88.4k| const auto TE = ABCD; 60| 88.4k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 88.4k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 88.4k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh3ELh3EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 176k| const SIMD_4x32& W1) { 59| 176k| const auto TE = ABCD; 60| 176k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 176k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 176k|} _ZN5Botan7SHA_25615compress_digestERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 59| 105k| size_t blocks) { 60| 105k|#if defined(BOTAN_HAS_SHA2_32_X86) 61| 105k| if(CPUID::has(CPUID::Feature::SHA)) { ------------------ | Branch (61:7): [True: 105k, False: 0] ------------------ 62| 105k| return SHA_256::compress_digest_x86(digest, input, blocks); 63| 105k| } 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_25610compress_nERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 215| 105k|void SHA_256::compress_n(digest_type& digest, std::span input, size_t blocks) { 216| 105k| SHA_256::compress_digest(digest, input, blocks); 217| 105k|} _ZN5Botan7SHA_2564initERNSt3__16vectorIjNS_16secure_allocatorIjEEEE: 219| 66.9k|void SHA_256::init(digest_type& digest) { 220| 66.9k| digest.assign({0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A, 0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19}); 221| 66.9k|} _ZN5Botan7SHA_2568add_dataENSt3__14spanIKhLm18446744073709551615EEE: 231| 82.4k|void SHA_256::add_data(std::span input) { 232| 82.4k| m_md.update(input); 233| 82.4k|} _ZN5Botan7SHA_25612final_resultENSt3__14spanIhLm18446744073709551615EEE: 235| 51.2k|void SHA_256::final_result(std::span output) { 236| 51.2k| m_md.final(output); 237| 51.2k|} _ZN5Botan7SHA_25619compress_digest_x86ERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 59| 105k| size_t blocks) { 60| 105k| const uint8_t* input = input_span.data(); 61| | 62| 105k| SIMD_4x32 S0 = SIMD_4x32::load_le(&digest[0]); // NOLINT(*container-data-pointer) 63| 105k| SIMD_4x32 S1 = SIMD_4x32::load_le(&digest[4]); 64| | 65| 105k| sha256_permute_state(S0, S1); 66| | 67| 253k| while(blocks > 0) { ------------------ | Branch (67:10): [True: 148k, False: 105k] ------------------ 68| 148k| const auto S0_SAVE = S0; 69| 148k| const auto S1_SAVE = S1; 70| | 71| 148k| auto W0 = SIMD_4x32::load_be(input); 72| 148k| auto W1 = SIMD_4x32::load_be(input + 16); 73| 148k| auto W2 = SIMD_4x32::load_be(input + 32); 74| 148k| auto W3 = SIMD_4x32::load_be(input + 48); 75| | 76| 148k| sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&SHA256_K[0])); 77| 148k| sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&SHA256_K[4])); 78| 148k| sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&SHA256_K[8])); 79| 148k| sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&SHA256_K[12])); 80| | 81| 148k| W0 = SIMD_4x32(_mm_sha256msg1_epu32(W0.raw(), W1.raw())); 82| 148k| W1 = SIMD_4x32(_mm_sha256msg1_epu32(W1.raw(), W2.raw())); 83| | 84| 148k| sha256_msg_exp(W2, W3, W0, W1); 85| | 86| 148k| sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&SHA256_K[4 * 4])); 87| 148k| sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&SHA256_K[4 * 5])); 88| | 89| 148k| sha256_msg_exp(W0, W1, W2, W3); 90| | 91| 148k| sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&SHA256_K[4 * 6])); 92| 148k| sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&SHA256_K[4 * 7])); 93| | 94| 148k| sha256_msg_exp(W2, W3, W0, W1); 95| | 96| 148k| sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&SHA256_K[4 * 8])); 97| 148k| sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&SHA256_K[4 * 9])); 98| | 99| 148k| sha256_msg_exp(W0, W1, W2, W3); 100| | 101| 148k| sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&SHA256_K[4 * 10])); 102| 148k| sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&SHA256_K[4 * 11])); 103| | 104| 148k| sha256_msg_exp(W2, W3, W0, W1); 105| | 106| 148k| sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&SHA256_K[4 * 12])); 107| 148k| sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&SHA256_K[4 * 13])); 108| | 109| 148k| sha256_msg_exp(W0, W1, W2, W3); 110| | 111| 148k| sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&SHA256_K[4 * 14])); 112| 148k| sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&SHA256_K[4 * 15])); 113| | 114| | // Add values back to state 115| 148k| S0 += S0_SAVE; 116| 148k| S1 += S1_SAVE; 117| | 118| 148k| input += 64; 119| 148k| blocks--; 120| 148k| } 121| | 122| 105k| sha256_permute_state(S1, S0); 123| | 124| 105k| S0.store_le(&digest[0]); // NOLINT(*container-data-pointer) 125| 105k| S1.store_le(&digest[4]); 126| 105k|} sha2_32_x86.cpp:_ZN5Botan12_GLOBAL__N_120sha256_permute_stateERNS_9SIMD_4x32ES2_: 44| 210k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI void sha256_permute_state(SIMD_4x32& S0, SIMD_4x32& S1) { 45| 210k| S0 = SIMD_4x32(_mm_shuffle_epi32(S0.raw(), 0b10110001)); // CDAB 46| 210k| S1 = SIMD_4x32(_mm_shuffle_epi32(S1.raw(), 0b00011011)); // EFGH 47| | 48| 210k| const auto T = SIMD_4x32::alignr8(S0, S1); // ABEF 49| | S1 = SIMD_4x32(_mm_blend_epi16(S1.raw(), S0.raw(), 0xF0)); // CDGH 50| 210k| S0 = T; 51| 210k|} sha2_32_x86.cpp:_ZN5Botan12_GLOBAL__N_112sha256_rnds4ERNS_9SIMD_4x32ES2_RKS1_S4_: 28| 2.37M| const SIMD_4x32& k) { 29| 2.37M| const auto mk = msg + k; 30| 2.37M| S1 = SIMD_4x32(_mm_sha256rnds2_epu32(S1.raw(), S0.raw(), mk.raw())); 31| 2.37M| S0 = SIMD_4x32(_mm_sha256rnds2_epu32(S0.raw(), S1.raw(), mk.shift_elems_right<2>().raw())); 32| 2.37M|} sha2_32_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha256_msg_expERNS_9SIMD_4x32ES2_S2_S2_: 34| 890k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI void sha256_msg_exp(SIMD_4x32& W0, SIMD_4x32& W1, SIMD_4x32& W2, SIMD_4x32& W3) { 35| 890k| W2 += SIMD_4x32::alignr4(W1, W0); 36| 890k| W0 = SIMD_4x32(_mm_sha256msg1_epu32(W0.raw(), W1.raw())); 37| 890k| W2 = SIMD_4x32(_mm_sha256msg2_epu32(W2.raw(), W1.raw())); 38| | 39| 890k| W3 += SIMD_4x32::alignr4(W2, W1); 40| 890k| W1 = SIMD_4x32(_mm_sha256msg1_epu32(W1.raw(), W2.raw())); 41| 890k| W3 = SIMD_4x32(_mm_sha256msg2_epu32(W3.raw(), W2.raw())); 42| 890k|} _ZN5Botan7SHA_51215compress_digestERNSt3__16vectorImNS_16secure_allocatorImEEEENS1_4spanIKhLm18446744073709551615EEEm: 56| 13.2k|void SHA_512::compress_digest(digest_type& digest, std::span input, size_t blocks) { 57| 13.2k|#if defined(BOTAN_HAS_SHA2_64_X86) 58| 13.2k| if(CPUID::has(CPUID::Feature::SHA512)) { ------------------ | Branch (58:7): [True: 0, False: 13.2k] ------------------ 59| 0| return compress_digest_x86(digest, input, blocks); 60| 0| } 61| 13.2k|#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| 13.2k|#if defined(BOTAN_HAS_SHA2_64_X86_AVX512) 70| 13.2k| if(CPUID::has(CPUID::Feature::AVX512, CPUID::Feature::BMI)) { ------------------ | Branch (70:7): [True: 0, False: 13.2k] ------------------ 71| 0| return compress_digest_x86_avx512(digest, input, blocks); 72| 0| } 73| 13.2k|#endif 74| | 75| 13.2k|#if defined(BOTAN_HAS_SHA2_64_X86_AVX2) 76| 13.2k| if(CPUID::has(CPUID::Feature::AVX2, CPUID::Feature::BMI)) { ------------------ | Branch (76:7): [True: 13.2k, False: 0] ------------------ 77| 13.2k| return compress_digest_x86_avx2(digest, input, blocks); 78| 13.2k| } 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| 13.2k|void SHA_384::compress_n(digest_type& digest, std::span input, size_t blocks) { 210| 13.2k| SHA_512::compress_digest(digest, input, blocks); 211| 13.2k|} _ZN5Botan7SHA_3844initERNSt3__16vectorImNS_16secure_allocatorImEEEE: 228| 6.88k|void SHA_384::init(digest_type& digest) { 229| 6.88k| digest.assign({0xCBBB9D5DC1059ED8, 230| 6.88k| 0x629A292A367CD507, 231| 6.88k| 0x9159015A3070DD17, 232| 6.88k| 0x152FECD8F70E5939, 233| 6.88k| 0x67332667FFC00B31, 234| 6.88k| 0x8EB44A8768581511, 235| 6.88k| 0xDB0C2E0D64F98FA7, 236| 6.88k| 0x47B5481DBEFA4FA4}); 237| 6.88k|} _ZN5Botan7SHA_3848add_dataENSt3__14spanIKhLm18446744073709551615EEE: 274| 14.1k|void SHA_384::add_data(std::span input) { 275| 14.1k| m_md.update(input); 276| 14.1k|} _ZN5Botan7SHA_38412final_resultENSt3__14spanIhLm18446744073709551615EEE: 286| 5.61k|void SHA_384::final_result(std::span output) { 287| 5.61k| m_md.final(output); 288| 5.61k|} _ZN5Botan7SHA_51224compress_digest_x86_avx2ERNSt3__16vectorImNS_16secure_allocatorImEEEENS1_4spanIKhLm18446744073709551615EEEm: 44| 13.2k| size_t blocks) { 45| 13.2k| alignas(64) uint64_t W[16] = {0}; 46| 13.2k| alignas(64) uint64_t W2[80]; 47| | 48| 13.2k| uint64_t A = digest[0]; 49| 13.2k| uint64_t B = digest[1]; 50| 13.2k| uint64_t C = digest[2]; 51| 13.2k| uint64_t D = digest[3]; 52| 13.2k| uint64_t E = digest[4]; 53| 13.2k| uint64_t F = digest[5]; 54| 13.2k| uint64_t G = digest[6]; 55| 13.2k| uint64_t H = digest[7]; 56| | 57| 13.2k| const uint8_t* data = input.data(); 58| | 59| 13.6k| while(blocks >= 2) { ------------------ | Branch (59:10): [True: 384, False: 13.2k] ------------------ 60| 384| SIMD_4x64 WS[8]; 61| | 62| 3.45k| for(size_t i = 0; i < 8; i++) { ------------------ | Branch (62:25): [True: 3.07k, False: 384] ------------------ 63| 3.07k| WS[i] = SIMD_4x64::load_be2(&data[16 * i], &data[128 + 16 * i]); 64| 3.07k| auto WK = WS[i] + SIMD_4x64::broadcast_2x64(&SHA512_K[2 * i]); 65| 3.07k| WK.store_le2(&W[2 * i], &W2[2 * i]); 66| 3.07k| } 67| | 68| 384| data += 2 * 128; 69| 384| blocks -= 2; 70| | 71| | // First 64 rounds of SHA-512 72| 1.92k| for(size_t r = 0; r != 64; r += 16) { ------------------ | Branch (72:25): [True: 1.53k, False: 384] ------------------ 73| 1.53k| auto w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 16]); 74| 1.53k| SHA2_64_F(A, B, C, D, E, F, G, H, W[0]); 75| 1.53k| SHA2_64_F(H, A, B, C, D, E, F, G, W[1]); 76| 1.53k| w.store_le2(&W[0], &W2[r + 16]); 77| | 78| 1.53k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 18]); 79| 1.53k| SHA2_64_F(G, H, A, B, C, D, E, F, W[2]); 80| 1.53k| SHA2_64_F(F, G, H, A, B, C, D, E, W[3]); 81| 1.53k| w.store_le2(&W[2], &W2[r + 18]); 82| | 83| 1.53k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 20]); 84| 1.53k| SHA2_64_F(E, F, G, H, A, B, C, D, W[4]); 85| 1.53k| SHA2_64_F(D, E, F, G, H, A, B, C, W[5]); 86| 1.53k| w.store_le2(&W[4], &W2[r + 20]); 87| | 88| 1.53k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 22]); 89| 1.53k| SHA2_64_F(C, D, E, F, G, H, A, B, W[6]); 90| 1.53k| SHA2_64_F(B, C, D, E, F, G, H, A, W[7]); 91| 1.53k| w.store_le2(&W[6], &W2[r + 22]); 92| | 93| 1.53k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 24]); 94| 1.53k| SHA2_64_F(A, B, C, D, E, F, G, H, W[8]); 95| 1.53k| SHA2_64_F(H, A, B, C, D, E, F, G, W[9]); 96| 1.53k| w.store_le2(&W[8], &W2[r + 24]); 97| | 98| 1.53k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 26]); 99| 1.53k| SHA2_64_F(G, H, A, B, C, D, E, F, W[10]); 100| 1.53k| SHA2_64_F(F, G, H, A, B, C, D, E, W[11]); 101| 1.53k| w.store_le2(&W[10], &W2[r + 26]); 102| | 103| 1.53k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 28]); 104| 1.53k| SHA2_64_F(E, F, G, H, A, B, C, D, W[12]); 105| 1.53k| SHA2_64_F(D, E, F, G, H, A, B, C, W[13]); 106| 1.53k| w.store_le2(&W[12], &W2[r + 28]); 107| | 108| 1.53k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&SHA512_K[r + 30]); 109| 1.53k| SHA2_64_F(C, D, E, F, G, H, A, B, W[14]); 110| 1.53k| SHA2_64_F(B, C, D, E, F, G, H, A, W[15]); 111| 1.53k| w.store_le2(&W[14], &W2[r + 30]); 112| 1.53k| } 113| | 114| | // Final 16 rounds of SHA-512 115| 384| SHA2_64_F(A, B, C, D, E, F, G, H, W[0]); 116| 384| SHA2_64_F(H, A, B, C, D, E, F, G, W[1]); 117| 384| SHA2_64_F(G, H, A, B, C, D, E, F, W[2]); 118| 384| SHA2_64_F(F, G, H, A, B, C, D, E, W[3]); 119| 384| SHA2_64_F(E, F, G, H, A, B, C, D, W[4]); 120| 384| SHA2_64_F(D, E, F, G, H, A, B, C, W[5]); 121| 384| SHA2_64_F(C, D, E, F, G, H, A, B, W[6]); 122| 384| SHA2_64_F(B, C, D, E, F, G, H, A, W[7]); 123| 384| SHA2_64_F(A, B, C, D, E, F, G, H, W[8]); 124| 384| SHA2_64_F(H, A, B, C, D, E, F, G, W[9]); 125| 384| SHA2_64_F(G, H, A, B, C, D, E, F, W[10]); 126| 384| SHA2_64_F(F, G, H, A, B, C, D, E, W[11]); 127| 384| SHA2_64_F(E, F, G, H, A, B, C, D, W[12]); 128| 384| SHA2_64_F(D, E, F, G, H, A, B, C, W[13]); 129| 384| SHA2_64_F(C, D, E, F, G, H, A, B, W[14]); 130| 384| SHA2_64_F(B, C, D, E, F, G, H, A, W[15]); 131| | 132| 384| A = (digest[0] += A); 133| 384| B = (digest[1] += B); 134| 384| C = (digest[2] += C); 135| 384| D = (digest[3] += D); 136| 384| E = (digest[4] += E); 137| 384| F = (digest[5] += F); 138| 384| G = (digest[6] += G); 139| 384| H = (digest[7] += H); 140| | 141| | // Second block of SHA-512 compression, with pre-expanded message 142| 384| SHA2_64_F(A, B, C, D, E, F, G, H, W2[0]); 143| 384| SHA2_64_F(H, A, B, C, D, E, F, G, W2[1]); 144| 384| SHA2_64_F(G, H, A, B, C, D, E, F, W2[2]); 145| 384| SHA2_64_F(F, G, H, A, B, C, D, E, W2[3]); 146| 384| SHA2_64_F(E, F, G, H, A, B, C, D, W2[4]); 147| 384| SHA2_64_F(D, E, F, G, H, A, B, C, W2[5]); 148| 384| SHA2_64_F(C, D, E, F, G, H, A, B, W2[6]); 149| 384| SHA2_64_F(B, C, D, E, F, G, H, A, W2[7]); 150| 384| SHA2_64_F(A, B, C, D, E, F, G, H, W2[8]); 151| 384| SHA2_64_F(H, A, B, C, D, E, F, G, W2[9]); 152| 384| SHA2_64_F(G, H, A, B, C, D, E, F, W2[10]); 153| 384| SHA2_64_F(F, G, H, A, B, C, D, E, W2[11]); 154| 384| SHA2_64_F(E, F, G, H, A, B, C, D, W2[12]); 155| 384| SHA2_64_F(D, E, F, G, H, A, B, C, W2[13]); 156| 384| SHA2_64_F(C, D, E, F, G, H, A, B, W2[14]); 157| 384| SHA2_64_F(B, C, D, E, F, G, H, A, W2[15]); 158| | 159| 384| SHA2_64_F(A, B, C, D, E, F, G, H, W2[16]); 160| 384| SHA2_64_F(H, A, B, C, D, E, F, G, W2[17]); 161| 384| SHA2_64_F(G, H, A, B, C, D, E, F, W2[18]); 162| 384| SHA2_64_F(F, G, H, A, B, C, D, E, W2[19]); 163| 384| SHA2_64_F(E, F, G, H, A, B, C, D, W2[20]); 164| 384| SHA2_64_F(D, E, F, G, H, A, B, C, W2[21]); 165| 384| SHA2_64_F(C, D, E, F, G, H, A, B, W2[22]); 166| 384| SHA2_64_F(B, C, D, E, F, G, H, A, W2[23]); 167| 384| SHA2_64_F(A, B, C, D, E, F, G, H, W2[24]); 168| 384| SHA2_64_F(H, A, B, C, D, E, F, G, W2[25]); 169| 384| SHA2_64_F(G, H, A, B, C, D, E, F, W2[26]); 170| 384| SHA2_64_F(F, G, H, A, B, C, D, E, W2[27]); 171| 384| SHA2_64_F(E, F, G, H, A, B, C, D, W2[28]); 172| 384| SHA2_64_F(D, E, F, G, H, A, B, C, W2[29]); 173| 384| SHA2_64_F(C, D, E, F, G, H, A, B, W2[30]); 174| 384| SHA2_64_F(B, C, D, E, F, G, H, A, W2[31]); 175| | 176| 384| SHA2_64_F(A, B, C, D, E, F, G, H, W2[32]); 177| 384| SHA2_64_F(H, A, B, C, D, E, F, G, W2[33]); 178| 384| SHA2_64_F(G, H, A, B, C, D, E, F, W2[34]); 179| 384| SHA2_64_F(F, G, H, A, B, C, D, E, W2[35]); 180| 384| SHA2_64_F(E, F, G, H, A, B, C, D, W2[36]); 181| 384| SHA2_64_F(D, E, F, G, H, A, B, C, W2[37]); 182| 384| SHA2_64_F(C, D, E, F, G, H, A, B, W2[38]); 183| 384| SHA2_64_F(B, C, D, E, F, G, H, A, W2[39]); 184| 384| SHA2_64_F(A, B, C, D, E, F, G, H, W2[40]); 185| 384| SHA2_64_F(H, A, B, C, D, E, F, G, W2[41]); 186| 384| SHA2_64_F(G, H, A, B, C, D, E, F, W2[42]); 187| 384| SHA2_64_F(F, G, H, A, B, C, D, E, W2[43]); 188| 384| SHA2_64_F(E, F, G, H, A, B, C, D, W2[44]); 189| 384| SHA2_64_F(D, E, F, G, H, A, B, C, W2[45]); 190| 384| SHA2_64_F(C, D, E, F, G, H, A, B, W2[46]); 191| 384| SHA2_64_F(B, C, D, E, F, G, H, A, W2[47]); 192| | 193| 384| SHA2_64_F(A, B, C, D, E, F, G, H, W2[48]); 194| 384| SHA2_64_F(H, A, B, C, D, E, F, G, W2[49]); 195| 384| SHA2_64_F(G, H, A, B, C, D, E, F, W2[50]); 196| 384| SHA2_64_F(F, G, H, A, B, C, D, E, W2[51]); 197| 384| SHA2_64_F(E, F, G, H, A, B, C, D, W2[52]); 198| 384| SHA2_64_F(D, E, F, G, H, A, B, C, W2[53]); 199| 384| SHA2_64_F(C, D, E, F, G, H, A, B, W2[54]); 200| 384| SHA2_64_F(B, C, D, E, F, G, H, A, W2[55]); 201| 384| SHA2_64_F(A, B, C, D, E, F, G, H, W2[56]); 202| 384| SHA2_64_F(H, A, B, C, D, E, F, G, W2[57]); 203| 384| SHA2_64_F(G, H, A, B, C, D, E, F, W2[58]); 204| 384| SHA2_64_F(F, G, H, A, B, C, D, E, W2[59]); 205| 384| SHA2_64_F(E, F, G, H, A, B, C, D, W2[60]); 206| 384| SHA2_64_F(D, E, F, G, H, A, B, C, W2[61]); 207| 384| SHA2_64_F(C, D, E, F, G, H, A, B, W2[62]); 208| 384| SHA2_64_F(B, C, D, E, F, G, H, A, W2[63]); 209| | 210| 384| SHA2_64_F(A, B, C, D, E, F, G, H, W2[64]); 211| 384| SHA2_64_F(H, A, B, C, D, E, F, G, W2[65]); 212| 384| SHA2_64_F(G, H, A, B, C, D, E, F, W2[66]); 213| 384| SHA2_64_F(F, G, H, A, B, C, D, E, W2[67]); 214| 384| SHA2_64_F(E, F, G, H, A, B, C, D, W2[68]); 215| 384| SHA2_64_F(D, E, F, G, H, A, B, C, W2[69]); 216| 384| SHA2_64_F(C, D, E, F, G, H, A, B, W2[70]); 217| 384| SHA2_64_F(B, C, D, E, F, G, H, A, W2[71]); 218| 384| SHA2_64_F(A, B, C, D, E, F, G, H, W2[72]); 219| 384| SHA2_64_F(H, A, B, C, D, E, F, G, W2[73]); 220| 384| SHA2_64_F(G, H, A, B, C, D, E, F, W2[74]); 221| 384| SHA2_64_F(F, G, H, A, B, C, D, E, W2[75]); 222| 384| SHA2_64_F(E, F, G, H, A, B, C, D, W2[76]); 223| 384| SHA2_64_F(D, E, F, G, H, A, B, C, W2[77]); 224| 384| SHA2_64_F(C, D, E, F, G, H, A, B, W2[78]); 225| 384| SHA2_64_F(B, C, D, E, F, G, H, A, W2[79]); 226| | 227| 384| A = (digest[0] += A); 228| 384| B = (digest[1] += B); 229| 384| C = (digest[2] += C); 230| 384| D = (digest[3] += D); 231| 384| E = (digest[4] += E); 232| 384| F = (digest[5] += F); 233| 384| G = (digest[6] += G); 234| 384| H = (digest[7] += H); 235| 384| } 236| | 237| 26.2k| while(blocks > 0) { ------------------ | Branch (237:10): [True: 13.0k, False: 13.2k] ------------------ 238| 13.0k| SIMD_2x64 WS[8]; 239| | 240| 117k| for(size_t i = 0; i < 8; i++) { ------------------ | Branch (240:25): [True: 104k, False: 13.0k] ------------------ 241| 104k| WS[i] = SIMD_2x64::load_be(&data[16 * i]); 242| 104k| const auto WK = WS[i] + SIMD_2x64::load_le(&SHA512_K[2 * i]); 243| 104k| WK.store_le(&W[2 * i]); 244| 104k| } 245| | 246| 13.0k| data += 128; 247| 13.0k| blocks -= 1; 248| | 249| | // First 64 rounds of SHA-512 250| 65.2k| for(size_t r = 0; r != 64; r += 16) { ------------------ | Branch (250:25): [True: 52.2k, False: 13.0k] ------------------ 251| 52.2k| auto w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 16]); 252| 52.2k| SHA2_64_F(A, B, C, D, E, F, G, H, W[0]); 253| 52.2k| SHA2_64_F(H, A, B, C, D, E, F, G, W[1]); 254| 52.2k| w.store_le(&W[0]); 255| | 256| 52.2k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 18]); 257| 52.2k| SHA2_64_F(G, H, A, B, C, D, E, F, W[2]); 258| 52.2k| SHA2_64_F(F, G, H, A, B, C, D, E, W[3]); 259| 52.2k| w.store_le(&W[2]); 260| | 261| 52.2k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 20]); 262| 52.2k| SHA2_64_F(E, F, G, H, A, B, C, D, W[4]); 263| 52.2k| SHA2_64_F(D, E, F, G, H, A, B, C, W[5]); 264| 52.2k| w.store_le(&W[4]); 265| | 266| 52.2k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 22]); 267| 52.2k| SHA2_64_F(C, D, E, F, G, H, A, B, W[6]); 268| 52.2k| SHA2_64_F(B, C, D, E, F, G, H, A, W[7]); 269| 52.2k| w.store_le(&W[6]); 270| | 271| 52.2k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 24]); 272| 52.2k| SHA2_64_F(A, B, C, D, E, F, G, H, W[8]); 273| 52.2k| SHA2_64_F(H, A, B, C, D, E, F, G, W[9]); 274| 52.2k| w.store_le(&W[8]); 275| | 276| 52.2k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 26]); 277| 52.2k| SHA2_64_F(G, H, A, B, C, D, E, F, W[10]); 278| 52.2k| SHA2_64_F(F, G, H, A, B, C, D, E, W[11]); 279| 52.2k| w.store_le(&W[10]); 280| | 281| 52.2k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 28]); 282| 52.2k| SHA2_64_F(E, F, G, H, A, B, C, D, W[12]); 283| 52.2k| SHA2_64_F(D, E, F, G, H, A, B, C, W[13]); 284| 52.2k| w.store_le(&W[12]); 285| | 286| 52.2k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&SHA512_K[r + 30]); 287| 52.2k| SHA2_64_F(C, D, E, F, G, H, A, B, W[14]); 288| 52.2k| SHA2_64_F(B, C, D, E, F, G, H, A, W[15]); 289| 52.2k| w.store_le(&W[14]); 290| 52.2k| } 291| | 292| | // Final 16 rounds of SHA-512 293| 13.0k| SHA2_64_F(A, B, C, D, E, F, G, H, W[0]); 294| 13.0k| SHA2_64_F(H, A, B, C, D, E, F, G, W[1]); 295| 13.0k| SHA2_64_F(G, H, A, B, C, D, E, F, W[2]); 296| 13.0k| SHA2_64_F(F, G, H, A, B, C, D, E, W[3]); 297| 13.0k| SHA2_64_F(E, F, G, H, A, B, C, D, W[4]); 298| 13.0k| SHA2_64_F(D, E, F, G, H, A, B, C, W[5]); 299| 13.0k| SHA2_64_F(C, D, E, F, G, H, A, B, W[6]); 300| 13.0k| SHA2_64_F(B, C, D, E, F, G, H, A, W[7]); 301| 13.0k| SHA2_64_F(A, B, C, D, E, F, G, H, W[8]); 302| 13.0k| SHA2_64_F(H, A, B, C, D, E, F, G, W[9]); 303| 13.0k| SHA2_64_F(G, H, A, B, C, D, E, F, W[10]); 304| 13.0k| SHA2_64_F(F, G, H, A, B, C, D, E, W[11]); 305| 13.0k| SHA2_64_F(E, F, G, H, A, B, C, D, W[12]); 306| 13.0k| SHA2_64_F(D, E, F, G, H, A, B, C, W[13]); 307| 13.0k| SHA2_64_F(C, D, E, F, G, H, A, B, W[14]); 308| 13.0k| SHA2_64_F(B, C, D, E, F, G, H, A, W[15]); 309| | 310| 13.0k| A = (digest[0] += A); 311| 13.0k| B = (digest[1] += B); 312| 13.0k| C = (digest[2] += C); 313| 13.0k| D = (digest[3] += D); 314| 13.0k| E = (digest[4] += E); 315| 13.0k| F = (digest[5] += F); 316| 13.0k| G = (digest[6] += G); 317| 13.0k| H = (digest[7] += H); 318| 13.0k| } 319| 13.2k|} sha2_64_avx2.cpp:_ZN5Botan12_GLOBAL__N_113sha512_next_wINS_9SIMD_4x64EEET_PS3_: 19| 12.2k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AVX2_BMI2 SIMD_T sha512_next_w(SIMD_T x[8]) { 20| 12.2k| const auto t0 = SIMD_T::alignr8(x[1], x[0]); 21| 12.2k| const auto t1 = SIMD_T::alignr8(x[5], x[4]); 22| | 23| 12.2k| const auto s0 = t0.template rotr<1>() ^ t0.template rotr<8>() ^ t0.template shr<7>(); 24| 12.2k| const auto s1 = x[7].template rotr<19>() ^ x[7].template rotr<61>() ^ x[7].template shr<6>(); 25| | 26| 12.2k| const auto nx = x[0] + s0 + s1 + t1; 27| | 28| 12.2k| x[0] = x[1]; 29| 12.2k| x[1] = x[2]; 30| 12.2k| x[2] = x[3]; 31| 12.2k| x[3] = x[4]; 32| 12.2k| x[4] = x[5]; 33| 12.2k| x[5] = x[6]; 34| 12.2k| x[6] = x[7]; 35| 12.2k| x[7] = nx; 36| | 37| 12.2k| return x[7]; 38| 12.2k|} sha2_64_avx2.cpp:_ZN5Botan12_GLOBAL__N_113sha512_next_wINS_9SIMD_2x64EEET_PS3_: 19| 417k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AVX2_BMI2 SIMD_T sha512_next_w(SIMD_T x[8]) { 20| 417k| const auto t0 = SIMD_T::alignr8(x[1], x[0]); 21| 417k| const auto t1 = SIMD_T::alignr8(x[5], x[4]); 22| | 23| 417k| const auto s0 = t0.template rotr<1>() ^ t0.template rotr<8>() ^ t0.template shr<7>(); 24| 417k| const auto s1 = x[7].template rotr<19>() ^ x[7].template rotr<61>() ^ x[7].template shr<6>(); 25| | 26| 417k| const auto nx = x[0] + s0 + s1 + t1; 27| | 28| 417k| x[0] = x[1]; 29| 417k| x[1] = x[2]; 30| 417k| x[2] = x[3]; 31| 417k| x[3] = x[4]; 32| 417k| x[4] = x[5]; 33| 417k| x[5] = x[6]; 34| 417k| x[6] = x[7]; 35| 417k| x[7] = nx; 36| | 37| 417k| return x[7]; 38| 417k|} _ZN5Botan3KDF6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 74| 1.35k|std::unique_ptr KDF::create(std::string_view algo_spec, std::string_view provider) { 75| 1.35k| const AlgorithmSpec req(algo_spec); 76| | 77| 1.35k|#if defined(BOTAN_HAS_HKDF) 78| 1.35k| if(auto m = req.match("HKDF({prf})")) { ------------------ | Branch (78:12): [True: 0, False: 1.35k] ------------------ 79| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (79:10): [True: 0, False: 0] | Branch (79:30): [True: 0, False: 0] ------------------ 80| 0| return kdf_create_mac_or_hash(m->str("prf")); 81| 0| } 82| 0| } 83| | 84| 1.35k| if(auto m = req.match("HKDF-Extract({prf})")) { ------------------ | Branch (84:12): [True: 0, False: 1.35k] ------------------ 85| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (85:10): [True: 0, False: 0] | Branch (85:30): [True: 0, False: 0] ------------------ 86| 0| return kdf_create_mac_or_hash(m->str("prf")); 87| 0| } 88| 0| } 89| | 90| 1.35k| if(auto m = req.match("HKDF-Expand({prf})")) { ------------------ | Branch (90:12): [True: 0, False: 1.35k] ------------------ 91| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (91:10): [True: 0, False: 0] | Branch (91:30): [True: 0, False: 0] ------------------ 92| 0| return kdf_create_mac_or_hash(m->str("prf")); 93| 0| } 94| 0| } 95| 1.35k|#endif 96| | 97| 1.35k|#if defined(BOTAN_HAS_KDF2) 98| 1.35k| if(auto m = req.match("KDF2({hash})")) { ------------------ | Branch (98:12): [True: 0, False: 1.35k] ------------------ 99| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (99:10): [True: 0, False: 0] | Branch (99:30): [True: 0, False: 0] ------------------ 100| 0| if(auto hash = HashFunction::create(m->str("hash"))) { ------------------ | Branch (100:18): [True: 0, False: 0] ------------------ 101| 0| return std::make_unique(std::move(hash)); 102| 0| } 103| 0| } 104| 0| } 105| 1.35k|#endif 106| | 107| 1.35k|#if defined(BOTAN_HAS_KDF1_18033) 108| 1.35k| if(auto m = req.match("KDF1-18033({hash})")) { ------------------ | Branch (108:12): [True: 0, False: 1.35k] ------------------ 109| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (109:10): [True: 0, False: 0] | Branch (109:30): [True: 0, False: 0] ------------------ 110| 0| if(auto hash = HashFunction::create(m->str("hash"))) { ------------------ | Branch (110:18): [True: 0, False: 0] ------------------ 111| 0| return std::make_unique(std::move(hash)); 112| 0| } 113| 0| } 114| 0| } 115| 1.35k|#endif 116| | 117| 1.35k|#if defined(BOTAN_HAS_KDF1) 118| 1.35k| if(auto m = req.match("KDF1({hash})")) { ------------------ | Branch (118:12): [True: 0, False: 1.35k] ------------------ 119| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (119:10): [True: 0, False: 0] | Branch (119:30): [True: 0, False: 0] ------------------ 120| 0| if(auto hash = HashFunction::create(m->str("hash"))) { ------------------ | Branch (120:18): [True: 0, False: 0] ------------------ 121| 0| return std::make_unique(std::move(hash)); 122| 0| } 123| 0| } 124| 0| } 125| 1.35k|#endif 126| | 127| 1.35k|#if defined(BOTAN_HAS_TLS_V12_PRF) 128| 1.35k| if(auto m = req.match("TLS-12-PRF({prf})")) { ------------------ | Branch (128:12): [True: 1.35k, False: 0] ------------------ 129| 1.35k| if(provider.empty() || provider == "base") { ------------------ | Branch (129:10): [True: 1.35k, False: 0] | Branch (129:30): [True: 0, False: 0] ------------------ 130| 1.35k| return kdf_create_mac_or_hash(m->str("prf")); 131| 1.35k| } 132| 1.35k| } 133| 0|#endif 134| | 135| 0|#if defined(BOTAN_HAS_X942_PRF) 136| 0| if(auto m = req.match("X9.42-PRF({kek:str})")) { ------------------ | Branch (136:12): [True: 0, False: 0] ------------------ 137| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (137:10): [True: 0, False: 0] | Branch (137:30): [True: 0, False: 0] ------------------ 138| 0| return std::make_unique(m->str("kek")); 139| 0| } 140| 0| } 141| 0|#endif 142| | 143| 0|#if defined(BOTAN_HAS_SP800_108) 144| 0| if(auto m = req.match("SP800-108-Counter({prf},{r:int=32},{L:int=32})")) { ------------------ | Branch (144:12): [True: 0, False: 0] ------------------ 145| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (145:10): [True: 0, False: 0] | Branch (145:30): [True: 0, False: 0] ------------------ 146| 0| return kdf_create_mac_or_hash(m->str("prf"), m->integer("r"), m->integer("L")); 147| 0| } 148| 0| } 149| | 150| 0| if(auto m = req.match("SP800-108-Feedback({prf},{r:int=32},{L:int=32})")) { ------------------ | Branch (150:12): [True: 0, False: 0] ------------------ 151| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (151:10): [True: 0, False: 0] | Branch (151:30): [True: 0, False: 0] ------------------ 152| 0| return kdf_create_mac_or_hash(m->str("prf"), m->integer("r"), m->integer("L")); 153| 0| } 154| 0| } 155| | 156| 0| if(auto m = req.match("SP800-108-Pipeline({prf},{r:int=32},{L:int=32})")) { ------------------ | Branch (156:12): [True: 0, False: 0] ------------------ 157| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (157:10): [True: 0, False: 0] | Branch (157:30): [True: 0, False: 0] ------------------ 158| 0| return kdf_create_mac_or_hash(m->str("prf"), m->integer("r"), m->integer("L")); 159| 0| } 160| 0| } 161| 0|#endif 162| | 163| 0|#if defined(BOTAN_HAS_SP800_56A) 164| 0| if(auto m = req.match("SP800-56A({fn})")) { ------------------ | Branch (164:12): [True: 0, False: 0] ------------------ 165| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (165:10): [True: 0, False: 0] | Branch (165:30): [True: 0, False: 0] ------------------ 166| 0| const auto fn = m->str("fn"); 167| 0| if(auto hash = HashFunction::create(fn)) { ------------------ | Branch (167:18): [True: 0, False: 0] ------------------ 168| 0| return std::make_unique(std::move(hash)); 169| 0| } 170| 0| if(fn == "KMAC-128") { ------------------ | Branch (170:13): [True: 0, False: 0] ------------------ 171| 0| return std::make_unique(); 172| 0| } 173| 0| if(fn == "KMAC-256") { ------------------ | Branch (173:13): [True: 0, False: 0] ------------------ 174| 0| return std::make_unique(); 175| 0| } 176| 0| if(auto mac = MessageAuthenticationCode::create(fn)) { ------------------ | Branch (176:18): [True: 0, False: 0] ------------------ 177| 0| return std::make_unique(std::move(mac)); 178| 0| } 179| 0| } 180| 0| } 181| 0|#endif 182| | 183| 0|#if defined(BOTAN_HAS_SP800_56C) 184| 0| if(auto m = req.match("SP800-56C({prf})")) { ------------------ | Branch (184:12): [True: 0, False: 0] ------------------ 185| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (185:10): [True: 0, False: 0] | Branch (185:30): [True: 0, False: 0] ------------------ 186| 0| const auto prf = m->str("prf"); 187| 0| std::unique_ptr exp(kdf_create_mac_or_hash(prf, 32, 32)); 188| 0| if(exp) { ------------------ | Branch (188:13): [True: 0, False: 0] ------------------ 189| 0| if(auto mac = MessageAuthenticationCode::create(fmt("HMAC({})", prf))) { ------------------ | Branch (189:21): [True: 0, False: 0] ------------------ 190| 0| return std::make_unique(std::move(mac), std::move(exp)); 191| 0| } 192| | 193| 0| if(auto mac = MessageAuthenticationCode::create(prf)) { ------------------ | Branch (193:21): [True: 0, False: 0] ------------------ 194| 0| return std::make_unique(std::move(mac), std::move(exp)); 195| 0| } 196| 0| } 197| 0| } 198| 0| } 199| 0|#endif 200| | 201| 0| BOTAN_UNUSED(req); ------------------ | | 151| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 202| 0| BOTAN_UNUSED(provider); ------------------ | | 151| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 203| | 204| 0| return nullptr; 205| 0|} _ZN5Botan3KDF15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 208| 1.35k|std::unique_ptr KDF::create_or_throw(std::string_view algo, std::string_view provider) { 209| 1.35k| if(auto kdf = KDF::create(algo, provider)) { ------------------ | Branch (209:12): [True: 1.35k, False: 0] ------------------ 210| 1.35k| return kdf; 211| 1.35k| } 212| 0| throw Lookup_Error("KDF", algo, provider); 213| 1.35k|} kdf.cpp:_ZN5Botan12_GLOBAL__N_122kdf_create_mac_or_hashINS_10TLS_12_PRFEJEEENSt3__110unique_ptrINS_3KDFENS3_14default_deleteIS5_EEEENS3_17basic_string_viewIcNS3_11char_traitsIcEEEEDpOT0_: 60| 1.35k|std::unique_ptr kdf_create_mac_or_hash(std::string_view nm, ParamTs&&... params) { 61| 1.35k| if(auto mac = MessageAuthenticationCode::create(fmt("HMAC({})", nm))) { ------------------ | Branch (61:12): [True: 1.35k, False: 0] ------------------ 62| 1.35k| return std::make_unique(std::move(mac), std::forward(params)...); 63| 1.35k| } 64| | 65| 0| if(auto mac = MessageAuthenticationCode::create(nm)) { ------------------ | Branch (65:12): [True: 0, False: 0] ------------------ 66| 0| return std::make_unique(std::move(mac), std::forward(params)...); 67| 0| } 68| | 69| 0| return nullptr; 70| 0|} _ZNK5Botan10TLS_12_PRF11perform_kdfENSt3__14spanIhLm18446744073709551615EEENS2_IKhLm18446744073709551615EEES5_S5_: 24| 2.57k| std::span label) const { 25| 2.57k| try { 26| 2.57k| m_mac->set_key(secret); 27| 2.57k| } catch(Invalid_Key_Length&) { 28| 0| throw Internal_Error(fmt("The premaster secret of {} bytes is too long for TLS-PRF", secret.size())); 29| 0| } 30| | 31| 2.57k| auto A = concat>(label, salt); 32| 2.57k| secure_vector h; 33| | 34| 2.57k| BufferStuffer o(key); 35| 8.73k| while(!o.full()) { ------------------ | Branch (35:10): [True: 6.15k, False: 2.57k] ------------------ 36| 6.15k| A = m_mac->process(A); 37| | 38| 6.15k| m_mac->update(A); 39| 6.15k| m_mac->update(label); 40| 6.15k| m_mac->update(salt); 41| 6.15k| m_mac->final(h); 42| | 43| 6.15k| const size_t writing = std::min(h.size(), o.remaining_capacity()); 44| 6.15k| o.append(std::span{h}.first(writing)); 45| 6.15k| } 46| 2.57k|} _ZN5Botan4HMAC8add_dataENSt3__14spanIKhLm18446744073709551615EEE: 21| 24.8k|void HMAC::add_data(std::span input) { 22| 24.8k| assert_key_material_set(); 23| 24.8k| m_hash->update(input); 24| 24.8k|} _ZN5Botan4HMAC12final_resultENSt3__14spanIhLm18446744073709551615EEE: 29| 12.3k|void HMAC::final_result(std::span mac) { 30| 12.3k| assert_key_material_set(); 31| 12.3k| m_hash->final(mac); 32| 12.3k| m_hash->update(m_okey); 33| 12.3k| m_hash->update(mac.first(m_hash_output_length)); 34| 12.3k| m_hash->final(mac); 35| 12.3k| m_hash->update(m_ikey); 36| 12.3k|} _ZNK5Botan4HMAC8key_specEv: 48| 2.79k|Key_Length_Specification HMAC::key_spec() const { 49| | // Support very long lengths for things like PBKDF2 and the TLS PRF 50| 2.79k| return Key_Length_Specification(0, 8192); 51| 2.79k|} _ZNK5Botan4HMAC13output_lengthEv: 53| 12.5k|size_t HMAC::output_length() const { 54| 12.5k| return m_hash_output_length; 55| 12.5k|} _ZNK5Botan4HMAC19has_keying_materialEv: 57| 37.2k|bool HMAC::has_keying_material() const { 58| 37.2k| return !m_okey.empty(); 59| 37.2k|} _ZN5Botan4HMAC12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 64| 2.68k|void HMAC::key_schedule(std::span key) { 65| 2.68k| const uint8_t ipad = 0x36; 66| 2.68k| const uint8_t opad = 0x5C; 67| | 68| 2.68k| m_hash->clear(); 69| | 70| 2.68k| m_ikey.resize(m_hash_block_size); 71| 2.68k| m_okey.resize(m_hash_block_size); 72| | 73| 2.68k| clear_mem(m_ikey.data(), m_ikey.size()); 74| 2.68k| clear_mem(m_okey.data(), m_okey.size()); 75| | 76| | /* 77| | * Sometimes the HMAC key length itself is sensitive, as with PBKDF2 where it 78| | * reveals the length of the passphrase. Make some attempt to hide this to 79| | * side channels. Clearly if the secret is longer than the block size then the 80| | * branch to hash first reveals that. In addition, counting the number of 81| | * compression functions executed reveals the size at the granularity of the 82| | * hash function's block size. 83| | * 84| | * The greater concern is for smaller keys; being able to detect when a 85| | * passphrase is say 4 bytes may assist choosing weaker targets. Even though 86| | * the loop bounds are constant, we can only actually read key[0..length] so 87| | * it doesn't seem possible to make this computation truly constant time. 88| | * 89| | * We don't mind leaking if the length is exactly zero since that's 90| | * trivial to simply check. 91| | */ 92| | 93| 2.68k| if(key.size() > m_hash_block_size) { ------------------ | Branch (93:7): [True: 365, False: 2.32k] ------------------ 94| 365| m_hash->update(key); 95| 365| m_hash->final(m_ikey.data()); 96| 2.32k| } else if(key.size() >= 20) { ------------------ | Branch (96:14): [True: 2.32k, False: 0] ------------------ 97| | // For long keys we just leak the length either it is a cryptovariable 98| | // or a long enough password that just the length is not a useful signal 99| 2.32k| copy_mem(std::span{m_ikey}.first(key.size()), key); 100| 2.32k| } else if(!key.empty()) { ------------------ | Branch (100:14): [True: 0, False: 0] ------------------ 101| 0| for(size_t i = 0, i_mod_length = 0; i != m_hash_block_size; ++i) { ------------------ | Branch (101:43): [True: 0, False: 0] ------------------ 102| | /* 103| | access key[i % length] but avoiding division due to variable 104| | time computation on some processors. 105| | */ 106| 0| const auto needs_reduction = CT::Mask::is_lte(key.size(), i_mod_length); 107| 0| i_mod_length = needs_reduction.select(0, i_mod_length); 108| 0| const uint8_t kb = key[i_mod_length]; 109| | 110| 0| const auto in_range = CT::Mask::is_lt(i, key.size()); 111| 0| m_ikey[i] = static_cast(in_range.if_set_return(kb)); 112| 0| i_mod_length += 1; 113| 0| } 114| 0| } 115| | 116| 214k| for(size_t i = 0; i != m_hash_block_size; ++i) { ------------------ | Branch (116:22): [True: 211k, False: 2.68k] ------------------ 117| 211k| m_ikey[i] ^= ipad; 118| 211k| m_okey[i] = m_ikey[i] ^ ipad ^ opad; 119| 211k| } 120| | 121| 2.68k| m_hash->update(m_ikey); 122| 2.68k|} _ZNK5Botan4HMAC4nameEv: 136| 150|std::string HMAC::name() const { 137| 150| return fmt("HMAC({})", m_hash->name()); 138| 150|} _ZN5Botan4HMACC2ENSt3__110unique_ptrINS_12HashFunctionENS1_14default_deleteIS3_EEEE: 151| 1.46k| m_hash(std::move(hash)), 152| 1.46k| m_hash_output_length(m_hash->output_length()), 153| 1.46k| m_hash_block_size(m_hash->hash_block_size()) { 154| 1.46k| BOTAN_ARG_CHECK(m_hash_output_length >= 8, "HMAC is not compatible with this hash function"); ------------------ | | 35| 1.46k| do { \ | | 36| 1.46k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.46k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.46k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.46k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.46k] | | ------------------ ------------------ 155| 1.46k| BOTAN_ARG_CHECK(m_hash_block_size >= m_hash_output_length, "HMAC is not compatible with this hash function"); ------------------ | | 35| 1.46k| do { \ | | 36| 1.46k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.46k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.46k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.46k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.46k] | | ------------------ ------------------ 156| 1.46k|} _ZN5Botan25MessageAuthenticationCode6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 52| 1.49k| std::string_view provider) { 53| 1.49k| const AlgorithmSpec req(algo_spec); 54| | 55| 1.49k|#if defined(BOTAN_HAS_BLAKE2BMAC) 56| 1.49k| if(auto m = req.match("BLAKE2b|Blake2b({bits:int=512})")) { ------------------ | Branch (56:12): [True: 0, False: 1.49k] ------------------ 57| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (57:10): [True: 0, False: 0] | Branch (57:30): [True: 0, False: 0] ------------------ 58| 0| return std::make_unique(m->integer("bits")); 59| 0| } 60| 0| } 61| 1.49k|#endif 62| | 63| 1.49k|#if defined(BOTAN_HAS_GMAC) 64| 1.49k| if(auto m = req.match("GMAC({cipher})")) { ------------------ | Branch (64:12): [True: 0, False: 1.49k] ------------------ 65| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (65:10): [True: 0, False: 0] | Branch (65:30): [True: 0, False: 0] ------------------ 66| 0| if(auto bc = BlockCipher::create(m->str("cipher"))) { ------------------ | Branch (66:18): [True: 0, False: 0] ------------------ 67| 0| return std::make_unique(std::move(bc)); 68| 0| } 69| 0| } 70| 0| } 71| 1.49k|#endif 72| | 73| 1.49k|#if defined(BOTAN_HAS_HMAC) 74| 1.49k| if(auto m = req.match("HMAC({hash})")) { ------------------ | Branch (74:12): [True: 1.46k, False: 33] ------------------ 75| 1.46k| if(provider.empty() || provider == "base") { ------------------ | Branch (75:10): [True: 1.46k, False: 0] | Branch (75:30): [True: 0, False: 0] ------------------ 76| 1.46k| if(auto hash = HashFunction::create(m->str("hash"))) { ------------------ | Branch (76:18): [True: 1.46k, False: 0] ------------------ 77| 1.46k| return std::make_unique(std::move(hash)); 78| 1.46k| } 79| 1.46k| } 80| 1.46k| } 81| 33|#endif 82| | 83| 33|#if defined(BOTAN_HAS_POLY1305) 84| 33| if(req.matches("Poly1305")) { ------------------ | Branch (84:7): [True: 33, False: 0] ------------------ 85| 33| if(provider.empty() || provider == "base") { ------------------ | Branch (85:10): [True: 33, False: 0] | Branch (85:30): [True: 0, False: 0] ------------------ 86| 33| return std::make_unique(); 87| 33| } 88| 33| } 89| 0|#endif 90| | 91| 0|#if defined(BOTAN_HAS_SIPHASH) 92| 0| if(auto m = req.match("SipHash({c:int=2},{d:int=4})")) { ------------------ | Branch (92:12): [True: 0, False: 0] ------------------ 93| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (93:10): [True: 0, False: 0] | Branch (93:30): [True: 0, False: 0] ------------------ 94| 0| return std::make_unique(m->integer("c"), m->integer("d")); 95| 0| } 96| 0| } 97| 0|#endif 98| | 99| 0|#if defined(BOTAN_HAS_CMAC) 100| 0| if(auto m = req.match("CMAC|OMAC({cipher})")) { ------------------ | Branch (100:12): [True: 0, False: 0] ------------------ 101| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (101:10): [True: 0, False: 0] | Branch (101:30): [True: 0, False: 0] ------------------ 102| 0| if(auto bc = BlockCipher::create(m->str("cipher"))) { ------------------ | Branch (102:18): [True: 0, False: 0] ------------------ 103| 0| return std::make_unique(std::move(bc)); 104| 0| } 105| 0| } 106| 0| } 107| 0|#endif 108| | 109| 0|#if defined(BOTAN_HAS_ANSI_X919_MAC) 110| 0| if(req.matches("X9.19-MAC")) { ------------------ | Branch (110:7): [True: 0, False: 0] ------------------ 111| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (111:10): [True: 0, False: 0] | Branch (111:30): [True: 0, False: 0] ------------------ 112| 0| return std::make_unique(); 113| 0| } 114| 0| } 115| 0|#endif 116| | 117| 0|#if defined(BOTAN_HAS_KMAC) 118| 0| if(auto m = req.match("KMAC-128({bits:int})")) { ------------------ | Branch (118:12): [True: 0, False: 0] ------------------ 119| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (119:10): [True: 0, False: 0] | Branch (119:30): [True: 0, False: 0] ------------------ 120| 0| return std::make_unique(m->integer("bits")); 121| 0| } 122| 0| } 123| | 124| 0| if(auto m = req.match("KMAC-256({bits:int})")) { ------------------ | Branch (124:12): [True: 0, False: 0] ------------------ 125| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (125:10): [True: 0, False: 0] | Branch (125:30): [True: 0, False: 0] ------------------ 126| 0| return std::make_unique(m->integer("bits")); 127| 0| } 128| 0| } 129| 0|#endif 130| | 131| 0| BOTAN_UNUSED(req); ------------------ | | 151| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 132| 0| BOTAN_UNUSED(provider); ------------------ | | 151| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 133| | 134| 0| return nullptr; 135| 0|} _ZN5Botan25MessageAuthenticationCode15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 143| 108| std::string_view provider) { 144| 108| if(auto mac = MessageAuthenticationCode::create(algo, provider)) { ------------------ | Branch (144:12): [True: 108, False: 0] ------------------ 145| 108| return mac; 146| 108| } 147| 0| throw Lookup_Error("MAC", algo, provider); 148| 108|} _ZNK5Botan8Poly130519has_keying_materialEv: 338| 271|bool Poly1305::has_keying_material() const { 339| | // Minimum size: pad(2) + accum(3) + r(3) + r^2(3) = 11 340| 271| return m_poly.size() >= 11; 341| 271|} _ZN5Botan8Poly130512key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 355| 41|void Poly1305::key_schedule(std::span key) { 356| 41| m_buffer.clear(); 357| | 358| 41| poly1305_init(m_poly, key.data()); 359| 41|} _ZN5Botan8Poly13058add_dataENSt3__14spanIKhLm18446744073709551615EEE: 377| 230|void Poly1305::add_data(std::span input) { 378| 230| assert_key_material_set(); 379| | 380| 230| BufferSlicer in(input); 381| | 382| 471| while(!in.empty()) { ------------------ | Branch (382:10): [True: 241, False: 230] ------------------ 383| 241| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (383:21): [True: 107, False: 134] ------------------ 384| 107| poly1305_blocks(m_poly, one_block->data(), 1); 385| 107| } 386| | 387| 241| if(m_buffer.in_alignment()) { ------------------ | Branch (387:10): [True: 134, False: 107] ------------------ 388| 134| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 389| 134| if(full_blocks > 0) { ------------------ | Branch (389:13): [True: 27, False: 107] ------------------ 390| 27| const uint8_t* data_ptr = aligned_data.data(); 391| 27| size_t blocks_remaining = full_blocks; 392| | 393| 27|#if defined(BOTAN_HAS_POLY1305_AVX512) 394| 27| if(blocks_remaining >= 8 * 3 && CPUID::has(CPUID::Feature::AVX512)) { ------------------ | Branch (394:16): [True: 3, False: 24] | Branch (394:45): [True: 0, False: 3] ------------------ 395| | // Lazily compute r^3 through r^8 on first AVX512 use 396| 0| poly1305_extend_powers(m_poly, 8); 397| 0| const size_t processed = poly1305_avx512_blocks(m_poly, data_ptr, blocks_remaining); 398| 0| data_ptr += processed * 16; 399| 0| blocks_remaining -= processed; 400| 0| } 401| 27|#endif 402| | 403| 27|#if defined(BOTAN_HAS_POLY1305_AVX2) 404| 27| if(blocks_remaining >= 4 * 6 && CPUID::has(CPUID::Feature::AVX2)) { ------------------ | Branch (404:16): [True: 3, False: 24] | Branch (404:45): [True: 3, False: 0] ------------------ 405| | // Lazily compute r^3 and r^4 on first AVX2 use 406| 3| poly1305_extend_powers(m_poly, 4); 407| 3| const size_t processed = poly1305_avx2_blocks(m_poly, data_ptr, blocks_remaining); 408| 3| data_ptr += processed * 16; 409| 3| blocks_remaining -= processed; 410| 3| } 411| 27|#endif 412| | 413| 27| if(blocks_remaining > 0) { ------------------ | Branch (413:16): [True: 25, False: 2] ------------------ 414| 25| poly1305_blocks(m_poly, data_ptr, blocks_remaining); 415| 25| } 416| 27| } 417| 134| } 418| 241| } 419| 230|} _ZN5Botan8Poly130512final_resultENSt3__14spanIhLm18446744073709551615EEE: 421| 41|void Poly1305::final_result(std::span out) { 422| 41| assert_key_material_set(); 423| | 424| 41| if(!m_buffer.in_alignment()) { ------------------ | Branch (424:7): [True: 0, False: 41] ------------------ 425| 0| const uint8_t final_byte = 0x01; 426| 0| m_buffer.append({&final_byte, 1}); 427| 0| m_buffer.fill_up_with_zeros(); 428| 0| poly1305_blocks(m_poly, m_buffer.consume().data(), 1, true); 429| 0| } 430| | 431| 41| poly1305_finish(m_poly, out.data()); 432| | 433| 41| m_poly.clear(); 434| 41| m_buffer.clear(); 435| 41|} poly1305.cpp:_ZN5Botan12_GLOBAL__N_113poly1305_initERNSt3__16vectorImNS_16secure_allocatorImEEEEPKh: 93| 41|void poly1305_init(secure_vector& X, const uint8_t key[32]) { 94| 41| X.clear(); 95| 41| X.reserve(2 + 3 + 2 * 3); 96| 41| X.resize(2 + 3 + 3); 97| | 98| | /* Save pad for later (first 2 slots) */ 99| 41| X[PAD_BASE + 0] = load_le(key, 2); 100| 41| X[PAD_BASE + 1] = load_le(key, 3); 101| | 102| | /* h = 0 (accumulator, next 3 slots) */ 103| 41| X[H_BASE + 0] = 0; 104| 41| X[H_BASE + 1] = 0; 105| 41| X[H_BASE + 2] = 0; 106| | 107| | /* r &= 0xffffffc0ffffffc0ffffffc0fffffff (clamping) */ 108| 41| const uint64_t t0 = load_le(key, 0); 109| 41| const uint64_t t1 = load_le(key, 1); 110| | 111| 41| const uint64_t r0 = (t0) & 0xffc0fffffff; 112| 41| const uint64_t r1 = ((t0 >> 44) | (t1 << 20)) & 0xfffffc0ffff; 113| 41| const uint64_t r2 = ((t1 >> 24)) & 0x00ffffffc0f; 114| | 115| | // Store r^1 116| 41| X[R_BASE + 0] = r0; 117| 41| X[R_BASE + 1] = r1; 118| 41| X[R_BASE + 2] = r2; 119| | 120| 41| poly1305_extend_powers(X, 2); 121| 41|} poly1305.cpp:_ZN5Botan12_GLOBAL__N_115poly1305_blocksERNSt3__16vectorImNS_16secure_allocatorImEEEEPKhmb: 224| 132|void poly1305_blocks(secure_vector& X, const uint8_t* m, size_t blocks, bool is_final = false) { 225| 132| const uint64_t hibit = is_final ? 0 : (static_cast(1) << 40); ------------------ | Branch (225:27): [True: 0, False: 132] ------------------ 226| | 227| | // Load r (at R_BASE + 0) 228| 132| const uint64_t r0 = X[R_BASE + 0]; 229| 132| const uint64_t r1 = X[R_BASE + 1]; 230| 132| const uint64_t r2 = X[R_BASE + 2]; 231| 132| const uint64_t s1 = r1 * 20; 232| 132| const uint64_t s2 = r2 * 20; 233| | 234| | // Load r^2 (at R_BASE + 3) 235| 132| const uint64_t rr0 = X[R_BASE + 3]; 236| 132| const uint64_t rr1 = X[R_BASE + 4]; 237| 132| const uint64_t rr2 = X[R_BASE + 5]; 238| | 239| | // Precompute 240| 132| const uint64_t ss1 = rr1 * 20; 241| 132| const uint64_t ss2 = rr2 * 20; 242| | 243| | // Load accumulator 244| 132| uint64_t h0 = X[H_BASE + 0]; 245| 132| uint64_t h1 = X[H_BASE + 1]; 246| 132| uint64_t h2 = X[H_BASE + 2]; 247| | 248| 170| while(blocks >= 2) { ------------------ | Branch (248:10): [True: 38, False: 132] ------------------ 249| 38| poly1305_block_pair(h0, h1, h2, r0, r1, r2, s1, s2, rr0, rr1, rr2, ss1, ss2, m, hibit); 250| 38| m += 32; 251| 38| blocks -= 2; 252| 38| } 253| | 254| | // Final block? 255| 132| if(blocks > 0) { ------------------ | Branch (255:7): [True: 125, False: 7] ------------------ 256| 125| poly1305_block_single(h0, h1, h2, r0, r1, r2, s1, s2, m, hibit); 257| 125| } 258| | 259| | // Store accumulator 260| 132| X[H_BASE + 0] = h0; 261| 132| X[H_BASE + 1] = h1; 262| 132| X[H_BASE + 2] = h2; 263| 132|} poly1305.cpp:_ZN5Botan12_GLOBAL__N_119poly1305_block_pairERmS1_S1_mmmmmmmmmmPKhm: 179| 38| uint64_t hibit) { 180| 38| constexpr uint64_t M44 = 0xFFFFFFFFFFF; 181| 38| constexpr uint64_t M42 = 0x3FFFFFFFFFF; 182| | 183| |#if !defined(BOTAN_TARGET_HAS_NATIVE_UINT128) 184| | typedef donna128 uint128_t; 185| |#endif 186| | 187| | // Load first block (will be multiplied by r^2) 188| 38| const uint64_t m0_t0 = load_le(m, 0); 189| 38| const uint64_t m0_t1 = load_le(m, 1); 190| | 191| | // Load second block (will be multiplied by r) 192| 38| const uint64_t m1_t0 = load_le(m + 16, 0); 193| 38| const uint64_t m1_t1 = load_le(m + 16, 1); 194| | 195| | // Add first block to h 196| 38| h0 += (m0_t0 & M44); 197| 38| h1 += ((m0_t0 >> 44) | (m0_t1 << 20)) & M44; 198| 38| h2 += ((m0_t1 >> 24) & M42) | hibit; 199| | 200| | // Convert second block to limbs 201| 38| const uint64_t b0 = (m1_t0 & M44); 202| 38| const uint64_t b1 = ((m1_t0 >> 44) | (m1_t1 << 20)) & M44; 203| 38| const uint64_t b2 = ((m1_t1 >> 24) & M42) | hibit; 204| | 205| | // Compute (h + m0) * r^2 + m1 * r 206| 38| const uint128_t d0 = uint128_t(h0) * rr0 + uint128_t(h1) * ss2 + uint128_t(h2) * ss1 + uint128_t(b0) * r0 + 207| 38| uint128_t(b1) * s2 + uint128_t(b2) * s1; 208| 38| const uint64_t c0 = carry_shift(d0, 44); 209| | 210| 38| const uint128_t d1 = uint128_t(h0) * rr1 + uint128_t(h1) * rr0 + uint128_t(h2) * ss2 + uint128_t(b0) * r1 + 211| 38| uint128_t(b1) * r0 + uint128_t(b2) * s2 + c0; 212| 38| const uint64_t c1 = carry_shift(d1, 44); 213| | 214| 38| const uint128_t d2 = uint128_t(h0) * rr2 + uint128_t(h1) * rr1 + uint128_t(h2) * rr0 + uint128_t(b0) * r2 + 215| 38| uint128_t(b1) * r1 + uint128_t(b2) * r0 + c1; 216| 38| const uint64_t c2 = carry_shift(d2, 42); 217| | 218| 38| h0 = (d0 & M44) + c2 * 5; 219| 38| h1 = (d1 & M44) + (h0 >> 44); 220| 38| h0 &= M44; 221| 38| h2 = d2 & M42; 222| 38|} poly1305.cpp:_ZN5Botan12_GLOBAL__N_121poly1305_block_singleERmS1_S1_mmmmmPKhm: 133| 125| uint64_t hibit) { 134| 125| constexpr uint64_t M44 = 0xFFFFFFFFFFF; 135| 125| constexpr uint64_t M42 = 0x3FFFFFFFFFF; 136| | 137| |#if !defined(BOTAN_TARGET_HAS_NATIVE_UINT128) 138| | typedef donna128 uint128_t; 139| |#endif 140| | 141| 125| const uint64_t t0 = load_le(m, 0); 142| 125| const uint64_t t1 = load_le(m, 1); 143| | 144| 125| h0 += (t0 & M44); 145| 125| h1 += ((t0 >> 44) | (t1 << 20)) & M44; 146| 125| h2 += ((t1 >> 24) & M42) | hibit; 147| | 148| 125| const uint128_t d0 = uint128_t(h0) * r0 + uint128_t(h1) * s2 + uint128_t(h2) * s1; 149| 125| const uint64_t c0 = carry_shift(d0, 44); 150| | 151| 125| const uint128_t d1 = uint128_t(h0) * r1 + uint128_t(h1) * r0 + uint128_t(h2) * s2 + c0; 152| 125| const uint64_t c1 = carry_shift(d1, 44); 153| | 154| 125| const uint128_t d2 = uint128_t(h0) * r2 + uint128_t(h1) * r1 + uint128_t(h2) * r0 + c1; 155| 125| const uint64_t c2 = carry_shift(d2, 42); 156| | 157| 125| h0 = (d0 & M44) + c2 * 5; 158| 125| h1 = (d1 & M44) + (h0 >> 44); 159| 125| h0 &= M44; 160| 125| h2 = d2 & M42; 161| 125|} poly1305.cpp:_ZN5Botan12_GLOBAL__N_122poly1305_extend_powersERNSt3__16vectorImNS_16secure_allocatorImEEEEm: 70| 44|void poly1305_extend_powers(secure_vector& X, size_t target_powers) { 71| 44| const size_t current_powers = (X.size() - 5) / 3; 72| | 73| 44| if(current_powers >= target_powers) { ------------------ | Branch (73:7): [True: 0, False: 44] ------------------ 74| 0| return; 75| 0| } 76| | 77| | // Load r^1 for multiplication 78| 44| const uint64_t r0 = X[R_BASE + 0]; 79| 44| const uint64_t r1 = X[R_BASE + 1]; 80| 44| const uint64_t r2 = X[R_BASE + 2]; 81| | 82| 44| X.resize(5 + target_powers * 3); 83| | 84| | // Compute r^(current+1) through r^target 85| 91| for(size_t i = current_powers + 1; i <= target_powers; ++i) { ------------------ | Branch (85:39): [True: 47, False: 44] ------------------ 86| 47| const size_t offset = R_BASE + (i - 1) * 3; 87| 47| poly1305_mul_44( 88| 47| X[offset + 0], X[offset + 1], X[offset + 2], X[offset - 3], X[offset - 2], X[offset - 1], r0, r1, r2); 89| 47| } 90| 44|} poly1305.cpp:_ZN5Botan12_GLOBAL__N_115poly1305_mul_44ERmS1_S1_mmmmmm: 43| 47| uint64_t b2) { 44| 47| constexpr uint64_t M44 = 0xFFFFFFFFFFF; 45| 47| constexpr uint64_t M42 = 0x3FFFFFFFFFF; 46| | 47| |#if !defined(BOTAN_TARGET_HAS_NATIVE_UINT128) 48| | typedef donna128 uint128_t; 49| |#endif 50| | 51| 47| const uint64_t s1 = b1 * 20; 52| 47| const uint64_t s2 = b2 * 20; 53| | 54| 47| const uint128_t d0 = uint128_t(a0) * b0 + uint128_t(a1) * s2 + uint128_t(a2) * s1; 55| 47| const uint64_t c0 = carry_shift(d0, 44); 56| | 57| 47| const uint128_t d1 = uint128_t(a0) * b1 + uint128_t(a1) * b0 + uint128_t(a2) * s2 + c0; 58| 47| const uint64_t c1 = carry_shift(d1, 44); 59| | 60| 47| const uint128_t d2 = uint128_t(a0) * b2 + uint128_t(a1) * b1 + uint128_t(a2) * b0 + c1; 61| 47| const uint64_t c2 = carry_shift(d2, 42); 62| | 63| 47| h0 = (d0 & M44) + c2 * 5; 64| 47| h1 = (d1 & M44) + (h0 >> 44); 65| 47| h0 &= M44; 66| 47| h2 = d2 & M42; 67| 47|} poly1305.cpp:_ZN5Botan12_GLOBAL__N_115poly1305_finishERNSt3__16vectorImNS_16secure_allocatorImEEEEPh: 265| 41|void poly1305_finish(secure_vector& X, uint8_t mac[16]) { 266| 41| constexpr uint64_t M44 = 0xFFFFFFFFFFF; 267| 41| constexpr uint64_t M42 = 0x3FFFFFFFFFF; 268| | 269| | /* fully carry h */ 270| 41| uint64_t h0 = X[H_BASE + 0]; 271| 41| uint64_t h1 = X[H_BASE + 1]; 272| 41| uint64_t h2 = X[H_BASE + 2]; 273| | 274| 41| uint64_t c = (h1 >> 44); 275| 41| h1 &= M44; 276| 41| h2 += c; 277| 41| c = (h2 >> 42); 278| 41| h2 &= M42; 279| 41| h0 += c * 5; 280| 41| c = (h0 >> 44); 281| 41| h0 &= M44; 282| 41| h1 += c; 283| 41| c = (h1 >> 44); 284| 41| h1 &= M44; 285| 41| h2 += c; 286| 41| c = (h2 >> 42); 287| 41| h2 &= M42; 288| 41| h0 += c * 5; 289| 41| c = (h0 >> 44); 290| 41| h0 &= M44; 291| 41| h1 += c; 292| | 293| | /* compute h + -p */ 294| 41| uint64_t g0 = h0 + 5; 295| 41| c = (g0 >> 44); 296| 41| g0 &= M44; 297| 41| uint64_t g1 = h1 + c; 298| 41| c = (g1 >> 44); 299| 41| g1 &= M44; 300| 41| const uint64_t g2 = h2 + c - (static_cast(1) << 42); 301| | 302| | /* select h if h < p, or h + -p if h >= p */ 303| 41| const auto h_mask = CT::Mask::expand_top_bit(g2); 304| 41| h0 = h_mask.select(h0, g0); 305| 41| h1 = h_mask.select(h1, g1); 306| 41| h2 = h_mask.select(h2, g2); 307| | 308| | /* h = (h + pad) */ 309| 41| const uint64_t t0 = X[PAD_BASE + 0]; 310| 41| const uint64_t t1 = X[PAD_BASE + 1]; 311| | 312| 41| h0 += ((t0)&M44); 313| 41| c = (h0 >> 44); 314| 41| h0 &= M44; 315| 41| h1 += (((t0 >> 44) | (t1 << 20)) & M44) + c; 316| 41| c = (h1 >> 44); 317| 41| h1 &= M44; 318| 41| h2 += (((t1 >> 24)) & M42) + c; 319| 41| h2 &= M42; 320| | 321| | /* mac = h % (2^128) */ 322| 41| h0 = ((h0) | (h1 << 44)); 323| 41| h1 = ((h1 >> 20) | (h2 << 24)); 324| | 325| 41| store_le(mac, h0, h1); 326| | 327| | /* zero out the state */ 328| 41| clear_mem(X.data(), X.size()); 329| 41|} _ZN5Botan8Poly130520poly1305_avx2_blocksERNSt3__16vectorImNS_16secure_allocatorImEEEEPKhm: 211| 3|size_t BOTAN_FN_ISA_AVX2 Poly1305::poly1305_avx2_blocks(secure_vector& X, const uint8_t m[], size_t blocks) { 212| 3| if(blocks < 4) { ------------------ | Branch (212:7): [True: 0, False: 3] ------------------ 213| 0| return 0; 214| 0| } 215| | 216| 3| const size_t incoming_blocks = blocks; 217| | 218| 3| auto h = convert_44_to_26(X[2], X[3], X[4]); 219| | 220| 3| SIMD_4x26 r0; 221| 3| SIMD_4x26 r1; 222| 3| SIMD_4x26 r2; 223| 3| SIMD_4x26 r3; 224| 3| SIMD_4x26 r4; 225| 3| load_r(r0, r1, r2, r3, r4, X); 226| | 227| 3| const auto r1_5 = r1.mul_5(); 228| 3| const auto r2_5 = r2.mul_5(); 229| 3| const auto r3_5 = r3.mul_5(); 230| 3| const auto r4_5 = r4.mul_5(); 231| | 232| 42| while(blocks >= 4) { ------------------ | Branch (232:10): [True: 39, False: 3] ------------------ 233| | // Load 4 message blocks, convert to radix 2^26, and add h to block 0 234| 39| SIMD_4x26 m0; 235| 39| SIMD_4x26 m1; 236| 39| SIMD_4x26 m2; 237| 39| SIMD_4x26 m3; 238| 39| SIMD_4x26 m4; 239| 39| load_4_blocks_26(m0, m1, m2, m3, m4, m, h); 240| | 241| 39| const auto d0 = m0 * r0 + m1 * r4_5 + m2 * r3_5 + m3 * r2_5 + m4 * r1_5; 242| 39| const auto d1 = m0 * r1 + m1 * r0 + m2 * r4_5 + m3 * r3_5 + m4 * r2_5; 243| 39| const auto d2 = m0 * r2 + m1 * r1 + m2 * r0 + m3 * r4_5 + m4 * r3_5; 244| 39| const auto d3 = m0 * r3 + m1 * r2 + m2 * r1 + m3 * r0 + m4 * r4_5; 245| 39| const auto d4 = m0 * r4 + m1 * r3 + m2 * r2 + m3 * r1 + m4 * r0; 246| | 247| 39| const uint64_t h0_64 = d0.horizontal_add64(); 248| 39| uint64_t h1_64 = d1.horizontal_add64(); 249| 39| uint64_t h2_64 = d2.horizontal_add64(); 250| 39| uint64_t h3_64 = d3.horizontal_add64(); 251| 39| uint64_t h4_64 = d4.horizontal_add64(); 252| | 253| 39| h1_64 += h0_64 >> 26; 254| 39| h[0] = static_cast(h0_64) & MASK26; 255| 39| h2_64 += h1_64 >> 26; 256| 39| h[1] = static_cast(h1_64) & MASK26; 257| 39| h3_64 += h2_64 >> 26; 258| 39| h[2] = static_cast(h2_64) & MASK26; 259| 39| h4_64 += h3_64 >> 26; 260| 39| h[3] = static_cast(h3_64) & MASK26; 261| | 262| 39| const uint64_t c = h4_64 >> 26; 263| 39| h[4] = static_cast(h4_64) & MASK26; 264| | 265| 39| uint64_t carry = c * 5; 266| 39| carry += h[0]; 267| 39| h[0] = static_cast(carry) & MASK26; 268| 39| carry >>= 26; 269| 39| carry += h[1]; 270| 39| h[1] = static_cast(carry) & MASK26; 271| 39| carry >>= 26; 272| 39| carry += h[2]; 273| 39| h[2] = static_cast(carry) & MASK26; 274| 39| carry >>= 26; 275| 39| carry += h[3]; 276| 39| h[3] = static_cast(carry) & MASK26; 277| 39| carry >>= 26; 278| 39| h[4] += static_cast(carry); 279| | 280| 39| m += 64; 281| 39| blocks -= 4; 282| 39| } 283| | 284| 3| convert_26_to_44(X[2], X[3], X[4], h); 285| | 286| 3| return (incoming_blocks - blocks); 287| 3|} poly1305_avx2.cpp:_ZN5Botan12_GLOBAL__N_116convert_44_to_26Emmm: 164| 15|BOTAN_FORCE_INLINE std::array convert_44_to_26(uint64_t r0, uint64_t r1, uint64_t r2) { 165| 15| constexpr uint64_t M44 = 0xFFFFFFFFFFF; 166| 15| constexpr uint64_t M42 = 0x3FFFFFFFFFF; 167| | 168| | // The radix-2^44 scalar reduction leaves r1 in a lazy form that may carry a 169| | // bit at position 44; fully carry before the bit-packing below, which 170| | // requires each limb to be within its nominal width. 171| 15| uint64_t c = r1 >> 44; 172| 15| r1 &= M44; 173| 15| r2 += c; 174| 15| c = r2 >> 42; 175| 15| r2 &= M42; 176| 15| r0 += c * 5; 177| 15| c = r0 >> 44; 178| 15| r0 &= M44; 179| 15| r1 += c; 180| | 181| 15| std::array out{}; 182| 15| out[0] = static_cast(r0) & MASK26; // bits 0-25 183| 15| out[1] = static_cast((r0 >> 26) | (r1 << 18)) & MASK26; // bits 26-51 184| 15| out[2] = static_cast(r1 >> 8) & MASK26; // bits 52-77 185| 15| out[3] = static_cast((r1 >> 34) | (r2 << 10)) & MASK26; // bits 78-103 186| 15| out[4] = static_cast(r2 >> 16) & MASK26; // bits 104-129 187| 15| return out; 188| 15|} poly1305_avx2.cpp:_ZN5Botan12_GLOBAL__N_19SIMD_4x26C2Ev: 30| 210| BOTAN_FN_ISA_AVX2 SIMD_4x26() : m_v(_mm256_setzero_si256()) {} poly1305_avx2.cpp:_ZN5Botan12_GLOBAL__N_16load_rERNS0_9SIMD_4x26ES2_S2_S2_S2_RKNSt3__16vectorImNS_16secure_allocatorImEEEE: 191| 3|load_r(SIMD_4x26& r0, SIMD_4x26& r1, SIMD_4x26& r2, SIMD_4x26& r3, SIMD_4x26& r4, const secure_vector& X) { 192| | // TODO do this in vector registers instead 193| 3| const auto t = convert_44_to_26(X[5], X[6], X[7]); 194| 3| const auto t2 = convert_44_to_26(X[8], X[9], X[10]); 195| 3| const auto t3 = convert_44_to_26(X[11], X[12], X[13]); 196| 3| const auto t4 = convert_44_to_26(X[14], X[15], X[16]); 197| | 198| 3| r0 = SIMD_4x26::set(t4[0], t3[0], t2[0], t[0]); 199| 3| r1 = SIMD_4x26::set(t4[1], t3[1], t2[1], t[1]); 200| 3| r2 = SIMD_4x26::set(t4[2], t3[2], t2[2], t[2]); 201| 3| r3 = SIMD_4x26::set(t4[3], t3[3], t2[3], t[3]); 202| 3| r4 = SIMD_4x26::set(t4[4], t3[4], t2[4], t[4]); 203| 3|} poly1305_avx2.cpp:_ZN5Botan12_GLOBAL__N_19SIMD_4x263setEjjjj: 36| 15| static BOTAN_FN_ISA_AVX2 SIMD_4x26 set(uint32_t v3, uint32_t v2, uint32_t v1, uint32_t v0) { 37| 15| return SIMD_4x26(_mm256_set_epi32(0, v3, 0, v2, 0, v1, 0, v0)); 38| 15| } poly1305_avx2.cpp:_ZN5Botan12_GLOBAL__N_19SIMD_4x26C2EDv4_x: 61| 1.97k| explicit BOTAN_FN_ISA_AVX2 SIMD_4x26(__m256i v) : m_v(v) {} poly1305_avx2.cpp:_ZNK5Botan12_GLOBAL__N_19SIMD_4x265mul_5Ev: 41| 12| BOTAN_FN_ISA_AVX2 SIMD_4x26 mul_5() const { return SIMD_4x26(_mm256_add_epi32(_mm256_slli_epi32(m_v, 2), m_v)); } poly1305_avx2.cpp:_ZN5Botan12_GLOBAL__N_116load_4_blocks_26ERNS0_9SIMD_4x26ES2_S2_S2_S2_PKhNSt3__15arrayIjLm5EEE: 80| 39| std::array h) { 81| | // Load 64 bytes (4 blocks of 16 bytes each) 82| 39| const __m256i d0 = _mm256_loadu_si256(reinterpret_cast(m)); 83| 39| const __m256i d1 = _mm256_loadu_si256(reinterpret_cast(m + 32)); 84| | 85| | // Deinterleave: extract low 64-bit (t0) and high 64-bit (t1) from each block 86| | // unpacklo/hi work within 128-bit lanes: pairs adjacent blocks 87| 39| const __m256i t0_mixed = _mm256_unpacklo_epi64(d0, d1); // [blk3_lo, blk1_lo, blk2_lo, blk0_lo] 88| 39| const __m256i t1_mixed = _mm256_unpackhi_epi64(d0, d1); // [blk3_hi, blk1_hi, blk2_hi, blk0_hi] 89| | 90| 39| const __m256i t0 = _mm256_permute4x64_epi64(t0_mixed, 0b00100111); 91| 39| const __m256i t1 = _mm256_permute4x64_epi64(t1_mixed, 0b00100111); 92| | 93| | // Constants for radix conversion 94| 39| const __m256i mask26 = _mm256_set1_epi64x(MASK26); 95| 39| const __m256i hibit_vec = _mm256_set1_epi64x(1 << 24); 96| | 97| | // Convert to radix 2^26: 98| | // limb0 = t0[25:0] 99| | // limb1 = t0[51:26] 100| | // limb2 = t0[63:52] | t1[13:0] << 12 (bits 52-77) 101| | // limb3 = t1[39:14] (bits 78-103) 102| | // limb4 = t1[63:40] | hibit (bits 104-127 + 2^128 marker) 103| 39| __m256i limb0 = _mm256_and_si256(t0, mask26); 104| 39| __m256i limb1 = _mm256_and_si256(_mm256_srli_epi64(t0, 26), mask26); 105| 39| __m256i limb2 = _mm256_and_si256(_mm256_or_si256(_mm256_srli_epi64(t0, 52), _mm256_slli_epi64(t1, 12)), mask26); 106| 39| __m256i limb3 = _mm256_and_si256(_mm256_srli_epi64(t1, 14), mask26); 107| 39| __m256i limb4 = _mm256_or_si256(_mm256_srli_epi64(t1, 40), hibit_vec); 108| | 109| | // Add h to lane 3 (block 0): h + m[0] before multiply by r^4 110| 39| limb0 = _mm256_add_epi64(limb0, _mm256_set_epi64x(h[0], 0, 0, 0)); 111| 39| limb1 = _mm256_add_epi64(limb1, _mm256_set_epi64x(h[1], 0, 0, 0)); 112| 39| limb2 = _mm256_add_epi64(limb2, _mm256_set_epi64x(h[2], 0, 0, 0)); 113| 39| limb3 = _mm256_add_epi64(limb3, _mm256_set_epi64x(h[3], 0, 0, 0)); 114| 39| limb4 = _mm256_add_epi64(limb4, _mm256_set_epi64x(h[4], 0, 0, 0)); 115| | 116| 39| msg_0 = SIMD_4x26::from_raw(limb0); 117| 39| msg_1 = SIMD_4x26::from_raw(limb1); 118| 39| msg_2 = SIMD_4x26::from_raw(limb2); 119| 39| msg_3 = SIMD_4x26::from_raw(limb3); 120| 39| msg_4 = SIMD_4x26::from_raw(limb4); 121| 39|} poly1305_avx2.cpp:_ZN5Botan12_GLOBAL__N_19SIMD_4x268from_rawEDv4_x: 33| 195| static BOTAN_FN_ISA_AVX2 SIMD_4x26 from_raw(__m256i v) { return SIMD_4x26(v); } poly1305_avx2.cpp:_ZN5Botan12_GLOBAL__N_1plERKNS0_9SIMD_4x26ES3_: 43| 780| friend SIMD_4x26 BOTAN_FN_ISA_AVX2 operator+(const SIMD_4x26& x, const SIMD_4x26& y) { 44| 780| return SIMD_4x26(_mm256_add_epi64(x.raw(), y.raw())); 45| 780| } poly1305_avx2.cpp:_ZNK5Botan12_GLOBAL__N_19SIMD_4x263rawEv: 58| 3.51k| __m256i BOTAN_FN_ISA_AVX2 raw() const { return m_v; } poly1305_avx2.cpp:_ZN5Botan12_GLOBAL__N_1mlERKNS0_9SIMD_4x26ES3_: 47| 975| friend SIMD_4x26 BOTAN_FN_ISA_AVX2 operator*(const SIMD_4x26& x, const SIMD_4x26& y) { 48| 975| return SIMD_4x26(_mm256_mul_epi32(x.raw(), y.raw())); 49| 975| } poly1305_avx2.cpp:_ZNK5Botan12_GLOBAL__N_19SIMD_4x2616horizontal_add64Ev: 52| 195| BOTAN_FN_ISA_AVX2 uint64_t horizontal_add64() const { 53| 195| uint64_t tmp[4]; 54| 195| _mm256_storeu_si256(reinterpret_cast<__m256i*>(tmp), m_v); 55| 195| return tmp[0] + tmp[1] + tmp[2] + tmp[3]; 56| 195| } poly1305_avx2.cpp:_ZN5Botan12_GLOBAL__N_116convert_26_to_44ERmS1_S1_NSt3__15arrayIjLm5EEE: 129| 3| const std::array in) { 130| 3| constexpr uint64_t M44 = 0xFFFFFFFFFFF; 131| 3| constexpr uint64_t M42 = 0x3FFFFFFFFFF; 132| | 133| | // Expand to 64 bits 134| 3| uint64_t i0 = in[0]; 135| 3| uint64_t i1 = in[1]; 136| 3| uint64_t i2 = in[2]; 137| 3| uint64_t i3 = in[3]; 138| 3| uint64_t i4 = in[4]; 139| | 140| | // i4 may hold a bit at position 26 (a 2^130 term); fully carry before the 141| | // bit-packing below, which requires each limb to be within 26 bits. 142| 3| uint64_t c = i4 >> 26; 143| 3| i4 &= MASK26; 144| 3| i0 += c * 5; 145| 3| c = i0 >> 26; 146| 3| i0 &= MASK26; 147| 3| i1 += c; 148| 3| c = i1 >> 26; 149| 3| i1 &= MASK26; 150| 3| i2 += c; 151| 3| c = i2 >> 26; 152| 3| i2 &= MASK26; 153| 3| i3 += c; 154| 3| c = i3 >> 26; 155| 3| i3 &= MASK26; 156| 3| i4 += c; 157| | 158| 3| r0 = (i0 | (i1 << 26)) & M44; 159| 3| r1 = ((i1 >> 18) | (i2 << 8) | (i3 << 34)) & M44; 160| 3| r2 = ((i3 >> 10) | (i4 << 16)) & M42; 161| 3|} _ZN5Botan6BigInt17from_radix_digitsENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEm: 126| 36|BigInt BigInt::from_radix_digits(std::string_view digits, size_t radix) { 127| 36| if(radix == 16) { ------------------ | Branch (127:7): [True: 36, False: 0] ------------------ 128| 36| secure_vector binary; 129| | 130| 36| if(digits.size() % 2 == 1) { ------------------ | Branch (130:10): [True: 5, False: 31] ------------------ 131| | // Handle lack of leading 0 132| 5| const char buf0_with_leading_0[2] = {'0', digits[0]}; 133| | 134| 5| binary = hex_decode_locked(buf0_with_leading_0, 2); 135| | 136| 5| if(digits.size() > 1) { ------------------ | Branch (136:13): [True: 5, False: 0] ------------------ 137| 5| binary += hex_decode_locked(&digits[1], digits.size() - 1, false); 138| 5| } 139| 31| } else { 140| 31| binary = hex_decode_locked(digits, false); 141| 31| } 142| | 143| 36| return BigInt::from_bytes(binary); 144| 36| } 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| 36|} _ZN5Botan6BigInt4add2ERKS0_PKmmNS0_4SignE: 20| 18|BigInt BigInt::add2(const BigInt& x, const word y[], size_t y_size, BigInt::Sign y_sign) { 21| 18| const size_t x_sw = x.sig_words(); 22| | 23| 18| BigInt z = BigInt::with_capacity(std::max(x_sw, y_size) + 1); 24| | 25| 18| if(x.sign() == y_sign) { ------------------ | Branch (25:7): [True: 12, False: 6] ------------------ 26| 12| const word carry = bigint_add3(z.mutable_data(), x._data(), x_sw, y, y_size); 27| 12| z.mutable_data()[std::max(x_sw, y_size)] += carry; 28| 12| z.set_sign(x.sign()); 29| 12| } else { 30| 6| const int32_t relative_size = bigint_cmp(x.data(), x_sw, y, y_size); 31| | 32| 6| if(relative_size < 0) { ------------------ | Branch (32:10): [True: 0, False: 6] ------------------ 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| 6| } else if(relative_size == 0) { ------------------ | Branch (37:17): [True: 0, False: 6] ------------------ 38| | // Positive zero (nothing to do in this case) 39| 6| } 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| 6| y_size = std::min(x_sw, y_size); 46| 6| bigint_sub3(z.mutable_data(), x.data(), x_sw, y, y_size); 47| 6| z.set_sign(x.sign()); 48| 6| } 49| 6| } 50| | 51| 18| return z; 52| 18|} _ZN5Botan6BigIntC2Em: 18| 11.6k|BigInt::BigInt(uint64_t n) { 19| 11.6k| if constexpr(sizeof(word) == 8) { 20| 11.6k| 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| 11.6k|} _ZN5Botan6BigInt8from_u64Em: 28| 11.6k|BigInt BigInt::from_u64(uint64_t n) { 29| 11.6k| return BigInt(n); 30| 11.6k|} _ZN5Botan6BigInt13with_capacityEm: 49| 30|BigInt BigInt::with_capacity(size_t size) { 50| 30| BigInt bn; 51| 30| bn.grow_to(size); 52| 30| return bn; 53| 30|} _ZN5Botan6BigInt11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 55| 36|BigInt BigInt::from_string(std::string_view str) { 56| 36| size_t prefix_bytes = 0; 57| 36| bool negative = false; 58| 36| size_t radix = 10; 59| | 60| 36| if(!str.empty() && str[0] == '-') { ------------------ | Branch (60:7): [True: 36, False: 0] | Branch (60:23): [True: 0, False: 36] ------------------ 61| 0| prefix_bytes += 1; 62| 0| negative = true; 63| 0| } 64| | 65| 36| if(str.length() > prefix_bytes + 2 && str[prefix_bytes] == '0' && str[prefix_bytes + 1] == 'x') { ------------------ | Branch (65:7): [True: 36, False: 0] | Branch (65:42): [True: 36, False: 0] | Branch (65:70): [True: 36, False: 0] ------------------ 66| 36| prefix_bytes += 2; 67| 36| radix = 16; 68| 36| } 69| | 70| 36| BigInt r = BigInt::from_radix_digits(str.substr(prefix_bytes), radix); 71| | 72| 36| if(negative) { ------------------ | Branch (72:7): [True: 0, False: 36] ------------------ 73| 0| r.set_sign(Negative); 74| 36| } else { 75| 36| r.set_sign(Positive); 76| 36| } 77| | 78| 36| return r; 79| 36|} _ZN5Botan6BigInt10from_bytesENSt3__14spanIKhLm18446744073709551615EEE: 81| 41.4k|BigInt BigInt::from_bytes(std::span input) { 82| 41.4k| BigInt r; 83| 41.4k| r.assign_from_bytes(input); 84| 41.4k| return r; 85| 41.4k|} _ZNK5Botan6BigInt7byte_atEm: 116| 75.2k|uint8_t BigInt::byte_at(size_t n) const { 117| 75.2k| return get_byte_var(sizeof(word) - (n % sizeof(word)) - 1, word_at(n / sizeof(word))); 118| 75.2k|} _ZNK5Botan6BigInt8cmp_wordEm: 120| 50.7k|int32_t BigInt::cmp_word(word other) const { 121| 50.7k| if(signum() < 0) { ------------------ | Branch (121:7): [True: 21, False: 50.7k] ------------------ 122| 21| return -1; // other is positive ... 123| 21| } 124| | 125| 50.7k| const size_t sw = this->sig_words(); 126| 50.7k| if(sw > 1) { ------------------ | Branch (126:7): [True: 38.9k, False: 11.7k] ------------------ 127| 38.9k| return 1; // must be larger since other is just one word ... 128| 38.9k| } 129| | 130| 11.7k| return bigint_cmp(this->_data(), sw, &other, 1); 131| 50.7k|} _ZNK5Botan6BigInt3cmpERKS0_b: 136| 32.7k|int32_t BigInt::cmp(const BigInt& other, bool check_signs) const { 137| 32.7k| if(check_signs) { ------------------ | Branch (137:7): [True: 32.7k, False: 0] ------------------ 138| 32.7k| if(other.signum() >= 0 && this->signum() < 0) { ------------------ | Branch (138:10): [True: 32.7k, False: 0] | Branch (138:33): [True: 0, False: 32.7k] ------------------ 139| 0| return -1; 140| 0| } 141| | 142| 32.7k| if(other.signum() < 0 && this->signum() >= 0) { ------------------ | Branch (142:10): [True: 0, False: 32.7k] | Branch (142:32): [True: 0, False: 0] ------------------ 143| 0| return 1; 144| 0| } 145| | 146| 32.7k| if(other.signum() < 0 && this->signum() < 0) { ------------------ | Branch (146:10): [True: 0, False: 32.7k] | Branch (146:32): [True: 0, False: 0] ------------------ 147| 0| return (-bigint_cmp(this->_data(), this->size(), other._data(), other.size())); 148| 0| } 149| 32.7k| } 150| | 151| 32.7k| return bigint_cmp(this->_data(), this->size(), other._data(), other.size()); 152| 32.7k|} _ZNK5Botan6BigInt8is_equalERKS0_: 154| 12|bool BigInt::is_equal(const BigInt& other) const { 155| 12| if(this->sign() != other.sign()) { ------------------ | Branch (155:7): [True: 0, False: 12] ------------------ 156| 0| return false; 157| 0| } 158| | 159| 12| return bigint_ct_is_eq(this->_data(), this->size(), other._data(), other.size()).as_bool(); 160| 12|} _ZNK5Botan6BigInt12is_less_thanERKS0_: 162| 6|bool BigInt::is_less_than(const BigInt& other) const { 163| 6| if(this->signum() < 0 && other.signum() >= 0) { ------------------ | Branch (163:7): [True: 0, False: 6] | Branch (163:29): [True: 0, False: 0] ------------------ 164| 0| return true; 165| 0| } 166| | 167| 6| if(this->signum() >= 0 && other.signum() < 0) { ------------------ | Branch (167:7): [True: 6, False: 0] | Branch (167:30): [True: 0, False: 6] ------------------ 168| 0| return false; 169| 0| } 170| | 171| 6| if(other.signum() < 0 && this->signum() < 0) { ------------------ | Branch (171:7): [True: 0, False: 6] | 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| 6| return bigint_ct_is_lt(this->_data(), this->size(), other._data(), other.size()).as_bool(); 176| 6|} _ZN5Botan6BigInt4Data11set_to_zeroEv: 189| 66.5k|void BigInt::Data::set_to_zero() { 190| 66.5k| m_reg.resize(m_reg.capacity()); 191| 66.5k| clear_mem(m_reg.data(), m_reg.size()); 192| 66.5k| m_sig_words = 0; 193| 66.5k|} _ZNK5Botan6BigInt4Data14calc_sig_wordsEv: 213| 69.6k|size_t BigInt::Data::calc_sig_words() const { 214| 69.6k| const size_t sz = m_reg.size(); 215| 69.6k| size_t sig = sz; 216| | 217| 69.6k| word sub = 1; 218| | 219| 635k| for(size_t i = 0; i != sz; ++i) { ------------------ | Branch (219:22): [True: 566k, False: 69.6k] ------------------ 220| 566k| const word w = m_reg[sz - i - 1]; 221| 566k| sub &= ct_is_zero(w); 222| 566k| sig -= sub; 223| 566k| } 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| 69.6k| CT::unpoison(sig); 230| | 231| 69.6k| return sig; 232| 69.6k|} _ZNK5Botan6BigInt5bytesEv: 292| 35.9k|size_t BigInt::bytes() const { 293| 35.9k| return ceil_tobytes(bits()); 294| 35.9k|} _ZNK5Botan6BigInt13top_bits_freeEv: 296| 48.4k|size_t BigInt::top_bits_free() const { 297| 48.4k| const size_t words = sig_words(); 298| | 299| 48.4k| const word top_word = word_at(words - 1); 300| 48.4k| const size_t bits_used = high_bit(CT::value_barrier(top_word)); 301| 48.4k| CT::unpoison(bits_used); 302| 48.4k| return WordInfo::bits - bits_used; 303| 48.4k|} _ZNK5Botan6BigInt4bitsEv: 305| 54.7k|size_t BigInt::bits() const { 306| 54.7k| const size_t words = sig_words(); 307| | 308| 54.7k| if(words == 0) { ------------------ | Branch (308:7): [True: 6.26k, False: 48.4k] ------------------ 309| 6.26k| return 0; 310| 6.26k| } 311| | 312| 48.4k| const size_t full_words = (words - 1) * WordInfo::bits; 313| 48.4k| const size_t top_bits = WordInfo::bits - top_bits_free(); 314| | 315| 48.4k| return full_words + top_bits; 316| 54.7k|} _ZNK5Botan6BigInt12serialize_toENSt3__14spanIhLm18446744073709551615EEE: 393| 17.9k|void BigInt::serialize_to(std::span output) const { 394| 17.9k| BOTAN_ARG_CHECK(this->bytes() <= output.size(), "Insufficient output space"); ------------------ | | 35| 17.9k| do { \ | | 36| 17.9k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 17.9k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 17.9k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 17.9k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 17.9k] | | ------------------ ------------------ 395| | 396| 17.9k| this->binary_encode(output.data(), output.size()); 397| 17.9k|} _ZNK5Botan6BigInt13binary_encodeEPhm: 402| 17.9k|void BigInt::binary_encode(uint8_t output[], size_t len) const { 403| 17.9k| const size_t full_words = len / sizeof(word); 404| 17.9k| const size_t extra_bytes = len % sizeof(word); 405| | 406| 30.4k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (406:22): [True: 12.5k, False: 17.9k] ------------------ 407| 12.5k| const word w = word_at(i); 408| 12.5k| store_be(w, output + (len - (i + 1) * sizeof(word))); 409| 12.5k| } 410| | 411| 17.9k| if(extra_bytes > 0) { ------------------ | Branch (411:7): [True: 17.9k, False: 0] ------------------ 412| 17.9k| const word w = word_at(full_words); 413| | 414| 47.7k| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (414:25): [True: 29.8k, False: 17.9k] ------------------ 415| 29.8k| output[extra_bytes - i - 1] = get_byte_var(sizeof(word) - i - 1, w); 416| 29.8k| } 417| 17.9k| } 418| 17.9k|} _ZN5Botan6BigInt17assign_from_bytesENSt3__14spanIKhLm18446744073709551615EEE: 423| 66.5k|void BigInt::assign_from_bytes(std::span bytes) { 424| 66.5k| clear(); 425| | 426| 66.5k| const size_t length = bytes.size(); 427| 66.5k| const size_t full_words = length / sizeof(word); 428| 66.5k| const size_t extra_bytes = length % sizeof(word); 429| | 430| 66.5k| const size_t total_words = full_words + (extra_bytes > 0 ? 1 : 0); ------------------ | Branch (430:45): [True: 26.4k, False: 40.1k] ------------------ 431| | 432| 66.5k| secure_vector reg(8 * ceil_division(total_words, 8)); 433| | 434| 262k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (434:22): [True: 195k, False: 66.5k] ------------------ 435| 195k| reg[i] = load_be(bytes.last()); 436| 195k| bytes = bytes.first(bytes.size() - sizeof(word)); 437| 195k| } 438| | 439| 66.5k| if(!bytes.empty()) { ------------------ | Branch (439:7): [True: 26.4k, False: 40.1k] ------------------ 440| 26.4k| BOTAN_ASSERT_NOMSG(extra_bytes == bytes.size()); ------------------ | | 84| 26.4k| do { \ | | 85| 26.4k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 26.4k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 26.4k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 26.4k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 26.4k] | | ------------------ ------------------ 441| 26.4k| std::array last_partial_word = {0}; 442| 26.4k| copy_mem(std::span{last_partial_word}.last(extra_bytes), bytes); 443| 26.4k| reg[full_words] = load_be(last_partial_word); 444| 26.4k| } 445| | 446| 66.5k| m_data.swap(reg); 447| 66.5k|} _ZNK5Botan6BigInt20_const_time_unpoisonEv: 559| 202k|void BigInt::_const_time_unpoison() const { 560| 202k| CT::unpoison(m_data.const_data(), m_data.size()); 561| 202k|} _ZN5Botan15ct_divide_pow2kEmRKNS_6BigIntE: 194| 18|BigInt ct_divide_pow2k(size_t k, const BigInt& y) { 195| 18| BOTAN_ARG_CHECK(y.signum() != 0, "Cannot divide by zero"); ------------------ | | 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] | | ------------------ ------------------ 196| 18| BOTAN_ARG_CHECK(y.signum() >= 0, "Negative divisor not supported"); ------------------ | | 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] | | ------------------ ------------------ 197| 18| BOTAN_ARG_CHECK(k > 1, "Invalid k"); ------------------ | | 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] | | ------------------ ------------------ 198| | 199| 18| BigInt q; 200| 18| BigInt r; 201| 18| ct_divide_impl(q, r, BigInt::power_of_2(k), y); 202| 18| return q; 203| 18|} divide.cpp:_ZN5Botan12_GLOBAL__N_114ct_divide_implERNS_6BigIntES2_RKS1_S4_: 66| 18|void ct_divide_impl(BigInt& q_out, BigInt& r_out, const BigInt& x, const BigInt& y) { 67| 18| constexpr size_t WB = WordInfo::bits; 68| | 69| 18| const size_t x_words = x.sig_words(); 70| 18| const size_t y_words = y.sig_words(); 71| 18| BOTAN_ASSERT_NOMSG(y_words > 0); ------------------ | | 84| 18| do { \ | | 85| 18| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 18| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 18] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 18| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 18] | | ------------------ ------------------ 72| | 73| 18| if(x_words < y_words) { ------------------ | Branch (73:7): [True: 0, False: 18] ------------------ 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| 18| const size_t r_words = x_words + 1; 81| 18| const size_t q_words = x_words - y_words + 1; 82| | 83| | // The number of leading zero bits of y, in [0,WB) 84| 18| const word s = static_cast(WB) - static_cast(high_bit(CT::value_barrier(y._data()[y_words - 1]))); 85| 18| const auto s_mask = CT::Mask::expand(s); 86| 18| const word s_comp = s_mask.if_set_return(static_cast(WB) - s); 87| | 88| 18| secure_vector yn(y_words); 89| 18| secure_vector rw(r_words); 90| 18| 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| 18| word carry = 0; 95| 129| for(size_t i = 0; i != y_words; ++i) { ------------------ | Branch (95:22): [True: 111, False: 18] ------------------ 96| 111| const word w = y._data()[i]; 97| 111| yn[i] = (w << s) | carry; 98| 111| carry = s_mask.if_set_return(w >> s_comp); 99| 111| } 100| | 101| 18| carry = 0; 102| 258| for(size_t i = 0; i != x_words; ++i) { ------------------ | Branch (102:22): [True: 240, False: 18] ------------------ 103| 240| const word w = x._data()[i]; 104| 240| rw[i] = (w << s) | carry; 105| 240| carry = s_mask.if_set_return(w >> s_comp); 106| 240| } 107| 18| rw[x_words] = carry; 108| | 109| 18| const auto div_by_yn = divide_precomp::setup(CT::value_barrier(yn[y_words - 1])); 110| | 111| 18| if(y_words == 1) { ------------------ | Branch (111:7): [True: 0, False: 18] ------------------ 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| 0| word r = rw[x_words]; 117| 0| for(size_t i = x_words; i > 0; --i) { ------------------ | Branch (117:31): [True: 0, False: 0] ------------------ 118| 0| const auto [qi, ri] = div_by_yn.divmod_2to1_ct(r, rw[i - 1]); 119| 0| qw[i - 1] = qi; 120| 0| r = ri; 121| 0| } 122| | 123| 0| rw[0] = r >> s; 124| 18| } else { 125| 18| const word yn1 = yn[y_words - 1]; 126| 18| const word yn2 = yn[y_words - 2]; 127| | 128| 165| for(size_t i = q_words; i > 0; --i) { ------------------ | Branch (128:31): [True: 147, False: 18] ------------------ 129| 147| const size_t j = i - 1; // current window is rw[j ... j + y_words] 130| | 131| 147| const word u2 = rw[j + y_words]; 132| 147| const word u1 = rw[j + y_words - 1]; 133| 147| 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| 147| const auto top_eq = CT::Mask::is_equal(u2, yn1); 142| 147| const word q_est = div_by_yn.divmod_2to1_ct(u2, u1).first; 143| 147| word qhat = top_eq.select(WordInfo::max, q_est); 144| | 145| | // Per HAC 14.23, this correction is required at most twice 146| 147| qhat -= division_check_ct(qhat, yn1, yn2, u2, u1, u0).if_set_return(1); 147| 147| qhat -= division_check_ct(qhat, yn1, yn2, u2, u1, u0).if_set_return(1); 148| | 149| | // Subtract qhat * yn from the window 150| 147| const word bw = bigint_submul(&rw[j], yn.data(), y_words, qhat); 151| 147| word borrow = 0; 152| 147| 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| 147| const word cb = bigint_cnd_add(borrow, &rw[j], yn.data(), y_words); 157| 147| rw[j + y_words] += cb; 158| 147| qhat -= borrow; 159| | 160| 147| qw[j] = qhat; 161| 147| } 162| | 163| | // The remainder is in rw[0:y_words], still shifted left by s, and 164| | // rw[y_words] is zero 165| 129| for(size_t i = 0; i != y_words; ++i) { ------------------ | Branch (165:25): [True: 111, False: 18] ------------------ 166| 111| rw[i] = (rw[i] >> s) | s_mask.if_set_return(CT::value_barrier(rw[i + 1]) << s_comp); 167| 111| } 168| 18| } 169| | 170| 18| BigInt q = BigInt::_from_words(qw); 171| 18| rw.resize(y_words); 172| 18| BigInt r = BigInt::_from_words(rw); 173| | 174| 18| r_out = std::move(r); 175| 18| q_out = std::move(q); 176| 18|} divide.cpp:_ZN5Botan12_GLOBAL__N_117division_check_ctEmmmmmm: 39| 294|inline CT::Mask division_check_ct(word q, word y2, word y1, word x3, word x2, word x1) { 40| 294| word y3 = 0; 41| 294| y1 = word_madd2(q, y1, &y3); 42| 294| y2 = word_madd2(q, y2, &y3); 43| | 44| 294| const auto gt3 = CT::Mask::is_gt(y3, x3); 45| 294| const auto eq3 = CT::Mask::is_equal(y3, x3); 46| 294| const auto gt2 = CT::Mask::is_gt(y2, x2); 47| 294| const auto eq2 = CT::Mask::is_equal(y2, x2); 48| 294| const auto gt1 = CT::Mask::is_gt(y1, x1); 49| | 50| 294| return gt3 | (eq3 & (gt2 | (eq2 & gt1))); 51| 294|} _ZN5Botan17bigint_comba_sqr4EPmPKm: 22| 4.13M|void bigint_comba_sqr4(word z[8], const word x[4]) { 23| 4.13M|#if defined(BOTAN_HAS_MP_MULX) 24| 4.13M| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (24:7): [True: 4.13M, False: 0] ------------------ 25| 4.13M| return bigint_mulx_sqr4(z, x); 26| 4.13M| } 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| 3.95M|void bigint_comba_mul4(word z[8], const word x[4], const word y[4]) { 55| 3.95M|#if defined(BOTAN_HAS_MP_MULX) 56| 3.95M| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (56:7): [True: 3.95M, False: 0] ------------------ 57| 3.95M| return bigint_mulx_mul4(z, x, y); 58| 3.95M| } 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| 1.62M|void bigint_comba_sqr6(word z[12], const word x[6]) { 93| 1.62M|#if defined(BOTAN_HAS_MP_MULX) 94| 1.62M| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (94:7): [True: 1.62M, False: 0] ------------------ 95| 1.62M| return bigint_mulx_sqr6(z, x); 96| 1.62M| } 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.56M|void bigint_comba_mul6(word z[12], const word x[6], const word y[6]) { 140| 1.56M|#if defined(BOTAN_HAS_MP_MULX) 141| 1.56M| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (141:7): [True: 1.56M, False: 0] ------------------ 142| 1.56M| return bigint_mulx_mul6(z, x, y); 143| 1.56M| } 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_sqr7EPmPKm: 201| 40.3k|void bigint_comba_sqr7(word z[14], const word x[7]) { 202| 40.3k| word3 accum; 203| | 204| 40.3k| accum.mul(x[0], x[0]); 205| 40.3k| z[0] = accum.extract(); 206| 40.3k| accum.mul_x2(x[0], x[1]); 207| 40.3k| z[1] = accum.extract(); 208| 40.3k| accum.mul_x2(x[0], x[2]); 209| 40.3k| accum.mul(x[1], x[1]); 210| 40.3k| z[2] = accum.extract(); 211| 40.3k| accum.mul_x2(x[0], x[3]); 212| 40.3k| accum.mul_x2(x[1], x[2]); 213| 40.3k| z[3] = accum.extract(); 214| 40.3k| accum.mul_x2(x[0], x[4]); 215| 40.3k| accum.mul_x2(x[1], x[3]); 216| 40.3k| accum.mul(x[2], x[2]); 217| 40.3k| z[4] = accum.extract(); 218| 40.3k| accum.mul_x2(x[0], x[5]); 219| 40.3k| accum.mul_x2(x[1], x[4]); 220| 40.3k| accum.mul_x2(x[2], x[3]); 221| 40.3k| z[5] = accum.extract(); 222| 40.3k| accum.mul_x2(x[0], x[6]); 223| 40.3k| accum.mul_x2(x[1], x[5]); 224| 40.3k| accum.mul_x2(x[2], x[4]); 225| 40.3k| accum.mul(x[3], x[3]); 226| 40.3k| z[6] = accum.extract(); 227| 40.3k| accum.mul_x2(x[1], x[6]); 228| 40.3k| accum.mul_x2(x[2], x[5]); 229| 40.3k| accum.mul_x2(x[3], x[4]); 230| 40.3k| z[7] = accum.extract(); 231| 40.3k| accum.mul_x2(x[2], x[6]); 232| 40.3k| accum.mul_x2(x[3], x[5]); 233| 40.3k| accum.mul(x[4], x[4]); 234| 40.3k| z[8] = accum.extract(); 235| 40.3k| accum.mul_x2(x[3], x[6]); 236| 40.3k| accum.mul_x2(x[4], x[5]); 237| 40.3k| z[9] = accum.extract(); 238| 40.3k| accum.mul_x2(x[4], x[6]); 239| 40.3k| accum.mul(x[5], x[5]); 240| 40.3k| z[10] = accum.extract(); 241| 40.3k| accum.mul_x2(x[5], x[6]); 242| 40.3k| z[11] = accum.extract(); 243| 40.3k| accum.mul(x[6], x[6]); 244| 40.3k| z[12] = accum.extract(); 245| 40.3k| z[13] = accum.extract(); 246| 40.3k|} _ZN5Botan17bigint_comba_mul7EPmPKmS2_: 251| 40.5k|void bigint_comba_mul7(word z[14], const word x[7], const word y[7]) { 252| 40.5k| word3 accum; 253| | 254| 40.5k| accum.mul(x[0], y[0]); 255| 40.5k| z[0] = accum.extract(); 256| 40.5k| accum.mul(x[0], y[1]); 257| 40.5k| accum.mul(x[1], y[0]); 258| 40.5k| z[1] = accum.extract(); 259| 40.5k| accum.mul(x[0], y[2]); 260| 40.5k| accum.mul(x[1], y[1]); 261| 40.5k| accum.mul(x[2], y[0]); 262| 40.5k| z[2] = accum.extract(); 263| 40.5k| accum.mul(x[0], y[3]); 264| 40.5k| accum.mul(x[1], y[2]); 265| 40.5k| accum.mul(x[2], y[1]); 266| 40.5k| accum.mul(x[3], y[0]); 267| 40.5k| z[3] = accum.extract(); 268| 40.5k| accum.mul(x[0], y[4]); 269| 40.5k| accum.mul(x[1], y[3]); 270| 40.5k| accum.mul(x[2], y[2]); 271| 40.5k| accum.mul(x[3], y[1]); 272| 40.5k| accum.mul(x[4], y[0]); 273| 40.5k| z[4] = accum.extract(); 274| 40.5k| accum.mul(x[0], y[5]); 275| 40.5k| accum.mul(x[1], y[4]); 276| 40.5k| accum.mul(x[2], y[3]); 277| 40.5k| accum.mul(x[3], y[2]); 278| 40.5k| accum.mul(x[4], y[1]); 279| 40.5k| accum.mul(x[5], y[0]); 280| 40.5k| z[5] = accum.extract(); 281| 40.5k| accum.mul(x[0], y[6]); 282| 40.5k| accum.mul(x[1], y[5]); 283| 40.5k| accum.mul(x[2], y[4]); 284| 40.5k| accum.mul(x[3], y[3]); 285| 40.5k| accum.mul(x[4], y[2]); 286| 40.5k| accum.mul(x[5], y[1]); 287| 40.5k| accum.mul(x[6], y[0]); 288| 40.5k| z[6] = accum.extract(); 289| 40.5k| accum.mul(x[1], y[6]); 290| 40.5k| accum.mul(x[2], y[5]); 291| 40.5k| accum.mul(x[3], y[4]); 292| 40.5k| accum.mul(x[4], y[3]); 293| 40.5k| accum.mul(x[5], y[2]); 294| 40.5k| accum.mul(x[6], y[1]); 295| 40.5k| z[7] = accum.extract(); 296| 40.5k| accum.mul(x[2], y[6]); 297| 40.5k| accum.mul(x[3], y[5]); 298| 40.5k| accum.mul(x[4], y[4]); 299| 40.5k| accum.mul(x[5], y[3]); 300| 40.5k| accum.mul(x[6], y[2]); 301| 40.5k| z[8] = accum.extract(); 302| 40.5k| accum.mul(x[3], y[6]); 303| 40.5k| accum.mul(x[4], y[5]); 304| 40.5k| accum.mul(x[5], y[4]); 305| 40.5k| accum.mul(x[6], y[3]); 306| 40.5k| z[9] = accum.extract(); 307| 40.5k| accum.mul(x[4], y[6]); 308| 40.5k| accum.mul(x[5], y[5]); 309| 40.5k| accum.mul(x[6], y[4]); 310| 40.5k| z[10] = accum.extract(); 311| 40.5k| accum.mul(x[5], y[6]); 312| 40.5k| accum.mul(x[6], y[5]); 313| 40.5k| z[11] = accum.extract(); 314| 40.5k| accum.mul(x[6], y[6]); 315| 40.5k| z[12] = accum.extract(); 316| 40.5k| z[13] = accum.extract(); 317| 40.5k|} _ZN5Botan17bigint_comba_sqr8EPmPKm: 322| 1.17M|void bigint_comba_sqr8(word z[16], const word x[8]) { 323| 1.17M|#if defined(BOTAN_HAS_MP_MULX) 324| 1.17M| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (324:7): [True: 1.17M, False: 0] ------------------ 325| 1.17M| return bigint_mulx_sqr8(z, x); 326| 1.17M| } 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| 1.14M|void bigint_comba_mul8(word z[16], const word x[8], const word y[8]) { 389| 1.14M|#if defined(BOTAN_HAS_MP_MULX) 390| 1.14M| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (390:7): [True: 1.14M, False: 0] ------------------ 391| 1.14M| return bigint_mulx_mul8(z, x, y); 392| 1.14M| } 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| 1.06M|void bigint_comba_sqr9(word z[18], const word x[9]) { 483| 1.06M|#if defined(BOTAN_HAS_MP_MULX) 484| 1.06M| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (484:7): [True: 1.06M, False: 0] ------------------ 485| 1.06M| return bigint_mulx_sqr9(z, x); 486| 1.06M| } 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| 979k|void bigint_comba_mul9(word z[18], const word x[9], const word y[9]) { 560| 979k|#if defined(BOTAN_HAS_MP_MULX) 561| 979k| if(CPUID::has(CPUID::Feature::BMI, CPUID::Feature::ADX)) { ------------------ | Branch (561:7): [True: 979k, False: 0] ------------------ 562| 979k| return bigint_mulx_mul9(z, x, y); 563| 979k| } 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|} _ZN5Botan12basecase_mulEPmmPKmmS2_m: 20| 16|void basecase_mul(word z[], size_t z_size, const word x[], size_t x_size, const word y[], size_t y_size) { 21| 16| if(z_size < x_size + y_size) { ------------------ | Branch (21:7): [True: 0, False: 16] ------------------ 22| 0| throw Invalid_Argument("basecase_mul z_size too small"); 23| 0| } 24| | 25| 16| const size_t x_size_8 = x_size - (x_size % 8); 26| | 27| 16| zeroize_buffer(z, z_size); 28| | 29| 168| for(size_t i = 0; i != y_size; ++i) { ------------------ | Branch (29:22): [True: 152, False: 16] ------------------ 30| 152| const word y_i = y[i]; 31| | 32| 152| word carry = 0; 33| | 34| 304| for(size_t j = 0; j != x_size_8; j += 8) { ------------------ | Branch (34:25): [True: 152, False: 152] ------------------ 35| 152| carry = word8_madd3(z + i + j, x + j, y_i, carry); 36| 152| } 37| | 38| 456| for(size_t j = x_size_8; j != x_size; ++j) { ------------------ | Branch (38:32): [True: 304, False: 152] ------------------ 39| 304| z[i + j] = word_madd3(x[j], y_i, z[i + j], &carry); 40| 304| } 41| | 42| 152| z[x_size + i] = carry; 43| 152| } 44| 16|} _ZN5Botan10bigint_mulEPmmPKmmmS2_mmS0_m: 292| 32.8k| size_t ws_size) { 293| 32.8k| zeroize_buffer(z, z_size); 294| | 295| 32.8k| if(x_sw == 1) { ------------------ | Branch (295:7): [True: 0, False: 32.8k] ------------------ 296| 0| bigint_linmul3(z, y, y_sw, x[0]); 297| 32.8k| } else if(y_sw == 1) { ------------------ | Branch (297:14): [True: 0, False: 32.8k] ------------------ 298| 0| bigint_linmul3(z, x, x_sw, y[0]); 299| 32.8k| } else if(sized_for_comba_mul<4>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (299:14): [True: 28.3k, False: 4.48k] ------------------ 300| 28.3k| bigint_comba_mul4(z, x, y); 301| 28.3k| } else if(sized_for_comba_mul<6>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (301:14): [True: 2.25k, False: 2.23k] ------------------ 302| 2.25k| bigint_comba_mul6(z, x, y); 303| 2.25k| } else if(sized_for_comba_mul<8>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (303:14): [True: 1.15k, False: 1.07k] ------------------ 304| 1.15k| bigint_comba_mul8(z, x, y); 305| 1.15k| } else if(sized_for_comba_mul<9>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (305:14): [True: 1.06k, False: 16] ------------------ 306| 1.06k| bigint_comba_mul9(z, x, y); 307| 1.06k| } else if(sized_for_comba_mul<16>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (307:14): [True: 0, False: 16] ------------------ 308| 0| bigint_comba_mul16(z, x, y); 309| 16| } else if(sized_for_comba_mul<24>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (309:14): [True: 0, False: 16] ------------------ 310| 0| bigint_comba_mul24(z, x, y); 311| 16| } else if(x_sw < KARATSUBA_MULTIPLY_THRESHOLD || y_sw < KARATSUBA_MULTIPLY_THRESHOLD || workspace == nullptr) { ------------------ | Branch (311:14): [True: 16, False: 0] | Branch (311:53): [True: 0, False: 0] | Branch (311:92): [True: 0, False: 0] ------------------ 312| 16| basecase_mul(z, z_size, x, x_sw, y, y_sw); 313| 16| } else { 314| 0| const size_t N = karatsuba_size(z_size, x_size, x_sw, y_size, y_sw); 315| | 316| 0| if(N > 0 && z_size >= 2 * N && ws_size >= 2 * N) { ------------------ | Branch (316:10): [True: 0, False: 0] | Branch (316:19): [True: 0, False: 0] | Branch (316:38): [True: 0, False: 0] ------------------ 317| 0| karatsuba_mul(z, x, y, N, workspace); 318| 0| } else { 319| 0| basecase_mul(z, z_size, x, x_sw, y, y_sw); 320| 0| } 321| 0| } 322| 32.8k|} _ZN5Botan10bigint_sqrEPmmPKmmmS0_m: 327| 18|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| 18| zeroize_buffer(z, z_size); 329| | 330| 18| BOTAN_ASSERT(z_size / 2 >= x_sw, "Output size is sufficient"); ------------------ | | 71| 18| do { \ | | 72| 18| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 18| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 18] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 18| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 18] | | ------------------ ------------------ 331| | 332| 18| if(x_sw == 1) { ------------------ | Branch (332:7): [True: 0, False: 18] ------------------ 333| 0| bigint_linmul3(z, x, x_sw, x[0]); 334| 18| } else if(sized_for_comba_sqr<4>(x_sw, x_size, z_size)) { ------------------ | Branch (334:14): [True: 6, False: 12] ------------------ 335| 6| bigint_comba_sqr4(z, x); 336| 12| } else if(sized_for_comba_sqr<6>(x_sw, x_size, z_size)) { ------------------ | Branch (336:14): [True: 6, False: 6] ------------------ 337| 6| bigint_comba_sqr6(z, x); 338| 6| } else if(sized_for_comba_sqr<8>(x_sw, x_size, z_size)) { ------------------ | Branch (338:14): [True: 3, False: 3] ------------------ 339| 3| bigint_comba_sqr8(z, x); 340| 3| } else if(sized_for_comba_sqr<9>(x_sw, x_size, z_size)) { ------------------ | Branch (340:14): [True: 3, False: 0] ------------------ 341| 3| bigint_comba_sqr9(z, x); 342| 3| } else if(sized_for_comba_sqr<16>(x_sw, x_size, z_size)) { ------------------ | Branch (342:14): [True: 0, False: 0] ------------------ 343| 0| bigint_comba_sqr16(z, x); 344| 0| } else if(sized_for_comba_sqr<24>(x_sw, x_size, z_size)) { ------------------ | Branch (344:14): [True: 0, False: 0] ------------------ 345| 0| bigint_comba_sqr24(z, x); 346| 0| } else if(x_size < KARATSUBA_SQUARE_THRESHOLD || workspace == nullptr) { ------------------ | Branch (346:14): [True: 0, False: 0] | Branch (346:53): [True: 0, False: 0] ------------------ 347| 0| basecase_sqr(z, z_size, x, x_sw); 348| 0| } else { 349| 0| const size_t N = karatsuba_size(z_size, x_size, x_sw); 350| | 351| 0| if(N > 0 && z_size >= 2 * N && ws_size >= 2 * N) { ------------------ | Branch (351:10): [True: 0, False: 0] | Branch (351:19): [True: 0, False: 0] | Branch (351:38): [True: 0, False: 0] ------------------ 352| 0| karatsuba_sqr(z, x, N, workspace); 353| 0| } else { 354| 0| basecase_sqr(z, z_size, x, x_sw); 355| 0| } 356| 0| } 357| 18|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm4EEEbmmmmm: 272| 32.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| 32.8k| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 28.3k, False: 4.48k] | Branch (273:26): [True: 28.3k, False: 0] | Branch (273:42): [True: 28.3k, False: 0] | Branch (273:56): [True: 28.3k, False: 0] | Branch (273:72): [True: 28.3k, False: 0] ------------------ 274| 32.8k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm6EEEbmmmmm: 272| 4.48k|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| 4.48k| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 2.25k, False: 2.23k] | Branch (273:26): [True: 2.25k, False: 0] | Branch (273:42): [True: 2.25k, False: 0] | Branch (273:56): [True: 2.25k, False: 0] | Branch (273:72): [True: 2.25k, False: 0] ------------------ 274| 4.48k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm8EEEbmmmmm: 272| 2.23k|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| 2.23k| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 1.15k, False: 1.07k] | Branch (273:26): [True: 1.15k, False: 0] | Branch (273:42): [True: 1.15k, False: 0] | Branch (273:56): [True: 1.15k, False: 0] | Branch (273:72): [True: 1.15k, False: 0] ------------------ 274| 2.23k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm9EEEbmmmmm: 272| 1.07k|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| 1.07k| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 1.06k, False: 16] | Branch (273:26): [True: 1.06k, False: 0] | Branch (273:42): [True: 1.06k, False: 0] | Branch (273:56): [True: 1.06k, False: 0] | Branch (273:72): [True: 1.06k, False: 0] ------------------ 274| 1.07k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm16EEEbmmmmm: 272| 16|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) { 273| 16| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 16, False: 0] | Branch (273:26): [True: 8, False: 8] | Branch (273:42): [True: 8, False: 0] | Branch (273:56): [True: 8, False: 0] | Branch (273:72): [True: 0, False: 8] ------------------ 274| 16|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm24EEEbmmmmm: 272| 16|inline bool sized_for_comba_mul(size_t x_sw, size_t x_size, size_t y_sw, size_t y_size, size_t z_size) { 273| 16| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 16, False: 0] | Branch (273:26): [True: 0, False: 16] | Branch (273:42): [True: 0, False: 0] | Branch (273:56): [True: 0, False: 0] | Branch (273:72): [True: 0, False: 0] ------------------ 274| 16|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm4EEEbmmm: 277| 18|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 18| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 6, False: 12] | Branch (278:26): [True: 6, False: 0] | Branch (278:42): [True: 6, False: 0] ------------------ 279| 18|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm6EEEbmmm: 277| 12|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 12| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 6, False: 6] | Branch (278:26): [True: 6, False: 0] | Branch (278:42): [True: 6, False: 0] ------------------ 279| 12|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm8EEEbmmm: 277| 6|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 6| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 3, False: 3] | Branch (278:26): [True: 3, False: 0] | Branch (278:42): [True: 3, False: 0] ------------------ 279| 6|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm9EEEbmmm: 277| 3|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 3| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 3, False: 0] | Branch (278:26): [True: 3, False: 0] | Branch (278:42): [True: 3, False: 0] ------------------ 279| 3|} _ZN5Botan25bigint_monty_redc_genericEPmPKmmS2_mmS0_: 95| 1.04k| word r[], const word z[], size_t z_size, const word p[], size_t p_size, word p_dash, word ws[]) { 96| 1.04k| BOTAN_ARG_CHECK(z_size >= 2 * p_size && p_size > 0, "Invalid sizes for bigint_monty_redc_generic"); ------------------ | | 35| 1.04k| do { \ | | 36| 1.04k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.08k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 1.04k, False: 0] | | | Branch (37:12): [True: 1.04k, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.04k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.04k] | | ------------------ ------------------ 97| | 98| 1.04k| word3 accum; 99| | 100| 1.04k| accum.add(z[0]); 101| | 102| 1.04k| ws[0] = accum.monty_step(p[0], p_dash); 103| | 104| 9.39k| for(size_t i = 1; i != p_size; ++i) { ------------------ | Branch (104:22): [True: 8.35k, False: 1.04k] ------------------ 105| 8.35k| mul_rev_range(accum, ws, p, i); 106| 8.35k| accum.add(z[i]); 107| 8.35k| ws[i] = accum.monty_step(p[0], p_dash); 108| 8.35k| } 109| | 110| 9.39k| for(size_t i = 0; i != p_size - 1; ++i) { ------------------ | Branch (110:22): [True: 8.35k, False: 1.04k] ------------------ 111| 8.35k| mul_rev_range(accum, &ws[i + 1], &p[i], p_size - (i + 1)); 112| 8.35k| accum.add(z[p_size + i]); 113| 8.35k| ws[i] = accum.extract(); 114| 8.35k| } 115| | 116| 1.04k| accum.add(z[2 * p_size - 1]); 117| | 118| 1.04k| ws[p_size - 1] = accum.extract(); 119| | // w1 is the final part, which is not stored in the workspace 120| 1.04k| 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| 1.04k| bigint_monty_maybe_sub(p_size, r, w1, ws, p); 141| 1.04k|} mp_monty.cpp:_ZN5Botan12_GLOBAL__N_113mul_rev_rangeERNS_5word3ImEEPKmS5_m: 22| 16.7k|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| 16.7k| size_t lower = 0; 32| 43.8k| while(lower < bound) { ------------------ | Branch (32:10): [True: 27.1k, False: 16.7k] ------------------ 33| 27.1k| const size_t upper = bound - lower; 34| | 35| 27.1k| if(upper >= 16) { ------------------ | Branch (35:10): [True: 0, False: 27.1k] ------------------ 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| 27.1k| } else if(upper >= 8) { ------------------ | Branch (53:17): [True: 2.08k, False: 25.0k] ------------------ 54| 2.08k| accum.mul(ws[lower], p[upper]); 55| 2.08k| accum.mul(ws[lower + 1], p[upper - 1]); 56| 2.08k| accum.mul(ws[lower + 2], p[upper - 2]); 57| 2.08k| accum.mul(ws[lower + 3], p[upper - 3]); 58| 2.08k| accum.mul(ws[lower + 4], p[upper - 4]); 59| 2.08k| accum.mul(ws[lower + 5], p[upper - 5]); 60| 2.08k| accum.mul(ws[lower + 6], p[upper - 6]); 61| 2.08k| accum.mul(ws[lower + 7], p[upper - 7]); 62| 2.08k| lower += 8; 63| 25.0k| } else if(upper >= 4) { ------------------ | Branch (63:17): [True: 8.35k, False: 16.7k] ------------------ 64| 8.35k| accum.mul(ws[lower], p[upper]); 65| 8.35k| accum.mul(ws[lower + 1], p[upper - 1]); 66| 8.35k| accum.mul(ws[lower + 2], p[upper - 2]); 67| 8.35k| accum.mul(ws[lower + 3], p[upper - 3]); 68| 8.35k| lower += 4; 69| 16.7k| } else if(upper >= 2) { ------------------ | Branch (69:17): [True: 8.35k, False: 8.35k] ------------------ 70| 8.35k| accum.mul(ws[lower], p[upper]); 71| 8.35k| accum.mul(ws[lower + 1], p[upper - 1]); 72| 8.35k| lower += 2; 73| 8.35k| } else { 74| 8.35k| accum.mul(ws[lower], p[upper]); 75| 8.35k| lower += 1; 76| 8.35k| } 77| 27.1k| } 78| 16.7k|} _ZN5Botan19bigint_monty_redc_4EPmPKmS2_mS0_: 12| 1.77M|void bigint_monty_redc_4(word r[4], const word z[8], const word p[4], word p_dash, word ws[4]) { 13| 1.77M| word3 accum; 14| 1.77M| accum.add(z[0]); 15| 1.77M| ws[0] = accum.monty_step(p[0], p_dash); 16| 1.77M| accum.mul(ws[0], p[1]); 17| 1.77M| accum.add(z[1]); 18| 1.77M| ws[1] = accum.monty_step(p[0], p_dash); 19| 1.77M| accum.mul(ws[0], p[2]); 20| 1.77M| accum.mul(ws[1], p[1]); 21| 1.77M| accum.add(z[2]); 22| 1.77M| ws[2] = accum.monty_step(p[0], p_dash); 23| 1.77M| accum.mul(ws[0], p[3]); 24| 1.77M| accum.mul(ws[1], p[2]); 25| 1.77M| accum.mul(ws[2], p[1]); 26| 1.77M| accum.add(z[3]); 27| 1.77M| ws[3] = accum.monty_step(p[0], p_dash); 28| 1.77M| accum.mul(ws[1], p[3]); 29| 1.77M| accum.mul(ws[2], p[2]); 30| 1.77M| accum.mul(ws[3], p[1]); 31| 1.77M| accum.add(z[4]); 32| 1.77M| ws[0] = accum.extract(); 33| 1.77M| accum.mul(ws[2], p[3]); 34| 1.77M| accum.mul(ws[3], p[2]); 35| 1.77M| accum.add(z[5]); 36| 1.77M| ws[1] = accum.extract(); 37| 1.77M| accum.mul(ws[3], p[3]); 38| 1.77M| accum.add(z[6]); 39| 1.77M| ws[2] = accum.extract(); 40| 1.77M| accum.add(z[7]); 41| 1.77M| ws[3] = accum.extract(); 42| 1.77M| const word w1 = accum.extract(); 43| 1.77M| bigint_monty_maybe_sub<4>(r, w1, ws, p); 44| 1.77M|} _ZN5Botan19bigint_monty_redc_6EPmPKmS2_mS0_: 46| 1.51M|void bigint_monty_redc_6(word r[6], const word z[12], const word p[6], word p_dash, word ws[6]) { 47| 1.51M| word3 accum; 48| 1.51M| accum.add(z[0]); 49| 1.51M| ws[0] = accum.monty_step(p[0], p_dash); 50| 1.51M| accum.mul(ws[0], p[1]); 51| 1.51M| accum.add(z[1]); 52| 1.51M| ws[1] = accum.monty_step(p[0], p_dash); 53| 1.51M| accum.mul(ws[0], p[2]); 54| 1.51M| accum.mul(ws[1], p[1]); 55| 1.51M| accum.add(z[2]); 56| 1.51M| ws[2] = accum.monty_step(p[0], p_dash); 57| 1.51M| accum.mul(ws[0], p[3]); 58| 1.51M| accum.mul(ws[1], p[2]); 59| 1.51M| accum.mul(ws[2], p[1]); 60| 1.51M| accum.add(z[3]); 61| 1.51M| ws[3] = accum.monty_step(p[0], p_dash); 62| 1.51M| accum.mul(ws[0], p[4]); 63| 1.51M| accum.mul(ws[1], p[3]); 64| 1.51M| accum.mul(ws[2], p[2]); 65| 1.51M| accum.mul(ws[3], p[1]); 66| 1.51M| accum.add(z[4]); 67| 1.51M| ws[4] = accum.monty_step(p[0], p_dash); 68| 1.51M| accum.mul(ws[0], p[5]); 69| 1.51M| accum.mul(ws[1], p[4]); 70| 1.51M| accum.mul(ws[2], p[3]); 71| 1.51M| accum.mul(ws[3], p[2]); 72| 1.51M| accum.mul(ws[4], p[1]); 73| 1.51M| accum.add(z[5]); 74| 1.51M| ws[5] = accum.monty_step(p[0], p_dash); 75| 1.51M| accum.mul(ws[1], p[5]); 76| 1.51M| accum.mul(ws[2], p[4]); 77| 1.51M| accum.mul(ws[3], p[3]); 78| 1.51M| accum.mul(ws[4], p[2]); 79| 1.51M| accum.mul(ws[5], p[1]); 80| 1.51M| accum.add(z[6]); 81| 1.51M| ws[0] = accum.extract(); 82| 1.51M| accum.mul(ws[2], p[5]); 83| 1.51M| accum.mul(ws[3], p[4]); 84| 1.51M| accum.mul(ws[4], p[3]); 85| 1.51M| accum.mul(ws[5], p[2]); 86| 1.51M| accum.add(z[7]); 87| 1.51M| ws[1] = accum.extract(); 88| 1.51M| accum.mul(ws[3], p[5]); 89| 1.51M| accum.mul(ws[4], p[4]); 90| 1.51M| accum.mul(ws[5], p[3]); 91| 1.51M| accum.add(z[8]); 92| 1.51M| ws[2] = accum.extract(); 93| 1.51M| accum.mul(ws[4], p[5]); 94| 1.51M| accum.mul(ws[5], p[4]); 95| 1.51M| accum.add(z[9]); 96| 1.51M| ws[3] = accum.extract(); 97| 1.51M| accum.mul(ws[5], p[5]); 98| 1.51M| accum.add(z[10]); 99| 1.51M| ws[4] = accum.extract(); 100| 1.51M| accum.add(z[11]); 101| 1.51M| ws[5] = accum.extract(); 102| 1.51M| const word w1 = accum.extract(); 103| 1.51M| bigint_monty_maybe_sub<6>(r, w1, ws, p); 104| 1.51M|} _ZN5Botan19bigint_monty_redc_8EPmPKmS2_mS0_: 106| 2.32M|void bigint_monty_redc_8(word r[8], const word z[16], const word p[8], word p_dash, word ws[8]) { 107| 2.32M| word3 accum; 108| 2.32M| accum.add(z[0]); 109| 2.32M| ws[0] = accum.monty_step(p[0], p_dash); 110| 2.32M| accum.mul(ws[0], p[1]); 111| 2.32M| accum.add(z[1]); 112| 2.32M| ws[1] = accum.monty_step(p[0], p_dash); 113| 2.32M| accum.mul(ws[0], p[2]); 114| 2.32M| accum.mul(ws[1], p[1]); 115| 2.32M| accum.add(z[2]); 116| 2.32M| ws[2] = accum.monty_step(p[0], p_dash); 117| 2.32M| accum.mul(ws[0], p[3]); 118| 2.32M| accum.mul(ws[1], p[2]); 119| 2.32M| accum.mul(ws[2], p[1]); 120| 2.32M| accum.add(z[3]); 121| 2.32M| ws[3] = accum.monty_step(p[0], p_dash); 122| 2.32M| accum.mul(ws[0], p[4]); 123| 2.32M| accum.mul(ws[1], p[3]); 124| 2.32M| accum.mul(ws[2], p[2]); 125| 2.32M| accum.mul(ws[3], p[1]); 126| 2.32M| accum.add(z[4]); 127| 2.32M| ws[4] = accum.monty_step(p[0], p_dash); 128| 2.32M| accum.mul(ws[0], p[5]); 129| 2.32M| accum.mul(ws[1], p[4]); 130| 2.32M| accum.mul(ws[2], p[3]); 131| 2.32M| accum.mul(ws[3], p[2]); 132| 2.32M| accum.mul(ws[4], p[1]); 133| 2.32M| accum.add(z[5]); 134| 2.32M| ws[5] = accum.monty_step(p[0], p_dash); 135| 2.32M| accum.mul(ws[0], p[6]); 136| 2.32M| accum.mul(ws[1], p[5]); 137| 2.32M| accum.mul(ws[2], p[4]); 138| 2.32M| accum.mul(ws[3], p[3]); 139| 2.32M| accum.mul(ws[4], p[2]); 140| 2.32M| accum.mul(ws[5], p[1]); 141| 2.32M| accum.add(z[6]); 142| 2.32M| ws[6] = accum.monty_step(p[0], p_dash); 143| 2.32M| accum.mul(ws[0], p[7]); 144| 2.32M| accum.mul(ws[1], p[6]); 145| 2.32M| accum.mul(ws[2], p[5]); 146| 2.32M| accum.mul(ws[3], p[4]); 147| 2.32M| accum.mul(ws[4], p[3]); 148| 2.32M| accum.mul(ws[5], p[2]); 149| 2.32M| accum.mul(ws[6], p[1]); 150| 2.32M| accum.add(z[7]); 151| 2.32M| ws[7] = accum.monty_step(p[0], p_dash); 152| 2.32M| accum.mul(ws[1], p[7]); 153| 2.32M| accum.mul(ws[2], p[6]); 154| 2.32M| accum.mul(ws[3], p[5]); 155| 2.32M| accum.mul(ws[4], p[4]); 156| 2.32M| accum.mul(ws[5], p[3]); 157| 2.32M| accum.mul(ws[6], p[2]); 158| 2.32M| accum.mul(ws[7], p[1]); 159| 2.32M| accum.add(z[8]); 160| 2.32M| ws[0] = accum.extract(); 161| 2.32M| accum.mul(ws[2], p[7]); 162| 2.32M| accum.mul(ws[3], p[6]); 163| 2.32M| accum.mul(ws[4], p[5]); 164| 2.32M| accum.mul(ws[5], p[4]); 165| 2.32M| accum.mul(ws[6], p[3]); 166| 2.32M| accum.mul(ws[7], p[2]); 167| 2.32M| accum.add(z[9]); 168| 2.32M| ws[1] = accum.extract(); 169| 2.32M| accum.mul(ws[3], p[7]); 170| 2.32M| accum.mul(ws[4], p[6]); 171| 2.32M| accum.mul(ws[5], p[5]); 172| 2.32M| accum.mul(ws[6], p[4]); 173| 2.32M| accum.mul(ws[7], p[3]); 174| 2.32M| accum.add(z[10]); 175| 2.32M| ws[2] = accum.extract(); 176| 2.32M| accum.mul(ws[4], p[7]); 177| 2.32M| accum.mul(ws[5], p[6]); 178| 2.32M| accum.mul(ws[6], p[5]); 179| 2.32M| accum.mul(ws[7], p[4]); 180| 2.32M| accum.add(z[11]); 181| 2.32M| ws[3] = accum.extract(); 182| 2.32M| accum.mul(ws[5], p[7]); 183| 2.32M| accum.mul(ws[6], p[6]); 184| 2.32M| accum.mul(ws[7], p[5]); 185| 2.32M| accum.add(z[12]); 186| 2.32M| ws[4] = accum.extract(); 187| 2.32M| accum.mul(ws[6], p[7]); 188| 2.32M| accum.mul(ws[7], p[6]); 189| 2.32M| accum.add(z[13]); 190| 2.32M| ws[5] = accum.extract(); 191| 2.32M| accum.mul(ws[7], p[7]); 192| 2.32M| accum.add(z[14]); 193| 2.32M| ws[6] = accum.extract(); 194| 2.32M| accum.add(z[15]); 195| 2.32M| ws[7] = accum.extract(); 196| 2.32M| const word w1 = accum.extract(); 197| 2.32M| bigint_monty_maybe_sub<8>(r, w1, ws, p); 198| 2.32M|} _ZN5Botan16bigint_mulx_sqr4EPmPKm: 27| 4.13M|void bigint_mulx_sqr4(word z[8], const word x[4]) { 28| | // clang-format off 29| 4.13M| asm( 30| 4.13M| "xorl %%r9d, %%r9d\n\t" 31| 4.13M| "xorl %%r10d, %%r10d\n\t" 32| 4.13M| "xorl %%r8d, %%r8d\n\t" 33| | 34| 4.13M| "movq 0(%[x]), %%rdx\n\t" // x[0] * x[1..3] 35| 4.13M| "xorl %%eax, %%eax\n\t" 36| 4.13M| "mulx 8(%[x]), %%rax, %%rcx\n\t" 37| 4.13M| "adcx %%rax, %%r9\n\t" 38| 4.13M| "movq %%r9, 8(%[z])\n\t" 39| 4.13M| "mulx 16(%[x]), %%rax, %%r9\n\t" 40| 4.13M| "adox %%rcx, %%rax\n\t" 41| 4.13M| "adcx %%rax, %%r10\n\t" 42| 4.13M| "mulx 24(%[x]), %%rax, %%rcx\n\t" 43| 4.13M| "adox %%r9, %%rax\n\t" 44| 4.13M| "adcx %%rax, %%r8\n\t" 45| 4.13M| "movl $0, %%eax\n\t" 46| 4.13M| "adox %%rax, %%rcx\n\t" 47| 4.13M| "adcx %%rax, %%rcx\n\t" 48| 4.13M| "movq %%rcx, %%r9\n\t" 49| 4.13M| "movq %%r10, 16(%[z])\n\t" 50| | 51| 4.13M| "movq 8(%[x]), %%rdx\n\t" // x[1] * x[2..3] 52| 4.13M| "xorl %%eax, %%eax\n\t" 53| 4.13M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 54| 4.13M| "adcx %%rax, %%r8\n\t" 55| 4.13M| "movq %%r8, 24(%[z])\n\t" 56| 4.13M| "mulx 24(%[x]), %%rax, %%r10\n\t" 57| 4.13M| "adox %%rcx, %%rax\n\t" 58| 4.13M| "adcx %%rax, %%r9\n\t" 59| 4.13M| "movl $0, %%eax\n\t" 60| 4.13M| "adox %%rax, %%r10\n\t" 61| 4.13M| "adcx %%rax, %%r10\n\t" 62| 4.13M| "movq %%r9, 32(%[z])\n\t" 63| | 64| 4.13M| "movq 16(%[x]), %%rdx\n\t" // x[2] * x[3..3] 65| 4.13M| "xorl %%eax, %%eax\n\t" 66| 4.13M| "mulx 24(%[x]), %%rax, %%rcx\n\t" 67| 4.13M| "adcx %%rax, %%r10\n\t" 68| 4.13M| "movq %%r10, 40(%[z])\n\t" 69| 4.13M| "movl $0, %%eax\n\t" 70| 4.13M| "adox %%rax, %%rcx\n\t" 71| 4.13M| "adcx %%rax, %%rcx\n\t" 72| 4.13M| "movq %%rcx, %%r8\n\t" 73| 4.13M| "movq %%r8, 48(%[z])\n\t" 74| | 75| 4.13M| "movq $0, 56(%[z])\n\t" 76| 4.13M| "xorl %%eax, %%eax\n\t" // double the cross products and add the squares 77| 4.13M| "movq 0(%[x]), %%rdx\n\t" 78| 4.13M| "mulx %%rdx, %%rax, %%rcx\n\t" 79| 4.13M| "movq %%rax, 0(%[z])\n\t" 80| 4.13M| "movq 8(%[z]), %%r8\n\t" 81| 4.13M| "adcx %%r8, %%r8\n\t" 82| 4.13M| "adox %%rcx, %%r8\n\t" 83| 4.13M| "movq %%r8, 8(%[z])\n\t" 84| 4.13M| "movq 8(%[x]), %%rdx\n\t" 85| 4.13M| "mulx %%rdx, %%rax, %%rcx\n\t" 86| 4.13M| "movq 16(%[z]), %%r8\n\t" 87| 4.13M| "adcx %%r8, %%r8\n\t" 88| 4.13M| "adox %%rax, %%r8\n\t" 89| 4.13M| "movq %%r8, 16(%[z])\n\t" 90| 4.13M| "movq 24(%[z]), %%r8\n\t" 91| 4.13M| "adcx %%r8, %%r8\n\t" 92| 4.13M| "adox %%rcx, %%r8\n\t" 93| 4.13M| "movq %%r8, 24(%[z])\n\t" 94| 4.13M| "movq 16(%[x]), %%rdx\n\t" 95| 4.13M| "mulx %%rdx, %%rax, %%rcx\n\t" 96| 4.13M| "movq 32(%[z]), %%r8\n\t" 97| 4.13M| "adcx %%r8, %%r8\n\t" 98| 4.13M| "adox %%rax, %%r8\n\t" 99| 4.13M| "movq %%r8, 32(%[z])\n\t" 100| 4.13M| "movq 40(%[z]), %%r8\n\t" 101| 4.13M| "adcx %%r8, %%r8\n\t" 102| 4.13M| "adox %%rcx, %%r8\n\t" 103| 4.13M| "movq %%r8, 40(%[z])\n\t" 104| 4.13M| "movq 24(%[x]), %%rdx\n\t" 105| 4.13M| "mulx %%rdx, %%rax, %%rcx\n\t" 106| 4.13M| "movq 48(%[z]), %%r8\n\t" 107| 4.13M| "adcx %%r8, %%r8\n\t" 108| 4.13M| "adox %%rax, %%r8\n\t" 109| 4.13M| "movq %%r8, 48(%[z])\n\t" 110| 4.13M| "movq 56(%[z]), %%r8\n\t" 111| 4.13M| "adcx %%r8, %%r8\n\t" 112| 4.13M| "adox %%rcx, %%r8\n\t" 113| 4.13M| "movq %%r8, 56(%[z])\n\t" 114| 4.13M| : 115| 4.13M| : [z] "r"(z), [x] "r"(x) 116| 4.13M| : "rax", "rcx", "rdx", "r8", "r9", "r10", "cc", "memory"); 117| | // clang-format on 118| 4.13M|} _ZN5Botan16bigint_mulx_mul4EPmPKmS2_: 120| 3.95M|void bigint_mulx_mul4(word z[8], const word x[4], const word y[4]) { 121| | // clang-format off 122| 3.95M| asm( 123| 3.95M| "xorl %%r8d, %%r8d\n\t" 124| 3.95M| "xorl %%r9d, %%r9d\n\t" 125| 3.95M| "xorl %%r10d, %%r10d\n\t" 126| 3.95M| "xorl %%r11d, %%r11d\n\t" 127| | 128| 3.95M| "movq 0(%[y]), %%rdx\n\t" // row 0: x * y[0] 129| 3.95M| "xorl %%eax, %%eax\n\t" 130| 3.95M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 131| 3.95M| "adcx %%rax, %%r8\n\t" 132| 3.95M| "movq %%r8, 0(%[z])\n\t" 133| 3.95M| "mulx 8(%[x]), %%rax, %%r8\n\t" 134| 3.95M| "adox %%rcx, %%rax\n\t" 135| 3.95M| "adcx %%rax, %%r9\n\t" 136| 3.95M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 137| 3.95M| "adox %%r8, %%rax\n\t" 138| 3.95M| "adcx %%rax, %%r10\n\t" 139| 3.95M| "mulx 24(%[x]), %%rax, %%r8\n\t" 140| 3.95M| "adox %%rcx, %%rax\n\t" 141| 3.95M| "adcx %%rax, %%r11\n\t" 142| 3.95M| "movl $0, %%eax\n\t" 143| 3.95M| "adox %%rax, %%r8\n\t" 144| 3.95M| "adcx %%rax, %%r8\n\t" 145| | 146| 3.95M| "movq 8(%[y]), %%rdx\n\t" // row 1: x * y[1] 147| 3.95M| "xorl %%eax, %%eax\n\t" 148| 3.95M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 149| 3.95M| "adcx %%rax, %%r9\n\t" 150| 3.95M| "movq %%r9, 8(%[z])\n\t" 151| 3.95M| "mulx 8(%[x]), %%rax, %%r9\n\t" 152| 3.95M| "adox %%rcx, %%rax\n\t" 153| 3.95M| "adcx %%rax, %%r10\n\t" 154| 3.95M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 155| 3.95M| "adox %%r9, %%rax\n\t" 156| 3.95M| "adcx %%rax, %%r11\n\t" 157| 3.95M| "mulx 24(%[x]), %%rax, %%r9\n\t" 158| 3.95M| "adox %%rcx, %%rax\n\t" 159| 3.95M| "adcx %%rax, %%r8\n\t" 160| 3.95M| "movl $0, %%eax\n\t" 161| 3.95M| "adox %%rax, %%r9\n\t" 162| 3.95M| "adcx %%rax, %%r9\n\t" 163| | 164| 3.95M| "movq 16(%[y]), %%rdx\n\t" // row 2: x * y[2] 165| 3.95M| "xorl %%eax, %%eax\n\t" 166| 3.95M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 167| 3.95M| "adcx %%rax, %%r10\n\t" 168| 3.95M| "movq %%r10, 16(%[z])\n\t" 169| 3.95M| "mulx 8(%[x]), %%rax, %%r10\n\t" 170| 3.95M| "adox %%rcx, %%rax\n\t" 171| 3.95M| "adcx %%rax, %%r11\n\t" 172| 3.95M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 173| 3.95M| "adox %%r10, %%rax\n\t" 174| 3.95M| "adcx %%rax, %%r8\n\t" 175| 3.95M| "mulx 24(%[x]), %%rax, %%r10\n\t" 176| 3.95M| "adox %%rcx, %%rax\n\t" 177| 3.95M| "adcx %%rax, %%r9\n\t" 178| 3.95M| "movl $0, %%eax\n\t" 179| 3.95M| "adox %%rax, %%r10\n\t" 180| 3.95M| "adcx %%rax, %%r10\n\t" 181| | 182| 3.95M| "movq 24(%[y]), %%rdx\n\t" // row 3: x * y[3] 183| 3.95M| "xorl %%eax, %%eax\n\t" 184| 3.95M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 185| 3.95M| "adcx %%rax, %%r11\n\t" 186| 3.95M| "movq %%r11, 24(%[z])\n\t" 187| 3.95M| "mulx 8(%[x]), %%rax, %%r11\n\t" 188| 3.95M| "adox %%rcx, %%rax\n\t" 189| 3.95M| "adcx %%rax, %%r8\n\t" 190| 3.95M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 191| 3.95M| "adox %%r11, %%rax\n\t" 192| 3.95M| "adcx %%rax, %%r9\n\t" 193| 3.95M| "mulx 24(%[x]), %%rax, %%r11\n\t" 194| 3.95M| "adox %%rcx, %%rax\n\t" 195| 3.95M| "adcx %%rax, %%r10\n\t" 196| 3.95M| "movl $0, %%eax\n\t" 197| 3.95M| "adox %%rax, %%r11\n\t" 198| 3.95M| "adcx %%rax, %%r11\n\t" 199| | 200| 3.95M| "movq %%r8, 32(%[z])\n\t" 201| 3.95M| "movq %%r9, 40(%[z])\n\t" 202| 3.95M| "movq %%r10, 48(%[z])\n\t" 203| 3.95M| "movq %%r11, 56(%[z])\n\t" 204| 3.95M| : 205| 3.95M| : [z] "r"(z), [x] "r"(x), [y] "r"(y) 206| 3.95M| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "cc", "memory"); 207| | // clang-format on 208| 3.95M|} _ZN5Botan16bigint_mulx_sqr6EPmPKm: 210| 1.62M|void bigint_mulx_sqr6(word z[12], const word x[6]) { 211| | // clang-format off 212| 1.62M| asm( 213| 1.62M| "xorl %%r9d, %%r9d\n\t" 214| 1.62M| "xorl %%r10d, %%r10d\n\t" 215| 1.62M| "xorl %%r11d, %%r11d\n\t" 216| 1.62M| "xorl %%r12d, %%r12d\n\t" 217| 1.62M| "xorl %%r8d, %%r8d\n\t" 218| | 219| 1.62M| "movq 0(%[x]), %%rdx\n\t" // x[0] * x[1..5] 220| 1.62M| "xorl %%eax, %%eax\n\t" 221| 1.62M| "mulx 8(%[x]), %%rax, %%rcx\n\t" 222| 1.62M| "adcx %%rax, %%r9\n\t" 223| 1.62M| "movq %%r9, 8(%[z])\n\t" 224| 1.62M| "mulx 16(%[x]), %%rax, %%r9\n\t" 225| 1.62M| "adox %%rcx, %%rax\n\t" 226| 1.62M| "adcx %%rax, %%r10\n\t" 227| 1.62M| "mulx 24(%[x]), %%rax, %%rcx\n\t" 228| 1.62M| "adox %%r9, %%rax\n\t" 229| 1.62M| "adcx %%rax, %%r11\n\t" 230| 1.62M| "mulx 32(%[x]), %%rax, %%r9\n\t" 231| 1.62M| "adox %%rcx, %%rax\n\t" 232| 1.62M| "adcx %%rax, %%r12\n\t" 233| 1.62M| "mulx 40(%[x]), %%rax, %%rcx\n\t" 234| 1.62M| "adox %%r9, %%rax\n\t" 235| 1.62M| "adcx %%rax, %%r8\n\t" 236| 1.62M| "movl $0, %%eax\n\t" 237| 1.62M| "adox %%rax, %%rcx\n\t" 238| 1.62M| "adcx %%rax, %%rcx\n\t" 239| 1.62M| "movq %%rcx, %%r9\n\t" 240| 1.62M| "movq %%r10, 16(%[z])\n\t" 241| | 242| 1.62M| "movq 8(%[x]), %%rdx\n\t" // x[1] * x[2..5] 243| 1.62M| "xorl %%eax, %%eax\n\t" 244| 1.62M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 245| 1.62M| "adcx %%rax, %%r11\n\t" 246| 1.62M| "movq %%r11, 24(%[z])\n\t" 247| 1.62M| "mulx 24(%[x]), %%rax, %%r10\n\t" 248| 1.62M| "adox %%rcx, %%rax\n\t" 249| 1.62M| "adcx %%rax, %%r12\n\t" 250| 1.62M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 251| 1.62M| "adox %%r10, %%rax\n\t" 252| 1.62M| "adcx %%rax, %%r8\n\t" 253| 1.62M| "mulx 40(%[x]), %%rax, %%r10\n\t" 254| 1.62M| "adox %%rcx, %%rax\n\t" 255| 1.62M| "adcx %%rax, %%r9\n\t" 256| 1.62M| "movl $0, %%eax\n\t" 257| 1.62M| "adox %%rax, %%r10\n\t" 258| 1.62M| "adcx %%rax, %%r10\n\t" 259| 1.62M| "movq %%r12, 32(%[z])\n\t" 260| | 261| 1.62M| "movq 16(%[x]), %%rdx\n\t" // x[2] * x[3..5] 262| 1.62M| "xorl %%eax, %%eax\n\t" 263| 1.62M| "mulx 24(%[x]), %%rax, %%rcx\n\t" 264| 1.62M| "adcx %%rax, %%r8\n\t" 265| 1.62M| "movq %%r8, 40(%[z])\n\t" 266| 1.62M| "mulx 32(%[x]), %%rax, %%r11\n\t" 267| 1.62M| "adox %%rcx, %%rax\n\t" 268| 1.62M| "adcx %%rax, %%r9\n\t" 269| 1.62M| "mulx 40(%[x]), %%rax, %%rcx\n\t" 270| 1.62M| "adox %%r11, %%rax\n\t" 271| 1.62M| "adcx %%rax, %%r10\n\t" 272| 1.62M| "movl $0, %%eax\n\t" 273| 1.62M| "adox %%rax, %%rcx\n\t" 274| 1.62M| "adcx %%rax, %%rcx\n\t" 275| 1.62M| "movq %%rcx, %%r11\n\t" 276| 1.62M| "movq %%r9, 48(%[z])\n\t" 277| | 278| 1.62M| "movq 24(%[x]), %%rdx\n\t" // x[3] * x[4..5] 279| 1.62M| "xorl %%eax, %%eax\n\t" 280| 1.62M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 281| 1.62M| "adcx %%rax, %%r10\n\t" 282| 1.62M| "movq %%r10, 56(%[z])\n\t" 283| 1.62M| "mulx 40(%[x]), %%rax, %%r12\n\t" 284| 1.62M| "adox %%rcx, %%rax\n\t" 285| 1.62M| "adcx %%rax, %%r11\n\t" 286| 1.62M| "movl $0, %%eax\n\t" 287| 1.62M| "adox %%rax, %%r12\n\t" 288| 1.62M| "adcx %%rax, %%r12\n\t" 289| 1.62M| "movq %%r11, 64(%[z])\n\t" 290| | 291| 1.62M| "movq 32(%[x]), %%rdx\n\t" // x[4] * x[5..5] 292| 1.62M| "xorl %%eax, %%eax\n\t" 293| 1.62M| "mulx 40(%[x]), %%rax, %%rcx\n\t" 294| 1.62M| "adcx %%rax, %%r12\n\t" 295| 1.62M| "movq %%r12, 72(%[z])\n\t" 296| 1.62M| "movl $0, %%eax\n\t" 297| 1.62M| "adox %%rax, %%rcx\n\t" 298| 1.62M| "adcx %%rax, %%rcx\n\t" 299| 1.62M| "movq %%rcx, %%r8\n\t" 300| 1.62M| "movq %%r8, 80(%[z])\n\t" 301| | 302| 1.62M| "movq $0, 88(%[z])\n\t" 303| 1.62M| "xorl %%eax, %%eax\n\t" // double the cross products and add the squares 304| 1.62M| "movq 0(%[x]), %%rdx\n\t" 305| 1.62M| "mulx %%rdx, %%rax, %%rcx\n\t" 306| 1.62M| "movq %%rax, 0(%[z])\n\t" 307| 1.62M| "movq 8(%[z]), %%r8\n\t" 308| 1.62M| "adcx %%r8, %%r8\n\t" 309| 1.62M| "adox %%rcx, %%r8\n\t" 310| 1.62M| "movq %%r8, 8(%[z])\n\t" 311| 1.62M| "movq 8(%[x]), %%rdx\n\t" 312| 1.62M| "mulx %%rdx, %%rax, %%rcx\n\t" 313| 1.62M| "movq 16(%[z]), %%r8\n\t" 314| 1.62M| "adcx %%r8, %%r8\n\t" 315| 1.62M| "adox %%rax, %%r8\n\t" 316| 1.62M| "movq %%r8, 16(%[z])\n\t" 317| 1.62M| "movq 24(%[z]), %%r8\n\t" 318| 1.62M| "adcx %%r8, %%r8\n\t" 319| 1.62M| "adox %%rcx, %%r8\n\t" 320| 1.62M| "movq %%r8, 24(%[z])\n\t" 321| 1.62M| "movq 16(%[x]), %%rdx\n\t" 322| 1.62M| "mulx %%rdx, %%rax, %%rcx\n\t" 323| 1.62M| "movq 32(%[z]), %%r8\n\t" 324| 1.62M| "adcx %%r8, %%r8\n\t" 325| 1.62M| "adox %%rax, %%r8\n\t" 326| 1.62M| "movq %%r8, 32(%[z])\n\t" 327| 1.62M| "movq 40(%[z]), %%r8\n\t" 328| 1.62M| "adcx %%r8, %%r8\n\t" 329| 1.62M| "adox %%rcx, %%r8\n\t" 330| 1.62M| "movq %%r8, 40(%[z])\n\t" 331| 1.62M| "movq 24(%[x]), %%rdx\n\t" 332| 1.62M| "mulx %%rdx, %%rax, %%rcx\n\t" 333| 1.62M| "movq 48(%[z]), %%r8\n\t" 334| 1.62M| "adcx %%r8, %%r8\n\t" 335| 1.62M| "adox %%rax, %%r8\n\t" 336| 1.62M| "movq %%r8, 48(%[z])\n\t" 337| 1.62M| "movq 56(%[z]), %%r8\n\t" 338| 1.62M| "adcx %%r8, %%r8\n\t" 339| 1.62M| "adox %%rcx, %%r8\n\t" 340| 1.62M| "movq %%r8, 56(%[z])\n\t" 341| 1.62M| "movq 32(%[x]), %%rdx\n\t" 342| 1.62M| "mulx %%rdx, %%rax, %%rcx\n\t" 343| 1.62M| "movq 64(%[z]), %%r8\n\t" 344| 1.62M| "adcx %%r8, %%r8\n\t" 345| 1.62M| "adox %%rax, %%r8\n\t" 346| 1.62M| "movq %%r8, 64(%[z])\n\t" 347| 1.62M| "movq 72(%[z]), %%r8\n\t" 348| 1.62M| "adcx %%r8, %%r8\n\t" 349| 1.62M| "adox %%rcx, %%r8\n\t" 350| 1.62M| "movq %%r8, 72(%[z])\n\t" 351| 1.62M| "movq 40(%[x]), %%rdx\n\t" 352| 1.62M| "mulx %%rdx, %%rax, %%rcx\n\t" 353| 1.62M| "movq 80(%[z]), %%r8\n\t" 354| 1.62M| "adcx %%r8, %%r8\n\t" 355| 1.62M| "adox %%rax, %%r8\n\t" 356| 1.62M| "movq %%r8, 80(%[z])\n\t" 357| 1.62M| "movq 88(%[z]), %%r8\n\t" 358| 1.62M| "adcx %%r8, %%r8\n\t" 359| 1.62M| "adox %%rcx, %%r8\n\t" 360| 1.62M| "movq %%r8, 88(%[z])\n\t" 361| 1.62M| : 362| 1.62M| : [z] "r"(z), [x] "r"(x) 363| 1.62M| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "r12", "cc", "memory"); 364| | // clang-format on 365| 1.62M|} _ZN5Botan16bigint_mulx_mul6EPmPKmS2_: 367| 1.56M|void bigint_mulx_mul6(word z[12], const word x[6], const word y[6]) { 368| | // clang-format off 369| 1.56M| asm( 370| 1.56M| "xorl %%r8d, %%r8d\n\t" 371| 1.56M| "xorl %%r9d, %%r9d\n\t" 372| 1.56M| "xorl %%r10d, %%r10d\n\t" 373| 1.56M| "xorl %%r11d, %%r11d\n\t" 374| 1.56M| "xorl %%r12d, %%r12d\n\t" 375| 1.56M| "xorl %%r13d, %%r13d\n\t" 376| | 377| 1.56M| "movq 0(%[y]), %%rdx\n\t" // row 0: x * y[0] 378| 1.56M| "xorl %%eax, %%eax\n\t" 379| 1.56M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 380| 1.56M| "adcx %%rax, %%r8\n\t" 381| 1.56M| "movq %%r8, 0(%[z])\n\t" 382| 1.56M| "mulx 8(%[x]), %%rax, %%r8\n\t" 383| 1.56M| "adox %%rcx, %%rax\n\t" 384| 1.56M| "adcx %%rax, %%r9\n\t" 385| 1.56M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 386| 1.56M| "adox %%r8, %%rax\n\t" 387| 1.56M| "adcx %%rax, %%r10\n\t" 388| 1.56M| "mulx 24(%[x]), %%rax, %%r8\n\t" 389| 1.56M| "adox %%rcx, %%rax\n\t" 390| 1.56M| "adcx %%rax, %%r11\n\t" 391| 1.56M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 392| 1.56M| "adox %%r8, %%rax\n\t" 393| 1.56M| "adcx %%rax, %%r12\n\t" 394| 1.56M| "mulx 40(%[x]), %%rax, %%r8\n\t" 395| 1.56M| "adox %%rcx, %%rax\n\t" 396| 1.56M| "adcx %%rax, %%r13\n\t" 397| 1.56M| "movl $0, %%eax\n\t" 398| 1.56M| "adox %%rax, %%r8\n\t" 399| 1.56M| "adcx %%rax, %%r8\n\t" 400| | 401| 1.56M| "movq 8(%[y]), %%rdx\n\t" // row 1: x * y[1] 402| 1.56M| "xorl %%eax, %%eax\n\t" 403| 1.56M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 404| 1.56M| "adcx %%rax, %%r9\n\t" 405| 1.56M| "movq %%r9, 8(%[z])\n\t" 406| 1.56M| "mulx 8(%[x]), %%rax, %%r9\n\t" 407| 1.56M| "adox %%rcx, %%rax\n\t" 408| 1.56M| "adcx %%rax, %%r10\n\t" 409| 1.56M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 410| 1.56M| "adox %%r9, %%rax\n\t" 411| 1.56M| "adcx %%rax, %%r11\n\t" 412| 1.56M| "mulx 24(%[x]), %%rax, %%r9\n\t" 413| 1.56M| "adox %%rcx, %%rax\n\t" 414| 1.56M| "adcx %%rax, %%r12\n\t" 415| 1.56M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 416| 1.56M| "adox %%r9, %%rax\n\t" 417| 1.56M| "adcx %%rax, %%r13\n\t" 418| 1.56M| "mulx 40(%[x]), %%rax, %%r9\n\t" 419| 1.56M| "adox %%rcx, %%rax\n\t" 420| 1.56M| "adcx %%rax, %%r8\n\t" 421| 1.56M| "movl $0, %%eax\n\t" 422| 1.56M| "adox %%rax, %%r9\n\t" 423| 1.56M| "adcx %%rax, %%r9\n\t" 424| | 425| 1.56M| "movq 16(%[y]), %%rdx\n\t" // row 2: x * y[2] 426| 1.56M| "xorl %%eax, %%eax\n\t" 427| 1.56M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 428| 1.56M| "adcx %%rax, %%r10\n\t" 429| 1.56M| "movq %%r10, 16(%[z])\n\t" 430| 1.56M| "mulx 8(%[x]), %%rax, %%r10\n\t" 431| 1.56M| "adox %%rcx, %%rax\n\t" 432| 1.56M| "adcx %%rax, %%r11\n\t" 433| 1.56M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 434| 1.56M| "adox %%r10, %%rax\n\t" 435| 1.56M| "adcx %%rax, %%r12\n\t" 436| 1.56M| "mulx 24(%[x]), %%rax, %%r10\n\t" 437| 1.56M| "adox %%rcx, %%rax\n\t" 438| 1.56M| "adcx %%rax, %%r13\n\t" 439| 1.56M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 440| 1.56M| "adox %%r10, %%rax\n\t" 441| 1.56M| "adcx %%rax, %%r8\n\t" 442| 1.56M| "mulx 40(%[x]), %%rax, %%r10\n\t" 443| 1.56M| "adox %%rcx, %%rax\n\t" 444| 1.56M| "adcx %%rax, %%r9\n\t" 445| 1.56M| "movl $0, %%eax\n\t" 446| 1.56M| "adox %%rax, %%r10\n\t" 447| 1.56M| "adcx %%rax, %%r10\n\t" 448| | 449| 1.56M| "movq 24(%[y]), %%rdx\n\t" // row 3: x * y[3] 450| 1.56M| "xorl %%eax, %%eax\n\t" 451| 1.56M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 452| 1.56M| "adcx %%rax, %%r11\n\t" 453| 1.56M| "movq %%r11, 24(%[z])\n\t" 454| 1.56M| "mulx 8(%[x]), %%rax, %%r11\n\t" 455| 1.56M| "adox %%rcx, %%rax\n\t" 456| 1.56M| "adcx %%rax, %%r12\n\t" 457| 1.56M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 458| 1.56M| "adox %%r11, %%rax\n\t" 459| 1.56M| "adcx %%rax, %%r13\n\t" 460| 1.56M| "mulx 24(%[x]), %%rax, %%r11\n\t" 461| 1.56M| "adox %%rcx, %%rax\n\t" 462| 1.56M| "adcx %%rax, %%r8\n\t" 463| 1.56M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 464| 1.56M| "adox %%r11, %%rax\n\t" 465| 1.56M| "adcx %%rax, %%r9\n\t" 466| 1.56M| "mulx 40(%[x]), %%rax, %%r11\n\t" 467| 1.56M| "adox %%rcx, %%rax\n\t" 468| 1.56M| "adcx %%rax, %%r10\n\t" 469| 1.56M| "movl $0, %%eax\n\t" 470| 1.56M| "adox %%rax, %%r11\n\t" 471| 1.56M| "adcx %%rax, %%r11\n\t" 472| | 473| 1.56M| "movq 32(%[y]), %%rdx\n\t" // row 4: x * y[4] 474| 1.56M| "xorl %%eax, %%eax\n\t" 475| 1.56M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 476| 1.56M| "adcx %%rax, %%r12\n\t" 477| 1.56M| "movq %%r12, 32(%[z])\n\t" 478| 1.56M| "mulx 8(%[x]), %%rax, %%r12\n\t" 479| 1.56M| "adox %%rcx, %%rax\n\t" 480| 1.56M| "adcx %%rax, %%r13\n\t" 481| 1.56M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 482| 1.56M| "adox %%r12, %%rax\n\t" 483| 1.56M| "adcx %%rax, %%r8\n\t" 484| 1.56M| "mulx 24(%[x]), %%rax, %%r12\n\t" 485| 1.56M| "adox %%rcx, %%rax\n\t" 486| 1.56M| "adcx %%rax, %%r9\n\t" 487| 1.56M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 488| 1.56M| "adox %%r12, %%rax\n\t" 489| 1.56M| "adcx %%rax, %%r10\n\t" 490| 1.56M| "mulx 40(%[x]), %%rax, %%r12\n\t" 491| 1.56M| "adox %%rcx, %%rax\n\t" 492| 1.56M| "adcx %%rax, %%r11\n\t" 493| 1.56M| "movl $0, %%eax\n\t" 494| 1.56M| "adox %%rax, %%r12\n\t" 495| 1.56M| "adcx %%rax, %%r12\n\t" 496| | 497| 1.56M| "movq 40(%[y]), %%rdx\n\t" // row 5: x * y[5] 498| 1.56M| "xorl %%eax, %%eax\n\t" 499| 1.56M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 500| 1.56M| "adcx %%rax, %%r13\n\t" 501| 1.56M| "movq %%r13, 40(%[z])\n\t" 502| 1.56M| "mulx 8(%[x]), %%rax, %%r13\n\t" 503| 1.56M| "adox %%rcx, %%rax\n\t" 504| 1.56M| "adcx %%rax, %%r8\n\t" 505| 1.56M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 506| 1.56M| "adox %%r13, %%rax\n\t" 507| 1.56M| "adcx %%rax, %%r9\n\t" 508| 1.56M| "mulx 24(%[x]), %%rax, %%r13\n\t" 509| 1.56M| "adox %%rcx, %%rax\n\t" 510| 1.56M| "adcx %%rax, %%r10\n\t" 511| 1.56M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 512| 1.56M| "adox %%r13, %%rax\n\t" 513| 1.56M| "adcx %%rax, %%r11\n\t" 514| 1.56M| "mulx 40(%[x]), %%rax, %%r13\n\t" 515| 1.56M| "adox %%rcx, %%rax\n\t" 516| 1.56M| "adcx %%rax, %%r12\n\t" 517| 1.56M| "movl $0, %%eax\n\t" 518| 1.56M| "adox %%rax, %%r13\n\t" 519| 1.56M| "adcx %%rax, %%r13\n\t" 520| | 521| 1.56M| "movq %%r8, 48(%[z])\n\t" 522| 1.56M| "movq %%r9, 56(%[z])\n\t" 523| 1.56M| "movq %%r10, 64(%[z])\n\t" 524| 1.56M| "movq %%r11, 72(%[z])\n\t" 525| 1.56M| "movq %%r12, 80(%[z])\n\t" 526| 1.56M| "movq %%r13, 88(%[z])\n\t" 527| 1.56M| : 528| 1.56M| : [z] "r"(z), [x] "r"(x), [y] "r"(y) 529| 1.56M| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "cc", "memory"); 530| | // clang-format on 531| 1.56M|} _ZN5Botan16bigint_mulx_sqr8EPmPKm: 533| 1.17M|void bigint_mulx_sqr8(word z[16], const word x[8]) { 534| | // clang-format off 535| 1.17M| asm( 536| 1.17M| "xorl %%r9d, %%r9d\n\t" 537| 1.17M| "xorl %%r10d, %%r10d\n\t" 538| 1.17M| "xorl %%r11d, %%r11d\n\t" 539| 1.17M| "xorl %%r12d, %%r12d\n\t" 540| 1.17M| "xorl %%r13d, %%r13d\n\t" 541| 1.17M| "xorl %%r14d, %%r14d\n\t" 542| 1.17M| "xorl %%r8d, %%r8d\n\t" 543| | 544| 1.17M| "movq 0(%[x]), %%rdx\n\t" // x[0] * x[1..7] 545| 1.17M| "xorl %%eax, %%eax\n\t" 546| 1.17M| "mulx 8(%[x]), %%rax, %%rcx\n\t" 547| 1.17M| "adcx %%rax, %%r9\n\t" 548| 1.17M| "movq %%r9, 8(%[z])\n\t" 549| 1.17M| "mulx 16(%[x]), %%rax, %%r9\n\t" 550| 1.17M| "adox %%rcx, %%rax\n\t" 551| 1.17M| "adcx %%rax, %%r10\n\t" 552| 1.17M| "mulx 24(%[x]), %%rax, %%rcx\n\t" 553| 1.17M| "adox %%r9, %%rax\n\t" 554| 1.17M| "adcx %%rax, %%r11\n\t" 555| 1.17M| "mulx 32(%[x]), %%rax, %%r9\n\t" 556| 1.17M| "adox %%rcx, %%rax\n\t" 557| 1.17M| "adcx %%rax, %%r12\n\t" 558| 1.17M| "mulx 40(%[x]), %%rax, %%rcx\n\t" 559| 1.17M| "adox %%r9, %%rax\n\t" 560| 1.17M| "adcx %%rax, %%r13\n\t" 561| 1.17M| "mulx 48(%[x]), %%rax, %%r9\n\t" 562| 1.17M| "adox %%rcx, %%rax\n\t" 563| 1.17M| "adcx %%rax, %%r14\n\t" 564| 1.17M| "mulx 56(%[x]), %%rax, %%rcx\n\t" 565| 1.17M| "adox %%r9, %%rax\n\t" 566| 1.17M| "adcx %%rax, %%r8\n\t" 567| 1.17M| "movl $0, %%eax\n\t" 568| 1.17M| "adox %%rax, %%rcx\n\t" 569| 1.17M| "adcx %%rax, %%rcx\n\t" 570| 1.17M| "movq %%rcx, %%r9\n\t" 571| 1.17M| "movq %%r10, 16(%[z])\n\t" 572| | 573| 1.17M| "movq 8(%[x]), %%rdx\n\t" // x[1] * x[2..7] 574| 1.17M| "xorl %%eax, %%eax\n\t" 575| 1.17M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 576| 1.17M| "adcx %%rax, %%r11\n\t" 577| 1.17M| "movq %%r11, 24(%[z])\n\t" 578| 1.17M| "mulx 24(%[x]), %%rax, %%r10\n\t" 579| 1.17M| "adox %%rcx, %%rax\n\t" 580| 1.17M| "adcx %%rax, %%r12\n\t" 581| 1.17M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 582| 1.17M| "adox %%r10, %%rax\n\t" 583| 1.17M| "adcx %%rax, %%r13\n\t" 584| 1.17M| "mulx 40(%[x]), %%rax, %%r10\n\t" 585| 1.17M| "adox %%rcx, %%rax\n\t" 586| 1.17M| "adcx %%rax, %%r14\n\t" 587| 1.17M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 588| 1.17M| "adox %%r10, %%rax\n\t" 589| 1.17M| "adcx %%rax, %%r8\n\t" 590| 1.17M| "mulx 56(%[x]), %%rax, %%r10\n\t" 591| 1.17M| "adox %%rcx, %%rax\n\t" 592| 1.17M| "adcx %%rax, %%r9\n\t" 593| 1.17M| "movl $0, %%eax\n\t" 594| 1.17M| "adox %%rax, %%r10\n\t" 595| 1.17M| "adcx %%rax, %%r10\n\t" 596| 1.17M| "movq %%r12, 32(%[z])\n\t" 597| | 598| 1.17M| "movq 16(%[x]), %%rdx\n\t" // x[2] * x[3..7] 599| 1.17M| "xorl %%eax, %%eax\n\t" 600| 1.17M| "mulx 24(%[x]), %%rax, %%rcx\n\t" 601| 1.17M| "adcx %%rax, %%r13\n\t" 602| 1.17M| "movq %%r13, 40(%[z])\n\t" 603| 1.17M| "mulx 32(%[x]), %%rax, %%r11\n\t" 604| 1.17M| "adox %%rcx, %%rax\n\t" 605| 1.17M| "adcx %%rax, %%r14\n\t" 606| 1.17M| "mulx 40(%[x]), %%rax, %%rcx\n\t" 607| 1.17M| "adox %%r11, %%rax\n\t" 608| 1.17M| "adcx %%rax, %%r8\n\t" 609| 1.17M| "mulx 48(%[x]), %%rax, %%r11\n\t" 610| 1.17M| "adox %%rcx, %%rax\n\t" 611| 1.17M| "adcx %%rax, %%r9\n\t" 612| 1.17M| "mulx 56(%[x]), %%rax, %%rcx\n\t" 613| 1.17M| "adox %%r11, %%rax\n\t" 614| 1.17M| "adcx %%rax, %%r10\n\t" 615| 1.17M| "movl $0, %%eax\n\t" 616| 1.17M| "adox %%rax, %%rcx\n\t" 617| 1.17M| "adcx %%rax, %%rcx\n\t" 618| 1.17M| "movq %%rcx, %%r11\n\t" 619| 1.17M| "movq %%r14, 48(%[z])\n\t" 620| | 621| 1.17M| "movq 24(%[x]), %%rdx\n\t" // x[3] * x[4..7] 622| 1.17M| "xorl %%eax, %%eax\n\t" 623| 1.17M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 624| 1.17M| "adcx %%rax, %%r8\n\t" 625| 1.17M| "movq %%r8, 56(%[z])\n\t" 626| 1.17M| "mulx 40(%[x]), %%rax, %%r12\n\t" 627| 1.17M| "adox %%rcx, %%rax\n\t" 628| 1.17M| "adcx %%rax, %%r9\n\t" 629| 1.17M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 630| 1.17M| "adox %%r12, %%rax\n\t" 631| 1.17M| "adcx %%rax, %%r10\n\t" 632| 1.17M| "mulx 56(%[x]), %%rax, %%r12\n\t" 633| 1.17M| "adox %%rcx, %%rax\n\t" 634| 1.17M| "adcx %%rax, %%r11\n\t" 635| 1.17M| "movl $0, %%eax\n\t" 636| 1.17M| "adox %%rax, %%r12\n\t" 637| 1.17M| "adcx %%rax, %%r12\n\t" 638| 1.17M| "movq %%r9, 64(%[z])\n\t" 639| | 640| 1.17M| "movq 32(%[x]), %%rdx\n\t" // x[4] * x[5..7] 641| 1.17M| "xorl %%eax, %%eax\n\t" 642| 1.17M| "mulx 40(%[x]), %%rax, %%rcx\n\t" 643| 1.17M| "adcx %%rax, %%r10\n\t" 644| 1.17M| "movq %%r10, 72(%[z])\n\t" 645| 1.17M| "mulx 48(%[x]), %%rax, %%r13\n\t" 646| 1.17M| "adox %%rcx, %%rax\n\t" 647| 1.17M| "adcx %%rax, %%r11\n\t" 648| 1.17M| "mulx 56(%[x]), %%rax, %%rcx\n\t" 649| 1.17M| "adox %%r13, %%rax\n\t" 650| 1.17M| "adcx %%rax, %%r12\n\t" 651| 1.17M| "movl $0, %%eax\n\t" 652| 1.17M| "adox %%rax, %%rcx\n\t" 653| 1.17M| "adcx %%rax, %%rcx\n\t" 654| 1.17M| "movq %%rcx, %%r13\n\t" 655| 1.17M| "movq %%r11, 80(%[z])\n\t" 656| | 657| 1.17M| "movq 40(%[x]), %%rdx\n\t" // x[5] * x[6..7] 658| 1.17M| "xorl %%eax, %%eax\n\t" 659| 1.17M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 660| 1.17M| "adcx %%rax, %%r12\n\t" 661| 1.17M| "movq %%r12, 88(%[z])\n\t" 662| 1.17M| "mulx 56(%[x]), %%rax, %%r14\n\t" 663| 1.17M| "adox %%rcx, %%rax\n\t" 664| 1.17M| "adcx %%rax, %%r13\n\t" 665| 1.17M| "movl $0, %%eax\n\t" 666| 1.17M| "adox %%rax, %%r14\n\t" 667| 1.17M| "adcx %%rax, %%r14\n\t" 668| 1.17M| "movq %%r13, 96(%[z])\n\t" 669| | 670| 1.17M| "movq 48(%[x]), %%rdx\n\t" // x[6] * x[7..7] 671| 1.17M| "xorl %%eax, %%eax\n\t" 672| 1.17M| "mulx 56(%[x]), %%rax, %%rcx\n\t" 673| 1.17M| "adcx %%rax, %%r14\n\t" 674| 1.17M| "movq %%r14, 104(%[z])\n\t" 675| 1.17M| "movl $0, %%eax\n\t" 676| 1.17M| "adox %%rax, %%rcx\n\t" 677| 1.17M| "adcx %%rax, %%rcx\n\t" 678| 1.17M| "movq %%rcx, %%r8\n\t" 679| 1.17M| "movq %%r8, 112(%[z])\n\t" 680| | 681| 1.17M| "movq $0, 120(%[z])\n\t" 682| 1.17M| "xorl %%eax, %%eax\n\t" // double the cross products and add the squares 683| 1.17M| "movq 0(%[x]), %%rdx\n\t" 684| 1.17M| "mulx %%rdx, %%rax, %%rcx\n\t" 685| 1.17M| "movq %%rax, 0(%[z])\n\t" 686| 1.17M| "movq 8(%[z]), %%r8\n\t" 687| 1.17M| "adcx %%r8, %%r8\n\t" 688| 1.17M| "adox %%rcx, %%r8\n\t" 689| 1.17M| "movq %%r8, 8(%[z])\n\t" 690| 1.17M| "movq 8(%[x]), %%rdx\n\t" 691| 1.17M| "mulx %%rdx, %%rax, %%rcx\n\t" 692| 1.17M| "movq 16(%[z]), %%r8\n\t" 693| 1.17M| "adcx %%r8, %%r8\n\t" 694| 1.17M| "adox %%rax, %%r8\n\t" 695| 1.17M| "movq %%r8, 16(%[z])\n\t" 696| 1.17M| "movq 24(%[z]), %%r8\n\t" 697| 1.17M| "adcx %%r8, %%r8\n\t" 698| 1.17M| "adox %%rcx, %%r8\n\t" 699| 1.17M| "movq %%r8, 24(%[z])\n\t" 700| 1.17M| "movq 16(%[x]), %%rdx\n\t" 701| 1.17M| "mulx %%rdx, %%rax, %%rcx\n\t" 702| 1.17M| "movq 32(%[z]), %%r8\n\t" 703| 1.17M| "adcx %%r8, %%r8\n\t" 704| 1.17M| "adox %%rax, %%r8\n\t" 705| 1.17M| "movq %%r8, 32(%[z])\n\t" 706| 1.17M| "movq 40(%[z]), %%r8\n\t" 707| 1.17M| "adcx %%r8, %%r8\n\t" 708| 1.17M| "adox %%rcx, %%r8\n\t" 709| 1.17M| "movq %%r8, 40(%[z])\n\t" 710| 1.17M| "movq 24(%[x]), %%rdx\n\t" 711| 1.17M| "mulx %%rdx, %%rax, %%rcx\n\t" 712| 1.17M| "movq 48(%[z]), %%r8\n\t" 713| 1.17M| "adcx %%r8, %%r8\n\t" 714| 1.17M| "adox %%rax, %%r8\n\t" 715| 1.17M| "movq %%r8, 48(%[z])\n\t" 716| 1.17M| "movq 56(%[z]), %%r8\n\t" 717| 1.17M| "adcx %%r8, %%r8\n\t" 718| 1.17M| "adox %%rcx, %%r8\n\t" 719| 1.17M| "movq %%r8, 56(%[z])\n\t" 720| 1.17M| "movq 32(%[x]), %%rdx\n\t" 721| 1.17M| "mulx %%rdx, %%rax, %%rcx\n\t" 722| 1.17M| "movq 64(%[z]), %%r8\n\t" 723| 1.17M| "adcx %%r8, %%r8\n\t" 724| 1.17M| "adox %%rax, %%r8\n\t" 725| 1.17M| "movq %%r8, 64(%[z])\n\t" 726| 1.17M| "movq 72(%[z]), %%r8\n\t" 727| 1.17M| "adcx %%r8, %%r8\n\t" 728| 1.17M| "adox %%rcx, %%r8\n\t" 729| 1.17M| "movq %%r8, 72(%[z])\n\t" 730| 1.17M| "movq 40(%[x]), %%rdx\n\t" 731| 1.17M| "mulx %%rdx, %%rax, %%rcx\n\t" 732| 1.17M| "movq 80(%[z]), %%r8\n\t" 733| 1.17M| "adcx %%r8, %%r8\n\t" 734| 1.17M| "adox %%rax, %%r8\n\t" 735| 1.17M| "movq %%r8, 80(%[z])\n\t" 736| 1.17M| "movq 88(%[z]), %%r8\n\t" 737| 1.17M| "adcx %%r8, %%r8\n\t" 738| 1.17M| "adox %%rcx, %%r8\n\t" 739| 1.17M| "movq %%r8, 88(%[z])\n\t" 740| 1.17M| "movq 48(%[x]), %%rdx\n\t" 741| 1.17M| "mulx %%rdx, %%rax, %%rcx\n\t" 742| 1.17M| "movq 96(%[z]), %%r8\n\t" 743| 1.17M| "adcx %%r8, %%r8\n\t" 744| 1.17M| "adox %%rax, %%r8\n\t" 745| 1.17M| "movq %%r8, 96(%[z])\n\t" 746| 1.17M| "movq 104(%[z]), %%r8\n\t" 747| 1.17M| "adcx %%r8, %%r8\n\t" 748| 1.17M| "adox %%rcx, %%r8\n\t" 749| 1.17M| "movq %%r8, 104(%[z])\n\t" 750| 1.17M| "movq 56(%[x]), %%rdx\n\t" 751| 1.17M| "mulx %%rdx, %%rax, %%rcx\n\t" 752| 1.17M| "movq 112(%[z]), %%r8\n\t" 753| 1.17M| "adcx %%r8, %%r8\n\t" 754| 1.17M| "adox %%rax, %%r8\n\t" 755| 1.17M| "movq %%r8, 112(%[z])\n\t" 756| 1.17M| "movq 120(%[z]), %%r8\n\t" 757| 1.17M| "adcx %%r8, %%r8\n\t" 758| 1.17M| "adox %%rcx, %%r8\n\t" 759| 1.17M| "movq %%r8, 120(%[z])\n\t" 760| 1.17M| : 761| 1.17M| : [z] "r"(z), [x] "r"(x) 762| 1.17M| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "r14", "cc", "memory"); 763| | // clang-format on 764| 1.17M|} _ZN5Botan16bigint_mulx_mul8EPmPKmS2_: 766| 1.14M|void bigint_mulx_mul8(word z[16], const word x[8], const word y[8]) { 767| | // clang-format off 768| 1.14M| asm( 769| 1.14M| "xorl %%r8d, %%r8d\n\t" 770| 1.14M| "xorl %%r9d, %%r9d\n\t" 771| 1.14M| "xorl %%r10d, %%r10d\n\t" 772| 1.14M| "xorl %%r11d, %%r11d\n\t" 773| 1.14M| "xorl %%r12d, %%r12d\n\t" 774| 1.14M| "xorl %%r13d, %%r13d\n\t" 775| 1.14M| "xorl %%r14d, %%r14d\n\t" 776| 1.14M| "xorl %%r15d, %%r15d\n\t" 777| | 778| 1.14M| "movq 0(%[y]), %%rdx\n\t" // row 0: x * y[0] 779| 1.14M| "xorl %%eax, %%eax\n\t" 780| 1.14M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 781| 1.14M| "adcx %%rax, %%r8\n\t" 782| 1.14M| "movq %%r8, 0(%[z])\n\t" 783| 1.14M| "mulx 8(%[x]), %%rax, %%r8\n\t" 784| 1.14M| "adox %%rcx, %%rax\n\t" 785| 1.14M| "adcx %%rax, %%r9\n\t" 786| 1.14M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 787| 1.14M| "adox %%r8, %%rax\n\t" 788| 1.14M| "adcx %%rax, %%r10\n\t" 789| 1.14M| "mulx 24(%[x]), %%rax, %%r8\n\t" 790| 1.14M| "adox %%rcx, %%rax\n\t" 791| 1.14M| "adcx %%rax, %%r11\n\t" 792| 1.14M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 793| 1.14M| "adox %%r8, %%rax\n\t" 794| 1.14M| "adcx %%rax, %%r12\n\t" 795| 1.14M| "mulx 40(%[x]), %%rax, %%r8\n\t" 796| 1.14M| "adox %%rcx, %%rax\n\t" 797| 1.14M| "adcx %%rax, %%r13\n\t" 798| 1.14M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 799| 1.14M| "adox %%r8, %%rax\n\t" 800| 1.14M| "adcx %%rax, %%r14\n\t" 801| 1.14M| "mulx 56(%[x]), %%rax, %%r8\n\t" 802| 1.14M| "adox %%rcx, %%rax\n\t" 803| 1.14M| "adcx %%rax, %%r15\n\t" 804| 1.14M| "movl $0, %%eax\n\t" 805| 1.14M| "adox %%rax, %%r8\n\t" 806| 1.14M| "adcx %%rax, %%r8\n\t" 807| | 808| 1.14M| "movq 8(%[y]), %%rdx\n\t" // row 1: x * y[1] 809| 1.14M| "xorl %%eax, %%eax\n\t" 810| 1.14M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 811| 1.14M| "adcx %%rax, %%r9\n\t" 812| 1.14M| "movq %%r9, 8(%[z])\n\t" 813| 1.14M| "mulx 8(%[x]), %%rax, %%r9\n\t" 814| 1.14M| "adox %%rcx, %%rax\n\t" 815| 1.14M| "adcx %%rax, %%r10\n\t" 816| 1.14M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 817| 1.14M| "adox %%r9, %%rax\n\t" 818| 1.14M| "adcx %%rax, %%r11\n\t" 819| 1.14M| "mulx 24(%[x]), %%rax, %%r9\n\t" 820| 1.14M| "adox %%rcx, %%rax\n\t" 821| 1.14M| "adcx %%rax, %%r12\n\t" 822| 1.14M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 823| 1.14M| "adox %%r9, %%rax\n\t" 824| 1.14M| "adcx %%rax, %%r13\n\t" 825| 1.14M| "mulx 40(%[x]), %%rax, %%r9\n\t" 826| 1.14M| "adox %%rcx, %%rax\n\t" 827| 1.14M| "adcx %%rax, %%r14\n\t" 828| 1.14M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 829| 1.14M| "adox %%r9, %%rax\n\t" 830| 1.14M| "adcx %%rax, %%r15\n\t" 831| 1.14M| "mulx 56(%[x]), %%rax, %%r9\n\t" 832| 1.14M| "adox %%rcx, %%rax\n\t" 833| 1.14M| "adcx %%rax, %%r8\n\t" 834| 1.14M| "movl $0, %%eax\n\t" 835| 1.14M| "adox %%rax, %%r9\n\t" 836| 1.14M| "adcx %%rax, %%r9\n\t" 837| | 838| 1.14M| "movq 16(%[y]), %%rdx\n\t" // row 2: x * y[2] 839| 1.14M| "xorl %%eax, %%eax\n\t" 840| 1.14M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 841| 1.14M| "adcx %%rax, %%r10\n\t" 842| 1.14M| "movq %%r10, 16(%[z])\n\t" 843| 1.14M| "mulx 8(%[x]), %%rax, %%r10\n\t" 844| 1.14M| "adox %%rcx, %%rax\n\t" 845| 1.14M| "adcx %%rax, %%r11\n\t" 846| 1.14M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 847| 1.14M| "adox %%r10, %%rax\n\t" 848| 1.14M| "adcx %%rax, %%r12\n\t" 849| 1.14M| "mulx 24(%[x]), %%rax, %%r10\n\t" 850| 1.14M| "adox %%rcx, %%rax\n\t" 851| 1.14M| "adcx %%rax, %%r13\n\t" 852| 1.14M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 853| 1.14M| "adox %%r10, %%rax\n\t" 854| 1.14M| "adcx %%rax, %%r14\n\t" 855| 1.14M| "mulx 40(%[x]), %%rax, %%r10\n\t" 856| 1.14M| "adox %%rcx, %%rax\n\t" 857| 1.14M| "adcx %%rax, %%r15\n\t" 858| 1.14M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 859| 1.14M| "adox %%r10, %%rax\n\t" 860| 1.14M| "adcx %%rax, %%r8\n\t" 861| 1.14M| "mulx 56(%[x]), %%rax, %%r10\n\t" 862| 1.14M| "adox %%rcx, %%rax\n\t" 863| 1.14M| "adcx %%rax, %%r9\n\t" 864| 1.14M| "movl $0, %%eax\n\t" 865| 1.14M| "adox %%rax, %%r10\n\t" 866| 1.14M| "adcx %%rax, %%r10\n\t" 867| | 868| 1.14M| "movq 24(%[y]), %%rdx\n\t" // row 3: x * y[3] 869| 1.14M| "xorl %%eax, %%eax\n\t" 870| 1.14M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 871| 1.14M| "adcx %%rax, %%r11\n\t" 872| 1.14M| "movq %%r11, 24(%[z])\n\t" 873| 1.14M| "mulx 8(%[x]), %%rax, %%r11\n\t" 874| 1.14M| "adox %%rcx, %%rax\n\t" 875| 1.14M| "adcx %%rax, %%r12\n\t" 876| 1.14M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 877| 1.14M| "adox %%r11, %%rax\n\t" 878| 1.14M| "adcx %%rax, %%r13\n\t" 879| 1.14M| "mulx 24(%[x]), %%rax, %%r11\n\t" 880| 1.14M| "adox %%rcx, %%rax\n\t" 881| 1.14M| "adcx %%rax, %%r14\n\t" 882| 1.14M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 883| 1.14M| "adox %%r11, %%rax\n\t" 884| 1.14M| "adcx %%rax, %%r15\n\t" 885| 1.14M| "mulx 40(%[x]), %%rax, %%r11\n\t" 886| 1.14M| "adox %%rcx, %%rax\n\t" 887| 1.14M| "adcx %%rax, %%r8\n\t" 888| 1.14M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 889| 1.14M| "adox %%r11, %%rax\n\t" 890| 1.14M| "adcx %%rax, %%r9\n\t" 891| 1.14M| "mulx 56(%[x]), %%rax, %%r11\n\t" 892| 1.14M| "adox %%rcx, %%rax\n\t" 893| 1.14M| "adcx %%rax, %%r10\n\t" 894| 1.14M| "movl $0, %%eax\n\t" 895| 1.14M| "adox %%rax, %%r11\n\t" 896| 1.14M| "adcx %%rax, %%r11\n\t" 897| | 898| 1.14M| "movq 32(%[y]), %%rdx\n\t" // row 4: x * y[4] 899| 1.14M| "xorl %%eax, %%eax\n\t" 900| 1.14M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 901| 1.14M| "adcx %%rax, %%r12\n\t" 902| 1.14M| "movq %%r12, 32(%[z])\n\t" 903| 1.14M| "mulx 8(%[x]), %%rax, %%r12\n\t" 904| 1.14M| "adox %%rcx, %%rax\n\t" 905| 1.14M| "adcx %%rax, %%r13\n\t" 906| 1.14M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 907| 1.14M| "adox %%r12, %%rax\n\t" 908| 1.14M| "adcx %%rax, %%r14\n\t" 909| 1.14M| "mulx 24(%[x]), %%rax, %%r12\n\t" 910| 1.14M| "adox %%rcx, %%rax\n\t" 911| 1.14M| "adcx %%rax, %%r15\n\t" 912| 1.14M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 913| 1.14M| "adox %%r12, %%rax\n\t" 914| 1.14M| "adcx %%rax, %%r8\n\t" 915| 1.14M| "mulx 40(%[x]), %%rax, %%r12\n\t" 916| 1.14M| "adox %%rcx, %%rax\n\t" 917| 1.14M| "adcx %%rax, %%r9\n\t" 918| 1.14M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 919| 1.14M| "adox %%r12, %%rax\n\t" 920| 1.14M| "adcx %%rax, %%r10\n\t" 921| 1.14M| "mulx 56(%[x]), %%rax, %%r12\n\t" 922| 1.14M| "adox %%rcx, %%rax\n\t" 923| 1.14M| "adcx %%rax, %%r11\n\t" 924| 1.14M| "movl $0, %%eax\n\t" 925| 1.14M| "adox %%rax, %%r12\n\t" 926| 1.14M| "adcx %%rax, %%r12\n\t" 927| | 928| 1.14M| "movq 40(%[y]), %%rdx\n\t" // row 5: x * y[5] 929| 1.14M| "xorl %%eax, %%eax\n\t" 930| 1.14M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 931| 1.14M| "adcx %%rax, %%r13\n\t" 932| 1.14M| "movq %%r13, 40(%[z])\n\t" 933| 1.14M| "mulx 8(%[x]), %%rax, %%r13\n\t" 934| 1.14M| "adox %%rcx, %%rax\n\t" 935| 1.14M| "adcx %%rax, %%r14\n\t" 936| 1.14M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 937| 1.14M| "adox %%r13, %%rax\n\t" 938| 1.14M| "adcx %%rax, %%r15\n\t" 939| 1.14M| "mulx 24(%[x]), %%rax, %%r13\n\t" 940| 1.14M| "adox %%rcx, %%rax\n\t" 941| 1.14M| "adcx %%rax, %%r8\n\t" 942| 1.14M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 943| 1.14M| "adox %%r13, %%rax\n\t" 944| 1.14M| "adcx %%rax, %%r9\n\t" 945| 1.14M| "mulx 40(%[x]), %%rax, %%r13\n\t" 946| 1.14M| "adox %%rcx, %%rax\n\t" 947| 1.14M| "adcx %%rax, %%r10\n\t" 948| 1.14M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 949| 1.14M| "adox %%r13, %%rax\n\t" 950| 1.14M| "adcx %%rax, %%r11\n\t" 951| 1.14M| "mulx 56(%[x]), %%rax, %%r13\n\t" 952| 1.14M| "adox %%rcx, %%rax\n\t" 953| 1.14M| "adcx %%rax, %%r12\n\t" 954| 1.14M| "movl $0, %%eax\n\t" 955| 1.14M| "adox %%rax, %%r13\n\t" 956| 1.14M| "adcx %%rax, %%r13\n\t" 957| | 958| 1.14M| "movq 48(%[y]), %%rdx\n\t" // row 6: x * y[6] 959| 1.14M| "xorl %%eax, %%eax\n\t" 960| 1.14M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 961| 1.14M| "adcx %%rax, %%r14\n\t" 962| 1.14M| "movq %%r14, 48(%[z])\n\t" 963| 1.14M| "mulx 8(%[x]), %%rax, %%r14\n\t" 964| 1.14M| "adox %%rcx, %%rax\n\t" 965| 1.14M| "adcx %%rax, %%r15\n\t" 966| 1.14M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 967| 1.14M| "adox %%r14, %%rax\n\t" 968| 1.14M| "adcx %%rax, %%r8\n\t" 969| 1.14M| "mulx 24(%[x]), %%rax, %%r14\n\t" 970| 1.14M| "adox %%rcx, %%rax\n\t" 971| 1.14M| "adcx %%rax, %%r9\n\t" 972| 1.14M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 973| 1.14M| "adox %%r14, %%rax\n\t" 974| 1.14M| "adcx %%rax, %%r10\n\t" 975| 1.14M| "mulx 40(%[x]), %%rax, %%r14\n\t" 976| 1.14M| "adox %%rcx, %%rax\n\t" 977| 1.14M| "adcx %%rax, %%r11\n\t" 978| 1.14M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 979| 1.14M| "adox %%r14, %%rax\n\t" 980| 1.14M| "adcx %%rax, %%r12\n\t" 981| 1.14M| "mulx 56(%[x]), %%rax, %%r14\n\t" 982| 1.14M| "adox %%rcx, %%rax\n\t" 983| 1.14M| "adcx %%rax, %%r13\n\t" 984| 1.14M| "movl $0, %%eax\n\t" 985| 1.14M| "adox %%rax, %%r14\n\t" 986| 1.14M| "adcx %%rax, %%r14\n\t" 987| | 988| 1.14M| "movq 56(%[y]), %%rdx\n\t" // row 7: x * y[7] 989| 1.14M| "xorl %%eax, %%eax\n\t" 990| 1.14M| "mulx 0(%[x]), %%rax, %%rcx\n\t" 991| 1.14M| "adcx %%rax, %%r15\n\t" 992| 1.14M| "movq %%r15, 56(%[z])\n\t" 993| 1.14M| "mulx 8(%[x]), %%rax, %%r15\n\t" 994| 1.14M| "adox %%rcx, %%rax\n\t" 995| 1.14M| "adcx %%rax, %%r8\n\t" 996| 1.14M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 997| 1.14M| "adox %%r15, %%rax\n\t" 998| 1.14M| "adcx %%rax, %%r9\n\t" 999| 1.14M| "mulx 24(%[x]), %%rax, %%r15\n\t" 1000| 1.14M| "adox %%rcx, %%rax\n\t" 1001| 1.14M| "adcx %%rax, %%r10\n\t" 1002| 1.14M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1003| 1.14M| "adox %%r15, %%rax\n\t" 1004| 1.14M| "adcx %%rax, %%r11\n\t" 1005| 1.14M| "mulx 40(%[x]), %%rax, %%r15\n\t" 1006| 1.14M| "adox %%rcx, %%rax\n\t" 1007| 1.14M| "adcx %%rax, %%r12\n\t" 1008| 1.14M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1009| 1.14M| "adox %%r15, %%rax\n\t" 1010| 1.14M| "adcx %%rax, %%r13\n\t" 1011| 1.14M| "mulx 56(%[x]), %%rax, %%r15\n\t" 1012| 1.14M| "adox %%rcx, %%rax\n\t" 1013| 1.14M| "adcx %%rax, %%r14\n\t" 1014| 1.14M| "movl $0, %%eax\n\t" 1015| 1.14M| "adox %%rax, %%r15\n\t" 1016| 1.14M| "adcx %%rax, %%r15\n\t" 1017| | 1018| 1.14M| "movq %%r8, 64(%[z])\n\t" 1019| 1.14M| "movq %%r9, 72(%[z])\n\t" 1020| 1.14M| "movq %%r10, 80(%[z])\n\t" 1021| 1.14M| "movq %%r11, 88(%[z])\n\t" 1022| 1.14M| "movq %%r12, 96(%[z])\n\t" 1023| 1.14M| "movq %%r13, 104(%[z])\n\t" 1024| 1.14M| "movq %%r14, 112(%[z])\n\t" 1025| 1.14M| "movq %%r15, 120(%[z])\n\t" 1026| 1.14M| : 1027| 1.14M| : [z] "r"(z), [x] "r"(x), [y] "r"(y) 1028| 1.14M| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15", "cc", "memory"); 1029| | // clang-format on 1030| 1.14M|} _ZN5Botan16bigint_mulx_sqr9EPmPKm: 1032| 1.06M|void bigint_mulx_sqr9(word z[18], const word x[9]) { 1033| | // clang-format off 1034| 1.06M| asm( 1035| 1.06M| "xorl %%r9d, %%r9d\n\t" 1036| 1.06M| "xorl %%r10d, %%r10d\n\t" 1037| 1.06M| "xorl %%r11d, %%r11d\n\t" 1038| 1.06M| "xorl %%r12d, %%r12d\n\t" 1039| 1.06M| "xorl %%r13d, %%r13d\n\t" 1040| 1.06M| "xorl %%r14d, %%r14d\n\t" 1041| 1.06M| "xorl %%r15d, %%r15d\n\t" 1042| 1.06M| "xorl %%r8d, %%r8d\n\t" 1043| | 1044| 1.06M| "movq 0(%[x]), %%rdx\n\t" // x[0] * x[1..8] 1045| 1.06M| "xorl %%eax, %%eax\n\t" 1046| 1.06M| "mulx 8(%[x]), %%rax, %%rcx\n\t" 1047| 1.06M| "adcx %%rax, %%r9\n\t" 1048| 1.06M| "movq %%r9, 8(%[z])\n\t" 1049| 1.06M| "mulx 16(%[x]), %%rax, %%r9\n\t" 1050| 1.06M| "adox %%rcx, %%rax\n\t" 1051| 1.06M| "adcx %%rax, %%r10\n\t" 1052| 1.06M| "mulx 24(%[x]), %%rax, %%rcx\n\t" 1053| 1.06M| "adox %%r9, %%rax\n\t" 1054| 1.06M| "adcx %%rax, %%r11\n\t" 1055| 1.06M| "mulx 32(%[x]), %%rax, %%r9\n\t" 1056| 1.06M| "adox %%rcx, %%rax\n\t" 1057| 1.06M| "adcx %%rax, %%r12\n\t" 1058| 1.06M| "mulx 40(%[x]), %%rax, %%rcx\n\t" 1059| 1.06M| "adox %%r9, %%rax\n\t" 1060| 1.06M| "adcx %%rax, %%r13\n\t" 1061| 1.06M| "mulx 48(%[x]), %%rax, %%r9\n\t" 1062| 1.06M| "adox %%rcx, %%rax\n\t" 1063| 1.06M| "adcx %%rax, %%r14\n\t" 1064| 1.06M| "mulx 56(%[x]), %%rax, %%rcx\n\t" 1065| 1.06M| "adox %%r9, %%rax\n\t" 1066| 1.06M| "adcx %%rax, %%r15\n\t" 1067| 1.06M| "mulx 64(%[x]), %%rax, %%r9\n\t" 1068| 1.06M| "adox %%rcx, %%rax\n\t" 1069| 1.06M| "adcx %%rax, %%r8\n\t" 1070| 1.06M| "movl $0, %%eax\n\t" 1071| 1.06M| "adox %%rax, %%r9\n\t" 1072| 1.06M| "adcx %%rax, %%r9\n\t" 1073| 1.06M| "movq %%r10, 16(%[z])\n\t" 1074| | 1075| 1.06M| "movq 8(%[x]), %%rdx\n\t" // x[1] * x[2..8] 1076| 1.06M| "xorl %%eax, %%eax\n\t" 1077| 1.06M| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1078| 1.06M| "adcx %%rax, %%r11\n\t" 1079| 1.06M| "movq %%r11, 24(%[z])\n\t" 1080| 1.06M| "mulx 24(%[x]), %%rax, %%r10\n\t" 1081| 1.06M| "adox %%rcx, %%rax\n\t" 1082| 1.06M| "adcx %%rax, %%r12\n\t" 1083| 1.06M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1084| 1.06M| "adox %%r10, %%rax\n\t" 1085| 1.06M| "adcx %%rax, %%r13\n\t" 1086| 1.06M| "mulx 40(%[x]), %%rax, %%r10\n\t" 1087| 1.06M| "adox %%rcx, %%rax\n\t" 1088| 1.06M| "adcx %%rax, %%r14\n\t" 1089| 1.06M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1090| 1.06M| "adox %%r10, %%rax\n\t" 1091| 1.06M| "adcx %%rax, %%r15\n\t" 1092| 1.06M| "mulx 56(%[x]), %%rax, %%r10\n\t" 1093| 1.06M| "adox %%rcx, %%rax\n\t" 1094| 1.06M| "adcx %%rax, %%r8\n\t" 1095| 1.06M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1096| 1.06M| "adox %%r10, %%rax\n\t" 1097| 1.06M| "adcx %%rax, %%r9\n\t" 1098| 1.06M| "movl $0, %%eax\n\t" 1099| 1.06M| "adox %%rax, %%rcx\n\t" 1100| 1.06M| "adcx %%rax, %%rcx\n\t" 1101| 1.06M| "movq %%rcx, %%r10\n\t" 1102| 1.06M| "movq %%r12, 32(%[z])\n\t" 1103| | 1104| 1.06M| "movq 16(%[x]), %%rdx\n\t" // x[2] * x[3..8] 1105| 1.06M| "xorl %%eax, %%eax\n\t" 1106| 1.06M| "mulx 24(%[x]), %%rax, %%rcx\n\t" 1107| 1.06M| "adcx %%rax, %%r13\n\t" 1108| 1.06M| "movq %%r13, 40(%[z])\n\t" 1109| 1.06M| "mulx 32(%[x]), %%rax, %%r11\n\t" 1110| 1.06M| "adox %%rcx, %%rax\n\t" 1111| 1.06M| "adcx %%rax, %%r14\n\t" 1112| 1.06M| "mulx 40(%[x]), %%rax, %%rcx\n\t" 1113| 1.06M| "adox %%r11, %%rax\n\t" 1114| 1.06M| "adcx %%rax, %%r15\n\t" 1115| 1.06M| "mulx 48(%[x]), %%rax, %%r11\n\t" 1116| 1.06M| "adox %%rcx, %%rax\n\t" 1117| 1.06M| "adcx %%rax, %%r8\n\t" 1118| 1.06M| "mulx 56(%[x]), %%rax, %%rcx\n\t" 1119| 1.06M| "adox %%r11, %%rax\n\t" 1120| 1.06M| "adcx %%rax, %%r9\n\t" 1121| 1.06M| "mulx 64(%[x]), %%rax, %%r11\n\t" 1122| 1.06M| "adox %%rcx, %%rax\n\t" 1123| 1.06M| "adcx %%rax, %%r10\n\t" 1124| 1.06M| "movl $0, %%eax\n\t" 1125| 1.06M| "adox %%rax, %%r11\n\t" 1126| 1.06M| "adcx %%rax, %%r11\n\t" 1127| 1.06M| "movq %%r14, 48(%[z])\n\t" 1128| | 1129| 1.06M| "movq 24(%[x]), %%rdx\n\t" // x[3] * x[4..8] 1130| 1.06M| "xorl %%eax, %%eax\n\t" 1131| 1.06M| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1132| 1.06M| "adcx %%rax, %%r15\n\t" 1133| 1.06M| "movq %%r15, 56(%[z])\n\t" 1134| 1.06M| "mulx 40(%[x]), %%rax, %%r12\n\t" 1135| 1.06M| "adox %%rcx, %%rax\n\t" 1136| 1.06M| "adcx %%rax, %%r8\n\t" 1137| 1.06M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1138| 1.06M| "adox %%r12, %%rax\n\t" 1139| 1.06M| "adcx %%rax, %%r9\n\t" 1140| 1.06M| "mulx 56(%[x]), %%rax, %%r12\n\t" 1141| 1.06M| "adox %%rcx, %%rax\n\t" 1142| 1.06M| "adcx %%rax, %%r10\n\t" 1143| 1.06M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1144| 1.06M| "adox %%r12, %%rax\n\t" 1145| 1.06M| "adcx %%rax, %%r11\n\t" 1146| 1.06M| "movl $0, %%eax\n\t" 1147| 1.06M| "adox %%rax, %%rcx\n\t" 1148| 1.06M| "adcx %%rax, %%rcx\n\t" 1149| 1.06M| "movq %%rcx, %%r12\n\t" 1150| 1.06M| "movq %%r8, 64(%[z])\n\t" 1151| | 1152| 1.06M| "movq 32(%[x]), %%rdx\n\t" // x[4] * x[5..8] 1153| 1.06M| "xorl %%eax, %%eax\n\t" 1154| 1.06M| "mulx 40(%[x]), %%rax, %%rcx\n\t" 1155| 1.06M| "adcx %%rax, %%r9\n\t" 1156| 1.06M| "movq %%r9, 72(%[z])\n\t" 1157| 1.06M| "mulx 48(%[x]), %%rax, %%r13\n\t" 1158| 1.06M| "adox %%rcx, %%rax\n\t" 1159| 1.06M| "adcx %%rax, %%r10\n\t" 1160| 1.06M| "mulx 56(%[x]), %%rax, %%rcx\n\t" 1161| 1.06M| "adox %%r13, %%rax\n\t" 1162| 1.06M| "adcx %%rax, %%r11\n\t" 1163| 1.06M| "mulx 64(%[x]), %%rax, %%r13\n\t" 1164| 1.06M| "adox %%rcx, %%rax\n\t" 1165| 1.06M| "adcx %%rax, %%r12\n\t" 1166| 1.06M| "movl $0, %%eax\n\t" 1167| 1.06M| "adox %%rax, %%r13\n\t" 1168| 1.06M| "adcx %%rax, %%r13\n\t" 1169| 1.06M| "movq %%r10, 80(%[z])\n\t" 1170| | 1171| 1.06M| "movq 40(%[x]), %%rdx\n\t" // x[5] * x[6..8] 1172| 1.06M| "xorl %%eax, %%eax\n\t" 1173| 1.06M| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1174| 1.06M| "adcx %%rax, %%r11\n\t" 1175| 1.06M| "movq %%r11, 88(%[z])\n\t" 1176| 1.06M| "mulx 56(%[x]), %%rax, %%r14\n\t" 1177| 1.06M| "adox %%rcx, %%rax\n\t" 1178| 1.06M| "adcx %%rax, %%r12\n\t" 1179| 1.06M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1180| 1.06M| "adox %%r14, %%rax\n\t" 1181| 1.06M| "adcx %%rax, %%r13\n\t" 1182| 1.06M| "movl $0, %%eax\n\t" 1183| 1.06M| "adox %%rax, %%rcx\n\t" 1184| 1.06M| "adcx %%rax, %%rcx\n\t" 1185| 1.06M| "movq %%rcx, %%r14\n\t" 1186| 1.06M| "movq %%r12, 96(%[z])\n\t" 1187| | 1188| 1.06M| "movq 48(%[x]), %%rdx\n\t" // x[6] * x[7..8] 1189| 1.06M| "xorl %%eax, %%eax\n\t" 1190| 1.06M| "mulx 56(%[x]), %%rax, %%rcx\n\t" 1191| 1.06M| "adcx %%rax, %%r13\n\t" 1192| 1.06M| "movq %%r13, 104(%[z])\n\t" 1193| 1.06M| "mulx 64(%[x]), %%rax, %%r15\n\t" 1194| 1.06M| "adox %%rcx, %%rax\n\t" 1195| 1.06M| "adcx %%rax, %%r14\n\t" 1196| 1.06M| "movl $0, %%eax\n\t" 1197| 1.06M| "adox %%rax, %%r15\n\t" 1198| 1.06M| "adcx %%rax, %%r15\n\t" 1199| 1.06M| "movq %%r14, 112(%[z])\n\t" 1200| | 1201| 1.06M| "movq 56(%[x]), %%rdx\n\t" // x[7] * x[8..8] 1202| 1.06M| "xorl %%eax, %%eax\n\t" 1203| 1.06M| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1204| 1.06M| "adcx %%rax, %%r15\n\t" 1205| 1.06M| "movq %%r15, 120(%[z])\n\t" 1206| 1.06M| "movl $0, %%eax\n\t" 1207| 1.06M| "adox %%rax, %%rcx\n\t" 1208| 1.06M| "adcx %%rax, %%rcx\n\t" 1209| 1.06M| "movq %%rcx, %%r8\n\t" 1210| 1.06M| "movq %%r8, 128(%[z])\n\t" 1211| | 1212| 1.06M| "movq $0, 136(%[z])\n\t" 1213| 1.06M| "xorl %%eax, %%eax\n\t" // double the cross products and add the squares 1214| 1.06M| "movq 0(%[x]), %%rdx\n\t" 1215| 1.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 1216| 1.06M| "movq %%rax, 0(%[z])\n\t" 1217| 1.06M| "movq 8(%[z]), %%r8\n\t" 1218| 1.06M| "adcx %%r8, %%r8\n\t" 1219| 1.06M| "adox %%rcx, %%r8\n\t" 1220| 1.06M| "movq %%r8, 8(%[z])\n\t" 1221| 1.06M| "movq 8(%[x]), %%rdx\n\t" 1222| 1.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 1223| 1.06M| "movq 16(%[z]), %%r8\n\t" 1224| 1.06M| "adcx %%r8, %%r8\n\t" 1225| 1.06M| "adox %%rax, %%r8\n\t" 1226| 1.06M| "movq %%r8, 16(%[z])\n\t" 1227| 1.06M| "movq 24(%[z]), %%r8\n\t" 1228| 1.06M| "adcx %%r8, %%r8\n\t" 1229| 1.06M| "adox %%rcx, %%r8\n\t" 1230| 1.06M| "movq %%r8, 24(%[z])\n\t" 1231| 1.06M| "movq 16(%[x]), %%rdx\n\t" 1232| 1.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 1233| 1.06M| "movq 32(%[z]), %%r8\n\t" 1234| 1.06M| "adcx %%r8, %%r8\n\t" 1235| 1.06M| "adox %%rax, %%r8\n\t" 1236| 1.06M| "movq %%r8, 32(%[z])\n\t" 1237| 1.06M| "movq 40(%[z]), %%r8\n\t" 1238| 1.06M| "adcx %%r8, %%r8\n\t" 1239| 1.06M| "adox %%rcx, %%r8\n\t" 1240| 1.06M| "movq %%r8, 40(%[z])\n\t" 1241| 1.06M| "movq 24(%[x]), %%rdx\n\t" 1242| 1.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 1243| 1.06M| "movq 48(%[z]), %%r8\n\t" 1244| 1.06M| "adcx %%r8, %%r8\n\t" 1245| 1.06M| "adox %%rax, %%r8\n\t" 1246| 1.06M| "movq %%r8, 48(%[z])\n\t" 1247| 1.06M| "movq 56(%[z]), %%r8\n\t" 1248| 1.06M| "adcx %%r8, %%r8\n\t" 1249| 1.06M| "adox %%rcx, %%r8\n\t" 1250| 1.06M| "movq %%r8, 56(%[z])\n\t" 1251| 1.06M| "movq 32(%[x]), %%rdx\n\t" 1252| 1.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 1253| 1.06M| "movq 64(%[z]), %%r8\n\t" 1254| 1.06M| "adcx %%r8, %%r8\n\t" 1255| 1.06M| "adox %%rax, %%r8\n\t" 1256| 1.06M| "movq %%r8, 64(%[z])\n\t" 1257| 1.06M| "movq 72(%[z]), %%r8\n\t" 1258| 1.06M| "adcx %%r8, %%r8\n\t" 1259| 1.06M| "adox %%rcx, %%r8\n\t" 1260| 1.06M| "movq %%r8, 72(%[z])\n\t" 1261| 1.06M| "movq 40(%[x]), %%rdx\n\t" 1262| 1.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 1263| 1.06M| "movq 80(%[z]), %%r8\n\t" 1264| 1.06M| "adcx %%r8, %%r8\n\t" 1265| 1.06M| "adox %%rax, %%r8\n\t" 1266| 1.06M| "movq %%r8, 80(%[z])\n\t" 1267| 1.06M| "movq 88(%[z]), %%r8\n\t" 1268| 1.06M| "adcx %%r8, %%r8\n\t" 1269| 1.06M| "adox %%rcx, %%r8\n\t" 1270| 1.06M| "movq %%r8, 88(%[z])\n\t" 1271| 1.06M| "movq 48(%[x]), %%rdx\n\t" 1272| 1.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 1273| 1.06M| "movq 96(%[z]), %%r8\n\t" 1274| 1.06M| "adcx %%r8, %%r8\n\t" 1275| 1.06M| "adox %%rax, %%r8\n\t" 1276| 1.06M| "movq %%r8, 96(%[z])\n\t" 1277| 1.06M| "movq 104(%[z]), %%r8\n\t" 1278| 1.06M| "adcx %%r8, %%r8\n\t" 1279| 1.06M| "adox %%rcx, %%r8\n\t" 1280| 1.06M| "movq %%r8, 104(%[z])\n\t" 1281| 1.06M| "movq 56(%[x]), %%rdx\n\t" 1282| 1.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 1283| 1.06M| "movq 112(%[z]), %%r8\n\t" 1284| 1.06M| "adcx %%r8, %%r8\n\t" 1285| 1.06M| "adox %%rax, %%r8\n\t" 1286| 1.06M| "movq %%r8, 112(%[z])\n\t" 1287| 1.06M| "movq 120(%[z]), %%r8\n\t" 1288| 1.06M| "adcx %%r8, %%r8\n\t" 1289| 1.06M| "adox %%rcx, %%r8\n\t" 1290| 1.06M| "movq %%r8, 120(%[z])\n\t" 1291| 1.06M| "movq 64(%[x]), %%rdx\n\t" 1292| 1.06M| "mulx %%rdx, %%rax, %%rcx\n\t" 1293| 1.06M| "movq 128(%[z]), %%r8\n\t" 1294| 1.06M| "adcx %%r8, %%r8\n\t" 1295| 1.06M| "adox %%rax, %%r8\n\t" 1296| 1.06M| "movq %%r8, 128(%[z])\n\t" 1297| 1.06M| "movq 136(%[z]), %%r8\n\t" 1298| 1.06M| "adcx %%r8, %%r8\n\t" 1299| 1.06M| "adox %%rcx, %%r8\n\t" 1300| 1.06M| "movq %%r8, 136(%[z])\n\t" 1301| 1.06M| : 1302| 1.06M| : [z] "r"(z), [x] "r"(x) 1303| 1.06M| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15", "cc", "memory"); 1304| | // clang-format on 1305| 1.06M|} _ZN5Botan16bigint_mulx_mul9EPmPKmS2_: 1307| 979k|void bigint_mulx_mul9(word z[18], const word x[9], const word y[9]) { 1308| 979k| copy_mem(z + 9, y, 9); 1309| | // clang-format off 1310| 979k| asm( 1311| 979k| "xorl %%r8d, %%r8d\n\t" 1312| 979k| "xorl %%r9d, %%r9d\n\t" 1313| 979k| "xorl %%r10d, %%r10d\n\t" 1314| 979k| "xorl %%r11d, %%r11d\n\t" 1315| 979k| "xorl %%r12d, %%r12d\n\t" 1316| 979k| "xorl %%r13d, %%r13d\n\t" 1317| 979k| "xorl %%r14d, %%r14d\n\t" 1318| 979k| "xorl %%r15d, %%r15d\n\t" 1319| 979k| "xorl %%ebx, %%ebx\n\t" 1320| | 1321| 979k| "movq 72(%[z]), %%rdx\n\t" // row 0: x * y[0] 1322| 979k| "xorl %%eax, %%eax\n\t" 1323| 979k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1324| 979k| "adcx %%rax, %%r8\n\t" 1325| 979k| "movq %%r8, 0(%[z])\n\t" 1326| 979k| "mulx 8(%[x]), %%rax, %%r8\n\t" 1327| 979k| "adox %%rcx, %%rax\n\t" 1328| 979k| "adcx %%rax, %%r9\n\t" 1329| 979k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1330| 979k| "adox %%r8, %%rax\n\t" 1331| 979k| "adcx %%rax, %%r10\n\t" 1332| 979k| "mulx 24(%[x]), %%rax, %%r8\n\t" 1333| 979k| "adox %%rcx, %%rax\n\t" 1334| 979k| "adcx %%rax, %%r11\n\t" 1335| 979k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1336| 979k| "adox %%r8, %%rax\n\t" 1337| 979k| "adcx %%rax, %%r12\n\t" 1338| 979k| "mulx 40(%[x]), %%rax, %%r8\n\t" 1339| 979k| "adox %%rcx, %%rax\n\t" 1340| 979k| "adcx %%rax, %%r13\n\t" 1341| 979k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1342| 979k| "adox %%r8, %%rax\n\t" 1343| 979k| "adcx %%rax, %%r14\n\t" 1344| 979k| "mulx 56(%[x]), %%rax, %%r8\n\t" 1345| 979k| "adox %%rcx, %%rax\n\t" 1346| 979k| "adcx %%rax, %%r15\n\t" 1347| 979k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1348| 979k| "adox %%r8, %%rax\n\t" 1349| 979k| "adcx %%rax, %%rbx\n\t" 1350| 979k| "movl $0, %%eax\n\t" 1351| 979k| "adox %%rax, %%rcx\n\t" 1352| 979k| "adcx %%rax, %%rcx\n\t" 1353| 979k| "movq %%rcx, %%r8\n\t" 1354| | 1355| 979k| "movq 80(%[z]), %%rdx\n\t" // row 1: x * y[1] 1356| 979k| "xorl %%eax, %%eax\n\t" 1357| 979k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1358| 979k| "adcx %%rax, %%r9\n\t" 1359| 979k| "movq %%r9, 8(%[z])\n\t" 1360| 979k| "mulx 8(%[x]), %%rax, %%r9\n\t" 1361| 979k| "adox %%rcx, %%rax\n\t" 1362| 979k| "adcx %%rax, %%r10\n\t" 1363| 979k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1364| 979k| "adox %%r9, %%rax\n\t" 1365| 979k| "adcx %%rax, %%r11\n\t" 1366| 979k| "mulx 24(%[x]), %%rax, %%r9\n\t" 1367| 979k| "adox %%rcx, %%rax\n\t" 1368| 979k| "adcx %%rax, %%r12\n\t" 1369| 979k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1370| 979k| "adox %%r9, %%rax\n\t" 1371| 979k| "adcx %%rax, %%r13\n\t" 1372| 979k| "mulx 40(%[x]), %%rax, %%r9\n\t" 1373| 979k| "adox %%rcx, %%rax\n\t" 1374| 979k| "adcx %%rax, %%r14\n\t" 1375| 979k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1376| 979k| "adox %%r9, %%rax\n\t" 1377| 979k| "adcx %%rax, %%r15\n\t" 1378| 979k| "mulx 56(%[x]), %%rax, %%r9\n\t" 1379| 979k| "adox %%rcx, %%rax\n\t" 1380| 979k| "adcx %%rax, %%rbx\n\t" 1381| 979k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1382| 979k| "adox %%r9, %%rax\n\t" 1383| 979k| "adcx %%rax, %%r8\n\t" 1384| 979k| "movl $0, %%eax\n\t" 1385| 979k| "adox %%rax, %%rcx\n\t" 1386| 979k| "adcx %%rax, %%rcx\n\t" 1387| 979k| "movq %%rcx, %%r9\n\t" 1388| | 1389| 979k| "movq 88(%[z]), %%rdx\n\t" // row 2: x * y[2] 1390| 979k| "xorl %%eax, %%eax\n\t" 1391| 979k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1392| 979k| "adcx %%rax, %%r10\n\t" 1393| 979k| "movq %%r10, 16(%[z])\n\t" 1394| 979k| "mulx 8(%[x]), %%rax, %%r10\n\t" 1395| 979k| "adox %%rcx, %%rax\n\t" 1396| 979k| "adcx %%rax, %%r11\n\t" 1397| 979k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1398| 979k| "adox %%r10, %%rax\n\t" 1399| 979k| "adcx %%rax, %%r12\n\t" 1400| 979k| "mulx 24(%[x]), %%rax, %%r10\n\t" 1401| 979k| "adox %%rcx, %%rax\n\t" 1402| 979k| "adcx %%rax, %%r13\n\t" 1403| 979k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1404| 979k| "adox %%r10, %%rax\n\t" 1405| 979k| "adcx %%rax, %%r14\n\t" 1406| 979k| "mulx 40(%[x]), %%rax, %%r10\n\t" 1407| 979k| "adox %%rcx, %%rax\n\t" 1408| 979k| "adcx %%rax, %%r15\n\t" 1409| 979k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1410| 979k| "adox %%r10, %%rax\n\t" 1411| 979k| "adcx %%rax, %%rbx\n\t" 1412| 979k| "mulx 56(%[x]), %%rax, %%r10\n\t" 1413| 979k| "adox %%rcx, %%rax\n\t" 1414| 979k| "adcx %%rax, %%r8\n\t" 1415| 979k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1416| 979k| "adox %%r10, %%rax\n\t" 1417| 979k| "adcx %%rax, %%r9\n\t" 1418| 979k| "movl $0, %%eax\n\t" 1419| 979k| "adox %%rax, %%rcx\n\t" 1420| 979k| "adcx %%rax, %%rcx\n\t" 1421| 979k| "movq %%rcx, %%r10\n\t" 1422| | 1423| 979k| "movq 96(%[z]), %%rdx\n\t" // row 3: x * y[3] 1424| 979k| "xorl %%eax, %%eax\n\t" 1425| 979k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1426| 979k| "adcx %%rax, %%r11\n\t" 1427| 979k| "movq %%r11, 24(%[z])\n\t" 1428| 979k| "mulx 8(%[x]), %%rax, %%r11\n\t" 1429| 979k| "adox %%rcx, %%rax\n\t" 1430| 979k| "adcx %%rax, %%r12\n\t" 1431| 979k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1432| 979k| "adox %%r11, %%rax\n\t" 1433| 979k| "adcx %%rax, %%r13\n\t" 1434| 979k| "mulx 24(%[x]), %%rax, %%r11\n\t" 1435| 979k| "adox %%rcx, %%rax\n\t" 1436| 979k| "adcx %%rax, %%r14\n\t" 1437| 979k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1438| 979k| "adox %%r11, %%rax\n\t" 1439| 979k| "adcx %%rax, %%r15\n\t" 1440| 979k| "mulx 40(%[x]), %%rax, %%r11\n\t" 1441| 979k| "adox %%rcx, %%rax\n\t" 1442| 979k| "adcx %%rax, %%rbx\n\t" 1443| 979k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1444| 979k| "adox %%r11, %%rax\n\t" 1445| 979k| "adcx %%rax, %%r8\n\t" 1446| 979k| "mulx 56(%[x]), %%rax, %%r11\n\t" 1447| 979k| "adox %%rcx, %%rax\n\t" 1448| 979k| "adcx %%rax, %%r9\n\t" 1449| 979k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1450| 979k| "adox %%r11, %%rax\n\t" 1451| 979k| "adcx %%rax, %%r10\n\t" 1452| 979k| "movl $0, %%eax\n\t" 1453| 979k| "adox %%rax, %%rcx\n\t" 1454| 979k| "adcx %%rax, %%rcx\n\t" 1455| 979k| "movq %%rcx, %%r11\n\t" 1456| | 1457| 979k| "movq 104(%[z]), %%rdx\n\t" // row 4: x * y[4] 1458| 979k| "xorl %%eax, %%eax\n\t" 1459| 979k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1460| 979k| "adcx %%rax, %%r12\n\t" 1461| 979k| "movq %%r12, 32(%[z])\n\t" 1462| 979k| "mulx 8(%[x]), %%rax, %%r12\n\t" 1463| 979k| "adox %%rcx, %%rax\n\t" 1464| 979k| "adcx %%rax, %%r13\n\t" 1465| 979k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1466| 979k| "adox %%r12, %%rax\n\t" 1467| 979k| "adcx %%rax, %%r14\n\t" 1468| 979k| "mulx 24(%[x]), %%rax, %%r12\n\t" 1469| 979k| "adox %%rcx, %%rax\n\t" 1470| 979k| "adcx %%rax, %%r15\n\t" 1471| 979k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1472| 979k| "adox %%r12, %%rax\n\t" 1473| 979k| "adcx %%rax, %%rbx\n\t" 1474| 979k| "mulx 40(%[x]), %%rax, %%r12\n\t" 1475| 979k| "adox %%rcx, %%rax\n\t" 1476| 979k| "adcx %%rax, %%r8\n\t" 1477| 979k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1478| 979k| "adox %%r12, %%rax\n\t" 1479| 979k| "adcx %%rax, %%r9\n\t" 1480| 979k| "mulx 56(%[x]), %%rax, %%r12\n\t" 1481| 979k| "adox %%rcx, %%rax\n\t" 1482| 979k| "adcx %%rax, %%r10\n\t" 1483| 979k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1484| 979k| "adox %%r12, %%rax\n\t" 1485| 979k| "adcx %%rax, %%r11\n\t" 1486| 979k| "movl $0, %%eax\n\t" 1487| 979k| "adox %%rax, %%rcx\n\t" 1488| 979k| "adcx %%rax, %%rcx\n\t" 1489| 979k| "movq %%rcx, %%r12\n\t" 1490| | 1491| 979k| "movq 112(%[z]), %%rdx\n\t" // row 5: x * y[5] 1492| 979k| "xorl %%eax, %%eax\n\t" 1493| 979k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1494| 979k| "adcx %%rax, %%r13\n\t" 1495| 979k| "movq %%r13, 40(%[z])\n\t" 1496| 979k| "mulx 8(%[x]), %%rax, %%r13\n\t" 1497| 979k| "adox %%rcx, %%rax\n\t" 1498| 979k| "adcx %%rax, %%r14\n\t" 1499| 979k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1500| 979k| "adox %%r13, %%rax\n\t" 1501| 979k| "adcx %%rax, %%r15\n\t" 1502| 979k| "mulx 24(%[x]), %%rax, %%r13\n\t" 1503| 979k| "adox %%rcx, %%rax\n\t" 1504| 979k| "adcx %%rax, %%rbx\n\t" 1505| 979k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1506| 979k| "adox %%r13, %%rax\n\t" 1507| 979k| "adcx %%rax, %%r8\n\t" 1508| 979k| "mulx 40(%[x]), %%rax, %%r13\n\t" 1509| 979k| "adox %%rcx, %%rax\n\t" 1510| 979k| "adcx %%rax, %%r9\n\t" 1511| 979k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1512| 979k| "adox %%r13, %%rax\n\t" 1513| 979k| "adcx %%rax, %%r10\n\t" 1514| 979k| "mulx 56(%[x]), %%rax, %%r13\n\t" 1515| 979k| "adox %%rcx, %%rax\n\t" 1516| 979k| "adcx %%rax, %%r11\n\t" 1517| 979k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1518| 979k| "adox %%r13, %%rax\n\t" 1519| 979k| "adcx %%rax, %%r12\n\t" 1520| 979k| "movl $0, %%eax\n\t" 1521| 979k| "adox %%rax, %%rcx\n\t" 1522| 979k| "adcx %%rax, %%rcx\n\t" 1523| 979k| "movq %%rcx, %%r13\n\t" 1524| | 1525| 979k| "movq 120(%[z]), %%rdx\n\t" // row 6: x * y[6] 1526| 979k| "xorl %%eax, %%eax\n\t" 1527| 979k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1528| 979k| "adcx %%rax, %%r14\n\t" 1529| 979k| "movq %%r14, 48(%[z])\n\t" 1530| 979k| "mulx 8(%[x]), %%rax, %%r14\n\t" 1531| 979k| "adox %%rcx, %%rax\n\t" 1532| 979k| "adcx %%rax, %%r15\n\t" 1533| 979k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1534| 979k| "adox %%r14, %%rax\n\t" 1535| 979k| "adcx %%rax, %%rbx\n\t" 1536| 979k| "mulx 24(%[x]), %%rax, %%r14\n\t" 1537| 979k| "adox %%rcx, %%rax\n\t" 1538| 979k| "adcx %%rax, %%r8\n\t" 1539| 979k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1540| 979k| "adox %%r14, %%rax\n\t" 1541| 979k| "adcx %%rax, %%r9\n\t" 1542| 979k| "mulx 40(%[x]), %%rax, %%r14\n\t" 1543| 979k| "adox %%rcx, %%rax\n\t" 1544| 979k| "adcx %%rax, %%r10\n\t" 1545| 979k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1546| 979k| "adox %%r14, %%rax\n\t" 1547| 979k| "adcx %%rax, %%r11\n\t" 1548| 979k| "mulx 56(%[x]), %%rax, %%r14\n\t" 1549| 979k| "adox %%rcx, %%rax\n\t" 1550| 979k| "adcx %%rax, %%r12\n\t" 1551| 979k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1552| 979k| "adox %%r14, %%rax\n\t" 1553| 979k| "adcx %%rax, %%r13\n\t" 1554| 979k| "movl $0, %%eax\n\t" 1555| 979k| "adox %%rax, %%rcx\n\t" 1556| 979k| "adcx %%rax, %%rcx\n\t" 1557| 979k| "movq %%rcx, %%r14\n\t" 1558| | 1559| 979k| "movq 128(%[z]), %%rdx\n\t" // row 7: x * y[7] 1560| 979k| "xorl %%eax, %%eax\n\t" 1561| 979k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1562| 979k| "adcx %%rax, %%r15\n\t" 1563| 979k| "movq %%r15, 56(%[z])\n\t" 1564| 979k| "mulx 8(%[x]), %%rax, %%r15\n\t" 1565| 979k| "adox %%rcx, %%rax\n\t" 1566| 979k| "adcx %%rax, %%rbx\n\t" 1567| 979k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1568| 979k| "adox %%r15, %%rax\n\t" 1569| 979k| "adcx %%rax, %%r8\n\t" 1570| 979k| "mulx 24(%[x]), %%rax, %%r15\n\t" 1571| 979k| "adox %%rcx, %%rax\n\t" 1572| 979k| "adcx %%rax, %%r9\n\t" 1573| 979k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1574| 979k| "adox %%r15, %%rax\n\t" 1575| 979k| "adcx %%rax, %%r10\n\t" 1576| 979k| "mulx 40(%[x]), %%rax, %%r15\n\t" 1577| 979k| "adox %%rcx, %%rax\n\t" 1578| 979k| "adcx %%rax, %%r11\n\t" 1579| 979k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1580| 979k| "adox %%r15, %%rax\n\t" 1581| 979k| "adcx %%rax, %%r12\n\t" 1582| 979k| "mulx 56(%[x]), %%rax, %%r15\n\t" 1583| 979k| "adox %%rcx, %%rax\n\t" 1584| 979k| "adcx %%rax, %%r13\n\t" 1585| 979k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1586| 979k| "adox %%r15, %%rax\n\t" 1587| 979k| "adcx %%rax, %%r14\n\t" 1588| 979k| "movl $0, %%eax\n\t" 1589| 979k| "adox %%rax, %%rcx\n\t" 1590| 979k| "adcx %%rax, %%rcx\n\t" 1591| 979k| "movq %%rcx, %%r15\n\t" 1592| | 1593| 979k| "movq 136(%[z]), %%rdx\n\t" // row 8: x * y[8] 1594| 979k| "xorl %%eax, %%eax\n\t" 1595| 979k| "mulx 0(%[x]), %%rax, %%rcx\n\t" 1596| 979k| "adcx %%rax, %%rbx\n\t" 1597| 979k| "movq %%rbx, 64(%[z])\n\t" 1598| 979k| "mulx 8(%[x]), %%rax, %%rbx\n\t" 1599| 979k| "adox %%rcx, %%rax\n\t" 1600| 979k| "adcx %%rax, %%r8\n\t" 1601| 979k| "mulx 16(%[x]), %%rax, %%rcx\n\t" 1602| 979k| "adox %%rbx, %%rax\n\t" 1603| 979k| "adcx %%rax, %%r9\n\t" 1604| 979k| "mulx 24(%[x]), %%rax, %%rbx\n\t" 1605| 979k| "adox %%rcx, %%rax\n\t" 1606| 979k| "adcx %%rax, %%r10\n\t" 1607| 979k| "mulx 32(%[x]), %%rax, %%rcx\n\t" 1608| 979k| "adox %%rbx, %%rax\n\t" 1609| 979k| "adcx %%rax, %%r11\n\t" 1610| 979k| "mulx 40(%[x]), %%rax, %%rbx\n\t" 1611| 979k| "adox %%rcx, %%rax\n\t" 1612| 979k| "adcx %%rax, %%r12\n\t" 1613| 979k| "mulx 48(%[x]), %%rax, %%rcx\n\t" 1614| 979k| "adox %%rbx, %%rax\n\t" 1615| 979k| "adcx %%rax, %%r13\n\t" 1616| 979k| "mulx 56(%[x]), %%rax, %%rbx\n\t" 1617| 979k| "adox %%rcx, %%rax\n\t" 1618| 979k| "adcx %%rax, %%r14\n\t" 1619| 979k| "mulx 64(%[x]), %%rax, %%rcx\n\t" 1620| 979k| "adox %%rbx, %%rax\n\t" 1621| 979k| "adcx %%rax, %%r15\n\t" 1622| 979k| "movl $0, %%eax\n\t" 1623| 979k| "adox %%rax, %%rcx\n\t" 1624| 979k| "adcx %%rax, %%rcx\n\t" 1625| 979k| "movq %%rcx, %%rbx\n\t" 1626| | 1627| 979k| "movq %%r8, 72(%[z])\n\t" 1628| 979k| "movq %%r9, 80(%[z])\n\t" 1629| 979k| "movq %%r10, 88(%[z])\n\t" 1630| 979k| "movq %%r11, 96(%[z])\n\t" 1631| 979k| "movq %%r12, 104(%[z])\n\t" 1632| 979k| "movq %%r13, 112(%[z])\n\t" 1633| 979k| "movq %%r14, 120(%[z])\n\t" 1634| 979k| "movq %%r15, 128(%[z])\n\t" 1635| 979k| "movq %%rbx, 136(%[z])\n\t" 1636| 979k| : 1637| 979k| : [z] "r"(z), [x] "r"(x) 1638| 979k| : "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15", "rbx", "cc", "memory"); 1639| | // clang-format on 1640| 979k|} _ZN5Botan17Barrett_ReductionC2ERKNS_6BigIntES1_m: 17| 18| 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| 18| m_modulus.grow_to(m_mod_words + 8); 20| 18| m_mu.grow_to(m_mod_words + 8); 21| 18|} _ZN5Botan17Barrett_Reduction18for_secret_modulusERKNS_6BigIntE: 23| 18|Barrett_Reduction Barrett_Reduction::for_secret_modulus(const BigInt& mod) { 24| 18| BOTAN_ARG_CHECK(mod.signum() > 0, "Modulus must be positive"); ------------------ | | 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] | | ------------------ ------------------ 25| | 26| 18| const size_t mod_words = mod.sig_words(); 27| | 28| | // Compute mu = floor(2^{2k} / m) 29| 18| const size_t mu_bits = 2 * WordInfo::bits * mod_words; 30| 18| return Barrett_Reduction(mod, ct_divide_pow2k(mu_bits, mod), mod_words); 31| 18|} _ZN5Botan17Barrett_Reduction18for_public_modulusERKNS_6BigIntE: 33| 18|Barrett_Reduction Barrett_Reduction::for_public_modulus(const BigInt& mod) { 34| 18| return Barrett_Reduction::for_secret_modulus(mod); 35| 18|} _ZNK5Botan17Barrett_Reduction8multiplyERKNS_6BigIntES3_: 153| 18|BigInt Barrett_Reduction::multiply(const BigInt& x, const BigInt& y) const { 154| 18| BOTAN_ARG_CHECK(acceptable_barrett_input(x, m_modulus).as_bool(), "Invalid x param for Barrett multiply"); ------------------ | | 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] | | ------------------ ------------------ 155| 18| BOTAN_ARG_CHECK(acceptable_barrett_input(y, m_modulus).as_bool(), "Invalid y param for Barrett multiply"); ------------------ | | 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] | | ------------------ ------------------ 156| | 157| 18| secure_vector ws(2 * (m_mod_words + 2)); 158| 18| secure_vector xy(2 * m_mod_words); 159| | 160| 18| bigint_mul(xy.data(), 161| 18| xy.size(), 162| 18| x._data(), 163| 18| x.size(), 164| 18| std::min(x.size(), m_mod_words), 165| 18| y._data(), 166| 18| y.size(), 167| 18| std::min(y.size(), m_mod_words), 168| 18| ws.data(), 169| 18| ws.size()); 170| | 171| 18| return barrett_reduce(m_mod_words, m_modulus, m_mu, xy, ws); 172| 18|} _ZNK5Botan17Barrett_Reduction6squareERKNS_6BigIntE: 174| 18|BigInt Barrett_Reduction::square(const BigInt& x) const { 175| 18| BOTAN_ARG_CHECK(acceptable_barrett_input(x, m_modulus).as_bool(), "Invalid x param for Barrett square"); ------------------ | | 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] | | ------------------ ------------------ 176| | 177| 18| secure_vector ws(2 * (m_mod_words + 2)); 178| 18| secure_vector x2(2 * m_mod_words); 179| | 180| 18| bigint_sqr(x2.data(), x2.size(), x._data(), x.size(), std::min(x.size(), m_mod_words), ws.data(), ws.size()); 181| | 182| 18| return barrett_reduce(m_mod_words, m_modulus, m_mu, x2, ws); 183| 18|} _ZNK5Botan17Barrett_Reduction6reduceERKNS_6BigIntE: 185| 12|BigInt Barrett_Reduction::reduce(const BigInt& x) const { 186| 12| BOTAN_ARG_CHECK(x.signum() >= 0, "Argument must be non-negative"); ------------------ | | 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] | | ------------------ ------------------ 187| | 188| 12| const size_t x_sw = x.sig_words(); 189| 12| BOTAN_ARG_CHECK(x_sw <= 2 * m_mod_words, "Argument is too large for Barrett reduction"); ------------------ | | 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] | | ------------------ ------------------ 190| | 191| 12| x.grow_to(2 * m_mod_words); 192| | 193| 12| secure_vector ws; 194| 12| return barrett_reduce(m_mod_words, m_modulus, m_mu, x._as_span(), ws); 195| 12|} barrett.cpp:_ZN5Botan12_GLOBAL__N_124acceptable_barrett_inputERKNS_6BigIntES3_: 145| 54|CT::Choice acceptable_barrett_input(const BigInt& x, const BigInt& modulus) { 146| 54| const auto x_is_positive = CT::Choice::from_int(static_cast(x.signum() >= 0)); 147| 54| const auto x_lt_mod = bigint_ct_is_lt(x._data(), x.size(), modulus._data(), modulus.sig_words()).as_choice(); 148| 54| return x_is_positive && x_lt_mod; 149| 54|} barrett.cpp:_ZN5Botan12_GLOBAL__N_114barrett_reduceEmRKNS_6BigIntES3_NSt3__14spanIKmLm18446744073709551615EEERNS4_6vectorImNS_16secure_allocatorImEEEE: 48| 48| size_t mod_words, const BigInt& modulus, const BigInt& mu, std::span x_words, secure_vector& ws) { 49| 48| BOTAN_ASSERT_NOMSG(modulus.sig_words() == mod_words); ------------------ | | 84| 48| do { \ | | 85| 48| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 48| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 48] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 48| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 48] | | ------------------ ------------------ 50| | 51| | // Caller must expand input to be at least this size 52| 48| BOTAN_ASSERT_NOMSG(x_words.size() >= 2 * mod_words); ------------------ | | 84| 48| do { \ | | 85| 48| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 48| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 48] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 48| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 48] | | ------------------ ------------------ 53| | 54| | // Normally mod_words + 1 but can be + 2 if the modulus is a power of 2 55| 48| const size_t mu_words = mu.sig_words(); 56| 48| BOTAN_ASSERT_NOMSG(mu_words <= mod_words + 2); ------------------ | | 84| 48| do { \ | | 85| 48| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 48| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 48] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 48| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 48] | | ------------------ ------------------ 57| | 58| 48| if(ws.size() < 2 * (mod_words + 2)) { ------------------ | Branch (58:7): [True: 12, False: 36] ------------------ 59| 12| ws.resize(2 * (mod_words + 2)); 60| 12| } 61| | 62| 48| 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| 48| secure_vector r(2 * mu_words + 2); 76| | 77| 48| 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| 48| const size_t q2_size = 2 * mu_words + 2; 84| | 85| 48| secure_vector q2(q2_size); 86| | 87| 48| bigint_mul( 88| 48| 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| 48| bigint_mul(r.data(), 93| 48| r.size(), 94| 48| &q2[mod_words + 1], // ignoring the low mod_words + 1 words of the first product 95| 48| q2.size() - (mod_words + 1), 96| 48| mod_words + 1, 97| 48| modulus._data(), 98| 48| modulus.size(), 99| 48| mod_words, 100| 48| ws.data(), 101| 48| 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| 48| 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| 48| const int32_t relative_size = bigint_cmp(r.data(), mod_words + 1, x_words.data(), mod_words + 1); 111| | 112| 48| 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| 48| clear_mem(ws.data(), mod_words + 2); 120| 48| ws[mod_words + 1] = 1; 121| 48| 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| 48| 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| 48| const size_t bound = 2; 130| | 131| 48| BOTAN_ASSERT_NOMSG(r.size() >= mod_words + 1); ------------------ | | 84| 48| do { \ | | 85| 48| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 48| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 48] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 48| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 48] | | ------------------ ------------------ 132| 144| for(size_t i = 0; i != bound; ++i) { ------------------ | Branch (132:22): [True: 96, False: 48] ------------------ 133| 96| const word borrow = bigint_sub3(ws.data(), r.data(), mod_words + 1, modulus._data(), mod_words); 134| 96| CT::Mask::is_zero(borrow).select_n(r.data(), ws.data(), r.data(), mod_words + 1); 135| 96| } 136| | 137| 48| CT::unpoison(q2); 138| 48| CT::unpoison(r); 139| 48| CT::unpoison(ws); 140| 48| CT::unpoison(x_words); 141| | 142| 48| return BigInt::_from_words(r); 143| 48|} _ZN5Botan17Montgomery_Params4DataC2ERKNS_6BigIntERKNS_17Barrett_ReductionE: 40| 6|Montgomery_Params::Data::Data(const BigInt& p, const Barrett_Reduction& mod_p) { 41| 6| if(p.is_even() || p < 3) { ------------------ | Branch (41:7): [True: 0, False: 6] | Branch (41:22): [True: 0, False: 6] ------------------ 42| 0| throw Invalid_Argument("Montgomery_Params invalid modulus"); 43| 0| } 44| | 45| 6| m_p = p; 46| 6| m_p_words = m_p.sig_words(); 47| 6| m_p_dash = monty_inverse(m_p.word_at(0)); 48| | 49| 6| const BigInt r = BigInt::power_of_2(m_p_words * WordInfo::bits); 50| | 51| 6| m_r1 = mod_p.reduce(r); 52| 6| m_r2 = mod_p.square(m_r1); 53| 6| m_r3 = mod_p.multiply(m_r1, m_r2); 54| | 55| | // Barrett should be at least zero prefixing up to modulus size 56| 6| BOTAN_ASSERT_NOMSG(m_r1.size() >= m_p_words); ------------------ | | 84| 6| do { \ | | 85| 6| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 6| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 6] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 6| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 6] | | ------------------ ------------------ 57| 6| BOTAN_ASSERT_NOMSG(m_r2.size() >= m_p_words); ------------------ | | 84| 6| do { \ | | 85| 6| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 6| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 6] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 6| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 6] | | ------------------ ------------------ 58| 6| BOTAN_ASSERT_NOMSG(m_r3.size() >= m_p_words); ------------------ | | 84| 6| do { \ | | 85| 6| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 6| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 6] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 6| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 6] | | ------------------ ------------------ 59| 6|} _ZN5Botan17Montgomery_ParamsC2ERKNS_6BigIntERKNS_17Barrett_ReductionE: 62| 6| m_data(std::make_shared(p, mod_p)) {} _ZNK5Botan17Montgomery_Params3mulERKNS_6BigIntES3_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 90| 12|BigInt Montgomery_Params::mul(const BigInt& x, const BigInt& y, secure_vector& ws) const { 91| 12| const size_t p_size = this->p_words(); 92| 12| BigInt z = BigInt::with_capacity(2 * p_size); 93| 12| this->mul(z, x, y, ws); 94| 12| return z; 95| 12|} _ZNK5Botan17Montgomery_Params3mulERNS_6BigIntERKS1_S4_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 97| 12|void Montgomery_Params::mul(BigInt& z, const BigInt& x, const BigInt& y, secure_vector& ws) const { 98| 12| BOTAN_ARG_CHECK(&z != &x && &z != &y, "Montgomery_Params::mul output must not alias inputs"); ------------------ | | 35| 12| do { \ | | 36| 12| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 24| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 12, False: 0] | | | Branch (37:12): [True: 12, 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] | | ------------------ ------------------ 99| | 100| 12| const size_t p_size = this->p_words(); 101| | 102| 12| if(ws.size() < 2 * p_size) { ------------------ | Branch (102:7): [True: 6, False: 6] ------------------ 103| 6| ws.resize(2 * p_size); 104| 6| } 105| | 106| 12| BOTAN_DEBUG_ASSERT(x.sig_words() <= p_size); ------------------ | | 137| 12| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 12| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 12] | | ------------------ ------------------ 107| 12| BOTAN_DEBUG_ASSERT(y.sig_words() <= p_size); ------------------ | | 137| 12| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 12| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 12] | | ------------------ ------------------ 108| | 109| 12| if(z.size() < 2 * p_size) { ------------------ | Branch (109:7): [True: 0, False: 12] ------------------ 110| 0| z.grow_to(2 * p_size); 111| 0| } 112| | 113| 12| bigint_mul(z.mutable_data(), 114| 12| z.size(), 115| 12| x._data(), 116| 12| x.size(), 117| 12| std::min(p_size, x.size()), 118| 12| y._data(), 119| 12| y.size(), 120| 12| std::min(p_size, y.size()), 121| 12| ws.data(), 122| 12| ws.size()); 123| | 124| 12| bigint_monty_redc_inplace(z.mutable_data(), this->p()._data(), p_size, this->p_dash(), ws.data(), ws.size()); 125| 12|} _ZNK5Botan17Montgomery_Params6mul_byERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 157| 32.7k|void Montgomery_Params::mul_by(BigInt& x, const BigInt& y, secure_vector& ws) const { 158| 32.7k| const size_t p_size = this->p_words(); 159| | 160| 32.7k| if(ws.size() < 4 * p_size) { ------------------ | Branch (160:7): [True: 16.3k, False: 16.3k] ------------------ 161| 16.3k| ws.resize(4 * p_size); 162| 16.3k| } 163| | 164| 32.7k| word* z_data = ws.data(); 165| 32.7k| word* ws_data = &ws[2 * p_size]; 166| | 167| 32.7k| BOTAN_DEBUG_ASSERT(x.sig_words() <= p_size); ------------------ | | 137| 32.7k| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 32.7k| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 32.7k] | | ------------------ ------------------ 168| | 169| 32.7k| bigint_mul(z_data, 170| 32.7k| 2 * p_size, 171| 32.7k| x._data(), 172| 32.7k| x.size(), 173| 32.7k| std::min(p_size, x.size()), 174| 32.7k| y._data(), 175| 32.7k| y.size(), 176| 32.7k| std::min(p_size, y.size()), 177| 32.7k| ws_data, 178| 32.7k| 2 * p_size); 179| | 180| 32.7k| bigint_monty_redc_inplace(z_data, this->p()._data(), p_size, this->p_dash(), ws_data, 2 * p_size); 181| | 182| 32.7k| if(x.size() < 2 * p_size) { ------------------ | Branch (182:7): [True: 4.37k, False: 28.3k] ------------------ 183| 4.37k| x.grow_to(2 * p_size); 184| 4.37k| } 185| 32.7k| copy_mem(x.mutable_data(), z_data, 2 * p_size); 186| 32.7k|} _ZN5Botan6PCurve15PrimeOrderCurve6Scalar8_zeroizeEv: 16| 56.3k|void PrimeOrderCurve::Scalar::_zeroize() { 17| 56.3k| secure_zeroize_buffer(m_value.data(), m_value.size() * sizeof(word)); 18| 56.3k|} _ZN5Botan6PCurve15PrimeOrderCurve15for_named_curveENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 32| 6|std::shared_ptr PrimeOrderCurve::for_named_curve(std::string_view name) { 33| 6|#if defined(BOTAN_HAS_PCURVES_SECP256R1) 34| 6| if(name == "secp256r1") { ------------------ | Branch (34:7): [True: 1, False: 5] ------------------ 35| 1| return PCurveInstance::secp256r1(); 36| 1| } 37| 5|#endif 38| | 39| 5|#if defined(BOTAN_HAS_PCURVES_SECP384R1) 40| 5| if(name == "secp384r1") { ------------------ | Branch (40:7): [True: 1, False: 4] ------------------ 41| 1| return PCurveInstance::secp384r1(); 42| 1| } 43| 4|#endif 44| | 45| 4|#if defined(BOTAN_HAS_PCURVES_SECP521R1) 46| 4| if(name == "secp521r1") { ------------------ | Branch (46:7): [True: 1, False: 3] ------------------ 47| 1| return PCurveInstance::secp521r1(); 48| 1| } 49| 3|#endif 50| | 51| 3|#if defined(BOTAN_HAS_PCURVES_BRAINPOOL256R1) 52| 3| if(name == "brainpool256r1") { ------------------ | Branch (52:7): [True: 1, False: 2] ------------------ 53| 1| return PCurveInstance::brainpool256r1(); 54| 1| } 55| 2|#endif 56| | 57| 2|#if defined(BOTAN_HAS_PCURVES_BRAINPOOL384R1) 58| 2| if(name == "brainpool384r1") { ------------------ | Branch (58:7): [True: 1, False: 1] ------------------ 59| 1| return PCurveInstance::brainpool384r1(); 60| 1| } 61| 1|#endif 62| | 63| 1|#if defined(BOTAN_HAS_PCURVES_BRAINPOOL512R1) 64| 1| if(name == "brainpool512r1") { ------------------ | Branch (64:7): [True: 1, False: 0] ------------------ 65| 1| return PCurveInstance::brainpool512r1(); 66| 1| } 67| 0|#endif 68| | 69| 0|#if defined(BOTAN_HAS_PCURVES_FRP256V1) 70| 0| if(name == "frp256v1") { ------------------ | Branch (70:7): [True: 0, False: 0] ------------------ 71| 0| return PCurveInstance::frp256v1(); 72| 0| } 73| 0|#endif 74| | 75| 0|#if defined(BOTAN_HAS_PCURVES_SECP192R1) 76| 0| if(name == "secp192r1") { ------------------ | Branch (76:7): [True: 0, False: 0] ------------------ 77| 0| return PCurveInstance::secp192r1(); 78| 0| } 79| 0|#endif 80| | 81| 0|#if defined(BOTAN_HAS_PCURVES_SECP224R1) 82| 0| if(name == "secp224r1") { ------------------ | Branch (82:7): [True: 0, False: 0] ------------------ 83| 0| return PCurveInstance::secp224r1(); 84| 0| } 85| 0|#endif 86| | 87| 0|#if defined(BOTAN_HAS_PCURVES_SECP256K1) 88| 0| if(name == "secp256k1") { ------------------ | Branch (88:7): [True: 0, False: 0] ------------------ 89| 0| return PCurveInstance::secp256k1(); 90| 0| } 91| 0|#endif 92| | 93| 0|#if defined(BOTAN_HAS_PCURVES_SM2P256V1) 94| 0| if(name == "sm2p256v1") { ------------------ | Branch (94:7): [True: 0, False: 0] ------------------ 95| 0| return PCurveInstance::sm2p256v1(); 96| 0| } 97| 0|#endif 98| | 99| 0|#if defined(BOTAN_HAS_PCURVES_NUMSP512D1) 100| 0| if(name == "numsp512d1") { ------------------ | Branch (100:7): [True: 0, False: 0] ------------------ 101| 0| return PCurveInstance::numsp512d1(); 102| 0| } 103| 0|#endif 104| | 105| 0| BOTAN_UNUSED(name); ------------------ | | 151| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 106| 0| return {}; 107| 0|} _ZN5Botan6PCurve14PCurveInstance14brainpool256r1Ev: 37| 1|std::shared_ptr PCurveInstance::brainpool256r1() { 38| 1| return PrimeOrderCurveImpl::instance(); 39| 1|} _ZN5Botan6PCurve14PCurveInstance14brainpool384r1Ev: 37| 1|std::shared_ptr PCurveInstance::brainpool384r1() { 38| 1| return PrimeOrderCurveImpl::instance(); 39| 1|} _ZN5Botan6PCurve14PCurveInstance14brainpool512r1Ev: 37| 1|std::shared_ptr PCurveInstance::brainpool512r1() { 38| 1| return PrimeOrderCurveImpl::instance(); 39| 1|} _ZN5Botan6PCurve14PCurveInstance9secp256r1Ev: 407| 1|std::shared_ptr PCurveInstance::secp256r1() { 408| 1| return PrimeOrderCurveImpl::instance(); 409| 1|} pcurves_secp256r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS1_9secp256r16ParamsES2_E11FieldParamsEE3oneEv: 138| 325k| constexpr static std::array one() { return R1; } pcurves_secp256r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS1_9secp256r16ParamsES2_E11FieldParamsEE4redcERKNSt3__15arrayImLm8EEE: 140| 6.35M| constexpr static BOTAN_FORCE_INLINE std::array redc(const std::array& z) { 141| | // Scalar locals rather than a copy of z: GCC copies arrays using 16 byte 142| | // loads, which stall on the 8 byte stores that just produced z 143| 6.35M| W t1 = z[1]; 144| 6.35M| W t2 = z[2]; 145| 6.35M| W t3 = z[3]; 146| 6.35M| W t4 = z[4]; 147| 6.35M| W t5 = z[5]; 148| 6.35M| W t6 = z[6]; 149| 6.35M| W t7 = z[7]; 150| | 151| | // The carry out from the previous step 152| 6.35M| W pending = 0; 153| | 154| 6.35M| redc_step(z[0], t1, t2, t3, t4, pending); 155| 6.35M| redc_step(t1, t2, t3, t4, t5, pending); 156| 6.35M| redc_step(t2, t3, t4, t5, t6, pending); 157| 6.35M| redc_step(t3, t4, t5, t6, t7, pending); 158| | 159| 6.35M| return final_sub(pending, {t4, t5, t6, t7}); 160| 6.35M| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS1_9secp256r16ParamsES2_E11FieldParamsEE9redc_stepEmRmS9_S9_S9_S9_: 185| 25.4M| constexpr static BOTAN_FORCE_INLINE void redc_step(W m, W& t0, W& t1, W& t2, W& t3, W& pending) { 186| 25.4M| auto [q0, q1, q2, q3] = p256_m_p1_64(m); 187| | 188| | // q3 is at most 2^64 - 2^32, leaving room to add the carry from the 189| | // previous step without worrying about creating a new carry 190| 25.4M| q3 += pending; 191| | 192| 25.4M| W carry = 0; 193| 25.4M| t0 = word_add(t0, q0, &carry); 194| 25.4M| t1 = word_add(t1, q1, &carry); 195| 25.4M| t2 = word_add(t2, q2, &carry); 196| 25.4M| t3 = word_add(t3, q3, &carry); 197| 25.4M| pending = carry; 198| 25.4M| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS1_9secp256r16ParamsES2_E11FieldParamsEE12p256_m_p1_64Em: 204| 25.4M| constexpr static BOTAN_FORCE_INLINE std::array p256_m_p1_64(W m) { 205| 25.4M| const W m_lo = m << 32; 206| 25.4M| const W m_hi = m >> 32; 207| | 208| | /* 209| | * m*(p+1)/2^64 = m*2^32 + m*2^128 + m*2^192 - m*2^160, laid out as 210| | * 211| | * m*2^32 -> word 0 gets m << 32, word 1 gets m >> 32 212| | * m*2^128 -> word 2 gets m 213| | * m*2^192 -> word 3 gets m 214| | * -m*2^160 -> word 2 loses m << 32, word 3 loses m >> 32 plus the borrow 215| | * 216| | * The total is non-negative and below 2^256, so the final borrow is zero 217| | */ 218| 25.4M| W borrow = 0; 219| 25.4M| const W q2 = word_sub(m, m_lo, &borrow); 220| 25.4M| const W q3 = word_sub(m, m_hi, &borrow); 221| | 222| 25.4M| return {m_lo, m_hi, q2, q3}; 223| 25.4M| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS1_9secp256r16ParamsES2_E11FieldParamsEE9final_subEmRKNSt3__15arrayImLm4EEE: 228| 6.35M| constexpr static BOTAN_FORCE_INLINE std::array final_sub(W top, const std::array& t) { 229| 6.35M| W borrow = 0; 230| 6.35M| const W r0 = word_sub(t[0], P[0], &borrow); 231| 6.35M| const W r1 = word_sub(t[1], P[1], &borrow); 232| 6.35M| const W r2 = word_sub(t[2], P[2], &borrow); 233| 6.35M| const W r3 = word_sub(t[3], P[3], &borrow); 234| | 235| | // t is only < p if the subtraction underflowed and top (the 257th bit) is zero 236| 6.35M| const W t_lt_p = CT::value_barrier(static_cast(0) - (borrow & (top ^ 1))); 237| | 238| 6.35M| return { 239| 6.35M| choose(t_lt_p, t[0], r0), 240| 6.35M| choose(t_lt_p, t[1], r1), 241| 6.35M| choose(t_lt_p, t[2], r2), 242| 6.35M| choose(t_lt_p, t[3], r3), 243| 6.35M| }; 244| 6.35M| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp256r15Curve10fe_invert2ERKNS_6IntModINS1_22Secp256r1MontgomeryRepINS_13EllipticCurveINS2_6ParamsES5_E11FieldParamsEEEEE: 270| 7.08k| static constexpr FieldElement fe_invert2(const FieldElement& x) { 271| | // Generated using https://github.com/mmcloughlin/addchain 272| | 273| 7.08k| auto z = x.square(); 274| 7.08k| z *= x; 275| 7.08k| z = z.square(); 276| 7.08k| z *= x; 277| 7.08k| auto t0 = z; 278| 7.08k| t0.square_n(3); 279| 7.08k| t0 *= z; 280| 7.08k| auto t1 = t0; 281| 7.08k| t1.square_n(6); 282| 7.08k| t0 *= t1; 283| 7.08k| t0.square_n(3); 284| 7.08k| z *= t0; 285| 7.08k| t0 = z.square(); 286| 7.08k| t0 *= x; 287| 7.08k| t1 = t0; 288| 7.08k| t1.square_n(16); 289| 7.08k| t0 *= t1; 290| 7.08k| t0.square_n(15); 291| 7.08k| z *= t0; 292| 7.08k| t0.square_n(17); 293| 7.08k| t0 *= x; 294| 7.08k| t0.square_n(143); 295| 7.08k| t0 *= z; 296| 7.08k| t0.square_n(47); 297| 7.08k| z *= t0; 298| 7.08k| z.square_n(2); 299| | 300| 7.08k| return z; 301| 7.08k| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS1_9secp256r16ParamsES2_E11FieldParamsEE8from_repERKNSt3__15arrayImLm4EEE: 175| 29.3k| constexpr static std::array from_rep(const std::array& z) { 176| 29.3k| std::array ze = {}; 177| 29.3k| copy_mem(std::span{ze}.template first(), z); 178| 29.3k| return redc(ze); 179| 29.3k| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS1_9secp256r16ParamsES2_E11FieldParamsEE6to_repERKNSt3__15arrayImLm4EEE: 162| 13.6k| constexpr static std::array to_rep(const std::array& x) { 163| 13.6k| std::array z; // NOLINT(*-member-init) 164| 13.6k| comba_mul(z.data(), x.data(), R2.data()); 165| 13.6k| return redc(z); 166| 13.6k| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_122Secp256r1MontgomeryRepINS_13EllipticCurveINS1_9secp256r16ParamsES2_E11FieldParamsEE11wide_to_repERKNSt3__15arrayImLm8EEE: 168| 4.07k| constexpr static std::array wide_to_rep(const std::array& x) { 169| 4.07k| auto redc_x = redc(x); 170| 4.07k| std::array z; // NOLINT(*-member-init) 171| 4.07k| comba_mul(z.data(), redc_x.data(), R3.data()); 172| 4.07k| return redc(z); 173| 4.07k| } pcurves_secp256r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp256r15Curve7fe_sqrtERKNS_6IntModINS1_22Secp256r1MontgomeryRepINS_13EllipticCurveINS2_6ParamsES5_E11FieldParamsEEEEE: 304| 329| static constexpr FieldElement fe_sqrt(const FieldElement& x) { 305| | // Generated using addchain 306| 329| auto z = x.square(); 307| 329| z *= x; 308| 329| auto t0 = z; 309| 329| t0.square_n(2); 310| 329| z *= t0; 311| 329| t0 = z; 312| 329| t0.square_n(4); 313| 329| z *= t0; 314| 329| t0 = z; 315| 329| t0.square_n(8); 316| 329| z *= t0; 317| 329| t0 = z; 318| 329| t0.square_n(16); 319| 329| z *= t0; 320| 329| z.square_n(32); 321| 329| z *= x; 322| 329| z.square_n(96); 323| 329| z *= x; 324| 329| z.square_n(94); 325| 329| return z; 326| 329| } _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| 50.1k| constexpr static std::array one() { return std::array{1}; } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE4redcERKNSt3__15arrayImLm12EEE: 23| 1.68M| constexpr static std::array redc(const std::array& z) { 24| 1.68M| const int64_t X00 = get_uint32(z.data(), 0); 25| 1.68M| const int64_t X01 = get_uint32(z.data(), 1); 26| 1.68M| const int64_t X02 = get_uint32(z.data(), 2); 27| 1.68M| const int64_t X03 = get_uint32(z.data(), 3); 28| 1.68M| const int64_t X04 = get_uint32(z.data(), 4); 29| 1.68M| const int64_t X05 = get_uint32(z.data(), 5); 30| 1.68M| const int64_t X06 = get_uint32(z.data(), 6); 31| 1.68M| const int64_t X07 = get_uint32(z.data(), 7); 32| 1.68M| const int64_t X08 = get_uint32(z.data(), 8); 33| 1.68M| const int64_t X09 = get_uint32(z.data(), 9); 34| 1.68M| const int64_t X10 = get_uint32(z.data(), 10); 35| 1.68M| const int64_t X11 = get_uint32(z.data(), 11); 36| 1.68M| const int64_t X12 = get_uint32(z.data(), 12); 37| 1.68M| const int64_t X13 = get_uint32(z.data(), 13); 38| 1.68M| const int64_t X14 = get_uint32(z.data(), 14); 39| 1.68M| const int64_t X15 = get_uint32(z.data(), 15); 40| 1.68M| const int64_t X16 = get_uint32(z.data(), 16); 41| 1.68M| const int64_t X17 = get_uint32(z.data(), 17); 42| 1.68M| const int64_t X18 = get_uint32(z.data(), 18); 43| 1.68M| const int64_t X19 = get_uint32(z.data(), 19); 44| 1.68M| const int64_t X20 = get_uint32(z.data(), 20); 45| 1.68M| const int64_t X21 = get_uint32(z.data(), 21); 46| 1.68M| const int64_t X22 = get_uint32(z.data(), 22); 47| 1.68M| const int64_t X23 = get_uint32(z.data(), 23); 48| | 49| | // One copy of P-384 is added to prevent underflow 50| 1.68M| const int64_t S0 = 0xFFFFFFFF + X00 + X12 + X20 + X21 - X23; 51| 1.68M| const int64_t S1 = 0x00000000 + X01 + X13 + X22 + X23 - X12 - X20; 52| 1.68M| const int64_t S2 = 0x00000000 + X02 + X14 + X23 - X13 - X21; 53| 1.68M| const int64_t S3 = 0xFFFFFFFF + X03 + X12 + X15 + X20 + X21 - X14 - X22 - X23; 54| 1.68M| const int64_t S4 = 0xFFFFFFFE + X04 + X12 + X13 + X16 + X20 + X21 * 2 + X22 - X15 - X23 * 2; 55| 1.68M| const int64_t S5 = 0xFFFFFFFF + X05 + X13 + X14 + X17 + X21 + X22 * 2 + X23 - X16; 56| 1.68M| const int64_t S6 = 0xFFFFFFFF + X06 + X14 + X15 + X18 + X22 + X23 * 2 - X17; 57| 1.68M| const int64_t S7 = 0xFFFFFFFF + X07 + X15 + X16 + X19 + X23 - X18; 58| 1.68M| const int64_t S8 = 0xFFFFFFFF + X08 + X16 + X17 + X20 - X19; 59| 1.68M| const int64_t S9 = 0xFFFFFFFF + X09 + X17 + X18 + X21 - X20; 60| 1.68M| const int64_t SA = 0xFFFFFFFF + X10 + X18 + X19 + X22 - X21; 61| 1.68M| const int64_t SB = 0xFFFFFFFF + X11 + X19 + X20 + X23 - X22; 62| | 63| 1.68M| std::array r = {}; 64| | 65| 1.68M| SolinasAccum sum(r); 66| | 67| 1.68M| sum.accum(S0); 68| 1.68M| sum.accum(S1); 69| 1.68M| sum.accum(S2); 70| 1.68M| sum.accum(S3); 71| 1.68M| sum.accum(S4); 72| 1.68M| sum.accum(S5); 73| 1.68M| sum.accum(S6); 74| 1.68M| sum.accum(S7); 75| 1.68M| sum.accum(S8); 76| 1.68M| sum.accum(S9); 77| 1.68M| sum.accum(SA); 78| 1.68M| sum.accum(SB); 79| 1.68M| const auto S = sum.final_carry(0); 80| | 81| 1.68M| BOTAN_DEBUG_ASSERT(S <= 4); ------------------ | | 137| 1.68M| do { /* NOLINT(*-avoid-do-while) */ \ | | 138| 1.68M| } while(0) | | ------------------ | | | Branch (138:15): [Folded, False: 1.68M] | | ------------------ ------------------ 82| | 83| 1.68M| solinas_correct_redc(r, P, p384_mul_mod_384(S)); 84| | 85| 1.68M| return r; 86| 1.68M| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE16p384_mul_mod_384Em: 100| 1.68M| constexpr static std::array p384_mul_mod_384(W i) { 101| 1.68M| 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.68M| 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.68M| } else { 113| 1.68M| const uint64_t i32 = static_cast(i) << 32; 114| 1.68M| r[2] -= i; 115| 1.68M| r[1] -= i32; 116| 1.68M| r[0] += i32; 117| 1.68M| r[0] -= i; 118| 1.68M| } 119| 1.68M| return r; 120| 1.68M| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp384r15Curve10fe_invert2ERKNS_6IntModINS1_12Secp384r1RepINS_13EllipticCurveINS2_6ParamsES5_E11FieldParamsEEEEE: 142| 584| static constexpr FieldElement fe_invert2(const FieldElement& x) { 143| | // From https://briansmith.org/ecc-inversion-addition-chains-01 144| | 145| 584| FieldElement r = x.square(); 146| 584| r *= x; 147| 584| const auto x2 = r; 148| 584| r = r.square(); 149| 584| r *= x; 150| 584| const auto x3 = r; 151| 584| r.square_n(3); 152| 584| r *= x3; 153| 584| auto rl = r; 154| 584| r.square_n(6); 155| 584| r *= rl; 156| 584| r.square_n(3); 157| 584| r *= x3; 158| 584| const auto x15 = r; 159| 584| r.square_n(15); 160| 584| r *= x15; 161| 584| const auto x30 = r; 162| 584| r.square_n(30); 163| 584| r *= x30; 164| 584| rl = r; 165| 584| r.square_n(60); 166| 584| r *= rl; 167| 584| rl = r; 168| 584| r.square_n(120); 169| 584| r *= rl; 170| 584| r.square_n(15); 171| 584| r *= x15; 172| 584| r.square_n(31); 173| 584| r *= x30; 174| 584| r.square_n(2); 175| 584| r *= x2; 176| 584| r.square_n(94); 177| 584| r *= x30; 178| 584| r.square_n(2); 179| | 180| 584| return r; 181| 584| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE8from_repERKNSt3__15arrayImLm6EEE: 94| 2.84k| 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| 753| constexpr static std::array to_rep(const std::array& x) { return x; } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE11wide_to_repERKNSt3__15arrayImLm12EEE: 92| 2.92k| constexpr static std::array wide_to_rep(const std::array& x) { return redc(x); } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp384r15Curve7fe_sqrtERKNS_6IntModINS1_12Secp384r1RepINS_13EllipticCurveINS2_6ParamsES5_E11FieldParamsEEEEE: 183| 213| static constexpr FieldElement fe_sqrt(const FieldElement& x) { 184| | // Generated using https://github.com/mmcloughlin/addchain 185| | 186| 213| auto z = x.square(); 187| 213| z *= x; 188| 213| z = z.square(); 189| 213| auto t0 = x * z; 190| 213| z = t0; 191| 213| z.square_n(3); 192| 213| auto t1 = t0 * z; 193| 213| auto t2 = t1.square(); 194| 213| z = t2 * x; 195| 213| t2.square_n(5); 196| 213| t1 *= t2; 197| 213| t2 = t1; 198| 213| t2.square_n(12); 199| 213| t1 *= t2; 200| 213| t1.square_n(7); 201| 213| t1 *= z; 202| 213| z = t1.square(); 203| 213| z *= x; 204| 213| t2 = z; 205| 213| t2.square_n(31); 206| 213| t1 *= t2; 207| 213| t2 = t1; 208| 213| t2.square_n(63); 209| 213| t1 *= t2; 210| 213| t2 = t1; 211| 213| t2.square_n(126); 212| 213| t1 *= t2; 213| 213| t1.square_n(3); 214| 213| t0 *= t1; 215| 213| t0.square_n(33); 216| 213| z *= t0; 217| 213| z.square_n(64); 218| 213| z *= x; 219| 213| z.square_n(30); 220| 213| return z; 221| 213| } _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| 58.3k| constexpr static std::array one() { return std::array{1}; } pcurves_secp521r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE4redcERKNSt3__15arrayImLm18EEE: 26| 2.04M| 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| 2.04M| constexpr W TOP_BITS = static_cast(0x1FF); 29| | // The 23 or 55 bits that should be cleared in the top word 30| 2.04M| constexpr W CLEARED_TOP_BITS = WordInfo::max ^ TOP_BITS; 31| | 32| | /* 33| | * Extract the high part of z (z >> 521) 34| | */ 35| 2.04M| std::array t; // NOLINT(*-member-init) 36| | 37| 20.4M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (37:28): [True: 18.4M, False: 2.04M] ------------------ 38| 18.4M| t[i] = z[(N - 1) + i] >> 9; 39| 18.4M| } 40| | 41| 18.4M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (41:28): [True: 16.3M, False: 2.04M] ------------------ 42| 16.3M| t[i] |= z[(N - 1) + i + 1] << (WordInfo::bits - 9); 43| 16.3M| } 44| | 45| | // Now t += z & (2**521-1) 46| 2.04M| W carry = 0; 47| 18.4M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (47:28): [True: 16.3M, False: 2.04M] ------------------ 48| 16.3M| t[i] = word_add(t[i], z[i], &carry); 49| 16.3M| } 50| | 51| | // Now add the (partial) top words; this can't carry out 52| | // since both inputs are at most 2**9-1 53| 2.04M| 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| 2.04M| 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| 2.04M| const W is_eq_p521 = [&]() { 71| 2.04M| W sum = WordInfo::max; 72| 2.04M| for(size_t i = 0; i != N - 1; ++i) { 73| 2.04M| sum &= t[i]; 74| 2.04M| } 75| 2.04M| sum &= (CLEARED_TOP_BITS | t[N - 1]); 76| | 77| 2.04M| return CT::Mask::is_zero(sum ^ WordInfo::max).value(); 78| 2.04M| }(); 79| | 80| 2.04M| const W need_sub = is_over_p521 | is_eq_p521; 81| | 82| 2.04M| W borrow = 0; 83| 18.4M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (83:28): [True: 16.3M, False: 2.04M] ------------------ 84| 16.3M| t[i] = word_sub(t[i], need_sub & WordInfo::max, &borrow); 85| 16.3M| } 86| 2.04M| t[N - 1] = word_sub(t[N - 1], need_sub & TOP_BITS, &borrow); 87| | 88| 2.04M| return t; 89| 2.04M| } pcurves_secp521r1.cpp:_ZZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE4redcERKNSt3__15arrayImLm18EEEENKUlvE_clEv: 70| 2.04M| const W is_eq_p521 = [&]() { 71| 2.04M| W sum = WordInfo::max; 72| 18.4M| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (72:31): [True: 16.3M, False: 2.04M] ------------------ 73| 16.3M| sum &= t[i]; 74| 16.3M| } 75| 2.04M| sum &= (CLEARED_TOP_BITS | t[N - 1]); 76| | 77| 2.04M| return CT::Mask::is_zero(sum ^ WordInfo::max).value(); 78| 2.04M| }(); pcurves_secp521r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp521r15Curve10fe_invert2ERKNS_6IntModINS2_7P521RepINS_13EllipticCurveINS2_6ParamsES5_E11FieldParamsEEEEE: 115| 520| static constexpr FieldElement fe_invert2(const FieldElement& x) { 116| | // Addition chain from https://eprint.iacr.org/2014/852.pdf page 6 117| | 118| 520| FieldElement r = x.square(); 119| 520| r *= x; 120| 520| r = r.square(); 121| 520| r *= x; 122| 520| FieldElement rl = r; 123| 520| r.square_n(3); 124| 520| r *= rl; 125| 520| r.square_n(1); 126| 520| r *= x; 127| 520| const auto a7 = r; 128| 520| r.square_n(1); 129| 520| r *= x; 130| 520| rl = r; 131| 520| r.square_n(8); 132| 520| r *= rl; 133| 520| rl = r; 134| 520| r.square_n(16); 135| 520| r *= rl; 136| 520| rl = r; 137| 520| r.square_n(32); 138| 520| r *= rl; 139| 520| rl = r; 140| 520| r.square_n(64); 141| 520| r *= rl; 142| 520| rl = r; 143| 520| r.square_n(128); 144| 520| r *= rl; 145| 520| rl = r; 146| 520| r.square_n(256); 147| 520| r *= rl; 148| 520| r.square_n(7); 149| 520| r *= a7; 150| 520| r.square_n(2); 151| | 152| 520| return r; 153| 520| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE8from_repERKNSt3__15arrayImLm9EEE: 95| 2.61k| 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| 721| constexpr static std::array to_rep(const std::array& x) { return x; } pcurves_secp521r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE11wide_to_repERKNSt3__15arrayImLm18EEE: 93| 2.60k| constexpr static std::array wide_to_rep(const std::array& x) { return redc(x); } pcurves_secp521r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp521r15Curve7fe_sqrtERKNS_6IntModINS2_7P521RepINS_13EllipticCurveINS2_6ParamsES5_E11FieldParamsEEEEE: 155| 203| static constexpr FieldElement fe_sqrt(const FieldElement& x) { 156| 203| auto z = x; 157| 203| z.square_n(519); 158| 203| return z; 159| 203| } _ZN5Botan9AEAD_Mode15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_10Cipher_DirES5_: 53| 213| std::string_view provider) { 54| 213| if(auto aead = AEAD_Mode::create(algo, dir, provider)) { ------------------ | Branch (54:12): [True: 213, False: 0] ------------------ 55| 213| return aead; 56| 213| } 57| | 58| 0| throw Lookup_Error("AEAD", algo, provider); 59| 213|} _ZN5Botan9AEAD_Mode6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_10Cipher_DirES5_: 61| 213|std::unique_ptr AEAD_Mode::create(std::string_view algo, Cipher_Dir dir, std::string_view provider) { 62| 213| BOTAN_UNUSED(provider); ------------------ | | 151| 213|#define BOTAN_UNUSED Botan::ignore_params ------------------ 63| 213|#if defined(BOTAN_HAS_AEAD_CHACHA20_POLY1305) 64| 213| if(algo == "ChaCha20Poly1305") { ------------------ | Branch (64:7): [True: 33, False: 180] ------------------ 65| 33| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (65:10): [True: 13, False: 20] ------------------ 66| 13| return std::make_unique(); 67| 20| } else { 68| 20| return std::make_unique(); 69| 20| } 70| 33| } 71| 180|#endif 72| | 73| 180|#if defined(BOTAN_HAS_ASCON_AEAD128) 74| 180| if(algo == "Ascon-AEAD128") { ------------------ | Branch (74:7): [True: 0, False: 180] ------------------ 75| 0| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (75:10): [True: 0, False: 0] ------------------ 76| 0| return std::make_unique(); 77| 0| } else { 78| 0| return std::make_unique(); 79| 0| } 80| 0| } 81| 180|#endif 82| | 83| 180|#if defined(BOTAN_HAS_BLOCK_CIPHER) 84| 180| const AlgorithmSpec req(algo, AlgorithmSpec::Syntax::CipherMode); 85| | 86| 180| #if defined(BOTAN_HAS_AEAD_CCM) 87| 180| if(auto m = req.match("CCM({cipher},{tag_len:int=16},{L:int=3})")) { ------------------ | Branch (87:12): [True: 46, False: 134] ------------------ 88| 46| if(auto bc = BlockCipher::create(m->str("cipher"), provider)) { ------------------ | Branch (88:15): [True: 46, False: 0] ------------------ 89| 46| const size_t tag_len = m->integer("tag_len"); 90| 46| const size_t L_len = m->integer("L"); 91| 46| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (91:13): [True: 9, False: 37] ------------------ 92| 9| return std::make_unique(std::move(bc), tag_len, L_len); 93| 37| } else { 94| 37| return std::make_unique(std::move(bc), tag_len, L_len); 95| 37| } 96| 46| } 97| 46| } 98| 134| #endif 99| | 100| 134| #if defined(BOTAN_HAS_AEAD_GCM) 101| 134| if(auto m = req.match("GCM({cipher},{tag_len:int=16})")) { ------------------ | Branch (101:12): [True: 97, False: 37] ------------------ 102| 97| if(auto bc = BlockCipher::create(m->str("cipher"), provider)) { ------------------ | Branch (102:15): [True: 97, False: 0] ------------------ 103| 97| const size_t tag_len = m->integer("tag_len"); 104| 97| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (104:13): [True: 13, False: 84] ------------------ 105| 13| return std::make_unique(std::move(bc), tag_len); 106| 84| } else { 107| 84| return std::make_unique(std::move(bc), tag_len); 108| 84| } 109| 97| } 110| 97| } 111| 37| #endif 112| | 113| 37| #if defined(BOTAN_HAS_AEAD_GCM_SIV) 114| | // Unlike GCM the tag length is fixed, so reject eg "AES-128/GCM-SIV(12)" 115| 37| if(auto m = req.match("GCM-SIV({cipher})")) { ------------------ | Branch (115:12): [True: 0, False: 37] ------------------ 116| 0| if(auto bc = BlockCipher::create(m->str("cipher"), provider)) { ------------------ | Branch (116:15): [True: 0, False: 0] ------------------ 117| 0| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (117:13): [True: 0, False: 0] ------------------ 118| 0| return std::make_unique(std::move(bc)); 119| 0| } else { 120| 0| return std::make_unique(std::move(bc)); 121| 0| } 122| 0| } 123| 0| } 124| 37| #endif 125| | 126| 37| #if defined(BOTAN_HAS_AEAD_OCB) 127| 37| if(auto m = req.match("OCB({cipher},{tag_len:int=16})")) { ------------------ | Branch (127:12): [True: 37, False: 0] ------------------ 128| 37| if(auto bc = BlockCipher::create(m->str("cipher"), provider)) { ------------------ | Branch (128:15): [True: 37, False: 0] ------------------ 129| 37| const size_t tag_len = m->integer("tag_len"); 130| 37| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (130:13): [True: 5, False: 32] ------------------ 131| 5| return std::make_unique(std::move(bc), tag_len); 132| 32| } else { 133| 32| return std::make_unique(std::move(bc), tag_len); 134| 32| } 135| 37| } 136| 37| } 137| 0| #endif 138| | 139| 0| #if defined(BOTAN_HAS_AEAD_EAX) 140| 0| if(auto m = req.match("EAX({cipher},{tag_len:int?})")) { ------------------ | Branch (140:12): [True: 0, False: 0] ------------------ 141| 0| if(auto bc = BlockCipher::create(m->str("cipher"), provider)) { ------------------ | Branch (141:15): [True: 0, False: 0] ------------------ 142| 0| const size_t tag_len = m->has("tag_len") ? m->integer("tag_len") : bc->block_size(); ------------------ | Branch (142:33): [True: 0, False: 0] ------------------ 143| 0| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (143:13): [True: 0, False: 0] ------------------ 144| 0| return std::make_unique(std::move(bc), tag_len); 145| 0| } else { 146| 0| return std::make_unique(std::move(bc), tag_len); 147| 0| } 148| 0| } 149| 0| } 150| 0| #endif 151| | 152| 0| #if defined(BOTAN_HAS_AEAD_SIV) 153| 0| if(auto m = req.match("SIV({cipher})")) { ------------------ | Branch (153:12): [True: 0, False: 0] ------------------ 154| 0| if(auto bc = BlockCipher::create(m->str("cipher"), provider)) { ------------------ | Branch (154:15): [True: 0, False: 0] ------------------ 155| 0| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (155:13): [True: 0, False: 0] ------------------ 156| 0| return std::make_unique(std::move(bc)); 157| 0| } else { 158| 0| return std::make_unique(std::move(bc)); 159| 0| } 160| 0| } 161| 0| } 162| 0| #endif 163| | 164| 0| BOTAN_UNUSED(req); ------------------ | | 151| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 165| 0|#endif 166| | 167| 0| return std::unique_ptr(); 168| 0|} _ZN5Botan8CCM_ModeC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEmm: 27| 46| m_tag_size(tag_size), m_L(L), m_cipher(std::move(cipher)) { 28| 46| if(m_cipher->block_size() != CCM_BS) { ------------------ | Branch (28:7): [True: 0, False: 46] ------------------ 29| 0| throw Invalid_Argument(m_cipher->name() + " cannot be used with CCM mode"); 30| 0| } 31| | 32| 46| if(L < 2 || L > 8) { ------------------ | Branch (32:7): [True: 0, False: 46] | Branch (32:16): [True: 0, False: 46] ------------------ 33| 0| throw Invalid_Argument(fmt("Invalid CCM L value {}", L)); 34| 0| } 35| | 36| 46| if(tag_size < 4 || tag_size > 16 || tag_size % 2 != 0) { ------------------ | Branch (36:7): [True: 0, False: 46] | Branch (36:23): [True: 0, False: 46] | Branch (36:40): [True: 0, False: 46] ------------------ 37| 0| throw Invalid_Argument(fmt("Invalid CCM tag length {}", tag_size)); 38| 0| } 39| 46|} _ZN5Botan8CCM_Mode5resetEv: 47| 88|void CCM_Mode::reset() { 48| 88| m_nonce.clear(); 49| 88| m_msg_buf.clear(); 50| 88|} _ZNK5Botan8CCM_Mode18valid_nonce_lengthEm: 56| 42|bool CCM_Mode::valid_nonce_length(size_t length) const { 57| 42| return (length == (15 - L())); 58| 42|} _ZNK5Botan8CCM_Mode8key_specEv: 77| 46|Key_Length_Specification CCM_Mode::key_spec() const { 78| 46| return m_cipher->key_spec(); 79| 46|} _ZN5Botan8CCM_Mode12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 85| 46|void CCM_Mode::key_schedule(std::span key) { 86| 46| m_cipher->set_key(key); 87| | // Clear any per-message state; AD is preserved per AEAD contract 88| | // (CCM advertises associated_data_requires_key() == false). 89| 46| reset(); 90| 46|} _ZN5Botan8CCM_Mode21set_associated_data_nEmNSt3__14spanIKhLm18446744073709551615EEE: 92| 42|void CCM_Mode::set_associated_data_n(size_t idx, std::span ad) { 93| 42| BOTAN_ARG_CHECK(idx == 0, "CCM: cannot handle non-zero index in set_associated_data_n"); ------------------ | | 35| 42| do { \ | | 36| 42| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 42| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 42] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 42| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 42] | | ------------------ ------------------ 94| 42| BOTAN_STATE_CHECK(m_nonce.empty()); ------------------ | | 51| 42| do { \ | | 52| 42| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 42| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 42] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 42| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 42] | | ------------------ ------------------ 95| | 96| 42| m_ad_buf.clear(); 97| | 98| 42| if(!ad.empty()) { ------------------ | Branch (98:7): [True: 42, False: 0] ------------------ 99| | // FIXME: support larger AD using length encoding rules 100| 42| BOTAN_ARG_CHECK(ad.size() < (0xFFFF - 0xFF), "Supported CCM AD length"); ------------------ | | 35| 42| do { \ | | 36| 42| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 42| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 42] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 42| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 42] | | ------------------ ------------------ 101| | 102| 42| m_ad_buf.push_back(get_byte<0>(static_cast(ad.size()))); 103| 42| m_ad_buf.push_back(get_byte<1>(static_cast(ad.size()))); 104| 42| m_ad_buf.insert(m_ad_buf.end(), ad.begin(), ad.end()); 105| 84| while(m_ad_buf.size() % CCM_BS != 0) { ------------------ | Branch (105:13): [True: 42, False: 42] ------------------ 106| 42| m_ad_buf.push_back(0); // pad with zeros to full block size 107| 42| } 108| 42| } 109| 42|} _ZN5Botan8CCM_Mode9start_msgEPKhm: 111| 42|void CCM_Mode::start_msg(const uint8_t nonce[], size_t nonce_len) { 112| 42| BOTAN_STATE_CHECK(m_nonce.empty()); ------------------ | | 51| 42| do { \ | | 52| 42| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 42| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 42] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 42| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 42] | | ------------------ ------------------ 113| | 114| 42| if(!valid_nonce_length(nonce_len)) { ------------------ | Branch (114:7): [True: 0, False: 42] ------------------ 115| 0| throw Invalid_IV_Length(name(), nonce_len); 116| 0| } 117| | 118| 42| m_nonce.assign(nonce, nonce + nonce_len); 119| 42| m_msg_buf.clear(); 120| 42|} _ZN5Botan8CCM_Mode13encode_lengthEmPh: 137| 42|void CCM_Mode::encode_length(uint64_t len, uint8_t out[]) { 138| 42| const size_t len_bytes = L(); 139| | 140| 42| BOTAN_ASSERT_NOMSG(len_bytes >= 2 && len_bytes <= 8); ------------------ | | 84| 42| do { \ | | 85| 42| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 84| if(!(expr)) { \ | | ------------------ | | | Branch (86:12): [True: 42, False: 0] | | | Branch (86:12): [True: 42, False: 0] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 42| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 42] | | ------------------ ------------------ 141| | 142| 168| for(size_t i = 0; i != len_bytes; ++i) { ------------------ | Branch (142:22): [True: 126, False: 42] ------------------ 143| 126| out[len_bytes - 1 - i] = get_byte_var(sizeof(uint64_t) - 1 - i, len); 144| 126| } 145| | 146| 42| if(len_bytes < 8 && (len >> (len_bytes * 8)) > 0) { ------------------ | Branch (146:7): [True: 42, False: 0] | Branch (146:24): [True: 0, False: 42] ------------------ 147| 0| throw Encoding_Error("CCM message length too long to encode in L field"); 148| 0| } 149| 42|} _ZN5Botan8CCM_Mode3incERNSt3__16vectorIhNS_16secure_allocatorIhEEEE: 151| 1.75k|void CCM_Mode::inc(secure_vector& C) { 152| 1.75k| for(size_t i = 0; i != C.size(); ++i) { ------------------ | Branch (152:22): [True: 1.75k, False: 0] ------------------ 153| 1.75k| uint8_t& b = C[C.size() - i - 1]; 154| 1.75k| b += 1; 155| 1.75k| if(b > 0) { ------------------ | Branch (155:10): [True: 1.75k, False: 3] ------------------ 156| 1.75k| break; 157| 1.75k| } 158| 1.75k| } 159| 1.75k|} _ZN5Botan8CCM_Mode9format_b0Em: 161| 42|secure_vector CCM_Mode::format_b0(size_t sz) { 162| 42| if(m_nonce.size() != 15 - L()) { ------------------ | Branch (162:7): [True: 0, False: 42] ------------------ 163| 0| throw Invalid_State("CCM mode must set nonce"); 164| 0| } 165| 42| secure_vector B0(CCM_BS); 166| | 167| 42| const uint8_t b_flags = 168| 42| static_cast((!m_ad_buf.empty() ? 64 : 0) + (((tag_size() / 2) - 1) << 3) + (L() - 1)); ------------------ | Branch (168:29): [True: 42, False: 0] ------------------ 169| | 170| 42| B0[0] = b_flags; 171| 42| copy_mem(&B0[1], m_nonce.data(), m_nonce.size()); 172| 42| encode_length(sz, &B0[m_nonce.size() + 1]); 173| | 174| 42| return B0; 175| 42|} _ZN5Botan8CCM_Mode9format_c0Ev: 177| 42|secure_vector CCM_Mode::format_c0() { 178| 42| if(m_nonce.size() != 15 - L()) { ------------------ | Branch (178:7): [True: 0, False: 42] ------------------ 179| 0| throw Invalid_State("CCM mode must set nonce"); 180| 0| } 181| 42| secure_vector C(CCM_BS); 182| | 183| 42| const uint8_t a_flags = static_cast(L() - 1); 184| | 185| 42| C[0] = a_flags; 186| 42| copy_mem(&C[1], m_nonce.data(), m_nonce.size()); 187| | 188| 42| return C; 189| 42|} _ZNK5Botan14CCM_Encryption13output_lengthEm: 191| 16|size_t CCM_Encryption::output_length(size_t input_length) const { 192| 16| return add_or_throw(input_length, tag_size(), "CCM input too large"); 193| 16|} _ZN5Botan14CCM_Encryption10finish_msgERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 195| 16|void CCM_Encryption::finish_msg(secure_vector& buffer, size_t offset) { 196| 16| BOTAN_ARG_CHECK(buffer.size() >= offset, "Offset is out of range"); ------------------ | | 35| 16| do { \ | | 36| 16| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 16| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 16] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 16| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 16] | | ------------------ ------------------ 197| | 198| 16| buffer.insert(buffer.begin() + offset, msg_buf().begin(), msg_buf().end()); 199| | 200| 16| const size_t sz = buffer.size() - offset; 201| 16| uint8_t* buf = buffer.data() + offset; 202| | 203| 16| const secure_vector& ad = ad_buf(); 204| 16| BOTAN_ARG_CHECK(ad.size() % CCM_BS == 0, "AD is block size multiple"); ------------------ | | 35| 16| do { \ | | 36| 16| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 16| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 16] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 16| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 16] | | ------------------ ------------------ 205| | 206| 16| const BlockCipher& E = cipher(); 207| | 208| 16| secure_vector T(CCM_BS); 209| 16| E.encrypt(format_b0(sz), T); 210| | 211| 32| for(size_t i = 0; i != ad.size(); i += CCM_BS) { ------------------ | Branch (211:22): [True: 16, False: 16] ------------------ 212| 16| xor_buf(T.data(), &ad[i], CCM_BS); 213| 16| E.encrypt(T); 214| 16| } 215| | 216| 16| secure_vector C = format_c0(); 217| 16| secure_vector S0(CCM_BS); 218| 16| E.encrypt(C, S0); 219| 16| inc(C); 220| | 221| 16| secure_vector X(CCM_BS); 222| | 223| 16| const uint8_t* buf_end = &buf[sz]; 224| | 225| 32| while(buf != buf_end) { ------------------ | Branch (225:10): [True: 16, False: 16] ------------------ 226| 16| const size_t to_proc = std::min(CCM_BS, buf_end - buf); 227| | 228| 16| xor_buf(T.data(), buf, to_proc); 229| 16| E.encrypt(T); 230| | 231| 16| E.encrypt(C, X); 232| 16| xor_buf(buf, X.data(), to_proc); 233| 16| inc(C); 234| | 235| 16| buf += to_proc; 236| 16| } 237| | 238| 16| T ^= S0; 239| | 240| 16| buffer += std::make_pair(T.data(), tag_size()); 241| | 242| 16| reset(); 243| 16|} _ZNK5Botan14CCM_Decryption13output_lengthEm: 245| 26|size_t CCM_Decryption::output_length(size_t input_length) const { 246| 26| BOTAN_ARG_CHECK(input_length >= tag_size(), "Message too short to be valid"); ------------------ | | 35| 26| do { \ | | 36| 26| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 26| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 26] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 26| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 26] | | ------------------ ------------------ 247| 26| return input_length - tag_size(); 248| 26|} _ZN5Botan14CCM_Decryption10finish_msgERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 250| 26|void CCM_Decryption::finish_msg(secure_vector& buffer, size_t offset) { 251| 26| BOTAN_ARG_CHECK(buffer.size() >= offset, "Offset is out of range"); ------------------ | | 35| 26| do { \ | | 36| 26| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 26| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 26] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 26| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 26] | | ------------------ ------------------ 252| | 253| 26| buffer.insert(buffer.begin() + offset, msg_buf().begin(), msg_buf().end()); 254| | 255| 26| const size_t sz = buffer.size() - offset; 256| 26| uint8_t* buf = buffer.data() + offset; 257| | 258| 26| BOTAN_ARG_CHECK(sz >= tag_size(), "input did not include the tag"); ------------------ | | 35| 26| do { \ | | 36| 26| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 26| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 26] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 26| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 26] | | ------------------ ------------------ 259| | 260| 26| const secure_vector& ad = ad_buf(); 261| 26| BOTAN_ARG_CHECK(ad.size() % CCM_BS == 0, "AD is block size multiple"); ------------------ | | 35| 26| do { \ | | 36| 26| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 26| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 26] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 26| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 26] | | ------------------ ------------------ 262| | 263| 26| const BlockCipher& E = cipher(); 264| | 265| 26| secure_vector T(CCM_BS); 266| 26| E.encrypt(format_b0(sz - tag_size()), T); 267| | 268| 52| for(size_t i = 0; i != ad.size(); i += CCM_BS) { ------------------ | Branch (268:22): [True: 26, False: 26] ------------------ 269| 26| xor_buf(T.data(), &ad[i], CCM_BS); 270| 26| E.encrypt(T); 271| 26| } 272| | 273| 26| secure_vector C = format_c0(); 274| | 275| 26| secure_vector S0(CCM_BS); 276| 26| E.encrypt(C, S0); 277| 26| inc(C); 278| | 279| 26| secure_vector X(CCM_BS); 280| | 281| 26| const uint8_t* buf_end = &buf[sz - tag_size()]; 282| | 283| 1.72k| while(buf != buf_end) { ------------------ | Branch (283:10): [True: 1.69k, False: 26] ------------------ 284| 1.69k| const size_t to_proc = std::min(CCM_BS, buf_end - buf); 285| | 286| 1.69k| E.encrypt(C, X); 287| 1.69k| xor_buf(buf, X.data(), to_proc); 288| 1.69k| inc(C); 289| | 290| 1.69k| xor_buf(T.data(), buf, to_proc); 291| 1.69k| E.encrypt(T); 292| | 293| 1.69k| buf += to_proc; 294| 1.69k| } 295| | 296| 26| T ^= S0; 297| | 298| 26| if(!CT::is_equal(T.data(), buf_end, tag_size()).as_bool()) { ------------------ | Branch (298:7): [True: 26, False: 0] ------------------ 299| 26| clear_mem(std::span{buffer}.subspan(offset, sz - tag_size())); 300| | // Reset on the failure path too, matching GCM/SIV/ChaCha20Poly1305, so a 301| | // failed decryptor is reusable rather than stuck in a partial state. 302| 26| reset(); 303| 26| throw Invalid_Authentication_Tag("CCM tag check failed"); 304| 26| } 305| | 306| 0| buffer.resize(buffer.size() - tag_size()); 307| | 308| 0| reset(); 309| 0|} _ZN5Botan21ChaCha20Poly1305_ModeC2Ev: 20| 33| m_chacha(StreamCipher::create("ChaCha")), m_poly1305(MessageAuthenticationCode::create("Poly1305")) { 21| 33| if(!m_chacha || !m_poly1305) { ------------------ | Branch (21:7): [True: 0, False: 33] | Branch (21:20): [True: 0, False: 33] ------------------ 22| 0| throw Algorithm_Not_Found("ChaCha20Poly1305"); 23| 0| } 24| 33|} _ZNK5Botan21ChaCha20Poly1305_Mode18valid_nonce_lengthEm: 26| 41|bool ChaCha20Poly1305_Mode::valid_nonce_length(size_t n) const { 27| 41| return (n == 8 || n == 12 || n == 24); ------------------ | Branch (27:12): [True: 0, False: 41] | Branch (27:22): [True: 41, False: 0] | Branch (27:33): [True: 0, False: 0] ------------------ 28| 41|} _ZN5Botan21ChaCha20Poly1305_Mode5resetEv: 45| 33|void ChaCha20Poly1305_Mode::reset() { 46| 33| m_ctext_len = 0; 47| 33| m_nonce_len = 0; 48| 33|} _ZN5Botan21ChaCha20Poly1305_Mode12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 54| 33|void ChaCha20Poly1305_Mode::key_schedule(std::span key) { 55| 33| m_chacha->set_key(key); 56| | // Clear any per-message state; AD is preserved per AEAD contract 57| | // (ChaCha20Poly1305 advertises associated_data_requires_key() == false). 58| 33| reset(); 59| 33|} _ZN5Botan21ChaCha20Poly1305_Mode21set_associated_data_nEmNSt3__14spanIKhLm18446744073709551615EEE: 61| 41|void ChaCha20Poly1305_Mode::set_associated_data_n(size_t idx, std::span ad) { 62| 41| BOTAN_ARG_CHECK(idx == 0, "ChaCha20Poly1305: cannot handle non-zero index in set_associated_data_n"); ------------------ | | 35| 41| do { \ | | 36| 41| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 41| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 41] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 41| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 41] | | ------------------ ------------------ 63| 41| if(m_ctext_len > 0 || m_nonce_len > 0) { ------------------ | Branch (63:7): [True: 0, False: 41] | Branch (63:26): [True: 0, False: 41] ------------------ 64| 0| throw Invalid_State("Cannot set AD for ChaCha20Poly1305 while processing a message"); 65| 0| } 66| 41| m_ad.assign(ad.begin(), ad.end()); 67| 41|} _ZN5Botan21ChaCha20Poly1305_Mode10update_lenEm: 69| 82|void ChaCha20Poly1305_Mode::update_len(uint64_t len) { 70| 82| uint8_t len8[8] = {0}; 71| 82| store_le(len, len8); 72| 82| m_poly1305->update(len8, 8); 73| 82|} _ZN5Botan21ChaCha20Poly1305_Mode9start_msgEPKhm: 75| 41|void ChaCha20Poly1305_Mode::start_msg(const uint8_t nonce[], size_t nonce_len) { 76| 41| BOTAN_STATE_CHECK(m_nonce_len == 0); ------------------ | | 51| 41| do { \ | | 52| 41| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 41| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 41] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 41| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 41] | | ------------------ ------------------ 77| | 78| 41| if(!valid_nonce_length(nonce_len)) { ------------------ | Branch (78:7): [True: 0, False: 41] ------------------ 79| 0| throw Invalid_IV_Length(name(), nonce_len); 80| 0| } 81| | 82| 41| m_ctext_len = 0; 83| 41| m_nonce_len = nonce_len; 84| | 85| 41| m_chacha->set_iv(nonce, nonce_len); 86| | 87| 41| uint8_t first_block[64]; 88| 41| m_chacha->write_keystream(first_block, sizeof(first_block)); 89| | 90| 41| m_poly1305->set_key(first_block, 32); 91| | // Remainder of first block is discarded 92| 41| secure_scrub_memory(first_block, sizeof(first_block)); 93| | 94| 41| m_poly1305->update(m_ad); 95| | 96| 41| if(cfrg_version()) { ------------------ | Branch (96:7): [True: 41, False: 0] ------------------ 97| 41| if(m_ad.size() % 16 != 0) { ------------------ | Branch (97:10): [True: 41, False: 0] ------------------ 98| 41| const uint8_t zeros[16] = {0}; 99| 41| m_poly1305->update(zeros, 16 - m_ad.size() % 16); 100| 41| } 101| 41| } else { 102| 0| update_len(m_ad.size()); 103| 0| } 104| 41|} _ZNK5Botan27ChaCha20Poly1305_Encryption13output_lengthEm: 106| 25|size_t ChaCha20Poly1305_Encryption::output_length(size_t input_length) const { 107| 25| return add_or_throw(input_length, tag_size(), "ChaCha20Poly1305 input too large"); 108| 25|} _ZN5Botan27ChaCha20Poly1305_Encryption11process_msgEPhm: 110| 25|size_t ChaCha20Poly1305_Encryption::process_msg(uint8_t buf[], size_t sz) { 111| 25| BOTAN_STATE_CHECK(m_nonce_len > 0); ------------------ | | 51| 25| do { \ | | 52| 25| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 25| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 25] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 25| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 25] | | ------------------ ------------------ 112| 25| m_chacha->cipher1(buf, sz); 113| 25| m_poly1305->update(buf, sz); // poly1305 of ciphertext 114| 25| m_ctext_len += sz; 115| | 116| | // RFC 8439 limits messages to 2^38-64 bytes 117| 25| constexpr uint64_t MAX_CHACHA20POLY1305_INPUT = (static_cast(1) << 38) - 64; 118| 25| if(cfrg_version() && m_ctext_len > MAX_CHACHA20POLY1305_INPUT) { ------------------ | Branch (118:7): [True: 25, False: 0] | Branch (118:25): [True: 0, False: 25] ------------------ 119| 0| throw Invalid_State("ChaCha20Poly1305 message length limit exceeded"); 120| 0| } 121| | 122| 25| return sz; 123| 25|} _ZN5Botan27ChaCha20Poly1305_Encryption10finish_msgERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 125| 25|void ChaCha20Poly1305_Encryption::finish_msg(secure_vector& buffer, size_t offset) { 126| 25| BOTAN_STATE_CHECK(m_nonce_len > 0); ------------------ | | 51| 25| do { \ | | 52| 25| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 25| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 25] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 25| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 25] | | ------------------ ------------------ 127| 25| BOTAN_ARG_CHECK(buffer.size() >= offset, "Offset is out of range"); ------------------ | | 35| 25| do { \ | | 36| 25| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 25| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 25] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 25| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 25] | | ------------------ ------------------ 128| 25| update(buffer, offset); 129| 25| if(cfrg_version()) { ------------------ | Branch (129:7): [True: 25, False: 0] ------------------ 130| 25| if(m_ctext_len % 16 != 0) { ------------------ | Branch (130:10): [True: 12, False: 13] ------------------ 131| 12| const uint8_t zeros[16] = {0}; 132| 12| const size_t padding = static_cast(16 - m_ctext_len % 16); 133| 12| m_poly1305->update(zeros, padding); 134| 12| } 135| 25| update_len(m_ad.size()); 136| 25| } 137| 25| update_len(m_ctext_len); 138| | 139| 25| const auto new_size = checked_add(buffer.size(), tag_size()); 140| 25| if(!new_size.has_value()) { ------------------ | Branch (140:7): [True: 0, False: 25] ------------------ 141| 0| throw Invalid_State("ChaCha20Poly1305 message length limit exceeded"); 142| 0| } 143| 25| buffer.resize(new_size.value()); 144| 25| m_poly1305->final(&buffer[buffer.size() - tag_size()]); 145| 25| m_ctext_len = 0; 146| 25| m_nonce_len = 0; 147| 25|} _ZNK5Botan27ChaCha20Poly1305_Decryption13output_lengthEm: 149| 16|size_t ChaCha20Poly1305_Decryption::output_length(size_t input_length) const { 150| 16| BOTAN_ARG_CHECK(input_length >= tag_size(), "Message too short to be valid"); ------------------ | | 35| 16| do { \ | | 36| 16| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 16| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 16] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 16| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 16] | | ------------------ ------------------ 151| 16| return input_length - tag_size(); 152| 16|} _ZN5Botan27ChaCha20Poly1305_Decryption11process_msgEPhm: 154| 16|size_t ChaCha20Poly1305_Decryption::process_msg(uint8_t buf[], size_t sz) { 155| 16| BOTAN_STATE_CHECK(m_nonce_len > 0); ------------------ | | 51| 16| do { \ | | 52| 16| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 16| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 16] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 16| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 16] | | ------------------ ------------------ 156| 16| m_poly1305->update(buf, sz); // poly1305 of ciphertext 157| 16| m_chacha->cipher1(buf, sz); 158| 16| m_ctext_len += sz; 159| | 160| 16| constexpr uint64_t MAX_CHACHA20POLY1305_INPUT = (static_cast(1) << 38) - 64; 161| 16| if(cfrg_version() && m_ctext_len > MAX_CHACHA20POLY1305_INPUT) { ------------------ | Branch (161:7): [True: 16, False: 0] | Branch (161:25): [True: 0, False: 16] ------------------ 162| 0| throw Invalid_State("ChaCha20Poly1305 message length limit exceeded"); 163| 0| } 164| | 165| 16| return sz; 166| 16|} _ZN5Botan27ChaCha20Poly1305_Decryption10finish_msgERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 168| 16|void ChaCha20Poly1305_Decryption::finish_msg(secure_vector& buffer, size_t offset) { 169| 16| BOTAN_STATE_CHECK(m_nonce_len > 0); ------------------ | | 51| 16| do { \ | | 52| 16| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 16| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 16] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 16| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 16] | | ------------------ ------------------ 170| 16| BOTAN_ARG_CHECK(buffer.size() >= offset, "Offset is out of range"); ------------------ | | 35| 16| do { \ | | 36| 16| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 16| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 16] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 16| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 16] | | ------------------ ------------------ 171| 16| const size_t sz = buffer.size() - offset; 172| 16| uint8_t* buf = buffer.data() + offset; 173| | 174| 16| BOTAN_ARG_CHECK(sz >= tag_size(), "input did not include the tag"); ------------------ | | 35| 16| do { \ | | 36| 16| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 16| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 16] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 16| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 16] | | ------------------ ------------------ 175| | 176| 16| const size_t remaining = sz - tag_size(); 177| | 178| 16| if(remaining > 0) { ------------------ | Branch (178:7): [True: 16, False: 0] ------------------ 179| | // Route through process_msg so the RFC 8439 length limit is enforced for 180| | // one-shot decryption too (finish() calls finish_msg() directly). 181| 16| process_msg(buf, remaining); 182| 16| } 183| | 184| 16| if(cfrg_version()) { ------------------ | Branch (184:7): [True: 16, False: 0] ------------------ 185| 16| if(m_ctext_len % 16 != 0) { ------------------ | Branch (185:10): [True: 13, False: 3] ------------------ 186| 13| const uint8_t zeros[16] = {0}; 187| 13| const size_t padding = static_cast(16 - m_ctext_len % 16); 188| 13| m_poly1305->update(zeros, padding); 189| 13| } 190| 16| update_len(m_ad.size()); 191| 16| } 192| | 193| 16| update_len(m_ctext_len); 194| | 195| 16| uint8_t mac[16]; 196| 16| m_poly1305->final(mac); 197| | 198| 16| const uint8_t* included_tag = &buf[remaining]; 199| | 200| 16| m_ctext_len = 0; 201| 16| m_nonce_len = 0; 202| | 203| 16| if(!CT::is_equal(mac, included_tag, tag_size()).as_bool()) { ------------------ | Branch (203:7): [True: 16, False: 0] ------------------ 204| 16| clear_mem(std::span{buffer}.subspan(offset, remaining)); 205| 16| throw Invalid_Authentication_Tag("ChaCha20Poly1305 tag check failed"); 206| 16| } 207| 0| buffer.resize(offset + remaining); 208| 0|} _ZN5Botan8GCM_ModeC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEm: 27| 97| m_tag_size(tag_size), m_cipher_name(cipher->name()) { 28| 97| if(cipher->block_size() != GCM_BS) { ------------------ | Branch (28:7): [True: 0, False: 97] ------------------ 29| 0| throw Invalid_Argument("Invalid block cipher for GCM"); 30| 0| } 31| | 32| | /* We allow any of the values 128, 120, 112, 104, or 96 bits as a tag size */ 33| | /* 64 bit tag is still supported but deprecated and will be removed in the future */ 34| 97| if(m_tag_size != 8 && (m_tag_size < 12 || m_tag_size > 16)) { ------------------ | Branch (34:7): [True: 97, False: 0] | Branch (34:27): [True: 0, False: 97] | Branch (34:46): [True: 0, False: 97] ------------------ 35| 0| throw Invalid_Argument(fmt("{} cannot use a tag of {} bytes", name(), m_tag_size)); 36| 0| } 37| | 38| 97| m_ctr = std::make_unique(std::move(cipher), 4); 39| 97| m_ghash = std::make_unique(); 40| 97|} _ZN5Botan8GCM_ModeD2Ev: 42| 97|GCM_Mode::~GCM_Mode() = default; _ZN5Botan8GCM_Mode5resetEv: 50| 97|void GCM_Mode::reset() { 51| 97| m_ghash->reset_state(); 52| 97| m_in_msg = false; 53| 97|} _ZNK5Botan8GCM_Mode18valid_nonce_lengthEm: 71| 87|bool GCM_Mode::valid_nonce_length(size_t len) const { 72| | // GCM does not support empty nonces 73| 87| return (len > 0); 74| 87|} _ZNK5Botan8GCM_Mode8key_specEv: 76| 97|Key_Length_Specification GCM_Mode::key_spec() const { 77| 97| return m_ctr->key_spec(); 78| 97|} _ZN5Botan8GCM_Mode12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 84| 97|void GCM_Mode::key_schedule(std::span key) { 85| 97| reset(); 86| 97| m_ctr->set_key(key); 87| | 88| 97| std::array zeros{}; 89| 97| m_ctr->set_iv(zeros); 90| | 91| 97| uint8_t H[GCM_BS] = {0}; 92| 97| m_ctr->encipher(H); 93| 97| m_ghash->set_key(H); 94| 97|} _ZN5Botan8GCM_Mode21set_associated_data_nEmNSt3__14spanIKhLm18446744073709551615EEE: 96| 87|void GCM_Mode::set_associated_data_n(size_t idx, std::span ad) { 97| 87| BOTAN_ARG_CHECK(idx == 0, "GCM: cannot handle non-zero index in set_associated_data_n"); ------------------ | | 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] | | ------------------ ------------------ 98| 87| m_ghash->set_associated_data(ad); 99| 87|} _ZN5Botan8GCM_Mode9start_msgEPKhm: 101| 87|void GCM_Mode::start_msg(const uint8_t nonce[], size_t nonce_len) { 102| 87| BOTAN_STATE_CHECK(!m_in_msg); ------------------ | | 51| 87| do { \ | | 52| 87| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 87| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 87] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 87| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 87] | | ------------------ ------------------ 103| | 104| 87| if(!valid_nonce_length(nonce_len)) { ------------------ | Branch (104:7): [True: 0, False: 87] ------------------ 105| 0| throw Invalid_IV_Length(name(), nonce_len); 106| 0| } 107| | 108| 87| std::array y0 = {}; 109| | 110| 87| if(nonce_len == 12) { ------------------ | Branch (110:7): [True: 87, False: 0] ------------------ 111| 87| copy_mem(y0.data(), nonce, nonce_len); 112| 87| y0[15] = 1; 113| 87| } else { 114| 0| m_ghash->nonce_hash(std::span(y0), {nonce, nonce_len}); 115| 0| } 116| | 117| 87| m_ctr->set_iv(y0.data(), y0.size()); 118| | 119| 87| clear_mem(y0.data(), y0.size()); 120| 87| m_ctr->encipher(y0); 121| | 122| 87| m_ghash->start(y0); 123| 87| secure_scrub_memory(y0); 124| 87| m_in_msg = true; 125| 87|} _ZNK5Botan14GCM_Encryption13output_lengthEm: 127| 24|size_t GCM_Encryption::output_length(size_t input_length) const { 128| 24| return add_or_throw(input_length, tag_size(), "GCM input too large"); 129| 24|} _ZN5Botan14GCM_Encryption10finish_msgERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 139| 24|void GCM_Encryption::finish_msg(secure_vector& buffer, size_t offset) { 140| 24| BOTAN_STATE_CHECK(m_in_msg); ------------------ | | 51| 24| do { \ | | 52| 24| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 24| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 24] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 24| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 24] | | ------------------ ------------------ 141| 24| BOTAN_ARG_CHECK(offset <= buffer.size(), "Invalid offset"); ------------------ | | 35| 24| do { \ | | 36| 24| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 24| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 24] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 24| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 24] | | ------------------ ------------------ 142| 24| const size_t sz = buffer.size() - offset; 143| 24| uint8_t* buf = buffer.data() + offset; 144| | 145| 24| m_ctr->cipher(buf, buf, sz); 146| 24| m_ghash->update({buf, sz}); 147| | 148| 24| std::array mac = {0}; 149| 24| m_ghash->final(std::span(mac).first(tag_size())); 150| 24| buffer += std::make_pair(mac.data(), tag_size()); 151| 24| m_in_msg = false; 152| 24|} _ZNK5Botan14GCM_Decryption13output_lengthEm: 154| 63|size_t GCM_Decryption::output_length(size_t input_length) const { 155| 63| BOTAN_ARG_CHECK(input_length >= tag_size(), "Message too short to be valid"); ------------------ | | 35| 63| do { \ | | 36| 63| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 63| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 63] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 63| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 63] | | ------------------ ------------------ 156| 63| return input_length - tag_size(); 157| 63|} _ZN5Botan14GCM_Decryption10finish_msgERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 167| 63|void GCM_Decryption::finish_msg(secure_vector& buffer, size_t offset) { 168| 63| BOTAN_STATE_CHECK(m_in_msg); ------------------ | | 51| 63| do { \ | | 52| 63| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 63| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 63] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 63| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 63] | | ------------------ ------------------ 169| 63| BOTAN_ARG_CHECK(offset <= buffer.size(), "Invalid offset"); ------------------ | | 35| 63| do { \ | | 36| 63| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 63| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 63] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 63| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 63] | | ------------------ ------------------ 170| 63| const size_t sz = buffer.size() - offset; 171| 63| uint8_t* buf = buffer.data() + offset; 172| | 173| 63| BOTAN_ARG_CHECK(sz >= tag_size(), "input did not include the tag"); ------------------ | | 35| 63| do { \ | | 36| 63| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 63| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 63] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 63| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 63] | | ------------------ ------------------ 174| | 175| 63| const size_t remaining = sz - tag_size(); 176| | 177| | // handle any final input before the tag 178| 63| if(remaining > 0) { ------------------ | Branch (178:7): [True: 62, False: 1] ------------------ 179| 62| m_ghash->update({buf, remaining}); 180| 62| m_ctr->cipher(buf, buf, remaining); 181| 62| } 182| | 183| 63| std::array mac = {0}; 184| 63| m_ghash->final(std::span(mac).first(tag_size())); 185| | 186| 63| const uint8_t* included_tag = &buffer[remaining + offset]; 187| | 188| 63| m_in_msg = false; 189| | 190| 63| if(!CT::is_equal(mac.data(), included_tag, tag_size()).as_bool()) { ------------------ | Branch (190:7): [True: 63, False: 0] ------------------ 191| 63| clear_mem(std::span{buffer}.subspan(offset, remaining)); 192| 63| throw Invalid_Authentication_Tag("GCM tag check failed"); 193| 63| } 194| | 195| 0| buffer.resize(offset + remaining); 196| 0|} _ZN5Botan8OCB_ModeC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEm: 166| 37| m_cipher(std::move(cipher)), 167| 37| m_checksum(m_cipher->parallel_bytes()), 168| 37| m_ad_hash(m_cipher->block_size()), 169| 37| m_tag_size(tag_size), 170| 37| m_block_size(m_cipher->block_size()), 171| 37| m_par_blocks(m_cipher->parallel_bytes() / m_block_size) { 172| 37| const size_t BS = block_size(); 173| | 174| | /* 175| | * draft-krovetz-ocb-wide-d1 specifies OCB for several other block 176| | * sizes but only 128, 192, 256 and 512 bit are currently supported 177| | * by this implementation. 178| | */ 179| 37| BOTAN_ARG_CHECK(BS == 16 || BS == 24 || BS == 32 || BS == 64, "Invalid block size for OCB"); ------------------ | | 35| 37| do { \ | | 36| 37| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 111| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 37, False: 0] | | | Branch (37:12): [True: 0, False: 0] | | | 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| 37| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 37] | | ------------------ ------------------ 180| | 181| 37| BOTAN_ARG_CHECK(m_tag_size % 4 == 0 && m_tag_size >= 8 && m_tag_size <= BS && m_tag_size <= 32, ------------------ | | 35| 37| do { \ | | 36| 37| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 222| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 37, False: 0] | | | Branch (37:12): [True: 37, False: 0] | | | Branch (37:12): [True: 37, False: 0] | | | Branch (37:12): [True: 37, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 37| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 37] | | ------------------ ------------------ 182| 37| "Invalid OCB tag length"); 183| 37|} _ZN5Botan8OCB_ModeD2Ev: 185| 37|OCB_Mode::~OCB_Mode() = default; _ZN5Botan8OCB_Mode5resetEv: 194| 72|void OCB_Mode::reset() { 195| 72| m_block_index = 0; 196| 72| zeroise(m_checksum); 197| 72| m_last_nonce.clear(); 198| 72| m_stretch.clear(); 199| 72| zeroise(m_nonce_buf); 200| 72| zeroise(m_offset); 201| 72| if(m_L) { ------------------ | Branch (201:7): [True: 72, False: 0] ------------------ 202| 72| m_L->reset(); // NOLINT(*-ambiguous-smartptr-reset-call) 203| 72| } 204| 72|} _ZNK5Botan8OCB_Mode18valid_nonce_lengthEm: 206| 35|bool OCB_Mode::valid_nonce_length(size_t length) const { 207| 35| if(length == 0) { ------------------ | Branch (207:7): [True: 0, False: 35] ------------------ 208| 0| return false; 209| 0| } 210| 35| if(block_size() == 16) { ------------------ | Branch (210:7): [True: 35, False: 0] ------------------ 211| 35| return length < 16; 212| 35| } else { 213| 0| return length < (block_size() - 1); 214| 0| } 215| 35|} _ZNK5Botan8OCB_Mode8key_specEv: 229| 37|Key_Length_Specification OCB_Mode::key_spec() const { 230| 37| return m_cipher->key_spec(); 231| 37|} _ZNK5Botan8OCB_Mode19has_keying_materialEv: 233| 138|bool OCB_Mode::has_keying_material() const { 234| 138| return m_cipher->has_keying_material(); 235| 138|} _ZN5Botan8OCB_Mode12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 237| 37|void OCB_Mode::key_schedule(std::span key) { 238| 37| m_cipher->set_key(key); 239| 37| m_L = std::make_unique(*m_cipher); 240| | 241| | // Drop all key-dependent per-message state: m_last_nonce/m_stretch are 242| | // cached for the update_nonce() fast path and would otherwise allow a 243| | // start_msg() with a same-valued nonce under the new key to silently 244| | // reuse the stretch computed under the previous key. 245| 37| reset(); 246| | 247| | // m_ad_hash was precomputed against the previous L values and cipher 248| | // key. Re-keying invalidates it; AD must be re-set after set_key. 249| 37| zeroise(m_ad_hash); 250| 37|} _ZN5Botan8OCB_Mode21set_associated_data_nEmNSt3__14spanIKhLm18446744073709551615EEE: 252| 35|void OCB_Mode::set_associated_data_n(size_t idx, std::span ad) { 253| 35| BOTAN_ARG_CHECK(idx == 0, "OCB: cannot handle non-zero index in set_associated_data_n"); ------------------ | | 35| 35| do { \ | | 36| 35| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 35| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 35] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 35| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 35] | | ------------------ ------------------ 254| 35| assert_key_material_set(); 255| 35| BOTAN_STATE_CHECK(!m_L->initialized()); ------------------ | | 51| 35| do { \ | | 52| 35| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 35| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 35] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 35| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 35] | | ------------------ ------------------ 256| 35| m_ad_hash = ocb_hash(*m_L, *m_cipher, ad.data(), ad.size()); 257| 35|} _ZN5Botan8OCB_Mode12update_nonceEPKhm: 259| 35|const secure_vector& OCB_Mode::update_nonce(const uint8_t nonce[], size_t nonce_len) { 260| 35| const size_t BS = block_size(); 261| | 262| 35| BOTAN_ASSERT(BS == 16 || BS == 24 || BS == 32 || BS == 64, "OCB block size is supported"); ------------------ | | 71| 35| do { \ | | 72| 35| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 105| if(!(expr)) { \ | | ------------------ | | | Branch (73:12): [True: 35, False: 0] | | | Branch (73:12): [True: 0, False: 0] | | | Branch (73:12): [True: 0, False: 0] | | | Branch (73:12): [True: 0, False: 0] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 35| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 35] | | ------------------ ------------------ 263| | 264| | // NOLINTNEXTLINE(readability-avoid-nested-conditional-operator) 265| 35| const size_t MASKLEN = (BS == 16 ? 6 : ((BS == 24) ? 7 : 8)); ------------------ | Branch (265:28): [True: 35, False: 0] | Branch (265:44): [True: 0, False: 0] ------------------ 266| | 267| 35| const uint8_t BOTTOM_MASK = static_cast((static_cast(1) << MASKLEN) - 1); 268| | 269| 35| m_nonce_buf.resize(BS); 270| 35| clear_mem(m_nonce_buf.data(), m_nonce_buf.size()); 271| | 272| 35| copy_mem(&m_nonce_buf[BS - nonce_len], nonce, nonce_len); 273| 35| m_nonce_buf[0] = static_cast(((tag_size() * 8) % (BS * 8)) << (BS <= 16 ? 1 : 0)); ------------------ | Branch (273:76): [True: 35, False: 0] ------------------ 274| | 275| 35| m_nonce_buf[BS - nonce_len - 1] ^= 1; 276| | 277| 35| const uint8_t bottom = m_nonce_buf[BS - 1] & BOTTOM_MASK; 278| 35| m_nonce_buf[BS - 1] &= ~BOTTOM_MASK; 279| | 280| 35| const bool need_new_stretch = (m_last_nonce != m_nonce_buf); 281| | 282| 35| if(need_new_stretch) { ------------------ | Branch (282:7): [True: 35, False: 0] ------------------ 283| 35| m_last_nonce = m_nonce_buf; 284| | 285| 35| m_cipher->encrypt(m_nonce_buf); 286| | 287| | /* 288| | The loop bounds (BS vs BS/2) are derived from the relation 289| | between the block size and the MASKLEN. Using the terminology 290| | of draft-krovetz-ocb-wide, we have to derive enough bits in 291| | ShiftedKtop to read up to BLOCKLEN+bottom bits from Stretch. 292| | 293| | +----------+---------+-------+---------+ 294| | | BLOCKLEN | RESIDUE | SHIFT | MASKLEN | 295| | +----------+---------+-------+---------+ 296| | | 32 | 141 | 17 | 4 | 297| | | 64 | 27 | 25 | 5 | 298| | | 96 | 1601 | 33 | 6 | 299| | | 128 | 135 | 8 | 6 | 300| | | 192 | 135 | 40 | 7 | 301| | | 256 | 1061 | 1 | 8 | 302| | | 384 | 4109 | 80 | 8 | 303| | | 512 | 293 | 176 | 8 | 304| | | 1024 | 524355 | 352 | 9 | 305| | +----------+---------+-------+---------+ 306| | */ 307| 35| if(BS == 16) { ------------------ | Branch (307:10): [True: 35, False: 0] ------------------ 308| 315| for(size_t i = 0; i != BS / 2; ++i) { ------------------ | Branch (308:28): [True: 280, False: 35] ------------------ 309| 280| m_nonce_buf.push_back(m_nonce_buf[i] ^ m_nonce_buf[i + 1]); 310| 280| } 311| 35| } else if(BS == 24) { ------------------ | Branch (311:17): [True: 0, False: 0] ------------------ 312| 0| for(size_t i = 0; i != 16; ++i) { ------------------ | Branch (312:28): [True: 0, False: 0] ------------------ 313| 0| m_nonce_buf.push_back(m_nonce_buf[i] ^ m_nonce_buf[i + 5]); 314| 0| } 315| 0| } else if(BS == 32) { ------------------ | Branch (315:17): [True: 0, False: 0] ------------------ 316| 0| for(size_t i = 0; i != BS; ++i) { ------------------ | Branch (316:28): [True: 0, False: 0] ------------------ 317| 0| m_nonce_buf.push_back(m_nonce_buf[i] ^ (m_nonce_buf[i] << 1) ^ (m_nonce_buf[i + 1] >> 7)); 318| 0| } 319| 0| } else if(BS == 64) { ------------------ | Branch (319:17): [True: 0, False: 0] ------------------ 320| 0| for(size_t i = 0; i != BS / 2; ++i) { ------------------ | Branch (320:28): [True: 0, False: 0] ------------------ 321| 0| m_nonce_buf.push_back(m_nonce_buf[i] ^ m_nonce_buf[i + 22]); 322| 0| } 323| 0| } 324| | 325| 35| m_stretch = m_nonce_buf; 326| 35| } 327| | 328| | // now set the offset from stretch and bottom 329| 35| const size_t shift_bytes = bottom / 8; 330| 35| const size_t shift_bits = bottom % 8; 331| | 332| 35| BOTAN_ASSERT(m_stretch.size() >= BS + shift_bytes + 1, "Size ok"); ------------------ | | 71| 35| do { \ | | 72| 35| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 35| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 35] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 35| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 35] | | ------------------ ------------------ 333| | 334| 35| m_offset.resize(BS); 335| 595| for(size_t i = 0; i != BS; ++i) { ------------------ | Branch (335:22): [True: 560, False: 35] ------------------ 336| 560| m_offset[i] = (m_stretch[i + shift_bytes] << shift_bits); 337| 560| m_offset[i] |= (m_stretch[i + shift_bytes + 1] >> (8 - shift_bits)); 338| 560| } 339| | 340| 35| return m_offset; 341| 35|} _ZN5Botan8OCB_Mode9start_msgEPKhm: 343| 35|void OCB_Mode::start_msg(const uint8_t nonce[], size_t nonce_len) { 344| 35| if(!valid_nonce_length(nonce_len)) { ------------------ | Branch (344:7): [True: 0, False: 35] ------------------ 345| 0| throw Invalid_IV_Length(name(), nonce_len); 346| 0| } 347| | 348| 35| assert_key_material_set(); 349| 35| BOTAN_STATE_CHECK(!m_L->initialized()); ------------------ | | 51| 35| do { \ | | 52| 35| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 35| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 35] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 35| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 35] | | ------------------ ------------------ 350| | 351| 35| m_L->init(update_nonce(nonce, nonce_len)); 352| 35| zeroise(m_checksum); 353| 35| m_block_index = 0; 354| 35|} _ZNK5Botan14OCB_Encryption13output_lengthEm: 356| 9|size_t OCB_Encryption::output_length(size_t input_length) const { 357| 9| return add_or_throw(input_length, tag_size(), "OCB input too large"); 358| 9|} _ZN5Botan14OCB_Encryption7encryptEPhm: 360| 9|void OCB_Encryption::encrypt(uint8_t buffer[], size_t blocks) { 361| 9| assert_key_material_set(); 362| 9| BOTAN_STATE_CHECK(m_L->initialized()); ------------------ | | 51| 9| do { \ | | 52| 9| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 9| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 9] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 9| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 9] | | ------------------ ------------------ 363| | 364| 9| const size_t BS = block_size(); 365| | 366| 14| while(blocks > 0) { ------------------ | Branch (366:10): [True: 5, False: 9] ------------------ 367| 5| const size_t proc_blocks = std::min(blocks, par_blocks()); 368| 5| const size_t proc_bytes = proc_blocks * BS; 369| | 370| 5| const uint8_t* offsets = m_L->compute_offsets(m_block_index, proc_blocks); 371| | 372| 5| xor_buf(m_checksum.data(), buffer, proc_bytes); 373| | 374| 5| xor_buf(buffer, offsets, proc_bytes); 375| 5| m_cipher->encrypt_n(buffer, buffer, proc_blocks); 376| 5| xor_buf(buffer, offsets, proc_bytes); 377| | 378| 5| buffer += proc_bytes; 379| 5| blocks -= proc_blocks; 380| 5| m_block_index += proc_blocks; 381| 5| } 382| 9|} _ZN5Botan14OCB_Encryption10finish_msgERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 390| 9|void OCB_Encryption::finish_msg(secure_vector& buffer, size_t offset) { 391| 9| assert_key_material_set(); 392| 9| BOTAN_STATE_CHECK(m_L->initialized()); ------------------ | | 51| 9| do { \ | | 52| 9| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 9| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 9] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 9| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 9] | | ------------------ ------------------ 393| | 394| 9| const size_t BS = block_size(); 395| | 396| 9| BOTAN_ARG_CHECK(buffer.size() >= offset, "Offset is out of range"); ------------------ | | 35| 9| do { \ | | 36| 9| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 9| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 9] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 9| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 9] | | ------------------ ------------------ 397| 9| const size_t sz = buffer.size() - offset; 398| 9| uint8_t* buf = buffer.data() + offset; 399| | 400| 9| secure_vector mac(BS); 401| | 402| 9| if(sz > 0) { ------------------ | Branch (402:7): [True: 9, False: 0] ------------------ 403| 9| const size_t final_full_blocks = sz / BS; 404| 9| const size_t remainder_bytes = sz - (final_full_blocks * BS); 405| | 406| 9| encrypt(buf, final_full_blocks); 407| 9| mac = m_L->offset(); 408| | 409| 9| if(remainder_bytes > 0) { ------------------ | Branch (409:10): [True: 4, False: 5] ------------------ 410| 4| BOTAN_ASSERT(remainder_bytes < BS, "Only a partial block left"); ------------------ | | 71| 4| do { \ | | 72| 4| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 4| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 4] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 4| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 4] | | ------------------ ------------------ 411| 4| uint8_t* remainder = &buf[sz - remainder_bytes]; 412| | 413| 4| xor_buf(m_checksum.data(), remainder, remainder_bytes); 414| 4| m_checksum[remainder_bytes] ^= 0x80; 415| | 416| | // Offset_* 417| 4| mac ^= m_L->star(); 418| | 419| 4| secure_vector pad(BS); 420| 4| m_cipher->encrypt(mac, pad); 421| 4| xor_buf(remainder, pad.data(), remainder_bytes); 422| 4| } 423| 9| } else { 424| 0| mac = m_L->offset(); 425| 0| } 426| | 427| | // now compute the tag 428| | 429| | // fold checksum 430| 153| for(size_t i = 0; i != m_checksum.size(); i += BS) { ------------------ | Branch (430:22): [True: 144, False: 9] ------------------ 431| 144| xor_buf(mac.data(), m_checksum.data() + i, BS); 432| 144| } 433| | 434| 9| xor_buf(mac.data(), m_L->dollar().data(), BS); 435| 9| m_cipher->encrypt(mac); 436| 9| xor_buf(mac.data(), m_ad_hash.data(), BS); 437| | 438| 9| buffer += std::make_pair(mac.data(), tag_size()); 439| | 440| 9| reset(); 441| 9|} _ZNK5Botan14OCB_Decryption13output_lengthEm: 443| 26|size_t OCB_Decryption::output_length(size_t input_length) const { 444| 26| BOTAN_ARG_CHECK(input_length >= tag_size(), "Message too short to be valid"); ------------------ | | 35| 26| do { \ | | 36| 26| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 26| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 26] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 26| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 26] | | ------------------ ------------------ 445| 26| return input_length - tag_size(); 446| 26|} _ZN5Botan14OCB_Decryption7decryptEPhm: 448| 24|void OCB_Decryption::decrypt(uint8_t buffer[], size_t blocks) { 449| 24| assert_key_material_set(); 450| 24| BOTAN_STATE_CHECK(m_L->initialized()); ------------------ | | 51| 24| do { \ | | 52| 24| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 24| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 24] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 24| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 24] | | ------------------ ------------------ 451| | 452| 24| const size_t BS = block_size(); 453| | 454| 102| while(blocks > 0) { ------------------ | Branch (454:10): [True: 78, False: 24] ------------------ 455| 78| const size_t proc_blocks = std::min(blocks, par_blocks()); 456| 78| const size_t proc_bytes = proc_blocks * BS; 457| | 458| 78| const uint8_t* offsets = m_L->compute_offsets(m_block_index, proc_blocks); 459| | 460| 78| xor_buf(buffer, offsets, proc_bytes); 461| 78| m_cipher->decrypt_n(buffer, buffer, proc_blocks); 462| 78| xor_buf(buffer, offsets, proc_bytes); 463| | 464| 78| xor_buf(m_checksum.data(), buffer, proc_bytes); 465| | 466| 78| buffer += proc_bytes; 467| 78| blocks -= proc_blocks; 468| 78| m_block_index += proc_blocks; 469| 78| } 470| 24|} _ZN5Botan14OCB_Decryption10finish_msgERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 478| 26|void OCB_Decryption::finish_msg(secure_vector& buffer, size_t offset) { 479| 26| assert_key_material_set(); 480| 26| BOTAN_STATE_CHECK(m_L->initialized()); ------------------ | | 51| 26| do { \ | | 52| 26| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 26| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 26] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 26| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 26] | | ------------------ ------------------ 481| | 482| 26| const size_t BS = block_size(); 483| | 484| 26| BOTAN_ARG_CHECK(buffer.size() >= offset, "Offset is out of range"); ------------------ | | 35| 26| do { \ | | 36| 26| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 26| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 26] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 26| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 26] | | ------------------ ------------------ 485| 26| const size_t sz = buffer.size() - offset; 486| 26| uint8_t* buf = buffer.data() + offset; 487| | 488| 26| BOTAN_ARG_CHECK(sz >= tag_size(), "input did not include the tag"); ------------------ | | 35| 26| do { \ | | 36| 26| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 26| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 26] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 26| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 26] | | ------------------ ------------------ 489| | 490| 26| const size_t remaining = sz - tag_size(); 491| | 492| 26| secure_vector mac(BS); 493| | 494| 26| if(remaining > 0) { ------------------ | Branch (494:7): [True: 24, False: 2] ------------------ 495| 24| const size_t final_full_blocks = remaining / BS; 496| 24| const size_t final_bytes = remaining - (final_full_blocks * BS); 497| | 498| 24| decrypt(buf, final_full_blocks); 499| 24| mac ^= m_L->offset(); 500| | 501| 24| if(final_bytes > 0) { ------------------ | Branch (501:10): [True: 23, False: 1] ------------------ 502| 23| BOTAN_ASSERT(final_bytes < BS, "Only a partial block left"); ------------------ | | 71| 23| do { \ | | 72| 23| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 23| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 23] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 23| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 23] | | ------------------ ------------------ 503| | 504| 23| uint8_t* remainder = &buf[remaining - final_bytes]; 505| | 506| 23| mac ^= m_L->star(); 507| 23| secure_vector pad(BS); 508| 23| m_cipher->encrypt(mac, pad); // P_* 509| 23| xor_buf(remainder, pad.data(), final_bytes); 510| | 511| 23| xor_buf(m_checksum.data(), remainder, final_bytes); 512| 23| m_checksum[final_bytes] ^= 0x80; 513| 23| } 514| 24| } else { 515| 2| mac = m_L->offset(); 516| 2| } 517| | 518| | // compute the mac 519| | 520| | // fold checksum 521| 442| for(size_t i = 0; i != m_checksum.size(); i += BS) { ------------------ | Branch (521:22): [True: 416, False: 26] ------------------ 522| 416| xor_buf(mac.data(), m_checksum.data() + i, BS); 523| 416| } 524| | 525| 26| mac ^= m_L->dollar(); 526| 26| m_cipher->encrypt(mac); 527| 26| mac ^= m_ad_hash; 528| | 529| 26| reset(); 530| | 531| | // compare mac 532| 26| const uint8_t* included_tag = &buf[remaining]; 533| | 534| 26| if(!CT::is_equal(mac.data(), included_tag, tag_size()).as_bool()) { ------------------ | Branch (534:7): [True: 26, False: 0] ------------------ 535| 26| clear_mem(std::span{buffer}.subspan(offset, remaining)); 536| 26| throw Invalid_Authentication_Tag("OCB tag check failed"); 537| 26| } 538| | 539| | // remove tag from end of message 540| 0| buffer.resize(remaining + offset); 541| 0|} _ZN5Botan10L_computer5resetEv: 51| 72| void reset() { m_offset.clear(); } _ZNK5Botan10L_computer11initializedEv: 53| 138| bool initialized() const { return !m_offset.empty(); } ocb.cpp:_ZN5Botan12_GLOBAL__N_18ocb_hashERKNS_10L_computerERKNS_11BlockCipherEPKhm: 132| 35|secure_vector ocb_hash(const L_computer& L, const BlockCipher& cipher, const uint8_t ad[], size_t ad_len) { 133| 35| const size_t BS = cipher.block_size(); 134| 35| secure_vector sum(BS); 135| 35| secure_vector offset(BS); 136| | 137| 35| secure_vector buf(BS); 138| | 139| 35| const size_t ad_blocks = (ad_len / BS); 140| 35| const size_t ad_remainder = (ad_len % BS); 141| | 142| 35| for(size_t i = 0; i != ad_blocks; ++i) { ------------------ | Branch (142:22): [True: 0, False: 35] ------------------ 143| | // this loop could run in parallel 144| 0| offset ^= L.get(var_ctz64(i + 1)); 145| 0| buf = offset; 146| 0| xor_buf(buf.data(), &ad[BS * i], BS); 147| 0| cipher.encrypt(buf); 148| 0| sum ^= buf; 149| 0| } 150| | 151| 35| if(ad_remainder > 0) { ------------------ | Branch (151:7): [True: 35, False: 0] ------------------ 152| 35| offset ^= L.star(); 153| 35| buf = offset; 154| 35| xor_buf(buf.data(), &ad[BS * ad_blocks], ad_remainder); 155| 35| buf[ad_remainder] ^= 0x80; 156| 35| cipher.encrypt(buf); 157| 35| sum ^= buf; 158| 35| } 159| | 160| 35| return sum; 161| 35|} _ZNK5Botan10L_computer3getEm: 61| 455| const secure_vector& get(size_t i) const { 62| 457| while(m_L.size() <= i) { ------------------ | Branch (62:16): [True: 2, False: 455] ------------------ 63| 2| m_L.push_back(poly_double(m_L.back())); 64| 2| } 65| | 66| 455| return m_L[i]; 67| 455| } _ZN5Botan10L_computer11poly_doubleERKNSt3__16vectorIhNS_16secure_allocatorIhEEEE: 114| 335| static secure_vector poly_double(const secure_vector& in) { 115| 335| secure_vector out(in.size()); 116| 335| poly_double_n(out.data(), in.data(), out.size()); 117| 335| return out; 118| 335| } _ZN5Botan10L_computer4initERKNSt3__16vectorIhNS_16secure_allocatorIhEEEE: 49| 35| void init(const secure_vector& offset) { m_offset = offset; } _ZN5Botan10L_computer15compute_offsetsEmm: 69| 83| const uint8_t* compute_offsets(uint64_t block_index, size_t blocks) { 70| 83| BOTAN_ASSERT(blocks <= m_max_blocks, "OCB offsets"); ------------------ | | 71| 83| do { \ | | 72| 83| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 73| 83| if(!(expr)) { \ | | ------------------ | | | Branch (73:10): [True: 0, False: 83] | | ------------------ | | 74| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 75| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 76| 0| } \ | | 77| 83| } while(0) | | ------------------ | | | Branch (77:12): [Folded, False: 83] | | ------------------ ------------------ 71| | 72| 83| uint8_t* offsets = m_offset_buf.data(); 73| | 74| 83| if(block_index % 4 == 0) { ------------------ | Branch (74:13): [True: 83, False: 0] ------------------ 75| 83| const secure_vector& L0 = get(0); 76| 83| const secure_vector& L1 = get(1); 77| | 78| 329| while(blocks >= 4) { ------------------ | Branch (78:19): [True: 246, False: 83] ------------------ 79| | // ntz(4*i+1) == 0 80| | // ntz(4*i+2) == 1 81| | // ntz(4*i+3) == 0 82| 246| block_index += 4; 83| 246| const size_t ntz4 = var_ctz64(block_index); 84| | 85| 246| xor_buf(offsets, m_offset.data(), L0.data(), m_BS); 86| 246| offsets += m_BS; 87| | 88| 246| xor_buf(offsets, offsets - m_BS, L1.data(), m_BS); 89| 246| offsets += m_BS; 90| | 91| 246| xor_buf(m_offset.data(), L1.data(), m_BS); 92| 246| copy_mem(offsets, m_offset.data(), m_BS); 93| 246| offsets += m_BS; 94| | 95| 246| xor_buf(m_offset.data(), get(ntz4).data(), m_BS); 96| 246| copy_mem(offsets, m_offset.data(), m_BS); 97| 246| offsets += m_BS; 98| | 99| 246| blocks -= 4; 100| 246| } 101| 83| } 102| | 103| 126| for(size_t i = 0; i != blocks; ++i) { // could be done in parallel ------------------ | Branch (103:28): [True: 43, False: 83] ------------------ 104| 43| const size_t ntz = var_ctz64(block_index + i + 1); 105| 43| xor_buf(m_offset.data(), get(ntz).data(), m_BS); 106| 43| copy_mem(offsets, m_offset.data(), m_BS); 107| 43| offsets += m_BS; 108| 43| } 109| | 110| 83| return m_offset_buf.data(); 111| 83| } _ZNK5Botan10L_computer6offsetEv: 59| 35| const secure_vector& offset() const { return m_offset; } _ZNK5Botan10L_computer4starEv: 55| 99| const secure_vector& star() const { return m_L_star; } _ZNK5Botan10L_computer6dollarEv: 57| 72| const secure_vector& dollar() const { return m_L_dollar; } _ZN5Botan10L_computerC2ERKNS_11BlockCipherE: 25| 37| m_BS(cipher.block_size()), m_max_blocks(cipher.parallel_bytes() / m_BS) { 26| 37| m_L_star.resize(m_BS); 27| 37| cipher.encrypt(m_L_star); 28| 37| m_L_dollar = poly_double(star()); 29| | 30| | // Preallocate the m_L vector to the maximum expected size to avoid 31| | // re-allocations during runtime. This had caused a use-after-free in 32| | // earlier versions, due to references into this buffer becoming stale 33| | // in `compute_offset()`, after calling `get()` in the hot path. 34| | // 35| | // Note, that the list member won't be pre-allocated, so the expected 36| | // memory overhead is negligible. 37| | // 38| | // See also https://github.com/randombit/botan/issues/3812 39| 37| m_L.reserve(65); 40| 37| m_L.push_back(poly_double(dollar())); 41| | 42| 296| while(m_L.size() < 8) { ------------------ | Branch (42:16): [True: 259, False: 37] ------------------ 43| 259| m_L.push_back(poly_double(m_L.back())); 44| 259| } 45| | 46| 37| m_offset_buf.resize(m_BS * m_max_blocks); 47| 37| } _ZN5Botan8CBC_ModeC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEENS2_INS_28BlockCipherModePaddingMethodENS4_IS7_EEEE: 21| 107| m_cipher(std::move(cipher)), m_padding(std::move(padding)), m_block_size(m_cipher->block_size()) { 22| 107| if(m_padding && !m_padding->valid_blocksize(m_block_size)) { ------------------ | Branch (22:7): [True: 107, False: 0] | Branch (22:20): [True: 0, False: 107] ------------------ 23| 0| throw Invalid_Argument(fmt("Padding {} cannot be used with {} in CBC mode", m_padding->name(), m_cipher->name())); 24| 0| } 25| 107|} _ZNK5Botan8CBC_Mode17ideal_granularityEv: 48| 84|size_t CBC_Mode::ideal_granularity() const { 49| 84| return cipher().parallel_bytes(); 50| 84|} _ZNK5Botan8CBC_Mode8key_specEv: 52| 107|Key_Length_Specification CBC_Mode::key_spec() const { 53| 107| return cipher().key_spec(); 54| 107|} _ZNK5Botan8CBC_Mode18valid_nonce_lengthEm: 60| 80|bool CBC_Mode::valid_nonce_length(size_t n) const { 61| 80| return (n == 0 || n == block_size()); ------------------ | Branch (61:12): [True: 0, False: 80] | Branch (61:22): [True: 80, False: 0] ------------------ 62| 80|} _ZN5Botan8CBC_Mode12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 68| 107|void CBC_Mode::key_schedule(std::span key) { 69| 107| m_cipher->set_key(key); 70| 107| m_state.clear(); 71| 107|} _ZN5Botan8CBC_Mode9start_msgEPKhm: 73| 80|void CBC_Mode::start_msg(const uint8_t nonce[], size_t nonce_len) { 74| 80| if(!valid_nonce_length(nonce_len)) { ------------------ | Branch (74:7): [True: 0, False: 80] ------------------ 75| 0| throw Invalid_IV_Length(name(), nonce_len); 76| 0| } 77| | 78| | /* 79| | * A nonce of zero length means carry the last ciphertext value over 80| | * as the new IV, as unfortunately some protocols require this. If 81| | * this is the first message then we use an IV of all zeros. 82| | */ 83| 80| if(nonce_len > 0) { ------------------ | Branch (83:7): [True: 80, False: 0] ------------------ 84| 80| m_state.assign(nonce, nonce + nonce_len); 85| 80| } else if(m_state.empty()) { ------------------ | Branch (85:14): [True: 0, False: 0] ------------------ 86| 0| m_state.resize(m_cipher->block_size()); 87| 0| } 88| | // else leave the state alone 89| 80|} _ZN5Botan14CBC_Encryption11process_msgEPhm: 99| 37|size_t CBC_Encryption::process_msg(uint8_t buf[], size_t sz) { 100| 37| BOTAN_STATE_CHECK(state().empty() == false); ------------------ | | 51| 37| do { \ | | 52| 37| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 37| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 37] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 37| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 37] | | ------------------ ------------------ 101| 37| const size_t BS = block_size(); 102| | 103| 37| BOTAN_ARG_CHECK(sz % BS == 0, "CBC input is not full blocks"); ------------------ | | 35| 37| do { \ | | 36| 37| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 37| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 37] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 37| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 37] | | ------------------ ------------------ 104| 37| const size_t blocks = sz / BS; 105| | 106| 37| if(blocks > 0) { ------------------ | Branch (106:7): [True: 37, False: 0] ------------------ 107| 37| xor_buf(&buf[0], state_ptr(), BS); 108| 37| cipher().encrypt(&buf[0]); 109| | 110| 119| for(size_t i = 1; i != blocks; ++i) { ------------------ | Branch (110:25): [True: 82, False: 37] ------------------ 111| 82| xor_buf(&buf[BS * i], &buf[BS * (i - 1)], BS); 112| 82| cipher().encrypt(&buf[BS * i]); 113| 82| } 114| | 115| 37| state().assign(&buf[BS * (blocks - 1)], &buf[BS * blocks]); 116| 37| } 117| | 118| 37| return sz; 119| 37|} _ZN5Botan14CBC_Decryption11process_msgEPhm: 202| 43|size_t CBC_Decryption::process_msg(uint8_t buf[], size_t sz) { 203| 43| BOTAN_STATE_CHECK(state().empty() == false); ------------------ | | 51| 43| do { \ | | 52| 43| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 43| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 43] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 43| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 43] | | ------------------ ------------------ 204| | 205| 43| const size_t BS = block_size(); 206| | 207| 43| BOTAN_ARG_CHECK(sz % BS == 0, "Input is not full blocks"); ------------------ | | 35| 43| do { \ | | 36| 43| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 43| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 43] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 43| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 43] | | ------------------ ------------------ 208| 43| size_t blocks = sz / BS; 209| | 210| 179| while(blocks > 0) { ------------------ | Branch (210:10): [True: 136, False: 43] ------------------ 211| 136| const size_t to_proc = std::min(BS * blocks, m_tempbuf.size()); 212| | 213| 136| cipher().decrypt_n(buf, m_tempbuf.data(), to_proc / BS); 214| | 215| 136| xor_buf(m_tempbuf.data(), state_ptr(), BS); 216| 136| xor_buf(&m_tempbuf[BS], buf, to_proc - BS); 217| 136| copy_mem(state_ptr(), buf + (to_proc - BS), BS); 218| | 219| 136| copy_mem(buf, m_tempbuf.data(), to_proc); 220| | 221| 136| buf += to_proc; 222| 136| blocks -= to_proc / BS; 223| 136| } 224| | 225| 43| return sz; 226| 43|} _ZN5Botan31ed25519_basepoint_mul_to_x25519ENSt3__14spanIhLm32EEERKNS_14Ed25519_ScalarE: 634| 13|void ed25519_basepoint_mul_to_x25519(std::span out, const Ed25519_Scalar& scalar) { 635| 13| const auto h = basepoint_mul(scalar); 636| | 637| | /* 638| | * The birational map from the twisted Edwards curve to Curve25519 sends 639| | * (x, y) to u = (1 + y) / (1 - y) (RFC 7748 Section 4.1), which for a 640| | * projective point (X : Y : Z) is (Z + Y) / (Z - Y). The map sends the 641| | * Ed25519 base point to u = 9, so this is the X25519 public key for the 642| | * scalar. 643| | * 644| | * The only point with Z == Y is the identity, where the inversion of zero 645| | * returns zero and so u == 0, matching what the Montgomery ladder produces 646| | * for the identity. A clamped X25519 scalar is never zero mod l so this 647| | * cannot happen for X25519 anyway. 648| | */ 649| 13| const auto u = (h.Z + h.Y) * (h.Z - h.Y).invert(); 650| 13| u.serialize_to(out); 651| 13| CT::unpoison(out); 652| 13|} ed25519_ge.cpp:_ZN5Botan12_GLOBAL__N_113basepoint_mulERKNS_14Ed25519_ScalarE: 582| 13|Ed25519_Point_Extended basepoint_mul(const Ed25519_Scalar& scalar) { 583| 13| static const std::array, 32> B_precomp = ed25519_base_precomp(); 584| | 585| 13| const auto a = scalar.to_bytes(); 586| | 587| 13| std::array e{}; 588| | 589| 13| CT::poison(a.data(), a.size()); 590| | 591| | // each e[i] is between 0 and 15 except e[63] which is between 0 and 7 592| 429| for(size_t i = 0; i != 32; ++i) { ------------------ | Branch (592:22): [True: 416, False: 13] ------------------ 593| 416| e[2 * i + 0] = (a[i] >> 0) & 0x0F; 594| 416| e[2 * i + 1] = (a[i] >> 4) & 0x0F; 595| 416| } 596| | 597| 13| int8_t carry = 0; 598| 832| for(size_t i = 0; i < 63; ++i) { ------------------ | Branch (598:22): [True: 819, False: 13] ------------------ 599| 819| e[i] += carry; 600| 819| carry = e[i] + 8; 601| 819| carry >>= 4; 602| 819| e[i] -= carry << 4; 603| 819| } 604| 13| e[63] += carry; 605| | /* each e[i] is between -8 and 8 */ 606| | 607| 13| auto h = Ed25519_Point_Extended::identity(); 608| 429| for(size_t i = 1; i < 64; i += 2) { ------------------ | Branch (608:22): [True: 416, False: 13] ------------------ 609| 416| h = Ed25519_Point_Extended::from(h + select(B_precomp[i / 2].data(), e[i])); 610| 416| } 611| | 612| 13| auto s = Ed25519_Point_Projective::from(h.dbl()); 613| 13| s = Ed25519_Point_Projective::from(s.dbl()); 614| 13| s = Ed25519_Point_Projective::from(s.dbl()); 615| 13| h = Ed25519_Point_Extended::from(s.dbl()); 616| | 617| 429| for(size_t i = 0; i != 64; i += 2) { ------------------ | Branch (617:22): [True: 416, False: 13] ------------------ 618| 416| h = Ed25519_Point_Extended::from(h + select(B_precomp[i / 2].data(), e[i])); 619| 416| } 620| | 621| 13| CT::unpoison(a.data(), a.size()); 622| | 623| 13| return h; 624| 13|} ed25519_ge.cpp:_ZN5Botan12_GLOBAL__N_120ed25519_base_precompEv: 360| 1|std::array, 32> ed25519_base_precomp() { 361| 1| constexpr size_t PTS = 32 * 8; 362| | 363| 1| auto pts_storage = std::make_unique>(); 364| 1| auto& pts = *pts_storage; 365| | 366| 1| auto base = ed25519_basepoint(); 367| 33| for(size_t i = 0; i != 32; ++i) { ------------------ | Branch (367:22): [True: 32, False: 1] ------------------ 368| 32| pts[8 * i] = base; 369| 32| const auto base_c = Ed25519_Point_Cached::from(base); 370| 256| for(size_t j = 1; j != 8; ++j) { ------------------ | Branch (370:25): [True: 224, False: 32] ------------------ 371| 224| pts[8 * i + j] = Ed25519_Point_Extended::from(pts[8 * i + j - 1] + base_c); 372| 224| } 373| | 374| | // The next row base is 256*base; the row ends with 8*base already 375| 32| base = pts[8 * i + 7]; 376| 192| for(size_t k = 0; k != 5; ++k) { ------------------ | Branch (376:25): [True: 160, False: 32] ------------------ 377| 160| base = Ed25519_Point_Extended::from(base.dbl()); 378| 160| } 379| 32| } 380| | 381| 1| auto prod_storage = std::make_unique>(); 382| 1| auto& prod = *prod_storage; 383| | 384| 1| prod[0] = pts[0].Z; 385| 256| for(size_t i = 1; i != PTS; ++i) { ------------------ | Branch (385:22): [True: 255, False: 1] ------------------ 386| 255| prod[i] = prod[i - 1] * pts[i].Z; 387| 255| } 388| | 389| 1| auto inv = prod[PTS - 1].invert(); 390| | 391| 1| std::array, 32> table; 392| 257| for(size_t i = PTS; i-- > 0;) { ------------------ | Branch (392:24): [True: 256, False: 1] ------------------ 393| 256| const auto z_inv = (i == 0) ? inv : inv * prod[i - 1]; ------------------ | Branch (393:26): [True: 1, False: 255] ------------------ 394| 256| inv = inv * pts[i].Z; 395| | 396| 256| const auto x = pts[i].X * z_inv; 397| 256| const auto y = pts[i].Y * z_inv; 398| 256| auto& n = table[i / 8][i % 8]; 399| 256| n.yplusx = y + x; 400| 256| n.yminusx = y - x; 401| 256| n.xy2d = ED25519_D2 * (x * y); 402| 256| } 403| | 404| 1| return table; 405| 1|} ed25519_ge.cpp:_ZN5Botan12_GLOBAL__N_117ed25519_basepointEv: 351| 1|const Ed25519_Point_Extended& ed25519_basepoint() { 352| 1| static const Ed25519_Point_Extended b = ed25519_derive_basepoint(); 353| 1| return b; 354| 1|} ed25519_ge.cpp:_ZN5Botan12_GLOBAL__N_124ed25519_derive_basepointEv: 325| 1|Ed25519_Point_Extended ed25519_derive_basepoint() { 326| 1| const auto y = Ed25519_FieldElement::from_word(4) * Ed25519_FieldElement::from_word(5).invert(); 327| | 328| | // Recover x = sqrt((y^2-1)/(d*y^2+1)) as in point decoding 329| 1| const auto yy = y.sqr(); 330| 1| const auto u = yy - Ed25519_FieldElement::one(); 331| 1| const auto v = ED25519_D * yy + Ed25519_FieldElement::one(); 332| 1| const auto v3 = v.sqr() * v; 333| 1| const auto v7 = v3.sqr() * v; 334| 1| auto x = (u * v3) * (u * v7).pow_22523(); 335| | 336| 1| if(!(x.sqr() * v - u).is_zero()) { ------------------ | Branch (336:7): [True: 0, False: 1] ------------------ 337| 0| x = x * ED25519_SQRTM1; 338| 0| } 339| 1| if(x.is_negative()) { ------------------ | Branch (339:7): [True: 1, False: 0] ------------------ 340| 1| x = -x; 341| 1| } 342| | 343| 1| Ed25519_Point_Extended b; 344| 1| b.X = x; 345| 1| b.Y = y; 346| 1| b.Z = Ed25519_FieldElement::one(); 347| 1| b.T = x * y; 348| 1| return b; 349| 1|} ed25519_ge.cpp:_ZN5Botan12_GLOBAL__N_120Ed25519_Point_Cached4fromERKNS0_22Ed25519_Point_ExtendedE: 198| 32| static constexpr Ed25519_Point_Cached from(const Ed25519_Point_Extended& p) { 199| 32| Ed25519_Point_Cached r; 200| 32| r.YplusX = p.Y + p.X; 201| 32| r.YminusX = p.Y - p.X; 202| 32| r.Z = p.Z; 203| 32| r.T2d = p.T * ED25519_D2; 204| 32| return r; 205| 32| } ed25519_ge.cpp:_ZN5Botan12_GLOBAL__N_1plERKNS0_22Ed25519_Point_ExtendedERKNS0_20Ed25519_Point_CachedE: 218| 224|inline constexpr Ed25519_Point_Completed operator+(const Ed25519_Point_Extended& p, const Ed25519_Point_Cached& q) { 219| 224| Ed25519_Point_Completed r; 220| 224| r.X = p.Y + p.X; // YpX1 = Y1+X1 221| 224| r.Y = p.Y - p.X; // YmX1 = Y1-X1 222| 224| r.Z = r.X * q.YplusX; // A = YpX1*YpX2 223| 224| r.Y = r.Y * q.YminusX; // B = YmX1*YmX2 224| 224| r.T = q.T2d * p.T; // C = T2d2*T1 225| 224| r.X = p.Z * q.Z; // ZZ = Z1*Z2 226| 224| const auto t0 = r.X + r.X; // D = 2*ZZ 227| 224| r.X = r.Z - r.Y; // X3 = A-B 228| 224| r.Y = r.Z + r.Y; // Y3 = A+B 229| 224| r.Z = t0 + r.T; // Z3 = D+C 230| 224| r.T = t0 - r.T; // T3 = D-C 231| 224| return r; 232| 224|} ed25519_ge.cpp:_ZN5Botan12_GLOBAL__N_122Ed25519_Point_Extended8identityEv: 128| 13| static constexpr Ed25519_Point_Extended identity() { 129| 13| Ed25519_Point_Extended h; 130| 13| h.X = Ed25519_FieldElement::zero(); 131| 13| h.Y = Ed25519_FieldElement::one(); 132| 13| h.Z = Ed25519_FieldElement::one(); 133| 13| h.T = Ed25519_FieldElement::zero(); 134| 13| return h; 135| 13| } ed25519_ge.cpp:_ZN5Botan12_GLOBAL__N_122Ed25519_Point_Extended4fromERKNS0_23Ed25519_Point_CompletedE: 148| 1.22k| static constexpr Ed25519_Point_Extended from(const Ed25519_Point_Completed& p) { 149| 1.22k| Ed25519_Point_Extended r; 150| 1.22k| r.X = p.X * p.T; 151| 1.22k| r.Y = p.Y * p.Z; 152| 1.22k| r.Z = p.Z * p.T; 153| 1.22k| r.T = p.X * p.Y; 154| 1.22k| return r; 155| 1.22k| } ed25519_ge.cpp:_ZN5Botan12_GLOBAL__N_1plERKNS0_22Ed25519_Point_ExtendedERKNS0_19Ed25519_Point_NielsE: 237| 832|inline constexpr Ed25519_Point_Completed operator+(const Ed25519_Point_Extended& p, const Ed25519_Point_Niels& q) { 238| 832| Ed25519_Point_Completed r; 239| 832| r.X = p.Y + p.X; // YpX1 = Y1+X1 240| 832| r.Y = p.Y - p.X; // YmX1 = Y1-X1 241| 832| r.Z = r.X * q.yplusx; // A = YpX1*ypx2 242| 832| r.Y = r.Y * q.yminusx; // B = YmX1*ymx2 243| 832| r.T = q.xy2d * p.T; // C = xy2d2*T1 244| 832| const auto t0 = p.Z + p.Z; // D = 2*Z1 245| 832| r.X = r.Z - r.Y; // X3 = A-B 246| 832| r.Y = r.Z + r.Y; // Y3 = A+B 247| 832| r.Z = t0 + r.T; // Z3 = D+C 248| 832| r.T = t0 - r.T; // T3 = D-C 249| 832| return r; 250| 832|} ed25519_ge.cpp:_ZN5Botan12_GLOBAL__N_16selectEPKNS0_19Ed25519_Point_NielsEa: 553| 832|Ed25519_Point_Niels select(const Ed25519_Point_Niels base[8], int8_t b) { 554| 832| const uint8_t bnegative = static_cast(b) >> 7; 555| 832| const uint8_t babs = b - ((-static_cast(bnegative) & b) * 2); 556| | 557| 832| auto t = Ed25519_Point_Niels::identity(); 558| | 559| 7.48k| for(size_t i = 0; i != 8; ++i) { ------------------ | Branch (559:22): [True: 6.65k, False: 832] ------------------ 560| 6.65k| const auto b_is_i1 = CT::Mask::is_equal(babs, static_cast(i + 1)).as_choice(); 561| 6.65k| t.yplusx.conditional_assign(b_is_i1, base[i].yplusx); 562| 6.65k| t.yminusx.conditional_assign(b_is_i1, base[i].yminusx); 563| 6.65k| t.xy2d.conditional_assign(b_is_i1, base[i].xy2d); 564| 6.65k| } 565| | 566| | // If negative have to swap yminusx and yplusx, and negate xy2d 567| 832| const auto is_negative = CT::Mask::expand(bnegative).as_choice(); 568| 832| Ed25519_FieldElement::conditional_swap(is_negative, t.yplusx, t.yminusx); 569| 832| t.xy2d.conditional_assign(is_negative, -t.xy2d); 570| | 571| 832| return t; 572| 832|} ed25519_ge.cpp:_ZN5Botan12_GLOBAL__N_119Ed25519_Point_Niels8identityEv: 179| 832| static constexpr Ed25519_Point_Niels identity() { 180| 832| Ed25519_Point_Niels h; 181| 832| h.yplusx = Ed25519_FieldElement::one(); 182| 832| h.yminusx = Ed25519_FieldElement::one(); 183| 832| h.xy2d = Ed25519_FieldElement::zero(); 184| 832| return h; 185| 832| } ed25519_ge.cpp:_ZN5Botan12_GLOBAL__N_124Ed25519_Point_Projective4fromERKNS0_23Ed25519_Point_CompletedE: 75| 39| static constexpr Ed25519_Point_Projective from(const Ed25519_Point_Completed& p) { 76| 39| Ed25519_Point_Projective r; 77| 39| r.X = p.X * p.T; 78| 39| r.Y = p.Y * p.Z; 79| 39| r.Z = p.Z * p.T; 80| 39| return r; 81| 39| } ed25519_ge.cpp:_ZNK5Botan12_GLOBAL__N_122Ed25519_Point_Extended3dblEv: 137| 173| constexpr Ed25519_Point_Completed dbl() const { 138| 173| Ed25519_Point_Projective q; 139| 173| q.X = X; 140| 173| q.Y = Y; 141| 173| q.Z = Z; 142| 173| return q.dbl(); 143| 173| } ed25519_ge.cpp:_ZNK5Botan12_GLOBAL__N_124Ed25519_Point_Projective3dblEv: 102| 212|constexpr Ed25519_Point_Completed Ed25519_Point_Projective::dbl() const { 103| 212| Ed25519_Point_Completed r; 104| 212| r.X = X.sqr(); // XX=X1^2 105| 212| r.Z = Y.sqr(); // YY=Y1^2 106| 212| r.T = Z.sqr2(); // B=2*Z1^2 107| 212| r.Y = X + Y; // A=X1+Y1 108| 212| const auto t0 = r.Y.sqr(); // AA=A^2 109| 212| r.Y = r.Z + r.X; // Y3=YY+XX 110| 212| r.Z = r.Z - r.X; // Z3=YY-XX 111| 212| r.X = t0 - r.Y; // X3=AA-Y3 112| 212| r.T = r.T - r.Z; // T3=B-Z3 113| 212| return r; 114| 212|} _ZN5Botan14Ed25519_Scalar10from_bytesENSt3__14spanIKhLm32EEE: 122| 13|Ed25519_Scalar Ed25519_Scalar::from_bytes(std::span b) { 123| | // x mod l == mont_mul(x, R) 124| 13| return Ed25519_Scalar(sc_mont_mul(sc_load(b), SC_R1)); 125| 13|} _ZNK5Botan14Ed25519_Scalar12serialize_toENSt3__14spanIhLm32EEE: 151| 13|void Ed25519_Scalar::serialize_to(std::span b) const { 152| 65| for(size_t i = 0; i != WORDS; ++i) { ------------------ | Branch (152:22): [True: 52, False: 13] ------------------ 153| 52| store_le(m_val[i], b.data() + sizeof(word) * i); 154| 52| } 155| 13|} ed25519_scalar.cpp:_ZN5Botan12_GLOBAL__N_111sc_mont_mulERKNSt3__15arrayImLm4EEES5_: 82| 13|std::array sc_mont_mul(const std::array& x, const std::array& y) { 83| 13| std::array z; // NOLINT(*-member-init) 84| 13| comba_mul(z.data(), x.data(), y.data()); 85| | 86| 13| std::array r; // NOLINT(*-member-init) 87| 13| std::array ws; // NOLINT(*-member-init) 88| 13| bigint_monty_redc(r.data(), z.data(), SC_L.data(), SC_WORDS, SC_L_DASH, ws.data(), ws.size()); 89| 13| return r; 90| 13|} ed25519_scalar.cpp:_ZN5Botan12_GLOBAL__N_17sc_loadENSt3__14spanIKhLm32EEE: 112| 13|std::array sc_load(std::span b) { 113| 13| std::array r; // NOLINT(*-member-init) 114| 65| for(size_t i = 0; i != SC_WORDS; ++i) { ------------------ | Branch (114:22): [True: 52, False: 13] ------------------ 115| 52| r[i] = load_le(b.data(), i); 116| 52| } 117| 13| return r; 118| 13|} _ZN5Botan16X25519_PublicKeyC1ENSt3__14spanIKhLm18446744073709551615EEE: 120| 4|X25519_PublicKey::X25519_PublicKey(std::span pub) { 121| 4| size_check(pub.size(), "public key"); 122| 4| m_public = std::make_shared(std::vector(pub.begin(), pub.end())); 123| 4|} _ZNK5Botan16X25519_PublicKey19raw_public_key_bitsEv: 125| 15|std::vector X25519_PublicKey::raw_public_key_bits() const { 126| 15| return m_public->key(); 127| 15|} _ZN5Botan17X25519_PrivateKeyC1ERNS_21RandomNumberGeneratorE: 145| 13|X25519_PrivateKey::X25519_PrivateKey(RandomNumberGenerator& rng) { 146| 13| load_x25519_keypair(rng.random_vec(32), m_public, m_private); 147| 13|} _ZNK5Botan17X25519_PrivateKey24_create_key_agreement_opERNS_21RandomNumberGeneratorERKNS_31PK_Key_Agreement_Options_ReaderE: 207| 2| RandomNumberGenerator& /*rng*/, const PK_Key_Agreement_Options_Reader& options) const { 208| 2| require_software_provider(options, algo_name()); 209| | 210| 2| return std::make_unique(m_private, options); 211| 2|} _ZNK5Botan22X25519_PrivateKey_Data3keyEv: 36| 2| const secure_vector& key() const { return m_key; } _ZNK5Botan21X25519_PublicKey_Data3keyEv: 26| 15| const std::vector& key() const { return m_key; } x25519.cpp:_ZN5Botan12_GLOBAL__N_110size_checkEmPKc: 52| 6|void size_check(size_t size, const char* thing) { 53| 6| if(size != 32) { ------------------ | Branch (53:7): [True: 2, False: 4] ------------------ 54| 2| throw Decoding_Error(fmt("Invalid size {} for X25519 {}", size, thing)); 55| 2| } 56| 6|} x25519.cpp:_ZN5Botan12_GLOBAL__N_119load_x25519_keypairENSt3__16vectorIhNS_16secure_allocatorIhEEEERNS1_10shared_ptrIKNS_21X25519_PublicKey_DataEEERNS6_IKNS_22X25519_PrivateKey_DataEEE: 86| 13| std::shared_ptr& sk_out) { 87| 13| BOTAN_ASSERT_NOMSG(secret.size() == 32); ------------------ | | 84| 13| do { \ | | 85| 13| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 13| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 13] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 13| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 13] | | ------------------ ------------------ 88| 13| std::vector pub(32); 89| 13| x25519_basepoint(std::span(pub.data(), 32), std::span(secret.data(), 32)); 90| 13| pk_out = std::make_shared(std::move(pub)); 91| 13| sk_out = std::make_shared(std::move(secret)); 92| 13|} _ZN5Botan22X25519_PrivateKey_DataC2ENSt3__16vectorIhNS_16secure_allocatorIhEEEE: 34| 13| explicit X25519_PrivateKey_Data(secure_vector key) : m_key(std::move(key)) {} x25519.cpp:_ZN5Botan12_GLOBAL__N_112x25519_agreeERKNSt3__16vectorIhNS_16secure_allocatorIhEEEEPKh: 59| 2|secure_vector x25519_agree(const secure_vector& secret, const uint8_t pubval[32]) { 60| 2| BOTAN_ASSERT_NOMSG(secret.size() == 32); ------------------ | | 84| 2| do { \ | | 85| 2| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 2| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 2] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 2| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 2] | | ------------------ ------------------ 61| 2| secure_vector shared_key(32); 62| 2| x25519_scalarmult(std::span(shared_key.data(), 32), 63| 2| std::span(secret.data(), 32), 64| 2| std::span(pubval, 32)); 65| | 66| | // RFC 7748 Section 6.1 67| | // Both [parties] MAY check, without leaking extra information about 68| | // the value of K, whether K is the all-zero value and abort if so. 69| | // 70| | // TODO: once the generic Key Agreement operation creation is equipped 71| | // with a more flexible parameterization, this check could be 72| | // made optional. 73| | // For instance: `sk->agree().with_optional_sanity_checks(true)`. 74| | // See also: https://github.com/randombit/botan/pull/4318 75| 2| if(CT::all_zeros(shared_key.data(), shared_key.size()).as_bool()) { ------------------ | Branch (75:7): [True: 1, False: 1] ------------------ 76| 1| throw Invalid_Argument("X25519 public point appears to be of low order"); 77| 1| } 78| | 79| 1| return shared_key; 80| 2|} _ZN5Botan21X25519_PublicKey_DataC2ENSt3__16vectorIhNS1_9allocatorIhEEEE: 24| 15| explicit X25519_PublicKey_Data(std::vector key) : m_key(std::move(key)) {} x25519.cpp:_ZN5Botan12_GLOBAL__N_119X25519_KA_OperationC2ENSt3__110shared_ptrIKNS_22X25519_PrivateKey_DataEEERKNS_31PK_Key_Agreement_Options_ReaderE: 191| 2| PK_Ops::Key_Agreement_with_KDF(options), m_key(std::move(key)) {} x25519.cpp:_ZN5Botan12_GLOBAL__N_119X25519_KA_Operation9raw_agreeEPKhm: 195| 2| secure_vector raw_agree(const uint8_t w[], size_t w_len) override { 196| 2| size_check(w_len, "public value"); 197| 2| return x25519_agree(m_key->key(), w); 198| 2| } _ZN5Botan17x25519_scalarmultENSt3__14spanIhLm32EEENS1_IKhLm32EEES4_: 33| 2| std::span u) { 34| 2| CT::poison(scalar); 35| 2| CT::poison(u); 36| | 37| 2| auto k = x25519_clamp(scalar); 38| 2| x25519_ladder(out, k, u); 39| 2| secure_scrub_memory(k.data(), k.size()); 40| | 41| 2| CT::unpoison(scalar); 42| 2| CT::unpoison(u); 43| 2| CT::unpoison(out); 44| 2|} _ZN5Botan16x25519_basepointENSt3__14spanIhLm32EEENS1_IKhLm32EEE: 46| 13|void x25519_basepoint(std::span out, std::span scalar) { 47| | /* 48| | * Compute the public key as [k]B on the Ed25519 curve using the fixed-base 49| | * tables, then map the result to Curve25519. This gives the same result as 50| | * running the Montgomery ladder on u = 9 since the base points correspond 51| | * under the birational map and B has order l, but is several times faster. 52| | */ 53| 13| CT::poison(scalar); 54| | 55| 13| auto k = x25519_clamp(scalar); 56| 13| const auto s = Ed25519_Scalar::from_bytes(k); 57| 13| ed25519_basepoint_mul_to_x25519(out, s); 58| 13| secure_scrub_memory(k.data(), k.size()); 59| | 60| 13| CT::unpoison(scalar); 61| 13|} x25519_scalarmult.cpp:_ZN5Botan12_GLOBAL__N_112x25519_clampENSt3__14spanIKhLm32EEE: 20| 15|std::array x25519_clamp(std::span scalar) { 21| 15| std::array k{}; 22| 15| copy_mem(k, scalar); 23| 15| k[0] &= 248; 24| 15| k[31] &= 127; 25| 15| k[31] |= 64; 26| 15| return k; 27| 15|} _ZN5Botan9Gf448ElemC2ENSt3__14spanIKhLm56EEE: 356| 36|Gf448Elem::Gf448Elem(std::span x) /* NOLINT(*-member-init) */ { 357| 36| load_le(m_x, x); 358| 36|} _ZN5Botan9Gf448ElemC2Em: 360| 145k|Gf448Elem::Gf448Elem(uint64_t least_sig_word) /* NOLINT(*-member-init) */ { 361| 145k| clear_mem(m_x); 362| 145k| m_x[0] = least_sig_word; 363| 145k|} _ZNK5Botan9Gf448Elem8to_bytesENSt3__14spanIhLm56EEE: 365| 18|void Gf448Elem::to_bytes(std::span out) const { 366| 18| store_le(out, to_canonical(m_x)); 367| 18|} _ZNK5Botan9Gf448Elem8to_bytesEv: 369| 18|std::array Gf448Elem::to_bytes() const { 370| 18| std::array bytes{}; 371| 18| to_bytes(bytes); 372| 18| return bytes; 373| 18|} _ZN5Botan9Gf448Elem12ct_cond_swapENS_2CT4MaskImEERS0_: 375| 16.1k|void Gf448Elem::ct_cond_swap(CT::Mask mask, Gf448Elem& other) { 376| 129k| for(size_t i = 0; i < WORDS_448; ++i) { ------------------ | Branch (376:22): [True: 113k, False: 16.1k] ------------------ 377| 113k| mask.conditional_swap(m_x[i], other.m_x[i]); 378| 113k| } 379| 16.1k|} _ZNK5Botan9Gf448ElemplERKS0_: 385| 32.2k|Gf448Elem Gf448Elem::operator+(const Gf448Elem& other) const { 386| 32.2k| Gf448Elem res(0); 387| 32.2k| gf_add(res.m_x, m_x, other.m_x); 388| 32.2k| return res; 389| 32.2k|} _ZNK5Botan9Gf448ElemmiERKS0_: 391| 32.2k|Gf448Elem Gf448Elem::operator-(const Gf448Elem& other) const { 392| 32.2k| Gf448Elem res(0); 393| 32.2k| gf_sub(res.m_x, m_x, other.m_x); 394| 32.2k| return res; 395| 32.2k|} _ZNK5Botan9Gf448ElemmlERKS0_: 403| 40.3k|Gf448Elem Gf448Elem::operator*(const Gf448Elem& other) const { 404| 40.3k| Gf448Elem res(0); 405| 40.3k| gf_mul(res.m_x, m_x, other.m_x); 406| 40.3k| return res; 407| 40.3k|} _ZNK5Botan9Gf448ElemdvERKS0_: 409| 18|Gf448Elem Gf448Elem::operator/(const Gf448Elem& other) const { 410| 18| Gf448Elem res(0); 411| 18| gf_inv(res.m_x, other.m_x); 412| 18| gf_mul(res.m_x, m_x, res.m_x); 413| 18| return res; 414| 18|} _ZN5Botan7mul_a24ERKNS_9Gf448ElemE: 439| 8.06k|Gf448Elem mul_a24(const Gf448Elem& a) { 440| 8.06k| Gf448Elem res(0); 441| 8.06k| gf_mul_a24(res.words(), a.words()); 442| 8.06k| return res; 443| 8.06k|} _ZN5Botan6squareERKNS_9Gf448ElemE: 445| 32.2k|Gf448Elem square(const Gf448Elem& elem) { 446| 32.2k| Gf448Elem res(0); 447| 32.2k| gf_square(res.words(), elem.words()); 448| 32.2k| return res; 449| 32.2k|} curve448_gf.cpp:_ZN5Botan12_GLOBAL__N_112to_canonicalENSt3__14spanIKmLm7EEE: 335| 18|std::array to_canonical(std::span in) { 336| 18| const std::array p = {0xffffffffffffffff, 337| 18| 0xffffffffffffffff, 338| 18| 0xffffffffffffffff, 339| 18| 0xfffffffeffffffff, 340| 18| 0xffffffffffffffff, 341| 18| 0xffffffffffffffff, 342| 18| 0xffffffffffffffff}; 343| | 344| 18| std::array in_minus_p; // NOLINT(*-member-init) 345| 18| uint64_t borrow = 0; 346| 144| for(size_t i = 0; i < WORDS_448; ++i) { ------------------ | Branch (346:22): [True: 126, False: 18] ------------------ 347| 126| in_minus_p[i] = word_sub(in[i], p[i], &borrow); 348| 126| } 349| 18| std::array out; // NOLINT(*-member-init) 350| 18| CT::Mask::expand(borrow).select_n(out.data(), in.data(), in_minus_p.data(), WORDS_448); 351| 18| return out; 352| 18|} curve448_gf.cpp:_ZN5Botan12_GLOBAL__N_16gf_addENSt3__14spanImLm7EEENS2_IKmLm7EEES5_: 155| 32.2k| std::span b) { 156| 32.2k| std::array ws; // NOLINT(*-member-init) 157| | 158| 32.2k| uint64_t carry = 0; 159| 32.2k| ws[0] = word_add(a[0], b[0], &carry); 160| 32.2k| ws[1] = word_add(a[1], b[1], &carry); 161| 32.2k| ws[2] = word_add(a[2], b[2], &carry); 162| 32.2k| ws[3] = word_add(a[3], b[3], &carry); 163| 32.2k| ws[4] = word_add(a[4], b[4], &carry); 164| 32.2k| ws[5] = word_add(a[5], b[5], &carry); 165| 32.2k| ws[6] = word_add(a[6], b[6], &carry); 166| 32.2k| ws[7] = carry; 167| | 168| 32.2k| reduce_after_add(out, ws); 169| 32.2k|} curve448_gf.cpp:_ZN5Botan12_GLOBAL__N_116reduce_after_addENSt3__14spanImLm7EEENS2_IKmLm8EEE: 27| 121k|void reduce_after_add(std::span h_3, std::span h_1) { 28| 121k| std::array h_2; /* NOLINT(*-member-init) */ 29| 121k| uint64_t carry = 0; 30| | 31| 121k| constexpr uint64_t zero = 0; 32| | 33| | // Line 27+ (of the paper's algorithm 1) 34| 121k| h_2[0] = word_add(h_1[0], h_1[7], &carry); 35| 121k| h_2[1] = word_add(h_1[1], zero, &carry); 36| 121k| h_2[2] = word_add(h_1[2], zero, &carry); 37| | 38| | // Line 30 39| 121k| h_2[3] = word_add(h_1[3], h_1[7] << 32, &carry); 40| | 41| | // Line 31+ 42| 121k| h_2[4] = word_add(h_1[4], zero, &carry); 43| 121k| h_2[5] = word_add(h_1[5], zero, &carry); 44| 121k| h_2[6] = word_add(h_1[6], zero, &carry); 45| | 46| 121k| h_2[7] = carry; 47| | 48| 121k| carry = 0; 49| 121k| h_3[0] = word_add(h_2[0], h_2[7], &carry); 50| 121k| h_3[1] = word_add(h_2[1], zero, &carry); 51| 121k| h_3[2] = word_add(h_2[2], zero, &carry); 52| | // Line 37 53| 121k| h_3[3] = h_2[3] + (h_2[7] << 32) + carry; 54| | 55| | // Line 38 56| 121k| h_3[4] = h_2[4]; 57| 121k| h_3[5] = h_2[5]; 58| 121k| h_3[6] = h_2[6]; 59| 121k|} curve448_gf.cpp:_ZN5Botan12_GLOBAL__N_16gf_subENSt3__14spanImLm7EEENS2_IKmLm7EEES5_: 178| 32.2k| std::span b) { 179| 32.2k| std::array h_0; // NOLINT(*-member-init) 180| 32.2k| std::array h_1; // NOLINT(*-member-init) 181| | 182| 32.2k| uint64_t borrow = 0; 183| 32.2k| h_0[0] = word_sub(a[0], b[0], &borrow); 184| 32.2k| h_0[1] = word_sub(a[1], b[1], &borrow); 185| 32.2k| h_0[2] = word_sub(a[2], b[2], &borrow); 186| 32.2k| h_0[3] = word_sub(a[3], b[3], &borrow); 187| 32.2k| h_0[4] = word_sub(a[4], b[4], &borrow); 188| 32.2k| h_0[5] = word_sub(a[5], b[5], &borrow); 189| 32.2k| h_0[6] = word_sub(a[6], b[6], &borrow); 190| 32.2k| uint64_t delta = borrow; 191| 32.2k| uint64_t delta_p = delta << 32; 192| 32.2k| borrow = 0; 193| | 194| 32.2k| constexpr uint64_t zero = 0; 195| | 196| 32.2k| h_1[0] = word_sub(h_0[0], delta, &borrow); 197| 32.2k| h_1[1] = word_sub(h_0[1], zero, &borrow); 198| 32.2k| h_1[2] = word_sub(h_0[2], zero, &borrow); 199| 32.2k| h_1[3] = word_sub(h_0[3], delta_p, &borrow); 200| 32.2k| h_1[4] = word_sub(h_0[4], zero, &borrow); 201| 32.2k| h_1[5] = word_sub(h_0[5], zero, &borrow); 202| 32.2k| h_1[6] = word_sub(h_0[6], zero, &borrow); 203| | 204| 32.2k| delta = borrow; 205| 32.2k| delta_p = delta << 32; 206| 32.2k| borrow = 0; 207| | 208| 32.2k| out[0] = word_sub(h_1[0], delta, &borrow); 209| 32.2k| out[1] = word_sub(h_1[1], zero, &borrow); 210| 32.2k| out[2] = word_sub(h_1[2], zero, &borrow); 211| 32.2k| out[3] = word_sub(h_1[3], delta_p, &borrow); 212| 32.2k| out[4] = h_1[4]; 213| 32.2k| out[5] = h_1[5]; 214| 32.2k| out[6] = h_1[6]; 215| 32.2k|} curve448_gf.cpp:_ZN5Botan12_GLOBAL__N_16gf_mulENSt3__14spanImLm7EEENS2_IKmLm7EEES5_: 141| 40.5k| std::span b) { 142| 40.5k| std::array ws; // NOLINT(*-member-init) 143| 40.5k| comba_mul<7>(ws.data(), a.data(), b.data()); 144| 40.5k| reduce_after_mul(out, ws); 145| 40.5k|} curve448_gf.cpp:_ZN5Botan12_GLOBAL__N_116reduce_after_mulENSt3__14spanImLm7EEENS2_IKmLm14EEE: 66| 80.8k|void reduce_after_mul(std::span out, std::span in) { 67| 80.8k| std::array r; // NOLINT(*-member-init) 68| 80.8k| std::array s; // NOLINT(*-member-init) 69| 80.8k| std::array t_0; // NOLINT(*-member-init) 70| 80.8k| std::array h_1; // NOLINT(*-member-init) 71| | 72| 80.8k| uint64_t carry = 0; 73| | 74| | // Line 4 (of the paper's algorithm 1) 75| 80.8k| r[0] = word_add(in[0], in[7], &carry); 76| | 77| | // Line 5-7 78| 80.8k| r[1] = word_add(in[1], in[1 + 7], &carry); 79| 80.8k| r[2] = word_add(in[2], in[2 + 7], &carry); 80| 80.8k| r[3] = word_add(in[3], in[3 + 7], &carry); 81| 80.8k| r[4] = word_add(in[4], in[4 + 7], &carry); 82| 80.8k| r[5] = word_add(in[5], in[5 + 7], &carry); 83| 80.8k| r[6] = word_add(in[6], in[6 + 7], &carry); 84| 80.8k| r[7] = carry; 85| 80.8k| s[0] = r[0]; 86| 80.8k| s[1] = r[1]; 87| 80.8k| s[2] = r[2]; 88| | // Line 10 89| 80.8k| carry = 0; 90| 80.8k| s[3] = word_add(r[3], in[10] & 0xFFFFFFFF00000000, &carry); 91| | // Line 11-13 92| 80.8k| s[4] = word_add(r[4], in[4 + 7], &carry); 93| 80.8k| s[5] = word_add(r[5], in[5 + 7], &carry); 94| 80.8k| s[6] = word_add(r[6], in[6 + 7], &carry); 95| 80.8k| s[7] = r[7] + carry; 96| | 97| | // Line 15-17 98| 80.8k| t_0[0] = (in[0 + 11] << 32) | (in[0 + 10] >> 32); 99| 80.8k| t_0[1] = (in[1 + 11] << 32) | (in[1 + 10] >> 32); 100| 80.8k| t_0[2] = (in[2 + 11] << 32) | (in[2 + 10] >> 32); 101| | // Line 18 102| 80.8k| t_0[3] = (in[7] << 32) | (in[13] >> 32); 103| | // Line 19-21 104| 80.8k| t_0[4] = (in[4 + 4] << 32) | (in[4 + 3] >> 32); 105| 80.8k| t_0[5] = (in[5 + 4] << 32) | (in[5 + 3] >> 32); 106| 80.8k| t_0[6] = (in[6 + 4] << 32) | (in[6 + 3] >> 32); 107| 80.8k| carry = 0; 108| | // Line 23-25 109| 80.8k| h_1[0] = word_add(s[0], t_0[0], &carry); 110| 80.8k| h_1[1] = word_add(s[1], t_0[1], &carry); 111| 80.8k| h_1[2] = word_add(s[2], t_0[2], &carry); 112| 80.8k| h_1[3] = word_add(s[3], t_0[3], &carry); 113| 80.8k| h_1[4] = word_add(s[4], t_0[4], &carry); 114| 80.8k| h_1[5] = word_add(s[5], t_0[5], &carry); 115| 80.8k| h_1[6] = word_add(s[6], t_0[6], &carry); 116| 80.8k| h_1[7] = s[7] + carry; 117| | 118| 80.8k| reduce_after_add(out, h_1); 119| 80.8k|} curve448_gf.cpp:_ZN5Botan12_GLOBAL__N_16gf_invENSt3__14spanImLm7EEENS2_IKmLm7EEE: 316| 18|void gf_inv(std::span out, std::span a) { 317| 18| std::array x222; // NOLINT(*-member-init) 318| 18| std::array x223; // NOLINT(*-member-init) 319| 18| gf_pow_2_222m1(x222, x223, a); 320| | 321| | // (x223 << 223 + x222) << 2 + 1 322| 18| std::array t; // NOLINT(*-member-init) 323| 18| gf_sqr_n(t, x223, 223); 324| 18| gf_mul(t, t, x222); 325| 18| gf_sqr_n(t, t, 2); 326| 18| gf_mul(out, t, a); 327| 18|} curve448_gf.cpp:_ZN5Botan12_GLOBAL__N_110gf_mul_a24ENSt3__14spanImLm7EEENS2_IKmLm7EEE: 124| 8.06k|void gf_mul_a24(std::span out, std::span a) { 125| 8.06k| constexpr uint64_t A24 = 39081; 126| 8.06k| std::array ws; // NOLINT(*-member-init) 127| 8.06k| uint64_t carry = 0; 128| 8.06k| ws[0] = word_madd2(a[0], A24, &carry); 129| 8.06k| ws[1] = word_madd2(a[1], A24, &carry); 130| 8.06k| ws[2] = word_madd2(a[2], A24, &carry); 131| 8.06k| ws[3] = word_madd2(a[3], A24, &carry); 132| 8.06k| ws[4] = word_madd2(a[4], A24, &carry); 133| 8.06k| ws[5] = word_madd2(a[5], A24, &carry); 134| 8.06k| ws[6] = word_madd2(a[6], A24, &carry); 135| 8.06k| ws[7] = carry; 136| 8.06k| reduce_after_add(out, ws); 137| 8.06k|} curve448_gf.cpp:_ZN5Botan12_GLOBAL__N_19gf_squareENSt3__14spanImLm7EEENS2_IKmLm7EEE: 147| 40.3k|void gf_square(std::span out, std::span a) { 148| 40.3k| std::array ws; // NOLINT(*-member-init) 149| 40.3k| comba_sqr<7>(ws.data(), a.data()); 150| 40.3k| reduce_after_mul(out, ws); 151| 40.3k|} curve448_gf.cpp:_ZN5Botan12_GLOBAL__N_114gf_pow_2_222m1ENSt3__14spanImLm7EEES3_NS2_IKmLm7EEE: 245| 18| std::span a) { 246| 18| std::array t; // NOLINT(*-member-init) 247| | 248| | // _10 = a^2 249| 18| std::array a2; // NOLINT(*-member-init) 250| 18| gf_square(a2, a); 251| | 252| | // _11 = a^3 253| 18| std::array a3; // NOLINT(*-member-init) 254| 18| gf_mul(a3, a, a2); 255| | 256| | // _111 = a^7 257| 18| std::array a7; // NOLINT(*-member-init) 258| 18| gf_square(t, a3); 259| 18| gf_mul(a7, a, t); 260| | 261| | // _111111 = a^63 262| 18| std::array a63; // NOLINT(*-member-init) 263| 18| gf_sqr_n(t, a7, 3); 264| 18| gf_mul(a63, a7, t); 265| | 266| | // x12 = a^(2^12 - 1) 267| 18| std::array x12; // NOLINT(*-member-init) 268| 18| gf_sqr_n(t, a63, 6); 269| 18| gf_mul(x12, a63, t); 270| | 271| | // x24 = a^(2^24 - 1) 272| 18| std::array x24; // NOLINT(*-member-init) 273| 18| gf_sqr_n(t, x12, 12); 274| 18| gf_mul(x24, x12, t); 275| | 276| | // i34 = x24 << 6 = a^((2^24 - 1) * 2^6) 277| 18| std::array i34; // NOLINT(*-member-init) 278| 18| gf_sqr_n(i34, x24, 6); 279| | 280| | // x30 = a^(2^30 - 1) 281| 18| std::array x30; // NOLINT(*-member-init) 282| 18| gf_mul(x30, a63, i34); 283| | 284| | // x48 = a^(2^48 - 1) 285| 18| std::array x48; // NOLINT(*-member-init) 286| 18| gf_sqr_n(t, i34, 18); 287| 18| gf_mul(x48, x24, t); 288| | 289| | // x96 = a^(2^96 - 1) 290| 18| std::array x96; // NOLINT(*-member-init) 291| 18| gf_sqr_n(t, x48, 48); 292| 18| gf_mul(x96, x48, t); 293| | 294| | // x192 = a^(2^192 - 1) 295| 18| std::array x192; // NOLINT(*-member-init) 296| 18| gf_sqr_n(t, x96, 96); 297| 18| gf_mul(x192, x96, t); 298| | 299| | // x222 = a^(2^222 - 1) 300| 18| gf_sqr_n(t, x192, 30); 301| 18| gf_mul(x222, x30, t); 302| | 303| | // x223 = a^(2^223 - 1) 304| 18| gf_square(t, x222); 305| 18| gf_mul(x223, a, t); 306| 18|} curve448_gf.cpp:_ZN5Botan12_GLOBAL__N_18gf_sqr_nENSt3__14spanImLm7EEENS2_IKmLm7EEEm: 218| 180|void gf_sqr_n(std::span out, std::span a, size_t n) { 219| 180| gf_square(out, a); 220| 7.99k| for(size_t i = 1; i < n; ++i) { ------------------ | Branch (220:22): [True: 7.81k, False: 180] ------------------ 221| 7.81k| gf_square(out, out); 222| 7.81k| } 223| 180|} _ZNK5Botan14X448_PublicKey19raw_public_key_bitsEv: 96| 18|std::vector X448_PublicKey::raw_public_key_bits() const { 97| 18| const auto& pub = m_public->key(); 98| 18| return {pub.begin(), pub.end()}; 99| 18|} _ZN5Botan14X448_PublicKeyC1ENSt3__14spanIKhLm18446744073709551615EEE: 117| 3|X448_PublicKey::X448_PublicKey(std::span pub) { 118| 3| if(pub.size() != X448_LEN) { ------------------ | Branch (118:7): [True: 1, False: 2] ------------------ 119| 1| throw Decoding_Error("Invalid size for X448 public key"); 120| 1| } 121| 2| std::array pub_arr{}; 122| 2| copy_mem(pub_arr, pub); 123| 2| m_public = std::make_shared(pub_arr); 124| 2|} _ZN5Botan15X448_PrivateKeyC1ENSt3__14spanIKhLm18446744073709551615EEE: 134| 16|X448_PrivateKey::X448_PrivateKey(std::span secret_key) { 135| 16| if(secret_key.size() != X448_LEN) { ------------------ | Branch (135:7): [True: 0, False: 16] ------------------ 136| 0| throw Decoding_Error("Invalid size for X448 private key"); 137| 0| } 138| 16| load_x448_keypair(secure_vector(secret_key.begin(), secret_key.end()), m_public, m_private); 139| 16|} _ZN5Botan15X448_PrivateKeyC1ERNS_21RandomNumberGeneratorE: 141| 16|X448_PrivateKey::X448_PrivateKey(RandomNumberGenerator& rng) : X448_PrivateKey(rng.random_vec(X448_LEN)) {} _ZNK5Botan15X448_PrivateKey24_create_key_agreement_opERNS_21RandomNumberGeneratorERKNS_31PK_Key_Agreement_Options_ReaderE: 213| 2| RandomNumberGenerator& /*rng*/, const PK_Key_Agreement_Options_Reader& options) const { 214| 2| require_software_provider(options, algo_name()); 215| | 216| 2| return std::make_unique(m_private, options); 217| 2|} _ZNK5Botan20X448_PrivateKey_Data3keyEv: 36| 2| const secure_vector& key() const { return m_key; } _ZNK5Botan19X448_PublicKey_Data3keyEv: 26| 18| const std::array& key() const { return m_key; } x448.cpp:_ZN5Botan12_GLOBAL__N_117load_x448_keypairENSt3__16vectorIhNS_16secure_allocatorIhEEEERNS1_10shared_ptrIKNS_19X448_PublicKey_DataEEERNS6_IKNS_20X448_PrivateKey_DataEEE: 67| 16| std::shared_ptr& sk_out) { 68| 16| BOTAN_ASSERT_NOMSG(secret.size() == X448_LEN); ------------------ | | 84| 16| do { \ | | 85| 16| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 16| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 16] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 16| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 16] | | ------------------ ------------------ 69| 16| std::array pub{}; 70| 16| { 71| 16| const auto scope = CT::scoped_poison(secret); 72| 16| x448_basepoint_from_data(pub, std::span(secret).first()); 73| 16| CT::unpoison(pub); 74| 16| } 75| 16| pk_out = std::make_shared(pub); 76| 16| sk_out = std::make_shared(std::move(secret)); 77| 16|} _ZN5Botan20X448_PrivateKey_DataC2ENSt3__16vectorIhNS_16secure_allocatorIhEEEE: 34| 16| explicit X448_PrivateKey_Data(secure_vector key) : m_key(std::move(key)) {} x448.cpp:_ZN5Botan12_GLOBAL__N_124x448_basepoint_from_dataENSt3__14spanIhLm56EEENS2_IKhLm56EEE: 48| 16|void x448_basepoint_from_data(std::span mypublic, std::span secret) { 49| 16| const auto bp = x448_basepoint(decode_scalar(secret)); 50| 16| const auto bp_bytes = encode_point(bp); 51| 16| copy_mem(mypublic, bp_bytes); 52| 16|} _ZN5Botan19X448_PublicKey_DataC2ENSt3__15arrayIhLm56EEE: 24| 18| explicit X448_PublicKey_Data(std::array key) : m_key(key) {} x448.cpp:_ZN5Botan12_GLOBAL__N_117X448_KA_OperationC2ENSt3__110shared_ptrIKNS_20X448_PrivateKey_DataEEERKNS_31PK_Key_Agreement_Options_ReaderE: 170| 2| PK_Ops::Key_Agreement_with_KDF(options), m_key(std::move(key)) {} x448.cpp:_ZN5Botan12_GLOBAL__N_117X448_KA_Operation9raw_agreeEPKhm: 174| 2| secure_vector raw_agree(const uint8_t w_data[], size_t w_len) override { 175| 2| const auto& sk = m_key->key(); 176| 2| BOTAN_ASSERT_NOMSG(sk.size() == X448_LEN); ------------------ | | 84| 2| do { \ | | 85| 2| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 2| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 2] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 2| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 2] | | ------------------ ------------------ 177| 2| const auto scope = CT::scoped_poison(sk); 178| | 179| 2| const std::span w(w_data, w_len); 180| 2| if(w.size() != X448_LEN) { ------------------ | Branch (180:13): [True: 0, False: 2] ------------------ 181| 0| throw Decoding_Error("Invalid size for X448 public key"); 182| 0| } 183| 2| const auto k = decode_scalar(sk); 184| 2| const auto u = decode_point(w); 185| | 186| 2| auto shared_secret = encode_point(x448(k, u)); 187| 2| CT::unpoison(shared_secret); 188| | 189| | // RFC 7748 Section 6.2 190| | // As with X25519, both sides MAY check, without leaking extra 191| | // information about the value of K, whether the resulting shared K 192| | // is the all-zero value and abort if so. 193| | // 194| | // TODO: once the generic Key Agreement operation creation is equipped 195| | // with a more flexible parameterization, this check could be 196| | // made optional. 197| | // For instance: `sk->agree().with_optional_sanity_checks(true)`. 198| | // See also: https://github.com/randombit/botan/pull/4318 199| 2| if(CT::all_zeros(shared_secret.data(), shared_secret.size()).as_bool()) { ------------------ | Branch (199:13): [True: 1, False: 1] ------------------ 200| 1| throw Invalid_Argument("X448 public point appears to be of low order"); 201| 1| } 202| | 203| 1| return shared_secret; 204| 2| } _ZN5Botan12encode_pointERKNS_6StrongINSt3__15arrayIhLm56EEENS_9Point448_EJEEE: 21| 18|secure_vector encode_point(const Point448& p) { 22| 18| return {p.begin(), p.end()}; 23| 18|} _ZN5Botan12decode_pointENSt3__14spanIKhLm18446744073709551615EEE: 25| 2|Point448 decode_point(std::span p_bytes) { 26| 2| BOTAN_ARG_CHECK(p_bytes.size() == X448_LEN, "Invalid size for X448 point"); ------------------ | | 35| 2| do { \ | | 36| 2| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2] | | ------------------ ------------------ 27| 2| return typecast_copy(p_bytes); 28| 2|} _ZN5Botan13decode_scalarENSt3__14spanIKhLm18446744073709551615EEE: 30| 18|ScalarX448 decode_scalar(std::span scalar_bytes) { 31| 18| BOTAN_ARG_CHECK(scalar_bytes.size() == X448_LEN, "Invalid size for X448 scalar"); ------------------ | | 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] | | ------------------ ------------------ 32| 18| auto buf = typecast_copy(scalar_bytes); 33| | 34| 18| buf[0] &= 0xfc; 35| 18| buf[55] |= 0x80; 36| | 37| 18| return buf; 38| 18|} _ZN5Botan14x448_basepointERKNS_6StrongINSt3__15arrayIhLm56EEENS_11ScalarX448_EJEEE: 41| 16|Point448 x448_basepoint(const ScalarX448& k) { 42| 16| const Point448 u({5}); 43| 16| return x448(k, u); 44| 16|} _ZN5Botan4x448ERKNS_6StrongINSt3__15arrayIhLm56EEENS_11ScalarX448_EJEEERKNS0_IS3_NS_9Point448_EJEEE: 48| 18|Point448 x448(const ScalarX448& k, const Point448& u) { 49| 18| const Gf448Elem x_1 = Gf448Elem(u.get()); 50| 18| Gf448Elem x_2 = Gf448Elem::one(); 51| 18| Gf448Elem z_2 = Gf448Elem::zero(); 52| 18| Gf448Elem x_3 = Gf448Elem(u.get()); 53| 18| Gf448Elem z_3 = Gf448Elem::one(); 54| 18| auto swap = CT::Mask::cleared(); 55| | 56| 8.08k| for(int16_t t = 448 - 1; t >= 0; --t) { ------------------ | Branch (56:29): [True: 8.06k, False: 18] ------------------ 57| 8.06k| const auto k_t = CT::Mask::expand(get_bit(k, t)); 58| 8.06k| swap ^= k_t; 59| | 60| 8.06k| x_2.ct_cond_swap(swap, x_3); 61| 8.06k| z_2.ct_cond_swap(swap, z_3); 62| 8.06k| swap = k_t; 63| | 64| 8.06k| const auto A = x_2 + z_2; 65| 8.06k| const auto AA = square(A); 66| 8.06k| const auto B = x_2 - z_2; 67| 8.06k| const auto BB = square(B); 68| 8.06k| const auto E = AA - BB; 69| 8.06k| const auto C = x_3 + z_3; 70| 8.06k| const auto D = x_3 - z_3; 71| 8.06k| const auto DA = D * A; 72| 8.06k| const auto CB = C * B; 73| 8.06k| x_3 = square(DA + CB); 74| 8.06k| z_3 = x_1 * square(DA - CB); 75| 8.06k| x_2 = AA * BB; 76| 8.06k| z_2 = E * (AA + mul_a24(E)); 77| 8.06k| } 78| | 79| 18| x_2.ct_cond_swap(swap, x_3); 80| 18| z_2.ct_cond_swap(swap, z_3); 81| | 82| 18| const auto res = x_2 / z_2; 83| | 84| 18| return Point448(res.to_bytes()); 85| 18|} x448_internal.cpp:_ZN5Botan12_GLOBAL__N_17get_bitERKNS_6StrongINSt3__15arrayIhLm56EEENS_11ScalarX448_EJEEEm: 16| 8.06k|uint64_t get_bit(const ScalarX448& scalar, size_t bit) { 17| 8.06k| return (scalar[bit / 8] >> (bit % 8)) & 1; 18| 8.06k|} _ZN5Botan14EC_AffinePointC2ENSt3__110unique_ptrINS_19EC_AffinePoint_DataENS1_14default_deleteIS3_EEEE: 16| 17.7k|EC_AffinePoint::EC_AffinePoint(std::unique_ptr point) : m_point(std::move(point)) { 17| 17.7k| BOTAN_ASSERT_NONNULL(m_point); ------------------ | | 123| 17.7k| do { \ | | 124| 17.7k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (124:10): [True: 0, False: 17.7k] | | ------------------ | | 125| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 126| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 127| 0| } \ | | 128| 17.7k| } while(0) | | ------------------ | | | Branch (128:12): [Folded, False: 17.7k] | | ------------------ ------------------ 18| 17.7k|} _ZN5Botan14EC_AffinePointC2ERKS0_: 20| 2.82k|EC_AffinePoint::EC_AffinePoint(const EC_AffinePoint& other) : m_point(other.inner().clone()) {} _ZN5Botan14EC_AffinePointC2EOS0_: 22| 41.8k|EC_AffinePoint::EC_AffinePoint(EC_AffinePoint&& other) noexcept : m_point(std::move(other.m_point)) {} _ZNK5Botan14EC_AffinePoint15to_legacy_pointEv: 46| 16.3k|EC_Point EC_AffinePoint::to_legacy_point() const { 47| 16.3k| return m_point->to_legacy_point(); 48| 16.3k|} _ZNK5Botan14EC_AffinePointeqERKS0_: 55| 6.26k|bool EC_AffinePoint::operator==(const EC_AffinePoint& other) const { 56| 6.26k| if(this == &other) { ------------------ | Branch (56:7): [True: 0, False: 6.26k] ------------------ 57| 0| return true; 58| 0| } 59| | 60| | // We are relying on EC_Group to ensure there is just a single shared_ptr 61| | // for any set of group params 62| 6.26k| if(this->_group() != other._group()) { ------------------ | Branch (62:7): [True: 0, False: 6.26k] ------------------ 63| 0| return false; 64| 0| } 65| | 66| 6.26k| const auto a_is_id = this->is_identity(); 67| 6.26k| const auto b_is_id = other.is_identity(); 68| | 69| 6.26k| if(a_is_id || b_is_id) { ------------------ | Branch (69:7): [True: 0, False: 6.26k] | Branch (69:18): [True: 0, False: 6.26k] ------------------ 70| 0| return (a_is_id == b_is_id); 71| 0| } 72| | 73| 6.26k| auto a_xy = this->serialize_uncompressed(); 74| 6.26k| auto b_xy = other.serialize_uncompressed(); 75| 6.26k| BOTAN_ASSERT_NOMSG(a_xy.size() == b_xy.size()); ------------------ | | 84| 6.26k| do { \ | | 85| 6.26k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 86| 6.26k| if(!(expr)) { \ | | ------------------ | | | Branch (86:10): [True: 0, False: 6.26k] | | ------------------ | | 87| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 88| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 89| 0| } \ | | 90| 6.26k| } while(0) | | ------------------ | | | Branch (90:12): [Folded, False: 6.26k] | | ------------------ ------------------ 76| | 77| 6.26k| return CT::is_equal(a_xy.data(), b_xy.data(), a_xy.size()).as_bool(); 78| 6.26k|} _ZNK5Botan14EC_AffinePoint19field_element_bytesEv: 114| 16.3k|size_t EC_AffinePoint::field_element_bytes() const { 115| 16.3k| return inner().field_element_bytes(); 116| 16.3k|} _ZNK5Botan14EC_AffinePoint11is_identityEv: 118| 46.6k|bool EC_AffinePoint::is_identity() const { 119| 46.6k| return inner().is_identity(); 120| 46.6k|} _ZN5Botan14EC_AffinePointD2Ev: 152| 62.4k|EC_AffinePoint::~EC_AffinePoint() = default; _ZN5Botan14EC_AffinePoint11deserializeERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 154| 1.41k|std::optional EC_AffinePoint::deserialize(const EC_Group& group, std::span bytes) { 155| 1.41k| if(bytes.empty()) { ------------------ | Branch (155:7): [True: 0, False: 1.41k] ------------------ 156| 0| return {}; 157| 0| } 158| | 159| 1.41k| switch(bytes[0]) { 160| 0| case 0x00: ------------------ | Branch (160:7): [True: 0, False: 1.41k] ------------------ 161| | // The identity element (see SEC1 section 2.3.4) 162| | // TODO(Botan4) remove this - we should reject the identity encoding 163| 0| if(bytes.size() == 1) { ------------------ | Branch (163:13): [True: 0, False: 0] ------------------ 164| 0| return EC_AffinePoint::identity(group); 165| 0| } else { 166| 0| return {}; 167| 0| } 168| 0| case 0x02: ------------------ | Branch (168:7): [True: 0, False: 1.41k] ------------------ 169| 0| case 0x03: ------------------ | Branch (169:7): [True: 0, False: 1.41k] ------------------ 170| 0| return EC_AffinePoint::deserialize_compressed(group, bytes); 171| 1.41k| case 0x04: ------------------ | Branch (171:7): [True: 1.41k, False: 0] ------------------ 172| 1.41k| return EC_AffinePoint::deserialize_uncompressed(group, bytes); 173| 0| case 0x06: ------------------ | Branch (173:7): [True: 0, False: 1.41k] ------------------ 174| 0| case 0x07: { ------------------ | Branch (174:7): [True: 0, False: 1.41k] ------------------ 175| | // The deprecated "hybrid" point format 176| | // TODO(Botan4) remove this 177| 0| const bool hdr_y_is_even = bytes[0] == 0x06; 178| 0| const bool y_is_even = (bytes.back() & 0x01) == 0; 179| 0| const size_t expected_len = 1 + 2 * group.get_p_bytes(); 180| | 181| 0| if(hdr_y_is_even == y_is_even && bytes.size() == expected_len) { ------------------ | Branch (181:13): [True: 0, False: 0] | Branch (181:43): [True: 0, False: 0] ------------------ 182| 0| std::vector sec1(bytes.begin(), bytes.end()); 183| 0| sec1[0] = 0x04; 184| 0| return EC_AffinePoint::deserialize_uncompressed(group, sec1); 185| 0| } else { 186| 0| return {}; 187| 0| } 188| 0| } 189| 0| default: ------------------ | Branch (189:7): [True: 0, False: 1.41k] ------------------ 190| 0| return {}; 191| 1.41k| } 192| 1.41k|} _ZN5Botan14EC_AffinePoint22deserialize_compressedERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 195| 1.88k| std::span bytes) { 196| 1.88k| if(auto pt = group._data()->point_deserialize_compressed(bytes)) { ------------------ | Branch (196:12): [True: 1.41k, False: 475] ------------------ 197| 1.41k| return EC_AffinePoint(std::move(pt)); 198| 1.41k| } else { 199| 475| return {}; 200| 475| } 201| 1.88k|} _ZN5Botan14EC_AffinePoint24deserialize_uncompressedERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 204| 9.57k| std::span bytes) { 205| 9.57k| if(auto pt = group._data()->point_deserialize_uncompressed(bytes)) { ------------------ | Branch (205:12): [True: 7.68k, False: 1.88k] ------------------ 206| 7.68k| return EC_AffinePoint(std::move(pt)); 207| 7.68k| } else { 208| 1.88k| return {}; 209| 1.88k| } 210| 9.57k|} _ZN5Botan14EC_AffinePoint5g_mulERKNS_9EC_ScalarERNS_21RandomNumberGeneratorE: 212| 8.69k|EC_AffinePoint EC_AffinePoint::g_mul(const EC_Scalar& scalar, RandomNumberGenerator& rng) { 213| 8.69k| auto pt = scalar._inner().group()->point_g_mul(scalar.inner(), rng); 214| 8.69k| return EC_AffinePoint(std::move(pt)); 215| 8.69k|} _ZNK5Botan14EC_AffinePoint10mul_x_onlyERKNS_9EC_ScalarERNS_21RandomNumberGeneratorE: 221| 1.41k|secure_vector EC_AffinePoint::mul_x_only(const EC_Scalar& scalar, RandomNumberGenerator& rng) const { 222| 1.41k| return inner().mul_x_only(scalar._inner(), rng); 223| 1.41k|} _ZNK5Botan14EC_AffinePoint9serializeENS_15EC_Point_FormatE: 248| 3.83k|std::vector EC_AffinePoint::serialize(EC_Point_Format format) const { 249| 3.83k| if(format == EC_Point_Format::Compressed) { ------------------ | Branch (249:7): [True: 27, False: 3.81k] ------------------ 250| 27| return this->serialize_compressed(); 251| 3.81k| } else if(format == EC_Point_Format::Uncompressed) { ------------------ | Branch (251:14): [True: 3.81k, False: 0] ------------------ 252| 3.81k| return this->serialize_uncompressed(); 253| 3.81k| } else { 254| | // The deprecated "hybrid" point encoding 255| | // TODO(Botan4) Remove this 256| 0| auto enc = this->serialize_uncompressed(); 257| 0| const bool y_is_odd = (enc[enc.size() - 1] & 0x01) == 0x01; 258| 0| enc.front() = y_is_odd ? 0x07 : 0x06; ------------------ | Branch (258:21): [True: 0, False: 0] ------------------ 259| 0| return enc; 260| 0| } 261| 3.83k|} _ZNK5Botan14EC_AffinePoint23serialize_compressed_toENSt3__14spanIhLm18446744073709551615EEE: 278| 27|void EC_AffinePoint::serialize_compressed_to(std::span bytes) const { 279| 27| BOTAN_STATE_CHECK(!this->is_identity()); ------------------ | | 51| 27| do { \ | | 52| 27| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 27| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 27] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 27| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 27] | | ------------------ ------------------ 280| 27| m_point->serialize_compressed_to(bytes); 281| 27|} _ZNK5Botan14EC_AffinePoint25serialize_uncompressed_toENSt3__14spanIhLm18446744073709551615EEE: 283| 16.3k|void EC_AffinePoint::serialize_uncompressed_to(std::span bytes) const { 284| 16.3k| BOTAN_STATE_CHECK(!this->is_identity()); ------------------ | | 51| 16.3k| do { \ | | 52| 16.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 16.3k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 16.3k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 16.3k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 16.3k] | | ------------------ ------------------ 285| 16.3k| m_point->serialize_uncompressed_to(bytes); 286| 16.3k|} _ZNK5Botan14EC_AffinePoint6_groupEv: 292| 28.9k|const std::shared_ptr& EC_AffinePoint::_group() const { 293| 28.9k| return inner().group(); 294| 28.9k|} _ZN5Botan8EC_Group13ec_group_dataEv: 240| 10.5k|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| 10.5k| static const Allocator_Initializer g_init_allocator; 247| 10.5k| static EC_Group_Data_Map g_ec_data; 248| 10.5k| return g_ec_data; 249| 10.5k|} _ZN5Botan8EC_Group18load_EC_group_infoEPKcS2_S2_S2_S2_S2_RKNS_3OIDE: 263| 6| const OID& oid) { 264| 6| BOTAN_ARG_CHECK(oid.has_value(), "EC_Group::load_EC_group_info OID must be set"); ------------------ | | 35| 6| do { \ | | 36| 6| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 6| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 6] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 6| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 6] | | ------------------ ------------------ 265| | 266| 6| const BigInt p(p_str); 267| 6| const BigInt a(a_str); 268| 6| const BigInt b(b_str); 269| 6| const BigInt g_x(g_x_str); 270| 6| const BigInt g_y(g_y_str); 271| 6| const BigInt order(order_str); 272| 6| const BigInt cofactor(1); // implicit 273| | 274| 6| return EC_Group_Data::create(p, a, b, g_x, g_y, order, cofactor, oid, EC_Group_Source::Builtin); 275| 6|} _ZN5Botan8EC_Group19DER_decode_EC_groupENSt3__14spanIKhLm18446744073709551615EEENS_15EC_Group_SourceE: 279| 6.26k| EC_Group_Source source) { 280| 6.26k| BER_Decoder dec(der, BER_Decoder::Limits::DER()); 281| | 282| 6.26k| const auto next_obj_type = dec.peek_next_object().type_tag(); 283| | 284| 6.26k| if(next_obj_type == ASN1_Type::ObjectId) { ------------------ | Branch (284:7): [True: 6.26k, False: 0] ------------------ 285| 6.26k| OID oid; 286| 6.26k| dec.decode(oid).verify_end(); 287| | 288| 6.26k| const auto data = ec_group_data().lookup(oid); 289| 6.26k| if(!data) { ------------------ | Branch (289:10): [True: 0, False: 6.26k] ------------------ 290| 0| throw Decoding_Error(fmt("Unknown namedCurve OID '{}'", oid.to_string())); 291| 0| } 292| | 293| 6.26k| return std::make_pair(data, false); 294| 6.26k| } else if(next_obj_type == ASN1_Type::Sequence) { ------------------ | Branch (294:14): [True: 0, False: 0] ------------------ 295| 0| BigInt p; 296| 0| BigInt a; 297| 0| BigInt b; 298| 0| BigInt order; 299| 0| BigInt cofactor; 300| 0| std::vector base_pt; 301| 0| std::vector seed; 302| | 303| 0| dec.start_sequence() 304| 0| .decode_and_check(1, "Unknown ECC param version code") 305| 0| .start_sequence() 306| 0| .decode_and_check(OID({1, 2, 840, 10045, 1, 1}), "Only prime ECC fields supported") 307| 0| .decode(p) 308| 0| .end_cons() 309| 0| .start_sequence() 310| 0| .decode_octet_string_bigint(a) 311| 0| .decode_octet_string_bigint(b) 312| 0| .decode_optional_string(seed, ASN1_Type::BitString, ASN1_Type::BitString, ASN1_Class::Universal) 313| 0| .end_cons() 314| 0| .decode(base_pt, ASN1_Type::OctetString) 315| 0| .decode(order) 316| 0| .decode(cofactor) 317| 0| .end_cons() 318| 0| .verify_end(); 319| | 320| | // TODO(Botan4) Require cofactor == 1 321| 0| if(cofactor <= 0 || cofactor >= 16) { ------------------ | Branch (321:10): [True: 0, False: 0] | Branch (321:27): [True: 0, False: 0] ------------------ 322| 0| throw Decoding_Error("Invalid ECC cofactor parameter"); 323| 0| } 324| | 325| 0| if(p.bits() < 112 || p.bits() > 521 || p.signum() < 0) { ------------------ | Branch (325:10): [True: 0, 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| 0| if(a.signum() < 0 || a >= p) { ------------------ | Branch (330:10): [True: 0, 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| 0| if(b.signum() <= 0 || b >= p) { ------------------ | Branch (338:10): [True: 0, False: 0] | Branch (338:29): [True: 0, False: 0] ------------------ 339| 0| throw Decoding_Error("Invalid ECC b parameter"); 340| 0| } 341| | 342| 0| if(order.signum() <= 0 || order >= 2 * p) { ------------------ | Branch (342:10): [True: 0, False: 0] | Branch (342:10): [True: 0, False: 0] | Branch (342:33): [True: 0, False: 0] ------------------ 343| 0| throw Decoding_Error("Invalid ECC group order"); 344| 0| } 345| | 346| 0| if(p == order) { ------------------ | Branch (346:10): [True: 0, False: 0] ------------------ 347| 0| throw Decoding_Error("Anomalous elliptic curves are not supported"); 348| 0| } 349| | 350| 0| if(const auto data = ec_group_data().lookup_from_params(p, a, b, base_pt, order, cofactor)) { ------------------ | Branch (350:21): [True: 0, False: 0] ------------------ 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| 0| const auto mod_p = Barrett_Reduction::for_public_modulus(p); 361| 0| if(!is_bailie_psw_probable_prime_vartime(p)) { ------------------ | Branch (361:10): [True: 0, False: 0] ------------------ 362| 0| throw Decoding_Error("ECC p parameter is not a prime"); 363| 0| } 364| | 365| 0| if(!is_bailie_psw_probable_prime_vartime(order)) { ------------------ | Branch (365:10): [True: 0, False: 0] ------------------ 366| 0| throw Decoding_Error("Invalid ECC order parameter"); 367| 0| } 368| | 369| 0| if((p - cofactor * order).abs().bits() > (p.bits() / 2) + 1) { ------------------ | Branch (369:10): [True: 0, False: 0] ------------------ 370| 0| throw Decoding_Error("Invalid ECC Hasse bound"); 371| 0| } 372| | 373| 0| const auto discriminant = mod_p.reduce(mod_p.multiply(BigInt::from_s32(4), mod_p.cube(a)) + 374| 0| mod_p.multiply(BigInt::from_s32(27), mod_p.square(b))); 375| 0| if(discriminant == 0) { ------------------ | Branch (375:10): [True: 0, False: 0] ------------------ 376| 0| throw Decoding_Error("Invalid ECC curve discriminant"); 377| 0| } 378| | 379| 0| const size_t p_bytes = p.bytes(); 380| 0| if(base_pt.size() != 1 + p_bytes && base_pt.size() != 1 + 2 * p_bytes) { ------------------ | Branch (380:10): [True: 0, False: 0] | Branch (380:43): [True: 0, False: 0] ------------------ 381| 0| throw Decoding_Error("Invalid ECC base point encoding"); 382| 0| } 383| | 384| 0| auto [g_x, g_y] = [&]() { 385| 0| const uint8_t hdr = base_pt[0]; 386| | 387| 0| if(hdr == 0x04 && base_pt.size() == 1 + 2 * p_bytes) { 388| 0| const BigInt x = BigInt::from_bytes(std::span{base_pt}.subspan(1, p_bytes)); 389| 0| const BigInt y = BigInt::from_bytes(std::span{base_pt}.subspan(1 + p_bytes, p_bytes)); 390| | 391| 0| if(x < p && y < p) { 392| 0| return std::make_pair(x, y); 393| 0| } 394| 0| } 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| 0| const BigInt x = BigInt::from_bytes(std::span{base_pt}.subspan(1, p_bytes)); 397| 0| BigInt y = sqrt_modulo_prime(((x * x + a) * x + b) % p, p); 398| | 399| 0| if(x < p && y >= 0) { 400| 0| const bool y_mod_2 = (hdr & 0x01) == 1; 401| 0| if(y.get_bit(0) != y_mod_2) { 402| 0| y = p - y; 403| 0| } 404| | 405| 0| return std::make_pair(x, y); 406| 0| } 407| 0| } 408| | 409| 0| throw Decoding_Error("Invalid ECC base point encoding"); 410| 0| }(); 411| | 412| | // TODO(Botan4) we can remove this check since we'll only accept pre-registered groups 413| 0| const auto y2 = mod_p.square(g_y); 414| 0| const auto x3_ax_b = mod_p.reduce(mod_p.cube(g_x) + mod_p.multiply(a, g_x) + b); 415| 0| if(y2 != x3_ax_b) { ------------------ | Branch (415:10): [True: 0, False: 0] ------------------ 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| 0| const auto data = EC_Group_Data::create(p, a, b, g_x, g_y, order, cofactor, OID(), source); 426| | 427| 0| if(!EC_Group::verify_generator_order(data)) { ------------------ | Branch (427:10): [True: 0, False: 0] ------------------ 428| 0| throw Decoding_Error("ECC generator does not have the claimed order"); 429| 0| } 430| | 431| 0| return std::make_pair(data, true); 432| 0| } else if(next_obj_type == ASN1_Type::Null) { ------------------ | Branch (432:14): [True: 0, False: 0] ------------------ 433| 0| throw Decoding_Error("Decoding ImplicitCA ECC parameters is not supported"); 434| 0| } else { 435| 0| throw Decoding_Error( 436| 0| fmt("Unexpected tag {} while decoding ECC domain params", asn1_tag_to_string(next_obj_type))); 437| 0| } 438| 6.26k|} _ZN5Botan8EC_GroupD2Ev: 442| 70.8k|EC_Group::~EC_Group() = default; _ZN5Botan8EC_GroupC2ERKS0_: 444| 26.4k|EC_Group::EC_Group(const EC_Group&) = default; _ZN5Botan8EC_GroupC2ENSt3__110shared_ptrIKNS_13EC_Group_DataEEE: 449| 13.0k|EC_Group::EC_Group(std::shared_ptr data) : m_data(std::move(data)) {} _ZN5Botan8EC_Group9from_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 529| 4.31k|EC_Group EC_Group::from_name(std::string_view name) { 530| 4.31k| std::shared_ptr data; 531| | 532| 4.31k| if(auto oid = OID::from_name(name)) { ------------------ | Branch (532:12): [True: 4.31k, False: 0] ------------------ 533| 4.31k| data = ec_group_data().lookup(oid.value()); 534| 4.31k| } 535| | 536| 4.31k| if(!data) { ------------------ | Branch (536:7): [True: 0, False: 4.31k] ------------------ 537| 0| throw Invalid_Argument(fmt("Unknown EC_Group '{}'", name)); 538| 0| } 539| | 540| 4.31k| return EC_Group(std::move(data)); 541| 4.31k|} _ZN5Botan8EC_GroupC2ENSt3__14spanIKhLm18446744073709551615EEE: 703| 6.26k|EC_Group::EC_Group(std::span der) { 704| 6.26k| const auto data = DER_decode_EC_group(der, EC_Group_Source::ExternalSource); 705| 6.26k| m_data = data.first; 706| 6.26k| m_explicit_encoding = data.second; 707| 6.26k|} _ZNK5Botan8EC_Group4dataEv: 714| 20.6k|const EC_Group_Data& EC_Group::data() const { 715| 20.6k| if(m_data == nullptr) { ------------------ | Branch (715:7): [True: 0, False: 20.6k] ------------------ 716| 0| throw Invalid_State("EC_Group uninitialized"); 717| 0| } 718| 20.6k| return *m_data; 719| 20.6k|} _ZNK5Botan8EC_Group10get_p_bitsEv: 721| 1.41k|size_t EC_Group::get_p_bits() const { 722| 1.41k| return data().p_bits(); 723| 1.41k|} _ZNK5Botan8EC_Group15get_order_bytesEv: 733| 6.26k|size_t EC_Group::get_order_bytes() const { 734| 6.26k| return data().order_bytes(); 735| 6.26k|} _ZNK5Botan8EC_Group12has_cofactorEv: 801| 2.82k|bool EC_Group::has_cofactor() const { 802| 2.82k| return data().has_cofactor(); 803| 2.82k|} _ZNK5Botan8EC_Group13get_curve_oidEv: 805| 10.1k|const OID& EC_Group::get_curve_oid() const { 806| 10.1k| return data().oid(); 807| 10.1k|} _ZN5Botan17EC_Group_Data_Map6lookupERKNS_3OIDE: 54| 10.5k| std::shared_ptr lookup(const OID& oid) { 55| 10.5k| const lock_guard_type lock(m_mutex); 56| | 57| 20.8k| for(auto i : m_registered_curves) { ------------------ | Branch (57:21): [True: 20.8k, False: 6] ------------------ 58| 20.8k| if(i->oid() == oid) { ------------------ | Branch (58:16): [True: 10.5k, False: 10.2k] ------------------ 59| 10.5k| return i; 60| 10.5k| } 61| 20.8k| } 62| | 63| | // Not found, check hardcoded data 64| 6| std::shared_ptr data = EC_Group::EC_group_info(oid); 65| | 66| 6| if(data) { ------------------ | Branch (66:13): [True: 6, False: 0] ------------------ 67| | // The requested OID may be an alias for a curve whose canonical OID differs 68| | // TODO(Botan4) remove this once we require exactly one canonical OID per curve 69| 6| if(data->oid() != oid) { ------------------ | Branch (69:16): [True: 0, False: 6] ------------------ 70| 0| for(const auto& i : m_registered_curves) { ------------------ | Branch (70:34): [True: 0, False: 0] ------------------ 71| 0| if(i->oid() == data->oid()) { ------------------ | Branch (71:22): [True: 0, False: 0] ------------------ 72| 0| return i; 73| 0| } 74| 0| } 75| 0| } 76| | 77| 6| m_registered_curves.push_back(data); 78| 6| return data; 79| 6| } 80| | 81| | // Nope, unknown curve 82| 0| return std::shared_ptr(); 83| 6| } _ZN5Botan13EC_Group_DataD2Ev: 28| 6|EC_Group_Data::~EC_Group_Data() = default; _ZN5Botan13EC_Group_DataC2ERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceE: 40| 6| m_p(p), 41| 6| m_a(a), 42| 6| m_b(b), 43| 6| m_g_x(g_x), 44| 6| m_g_y(g_y), 45| 6| m_order(order), 46| 6| m_cofactor(cofactor), 47| |#if defined(BOTAN_HAS_LEGACY_EC_POINT) 48| 6| m_mod_field(Barrett_Reduction::for_public_modulus(p)), 49| 6| m_mod_order(Barrett_Reduction::for_public_modulus(order)), 50| 6| m_monty(m_p, m_mod_field), 51| |#endif 52| 6| m_oid(oid), 53| 6| m_p_words(p.sig_words()), 54| 6| m_p_bits(p.bits()), 55| 6| m_order_bits(order.bits()), 56| 6| m_order_bytes((m_order_bits + 7) / 8), 57| 6| m_a_is_minus_3(a == p - 3), 58| 6| m_a_is_zero(a.is_zero()), 59| 6| m_has_cofactor(m_cofactor != 1), 60| 6| m_order_is_less_than_p(m_order < p), 61| 6| m_source(source) { 62| | // Verify the generator (x, y) satisfies y^2 = x^3 + a*x + b (mod p) 63| 6| const auto mod_p = Barrett_Reduction::for_public_modulus(p); 64| 6| const BigInt y2 = mod_p.square(g_y); 65| 6| const BigInt x3_ax_b = mod_p.reduce(mod_p.cube(g_x) + mod_p.multiply(a, g_x) + b); 66| 6| if(y2 != x3_ax_b) { ------------------ | Branch (66:7): [True: 0, False: 6] ------------------ 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| 6| if(!m_oid.empty()) { ------------------ | Branch (71:7): [True: 6, False: 0] ------------------ 72| 6| DER_Encoder der(m_der_named_curve); 73| 6| der.encode(m_oid); 74| | 75| 6| if(const auto name = m_oid.registered_name()) { ------------------ | Branch (75:21): [True: 6, False: 0] ------------------ 76| 6| if(auto pcurve = PCurve::PrimeOrderCurve::for_named_curve(*name)) { ------------------ | Branch (76:18): [True: 6, False: 0] ------------------ 77| 6| const bool same_params = [&]() { 78| 6| if(m_source == EC_Group_Source::Builtin) { 79| 6| return true; 80| 6| } 81| | 82| 6| if(const auto group_oid = OID::from_name(*name)) { 83| 6| if(const auto group_info = EC_Group::EC_group_info(*group_oid)) { 84| 6| return group_info->params_match(p, a, b, g_x, g_y, order, cofactor); 85| 6| } 86| 6| } 87| | 88| 6| return false; 89| 6| }(); 90| | 91| 6| if(same_params) { ------------------ | Branch (91:16): [True: 6, False: 0] ------------------ 92| 6| m_pcurve = std::move(pcurve); 93| 6| } 94| 6| } 95| 6| } 96| 6| if(m_pcurve) { ------------------ | Branch (96:10): [True: 6, False: 0] ------------------ 97| 6| m_engine = EC_Group_Engine::Optimized; 98| 6| } 99| 6| } 100| | 101| | // Try a generic pcurves instance 102| 6| if(!m_pcurve && !m_has_cofactor) { ------------------ | Branch (102:7): [True: 0, False: 6] | Branch (102:20): [True: 0, False: 0] ------------------ 103| 0| m_pcurve = PCurve::PrimeOrderCurve::from_params(p, a, b, g_x, g_y, order); 104| 0| if(m_pcurve) { ------------------ | Branch (104:10): [True: 0, False: 0] ------------------ 105| 0| m_engine = EC_Group_Engine::Generic; 106| 0| } 107| | // possibly still null here, if parameters unsuitable or if the 108| | // pcurves_generic module wasn't included in the build 109| 0| } 110| | 111| 6|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 112| 6| secure_vector ws; 113| 6| m_a_r = m_monty.mul(a, m_monty.R2(), ws); 114| 6| m_b_r = m_monty.mul(b, m_monty.R2(), ws); 115| 6| if(!m_pcurve) { ------------------ | Branch (115:7): [True: 0, False: 6] ------------------ 116| 0| m_engine = EC_Group_Engine::Legacy; 117| 0| } 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| 6|} _ZN5Botan13EC_Group_Data6createERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceE: 138| 6| EC_Group_Source source) { 139| 6| auto group = std::make_shared(p, a, b, g_x, g_y, order, cofactor, oid, source); 140| | 141| 6|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 142| 6| group->m_curve = CurveGFp(group.get()); 143| 6| group->m_base_point = EC_Point(group->m_curve, g_x, g_y); 144| 6| if(!group->m_pcurve) { ------------------ | Branch (144:7): [True: 0, False: 6] ------------------ 145| 0| group->m_base_mult = std::make_unique(group->m_base_point, group->m_mod_order); 146| 0| } 147| 6|#endif 148| | 149| 6| return group; 150| 6|} _ZNK5Botan13EC_Group_Data13scalar_randomERNS_21RandomNumberGeneratorE: 310| 2.42k|std::unique_ptr EC_Group_Data::scalar_random(RandomNumberGenerator& rng) const { 311| 2.42k| if(m_pcurve) { ------------------ | Branch (311:7): [True: 2.42k, False: 0] ------------------ 312| 2.42k| return std::make_unique(shared_from_this(), m_pcurve->random_scalar(rng)); 313| 2.42k| } else { 314| 0|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 315| 0| return std::make_unique(shared_from_this(), 316| 0| BigInt::random_integer(rng, BigInt::one(), m_order)); 317| |#else 318| | throw Not_Implemented("Legacy EC interfaces disabled in this build configuration"); 319| |#endif 320| 0| } 321| 2.42k|} _ZNK5Botan13EC_Group_Data18scalar_deserializeENSt3__14spanIKhLm18446744073709551615EEE: 375| 6.26k|std::unique_ptr EC_Group_Data::scalar_deserialize(std::span bytes) const { 376| 6.26k| if(bytes.size() != m_order_bytes) { ------------------ | Branch (376:7): [True: 0, False: 6.26k] ------------------ 377| 0| return nullptr; 378| 0| } 379| | 380| 6.26k| if(m_pcurve) { ------------------ | Branch (380:7): [True: 6.26k, False: 0] ------------------ 381| 6.26k| if(auto s = m_pcurve->deserialize_scalar(bytes)) { ------------------ | Branch (381:15): [True: 6.26k, False: 0] ------------------ 382| 6.26k| return std::make_unique(shared_from_this(), *s); 383| 6.26k| } else { 384| 0| return nullptr; 385| 0| } 386| 6.26k| } 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| 6.26k|} _ZNK5Botan13EC_Group_Data30point_deserialize_uncompressedENSt3__14spanIKhLm18446744073709551615EEE: 402| 9.57k| std::span bytes) const { 403| 9.57k| if(bytes.size() != 1 + 2 * p_bytes() || bytes[0] != 0x04) { ------------------ | Branch (403:7): [True: 1.60k, False: 7.96k] | Branch (403:44): [True: 1, False: 7.96k] ------------------ 404| 1.60k| return {}; 405| 1.60k| } 406| | 407| 7.96k| if(m_pcurve) { ------------------ | Branch (407:7): [True: 7.96k, False: 0] ------------------ 408| 7.96k| if(auto pt = m_pcurve->deserialize_point_uncompressed(bytes)) { ------------------ | Branch (408:15): [True: 7.68k, False: 281] ------------------ 409| 7.68k| return std::make_unique(shared_from_this(), std::move(*pt)); 410| 7.68k| } else { 411| 281| return {}; 412| 281| } 413| 7.96k| } 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| 7.96k|} _ZNK5Botan13EC_Group_Data28point_deserialize_compressedENSt3__14spanIKhLm18446744073709551615EEE: 427| 1.88k|std::unique_ptr EC_Group_Data::point_deserialize_compressed(std::span bytes) const { 428| 1.88k| if(bytes.size() != 1 + p_bytes() || (bytes[0] != 0x02 && bytes[0] != 0x03)) { ------------------ | Branch (428:7): [True: 294, False: 1.59k] | Branch (428:41): [True: 859, False: 736] | Branch (428:61): [True: 2, False: 857] ------------------ 429| 296| return {}; 430| 296| } 431| | 432| 1.59k| if(m_pcurve) { ------------------ | Branch (432:7): [True: 1.59k, False: 0] ------------------ 433| 1.59k| if(auto pt = m_pcurve->deserialize_point_compressed(bytes)) { ------------------ | Branch (433:15): [True: 1.41k, False: 179] ------------------ 434| 1.41k| return std::make_unique(shared_from_this(), std::move(*pt)); 435| 1.41k| } else { 436| 179| return {}; 437| 179| } 438| 1.59k| } else { 439| 0|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 440| 0| try { 441| 0| auto pt = Botan::OS2ECP(bytes, m_curve); 442| 0| return std::make_unique(shared_from_this(), std::move(pt)); 443| 0| } catch(...) { 444| 0| return {}; 445| 0| } 446| |#else 447| | throw Not_Implemented("Legacy EC interfaces disabled in this build configuration"); 448| |#endif 449| 0| } 450| 1.59k|} _ZNK5Botan13EC_Group_Data11point_g_mulERKNS_14EC_Scalar_DataERNS_21RandomNumberGeneratorE: 556| 8.69k| RandomNumberGenerator& rng) const { 557| 8.69k| if(m_pcurve) { ------------------ | Branch (557:7): [True: 8.69k, False: 0] ------------------ 558| 8.69k| const auto& k = EC_Scalar_Data_PC::checked_ref(scalar); 559| 8.69k| auto pt = m_pcurve->point_to_affine(m_pcurve->mul_by_g(k.value(), rng)); 560| 8.69k| return std::make_unique(shared_from_this(), std::move(pt)); 561| 8.69k| } else { 562| 0|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 563| 0| const auto& group = scalar.group(); 564| 0| const auto& bn = EC_Scalar_Data_BN::checked_ref(scalar); 565| | 566| 0| BOTAN_STATE_CHECK(group->m_base_mult != nullptr); ------------------ | | 51| 0| do { \ | | 52| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 0| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 0] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 0| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 0] | | ------------------ ------------------ 567| 0| std::vector ws; 568| 0| auto pt = group->m_base_mult->mul(bn.value(), rng, m_order, ws); 569| 0| return std::make_unique(shared_from_this(), std::move(pt)); 570| |#else 571| | throw Not_Implemented("Legacy EC interfaces disabled in this build configuration"); 572| |#endif 573| 0| } 574| 8.69k|} ec_inner_data.cpp:_ZZN5Botan13EC_Group_DataC1ERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceEENK3$_0clEv: 77| 6| const bool same_params = [&]() { 78| 6| if(m_source == EC_Group_Source::Builtin) { ------------------ | Branch (78:19): [True: 6, False: 0] ------------------ 79| 6| return true; 80| 6| } 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| 10.1k|const EC_Scalar_Data_PC& EC_Scalar_Data_PC::checked_ref(const EC_Scalar_Data& data) { 15| 10.1k| const auto* p = dynamic_cast(&data); 16| 10.1k| if(p == nullptr) { ------------------ | Branch (16:7): [True: 0, False: 10.1k] ------------------ 17| 0| throw Invalid_State("Failed conversion to EC_Scalar_Data_PC"); 18| 0| } 19| 10.1k| return *p; 20| 10.1k|} _ZNK5Botan17EC_Scalar_Data_PC5groupEv: 22| 43.8k|const std::shared_ptr& EC_Scalar_Data_PC::group() const { 23| 43.8k| return m_group; 24| 43.8k|} _ZNK5Botan17EC_Scalar_Data_PC5bytesEv: 26| 8.69k|size_t EC_Scalar_Data_PC::bytes() const { 27| 8.69k| return this->group()->order_bytes(); 28| 8.69k|} _ZNK5Botan17EC_Scalar_Data_PC5cloneEv: 30| 7.68k|std::unique_ptr EC_Scalar_Data_PC::clone() const { 31| 7.68k| return std::make_unique(this->group(), this->value()); 32| 7.68k|} _ZNK5Botan17EC_Scalar_Data_PC7is_zeroEv: 34| 8.69k|bool EC_Scalar_Data_PC::is_zero() const { 35| 8.69k| const auto& pcurve = this->group()->pcurve(); 36| 8.69k| return pcurve.scalar_is_zero(m_v); 37| 8.69k|} _ZN5Botan17EC_Scalar_Data_PC7zeroizeEv: 49| 8.69k|void EC_Scalar_Data_PC::zeroize() { 50| 8.69k| m_v._zeroize(); 51| 8.69k|} _ZNK5Botan17EC_Scalar_Data_PC12serialize_toENSt3__14spanIhLm18446744073709551615EEE: 82| 8.69k|void EC_Scalar_Data_PC::serialize_to(std::span bytes) const { 83| 8.69k| BOTAN_ARG_CHECK(bytes.size() == m_group->order_bytes(), "Invalid output length"); ------------------ | | 35| 8.69k| do { \ | | 36| 8.69k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 8.69k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 8.69k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 8.69k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 8.69k] | | ------------------ ------------------ 84| 8.69k| m_group->pcurve().serialize_scalar(bytes, m_v); 85| 8.69k|} _ZN5Botan22EC_AffinePoint_Data_PCC2ENSt3__110shared_ptrIKNS_13EC_Group_DataEEENS_6PCurve15PrimeOrderCurve11AffinePointE: 89| 20.6k| m_group(std::move(group)), m_pt(std::move(pt)) { 90| 20.6k| const auto& pcurve = m_group->pcurve(); 91| | 92| 20.6k| if(!pcurve.affine_point_is_identity(m_pt)) { ------------------ | Branch (92:7): [True: 20.6k, False: 0] ------------------ 93| 20.6k| m_xy.resize(1 + 2 * field_element_bytes()); 94| 20.6k| pcurve.serialize_point(m_xy, m_pt); 95| 20.6k| } 96| 20.6k|} _ZNK5Botan22EC_AffinePoint_Data_PC5cloneEv: 106| 2.82k|std::unique_ptr EC_AffinePoint_Data_PC::clone() const { 107| 2.82k| return std::make_unique(m_group, m_pt); 108| 2.82k|} _ZNK5Botan22EC_AffinePoint_Data_PC5groupEv: 110| 28.9k|const std::shared_ptr& EC_AffinePoint_Data_PC::group() const { 111| 28.9k| return m_group; 112| 28.9k|} _ZNK5Botan22EC_AffinePoint_Data_PC10mul_x_onlyERKNS_14EC_Scalar_DataERNS_21RandomNumberGeneratorE: 124| 1.41k| RandomNumberGenerator& rng) const { 125| 1.41k| BOTAN_ARG_CHECK(scalar.group() == m_group, "Curve mismatch"); ------------------ | | 35| 1.41k| do { \ | | 36| 1.41k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.41k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.41k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.41k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.41k] | | ------------------ ------------------ 126| 1.41k| const auto& k = EC_Scalar_Data_PC::checked_ref(scalar).value(); 127| 1.41k| return m_group->pcurve().mul_x_only(m_pt, k, rng); 128| 1.41k|} _ZNK5Botan22EC_AffinePoint_Data_PC19field_element_bytesEv: 130| 69.7k|size_t EC_AffinePoint_Data_PC::field_element_bytes() const { 131| 69.7k| return m_group->pcurve().field_element_bytes(); 132| 69.7k|} _ZNK5Botan22EC_AffinePoint_Data_PC11is_identityEv: 134| 79.4k|bool EC_AffinePoint_Data_PC::is_identity() const { 135| 79.4k| return m_xy.empty(); 136| 79.4k|} _ZNK5Botan22EC_AffinePoint_Data_PC14serialize_x_toENSt3__14spanIhLm18446744073709551615EEE: 138| 27|void EC_AffinePoint_Data_PC::serialize_x_to(std::span bytes) const { 139| 27| BOTAN_STATE_CHECK(!this->is_identity()); ------------------ | | 51| 27| do { \ | | 52| 27| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 27| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 27] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 27| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 27] | | ------------------ ------------------ 140| 27| const size_t fe_bytes = this->field_element_bytes(); 141| 27| BOTAN_ARG_CHECK(bytes.size() == fe_bytes, "Invalid output size"); ------------------ | | 35| 27| do { \ | | 36| 27| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 27| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 27] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 27| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 27] | | ------------------ ------------------ 142| 27| copy_mem(bytes, std::span{m_xy}.subspan(1, fe_bytes)); 143| 27|} _ZNK5Botan22EC_AffinePoint_Data_PC23serialize_compressed_toENSt3__14spanIhLm18446744073709551615EEE: 159| 27|void EC_AffinePoint_Data_PC::serialize_compressed_to(std::span bytes) const { 160| 27| BOTAN_STATE_CHECK(!this->is_identity()); ------------------ | | 51| 27| do { \ | | 52| 27| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 27| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 27] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 27| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 27] | | ------------------ ------------------ 161| 27| const size_t fe_bytes = this->field_element_bytes(); 162| 27| BOTAN_ARG_CHECK(bytes.size() == 1 + fe_bytes, "Invalid output size"); ------------------ | | 35| 27| do { \ | | 36| 27| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 27| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 27] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 27| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 27] | | ------------------ ------------------ 163| 27| const bool y_is_odd = (m_xy.back() & 0x01) == 0x01; 164| | 165| 27| BufferStuffer stuffer(bytes); 166| 27| stuffer.append(y_is_odd ? 0x03 : 0x02); ------------------ | Branch (166:19): [True: 14, False: 13] ------------------ 167| 27| this->serialize_x_to(stuffer.next(fe_bytes)); 168| 27|} _ZNK5Botan22EC_AffinePoint_Data_PC25serialize_uncompressed_toENSt3__14spanIhLm18446744073709551615EEE: 170| 16.3k|void EC_AffinePoint_Data_PC::serialize_uncompressed_to(std::span bytes) const { 171| 16.3k| BOTAN_STATE_CHECK(!this->is_identity()); ------------------ | | 51| 16.3k| do { \ | | 52| 16.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 16.3k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 16.3k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 16.3k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 16.3k] | | ------------------ ------------------ 172| 16.3k| const size_t fe_bytes = this->field_element_bytes(); 173| 16.3k| BOTAN_ARG_CHECK(bytes.size() == 1 + 2 * fe_bytes, "Invalid output size"); ------------------ | | 35| 16.3k| do { \ | | 36| 16.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 16.3k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 16.3k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 16.3k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 16.3k] | | ------------------ ------------------ 174| 16.3k| copy_mem(bytes, m_xy); 175| 16.3k|} _ZNK5Botan22EC_AffinePoint_Data_PC15to_legacy_pointEv: 178| 16.3k|EC_Point EC_AffinePoint_Data_PC::to_legacy_point() const { 179| 16.3k| if(this->is_identity()) { ------------------ | Branch (179:7): [True: 0, False: 16.3k] ------------------ 180| 0| return EC_Point(m_group->curve()); 181| 16.3k| } else { 182| 16.3k| const size_t fe_bytes = this->field_element_bytes(); 183| 16.3k| return EC_Point(m_group->curve(), 184| 16.3k| BigInt::from_bytes(std::span{m_xy}.subspan(1, fe_bytes)), 185| 16.3k| BigInt::from_bytes(std::span{m_xy}.last(fe_bytes))); 186| 16.3k| } 187| 16.3k|} _ZN5Botan8EC_Group13EC_group_infoERKNS_3OIDE: 16| 6|std::shared_ptr EC_Group::EC_group_info(const OID& oid) { 17| | // secp256r1 18| 6| if(oid == OID{1, 2, 840, 10045, 3, 1, 7}) { ------------------ | Branch (18:7): [True: 1, False: 5] ------------------ 19| 1| return load_EC_group_info( 20| 1| "0xFFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFF", 21| 1| "0xFFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFC", 22| 1| "0x5AC635D8AA3A93E7B3EBBD55769886BC651D06B0CC53B0F63BCE3C3E27D2604B", 23| 1| "0x6B17D1F2E12C4247F8BCE6E563A440F277037D812DEB33A0F4A13945D898C296", 24| 1| "0x4FE342E2FE1A7F9B8EE7EB4A7C0F9E162BCE33576B315ECECBB6406837BF51F5", 25| 1| "0xFFFFFFFF00000000FFFFFFFFFFFFFFFFBCE6FAADA7179E84F3B9CAC2FC632551", 26| 1| oid); 27| 1| } 28| | 29| | // secp384r1 30| 5| if(oid == OID{1, 3, 132, 0, 34}) { ------------------ | Branch (30:7): [True: 1, False: 4] ------------------ 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| 4| if(oid == OID{1, 3, 132, 0, 35}) { ------------------ | Branch (42:7): [True: 1, False: 3] ------------------ 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| 3| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 1}) { ------------------ | Branch (54:7): [True: 0, False: 3] ------------------ 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| 3| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 3}) { ------------------ | Branch (66:7): [True: 0, False: 3] ------------------ 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| 3| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 5}) { ------------------ | Branch (78:7): [True: 0, False: 3] ------------------ 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| 3| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 7}) { ------------------ | Branch (90:7): [True: 1, False: 2] ------------------ 91| 1| return load_EC_group_info( 92| 1| "0xA9FB57DBA1EEA9BC3E660A909D838D726E3BF623D52620282013481D1F6E5377", 93| 1| "0x7D5A0975FC2C3057EEF67530417AFFE7FB8055C126DC5C6CE94A4B44F330B5D9", 94| 1| "0x26DC5C6CE94A4B44F330B5D9BBD77CBF958416295CF7E1CE6BCCDC18FF8C07B6", 95| 1| "0x8BD2AEB9CB7E57CB2C4B482FFC81B7AFB9DE27E1E3BD23C23A4453BD9ACE3262", 96| 1| "0x547EF835C3DAC4FD97F8461A14611DC9C27745132DED8E545C1D54C72F046997", 97| 1| "0xA9FB57DBA1EEA9BC3E660A909D838D718C397AA3B561A6F7901E0E82974856A7", 98| 1| oid); 99| 1| } 100| | 101| | // brainpool320r1 102| 2| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 9}) { ------------------ | Branch (102:7): [True: 0, False: 2] ------------------ 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| 2| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 11}) { ------------------ | Branch (114:7): [True: 1, False: 1] ------------------ 115| 1| return load_EC_group_info( 116| 1| "0x8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B412B1DA197FB71123ACD3A729901D1A71874700133107EC53", 117| 1| "0x7BC382C63D8C150C3C72080ACE05AFA0C2BEA28E4FB22787139165EFBA91F90F8AA5814A503AD4EB04A8C7DD22CE2826", 118| 1| "0x4A8C7DD22CE28268B39B55416F0447C2FB77DE107DCD2A62E880EA53EEB62D57CB4390295DBC9943AB78696FA504C11", 119| 1| "0x1D1C64F068CF45FFA2A63A81B7C13F6B8847A3E77EF14FE3DB7FCAFE0CBD10E8E826E03436D646AAEF87B2E247D4AF1E", 120| 1| "0x8ABE1D7520F9C2A45CB1EB8E95CFD55262B70B29FEEC5864E19C054FF99129280E4646217791811142820341263C5315", 121| 1| "0x8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B31F166E6CAC0425A7CF3AB6AF6B7FC3103B883202E9046565", 122| 1| oid); 123| 1| } 124| | 125| | // brainpool512r1 126| 1| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 13}) { ------------------ | Branch (126:7): [True: 1, False: 0] ------------------ 127| 1| return load_EC_group_info( 128| 1| "0xAADD9DB8DBE9C48B3FD4E6AE33C9FC07CB308DB3B3C9D20ED6639CCA703308717D4D9B009BC66842AECDA12AE6A380E62881FF2F2D82C68528AA6056583A48F3", 129| 1| "0x7830A3318B603B89E2327145AC234CC594CBDD8D3DF91610A83441CAEA9863BC2DED5D5AA8253AA10A2EF1C98B9AC8B57F1117A72BF2C7B9E7C1AC4D77FC94CA", 130| 1| "0x3DF91610A83441CAEA9863BC2DED5D5AA8253AA10A2EF1C98B9AC8B57F1117A72BF2C7B9E7C1AC4D77FC94CADC083E67984050B75EBAE5DD2809BD638016F723", 131| 1| "0x81AEE4BDD82ED9645A21322E9C4C6A9385ED9F70B5D916C1B43B62EEF4D0098EFF3B1F78E2D0D48D50D1687B93B97D5F7C6D5047406A5E688B352209BCB9F822", 132| 1| "0x7DDE385D566332ECC0EABFA9CF7822FDF209F70024A57B1AA000C55B881F8111B2DCDE494A5F485E5BCA4BD88A2763AED1CA2B2FA8F0540678CD1E0F3AD80892", 133| 1| "0xAADD9DB8DBE9C48B3FD4E6AE33C9FC07CB308DB3B3C9D20ED6639CCA70330870553E5C414CA92619418661197FAC10471DB1D381085DDADDB58796829CA90069", 134| 1| oid); 135| 1| } 136| | 137| | // frp256v1 138| 0| if(oid == OID{1, 2, 250, 1, 223, 101, 256, 1}) { ------------------ | Branch (138:7): [True: 0, False: 0] ------------------ 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| 0| if(oid == OID{1, 2, 643, 7, 1, 2, 1, 1, 1} || oid == OID{1, 2, 643, 2, 2, 35, 1} || oid == OID{1, 2, 643, 2, 2, 36, 0}) { ------------------ | Branch (150:7): [True: 0, False: 0] | Branch (150:7): [True: 0, False: 0] | Branch (150:50): [True: 0, False: 0] | Branch (150:88): [True: 0, False: 0] ------------------ 151| 0| return load_EC_group_info( 152| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFD97", 153| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFD94", 154| 0| "0xA6", 155| 0| "0x1", 156| 0| "0x8D91E471E0989CDA27DF505A453F2B7635294F2DDF23E3B122ACC99C9E9F1E14", 157| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF6C611070995AD10045841B09B761B893", 158| 0| OID{1, 2, 643, 7, 1, 2, 1, 1, 1}); 159| 0| } 160| | 161| | // gost_512A 162| 0| if(oid == OID{1, 2, 643, 7, 1, 2, 1, 2, 1}) { ------------------ | Branch (162:7): [True: 0, False: 0] ------------------ 163| 0| return load_EC_group_info( 164| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFDC7", 165| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFDC4", 166| 0| "0xE8C2505DEDFC86DDC1BD0B2B6667F1DA34B82574761CB0E879BD081CFD0B6265EE3CB090F30D27614CB4574010DA90DD862EF9D4EBEE4761503190785A71C760", 167| 0| "0x3", 168| 0| "0x7503CFE87A836AE3A61B8816E25450E6CE5E1C93ACF1ABC1778064FDCBEFA921DF1626BE4FD036E93D75E6A50E3A41E98028FE5FC235F5B889A589CB5215F2A4", 169| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF27E69532F48D89116FF22B8D4E0560609B4B38ABFAD2B85DCACDB1411F10B275", 170| 0| oid); 171| 0| } 172| | 173| | // secp160k1 174| 0| if(oid == OID{1, 3, 132, 0, 9}) { ------------------ | Branch (174:7): [True: 0, False: 0] ------------------ 175| 0| return load_EC_group_info( 176| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC73", 177| 0| "0x0", 178| 0| "0x7", 179| 0| "0x3B4C382CE37AA192A4019E763036F4F5DD4D7EBB", 180| 0| "0x938CF935318FDCED6BC28286531733C3F03C4FEE", 181| 0| "0x100000000000000000001B8FA16DFAB9ACA16B6B3", 182| 0| oid); 183| 0| } 184| | 185| | // secp160r1 186| 0| if(oid == OID{1, 3, 132, 0, 8}) { ------------------ | Branch (186:7): [True: 0, False: 0] ------------------ 187| 0| return load_EC_group_info( 188| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFF", 189| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFC", 190| 0| "0x1C97BEFC54BD7A8B65ACF89F81D4D4ADC565FA45", 191| 0| "0x4A96B5688EF573284664698968C38BB913CBFC82", 192| 0| "0x23A628553168947D59DCC912042351377AC5FB32", 193| 0| "0x100000000000000000001F4C8F927AED3CA752257", 194| 0| oid); 195| 0| } 196| | 197| | // secp160r2 198| 0| if(oid == OID{1, 3, 132, 0, 30}) { ------------------ | Branch (198:7): [True: 0, False: 0] ------------------ 199| 0| return load_EC_group_info( 200| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC73", 201| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC70", 202| 0| "0xB4E134D3FB59EB8BAB57274904664D5AF50388BA", 203| 0| "0x52DCB034293A117E1F4FF11B30F7199D3144CE6D", 204| 0| "0xFEAFFEF2E331F296E071FA0DF9982CFEA7D43F2E", 205| 0| "0x100000000000000000000351EE786A818F3A1A16B", 206| 0| oid); 207| 0| } 208| | 209| | // secp192k1 210| 0| if(oid == OID{1, 3, 132, 0, 31}) { ------------------ | Branch (210:7): [True: 0, False: 0] ------------------ 211| 0| return load_EC_group_info( 212| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFEE37", 213| 0| "0x0", 214| 0| "0x3", 215| 0| "0xDB4FF10EC057E9AE26B07D0280B7F4341DA5D1B1EAE06C7D", 216| 0| "0x9B2F2F6D9C5628A7844163D015BE86344082AA88D95E2F9D", 217| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFE26F2FC170F69466A74DEFD8D", 218| 0| oid); 219| 0| } 220| | 221| | // secp192r1 222| 0| if(oid == OID{1, 2, 840, 10045, 3, 1, 1}) { ------------------ | Branch (222:7): [True: 0, False: 0] ------------------ 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| 0| if(oid == OID{1, 3, 132, 0, 32}) { ------------------ | Branch (234:7): [True: 0, False: 0] ------------------ 235| 0| return load_EC_group_info( 236| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFE56D", 237| 0| "0x0", 238| 0| "0x5", 239| 0| "0xA1455B334DF099DF30FC28A169A467E9E47075A90F7E650EB6B7A45C", 240| 0| "0x7E089FED7FBA344282CAFBD6F7E319F7C0B0BD59E2CA4BDB556D61A5", 241| 0| "0x10000000000000000000000000001DCE8D2EC6184CAF0A971769FB1F7", 242| 0| oid); 243| 0| } 244| | 245| | // secp224r1 246| 0| if(oid == OID{1, 3, 132, 0, 33}) { ------------------ | Branch (246:7): [True: 0, False: 0] ------------------ 247| 0| return load_EC_group_info( 248| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF000000000000000000000001", 249| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFE", 250| 0| "0xB4050A850C04B3ABF54132565044B0B7D7BFD8BA270B39432355FFB4", 251| 0| "0xB70E0CBD6BB4BF7F321390B94A03C1D356C21122343280D6115C1D21", 252| 0| "0xBD376388B5F723FB4C22DFE6CD4375A05A07476444D5819985007E34", 253| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF16A2E0B8F03E13DD29455C5C2A3D", 254| 0| oid); 255| 0| } 256| | 257| | // secp256k1 258| 0| if(oid == OID{1, 3, 132, 0, 10}) { ------------------ | Branch (258:7): [True: 0, False: 0] ------------------ 259| 0| return load_EC_group_info( 260| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F", 261| 0| "0x0", 262| 0| "0x7", 263| 0| "0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798", 264| 0| "0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8", 265| 0| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141", 266| 0| oid); 267| 0| } 268| | 269| | // sm2p256v1 270| 0| if(oid == OID{1, 2, 156, 10197, 1, 301}) { ------------------ | Branch (270:7): [True: 0, False: 0] ------------------ 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| 0| if(oid == OID{1, 2, 840, 10045, 3, 1, 2}) { ------------------ | Branch (282:7): [True: 0, False: 0] ------------------ 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| 0| if(oid == OID{1, 2, 840, 10045, 3, 1, 3}) { ------------------ | Branch (294:7): [True: 0, False: 0] ------------------ 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| 0| if(oid == OID{1, 2, 840, 10045, 3, 1, 4}) { ------------------ | Branch (306:7): [True: 0, False: 0] ------------------ 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| 0| if(oid == OID{1, 2, 840, 10045, 3, 1, 5}) { ------------------ | Branch (318:7): [True: 0, False: 0] ------------------ 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| 0| if(oid == OID{1, 2, 840, 10045, 3, 1, 6}) { ------------------ | Branch (330:7): [True: 0, False: 0] ------------------ 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| 0| if(oid == OID{1, 3, 6, 1, 4, 1, 25258, 4, 3}) { ------------------ | Branch (342:7): [True: 0, False: 0] ------------------ 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| 0| return std::shared_ptr(); 354| 0|} _ZN5Botan9EC_ScalarC2ENSt3__110unique_ptrINS_14EC_Scalar_DataENS1_14default_deleteIS3_EEEE: 19| 8.69k|EC_Scalar::EC_Scalar(std::unique_ptr scalar) : m_scalar(std::move(scalar)) { 20| 8.69k| BOTAN_ASSERT_NONNULL(m_scalar); ------------------ | | 123| 8.69k| do { \ | | 124| 8.69k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (124:10): [True: 0, False: 8.69k] | | ------------------ | | 125| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 126| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 127| 0| } \ | | 128| 8.69k| } while(0) | | ------------------ | | | Branch (128:12): [Folded, False: 8.69k] | | ------------------ ------------------ 21| 8.69k|} _ZN5Botan9EC_ScalarC2ERKS0_: 23| 7.68k|EC_Scalar::EC_Scalar(const EC_Scalar& other) : m_scalar(other.inner().clone()) {} _ZN5Botan9EC_ScalarC2EOS0_: 25| 17.3k|EC_Scalar::EC_Scalar(EC_Scalar&& other) noexcept : m_scalar(std::move(other.m_scalar)) {} _ZN5Botan9EC_ScalarD2Ev: 46| 33.7k|EC_Scalar::~EC_Scalar() = default; _ZNK5Botan9EC_Scalar5groupEv: 48| 8.69k|EC_Group EC_Scalar::group() const { 49| 8.69k| return EC_Group(inner().group()); 50| 8.69k|} _ZN5Botan9EC_Scalar6randomERKNS_8EC_GroupERNS_21RandomNumberGeneratorE: 68| 2.42k|EC_Scalar EC_Scalar::random(const EC_Group& group, RandomNumberGenerator& rng) { 69| 2.42k| return EC_Scalar(group._data()->scalar_random(rng)); 70| 2.42k|} _ZNK5Botan9EC_Scalar9to_bigintEv: 84| 8.69k|BigInt EC_Scalar::to_bigint() const { 85| 8.69k| secure_vector bytes(m_scalar->bytes()); 86| 8.69k| m_scalar->serialize_to(bytes); 87| 8.69k| return BigInt::from_bytes(bytes); 88| 8.69k|} _ZN5Botan9EC_Scalar11deserializeERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 126| 6.26k|std::optional EC_Scalar::deserialize(const EC_Group& group, std::span bytes) { 127| 6.26k| if(auto v = group._data()->scalar_deserialize(bytes)) { ------------------ | Branch (127:12): [True: 6.26k, False: 0] ------------------ 128| 6.26k| return EC_Scalar(std::move(v)); 129| 6.26k| } else { 130| 0| return {}; 131| 0| } 132| 6.26k|} _ZNK5Botan9EC_Scalar7is_zeroEv: 141| 8.69k|bool EC_Scalar::is_zero() const { 142| 8.69k| return inner().is_zero(); 143| 8.69k|} _ZN5Botan9EC_Scalar7zeroizeEv: 186| 8.69k|void EC_Scalar::zeroize() { 187| 8.69k| m_scalar->zeroize(); 188| 8.69k|} _ZN5Botan8CurveGFpC2EPKNS_13EC_Group_DataE: 28| 6|CurveGFp::CurveGFp(const EC_Group_Data* group) : m_group(group) { 29| 6| BOTAN_ASSERT_NONNULL(m_group); ------------------ | | 123| 6| do { \ | | 124| 6| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (124:10): [True: 0, False: 6] | | ------------------ | | 125| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 126| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 127| 0| } \ | | 128| 6| } while(0) | | ------------------ | | | Branch (128:12): [Folded, False: 6] | | ------------------ ------------------ 30| 6|} _ZNK5Botan8CurveGFp5groupEv: 32| 32.7k|const EC_Group_Data& CurveGFp::group() const { 33| 32.7k| BOTAN_ASSERT_NONNULL(m_group); ------------------ | | 123| 32.7k| do { \ | | 124| 32.7k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (124:10): [True: 0, False: 32.7k] | | ------------------ | | 125| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 126| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 127| 0| } \ | | 128| 32.7k| } while(0) | | ------------------ | | | Branch (128:12): [Folded, False: 32.7k] | | ------------------ ------------------ 34| 32.7k| return *m_group; 35| 32.7k|} _ZN5Botan8EC_PointC2ERKNS_8CurveGFpENS_6BigIntES4_: 115| 16.3k| m_curve(curve), m_x(std::move(x)), m_y(std::move(y)), m_z(m_curve.group().monty().R1()) { 116| 16.3k| const auto& group = m_curve.group(); 117| | 118| 16.3k| if(m_x < 0 || m_x >= group.p()) { ------------------ | Branch (118:7): [True: 0, False: 16.3k] | Branch (118:18): [True: 0, False: 16.3k] ------------------ 119| 0| throw Invalid_Argument("Invalid EC_Point affine x"); 120| 0| } 121| 16.3k| if(m_y < 0 || m_y >= group.p()) { ------------------ | Branch (121:7): [True: 0, False: 16.3k] | Branch (121:18): [True: 0, False: 16.3k] ------------------ 122| 0| throw Invalid_Argument("Invalid EC_Point affine y"); 123| 0| } 124| | 125| 16.3k| secure_vector monty_ws(monty_ws_size(group)); 126| | 127| 16.3k| to_rep(group, m_x, monty_ws); 128| 16.3k| to_rep(group, m_y, monty_ws); 129| 16.3k|} _ZN5Botan8EC_Point4swapERS0_: 792| 16.3k|void EC_Point::swap(EC_Point& other) noexcept { 793| 16.3k| m_curve.swap(other.m_curve); 794| 16.3k| m_x.swap(other.m_x); 795| 16.3k| m_y.swap(other.m_y); 796| 16.3k| m_z.swap(other.m_z); 797| 16.3k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_113monty_ws_sizeERKNS_13EC_Group_DataE: 102| 16.3k|size_t monty_ws_size(const EC_Group_Data& group) { 103| 16.3k| return 2 * group.p_words(); 104| 16.3k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16to_repERKNS_13EC_Group_DataERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 55| 32.7k|void to_rep(const EC_Group_Data& group, BigInt& x, secure_vector& ws) { 56| 32.7k| group.monty().mul_by(x, group.monty().R2(), ws); 57| 32.7k|} _ZN5Botan17EC_PublicKey_DataC2ERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 38| 6.26k| EC_PublicKey_Data(group, decode_ec_public_key_point(group, bytes)) {} _ZN5Botan17EC_PublicKey_DataC2ENS_8EC_GroupENS_14EC_AffinePointE: 41| 16.3k| 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| 16.3k| if(m_point.is_identity()) { ------------------ | Branch (44:7): [True: 0, False: 16.3k] ------------------ 45| 0| throw Decoding_Error("ECC public key cannot be point at infinity"); 46| 0| } 47| | 48| 16.3k| if(m_point._group() != m_group._data()) { ------------------ | Branch (48:7): [True: 0, False: 16.3k] ------------------ 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| 16.3k|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 63| 16.3k| m_legacy_point = m_point.to_legacy_point(); 64| 16.3k|#endif 65| 16.3k|} _ZN5Botan18EC_PrivateKey_DataC2ENS_8EC_GroupENS_9EC_ScalarE: 68| 8.69k| m_group(std::move(group)), m_scalar(std::move(x)), m_legacy_x(m_scalar.to_bigint()) { 69| 8.69k| if(m_scalar.group()._data() != m_group._data()) { ------------------ | Branch (69:7): [True: 0, False: 8.69k] ------------------ 70| 0| if(m_scalar.group() != m_group) { ------------------ | Branch (70:10): [True: 0, False: 0] ------------------ 71| 0| throw Decoding_Error("ECC private key scalar is not an element of the specified group"); 72| 0| } 73| | 74| 0| if(auto rebound = EC_Scalar::deserialize(m_group, m_scalar.serialize>())) { ------------------ | Branch (74:15): [True: 0, False: 0] ------------------ 75| 0| m_scalar = std::move(rebound).value(); 76| 0| } else { 77| 0| throw Decoding_Error("ECC private key scalar is not an element of the specified group"); 78| 0| } 79| 0| } 80| | 81| | // Checking that the scalar is lower than the group order is ensured in the 82| | // deserialization of the EC_Scalar or during the random generation respectively. 83| 8.69k| if(m_scalar.is_zero()) { ------------------ | Branch (83:7): [True: 0, False: 8.69k] ------------------ 84| 0| throw Decoding_Error("ECC private key cannot be zero"); 85| 0| } 86| 8.69k|} _ZN5Botan18EC_PrivateKey_DataC2ERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 118| 6.26k| Botan::EC_PrivateKey_Data(group, decode_ec_secret_key_scalar(group, bytes)) {} _ZN5Botan18EC_PrivateKey_DataD2Ev: 120| 8.69k|EC_PrivateKey_Data::~EC_PrivateKey_Data() { 121| 8.69k| m_scalar.zeroize(); 122| 8.69k|} _ZNK5Botan18EC_PrivateKey_Data10public_keyERNS_21RandomNumberGeneratorEb: 125| 8.69k| bool with_modular_inverse) const { 126| 8.69k| const auto public_point = [&] { 127| 8.69k| if(with_modular_inverse) { 128| 8.69k| return EC_AffinePoint::g_mul(m_scalar.invert(), rng); 129| 8.69k| } else { 130| 8.69k| return EC_AffinePoint::g_mul(m_scalar, rng); 131| 8.69k| } 132| 8.69k| }; 133| | 134| 8.69k| return std::make_shared(m_group, public_point()); 135| 8.69k|} _ZNK5Botan18EC_PrivateKey_Data10public_keyEb: 137| 6.26k|std::shared_ptr EC_PrivateKey_Data::public_key(bool with_modular_inverse) const { 138| 6.26k| Null_RNG null_rng; 139| 6.26k| return this->public_key(null_rng, with_modular_inverse); 140| 6.26k|} ec_key_data.cpp:_ZN5Botan12_GLOBAL__N_126decode_ec_public_key_pointERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 17| 6.26k|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| 6.26k| if(auto pt_uncompressed = EC_AffinePoint::deserialize_uncompressed(group, bytes)) { ------------------ | Branch (26:12): [True: 6.26k, False: 0] ------------------ 27| 6.26k| return std::move(pt_uncompressed).value(); 28| 6.26k| } else if(auto pt_compressed = EC_AffinePoint::deserialize_compressed(group, bytes)) { ------------------ | Branch (28:19): [True: 0, False: 0] ------------------ 29| 0| return std::move(pt_compressed).value(); 30| 0| } else { 31| 0| throw Decoding_Error("Failed to deserialize elliptic curve point"); 32| 0| } 33| 6.26k|} ec_key_data.cpp:_ZN5Botan12_GLOBAL__N_127decode_ec_secret_key_scalarERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 90| 6.26k|EC_Scalar decode_ec_secret_key_scalar(const EC_Group& group, std::span bytes) { 91| 6.26k| const size_t order_bytes = group.get_order_bytes(); 92| | 93| 6.26k| if(bytes.size() < order_bytes) { ------------------ | Branch (93:7): [True: 0, False: 6.26k] ------------------ 94| | /* 95| | * Older versions had a bug which caused secret keys to not be encoded to 96| | * the full byte length of the order if there were leading zero bytes. This 97| | * was particularly a problem for P-521, where on average half of keys do 98| | * not have their high bit set and so can be encoded in 65 bytes, vs 66 99| | * bytes for the full order. 100| | * 101| | * To accommodate this, zero prefix the key if we see such a short input 102| | */ 103| 0| secure_vector padded_sk(order_bytes); 104| 0| copy_mem(std::span{padded_sk}.last(bytes.size()), bytes); 105| 0| return decode_ec_secret_key_scalar(group, padded_sk); 106| 0| } 107| | 108| 6.26k| if(auto s = EC_Scalar::deserialize(group, bytes)) { ------------------ | Branch (108:12): [True: 6.26k, False: 0] ------------------ 109| 6.26k| return s.value(); 110| 6.26k| } else { 111| 0| throw Decoding_Error("EC private key is invalid for this group"); 112| 0| } 113| 6.26k|} ec_key_data.cpp:_ZZNK5Botan18EC_PrivateKey_Data10public_keyERNS_21RandomNumberGeneratorEbENK3$_0clEv: 126| 8.69k| const auto public_point = [&] { 127| 8.69k| if(with_modular_inverse) { ------------------ | Branch (127:10): [True: 0, False: 8.69k] ------------------ 128| 0| return EC_AffinePoint::g_mul(m_scalar.invert(), rng); 129| 8.69k| } else { 130| 8.69k| return EC_AffinePoint::g_mul(m_scalar, rng); 131| 8.69k| } 132| 8.69k| }; _ZNK5Botan12EC_PublicKey10key_lengthEv: 28| 1.41k|size_t EC_PublicKey::key_length() const { 29| 1.41k| return domain().get_p_bits(); 30| 1.41k|} _ZN5Botan12EC_PublicKey27assert_algorithm_identifierERKNS_19AlgorithmIdentifierENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE: 49| 6.26k| std::string_view alg_name) { 50| 6.26k| if(alg_id.oid() != OID::from_string(alg_name)) { ------------------ | Branch (50:7): [True: 0, False: 6.26k] ------------------ 51| 0| throw Decoding_Error( 52| 0| fmt("Unexpected AlgorithmIdentifier OID {} in association with {} key", alg_id.oid(), alg_name)); 53| 0| } 54| | 55| 6.26k| return alg_id; // NOLINT(*-return-const-ref-from-parameter) 56| 6.26k|} _ZN5Botan12EC_PublicKeyC2ERKNS_8EC_GroupERKNS_14EC_AffinePointE: 66| 1.41k|EC_PublicKey::EC_PublicKey(const EC_Group& group, const EC_AffinePoint& pub_point) { 67| 1.41k| m_public_key = std::make_shared(group, pub_point); 68| 1.41k| m_domain_encoding = default_encoding_for(domain()); // NOLINT(*-prefer-member-initializer) 69| 1.41k|} _ZNK5Botan12EC_PublicKey6domainEv: 76| 12.9k|const EC_Group& EC_PublicKey::domain() const { 77| 12.9k| BOTAN_STATE_CHECK(m_public_key != nullptr); ------------------ | | 51| 12.9k| do { \ | | 52| 12.9k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 12.9k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 12.9k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 12.9k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 12.9k] | | ------------------ ------------------ 78| 12.9k| return m_public_key->group(); 79| 12.9k|} _ZNK5Botan12EC_PublicKey16_public_ec_pointEv: 88| 3.83k|const EC_AffinePoint& EC_PublicKey::_public_ec_point() const { 89| 3.83k| BOTAN_STATE_CHECK(m_public_key != nullptr); ------------------ | | 51| 3.83k| do { \ | | 52| 3.83k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 3.83k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 3.83k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 3.83k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 3.83k] | | ------------------ ------------------ 90| 3.83k| return m_public_key->public_key(); 91| 3.83k|} _ZNK5Botan12EC_PublicKey19raw_public_key_bitsEv: 102| 3.83k|std::vector EC_PublicKey::raw_public_key_bits() const { 103| 3.83k| return _public_ec_point().serialize(point_encoding()); 104| 3.83k|} _ZN5Botan12EC_PublicKey18set_point_encodingENS_15EC_Point_FormatE: 114| 4.84k|void EC_PublicKey::set_point_encoding(EC_Point_Format enc) { 115| 4.84k| if(enc != EC_Point_Format::Compressed && enc != EC_Point_Format::Uncompressed && enc != EC_Point_Format::Hybrid) { ------------------ | Branch (115:7): [True: 4.82k, False: 27] | Branch (115:45): [True: 0, False: 4.82k] | Branch (115:85): [True: 0, False: 0] ------------------ 116| 0| throw Invalid_Argument("Invalid point encoding for EC_PublicKey"); 117| 0| } 118| | 119| 4.84k| m_point_encoding = enc; 120| 4.84k|} _ZNK5Botan13EC_PrivateKey12_private_keyEv: 135| 1.41k|const EC_Scalar& EC_PrivateKey::_private_key() const { 136| 1.41k| BOTAN_STATE_CHECK(m_private_key != nullptr); ------------------ | | 51| 1.41k| do { \ | | 52| 1.41k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 1.41k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 1.41k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 1.41k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 1.41k] | | ------------------ ------------------ 137| 1.41k| return m_private_key->private_key(); 138| 1.41k|} _ZN5Botan13EC_PrivateKeyC2ERNS_21RandomNumberGeneratorERKNS_8EC_GroupEb: 155| 2.42k| m_with_modular_inverse(with_modular_inverse) { 156| 2.42k| auto scalar = EC_Scalar::random(ec_group, rng); 157| 2.42k| m_private_key = std::make_shared(ec_group, std::move(scalar)); 158| 2.42k| m_public_key = m_private_key->public_key(rng, with_modular_inverse); 159| 2.42k| m_domain_encoding = default_encoding_for(domain()); 160| 2.42k|} _ZN5Botan13EC_PrivateKeyC2ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEEb: 191| 6.26k| m_with_modular_inverse(with_modular_inverse) { 192| 6.26k| OID key_parameters; 193| 6.26k| secure_vector private_key_bits; 194| 6.26k| secure_vector public_key_bits; 195| | 196| 6.26k| BER_Decoder(key_bits, BER_Decoder::Limits::DER()) 197| 6.26k| .start_sequence() 198| 6.26k| .decode_and_check(1, "Unknown version code for ECC key") 199| 6.26k| .decode(private_key_bits, ASN1_Type::OctetString) 200| 6.26k| .decode_optional(key_parameters, ASN1_Type(0), ASN1_Class::ExplicitContextSpecific) 201| 6.26k| .decode_optional_octet_aligned_bitstring(public_key_bits, 1, ASN1_Class::ExplicitContextSpecific) 202| 6.26k| .end_cons() 203| 6.26k| .verify_end(); 204| | 205| 6.26k| std::unique_ptr group; 206| | 207| 6.26k| if(!alg_id.parameters_are_empty()) { ------------------ | Branch (207:7): [True: 6.26k, False: 0] ------------------ 208| 6.26k| group = std::make_unique(alg_id.parameters()); 209| 6.26k| } 210| 6.26k| if(!key_parameters.empty()) { ------------------ | Branch (210:7): [True: 0, False: 6.26k] ------------------ 211| 0| if(group) { ------------------ | Branch (211:10): [True: 0, False: 0] ------------------ 212| 0| if(EC_Group(key_parameters) != *group) { ------------------ | Branch (212:13): [True: 0, False: 0] ------------------ 213| 0| throw Decoding_Error("ECPrivateKey parameters do not match the AlgorithmIdentifier parameters"); 214| 0| } 215| 0| } else { 216| 0| group = std::make_unique(key_parameters); 217| 0| } 218| 0| } 219| 6.26k| if(!group) { ------------------ | Branch (219:7): [True: 0, False: 6.26k] ------------------ 220| 0| throw Decoding_Error("ECPrivateKey has no domain parameters"); 221| 0| } 222| | 223| 6.26k| m_private_key = std::make_shared(*group, private_key_bits); 224| 6.26k| m_public_key = m_private_key->public_key(with_modular_inverse); 225| | 226| | // If the encoding carried a public key it must agree with the derived one 227| 6.26k| if(!public_key_bits.empty()) { ------------------ | Branch (227:7): [True: 6.26k, False: 0] ------------------ 228| 6.26k| const EC_PublicKey_Data encoded_public_key(*group, public_key_bits); 229| 6.26k| if(encoded_public_key.public_key() != m_public_key->public_key()) { ------------------ | Branch (229:10): [True: 0, False: 6.26k] ------------------ 230| 0| throw Decoding_Error("ECPrivateKey public key does not match the private key"); 231| 0| } 232| 6.26k| } 233| | 234| 6.26k| m_domain_encoding = default_encoding_for(domain()); 235| 6.26k|} ecc_key.cpp:_ZN5Botan12_GLOBAL__N_120default_encoding_forERKNS_8EC_GroupE: 38| 10.1k|EC_Group_Encoding default_encoding_for(const EC_Group& group) { 39| 10.1k| if(group.get_curve_oid().empty()) { ------------------ | Branch (39:7): [True: 0, False: 10.1k] ------------------ 40| 0| return EC_Group_Encoding::Explicit; 41| 10.1k| } else { 42| 10.1k| return EC_Group_Encoding::NamedCurve; 43| 10.1k| } 44| 10.1k|} _ZNK5Botan15ECDH_PrivateKey24_create_key_agreement_opERNS_21RandomNumberGeneratorERKNS_31PK_Key_Agreement_Options_ReaderE: 99| 1.41k| RandomNumberGenerator& rng, const PK_Key_Agreement_Options_Reader& options) const { 100| 1.41k| require_software_provider(options, algo_name()); 101| | 102| 1.41k| return std::make_unique(*this, options, rng); 103| 1.41k|} ecdh.cpp:_ZN5Botan12_GLOBAL__N_117ECDH_KA_OperationC2ERKNS_15ECDH_PrivateKeyERKNS_31PK_Key_Agreement_Options_ReaderERNS_21RandomNumberGeneratorE: 33| 1.41k| PK_Ops::Key_Agreement_with_KDF(options), 34| 1.41k| m_group(key.domain()), 35| 1.41k| m_l_times_priv(mul_cofactor_inv(m_group, key._private_key())), 36| 1.41k| m_rng(rng) {} ecdh.cpp:_ZN5Botan12_GLOBAL__N_117ECDH_KA_Operation16mul_cofactor_invERKNS_8EC_GroupERKNS_9EC_ScalarE: 71| 1.41k| static EC_Scalar mul_cofactor_inv(const EC_Group& group, const EC_Scalar& x) { 72| | // We implement BSI TR-03111 ECKAEG which only matters in the (rare/deprecated) 73| | // case of a curve with cofactor. 74| | 75| 1.41k| if(group.has_cofactor()) { ------------------ | Branch (75:13): [True: 0, False: 1.41k] ------------------ 76| | // We could precompute this but cofactors are rare 77| 0| return x * EC_Scalar::from_bigint(group, group.get_cofactor()).invert_vartime(); 78| 1.41k| } else { 79| 1.41k| return x; 80| 1.41k| } 81| 1.41k| } ecdh.cpp:_ZN5Botan12_GLOBAL__N_117ECDH_KA_Operation9raw_agreeEPKhm: 40| 1.41k| secure_vector raw_agree(const uint8_t w[], size_t w_len) override { 41| 1.41k| const auto input_point = [&] { 42| 1.41k| if(m_group.has_cofactor()) { 43| 1.41k|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 44| 1.41k| return EC_AffinePoint(m_group, m_group.get_cofactor() * m_group.OS2ECP(w, w_len)); 45| |#else 46| | throw Not_Implemented( 47| | "Support for DH with cofactor adjustment not available in this build configuration"); 48| |#endif 49| 1.41k| } else { 50| 1.41k| if(auto point = EC_AffinePoint::deserialize(m_group, {w, w_len})) { 51| 1.41k| return *point; 52| 1.41k| } else { 53| 1.41k| throw Decoding_Error("ECDH - Invalid elliptic curve point: not on curve"); 54| 1.41k| } 55| 1.41k| } 56| 1.41k| }(); 57| | 58| | // Typical specs (such as BSI's TR-03111 Section 4.3.1) require that 59| | // we check the resulting point of the multiplication to not be the 60| | // point at infinity. However, since we ensure that our ECC private 61| | // scalar can never be zero, checking the peer's input point is 62| | // equivalent. 63| 1.41k| if(input_point.is_identity()) { ------------------ | Branch (63:13): [True: 0, False: 1.41k] ------------------ 64| 0| throw Decoding_Error("ECDH - Invalid elliptic curve point: identity"); 65| 0| } 66| | 67| 1.41k| return input_point.mul_x_only(m_l_times_priv, m_rng); 68| 1.41k| } ecdh.cpp:_ZZN5Botan12_GLOBAL__N_117ECDH_KA_Operation9raw_agreeEPKhmENKUlvE_clEv: 41| 1.41k| const auto input_point = [&] { 42| 1.41k| if(m_group.has_cofactor()) { ------------------ | Branch (42:16): [True: 0, False: 1.41k] ------------------ 43| 0|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 44| 0| return EC_AffinePoint(m_group, m_group.get_cofactor() * m_group.OS2ECP(w, w_len)); 45| |#else 46| | throw Not_Implemented( 47| | "Support for DH with cofactor adjustment not available in this build configuration"); 48| |#endif 49| 1.41k| } else { 50| 1.41k| if(auto point = EC_AffinePoint::deserialize(m_group, {w, w_len})) { ------------------ | Branch (50:24): [True: 1.41k, False: 0] ------------------ 51| 1.41k| return *point; 52| 1.41k| } else { 53| 0| throw Decoding_Error("ECDH - Invalid elliptic curve point: not on curve"); 54| 0| } 55| 1.41k| } 56| 1.41k| }(); _ZN5Botan8PEM_Code6decodeERNS_10DataSourceERNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEE: 64| 12.5k|secure_vector decode(DataSource& source, std::string& label) { 65| 12.5k| const size_t RANDOM_CHAR_LIMIT = 8; 66| | 67| 12.5k| label.clear(); 68| | 69| 12.5k| const std::string PEM_HEADER1 = "-----BEGIN "; 70| 12.5k| const std::string PEM_HEADER2 = "-----"; 71| 12.5k| size_t position = 0; 72| | 73| 153k| while(position != PEM_HEADER1.length()) { ------------------ | Branch (73:10): [True: 140k, False: 12.5k] ------------------ 74| 140k| auto b = source.read_byte(); 75| | 76| 140k| if(!b) { ------------------ | Branch (76:10): [True: 34, False: 140k] ------------------ 77| 34| throw Decoding_Error("PEM: No PEM header found"); 78| 34| } 79| 140k| if(static_cast(*b) == PEM_HEADER1[position]) { ------------------ | Branch (79:10): [True: 138k, False: 2.71k] ------------------ 80| 138k| ++position; 81| 138k| } else if(position >= RANDOM_CHAR_LIMIT) { ------------------ | Branch (81:17): [True: 1, False: 2.70k] ------------------ 82| 1| throw Decoding_Error("PEM: Malformed PEM header"); 83| 2.70k| } else { 84| 2.70k| position = 0; 85| 2.70k| } 86| 140k| } 87| 12.5k| position = 0; 88| 213k| while(position != PEM_HEADER2.length()) { ------------------ | Branch (88:10): [True: 200k, False: 12.5k] ------------------ 89| 200k| auto b = source.read_byte(); 90| | 91| 200k| if(!b) { ------------------ | Branch (91:10): [True: 0, False: 200k] ------------------ 92| 0| throw Decoding_Error("PEM: No PEM header found"); 93| 0| } 94| 200k| if(static_cast(*b) == PEM_HEADER2[position]) { ------------------ | Branch (94:10): [True: 62.6k, False: 137k] ------------------ 95| 62.6k| ++position; 96| 137k| } else if(position > 0) { ------------------ | Branch (96:17): [True: 0, False: 137k] ------------------ 97| 0| throw Decoding_Error("PEM: Malformed PEM header"); 98| 0| } 99| | 100| 200k| if(position == 0) { ------------------ | Branch (100:10): [True: 137k, False: 62.6k] ------------------ 101| 137k| if(label.size() >= 128) { ------------------ | Branch (101:13): [True: 0, False: 137k] ------------------ 102| 0| throw Decoding_Error("PEM: Label too long"); 103| 0| } 104| 137k| label += static_cast(*b); 105| 137k| } 106| 200k| } 107| | 108| 12.5k| std::vector b64; 109| | 110| 12.5k| const std::string PEM_TRAILER = fmt("-----END {}-----", label); 111| 12.5k| position = 0; 112| 5.51M| while(position != PEM_TRAILER.length()) { ------------------ | Branch (112:10): [True: 5.50M, False: 12.5k] ------------------ 113| 5.50M| auto b = source.read_byte(); 114| | 115| 5.50M| if(!b) { ------------------ | Branch (115:10): [True: 0, False: 5.50M] ------------------ 116| 0| throw Decoding_Error("PEM: No PEM trailer found"); 117| 0| } 118| 5.50M| if(static_cast(*b) == PEM_TRAILER[position]) { ------------------ | Branch (118:10): [True: 313k, False: 5.18M] ------------------ 119| 313k| ++position; 120| 5.18M| } else if(position > 0) { ------------------ | Branch (120:17): [True: 0, False: 5.18M] ------------------ 121| 0| throw Decoding_Error("PEM: Malformed PEM trailer"); 122| 0| } 123| | 124| 5.50M| if(position == 0) { ------------------ | Branch (124:10): [True: 5.18M, False: 313k] ------------------ 125| 5.18M| b64.push_back(*b); 126| 5.18M| } 127| 5.50M| } 128| | 129| 12.5k| return base64_decode(b64.data(), b64.size()); 130| 12.5k|} _ZN5Botan8PEM_Code7matchesERNS_10DataSourceENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEm: 146| 437|bool matches(DataSource& source, std::string_view extra, size_t search_range) { 147| 437| const std::string PEM_HEADER = fmt("-----BEGIN {}", extra); 148| | 149| 437| std::array stack_buf{}; 150| 437| std::vector heap_buf; 151| 437| uint8_t* search_buf = stack_buf.data(); 152| 437| if(search_range > stack_buf.size()) { ------------------ | Branch (152:7): [True: 0, False: 437] ------------------ 153| 0| heap_buf.resize(search_range); 154| 0| search_buf = heap_buf.data(); 155| 0| } 156| | 157| 437| const size_t got = source.peek(search_buf, search_range, 0); 158| | 159| 437| if(got < PEM_HEADER.length()) { ------------------ | Branch (159:7): [True: 79, False: 358] ------------------ 160| 79| return false; 161| 79| } 162| | 163| 358| return std::search(search_buf, search_buf + got, PEM_HEADER.begin(), PEM_HEADER.end()) != search_buf + got; 164| 437|} _ZN5Botan16load_private_keyERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 298| 6.26k| [[maybe_unused]] std::span key_bits) { 299| 6.26k| const std::string alg_name = [&]() -> std::string { 300| 6.26k| if(const auto name = alg_id.oid().registered_name()) { 301| 6.26k| const std::vector alg_info = split_on(*name, '/'); 302| 6.26k| if(!alg_info.empty()) { 303| 6.26k| return alg_info[0]; 304| 6.26k| } 305| 6.26k| } 306| | 307| 6.26k| throw Decoding_Error( 308| 6.26k| fmt("Private key decoding failed, no algorithm associated with {}", alg_id.oid().to_string())); 309| 6.26k| }(); 310| | 311| 6.26k|#if defined(BOTAN_HAS_RSA) 312| 6.26k| if(alg_name == "RSA") { ------------------ | Branch (312:7): [True: 0, False: 6.26k] ------------------ 313| 0| return std::make_unique(alg_id, key_bits); 314| 0| } 315| 6.26k|#endif 316| | 317| 6.26k|#if defined(BOTAN_HAS_X25519) 318| 6.26k| if(alg_name == "X25519" || alg_name == "Curve25519") { ------------------ | Branch (318:7): [True: 0, False: 6.26k] | Branch (318:31): [True: 0, False: 6.26k] ------------------ 319| 0| return std::make_unique(alg_id, key_bits); 320| 0| } 321| 6.26k|#endif 322| | 323| 6.26k|#if defined(BOTAN_HAS_X448) 324| 6.26k| if(alg_name == "X448") { ------------------ | Branch (324:7): [True: 0, False: 6.26k] ------------------ 325| 0| return std::make_unique(alg_id, key_bits); 326| 0| } 327| 6.26k|#endif 328| | 329| 6.26k|#if defined(BOTAN_HAS_ECDSA) 330| 6.26k| if(alg_name == "ECDSA") { ------------------ | Branch (330:7): [True: 6.26k, False: 0] ------------------ 331| 6.26k| return std::make_unique(alg_id, key_bits); 332| 6.26k| } 333| 0|#endif 334| | 335| 0|#if defined(BOTAN_HAS_ECDH) 336| 0| if(alg_name == "ECDH") { ------------------ | Branch (336:7): [True: 0, False: 0] ------------------ 337| 0| return std::make_unique(alg_id, key_bits); 338| 0| } 339| 0|#endif 340| | 341| 0|#if defined(BOTAN_HAS_DIFFIE_HELLMAN) 342| 0| if(alg_name == "DH") { ------------------ | Branch (342:7): [True: 0, False: 0] ------------------ 343| 0| return std::make_unique(alg_id, key_bits); 344| 0| } 345| 0|#endif 346| | 347| 0|#if defined(BOTAN_HAS_DSA) 348| 0| if(alg_name == "DSA") { ------------------ | Branch (348:7): [True: 0, False: 0] ------------------ 349| 0| return std::make_unique(alg_id, key_bits); 350| 0| } 351| 0|#endif 352| | 353| 0|#if defined(BOTAN_HAS_FRODOKEM) 354| 0| if(alg_name == "FrodoKEM" || alg_name.starts_with("FrodoKEM-") || alg_name.starts_with("eFrodoKEM-")) { ------------------ | Branch (354:7): [True: 0, False: 0] | Branch (354:33): [True: 0, False: 0] | Branch (354:70): [True: 0, False: 0] ------------------ 355| 0| return std::make_unique(alg_id, key_bits); 356| 0| } 357| 0|#endif 358| | 359| 0|#if defined(BOTAN_HAS_KYBER) || defined(BOTAN_HAS_KYBER_90S) 360| 0| if(alg_name == "Kyber" || alg_name.starts_with("Kyber-")) { ------------------ | Branch (360:7): [True: 0, False: 0] | Branch (360:30): [True: 0, False: 0] ------------------ 361| 0| return std::make_unique(alg_id, key_bits); 362| 0| } 363| 0|#endif 364| | 365| 0|#if defined(BOTAN_HAS_ML_KEM) 366| 0| if(alg_name.starts_with("ML-KEM-")) { ------------------ | Branch (366:7): [True: 0, False: 0] ------------------ 367| 0| return std::make_unique(alg_id, key_bits); 368| 0| } 369| 0|#endif 370| | 371| 0|#if defined(BOTAN_HAS_MCELIECE) 372| 0| if(alg_name == "McEliece") { ------------------ | Branch (372:7): [True: 0, False: 0] ------------------ 373| 0| return std::make_unique(alg_id, key_bits); 374| 0| } 375| 0|#endif 376| | 377| 0|#if defined(BOTAN_HAS_ECGDSA) 378| 0| if(alg_name == "ECGDSA") { ------------------ | Branch (378:7): [True: 0, False: 0] ------------------ 379| 0| return std::make_unique(alg_id, key_bits); 380| 0| } 381| 0|#endif 382| | 383| 0|#if defined(BOTAN_HAS_ECKCDSA) 384| 0| if(alg_name == "ECKCDSA") { ------------------ | Branch (384:7): [True: 0, False: 0] ------------------ 385| 0| return std::make_unique(alg_id, key_bits); 386| 0| } 387| 0|#endif 388| | 389| 0|#if defined(BOTAN_HAS_ED25519) 390| 0| if(alg_name == "Ed25519") { ------------------ | Branch (390:7): [True: 0, False: 0] ------------------ 391| 0| return std::make_unique(alg_id, key_bits); 392| 0| } 393| 0|#endif 394| | 395| 0|#if defined(BOTAN_HAS_ED448) 396| 0| if(alg_name == "Ed448") { ------------------ | Branch (396:7): [True: 0, False: 0] ------------------ 397| 0| return std::make_unique(alg_id, key_bits); 398| 0| } 399| 0|#endif 400| | 401| 0|#if defined(BOTAN_HAS_GOST_34_10_2001) 402| 0| if(alg_name == "GOST-34.10" || alg_name == "GOST-34.10-2012-256" || alg_name == "GOST-34.10-2012-512") { ------------------ | Branch (402:7): [True: 0, False: 0] | Branch (402:35): [True: 0, False: 0] | Branch (402:72): [True: 0, False: 0] ------------------ 403| 0| return std::make_unique(alg_id, key_bits); 404| 0| } 405| 0|#endif 406| | 407| 0|#if defined(BOTAN_HAS_SM2) 408| 0| if(alg_name == "SM2" || alg_name == "SM2_Sig" || alg_name == "SM2_Enc") { ------------------ | Branch (408:7): [True: 0, False: 0] | Branch (408:28): [True: 0, False: 0] | Branch (408:53): [True: 0, False: 0] ------------------ 409| 0| return std::make_unique(alg_id, key_bits); 410| 0| } 411| 0|#endif 412| | 413| 0|#if defined(BOTAN_HAS_ELGAMAL) 414| 0| if(alg_name == "ElGamal") { ------------------ | Branch (414:7): [True: 0, False: 0] ------------------ 415| 0| return std::make_unique(alg_id, key_bits); 416| 0| } 417| 0|#endif 418| | 419| 0|#if defined(BOTAN_HAS_XMSS_RFC8391) 420| 0| if(alg_name == "XMSS") { ------------------ | Branch (420:7): [True: 0, False: 0] ------------------ 421| 0| return std::make_unique(alg_id, key_bits); 422| 0| } 423| 0|#endif 424| | 425| 0|#if defined(BOTAN_HAS_DILITHIUM) || defined(BOTAN_HAS_DILITHIUM_AES) 426| 0| if(alg_name == "Dilithium" || alg_name.starts_with("Dilithium-")) { ------------------ | Branch (426:7): [True: 0, False: 0] | Branch (426:34): [True: 0, False: 0] ------------------ 427| 0| return std::make_unique(alg_id, key_bits); 428| 0| } 429| 0|#endif 430| | 431| 0|#if defined(BOTAN_HAS_ML_DSA) 432| 0| if(alg_name.starts_with("ML-DSA-")) { ------------------ | Branch (432:7): [True: 0, False: 0] ------------------ 433| 0| return std::make_unique(alg_id, key_bits); 434| 0| } 435| 0|#endif 436| | 437| 0|#if defined(BOTAN_HAS_HSS_LMS) 438| 0| if(alg_name == "HSS-LMS-Private-Key") { ------------------ | Branch (438:7): [True: 0, False: 0] ------------------ 439| 0| return std::make_unique(alg_id, key_bits); 440| 0| } 441| 0|#endif 442| | 443| 0|#if defined(BOTAN_HAS_SPHINCS_PLUS_WITH_SHA2) || defined(BOTAN_HAS_SPHINCS_PLUS_WITH_SHAKE) 444| 0| if(alg_name == "SPHINCS+" || alg_name.starts_with("SphincsPlus-")) { ------------------ | Branch (444:7): [True: 0, False: 0] | Branch (444:33): [True: 0, False: 0] ------------------ 445| 0| return std::make_unique(alg_id, key_bits); 446| 0| } 447| 0|#endif 448| | 449| 0|#if defined(BOTAN_HAS_SLH_DSA_WITH_SHA2) || defined(BOTAN_HAS_SLH_DSA_WITH_SHAKE) 450| 0| if(alg_name.starts_with("SLH-DSA-") || alg_name.starts_with("Hash-SLH-DSA-")) { ------------------ | Branch (450:7): [True: 0, False: 0] | Branch (450:43): [True: 0, False: 0] ------------------ 451| 0| return std::make_unique(alg_id, key_bits); 452| 0| } 453| 0|#endif 454| | 455| 0|#if defined(BOTAN_HAS_CLASSICMCELIECE) 456| 0| if(alg_name.starts_with("ClassicMcEliece")) { ------------------ | Branch (456:7): [True: 0, False: 0] ------------------ 457| 0| return std::make_unique(alg_id, key_bits); 458| 0| } 459| 0|#endif 460| | 461| 0| throw Decoding_Error(fmt("Unknown or unavailable public key algorithm '{}'", alg_name)); 462| 0|} pk_algs.cpp:_ZZN5Botan16load_private_keyERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEEENK3$_0clEv: 299| 6.26k| const std::string alg_name = [&]() -> std::string { 300| 6.26k| if(const auto name = alg_id.oid().registered_name()) { ------------------ | Branch (300:21): [True: 6.26k, False: 0] ------------------ 301| 6.26k| const std::vector alg_info = split_on(*name, '/'); 302| 6.26k| if(!alg_info.empty()) { ------------------ | Branch (302:13): [True: 6.26k, False: 0] ------------------ 303| 6.26k| return alg_info[0]; 304| 6.26k| } 305| 6.26k| } 306| | 307| 0| throw Decoding_Error( 308| 0| fmt("Private key decoding failed, no algorithm associated with {}", alg_id.oid().to_string())); 309| 6.26k| }(); _ZN5Botan22format_hex_fingerprintENSt3__14spanIKhLm18446744073709551615EEE: 47| 12.5k|std::string format_hex_fingerprint(std::span bits) { 48| 12.5k| const std::string hex = hex_encode(bits); 49| | 50| 12.5k| std::string fprint; 51| 12.5k| fprint.reserve(3 * bits.size()); 52| | 53| 338k| for(size_t i = 0; i != hex.size(); i += 2) { ------------------ | Branch (53:22): [True: 325k, False: 12.5k] ------------------ 54| 325k| if(i != 0) { ------------------ | Branch (54:10): [True: 313k, False: 12.5k] ------------------ 55| 313k| fprint.push_back(':'); 56| 313k| } 57| | 58| 325k| fprint.push_back(hex[i]); 59| 325k| fprint.push_back(hex[i + 1]); 60| 325k| } 61| | 62| 12.5k| return fprint; 63| 12.5k|} _ZN5Botan6PK_Ops22Key_Agreement_with_KDFC2ERKNS_31PK_Key_Agreement_Options_ReaderE: 85| 1.41k|PK_Ops::Key_Agreement_with_KDF::Key_Agreement_with_KDF(const PK_Key_Agreement_Options_Reader& options) { 86| 1.41k| if(options.using_kdf()) { ------------------ | Branch (86:7): [True: 0, False: 1.41k] ------------------ 87| 0| m_kdf = KDF::create_or_throw(options.kdf().value()); 88| 1.41k| } else if(!options.using_raw_shared_key()) { ------------------ | Branch (88:14): [True: 0, False: 1.41k] ------------------ 89| 0| throw Invalid_Argument( 90| 0| "Key agreement does not produce a uniform shared key, so a KDF must be specified (or the raw shared key " 91| 0| "explicitly requested)"); 92| 0| } 93| 1.41k|} _ZN5Botan6PK_Ops22Key_Agreement_with_KDFD2Ev: 95| 1.41k|PK_Ops::Key_Agreement_with_KDF::~Key_Agreement_with_KDF() = default; _ZN5Botan6PK_Ops22Key_Agreement_with_KDF5agreeEmNSt3__14spanIKhLm18446744073709551615EEES5_: 99| 1.41k| std::span salt) { 100| 1.41k| if(!salt.empty() && m_kdf == nullptr) { ------------------ | Branch (100:7): [True: 0, False: 1.41k] | Branch (100:24): [True: 0, False: 0] ------------------ 101| 0| throw Invalid_Argument("PK_Key_Agreement::derive_key requires a KDF to use a salt"); 102| 0| } 103| | 104| 1.41k| secure_vector z = raw_agree(other_key.data(), other_key.size()); 105| 1.41k| if(m_kdf) { ------------------ | Branch (105:7): [True: 0, False: 1.41k] ------------------ 106| 0| return m_kdf->derive_key(key_len, z, salt.data(), salt.size()); 107| 0| } 108| 1.41k| return z; 109| 1.41k|} _ZN5Botan24PK_Key_Agreement_OptionsD2Ev: 479| 2.83k|PK_Key_Agreement_Options::~PK_Key_Agreement_Options() = default; _ZN5Botan24PK_Key_Agreement_Options19with_raw_shared_keyEv: 492| 1.41k|PK_Key_Agreement_Options PK_Key_Agreement_Options::with_raw_shared_key() { 493| 1.41k| BOTAN_STATE_CHECK_MSG(!m_raw_shared_key, "PK_Key_Agreement_Options::with_raw_shared_key cannot be specified twice"); ------------------ | | 61| 1.41k| do { \ | | 62| 1.41k| if(!(expr)) \ | | ------------------ | | | Branch (62:10): [True: 0, False: 1.41k] | | ------------------ | | 63| 1.41k| Botan::throw_invalid_state(msg, __func__, __FILE__); \ | | 64| 1.41k| } while(0) | | ------------------ | | | Branch (64:12): [Folded, False: 1.41k] | | ------------------ ------------------ 494| 1.41k| BOTAN_STATE_CHECK_MSG(!m_kdf.has_value(), ------------------ | | 61| 1.41k| do { \ | | 62| 1.41k| if(!(expr)) \ | | ------------------ | | | Branch (62:10): [True: 0, False: 1.41k] | | ------------------ | | 63| 1.41k| Botan::throw_invalid_state(msg, __func__, __FILE__); \ | | 64| 1.41k| } while(0) | | ------------------ | | | Branch (64:12): [Folded, False: 1.41k] | | ------------------ ------------------ 495| 1.41k| "PK_Key_Agreement_Options::with_raw_shared_key cannot be combined with with_kdf"); 496| 1.41k| auto next = (*this); 497| 1.41k| next.m_raw_shared_key = true; 498| 1.41k| return next; 499| 1.41k|} _ZNK5Botan31PK_Key_Agreement_Options_Reader14using_providerEv: 511| 1.41k|bool PK_Key_Agreement_Options_Reader::using_provider() const { 512| 1.41k| note_examined(Option::Provider); 513| 1.41k| return provider_is_in_use(m_options.m_provider); 514| 1.41k|} _ZNK5Botan31PK_Key_Agreement_Options_Reader14options_in_useEv: 516| 1.41k|uint32_t PK_Key_Agreement_Options_Reader::options_in_use() const { 517| 1.41k| uint32_t in_use = 0; 518| | 519| 1.41k| const auto set_if = [&](bool cond, Option option) { 520| 1.41k| if(cond) { 521| 1.41k| in_use |= static_cast(option); 522| 1.41k| } 523| 1.41k| }; 524| | 525| 1.41k| set_if(m_options.m_kdf.has_value(), Option::Kdf); 526| 1.41k| set_if(m_options.m_raw_shared_key, Option::RawSharedKey); 527| 1.41k| set_if(provider_is_in_use(m_options.m_provider), Option::Provider); 528| | 529| 1.41k| return in_use; 530| 1.41k|} _ZNK5Botan31PK_Key_Agreement_Options_Reader19throw_if_unexaminedENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 532| 1.41k|void PK_Key_Agreement_Options_Reader::throw_if_unexamined(std::string_view algo_name) const { 533| 1.41k| const uint32_t unexamined = options_in_use() & ~m_examined; 534| | 535| 1.41k| if(unexamined != 0) { ------------------ | Branch (535:7): [True: 0, False: 1.41k] ------------------ 536| 0| throw_for_unexamined_options